Cod sursa(job #2663759)
| Utilizator | Data | 27 octombrie 2020 11:19:37 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int NMAX = 1000000;
int ciur[NMAX + 5];
int main()
{
int i,n;
fin>>n;
for(i = 2;i <= NMAX;i++)
ciur[i] = i;
for(i = 2;i <= NMAX;i++)
if(ciur[i] == i)
{
ciur[i]--;
for(int j = i + i;j <= NMAX;j += i)
ciur[j] = ciur[j] * (i - 1) / i;
}
int s = 0;
for(i = 1;i <= n;i++)
s += ciur[i];
s *= 2;
s++;
fout<<s;
return 0;
}
