HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Linear Data Structures: Arrays > problem:


50444 - n digit kth number divisible by m

Guest
• Review clarifications (1)

Section problems

• 50824 - Sum of Group Maxes
• 50449 - The biggest result
• 50442 - Polynomial Addition
• 50982 - A thief in labyrinth
• 50989 - Rectangles and Points
• 50932 - Shifting rows and columns
• 50497 - Falling Bricks - Revisited
• 50933 - Sum of the Biggest Neighbors
• 50444 - n digit kth number divi...
• 50865 - Apartment Building Adminis...
• 50874 - Apartment Building Adminis...
• 51127 - Maze solver
• 51126 - Dr. Fllanxha
• 51021 - Number of Nodes
• 51044 - Number of Trees
• 51098 - Rotate a matrix
• 51061 - The Longest Path

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