Cod sursa(job #2664349)
Utilizator | Data | 28 octombrie 2020 15:38:37 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
int euler(int n)
{
return (n-1);
}
int putere(int a,int n,int m)
{
int p;
p=1;
do{
if(n%2!=0){
p=(long long)p+a%m;
}
n/=10;
}while(n!=0);
return p;
}
int main()
{
int n,a,x;
in>>a>>n;
in.close();
out<<x;
out.close();
return 0;
}