In 1500A - Going Home, how can we construct a sequence of $$$n$$$ integers such that the answer is NO.
A problem(inspired from round 707 div1-A)
In 1500A - Going Home, how can we construct a sequence of $$$n$$$ integers such that the answer is NO.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | hossainzarif | 2021-03-16 06:31:41 | 136 | Initial revision (published) |