zoukankan      html  css  js  c++  java

  • HDU 5832 A water problem （带坑水题）

    A water problem

    题目链接：

    http://acm.hdu.edu.cn/showproblem.php?pid=5832

    Description

    Two planets named Haha and Xixi in the universe and they were created with the universe beginning. There is 73 days in Xixi a year and 137 days in Haha a year. Now you know the days N after Big Bang, you need to answer whether it is the first day in a year about the two planets.

    Input

    There are several test cases(about 5 huge test cases). For each test, we have a line with an only integer N(0≤N), the length of N is up to 10000000.

    Output

    For the i-th test case, output Case #i: , then output "YES" or "NO" for the answer.

    Sample Input

    10001 0 333

    Sample Output

    Case #1: YES Case #2: YES Case #3: NO

    Source

    2016中国大学生程序设计竞赛 - 网络选拔赛
    ##题意： 判断一个长度最多为1e7的数串是否同时模73和137为0.
    ##题解： 第一眼反应是水题，赶紧用java打一发. 结果MLE... 然后用getchar逐个读入判断. TLE. 才反应过来要用gets或scanf读入再处理，直到第四发才过...
    比赛中java一定要慎用，如果能看别人的提交信息，先看看用java有没有过的.
    ##代码： ``` cpp #include #include #include #include #include #include #include #include #include #include #include #define LL long long #define eps 1e-8 #define maxn 10001000 #define mod 1000000007 #define inf 0x3f3f3f3f #define mid(a,b) ((a+b)>>1) #define IN freopen("in.txt","r",stdin); using namespace std;

    char str[maxn];

    int main(int argc, char const *argv[])
    {
    //IN;

    int ca = 1;
while(gets(str))
{
    int num = 0;
    int sz = strlen(str);

    for(int i=0; i<sz; i++) {
        num = (num*10 + str[i] - '0') % 10001;
    }

    if(num) printf("Case #%d: NO
", ca++);
    else printf("Case #%d: YES
", ca++);
}

return 0;

    }
  • 相关阅读:
    Linux 命令[5]：rmdir
    Linux 命令[4]：pwd,date
    Linux 命令[0]：起航
    Linux 命令[3]：cd
    vscode插件
    Object.freeze()
    插件
    前端开发调试线上代码
    前端自动化测试是浪费时间还是节约时间？
    踩坑之用lrz插件进行图片压缩
  • 原文地址：https://www.cnblogs.com/Sunshine-tcf/p/5770519.html
Copyright © 2011-2022 走看看