Submission #8400300
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; int euc(int x,int y){ //ensure that x>=y if(x%y==0){ return y; }else{ return euc(y,x%y); } } int main(){ int N,K; cin >> N >> K; vector<int> A(N,0); for(int i=0;i<N;i++){ cin >> A[i]; } sort(A.begin(),A.end()); if(N==1){ if(A[0]==K){ cout << "POSSIBLE" << endl; }else{ cout << "IMPOSSIBLE" << endl; } return 0; } int gc = euc(A[1],A[0]); for(int i=1;i<N;i++){ gc = euc(A[i],gc); } if(K>A[N-1]||K%gc>0){ cout << "IMPOSSIBLE" << endl; }else{ cout << "POSSIBLE" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | ema2997 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 667 Byte |
Status | AC |
Exec Time | 47 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 | 47 ms | 640 KB |
subtask_1_04.txt | AC | 42 ms | 640 KB |
subtask_1_05.txt | AC | 23 ms | 512 KB |
subtask_1_06.txt | AC | 8 ms | 256 KB |
subtask_1_07.txt | AC | 28 ms | 512 KB |
subtask_1_08.txt | AC | 41 ms | 640 KB |
subtask_1_09.txt | AC | 19 ms | 384 KB |
subtask_1_10.txt | AC | 33 ms | 512 KB |
subtask_1_11.txt | AC | 37 ms | 512 KB |