zoukankan      html  css  js  c++  java
  • Octorber 21st

    Octorber 21st

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


    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 <cstdio>
     2 #include <iostream>
     3 using namespace std;
     4 int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
     5 int main()
     6 {
     7     int T,i,j;
     8     cin>>T;
     9     while(T--)
    10     {
    11         int x,y,time=0;
    12         cin>>x>>y;
    13         if(x>10||(x==10&&y>21))
    14             cout<<"What a pity, it has passed!"<<endl;
    15         else if(x==10&&y==21)
    16             cout<<"It's today!!"<<endl;
    17         else if(x==10)
    18             cout<<21-y<<endl;
    19         else
    20         {
    21             for(i=x+1;i<10;i++)
    22                 time+=a[i];
    23             time+=(a[x]-y);
    24             cout<<time+21<<endl;
    25         }
    26     }
    27 }
  • 相关阅读:
    hdu 2199 Can you solve this equation? 二分
    STL 学习代码~
    hdu 1551 Cable master 二分
    fzu 1564 Combination 组合数是否包含因数
    fafu 1079 帮冬儿忙 组合数包含因数个数
    soj 3290 Distribute The Apples I 组合数对素数取余
    fzu 2020 组合 组合数对素数取余
    hdu 1969 Pie 二分
    hdu 2141 Can you find it? 二分
    hdu 2899 Strange fuction 二分
  • 原文地址:https://www.cnblogs.com/a1225234/p/4691187.html
Copyright © 2011-2022 走看看