#include <stdio.h>


void  generateAllPairingsConstraint2(int* array); 




  // used to generate constraint 67: (to know the basic variables for the given nodes)

int nodes[] = {10,21,25,26,27,28,-1};
int* arrays[6];
int node10[] = {9,11,12,25,-1};
int node21[] = {20,22,28,-1};
int node25[] = {10,24,26,-1};
int node26[] = {25,27,28,-1};
int node27[] = {22,24,26,28,-1};
int node28[] = {21,22,26,27,29,-1};



int s1[] = {1,2,41,42,-1};
int s2[] = {3,4,5,6,7,8,9,-1};
int s3[] = {1,2,3,4,5,6,7,8,9,29,30,31,32,33,34,35,36,37,38,39,40,41,42,-1};
int s4[] = {11,12,13,14,15,16,17,18,19,20,21,22,23,-1};
int s5[] = {13,14,15,16,17,18,19,20,21,22,23,-1};
int s6[] = {13,14,15,16,17,-1};
int s7[] = {24,25,26,27,-1};









int contains(int value, int* array) 
{
  int i =0;
  int res = 0;
  
  while(array[i] != -1) {
    if(array[i++] == value) {
      res = 1;
      break;
    }
  }
  return res;
}

void  generateLoopConstraint2(int* array) 
{
  int i = 0;
  int k;
  int currentIndex;
  int firstItem = 1;

  while(array[i] != -1) {
    currentIndex = array[i];
    for(k=1; k<=42; k++) {
      if(k != currentIndex) {
	if(!contains(k,array)) {

	  if(k>currentIndex) 
	    fprintf(stdout, "- x_%d_%d", k, currentIndex);
	  else
	    fprintf(stdout, "- x_%d_%d", currentIndex, k);
	}
      }
    }
    i++;
  }
}



void  generateLoopConstraint(int* array) 
{
  int i = 0;
  int k;
  int currentIndex;
  int firstItem = 1;

  fprintf(stdout, "\n\n");
  while(array[i] != -1) {
    currentIndex = array[i];
    for(k=1; k<=42; k++) {
      if(k != currentIndex) {
	if(!contains(k,array)) {
	  if(firstItem)
	    firstItem = 0;
	  else
	    fprintf(stdout, " + ");

	  if(k>currentIndex) 
	    fprintf(stdout, "x_%d_%d", k, currentIndex);
	  else
	    fprintf(stdout, "x_%d_%d", currentIndex, k);
	}
      }
    }
    i++;
  }
  fprintf(stdout, " >= 2\n");
}

void generateConstraint66() 
{
  int i;
  int a=15,b=16,c=19;
  fprintf(stdout, "c66: x_15_14 ");

  for(i =1; i <=42; i++) {
    if(i!=a && i != b && i !=c ) {
      fprintf(stdout,"- x_%d_%d", (a>i)?a:i, (a<i)?a:i);
    }
  }
  for(i =1; i <=42; i++) {
    if(i!=a && i != b && i !=c ) {
      fprintf(stdout,"- x_%d_%d", (b>i)?b:i, (b<i)?b:i);
    }
  }
  for(i =1; i <=42; i++) {
    if(i!=a && i != b && i !=c ) {
      fprintf(stdout,"- x_%d_%d", (c>i)?c:i, (c<i)?c:i);
    }
  }

  fprintf(stdout, "+ x_15_14 - x_19_16 - x_19_15 - x_16_15 + x_18_15 + x_18_16 + x_17_16 + x_19_18 + x_20_19  <= 0\n");
}


void generateConstraint67() 
{
  int i,j;
  int nodeIndex, index;

  arrays[0] = node10;
  arrays[1] = node21;
  arrays[2] = node25;
  arrays[3] = node26;
  arrays[4] = node27;
  arrays[5] = node28;

  fprintf(stdout, "c67:");

  // set a(i,j) = 1 for all i,j
  for(i =2; i<=42; i++) {
    for(j=1; j< i; j++) {
      fprintf(stdout, "x_%d_%d +", i,j);      
    }
  }
  // adjust for a(23,22) =2 and a(26,25) =0
  fprintf(stdout, "x_23_22 - x_26_25");



  //adjust for the non basic variables && clause (a)
  {
    generateLoopConstraint2(s3);
    fprintf(stdout, "+ x_10_9 + x_29_28");
  }
  
  //adjust for the non basic variables && clause(b)
  {
    nodeIndex = 0;
    while(nodes[nodeIndex] != -1) {
      index = nodes[nodeIndex];
      for(i=1; i<=42; i++) {
	if(!((i == index) || contains(i,arrays[nodeIndex]) || contains(i,s3) || contains(i,nodes))) {
	  fprintf(stdout, "- x_%d_%d", (i>index?i:index), (i>index?index:i));	  
	}
      }
      nodeIndex++;
    }
    
    generateAllPairingsConstraint2(nodes); 
    // add basic vars 
    fprintf(stdout, "+x_28_27 + x_28_26 + x_28_21 + x_26_25+  x_27_26 + x_25_10"); 
   
 
  }

  //finally 
  fprintf(stdout, " <= 42\n\n");
}



