Submission #3776729
Source Code Expand
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
#define REP(i,n) for(int i = 0; i < int(n); i++)
#define FOR(i, m, n) for(int i = int(m);i < int(n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
const ll MOD = (ll)1e9 + 7;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;
template<class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
else return;
}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {
o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;
}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {
o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {
o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;
}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {
o << "{" << obj.first << ", " << obj.second << "}"; return o;
}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {
o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}
void print(void) {
cout << endl;
}
template <class Head> void print(Head&& head) {
cout << head;
print();
}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {
cout << head << " ";
print(forward<Tail>(tail)...);
}
void YN(bool flg) {
cout << ((flg) ? "YES" : "NO") << endl;
}
void Yn(bool flg) {
cout << ((flg) ? "Yes" : "No") << endl;
}
void yn(bool flg) {
cout << ((flg) ? "yes" : "no") << endl;
}
//Greatest Common Divisor
long long GCD(long long a, long long b) {
return ((b == 0) ? a : GCD(b, a % b));
}
int main() {
int N; cin >> N;
ll X; cin >> X;
V<ll> x(N);
REP(i, N) cin >> x[i];
REP(i, N) x[i] = abs(x[i] - X);
ll ans = x[0];
REP(i, N) ans = GCD(ans, x[i]);
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Skip |
User |
ningenMe |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
2649 Byte |
Status |
AC |
Exec Time |
42 ms |
Memory |
1024 KB |
Judge Result
Set Name |
All |
Sample |
Score / Max Score |
300 / 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 |
8 ms |
384 KB |
large_2 |
AC |
10 ms |
384 KB |
large_3 |
AC |
8 ms |
384 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 |
42 ms |
1024 KB |
max_2 |
AC |
42 ms |
1024 KB |
max_3 |
AC |
42 ms |
1024 KB |
min_1 |
AC |
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 |
AC |
1 ms |
256 KB |