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 <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct rule {
bool permit;
string src;
string dst;
};
int main() {
int n, m;
while (cin >> n >> m && !(n == 0 && m == 0)) {
vector<rule> v;
for (int i = 0; i < n; i++) {
string ord;
rule r;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct rule {
bool permit;
string src;
string dst;
};
int main() {
int n, m;
while (cin >> n >> m && !(n == 0 && m == 0)) {
vector<rule> v;
for (int i = 0; i < n; i++) {
string ord;
rule r;
... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22]] | 1 | 456 | 2 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#incl... | #define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#incl... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 673 | 1 |
until(n,m=gets.split.map(&:to_i))==[0,0]do
r,p,a=[],[],[]
n.times{r.unshift(gets.gsub("?",".").split)}
m.times{p<<gets.split}
p.each{|p|r.each{|r|if p[0]=~/#{r[1]}&&p[1]=~/#{r[2]}/
a<<p*" "if r[0]=~/p/
break
end}}
puts a.size,a
end | while(n,m=gets.split.map(&:to_i))!=[0,0]do
r,p,a=[],[],[]
n.times{r.unshift(gets.gsub("?",".").split)}
m.times{p<<gets.split}
p.each{|p|r.each{|r|if p[0]=~/#{r[1]}/&&p[1]=~/#{r[2]}/
a<<p*" "if r[0]=~/p/
break
end}}
puts a.size,a
end | [["-", 36, 36, 36, 36, 0, 493, 0, 750, 0, 750], ["+", 36, 36, 36, 36, 0, 493, 0, 89, 0, 89], ["-", 36, 36, 0, 493, 0, 750, 15, 738, 17, 60], ["+", 36, 36, 0, 493, 0, 89, 15, 738, 17, 79], ["-", 0, 493, 0, 750, 8, 170, 0, 768, 0, 769], ["+", 0, 493, 0, 89, 8, 170, 0, 768, 0, 769]] | 4 | 87 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX_N 2000
int x[MAX_N][MAX_N];
int H, W, N;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
H = 5;
W = 5;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> x[i][j];
}
if (x[i][0] == 0)... | #include <algorithm>
#include <iostream>
using namespace std;
#define MAX_N 2000
int x[MAX_N][MAX_N];
int H, W, N;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
H = 5;
W = 5;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> x[i][j];
}
if (x[i][0] == 0)... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 319 | 2 |
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, l[5][5];
cin >> n;
while (n--) {
int ans = 0, f;
rep(i, 5) rep(j, 5) cin >> l[i][j];
rep(i, 5) rep(j, 5) if (l[i][j]) {
rep(a, 5) rep(b, 5) {
f = 0;
rep(p, a) rep(q, b) if (... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, l[5][5];
cin >> n;
while (n--) {
int ans = 0, f;
rep(i, 5) rep(j, 5) cin >> l[i][j];
rep(i, 5) rep(j, 5) if (l[i][j]) {
rep(a, 6) rep(b, 6) {
f = 0;
rep(p, a) rep(q, b) if (... | [["-", 64, 9, 0, 42, 0, 2, 3, 4, 0, 13], ["+", 64, 9, 0, 42, 0, 2, 3, 4, 0, 13]] | 1 | 188 | 4 |
// 23
#include <iostream>
using namespace std;
int main() {
int m;
cin >> m;
while (m--) {
int g[5][5];
for (int y = 0; y < 5; y++) {
for (int x = 0; x < 5; x++) {
cin >> g[y][x];
}
}
int ans = 0;
for (int l = 0; l < 5; l++) {
for (int r = l + 1; r < 5; r++) {
... | // 23
#include <iostream>
using namespace std;
int main() {
int m;
cin >> m;
while (m--) {
int g[5][5];
for (int y = 0; y < 5; y++) {
for (int x = 0; x < 5; x++) {
cin >> g[y][x];
}
}
int ans = 0;
for (int l = 0; l < 5; l++) {
for (int r = l; r < 5; r++) {
f... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 227 | 2 |
import java.io.*;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int r = sc.nextInt();
if (n == 0 && r == 0) {
break;
}
int[] s = new int[100];
int[] s2... | import java.io.*;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int r = sc.nextInt();
if (n == 0 && r == 0) {
break;
}
int[] s = new int[100];
int[] s2... | [["+", 8, 196, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 8, 196, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 8, 196, 0, 1, 0, 11, 12, 16, 12, 499]] | 3 | 315 | 4 |
#include <stdio.h>
void shuffle(int *fuda, int p, int c, int n) {
int i;
for (i = 0; i < n; i++) {
if (*(fuda + i) < p + c - 1) {
if (*(fuda + i) < p - 1) {
*(fuda + i) += c;
} else {
*(fuda + i) -= (p - 1);
}
}
}
};
int main() {
while (1) {
int n, r, i, p, c;
... | #include <stdio.h>
void shuffle(int *fuda, int p, int c, int n) {
int i;
for (i = 0; i < n; i++) {
if (*(fuda + i) < p + c) {
if (*(fuda + i) < p) {
*(fuda + i) += c;
} else {
*(fuda + i) -= (p - 1);
}
}
}
};
int main() {
while (1) {
int n, r, i, p, c;
scanf("... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 252 | 4 |
#include <stdio.h>
int main() {
int d[50];
int a[50], b[50];
int i, j, k, l, m, o, q;
int n, r, p, c;
int A;
for (i = 0;; i++) {
scanf("%d", &n);
scanf("%d", &r);
if (n == 0 && r == 0)
break;
A = n;
for (m = 0; m < n; m++) {
d[m] = A;
A--;
}
for (j = 0; j < ... | #include <stdio.h>
int main() {
int d[50];
int a[50], b[50];
int i, j, k, l, m, o, q;
int n, r, p, c;
int A;
for (i = 0;; i++) {
scanf("%d", &n);
scanf("%d", &r);
if (n == 0 && r == 0)
break;
A = n;
for (m = 0; m < n; m++) {
d[m] = A;
A--;
}
for (j = 0; j < ... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 285 | 1 |
#include <stdio.h>
int main() {
int i, j, n, r, p, c, A[52], B[52];
while (1) {
scanf("%d %d", &n, &r);
if (n == 0 && r == 0) {
break;
}
for (i = n; i > 0; i--) {
A[n - i] = i;
B[n - i] = i;
}
for (i = 0; i < r; i++) {
scanf("%d %d", &p, &c);
for (j = 0; j <= p ... | #include <stdio.h>
int main() {
int i, j, n, r, p, c, A[52], B[52];
while (1) {
scanf("%d %d", &n, &r);
if (n == 0 && r == 0) {
break;
}
for (i = n; i > 0; i--) {
A[n - i] = i;
B[n - i] = i;
}
for (i = 0; i < r; i++) {
scanf("%d %d", &p, &c);
for (j = 0; j < p -... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 226 | 2 |
#include <stdio.h>
#include <string.h>
int main(void) {
int n, r;
while (scanf("%d %d", &n, &r), n) {
int card[64];
int i;
for (i = 0; i < n; i++) {
card[i] = n - i;
}
while (r-- > 0) {
int p, c;
int tmp[64];
scanf("%d %d", &p, &c);
for (i = p - 1; i < p + c; i... | #include <stdio.h>
#include <string.h>
int main(void) {
int n, r;
while (scanf("%d %d", &n, &r), n) {
int card[64];
int i;
for (i = 0; i < n; i++) {
card[i] = n - i;
}
while (r-- > 0) {
int p, c;
int tmp[64];
scanf("%d %d", &p, &c);
for (i = p - 1; i < p + c - ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 0 | 208 | 4 |
#include <stdio.h>
int main(void) {
int i, j, n, r, p, c;
while (1) {
scanf("%d%d", &n, &r);
if (n == 0 && r == 0) {
break;
}
int yama[n];
for (i = 0; i < n; i++) {
yama[i] = n - i;
}
for (i = 0; i < r; i++) {
scanf("%d%d", &p, &c);
int down[p - 1], cut[c];
... | #include <stdio.h>
int main(void) {
int i, j, n, r, p, c;
while (1) {
scanf("%d%d", &n, &r);
if (n == 0 && r == 0) {
break;
}
int yama[n];
for (i = 0; i < n; i++) {
yama[i] = n - i;
}
for (i = 0; i < r; i++) {
scanf("%d%d", &p, &c);
int down[p - 1], cut[c];
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 259 | 1 |
#include <stdio.h>
#include <stdlib.h>
int yama[51];
void init_yama(int n) {
int i, j;
for (i = n, j = 1; j <= n; i--, j++) {
yama[j] = i;
}
return;
}
void cut(int p, int c) {
int temp[50];
int i, j;
for (i = 1, j = 0; i <= p - 1; i++, j++) {
temp[j] = yama[i];
}
for (i = p, j = 1; j <= c;... | #include <stdio.h>
#include <stdlib.h>
int yama[51];
void init_yama(int n) {
int i, j;
for (i = n, j = 1; j <= n; i--, j++) {
yama[j] = i;
}
return;
}
void cut(int p, int c) {
int temp[50];
int i, j;
for (i = 1, j = 0; i <= p - 1; i++, j++) {
temp[j] = yama[i];
}
for (i = p, j = 1; j <= c;... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 284 | 2 |
/*
============================================================================
Name : hanahuda.c
Author :
Version :
Copyright : Your copyright notice
Description : Hello World in C, Ansi-style
============================================================================
*/
#include <stdio.h>
... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, r, i, j, p, c;
int huda[50];
int tmp[50];
do {
scanf("%d %d", &n, &r);
if ((n == 0) && (r == 0)) {
break;
}
for (i = 0; i < n; i++) {
huda[i] = i + 1;
}
for (i = 0; i < r; i++) {
scanf("%d %d", &p, &c);
... | [["-", 0, 14, 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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 260 | 7 |
#include <stdio.h>
int main() {
int card[50], next[50];
int n, r;
int p, c;
int i, j;
while (1) {
scanf("%d%d", &n, &r);
if (n == 0 && r == 0)
break;
for (i = 0; i < n; i++) {
card[i] = n - i;
next[i] = n - 1;
}
for (j = 0; j < r; j++) {
scanf("%d%d", &p, &c);
... | #include <stdio.h>
int main() {
int card[50], next[50];
int n, r;
int p, c;
int i, j;
while (1) {
scanf("%d%d", &n, &r);
if (n == 0 && r == 0)
break;
for (i = 0; i < n; i++) {
card[i] = n - i;
next[i] = n - i;
}
for (j = 0; j < r; j++) {
scanf("%d%d", &p, &c);
... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 0 | 227 | 2 |
#include <stdio.h>
int main(void) {
int hanafuda[50];
int buffer[50];
int maisuu, s_kaisuu, s_now;
int i;
int p, c;
while (1) {
scanf("%d%d", &maisuu, &s_kaisuu);
if (maisuu == 0 && s_kaisuu == 0)
break;
for (i = 0; i < maisuu; i++)
hanafuda[i] = maisuu - i;
for (s_now = 0; s_no... | #include <stdio.h>
int main(void) {
int hanafuda[50];
int buffer[50];
int maisuu, s_kaisuu, s_now;
int i;
int p, c;
while (1) {
scanf("%d%d", &maisuu, &s_kaisuu);
if (maisuu == 0 && s_kaisuu == 0)
break;
for (i = 0; i < maisuu; i++)
hanafuda[i] = maisuu - i;
for (s_now = 0; s_no... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 210 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, r;
int card[50];
int cutp[50];
int cutc[50];
while (cin >> n >> r, n || r) {
for (int i = 0; i < n; i++) {
card[i] = i + 1;
}
for (int i = 0; i < r; i++) {
int p, c;
cin >> p >> c;
for (int i = 0; i < p - 1; i+... | #include <iostream>
using namespace std;
int main() {
int n, r;
int card[50];
int cutp[50];
int cutc[50];
while (cin >> n >> r, n || r) {
for (int i = 0; i < n; i++) {
card[i] = i + 1;
}
for (int j = 0; j < r; j++) {
int p, c;
cin >> p >> c;
for (int i = 0; i < p - 1; i+... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 341, 342, 0, 16, 31, 16, 31, 16, 12, 22], ["-", 31, 69, 341... | 1 | 251 | 10 |
#include <iostream>
using namespace std;
void cut(int[], int, int);
int main(void) {
int p, c;
for (int n, r; cin >> n >> r, n || r;) {
int card[n];
for (int i = 0; i < n; i++)
card[i] = n - i;
for (int i = 0; i < r; i++) {
cin >> p >> c;
if (p != 1)
cut(card, p, c);
}... | #include <iostream>
using namespace std;
void cut(int[], int, int);
int main(void) {
int p, c;
for (int n, r; cin >> n >> r, n || r;) {
int card[n];
for (int i = 0; i < n; i++)
card[i] = n - i;
for (int i = 0; i < r; i++) {
cin >> p >> c;
if (p != 1)
cut(card, p, c);
}... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 31, 69, 341, 342, 0, 16, 31, 16, 17, 33], ["+", 31, 69, 341, 342, 0, 16, 31, 16, 12, 13], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 17, 33], ["+",... | 1 | 232 | 8 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, m;
int p[51] = {0};
int c[51] = {0};
int i;
int ans;
while (1) {
scanf("%d %d", &n, &m);
if ((n == 0) && (m == 0))
break;
ans = n;
for (i = 1; i <= m; i++) {
sc... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, m;
int p[51] = {0};
int c[51] = {0};
int i;
int ans;
while (1) {
scanf("%d %d", &n, &m);
if ((n == 0) && (m == 0))
break;
ans = n;
for (i = 1; i <= m; i++) {
sc... | [["-", 31, 23, 0, 16, 31, 16, 31, 16, 17, 72], ["-", 31, 23, 0, 16, 31, 16, 31, 16, 12, 13], ["-", 15, 339, 51, 16, 31, 23, 0, 16, 17, 33], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 72], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 33], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 72]] | 1 | 222 | 6 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 426 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, r, p, c, l[50];
while (cin >> n >> r, n | r) {
for (int i = 0; i < n; i++)
l[i] = n - i;
for (int i = 0; i < r; i++) {
cin >> p >> c;
rotate(l, l + p - 1, l + p + c - 1);
}
cout << l[0];
}
retu... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, r, p, c, l[50];
while (cin >> n >> r, n | r) {
for (int i = 0; i < n; i++)
l[i] = n - i;
for (int i = 0; i < r; i++) {
cin >> p >> c;
rotate(l, l + p - 1, l + p + c - 1);
}
cout << l[0] << endl;
}... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 116 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, r, p, c;
int card[50], tmp;
while (cin >> n >> r) {
if (n == 0 && r == 0)
break;
for (int i = 0; i < n; i++) {
card[i] = n - i;
}
for (int i = 0; i < r; i++) {
cin >> p >> c;
for (int j = 0; j < c; j++) {
... | #include <iostream>
using namespace std;
int main() {
int n, r, p, c;
int card[50], tmp;
while (cin >> n >> r) {
if (n == 0 && r == 0)
break;
for (int i = 0; i < n; i++) {
card[i] = n - i;
}
for (int i = 0; i < r; i++) {
cin >> p >> c;
for (int j = 0; j < c; j++) {
... | [["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 180 | 4 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define dump(x) cout << #x << " = " << x << endl
using namespace std;
int card[50];
int n, r;
void disp() {
rep(i, 0, n) cout << card[i] << " ";
cout << endl;
return;
}
int main() {
while (1) {
cin >> n >> r;
if (n == 0)
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define dump(x) cout << #x << " = " << x << endl
using namespace std;
int card[50];
int n, r;
void disp() {
rep(i, 0, n) cout << card[i] << " ";
cout << endl;
return;
}
int main() {
while (1) {
cin >> n >> r;
if (n == 0)
... | [["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 216 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#define pi 3.14159
using namespace std;
int main() {
int n, r;
while (cin >> n >> r) {
if (n == 0 && r == 0)
break;
int a[50], b[50];
for (int i = 0; i < n; i++) {
a[i] = n - i;
}
for (in... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#define pi 3.14159
using namespace std;
int main() {
int n, r;
while (cin >> n >> r) {
if (n == 0 && r == 0)
break;
int a[50], b[50];
for (int i = 0; i < n; i++) {
a[i] = n - i;
}
for (in... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 234 | 2 |
#include <bits/stdc++.h>
using namespace std;
// objects-----------------------------------------------------------------
typedef complex<double> Point;
typedef Point Vector;
typedef vector<Point> Polygon;
struct Segment {
Point p1, p2;
Segment(const Point &p1 = Point(), const Point &p2 = Point())
: p1(p1),... | #include <bits/stdc++.h>
using namespace std;
// objects-----------------------------------------------------------------
typedef complex<double> Point;
typedef Point Vector;
typedef vector<Point> Polygon;
struct Segment {
Point p1, p2;
Segment(const Point &p1 = Point(), const Point &p2 = Point())
: p1(p1),... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 2,431 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
// ------ Classes ------ //
class Point {
public:
long double px, py;
Point() : px(0), py(0){};
Point(long double px_, long double py_) : px(px_), py(py_){};
friend bool operator==(const Point &p1, const Point &p2) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
// ------ Classes ------ //
class Point {
public:
long double px, py;
Point() : px(0), py(0){};
Point(long double px_, long double py_) : px(px_), py(py_){};
friend bool operator==(const Point &p1, const Point &p2) ... | [["+", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 804 | 3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
class Point {
public:
double x, y;
Point(int x, int y) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
};
typedef vector<Point> Polygon;
in... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
class Point {
public:
double x, y;
Point(int x, int y) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
};
typedef vector<Point> Polygon;
in... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 281 | 1 |
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef complex<int> xy_t;
int main() {
int n, k = 1;
double x, y, sum = 0.0;
queue<double> answer;
while (cin >> n && n > 0) {
vector<xy_t> p(n);
for (int i = 0; i < n; ++i)... | #include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef complex<int> xy_t;
int main() {
int n, k = 1;
double x, y, sum = 0.0;
queue<double> answer;
while (cin >> n && n > 0) {
vector<xy_t> p(n);
for (int i = 0; i < n; ++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]] | 1 | 221 | 4 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int x[51], y[51];
int main() {
int caseId = 0;
while (cin >> n) {
if (n == 0)
break;
caseId++;
int i;
for (i = 0; i < n; i++)
cin >> x[i] >> y[i];
x[n] = x[0];
y[n] = y[0];
int area = 0;
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int x[51], y[51];
int main() {
int caseId = 0;
while (cin >> n) {
if (n == 0)
break;
caseId++;
int i;
for (i = 0; i < n; i++)
cin >> x[i] >> y[i];
x[n] = x[0];
y[n] = y[0];
int area = 0;
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 168 | 2 |
#include <bits/stdc++.h>
using namespace std;
using db = long double;
using ll = long long;
using vi = vector<int>;
#define op operator
#define pb push_back
struct poi {
db x, y;
poi op - (poi p) { return {x - p.x, y - p.y}; }
db cross(poi p) { return x * p.y - y * p.x; }
} p[53];
int main() {
cout << fixed ... | #include <bits/stdc++.h>
using namespace std;
using db = long double;
using ll = long long;
using vi = vector<int>;
#define op operator
#define pb push_back
struct poi {
db x, y;
poi op - (poi p) { return {x - p.x, y - p.y}; }
db cross(poi p) { return x * p.y - y * p.x; }
} p[53];
int main() {
cout << fixed ... | [["-", 31, 16, 31, 16, 31, 16, 12, 27, 28, 22], ["+", 31, 16, 31, 16, 31, 16, 12, 27, 28, 22]] | 1 | 229 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;
int main() {
int n, datacase = 1;
while (true) {
cin >> n;
if (!n)
break;
d... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;
int main() {
int n, datacase = 1;
while (true) {
cin >> n;
if (!n)
break;
d... | [["-", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 188 | 4 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef complex<double> Point;
const double EPS = 1e-8;
typedef vector<Point> Polygon; // 反時計回りを仮定
double cross(Point a, Point b) { return imag(conj(a) * b); }
Point curr(const Polygon &a, int x) { return a[x]; }
Point ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef complex<double> Point;
const double EPS = 1e-8;
typedef vector<Point> Polygon; // 反時計回りを仮定
double cross(Point a, Point b) { return imag(conj(a) * b); }
Point curr(const Polygon &a, int x) { return a[x]; }
Point ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 250 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, x[100], y[100], now;
while (cin >> n, n) {
double ans = 0, pre;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 1; i < n - 1; i++) {
pre = ((y[i + 1] - y[0]) * (x[i] - x[0]) -
(x[i + 1] - x[0]) * (y[i] - ... | #include <iostream>
using namespace std;
int main() {
int n, x[100], y[100], now = 1;
while (cin >> n, n) {
double ans = 0, pre;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 1; i < n - 1; i++) {
pre = ((y[i + 1] - y[0]) * (x[i] - x[0]) -
(x[i + 1] - x[0]) * (y[i... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 27, 17, 29]] | 1 | 175 | 3 |
#include <iostream>
using namespace std;
float abso(float a) {
if (a < 0)
return (-1.0f) * a;
else
return (1.0f) * a;
}
int main() {
int n;
int c = 0;
float out = 0;
float x[1000] = {0};
float y[1000] = {0};
float o[1000] = {0};
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
... | #include <iostream>
using namespace std;
float abso(float a) {
if (a < 0)
return (-1.0f) * a;
else
return (1.0f) * a;
}
int main() {
int n;
int c = 1;
float out = 0;
float x[1000] = {0};
float y[1000] = {0};
float o[1000] = {0};
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 289 | 4 |
#include <cstdio>
int n, x[50], y[50];
int main() {
for (int c = 0;; c++) {
float a = 0;
scanf("%d", &n);
if (!n)
break;
for (int i = 0; i < n; i++)
scanf("%d %d", &x[i], &y[i]);
for (int i = 0; i < n; i++)
a += 0.5 * (x[i] * y[(i + 1) % n] - y[i] * x[(i + 1) % n]);
a *=... | #include <cstdio>
int n, x[50], y[50];
int main() {
for (int c = 1;; c++) {
float a = 0;
scanf("%d", &n);
if (!n)
break;
for (int i = 0; i < n; i++)
scanf("%d %d", &x[i], &y[i]);
for (int i = 0; i < n; i++)
a += 0.5 * (x[i] * y[(i + 1) % n] - y[i] * x[(i + 1) % n]);
a *=... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 163 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <v... | [["-", 0, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33]] | 1 | 549 | 2 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
double x, y;
int cnt = 1;
while (cin >> n, n) {
double sum = 0;
cin >> x >> y;
double oldx = x, oldy = y;
double fx = x, fy = y;
for (int i = 1; i <= n; i++) {
if (i == n) {
sum += (... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
double x, y;
int cnt = 1;
while (cin >> n, n) {
double sum = 0;
cin >> x >> y;
double oldx = x, oldy = y;
double fx = x, fy = y;
for (int i = 1; i <= n; i++) {
if (i == n) {
sum += (... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 158 | 1 |
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
#define pb push_back
using namespace std;
typedef complex<double> P;
typedef vector<P> G;
/* 外積 */
double cross(const P &a, const P &b) { return imag(conj(a) * b); }
/* 多角形の面積 */
#define curr(g, i) g[i]
#define next(g, i) g... | #include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
#define pb push_back
using namespace std;
typedef complex<double> P;
typedef vector<P> G;
/* 外積 */
double cross(const P &a, const P &b) { return imag(conj(a) * b); }
/* 多角形の面積 */
#define curr(g, i) g[i]
#define next(g, i) g... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 236 | 6 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (int)n; (i)++)
#define each(i, o) \
for (__typeof((o).begin()) i = (o).begin(); i != (... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (int)n; (i)++)
#define each(i, o) \
for (__typeof((o).begin()) i = (o).begin(); i != (... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 579 | 4 |
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<long long> P;
string s;
int p;
P A();
P B();
P C();
P A() {
P l = B();
while (s[p] == '+' || s[p] == '-') {
char c = s[p++];
P r = B();
if (c == '+')
l += r;
else
l -= r;
if (abs(l.real(... | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<long long> P;
string s;
int p;
P A();
P B();
P C();
P A() {
P l = B();
while (s[p] == '+' || s[p] == '-') {
char c = s[p++];
P r = B();
if (c == '+')
l += r;
else
l -= r;
if (abs(l.real(... | [["-", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 747 | 6 |
#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 push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
bool m[4][4];
int x[4], y[4];
int dfs(int cnt) {
int res = 0;
if (cnt > 16)
return 1;
... | #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 push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
bool m[4][4];
int x[4], y[4];
int dfs(int cnt) {
int res = 0;
if (cnt >= 16)
return 1;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 343 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
List<String> direc = new ArrayList<String>();
direc.add("RIGHT");
direc.add("LEFT");
int n, m;
n = sc.nextInt();
while (n != 0) {
int posX = 1;
int posY = 1;
... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
List<String> direc = new ArrayList<String>();
direc.add("RIGHT");
direc.add("LEFT");
int n, m;
n = sc.nextInt();
while (n != 0) {
int posX = 1;
int posY = 1;
... | [["-", 0, 57, 64, 196, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 31, 22], ["-", 75, 57, 64, 196, 0, 1, 0, 11, 31, 22], ["+", 75, 57, 64, 196, 0, 1, 0, 11, 31, 22]] | 3 | 394 | 12 |
import java.util.*;
public class Main {
int xpos;
int ypos;
int w;
int h;
private boolean checkUpper(int pos, String state) {
if (state.equals("y")) {
if (pos > h) {
return false;
} else {
return true;
}
} else {
if (pos > w) {
return false;
} els... | import java.util.*;
public class Main {
int xpos;
int ypos;
int w;
int h;
private boolean checkUpper(int pos, String state) {
if (state.equals("y")) {
if (pos > h) {
return false;
} else {
return true;
}
} else {
if (pos > w) {
return false;
} els... | [["-", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 499]] | 3 | 564 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
for (;;) {
int w = in.nextInt();
int h = in.nextInt();
if ((w | h) == 0)
return;
String state = "U";
int nh = 1, nw = 1;
for (;;) {
St... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
for (;;) {
int w = in.nextInt();
int h = in.nextInt();
if ((w | h) == 0)
return;
String state = "U";
int nh = 1, nw = 1;
for (;;) {
St... | [["-", 64, 52, 15, 15, 0, 16, 31, 16, 17, 19], ["+", 64, 52, 15, 15, 0, 16, 31, 16, 17, 18]] | 3 | 546 | 8 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int w = sc.nextInt();
int h = sc.nextInt();
if (w == 0 && h == 0)
break;
String s;
int t;
int d = 0;
int x = 0;
int y... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int w = sc.nextInt();
int h = sc.nextInt();
if (w == 0 && h == 0)
break;
String s;
int t;
int d = 0;
int x = 0;
int y... | [["-", 64, 196, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 64, 196, 0, 57, 64, 1, 0, 11, 31, 22]] | 3 | 392 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
typedef struct st {
int s, t;
double d;
} st;
int N, U[100], i, j, k;
double P[100][4], R;
st D[10005];
int s(const void *a, const void *b) { return ((st *)a)->d - ((st *)b)->d > 0; }
int pa(int n) { return U[n] != n ? pa(U[n]) : n; };
int eq(int a, int b) { ... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
typedef struct st {
int s, t;
double d;
} st;
int N, U[100], i, j, k;
double P[100][4], R;
st D[10005];
int s(const void *a, const void *b) { return ((st *)a)->d - ((st *)b)->d > 0; }
int pa(int n) { return U[n] != n ? pa(U[n]) : n; };
int eq(int a, int b) { ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 525 | 2 |
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 1,873 | 2 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
struct Edge {
int from, to;
double cost;
Edge() {}
Edge(int from_, int to_, double cost_) : from(from_), to(to_), cost(cost_) {}
bool operator<(const Edge &rhs) const { return cost < rhs.cost; }
};
struct Union... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
struct Edge {
int from, to;
double cost;
Edge() {}
Edge(int from_, int to_, double cost_) : from(from_), to(to_), cost(cost_) {}
bool operator<(const Edge &rhs) const { return cost < rhs.cost; }
};
struct Union... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 630 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
class DisjointSet {
private:
vector<int> rank, p;
void link(int x, int y) {
if (rank[x] > rank[y]) {
p[y] = x;
} else {
p[x] = y;
if (rank[x] == rank[y])
rank[y]++;
}
}
public:
DisjointSet(int size) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
class DisjointSet {
private:
vector<int> rank, p;
void link(int x, int y) {
if (rank[x] > rank[y]) {
p[y] = x;
} else {
p[x] = y;
if (rank[x] == rank[y])
rank[y]++;
}
}
public:
DisjointSet(int size) {
... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 688 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORIT(i, c) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORIT(i, c) ... | [["-", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 895 | 2 |
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
double dd(double a) { return a * a; }
int main(void) {
for (;;) {
int n;
cin >> n;
if (!n)
return 0;
... | #include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
double dd(double a) { return a * a; }
int main(void) {
for (;;) {
int n;
cin >> n;
if (!n)
return 0;
... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 388 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
ty... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(3)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 614 | 2 |
// AOJ 1127
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int c[100][100];
struct P {
double x, y, z, r;
double abs() { return sqrt(x * x + y * y + z * z); }
};
P operator-(P a, P b) {
a.x -= b.x;
a.y -= b.y;
a.z -= b.z;
return a;
}
in... | // AOJ 1127
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int c[100][100];
struct P {
double x, y, z, r;
double abs() { return sqrt(x * x + y * y + z * z); }
};
P operator-(P a, P b) {
a.x -= b.x;
a.y -= b.y;
a.z -= b.z;
return a;
}
in... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 482 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
t... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
t... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 875 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<double, int> P;
const double INF = 1e10;
int main() {
int n;
while (cin >> n, n) {
vector<double> x(n), y(n), z(n), r(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> z[i] >> r[i];
}
vector<vector<double>> dis(n, vector<dou... | #include <bits/stdc++.h>
using namespace std;
typedef pair<double, int> P;
const double INF = 1e10;
int main() {
int n;
while (cin >> n, n) {
vector<double> x(n), y(n), z(n), r(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> z[i] >> r[i];
}
vector<vector<double>> dis(n, vector<dou... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 426 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define SQ(a) ((a) * (a))
typedef tuple<double, int, int> Tp;
#define at(t, i) get<i>(t)
struct UnionFind {
vector<int> parent;
UnionFind(int n) {
parent.resize(n);
for (int i = 0; i < n; i++) {
parent[i] = i;
}
}
int find(int x) {
if (paren... | #include <bits/stdc++.h>
using namespace std;
#define SQ(a) ((a) * (a))
typedef tuple<double, int, int> Tp;
#define at(t, i) get<i>(t)
struct UnionFind {
vector<int> parent;
UnionFind(int n) {
parent.resize(n);
for (int i = 0; i < n; i++) {
parent[i] = i;
}
}
int find(int x) {
if (paren... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 631 | 2 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 726 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define EPS 0.0001
typedef struct {
double x;
double y;
double z;
double r;
} Cell;
bool eq(double a, double b) { return abs(a - b) < EPS; }
double cellLength(Cell a, Cell b) {
double l = sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2) + pow(a.z - b.z, 2)) -
... | #include <bits/stdc++.h>
using namespace std;
#define EPS 0.0001
typedef struct {
double x;
double y;
double z;
double r;
} Cell;
bool eq(double a, double b) { return abs(a - b) < EPS; }
double cellLength(Cell a, Cell b) {
double l = sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2) + pow(a.z - b.z, 2)) -
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 454 | 2 |
#include <cmath>
#include <cstdio>
#include <iostream>
#define INF 1000000000
using namespace std;
double mp[101][101];
bool flg[101];
double dis[101];
int n;
double prim() {
double sum = 0;
for (int i = 0; i <= n; i++)
flg[i] = 0, dis[i] = INF;
dis[0] = 0;
for (int q = 0; q < n; q++) {
int nx;
do... | #include <cmath>
#include <cstdio>
#include <iostream>
#define INF 1000000000
using namespace std;
double mp[101][101];
bool flg[101];
double dis[101];
int n;
double prim() {
double sum = 0;
for (int i = 0; i <= n; i++)
flg[i] = 0, dis[i] = INF;
dis[0] = 0;
for (int q = 0; q < n; q++) {
int nx;
do... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 488 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double Weight;
const Weight INF = 1e9;
struct Edge {
int src, dst;
Weight weight;
Edge(int f, int t, Weight c) : src(f), dst(t), weight(c) {}
};
bool operator<(const Edge &a, const Edge &b) {
return a.weight != b.weight ? a.weight > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double Weight;
const Weight INF = 1e9;
struct Edge {
int src, dst;
Weight weight;
Edge(int f, int t, Weight c) : src(f), dst(t), weight(c) {}
};
bool operator<(const Edge &a, const Edge &b) {
return a.weight != b.weight ? a.weight > ... | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 623 | 2 |
#include <algorithm>
#include <bitset>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <time.h>
#include <vector>
using namespace std;
#define EPS (10e-11)
int solve() {
int n;
cin >> n;
if (n == 0)
return 1;
vector<vector<long double>> src(4, vector<long double>(n));
vector<vector<... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <time.h>
#include <vector>
using namespace std;
#define EPS (10e-11)
int solve() {
int n;
cin >> n;
if (n == 0)
return 1;
vector<vector<long double>> src(4, vector<long double>(n));
vector<vector<... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 536 | 2 |
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
struct Point3 {
long double x;
long double y;
long double z;
Point3() : x(0), y(0), z(0) {}
Point3(con... | #include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
struct Point3 {
long double x;
long double y;
long double z;
Point3() : x(0), y(0), z(0) {}
Point3(con... | [["+", 49, 50, 51, 4, 0, 2, 3, 4, 0, 21], ["+", 49, 50, 51, 4, 0, 2, 3, 4, 0, 13], ["-", 0, 57, 64, 9, 0, 43, 49, 50, 51, 146], ["+", 0, 57, 64, 9, 0, 43, 49, 50, 51, 147], ["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 2,029 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
#define WHITE 0
#define EPS 1e-10
#define GRAY 1
#define BLACK 2
#define MAX_N 1000
#define INF 999999999.99
long double x[MAX_N][MAX_N];
long double MIN[MAX_N], color[MAX_N];
long double X[MAX_N], Y[MA... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
#define WHITE 0
#define EPS 1e-10
#define GRAY 1
#define BLACK 2
#define MAX_N 1000
#define INF 999999999.99
long double x[MAX_N][MAX_N];
long double MIN[MAX_N], color[MAX_N];
long double X[MAX_N], Y[MA... | [["-", 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]] | 1 | 670 | 3 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 1,399 | 2 |
#include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
struct Elem {
int to;
double cost;
};
bool operator>(con... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
struct Elem {
int to;
double cost;
};
bool operator>(con... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 426 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 556 | 2 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100;
int par[MAX];
int rnk[MAX];
int nodeNum[MAX];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
rnk[i] = 0;
nodeNum[i]... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100;
int par[MAX];
int rnk[MAX];
int nodeNum[MAX];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
rnk[i] = 0;
nodeNum[i]... | [["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 663 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
cin >>... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
cin >>... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 450 | 2 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 697 | 2 |
/*
*
*
*/
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define ALL(a) (a)... | /*
*
*
*/
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define ALL(a) (a)... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 499 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<double, int> P;
struct point {
double x, y, z, r;
point() {}
point(double x, double y, double z, double r) : x(x), y(y), z(z), r(r) {}
};
bool used[111];
int n;
point pos[111];
double dist(point p, point q) {
double x = p.x - q.x, y = p.y - q.y, z =... | #include <bits/stdc++.h>
using namespace std;
typedef pair<double, int> P;
struct point {
double x, y, z, r;
point() {}
point(double x, double y, double z, double r) : x(x), y(y), z(z), r(r) {}
};
bool used[111];
int n;
point pos[111];
double dist(point p, point q) {
double x = p.x - q.x, y = p.y - q.y, z =... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 403 | 2 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef long long int ll;
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int n) : par(n), rank(n, 1) {
for (int i = 0; i < n; ++i)
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef long long int ll;
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int n) : par(n), rank(n, 1) {
for (int i = 0; i < n; ++i)
... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 47], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 538 | 8 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 608 | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
struct Point {
double x, y, z;
double r;
};
double dist(Point a, Point b) {... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
struct Point {
double x, y, z;
double r;
};
double dist(Point a, Point b) {... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 496 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define REP(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
struct edge {
int p, q;
double d;
bool operator<(const edge &e) const { return d < e.d; }
};
int N;
double X[100], Y[100], Z[100], R[100];
doub... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define REP(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
struct edge {
int p, q;
double d;
bool operator<(const edge &e) const { return d < e.d; }
};
int N;
double X[100], Y[100], Z[100], R[100];
doub... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 466 | 2 |
#include <bits/stdc++.h>
#define DEBUG(C) cerr << #C << " = " << C << endl
using namespace std;
const int MAX = 111;
double x[MAX], y[MAX], z[MAX], r[MAX];
bool vis[MAX];
inline double dist(int p, int q) {
return max<double>(0.0, sqrt((x[p] - x[q]) * (x[p] - x[q]) +
(y[p] - y[q]) * ... | #include <bits/stdc++.h>
#define DEBUG(C) cerr << #C << " = " << C << endl
using namespace std;
const int MAX = 111;
double x[MAX], y[MAX], z[MAX], r[MAX];
bool vis[MAX];
inline double dist(int p, int q) {
return max<double>(0.0, sqrt((x[p] - x[q]) * (x[p] - x[q]) +
(y[p] - y[q]) * ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 416 | 2 |
#include <algorithm>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, N) for (ll i = 0; i < N; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define ALL(a) (a).begin(), (a... | #include <algorithm>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, N) for (ll i = 0; i < N; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define ALL(a) (a).begin(), (a... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 600 | 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 PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | #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 PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 834 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MAX 100
typedef pair<int, int> pii;
typedef pair<double, pii> pp;
struct union_find {
int rnk[MAX], par[MAX];
union_find(int n) {
for (int i = 0; i < n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MAX 100
typedef pair<int, int> pii;
typedef pair<double, pii> pp;
struct union_find {
int rnk[MAX], par[MAX];
union_find(int n) {
for (int i = 0; i < n... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 595 | 2 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const double eps = 1e-9;
const double inf = 1e9;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<double> x(n), y(n), z(n), r(n);
for (int... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const double eps = 1e-9;
const double inf = 1e9;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<double> x(n), y(n), z(n), r(n);
for (int... | [["-", 0, 1, 0, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 16, 12, 2, 3, 4, 0, 13]] | 1 | 472 | 2 |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
double prim(int n, vector<vector<double>> &G) {
double ans = 0;
priority_queue<pair<double, int>> wait;
bool connected[n];
fill(connected, connected + n, false);
wait.push(make_pair(0.0, 0));
whil... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
double prim(int n, vector<vector<double>> &G) {
double ans = 0.0;
priority_queue<pair<double, int>> wait;
bool connected[n];
fill(connected, connected + n, false);
wait.push(make_pair(0.0, 0));
wh... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 433 | 4 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
using namespace std;
typedef long long int lli;
ty... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
using namespace std;
typedef long long int lli;
ty... | [["+", 8, 123, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 8, 123, 0, 14, 8, 9, 0, 37, 0, 146], ["+", 8, 123, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 515 | 3 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 741 | 2 |
// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)... | // clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)... | [["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 1,457 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <exception>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <exception>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include ... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 48], ["+", 49, 50, 51, 4, 0, 16, 12, 23, 0, 24], ["+", 51, 4, 0, 16, 12, 23, 0, 16, 31, 22], ["+", 49, 50, 51, 4, 0, 16, 12, 23, 0, 25], ["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 3,858 | 6 |
#include <algorithm>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 100000... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 100000... | [["+", 8, 9, 0, 1, 0, 11, 12, 23, 0, 24], ["+", 8, 9, 0, 1, 0, 11, 12, 23, 0, 25], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 710 | 6 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include ... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 568 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
const double INF = 10000.0;
const int MAX_V = 1000;
int n;
struct cell {
double x, y, z, r;
};
double cost[MAX_V][MAX_V];
double mincost[MAX_V];
bool used[MAX_V];
void add_edge(int u, int v, double cost_) { cost[u][v] =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
const double INF = 10000.0;
const int MAX_V = 1000;
int n;
struct cell {
double x, y, z, r;
};
double cost[MAX_V][MAX_V];
double mincost[MAX_V];
bool used[MAX_V];
void add_edge(int u, int v, double cost_) { cost[u][v] =... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 532 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 575 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <utility>
#include <vector>
using namespace std... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <utility>
#include <vector>
using namespace std... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 667 | 2 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#incl... | #define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#incl... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 655 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#includ... | [["-", 0, 1, 0, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 16, 12, 2, 3, 4, 0, 13]] | 1 | 1,230 | 2 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <ss... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <ss... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 556 | 2 |
require 'prime'
require 'set'
require 'tsort'
include Math
def max(a,b); a > b ? a : b end
def min(a,b); a < b ? a : b end
def swap(a,b); a, b = b, a end
def gif; gets.to_i ... | require 'prime'
require 'set'
require 'tsort'
include Math
def max(a,b); a > b ? a : b end
def min(a,b); a < b ? a : b end
def swap(a,b); a, b = b, a end
def gif; gets.to_i ... | [["-", 0, 652, 196, 196, 8, 734, 0, 652, 735, 22], ["-", 196, 196, 8, 734, 0, 652, 3, 4, 0, 22]] | 4 | 661 | 2 |
inf = 1 << 28
def calc(xyzr1,xyzr2):
x1,y1,z1,r1 = xyzr1
x2,y2,z2,r2 = xyzr2
d = ((x1-x2)**2+(y1-y2)**2+(z1-z2)**2)**0.5
return max(0, d-r1-r2)
while True:
n = int(input())
if n == 0: break
xyzr = [list(map(float,input().split())) for i in range(n)]
cost = [[0]*n for i in range... | inf = 1 << 28
def calc(xyzr1,xyzr2):
x1,y1,z1,r1 = xyzr1
x2,y2,z2,r2 = xyzr2
d = ((x1-x2)**2+(y1-y2)**2+(z1-z2)**2)**0.5
return max(0, d-r1-r2)
while True:
n = int(input())
if n == 0: break
xyzr = [list(map(float,input().split())) for i in range(n)]
cost = [[0]*n for i in range... | [["-", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6]] | 5 | 294 | 2 |
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int W, H;
static boolean[][] f;
static int[][] size;
static int[][] count;
static int ans;
public static void main(String[] args) {
while (true) {
W = sc.nextInt();
if (W == 0)
break;... | import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
static int W, H;
static boolean[][] f;
static int[][] size;
static int[][] count;
static int ans;
public static void main(String[] args) {
while (true) {
W = sc.nextInt();
if (W == 0)
break;... | [["-", 15, 15, 0, 16, 31, 504, 71, 16, 12, 499], ["+", 15, 15, 0, 16, 31, 504, 71, 16, 12, 22]] | 3 | 784 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
using namespace std;
struct State {
int a[10][10];
};
char c[10][10];
int p[10][10], H, W, mindep, cnts;
int range(int sx, int sy, int gx, int gy) {
int cnt = 0;
for (int i = sx; i < gx; i++) {
for (int j = sy; j < gy; j++) {
if... | #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
using namespace std;
struct State {
int a[10][10];
};
char c[10][10];
int p[10][10], H, W, mindep, cnts;
int range(int sx, int sy, int gx, int gy) {
int cnt = 0;
for (int i = sx; i < gx; i++) {
for (int j = sy; j < gy; j++) {
if... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 920 | 6 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int w, h, n, A[11][11], ans, cnt;
bitset<100> B[11][11], p;
void dfs(int d, bitset<100> s, int sco) {
if (d == n) {
ans = min(ans, sco);
return;
}
cnt++;
if (cnt >= 5000000)
return;
if (ans <= sco)
retu... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int w, h, n, A[11][11], ans, cnt;
bitset<100> B[11][11], p;
void dfs(int d, bitset<100> s, int sco) {
if (d == n) {
ans = min(ans, sco);
return;
}
cnt++;
if (cnt >= 19000000)
return;
if (ans <= sco)
ret... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 551 | 2 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 398 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, r, p, c;
int h[51];
int main() {
while (cin >> n >> r, n | r) {
for (int i = 0; i < n; ++i) {
h[i] = i;
}
for (int i = 0; i < r; ++i) {
cin >> p >> c;
rotate(h + 1, h + p, h + p + c);
}
cout << h[1] << endl;
... | #include <algorithm>
#include <iostream>
using namespace std;
int n, r, p, c;
int h[51];
int main() {
while (cin >> n >> r, n | r) {
for (int i = 1; i <= n; ++i) {
h[i] = n - i + 1;
}
for (int i = 0; i < r; ++i) {
cin >> p >> c;
rotate(h + 1, h + p, h + p + c);
}
cout << h[1] <... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0... | 1 | 117 | 8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.