Cod sursa(job #2124396)
Utilizator | Data | 7 februarie 2018 10:46:15 | |
---|---|---|---|
Problema | Invers modular | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
long long a,n,x;
int main()
{
int i;
in>>a>>n;
a=a%n;
for(i=1;i<n;i++)
{
if(((a*i)%n)==1)
{
out<<i;
return 0;
}
}
return 0;
}