改善网站体验
我们会记录每日页面访问次数和页面类型,用于改进网站体验。
不会保存原始 IP,也不会记录单次访问时间。分析默认开启,您可以拒绝。
拒绝
接受并继续
谷物 OJ
首页
题库
论坛
提交记录
排行榜
竞赛
OIer 手册
开发者日志
搜索
搜索中
订阅
登录
注册
题库
所有难度
入门
普及-
普及
普及+
提高-
提高
提高+
省选
NOI
标签筛选
搜索
标签筛选
基础算法
模拟
12660
枚举
5780
暴力
2091
贪心
7772
构造
3105
排序
3439
递推
667
二分
1937
三分
85
双指针
973
前缀和
1450
差分
240
分治
371
倍增
75
容斥
287
动态规划
动态规划
5885
背包
276
区间DP
231
树形DP
314
状压DP
367
数位DP
171
记忆化搜索
178
搜索
搜索
1255
深度优先搜索
1091
广度优先搜索
510
折半搜索
65
数学
数学
11898
数论
2411
组合数学
3070
概率期望
672
博弈
709
高精度
313
矩阵
402
线性代数
69
快速傅里叶变换
276
计算几何
978
数据结构
数据结构
2576
栈
210
队列
83
单调栈
86
单调队列
43
堆
177
哈希
1146
哈希表
136
并查集
829
树状数组
156
线段树
410
平衡树
33
ST表
3
可持久化
32
启发式合并
23
莫队
11
扫描线
136
字符串
字符串
3257
KMP
82
字典树
139
后缀结构
159
表达式解析
184
图论
图论
2707
树
1703
最短路
892
最小生成树
149
拓扑排序
171
强连通分量
84
最近公共祖先
179
树链剖分
33
二分图
93
二分图匹配
160
网络流
203
差分约束
43
2-SAT
45
点分治
4
其他
位运算
1369
特殊题
507
题源
洛谷
3056
Codeforces
7888
AtCoder
6267
USACO
518
CodeChef
3496
HackerEarth
2139
AOJ
2118
Kattis
1236
GeeksforGeeks
2462
HackerRank
807
竞赛
IOI
43
NOIP
39
CSP-S
30
CSP-J
28
IOI2023
11
2019
10
IOI2021
10
IOI2022
10
2025
9
历年真题
9
2020
8
2021
8
2022
8
2023
8
2024
8
IOI2020
6
IOI2024
6
题号
标题
难度
标签
通过率
提交数
P18600
[AtCoder] A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.
普及-
模拟
字符串
0.0%
P18599
[AtCoder] You will be given a string S of length 3 representing the weather forecast for three days in the past.
普及-
模拟
枚举
0.0%
P18598
[AtCoder] You are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.
普及-
数学
容斥
数论
0.0%
P18597
[AtCoder] There are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has
普及-
模拟
字符串
0.0%
P18596
[AtCoder] We have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.
普及-
数学
数论
模拟
0.0%
P18595
[AtCoder] We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
普及-
枚举
前缀和
模拟
0.0%
P18594
[AtCoder] In a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.
普及-
贪心
模拟
0.0%
P18593
[AtCoder] There are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.
普及
贪心
堆
排序
0.0%
P18592
[AtCoder] A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:
普及-
字符串
模拟
0.0%
P18591
[AtCoder] There are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.
普及
前缀和
哈希
数学
0.0%
P18590
[AtCoder] Takahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.
普及-
数学
贪心
模拟
0.0%
P18589
[AtCoder] You are given Q tuples of integers (L_i, A_i, B_i, M_i) . For each tuple, answer the following question.
提高-
数学
矩阵
倍增
0.0%
P18588
[AtCoder] Takahashi is standing on a multiplication table with infinitely many rows and columns.
普及-
枚举
数学
数论
0.0%
P18587
[AtCoder] There are N blocks arranged in a row. Let us paint these blocks.
普及
组合数学
数学
动态规划
0.0%
P18586
[AtCoder] Determine if there exists a sequence obtained by permuting 1,2,...,N that satisfies the following conditions:
提高
构造
贪心
数学
0.0%
P18585
[AtCoder] Given is an undirected connected graph with N vertices numbered 1 to N, and M edges numbered 1 to M.
提高-
构造
图论
深度优先搜索
0.0%
P18584
[HackerEarth] In Chotu's World, there were N towns along with M bidirectional roads connecting them. With time, some roads became unusable, and nobody repaired them.
提高
并查集
图论
排序
0.0%
P18583
[HackerEarth] Jaggi and Jojo are interested in problems related with Grids. They were trying different problem on grids, when they found this one. Given a grid of size NXN. Its bottom-left point is (0
普及
组合数学
动态规划
数学
0.0%
P18582
[HackerEarth] You will be given a number n- number of distinguishable objects. Your task is to calculate the number of ways that n objects can be grouped into sets if no set can be empty.
普及
组合数学
动态规划
递推
0.0%
P18581
[HackerEarth] Given two binary numbers A,B i.e., numbers containing only zero or one. Let the i th bit of A and i th bit of B differ by d. We need to form a binary number C such that the i th bit of
普及
模拟
字符串
数学
0.0%
共 30060 道题目
上一页
第 576 / 1503 页
下一页
账号状态
截止时间:
每日签到
—
天
连续签到
签到后可获得对应连续天数奖励
本次奖励将在签到后显示