Problem Set - bitmasks - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3879	codeforces#P1174D Ehab and the Expected XOR Problem bitmasks constructive algorithms *1900	0 / 0	6
	3805	codeforces#P1185F Two Pizzas bitmasks brute force *2100	0 / 0	7
	3804	codeforces#P1185G1 Playlist for Polycarp (easy version) bitmasks combinatorics dp *2100	0 / 0	7
	3763	codeforces#P1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	0 / 0	8
	3720	codeforces#P1202A You Are Given Two Binary Strings... bitmasks greedy *1100	0 / 0	3
	3699	codeforces#P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	6
	3688	codeforces#P1207E XOR Guessing bitmasks interactive math *1900	0 / 0	6
	3680	codeforces#P1208F Bits And Pieces bitmasks dfs and similar dp greedy *2600	0 / 0	10
	3673	codeforces#P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	7
	3672	codeforces#P1209E2 Rotate Columns (hard version) bitmasks dp greedy sortings *2500	0 / 0	9
	3636	codeforces#P1214G Feeling Good bitmasks data structures *3200	0 / 0	10
	3630	codeforces#P1215E Marbles bitmasks dp *2200	0 / 0	8
	3619	codeforces#P1217C The Number Of Good Substrings binary search bitmasks brute force *1700	0 / 0	5
	3601	codeforces#P1220D Alex and Julian bitmasks math number theory *1900	0 / 0	6
	3591	codeforces#P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	10
	3580	codeforces#P1225C p-binary bitmasks brute force math *1600	0 / 0	5
	3576	codeforces#P1225G To Make 1 bitmasks constructive algorithms dp greedy number theory *3100	0 / 0	10
	3550	codeforces#P1234F Yet Another Substring Reverse bitmasks dp *2200	0 / 0	8
	3530	codeforces#P1238E Keyboard Purchase bitmasks dp *2200	0 / 0	8
	3518	codeforces#P1242C Sum Balance bitmasks dfs and similar dp graphs *2400	0 / 0	9
	3500	codeforces#P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	8
	3427	codeforces#P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
	3419	codeforces#P1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	10
	3373	codeforces#P1270C Make Good bitmasks constructive algorithms math *1400	0 / 0	4
	3303	codeforces#P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3288	codeforces#P1288D Minimax Problem binary search bitmasks dp *2000	0 / 0	7
	3271	codeforces#P1292F Nora's Toy Boxes bitmasks combinatorics dp *3500	0 / 0	10
	3237	codeforces#P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	10
	3222	codeforces#P1302F Keep talking and nobody explodes – easy bitmasks brute force expression parsing	0 / 0	(None)
	3214	codeforces#P1303D Fill The Bag bitmasks greedy *1900	0 / 0	6
	3197	codeforces#P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	10
	3174	codeforces#P1312C Adding Powers bitmasks greedy implementation math number theory ternary search *1400	0 / 0	4
	3165	codeforces#P1313D Happy New Year bitmasks dp implementation *2500	0 / 0	9
	3156	codeforces#P1316E Team Building bitmasks dp greedy sortings *2300	0 / 0	8
	3145	codeforces#P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	7
	3143	codeforces#P1322D Reality Show bitmasks dp *2800	0 / 0	10
	3129	codeforces#P1325D Ehab the Xorcist bitmasks constructive algorithms greedy number theory *1700	0 / 0	5
	3120	codeforces#P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	3119	codeforces#P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	10
	3112	codeforces#P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	9
	3111	codeforces#P1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	10
	3103	codeforces#P1329B Dreamoon Likes Sequences bitmasks combinatorics math *1700	0 / 0	5
	3095	codeforces#P1331C ...And after happily lived ever they *special problem bitmasks	0 / 0	(None)
	3086	codeforces#P1332D Walk on Matrix bitmasks constructive algorithms math *1700	0 / 0	5
	3070	codeforces#P1334G Substring Search bitmasks brute force fft *2900	0 / 0	10
	3058	codeforces#P1336E1 Chiori and Doll Picking (easy version) bitmasks brute force combinatorics math *2700	0 / 0	10
	3057	codeforces#P1336E2 Chiori and Doll Picking (hard version) bitmasks brute force combinatorics math *3500	0 / 0	10
	3052	codeforces#P1338B Edge Weight Assignment bitmasks constructive algorithms dfs and similar greedy math trees *1800	0 / 0	6
	3051	codeforces#P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	8
	3045	codeforces#P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	5
	3033	codeforces#P1342F Make It Ascending bitmasks brute force dp *3000	0 / 0	10
	2919	codeforces#P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
	2917	codeforces#P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	7
	2914	codeforces#P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	2909	codeforces#P1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	4
	2908	codeforces#P1362C Johnny and Another Rating Drop bitmasks greedy math *1400	0 / 0	4
	2897	codeforces#P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	10
	2890	codeforces#P1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	10
	2872	codeforces#P1368D AND, OR and square sum bitmasks greedy math *1700	0 / 0	5
	2794	codeforces#P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	6
	2793	codeforces#P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	2783	codeforces#P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	5
	2777	codeforces#P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	10
	2757	codeforces#P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	2751	codeforces#P1392E Omkar and Duck bitmasks constructive algorithms interactive math *2100	0 / 0	7
	2749	codeforces#P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	10
	2733	codeforces#P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	5
	2719	codeforces#P1398G Running Competition bitmasks fft math number theory *2600	0 / 0	10
	2705	codeforces#P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	10
	2699	codeforces#P1401F Reverse and Swap binary search bitmasks data structures *2400	0 / 0	9
	2656	codeforces#P1411E Poman Numbers bitmasks greedy math strings *2300	0 / 0	8
	2654	codeforces#P1411G No Game No Life bitmasks games math matrices *2700	0 / 0	10
	2644	codeforces#P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	7
	2639	codeforces#P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2618	codeforces#P1420B Rock and Lever bitmasks math *1200	0 / 0	4
	2613	codeforces#P1421A XORwice bitmasks greedy math *800	0 / 0	3
	2594	codeforces#P1423I Lookup Tables bitmasks *3000	0 / 0	10
	2593	codeforces#P1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	9
	2568	codeforces#P1427E Xum bitmasks constructive algorithms math matrices number theory *2500	0 / 0	9
	2549	codeforces#P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	10
	2514	codeforces#P1438D Powerful Ksenia bitmasks constructive algorithms math *2200	0 / 0	8
	2513	codeforces#P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	2506	codeforces#P1439E Cheat and Win bitmasks data structures games trees *3500	0 / 0	10
	2484	codeforces#P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2470	codeforces#P1450G Communism bitmasks dp trees *3500	0 / 0	10
	2463	codeforces#P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	7
	2462	codeforces#P1451E2 Bitwise Queries (Hard Version) bitmasks constructive algorithms interactive math *2300	0 / 0	8
	2411	codeforces#P1463B Find The Array bitmasks constructive algorithms greedy *1400	0 / 0	4
	2407	codeforces#P1463F Max Correct Set bitmasks dp math *3100	0 / 0	10
	2401	codeforces#P1466E Apollo versus Pan bitmasks brute force math *1800	0 / 0	6
	2400	codeforces#P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2373	codeforces#P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	9
	2370	codeforces#P1470B Strange Definition bitmasks graphs hashing math number theory *1900	0 / 0	6
	2332	codeforces#P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2317	codeforces#P1479C Continuous City bitmasks constructive algorithms *2500	0 / 0	9
	2316	codeforces#P1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	10
	2258	codeforces#P1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	6
	2249	codeforces#P1492D Genius's Gambit bitmasks constructive algorithms greedy math *1900	0 / 0	6
	2243	codeforces#P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	10
	2242	codeforces#P1493F Enchanted Matrix bitmasks interactive number theory *2600	0 / 0	10

Pick a problem randomly based on the current filter.