Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3484	P1250C Trip to Saint Petersburg data structures *2100	0 / 0	7
	3483	P1250D Conference Problem dp *3000	0 / 0	10
	3482	P1250E The Coronation graphs implementation *2300	0 / 0	8
	3481	P1250F Data Center brute force implementation *800	0 / 0	3
	3480	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	8
	3479	P1250H Happy Birthday math *1500	0 / 0	5
	3478	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	10
	3477	P1250J The Parade binary search greedy *1800	0 / 0	6
	3476	P1250K Projectors flows graphs *3100	0 / 0	10
	3475	P1250L Divide The Students binary search greedy math *1500	0 / 0	5
	3474	P1250M SmartGarden constructive algorithms divide and conquer *2500	0 / 0	9
	3473	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	7
	3472	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	3
	3471	P1251B Binary Palindromes greedy strings *1400	0 / 0	4
	3470	P1251C Minimize The Integer greedy two pointers *1600	0 / 0	5
	3469	P1251D Salary Changing binary search greedy sortings *1900	0 / 0	6
	3468	P1251E1 Voting (Easy Version) data structures dp greedy *2300	0 / 0	8
	3467	P1251E2 Voting (Hard Version) binary search data structures greedy *2400	0 / 0	9
	3466	P1251F Red-White Fence combinatorics fft *2500	0 / 0	9
	3465	P1252A Copying Homework *1000	0 / 0	3
	3464	P1252B Cleaning Robots dp trees *2300	0 / 0	8
	3463	P1252C Even Path data structures implementation *1600	0 / 0	5
	3462	P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	10
	3461	P1252E Songwriter greedy two pointers *2200	0 / 0	8
	3460	P1252F Regular Forestation hashing trees *2400	0 / 0	9
	3459	P1252G Performance Review data structures *2100	0 / 0	7
	3458	P1252H Twin Buildings greedy implementation *1800	0 / 0	6
	3457	P1252I Mission Possible *3000	0 / 0	10
	3456	P1252J Tiling Terrace brute force dp *2300	0 / 0	8
	3455	P1252K Addition Robot data structures math matrices *2100	0 / 0	7
	3454	P1252L Road Construction flows graphs *2300	0 / 0	8
	3453	P1253A Single Push implementation *1000	0 / 0	3
	3452	P1253B Silly Mistake greedy implementation *1400	0 / 0	4
	3451	P1253C Sweets Eating dp greedy math sortings *1500	0 / 0	5
	3450	P1253D Harmonious Graph constructive algorithms dfs and similar dsu graphs greedy sortings *1700	0 / 0	5
	3449	P1253E Antenna Coverage data structures dp greedy sortings *2200	0 / 0	8
	3448	P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	9
	3447	P1254A Feeding Chicken constructive algorithms greedy implementation *1700	0 / 0	5
	3446	P1254B1 Send Boxes to Alice (Easy Version) constructive algorithms greedy math number theory ternary search two pointers *1800	0 / 0	6
	3445	P1254B2 Send Boxes to Alice (Hard Version) constructive algorithms greedy math number theory ternary search two pointers *2100	0 / 0	7
	3444	P1254C Point Ordering constructive algorithms geometry interactive math *2300	0 / 0	8
	3443	P1254D Tree Queries data structures probabilities trees *2700	0 / 0	10
	3442	P1254E Send Tree to Charlie combinatorics dfs and similar dsu trees *3300	0 / 0	10
	3441	P1255A Changing Volume math *800	0 / 0	3
	3440	P1255B Fridge Lockers graphs implementation *1100	0 / 0	3
	3439	P1255C League of Leesins constructive algorithms implementation *1600	0 / 0	5
	3438	P1256A Payment Without Change math *1000	0 / 0	3
	3437	P1256B Minimize the Permutation greedy *1400	0 / 0	4
	3436	P1256C Platforms Jumping greedy *1700	0 / 0	5
	3435	P1256D Binary String Minimizing greedy *1500	0 / 0	5
	3434	P1256E Yet Another Division Into Teams dp greedy sortings *2000	0 / 0	7
	3433	P1256F Equalizing Two Strings constructive algorithms sortings strings *2000	0 / 0	7
	3432	P1257A Two Rival Students greedy math *800	0 / 0	3
	3431	P1257B Magic Stick math *1000	0 / 0	3
	3430	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	3429	P1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	5
	3428	P1257E The Contest data structures dp greedy *2000	0 / 0	7
	3427	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
	3426	P1257G Divisor Set divide and conquer fft greedy math number theory *2600	0 / 0	10
	3425	P1260A Heating math *1000	0 / 0	3
	3424	P1260B Obtain Two Zeroes binary search math *1300	0 / 0	4
	3423	P1260C Infinite Fence greedy math number theory *1700	0 / 0	5
	3422	P1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	6
	3421	P1260E Tournament brute force dp greedy *2400	0 / 0	9
	3420	P1260F Colored Tree data structures trees *2700	0 / 0	10
	3419	P1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	10
	3418	P1263A Sweet Problem math *1100	0 / 0	3
	3417	P1263B PIN Codes greedy implementation *1400	0 / 0	4
	3416	P1263C Everyone is a Winner! binary search math meet-in-the-middle number theory *1400	0 / 0	4
	3415	P1263D Secret Passwords dfs and similar dsu graphs *1500	0 / 0	5
	3414	P1263E Editor data structures implementation *2100	0 / 0	7
	3413	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	9
	3412	P1264A Beautiful Regional Contest greedy implementation *1500	0 / 0	5
	3411	P1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	6
	3410	P1264C Beautiful Mirrors with queries data structures probabilities *2400	0 / 0	9
	3409	P1264D1 Beautiful Bracket Sequence (easy version) combinatorics dp probabilities *2600	0 / 0	10
	3408	P1264D2 Beautiful Bracket Sequence (hard version) combinatorics probabilities *2900	0 / 0	10
	3407	P1264E Beautiful League constructive algorithms flows graph matchings *2700	0 / 0	10
	3406	P1264F Beautiful Fibonacci Problem constructive algorithms number theory *3500	0 / 0	10
	3405	P1265A Beautiful String constructive algorithms greedy *1000	0 / 0	3
	3404	P1265B Beautiful Numbers data structures implementation math two pointers *1300	0 / 0	4
	3403	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	7
	3402	P1266A Competitive Programmer chinese remainder theorem math *1000	0 / 0	3
	3401	P1266B Dice Tower constructive algorithms math *1000	0 / 0	3
	3400	P1266C Diverse Matrix constructive algorithms greedy math number theory *1400	0 / 0	4
	3399	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7
	3398	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	7
	3397	P1266F Almost Same Distance dfs and similar graphs *2900	0 / 0	10
	3396	P1266G Permutation Concatenation string suffix structures *3300	0 / 0	10
	3395	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	10
	3394	P1267A __NO_TITLE__	0 / 0	(None)
	3393	P1267B Balls of Buma *900	0 / 0	3
	3392	P1267C __NO_TITLE__	0 / 0	(None)
	3391	P1267D DevOps Best Practices constructive algorithms *2800	0 / 0	10
	3390	P1267E Elections greedy *1700	0 / 0	5
	3389	P1267F __NO_TITLE__	0 / 0	(None)
	3388	P1267G Game Relics math probabilities *3000	0 / 0	10
	3387	P1267H Help BerLine constructive algorithms *3200	0 / 0	10
	3386	P1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	10
	3385	P1267J Just Arrange the Icons greedy implementation math *1800	0 / 0	6

Pick a problem randomly based on the current filter.