UVa 11461 Square Numbers (简单数学)

最新推荐文章于 2021-08-04 15:15:41 发布

synapse7

最新推荐文章于 2021-08-04 15:15:41 发布

阅读量1.3k

点赞数

CC 4.0 BY-SA版权

分类专栏： UVa acm之路--数学文章标签： UVa acm c++

本文链接：https://blog.youkuaiyun.com/synapse7/article/details/11589017

UVa 同时被 2 个专栏收录

407 篇文章

订阅专栏

acm之路--数学

262 篇文章

订阅专栏

本文介绍了一种快速计算两个整数区间内平方数数量的方法。输入包含一系列整数对，对于每一对整数，程序会输出该区间内（包括边界值）所有平方数的数量。通过取整和平方根运算实现这一功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

11461 - Square Numbers

Time limit: 1.000 seconds

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

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

1 4

1 10

0 0

water.

/*0.022s*/

#include<cstdio>
#include<cmath>

int main(void)
{
	int a, b;
	while (scanf("%d%d", &a, &b), a)
		printf("%d\n", (int)sqrt(b) - (int)ceil(sqrt(a)) + 1);
	return 0;
}