|
|
1134 |
P1681A
Game with Cards
|
0 / 0 |
3 |
|
|
1128 |
P1682A
Palindromic Indices
|
0 / 0 |
3 |
|
|
1126 |
P1682C
LIS or Reverse LIS?
|
0 / 0 |
4 |
|
|
1124 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
1123 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
1120 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
|
1119 |
P1684D
Traps
|
1 / 1 |
5 |
|
|
1118 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
1112 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
|
1110 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
|
1109 |
P1685C
Bring Balance
|
0 / 0 |
10 |
|
|
1105 |
P1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
10 |
|
|
1102 |
P1685E
The Ultimate LIS Problem
|
0 / 0 |
10 |
|
|
1101 |
P1686A
Everything Everywhere All But One
|
0 / 0 |
3 |
|
|
1099 |
P1686B
Odd Subarrays
|
0 / 0 |
3 |
|
|
1096 |
P1687A
The Enchanted Forest
|
0 / 0 |
5 |
|
|
1095 |
P1687B
Railway System
|
0 / 0 |
5 |
|
|
1092 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
1088 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
|
1082 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
|
1081 |
P1688C
Manipulating History
|
0 / 0 |
5 |
|
|
1078 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
1077 |
P1689B
Mystic Permutation
|
0 / 0 |
3 |
|
|
1068 |
P1690A
Print a Pedestal (Codeforces logo?)
|
0 / 0 |
3 |
|
|
1067 |
P1690B
Array Decrements
|
0 / 0 |
3 |
|
|
1066 |
P1690C
Restoring the Duration of Tasks
|
0 / 0 |
3 |
|
|
1064 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
|
1062 |
P1690G
Count the Trains
|
0 / 0 |
7 |
|
|
1061 |
P1691A
Beat The Odds
|
0 / 0 |
3 |
|
|
1060 |
P1691B
Shoe Shuffling
|
0 / 0 |
3 |
|
|
1059 |
P1691C
Sum of Substrings
|
0 / 0 |
4 |
|
|
1057 |
P1691E
Number of Groups
|
0 / 0 |
8 |
|
|
1054 |
P1692B
All Distinct
|
0 / 0 |
3 |
|
|
1048 |
P1692H
Gambling
|
0 / 0 |
5 |
|
|
1047 |
P1693A
Directional Increase
|
0 / 0 |
4 |
|
|
1046 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
|
1045 |
P1693C
Keshi in Search of AmShZ
|
0 / 0 |
8 |
|
|
1044 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
|
1043 |
P1693E
Outermost Maximums
|
0 / 0 |
10 |
|
|
1042 |
P1693F
I Might Be Wrong
|
0 / 0 |
10 |
|
|
1041 |
P1694A
Creep
|
0 / 0 |
3 |
|
|
1039 |
P1694B
Paranoid String
|
0 / 0 |
4 |
|
|
1035 |
P1695B
Circle Game
|
0 / 0 |
3 |
|
|
1033 |
P1695C
Zero Path
|
0 / 0 |
5 |
|
|
1032 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
|
1030 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
|
1028 |
P1696A
NIT orz!
|
0 / 0 |
3 |
|
|
1027 |
P1696B
NIT Destroys the Universe
|
0 / 0 |
3 |
|
|
1026 |
P1696C
Fishingprince Plays With Array
|
0 / 0 |
4 |
|
|
1023 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
|
1016 |
P1696H
Maximum Product?
|
0 / 0 |
10 |
|
|
1013 |
P1697A
Parkway Walk
|
0 / 0 |
3 |
|
|
1011 |
P1697B
Promo
|
0 / 0 |
3 |
|
|
1010 |
P1697C
awoo's Favorite Problem
|
0 / 0 |
4 |
|
|
1005 |
P1697E
Coloring
|
0 / 0 |
9 |
|
|
999 |
P1698B
Rising Sand
|
0 / 0 |
3 |
|
|
993 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
|
983 |
P1699D
Almost Triple Deletions
|
0 / 0 |
8 |
|
|
982 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
|
981 |
P1700A
Optimal Path
|
0 / 0 |
3 |
|
|
979 |
P1700C
Helping the Nature
|
0 / 0 |
5 |
|
|
978 |
P1700D
River Locks
|
0 / 0 |
6 |
|
|
976 |
P1700F
Puzzle
|
0 / 0 |
10 |
|
|
974 |
P1701B
Permutation
|
0 / 0 |
3 |
|
|
973 |
P1701C
Schedule Management
|
0 / 0 |
4 |
|
|
972 |
P1701D
Permutation Restoration
|
0 / 0 |
6 |
|
|
971 |
P1701E
Text Editor
|
0 / 0 |
9 |
|
|
968 |
P1702B
Polycarp Writes a String from Memory
|
0 / 0 |
3 |
|
|
967 |
P1702C
Train and Queries
|
0 / 0 |
3 |
|
|
966 |
P1702D
Not a Cheap String
|
0 / 0 |
3 |
|
|
964 |
P1702F
Equate Multisets
|
0 / 0 |
5 |
|
|
956 |
P1703F
Yet Another Problem About Pairs Satisfying an Inequality
|
0 / 0 |
4 |
|
|
955 |
P1703G
Good Key, Bad Key
|
0 / 0 |
5 |
|
|
954 |
P1704A
Two 0-1 Sequences
|
0 / 0 |
3 |
|
|
953 |
P1704B
Luke is a Foodie
|
0 / 0 |
3 |
|
|
952 |
P1704C
Virus
|
0 / 0 |
4 |
|
|
945 |
P1705A
Mark the Photographer
|
0 / 0 |
3 |
|
|
944 |
P1705B
Mark the Dust Sweeper
|
0 / 0 |
3 |
|
|
942 |
P1705D
Mark and Lightbulbs
|
0 / 0 |
6 |
|
|
941 |
P1705E
Mark and Professor Koro
|
0 / 0 |
8 |
|
|
939 |
P1706A
Another String Minimization Problem
|
0 / 0 |
3 |
|
|
938 |
P1706B
Making Towers
|
0 / 0 |
3 |
|
|
937 |
P1706C
Qpwoeirut And The City
|
0 / 0 |
4 |
|
|
936 |
P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
5 |
|
|
935 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
|
934 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
933 |
P1707A
Doremy's IQ
|
0 / 0 |
5 |
|
|
931 |
P1707C
DFS Trees
|
0 / 0 |
9 |
|
|
927 |
P1708A
Difference Operations
|
0 / 0 |
3 |
|
|
925 |
P1709A
Three Doors
|
0 / 0 |
3 |
|
|
923 |
P1709C
Recover an RBS
|
0 / 0 |
6 |
|
|
922 |
P1709D
Rorororobot
|
0 / 0 |
5 |
|
|
921 |
P1709E
XOR Tree
|
0 / 0 |
9 |
|
|
919 |
P1710A
Color the Picture
|
0 / 0 |
5 |
|
|
918 |
P1710B
Rain
|
0 / 0 |
7 |
|
|
917 |
P1710C
XOR Triangle
|
0 / 0 |
9 |
|
|
912 |
P1712A
Wonderful Permutation
|
0 / 0 |
3 |
|
|
911 |
P1712B
Woeful Permutation
|
0 / 0 |
3 |
|
|
910 |
P1712C
Sort Zero
|
0 / 0 |
3 |
|
|
909 |
P1712D
Empty Graph
|
0 / 0 |
7 |