Cod sursa(job #1688589)
Utilizator | Data | 13 aprilie 2016 16:49:19 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
#define NM 1000005
using namespace std;
int v[NM];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
long long nr = 0;
int n;
f >> n;
for(int i = 1; i <= n; ++i)
v[i] = i-1;
for(int i = 1; i <= n-i; ++i)
for(int j = i+i; j <= n; j += i)
v[j] -= v[i];
for(int i = 1; i <= n; ++i)
nr += v[i];
g << nr*2+1;
}