Pagini recente » Cod sursa (job #669737) | Cod sursa (job #3185158) | Cod sursa (job #785198) | Cod sursa (job #1655225) | Cod sursa (job #559896)
Cod sursa(job #559896)
#include<fstream.h>
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n,i,j,s,k,t[1000000],p[100000],max;
int divi(int x,int y)
{
int r;
while(y!=0)
{
r=x%y;
x=y;
y=r;
}
if(x==1)
s++;
return 0;
}
int per()
{
for(i=2;i<=n;i++)
if(t[i]==0)
for(j=i+i;j<=n;j+=i)
t[j]=1;
j=0;
for(i=2;i<=n;i++)
if(t[i]==0)
p[j++]=i;
max=j;
for(i=2;i<=n;i++)
for(j=1;j<=n;j++)
{
for(k=0;k<max;k++)
if(i%p[k]==0&&j%p[k]==0)
break;
if(k==max)
s++;
}
return 0;
}
int main()
{
fin>>n;
s=n;
per();
fout<<s;
fin.close();
fout.close();
}