输入一个不确定位数的数字，将其转化罗马数字，用"X","I","II","III","IV","V","VI","VII","VIII","IX"代表0,1，2,3,4,5,6,7,8,9的罗马数字。

程序不是太严谨，和实际的表示（10应该用X表示，五十用C表示等等）也有差距。受定义类型的限制，位数不能无限多。



程序共用了三种方法，注释掉的是两种麻烦并且占内存多（其实可以修改成和第一种方法占内存一样多）的方法-Enter an uncertain number of digits, Roman numerals, with the " X" , " "　II " ,"　III " ,"　IV " ,"　V " ,"　VI, VII, " VIII of " ,"　IX " on behalf of 0,1,2,3,4,5,6,7,8,9 of Roman numerals. The program is not too rigorous, and practical (10 X represents fifty C represents, etc.) is also a gap. Limit of the defined type, the median can not be unlimited. Program three methods, comment out the two cumbersome and accounted for memory (in fact, could be modified to the first method accounts for as much) memory