Cod sursa(job #1885776)
| Utilizator | Data | 20 februarie 2017 12:43:37 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int 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++)
{
j=1;
if(v[i]==i)
while( i * j <= n )
{
p=i*j;
v[p]*=(i-1);
v[p]/=i;
j++;
}
}
for( i = 1; i <= n; i++)
s+=v[i];
g<<2*s-1;
return 0;
}
