2014年04月_hpu刘

12月 11月 10月 09月 08月 07月 05月 04月 03月 02月 01月

原创 nyoj-846-ST And BE

#include int main() {int s,n,m,key;scanf("%d",&s);while(s--){int low,top,t,k=0;scanf("%d%d%d",&n,&m,&key);low=n;top=m;while(top>=low){t=(low+top)/2;k++;if(t==key) break;

2014-04-28 22:45:53 450

原创 nyoj-555-相反输出

#include#includechar b[400];int main(){int i,j,k,n;while(gets(b)!=NULL){int a[200]={0};n=strlen(b);for(k=0,i=0;iif(b[i]!=' '){j=0;while(b[i+j]!=' '&&i+j{a[k]=a[k]*10+b[

2014-04-28 12:01:33 695

原创 nyoj-556-最大公约数

#includeint gcd(int x,int y){int t;if(x>y){t=x;x=y;y=t;}while(x){t=y%x;y=x;x=t;}return y;}int main(){int a,b;while(scanf("%d,%d",&a,&b)!=EOF)printf("%d\n",g

2014-04-28 11:26:43 483

原创 nyoj-553-字符出现的次数

#includechar a[200];int main(){while(gets(a)!=NULL){int i,sum=0;for(i=0;a[i]!='\0';i++)if(a[i]=='a') sum++;printf("%d\n",sum);}return 0;}

2014-04-28 11:14:54 453

原创 nyoj-552-小数阶乘

#includeint main(){int m;while(scanf("%d",&m)!=EOF){int i,sum=1;for(i=2;isum*=i;printf("%d\n",sum);}return 0;}

2014-04-28 11:11:03 542

原创 nyoj-550-三位数逆序输出

#includeint main(){char a,b,c;while(scanf("%c%c%c",&a,&b,&c)!=EOF){getchar();printf("%c%c%c\n",c,b,a);}return 0;}

2014-04-28 11:02:26 506

原创 nyoj-613-免费馅饼

#include#include#define max(a,b) (a)>(b)?(a):(b)int a[100003][12];int main(){ int n,x,t; while(scanf("%d",&n)&&n) { int i,j,k=0; memset(a,0,sizeof(a));

2014-04-27 17:36:10 379

原创 nyoj-830-旋转坐标系

#include#includeint main(){ int s; double x1,x2,y1,y2,a1,a2; scanf("%d",&s); while(s--) { double x,y; scanf("%lf%lf%lf%lf",&x1,&y1,&a1,&a2); x

2014-04-27 11:31:18 451

原创 nyoj-874-签到

#includeint a[21]={0,1,2,3,4,10,11,12,13,19,20,21,22,28,29,30,31,37,38,39,40};int main(){ int n,m; while(scanf("%d%d",&m,&n)!=EOF) { printf("%d\n",m+a[n]); } re

2014-04-26 21:55:25 462

原创 nyoj-826-My Summary

#include#includeint a[12];int main(){ int s,n,t; char c,d[7]; scanf("%d",&s); while(s--) { int i,j; memset(a,0,sizeof(a)); scanf("%d",&n);

2014-04-26 21:07:49 366

原创 nyoj-819-奶牛

#include#includechar a[103];int main(){ int n; while(scanf("%s",a)!=EOF) { int i,j,t=0; for(i=0;a[i]!='\0';i++) if(a[i]=='c') t++; if(t%2!=0)

2014-04-26 20:17:37 503

原创 nyoj-834-组队

#includeint main(){ int n,a[53]; while(scanf("%d",&n)!=EOF) { int i,j,k,b,c,d,max=0; for(i=1;i scanf("%d",&a[i]); for(i=1;i for(j=i+1;j

2014-04-26 19:46:08 545

原创 nyoj-835-吉他练习

#include#includechar a[205],b[5]={'C','A','m','E','m'};int main(){ int n,i,j; while(scanf("%s",a)!=EOF) { n=strlen(a); for(i=j=0;i { if(j

2014-04-26 19:26:15 563

原创 nyoj-812-水题~~

#includeint main(){ int n,a[33]; while(scanf("%d",&n)!=EOF) { int i,k,sum=0,t,m; for(i=0;i { scanf("%d",&m); k=0; t

2014-04-26 19:13:18 441

原创 nyoj-829-数字分割

#include#includechar a[105];int main(){ while(scanf("%s",a)!=EOF) { int n,b=0,i,j,t1=0,t2=0,k=0,count1,count2,sum=0; n=strlen(a); for(i=0;i if

2014-04-26 11:25:06 816

原创 nyoj-816-它合法吗？

#includeint main(){ char a[12]; while(scanf("%s",a)!=EOF) { int i; for(i=0;a[i]!='\0';i++) if(a[0]>='0'&&a[0] else if(a[i]=='_'||a[i]>='a'&&a[i]=

