#718534 (C++14) No.1747 Many Formulae 2

• 問題: No.1747 Many Formulae 2
• ユーザー: llc5pg
• 提出日時: 2021-11-20 15:06:03
• 言語: C++14 (gcc 15.2.0 + boost 1.89.0)
• 結果: CE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 3,046 bytes
• コンパイル時間: 33 ms
• 最終ジャッジ日時: 2026-03-04 21:47:35
• 合計ジャッジ時間: 433 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

コンパイルメッセージ

055da94f6827
[/j_bin/judge_tool judge 40000 ../CompileMemory.txt /dev/null sud /dev/null _ g++-15 -O2 -lm -std=c++14 -Wuninitialized -DONLINE_JUDGE -o a.out main.cpp]
strconv.Atoi: parsing "../CompileMemory.txt": invalid syntax
goroutine 1 [running]:
runtime/debug.Stack()
	/home/yuki2006/go/pkg/mod/golang.org/[e-mail]-amd64/src/runtime/debug/stack.go:26 +0x5e
main.main.func1()
	/home/yuki2006/gopath/src/yukicoder/judge/main.go:22 +0x57
panic({0x7d6880?, 0xc0000f6240?})
	/home/yuki2006/go/pkg/mod/golang.org/[e-mail]-amd64/src/runtime/panic.go:783 +0x132
main.judgeMain({0xc000012150, 0x5?, 0x0?})
	/home/yuki2006/gopath/src/yukicoder/judge/judge_linux.go:121 +0x4b1
main.main()
	/home/yuki2006/gopath/src/yukicoder/judge/main.go:97 +0x277

ソースコード

#include <bits/stdc++.h>
using namespace std;

const int MOD = (1e9+7);
void printmat(const vector<vector<int>>& mat) {
    for (auto row : mat) {
        for (auto elem : row)
            cout << elem << " ";
        cout << endl;
    }
}
void printv(const vector<long long>& v) {
    for (auto elem : v)
        cout << elem << " ";
    cout << endl;
}
void printvs(const vector<set<int>>& vs) {
    for (auto row : vs) {
        for (auto elem : row)
            cout << elem << ", ";
        cout << endl;
    }
}
void printht(const unordered_map<int, int>& ht) {
    for (auto elem : ht)
        cout << elem.first << " : " << elem.second << endl;
}
void printmp(const map<int, int>& ht) {
    for (auto elem : ht)
        cout << elem.first << " : " << elem.second << endl;
}
void printst(const set<int>& st) {
    for (auto elem : st)
        cout << elem << " ";
    cout << endl;
}

map<long long, long long> primeFactors(long long n) {
    map<long long, long long> ans;
    while (n % 2 == 0) {
        ans[2]++;
        n = n/2;
    }
    for (long long i = 3; i*i <= (n); i = i + 2) {
        while (n % i == 0) {
            ans[i]++;
            n = n/i;
        }
    }
    if (n > 2)
        ans[n]++;
    return ans;
}

int find_f(const vector<int>& uf, int i) {
    while (uf[i]!=i)
        i = uf[i];
    return i;
}
bool union_f(vector<int>& uf, vector<int>& sz, int a, int b) {
    a = find_f(uf, a);
    b = find_f(uf, b);
    //cout << "a, b = " << a << ", " << b << endl;
    if (a==b) return false;
    if (sz[a] < sz[b]) {
        //cout << "sz[a], sz[b] = " << sz[a] << ", " << sz[b] << endl;
        //cout << "a, b = " << a << ", " << b << endl;
        swap(a,b);
        //cout << "a, b = " << a << ", " << b << endl;
    }
    sz[a] += sz[b];
    uf[b] = a;
    return true;
}

bool isPrime(long long n) {
    if (n <= 1)
        return false;
    if (n <= 3)
        return true;
    if (n % 2 == 0 || n % 3 == 0)
        return false;
    for (long long i = 5; i * i <= n; i = i + 6)
        if (n % i == 0 || n % (i + 2) == 0)
            return false;
    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);    
    int T=1, caseIdx=0;
    //cin >> T;  
    while (T--) {
        //caseIdx++;
        string s, t;
        cin >> s;
        int n = s.length(), ans=0;
        n--;
        for (int k=0; k<(1<<n); k++) {
            string t;
            for (int i=0; i<n; i++) {
                t += s[i];
                if (k&(1<<i)) {
                    t += "+";
                }
            }
            t += s[n];
            //cout << t << " = ";  
            long long sum = 0;
            stringstream ss(t);
            string intermediate;
            while(getline(ss, intermediate, '+')) {
                sum += stoll(intermediate);
            }    
            //cout << sum << endl;
            if (isPrime(sum))
                ans++;
        }
        cout << ans << endl;   
        
        //cout << "Case #" << caseIdx << ": " << s << endl;
    }
}