UVA 11461

题目链接

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <iostream>
using namespace std;
#define LL long long
#define MOD 1000000007
int p[1001];
int judge(int x)
{
    int str,end,mid;
    if(x <= 0)
    return 0;
    str = 1;
    end = 1000;
    while(str < end)
    {
        mid = (str + end + 1)/2;
        if(p[mid] > x)
        end = mid - 1;
        else
        str = mid;
    }
    return end;
}
int main()
{
    int x,y,i;
    for(i = 1;i <= 1000;i ++)
    p[i] = i*i;
    while(scanf("%d%d",&x,&y)!=EOF)
    {
        if(x == 0&&y == 0) break;
        printf("%d
",judge(y)-judge(x-1));
    }
    return 0;
}