|
1232 |
P1681A Game with Cards
|
0 / 0 |
3 |
|
1226 |
P1682A Palindromic Indices
|
0 / 0 |
3 |
|
1224 |
P1682C LIS or Reverse LIS?
|
0 / 0 |
4 |
|
1222 |
P1682E Unordered Swaps
|
0 / 0 |
10 |
|
1221 |
P1682F MCMF?
|
0 / 0 |
10 |
|
1218 |
P1684C Column Swapping
|
0 / 0 |
4 |
|
1217 |
P1684D Traps
|
0 / 0 |
5 |
|
1216 |
P1684E MEX vs DIFF
|
0 / 0 |
7 |
|
1212 |
P1685A Circular Local MiniMax
|
0 / 0 |
3 |
|
1211 |
P1685B Linguistics
|
0 / 0 |
7 |
|
1210 |
P1685C Bring Balance
|
0 / 0 |
10 |
|
1208 |
P1685D2 Permutation Weight (Hard Version)
|
0 / 0 |
10 |
|
1207 |
P1685E The Ultimate LIS Problem
|
0 / 0 |
10 |
|
1206 |
P1686A Everything Everywhere All But One
|
0 / 0 |
3 |
|
1205 |
P1686B Odd Subarrays
|
0 / 0 |
3 |
|
1204 |
P1687A The Enchanted Forest
|
0 / 0 |
5 |
|
1203 |
P1687B Railway System
|
0 / 0 |
5 |
|
1202 |
P1687C Sanae and Giant Robot
|
0 / 0 |
9 |
|
1200 |
P1687E Become Big For Me
|
0 / 0 |
10 |
|
1197 |
P1688B Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
1196 |
P1688C Manipulating History
|
0 / 0 |
5 |
|
1195 |
P1689A Lex String
|
0 / 0 |
3 |
|
1194 |
P1689B Mystic Permutation
|
0 / 0 |
3 |
|
1190 |
P1690A Print a Pedestal (Codeforces logo?)
|
0 / 0 |
3 |
|
1189 |
P1690B Array Decrements
|
0 / 0 |
3 |
|
1188 |
P1690C Restoring the Duration of Tasks
|
0 / 0 |
3 |
|
1186 |
P1690E Price Maximization
|
0 / 0 |
5 |
|
1184 |
P1690G Count the Trains
|
0 / 0 |
7 |
|
1183 |
P1691A Beat The Odds
|
0 / 0 |
3 |
|
1182 |
P1691B Shoe Shuffling
|
0 / 0 |
3 |
|
1181 |
P1691C Sum of Substrings
|
0 / 0 |
4 |
|
1179 |
P1691E Number of Groups
|
0 / 0 |
8 |
|
1176 |
P1692B All Distinct
|
0 / 0 |
3 |
|
1170 |
P1692H Gambling
|
0 / 0 |
5 |
|
1169 |
P1693A Directional Increase
|
0 / 0 |
4 |
|
1168 |
P1693B Fake Plastic Trees
|
0 / 0 |
5 |
|
1167 |
P1693C Keshi in Search of AmShZ
|
0 / 0 |
8 |
|
1166 |
P1693D Decinc Dividing
|
0 / 0 |
10 |
|
1165 |
P1693E Outermost Maximums
|
0 / 0 |
10 |
|
1164 |
P1693F I Might Be Wrong
|
0 / 0 |
10 |
|
1163 |
P1694A Creep
|
0 / 0 |
3 |
|
1162 |
P1694B Paranoid String
|
0 / 0 |
4 |
|
1160 |
P1695B Circle Game
|
0 / 0 |
3 |
|
1159 |
P1695C Zero Path
|
0 / 0 |
5 |
|
1158 |
P1695D1 Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
1157 |
P1695D2 Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
1155 |
P1696A NIT orz!
|
0 / 0 |
3 |
|
1154 |
P1696B NIT Destroys the Universe
|
0 / 0 |
3 |
|
1153 |
P1696C Fishingprince Plays With Array
|
0 / 0 |
4 |
|
1152 |
P1696D Permutation Graph
|
0 / 0 |
6 |
|
1148 |
P1696H Maximum Product?
|
0 / 0 |
10 |
|
1147 |
P1697A Parkway Walk
|
0 / 0 |
3 |
|
1146 |
P1697B Promo
|
0 / 0 |
3 |
|
1145 |
P1697C awoo's Favorite Problem
|
0 / 0 |
4 |
|
1143 |
P1697E Coloring
|
0 / 0 |
9 |
|
1140 |
P1698B Rising Sand
|
0 / 0 |
3 |
|
1137 |
P1698E PermutationForces II
|
0 / 0 |
8 |
|
1131 |
P1699D Almost Triple Deletions
|
0 / 0 |
8 |
|
1130 |
P1699E Three Days Grace
|
0 / 0 |
10 |
|
1129 |
P1700A Optimal Path
|
0 / 0 |
3 |
|
1127 |
P1700C Helping the Nature
|
0 / 0 |
5 |
|
1126 |
P1700D River Locks
|
0 / 0 |
6 |
|
1124 |
P1700F Puzzle
|
0 / 0 |
10 |
|
1122 |
P1701B Permutation
|
0 / 0 |
3 |
|
1121 |
P1701C Schedule Management
|
0 / 0 |
4 |
|
1120 |
P1701D Permutation Restoration
|
0 / 0 |
6 |
|
1119 |
P1701E Text Editor
|
0 / 0 |
9 |
|
1116 |
P1702B Polycarp Writes a String from Memory
|
0 / 0 |
3 |
|
1115 |
P1702C Train and Queries
|
0 / 0 |
3 |
|
1114 |
P1702D Not a Cheap String
|
0 / 0 |
3 |
|
1112 |
P1702F Equate Multisets
|
0 / 0 |
5 |
|
1104 |
P1703F Yet Another Problem About Pairs Satisfying an Inequality
|
0 / 0 |
4 |
|
1103 |
P1703G Good Key, Bad Key
|
0 / 0 |
5 |
|
1102 |
P1704A Two 0-1 Sequences
|
0 / 0 |
3 |
|
1101 |
P1704B Luke is a Foodie
|
0 / 0 |
3 |
|
1100 |
P1704C Virus
|
0 / 0 |
4 |
|
1093 |
P1705A Mark the Photographer
|
0 / 0 |
3 |
|
1092 |
P1705B Mark the Dust Sweeper
|
0 / 0 |
3 |
|
1090 |
P1705D Mark and Lightbulbs
|
0 / 0 |
6 |
|
1089 |
P1705E Mark and Professor Koro
|
0 / 0 |
8 |
|
1087 |
P1706A Another String Minimization Problem
|
0 / 0 |
3 |
|
1086 |
P1706B Making Towers
|
0 / 0 |
3 |
|
1085 |
P1706C Qpwoeirut And The City
|
0 / 0 |
4 |
|
1084 |
P1706D1 Chopping Carrots (Easy Version)
|
0 / 0 |
5 |
|
1083 |
P1706D2 Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
1082 |
P1706E Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
1081 |
P1707A Doremy's IQ
|
0 / 0 |
5 |
|
1079 |
P1707C DFS Trees
|
0 / 0 |
9 |
|
1075 |
P1708A Difference Operations
|
0 / 0 |
3 |
|
1073 |
P1709A Three Doors
|
0 / 0 |
3 |
|
1071 |
P1709C Recover an RBS
|
0 / 0 |
6 |
|
1070 |
P1709D Rorororobot
|
0 / 0 |
5 |
|
1069 |
P1709E XOR Tree
|
0 / 0 |
9 |
|
1067 |
P1710A Color the Picture
|
0 / 0 |
5 |
|
1066 |
P1710B Rain
|
0 / 0 |
7 |
|
1065 |
P1710C XOR Triangle
|
0 / 0 |
9 |
|
1060 |
P1712A Wonderful Permutation
|
0 / 0 |
3 |
|
1059 |
P1712B Woeful Permutation
|
0 / 0 |
3 |
|
1058 |
P1712C Sort Zero
|
0 / 0 |
3 |
|
1057 |
P1712D Empty Graph
|
0 / 0 |
7 |