結果
問題 | No.2119 一般化百五減算 |
ユーザー | dyktr_06 |
提出日時 | 2022-11-04 22:35:22 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,759 bytes |
コンパイル時間 | 1,983 ms |
コンパイル使用メモリ | 171,524 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-18 20:31:00 |
合計ジャッジ時間 | 2,643 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 WA * 2 |
コンパイルメッセージ
main.cpp: In function 'void in(T& ...)': main.cpp:28:55: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 28 | template<class... T> void in(T&... a){ (cin >> ... >> a); } | ^ main.cpp: In function 'void out(const T&, const Ts& ...)': main.cpp:30:112: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 30 | template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } | ^
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i,n) for(int i = 0; i < (int)(n); ++i)#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())typedef long long int ll;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 pair<long long, long long> P;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;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<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); } }namespace CRT{long long extGCD(long long a, long long b, long long &x, long long &y){if(b == 0){x = 1;y = 0;return a;}long long d = extGCD(b, a % b, y, x);y -= a / b * x;return d;}pair<long long, long long> ChineseRem(const vector<long long> &b, const vector<long long> &m) {long long r = 0, M = 1;for(int i = 0; i < (int) b.size(); i++){long long p, q;long long d = extGCD(M, m[i], p, q);if((b[i] - r) % d != 0) return {0, -1};long long tmp = (b[i] - r) / d * p % (m[i] / d);r += M * tmp;M *= m[i] / d;}r %= M;if(r < 0) r += M;return {r, M};}}ll n, m;void input(){in(n, m);}void solve(){vll b(m), c(m);ll cnt = 0;rep(i, m){in(b[i], c[i]);if(c[i] == 0) cnt++;}pair<long long, long long> p = CRT::ChineseRem(c, b);if(p.second == -1 || p.first > n){cout << "NaN" << endl;}else if(cnt == m){cout << p.second << endl;}else{cout << p.first << endl;}}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);input();solve();}