Pagini recente » Cod sursa (job #2142818) | Cod sursa (job #406154) | Cod sursa (job #1608750) | Cod sursa (job #1675449) | Cod sursa (job #2027767)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main() {
int p,q,r,n,c[1000000];
f>>n;
for(int i=2; i<=n; i++)
c[i]=1;
for (int i=2; i<=n; i++)
{
if(c[i]==1)
for (int j=2*i; j<=n; j+=i)
c[j]=0;
}
int nr=n;
for (p=2; p<=n; p++)
{
q=n;
if(c[p]==1)
q-=n/p;
else
for (r=2; r<=p/2; r++)
if(p%r==0)
q=q-n/r;
nr=nr+q;
}
g<<nr;
f.close();
g.close();
return 0;
}