HDU 1491 Octorber 21st
来源:互联网 发布:淘宝大数据 实体店 编辑:程序博客网 时间:2024/05/22 12:24
Octorber 21st
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
710 2010 1910 110 219 111 1112 12
Sample Output
1220It's today!!50What a pity, it has passed!What a pity, it has passed!
注意一下2月有28天就可以了
#include<stdio.h>int main(){ int t,n,m,d; scanf("%d",&t); while(t--) { scanf("%d%d",&m,&d); if(m==10&&d==21) { printf("It's today!!\n"); continue; } if((m==10&&d>21)||(m>10)) { printf("What a pity, it has passed!\n"); continue; } int sum=0; sum=(10-m)*30+21-d; if(m<9) sum++; if(m<8) sum++; if(m<6) sum++; if(m<4) sum++; if(m<3) sum-=2; if(m<2) sum++; printf("%d\n",sum); } return 0;}
2 0
- HDU 1491 Octorber 21st
- hdu 1491 Octorber 21st
- HDU 1491 Octorber 21st
- HDU 1491 Octorber 21st
- HDU 1491 Octorber 21st
- hdu Octorber 21st
- hdu-oj 1491 Octorber 21st
- HDU 1491 Octorber 21st【计算日期】
- hdu 1491 Octorber 21st(数学题)
- HDOJ(HDU) 1491 Octorber 21st
- HDOJ 1491 Octorber 21st
- Hdoj 1491 Octorber 21st
- hdu 1491(Octorber 21st)(模拟水题)
- 杭电 HDU ACM 1491 Octorber 21st
- HDU 1491 Octorber 21st (日期计算)
- HDU 1491 Octorber 21st
- hdoj.1491 Octorber 21st 20140825
- 杭电1491 Octorber 21st
- Sharing Files with NFC ->Sending Files to Another Device
- 我所认识的EXT2(二)
- Java入门_学习笔记[4]_继承
- leetcode 374 Guess Number Higher or Lower C++
- leetcode 383. Ransom Note
- HDU 1491 Octorber 21st
- Java序列化时,静态的成员变量 "可以被拿到数据" 是因为 类加载器之前就把这个类加载好了,拿到的是加载好的数据
- 字体属性及测量(FontMetrics)
- 单例模式(懒汉,饿汉)
- SQL三表连接查询与集合的并、交、差运算查询
- 手动调整KVM镜像image的disk磁盘大小
- Warning:Conflict with dependency 'com.android.support:support-annotations'问题解决
- leetcode 283. Move Zeroes
- HDU 2111Saving HDU