Wrong answer though it is correct

#1

Challenges - Bitmasking -> Unique 2

Here’s my code :

#include<iostream>
using namespace std;

void solve(int n,int A[],int ans){
    int tmp=ans,pos=0;
    
    while((tmp&1)==0){
            tmp>>=1;
            pos++;
    }
    
    int mask = 1<<pos;
    
    int Set1 = 0;
    
    for(int i=0;i<n;i++){
        if((A[i]&mask)>0)
            Set1^=A[i];
    }
    
    int Set2 = ans^Set1;
    
    cout<<Set1<<" "<<Set2<<endl;
    
}

void XOR(int n,int A[]){
    int ans=0;
    
    for(int i=0;i<n;i++){
        ans^=A[i];
    }
    
   // cout<<ans;
    
    solve(n,A,ans);
}

int main(){
   
    int n;
    
    cin>>n;
    
    int A[n+1];
    
    for(int i=0;i<n;i++){
        cin>>A[i];
    }

    XOR(n,A);
    
    return 0;
}

Though, it is giving the right answer for the input
4
3 1 2 1

output:
3 2

Yet declared wrong answer when submitted for test1 and test2.

#2

save your code on the online ide

#3

The problem is solved. Output is required in increasing order but it is not mentioned anywhere.

#4

sometimes it is not mentioned so sometimes by using hit and trial method you can get the correct answer
please mark your doubt as resolved