Cod sursa(job #1277779)
Utilizator | Data | 28 noiembrie 2014 08:47:20 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,v[1000005];
int main()
{
long long k = 0;
f>>n;
for(int i = 2; i <= n; i++) {
v[i] = i - 1;
}
for(i = 2; i <= n; i++) {
for(int j = i + i; j <= n; j = j + i)
{
v[j] = v[j] - v[i];
}
k += v[i];
}
out << 2 * k + 1;
g.close();
return 0;