Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5839	P755F PolandBall and Gifts bitmasks dp greedy *2600	0 / 0	10
	5838	P755G PolandBall and Many Other Balls combinatorics divide and conquer dp fft math number theory *3200	0 / 0	10
	5837	P756A Pavel and barbecue constructive algorithms dfs and similar *1700	0 / 0	5
	5836	P756B Travel Card binary search dp *1600	0 / 0	5
	5835	P756C Nikita and stack data structures *2200	0 / 0	8
	5834	P756D Bacterial Melee brute force combinatorics dp string suffix structures *2400	0 / 0	9
	5833	P756E Byteland coins combinatorics dp math *3200	0 / 0	10
	5832	P756F Long number expression parsing math number theory *3400	0 / 0	10
	5831	P757A Gotta Catch Em' All! implementation *1000	0 / 0	3
	5830	P757B Bash's Big Day greedy math number theory *1400	0 / 0	4
	5829	P757C Felicity is Coming! data structures hashing sortings strings *1900	0 / 0	6
	5828	P757D Felicity's Big Secret Revealed bitmasks dp *2200	0 / 0	8
	5827	P757E Bash Plays with Functions brute force combinatorics dp number theory *2500	0 / 0	9
	5826	P757F Team Rocket Rises Again data structures graphs shortest paths *2800	0 / 0	10
	5825	P757G Can Bash Save the Day? data structures divide and conquer graphs trees *3400	0 / 0	10
	5824	P758A Holiday Of Equality implementation math *800	0 / 0	3
	5823	P758B Blown Garland brute force implementation number theory *1100	0 / 0	3
	5822	P758C Unfair Poll binary search constructive algorithms implementation math *1700	0 / 0	5
	5821	P758D Ability To Convert constructive algorithms dp greedy math strings *2000	0 / 0	7
	5820	P758E Broken Tree dfs and similar dp graphs greedy trees *2600	0 / 0	10
	5819	P758F Geometrical Progression brute force math number theory *2400	0 / 0	9
	5818	P760A Petr and a calendar implementation math *800	0 / 0	3
	5817	P760B Frodo and pillows binary search greedy *1500	0 / 0	5
	5816	P761A Dasha and Stairs brute force constructive algorithms implementation math *1000	0 / 0	3
	5815	P761B Dasha and friends brute force implementation math *1300	0 / 0	4
	5814	P761C Dasha and Password brute force dp implementation *1500	0 / 0	5
	5813	P761D Dasha and Very Difficult Problem binary search brute force constructive algorithms greedy sortings *1700	0 / 0	5
	5812	P761E Dasha and Puzzle constructive algorithms dfs and similar graphs greedy trees *2000	0 / 0	7
	5811	P761F Dasha and Photos brute force data structures dp implementation *2600	0 / 0	10
	5810	P762A k-th divisor math number theory *1400	0 / 0	4
	5809	P762B USB vs greedy implementation sortings two pointers *1400	0 / 0	4
	5808	P762C Two strings binary search hashing strings two pointers *2100	0 / 0	7
	5807	P762D Maximum path dp greedy implementation *2300	0 / 0	8
	5806	P762E Radio stations binary search data structures *2200	0 / 0	8
	5805	P762F Tree nesting combinatorics graphs trees *2800	0 / 0	10
	5804	P763A Timofey and a tree dfs and similar dp dsu graphs implementation trees *1600	0 / 0	5
	5803	P763B Timofey and rectangles constructive algorithms geometry *2100	0 / 0	7
	5802	P763C Timofey and remoduling brute force implementation math number theory *2600	0 / 0	10
	5801	P763D Timofey and a flat tree data structures graphs hashing shortest paths trees *2900	0 / 0	10
	5800	P763E Timofey and our friends animals data structures divide and conquer dsu *2900	0 / 0	10
	5799	P764A Taymyr is calling you brute force implementation math *800	0 / 0	3
	5798	P764B Timofey and cubes constructive algorithms implementation *900	0 / 0	3
	5797	P765A Neverending competitions implementation math *900	0 / 0	3
	5796	P765B Code obfuscation greedy implementation strings *1100	0 / 0	3
	5795	P765C Table Tennis Game 2 math *1200	0 / 0	4
	5794	P765D Artsem and Saunders constructive algorithms dsu math *1700	0 / 0	5
	5793	P765E Tree Folding dfs and similar dp greedy implementation trees *2200	0 / 0	8
	5792	P765F Souvenirs data structures *3100	0 / 0	10
	5791	P765G Math, math everywhere brute force dp math meet-in-the-middle number theory *3200	0 / 0	10
	5790	P766A Mahmoud and Longest Uncommon Subsequence constructive algorithms strings *1000	0 / 0	3
	5789	P766B Mahmoud and a Triangle constructive algorithms geometry greedy math number theory sortings *1000	0 / 0	3
	5788	P766C Mahmoud and a Message brute force dp greedy strings *1700	0 / 0	5
	5787	P766D Mahmoud and a Dictionary data structures dfs and similar dp dsu graphs *2000	0 / 0	7
	5786	P766E Mahmoud and a xor trip bitmasks constructive algorithms data structures dfs and similar dp math trees *2100	0 / 0	7
	5785	P767A Snacktower data structures implementation *1100	0 / 0	3
	5784	P767B The Queue brute force greedy *2100	0 / 0	7
	5783	P767C Garland dfs and similar graphs greedy trees *2000	0 / 0	7
	5782	P767D Cartons of milk binary search data structures greedy sortings two pointers *2100	0 / 0	7
	5781	P767E Change-free greedy *2400	0 / 0	9
	5780	P768A Oath of the Night's Watch constructive algorithms sortings *900	0 / 0	3
	5779	P768B Code For 1 constructive algorithms dfs and similar divide and conquer *1600	0 / 0	5
	5778	P768C Jon Snow and his Favourite Number brute force dp implementation sortings *1800	0 / 0	6
	5777	P768D Jon and Orbs dp math probabilities *2200	0 / 0	8
	5776	P768E Game of Stones bitmasks dp games *2100	0 / 0	7
	5775	P768F Barrels and boxes brute force combinatorics math number theory probabilities *2300	0 / 0	8
	5774	P768G The Winds of Winter binary search data structures *3300	0 / 0	10
	5773	P769A Year of University Entrance special problem implementation sortings 800	0 / 0	3
	5772	P769B News About Credit special problem greedy two pointers 1200	0 / 0	4
	5771	P769C Cycle In Maze special problem dfs and similar graphs greedy shortest paths 1700	0 / 0	5
	5770	P769D k-Interesting Pairs Of Integers special problem bitmasks brute force meet-in-the-middle 1700	0 / 0	5
	5769	P770A New Password special problem implementation 800	0 / 0	3
	5768	P770B Maximize Sum of Digits special problem implementation math 1300	0 / 0	4
	5767	P770C Online Courses In BSU special problem dfs and similar graphs implementation 1500	0 / 0	5
	5766	P770D Draw Brackets! special problem implementation 1400	0 / 0	4
	5765	P771A Bear and Friendship Condition dfs and similar dsu graphs *1500	0 / 0	5
	5764	P771B Bear and Different Names constructive algorithms greedy *1500	0 / 0	5
	5763	P771C Bear and Tree Jumps dfs and similar dp trees *2100	0 / 0	7
	5762	P771D Bear and Company dp *2500	0 / 0	9
	5761	P771E Bear and Rectangle Strips dp greedy *3000	0 / 0	10
	5760	P771F Bear and Isomorphic Points geometry two pointers *3300	0 / 0	10
	5759	P772A Voltage Keepsake binary search math *1800	0 / 0	6
	5758	P772B Volatile Kite geometry *1800	0 / 0	6
	5757	P772C Vulnerable Kerbals constructive algorithms dp graphs math number theory *2300	0 / 0	8
	5756	P772D Varying Kibibits bitmasks dp *2700	0 / 0	10
	5755	P772E Verifying Kingdom binary search divide and conquer interactive trees *3200	0 / 0	10
	5754	P773A Success Rate binary search math *1700	0 / 0	5
	5753	P773B Dynamic Problem Scoring brute force greedy *2000	0 / 0	7
	5752	P773C Prairie Partition binary search constructive algorithms greedy math *2200	0 / 0	8
	5751	P773D Perishable Roads dp graphs shortest paths *2700	0 / 0	10
	5750	P773E Blog Post Rating data structures sortings *3000	0 / 0	10
	5749	P773F Test Data Generation combinatorics divide and conquer dp fft math number theory *3400	0 / 0	10
	5748	P774A Amusement Park special problem ternary search 2100	0 / 0	7
	5747	P774B Significant Cups special problem binary search data structures two pointers 2100	0 / 0	7
	5746	P774C Maximum Number special problem constructive algorithms greedy implementation 1200	0 / 0	4
	5745	P774D Lie or Truth special problem constructive algorithms implementation sortings 1500	0 / 0	5
	5744	P774E Big Number and Remainder special problem math number theory 2300	0 / 0	8
	5743	P774F Pens And Days Of Week special problem binary search number theory 2700	0 / 0	10
	5742	P774G Perfectionist Arkadiy special problem number theory 2700	0 / 0	10
	5741	P774H Repairing Of String special problem constructive algorithms 2200	0 / 0	8
	5740	P774I Composing Of String special problem dp 2300	0 / 0	8

Pick a problem randomly based on the current filter.