Tennis Court

QUESTION:
Many of the current final year students of a college are excellent tennis players. They always emerge as champions in the State Level Inter-Collegiate Tennis Meet. They want their juniors to carry on their legacy in the field of tennis and they started training their juniors in tennis. They were happy to see them play very well during their coaching sessions. They had a very comfortable win over one of the top teams in the game played at their college. But to their dismay, their juniors performed very poorly in the games conduced at other venues.

The think-tank of the College Tennis club was pondering over the reasons for their poor performance in the meets.  David came up with a possible reason for the poor performance of their junior team. The tennis court in their college is a grass court but the tennis courts in most other competitive venues are synthetic courts. Their junior team has learnt playing tennis in the grass court and they found it very difficult to adapt their game to synthetic courts. The entire team agreed with this reason and they planned to request the chairman to convert the grass tennis court to synthetic tennis court.

They sent a request to the Chairman and he readily agreed but he asked to do it with minimal expenditure. He gave them square stones.

The tennis court in the college is rectangular in shape of size n*m metres. We need to pave the court with square stones. The square stone is of size a*a.

What is the least number of stones needed to pave the tennis court? It's allowed to cover the surface larger than the Tennis Court, but the court has to be covered. It's not allowed to break the stones. The sides of stones should be parallel to the sides of the court.
Input Format:
Input consists of 3 integers. The first integer corresponds to 'n', the length of the court. The second integer corresponds to 'm', the width of the court. The third integer corresponds to 'a', the side of the square stone.
Output Format:
Output consists of ta single integer k, where k is the least number of stones needed.

Sample Input:
6
6
4

Sample Output:
4

SOLUTION:

#include<stdio.h>
#include<math.h>
int main()
{
    int l,b,la,ba,plate,a;
    scanf("%d",&l);
    scanf("%d",&b);
    scanf("%d",&a);
    la=round((float)l/a);
    ba=round((float)b/a);
    plate=la*ba;
    printf("%d",plate);
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Implementing a Fixed size Queue of maximum size 5 using an array

QUESTION: Consider implementing a fixed size queue of maximum size 5 using an array. Create a structure struct queue { int contents[5]; int front; int count; } ; Note that the array contents holds the contents of the queue and the integer front stores the index of the front element in the queue. Write a program to implement enQueue and deQueue operation on queue and to display the contents of the queue. In the initQueue function intialize the value of front and count to 0. Print the message “Queue is full” in the enQueue function when an attempt is made to insert a data into a full queue. Print the message “Queue is empty” in the deQueue function and return the value -1000 when an attempt is made to delete data from an empty queue. Refer function specifications for further details. Input and Output Format: Refer sample input and output for formatting specifications. Note that the statement “The contents of the queue are” is in the main
Read more

Implementing a Dynamically sized stack using array

QUESTION: Consider implementing a dynamically sized stack using an array. Create a structure struct stack { int * a; int top; int maxSize; }; The structure stack has a pointer 'a' to a dynamically allocated array (used to hold the contents of the stack), an integer 'maxSize' that holds the size of this array (i.e the maximum number of data that can be held in this array) and an integer 'top' which stores the array index of the top element in the stack. Write a program to implement push and pop operation on stack and to display the contents of the stack. In the initstack function intialize the value of top to -1 and initialize the value of maxSize. Print the message “Stack is full” in the push function when an attempt is made to push a data into a full stack. Print the message “Stack is empty” in the pop function and return the value -1000 when an attempt is made to pop data from an empty stack. Refer function specificati
Read more

Functions - Null Matrix

QUESTION: Write a program to find whether the given matrix is null or not using functions. A null matrix is a matrix in which all its elements are zero. Function specification: int checkNull(int **a, int m, int n) The first argument corresponds to the pointer to an array. The second argument corresponds to the number of rows. The third argument corresponds to the number of columns. The function returns a value of 1 if it is a null matrix and 0 otherwise. Input and Output Format: Assume that the maximum number of rows and columns in the matrix is 10. Refer sample input and output for formatting specifications. All text in bold corresponds to input and the rest corresponds to output. Sample Input and Output 1: Enter the number of rows in the matrix 3 Enter the number of columns in the matrix 2 Enter the elements of the matrix 2 4 1 3 0 9 The matrix is 2 4 1 3 0 9 The matrix is not null Sample Input and Output 2: Enter th
Read more