Das geheimnisvolle antike Rätsel der Nataren

import java.util.Scanner;
class problem
{
  public static int pls1(int A,int B, int C, int D, int E, int F, int G, int H){
    int pls = 0;


    if(  ((((A*100+B*10+A)-(C*100+A*10+D))==(E*100+E*10+B))&&
          (((A*100+B*10+A)-(F*100+G*10+C))==(E*100+D*10+A))&&
          (((F*100+G*10+C)+(B*100+B*10+B))==(H*100+E*10+B))&&
          (((C*100+A*10+D)+(B*100+B*10+B))==(H*100+D*10+A))&&
          (((E*100+E*10+B)-(H*100+E*10+B))==(F*100+C*10+C))&&
          (((E*100+D*10+A)-(H*100+D*10+A))==(F*100+C*10+C)))){pls=0;}else{pls=1;}


    return pls;
  }
  public static int pls2(int A,int B, int C, int D, int E, int F, int G, int H){
    int pls = 0;


    if(  (((A == H) |(A==B)| (A == C) | (A ==D) | (A ==E) | (A ==F) | (A ==G))|
          ((B == A) |(B==H)| (B == C) | (B ==D) | (B ==E) | (B ==F) | (B ==G))|
          ((C == A) |(C==B)| (C == H) | (C ==D) | (C ==E) | (C ==F) | (C ==G))|
          ((D == A) |(D==B)| (D == C) | (D ==H) | (D ==E) | (D ==F) | (D ==G))|
          ((E == A) |(E==B)| (E == C) | (E ==D) | (E ==H) | (E ==F) | (E ==G))|
          ((F == A) |(F==B)| (F == C) | (F ==D) | (F ==E) | (F ==H) | (F ==G))|
          ((G == A) |(G==B)| (G == C) | (G ==D) | (G ==E) | (G ==F) | (G ==H))|
          ((H == A) |(H==B)| (H == C) | (H ==D) | (H ==E) | (H ==F) | (H ==G)))){pls=1;}else{pls=0;}


    return pls;
  }
  public static void main (String[] args)
  {


    // int Version des Inputs
    //System.out.println("A: ");   // Dividend lesen
    int A = -1;
    //System.out.println("B: ");
    int B = 0;
    //System.out.println("D: ");
    int D = 0;
    //System.out.println("E: ");   // Dividend lesen
    int C = 0;
    //System.out.println("E: ");   // Dividend lesen
    int E = 0;
    //System.out.println("F: ");
    int F = 0;
    //System.out.println("G: ");   // Dividend lesen
    int G = 0;
    //System.out.println("H: ");
    int H = 0;
    long nein = 0;


    while(((pls1(A,B,C,D,E,F,G,H))|(pls2(A,B,C,D,E,F,G,H)))==1)
          {   //System.out.println("test");
          //System.out.println(A+"A "+B+"B "+C+"C "+D+"D "+E+"E "+F+"F "+G+"G "+H+"H");
          if(( (pls1(A,B,C,D,E,F,G,H))==0 &(pls2(A,B,C,D,E,F,G,H))==1)){System.out.println("FML"); System.out.println(A+"A "+B+"B "+C+"C "+D+"D "+E+"E "+F+"F "+G+"G "+H+"H");}


                A++;
                if(A==10){B++;A=0;}
                if(B==10){C++;A=0;B=0;}
                if(C==10){D++;A=0;B=0;C=0;}
                if(D==10){E++;A=0;B=0;C=0;D=0;}
                if(E==10){F++;A=0;B=0;C=0;D=0;E=0;}
                if(F==10){G++;A=0;B=0;C=0;D=0;E=0;F=0;}
                if(G==10){H++;A=0;B=0;C=0;D=0;E=0;F=0;G=0;}}






System.out.println(A+"A "+B+"B "+C+"C "+D+"D "+E+"E "+F+"F "+G+"G "+H+"H");
  }


}