# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9294 | corea | Quaternion inverse (kriii2_Q) | C++14 | 0 ms | 9056 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 <cassert>
#include <vector>
#include <algorithm>
long long M;
long long inv[1000001];
using namespace std;
#define REP(i, n) for(int i=0; i < n; ++i)
int n;
struct T {
long long value;
T(long long v = 0) {
value = v;
value += M;
value %= M;
}
bool zero() const {
return value % M == 0;
}
};
T operator / (const T x, const T y) {
// printf("> %lld %lld\n", x.value, y.value);
if(y.value == 0) throw 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |