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
3300 1060/HSophisticated Device โ†—constructive algorithms 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
3100 1188/DMake Equal โ†—dp 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
3100 1628/EGroceries in Meteor Town โ†—binary search ยท data structures ยท dsu ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
3100 896/EWelcome home, Chtholly โ†—data structures ยท dsu 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
3000 2229/GRoadworks โ†—binary search ยท data structures ยท dp ยท greedy ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
3000 618/FDouble Knapsack โ†—constructive algorithms ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2900 2246/FWhoname and Unsorted Array โ†—constructive algorithms 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2800 1155/FDelivery Oligopoly โ†—brute force ยท dp ยท graphs 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2800 1286/C2Madhouse (Hard version) โ†—brute force ยท constructive algorithms ยท hashing ยท interactive ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2800 1389/GDirecting Edges โ†—dfs and similar ยท dp ยท graphs ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2800 2264/FDeranged Calculator โ†—constructive algorithms ยท implementation ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2800 613/DKingdom and its Cities โ†—dfs and similar ยท divide and conquer ยท dp ยท graphs ยท sortings ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2700 1000/GTwo-Paths โ†—data structures ยท dp ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2700 1140/GDouble Tree โ†—data structures ยท divide and conquer ยท shortest paths ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2700 1292/DChaotic V. โ†—dp ยท graphs ยท greedy ยท math ยท number theory ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2700 1574/FOccurrences โ†—combinatorics ยท dfs and similar ยท dp ยท dsu ยท fft ยท graphs 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2600 1185/G2Playlist for Polycarp (hard version) โ†—combinatorics ยท dp 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2600 1736/ESwap and Take โ†—dp ยท greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2600 1994/GMinecraft โ†—bitmasks ยท brute force ยท dp ยท graphs ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2500 1513/FSwapping Problem โ†—brute force ยท constructive algorithms ยท data structures ยท sortings 2 users submitted1 accepted ยท 1 no known AC
2 handles View โ†—
2500 1174/EEhab and the Expected GCD Problem โ†—combinatorics ยท dp ยท math ยท number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2500 1574/EColoring โ†—combinatorics ยท constructive algorithms ยท implementation ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2500 1824/CLuoTianyi and XOR-Tree โ†—data structures ยท dfs and similar ยท dp ยท dsu ยท greedy ยท trees 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
2500 1994/FStardew Valley โ†—constructive algorithms ยท dfs and similar ยท graphs ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2500 2021/DBoss, Thirsty โ†—dp ยท greedy ยท implementation 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2500 660/FBear and Bowling 4 โ†—binary search ยท data structures ยท divide and conquer ยท geometry ยท ternary search 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2400 1837/FEditorial for Two โ†—binary search ยท data structures ยท greedy ยท implementation 2 users submitted2 accepted ยท 0 no known AC
2 handles View โ†—
2400 1137/DCooperative Game โ†—constructive algorithms ยท interactive ยท number theory 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2400 1264/CBeautiful Mirrors with queries โ†—data structures ยท probabilities 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2400 1286/C1Madhouse (Easy version) โ†—brute force ยท constructive algorithms ยท interactive ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2400 1473/EMinimum Path โ†—graphs ยท shortest paths 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2400 2261/D2Come Be My Friend, Don't Be So Scared (Hard Version) โ†—constructive algorithms ยท data structures ยท dsu ยท graphs ยท hashing ยท trees ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2300 1148/EEarth Wind and Fire โ†—constructive algorithms ยท greedy ยท math ยท sortings ยท two pointers 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
2300 1151/FSonya and Informatics โ†—combinatorics ยท dp ยท matrices ยท probabilities 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2300 1203/F2Complete the Projects (hard version) โ†—dp ยท greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2300 1453/EDog Snacks โ†—binary search ยท dfs and similar ยท dp ยท greedy ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2300 1494/DDogeforces โ†—constructive algorithms ยท data structures ยท dfs and similar ยท divide and conquer ยท dsu ยท greedy ยท sortings ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2300 2069/EA, B, AB and BA โ†—constructive algorithms ยท greedy ยท sortings ยท strings 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
2300 2180/ENo Effect XOR โ†—bitmasks ยท divide and conquer ยท dp ยท greedy ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2300 2268/CKiaKio and Energy Intervals โ†—binary search ยท bitmasks ยท data structures ยท divide and conquer ยท dsu ยท greedy ยท trees ยท two pointers 1 user submitted0 accepted ยท 1 no known AC
1 handle View โ†—
2200 1136/ENastya Hasn't Written a Legend โ†—binary search ยท data structures 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2200 1140/EPalindrome-less Arrays โ†—combinatorics ยท divide and conquer ยท dp 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2200 1194/ECount The Rectangles โ†—bitmasks ยท brute force ยท data structures ยท geometry ยท sortings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2200 1336/CKaavi and Magic Spell โ†—dp ยท strings 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2200 1567/ENon-Decreasing Dilemma โ†—data structures ยท divide and conquer ยท math 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2200 1721/EPrefix Function Queries โ†—dfs and similar ยท dp ยท hashing ยท string suffix structures ยท strings ยท trees 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2200 617/EXOR and Favorite Number โ†—data structures 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2200 86/DPowerful array โ†—data structures ยท implementation ยท math ยท two pointers 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 1185/G1Playlist for Polycarp (easy version) โ†—bitmasks ยท combinatorics ยท dp 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—
2100 1203/F1Complete the Projects (easy version) โ†—greedy 1 user submitted1 accepted ยท 0 no known AC
1 handle View โ†—