Problem Set - implementation - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3807	P1185D Extra Element implementation math *1700	0 / 0	5
	3806	P1185E Polycarp and Snakes brute force implementation *2000	0 / 0	7
	3802	P1186A Vus the Cossack and a Contest implementation *800	0 / 0	3
	3801	P1186C Vus the Cossack and Strings implementation math *1800	0 / 0	6
	3799	P1186E Vus the Cossack and a Field divide and conquer implementation math *2500	0 / 0	9
	3798	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	9
	3796	P1187B Letters Shop binary search implementation strings *1300	0 / 0	4
	3795	P1187C Vasya And Array constructive algorithms greedy implementation *1800	0 / 0	6
	3789	P1188A2 Add on a Tree: Revolution constructive algorithms dfs and similar implementation trees *2500	0 / 0	9
	3782	P1189C Candies! data structures dp implementation math *1400	0 / 0	4
	3781	P1190A Tokitsukaze and Discard Items implementation two pointers *1400	0 / 0	4
	3774	P1191B Tokitsukaze and Mahjong brute force implementation *1200	0 / 0	4
	3766	P1194B Yet Another Crosses Problem implementation *1300	0 / 0	4
	3765	P1194C From S To T implementation strings *1300	0 / 0	4
	3751	P1196C Robot Breakout implementation *1500	0 / 0	5
	3750	P1196D1 RGB Substring (easy version) implementation *1500	0 / 0	5
	3749	P1196D2 RGB Substring (hard version) data structures dp implementation two pointers *1600	0 / 0	5
	3748	P1196E Connected Component on a Chessboard constructive algorithms implementation *1800	0 / 0	6
	3745	P1197B Pillars greedy implementation *1000	0 / 0	3
	3734	P1199A City Day implementation *1000	0 / 0	3
	3732	P1200A Hotelier brute force data structures implementation *800	0 / 0	3
	3729	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	6
	3728	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	7
	3727	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	8
	3726	P1201A Important Exam implementation strings *900	0 / 0	3
	3723	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	7
	3718	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	7
	3715	P1202F You Are Given Some Letters... binary search implementation math *2700	0 / 0	10
	3714	P1203A Circle of Students implementation *1000	0 / 0	3
	3712	P1203C Common Divisors implementation math *1300	0 / 0	4
	3711	P1203D1 Remove the Substring (easy version) greedy implementation *1600	0 / 0	5
	3710	P1203D2 Remove the Substring (hard version) binary search greedy implementation two pointers *1700	0 / 0	5
	3698	P1205C Palindromic Paths implementation interactive *2400	0 / 0	9
	3693	P1206B Make Product Equal One dp implementation *900	0 / 0	3
	3692	P1207A There Are Two Types Of Burgers brute force greedy implementation math *800	0 / 0	3
	3691	P1207B Square Filling constructive algorithms greedy implementation *1200	0 / 0	4
	3687	P1207F Remainder Problem brute force data structures implementation *2100	0 / 0	7
	3684	P1208B Uniqueness binary search brute force implementation two pointers *1500	0 / 0	5
	3682	P1208D Restore Permutation binary search data structures greedy implementation *1900	0 / 0	6
	3681	P1208E Let Them Slide data structures implementation *2200	0 / 0	8
	3678	P1208H Red Blue Tree data structures implementation trees *3500	0 / 0	10
	3677	P1209A Paint the Numbers greedy implementation math *800	0 / 0	3
	3676	P1209B Koala and Lights implementation math number theory *1300	0 / 0	4
	3675	P1209C Paint the Digits constructive algorithms greedy implementation *1500	0 / 0	5
	3670	P1209G1 Into Blocks (easy version) data structures dsu greedy implementation two pointers *2000	0 / 0	7
	3659	P1211A Three Problems special problem implementation 1000	0 / 0	3
	3658	P1211B Traveling Around the Golden Ring of Berland special problem implementation 1500	0 / 0	5
	3654	P1211F kotlinkotlinkotlinkotlin... special problem graphs implementation strings 2300	0 / 0	8
	3649	P1213B Bad Prices data structures implementation *1100	0 / 0	3
	3647	P1213D1 Equalizing by Division (easy version) brute force implementation *1500	0 / 0	5
	3644	P1213F Unstable String Sort data structures dfs and similar dsu graphs greedy implementation strings *2100	0 / 0	7
	3634	P1215A Yellow Cards greedy implementation math *1000	0 / 0	3
	3633	P1215B The Number of Products combinatorics dp implementation *1400	0 / 0	4
	3627	P1216B Shooting greedy implementation sortings *900	0 / 0	3
	3617	P1217E Sum Queries? data structures greedy implementation math *2300	0 / 0	8
	3606	P1219C Periodic integer number implementation strings *1700	0 / 0	5
	3605	P1219G Harvester implementation *2000	0 / 0	7
	3604	P1220A Cards implementation sortings strings *800	0 / 0	3
	3582	P1225B1 TV Subscriptions (Easy Version) implementation *1000	0 / 0	3
	3581	P1225B2 TV Subscriptions (Hard Version) implementation two pointers *1300	0 / 0	4
	3566	P1228A Distinct Digits brute force implementation *800	0 / 0	3
	3565	P1228B Filling the Grid implementation math *1400	0 / 0	4
	3563	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	6
	3561	P1228F One Node is Gone constructive algorithms implementation trees *2500	0 / 0	9
	3560	P1230A Dawid and Bags of Candies brute force implementation *800	0 / 0	3
	3559	P1230B Ania and Minimizing greedy implementation *1000	0 / 0	3
	3555	P1234B1 Social Network (easy version) implementation *1000	0 / 0	3
	3554	P1234B2 Social Network (hard version) data structures implementation *1300	0 / 0	4
	3553	P1234C Pipes dp implementation *1500	0 / 0	5
	3547	P1236C Labs constructive algorithms greedy implementation *1300	0 / 0	4
	3546	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	8
	3543	P1237A Balanced Rating Changes implementation math *1000	0 / 0	3
	3540	P1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	6
	3539	P1237D Balanced Playlist binary search data structures implementation *2000	0 / 0	7
	3526	P1239B The World Is Just a Programming Task (Hard Version) implementation *2500	0 / 0	9
	3525	P1239C Queue in the Train data structures greedy implementation *2300	0 / 0	8
	3523	P1239E Turtle dp implementation *3100	0 / 0	10
	3522	P1239F Swiper, no swiping! graphs implementation *3400	0 / 0	10
	3515	P1243A Maximum Square implementation *800	0 / 0	3
	3511	P1244B Rooms and Staircases brute force implementation *1000	0 / 0	3
	3509	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	6
	3507	P1244F Chips constructive algorithms implementation *2300	0 / 0	8
	3496	P1248D1 The World Is Just a Programming Task (Easy Version) brute force dp greedy implementation *2000	0 / 0	7
	3492	P1249C1 Good Numbers (easy version) brute force greedy implementation *1300	0 / 0	4
	3486	P1250A Berstagram implementation *1400	0 / 0	4
	3482	P1250E The Coronation graphs implementation *2300	0 / 0	8
	3481	P1250F Data Center brute force implementation *800	0 / 0	3
	3463	P1252C Even Path data structures implementation *1600	0 / 0	5
	3458	P1252H Twin Buildings greedy implementation *1800	0 / 0	6
	3453	P1253A Single Push implementation *1000	0 / 0	3
	3452	P1253B Silly Mistake greedy implementation *1400	0 / 0	4
	3447	P1254A Feeding Chicken constructive algorithms greedy implementation *1700	0 / 0	5
	3440	P1255B Fridge Lockers graphs implementation *1100	0 / 0	3
	3439	P1255C League of Leesins constructive algorithms implementation *1600	0 / 0	5
	3430	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	3417	P1263B PIN Codes greedy implementation *1400	0 / 0	4
	3414	P1263E Editor data structures implementation *2100	0 / 0	7
	3412	P1264A Beautiful Regional Contest greedy implementation *1500	0 / 0	5
	3404	P1265B Beautiful Numbers data structures implementation math two pointers *1300	0 / 0	4
	3399	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7

Pick a problem randomly based on the current filter.