| CF10234D |
D. Denouncing Mafia |
Codeforces |
— |
1000ms / 256MB |
| CF10234E |
E. Exhibition of Clownfish |
Codeforces |
— |
1000ms / 256MB |
| CF10234F |
F. Forests in Danger |
Codeforces |
— |
3000ms / 256MB |
| CF10234G |
G. Getting Confidence |
Codeforces |
— |
1000ms / 256MB |
| CF10234H |
H. Hour for a Run |
Codeforces |
— |
1000ms / 256MB |
| CF10234I |
I. Interplanetary |
Codeforces |
— |
1000ms / 1024MB |
| CF10234J |
J. Jar of Water Game |
Codeforces |
— |
1000ms / 256MB |
| CF10234K |
K. Keep Calm and Sell Balloons |
Codeforces |
— |
1000ms / 256MB |
| CF10234L |
L. Less Coin Tosses |
Codeforces |
— |
1000ms / 256MB |
| CF10234M |
M. Maratona Brasileira de Popcorn |
Codeforces |
— |
1000ms / 256MB |
| CF10235A |
A. Square Root Partitioning |
Codeforces |
— |
3000ms / 256MB |
| CF10235B |
B. Yet Another Convolution |
Codeforces |
— |
6000ms / 256MB |
| CF10235C |
C. Money Sharing |
Codeforces |
— |
1000ms / 256MB |
| CF10235D |
D. Magic Strings |
Codeforces |
— |
4000ms / 256MB |
| CF10235E |
E. Decimal Expansion |
Codeforces |
— |
1000ms / 256MB |
| CF10235F |
F. Cosmic Crossroads |
Codeforces |
— |
4000ms / 256MB |
| CF10235H |
H. Defying Gravity |
Codeforces |
— |
2000ms / 256MB |
| CF10235I |
I. From Modular to Rational |
Codeforces |
— |
6000ms / 256MB |
| CF10235J |
J. Tree Automorphisms |
Codeforces |
— |
1000ms / 256MB |
| CF10236A |
A. Abnormal Words |
Codeforces |
— |
1000ms / 256MB |
| CF10236B |
B. Balanced Fighters |
Codeforces |
— |
1000ms / 1024MB |
| CF10236C |
C. Unjob Search |
Codeforces |
— |
1000ms / 1024MB |
| CF10236D |
D. Astrodirections |
Codeforces |
— |
1000ms / 1024MB |
| CF10236E |
E. Exciting Acts |
Codeforces |
— |
1000ms / 1024MB |
| CF10236F |
F. Fair Distribution |
Codeforces |
— |
1000ms / 1024MB |
| CF10236G |
G. Infinity Plus One |
Codeforces |
— |
1000ms / 1024MB |
| CF10236H |
H. Ancient Wisdom |
Codeforces |
— |
1000ms / 1024MB |
| CF10238A |
A. Strange Base |
Codeforces |
— |
1000ms / 256MB |
| CF10238B |
B. Stars |
Codeforces |
— |
1000ms / 256MB |
| CF10238C |
C. Snooker |
Codeforces |
— |
1000ms / 256MB |
| CF10238D |
D. Secret Messages |
Codeforces |
— |
1000ms / 256MB |
| CF10238E |
E. Stables |
Codeforces |
— |
3000ms / 256MB |
| CF10238F |
F. Shopping |
Codeforces |
— |
1000ms / 256MB |
| CF10238G |
G. Snails |
Codeforces |
— |
1000ms / 256MB |
| CF10239A |
A. Max or Min |
Codeforces |
— |
1000ms / 256MB |
| CF10239B |
B. Level Up |
Codeforces |
— |
2000ms / 256MB |
| CF10239C |
C. Find the Array |
Codeforces |
— |
2000ms / 256MB |
| CF10239D |
D. Cycle String? |
Codeforces |
— |
1000ms / 256MB |
| CF10239E |
E. Life Transfer |
Codeforces |
— |
1000ms / 256MB |
| CF10239F |
F. Game on a Tree |
Codeforces |
— |
1000ms / 256MB |
| CF10239G |
G. Projection |
Codeforces |
— |
1000ms / 512MB |
| CF10239H |
H. Tree Permutations |
Codeforces |
— |
1000ms / 256MB |
| CF10239I |
I. Absolute Game |
Codeforces |
— |
1000ms / 256MB |
| CF10239J |
J. Graph and Cycles |
Codeforces |
— |
2000ms / 256MB |
| CF10239K |
K. Keeping Rabbits |
Codeforces |
— |
1000ms / 512MB |
| CF10239L |
L. LRU Algorithm |
Codeforces |
— |
1000ms / 512MB |
| CF1023A |
A. Single Wildcard Pattern Matching |
Codeforces |
— |
1000ms / 256MB |
| CF1023B |
B. Pair of Toys |
Codeforces |
— |
1000ms / 256MB |
| CF1023C |
C. Bracket Subsequence |
Codeforces |
— |
2000ms / 256MB |
| CF1023D |
D. Array Restoration |
Codeforces |
— |
1000ms / 256MB |