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 71 72 73
|
#include <iostream>
//-------------------------
// Legend:
// 0: Empty space
// 1: Route node
// 2: End (finish line)
//-------------------------
int Grid[ 4 ][ 4 ] =
{
{ 0, 0, 1, 0 },
{ 0, 1, 1, 0 },
{ 0, 1, 0, 0 },
{ 0, 2, 0, 0 }
};
#define SPACE "[ ]"
bool Finished( false );
void FindNextPos( void )
{
for( int Row( 0 ); Row < 4; Row++ )
{
for( int Col( 0 ); Col < 4; Col++ )
{
if( Grid[ Row ][ Col ] == 1 )
{
Grid[ Row ][ Col ] = 0;
// Print the coords.
std::cout << "Node at[ r ][ c ]: " << ( Row + 1 ) << " " << ( Col + 1 ) << std::endl;
return;
}
else if( Grid[ Row ][ Col ] == 2 )
{
Finished = true;
std::cout << "finish line at[ r ][ c ]: " << ( Row + 1 ) << " " << ( Col + 1 ) << std::endl;
return;
}
}
}
}
void PrintRoute( void )
{
for( int Row( 0 ); Row < 4; Row++ )
{
for( int Col( 0 ); Col < 4; Col++ )
{
if( Grid[ Row ][ Col ] == 0 )
std::cout << SPACE;
else
std::cout << "[ 1 ]";
}
std::cout << std::endl;
}
}
int main( )
{
PrintRoute( );
while( !Finished )
FindNextPos( );
std::cin.get( );
return 0;
}
|