Forethought Future Cup - Final Round (Onsite Finalists Only)

Solutions for Forethought Future Cup - Final Round (Onsite Finalists Only) (contest 1147). 2/6 problems verified against sample I/O. Difficulty range: 1500-3500.

6 items

Forethought Future Cup - Final Round (Onsite Finalists Only)

Type: Special | Problems: 6 | Verified: 2/6 | Rating range: 1500-3500 | Time: 9m 37s

Problem Name Rating Tags Solve Time Verified
A Hide and Seek 1500 graphs 1m 51s ✗
B Chladni Figure 1900 brute-force, strings 1m 2s ✓
C Thanos Nim 2000 games 1m 22s ✓
D Palindrome XOR 2400 dfs-and-similar, graphs 1m 45s ✗
E Rainbow Coins 3000 interactive 1m 53s ✗
F Zigzag Game 3500 games, interactive 1m 44s ✗
Practice › Codeforces Solutions › Forethought Future Cup - Final Round (Onsite Finalists Only) ›

CF 1147F - Zigzag Game

The game is played on a complete bipartite graph with two equal groups of vertices. Every vertex on the left side connects to every vertex on the right side, and each such edge has a unique weight.
codeforces competitive-programming games interactive Jun 12, 2026
Practice › Codeforces Solutions › Forethought Future Cup - Final Round (Onsite Finalists Only) ›

CF 1147E - Rainbow Coins

We are given a hidden assignment of colors to numbered coins, where each coin is exactly one of three colors. The goal is to partition the coins into three groups so that each group contains coins of a single color, but we do not know the colors directly.
codeforces competitive-programming interactive Jun 12, 2026
Practice › Codeforces Solutions › Forethought Future Cup - Final Round (Onsite Finalists Only) ›

CF 1147D - Palindrome XOR

We are given a binary string pattern s consisting of '1', '0', and '?', with the guarantee that the first character is '1'.
codeforces competitive-programming dfs-and-similar graphs Jun 12, 2026
Practice › Codeforces Solutions › Forethought Future Cup - Final Round (Onsite Finalists Only) ›

CF 1147A - Hide and Seek

We are working on a line of $n$ cells where a token starts somewhere and may move over time. Bob asks a sequence of queries, each query naming a cell, and Alice must always answer “NO” to every query.
codeforces competitive-programming graphs Jun 12, 2026
Practice › Codeforces Solutions › Forethought Future Cup - Final Round (Onsite Finalists Only) ›

CF 1147C - Thanos Nim

We are asked to analyze a two-player game played on an array of piles, each containing some number of stones. There are $n$ piles, and $n$ is guaranteed to be even.
codeforces competitive-programming games Jun 12, 2026
Practice › Codeforces Solutions › Forethought Future Cup - Final Round (Onsite Finalists Only) ›

CF 1147B - Chladni Figure

The problem gives a rectangular grid of characters representing a pattern on a metal plate, where each cell contains either a . (empty) or a (filled). The task is to find the smallest rectangle that contains all the characters.
codeforces competitive-programming brute-force strings Jun 12, 2026