Advika is trying to solve the puzzle problem during Mathematics class hour. she has a graph paper with G X N rows and columns, and the puzzle question is, an NCC training base in each cell for a total of G X N bases. He wants to drop food items to every point based on strategic points on the graph paper, marking each drop point with a red dot. If a base contains at least one food package inside or on top of its border fence, then it's considered to be supplied. For example: if Advika has four bases in a 2x2 grid. If he drops a single food package where the walls of all four bases intersect, then those four cells can access the food package.

 #include<stdio.h>

int req,x,y;

int NccCells(int x,int y)

{req=((x+1)/2)*((y+1)/2);

    return req;}

int main()

{    scanf("%d%d",&x,&y);

    printf("%d",NccCells(x,y));

return 0;}