Cod sursa(job #1977411)
Utilizator | Data | 5 mai 2017 11:11:18 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("fractii.in");
ofstream out ("fractii.out");
int const nmax = 1000000;
int v[5 + nmax];
int main()
{
int n;
in>>n;
long long s = 1;
for(int j = 2 ; j <= n ;j++){
v[j] += j - 1;
for(int i = (j<<1) ;i <= n ;i += j){
v[i] -= v[j];
}
s += (v[j]<<1);
}
out<<s;
return 0;
}