声明：蓝桥杯练习系统中的Java环境为1.8.0

BASIC-1

import java.util.Scanner;


public class Main {
   

	public static void main(String[] args) {
   

		Scanner sc = new Scanner(System.in);
		int year = sc.nextInt();
		if((year%4==0 && year%100!=0) || year%400==0){
   
			System.out.println("yes");
		}else
		System.out.println("no");
	}

}

BASIC-2

public class Main {
   

	public static void main(String[] args) {
   
		String str = "000000";
		for (int i = 0; i < 32; i++) {
   
			String result = Integer.toBinaryString(i);
			//str.substring(0, 5 - result.length())指的是从str下标0到5 - result.length()长度取字符串
			//本题思路就是先转换为二进制，然后不足5位的拼0
			System.out.println(str.substring(0, 5 - result.length()) + result);

		}
	}

}

BASIC-3（持续更新中…）

BASIC-4

import java.util.*;

public class Main {
   

	public static void main(String[] args) {
   
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		//和
		int sum = 0;
		for (int i = 0; i <n; i++) {
   
			//每次输入一个数就添加到数组里
			a[i]=sc.nextInt();
			sum+=a[i];
	}
		//Api文档 sort(int[] a) 按照数字顺序排列指定的数组。 
		Arrays.sort(a);
		System.out.println(a[n-1]);
		System.out.println(a[0]);
		System.out.println(sum);

	}

}

BASIC-5

import java.util.*;

public class Main {
   

	public static void main(String[] args) {
   
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] num = new int[n];
		for (int i = 0; i < n; i++) {
   
			// 每次输入一个数就添加到数组里
			num[i] = sc.nextInt();
		}
		int a = sc.nextInt();
		System.out.println(find(num, a));

	}

	static int find(int[] num, int a) {
   
		for (int i = 0; i < num.length; i++) {
   
			if (num[i] == a) {
   
				return i + 1;
			}
		}
		return -1;
	}
}

BASIC-6

import java.util.*;

public class Main {
   
	// 杨辉三角形
	public static void main(String[] args) {
   
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[][] a = new int[n][n];
		a[0][0]=1;
		for (int i = 1; i < n; i++)
		{
   
			//杨辉三角形的每一行的第一个和最后一个都是1
			/* 1 1 1 1 * 1 1 * * 1 */
			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]+a[i-1][j-1];
				}					
			}
		}
		for (int i = 0; i < n; i++) {
   
			for (int j = 0; j <=i; j++) {
   
				System.out.print(a[i][j]+" ");
			}
			System.out.println();
		
		}
		
	}
}

BASIC-7

import java.util.*;
public class Main {
   
	public static void main(String[] args) {
   

		for (int i = 1; i <=9; i++) 
		{
   
			for (int j = 0; j <=9; j++) 
			{
   
				for (int k = 0; k <=9; k++)
				 {
   
					if(i*i*i+j*j*j+k*k*k==i*100+j*10+k)
					{
   
						System.out.println(i*100+j*10+k);
					}
				}
			}
		}
		
		
	}
}