蓝桥杯练习系统算法训练答案Java.docVIP

ALGO-9 import java.io.*; public class Main{ public static void main(String args[])throws IOException{ BufferedReader bf=new BufferedReader(new InputStreamReader(System.in)); int n=Integer.parseInt(bf.readLine()); System.out.println((int)(Math.pow(2,n)-n-1)*2); } } 10 import java.io.*; import java.util.Arrays; import java.util.HashSet; import java.util.Iterator; import java.util.Set; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[] arr = new int[n]; String st[] = br.readLine().split( ); for (int a = 0; a arr.length; a++) { arr[a] = Integer.parseInt(st[a]); } Arrays.sort(arr); int m = Integer.parseInt(br.readLine()); int[] tag = new int[m]; String str[] = br.readLine().split( ); for (int a = 0; a tag.length; a++) { tag[a] = Integer.parseInt(str[a]); } Arrays.sort(tag); func(arr, tag); } public static void func(int[] arr, int[] tag) { int x; for (int a = 0; a arr.length; a++) { x = Arrays.binarySearch(tag, arr[a]); if (x = 0) { System.out.print(arr[a] + ); } } System.out.println(); SetInteger set = new HashSetInteger(); for (int a = 0; a arr.length; a++) { set.add(arr[a]); } for (int a = 0; a tag.length; a++) { set.add(tag[a]); } int[] sor = new int[set.size()]; IteratorInteger it = set.iterator(); while (it.hasNext()) { for (int a = 0; a sor.length; a++) { sor[a] = it.next(); } } Arrays.sort(sor); for (int a = 0; a sor.length; a++) { System.out.print(sor[a] + ); } System.out.println(); int y; for (int a = 0; a arr.length; a++) { y = Arrays.binarySearch(tag, arr[a]); if (y 0) { System.out.print(arr[a] + ); } } System.out.println(); } } 11 import java.util.Scanner; public class Main { public static void main(String []args) { Scanner input = new Scanner(System.in);