Pagini recente » Cod sursa (job #2753698) | Cod sursa (job #2292674) | Cod sursa (job #2026065) | Cod sursa (job #2070466) | Cod sursa (job #561276)
Cod sursa(job #561276)
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long n,nr=0,i,j,phi[1000000];
int main(){
fin>>n;
for (i=2; i<=n; ++i)
phi[i]=i-1;
for (i=2; i<=n; ++i){
j=2*i;
while (j<=n){
phi[j]-=phi[i];
j+=i;
}
}
for (i=2; i<=n; ++i)
nr+=phi[i];
fout<<nr*2+1;
fin.close();
fout.close();
return 0;
}