zoukankan      html  css  js  c++  java
  • HDU 1491

    Octorber 21st

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1500 Accepted Submission(s): 977


    Problem Description
    HDU's 50th birthday, on Octorber 21st, is coming. What an exciting day!! As a student of HDU, I always want to know how many days are there between today and Octorber 21st.So, write a problem and tell me the answer.Of course, the date I give you is always in 2006.

     
    Input
    The input consists of T test cases. The number of T is given on the first line of the input file.Following T lines, which represent dates, one date per line. The format for a date is "month day" where month is a number between 1 (which indicates January) and 12 (which indicates December), day is a number between 1 and 31.All the date in the input are in 2006, you can assume that all the dates in the input are legal(合法).
     
    Output
    For each case, if the date is before Octorber 21st, you should print a number that between the date and Octorber 21st.If the day is beyond Octorber 21st, just print "What a pity, it has passed!".If the date is just Octorber 21st, print"It's today!!".
     
    Sample Input
    7 10 20 10 19 10 1 10 21 9 1 11 11 12 12
     
    Sample Output
    1 2 20 It's today!! 50 What a pity, it has passed! What a pity, it has passed!
     1 #include <stdio.h>
     2 int main()
     3 {
     4     int t,i;
     5     int month,day,now;
     6     int tab[11]={0,31,28,31,30,31,30,31,31,30};
     7     scanf("%d",&t);
     8     while(t--)
     9     {
    10         scanf("%d%d",&month,&day);
    11         if(month>10||(month==10&&day>21))
    12             puts("What a pity, it has passed!");
    13         else if(month==10&&day==21)
    14             puts("It's today!!");
    15         else
    16         {
    17             now=0;
    18             for(i=1;i<month;i++)
    19                 now+=tab[i];
    20             now+=day;
    21             printf("%d\n",294-now);
    22         }
    23     }
    24     return 0;
    25 }
  • 相关阅读:
    快速排序中的partition函数的枢纽元选择,代码细节,以及其标准实现
    并发包的线程池第二篇--Executors的构造
    并发包的线程池第一篇--ThreadPoolExecutor执行逻辑
    Servlet学习笔记
    npm + webpack +react
    取消eclipse启动时的subclipse Usage弹窗
    关于webpack最好的文档
    WebStorm2016.1 破解 激活
    微信web调试工具
    webstorm下设置sass
  • 原文地址:https://www.cnblogs.com/hxsyl/p/2667771.html
Copyright © 2011-2022 走看看