MITIT 2024 Spring Invitational Qualification

5 problems from MITIT 2024 Spring Invitational Qualification (contest 105125), difficulty -. 0/5 solutions verified against sample I/O.

5 items

MITIT 2024 Spring Invitational Qualification

Special | 5 problems | 0/5 verified | Difficulty - | 7m 49s

#	Problem	Time
A	3-SAT	1m 35s
B	Tim the Marksman	1m 38s
C	NM Chars	1m 31s
D	Subarray Majority	1m 30s
E	Irrational Path	1m 35s

Practice › Codeforces Solutions › MITIT 2024 Spring Invitational Qualification ›

CF 105125E - Irrational Path

We are given a directed graph whose edges are labeled with decimal digits. Starting from vertex 1, we may walk forever by following directed edges. The sequence of edge labels becomes the decimal expansion of a number between 0 and 1.

Practice › Codeforces Solutions › MITIT 2024 Spring Invitational Qualification ›

CF 105125D - Subarray Majority

We are given a partially specified array of length $N$, where each position is either fixed to one of the values $1,2,3$ or is a wildcard that can be replaced independently by any of the three values. Every full assignment produces a concrete integer array.

Practice › Codeforces Solutions › MITIT 2024 Spring Invitational Qualification ›

CF 105125B - Tim the Marksman

We are given several independent test cases. Each test case describes a set of shooting lanes, where lane i contains Ai targets arranged in a line. Tim will fire a sequence of shots, and each shot is assigned to exactly one lane.

Practice › Codeforces Solutions › MITIT 2024 Spring Invitational Qualification ›

CF 105125A - 3-SAT

Each clause is the product of three variables, where every variable is either 0 or 1. The whole expression is the sum of all clause values. We are asked whether there is an assignment of the variables such that this sum is odd.

Practice › Codeforces Solutions › MITIT 2024 Spring Invitational Qualification ›

CF 105125C - NM Chars

We are given a multiset of integers representing letters, where each value from 1 up to NM is just a symbol in a totally ordered alphabet. The task is to split all these symbols into N words, each word having exactly M letters, using every occurrence exactly once.