two pointers - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3861	CF1305B Kuroni and Simple Strings constructive algorithms greedy strings two pointers *1200	0 / 0	(None)
3826	CF1312F Attack on Red Kingdom games two pointers *2500	0 / 0	(None)
3818	CF1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	(None)
3786	CF1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	(None)
3771	CF1326E Bombs data structures two pointers *2400	0 / 0	(None)
3761	CF1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	(None)
3725	CF1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	(None)
3721	CF1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	(None)
3708	CF1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
3707	CF1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
3704	CF1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	(None)
3675	CF1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	(None)
3670	CF1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	(None)
3668	CF1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	(None)
3620	CF1352E Special Elements brute force implementation two pointers *1500	0 / 0	(None)
3609	CF1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	(None)
3599	CF1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	(None)
3561	CF1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(None)
3556	CF1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)
3554	CF1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	(None)
3526	CF1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	(None)
3525	CF1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	(None)
3510	CF1366B Shuffle math two pointers *1300	0 / 0	(None)
3507	CF1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
3498	CF1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(None)
3497	CF1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
3484	CF1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(None)
3460	CF1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	(None)
3447	CF1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(None)
3444	CF1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	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)
3421	CF1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(None)
3416	CF1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	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)
3407	CF1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
3374	CF1389C Good String brute force dp greedy two pointers *1500	0 / 0	(None)
3348	CF1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(None)
3347	CF1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(None)
3334	CF1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	(None)
3325	CF1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	(None)
3320	CF1399C Boats Competition brute force greedy two pointers *1200	0 / 0	(None)
3317	CF1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(None)
3311	CF1400D Zigzags brute force combinatorics data structures math two pointers *1900	0 / 0	(None)
3308	CF1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	(None)
3296	CF1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	(None)
3291	CF1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	(None)
3277	CF1407C Chocolate Bunny constructive algorithms interactive math two pointers *1600	0 / 0	(None)
3272	CF1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	(None)
3271	CF1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(None)
3260	CF1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	(None)
3248	CF1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	(None)
3237	CF1416A k-Amazing Numbers binary search data structures implementation two pointers *1500	0 / 0	(None)
3222	CF1418F Equal Product data structures math number theory two pointers *3000	0 / 0	(None)
3221	CF1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	(None)
3216	CF1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	(None)
3182	CF1423K Lonely Numbers binary search math number theory two pointers *1600	0 / 0	(None)
3145	CF1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(None)
3138	CF1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	(None)
3132	CF1431B Polycarp and the Language of Gods special problem implementation two pointers 1400	0 / 0	(None)
3126	CF1431H Rogue-like Game special problem brute force greedy two pointers 2600	0 / 0	(None)
3109	CF1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	(None)
3101	CF1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	(None)
3095	CF1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	(None)
3073	CF1443E Long Permutation brute force math two pointers *2400	0 / 0	(None)
3060	CF1446D2 Frequency Problem (Hard Version) data structures greedy two pointers *3000	0 / 0	(None)
3050	CF1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	(None)
3031	CF1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	(None)
3016	CF1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	(None)
2990	CF1462A Favorite Sequence implementation two pointers *800	0 / 0	(None)
2986	CF1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	(None)
2985	CF1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	(None)
2979	CF1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	(None)
2941	CF1469C Building a Fence dp greedy implementation two pointers *1600	0 / 0	(None)
2939	CF1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	(None)
2937	CF1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	(None)
2932	CF1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	(None)
2923	CF1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	(None)
2903	CF1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	(None)
2892	CF1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	(None)
2837	CF1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
2803	CF1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	(None)
2796	CF1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	0 / 0	(None)
2795	CF1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	(None)
2790	CF1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	(None)
2772	CF1497E1 Square-Free Division (easy version) data structures dp greedy math number theory two pointers *1700	0 / 0	(None)
2771	CF1497E2 Square-Free Division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	(None)
2753	CF1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	(None)
2752	CF1500D Tiles for Bathroom data structures sortings two pointers *2900	0 / 0	(None)
2743	CF1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
2742	CF1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	(None)
2719	CF1508A Binary Literature constructive algorithms greedy implementation strings two pointers *1900	0 / 0	(None)
2690	CF1511G Chips on a Board bitmasks brute force data structures dp games two pointers *2700	0 / 0	(None)
2671	CF1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(None)
2666	CF1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	(None)
2656	CF1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	(None)
2650	CF1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	(None)
2642	CF1519D Maximum Sum of Products brute force dp implementation math two pointers *1600	0 / 0	(None)
2610	CF1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	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