AUSTRALIA / THE LAST 30 DAYS


holy competitive.

What is Australia grinding?
Explore recent submissions and find problems you havenโ€™t solved yet.

THE GRIND IS REALAUCF โ‰ฅ 1200 ยท AT โ‰ฅ 1200Self-declared profile country / region

Your handle. Your next challenge.

Enter either or both handles to exclude your all-time accepted problems. Leave them blank to browse the public problem pool.

253 / 253 USERS SYNCED ยท 253 FRESH WITHIN 36H

Recently on the grind

271 problems
Difficulty โ†“ProblemLast 30 daysWhoโ€™s working on it
2100 1265/EBeautiful Mirrors โ†—data structures ยท dp ยท math ยท probabilities 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 1312/EArray Shrinking โ†—dp ยท greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 1354/EGraph Coloring โ†—dfs and similar ยท dp ยท graphs 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 1365/FSwaps Again โ†—constructive algorithms ยท implementation ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 1555/EBoring Segments โ†—data structures ยท sortings ยท trees ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 2068/CAds โ†—binary search ยท greedy ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 2257/EBusy Beaver โ†—brute force ยท data structures ยท divide and conquer ยท dp ยท greedy ยท implementation ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 2274/EMatrix Puzzle โ†—data structures ยท matrices 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 118/EBertown roads โ†—dfs and similar ยท graphs 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
2000 1454/ENumber of Simple Paths โ†—combinatorics ยท dfs and similar ยท graphs ยท trees 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
2000 1536/DOmkar and Medians โ†—data structures ยท greedy ยท implementation 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
2000 1156/CMatch Points โ†—binary search ยท greedy ยท sortings ยท ternary search ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 1379/CChoosing flowers โ†—binary search ยท brute force ยท data structures ยท dfs and similar ยท dp ยท greedy ยท sortings ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 1388/DCaptain Flint and Treasure โ†—data structures ยท dfs and similar ยท graphs ยท greedy ยท implementation ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 1399/E1Weights Division (easy version) โ†—data structures ยท dfs and similar ยท greedy ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 1741/FMulti-Colored Segments โ†—binary search ยท data structures ยท math ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 1744/FMEX vs MED โ†—math ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 1872/GReplace With Product โ†—brute force ยท greedy ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 1936/BPinball โ†—binary search ยท data structures ยท implementation ยท math ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 1974/GMoney Buys Less Happiness Now โ†—data structures ยท greedy ยท sortings 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
2000 2180/DInsolvable Disks โ†—data structures ยท dp ยท greedy ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2000 2267/EClean Substrings โ†—combinatorics ยท data structures ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 1175/DArray Splitting โ†—greedy ยท sortings 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
1900 1650/ERescheduling the Exam โ†—binary search ยท data structures ยท greedy ยท implementation ยท math ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 1902/DRobot Queries โ†—binary search ยท data structures ยท dp ยท implementation 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 1927/FMicrocycle โ†—data structures ยท dfs and similar ยท dsu ยท graphs ยท greedy ยท implementation ยท sortings ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 2001/DLongest Max Min Subsequence โ†—brute force ยท constructive algorithms ยท data structures ยท greedy ยท implementation 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 2180/CXOR-factorization โ†—bitmasks ยท constructive algorithms ยท dp ยท greedy ยท number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 2200/FMooclear Reactor 2 โ†—brute force ยท data structures ยท greedy ยท implementation ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 2264/DDr. Agos's Dark Mode โ†—brute force ยท chinese remainder theorem ยท constructive algorithms ยท math ยท strings 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
1900 2273/BRobot Championship โ†—constructive algorithms ยท math 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
1900 2274/DRobot Championship โ†—math ยท number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 2275/GCopper Squander โ†—binary search ยท data structures ยท dsu ยท graphs ยท greedy ยท math ยท sortings ยท ternary search 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1900 321/BCiel and Duel โ†—dp ยท flows ยท greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1800 2261/EWhat Does the Cow Say? โ†—binary search ยท data structures ยท dfs and similar ยท greedy ยท trees 4 users submitted3 accepted ยท 1 no known AC
4 handles View โ†—
1800 2275/FTea Blend โ†—hashing ยท math ยท number theory 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1800 1398/DColored Rectangles โ†—dp ยท greedy ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1800 1666/LLabyrinth โ†—dfs and similar ยท graphs 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1800 1734/DSlime Escape โ†—data structures ยท dp ยท greedy ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1800 220/BLittle Elephant and Array โ†—constructive algorithms ยท data structures 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1700 1474/CArray Destruction โ†—brute force ยท constructive algorithms ยท data structures ยท greedy ยท implementation ยท sortings 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1700 2252/DArray Replacement โ†—greedy ยท sortings 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1700 2260/DSigns of Prefix Sums โ†—brute force ยท constructive algorithms ยท dfs and similar ยท dp ยท implementation 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1700 1157/EMinimum Array โ†—binary search ยท data structures ยท greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1700 1343/DConstant Palindrome Sum โ†—brute force ยท data structures ยท greedy ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1700 1702/FEquate Multisets โ†—constructive algorithms ยท data structures ยท greedy ยท math ยท number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1700 2122/CManhattan Pairs โ†—constructive algorithms ยท geometry ยท greedy ยท math ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1700 2236/EFriendly Gifts โ†—brute force ยท dp 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1700 2236/F1Elections in Saransk (easy version) โ†—number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1700 2241/FA Bit Odd โ†—data structures ยท games ยท greedy ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—