Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3473	CF1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(None)
3472	CF1371A Magical Sticks math *800	0 / 0	(None)
3471	CF1371B Magical Calendar math *1200	0 / 0	(None)
3470	CF1371C A Cookie for You greedy implementation math *1300	0 / 0	(None)
3469	CF1371D Grid-00100 constructive algorithms greedy implementation *1600	0 / 0	(None)
3467	CF1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(None)
3466	CF1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(None)
3465	CF1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(None)
3464	CF1372A Omkar and Completion constructive algorithms implementation *800	0 / 0	(None)
3463	CF1372B Omkar and Last Class of Math greedy math number theory *1300	0 / 0	(None)
3462	CF1372C Omkar and Baseball constructive algorithms math *1500	0 / 0	(None)
3461	CF1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(None)
3460	CF1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	(None)
3459	CF1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(None)
3458	CF1373A Donut Shops greedy implementation math *1000	0 / 0	(None)
3456	CF1373B 01 Game games *900	0 / 0	(None)
3455	CF1373C Pluses and Minuses math *1300	0 / 0	(None)
3454	CF1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(None)
3453	CF1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(None)
3452	CF1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	(None)
3451	CF1373G Pawns data structures divide and conquer greedy *2600	0 / 0	(None)
3450	CF1374A Required Remainder math *800	0 / 0	(None)
3449	CF1374B Multiply by 2, divide by 6 math *900	0 / 0	(None)
3448	CF1374C Move Brackets greedy strings *1000	0 / 0	(None)
3447	CF1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(None)
3445	CF1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	(None)
3444	CF1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	(None)
3443	CF1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
3442	CF1375A Sign Flipping constructive algorithms math *1100	0 / 0	(None)
3441	CF1375B Neighbor Grid constructive algorithms greedy *1200	0 / 0	(None)
3440	CF1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	(None)
3439	CF1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(None)
3438	CF1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	(None)
3437	CF1375F Integer Game constructive algorithms games interactive math *2600	0 / 0	(None)
3436	CF1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
3434	CF1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(None)
3433	CF1375I Cubic Lattice geometry math matrices number theory *3500	0 / 0	(None)
3432	CF1379A Acacius and String brute force implementation strings *1500	0 / 0	(None)
3431	CF1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	(None)
3430	CF1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
3429	CF1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
3428	CF1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(None)
3427	CF1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	(None)
3426	CF1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(None)
3425	CF1380A Three Indices brute force data structures *900	0 / 0	(None)
3423	CF1380B Universal Solution greedy *1400	0 / 0	(None)
3422	CF1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(None)
3421	CF1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(None)
3420	CF1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	(None)
3419	CF1380F Strange Addition data structures dp matrices *2600	0 / 0	(None)
3418	CF1380G Circular Dungeon greedy math probabilities *2600	0 / 0	(None)
3417	CF1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	(None)
3416	CF1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	(None)
3415	CF1381B Unmerge dp *1800	0 / 0	(None)
3414	CF1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	(None)
3411	CF1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
3410	CF1381E Origami geometry math sortings *3300	0 / 0	(None)
3409	CF1382A Common Subsequence brute force *800	0 / 0	(None)
3408	CF1382B Sequential Nim dp games *1100	0 / 0	(None)
3407	CF1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
3406	CF1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(None)
3405	CF1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
3404	CF1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
3403	CF1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(None)
3402	CF1383F Special Edges flows graphs *3200	0 / 0	(None)
3400	CF1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	(None)
3399	CF1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(None)
3398	CF1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(None)
3397	CF1385A Three Pairwise Maximums math *800	0 / 0	(None)
3396	CF1385B Restore the Permutation by Merger greedy *800	0 / 0	(None)
3395	CF1385C Make It Good greedy *1200	0 / 0	(None)
3394	CF1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
3393	CF1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(None)
3392	CF1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	(None)
3391	CF1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(None)
3389	CF1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	(None)
3388	CF1386B Mixture special problem data structures geometry math sortings 2900	0 / 0	(None)
3387	CF1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(None)
3386	CF1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	(None)
3385	CF1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(None)
3384	CF1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	(None)
3383	CF1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	(None)
3382	CF1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	(None)
3381	CF1388B Captain Flint and a Long Voyage greedy math *1000	0 / 0	(None)
3380	CF1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	(None)
3378	CF1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
3377	CF1388E Uncle Bogdan and Projections data structures geometry sortings *2700	0 / 0	(None)
3376	CF1389A LCM Problem constructive algorithms greedy math number theory *800	0 / 0	(None)
3375	CF1389B Array Walk brute force dp greedy *1600	0 / 0	(None)
3374	CF1389C Good String brute force dp greedy two pointers *1500	0 / 0	(None)
3373	CF1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	(None)
3372	CF1389E Calendar Ambiguity math number theory *2200	0 / 0	(None)
3371	CF1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(None)
3370	CF1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(None)
3369	CF1391A Suborrays constructive algorithms math *800	0 / 0	(None)
3367	CF1391B Fix You brute force greedy implementation *800	0 / 0	(None)
3366	CF1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(None)
3365	CF1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(None)
3364	CF1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	(None)
3363	CF1392A Omkar and Password greedy math *800	0 / 0	(None)

Lucky

Pick a problem randomly based on the current filter.

Categories

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

Status

Development

Support

About

Categories

Status

Development

Support

About

Don't have an account?

SIGN IN