Cod sursa(job #3039765)
| Utilizator | Data | 28 martie 2023 20:41:08 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long v[1000005], n, ans;
int main()
{
f>>n;
for(int i = 1; i<=n; i++)
{
v[i] = i;
}
for(int i = 2; i<=n; i++)
{
if(v[i] == i)
{
v[i]--;
for(int j = 2; i*j<=n; j++)
{
v[i*j] = v[i*j] / i * (i-1);
}
}
}
for(int i = 1; i<=n; i++)
{
ans += v[i];
}
g<<ans*2-1;
return 0;
}
