终极第十季修订版

91#include <stdio.h>#include <math.h>int main(){int n,m,i;double s,a;while((scanf("%d%d",&n,&m))!=EOF) {if(n==0&&m==0) break;s=0;for(i=1;i<n;i++){a=i*1.0/n*(n+m);s+=fabs(a-floor(a+0.5))/(n+m);}printf("%.4f\n",s*10000);}return 0;}92#include<stdio.h>int main(){int A[81],B[81],i,n,m=0,s=0;while(n!=-1){s=0;scanf("%d",&n);for(i=0;i<2*n;i++)scanf("%d",&A[i]);for(i=2*n-1;i>=3;i-=2)A[i]-=A[i-2];for(i=0;i<=2*n-2;i+=2)s=s+A[i]*A[i+1];B[m]=s;m++;}for(i=0;i<=m-2;i++)printf("%d\n",B[i]);return 0;}93#include <stdio.h>#include <math.h>int prime(int n){int i;if(n==1) return 0;if(n==2) return 1;for(i=2;i<=sqrt(n);i++)if(n%i==0) return 0;return 1;}int main(){int a,d,n;while(scanf("%d%d%d",&a,&d,&n)!=EOF){if(a==0&&d==0&&n==0)break;while(1){if(prime(a))n--;a+=d;if(n==0)break;}printf("%d\n",a-d);}return 0;}94#include<stdio.h>struct TEAM{char name[20];int a1;int t1;int a2;int t2;int a3;int t3;int a4;int t4;int x;int y;}t[100];int main(){int i,m,n;scanf("%d",&n);for(i=0;i<n;i++){scanf("%s %d %d %d %d %d %d %d %d",t[i].name,&t[i].a1,&t[i].t1,&t[i]. a2,&t[i].t2,&t[i].a3,&t[i].t3,&t[i].a4,&t[i].t4);t[i].x=t[i].y=0;if(t[i].t1) t[i].x++,t[i].y+=(t[i].a1-1)*20+t[i].t1;if(t[i].t2) t[i].x++,t[i].y+=(t[i].a2-1)*20+t[i].t2;if(t[i].t3) t[i].x++,t[i].y+=(t[i].a3-1)*20+t[i].t3;if(t[i].t4) t[i].x++,t[i].y+=(t[i].a4-1)*20+t[i].t4;}for(i=1,m=0;i<n;i++)if(t[m].x<t[i].x||(t[m].x==t[i].x&&t[m].y>t[i].y)) m=i;printf("%s %d %d\n",t[m].name,t[m].x,t[m].y);return 0;}95#include <stdio.h>#define PI 3.1415926int main(){int i,n;double year,x,y;scanf("%d",&n);for(i=0;i<n;i++){scanf("%lf%lf",&x,&y);year=PI*(x*x+y*y)/100;printf("%d %d\n",i+1,(int)year+1); }return 0;}96#include<stdio.h>int main(){int i,n,sum=0,ct=0,cs=0,a; for(i=2992;i<10000;i++){ n=i;while(i>0){a=i%10;sum=sum+a;i=i/10;}i=n;while(i>0){a=i%12;ct=ct+a;i=i/12;}i=n;while(i>0){a=i%16;cs=cs+a;i=i/16;}i=n;if((sum==ct)&&(sum==cs)) printf("%d\n",i);}return 0;}97#include <stdio.h>int main(){int n,a,b,sum,i,t;while(scanf("%d",&n)!=EOF&&n!=-1) {a=1,b=0,sum=0;for(i=0;i<n;i++){t=a;a=b+1;b=t+b;sum=a+b;}printf("%d %d\n",b,sum);}return 0;}98#include <stdio.h>int main(){char a[256];int i,sum;while(gets(a)&&a[0]!='#') {sum=0;for(i=0;a[i]!='\0';i++) if(a[i]!=' ')sum+=(i+1)*(a[i]-64); printf("%d\n",sum);}return 0;}99#include <stdio.h>int fun(int a){if(a==1) return 1;elsereturn fun(a/2)+1;}int main(){int a,x;while(scanf("%d",&a)&&a!=0) {x=fun(a);printf("%d\n",x);}return 0;}100#include <stdio.h>#include <math.h>#include <algorithm>#include <string.h>#include <stdlib.h>using namespace std;const int maxn = 10;int start[70];int end[70];long f(int* p,int i,int final){if(i==0)return 0;if(p[i] == final)return f(p,i-1,final);elsereturn (f(p,i-1,6-final-p[i])+(1L<<(i-1))); }int main(){int N,i,j=0;long A[100];int time = 0;while(scanf("%d",&N)==1){time++;if(N==0)break;for(i = 1;i<=N;++i)scanf("%d",&start[i]);for(i = 1;i<=N;++i)scanf("%d",&end[i]);int k=N;while(k>=1&&start[k]==end[k])k--;long sum = 0;if(k>=1){int other = 6-end[k] - start[k];sum = f(start,k-1,other)+f(end,k-1,other)+1; }A[j]=sum;j++;}for(i=0;i<j;i++)printf("%ld\n",A[i]);return 0;}101#include <stdio.h>int main(){int a[16],b[16],i=0,j,k,count=0;scanf("%d",&a[i]);while(a[i]!=0){if(a[i]%2==1)b[i]=0;elseb[i]=a[i]/2;i++;scanf("%d",&a[i]);}for(j=0;j<i;j++)for(k=0;k<i;k++)if(a[j]==b[k]){count++;break;}printf("%d\n",count); return 0;}102#include <stdio.h>#include <math.h>int prime(int n){int i;if(n==1) return 0;if(n==2) return 1;for(i=2;i<=sqrt(n);i++)if(n%i==0) return 0;return 1;}int main(){int a,d,n;while(scanf("%d%d%d",&a,&d,&n)!=EOF){if(a==0&&d==0&&n==0)break;while(1){if(prime(a))n--;a+=d;if(n==0)break;}printf("%d\n",a-d);}return 0;}103#include <stdio.h>#include <stdlib.h>#include <string.h>#define L 70int cutnum; // 木棍的数量int cutlen[ L ], totlen; // 木棍的各自长度，及总长度int cmp( const void *pa, const void *pb) {return (*((int*)pb)) - (*((int*)pa));}int orglen, orgnum; // 原始木棍的长度及其数量int used[ L ]; // dfs 时标记某木棍是否已经被用于组装原始木棍//int choice[ L ];// 尝试拼装某原始木棍，// 此次尝试之前，// 已经使用了t 根木棍，// 已经拼装出了原始木棍的部分长度，剩余c 长度需要拼装，// 此次尝试，只需要从第b 根木棍开始。