Submission #6435466
Source Code Expand
/*
友利奈緒の力でACしてくれ!!!!!!!!!!!!
Charlotteまだ見てない人は見ような!!!!!!!
/ /:/ \:ヽ \
/ / \ ヽ
\__L 彡 ヽ ',
フ / / / / , ヽ ', j
レ / / / ', ヽ j
// ! /_l_/__ノ { \} ', ',/
i ハ { 从j ハ i ', ト-、} i i } jj
( ハ ( 川 ハ ハ ! ' ハ ハ j j ,' 八
<_,ィ∧ 斗芹テミxハ ハ レ } /__レレ / ∧ \ ノ
∨ \ ゝ 辷:ソ ) 芹レ心ヾレ′ / ト-- ´
\ー‐' ノ \ゝ ゞ:_ソ "/ / ヽ
フ i八 " " , ム彡 \
/ / j ト " "イト< \\
/ / j //ヽ、 ∩ イ { {  ̄ フフへ \\
( / ,/ / i >――<ニニニニ┐ 〃/: : ヽ ヽヽ
/ ィT´/ /┌―  ̄ ̄ /::: , ,) 〃//: : : : : :} ヽヽ)
/ / ∧ヾi┌― { { ̄ ノ:::ト゚< ∥//: : : : : : : : i ノ ノ
. ( 人 {:ヽヾi∨ ∧V /:::/ 、ヽ ∥/: : : : : : : : : :} /
V ( ∧: :\'∨ ∧V ノ:::/ ∧ 〉___∥: : : : : :/: : : :レ
/∧: : : : ∨ ∧V┬イ:::ノ 〈 TT | |{{: : : : /: : : : : ∧ ノ
( ハ: : : : :∨'T∧Vi i ( V ! ! {{: : / : : : : : : / ー ノ
V ハ: : : : :∨ヘ∧V i ゝゝ i/⌒\{/ : : : : : : : /ー― ´
∨ ヽ: : : : :∨ヘ∧∨i 〉 〉 / /二 ): : : : : : : : :/
(https://seesaawiki.jp/asciiart/d/Charlotte より)
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long;
// #define int ll
// #define DEBUG 42
inline void nprint(){}
template <class Head, class... Tail>
inline void nprint(Head &&head, Tail &&... tail) {
cout << head << endl;
nprint(move(tail)...);
}
#ifdef DEBUG
#define eprintf(...) nprint(__VA_ARGS__)
#else
#define eprintf(...) if(0==1) cout << 1 << endl;
#endif
#define Yes(a) cout << (a ? "Yes" : "No") << endl
#define YES(a) cout << (a ? "YES" : "NO") << endl
#define POSSIBLE(a) cout << (a ? "POSSIBLE" : "IMPOSSIBLE") << endl
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
template<class T> using V = vector<T>;
template<class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x,y) (x=max(x,y))
#define mins(x,y) (x=min(x,y))
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define FOR(i,a,b) for(ll i = (a); i < (ll)(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) REP(i,n+1)
#define RFOR(i,a,b) for(ll i = (ll)(b)-1;i >= a;--i)
#define RREP(i,n) RFOR(i,0,n)
#define RREPS(i,n) RREP(i,n+1)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define PERM(c) sort(ALL(c)); for(bool cp = true;cp;cp = next_permutation(ALL(c)))
#define eb(val) emplace_back(val)
const double PI = acos(-1), EPS = 1e-10;
const ll MOD = 1E9+7;
int dx[] = {1,0,-1,0}; int dy[] = {0,1,0,-1};
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p){
return s << "(" << p.first << ", " << p.second << ")";
}
template<class T> istream& operator>>(istream &is,vector<T> &st){
for(size_t i=0;i<st.size();++i) is >> st[i];
return is;
}
template<class T> istream& operator>>(istream &is,vector<vector<T>> &st){
for(size_t i=0;i<st.size();++i) is >> st[i];
return is;
}
template<class T> ostream& operator<<(ostream &os, const vector<T> &st){
for(size_t i=0;i<st.size();++i){
if(i==st.size()-1) os << st[i];
else os << st[i] << " ";
}
return os;
}
template<class T> ostream& operator<<(ostream &os, const vector<vector<T>> &st){
for(size_t i=0;i<st.size();++i){
os << st[i];
if(i!=st.size()-1) os << endl;
}
return os;
}
template<typename T>
inline T gcd(T a,T b){//ユークリッドの互除法
if(a==0||b==0){
return max(a,b);
}
while(b){
a %= b;
swap(a,b);
}
return a;
}
template<typename T>
inline T lcm(T a,T b){
T r = gcd(a,b);
a /= r;
b /= r;
return a * b * r;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n,k;
cin >> n >> k;
vi a(n);
cin >> a;
sort(ALL(a));
int g = 0;
for(auto i:a){
g = gcd(g,i);
}
POSSIBLE(k<=a.back()&&k%g==0);
}
Submission Info
Submission Time |
|
Task |
A - Getting Difference |
User |
laft |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
5437 Byte |
Status |
AC |
Exec Time |
18 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 |
18 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 |
11 ms |
512 KB |
subtask_1_08.txt |
AC |
17 ms |
640 KB |
subtask_1_09.txt |
AC |
8 ms |
384 KB |
subtask_1_10.txt |
AC |
13 ms |
512 KB |
subtask_1_11.txt |
AC |
15 ms |
640 KB |