qq641542616的专栏

#include/** * created by:shishuai * QQ:641542616 * 函数功能：对多组相同位数的数字字符数组进行排序 * 函数实现方法：基数排序 * 时间复杂度：O(n) * 参数n：待排序的数字字符数组的位数 * 参数(*a)[n]：待排序的数字字符数组 * 参数p：待排序的起始数组 * 参数q：待排序的终止数组 */void base_sort(int n,ch

#includeint main(void){ int n,i,j,k,l; while(scanf("%d",&n)!=EOF){ char in[n],out[n],c; for(i=0;i<n;i++){ while((c=getchar())=='\n') continue; in[i]=c; out[i]='\0'; } i=0; j=

#includeint main(void){ int p,e,i,d,n=1,sum; while(scanf("%d%d%d%d",&p,&e,&i,&d)!=EOF&&p!=-1) { sum=1; p%=23; e%=28; i%=33; while(sum%23!=p||sum%28!=e||sum%33!=i) sum++; if(su

#includeint main(void){ double a,sum; while(scanf("%lf",&a)!=EOF&&a!=0){ sum=0; int i=1; sum+=1/(double)(i+1); while(sum<a){ i++; sum+=1/(double)(i+1); } printf("%d card(s)\n",i);

#includevoid push(__int64* heap,__int64 n);__int64 pop(__int64* heap);int main(void){ __int64 n,i,heap[20000],min1,min2,sum; scanf("%I64d",&n); __int64 a[n]; heap[0]=0; sum=0; for(i=0;i<n;i++

#include int main(void) { __int64 a,b,c,sum; while(scanf("%I64d",&a)!=EOF){ sum=0; c=9223372036854775807; for(b=a+1;b<=((double)a*b+1)/(b-a);b++){ if((a*b+1)%(b-a)==0&&(a*b+1)/(b-a)<c){

#include#includeint haab_change(char *a);int main(void){ int n; char tzolkin[20][10]={ {'i','m','i','x','\0'}, {'i','k','\0'}, {'a','k','b','a','l','\0'},

#includeint main(void){ double x,y; int n; while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;i++){ scanf("%lf%lf",&x,&y); int j=0; while(100*j/3.14159265<x*x+y*y) j++; printf("Property

#include#includeint main(void){ int n,m; char c; while(scanf("%d %d",&n,&m)!=EOF){ char a[n*(n+1)/2]; __int64 b[(n+2)*(n+1)/2]; for(int i=0;i<n*(n+1)/2;i++){ while((c=getchar())=='\n'||c

#include int main(){ int k; for(;;) { scanf("%d",&k); if(!k) break; switch(k) { case 1:printf("2\n");break; case 2:printf(

#includeint main(void){ int m,n; scanf("%d%d",&n,&m); int a[m][n+1],b[n],c; for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { while((c=getchar())==' '||c=='\n') continue;

#includeint main(void){ double a[12],sum=0; for(int i=0;i<12;i++){ scanf("%lf",&a[i]); sum+=a[i]; } printf("$%.2f\n",sum/12); return 0;}

#include#includeint compare_string(char*,char*);void base_sort(char (*a)[7],int p,int q);int main(void){ long n; while(scanf("%ld",&n)!=EOF){ char c,a[n][7]; int b[n],index=0; getchar();

#includevoid push(__int64* heap,__int64 n);__int64 pop(__int64* heap);void init(__int64* heap);void quiksort(__int64 a[][2],__int64 low,__int64 high);int main(void){ __int64 n,l,p,i,k,heap[10000

#includeint main(void){ __int64 len,n,N,min,max,i,j,max_ant,min_ant; scanf("%I64d",&N); for(j=1;j<=N;j++){ scanf("%I64d%I64d",&len,&n); __int64 ant[n]; for(i=0;i<n;i++) scanf("%I64d",&ant

#includeint main(void){ __int64 r,n,i,j,k; while(scanf("%I64d%I64d",&r,&n)!=EOF&&r!=-1&&n!=-1){ __int64 L[n],sum=0; for(i=0;i<n;i++) scanf("%I64d",&L[i]); for(i=0;i<n-1;i++){ for(j=i+1;

#includeint main(void){ int a,count=0,b; while(scanf("%d",&a)!=EOF&&a!=0) { b=a+1; count=count_of_1(a); while(count!=count_of_1(b)) b++; printf("%d\n",b); } return 0;}

最近几天，AlphaGo与围棋世界冠军李世石的对弈引起了全世界的关注，已然成了历史性的事件。今天下午第四场比赛结束，由于AlphaGo程序出现bug，使得李世石获得了唯一的一次胜利。这自然凸显出人工智能的强大，大家觉得，计算机的计算速度之快，只要遍历完所有可能的情况，自然会胜过人类。其实，这是没有真正理解围棋困难程度的表现。AlphaGo与李世石的对局