Computers and Technology, 20.10.2020 22:01 gabriellestaleyga16
Tony Stark wants to build a 1000 meter high tower as quickly as possible. He has unlimited resources and an unlimited budget and is willing to spend any amount to get the job done.
He has chosen to build the tower with blocks that are 100 meters long and 100 meters wide, but only 1 meter tall. The blocks interlock on top and bottom (like legos). They cannot be stacked sideways.
Using special lifters, putting one block on top of another block takes one week. Putting a stack of up to 100 blocks on top of another stack of 100 or less also takes a week. If either stack is more than 100, it takes two weeks.
What is the shortest amount of time that it will take to build the tower?
Why is your answer the shortest amount of time?
How did you solve the problem? What is your algorithm?
Answers: 2
Computers and Technology, 22.06.2019 11:50
You have written, as part of a school assignment, a research paper on the solar system. you want to share this paper on your school website. on which type of server will you upload it?
Answers: 1
Computers and Technology, 22.06.2019 19:20
Terri needs to insert a cover page into her document. where should she go to access the commands to do so? o insert tab, objects group o insert tab, illustrations group o insert tab, pages group o insert tab, media group submit
Answers: 1
Computers and Technology, 22.06.2019 20:00
Amanda needs to create an informative print brochure for her local library’s fundraiser dinner. what critical detail must she have before she starts designing the brochure?
Answers: 1
Computers and Technology, 23.06.2019 07:30
What key should you press and hold to select and open multiple files at one time? enter alt control esc
Answers: 1
Tony Stark wants to build a 1000 meter high tower as quickly as possible. He has unlimited resources...
Mathematics, 20.07.2019 23:30
History, 20.07.2019 23:30
History, 20.07.2019 23:30
History, 20.07.2019 23:30
Biology, 20.07.2019 23:30
History, 20.07.2019 23:30
Social Studies, 20.07.2019 23:30
English, 20.07.2019 23:30
History, 20.07.2019 23:30
History, 20.07.2019 23:30