結果

問題 No.2784 繰り上がりなし十進和
ユーザー dyktr_06dyktr_06
提出日時 2024-06-15 02:37:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,070 ms / 2,000 ms
コード長 4,953 bytes
コンパイル時間 3,156 ms
コンパイル使用メモリ 223,892 KB
実行使用メモリ 36,708 KB
最終ジャッジ日時 2024-06-15 02:37:46
合計ジャッジ時間 41,802 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 941 ms
36,708 KB
testcase_01 AC 917 ms
36,332 KB
testcase_02 AC 891 ms
36,200 KB
testcase_03 AC 924 ms
36,200 KB
testcase_04 AC 935 ms
36,288 KB
testcase_05 AC 906 ms
36,332 KB
testcase_06 AC 948 ms
36,328 KB
testcase_07 AC 949 ms
36,200 KB
testcase_08 AC 990 ms
36,200 KB
testcase_09 AC 926 ms
36,072 KB
testcase_10 AC 885 ms
36,196 KB
testcase_11 AC 963 ms
36,196 KB
testcase_12 AC 993 ms
36,200 KB
testcase_13 AC 965 ms
36,068 KB
testcase_14 AC 929 ms
36,204 KB
testcase_15 AC 967 ms
36,204 KB
testcase_16 AC 1,043 ms
36,200 KB
testcase_17 AC 1,070 ms
36,100 KB
testcase_18 AC 1,057 ms
36,204 KB
testcase_19 AC 1,048 ms
36,288 KB
testcase_20 AC 1,043 ms
36,200 KB
testcase_21 AC 1,030 ms
36,200 KB
testcase_22 AC 1,064 ms
36,200 KB
testcase_23 AC 1,026 ms
36,200 KB
testcase_24 AC 1,038 ms
36,072 KB
testcase_25 AC 1,068 ms
36,332 KB
testcase_26 AC 1,066 ms
36,200 KB
testcase_27 AC 1,044 ms
36,204 KB
testcase_28 AC 1,060 ms
36,328 KB
testcase_29 AC 1,066 ms
36,120 KB
testcase_30 AC 1,057 ms
36,200 KB
testcase_31 AC 1,037 ms
36,204 KB
testcase_32 AC 1,064 ms
36,200 KB
testcase_33 AC 1,062 ms
36,332 KB
testcase_34 AC 1,029 ms
36,200 KB
testcase_35 AC 1,030 ms
36,200 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

void input(){
}

void solve(){
    vst s(6); in(s);
    auto fx = [](string s1, string s2){
        string t = "";
        rep(i, 6){
            ll num = s1[i] - '0' + s2[i] - '0';
            num %= 10;
            t += to_string(num);
        }
        return t;
    };
    vector<vst> cs(6, vst(11, "000000"));
    rep(i, 6){
        rep(j, 10){
            cs[i][j + 1] = fx(cs[i][j], s[i]);
        }
    }
    vst ans;
    rep(i1, 10) rep(i2, 10) rep(i3, 10) rep(i4, 10) rep(i5, 10) rep(i6, 10){
        string t = "000000";
        t = fx(t, cs[0][i1]);
        t = fx(t, cs[1][i2]);
        t = fx(t, cs[2][i3]);
        t = fx(t, cs[3][i4]);
        t = fx(t, cs[4][i5]);
        t = fx(t, cs[5][i6]);
        ans.push_back(t);
    }
    Sort(ans);
    UNIQUE(ans);
    out(ans.size());
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);

    input();
    solve();
}
0