Easy Version Archives - VietMX's Blog

2020 VietMX 0

This is an easier version of the next problem. The difference is only in constraints. You are given a rectangular $n \times m$ matrix $a$. […]

2020 VietMX 0

This is an easier version of the next problem. In this version, $q = 0$. A sequence of integers is called nice if its elements are arranged […]

2020 VietMX 0

This is the easier version of the problem. In this version $1 \le n, m \le 100$. You can hack this problem only if you […]

2020 VietMX 0

This is the easy version of this problem. The only difference is the limit of $n$ – the length of the input string. In this […]

2020 VietMX 0

This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test […]

2020 VietMX 0

This is the easy version of the problem. The difference is constraints on the number of wise men and the time limit. You can make […]