03 2023 档案

HDOJ 2071-2080
摘要：2071Max Num Problem Description There are some students in a class, Can you help teacher find the highest student . Input There are some cases. The fi 阅读全文
posted @ 2023-03-14 19:03 EleclouD 阅读(40) 评论(0) 推荐(0)
HDOJ 2061-2070
摘要：2061Treasure the new start, freshmen! Problem Description background: A new semester comes , and the HDU also meets its 50th birthday. No matter what' 阅读全文
posted @ 2023-03-04 16:25 EleclouD 阅读(24) 评论(0) 推荐(0)
HDOJ 2051-2060
摘要：2050Bitset Problem Description Give you a number on base ten,you should output it on base two.(0 < n < 1000) Input For each case there is a postive nu 阅读全文
posted @ 2023-03-03 19:01 EleclouD 阅读(261) 评论(0) 推荐(0)
HDOJ 2041-2050(递归专题)
摘要：2041超级楼梯 Problem Description 有一楼梯共M级，刚开始时你在第一级，若每次只能跨上一级或二级，要走上第M级，共有多少种走法？ Input 输入数据首先包含一个整数N，表示测试实例的个数，然后是N行数据，每行包含一个整数M（1<=M<=40）,表示楼梯的级数。 Output 阅读全文
posted @ 2023-03-02 20:12 EleclouD 阅读(55) 评论(0) 推荐(0)