CareerCup

Given a few pairs of names in the order child, father. The input is a person name and level number. The output should be the number of children in that particular level for the person given.
Example:
Input:
[
{Ram, Syam},
{Akil, Syam},
{Nikil, Ram},
{Subhash, Ram},
{Karthik, Akil}
];

Syam 2

Output: 3 (Syam has Ram and Akil in level 1 and in level 2 he have Nikil, Subhash, Karthik. So the answer is 3).

Sort a array in such a way that the duplicates are also in
for ex
2 arrays
0 1 3 5
1 2 3 4
output should be
01123345

Write code in C to implement 2048 game in c
?

I know to do this in java ! But How in c
A input like "Nike 4 red L" will be given How to save this spaced inputs in 4 different arrays !
Like company[0]=Nike
Num[0]=4;
col[0]=red;
LorR[0]=L
When a input is given in same line with spaces ! as shown bellow !

Given an array of integers, rearrange the array in such a way that the first element is first maximum and second element is first minimum.
Input : {1, 2, 3, 4, 5, 6, 7}
Output : {7, 1, 6, 2, 5, 3, 4}

Problem Statement

A group of scientists have broken down species DNA into sequences of integers. They determine that two species with the respective DNA sequences A and B are considered to be related if a non-decreasing sequence C of the same length can be found, such that Ci=Ai or Ci=Bi.

Given the DNA sequences for two species, help the scientists determine if they are related.

Input Format

The first line contains an integer, T, the number of test cases.

For each test case:
The first line contains an integer, N, the length of the DNA sequence.
The second line contains a sequence of space-separated integers describing species A.
The third line contains a sequence of space-separated integers describing species B.

Constraints:
1≤T≤5
1≤N≤105
0≤Ai, Bi≤1010
Output Format

On a new line for each test case, print YES if a non-decreasing sequence of the same length can be found (i.e.: species are related) or NO if it cannot.


3
3
1 2 3
4 4 4
3
3 2 1
6 5 4
2
1 0
10 2


Test Case 1: We could have C=1 2 4
Test Case 2: No increasing sequence C is possible.
Test Case 3: We could have C=1 2.

Problem Statement

Given an integer N, express it as the sum of at least two consecutive positive integers. For example:

10 = 1 + 2 + 3 + 4
24 = 7 + 8 + 9
If there are multiple solutions, output the one with the smallest possible number of summands.

Input Format

The first line of input contains the number of test cases T. The descriptions of the test cases follow:

Each test case consists of one line containing an integer N (1 ≤ N ≤ 109).

Output Format

For each test case, output a single line containing the equation in the format:

N = a + (a + 1) + ...+ b

as in the example. If there is no solution, output a single word ‘IMPOSSIBLE’ instead.

Sample Input

3
8
10
24

Sample Output

IMPOSSIBLE
10 = 1 + 2 + 3 + 4
24 = 7 + 8 + 9