Cod sursa(job #2941073)
| Utilizator | Data | 17 noiembrie 2022 09:26:04 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{
int e[1000005];
int n;
fin>>n;
for(int i=2; i<=n; i++)
e[i]=i;
for(int i=2; i<=n; i++) {
if(e[i]==i) {
for(int j=i; j<=n; j+=i) e[j]-=e[j]/i;
}
}
long long s=0;
for(int i=2; i<=n; i++) s+=e[i];
fout<<2*s+1;
return 0;
}
