约瑟夫问题

package 经典;

public class KickOutBadGuys {
    
    private static final int MAX=26;
    private static final int NUM=13;
    private static final int STEP=7;
    
    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        
        int[] a=new int[MAX];
        
        for(int i=0; i<MAX; i++)
            a[i]=i+1;
        
        int n=MAX;
        int count=0;
        int j=0;
        while(n>NUM)
        {
            if(a[j]!=-1)
                count++;
            
            if(count==STEP)
            {
                a[j]=-1;
                n--;
                count=0;
            }
            
            if(j==MAX-1)
                j=0;
            j++;
        }
        
        for(int i=0 ;i<MAX; i++)
            System.out.print(a[i]+",");
        
        
    }    

}