HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Arithmetic > problem:


50587 - Modular Conversion

Guest
• Review clarifications (3)

Section problems

• 50574 - Triangular Numbers
• 50578 - Mersenne prime
• 50579 - Pentagonal Numbers
• 50581 - The roots of a quadratic eq...
• 50582 - Number of digits
• 50583 - Max of 3 numbers
• 50584 - Total invoice amount
• 50585 - Inner Product
• 50587 - Modular Conversion
• 50595 - Sum of the numbers
• 50599 - Sum of Squared Error (SSE...
• 50609 - Long division
• 50633 - The prime factors
• 50634 - Perfect numbers
• 50635 - Decomposition into terms
• 50637 - Number systems
• 50650 - Prime numbers

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