Cod sursa(job #269645)
Utilizator | Data | 3 martie 2009 10:00:25 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<cstdio>
using namespace std;
long long a[1000001],n,s;
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%lld",&n);
for(int i=1;i<=n;i++)
a[i]=i-1;
s=0;
for(int i=1;i<=n;i++)
{
for(int j=2*i;j<=n;j+=i)
a[j]=a[j]-a[i];
s=s+a[i];
}
printf("%lld\n",2*s+1);
return 0;
}