| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 798295 | khshg | Parrots (IOI11_parrots) | C++14 | 2201 ms | 22776 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 "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
const int BASE = 31622;
const int LEN = 325;
struct BIGNUM {
vector<int> d;
}dp[LEN][256];
BIGNUM add(const BIGNUM& A, const BIGNUM& B) {
BIGNUM res;
int C = 0;
for(int i = 0; i < max((int)A.d.size(), (int)B.d.size()) || C; ++i) {
int cur = C;
if(i < (int)A.d.size()) cur += A.d[i];
if(i < (int)B.d.size()) cur += B.d[i];
C = cur >= BASE;
if(C) cur -= BASE;
res.d.push_back(cur);
}
return res;
}
BIGNUM sub(BIGNUM A, const BIGNUM& B) {
int C = 0;
for(int i = 0; i < (int)B.d.size() || C; ++i) {
A.d[i] -= C + (i < (int)B.d.size() ? B.d[i] : 0);
| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||