UVa 11461 Square Numbers (简单数学)

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

摘要生成于 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               

2

3                                        


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;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值