简化版大数乘法
Description So far he has not made up his mind about the total amount of CDs and the number of nephews. Indeed,a given nephew may receive no CDs at all. Please help dear Uncle Jack,given the total number of CDs and the number of nephews,to calculate the number of different ways to distribute the CDs among the nephews. Input Output Sample Input #include <cstdio> #include <iostream> #include <cstring> using namespace std; int n,m; void solve() { int s[50]; memset(s,0,sizeof s); s[0]=1; int up=1; for(int i=0;i<m;i++) { for(int j=0;j<up;j++)//现将每一位的结果算出来,在进行进位,可避免将进位后的新高位又算一遍 { s[j]*=n; // cout<<"s[j]"<<s[j]; } for(int j=0;j<up;j++) { if(s[j]>9) { s[j+1]+=s[j]/10; s[j]%=10; if(j==up-1) up++; } } // cout<<"****up="<<up<<endl; } for(int i=up-1;i>=0;i--) printf("%d",s[i]); puts(""); } int main() { while(scanf("%d%d",&n,&m)&&(n||m)) { if(n==10) { printf("1"); for(int i=0;i<m;i++) printf("0"); puts(""); continue; } solve(); } return 0; } 【免责声明】本站内容转载自互联网,其相关言论仅代表作者个人观点绝非权威,不代表本站立场。如您发现内容存在版权问题,请提交相关链接至邮箱:bqsm@foxmail.com,我们将及时予以处理。 |