Cod sursa(job #3287493)
Utilizator | Data | 18 martie 2025 13:24:54 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("fractii.in");
ifstream fout ("fractii.out");
int phi[1000005],i,j,n,cnt;
int main()
{
fin>>n;
for (i=1;i<=n;i++) phi[i]=i;
for (i=2;i<=n;i++)
if (phi[i]==i)
{
for (j=i+i;j<=n;j+=i)
phi[j]-=(phi[j]/i);
phi[i]--;
}
cnt=1;
for (i=2;i<=n;i++) cnt+=phi[i]*2;
fout<<cnt;
return 0;
}