-
Notifications
You must be signed in to change notification settings - Fork 0
/
1008.cpp
111 lines (109 loc) · 2.11 KB
/
1008.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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
<<<<<<< HEAD
// luogu-judger-enable-o2
#include<bits/stdc++.h>
#include<unordered_set>
#define rg register ll
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 300005
#define lb(x) (x&(-x))
const double eps = 1e-6;
using namespace std;
inline ll read()
{
char ch = getchar(); ll s = 0, w = 1;
while (ch < 48 || ch>57) { if (ch == '-')w = -1; ch = getchar(); }
while (ch >= 48 && ch <= 57) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
return s * w;
}
inline void write(ll x)
{
if (x < 0)putchar('-'), x = -x;
if (x > 9)write(x / 10);
putchar(x % 10 + 48);
}
ll n,k,a[maxn];
queue<ll>q;
int main()
{
cin>>n>>k;
for(rg i=1;i<=n;i++)
{
ll x=read();
a[i]=x;
q.push(x);
}
k=k%n;
k=n-k;
for(rg i=1;i<=k;i++)
{
ll k=q.front();
q.pop();
q.push(k);
}
while(!q.empty())
{
if(q.size()!=1)
cout<<q.front()<<" ";
else cout<<q.front();
q.pop();
}
return 0;
}
=======
// luogu-judger-enable-o2
#include<bits/stdc++.h>
#include<unordered_set>
#define rg register ll
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 300005
#define lb(x) (x&(-x))
const double eps = 1e-6;
using namespace std;
inline ll read()
{
char ch = getchar(); ll s = 0, w = 1;
while (ch < 48 || ch>57) { if (ch == '-')w = -1; ch = getchar(); }
while (ch >= 48 && ch <= 57) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
return s * w;
}
inline void write(ll x)
{
if (x < 0)putchar('-'), x = -x;
if (x > 9)write(x / 10);
putchar(x % 10 + 48);
}
ll n,k,a[maxn];
queue<ll>q;
int main()
{
cin>>n>>k;
for(rg i=1;i<=n;i++)
{
ll x=read();
a[i]=x;
q.push(x);
}
k=k%n;
k=n-k;
for(rg i=1;i<=k;i++)
{
ll k=q.front();
q.pop();
q.push(k);
}
while(!q.empty())
{
if(q.size()!=1)
cout<<q.front()<<" ";
else cout<<q.front();
q.pop();
}
return 0;
}
>>>>>>> a45269a6f9ce61abed19a3dbc4d5ff91c7b4ed44