| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 18031 | gs13068 | 카드 역배치 (KOI15_reversal) | C++98 | 0 ms | 1084 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 <algorithm>
using namespace std;
int a[22];
int main()
{
int i, j, k;
for (i = 1; i <= 20; i++) a[i] = i;
for (i = 1; i <= 10; i++)
{
scanf("%d%d", &j, &k);
reverse(a + j, a + k + 1);
}
for (i = 1; i <= 20; i++) printf("%d ", a[i]);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||