Marey
BAN USER- 0of 0 votes
AnswersThe strength of a pair integer sequences is defined by the number of integers that they have in common. You are required to find the strength of several pairs of integer sequences.
- Marey in United States for artificial intelligence team
INPUT
The first line of input contains T, the number of test cases. T test cases follow. Each test case contains 3 lines. The first line contains two integers N and M, which are the lengths of the two sequences. The next two lines contain the sequences.
OUTPUT
This should contain T lines, each containing an integer representing the strength of the pair of sequences for the corresponding test case.
CONSTRAINTS
The length of each sequence will be between 1 and 20 inclusive
A sequence can contain an integer between 1 and 100 inclusive
Sequences will not contain duplicate integers
SAMPLE INPUT
3
4 4
1 2 3 4
3 4 5 6
4 5
1 2 3 4
1 2 3 5 6
3 4
1 2 3
5 6 7 4
SAMPLE OUTPUT
2
3
0| Report Duplicate | Flag | PURGE
Achieve Internet Analyst C++ - 0of 0 votes
AnswersThe binary weight of a positive integer is the number of 1's in its binary representation. For example, the decimal number 1 has a binary weight of 1, and the decimal number 7 (which is 111 in binary) has a binary weight of 3.
- Marey in United States for artificial intelligence team
Given a positive integer N, find the smallest integer greater than N that has the same binary weight as N.
INPUT
The first line of input contains a number T the number of test cases. The next T lines contain a number N.
OUTPUT
For each test case output a line containing the smallest number greater than N which has the same binary weight as N.
CONSTRAINTS
1 <= N <= 10000
SAMPLE INPUT
2
3
7
SAMPLE OUTPUT
5
11| Report Duplicate | Flag | PURGE
Achieve Internet Analyst C++ - 0of 0 votes
AnswersGiven an integer N, find the smallest integer greater than N which is prime.
- Marey in United States for artificial intelligence team
INPUT
The first line of input contains T, the number of test cases. T test cases follow. Each test case contains a single integer N.
OUTPUT
This should contain T lines, each containing the smallest prime integer greater than N.
CONSTRAINTS
1 <= T <= 5
1 <= N <= 100
SAMPLE INPUT
2
6
11
SAMPLE OUTPUT
7
13| Report Duplicate | Flag | PURGE
Achieve Internet Analyst C++
it's working now thxxx
- Marey December 11, 2013