Cod sursa(job #2723702)
Utilizator | Data | 15 martie 2021 12:46:18 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#define Nmax 10001
using namespace std;
int v[Nmax];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n , i = 1 ,s = 0 ;
f >> n;
v[1] = 1;
for (int i = 2 ; i<=n ; i++) v[i] = i - 1;
for (int i = 2 ; i<=n ; i++) {
s=s+v[i];
for(int j = 2*i ;j<=n; j=j+i)
v[j] = v[j]-v[i];
}
cout << 2*s+1;
return 0;
}