Cod sursa(job #2441076)
Utilizator | Data | 19 iulie 2019 21:06:20 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <cstdio>
int n,i,j,euler[1000001];
long long sol;
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
for (i=2; i<=n; i++)
euler[i]=i-1;
for (i=2; i<=n; i++)
{
sol=sol+euler[i];
for (j=2*i; j<=n; j=j+i)
euler[j]=euler[j]-euler[i];
}
printf("%lld\n",2*sol+1);
return 0;
}