Javaコイン反転倍数増加試算例

//何か足りないことや質問がありましたら、皆様のご指摘をお願いします.感謝に堪えません

 
  
import java.util.Scanner; 
   
  
/**
 * 
 * @author cc    100   ,      ,            ,         2      ,
 *              3   ,.....     ,             ？
 * 
 *         1.         1、0  ，1    ，0    ；
 *         
 *         
 *         100      
int[] ==  1100100001000000100000000100000000001000000000000100000000000000100000000000000001000000000000000000
  result coin about 1 nums = 10
 */
public class CoinTurn {
 
  
 private static int[] intCoins;
 
  
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  int coinNum = inputNum();
  intCoins = new int[coinNum];
 
  
  /*
   *    
   */
  for (int i = 0; i < intCoins.length; i++) {
   intCoins[i] = 0;//        ，   0
  }
 
  
  doTurnCoin();
 
  
  int resutltCoin = getCoinNum();
 
  
  System.out.println("result coin about 1 nums = " + resutltCoin);//            
 
  
 }
 
  
 private static void doTurnCoin() {
  /*
   *     
   */
  for (int i = 1; i < intCoins.length; i++) {//     
 
  
   for (int j = i - 1; j < intCoins.length; j++) {//     
    if (j % i == 0) { //              ，   
     if (intCoins[j] == 0) {
      intCoins[j] = 1;
     } else {
      intCoins[j] = 0;
     }
    }
 
  
   }
  }
 }
 
  
 private static int getCoinNum() {
  int countNum = 0;//           
  StringBuffer strB = new StringBuffer();
  for (int a : intCoins) {
   strB.append(a + "");
   if (1 == a)
    countNum++;
  }
  System.out.println("int[] ==  " + strB);//        
  return countNum;
 }
 
  
 /*
  * coin number
  */
 private static int inputNum() {
  System.out.println("input coin num: ");
  Scanner input = new Scanner(System.in);
  return input.nextInt();
 }
 
  
}