| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 19838 | inspire12 | 괄호 (kriii4_R) | C++98 | 0 ms | 1576 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 <vector>
#include <queue>
using namespace std;
vector<pair<long long, long long> > x;
unsigned long long res = 1;
priority_queue<long long > q;
vector<vector<long long> > v;
vector<long long> t;
int main() {
int n, s; long long res = 0;
long long m;
long long i;
unsigned long long temp;
pair<long long, long long> p;
scanf("%d %d", &s, &n);
t.push_back(1);
v.push_back(t);
t.pop_back();
p.first = s;
p.second = 1;
x.push_back(p);
for (int i = 2; i <= n; i++) {
t = v.back(); v.pop_back();
for (int j = 1; j < i; j++) {
q.push(t[j - 1]);
if (j == 1 && i % 2 == 0)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||