蒟蒻的题解
//第一次发布题解 如若有不对之处 欢迎大佬指出
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//把字符串切割成字符
String str = sc.next();
char charr [] = new char[8];
charr=str.toCharArray();
//如果前三位所在区域不吻合
if(charr[0]!='M'||charr[1]!='D'||charr[2]!='A') {
System.out.println(1+" "+ 1 +" "+1+" "+ 1 +" "+1);
}
//如果前三位吻合
if(charr[0]=='M'&&charr[1]=='D'&&charr[2]=='A') {
// 从最后一个开始找
//如果找到了就输出对应的限行 在结束循环
for(int k = 7;k>=3;k--) {
if(charr[k]=='0') {
System.out.print(0 + " " + 0 +" " + 0 + " " + 0 +" " + 1);
break;
}
if(charr[k]=='1') {
System.out.print(1 + " " + 0 +" " + 0 + " " + 0 +" " + 0);
break;
}
if(charr[k]=='2') {
System.out.print(0 + " " + 1 +" " + 0 + " " + 0 +" " + 0);
break;
}
if(charr[k]=='3') {
System.out.print(0 + " " + 0 +" " + 1 + " " + 0 +" " + 0);
break;
}
if(charr[k]=='4') {
System.out.print(0 + " " + 0 +" " + 0 + " " + 1 +" " + 0);
break;
}
if(charr[k]=='5') {
System.out.print(0 + " " + 0 +" " + 0 + " " + 0 +" " + 1);
break;
}
if(charr[k]=='6') {
System.out.print(0 + " " + 0 +" " + 0 + " " + 1 +" " + 0);
break;
}
if(charr[k]=='7') {
System.out.print(0 + " " + 0 +" " + 1 + " " + 0 +" " + 0);
break;
}
if(charr[k]=='8') {
System.out.print(0 + " " + 1 +" " + 0 + " " + 0 +" " + 0);
break;
}
if(charr[k]=='9') {
System.out.print(1 + " " + 0 +" " + 0 + " " + 0 +" " + 0);
break;
}
}
}
}
}