标签:des style blog http color io os ar java
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 422 Accepted Submission(s): 134
1 #include<cstdio> 2 #include<cstring> 3 char aa[50],bb[50]; 4 int ans[50]; 5 int mul( char *a, char *b, int temp[]) 6 { 7 8 int i,j,la,lb,l; 9 la=strlen(a); 10 lb=strlen(b); 11 12 for ( i=0;i<la+lb;i++ ) 13 temp[i]=0; 14 for ( i=0;i<=la-1;i++ ) { 15 l=i; 16 for ( j=0;j<=lb-1;j++ ) { 17 temp[l]=(b[j]-‘0‘)*(a[i]-‘0‘)+temp[l]; 18 l++; 19 } 20 } 21 while ( temp[l]==0 ) 22 l--; 23 for ( i=0;i<=l;i++ ) { 24 temp[i+1]+=temp[i]/10; 25 temp[i]=temp[i]%10; 26 } 27 if ( temp[l+1]!=0 ) 28 l++; 29 30 while ( temp[l]/10!=0 ) { 31 temp[l+1]+=temp[l]/10; 32 temp[l]=temp[l]%10; 33 l++; 34 } 35 if ( temp[l]==0 ) 36 l--; 37 return l; 38 } 39 void cal(__int64 a,char *str) 40 { 41 int i=0; 42 while(a>0) 43 { 44 str[i++]=(a%10)+‘0‘; 45 a/=10; 46 } 47 } 48 int main() 49 { 50 int cas; 51 __int64 n; 52 scanf("%d",&cas); 53 for(int i=1;i<=cas;i++) 54 { 55 scanf("%I64d",&n); 56 printf("Case #%d: ",i); 57 if(n==0)printf("1\n"); 58 else 59 { 60 memset(aa,‘\0‘,sizeof(aa)); 61 memset(bb,‘\0‘,sizeof(bb)); 62 memset(ans,0,sizeof(ans)); 63 //,(8*n-7)*n+1 64 cal(8*n-7,aa); 65 cal(n,bb); 66 int len=mul(aa,bb,ans); 67 ans[0]++; 68 int c=0; 69 for(int j=0;j<=len;j++) 70 { 71 ans[j]+=c; 72 if(ans[j]>9) 73 { 74 c=ans[j]/10; 75 ans[j]%=10; 76 } 77 } 78 if(c>0) 79 printf("%d",c); 80 for(int j=len;j>=0;j--) 81 printf("%d",ans[j]); 82 printf("\n"); 83 } 84 } 85 return 0; 86 }
hdu----(5047)Sawtooth(大数相乘+数学推导)
标签:des style blog http color io os ar java
原文地址:http://www.cnblogs.com/gongxijun/p/3997173.html