Cod sursa(job #3122373)
| Utilizator | Data | 18 aprilie 2023 19:04:56 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <bits/stdc++.h>
#define Nmax 1000005
using namespace std;
void phi()
{
int ciur[Nmax];
int i, j;
for(i = 1; i <= Nmax; ++i)
{
ciur[i] = i;
}
for(i = 2; i <= Nmax; ++i)
{
if(ciur[i] == i)
{
for(j = i; j <= Nmax; j+=i)
{
ciur[j] = ciur[j] * (i - 1) / i;
}
}
}
}
int n;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
phi();
f >> n;
long long s = 0;
for(int a = 1; a <= n; ++a)
{
s = s + 2 * ciur[a];
}
s = s + 1;
g << s;
return 0;
}
