Edited by author 07.11.2010 00:25

Congrats! Nice work!

Great Job. Congrats

in each turn you must take x stones which
x is a member of S= {1, 2^1, 2^2, ...}

sorry for my poor english.

Chess notation in this problem is standard chess notation.
But the statement can be unclear because "forward side" of cube here means "nearest" to us (to 1st row).

I've changed "forward side" to "near side" and "backward side" to "far side". Does it make the statement better?

yes

For the BIT method you just have to think about the right order to add the stars.

In test case 10 8 we have answer 1 2 3 4 8 7 5 6... But the fist gun can be bought for 1 moneyticket and the 2 also.

Will the answer 2 1 3 4 8 7 5 6 be correct??

MyCode in Java :

    int k = sc.nextInt();
    int n = sc.nextInt();
    int z = 0;
    s = new BigInteger("0");
    int[] a = new int[] {1,2,3,5,7,11,13,17,19,23};
    int[] b = new int[]{1,6,10,14,15,21,22};
    sn = new BigInteger("0");
            for (int j = 1; j <=9; j++) {
                z = n/a[j];
                if (z>=k) {
                    almashtirishlar(z,k);
                    s = s.add(sn);
                }else break;
            }
            for (int i = 1; i <=6; i++) {
                z = n/b[i];
                if (z>=k){
                    almashtirishlar(z, k);
                    s = s.subtract(sn);
                }else break;
            }
            if(s.compareTo(new BigInteger("10000"))<0)System.out.println(s);
            else System.out.println(10000);
    }
    public static void almashtirishlar(int q,int kk) {
        BigInteger s1 = new BigInteger("1");
        for (int i = 2; i <=q; i++) {
            s1 = s1.multiply(new BigInteger(i+""));
        }
        BigInteger s2 = new BigInteger("1");
        for (int i = 2; i <=kk; i++) {
            s2 = s2.multiply(new BigInteger(i+""));
        }
        BigInteger s3 = new BigInteger("1");
        for (int i = 2; i <=q-kk; i++) {
            s3 = s3.multiply(new BigInteger(i+""));
        }
        sn = s1.divide(s2.multiply(s3));
    }
}

You don't apply this rule correctly:
"According to the “Defense” pattern, robot’s actions are defined as follows: calculate the number of enemies and multiply it by 20. If the result is not less than the amount of ammunition units left, the robot will “Retreat and Return Fire”. Otherwise, it will act as if following the “Guard” pattern."

Edited by author 04.11.2010 06:24