Submission #547744

#	Time	Username	Problem	Language	Result	Execution time	Memory
547744		Deepesson	XOR (IZhO12_xor)	C++17	0 / 100	2082 ms	1356 KiB

xor

#include <bits/stdc++.h>

int main()
{
    int N,X;
    std::cin>>N>>X;
    int array[N];
    for(int i=0;i!=N;++i)std::cin>>array[i];
    int max=0,split=0;
    for(int i=0;i!=N;++i){
        int xoro=0;
        for(int j=i;j!=N;++j){
            xoro^=array[j];
          ///  std::cout<<xoro<<" ";
            if(xoro>=X&&(j-i+1)>max){
                max=(j-i+1);
                split=i;
            }
        }
      ///  std::cout<<"\n";
    }
    std::cout<<(split+1)<<" "<<max<<"\n";
}

• Subtask 1: 0 / 100