2021全国高校计算机能力挑战赛（初赛java）编程题

 

public static void main(String[] args) {
		// TODO Auto-generated method stub
        /*从大于等于N 的正整数里找到一个最小的数M,使之满足:
         * M和M的逆序数(如1230的逆序数为321)的和为一个[100000,200000]区间内的值。
         */
		Scanner input = new Scanner(System.in);
		int N = input.nextInt();
		int M = N;
		while(true) {
			int num = reverse(M);//翻转数字
			int total = num + M;
			if(total >= 100000 && total <= 200000) 
				break;
			if(M >= 200000) {
				System.out.println("F");
				return;
			}
			M++;
		}
		System.out.println(M);
	}

	private static int reverse(int m) {//反转数字
		// TODO Auto-generated method stub
		StringBuffer sb = new StringBuffer(String.valueOf(m));
		int res = Integer.parseInt(sb.reverse().toString());
		//System.out.println(res);
		return res;
	}

    static int a = 0;
    static int b = 0;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
        //1.输入
        int n = input.nextInt();
        String[][] str = new String[n][5];
        for(int i = 0; i < n; i++) {
        	for(int j = 0; j < 5; j++) {
        		str[i][j] = input.next();
        	}
        }
        //2.遍历每个人
        for(int i = 0; i < n; i++) {
        	calculate(str[i]);
        }
        
        System.out.println(a);
        System.out.println(b);
	}
	private static void calculate(String[] str) {
		// TODO Auto-generated method stub
		//3.判断是否本地还是外地人
		if(str[0].equals("L")) {//本地人
			if(str[1].equals("G") || (str[1].equals("Y") || str[1].equals("R") && Integer.parseInt(str[4]) < 3 && str[3].equals("N"))){
				if(str[2].equals("D")) {
					
					a = a + 1;
				}
				if(str[2].equals("E")) {
					b = b + 1;
				}
			}
		}else {//外地人
			if(str[1].equals("G") || (str[1].equals("Y") || str[1].equals("R") && Integer.parseInt(str[4]) < 3 && str[3].equals("N"))){
				if(str[2].equals("E")) {
					b = b + 1;
				}
			}
		}
	}

 

public static void main(String[] args) {
		// TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
        int num = input.nextInt();
        //1.输入点的数量
        double[][] arr = new double[num][2];
        //2.输入点的坐标
        for(int i = 0; i < num; i++) {
        	arr[i][0] = input.nextDouble();//x坐标
        	arr[i][1] = input.nextDouble();//y坐标
        }
        double maxLine = 0;//最大直径
        for(int i = 0; i < arr.length;i++) {
        	for(int j = i+1; j < arr.length;j++) {
        		double x1 = arr[i][0];
        		double y1 = arr[i][1];
        		double x2 = arr[j][0];
        		double y2 = arr[j][1];
        		double distance = Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
        		//3.求圆心
        		double x3 = (x1 + x2)/2;
        		double y3 = (y1 + y2)/2;
        		if(distance > maxLine && judge(x3,y3,arr,distance,i,j)) {
        			maxLine = distance;
        		}
        	}
        }
        System.out.println(String.format("%.3f",maxLine));
	}

	//4.判断某个点是否在圆上
	private static boolean judge(double x3, double y3, double[][] arr, double distance,int a,int b) {
		// TODO Auto-generated method stub
		for(int i = 0; i < arr.length; i++) {
			if(i!= a && i != b) {
				if((arr[i][0] - x3)*(arr[i][0] - x3) + (arr[i][1] - y3)*(arr[i][1] - y3) <= (distance/2)*(distance/2)) {
					return false;
				}
			}
		}
		return true;
	}

 

public static void main(String[] args) {
		// TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
        int N = input.nextInt();//总数
        int L = input.nextInt();//连续的用户数
        int x = input.nextInt();
        int y = input.nextInt();
        int z = input.nextInt();
        int res = 0;
        for(int i = 1; i <= N - L + 1; i++) {
    		int temp = calulate(i,L,x,y,z);
    		if(temp > res) {
    			res = temp;
    		}
        }
        System.out.println(res);
	}

	private static int calulate(int i, int L, int x, int y, int z) {
		// TODO Auto-generated method stub
		int two = 0;//2星卡片
		int three = 0;//3星卡片
		int four = 0; //4星卡片
		for(int j = i; j < i + L; j++) {//遍历每个用户
			four = four + 1; //4星卡片
			if(j%x==0 && j%y==0) {
				two = two + 9;
			}
			if(j%y==0 && j%z==0) {
				three = three + 3;
			}
			if(j%x==0 && j%z==0) {
				four = four + 1;
			}
		}
		return Math.abs(two - (three + four));
	}