ScenarioListen to this story: a boy and his father, a computer programmer, are playing with wooden blocks. They are building a pyramid.Their pyramid is a bit weird, as it is actually a pyramid-shaped wall – it's flat. The pyramid is stacked according to one simple principle: each lower layer contains one block more than the layer above.The figure illustrates the rule used by the builders:Your task is to write a program which reads the number of blocks the builders have, and outputs the height of the pyramid that can be built using these blocks.Note: the height is measured by the number of fully completed layers – if the builders don't have a sufficient number of blocks and cannot complete the next layer, they finish their work immediately.

The Surface Area of a square pyramid is 3600 ft2. The slant height is 80 feet and the base is 20 feet. At most how many 1 foot cubic blocks can be stuffed in the pyramid?(*Some of the blocks might have to be cut up to fit into crevices*)

Kyle is creating a sizeable square pyramid out of aluminum. He needs to know how many square feet of aluminum to buy at the hardware store.The pyramid has a square base with sides 3 feet long and a slant height of 5 feet.The area of the base is Blank 1 Question 9 ft2, and the total surface area is Blank 2 Question 9 ft 2.

Pyramid A is a square pyramid with a base side length of 18 inches and a height of 9 inches. Pyramid B has a volume of 3,136 cubic inches. How many times bigger is the volume of pyramid B than pyramid A? Give your answer as a percentage. Provide an explanation and proof for your answer to receive full credit.

Maricruz have a lot of cards, she always uses her cards to build pyramids as shown in the following image:A pyramid card of 3 levels. She always wonder how many cards does she need to make a pyramid card of N levels. Your task is to answer that question.InputThe first line of the input contains an integer 1 <= T <= 1,000. Each of the following T lines will have an integer 1 <= N <= 1,000,000.OutputFor each case, output a single line consisting of the number of cards needed to build a pyramid card of level N modulo 1,000,007.ExampleInput Example237Output Example1577 Submit solution!

int furthestBuilding(vector<int>& heights, int bricks, int ladders) { int n=heights.size(); int count=0; for(int i=0;i<n-1;i++){ if(heights[i]<heights[i+1]){ int diff=heights[i+1]-heights[i]; if(bricks>diff){ count++;… return count; }};