Tina’s trainer have given her two positive integers U and V. Now her task is to find the number of pairs if positive intgers(X,Y)
such that 1<=X<=U, 1<=Y<=V and X+Y is even. Tina is finding diffcult to understand the problem.
Can you help her solving the problem?
Input:
The only line of each test case contains two space-separated integers U and V.
Output:
In the Only line of output print a single containing one integer that represents
the number of valid pairs.
Input : 17 5
Output: 43
#include <stdio.h> int main() { int U,V; int s; //printf("Enter two positive integers : "); scanf("%2d%2d",&U,&V); s=U*V/2+((U%2)*(V%2)); //printf("Valid Pairs : "); printf("%d\n",s); return 0; }
Input_1:
Enter two positive integers : 17 5
Output:
Valid Pairs : 43
Input_2:
Enter two positive integers : 56 24
Output:
Valid Pairs : 672
ILLUSTRATION
More Q
- Determine if a person could attend all meetings in given interval times.
- Find the volume of a volley ball
- Find the maximum score obtained at the end of colour chess grid game.
- Find the number of pairs if positive integers with condition is even.
- Return the largest subset such that every pair meets the given condition.
- Find the number of index triplets that satisfy given condition.
- Handling multiple queries using array – sum, update, range.
- Find all the sequences that occur more than once in DNA molecule.
- Find the biggest number.
- Sum of cube of each number is again equal to the number then it is an Armstrong number.
- Hello World.
- Calculate the Cube Root.
- Find the count of consecutive 1’s present in array.
- Return an array with athletes relative ranks according to the score.
- Return a string of its base 7 representation.
- Return kth largest element in sorted order.
- Find all repeated elements in the array.
- Find atleast one duplicate number in the array.
- Find the maximum result of = a XOR b.