杭电acm1405-2200(8)

printf(\ %d\\n\ else

printf(\

for(j=0;j

if(b<=9)

printf(\ %d\ else

printf(\ for(i=0;i<3*n-6;i++) printf(\ if(a<=9)

printf(\ %d\\n\ else

printf(\ }

for(i=0;i

printf(\ %d\ else

printf(\ if(a<=9)

printf(\ %d\\n\ else

printf(\ }

return 0; }

2156:

#include

#define MAXN 110000 double a[MAXN];

int main() {

int n,i,x;

double ans,mul; a[1]=1;

for(i=2;i

a[i]=1/(double)i; }

while(scanf(\ {

ans=0; mul=1; x=2;

for(i=n-1;i>0&&x

ans+=i*a[x++]; }

ans=ans*2+(double)n; printf(\ }

return 0; }

2161：

#include #include bool prime[16010]; void list() {

memset(prime,true,sizeof(prime)); int i,j;

for(i=2;i<=16000;i++) if(prime[i])

for(j=i*2;j<=16000;j+=i) prime[j]=false; prime[1]=prime[2]=false; }

int main() {

list(); int n,a=1;

while(scanf(\ {

printf(\

puts(prime[n]?\ }

return 0; }

2162：

#include int main()

{

int n,i,a,sum,t=1;

while(scanf(\ {

if(n<=0)break; sum=0;

for(i=0;i

scanf(\ sum+=a; }

printf(\ t++; }

return 0; }

2164：

#include void main() { int x,y,t,n; char p[3]; scanf(\ while(t--) { scanf(\ x=0;y=0; while(n--) { gets(p); if((p[0]=='R')&&(p[2]=='P')) y++; if((p[0]=='R')&&(p[2]=='S')) x++; if((p[0]=='P')&&(p[2]=='R')) x++; if((p[0]=='P')&&(p[2]=='S')) y++; if((p[0]=='S')&&(p[2]=='R')) y++; if((p[0]=='S')&&(p[2]=='P')) x++; }

}

}

if(x==y) printf(\if(x>y) printf(\if(x

2178：

#include int main(void) {

int T,n,i; __int64 m;

scanf(\ while(T--) {

scanf(\ m=1; for(i=0;i

printf(\ } }

2186：

#include main() {

int n,a,b,c,sum,m,x,y,z; scanf(\ while(m--) {

scanf(\ sum=0; a=n/2; b=(n-a)*2/3; c=n-a-b; x=a/10+(a>=1?1:0); y=b/10+(b>=1?1:0); z=c/10+(c>=1?1:0); sum+=x+y+z; printf(\ } } 2200:

#include using namespace std; #define max 60 __int64 f[max+10]; __int64 pow(int n) {

__int64 i,sum=1; for(i=1;i<=n;i++) sum*=2; return sum; }

int main() {

__int64 n,i; f[1]=1;f[2]=1;

for(i=3;i

while(scanf(\ { printf(\ }

return 0; }