My issue
Can someone explain me 2nd testcase?
My code
#include <iostream>
using namespace std;
int main() {
// your code goes here
return 0;
}
Problem Link: HP18 Problem - CodeChef
Can someone explain me 2nd testcase?
#include <iostream>
using namespace std;
int main() {
// your code goes here
return 0;
}
Problem Link: HP18 Problem - CodeChef
@shriyansh_19
for second test case
2,4
[1,2,3,4,5]
first bob which has lucky number 2 will remove 4 .
now the array become [1,2,3,5]
then alice which has lucky number 4 will not be able to remove any number .
So BOB will win the game.
thanks
read the second point of problem carefully it says can remove all common not necessarily 1 element only