void  generateAllPairingsConstraint(int* array) 
{
  int i = 0;
  int j,k;
  int firstItem = 1;
  
  while(array[i] != -1)i++;
  for(j = i-1; j >=1; j--) {
    for(k = j-1; k>=0; k--) {
      if(firstItem) 
	firstItem = 0;
      else 
	fprintf(stdout, " + ");
      fprintf(stdout, "x_%d_%d", array[j], array[k]);
    }
  }
}


void  generateAllPairingsConstraint2(int* array) 
{
  int i = 0;
  int j,k;
  int firstItem = 1;
  
  while(array[i] != -1)i++;
  for(j = i-1; j >=1; j--) {
    for(k = j-1; k>=0; k--) {
      fprintf(stdout, " - x_%d_%d", array[j], array[k]);
    }
  }
}



int main(int argc, char** argv) 
{
  int i,j,k;
  int count = 0;
  char* arg;
  int argIndex = 1;
  int generateILP = 0;

  while(argIndex < argc) {
    arg = argv[argIndex++];
    if(strcmp(arg, "-i") == 0)
      generateILP = 1;
    else
      fprintf(stderr, "Invalid arg:%s\n", arg);
  }



 
  fprintf(stdout, "#include \"distances.h\"\n");
  fprintf(stdout, "Minimize\nobj:\n");

  
  for(j=1;j< 42;j++)
    for(i=j+1; i <=42; i++, count++) {
      if(!(j==1 && i==2))
	fprintf(stdout, " + ");
      fprintf(stdout, "c_%d_%d x_%d_%d", i, j, i, j);	
      if(count%5 == 0)
	printf("\n");			
    }

  fprintf(stdout, "\n\nSubject To\n");
  for(i=1; i<=42; i++) {
    for(j=1; j<i; j++) {
      if(!(j==1))
	fprintf(stdout, " + ");
      fprintf(stdout, "x_%d_%d", i, j);
    }
    for(k = i+1;k <=42; k++) {
      if(!(i== 1 && k==2))
	fprintf(stdout, " + ");
      fprintf(stdout, "x_%d_%d", k, i);
    }
    fprintf(stdout, " = 2\n");
  }

  fprintf(stdout, "
x_9_8 <= 1
x_23_22 <= 1
x_33_32 <= 1
x_12_11 <= 1
x_25_24 <= 1
x_35_34 <= 1
x_41_1 <= 1
x_14_13 <= 1
x_27_26 <= 1
x_37_36 <= 1
x_4_3 <= 1
x_15_14 <= 1
x_29_28 <= 1
x_7_6 <= 1
x_20_19 <= 1
x_31_30 <= 1");


  generateLoopConstraint(s1);
  generateLoopConstraint(s2);
  generateLoopConstraint(s3);
  generateLoopConstraint(s4);
  generateLoopConstraint(s5);
  
  generateAllPairingsConstraint(s6); 
  fprintf(stdout, " <= 4\n");

  generateAllPairingsConstraint(s7); 
  fprintf(stdout, " <= 3\n");
  generateConstraint66(); 
  generateConstraint67(); 

  if(generateILP) {
    fprintf(stdout, "\n\nBinary\n");
    for(j=1;j< 42;j++)
      for(i=j+1; i <=42; i++, count++) {
	fprintf(stdout, "x_%d_%d \n", i, j);	
      }
  } else {
    fprintf(stdout, "\n\nBounds\n");
    for(j=1;j< 42;j++)
      for(i=j+1; i <=42; i++, count++) {
	fprintf(stdout, "x_%d_%d >= 0\n", i, j);	
      }




  }
  fprintf(stdout, "\nEnd\n");  
}