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.
For the regex feature which pattern can use to check strings that contains decimals rounded to 3 digits like "0.700","2.800","4.900"? I tried ([0-9]{1-10}).([0-9]{3}) but that didn't work.
You can use the following operation as many times as you like: select any integer $ 1 \le k \le n $ and do one of two things: \begin {itemize} \item decrement by one $ k $ of the first elements of the array. \item decrement by one $ k $ of the last elements of the array. \end {itemize} For example, if $ n=5 $ and $ a=[3,2,2,1,4] $, then you can ...
Equivalently, all its interior angles are less than 180 degrees. Polygon is simple if its boundary doesn't cross itself. I will present two algorithms for each problem: one for arbitrary simple polygon, and one for strictly convex polygon, that has better complexity.
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\). Create the problem.
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 ...
With their help, problems created in Polygon will now have fewer typos and incorrect language constructions. We have recently implemented three features in Polygon to ease routine tasks: Translation of solutions into another programming language; Translation of problem statements into another language; Advice on improving the texts of problem ...
