ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
9564 | 9564 判断整除 | 0 / 0 | (None) | |
9565 | 9565 踩方格 | 0 / 0 | (None) | |
9566 | 9566 山区建小学 | 0 / 0 | (None) | |
9567 | 9567 逆波兰表达式 | 0 / 0 | (None) | |
9568 | 9568 全排列 | 0 / 0 | (None) | |
9569 | 9569 分解因数 | 0 / 0 | (None) | |
9570 | 9570 菲波那契数列 | 0 / 0 | (None) | |
9571 | 9571 Pell数列 | 0 / 0 | (None) | |
9572 | 9572 扩号匹配问题 | 0 / 0 | (None) | |
9573 | 9573 爬楼梯 | 0 / 0 | (None) | |
9574 | 9574 汉诺塔问题 | 0 / 0 | (None) | |
9575 | 9575 放苹果 | 0 / 0 | (None) | |
9576 | 9576 求最大公约数问题 | 0 / 0 | (None) | |
9577 | 9577 2的幂次方表示 | 0 / 0 | (None) | |
9578 | 9578 分数求和 | 0 / 0 | (None) | |
9579 | 9579 因子分解 | 0 / 0 | (None) | |
9580 | 9580 判断元素是否存在 | 0 / 0 | (None) | |
9581 | 9581 LETTERS | 0 / 0 | (None) | |
9582 | 9582 八皇后问题 | 0 / 0 | (None) | |
9583 | 9583 八皇后 | 0 / 0 | (None) | |
9584 | 9584 迷宫 | 0 / 0 | (None) | |
9585 | 9585 红与黑 | 0 / 0 | (None) | |
9586 | 9586 棋盘问题 | 0 / 0 | (None) | |
9587 | 9587 取石子游戏 | 0 / 0 | (None) | |
9588 | 9588 马走日 | 0 / 0 | (None) | |
9589 | 9589 单词接龙 | 0 / 0 | (None) | |
9590 | 9590 分成互质组 | 0 / 0 | (None) | |
9591 | 9591 An Easy Problem | 0 / 0 | (None) | |
9592 | 9592 最大子矩阵 | 0 / 0 | (None) | |
9593 | 9593 金银岛 | 0 / 0 | (None) | |
9594 | 9594 装箱问题 | 0 / 0 | (None) | |
9595 | 9595 Ride to Office | 0 / 0 | (None) | |
9596 | 9596 书架 | 0 / 0 | (None) | |
9597 | 9597 电池的寿命 | 0 / 0 | (None) | |
9598 | 9598 寻找平面上的极大点 | 0 / 0 | (None) | |
9599 | 9599 最小新整数 | 0 / 0 | (None) | |
9600 | 9600 Crossing River | 0 / 0 | (None) | |
9601 | 9601 接水问题 | 0 / 0 | (None) | |
9602 | 9602 2011 | 0 / 0 | (None) | |
9603 | 9603 输出前k大的数 | 0 / 0 | (None) | |
9604 | 9604 区间合并 | 0 / 0 | (None) | |
9605 | 9605 求排列的逆序数 | 0 / 0 | (None) | |
9606 | 9606 一元三次方程求解 | 0 / 0 | (None) | |
9607 | 9607 统计数字 | 0 / 0 | (None) | |
9608 | 9608 查找最接近的元素 | 0 / 0 | (None) | |
9609 | 9609 二分法求函数的零点 | 0 / 0 | (None) | |
9610 | 9610 网线主管 | 0 / 0 | (None) | |
9611 | 9611 月度开销 | 0 / 0 | (None) | |
9612 | 9612 和为给定数 | 0 / 0 | (None) | |
9613 | 9613 不重复地输出数 | 0 / 0 | (None) | |
9614 | 9614 膨胀的木棍 | 0 / 0 | (None) | |
9615 | 9615 河中跳房子 | 0 / 0 | (None) | |
9616 | 9616 Lake Counting | 0 / 0 | (None) | |
9617 | 9617 The Castle | 0 / 0 | (None) | |
9618 | 9618 仙岛求药 | 0 / 0 | (None) | |
9619 | 9619 走迷宫 | 0 / 0 | (None) | |
9620 | 9620 抓住那头牛 | 0 / 0 | (None) | |
9621 | 9621 走出迷宫 | 0 / 0 | (None) | |
9622 | 9622 迷宫问题 | 0 / 0 | (None) | |
9623 | 9623 献给阿尔吉侬的花束 | 0 / 0 | (None) | |
9624 | 9624 Knight Moves | 0 / 0 | (None) | |
9625 | 9625 数字金字塔 | 0 / 0 | (None) | |
9626 | 9626 求最长不下降序列 | 0 / 0 | (None) | |
9627 | 9627 拦截导弹 | 0 / 0 | (None) | |
9628 | 9628 城市交通路网 | 0 / 0 | (None) | |
9629 | 9629 挖地雷 | 0 / 0 | (None) | |
9630 | 9630 友好城市 | 0 / 0 | (None) | |
9631 | 9631 合唱队形 | 0 / 0 | (None) | |
9632 | 9632 最长公共子序列 | 0 / 0 | (None) | |
9633 | 9633 机器分配 | 0 / 0 | (None) | |
9634 | 9634 01背包问题 | 0 / 0 | (None) | |
9635 | 9635 完全背包问题 | 0 / 0 | (None) | |
9636 | 9636 庆功会 | 0 / 0 | (None) | |
9637 | 9637 混合背包 | 0 / 0 | (None) | |
9638 | 9638 潜水员 | 0 / 0 | (None) | |
9639 | 9639 分组背包 | 0 / 0 | (None) | |
9640 | 9640 货币系统 | 0 / 0 | (None) | |
9641 | 9641 合并石子 | 0 / 0 | (None) | |
9642 | 9642 乘积最大 | 0 / 0 | (None) | |
9643 | 9643 编辑距离 | 0 / 0 | (None) | |
9644 | 9644 方格取数 | 0 / 0 | (None) | |
9645 | 9645 复制书稿 | 0 / 0 | (None) | |
9646 | 9646 橱窗布置 | 0 / 0 | (None) | |
9647 | 9647 滑雪 | 0 / 0 | (None) | |
9648 | 9648 最长上升子序列 | 0 / 0 | (None) | |
9649 | 9649 最大子矩阵 | 0 / 0 | (None) | |
9650 | 9650 登山 | 0 / 0 | (None) | |
9651 | 9651 摘花生 | 0 / 0 | (None) | |
9652 | 9652 最大上升子序列和 | 0 / 0 | (None) | |
9653 | 9653 怪盗基德的滑翔翼 | 0 / 0 | (None) | |
9654 | 9654 最低通行费 | 0 / 0 | (None) | |
9655 | 9655 三角形最佳路径问题 | 0 / 0 | (None) | |
9656 | 9656 拦截导弹 | 0 / 0 | (None) | |
9657 | 9657 采药 | 0 / 0 | (None) | |
9658 | 9658 数字组合 | 0 / 0 | (None) | |
9659 | 9659 宠物小精灵之收服 | 0 / 0 | (None) | |
9660 | 9660 买书 | 0 / 0 | (None) | |
9661 | 9661 Charm Bracelet | 0 / 0 | (None) | |
9662 | 9662 装箱问题 | 0 / 0 | (None) | |
9663 | 9663 开餐馆 | 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.