結果

問題 No.1747 Many Formulae 2
ユーザー nishi5451nishi5451
提出日時 2021-11-25 17:43:06
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 2,960 bytes
コンパイル時間 2,430 ms
コンパイル使用メモリ 76,144 KB
実行使用メモリ 49,716 KB
最終ジャッジ日時 2023-09-10 19:13:50
合計ジャッジ時間 4,858 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,436 KB
testcase_01 AC 44 ms
49,716 KB
testcase_02 AC 43 ms
49,128 KB
testcase_03 AC 43 ms
49,480 KB
testcase_04 AC 42 ms
49,460 KB
testcase_05 AC 43 ms
49,340 KB
testcase_06 AC 44 ms
49,552 KB
testcase_07 AC 44 ms
49,380 KB
testcase_08 AC 44 ms
49,548 KB
testcase_09 AC 43 ms
49,084 KB
testcase_10 AC 44 ms
49,296 KB
testcase_11 AC 44 ms
49,228 KB
testcase_12 AC 43 ms
49,420 KB
testcase_13 AC 44 ms
49,300 KB
testcase_14 AC 44 ms
49,428 KB
testcase_15 AC 46 ms
49,420 KB
testcase_16 AC 45 ms
49,284 KB
testcase_17 AC 44 ms
49,264 KB
testcase_18 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.util.stream.*;
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 isPrime(long n){
		for(long i = 2; i*i <= n; i++){
			if(n%i == 0) return false;
		}
		return true;
	}
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		String s = fs.next();
		int n = s.length();
		int[] val = new int[n];
		for(int i = 0; i < n; i++) val[i] = Character.getNumericValue(s.charAt(i));

		int ans = 0;
		for(int bit = 0; bit < 1<<(n-1); bit++){
			long sum = 0;
			long now = val[0];
			for(int i = 0; i < n-1; i++){
				if((bit>>i & 1) == 1){
					sum += now;
					now = val[i+1];
				} else {
					now = now*10 + val[i+1];
				}
			}
			sum += now;
			if(isPrime(sum)) ans++;
		}
		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