NUMBERS FROM MATCHSTICKS#8297

NUMBERS FROM MATCHSTICKS

ثانية

64 ميغابايت

صعب

Using a set number of matches and following specific templates to represent digits, you can form various natural multi-digit numbers. What are the smallest and largest numbers you can create using exactly $K$ matches?

المدخلات

A natural number $K$ – representing the number of matches $(2 \leq K \leq 200)$ (2 \leq K \leq 200).

المخرجات

Answer to the problem.

أمثلة

مثال 1

Loading

(2 \leq K \leq 200)