Pagini recente » Cod sursa (job #154283) | Cod sursa (job #1018211) | Cod sursa (job #223904) | Borderou de evaluare (job #1566500) | Cod sursa (job #690193)
Cod sursa(job #690193)
#include <fstream>
#include <cmath>
using namespace std;
long long sol,prod,a,b;
int rad;
int D,Div[100002],m;
void divizori()
{
int d=1;
D=0;
while(b>1 and d<=rad)
{
d++;
if(b%d) continue;
while(b%d==0) b/=d;
Div[++D]=d;
}
if(b!=1) Div[++D]=b;
}
void solutie()
{
int d;
sol=a;
long long prod;
for(int i=1;i<(1<<D);i++)
{
prod=1; d=0;
for(int j=0;j<D;j++)
if(i&(1<<j)){d++; prod=prod*Div[j+1];}
if(d%2) sol-=a/prod; else sol+=a/prod;
}
}
int main()
{
ifstream fi("pinex.in");
ofstream fo("pinex.out");
fi>>m;
while(m--)
{
fi>>a>>b;
rad=(int)sqrt((double)a);
divizori();
solutie();
fo<<sol<<"\n";
}
return 0;
}