Prof. Hachioji has devised a new numeral system of integral numbers with four lowercase letters "m", "c", "x", "i" and with eight digits "2", "3", "4", "5", "6", "7", "8", "9". He doesn't use digit "0" nor digit "1" in this system.
The letters "m", "c", "x" and "i" correspond to 1000, 100, 10 and 1, respectively, and the digits "2", ...,"9" correspond to 2, ..., 9, respectively. This system has nothing to do with the Roman numeral system.
For example, character strings
"5m2c3x4i", "m2c4i" and "5m2c3x"
correspond to the integral numbers 5234 (=5*1000+2*100+3*10+4*1), 1204 (=1000+2*100+4*1), and 5230 (=5*1000+2*100+3*10), respectively. The parts of strings in the above example, "5m", "2c", "3x" and "4i" represent 5000 (=5*1000), 200 (=2*100), 30 (=3*10) and 4 (=4*1), respectively.
Each of the letters "m", "c", "x" and "i" may be prefixed by one of the digits "2", "3", ..., "9". In that case, the prefix digit and the letter are regarded as a pair. A pair that consists of a prefix digit and a letter corresponds to an integer that is equal to the original value of the letter multiplied by the value of the prefix digit.
For each letter "m", "c", "x" and "i", the number of its occurrence in a string is at most one. When it has a prefix digit, it should appear together with the prefix digit. The letters "m", "c", "x" and "i" must appear in this order, from left to right. Moreover, when a digit exists in a string, it should appear as the prefix digit of the following letter. Each letter may be omitted in a string, but the whole string must not be empty. A string made in this manner is called an MCXI-string.
An MCXI-string corresponds to a positive integer that is the sum of the values of the letters and those of the pairs contained in it as mentioned above. The positive integer corresponding to an MCXI-string is called its MCXI-value. Moreover, given an integer from 1 to 9999, there is a unique MCXI-string whose MCXI-value is equal to the given integer. For example, the MCXI-value of an MCXI-string "m2c4i" is 1204 that is equal to 1000 + 2*100 + 4*1. There are no MCXI-strings but "m2c4i" that correspond to 1204. Note that strings "1m2c4i", "mcc4i", "m2c0x4i", and "2cm4i" are not valid MCXI-strings. The reasons are use of "1", multiple occurrences of "c", use of "0", and the wrong order of "c" and "m", respectively.
Your job is to write a program for Prof. Hachioji that reads two MCXI-strings, computes the sum of their MCXI-values, and prints the MCXI-string corresponding to the result.
Input
The input is as follows. The first line contains a positive integer n (<= 500) that indicates the number of the following lines. The k+1 th line is the specification of the k th computation (k=1, ..., n).
n
specification1
specification2
...
specificationn
Each specification is described in a line:
MCXI-string1 MCXI-string2
The two MCXI-strings are separated by a space.
You may assume that the sum of the two MCXI-values of the two MCXI-strings in each specification is less than or equal to 9999.
Output
For each specification, your program should print an MCXI-string in a line. Its MCXI-value should be the sum of the two MCXI-values of the MCXI-strings in the specification. No other characters should appear in the output.
Sample Input
10
xi x9i
i 9i
c2x2i 4c8x8i
m2ci 4m7c9x8i
9c9x9i i
i 9m9c9x8i
m i
i m
m9i i
9m8c7xi c2x8i
Sample Output
3x
x
6cx
5m9c9x9i
m
9m9c9x9i
mi
mi
mx
9m9c9x9i
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
char a[10],b[10],c[10];
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
memset(a,'z',sizeof(a));
memset(b,'z',sizeof(b));
scanf("%s",a+1);
scanf("%s",b+1);
int lena=strlen(a+1);
int lenb=strlen(b+1);
int sum=0;
for(int j=1;j<=lena;j++)
{
if(a[j]=='m')
{
if(a[j-1]>='0'&&a[j-1]<='9')
sum=sum+(a[j-1]-'0')*1000;
else
sum=sum+1000;
}
if(a[j]=='c')
{
if(a[j-1]>='0'&&a[j-1]<='9')
sum=sum+(a[j-1]-'0')*100;
else
sum=sum+100;
}
if(a[j]=='x')
{
if(a[j-1]>='0'&&a[j-1]<='9')
sum=sum+(a[j-1]-'0')*10;
else
sum=sum+10;
}
if(a[j]=='i')
{
if(a[j-1]>='0'&&a[j-1]<='9')
sum=sum+(a[j-1]-'0')*1;
else
sum=sum+1;
}
}
for(int j=1;j<=lenb;j++)
{
if(b[j]=='m')
{
if(b[j-1]>='0'&&b[j-1]<='9')
sum=sum+(b[j-1]-'0')*1000;
else
sum=sum+1000;
}
if(b[j]=='c')
{
if(b[j-1]>='0'&&b[j-1]<='9')
sum=sum+(b[j-1]-'0')*100;
else
sum=sum+100;
}
if(b[j]=='x')
{
if(b[j-1]>='0'&&b[j-1]<='9')
sum=sum+(b[j-1]-'0')*10;
else
sum=sum+10;
}
if(b[j]=='i')
{
if(b[j-1]>='0'&&b[j-1]<='9')
sum=sum+(b[j-1]-'0');
else
sum=sum+1;
}
}
int k=0;
if(sum/1000!=0)
{
if(sum/1000==1)
c[++k]='m';
else
{
c[++k]=(sum/1000+'0');
c[++k]='m';
}
}
if(sum%1000/100!=0)
{
if(sum%1000/100==1)
c[++k]='c';
else
{
c[++k]=(sum%1000/100+'0');
c[++k]='c';
}
}
if(sum%100/10!=0)
{
if(sum%100/10==1)
c[++k]='x';
else
{
c[++k]=(sum%100/10+'0');
c[++k]='x';
}
}
if(sum%10!=0)
{
if(sum%10==1)
c[++k]='i';
else
{
c[++k]=(sum%10+'0');
c[++k]='i';
}
}
for(int j=1;j<=k;j++)
printf("%c",c[j]);
printf("\n");
}
return 0;
}