Tidy up the code a little.

Author: teo-tsirpanis

SetCoveringProblem.c

@@ -8,6 +8,7 @@ void afairesi(int a,int b,int pl,int number,int table[pl][number],int arxikoCoun
 bool check(int pl,int uncoveredCount[pl]);
 bool red(int keep,int k,int pl,int number,int table[pl][number],int arxikoCount[pl],int uncoveredCount[pl],int metabalomenoCount[pl],int col_table[number]);
 bool yellow(int k,int keep,int pl,int uncoveredCount[pl],int metabalomenoCount[pl],int number,int col_table[number]);
+
 //import data
 int main(){
     int i,j,pl,number,ap;
@@ -34,11 +35,11 @@ int main(){
         uncoveredCount[i] = 0;
     }
     for(i=0; i<number; i++){
+        sum = 0;
         for(j=0; j<pl; j++){
-            if(table[j][i] == 1)sum = sum + 1;
+            if(table[j][i] == 1)sum++;
         }
         col_table[i] = sum;
-        sum = 0;
     }
     for(i=0; i<pl; i++){
         for(j=0; j<number; j++){
@@ -93,13 +94,13 @@ bool check(int pl,int uncoveredCount[pl]){
 void afairesi(int a,int b,int pl,int number,int table[pl][number],int arxikoCount[pl],int uncoveredCount[pl],int metabalomenoCount[pl],int col_table[number],int keep){
     int k,l;
     for(k=0; k<number; k++){
-            if(table[keep][k] == 1 && !(red(keep,k,pl,number,table,arxikoCount,uncoveredCount,metabalomenoCount,col_table))){
-                for(l=a; l<b; l++){
-                    if(table[l][k] == 1){
-                        uncoveredCount[l]--;
-                    }
+        if(table[keep][k] == 1 && !(red(keep,k,pl,number,table,arxikoCount,uncoveredCount,metabalomenoCount,col_table))){
+            for(l=a; l<b; l++){
+                if(table[l][k] == 1){
+                    uncoveredCount[l]--;
                 }
             }
+        }
     }
 }