buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k |
|---|---|---|---|---|
#include <iostream>
using namespace std;
int main() {
int n, i, a[100000], max, min, gou = 0;
cin >> n;
max = -1000001;
min = 1000001;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) {
min = a[i];
}
gou += a[i];
}
cout << min << "... | #include <iostream>
using namespace std;
int main() {
long long n, i, a[100000], max, min, gou = 0;
cin >> n;
max = -1000001;
min = 1000001;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) {
min = a[i];
}
gou += a[i];
}
cout << mi... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 128 |
#include <iostream>
using namespace std;
int main() {
int count, tmp;
int sum, maxVal, minVal;
sum = 0;
cin >> count;
for (int i = 0; i < count; i++) {
cin >> tmp;
if (i == 0) {
maxVal = tmp;
minVal = tmp;
} else {
if (maxVal < tmp) {
maxVal = tmp;
}
if (min... | #include <iostream>
using namespace std;
int main() {
int count, tmp;
int maxVal, minVal;
long long sum;
sum = 0;
cin >> count;
for (int i = 0; i < count; i++) {
cin >> tmp;
if (i == 0) {
maxVal = tmp;
minVal = tmp;
} else {
if (maxVal < tmp) {
maxVal = tmp;
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 120 |
#include <iomanip>
#include <iostream>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
void swap(int &a, int &b);
int main() {
int number;
cin >> number;
int *a = new int[number];
int min = 100000000, max = -10000000, sum = 0;
for (int i = 0; i < number; ++i) {
cin >> a[i];
}
for ... | #include <iomanip>
#include <iostream>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
void swap(int &a, int &b);
int main() {
int number;
cin >> number;
int *a = new int[number];
int min = 100000000000, max = -10000000000;
long int sum = 0;
for (int i = 0; i < number; ++i) {
cin >>... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 162 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = 0, min = 100000, sum = 0;
for (int j = 0; j < n; j++) {
if (max < a[j])
max = a[j];
if (min > a[j])
min = a[j];
... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long max = -10000000, min = 10000000, sum = 0;
for (int j = 0; j < n; j++) {
if (max < a[j])
max = a[j];
if (min > a[j])
... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 143 |
#include <iostream>
using namespace std;
int main() {
int a, b, max = 0, min = 0;
long long int sum = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
sum = sum + b;
if (max < b || i == 0) {
max = b;
}
if (max > b || i == 0) {
min = b;
}
}
cout << min << " " << max <<... | #include <iostream>
using namespace std;
int main() {
int a, b, max = 0, min = 0;
long long int sum = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
sum = sum + b;
if (max < b || i == 0) {
max = b;
}
if (min > b || i == 0) {
min = b;
}
}
cout << min << " " << max <<... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22]] | 1 | 112 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a[10001], n, i, max, min, gou = 0;
cin >> n;
min = 1000000;
max = -1000000;
for (i = 0; i < n; i++) {
cin >> a[i];
gou += a[i];
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) {
min = a[i];
}
}
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long a[10001], n, i, max, min, gou = 0;
cin >> n;
min = 1000000;
max = -1000000;
for (i = 0; i < n; i++) {
cin >> a[i];
gou += a[i];
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) {
min = a[i];
}... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 130 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
int num[n];
for (int i = 0; i < n; i++)
cin >> num[n];
a = num[0];
b = num[0];
c = 0;
for (int i = 0; i < n; i++) {
if (a > num[i])
a = num[i];
}
for (int i = 0; i < n; i++) {
if (b < num[i])
... | #include <iostream>
using namespace std;
int main() {
long long n, a, b, c;
cin >> n;
int num[n];
for (int i = 0; i < n; i++)
cin >> num[i];
a = num[0];
b = num[0];
c = 0;
for (int i = 0; i < n; i++) {
if (a > num[i])
a = num[i];
}
for (int i = 0; i < n; i++) {
if (b < num[i]... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 8, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 176 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num[n];
for (int i = 0; i < n; i++)
cin >> num[i];
int big = num[0];
int little = num[0];
int sum = 0;
for (int i = 0; i < n; i++) {
if (little > num[i])
little = num[i];
if (big < num[i])
big = num[i];
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num[n];
for (int i = 0; i < n; i++)
cin >> num[i];
long long big = num[0], little = num[0], sum = 0;
for (int i = 0; i < n; i++) {
if (little > num[i])
little = num[i];
if (big < num[i])
big = num[i];
su... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21]] | 1 | 143 |
#include <iostream>
using namespace std;
int main() {
int x[10001], i, n, min = 1000001, max = -1000001, wa = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i];
if (min > x[i]) {
min = x[i];
}
if (max <= x[i]) {
max = x[i];
}
wa += x[i];
}
cout << min << " " << max <<... |
#include <iostream>
using namespace std;
int main() {
int x[10001], i, n, min = 1000001, max = -1000001;
long long wa = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i];
if (min > x[i]) {
min = x[i];
}
if (max <= x[i]) {
max = x[i];
}
wa += x[i];
}
cout << min << "... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 124 |
#include <stdio.h>
int main(void) {
int a, i, n, min = 100001, max = -100001;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min)
min = a;
if (a > max)
max = a;
sum = sum + a;
}
printf("%d %d %lld\n", min, max, sum);
return 0;
}
| #include <stdio.h>
int main(void) {
int a, i, n, min = 1000001, max = -1000001;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min)
min = a;
if (a > max)
max = a;
sum = sum + a;
}
printf("%d %d %lld\n", min, max, sum);
return 0;
}
| [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 108 |
#include <stdio.h>
int main(void) {
int a, i, n, min = 100001, max = -100001;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min)
min = a;
if (a > max)
max = a;
sum = sum + a;
}
printf("%d %d %lld\n", min, max, sum);
return 0;
}
| #include <stdio.h>
int main(void) {
int a, i, n, min = 1000001, max = -1000001;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
printf("%d %d %lld\n", min, max, sum);
return 0;
}
| [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 108 |
#include <iostream>
using namespace std;
int main() {
int i, n, min = 1000000, max = -1000000, sum = 0, x;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
sum += x;
if (x < min) {
min = x;
}
if (x > max) {
max = x;
}
}
cout << min << " " << max << " " << sum << endl;
}
| #include <iostream>
using namespace std;
int main() {
long i, n, min = 1000000, max = -1000000, sum = 0, x;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
sum += x;
if (x < min) {
min = x;
}
if (x > max) {
max = x;
}
}
cout << min << " " << max << " " << sum << endl;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 100 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <ut... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <ut... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 143 |
#include <iostream>
using namespace std;
int main(void) {
long long n;
cin >> n;
long long verybig = 1000000;
long long verymini = -1000000;
long long a = 0;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a;
if (a < verybig) {
verybig = a;
} else if (a > verymini) {
verym... | #include <iostream>
using namespace std;
int main(void) {
long long n;
cin >> n;
long long verybig = 1000000;
long long verymini = -1000000;
long long a;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a;
if (a < verybig) {
verybig = a;
}
if (a > verymini) {
verymini =... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 112 |
#include <iostream>
using namespace std;
int main() {
int n, val, max, min, sum;
cin >> n;
cin >> val;
max = val;
min = val;
sum = val;
for (int i = 0; i < n - 1; i++) {
cin >> val;
if (val > max) {
max = val;
} else if (val < min) {
min = val;
}
sum = sum + val;
}
co... | #include <iostream>
using namespace std;
int main() {
int n, val, max, min;
long long sum;
cin >> n;
cin >> val;
max = val;
min = val;
sum = val;
for (int i = 0; i < n - 1; i++) {
cin >> val;
if (val > max) {
max = val;
} else if (val < min) {
min = val;
}
sum = sum + v... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 117 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
cout << vec.at(0) << " ";
reverse(vec.begin(), vec.end());
cout << vec.at(0) << " ";
int T = 0;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
cout << vec.at(0) << " ";
reverse(vec.begin(), vec.end());
cout << vec.at(0) << " ";
long long T = 0;
f... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 145 |
#include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
int min = INT_MAX;
int max = INT_MIN;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
if (max < v[i])
max = v[i];
if (min > v[i])
... | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n * 2);
int min = INT_MAX;
int max = INT_MIN;
long sum = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
if (max < v[i])
max = v[i];
if (min > v[i])
... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 48], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 131 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define loop(i, n) for (int i = 0; i < (n); ++i)
#define loops(i, f, n) for (int i = (f); i < (n); ++i)
#define INF 9999999
#define lint ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define loop(i, n) for (int i = 0; i < (n); ++i)
#define loops(i, f, n) for (int i = (f); i < (n); ++i)
#define INF 9999999
#define lint ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 139 |
#include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
int mn = 1000000;
int mx, sum = 0;
for (int i = 0; n > i; i++) {
cin >> a;
if (a > mx) {
mx = a;
}
if (a < mn) {
mn = a;
}
sum += a;
}
cout << mn << " " << mx << " " << sum << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
int mn = 1000000;
int mx = -1000000;
long long sum = 0;
for (int i = 0; n > i; i++) {
cin >> a;
if (a > mx) {
mx = a;
}
if (a < mn) {
mn = a;
}
sum += a;
}
cout << mn << " " << mx << " " << sum... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 99 |
#include <iostream>
using namespace std;
int main() {
int a;
int data[1000];
long long int max = -1000000, min = 1000000, sum = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> data[i];
if (data[i] > max) {
max = data[i];
}
if (data[i] > min) {
min = data[i];
}
sum += ... | #include <iostream>
using namespace std;
int main() {
int a;
int data[10000];
long long int max = -1000000, min = 1000000, sum = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> data[i];
if (data[i] > max) {
max = data[i];
}
if (data[i] < min) {
min = data[i];
}
sum += ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 124 |
#include <iostream>
using namespace std;
int main() {
int n, a, min = 1000000, max = -1000000;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, min = 1000000, max = -1000000;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
}
| [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 93 |
#include <iostream>
int main() {
int i = 0;
int N;
int a[10000];
int min = 0, max = 0, sum = 0;
std::cin >> N;
for (i = 0; i < N; ++i) {
std::cin >> a[i];
min = a[0];
max = a[0];
}
for (i = 0; i < N; ++i) {
sum += a[i];
if (a[i] <= min) {
min = a[i];
}
if (a[i] >= max) ... | #include <iostream>
int main() {
long int i = 0;
long int N;
long int a[10000];
long int min = 0, max = 0, sum = 0;
std::cin >> N;
for (i = 0; i < N; ++i) {
std::cin >> a[i];
min = a[0];
max = a[0];
}
for (i = 0; i < N; ++i) {
sum += a[i];
if (a[i] <= min) {
min = a[i];
}
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 162 |
#include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int minans = 1000000, maxans = -1000000, sumans = 0;
for (int i = 0; i < n; i++) {
minans = min(minans, a[i]);
maxans = max(maxans, a[i]);
sumans += a[i];
... | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int minans = 1000001, maxans = -1000001;
long long int sumans = 0;
for (int i = 0; i < n; i++) {
minans = min(minans, a[i]);
maxans = max(maxans, a[i]);
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 126 |
#include <stdio.h>
int main(void) {
int i;
int n, input, min, max, sum;
scanf("%d", &n);
sum = 0;
min = 1000001;
max = -1000001;
for (i = 0; i < n; i++) {
scanf("%d", &input);
if (min > input)
min = input;
if (max < input)
max = input;
sum += input;
}
printf("%d %d %d\n", ... | #include <stdio.h>
int main(void) {
int i;
int n, input, min, max;
long long int sum;
scanf("%d", &n);
sum = 0;
min = 1000001;
max = -1000001;
for (i = 0; i < n; i++) {
scanf("%d", &input);
if (min > input)
min = input;
if (max < input)
max = input;
sum += input;
}
print... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 111 |
#include <iostream>
using namespace std;
int main() {
static int sum = 0, max = -1000000, min = 1000000, a[1000000], n, i, j, k, l;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (j = 1; j <= n; j++) {
sum += a[j];
}
for (k = 1; k <= n; k++) {
if (max < a[k]) {
max = a[k];
... | #include <iostream>
using namespace std;
int main() {
long long int sum = 0, max = -1000000, min = 1000000, a[100000], n, i, j, k,
l;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (j = 1; j <= n; j++) {
sum += a[j];
}
for (k = 1; k <= n; k++) {
if (max < a[k]) {
... | [["-", 0, 14, 8, 9, 0, 43, 0, 114, 0, 115], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 173 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = -INT_MAX, min = INT_MAX, sum = 0, in;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> in;
max = std::max(max, in);
min = std::min(min, in);
sum += in;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = -INT_MAX, min = INT_MAX, in;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> in;
max = std::max(max, in);
min = std::min(min, in);
sum += in;
}
cout << min << " " << max << " " << sum << endl;
ret... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 101 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <iostream>
using namespace std;
const int MAX = 1000000;
int main() {
int n, x, sum = 0, maxi = -MAX, mini = MAX;
cin >> n;
// assert(n <= 10000);
for (int i = 0; i < n; i++) {
cin >> x;
maxi = max(maxi, x);
mini = min(mini, x);
... | #include <algorithm>
#include <cassert>
#include <climits>
#include <iostream>
using namespace std;
const int MAX = 1000000;
int main() {
long long n, x, sum = 0, maxi = -MAX, mini = MAX;
cin >> n;
// assert(n <= 10000);
for (int i = 0; i < n; i++) {
cin >> x;
maxi = max(maxi, x);
mini = min(mini... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 108 |
#include <cstdio>
int a[15000];
int main() {
int N, min = 99999999, max = -99999999, sum = 0;
scanf(" %d", &N);
for (int i = 0; i < N; ++i) {
scanf(" %d", &a[i]);
}
for (int i = 0; i < N; ++i) {
sum += a[i];
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = a[i];
... | #include <cstdio>
int a[15000];
int main() {
int N, min = 99999999, max = -99999999;
long long int sum = 0;
scanf(" %d", &N);
for (int i = 0; i < N; ++i) {
scanf(" %d", &a[i]);
}
for (int i = 0; i < N; ++i) {
sum += a[i];
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 144 |
#include <iostream>
int main() {
int min;
int max;
int sum = 0;
int n, d;
std::cin >> n;
std::cin >> d;
min = max = d;
sum += d;
for (int i = 0; i < n - 1; i++) {
std::cin >> d;
if (min > d)
min = d;
if (max < d)
max = d;
sum += d;
}
std::cout << min << " " << max <<... | #include <iostream>
int main() {
int min;
int max;
long long sum = 0;
int n, d;
std::cin >> n;
std::cin >> d;
min = max = d;
sum += d;
for (int i = 0; i < n - 1; i++) {
std::cin >> d;
if (min > d)
min = d;
if (max < d)
max = d;
sum += d;
}
std::cout << min << " " << ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 119 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long getSum(vector<int> v) {
int sum = 0;
for (size_t i = 0; i < v.size(); i++) {
sum += v[i];
}
return sum;
}
int main() {
vector<int> list;
int num = 0;
cin >> num;
int tmp = 0;
for (int i = 0; i < num; i++)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long getSum(vector<int> v) {
long long sum = 0;
for (size_t i = 0; i < v.size(); i++) {
sum += v[i];
}
return sum;
}
int main() {
vector<int> list;
int num = 0;
cin >> num;
int tmp = 0;
for (int i = 0; i < num... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 162 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, mini = 1000000000, maxi = -1000000000, sum = 0;
cin >> n;
while (n--) {
cin >> a;
mini = min(mini, a);
maxi = max(maxi, a);
sum += a;
}
cout << mini << ' ' << maxi << ' ' << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, mini = 1000000000, maxi = -1000000000, sum = 0;
cin >> n;
while (n--) {
cin >> a;
mini = min(mini, a);
maxi = max(maxi, a);
sum += a;
}
cout << mini << ' ' << maxi << ' ' << sum << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 87 |
#include <iostream>
using namespace std;
int main() {
int n;
int min = 1000000;
int max = -1000000;
int i;
int a;
int sum = 0;
for (i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum = sum + a;
}
cout << min << " " << max << " " << sum << endl;... | #include <iostream>
using namespace std;
int main() {
int n;
int min = 1000000;
int max = -1000000;
int i;
int a;
long sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum = sum + a;
}
cout << min << " " << max << " " <<... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 102 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[10000], c[3] = {0};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int k = 0; k < n; k++)
c[2] += a[k];
for (int bb = 0; bb < n; bb++) {
for (int j = n - 1; j > bb; j--) {
if (a[j - 1] > a[j]) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[10001];
long long c[3] = {0};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int k = 0; k < n; k++)
c[2] += a[k];
for (int bb = 0; bb < n; bb++) {
for (int j = n - 1; j > bb; j--) {
if (a[j - 1] > ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 223 |
#include <stdio.h>
int main(void)
{
long long int a[10000], min = 1000000, max = -1000000, sum = 0;
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
if (a[i] >= max) {
max = a[i];
}
if (a[i] <= min) {
min = a[i];
}
sum += a[i];
}
pri... | #include <stdio.h>
int main(void)
{
long long int a[10000], min = 1000000, max = -1000000, sum = 0;
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
if (a[i] >= max) {
max = a[i];
}
if (a[i] <= min) {
min = a[i];
}
sum += a[i];
}
pri... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 132 |
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define PI 3.141592653589
int main() {
int x, y, a = 1000000, b = -1000000, c = 0;
cin >> y;
for (int i = 0; i < y; i++) {
cin >> x;
c += x;
if (a > x)
a = x;
if (b < x)
b = x;
}
cout << a << " " << b <<... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define PI 3.141592653589
int main() {
int x, y, a = 1000000, b = -1000000;
long c = 0;
cin >> y;
for (int i = 0; i < y; i++) {
cin >> x;
c += x;
if (a > x)
a = x;
if (b < x)
b = x;
}
cout << a << " " ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <iostream>
using namespace std;
int main() {
int n;
int data;
int min, max, sum = 0;
cin >> n;
cin >> data;
min = data;
max = data;
sum += data;
for (int i = 1; i < n; i++) {
cin >> data;
if (data > max) {
max = data;
} else if (data < min) {
min = data;
}
sum ... | #include <iostream>
using namespace std;
int main() {
int n;
int data;
int min, max;
long long int sum = 0;
cin >> n;
cin >> data;
min = data;
max = data;
sum += data;
for (int i = 1; i < n; i++) {
cin >> data;
if (data > max) {
max = data;
} else if (data < min) {
min = data... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 119 |
#include <iostream>
using namespace std;
int main(void) {
int i, n, max, min, sum;
max = -1000000;
min = 1000000;
sum = 0;
cin >> n;
if (n == 0)
cout << "0 0 0" << endl;
else {
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i... | #include <iostream>
using namespace std;
int main(void) {
int i, n, max, min;
long int sum;
max = -1000000;
min = 1000000;
sum = 0;
cin >> n;
if (n == 0)
cout << "0 0 0" << endl;
else {
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
if (max < a[i])
max = a[i];
if... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 145 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int val;
cin >> val;
int min, max, sum;
min = max = sum = val;
for (int i = 1; i < n; ++i) {
cin >> val;
max = (val > max) ? val : max;
min = (val < min) ? val : min;
sum += val;
}
printf("%d %d ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int val;
cin >> val;
int min, max;
long sum;
min = max = sum = val;
for (int i = 1; i < n; ++i) {
cin >> val;
max = (val > max) ? val : max;
min = (val < min) ? val : min;
sum += val;
}
printf(... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 108 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n[10000], num, i, ans = 0;
cin >> num;
for (i = 0; i < num; i++) {
cin >> n[i];
}
sort(n, n + num);
cout << n[0] << " ";
for (i = 0; i < num; i++) {
ans = ans + n[i];
}
cout << n[num - 1] <... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
// your code goes here
long long n[99999], num, i, ans = 0;
cin >> num;
for (i = 0; i < num; i++) {
cin >> n[i];
}
sort(n, n + num);
cout << n[0] << " ";
for (i = 0; i < num; i++) {
ans = ans + n[i];
}
cout << n[num ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 119 |
#include <iostream>
using namespace std;
int main() {
int n, min, max, acc = 0;
cin >> n;
int a[n], s;
cin >> s;
min = s;
max = s;
acc = s;
for (int i = 0; i < n - 1; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
acc += a[i];
}
cout ... | #include <iostream>
using namespace std;
int main() {
int n;
long int min, max, acc = 0;
cin >> n;
int a[n], s;
cin >> s;
min = s;
max = s;
acc = s;
for (int i = 0; i < n - 1; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
acc += a[i];
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 136 |
#include <algorithm>
#include <climits>
#include <iostream>
int main(int argc, char **argv) {
int n = 0;
int min = INT_MAX;
int max = -INT_MAX;
int sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
int c = 0;
std::cin >> c;
sum += c;
min = std::min(c, min);
max = std::max(c, max... | #include <algorithm>
#include <climits>
#include <iostream>
int main(int argc, char **argv) {
int n = 0;
long min = INT_MAX;
long max = -INT_MAX;
long sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
long c = 0;
std::cin >> c;
sum += c;
min = std::min(c, min);
max = std::max(c,... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 124 |
#include <iostream>
using namespace std;
int main() {
const int N_SIZE_MAX = 10000;
int n[N_SIZE_MAX];
int nSize;
int min, max, sum = 0;
cin >> nSize;
for (int i = 0; i < nSize; i++)
cin >> n[i];
min = n[0];
max = n[0];
for (int i = 0; i < nSize; i++) {
if (min > n[i])
min = n[i];
if... | #include <iostream>
using namespace std;
int main() {
const int N_SIZE_MAX = 10000;
int n[N_SIZE_MAX];
int nSize;
int min, max;
long int sum = 0;
cin >> nSize;
for (int i = 0; i < nSize; i++)
cin >> n[i];
min = n[0];
max = n[0];
for (int i = 0; i < nSize; i++) {
if (min > n[i])
min = n... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 151 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, m, M, s, t;
cin >> N;
m = 1000000;
M = -1000000;
s = 0;
for (int i = 0; i < N; i++) {
cin >> t;
m = min(m, t);
M = max(M, t);
s += t;
}
cout << m << " " << M << " " << s << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, m, M, t;
long int s;
cin >> N;
m = 1000000;
M = -1000000;
s = 0;
for (int i = 0; i < N; i++) {
cin >> t;
m = min(m, t);
M = max(M, t);
s += t;
}
cout << m << " " << M << " " << s << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 104 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define SPACE string(" ")
int main(void) {
int n;
cin >> n;
string str;
cin >> ws;
getline(cin, str);
string::size_type spos = 0;
string::size_type epos = 0;
vector<int> v;
int nu... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define SPACE string(" ")
int main(void) {
int n;
cin >> n;
string str;
cin >> ws;
getline(cin, str);
string::size_type spos = 0;
string::size_type epos = 0;
vector<int> v;
int nu... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 205 |
#include <iostream>
using namespace std;
int main() {
int n, a, min, max, sum;
sum = 0;
cin >> n;
cin >> a;
min = max = sum = a;
while (--n) {
cin >> a;
sum += a;
if (a < min)
min = a;
else if (a > max)
max = a;
}
cout << min << ' ' << max << ' ' << sum << endl;
retur... | #include <iostream>
using namespace std;
int main() {
int n, a, min, max;
long sum;
cin >> n;
cin >> a;
min = max = sum = a;
while (--n) {
cin >> a;
sum += a;
if (a < min)
min = a;
else if (a > max)
max = a;
}
cout << min << ' ' << max << ' ' << sum << endl;
return 0;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 100 |
#include <iostream>
using namespace std;
int main(void) {
int n, max, min, sum, val;
cin >> n >> val;
sum = val;
max = val;
min = val;
for (int i = 1; i < n; i++) {
cin >> val;
sum += val;
if (max < val)
max = val;
if (min > val)
min = val;
}
cout << min << " " << max << " " ... | #include <iostream>
using namespace std;
int main(void) {
long n, max, min, sum, val;
cin >> n >> val;
sum = val;
max = val;
min = val;
for (int i = 1; i < n; i++) {
cin >> val;
sum += val;
if (max < val)
max = val;
if (min > val)
min = val;
}
cout << min << " " << max << " "... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 107 |
#include <iostream>
using namespace std;
int main() {
int datas, max, min, sum, data;
cin >> datas;
cin >> data;
max = min = sum = data;
for (int i = 1; i < datas; i++) {
cin >> data;
if (data > max)
max = data;
if (data < min)
min = data;
sum += data;
}
cout << min << " " << m... | #include <iostream>
using namespace std;
int main() {
long int datas, max, min, sum, data;
cin >> datas;
cin >> data;
max = min = sum = data;
for (int i = 1; i < datas; i++) {
cin >> data;
if (data > max)
max = data;
if (data < min)
min = data;
sum += data;
}
cout << min << " "... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 104 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define pi 3.14159265358979323846264338
using namespace std;
int main() {
int n;
cin >> n;
int j;
int ansmin = 1000000, ansmax = -1000000, anssum = 0;
for (int i = 0; i < n; i++) {
... |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define pi 3.14159265358979323846264338
using namespace std;
int main() {
int n;
cin >> n;
int j;
long long int ansmin = 1000000, ansmax = -1000000, anssum = 0;
for (int i = 0; i < n... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 116 |
#include "algorithm"
#include "cmath"
#include "iostream"
using namespace std;
int n, ma, mi, sum;
int a[10010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ma = a[0];
mi = a[0];
for (int i = 0; i < n; i++) {
sum += a[i];
ma = max(ma, a[i]);
mi = min(mi, a[i])... | #include "algorithm"
#include "cmath"
#include "iostream"
using namespace std;
int n, ma, mi;
long long sum;
int a[10010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ma = a[0];
mi = a[0];
for (int i = 0; i < n; i++) {
sum += a[i];
ma = max(ma, a[i]);
mi = min... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 146 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < ... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 1 | 173 |
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <complex>
#include <iomanip> // << fixed << setprecision(xxx)
#include <iostream>
#include <map> // if (M.find(key) != M.end()) { }
#include <queue>
#include <set> // S.insert(M);
#include <stack>
#include <string> // to_string(nnn) // subst... | #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <complex>
#include <iomanip> // << fixed << setprecision(xxx)
#include <iostream>
#include <map> // if (M.find(key) != M.end()) { }
#include <queue>
#include <set> // S.insert(M);
#include <stack>
#include <string> // to_string(nnn) // subst... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 43, 49, 50, 51, 350, 39, 40], ["+", 8, 9, 0, 43, 49, 50, 51, 350, 39, 78]] | 1 | 321 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, sum = 0, min = 1000005, max = -1000001, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
sum += c;
if (min... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, sum = 0, min = 1000005, max = -1000001, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
sum += c;
i... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 109 |
#include <iostream>
#define INF 1e9
using namespace std;
int n, a;
int n_min = INF, n_max = -INF, sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
n_min = min(a, n_min);
n_max = max(a, n_max);
sum += a;
}
cout << n_min << " " << n_max << " " << sum << endl;
} | #include <iostream>
#define INF 1e9
using namespace std;
int n, a, n_min = INF, n_max = -INF;
long sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
n_min = min(a, n_min);
n_max = max(a, n_max);
sum += a;
}
cout << n_min << " " << n_max << " " << sum << endl;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 98 |
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
int a[x];
for (int i = 0; i < x; i++) {
cin >> a[i];
}
int min = a[0];
int max = a[0];
int sum = a[0];
for (int i = 1; i < x; i++) {
sum += a[i];
if (min > a[i]) {
min = a[i];
}
if (max < a[i]) {
max... | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
int a[x];
for (int i = 0; i < x; i++) {
cin >> a[i];
}
int min = a[0];
int max = a[0];
long int sum = a[0];
for (int i = 1; i < x; i++) {
sum += a[i];
if (min > a[i]) {
min = a[i];
}
if (max < a[i]) {
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 152 |
#include <stdio.h>
int main(void) {
int n = 0;
int i = 0;
long a[10000] = {0};
long min = 1000001;
long max = -1000001;
long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a[... | #include <stdio.h>
int main(void) {
int n = 0;
int i = 0;
long a[10000] = {0};
long min = 1000001;
long max = -1000001;
long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%ld", &a[i]);
for (i = 0; i < n; i++) {
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 151 |
/*
????°????????????§??????????¨????
n????????´??°
ai(i=1,2,...n)?????\?????????????????????????°????????????§??????????¨????????±???????????????°????????????????????????????????????
Input
??????????????´??°?????° n???????????????????????????????????? n ????????´??°
ai????????????????????§?????????????????????
Output... | /*
????°????????????§??????????¨????
n????????´??°
ai(i=1,2,...n)?????\?????????????????????????°????????????§??????????¨????????±???????????????°????????????????????????????????????
Input
??????????????´??°?????° n???????????????????????????????????? n ????????´??°
ai????????????????????§?????????????????????
Output... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 115 |
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int count;
int max, min, sum = 0;
int n;
cin >> count;
if (count--) {
cin >> n;
sum += n;
max = n;
min = n;
}
while (count--) {
cin >> n;
sum += n;
if (max < n) {
max = n;
}
if (min > n) ... | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int count;
long int max, min, sum = 0;
long int n;
cin >> count;
if (count--) {
cin >> n;
sum += n;
max = n;
min = n;
}
while (count--) {
cin >> n;
sum += n;
if (max < n) {
max = n;
}
if ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 124 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int num;
cin >> num;
int buf;
vector<int> hoge;
for (int a = 0; a < num; ++a) {
cin >> buf;
hoge.push_back(buf);
}
sort(hoge.begin(), hoge.end(), greater<int>());
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int num;
cin >> num;
int buf;
vector<int> hoge;
for (int a = 0; a < num; ++a) {
cin >> buf;
hoge.push_back(buf);
}
sort(hoge.begin(), hoge.end(), greater<int>());
... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 31, 16, 31, ... | 1 | 135 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x, max = 0, min = 0, mix = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (i == 1)
max = x;
if (max < x)
max = x;
if (i == 1)
min = x;
if (min > x)
min = x;
mix += x;
}... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long n, x, max = 0, min = 0, mix = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (i == 1)
max = x;
if (max < x)
max = x;
if (i == 1)
min = x;
if (min > x)
min = x;
mix += x;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 120 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long int n;
long int i;
long long int num;
long long int max = 1000000;
long long int min = -1000000;
long long int sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> num;
if (num > max) {
max = num;
}
if (nu... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long int n;
long int i;
long long int num;
long long int max = -1000000;
long long int min = 1000000;
long long int sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> num;
if (num > max) {
max = num;
}
if (nu... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 122 |
#include <stdio.h>
long long num[10000];
int main(void) {
int i;
long long n, sum, max, min;
scanf("%lld", &n);
for (i = 0; i < n; i++)
scanf("%lld", &num[i]);
max = 0;
min = 1000001;
for (i = 0; i < n; i++) {
if (max < num[i])
max = num[i];
if (min > num[i])
min = num[i];
}
... | #include <stdio.h>
long long num[10000];
int main(void) {
int i;
long long n, sum, max, min;
scanf("%lld", &n);
for (i = 0; i < n; i++)
scanf("%lld", &num[i]);
max = -1000001;
min = 1000001;
for (i = 0; i < n; i++) {
if (max < num[i])
max = num[i];
if (min > num[i])
min = num[i... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 161 |
#include <iostream>
using namespace std;
int main() {
int min = 1000000, max = -1000000;
int n, i, a;
cin >> n;
i = 0;
for (int j = 1; j <= n; ++j) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
i += a;
}
cout << min << " " << max << " " << i << endl;
return 0;
}... | #include <iostream>
using namespace std;
int main() {
int min = 1000000, max = -1000000;
int n, a;
cin >> n;
long i = 0;
for (int j = 1; j <= n; ++j) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
i += a;
}
cout << min << " " << max << " " << i << endl;
return 0;... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 101 |
#include <bits/stdc++.h>
using namespace std;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define VV(type, c, m, n, i) vector<vector<type>> c(m... | #include <bits/stdc++.h>
using namespace std;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define VV(type, c, m, n, i) vector<vector<type>> c(m... | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 220 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int n, minv = 1000002, maxv = -1000002, sumv = 0, a = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
minv = min(minv, a);
maxv = max(maxv, a);
sumv += a;
}
cout << minv << " " << maxv << " " << sumv << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, minv = 1000002, maxv = -1000002, a = 0;
long long sumv = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
minv = min(minv, a);
maxv = max(maxv, a);
sumv += a;
}
cout << minv << " " << maxv << " " << sumv << endl;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 97 |
#include <iostream>
using namespace std;
int main() {
int n, x, i;
int sum = 0, max = -1000001, s = 1000001;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
if (x > max)
max = x;
if (s > x)
s = x;
sum += x;
}
cout << s << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long n, x, i;
long sum = 0, max = -1000001, s = 1000001;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
if (x > max)
max = x;
if (s > x)
s = x;
sum += x;
}
cout << s << " " << max << " " << sum << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 100 |
#include <stdio.h>
int main(void) {
int i, n, min, max, temp;
unsigned int sum;
scanf("%d", &n);
scanf("%d", &temp);
min = temp;
max = temp;
sum = temp;
for (i = 1; i < n; i++) {
scanf("%d", &temp);
if (temp < min)
min = temp;
if (max < temp)
max = temp;
sum = sum + temp;... | #include <stdio.h>
int main(void) {
int i, n, min, max, temp;
long sum;
scanf("%d", &n);
scanf("%d", &temp);
min = temp;
max = temp;
sum = temp;
for (i = 1; i < n; i++) {
scanf("%d", &temp);
if (temp < min)
min = temp;
if (max < temp)
max = temp;
sum = sum + temp;
}
... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 124 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, max, min, tgt;
cin >> x;
long long sum = 0;
for (int i = 0; i < x; i++) {
cin >> tgt;
if (i == 0) {
max = tgt;
min = tgt;
}
sum += tgt;
if (tgt > max) {
max = tgt;
}
if... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, max, min, tgt;
cin >> x;
long long sum = 0;
for (int i = 0; i < x; i++) {
cin >> tgt;
if (i == 0) {
max = tgt;
min = tgt;
}
sum += tgt;
if (tgt > max) {
max = tgt;
}
if... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 113 |
#include <stdio.h>
int main() {
int i;
int n;
int a;
int min = 10000000, max = -10000000;
int sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum += a;
}
printf("%d %d %d\n", min, max, sum);
... | #include <stdio.h>
int main() {
int i;
int n;
int a;
int min = 10000000, max = -10000000;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum += a;
}
printf("%d %d %ld\n", min, max, s... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 111 |
#include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
int min = 1000000, max = -1000000;
long sum = 0;
for (int i = 0; i < n; i++) {
int a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
return 0;
... | #include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
int min = 1000000, max = -1000000;
long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
return ... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152]] | 1 | 99 |
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n);
for (int i = 0; i != n; ++i) {
cin >> a[i];
}
int min = a[0], max = a[0];
int sum = 0;
for (auto x : a) {
if (x < min)
min = x;
else if (max < x)
ma... | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n);
for (int i = 0; i != n; ++i) {
cin >> a[i];
}
int64_t min = a[0], max = a[0];
int64_t sum = 0;
for (auto x : a) {
if (x < min)
min = x;
else if (max < x)
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 130 |
#include <iostream>
using namespace std;
int main() {
int n;
int ai;
int ai2;
int i;
int max;
int min;
int sum;
cin >> n;
cin >> ai;
max = ai;
min = ai;
sum = 0;
ai2 = ai;
for (i = 2; i <= n; i++) {
cin >> ai;
sum += ai;
if (max <= ai)
max = ai;
if (min >= ai)
... | #include <iostream>
using namespace std;
int main() {
int n;
int ai;
int ai2;
int i;
int max;
int min;
long sum;
cin >> n;
cin >> ai;
max = ai;
min = ai;
sum = 0;
ai2 = ai;
for (i = 2; i <= n; i++) {
cin >> ai;
sum += ai;
if (max <= ai)
max = ai;
if (min >= ai)
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 125 |
#include <iomanip>
#include <iostream>
int main() {
int n;
std::cin >> n;
int min, max, sum, x;
min = -100000;
max = 100000;
sum = 0;
for (int i = 0; i < n; i++) {
std::cin >> x;
if (x < min)
min = x;
if (x > max)
max = x;
sum += x;
}
std::cout << min << " " << max << " " ... | #include <iomanip>
#include <iostream>
int main() {
int n;
std::cin >> n;
long int min, max, sum, x;
min = 1000000;
max = -1000000;
sum = 0;
for (int i = 0; i < n; i++) {
std::cin >> x;
if (x < min)
min = x;
if (x > max)
max = x;
sum += x;
}
std::cout << min << " " << max ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 111 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
cout << a[0] << " " << a[n - 1] << " " << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
long sum;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
cout << a[0] << " " << a[n - 1] << " " << sum << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 100 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int min = a[0], max = a[0], sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (a[i] > max)
max = a[i];
if (a[i] < m... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int min = a[0], max = a[0];
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (a[i] > max)
max = a[i];
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 153 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mx = -1e9;
int mn = 1e9;
int a;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (mx < a)
mx = a;
if (mn > a)
mn = a;
sum += a;
}
cout << mn << " " << mx << " "... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mx = -1e9;
int mn = 1e9;
int a;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (mx < a)
mx = a;
if (mn > a)
mn = a;
sum += a;
}
cout << mn << " " << mx ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 101 |
#include <iostream>
using namespace std;
int n, a[10000];
int mi, ma, su = 0;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
mi = a[0];
ma = a[0];
for (int i = 0; i < n; i++) {
if (mi > a[i])
mi = a[i];
if (ma < a[i])
... | #include <iostream>
using namespace std;
int n, a[10000];
int mi, ma;
long long su = 0;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
mi = a[0];
ma = a[0];
for (int i = 0; i < n; i++) {
if (mi > a[i])
mi = a[i];
if (ma ... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 162 |
#include <iostream>
using namespace std;
int main() {
long long a;
long long min = 1000000;
long long max = -1000000;
long long sum = 0;
long long n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (min > a) {
min = a;
} else if (max < a) {
max = a;
}
sum += a;
}
... | #include <iostream>
using namespace std;
int main() {
long long a;
long long min = 1000000;
long long max = -1000000;
long long sum = 0;
long long n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 112 |
#include <iostream>
using namespace std;
int main() {
int a, b, min = 1000000, max = -1000000;
long long s = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b > max)
max = b;
if (b < min)
min = b;
s += (unsigned int)b;
}
cout << min << " " << max << " " << s << endl;
r... | #include <iostream>
using namespace std;
int main() {
int a, b, min = 1000000, max = -1000000;
long long s = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (b > max)
max = b;
if (b < min)
min = b;
s += b;
}
cout << min << " " << max << " " << s << endl;
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 74, 0, 24], ["-", 0, 11, 12, 74, 39, 77, 39, 86, 0, 87], ["-", 0, 11, 12, 74, 39, 77, 39, 86, 39, 40], ["-", 8, 9, 0, 1, 0, 11, 12, 74, 0, 25]] | 1 | 104 |
#include <iostream>
using namespace std;
int main() {
int n, x;
int max = 1000000;
int min = -1000000;
long long sum = 0;
cin >> n;
while (n > 0) {
cin >> x;
if (x > max)
max = x;
if (x < min)
min = x;
sum = sum + x;
n--;
}
cout << min << " " << max << " " << sum << endl... | #include <iostream>
using namespace std;
int main() {
int n, x;
int max = -1000000;
int min = 1000000;
long long sum = 0;
cin >> n;
while (n > 0) {
cin >> x;
if (x > max)
max = x;
if (x < min)
min = x;
sum = sum + x;
n--;
}
cout << min << " " << max << " " << sum << endl... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 99 |
#include <iostream>
using namespace std;
int main() {
int n, x, y, p, b, i;
y = 0;
b = -1000001;
p = 1000001;
cin >> n;
for (x = 0; x < n; x++) {
cin >> i;
y = y + i;
if (b < i) {
b = i;
}
if (p > i) {
p = i;
}
}
cout << p << " " << b << " " << y << " " << endl;
... | #include <iostream>
using namespace std;
int main() {
long long int n, x, y, p, b, i;
y = 0;
b = -1000001;
p = 1000001;
cin >> n;
for (x = 0; x < n; x++) {
cin >> i;
y = y + i;
if (b < i) {
b = i;
}
if (p > i) {
p = i;
}
}
cout << p << " " << b << " " << y << endl;... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 115 |
#include <iostream>
using namespace std;
int main() {
int n;
int min = 1000001;
int max = -1000001;
int y = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (min > a)
min = a;
if (max < a)
max = a;
y = y + a;
}
cout << min << " " << max << " " << y << endl;
... | #include <iostream>
using namespace std;
int main() {
int n;
int min = 1000001;
int max = -1000001;
long long int y = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (min > a)
min = a;
if (max < a)
max = a;
y = y + a;
}
cout << min << " " << max << " " << y... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 104 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, MAX = -1000000, MIN = 1000000, SUM = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
MAX = max(MAX, a);
MIN = min(MIN, a);
SUM = SUM + a;
}
cout << MIN << " " << MAX << " " << SUM << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, MAX = -1000000, MIN = 1000000;
long int SUM = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
MAX = max(MAX, a);
MIN = min(MIN, a);
SUM = SUM + a;
}
cout << MIN << " " << MAX << " " << SUM << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 100 |
#include <iostream>
using namespace std;
int main() {
long long sum = 0, n, max = 0, min = 0, i, x;
cin >> i;
for (x = 0; x < i; x++) {
cin >> n;
if (n > max) {
max = n;
}
if (n < min) {
min = n;
}
sum = sum + n;
}
cout << min << " " << max << " " << sum << endl;
return ... | #include <iostream>
using namespace std;
int main() {
long long sum = 0, n, max = -1000000, min = 1000000, i, x;
cin >> i;
for (x = 0; x < i; x++) {
cin >> n;
if (n > max) {
max = n;
}
if (n < min) {
min = n;
}
sum = sum + n;
}
cout << min << " " << max << " " << sum << end... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 106 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, total = 0;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
total += v[i];
}
cout ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n, total = 0;
vector<long long int> v;
cin >> n;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 130 |
#include <iostream>
#include <stdio.h>
int main() {
int n;
int min, max, sum;
std::cin >> n;
for (int i = 0; i < n; i++) {
int temp;
std::cin >> temp;
if (i == 0) {
min = temp;
max = temp;
sum = temp;
} else {
if (temp < min) {
min = temp;
}
if (temp ... | #include <iostream>
#include <stdio.h>
int main() {
int n;
int min, max;
long long sum;
std::cin >> n;
for (int i = 0; i < n; i++) {
int temp;
std::cin >> temp;
if (i == 0) {
min = temp;
max = temp;
sum = temp;
} else {
if (temp < min) {
min = temp;
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 119 |
/**
* ????°????????????§??????????¨????
n ????????´??° ai(i=1,2,...n)
?????\?????????????????????????°????????????§??????????¨????????±???????????????°????????????????????????????????????
Input
??????????????´??°?????° n ???????????????????????????????????? n ????????´??°
ai
????????????????????§????????????????????... | /**
* ????°????????????§??????????¨????
n ????????´??° ai(i=1,2,...n)
?????\?????????????????????????°????????????§??????????¨????????±???????????????°????????????????????????????????????
Input
??????????????´??°?????° n ???????????????????????????????????? n ????????´??°
ai
????????????????????§????????????????????... | [["+", 31, 16, 12, 2, 3, 4, 0, 74, 0, 24], ["+", 3, 4, 0, 74, 39, 77, 39, 86, 0, 96], ["+", 3, 4, 0, 74, 39, 77, 39, 86, 39, 40], ["+", 31, 16, 12, 2, 3, 4, 0, 74, 0, 25]] | 1 | 289 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, a[10000], i, max = -1000000, min = 1000000, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = a[i];
}
}
cout << min <<... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, a[10000], i;
long long max = -1000000, min = 1000000, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = a[i];
}
}
co... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 126 |
#include <iostream>
using namespace std;
int main() {
int n;
int i;
int a[10000];
int min;
int max;
int sum;
// n???????????\???
cin >> n;
// n???????????´??°?????\???
for (i = 0; i < n; i++) {
cin >> a[i];
}
// min,max,sum???????????????a[0]
min = a[0];
max = a[0];
sum = a[0];
... | #include <iostream>
using namespace std;
int main() {
long n;
long i;
long a[10000];
long min;
long max;
long sum;
// n???????????\???
cin >> n;
// n???????????´??°?????\???
for (i = 0; i < n; i++) {
cin >> a[i];
}
// min,max,sum???????????????a[0]
min = a[0];
max = a[0];
sum = a[0... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 164 |
#include <iostream>
using namespace std;
int main() {
int n, z, mx, mn;
long long int sm;
cin >> n;
cin >> z;
mx = z;
mn = z;
sm = z;
for (int i = 0; i < n - 1; i++) {
cin >> z;
if (z > mx)
mx = z;
else if (z <= mn)
mn = z;
sm = sm + z;
}
cout << mx << " " << mn << " " ... | #include <iostream>
using namespace std;
int main() {
int n, z, mx, mn;
long long int sm;
cin >> n;
cin >> z;
mx = z;
mn = z;
sm = z;
for (int i = 0; i < n - 1; i++) {
cin >> z;
if (z > mx)
mx = z;
else if (z <= mn)
mn = z;
sm = sm + z;
}
cout << mn << " " << mx << " " ... | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22]] | 1 | 116 |
#include "iostream"
#include "string"
int main() {
int n;
int max = 0;
int min = 100000000;
long int sum = 0;
long int in[10000];
std::cin >> n;
for (int i = 0; i < n; i++)
std::cin >> in[i];
for (int i = 0; i < n; i++)
sum += in[i];
for (int i = 0; i < n; i++) {
if (in[i] < min)
... | #include "iostream"
#include "string"
int main() {
int n;
int max = -100000000;
int min = 100000000;
long int sum = 0;
long int in[10000];
std::cin >> n;
for (int i = 0; i < n; i++)
std::cin >> in[i];
for (int i = 0; i < n; i++)
sum += in[i];
for (int i = 0; i < n; i++) {
if (in[i] < m... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 179 |
#include <iostream>
using namespace std;
int a[10000];
int min(int n) {
int minimum = a[0];
for (int i = 1; i < n; i++) {
if (minimum > a[i])
minimum = a[i];
}
return minimum;
}
int max(int n) {
int maximum = a[0];
for (int i = 1; i < n; i++) {
if (maximum < a[i])
maximum = a[i];
}
r... | #include <iostream>
using namespace std;
int a[10000];
int min(int n) {
int minimum = a[0];
for (int i = 1; i < n; i++) {
if (minimum > a[i])
minimum = a[i];
}
return minimum;
}
int max(int n) {
int maximum = a[0];
for (int i = 1; i < n; i++) {
if (maximum < a[i])
maximum = a[i];
}
r... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 219 |
#include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
int min = a[0], max = a[0], sum = 0;
for (i = 0; i < n; i++) {
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
sum += a[i];
}
cout << min << " " ... | #include <iostream>
using namespace std;
int main() {
long int n, i;
cin >> n;
long int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
long int min = a[0], max = a[0], sum = 0;
for (i = 0; i < n; i++) {
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
sum += a[i];
}
cout... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 140 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int min_v, max_v, sum;
int x;
int i;
sum = 0;
i = 0;
while (cin >> x && i < n) {
if (i == 0) {
min_v = x;
max_v = x;
}
if (x < min_v)
min_v = x;
if (max_v < x)
max_... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long int min_v, max_v, sum;
int x;
int i;
sum = 0;
i = 0;
while (cin >> x) {
if (i == 0) {
min_v = x;
max_v = x;
}
if (x < min_v)
min_v = x;
if (max_v < x)
max_v = ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 12, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 120 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int sum = 0, max, min, n, m, j;
cin >> m;
long a[10000];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + (m));
max = a[m - 1];
min = a[0];
for (int i = 0; i < m; i++) {
sum = sum + a[i];
}
co... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
long long sum = 0, max, min, n, m, j;
cin >> m;
long long a[10000];
for (long i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + (m));
max = a[m - 1];
min = a[0];
for (long i = 0; i < m; i++) {
sum = sum + a[... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]] | 1 | 133 |
//============================================================================
// Name : ITP_1_4_D.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include ... | //============================================================================
// Name : ITP_1_4_D.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 110 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int a, c, ma = 0, mi = 1000000, sum = 0;
cin >> a;
for (int b = 0; b < a; b++) {
cin >> c;
ma = max(ma, c);
mi = min(mi, c);
sum += c;
}
cout << mi << " " << ma << " " << sum << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, c, ma = -1000000, mi = 1000000;
long long int sum = 0;
cin >> a;
for (int b = 0; b < a; b++) {
cin >> c;
ma = max(ma, c);
mi = min(mi, c);
sum += c;
}
cout << mi << " " << ma << " " << sum << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 98 |
#include <stdio.h>
int main() {
int min = 2147483647, max = -2147483648, a, n, i = 0;
long long int sum = 0;
scanf("%d", &n);
while (n > i) {
scanf("%d", &a);
if (min > a)
min = a;
if (max < a)
max = a;
sum = sum + a;
i++;
}
printf("%d %d %d\n", min, max, sum);
return 0;
} | #include <stdio.h>
int main(void) {
int min = 2147483647, max = -2147483648, a, n, i = 0;
long long int sum = 0;
scanf("%d", &n);
while (n > i) {
scanf("%d", &a);
if (min > a)
min = a;
if (max < a)
max = a;
sum = sum + a;
i++;
}
printf("%d %d %lld\n", min, max, sum);
return... | [["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 106 |
#include <stdio.h>
int main(void) {
int min, max, n, v, a[10000];
long long int sun = 0;
scanf("%d", &n);
for (v = 0; v < n; v++) {
scanf("%d", &a[v]);
}
max = a[0];
v = 1;
while (1) {
if (v == n)
break;
if (max < a[v]) {
max = a[v];
}
v++;
}
min = a[0];
v = 1;
... | #include <stdio.h>
int main(void) {
int min, max, n, v, a[10000];
long long int sun = 0;
scanf("%d", &n);
for (v = 0; v < n; v++) {
scanf("%d", &a[v]);
}
max = a[0];
v = 1;
while (1) {
if (v == n)
break;
if (max < a[v]) {
max = a[v];
}
v++;
}
min = a[0];
v = 1;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 205 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b[10000], sum = 0;
cin >> a;
for (int i = 0; i < a; i++)
cin >> b[i];
for (int j = 0; j < a; j++)
sum += b[j];
sort(b, b + a);
cout << b[0] << ' ' << b[a - 1] << ' ' << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b[10000];
long long sum = 0;
cin >> a;
for (int i = 0; i < a; i++)
cin >> b[i];
for (int j = 0; j < a; j++)
sum += b[j];
sort(b, b + a);
cout << b[0] << ' ' << b[a - 1] << ' ' << sum << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 110 |
#include <iostream>
using namespace std;
int main(void) {
int n, i, a[10001], max, min, sum;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
sum = a[1];
min = a[1];
max = a[1];
for (i = 2; i <= n; i++) {
sum = sum + a[i];
if (a[i] < min)
min = a[i];
if (a[i] > max)
max ... | #include <iostream>
using namespace std;
int main(void) {
long n, i, a[10001], max, min, sum;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
sum = a[1];
min = a[1];
max = a[1];
for (i = 2; i <= n; i++) {
sum = sum + a[i];
if (a[i] < min)
min = a[i];
if (a[i] > max)
max... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 154 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.