#include <iostream>
#include <vector>
#include <cmath>
#include <cstdio>
using namespace std;
int main()
{
int a,n,i,j;
while(cin>>a>>n)
{
int sum[101] = {0};
int c;
for(i = 1;i <= n;i++){
c = 0;//进位
for(j = n;j >= n-i+1;j--){
if(sum[j] + a + c >= 10){
sum[j] = sum[j] + a + c - 10;
c = 1;
}
else{
sum[j] = sum[j] + a + c;
c = 0;
}
}
if(c == 1){
sum[j] = sum[j] + 1;
}
}
//输出
for(i = 0;i <= n;i++){
if(i == 0&&sum[i] == 0){
continue;
}
cout<<sum[i];
}
cout<<endl;
}
return 0;
}
九度1051:数字阶梯求和
最新推荐文章于 2018-07-03 16:53:43 发布