Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8129	codeforces#P220D Little Elephant and Triangle geometry math *2500	0 / 0	9
	8128	codeforces#P220E Little Elephant and Inversions data structures two pointers *2400	0 / 0	9
	8127	codeforces#P221A Little Elephant and Function implementation math *1000	0 / 0	3
	8126	codeforces#P221B Little Elephant and Numbers implementation *1300	0 / 0	4
	8125	codeforces#P222A Shooshuns and Sequence brute force implementation *1200	0 / 0	4
	8124	codeforces#P222B Cosmic Tables data structures implementation *1300	0 / 0	4
	8123	codeforces#P222C Reducing Fractions implementation math number theory sortings *1800	0 / 0	6
	8122	codeforces#P222D Olympiad binary search greedy sortings two pointers *1900	0 / 0	6
	8121	codeforces#P222E Decoding Genome dp matrices *1900	0 / 0	6
	8120	codeforces#P223A Bracket Sequence data structures expression parsing implementation *1700	0 / 0	5
	8119	codeforces#P223B Two Strings data structures dp strings *1900	0 / 0	6
	8118	codeforces#P223C Partial Sums combinatorics math number theory *1900	0 / 0	6
	8117	codeforces#P223D Spider geometry graphs *3000	0 / 0	10
	8116	codeforces#P223E Planar Graph flows geometry graphs *3000	0 / 0	10
	8115	codeforces#P224A Parallelepiped brute force geometry math *1100	0 / 0	3
	8114	codeforces#P224B Array bitmasks implementation two pointers *1500	0 / 0	5
	8113	codeforces#P225A Dice Tower constructive algorithms greedy *1100	0 / 0	3
	8112	codeforces#P225B Well-known Numbers binary search greedy number theory *1600	0 / 0	5
	8111	codeforces#P225C Barcode dp matrices *1700	0 / 0	5
	8110	codeforces#P225D Snake bitmasks dfs and similar graphs implementation *2200	0 / 0	8
	8109	codeforces#P225E Unsolvable math number theory *2100	0 / 0	7
	8108	codeforces#P226A Flying Saucer Segments math *1400	0 / 0	4
	8107	codeforces#P226B Naughty Stone Piles greedy *1900	0 / 0	6
	8106	codeforces#P226C Anniversary data structures implementation math matrices number theory *2400	0 / 0	9
	8105	codeforces#P226D The table constructive algorithms greedy *2100	0 / 0	7
	8104	codeforces#P226E Noble Knight's Path data structures trees *2900	0 / 0	10
	8103	codeforces#P227A Where do I Turn? geometry *1300	0 / 0	4
	8102	codeforces#P227B Effective Approach implementation *1100	0 / 0	3
	8101	codeforces#P228A Is your horseshoe on the other hoof? implementation *800	0 / 0	3
	8100	codeforces#P228B Two Tables brute force implementation *1400	0 / 0	4
	8099	codeforces#P228C Fractal Detector dp hashing *2000	0 / 0	7
	8098	codeforces#P228D Zigzag data structures *2100	0 / 0	7
	8097	codeforces#P228E The Road to Berland is Paved With Good Intentions 2-sat dfs and similar dsu graphs *1900	0 / 0	6
	8096	codeforces#P229A Shifts brute force two pointers *1500	0 / 0	5
	8095	codeforces#P229B Planets binary search data structures graphs shortest paths *1700	0 / 0	5
	8094	codeforces#P229C Triangles combinatorics graphs math *1900	0 / 0	6
	8093	codeforces#P229D Towers dp greedy two pointers *2100	0 / 0	7
	8092	codeforces#P229E Gifts combinatorics dp math probabilities *2600	0 / 0	10
	8091	codeforces#P230A Dragons greedy sortings *1000	0 / 0	3
	8090	codeforces#P230B T-primes binary search implementation math number theory *1300	0 / 0	4
	8089	codeforces#P231A Team brute force greedy *800	0 / 0	3
	8088	codeforces#P231B Magic, Wizardry and Wonders constructive algorithms greedy *1500	0 / 0	5
	8087	codeforces#P231C To Add or Not to Add binary search sortings two pointers *1600	0 / 0	5
	8086	codeforces#P231D Magic Box brute force geometry *1600	0 / 0	5
	8085	codeforces#P231E Cactus data structures dfs and similar dp graphs trees *2100	0 / 0	7
	8084	codeforces#P232A Cycles binary search constructive algorithms graphs greedy *1600	0 / 0	5
	8083	codeforces#P232B Table bitmasks combinatorics dp math *1900	0 / 0	6
	8082	codeforces#P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	10
	8081	codeforces#P232D Fence binary search data structures string suffix structures *2900	0 / 0	10
	8080	codeforces#P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	10
	8079	codeforces#P233A Perfect Permutation implementation math *800	0 / 0	3
	8078	codeforces#P233B Non-square Equation binary search brute force math *1400	0 / 0	4
	8077	codeforces#P234A Lefthanders and Righthanders implementation *1200	0 / 0	4
	8076	codeforces#P234B Reading sortings *1000	0 / 0	3
	8075	codeforces#P234C Weather dp implementation *1300	0 / 0	4
	8074	codeforces#P234D Cinema implementation *1600	0 / 0	5
	8073	codeforces#P234E Champions' League implementation *1600	0 / 0	5
	8072	codeforces#P234F Fence dp *1800	0 / 0	6
	8071	codeforces#P234G Practice constructive algorithms divide and conquer implementation *1600	0 / 0	5
	8070	codeforces#P234H Merging Two Decks constructive algorithms greedy *2000	0 / 0	7
	8069	codeforces#P235A LCM Challenge number theory *1600	0 / 0	5
	8068	codeforces#P235B Let's Play Osu! dp math probabilities *2000	0 / 0	7
	8067	codeforces#P235C Cyclical Quest data structures string suffix structures strings *2700	0 / 0	10
	8066	codeforces#P235D Graph Game graphs *3000	0 / 0	10
	8065	codeforces#P235E Number Challenge combinatorics dp implementation math number theory *2600	0 / 0	10
	8064	codeforces#P236A Boy or Girl brute force implementation strings *800	0 / 0	3
	8063	codeforces#P236B Easy Number Challenge implementation number theory *1300	0 / 0	4
	8062	codeforces#P237A Free Cash implementation *1000	0 / 0	3
	8061	codeforces#P237B Young Table implementation sortings *1500	0 / 0	5
	8060	codeforces#P237C Primes on Interval binary search number theory two pointers *1600	0 / 0	5
	8059	codeforces#P237D T-decomposition dfs and similar graphs greedy trees *2000	0 / 0	7
	8058	codeforces#P237E Build String flows graphs *2000	0 / 0	7
	8057	codeforces#P238A Not Wool Sequences constructive algorithms math *1300	0 / 0	4
	8056	codeforces#P238B Boring Partition constructive algorithms *1800	0 / 0	6
	8055	codeforces#P238C World Eater Brothers dfs and similar dp greedy trees *2100	0 / 0	7
	8054	codeforces#P238D Tape Programming data structures implementation *2900	0 / 0	10
	8053	codeforces#P238E Meeting Her dp graphs shortest paths *2600	0 / 0	10
	8052	codeforces#P239A Two Bags of Potatoes greedy implementation math *1200	0 / 0	4
	8051	codeforces#P239B Easy Tape Programming brute force implementation *1500	0 / 0	5
	8050	codeforces#P240E Road Repairs dfs and similar graphs greedy *2800	0 / 0	10
	8049	codeforces#P240F TorCoder data structures *2600	0 / 0	10
	8048	codeforces#P241A Old Peykan greedy *1300	0 / 0	4
	8047	codeforces#P241B Friends binary search bitmasks data structures math *2700	0 / 0	10
	8046	codeforces#P241C Mirror Box geometry implementation *2000	0 / 0	7
	8045	codeforces#P241D Numbers *2900	0 / 0	10
	8044	codeforces#P241E Flights graphs shortest paths *2600	0 / 0	10
	8043	codeforces#P241F Race brute force implementation *2300	0 / 0	8
	8042	codeforces#P241G Challenging Balloons constructive algorithms *1900	0 / 0	6
	8041	codeforces#P242A Heads or Tails brute force implementation *1100	0 / 0	3
	8040	codeforces#P242B Big Segment implementation sortings *1100	0 / 0	3
	8039	codeforces#P242C King's Path dfs and similar graphs hashing shortest paths *1800	0 / 0	6
	8038	codeforces#P242D Dispute dfs and similar graphs greedy *2100	0 / 0	7
	8037	codeforces#P242E XOR on Segment bitmasks data structures *2000	0 / 0	7
	8036	codeforces#P243A The Brand New Function bitmasks *1600	0 / 0	5
	8035	codeforces#P243B Hydra graphs sortings *2000	0 / 0	7
	8034	codeforces#P243C Colorado Potato Beetle dfs and similar implementation *2200	0 / 0	8
	8033	codeforces#P243D Cubes data structures dp geometry two pointers *2700	0 / 0	10
	8032	codeforces#P243E Matrix data structures *3000	0 / 0	10
	8031	codeforces#P244A Dividing Orange implementation *900	0 / 0	3
	8030	codeforces#P244B Undoubtedly Lucky Numbers bitmasks brute force dfs and similar *1600	0 / 0	5

Pick a problem randomly based on the current filter.