算法题：UVa 11461 Square Numbers （简单数学）

算法题：UVa 11461 Square Numbers （简单数学）2014-04-24 csdn博客 synapse711461 - Square Numbers

Time limit: 1.000 seconds

http://uva.onlinejudge.org/index.php？ option=com_onlinejudge&Itemid=8&category=467&page=show_problem&problem=24 56

A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b （inclusive）.

Input

The input file contains at most 201 lines 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 be processed.

Output

For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b （inclusive）.

Sample Input Output for Sample Input

water.

/*0.022s*/#include<cstdio>#include<cmath>int main（void）{int a, b;while （scanf（"%d%d", &a, &b）, a）printf（"%d
", （int）sqrt（b） - （int）ceil（sqrt（a）） + 1）;return 0;}