Pagini recente » Cod sursa (job #1146861) | Cod sursa (job #1671233) | Cod sursa (job #927019) | Cod sursa (job #276928) | Cod sursa (job #538639)
Cod sursa(job #538639)
#include<cstdio>
const int mod = 9901;
using namespace std;
int i , a , b , n , ans;
int power (int b){
int i , ans = 1 , n = a % mod;
for( i = 0 ; (1 << i) <= b ; ++i ) {
if ( b & (1 << i))
ans *= n , ans %= mod;
n *= n , n %= mod;
}
return ans;
}
int sum (int b) {
if ( b == 1 ) return a % mod;
if ( b & 1 )
return (sum(b - 1) + power(b)) % mod;
return (power(b / 2) + 1) * sum(b / 2) % mod;
}
int main()
{
freopen("sumdiv.in","r",stdin);
freopen("sumdiv.out","w",stdout);
scanf("%d %d",&a,&b);
printf("%d\n", (sum(b) + 1) % mod);
return 0;
}