L1-080 乘法口诀数列
#include<bits/stdc++.h>
using namespace std;
int p[2000];
int main(){
int a1,a2,n;
cin>>a1>>a2>>n;
int t=0;
p[0]=a1;
p[1]=a2;
for(int m=2,d=2;m<=n;m++,d++){
int sum=p[m-1]*p[m-2];
if(sum<=9) p[d]=sum;
else{
p[d]=sum/10;
p[++d]=sum%10;
}
}
for(int i=0;i<n;i++){
cout<<p[i];
if(i!=n-1) cout<<" ";
}
}