File size: 1,290 Bytes
c4b0eef |
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 66 67 68 69 70 |
#include <bits/stdc++.h>
using namespace std;
int n, m, nCase = 1;
vector <int> A, B, C;
void printHanoi()
{
int aLen = A.size(), bLen = B.size(), cLen = C.size();
printf("A=>");
if( aLen )
{
printf(" ");
for(int i=0 ; i<aLen ; i++) printf(" %d", A[i]);
}
printf("\nB=>");
if( bLen )
{
printf(" ");
for(int i=0 ; i<bLen ; i++) printf(" %d", B[i]);
}
printf("\nC=>");
if( cLen )
{
printf(" ");
for(int i=0 ; i<cLen ; i++) printf(" %d", C[i]);
}
printf("\n\n");
}
void towersOfHanoi(int n, vector <int> &A, vector <int> &B, vector <int> &C)
{
if( !m ) return;
if( n==1 )
{
C.push_back(A.back());
A.pop_back();
printHanoi();
m--;
return;
}
towersOfHanoi(n-1, A, C, B);
if( !m ) return;
C.push_back(A.back());
A.pop_back();
printHanoi();
m--;
if( !m ) return;
towersOfHanoi(n-1, B, A, C);
}
int main()
{
while( scanf("%d %d", &n, &m)==2 && (n || m) )
{
A.clear(), B.clear(), C.clear();
for(int i=n ; i>=1 ; i--) A.push_back(i);
printf("Problem #%d\n\n", nCase);
printHanoi();
towersOfHanoi(n, A, B, C);
nCase++;
}
return 0;
}
|