Cod sursa(job #235575)
| Utilizator | Data | 24 decembrie 2008 15:11:42 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.32 kb |
#include <cstdio>
int a[1000000], n;
int main()
{
freopen ("fractii.in","r",stdin);
freopen ("fractii.out","w",stdout);
scanf("%d", &n);
long long s=0;
for (int i=2; i<=n; ++i)
{
a[i]=i-1-a[i];
for (int j=2; i*j <= n; ++j)
a[i*j]+=a[i];
s+=a[i];
}
printf("%lld\n", 2*s+1);
return 0;
}
