Boxes.c

/*
  #hackerrank
Problem-

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 t
ransported 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.
lines follow with three integers on each separated by single spaces , and which are length, width and height in feet of the 
-th box.

Output Format

For every box from the input which has a height lesser than

feet, print its volume in a separate line.

Sample Input 0

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

Sample Output 0

125
80


*/

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

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<MAX_HEIGHT)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}

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

/*
  OUTPUT
  
  Input (stdin)
Download

    4

    5 5 5

    1 2 40

    10 5 41

    7 2 42

Your Output (stdout)

    125

    80

Expected Output
Download

    125

    80



*/