试题 历届真题 带分数【第四届】【省赛】【B组】蓝桥杯 Java

package zhenti;

import java.util.Scanner;

public class shuzi {
	static int n;
	static int ans = 0;
	static int zhengshuchangdu = 0;
	static int tempans = 0;
	static char lista[] = {'1','2','3','4','5','6','7','8','9'};
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		n = scanner.nextInt();
		zhengshuchangdu = String.valueOf(n).length();
		char[] anslist = new char[lista.length];
		boolean blist[] = new boolean[lista.length];
		pailiemoweishuzi(0, anslist, blist);
		System.out.println(ans);
	}
	
	static void pailiemoweishuzi(int k,char[] list, boolean[] blist) {
		if(k == list.length) {
			tempans++;
			int qiege[] = new int[3];
			mozhongqiege(list, 0, qiege, list.length);
		}else {
			for (int i = 0; i < list.length; i++) {
				if (blist[i] == false) {
					blist[i] = true;
					list[k] = lista[i];
					pailiemoweishuzi(k + 1, list, blist);
					blist[i] = false;
				}
			}
		}
	}
	
	static void mozhongqiege(char[] list, int dijigeshu, int qiege[], int shengyujigeshu) {
		if (dijigeshu == 3) {
			int[] shu = new int[3];
			qiumoyigeshu(0, list, qiege, shu);
		}else if(dijigeshu == 0) {
			for (int i = 1; i <= zhengshuchangdu; i++) {
				qiege[0] = i;
				mozhongqiege(list, dijigeshu + 1, qiege, shengyujigeshu - i);
			}
		}else if(dijigeshu == 1) {
			for (int i = 1; i <= shengyujigeshu - 1; i++) {
				qiege[1] = i;
				mozhongqiege(list, dijigeshu + 1, qiege, shengyujigeshu - i);
			}
		}else {
			qiege[2] = shengyujigeshu;
			mozhongqiege(list, dijigeshu + 1, qiege, 0);
		}
	}
	
	static void qiumoyigeshu(int dijige, char[] list, int qiege[], int shu[]) {
		if (dijige == 3) {
			if (shu[1] == (shu[2] * (n - shu[0]))) {
				ans++;
			}
			return;
		}else {
			shu[dijige] = bianshu(dijige, list, qiege);
			qiumoyigeshu(dijige + 1, list, qiege, shu);
		}
	}
	
	static int bianshu(int dijige, char[] list,int[] qiege) {
		int first = 0;
		for (int i = 0; i < dijige; i++) {
			first += qiege[i];
		}
		return Integer.valueOf(String.copyValueOf(list,first,qiege[dijige]));
	}
}