蓝桥杯——历年真题之带分数

问题描述

import java.util.Scanner;

public class Main{

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		N = scanner.nextInt();
		cal(0);
		System.out.println(count);
	}

	static int N;
	static int n = 9;
	static int count;
	static int[] iarr = new int[n];
	static boolean[] vis = new boolean[n];

	static void cal(int p) {
		if (p == n) {
			// find
			String string = "";
			for (int i : iarr)
				string += i + "";
			jud(string);
			/*
			 * System.out.print(string); System.out.println();
			 */
		} else {
			for (int i = 0; i < vis.length; i++) {
				if (!vis[i] ) {
					vis[i] = true;
					iarr[p] = i + 1;
					cal(p + 1);
					vis[i] = false;
				}
			}
		}
	}

	static void jud(String string) {
		int len = (N + "").length();
		for (int i = 0; i <= len; i++) {
			int a = Integer.parseInt(string.substring(0, i + 1));
			if (a < N)
				for (int j = ((9 - i) / 2 + i); j < 9; j++) {
					long b = Long.parseLong(string.substring(i + 1, j));
					long c = Long.parseLong(string.substring(j));

					if (b % c != 0) {
						continue;
					} else {
						if (a + b / c == N) {
							count++;
							// System.out.println(a+" "+b+" "+c);
						}
					}
				}
		}
	}
}

蓝桥杯——历年真题之带分数,布布扣,bubuko.com

蓝桥杯——历年真题之带分数

原文：http://blog.csdn.net/hymanxq/article/details/26354471