//提醒自己不要忘记补题
这里写代码片
这里写代码片
这里写代码片
这里写代码片
这里写代码片
这里写代码片
这个题就是考二项式定理
$2^n = C(n,0)+C(n,1)+…C(n,n) $
注意取模要取正值而且中间结果会爆int
import java.io.*;
import java.util.*;
public class Main {
public static long mod = 1000000007;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int T = cin.nextInt();
while(T --> 0) {
long n = cin.nextInt();
System.out.println((quickMod(n)-1-n+mod)%mod);
}
}
public static long quickMod(long n) {
long ans = 1, a = 2;
while(n>0) {
if((n&1) == 1) ans=(ans*a)%mod;
a = (a*a)%mod;
n>>=1;
}
return ans%mod;
}
}
这里写代码片
这里写代码片
直接浮点数二分求下界而已, 难点在于题目很长
###AC代码
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
public static int a, b, c;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int T = cin.nextInt();
while(T --> 0) {
double R, x1, y1, H, x2, y2;
R = cin.nextDouble();
x1 = cin.nextDouble();
y1 = cin.nextDouble();
H = cin.nextDouble();
x2 = cin.nextDouble();
y2 = cin.nextDouble();
a = cin.nextInt();
b = cin.nextInt();
c = cin.nextInt();
double len = Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
double l = Math.abs(len-R), r = len+R;
double eps = 1e-8;
double ans; ans = -1.0;
for(int i = 0; i < 100; ++i) {
double mid = (l+r)/2;
if(check(mid)
签到题, 考虑下可能直接在圈子里面的情况就好啦
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static long mod = 1000000007;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int T = cin.nextInt();
while(T --> 0) {
double v, x1, y1, r, x2, y2;
v = cin.nextDouble();
x1 = cin.nextDouble();
y1 = cin.nextDouble();
r = cin.nextDouble();
x2 = cin.nextDouble();
y2 = cin.nextDouble();
double len = Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
if(len<=r) System.out.println(0.0);
else System.out.println(String.format("%.1f", (len-r)/v));
}
}
}
嗯,签到
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
public static long mod = 1000000007;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
// int T = cin.nextInt();
// while(T --> 0) {
int n = cin.nextInt();
if(n == 0)
System.out.println("000");
else if(n==1)
System.out.println("001\n010\n100");
else if(n==2)
System.out.println("011\n101\n110");
else if(n==3)
System.out.println(111);
// }
}
}