input stringlengths 23 5.43k | output stringlengths 134 64.5k |
|---|---|
There are n persons who initially don't know each other. On each morning, two of them, who were not friends before, become friends.
We want to plan a trip for every evening of m days. On each trip, you have to select a group of people that will go on the trip. For every person, one of the following should hold:
* Eit... | <think>
Okay, I need to solve this programming problem. Let's read through the problem statement carefully.
So, the problem is about n people who become friends over m days. Each morning, two people become friends. Then, each evening, we have to find the maximum group size possible for a trip where each person in the ... |
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they have to read some amount of books before all entertainments. Alice and Bob will ... | <think>
Okay, let's try to figure out this problem. So, the task is to find the minimum total time for Alice and Bob to read books such that Alice likes at least k books in the chosen set and Bob also likes at least k. The set is the same for both, so each book in the set contributes to both Alice's and Bob's counts if... |
Adilbek's house is located on a street which can be represented as the OX axis. This street is really dark, so Adilbek wants to install some post lamps to illuminate it. Street has n positions to install lamps, they correspond to the integer numbers from 0 to n - 1 on the OX axis. However, some positions are blocked an... | <think>
Okay, let's see. I need to solve this programming problem. Let me read the problem statement carefully.
The problem is about Adilbek installing lamps on a street to illuminate the entire segment [0, n]. The street has some blocked positions where lamps can't be placed. The lamps come in different types, each w... |
"You are given an undirected graph consisting of n vertices and <image> edges. Instead of giving you(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem says that the graph is given in a way wh(...TRUNCATED) |
"Hasan loves playing games and has recently discovered a game called TopScore. In this soccer-like g(...TRUNCATED) | "<think>\nOkay, let's try to tackle this problem step by step. So, the problem is about calculating (...TRUNCATED) |
"Gildong was hiking a mountain, walking by millions of trees. Inspired by them, he suddenly came up (...TRUNCATED) | "<think>\nOkay, let's try to figure out how to solve this problem. Hmm. The problem is about determi(...TRUNCATED) |
"You are given a functional graph. It is a directed graph, in which from each vertex goes exactly on(...TRUNCATED) | "<think>\nOkay, let's tackle this programming problem. Hmm, the problem statement is a bit complex, (...TRUNCATED) |
"You are given a square board, consisting of n rows and n columns. Each tile in it should be colored(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about counting suitable colorings of (...TRUNCATED) |
"Grigory has n magic stones, conveniently numbered from 1 to n. The charge of the i-th stone is equa(...TRUNCATED) | "<think>\nOkay, I need to solve this programming problem. Let's read it carefully.\n\nThe problem is(...TRUNCATED) |
"You are given two arrays a and b, both of length n.\n\nLet's define a function f(l, r) = ∑_{l ≤(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the problem is about rearranging array b to minimize(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 28