Pagini recente » Cod sursa (job #1085551) | Cod sursa (job #2449977) | Cod sursa (job #759455) | Cod sursa (job #2188611) | Cod sursa (job #1081399)
#include <fstream>
using namespace std;
ifstream cin("pinex.in");
ofstream cout("pinex.out");
long long q, x, y, m, f[20], bk[20], s;
void fact(long long n)
{
long long d;
m=0;
for(d=2; n>1; d++)
{
if(n%d==0)
{
f[++m]=d;
while(n%d==0 && n>1)
n/=d;
}
}
}
void aduna(long long k, long long x)
{
long long i, p;
p=1;
for(i=1; i<=k; i++)
p*=f[bk[i]];
if(k & 1)
s+=x/p;
else
s-=x/p;
}
long long pinex(long long x)
{
long long i, k;
k=1;
i=1;
s=0;
while(k)
if(k>m || i>m)
{
k--;
i=bk[k]+1;
}
else
{
bk[k]=i;
aduna(k, x);
k++;
i++;
}
return x-s;
}
int main()
{
cin>>q;
while(q--)
{
cin>>x>>y;
fact(y);
cout<<pinex(x)<<'\n';
}
return 0;
}