2014-04-25 21:52:19 472

原创 nyoj-836-画图

#includeint main(){ int s,n; scanf("%d",&s); while(s--) { int i,j; scanf("%d",&n); for(i=0;i { for(j=0;j printf("*");

2014-04-25 21:42:08 366

原创 nyoj-809-摸底

#include#includeint cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int main(){ int s,a[7]; scanf("%d",&s); while(s--) { int i; dou

2014-04-25 21:26:14 432

原创 nyoj-842-整除的尾数

#includeint main(){ int a,b; while(scanf("%d%d",&a,&b)&&a+b) { int i; a*=100; for(i=0;i if((a+i)%b==0) printf("%02d " ,i); printf("\n");

2014-04-25 21:15:09 591 2

原创 nyoj-840-吃花生

#include#includeint cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int main(){ int s,a[7]; char b[10]; scanf("%d",&s); while(s--) { in

2014-04-25 21:03:33 413

原创 nyoj-831-签到

#includeint main(){ int n; while(scanf("%d",&n)!=EOF) { int i,t,sum=0; for(i=0;i { scanf("%d",&t); sum+=t; } t

2014-04-25 20:48:51 381

原创 nyoj-465-最大值和最小值

#include#include#includechar a[103];int cmp(const void *a,const void *b){ return *(char *)a-*(char *)b;}int main(){ int s; scanf("%d",&s); while(s--) {

2014-04-25 20:42:32 471

原创 nyoj-160-DNA Sorting

#include#includestruct in { int x; char a[55];}b[103];int cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int main(){ int n,m; while(scanf("%d%

2014-04-25 20:04:16 448

原创 hdu-1176-免费馅饼

#include#include#define fmax(b,c) (b)int a[100003][13];int main(){ int n; while(scanf("%d",&n)&&n) { int b,c,i,j,k=0; memset(a,0,sizeof(a)); for(i=0

2014-04-25 16:28:55 447

原创 hdu-1058-Humble Numbers

#includeint mp[5845];int min(int a,int b,int c,int d){ int t; t=(a t=(t t=(t return t;}int main(void){ int n,t,t1,t2,t3,t4; mp[1]=t=t1=t2=t3=t4=1; while(mp[t]

2014-04-25 14:58:53 355

原创 hdu-1087-Super Jumping! Jumping! Jumping!

#include//#includeint a[1003][2];int main(){ int n; while(scanf("%d",&n)&&n) { int i,j,max=0; //memset(a,0,sizeof(a)); for(i=0;i {

2014-04-25 11:32:46 337

原创 nyoj-879-Consecutive sum II

#includeint main(){ int s; scanf("%d",&s); while(s--) { long long n; scanf("%lld",&n); printf("%lld %lld\n",n*n*n,(n+1)*(n+1)*(n+1)); } ret

2014-04-24 15:12:22 400

原创 nyoj-317-兔子的烦恼（二）

#includeint gcd(int x,int y){ int t; if(x>y) { t=x; x=y; y=t; } while(x) { t=y%x; y=x; x=t; } return y

2014-04-20 19:29:27 548

原创 nyoj-972-核桃的数量

#includeint gcd(int x,int y){ int t; if(x>y) { t=x; x=y; y=t; } while(x) { t=y%x; y=x; x=t; } return y

2014-04-20 09:34:14 408

原创 nyoj-1003-平面分割

#includeint main(){int n;while(scanf("%d",&n)!=EOF){if(n==0) printf("1\n");else printf("%d\n",4*n*n-4*n+2);}return 0;}

2014-04-18 20:34:32 405

原创 nyoj-733-万圣节派对

/*#include#include#includeint a[6];int men(){ int j,g=1; for(j=1;j if(a[j]-a[j-1]>4||a[j-1]-a[j]>4) { g=0; break; } for(j=2;j if(a[j-2]==a[j]&&a[j-1]==a[j

2014-04-12 14:56:53 480

原创 nyoj-944-蚂蚁的腿

#includeint a[1000005]={0};int main(){ int i,j,n,s; a[1]=1; for(i=2;i for(j=i+i;j a[j]=1; scanf("%d",&s); while(s--) { scanf("%d",&n); if(n==0) printf("6\n"); e

2014-04-12 10:12:27 460

原创 nyoj-966-选择不相交区间

#include#includestruct { int x,y;}mp[1005];int cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}void swith(int i){ int t; t=mp[i].y; mp[i].y=mp[i].x; mp[i].x

2014-04-12 09:51:21 401

原创 nyoj-170-网络的可靠性

#include#includeint a[10010];int main(){ int n; while(scanf("%d",&n)!=EOF) { int i,b,c,sum=0; memset(a,0,sizeof(a)); for(i=1;i { scanf("%d%d",&b,&c); a[b]++; a[c]

2014-04-12 09:18:03 465