# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582601 | amunduzbaev | Triangles (CEOI18_tri) | 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 "trilib.h"
//~ #ifndef EVAL
#include "trilib.c"
//~ #endif
#include "bits/stdc++.h"
using namespace std;
#define ar array
typedef int64_t ll;
vector<int> Sort(int l, int r){
if(l == r) return {l};
int m = (l + r) >> 1;
auto lx = Sort(l, m), rx = Sort(m + 1, r);
vector<int> res = lx;
res.insert(res.end(), rx.begin(), rx.end());
return res;
}
signed main(){
//~ ios::sync_with_stdio(0); cin.tie(0);
int n = get_n();
//~ vector<int> p = Sort(2, n);
give_answer(1);
}