buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k |
|---|---|---|---|---|
#include <stdio.h>
int main(void) {
long long n, k, sum = 0, max, min;
{
scanf("%lld\n", &k);
for (int i = 1; i <= k; i++) {
scanf("%lld", &n);
if (i == 1) {
max = min = n;
}
if (max < n) {
max = n;
} else if (min < n) {
min = n;
}
sum = sum ... | #include <stdio.h>
int main(void) {
long long n, k, sum = 0, max, min;
{
scanf("%lld\n", &k);
for (int i = 1; i <= k; i++) {
scanf("%lld", &n);
if (i == 1) {
max = min = n;
}
if (max < n) {
max = n;
} else if (min > n) {
min = n;
}
sum = sum ... | [["-", 75, 76, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 121 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int i, n, x, max, min;
int sum;
// int *N;
min = 1000000;
max = -1000000;
sum = 0;
scanf("%d", &n);
// N = (int *)malloc(sizeof(int)*n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
sum += x;
if (min > x) {
min = x;
}
... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i, n, x, max, min;
long sum;
// int *N;
min = 1000000;
max = -1000000;
sum = 0;
scanf("%d", &n);
// N = (int *)malloc(sizeof(int)*n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
sum += x;
if (min > x) {
min = x;
}
... | [["-", 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]] | 0 | 121 |
#include <stdio.h>
int main(void) {
int n, a, i;
int min = 1000000;
int max = 0;
long int sum = 0;
scanf("%d", &i);
for (n = 1; n <= i; n++) {
scanf("%d", &a);
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum = sum + a;
}
printf("%d %d %lld\n", min, max,... | #include <stdio.h>
int main(void) {
int n, a, i;
int min = 1000000;
int max = -1000000;
long int sum = 0;
scanf("%d", &i);
for (n = 1; n <= i; n++) {
scanf("%d", &a);
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum = sum + a;
}
printf("%d %d %lld\n", mi... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 114 |
#include <stdio.h>
int main(void) {
int n, max, min, i, a[10000];
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
max = min = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a[i];
}
printf("... | #include <stdio.h>
int main(void) {
int n, max, min, i, a[10000];
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
max = min = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a[i];
}
printf("... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 147 |
#include <stdio.h>
int main(void) {
int n, a, i, min, max;
long long int s = 0;
min = 10000;
max = -10000;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
s += a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
printf("%d %d %lld\n", min, max, s);
... | #include <stdio.h>
int main(void) {
int n, a, i, min, max;
long long int s = 0;
min = 1000000;
max = -1000000;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
s += a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
printf("%d %d %lld\n", min, max, s)... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 115 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, min, max, sum;
int i;
scanf("%d", &n);
int *p = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", p + i);
min = *p;
max = *p;
sum = 0;
for (i = 0; i < n; i++) {
if (min > *(p + i))
min = *(p + i);
... |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, min, max;
long sum;
int i;
scanf("%d", &n);
int *p = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", p + i);
min = *p;
max = *p;
sum = 0;
for (i = 0; i < n; i++) {
if (min > *(p + i))
min = *(p + ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 170 |
#include <stdio.h>
int main() {
int a, n, max = -1000000, min = 1000000, i;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
printf("%d %d %d\n", min, max, sum);
}
| #include <stdio.h>
int main(void) {
int a, n, max = -1000000, min = 1000000, i;
long long int sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
printf("%d %d %lld\n", min, max, sum);
}
| [["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 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]] | 0 | 102 |
#include <stdio.h>
int main() {
int a[10000], min, max, n, i;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
max = min = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a[i];
}
printf("%d %... | #include <stdio.h>
int main() {
int a[10000], min, max, n, i;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
max = min = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = a[i];
}
printf("%d %... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 146 |
#include <stdio.h>
int main(int argc, char const *argv[]) {
int n;
scanf("%d", &n);
int int_num[n];
int min, max;
long long sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &int_num[i]);
sum += int_num[i];
}
min = int_num[0];
max = int_num[0];
for (int i = 0; i < n - 1; ++i) {
if (... | #include <stdio.h>
int main(int argc, char const *argv[]) {
int n;
scanf("%d", &n);
int int_num[n];
int min, max;
long long sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &int_num[i]);
sum += int_num[i];
}
min = int_num[0];
max = int_num[0];
for (int i = 0; i < n - 1; ++i) {
if (... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 172 |
#include <stdio.h>
int main() {
int n;
int num;
int i;
int min = 1000001;
int max = -1000001;
int sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &num);
sum += num;
if (min > num) {
min = num;
}
if (max < num) {
max = num;
}
}
printf("%d %d %d\n... | #include <stdio.h>
int main() {
int n;
int num;
int i;
int min = 1000001;
int max = -1000001;
long long sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &num);
sum += num;
if (min > num) {
min = num;
}
if (max < num) {
max = num;
}
}
printf("%d %... | [["-", 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]] | 0 | 112 |
#include <stdio.h>
int main() {
int n, a;
scanf("%d", &n);
scanf("%d", &a);
int max = a, min = a;
long sum = a;
for (int i = 2; i <= n; i++) {
scanf("%d", &a);
if (max < a)
max = a;
else if (min > a)
min = a;
sum += a;
}
printf("%d %d %d\n", min, max, sum);
return 0;
}
| #include <stdio.h>
int main() {
int n, a;
scanf("%d", &n);
scanf("%d", &a);
int max = a, min = a;
long long sum = a;
for (int i = 2; i <= n; i++) {
scanf("%d", &a);
if (max < a)
max = a;
else if (min > a)
min = a;
sum += a;
}
printf("%d %d %ld\n", min, max, sum);
return ... | [["+", 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]] | 0 | 115 |
#include <stdio.h>
#include <stdlib.h>
//メイン関数
int main(void) {
int n, a;
int min, max, sum;
scanf("%d", &n);
sum = 0;
min = 1000000;
max = -1000000;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
sum = sum + a;
if (min > a)
min = a;
if (max < a)
max = a;
}
printf("%d %d... | #include <stdio.h>
#include <stdlib.h>
//メイン関数
int main(void) {
int n, a;
int min, max;
long int sum;
scanf("%d", &n);
sum = 0;
min = 1000000;
max = -1000000;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
sum = sum + a;
if (min > a)
min = a;
if (max < a)
max = a;
}
pr... | [["-", 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 | 115 |
#include <stdio.h>
int main() {
int n;
int max = -1000000;
int min = 1000000;
int sum = 0;
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
sum = sum + a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
printf("%d %d %d", min, max... | #include <stdio.h>
int main() {
int n;
int max = -1000000;
int min = 1000000;
long long sum = 0;
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
sum = sum + a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
printf("%d %d %lld\n"... | [["-", 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], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 113 |
#include <stdio.h>
int main(void) {
int a;
int b;
int max = -1000000;
int low = 1000000;
int sum = 0;
int i;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &b);
if (b > max) {
max = b;
}
if (b < low) {
low = b;
}
sum += b;
}
printf("%d %d %d\n", low,... | #include <stdio.h>
int main(void) {
int a;
int b;
int max = -1000000;
int low = 1000000;
long int sum = 0;
int i;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &b);
if (b > max) {
max = b;
}
if (b < low) {
low = b;
}
sum += b;
}
printf("%d %d %ld\n"... | [["+", 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]] | 0 | 113 |
#include <stdio.h>
int main() {
int n, i, a, min, max, sum;
scanf("%d %d", &n, &min);
max = min;
sum = min;
for (i = 0; i < n - 1; i++) {
scanf("%d", &a);
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
printf("%d %d %d\n", min, max, sum);
return 0;
} | #include <stdio.h>
int main() {
int n, i, a, min, max;
long sum;
scanf("%d %d", &n, &min);
max = min;
sum = min;
for (i = 1; i < n; i++) {
scanf("%d", &a);
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
printf("%d %d %ld\n", min, max, sum);
return ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0... | 0 | 114 |
#include <iostream>
using namespace std;
int main(void) {
int n, max = 0, min = 0, sum = 0;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (i == 0) {
max = a[i];
min = a[i];
}
if (a[i] > max)
max = a[i];
if (a[i] < min)
min = ... | #include <iostream>
using namespace std;
int main(void) {
long long n, max = 0, min = 0, sum = 0;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (i == 0) {
max = a[i];
min = a[i];
}
if (a[i] > max)
max = a[i];
if (a[i] < min)
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 144 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int min, max, sum, a, b;
cin >> b >> min;
max = min;
sum = min;
for (int i = 2; i <= b; i++) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
cout << min << " " << max << " " << sum <<... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int min, max, a, b;
long int sum;
cin >> b >> min;
max = min;
sum = min;
for (int i = 2; i <= b; i++) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
cout << min << " " << max << " ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 104 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
int sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
sum = sum + v[i];
}
sort(v.begin(), v.end());
cout << v[0] << " " << v[n - 1] << " " << sum <... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
long long sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
sum = sum + v[i];
}
sort(v.begin(), v.end());
cout << v[0] << " " << v[n - 1] << " " <<... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 112 |
#include <iostream>
using namespace std;
int main() {
int min, max, sum = 0;
int n;
cin >> n;
int num[n];
for (int i = 0; i < n; i++) // n個の整数を配列に格納
{
cin >> num[i];
sum += num[i]; //合計を蓄積
}
min = num[0]; //最初の整数で初期化
max = num[0]; //
for (int i = 1; i < n; i++) {
if (min > num[i]) ... | #include <iostream>
using namespace std;
int main() {
long long min, max;
long long sum = 0;
int n;
cin >> n;
int num[n];
for (int i = 0; i < n; i++) // n個の整数を配列に格納
{
cin >> num[i];
sum += num[i]; //合計を蓄積
}
min = num[0]; //最初の整数で初期化
max = num[0]; //
for (int i = 1; i < n; 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]] | 1 | 153 |
#include <algorithm>
#include <iostream>
#include <limits.h>
using namespace std;
int main() {
int n;
cin >> n;
int amin = INT_MAX, amax = INT_MIN, sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
amin = min(amin, a);
amax = max(amax, a);
sum += a;
}
cout << amin << " " << amax <... | #include <algorithm>
#include <iostream>
#include <limits.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int amin = INT_MAX, amax = INT_MIN, sum = 0;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
amin = min(amin, a);
amax = max(amax, a);
sum += a;
}
cout << a... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 99 |
#include <iostream>
int main() {
int a, b, s, x, i, n;
s = 0;
a = -1000000; // MAX
b = 1000000; // min
std::cin >> n;
for (i = 0; i < n; i++) {
std::cin >> x;
s += x;
if (x > a)
a = x;
if (x < b)
b = x;
}
std::cout << b << " " << a << " " << s << std::endl;
return 0;
}
| #include <iostream>
int main() {
int a, b, x, i, n;
long long int s = 0;
a = -1000000; // MAX
b = 1000000; // min
std::cin >> n;
for (i = 0; i < n; i++) {
std::cin >> x;
s += x;
if (x > a)
a = x;
if (x < b)
b = x;
}
std::cout << b << " " << a << " " << s << std::endl;
retu... | [["-", 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], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 111 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(), v.end())
// const int MOD = 1000000007;
// const int INF = 1<<30;
using namespace std;
i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(), v.end())
// const int MOD = 1000000007;
// const int INF = 1<<30;
using namespace std;
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 | 124 |
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n;
cin >> x;
int min = x, max = x, sum = x;
for (int i = 2; i <= n; i = i + 1) {
cin >> x;
sum = sum + x;
if (x < min)
min = x;
if (x > max)
max = x;
}
cout << min << " " << max << " " << sum << endl;
... | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n;
cin >> x;
long min = x, max = x, sum = x;
for (int i = 2; i <= n; i = i + 1) {
cin >> x;
sum = sum + x;
if (x < min)
min = x;
if (x > max)
max = x;
}
cout << min << " " << max << " " << sum << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 108 |
#include <iostream>
using namespace std;
int main() {
int x, n, sum, min, max;
sum = 0;
max = -10000001;
min = 10000001;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
sum += x;
if (x > max) {
max = x;
}
if (x < min) {
min = x;
}
}
cout << min << " " << max << " ... | #include <iostream>
using namespace std;
int main() {
int x, n, min, max;
long long sum = 0;
max = -10000001;
min = 10000001;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
sum += x;
if (x > max) {
max = x;
}
if (x < min) {
min = x;
}
}
cout << min << " " << max ... | [["-", 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 | 108 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
using namespace std;
int main(void) {
long long n;
cin >> n;
int min = 99999, max = -99999, sum = 0;
for (long long i = 0; i < n; i++) {
long long k;
cin >> k;
if (k < min) {
min = k;
}
if (k > max) {
max = k;
}
sum += ... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
using namespace std;
int main(void) {
long long n;
cin >> n;
long long min = 999999999, max = -999999999, sum = 0;
for (long long i = 0; i < n; i++) {
long long k;
cin >> k;
if (k < min) {
min = k;
}
if (k > max) {
max = k;
... | [["-", 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 | 110 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N;
int min = 0, max = 0;
int sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
sum += tmp;
if (i == 0) {
min = max = tmp;
continue;
}
if (tmp < min)
min = tmp;
if... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N;
int min = 0, max = 0;
long sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
sum += tmp;
if (i == 0) {
min = max = tmp;
continue;
}
if (tmp < min)
min = tmp;
i... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 120 |
#include <algorithm>
#include <iostream>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); i++)
#define rfor_(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for_(i, 0, (n))
#define rrep(i, n) rfor_(i, 0, (n))
int n;
int a[100001];
int main() {
cin.tie(0);
cin >> n;
rep(i, n)... | #include <algorithm>
#include <iostream>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); i++)
#define rfor_(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for_(i, 0, (n))
#define rrep(i, n) rfor_(i, 0, (n))
int n;
int a[100001];
int main() {
cin.tie(0);
cin >> n;
rep(i, n)... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 142 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, n, sum = 0, max = -1000000, min = 1000000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x > max) {
max = x;
}
if (x < min) {
min = x;
}
sum += x;
}
cout << min << " " << max << " " << sum << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, n, sum = 0, max = -1000000, min = 1000000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x > max) {
max = x;
}
if (x < min) {
min = x;
}
sum += x;
}
cout << min << " " << max << " " << sum << en... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 102 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
long long min_ = 100001, max_ = -100001, sum = 0, newNum;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> newNum;
sum += newNum;
max_ = max(newNum, max_);
min_ = min(newNum, min_);
}
std::cout <... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
long long min_ = 1000001, max_ = -1000001, sum = 0, newNum;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> newNum;
sum += newNum;
max_ = max(newNum, max_);
min_ = min(newNum, min_);
}
std::cout... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 106 |
#include <iomanip>
#include <iostream>
#define _USE_MATH_DEFINES // for C++
#include <cmath>
using namespace std;
int main() {
int n, min, max, sum;
min = 1000000;
max = -1000000;
sum = 0;
cin >> n;
int a[n];
for (int o = 0; o < n; o++) {
cin >> a[o];
}
for (int i = 0; i < n; i++) {
sum = ... | #include <iomanip>
#include <iostream>
#define _USE_MATH_DEFINES // for C++
#include <cmath>
using namespace std;
int main() {
long n, min, max, sum;
min = 1000000;
max = -1000000;
sum = 0;
cin >> n;
int a[n];
for (int o = 0; o < n; o++) {
cin >> a[o];
}
for (int i = 0; i < n; i++) {
sum =... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 152 |
#include <iostream>
using namespace std;
int main() {
int n, i, array[10000], max, min, total = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> array[i];
}
max = array[0];
min = array[0];
for (i = 0; i < n; i++) {
if (max < array[i])
max = array[i];
if (min > array[i])
min = array[... | #include <iostream>
using namespace std;
int main() {
long long n, i, array[10000], max, min, total = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> array[i];
}
max = array[0];
min = array[0];
for (i = 0; i < n; i++) {
if (max < array[i])
max = array[i];
if (min > array[i])
min = ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 145 |
#include <iostream>
int main(int argc, char **argv) {
int n;
std::cin >> n;
int min = 1000000;
int max = -1000000;
int sum = 0;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
std::cout << m... | #include <iostream>
int main(int argc, char **argv) {
int n;
std::cin >> n;
int min = 1000000;
int max = -1000000;
long long sum = 0;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max = a;
}
sum += a;
}
std::cou... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 114 |
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a;
cin >> a;
int max_n, min_n, sum;
max_n = a;
min_n = a;
sum = 0;
sum += a;
for (int i = 1; i < n; i++) {
ci... | #include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n;
cin >> n;
long long a;
cin >> a;
long long max_n, min_n, sum;
max_n = a;
min_n = a;
sum = 0;
sum += a;
for (int i = 1; i ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 127 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#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];
sort(a.begin(), a.end());
int sum = 0;
for (int i =... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#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];
sort(a.begin(), a.end());
long sum = 0;
for (int i ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 131 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <set>
#include <vector>
using namespace std;
const int MAXN = (int)1e5 + 10;
const int INF = (int)0x3f3f3f3f;
typedef long long LL;
int n;
void work() {
scanf("%d", &n);
int mx = -INF, mi = INF, sum = 0;
for (int i = 1; i <= n; ... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <set>
#include <vector>
using namespace std;
const int MAXN = (int)1e5 + 10;
const int INF = (int)0x3f3f3f3f;
typedef long long LL;
int n;
void work() {
scanf("%d", &n);
int mx = -INF, mi = INF;
LL sum = 0;
for (int i = 1; i <... | [["-", 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, 78], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 152 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define mod 1000000007
using namespace std;
int main() {
int n;
cin >> n;
vector<int> num(n);
int sum = 0;
rep(i, n)... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define mod 1000000007
using namespace std;
int main() {
int n;
cin >> n;
vector<int> num(n);
long long sum = 0;
rep... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 126 |
#include <iostream>
#include <stdio.h>
using namespace std;
int N;
long long A[10110];
int min() {
long long min_v = A[0];
for (int i = 0; i < N; ++i) {
if (A[i] < min_v) {
min_v = A[i];
}
}
return min_v;
}
int max() {
long long max_v = A[0];
for (int i = 0; i < N; ++i) {
if (A[i] > max_... | #include <iostream>
#include <stdio.h>
using namespace std;
int N;
long long A[10110];
int min() {
long long min_v = A[0];
for (int i = 0; i < N; ++i) {
if (A[i] < min_v) {
min_v = A[i];
}
}
return min_v;
}
int max() {
long long max_v = A[0];
for (int i = 0; i < N; ++i) {
if (A[i] > max_... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]] | 1 | 220 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
int sum = accumulate(a, a + n, 0);
cout << a[0] << " " << a[n - 1] << " " << sum << endl;
return ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
long long sum = accumulate(a, a + n, 0LL);
cout << a[0] << " " << a[n - 1] << " " << sum << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13]] | 1 | 106 |
#include <iostream>
int main() {
int n, min, max, sum = 0;
bool first = true;
std::cin >> n; // skip
while (std::cin >> n) {
if (first) {
first = false;
min = max = n;
sum += n;
continue;
}
if (n < min) {
min = n;
}
if (n > max) {
max = n;
}
sum +=... | #include <iostream>
int main() {
long n, min, max, sum = 0;
bool first = true;
std::cin >> n; // skip
while (std::cin >> n) {
if (first) {
first = false;
min = max = n;
sum += n;
continue;
}
if (n < min) {
min = n;
}
if (n > max) {
max = n;
}
sum +... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 113 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 226 |
#include <algorithm>
#include <iostream>
//#include<vector>
#define MAX 10000
using namespace std;
int main() {
int m, sum = 0;
int x[MAX] = {0};
cin >> m;
// x.resize(m,0);
for (int i = 0; i < m; i++) {
cin >> x[i];
sum += x[i];
}
sort(x, x + m);
cout << x[0] << ' ' << x[m - 1] << ' ' << sum <... | #include <algorithm>
#include <iostream>
//#include<vector>
#define MAX 10000
using namespace std;
int main() {
int m = 0;
long int sum = 0;
int x[MAX] = {0};
cin >> m;
// x.resize(m,0);
for (int i = 0; i < m; i++) {
cin >> x[i];
sum += x[i];
}
sort(x, x + m);
cout << x[0] << ' ' << x[m - 1] ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 110 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> result;
string n;
string input;
getline(cin, n);
getline(cin, input);
istringstream iss(input);
string num;
while (getline(iss, num, ' ')) {... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> result;
string n;
string input;
getline(cin, n);
getline(cin, input);
istringstream iss(input);
string num;
while (getline(iss, num, ' ')) {... | [["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13]] | 1 | 161 |
// class point の練習（クラスの高度な実装）
#include <cstring>
#include <iomanip>
#include <iostream>
#define INF 1000001
using namespace std;
int main() {
int max = -INF;
int min = INF;
int sum = 0;
int N, a_i;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a_i;
if (max < a_i)
max = a_i;
if (min > a_i... | // class point の練習（クラスの高度な実装）
#include <cstring>
#include <iomanip>
#include <iostream>
#define INF 1000001
typedef long long llong;
using namespace std;
int main() {
int max = -INF;
int min = INF;
llong sum = 0;
int N, a_i;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a_i;
if (max < a_i)
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], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 110 |
#include <iostream>
using namespace std;
int N, A[10010];
int min() {
int i;
int min = A[0];
for (i = 0; i < N; i++) {
if (A[i] < min)
min = A[i];
}
return min;
}
int max() {
int i;
int max = A[0];
for (i = 0; i < N; i++) {
if (A[i] > max)
max = A[i];
}
return max;
}
int sum() {
... | #include <iostream>
using namespace std;
int N, A[10010];
int min() {
int i;
int min = A[0];
for (i = 0; i < N; i++) {
if (A[i] < min)
min = A[i];
}
return min;
}
int max() {
int i;
int max = A[0];
for (i = 0; i < N; i++) {
if (A[i] > max)
max = A[i];
}
return max;
}
long long su... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]] | 1 | 213 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, minn, maxn, sumn = 0;
cin >> n;
int a;
cin >> a;
minn = maxn = a;
sumn += a;
for (int i = 1; i < n; i++) {
cin >> a;
if (minn > a) {
minn = a;
}
if (maxn < a) {
maxn = a;
}
sumn += a;
}
cout << minn... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, minn, maxn;
long long int sumn = 0;
cin >> n;
int a;
cin >> a;
minn = maxn = a;
sumn += a;
for (int i = 1; i < n; i++) {
cin >> a;
if (minn > a) {
minn = a;
}
if (maxn < a) {
maxn = a;
}
sumn += a;
}... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 110 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::vector<long long> a;
std::cin >> n;
for (int i = 0; i < n; i++) {
int ii;
std::cin >> ii;
a.push_back(ii);
}
std::cout << *std::min_element(a.begin(), a.end()) << " "
<< *std::max... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::vector<long long> a;
std::cin >> n;
for (int i = 0; i < n; i++) {
long long ii;
std::cin >> ii;
a.push_back(ii);
}
std::cout << *std::min_element(a.begin(), a.end()) << " "
<< *st... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 135 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::vector<int> a;
std::cin >> n;
for (int i = 0; i < n; i++) {
int ii;
std::cin >> ii;
a.push_back(ii);
}
std::cout << *std::min_element(a.begin(), a.end()) << " "
<< *std::max_eleme... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::vector<long long> a;
std::cin >> n;
for (int i = 0; i < n; i++) {
int ii;
std::cin >> ii;
a.push_back(ii);
}
std::cout << *std::min_element(a.begin(), a.end()) << " "
<< *std::max... | [["-", 39, 343, 141, 344, 3, 347, 0, 77, 39, 40], ["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 134 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::vector<long long> a;
std::cin >> n;
for (int i = 0; i < n; i++) {
int ii;
std::cin >> ii;
a.push_back(ii);
}
std::cout << *std::min_element(a.begin(), a.end()) << " "
<< *std::max... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::vector<long> a;
std::cin >> n;
for (int i = 0; i < n; i++) {
long ii;
std::cin >> ii;
a.push_back(ii);
}
std::cout << *std::min_element(a.begin(), a.end()) << " "
<< *std::max_ele... | [["-", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 135 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long max_v, min_v, sum_v;
cin >> n;
vector<long long> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
min_v = *min_element(v.begin(), v.end());
max_v = *max_element(v.begin(), v.end());
sum_v = accumulate(v.begin(), v.e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long max_v, min_v, sum_v;
cin >> n;
vector<long long> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
min_v = *min_element(v.begin(), v.end());
max_v = *max_element(v.begin(), v.end());
sum_v = accumulate(v.begin(), v.e... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 1 | 138 |
#include <iomanip>
#include <iostream>
#define pi 3.14159265358979323846
using namespace std;
int main() {
int n, a[10001], i, min, max, sum = 0;
cin >> n;
cin >> a[1];
min = max = sum = a[1];
for (i = 2; i <= n; i++) {
cin >> a[i];
if (a[i] < min)
min = a[i];
if (a[i] > max)
max = a[... | #include <iomanip>
#include <iostream>
#define pi 3.14159265358979323846
using namespace std;
int main() {
long int n, a[10001], i, min, max, sum = 0;
cin >> n;
cin >> a[1];
min = max = sum = a[1];
for (i = 2; i <= n; i++) {
cin >> a[i];
if (a[i] < min)
min = a[i];
if (a[i] > max)
max... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 141 |
#include <stdio.h>
int main() {
int cs, ang, max = 0, min = 1000001;
long long int sum = 0;
scanf("%d", &cs);
for (int i = 0; i < cs; i++) {
scanf("%d", &ang);
if (max < ang)
max = ang;
if (min > ang)
min = ang;
sum = sum + ang;
}
printf("%d %d %lld\n", min, max, sum);
}
| #include <stdio.h>
int main() {
int cs, ang, max = -1000000, min = 1000001;
long long int sum = 0;
scanf("%d", &cs);
for (int i = 0; i < cs; i++) {
scanf("%d", &ang);
if (max < ang)
max = ang;
if (min > ang)
min = ang;
sum = sum + ang;
}
printf("%d %d %lld\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 | 104 |
#include <iostream>
#include <limits>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
int mina, maxa, suma;
cin >> n >> a;
mina = maxa = suma = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (mina > a)
mina = a;
if (maxa < a)
maxa = a;
suma... | #include <iostream>
#include <limits>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
long long int mina, maxa, suma;
cin >> n >> a;
mina = maxa = suma = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (mina > a)
mina = a;
if (maxa < a)
maxa = a... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 121 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 159 |
#include <cstdio>
int main(void) {
int n, x, min = 1000000, max = -1000000;
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
sum += x;
if (x < min)
min = x;
if (x > max)
max = x;
}
printf("%d %d %d\n", min, max, sum);
return 0;
} | #include <cstdio>
int main(void) {
int n, x, min = 1000000, max = -1000000;
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
sum += x;
if (x < min)
min = x;
if (x > max)
max = x;
}
printf("%d %d %lld\n", min, max, sum);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 105 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int min = 0;
int max = 0;
int sum = 0;
for (int i = 0; i < n;... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int min = 0;
int max = 0;
long long sum = 0;
for (int i = 0; ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 167 |
#include <iostream>
using namespace std;
int main() {
int n, max, min;
long long sum = 0;
int a[1000];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum = sum + a[i];
if (i == 1) {
max = a[i];
min = a[i];
} else {
if (max < a[i]) {
max = a[i];
}
if... | #include <iostream>
using namespace std;
int main() {
int n, i, max, min;
long long sum = 0;
int a[100000];
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
sum = sum + a[i];
if (i == 1) {
max = a[i];
min = a[i];
} else {
if (max < a[i]) {
max = a[i];
}
i... | [["+", 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, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40]] | 1 | 146 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0, max = -1000000, min = 1000000;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
sum += a;
min = (min > a) ? a : min;
max = (max < a) ? a : max;
}
cout << min << ' ' << max << ' ' << sum ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long sum = 0, max = -1000000, min = 10000000;
for (int i = 0; i < n; ++i) {
long long a;
cin >> a;
sum += a;
min = (min > a) ? a : min;
max = (max < a) ? a : max;
}
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, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 103 |
#include <iostream>
using namespace std;
int main() {
int x, y, a, b, c;
cin >> x;
a = 1000001;
b = -1000001;
c = 0;
for (; x > 0; x = x - 1) {
cin >> y;
if (a > y) {
a = y;
}
if (b < y) {
b = y;
}
c = c + y;
}
cout << a << " " << b << " " << c << endl;
}
| #include <iostream>
using namespace std;
int main() {
long x, y, a, b, c;
cin >> x;
a = 1000001;
b = -1000001;
c = 0;
for (; x > 0; x = x - 1) {
cin >> y;
if (a > y) {
a = y;
}
if (b < y) {
b = y;
}
c = c + y;
}
cout << a << " " << b << " " << c << endl;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 106 |
#include <iostream>
using namespace std;
int main(void) {
int a, n, min, max;
int sum = 0;
cin >> n;
cin >> a;
max = a;
min = a;
sum += a;
for (int i = 1; i < n; ++i) {
cin >> a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum += a;
}
cout << min << ' ... | #include <iostream>
using namespace std;
int main(void) {
long a, n, min, max;
long sum = 0;
cin >> n;
cin >> a;
max = a;
min = a;
sum += a;
for (int i = 1; i < n; ++i) {
cin >> a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
sum += a;
}
cout << min << ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 116 |
#include <algorithm>
#include <climits>
#include <stdio.h>
using namespace std;
int main() {
int n, x;
int min_num = INT_MIN, max_num = INT_MAX, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
min_num = min(min_num, x);
max_num = max(max_num, x);
sum += x;
}
printf(... | #include <algorithm>
#include <climits>
#include <stdio.h>
using namespace std;
int main() {
int n, x;
int min_num = INT_MAX, max_num = INT_MIN;
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
min_num = min(min_num, x);
max_num = max(max_num, x);
sum += x;
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 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, 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() {
int n, min, max, sum;
sum = 0;
min = 1000000;
max = -1000000;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
max = a[i];
... | #include <iostream>
using namespace std;
int main() {
int n, min, max;
long sum;
sum = 0;
min = 1000000;
max = -1000000;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
max = ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 145 |
#include <iomanip>
#include <iostream>
using namespace std;
long long a, n, smallest, biggest, sum;
char op;
int main() {
cin >> n;
smallest = 0;
biggest = 0;
sum = 0;
for (int i = 0; i + 1 <= n; i++) {
cin >> a;
if (smallest == 0 || a < smallest) {
smallest = a;
}
if (biggest =... |
#include <iomanip>
#include <iostream>
using namespace std;
long long a, n, smallest, biggest, sum;
char op;
int main() {
cin >> n;
smallest = 0;
biggest = 0;
sum = 0;
for (int i = 0; i + 1 <= n; i++) {
cin >> a;
if (i == 0 || a < smallest) {
smallest = a;
}
if (i == 0 || a > bi... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 11, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60]] | 1 | 124 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int x;
cin >> x;
vector<int> vec(x);
for (int i = 0; i < x; i++) {
cin >> vec[i];
}
int y = vec.at(0);
for (int i = 1; i < x; ++i) {
y = min(y, vec.at(i));
}
int z = vec.at(0);
for (int i = 1; i < x; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int x;
cin >> x;
vector<int> vec(x);
for (int i = 0; i < x; i++) {
cin >> vec[i];
}
int y = vec.at(0);
for (int i = 1; i < x; ++i) {
y = min(y, vec.at(i));
}
int z = vec.at(0);
for (int i = 1; i < x; ++i) {
... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 1 | 189 |
//↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0}, dy[] = {0, 1}, alp[30];
long long fac[200005], finv[200005], inv[200... | [["+", 36, 36, 0, 30, 0, 43, 49, 50, 0, 32], ["+", 0, 30, 0, 43, 49, 50, 51, 91, 17, 33], ["+", 0, 30, 0, 43, 49, 50, 51, 91, 28, 22]] | 1 | 320 |
#include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
cinf(n, a);
... | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
cinf(n... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 130 |
#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];
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = 0; i < n; i++) {
sum = sum + a[i];
}
cout << a[0] << " " << a... | #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];
}
sort(a.begin(), a.end());
long long sum = 0;
for (int i = 0; i < n; i++) {
sum = 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 | 126 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long a, b, c = 1000001, d = -c, e = 0;
cin >> a;
for (int h = 1; h <= a; h++) {
cin >> b;
if (c > b) {
c = b;
// min
}
if (b > d) {
d = b;
// max
}
e +... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long a, b, c = 1000001, d = -c, e = 0;
cin >> a;
for (int h = 1; h <= a; h++) {
cin >> b;
if (c > b) {
c = b;
// min
}
if (b > d) {
d = b;
// max
}
e +... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22]] | 1 | 109 |
#include <iostream>
using namespace std;
int main(void) {
int n, a[10001] = {0}, max, min, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
for (int i = 0; i < n; i++) {
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) {
min = a[i];
}
... | #include <iostream>
using namespace std;
int main(void) {
long long int n, a[10001] = {0}, max, min, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
for (long long int i = 0; i < n; i++) {
if (a[i] > max) {
max = a[i];
}
if (a[i] < min) {
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]] | 1 | 171 |
#include <iostream>
using namespace std;
int main(void) {
int n;
int a[10001] = {0}; // 10001個
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long int min = 1000000, max = -1000000, sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
} else if (a[i] > max) {... | #include <iostream>
using namespace std;
int main(void) {
int n;
int a[10001] = {0}; // 10001個
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long int min = 1000000, max = -1000000, sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 149 |
#include <iostream>
using namespace std;
int main(void) {
int n;
long long a[10001] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int min = 1000000, max = -1000000, sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
max = a[... | #include <iostream>
using namespace std;
int main(void) {
int n;
long long a[10001] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long min = 1000000, max = -1000000, sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
ma... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 146 |
#include <iostream>
using namespace std;
int main(void) {
long long int n, a[10001] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long int min = 1000000, max = -100000, sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
m... | #include <iostream>
using namespace std;
int main(void) {
int n;
long long a[10001] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long int min = 1000000, max = -1000000, sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] < min) {
min = a[i];
}
if (a[i] > max) {
... | [["-", 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, 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 | 148 |
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n;
long long a = 0, b = 10000000, c = 0;
cin >> n;
for (long long i = 0; i < n; i++) {
int in;
cin >> in;
if (in >= a) {
a = in;
} else {
}
if (in <= b) {
b = in;
} else {
}
c = c + ... |
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n;
long long a = -1000000, b = 10000000, c = 0;
cin >> n;
for (long long i = 0; i < n; i++) {
int in;
cin >> in;
if (in >= a) {
a = in;
} else {
}
if (in <= b) {
b = in;
} else {
}
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 114 |
#include <iostream>
using namespace std;
int main(void) {
int max = 0;
int min = 2147483647;
long sum = 0;
int n, in;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> in;
if (min > in)
min = in;
if (max < in)
max = in;
sum = sum + in;
}
cout << min << " " << max << " " <<... | #include <iostream>
using namespace std;
int main(void) {
int max = -2147483648;
int min = 2147483647;
long sum = 0;
int n, in;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> in;
if (min > in)
min = in;
if (max < in)
max = in;
sum = sum + in;
}
cout << min << " " << max... | [["-", 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(void) {
int n;
int ai;
int x = 10000000000, y = (-100000000000), z = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ai;
if (ai < x) {
x = ai;
}
if (ai > y) {
y = ai;
}
z = ai + z;
}
cout << x << " " << y << " " ... | #include <iostream>
using namespace std;
int main(void) {
int n;
int ai;
long long x = 10000000000, y = (-100000000000), z = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ai;
if (ai < x) {
x = ai;
}
if (ai > y) {
y = ai;
}
z = ai + z;
}
cout << x << " " << y <... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 106 |
#include <iostream>
using namespace std;
int main(void) {
int a, n;
int x = 1000000, y = -1000000, z = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (x > a) {
x = a;
}
if (y < a) {
y = a;
}
z = z + a;
}
cout << x << " " << y << " " << z << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, n;
long long x = 1000000, y = -1000000, z = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (x > a) {
x = a;
}
if (y < a) {
y = a;
}
z = z + a;
}
cout << x << " " << y << " " << z << endl;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 103 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n, 0);
for (auto &&x : v)
cin >> x;
long long min = *(min_element(v.cbegin(), v.cend()));
long long max = *(max_element(v.cbegin(), v.cend()));
long lo... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n, 0);
for (auto &&x : v)
cin >> x;
long long min = *(min_element(v.cbegin(), v.cend()));
long long max = *(max_element(v.cbegin(), v.cend()));
long lo... | [["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13]] | 1 | 137 |
#include <iostream>
using namespace std;
#include <stdio.h>
int main() {
long long n, a, min = 10000, max = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum = sum + a;
if (a < min)
min = a;
if (a > max)
max = a;
}
printf("%ld %ld %ld\n", min, max, sum);
return... | #include <iostream>
using namespace std;
#include <stdio.h>
int main() {
long long n, a, min = 1000000, max = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum = sum + a;
if (a < min)
min = a;
if (a > max)
max = a;
}
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 | 99 |
#ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
using namespace std;
using namespace std::placeholders;
using ll = long long;
const int INF = 1e9 + 7;
const ll INF_LL = 1e18 + 7;
#define __overload3(_1, _2, _3, name, ...) name
#define rep(...) ... | #ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
using namespace std;
using namespace std::placeholders;
using ll = long long;
const int INF = 1e9 + 7;
const ll INF_LL = 1e18 + 7;
#define __overload3(_1, _2, _3, name, ...) name
#define rep(...) ... | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 1,002 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> x(n);
REP(i, n) {
cin >> x[i];
sum += x[i];
}
sort(x.begin(), x.end());
cout << x[0] << " " << x[x.size() - 1] << " ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
using namespace std;
int main() {
int64_t n, sum = 0;
cin >> n;
vector<int64_t> x(n);
REP(i, n) {
cin >> x[i];
sum += x[i];
}
sort(x.begin(), x.end());
cout << x[0] << " " << x[x.size() - ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40]] | 1 | 117 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n);
for (int i = 0; i < n; i++)
scanf("%d", &a.at(i));
int max_a, min_a, sum_a;
max_a = -10000000;
min_a = 10000000;
sum_a = 0;
for (int i = 0; i < n; i++) {
if (max_a < a.at(i))
max_a = a.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n);
for (int i = 0; i < n; i++)
scanf("%lld", &a.at(i));
int64_t max_a, min_a, sum_a;
max_a = -10000000;
min_a = 10000000;
sum_a = 0;
for (int i = 0; i < n; i++) {
if (max_a < a.at(i))
max_a = ... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 159 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 199 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int min = 65536, max = -65536, sum = 0, nline, i;
cin >> nline;
const int n = nline;
int arr[n];
// int *arr = new int(nline);
for (i = 0; i < n; i++) {
cin >> arr[i];
}
for (i = 0; i <... | #include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
long long min = 1000000, max = -1000000, sum = 0, nline, i;
cin >> nline;
const int n = nline;
int arr[n];
// int *arr = new int(nline);
for (i = 0; i < n; i++) {
cin >> arr[i];
}
for (... | [["-", 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 | 171 |
#include <iostream>
using namespace std;
int main() {
int n, seisu, goukei;
int i;
int max, min;
cin >> n;
cin >> seisu;
max = seisu;
min = seisu;
goukei = seisu;
for (i = 0; i < n - 1; i++) {
cin >> seisu;
if (max <= seisu) {
max = seisu;
}
if (min >= seisu) {
min... | #include <iostream>
using namespace std;
int main() {
long long int n, seisu, goukei;
int i;
long long int max, min;
cin >> n;
cin >> seisu;
max = seisu;
min = seisu;
goukei = seisu;
for (i = 0; i < n - 1; i++) {
cin >> seisu;
if (max <= seisu) {
max = seisu;
}
if (min >=... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 118 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define PI acos(-1)
int main() {
int n;
cin >> n;
vector<int> in(n);
int sum = 0;
rep(i, n) {
cin >> in[i];
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define PI acos(-1)
int main() {
int n;
cin >> n;
vector<int> in(n);
long long int sum = 0;
rep(i, n) {
cin >... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 125 |
#include <iostream>
int main(int argc, const char *argv[]) {
// insert code here...
int n;
std::cin >> n;
int min = 1000001;
int max = -1000001;
int sum = 0;
for (int i = 0; i < n; i++) {
int val;
std::cin >> val;
if (min > val) {
min = val;
}
if (max < val) {
max = val... | #include <iostream>
int main(int argc, const char *argv[]) {
// insert code here...
int n;
std::cin >> n;
long int min = 1000001;
long int max = -1000001;
long long int sum = 0;
for (int i = 0; i < n; i++) {
int val;
std::cin >> val;
if (min > val) {
min = val;
}
if (max < val... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 120 |
#include <iostream>
using namespace std;
int main() {
int n, i, j, min = 1000000, max = -1000000, sum = 0;
for (cin >> n, j = 0; j < n; ++j) {
cin >> i;
if (i < min)
min = i;
if (i > max)
max = i;
sum += i;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, i, j, min = 1000000, max = -1000000;
long sum = 0;
for (cin >> n, j = 0; j < n; ++j) {
cin >> i;
if (i < min)
min = i;
if (i > max)
max = i;
sum += i;
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 99 |
// 2014/07/16 Tazoe
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a_min = 1000001;
int a_max = -1000001;
int a_sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < a_min) {
a_min = a;
}
if (a > a_max) {
a_max = a;
}
a_sum... | // 2014/07/16 Tazoe
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a_min = 1000001;
int a_max = -1000001;
long long a_sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < a_min) {
a_min = a;
}
if (a > a_max) {
a_max = a;
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 107 |
#include <cstdio>
#include <iostream>
//#define PI 3.141592653589
using namespace std;
int main() {
int n, a, min = 1000000, max = -1000000, 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 << " " << ... | #include <cstdio>
#include <iostream>
//#define PI 3.141592653589
using namespace std;
int main() {
int n, a, min = 1000000, max = -1000000;
long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < min)
min = a;
if (a > max)
max = a;
sum += a;
}
cout << min << ... | [["-", 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 | 101 |
#include <iostream>
#include <limits>
using namespace std;
int main() {
int n, a, i, min, max, sum;
cin >> n;
for (i = 0, min = numeric_limits<int>::max(),
max = numeric_limits<int>::min(), sum = 0;
i < n; i++) {
cin >> a;
sum += a;
if (a < min)
min = a;
if (max < a)
max ... | #include <iostream>
#include <limits>
using namespace std;
int main() {
int n, i, min, max;
long long a, sum;
cin >> n;
for (i = 0, min = numeric_limits<int>::max(),
max = numeric_limits<int>::min(), sum = 0;
i < n; i++) {
cin >> a;
sum += a;
if (a < min)
min = a;
if (max < ... | [["-", 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 | 121 |
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, sum = 0, max, min, a;
cin >> n;
REP(i, n) {
cin >> a;
sum += a;
if (i == 0) {
max = a;
min = a;
}
if (max < a)
max = a;
if (m... | #include <algorithm>
#include <iostream>
#include <string>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
long long sum = 0, max, min, a;
cin >> n;
REP(i, n) {
cin >> a;
sum += a;
if (i == 0) {
max = a;
min = a;
}
if (max < a)
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 | 111 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int min = 1000000;
int max = -1000000;
int sum = 0;
int n;
int a;
int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
sum += a;
if (a < min)
min = a;
if (a > max)
max = a;
}
cout << min << " " << ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int min = 1000000;
int max = -1000000;
long long sum = 0;
int n;
int a;
int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
sum += a;
if (a < min)
min = a;
if (a > max)
max = a;
}
cout << min << "... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 106 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[10000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << *min_element(a, a + n) << " " << *max_element(a, a + n) << " "
<< accumulate(a, a + n, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[10000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << *min_element(a, a + n) << " " << *max_element(a, a + n) << " "
<< accumulate(a, a + n, 0LL) << endl;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 90 |
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, count_max, count_min, temp, sum = 0;
cin >> n;
rep(i, n) {
cin >> temp;
if (i == 0) {
count_max = count_min = temp;
} else {
count_max = max(count_max, temp);... | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, count_max, count_min, temp;
long long sum = 0;
cin >> n;
rep(i, n) {
cin >> temp;
if (i == 0) {
count_max = count_min = temp;
} else {
count_max = max(count... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 111 |
#include <iostream>
using namespace std;
int main() {
int n, in, min = 1000000, max = -1000000;
long sum = 0;
cin >> n;
while (n--) {
cin >> in;
sum += in;
if (in > max) {
max = in;
} else if (in < min) {
min = in;
}
}
cout << min << " " << max << " " << sum << endl;
retur... | #include <iostream>
using namespace std;
int main() {
int n, in, min = 1000000, max = -1000000;
long sum = 0;
cin >> n;
while (n--) {
cin >> in;
sum += in;
if (in > max) {
max = in;
}
if (in < min) {
min = in;
}
}
cout << min << " " << max << " " << sum << endl;
return... | [["-", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 95 |
#include <stdio.h>
int main(void) {
long long int min = 10000, max = -10000, sum = 0;
int i, n, input;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input);
if (input <= min)
min = input;
if (input >= max)
max = input;
sum += input;
}
printf("%lld %lld %lld\n", min, ... | #include <stdio.h>
int main(void) {
long long int min = 1000000, max = -1000000, sum = 0;
int i, n, input;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &input);
if (input <= min)
min = input;
if (input >= max)
max = input;
sum += input;
}
printf("%lld %lld %lld\n", m... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 107 |
#include <iostream>
using namespace std;
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
int main() {
int n, tmp, mi = 1000001, ma = -1000001, total = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
ma = max(ma, tmp);
mi = min(mi, tmp);
total += tmp;
}... | #include <iostream>
using namespace std;
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
int main() {
int n, tmp, mi = 1000001, ma = -1000001;
long long int total = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
ma = max(ma, tmp);
mi = min(mi, tmp);
t... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 109 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int min, max, sum;
cin >> min;
max = min;
sum = min;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int min, max;
long long int sum;
cin >> min;
max = min;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 128 |
#include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
_;
int n;
cin >> n;
in... | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
_;
int n;
cin >> n;
lo... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 104 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static double pi = 4 * atan(1.0);
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];
}
sort(begin(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const static double pi = 4 * atan(1.0);
int main() {
long long n, sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
sort(... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 126 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | [["-", 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, 78]] | 1 | 190 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.