ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
6351 | 6351 神奇的口袋 | 0 / 0 | (None) | |
6352 | 6352 括号画家 | 0 / 0 | (None) | |
6353 | 6353 多项式相加 | 0 / 0 | (None) | |
6354 | 6354 逆波兰表达式 | 0 / 0 | (None) | |
6355 | 6355 表达式求值 | 0 / 0 | (None) | |
6356 | 6356 扑克牌排序 | 0 / 0 | (None) | |
6357 | 6357 区间合并 | 0 / 0 | (None) | |
6358 | 6358 双端队列 | 0 / 0 | (None) | |
6359 | 6359 奇怪的括号 | 0 / 0 | (None) | |
6360 | 6360 删除数字 | 0 / 0 | (None) | |
6361 | 6361 求逆序对数 | 0 / 0 | (None) | |
6362 | 6362 最小新整数 | 0 / 0 | (None) | |
6363 | 6363 红与黑 | 0 / 0 | (None) | |
6364 | 6364 密室逃脱 | 0 / 0 | (None) | |
6365 | 6365 圣诞老人的礼物 | 0 / 0 | (None) | |
6366 | 6366 数字变换 | 0 / 0 | (None) | |
6367 | 6367 求逆序对问题 | 0 / 0 | (None) | |
6368 | 6368 电话号码 | 0 / 0 | (None) | |
6369 | 6369 合法出栈序列 | 0 / 0 | (None) | |
6370 | 6370 忍者道具 | 0 / 0 | (None) | |
6371 | 6371 栈基本操作 | 0 / 0 | (None) | |
6372 | 6372 抓牛 | 0 / 0 | (None) | |
6373 | 6373 字符串插入 | 0 / 0 | (None) | |
6374 | 6374 多项式相加 | 0 / 0 | (None) | |
6375 | 6375 滑动窗口 | 0 / 0 | (None) | |
6376 | 6376 拼写检查 | 0 / 0 | (None) | |
6377 | 6377 扩号匹配问题 | 0 / 0 | (None) | |
6378 | 6378 小白鼠再排队2 | 0 / 0 | (None) | |
6379 | 6379 利用队列进行数字排序 | 0 / 0 | (None) | |
6380 | 6380 泳池 | 0 / 0 | (None) | |
6381 | 6381 问题求解 | 0 / 0 | (None) | |
6382 | 6382 书架 | 0 / 0 | (None) | |
6383 | 6383 交易市场 | 0 / 0 | (None) | |
6384 | 6384 漫漫回国路 | 0 / 0 | (None) | |
6385 | 6385 山区建小学 | 0 / 0 | (None) | |
6386 | 6386 求逆序对数 | 0 / 0 | (None) | |
6387 | 6387 通配符匹配 | 0 / 0 | (None) | |
6388 | 6388 分成互质组 | 0 / 0 | (None) | |
6389 | 6389 逃离迷宫 | 0 / 0 | (None) | |
6390 | 6390 Project Summer游戏 | 0 / 0 | (None) | |
6391 | 6391 晶矿的个数 | 0 / 0 | (None) | |
6392 | 6392 夺宝探险 | 0 / 0 | (None) | |
6393 | 6393 城堡问题 | 0 / 0 | (None) | |
6394 | 6394 冠军之路 | 0 / 0 | (None) | |
6395 | 6395 玩具摆放 | 0 / 0 | (None) | |
6396 | 6396 斗地主大师 | 0 / 0 | (None) | |
6397 | 6397 生日相同 2.0 | 0 / 0 | (None) | |
6398 | 6398 哥斯拉大战金刚 | 0 / 0 | (None) | |
6399 | 6399 控制公司 | 0 / 0 | (None) | |
6400 | 6400 青蛙的约会 | 0 / 0 | (None) | |
6401 | 6401 发现它,抓住它 | 0 / 0 | (None) | |
6402 | 6402 (a/b)*c的值 | 0 / 0 | (None) | |
6403 | 6403 加一 | 0 / 0 | (None) | |
6404 | 6404 整数的立方和 | 0 / 0 | (None) | |
6405 | 6405 判断是否存在重复的数 | 0 / 0 | (None) | |
6406 | 6406 数组逆序重放 | 0 / 0 | (None) | |
6407 | 6407 自整除数 | 0 / 0 | (None) | |
6408 | 6408 最长最短单词 | 0 / 0 | (None) | |
6409 | 6409 病人排队 | 0 / 0 | (None) | |
6410 | 6410 计算鞍点 | 0 / 0 | (None) | |
6411 | 6411 鸡兔同笼 | 0 / 0 | (None) | |
6412 | 6412 循环数 | 0 / 0 | (None) | |
6413 | 6413 扩号匹配问题 | 0 / 0 | (None) | |
6414 | 6414 猴子吃桃 | 0 / 0 | (None) | |
6415 | 6415 迷信的病人 | 0 / 0 | (None) | |
6416 | 6416 数根 | 0 / 0 | (None) | |
6417 | 6417 课程冲突 | 0 / 0 | (None) | |
6418 | 6418 算24 | 0 / 0 | (None) | |
6419 | 6419 42点 | 0 / 0 | (None) | |
6420 | 6420 课程表 | 0 / 0 | (None) | |
6421 | 6421 棋盘问题 | 0 / 0 | (None) | |
6422 | 6422 数字变换 | 0 / 0 | (None) | |
6423 | 6423 队列和栈 | 0 / 0 | (None) | |
6424 | 6424 拯救公主 | 0 / 0 | (None) | |
6425 | 6425 42点 | 0 / 0 | (None) | |
6426 | 6426 词典 | 0 / 0 | (None) | |
6427 | 6427 寻找边缘 | 0 / 0 | (None) | |
6428 | 6428 出栈序列统计 | 0 / 0 | (None) | |
6429 | 6429 栈的基本操作 | 0 / 0 | (None) | |
6430 | 6430 stack or queue | 0 / 0 | (None) | |
6431 | 6431 合影效果 | 0 / 0 | (None) | |
6432 | 6432 发型糟糕的一天 | 0 / 0 | (None) | |
6433 | 6433 迷宫问题 | 0 / 0 | (None) | |
6434 | 6434 红与黑 | 0 / 0 | (None) | |
6435 | 6435 二叉树的深度 | 0 / 0 | (None) | |
6436 | 6436 有多少种二叉树 | 0 / 0 | (None) | |
6437 | 6437 表达式· 表达式树· 表达式求值 | 0 / 0 | (None) | |
6438 | 6438 快速堆猪 | 0 / 0 | (None) | |
6439 | 6439 城堡问题 | 0 / 0 | (None) | |
6440 | 6440 二叉树的深度 | 0 / 0 | (None) | |
6441 | 6441 重建二叉树 | 0 / 0 | (None) | |
6442 | 6442 Sequence | 0 / 0 | (None) | |
6443 | 6443 迷宫 | 0 / 0 | (None) | |
6444 | 6444 道路 | 0 / 0 | (None) | |
6445 | 6445 priority queue练习题 | 0 / 0 | (None) | |
6446 | 6446 机器翻译 | 0 / 0 | (None) | |
6447 | 6447 最长上升子序列 | 0 / 0 | (None) | |
6448 | 6448 上机 | 0 / 0 | (None) | |
6449 | 6449 滑雪 | 0 / 0 | (None) | |
6450 | 6450 中缀表达式的值 | 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.