Cod sursa(job #1181981)
Utilizator | Data | 4 mai 2014 13:35:31 | |
---|---|---|---|
Problema | Fractii | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int main()
{
int n;
long long S=1;
int fi[500000];
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(int i=1;i<=n;++i)
fi[i]=i;
for(int i=2;i<=n;++i)
if(fi[i]==i)
for(int j=i;j<=n;j+=i)
fi[j]-=fi[j]/i;
for(int i=2;i<=n;++i)
S+=2*fi[i];
g<<S;
return 0;
}