# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18861 | Namnamseo | 카드 역배치 (KOI15_reversal) | C++14 | 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>
int main()
{
int data[21];
int i;
for(i=1;i<=20;++i) data[i]=i;
int a,b;
for(i=1;i<=10;++i){
scanf("%d%d",&a,&b);
std::reverse(data+a,data+b+1);
}
for(i=1; i<=20; ++i) printf("%d ",data[i]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |