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.

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

Recently on the grind

290 problems
Difficulty โ†“ProblemLast 30 daysWhoโ€™s working on it
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 1154/ETwo Teams โ†—data structures ยท implementation ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle 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 2271/DTarget Infection โ†—binary search ยท brute force ยท greedy ยท implementation ยท two pointers 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 โ†—
1700 2244/FAnya Loves Trees! โ†—dfs and similar ยท dp ยท greedy ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1700 2267/F1XOR Transformations (Easy Version) โ†—bitmasks ยท brute force ยท implementation ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 1622/CSet or Decrease โ†—binary search ยท brute force ยท greedy ยท sortings 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1600 1920/CPartitioning the Array โ†—brute force ยท math ยท number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 2223/BZhily and Barknights โ†—binary search ยท data structures ยท dp ยท math ยท sortings ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 2224/DZhily and Barknights โ†—binary search ยท data structures ยท math ยท sortings ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 2232/C2Seating Arrangement (Hard Version) โ†—binary search ยท greedy ยท math ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 2239/BDecidophobia โ†—greedy ยท math ยท sortings ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 2241/EFair and Square โ†—combinatorics ยท dp ยท graphs ยท math ยท number theory ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 2242/DTwo Digit Strings โ†—dp ยท strings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 2255/BA Ribbon for Tomorrow โ†—combinatorics ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1600 2258/CFar Cities โ†—interactive ยท trees ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2275/ERepentance Is Already on the Way โ†—dp ยท implementation 3 users submitted3 accepted ยท 0 no known AC
3 handles View โ†—
1500 1551/CInteresting Story โ†—greedy ยท sortings ยท strings 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1500 1924/ADid We Get Everything Covered? โ†—constructive algorithms ยท dp ยท greedy ยท shortest paths ยท strings 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1500 2253/CSum of Distinct Values in a Matrix โ†—greedy ยท sortings ยท two pointers 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1500 2259/ETreasure Map Destruction (Constructive Version) โ†—2-sat ยท constructive algorithms ยท greedy 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
1500 1340/ANastya and Strange Generator โ†—brute force ยท data structures ยท greedy ยท implementation 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 1791/FRange Update Point Query โ†—binary search ยท brute force ยท data structures 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 1842/CTenzing and Balls โ†—dp 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 1915/FGreetings โ†—data structures ยท divide and conquer ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2218/FThe 67th Tree Problem โ†—constructive algorithms ยท implementation ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2222/CMedian Partition โ†—dp ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2225/DExceptional Segments โ†—bitmasks ยท brute force ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2234/DXOR, Expression and Two Binary Numbers โ†—bitmasks ยท divide and conquer ยท dp ยท math ยท number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2238/DStorming Arasaka โ†—greedy ยท math ยท number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2247/D1XOR Sorting (Easy Version) โ†—bitmasks ยท greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2254/EChronostasis โ†—binary search ยท data structures ยท greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2268/BWhat a SauSaGe! It's All Meat โ†—bitmasks ยท brute force ยท data structures ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1500 2269/DWhat a SauSaGe! It's All Meat โ†—bitmasks ยท greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
1400 2271/CXOR Problem โ†—bitmasks ยท constructive algorithms ยท graphs ยท greedy ยท math 3 users submitted3 accepted ยท 0 no known AC
3 handles View โ†—