Submission #5895866
Source Code Expand
#include <bits/stdc++.h> using namespace std; using LL = long long; using VI = vector<LL>; using VVI = vector<VI>; using VB = vector<bool>; using VS = vector<string>; using PII = pair<LL, LL>; using VP = vector<PII>; #define PB push_back #define MP make_pair #define SZ(a) LL((a).size()) #define EACH(x, c) for (auto x : (c)) #define ALL(c) (c).begin(), (c).end() #define REVERSE(c) reverse(ALL(c)) #define SORT(c) stable_sort(ALL(c)) #define RSORT(c) stable_sort((c).rbegin(), (c).rend()) #define FSORT(c) stable_sort(ALL(c), [] (auto& x, auto& y) {return x.first < y.first;}); #define FRSORT(c) stable_sort(ALL(c), [] (auto& x, auto& y) {return x.first > y.first;}); #define SSORT(c) stable_sort(ALL(c), [] (auto& x, auto& y) {return x.second < y.second;}); #define SRSORT(c) stable_sort(ALL(c), [] (auto& x, auto& y) {return x.second > y.second;}); #define FOR(i, a, b) for (LL i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define $(x) {cout << #x << " = " << (x) << endl;} int main() { LL N, K; cin >> N >> K; LL m = LLONG_MIN, g; REP(i, N) { LL a; cin >> a; m = max(m, a); if (i == 0) { g = a; } else { g = __gcd(g, a); } } if (K % g == 0 && K <= m) { cout << "POSSIBLE" << endl; } else { cout << "IMPOSSIBLE" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | yetnone |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1488 Byte |
Status | AC |
Exec Time | 42 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 42 ms | 256 KB |
subtask_1_04.txt | AC | 41 ms | 256 KB |
subtask_1_05.txt | AC | 22 ms | 256 KB |
subtask_1_06.txt | AC | 7 ms | 256 KB |
subtask_1_07.txt | AC | 26 ms | 256 KB |
subtask_1_08.txt | AC | 37 ms | 256 KB |
subtask_1_09.txt | AC | 18 ms | 256 KB |
subtask_1_10.txt | AC | 30 ms | 256 KB |
subtask_1_11.txt | AC | 33 ms | 256 KB |