Pagini recente » Cod sursa (job #1746486) | Cod sursa (job #1851148) | Cod sursa (job #114086) | Cod sursa (job #2179033) | Cod sursa (job #540628)
Cod sursa(job #540628)
#include<fstream.h>
#include <math.h>
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
//const int n_max = 10001; // Definim numarul maxim de cifre al numerelor
int main()
{
int i=0,a,n;
long long sol;
fin>>a>>n;
if(a+1==n)
{
fout<<a;
return 0;
}
//for(i=0;i<=n-1;i++)
while(i<=n-1 && sol%n!=1)
// if( (i&p) >0)
{
sol=sol+sol;
i++;
}
fout<<i-1;
return 0;
}
/*int main()
{
unsigned int i, n, p;
long long a, sol = 1;
fin>>n>>p;
a=n;
for(i=0; (1<<i) <= p;i++)
{
if( ((1<<i) & p) > 0)
sol=(sol*a)%m;
a=(a*a)%m;
}
fout<<sol<<'\n';
return 0;
}*/