uva 11461 Square Numbers

最新推荐文章于 2018-05-27 22:55:10 发布

原创最新推荐文章于 2018-05-27 22:55:10 发布 · 664 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#uva #打表

数学专栏收录该内容

81 篇文章

订阅专栏

本文介绍了一种通过预处理和快速查找的方法来解决在给定区间内寻找完全平方数的问题。利用C++实现了一个高效的算法，并通过输入输出样例展示了其工作流程。

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

原题：
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
1 4
1 10
0 0
Sample Output
2
3
中文：
给你两个数，a,b问你在a和b之间有多少个完全平方数=_=

#include <bits/stdc++.h>
using namespace std;
//fstream in,out;
int table[100001];

bool judge(int x)
{
    int fac=sqrt(x);
    if(fac*fac==x)
        return true;
    return false;
}
int main()
{
    ios::sync_with_stdio(false);
    table[1]=1;
    for(int i=2;i<=100000;i++)
    {
        if(!judge(i))
            table[i]=table[i-1];
        else
            table[i]=table[i-1]+1;
    }
    int a,b;
    while(cin>>a>>b,a+b)
    {
        cout<<table[b]-table[a-1]<<endl;
    }
    return 0;
}