Pagini recente » Cod sursa (job #1421847) | Cod sursa (job #3151904) | Cod sursa (job #1492405) | Cod sursa (job #3031976) | Cod sursa (job #2604710)
#include <stdio.h>
#include <stdlib.h>
#define mod 1999999973
long exponential(long n, long p){
printf("%ld\n", n);
if(p == 1)
return n % mod;
if(p == 0)
return 1;
if(p % 2 == 1)
return (n % mod * (exponential((n % mod * n % mod) % mod, (p - 1)/ 2) % mod)) % mod;
else
return exponential((n % mod * n % mod) % mod, p / 2) % mod;
}
int main()
{
FILE* in = fopen("lgput.in", "r");
FILE* out = fopen("lgput.out", "w");
long n, p;
fscanf(in, "%ld %ld", &n, &p);
fprintf(out, "%ld", exponential(n, p));
printf("%\n\n%ld", 65536 * 65536);
return 0;
}