Hello **Programmers/Coders,** Today we are going to share ** solutions of Programming problems of HackerRank of Programming Language C **. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight you profile to the recruiters.

In this post, you will find the solution for **Boxes through a Tunnel in C-HackerRank Problem**. We are providing the **correct and tested solutions** of coding problems present on **HackerRank**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**C **is one of the most widely used **Programming Languages**. it is basically used to build **Operating System**. **C **was developed by **Dennis Ritchie in 1972**. Below are some examples of **C Programming** which might you understanding the **basics of C Programming.**

**Read Also Articles**

- Computer Simulations Coursera Quiz Answers 2022 | All Weeks Assessment Answers [💯Correct Answer]
- Social Network Analysis Coursera Quiz Answers 2022 | All Weeks Assessment Answers [💯Correct Answer]
- Big Data, Artificial Intelligence, and Ethics Coursera Quiz Answers 2022 | All Weeks Assessment Answers [💯Correct Answer]

### Objectives

You are transporting some boxes through a tunnel, where each box is a parallelepiped, and is characterized by its length, width and height.The height of the tunnel * 41 *feet and the width can be assumed to be infinite. A box can be carried through the tunnel only if its height is strictly less than the tunnel’s height. Find the volume of each box that can be successfully transported to the other end of the tunnel. Note: Boxes cannot be rotated.

**Input Format**

The first line contains a single integer n, denoting the number of boxes.* n* lines follow with three integers on each separated by single spaces –

*,*

**length**i*and*

**width**i*which are length, width and height in feet of the*

**height**i*-th box.*

**i****Constraints**

**1<=n<=100****1<=***length**i***,***height**i***,***width**i***<=100**

**Output Format**

For every box from the input which has a height lesser than ** 41 **feet, print its volume in a separate line.

**Sample Input 0**

45551240105417242

**Sample Output 0**

12580

**Explanation 0**

The first box is really low, only** 5 **feet tall, so it can pass through the tunnel and its volume is

*The second box is sufficiently low, its volume is*

**5 * 5 * 5 = 125***The third box is exactly*

**1 * 2 * 40 = 80***feet tall, so it cannot pass. The same can be said about the fourth box.*

**41**Boxes through a Tunnel C – Hacker Rank Solution

#include <stdio.h> #include <stdlib.h> #define MAX_HEIGHT 41 struct box { /** * Define three fields of type int: length, width and height */ int length; int width; int height; }b; typedef struct box box; int get_volume(box b) { /** * Return the volume of the box */ return (b.length*b.width*b.height); } int is_lower_than_max_height(box b) { /** * Return 1 if the box's height is lower than MAX_HEIGHT and 0 otherwise */ if(b.height > 40) { return 0; } else { return 1; } } int main() { int n; scanf("%d", &n); box *boxes = malloc(n * sizeof(box)); for (int i = 0; i < n; i++) { scanf("%d%d%d", &boxes[i].length, &boxes[i].width, &boxes[i].height); } for (int i = 0; i < n; i++) { if (is_lower_than_max_height(boxes[i])) { printf("%d\n", get_volume(boxes[i])); } } return 0; }