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

    Octorber 21st

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


    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
     
    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int year[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
    int main()
    {
    	int n,m,j,i,t,d;
    	scanf("%d",&t);
    	while(t--)
    	{
    		scanf("%d%d",&m,&d);
    		int sum=0;
    		if(m>10)
    		    printf("What a pity, it has passed!
    ");
    		else if(m==10&&d>21)
    		    printf("What a pity, it has passed!
    ");
    		else if(m==10&&d==21)
    		    printf("It's today!!
    ");
    		else if(m==10&&d<21)
    		    printf("%d
    ",21-d);
    		else
    		{
    			for(i=m;i<10;i++)
    				sum+=year[i];
    			sum+=21;
    			printf("%d
    ",sum-d);
    		}
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    批量清理java源码的target目录
    前端移动node_modules到其他位置
    oracle物化视图和视图的数据不一致
    百词斩英语单词素材提取、听力练习
    2048自动游戏AI, 最高可以玩出一二十个2048
    switcheroo: Alt+Tab的替代工具、窗口搜索
    为知笔记wiz.editor.md增强
    腾讯北极星 Polaris 试用
    [分布式] 分布式事务、seata
    Mysql查询所有的表名和查询表中所有的字段名
  • 原文地址:https://www.cnblogs.com/tonghao/p/4994471.html
Copyright © 2011-2022 走看看