import java.util.*;
import java.io.*;

public class AnalyseMinisat {


    private static double log2(double x){
	return Math.log(x)/Math.log(2.0);
    }

    private static double binCoeff(int n,int k){
	double x = 1.0;
	for (int r=1;r<=k;r++)
	    x = x*((double)(n-r+1)/(double)r);
	return x;
    }
    
    /*
    private static double kappa(int n,double p){
        double m_v   = (double)(n*(n-1)*(n-2))*p*p*p/6.0;
	double p_ind = binCoeff(n-3,3)/binCoeff(n,3);
	double k     = (double)n/3.0;
	double q     = k*(k-1)/2.0;
	double kappa = -(q*log2(p_ind))/(k*log2(m_v));
	return kappa;
    }
   
    private static double p2sol(int n){
	int k    = n/3;
	double q = (double)(k-1);
	double p = ((double)((n-3)*(n-4)*(n-5)))/((double)(n*(n-1)*(n-2)));
	return Math.pow(p,q);
    }
    //
    // probability first triangle is compatible with every other triangle
    //

    private static double psol(int n){
	double p = 1.0;
	for (int i=0;n-i >= 6;i=i+3) p = p * p2sol(n-i);
	return p;
    }
    */

    private static double psol(int n){
	double p = 1.0;
	for (int i=0;i<n-2;i=i+3) p = p *  binCoeff(n-i,3)/binCoeff(n,3);
	return p;
    }

    public static double kappa(int n,double p){
	int k        = n/3;
	int m        = (int)(((double)(n*(n-1)*(n-2)/6))*p*p*p);
	double p_ind = ((double)((n-3)*(n-4)*(n-5)))/((double)(n*(n-1)*(n-2)));
	int q        = k*(k-1)/2;
	double pSat  = psol(n); //Math.pow(p_ind,(double)q);
	double S     = binCoeff(m,k);
	double Sol   = S*pSat;
        double kappa = 0.0;
	if ((m <= k)) 
	    kappa = Double.MAX_VALUE;
	else
	    kappa = 1.0 - log2(Sol)/log2(S);
	return kappa;
    }
    
    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 = x.length;
	for (int i=0;i<n;i++) System.out.print(x[i] + " ");
	System.out.println();
    }
    private static long average(long[]x){
	int n = x.length;
	long sum = 0;
	for (int i=0;i<n;i++) sum = sum + x[i];
	return sum/n;
    }

    private static long median(long[]x){
	int n = x.length;
	Arrays.sort(x);
	return x[n/2];
    }

    private static long min(long[]x){
	int n = x.length;
	long min = x[0];
	for (int i=1;i<n;i++) min = Math.min(min,x[i]);
	return min;
    }
    
    private static long max(long[]x){
	int n = x.length;
	long max = x[0];
	for (int i=1;i<n;i++) max = Math.max(max,x[i]);
	return max;
    }

    private static void stats(String model,int n,double p,int lwb,int upb) throws IOException {
	int count        = 0;
	String p100      = "" + (int)(p*100.0);
	int sat          = 0;
	String fname     = "";
	String s         = "";
	long[] nds       = new long[upb-lwb+1]; // nodes visited
	long[] solveTime = new long[upb-lwb+1]; // milliseconds
	long[] buildTime = new long[upb-lwb+1]; // milliseconds
	long[] triangles = new long[upb-lwb+1]; // triangles in graph
	long[] packed    = new long[upb-lwb+1]; // triangles packed
	long[] density   = new long[upb-lwb+1]; // % of vertices packed


	if ((int)(p*100.0) < 10) p100 = "0" + p100;

	for (int i=lwb;i<=upb;i++){
	    if (i < 10)
		fname = "../results"+ model +"/"+ n +"-"+ p100 +"-0"+ i +".txt";
	    else
		fname = "../results"+ model +"/"+ n +"-"+ p100 +"-"+ i +".txt";
	    MyIo fin    = new MyIo(fname);
	    s = fin.getNextString();
	    while (!s.equals("s")){s = fin.getNextString();}
	    s = fin.getNextString(); skip(fin,4);
	    if (s.equals("SATISFIABLE")) sat++; 
	    solveTime[count] = (long)(fin.getNextDouble() * 1000.0); skip(fin,4);
	    nds[count]       = fin.getNextLong();
	    triangles[count] = 0;
	    packed[count]    = 0;
	    density[count]   = 0;
	    buildTime[count] = 0;
	    //System.out.println(fname);
	    count++;
	    fin.close();
	}
	System.out.format("%d  %.2f ",n,p);
	System.out.print(average(triangles) +" "+ min(triangles) +" "+ median(triangles) +" "+ max(triangles) +" ");
	System.out.print(average(packed) +" "+ min(packed) +" "+ median(packed) +" "+ max(packed) +" ");
	System.out.print(average(density) +" "+ min(density) +" "+ median(density) +" "+ max(density) +" ");
	System.out.print(average(nds) +" "+ min(nds) +" "+ median(nds) +" "+ max(nds) +" ");
	System.out.print(average(solveTime) +" "+ min(solveTime) +" "+ median(solveTime) +" "+ max(solveTime) +" ");
	System.out.print(average(buildTime) +" "+ min(buildTime) +" "+ median(buildTime) +" "+ max(buildTime) +" ");
	System.out.print(((sat * 100)/count) +" ");
	System.out.print(kappa(n,p));
	System.out.println();
    }

    public static void main(String[] args) throws FileNotFoundException, IOException, Exception {
	String model = "Minisat";
	int n        = Integer.parseInt(args[0]); // vertices in a graph
	double pLo   = Double.parseDouble(args[1]); // starting probability (in 0.1 increments)
	double pHi   = Double.parseDouble(args[2]); // ending probability
	double pInc  = Double.parseDouble(args[3]); // p increment
	int lwb      = Integer.parseInt(args[4]); // index of 1st results file
	int upb      = Integer.parseInt(args[5]); // index of last results file

	double p = pLo;       
	for (int i=0;p<=pHi+(pInc/2.0);i++){
	    stats(model,n,p,lwb,upb);
	    p = p + pInc;
	}
    }
}