Interested to Buy Any Domain ? << Click Here >> for more details...
There are N egg baskets and the number of eggs in each
basket is a known quantity. Two players take turns to remove
these eggs from the baskets. On each turn, a player must
remove at least one egg, and may remove any number of eggs
provided they all belong to the same basket. The player
picking the last egg(s) wins the game. If you are allowed to
decide who is going to start first, what mathematical
function would you use to decide so that you end up on the
winning side?
- 8 Answers
- 12663 Views
- Google, I also Faced
- E-Mail Answers
Answer Posted / guest
i need answer for it
| Is This Answer Correct ? | 4 Yes | 2 No |
Post New Answer View All Answers
What is array in C
Tell me about low level programming languages.
Why is it usually a bad idea to use gets()? Suggest a workaround.
can we have joblib in a proc ?
What is break statement?
What is array in c with example?
1) There is a singing competition for children going to be conducted at a local club. Parents have been asked to arrive at least an hour before and register their children’s names with the Program Manager. Whenever a participant registers, the Program Manager has to position the name of the person in a list in alphabet order. Write a program to help the Program Manager do this by placing the name in the right place each time the Program Manger enters a name. The Logic should be written in Data Structures?
write a programe to accept any two number and check the
following condition using goto state ment.if a>b,print a &
find whether it is even or odd and then print.and
a What does sizeof function do? What is structure in c language? explain what is a newline escape sequence? What is c basic? You have given 2 array. You need to find whether they will
create the same BST or not.
For example:
Array1:10 5 20 15 30
Array2:10 20 15 30 5
Result: True
Array1:10 5 20 15 30
Array2:10 15 20 30 5
Result: False
One Approach is Pretty Clear by creating BST O(nlogn) then
checking two tree for identical O(N) overall O(nlogn) ..we
need there exist O(N) Time & O(1) Space also without extra
space .Algorithm ??
DevoCoder
guest
Posted 3 months ago #
#define true 1
#define false 0
int check(int a1[],int a2[],int n1,int n2)
{
int i;
//n1 size of array a1[] and n2 size of a2[]
if(n1!=n2) return false;
//n1 and n2 must be same
for(i=0;i What is the difference between malloc() and calloc() function in c language? How #define works?
