计蒜客挑战难题：整数转换成罗马数字

来源：互联网发布：金融类游戏知乎编辑：程序博客网时间：2024/06/05 09:08

给定一个整数num，( 1<=num<=3999)，将整数转换成罗马数字。

如1,2,3,4,5对应的罗马数字分别位I，II，III，IV，V等。

格式：

第一行输入一个整数，接下来输出对应的罗马数字。

提示：

罗马数字的常识见此链接，对做题有帮助哦～尤其是表示方法。

http://baike.baidu.com/link?url=injU8M4bAoc2zRZQ1GtgrfvuzCJO9PLnq6fpQGJLenakbzo-rS8p-qsYHR_81-aN

样例输入

123
样例输出

CXXIII

代码：

import java.util.Scanner;public class Main {    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);        StringBuilder sb = new StringBuilder();        String[][] r = {                {"","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 = sc.nextInt();        sb.append(r[3][n/1000%10]);        sb.append(r[2][n/100%10]);        sb.append(r[1][n/10%10]);        sb.append(r[0][n%10]);        System.out.println(sb);    }}

0 0