Pagini recente » Cod sursa (job #1969739) | Cod sursa (job #2479860) | Cod sursa (job #395111) | Cod sursa (job #654144) | Cod sursa (job #992180)
Cod sursa(job #992180)
#include <iostream>
#include <fstream>
#define nmax 1000002
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int n,phi[nmax],s;
void eul(int n){
for (int i=2; i<=n; i++)
phi[i]=i-1;
for (int i=2; i<=n; i++)
for (int j=2*i; j<=n; j+=i)
phi[j]-=phi[i];
for (int i=1; i<=n; i++)
s+=phi[i];
}
int main()
{
in >> n;
eul(n);
s=s*2+1;
out << s;
return 0;
}