-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.txt
73 lines (68 loc) · 1.4 KB
/
main.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <cmath>
#include <string>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
//
//void swapIt(int *a, int *b)
//{
// int temp = *a;
// *a = *b;
// *b = temp;
//}
int main() {
int m,n;
cin>>m;
cin>>n;
int size=m*n;
int arr[size];
for(int i=0;i<size;i++)
{
cin>>arr[i];
}
string query;
cin>>query;
int temp;
for(long unsigned int i=0;i<query.length();i++)
{
switch(query[i])
{
case 'x':
for(int x=0;x<n;x++)
{
for(int y=0;y<m/2;y++)
{
temp=arr[n*x+y];
arr[n*x+y]=arr[n*x+(m-1-y)];
arr[n*x+(m-1-y)]=temp;
}
}
break;
case 'y':
for(int x=0;x<n;x++)
{
for(int y=0;y<m/2;y++)
{
temp=arr[n*x+y];
arr[n*x+y]=arr[n*(n-1-x)+y];
arr[n*(n-1-x)+y]=temp;
}
}
break;
}
}
int k=0;
for(int i=0;i<size;i++)
{
cout<<arr[i]<<" ";
k++;
if(k==m)
{
cout<<"\n";
k=0;
}
}
return 0;
}