School Team Contest 2 (Winter Computer School 2010/11)

10 problems from School Team Contest 2 (Winter Computer School 2010/11) (contest 44), difficulty 900-2700. 6/10 solutions verified against sample I/O.

10 items

School Team Contest 2 (Winter Computer School 2010/11)

Special | 10 problems | 6/10 verified | Difficulty 900-2700 | 21m 26s

# Problem Rating Tags Accepted Time ✓
A Indian Summer 900 implementation 17,448 1m 23s ✓
B Cola 1500 implementation 2,302 1m 9s ✓
C Holidays 1300 implementation 4,051 1m 24s ✓
D Hyperdrive 1800 math 800 1m 5s ✓
E Anfisa the Monkey 1400 dp 6,111 2m 13s
F BerPaint 2700 geometry, graphs 80 2m 57s
G Shooting Gallery 2500 data-structures, implementation 501 1m 23s ✓
H Phone Number 1700 dp 2,003 3m 41s ✓
I Toys 2300 brute-force, combinatorics 231 1m 48s
J Triminoes 2000 constructive-algorithms, greedy 614 4m 23s
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44A - Indian Summer

Each leaf is described by two strings: the tree species and the leaf color. Alyona only keeps a leaf if she does not already have another leaf with the exact same pair of values. The task is simply to count how many distinct (species, color) combinations appear in the input.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44B - Cola

We are asked to determine how many ways the organizers of a winter school can buy exactly n liters of cola using a limited supply of bottles in three sizes: 0.5-liter, 1-liter, and 2-liter.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44C - Holidays

We are asked to verify a watering schedule for flowers over a set of consecutive holiday days. Each day must be watered exactly once. The schedule specifies, for each of several people, the range of days they are assigned to water the flowers.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44D - Hyperdrive

We are asked to model the spread of hyperdrive news across a galaxy of planets, where ships move along straight lines at uniform speed.
codeforces competitive-programming math May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44E - Anfisa the Monkey

We are given a string of lowercase letters that contains no spaces. The task is to split this string into exactly k consecutive pieces. Every piece must have length between a and b, inclusive. The order of characters cannot change. We are only deciding where to cut the string.
codeforces competitive-programming dp May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44F - BerPaint

We have a rectangular canvas of size W × H. Initially the whole canvas is white. Then several black line segments are drawn on it. After that, a sequence of flood-fill operations is applied. A flood-fill chooses a point and a color.
codeforces competitive-programming geometry graphs May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44G - Shooting Gallery

The problem can be restated as simulating bullets flying along the positive _Z_ axis at given coordinates on a 2D shooting plane (_XOY_). Each bullet may hit one of multiple rectangular targets floating at distinct heights along the _Z_ axis.
codeforces competitive-programming data-structures implementation May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44H - Phone Number

We are given Masha's phone number as a string of digits. From this number, she generates another phone number digit by digit. The first digit of the new number can be any digit from 0 to 9.
codeforces competitive-programming dp May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44I - Toys

We are asked to enumerate all ways to split n toys into piles, starting from a single pile containing all toys. The toys are numbered from 1 to n, and the order within a pile or between piles does not matter for uniqueness beyond the actual grouping.
codeforces competitive-programming brute-force combinatorics May 28, 2026
Practice › Codeforces Solutions › School Team Contest 2 (Winter Computer School 2010/11) ›

CF 44J - Triminoes

We are given a rectangular board where some cells are missing. Every remaining cell is already colored either black or white in a chessboard pattern. The task is to cover all existing cells using straight triminoes of size 1 × 3 or 3 × 1.
codeforces competitive-programming constructive-algorithms greedy May 28, 2026