Cod sursa(job #917178)
Utilizator | Data | 17 martie 2013 13:51:23 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int v[1000001], n, i, j;
long long s;
int main()
{
f>>n;
for(i=1; i<=n; i++)
v[i] = i-1;
for(i=2; i<=n; i++)
for(j=2*i; j<=n; j+=i)
v[j] -= v[i];
for(i=1; i<=n; i++)
s += v[i]*2;
g<<s+1<<'\n';
f.close();
g.close();
return 0;
}