Cod sursa(job #3323550)
| Utilizator | Data | 18 noiembrie 2025 17:39:46 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
int ciur[1000005];
int main()
{
ifstream cin ("fractii.in");
ofstream cout ("fractii.out");
int n;
cin >> n;
for(int i=1; i<=n; i++)
ciur[i]=i;
for(int i=2; i<=n; i++)
{
if(ciur[i]==i)
{
ciur[i]--;
for(int j=2; j*i<=n; j++)
ciur[j*i]=ciur[j*i]*(i-1)/i;
}
}
int sum=0;
for(int i=1; i<=n; i++)
sum+=2*ciur[i];
cout << sum-1;
return 0;
}