提出 #306357

---

ソースコード 拡げる

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

public class Main {

    public static void main(String[] args) {
		try {
			Scanner sc = new Scanner(System.in);
			int n;
			n = sc.nextInt();
			final int max = (int) Math.pow(10, n);
			int num = 0;
			int[] counter = new int[n];
			for (int i=0; i<n; i++) counter[i] = 0;
			final List<Integer> list = new ArrayList<Integer>();
			while(true) {
				list.add(num);
				int j = 0;
				for (; j < n && counter[j] == 9; j++) {}
				int tmp = (int) Math.pow(10, j);
				int theDigit = calcTheDigit(num, j);
				num += (tmp * (theDigit == 9 ? -9 : 1));
				if (num >= max) break;
				counter[j] += 1;
				if (j-- == 0) continue;
				for (; j >= 0; j--) { counter[j] = 0; }
			}
			System.out.println(list.size() - 1);
			final String format = "%0" + n + "d";
			for (int i = 0; i < list.size(); i++) {
				System.out.println(String.format(format, list.get(i)));
			}
			sc.close();
		} catch (Exception e){
			System.err.println("Error");
		}
	}

	private static int calcTheDigit(int num, int pos) {
		int len = String.valueOf(num).length();
		int d = (int)Math.pow(10, len - 1);
		if (num < Math.pow(10, pos)) return 0;

		for (int i = len - 1; i > pos; i--) {
			num %= d;
			d /= 10;
		}
		return num / d;
	}
}

提出情報

ジャッジ結果