long f(int a, int n){
int result = 0;
for(int i=0; i
}
return result;
}
解释:
s(n) = a + a^2 + a^3 + ... + a^n
则
s(1) = (0+1) * a
s(2) = a + a^2 = (a+1)*a = (s(1) + 1) * a
...
s(n) = (s(n-1) + 1) * a
long f(int a, int n){
int result = 0;
int aa;
aa=a;
for(int i=0; i
aa=aa*10+a;
}
return result;
}