Pagini recente » Cod sursa (job #2534300) | Cod sursa (job #2621408) | Cod sursa (job #327360) | Cod sursa (job #1803770) | Cod sursa (job #3273064)
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long x,nr,i,nrf,j;
bool ciur[1000005];
int phi(int n)
{
int nrf=n;
for(int d=2;d*d<=n;d++)
{
if(n%d==0)nrf=nrf/d*(d-1);
while(n%d==0)n/=d;
}
if(n>1)nrf=nrf/n*(n-1);
return nrf;
}
int main()
{
f>>x;
nr=1;
for(i=2;i<=1000;i++)
for(j=i*i;j<=1000000;j+=i)ciur[j]=true;
for(i=2;i<=x;i++)
{
if(ciur[j]==true)nr+=(j-1)*2;
else nr+=phi(i)*2;
}
g<<nr;
}