Cod sursa(job #2961441)
| Utilizator | Data | 6 ianuarie 2023 15:10:24 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long putere(long long a, long long n, long long mod)
{
if(n == 0)
return 1;
if(n % 2 == 1)
return (a * putere(a,n-1,mod)) % mod;
long long p = (putere(a,n/2,mod))%mod;
return (p*p)%mod;
}
int main()
{
long long a,n;
f>>a>>n;
g<<putere(a,n-2,n);
}