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>
#define REP(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int n;
long M, m, s;
int main(void) {
cin >> n;
M = -1000000;
m = 1000000;
s = 0;
REP(i, 0, n) {
long a;
cin >> a;
M = max(M, a);
m = min(m, a);
s += a;
}
cout << M << " " << m << " " << s <<... | #include <iostream>
#define REP(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int n;
long M, m, s;
int main(void) {
cin >> n;
M = -1000000;
m = 1000000;
s = 0;
REP(i, 0, n) {
long a;
cin >> a;
M = max(M, a);
m = min(m, a);
s += a;
}
cout << m << " " << M << " " << s <<... | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22]] | 1 | 110 |
#include <iostream>
using namespace std;
int main() {
int n = 0;
cin >> n;
int *array;
array = new int[n];
int x = 0;
for (int i = 0; i < n; i++) {
cin >> x;
array[i] = x;
}
int min = array[0], max = array[0], sum = array[0];
for (int j = 1; j < n; j++) {
if (min > array[j])
min = a... | #include <iostream>
using namespace std;
int main() {
int n = 0;
cin >> n;
int *array;
array = new int[n];
int x = 0;
for (int i = 0; i < n; i++) {
cin >> x;
array[i] = x;
}
int min = array[0], max = array[0];
long long sum = array[0];
for (int j = 1; j < n; j++) {
if (min > array[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]] | 1 | 163 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t[n];
for (int i = 0; i < n; i++) {
cin >> t[i];
}
int min = 1000001;
int max = -1000001;
int sum = 0;
for (int j = 0; j < n; j++) {
if (t[j] < min)
min = t[j];
if (t[j] > max)
max = t[j];
sum += ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long t[n];
for (int i = 0; i < n; i++) {
cin >> t[i];
}
long min = 1000001;
long max = -1000001;
long sum = 0;
for (int j = 0; j < n; j++) {
if (t[j] < min)
min = t[j];
if (t[j] > max)
max = t[j];
sum... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 139 |
#include <iostream>
using namespace std;
int main() {
int n;
int a;
int num = -1000000;
int ave = 1000000;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > num)
num = a;
if (a < ave)
ave = a;
sum += a;
}
cout << ave << " " << num << " " << sum << endl... | #include <iostream>
using namespace std;
int main() {
int n;
int a;
int num = -1000000;
int ave = 1000000;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > num)
num = a;
if (a < ave)
ave = a;
sum += a;
}
cout << ave << " " << num << " " << sum << end... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
#include <stdio.h>
int main(void) {
int i, n, min, max;
long long int sum;
min = 1000000;
max = -100000;
sum = 0;
scanf("%d", &n);
long int A[n];
for (i = 0; i < n; i++)
scanf("%ld", &A[i]);
for (i = 0; i < n; i++) {
if ((int)A[i] > max)
max = (int)A[i];
if ((int)A[i] < (long)m... | #include <stdio.h>
int main(void) {
int i, n, min, max;
long long int sum;
min = 1000000;
max = -1000000;
sum = 0;
scanf("%d", &n);
long int A[n];
for (i = 0; i < n; i++)
scanf("%ld", &A[i]);
for (i = 0; i < n; i++) {
if ((int)A[i] > max)
max = (int)A[i];
if ((int)A[i] < (long)... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 164 |
#include <algorithm>
#include <iostream>
#include <limits>
int main() {
int n;
std::cin >> n;
int max = std::numeric_limits<int>::min();
int min = std::numeric_limits<int>::max();
int sum = 0;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
max = std::max(max, a);
min = std::min(min, ... | #include <algorithm>
#include <iostream>
#include <limits>
int main() {
int n;
std::cin >> n;
int max = std::numeric_limits<int>::min();
int min = std::numeric_limits<int>::max();
long long int sum = 0;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
max = std::max(max, a);
min = std:... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 130 |
#include <iostream>
using namespace std;
int main() {
int i, n, m[1000000], max, min, sum;
i = 0;
sum = 0;
cin >> n;
do {
cin >> m[i];
if (i == 0) {
max = m[i];
min = m[i];
} else {
if (max < m[i])
max = m[i];
if (min > m[i])
min = m[i];
}
sum = su... | #include <iostream>
using namespace std;
int main() {
long i, n, m[1000000], max, min, sum;
i = 0;
sum = 0;
cin >> n;
do {
cin >> m[i];
if (i == 0) {
max = m[i];
min = m[i];
} else {
if (max < m[i])
max = m[i];
if (min > m[i])
min = m[i];
}
sum = s... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 147 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, tmp;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = a[0];
int max = a[0];
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (a[i] <... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, tmp;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = a[0];
int max = a[0];
long int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (a... | [["+", 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 | 146 |
#include <iostream>
using namespace std;
int main(void) {
int n;
int min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (max < a) {
max = a;
}
sum += a;
if (min > a) {
min = a;
}
}
cout << min << " " << max << " " << su... | #include <iostream>
using namespace std;
int main(void) {
int n;
int min = 1000000, max = -1000000;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (max < a) {
max = a;
}
sum += a;
if (min > a) {
min = 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], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 1 | 102 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int total = 0;
for (int i = 0; i < n; i++) {
total += a[i];
}
int mi = a[0], ma = a[0];
for (int i = 1; i < n; i++) {
ma = max(ma, ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long total = 0;
for (int i = 0; i < n; i++) {
total += a[i];
}
int mi = a[0], ma = a[0];
for (int i = 1; i < n; i++) {
ma = ma... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 154 |
#include <iostream>
using namespace std;
int main() {
int n, mx, mn, s = 0;
int *ns;
cin >> n;
ns = new int[n];
for (int i = 0; i < n; ++i) {
cin >> ns[i];
s += ns[i];
if (i == 0) {
mx = mn = ns[0];
continue;
}
mx = mx < ns[i] ? ns[i] : mx;
mn = mn > ns[i] ? ns[i] : mn;
... | #include <iostream>
using namespace std;
int main() {
int n, mx, mn;
long s = 0;
int *ns;
cin >> n;
ns = new int[n];
for (int i = 0; i < n; ++i) {
cin >> ns[i];
s += ns[i];
if (i == 0) {
mx = mn = ns[0];
continue;
}
mx = mx < ns[i] ? ns[i] : mx;
mn = mn > ns[i] ? ns[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 | 138 |
#include <iostream>
using namespace std;
int N, A[10010];
int min() {
int n, minn = A[0];
for (n = 0; n < N; ++n) {
if (minn > A[n])
minn = A[n];
}
return minn;
}
int max() {
int maxx = A[0];
for (int n = 0; n < N; ++n) {
if (maxx < A[n])
maxx = A[n];
}
return maxx;
}
int sum() {
l... | #include <iostream>
using namespace std;
int N, A[10010];
int min() {
int n, minn = A[0];
for (n = 0; n < N; ++n) {
if (minn > A[n])
minn = A[n];
}
return minn;
}
int max() {
int maxx = A[0];
for (int n = 0; n < N; ++n) {
if (maxx < A[n])
maxx = A[n];
}
return maxx;
}
long long sum()... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 214 |
#include <iostream>
using namespace std;
int main() {
int n, min = 9999999, max = -1000000, sum = 0, su;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> su;
if (su < min)
min = su;
if (su > max)
max = su;
sum += su;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, min = 9999999, max = -1000000, su;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> su;
if (su < min)
min = su;
if (su > max)
max = su;
sum += su;
}
cout << min << " " << max << " " << sum << endl;
... | [["+", 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 | 98 |
#include <iostream>
using namespace std;
int N, A[10000];
int min(int n, int a[]) {
int i;
int min = a[0];
for (i = 1; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
}
return min;
}
int max(int n, int a[]) {
int i;
int max = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max) {
max = ... | #include <iostream>
using namespace std;
int N, A[100000];
int min(int n, int a[]) {
int i;
int min = a[0];
for (i = 1; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
}
return min;
}
int max(int n, int a[]) {
int i;
int max = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max) {
max =... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 246 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
signed main() {
int a;
cin >> a;
int b, c, d;
b = 10000000;
c = -10000000;
d = 0;
for (int e = 0; e < a; e++) {
int f;
cin >> f;
d += f;
b = min(b, f);
c = max(c, f);
}
cout << b << "... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define int long long
using namespace std;
signed main() {
int a;
cin >> a;
int b, c, d;
b = 10000000;
c = -10000000;
d = 0;
for (int e = 0; e < a; e++) {
int f;
cin >> f;
d += f;
b = min(b, f);
c = max(c, f)... | [["+", 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]] | 1 | 107 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long
#define FOR(i, a, b) for (lli i = (a); i < (b); i++)
#define REP(i, n) for (lli i = 0; i < (n); i++)
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define INF INT_MAX / 3
#define PB push_back
#define pb push_back
#define all(a) (a).begin(), (a), en... | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define FOR(i, a, b) for (lli i = (a); i < (b); i++)
#define REP(i, n) for (lli i = 0; i < (n); i++)
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define INF INT_MAX / 3
#define PB push_back
#define pb push_back
#define all(a) (a).begin(), (a), en... | [["-", 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 | 151 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 2000000;
int max = -2000000;
int sum = 0;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
if (k < min)
min = k;
if (k > max)
max = k;
sum += k;
}
cout << min << " " << max << " " << sum << ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 2000000;
int max = -2000000;
long long int sum = 0;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
if (k < min)
min = k;
if (k > max)
max = k;
sum += k;
}
cout << min << " " << max << " " ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
#include <iomanip>
#include <iostream>
#define PI 3.14159265359
using namespace std;
int main() {
int n, c, max, min, sum;
cin >> n >> max;
min = max;
sum = max;
for (int i = 1; i < n; i++) {
cin >> c;
if (c > max)
max = c;
if (c < min)
min = c;
sum += c;
}
cout << min << " ... | #include <iomanip>
#include <iostream>
#define PI 3.14159265359
using namespace std;
int main() {
int n, c, max, min;
long long sum;
cin >> n >> max;
min = max;
sum = max;
for (int i = 1; i < n; i++) {
cin >> c;
if (c > max)
max = c;
if (c < min)
min = c;
sum += c;
}
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 | 104 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0;
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
int max = a[0];
for (int i = 1; i < n; i++) {
if (max < a[i])
max = a[i];
}
int mi... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0;
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
int max = a[0];
for (int i = 1; i < n; i++) {
if (max < a[i])
max = a[i];
}
int mi... | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 177 |
#include <cstdio>
using namespace std;
using i64 = long long;
int main() {
size_t n;
scanf("%zu", &n);
int min_ = 1000000, max_ = -1000000;
i64 sum = 0;
for (size_t i = 0; i < n; ++i) {
int a;
scanf("%d", &a);
if (min_ > a)
min_ = a;
if (max_ < a)
max_ = a;
sum += a;
}... | #include <cstdio>
using namespace std;
using i64 = long long;
int main() {
size_t n;
scanf("%zu", &n);
int min_ = 1000000, max_ = -1000000;
i64 sum = 0;
for (size_t i = 0; i < n; ++i) {
int a;
scanf("%d", &a);
if (min_ > a)
min_ = a;
if (max_ < a)
max_ = a;
sum += a;
}... | [["-", 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 input, data;
int max = -1000001, min = 1000001, sum = 0;
cin >> input;
const int num = input;
for (int i = 0; i < num; i++) {
cin >> data;
if (data > max) {
max = data;
}
if (data < min) {
min = data;
}
sum ... | #include <iostream>
using namespace std;
int main() {
long long input, data;
long long max = -1000001, min = 1000001, sum = 0;
cin >> input;
const int num = input;
for (int i = 0; i < num; i++) {
cin >> data;
if (data > max) {
max = data;
}
if (data < min) {
min = data;
... | [["-", 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 <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, a;
int max = -1000000, min = 1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, a;
int max = -1000000, min = 1000000;
long int sum = 0;
cin >> n;
for (int i =... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 118 |
#include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, min = INT_MAX, max = INT_MIN, sum = 0, tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
min = std::min(min, tmp);
max = std::max(max, tmp);
sum += tmp;
}
cout << min << ' ' << max ... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, min = INT_MAX, max = INT_MIN, tmp;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
min = std::min(min, tmp);
max = std::max(max, tmp);
sum += tmp;
}
cout << min <<... | [["+", 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 | 104 |
#include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
int sum = 0;
int min = 99999999;
int max = -99999999;
for (int i = 0; i < n; i++) {
cin >> a;
sum = sum + a;
if (min > a)
min = a;
if (max < a)
max = a;
}
cout << min << " " << max << " " << sum << end... | #include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
long long int sum = 0;
int min = 9999999999;
int max = -9999999999;
for (int i = 0; i < n; i++) {
cin >> a;
sum = sum + a;
if (min > a)
min = a;
if (max < a)
max = a;
}
cout << min << " " << max << " "... | [["+", 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 | 103 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> v;
int a;
while (cin >> a)
v.push_back(a);
cout << *min_element(v.begin(), v.end()) << " "
<< *max_element(v.be... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> v;
int a;
while (cin >> a)
v.push_back(a);
cout << *min_element(v.begin(), v.end()) << " "
<< *max_element(v.be... | [["+", 31, 16, 12, 2, 3, 4, 0, 74, 0, 24], ["+", 3, 4, 0, 74, 39, 77, 39, 86, 0, 96], ["+", 31, 16, 12, 2, 3, 4, 0, 74, 0, 25]] | 1 | 124 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i = 0;
cin >> n;
vector<long long> a(n);
while (i != n) {
cin >> a[i++];
}
sort(a.begin(), a.end());
cout << a[0] << " " << a[n - 1] << " " << accumulate(a.begin(), a.end(), 0)
<< endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i = 0;
cin >> n;
vector<long long> a(n);
while (i != n) {
cin >> a[i++];
}
sort(a.begin(), a.end());
cout << a[0] << " " << a[n - 1] << " " << accumulate(a.begin(), a.end(), 0LL)
<< endl;
} | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 106 |
#include <iostream>
int main(int argc, char const *argv[]) {
int n = 0, x = 0, min = 10000000, max = -10000000, sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> x;
if (x < min)
min = x;
if (x > max)
max = x;
sum += x;
}
std::cout << min << " " << max << " " << s... | #include <iostream>
int main(int argc, char const *argv[]) {
int n = 0, x = 0, min = 10000000, max = -10000000;
long long sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> x;
if (x < min)
min = x;
if (x > max)
max = x;
sum += x;
}
std::cout << min << " " << max... | [["-", 0, 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 | 115 |
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
void MMS(int *a, int n) {
int k = a[0];
int l = a[0];
long long int sum = a[0];
for (int i = 1; i < n; i++) {
if (k < a[i]) {
k = a[i];
}
if (l > a[i]) {
l = a[i];
}
sum += a[i];
}
printf("%d %d %d\n", l, k, sum);
}
... | #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
void MMS(int *a, int n) {
int k = a[0];
int l = a[0];
signed long long int sum = a[0];
for (int i = 1; i < n; i++) {
if (k < a[i]) {
k = a[i];
}
if (l > a[i]) {
l = a[i];
}
sum += a[i];
}
printf("%d %d %ld\n", l, k, s... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 156], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 201 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
int x0;
int x;
cin >> n;
cin >> x0;
int min = x0;
int max = x0;
int sum = x0;
for (int i = 1; i < n; i++) {
cin >> x;
sum += x;
if (min > x) {
min = x;
}
if (max < x) {
max = x;
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
int x0;
int x;
cin >> n;
cin >> x0;
int min = x0;
int max = x0;
long int sum = x0;
for (int i = 1; i < n; i++) {
cin >> x;
sum += x;
if (min > x) {
min = x;
}
if (max < x) {
max = x;... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 115 |
#include <cassert>
#include <iostream>
#include <math.h>
using namespace std;
int return_min(int a[], int n);
int return_max(int a[], int n);
int return_sum(int a[], int n);
int main() {
int n, a[10000];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
cout << return_min(a, n) << " " << return_m... | #include <cassert>
#include <iostream>
#include <math.h>
using namespace std;
int return_min(int a[], int n);
int return_max(int a[], int n);
long return_sum(int a[], int n);
int main() {
int n, a[10000];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
cout << return_min(a, n) << " " << return_... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]] | 1 | 271 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, a[10000 + 10];
int min(int a, int b) {
if (a <= b)
return a;
return b;
}
int max(int a, int b) {
if (a >= b)
return a;
return b;
}
int compm(int n) {
if (n == 0)
return a[0];
return min(a[n - 1], compm(n - 1));
}
int compM... | #include <algorithm>
#include <iostream>
using namespace std;
int n, a[10000 + 10];
int min(int a, int b) {
if (a <= b)
return a;
return b;
}
int max(int a, int b) {
if (a >= b)
return a;
return b;
}
int compm(int n) {
if (n == 0)
return a[0];
return min(a[n - 1], compm(n - 1));
}
int compM... | [["-", 0, 37, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 37, 0, 2, 3, 4, 0, 2, 63, 22]] | 1 | 231 |
#include <stdio.h>
int main(void)
{
int n;
int x;
int num;
int min = 1000001;
int max = -1000001;
long total = 0;
scanf("%d", &n);
for (x = 0; x < n; x++) {
scanf("%d", &num);
if (min > num)
min = num;
if (max < num)
max = num;
total += num;
}
printf("%d %d... | #include <stdio.h>
int main(void)
{
int n;
int x;
int num;
int min = 1000001;
int max = -1000001;
long total = 0;
scanf("%d", &n);
for (x = 0; x < n; x++) {
scanf("%d", &num);
if (min > num)
min = num;
if (max < num)
max = num;
total += num;
}
printf("%d %d... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 109 |
#include <iostream>
using namespace std;
int main(void) {
int N, inputNum;
int min = 1000000;
int max = -1000001;
int sum = 0;
cin >> N;
while (N-- > 0) {
cin >> inputNum;
if (max < inputNum)
max = inputNum;
if (min > inputNum)
min = inputNum;
sum += inputNum;
}
cout << m... | #include <iostream>
using namespace std;
int main(void) {
long N, inputNum;
long min = 1000000;
long max = -1000001;
long sum = 0;
cin >> N;
while (N-- > 0) {
cin >> inputNum;
if (max < inputNum)
max = inputNum;
if (min > inputNum)
min = inputNum;
sum += inputNum;
}
cout ... | [["-", 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() {
long a[10000], saidai, saisyou, goukei, n, i, b, c, d, e;
saidai = 0;
saisyou = 1000000;
goukei = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b = a[i];
c = a[i];
goukei = goukei + a[i];
if (saidai < a[i]) {
swap(saidai, ... | #include <iostream>
using namespace std;
int main() {
long a[10000], saidai, saisyou, goukei, n, i, b, c, d, e;
saidai = -1000000;
saisyou = 1000000;
goukei = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b = a[i];
c = a[i];
goukei = goukei + a[i];
if (saidai < a[i]) {
swap(s... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 154 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 10000000;
int max = -10000000;
int sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum = sum + a;
}
cout << min << " "... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 999999999;
int max = -999999999;
long long int sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum = sum + a;
}
cout <... | [["-", 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 | 106 |
#include <iostream>
using namespace std;
int main() {
int n = 0;
int min, max, sum = 0;
cin >> n;
cin >> min;
sum = max = min;
for (int i = 1; i < n; i++) {
int m;
cin >> m;
if (m < min)
min = m;
if (m > max)
max = m;
sum += m;
}
cout << min << " " << max << " " << sum... | #include <iostream>
using namespace std;
int main() {
int n = 0;
int min = 0, max = 0;
long sum = 0;
cin >> n;
cin >> min;
sum = max = min;
for (int i = 1; i < n; i++) {
int m;
cin >> m;
if (m < min)
min = m;
if (m > max)
max = m;
sum += m;
}
cout << min << " " << ma... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <iostream>
using namespace std;
int main() {
int a, bigger, smaller, total;
int Array[10000];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> Array[i];
}
bigger = Array[0];
for (int i = 1; i < a; i++) {
if (bigger < Array[i]) {
bigger = Array[i];
}
}
smaller = Array[0];
for... | #include <iostream>
using namespace std;
int main() {
int a, bigger, smaller;
long total;
int Array[10000];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> Array[i];
}
bigger = Array[0];
for (int i = 1; i < a; i++) {
if (bigger < Array[i]) {
bigger = Array[i];
}
}
smaller = Array[0]... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 183 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
int total = 0;
int max = -1000001, min = 10000001;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
total += a[i];
}
cout << min << ' ' << max <<... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
long long int total = 0;
long long int max = -10000001, min = 10000001;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
total += a[i];
}
cout <<... | [["+", 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 | 122 |
#include <cstdio>
int main(void) {
int a;
int b;
int c;
int n;
int x;
scanf("%d", &n);
scanf("%d", &x);
a = x;
b = x;
c = x;
for (int i = 1; i < n; i++) {
scanf("%d", &x);
if (a > x)
a = x;
if (b < x)
b = x;
c = c + x;
}
printf("%d %d %d\n", a, b, c);
return 0;
} | #include <cstdio>
int main(void) {
int a;
int b;
long long c;
int n;
int x;
scanf("%d", &n);
scanf("%d", &x);
a = x;
b = x;
c = x;
for (int i = 1; i < n; i++) {
scanf("%d", &x);
if (a > x)
a = x;
if (b < x)
b = x;
c = c + x;
}
printf("%d %d %lld\n", a, b, c);
retu... | [["-", 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 | 125 |
#include <iostream>
int main(void) {
int max = -2147483647, min = 2147483647, sum = 0, i, j, k;
std::cin >> i;
for (j = 0; j < i; j++) {
std::cin >> k;
if (min > k)
min = k;
if (max < k)
max = k;
sum += k;
}
std::cout << min << ' ' << max << ' ' << sum << std::endl;
return 0;
} | #include <iostream>
int main(void) {
long long int max = -2147483647, min = 2147483647, sum = 0, i, j, k;
std::cin >> i;
for (j = 0; j < i; j++) {
std::cin >> k;
if (min > k)
min = k;
if (max < k)
max = k;
sum += k;
}
std::cout << min << ' ' << max << ' ' << sum << std::endl;
re... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 104 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, mi, ma, sum = 0;
cin >> n;
vector<int> a(n, 0);
rep(i, n) {
cin >> a[i];
if (i == 0) {
ma = a[i];
mi = a[i];
}
sum += a[i];
ma = max(ma, a[i]);
mi = min(mi, a[i]);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long long n, mi, ma, sum = 0LL;
cin >> n;
vector<long long> a(n, 0);
rep(i, n) {
cin >> a[i];
if (i == 0) {
ma = a[i];
mi = a[i];
}
sum += a[i];
ma = max(ma, a[i]);
mi = m... | [["-", 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], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 132 |
#include <stdio.h>
int main() {
int i, n, max, min, sum;
scanf("%d", &n);
int a[10000];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
max = a[0];
min = a[0];
sum = 0;
for (i = 0; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = a[i];
}
sum = ... | #include <stdio.h>
int main() {
long long int i, n, max, min, sum;
scanf("%d", &n);
int a[10000];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
max = a[0];
min = a[0];
sum = 0;
for (i = 0; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = 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 | 158 |
#include <stdio.h>
int main() {
int n, i, max, min;
int a[10000];
int sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d ", &a[i]);
}
max = a[0];
min = a[0];
for (i = 0; i < n; i++) {
sum = sum + a[i];
if (a[i] >= max) {
max = a[i];
} else if (a[i] <= min) {
... | #include <stdio.h>
int main() {
int n, i, max, min;
int a[10000];
long int sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d ", &a[i]);
}
max = a[0];
min = a[0];
for (i = 0; i < n; i++) {
sum = sum + a[i];
if (a[i] >= max) {
max = a[i];
} else if (a[i] <= min) {
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 158 |
#include <stdio.h>
int main(void) {
long int n, a[10000], i, min = 0, max = 0, sum;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sum = a[0];
for (i = 1; i < n; i++) {
if (a[min] > a[i]) {
min = i;
}
if (a[max] < a[i]) {
max = i;
}
sum = sum + a[i];... | #include <stdio.h>
int main(void) {
long int n, a[10000], i, min = 0, max = 0, sum;
scanf("%ld", &n);
for (i = 0; i < n; i++) {
scanf("%ld", &a[i]);
}
sum = a[0];
for (i = 1; i < n; i++) {
if (a[min] > a[i]) {
min = i;
}
if (a[max] < a[i]) {
max = i;
}
sum = sum + a[i... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 158 |
'''
ITP-1_4-C
?¨???????
???????????´??° a, b ??¨?????????????????? op ?????????????????§???a op b ????¨??????????????????°?????????????????????????????????
????????????????????? op ??????"+"(???)???"-"(???)???"*"(???)???"/"(???)???????????¨?????????????????§????????????????????´?????????
?°???°?????\??????????????¨???... | '''
ITP-1_4-C
?¨???????
???????????´??° a, b ??¨?????????????????? op ?????????????????§???a op b ????¨??????????????????°?????????????????????????????????
????????????????????? op ??????"+"(???)???"-"(???)???"*"(???)???"/"(???)???????????¨?????????????????§????????????????????´?????????
?°???°?????\??????????????¨???... | [["-", 8, 196, 0, 57, 15, 666, 0, 557, 0, 654], ["+", 8, 196, 0, 57, 15, 666, 0, 557, 0, 654], ["-", 8, 196, 0, 57, 15, 666, 0, 557, 0, 655], ["+", 8, 196, 0, 57, 15, 666, 0, 557, 0, 655], ["-", 0, 57, 75, 665, 15, 666, 0, 557, 0, 654], ["+", 0, 57, 75, 665, 15, 666, 0, 557, 0, 654], ["-", 0, 57, 75, 665, 15, 666, 0, 5... | 5 | 118 |
#include <iostream>
using namespace std;
int main() {
int m, i, n, min, max, sum = 0;
min = 1000001;
max = -1000001;
cin >> m;
for (i = 1; i <= m; i++) {
cin >> n;
sum = sum + n;
if (n < min)
min = n;
if (n > max)
max = n;
}
cout << min << ' ' << max << ' ' << sum << endl;
r... | #include <iostream>
using namespace std;
int main() {
long long int m, i, n, min, max, sum = 0;
min = 1000001;
max = -1000001;
cin >> m;
for (i = 1; i <= m; i++) {
cin >> n;
sum = sum + n;
if (n < min)
min = n;
if (n > max)
max = n;
}
cout << min << ' ' << max << ' ' << sum <<... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int s[n];
REP(i, n) cin >> s[i];
long int min = *min_element(s, s + n);
long int max = *ma... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int s[n];
REP(i, n) cin >> s[i];
long int min = *min_element(s, s + n);
long int max = *ma... | [["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13]] | 1 | 118 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v;
int... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v;
int... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 126 |
#include <iostream>
using namespace std;
int main() {
int n, a;
int s = 0;
int l = 0;
int m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0 || a < s) {
s = a;
}
if (i == 0 || a > l) {
l = a;
}
m += a;
}
cout << s << " " << l << " " << m << endl;
re... | #include <iostream>
using namespace std;
int main() {
long n, a;
long s = 0;
long l = 0;
long m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0 || a < s) {
s = a;
}
if (i == 0 || a > l) {
l = a;
}
m += a;
}
cout << s << " " << l << " " << m << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 113 |
#include <iostream>
#include <string>
#include <vector>
int max(int x, int y) {
if (x > y) {
return x;
} else
return y;
}
int min(int s, int t) {
if (s < t) {
return s;
} else
return t;
}
using namespace std;
int main() {
int a;
cin >> a;
int num, sum, b, c;
b = -1000000;
c = 1000000;
... | #include <iostream>
#include <string>
#include <vector>
int max(int x, int y) {
if (x > y) {
return x;
} else
return y;
}
int min(int s, int t) {
if (s < t) {
return s;
} else
return t;
}
using namespace std;
int main() {
int a;
cin >> a;
long long num, sum, b, c;
b = -1000000;
c = 100... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 156 |
#include <bits/stdc++.h>
using namespace std;
int x[10003] = {};
int main() {
int a, sum = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> x[i];
sum += x[i];
}
sort(x, x + a);
cout << x[0] << " " << x[a - 1] << " " << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int x[10003] = {};
int main() {
long long a, sum = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> x[i];
sum += x[i];
}
sort(x, x + a);
cout << x[0] << " " << x[a - 1] << " " << sum << endl;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 97 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int sum = 0;
int A[10000];
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
}
sort(A, A + n);
cout << A[0] << " " << A[n - 1] << " " << sum << "\n";
}
return 0;... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
long long sum = 0;
int A[10000];
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
}
sort(A, A + n);
cout << A[0] << " " << A[n - 1] << " " << sum << "\n";
}
ret... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 106 |
#include <iostream>
using namespace std;
int main() {
int n, a[10000];
long long max = -10000, min = 10000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) {
min = a[i];
}
sum += a[i];
}
cout << min << ' ' << m... | #include <iostream>
using namespace std;
int main() {
int n, a[10000];
long long max = -1000000, min = 1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) {
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]] | 1 | 122 |
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n, min, max, sum = 0;
cin >> n;
int a[10000];
cin >> a[0];
min = a[0];
max = a[0];
sum += a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
if (a[i] < min)
min = a[i];
if (a[i] > max)
m... | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
long int n, min, max, sum = 0;
cin >> n;
int a[10000];
cin >> a[0];
min = a[0];
max = a[0];
sum += a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
if (a[i] < min)
min = a[i];
if (a[i] > max)
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 145 |
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int num, sum = 0;
int min = 99999999, max = -99999999;
vector<int> takepon;
cin >> num;
for (int i = 0; i < num; i++) {
int temp;
cin >> temp;
... | #include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int num;
int64_t sum = 0;
int min = 99999999, max = -99999999;
vector<int> takepon;
cin >> num;
for (int i = 0; i < num; i++) {
int temp;
cin >>... | [["-", 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 | 193 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[10000] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
cout << a[0]... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[10000] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
cout << a[0... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 120 |
#include <iostream>
int main(void) {
int a, n;
int ans_min, ans_max, ans_sum;
char deli = ' ';
ans_min = 1000000;
ans_max = -1000000;
ans_sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a;
ans_sum += a;
if (ans_min > a) {
ans_min = a;
}
if (ans_max < a) {
... | #include <iostream>
int main(void) {
int a, n;
int ans_min, ans_max;
long int ans_sum;
char deli = ' ';
ans_min = 1000000;
ans_max = -1000000;
ans_sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a;
ans_sum += a;
if (ans_min > a) {
ans_min = a;
}
if (ans_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 | 117 |
// itp1_topic4_d
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[10000];
for (int i = 0; i < n; i++)
cin >> a[i];
int mn = a[0], mx = a[0], sum = 0;
for (int i = 0; i < n; i++) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
sum += a[i];
}
cout << mn << "... | // itp1_topic4_d
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[10000];
for (int i = 0; i < n; i++)
cin >> a[i];
int mn = a[0], mx = a[0];
long long sum = 0;
for (int i = 0; i < n; i++) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
sum += a[i];
}
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 | 134 |
#include <iostream>
using namespace std;
int main() {
int n, c, max, min, sum;
max = -1000000;
min = 1000000;
sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
if (c > max)
max = c;
if (c < min)
min = c;
sum += c;
}
cout << min << " " << max << " " << sum << endl;
... | #include <iostream>
using namespace std;
int main() {
int n, c, max, min;
long long int sum;
max = -1000000;
min = 1000000;
sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
if (c > max)
max = c;
if (c < min)
min = c;
sum += c;
}
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], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 104 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[1000];
for (int i = 0; i < n; i++)
cin >> a[i];
int mn = a[0];
int mx = a[0];
long long sum = 0;
for (int i = 0; i < n; i++) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
sum += a[i];
}
cout << mn << " " <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[10000];
for (int i = 0; i < n; i++)
cin >> a[i];
int mn = a[0];
int mx = a[0];
long long sum = 0;
for (int i = 0; i < n; i++) {
mn = min(mn, a[i]);
mx = max(mx, a[i]);
sum += a[i];
}
cout << mn << " " ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 136 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, s;
l = 0;
s = 1000000;
long long sum = 0;
cin >> n;
int a[10000];
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
l = max(l, a[i]);
s = min(s, a[i]);
}
cout << s << " " << l << " " << sum << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, s;
l = -10000000000;
s = 100000000000;
long long sum = 0;
cin >> n;
int a[10000];
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
l = max(l, a[i]);
s = min(s, a[i]);
}
cout << s << " " << l << " " << s... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 120 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, Min, Max, Sam, tmp;
cin >> n;
Max = -1000001;
Min = 1000001;
Sam = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
Sam += tmp;
Max = max(Max, tmp);
Min = min(Min, tmp);
}
cout << Min << " " << Max << " " << Sam << "\n";
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, Min, Max, tmp;
cin >> n;
Max = -1000001;
Min = 1000001;
long long Sam = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
Sam += tmp;
Max = max(Max, tmp);
Min = min(Min, tmp);
}
cout << Min << " " << Max << " " << Sam << "... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, a[10000];
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
int min, max, sum;
min = a[0];
max = a[0];
sum = a[0];
for (i = 1; i < n; i++) {
if (min > a[i]) {
min = a[i];
}
if (max < a[i]) {
max = a[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, a[10000];
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
int min, max;
long sum;
min = a[0];
max = a[0];
sum = a[0];
for (i = 1; i < n; i++) {
if (min > a[i]) {
min = a[i];
}
if (max < a[i]) {
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 | 152 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int max = a[0], min = a[0], sum = 0;
for (int i = 0; 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;
cin >> n;
long *a = new long[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
long max = a[0], min = a[0], sum = 0;
for (int i = 0; i < n; ++i) {
if (max < a[i]) {
max = a[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], ["-", 8, 9, 0, 43, 49, 50, 51, 350, 39, 40], ["+", 0, 43, 49, 50, 51, 350, 39, 86, 0, 96]] | 1 | 151 |
#include <iostream>
using namespace std;
int main() {
int n, sum, min, max, i;
cin >> n;
int a[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];
}
if (a[i] > max) {
max = a[i];
}
... | #include <iostream>
using namespace std;
int main() {
long long n, sum, min, max;
int i;
cin >> n;
int a[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];
}
if (a[i] > max) {
max = a[i]... | [["-", 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 | 157 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b = -1000000, c = 1000000, n, i, sum = 0;
do {
cin >> n;
} while (n < 0 && n <= 10000);
for (i = 1; i <= n; i++) {
do {
cin >> a;
} while (n <= -1000000 && a <= 1000000);
if (a >= b) {
b = a;
}
if (a <= c) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b = -1000000, c = 1000000, n, i, sum = 0;
do {
cin >> n;
} while (n < 0 && n <= 10000);
for (i = 1; i <= n; i++) {
do {
cin >> a;
} while (n <= -1000000 && a <= 1000000);
if (a >= b) {
b = a;
}
if (a <= c) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 130 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, min, max, ave = 0;
int x;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x;
if (i == 0) {
min = x;
max = x;
}
if (min > x) {
min = x;
}
if (max < x) {
max = x;
}
ave += x;
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, min, max;
long ave = 0;
int x;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x;
if (i == 0) {
min = x;
max = x;
}
if (min > x) {
min = x;
}
if (max < x) {
max = x;
}
ave += x;
}... | [["-", 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 | 115 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A[10000];
int B, max, min;
int C = 0;
cin >> B;
for (int i = 0; i < B; i++) {
cin >> A[i];
}
max = A[0];
min = A[0];
for (int i = 0; i < B; i++) {
if (max < A[i]) {
max = A[i];
}
if (min > A[i]) {
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A[10000];
int B, max, min;
long C = 0;
cin >> B;
for (int i = 0; i < B; i++) {
cin >> A[i];
}
max = A[0];
min = A[0];
for (int i = 0; i < B; i++) {
if (max < A[i]) {
max = A[i];
}
if (min > A[i]) {... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 171 |
#include <iostream>
using namespace std;
int main() {
int n, tmp, sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[j] > a[j + 1]) {
tmp = a[j + 1];
a[j + 1] = a[j];
a[j] = t... | #include <iostream>
using namespace std;
int main() {
long n, tmp, sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (a[j] >= a[j + 1]) {
tmp = a[j + 1];
a[j + 1] = a[j];
a[... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 184 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i;
long long ans[n];
for (i = 0; i < n; i++) {
cin >> ans[i];
}
sort(ans, ans + n);
int sum = 0;
for (i = 0; i < n; i++) {
sum = sum + ans[i];
}
cout << ans[0] << " " << ans[n - 1] << " " << sum << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i;
long long ans[n];
for (i = 0; i < n; i++) {
cin >> ans[i];
}
sort(ans, ans + n);
long long sum = 0;
for (i = 0; i < n; i++) {
sum = sum + ans[i];
}
cout << ans[0] << " " << ans[n - 1] << " " << sum << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 118 |
#include <iostream>
using namespace std;
int main(void) {
int max = -1000000, min = 10000000, sum = 0, n, tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (max < tmp)
max = tmp;
if (min > tmp)
min = tmp;
sum += tmp;
}
cout << min << " " << max << " " << sum << endl;
re... | #include <iostream>
using namespace std;
int main(void) {
long int max = -1000000, min = 10000000, sum = 0, n, tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (max < tmp)
max = tmp;
if (min > tmp)
min = tmp;
sum += tmp;
}
cout << min << " " << max << " " << sum << endl;... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 99 |
#include "iostream"
using namespace std;
#include <stdio.h>
int main(int argc, char const *argv[]) {
int n = 0;
int buf = 0;
int min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> buf;
if (buf < min) {
min = buf;
}
if (buf > max) {
max = buf;... | #include "iostream"
using namespace std;
#include <stdio.h>
int main(int argc, char const *argv[]) {
int n = 0;
int buf = 0;
long int min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> buf;
if (buf <= min) {
min = buf;
}
if (buf >= max) {
max... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 123 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int a, c = 0;
cin >> a;
vector<int> vec(a);
for (int i = 0; i < a; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < a; i++) {
c += vec.at(i);
}
cout << vec.at(0) << " " << vec.a... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long a, c = 0;
cin >> a;
vector<long> vec(a);
for (long i = 0; i < a; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (long i = 0; i < a; i++) {
c += vec.at(i);
}
cout << vec.at(0) << " " << v... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]] | 1 | 132 |
/**
* MinMaxSum.cpp
* Create:20180420
* Description:n個の整数を入力し、最小値・最大値・合計値を求めるプログラム。
*/
#include <iostream>
#include <limits.h>
#include <sstream>
#include <vector>
int main(int argc, char *argv[]) {
std::vector<int> vec; // 値を格納する配列
int n; // 値を格納する数量
std::cin >> n;
// スペース区切りで値を格納する
for... | /**
* MinMaxSum.cpp
* Create:20180420
* Description:n個の整数を入力し、最小値・最大値・合計値を求めるプログラム。
*/
#include <iostream>
#include <limits.h>
#include <sstream>
#include <vector>
int main(int argc, char *argv[]) {
std::vector<int> vec; // 値を格納する配列
int n; // 値を格納する数量
std::cin >> n;
// スペース区切りで値を格納する
for... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 155 |
#include <cstdio>
#define ll long long int
int main(void) {
int n;
scanf("%d", &n);
int max = 0;
int min = 1000001;
ll sum = 0;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
if (max < a)
max = a;
if (min > a)
min = a;
sum += a;
}
printf("%d %d %lld\n", min, max, ... | #include <cstdio>
#define ll long long int
int main(void) {
int n;
scanf("%d", &n);
int max = -1000001;
int min = 1000001;
ll sum = 0;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
if (max < a)
max = a;
if (min > a)
min = a;
sum += a;
}
printf("%d %d %lld\n", min... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 110 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctype.h>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctype.h>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 185 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i <= n - 1; i++)
cin >> a[i];
int min = a[0], max = a[0], sum = 0;
for (int i = 0; i <= n - 1; i++) {
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
sum += a[i];
}
cout <... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long a[n];
for (int i = 0; i <= n - 1; i++)
cin >> a[i];
long min = a[0], max = a[0], sum = 0;
for (int i = 0; i <= n - 1; i++) {
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
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 | 145 |
#include <iostream>
using namespace std;
int main() {
int a[10000], n, b, c = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (a[j] > a[j + 1]) {
b = a[j];
a[j] = a[j + 1];
a[j + 1] = b;
... | #include <iostream>
using namespace std;
int main() {
int a[10000], n, b;
long long c = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (a[j] > a[j + 1]) {
b = a[j];
a[j] = a[j + 1];
a[j + 1]... | [["-", 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 | 180 |
#include <iostream>
using namespace std;
int main(void) {
int n, i, x, min, max, sum;
cin >> n;
min = 1000000;
max = -1000000;
sum = 0;
for (i = 0; i < n; i++) {
cin >> x;
if (x < min)
min = x;
if (x > max)
max = x;
sum += x;
}
cout << min << " " << max << " " << sum << endl... | #include <iostream>
using namespace std;
int main(void) {
long long n, i, x, min, max, sum;
cin >> n;
min = 1000000;
max = -1000000;
sum = 0;
for (i = 0; i < n; i++) {
cin >> x;
if (x < min)
min = x;
if (x > max)
max = x;
sum += x;
}
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 <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define INF 900000000
using namespace std;
int main() {
int i = 0, n, k = 0, mi, ma;
cin >> n;
while (i < n) {
int a;
cin >> a;
i += 1;
k += a;
if (i == 1) {
mi = a;
ma = a;
}
el... | #include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define INF 900000000
using namespace std;
int main() {
long long i = 0, n, k = 0, mi, ma;
cin >> n;
while (i < n) {
long long a;
cin >> a;
i += 1;
k += a;
if (i == 1) {
mi = a;
ma = a;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 123 |
#include <iostream>
using namespace std;
int main() {
int count;
cin >> count;
int input;
cin >> input;
int min = input;
int max = input;
int average = input;
for (int i = 0; i < count - 1; i++) {
int input;
cin >> input;
average += input;
if (min > input)
min = input;
if (... | #include <iostream>
using namespace std;
int main() {
int count;
cin >> count;
int input;
cin >> input;
int min = input;
int max = input;
long average = input;
for (int i = 0; i < count - 1; i++) {
int input;
cin >> input;
average += input;
if (min > input)
min = input;
if ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 108 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
#define PI 3.14159265359
using namespace std;
int main() {
int n;
cin >> n;
int min = 0;
int max = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (min > a || i ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
#define PI 3.14159265359
using namespace std;
int main() {
int n;
cin >> n;
long min = 0;
long max = 0;
long sum = 0;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
if (min > a |... | [["-", 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 | 123 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int n, a, min, max, i;
double m = 0;
int kan[10000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
kan[i] = a;
m = m + a;
a = 0;
}
sort(kan, kan + n);
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int n, a, min, max, i;
long m = 0;
int kan[10001];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
kan[i] = a;
m = m + a;
a = 0;
}
sort(kan, kan + n);
mi... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 128 |
#include <iostream>
using namespace std;
int a[10005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
long long mx = 1145141919;
for (int i = 0; i < n; i++) {
if (mx > a[i]) {
mx = a[i];
}
}
long long tu = -1111111111;
for (int i = 0; i < n; i++) {
if (t... | #include <iostream>
using namespace std;
int a[10005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
long long mx = 1145141919;
for (int i = 0; i < n; i++) {
if (mx > a[i]) {
mx = a[i];
}
}
long long tu = -1111111111;
for (int i = 0; i < n; i++) {
if (t... | [["-", 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, 49, 50, 49, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22]] | 1 | 181 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, vol, N;
long long max, min;
cin >> N;
max = -10000000;
min = 10000000;
vol = 0;
for (int i = 0; i < N; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
vol += a;
}
cout << min << " ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, N;
long long max, min, vol;
cin >> N;
max = -10000000;
min = 10000000;
vol = 0;
for (int i = 0; i < N; i++) {
cin >> a;
if (a > max)
max = a;
if (a < min)
min = a;
vol += 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, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 105 |
#include <bits/stdc++.h>
int main() {
int n, a[10000], min = 1000000, max = -1000000, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
min = std::min(min, a[i]);
max = std::max(max, a[i]);
sum += a[i];
}
printf("%d %d %d\n", min, max, sum);
return 0;
}
| #include <bits/stdc++.h>
int main() {
int n, a[10000], min = 1000000, max = -1000000;
long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
min = std::min(min, a[i]);
max = std::max(max, a[i]);
sum += a[i];
}
printf("%d %d %ld\n", min, max, sum);
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 | 119 |
#include <iostream>
using namespace std;
int main() {
int a, n, i, j, k, l, x, y, z;
cin >> a;
int vol[a];
for (i = 0; i < a; i++) {
cin >> n;
vol[i] = n;
}
x = vol[0];
for (j = 0; j < a; j++) {
if (vol[j] <= x) {
x = x;
} else if (x < vol[j]) {
x = vol[j];
}
}
y = vol... | #include <iostream>
using namespace std;
int main() {
long a, n, i, j, k, l, x, y, z;
cin >> a;
int vol[a];
for (i = 0; i < a; i++) {
cin >> n;
vol[i] = n;
}
x = vol[0];
for (j = 0; j < a; j++) {
if (vol[j] <= x) {
x = x;
} else if (x < vol[j]) {
x = vol[j];
}
}
y = vo... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 225 |
/*
* rei.cpp
*
* Created on: 2018/05/07
* Author: J01003
*/
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, max, min, timer, a;
long long sum = 0;
cin >> n;
timer = 0;
max = 0;
min = 100000000;
while (1) {
cin >> a;
if (a > max) {
max = a;
}
... | /*
* rei.cpp
*
* Created on: 2018/05/07
* Author: J01003
*/
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, max, min, timer, a;
long long sum = 0;
cin >> n;
timer = 0;
max = -100000000;
min = 100000000;
while (1) {
cin >> a;
if (a > max) {
max = a... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 122 |
#include <iostream>
int main() {
int number;
std::cin >> number;
int *values = new int[number];
int max = -1000000, min = 1000000, sum = 0;
for (int i = 0; i < number; i++) {
std::cin >> values[i];
if (values[i] < min) {
min = values[i];
}
if (values[i] > max) {
max = values[i];
... | #include <iostream>
int main() {
int number;
std::cin >> number;
int *values = new int[number];
int max = -1000000, min = 1000000;
long long sum = 0;
for (int i = 0; i < number; i++) {
std::cin >> values[i];
if (values[i] < min) {
min = values[i];
}
if (values[i] > max) {
max = v... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 133 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b, c, d;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0) {
b = a[i];
c = a[i];
d = a[i];
} else if (b > a[i]) {
b = a[i];
} else if (c < a[i]) {
c = a[i];
}
if (i > 0) {... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], b, c, d;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0) {
b = a[i];
c = a[i];
d = a[i];
} else if (b > a[i]) {
b = a[i];
} else if (c < a[i]) {
c = a[i];
}
if (i ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 157 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, a[10000], i, j, min, max, gou = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (j = 0; j < n; j++) {
min = a[j - (n - 1)];
max = a[j];
gou = gou += a[j];
}
cout... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, a[10000], i, j;
long min, max, gou = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (j = 0; j < n; j++) {
min = a[j - (n - 1)];
max = a[j];
gou = gou += 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]] | 1 | 136 |
#include <cstdio>
int main() {
int x, a, n, max, min;
int s = 0;
scanf("%d", &n);
for (a = 1; a <= n; a++) {
scanf("%d", &x);
if (a == 1) {
max = x;
min = x;
}
if (max < x)
max = x;
if (min > x)
min = x;
s += x;
}
printf("%d %d %d\n", min, max, s);
return 0... | #include <cstdio>
int main() {
int x, a, n, max, min;
long long int s = 0;
scanf("%d", &n);
for (a = 1; a <= n; a++) {
scanf("%d", &x);
if (a == 1) {
max = x;
min = x;
}
if (max < x)
max = x;
if (min > x)
min = x;
s += x;
}
printf("%d %d %lld\n", min, max, s)... | [["+", 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 <cstdio>
int main() {
int n;
std::scanf("%d", &n);
int saisyo = 1000000;
int saidai = -1000000;
int sum = 0;
for (int i = 0; i < n; i++) {
int k;
std::scanf("%d", &k);
if (k < saisyo) {
saisyo = k;
}
if (saidai < k) {
saidai = k;
}
sum += k;
}
std::pr... | #include <cstdio>
int main() {
int n;
std::scanf("%d", &n);
int saisyo = 1000000;
int saidai = -1000000;
long sum = 0;
for (int i = 0; i < n; i++) {
int k;
std::scanf("%d", &k);
if (k < saisyo) {
saisyo = k;
}
if (saidai < k) {
saidai = k;
}
sum += k;
}
std::p... | [["-", 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 | 113 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int b;
int xmin = 10001;
int xmax = -10001;
long long int sum = 0;
for (int i = 0; i < n; i++) {
cin >> b;
xmin = min(xmin, b);
xmax = max(xmax, b);
sum += b;
}
cout << xmin << ' ' << xmax << ' ' << sum << end... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int b;
int xmin = 1000001;
int xmax = -1000001;
long long int sum = 0;
for (int i = 0; i < n; i++) {
cin >> b;
xmin = min(xmin, b);
xmax = max(xmax, b);
sum += b;
}
cout << xmin << ' ' << xmax << ' ' << sum <<... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 99 |
#include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
long long int sum = 0;
int min = 1000000;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
cout << min << ' ' << max << '... | #include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
long long int sum = 0;
int min = 1000000;
int max = -1000000;
for (int i = 0; i < n; i++) {
cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
cout << min << ' ' << m... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 104 |
#include <iostream>
using namespace std;
int main() {
int as = 0, bs = 0, cs = 0, ds = 0;
cin >> as;
int zs[as];
for (int i = 0; i < as; i++) {
cin >> zs[i];
if (i == 0) {
bs = zs[i];
cs = zs[i];
} else {
if (zs[i] < bs) {
bs = zs[i];
}
if (zs[i] > cs) {
... | #include <iostream>
using namespace std;
int main() {
long int as = 0, bs = 0, cs = 0, ds = 0;
cin >> as;
long int zs[as];
for (long int i = 0; i < as; i++) {
cin >> zs[i];
if (i == 0) {
bs = zs[i];
cs = zs[i];
}
if (zs[i] < bs) {
bs = zs[i];
}
if (zs[i] > cs) {
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96], ["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["-", 75, 76, 0, 9, 0, 57, 64, 9, 0, 46]] | 1 | 150 |
#include <iostream>
using namespace std;
int main(void) {
// Your code here
int n;
int a[100001];
int min, MAX, sum;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sum = 0;
min = MAX = a[0];
for (int i = 0; i < n; i++) {
if (a[i] >= MAX)
MAX = a[i];
if (a[i] <= min)
min = ... | #include <iostream>
using namespace std;
int main(void) {
// Your code here
int n;
int a[100001];
long min, MAX, sum;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sum = 0;
min = MAX = a[0];
for (int i = 0; i < n; i++) {
if (a[i] >= MAX)
MAX = a[i];
if (a[i] <= min)
min =... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 143 |
#include <stdio.h>
int main() {
int n, ai, min, max;
int sum;
scanf("%d %d", &n, &ai);
n--;
min = ai;
max = ai;
sum = ai;
while (n--) {
scanf("%d", &ai);
if (min > ai)
min = ai;
if (max < ai)
max = ai;
sum += ai;
}
printf("%d %d %d\n", min, max, sum);
}
| #include <stdio.h>
int main() {
int n, ai, min, max;
long long int sum;
scanf("%d %d", &n, &ai);
n--;
min = ai;
max = ai;
sum = ai;
while (n--) {
scanf("%d", &ai);
if (min > ai)
min = ai;
if (max < ai)
max = ai;
sum += ai;
}
printf("%d %d %lld\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 | 103 |
#include <iostream>
#include <math.h>
#include <stdint.h>
#include <stdio.h>
using namespace std;
int main() {
int n, sum = 0, max = 0, min = 20000000;
cin >> n;
int test[n];
for (int i = 1; i < n + 1; i++) {
cin >> test[i];
sum += test[i];
if (max < test[i]) {
max = test[i];
}
if (mi... | #include <iostream>
#include <math.h>
#include <stdint.h>
#include <stdio.h>
using namespace std;
int main() {
long long n, sum = 0, max = -20000000, min = 20000000;
cin >> n;
int test[n];
for (int i = 1; i < n + 1; i++) {
cin >> test[i];
sum += test[i];
if (max < test[i]) {
max = test[i];
... | [["-", 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 | 134 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
int max = *max_element(v.begin(), v.end());
int min = *min_element(v.begin(), v.end(... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
int max = *max_element(v.begin(), v.end());
int min = *min_element(v.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 | 124 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.