# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18054 | chan492811 | 카드 역배치 (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>
#define n 10
using namespace std;
int arr[30];
int main(){
int i,j,a,s;
for(i=1;i<=20;i++) arr[i]=i;
for(i=0;i<n;i++){
scanf("%d %d",&a,&s);
for(j=a;j<=(s+a)/2;j++) swap(arr[j],arr[s-j+a]);
}
for(i=1;i<=20;i++) printf("%d ",arr[i]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |