问题 1634: 蓝桥杯算法训练VIP-数组查找及替换

import java.util.Arrays;

import java.util.Scanner;

public class Prog1634 {

public static void main(String[] args) {

Scanner scan = new Scanner(System.in);

int n = scan.nextInt();

int m = scan.nextInt();

int arr[] = new int[n];

for (int i = 0; i < n; i++) {

arr[i] = scan.nextInt();

}

for (int i = 0; i < n; i++) {

if (arr[i] % m == 0) {

arr[i] = 0;

}

}

Arrays.sort(arr);

for (int i = 0; i < n; i++) {

if (arr[i] != 0) {

if (arr[i] >= 'A' && arr[i] <= 'Z')

System.out.print((char) arr[i] + " ");

else

System.out.print(arr[i] + " ");

}

}

}

}