Cod sursa(job #2200081)
| Utilizator | Data | 30 aprilie 2018 11:59:01 | |
|---|---|---|---|
| Problema | Fractal | 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 ciur[1000001];
int n;
long long int fractii = 0;
int main()
{
f >> n;
for(int i = 1 ; i <= n ; i++){
ciur[i] = i;
}
for(int i = 1 ; i <= n ; i++){
fractii += ciur[i];
for(int j = i*2 ; j <= n ; j += i)
ciur[j] -= ciur[i];
}
g << 2*fractii-1;
return 0;
}