第一题:组队
import java.io.IOException;
public class Main {
public static void main(String[] args) throws IOException {
System.out.println(490);
}
}
![](https://i-blog.csdnimg.cn/blog_migrate/7d944e353d10eb1d0a498dba4087ea6d.png)
第二题:不同子串
import java.io.IOException;
import java.util.HashSet;
public class Main {
public static void main(String[] args) throws IOException {
//
// String s = "0100110001010001";
//
// HashSet<String> hst = new HashSet<>();
//
// for(int i = 0; i < s.length(); i++) {
// for(int j = i; j < s.length(); j++) {
// String c = s.substring(i, j+1);
// hst.add(c);
// }
// }
//
// System.out.println(hst.size());
System.out.println(100);
}
}
![](https://i-blog.csdnimg.cn/blog_migrate/a21853bfdc39ba83175c3dc7d9e914d0.png)
第三题:等差数列
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
static int N = (int)1e5 + 10;
static long[] a = new long[N];
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String[] s = br.readLine().split(" ");
for(int i = 1; i <= n; i++) {
a[i] = Long.parseLong(s[i-1]);
}
Arrays.sort(a, 1, n+1);
long d = (long)1e9;
for(int i = 1; i < n; i++) {
d = Math.min(a[i+1] - a[i], d);
}
if(d == 0) {
System.out.println(n);
return;
}
System.out.println((a[n]-a[1])/d + 1);
}
}
![](https://i-blog.csdnimg.cn/blog_migrate/103363e81f3dccd9e8634394c4b3ac75.png)
第四题:波动数列
没想到,下次评论还债