| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 33 | 33 棋盘方格 | 0 / 0 | (None) | |
| 34 | 34 排三角形 | 0 / 0 | (None) | |
| 35 | 35 高精度阶乘的和 | 2 / 10 | 4 | |
| 36 | 36 二的幂次方 | 2 / 3 | 10 | |
| 37 | 37 上下火车 | 0 / 0 | (None) | |
| 38 | 38 联接最大数 | 0 / 0 | (None) | |
| 39 | 39 Cantor表 | 0 / 0 | (None) | |
| 40 | 40 回文数 | 0 / 0 | (None) | |
| 41 | 41 旅行家的预算 | 0 / 0 | (None) | |
| 42 | 42 拦截导弹 | 0 / 0 | (None) | |
| 43 | 43 回文数 | 0 / 0 | (None) | |
| 44 | 44 旅行家的预算 | 0 / 0 | (None) | |
| 45 | 45 邮票面值设计 | 0 / 0 | (None) | |
| 47 | 47 税收与补贴问题 | 0 / 0 | (None) | |
| 48 | 48 乘积最大-easy | 1 / 1 | 10 | |
| 49 | 49 单词接龙 | 1 / 2 | 10 | |
| 50 | 50 进制转换 | 1 / 1 | 10 | |
| 51 | 51 乘积最大-hard | 1 / 3 | 10 | |
| 53 | 53 方格取数 | 1 / 9 | 10 | |
| 55 | 55 最大公约数和最小公倍数问题 | 0 / 0 | (None) | |
| 56 | 56 求先序排列 | 0 / 0 | 4 | |
| 57 | 57 装箱问题 | 0 / 0 | (None) | |
| 58 | 58 一元三次方程求解 | 0 / 0 | (None) | |
| 59 | 59 数的划分 | 0 / 0 | (None) | |
| 60 | 60 统计单词个数 | 0 / 0 | (None) | |
| 61 | 61 级数求和 | 0 / 0 | (None) | |
| 63 | 63 产生数 | 0 / 0 | (None) | |
| 64 | 64 过河卒 | 1 / 1 | 10 | |
| 65 | 65 均分纸牌 | 0 / 0 | (None) | |
| 66 | 66 字串变换 | 1 / 1 | 10 | |
| 72 | 72 九九乘法表 | 0 / 0 | (None) | |
| 73 | 73 素MM | 0 / 0 | (None) | |
| 74 | 74 求第k大数 | 0 / 0 | (None) | |
| 75 | 75 八皇后 | 0 / 0 | (None) | |
| 76 | 76 [数值问题]素数筛选 | 0 / 0 | (None) | |
| 77 | 77 [贪心算法]排队接水 | 0 / 0 | (None) | |
| 78 | 78 水仙花数 | 0 / 0 | (None) | |
| 79 | 79 a1002 | 0 / 0 | (None) | |
| 80 | 80 a1005 | 0 / 0 | (None) | |
| 81 | 81 a1006 | 0 / 0 | (None) | |
| 82 | 82 b1001 | 0 / 0 | (None) | |
| 83 | 83 b1002 | 0 / 0 | (None) | |
| 84 | 84 b1009 | 0 / 0 | (None) | |
| 85 | 85 对称平方数1 | 0 / 0 | (None) | |
| 86 | 86 C语言-水仙花数 | 0 / 0 | (None) | |
| 87 | 87 反序数 | 0 / 0 | (None) | |
| 88 | 88 abc | 0 / 0 | (None) | |
| 89 | 89 百万富翁问题 | 0 / 0 | (None) | |
| 90 | 90 加法等式 | 4 / 7 | 10 | |
| 91 | 91 完数与盈数 | 4 / 9 | 9 | |
| 92 | 92 农夫、羊、菜和狼的故事 | 0 / 0 | (None) | |
| 93 | 93 C语言程序设计教程(第三版)课后习题6.6 | 0 / 0 | (None) | |
| 94 | 94 2005年春浙江省计算机等级考试二级C 编程题(2) | 0 / 0 | (None) | |
| 95 | 95 C语言程序设计教程(第三版)课后习题6.6 | 0 / 0 | (None) | |
| 96 | 96 在同一行输出“Hello World! I'm a C++ program.” | 9 / 20 | 7 | |
| 97 | 97 分行输出“Hello World!”和“ I'm a C++ program.” | 10 / 12 | 8 | |
| 98 | 98 整型变量数值范围练习 | 0 / 0 | (None) | |
| 99 | 99 双精度实数的有效数位和精度误差实验 | 0 / 0 | (None) | |
| 100 | 100 字符型数据与ASCII码实验 | 0 / 0 | (None) | |
| 101 | 101 常数与常量实验 | 0 / 0 | (None) | |
| 102 | 102 数学运算实验 | 0 / 0 | (None) | |
| 103 | 103 组合运算符(复合运算符)实验 | 0 / 0 | (None) | |
| 104 | 104 关系运算实验 | 0 / 0 | (None) | |
| 105 | 105 中级第五课——找回文数1 | 0 / 0 | (None) | |
| 106 | 106 字符数组的定义赋值与输出实验 | 0 / 0 | (None) | |
| 107 | 107 字符串定义与赋值实验 | 0 / 0 | (None) | |
| 108 | 108 字符串输入输出处理实验 | 0 / 0 | (None) | |
| 109 | 109 换零钱 [1*] | 0 / 0 | (None) | |
| 110 | 110 输出N以内的素数 nprime [1*+] | 0 / 0 | (None) | |
| 111 | 111 邮局选址问题 | 0 / 0 | (None) | |
| 112 | 112 跳马问题 [2*+] | 0 / 0 | (None) | |
| 113 | 113 试卷批分 grade [2*] | 0 / 0 | (None) | |
| 114 | 114 求指数方程的根(fxroot) [2*+] ** | 0 / 0 | (None) | |
| 115 | 115 课后习题1.5 | 0 / 0 | (None) | |
| 116 | 116 课后习题6.6 | 0 / 0 | (None) | |
| 117 | 117 自由落体 | 0 / 0 | (None) | |
| 118 | 118 矩形覆盖 | 0 / 0 | (None) | |
| 119 | 119 乒乓球 | 0 / 0 | (None) | |
| 120 | 120 数字游戏 | 0 / 0 | (None) | |
| 121 | 121 栈 | 2 / 3 | 10 | |
| 122 | 122 麦森数 | 0 / 0 | (None) | |
| 123 | 123 神经网络 | 0 / 0 | (None) | |
| 668 | P123 高精度减法 | 3 / 5 | 3 | |
| 124 | 124 侦探推理 | 0 / 0 | (None) | |
| 125 | 125 加分二叉树 | 0 / 0 | (None) | |
| 126 | 126 传染病控制 | 0 / 0 | (None) | |
| 127 | 127 不高兴的津津 | 0 / 0 | (None) | |
| 669 | P127 高精度除法 | 1 / 9 | 10 | |
| 128 | 128 花生采摘 | 0 / 0 | (None) | |
| 129 | 129 FBI树 | 1 / 12 | 10 | |
| 130 | 130 火星人 | 0 / 0 | (None) | |
| 131 | 131 津津的储蓄计划 | 0 / 0 | (None) | |
| 132 | 132 合并果子 | 2 / 5 | 10 | |
| 133 | 133 合唱队形 | 0 / 0 | (None) | |
| 134 | 134 虫食算 | 0 / 0 | (None) | |
| 135 | 135 陶陶摘苹果 | 0 / 0 | (None) | |
| 137 | 137 采药 | 0 / 0 | (None) | |
| 138 | 138 循环 | 0 / 0 | (None) | |
| 139 | 139 谁拿了最多奖学金 | 0 / 0 | (None) | |
| 140 | 140 过河 | 0 / 0 | (None) |
By signing up a Hydro universal account, you can submit code and join discussions in all online judging services provided by us.