摘要: #include#includeint main(void){ int i,index; int a[10]; scanf("%d",&a[10]); index=0; for(i=1;i<10;i++){ if(fabs(a[i])<fabs(a[index])){ index=i; } } int temp; temp=a[index]; a[index]=a[9]; a[9]=temp; for(i=0;i<10;i++) printf("%d",a[9]); return 0;} 阅读全文
posted @ 2013-12-12 09:56 huangsilinlana 阅读(100) 评论(0) 推荐(0) 编辑
摘要: #includeint isprime(int i);int main(void){ int m,n,i; double sum; scanf("%d %d",&m,&n); for(i=m;in/2&&n!=1){ product=product+i; } } return product;} 阅读全文
posted @ 2013-12-12 09:35 huangsilinlana 阅读(137) 评论(0) 推荐(0) 编辑
摘要: #includeint main(void){ int n,i,a; double sum; scanf("%d",&n); a=0; for(i=3;i<=n;i++){ scanf("%d",&n); a=a+3; if(a%3==0){ sum=sum+2; } else if(n==0){ sum=sum-1; } printf("%.f\n",sum); } return 0;} 阅读全文
posted @ 2013-12-12 09:21 huangsilinlana 阅读(125) 评论(0) 推荐(0) 编辑
摘要: #include#includeint main(void){ int m,n,x; int a,b,c; double d; scanf("%d %d",&m,&n); while(scanf("%d%d",&m,&n)!=EOF&&m>=100&&n>=m&&n<=999){ scanf("%d %d",&m,&n); x=m+1; a=x/100; b=x/10%10; c=x%10; d=pow(a,3)+pow( 阅读全文
posted @ 2013-12-12 08:50 huangsilinlana 阅读(110) 评论(0) 推荐(0) 编辑
摘要: #include int main(void) { int n,i,j,a,b,c,d; int a[4][4]; scanf("%d %d %d",&n,&i,&j); a=0; b=0; for(i=1;i<=4;i++){ a=a+1; b=b+1; printf("(i,%d)",a); printf("(%d,j)",b); } for(i=1;i<=4;i++) for(j=1;j<=4;j++) i=i-1; 阅读全文
posted @ 2013-12-09 09:46 huangsilinlana 阅读(118) 评论(0) 推荐(0) 编辑
摘要: #includeint main(void){ int m,n,i; double h,s; scanf("%d %d",&m,&n); s=0; for(i=1;i<=n;i++){ s=s+m; m=m/2; s=s+m; } h=m; printf("%.2f %.2f",h,s); return 0;} 阅读全文
posted @ 2013-12-09 09:32 huangsilinlana 阅读(75) 评论(0) 推荐(0) 编辑
摘要: #includeint main(void){ int count,number; int a,b,c,d,e; count=0; scanf("%d",&number); do{ number=number/10; count++; }while(number!=0); if(count=1){ a=number; printf("%d\n",count); printf("%d",a); } else if(count=2){ a=number/10; b=number-a*10; printf("%d\n&qu 阅读全文
posted @ 2013-12-09 09:03 huangsilinlana 阅读(95) 评论(0) 推荐(0) 编辑
摘要: #includeint main(void){ int i,j,k,m,n; int a[6][6]; int sum=0; scanf("%d",&k); scanf("%d %d",&m,&n); for(i=0;i<m;i++) for(j=0;j<n;j++) scanf("%d",&a[m][n]); for(i=0;i<m;i++) sum=0; for(j=0;j<=n-1;j++) sum=sum+a[i][j]; printf("%d %d %d&qu 阅读全文
posted @ 2013-12-02 09:56 huangsilinlana 阅读(138) 评论(0) 推荐(0) 编辑
摘要: #includeint main(void){ int m,denominator,flag,i,n,j; double item,sum; scanf("%d",&m); while(n<=m){ scanf("%d",&n); } flag=1; denominator=1; sum=0; for(i=1;i<m;i++) for(j=1;j<n;j++){ item=flag*1.0/denominator; sum=sum+item; flag=-flag; denominator=denominator+1; 阅读全文
posted @ 2013-12-02 09:17 huangsilinlana 阅读(131) 评论(0) 推荐(0) 编辑
摘要: #includeint main(void){ int m,n,a,b,k,temp,i; scanf("%d",&k); scanf("%d %d",&m,&n); for(i=0;im){ temp=m; m=n; n=temp; } } b=n; while(b%m!=0){ b=b+n; } a=m%n; while(a!=0){ m=n; n=a; a=m%n; } printf("Greatest common divisor is: %d\n",a); printf("Least com 阅读全文
posted @ 2013-11-28 11:55 huangsilinlana 阅读(141) 评论(0) 推荐(0) 编辑