-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathTowerOfHanoi.cpp
68 lines (36 loc) · 879 Bytes
/
TowerOfHanoi.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
using namespace std;
void move(int n, char src, char helper , char dest){
if (n ==0) return;
move(n-1,src,dest,helper);
cout<<"Shift disl"<<n << "from" <<src << "to" <<dest<<endl;
move(n-1,helper,src,dest);
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
int n;
cin>>n;
move(n,'A','B','C');
binary consist of only 0 and 1
map<char,int> a[100];
for(int i=0; i< str.len(); i++) {
a[str]++;
}
for(ans: a) {
cout<<ans.key<<ans.value;
}
for(int i = 0; i < col ; i ++) {
for (int j = 0; j < row; j++) {
if(mat[j][i] == 1) {
ans = i;
break;
}
}
}
retrun 0;
}