1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Mashcka [7]
3 years ago
12

an elevator started at the first floor and went up 18 floors. it then came down 11 floors and went back up 16.at what floor was

it stopped
Mathematics
1 answer:
zzz [600]3 years ago
4 0
Started at first floor
went up 18 floors, so now we are at 1+18 or 19th floor
then cam down 11 floors, so now we are at 19-11 or 8th floor
then went up 16, so now at 16+8 or 24th floor

it stopped at 24th floor
You might be interested in
Using the Breadth-First Search Algorithm, determine the minimum number of edges that it would require to reach
jekas [21]

Answer:

The algorithm is given below.

#include <iostream>

#include <vector>

#include <utility>

#include <algorithm>

using namespace std;

const int MAX = 1e4 + 5;

int id[MAX], nodes, edges;

pair <long long, pair<int, int> > p[MAX];

void initialize()

{

   for(int i = 0;i < MAX;++i)

       id[i] = i;

}

int root(int x)

{

   while(id[x] != x)

   {

       id[x] = id[id[x]];

       x = id[x];

   }

   return x;

}

void union1(int x, int y)

{

   int p = root(x);

   int q = root(y);

   id[p] = id[q];

}

long long kruskal(pair<long long, pair<int, int> > p[])

{

   int x, y;

   long long cost, minimumCost = 0;

   for(int i = 0;i < edges;++i)

   {

       // Selecting edges one by one in increasing order from the beginning

       x = p[i].second.first;

       y = p[i].second.second;

       cost = p[i].first;

       // Check if the selected edge is creating a cycle or not

       if(root(x) != root(y))

       {

           minimumCost += cost;

           union1(x, y);

       }    

   }

   return minimumCost;

}

int main()

{

   int x, y;

   long long weight, cost, minimumCost;

   initialize();

   cin >> nodes >> edges;

   for(int i = 0;i < edges;++i)

   {

       cin >> x >> y >> weight;

       p[i] = make_pair(weight, make_pair(x, y));

   }

   // Sort the edges in the ascending order

   sort(p, p + edges);

   minimumCost = kruskal(p);

   cout << minimumCost << endl;

   return 0;

}

8 0
3 years ago
What's 5*(-2/3+3x) ?
sdas [7]
<span>5*(-2/3+3x)
= 15x - 10/3

hope it helps</span>
7 0
3 years ago
Is 13.48 irrational or rational? ​
S_A_V [24]

Answer:

It is irrational

Step-by-step explanation:

Rational numbers do not have decimals.

7 0
3 years ago
Read 2 more answers
N/24-40=37 solve for n
gulaghasi [49]

Answer:1848

Step-by-step explanation:

good luck with the test or whatever you are doing

5 0
2 years ago
Jerome's sister told him to multiply both the amount of water and the amount of drink
Arada [10]

Answer:

×1 = 3 : 8.

×2 = 6 : 16

×3 = 9 : 24

×4 = 12 : 32

Step-by-step explanation:

5 0
2 years ago
Other questions:
  • A wildlife conservancy maintains a ratio of 2 squirrels for every 8 birds how many birds would there be if there were 15 squirre
    14·1 answer
  • A piece of art is in the shape of an equilateral triangle with sides of 6 in. Find the area of the piece of art. Round your answ
    12·2 answers
  • In a_____ tax system, the tax rate gets higher as the taxable income gets larger
    14·1 answer
  • Can anyone help me on this thanks
    12·1 answer
  • Carl earned grades of 62, 78, 59, and 89 on four math tests.
    6·1 answer
  • Please answer the questions
    9·1 answer
  • 5. Find the value of the variables. If your answer is not an integer, leave it in simplest radical
    14·1 answer
  • EMERGENCY!!!!!!!!!!!!!!
    7·1 answer
  • How young am I if you get it right I will mark you Brainliest
    10·2 answers
  • Is (2, 2) a solution of the inequality y ≤ 3x - 5?
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!