Cod sursa(job #2122748)
| Utilizator | Data | 5 februarie 2018 14:19:28 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int V[1000003],N;
long long Sol;
int Euclid()
{
for(int i=1; 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[i];
}
int main()
{
fin>>N;
Euclid();
for(int i=1;i<=N;i++)
Sol+=V[i];
fout<<2*Sol+1;
}
