Merge pull request div-bargali#827

Merge pull request div-bargali#827

Author: div-bargali

C++/Algorithms/Backtracking/CROOSWARD.cpp

@@ -0,0 +1,82 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+vector<string> grid(10);
+vector<string> words;
+bool f;
+
+void call(int ind)
+{
+ if(!f) {
+ return;
+ }
+ if(ind == words.size()) {
+ if(f) {
+ for(auto word: grid) {
+ cout<<word<<endl;
+ }
+ f=false;
+ }
+ return;
+ }
+ int i,j,p,q,k;
+ for(i=0;i<10;++i) {
+ for(j=0;j<10;++j) {
+ p=i,q=j;
+ for(k=0;k<words[ind].size() && p+k<10;++k) {
+ if(grid[p+k][q] != '-' && grid[p+k][q] != words[ind][k]) {
+ break;
+ }
+ }
+
+ if(k==words[ind].size()) {
+ vector<string> temp = grid;
+ for(k=0;k<words[ind].size();++k) {
+ grid[p+k][q] = words[ind][k];
+ }
+ call(ind+1);
+ grid = temp;
+ }
+
+ for(k=0;k<words[ind].size() && q+k<10;++k) {
+ if(grid[p][q+k] != '-' && grid[p][q+k] != words[ind][k]) {
+ break;
+ }
+ }
+
+ if(k==words[ind].size()) {
+ vector<string> temp = grid;
+ for(k=0;k<words[ind].size();++k) {
+ grid[p][q+k] = words[ind][k];
+ }
+ call(ind+1);
+ grid = temp;
+ }
+ }
+ }
+}
+
+int main()
+{
+ f=true;
+
+ int i,j;
+ for(i=0;i<10;++i) {
+ cin>>grid[i];
+ }
+
+ string s,w;
+ cin>>w;
+
+ for(auto x: w) {
+ if(x==';') {
+ words.push_back(s);
+ s="";
+ } else
+ s+=x;
+ }
+ words.push_back(s);
+ call(0);
+
+ return 0;
+}

C++/Algorithms/Backtracking/RAT IN MAZE problem.cpp

@@ -0,0 +1,59 @@
+
+#include<bits/stdc++.h>
+using namespace std;
+
+
+void printSolution(int** solution,int n){
+for(int i=0;i<n;i++){
+for(int j=0;j<n;j++){
+cout << solution[i][j] << " ";
+}
+}
+cout<<endl;
+}
+void mazeHelp(int maze[][20],int n,int** solution,int x,int y){
+
+
+if(x == n-1 && y == n-1){
+solution[x][y] =1;
+printSolution(solution,n);
+	solution[x][y] =0;
+return;
+}
+if(x>=n || x<0 || y>=n || y<0 || maze[x][y] ==0 || solution[x][y] ==1){
+return;
+}
+solution[x][y] = 1;
+mazeHelp(maze,n,solution,x-1,y);
+mazeHelp(maze,n,solution,x+1,y);
+mazeHelp(maze,n,solution,x,y-1);
+mazeHelp(maze,n,solution,x,y+1);
+solution[x][y] = 0;
+}
+void ratInAMaze(int maze[][20], int n){
+
+ int** solution = new int*[n];
+ for(int i=0;i<n;i++){
+	solution[i] = new int[n];
+ }
+ mazeHelp(maze,n,solution,0,0);
+
+
+}
+
+
+
+int main(){
+
+ int n;
+ cin >> n ;
+ int maze[20][20];
+ for(int i = 0; i < n ;i++){
+for(int j = 0; j < n; j++){
+	cin >> maze[i][j];
+ }
+ }
+ ratInAMaze(maze, n);
+}
+
+