/* Sample solution for NCPC 2006: Shoot-out * Author: Øyvind Grotmol */ import java.io.DataInputStream; import java.util.StringTokenizer; import java.util.Locale; public class shootout_oeg { int n; double[] prob; double[][][] memo; /** initialize variables etc */ void solve() { n = INT(); prob = new double[n]; for (int i=0; i=n) pos-=n; if ((state&(1<=n) newturn-=n; if ((newstate&(1<best) best = options[j][pos]; } int numBest = 0; double[] result = new double[n]; for (int j=0; j