HDU 1491 Octorber 21st (日期計算)__HDU

來源:互聯網
上載者:User
Octorber 21st Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3993    Accepted Submission(s): 2449

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! 

Author 8600   AC代碼:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[12]={31,28,31,30,31,30,31,31,30,31,30,31};int i,j,k,l,m,n,x,y;int main(){scanf("%d",&k);while(k--){scanf("%d%d",&x,&y);m=0;for(i=0;i<x-1;i++)m+=a[i];m+=y;if(m==294)printf("It's today!!\n");if(m>294)printf("What a pity, it has passed!\n");if(m<294)printf("%d\n",294-m);}return 0;}

AC代碼:
#include<stdio.h>int a[11]={31,28,31,30,31,30,31,31,30};int main(){    int i,t,m,d;    scanf("%d",&t);    while(t--)    {        scanf("%d%d",&m,&d);        int s=0;        if(m>10) printf("What a pity, it has passed!\n");        else if(m==10 && d>21) printf("What a pity, it has passed!\n");        else if(m==10 && d==21) printf("It's today!!\n");        else        {            for(i=m-1;i<9;i++) s+=a[i];            s+=21-d;            printf("%d\n",s);        }    }    return 0;}


聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.