Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1384	P1658C Shinju and the Lost Permutation constructive algorithms math *1700	0 / 0	5
	1383	P1658D1 388535 (Easy Version) bitmasks math *1600	0 / 0	5
	1382	P1658D2 388535 (Hard Version) bitmasks brute force data structures math *2300	0 / 0	8
	1381	P1658E Gojou and Matrix Game data structures dp games hashing implementation math number theory sortings *2500	0 / 0	9
	1380	P1658F Juju and Binary String brute force constructive algorithms greedy math *2700	0 / 0	10
	1379	P1659A Red Versus Blue constructive algorithms greedy implementation math *1000	0 / 0	3
	1378	P1659B Bit Flipping bitmasks constructive algorithms greedy strings *1300	0 / 0	4
	1377	P1659C Line Empire binary search brute force dp greedy implementation math *1500	0 / 0	5
	1376	P1659D Reverse Sort Sum constructive algorithms data structures greedy implementation math two pointers *1900	0 / 0	6
	1375	P1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	8
	1374	P1659F Tree and Permutation Game dfs and similar games graphs trees *3000	0 / 0	10
	1373	P1660A Vasya and Coins greedy math *800	0 / 0	3
	1372	P1660B Vlad and Candies math *800	0 / 0	3
	1371	P1660C Get an Even String dp greedy strings *1300	0 / 0	4
	1370	P1660D Maximum Product Strikes Back brute force implementation math two pointers *1600	0 / 0	5
	1369	P1660E Matrix and Shifts brute force constructive algorithms greedy implementation *1600	0 / 0	5
	1368	P1660F1 Promising String (easy version) brute force implementation math strings *1700	0 / 0	5
	1367	P1660F2 Promising String (hard version) data structures implementation math strings *2100	0 / 0	7
	1366	P1661A Array Balancing greedy math *800	0 / 0	3
	1365	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	4
	1364	P1661C Water the Trees binary search greedy math *1700	0 / 0	5
	1363	P1661D Progressions Covering data structures greedy *1900	0 / 0	6
	1362	P1661E Narrow Components brute force data structures dp dsu math trees *2500	0 / 0	9
	1361	P1661F Teleporters binary search greedy *2600	0 / 0	10
	1360	P1662A Organizing SWERC brute force implementation	0 / 0	(None)
	1359	P1662B Toys greedy strings	0 / 0	(None)
	1358	P1662C European Trip dp graphs math matrices	0 / 0	(None)
	1357	P1662D Evolution of Weasels greedy implementation strings	0 / 0	(None)
	1356	P1662E Round Table math	0 / 0	(None)
	1355	P1662F Antennas data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths	0 / 0	(None)
	1354	P1662G Gastronomic Event dp greedy trees	0 / 0	(None)
	1353	P1662H Boundary brute force math	0 / 0	(None)
	1352	P1662I Ice Cream Shop brute force implementation sortings	0 / 0	(None)
	1351	P1662J Training Camp flows graphs	0 / 0	(None)
	1350	P1662K Pandemic Restrictions geometry ternary search	0 / 0	(None)
	1349	P1662L Il Derby della Madonnina data structures dp math	0 / 0	(None)
	1348	P1662M Bottle Arrangements constructive algorithms	0 / 0	(None)
	1347	P1662N Drone Photo combinatorics math sortings	0 / 0	(None)
	1346	P1662O Circular Maze brute force dfs and similar graphs implementation	0 / 0	(None)
	1345	P1663A Who Tested? *special problem expression parsing trees	0 / 0	(None)
	1344	P1663B Mike's Sequence *special problem divide and conquer implementation math	0 / 0	(None)
	1343	P1663C Pōja Verdon *special problem implementation math	0 / 0	(None)
	1342	P1663D Is it rated - 3 *special problem combinatorics dp math	0 / 0	(None)
	1341	P1663E Are You Safe? *special problem implementation	0 / 0	(None)
	1340	P1663F In Every Generation... *special problem strings	0 / 0	(None)
	1339	P1663G Six Characters *special problem constructive algorithms strings	0 / 0	(None)
	1338	P1663H Cross-Language Program *special problem constructive algorithms	0 / 0	(None)
	1337	P1665A GCD vs LCM constructive algorithms math *800	0 / 0	3
	1336	P1665B Array Cloning Technique constructive algorithms greedy sortings *900	0 / 0	3
	1335	P1665C Tree Infection binary search greedy sortings trees *1600	0 / 0	5
	1334	P1665D GCD Guess bitmasks chinese remainder theorem constructive algorithms games interactive math number theory *2000	0 / 0	7
	1333	P1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	9
	1332	P1666A Admissible Map *3300	0 / 0	10
	1331	P1666B Budget Distribution *3300	0 / 0	10
	1330	P1666C Connect the Points brute force constructive algorithms geometry *1800	0 / 0	6
	1329	P1666D Deletive Editing greedy *900	0 / 0	3
	1328	P1666E Even Split binary search constructive algorithms greedy math *2500	0 / 0	9
	1327	P1666F Fancy Stack combinatorics dp implementation *2200	0 / 0	8
	1326	P1666G __NO_TITLE__	0 / 0	(None)
	1325	P1666H __NO_TITLE__	0 / 0	(None)
	1324	P1666I Interactive Treasure Hunt brute force constructive algorithms geometry interactive math *2200	0 / 0	8
	1323	P1666J Job Lookup constructive algorithms dp shortest paths trees *2100	0 / 0	7
	1322	P1666K Kingdom Partition flows *3200	0 / 0	10
	1321	P1666L Labyrinth dfs and similar graphs *1800	0 / 0	6
	1320	P1667A Make it Increasing brute force greedy math *1300	0 / 0	4
	1319	P1667B Optimal Partition data structures dp *2100	0 / 0	7
	1318	P1667C Half Queen Cover constructive algorithms math *2400	0 / 0	9
	1317	P1667D Edge Elimination constructive algorithms dfs and similar dp trees *2900	0 / 0	10
	1316	P1667E Centroid Probabilities combinatorics dp fft math *3000	0 / 0	10
	1315	P1667F Yin Yang implementation *3500	0 / 0	10
	1314	P1668A Direction Change implementation math *800	0 / 0	3
	1313	P1668B Social Distance greedy math sortings *900	0 / 0	3
	1312	P1669A Division? implementation *800	0 / 0	3
	1311	P1669B Triple implementation sortings *800	0 / 0	3
	1310	P1669C Odd/Even Increments greedy greedy implementation math *800	0 / 0	3
	1309	P1669D Colorful Stamp implementation *1100	0 / 0	3
	1308	P1669E 2-Letter Strings data structures math strings *1200	0 / 0	4
	1307	P1669F Eating Candies binary search data structures greedy two pointers *1100	0 / 0	3
	1306	P1669G Fall Down dfs and similar implementation *1200	0 / 0	4
	1305	P1669H Maximal AND bitmasks greedy math *1300	0 / 0	4
	1304	P1670A Prof greedy implementation sortings *800	0 / 0	3
	1303	P1670B Dorms War brute force implementation strings *1100	0 / 0	3
	1302	P1670C Where is the Pizza? data structures dfs and similar dsu graphs implementation math *1400	0 / 0	4
	1301	P1670D Very Suspicious binary search brute force geometry greedy implementation math *1700	0 / 0	5
	1300	P1670E Hemose on the Tree bitmasks constructive algorithms dfs and similar trees *2200	0 / 0	8
	1299	P1670F Jee, You See? bitmasks combinatorics dp *2400	0 / 0	9
	1298	P1671A String Building implementation *800	0 / 0	3
	1297	P1671B Consecutive Points Segment brute force math sortings *1000	0 / 0	3
	1296	P1671C Dolce Vita binary search brute force greedy math *1200	0 / 0	4
	1295	P1671D Insert a Progression brute force constructive algorithms greedy *1600	0 / 0	5
	1294	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	7
	1293	P1671F Permutation Counting brute force combinatorics dp fft math *2700	0 / 0	10
	1292	P1672A Log Chopping games implementation math *800	0 / 0	3
	1291	P1672B I love AAAB constructive algorithms implementation *800	0 / 0	3
	1290	P1672C Unequal Array constructive algorithms greedy implementation *1100	0 / 0	3
	1289	P1672D Cyclic Rotation constructive algorithms greedy implementation two pointers *1700	0 / 0	5
	1288	P1672E notepad.exe binary search constructive algorithms greedy interactive *2200	0 / 0	8
	1287	P1672F1 Array Shuffling constructive algorithms graphs greedy *2000	0 / 0	7
	1286	P1672F2 Checker for Array Shuffling constructive algorithms dfs and similar graphs *2800	0 / 0	10
	1285	P1672G Cross Xor constructive algorithms graphs math matrices *3200	0 / 0	10

Pick a problem randomly based on the current filter.