Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	282	P1844D Row Major constructive algorithms greedy math number theory strings *1400	0 / 0	4
	280	P1844F1 Min Cost Permutation (Easy Version) brute force constructive algorithms greedy math *2600	0 / 0	10
	279	P1844F2 Min Cost Permutation (Hard Version) binary search constructive algorithms data structures greedy math sortings *2800	0 / 0	10
	274	P1845C Strong Password binary search dp greedy strings *1400	0 / 0	4
	273	P1845D Rating System binary search brute force data structures dp dsu greedy math two pointers *1800	0 / 0	6
	268	P1846C Rudolf and the Another Competition constructive algorithms data structures dp greedy sortings *1200	0 / 0	4
	263	P1846G Rudolf and CodeVid-23 bitmasks dp graphs greedy shortest paths *1900	0 / 0	6
	262	P1847A The Man who became a God greedy sortings *800	0 / 0	3
	261	P1847B Hamon Odyssey bitmasks greedy two pointers *1000	0 / 0	3
	260	P1847C Vampiric Powers, anyone? bitmasks brute force dp greedy *1400	0 / 0	4
	259	P1847D Professor Higashikata data structures dsu greedy implementation strings *1900	0 / 0	6
	257	P1847F The Boss's Identity binary search bitmasks data structures dfs and similar greedy math sortings *2500	0 / 0	9
	255	P1848B Vika and the Bridge binary search data structures greedy implementation math sortings *1200	0 / 0	4
	249	P1849B Monsters greedy math sortings *1000	0 / 0	3
	247	P1849D Array Painting constructive algorithms greedy two pointers *1700	0 / 0	5
	245	P1849F XOR Partition binary search bitmasks data structures divide and conquer greedy trees *2700	0 / 0	10
	241	P1850D Balanced Round brute force greedy implementation sortings *900	0 / 0	3
	237	P1850H The Third Letter dfs and similar dsu graphs greedy implementation *1700	0 / 0	5
	235	P1851B Parity Sort greedy sortings two pointers *800	0 / 0	3
	234	P1851C Tiles Comeback greedy *1000	0 / 0	3
	231	P1851F Lisa and the Martians bitmasks greedy math strings trees *1800	0 / 0	6
	228	P1852B Imbalanced Arrays constructive algorithms graphs greedy math sortings two pointers *1800	0 / 0	6
	227	P1852C Ina of the Mountain data structures dp greedy math *2400	0 / 0	9
	226	P1852D Miriany and Matchstick constructive algorithms dp greedy *2800	0 / 0	10
	225	P1852E Rivalries constructive algorithms data structures greedy *3400	0 / 0	10
	223	P1853A Desorting brute force greedy math *800	0 / 0	3
	216	P1854E Game Bundles brute force constructive algorithms dp greedy math *3000	0 / 0	10
	214	P1855A Dalton the Teacher greedy math *800	0 / 0	3
	213	P1855B Longest Divisors Interval brute force combinatorics greedy math number theory *900	0 / 0	3
	207	P1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft greedy implementation math trees *2700	0 / 0	10
	206	P1857A Array Coloring greedy math *800	0 / 0	3
	205	P1857B Maximum Rounding greedy implementation math *1100	0 / 0	3
	204	P1857C Assembly via Minimums greedy sortings *1200	0 / 0	4
	200	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	199	P1858A Buttons games greedy math *800	0 / 0	3
	198	P1858B The Walkway brute force dp greedy math number theory *1500	0 / 0	5
	197	P1858C Yet Another Permutation Problem constructive algorithms greedy math number theory *1000	0 / 0	3
	196	P1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	8
	192	P1859B Olya and Game with Arrays constructive algorithms greedy math sortings *1000	0 / 0	3
	191	P1859C Another Permutation Problem brute force dp greedy math *1200	0 / 0	4
	190	P1859D Andrey and Escape from Capygrad binary search data structures dp dsu greedy sortings *1800	0 / 0	6
	186	P1860B Fancy Coins binary search brute force greedy math *1200	0 / 0	4
	185	P1860C Game on Permutation data structures dp games greedy *1400	0 / 0	4
	180	P1861B Two Binary Strings constructive algorithms dp greedy *1000	0 / 0	3
	178	P1861D Sorting By Multiplication dp greedy *1800	0 / 0	6
	176	P1861F Four Suits binary search bitmasks flows greedy *3200	0 / 0	10
	175	P1862A Gift Carpet dp greedy implementation strings *800	0 / 0	3
	171	P1862E Kolya and Movie Theatre constructive algorithms data structures greedy *1600	0 / 0	5
	168	P1863A Channel greedy implementation *800	0 / 0	3
	167	P1863B Split Sort greedy math sortings *1100	0 / 0	3
	165	P1863D Two-Colored Dominoes constructive algorithms greedy *1400	0 / 0	4
	164	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	7
	159	P1864A Increasing and Decreasing constructive algorithms greedy implementation math *800	0 / 0	3
	158	P1864B Swap and Reverse constructive algorithms greedy sortings strings *1100	0 / 0	3
	156	P1864D Matrix Cascade brute force constructive algorithms data structures dp greedy math *1700	0 / 0	5
	151	P1864I Future Dominators graphs greedy *3500	0 / 0	10
	147	P1866D Digital Wallet dp greedy *2300	0 / 0	8
	144	P1866G Grouped Carriages binary search data structures dp flows greedy *2100	0 / 0	7
	135	P1867C Salyg1n and the MEX Game constructive algorithms data structures games greedy interactive *1300	0 / 0	4
	134	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation *1800	0 / 0	6
	131	P1867F Most Different Tree brute force constructive algorithms dfs and similar greedy hashing *2700	0 / 0	10
	129	P1868B1 Candy Party (Easy Version) bitmasks constructive algorithms graphs greedy implementation math *1700	0 / 0	5
	128	P1868B2 Candy Party (Hard Version) bitmasks constructive algorithms dp greedy implementation math *2100	0 / 0	7
	126	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees *3000	0 / 0	10
	125	P1868E Min-Sum-Max constructive algorithms dp greedy *3500	0 / 0	10
	124	P1868F LIS? data structures greedy implementation *3500	0 / 0	10
	121	P1870A MEXanized Array constructive algorithms greedy math *800	0 / 0	3
	120	P1870B Friendly Arrays bitmasks greedy math *1200	0 / 0	4
	118	P1870D Prefix Purchase greedy implementation sortings *1800	0 / 0	6
	114	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	113	P1872A Two Vessels brute force greedy math *800	0 / 0	3
	112	P1872B The Corridor or There and Back Again greedy implementation *900	0 / 0	3
	107	P1872G Replace With Product brute force greedy math *2000	0 / 0	7
	105	P1873B Good Kid brute force greedy math *800	0 / 0	3
	103	P1873D 1D Eraser greedy implementation two pointers *800	0 / 0	3
	101	P1873F Money Trees binary search greedy math two pointers *1300	0 / 0	4
	100	P1873G ABBC or BACB constructive algorithms greedy *1500	0 / 0	5
	98	P1874A Jellyfish and Game brute force games greedy implementation *1200	0 / 0	4
	96	P1874C Jellyfish and EVA dp graphs greedy math probabilities *2300	0 / 0	8
	91	P1875A Jellyfish and Undertale brute force greedy *900	0 / 0	3
	90	P1875C Jellyfish and Green Apple bitmasks greedy math number theory *1400	0 / 0	4
	88	P1876A Helmets in Night Light greedy sortings *1000	0 / 0	3
	86	P1876C Autosynthesis constructive algorithms dfs and similar graphs greedy sortings *2100	0 / 0	7
	82	P1876G Clubstep binary search brute force data structures greedy trees *3500	0 / 0	10
	79	P1878A How Much Does Daytona Cost? greedy *800	0 / 0	3
	76	P1878D Reverse Madness data structures greedy *1600	0 / 0	5
	75	P1878E Iva & Pav binary search bitmasks data structures greedy *1400	0 / 0	4
	72	P1879A Rigged! greedy *800	0 / 0	3
	71	P1879B Chips on the Board constructive algorithms greedy *900	0 / 0	3
	70	P1879C Make it Alternating combinatorics dp greedy *1300	0 / 0	4
	59	P1882A Increasing Sequence greedy *800	0 / 0	3
	58	P1882B Sets and Union bitmasks brute force constructive algorithms greedy *1300	0 / 0	4
	57	P1882C Card Game brute force greedy *1500	0 / 0	5
	56	P1882D Tree XOR bitmasks dfs and similar dp greedy trees *1900	0 / 0	6
	55	P1882E1 Two Permutations (Easy Version) brute force constructive algorithms greedy number theory *2400	0 / 0	9
	50	P1883D In Love data structures greedy *1500	0 / 0	5
	49	P1883E Look Back bitmasks greedy *1700	0 / 0	5
	47	P1883G1 Dances (Easy version) binary search greedy two pointers *1400	0 / 0	4
	46	P1883G2 Dances (Hard Version) binary search greedy sortings two pointers *1900	0 / 0	6
	45	P1884A Simple Design brute force greedy math *800	0 / 0	3

Pick a problem randomly based on the current filter.