public class ChipRace {

    int[] a;
    int t, d;
    double[] best;

    double dp(int mask) {

        if (((1 << t) & mask) > 0)
            return 1;

        if (Integer.bitCount(mask) == d)
            return 0;

        if (best[mask] != -1)
            return best[mask];

        double p = 0.0;
        int sum = 0;

        for (int j = 0; j < a.length; j++) {
            if (((1 << j) & mask) == 0)
                sum += a[j];
        }
        for (int j = 0; j < a.length; j++) {
            if (((1 << j) & mask) == 0) {
                p += a[j] * dp(mask | (1 << j)) / sum;
            }
        }
        return best[mask] = p;

    }

    void init() {
        best = new double[1 << a.length];
        for (int i = 0; i < best.length; i++) {
            best[i] = -1;
        }
    }

    public double[] chances(int[] chips) {
        a = chips;
        int sum = 0;
        for (int i = 0; i < chips.length; i++) {
            sum += chips[i];
        }
        d = Math.round(sum / (float) 5);
        init();
        double[] ret = new double[chips.length];

        for (int i = 0; i < ret.length; i++) {
            init();
            t = i;
            ret[i] = dp(0);
        }
        return ret;
    }

    public static void main(String[] args) {
        double[] r = new ChipRace().chances(new int[] { 0, 1, 2, 3, 4 });
        System.out.println(r[0]);
        System.out.println(r[1]);
        System.out.println(r[2]);
        System.out.println(r[3]);
        System.out.println(r[4]);
    }

}