c ++ recursive algorithm [] Hanoi Tower problem

A recursive water problem, do not say 2 words, put directly Code:

 1 #include<iostream>
 2 using namespace std;
 3 int k;
 4 void move(int m,char a,char b,char c)
 5 {
 6     if(m==0) return;
 7     else
 8     {
 9         move(m-1,a,c,b);
10         k++;
11         cout<<a<<">"<<c<<endl;
12         move(m-1,b,a,c);
13     }
14 }
15 int main()
16 {
17     int n;
18     cin>>n;
19     move(n,'A','B','C');
20     return 0;
21 }

Vatican tower water problem issue