結果

問題 No.1747 Many Formulae 2
ユーザー shojin_proshojin_pro
提出日時 2022-01-22 00:57:11
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,237 bytes
コンパイル時間 2,380 ms
コンパイル使用メモリ 79,040 KB
実行使用メモリ 37,388 KB
最終ジャッジ日時 2024-05-04 18:57:31
合計ジャッジ時間 3,757 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
37,304 KB
testcase_01 AC 49 ms
37,304 KB
testcase_02 AC 51 ms
37,388 KB
testcase_03 AC 48 ms
37,320 KB
testcase_04 AC 48 ms
37,032 KB
testcase_05 AC 46 ms
37,284 KB
testcase_06 AC 46 ms
37,248 KB
testcase_07 AC 50 ms
37,128 KB
testcase_08 AC 46 ms
37,060 KB
testcase_09 AC 47 ms
37,012 KB
testcase_10 AC 46 ms
37,304 KB
testcase_11 AC 46 ms
37,060 KB
testcase_12 AC 46 ms
37,220 KB
testcase_13 AC 47 ms
37,012 KB
testcase_14 AC 47 ms
37,204 KB
testcase_15 AC 50 ms
36,748 KB
testcase_16 AC 49 ms
37,128 KB
testcase_17 AC 45 ms
37,204 KB
testcase_18 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    static int N;
    static char[] s;
    public static void solve() {
        s = sc.next().toCharArray();
        N = s.length;
        if(N == 1){
            long v = s[0]-'0';
            long max = (long)Math.sqrt(v);
            for(long i = 2; i <= max; i++){
                if(v % i == 0){
                    pw.println(0);
                    return;
                }
            }
            pw.println(1);
        }else{
            pw.println(dfs(0,0));
        }
        
    }
    
    public static long dfs(long now, int index){
        if(index == N){
            long max = (long)Math.sqrt(now);
            for(long i = 2; i <= max; i++){
                if(now % i == 0){
                    return 0;
                }
            }
            return 1;
        }
        long ret = 0;
        StringBuilder sb2 = new StringBuilder();
        for(int i = index; i < N; i++){
            sb2.append(s[i]);
            long now2 = now + Long.valueOf(sb2.toString());
            ret += dfs(now2,i+1);
        }
        return ret;
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0