Hi Alexander,
I used similar approach and I think I found out why it is wrong, basically
the solution just assumes that we need to convert the solution into two
numbers which on xored give 0 and and the or operation between the two
gives 2^(n-1), but this approach marks many possible answers
I'm not able to make out why my code below fails. Any help would be most
welcome
#include
#include
#include
#include
#include
using namespace std;
int main(){
int T;
cin>>T;
for(int tc = 1;tc<=T;tc++){
int N;
cin >> N;
vector,int > > vData;
pair
Hi,
I have submitted the solution to a small test-set of a problem and it was
judged correct. I doubt that I have uploaded the source code for some other
problem there. How can I re-submit ? I am assuming that since we are
allowed to have multiple wrong tries for the small test-sets, one should
