# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594396 | shrimb | Split the sequence (APIO14_sequence) | C++17 | 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 "game.h"
int cnt[1501];
void initialize(int n) {
for (int i = 1 ; i <= n ; i++) cnt[i] = n - 1;
}
int hasEdge(int u, int v) {
if (--cnt[u] == 1 || --cnt[v] == 1) return 1;
else return 0;
}