#include
#include int main() { int n; int i,j; double x,y; scanf("%d",&n); for(j=1;j { scanf("%lf%lf",&x,&y); x=3.14*(x*x+y*y); y=x/100.0; printf("Property %d: This property will begin eroding i
最近做了好长时间的题,发现效果不大。我做题总是慢悠悠的,mei
我想我不会放弃
#include int main() { int a,b; int i,j,k,max; int t; int x,y; while(scanf("%d%d",&a,&b)!=EOF) { max=0; if(a>b) { x=b; y=a; } else { x=a; y=b; } for(i=x;i { k=0; t=i; while(t)
#include #include #include using namespace std; int main() { queuep; p.push(1); p.push(2); p.push(3); printf("%d\n%d\n",p.front(),p.back()); p.pop(); printf("%d\n",p.front()); printf("%d\
#include #include #include using namespace std; int main() { char a,b,c; double x,y,z; double h,e; while(1) { cin>>a; if(a=='E') break; cin>>x>>b>>y; if(a=='T'&&b=='D') { e=6.11*exp(5
#include int a[10000]; int b[10000]; int c[10000]; int main() { int x,y,z; int i,j,k; int i1,i2,i3; for(i=2;i if(!a[i]) for(j=2*i;j a[j]=1; j=0; for(i=2;i if(!a[i]) { b[j++]=i; }
#include #include int main() { int a[55]; int b[55],c[55]; int i,j,k; char a1[111],b1[111]; while(scanf("%s%s",a1,b1)!=EOF) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); memset(c,0,sizeo
#include int i,j; scanf("%d",&c); while(c--) { scanf("%d",&n); for(i=1;i for(j=1;j
#includ
#include int a[1000010]; int main() { int i,j,k; int x,y,z; for(i=2;i if(!a[i]) for(j=2*i;j a[j]=1; a[1]=1; int n; while(1) { scanf("%d%d%d",&x,&y,&n); if(n+x+y==0) break; else {
#include #include
#include #include if(strcmp(a,"#")==0) break; for(i=0;i if(a[i]==' ') continue; else k+=(a[i]-'A'+1)*(i+1); printf(
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号