|
|
2000 |
agc050a
[agc050_a]AtCoder Jumper
|
0 / 0 |
7 |
|
|
2001 |
agc050b
[agc050_b]Three Coins
|
0 / 0 |
7 |
|
|
2002 |
agc050c
[agc050_c]Block Game
|
0 / 0 |
8 |
|
|
2003 |
agc050d
[agc050_d]Shopping
|
0 / 0 |
8 |
|
|
2004 |
agc050e
[agc050_e]Three Traffic Lights
|
0 / 0 |
(无) |
|
|
2005 |
agc050f
[agc050_f]NAND Tree
|
0 / 0 |
9 |
|
|
2006 |
agc051a
[agc051_a]Dodecagon
|
0 / 0 |
6 |
|
|
2007 |
agc051b
[agc051_b]Bowling
|
0 / 0 |
6 |
|
|
2008 |
agc051c
[agc051_c]Flipper
|
0 / 0 |
9 |
|
|
2009 |
agc051d
[agc051_d]C4
|
0 / 0 |
8 |
|
|
2010 |
agc051e
[agc051_e]Middle Point
|
0 / 0 |
9 |
|
|
2011 |
agc051f
[agc051_f]rng_58's Last Problem
|
0 / 0 |
9 |
|
|
2012 |
agc052a
[agc052_a]Long Common Subsequence
|
0 / 0 |
5 |
|
|
2013 |
agc052b
[agc052_b]Tree Edges XOR
|
0 / 0 |
8 |
|
|
2014 |
agc052c
[agc052_c]Nondivisible Prefix Sums
|
0 / 0 |
9 |
|
|
2015 |
agc052d
[agc052_d]Equal LIS
|
0 / 0 |
9 |
|
|
2016 |
agc052e
[agc052_e]3 Letters
|
0 / 0 |
9 |
|
|
2017 |
agc052f
[agc052_f]Tree Vertices XOR
|
0 / 0 |
(无) |
|
|
2018 |
agc053a
[agc053_a]>< again
|
0 / 0 |
6 |
|
|
2019 |
agc053b
[agc053_b]Taking the middle
|
0 / 0 |
6 |
|
|
2020 |
agc053c
[agc053_c]Random Card Game
|
0 / 0 |
8 |
|
|
2021 |
agc053d
[agc053_d]Everyone is a winner
|
0 / 0 |
9 |
|
|
2022 |
agc053e
[agc053_e]More Peaks More Fun
|
0 / 0 |
9 |
|
|
2023 |
agc053f
[agc053_f]ESPers
|
0 / 0 |
(无) |
|
|
2024 |
agc054a
[agc054_a]Remove Substrings
|
0 / 0 |
1 |
|
|
2025 |
agc054b
[agc054_b]Greedy Division
|
0 / 0 |
6 |
|
|
2026 |
agc054c
[agc054_c]Roughly Sorted
|
0 / 0 |
6 |
|
|
2027 |
agc054d
[agc054_d](ox)
|
0 / 0 |
9 |
|
|
2028 |
agc054e
[agc054_e]ZigZag Break
|
0 / 0 |
9 |
|
|
2029 |
agc054f
[agc054_f]Decrement
|
0 / 0 |
9 |
|
|
2030 |
agc055a
[agc055_a]ABC Identity
|
0 / 0 |
6 |
|
|
2031 |
agc055b
[agc055_b]ABC Supremacy
|
0 / 0 |
7 |
|
|
2032 |
agc055c
[agc055_c]Weird LIS
|
0 / 0 |
8 |
|
|
2033 |
agc055d
[agc055_d]ABC Ultimatum
|
0 / 0 |
9 |
|
|
2034 |
agc055e
[agc055_e]Set Merging
|
0 / 0 |
(无) |
|
|
2035 |
agc055f
[agc055_f]Creative Splitting
|
0 / 0 |
9 |
|
|
2036 |
agc056a
[agc056_a]Three Cells per Row and Column
|
0 / 0 |
5 |
|
|
2037 |
agc056b
[agc056_b]Range Argmax
|
0 / 0 |
9 |
|
|
2038 |
agc056c
[agc056_c]01 Balanced
|
0 / 0 |
8 |
|
|
2039 |
agc056d
[agc056_d]Subset Sum Game
|
0 / 0 |
9 |
|
|
2040 |
agc056e
[agc056_e]Cheese
|
0 / 0 |
9 |
|
|
2041 |
agc056f
[agc056_f]Degree Sequence in DFS Order
|
0 / 0 |
9 |
|
|
2042 |
agc057a
[agc057_a]Antichain of Integer Strings
|
0 / 0 |
6 |
|
|
2043 |
agc057b
[agc057_b]2A + x
|
0 / 0 |
7 |
|
|
2044 |
agc057c
[agc057_c]Increment or Xor
|
0 / 0 |
9 |
|
|
2045 |
agc057d
[agc057_d]Sum Avoidance
|
0 / 0 |
9 |
|
|
2046 |
agc057e
[agc057_e]RowCol/ColRow Sort
|
0 / 0 |
9 |
|
|
2047 |
agc057f
[agc057_f]Reflection
|
0 / 0 |
9 |
|
|
2048 |
agc058a
[agc058_a]Make it Zigzag
|
0 / 0 |
5 |
|
|
2049 |
agc058b
[agc058_b]Adjacent Chmax
|
0 / 0 |
7 |
|
|
2050 |
agc058c
[agc058_c]Planar Tree
|
0 / 0 |
9 |
|
|
2051 |
agc058d
[agc058_d]Yet Another ABC String
|
0 / 0 |
9 |
|
|
2052 |
agc058e
[agc058_e]Nearer Permutation
|
0 / 0 |
9 |
|
|
2053 |
agc058f
[agc058_f]Authentic Tree DP
|
0 / 0 |
9 |
|
|
2054 |
agc059a
[agc059_a]My Last ABC Problem
|
0 / 0 |
7 |
|
|
2055 |
agc059b
[agc059_b]Arrange Your Balls
|
0 / 0 |
7 |
|
|
2056 |
agc059c
[agc059_c]Guessing Permutation for as Long as Possible
|
0 / 0 |
8 |
|
|
2057 |
agc059d
[agc059_d]Distinct Elements on Subsegments
|
0 / 0 |
9 |
|
|
2058 |
agc059e
[agc059_e]Grid 3-coloring
|
0 / 0 |
9 |
|
|
2059 |
agc059f
[agc059_f]LIDS
|
0 / 0 |
9 |
|
|
2060 |
agc060a
[agc060_a]No Majority
|
0 / 0 |
6 |
|
|
2061 |
agc060b
[agc060_b]Unique XOR Path
|
0 / 0 |
7 |
|
|
2062 |
agc060c
[agc060_c]Large Heap
|
0 / 0 |
8 |
|
|
2063 |
agc060d
[agc060_d]Same Descent Set
|
0 / 0 |
9 |
|
|
2064 |
agc060e
[agc060_e]Number of Cycles
|
0 / 0 |
9 |
|
|
2065 |
agc060f
[agc060_f]Spanning Trees of Interval Graph
|
0 / 0 |
9 |
|
|
2066 |
agc061a
[agc061_a]Long Shuffle
|
0 / 0 |
6 |
|
|
2067 |
agc061b
[agc061_b]Summation By Construction
|
0 / 0 |
9 |
|
|
2068 |
agc061c
[agc061_c]First Come First Serve
|
0 / 0 |
8 |
|
|
2069 |
agc061d
[agc061_d]Almost Multiplication Table
|
0 / 0 |
9 |
|
|
2070 |
agc061e
[agc061_e]Increment or XOR
|
0 / 0 |
9 |
|
|
2071 |
agc061f
[agc061_f]Perfect Strings
|
0 / 0 |
9 |
|
|
2072 |
agc062a
[agc062_a]Right Side Character
|
0 / 0 |
5 |
|
|
2073 |
agc062b
[agc062_b]Split and Insert
|
0 / 0 |
8 |
|
|
2074 |
agc062c
[agc062_c]Mex of Subset Sum
|
0 / 0 |
7 |
|
|
2075 |
agc062d
[agc062_d]Walk Around Neighborhood
|
0 / 0 |
9 |
|
|
2076 |
agc062e
[agc062_e]Overlap Binary Tree
|
0 / 0 |
9 |
|
|
2077 |
agc062f
[agc062_f]Preserve Distinct
|
0 / 0 |
(无) |
|
|
2078 |
ahc019a
[ahc019_a]Silhouette Block Puzzle Creation
|
0 / 0 |
9 |
|
|
2079 |
ahc019b
__NO_TITLE__
|
0 / 0 |
9 |
|
|
2080 |
ahc020a
[ahc020_a]Broadcasting
|
0 / 0 |
10 |
|
|
2081 |
ahc021a
[ahc021_a]Pyramid Sorting
|
0 / 0 |
10 |
|
|
2082 |
aising2019a
[aising2019_a]Bulletin Board
|
0 / 0 |
1 |
|
|
2083 |
aising2019b
[aising2019_b]Contests
|
0 / 0 |
4 |
|
|
2084 |
aising2019c
[aising2019_c]Alternating Path
|
0 / 0 |
5 |
|
|
2085 |
aising2019d
[aising2019_d]Nearest Card Game
|
0 / 0 |
6 |
|
|
2086 |
aising2019e
[aising2019_e]Attack to a Tree
|
0 / 0 |
8 |
|
|
2087 |
aising2020a
[aising2020_a]Number of Multiples
|
0 / 0 |
1 |
|
|
2088 |
aising2020b
[aising2020_b]An Odd Problem
|
0 / 0 |
1 |
|
|
2089 |
aising2020c
[aising2020_c]XYZ Triplets
|
0 / 0 |
4 |
|
|
2090 |
aising2020d
[aising2020_d]Anything Goes to Zero
|
0 / 0 |
6 |
|
|
2091 |
aising2020e
[aising2020_e]Camel Train
|
0 / 0 |
7 |
|
|
2092 |
aising2020f
[aising2020_f]Two Snuke
|
0 / 0 |
8 |
|
|
2093 |
apc001a
[apc001_a]Two Integers
|
0 / 0 |
1 |
|
|
2094 |
apc001b
[apc001_b]Two Arrays
|
0 / 0 |
5 |
|
|
2095 |
apc001c
[apc001_c]Vacant Seat
|
0 / 0 |
7 |
|
|
2096 |
apc001d
[apc001_d]Forest
|
0 / 0 |
7 |
|
|
2097 |
apc001e
[apc001_e]Antennas on Tree
|
0 / 0 |
8 |
|
|
2098 |
apc001f
[apc001_f]XOR Tree
|
0 / 0 |
9 |
|
|
2099 |
apc001g
[apc001_g]Colorful Doors
|
0 / 0 |
9 |
