Cod sursa(job #1885799)
Utilizator | Data | 20 februarie 2017 13:17:53 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long i, n, p, j, v[1000002];
long long s;
int main()
{
f>>n;
for( i = 1; i <= n; i++)
v[i]=i;
for( i = 2; i <= n; i++)
{
if(v[i]==i)
for( j = i; j <= n; j += i)
{
v[j]*=(i-1);
v[j]/=i;
}
}
for( i = 2; i <= n; i++)
s+=v[i];
g<<2*s+1;
return 0;
}