Cod sursa(job #2931947)
| Utilizator | Data | 1 noiembrie 2022 11:57:47 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f ("frcatii.in");
ofstream g ("fractii.out");
const int NMAX = 1e6;
int c[NMAX+1];
int main()
{
for(int i=1; i<=NMAX; i++)
c[i] = i;
for(int i=2; i<=NMAX; i++)
if(c[i] == i)
for(int j=i; j<=NMAX; j+=i)
c[j] = c[j]/i*(i-1);
long long sum = 1;
int n;
f>>n;
for(int i=2; i<=n; i++)
sum += 2*c[i];
g<<sum;
return 0;
}
