摘要:
卡特兰数的模拟。CODE:#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>usingnamespacestd;#defineMAX101#defineBASE10000inta[101][MAX];voidmultiple(inta[],intsize,intb){inti,j;intcarry=0;for(i=size-1;i>=0;i--){carry+=a[i]*b;a[i]=carry%BASE;carry=carry/BASE;}return 阅读全文
posted @ 2012-07-22 17:40
有间博客
阅读(232)
评论(0)
推荐(0)
摘要:
数学题,用hash记录元素出现次数,有重复那么马上退出。循环次数最多为mod次就可以判断是否重复。CODE:#include<stdio.h>#include<stdlib.h>#include<string.h>usingnamespacestd;constintmaxn=100001;inthash[maxn];intmain(){intstep,mod;while(~scanf("%d%d",&step,&mod)){inti;intflag=0;intans=0;memset(hash,0,sizeof(hash) 阅读全文
posted @ 2012-07-22 15:27
有间博客
阅读(313)
评论(0)
推荐(0)
摘要:
简单模拟题。CODE:#include<stdio.h>#include<stdlib.h>#include<string.h>#include<ctype.h>usingnamespacestd;constintmaxn=201;intM1,M2,R1,R2,R3;chars[maxn];intmain(){while(~scanf("%d%d",&M1,&M2)){inti,j;R1=R2=R3=0;scanf("%s",s);intl=strlen(s);for(i=0;i<l; 阅读全文
posted @ 2012-07-22 10:28
有间博客
阅读(144)
评论(0)
推荐(0)