#include #include #include using namespace std; // CROSSWORDS CRUSH // SOLO LEARN VERSION 1.0 // AUTHOR : HASSAN SAJJAD // BUGS KNOWN : UNKNOWN // DATE CREATED : 31/12/2017 // // IT JUST SHOWS THE RESULT // // CHECK DESKTOP VERSION FOR COMPLETE SOLUTION // // UPLOADED AFTER THOROUGH TESING // // // int **a; int lines; int w; const char **keep; void hvcfind(string *vertical, string *horizontal, string *crossright,string*words); void stringmaker(string *p,string *words); void function(); void input(); int main() { input(); //result finally for (int i = 0; i < lines; i++) { cout << endl; for (int j = 0; j < lines; j++) (a[i][j] == 0) ? cout << " " : cout << keep[i][j]; } cout << endl; return 0; } void input() { lines = 8; function(); string *p = new string[lines]; p[0] = "MANGOTZA"; p[1] = "YSEKSNNZ"; p[2] = "JSGMLWZA"; p[3] = "SXNGOOVP"; p[4] = "PWAWLHEP"; p[5] = "SWRJWNDL"; p[6] = "HNOLPAHE"; p[7] = "ANANABUI"; w = 5; string *words = new string[w]; words[0] = "BANANA"; words[1] = "MANGO"; words[2] = "ORANGE"; words[3] = "APPLE"; words[4] = "WOW"; stringmaker(p,words); } void stringmaker(string *p,string*words) { keep = new const char *[lines]; for (int i = 0; i < lines; i++) { keep[i] = new char[lines+1]; } for (int i = 0; i < lines; i++) { keep[i] = p[i].c_str(); } //strings for finding string *vertical = new string[lines]; string *horizontal = new string[lines]; string *crossright = new string[(2 * lines) - 1]; string *crossleft = new string[(2 * lines) - 1]; //Assigning these strings for (int i = 0; i < lines; i++) {//horizontal assignment horizontal[i] = keep[i]; for (int j = 0; j < lines; j++) {//vertical assignment vertical[i].append(1, keep[j][i]); } } //crossright assignment int r = 0, s = 0; for (int i = lines - 1; i >= 0; i--) { r = 0; s = i; while (r < lines && s < lines) { crossright[(lines - i) - 1].append(1, keep[r][s]); r = r + 1; s = s + 1; } if (i == 0) { for (int j = 1; j < lines; j++) { r = j; s = 0; while (r < lines && s < lines) { crossright[j + (lines-1)].append(1, keep[r][s]); r = r + 1; s = s + 1; } } } } //crossleft assignment for (int i = 0; i < lines; i++) { r = i; s = 0; while (r >= 0) { crossleft[i].append(1, keep[r--][s++]); } if (i == (lines - 1)) { for (int j = 1; j < lines; j++) { r = lines - 1; s = j; while (s < lines) { crossleft[i + j].append(1, keep[r--][s++]); } } } } int num = 0; while (num < 2) { int fi1; int fi2; int fi3; int fi4; int fi5; int fi6; for (int i = 0; i < w; i++) { fi1 = -1; fi2 = -1; for (int j = 0; j < lines; j++) { fi1 = horizontal[j].find(words[i]); fi2 = vertical[j].find(words[i]); if (fi1 != -1) { for (int k = 0; k < words[i].length(); k++) { a[j][fi1++] = 1; } } if (fi2 != -1) { for (int k = 0; k < words[i].length(); k++) { a[fi2++][j] = 1; } } } //for loop for crossright matching int r = 0, s = 0; for (int j = 0; j < lines; j++) { fi3 = crossright[j].find(words[i]); if (fi3 != -1) { r = fi3; s = fi3 + (lines - 1) - j; for (int k = 0; k < words[i].length(); k++) { a[r++][s++] = 1; } } if (j == 0) { for (int k = 1; k < lines; k++) { fi4 = crossright[k + (lines - 1)].find(words[i]); if (fi4 != -1) { r = k + fi4; s = fi4; for (int l = 0; l < words[i].length(); l++) { a[r++][s++] = 1; } } } } } //Crossleft Matching for (int j = 0; j < lines; j++) { fi5 = crossleft[j].find(words[i]); if (fi5 != -1) { r = j - fi5; s = fi5; for (int k = 0; k < words[i].length(); k++) { a[r--][s++] = 1; } } if (j == 0) { for (int k = 1; k < lines; k++) { fi6 = crossleft[j + (lines - 1)].find(words[i]); if (fi5 != -1) { r = lines-k-fi6; s = k+fi6; for (int l = 0; l < words[i].length(); l++) { a[r++][s++] = 1; } } } } } } int mu; string *wordscopy = new string[w]; for (int i = 0; i < w; i++) { wordscopy[i] = words[i]; mu = words[i].length(); words[i].clear(); for (int j = mu-1; j >=0; j--) { words[i].append(1, wordscopy[i].at(j)); } } num++; } } void function() { a = new int *[lines]; for (int i = 0; i < lines; i++) { a[i] = new int[lines]; } for (int i = 0; i < lines; i++) { for (int j = 0; j < lines; j++) { a[i][j] = 0; } } }

Crosswords Crush(solo learn version)