Calculate tabulation method using C/C++ DLD

Calculating tabulation method for 4 literal function is not an easy task in programming. However you can find here the complete code to find out correct answer.
The only person who exactly knows how tabulation is calculated mathematically can understand this program. As you know programming is nothing but converting our long tasks in short to save our time. In the same sequence as we solve this method on paper all the methods are implemented like first one bit shifted literals are separated then same bit difference elements are eliminated and finally answer is calculated. 

Tabulation Method Code in C++ 

#include<iostream> #include<conio.h> using namespace std; int i,j,k,m; //variables used for loop int terms=0; //Used to know number of terms int fincrease=0; //1st time counts 1 bit shifted number of arrays int fincrease1=0; //2nd time counts 1 bit shifted number of arrays int count=0; //Used to find 1 bit difference B/W two entities int haris=0; //Used to manage prime implicants //Find1 starts from here void find1(int terms, int f1[][4] , int ain[][4]) { for(m=0; m<terms-1; m++) for(i=1; i<terms; i++) { count=0; for(j=0; j<4; j++) { if(ain[m][j]==ain[i][j]) count++; } if(count==3) { for(k=0; k<4; k++) { if(ain[m][k]==ain[i][k]) f1[fincrease][k]=ain[i][k]; else { f1[fincrease][k]=5; } }} else { fincrease--; } fincrease++;} } //find1 ends here //F2 starts here void find2(int f1[][4]) { for(int m=0; m<fincrease-1; m++) for(i=1; i<fincrease; i++) { count=0; for(j=0; j<4; j++) { if(f1[m][j]==f1[i+m][j]) { count++;} } if(count==4) { for(k=0; k<4; k++) f1[i+m][k]=8; }}} //Find2 ends here //Find3 starts from here void find3(int o , int f1[][4] , int f2[][4]) { fincrease1=-1; for(m=0; m<o-1; m++) { haris=0; for(i=m+1; i<o; i++) { count=0; for(j=0; j<4; j++) { if(f1[m][j]==f1[i][j]) count++; } if(count==3 && f1[m][2]!=8) { haris=10; fincrease1++; for(k=0; k<4; k++) { if(f1[m][k]==f1[i][k]) f2[fincrease1][k]=f1[i][k]; else { f2[fincrease1][k]=5; }} for(k=0; k<4; k++) f1[i][k]=8; } } if(haris==0) { fincrease1++; for(k=0; k<4; k++) { f2[fincrease1][k]=f1[m][k]; } } } } //Find3 ends here //Main Function main() { int arr[16][4]={{0,0,0,0},{0,0,0,1},{0,0,1,0},{0,0,1,1},{0,1,0,0},{0,1,0,1},{0,1,1,0},{0,1,1,1},{1,0,0,0},{1,0,0,1},{1,0,1,0},{1,0,1,1},{1,1,0,0},{1,1,0,1},{1,1,1,0},{1,1,1,1}}; //Input area cout<<endl; cout<<"Enter how many terms of Sum Of Products: "; cin>>terms; if(terms<3) { cout<<"Sorry few number of terms can't be simplified\n using tabular method"; getch(); exit(0); } int ain[terms][4]={}; //Here input will be available int f1[200][4]={}; //1st time 1 bit shifted element's answer will appear int f2[200][4]={}; //2nd time 1 bit shifted element's answer will appear int f3[200][4]={}; //Contains Answer cout<<"Input your Sum of Products: "; for(j=0; j<terms; j++) { cin>>ain[j][4]; //Each input will be pass to switch switch(ain[j][4]) { case 0: for(i=0; i<4; i++) ain[j][i]=arr[0][i]; break; case 1: for(i=0; i<4; i++) ain[j][i]=arr[1][i]; break; case 2: for(i=0; i<4; i++) ain[j][i]=arr[2][i]; break; case 3: for(i=0; i<4; i++) ain[j][i]=arr[3][i]; break; case 4: for(i=0; i<4; i++) ain[j][i]=arr[4][i]; break; case 5: for(i=0; i<4; i++) ain[j][i]=arr[5][i]; break; case 6: for(i=0; i<4; i++) ain[j][i]=arr[6][i]; break; case 7: for(i=0; i<4; i++) ain[j][i]=arr[7][i]; break; case 8: for(i=0; i<4; i++) ain[j][i]=arr[8][i]; break; case 9: for(i=0; i<4; i++) ain[j][i]=arr[9][i]; break; case 10: for(i=0; i<4; i++) ain[j][i]=arr[10][i]; break; case 11: for(i=0; i<4; i++) ain[j][i]=arr[11][i]; break; case 12: for(i=0; i<4; i++) ain[j][i]=arr[12][i]; break; case 13: for(i=0; i<4; i++) ain[j][i]=arr[13][i]; break; case 14: for(i=0; i<4; i++) ain[j][i]=arr[14][i]; break; case 15: for(i=0; i<4; i++) ain[j][i]=arr[15][i]; break; default: cout<<" Wrong input and wil result in error\n"; } } //Functions called to simplify Some of products find1(terms , f1,ain); find2(f1); find3(fincrease,f1,f2); find2(f2); if(fincrease1<=0) { if(f2[0][1]==8 ||f2[0][0]==0 ) cout<<"Sorry no solution is possible"; getch(); exit(0); } //Here is output of program cout<<"\nSimplified funtion of your sum of products is:\n\n\n"; for(i=0; i<fincrease1; i++) { switch(f2[i][0]) { case 0: cout<<"W"; break; case 1: cout<<"w"; break; default: { cout<<""; break;} } switch(f2[i][1]) { case 0: cout<<"X"; break; case 1: cout<<"x"; break; default: { cout<<""; break; } } switch(f2[i][2]) { case 0: cout<<"Y"; break; case 1: cout<<"y"; break; default: { cout<<""; break; }} switch(f2[i][3]) { case 0: cout<<"Z"; break; case 1: cout<<"z"; break; default: { cout<<""; break;} } if(f2[i][0]==8) { } else if(i+1<fincrease1) cout<<" + "; else { } } //Credits to Programmer cout<<"\n\n***********\n"; cout<<"Program created by\n\n"; cout<<" Programmer name here\n\n"; cout<<" Roll No here\n"; cout<<"***********"; getch(); }