Question

Can someone please help me with this C++ problem?

Let's Play Chutes and Ladders!

The board is shown below.

Use a map structure to store all the chutes and ladders movements

• Key is the starting square
• Value is the final movement square
• EXAMPLE: std::make_pair(95, 75) handles one chute I see (Fall from 95 to 75)
• Both types can be stored in the same structure since they don't share spaces
• It looks like there are 9 ladders and 10 chutes total?

Our version of the game is played as follows:

• Start on square 0
• Roll two normal six -sided dice and move that many squares
• If you land on a ladder, move up accordingly
• If you land on a chute, move down accordingly
• If you end your turn on square 100 or above you are done
• Print out each move
• Print out the number of total moves made (Chutes/Ladders movements don't count)

Example Output

0 8 13 16=>6 17 28=>84 92 95=>75 86 97 102    MOVES = 10


96 INNA 100 95 831 86 87 3 88 85 89 90 8079 62 63 66 60 59 58 57 5453 51 55 56 42 43 45 46 49 50 44 40 37 33 35 34 26 27 23 24 29 30 25 20 16

Answer 1

#include <bits/stdc++.h>
using namespace std;

int main()
{
// map to store pair of ladders and chutes values
map<int,int> chutesLadders;
  
// making pair of ladders
chutesLadders.insert(pair<int,int>(1,38));
chutesLadders.insert(pair<int,int>(4,14));
chutesLadders.insert(pair<int,int>(9,31));
chutesLadders.insert(pair<int,int>(28,84));
chutesLadders.insert(pair<int,int>(21,42));
chutesLadders.insert(pair<int,int>(36,44));
chutesLadders.insert(pair<int,int>(51,67));
chutesLadders.insert(pair<int,int>(71,91));
chutesLadders.insert(pair<int,int>(80,100));
  
// making pair of chutes
chutesLadders.insert(pair<int,int>(16,6));
chutesLadders.insert(pair<int,int>(62,19));
chutesLadders.insert(pair<int,int>(87,24));
chutesLadders.insert(pair<int,int>(47,26));
chutesLadders.insert(pair<int,int>(49,11));
chutesLadders.insert(pair<int,int>(56,53));
chutesLadders.insert(pair<int,int>(64,60));
chutesLadders.insert(pair<int,int>(93,73));
chutesLadders.insert(pair<int,int>(95,75));
chutesLadders.insert(pair<int,int>(98,78));

// key is initial position and value is final position
int key=0, value=100;
  
// position will keep track the position of a person
// count will count the nuumber of times the dice thrown
// or moves needed to reach 100
int position=key, flag=1, count=0;
  
// dice1 and dice2 will have random numbers
int dice1, dice2;
  
// loop unitl we react at 100 or further
while(position<100) {
  
// dice first random value
dice1 = rand() % 6 + 1;
  
// dice second random value
dice2 = rand() % 6 + 1;
  
// current position of the person
position+=dice1+dice2;
  
// check if a person step on the chute or Ladder
if(chutesLadders.find(position) != chutesLadders.end()) {
cout<<position<<"=>";
position = chutesLadders[position];
cout<<position<<" ";
flag=0;
}
  
// will print currect position
if(flag) {
cout<<position<<" ";
}
  
flag=1;
  
// increase it's value on every count
count++;
}

cout<<" MOVES "<<count;
return 0;
}

#include <bits/stdc++.h> using namespace std; int main() // map to store pair of ladders and chutes values map<int, int> chutesLadders; // making pair of ladders chutesLadders.insert(pairsint, int>(1,38)); chutesLadders.insert(pair int, int>(4,14)); chutesLadders.insert(paircint, int>(9,31)); chutesLadders.insert(pair int, int>(28,84)); chutesLadders.insert(pairsint, int>(21,42)); chutesLadders.insert(pair int, int>(36,44)); chutesLadders.insert(pair int, int>(51,67)); chutesLadders.insert(pair int, int>(71,91)); chutesLadders.insert(pair int, int>(80, 100)); // making pair of chutes chutesLadders.insert(pairsint, int>(16,6)); chutesLadders.insert(pair int, int>(62,19)); chutesLadders.insert(pair int, int>(87,24)); chutesLadders.insert(pairsint, int>(47,26)); chutesLadders.insert(paircint, int>(49, 11)); chutesLadders.insert(pair int, int>(56,53)); chutesLadders.insert(pair int, int>(64,60)); chutesLadders.insert(pairsint, int>(93,73)); chutesLadders.insert(pair<int, int>(95,75)); chutesLadders.insert(pair int, int>(98,78)); // key is initial position and value is final position int key=0, value=100; // position will keep track the position of a person // count will count the number of times the dice thrown // or moves needed to reach 100 int position=key, flag=1, count=0; 17 dicel and dice2 will have random numbers int dicei, dice2; // loop unitl we react at 100 or further

1/ loop unitl we react at 100 or further while(position<100) { // dice first random value dice1 = rand() % 6 + 1; // dice second random value dice2 = rand() % 6 + 1; 1/ current position of the person position+=dicel+dice2; // check if a person step on the chute or Ladder if (chutesLadders.find(position) != chutesLadders.end()) { cout<<position<<"=>"; position = chutesLadders (position); cout<<position<<" "; flag=0; // will print currect position if(flag) { cout<<position<<" "; flag=1; // increase it's value on every count count++; cout<<" MOVES "<<count; return 0;

// Hope it will be helpful, don't forget to upvote the answer, really appreciated.