HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Array and Matrices > problem:


50444 - n digit kth number divisible by m

Guest
• Review clarifications (1)

Volume problems

• 50821 - Derivative of an array
• 50513 - Climbing Up the Stairs
• 50854 - Area of Triangle Revised
• 50520 - Filling a Matrix Randomly
• 50497 - Falling Bricks - Revisited
• 50847 - The first m trains to leave
• 50669 - Area of an Irregular Polygon
• 50860 - Number of Student Certificates
• 50444 - n digit kth number divi...
• 50865 - Apartment Building Adminis...
• 51011 - Decoding the Path
• 51019 - Finding the hidden message
• 51002 - The most successful classes
• 50525 - Ordering Pizza
• 50342 - 100 Factorial
• 50524 - Elevator
• 50531 - File Decryption

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