Cod sursa(job #3322137)
| Utilizator | Data | 12 noiembrie 2025 21:13:02 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
const int NMAX=1000000;
long long n,v[NMAX+10],rez;
void prepr() {
for(int i=1; i<=NMAX; i++) {
v[i]=i;
}
for(int i=2; i<=NMAX; i++) {
if(v[i]==i) {
v[i]--;
for(int j=2; j*i<=NMAX; j++) {
v[i*j]=v[i*j]/i*(i-1);
}
}
}
}
int main() {
prepr();
f>>n;
for(int i=1; i<=n; i++) {
rez+=v[i]*2;
}
rez--;
g<<rez;
f.close();
g.close();
return 0;
}
