Cod sursa(job #3122369)
Utilizator | Data | 18 aprilie 2023 18:56:34 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define Nmax 1000005
using namespace std;
int ciur[Nmax];
void phi()
{
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;
g << 2 * ciur[n] + 1;
return 0;
}