結果
問題 | No.2709 1975 Powers |
ユーザー | AD010 |
提出日時 | 2024-03-31 14:09:01 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 234 ms / 2,000 ms |
コード長 | 5,224 bytes |
コンパイル時間 | 1,787 ms |
コンパイル使用メモリ | 154,076 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-09-30 19:02:59 |
合計ジャッジ時間 | 5,319 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 4 ms
6,820 KB |
testcase_03 | AC | 121 ms
6,820 KB |
testcase_04 | AC | 199 ms
6,820 KB |
testcase_05 | AC | 135 ms
6,820 KB |
testcase_06 | AC | 44 ms
6,820 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 41 ms
6,816 KB |
testcase_09 | AC | 135 ms
6,820 KB |
testcase_10 | AC | 2 ms
6,820 KB |
testcase_11 | AC | 6 ms
6,816 KB |
testcase_12 | AC | 12 ms
6,820 KB |
testcase_13 | AC | 139 ms
6,820 KB |
testcase_14 | AC | 21 ms
6,816 KB |
testcase_15 | AC | 24 ms
6,816 KB |
testcase_16 | AC | 105 ms
6,820 KB |
testcase_17 | AC | 2 ms
6,820 KB |
testcase_18 | AC | 15 ms
6,820 KB |
testcase_19 | AC | 193 ms
6,820 KB |
testcase_20 | AC | 3 ms
6,820 KB |
testcase_21 | AC | 39 ms
6,824 KB |
testcase_22 | AC | 232 ms
6,816 KB |
testcase_23 | AC | 231 ms
6,820 KB |
testcase_24 | AC | 231 ms
6,820 KB |
testcase_25 | AC | 234 ms
6,816 KB |
testcase_26 | AC | 234 ms
6,820 KB |
ソースコード
#include <iostream> // cout, endl, cin #include <string> // string, to_string, stoi #include <vector> // vector #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound #include <utility> // pair, make_pair #include <tuple> // tuple, make_tuple #include <cstdint> // int64_t, int*_t #include <cstdio> // printf #include <map> // map #include <queue> // queue, priority_queue #include <set> // set #include <stack> // stack #include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset #include <cctype> // isupper, islower, isdigit, toupper, tolower #include <math.h> #include <cmath> #include <climits> #include <functional> #include <iomanip> #include <limits> #include <cassert> #include <random> #include <complex> #include <numeric> #include <regex> #include <list> #include <ctime> using namespace std; #define ll long long #define ull unsigned long long #define ld long double typedef vector<long long> vll; using LL = long long; using ULL = unsigned long long; using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>; using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>; using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>; using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>; using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>; using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>; using MII = map<int,int>; using MLL = map<LL,LL>; using SI = set<int>; using SL = set<LL>; using MSI = multiset<int>; using MSL = multiset<LL>; template<class T> using MAXPQ = priority_queue<T>; template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >; const ll MOD = 1000000007; const ll MOD2 = 998244353; const ll INF = 1LL << 60; #define PI 3.14159265358979323846 #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define EACH(e, v) for(auto &e : v) #define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it) #define ALL(v) v.begin(),v.end() vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1}; int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1}; /* memo -uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy -isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv(modpow必要) nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10 -dijkstra,Floyd,bellmanford,sccd,topological,treediamiter -compress1,compress2,rotate90 -co,ci,fo1,fo2,fo3,fo4 -bitsearch,binaryserach -bfs(vis.assign忘れるな) -SegTreedec,SegTreeLazydec */ // a^n % mod template<class T> T pow_mod(T a, T n, T mod){ T ans = 1; a %= mod; while (n > 0) { if ((n & 1)) ans = (ans * a) % mod; a = (a * a) % mod; n >>= 1; } return ans; } // 拡張ユークリッド互除法 ax + by = gcd(a,b) -> {x, y, gcd} template<class T> tuple<T,T,T> extend_euclid(T a, T b) { //STEP1 T x0 = 1, x1 = 0, x2, y0 = 0, y1 = 1, y2, r0 = a, r1 = b, r2, q2; //STEP2 while (r1 != 0) { //STEP2-1 q2 = r0 / r1; r2 = r0 % r1; //STEP2-2 x2 = x0 - q2 * x1; y2 = y0 - q2 * y1; // x0 = x1; x1 = x2; y0 = y1; y1 = y2; r0 = r1; r1 = r2; } return {x0, y0, r0}; } // aのmod pにおける逆元 (aとpは互いに素) template<class T> T inverse(T a, T prime_mod, bool euclid=true){ if (!euclid) return pow_mod(a, prime_mod-2, prime_mod); auto [x,y,g]=extend_euclid(a, prime_mod); assert(g==1); return ( (x<0) ? (x+prime_mod):x ) % prime_mod; } // nCr template<class T> T combi(T n, T r){ r = (r > n / 2) ? n - r : r; T ans = 1; for (T i = 1; i <= r; i++, n--) { ans *= n; ans /= i; } return ans; } // nCr % mod ただし modは素数 template<class T> T combi_mod(T n, T r, T mod){ T ans=1, div=1; for (T i = n; i > n-r; --i) ans = (ans*(i%mod))%mod; for (T i = 1; i < r+1; ++i) div = (div*(i%mod))%mod; T inv_div = inverse(div, mod); // 整数の逆元 return (ans * inv_div) % mod; } ll modpow(ll a, ll e, ll mod){ ll res = 1; ll p=e,q=a; while(p){ if(p & 1){ res *= q; res %= mod; } p /= 2; q *= q; res %= mod; } return res; } ll N,P,Q; int main(){ cin.tie(0); ios_base::sync_with_stdio(0); cin >> N >> P >> Q; VL a(N); for(ll i = 0; i < N; i++) cin >> a[i]; sort(ALL(a)); VL p10,p9,p7,p5; for(ll i = 0; i < N; i++){ p10.push_back(pow_mod(10LL,a[i],P)); p9.push_back(pow_mod(9LL,a[i],P)); p7.push_back(pow_mod(7LL,a[i],P)); p5.push_back(pow_mod(5LL,a[i],P)); } ll ans = 0; for(ll i = 0; i < N; i++){ for(ll j = i+1; j < N; j++){ for(ll k = j+1; k < N; k++){ for(ll l = k+1; l < N; l++){ ll tmp = p10[i]+p9[j]+p7[k]+p5[l]; if(tmp%P == Q) ans++; } } } } cout << ans << endl; }