Pagini recente » Cod sursa (job #2471708) | Cod sursa (job #1806275) | Cod sursa (job #521779) | Cod sursa (job #2110415) | Cod sursa (job #1653739)
#include <fstream>
#define w 2000001
using namespace std;
unsigned int phi[w];
long long po(long long a,long long b)
{
long long rez=1;
while (b)
{
if (b%2) rez*=a;
a*=a;
b/=2;
}
return rez;
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int i,j,n,a;
f>>a>>n;
for (i=2;i<=n/2;i++)
{
phi[2*i]++;
for (j=3*i;j<=n;j+=i)
phi[j]+=phi[j-i];
}
long long x=po(a,n-2-phi[n]);
g<<x%n<<'\n';
f.close();
g.close();
return 0;
}