Search results
It aims to introduce the Polygon platform to the new problem setters, and guide them through the basic steps on creating a new problem from scratch. In the post, I have explained the concepts and practices that a problem setter need to know in order to use Polygon to prepare problems.
We can do the following operations:\begin{enumerate}\item decrement from the \bf{first} two elements of the array. After this operation $a = [0, 1, 1]$.\item decrement from the \bf{last} two elements of the array. After this operation $a = [0, 0, 0]$.\end{enumerate}Therefore, the answer is \t{YES}.
Recently someone asked for a tutorial about using polygon to prepare problems, I couldn't find such tutorial so I decided to write one. You can find the tutorial here. This tutorial is beginner friendly, I tried to explain every step in details and through the tutorial I have created a complete simple problem. I hope you will find this tutorial ...
27 wrz 2020 · Problem. Given an array of \ (n\) integers, you should print any prime number in the array. It’s guaranteed that the array contain at least one prime number. Constraints: \ (1 \le n \le 10^3\), \ (1 \le A_i \le 10^3\).
Polygon is a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed chain or circuit. These segments are called its edges or sides, and the points where two edges meet are the polygon's vertices or corners (wiki).
→ Pay attention Before contest Codeforces Round (Div. 2) 6 days. Before contest Codeforces Round (Div. 3) 7 days
A guide for creating Codeforces problems on Polygon. The problem creator generates test case inputs using a test case script, generator, and (optional) validator. When a contest participant submits his or her solution, a checker can be used to verify if their program's output has valid syntax.
