每个案例第一行两个整数N,M,2 <= N ,M<= 200。接下来有N行,第i(i = 1,2,…,N)行每一行有一个数,表示读者i-1最喜欢的图书的编号P(1<=P<=M)
每个案例包括N行,每行一个数,第i行的数表示读者i有几个潜在朋友。如果i和任何人都没有共同喜欢的书,则输出“BeiJu”(即悲剧,^ ^)
4 5 2 3 2 1
1 BeiJu 1 BeiJu
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String s; while ((s = br.readLine()) != null) { String[] ss = s.split(" "); int N = Integer.parseInt(ss[0]); int M = Integer.parseInt(ss[1]); int[] a = new int[N]; int[] b = new int[M + 1]; Arrays.fill(b, 0); for (int i = 0; i < N; i++) { a[i] = Integer.parseInt(br.readLine()); b[a[i]]++; } for (int i = 0; i < N; i++) { if (b[a[i]] == 1) System.out.println("BeiJu"); else System.out.println(b[a[i]]-1); } } } }
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int m = scanner.nextInt(); int[] books = new int[m+1]; int[] record= new int[n+1]; for (int i = 1; i <= n; i++) { int j = scanner.nextInt(); books[j]++; record[i]=j; } for (int i = 1; i <= n; i++) System.out.println(books[record[i]]==1?"BeiJu":books[record[i]]-1); } }