HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Contests > "Informatics Stars" Online Contests - 2011-2014 > problem:


2011-04-3. 50587 - Modular Conversion

"Informatics Stars" Online Contests - 2011-2014

Start: Oct.20.2012 at 10:00:00 AM
Finish: Oct.20.2012 at 03:00:00 PM
The contest is finished!
• Contest scoreboard

Guest
• Review clarifications (3)

Contest problems

• 50326 - Matrix Operations
• 50325 - How much time passed?
• 50776 - The number of different pa...
• 50779 - The shortest path in a maze
• 2011-04-1. 50586 - Prime Palindromes
• 2011-04-2. 50585 - Inner Product
• 2011-04-3. 50587 - Modular Co...
• 2011-05-1. 50767 - Censor
• 2011-05-2. 50652 - Prime Factorization
• 2011-05-3. 50653 - Long Divide
• 2011-11-1. 50565 - Binary numbers
• 2011-11-3. 50588 - Processing the li...
• 2012-02-2. 50577 - Perfect Numbers...
• 2012-02-4. 50594 - Transformations
• 2012-02-5. 50768 - Where is Waldorf?

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