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 | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <iostream>
using namespace std;
int main() {
int n, s[1000], i;
while (cin >> n && n > 0) {
int sum = 0, maximum = 0, minimum = 10000;
for (i = 0; i > n; i++) {
cin >> s[i];
sum += s[i];
}
for (i = 0; i > n; i++) {
maximum = max(maximum, s[i]);
minimum = min(minimu... | #include <iostream>
using namespace std;
int main() {
int n, s[1000], i;
while (cin >> n && n > 0) {
int sum = 0, maximum = 0, minimum = 10000;
for (i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
for (i = 0; i < n; i++) {
maximum = max(maximum, s[i]);
minimum = min(minimu... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 133 | 4 |
#include <stdio.h>
int INF = 1e9;
int main() {
int n;
int s[100];
while (1) {
scanf("%d", &n);
if (n == 0)
break;
int sum = 0;
int avg = 0;
int min = INF;
int max = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s[i]);
sum += s[i];
if (max < s[i]) {
ma... | #include <stdio.h>
int INF = 1e9;
int main() {
int n;
int s[100];
while (1) {
scanf("%d", &n);
if (n == 0)
break;
int sum = 0;
int avg = 0;
int min = INF;
int max = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s[i]);
sum += s[i];
if (max < s[i]) {
ma... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 167 | 1 |
#include <stdio.h>
int main() {
int n, s;
int maxm, mini, sum;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
sum = 0;
maxm = 1000;
mini = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s);
sum = sum + s;
if (maxm < s) {
maxm = s;
}
if (mini > ... | #include <stdio.h>
int main() {
int n, s;
int maxm, mini, sum;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
sum = 0;
maxm = 0;
mini = 1000;
for (int i = 0; i < n; i++) {
scanf("%d", &s);
sum = sum + s;
if (maxm < s) {
maxm = s;
}
if (mini > ... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 137 | 4 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
while (1) {
int n;
int sum = 0;
cin >> n;
if (n == 0) {
return 0;
}
int s;
int max = -1;
int min = 9999;
for (int i = 0; i < n; i++) {
cin >> s;
sum += s;
if (s > max) {
max = s... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
while (1) {
int n;
int sum = 0;
cin >> n;
if (n == 0) {
return 0;
}
int s;
int max = -1;
int min = 9999;
for (int i = 0; i < n; i++) {
cin >> s;
sum += s;
if (s >= max) {
max ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 134 | 14 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int num;
while (true) {
int ans = 0;
cin >> num;
if (num != 0) {
int a[num];
for (int i = 0; i < num; i++) {
cin >> a[i];
}
sort(a, a + num);
for (int i = 1; i < num - 1; i++) {
ans +... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int num;
while (true) {
int ans = 0;
cin >> num;
if (num != 0) {
int a[num];
for (int i = 0; i < num; i++) {
cin >> a[i];
}
sort(a, a + num);
for (int i = 1; i < num - 1; i++) {
ans +... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 24], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 31, 22], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 25]] | 1 | 115 | 6 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
return 0;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int max = 0;
int min = 1000;
int sum = 0;
for (int i = 0; i <= n; i++) {
if (a[i] > max)
max = ... | #include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
return 0;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int max = 0;
int min = 1000;
int sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] > max)
max = a... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 147 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, s[101];
while (cin >> n && n > 0) {
int mean = 0;
for (int i = 0; i < n; i++)
cin >> s[i];
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, s[101];
while (cin >> n && n > 0) {
int mean = 0;
for (int i = 0; i < n; i++)
cin >> s[i];
... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 24], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 31, 22], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 25]] | 1 | 115 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long int
#define ld long long double
#define reps(i, f, n) for (int i = f; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define m1 cout << "move1" << endl
#define m2 cout << "move2" << endl... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long int
#define ld long long double
#define reps(i, f, n) for (int i = f; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define m1 cout << "move1" << endl
#define m2 cout << "move2" << endl... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 79], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 13]] | 1 | 175 | 4 |
#include <iostream>
using namespace std;
int s;
int n, maxn, minn, sum;
int main() {
while (1) {
cin >> n;
if (n == 0)
break;
minn = 1001;
maxn = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sum += s;
if (maxn < s)
maxn = s;
if (minn > s)
minn = s;
... | #include <iostream>
using namespace std;
int s;
int n, maxn, minn, sum;
int main() {
while (1) {
cin >> n;
if (n == 0)
break;
minn = 1001;
maxn = 0;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sum += s;
if (maxn < s)
maxn = s;
if (minn > s)
m... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 117 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
bool b[33000];
int main() {
int n;
while (cin >> n && n) {
int a = 10000000, b = -100, x;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
a = min(a, x);
b = max(b, x);
}
su... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
bool b[33000];
int main() {
int n;
while (cin >> n && n) {
int a = 10000000, b = -100, x;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
a = min(a, x);
b = max(b, x);
}
su... | [["+", 3, 4, 0, 16, 12, 74, 51, 23, 0, 24], ["+", 3, 4, 0, 16, 12, 74, 51, 23, 0, 25]] | 1 | 126 | 2 |
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
int sum = 0, max = 0, min = 1000, point;
for (int i = 1; i <= n; i++) {
... | #include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
int sum = 0, max = 0, min = 1000, point;
for (int i = 1; i <= n; i++) {
... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 142 | 1 |
#include <iostream>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0) {
return 0;
}
int point[n];
for (int i = 0; i < n; i++) {
cin >> point[i];
}
int sum = 0;
int max = -1;
int min = 1001;
for (int i = 0; i < n; i++) {
if ... | #include <iostream>
using namespace std;
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0) {
return 0;
}
int point[n];
for (int i = 0; i < n; i++) {
cin >> point[i];
}
int sum = 0;
int max = -1;
int min = 1001;
for (int i = 0; i < n; i++) {
if ... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 159 | 2 |
#include <iostream>
#define INF (2 << 29)
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
for (;;) {
int a, n, s = 0, max = 0, min = INF;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a;
s += a;
if (max < a)
max =... | #include <iostream>
#define INF (2 << 29)
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
for (;;) {
int a, n, s = 0, max = 0, min = INF;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a;
s += a;
if (max < a)
max =... | [["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 24], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 25]] | 1 | 126 | 4 |
#include <climits>
#include <iostream>
using namespace std;
int main(void) {
int n, m, max, min, answer;
while (1) {
cin >> n;
max = 0;
min = INT_MAX;
answer = 0;
if (!n)
break;
for (int i = 0; i < n; i++) {
cin >> m;
if (m > max)
max = m;
else if (m < min)
... | #include <climits>
#include <iostream>
using namespace std;
int main(void) {
int n, m, max, min, answer;
while (1) {
cin >> n;
max = 0;
min = INT_MAX;
answer = 0;
if (!n)
break;
for (int i = 0; i < n; i++) {
cin >> m;
if (m > max)
max = m;
if (m < min)
... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 121 | 1 |
#include <iostream>
using namespace std;
int main() {
int a[101];
int b[20];
int n = 0;
int i = 0;
int max = 0;
int min = 1000;
int sum = 0;
int counter = 0;
while (1) {
max = 0;
min = 1000;
sum = 0;
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++) {
cin >> a[i... | #include <iostream>
using namespace std;
int main() {
int a[101];
int b[20];
int n = 0;
int i = 0;
int max = 0;
int min = 1000;
int sum = 0;
int counter = 0;
while (1) {
max = 0;
min = 1000;
sum = 0;
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++) {
cin >> a[i... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 192 | 2 |
#include <iostream>
using namespace std;
int larger(int x, int y) {
int z = 0;
if (x > y)
z = x;
else
z = y;
return z;
}
int smaller(int x, int y) {
int z = 0;
if (x < y)
z = x;
else
z = y;
return z;
}
int main(void) {
int s = 1;
while (s == 1) {
int sinsa, a[100], sum = 0, ave;
... | #include <iostream>
using namespace std;
int larger(int x, int y) {
int z = 0;
if (x > y)
z = x;
else
z = y;
return z;
}
int smaller(int x, int y) {
int z = 0;
if (x < y)
z = x;
else
z = y;
return z;
}
int main(void) {
int s = 1;
while (s == 1) {
int sinsa, a[100], sum = 0, ave;
... | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 57, 64, 37, 0, 38], ["+", 0, 52, 8, 9, 0, 57, 64, 37, 0, 13]] | 1 | 267 | 5 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
while (true) {
int n, A[100] = {0};
cin >> n;
if (n == 0)
break;
rep(i, n) cin >> A[i];
sort(A, A + n);
int sum = 0;
rep(i, n - 2) sum += A[i + 1];
cout << sum / n << endl... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
while (true) {
int n, A[100] = {0};
cin >> n;
if (n == 0)
break;
rep(i, n) cin >> A[i];
sort(A, A + n);
int sum = 0;
rep(i, n - 2) sum += A[i + 1];
cout << sum / (n - 2) <... | [["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 24], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 25]] | 1 | 106 | 4 |
#include <stdio.h>
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int main() {
int n, top, bot, tot, temp;
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
scanf("%d", &top);
tot = bot = top;
for (int i = ... | #include <stdio.h>
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int main() {
int n, top, bot, tot, temp;
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
scanf("%d", &top);
tot = bot = top;
for (int i = ... | [["+", 0, 2, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 16, 12, 23, 0, 25]] | 1 | 172 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int n, av, max, min, sum = 0, s;
cin >> n;
if (n == 0)
break;
cin >> s;
sum = s;
max = s;
min = s;
for (int i = 1; i < n; i++) {
cin >> s;
sum += s;
if (s > max)
max = s;
if (s... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int n, av, max, min, sum = 0, s;
cin >> n;
if (n == 0)
break;
cin >> s;
sum = s;
max = s;
min = s;
for (int i = 1; i < n; i++) {
cin >> s;
sum += s;
if (s > max)
max = s;
if (s... | [["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 1 | 128 | 2 |
#include <algorithm>
#include <iostream>
#define FOR(i, l, n) for (int i = (l); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define MAX_JUDGE 100
using namespace std;
int main() {
int n, score[MAX_JUDGE];
while (cin >> n, n) {
REP(i, n) cin >> score[i];
sort(score, score + n);
int sum = 0;
FOR(i,... | #include <algorithm>
#include <iostream>
#define FOR(i, l, n) for (int i = (l); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define MAX_JUDGE 100
using namespace std;
int main() {
int n, score[MAX_JUDGE];
while (cin >> n, n) {
REP(i, n) cin >> score[i];
sort(score, score + n);
int sum = 0;
FOR(i,... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 110 | 22 |
#include <algorithm>
#include <iostream>
#include <numeric>
#define FOR(i, l, n) for (int i = (l); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define MAX_JUDGE 100
using namespace std;
int main() {
int n, score[MAX_JUDGE];
while (cin >> n, n) {
REP(i, n) cin >> score[i];
sort(score, score + n);
int ... | #include <algorithm>
#include <iostream>
#include <numeric>
#define FOR(i, l, n) for (int i = (l); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define MAX_JUDGE 100
using namespace std;
int main() {
int n, score[MAX_JUDGE];
while (cin >> n, n) {
REP(i, n) cin >> score[i];
sort(score, score + n);
int ... | [["-", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 110 | 2 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
using na... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
using na... | [["-", 8, 9, 0, 9, 0, 57, 75, 76, 0, 95]] | 1 | 229 | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); ... | [["+", 0, 2, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 0, 2, 3, 4, 0, 16, 12, 23, 0, 25]] | 1 | 200 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> sss(20);
for (int l = 0; l < 2000; l++) {
int A;
cin >> A;
if (A == 0) {
break;
}
int cnt = 0;
vector<int> vec(A);
for (int i = 0; i < A; i++) {
cin >> vec[i];
cnt += vec[i];
}
sort(vec.beg... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> sss(20);
for (int l = 0; l < 20; l++) {
int A;
cin >> A;
if (A == 0) {
break;
}
int cnt = 0;
vector<int> vec(A);
for (int i = 0; i < A; i++) {
cin >> vec[i];
cnt += vec[i];
}
sort(vec.begin... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 23, 0, 24], ["+", 0, 16, 31, 23, 0, 16, 12, 23, 0, 25], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 139 | 6 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define MOD 1000000007ll
#define INF 1000000000ll
#define EPS 1e-10
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define MOD 1000000007ll
#define INF 1000000000ll
#define EPS 1e-10
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) ... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 24], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 31, 22], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 25]] | 1 | 183 | 6 |
#include <iostream>
using namespace std;
int main() {
int n;
int j[110];
int max, min;
for (; cin >> n, n != 0;) {
for (int i = 0; i < n; i++) {
cin >> j[i];
}
max = min = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
if (max < j[i])
max = j[i];
if (min > j[i])
... | #include <iostream>
using namespace std;
int main() {
int n;
int j[110];
int max, min;
for (; cin >> n, n != 0;) {
for (int i = 0; i < n; i++) {
cin >> j[i];
}
max = 0;
min = 2000;
int sum = 0;
for (int i = 0; i < n; i++) {
if (max < j[i])
max = j[i];
if (min >... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13]] | 1 | 150 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
return 0;
vector<int> V;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
V.push_back(t);
}
sort(V.begin(), V.end());
int ans = 0;
f... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
return 0;
vector<int> V;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
V.push_back(t);
}
sort(V.begin(), V.end());
int ans = 0;
f... | [["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 24], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 25]] | 1 | 127 | 4 |
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n, s, sum, maxs, mins, i;
while ((cin >> n), n) {
sum = maxs = 0;
mins = 1000;
for (i = 0; i < n; i++) {
cin >> s;
sum += s;
maxs = max(maxs, s);
mins = min(mins, s);
}
sum = (sum - maxs - mins)... | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n, s, sum, maxs, mins, i;
while ((cin >> n), n) {
sum = maxs = 0;
mins = 1000;
for (i = 0; i < n; i++) {
cin >> s;
sum += s;
maxs = max(maxs, s);
mins = min(mins, s);
}
sum = (sum - maxs - mins)... | [["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 1 | 108 | 4 |
#include <stdio.h>
int main() {
int n;
while (scanf("%d", &n), n) {
int max = 0, min = 1000, s;
long sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s);
sum += s;
max = max < s ? s : max;
min = s < min ? s : min;
}
printf("%ld", (sum - min - max) / (n - 2));
}
} | #include <stdio.h>
int main() {
int n;
while (scanf("%d", &n), n) {
int max = 0, min = 1000, s;
long sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s);
sum += s;
max = max < s ? s : max;
min = s < min ? s : min;
}
printf("%ld\n", (sum - min - max) / (n - 2));
}
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 114 | 1 |
#include <iostream>
using namespace std;
int main() {
int n, sum, max, min;
while (cin >> n && n > 0) {
int S;
min = 1000000000;
max = 0;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> S;
sum += S;
if (min > S) {
min = S;
}
if (max < S) {
max = S;
... | #include <iostream>
using namespace std;
int main() {
int n, sum, max, min;
while (cin >> n && n > 0) {
int S;
min = 1000000000;
max = 0;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> S;
sum += S;
if (min > S) {
min = S;
}
if (max < S) {
max = S;
... | [["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 24], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 16, 12, 23, 0, 25]] | 1 | 115 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, m, i;
int ave[1000] = {0};
m = 0;
while (1) {
int point[100] = {0};
int min = 1000;
int max = 0;
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++) {
cin >> point[i];
if (point[i] > max)
max = poin... | #include <iostream>
using namespace std;
int main() {
int n, m, i;
int ave[1000] = {0};
m = 0;
while (1) {
int point[100] = {0};
int min = 1000;
int max = 0;
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++) {
cin >> point[i];
if (point[i] > max)
max = poin... | [["-", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 73]] | 1 | 180 | 6 |
#include <iostream>
using namespace std;
int main() {
int n, s, sum, max, min;
while (1) {
cin >> n;
if (n == 0)
break;
sum = 0;
cin >> s;
sum += s;
max = s;
cin >> s;
sum += s;
if (max < s) {
max = s;
} else {
min = s;
}
for (int i = 2; i < n; i++)... | #include <iostream>
using namespace std;
int main() {
int n, s, sum, max, min;
while (1) {
cin >> n;
if (n == 0)
break;
sum = 0;
cin >> s;
sum += s;
max = s;
min = s;
cin >> s;
sum += s;
if (max < s) {
max = s;
} else {
min = s;
}
for (int i = 2... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 161 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, i, p, max, min, s;
while (1) {
cin >> n;
if (n) {
} else
break;
cin >> p;
s = p;
max = p;
min = p;
for (i = 0; i < n - 1; i++) {
cin >> p;
s += p;
if (max < p) {
max = p;
}
i... | #include <iostream>
using namespace std;
int main() {
int n, i, p, max, min, s;
while (1) {
cin >> n;
if (n) {
} else
break;
cin >> p;
s = p;
max = p;
min = p;
for (i = 0; i < n - 1; i++) {
cin >> p;
s += p;
if (max < p) {
max = p;
}
i... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 134 | 2 |
#include <iostream>
using namespace std;
int N, S;
int main() {
while (cin >> N && N > 0) {
int M, m, addup, i;
M = -1;
m = 1001;
for (i = 0; i < N; i++) {
cin >> S;
addup += S;
if (S > M)
M = S;
if (S < m)
m = S;
}
cout << (addup - M - m) / (N - 2) <<... | #include <iostream>
using namespace std;
int N, S;
int main() {
while (cin >> N && N > 0) {
int M, m, addup, i;
M = -1;
m = 1001;
addup = 0;
for (i = 0; i < N; i++) {
cin >> S;
addup += S;
if (S > M)
M = S;
if (S < m)
m = S;
}
cout << (addup - M - ... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 107 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, i;
cout << "test";
while (cin >> n, n) {
int p;
int min = 1000;
int max = 0;
int total = 0;
for (int i = 0; i < n; i++) {
cin >> p;
if (p > max)
max = p;
if (p < min)
min = p;
total += p;
}... | #include <iostream>
using namespace std;
int main() {
int n, i;
while (cin >> n, n) {
int p;
int min = 1000;
int max = 0;
int total = 0;
for (int i = 0; i < n; i++) {
cin >> p;
if (p > max)
max = p;
if (p < min)
min = p;
total += p;
}
cout << (tota... | [["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 115 | 6 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue> //priority_queue
#include <set>
#include <stack>
#include <utility>
#include <vector>
#pragma warning(disable : 4996)
/*-------マクロ定義---------*/
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue> //priority_queue
#include <set>
#include <stack>
#include <utility>
#include <vector>
#pragma warning(disable : 4996)
/*-------マクロ定義---------*/
#define REP(i... | [["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 1,381 | 6 |
while true do
n = gets.to_i
if n == 0
break
end
max = 0
min = 10000
sum = 0
n.times do
i = gets.to_i
if i > max
max = i
elsif i < min
min = i
end
sum += i
end
p (sum - min - max) / (n-2)
end | while true do
n = gets.to_i
if n == 0
break
end
max = 0
min = 1000
sum = 0
n.times do
i = gets.to_i
if i > max
max = i
end
if i < min
min = i
end
sum += i
end
p (sum - min - max) / (n-2)
end | [["-", 0, 493, 0, 89, 8, 170, 0, 662, 12, 612], ["+", 0, 493, 0, 89, 8, 170, 0, 662, 12, 612], ["-", 196, 737, 8, 736, 0, 121, 75, 759, 0, 759], ["+", 0, 652, 196, 737, 8, 736, 0, 121, 0, 444], ["+", 0, 652, 196, 737, 8, 736, 0, 121, 0, 121]] | 4 | 66 | 5 |
result = []
loop do
input = gets.chomp!.to_i
ary = []
break unless input != 0
input.times do
ary << gets.chomp!.to_i
end
ary.sort_by!{|a, b| a<=>b}
ary.delete_at(0)
ary.delete_at(ary.length-1)
sum = 0
ary.each do |i|
sum += i
end
result << sum / ary.le... | result = []
loop do
input = gets.chomp!.to_i
ary = []
break unless input != 0
input.times do
ary << gets.chomp!.to_i
end
ary.sort!{|a, b| a<=>b}
ary.delete_at(0)
ary.delete_at(ary.length-1)
sum = 0
ary.each do |i|
sum += i
end
result << sum / a... | [["-", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22], ["+", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22]] | 4 | 95 | 2 |
while(n=gets.to_i)>0
p n.times.map{gets.to_i}.sort[1..-1].reduce(:+)/(n-2)end | while(n=gets.to_i)>0
p n.times.map{gets.to_i}.sort[1..-2].reduce(:+)/(n-2)end | [["-", 31, 652, 486, 742, 0, 475, 444, 748, 439, 612], ["+", 31, 652, 486, 742, 0, 475, 444, 748, 439, 612]] | 4 | 41 | 2 |
while input = gets
if (input.to_i) == 0
exit
else
n = input.to_i
score = Array.new(n, nil)
sum = 0
end
for roop in 0 .. (n - 1)
score[roop] = gets.to_i
end
for roop in 1 .. (n - 2)
sum += score[roop]
end
puts sum / (n - 2)
end | while input = gets
if (input.to_i) == 0
exit
else
n = input.to_i
score = Array.new(n, nil)
sum = 0
end
for roop in 0 .. (n - 1)
score[roop] = gets.to_i
end
score.sort!
for roop in 1 .. (n - 2)
sum += score[roop]
end
puts sum / (n - 2)
end | [["+", 0, 493, 0, 89, 8, 170, 0, 652, 486, 22], ["+", 0, 493, 0, 89, 8, 170, 0, 652, 17, 131], ["+", 0, 493, 0, 89, 8, 170, 0, 652, 735, 22]] | 4 | 78 | 3 |
averages = []
while True:
amount = int(input())
if amount == 0:
break
scores = [int(input()) for i in range(amount)]
scores.remove(max(scores))
scores.remove(min(scores))
averages.append(sum(scores) // amount)
for i in range(len(averages)):
print(averages[i]) | averages = []
while True:
amount = int(input())
if amount == 0:
break
scores = [int(input()) for i in range(amount)]
scores.remove(max(scores))
scores.remove(min(scores))
averages.append(sum(scores) // (amount - 2))
for i in range(len(averages)):
print(averages[i]) | [["+", 0, 652, 3, 4, 0, 657, 12, 23, 0, 24], ["+", 3, 4, 0, 657, 12, 23, 0, 657, 17, 33], ["+", 3, 4, 0, 657, 12, 23, 0, 657, 12, 612], ["+", 0, 652, 3, 4, 0, 657, 12, 23, 0, 25]] | 5 | 85 | 4 |
while True:
n = int(eval(input()))
if n == 0:
break
ma = 0
mi = 1000
s = 0
for i in range(n):
x = int(eval(input()))
if ma < x:
ma = x
elif mi > x:
mi = x
s += x
print(((s - ma - mi) // (n - 2))) | while True:
n = int(eval(input()))
if n == 0:
break
ma = 0
mi = 1000
s = 0
for i in range(n):
x = int(eval(input()))
if ma < x:
ma = x
if mi > x:
mi = x
s += x
print(((s - ma - mi) // (n - 2))) | [["-", 0, 7, 8, 196, 0, 57, 75, 665, 0, 683], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121]] | 5 | 85 | 2 |
import statistics
while True:
n = int(input())
if n == 0: break
s = [int(input()) for i in range(n)]
ave = statistics.mean(sorted(s[1:-1]))
print(int(ave)) | import statistics
while True:
n = int(input())
if n == 0: break
s = [int(input()) for i in range(n)]
ave = statistics.mean(sorted(s)[1:-1])
print(int(ave)) | [["+", 3, 4, 0, 206, 51, 652, 3, 4, 0, 25], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 60 | 2 |
import bisect
while True:
n = int(input())
if n+1:
break
score = []
for _ in range(n):
s = int(input())
bisect.insort(score, s)
print(sum(score[1:-1])//(len(score)-2)) | import bisect
while True:
n = int(input())
if n == 0:
break
score = []
for _ in range(n):
s = int(input())
bisect.insort(score, s)
print(sum(score[1:-1])//(len(score)-2)) | [["-", 0, 52, 8, 196, 0, 57, 15, 657, 17, 72], ["-", 0, 52, 8, 196, 0, 57, 15, 657, 12, 612], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 667, 60], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 0, 612]] | 5 | 69 | 4 |
#-*- encoding:utf-8 -*-
import math
while 1:
n = int(input())
if n == 0:
break
max = 0
min = 9999
sum = 0
for i in range(n):
s = int(input())
if max < s:
max = s
elif min > s:
min = s
sum = sum + s
ans = math.floor((sum - min -... | #-*- encoding:utf-8 -*-
import math
while 1:
n = int(input())
if n == 0:
break
max = 0
min = 9999
sum = 0
for i in range(n):
s = int(input())
if max < s:
max = s
if min > s:
min = s
sum = sum + s
ans = math.floor((sum - min - m... | [["-", 0, 7, 8, 196, 0, 57, 75, 665, 0, 683], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121]] | 5 | 90 | 2 |
while(True):
n = eval(input())
if n == 0:
break;
sl = 1001
sh = 0
ret = 0
for i in range(n):
tmp = eval(input())
sum += tmp
if tmp < sl:
sl = tmp
if tmp > sh:
sh = tmp
ret -= (sl + sh)
print("%d" % (ret/n)) | while(True):
n = eval(input())
if n == 0:
break;
sl = 1001
sh = 0
ret = 0
for i in range(n):
tmp = eval(input())
ret += tmp
if tmp < sl:
sl = tmp
if tmp > sh:
sh = tmp
ret -= (sl + sh)
print("%d" % (ret/(n-2))) | [["-", 0, 7, 8, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 657, 12, 23, 0, 657, 12, 23, 0, 24], ["+", 12, 23, 0, 657, 12, 23, 0, 657, 17, 33], ["+", 12, 23, 0, 657, 12, 23, 0, 657, 12, 612], ["+", 0, 657, 12, 23, 0, 657, 12, 23, 0, 25]] | 5 | 83 | 6 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
P[] ps;
void run() {
Scanner sc = new Scanner(System.in);
for (;;) {
int n = sc.nextInt();
if (n == 0)
break;
ps = new P[n];
for (int i = 0; i <... |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
P[] ps;
void run() {
Scanner sc = new Scanner(System.in);
for (;;) {
int n = sc.nextInt();
if (n == 0)
break;
ps = new P[n];
for (int i = 0; i <... | [["-", 0, 7, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 7, 8, 196, 0, 503, 49, 200, 51, 499]] | 3 | 655 | 2 |
import java.awt.geom.Point2D;
import java.awt.geom.Point2D.Double;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
Point2D.Double[] p = new Point2D.Double... | import java.awt.geom.Point2D;
import java.awt.geom.Point2D.Double;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
Point2D.Double[] p = new Point2D.Double... | [["-", 0, 52, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 52, 8, 196, 0, 503, 49, 200, 51, 499]] | 3 | 818 | 2 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int N;
static double[] X, Y;
public static void main(String[] args) {
while (true) {
N = sc.nextInt();
if (N == 0)
break;
X = new... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int N;
static double[] X, Y;
public static void main(String[] args) {
while (true) {
N = sc.nextInt();
if (N == 0)
break;
X = new... | [["-", 64, 196, 0, 37, 0, 510, 15, 16, 17, 18], ["+", 64, 196, 0, 37, 0, 510, 15, 16, 17, 19], ["-", 8, 196, 0, 503, 49, 200, 51, 16, 31, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 31, 22], ["+", 51, 492, 3, 4, 0, 16, 12, 16, 31, 22], ["+", 51, 492, 3, 4, 0, 16, 12, 16, 17, 48], ["-", 0, 57, 15, 15, 0, 16, 12, 16, 12,... | 3 | 538 | 8 |
import java.awt.geom.Point2D;
import java.util.*;
public class Main {
Scanner in = new Scanner(System.in);
public static void main(String[] args) { new Main(); }
public Main() {
while (in.hasNext())
new AOJ1134().doIt();
}
class AOJ1134 {
final double EPS = 1.0e-8;
Point2D[] intersectPtCC... | import java.awt.geom.Point2D;
import java.util.*;
public class Main {
Scanner in = new Scanner(System.in);
public static void main(String[] args) { new Main(); }
public Main() {
while (in.hasNext())
new AOJ1134().doIt();
}
class AOJ1134 {
final double EPS = 1.0e-8;
Point2D[] intersectPtCC... | [["-", 3, 4, 0, 230, 3, 4, 0, 16, 17, 72], ["-", 3, 4, 0, 230, 3, 4, 0, 16, 12, 22]] | 3 | 779 | 4 |
#include <math.h>
#include <stdio.h>
#define p2(x) ((x) * (x))
#define mul(rx, ry, x1, y1, x2, y2) \
((rx) = (x1) * (x2) - (y1) * (y2), (ry) = (x2) * (y1) + (x1) * (y2))
#define R 1
double X[300], Y[300], hyp, t, pl, dx, dy, x[2], y[2];
int main() {
int N, M, m, i, j, k, z... | #include <math.h>
#include <stdio.h>
#define p2(x) ((x) * (x))
#define mul(rx, ry, x1, y1, x2, y2) \
((rx) = (x1) * (x2) - (y1) * (y2), (ry) = (x2) * (y1) + (x1) * (y2))
#define R 1
double X[300], Y[300], hyp, t, pl, dx, dy, x[2], y[2];
int main() {
int N, M, m, i, j, k, z... | [["-", 8, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 8, 57, 15, 23, 0, 16, 12, 16, 17, 72]] | 0 | 404 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int n, i, j, l, max, c;
double x[310], y[310], k, s, t, a, b, e = 1e-6;
while (scanf("%d", &n), n) {
for (i = max = 0; i < n; i++)
scanf("%lf %lf", &x[i], &y[i]);
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
a = (x[i] - x[j])... | #include <math.h>
#include <stdio.h>
int main() {
int n, i, j, l, max, c;
double x[310], y[310], k, s, t, a, b, e = 1e-6;
while (scanf("%d", &n), n) {
max = 1;
for (i = 0; i < n; i++)
scanf("%lf %lf", &x[i], &y[i]);
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
a = (x[i] ... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 0, 52, 8, 9, 0, 7, 10, 11, 17, 32], ["-", 8, 9, 0, 7, 10, 11, 12, 11, 31, 22]] | 0 | 363 | 6 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = int(a); i < int(b); ++i)
#define RREP(i, n) RFOR(i, 0, n)
#define RFOR(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = int(a); i < int(b); ++i)
#define RREP(i, n) RFOR(i, 0, n)
#define RFOR(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 384 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define REP(i,... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define REP(i,... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 477 | 2 |
////////////////////
/// template ///
////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#i... | ////////////////////
/// template ///
////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#i... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 2,904 | 2 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#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>
usi... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#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>
usi... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 407 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 1,280 | 2 |
#include <algorithm>
#include <array>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, a, b) for... | #include <algorithm>
#include <array>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, a, b) for... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 480 | 2 |
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 2,907 | 2 |
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#include <vector>
using namespace ... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#include <vector>
using namespace ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 33], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 22], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 72]] | 1 | 489 | 15 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 686 | 2 |
#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++)
#define REPP(i, j, n) for (int i = (j); i < (int)(n); i++)
using ... | #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++)
#define REPP(i, j, n) for (int i = (j); i < (int)(n); i++)
using ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 362 | 4 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#includ... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#includ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 4,282 | 2 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8;
using P = complex<double>;
int n;
P p[300];
int main() {
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
double x, y;
cin >> x >> y;
p[i] = P(x, y);
}
vector<P> ps;
for (int i = 0; i < n; i++) {
for (i... | #include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8;
using P = complex<double>;
int n;
P p[300];
int main() {
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
double x, y;
cin >> x >> y;
p[i] = P(x, y);
}
vector<P> ps;
for (int i = 0; i < n; i++) {
for (i... | [["+", 3, 4, 0, 16, 12, 16, 31, 16, 17, 48], ["+", 0, 16, 12, 16, 31, 16, 12, 2, 63, 22], ["+", 12, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 12, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["+", 12, 16, 31, 16, 12, 2, 3, 4, 0, 25], ["-", 31, 2, 3, 4, 0, 16, 12, 16, 12, 13], ["+", 31, 2, 3, 4, 0, 16, 12, 16, 12, 13]] | 1 | 283 | 7 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long long int ll;
typedef pair<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long long int ll;
typedef pair<... | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 479 | 7 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
//#include<cctype>
#include <climits>
#include <iostream>
#include <map>
#include <string>
#include <vector>
//#include<list>
#include <algorithm>
#include <deque>
#include <queue>
//#include<numeric>
#include <utility>
//#include<memory>
#include... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
//#include<cctype>
#include <climits>
#include <iostream>
#include <map>
#include <string>
#include <vector>
//#include<list>
#include <algorithm>
#include <deque>
#include <queue>
//#include<numeric>
#include <utility>
//#include<memory>
#include... | [["-", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 21], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 820 | 7 |
#include "bits/stdc++.h"
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)
#define OUT 0
#define ON ... | #include "bits/stdc++.h"
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)
#define OUT 0
#define ON ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 2,330 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (N); i++)
using namespace std;
namespace geom {
#define at(i) ((*this)[i])
#define pb push_back
#define X real()
#define Y imag()
#define SELF (*this)
typedef long double R;
typedef complex<R> P;
const R EPS = 1e-8;
const R PI = 3.141592653589793238462643... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (N); i++)
using namespace std;
namespace geom {
#define at(i) ((*this)[i])
#define pb push_back
#define X real()
#define Y imag()
#define SELF (*this)
typedef long double R;
typedef complex<R> P;
const R EPS = 1e-8;
const R PI = 3.141592653589793238462643... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 991 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
struct Point {
double x, y;
};
double dist(Point a, Point b) {
return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
#define eps 0.0001
int main(void) {
int N;
while (cin >> N, N) {
vector<Point> p(N);
int maxcn... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
struct Point {
double x, y;
};
double dist(Point a, Point b) {
return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
#define eps 0.0001
int main(void) {
int N;
while (cin >> N, N) {
vector<Point> p(N);
int maxcn... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 524 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
struct Point {
double x, y;
};
double dist(Point a, Point b) {
return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
int main(void) {
int N;
while (cin >> N, N) {
vector<Point> p(N);
int maxcnt = 1;
rep(i, N... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
struct Point {
double x, y;
};
double dist(Point a, Point b) {
return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));
}
int main(void) {
int N;
while (cin >> N, N) {
vector<Point> p(N);
int maxcnt = 1;
rep(i, N... | [["-", 0, 1, 0, 11, 12, 23, 0, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 12, 13]] | 1 | 377 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define X() real()
#define Y() imag()
#define x(p) (p).X()
#define y(p) (p).Y()
#define SZ(P) (int)(P.size())
#define curr(P, i) P[(i) % SZ(P)]
#define next(P, i) P[(i + 1) % SZ(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define X() real()
#define Y() imag()
#define x(p) (p).X()
#define y(p) (p).Y()
#define SZ(P) (int)(P.size())
#define curr(P, i) P[(i) % SZ(P)]
#define next(P, i) P[(i + 1) % SZ(... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 696 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int, int> pii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = 1; i < n; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int, int> pii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = 1; i < n; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 390 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
while (cin >> N, N) {
static const complex<double> I = complex<double>(0, -1);
using Point = complex<d... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
while (cin >> N, N) {
static const complex<double> I = complex<double>(0, -1);
using Point = complex<d... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 291 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define fst first
#define snd second
#define all(c) ((c).begin()), ((c).end())
#define TEST(x, a) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define fst first
#define snd second
#define all(c) ((c).begin()), ((c).end())
#define TEST(x, a) ... | [["-", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22]] | 1 | 1,753 | 2 |
/*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define rp(a) while (a--)
#... | /*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define rp(a) while (a--)
#... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 3,726 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for (int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for (auto &a : b)
const int inf = 1LL << 5... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for (int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for (auto &a : b)
const int inf = 1LL << 5... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 1,887 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
// CCW??¨///////////////////////////////////
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const ... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
// CCW??¨///////////////////////////////////
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 3,219 | 6 |
#include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define mp make_pair
#define pb push_back
#define EB emplace_back
#define fi first
#define se second
#define all(v) ALL(v)
#define sz(x) (int)(x).size()
#define ... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define mp make_pair
#define pb push_back
#define EB emplace_back
#define fi first
#define se second
#define all(v) ALL(v)
#define sz(x) (int)(x).size()
#define ... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 630 | 4 |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using P = complex<ld>;
const ld eps = 1e-6;
int main() {
int N;
while (cin >> N, N) {
vector<ld> x(N), y(N);
vector<P> p(N);
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
p[i] = P(x[i], y[i]);
}
vector<P> ko;... | #include <bits/stdc++.h>
using namespace std;
using ld = long double;
using P = complex<ld>;
const ld eps = 1e-6;
int main() {
int N;
while (cin >> N, N) {
vector<ld> x(N), y(N);
vector<P> p(N);
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
p[i] = P(x[i], y[i]);
}
vector<P> ko;... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 356 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 661 | 2 |
/*
??????????????????????????????3??\??????3???????????¨?????????????????????????????????????????¨????????????
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#inclu... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 693 | 2 |
#include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#defin... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#defin... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 781 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <typeinfo>
#include <vector>
#define syosu... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <typeinfo>
#include <vector>
#define syosu... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 781 | 2 |
#include <iostream>
#include <math.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
double p[300][2];
int n;
double dis(double x1, double y1, double x2, double y2) {
return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
int circle(double x, double y, int i, int j) {
int count = 2;
REP(k, n) ... | #include <iostream>
#include <math.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
double p[300][2];
int n;
double dis(double x1, double y1, double x2, double y2) {
return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
int circle(double x, double y, int i, int j) {
int count = 2;
REP(k, n) ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 516 | 2 |
#include "bits/stdc++.h"
using namespace std;
typedef complex<double> Point;
const double eps = 1e-9;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
while (cin >> N, N) {
vector<Point> P(N);
for (int i = 0; i < N; i++) {
double x, y;
cin >> x >> y;
P[i] = Point(x, y);... | #include "bits/stdc++.h"
using namespace std;
typedef complex<double> Point;
const double eps = 1e-9;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
while (cin >> N, N) {
vector<Point> P(N);
for (int i = 0; i < N; i++) {
double x, y;
cin >> x >> y;
P[i] = Point(x, y);... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 328 | 5 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
tem... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
tem... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 645 | 4 |
#include <cmath>
#include <iostream>
#define eps 1.0e-9
using namespace std;
int N;
double x[305], y[305];
int count(double cx, double cy) {
int ret = 0;
for (int i = 0; i < N; i++) {
if ((cx - x[i]) * (cx - x[i]) + (cy - y[i]) * (cy - y[i]) <= 1 + eps)
ret++;
}
return ret;
}
int main(void) {
wh... | #include <cmath>
#include <iostream>
#define eps 1.0e-9
using namespace std;
int N;
double x[305], y[305];
int count(double cx, double cy) {
int ret = 0;
for (int i = 0; i < N; i++) {
if ((cx - x[i]) * (cx - x[i]) + (cy - y[i]) * (cy - y[i]) <= 1 + eps)
ret++;
}
return ret;
}
int main(void) {
wh... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 374 | 2 |
//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR... | //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 825 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
using namespace std;
const double eps = 1e-8;
struct point {
double x, y;
} P[310];
int x, y, N;
int ans = 1;
double cal_distance(point a, point b) {
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
point cal_cente... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
using namespace std;
const double eps = 1e-8;
struct point {
double x, y;
} P[310];
int x, y, N;
int ans = 1;
double cal_distance(point a, point b) {
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
point cal_cente... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 402 | 4 |
#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
const LL MOD = 1000000007LL;
const double EPS = 1e-10;
struct Point {
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(const Point &p) const { return Point(x ... | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
const LL MOD = 1000000007LL;
const double EPS = 1e-10;
struct Point {
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(const Point &p) const { return Point(x ... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 2,133 | 4 |
#include <cmath>
#include <complex>
#include <iostream>
#define EPS 1e-9
using namespace std;
typedef complex<double> xy_t;
int n;
xy_t points[301];
int count_in(xy_t center) {
int ans = 0;
for (int i = 0; i < n; i++) {
if (abs(center - points[i]) < 1.0 + EPS)
ans++;
}
return ans;
}
/*xy_t ppdcl(xy_t ... | #include <cmath>
#include <complex>
#include <iostream>
#define EPS 1e-9
using namespace std;
typedef complex<double> xy_t;
int n;
xy_t points[301];
int count_in(xy_t center) {
int ans = 0;
for (int i = 0; i < n; i++) {
if (abs(center - points[i]) < 1.0 + EPS)
ans++;
}
return ans;
}
/*xy_t ppdcl(xy_t ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 309 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define cd complex<double>
complex<double> ci = complex<double>(0.0, 1.0);
complex<double> mci = complex<double>(0.0, -1.0);
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define cd complex<double>
complex<double> ci = complex<double>(0.0, 1.0);
complex<double> mci = complex<double>(0.0, -1.0);
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<c... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 353 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
#define eps (1e-10)
struct Point {
double x, y;
Point() {}
Point(double x, double y) : x(x), y(y) {}
Point... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
#define eps (1e-10)
struct Point {
double x, y;
Point() {}
Point(double x, double y) : x(x), y(y) {}
Point... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 797 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
int n;
double x[300];
double y[300];
double dist(double x1, double y1, double x2, double y2) {
double dx = abs(x1 - x2);
double dy = abs(y1 - y2);
return sqrt(dx * dx + dy * dy);
}
int count(double cx, double cy, int i, int j) {
int ans = 0;
for (i... | #include <cmath>
#include <iostream>
using namespace std;
int n;
double x[300];
double y[300];
double dist(double x1, double y1, double x2, double y2) {
double dx = abs(x1 - x2);
double dy = abs(y1 - y2);
return sqrt(dx * dx + dy * dy);
}
int count(double cx, double cy, int i, int j) {
int ans = 0;
for (i... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 391 | 2 |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using Point = complex<ld>;
struct Line {
Point a, b;
Line(Point a, Point b) : a(a), b(b) {}
Line() : Line(Point(), Point()) {}
};
struct Circle {
Point p;
ld r;
Circle(Point p, ld r) : p(p), r(r) {}
Circle() : Circle(Point(), 0.0) {... | #include <bits/stdc++.h>
using namespace std;
using ld = long double;
using Point = complex<ld>;
struct Line {
Point a, b;
Line(Point a, Point b) : a(a), b(b) {}
Line() : Line(Point(), Point()) {}
};
struct Circle {
Point p;
ld r;
Circle(Point p, ld r) : p(p), r(r) {}
Circle() : Circle(Point(), 0.0) {... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 1,465 | 2 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functi... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functi... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 475 | 2 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-8;
typedef pair<double, double> pt;
#define x first
#define y second
pt operator-(pt a, pt b) { return pt(a.x - b.x, a.y - b.y); }
bool zero(double x) { return fabs(x) <= EPS; }
double sq(double a) { return a * a; }
d... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-8;
typedef pair<double, double> pt;
#define x first
#define y second
pt operator-(pt a, pt b) { return pt(a.x - b.x, a.y - b.y); }
bool zero(double x) { return fabs(x) <= EPS; }
double sq(double a) { return a * a; }
d... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 634 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
// xy平面上の点(ベクトル)を表現するには、complex型を利用するとよい
typedef complex<double> P;
// 辺の表現 (座標を2つ pair でもつ)
typedef pair<P, P> L;
// 円の表現 (座標 P と 半径 d で表現する)
typedef pair<P, double> C;
// 成分を取り出すのを簡単にする
#define X re... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
// xy平面上の点(ベクトル)を表現するには、complex型を利用するとよい
typedef complex<double> P;
// 辺の表現 (座標を2つ pair でもつ)
typedef pair<P, P> L;
// 円の表現 (座標 P と 半径 d で表現する)
typedef pair<P, double> C;
// 成分を取り出すのを簡単にする
#define X re... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 75, 76, 0, 9, 0, 43, 49, 50, 51, 13], ["+", 75, 76, 0, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72]] | 1 | 559 | 6 |
#include <algorithm>
#include <cstdio>
#include <math.h>
using namespace std;
typedef pair<double, double> P;
int N;
double X[300], Y[300];
P d[300];
P add(P p1, P p2) { return P(p1.first + p2.first, p1.second + p2.second); }
P minas(P p1, P p2) { return P(p1.first - p2.first, p1.second - p2.second); }
P mul(P p, ... | #include <algorithm>
#include <cstdio>
#include <math.h>
using namespace std;
typedef pair<double, double> P;
int N;
double X[300], Y[300];
P d[300];
P add(P p1, P p2) { return P(p1.first + p2.first, p1.second + p2.second); }
P minas(P p1, P p2) { return P(p1.first - p2.first, p1.second - p2.second); }
P mul(P p, ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 603 | 2 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int MOD = 1e9 + 7;
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-9, pi = acos(-1.0);
namespace std {
bool operator<(co... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int MOD = 1e9 + 7;
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-9, pi = acos(-1.0);
namespace std {
bool operator<(co... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 678 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.