Submission #1445306
Source Code Expand
#include <bits/stdc++.h> using namespace std; int a[100100]; int main() { int n,k; cin>>n>>k; for(int i=0;i<n;i++) { cin>>a[i]; } // if(n==1) { // if(a[0]==k) { // cout<<"POSSIBLE\n"; // } // else { // cout<<"IMPOSSIBLE\n"; // } // return 0; // } int g=a[0]; for(int i=1;i<n;i++) { g=__gcd(g,a[i]); } if(k%g==0 || g==1) { printf("POSSIBLE\n"); } else { for(int i=0;i<n;i++) { if(a[i]==k) { printf("POSSIBLE\n"); return 0; } } printf("IMPOSSIBLE\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | mr_knownothing |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 554 Byte |
Status | WA |
Exec Time | 54 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 | 54 ms | 640 KB |
subtask_1_04.txt | AC | 53 ms | 640 KB |
subtask_1_05.txt | AC | 29 ms | 512 KB |
subtask_1_06.txt | AC | 9 ms | 256 KB |
subtask_1_07.txt | AC | 33 ms | 512 KB |
subtask_1_08.txt | WA | 47 ms | 640 KB |
subtask_1_09.txt | AC | 22 ms | 384 KB |
subtask_1_10.txt | AC | 39 ms | 512 KB |
subtask_1_11.txt | WA | 43 ms | 512 KB |