Cod sursa(job #981153)

Utilizator petrutsxMihaela Petruta Gaman petrutsx Data 6 august 2013 15:02:46
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.54 kb
#include<stdio.h>
#define MOD 1999999973

long long N, P;
long long res;

long long exp(long long N, long long P){
	if(P == 0)
		return 1;
	else
		if(P == 1)
			return N;
		else
			if(P % 2 == 1)
				return (N * exp((N * N) % MOD, (P - 1) / 2)) % MOD;
			else
				if(P % 2 == 0)
					return exp((N * N) % MOD, P / 2) % MOD;
}

int main(){
	FILE *pf, *pg;
	pf = fopen("lgput.in", "r");
	pg = fopen("lgput.out", "w");

	fscanf(pf, "%lld %lld", &N, &P);
	res = exp(N, P);
	res = res % MOD;

	fprintf(pg, "%lld", res);

	fclose(pf);
	fclose(pg);

	return 0;
}