Cod sursa(job #3267600)
| Utilizator | Data | 11 ianuarie 2025 15:12:20 | |
|---|---|---|---|
| Problema | Fractii | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
int Euler(int n){
int phi = n;
for(int d = 2; d*d<=n; ++d)
if(n%d==0){
phi/=d;
phi*=(d-1);
while(n%d==0)n/=d;
}
if(n>1){
phi/=n;
phi*=(n-1);
}
return phi;
}
int main(){
ios_base::sync_with_stdio(false);
f>>n;
unsigned long long rasp = 1;
for(int i = 2; i<=n; ++i) rasp+=2*Euler(i);
g<<rasp;
return 0;
}
