Submission #1339929
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define all(c) (c).begin(), (c).end() #define rep(i, n) for (int i = 0; i < (int)(n); i++) int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; int main() { int N; int a[102]; cin >> N; rep(i, N) cin >> a[i]; int s = *min_element(a, a + N); int t = *max_element(a, a + N); cout << t - s << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Traveling AtCoDeer Problem |
User | odan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 413 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | in1.txt, in2.txt, in3.txt, in4.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |