Pagini recente » Cod sursa (job #1068959) | Cod sursa (job #998235) | Cod sursa (job #946034) | Cod sursa (job #1687647) | Cod sursa (job #1038182)
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <stdlib.h>
#include <assert.h>
#include <time.h>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <queue>
#include<cstdlib>
using namespace std;
#define MAXN 101
#define INF 1<<30
int v[MAXN];
int main()
{
FILE *f = fopen("inversmodular.in", "r");
FILE *g = fopen("inversmodular.out", "w");
int A, N;
fscanf(f, "%d %d", &A, &N);
for (int i = 1; i < N; i++)
{
if ( (i * A) % N == 1)
{
fprintf(g, "%d", i);
return 0;
}
}
fclose(f); fclose(g);
return 0;
}