Problems
Problem | Category | Types | Points | AC % | Users | |
---|---|---|---|---|---|---|
NOIP '22 P4 - Contest | China NOI | Data Structures | 25p | 10.4% | 7 | |
NOIP '99 Junior P1 - Cantor Table | China NOI | Implementation | 5p | 47.4% | 18 | |
NOIP '99 P1 - Missile Interception | China NOI | Dynamic Programming, Greedy Algorithms | 12p | 41.6% | 42 | |
NOIP '99 P2 - Palindrome Numbers | China NOI | Implementation, String Algorithms | 7p | 14.5% | 27 | |
NOIP '99 P3 - Traveller's Budget | China NOI | Greedy Algorithms | 12p | 11.4% | 13 | |
NOIP '99 P4 - Stamp Face Value Design | China NOI | Dynamic Programming | 12p | 11.4% | 10 | |
NOI Winter Camp '09 P1 - A Shortest Path Problem | China NOI | Data Structures | 40p | 50.4% | 6 | |
NOI Winter Camp '17 P2: Challenge | China NOI | Ad Hoc | 25p | 0.0% | 0 | |
Non-space-separated | Uncategorized | Brute Force | 10 | 30.8% | 47 | |
Not an Aho-Corasick Problem | Uncategorized | Dynamic Programming, String Algorithms | 20 | 10.0% | 11 | |
ICPC NWERC 2005 A - Unequalled Consumption | ICPC | Advanced Math | 25 | 0.0% | 0 | |
ICPC NWERC 2011 A - Binomial Coefficients | ICPC | Intermediate Math | 10 | 24.7% | 16 | |
ICPC NWERC 2011 C - Movie Collection | ICPC | Data Structures | 10 | 51.7% | 10 | |
ICPC NWERC 2011 F - Pool Construction | ICPC | Uncategorized | 25 | 35.3% | 6 | |
ICPC NWERC 2014 F - Finding Lines | ICPC | Simulation | 17 | 4.5% | 1 | |
ICPC NWERC 2015 A - Assigning Workstations | ICPC | Greedy Algorithms | 10 | 31.4% | 13 | |
ICPC NWERC 2015 E - Elementary Math | ICPC | Graph Theory | 15 | 35.4% | 6 | |
OCC '19 B1 - Darcy_Liu | Olympiads School | Implementation | 3 | 15.0% | 167 | |
OCC '19 B2 - Cinematic | Olympiads School | Implementation | 5 | 16.7% | 78 | |
OCC '19 B3 - Difference | Olympiads School | Simple Math | 5 | 22.7% | 82 | |
OCC '19 B4 - Bussing | Olympiads School | Implementation | 5 | 23.0% | 16 | |
OCC '19 B5 - Gold | Olympiads School | Greedy Algorithms | 7 | 12.2% | 21 | |
OCC '19 B6 - Fiji water | Olympiads School | Game Theory | 10p | 16.5% | 19 | |
OCC '19 G1 - Top Coder | Olympiads School | Ad Hoc, Data Structures | 10p | 34.5% | 45 | |
OCC '19 G2 - A Guessing Game | Olympiads School | Ad Hoc | 25p | 7.2% | 6 | |
OCC '19 G3 - Binary Game | Olympiads School | Dynamic Programming | 25p | 14.3% | 5 | |
OCC '19 G4 - Willson and Fighting | Olympiads School | Ad Hoc, Divide and Conquer | 30p | 3.5% | 3 | |
OCC '19 G5 - King kobortor's Infrastructure | Olympiads School | Graph Theory | 17p | 25.7% | 25 | |
OCC '19 G6 - Monkeys in a Tree | Olympiads School | Data Structures, Graph Theory | 30p | 10.0% | 9 | |
OCC '19 S1 - Floor Planning | Uncategorized | Simple Math | 3p | 32.8% | 62 | |
OCC '19 S2 - Rimuru's Number Game | Uncategorized | Brute Force, Recursion | 5 | 27.4% | 409 | |
OCC '19 S3 - NAN Language | Olympiads School | Greedy Algorithms, String Algorithms | 7p | 15.4% | 32 | |
OCC '19 S5 - Partitioning | Olympiads School | Dynamic Programming | 12p | 9.0% | 13 | |
OCC '19 S6 - City Tolls | Olympiads School | Data Structures, Graph Theory | 17p | 27.8% | 5 | |
The Odd Number | Uncategorized | Intermediate Math | 7 | 11.5% | 407 | |
Overflow | Uncategorized | Data Structures | 30p | 5.6% | 9 | |
AQT's Tree Game | Uncategorized | Ad Hoc | 30 | 4.8% | 14 | |
Palindrome Path | Olympiads School | Dynamic Programming, Graph Theory | 20p | 10.1% | 14 | |
Dreaming Again | Olympiads School | Dynamic Programming, Graph Theory | 30p | 7.0% | 6 | |
Bob's Function | Olympiads School | Data Structures, Intermediate Math | 17p | 15.7% | 12 | |
Bob's Bitwise Operation | Olympiads School | Ad Hoc, Data Structures | 17p | 7.6% | 12 | |
Dan's Monkeys | Olympiads School | Data Structures | 20p | 8.8% | 10 | |
Bob's Shortest Non-common Substring | Olympiads School | Dynamic Programming | 20p | 17.9% | 11 | |
Bob's Longest Common Path | Olympiads School | Data Structures, Graph Theory | 25p | 6.3% | 5 | |
Bob's Kingdom | Olympiads School | Greedy Algorithms | 12p | 16.2% | 28 | |
The Subset | Olympiads School | Dynamic Programming, Intermediate Math | 20p | 18.2% | 10 | |
Circular Knapsack Problem | Olympiads School | Data Structures, Dynamic Programming | 25p | 8.6% | 8 | |
Maximum Deviation Spanning Tree | Olympiads School | Graph Theory | 25p | 3.9% | 4 | |
Bob's Farm | Uncategorized | Data Structures, Dynamic Programming | 20p | 31.7% | 8 | |
Least Multiple | Olympiads School | Intermediate Math | 10p | 8.0% | 36 |