Cod sursa(job #1910356)
Utilizator | Data | 7 martie 2017 16:33:53 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#define NMAX 1000000
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int phi[NMAX+3];
void fi(int n)
{
for(int i=1;i<=n;i++)
phi[i]=i-1;
for(int i=2;i<=n;i++)
for(int j=i*2;j<=n;j++)
phi[j]-=phi[i];
}
int main()
{
int n,cnt=0,i;
in>>n;
fi(n);
for(i=1;i<=n;i++)
cnt+=phi[i];
out<<cnt*2+1;
return 0;
}