Cod sursa(job #129117)
Utilizator | Data | 28 ianuarie 2008 17:46:09 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <stdio.h>
int n,ciur[1000010];
long nr = 0;
int main ()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
nr = n * 2 - 1;
for (int i = 2;i <= n; i++)
{
int nr_max = n - i + 1;
for (int j = i;j <= n;j = j + i)
nr_max --;
nr += nr_max * 2;
}
printf("%ld",nr);
}