import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Quiz {
private static PrintStream o = System.out;
private String[] word = { "K", "A", "N", "I", "N", "C", "H", "E", "N" };
private String[] find = new String[word.length];
private BufferedReader in;
private int task = -1;
private int tries = 0;
private String input = "";
private List<String[]> list = new ArrayList<String[]>();
private PropertiesHelp ph = new PropertiesHelp("config.dat");
public Quiz() {
loadHighScoreList();
greet();
askForTask();
}
public static void main(String[] args) {
Quiz p = new Quiz();
}
public void askForTask() {
o.println("Type a number for wanted task, please!");
o.println("After any input you have to press ENTER.");
o.println("If you want ...");
o.println();
o.println("a) exit Quiz 2006 -> type 0");
o.println("b) play Quiz 2006 -> type 1");
o.println("c) show highscorelist -> type 2");
o.println();
try {
in = new BufferedReader(new InputStreamReader(System.in));
input = in.readLine();
} catch (IOException e) {
e.printStackTrace();
}
try {
task = Integer.valueOf(input);
} catch (NumberFormatException e) {
o.println("Your input was invalid. Try it again, please!");
o.println();
task = 99;
}
switch (task) {
case 0: {
saveHighScoreList();
o.println("Bye, till next game");
System.exit(0);
}
break;
case 1: {
play();
}
break;
case 2: {
showHighScoreList();
}
break;
default:
askForTask();
}
}
public void greet() {
o.println("Hallo! Welcome to the prompt of Quiz 2006");
o.println("Please, press ENTER to go on.");
try {
in = new BufferedReader(new InputStreamReader(System.in));
input = in.readLine();
} catch (IOException e) {
e.printStackTrace();
}
o.println();
}
public void play() {
for (int i = 0; i < word.length; i++)
find[i] = "-";
System.out.println("Find The Word");
tries = 0;
while (!Arrays.equals(word, find)) {
printArray(find);
System.out.println("Say a letter, please:");
try {
in = new BufferedReader(new InputStreamReader(System.in));
input = in.readLine();
} catch (IOException e) {
}
if (input.length() == 0)
continue;
for (int i = 0; i < word.length; i++) {
if (word[i].equals("" + input.substring(0, 1).toUpperCase()))
find[i] = input.substring(0, 1).toUpperCase();
}
tries++;
}
System.out.println("Bravo! You win!");
printArray(find);
enterNewPlayer();
o.println();
askForTask();
}
public void enterNewPlayer() {
String player = "";
o.println("Type your name, please!");
try {
in = new BufferedReader(new InputStreamReader(System.in));
input = in.readLine();
} catch (IOException e) {
e.printStackTrace();
}
player = input;
int point = (int) (100.0 * (1.0 / Math.pow((double) tries, 0.2)));
if (player != null && player.length() > 0) {
list.add(new String[] { player, "" + point });
o.println("Your data is registered in the highscorelist.");
}
}
public void showHighScoreList() {
if (list.size() == 0)
o.println("Highscorelist is empty!");
else {
Integer[] points = new Integer[list.size()];
Integer[] order = new Integer[list.size()];
for (int i = 0; i < list.size(); i++) {
points[i] = Integer.parseInt(list.get(i)[1]);
}
for (int i = 0; i < list.size(); i++) {
int index = Arrays.asList(points).indexOf(max(points));
points[i] = -1;
order[i] = index;
}
o.println("Quiz 2006 - Highscorelist:");
for (int i = 0; i < list.size(); i++) {
o.print("place: " + (i + 1) + " - " + list.get(order[i])[0]
+ " - ");
o.println(list.get(order[i])[1] + " points");
}
}
o.println();
askForTask();
}
public void loadHighScoreList() {
File file = new File("config.dat");
if (!file.exists()) {
try {
file.createNewFile();
} catch (IOException e) {
e.printStackTrace();
}
} else {
int size = ph.getSize();
for (int i = 0; i < size; i++) {
list.add(ph.getProperty("player" + i).split("/"));
}
}
}
public void saveHighScoreList() {
int size = list.size();
for (int i = 0; i < size; i++) {
ph.setProperty("player" + i, list.get(i)[0] + "/" + list.get(i)[1]);
}
}
public void printArray(Object[] o) {
for (int i = 0; i < o.length; i++)
System.out.print(o[i]);
System.out.println();
}
public int max(Integer[] t) {
int maximum = t[0]; // start with the first value
for (int i = 1; i < t.length; i++) {
if (t[i] > maximum) {
maximum = t[i]; // new maximum
}
}
return maximum;
}
}
.
