| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 707 | 707 历届试题 格子刷油漆 | 0 / 0 | (None) | |
| 708 | 708 历届试题 农场阳光 | 0 / 0 | (None) | |
| 718 | 718 统计数字 | 4 / 12 | 9 | |
| 723 | 723 求第k大数 | 4 / 26 | 9 | |
| 724 | 724 八皇后 | 0 / 0 | (None) | |
| 725 | 725 [数值问题]素数筛选 | 0 / 0 | (None) | |
| 726 | 726 [贪心算法]排队接水 | 0 / 0 | (None) | |
| 727 | 727 水仙花数 | 0 / 0 | (None) | |
| 728 | 728 求第k大数 | 0 / 0 | (None) | |
| 729 | 729 八皇后 | 0 / 0 | (None) | |
| 730 | 730 [数值问题]素数筛选 | 0 / 0 | (None) | |
| 731 | 731 [贪心算法]排队接水 | 0 / 0 | (None) | |
| 732 | 732 水仙花数 | 0 / 0 | (None) | |
| 733 | 733 方格取数 | 0 / 0 | (None) | |
| 734 | 734 数的计算 | 0 / 0 | (None) | |
| 735 | 735 最大公约数和最小公倍数问题 | 0 / 0 | (None) | |
| 736 | 736 求先序排列 | 1 / 7 | 10 | |
| 737 | 737 装箱问题 | 0 / 0 | (None) | |
| 738 | 738 [ZJOI2009]取石子游戏 | 0 / 0 | (None) | |
| 739 | 739 [ZJOI2009]硬币游戏 | 0 / 0 | (None) | |
| 740 | 740 [ZJOI2008]杀蚂蚁 | 0 / 0 | (None) | |
| 741 | 741 [ZJOI2009]多米诺骨牌 | 0 / 0 | (None) | |
| 742 | 742 [ZJOI2009]狼和羊的故事 | 0 / 0 | (None) | |
| 743 | 743 AB类数计数 | 0 / 0 | (None) | |
| 744 | 744 算式问题 | 0 / 0 | (None) | |
| 745 | 745 方阵填数 | 0 / 0 | (None) | |
| 746 | 746 编码问题 | 0 / 0 | (None) | |
| 747 | 747 灯的排列问题 | 0 / 0 | (None) | |
| 748 | 748 【基础题】梯形面积(2) | 0 / 0 | (None) | |
| 749 | 749 【基础题】圆柱体表面积 | 0 / 0 | (None) | |
| 750 | 750 乘法运算 | 0 / 0 | (None) | |
| 751 | 751 格子问题 | 0 / 0 | (None) | |
| 752 | 752 【入门】百钱百鸡问题 | 0 / 0 | (None) | |
| 753 | 753 字符串编辑 | 0 / 0 | (None) | |
| 754 | 754 比赛安排 | 0 / 0 | (None) | |
| 755 | 755 比赛安排 | 0 / 0 | (None) | |
| 756 | 756 数制转换 | 0 / 0 | (None) | |
| 757 | 757 砝码称重 | 0 / 0 | (None) | |
| 758 | 758 棋盘方格 | 0 / 0 | (None) | |
| 759 | 759 排三角形 | 0 / 0 | (None) | |
| 760 | 760 高精度阶乘的和 | 0 / 0 | (None) | |
| 761 | 761 二的幂次方 | 0 / 0 | (None) | |
| 762 | 762 上下火车 | 0 / 0 | (None) | |
| 763 | 763 联接最大数 | 0 / 0 | (None) | |
| 764 | 764 Cantor表 | 0 / 0 | (None) | |
| 765 | 765 回文数 | 0 / 0 | (None) | |
| 766 | 766 旅行家的预算 | 0 / 0 | (None) | |
| 767 | 767 拦截导弹 | 0 / 0 | (None) | |
| 768 | 768 回文数 | 0 / 0 | (None) | |
| 769 | 769 旅行家的预算 | 0 / 0 | (None) | |
| 770 | 770 邮票面值设计 | 0 / 0 | (None) | |
| 771 | 771 计算器的改良 | 0 / 0 | (None) | |
| 772 | 772 税收与补贴问题 | 0 / 0 | (None) | |
| 773 | 773 乘积最大 | 0 / 0 | (None) | |
| 774 | 774 单词接龙 | 0 / 0 | (None) | |
| 775 | 775 进制转换 | 0 / 0 | (None) | |
| 776 | 776 乘积最大 | 0 / 0 | (None) | |
| 777 | 777 单词接龙 | 0 / 0 | (None) | |
| 778 | 778 方格取数 | 0 / 0 | (None) | |
| 779 | 779 数的计算 | 0 / 0 | (None) | |
| 780 | 780 最大公约数和最小公倍数问题 | 0 / 0 | (None) | |
| 781 | 781 求先序排列 | 0 / 0 | (None) | |
| 782 | 782 装箱问题 | 0 / 0 | (None) | |
| 783 | 783 方格取数 | 0 / 0 | (None) | |
| 784 | 784 数的计算 | 0 / 0 | (None) | |
| 785 | 785 最大公约数和最小公倍数问题 | 0 / 0 | (None) | |
| 786 | 786 求先序排列 | 0 / 0 | (None) | |
| 787 | 787 装箱问题 | 0 / 0 | (None) | |
| 788 | 788 一元三次方程求解 | 0 / 0 | (None) | |
| 789 | 789 数的划分 | 0 / 0 | (None) | |
| 790 | 790 统计单词个数 | 0 / 0 | (None) | |
| 791 | 791 级数求和 | 0 / 0 | (None) | |
| 792 | 792 选数 | 0 / 0 | (None) | |
| 793 | 793 产生数 | 0 / 0 | (None) | |
| 794 | 794 过河卒 | 0 / 0 | (None) | |
| 795 | 795 均分纸牌 | 0 / 0 | (None) | |
| 796 | 796 字串变换 | 0 / 0 | (None) | |
| 797 | 797 自由落体 | 0 / 0 | (None) | |
| 798 | 798 矩形覆盖 | 0 / 0 | (None) | |
| 799 | 799 乒乓球 | 0 / 0 | (None) | |
| 800 | 800 数字游戏 | 0 / 0 | (None) | |
| 801 | 801 栈 | 0 / 0 | (None) | |
| 802 | 802 麦森数 | 0 / 0 | (None) | |
| 803 | 803 神经网络 | 0 / 0 | (None) | |
| 804 | 804 侦探推理 | 0 / 0 | (None) | |
| 805 | 805 加分二叉树 | 0 / 0 | (None) | |
| 806 | 806 传染病控制 | 0 / 0 | (None) | |
| 807 | 807 不高兴的津津 | 0 / 0 | (None) | |
| 808 | 808 花生采摘 | 0 / 0 | (None) | |
| 809 | 809 FBI树 | 0 / 0 | (None) | |
| 810 | 810 火星人 | 0 / 0 | (None) | |
| 811 | 811 津津的储蓄计划 | 0 / 0 | (None) | |
| 812 | 812 合并果子 | 0 / 0 | (None) | |
| 813 | 813 合唱队形 | 0 / 0 | (None) | |
| 814 | 814 虫食算 | 0 / 0 | (None) | |
| 815 | 815 陶陶摘苹果 | 0 / 0 | (None) | |
| 816 | 816 校门外的树 | 0 / 0 | (None) | |
| 817 | 817 采药 | 1 / 4 | 10 | |
| 818 | 818 循环 | 0 / 0 | (None) | |
| 819 | 819 谁拿了最多奖学金 | 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.