ZOJ - 3174 Square Root Day

最新推荐文章于 2021-04-01 13:39:47 发布

原创最新推荐文章于 2021-04-01 13:39:47 发布 · 532 阅读

0 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一个简单的算法问题——计算特定年份范围内的SquareRootDay数量。SquareRootDay是在某些特定日期庆祝的一个非官方节日，其特点是月份和日期的平方等于该年的最后两位或三位数。文章提供了完整的代码实现，用于找出指定年份区间内的所有SquareRootDay。

Square Root Day

Time Limit: 1000MS

Memory Limit: 32768KB

64bit IO Format: %lld & %llu

Submit Status

Description

Square Root Day is an unofficial holiday celebrated on days when both the day of the month and the month are the square root of either the last two or three digits of the year. For example, the last Square Root Day was March 3, 2009 (3/3/09), and the next Square Root Day will be April 4, 2016 (4/4/16).

Input

The first line of the input contains an integer T (T <= 10), indicating the number of cases.

Then T lines follows, each has two integers x and y (1 <= x <= y <= 2009).

Output

Output the number of Square Root Days from year x to year y, both inclusive.

Sample Input

2
2009 2009
81 100

Sample Output

1
2

Source

The 9th Zhejiang University Programming Contest

分析：

水题。

ac代码：

#include <iostream>
#include<cstdio>
using namespace std;

int main()
{
    int t,x,y,i,j;
    int c;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&x,&y);
        c=0;
        for(i=x;i<=y;i++)
        {
            for(j=1;j<=12;j++)
            {
                if(i%100==j*j||i%1000==j*j)
                {
                    c++;
                }
            }
        }
        printf("%d\n",c);
    }
    return 0;
}