Pagini recente » Cod sursa (job #1175733) | Cod sursa (job #966080) | Cod sursa (job #1153091) | Cod sursa (job #2370043) | Cod sursa (job #1519553)
#include<stdio.h>
#include<math.h>
#include<iostream>
bool x[1000001];
long long int p[500001],nr[500001],s=0,pos=1,pos2=1;
long long int a,b;
FILE *fin,*fout;
void add(long long int position,long long int val,bool sign)
{
for(long long int i=position;i<pos2;i++)
{
if(val/nr[i]!=0)
{
if(sign==1)
{
s+=(val/nr[i]);
add(i+1,val/nr[i],0);
}
else
{
s-=(val/nr[i]);
add(i+1,val/nr[i],1);
}
}
else
{
break;
}
}
}
int main()
{
fin=fopen("pinex.in","r");
fout=fopen("pinex.out","w");
int m;
for(long int j=2;j<=1000000;j++)
{
if(x[j]==0)
{
p[pos]=j;
pos++;
for(long int k=2;k*j<=1000000;k++)
{
x[k*j]=1;
}
}
}
fscanf(fin,"%d",&m);
for(int i=0;i<m;i++)
{
s=0;
fscanf(fin,"%lld %lld",&a,&b);
pos2=1;
if(b==1)
{
fprintf(fout,"%d",a);
}
else
{
int sq=sqrt(b)+1;
for(int j=1;j<pos&&p[j]<=a&&p[j]<=sq;j++)
{
if(b%p[j]==0)
{
while(b%p[j]==0)
{
b/=p[j];
}
nr[pos2]=p[j];
pos2++;
}
}
if(b!=1)
{
nr[pos2]=b;
pos2++;
}
add(1,a,1);
fprintf(fout,"%lld",a-s);
}
fprintf(fout,"\n");
}
}