Uva 11461 - Square Numbers 解题报告（水题）

最新推荐文章于 2022-03-05 07:39:05 发布

SF-_-

最新推荐文章于 2022-03-05 07:39:05 发布

阅读量1k

点赞数

分类专栏：数学 ACM 文章标签：水题

本文链接：https://blog.csdn.net/sf____/article/details/22071387

版权

ACM 同时被 2 个专栏收录

224 篇文章 0 订阅

订阅专栏

数学

96 篇文章 0 订阅

订阅专栏

该博客介绍了如何解决Uva在线判题平台上的11461题——平方数问题。题目要求在两个整数a和b之间（包括a和b），找出有多少个数的平方根也是整数。输入包含最多201行，每行有两个整数a和b（0<a≤b≤100000），以两个零结束。博客提供输出格式示例，输出应为整数，表示a和b之间平方数的数量。

摘要由CSDN通过智能技术生成

Square Numbers

Input: Standard Input

Output: Standard Output

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

解题报告：预处理，二分查找。水题呀~

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

int num[1000];
int top;

void init()
{
    int t=1;
    while(t*t<=100000)
        num[top++]=t*t,t++;
    num[top++]=100001;
}

int main()
{
    init();

    int l,r;
    while(~scanf("%d%d",&l,&r) && (l||r))
    {
        int posl = lower_bound(num,num+top,l)-num;
        int posr = lower_bound(num,num+top,r+1)-num;
        printf("%d\n", posr-posl);
    }
}