Cod sursa(job #3349558)
| Utilizator | Data | 31 martie 2026 17:18:44 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int N = 1e6+5;
int n, ciur[N];
void euler(){
for(int i = 1; i<=n; i++){
ciur[i] = i;
}
for(int i = 2; i<=n; i++){
if(ciur[i] == i){
for(int j = i; j<=n; j+=i){
ciur[j] = ciur[j]/i*(i-1);
}
}
}
}
int main(){
fin >> n;
euler();
ll sol = 1;
for(int i = 2; i<=n; i++){
sol += 2 * ciur[i];
}
fout << sol;
return 0;
}