Cod sursa(job #2998791)
Utilizator | Data | 9 martie 2023 23:31:52 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
int n,a;
int modInverse(int A, int M)
{
for (int X = 1; X < M; X++)
if (((A % M) * (X % M)) % M == 1)
return X;
}
int main(void)
{
cin>>n>>a;
cout<<modInverse(a,n);
}