log in
Active Users
Feedback
About and Contact
© 2020 DOUBTCOOL
Find Intersection
Have the function FindIntersection(strArr) read the array of strings stored in strArr which will contain 2 elements: the
first element will represent a list of comma-separated numbers sorted in ascending order, the second element will represent
a second list of comma-separated numbers (also sorted). Your goal is to return a comma-separated string containing the
numbers that occur in elements of strArr in sorted order. If there is no intersection, return the string false.
Examples
Input: ["1, 3, 4, 7, 13", "1, 2, 4, 13, 15"]
Output: 1,4,13
Input: ["1, 3, 9, 10, 17, 18", "1, 4, 9, 10"]
Output: 1,9,10
Have the function FindIntersection(strArr) read the array of strings stored in strArr which will contain 2 elements: the
first element will represent a list of comma-separated numbers sorted in ascending order, the second element will represent
a second list of comma-separated numbers (also sorted). Your goal is to return a comma-separated string containing the
numbers that occur in elements of strArr in sorted order. If there is no intersection, return the string false.
Examples
Input: ["1, 3, 4, 7, 13", "1, 2, 4, 13, 15"]
Output: 1,4,13
Input: ["1, 3, 9, 10, 17, 18", "1, 4, 9, 10"]
Output: 1,9,10
5 answers available
Geek is a spy in an
enemy town. There are people
in the town and every person
has a unique natural number
that denotes the
identification. The person's
identification code is
organisation has however
planted several alles in the
town They can be identified
by the identification code
as the digits in the code
for the smallest possible
permutation Given N. find
out how many allies Book has
in the town
Example 1:
Input: N 13
Output: 12
Explanation: Tdentification
codes of Geeks
allies are 1, 2, 3, 4, 5, 6,
7, , 9, 11, 12 and 13.
Person with Identification
code 10 cannot be an ally as
10 is not the smallest
permutation of the digits
and i'.
enemy town. There are people
in the town and every person
has a unique natural number
that denotes the
identification. The person's
identification code is
organisation has however
planted several alles in the
town They can be identified
by the identification code
as the digits in the code
for the smallest possible
permutation Given N. find
out how many allies Book has
in the town
Example 1:
Input: N 13
Output: 12
Explanation: Tdentification
codes of Geeks
allies are 1, 2, 3, 4, 5, 6,
7, , 9, 11, 12 and 13.
Person with Identification
code 10 cannot be an ally as
10 is not the smallest
permutation of the digits
and i'.
13 answers available
Policemen catch thieves Given an array of size n that has the following specifications:
Each element in the array contains either a policeman or a thief.
Each policeman can catch only one thief.
A policeman cannot catch a thief who is more than K units away from the policeman.
We need to find the maximum number of thieves that can
be caught. Examples:
Input : arrO = ('P', 'T', 'P', 'T'), k = 1. Output : 2. Here maximum 2 thieves can be caught, first policeman catches first
thief and second police- man can catch either second or third thief. Input : arrU = 'P', 'P', 'T', 'P'), k = 2. Output : 3.
Each element in the array contains either a policeman or a thief.
Each policeman can catch only one thief.
A policeman cannot catch a thief who is more than K units away from the policeman.
We need to find the maximum number of thieves that can
be caught. Examples:
Input : arrO = ('P', 'T', 'P', 'T'), k = 1. Output : 2. Here maximum 2 thieves can be caught, first policeman catches first
thief and second police- man can catch either second or third thief. Input : arrU = 'P', 'P', 'T', 'P'), k = 2. Output : 3.
215 answers available
Cops and the Thief Devu
There are 100 houses located on a straight line. The first house is numbered 1 and the last one is numbered 100. Some M
houses out of these 100 are occupied by cops.
Thief Devu has just stolen PeePee's bag and is looking for a house to hide in.
PeePee uses fast 4G Internet and sends the message to all the cops that a thief named Devu has just stolen her bag and ran
into some house.
Devu knows that the cops run at a maximum speed of x houses per minute in a straight line and they will search for a maximum
of y minutes. Devu wants to know how many houses are safe for him to escape from the cops. Help him in getting this
information.
Input
First line contains T, the number of test cases to follow.
First line of each test case contains 3 space separated integers: M, x and y.
For each test case, the second line contains M space separated integers which represent the house numbers where the cops are
residing.
Output
For each test case, output a single line containing the number of houses which are safe to hide from cops.
There are 100 houses located on a straight line. The first house is numbered 1 and the last one is numbered 100. Some M
houses out of these 100 are occupied by cops.
Thief Devu has just stolen PeePee's bag and is looking for a house to hide in.
PeePee uses fast 4G Internet and sends the message to all the cops that a thief named Devu has just stolen her bag and ran
into some house.
Devu knows that the cops run at a maximum speed of x houses per minute in a straight line and they will search for a maximum
of y minutes. Devu wants to know how many houses are safe for him to escape from the cops. Help him in getting this
information.
Input
First line contains T, the number of test cases to follow.
First line of each test case contains 3 space separated integers: M, x and y.
For each test case, the second line contains M space separated integers which represent the house numbers where the cops are
residing.
Output
For each test case, output a single line containing the number of houses which are safe to hide from cops.
7 answers available
Villages and Tribes
There are n villages in a line in an area. There are two kinds of tribes A and B that
reside there. A village can be either empty or occupied by one of the tribes. An empty
village is said to be controlled by a tribe of village A if it is surrounded by
villages of tribes A from the left and from the right. Same goes for the tribe B.
Find out the number of villages that are either occupied by or controlled by tribes A
and B, respectively.
Input
The first line of the input contains an integer T
denoting the number of test cases.
The first line of the input contains a string s
denoting the configuration of the villages, each character of which can be 'A', 'B' or
'.'.
Output
For each test case, output two space-separated integers denoting the number of villages
either occupied by or controlled by tribe A and B, respectively.
There are n villages in a line in an area. There are two kinds of tribes A and B that
reside there. A village can be either empty or occupied by one of the tribes. An empty
village is said to be controlled by a tribe of village A if it is surrounded by
villages of tribes A from the left and from the right. Same goes for the tribe B.
Find out the number of villages that are either occupied by or controlled by tribes A
and B, respectively.
Input
The first line of the input contains an integer T
denoting the number of test cases.
The first line of the input contains a string s
denoting the configuration of the villages, each character of which can be 'A', 'B' or
'.'.
Output
For each test case, output two space-separated integers denoting the number of villages
either occupied by or controlled by tribe A and B, respectively.
5 answers available
Kostya likes the number 4 much. Of course! This number has such a lot of properties, like:
Four is the smallest composite number;
It is also the smallest Smith number;
The smallest non-cyclic group has four elements;
Four is the maximal degree of the equation that can be solved in radicals;
There is four-color theorem that states that any map can be colored in no more than four colors in such a way that no two
adjacent regions are colored in the same color;
Lagrange's four-square theorem states that every positive integer can be written as the sum of at most four square numbers;
Four is the maximum number of dimensions of a real division algebra;
In bases 6 and 12, 4 is a 1-automorphic number;
And there are a lot more cool stuff about this number!
Input
The first line of input consists of a single integer T, denoting the number of integers in Kostya's list.
Then, there are T lines, each of them contain a single integer from the list.
Output
Output T lines. Each of these lines should contain the number of occurences of the digit 4 in the respective integer from
Kostya's list.
Four is the smallest composite number;
It is also the smallest Smith number;
The smallest non-cyclic group has four elements;
Four is the maximal degree of the equation that can be solved in radicals;
There is four-color theorem that states that any map can be colored in no more than four colors in such a way that no two
adjacent regions are colored in the same color;
Lagrange's four-square theorem states that every positive integer can be written as the sum of at most four square numbers;
Four is the maximum number of dimensions of a real division algebra;
In bases 6 and 12, 4 is a 1-automorphic number;
And there are a lot more cool stuff about this number!
Input
The first line of input consists of a single integer T, denoting the number of integers in Kostya's list.
Then, there are T lines, each of them contain a single integer from the list.
Output
Output T lines. Each of these lines should contain the number of occurences of the digit 4 in the respective integer from
Kostya's list.
8 answers available
Question 1:
Id and Ship Write a program that takes in a letter class ID of a ship and display the equivalent
string class description of the given ID. Use the table below.
Class ID Ship Class (B or b - Battleship; C or c - Cruiser; D or d - Destroyer; F or f - Frigate)
Input :
The first line contains an integer T, the total number of test cases. Then T lines follow, each
line contains a character.
Id and Ship Write a program that takes in a letter class ID of a ship and display the equivalent
string class description of the given ID. Use the table below.
Class ID Ship Class (B or b - Battleship; C or c - Cruiser; D or d - Destroyer; F or f - Frigate)
Input :
The first line contains an integer T, the total number of test cases. Then T lines follow, each
line contains a character.
2 answers available
Puppy and Sum
Yesterday, puppy Tuzik learned a magically efficient method to find the sum of the integers from 1 to N. He denotes it as
sum(N). But today, as a true explorer, he defined his own new function: sum(D, N), which means the operation sum applied D
times: the first time to N, and each subsequent time to the result of the previous operation.
For example, if D = 2 and N = 3, then sum(2, 3) equals to sum(sum(3)) = sum(1 + 2 + 3) = sum(6) = 21.
Tuzik wants to calculate some values of the sum(D, N) function. Will you help him with that?
Input
The first line contains a single integer T, the number of test cases. Each test case is described by a single line
containing two integers D and N.
Output For each testcase, output one integer on a separate line.
Yesterday, puppy Tuzik learned a magically efficient method to find the sum of the integers from 1 to N. He denotes it as
sum(N). But today, as a true explorer, he defined his own new function: sum(D, N), which means the operation sum applied D
times: the first time to N, and each subsequent time to the result of the previous operation.
For example, if D = 2 and N = 3, then sum(2, 3) equals to sum(sum(3)) = sum(1 + 2 + 3) = sum(6) = 21.
Tuzik wants to calculate some values of the sum(D, N) function. Will you help him with that?
Input
The first line contains a single integer T, the number of test cases. Each test case is described by a single line
containing two integers D and N.
Output For each testcase, output one integer on a separate line.
1 answers available
For a string let the unique set of characters that
occur in it one or more times be C. Considers a
permutation of the elements of C as (c1,c2,c3...). Let
f(c) be the number of times c occurs in s.
if any such permutation of the elements of the elements of
C satifies f(c) = f(ci-1)+ f(ci-2) for all i>=3, the
string is said to be dynamic string.
Note that if the number of distinct characters in the
characters in the sting is less than 3, i.e if C|<3, then
the is always dynamic.
occur in it one or more times be C. Considers a
permutation of the elements of C as (c1,c2,c3...). Let
f(c) be the number of times c occurs in s.
if any such permutation of the elements of the elements of
C satifies f(c) = f(ci-1)+ f(ci-2) for all i>=3, the
string is said to be dynamic string.
Note that if the number of distinct characters in the
characters in the sting is less than 3, i.e if C|<3, then
the is always dynamic.
4 answers available
REVERSE LENGTH DIVISBLE
Reverse Length Divisible Given a number N, check if it is
reverse length divisible. A number is said to be reverse
length divisible if the first i digits of the number is
divisible by (l-i+1) where l is the number of digits in N
and 0 < i <= l.
For example, 652281 is reverse length divisible because:
6 is divisible by 6
65 is divisible by 5
652 is divisible by 4
6522 is divisible by 3
65228 is divisible by 2
652281 is divisible by 1.
43268 is not reverse length divisible. Print Yes if the
number is reverse length divisible and no otherwise.
Boundary Conditions:
0 ≤ n ≤ 100000
Input Format:
The first line contains the number N.
Output Format:
Print "Yes" if the number is reverse length divisible
otherwise print "No" (without quotes).
Reverse Length Divisible Given a number N, check if it is
reverse length divisible. A number is said to be reverse
length divisible if the first i digits of the number is
divisible by (l-i+1) where l is the number of digits in N
and 0 < i <= l.
For example, 652281 is reverse length divisible because:
6 is divisible by 6
65 is divisible by 5
652 is divisible by 4
6522 is divisible by 3
65228 is divisible by 2
652281 is divisible by 1.
43268 is not reverse length divisible. Print Yes if the
number is reverse length divisible and no otherwise.
Boundary Conditions:
0 ≤ n ≤ 100000
Input Format:
The first line contains the number N.
Output Format:
Print "Yes" if the number is reverse length divisible
otherwise print "No" (without quotes).
7 answers available
Chefina and Swap
You are given a positive integer N. Consider the sequence S=(1,2,…,N). You should choose two elements of this sequence and
swap them.
A swap is nice if there is an integer M (1≤M<N) such that the sum of the first M elements of the resulting sequence is equal
to the sum of its last N−M elements. Find the number of nice swaps.
Input
The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases
follows.
The first and only line of each test case contains a single integer N.
Output
For each test case, print a single line containing one integer ― the number of nice swaps.
You are given a positive integer N. Consider the sequence S=(1,2,…,N). You should choose two elements of this sequence and
swap them.
A swap is nice if there is an integer M (1≤M<N) such that the sum of the first M elements of the resulting sequence is equal
to the sum of its last N−M elements. Find the number of nice swaps.
Input
The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases
follows.
The first and only line of each test case contains a single integer N.
Output
For each test case, print a single line containing one integer ― the number of nice swaps.
6 answers available
Zonal Computing Olympiad 2014, 30 Nov 2013
You are developing a smartphone app. You have a list of potential customers for your app. Each customer has a budget and
will buy the app at your declared price if and only if the price is less than or equal to the customer's budget.
You want to fix a price so that the revenue you earn from the app is maximized. Find this maximum possible revenue.
For instance, suppose you have 4 potential customers and their budgets are 30, 20, 53 and 14. In this case, the maximum
revenue you can get is 60 .
Input format
Line 1 : N, the total number of potential customers.
Lines 2 to N+1: Each line has the budget of a potential customer.
Output format
The output consists of a single integer, the maximum possible revenue you can earn from selling your app.
You are developing a smartphone app. You have a list of potential customers for your app. Each customer has a budget and
will buy the app at your declared price if and only if the price is less than or equal to the customer's budget.
You want to fix a price so that the revenue you earn from the app is maximized. Find this maximum possible revenue.
For instance, suppose you have 4 potential customers and their budgets are 30, 20, 53 and 14. In this case, the maximum
revenue you can get is 60 .
Input format
Line 1 : N, the total number of potential customers.
Lines 2 to N+1: Each line has the budget of a potential customer.
Output format
The output consists of a single integer, the maximum possible revenue you can earn from selling your app.
1 answers available
Alice and Bob are playing a game. Alice initially has the
number A and Bob has the number B. There are a total of N
turns in the game, and Alice and Bob alternatively take
turns. In each turn the player whose turn it is,
multiplies his or her number by 2. Alice has the first
turn
Suppose after all the N turns, Alice number has become C
and Bobs number has become D. You want to calculate the
integer division of the maximum number among C and D by
the minimum number among C and D.
number A and Bob has the number B. There are a total of N
turns in the game, and Alice and Bob alternatively take
turns. In each turn the player whose turn it is,
multiplies his or her number by 2. Alice has the first
turn
Suppose after all the N turns, Alice number has become C
and Bobs number has become D. You want to calculate the
integer division of the maximum number among C and D by
the minimum number among C and D.
3 answers available
Mahasena
Kattapa, as you all know was one of the greatest warriors of his time. The
kingdom of Maahishmati had never lost a battle under him (as army-chief), and the
reason for that was their really powerful army, also called as Mahasena.
Kattapa was known to be a very superstitious person. He believed that a soldier
is "lucky" if the soldier is holding an even number of weapons, and "unlucky"
otherwise. He considered the army as "READY FOR BATTLE" if the count of "lucky"
soldiers is strictly greater than the count of "unlucky" soldiers, and "NOT
READY" otherwise.
Given the number of weapons each soldier is holding, your task is to determine
whether the army formed by all these soldiers is "READY FOR BATTLE" or "NOT
READY".
You can find the definition of an even number here.
Input
The first line of input consists of a single integer N denoting the number of
soldiers. The second line of input consists of N space separated integers A1, A2,
..., AN, where Ai denotes the number of weapons that the ith soldier is holding.
Output
Generate one line output saying "READY FOR BATTLE", if the army satisfies the
conditions that Kattapa requires or "NOT READY" otherwise (quotes for clarity).
Kattapa, as you all know was one of the greatest warriors of his time. The
kingdom of Maahishmati had never lost a battle under him (as army-chief), and the
reason for that was their really powerful army, also called as Mahasena.
Kattapa was known to be a very superstitious person. He believed that a soldier
is "lucky" if the soldier is holding an even number of weapons, and "unlucky"
otherwise. He considered the army as "READY FOR BATTLE" if the count of "lucky"
soldiers is strictly greater than the count of "unlucky" soldiers, and "NOT
READY" otherwise.
Given the number of weapons each soldier is holding, your task is to determine
whether the army formed by all these soldiers is "READY FOR BATTLE" or "NOT
READY".
You can find the definition of an even number here.
Input
The first line of input consists of a single integer N denoting the number of
soldiers. The second line of input consists of N space separated integers A1, A2,
..., AN, where Ai denotes the number of weapons that the ith soldier is holding.
Output
Generate one line output saying "READY FOR BATTLE", if the army satisfies the
conditions that Kattapa requires or "NOT READY" otherwise (quotes for clarity).
4 answers available
Chef and Easy Queries
Chef published a blog post, and is now receiving many queries about it. On day i, he receives Qi queries. But Chef can
answer at most k queries in a single day.
Chef always answers the maximum number of questions that he can on any given day (note however that this cannot be more than
k). The remaining questions (if any) will be carried over to the next day.
Fortunately, after n days, the queries have stopped. Chef would like to know the first day during which he has some free
time, i.e. the first day when he answered less than k questions.
Input:
First line will contain T, the number of testcases. Then the testcases follow.
The first line of each testcase contains two space separated integers n and k.
The second line of each testcase contains n space separated integers, namely Q1,Q2,...Qn.
Output:
For each testcase, output in a single line the first day during which chef answers less than k questions.
Constraints
1≤T≤105
1≤ sum of n over all testcases ≤105
1≤k≤108
0≤Qi≤108
Subtasks
Subtask 1 - 20% points - Sum of Qi over all testcases and days ≤3.106
Subtask 2 - 80% points - Original constraints
Sample Input:
2
6 5
10 5 5 3 2 1
1 1
100
Sample Output:
6
101
Chef published a blog post, and is now receiving many queries about it. On day i, he receives Qi queries. But Chef can
answer at most k queries in a single day.
Chef always answers the maximum number of questions that he can on any given day (note however that this cannot be more than
k). The remaining questions (if any) will be carried over to the next day.
Fortunately, after n days, the queries have stopped. Chef would like to know the first day during which he has some free
time, i.e. the first day when he answered less than k questions.
Input:
First line will contain T, the number of testcases. Then the testcases follow.
The first line of each testcase contains two space separated integers n and k.
The second line of each testcase contains n space separated integers, namely Q1,Q2,...Qn.
Output:
For each testcase, output in a single line the first day during which chef answers less than k questions.
Constraints
1≤T≤105
1≤ sum of n over all testcases ≤105
1≤k≤108
0≤Qi≤108
Subtasks
Subtask 1 - 20% points - Sum of Qi over all testcases and days ≤3.106
Subtask 2 - 80% points - Original constraints
Sample Input:
2
6 5
10 5 5 3 2 1
1 1
100
Sample Output:
6
101
4 answers available
Write an application that displays a series of at least 10 student ID numbers (that you have stored in an array) and asks
the user to enter a test letter grade for the student. Create an Exception class named GradeException that contains a static
public array of valid grade letters (‘A’, ‘B’, ‘C’, ‘D’, ‘F’, and ‘I’) you can use to determine whether a grade entered from
the application is valid. In your application, throw a GradeException if the user does not enter a valid letter grade. Catch
the GradeException, and then display an appropriate message. In addition, store an ‘I’ (for Incomplete) for any student for
whom an exception is caught. At the end of the application, display all the student IDs and grades. Save the files as
GradeException.java and TestGrade.java
Input Format
N value as Request
Constraints
1 <= N <= 10
Output Format
Print “Grade Exception” for the grade letter mismatch.
Sample Input
S
Sample Output
Grade Exception
Explanation
If the Student ID Grade letter does not match then print Grade Exception.
the user to enter a test letter grade for the student. Create an Exception class named GradeException that contains a static
public array of valid grade letters (‘A’, ‘B’, ‘C’, ‘D’, ‘F’, and ‘I’) you can use to determine whether a grade entered from
the application is valid. In your application, throw a GradeException if the user does not enter a valid letter grade. Catch
the GradeException, and then display an appropriate message. In addition, store an ‘I’ (for Incomplete) for any student for
whom an exception is caught. At the end of the application, display all the student IDs and grades. Save the files as
GradeException.java and TestGrade.java
Input Format
N value as Request
Constraints
1 <= N <= 10
Output Format
Print “Grade Exception” for the grade letter mismatch.
Sample Input
S
Sample Output
Grade Exception
Explanation
If the Student ID Grade letter does not match then print Grade Exception.
1 answers available
On a sunny day, Akbar and Birbal were taking a leisurely walk in palace gardens. Suddenly, Akbar noticed a bunch of sticks
on the ground and decided to test Birbal's wits.
There are N stick holders with negligible size (numbered 1 through N) in a row on the ground. Akbar places all the sticks in
them vertically; for each valid i, the initial height of the stick in the i-th holder is Ai. Birbal has a stick cutter and
his task is to completely cut all these sticks, i.e. reduce the heights of all sticks to 0. He may perform zero or more
operations; in each operation, he should do the following:
Choose an integer H and fix the cutter at the height H above the ground.
The cutter moves from the 1-st to the N-th stick holder. Whenever it encounters a stick whose current height is greater than
H, it cuts this stick down to height H (i.e. for a stick with height h>H, it removes its upper part with length h−H).
All the upper parts of sticks that are cut in one operation must have equal lengths. Otherwise, the operation may not be
performed.
For example, if the heights of sticks are initially [5,3,5], then some valid values for H in the first operation are 3 and 4
― the cutter cuts the upper parts of two sticks and their lengths are [2,2] and [1,1] respectively. H=2 is an invalid choice
because it would cut the upper parts of all three sticks with lengths [3,1,3], which are not all equal.
Akbar wants Birbal to completely cut all sticks in the minimum possible number of operations. If you want to be friends with
Birbal, help him solve the problem.
Input
The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases
follows.
The first line of each test case contains a single integer N.
The second line contains N space-separated integers A1,A2,…,AN.
Output
For each test case, print a single line containing one integer ― the minimum number of operations needed to completely cut
all the sticks.
on the ground and decided to test Birbal's wits.
There are N stick holders with negligible size (numbered 1 through N) in a row on the ground. Akbar places all the sticks in
them vertically; for each valid i, the initial height of the stick in the i-th holder is Ai. Birbal has a stick cutter and
his task is to completely cut all these sticks, i.e. reduce the heights of all sticks to 0. He may perform zero or more
operations; in each operation, he should do the following:
Choose an integer H and fix the cutter at the height H above the ground.
The cutter moves from the 1-st to the N-th stick holder. Whenever it encounters a stick whose current height is greater than
H, it cuts this stick down to height H (i.e. for a stick with height h>H, it removes its upper part with length h−H).
All the upper parts of sticks that are cut in one operation must have equal lengths. Otherwise, the operation may not be
performed.
For example, if the heights of sticks are initially [5,3,5], then some valid values for H in the first operation are 3 and 4
― the cutter cuts the upper parts of two sticks and their lengths are [2,2] and [1,1] respectively. H=2 is an invalid choice
because it would cut the upper parts of all three sticks with lengths [3,1,3], which are not all equal.
Akbar wants Birbal to completely cut all sticks in the minimum possible number of operations. If you want to be friends with
Birbal, help him solve the problem.
Input
The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases
follows.
The first line of each test case contains a single integer N.
The second line contains N space-separated integers A1,A2,…,AN.
Output
For each test case, print a single line containing one integer ― the minimum number of operations needed to completely cut
all the sticks.
5 answers available
.Andy wants to play a
game with his little
brother, Bob. The game
starts with an array of
distinct integers and the
rules are as follows:
Bob always plays first
and the two players move
in alternating turns. In
a single move, a player
chooses the maximum
element currently present
in the array and removes
it as well as all the
other elements to its
right. For example, if
the starting array , then
it becomes after the
first move because we
remove the maximum
element (i.e., ) and all
elements to its right
(i.e., and ). The
modifications made to the
array during each turn
are permanent, so the
next player continues the
game with the remaining
array. The first player
who is unable to make a
move loses the game. Andy
and Bob play games.
Given the initial array
for each game, find and
print the name of the
winner on a new line. If
Andy wins, print ANDY; if
Bob wins, print BOB. To
continue the example
above, in the next move
Andy will remove . Bob
will then remove and win
because there are no more
integers to remove.
game with his little
brother, Bob. The game
starts with an array of
distinct integers and the
rules are as follows:
Bob always plays first
and the two players move
in alternating turns. In
a single move, a player
chooses the maximum
element currently present
in the array and removes
it as well as all the
other elements to its
right. For example, if
the starting array , then
it becomes after the
first move because we
remove the maximum
element (i.e., ) and all
elements to its right
(i.e., and ). The
modifications made to the
array during each turn
are permanent, so the
next player continues the
game with the remaining
array. The first player
who is unable to make a
move loses the game. Andy
and Bob play games.
Given the initial array
for each game, find and
print the name of the
winner on a new line. If
Andy wins, print ANDY; if
Bob wins, print BOB. To
continue the example
above, in the next move
Andy will remove . Bob
will then remove and win
because there are no more
integers to remove.
3 answers available
Chef and digits of a number
Chef has a number D containing only digits 0's and 1's. He wants to make the number to have all the digits same. For that, he
will change exactly one digit, i.e. from 0 to 1 or from 1 to 0. If it is possible to make all digits equal (either all 0's or
all 1's) by flipping exactly 1 digit then output "Yes", else print "No" (quotes for clarity) .
Input
The first line will contain an integer T representing the number of test cases.
Each test case contain a number made of only digits 1's and 0's on newline
Output
Print T lines with a "Yes" or a "No", depending on whether its possible to make it all 0s or 1s or not.
Chef has a number D containing only digits 0's and 1's. He wants to make the number to have all the digits same. For that, he
will change exactly one digit, i.e. from 0 to 1 or from 1 to 0. If it is possible to make all digits equal (either all 0's or
all 1's) by flipping exactly 1 digit then output "Yes", else print "No" (quotes for clarity) .
Input
The first line will contain an integer T representing the number of test cases.
Each test case contain a number made of only digits 1's and 0's on newline
Output
Print T lines with a "Yes" or a "No", depending on whether its possible to make it all 0s or 1s or not.
2 answers available
Chef Two and Chef Ten are playing a game with a number X. In one turn, they can multiply X by 2. The goal of the game is to
make X divisible by 10.
Help the Chefs find the smallest number of turns necessary to win the game (it may be possible to win in zero turns) or
determine that it is impossible.
make X divisible by 10.
Help the Chefs find the smallest number of turns necessary to win the game (it may be possible to win in zero turns) or
determine that it is impossible.
2 answers available