A squarenumber is an integer number whose square root is also an integer. For example1, 4, 81 are some square numbers. Given two numbers a and b you will have tofind out how many square numbers are there between a and b (inclusive).

Input

The input file contains at most 201lines of inputs. Each line contains two integers a and b (0<a≤b≤100000).Input is terminated by a line containing two zeroes. This line should not beprocessed.

Output

For each lineof input produce one line of output. This line contains an integer whichdenotes how many square numbers are there between a and b (inclusive).

SampleInput                             Outputfor Sample Input

1 4

1 10

0 0

Problem Setter: Shahriar Manzoor

题意：求[a, b]之间的完全平方数

思路： 额。。。。开根号就有答案了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

int main() {
	int a, b;
	while (scanf("%d%d", &a, &b) != EOF && a+b) {
		int n = sqrt(a);
		int m = sqrt(b);
		int ans = m-n+1;
		if (n*n < a)
			ans--;
		printf("%d\n", ans);
	}
	return 0;
}