結果

問題 No.2709 1975 Powers
ユーザー dyktr_06dyktr_06
提出日時 2024-01-23 13:15:27
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 778 ms / 2,000 ms
コード長 4,887 bytes
コンパイル時間 2,618 ms
コンパイル使用メモリ 208,664 KB
実行使用メモリ 65,792 KB
最終ジャッジ日時 2024-09-28 07:14:45
合計ジャッジ時間 12,812 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 100 ms
65,596 KB
testcase_01 AC 96 ms
65,764 KB
testcase_02 AC 104 ms
65,792 KB
testcase_03 AC 474 ms
65,664 KB
testcase_04 AC 713 ms
65,720 KB
testcase_05 AC 516 ms
65,792 KB
testcase_06 AC 222 ms
65,776 KB
testcase_07 AC 101 ms
65,696 KB
testcase_08 AC 216 ms
65,580 KB
testcase_09 AC 523 ms
65,780 KB
testcase_10 AC 100 ms
65,664 KB
testcase_11 AC 112 ms
65,564 KB
testcase_12 AC 131 ms
65,712 KB
testcase_13 AC 539 ms
65,596 KB
testcase_14 AC 157 ms
65,792 KB
testcase_15 AC 166 ms
65,776 KB
testcase_16 AC 430 ms
65,720 KB
testcase_17 AC 102 ms
65,776 KB
testcase_18 AC 138 ms
65,664 KB
testcase_19 AC 712 ms
65,664 KB
testcase_20 AC 105 ms
65,708 KB
testcase_21 AC 214 ms
65,740 KB
testcase_22 AC 772 ms
65,664 KB
testcase_23 AC 778 ms
65,664 KB
testcase_24 AC 769 ms
65,792 KB
testcase_25 AC 766 ms
65,664 KB
testcase_26 AC 772 ms
65,792 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); } }

ll n, p, q;
vll a;

void input(){
    in(n, p, q);
    vin(a, n);
}

void solve(){
    Sort(a);
    vll m10(2000001, 1), m9(2000001, 1), m7(2000001, 1), m5(2000001, 1);
    rep(i, 1, 2000001){
        m10[i] = m10[i - 1] * 10;
        m10[i] %= p;
        m9[i] = m9[i - 1] * 9;
        m9[i] %= p;
        m7[i] = m7[i - 1] * 7;
        m7[i] %= p;
        m5[i] = m5[i - 1] * 5;
        m5[i] %= p;
    }
    ll ans = 0;
    rep(i, n){
        rep(j, i + 1, n){
            rep(k, j + 1, n){
                rep(l, k + 1, n){
                    ll m = m10[a[i]] + m9[a[j]] + m7[a[k]] + m5[a[l]];
                    m %= p;
                    if(m == q) ans++;
                }
            }
        }
    }
    out(ans);
}

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