HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Array and Matrices > problem:


50587 - Modular Conversion

Guest
• Review clarifications (3)

Volume problems

• 50322 - Snake Pattern
• 50321 - Missing Number
• 50445 - Cryptography
• 50410 - Zero Padding
• 50380 - Sum of the Numbers in the ...
• 50400 - nth Row rth Element of a Table
• 50457 - The Number of Winners
• 50585 - Inner Product
• 50587 - Modular Conversion
• 030. 50737 - Sum of the k-largest n...
• 50419 - The longest bitonic sequence
• 50317 - Student Line Up
• 50311 - Student Line Up
• 50398 - Sum of kth Anti-diagonal
• 50323 - Filtering Contact List
• 50364 - Student averages
• 50756 - Average of the Nth Student

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

Modular Conversion

Shqip
Get two numbers n and m, and then calculate where n represents a number in base ten and m represents the base to convert.
Write a program that converts the given number n into base m and shows the result. For example:
(17)10 = (122)3

(17)10 = (10001)2

Input specification
There will be two numbers in the input file where 0 ≤ n < 100000 and 2 ≤ m < 10
Output specification
Calculate and show the result followed by an endline. The output number will not have more than 20 digits in it.

Input 1 Input 2
17 3 17 2
Output 1 Output 2
122
10001

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

www.contester.ru