package 百化分;
import java.text.NumberFormat;
import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;
public class PercentageCorrespondence {
static HashMap<String, Integer> arrMap = new HashMap<String, Integer>(32){{
put("33.3%", 3);
put("25%", 4);
put("20%", 5);
put("16.7%", 6);
put("14.3%", 7);
put("12.5%", 8);
put("11.1%", 9);
put("10%", 10);
put("9.1%", 11);
put("8.3%", 12);
put("7.7%", 13);
put("7.1%", 14);
put("6.7%", 15);
put("6.3%", 16);
put("5.9%", 17);
put("5.6%", 18);
put("5.3%", 19);
put("5%", 20);
put("4%", 25);
put("2.2%", 45);
}};
public static void main(String[] args) {
int rightNum = 0;
int index = 0;
int totalNum = arrMap.size();
for(String key:arrMap.keySet()){
index++;
System.out.println("第"+index+"题,"+"还剩"+(totalNum-index)+"题:");
System.out.println(key + " = ");
Scanner input = new Scanner(System.in);
if(input.nextInt() == arrMap.get(key)) {
System.out.print("\033[1;96m" + "√ 正确 罒ω罒 " +"\033[m");
rightNum++;
} else {
System.out.print("\033[1;91m" + "X 错误 (;′⌒`) "+"\033[m");
}
System.out.println(",答案是:"+arrMap.get(key));
}
NumberFormat nf = NumberFormat.getNumberInstance();
nf.setMaximumFractionDigits(2);
System.out.print("恭喜完成!正确率:"+nf.format((float)rightNum/totalNum*100)+"%");
}
}