import java.util.*;
import java.io.*;
import choco.Problem;
import choco.ContradictionException;
import choco.integer.*;
import choco.integer.search.DecreasingDomain;
import choco.Solver;
import choco.Solution;
import choco.search.*;

public class LDSAnalyseSol {
    
    private static void skip(MyIo fin,int n) throws IOException{
	for (int i=0;i<n;i++) fin.getNextString();
    }

    private static void show(long[]x,int n){
	for (int i=0;i<n;i++) System.out.print(x[i] + " ");
	System.out.println();
    }
    private static long average(long[]x,int n){
	long sum = 0;
	for (int i=0;i<n;i++) sum = sum + x[i];
	return sum/n;
    }

    private static double kappa(int n,double x){
	return Math.log(x)/Math.log(2.0)/(double)n;
    }
    //
    // n numbers in the range [1..x]

    private static void stats(int n,int d,String style,int lwb,int upb) throws IOException {
	int count = 0;
	String fname,s;
	int solved = 0;
	long[] nds  = new long[upb-lwb+1]; // nodes visited
	long[] disc = new long[upb-lwb+1]; // discrepancies
	long[] ms   = new long[upb-lwb+1]; // milliseconds

	for (int i=lwb;i<=upb;i++){
	    fname = "results/" + style +"-"+ n +"-"+ d +"-"+ i +".txt";
	    MyIo fin    = new MyIo(fname);
	    s           = fin.getNextString(); skip(fin,3);
	    if (s.equals("true")){
		solved++;
		nds[count]  = fin.getNextLong();   skip(fin,1); 
		disc[count] = fin.getNextLong();   skip(fin,1);
		ms[count]   = fin.getNextLong();
		count++;
	    }
	    fin.close();
	}
	System.out.print(n +" "+ d +" ");
	System.out.print(average(nds,count) +" ");
	System.out.print(average(disc,count) +" ");
	System.out.print(average(ms,count) +" ");
	System.out.println((solved*100)/count +" "+ kappa(n,Math.pow(10,d)));
    }

    public static void main(String[] args) throws FileNotFoundException, IOException, Exception {
	int nLo            = Integer.parseInt(args[0]); // number of numbers to start at
	int nHi            = Integer.parseInt(args[1]); // number of numbers to end at
	int d              = Integer.parseInt(args[2]); // max number of digits in numbers
	String style       = args[3];
	int lwb            = Integer.parseInt(args[4]); // index of 1st results file
	int upb            = Integer.parseInt(args[5]); // index of last results file
       
	for (int n=nLo;n<=nHi;n=n+5)
	    stats(n,d,style,lwb,upb);
    }
}
//
// Also include kappa
//