ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
4405 | P4405 奶牛体检(银) | 0 / 0 | (None) | |
3175 | Py003 第十三届蓝桥杯青少组省赛Python单项选择题1 | 4 / 9 | 9 | |
3180 | Py008 最大的乘积【python】 | 1 / 6 | 5 | |
1908 | T1001 Hello,World! | 7 / 9 | 9 | |
1909 | T1002 输出第二个整数 | 8 / 8 | 9 | |
1910 | T1003 对齐输出 | 3 / 6 | 10 | |
1911 | T1004 字符三角形 | 6 / 9 | 9 | |
1913 | T1006 正负数 | 0 / 0 | (None) | |
1914 | T1007 计算(a+b)×c的值 | 4 / 4 | 10 | |
1915 | T1008 计算(a+b)/c的值 | 3 / 4 | 10 | |
1917 | T1010 计算分数的浮点数值 | 2 / 2 | 10 | |
1918 | T1011 甲流疫情死亡率 | 1 / 1 | 10 | |
1921 | T1014 与圆相关的计算 | 1 / 1 | 10 | |
1923 | T1016 整型数据类型存储空间大小 | 3 / 3 | 10 | |
1924 | T1017 浮点型数据类型存储空间大小 | 3 / 3 | 10 | |
1925 | T1018 其他数据类型存储空间大小 | 4 / 5 | 10 | |
1926 | T1019 浮点数向零舍入 | 1 / 3 | 10 | |
1927 | T1020 打印ASCII码 | 2 / 2 | 10 | |
1929 | T1022 整型与布尔型的转换 | 2 / 4 | 10 | |
1930 | T1023 Hello,World!的大小 | 1 / 2 | 10 | |
1931 | T1024 保留3位小数的浮点数 | 2 / 2 | 10 | |
1932 | T1025 保留12位小数的浮点数 | 3 / 4 | 10 | |
1933 | T1026 空格分隔输出 | 2 / 2 | 10 | |
1934 | T1027 输出浮点数 | 6 / 8 | 1 | |
1935 | T1028 字符菱形 | 2 / 2 | 10 | |
1936 | T1029 计算浮点数相除的余 | 1 / 1 | 10 | |
1937 | T1030 计算球的体积 | 1 / 2 | 10 | |
1957 | T1031 反向输出一个三位数 | 2 / 2 | 10 | |
1959 | T1033 计算线段长度 | 1 / 1 | 10 | |
1960 | T1034 计算三角形面积 | 0 / 0 | (None) | |
1963 | T1037 计算2的幂 | 1 / 1 | 10 | |
1964 | T1038 苹果和虫子 | 1 / 1 | 10 | |
2012 | T1087 级数求和 | 0 / 0 | (None) | |
2018 | T1093 计算多项式的值 | 0 / 0 | (None) | |
2023 | T1098 质因数分解 | 0 / 5 | 10 | |
2024 | T1099 第n小质数 | 1 / 4 | 10 | |
2025 | T1100 金币 | 0 / 0 | (None) | |
2028 | T1103 陶陶摘苹果 | 1 / 1 | 10 | |
2041 | T1116 最长平台 | 0 / 0 | (None) | |
2043 | T1118 铺地毯 | 0 / 0 | (None) | |
2089 | T1164 digit函数 | 0 / 0 | (None) | |
2096 | T1171 大整数的因子 | 0 / 0 | (None) | |
4286 | T1177 202407---奇数单增序列 | 0 / 0 | (None) | |
2105 | T1180 分数线划定 | 0 / 0 | (None) | |
2106 | T1181 整数奇偶排序 | 0 / 0 | (None) | |
2109 | T1184 待替换 | 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 | 0 / 0 | (None) | |
2136 | T1213 八皇后问题 | 0 / 0 | (None) | |
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) | |
2162 | T1240 查找最接近的元素 | 0 / 0 | (None) | |
2164 | T1242 网线主管 | 0 / 0 | (None) | |
2165 | T1243 月度开销 | 0 / 0 | (None) | |
2166 | T1244 和为给定数 | 0 / 0 | (None) | |
2167 | T1245 不重复地输出数 | 0 / 0 | (None) | |
2168 | T1246 膨胀的木棍 | 0 / 0 | (None) | |
2169 | T1247 河中跳房子 | 0 / 0 | (None) | |
2170 | T1248 Dungeon Master | 0 / 0 | (None) | |
2175 | T1253 抓住那头牛 | 0 / 0 | (None) | |
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) | |
2194 | T1272 分组背包 | 2 / 4 | 10 | |
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 最低通行费 | 10 / 36 | 7 | |
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 大盗阿福 | 0 / 0 | (None) | |
2276 | T1302 股票买卖 | 0 / 0 | (None) | |
2277 | T1303 鸣人的影分身 | 0 / 0 | (None) | |
2278 | T1305 Maximum sum | 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.