import java.util.Scanner;
public class Main {
public static void main(String[] args){
int[] pos = new int[100];
int i = 0, n, L, t;
Scanner s = new Scanner(System.in);
n = s.nextInt();
L = s.nextInt();
t = s.nextInt();
for (i=0; i<n; i++){
pos[i] = s.nextInt();
}
while (t > 0){
for (i=0; i<n; i++){
if(pos[i] < L){
pos[i] += 1;
}else{
pos[i] = -pos[i];
pos[i] += 1;
}
}
change(pos, n);
t--;
}
for (i=0; i < n; i++){
System.out.printf("%d ",Math.abs(pos[i]));
}
}
public static void change(int arr[],int n){
int i, j;
for (i=0; i<n; i++){
for (j=i+1; j<n; j++){
if (Math.abs(arr[i])==Math.abs(arr[j])){
arr[i] = -arr[i];
arr[j] = -arr[j];
break;
}
}
}
}
}
CCF-CSP模拟试题201803-2 碰撞的小球 java
最新推荐文章于 2023-11-22 10:41:03 发布