pigfencing.java

计算总数问题

import java.io.*; 
public class PigFencing { 
   public static void main(String args[]) throws IOException { 
      int group=0;
      int m=0;
      int b[]=new int[100000];
      boolean flag=false;
      boolean flag2=false;
      BufferedReader br2 = new BufferedReader(new InputStreamReader(System.in));
      System.out.println("Input group:");
      group=Integer.parseInt(br2.readLine());
      int a[][]=new int[group][2]; 
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 
      System.out.println("Input datas,use enter to seperate them:"); 
      for(int i=0;i<=a.length-1;i++){ 
         for(int j=0;j<2;j++){
            a[i][j]= Integer.parseInt(br.readLine()); 
         }
      } 
      for(int i=0;i<=a.length-1;i++){
         for(int j=0;j<2;j++){ 
            System.out.print(a[i][j]+" ");
         }
         System.out.println(); 
      } 

      for(int total=1;total<=5000;total++){
         for(int k=0;k<group;k++){
            if((total-a[k][1])/(a[k][0])>=1){
              if(((total-a[k][1])%(a[k][0])==0)){
                flag=true;
              }
              else{
                flag=false;
                break;
              }
              if((total-a[group-1][1])%(a[group-1][0])==0){
                flag2=true;
              }
            }
         }
         if(flag&&flag2){
           b[m]=total;
           m++;
         }
      }
      System.out.println();
      if(b[0]==0){
        System.out.print("there isn't such number.");
      }
      else
        System.out.print("the min of these number is : "+b[0]);
   }
}