문제

A non-empty array A consisting of N integers is given.

문제

This is a demo task.

문제

You are given N counters, initially set to 0, and you have two possible operations on them:

문제

A small frog wants to get to the other side of a river. The frog is initially located on one bank of the river (position 0) and wants to get to the opposite bank (position X+1). Leaves fall from a tree onto the surface of the river.

안녕하세요! 👋