首页
IT
登录
6mi
u
盘
搜
搜 索
IT
数组逆序,移位
数组逆序,移位
xiaoxiao
2021-12-14
22
#include<stdio.h>
#define N 100
int
main() {
int
a[N],b[N];
int
t,i,j,n,
m
,count,T,k; scanf(
"
%d
"
,&n);
for
(i=
0
;i<=n-
1
;i++) { scanf(
"
%d
"
,&a[i]); } scanf(
"
%d
"
,&
m
);
for
(i=
0
;i<=
m
-
1
;i++) { t=a[n-
1
];
for
(j=n-
2
;j>=
0
;j--) { a[j+
1
]=a[j]; } a[
0
]=t; }
for
(i=
0
;i<=n-
1
;i++) {
if
(i!=n-
1
)
printf
(
"
%d
"
,a[i]);
else
printf
(
"
%d
\n"
,a[i]); }
return
0
; }
转载请注明原文地址: https://ju.6miu.com/read-972375.html
专利
最新回复
(
0
)