计蒜客————整数转换成罗马数字

给定一个整数 $num$，将整数转换成罗马数字。

如 $1,2,3,4,5$ 对应的罗马数字分别为I，II，III，IV，V等，更详细的说明见此 链接。

输入格式

第一行输入一个整数 $num(1\le num\le 3999)$。

输出格式

输出 $num$ 对应的罗马数字。

样例输入

123

样例输出

CXXIII

每次只处理一位数。

#include <iostream>
#include <deque>
#include <cstring>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main()
{
    string com[4][10]= {{" ","I","II","III","IV","V","VI","VII","VIII","IX"},{" ","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"},{" ","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"},{" ","M","MM","MMM"},};
    int n;
    while(cin>>n!=NULL)
    {
        char s[10];
        sprintf(s,"%d",n);
        int len=strlen(s);
        for(int i=0; i<len; i++)
            cout<<com[len-i-1][s[i]-48];
        cout<<endl;
    }
    return 0;
}