Pagini recente » Cod sursa (job #899084) | Cod sursa (job #86934) | Cod sursa (job #613638) | Cod sursa (job #1698343) | Cod sursa (job #3149715)
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX=1000000;
int v[NMAX+1];
ifstream f("fractii.in");
ofstream g("fractii.out");
int Phi(int n)
{
int nr=n;
for(int d=2; d*d<=n; d++)
if(n%d==0)
{
nr=nr/d*(d-1);
do
{
n/=d;
}
while(n%d==0);
}
if(n>1)
nr=nr/n*(n-1);
return nr;
}
int main()
{
int n;
f>>n;
for(int i=2;i<=n;i++)
{
v[i]=v[i-1]+2*Phi(i);
}
g<<v[n]+1;
return 0;
}