|
|
4695 |
CF1157A
Reachable Numbers
|
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) |
|
|
4687 |
CF1157G
Inverse of Rows and Columns
|
0 / 0 |
(None) |
|
|
4686 |
CF1158A
The Party and Sweets
|
0 / 0 |
(None) |
|
|
4685 |
CF1158B
The minimal unique substring
|
0 / 0 |
(None) |
|
|
4684 |
CF1158C
Permutation recovery
|
0 / 0 |
(None) |
|
|
4683 |
CF1158D
Winding polygonal line
|
0 / 0 |
(None) |
|
|
4682 |
CF1158E
Strange device
|
0 / 0 |
(None) |
|
|
4681 |
CF1158F
Density of subarrays
|
0 / 0 |
(None) |
|
|
4680 |
CF1159A
A pile of stones
|
0 / 0 |
(None) |
|
|
4678 |
CF1159B
Expansion coefficient of the array
|
0 / 0 |
(None) |
|
|
4677 |
CF1160A2
Collaboration
|
0 / 0 |
(None) |
|
|
4676 |
CF1162A
Zoning Restrictions Again
|
0 / 0 |
(None) |
|
|
4675 |
CF1162B
Double Matrix
|
0 / 0 |
(None) |
|
|
4674 |
CF1163A
Eating Soup
|
0 / 0 |
(None) |
|
|
4673 |
CF1163B1
Cat Party (Easy Edition)
|
0 / 0 |
(None) |
|
|
4672 |
CF1163B2
Cat Party (Hard Edition)
|
0 / 0 |
(None) |
|
|
4671 |
CF1163C1
Power Transmission (Easy Edition)
|
0 / 0 |
(None) |
|
|
4670 |
CF1163C2
Power Transmission (Hard Edition)
|
0 / 0 |
(None) |
|
|
4669 |
CF1163D
Mysterious Code
|
0 / 0 |
(None) |
|
|
4667 |
CF1163E
Magical Permutation
|
0 / 0 |
(None) |
|
|
4666 |
CF1163F
Indecisive Taxi Fee
|
0 / 0 |
(None) |
|
|
4665 |
CF1165A
Remainder
|
0 / 0 |
(None) |
|
|
4664 |
CF1165B
Polycarp Training
|
0 / 0 |
(None) |
|
|
4663 |
CF1165C
Good String
|
0 / 0 |
(None) |
|
|
4662 |
CF1165D
Almost All Divisors
|
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) |
|
|
4658 |
CF1166A
Silent Classroom
|
0 / 0 |
(None) |
|
|
4656 |
CF1166B
All the Vowels Please
|
0 / 0 |
(None) |
|
|
4655 |
CF1166C
A Tale of Two Lands
|
0 / 0 |
(None) |
|
|
4654 |
CF1166D
Cute Sequences
|
0 / 0 |
(None) |
|
|
4653 |
CF1166E
The LCMs Must be Large
|
0 / 0 |
(None) |
|
|
4652 |
CF1166F
Vicky's Delivery Service
|
0 / 0 |
(None) |
|
|
4651 |
CF1167A
Telephone Number
|
0 / 0 |
(None) |
|
|
4650 |
CF1167B
Lost Numbers
|
0 / 0 |
(None) |
|
|
4649 |
CF1167C
News Distribution
|
0 / 0 |
(None) |
|
|
4648 |
CF1167D
Bicolored RBS
|
0 / 0 |
(None) |
|
|
4647 |
CF1167E
Range Deleting
|
0 / 0 |
(None) |
|
|
4645 |
CF1167F
Scalar Queries
|
0 / 0 |
(None) |
|
|
4644 |
CF1167G
Low Budget Inception
|
0 / 0 |
(None) |
|
|
4643 |
CF1168A
Increasing by Modulo
|
0 / 0 |
(None) |
|
|
4642 |
CF1168B
Good Triple
|
0 / 0 |
(None) |
|
|
4641 |
CF1168C
And Reachability
|
0 / 0 |
(None) |
|
|
4640 |
CF1168D
Anagram Paths
|
0 / 0 |
(None) |
|
|
4639 |
CF1168E
Xor Permutations
|
0 / 0 |
(None) |
|
|
4638 |
CF1169A
Circle Metro
|
0 / 0 |
(None) |
|
|
4637 |
CF1169B
Pairs
|
0 / 0 |
(None) |
|
|
4636 |
CF1170A
Three Integers Again
|
0 / 0 |
(None) |
|
|
4633 |
CF1170B
Bad Days
|
0 / 0 |
(None) |
|
|
4632 |
CF1170C
Minus and Minus Give Plus
|
0 / 0 |
(None) |
|
|
4631 |
CF1170D
Decoding of Integer Sequences
|
0 / 0 |
(None) |
|
|
4630 |
CF1170E
Sliding Doors
|
0 / 0 |
(None) |
|
|
4629 |
CF1170F
Wheels
|
0 / 0 |
(None) |
|
|
4628 |
CF1170G
Graph Decomposition
|
0 / 0 |
(None) |
|
|
4627 |
CF1170H
Longest Saw
|
0 / 0 |
(None) |
|
|
4626 |
CF1170I
Good Subsets
|
0 / 0 |
(None) |
|
|
4625 |
CF1172A
Nauuo and Cards
|
0 / 0 |
(None) |
|
|
4624 |
CF1172B
Nauuo and Circle
|
0 / 0 |
(None) |
|
|
4622 |
CF1172C1
Nauuo and Pictures (easy version)
|
0 / 0 |
(None) |
|
|
4621 |
CF1172C2
Nauuo and Pictures (hard version)
|
0 / 0 |
(None) |
|
|
4620 |
CF1172D
Nauuo and Portals
|
0 / 0 |
(None) |
|
|
4619 |
CF1172E
Nauuo and ODT
|
0 / 0 |
(None) |
|
|
4618 |
CF1172F
Nauuo and Bug
|
0 / 0 |
(None) |
|
|
4617 |
CF1173A
Nauuo and Votes
|
0 / 0 |
(None) |
|
|
4616 |
CF1173B
Nauuo and Chess
|
0 / 0 |
(None) |
|
|
4615 |
CF1174A
Ehab Fails to Be Thanos
|
0 / 0 |
(None) |
|
|
4614 |
CF1174B
Ehab Is an Odd Person
|
0 / 0 |
(None) |
|
|
4613 |
CF1174C
Ehab and a Special Coloring Problem
|
0 / 0 |
(None) |
|
|
4611 |
CF1174D
Ehab and the Expected XOR Problem
|
0 / 0 |
(None) |
|
|
4610 |
CF1174E
Ehab and the Expected GCD Problem
|
0 / 0 |
(None) |
|
|
4609 |
CF1174F
Ehab and the Big Finale
|
0 / 0 |
(None) |
|
|
4608 |
CF1175A
From Hero to Zero
|
0 / 0 |
(None) |
|
|
4607 |
CF1175B
Catch Overflow!
|
0 / 0 |
(None) |
|
|
4606 |
CF1175C
Electrification
|
0 / 0 |
(None) |
|
|
4605 |
CF1175D
Array Splitting
|
0 / 0 |
(None) |
|
|
4604 |
CF1175E
Minimal Segment Cover
|
0 / 0 |
(None) |
|
|
4603 |
CF1175F
The Number of Subpermutations
|
0 / 0 |
(None) |
|
|
4602 |
CF1175G
Yet Another Partiton Problem
|
0 / 0 |
(None) |
|
|
4600 |
CF1176A
Divide it!
|
0 / 0 |
(None) |
|
|
4599 |
CF1176B
Merge it!
|
0 / 0 |
(None) |
|
|
4598 |
CF1176C
Lose it!
|
0 / 0 |
(None) |
|
|
4597 |
CF1176D
Recover it!
|
0 / 0 |
(None) |
|
|
4596 |
CF1176E
Cover it!
|
0 / 0 |
(None) |
|
|
4595 |
CF1176F
Destroy it!
|
0 / 0 |
(None) |
|
|
4594 |
CF1177A
Digits Sequence (Easy Edition)
|
0 / 0 |
(None) |
|
|
4593 |
CF1177B
Digits Sequence (Hard Edition)
|
0 / 0 |
(None) |
|
|
4592 |
CF1178A
Prime Minister
|
0 / 0 |
(None) |
|
|
4591 |
CF1178B
WOW Factor
|
0 / 0 |
(None) |
|
|
4589 |
CF1178C
Tiles
|
0 / 0 |
(None) |
|
|
4588 |
CF1178D
Prime Graph
|
0 / 0 |
(None) |
|
|
4587 |
CF1178E
Archaeology
|
0 / 0 |
(None) |
|
|
4586 |
CF1178F1
Short Colorful Strip
|
0 / 0 |
(None) |
|
|
4585 |
CF1178F2
Long Colorful Strip
|
0 / 0 |
(None) |
