結果

問題 No.1644 Eight Digits
ユーザー nishi5451nishi5451
提出日時 2021-08-14 10:06:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 84 ms / 1,000 ms
コード長 3,030 bytes
コンパイル時間 2,377 ms
コンパイル使用メモリ 78,368 KB
実行使用メモリ 51,968 KB
最終ジャッジ日時 2024-10-04 21:56:49
合計ジャッジ時間 5,368 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
51,412 KB
testcase_01 AC 68 ms
51,616 KB
testcase_02 AC 78 ms
51,968 KB
testcase_03 AC 76 ms
51,240 KB
testcase_04 AC 77 ms
51,556 KB
testcase_05 AC 77 ms
51,652 KB
testcase_06 AC 77 ms
51,532 KB
testcase_07 AC 77 ms
51,800 KB
testcase_08 AC 76 ms
51,172 KB
testcase_09 AC 78 ms
51,660 KB
testcase_10 AC 78 ms
51,424 KB
testcase_11 AC 77 ms
51,456 KB
testcase_12 AC 77 ms
51,780 KB
testcase_13 AC 75 ms
51,540 KB
testcase_14 AC 79 ms
51,408 KB
testcase_15 AC 84 ms
51,788 KB
testcase_16 AC 83 ms
51,600 KB
testcase_17 AC 78 ms
51,580 KB
testcase_18 AC 76 ms
51,468 KB
testcase_19 AC 76 ms
51,280 KB
testcase_20 AC 78 ms
51,680 KB
testcase_21 AC 78 ms
51,340 KB
testcase_22 AC 78 ms
51,280 KB
testcase_23 AC 77 ms
51,292 KB
testcase_24 AC 74 ms
51,324 KB
testcase_25 AC 77 ms
51,912 KB
testcase_26 AC 75 ms
51,864 KB
testcase_27 AC 68 ms
51,528 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	static boolean nextPermutation(int[] arr){
		for(int i = arr.length-1; i > 0; i--){
			if(arr[i-1] < arr[i]){
				int left = i-1, right = arr.length;
				while(right - left > 1){
					int mid = (left + right) / 2;
					if(arr[mid] > arr[i-1]) left = mid;
					else right = mid;
				}
				int tmp = arr[left];
				arr[left] = arr[i-1];
				arr[i-1] = tmp;
				Arrays.sort(arr, i, arr.length);
				return true;
			}
		}
		return false;
	}
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		int k = fs.nextInt();
		int[] arr = {1,2,3,4,5,6,7,8};
		int ans = 0;
		do {
			int now = 0;
			for(int i = 0; i < 8; i++){
				now *= 10;
				now += arr[i];
			}
			if(now%k == 0) ans++;
		} while(nextPermutation(arr))	;
		pw.println(ans);
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0