Xor Queries #3835

#include <fstream>
using namespace std;

int main()
{
    ifstream fin("xorq.in");
    ofstream fout("xorq.out");
    int Q;
    fin>>Q;
    while(Q--)
    {
        long long n,st,dr,r,k;
        fin>>n>>st>>dr>>r>>k;
        long long maxNumber=-1;
        int countNumbers=0;
        for(long long i=st;i<=dr;++i)
        {
            long long currentNumber=n^i;
            if(currentNumber%r==k)
            {
                if(currentNumber>maxNumber)
                    maxNumber=currentNumber;
                ++countNumbers;
            }
        }
        if(maxNumber==-1)
            fout<<"-1 0\n";
        else
            fout<<maxNumber<<' '<<countNumbers<<'\n';
    }
    fin.close();fout.close();
    return 0;
}