Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3956	codeforces#P1156F Card Bag dp math probabilities *2300	0 / 0	8
	3955	codeforces#P1156G Optimizer graphs greedy hashing implementation *2700	0 / 0	10
	3954	codeforces#P1157A Reachable Numbers implementation *1100	0 / 0	3
	3953	codeforces#P1157B Long Number greedy *1300	0 / 0	4
	3952	codeforces#P1157C1 Increasing Subsequence (easy version) greedy *1300	0 / 0	4
	3951	codeforces#P1157C2 Increasing Subsequence (hard version) greedy *1700	0 / 0	5
	3950	codeforces#P1157D N Problems During K Days constructive algorithms greedy math *1900	0 / 0	6
	3949	codeforces#P1157E Minimum Array binary search data structures greedy *1700	0 / 0	5
	3948	codeforces#P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	7
	3947	codeforces#P1157G Inverse of Rows and Columns brute force constructive algorithms *2200	0 / 0	8
	3946	codeforces#P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	5
	3945	codeforces#P1158B The minimal unique substring constructive algorithms math strings *2200	0 / 0	8
	3944	codeforces#P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	7
	3943	codeforces#P1158D Winding polygonal line constructive algorithms geometry greedy math *2600	0 / 0	10
	3942	codeforces#P1158E Strange device binary search interactive math trees *3400	0 / 0	10
	3941	codeforces#P1158F Density of subarrays dp math *3500	0 / 0	10
	3940	codeforces#P1159A A pile of stones implementation math *800	0 / 0	3
	3939	codeforces#P1159B Expansion coefficient of the array implementation math *1300	0 / 0	4
	3938	codeforces#P1160A2 Collaboration *special problem	0 / 0	(None)
	3937	codeforces#P1162A Zoning Restrictions Again implementation *800	0 / 0	3
	3936	codeforces#P1162B Double Matrix brute force greedy *1400	0 / 0	4
	3935	codeforces#P1163A Eating Soup greedy math *900	0 / 0	3
	3934	codeforces#P1163B1 Cat Party (Easy Edition) data structures implementation *1500	0 / 0	5
	3933	codeforces#P1163B2 Cat Party (Hard Edition) data structures implementation *1600	0 / 0	5
	3932	codeforces#P1163C1 Power Transmission (Easy Edition) brute force geometry *1900	0 / 0	6
	3931	codeforces#P1163C2 Power Transmission (Hard Edition) data structures geometry implementation math *1900	0 / 0	6
	3930	codeforces#P1163D Mysterious Code dp strings *2100	0 / 0	7
	3929	codeforces#P1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	9
	3928	codeforces#P1163F Indecisive Taxi Fee data structures graphs shortest paths *3000	0 / 0	10
	3927	codeforces#P1165A Remainder implementation math *1100	0 / 0	3
	3926	codeforces#P1165B Polycarp Training data structures greedy sortings *1000	0 / 0	3
	3925	codeforces#P1165C Good String greedy *1300	0 / 0	4
	3924	codeforces#P1165D Almost All Divisors math number theory *1600	0 / 0	5
	3923	codeforces#P1165E Two Arrays and Sum of Functions greedy math sortings *1600	0 / 0	5
	3922	codeforces#P1165F1 Microtransactions (easy version) binary search greedy *2000	0 / 0	7
	3921	codeforces#P1165F2 Microtransactions (hard version) binary search greedy implementation *2000	0 / 0	7
	3920	codeforces#P1166A Silent Classroom combinatorics greedy *900	0 / 0	3
	3919	codeforces#P1166B All the Vowels Please constructive algorithms math number theory *1100	0 / 0	3
	3918	codeforces#P1166C A Tale of Two Lands binary search sortings two pointers *1500	0 / 0	5
	3917	codeforces#P1166D Cute Sequences binary search brute force greedy math *2200	0 / 0	8
	3916	codeforces#P1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	7
	3915	codeforces#P1166F Vicky's Delivery Service data structures dsu graphs hashing *2400	0 / 0	9
	3914	codeforces#P1167A Telephone Number brute force greedy strings *800	0 / 0	3
	3913	codeforces#P1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	4
	3912	codeforces#P1167C News Distribution dfs and similar dsu graphs *1400	0 / 0	4
	3911	codeforces#P1167D Bicolored RBS constructive algorithms greedy *1500	0 / 0	5
	3910	codeforces#P1167E Range Deleting binary search combinatorics data structures two pointers *2100	0 / 0	7
	3909	codeforces#P1167F Scalar Queries combinatorics data structures math sortings *2300	0 / 0	8
	3908	codeforces#P1167G Low Budget Inception brute force geometry *3100	0 / 0	10
	3907	codeforces#P1168A Increasing by Modulo binary search greedy *1700	0 / 0	5
	3906	codeforces#P1168B Good Triple brute force two pointers *1900	0 / 0	6
	3905	codeforces#P1168C And Reachability bitmasks dp *2200	0 / 0	8
	3904	codeforces#P1168D Anagram Paths dp implementation trees *3000	0 / 0	10
	3903	codeforces#P1168E Xor Permutations constructive algorithms math *3100	0 / 0	10
	3902	codeforces#P1169A Circle Metro implementation math *900	0 / 0	3
	3901	codeforces#P1169B Pairs graphs implementation *1500	0 / 0	5
	3900	codeforces#P1170A Three Integers Again *special problem math	0 / 0	(None)
	3899	codeforces#P1170B Bad Days *special problem implementation	0 / 0	(None)
	3898	codeforces#P1170C Minus and Minus Give Plus *special problem implementation strings	0 / 0	(None)
	3897	codeforces#P1170D Decoding of Integer Sequences *special problem data structures implementation	0 / 0	(None)
	3896	codeforces#P1170E Sliding Doors *special problem binary search	0 / 0	(None)
	3895	codeforces#P1170F Wheels *special problem binary search greedy	0 / 0	(None)
	3894	codeforces#P1170G Graph Decomposition *special problem graphs	0 / 0	(None)
	3893	codeforces#P1170H Longest Saw *special problem constructive algorithms	0 / 0	(None)
	3892	codeforces#P1170I Good Subsets *special problem dp	0 / 0	(None)
	3891	codeforces#P1172A Nauuo and Cards greedy implementation *1800	0 / 0	6
	3890	codeforces#P1172B Nauuo and Circle combinatorics dfs and similar dp trees *1900	0 / 0	6
	3889	codeforces#P1172C1 Nauuo and Pictures (easy version) dp probabilities *2300	0 / 0	8
	3888	codeforces#P1172C2 Nauuo and Pictures (hard version) dp probabilities *2600	0 / 0	10
	3887	codeforces#P1172D Nauuo and Portals constructive algorithms *2900	0 / 0	10
	3886	codeforces#P1172E Nauuo and ODT data structures *3300	0 / 0	10
	3885	codeforces#P1172F Nauuo and Bug data structures *3300	0 / 0	10
	3884	codeforces#P1173A Nauuo and Votes greedy *800	0 / 0	3
	3883	codeforces#P1173B Nauuo and Chess constructive algorithms greedy *1100	0 / 0	3
	3882	codeforces#P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	3
	3881	codeforces#P1174B Ehab Is an Odd Person sortings *1200	0 / 0	4
	3880	codeforces#P1174C Ehab and a Special Coloring Problem constructive algorithms number theory *1300	0 / 0	4
	3879	codeforces#P1174D Ehab and the Expected XOR Problem bitmasks constructive algorithms *1900	0 / 0	6
	3878	codeforces#P1174E Ehab and the Expected GCD Problem combinatorics dp math number theory *2500	0 / 0	9
	3877	codeforces#P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	9
	3876	codeforces#P1175A From Hero to Zero implementation math *900	0 / 0	3
	3875	codeforces#P1175B Catch Overflow! data structures expression parsing implementation *1600	0 / 0	5
	3874	codeforces#P1175C Electrification binary search brute force greedy *1600	0 / 0	5
	3873	codeforces#P1175D Array Splitting greedy sortings *1900	0 / 0	6
	3872	codeforces#P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	8
	3871	codeforces#P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	9
	3870	codeforces#P1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	10
	3869	codeforces#P1176A Divide it! brute force greedy implementation *800	0 / 0	3
	3868	codeforces#P1176B Merge it! math *1100	0 / 0	3
	3867	codeforces#P1176C Lose it! dp greedy implementation *1300	0 / 0	4
	3866	codeforces#P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	6
	3865	codeforces#P1176E Cover it! dfs and similar dsu graphs shortest paths trees *1700	0 / 0	5
	3864	codeforces#P1176F Destroy it! dp implementation sortings *2100	0 / 0	7
	3863	codeforces#P1177A Digits Sequence (Easy Edition) implementation *1000	0 / 0	3
	3862	codeforces#P1177B Digits Sequence (Hard Edition) binary search divide and conquer implementation *1800	0 / 0	6
	3861	codeforces#P1178A Prime Minister greedy *800	0 / 0	3
	3860	codeforces#P1178B WOW Factor dp strings *1300	0 / 0	4
	3859	codeforces#P1178C Tiles combinatorics greedy math *1300	0 / 0	4
	3858	codeforces#P1178D Prime Graph constructive algorithms greedy math number theory *1500	0 / 0	5
	3857	codeforces#P1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	6

Pick a problem randomly based on the current filter.