Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6820	codeforces#P546D Soldier and Number Game constructive algorithms dp math number theory *1700	0 / 0	5
	6819	codeforces#P546E Soldier and Traveling flows graphs math *2100	0 / 0	7
	6818	codeforces#P547A Mike and Frog brute force greedy implementation math *2200	0 / 0	8
	6817	codeforces#P547B Mike and Feet binary search data structures dp dsu *1900	0 / 0	6
	6816	codeforces#P547C Mike and Foam bitmasks combinatorics dp math number theory *2300	0 / 0	8
	6815	codeforces#P547D Mike and Fish constructive algorithms dfs and similar graphs *2600	0 / 0	10
	6814	codeforces#P547E Mike and Friends data structures string suffix structures strings trees *2800	0 / 0	10
	6813	codeforces#P548A Mike and Fax brute force implementation strings *1100	0 / 0	3
	6812	codeforces#P548B Mike and Fun brute force dp greedy implementation *1400	0 / 0	4
	6811	codeforces#P549A Face Detection implementation strings *900	0 / 0	3
	6810	codeforces#P549B Looksery Party constructive algorithms dfs and similar graphs greedy *2300	0 / 0	8
	6809	codeforces#P549C The Game Of Parity games *2200	0 / 0	8
	6808	codeforces#P549D Haar Features greedy implementation *1900	0 / 0	6
	6807	codeforces#P549E Sasha Circle geometry math *2700	0 / 0	10
	6806	codeforces#P549F Yura and Developers data structures divide and conquer *2800	0 / 0	10
	6805	codeforces#P549G Happy Line constructive algorithms greedy sortings *2200	0 / 0	8
	6804	codeforces#P549H Degenerate Matrix binary search math *2100	0 / 0	7
	6803	codeforces#P550A Two Substrings brute force dp greedy implementation strings *1500	0 / 0	5
	6802	codeforces#P550B Preparing Olympiad bitmasks brute force *1400	0 / 0	4
	6801	codeforces#P550C Divisibility by Eight brute force dp math *1500	0 / 0	5
	6800	codeforces#P550D Regular Bridge constructive algorithms graphs implementation *1900	0 / 0	6
	6799	codeforces#P550E Brackets in Implications constructive algorithms greedy implementation math *2200	0 / 0	8
	6798	codeforces#P551A GukiZ and Contest brute force implementation sortings *800	0 / 0	3
	6797	codeforces#P551B ZgukistringZ brute force constructive algorithms implementation strings *1800	0 / 0	6
	6796	codeforces#P551C GukiZ hates Boxes binary search greedy *2200	0 / 0	8
	6795	codeforces#P551D GukiZ and Binary Operations combinatorics implementation math matrices number theory *2100	0 / 0	7
	6794	codeforces#P551E GukiZ and GukiZiana binary search data structures implementation *2500	0 / 0	9
	6793	codeforces#P552A Vanya and Table implementation math *1000	0 / 0	3
	6792	codeforces#P552B Vanya and Books implementation math *1200	0 / 0	4
	6791	codeforces#P552C Vanya and Scales brute force dp greedy math meet-in-the-middle number theory *1900	0 / 0	6
	6790	codeforces#P552D Vanya and Triangles brute force combinatorics data structures geometry math sortings *1900	0 / 0	6
	6789	codeforces#P552E Vanya and Brackets brute force dp expression parsing greedy implementation strings *2100	0 / 0	7
	6788	codeforces#P553A Kyoya and Colored Balls combinatorics dp math *1500	0 / 0	5
	6787	codeforces#P553B Kyoya and Permutation binary search combinatorics constructive algorithms greedy implementation math *1900	0 / 0	6
	6786	codeforces#P553C Love Triangles dfs and similar dsu graphs *2200	0 / 0	8
	6785	codeforces#P553D Nudist Beach binary search graphs greedy *2300	0 / 0	8
	6784	codeforces#P553E Kyoya and Train dp fft graphs math probabilities *3200	0 / 0	10
	6783	codeforces#P554A Kyoya and Photobooks brute force math strings *900	0 / 0	3
	6782	codeforces#P554B Ohana Cleans Up brute force greedy strings *1200	0 / 0	4
	6781	codeforces#P555A Case of Matryoshkas implementation *1500	0 / 0	5
	6780	codeforces#P555B Case of Fugitive data structures greedy sortings *2000	0 / 0	7
	6779	codeforces#P555C Case of Chocolate data structures *2200	0 / 0	8
	6778	codeforces#P555D Case of a Top Secret binary search implementation math *2500	0 / 0	9
	6777	codeforces#P555E Case of Computer Network dfs and similar graphs trees *2800	0 / 0	10
	6776	codeforces#P556A Case of the Zeros and Ones greedy *900	0 / 0	3
	6775	codeforces#P556B Case of Fake Numbers brute force implementation *1100	0 / 0	3
	6774	codeforces#P557A Ilya and Diplomas greedy implementation math *1100	0 / 0	3
	6773	codeforces#P557B Pasha and Tea constructive algorithms implementation math sortings *1500	0 / 0	5
	6772	codeforces#P557C Arthur and Table brute force data structures dp greedy math sortings *1900	0 / 0	6
	6771	codeforces#P557D Vitaly and Cycle combinatorics dfs and similar graphs math *2000	0 / 0	7
	6770	codeforces#P557E Ann and Half-Palindrome data structures dp graphs string suffix structures strings trees *2300	0 / 0	8
	6769	codeforces#P558A Lala Land and Apple Trees brute force implementation sortings *1100	0 / 0	3
	6768	codeforces#P558B Amr and The Large Array implementation *1300	0 / 0	4
	6767	codeforces#P558C Amr and Chemistry brute force graphs greedy math shortest paths *1900	0 / 0	6
	6766	codeforces#P558D Guess Your Way Out! II data structures implementation sortings *2300	0 / 0	8
	6765	codeforces#P558E A Simple Task data structures sortings strings *2300	0 / 0	8
	6764	codeforces#P559A Gerald's Hexagon brute force geometry math *1600	0 / 0	5
	6763	codeforces#P559B Equivalent Strings divide and conquer hashing sortings strings *1700	0 / 0	5
	6762	codeforces#P559C Gerald and Giant Chess combinatorics dp math number theory *2200	0 / 0	8
	6761	codeforces#P559D Randomizer combinatorics geometry probabilities *2800	0 / 0	10
	6760	codeforces#P559E Gerald and Path dp sortings *3000	0 / 0	10
	6759	codeforces#P560A Currency System in Geraldion implementation sortings *1000	0 / 0	3
	6758	codeforces#P560B Gerald is into Art constructive algorithms implementation *1200	0 / 0	4
	6757	codeforces#P566A Matching Names dfs and similar strings trees *2300	0 / 0	8
	6756	codeforces#P566B Replicating Processes constructive algorithms greedy *2600	0 / 0	10
	6755	codeforces#P566C Logistical Questions dfs and similar divide and conquer trees *3000	0 / 0	10
	6754	codeforces#P566D Restructuring Company data structures dsu *1900	0 / 0	6
	6753	codeforces#P566E Restoring Map bitmasks constructive algorithms trees *3200	0 / 0	10
	6752	codeforces#P566F Clique in the Divisibility Graph dp math number theory *1500	0 / 0	5
	6751	codeforces#P566G Max and Min geometry *2500	0 / 0	9
	6750	codeforces#P567A Lineland Mail greedy implementation *900	0 / 0	3
	6749	codeforces#P567B Berland National Library implementation *1300	0 / 0	4
	6748	codeforces#P567C Geometric Progression binary search data structures dp *1700	0 / 0	5
	6747	codeforces#P567D One-Dimensional Battle Ships binary search data structures greedy sortings *1700	0 / 0	5
	6746	codeforces#P567E President and Roads dfs and similar graphs hashing shortest paths *2200	0 / 0	8
	6745	codeforces#P567F Mausoleum dp *2400	0 / 0	9
	6744	codeforces#P568A Primes or Palindromes? brute force implementation math number theory *1600	0 / 0	5
	6743	codeforces#P568B Symmetric and Transitive combinatorics dp math *1900	0 / 0	6
	6742	codeforces#P568C New Language 2-sat greedy *2600	0 / 0	10
	6741	codeforces#P568D Sign Posts brute force geometry math *2800	0 / 0	10
	6740	codeforces#P568E Longest Increasing Subsequence data structures dp *3000	0 / 0	10
	6739	codeforces#P569A Music implementation math *1500	0 / 0	5
	6738	codeforces#P569B Inventory greedy math *1200	0 / 0	4
	6737	codeforces#P570A Elections implementation *1100	0 / 0	3
	6736	codeforces#P570B Simple Game constructive algorithms games greedy implementation math *1300	0 / 0	4
	6735	codeforces#P570C Replacement constructive algorithms data structures implementation *1600	0 / 0	5
	6734	codeforces#P570D Tree Requests binary search bitmasks constructive algorithms dfs and similar graphs trees *2200	0 / 0	8
	6733	codeforces#P570E Pig and Palindromes combinatorics dp *2300	0 / 0	8
	6732	codeforces#P571A Lengthening Sticks combinatorics implementation math *2100	0 / 0	7
	6731	codeforces#P571B Minimization dp greedy sortings *2000	0 / 0	7
	6730	codeforces#P571C CNF 2 constructive algorithms dfs and similar graphs greedy *2500	0 / 0	9
	6729	codeforces#P571D Campus binary search data structures dsu trees *3100	0 / 0	10
	6728	codeforces#P571E Geometric Progressions math *3200	0 / 0	10
	6727	codeforces#P572A Arrays sortings *900	0 / 0	3
	6726	codeforces#P572B Order Book data structures greedy implementation sortings *1300	0 / 0	4
	6725	codeforces#P573A Bear and Poker implementation math number theory *1300	0 / 0	4
	6724	codeforces#P573B Bear and Blocks binary search data structures dp math *1600	0 / 0	5
	6723	codeforces#P573C Bear and Drawing constructive algorithms dfs and similar trees *2300	0 / 0	8
	6722	codeforces#P573D Bear and Cavalry data structures divide and conquer dp *3000	0 / 0	10
	6721	codeforces#P573E Bear and Bowling data structures greedy *3200	0 / 0	10

Pick a problem randomly based on the current filter.