HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Linear Data Structures: Arrays > problem:


50444 - n digit kth number divisible by m

Guest
• Review clarifications (1)

Section problems

• 51020 - Number of nodes removed
• 50932 - Shifting rows and columns
• 51141 - Most valuable stock items
• 51014 - Nine Men's Morris game
• 51019 - Finding the hidden message
• 50497 - Falling Bricks - Revisited
• 50933 - Sum of the Biggest Neighbors
• 51100 - Minimum time to exit building
• 50444 - n digit kth number divi...
• 50865 - Apartment Building Adminis...
• 51089 - Multiply a row and add it to ...
• 50874 - Apartment Building Adminis...
• 50531 - File Decryption
• 51012 - Palindrome-k
• 50469 - Letter Grades
• 50525 - Ordering Pizza
• 51099 - Mr. Monk

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 Ibrahim Mesecan.

n digit kth number divisible by m

Question: For example, 10002 is the first 5-digit number that is divisible by by 3. And 10005 is the second 5-digit number that is divisible by by 3. Write a progra that finds kth n-digit number which is divisible by m.

Input specification
You will be given three integers number (n, k and m) where 2 ≤ n ≤ 30, 0 ≤ k ≤ 20,000 and 0 ≤ m ≤ 105.

Output specification
Show an n-digit number.

 Sample Input   
 5 5 5
 Sample Output   
 10020


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

www.contester.ru