Pagini recente » Cod sursa (job #2069556) | Cod sursa (job #1497479) | Cod sursa (job #2734650) | Cod sursa (job #1973132) | Cod sursa (job #3323250)
#include <bits/stdc++.h>
using namespace std;
long long extgcd( long long a, long long b, long long &x, long long &y ) {
if ( b == 0 ) {
x = 1;
y = 0;
return a;
}
long long x1, y1;
long long g = extgcd( b, a % b, x1, y1 );
x = y1;
y = x1 - y1 * (a % b);
return g;
}
int invMod( int a, int n ) {
long long x, y;
extgcd( a, n, x, y );
return (x % n + n) % n;
}
int main() {
FILE *fin, *fout;
int a, n;
fin = fopen( "inversmodular.in", "r" );
fscanf( fin, "%d%d", &a, &n );
fclose( fin );
fout = fopen( "inversmodular.out", "w" );
fprintf( fout, "%d\n", invMod( a, n ) );
fclose( fout );
return 0;
}