摘要: Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of mone 阅读全文
posted @ 2019-02-08 01:31 Blind 阅读(412) 评论(0) 推荐(0) 编辑
摘要: There must be many A + B problems in our HDOJ , now a new one is coming. Give you two hexadecimal integers , your task is to calculate the sum of them 阅读全文
posted @ 2019-02-08 01:20 Blind 阅读(179) 评论(0) 推荐(0) 编辑
摘要: Given two rectangles and the coordinates of two points on the diagonals of each rectangle,you have to calculate the area of the intersected part of tw 阅读全文
posted @ 2019-02-08 00:24 Blind 阅读(199) 评论(0) 推荐(0) 编辑
摘要: Give you two numbers A and B, if A is equal to B, you should print "YES", or print "NO". Input each test case contains two numbers A and B. Output for 阅读全文
posted @ 2019-02-08 00:11 Blind 阅读(164) 评论(0) 推荐(0) 编辑
摘要: 有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房,不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。 其中,蜂房的结构如下所示。 Input 输入数据的第一行是一个整数N,表示测试实例的个数,然后是N 行数据,每行包含两个整数a和b(0<a<b<50)。 Output 对于每个测试实例,请输出蜜 阅读全文
posted @ 2019-02-07 23:51 Blind 阅读(156) 评论(0) 推荐(0) 编辑