Cod sursa(job #2194783)
Utilizator | Data | 14 aprilie 2018 13:17:06 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
const int MAX = 1000001;
int fi[MAX], n;
int main()
{
for(int i=1; i<=n; i++)
fi[i] = i;
for(int i=2; i<=n; i++)
for(int j=i; j<=n; j+=i)
fi[j]-=(fi[j]/i);
long long ans=-1;
for(int i=1; i<=n; i++)
ans+=(2*fi[i]);
out<<ans;
return 0;
}