-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1133 - Array Simulation.cpp
75 lines (71 loc) · 1.57 KB
/
1133 - Array Simulation.cpp
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
74
75
#include <bits/stdc++.h>
using namespace std;
int main()
{
int tc, cn=0, n,m,ara[110],i,num1,num2,temp,j,k;
char c;
cin >> tc;
while(tc--)
{
cin >>n>>m;
for(i=0;i<n;i++)
{
cin >> ara[i];
}
for(j=1;j<=m;j++)
{
cin >> c;
if(c=='S')
{
cin >> num1;
for(i=0;i<n;i++)
{
ara[i] = ara[i] + num1;
}
}
else if(c=='M')
{
cin >> num1;
for(i=0;i<n;i++)
{
ara[i] = ara[i] * num1;
}
}
else if(c=='D')
{
cin >> num1;
for(i=0;i<n;i++)
{
ara[i] = ara[i] / num1;
}
}
else if(c=='R')
{
for(i=0,k=n-1;i<n/2;i++,k--)
{
temp = ara[i];
ara[i] = ara[k];
ara[k] = temp;
}
}
else if(c=='P')
{
cin >> num1 >> num2;
temp = ara[num1];
ara[num1] = ara[num2];
ara[num2] = temp;
}
}
printf("Case %d:\n",++cn);
for(i=0;i<n;i++)
{
if(i==(n-1))
{
cout << ara[i] <<endl;
break;
}
cout << ara[i] <<" ";
}
}
return 0;
}