@@ -0,0 +1,762 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A  public static void main(String%5B%5D args) %7B%0A    Map%3CString, Integer%3E contacts = new HashMap%3CString, Integer%3E();%0A    Scanner sc = new Scanner(System.in);%0A%0A    int n = Integer.parseInt(sc.nextLine()); // number of contacts%0A%0A    for (int i = 0; i %3C n; i ++) %7B%0A      String name = sc.nextLine();%0A      Integer number = Integer.parseInt(sc.nextLine());%0A      contacts.put(name, number);%0A    %7D%0A%0A    while (sc.hasNext()) %7B%0A      String query = sc.nextLine();%0A      if (contacts.containsKey(query)) %7B%0A        System.out.println(query + %22=%22 + contacts.get(query));%0A      %7D else %7B%0A        System.out.println(%22Not found%22);%0A      %7D%0A    %7D%0A  %7D%0A%0A%7D%0A

Solve java map