Cod sursa(job #948541)

Utilizator manutrutaEmanuel Truta manutruta Data 10 mai 2013 21:29:18
Problema Algoritmul lui Euclid extins Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream f("lgput.in");
ofstream g("lgput.out");
long long n,x=1,p;
int const N=1999999973;

long long putere(long long n, long long p){
    if(p==1)
        return n;
    if(p%2==1)
        return (putere((n*n)%N,p/2)*n)%N;
    return putere((n*n)%N,p/2)%N;
}

int main()
{
    f>>n>>p;
    g<<putere(n,p);
}