Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2484	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2483	P1446D1 Frequency Problem (Easy Version) data structures greedy *2600	0 / 0	10
	2482	P1446D2 Frequency Problem (Hard Version) data structures greedy two pointers *3000	0 / 0	10
	2481	P1446E Long Recovery constructive algorithms dfs and similar *3500	0 / 0	10
	2480	P1446F Line Distance binary search data structures geometry *3200	0 / 0	10
	2479	P1447A Add Candies constructive algorithms math *800	0 / 0	3
	2478	P1447B Numbers Box greedy math *1000	0 / 0	3
	2477	P1450A Avoid Trygub constructive algorithms sortings *800	0 / 0	3
	2476	P1450B Balls of Steel brute force geometry greedy *1000	0 / 0	3
	2475	P1450C1 Errich-Tac-Toe (Easy Version) constructive algorithms math *2100	0 / 0	7
	2474	P1450C2 Errich-Tac-Toe (Hard Version) constructive algorithms math *2300	0 / 0	8
	2473	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	2472	P1450E Capitalism constructive algorithms dfs and similar graphs shortest paths *2700	0 / 0	10
	2471	P1450F The Struggling Contestant constructive algorithms greedy *2400	0 / 0	9
	2470	P1450G Communism bitmasks dp trees *3500	0 / 0	10
	2469	P1450H1 Multithreading (Easy Version) combinatorics fft math *2900	0 / 0	10
	2468	P1450H2 Multithreading (Hard Version) combinatorics implementation math *3300	0 / 0	10
	2467	P1451A Subtract or Divide greedy math *800	0 / 0	3
	2466	P1451B Non-Substring Subsequence dp greedy implementation strings *900	0 / 0	3
	2465	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	4
	2464	P1451D Circle Game games geometry math *1700	0 / 0	5
	2463	P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	7
	2462	P1451E2 Bitwise Queries (Hard Version) bitmasks constructive algorithms interactive math *2300	0 / 0	8
	2461	P1451F Nullify The Matrix constructive algorithms games *2700	0 / 0	10
	2460	P1452A Robot Program math *800	0 / 0	3
	2459	P1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	4
	2458	P1452C Two Brackets greedy *800	0 / 0	3
	2457	P1452D Radio Towers combinatorics dp math *1600	0 / 0	5
	2456	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	9
	2455	P1452F Divide Powers constructive algorithms greedy *2900	0 / 0	10
	2454	P1452G Game On Tree data structures dfs and similar greedy trees *2700	0 / 0	10
	2453	P1453A Cancel the Trains implementation *800	0 / 0	3
	2452	P1453B Suffix Operations constructive algorithms implementation *1400	0 / 0	4
	2451	P1453C Triangles greedy implementation *1700	0 / 0	5
	2450	P1453D Checkpoints brute force constructive algorithms greedy math probabilities *1900	0 / 0	6
	2449	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2448	P1453F Even Harder dp *2700	0 / 0	10
	2447	P1454A Special Permutation constructive algorithms probabilities *800	0 / 0	3
	2446	P1454B Unique Bid Auction implementation *800	0 / 0	3
	2445	P1454C Sequence Transformation greedy implementation *1200	0 / 0	4
	2444	P1454D Number into Sequence constructive algorithms math number theory *1300	0 / 0	4
	2443	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	7
	2442	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2441	P1455A Strange Functions math number theory *800	0 / 0	3
	2440	P1455B Jumps constructive algorithms math *1200	0 / 0	4
	2439	P1455C Ping-pong constructive algorithms games math *1100	0 / 0	3
	2438	P1455D Sequence and Swaps dp greedy sortings *1600	0 / 0	5
	2437	P1455E Four Points brute force constructive algorithms flows geometry greedy implementation math ternary search *2400	0 / 0	9
	2436	P1455F String and Operations dp greedy *2800	0 / 0	10
	2435	P1455G Forbidden Value data structures dp *2900	0 / 0	10
	2434	P1456E XOR-ranges dp greedy *3500	0 / 0	10
	2433	P1458A Row GCD math number theory *1600	0 / 0	5
	2432	P1458B Glass Half Spilled dp *2000	0 / 0	7
	2431	P1458C Latin Square math matrices *2700	0 / 0	10
	2430	P1458D Flip and Reverse data structures graphs greedy *3100	0 / 0	10
	2429	P1458E Nim Shortcuts data structures games *3100	0 / 0	10
	2428	P1458F Range Diameter Sum data structures trees *3500	0 / 0	10
	2427	P1459A Red-Blue Shuffle math probabilities *800	0 / 0	3
	2426	P1459B Move and Turn dp math *1300	0 / 0	4
	2425	P1461A String Generation constructive algorithms greedy *800	0 / 0	3
	2424	P1461B Find the Spruce brute force dp implementation *1400	0 / 0	4
	2423	P1461C Random Events dp math probabilities *1500	0 / 0	5
	2422	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	2421	P1461E Water Level brute force graphs greedy implementation math *2200	0 / 0	8
	2420	P1461F Mathematical Expression constructive algorithms dp greedy *2700	0 / 0	10
	2419	P1462A Favorite Sequence implementation two pointers *800	0 / 0	3
	2418	P1462B Last Year's Substring dp implementation strings *800	0 / 0	3
	2417	P1462C Unique Number brute force greedy math *900	0 / 0	3
	2416	P1462D Add to Neighbour and Remove greedy math number theory *1400	0 / 0	4
	2415	P1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	5
	2414	P1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	5
	2413	P1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	6
	2412	P1463A Dungeon binary search math *1100	0 / 0	3
	2411	P1463B Find The Array bitmasks constructive algorithms greedy *1400	0 / 0	4
	2410	P1463C Busy Robot implementation *1800	0 / 0	6
	2409	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	6
	2408	P1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	9
	2407	P1463F Max Correct Set bitmasks dp math *3100	0 / 0	10
	2406	P1464F My Beautiful Madness data structures trees *3500	0 / 0	10
	2405	P1466A Bovine Dilemma brute force geometry math *800	0 / 0	3
	2404	P1466B Last minute enhancements dp greedy *800	0 / 0	3
	2403	P1466C Canine poetry dp greedy strings *1300	0 / 0	4
	2402	P1466D 13th Labour of Heracles data structures greedy sortings trees *1500	0 / 0	5
	2401	P1466E Apollo versus Pan bitmasks brute force math *1800	0 / 0	6
	2400	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2399	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	10
	2398	P1466H Finding satisfactory solutions combinatorics dp graphs greedy math *3300	0 / 0	10
	2397	P1466I The Riddle of the Sphinx binary search data structures data structures interactive *3400	0 / 0	10
	2396	P1467A Wizard of Orz constructive algorithms greedy math *900	0 / 0	3
	2395	P1467B Hills And Valleys brute force implementation *1700	0 / 0	5
	2394	P1467C Three Bags constructive algorithms greedy *1900	0 / 0	6
	2393	P1467D Sum of Paths combinatorics dp math *2200	0 / 0	8
	2392	P1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	9
	2391	P1468A LaIS data structures dp greedy *2200	0 / 0	8
	2390	P1468B Bakery data structures dsu *2900	0 / 0	10
	2389	P1468C Berpizza data structures implementation *1400	0 / 0	4
	2388	P1468D Firecrackers binary search sortings *1700	0 / 0	5
	2387	P1468E Four Segments greedy *800	0 / 0	3
	2386	P1468F Full Turn geometry hashing number theory *1700	0 / 0	5
	2385	P1468G Hobbits binary search geometry *2500	0 / 0	9

Pick a problem randomly based on the current filter.