TheForces Round #12 (Double-Forces)

4 problems from TheForces Round #12 (Double-Forces) (contest 104329), difficulty -. 0/4 solutions verified against sample I/O.

4 items

TheForces Round #12 (Double-Forces)

Special | 4 problems | 0/4 verified | Difficulty - | 6m 35s

#	Problem	Time
A	A Matchsticks Problem	1m 34s
B	Yet Another Matchsticks Problem	1m 32s
D	Y Flip	1m 54s
E	Yet Another Y Flip	1m 35s

Practice › Codeforces Solutions › TheForces Round #12 (Double-Forces) ›

CF 104329E - Yet Another Y Flip

We are given a rooted tree where node 1 is fixed as the root, and each node stores a binary value, either 0 or 1. We are allowed to perform a special operation any number of times.

Practice › Codeforces Solutions › TheForces Round #12 (Double-Forces) ›

CF 104329D - Y Flip

We are given two binary grids of the same size. The goal is to determine whether one grid can be transformed into the other using an unlimited number of specific toggle operations.

Practice › Codeforces Solutions › TheForces Round #12 (Double-Forces) ›

CF 104329A - A Matchsticks Problem

We are given a fixed number of matchsticks and a standard digit display where each digit is formed using a specific number of matchsticks, like a seven-segment display.

Practice › Codeforces Solutions › TheForces Round #12 (Double-Forces) ›

CF 104329B - Yet Another Matchsticks Problem

We are given a supply of identical matchsticks and we want to assemble them into a decimal number. Each digit consumes a fixed number of matchsticks according to a standard seven-segment display configuration.