feat(codeforces): simple solutions

Author: jestenough

services/codeforces/problemset/4A-watermelon/README.md

@@ -0,0 +1,5 @@
+n = int(input())
+if n > 2 and n % 2 == 0:
+    print("YES")
+else:
+    print("NO")

services/codeforces/problemset/4A-watermelon/solution.py

@@ -0,0 +1,24 @@
+# A. Way Too Long Words
+
+time limit per test
+1 second
+memory limit per test
+256 megabytes
+
+Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome.
+
+Let's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.
+
+This abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.
+
+Thus, "localization" will be spelt as "l10n", and "internationalization» will be spelt as "i18n".
+
+You are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.
+Input
+
+The first line contains an integer n (1 ≤ n ≤ 100). Each of the following n lines contains one word. All the words consist of lowercase Latin letters and possess the lengths of from 1 to 100 characters.
+Output
+
+Print n lines. The i-th line should contain the result of replacing of the i-th word from the input data.
+
+[Problem link](https://codeforces.com/problemset/problem/71/A?locale=en)

services/codeforces/problemset/71A-a-way-too-long-words/README.md

@@ -0,0 +1,9 @@
+n = int(input())
+words = [input() for _ in range(n)]
+
+for word in words:
+    word_len = len(word)
+    if word_len > 10:
+        print(f"{word[0]}{word_len-2}{word[-1]}")
+    else:
+        print(word)