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(void) {
int n, max, min, sum = 0;
cin >> n;
double *a = new double[n];
for (int j = 0; j < n; j++) {
cin >> a[j];
}
min = a[0];
max = a[0];
for (int i = 0; i < n; i++) {
if (min > a[i]) {
min = a[i];
}
if (max < a[i]) {
max... | #include <iostream>
using namespace std;
int main(void) {
int n, max, min;
long sum = 0;
cin >> n;
double *a = new double[n];
for (int j = 0; j < n; j++) {
cin >> a[j];
}
min = a[0];
max = a[0];
for (int i = 0; i < n; i++) {
if (min > a[i]) {
min = a[i];
}
if (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 | 160 |
#include <stdio.h>
#define INF 100000
#define maxi(a, b) ((a > b) ? a : b)
#define mini(a, b) ((a < b) ? a : b)
int main(void) {
int max = -INF, min = INF, a, i, n;
long long int sum = 0LL;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
max = maxi(a, max);
min = mini(a, min);
sum... | #include <stdio.h>
#define INF 1000001
#define maxi(a, b) ((a > b) ? a : b)
#define mini(a, b) ((a < b) ? a : b)
int main(void) {
int max = -INF, min = INF, a, i, n;
long long int sum = 0LL;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
max = maxi(a, max);
min = mini(a, min);
su... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 125 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, a[1000000];
int main() {
int MIN = 1000000, MAX = -1000000, total = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
total += a[i];
MIN = min(MIN, a[i]);
MAX = max(MAX, a[i]);
}
cout << MIN << " " << MAX << " " << t... | #include <algorithm>
#include <iostream>
using namespace std;
long int n, a[10000000];
int main() {
long int MIN = 10000000, MAX = -10000000, total = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
total += a[i];
MIN = min(MIN, a[i]);
MAX = max(MAX, a[i]);
}
cout << MIN << " " << MA... | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 114 |
#include <iostream>
using namespace std;
int main() {
int n, i;
int min = 1000000;
int max = -1000000;
int sum = 0;
cin >> n;
while (cin >> i) {
sum += i;
if (i < min) {
min = i;
}
if (i > max) {
max = i;
}
}
cout << min << " " << max << " " << sum << endl;
return 0... | #include <iostream>
using namespace std;
int main() {
long n, i;
long min = 1000000;
long max = -1000000;
long sum = 0;
cin >> n;
while (cin >> i) {
sum += i;
if (i < min) {
min = i;
}
if (i > max) {
max = i;
}
}
cout << min << " " << max << " " << sum << endl;
retu... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 93 |
#include <iostream>
#include <stdio.h>
int main() {
int a[10000];
int n;
int max = -20000000;
int min = 20000000;
int sum = 0;
std::cin >> n;
int i;
for (i = 0; i < n; i++) {
std::cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
sum += a[i];
}
printf(... | #include <iostream>
#include <stdio.h>
int main() {
int a[10000];
int n;
int max = -20000000;
int min = 20000000;
long long int sum = 0;
std::cin >> n;
int i;
for (i = 0; i < n; i++) {
std::cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
sum += a[i];
}... | [["+", 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 | 123 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, i, a[10001], sum = 0;
cin >> n;
REP(i, n) cin >> a[i];
sort(a, a + n);
REP(i, n) sum += a[i];
cout << a[0] << " " << a[n - 1] << " " << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
long long int n, i, a[10001], sum = 0;
cin >> n;
REP(i, n) cin >> a[i];
sort(a, a + n);
REP(i, n) sum += a[i];
cout << a[0] << " " << a[n - 1] << " " << sum << endl;
} | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 100 |
#include <iostream>
using namespace std;
int main() {
int n, a;
long min = (long)-1e6, max = (long)1e6, sum = 0;
cin >> n;
while (n) {
cin >> a;
if (min > a)
min = a;
if (max < a)
max = a;
sum += a;
--n;
}
cout << min << ' ' << max << ' ' << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a;
long min = (long)1e6, max = (long)-1e6, sum = 0;
cin >> n;
while (n) {
cin >> a;
if (min > a)
min = a;
if (max < a)
max = a;
sum += a;
--n;
}
cout << min << ' ' << max << ' ' << sum << endl;
return 0;
} | [["-", 8, 9, 0, 43, 49, 50, 51, 74, 51, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 74, 51, 13]] | 1 | 98 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 1000000, max = -1000000, sum = 0, x;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
min = min >= x ? x : min;
max = max <= x ? x : max;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 1000000, max = -1000000, x;
long int sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
min = min >= x ? x : min;
max = max <= x ? x : max;
}
cout << min << " " << max << " " << sum << endl;
return ... | [["+", 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, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 99 |
#include <iostream>
using namespace std;
int main() {
int a, min, max, d = 0;
cin >> a;
int b[10000];
cin >> b[0];
min = b[0];
max = b[0];
d = b[0];
for (int i = 1; i < a; i++) {
cin >> b[i];
if (min > b[i])
min = b[i];
if (max < b[i])
max = b[i];
d = d + b[i];
}
cout << ... | #include <iostream>
using namespace std;
int main() {
long a, min, max, d = 0;
cin >> a;
int b[10000];
cin >> b[0];
min = b[0];
max = b[0];
d = b[0];
for (int i = 1; i < a; i++) {
cin >> b[i];
if (min > b[i])
min = b[i];
if (max < b[i])
max = b[i];
d = d + b[i];
}
cout <<... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 143 |
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n = 0, i = 0, tmp = 0;
int max = -9000000;
int min = 9000000;
int sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> tmp;
sum += tmp;
if (max < tmp) {
max = tmp;
}
if (min > tmp) {
min = tmp;
... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n = 0, i = 0;
long int tmp = 0;
long int max = -9000000;
long int min = 9000000;
long int sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> tmp;
sum += tmp;
if (max < tmp) {
max = tmp;
}
if (min > t... | [["-", 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 | 114 |
#include <iostream>
using namespace std;
int main(int argc, char **argv) {
int *a;
int n;
// data in
cin >> n;
a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
// find min/max/sum
int min = 1000001;
int max = -1000001;
int sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < ... | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int *a;
int n;
// data in
cin >> n;
a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
// find min/max/sum
int min = 1000001;
int max = -1000001;
long sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] <... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 156 |
#include <iostream>
using namespace std;
int main() {
int i, a, n, min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (i = 1; 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() {
long int i, a, n, min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum = sum + a;
}
cout << min << " " << max << " " << sum << en... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int i, j;
vector<int> a;
int max, min, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
sum += j;
a.push_back(j);
}
max = a.at(max_element(a.begin(), a.end()) - a.begin());
min =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
int i, j;
vector<int> a;
int max, min;
long long sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
sum += j;
a.push_back(j);
}
max = a.at(max_element(a.begin(), a.end()) - a.begin... | [["-", 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 | 151 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long mini = 1e+20, maxi = 0, sum = 0;
for (int i = 0; i < n; i++) {
long long t;
cin >> t;
mini = min(mini, t);
maxi = max(maxi, t);
sum += t;
}
cout << mini << " " << max... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long mini = 1e+20, maxi = -1e+20, sum = 0;
for (int i = 0; i < n; i++) {
long long t;
cin >> t;
mini = min(mini, t);
maxi = max(maxi, t);
sum += t;
}
cout << mini << " " <... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 102 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int minimum = a[0];
for (int i = 0; i < n; i++) {
if (minimum > a[i])
minimum = a[i];
}
int max = a[0];
for (int i = 0; i < n; i++) {
if (max < a[i])
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int minimum = a[0];
for (int i = 0; i < n; i++) {
if (minimum > a[i])
minimum = a[i];
}
int max = a[0];
for (int i = 0; i < n; i++) {
if (max < a[i])
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 174 |
#include <iostream>
using namespace std;
int main() {
int n;
int a;
int sum = 0, min = 1000000, max = -1000000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
max = max < a ? a : max;
min = min > a ? a : min;
}
cout << min << " " << max << " " << sum << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
int a;
long int sum = 0, min = 1000000, max = -1000000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
max = max < a ? a : max;
min = min > a ? a : min;
}
cout << min << " " << max << " " << sum << endl;
return 0;... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 100 |
#include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
int main(void) {
int n;
cin >> n;
int max = -1e+6 - 1, min = 1e+6 + 1, total = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a > max) {
max = a;
}
if (a < min) {
min = a;
}
total += ... | #include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
int main(void) {
int n;
cin >> n;
int max = -1e+6 - 1, min = 1e+6 + 1;
long long total = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a > max) {
max = a;
}
if (a < min) {
min = 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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 109 |
#include <iostream>
//#include <iomanip>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int j = 0;
int min = a[j];
int max = a[j];
int sum = a[j];
j++;
for (; j < n; j++) {
if (min > a[j]) {
min = a[j];
}
if (max... | #include <iostream>
//#include <iomanip>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int j = 0;
int min = a[j];
int max = a[j];
long sum = a[j];
j++;
for (; j < n; j++) {
if (min > a[j]) {
min = a[j];
}
if (ma... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 159 |
#include <iostream>
using namespace std;
int main() {
int x, min, max, sum, N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x;
if (i == 0)
max = min = sum = x;
else {
if (x < min)
min = x;
if (x > max)
max = x;
sum += x;
}
}
cout << min << " " << max <... | #include <iostream>
using namespace std;
int main() {
long long int x, min, max, sum, N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x;
if (i == 0)
max = min = sum = x;
else {
if (x < min)
min = x;
if (x > max)
max = x;
sum += x;
}
}
cout << min << " ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 106 |
#include <iostream>
using namespace std;
int main() {
int n;
int min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int in;
cin >> in;
if (in < min)
min = in;
if (in > max)
max = in;
sum += in;
}
cout << min << " " << max << " " << sum << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
int min = 1000000, max = -1000000;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int in;
cin >> in;
if (in < min)
min = in;
if (in > max)
max = in;
sum += in;
}
cout << min << " " << max << " " << sum << ... | [["-", 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 <algorithm>
#include <cstdio>
#include <valarray>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int n;
valarray<long long int> a;
int main() {
scanf("%d", &n);
a.resize(n);
rep(i, n) { scanf("%lld", &a[i]); }
printf("%lld %lld %lld?\n", a.min(), a.max(), a.sum());
return 0;... | #include <algorithm>
#include <cstdio>
#include <valarray>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int n;
valarray<long long> a;
int main() {
scanf("%d", &n);
a.resize(n);
rep(i, n) { scanf("%lld", &a[i]); }
printf("%lld %lld %lld\n", a.min(), a.max(), a.sum());
return 0;
} | [["-", 39, 344, 3, 347, 0, 77, 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 | 102 |
#include <iostream>
using namespace std;
int main() {
int n, input, max = 0, min = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> input;
if (i == 0) {
max = input;
min = input;
}
// sum //
sum += input;
// max //
if (max < input)
max = input;
// min ... | #include <iostream>
using namespace std;
int main() {
int n, input, max = 0, min = 0;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> input;
if (i == 0) {
max = input;
min = input;
}
// sum //
sum += input;
// max //
if (max < input)
max = input;
... | [["-", 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 | 114 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, min = 9999999, max = -9999999, sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int t;
cin >> t;
if (min > t) {
min = t;
}
if (max < t) {
max = t... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, min = 9999999, max = -9999999;
long sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int t;
cin >> t;
if (min > t) {
min = t;
}
if (max < t) {
... | [["-", 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 | 111 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, i;
int min = 1000000;
int max = -1000000;
int sum = 0;
cin >> n;
while (n > 0) {
cin >> i;
if (i < min)
min = i;
if (i > max)
max = i;
sum += i;
n--;
}
printf("%d %d %d\n", min, max, sum);
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, i;
int min = 1000000;
int max = -1000000;
long sum = 0;
cin >> n;
while (n > 0) {
cin >> i;
if (i < min)
min = i;
if (i > max)
max = i;
sum += i;
n--;
}
printf("%d %d %ld\n", min, max, sum);
... | [["-", 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 | 94 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main() {
int n;
while (cin >> n) {
int mi = 10000000, ma = -10000000, sum = 0;
int inp;
rep(i, n) {
cin >> inp;
... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main() {
int n;
while (cin >> n) {
int mi = 10000000, ma = -100000000;
long long sum = 0;
int inp;
rep(i, n) {
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 132 |
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n, a[10001];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
if (a[j] > a[j - 1]) {
int t = a[j];
... | #include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
long long n, a[10001];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
if (a[j] > a[j - 1]) {
int t = a[j];
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 187 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a[10001], b, s, h;
cin >> n >> a[0];
b = a[0], s = a[0], h = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
if (a[i] > b)
b = a[i];
if (a[i] < s)
s = a[i];
h += a[i];
}
cout << s << " " << b << " " <... | #include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a[10001], b, s, h;
cin >> n >> a[0];
b = a[0], s = a[0], h = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
if (a[i] > b)
b = a[i];
if (a[i] < s)
s = a[i];
h += a[i];
}
cout << s << " " << b <<... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 141 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int min, max, sum;
min = 1000000;
max = -1000000;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
sum = sum + a[i];
}
... | #include <iostream>
using namespace std;
int main() {
long int n;
cin >> n;
int *a = new int[n];
long int min, max, sum;
min = 1000000;
max = -1000000;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
sum = sum + ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 132 |
#include <bits/stdc++.h>
using namespace std;
// template {{{
/* vim: set foldmethod=marker: */
// constant
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double PI = acos(-1);
#define EPS 1e-14
// typedef
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll>... | #include <bits/stdc++.h>
using namespace std;
// template {{{
/* vim: set foldmethod=marker: */
// constant
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double PI = acos(-1);
#define EPS 1e-14
// typedef
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll>... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13]] | 1 | 424 |
#include <iostream>
using namespace std;
int main() {
int n;
int a;
int min, max;
int sum = 0;
cin >> n;
cin >> a;
min = a;
max = a;
sum += a;
for (int i = 0; i < n - 1; i++) {
cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
c... | #include <iostream>
using namespace std;
int main() {
int n;
int a;
int min, max;
long int sum = 0;
cin >> n;
cin >> a;
min = a;
max = a;
sum += a;
for (int i = 0; i < n - 1; i++) {
cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 119 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, min = 1000001, max = 0;
long sum = 0;
cin >> n;
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;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, min = 1000001, max = -1000000;
long sum = 0;
cin >> n;
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 << ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 101 |
#include <iostream>
using namespace std;
int main() {
int n, max, min, sum, x;
cin >> n;
cin >> x;
max = min = sum = x;
for (int i = 0; i < n - 1; i++) {
cin >> x;
if (x > max)
max = x;
if (x < min)
min = x;
sum += x;
}
cout << min << " " << max << " " << sum << endl;
ret... | #include <iostream>
using namespace std;
int main() {
int n, max, min, x;
long long sum;
cin >> n;
cin >> x;
max = min = sum = x;
for (int i = 0; i < n - 1; i++) {
cin >> x;
if (x > max)
max = x;
if (x < min)
min = x;
sum += x;
}
cout << min << " " << max << " " << sum <<... | [["-", 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 | 106 |
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; ++i)
cin >> skipws >> a[i];
int min = 1000001;
int max = -1000001;
uint64_t sum = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < min)
mi... | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; ++i)
cin >> skipws >> a[i];
int min = 1000000;
int max = -1000000;
int64_t sum = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < min)
min... | [["-", 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, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 148 |
#include <stdio.h>
int main() {
int a, n, b, m, M, t;
scanf("%d", &n);
t = 0;
m = 10000000;
M = -10000000;
for (a = 1; a <= n; a++) {
scanf("%d", &b);
t = t + b;
if (m > b) {
m = b;
}
if (M < b) {
M = b;
}
}
printf("%d %d %d\n", m, M, t);
return 0;
} | #include <stdio.h>
int main() {
int a, n, b, m, M;
long long t;
scanf("%d", &n);
t = 0;
m = 10000000;
M = -10000000;
for (a = 1; a <= n; a++) {
scanf("%d", &b);
t = t + b;
if (m > b) {
m = b;
}
if (M < b) {
M = b;
}
}
printf("%d %d %lld\n", m, M, t);
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, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 115 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *array = new int[n];
for (int i = 0; i < n; i++) {
cin >> array[i];
}
int min = array[0], max = array[0], sum = 0;
for (int i = 0; i < n; i++) {
if (array[i] < min)
min = array[i];
if (array[i] > max)
max... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *array = new int[n];
for (int i = 0; i < n; i++) {
cin >> array[i];
}
int min = array[0], max = array[0];
long sum = 0;
for (int i = 0; i < n; i++) {
if (array[i] < min)
min = array[i];
if (array[i] > max)
... | [["-", 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 | 144 |
#include <iostream>
using namespace std;
int main() {
int n, goukei = 0, saidai = 0, saisyou = 0, flag = 1;
cin >> n;
int a[10000];
while (n > 0) {
cin >> a[n];
if (flag == 1) {
saisyou = a[n];
saidai = a[n];
}
goukei += a[n];
if (saidai < a[n]) {
saidai = a[n];
}
... | #include <iostream>
using namespace std;
int main() {
long long n, goukei = 0, saidai = 0, saisyou = 0, flag = 1;
cin >> n;
long long a[10000];
while (n > 0) {
cin >> a[n];
if (flag == 1) {
saisyou = a[n];
saidai = a[n];
}
goukei += a[n];
if (saidai < a[n]) {
saidai = a[... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 149 |
#include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int i = 0;
int kazu = 0, iti = 0;
int a = 0, b = 0, max = 0, min = 0;
cin >> kazu;
if (kazu == 1) {
cin >> iti;
max = iti;
min = iti;
b = iti;
} else {
cin >> iti;
max = iti;
min = iti;
... | #include <iomanip>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long i = 0;
long kazu = 0, iti = 0;
long a = 0, b = 0, max = 0, min = 0;
cin >> kazu;
if (kazu == 1) {
cin >> iti;
max = iti;
min = iti;
b = iti;
} else {
cin >> iti;
max = iti;
min = iti;... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 157 |
#include <iostream>
int main() {
int n;
std::cin >> n;
int min, max, temp;
double sum;
std::cin >> temp;
min = temp;
max = temp;
sum = temp;
for (int i = 0; i < n - 1; i++) {
std::cin >> temp;
sum += temp;
if (temp > max) {
max = temp;
}
if (temp < min) {
min = tem... | #include <iostream>
int main() {
int n;
std::cin >> n;
int min, max, temp;
long sum;
std::cin >> temp;
min = temp;
max = temp;
sum = temp;
for (int i = 0; i < n - 1; i++) {
std::cin >> temp;
sum += temp;
if (temp > max) {
max = temp;
}
if (temp < min) {
min = temp;... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 119 |
#include <climits>
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int min_v = INT_MAX, max_v = INT_MIN, sum_v = 0;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
min_v = min(min_v, v);
max_v = max(max_v, v);
sum_v += v;
}
cout << min_v << '... | #include <climits>
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int min_v = INT_MAX, max_v = INT_MIN;
long long sum_v = 0;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
min_v = min(min_v, v);
max_v = max(max_v, v);
sum_v += v;
}
cout <... | [["-", 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 | 108 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(),v).end()
#define PB(a) push_back(a)
#define MO... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(),v).end()
#define PB(a) push_back(a)
#define MO... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 78]] | 1 | 231 |
#include <iostream>
using namespace std;
int main(void) {
int n, a;
int min = 2000000;
int max = -2000000;
int 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 << " ... | #include <iostream>
using namespace std;
int main(void) {
int n, a;
int min = 2000000;
int max = -2000000;
long long int 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 << " " <<... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 106 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void Q1() {
double r;
double PI = 3.141592653589;
cin >> r;
printf("%lf %lf\n", PI * r * r, 2 * r * PI);
}
void Q2() {
int a, b;
string op;
while (true) {
cin >> a >> op >> b;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void Q1() {
double r;
double PI = 3.141592653589;
cin >> r;
printf("%lf %lf\n", PI * r * r, 2 * r * PI);
}
void Q2() {
int a, b;
string op;
while (true) {
cin >> a >> op >> b;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 380 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a, M, m, s = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0)
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a, M, m;
long long s = 0;
for (int i = 0; i < n; i++) {
cin >> 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 | 125 |
#include <cstdio>
int main() {
int n, temp, min = 1000000, max = -1000000;
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &temp);
if (min > temp)
min = temp;
if (max < temp)
max = temp;
sum += temp;
}
printf("%d %d %d\n", min, max, sum);
} | #include <cstdio>
int main() {
int n, temp, min = 1000000, max = -1000000;
long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &temp);
if (min > temp)
min = temp;
if (max < temp)
max = temp;
sum += temp;
}
printf("%d %d %ld\n", min, max, sum);
} | [["-", 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 | 101 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int i, a;
int min = 0, max = 0, sum = 0;
cin >> a;
min = a, max = a, sum = a;
for (i = 1; i < n; i++) {
cin >> a;
if (min > a)
min = a;
if (max < a)
max = a;
sum = sum + a;
}
cout << min << " " << max... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int i, a;
int min = 0, max = 0;
long sum = 0;
cin >> a;
min = a, max = a, sum = a;
for (i = 1; i < n; i++) {
cin >> a;
if (min > a)
min = a;
if (max < a)
max = a;
sum = sum + a;
}
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 | 119 |
#include <iostream>
using namespace std;
int main() {
int A[10000];
int i;
int n;
cin >> n;
int min, max, sum;
min = 1000001;
max = -1000001;
sum = 0;
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];
... | #include <iostream>
using namespace std;
int main() {
int A[10000];
int i;
int n;
cin >> n;
int min, max;
long long sum;
min = 1000001;
max = -1000001;
sum = 0;
for (i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
if (max < A[i]) {
max = A[i];
}
if (min > A[i]) {
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 | 133 |
#include <iostream>
using namespace std;
int main(void) {
int Num, Value, Min, Max, Sum;
std::cin >> Num;
Sum = 0;
for (int i = 0; i < Num; i++) {
std::cin >> Value;
if (i == 0) {
Min = Value;
Max = Value;
} else {
if (Value < Min)
Min = Value;
if (Value > Max)
... | #include <iostream>
using namespace std;
int main(void) {
long Num, Value, Min, Max, Sum;
std::cin >> Num;
Sum = 0;
for (long i = 0; i < Num; i++) {
std::cin >> Value;
if (i == 0) {
Min = Value;
Max = Value;
} else {
if (Value < Min)
Min = Value;
if (Value > Max)
... | [["-", 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 | 121 |
#include <stdio.h>
int main() {
long long int sum;
int a, n, i, min, max;
scanf("%d", &n);
scanf("%d", &a);
min = max = sum = a;
for (i = 1; i < n; i++) {
scanf("%d", &a);
sum += a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
}
printf("%d %d %||d\n", min, max,... | #include <stdio.h>
int main() {
long long int sum;
int a, n, i, min, max;
scanf("%d", &n);
scanf("%d", &a);
min = max = sum = a;
for (i = 1; i < n; i++) {
scanf("%d", &a);
sum += a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
}
printf("%d %d %ld\n", min, max, ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 124 |
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, min = INT_MAX, max = INT_MIN, sum = 0;
cin >> n;
while (n) {
n--;
int x;
cin >> x;
min = (min > x) ? x : min;
max = (max < x) ? x : max;
sum += x;
}
cout << min << " " << max << " " << sum << endl;
retu... | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n, min = INT_MAX, max = INT_MIN;
long long sum = 0;
cin >> n;
while (n) {
n--;
int x;
cin >> x;
min = (min > x) ? x : min;
max = (max < x) ? x : max;
sum += x;
}
cout << min << " " << max << " " << sum << ... | [["-", 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 | 98 |
#include <iostream>
using namespace std;
int main(int argc, char **argv) {
int min = 0, max = 0, sum = 0;
int temp;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
if (i == 0) {
min = temp;
max = temp;
}
sum += temp;
if (temp < min) {
min = temp;
}
i... | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
long int min = 0, max = 0, sum = 0;
int temp;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
if (i == 0) {
min = temp;
max = temp;
}
sum += temp;
if (temp < min) {
min = temp;
}
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 127 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int sum = 0;
cin >> n;
int *a = new int[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() {
int n;
long int sum = 0;
cin >> n;
int *a = new int[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, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 104 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> vc;
int sum = 0;
int n, min, max, temp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
vc.push_back(temp);
sum += temp;
}
sort(vc.begin... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> vc;
long int sum = 0;
int n, min, max, temp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
vc.push_back(temp);
sum += temp;
}
sort(v... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 135 |
#include <iostream>
using namespace std;
int main() {
int n, min, max, sum;
int a[10000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
max = a[0];
sum = a[0];
for (int j = 1; j < n; j++) {
if (min > a[j]) {
min = a[j];
} else if (max < a[j]) {
max = a[j... | #include <iostream>
using namespace std;
int main() {
int n, min, max;
long sum;
int a[10000]; //?????????????????????
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
max = a[0];
sum = a[0];
for (int j = 1; j < n; j++) {
if (min > a[j]) {
min = a[j];
} else 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]] | 1 | 158 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N, i;
cin >> N;
long long int array[N];
for (i = 0; i < N; i++)
cin >> array[i];
sort(array, array + N);
int sum;
sum = 0;
for (i = 0; i < N; i++)
sum += array[i];
int max, min;
min = array[0];
max =... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N, i;
cin >> N;
long long int array[N];
for (i = 0; i < N; i++)
cin >> array[i];
sort(array, array + N);
long long int sum;
sum = 0;
for (i = 0; i < N; i++)
sum += array[i];
int max, min;
min = array[0... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 130 |
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
int main() {
#ifdef CIN
ifstream cin("input.txt");
ofstream cout("output.txt");
#endif
int n;
int max, min, sum;
cin >> n;
int a[10000];
max = -1000000;
min = 1000000;
sum = 0;
for (int i = 0; i < n; i++) {
cin ... | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int main() {
#ifdef CIN
ifstream cin("input.txt");
ofstream cout("output.txt");
#endif
int n;
int max, min;
long long sum;
cin >> n;
int a[10000];
max = -1000000;
min = 1000000;
sum = 0;
for (int i = 0; i < n; 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 | 147 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int i;
int max = -1000000;
int min = 1000000;
int sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
if (a[i] < min) {
min = a[i... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long int a[n];
long int i;
long int max = -1000000;
long int min = 1000000;
long int sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
if (a[i]... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 143 |
#include <cstdio>
#include <iostream>
long long int sum = 0;
using namespace std;
int main() {
int n, a;
int min = 1000001, max = -10000001, i;
cin >> n;
if (n == 0)
cout << 0 << ' ' << 0 << ' ' << 0 << endl;
else {
for (i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
if... | #include <cstdio>
#include <iostream>
long long int sum = 0;
using namespace std;
int main() {
int n, a;
int min = 1000001, max = -10000001, i;
cin >> n;
if (n == 0)
cout << 0 << ' ' << 0 << ' ' << 0 << endl;
else {
for (i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
if... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 135 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int minum = 1000001, maxnum = -1000001, sum = 0;
int time;
cin >> time;
for (int i = 0; i < time; ++i) {
int input;
cin >> input;
minum = min(minum, input);
maxnum = max(maxnum, input);
sum += input;
}
cout << min... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int minum = 1000001, maxnum = -1000001;
long long sum = 0;
int time;
cin >> time;
for (int i = 0; i < time; ++i) {
int input;
cin >> input;
minum = min(minum, input);
maxnum = max(maxnum, input);
sum += input;
}
... | [["-", 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 | 100 |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a;
int sum = 0;
int m = 1000000, M = -1000000;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
M = max(M, a);
m = min(m, a);
sum += a;
}
printf("%d %d %ld\n", m, M, sum);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a;
long sum = 0;
int m = 1000000, M = -1000000;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
M = max(M, a);
m = min(m, a);
sum += a;
}
printf("%d %d %ld\n", m, M, sum);
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 109 |
#include <iostream>
#include <queue>
#include <stack>
#include <stddef.h>
#include <string>
using namespace std;
int main() {
int n;
int a[10001];
int min, max;
long long sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
sum = a[0];
max = 2000000;
for (int i = 1; i < n;... | #include <iostream>
#include <queue>
#include <stack>
#include <stddef.h>
#include <string>
using namespace std;
int main() {
int n;
int a[10001];
int min, max;
long long sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
sum = a[0];
max = a[0];
for (int i = 1; i < n; i+... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 73]] | 1 | 156 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, i, min = 1000001, max = -1000001, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
else if (a > max)
max = a;
sum += a;
}
cout << min << ' ' << max << ' ' << sum << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, i, min = 1000001, max = -1000001;
long int sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
cout << min << ' ' << max << ' ' << sum << e... | [["-", 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, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 99 |
#include <stdio.h>
int main() {
int i, n, max, min, sum = 0;
scanf("%d", &n);
int a[n];
for (i = 1; i <= n; i++) {
scanf("%ld", &a[i]);
sum += a[i];
}
max = a[1];
for (i = 1; i <= n; i++) {
if (max < a[i])
max = a[i];
}
min = a[1];
for (i = 1; i <= n; i++) {
if (min > a[i])
... | #include <stdio.h>
int main() {
int i, n;
long max, min, sum = 0;
scanf("%d", &n);
int a[n];
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
max = a[1];
for (i = 1; i <= n; i++) {
if (max < a[i])
max = a[i];
}
min = a[1];
for (i = 1; i <= n; i++) {
if (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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 165 |
#include <iostream>
using namespace std;
int main() {
int n;
int an;
cin >> n;
int max, min, sum;
max = -1000000;
min = 1000000;
sum = 0;
for (int x = 0; x < n; x++) {
cin >> an;
if (an > max) {
max = an;
}
if (an < min) {
min = an;
}
sum += an;
}
cout << min ... | #include <iostream>
using namespace std;
int main() {
int n;
int an;
cin >> n;
long long max, min, sum;
max = -1000000;
min = 1000000;
sum = 0;
for (int x = 0; x < n; x++) {
cin >> an;
if (an > max) {
max = an;
}
if (an < min) {
min = an;
}
sum += an;
}
cout <... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 110 |
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a; //??\????????????
int i;
int M = -1000000;
int m = 1000000;
int S = 0; //?????????
for (i = 0; i < n; i++) {
cin >> a;
if (M < a)
M = a; //?????§???????±???????
if (m > a)
m = a; //????°???... | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a; //??\????????????
int M = -1000000;
int m = 1000000;
long long int S = 0; //?????????
for (int i = 0; i < n; i++) {
cin >> a;
if (M < a)
M = a; //?????§???????±???????
if (m > a)
m = a; //???... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 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]] | 1 | 112 |
#include <iostream>
using namespace std;
int n, a;
int mi = 1000001;
int ma = -1000001;
int s = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (mi > a) {
mi = a;
}
if (ma < a) {
ma = a;
}
s += a;
}
cout << mi << " " << ma << " " << s << endl;
} | #include <iostream>
using namespace std;
int n, a;
int mi = 1000001;
int ma = -1000001;
long long s = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (mi > a) {
mi = a;
}
if (ma < a) {
ma = a;
}
s += a;
}
cout << mi << " " << ma << " " << s << endl;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
#include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 91, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 91, 28, 22]] | 1 | 322 |
#include <iostream>
using namespace std;
int main() {
int n;
int a;
int min = 1000000;
int max = -1000000;
int sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
sum = sum + a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
cout << min << " " << max ... | #include <iostream>
using namespace std;
int main() {
int n;
int a;
int min = 1000000;
int max = -1000000;
long long sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
sum = sum + a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
cout << min << " " <... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <iostream>
using namespace std;
int main() {
int n;
int input = 0;
int ansmin = 0;
int ansmax = 0;
int anssum = 0;
// ??´??°????????°n??\???
cin >> n;
// n?????\?????°?????????
for (int cnt = 0; cnt < n; cnt++) {
// ??\???
cin >> input;
// ??\????????????????°????????????§??... | #include <iostream>
using namespace std;
int main() {
int n;
int input = 0;
int ansmin = 0;
int ansmax = 0;
long long anssum = 0;
// ??´??°????????°n??\???
cin >> n;
// n?????\?????°?????????
for (int cnt = 0; cnt < n; cnt++) {
// ??\???
cin >> input;
// ??\????????????????°?????????... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 133 |
#include <iostream>
int main() {
int n;
int max;
int min;
int sum;
std::cin >> n;
for (int i = 0; i < n; i++) {
if (i == 0) {
int first;
std::cin >> first;
max = first;
min = first;
sum = first;
} else {
int current;
std::cin >> current;
if (max < ... | #include <iostream>
int main() {
int n;
int max;
int min;
long sum;
std::cin >> n;
for (int i = 0; i < n; i++) {
if (i == 0) {
int first;
std::cin >> first;
max = first;
min = first;
sum = first;
} else {
int current;
std::cin >> current;
if (max <... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 136 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, t, mx = -10e6 - 8, mn = 10e6 + 8, sum = 0;
// your code goes here
cin >> t;
while (t--) {
cin >> x;
mx = max(mx, x);
mn = min(mn, x);
sum += x;
}
cout << mn << " " << mx << " " << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, t, mx = -10e6 - 8, mn = 10e6 + 8, sum = 0;
// your code goes here
cin >> t;
while (t--) {
cin >> x;
mx = max(mx, x);
mn = min(mn, x);
sum += x;
}
cout << mn << " " << mx << " " << 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 | 92 |
#include <iostream>
using namespace std;
int main(void) {
int i, min, max, sum, a[10000], n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
max = a[0];
sum = a[0];
for (i = 1; i < n; i++) {
if (a[i] < min)
min = a[i];
}
for (i = 1; i < n; i++) {
if (a[i] > max)
... | #include <iostream>
using namespace std;
int main(void) {
int i, min, max, a[10000], n;
long sum;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
max = a[0];
sum = a[0];
for (i = 1; i < n; i++) {
if (a[i] < min)
min = a[i];
}
for (i = 1; i < n; i++) {
if (a[i] ... | [["-", 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 | 183 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[10000];
double sum = 0;
cin >> 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() {
int n, a[10000];
long sum = 0;
cin >> 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, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 99 |
#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;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, max = -1000000, min = 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;
return ... | [["-", 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 | 98 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, n;
long num, max = 0, min = 1000000, sum = 0;
cin >> n;
// vector<long> data(n);
// for(i=0;i<n;i++){
// cin>> data[i];
// }
// max=min=data[0];
// for(i=0;i<n;i++){
// if(max<data[i]) max= data[i];
// if(mi... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, n;
long num, max = -1000000, min = 1000000, sum = 0;
cin >> n;
// vector<long> data(n);
// for(i=0;i<n;i++){
// cin>> data[i];
// }
// max=min=data[0];
// for(i=0;i<n;i++){
// if(max<data[i]) max= data[i];
// ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 112 |
#include <stdio.h>
int main(void) {
int An, i, max, min, n;
long long amount;
max = -1000000;
min = 1000000;
amount = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &An);
if (max < An) {
max = An;
}
if (min > An) {
min = An;
}
amount += An;
}
printf("%d %... | #include <stdio.h>
int main(void) {
int An, i, max, min, n;
long amount;
max = -1000000;
min = 1000000;
amount = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &An);
if (max < An) {
max = An;
}
if (min > An) {
min = An;
}
amount += An;
}
printf("%d %d %ld... | [["-", 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 | 116 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
a.push_back(t);
}
sort(a.begin()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
a.push_back(t);
}
sort(a.begin()... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 191 |
#include <iostream>
using namespace std;
int main() {
int n, a;
int max = -1000000;
int min = 1000000;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (max < a)
max = a;
if (min > a)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl... | #include <iostream>
using namespace std;
int main() {
int n, a;
int max = -1000000;
int min = 1000000;
long int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (max < a)
max = a;
if (min > a)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum <<... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 101 |
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int c[10000];
for (int i = 0; i < n; ++i) {
scanf("%d", &c[i]);
}
int min = c[0];
int max = c[0];
for (int i = 1; i < n; ++i) {
if (min > c[i])
min = c[i];
if (max < c[i])
max = c[i];
}
long long int... | #include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int c[10000];
for (int i = 0; i < n; ++i) {
scanf("%d", &c[i]);
}
int min = c[0];
int max = c[0];
for (int i = 1; i < n; ++i) {
if (min > c[i])
min = c[i];
if (max < c[i])
max = c[i];
}
long long int... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 171 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, amin = 1000001, amax = -1000001;
unsigned long sum = 0;
cin >> n;
while (n--) {
cin >> a;
amin = min(amin, a);
amax = max(amax, a);
sum += a;
}
cout << amin << " " << amax << " " << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, amin = 1000001, amax = -1000001;
long sum = 0;
cin >> n;
while (n--) {
cin >> a;
amin = min(amin, a);
amax = max(amax, a);
sum += a;
}
cout << amin << " " << amax << " " << sum << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87]] | 1 | 89 |
#include <iostream>
using namespace std;
int main() {
int n, max = -1000000, min = 1000000, sum = 0, i;
long a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, max = -1000000, min = 1000000, i;
long sum = 0;
long a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
retur... | [["+", 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 | 100 |
#include <stdio.h>
int main(void) {
int i, n;
int number;
int sum = 0;
int min = 0;
int max = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &number);
if (i == 0) {
min = number;
max = number;
}
if (number < min)
min = number;
if (number > max)
max... | #include <stdio.h>
int main(void) {
int i, n;
int number;
long long int sum = 0;
int min = 0;
int max = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%d", &number);
if (i == 0)
{
min = number;
max = number;
}
if (number < min)
min = number;
... | [["+", 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 <iostream>
using namespace std;
int main(void) {
int n, i, j, cnt = 0, tmp;
int a[10000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
cnt += a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) {
if (a[j] > a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];... | #include <iostream>
using namespace std;
int main(void) {
long n, i, j, cnt = 0, tmp;
int a[10000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
cnt += a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) {
if (a[j] > a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1]... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 172 |
#include <iostream>
using namespace std;
int main() {
int n, i, A[10000], minv, maxv, sum;
minv = 1000001;
maxv = -1000001;
sum = 0;
i = 0;
cin >> n;
for (i; i < n; i++)
cin >> A[i];
for (int j = 0; j < i; j++) {
sum = sum + A[j];
maxv = max(maxv, A[j]);
minv = min(minv, A[j]);
}
cou... | #include <iostream>
using namespace std;
int main() {
int n, i, A[10000], minv, maxv;
long int sum;
minv = 1000001;
maxv = -1000001;
sum = 0;
i = 0;
cin >> n;
for (i; i < n; i++)
cin >> A[i];
for (int j = 0; j < i; j++) {
sum = sum + A[j];
maxv = max(maxv, A[j]);
minv = min(minv, A[j])... | [["-", 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 | 133 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m, M;
int S = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < m || i == 0)
m = a;
if (a > M || i == 0)
M = a;
S += a;
}
cout << m << ' ' << M << ' ' << S << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m, M;
long int S = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < m || i == 0)
m = a;
if (a > M || i == 0)
M = a;
S += a;
}
cout << m << ' ' << M << ' ' << S << endl;
return 0;
} | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <iostream>
using namespace std;
int main() {
int i = 0, n, a;
long min = 100000, max = -100000, total = 0;
cin >> n;
while (i < n) {
cin >> a;
if (min > a)
min = a;
if (max < a)
max = a;
total += a;
i++;
}
cout << min << " " << max << " " << total << endl;
retu... | #include <iostream>
using namespace std;
int main() {
int i = 0, n, a;
long min = 1000000, max = -1000000, total = 0;
cin >> n;
while (i < n) {
cin >> a;
if (min > a)
min = a;
if (max < a)
max = a;
total += a;
i++;
}
cout << min << " " << max << " " << total << endl;
r... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 98 |
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
int i;
int min;
int max;
int sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum = sum + a[i];
}
max = a[0];
min = a[0];
for (i = 0; i < n; i++) {
if (a[i] ... | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
int i;
int min;
int max;
long long sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum = sum + a[i];
}
max = a[0];
min = a[0];
for (i = 0; i < n; i++) {
if ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 155 |
#include <iostream>
using namespace std;
int main() {
int length;
cin >> length;
int sum = 0, max, min;
for (int i = 0; i < length; i++) {
int num;
cin >> num;
sum += num;
if (i == 0) {
max = num;
min = num;
} else {
if (num > max) {
max = num;
}
if... | #include <iostream>
using namespace std;
int main() {
int length;
cin >> length;
long sum = 0;
int max, min;
for (int i = 0; i < length; i++) {
int num;
cin >> num;
sum += num;
if (i == 0) {
max = num;
min = num;
} else {
if (num > max) {
max = num;
}
... | [["-", 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, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 119 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
int min, max;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum = sum + a[i];
}
min = a[0];
max = a[0];
for (int i = 0; i < n; i++) {
if (min > a[i])
min = a[i];
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
long min, max;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum = sum + a[i];
}
min = a[0];
max = a[0];
for (int i = 0; i < n; i++) {
if (min > a[i])
min = a[i];
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 151 |
#include <iostream>
using namespace std;
int main() {
int n;
int Min;
int Max;
int Sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0) {
Min = Max = a;
} else {
if (Min > a)
Min = a;
if (Max < a)
Max = a;
}
Sum += a;
}... | #include <iostream>
using namespace std;
int main() {
int n;
int Min;
int Max;
long long Sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0) {
Min = Max = a;
} else {
if (Min > a)
Min = a;
if (Max < a)
Max = a;
}
Sum += ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 115 |
#include <cstdio>
#include <iostream>
int main() {
int n, i, a, min, max, sum = 0;
std::cin >> n;
for (i = 0; i < n; i++) {
std::cin >> a;
if (i == 0) {
min = a;
max = a;
}
if (min > a)
min = a;
if (max < a)
max = a;
sum = sum + a;
}
std::cout << min << " " << m... | #include <cstdio>
#include <iostream>
int main() {
int n, i, a, min, max;
long long sum = 0;
std::cin >> n;
for (i = 0; i < n; i++) {
std::cin >> a;
if (i == 0) {
min = a;
max = a;
}
if (min > a)
min = a;
if (max < a)
max = a;
sum = sum + a;
}
std::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 | 119 |
#include <iostream>
using namespace std;
int main() {
int n, a[10000], min, max, sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
max = a[0];
sum = a[0];
for (int b = 1; b < n; b++) {
if (min > a[b]) {
min = a[b];
}
}
for (int c = 1; c < n; c++) {
if (ma... | #include <iostream>
using namespace std;
int main() {
int n, a[10000], min, max;
long sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
max = a[0];
sum = a[0];
for (int b = 1; b < n; b++) {
if (min > a[b]) {
min = a[b];
}
}
for (int c = 1; c < n; c++) {
... | [["-", 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 | 188 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int sum = 0;
int minx, maxx;
cin >> n;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
if (i == 0) {
minx = temp;
maxx = temp;
} else {
minx = min(minx, temp);
maxx = max(maxx, te... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
long int sum = 0;
int minx, maxx;
cin >> n;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
if (i == 0) {
minx = temp;
maxx = temp;
} else {
minx = min(minx, temp);
maxx = max(max... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 116 |
#include <iostream>
using namespace std;
int main() {
int n;
int i;
int max, min, sum = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
max = a[0];
min = a[0];
for (i = 1; i < n; i++) {
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i... | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max, min;
long sum = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
max = a[0];
min = a[0];
for (i = 1; i < n; i++) {
if (max < a[i])
max = a[i];
if (min > a[i])
mi... | [["-", 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 | 148 |
#include <stdio.h>
int main(void) {
// 1_4-D Min,Max and Sum
int n;
long a;
long min, max, sum;
int i;
scanf("%d\n", &n);
min = 1000000;
max = -1000000;
sum = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min) {
min = a;
}
if (max < a) {
max = a;
}
su... | #include <stdio.h>
int main(void) {
// 1_4-D Min,Max and Sum
int n;
long a;
long min, max, sum;
int i;
scanf("%d\n", &n);
min = 1000000;
max = -1000000;
sum = 0;
for (i = 0; i < n; i++) {
scanf("%ld", &a);
if (a < min) {
min = a;
}
if (max < a) {
max = a;
}
s... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 137 |
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, num, min = INT_MAX, max = INT_MIN, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
sum += num;
if (num < min)
min = num;
if (num > max)
max = num;
}
cout << min << " " << max << " " << s... | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n, num, min = INT_MAX, max = INT_MIN;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
sum += num;
if (num < min)
min = num;
if (num > max)
max = num;
}
cout << min << " " << max << "... | [["-", 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 | 100 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, s = 0, min = 0, max = 0, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0) {
min = a;
max = a;
}
s += a;
if (min > a)
min = a;
if (max < a)
max = a;
}
cout << min << " ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
long n, s = 0, min = 0, max = 0, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0) {
min = a;
max = a;
}
s += a;
if (min > a)
min = a;
if (max < a)
max = a;
}
cout << min << "... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 116 |
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
const int inf = 0x7fffffff;
typedef long long int ll;
using namespace std;
int main() {
#ifdef DEBUG
f... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
const int inf = 0x7fffffff;
typedef long long int ll;
using namespace std;
int main() {
#ifdef DEBUG
f... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 155 |
#include <cstdio>
using namespace std;
static const int MAX_N = 1000001;
int main() {
int n, a, min = MAX_N, max = -MAX_N, sum = 0;
scanf("%d", &n);
for (int 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", mi... | #include <cstdio>
using namespace std;
static const int MAX_N = 1000001;
int main() {
int n, a, min = MAX_N, max = -MAX_N;
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
printf("%d ... | [["-", 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 | 114 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
long min, max, a;
long long sum;
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
if (i == 1)
min = a, max = a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
cout <<... | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
long min, max, a;
long long sum;
int n;
sum = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
if (i == 0)
min = a, max = a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 118 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, input, sum = 0;
int max, min;
vector<int> v;
cin >> n;
/*
for (auto i : v) {
cin >> input;
v.push_back(input);
sum += v[i];
}
*/
for (int i = 0; i < n; i++) {
cin >> i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, input;
long long sum = 0;
int max, min;
vector<int> v;
cin >> n;
/*
for (auto i : v) {
cin >> input;
v.push_back(input);
sum += v[i];
}
*/
for (int i = 0; i < n; 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 | 132 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.