@@ -0,0 +1,836 @@
+// https://codeforces.com/problemset/problem/363/A%0A%0Aimport java.util.HashMap;%0Aimport java.util.Map;%0Aimport java.util.Scanner;%0A%0Apublic class Solution %7B%0A%0A%09public static void main(String%5B%5D args) %7B%0A%09%09Scanner read = new Scanner(System.in);%0A%09%09%0A%09%09String n = read.nextLine();%0A%09%09%0A%09%09Map%3CCharacter, String%3E digitRods = new HashMap%3C%3E();%0A%09%09digitRods.put('0', %22O-%7C-OOOO%22);%0A%09%09digitRods.put('1', %22O-%7CO-OOO%22);%0A%09%09digitRods.put('2', %22O-%7COO-OO%22);%0A%09%09digitRods.put('3', %22O-%7COOO-O%22);%0A%09%09digitRods.put('4', %22O-%7COOOO-%22);%0A%09%09digitRods.put('5', %22-O%7C-OOOO%22);%0A%09%09digitRods.put('6', %22-O%7CO-OOO%22);%0A%09%09digitRods.put('7', %22-O%7COO-OO%22);%0A%09%09digitRods.put('8', %22-O%7COOO-O%22);%0A%09%09digitRods.put('9', %22-O%7COOOO-%22);%0A%09%09%0A%09%09for (int i = n.length()-1; i %3E= 0; --i) %7B%0A%09%09%09char digit = n.charAt(i);%0A%09%09%09System.out.println( digitRods.get(digit) );%0A%09%09%7D%0A%09%09%0A%09%09// Close scanner%0A%09%09read.close();%0A%09%7D%0A%0A%7D%0A

Create Soroban.java