Snake and Ladder

Snakes and ladders is a very popular game. It's a 10x10 maze, with cells numbered from 0 to 99, and filled with snakes and ladders, as shown below in the figures. Every player gets a chance to play and advance in the maze, depending on the number they get on the dice when thrown.

The advancement is in the increasing order from 0 to 99. All players start from cell numbered 0 (zero) and attempt to reach to cell numbered 99. The player who reaches first to cell number 99, is the winner. If the game is stopped in between, the player closest to cell 99 in number is the winner. Assume that both players will never be on the same cell when the game is stopped.

If a player after tossing the dice lands on a cell, where the snake opens it's mouth, then the player gets a penalty to retreat to the tail of the snake. While, if the player reaches the foot of a ladder, then the player climbs directly to the top of the ladder. In the example figure here, the snake has its mouth on cell 96 and its tail on cell 13, while the ladder has foot on cell 26 while its top is on cell 87.

If there is another snake (or ladder) waiting at the tail of a snake, a player slide down (or climb up) that second snake (or ladder), and so on as required. A cell will never have a mouth of a snake and a foot of a ladder simultaneously. As such, the snake and ladder are similar, in that when a player lands on a particular cell, they transport the player to another cell. Except for the fact that, snake take a player away from finishing line, while ladder takes a player closer.

Write a program to simulate the game. There will be two players, named A and B, who toss the dice alternately. The program should output the name of the player at the highest position (closest to 99), along with the player's cell number.

Input Specification:

• The first line of input will contain a single integer N, stating the number of snakes and ladders.
• Next N lines each will contain a pair of integers. Each pair will describe either a snake  or ladder by its start cell and an end cell. For example, for a snake, start cell will be higher than end cell. Refer to the first sample input case which describes the board in the figure above.
• Following line of input has a single integer D, indicating the number of moves (dice throws) made by both players A and B.
• Last line contains D integers, each indicating a dice throw, alternately made by A and B. First throw is made by player A. Each dice throw is an integer between 1 to 6.

Sample Input and Output:

Input:
2
26 87
96 13
18
413263632442115246
Output:
B 24
Input:
3
13 98
98 0
6 13
10
5133114161
Output:
B1

Logic:

Available soon .....

Solution: 

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int p1=0,p2=0;
    int snk[100][2];
    int num=0,move=0,dice=0;
    int i,j,flag=0;    //0-A 1-B
    scanf("%d",&num);

    for(i=0;i<num;i++)
    {
        scanf("%d %d",&(snk[i][0]),&(snk[i][1]));
    }
    
    scanf("%d",&move);
    
    for(i=0;i<move;i++)
    {
        scanf("%d",&dice);
        if(flag==0)    //Player A
        {
            p1=p1+dice;
            //Checking for snake and Stairs
            for(j=0;j<num;j++)
            {
                if(snk[j][0]==p1)
                {
                    p1=snk[j][1];
                    j=-1;
                }
            }
            flag=1;
        }
        else    //Player B
        {
            p2=p2+dice;
            //Checking for snake and Stairs
            for(j=0;j<num;j++)
            {
                if(snk[j][0]==p2)
                {
                    p2=snk[j][1];
                    j=-1;
                }
            }
            flag=0;
        }
        
        if(p1>98 || p2>98)
        break;   
    }
    if(p1>p2)    //Player 1 wins
    printf("A %d\n",p1);
    else
    printf("B %d\n",p2);

    return 0;
}