# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22788 | Jongwon Party (#40) | Window Xor (KRIII5_WX) | C++14 | 0 ms | 0 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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef vector<int> V;
int n;
V pro(V &a, V &b)
{
V r, t;
for(int &x: a)
for(int &y: b)
r.push_back((0LL+x+y) % n);
sort(r.begin(), r.end());
if(r.size() == 1)
return r;
bool c = 0;
for(int i = 0; i<r.size(); i++)
{
if(i != 0 && r[i-1] != r[i])
{