// HJ1 字符串最后一个单词的长度importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){Scanner in =newScanner(System.in);while(in.hasNextLine()){String[] arr = in.nextLine().split(" ");System.out.println(arr[arr.length -1].length());}}}// HJ2 计算某字符出现次数importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){int count =0;Scanner in =newScanner(System.in);while(in.hasNextLine()){String line = in.nextLine();char c = in.nextLine().toUpperCase().charAt(0);String str = line.toUpperCase();for(char c1 : str.toCharArray()){if(c1 == c) count++;}}System.out.println(count);}}// HJ3 明明的随机数importjava.util.ArrayList;importjava.util.Collections;importjava.util.HashSet;importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){Scanner in =newScanner(System.in);intN= in.nextInt();HashSet<Integer> set =newHashSet<>();for(int i =0; i <N; i++){
set.add(in.nextInt());}ArrayList<Integer> list =newArrayList<>(set);Collections.sort(list);for(Integer it : list){System.out.println(it);}}}// HJ4 字符串分隔importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){Scanner in =newScanner(System.in);String line = in.nextLine();int mod = line.length()%8;if(mod !=0){StringBuffer sb =newStringBuffer();for(int i =0; i <8- mod; i++){
sb.append("0");}
line = line + sb.toString();}for(int i =0; i < line.length(); i +=8){System.out.println(line.substring(i, i +8));}}}// HJ6 质数因子// 质数因子:质数又叫素数,指的是在大于1的自然数中,除了1和它本身以外不再有其他因数的自然数// HJ7 取近似值importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){Scanner in =newScanner(System.in);float f = in.nextFloat();String str =String.valueOf(f);int index = str.indexOf(".");char c = str.charAt(index +1);if(c <'5'){System.out.println(Integer.valueOf((int)Math.floor(f)));}else{System.out.println(Integer.valueOf((int)Math.ceil(f)));}}}// HJ8 合并表记录importjava.util.HashMap;importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){Scanner in =newScanner(System.in);int num = in.nextInt();String tt = in.nextLine();HashMap<Integer,Integer> map =newHashMap<>();for(int i =0; i < num; i++){String line = in.nextLine();String[] input = line.split(" ");Integer key =Integer.valueOf(input[0]);if(map.containsKey(key)){
map.put(key, map.get(key)+Integer.valueOf(input[1]));}else{
map.put(key,Integer.valueOf(input[1]));}}for(int i =0; i <=11111111; i++){if(map.containsKey(i)){System.out.println(i +" "+ map.get(i));}}}}// HJ9 提取不重复的整数importjava.util.HashSet;importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){Scanner in =newScanner(System.in);int num = in.nextInt();HashSet<Character> set =newHashSet<>();String str =newStringBuffer(String.valueOf(num)).reverse().toString();StringBuffer sb =newStringBuffer();for(Character c : str.toCharArray()){if(!set.contains(c)){
sb.append(c);
set.add(c);}}System.out.println(sb.toString());}}// HJ10 字符个数统计importjava.util.HashSet;importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){Scanner in =newScanner(System.in);String line = in.nextLine();char[] chars = line.toCharArray();HashSet<Character> set =newHashSet<>();for(char aChar : chars){if(!set.contains(aChar)){
set.add(aChar);}}System.out.println(set.size());}}