Help me in solving APPENDOR problem

help
,
1

My issue

did not understand the problem

My code

#include <stdio.h>

int main(void) {
	// your code goes here
	return 0;
}

Problem Link: APPENDOR Problem - CodeChef

2

so here the question says ‘or’ operation between all element of the array is some number let it is ‘n’ . then it says that if i have a veriable x. then if i do or operation between x and n then it gives me y which is given. so we have to find x. so what i do. i just calculate first our n. then if you know xor operation what its do . its some time plays a role like substraction when the bits of two digits are same. and or is like addition between minimum numbers and bits of two digits have to same. then we return the answer(x) by xor operation and once we cross check the answer by if the (x or n)= y or not if not then return -1;

1 Like
3

i have one more doubt regarding codechef so if you can help

i have solved around 7-8 quesions in codechef out of which i got how to do 3-4 questions and got the required answer but my code is stated as wrong every time ,
so i doesnt understand whats wrong with the code ,
so is there a WAY/TOOL/APP/WEBSITE to understand our mistakes in our code