結果
問題 | No.2562 数字探しゲーム(緑以下コンver.) |
ユーザー |
|
提出日時 | 2023-12-02 16:47:57 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,698 bytes |
コンパイル時間 | 5,623 ms |
コンパイル使用メモリ | 316,068 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-19 21:34:27 |
合計ジャッジ時間 | 6,232 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 9 WA * 1 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#include <random>using namespace std;using namespace atcoder;typedef long long ll;typedef unsigned long long ull;using mint9 = modint998244353;using mint1 = modint1000000007;//using mint = modint;const ll INF = 1000000007;const ll LINF = INF * INF;//const long long LLMAX = 9223372036854775807;const long long LLMAX = 100000000000000000;const double TIME_1 = 1.5;//const ll MOD = 998244353;std::mt19937 get_rand_mt;#define PA pair<int,int>#define PAL pair<ll,ll>#define TP tuple<int,int,int>#define TPL tuple<ll, ll, ll>#define rep(i, z, n) for(int i = z; i < n; i++)#define repl(i, z, n) for(ll i = z; i < n; i++)#define revrep(i, z, n) for(int i = n - 1; i >= z; i--)#define revrepl(i, z, n) for(ll i = n - 1; i >= z; i--)#define all(v) v.begin(), v.end()#define rall(v) v.rbegin(), v.rend()#define SZ(x) ((int)(x).size())#define PB push_back#define YN(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}#define YN2(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}#define OK cout << "OK" << endl;#define FX(x) cout << fixed << setprecision(10) << x << endl;#define shuffle(x) shuffle(all(x), get_rand_mt)#define PQ priority_queue<int,vector<int>,greater<int>>#define PQL priority_queue<ll,vector<ll>,greater<ll>>#define PQPA priority_queue<PA,vector<PA>,greater<PA>>template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<class T>T ceilX(T a, T b) {return (a + b - 1)/b; }ll lmax(ll a, ll b){if(a>b) return a; return b;}ll lmin(ll a, ll b){if(a>b) return b; return a;}ll comb(ll X, ll Y){ll res = 1LL;ll R = X;repl(i, 1LL, lmin(Y + 1LL, X - Y + 1LL)){res *= (R - i + 1LL);res /= i;}return res;}template<class T>void Rekkyo(vector<T> X){cout<<"Rekkyo"<<endl;for(auto Y:X){cout<<Y<<" ";}cout<<endl<<"end"<<endl;}template<class T>void Rekkyo1(vector<T> X){cout<<"Rekkyo1"<<endl;int cnt=0;for(auto Y:X){cout<<cnt<<" "<<Y<<endl;cnt++;}cout<<"end"<<endl;}template<class T>void Rekkyo2(vector<vector<T>> X){cout<<"Rekkyo2"<<endl;for(auto Y:X){for(auto Z:Y){cout <<Z<<" ";}cout<<endl;}cout<<"end"<<endl;}vector<int> Eratosthenes(const int N){vector<bool> is_prime(N + 1);rep(i, 0, N + 1) is_prime[i] = true;vector<int> P;rep(i, 2, N + 1){if(is_prime[i]){for( int j = 2 * i; j <= N; j += i ) is_prime[ j ] = false;P.emplace_back(i);}}return P;}vector<vector<int>> make_edge(vector<int> u, vector<int> v, bool angle){int N = u.size();vector<vector<int>> res;rep(i, 0, N){res[u[i]].PB(v[i]);if(!angle) res[v[i]].PB(u[i]);}return res;}vector<vector<PA>> make_edge(vector<int> u, vector<int> v, vector<int> w, bool angle){int N = u.size();vector<vector<PA>> res;rep(i, 0, N){res[u[i]].PB(PA(v[i], w[i]));if(!angle) res[v[i]].PB(PA(u[i], w[i]));}return res;}vector<vector<PAL>> make_edgeL(vector<int> u, vector<int> v, vector<ll> w, bool angle){int N = u.size();vector<vector<PAL>> res;rep(i, 0, N){res[u[i]].PB(PAL(v[i], w[i]));if(!angle) res[v[i]].PB(PAL(u[i], w[i]));}return res;}int main(){int T;cin >> T;rep(t, 0, T){ll M;cin >> M;vector<int> d(9, 0);ll X = 0;rep(i, 0, 9){cin >> d[i];rep(j, 0, d[i]){X *= 10;X += (i + 1);}}X *= 1000000000;X += 999999999;ll Y = X % M;X -= Y;cout << X << endl;//cout << (X % M) << endl;}}