蓝桥杯练习系统基础练习

最新推荐文章于 2026-03-16 01:21:54 发布

原创最新推荐文章于 2026-03-16 01:21:54 发布 · 522 阅读

4 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

学习分享

java

蓝桥杯

本文提供了一系列蓝桥杯竞赛的编程题目解答，包括数列排序、十六进制转十进制、特殊回文数、杨辉三角形等经典算法题目的Java实现，适合初学者学习和练习。

蓝桥杯练习系统基础练习

基础练习

基础练习

直接上代码，github实时更新，但可能部分没有，小弟很菜，大佬勿喷，部分代码非满分代码，GitHub网址

数列排序

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
	public static void main(String args[]) {
		
		//1、定义变量，请求储存空间
		 BufferedReader strin = new BufferedReader(new InputStreamReader(System.in));
		 int a=0;
		 String num="";
		 StringTokenizer stringTokenizer = null;
		 try {
			a = Integer.parseInt(strin.readLine());
			num =strin.readLine();
			stringTokenizer = new StringTokenizer(num, " ");
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		int[] numa = new int[a];
		for(int i=0;i<numa.length;i++) {
			numa[i] = Integer.parseInt(stringTokenizer.nextToken());
		}
		for(int j=0;j<numa.length;j++) {
			for(int m=j+1;m<numa.length;m++) {
				if(numa[m]<numa[j]) {
					a=numa[m];
					numa[m]=numa[j];
					numa[j]=a;
				}
			}
		}
		for(int k=0;k<numa.length;k++) {
			System.out.print(numa[k]+" ");
		}
	}

}

十六进制转十进制


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		 BufferedReader strin = new BufferedReader(new InputStreamReader(System.in));
		 try {
			System.out.println(Integer.parseInt(strin.readLine(), 16));
		} catch (NumberFormatException | IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

}

特殊回文数

import java.util.Scanner;//输入流的方法
public class Main {
	@SuppressWarnings({ "resource" })
	public static void main(String args[]) {
		
		//1、定义变量，请求储存空间
		Scanner banjing = new Scanner(System.in);
		long num = banjing.nextInt();
		if(1 <= num||num <= 1000000000)
		System.out.println(num*(1+num)/2);
		else
			return;
	}

}

回文数

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int n=new Scanner(System.in).nextInt();
        List<String> list=new ArrayList<>();
        for (int i = 1; i <10 ; i++) {
            for (int j = 0; j <10 ; j++) {
                for (int k = 0; k < 10 ; k++) {
                    if ((2*i+2*j+k)==n){
                        System.out.println(i+""+j+""+k+""+j+""+i);
                    }else if ((2*i+2*j+2*k)==n){
                        list.add(i+""+j+""+k+""+k+""+j+""+i);
                    }
                }
            }
        }
        for (String s:
             list) {
            System.out.println(s);
        }
    }
}

特殊的数字

public class Main {
    public static void main(String[] args) {
        for (int i = 100; i <1000 ; i++) {
            int m,n,k;
            m=i%10;
            n=i/10%10;
            k=i/100;
            if (i==((m*m*m)+(n*n*n)+(k*k*k))){
                System.out.println(i);
            }
        }
    }
}

杨辉三角形

import java.util.Scanner;
public class Main {


    public static void main(String[] args) {
        int n = new Scanner(System.in).nextInt();
        int[][] a=new int[n][n];
        for (int i = 0; i < n; i++) {
            a[i][0]=1;
            a[i][i]=1;
            if (i>1){
                for (int j = 1; j < i; j++) {
                    a[i][j]=a[i-1][j-1]+a[i-1][j];
                }
            }
        }
        for (int i = 0; i <n ; i++) {
            for (int j = 0; j <= i; j++) {
                System.out.print(a[i][j]+" ");
            }
            System.out.println();
        }
    }

}

查找整数

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
    static Scanner sc = new Scanner(System.in);
    public static void main(String[] args) {
        int n = Integer.parseInt (sc.nextLine());
        String m = sc.nextLine();
        String[] mn = m.split(" ");
        List<Integer> mm = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            mm.add(Integer.parseInt(mn[i]));
        }
        int num = Integer.parseInt (sc.nextLine());
        System.out.println(mm.indexOf(num)+1);
    }
}

数列特征

import java.util.Scanner;

public class Main {
    static Scanner sc = new Scanner(System.in);
    public static void main(String[] args) {
        int n = Integer.parseInt (sc.nextLine());
        if (n >=1&&n<=10000) {
            String m = sc.nextLine();
            String[] mn = m.split(" ");
            if (mn.length!=n){
                return;
            }
            int min=Integer.parseInt(mn[0]),max=Integer.parseInt(mn[0]),sum=0;
            for (int i = 0; i < n; i++) {
                min=min<Integer.parseInt(mn[i])?min:Integer.parseInt(mn[i]);
                max=max>Integer.parseInt(mn[i])?max:Integer.parseInt(mn[i]);
                sum+=Integer.parseInt(mn[i]);
            }
            System.out.println(max);
            System.out.println(min);
            System.out.println(sum);
        }


    }
}

字母图形

import java.util.Scanner;
public class Main {
    static Scanner sc = new Scanner(System.in);
    public static void main(String[] args) {
        String[] num=sc.nextLine().split(" ");
        String str="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
        String str1="ZYXWVUTSRQPONMLJKIHGFEDCB";
        if (num.length!=2){return;}
        String result="";
        int n = Integer.parseInt(num[1]);
        int m = Integer.parseInt(num[0]);
        if (m>26||n<1){return;}
        for (int i = 0; i < m; i++) {
            result=str1.substring(str1.length()-i)+str.substring(0,n-i);
            System.out.println(result);
        }
    }
}

01字串

public class Main {
    public static void main(String[] args) {
        for (int i = 0; i <2 ; i++) {
            for (int j = 0; j < 2; j++) {
                for (int k = 0; k < 2; k++) {
                    for (int l = 0; l < 2; l++) {
                        for (int m = 0; m < 2; m++) {
                            System.out.println(i+""+j+""+k+""+l+""+m);
                        }
                    }
                }
            }
        }
    }
}

闰年判断

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		BufferedReader strin = new BufferedReader(new InputStreamReader(System.in));
		int year = 0;
		try {
			year = Integer.parseInt(strin.readLine());
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		if (year%400==0) {
			System.out.println("yes");
		} else if(year%4==0&&year%100!=0){
			System.out.println("yes");
		}else {
			System.out.println("no");
		}
	}

}