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

Solutions for School Team Contest 3 (Winter Computer School 2010/11) (contest 45). 7/10 problems verified against sample I/O. Difficulty range: 900-2500.

10 items

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

Type: Special | Problems: 10 | Verified: 7/10 | Rating range: 900-2500 | Time: 19m 28s

Problem Name Rating Tags Solve Time Verified
A Codecraft III 900 implementation 1m 14s ✓
B School 2200 dp, dsu 2m 6s ✓
C Dancing Lessons 1900 data-structures 1m 24s ✓
D Event Dates 1900 greedy, meet-in-the-middle, sortings 1m 35s ✓
E Director 2000 constructive-algorithms, greedy 1m 49s ✓
F Goats and Wolves 2500 greedy 2m 25s ✓
G Prime Problem 2200 number-theory 2m 16s ✗
H Road Problem 2100 graphs 1m 58s ✓
I TCMCF+++ 1400 greedy 2m 18s ✗
J Planting Trees 1800 constructive-algorithms 2m 23s ✗
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45A - Codecraft III

We are given the current month as a string and an integer k representing how many months later a new game release will happen. The task is to determine the month after advancing exactly k months forward in the calendar.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45B - School

Each student points to exactly one other student, the person they call whenever they hear news. This creates a directed functional graph, every node has out-degree exactly one.
codeforces competitive-programming dp dsu May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45C - Dancing Lessons

We are given a line of people, each identified as a boy or a girl, and each with a numeric dancing skill. The line evolves over time as couples consisting of one boy and one girl who are adjacent and have the smallest difference in skill leave to dance.
codeforces competitive-programming data-structures May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45D - Event Dates

Each event has a range of possible days when it could have happened. For the -th event, any integer day between and is acceptable. We must assign exactly one day to every event, and no two events may share the same day.
codeforces competitive-programming greedy meet-in-the-middle sortings May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45E - Director

We have two independent lists, one containing names and one containing surnames. Every name must be paired with exactly one surname, and every surname must be used exactly once. After choosing the matching, we print all pairs in one comma-separated line.
codeforces competitive-programming constructive-algorithms greedy May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45F - Goats and Wolves

We have the classical river crossing setting, but with a precise safety rule that changes how transitions work.
codeforces competitive-programming greedy May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45G - Prime Problem

We have houses numbered from 1 to n. Every house must receive a color. For each color, if we add together all house indices painted with that color, the result must be a prime number.
codeforces competitive-programming number-theory May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45H - Road Problem

We are given a connected undirected graph representing a road network. Every junction is a vertex, every road is an edge, and there is at most one edge between any pair of vertices.
codeforces competitive-programming graphs May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45I - TCMCF+++

We are given a list of integers representing problem scores in a contest. A contestant may solve any non-empty subset of these problems, and the final score becomes the product of all chosen values.
codeforces competitive-programming greedy May 28, 2026
Practice › Codeforces Solutions › School Team Contest 3 (Winter Computer School 2010/11) ›

CF 45J - Planting Trees

We need to place the integers from 1 to n * m into an n × m grid so that every pair of side-adjacent cells differs by at least 2. Two cells are adjacent only if they share an edge, diagonal neighbors do not matter.
codeforces competitive-programming constructive-algorithms May 28, 2026