Online
赛亚人_1
开通博客发表自己的一些编程代码以及学习的一些感受,希望各位朋友能给予我一些宝贵的建议。
展开
-
online_judge_1473
#include #include void Reverse(int n){ if(n==0) printf("0"); else if(n==1) printf("1"); else { Reverse(n>>1); printf("%d",n%2); }}int main(){原创 2015-01-27 15:40:54 · 288 阅读 · 0 评论 -
online_judge_1474
#include #include int c[10][10];void Chengji(int **a,int n,int k){ int **b; int x,y,z,t; b=(int **)malloc(n*sizeof(int *)); for(x=0;x<n;x++) b[x]=(int *)malloc(n*sizeof(int原创 2015-01-27 19:35:32 · 342 阅读 · 0 评论 -
online_judge_1467
#include #include typedef struct BiTNode{ int data; struct BiTNode *lchild,*rchild;}BiTNode,*BiTree;int main(){ int n,t,i; int a[100]={0}; BiTree T=(BiTree)malloc(sizeof(BiTN原创 2015-01-27 15:25:40 · 324 阅读 · 0 评论 -
online_judge_1475
这道题目我测试了好多次都没问题,但是就是无法AC,十分愤怒。我编程习惯十分差,谁要是发现Bug。求指点!#include #include #include typedef struct SString{ char e[200];}SString;typedef struct IP{ int a; int b; int c; int d;原创 2015-01-27 23:26:14 · 300 阅读 · 0 评论 -
online_judge_1475改
#include #include #include typedef struct IP{ int a; int b; int c; int d;}IP;typedef struct S{ int len; IP source; IP destination; int source_port; int desti原创 2015-01-28 10:48:58 · 309 阅读 · 0 评论 -
online_judge_1476
#include #include #include int wangquan(int n){ int i; for(i=2;i<=sqrt(n);i++) if(n%(i*i)==0) return 1; return 0;}int main(){ int n=1; while(n!=0) {原创 2015-01-28 15:57:53 · 267 阅读 · 0 评论 -
online_judge_1477
#include #include void Reverse(int *a,int n,int k){ int i,t,m; for(i=0;i<k/2;i++) { t=a[i]; a[i]=a[k-i-1]; a[k-i-1]=t; } for(i=k;i<k+(n-k)/2;i++) {原创 2015-01-28 15:58:49 · 309 阅读 · 0 评论 -
online_judge_1178
#include #include #define M 1000int size;typedef struct Fushu{ int a; int b;}Fushu;void fupop(Fushu *c){ int i,t=0; int max=c[0].a*c[0].a+c[0].b*c[0].b; for(i=1;i<size;i++)原创 2015-01-26 17:43:43 · 383 阅读 · 0 评论 -
online_judge_1478
#include #include int max(int a,int b,int c){ return (a>b?a:b)>c?(a>b?a:b):c;}int main(){ int a=1,b,c; while(a!=0) { scanf("%d%d%d",&a,&b,&c); if(a10000||b>10000|原创 2015-01-28 16:11:42 · 284 阅读 · 0 评论 -
online_judge_1105
#include #include #include int main(){ char str[81]; int i; while(gets(str)!=NULL) { if(strcmp(str,"!")==0) break; for(i=0;str[i]!='\0';i++) {原创 2015-01-28 16:39:28 · 330 阅读 · 0 评论 -
online_judge_1106
#include #include int shuhe(int n){ int sum=0; while(n) { sum+=n%10; n/=10; } return sum;}int main(){ int n=1; while(n!=0) { scanf("%d",&原创 2015-01-28 16:47:48 · 313 阅读 · 0 评论 -
online_judge_1470
#include #include void swap(int *a,int *b){ int t; t=*a; *a=*b; *b=t;}int main(){ int n,i,j,k; int a[10][10],b[10]; while(scanf("%d",&n)!=EOF) { if(n10)原创 2015-01-28 11:19:09 · 368 阅读 · 0 评论 -
online_judge_1471
#include #include #include int main(){ char s1[101],s2[101],s[201]; int len1,len2,i,j,k; while(gets(s1)!=NULL) { gets(s2); len1=strlen(s1); len2=strlen(s2)原创 2015-01-28 11:55:24 · 291 阅读 · 0 评论 -
online_judge_1472
#include #include typedef struct Exp{ int xishu; int cishu;}Exp;int main(){ int m,n,i,j,k; Exp *a,*b,*c; while(scanf("%d",&m)!=EOF) { a=(Exp *)malloc(m*sizeof(Exp原创 2015-01-28 13:33:13 · 289 阅读 · 0 评论 -
online_judge_1472改
#include #include int main(){ int m,n,i,j,k,min; int a[2001]; while(scanf("%d",&m)!=EOF) { min=1001; for(i=0;i<2001;i++) a[i]=0; for(i=0;i<m;i++)原创 2015-01-28 14:12:09 · 316 阅读 · 0 评论 -
online_judge_1163
#include #include #include int isprime(int n){ int i; for(i=2;i<=sqrt(n);i++) if(n%i==0) return 0; return 1;}int main(){ int n,i; while(~scanf("%d",&n))原创 2015-01-30 10:10:44 · 313 阅读 · 0 评论 -
online_judge_1108
#include #include int main(){ int n=1,i,top; int a[10001]; char ch[10]; while(n!=0) { scanf("%d",&n); if(n10000) continue; top=0; fo原创 2015-01-28 22:45:30 · 349 阅读 · 0 评论 -
online_judge_1107
#include #include int main(){ int n=1,i,j; int *a; int min,pmin; int sum; while(n!=0) { scanf("%d",&n); if(n10000) continue; a=(int *)ma原创 2015-01-28 19:03:02 · 340 阅读 · 0 评论 -
online_judge_1109
#include #include #include typedef struct graph{ int v1; int v2;}Graph;int main(){ int n,m; Graph *a; int i,j,flag; int *b; while(scanf("%d%d",&n,&m)!=EOF&&n!=0)原创 2015-01-29 23:23:13 · 355 阅读 · 0 评论 -
online_judge_1166
#include #include int main(){ double x,result; int n,i; while(~scanf("%lf%d",&x,&n)) { if(n<0) continue; result=x; for(i=0;i<n;i++) r原创 2015-01-30 13:27:45 · 340 阅读 · 0 评论 -
online_judge_1167
#include #include int main(){ int n,i,j,min; int *a,*b; while(~scanf("%d",&n)) { if(n10000) continue; a=(int *)malloc(n*sizeof(int)); b=(int *)c原创 2015-01-30 13:59:20 · 408 阅读 · 0 评论 -
online_judge_1168
#include #include #include #include void del_dis(char *str,char *s){ int len=strlen(str),l=strlen(s); int i,j; for(i=0;i<len-l+1;i++) { for(j=0;j<l;j++) if(tol原创 2015-01-30 14:31:13 · 266 阅读 · 0 评论 -
online_judge_1164
#include #include int xuanzhuan(int a[][10],int b[][10],int n){ int i,j; int flag1=1,flag2=1,flag3=1,flag0=1; for(i=0;i<n;i++) for(j=0;j<n;j++) { if(a[i][j]!原创 2015-01-30 10:55:00 · 339 阅读 · 0 评论 -
online_judge_1165
#include #include #include #include int pipei(char *st,char *s,int len,int len1,int len2){ int i,flag=0; int l=strlen(st); if((len+len1-len2)!=l) return 0; for(i=0;i<len1;原创 2015-01-30 13:04:16 · 324 阅读 · 0 评论 -
online_judge_1052
#include int main(){ int n,i; int a[200]; while(scanf("%d",&n)!=EOF) { int m; if(n200) continue; for(i=0;i<n;i++) scanf("%d",&a[i]);原创 2015-01-18 23:41:09 · 437 阅读 · 0 评论 -
online_judge_1051
一千个读者心中就有一千个哈姆雷特。虽然我AC了这道题,但是代码还有很多不足之处,代码不简洁、不高效等等。欢迎大家批评指正,给予宝贵的建议!同时期待大家给出高效简洁的代码,一边学习交流!原创 2015-01-18 10:31:11 · 403 阅读 · 0 评论 -
online_judge_1054
#include #include #include int main(){ char str[201],ch; int i,j,k,len; while(gets(str)!=NULL) { len=strlen(str); for(i=0;i<len-1;i++) { k=i;原创 2015-01-18 23:54:31 · 408 阅读 · 0 评论 -
online_judge_1045
#include#define M 100int main(){ int n,x,y,z; while(scanf("%d",&n)!=EOF) { for(x=0;x<=M;x++) for(y=0;y<=M;y++) for(z=0;z<=M;z++) { if(15*x+9*y+z<=3*n&&x+y+z==M) printf("x原创 2015-01-19 16:48:45 · 316 阅读 · 0 评论 -
online_judge_1053
#include int main(){ int n,i; int a[20]; while(scanf("%d",&n)!=EOF) { int j=0,k=0,t; if(n20) continue; scanf("%d",&a[0]); int max=a[0];原创 2015-01-18 23:47:55 · 412 阅读 · 0 评论 -
online_judge_1055
#include #include #include int main(){ char str[201],ch; int len,i; while(gets(str)!=NULL) { len=strlen(str); for(i=0;i<len/2;i++) { ch=str[i];原创 2015-01-18 23:55:52 · 382 阅读 · 0 评论 -
online_judge_1056
#include int main(){ int m,n; int a,b,r; while(scanf("%d%d",&m,&n)!=EOF) { if(m<1||n<1) continue; a=(m>n)?m:n; b=(m<=n)?m:n; r=a%b;原创 2015-01-18 23:58:26 · 484 阅读 · 0 评论 -
online_judge_1047
#include#includeint main(){ int n,m,i; while(scanf("%d",&n)!=EOF) { m=(int)sqrt((float)n); if(n<=1) { printf("no\n"); continue; } for(i=2;i<=m;i++) if(n%i==0) { printf(原创 2015-01-19 16:52:34 · 285 阅读 · 0 评论 -
online_judge_1050
#includeint wanshu(int);int i,sum;int main(){ int n,j; while(scanf("%d",&n)!=EOF) { if(n<1) continue; for(j=1;j<=n;j++) { if(wanshu(j)) { if(j>6) printf(" %d",j); el原创 2015-01-19 16:59:30 · 341 阅读 · 0 评论 -
online_judge_1006
一千个读者就有一千个哈姆雷特,虽然这道题目我AC了,但是还有很多不足之处,很多编程习惯不好,欢迎大家批评指正!期待大家给出更简洁高效的代码。原创 2015-01-18 14:33:11 · 496 阅读 · 0 评论 -
online_judge_1057
#include int main(){ int a[20]; int i; while(scanf("%d",&a[0])!=EOF) { int b[10]={0},flag=0; int z,result; for(i=1;i<20;i++) scanf("%d",&a[i]);原创 2015-01-18 23:59:20 · 342 阅读 · 0 评论 -
online_judge_1048
#includeint main(){ int a,b,c; while(scanf("%d%d%d",&a,&b,&c)!=EOF) { if(a>=b+c||b>=a+c||c>=a+b||a<=0||b<=0||c<=0) continue; else if(a*a==b*b+c*c||b*b==a*a+c*c||c*c==a*a+b*b) printf("直角原创 2015-01-19 16:54:16 · 317 阅读 · 0 评论 -
online_judge_1046
#includeint main(){ int a[10],i,max; while(scanf("%d",&a[0])!=EOF) { max=a[0]; for(i=1;i<10;i++) { scanf("%d",&a[i]); if(max<a[i]) max=a[i]; } printf("max=%d\n",max); } retu原创 2015-01-19 16:51:24 · 365 阅读 · 0 评论 -
online_judge_1049
#include#include#define N 1000int main(){ char str[N],ch,ch1; char *p; int i,j; while(scanf("%s",str)!=EOF) { i=0;j=0; p=str; ch1=getchar(); scanf("%c",&ch); while(str[i]!='\0') {原创 2015-01-19 16:57:48 · 310 阅读 · 0 评论 -
online_judge_1489
#include int main(){ int a[2][3],b[3][2]; int i,j,k; while(scanf("%d",&a[0][0])!=EOF) { int c[2][2]={{0,0},{0,0}}; scanf("%d%d%d%d%d",&a[0][1],&a[0][2],&a[1][0],&a[1原创 2015-01-20 23:16:58 · 351 阅读 · 0 评论 -
online_judge_1488
#include #include int main(){ int m,n; m=pow(2,30)-1; n=300; printf("%d %d\n",n,m); return 0;}原创 2015-01-20 23:19:39 · 321 阅读 · 0 评论