# Boxes through a Tunnel C – Hacker Rank Solution Boxes through a Tunnel C – Hacker Rank Solution

### 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 – lengthiwidthi and heighti which are length, width and height in feet of the i-th box.

#### Constraints

• 1<=n<=100
• 1<=lengthi,heighti,widthi<=100

#### Output Format

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

```4
5 5 5
1 2 40
10 5 41
7 2 42
```

```125
80
```

#### Explanation 0

The first box is really low, only feet tall, so it can pass through the tunnel and its volume is 5 * 5 * 5 = 125The second box is sufficiently low, its volume is 1 * 2 * 40 = 80The third box is exactly 41 feet tall, so it cannot pass. The same can be said about the fourth box.

### 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;
}```

Disclaimer: The above Problem (Boxes through a Tunnel C – Hacker Rank Solution ) is generated by Hackerrank but the Solution is Provided by Chase2Learn. This tutorial is only for Educational and Learning purposes. Authority if any of the queries regarding this post or website fill the following contact form thank you.