蓝桥杯算法训练答案c语言,蓝桥杯练习系统算法训练答案Java.doc

ALGO-9 import java.io

public class Main)

public static void main(String args[])throws lOException{

BufferedReader bf=new BufferedReader(new InputStreamReader(System.in)); int n=Intege匚parseInt(bf?『eadLine());

System.out.println((int)(Math.pow(2,n)-n-l)*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 = Intege匚parselnt(b匚readLine());

int[] arr = new int[n];

String st[] = br.readLine().split(" ”)；

for (int a = 0; a < air.length; a++) {

arr [a] = Intege r.parselnt(st[a]);

}

Arrays.sort(arr);

int m = Integer.parseInt(br.readLine());

int[] tag = new int[m];

Siring str[] = br.readLine().split("");

for (int a = 0; a < tag length; a++) {

tag[a] = Integer.parselnt(str[aj);

}

Arrays.sort(tag);

func(arr, tag);

}

public static void func(int[J 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] +11 n);

System.out.println();

Set set = new HashSet(); 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[setsize()];

Iterator 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 < so匚length; a++) { System.out.print(sor[a] + H M);

}

System.out.println();

inty;

for (int a = 0; a < arr.length; a++) { y = Arrays.binarySearch(tag, arr[aj); if(y

System.out.print(arr[a] +11 n);

}

}

System.out.printl n();

}

}

11

import java.util.Scanner;

public class Main

{

public static void main(String fjargs)

{

Scanner input = new Scanner(System.in); int n = input.nextlntO;

if(l<=n && nv=10)

if(n==l)

{

System.out.println(H 1n);

}

else

{

int |]tag = new int[n];

tag[0] = 1 ；

tagfl] =