| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 1058 | P547 导弹拦截 | 0 / 0 | (None) | |
| 1059 | P548 KKT基本算法砍伐树木 | 0 / 0 | (None) | |
| 1060 | P549 斐波那契数列 | 0 / 0 | (None) | |
| 1061 | P550 城市路径 | 0 / 0 | (None) | |
| 1062 | P551 合唱队形 | 0 / 0 | (None) | |
| 1063 | P552 最大的子序列和 | 0 / 0 | (None) | |
| 1064 | P553 飞行员 | 0 / 0 | (None) | |
| 1065 | P554 KKT基本算法背包问题 | 0 / 0 | (None) | |
| 1066 | P555 kkt基本算法门票问题 | 0 / 0 | (None) | |
| 1067 | P556 电影 | 0 / 0 | (None) | |
| 1068 | P557 KKT数据结构101学生成绩 | 0 / 0 | (None) | |
| 1069 | P558 KKT数据结构102年龄排序 | 0 / 0 | (None) | |
| 1070 | P559 乒乓游戏 | 0 / 0 | (None) | |
| 560 | 560 「一本通 2.1 练习 3」Friends | 0 / 0 | (None) | |
| 1071 | P560 程序员输入问题 | 0 / 0 | (None) | |
| 561 | 561 「一本通 2.4 练习 1」玄武密码 | 0 / 0 | (None) | |
| 1072 | P561 关系网络 | 0 / 0 | (None) | |
| 1073 | P562 20190427盒子 | 0 / 0 | (None) | |
| 1074 | P563 梦中统计 | 0 / 0 | (None) | |
| 1075 | P564 采购奖品 | 0 / 0 | (None) | |
| 1076 | P565 统计指定日期是星期几 | 0 / 0 | (None) | |
| 1077 | P566 投票问题一 | 0 / 0 | (None) | |
| 1078 | P567 括号匹配 | 0 / 0 | (None) | |
| 1079 | P568 周末舞会 | 0 / 0 | (None) | |
| 1080 | P569 Blah数集 | 0 / 0 | (None) | |
| 1081 | P570 投票问题二 | 0 / 0 | (None) | |
| 1082 | P571 投票问题三 | 0 / 0 | (None) | |
| 1083 | P572 取牌游戏 | 0 / 0 | (None) | |
| 1084 | P573 栈:回文串的判定 | 0 / 0 | (None) | |
| 1085 | P574 2017篮球队 | 0 / 0 | (None) | |
| 1086 | P575 高级打字机 | 0 / 0 | (None) | |
| 1087 | P576 机器人 | 0 / 0 | (None) | |
| 1088 | P577 序列的第 k 个数 | 0 / 0 | (None) | |
| 1089 | P578 A 的 B 次方 | 0 / 0 | (None) | |
| 1090 | P579 素数 | 0 / 0 | (None) | |
| 1091 | P580 浇花 | 0 / 0 | (None) | |
| 1092 | P581 公交车 | 0 / 0 | (None) | |
| 1093 | P582 解密QQ号 | 0 / 0 | (None) | |
| 1094 | P583 连续和最大 | 0 / 0 | (None) | |
| 1095 | P584 KKT数据结构202身高问题 | 0 / 0 | (None) | |
| 1096 | P585 KKT数据结构201作业统计 | 0 / 0 | (None) | |
| 1097 | P586 KKT数据结构203生日相同问题 | 0 / 0 | (None) | |
| 1098 | P587 找位置 | 0 / 0 | (None) | |
| 1099 | P588 变态的斐波那契 | 0 / 0 | (None) | |
| 1100 | P589 小猫爬山 | 0 / 0 | (None) | |
| 1101 | P590 整数幂 | 0 / 0 | (None) | |
| 1102 | P591 找数 | 0 / 0 | (None) | |
| 1103 | P592 拔河比赛 | 0 / 0 | (None) | |
| 1104 | P593 起床困难综合征 | 0 / 0 | (None) | |
| 1105 | P594 迷宫的最短路径 | 0 / 0 | (None) | |
| 1106 | P595 KKT函数205组合数 | 0 / 0 | (None) | |
| 1107 | P596 棋盘问题F507 | 0 / 0 | (None) | |
| 1108 | P597 排队打水F601 | 0 / 0 | (None) | |
| 1109 | P598 KKT函数206哥德巴赫猜想 | 0 / 0 | (None) | |
| 1110 | P599 均分纸牌F602 | 0 / 0 | (None) | |
| 1111 | P600 KKT函数302求最大公约数 | 0 / 0 | (None) | |
| 1112 | P601 KKT函数506角谷猜想 | 0 / 0 | (None) | |
| 1113 | P602 删数问题F603 | 0 / 0 | (None) | |
| 1114 | P603 KKT函数601孪生素数 | 0 / 0 | (None) | |
| 1115 | P604 活动选择F604 | 0 / 0 | (None) | |
| 1116 | P605 KKT函数604亲密数对 | 0 / 0 | (None) | |
| 1117 | P606 KKT函数605最大的素因子 | 0 / 0 | (None) | |
| 1118 | P607 最长公共上升子序列 | 0 / 0 | (None) | |
| 1119 | P608 自然数拆分 | 0 / 0 | (None) | |
| 1120 | P609 数字组合 | 0 / 0 | (None) | |
| 1121 | P610 低买 | 0 / 0 | (None) | |
| 1122 | P611 最短路径问题 | 0 / 0 | (None) | |
| 1123 | P612 牛的旅行 | 0 / 0 | (None) | |
| 1124 | P613 【模板】单源最短路(弱化版) | 0 / 0 | (None) | |
| 1125 | P614 最小花费 | 0 / 0 | (None) | |
| 1126 | P615 士兵 | 0 / 0 | (None) | |
| 1127 | P616 编辑器 | 0 / 0 | (None) | |
| 1128 | P617 火车进栈 | 0 / 0 | (None) | |
| 1129 | P618 火车进出站问题 | 0 / 0 | (None) | |
| 1130 | P619 直方图中最大的矩形(单调栈) | 0 / 0 | (None) | |
| 1131 | P620 小组队列 | 0 / 0 | (None) | |
| 1132 | P621 兔子与兔子 | 0 / 0 | (None) | |
| 1133 | P622 回文子串的最大长度 | 0 / 0 | (None) | |
| 1134 | P623 超市 | 0 / 0 | (None) | |
| 1135 | P624 香甜的黄油 | 0 / 0 | (None) | |
| 1136 | P625 信使 | 0 / 0 | (None) | |
| 1137 | P626 回文子序列 | 0 / 0 | (None) | |
| 1138 | P627 画家 | 0 / 0 | (None) | |
| 1139 | P628 两只兔子 | 0 / 0 | (None) | |
| 1140 | P629 石子合并1 | 0 / 0 | (None) | |
| 1141 | P630 家谱树 | 0 / 0 | (None) | |
| 1142 | P631 奖金 | 0 / 0 | (None) | |
| 1143 | P632 烦人的幻灯片 | 0 / 0 | (None) | |
| 1144 | P633 确定比赛名次 | 0 / 0 | (None) | |
| 1145 | P634 铲雪车 | 0 / 0 | (None) | |
| 1146 | P635 骑马修栅栏 | 0 / 0 | (None) | |
| 1147 | P636 珍珠 | 0 / 0 | (None) | |
| 1148 | P637 刻录光盘 | 0 / 0 | (None) | |
| 1149 | P638 城市公交网建设问题 | 0 / 0 | (None) | |
| 1150 | P639 最优布线问题 | 0 / 0 | (None) | |
| 1151 | P640 最短网络(agrinet) | 0 / 0 | (None) | |
| 1152 | P641 局域网(net) | 0 / 0 | (None) | |
| 1153 | P642 传递消息 | 0 / 0 | (None) | |
| 1154 | P643 消木块 | 0 / 0 | (None) | |
| 1155 | P644 繁忙的都市(city) | 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.