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

ALGO-9import java.io.*;public class Mainpublic static void main(String args)throws IOExceptionBufferedReader bf=new BufferedReader(new InputStreamReader(System.in);int n=Integer.parseInt(bf.readLine();System.out.println(int)(Math.pow(2,n)-n-1)*2);10import 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 intn;String st = br.readLine().split( );for (int a = 0; a arr.length; a+) arra = Integer.parseInt(sta);Arrays.sort(arr);int m = Integer.parseInt(br.readLine();int tag = new intm;String str = br.readLine().split( );for (int a = 0; a tag.length; a+) taga = Integer.parseInt(stra);Arrays.sort(tag);func(arr, tag);public static void func(int arr, int tag) int x;for (int a = 0; a = 0) System.out.print(arra + );System.out.println();Set set = new HashSet();for (int a = 0; a arr.length; a+) set.add(arra);for (int a = 0; a tag.length; a+) set.add(taga);int sor = new intset.size();Iterator it = set.iterator();while (it.hasNext() for (int a = 0; a sor.length; a+) sora = it.next();Arrays.sort(sor);for (int a = 0; a sor.length; a+) System.out.print(sora + );System.out.println();int y;for (int a = 0; a arr.length; a+) y = Arrays.binarySearch(tag, arra);if (y 0) System.out.print(arra + );System.out.println();11import java.util.Scanner;public class Main public static void main(String args)Scanner input = new Scanner(System.in);int n = input.nextInt();if(1=n & n=10)if(n=1)System.out.println(1);elseint tag = new intn;tag0 = 1;tag1 = 2;if(n=1)System.out.println(tag0);for(int a=2;an;a+)taga = taga-1 + taga-2;System.out.println(tagn-1);12import java.io.BufferedReader;import java.io.InputStreamReader;public class Main public static void main(String args) throws Exception BufferedReader br = new BufferedReader(new InputStreamReader(System.in);int number = Integer.valueOf(br.readLine();toString(Integer.toBinaryString(number);private static void toString(String binary) char temp = binary.toCharArray();boolean control = false;for (int i = 0; i 1) System.out.print();toString(Integer.toBinaryString(mi);System.out.print();13import java.io.*;import java.util.*;public class Main public static void main(String args) throws IOExceptionBufferedReader bf=new BufferedReader(new InputStreamReader(System.in);String s=bf.readLine();String ss=s.split( );int numa=new intss.length;int numb=new intss.length;int numc=new intss.length;for(int i=0;iss.length;i+)numai=Integer.parseInt(ssi);numbi=1;numci=1;int a1=Integer.MIN_VALUE;int a2=Integer.MIN_VALUE;for(int i=0;inuma.length;i+)for(int j=0;ji;j+)if(numainumaj&numbinumbj+1)numbi=numbj+1;a1=Math.max(a1, numbi);for(int i=0;inuma.length;i+)for(int j=0;jnumaj&numci 30) System.out.println(Impossible!);return;long sum = a + b;String str = ;while (sum = n) long tmp = sum % n;sum /= n;if (tmp = 10)str = (char) (55 + tmp) + str;elsestr = tmp + str;if (sum = 10)str = (char) (55 + sum) + str;elsestr = sum + str;String reverse = new StringBuilder(str).reverse().toString();if (!str.equals(reverse) a = Long.parseLong(str, n);b = Long.parseLong(reverse, n);func(a, b); else System.out.println(STEP= + count);return;15import java.util.Scanner;public class Main public static void main(String args) double p = new double10241024;Scanner sc = new Scanner(System.in);int i, j, k = 0;double d1 = sc.nextDouble();double c = sc.nextDouble();double d2 = sc.nextDouble();p01 = sc.nextDouble();int n = sc.nextInt();n+;for (i = 1; i n; i+) pi0 = sc.nextDouble();pi1 = sc.nextDouble();pn+0 = d1;double f = c * d2;for (i = 0; i f) System.out.println(No Solution);return;double min = 0, max, d;for (i = 0; i 0) while (pi + 10 - pk0 - d = f)k+;for (j = k; j = i; j+)if (pj1 d)max = d;d -= max;min += max / d2 * pk1;System.out.println(String.format(%.2f, min);16import java.util.Scanner;public class Main public static void main(String args) Scanner scanner = new Scanner(System.in);int N = scanner.nextInt();int R = scanner.nextInt();char c = 0123456789ABCDEFG.toCharArray();String s1 = N + =;String s = ;while (N != 0) int t = N % R;if (t 0) t = t - R;N = N / R + 1; elseN = N / R;s = ct + s;System.out.println(s1 + s + (base + R + );17import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.io.StreamTokenizer;public class Main public static void main(String args) throws IOException StreamTokenizer st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in);st.nextToken();int N = (int) st.nval;st.nextToken();int K = (int) st.nval;st.nextToken();long M = (long) st.nval;String str = String.valueOf(M);long dp = new longK + 1N + 1;for (int i = 1; i = N; i+) dp0i = Long.parseLong(str.substring(0, i);for (int i = 1; i = K; i+) for (int j = 1 + i; j = N; j+) for (int k = i; k = N; k+) int font = 0;for (int l = k; l j; l+) font = str.charAt(l) - 0 + font * 10;if (dpij dpi - 1k * font)dpij = dpi - 1k * font;System.out.println(dpKN);18import java.util.Scanner;public class Main private static String a = new String20;private static int b = new int20;private static int max;private static int n;public static void main(String args) Scanner scanner = new Scanner(System.in);n = scanner.nextInt();for (int i = 0; i n; i+)ai = scanner.next();String string = scanner.next();f(string, string.length();System.out.println(max);private static void f(String s, int length) for (int i = 0; i n; i+)if (ai.indexOf(s) = 0 & bi 2) int length1 = s.length();int length2 = ai.length();bi+;int p = 1;length = length + length2 - length1;while (p max ? length : max;19import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class Main static int x; static int y; static int n; public static void main(String args) throws IOException BufferedReader br = new BufferedReader(new InputStreamReader(System.in); n = Integer.parseInt(br.readLine(); int tag = new int2 * n + 12 * n + 1; int arr = new intn * n2; out: for (int i = 1; ; i+) String str = br.readLine().split( ); for (int j = 0; j 1; j+) x = arri0 = Integer.parseInt(str0); y = arri1 = Integer.parseInt(str1); tagxy = Integer.parseInt(str2); if (x = 0 & y = 0 & tagxy = 0) dp(tag); break out; public static void dp(int tag) int temp = new int2 * n2 * n; int k; for (int i = 2; i 0; j-) for (k = t; k 0; k-) tempjk = max(tempjk, tempj - 1k - 1); tempjk = max(tempjk, tempj - 1k); tempjk = max(tempjk, tempjk - 1); if (j = k) tempjk += tagji - j; else tempjk += tagji - j + tagki - k; System.out.println(tempnn); public static int max(int a, int b) return a b ? a : b; public static int min(int a, int b) return a b ? b : a; 20import java.util.Scanner;public class Main public static void main(String args) Scanner scanner = new Scanner(System.in);while (scanner.hasNext() String str1 = scanner.nextLine();String str2 = scanner.nextLine();showResult(str1, str2);System.out.println();private static void showResult(String str1, String str2) char chl = str2.charAt(str2.length() - 1);System.out.print(chl);int index = str1.indexOf(chl);if (index 0) showResult(str1.substring(0, index), str2.substring(0, index);if (index str1.length() - 1) showResult(str1.substring(index + 1),str2.substring(index, str2.length() - 1);21import java.io.*;import java.util.*;public class Main private static int v=new int3120001;public static void main (String args)throws Exception/Scanner sc=new Scanner(System.in);BufferedReader bf=new BufferedReader(new InputStreamReader(System.in);/int n=sc.nextInt();/int m=sc.nextInt();int n=Integer.parseInt(bf.readLine();int m=Integer.parseInt(bf.readLine();int a=new intm+1;for(int i=1;i=m;i+)ai=Integer.parseInt(bf.readLine();/ai=sc.nextInt();for(int i=1;i=m;i+)for(int j=1;j=n;j+)if(jai)vij=vi-1j;elsevij=Math.max(vi-1j, vi-1j-ai+ai);System.out.println(n-vmn);22import java.util.Scanner;public class Main public static void main(String args) Scanner s = new Scanner(System.in);int n = s.nextInt();int m = s.nextInt();int f = new int25010;for (int i = 0; i = n; i+) fi1 = 1;for (int i = 2; i = m; i+) for (int j = 0; j j) fji = fji - 1; else fji = fji - 1 + fj - ii;System.out.println(fn - mm);23import java.util.Scanner;public class Main public static void main(String args) Scanner sc = new Scanner(System.in);double a = sc.nextDouble();double b = sc.nextDouble();double c = sc.nextDouble();double d = sc.nextDouble();for(double x=-100;x=100;x+=.001) if(Math.abs(a*x*x*x+b*x*x+c*x+d) .01) System.out.printf(%.2f , x);x+;24import java.util.Scanner;public class Mainstatic int p;static int k;static String S;static int wordsize;static String Word;static int num = 0;static int maxnum = 0;static int kefenge = 0;public static void main(String args) Scanner sc = new Scanner(System.in);p = sc.nextInt();k = sc.nextInt();S = ;sc.nextLine();for (int i = 0; i p; i+) S = S + sc.nextLine();wordsize = sc.nextInt();Word = new Stringwordsize;for (int i = 0; i wordsize; i+) Wordi = sc.next();zhaodanci(S);if(kefengek)num = num-(k-1);System.out.println(num);/System.out.println(kefenge);public static void zhaodanci(String s)boolean meizhaodao = true;for(int i = 0;is.length();i+)for(int j = 0;jwordsize;j+)if(s.substring(i,s.length().length()Wordj.length()continue;if(s.substring(i,i+Wordj.length().length()Wordj.length()continue;if(s.substring(i,i+Wordj.length().equals(Wordj)/System.out.println(s+:+Wordj);num+;if(i != 0)kefenge+;zhaodanci(s.substring(i+1,s.length();return;25该题暂时没有人完全正确，暂时没有该语言的参考程序。26import java.io.*;import java.math.BigInteger;public class Main public static void main(String args) throws IOException BufferedReader br = new BufferedReader(new InputStreamReader(System.in);int p = Integer.parseInt(br.readLine();String result;BigInteger a = new BigInteger(2);result = pow(a, p).toString();int count = result.length();for (int b = 0; b 500 - count; b+)result = 0 + result;System.out.println(int) (p * Math.log10(2) + 1);for (int b = 0; b 0) if (b % 2 = 1) x = x.multiply(a);s = x.toString();len = s.length();if (len 500) x = new BigInteger(s.substring(len - 500, len);a = a.pow(2);s = a.toString();len = s.length();if (len 500) a = new BigInteger(s.substring(len - 500, len);b /= 2;return x.subtract(new BigInteger(1);27import java.util.*;import java.lang.*;public class Main static class TreeNode String data; TreeNode lchild ; TreeNode rchild ; public String getData() return data; public TreeNode getLchild() return lchild; public TreeNode getRchild() return rchild; public void setNode(String data,TreeNode lc,TreeNode rc) this.data = data; lchild = lc; rchild = rc; static TreeNode create(TreeNode root,String ss)if(ss.length()=1) root.setNode(ss, null, null); return root;TreeNode tl=new TreeNode();TreeNode tr=new TreeNode();root.setNode(ss, create(tl,ss.substring(0,ss.length()/2), create(tr,ss.substring(ss.length()/2,ss.length();return root;static void ff(TreeNode root)if(root!=null)ff(root.getLchild();ff(root.getRchild();System.out.print(ff1(root.getData();static char ff1(String s)int i,j;char c=F;for(i=0;is.length();i+)if(s.charAt(i)=1)break;for(j=0;js.length();j+)if(s.charAt(j)=0)break;if(i=s.length()c=B;if(j=s.length()c=I;return c;public static void main(String args) Scanner sc=new Scanner(System.in); int n=sc.nextInt(); String s=sc.next();sc.close();int m=1,j;TreeNode root=new TreeNode();for(int i=1;i=n;i+)m*=2;for(j=0;j1|s.charAt(j)0)break;if(s.length()!=m|js.length()System.out.print(error);elsecreate(root,s);ff(root);28import java.io.*;public class Main public static void main(String args) throws NumberFormatException, IOException BufferedReader bf=new BufferedReader(new InputStreamReader(System.in);int n=Integer.pars