UVA - 11461 Square Numbers

最新推荐文章于 2019-04-29 13:34:38 发布

Joyyiwei

最新推荐文章于 2019-04-29 13:34:38 发布

阅读量1.9k

点赞数

CC 4.0 BY-SA版权

分类专栏：数论

本文链接：https://blog.youkuaiyun.com/u011345136/article/details/38706385

数论专栏收录该内容

181 篇文章

订阅专栏

本文介绍了一种简单有效的算法，用于找出两个整数a和b之间（包含a和b）的所有完全平方数的数量。该算法通过计算a和b的平方根并进行比较来确定平方数的个数。

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

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