Submission #3594709
Source Code Expand
#include<iostream> #include<algorithm> static const int MAX=10e5; using namespace std; int lcm(int a,int b){ while(b!=0){ int c=b; b=a%b; a=c; } return a; } int main(void) { int N,M; cin >> N >> M; int X[MAX]; for(int j=0,i=0;j<N;j++){ int a; cin >> a; if(a>M && i==j) X[i++]=M; X[i++]=a; } sort(X,X+N+1); if(N==1){ cout << X[N]-X[N-1] << endl; return 0; } int F=lcm(X[N]-X[N-1],X[N-1]-X[N-2]); for(int i=N-3;i>=0;i--) F=lcm(F,X[i+1]-X[i]); cout << F << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Skip |
User | Sintax_error |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 548 Byte |
Status | WA |
Exec Time | 61 ms |
Memory | 640 KB |
Judge Result
Set Name | All | Sample | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 300 | 0 / 0 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | hand_1, large_1, large_2, large_3, large_4, large_5, large_6, large_7, large_8, max_1, max_2, max_3, min_1, min_2, sample_01, sample_02, sample_03, small_1, small_2, small_3, small_4, small_5 |
Sample | sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
hand_1 | AC | 1 ms | 256 KB |
large_1 | AC | 10 ms | 384 KB |
large_2 | AC | 14 ms | 384 KB |
large_3 | AC | 11 ms | 256 KB |
large_4 | AC | 1 ms | 256 KB |
large_5 | AC | 1 ms | 256 KB |
large_6 | AC | 1 ms | 256 KB |
large_7 | AC | 1 ms | 256 KB |
large_8 | AC | 1 ms | 256 KB |
max_1 | AC | 61 ms | 640 KB |
max_2 | AC | 60 ms | 640 KB |
max_3 | AC | 61 ms | 640 KB |
min_1 | WA | 1 ms | 256 KB |
min_2 | AC | 1 ms | 256 KB |
sample_01 | AC | 1 ms | 256 KB |
sample_02 | AC | 1 ms | 256 KB |
sample_03 | AC | 1 ms | 256 KB |
small_1 | AC | 1 ms | 256 KB |
small_2 | AC | 1 ms | 256 KB |
small_3 | AC | 1 ms | 256 KB |
small_4 | AC | 1 ms | 256 KB |
small_5 | WA | 1 ms | 256 KB |