| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 3180 | Py008 最大的乘积【python】 | 1 / 6 | 5 | |
| 4488 | STJX0001 赵老尸大战王之栋 | 2 / 2 | 6 | |
| 4486 | STJX0002 王之栋的魔法 | 2 / 2 | 5 | |
| 1908 | T1001 Hello,World! | 11 / 13 | 7 | |
| 1911 | T1004 字符三角形 | 8 / 12 | 8 | |
| 1913 | T1006 正负数 | 0 / 0 | (None) | |
| 1914 | T1007 计算(a+b)×c的值 | 6 / 7 | 9 | |
| 1915 | T1008 计算(a+b)/c的值 | 4 / 5 | 10 | |
| 1917 | T1010 计算分数的浮点数值 | 3 / 3 | 10 | |
| 1921 | T1014 与圆相关的计算 | 2 / 2 | 10 | |
| 1925 | T1018 其他数据类型存储空间大小 | 4 / 5 | 10 | |
| 1926 | T1019 浮点数向零舍入 | 1 / 3 | 10 | |
| 1930 | T1023 Hello,World!的大小 | 2 / 3 | 10 | |
| 1932 | T1025 保留12位小数的浮点数 | 4 / 5 | 10 | |
| 1934 | T1027 输出浮点数 | 9 / 12 | 1 | |
| 1936 | T1029 计算浮点数相除的余 | 2 / 5 | 10 | |
| 1937 | T1030 计算球的体积 | 2 / 3 | 10 | |
| 1957 | T1031 反向输出一个三位数 | 3 / 3 | 10 | |
| 1959 | T1033 计算线段长度 | 2 / 2 | 10 | |
| 1960 | T1034 计算三角形面积 | 0 / 0 | (None) | |
| 1963 | T1037 计算2的幂 | 4 / 7 | 10 | |
| 1964 | T1038 苹果和虫子 | 2 / 2 | 10 | |
| 2018 | T1093 计算多项式的值 | 0 / 0 | (None) | |
| 2023 | T1098 质因数分解 | 3 / 8 | 10 | |
| 2024 | T1099 第n小质数 | 2 / 5 | 10 | |
| 2025 | T1100 待替换 | 0 / 0 | (None) | |
| 2041 | T1116 最长平台 | 1 / 1 | 10 | |
| 2043 | T1118 铺地毯 | 0 / 0 | (None) | |
| 2089 | T1164 digit函数 | 0 / 0 | (None) | |
| 2096 | T1171 大整数的因子 | 0 / 0 | (None) | |
| 2105 | T1180 待替换 | 0 / 0 | (None) | |
| 2113 | T1188 菲波那契数列(2) | 0 / 0 | (None) | |
| 2122 | T1198 逆波兰表达式 | 0 / 0 | (None) | |
| 2125 | T1201 菲波那契数列 | 0 / 0 | (None) | |
| 2127 | T1203 扩号匹配问题 | 0 / 0 | (None) | |
| 2128 | T1204 爬楼梯 | 1 / 1 | 10 | |
| 2130 | T1207 求最大公约数(模板) | 0 / 0 | (None) | |
| 2131 | T1208 2的幂次方表示 | 0 / 0 | (None) | |
| 2133 | T1210 因子分解 | 0 / 0 | (None) | |
| 2134 | T1211 判断元素是否存在 | 0 / 0 | (None) | |
| 2135 | T1212 LETTERS | 1 / 1 | 10 | |
| 2136 | T1213 八皇后问题 | 1 / 1 | 10 | |
| 2137 | T1214 八皇后 | 0 / 0 | (None) | |
| 2140 | T1217 棋盘问题 | 0 / 1 | 10 | |
| 2141 | T1218 取石子游戏 | 0 / 0 | (None) | |
| 2143 | T1220 单词接龙 | 0 / 0 | (None) | |
| 2144 | T1221 分成互质组 | 0 / 0 | (None) | |
| 2145 | T1223 An Easy Problem | 0 / 0 | (None) | |
| 2146 | T1224 最大子矩阵 | 0 / 0 | (None) | |
| 2148 | T1226 装箱问题 | 0 / 0 | (None) | |
| 2149 | T1227 Ride to Office | 0 / 0 | (None) | |
| 2150 | T1228 书架 | 0 / 0 | (None) | |
| 2154 | T1232 Crossing River | 0 / 0 | (None) | |
| 2164 | T1242 网线主管 | 0 / 0 | (None) | |
| 2165 | T1243 月度开销 | 0 / 0 | (None) | |
| 2167 | T1245 不重复地输出数 | 1 / 1 | 10 | |
| 2168 | T1246 膨胀的木棍 | 0 / 0 | (None) | |
| 2170 | T1248 Dungeon Master | 0 / 0 | (None) | |
| 2175 | T1253 抓住那头牛 | 1 / 1 | 10 | |
| 2178 | T1256 献给阿尔吉侬的花束 | 0 / 0 | (None) | |
| 2182 | T1260 【例9.4】拦截导弹(Noip1999) | 0 / 0 | (None) | |
| 2183 | T1261 【例9.5】城市交通网络 | 0 / 0 | (None) | |
| 2185 | T1263 友好城市 | 0 / 0 | (None) | |
| 2188 | T1266 【例9.10】机器分配 | 0 / 0 | (None) | |
| 2196 | T1274 合并石子(区间dp模板) | 1 / 1 | 10 | |
| 2197 | T1275 乘积最大 | 0 / 0 | (None) | |
| 2199 | T1277 【例9.21】方格取数 | 0 / 0 | (None) | |
| 2200 | T1278 复制书稿2 | 0 / 0 | (None) | |
| 2201 | T1279 橱窗布置(flower) | 0 / 0 | (None) | |
| 2259 | T1287 最低通行费 | 11 / 37 | 6 | |
| 2260 | T1288 三角形最佳路径问题 | 0 / 0 | (None) | |
| 2261 | T1289 拦截导弹 | 0 / 0 | (None) | |
| 2265 | T1293 买书 | 0 / 0 | (None) | |
| 2266 | T1294 Charm Bracelet | 0 / 0 | (None) | |
| 2268 | T1296 开餐馆 | 0 / 0 | (None) | |
| 2271 | T1299 糖果 | 0 / 0 | (None) | |
| 2272 | T1300 鸡蛋的硬度 | 0 / 0 | (None) | |
| 2275 | T1301 大盗阿福 | 1 / 2 | 10 | |
| 2276 | T1302 股票买卖 | 0 / 0 | (None) | |
| 2277 | T1303 鸣人的影分身 | 0 / 0 | (None) | |
| 2278 | T1305 Maximum sum | 0 / 0 | (None) | |
| 2306 | T1309 【例1.6】回文数(Noip1999) | 1 / 5 | 10 | |
| 2281 | T1323 【例6.5】活动选择 | 1 / 1 | 10 | |
| 2282 | T1325 循环比赛日程表 | 0 / 0 | (None) | |
| 2287 | T1326 快速幂(模板) | 4 / 8 | 10 | |
| 2288 | T1327 【例7.6】黑白棋子的移动 | 0 / 0 | (None) | |
| 2290 | T1332 【例2-1】周末舞会 | 8 / 11 | 8 | |
| 2291 | T1334 围圈报数1 | 8 / 13 | 8 | |
| 2298 | T1341 【例题】一笔画问题 | 0 / 0 | (None) | |
| 2300 | T1342 【例4-1】最短路径问题 | 0 / 0 | (None) | |
| 2301 | T1343 【例4-2】牛的旅行 | 0 / 0 | (None) | |
| 2273 | T1345 香甜的黄油 | 0 / 0 | (None) | |
| 2297 | T1346 亲戚(并查集模板1) | 1 / 8 | 10 | |
| 2296 | T1347 【例4-8】格子游戏 | 0 / 0 | (None) | |
| 2355 | T1349 最优布线问题(prim模板) | 0 / 0 | (None) | |
| 2356 | T1350 最短网络(agrinet) | 1 / 1 | 10 | |
| 2311 | T1355 字符串匹配问题(strs) | 0 / 0 | (None) | |
| 2314 | T1358 中缀表达式值(expr) | 1 / 4 | 10 | |
| 2320 | T1364 二叉树遍历(flist) | 1 / 1 | 10 | |
| 2321 | T1365 待替换 | 0 / 0 | (None) |
By signing up a 黑猫OJ universal account, you can submit code and join discussions in all online judging services provided by us.