星空永恒

#include #include #include using namespace std; int main() { double v[11000],pi; int n,f,ri; int i; int t; pi=4.0*atan(1.0); scanf("%d",&t); while(t--) { scanf("%d%d",&n,&f); for(i=0;i<=n

#include #include #include int main() { long long n,sum; int t; scanf("%d",&t); while(t--) { scanf("%lld",&n); sum=pow(2,n)-1; printf("%lld\n",sum); } return 0; }

#include #include using namespace std; int n,k; double len[10010]; /*int judge(double s) { int cnt=0; for(int i=1;i<=n;i++) { cnt+=(int)(len[i]/s); } if(cnt>=k) return 1; else return 0; }

#include #include #include #include using namespace std; double l,w; double g(double x) { return 12*x*x-4*(l+w)*x+l*w; } int main() { int t; double left,right,mid; int k=1; scanf("%d",&t); whi

#include #include #include double r,m,l; double Y; int t; double f( double x ) { return 8*pow(x, 4.0) + 7*pow(x, 3.0) + 2*pow(x, 2.0) + 3*x + 6; } int main() { scanf("%d",&t); while(t--) {

#include //记得求导 #include #include #include int t; double y; double r,m,l; double ans; double f1(double x) { return 42*pow(x,6.0)+48*pow(x,5.0)+21*pow(x,2.0)+10*x-y; } double f2(double x) { retu

Sumsets Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10026   Accepted: 2743 Description Given S, a set of integers, find the largest d such that a + b + c