Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8057	P238A Not Wool Sequences constructive algorithms math *1300	0 / 0	4
	8056	P238B Boring Partition constructive algorithms *1800	0 / 0	6
	8055	P238C World Eater Brothers dfs and similar dp greedy trees *2100	0 / 0	7
	8054	P238D Tape Programming data structures implementation *2900	0 / 0	10
	8053	P238E Meeting Her dp graphs shortest paths *2600	0 / 0	10
	8052	P239A Two Bags of Potatoes greedy implementation math *1200	0 / 0	4
	8051	P239B Easy Tape Programming brute force implementation *1500	0 / 0	5
	8050	P240E Road Repairs dfs and similar graphs greedy *2800	0 / 0	10
	8049	P240F TorCoder data structures *2600	0 / 0	10
	8048	P241A Old Peykan greedy *1300	0 / 0	4
	8047	P241B Friends binary search bitmasks data structures math *2700	0 / 0	10
	8046	P241C Mirror Box geometry implementation *2000	0 / 0	7
	8045	P241D Numbers *2900	0 / 0	10
	8044	P241E Flights graphs shortest paths *2600	0 / 0	10
	8043	P241F Race brute force implementation *2300	0 / 0	8
	8042	P241G Challenging Balloons constructive algorithms *1900	0 / 0	6
	8041	P242A Heads or Tails brute force implementation *1100	0 / 0	3
	8040	P242B Big Segment implementation sortings *1100	0 / 0	3
	8039	P242C King's Path dfs and similar graphs hashing shortest paths *1800	0 / 0	6
	8038	P242D Dispute dfs and similar graphs greedy *2100	0 / 0	7
	8037	P242E XOR on Segment bitmasks data structures *2000	0 / 0	7
	8036	P243A The Brand New Function bitmasks *1600	0 / 0	5
	8035	P243B Hydra graphs sortings *2000	0 / 0	7
	8034	P243C Colorado Potato Beetle dfs and similar implementation *2200	0 / 0	8
	8033	P243D Cubes data structures dp geometry two pointers *2700	0 / 0	10
	8032	P243E Matrix data structures *3000	0 / 0	10
	8031	P244A Dividing Orange implementation *900	0 / 0	3
	8030	P244B Undoubtedly Lucky Numbers bitmasks brute force dfs and similar *1600	0 / 0	5
	8029	P245A System Administrator implementation *800	0 / 0	3
	8028	P245B Internet Address implementation strings *1100	0 / 0	3
	8027	P245C Game with Coins greedy *1700	0 / 0	5
	8026	P245D Restoring Table constructive algorithms greedy *1500	0 / 0	5
	8025	P245E Mishap in Club greedy implementation *1400	0 / 0	4
	8024	P245F Log Stream Analysis binary search brute force implementation strings *2000	0 / 0	7
	8023	P245G Suggested Friends brute force graphs *2200	0 / 0	8
	8022	P245H Queries for Number of Palindromes dp hashing strings *1800	0 / 0	6
	8021	P246A Buggy Sorting constructive algorithms greedy sortings *900	0 / 0	3
	8020	P246B Increase and Decrease greedy math *1300	0 / 0	4
	8019	P246C Beauty Pageant brute force constructive algorithms greedy *1600	0 / 0	5
	8018	P246D Colorful Graph brute force dfs and similar graphs *1600	0 / 0	5
	8017	P246E Blood Cousins Return binary search data structures dfs and similar dp sortings *2400	0 / 0	9
	8016	P248A Cupboards implementation *800	0 / 0	3
	8015	P248B Chilly Willy math number theory *1400	0 / 0	4
	8014	P248C Robo-Footballer binary search geometry *2000	0 / 0	7
	8013	P248D Sweets for Everyone! binary search greedy implementation *2300	0 / 0	8
	8012	P248E Piglet's Birthday dp math probabilities *2600	0 / 0	10
	8011	P249D Donkey and Stars data structures dp geometry math sortings *2700	0 / 0	10
	8010	P249E Endless Matrix math *2600	0 / 0	10
	8009	P250A Paper Work greedy *1000	0 / 0	3
	8008	P250B Restoring IPv6 implementation strings *1500	0 / 0	5
	8007	P250C Movie Critics greedy *1600	0 / 0	5
	8006	P250D Building Bridge geometry ternary search two pointers *1900	0 / 0	6
	8005	P250E Mad Joe brute force *2000	0 / 0	7
	8004	P251A Points on Line binary search combinatorics two pointers *1300	0 / 0	4
	8003	P251B Playing with Permutations implementation math *1800	0 / 0	6
	8002	P251C Number Transformation dp greedy number theory *2000	0 / 0	7
	8001	P251D Two Sets bitmasks math *2700	0 / 0	10
	8000	P251E Tree and Table dfs and similar dp implementation trees *3000	0 / 0	10
	7999	P252A Little Xor brute force implementation *1100	0 / 0	3
	7998	P252B Unsorting Array brute force sortings *1800	0 / 0	6
	7997	P253A Boys and Girls greedy *1100	0 / 0	3
	7996	P253B Physics Practical binary search dp sortings two pointers *1400	0 / 0	4
	7995	P253C Text Editor data structures dfs and similar graphs greedy shortest paths *1600	0 / 0	5
	7994	P253D Table with Letters - 2 brute force two pointers *2000	0 / 0	7
	7993	P253E Printer binary search data structures implementation sortings *2200	0 / 0	8
	7992	P254A Cards with Numbers constructive algorithms sortings *1200	0 / 0	4
	7991	P254B Jury Size brute force implementation *1500	0 / 0	5
	7990	P254C Anagram greedy strings *1800	0 / 0	6
	7989	P254D Rats brute force dfs and similar graphs implementation shortest paths *2300	0 / 0	8
	7988	P254E Dormitory dp implementation *2100	0 / 0	7
	7987	P255A Greg's Workout implementation *800	0 / 0	3
	7986	P255B Code Parsing implementation *1200	0 / 0	4
	7985	P255C Almost Arithmetical Progression brute force dp *1500	0 / 0	5
	7984	P255D Mr binary search implementation math *1800	0 / 0	6
	7983	P255E Furlo and Rublo and Game games implementation math *2200	0 / 0	8
	7982	P256D Liars and Serge dp *2700	0 / 0	10
	7981	P256E Lucky Arrays data structures *2400	0 / 0	9
	7980	P257A Sockets greedy implementation sortings *1100	0 / 0	3
	7979	P257B Playing Cubes games greedy implementation *1300	0 / 0	4
	7978	P257C View Angle brute force geometry math *1800	0 / 0	6
	7977	P257D Sum greedy math *1900	0 / 0	6
	7976	P257E Greedy Elevator data structures implementation *2200	0 / 0	8
	7975	P258A Little Elephant and Bits greedy math *1100	0 / 0	3
	7974	P258B Little Elephant and Elections brute force combinatorics dp *1900	0 / 0	6
	7973	P258C Little Elephant and LCM binary search combinatorics dp math *2000	0 / 0	7
	7972	P258D Little Elephant and Broken Sorting dp math probabilities *2600	0 / 0	10
	7971	P258E Little Elephant and Tree data structures dfs and similar trees *2400	0 / 0	9
	7970	P259A Little Elephant and Chess brute force strings *1000	0 / 0	3
	7969	P259B Little Elephant and Magic Square brute force implementation *1100	0 / 0	3
	7968	P260A Adding Digits implementation math *1400	0 / 0	4
	7967	P260B Ancient Prophesy brute force implementation strings *1600	0 / 0	5
	7966	P260C Balls and Boxes constructive algorithms greedy implementation *1700	0 / 0	5
	7965	P260D Black and White Tree constructive algorithms dsu graphs greedy trees *2100	0 / 0	7
	7964	P260E Dividing Kingdom binary search brute force data structures *2500	0 / 0	9
	7963	P261A Maxim and Discounts greedy sortings *1400	0 / 0	4
	7962	P261B Maxim and Restaurant dp math probabilities *1900	0 / 0	6
	7961	P261C Maxim and Matrix constructive algorithms dp math *2000	0 / 0	7
	7960	P261D Maxim and Increasing Subsequence dp *2600	0 / 0	10
	7959	P261E Maxim and Calculator brute force dp two pointers *2800	0 / 0	10
	7958	P262A Roma and Lucky Numbers implementation *800	0 / 0	3

Pick a problem randomly based on the current filter.