greedy - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3639	CF1349B Orac and Medians constructive algorithms greedy math *2000	0 / 0	(None)
3633	CF1349E Slime and Hats constructive algorithms dp greedy *3500	0 / 0	(None)
3617	CF1353A Most Unstable Array constructive algorithms greedy math *800	0 / 0	(None)
3616	CF1353B Two Arrays And Swaps greedy sortings *800	0 / 0	(None)
3613	CF1353E K-periodic Garland brute force dp greedy *1900	0 / 0	(None)
3604	CF1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
3600	CF1355B Young Explorers dp greedy sortings *1200	0 / 0	(None)
3597	CF1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	(None)
3564	CF1358A Park Lighting greedy math *800	0 / 0	(None)
3563	CF1358B Maria Breaks the Self-isolation greedy sortings *1000	0 / 0	(None)
3561	CF1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(None)
3560	CF1358E Are You Fired? constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
3559	CF1358F Tasty Cookie binary search constructive algorithms greedy implementation *2700	0 / 0	(None)
3558	CF1359A Berland Poker brute force greedy math *1000	0 / 0	(None)
3556	CF1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)
3551	CF1360A Minimal Square greedy math *800	0 / 0	(None)
3550	CF1360B Honest Coach greedy sortings *800	0 / 0	(None)
3549	CF1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	(None)
3544	CF1360G A/B Matrix constructive algorithms greedy math *1900	0 / 0	(None)
3542	CF1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	(None)
3541	CF1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	(None)
3539	CF1361D Johnny and James greedy implementation math trees *2900	0 / 0	(None)
3533	CF1362C Johnny and Another Rating Drop bitmasks greedy math *1400	0 / 0	(None)
3528	CF1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(None)
3525	CF1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	(None)
3522	CF1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	(None)
3521	CF1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	(None)
3519	CF1365A Matrix Game games greedy implementation *1100	0 / 0	(None)
3517	CF1365C Rotation Matching constructive algorithms data structures greedy implementation *1400	0 / 0	(None)
3516	CF1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	(None)
3511	CF1366A Shovels and Swords binary search greedy math *1100	0 / 0	(None)
3509	CF1366C Palindromic Paths greedy math *1500	0 / 0	(None)
3503	CF1367B Even Array greedy math *800	0 / 0	(None)
3502	CF1367C Social Distance constructive algorithms greedy math *1300	0 / 0	(None)
3500	CF1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	(None)
3499	CF1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	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)
3496	CF1368A C+= brute force greedy implementation math *800	0 / 0	(None)
3495	CF1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	(None)
3493	CF1368D AND, OR and square sum bitmasks greedy math *1700	0 / 0	(None)
3492	CF1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(None)
3488	CF1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(None)
3485	CF1369B AccurateLee greedy implementation strings *1200	0 / 0	(None)
3484	CF1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(None)
3483	CF1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
3482	CF1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(None)
3480	CF1370A Maximum GCD greedy implementation math number theory *800	0 / 0	(None)
3476	CF1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(None)
3475	CF1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	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)
3463	CF1372B Omkar and Last Class of Math greedy math number theory *1300	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)
3458	CF1373A Donut Shops greedy implementation math *1000	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)
3448	CF1374C Move Brackets greedy strings *1000	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)
3441	CF1375B Neighbor Grid constructive algorithms greedy *1200	0 / 0	(None)
3440	CF1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	(None)
3438	CF1375E Inversion SwapSort constructive algorithms greedy sortings *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)
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)
3418	CF1380G Circular Dungeon greedy math probabilities *2600	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)
3406	CF1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(None)
3404	CF1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	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)
3396	CF1385B Restore the Permutation by Merger greedy *800	0 / 0	(None)
3395	CF1385C Make It Good greedy *1200	0 / 0	(None)
3392	CF1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	(None)
3385	CF1387B1 Village (Minimum) special problem dp greedy trees 2100	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)
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)
3367	CF1391B Fix You brute force greedy implementation *800	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)
3361	CF1392C Omkar and Waterslide greedy implementation *1200	0 / 0	(None)
3360	CF1392D Omkar and Bed Wars dp greedy *1700	0 / 0	(None)
3358	CF1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	(None)
3353	CF1393A Rainbow Dash, Fluttershy and Chess Coloring greedy math *800	0 / 0	(None)
3352	CF1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	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