Hello coders, In this post, you will learn how to solve the **Boxes through a Tunnel C HackerRank Solution**. This problem is a part of the **HackerRank C Programming** Series.

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

## Boxes through a Tunnel C

### Objective

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 HackerRank 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; }

**Disclaimer: **The above Problem **(****Boxes through a Tunnel** **in C)** is generated by **Hackerrank** but the Solution is Provided by **BrokenProgrammers**. This tutorial is only for Educational and Learning purposes.

**Next: **Functions in C HackerRank Solution