Created
February 6, 2018 12:22
-
-
Save cbilson/a01a2fd84385e42dc91a56aa1e958c94 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.io.File; | |
import java.io.FileNotFoundException; | |
import java.util.Scanner; | |
/* | |
* The animals are conspiring again. The cows are mooing very strangely and | |
* you’re certain of it. Your theory is that the length of each “MM” sound | |
* and the length of the “OO” sound can be translated to hexadecimal values | |
* and then converted to ascii. Create a program to translate cowspeak to | |
* English so you can find out what they’re up to. | |
* | |
* Input: | |
* The first line will contain a single integer n that indicates the number | |
* of data sets that follow. Each data set will consist of one line | |
* containing many space separated strings representing the cows’ moos. | |
* | |
* Output: | |
* For each test case, output the decoded cowspeak | |
*/ | |
public class Cowspeak { | |
public static void main(String[] args) throws FileNotFoundException { | |
// For testing: | |
File f = new File("C:\\Users\\chris\\Desktop\\Cowspeak1.txt"); | |
Scanner input = new Scanner(f); | |
// For submission: | |
//Scanner input = new Scanner(System.in); | |
// The first line will contain a single integer n that indicates the | |
// number of data sets that follow. | |
int n = input.nextInt(); | |
// Right now I am just before the end of the first line, so I need to | |
// move the scanner down to the second line by finishing reading this | |
// line. | |
input.nextLine(); | |
for (int i = 0; i < n; i++) { | |
// Each data set will consist of one line containing many space | |
// separated strings representing the cows’ moos. | |
String line = input.nextLine(); | |
for (String token : line.split(" ")) { | |
// count Ms and Os | |
//System.out.println(token); | |
int ms = 0, os = 0; | |
for (int j = 0; j < token.length(); j++) | |
if (token.charAt(j) == 'M') | |
ms++; | |
else if (token.charAt(j) == 'O') | |
os++; | |
//System.out.println("Ms: " + ms + ", Os: " + os); | |
// I think the number of Ms is the 16s digit (the left-most digit) | |
// and the number of Os is the 1s digit (right most) of a char. | |
char c = (char)(ms*16 + os); | |
System.out.print(c); | |
} | |
System.out.println(); | |
} | |
} | |
private static String reverseCowSpeak(String words) { | |
String cowspeak = ""; | |
for (int i = 0; i < words.length(); i++) { | |
char c = words.charAt(i); | |
int ms = c / 16; | |
int os = c % 16; | |
for (int j = 0; j < ms; j++) | |
cowspeak += "M"; | |
for (int j = 0; j < os; j++) | |
cowspeak += "O"; | |
cowspeak += " "; | |
} | |
return cowspeak; | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2 | |
MMMMOOOOOOOOOOOOO MMMMOOOOOOOOOOOOOOO MMMMOOOOOOOOOOOOOOO | |
MMMMMMOOOOOOOO MMMMMMOOOOOOOOO |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
4 | |
MMMMOOOOOOO MMMMMMOOOOOOOOOOOOOOO MM MMMMMOO MMMMMMO MMMMMMMOOOOOO MMMMMMOOOOO MMMMMMOOOOOOOOOOOOOO MMMMMMMOOO MMO | |
MMMMOOOOOOOO MMMMMMO MMMMMMMOOOOOO MMMMMMOOOOO MM MMMMMMMOOOOOOOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMMOOOOO MM MMMMMMOOOOO MMMMMMMOOOOOO MMMMMMOOOOO MMMMMMMOO MM MMMMMMMOOO MMMMMMOOOOO MMMMMMOOOOO MMMMMMOOOOOOOOOOOOOO MM MMMMMMO MM MMMMMMOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMMOOOOOOO MMOOOOOOO MMMMMMMOOO MM MMMMMMOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMOOOO MMMMMMOOOOO MMMOOOOOOOOOOOOOOO | |
MMMMMMM MMMMMMMOOOOO MMMMMMOO MMMMMMOOOOOOOOOOOO MMMMMMOOOOOOOOO MMMMMMOOO MM MMMMMMOOO MMMMMMOOOOOOOOOOOO MMMMMMO MMMMMMMOOO MMMMMMMOOO MM MMMMOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMMOOOOOOO MMMMMMMOOO MMMMOOO MMMMMMO MMMMMMOOOOOOOOOOOOOO MMMMOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMOOOO MMMMMMOOOOO MM MMMMMMMOOOOOOOOOOO MM MMMMMMM MMMMMMMOOOOO MMMMMMOO MMMMMMOOOOOOOOOOOO MMMMMMOOOOOOOOO MMMMMMOOO MM MMMMMMMOOO MMMMMMMOOOO MMMMMMO MMMMMMMOOOO MMMMMMOOOOOOOOO MMMMMMOOO MM MMMMMMMOOOOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMOOOOOOOOO MMMMMMOOOO MM MMMMMMOOOOOOOOOOOOO MMMMMMO MMMMMMOOOOOOOOO MMMMMMOOOOOOOOOOOOOO MMOOOOOOOO MMMMMOOO MMMMMMMOOOO MMMMMMMOO MMMMMMOOOOOOOOO MMMMMMOOOOOOOOOOOOOO MMMMMMOOOOOOO MMMMMOOOOOOOOOOO MMMMMOOOOOOOOOOOOO MM MMMMMMO MMMMMMMOO MMMMMMOOOOOOO MMMMMMMOOO MMOOOOOOOOO MM MMMMMMMOOOOOOOOOOO MM MMMMMOOO MMMMMMMOOOOOOOOO MMMMMMMOOO MMMMMMMOOOO MMMMMMOOOOO MMMMMMOOOOOOOOOOOOO MMOOOOOOOOOOOOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMMOOOOO MMMMMMMOOOO MMOOOOOOOOOOOOOO MMMMMMM MMMMMMMOO MMMMMMOOOOOOOOO MMMMMMOOOOOOOOOOOOOO MMMMMMMOOOO MMMMMMOOOOOOOOOOOO MMMMMMOOOOOOOOOOOOOO MMOOOOOOOO MMOO MMMMOOOOOOOOOOOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMOOOOOOOOOOOOOOO MMO MMOO MMOOOOOOOOO MMMOOOOOOOOOOO MM MMMMMMMOOOOOOOOOOOOO MM MMMMMMMOOOOOOOOOOOOO | |
MMMMOOOOOOOOOOOOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMMOOOOOOO MM MMMMMMMOOOOOOOOO MMMMMMOOOOOOOOOOOOOOO MMMMMMMOOOOO MM MMMMMMOOOOOOOO MMMMMMO MMMMMMMOOOOOO MMMMMMOOOOO MMOOOOOOOOOOOOOO |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment