Cod sursa(job #1255536)
| Utilizator | Data | 4 noiembrie 2014 21:31:05 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include<fstream>
#define n_max 1000001
using namespace std;
int phi[n_max];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
f>>n;
int nr=0;
for (int i=0;i<=n;i++)
phi[i]=i;
for(int i=2;i<=n;i++)
{
if(phi[i]==i)
for(int j=i;j<=n;j+=i)
{
phi[j]/=i;
phi[j]*=(i-1);
}
}
long long s=0;
for(int i=2;i<=n;i++)
s+=phi[i];
g<<s*2+1<<"\n";
}
