Java Question: Translate text into Codel where any message and replace each English letter with another English letter. This mapping is one-to-one and onto, which means that the same input letter always gets replaced with the same output letter, and different output letters. A letter may be replaced by itself. Spaces are left as is.

For example, our translation algorithm includes the following three mappings: 'b'->'n', 'j'->'u', and 'v'->'g' is based on the best possible replacement mapping, and we will never change it. It will always be the same in every test case. The rest of the mapping will not be revealed.

Code and input/output below:

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.nio.charset.StandardCharsets;

public class Main { /** * Iterate through each line of input. */ public static void main(String[] args) throws IOException { InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8); BufferedReader in = new BufferedReader(reader); String line; while ((line = in.readLine()) != null) { System.out.println(line); } } }

Test Input: tc rbkso rbyr ejp mysljylc kd kxveddknmc re jsicpdrysi de kr kd eoya kw aej icfkici re zjkr

Expected Output: we think that our language is impossible to understand so it is okay if you decided to quit