CF232D Fence

题目描述

John Doe has a crooked fence, consisting of $ n $ rectangular planks, lined up from the left to the right: the plank that goes $ i $ -th $ (1

输入格式

The first line contains integer $ n $ ( $ 1

输出格式

For each query on a single line print a single integer — the number of pieces of the fence that match the given one. Print the answers to the queries in the order, in which the queries are given in the input.

说明/提示

由 ChatGPT 5 翻译