JAVA_100doors

Question:

100 doors in a row are all initially closed. You make 100 passes by the doors. The first time through, you visit every door and toggle the door (if the door is closed, you open it; if it is open, you close it).
The second time you only visit every 2nd door (door #2, #4, #6, ...). The third time, every 3rd door
(door #3, #6, #9, ...), etc, until you only visit the 100th door.

Question: What state are the doors in after the last pass? Which are open, which are closed?

[Source http://rosettacode.org]

Answer:

import java.util.regex.Matcher;
import java.util.regex.Pattern;
 
public class test
{
    public static void main( String args[] ){
    	int[] array= new int[100];
    	for(int i=1;i<100;i++) {
    		for(int k=1;k<100;k++) {
    			if(k%i==0) {
    				array[k-1]=1-array[k-1];
    			}
    		}
    		
    	}
    	System.out.println(array[99]);
    	
   }
}

Result:0