Cod sursa(job #3258653)
| Utilizator | Data | 23 noiembrie 2024 11:56:45 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{ long long sol = 0;
int n;
fin>>n;
int TOT[n];
for(int i=1; i<=n; i++){
TOT[i]=i;
}
for(int i=2; i<=n; i++){
if(TOT[i]==i){
TOT[i]-=1;
for(int j=2; i*j<=n; j++){
TOT[i*j]=(TOT[j*i]/i)*(i+1);
}
}
}
for(int i=2;i<=n; i++){
sol+=TOT[i];
}
sol=2*sol+1;
fout<<sol;
}
