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 <stdio.h>
int main() {
int Max = -1000000, Min = 1000000, n, a;
long int SUM = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (Max < a)
Max = a;
if (Min > a)
Min = a;
SUM += a;
}
printf("%d %d %d\n", Min, Max, SUM);
return 0;
} | #include <stdio.h>
int main() {
int Max = -1000000, Min = 1000000, n, a;
long long int SUM = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (Max < a)
Max = a;
if (Min > a)
Min = a;
SUM += a;
}
printf("%d %d %lld\n", Min, Max, SUM);
return 0;
} | [["+", 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 | 104 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
long x, y, i, j, m, n, max = 0, min = 0, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
if (i == 0) {
min = x;
}
sum = sum + x;
if (max < x) {
max = x;
}
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
long x, y, i, j, m, n, max = 0, min = 0, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
if (i == 0) {
max = x;
min = x;
}
sum = sum + x;
if (max < x) {
max ... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 122 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, max, min, sum;
cin >> n >> a;
max = a;
min = a;
sum = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, max, min;
long sum;
cin >> n >> a;
max = a;
min = a;
sum = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << end... | [["-", 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 | 106 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, max, min, sum;
cin >> n >> a;
max = a;
min = a;
sum = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long a, max, min;
long long sum;
cin >> n >> a;
max = a;
min = a;
sum = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
sum += a;
}
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 | 106 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long a, min, max;
long long sum = 0;
min = 1000000;
max = -1000000;
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 << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long a, min, max;
long long sum = 0;
min = 1000000;
max = -1000000;
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 << " "... | [["+", 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 | 101 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
using namespace std;
int main() {
int n, sum = 0, a[10000];
cin >> n;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
cout << a[0] << ' ' << a[n - 1] << ' ' << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
using namespace std;
int main() {
long long n, sum = 0, a[10000];
cin >> n;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
cout << a[0] << ' ' << a[n - 1] << ' ' << sum << endl;
retur... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
// ConsoleApplication7.cpp : ???????????????
// ??¢????????±????????§????????¨????????? ?????????????????????????????????
//
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, cn;
int min = INT_MAX, max = INT_MIN, sum = 0... | // ConsoleApplication7.cpp : ???????????????
// ??¢????????±????????§????????¨????????? ?????????????????????????????????
//
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, cn;
int min = INT_MAX, max = INT_MIN;
long ... | [["-", 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 | 118 |
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
std::vector<int> a;
int x;
int min, max, sum;
cin >> n;
min = 1000000;
max = -1000000;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
sum = sum + a[i];
if (a[i] < min)... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
std::vector<int> a;
int x;
int min, max;
long sum;
cin >> n;
min = 1000000;
max = -1000000;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
sum = sum + a[i];
if (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 | 146 |
#include <climits>
#include <iostream>
using namespace std;
const int CMIN = 0;
const int CMAX = 10000;
const int MIN = -1000000;
const int MAX = 1000000;
bool isRange(double v) {
if ((MIN <= v) && (v <= MAX)) {
return true;
}
return false;
}
int Max(int v1, int v2) {
if (v1 > v2) {
return (v1);
}... | #include <climits>
#include <iostream>
using namespace std;
const int CMIN = 0;
const int CMAX = 10000;
const int MIN = -1000000;
const int MAX = 1000000;
bool isRange(double v) {
if ((MIN <= v) && (v <= MAX)) {
return true;
}
return false;
}
int Max(int v1, int v2) {
if (v1 > v2) {
return (v1);
}... | [["-", 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]] | 1 | 218 |
#include <bits/stdc++.h>
using namespace std;
int n;
int i;
int main() {
cin >> i;
int b = 0;
int a[i];
for (; b < i; ++b) {
cin >> a[b];
}
sort(a, a + i);
int d = 0;
int e;
for (int c = 0; c < i; ++c) {
d = d + a[c];
e = c;
}
cout << a[0] << " " << a[e] << " " << d << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n;
int i;
int main() {
cin >> i;
int b = 0;
int a[i];
for (; b < i; ++b) {
cin >> a[b];
}
sort(a, a + i);
long long int d = 0;
int e;
for (int c = 0; c < i; ++c) {
d = d + a[c];
e = c;
}
cout << a[0] << " " << a[e] << " " << d << endl... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 122 |
#include <bits/stdc++.h>
using namespace std;
int n;
int sum;
int a[10000];
int b = 0;
int c = 0;
int main() {
cin >> n;
for (; b < n; ++b) {
cin >> a[b];
}
sort(a, a + n);
for (; c < n; ++c) {
sum = sum + a[c];
}
n = n - 1;
cout << a[0] << " " << a[n] << " " << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n;
long long int sum;
long long int a[10000];
int b = 0;
int c = 0;
int main() {
cin >> n;
for (; b < n; ++b) {
cin >> a[b];
}
sort(a, a + n);
for (; c < n; ++c) {
sum = sum + a[c];
}
n = n - 1;
cout << a[0] << " " << a[n] << " " << sum << en... | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 117 |
#include <iostream>
using namespace std;
int main() {
int n, v, min, max;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v;
sum += v;
if (i == 0) {
max = v;
min = v;
} else {
if (max <= v) {
max = v;
}
if (min >= v) {
min = v;
... | #include <iostream>
using namespace std;
int main() {
int n;
long v, min, max;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v;
sum += v;
if (i == 0) {
max = v;
min = v;
} else {
if (max <= v) {
max = v;
}
if (min >= v) {
min = 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], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 118 |
#include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
int max = -10000000;
int mi = 10000000;
int to = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) {
max = a[i];
}
if (a[i] < mi) {
mi = a[i];
}
to = to + a[i];
}
cout ... | #include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
int max = -1000000;
int mi = 1000000;
long int to = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) {
max = a[i];
}
if (a[i] < mi) {
mi = a[i];
}
to = to + a[i];
}
co... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 129 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n = 0;
int a;
int i = 0;
int max = -10000000;
int min = 10000000;
int S = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
S = S + a;
if (max < a) {
max = a;
}
if (min > a) {
min = a;
}
}
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n = 0;
int a;
int i = 0;
long int max = -10000000;
int min = 10000000;
long int S = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
S = S + a;
if (max < a) {
max = a;
}
if (min > a) {
min = a;
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 116 |
#include <iostream>
using namespace std;
int main() {
int n, a, max = -1000000, min = 1000000, sum = 0;
cin >> n;
while (n > 0) {
cin >> a;
sum += a;
if (a > max)
max = a;
if (a < min)
min = a;
n--;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long int n, a, max = -1000000, min = 1000000, sum = 0;
cin >> n;
while (n > 0) {
cin >> a;
sum += a;
if (a > max)
max = a;
if (a < min)
min = a;
n--;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 93 |
#include <stdio.h>
int main(void) {
long long c = 0;
int a, i, j, n, array[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
c += array[i];
}
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (array[j] < array[j - 1]) {
a = array[j];
array[... | #include <stdio.h>
int main(void) {
long long c = 0;
int a, i, j, n, array[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
c += array[i];
}
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (array[j] < array[j - 1]) {
a = array[j];
array[... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 175 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
int *a;
int mi, ma;
int sum;
cin >> n;
a = new int[n];
cin >> a[0];
mi = ma = sum = a[0];
for (int i = 1; i < n && cin >> a[i]; i++) {
mi = min(a[i], mi);
ma = max(a[i], ma);
sum += a[i];
}
cout ... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
int *a;
int mi, ma;
long sum;
cin >> n;
a = new int[n];
cin >> a[0];
mi = ma = sum = a[0];
for (int i = 1; i < n && cin >> a[i]; i++) {
mi = min(a[i], mi);
ma = max(a[i], ma);
sum += a[i];
}
cout... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 133 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int amax = -1e7, amin = 1e7, asum = 0;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
amax = max(amax, tmp);
amin = min(amin, tmp);
asum += tmp;
}
cout << amin << " " << amax << " " << asum ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int amax = -1e7, amin = 1e7;
long long int asum = 0;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
amax = max(amax, tmp);
amin = min(amin, tmp);
asum += tmp;
}
cout << amin << " " << amax... | [["-", 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>
int main() {
int n, i, in, min, max, sum;
std::cin >> n;
for (i = sum = 0; i < n; i++) {
std::cin >> in;
if (i == 0)
min = max = in;
if (min > in)
min = in;
if (max < in)
max = in;
sum += in;
}
std::cout << min << " " << max << " " << sum << std::endl;... | #include <iostream>
int main() {
int n, i, in, min, max;
long long sum;
std::cin >> n;
for (i = sum = 0; i < n; i++) {
std::cin >> in;
if (i == 0)
min = max = in;
if (min > in)
min = in;
if (max < in)
max = in;
sum += in;
}
std::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 | 111 |
#include <stdio.h>
int main(void) {
int a[10000];
int n;
long long int gokei = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
gokei += a[i];
}
int min = a[0];
int max = a[0];
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > m... | #include <stdio.h>
int main(void) {
int a[10000];
int n;
long long int gokei = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
gokei += a[i];
}
int min = a[0];
int max = a[0];
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > m... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 156 |
#include <iostream>
using namespace std;
int main() {
int n, x, min = 100000, max = -1000000;
long total = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x < min) {
min = x;
}
if (x > max) {
max = x;
}
total += x;
}
cout << min << " " << max << " " << total <<... | #include <iostream>
using namespace std;
int main() {
int n, x, min = 1000000, max = -1000000;
long total = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x < min) {
min = x;
}
if (x > max) {
max = x;
}
total += x;
}
cout << min << " " << max << " " << total <... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 103 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int a;
cin >> v[i];
}
LL int min = *min_element(v.begin(), v.end());
LL int max = *max_element(v.begin(), v.end());
LL int sum = accumulate(v.begin()... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int a;
cin >> v[i];
}
LL int min = *min_element(v.begin(), v.end());
LL int max = *max_element(v.begin(), v.end());
LL int sum = accumulate(v.begin()... | [["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13]] | 1 | 139 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, MAX, MIN, SUM = 0, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0) {
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n, MAX, MIN, SUM = 0, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0) {
... | [["-", 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(void) {
int data_num;
int input;
int i;
int min;
int max;
int sum;
min = 1000000;
max = -1000000;
sum = 0;
cin >> data_num;
for (i = 0; i < data_num; i++) {
cin >> input;
if (input < min) {
min = input;
}
if (input > m... | #include <iostream>
using namespace std;
int main(void) {
int data_num;
int input;
int i;
int min;
int max;
long int sum;
min = 1000000;
max = -1000000;
sum = 0;
cin >> data_num;
for (i = 0; i < data_num; i++) {
cin >> input;
if (input < min) {
min = input;
}
if (inpu... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 115 |
#include <iostream>
using namespace std;
int main() {
int n, a[10001];
int min = 1000000, max = -1000000, sum = 0;
int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a[i];
}
cout << min << " " << max << " " <... | #include <iostream>
using namespace std;
int main() {
int n, a[10001];
int min = 1000000, max = -1000000;
long long int sum = 0;
int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a[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], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 122 |
#include <stdio.h>
int main(void) {
int n;
int a[10000];
long long int sum = 0;
scanf("%d", &n);
int i;
int max = -1000000;
int min = 1000000;
for (i = 0; i < n; i++) {
int b;
scanf("%d", &b);
sum += b;
if (min >= b) {
min = b;
}
if (max <= b) {
max = b;
}
... | #include <stdio.h>
int main(void) {
int n;
int a[10000];
long long int sum = 0;
scanf("%d", &n);
int i;
int max = -1000000;
int min = 1000000;
for (i = 0; i < n; i++) {
int b;
scanf("%d", &b);
sum += b;
if (min >= b) {
min = b;
}
if (max <= b) {
max = b;
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 121 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a;
int mx = -10000, mn = 10000;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
mx = max(mx, a);
mn = min(mn, a);
sum += a;
}
cout << mn << ' ' << mx << ' ' << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a;
int mx = -1000000, mn = 1000000;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
mx = max(mx, a);
mn = min(mn, a);
sum += a;
}
cout << mn << ' ' << mx << ' ' << sum << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 100 |
#include <iostream>
using namespace std;
int main() {
int n;
double min = 1000000, max = -10000000, sum = 0;
cin >> n;
if (n == 1) {
int a;
cin >> a;
cout << a << " " << a << " " << a << endl;
} else {
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a < min) {
... | #include <iostream>
using namespace std;
int main() {
int n;
long long min = 1000000, max = -10000000, sum = 0;
cin >> n;
if (n == 1) {
long long a;
cin >> a;
cout << a << " " << a << " " << a << endl;
} else {
for (int i = 1; i <= n; i++) {
long long a;
cin >> a;
if (a ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["+", 0, 57, 64, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 140 |
#include <stdio.h>
int main() {
int a, x[10000], Max = -1000000, min = 1000000, sum = 0;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
scanf("%d", &x[i]);
sum = sum + x[i];
if (Max < x[i]) {
Max = x[i];
}
if (min > x[i]) {
min = x[i];
}
}
printf("%d %d %d\n", min, Max, sum... | #include <stdio.h>
int main() {
int a, x[10000], Max = -1000000, min = 1000000;
long long int sum = 0;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
scanf("%d", &x[i]);
sum = sum + x[i];
if (Max < x[i]) {
Max = x[i];
}
if (min > x[i]) {
min = x[i];
}
}
printf("%d %d %lld... | [["-", 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 | 129 |
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int max, min, n, a, sum;
max = INT_MIN;
min = INT_MAX;
sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
if (a > max) {
max = a;
}
if (a < min) {
mi... | #include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int max, min, n, a;
long sum;
max = INT_MIN;
min = INT_MAX;
sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
if (a > max) {
max = a;
}
if (a < 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 | 114 |
#include <iostream>
using namespace std;
int main() {
int x, y;
int total = 0, max = -10000000, min = 10000000;
cin >> x;
for (int i = 0; i < x; ++i) {
cin >> y;
total += y;
if (max < y) {
max = y;
}
if (min > y) {
min = y;
}
}
cout << min << " " << max << " " << total ... | #include <iostream>
using namespace std;
int main() {
int x, y;
long long int total = 0, max = -10000000, min = 10000000;
cin >> x;
for (int i = 0; i < x; ++i) {
cin >> y;
total += y;
if (max < y) {
max = y;
}
if (min > y) {
min = y;
}
}
cout << min << " " << max << " "... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 100 |
#include <stdio.h>
int main() {
int i, n;
long int a, min = 1000000, max = -1000000, sum = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%ld", &a);
if (a <= min) {
min = a;
} else if (a >= max) {
max = a;
}
sum = sum + a;
}
printf("%ld %ld %ld\n", min, max, sum);
re... | #include <stdio.h>
int main() {
int i, n;
long int a, min = 1000000, max = -1000000, sum = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%ld", &a);
if (a <= min) {
min = a;
}
if (a >= max) {
max = a;
}
sum = sum + a;
}
printf("%ld %ld %ld\n", min, max, sum);
ret... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
int nmax = -10000000, nmin = 10000000, nsum = 0;
for (int i = 0; i < n; i++) {
cin >> t;
if (nmax < t)
nmax = t;
if (nmin > t)
nmin = t;
nsum += t;
}
cout << nmin << " " << nmax << " " << nsum << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t;
cin >> n;
long long nmax = -10000000, nmin = 10000000, nsum = 0;
for (long long i = 0; i < n; i++) {
cin >> t;
if (nmax < t)
nmax = t;
if (nmin > t)
nmin = t;
nsum += t;
}
cout << nmin << " " << nmax << ... | [["-", 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 | 99 |
#include <iostream>
using namespace std;
int main() {
int x, n, min, max, total;
cin >> n;
min = 1000000;
max = -1000000;
total = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
total += x;
max = std::max(max, x);
min = std::min(min, x);
}
cout << min << " " << max << " " << total << endl;
... | #include <iostream>
using namespace std;
int main() {
int x, n, min, max;
cin >> n;
min = 1000000;
max = -1000000;
long long total = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
total += x;
max = std::max(max, x);
min = std::min(min, x);
}
cout << min << " " << max << " " << total << endl... | [["-", 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]] | 1 | 106 |
#include <iostream>
using namespace std;
int main() {
int n, a, sum = 0;
cin >> n;
int max = -1000000, min = 1000000;
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;
long long int sum = 0;
cin >> n;
int max = -1000000, min = 1000000;
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, 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 | 96 |
#include <iostream>
int main() {
int n;
std::cin >> n;
std::cin.get();
int x, min, max;
int sum = 0;
for (int i = 0; i < n; i++) {
std::cin >> x;
if (i == 0) {
min = x;
max = x;
} else if (x < min) {
min = x;
} else if (x > max) {
max = x;
}
sum += x;
}
... | #include <iostream>
int main() {
int n;
std::cin >> n;
std::cin.get();
int x, min, max;
long sum = 0;
for (int i = 0; i < n; i++) {
std::cin >> x;
if (i == 0) {
min = x;
max = x;
} else if (x < min) {
min = x;
} else if (x > max) {
max = x;
}
sum += x;
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 130 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[10000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = a[0], max = a[0], sum = 0;
for (int j = 0; j < n; j++) {
if (a[j] < min)
min = a[j];
if (a[j] > max)
max = a[j];
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[10000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = a[0], max = a[0];
long int sum = 0;
for (int j = 0; j < n; j++) {
if (a[j] < min)
min = a[j];
if (a[j] > max)
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], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 146 |
#include <stdio.h>
int main(void) {
int n, i, a = 0;
int min = 1000000;
int max = -1000000;
long int b = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (min > a) {
min = a;
} else if (max < a) {
max = a;
}
b += a;
}
printf("%d %d %ld\n", min, max, b);
... | #include <stdio.h>
int main(void) {
int n, i, a = 0;
int min = 1000000;
int max = -1000000;
long int b = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
b += a;
}
printf("%d %d %ld\n", min, max, b);
... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 115 |
// 1_4_D
#include <iostream>
using namespace std;
int main() {
int n, num, maximum = -1000000, minimum = 1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
maximum = max(maximum, num);
minimum = min(minimum, num);
sum += num;
}
cout << minimum << " " << maximum << " " <<... | // 1_4_D
#include <iostream>
using namespace std;
int main() {
int n, num, maximum = -1000000, minimum = 1000000;
long long int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
maximum = max(maximum, num);
minimum = min(minimum, num);
sum += num;
}
cout << minimum << " " << m... | [["-", 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 | 97 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[11111], sum = 0, min = 1111111, max = -1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum = sum + a[i];
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
max = a[i];
}
}
cout << min << ' ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[11111], sum = 0, min = 1111111, max = -1111111;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum = sum + a[i];
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
max = a[i];
}
}
cout << min... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 129 |
#include <stdio.h>
int main(void) {
int n;
scanf("%d\n", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d ", &a[i]);
}
// min
int min = a[0];
for (int t = 0; t < n; t++) {
if (a[t] < min) {
min = a[t];
}
}
// max
int max = a[0];
for (int s = 0; s < n; s++) {
if (a[s]... | #include <stdio.h>
int main(void) {
int n;
scanf("%d\n", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d ", &a[i]);
}
// min
int min = a[0];
for (int t = 0; t < n; t++) {
if (a[t] < min) {
min = a[t];
}
}
// max
int max = a[0];
for (int s = 0; s < n; s++) {
if (a[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 | 190 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, sum = 0, max = 0, min = 1000000;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
sum += a;
if (a > max)
max = a;
if (a < min)
min = a;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, sum = 0, max = -1000001, min = 1000001;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
sum += a;
if (a > max)
max = a;
if (a < min)
min = a;
}
cout << min << " " << 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], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 98 |
#include <iostream>
#define N 10000
using namespace std;
int main() {
int n, max, min, A[N], sum = 0;
cin >> n;
cin >> A[0];
max = min = A[0];
sum += A[0];
for (int i = 1; i < n; i++) {
cin >> A[i];
if (max < A[i])
max = A[i];
if (min > A[i])
min = A[i];
sum += A[i];
}
cout ... | #include <iostream>
#define N 10000
using namespace std;
int main() {
int n, max, min, A[N];
long long sum = 0;
cin >> n;
cin >> A[0];
max = min = A[0];
sum += A[0];
for (int i = 1; i < n; i++) {
cin >> A[i];
if (max < A[i])
max = A[i];
if (min > A[i])
min = A[i];
sum += 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 | 141 |
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, a, nmin = INT_MAX, nmax = INT_MIN, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
nmax = max(a, nmax);
nmin = min(a, nmin);
sum += a;
}
cout << nmin << " " << nmax << " " << sum << endl;
} | #include <climits>
#include <iostream>
using namespace std;
int main() {
long long n, a, nmin = INT_MAX, nmax = INT_MIN, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
nmax = max(a, nmax);
nmin = min(a, nmin);
sum += a;
}
cout << nmin << " " << nmax << " " << sum << endl;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 95 |
#include <iostream>
using namespace std;
int n, a, i, x, y, z;
int main() {
cin >> n;
cin >> a;
x = y = z = a;
while (++i < n) {
cin >> a;
if (x > a)
x = a;
if (y < a)
y = a;
z += a;
}
cout << x << " " << y << " " << z << endl;
return 0;
} | #include <iostream>
using namespace std;
long n, a, i, x, y, z;
int main() {
cin >> n;
cin >> a;
x = y = z = a;
while (++i < n) {
cin >> a;
if (x > a)
x = a;
if (y < a)
y = a;
z += a;
}
cout << x << " " << y << " " << z << endl;
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 99 |
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main(void) {
int N;
int sum = 0;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
cout << *min_element(a, a + N) << " " << *max_element(a, a + N) << " " << sum
<< endl;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main(void) {
int N;
long long sum = 0;
cin >> N;
long long a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
cout << *min_element(a, a + N) << " " << *max_element(a, a + N) << " " << sum
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
#include <iostream>
using namespace std;
int main() {
int n, min, max, sum, hold1;
sum = 0;
max = -1000000;
min = 1000000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> hold1;
if (hold1 >= max) {
max = hold1;
}
if (hold1 <= min) {
min = hold1;
}
sum += hold1;
}
cout... | #include <iostream>
using namespace std;
int main() {
int n, min, max, hold1;
long long sum;
sum = 0;
max = -1000000;
min = 1000000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> hold1;
if (hold1 >= max) {
max = hold1;
}
if (hold1 <= min) {
min = hold1;
}
sum += hold1... | [["-", 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 | 108 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, sum, max, min;
sum = 0;
max = -1000000;
min = 1000000;
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 << end... | #include <iostream>
using namespace std;
int main() {
long long n, a, b, sum, max, min;
sum = 0;
max = -1000000;
min = 1000000;
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 ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 106 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
//#define B
#define D
#ifdef A
int main(void) {
int a, b;
cin >> a >> b;
cout << a / b << " " << a % b << " ";
printf("%f\n", static_cast<double>(a) / b);
return 0;
}
#endif // A
#ifdef B
#define PI 3.1415926535... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
//#define B
#define D
#ifdef A
int main(void) {
int a, b;
cin >> a >> b;
cout << a / b << " " << a % b << " ";
printf("%f\n", static_cast<double>(a) / b);
return 0;
}
#endif // A
#ifdef B
#define PI 3.1415926535... | [["-", 0, 171, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 171, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 535 |
#include <iostream>
int main() {
int n;
std::cin >> n;
int max_val = -1000000;
int min_val = 1000000;
int sum_val = 0;
int d;
for (int i = 0; i < n; i++) {
std::cin >> d;
max_val = (d > max_val) ? d : max_val;
min_val = (d < min_val) ? d : min_val;
sum_val += d;
}
std::cout << min_val... | #include <iostream>
int main() {
int n;
std::cin >> n;
int max_val = -1000000;
int min_val = 1000000;
long long sum_val = 0;
int d;
for (int i = 0; i < n; i++) {
std::cin >> d;
max_val = (d > max_val) ? d : max_val;
min_val = (d < min_val) ? d : min_val;
sum_val += d;
}
std::cout << m... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 110 |
#include <iostream>
int main() {
int num;
std::cin >> num;
int min = 1000000;
int max = -1000000;
int sum = 0;
for (int i = 0; i < num; ++i) {
int val;
std::cin >> val;
if (min > val)
min = val;
if (max < val)
max = val;
sum += val;
}
std::cout << min << " " << max <<... | #include <iostream>
int main() {
int num;
std::cin >> num;
long long min = 1000000;
long long max = -1000000;
long long sum = 0;
for (int i = 0; i < num; ++i) {
int val;
std::cin >> val;
if (min > val)
min = val;
if (max < val)
max = val;
sum += val;
}
std::cout << mi... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 106 |
#include <climits>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
while (n--) {
int x;
cin >> x;
a.push_back(x);
}
int maxa = -INT_MAX;
int mina = INT_MAX;
long long sum = 0;
for (int i = 0; i < a.size(); i++) {
... | #include <climits>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
while (n--) {
int x;
cin >> x;
a.push_back(x);
}
int maxa = -INT_MAX;
int mina = INT_MAX;
long long sum = 0;
for (int i = 0; i < a.size(); i++) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 137 |
#include <iostream>
using namespace std;
int main() {
int n, i, j, x[10000];
int mi, ma, l;
l = 0;
cin >> n;
mi = 1000000;
ma = -1000000;
for (i = 0; i < n; i++) {
cin >> x[i];
ma = max(ma, x[i]);
mi = min(mi, x[i]);
l += x[i];
}
cout << mi << ' ' << ma << ' ' << l << endl;
return 0... | #include <iostream>
using namespace std;
int main() {
long n, i, x[10000], mi, ma, l;
l = 0;
cin >> n;
mi = 1000000;
ma = -1000000;
for (i = 0; i < n; i++) {
cin >> x[i];
ma = max(ma, x[i]);
mi = min(mi, x[i]);
l += x[i];
}
cout << mi << ' ' << ma << ' ' << l << endl;
return 0;
} | [["-", 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, 49, 22], ["-", 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, 0, 21]] | 1 | 121 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int max = -1000001, min = 1000001, sum = 0;
while (N--) {
int n;
cin >> n;
if (n > max)
max = n;
if (n < min)
min = n;
sum += n;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int max = -1000001, min = 1000001;
long long sum = 0;
while (N--) {
int n;
cin >> n;
if (n > max)
max = n;
if (n < min)
min = n;
sum += n;
}
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 | 91 |
#include <iostream>
using namespace std;
int main() {
int min, max, sum = 0;
int n, num;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
if (i == 0) {
min = num;
max = num;
} else {
if (num < min)
min = num;
if (num > max)
max = num;
}
sum += num... | #include <iostream>
using namespace std;
int main() {
int min, max;
long sum = 0;
int n, num;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
if (i == 0) {
min = num;
max = num;
} else {
if (num < min)
min = num;
if (num > max)
max = num;
}
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 | 114 |
#include <iostream>
using namespace std;
int main() {
int n, i, min, max, sum, a;
cin >> n;
cin >> min;
max = min;
sum = min;
i = 0;
while (i < n - 1) {
cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum = sum + a;
i++;
}
cout << min << " " << max... | #include <iostream>
using namespace std;
int main() {
int n, i, min, max, a;
long int sum;
cin >> n;
cin >> min;
max = min;
sum = min;
i = 0;
while (i < n - 1) {
cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum = sum + a;
i++;
}
cout << min <<... | [["-", 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 | 113 |
#include <iostream>
using namespace std;
int main() {
int n, min, max, sum, a;
cin >> n;
cin >> min;
max = min;
sum = min;
for (int 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, min, max, a;
long int sum;
cin >> n;
cin >> min;
max = min;
sum = min;
for (int 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, 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 | 110 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a[10010] = {};
int n, i, sum = 0, max = 0, min = 0, temp = 0, j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) {
if (a[j - 1] > a[j]) {... |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a[10010] = {};
long long int n, i, sum = 0, max = 0, min = 0, temp = 0, j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) {
if (a[j - 1... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 194 |
#include <algorithm>
#include <iostream>
int main(void) {
using namespace std;
int n, sum = 0;
cin >> n;
int *data = new int[n];
for (int i = 0; i < n; ++i) {
cin >> data[i];
sum += data[i];
}
sort(data, data + n);
cout << data[0] << " " << data[n - 1] << " " << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
int main(void) {
using namespace std;
int n;
long int sum = 0;
cin >> n;
long int *data = new long int[n];
for (int i = 0; i < n; ++i) {
cin >> data[i];
sum += data[i];
}
sort(data, data + n);
cout << data[0] << " " << data[n - 1] << " " << 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], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 43, 49, 50, 51, 350, 39, 86, 0, 96]] | 1 | 104 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long int k, max = 0, min = 1000001, g = 0, n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> k;
if (k > max) {
max = k;
}
if (min > k) {
min = k;
}
g = g + k;
}
cout << min << " " << max << " " << ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long int k, max = -1000001, min = 1000001, g = 0, n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> k;
if (k > max) {
max = k;
}
if (min > k) {
min = k;
}
g = g + k;
}
cout << min << " " << max << ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 109 |
#include <iostream>
using namespace std;
int mi = 1000001, ma = -1000001, su = 0;
void min(int x) {
if (mi > x)
mi = x;
}
void max(int x) {
if (ma < x)
ma = x;
}
void sum(int x) { su += x; }
int main() {
int a, b;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
min(b);
max(b);
sum(b)... | #include <iostream>
using namespace std;
int mi = 1000001, ma = -1000001;
long su = 0;
void min(int x) {
if (mi > x)
mi = x;
}
void max(int x) {
if (ma < x)
ma = x;
}
void sum(int x) { su += x; }
int main() {
int a, b;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
min(b);
max(b);
s... | [["-", 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 | 140 |
#include <stdio.h>
int main() {
int x, i;
int max, min, sum = 0;
scanf("%d", &x);
int a[x];
for (i = 0; i < x; i++) {
scanf("%d ", &a[i]);
sum = sum + a[i];
if (i == 0) {
max = a[i];
min = a[i];
}
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = a[i]... | #include <stdio.h>
int main() {
int x, i;
int max, min;
long sum = 0;
scanf("%d", &x);
int a[x];
for (i = 0; i < x; i++) {
scanf("%d ", &a[i]);
sum = sum + a[i];
if (i == 0) {
max = a[i];
min = 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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 150 |
#include <cstdio>
#include <iostream>
using namespace std; //?????????????????????
int main() {
int n, a;
cin >> n;
int min = 1000000, max = -1000000; //??\????????´??°????????§???????°????
int sum = 0; // long??????????????¨?????????
for (int i = 0; i < n; i++) {
cin >> a; //??????... | #include <cstdio>
#include <iostream>
using namespace std; //?????????????????????
int main() {
int n, a;
cin >> n;
int min = 1000000, max = -1000000; //??\????????´??°????????§???????°????
long sum = 0; // long??????????????¨?????????
for (int i = 0; i < n; i++) {
cin >> a; //??????... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 109 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int mi = 1e9, ma = -1e9, sum = 0;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
mi = min(x, mi);
ma = max(x, ma);
sum += x;
}
cout << mi << ' ' << ma << ' ' << sum << endl;
re... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long mi = 1e9, ma = -1e9, sum = 0;
for (int i = 0; i < n; ++i) {
long long x;
cin >> x;
mi = min(x, mi);
ma = max(x, ma);
sum += x;
}
cout << mi << ' ' << ma << ' ' << sum <... | [["-", 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 | 102 |
//????????¶??????C++???????????¨";"?????\??????????????????????????????
#include <iostream>
using namespace std;
int N, A[10010];
int min() {
int k;
k = A[0];
for (int i = 0; i < N; i++) {
if (k > A[i]) {
k = A[i];
}
}
return k;
}
int max() {
int k;
k = A[0];
for (int i = 0; i < N; i++) ... | //????????¶??????C++???????????¨";"?????\??????????????????????????????
#include <iostream>
using namespace std;
int N, A[10010];
int min() {
int k;
k = A[0];
for (int i = 0; i < N; i++) {
if (k > A[i]) {
k = A[i];
}
}
return k;
}
int max() {
int k;
k = A[0];
for (int i = 0; i < N; i++) ... | [["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 156], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 156], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 217 |
#include <iostream>
using namespace std;
const int MAX_NUM = 10000;
const int MAX_LENGTH = 1000000;
long value[MAX_NUM];
int sum, min_num, max_num;
int main() {
int n;
cin >> n;
for (int i = 0; i <= n - 1; i++) {
cin >> value[i];
}
min_num = value[0];
max_num = value[0];
for (int i = 0; i <= n - 1... | #include <iostream>
using namespace std;
const int MAX_NUM = 10000;
const int MAX_LENGTH = 1000000;
long value[MAX_NUM];
long sum, min_num, max_num;
int main() {
int n;
cin >> n;
for (int i = 0; i <= n - 1; i++) {
cin >> value[i];
}
min_num = value[0];
max_num = value[0];
for (int i = 0; i <= n - ... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 165 |
#include <iostream>
using namespace std;
int main() {
int n, x;
int min = 1000001;
int max = -1000001;
int sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > max)
max = x;
if (x < min)
min = x;
sum += x;
}
cout << min << " " << max << " " << sum << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
int min = 1000001;
int max = -1000001;
long sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > max)
max = x;
if (x < min)
min = x;
sum += 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 | 98 |
#include <stdio.h>
int main() {
int n, i, t;
int tmax, tmin;
long long int tsum;
scanf("%d\n", &n);
for (i = 0, tsum = 0, tmax = -10000000000, tmin = 10000000000; i < n; i++) {
scanf("%d", &t);
tsum += t;
if (tmax < t)
tmax = t;
if (tmin > t)
tmin = t;
}
printf("%d %d %d\n", t... | #include <stdio.h>
int main() {
int n, i, t;
int tmax, tmin;
long long int tsum;
scanf("%d\n", &n);
for (i = 0, tsum = 0, tmax = -1000000, tmin = 1000000; i < n; i++) {
scanf("%d", &t);
tsum += t;
if (tmax < t)
tmax = t;
if (tmin > t)
tmin = t;
}
printf("%d %d %lld\n", tmin, t... | [["-", 10, 34, 12, 34, 12, 34, 31, 11, 12, 13], ["+", 10, 34, 12, 34, 12, 34, 31, 11, 12, 13], ["-", 10, 34, 12, 34, 12, 34, 12, 11, 12, 13], ["+", 10, 34, 12, 34, 12, 34, 12, 11, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 114 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int num;
int i = 0;
int min = 1000000;
int max = -1000000;
int sum = 0;
cin >> n;
while (cin >> num) {
i++;
sum += num;
if (num < min)
min = num;
if (num > max)
max = num;
if (i == n)
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int num;
int i = 0;
int min = 1000000;
int max = -1000000;
long sum = 0;
cin >> n;
while (cin >> num) {
i++;
sum += num;
if (num < min)
min = num;
if (num > max)
max = num;
if (i == n)
... | [["-", 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 a[10001];
int max = -100000, min = 1000000;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
sum += a[i];
}
cout << min << " " << max <... | #include <iostream>
using namespace std;
int main() {
int n;
int a[10001];
int max = -1000000, min = 1000000;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
sum += a[i];
}
cout << 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, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 122 |
#include <bits/stdc++.h>
#define ll long long int
#define FOR(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n)
using namespace std;
int main() {
int n, a, min, max, sum;
min = 1000001;
max = -1000001;
sum = 0;
cin >> n;
REP(i, n) {
cin >> a... | #include <bits/stdc++.h>
#define ll long long int
#define FOR(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n)
using namespace std;
int main() {
long long int n, a, min, max, sum;
min = 1000001;
max = -1000001;
sum = 0;
cin >> n;
REP(i, n) {
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 125 |
#include <iostream>
int main() {
using namespace std;
int n, i;
long long int min, max, sum, a;
min = 10000;
max = 0;
sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
sum = sum + a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
cout << min << " " << ... | #include <iostream>
int main() {
using namespace std;
int n, i;
long long int min, max, sum, a;
min = 1000000;
max = -1000000;
sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
sum = sum + a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
cout << min <... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 114 |
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
const int M = 100000;
const double pi = 3.141592653589;
int main() {
int n;
int a[M];
int min, max, sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
for (int i = 1; i < n; i++) {
if (min > a[i]... | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
const int M = 100000;
const double pi = 3.141592653589;
int main() {
int n;
int a[M];
int min, max;
long long sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
for (int i = 1; i < n; 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]] | 1 | 203 |
#include <iostream>
using namespace std;
int main() {
long long a[100], Min, Max, Sum;
int n;
cin >> n;
Min = 10000000;
Max = -10000000;
Sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < Min) {
Min = a[i];
}
if (a[i] > Max) {
Max = a[i];
}
Sum = Sum + a[i]... | #include <iostream>
using namespace std;
int main() {
long long a[10000], Min, Max, Sum;
int n;
cin >> n;
Min = 1000000;
Max = -1000000;
Sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < Min) {
Min = a[i];
}
if (a[i] > Max) {
Max = a[i];
}
Sum = Sum + a[i]... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 133 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n] = {}, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
printf("%d %d %d\n", a[0], a[n - 1], sum);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n] = {};
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
printf("%d %d %lld\n", a[0], a[n - 1], 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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 93 |
#include <algorithm>
#include <stdio.h>
using namespace std;
using LL = long long;
int main(void) {
int num;
int a[10000];
scanf("%d", &num);
for (int i = 0; i < num; i++) {
scanf("%d", &a[i]);
}
LL sum = 0;
int small = a[0];
int large = a[0];
for (int i = 0; i < num; i++) {
sum += a[i];
... | #include <algorithm>
#include <stdio.h>
using namespace std;
using LL = long long;
int main(void) {
int num;
int a[10000];
scanf("%d", &num);
for (int i = 0; i < num; i++) {
scanf("%d", &a[i]);
}
LL sum = 0;
int small = a[0];
int large = a[0];
for (int i = 0; i < num; i++) {
sum += (LL)a[... | [["+", 8, 9, 0, 1, 0, 11, 12, 74, 0, 24], ["+", 0, 1, 0, 11, 12, 74, 39, 77, 39, 78], ["+", 8, 9, 0, 1, 0, 11, 12, 74, 0, 25], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 154 |
#include <iostream>
using namespace std;
int main() {
int n, a, max = -1e8, min = 1e8, 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>
using namespace std;
int main() {
long n, a, max = -1e8, min = 1e8, 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;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 95 |
#include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
int sum = 0;
int max = -1000000;
int min = 1000000;
for (int i = 0; i < n; ++i) {
cin >> a;
sum = sum + a;
if (a > max) {
max = a;
}
if (a < min) {
min = a;
}
}
cout << min << " " << max << "... | #include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
long int sum = 0;
int max = -1000000;
int min = 1000000;
for (int i = 0; i < n; ++i) {
cin >> a;
sum = sum + a;
if (a > max) {
max = a;
}
if (a < min) {
min = a;
}
}
cout << min << " " << max... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 107 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int nCount = 0;
cin >> nCount;
int nMax = -1000001, nMin = 1000001;
int nSum = 0;
int nIn = 0;
while (nCount--) {
cin >> nIn;
if (nIn > nMax) {
nMax = nIn;
}
if (nIn < nMin) {
nMin = nIn;
}
nSum += ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int nCount = 0;
cin >> nCount;
int nMax = -1000001, nMin = 1000001;
long long nSum = 0;
int nIn = 0;
while (nCount--) {
cin >> nIn;
if (nIn > nMax) {
nMax = nIn;
}
if (nIn < nMin) {
nMin = nIn;
}
nS... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 103 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int num;
int max, min, sum;
cin >> num;
int temp;
cin >> temp;
max = temp;
min = temp;
sum = temp;
for (int i = 1; i < num; i++) {
cin >> temp;
if (max < temp) {
max = temp;
}
if (min > temp) {
min =... | #include <iostream>
#include <string>
using namespace std;
int main() {
int num;
long max, min, sum;
cin >> num;
int temp;
cin >> temp;
max = temp;
min = temp;
sum = temp;
for (int i = 1; i < num; i++) {
cin >> temp;
if (max < temp) {
max = temp;
}
if (min > temp) {
min ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 116 |
#include <iostream>
int main() {
int a, n, min{1000000}, max{-1000000};
int sum{};
std::cin >> n;
for (int i = 0; i != n; ++i) {
std::cin >> a;
min = a < min ? a : min;
max = a > max ? a : max;
sum += a;
}
std::cout << min << ' ' << max << ' ' << sum << '\n';
} | #include <iostream>
int main() {
int a, n, min{1000000}, max{-1000000};
long sum{};
std::cin >> n;
for (int i = 0; i != n; ++i) {
std::cin >> a;
min = a < min ? a : min;
max = a > max ? a : max;
sum += a;
}
std::cout << min << ' ' << max << ' ' << sum << '\n';
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
#include <iostream>
using namespace std;
int main() {
int a, b, c = -1000000, d = 1000000, e = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (c < b)
c = b;
if (d > b)
d = b;
e = e + b;
}
cout << d << " " << c << " " << e;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c = -1000000, d = 1000000;
long int e = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (c < b)
c = b;
if (d > b)
d = b;
e = e + b;
}
cout << d << " " << c << " " << e << 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, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 98 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 0, max = 0, sum = 0, dat = 0;
for (int i = 0; i < n; i++) {
cin >> dat;
if (i == 0) {
min = dat;
max = dat;
}
if (dat < min) {
min = dat;
}
if (dat > max) {
max = dat;
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long min = 0, max = 0, sum = 0, dat = 0;
for (int i = 0; i < n; i++) {
cin >> dat;
if (i == 0) {
min = dat;
max = dat;
}
if (dat < min) {
min = dat;
}
if (dat > max) {
max = dat;
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 121 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <utility>
int main() {
int n, m, a, sum, max, min;
scanf("%d", &n); ///////////////////////
m = 1;
max = -10000000;
min = 10000000;
sum = 0;
while (m <= n) {
scanf("%d", &a); //////////////////////////
i... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <utility>
int main() {
long n, m, a, sum, max, min;
scanf("%ld", &n); ///////////////////////
m = 1;
max = -10000000;
min = 10000000;
sum = 0;
while (m <= n) {
scanf("%ld", &a); //////////////////////////
... | [["-", 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 | 123 |
#include <iostream>
int main(int argc, const char *argv[]) {
int n;
std::cin >> n;
int min = 1000000;
int max = -1000000;
int sum = 0;
for (int i = 0, a; i < n && std::cin >> a; i++) {
if (a < min)
min = a;
if (max < a)
max = a;
sum += a;
}
std::cout << min << " " << max << " " ... | #include <iostream>
int main(int argc, const char *argv[]) {
int n;
std::cin >> n;
int min = 1000000;
int max = -1000000;
long long sum = 0;
for (int i = 0, a; i < n && std::cin >> a; i++) {
if (a < min)
min = a;
if (max < a)
max = a;
sum += a;
}
std::cout << min << " " << max <... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 115 |
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, c = 0;
cin >> n;
int a[10005];
for (int i = 0; i < n; i++) {
cin >> a[i];
c = c + a[i];
}
sort(a, a + n);
cout << a[0] << " " << a[n - 1] << " " << c << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
long int n, c = 0;
cin >> n;
int a[10005];
for (int i = 0; i < n; i++) {
cin >> a[i];
c = c + a[i];
}
sort(a, a + n);
cout << a[0] << " " << a[n - 1] << " " << c << endl;
} | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 100 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, sum = 0;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
sum += v[i];
}
sort(v.begin(), v.end());
cout << v[0] << " " << v[n - 1] << " " << sum << endl;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, a, sum = 0;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
sum += v[i];
}
sort(v.begin(), v.end());
cout << v[0] << " " << v[n - 1] << " " << sum << ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 113 |
#include <stdio.h>
int main() {
int i, n, x, min = 0, max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
x = 0;
scanf("%d", &x);
sum += x;
if (i == 0) {
min = x;
max = x;
}
if (x > max) {
max = x;
}
if (x < min) {
min = x;
}
}
printf("%d %d... | #include <stdio.h>
int main() {
int i, n, x, min = 0, max = 0;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
x = 0;
scanf("%d", &x);
sum += x;
if (i == 0) {
min = x;
max = x;
}
if (x > max) {
max = x;
}
if (x < min) {
min = x;
}
}
p... | [["-", 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 | 127 |
#include <stdio.h>
int main() {
int i, n;
double min, max, sum, ave;
double data[100000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &data[i]);
}
max = data[0];
min = data[0];
for (i = 0; i < n; i++) {
sum = data[i];
if (data[i] > max) {
max = data[i];
}
if (data... | #include <stdio.h>
int main() {
int i, n;
double min, max, sum, ave;
double data[100000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &data[i]);
}
max = data[0];
min = data[0];
for (i = 0; i < n; i++) {
sum += data[i];
if (data[i] > max) {
max = data[i];
}
if (dat... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 155 |
#include <climits>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int max_n = INT_MIN;
int min_n = INT_MAX;
int sum = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (min_n > x)
min_n = x;
if (max_n < x)
max_n = x;
sum += x;
}
cout << min... | #include <climits>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int max_n = INT_MIN;
int min_n = INT_MAX;
long long sum = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (min_n > x)
min_n = x;
if (max_n < x)
max_n = x;
sum += x;
}
cout ... | [["-", 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 max, min, sum;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
max = a[0];
sum = 0;
for (int i = 0; i < n; i++) {
if (min > a[i]) {
min = a[i];
} else if (max < a[i]) {
max = a[i]... | #include <iostream>
using namespace std;
int main() {
int n;
int max, min;
long sum;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
max = a[0];
sum = 0;
for (int i = 0; i < n; i++) {
if (min > a[i]) {
min = a[i];
} else if (max < a[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 | 154 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int sum_of_elems = 0;
for (auto &n : arr)
sum_of_elems += n;
cout << *min_element(arr, arr + n) << " ";
cout << *max_element(arr, arr + n) ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long sum_of_elems = 0;
for (auto &n : arr)
sum_of_elems += n;
cout << *min_element(arr, arr + n) << " ";
cout << *max_element(arr, arr + n... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <stdio.h>
int main() {
int i;
int num;
int *data;
scanf("%d", &num);
data = new int[num];
for (i = 0; i < num; i++)
scanf("%d", &data[i]);
int min, max;
long long sum = 0;
min = max = data[0];
for (i = 0; i < num; i++) {
if (min > data[i])
min = data[i];
else if (max <... | #include <stdio.h>
int main() {
int i;
int num;
int *data;
scanf("%d", &num);
data = new int[num];
for (i = 0; i < num; i++)
scanf("%d", &data[i]);
int min, max;
long long int sum = 0;
min = max = data[0];
for (i = 0; i < num; i++) {
if (min > data[i])
min = data[i];
else if (m... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 11, 12, 74, 39, 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 | 163 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int max, min, i, n, a[10000];
long sum;
sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
max = min = a[0];
for (i = 0; i < n; i++) {
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) ... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int max, min, i, n, a[10000];
long sum;
sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
max = min = sum = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max) {
max = a[i];
}
if (a[i] <... | [["+", 0, 1, 0, 11, 12, 11, 12, 11, 31, 22], ["+", 0, 1, 0, 11, 12, 11, 12, 11, 17, 32], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 155 |
#include <stdio.h>
int main() {
int x = 0;
int a = 0;
int min = 1000000;
int max = -1000000;
int sum = 0;
int cnt = 0;
scanf("%d", &cnt);
for (x = 1; x <= cnt; x++) {
scanf("%d", &a);
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
printf("%d %... | #include <stdio.h>
int main() {
int x = 0;
int a = 0;
int min = 1000000;
int max = -1000000;
long int sum = 0;
int cnt = 0;
scanf("%d", &cnt);
for (x = 1; x <= cnt; x++) {
scanf("%d", &a);
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
printf(... | [["+", 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 | 118 |
#include <iostream>
using namespace std;
int main() {
long int n, a;
cin >> n;
long int min = 10000000;
long int max = -10000000;
int 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 << ' '... | #include <iostream>
using namespace std;
int main() {
long int n, a;
cin >> n;
long int min = 10000000;
long int max = -10000000;
long long int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= max) {
max = a;
}
if (a <= min) {
min = a;
}
sum += a;
}
cout << ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <iostream>
using namespace std;
int main() {
int test, n, min = 1000000, max = -1000000, i, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> test;
if (test < min)
min = test;
if (test > max)
max = test;
sum += test;
}
cout << min << " " << max << " " << sum << endl;
} | #include <iostream>
using namespace std;
int main() {
long long test, n, min = 1000000, max = -1000000, i, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> test;
if (test < min)
min = test;
if (test > max)
max = test;
sum += test;
}
cout << min << " " << max << " " << sum << en... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 96 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
valarray<int> a(n);
REP(i, n) { cin >> a[i]; }
cout << a.min() << " " << a.max() << " " << a.sum() << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define llong long long
using namespace std;
int main() {
int n;
cin >> n;
valarray<llong> a(n);
REP(i, n) { cin >> a[i]; }
cout << a.min() << " " << a.max() << " " << a.sum() << endl;
return 0;
} | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78]] | 1 | 84 |
#include <iostream>
using namespace std;
main() {
int n, a[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mi = a[0], ma = a[0], sum = 0;
for (int i = 0; i < n; i++) {
mi = min(mi, a[i]);
ma = max(ma, a[i]);
sum += a[i];
}
cout << mi << " " << ma << " " << sum << endl;
} | #include <iostream>
using namespace std;
main() {
int n, a[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int mi = a[0], ma = a[0];
long int sum = 0;
for (int i = 0; i < n; i++) {
mi = min(mi, a[i]);
ma = max(ma, a[i]);
sum += a[i];
}
cout << mi << " " << ma << " " << 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], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 128 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int number[10000];
for (int i = 0; i < N; i++)
cin >> number[i];
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (number[i] > number[j])
swap(number[i], number[j]);
}
ans += n... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int number[10000];
for (int i = 0; i < N; i++)
cin >> number[i];
long long int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (number[i] > number[j])
swap(number[i], number[j]);
}
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 146 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.