第十一届蓝桥杯b组(10月真题)

没了 哈哈哈哈哈

答案：624

代码：

public class Main{
    public static void main(String[] args){
        int res  = 0;
       for(int i=1;i<=2020;i++){
           res += count(i);
       }
       System.out.println(res);
    }
    public static int count(int x){
        int sum = 0;
        while(x>0){
            int t = x%10;
            x /= 10;
            if(t==2) sum ++;
        }
        return sum;
    }
}

答案：16520
这题的数据没有 只有题目
代码：

import java.util.Scanner;

public class Main{
    static int n,res;
    static char[][] arr;
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        arr = new char[n+5][];
        for(int i=0;i<n;i++){
            arr[i] = sc.next().toCharArray();
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<arr[i].length;j++){
                if(arr[i][j]=='2'){
                    hang(i,j);
                    lie(i,j);
                    dui(i,j);
                }
            }
        }
        System.out.println(res);
    }
    public static void hang(int x,int y){
        int tx = x;
        int ty = y;
        for(int i=0;i<3;i++){
            ty ++;
            if(ty>=arr[tx].length||arr[tx][ty]==arr[tx][ty-1]) return;
        }
        res ++;
    }
    public static void lie(int x,int y){
        int tx = x;
        int ty = y;
        for(int i=0;i<3;i++){
            tx++;
            if(tx>=n||arr[tx][ty]==arr[tx-1][ty]) return ;
        }
        res ++;
    }
    public static void dui(int x,int y){
        int tx = x;
        int ty = y;
        for(int i=0;i<3;i++){
            tx++;
            ty++;
            if(tx>=n||ty>=arr[tx].length||arr[tx][ty]==arr[tx-1][ty-1]) return ;
        }
        res ++;
    }
}

答案 ：761

代码：

public class Main{
    static int[][] arr = new int[100][100];
    public static void main(String[] args){
        get_ans();
        System.out.println(arr[19][19]);
    }
    public static void get_ans(){
        int tx = 0;
        int ty = 0;
        int data = 1;
        arr[tx][ty] = data++;
        while(arr[19][19]==0){
            if(tx==0){
                ty++;
                arr[tx][ty] = data++;
                while(ty!=0){
                    tx ++;
                    ty --;
                    arr[tx][ty] = data++;
                }
            }else if(ty==0){
                tx++;
                arr[tx][ty] = data++;
                while(tx!=0){
                    tx --;
                    ty ++;
                    arr[tx][ty] = data++;
                }
            }
        }
    }
}

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.TreeSet;

public class Main{
    static int res = 0;
    static int[][] arr = new int[10][10];
    static boolean[] flag = new boolean[10];
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        arr[1][2] = 1;
        arr[1][6] = 1;
        arr[2][1] = 1;
        arr[2][7] = 1;
        arr[2][3] = 1;
        arr[3][2] = 1;
        arr[3][7] = 1;
        arr[3][4] = 1;
        arr[4][3] = 1;
        arr[4][5] = 1;
        arr[5][4] = 1;
        arr[5][6] = 1;
        arr[5][7] = 1;
        arr[6][1] = 1;
        arr[6][5] = 1;
        arr[6][7] = 1;
        arr[7][2] = 1;
        arr[7][3] = 1;
        arr[7][5] = 1;
        arr[7][6] = 1;
        dfs(1,0);
        System.out.println(res);
    }
    public static void dfs(int x,int cnt){//当前判断的是x 判断了y个数 选了cnt个
       if(x==8){
           int sum = 0;
           for(int i=1;i<=7;i++){
               int[] book = new int[10];
               if(flag[i]){
                   Queue<Integer> queue = new LinkedList<>();
                   queue.add(i);
                   book[i] = 1;
                   while(queue.size()>0){
                       int no = queue.poll();
                       sum ++;
                       for(int j=1;j<=7;j++){
                           if(arr[no][j]==1&&flag[j]&&book[j]==0){
                               book[j] = 1;
                               queue.add(j);
                           }
                       }
                   }
                   break;
               }
           }
           if(sum!=0&&sum==cnt) res ++;
           return;
       }
       flag[x] = true;
       dfs(x+1,cnt+1);
       flag[x] = false;
       dfs(x+1,cnt);
    }
}

import java.util.Arrays;
import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        int sum = 0;
        for(int i=0;i<n;i++){
            arr[i] = sc.nextInt();
            sum += arr[i];
        }
        double ave = 1.0*sum/n;
        Arrays.sort(arr,0,n);
        System.out.println(arr[n-1]);
        System.out.println(arr[0]);
        System.out.printf("%.2f",ave);
    }
}

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        char[] ch = sc.next().toCharArray();
        int res = -1;
        int sum = 0;
        int[] arr = new int[26];
        for(int i=0;i<ch.length;i++){
            int t = ch[i]-'a';
            arr[t]++;
        }
        for(int i=0;i<26;i++){
            if(sum<arr[i]){
                sum = arr[i];
                res = i;
            }
        }
        char ans = (char) ('a' +res);
        System.out.println(ans);
        System.out.println(sum);
    }
}

菜鸡只会爆搜。。。。这题应该废了

import java.util.Scanner;

public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        long len = s.length();
        char[] ch = new char[(int)len+5];
        for(int i=1;i<=len;i++) ch[i] = s.charAt(i-1);
        long res = 0;
        long[] pre = new long[30];
        for(int i=1;i<=len;i++){
            res += (i-pre[ch[i]-'a'])*(len-i+1);
            pre[ch[i]-'a'] = i;
        }
        System.out.println(res);
    }
}