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 <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
#define pi 3.141592653589
int main() {
int n;
int *a;
cin >> n;
a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int maxas = -1000000;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
#define pi 3.141592653589
int main() {
int n;
long *a;
cin >> n;
a = new long[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long maxas = -1000000;
for (int i = 0; i < n; i++) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 1, 0, 11, 12, 350, 39, 40], ["+", 0, 1, 0, 11, 12, 350, 39, 86, 0, 96]] | 1 | 185 |
#include <iostream>
using namespace std;
main() {
int a, b, max = 0, min = 0, sum = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
sum = sum + b;
if (max < b || i == 0) {
max = b;
}
if (min > b || i == 0) {
min = b;
}
}
cout << min << " " << max << " " << sum << endl;... | #include <iostream>
using namespace std;
main() {
int a, b, max = 0, min = 0;
long long int sum = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
sum = sum + b;
if (max < b || i == 0) {
max = b;
}
if (min > b || i == 0) {
min = b;
}
}
cout << min << " " << max << " "... | [["-", 0, 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 | 108 |
#include <iostream>
using namespace std;
int N, A[10010]; // ?°?????????????????????????
int min(int *a, int size) {
int min = a[0];
for (int i = 0; i < size; i++) {
if (a[i] < min) {
min = a[i];
}
}
return min;
}
int max(int *a, int size) {
int max = a[0];
for (int i = 0; i < size; i++) {
... | #include <iostream>
using namespace std;
int N, A[10010]; // ?°?????????????????????????
int min(int *a, int size) {
int min = a[0];
for (int i = 0; i < size; i++) {
if (a[i] < min) {
min = a[i];
}
}
return min;
}
int max(int *a, int size) {
int max = a[0];
for (int i = 0; i < size; i++) {
... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 236 |
#include <iostream>
int calc_sum(int n, int a[]) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
return sum;
}
int seek_answer(int n, int a[], int minmax[]) {
minmax[0] = a[0];
minmax[1] = a[0];
for (int i = 1; i < n; i++) {
if (minmax[0] > a[i]) {
minmax[0] = a[i];
}
i... | #include <iostream>
long long calc_sum(int n, int a[]) {
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
return sum;
}
int seek_answer(int n, int a[], int minmax[]) {
minmax[0] = a[0];
minmax[1] = a[0];
for (int i = 1; i < n; i++) {
if (minmax[0] > a[i]) {
minmax[0] = a[i];... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 252 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int mn = 10000000;
int mx = -10000000;
int sum = 0;
for (int i = 0; i < n; i++) {
int j;
cin >> j;
mn = min(mn, j);
mx = max(mx, j);
sum += j;
}
cout << mn << " " << mx << " " << sum << endl;... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int mn = 10000000;
int mx = -10000000;
long long sum = 0;
for (int i = 0; i < n; i++) {
int j;
cin >> j;
mn = min(mn, j);
mx = max(mx, j);
sum += j;
}
cout << mn << " " << mx << " " << 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 num;
cin >> num;
auto max = -1000000;
auto min = 1000000;
auto total = 0;
while (num--) {
int a;
cin >> a;
total += a;
if (max < a)
max = a;
if (min > a)
min = a;
}
cout << min << " " << max << " " << total << end... | #include <iostream>
using namespace std;
int main() {
int num;
cin >> num;
auto max = -1000000;
auto min = 1000000;
long long total = 0;
while (num--) {
int a;
cin >> a;
total += a;
if (max < a)
max = a;
if (min > a)
min = a;
}
cout << min << " " << max << " " << total <... | [["-", 0, 14, 8, 9, 0, 43, 39, 361, 0, 190], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 90 |
#include <iostream>
using namespace std;
int main(void) {
int n, d, sum, lo, hi;
sum = 0;
lo = 987654321;
hi = -987654321;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d;
sum += d;
lo = min(lo, d);
hi = max(hi, d);
}
cout << lo << ' ' << hi << ' ' << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n, d, lo, hi;
long sum = 0;
lo = 987654321;
hi = -987654321;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d;
sum += d;
lo = min(lo, d);
hi = max(hi, d);
}
cout << lo << ' ' << hi << ' ' << sum << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 103 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, *a;
cin >> n;
a = new int[n];
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];
printf("%d %d %d\n", a[0], a[n - 1], sum);
return ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, *a;
cin >> n;
a = new int[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
long long sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
printf("%d %d %ld\n", a[0], a[n - 1], sum);
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 115 |
#include <iostream>
int main(void) {
int n;
std::cin >> n;
int *a = new int[n];
int r = 0;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
int min = 1000001, max = -1000001;
unsigned long long sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (min > a[i])
min = a[i];
if (m... | #include <iostream>
int main(void) {
int n;
std::cin >> n;
int *a = new int[n];
int r = 0;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
int min = 1000001, max = -1000001;
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (min > a[i])
min = a[i];
if (max < a[i]... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87]] | 1 | 154 |
#include <iostream>
#include <vector>
int max(const std::vector<int> &_vals) {
int max = _vals[0];
for (int x : _vals) {
if (max < x) {
max = x;
}
}
return max;
}
int min(const std::vector<int> &_vals) {
int min = _vals[0];
for (int x : _vals) {
if (min > x) {
min = x;
}
}
... | #include <iostream>
#include <vector>
int max(const std::vector<int> &_vals) {
int max = _vals[0];
for (int x : _vals) {
if (max < x) {
max = x;
}
}
return max;
}
int min(const std::vector<int> &_vals) {
int min = _vals[0];
for (int x : _vals) {
if (min > x) {
min = x;
}
}
... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 235 |
#include <algorithm>
#include <array>
#include <iostream>
#include <vector>
template <class T> T input() {
T val;
std::cin >> val;
return val;
}
int main() {
int n, sum = 0;
std::cin >> n;
std::vector<int> b;
for (int i = 0; i < n; ++i)
b.push_back(input<int>()), sum += b[i];
std::sort(b.begin()... | #include <algorithm>
#include <array>
#include <iostream>
#include <vector>
template <class T> T input() {
T val;
std::cin >> val;
return val;
}
int main() {
long long n, sum = 0;
std::cin >> n;
std::vector<long long> b;
for (int i = 0; i < n; ++i)
b.push_back(input<long long>()), sum += b[i];
s... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 39, 343, 141, 344, 3, 347, 0, 77, 39, 40], ["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["-", 0, 2, 63, 346, 3, 347, 0, 77, 39, 40], ["+", 63, 346, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 141 |
#include <iostream>
using namespace std;
int main() {
int n, a[10000] = {0};
int min, max, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = max = a[0];
for (int i = 0; i < n; i++) {
if (min > a[i]) {
min = a[i];
}
if (max < a[i]) {
max = a[i];
}
... | #include <iostream>
using namespace std;
int main() {
long long n, a[10000] = {0};
long long min, max, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = max = a[0];
for (int i = 0; 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, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 149 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, Min = 1000001, Max = -1000001, a, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
Min = min(Min, a);
Max = max(Max, a);
sum += a;
}
cout << Min << " " << Max << " " << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, Min = 1000001, Max = -1000001, a, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
Min = min(Min, a);
Max = max(Max, a);
sum += 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]] | 1 | 98 |
#include <stdio.h>
int main() {
int x, n, min, max;
long w;
scanf("%d", &n);
x = min = max = NULL;
w = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
if (i == 0) {
max = x;
min = x;
}
if (x < min)
min = x;
if (x > max)
max = x;
w = w + (long)x;
x = 0;... | #include <stdio.h>
int main() {
int x, n, min, max;
long w;
scanf("%d", &n);
x = min = max = NULL;
w = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
if (i == 0) {
max = x;
min = x;
}
if (x < min)
min = x;
if (x > max)
max = x;
w = w + (long)x;
x = 0;... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 134 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, tmp, sum = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
a.push_back(tmp);
sum += tmp;
}
cout << *min_element(a.begin(), a.end()) << " ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long tmp, sum = 0;
vector<long long> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
a.push_back(tmp);
sum += tmp;
}
cout << *min_element(a.begin... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 119 |
#include <iostream>
using namespace std;
int main() {
int a[10000], n;
int min = 0, max = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (i == 0) {
sum = min = max = a[i];
} else {
if (min > a[i])
min = a[i];
if (max < a[i])
max... | #include <iostream>
using namespace std;
int main() {
long a[10000], n;
long min = 0, max = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (i == 0) {
sum = min = max = a[i];
} else {
if (min > a[i])
min = a[i];
if (max < a[i])
m... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 142 |
#include <iostream>
using namespace std;
int main() {
int num = 0;
int a[10000] = {};
int max = -1000000, min = 1000000, sum = 0;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
sum += a[i];
}
cout << min <... | #include <iostream>
using namespace std;
int main() {
int num = 0;
int a[10000] = {};
long int max = -1000000, min = 1000000, sum = 0;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> a[i];
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
sum += a[i];
}
cout << ... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 126 |
#include <iostream>
using namespace std;
int main() {
int n, min, max, sum;
cin >> n;
long work[n];
for (int i = 0; i < n; i++) {
cin >> work[i];
}
max = sum = min = work[0];
for (int i = 1; i < n; i++) {
if (max < work[i]) {
max = work[i];
}
if (min > work[i]) {
min = work[i]... | #include <iostream>
using namespace std;
int main() {
int n;
long min, max, sum;
cin >> n;
long work[n];
for (int i = 0; i < n; i++) {
cin >> work[i];
}
max = sum = min = work[0];
for (int i = 1; i < n; i++) {
if (max < work[i]) {
max = work[i];
}
if (min > work[i]) {
min = ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 145 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a = -1000000, b = 1000000, c = 0, tmp = 0, tmp2 = 0;
cin >> tmp2;
for (int i = 0; i < tmp2; i++) {
cin >> tmp;
c += tmp;
a = max(a, tmp);
b = min(b, tmp);
}
co... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long long a = -1000000, b = 1000000, c = 0, tmp = 0, tmp2 = 0;
cin >> tmp2;
for (int i = 0; i < tmp2; i++) {
cin >> tmp;
c += tmp;
a = max(a, tmp);
b = min(b, tmp);
... | [["-", 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 <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 264 |
#include <iostream>
using namespace std;
int min(int *a, int n) {
int v = 1000000;
for (int i = 0; i < n; i++) {
if (v > a[i]) {
v = a[i];
}
}
return v;
}
int max(int *a, int n) {
int v = -1000000;
for (int i = 0; i < n; i++) {
if (v < a[i]) {
v = a[i];
}
}
return v;
}
in... | #include <iostream>
using namespace std;
int min(int *a, int n) {
int v = 1000000;
for (int i = 0; i < n; i++) {
if (v > a[i]) {
v = a[i];
}
}
return v;
}
int max(int *a, int n) {
int v = -1000000;
for (int i = 0; i < n; i++) {
if (v < a[i]) {
v = a[i];
}
}
return v;
}
lo... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 235 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n) {
int m;
cin >> m;
int M = m;
int sum = m;
for (int i = 1; i < n; ++i) {
int v;
cin >> v;
m = min(m, v);
sum += v;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n) {
int m;
cin >> m;
int M = m;
ll sum = m;
for (int i = 1; i < n; ++i) {
int v;
cin >> v;
m = min(m... | [["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 157], ["+", 36, 36, 0, 30, 0, 134, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 49, 78], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 35], ["-", 8, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 57, 64, 9, 0, 43, 39, 78]] | 1 | 136 |
#include <stdio.h>
int main() {
int n, A[10001];
scanf("%d", &n);
int i;
for (i = 0; i <= n - 1; i++) {
scanf("%d ", &A[i]);
}
long min = -1000001, max = 1000000, total = 0;
for (i = 0; i <= n - 1; i++) {
if (min > A[i])
min = A[i];
if (max < A[i])
max = A[i];
total = total + ... | #include <stdio.h>
int main() {
int n, A[10001];
scanf("%d", &n);
int i;
for (i = 0; i <= n - 1; i++) {
scanf("%d ", &A[i]);
}
long int min = 1000001, max = -1000001, total = 0;
for (i = 0; i <= n - 1; i++) {
if (min > A[i])
min = A[i];
if (max < A[i])
max = A[i];
total = tota... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 147 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int num;
cin >> num;
int max = -1000001, min = 1000001, data;
int sum = 0;
for (int i = 0; i < num; i++) {
cin >> data;
if (min > data) {
min = data;
}
if (max < data) {
max = data;
}
sum += data;
}... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int num;
cin >> num;
int max = -1000001, min = 1000001, data;
long long sum = 0;
for (int i = 0; i < num; i++) {
cin >> data;
if (min > data) {
min = data;
}
if (max < data) {
max = data;
}
sum += dat... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 107 |
#include <stdio.h>
int main() {
int n, a[10001], i;
int min, max, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
min = a[0];
max = a[0];
for (i = 0; i < n; i++) {
if (min > a[i])
min = a[i];
if (max < a[i])
max = a[i];
sum += a[i];
}
printf("%d... | #include <stdio.h>
int main() {
int n, a[10001], i;
int min, max;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
min = a[0];
max = a[0];
for (i = 0; i < n; i++) {
if (min > a[i])
min = a[i];
if (max < a[i])
max = 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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 150 |
#include <stdio.h>
int main(void) {
int n, i, max, min, sum;
int a[10001];
scanf("%d", &n);
max = -1000000;
min = 1000000;
sum = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = a[i];
}
sum = sum + a[i];
}
pr... | #include <stdio.h>
int main(void) {
int n, i, max, min;
long long int sum;
int a[10001];
scanf("%d", &n);
max = -1000000;
min = 1000000;
sum = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = a[i];
}
sum = 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, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 138 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x, sum = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
sum += x;
}
sort(a.begin(), a.end());
cout << a[0] << " " << a[a.size() - 1] << " " << sum << end... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, x;
long sum = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
sum += x;
}
sort(a.begin(), a.end());
cout << a[0] << " " << a[a.size() - 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]] | 1 | 114 |
// min max sum
#include <iostream>
using namespace std;
int main() {
int a, n, min, max, sum;
cin >> n >> a;
min = a;
max = a;
sum = a;
for (int i = 0; i < n - 1; i++) {
cin >> a;
if (max < a)
max = a;
if (min > a)
min = a;
sum += a;
}
cout << min << " " << max << " " <... | // min max sum
#include <iostream>
using namespace std;
int main() {
long a, n, min, max, sum;
cin >> n >> a;
min = a;
max = a;
sum = a;
for (int i = 0; i < n - 1; i++) {
cin >> a;
if (max < a)
max = a;
if (min > a)
min = a;
sum += a;
}
cout << min << " " << max << " " ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 109 |
/*
?????§??§ 1000000 ??????????????§ 10000
?????\?????????????????§?????????????????¨????¶??????????????????´?????????????????????1010
????¨???????????????¨?????§??????????????????????????????????????????
int ??§????¶???????????????§???long long (??\?????¬??¬)????????¨??????
??¬??¬????????¬???????????????????????°?¢??... | /*
?????§??§ 1000000 ??????????????§ 10000
?????\?????????????????§?????????????????¨????¶??????????????????´?????????????????????1010
????¨???????????????¨?????§??????????????????????????????????????????
int ??§????¶???????????????§???long long (??\?????¬??¬)????????¨??????
??¬??¬????????¬???????????????????????°?¢??... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 147 |
#include <stdio.h>
int main(void) {
int n, x, max = -1000000, min = 1000000, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
max = x > max ? x : max;
min = x < min ? x : min;
sum += x;
}
printf("%d %d %d\n", min, max, sum);
return 0;
} | #include <stdio.h>
int main(void) {
int n, x, max = -1000000, min = 1000000;
long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
max = x > max ? x : max;
min = x < min ? x : min;
sum += x;
}
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 | 103 |
#include <iostream>
using namespace std;
int main() {
int i, n, big = -1000000, little = 1000000, sum = 0;
cin >> i;
for (; i > 0; i--) {
cin >> n;
sum += n;
if (n > big) {
big = n;
}
if (n < little) {
little = n;
}
}
cout << little << ' ' << big << ' ' << sum << endl;
re... | #include <iostream>
using namespace std;
int main() {
int i, n, big = -1000000, little = 1000000;
long long int sum = 0;
cin >> i;
for (; i > 0; i--) {
cin >> n;
sum += n;
if (n > big) {
big = n;
}
if (n < little) {
little = n;
}
}
cout << little << ' ' << big << ' ' << s... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 98 |
#include <iostream>
using namespace std;
int main() {
int n;
int a;
int max;
int min;
int sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0) {
max = a;
min = a;
sum = a;
}
else {
if (max < a)
max = a;
if (min > a)
min = a;
... | #include <iostream>
using namespace std;
int main() {
int n;
int a;
int max;
int min;
long long sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0) {
max = a;
min = a;
sum = a;
} else {
if (max < a)
max = a;
if (min > a)
min = a;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 119 |
#include <iostream>
//#include <stdio.h>
using namespace std;
int main() {
int n;
int a;
int max = 100000, min = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
if (i == 0) {
max = a;
min = a;
}
if (max <= a)
max = a;
if (min >= a)
... | #include <iostream>
//#include <stdio.h>
using namespace std;
int main() {
int n;
long long a;
long long max = 100000, min = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
if (i == 0) {
max = a;
min = a;
}
if (max <= a)
max = a;
if (m... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 117 |
#include <bits/stdc++.h>
int main() {
int min = 1000000000;
int max = -1000000000;
int sum = 0;
int N;
int temp;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> temp;
min = std::min(temp, min);
max = std::max(temp, max);
sum += temp;
}
std::cout << min << " " << max << " "... | #include <bits/stdc++.h>
int main() {
long min = 1000000000;
long max = -1000000000;
long sum = 0;
long N;
long temp;
std::cin >> N;
for (long i = 0; i < N; ++i) {
std::cin >> temp;
min = std::min(temp, min);
max = std::max(temp, max);
sum += temp;
}
std::cout << min << " " << max ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]] | 1 | 108 |
#include <iostream>
using namespace std;
void b_sort(long long int *a, int n) {
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (a[i] > a[j]) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
}
}
}
int main() {
int n, sum = 0;
cin >> n;
long long in... | #include <iostream>
using namespace std;
void b_sort(long long int *a, int n) {
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (a[i] > a[j]) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
}
}
}
int main() {
int n;
long long int sum = 0;
cin >> n... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 209 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 1000000;
int max = -1000000;
int sum = 0;
for (int i = 0; i < n; ++i) {
int j;
cin >> j;
if (j < min) {
min = j;
}
if (max < j) {
max = j;
}
sum += j;
}
cout << min << " ";
cout ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = 1000000;
int max = -1000000;
long sum = 0;
for (int i = 0; i < n; ++i) {
int j;
cin >> j;
if (j < min) {
min = j;
}
if (max < j) {
max = j;
}
sum += j;
}
cout << min << " ";
cout... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 110 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define square(x) (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
in... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define square(x) (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
in... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 151 |
#include <iostream>
using namespace std;
int main(void) {
int n, min = 1000000000, max = -1000000000, total = 0;
int *num;
cin >> n;
num = new int[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
}
for (int i = 0; i < n; i++) {
if (min > num[i])
min = num[i];
if (max < num[i])
... | #include <iostream>
using namespace std;
int main(void) {
int n, min = 1000000000, max = -1000000000;
long int total = 0;
int *num;
cin >> n;
num = new int[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
}
for (int i = 0; i < n; i++) {
if (min > num[i])
min = num[i];
if (max < nu... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 150 |
#include <stdio.h>
int main(void) {
int i, n;
long data, min = 1000000, max = 0, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%ld", &data);
if (data < min)
min = data;
if (data > max)
max = data;
sum += data;
}
printf("%ld %ld %ld\n", min, max, sum);
} | #include <stdio.h>
int main(void) {
int i, n;
long data, min = 1000000, max = -1000000, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%ld", &data);
if (data < min)
min = data;
if (data > max)
max = data;
sum += data;
}
printf("%ld %ld %ld\n", min, max, sum);
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 102 |
#include <cstdio>
int main() {
int n, buf, max, min;
long sum;
scanf("%d", &n);
scanf("%d", &buf);
max = min = sum = buf;
for (int i = 1; i < n; i++) {
scanf("%d", &buf);
if (buf > max) {
max = buf;
}
if (buf < min) {
min = buf;
}
sum += buf;
}
printf("%d %d %d\n",... | #include <cstdio>
int main() {
int n, buf, max, min;
long sum;
scanf("%d", &n);
scanf("%d", &buf);
max = min = sum = buf;
for (int i = 1; i < n; i++) {
scanf("%d", &buf);
if (buf > max) {
max = buf;
}
if (buf < min) {
min = buf;
}
sum += buf;
}
printf("%d %d %ld\n"... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 116 |
#include <iostream>
using namespace std;
int main() {
int num;
int i;
int min = 1000001;
int max = -1000001;
int sum = 0;
cin >> num;
int tmp;
for (i = 0; i < num; i++) {
cin >> tmp;
if (tmp > max) {
max = tmp;
}
if (tmp < min) {
min = tmp;
}
sum += tmp;
}
cout ... | #include <iostream>
using namespace std;
int main() {
int num;
int i;
int min = 1000001;
int max = -1000001;
long int sum = 0;
cin >> num;
int tmp;
for (i = 0; i < num; i++) {
cin >> tmp;
if (tmp > max) {
max = tmp;
}
if (tmp < min) {
min = tmp;
}
sum += tmp;
}
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 108 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
/* cout << fixed << setprecision(5); */
int main() {
float a, n, Ma, Mi, s;
n = 0;
cin >> n;
Ma = -1000001;
Mi = 1000001;
s = 0;
for (int i = 0; i < n; i++)... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
/* cout << fixed << setprecision(5); */
int main() {
long a, n, Ma, Mi, s;
n = 0;
cin >> n;
Ma = -1000001;
Mi = 1000001;
s = 0;
for (int i = 0; i < n; i++) ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 125 |
#include <iostream>
using namespace std;
int main() {
int n, a;
int max, min, sum;
max = -10000000;
min = 10000000;
sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (max < a)
max = a;
if (a < min)
min = a;
sum += a;
}
cout << min << " " << max << " " << sum ... | #include <iostream>
using namespace std;
int main() {
int n, a;
int max, min;
max = -10000000;
min = 10000000;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (max < a)
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, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 107 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, sum = 0;
cin >> n;
vector<long int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
cou... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long int n, sum = 0;
cin >> n;
vector<long int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 139 |
#include <iostream>
using namespace std;
int main() {
int n, a[10000];
int min = 1000000, max = -1000000, sum = 0;
cin >> n;
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 += a[i];
}
cout << min << " " <... | #include <iostream>
using namespace std;
int main() {
int n, a[10000];
int min = 1000000, max = -1000000;
long sum = 0;
cin >> n;
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 += 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]] | 1 | 124 |
#include <iostream>
using namespace std;
int main() {
int n;
int max, min, sum;
int a[25565] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
sum = a[0];
for (int i = 1; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
... | #include <iostream>
using namespace std;
int main() {
long long n, max, min, sum;
int a[25565] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
sum = a[0];
for (int i = 1; i < n; 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], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21]] | 1 | 157 |
#include <iostream>
using namespace std;
int main() {
int a[10000], n, max, min, sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
sum = a[0];
for (int i = 1; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
min = a[i];
... | #include <iostream>
using namespace std;
int main() {
int a[10000], n, max, min;
long long int sum;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
sum = a[0];
for (int i = 1; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
if (min > a[i]) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 154 |
#include <iostream>
using namespace std;
int main() {
int n, min, max, sum = 0;
int N[10001];
cin >> n;
cin >> N[0];
max = min = sum = N[0];
for (int i = 1; i < n; i++) {
cin >> N[i];
if (max < N[i])
max = N[i];
if (min > N[i])
min = N[i];
sum += N[i];
}
cout << min << " " <... | #include <iostream>
using namespace std;
int main() {
long long n, min, max, sum = 0;
long long N[10001];
cin >> n;
cin >> N[0];
max = min = sum = N[0];
for (int i = 1; i < n; i++) {
cin >> N[i];
if (max < N[i])
max = N[i];
if (min > N[i])
min = N[i];
sum += N[i];
}
cout << ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 134 |
#include <iostream>
using namespace std;
int main() {
int n, a;
int sum = 0;
int max = -1000000;
int min = 1000000;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
if (a > max) {
max = a;
}
if (a < min) {
min = a;
}
sum += a;
}
cout << min << " " << max << " " << s... | #include <iostream>
using namespace std;
int main() {
int n, a;
long long sum = 0;
int max = -1000000;
int min = 1000000;
cin >> n;
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, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#include <iostream>
int main(int argc, char const *argv[]) {
int num;
int max = -10000000, min = 10000000, sum = 0;
int input;
std::cin >> num;
for (size_t i = 0; i < num; i++) {
std::cin >> input;
if (max < input)
max = input;
if (min > input)
min = input;
sum += input;
}
... | #include <iostream>
int main(int argc, char const *argv[]) {
int num;
long max = -10000000, min = 10000000, sum = 0;
int input;
std::cin >> num;
for (size_t i = 0; i < num; i++) {
std::cin >> input;
if (max < input)
max = input;
if (min > input)
min = input;
sum += input;
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 113 |
#include <cstdio>
#include <iostream>
int main() {
int n;
std::cin >> n;
int min = 1000000;
int max = -1000000;
int sum = 0;
while (n--) {
int a;
std::cin >> a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum += a;
}
printf("%d %d %d\n", min, max, ... | #include <cstdio>
#include <iostream>
int main() {
int n;
std::cin >> n;
int min = 1000000;
int max = -1000000;
long sum = 0;
while (n--) {
int a;
std::cin >> a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum += a;
}
printf("%d %d %ld\n", min, max... | [["-", 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 | 95 |
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, buf;
int min = 1000000, max = -1000000, sum = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> buf;
a.push_back(buf);
}
for (int i = 0; i < a.size(); i++) {
if (a[i] < min)
... | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, buf;
int min = 1000000, max = -1000000;
long sum = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> buf;
a.push_back(buf);
}
for (int i = 0; i < a.size(); 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 | 151 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>
using namespace std;
void Solution() {
int a;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>
using namespace std;
void Solution() {
long i... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 142 |
#include <iostream>
using namespace std;
int main() {
long int n, a[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int minX = a[0], maxX = a[0], sum = 0;
for (int i = 0; i < n; i++)
if (minX > a[i])
minX = a[i];
for (int i = 0; i < n; i++)
if (maxX < a[i])
maxX = a[i];
... | #include <iostream>
using namespace std;
int main() {
long int n, a[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
long int minX = a[0], maxX = a[0], sum = 0;
for (int i = 0; i < n; i++)
if (minX > a[i])
minX = a[i];
for (int i = 0; i < n; i++)
if (maxX < a[i])
maxX = a... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 164 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_4_D
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = a[0], max = a[0], sum = 0;
for (int i = 0; i < n; i++) {
if (min > a[i]) {
min = a[i];
... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_4_D
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = a[0], max = a[0];
long sum = 0;
for (int i = 0; i < n; i++) {
if (min > a[i]) {
min =... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 145 |
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
int max = v[0], min = v[0], all = 0;
for (int i = 0; i < n; i++) {
if (max < v[i]) {
max = v[i];
}
if (min > v[i]) {
min = v[i];
... | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
int max = v[0], min = v[0];
long long int all = 0;
for (int i = 0; i < n; i++) {
if (max < v[i]) {
max = v[i];
}
if (min > v[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 | 157 |
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n, UENINIGERUDE, SEISU[10000], GOKEI = 0, SAISYO;
cin >> n;
SAISYO = n - 1;
for (int i = 0; i < n; i++) {
cin >> SEISU[i];
}
for (int i = 0; i <= n; i++) {
for (int j = i + 1; j < n; j++) {
if (SEI... | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
long n, UENINIGERUDE, SEISU[10000], GOKEI = 0, SAISYO;
cin >> n;
SAISYO = n - 1;
for (int i = 0; i < n; i++) {
cin >> SEISU[i];
}
for (int i = 0; i <= n; i++) {
for (int j = i + 1; j < n; j++) {
if (SE... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 187 |
#include <iostream>
using namespace std;
int main() {
int a, i, n, m, d, e, f, g, h;
cin >> a;
int b[a];
for (i = 0; i < a; i++) {
cin >> b[i];
}
for (n = 0; n < a - 1; n++) {
for (m = n + 1; m < a; m++) {
if (b[n] < b[m]) {
d = b[n];
b[n] = b[m];
b[m] = d;
}
... | #include <iostream>
using namespace std;
int main() {
long int a, i, n, m, d, e, f, g, h;
cin >> a;
long int b[a];
for (i = 0; i < a; i++) {
cin >> b[i];
}
for (n = 0; n < a - 1; n++) {
for (m = n + 1; m < a; m++) {
if (b[n] < b[m]) {
d = b[n];
b[n] = b[m];
b[m] = d;
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 192 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#define PI 3.1415926535897932384626433832795028841971
using namespace std;
int main() {
int max, min, sum, sum2, num;
max = -1000001;
min = 1000001;
sum = 0;
sum2 = 0;
cin >> num;
for (int ii = 0; ii < num; ii++) {
int val;
cin >> val;
... | #include <iostream>
#include <math.h>
#include <stdio.h>
#define PI 3.1415926535897932384626433832795028841971
using namespace std;
int main() {
long long max, min, sum, sum2, num;
max = -1000001;
min = 1000001;
sum = 0;
sum2 = 0;
cin >> num;
for (int ii = 0; ii < num; ii++) {
int val;
cin >> ... | [["-", 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, min = 0, max = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int j;
cin >> j;
sum += j;
if (i) {
if (j > max)
max = j;
if (j < min)
min = j;
} else {
max = j;
min = j;
}
}
co... | #include <iostream>
using namespace std;
int main() {
long long n, min = 0, max = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int j;
cin >> j;
sum += j;
if (i) {
if (j > max)
max = j;
if (j < min)
min = j;
} else {
max = j;
min = j;
}
}... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 116 |
#include <iostream>
using namespace std;
int main() {
int n, max, min, sum, i;
int date[10001] = {0};
cin >> n;
for (i = 0; i < n; i++) {
cin >> date[i];
}
max = date[0];
min = date[0];
sum = date[0];
for (i = 1; i < n; i++) {
if (max < date[i])
max = date[i];
if (min > date[i])
... | #include <iostream>
using namespace std;
int main() {
int n, max, min, i;
long long sum;
int date[10001] = {0};
cin >> n;
for (i = 0; i < n; i++) {
cin >> date[i];
}
max = date[0];
min = date[0];
sum = date[0];
for (i = 1; i < n; i++) {
if (max < date[i])
max = date[i];
if (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, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 155 |
#include <iostream>
using namespace std;
int main() {
int n, num, max, min, sum;
cin >> n;
cin >> num;
max = min = sum = num;
for (int i = 0; i < n - 1; i++) {
cin >> num;
sum = sum + num;
if (num >= max) {
max = num;
}
if (num <= min) {
min = num;
}
}
cout << min... | #include <iostream>
using namespace std;
int main() {
int n, num, max, min;
long long int sum;
cin >> n;
cin >> num;
max = min = sum = num;
for (int i = 0; i < n - 1; i++) {
cin >> num;
sum = sum + num;
if (num >= max) {
max = num;
}
if (num <= min) {
min = num;
}
... | [["-", 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 | 112 |
#include <iostream>
using namespace std;
int main() {
int n, num;
int max, min;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
sum += num;
if (i == 0) {
max = num;
min = num;
} else if (max < num)
max = num;
else if (min > num)
min = num;
}
cou... | #include <iostream>
using namespace std;
int main() {
long n, num;
long max, min;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
sum += num;
if (i == 0) {
max = num;
min = num;
} else if (max < num)
max = num;
else if (min > num)
min = num;
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 111 |
#include <algorithm>
#include <iostream>
using namespace std;
int x[10000], n, sum;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i];
sum = sum + x[i];
}
sort(x, x + n);
cout << x[0] << " " << x[n - 1] << " " << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
long int x[10000], n, sum;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i];
sum = sum + x[i];
}
sort(x, x + n);
cout << x[0] << " " << x[n - 1] << " " << sum << endl;
return 0;
} | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 98 |
#include <iostream>
using namespace std;
int main() {
int n;
int max, min;
long long sum;
cin >> n;
int a[n];
for (int i = 0; i < 1000; i++)
cin >> a[i];
max = -1000000;
min = 1000000;
sum = 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() {
int n;
int max, min;
long sum;
cin >> n;
long a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
max = -1000000;
min = 1000000;
sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a[i];... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 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, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 140 |
#include <iostream>
using namespace std;
int main() {
int num, i, max, min, sum;
cin >> num;
int x;
for (i = 0; i < num; i++) {
cin >> x;
if (i == 0) {
sum = x;
max = x;
min = x;
} else {
sum += x;
if (max < x) {
max = x;
} else if (min > x) {
min... | #include <iostream>
using namespace std;
int main() {
int num, i, max, min;
long long sum;
cin >> num;
int x;
for (i = 0; i < num; i++) {
cin >> x;
if (i == 0) {
sum = x;
max = x;
min = x;
} else {
sum += x;
if (max < x) {
max = x;
} else if (min > 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 | 119 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for (int i = a; i < b; ++i)
t... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for (int i = a; i < b; ++i)
t... | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 198 |
#include <algorithm>
#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 x, y, z;
x = a[0];
y = a[0];
z = 0;
for (int j = 0; j < n; j++) {
x = min(x, a[j]);
y = max(y, a[j]);
z += a[j];
}
cou... | #include <algorithm>
#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 x, y, z;
x = a[0];
y = a[0];
z = 0;
for (int j = 0; j < n; j++) {
x = min(x, a[j]);
y = max(y, a[j]);
z += a[j];
}
... | [["-", 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 | 149 |
#include <algorithm>
#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 x, y, z;
x = a[0];
y = a[0];
z = 0;
for (int j = 0; j < n; j++) {
x = min(x, a[j]);
y = max(y, a[j]);
z += a[j];
}
cou... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long *a = new long long[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long x, y, z;
x = a[0];
y = a[0];
z = 0;
for (int j = 0; j < n; j++) {
x = min(x, a[j]);
y = max(y, a[j]);
z ... | [["-", 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 | 149 |
#include <iostream>
using namespace std;
int N, A[10010];
int min() {
int candMin = A[0];
for (int i = 0; i < N; i++) {
if (candMin > A[i])
candMin = A[i];
}
return candMin;
}
int max() {
int candMax = A[0];
for (int i = 0; i < N; i++) {
if (candMax < A[i])
candMax = A[i];
}
return... | #include <iostream>
using namespace std;
int N, A[10010];
int min() {
int candMin = A[0];
for (int i = 0; i < N; i++) {
if (candMin > A[i])
candMin = A[i];
}
return candMin;
}
int max() {
int candMax = A[0];
for (int i = 0; i < N; i++) {
if (candMax < A[i])
candMax = A[i];
}
return... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 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, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7... | 1 | 202 |
/* minmaxsum.cc
*/
#include <iostream>
using namespace std;
int N, A[10010]; // ?°?????????????????????????
int min() {
int min = A[0];
for (int i = 0; i < N; ++i)
if (A[i] < min)
min = A[i];
return min;
}
int max() {
int max = A[0];
for (int i = 0; i < N; ++i)
if (A[i] > max)
max = A[... | /* minmaxsum.cc
*/
#include <iostream>
using namespace std;
int N, A[10010]; // ?°?????????????????????????
int min() {
int min = A[0];
for (int i = 0; i < N; ++i)
if (A[i] < min)
min = A[i];
return min;
}
int max() {
int max = A[0];
for (int i = 0; i < N; ++i)
if (A[i] > max)
max = A[... | [["-", 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 | 204 |
#include <iostream>
using namespace std;
int main() {
double N;
cin >> N;
double sum = 0, num[10000];
for (int i = 0; i < N; i++) {
cin >> num[i];
sum = sum + num[i];
}
double max0 = num[0], min0 = num[0];
for (int i = 0; i < N; i++) {
if (max0 < num[i]) {
max0 = num[i];
}
if (mi... | #include <iostream>
using namespace std;
int main() {
long N;
cin >> N;
long sum = 0, num[10000];
for (int i = 0; i < N; i++) {
cin >> num[i];
sum = sum + num[i];
}
long max0 = num[0], min0 = num[0];
for (int i = 0; i < N; i++) {
if (max0 < num[i]) {
max0 = num[i];
}
if (min0 > n... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 149 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int mi = 1000000;
int ma = -1000000;
int e;
for (int i = 0; i < n; ++i) {
cin >> e;
mi = min(e, mi);
ma = max(e, ma);
sum += e;
}
cout << mi << " " << ma << " " << sum << endl;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long sum = 0;
int mi = 1000000;
int ma = -1000000;
int e;
for (int i = 0; i < n; ++i) {
cin >> e;
mi = min(e, mi);
ma = max(e, ma);
sum += e;
}
cout << mi << " " << ma << " " << sum << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = 0, max = 0, sum = 0;
min = *min_element(a.begin(), a.end());
max = *max_element(a.begin(), a.end());
for (int i ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = 0, max = 0;
long long sum = 0;
min = *min_element(a.begin(), a.end());
max = *max_element(a.begin(), a.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 | 152 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a[1000000], n, MIN, MAX, SUM;
MIN = 100000000;
MAX = -100000000;
SUM = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (MIN > a[i]) {
MIN = a[i];
}
if (MAX < a[i]) {
MAX = a[i];
}
SUM ... | #include <iostream>
#include <string>
using namespace std;
int main() {
long long int a[1000000], n, MIN, MAX, SUM;
MIN = 100000000;
MAX = -100000000;
SUM = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (MIN > a[i]) {
MIN = a[i];
}
if (MAX < a[i]) {
MAX = a[i];
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 131 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define _USE_MATH_DEFINES
int main() {
int n, tmp;
int min = 1e8;
int max = -1e8;
int sum = 0;
cin >> n;
for (int i = 0; i < n; ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define _USE_MATH_DEFINES
int main() {
int n, tmp;
int min = 1e9;
int max = -1e9;
long long sum = 0;
cin >> n;
for (int i = 0; i... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 114 |
#include <stdio.h>
int main() {
int n, i, min, max;
long int sum = 0;
int data[1000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
sum += data[i];
}
max = data[0];
min = data[0];
for (i = 1; i < n; i++) {
if (max <= data[i]) {
max = data[i];
}
if (min >= ... | #include <stdio.h>
int main() {
int n, i, min, max;
long int sum = 0;
int data[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
sum += data[i];
}
max = data[0];
min = data[0];
for (i = 1; i < n; i++) {
if (max <= data[i]) {
max = data[i];
}
if (min >=... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 153 |
#include <algorithm>
#include <iostream>
#include <limits>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, n;
int min = std::numeric_limits<int>::max();
int max = std::numeric_limits<int>::min();
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
m... | #include <algorithm>
#include <iostream>
#include <limits>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, n;
int min = std::numeric_limits<int>::max();
int max = std::numeric_limits<int>::min();
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 141 |
#include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long a[150000];
for (long i = 0; i < n; i++) {
cin >> a[i];
}
int big = a[0], small = a[0];
for (long k = 0; k < n; k++) {
if (a[k] > big) {
big = a[k];
} else if (a[k] < small) {
small = a[k];
}
}
in... | #include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long a[150000];
for (long i = 0; i < n; i++) {
cin >> a[i];
}
int big = a[0], small = a[0];
for (long k = 0; k < n; k++) {
if (a[k] > big) {
big = a[k];
} else if (a[k] < small) {
small = a[k];
}
}
lo... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 160 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
scanf("%d\n", &n);
int value[n];
int max = INT_MIN;
int min = INT_MAX;
int sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &value[i]);
if (max < value[i]) {
max = value[i];
}
if (... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
scanf("%d\n", &n);
int value[n];
int max = INT_MIN;
int min = INT_MAX;
long long int sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &value[i]);
if (max < value[i]) {
max = value[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 | 138 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
int max = -1000000;
int min = 1000000;
int sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
if (max < a) {
max = a;
}
if (min > a) {
min ... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
int max = -1000000;
int min = 1000000;
long long int sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
if (max < a) {
max = a;
}
if (min > a) {
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 118 |
#include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
int 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 << " " << max << " " <... | #include <iostream>
using namespace std;
int main() {
int n;
int a[10000];
long long int 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 << " " << ma... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 121 |
#include <iostream>
using namespace std;
int main() {
int n, nom, min, max, total;
min = 0;
max = 0;
total = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> nom;
if (i == 0) {
min = nom;
max = nom;
total = nom;
} else {
if (nom < min) {
min = nom;
}
... | #include <iostream>
using namespace std;
int main() {
long int n, nom, min, max, total;
min = 0;
max = 0;
total = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> nom;
if (i == 0) {
min = nom;
max = nom;
total = nom;
} else {
if (nom < min) {
min = nom;
}
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 133 |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n, k, min = 100000000, max = -100000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> k;
if (k < min)
min = k;
if (k > max)
max = k;
sum = sum + k;
}
cout << min << " " << max << " " << s... | #include <iostream>
using namespace std;
int main() {
// your code goes here
long long n, k, min = 100000000, max = -100000000, sum = 0;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> k;
if (k < min)
min = k;
if (k > max)
max = k;
sum = sum + k;
}
cout << min << " " << max... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]] | 1 | 101 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <numeric>
//#include <map>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> vData;
for (long i = 0; i < ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <numeric>
//#include <map>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> vData;
for (long i = 0; i < ... | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 138 |
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int min = 1000000;
int max = -1000000;
int sum = 0;
int a;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
if (min > a)
min = a;
if (max < a)
max = a;
}
cout << min << " " <<... | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
long min = 1000000;
long max = -1000000;
long sum = 0;
int a;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
if (min > a)
min = a;
if (max < a)
max = a;
}
cout << min << " "... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 105 |
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, x;
int min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (min > x)
min = x;
if (max < x)
... | #define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, x;
int min = 1000000, max = -1000000;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (min > x)
min = x;
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 | 106 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
int main(void) {
int n = 0;
int input = 0;
int sum = 0;
int max = 0;
int min = 10000000;
CI n;
for (int i = 0; i < n; ++i) {
CI... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
int main(void) {
int n = 0;
int input = 0;
long int sum = 0;
int max = -1000001;
int min = 1000001;
CI n;
for (int i = 0; i < n; ++... | [["+", 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 | 117 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int n, p, q, r;
int main() {
p = -10000000;
q = 10000000;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
if (a > p) {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int n, p, q;
long long r;
int main() {
p = -10000000;
q = 10000000;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
if ... | [["-", 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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 122 |
#include <cstdio>
#include <iostream>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
cin >> vec[i];
}
int min = 1000000000, max = -1000000000;
unsigned long int sum = 0;
for (int i... | #include <cstdio>
#include <iostream>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
cin >> vec[i];
}
int min = 1000000000, max = -1000000000;
long long int sum = 0;
for (int i = 0... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 167 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int ary[n];
int Maximum = INT_MIN;
int Minimum = INT_MAX;
int sum = 0;
for (int r = 0; r < n; r++) {
cin >> ary[r];
if (ary[r] > Maximum)
Maximum = ary[r];
if (ary[r] < Minimum)
Minimum = ary[r];
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
int ary[n];
int Maximum = INT_MIN;
int Minimum = INT_MAX;
ll sum = 0;
for (int r = 0; r < n; r++) {
cin >> ary[r];
if (ary[r] > Maximum)
Maximum = ary[r];
if (ary[r] < Minimum)
Mi... | [["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 157], ["+", 36, 36, 0, 30, 0, 134, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 49, 78], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 124 |
#include <iostream>
using namespace std;
int main() {
int n, a;
int saidai, saisyou, goukei;
saidai = saisyou = goukei = 0;
cin >> n >> a;
n -= 1;
saidai = a;
saisyou = a;
goukei = a;
for (int i = 0; i < n; i++) {
cin >> a;
if (saidai < a) {
saidai = a;
}
if (saisyou > a) {
... | #include <iostream>
using namespace std;
int main() {
int n, a;
int saidai, saisyou;
long goukei;
saidai = saisyou = goukei = 0;
cin >> n >> a;
n -= 1;
saidai = a;
saisyou = a;
goukei = a;
for (int i = 0; i < n; i++) {
cin >> a;
if (saidai < a) {
saidai = a;
}
if (saisyou > a) ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 123 |
#include <iostream>
using namespace std;
int main() {
int n, min = 1000000, max = -1000000, sum = 0, a;
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 << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, min = 1000000, max = -1000000, a;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
cout << min << " " << max << " " << sum << "\n";
return 0... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 100 |
#include <iostream>
using namespace std;
int main(void) {
int n;
int a;
int i;
int max, min, sum;
cin >> n;
sum = 0;
max = -1000000;
min = 1000000;
for (i = 0; i < n; i++) {
cin >> a;
if (max < a) {
max = a;
}
if (min > a) {
min = a;
}
sum += a;
}
cout << m... | #include <iostream>
using namespace std;
int main(void) {
int n;
int a;
int i;
int max, min;
long sum;
cin >> n;
sum = 0;
max = -1000000;
min = 1000000;
for (i = 0; i < n; i++) {
cin >> a;
if (max < a) {
max = a;
}
if (min > a) {
min = a;
}
sum += a;
}
co... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 115 |
#include <stdio.h>
int main() {
long long sum;
int min, max, a[10000], n, cnt;
scanf("%d", &n);
for (cnt = 0; cnt < n; cnt++) {
scanf("%d", &a[cnt]);
if (cnt == 0) {
min = a[cnt];
max = a[cnt];
} else if (a[cnt] > max) {
max = a[cnt];
} else if (a[cnt] < min) {
min = a[cn... | #include <stdio.h>
int main() {
long long sum;
int min, max, a[10000], n, cnt;
scanf("%d", &n);
for (cnt = 0; cnt < n; cnt++) {
scanf("%d", &a[cnt]);
if (cnt == 0) {
min = a[cnt];
max = a[cnt];
} else if (a[cnt] > max) {
max = a[cnt];
} else if (a[cnt] < min) {
min = a[cn... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 148 |
#include <iostream>
using namespace std;
int main() {
int n, m, t, b, g;
t = 1000000;
b = -1000000;
g = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m < t) {
t = m;
}
if (m > b) {
b = m;
}
g += m;
}
cout << t << " " << b << " " << g << endl;
return 0... | #include <iostream>
using namespace std;
int main() {
int n, m, t, b;
long long g;
t = 1000000;
b = -1000000;
g = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> m;
if (m < t) {
t = m;
}
if (m > b) {
b = m;
}
g += m;
}
cout << t << " " << b << " " << g << 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]] | 1 | 108 |
#include <iostream>
int main(void) {
int n, a, min = 1000000, max = -1000000, sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a;
if (a < min) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
std::cout << min << " " << max << " " << sum << std::endl;
r... | #include <iostream>
int main(void) {
int n, a, min = 1000000, max = -1000000;
long long sum = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a;
if (a < min) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
std::cout << min << " " << max << " " << sum << st... | [["-", 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 | 107 |
#include <iostream>
using namespace std;
int main() {
int a[10000], i, max, min, sum = 0;
cin >> i;
for (int j = 0; j < i; j++) {
cin >> a[j];
}
max = a[0];
min = a[0];
for (int j = 0; j < i; j++) {
if (max < a[j]) {
max = a[j];
}
if (a[j] < min) {
min = a[j];
}
sum ... | #include <iostream>
using namespace std;
int main() {
long a[10000], i, max, min, sum = 0;
cin >> i;
for (int j = 0; j < i; j++) {
cin >> a[j];
}
max = a[0];
min = a[0];
for (int j = 0; j < i; j++) {
if (max < a[j]) {
max = a[j];
}
if (a[j] < min) {
min = a[j];
}
sum... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 149 |
#include <algorithm>
#include <iostream>
int main() {
int n, min = 1000000, max = -1000000, sum = 0;
std::cin >> n;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
min = std::min(a, min);
max = std::max(a, max);
sum += a;
}
std::cout << min << " " << max << " " << sum << std::endl;... | #include <algorithm>
#include <iostream>
int main() {
int n, min = 1000000, max = -1000000;
long sum = 0;
std::cin >> n;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
min = std::min(a, min);
max = std::max(a, max);
sum += a;
}
std::cout << min << " " << max << " " << sum << std... | [["-", 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 <stdio.h>
#include <string.h>
int main() {
int n;
int max;
int min;
long sum = 0;
int i;
int ai[10000];
int a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &ai[i]);
}
max = ai[0];
for (i = 1; i < n; i++) {
if (max < ai[i])
max = ai[i];
}
min = ai[0];
... | #include <stdio.h>
#include <string.h>
int main() {
int n;
int max;
int min;
long sum = 0;
int i;
int ai[10000];
int a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &ai[i]);
}
max = ai[0];
for (i = 1; i < n; i++) {
if (max < ai[i])
max = ai[i];
}
min = ai[0];
... | [["-", 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], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 189 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.