Submission #8426859
Source Code Expand
#include "bits/stdc++.h" #define REP(i,num) for(int i=0;i<(num);++i) #define ALL(c) c.begin(),c.end() #define LOOP(i) while(i--) #define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl; #define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;} using namespace std; using ll = long long; constexpr ll atcoder_mod = 1e9+7; template<typename T=int> T in(){T x; cin >> x; return (x);} template<typename T=int,typename C=vector<T>> C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);} void vout(){cout << endl;} template<typename Head,typename... Tail> void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);} void out(){cout << endl;} template<typename Head,typename... Tail> void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);} ll gcd(ll a,ll b){ if(a<b){ swap(a,b); } while(ll r=(a%b)){ a = b; b = r; } return b; } int main(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(10); int N=in(),K=in(); auto V=vecin(N); auto M=*max_element(ALL(V)); int GCD = V[0]; REP(i,N-1){ GCD = gcd(GCD,V[i+1]); } out(!(K%GCD) && (K<=M)?"POSSIBLE":"IMPOSSIBLE"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | zelosace |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1254 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 | 12 ms | 640 KB |
subtask_1_05.txt | AC | 7 ms | 512 KB |
subtask_1_06.txt | AC | 3 ms | 384 KB |
subtask_1_07.txt | AC | 8 ms | 512 KB |
subtask_1_08.txt | AC | 11 ms | 640 KB |
subtask_1_09.txt | AC | 6 ms | 384 KB |
subtask_1_10.txt | AC | 9 ms | 512 KB |
subtask_1_11.txt | AC | 10 ms | 640 KB |