Codeforces Beta Round 57 (Div. 2)
C
Capture Valerian
Codeforces
2000
原题
← BD →
翻译中…

It's now $260$ AD. Shapur, being extremely smart, became the King of Persia. He is now called Shapur, His majesty King of kings of Iran and Aniran.

翻译中…

Recently the Romans declared war on Persia. They dreamed to occupy Armenia. In the recent war, the Romans were badly defeated. Now their senior army general, Philip is captured by Shapur and Shapur is now going to capture Valerian, the Roman emperor.

翻译中…

Being defeated, the cowardly Valerian hid in a room at the top of one of his castles. To capture him, Shapur has to open many doors. Fortunately Valerian was too scared to make impenetrable locks for the doors.

翻译中…

Each door has $4$ parts. The first part is an integer number $*a*$. The second part is either an integer number $*b*$ or some really odd sign which looks like R. The third one is an integer $*c*$ and the fourth part is empty! As if it was laid for writing something. Being extremely gifted, after opening the first few doors, Shapur found out the secret behind the locks.

翻译中…

$*c*$ is an integer written in base $*a*$, to open the door we should write it in base $*b*$. The only bad news is that this R is some sort of special numbering system that is used only in Roman empire, so opening the doors is not just a piece of cake!

翻译中…

Here's an explanation of this really weird number system that even doesn't have zero:

翻译中…

Roman numerals are based on seven symbols: a stroke (identified with the letter I) for a unit, a chevron (identified with the letter V) for a five, a cross-stroke (identified with the letter X) for a ten, a C (identified as an abbreviation of Centum) for a hundred, etc.:

翻译中…
  • I=$1$
  • V=$5$
  • X=$10$
  • L=$50$
  • C=$100$
  • D=$500$
  • M=$1000$
翻译中…

Symbols are iterated to produce multiples of the decimal ($1$, $10$, $100$, $1, 000$) values, with V, L, D substituted for a multiple of five, and the iteration continuing: I $1$, II $2$, III $3$, V $5$, VI $6$, VII $7$, etc., and the same for other bases: X $10$, XX $20$, XXX $30$, L $50$, LXXX $80$; CC $200$, DCC $700$, etc. At the fourth and ninth iteration, a subtractive principle must be employed, with the base placed before the higher base: IV $4$, IX $9$, XL $40$, XC $90$, CD $400$, CM $900$.

翻译中…

Also in bases greater than $10$ we use A for $10$, B for $11$, etc.

翻译中…

Help Shapur capture Valerian and bring peace back to Persia, especially Armenia.

翻译中…

Input

翻译中…

The first line contains two integers $*a*$ and $*b*$ ($2 ≤ *a*, *b* ≤ 25$). Only $*b*$ may be replaced by an R which indicates Roman numbering system.

翻译中…

The next line contains a single non-negative integer $*c*$ in base $*a*$ which may contain leading zeros but its length doesn't exceed $10^{3}$.

翻译中…

It is guaranteed that if we have Roman numerals included the number would be less than or equal to $3000_{10}$ and it won't be $0$. In any other case the number won't be greater than $10^{15}_{10}$.

翻译中…

Output

翻译中…

Write a single line that contains integer $*c*$ in base $*b*$. You must omit leading zeros.

翻译中…

Note

翻译中…

You can find more information about roman numerals here: http://en.wikipedia.org/wiki/Roman_numerals

翻译中…

样例

Input #1
10 2
1
Output #1
1
InputCopy OutputCopy
Input #2
16 R
5
Output #2
V
InputCopy OutputCopy
Input #3
5 R
4
Output #3
IV
InputCopy OutputCopy
Input #4
2 2
1111001
Output #4
1111001
InputCopy OutputCopy
Input #5
12 13
A
Output #5
A
InputCopy OutputCopy
题目信息
题号
61C
时间限制
2 s
内存限制
256 MB
标签
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。