Submission #4878770
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i, n) for(int i = 0; i < (n); i++) #define rep1(i, n) for(int i = 1; i <= (n); i++) #define co(x) cout << (x) << "\n" #define cosp(x) cout << (x) << " " #define ce(x) cerr << (x) << "\n" #define cesp(x) cerr << (x) << " " #define pb push_back #define mp make_pair #define Would #define you #define please const int cm = 1 << 17; char ci[cm]; char *cn = ci + cm; inline char getcha() { if (cn - ci == cm) { fread(ci, 1, cm, stdin); cn = ci; } return *cn++; } inline int getint() { char C = getcha(); int A = C - '0'; while ((C = getcha()) >= '0') A = A * 10 + C - '0'; return A; } int gcd(int A, int B) { if (B) return gcd(B, A % B); return A; } int main() { cin.tie(0); ios::sync_with_stdio(false); int N = getint(), K = getint(); int g = getint(); int saidai = g; rep(i, N - 1) { int a = getint(); g = gcd(a, g); saidai = max(saidai, a); } if (K % g == 0 && K <= saidai) co("POSSIBLE"); else co("IMPOSSIBLE"); Would you please return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | uzzy |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1103 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘char getcha()’: ./Main.cpp:20:46: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] if (cn - ci == cm) { fread(ci, 1, cm, stdin); cn = ci; } ^
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 | 3 ms | 384 KB |
subtask_1_04.txt | AC | 3 ms | 384 KB |
subtask_1_05.txt | AC | 2 ms | 384 KB |
subtask_1_06.txt | AC | 1 ms | 384 KB |
subtask_1_07.txt | AC | 2 ms | 384 KB |
subtask_1_08.txt | AC | 3 ms | 384 KB |
subtask_1_09.txt | AC | 2 ms | 384 KB |
subtask_1_10.txt | AC | 2 ms | 384 KB |
subtask_1_11.txt | AC | 3 ms | 384 KB |