Вопросы

There are 1000 wine bottles. One of the bottles contains poisoned wine. A rat dies after one hour of drinking the poisoned wine. How many minimum rats are needed to figure out which bottle contains poison in hour.

There are 5 pirates, they must decide how to distribute 100 gold coins among them. The pirates have seniority levels, the senior-most is A, then B, then C, then D, and finally the junior-most is E.

Rules of distribution are:

• The most senior pirate proposes a distribution of coins.
• All pirates vote on whether to accept the distribution.
• If the distribution is accepted, the coins are disbursed and the game ends.
• If not, the proposer is thrown and dies, and the next most senior pirate makes a new proposal to begin the system again.
• In case of a tie vote the proposer can has the casting vote

Rules every pirates follows:

• Every pirate wants to survive
• Given survival, each pirate wants to maximize the number of gold coins he receives.

What is the maximum number of coins that pirate A might get?

Задачи

Given an integer, the task is to find factorial of the number.

Input:
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N,the number whose factorial is to be found

Output:
Print the factorial of the number in separate line.

Constraints:
1 ? T ? 100
1 ? N ? 1000

Example:
Input
3
5
10
2

Output
120
3628800
2

Given a Binary Tree, find diameter of it.
+The diameter of a tree is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two trees each with diameter nine, the leaves that form the ends of a longest path are shaded (note that there is more than one path in each tree of length nine, but no path longer than nine nodes).



Input Format:
First line of input contains the number of test cases T. For each test case, there will be only a single line of input which is a string representing the tree as described below:

1. The values in the string are in the order of level order traversal of the tree where, numbers denotes node values, and a character “N” denotes NULL child.

2. For example:

For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N

Output Format:
For each testcase, in a new line, print the diameter.

Your Task:
You need to complete the function diameter() that takes node as parameter and returns the diameter.

Constraints:
1 <= T <= 100
1 <= Number of nodes <= 100
1 <= Data of a node <= 100

Example:
Input:
2
1 2 3
10 20 30 40 60

Output:
3
4

Explanation:
Testcase1: The tree is

The diameter is of 3 length.
Testcase2: The tree is

The diameter is of 4 length.

Перевод

Есть бинарное дерево, найдите его диаметр.
+ Диаметр дерева — это число узлов на самом длинном пути между двумя листьями дерева. На диаграмме ниже показаны два дерева, каждое диаметром девять, листья, образующие концы длинного пути, затенены (обратите внимание, что в каждом дереве длиной девять есть более одного пути, но нет пути длиннее девяти узлов).

Входной формат:
Первая строка ввода содержит количество тестов T. Для каждого теста будет только одна строка ввода, представляющая собой строку, представляющую дерево, как описано ниже:

1. Значения в строке находятся в порядке обхода уровня дерева, где числа обозначают значения узлов, а символ “N” обозначает нулевой дочерний элемент.

2. Например:

Для приведенного выше дерева строка будет: 1 2 3 N N 4 6 N 5 N N 7 N

Выходной формат:
Для каждого теста в новой строке выведите диаметр.

Ваша задача:
Вам нужно выполнить функцию diameter(), которая принимает node в качестве параметра и возвращает диаметр.

Ограничения:
1 < = T <= 100
1 < = количество узлов < = 100
1 < = Данные узла <= 100

Пример:
Ввод:
2
1 2 3
10 20 30 40 60

Выход:
3
4

Объяснение:
Тест 1: дерево выглядит так:

Диаметр составляет 3.
Тест 2: дерево выглядит так:

Диаметр составляет 4 длины.

How many ways are there to place a black and a white knight on an N * M chessboard such that they do not attack each other? The knights have to be placed on different squares. A knight can move two squares horizontally and one square vertically (L shaped), or two squares vertically and one square horizontally (L shaped). The knights attack each other if one can reach the other in one move.

Input:
The first line contains the number of test cases T. Each of the next T lines contains two integers N and M which is size of matrix.

Output:
For each testcase, print the required answer, i.e, number of possible ways to place knights.

Constraints:
1 <= T <= 100
1 <= N, M <= 105

Example:
Input:
3
2 2
2 3
4 5

Output:
12
26
312
Explanation:
Testcase 1: We can place a black and a white knight in 12 possible ways such that none of them attracts each other.