Cod sursa(job #2708411)
Utilizator | Data | 18 februarie 2021 18:00:59 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long n,v[10000001],contor=1;
int main()
{
fin >> n;
for(int i=2; i<=n; ++i)
v[i]=i-1;
for(int i=2; i<=n; ++i)
{
for(int j=2*i; j<=n; j+=i)
v[j]=v[j]-v[i];
contor=contor+v[i];
}
fout << 2*contor-1;
fin.close();
fout.close();
return 0;
}