|
|
5042 |
CF1095C
Powers Of Two
|
0 / 0 |
(None) |
|
|
5039 |
CF1095F
Make It Connected
|
0 / 0 |
(None) |
|
|
5038 |
CF1096A
Find Divisible
|
0 / 0 |
(None) |
|
|
5028 |
CF1097C
Yuhao and a Parenthesis
|
0 / 0 |
(None) |
|
|
5026 |
CF1097E
Egor and an RPG game
|
0 / 0 |
(None) |
|
|
5021 |
CF1098A
Sum in the tree
|
0 / 0 |
(None) |
|
|
5020 |
CF1098B
Nice table
|
0 / 0 |
(None) |
|
|
5019 |
CF1098C
Construct a tree
|
0 / 0 |
(None) |
|
|
5005 |
CF1100F
Ivan and Burgers
|
0 / 0 |
(None) |
|
|
5003 |
CF1101B
Accordion
|
0 / 0 |
(None) |
|
|
4995 |
CF1102B
Array K-Coloring
|
0 / 0 |
(None) |
|
|
4993 |
CF1102D
Balanced Ternary String
|
0 / 0 |
(None) |
|
|
4974 |
CF1106C
Lunar New Year and Number Division
|
0 / 0 |
(None) |
|
|
4973 |
CF1106D
Lunar New Year and a Wander
|
0 / 0 |
(None) |
|
|
4970 |
CF1107A
Digits Sequence Dividing
|
0 / 0 |
(None) |
|
|
4966 |
CF1107C
Brutality
|
0 / 0 |
(None) |
|
|
4960 |
CF1108B
Divisors of Two Integers
|
0 / 0 |
(None) |
|
|
4959 |
CF1108C
Nice Garland
|
0 / 0 |
(None) |
|
|
4958 |
CF1108D
Diverse Garland
|
0 / 0 |
(None) |
|
|
4956 |
CF1108E1
Array and Segments (Easy version)
|
0 / 0 |
(None) |
|
|
4954 |
CF1108F
MST Unification
|
0 / 0 |
(None) |
|
|
4945 |
CF1110B
Tape
|
0 / 0 |
(None) |
|
|
4932 |
CF1113A
Sasha and His Trip
|
0 / 0 |
(None) |
|
|
4931 |
CF1113B
Sasha and Magnetic Machines
|
0 / 0 |
(None) |
|
|
4930 |
CF1114A
Got Any Grapes?
|
0 / 0 |
(None) |
|
|
4929 |
CF1114B
Yet Another Array Partitioning Task
|
0 / 0 |
(None) |
|
|
4901 |
CF1117B
Emotes
|
0 / 0 |
(None) |
|
|
4892 |
CF1118D1
Coffee and Coursework (Easy version)
|
0 / 0 |
(None) |
|
|
4890 |
CF1118D2
Coffee and Coursework (Hard Version)
|
0 / 0 |
(None) |
|
|
4886 |
CF1119A
Ilya and a Colorful Walk
|
0 / 0 |
(None) |
|
|
4885 |
CF1119B
Alyona and a Narrow Fridge
|
0 / 0 |
(None) |
|
|
4884 |
CF1119C
Ramesses and Corner Inversion
|
0 / 0 |
(None) |
|
|
4882 |
CF1119E
Pavel and Triangles
|
0 / 0 |
(None) |
|
|
4877 |
CF1120A
Diana and Liana
|
0 / 0 |
(None) |
|
|
4876 |
CF1120B
Once in a casino
|
0 / 0 |
(None) |
|
|
4874 |
CF1120D
Power Tree
|
0 / 0 |
(None) |
|
|
4872 |
CF1120F
Secret Letters
|
0 / 0 |
(None) |
|
|
4867 |
CF1129A1
Toy Train (Simplified)
|
0 / 0 |
(None) |
|
|
4866 |
CF1129A2
Toy Train
|
0 / 0 |
(None) |
|
|
4860 |
CF1130B
Two Cakes
|
0 / 0 |
(None) |
|
|
4855 |
CF1131B
Draw!
|
0 / 0 |
(None) |
|
|
4854 |
CF1131C
Birthday
|
0 / 0 |
(None) |
|
|
4853 |
CF1131D
Gourmet choice
|
0 / 0 |
(None) |
|
|
4852 |
CF1131E
String Multiplication
|
0 / 0 |
(None) |
|
|
4849 |
CF1132A
Regular Bracket Sequence
|
0 / 0 |
(None) |
|
|
4848 |
CF1132B
Discounts
|
0 / 0 |
(None) |
|
|
4845 |
CF1132D
Stressful Training
|
0 / 0 |
(None) |
|
|
4844 |
CF1132E
Knapsack
|
0 / 0 |
(None) |
|
|
4834 |
CF1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
(None) |
|
|
4830 |
CF1136D
Nastya Is Buying Lunch
|
0 / 0 |
(None) |
|
|
4827 |
CF1137B
Camp Schedule
|
0 / 0 |
(None) |
|
|
4823 |
CF1137E
Train Car Selection
|
0 / 0 |
(None) |
|
|
4821 |
CF1138A
Sushi for Two
|
0 / 0 |
(None) |
|
|
4820 |
CF1138B
Circus
|
0 / 0 |
(None) |
|
|
4818 |
CF1139B
Chocolates
|
0 / 0 |
(None) |
|
|
4809 |
CF1140D
Minimum Triangulation
|
0 / 0 |
(None) |
|
|
4801 |
CF1141D
Colored Boots
|
0 / 0 |
(None) |
|
|
4799 |
CF1141F1
Same Sum Blocks (Easy)
|
0 / 0 |
(None) |
|
|
4798 |
CF1141F2
Same Sum Blocks (Hard)
|
0 / 0 |
(None) |
|
|
4797 |
CF1141G
Privatization of Roads in Treeland
|
0 / 0 |
(None) |
|
|
4786 |
CF1144B
Parity Alternated Deletions
|
0 / 0 |
(None) |
|
|
4784 |
CF1144D
Equalize Them All
|
0 / 0 |
(None) |
|
|
4781 |
CF1144G
Two Merged Sequences
|
0 / 0 |
(None) |
|
|
4756 |
CF1148A
Another One Bites The Dust
|
0 / 0 |
(None) |
|
|
4753 |
CF1148D
Dirty Deeds Done Dirt Cheap
|
0 / 0 |
(None) |
|
|
4752 |
CF1148E
Earth Wind and Fire
|
0 / 0 |
(None) |
|
|
4748 |
CF1149A
Prefix Sum Primes
|
0 / 0 |
(None) |
|
|
4742 |
CF1149D
Abandoning Roads
|
0 / 0 |
(None) |
|
|
4740 |
CF1150A
Stock Arbitraging
|
0 / 0 |
(None) |
|
|
4739 |
CF1150B
Tiling Challenge
|
0 / 0 |
(None) |
|
|
4735 |
CF1151D
Stas and the Queue at the Buffet
|
0 / 0 |
(None) |
|
|
4731 |
CF1152A
Neko Finds Grapes
|
0 / 0 |
(None) |
|
|
4728 |
CF1152D
Neko and Aki's Prank
|
0 / 0 |
(None) |
|
|
4722 |
CF1153B
Serval and Toy Bricks
|
0 / 0 |
(None) |
|
|
4721 |
CF1153C
Serval and Parenthesis Sequence
|
0 / 0 |
(None) |
|
|
4720 |
CF1153D
Serval and Rooted Tree
|
0 / 0 |
(None) |
|
|
4714 |
CF1154D
Walking Robot
|
0 / 0 |
(None) |
|
|
4711 |
CF1154F
Shovels Shop
|
0 / 0 |
(None) |
|
|
4710 |
CF1154G
Minimum Possible LCM
|
0 / 0 |
(None) |
|
|
4708 |
CF1155B
Game with Telephone Numbers
|
0 / 0 |
(None) |
|
|
4706 |
CF1155D
Beautiful Array
|
0 / 0 |
(None) |
|
|
4702 |
CF1156B
Ugly Pairs
|
0 / 0 |
(None) |
|
|
4700 |
CF1156C
Match Points
|
0 / 0 |
(None) |
|
|
4696 |
CF1156G
Optimizer
|
0 / 0 |
(None) |
|
|
4694 |
CF1157B
Long Number
|
0 / 0 |
(None) |
|
|
4693 |
CF1157C1
Increasing Subsequence (easy version)
|
0 / 0 |
(None) |
|
|
4692 |
CF1157C2
Increasing Subsequence (hard version)
|
0 / 0 |
(None) |
|
|
4691 |
CF1157D
N Problems During K Days
|
0 / 0 |
(None) |
|
|
4689 |
CF1157E
Minimum Array
|
0 / 0 |
(None) |
|
|
4688 |
CF1157F
Maximum Balanced Circle
|
0 / 0 |
(None) |
|
|
4686 |
CF1158A
The Party and Sweets
|
0 / 0 |
(None) |
|
|
4684 |
CF1158C
Permutation recovery
|
0 / 0 |
(None) |
|
|
4683 |
CF1158D
Winding polygonal line
|
0 / 0 |
(None) |
|
|
4675 |
CF1162B
Double Matrix
|
0 / 0 |
(None) |
|
|
4674 |
CF1163A
Eating Soup
|
0 / 0 |
(None) |
|
|
4664 |
CF1165B
Polycarp Training
|
0 / 0 |
(None) |
|
|
4663 |
CF1165C
Good String
|
0 / 0 |
(None) |
|
|
4661 |
CF1165E
Two Arrays and Sum of Functions
|
0 / 0 |
(None) |
|
|
4660 |
CF1165F1
Microtransactions (easy version)
|
0 / 0 |
(None) |
|
|
4659 |
CF1165F2
Microtransactions (hard version)
|
0 / 0 |
(None) |
