Submission #3770731
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <cstdlib> #include <cstdio> #include <cmath> #include <algorithm> #include <map> #include <stack> #include <queue> #include <set> #include <cstring> using namespace std; // ascending order #define vsort(v) sort(v.begin(), v.end()) // descending order #define vsort_r(v) sort(v.begin(), v.end(), greater<int>()) #define vunique(v) unique(v.begin(), v.end()) #define mp make_pair #define ts(x) to_string(x) #define rep(i, a, b) for(int i = (int)a; i < (int)b; i++) #define repm(i, a, b) for(int i = (int)a; i > (int)b; i--) #define bit(a) bitset<8>(a) #define des_priority_queue priority_queue<int, vector<int>, greater<int> > typedef long long ll; typedef pair<int, int> P; const ll INF = 1e18; int gcd(int a, int b) { if(b == 0) return a; return gcd(b, a % b); } int lcm(int a, int b) { return a / gcd(a, b) * b; } int main(){ cin.tie(0); ios::sync_with_stdio(false); int N, K; cin >> N >> K; int A[N]; int max_a = -1; rep(i, 0, N) { cin >> A[i]; max_a = max(max_a, A[i]); } int G = A[0]; rep(i, 1, N) G = gcd(G, A[i]); if(K <= max_a and K % G == 0) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | tsutarou10 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1261 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 640 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 | 12 ms | 640 KB |
subtask_1_04.txt | AC | 11 ms | 640 KB |
subtask_1_05.txt | AC | 7 ms | 512 KB |
subtask_1_06.txt | AC | 3 ms | 256 KB |
subtask_1_07.txt | AC | 8 ms | 512 KB |
subtask_1_08.txt | AC | 11 ms | 640 KB |
subtask_1_09.txt | AC | 5 ms | 384 KB |
subtask_1_10.txt | AC | 9 ms | 512 KB |
subtask_1_11.txt | AC | 10 ms | 640 KB |