# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18033 | gs14004 | 카드 역배치 (KOI15_reversal) | C++14 | 0 ms | 1720 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 <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int,int> pi;
int main(){
int a[21];
for(int i=1; i<=20; i++) a[i] = i;
for(int i=0; i<10; i++){
int aa, b;
scanf("%d %d",&aa,&b);
reverse(a+aa,a+b+1);
}
for(int i=1; i<=20; i++) printf("%d ",a[i]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |