Pagini recente » Cod sursa (job #929479) | Cod sursa (job #2641466) | Cod sursa (job #538186) | Cod sursa (job #2656621) | Cod sursa (job #2211915)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("factii.in");
ofstream g("fractii.out");
int n;
int v[1000005];
void phi()
{
for(int i=1; i<=n; i++)
v[i]=i;
for(int i=2; i<=n; i++)
if(v[i]==i)
for(int j=i; j<=n; j=j+1)
{v[j]=v[j]/i; v[j]=v[j]*i-1;}
}
int main()
{ int s=0;
f>>n;
phi();
for(int i=1; i<=n; i++)
s=s+v[i];
g<<2*s-1;
return 0;
}