|
|
2025 |
codeforces#P1155E Guess the Root
|
0 / 0 |
8 |
|
|
2024 |
codeforces#P1155F Delivery Oligopoly
|
0 / 0 |
10 |
|
|
2023 |
codeforces#P1156A Inscribed Figures
|
0 / 0 |
4 |
|
|
2022 |
codeforces#P1156B Ugly Pairs
|
0 / 0 |
6 |
|
|
2021 |
codeforces#P1156C Match Points
|
0 / 0 |
7 |
|
|
2020 |
codeforces#P1156D 0-1-Tree
|
0 / 0 |
8 |
|
|
2018 |
codeforces#P1156E Special Segments of Permutation
|
0 / 0 |
8 |
|
|
2019 |
codeforces#P1156F Card Bag
|
0 / 0 |
8 |
|
|
2017 |
codeforces#P1156G Optimizer
|
0 / 0 |
10 |
|
|
2016 |
codeforces#P1157A Reachable Numbers
|
0 / 0 |
3 |
|
|
2015 |
codeforces#P1157B Long Number
|
0 / 0 |
4 |
|
|
2014 |
codeforces#P1157C1 Increasing Subsequence (easy version)
|
0 / 0 |
4 |
|
|
2013 |
codeforces#P1157C2 Increasing Subsequence (hard version)
|
0 / 0 |
5 |
|
|
2012 |
codeforces#P1157D N Problems During K Days
|
0 / 0 |
6 |
|
|
2011 |
codeforces#P1157E Minimum Array
|
1 / 5 |
5 |
|
|
2010 |
codeforces#P1157F Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
2009 |
codeforces#P1157G Inverse of Rows and Columns
|
1 / 1 |
8 |
|
|
2008 |
codeforces#P1158A The Party and Sweets
|
0 / 0 |
5 |
|
|
2007 |
codeforces#P1158B The minimal unique substring
|
0 / 0 |
8 |
|
|
2006 |
codeforces#P1158C Permutation recovery
|
0 / 1 |
7 |
|
|
2005 |
codeforces#P1158D Winding polygonal line
|
1 / 1 |
10 |
|
|
2003 |
codeforces#P1158E Strange device
|
0 / 0 |
10 |
|
|
2004 |
codeforces#P1158F Density of subarrays
|
0 / 0 |
10 |
|
|
2002 |
codeforces#P1159A A pile of stones
|
1 / 3 |
3 |
|
|
2001 |
codeforces#P1159B Expansion coefficient of the array
|
0 / 0 |
4 |
|
|
2000 |
codeforces#P1160A2 Collaboration
|
0 / 0 |
(无) |
|
|
1999 |
codeforces#P1162A Zoning Restrictions Again
|
1 / 1 |
3 |
|
|
1998 |
codeforces#P1162B Double Matrix
|
0 / 0 |
4 |
|
|
1997 |
codeforces#P1163A Eating Soup
|
0 / 0 |
3 |
|
|
1996 |
codeforces#P1163B1 Cat Party (Easy Edition)
|
1 / 2 |
5 |
|
|
1995 |
codeforces#P1163B2 Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
|
1994 |
codeforces#P1163C1 Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
1993 |
codeforces#P1163C2 Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
|
1992 |
codeforces#P1163D Mysterious Code
|
0 / 0 |
7 |
|
|
1991 |
codeforces#P1163E Magical Permutation
|
0 / 0 |
9 |
|
|
1990 |
codeforces#P1163F Indecisive Taxi Fee
|
1 / 2 |
10 |
|
|
1989 |
codeforces#P1165A Remainder
|
0 / 0 |
3 |
|
|
1988 |
codeforces#P1165B Polycarp Training
|
0 / 1 |
3 |
|
|
1987 |
codeforces#P1165C Good String
|
0 / 0 |
4 |
|
|
1986 |
codeforces#P1165D Almost All Divisors
|
0 / 0 |
5 |
|
|
1985 |
codeforces#P1165E Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
1984 |
codeforces#P1165F1 Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
1983 |
codeforces#P1165F2 Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
1982 |
codeforces#P1166A Silent Classroom
|
0 / 0 |
3 |
|
|
1981 |
codeforces#P1166B All the Vowels Please
|
0 / 0 |
3 |
|
|
1980 |
codeforces#P1166C A Tale of Two Lands
|
0 / 0 |
5 |
|
|
1979 |
codeforces#P1166D Cute Sequences
|
0 / 0 |
8 |
|
|
1978 |
codeforces#P1166E The LCMs Must be Large
|
1 / 1 |
7 |
|
|
1977 |
codeforces#P1166F Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
1976 |
codeforces#P1167A Telephone Number
|
1 / 1 |
3 |
