1 条题解
-
0
C :
#include<stdio.h> int main() { int n,m,i,j,k; scanf("%d",&n); int a[n]; for(i=0;i<n;i++) { scanf("%d",&a[i]); } scanf("%d",&m); for(i=n-m;i<n;i++) { printf("%d ",a[i]); } for(i=0;i<n-m;i++) { printf("%d ",a[i]); } }C++ :
#include<iostream> using namespace std; int main() { int a[1000],b[1000],n,m; while(cin>>m) { for(int i=1;i<=m;i++) cin>>a[i]; cin>>n; for(int i=1;i<=n;i++) cout<<a[m-n+i]<<' '; for(int i=1;i<=m-n;i++) cout<<a[i]<<' '; cout<<endl; } }Java :
import java.util.Scanner; public class Main { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner input = new Scanner(System.in); int num = input.nextInt(); int index ,j = 0; int[] a = new int[num]; int[] b = new int[num]; for(int i = 0; i < num; a[i++] = input.nextInt()); index = input.nextInt(); for(int i = num-1; i >= num-index; i --){ b[j++] = a[i]; } for(int i = num-index-1; i >= 0; i --){ a[i+index] = a[i]; } int k = j; for(int i = 0; i < k; i ++){ a[i] = b[j-1]; j--; } for(int i = 0; i < num; i ++){ System.out.print(a[i] + " "); } input.close(); } }Python :
a =[ map(lambda x:int(x), raw_input().split()) for i in range(3)] n = a[0][0] m = a[2][0] a = a[1] a = a[-m:]+a[:n - m ] print str(a).replace(', ',' ')[1:-1]+' '
- 1
信息
- ID
- 2030
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- (无)
- 递交数
- 0
- 已通过
- 0
- 上传者