GCD
The__sea
努力,上进,加油!!!
展开
-
HDU - 1222 Wolf and Rabbit
HDU 1222 wolf andThere is a hill with n holes around. The holes are signed from 0 to n-1. A rabbit must hide in one of the holes. A wolf searches the rabbit in anticlockwise orde原创 2017-08-22 10:17:30 · 349 阅读 · 0 评论 -
HDU - 1722 Cake
HDU - 1722 Cake一次生日Party可能有p人或者q人参加,现准备有一个大蛋糕.问最少要将蛋糕切成多少块(每块大小不一定相等),才能使p人或者q人出席的任何一种情况,都能平均将蛋糕分食. Input每行有两个数p和q. Output输出最少要将蛋糕切成多少块. Sample Input2 3Sample Outpu原创 2017-08-22 10:56:14 · 366 阅读 · 0 评论