HDOJ 1491 Octorber 21st
来源:互联网 发布:软件模块间接口 编辑:程序博客网 时间:2024/05/16 09:17
HDACM 1491
水题
import java.util.Scanner;public class Main { public static void main(String[] args) { int day[] = {31,28,31,30,31,30,31,31,30,31,30,31}; Scanner sc = new Scanner(System.in); int t = sc.nextInt(); while (t-->0) { int m = sc.nextInt(); int d = sc.nextInt(); int count = 0; if (m>10) { System.out.println("What a pity, it has passed!"); continue; } if (m==10) { if (d==21) { System.out.println("It's today!!"); continue; } if (d>21) { System.out.println("What a pity, it has passed!"); continue; } } while (m<10) { count += day[m-1]; m++; } System.out.println(count-d+21); } sc.close(); }}
阅读全文
0 0
- HDOJ 1491 Octorber 21st
- Hdoj 1491 Octorber 21st
- hdoj Octorber 21st
- hdoj.1491 Octorber 21st 20140825
- HDOJ(HDU) 1491 Octorber 21st
- HDU 1491 Octorber 21st
- hdu 1491 Octorber 21st
- HDU 1491 Octorber 21st
- HDU 1491 Octorber 21st
- HDU 1491 Octorber 21st
- hdu-oj 1491 Octorber 21st
- HDU 1491 Octorber 21st【计算日期】
- hdu 1491 Octorber 21st(数学题)
- 杭电1491 Octorber 21st
- hdu Octorber 21st
- HDOJ1491 Octorber 21st
- 201412021749-hd-Octorber 21st
- HDU1491 Octorber 21st【水题】
- (1)spring
- java 自我知识总结(六) 栈 堆 队列
- jQuery无缝轮播
- C++程序调包含TensorFlow代码的Python脚本出错问题的解决方案
- JavaScript编程-可选的分号
- HDOJ 1491 Octorber 21st
- PHPqrcode 生成二维码
- s数组与字符串的相互转换方法
- GBDT 学习
- redis 快照 RDB和AOF
- OBIEE12c usage tracking
- Unity运用Gpu来处理计算和逻辑,加快程序速度
- SpringBoot干货系列(一)
- Dijkstra算法