|
|
5796 |
CF952C
Ravioli Sort
|
0 / 0 |
(None) |
|
|
5787 |
CF954D
Fight Against Traffic
|
0 / 0 |
(None) |
|
|
5762 |
CF958E1
Guard Duty (easy)
|
0 / 0 |
(None) |
|
|
5728 |
CF962D
Merge Equals
|
0 / 0 |
(None) |
|
|
5680 |
CF979C
Kuro and Walking Route
|
0 / 0 |
(None) |
|
|
5675 |
CF980B
Marlin
|
0 / 0 |
(None) |
|
|
5639 |
CF986A
Fair
|
0 / 0 |
(None) |
|
|
5600 |
CF992B
Nastya Studies Informatics
|
0 / 0 |
(None) |
|
|
5599 |
CF992C
Nastya and a Wardrobe
|
0 / 0 |
(None) |
|
|
5596 |
CF993A
Two Squares
|
0 / 0 |
(None) |
|
|
5552 |
CF1001E
Distinguish Bell states
|
0 / 0 |
(None) |
|
|
5541 |
CF1002B2
Distinguish GHZ state and W state
|
0 / 0 |
(None) |
|
|
5540 |
CF1002B3
Distinguish four 2-qubit states
|
0 / 0 |
(None) |
|
|
5533 |
CF1002D3
Oracle for majority function
|
0 / 0 |
(None) |
|
|
5527 |
CF1003D
Coins and Queries
|
0 / 0 |
(None) |
|
|
5504 |
CF1006E
Military Problem
|
0 / 0 |
(None) |
|
|
5465 |
CF1015D
Walking Between Houses
|
0 / 0 |
(None) |
|
|
5451 |
CF1017C
The Phone Number
|
0 / 0 |
(None) |
|
|
5428 |
CF1025B
Weakened Common Divisor
|
0 / 0 |
(None) |
|
|
5427 |
CF1025C
Plasticine zebra
|
0 / 0 |
(None) |
|
|
5419 |
CF1027C
Minimum Value Rectangle
|
0 / 0 |
(None) |
|
|
5410 |
CF1028C
Rectangles
|
0 / 0 |
(None) |
|
|
5402 |
CF1029C
Maximal Intersection
|
0 / 0 |
(None) |
|
|
5387 |
CF1031C
Cram Time
|
0 / 0 |
(None) |
|
|
5373 |
CF1033C
Permutation Game
|
0 / 0 |
(None) |
|
|
5361 |
CF1036B
Diagonal Walking v.2
|
0 / 0 |
(None) |
|
|
5359 |
CF1036D
Vasya and Arrays
|
0 / 0 |
(None) |
|
|
5329 |
CF1041C
Coffee Break
|
0 / 0 |
(None) |
|
|
5294 |
CF1045I
Palindrome Pairs
|
0 / 0 |
(None) |
|
|
5260 |
CF1056B
Divide Candies
|
0 / 0 |
(None) |
|
|
5258 |
CF1056D
Decorate Apple Tree
|
0 / 0 |
(None) |
|
|
5247 |
CF1059C
Sequence Transformation
|
0 / 0 |
(None) |
|
|
5241 |
CF1060C
Maximum Subrectangle
|
0 / 0 |
(None) |
|
|
5226 |
CF1062C
Banh-mi
|
0 / 0 |
(None) |
|
|
5210 |
CF1065C
Make It Equal
|
0 / 0 |
(None) |
|
|
5152 |
CF1077D
Cutting Out
|
0 / 0 |
(None) |
|
|
5130 |
CF1082B
Vova and Trophies
|
0 / 0 |
(None) |
|
|
5129 |
CF1082C
Multi-Subject Competition
|
0 / 0 |
(None) |
|
|
5111 |
CF1085C
Connect Three
|
0 / 0 |
(None) |
|
|
5041 |
CF1095D
Circular Dance
|
0 / 0 |
(None) |
|
|
5036 |
CF1096C
Polygon for the Angle
|
0 / 0 |
(None) |
|
|
5021 |
CF1098A
Sum in the tree
|
0 / 0 |
(None) |
|
|
4953 |
CF1109A
Sasha and a Bit of Relax
|
0 / 0 |
(None) |
|
|
4922 |
CF1115G2
OR oracle
|
0 / 0 |
(None) |
|
|
4921 |
CF1115G3
Palindrome checker oracle
|
0 / 0 |
(None) |
|
|
4919 |
CF1115U2
Chessboard unitary
|
0 / 0 |
(None) |
|
|
4868 |
CF1121C
System Testing
|
0 / 0 |
(None) |
|
|
4836 |
CF1133F1
Spanning Tree with Maximum Degree
|
0 / 0 |
(None) |
|
|
4828 |
CF1137A
Skyscrapers
|
0 / 0 |
(None) |
|
|
4827 |
CF1137B
Camp Schedule
|
0 / 0 |
(None) |
|
|
4810 |
CF1140C
Playlist
|
0 / 0 |
(None) |
|
|
4755 |
CF1148B
Born This Way
|
0 / 0 |
(None) |
|
|
4737 |
CF1151B
Dima and a Bad XOR
|
0 / 0 |
(None) |
|
|
4735 |
CF1151D
Stas and the Queue at the Buffet
|
0 / 0 |
(None) |
|
|
4672 |
CF1163B2
Cat Party (Hard Edition)
|
0 / 0 |
(None) |
|
|
4662 |
CF1165D
Almost All Divisors
|
0 / 0 |
(None) |
|
|
4661 |
CF1165E
Two Arrays and Sum of Functions
|
0 / 0 |
(None) |
|
|
4607 |
CF1175B
Catch Overflow!
|
0 / 0 |
(None) |
|
|
4606 |
CF1175C
Electrification
|
0 / 0 |
(None) |
|
|
4545 |
CF1184C1
Heidi and the Turing Test (Easy)
|
0 / 0 |
(None) |
|
|
4542 |
CF1184D1
Parallel Universes (Easy)
|
0 / 0 |
(None) |
|
|
4513 |
CF1188A1
Add on a Tree
|
0 / 0 |
(None) |
|
|
4467 |
CF1196D2
RGB Substring (hard version)
|
0 / 0 |
(None) |
|
|
4458 |
CF1198A
MP3
|
0 / 0 |
(None) |
|
|
4456 |
CF1198B
Welfare State
|
0 / 0 |
(None) |
|
|
4426 |
CF1203D1
Remove the Substring (easy version)
|
0 / 0 |
(None) |
|
|
4353 |
CF1213D2
Equalizing by Division (hard version)
|
0 / 0 |
(None) |
|
|
4325 |
CF1217B
Zmei Gorynich
|
0 / 0 |
(None) |
|
|
4288 |
CF1223C
Save the Nature
|
0 / 0 |
(None) |
|
|
4280 |
CF1225C
p-binary
|
0 / 0 |
(None) |
|
|
4271 |
CF1227D1
Optimal Subsequences (Easy Version)
|
0 / 0 |
(None) |
|
|
4249 |
CF1234D
Distinct Characters Queries
|
0 / 0 |
(None) |
|
|
4227 |
CF1238C
Standard Free2play
|
0 / 0 |
(None) |
|
|
4206 |
CF1243B2
Character Swap (Hard Version)
|
0 / 0 |
(None) |
|
|
4158 |
CF1251C
Minimize The Integer
|
0 / 0 |
(None) |
|
|
4150 |
CF1252C
Even Path
|
0 / 0 |
(None) |
|
|
4123 |
CF1255C
League of Leesins
|
0 / 0 |
(None) |
|
|
3998 |
CF1281B
Azamon Web Services
|
0 / 0 |
(None) |
|
|
3995 |
CF1282B2
K for the Price of One (Hard Version)
|
0 / 0 |
(None) |
|
|
3982 |
CF1284C
New Year and Permutation
|
0 / 0 |
(None) |
|
|
3956 |
CF1288C
Two Arrays
|
0 / 0 |
(None) |
|
|
3952 |
CF1290A
Mind Control
|
0 / 0 |
(None) |
|
|
3930 |
CF1294D
MEX maximizing
|
0 / 0 |
(None) |
|
|
3925 |
CF1295C
Obtain The String
|
0 / 0 |
(None) |
|
|
3875 |
CF1303C
Perfect Keyboard
|
0 / 0 |
(None) |
|
|
3860 |
CF1305C
Kuroni and Impossible Calculation
|
0 / 0 |
(None) |
|
|
3799 |
CF1321C
Remove Adjacent
|
0 / 0 |
(None) |
|
|
3764 |
CF1327C
Game with Chips
|
0 / 0 |
(None) |
|
|
3718 |
CF1334C
Circle of Monsters
|
0 / 0 |
(None) |
|
|
3705 |
CF1336A
Linova and Kingdom
|
0 / 0 |
(None) |
|
|
3676 |
CF1342C
Yet Another Counting Problem
|
0 / 0 |
(None) |
|
|
3665 |
CF1344A
Hilbert's Hotel
|
0 / 0 |
(None) |
|
|
3654 |
CF1346C
Spring Cleaning
|
0 / 0 |
(None) |
|
|
3653 |
CF1346D
Constructing the Dungeon
|
0 / 0 |
(None) |
|
|
3644 |
CF1348C
Phoenix and Distribution
|
0 / 0 |
(None) |
|
|
3640 |
CF1349A
Orac and LCM
|
0 / 0 |
(None) |
|
|
3618 |
CF1352G
Special Permutation
|
0 / 0 |
(None) |
|
|
3614 |
CF1353D
Constructing the Array
|
0 / 0 |
(None) |
|
|
3562 |
CF1358C
Celex Update
|
0 / 0 |
(None) |
|
|
3530 |
CF1363C
Game On Leaves
|
0 / 0 |
(None) |
