Riyafa Abdul Hameed riyafa
fuyufjh
/ baguenaudier.cpp
Created
July 23, 2016 18:19
Algorithm to solve Baguenaudier (aka. Chinese Rings)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <cstdio> | |
| #include <algorithm> | |
| const int MAX_N = 20; | |
| int n; | |
| bool state[MAX_N]; | |
| int count_op = 0; | |
| void print_state() | |
| { |