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

Solutions for School Team Contest 1 (Winter Computer School 2010/11) (contest 39). 9/11 problems verified against sample I/O. Difficulty range: 1100-2600.

11 items

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

Type: Special | Problems: 11 | Verified: 9/11 | Rating range: 1100-2600 | Time: 23m 20s

Problem Name Rating Tags Solve Time Verified
A C*++ Calculations 2000 expression-parsing, greedy 2m 42s ✓
B Company Income Growth 1300 greedy 3m 27s ✓
C Moon Craters 2100 dp, sortings 4m 25s ✗
D Cubical Planet 1100 math 1m 27s ✓
E What Has Dirichlet Got to Do with That? 2000 dp, games 1m 57s ✓
F Pacifist frogs 1300 implementation 1m 38s ✓
G Inverse Function 2400 implementation 2m 2s ✓
H Multiplication Table 1300 implementation 1m 33s ✗
I Tram 2500 - 1m 4s ✓
J Spelling Check 1500 hashing, implementation, strings 1m 34s ✓
K Testing 2600 - 1m 31s ✓
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39A - C*++ Calculations

We are given an arithmetic expression built from terms involving a single variable a. Every term is one of two forms:
codeforces competitive-programming expression-parsing greedy May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39B - Company Income Growth

We are given a sequence of integers representing the yearly income of a company starting from 2001. The first number is the income in 2001, the second in 2002, and so on. These values may be negative if the company incurred a loss that year.
codeforces competitive-programming greedy May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39C - Moon Craters

Each crater is described by a center coordinate c and a radius r. Since the robot moves along a line, every crater can be represented on that line by its interval: $[c-r, c+r]$ Professor Okulov’s rule says that any two selected craters must either be completely disjoint or…
codeforces competitive-programming dp sortings May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39D - Cubical Planet

We are given two vertices of a unit cube. Each vertex is described by three coordinates, and every coordinate is either 0 or 1. Since each coordinate can only take two values, these coordinates represent the eight corners of the cube. Two flies stand on two different vertices.
codeforces competitive-programming math May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39E - What Has Dirichlet Got to Do with That?

We start with a distinct boxes and b distinct items. Since boxes may stay empty and every item independently chooses one of the boxes, the number of possible placements is simply:
codeforces competitive-programming dp games May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39F - Pacifist frogs

Thumbelina wants to cross a swamp by riding a single frog. The swamp contains hills numbered from 1 to n, where hill i is exactly i meters away from the island. A frog with jump length d lands on hills d, 2d, 3d, ...
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39G - Inverse Function

We are given the source code of a tiny recursive function f(n) written in a heavily restricted subset of C++. The function only contains sequential if (...) return ...; statements and unconditional return ...; statements.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39H - Multiplication Table

The task is to generate a multiplication table for numbers in a positional numeral system with a base k. Unlike the decimal system, the digits in this system range from 0 up to k-1. Petya wants to see products of numbers from 1 to k-1 expressed in this system.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39I - Tram

We are given a directed graph where nodes represent crossroads and edges represent one-way tramlines. The engine house is at node 1. Every node has at least one outgoing edge, so the tram is never trapped.
codeforces competitive-programming May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39J - Spelling Check

We are given two lowercase strings. The first string is exactly one character longer than the second. We want to find every position in the first string such that removing the character at that position makes the two strings identical.
codeforces competitive-programming hashing implementation strings May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39K - Testing

We are given an rectangular grid representing a field, and within this field there are non-overlapping rectangles representing objects. Each rectangle occupies contiguous cells marked by '*', and all other cells are '.'.
codeforces competitive-programming May 28, 2026