HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Arithmetic > problem:


50412 - K numbers

Guest
• Review clarifications (5)

Section problems

• 50585 - Inner Product
• 50587 - Modular Conversion
• 50633 - The prime factors
• 50650 - Prime numbers
• 50661 - nth Power of a Digit
• 50249 - Ladders
• 50641 - Strong Prime Power
• 50640 - Cubes
• 50412 - K numbers
• 50310 - Kinetic Energy
• 50316 - Population Bar Chart
• 50314 - Falling Distance
• 50392 - How much space
• 50330 - Find the average of n numbers
• 50297 - Divisible By Five
• 50394 - Water Bills
• 50363 - Class GPA Average

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Evis Hoxha.

K numbers

Dattaraya Ramchandra Kaprekar, an Indian recreational mathematician, while experimenting with number properties, made an interesting discovery. He found out that some non-negative integers have the following property: their square can be split into two parts that add up to the original number again. For example: 452 = 2025 and 20+25 = 45. He named them K numbers.

By convention, the second part may start with the digit 0, but must be positive. For example, 999 is a K number, because 9992= 998001, which can be split into 998 and 001, and 998 + 001 = 999. But 100 is not; although 1002 = 10000 and 100 + 00 = 100, the second part here is not positive.

To make further researches, he needs a program to test if a given number N is a K number.

Input specifications

A positive integer N will be given where n < 600000.

Output specifications

If N is a K number, output the splited form of the number. For example, if N=45, the output will be: 20 25
If it is not, output "Impossible".

Input 1 Output 1
45 20 25

Для отправки решений необходимо выполнить вход.

www.contester.ru