Cod sursa(job #1247969)
Utilizator | Data | 24 octombrie 2014 13:30:09 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
long long ndiv(int n)
{
int i;
long long s;
s=0;
for(i=1; (long long)i*i<=n; i++)
s=s+1+2LL*(n/i-i);
return s;
}
int main()
{
FILE *fin, *fout;
fin=fopen("ndiv.in", "r");
fout=fopen("ndiv.out", "w");
int i, a, b, s;
fscanf(fin, "%d%d", &a, &b);
fprintf(fout, "%lld", ndiv(b)-ndiv(a-1));
return 0;
}