Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8157	P213E Two Permutations data structures hashing strings *2700	0 / 0	10
	8156	P214A System of Equations brute force *800	0 / 0	3
	8155	P214B Hometask brute force constructive algorithms greedy math *1600	0 / 0	5
	8154	P215A Bicycle Chain brute force implementation *900	0 / 0	3
	8153	P215B Olympic Medal greedy math *1300	0 / 0	4
	8152	P215C Crosses brute force implementation *2100	0 / 0	7
	8151	P215D Hot Days greedy *1900	0 / 0	6
	8150	P215E Periodical Numbers combinatorics dp number theory *2100	0 / 0	7
	8149	P216A Tiling with Hexagons implementation math *1200	0 / 0	4
	8148	P216B Forming Teams dfs and similar implementation *1700	0 / 0	5
	8147	P216C Hiring Staff greedy *1800	0 / 0	6
	8146	P216D Spider's Web binary search sortings two pointers *1700	0 / 0	5
	8145	P216E Martian Luck math number theory *2000	0 / 0	7
	8144	P217A Ice Skating brute force dfs and similar dsu graphs *1200	0 / 0	4
	8143	P217B Blackboard Fibonacci brute force math *2100	0 / 0	7
	8142	P217C Formurosa divide and conquer dp expression parsing *2600	0 / 0	10
	8141	P217D Bitonix' Patrol bitmasks brute force combinatorics dfs and similar math *2900	0 / 0	10
	8140	P217E Alien DNA data structures dsu trees *2800	0 / 0	10
	8139	P218A Mountain Scenery brute force constructive algorithms implementation *1100	0 / 0	3
	8138	P218B Airport implementation *1100	0 / 0	3
	8137	P219A k-String implementation strings *1000	0 / 0	3
	8136	P219B Special Offer! Super Price 999 Bourles! implementation *1400	0 / 0	4
	8135	P219C Color Stripe brute force dp greedy *1600	0 / 0	5
	8134	P219D Choosing Capital for Treeland dfs and similar dp graphs trees *1700	0 / 0	5
	8133	P219E Parking Lot data structures *2200	0 / 0	8
	8132	P220A Little Elephant and Problem implementation sortings *1300	0 / 0	4
	8131	P220B Little Elephant and Array constructive algorithms data structures *1800	0 / 0	6
	8130	P220C Little Elephant and Shifts data structures *2100	0 / 0	7
	8129	P220D Little Elephant and Triangle geometry math *2500	0 / 0	9
	8128	P220E Little Elephant and Inversions data structures two pointers *2400	0 / 0	9
	8127	P221A Little Elephant and Function implementation math *1000	0 / 0	3
	8126	P221B Little Elephant and Numbers implementation *1300	0 / 0	4
	8125	P222A Shooshuns and Sequence brute force implementation *1200	0 / 0	4
	8124	P222B Cosmic Tables data structures implementation *1300	0 / 0	4
	8123	P222C Reducing Fractions implementation math number theory sortings *1800	0 / 0	6
	8122	P222D Olympiad binary search greedy sortings two pointers *1900	0 / 0	6
	8121	P222E Decoding Genome dp matrices *1900	0 / 0	6
	8120	P223A Bracket Sequence data structures expression parsing implementation *1700	0 / 0	5
	8119	P223B Two Strings data structures dp strings *1900	0 / 0	6
	8118	P223C Partial Sums combinatorics math number theory *1900	0 / 0	6
	8117	P223D Spider geometry graphs *3000	0 / 0	10
	8116	P223E Planar Graph flows geometry graphs *3000	0 / 0	10
	8115	P224A Parallelepiped brute force geometry math *1100	0 / 0	3
	8114	P224B Array bitmasks implementation two pointers *1500	0 / 0	5
	8113	P225A Dice Tower constructive algorithms greedy *1100	0 / 0	3
	8112	P225B Well-known Numbers binary search greedy number theory *1600	0 / 0	5
	8111	P225C Barcode dp matrices *1700	0 / 0	5
	8110	P225D Snake bitmasks dfs and similar graphs implementation *2200	0 / 0	8
	8109	P225E Unsolvable math number theory *2100	0 / 0	7
	8108	P226A Flying Saucer Segments math *1400	0 / 0	4
	8107	P226B Naughty Stone Piles greedy *1900	0 / 0	6
	8106	P226C Anniversary data structures implementation math matrices number theory *2400	0 / 0	9
	8105	P226D The table constructive algorithms greedy *2100	0 / 0	7
	8104	P226E Noble Knight's Path data structures trees *2900	0 / 0	10
	8103	P227A Where do I Turn? geometry *1300	0 / 0	4
	8102	P227B Effective Approach implementation *1100	0 / 0	3
	8101	P228A Is your horseshoe on the other hoof? implementation *800	0 / 0	3
	8100	P228B Two Tables brute force implementation *1400	0 / 0	4
	8099	P228C Fractal Detector dp hashing *2000	0 / 0	7
	8098	P228D Zigzag data structures *2100	0 / 0	7
	8097	P228E The Road to Berland is Paved With Good Intentions 2-sat dfs and similar dsu graphs *1900	0 / 0	6
	8096	P229A Shifts brute force two pointers *1500	0 / 0	5
	8095	P229B Planets binary search data structures graphs shortest paths *1700	0 / 0	5
	8094	P229C Triangles combinatorics graphs math *1900	0 / 0	6
	8093	P229D Towers dp greedy two pointers *2100	0 / 0	7
	8092	P229E Gifts combinatorics dp math probabilities *2600	0 / 0	10
	8091	P230A Dragons greedy sortings *1000	0 / 0	3
	8090	P230B T-primes binary search implementation math number theory *1300	0 / 0	4
	8089	P231A Team brute force greedy *800	0 / 0	3
	8088	P231B Magic, Wizardry and Wonders constructive algorithms greedy *1500	0 / 0	5
	8087	P231C To Add or Not to Add binary search sortings two pointers *1600	0 / 0	5
	8086	P231D Magic Box brute force geometry *1600	0 / 0	5
	8085	P231E Cactus data structures dfs and similar dp graphs trees *2100	0 / 0	7
	8084	P232A Cycles binary search constructive algorithms graphs greedy *1600	0 / 0	5
	8083	P232B Table bitmasks combinatorics dp math *1900	0 / 0	6
	8082	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	10
	8081	P232D Fence binary search data structures string suffix structures *2900	0 / 0	10
	8080	P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	10
	8079	P233A Perfect Permutation implementation math *800	0 / 0	3
	8078	P233B Non-square Equation binary search brute force math *1400	0 / 0	4
	8077	P234A Lefthanders and Righthanders implementation *1200	0 / 0	4
	8076	P234B Reading sortings *1000	0 / 0	3
	8075	P234C Weather dp implementation *1300	0 / 0	4
	8074	P234D Cinema implementation *1600	0 / 0	5
	8073	P234E Champions' League implementation *1600	0 / 0	5
	8072	P234F Fence dp *1800	0 / 0	6
	8071	P234G Practice constructive algorithms divide and conquer implementation *1600	0 / 0	5
	8070	P234H Merging Two Decks constructive algorithms greedy *2000	0 / 0	7
	8069	P235A LCM Challenge number theory *1600	0 / 0	5
	8068	P235B Let's Play Osu! dp math probabilities *2000	0 / 0	7
	8067	P235C Cyclical Quest data structures string suffix structures strings *2700	0 / 0	10
	8066	P235D Graph Game graphs *3000	0 / 0	10
	8065	P235E Number Challenge combinatorics dp implementation math number theory *2600	0 / 0	10
	8064	P236A Boy or Girl brute force implementation strings *800	0 / 0	3
	8063	P236B Easy Number Challenge implementation number theory *1300	0 / 0	4
	8062	P237A Free Cash implementation *1000	0 / 0	3
	8061	P237B Young Table implementation sortings *1500	0 / 0	5
	8060	P237C Primes on Interval binary search number theory two pointers *1600	0 / 0	5
	8059	P237D T-decomposition dfs and similar graphs greedy trees *2000	0 / 0	7
	8058	P237E Build String flows graphs *2000	0 / 0	7

Pick a problem randomly based on the current filter.