Cod sursa(job #1659901)
Utilizator | Data | 22 martie 2016 18:14:55 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
long long n,i,j,f[1000010],s;
ifstream f ("fractii.in");
ofstream g ("fractii.out");
int main (){
f>>n;
for (i=1;i<=n;i++)
f[i] = i;
for (i=2;i<=n;i++){
if (f[i] == i)
for(j=i;j<=n;j+=i)
f[j]=f[j]/i*(i-1);
}
for (i=2;i<=n;i++)
s+=f[i];
g<<s*2+1;
return 0;
}