# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97908 | 314rate | Norela (info1cup18_norela) | C++14 | 2 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n,m;
ll mask[30];
int st[30],vf=0;
void go(int p,ll cur)
{
if(p>m)
{
if(cur==0)
{
for(int i=1;i<=vf;i++)
{
cout<<st[i]<<" ";
}
cout<<"\n";
exit(0);
}
}
else
{
st[++vf]=p;
go(p+1,(cur^mask[p]));
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |