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 <bits/stdc++.h>
using namespace std;
int main() {
int x, y, x1, y1;
int cnt = 0;
while (1) {
cin >> x >> y;
if (x == 0 && y == 0) {
break;
}
if (x < y)
swap(x, y);
while (1) {
x = x % y;
swap(x, y);
cnt++;
if (y == 0)
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, x1, y1;
int cnt = 0;
while (1) {
cnt = 0;
cin >> x >> y;
if (x == 0 && y == 0) {
break;
}
if (x < y)
swap(x, y);
while (1) {
x = x % y;
swap(x, y);
cnt++;
if (y == 0)
bre... | [["+", 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>
main() {
for (int a, b, t, c; std::cin >> a >> b; printf("%d %d\n", a, c)) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
for (c = 0; t = b; a = t, c++)
b = a % b;
}
} | #include <iostream>
main() {
for (int a, b, t, c; std::cin >> a >> b, a; printf("%d %d\n", a, c)) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
for (c = 0; t = b; a = t, c++)
b = a % b;
}
} | [["+", 0, 14, 8, 9, 0, 7, 15, 34, 0, 21], ["+", 0, 14, 8, 9, 0, 7, 15, 34, 12, 22]] | 1 | 83 | 2 |
#include <bits/stdc++.h>
using namespace std;
struct BOX {
string top;
string back, left, right, head;
string buttom;
bool operator==(const BOX &b) const {
return (top == b.top && back == b.back && left == b.left &&
right == b.right && head == b.head && buttom == b.buttom);
}
};
class UnionFi... | #include <bits/stdc++.h>
using namespace std;
struct BOX {
string top;
string back, left, right, head;
string buttom;
bool operator==(const BOX &b) const {
return (top == b.top && back == b.back && left == b.left &&
right == b.right && head == b.head && buttom == b.buttom);
}
};
class UnionFi... | [["-", 0, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["+", 0, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["-", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120], ["+", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120]] | 1 | 700 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setpreci... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setpreci... | [["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 1,340 | 10 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = input.trim().split("\n");
while (true) {
var nm = Arr.shift().split(" ").map(Number);
var n = nm[0];
var m = nm[1];
if (n == 0 && m == 0)
break;
var arr = [];
for (var i = 0; i < n; i++)
arr.push(0);
arr.unshift("X");
arr.pu... | var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = input.trim().split("\n");
while (true) {
var nm = Arr.shift().split(" ").map(Number);
var n = nm[0];
var m = nm[1];
if (n == 0 && m == 0)
break;
var arr = [];
for (var i = 0; i < n; i++)
arr.push(0);
arr.unshift("X");
arr.pu... | [["-", 71, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 71, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["-", 0, 1, 0, 11, 31, 69, 71, 16, 12, 555], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 12, 555]] | 2 | 795 | 4 |
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 m = sc.nextInt();
if (n == 0 && m == 0) {
break;
}
String[] chairs = new String[n];
for (int i =... | 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 m = sc.nextInt();
if (n == 0 && m == 0) {
break;
}
String[] chairs = new String[n];
for (int i =... | [["+", 0, 1, 0, 11, 31, 504, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 504, 71, 16, 12, 499], ["+", 0, 11, 31, 504, 71, 16, 31, 16, 12, 499]] | 3 | 864 | 4 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int m = sc.nextInt();
if (n == 0 && m == 0)
break;
char[] a = new char[n + 2];
Arrays.fill(a, '#');
a[0] = ... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int m = sc.nextInt();
if (n == 0 && m == 0)
break;
char[] a = new char[n + 2];
Arrays.fill(a, '#');
a[0] = ... | [["-", 64, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 64, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 673 | 2 |
n, m, p;
char s[2], c[101];
A() {
for (p = 0; c[p] != '#'; p++)
;
}
B() {
for (p = n - 1; p >= 0; p--)
if (c[p] == '#' && (p + 1 == n || c[p + 1] != 'A') &&
(p - 1 < 0 || c[p - 1] != 'A'))
return;
A();
}
C() {
for (p = 0; p < n; p++) {
if (c[p] != '#') {
if (p + 1 != n && c[p + 1... | n, m, p;
char s[2], c[101];
A() {
for (p = 0; c[p] != '#'; p++)
;
}
B() {
for (p = n - 1; p >= 0; p--)
if (c[p] == '#' && (p + 1 == n || c[p + 1] != 'A') &&
(p - 1 < 0 || c[p - 1] != 'A'))
return;
A();
}
C() {
for (p = 0; p < n; p++) {
if (c[p] != '#') {
if (p + 1 != n && c[p + 1... | [["+", 0, 9, 0, 43, 49, 50, 51, 16, 17, 48], ["+", 0, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 30, 0, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 30, 0, 9, 0, 7, 10, 11, 12, 22]] | 0 | 489 | 4 |
#include <iostream>
using namespace std;
int m, n, j, k, f, g;
char c[101];
void acta() {
for (j = 0; j < m; j++)
if (c[j] == '#') {
c[j] = 'A';
break;
}
}
void actb() {
f = m - 1;
for (j = m - 1; j >= 0; j--) {
if (c[j] != '#')
continue;
f = j;
if (j == m - 1) {
if (c... | #include <iostream>
using namespace std;
int m, n, j, k, f, g;
char c[101];
void acta() {
for (j = 0; j < m; j++)
if (c[j] == '#') {
c[j] = 'A';
break;
}
}
void actb() {
f = m - 1;
for (j = m - 1; j >= 0; j--) {
if (c[j] != '#')
continue;
f = j;
if (j == m - 1) {
if (c... | [["-", 31, 69, 341, 342, 0, 16, 31, 23, 0, 24], ["-", 341, 342, 0, 16, 31, 23, 0, 16, 17, 33], ["-", 341, 342, 0, 16, 31, 23, 0, 16, 12, 13], ["-", 31, 69, 341, 342, 0, 16, 31, 23, 0, 25]] | 1 | 636 | 4 |
#include <bits/stdc++.h>
using namespace std;
// 12:46
string chair;
int goA(char c) {
for (int i = 0; i < chair.size(); i++)
if (chair[i] == '#') {
chair[i] = c;
return 1;
}
return 0;
}
int goB(char c) {
for (int i = chair.size() - 1; i >= 0; i--)
if (chair[i] == '#' && (!i || chair[i -... | #include <bits/stdc++.h>
using namespace std;
// 12:46
string chair;
int goA(char c) {
for (int i = 0; i < chair.size(); i++)
if (chair[i] == '#') {
chair[i] = c;
return 1;
}
return 0;
}
int goB(char c) {
for (int i = chair.size() - 1; i >= 0; i--)
if (chair[i] == '#' && (!i || chair[i -... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 572 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FFOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(i, b) FOR(i, 0, b)
#d... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FFOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(i, b) FOR(i, 0, b)
#d... | [["-", 0, 57, 64, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 57, 64, 9, 0, 43, 49, 50, 51, 13]] | 1 | 774 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
char chair[200];
void A(char ch) {
int i = 1;
while (chair[i] != '#')
i++;
chair[i] = ch;
}
void B() {
int i = n;
while (chair[i] != '#')
i--;
chair[i] = 'B';
}
void C(int kai) {
if (kai == 0) {
if (n % 2)
chair[(n + 1) / 2] = 'C... | #include <bits/stdc++.h>
using namespace std;
int n, m;
char chair[200];
void A(char ch) {
int i = 1;
while (chair[i] != '#')
i++;
chair[i] = ch;
}
void B() {
int i = n;
while (chair[i] != '#')
i--;
chair[i] = 'B';
}
void C(int kai) {
if (kai == 0) {
if (n % 2)
chair[(n + 1) / 2] = 'C... | [["-", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 31, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 11, 31, 69, 341, 342,... | 1 | 636 | 8 |
#include <iostream>
int n, m;
int chair[105];
int dist(int k) {
int ret = 1000;
for (int i = k; i <= n; ++i) {
if (chair[i]) {
ret = i - k;
}
}
for (int i = k; i >= 1; --i) {
if (chair[i]) {
ret = std::min(ret, k - i);
}
}
return ret;
}
int main() {
while (true) {
for (i... | #include <iostream>
int n, m;
int chair[105];
int dist(int k) {
int ret = 1000;
for (int i = k; i <= n; ++i) {
if (chair[i]) {
ret = i - k;
break;
}
}
for (int i = k; i >= 1; --i) {
if (chair[i]) {
ret = std::min(ret, k - i);
break;
}
}
return ret;
}
int main() {
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 624 | 4 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | [["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 686 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
int ans[111]... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
int ans[111]... | [["-", 31, 69, 341, 342, 0, 16, 31, 23, 0, 24], ["-", 341, 342, 0, 16, 31, 23, 0, 16, 17, 72], ["-", 341, 342, 0, 16, 31, 23, 0, 16, 12, 13], ["-", 31, 69, 341, 342, 0, 16, 31, 23, 0, 25]] | 1 | 712 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N, M;
int a[100];
void sit_from_left(int id) {
for (int i = 0; i < N; ++i) {
if (a[i] == -1) {
a[i] = id;
break;
}
}
}
void sit_a() { sit_from_left(0); }
void sit_b() {
bool sat = false;
;
for (int i = ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N, M;
int a[100];
void sit_from_left(int id) {
for (int i = 0; i < N; ++i) {
if (a[i] == -1) {
a[i] = id;
break;
}
}
}
void sit_a() { sit_from_left(0); }
void sit_b() {
bool sat = false;
;
for (int i = ... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 653 | 2 |
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
struct Info {
Info() { country = '#'; }
char country;
};
void func(int n, int m) {
Info info[n];
char tmp[2];
int maximum, most_left_index, pre_index, div, left_dist;
bool FLG... | #include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
struct Info {
Info() { country = '#'; }
char country;
};
void func(int n, int m) {
Info info[n];
char tmp[2];
int maximum, most_left_index, pre_index, div, left_dist;
bool FLG... | [["+", 0, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 28, 69, 341, 342, 0, 16, 31, 23, 0, 25], ["+", 31, 118, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 118, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 31, 118, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 31, 118, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 979 | 6 |
#include <algorithm>
#include <cstdio>
#define N 11
#define inf 10000000
using namespace std;
int d[N][N], V;
void warshall_floyd(void) {
for (int k = 0; k <= V; k++) {
for (int i = 0; i <= V; i++) {
for (int j = 0; j <= V; j++)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
return;
}
void i... | #include <algorithm>
#include <cstdio>
#define N 11
#define inf 10000000
using namespace std;
int d[N][N], V;
void warshall_floyd(void) {
for (int k = 0; k <= V; k++) {
for (int i = 0; i <= V; i++) {
for (int j = 0; j <= V; j++)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
return;
}
void i... | [["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 0, 11, 12, 2, 3, 4, 0, 2, 63, 22], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 381 | 5 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, m, a, b, c, _end;
int x[10][10];
int bfs(int p, int a) {
int s[10], minx = 114514, sum;
sum = 0;
memset(s, 127, sizeof(s));
s[a] = 0;
for (int l = 0; l < p; l++) {
for (int o = 0; o < p; o++) {
if (s[o] < 11451... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, m, a, b, c, _end;
int x[10][10];
int bfs(int p, int a) {
int s[10], minx = 114514, sum;
sum = 0;
memset(s, 127, sizeof(s));
s[a] = 0;
for (int l = 0; l < p; l++) {
for (int o = 0; o < p; o++) {
if (s[o] < 11451... | [["-", 31, 16, 31, 16, 31, 16, 12, 16, 12, 13], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 12, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 459 | 4 |
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int T[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j) {
T[i][j] = 0;
} else {
... | #include <iostream>
using namespace std;
const int INF = 1000000000;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int T[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j) {
T[i][j] = 0;
} else {
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 439 | 4 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < b; i++)
#define INF 1000000000
#define MAX_N 305
using namespace std;
bool debug = false;
int d[10][10];
void init() {
for (in... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < b; i++)
#define INF 1000000000
#define MAX_N 305
using namespace std;
bool debug = false;
int d[12][12];
void init() {
for (in... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8,... | 1 | 412 | 10 |
#include <cstdio>
using namespace std;
static const int MAX_V = 10;
static const int MAX_E = 45;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int n, M[MAX_V][MAX_V];
int dijkstra(int s) {
int mincost;
int d[MAX_V], color[MAX_V];
for (int... | #include <cstdio>
using namespace std;
static const int MAX_V = 10;
static const int MAX_E = 45;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
int n, M[MAX_V][MAX_V];
int dijkstra(int s) {
int mincost;
int d[MAX_V], color[MAX_V];
for (int... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 524 | 1 |
// 2014/06/16 Tazoe
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int T[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j) {
T[i][j] = 0;
... | // 2014/06/16 Tazoe
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int T[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j) {
T[i][j] = 0;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 391 | 2 |
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int T[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j) {
T[i][j] = 0;
} else {
... | #include <iostream>
using namespace std;
const int INF = 1000000000;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int T[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j) {
T[i][j] = 0;
} else {
... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 383 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int T[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j) {
T[i][j] = 0;
... | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1000000000;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int T[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j) {
T[i][j] = 0;
... | [["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 429 | 3 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MAXN 2555
#define INF 0x3f3f3f3f
#define v first
#define b second
using namespace std;
int fp[15][15];
int m;
void floyd() {
for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MAXN 2555
#define INF 0x3f3f3f3f
#define v first
#define b second
using namespace std;
int fp[15][15];
int m;
void floyd() {
for (... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 2... | 1 | 357 | 10 |
#include <bits/stdc++.h>
#define SIZE 100005
#define MAX_V 100001
#define INF (1e9 + 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int g[10][10];
int main() {
int a;
while (scanf("%d", &a), a) {
for (int i = 0; i, 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j)
... | #include <bits/stdc++.h>
#define SIZE 100005
#define MAX_V 100001
#define INF (1e9 + 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int g[10][10];
int main() {
int a;
while (scanf("%d", &a), a) {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j)
... | [["-", 0, 52, 8, 9, 0, 7, 15, 34, 0, 21], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 390 | 2 |
#include <algorithm>
#include <iostream>
#define INF 1000000
using namespace std;
int main(void) {
int n;
while (cin >> n && n) {
int f[10][10];
fill((int *)f, (int *)f + n * n, INF);
int s, t, cost;
int maxi = 0;
for (int i = 0; i < n; i++) {
cin >> s >> t >> cost;
maxi = max(max... | #include <algorithm>
#include <iostream>
#define INF 1000000
using namespace std;
int main(void) {
int n;
while (cin >> n && n) {
int f[10][10];
fill((int *)f, (int *)f + 10 * 10, INF);
int s, t, cost;
int maxi = 0;
for (int i = 0; i < n; i++) {
cin >> s >> t >> cost;
maxi = max(m... | [["-", 0, 2, 3, 4, 0, 16, 12, 16, 31, 22], ["+", 0, 2, 3, 4, 0, 16, 12, 16, 31, 13], ["-", 0, 2, 3, 4, 0, 16, 12, 16, 12, 22], ["+", 0, 2, 3, 4, 0, 16, 12, 16, 12, 13]] | 1 | 323 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int map[10][10];
int m = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j)
map[i][j] = 0;
else
map[i][j] = 10000000;
}
}
for (int i = 0; i... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int map[10][10];
int m = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
if (i == j)
map[i][j] = 0;
else
map[i][j] = 10000000;
}
}
for (int i = 0; i... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 346 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<vector<int>> Matrix;
const int INF = 100000000;
Matrix
d; // グラフの距離を格納した2次元配列（隣接行列）
// d[u][v]は辺e=(u,v)のコスト（辺が存在しない場合はINF、ただしd[i][i]=0）
void warshall_floyd(int n) { // nは頂点数
for (int i = 0; i < n; i++) ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<vector<int>> Matrix;
const int INF = 100000000;
Matrix
d; // グラフの距離を格納した2次元配列（隣接行列）
// d[u][v]は辺e=(u,v)のコスト（辺が存在しない場合はINF、ただしd[i][i]=0）
void warshall_floyd(int n) { // nは頂点数
for (int i = 0; i < n; i++) ... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 407 | 5 |
#include <algorithm>
#include <iostream>
const int MAX_V = 10, INF = 1 << 24;
int V;
int d[MAX_V], used[MAX_V], cost[MAX_V][MAX_V];
void dijkstra(int s) {
std::fill(d, d + MAX_V, INF);
std::fill(used, used + MAX_V, 0);
d[s] = 0;
while (true) {
int v = -1;
for (int u = 0; u < V; u++) {
if (!use... | #include <algorithm>
#include <iostream>
const int MAX_V = 10, INF = 1 << 24;
int V;
int d[MAX_V], used[MAX_V], cost[MAX_V][MAX_V];
void dijkstra(int s) {
std::fill(d, d + MAX_V, INF);
std::fill(used, used + MAX_V, 0);
d[s] = 0;
while (true) {
int v = -1;
for (int u = 0; u < V; u++) {
if (!use... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 453 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
#define INF 1000000
int C[15][15];
int main() {
int n;
while (scanf("%d", &n), n) {
for (int i = 0; i < 15; ++i) {
for (int j = 0; j < 15; ++j) {
C[i][j] = i == j ? 0 : INF;
}
}
int m = 0;
for (int i = 0; i < n; ++i) {
... | #include <algorithm>
#include <cstdio>
using namespace std;
#define INF 1000000
int C[15][15];
int main() {
int n;
while (scanf("%d", &n), n) {
for (int i = 0; i < 15; ++i) {
for (int j = 0; j < 15; ++j) {
C[i][j] = i == j ? 0 : INF;
}
}
int m = 0;
for (int i = 0; i < n; ++i) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 344 | 2 |
// 2013/11/15(Fri)
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
int a, b, c;
int INF = 12001;
int time[10][10];
int m = 0;
int min = 12000, imin = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++) ... | // 2013/11/15(Fri)
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
int a, b, c;
int INF = -1;
int time[10][10];
int m = 0;
int min = 0, imin = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++) {
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 456 | 4 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0189
AC
"""
import sys
from sys import stdin
input = stdin.readline
def warshallFloyd(V, dp):
for k in range(V):
for i in range(V):
for j in range(V):
dp_ik = dp[i][k]
dp_kj = d... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0189
AC
"""
import sys
from sys import stdin
input = stdin.readline
def warshallFloyd(V, dp):
for k in range(V):
for i in range(V):
for j in range(V):
dp_ik = dp[i][k]
dp_kj = d... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 18], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47]] | 5 | 306 | 31 |
NULL = 10000
TOWN_COUNT = 10
while True:
input_count = int(input())
if input_count == 0:
break
adjacency_matrix = [[NULL] * TOWN_COUNT for _ in range(TOWN_COUNT)]
for lp in range(TOWN_COUNT):
adjacency_matrix[lp][lp] = 0
need_range = 0
for _ in range(input_count):
... | NULL = 10000
TOWN_COUNT = 10
while True:
input_count = int(input())
if input_count == 0:
break
adjacency_matrix = [[NULL] * TOWN_COUNT for _ in range(TOWN_COUNT)]
for lp in range(TOWN_COUNT):
adjacency_matrix[lp][lp] = 0
need_range = 0
for _ in range(input_count):
... | [["-", 0, 1, 0, 662, 31, 206, 51, 206, 206, 22], ["+", 0, 1, 0, 662, 31, 206, 51, 206, 206, 22], ["-", 3, 4, 0, 657, 31, 206, 51, 206, 206, 22], ["+", 3, 4, 0, 657, 31, 206, 51, 206, 206, 22], ["-", 12, 652, 3, 4, 0, 657, 31, 206, 206, 22], ["+", 12, 652, 3, 4, 0, 657, 31, 206, 206, 22], ["-", 3, 4, 0, 657, 12, 206, 51... | 5 | 247 | 10 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep... | [["-", 0, 16, 12, 16, 12, 2, 63, 118, 28, 22], ["+", 12, 16, 12, 2, 63, 118, 28, 2, 63, 22], ["+", 12, 2, 63, 118, 28, 2, 3, 4, 0, 24], ["+", 12, 2, 63, 118, 28, 2, 3, 4, 0, 25]] | 1 | 1,405 | 4 |
import java.util.Scanner;
// Search
public class Main {
static int c;
static int[] a;
static int comp(int k, int x) {
c++;
return a[k] - x;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
b... | import java.util.Scanner;
// Search
public class Main {
static int c;
static int[] a;
static int comp(int k, int x) {
c++;
return a[k] - x;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
b... | [["-", 0, 52, 8, 196, 0, 52, 15, 15, 0, 146], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 31, 22], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 17, 19], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 12, 22]] | 3 | 234 | 4 |
#include <stdio.h>
int main(void) {
int n, target, count;
int data[100];
int lo, hi, ce;
int i;
while (scanf("%d", &n)) {
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
scanf("%d", &target);
count = 0;
hi = n;
lo = 0;
while (hi >= lo) {
... | #include <stdio.h>
int main(void) {
int n, target, count;
int data[100];
int lo, hi, ce;
int i;
while (scanf("%d", &n)) {
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
scanf("%d", &target);
count = 0;
hi = n - 1;
lo = 0;
while (hi >= lo) ... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 171 | 2 |
#include <stdio.h>
int list[10000];
int n, t;
int bin_search(int l, int r, int c) {
int m = (l + r) / 2;
if (list[m] == t) {
return c;
} else if (r < l) {
return c;
} else if (list[m] < t) {
return bin_search(m + 1, r, c + 1);
} else if (list[m] > t) {
return bin_search(l, m - 1, c + 1);
}
... | #include <stdio.h>
int list[100];
int n, t;
int bin_search(int l, int r, int c) {
int m = (l + r) / 2;
if (list[m] == t) {
return c;
} else if (r < l) {
return c - 1;
} else if (list[m] < t) {
return bin_search(m + 1, r, c + 1);
} else if (list[m] > t) {
return bin_search(l, m - 1, c + 1);
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 0, 57, 64, 9, 0, 37, 0, 16, 17, 33], ["+", 0, 57, 64, 9, 0, 37, 0, 16, 12, 13], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 207 | 6 |
#include <stdio.h>
int a, times, ind[105];
void solve(int l, int r) {
times++;
if (a == ind[(l + r) / 2]) {
return;
}
if (l > r) {
return;
}
if (ind[(l + r) / 2] > a) {
solve(l, (l + r) / 2 - 1);
} else {
solve((l + r) / 2 + 1, r);
}
}
int main(void) {
int n;
int i;
while (1)... | #include <stdio.h>
int a, times, ind[105];
void solve(int l, int r) {
times++;
if (a == ind[(l + r) / 2]) {
return;
}
if (l > r) {
times--;
return;
}
if (ind[(l + r) / 2] > a) {
solve(l, (l + r) / 2 - 1);
} else {
solve((l + r) / 2 + 1, r);
}
}
int main(void) {
int n;
int i;... | [["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 208 | 5 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int A[n];
for (int i = 0; i < n; i++)
cin >> A[i];
int x;
cin >> x;
int ans = 1;
int r = n - 1, l = 0;
while (l < r) {
ans++;
int mid = (r + l) / 2... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int A[n];
for (int i = 0; i < n; i++)
cin >> A[i];
int x;
cin >> x;
int ans = 0;
int r = n - 1, l = 0;
while (l <= r) {
ans++;
int mid = (r + l) / ... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47]] | 1 | 161 | 6 |
#include <iostream>
using namespace std;
int a[100];
int n, k;
main() {
while (cin >> n, n) {
for (int i = 0; i < n; i++)
cin >> a[i];
int l = 0, f = n - 1;
cin >> k;
int cnt = 0;
while (f > l) {
int m = (f + l) / 2;
cnt++;
if (a[m] > k)
l = m + 1;
else if (a[... | #include <iostream>
using namespace std;
int a[100];
int n, k;
main() {
while (cin >> n, n) {
for (int i = 0; i < n; i++)
cin >> a[i];
int l = 0, f = n - 1;
cin >> k;
int cnt = 0;
while (f >= l) {
int m = (f + l) / 2;
cnt++;
if (a[m] > k)
f = m - 1;
else if (a... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 17, 33], ["-", 75, 76, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 75, 76,... | 1 | 135 | 10 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<int> v;
int f;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
v.push_back(tmp);
}
cin >> f;
int l, r;
l = 0;
r = v.size() - 1;
int ans = 0;
whil... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<int> v;
int f;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
v.push_back(tmp);
}
cin >> f;
int l, r;
l = 0;
r = v.size() - 1;
int ans = 0;
whil... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 158 | 2 |
#include <iostream>
using namespace std;
int main() {
int num[101], r, l, c;
int kazu, target, t;
int i;
while (1) {
t = 0;
cin >> kazu;
if (kazu == 0) {
break;
}
for (i = 0; i < kazu; i++) {
cin >> num[i];
}
cin >> target;
l = 0;
r = (kazu - 1);
t = 0;... | #include <iostream>
using namespace std;
int main() {
int num[101], r, l, c;
int kazu, target, t;
int i;
while (1) {
t = 0;
cin >> kazu;
if (kazu == 0) {
break;
}
for (i = 0; i < kazu; i++) {
cin >> num[i];
}
cin >> target;
l = 0;
r = (kazu - 1);
t = 0;... | [["-", 0, 52, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 176 | 4 |
#include <iostream>
using namespace std;
int box[10000];
int num = 0;
int findn;
bool check(int begin, int end) {
if (begin > end)
return true;
num++;
if (box[(begin + end) / 2] > findn)
check(begin, (begin + end) / 2 - 1);
else if (box[(begin + end) / 2] < findn)
check((begin + end) / 2 + 1, end);... | #include <iostream>
using namespace std;
int box[10000];
int num = 0;
int findn;
bool check(int begin, int end) {
if (begin > end)
return true;
num++;
if (box[(begin + end) / 2] > findn)
check(begin, (begin + end) / 2 - 1);
else if (box[(begin + end) / 2] < findn)
check((begin + end) / 2 + 1, end);... | [["+", 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 | 201 | 4 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int v[100];
int main() {
int n;
while (cin >> n, n) {
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int search;
cin >> search;
int l = 0, h = n - 1, res = 0;
while (l <= h) {
int mid = (l + h) / 2;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int v[100];
int main() {
int n;
while (cin >> n, n) {
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int search;
cin >> search;
int l = 0, h = n - 1, res = 0;
while (l <= h) {
int mid = (l + h) / 2;
... | [["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 73]] | 1 | 145 | 6 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
////////////////*My library*////////////////////////
#define rep_to(a, i, n) for (i = a; i < n; i++)
#define rep(i, n) for (i = 0; i < n; i++)
#define rep_r(i, n) for (i = n - 1; i >= 0; i--)
#define debug_i(x) printf("x:%d\... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
////////////////*My library*////////////////////////
#define rep_to(a, i, n) for (i = a; i < n; i++)
#define rep(i, n) for (i = 0; i < n; i++)
#define rep_r(i, n) for (i = n - 1; i >= 0; i--)
#define debug_i(x) printf("x:%d\... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 263 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int T[100010];
int find(int m, int x) {
int r = 0, l = m, ans = 0;
while (1) {
ans++;
if (r >= l)
break;
if (T[(r + l) / 2] == x)
return ans;
if (T[(r + l) / 2] > x)
l = (r + l) / 2 - 1;
else if (T[(r + l) / 2] < x)... | #include <algorithm>
#include <iostream>
using namespace std;
int T[100010];
int find(int m, int x) {
int r = 0, l = m - 1, ans = 0;
while (1) {
ans++;
if (r >= l)
break;
if (T[(r + l) / 2] == x)
return ans;
if (T[(r + l) / 2] > x)
l = (r + l) / 2 - 1;
else if (T[(r + l) / 2] ... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 217 | 2 |
#include <iostream>
using namespace std;
int a[1000], n, cnt, L, R, M, p;
int main() {
while (true) {
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cin >> p;
L = 0;
R = n - 1;
cnt = 0;
while (R - L >= 1) {
cnt++;
M = (R ... | #include <iostream>
using namespace std;
int a[1000], n, cnt, L, R, M, p;
int main() {
while (true) {
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cin >> p;
L = 0;
R = n - 1;
cnt = 0;
while (R >= L) {
cnt++;
M = (R + L)... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 33], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 169 | 6 |
#include <iostream>
using namespace std;
int a[100];
int main() {
int n, key;
while (true) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
cin >> key;
int ans = 0;
int left = 0, right = n - 1, mid;
while (true) {
if (left > right)
break;
... | #include <iostream>
using namespace std;
int a[100];
int main() {
int n, key;
while (true) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
cin >> key;
int ans = 0;
int left = 0, right = n - 1, mid;
while (true) {
if (left > right)
break;
... | [["-", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 164 | 3 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
int a[100000];
int lef;
int rig;
int ans;
bool binary_search_2(int num) {
if (lef == rig) {
ans++;
return false;
}
int middle = (lef + rig) / 2;
ans+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
int a[100000];
int lef;
int rig;
int ans;
bool binary_search_2(int num) {
if (lef > rig) {
return false;
}
int middle = (lef + rig) / 2;
ans++;
if (a[m... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 233 | 5 |
#include <iostream>
using namespace std;
int nibn(int a[], int s, int e, int k);
int nibn(int a[], int s, int e, int k) {
if (s > e)
return 1;
if (a[(s + e) / 2] == k) {
return 1;
} else if (a[(s + e) / 2] < k) {
return 1 + nibn(a, (s + e) / 2 + 1, e, k);
} else if (a[(s + e) / 2] > k) {
return... | #include <iostream>
using namespace std;
int nibn(int a[], int s, int e, int k);
int nibn(int a[], int s, int e, int k) {
if (s > e)
return 0;
if (a[(s + e) / 2] == k) {
return 1;
} else if (a[(s + e) / 2] < k) {
return 1 + nibn(a, (s + e) / 2 + 1, e, k);
} else if (a[(s + e) / 2] > k) {
return... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13]] | 1 | 230 | 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 ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
ret... | #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 ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
ret... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16,... | 1 | 294 | 7 |
#include <stdio.h>
int main() {
int n, i, a[100], l, m, r, x, c;
while (scanf("%d", &n), n) {
for (i = 0; i < n; ++i)
scanf("%d", &a[i]);
scanf("%d", &x);
for (c = l = 0, r = n; l < r;) {
++c;
m = (l + r) / 2;
if (a[m] == x)
break;
else if (a[m] < x)
l = m +... | #include <stdio.h>
int main() {
int n, i, a[100], l, m, r, x, c;
while (scanf("%d", &n), n) {
for (i = 0; i < n; ++i)
scanf("%d", &a[i]);
scanf("%d", &x);
for (c = l = 0, r = n - 1; l <= r;) {
++c;
m = (l + r) / 2;
if (a[m] == x)
break;
else if (a[m] < x)
l ... | [["+", 0, 7, 10, 34, 12, 11, 12, 16, 17, 33], ["+", 0, 7, 10, 34, 12, 11, 12, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 75, 76, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 75, 76, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 157 | 6 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i;
int m;
int left, right, count;
vector<int> v;
while (cin >> n, n) {
v.clear();
v.resize(n);
for (i = 0; i < n; i++)
cin >> v[i];
cin >> m;
count = 1;
left = 0;
right = n - 1;
while (left ... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i;
int m;
int left, right, count;
vector<int> v;
while (cin >> n, n) {
v.clear();
v.resize(n);
for (i = 0; i < n; i++)
cin >> v[i];
cin >> m;
count = 0;
left = 0;
right = n - 1;
while (left ... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["-", 75, 76, 0, 9, 0, 1, 0, 27, 28, 22], ["-", 75, 76, 0, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 94]] | 1 | 199 | 7 |
#include <cmath>
#include <cstdio>
int n, x;
int a[100];
int main() {
while (scanf("%d", &n)) {
if (!n)
break;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d", &x);
int lb = 0, ub = n - 1, res = 0;
while (ub - lb >= 1) {
res++;
int mid = floor((lb + ub) / 2);
... | #include <cmath>
#include <cstdio>
int n, x;
int a[100];
int main() {
while (scanf("%d", &n)) {
if (!n)
break;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d", &x);
int lb = 0, ub = n - 1, res = 0;
while (ub >= lb) {
res++;
int mid = floor((lb + ub) / 2);
i... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 33], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 173 | 6 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 98], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 360 | 2 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 17, 33], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13]] | 1 | 273 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 248 | 2 |
import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
for (int a[][] = new int[10][10], m, n, i, j, u, v,
r = Integer.MAX_VALUE / 2;
(m = s.nextInt()) > 0; System.out.println(u + " " + m)) {
for (int[] b : a)
Arrays.fill(... | import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
for (int a[][] = new int[10][10], m, n, i, j, u, v,
r = Integer.MAX_VALUE / 2;
(m = s.nextInt()) > 0; System.out.println(u + " " + m)) {
for (int[] b : a)
Arrays.fill(... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 20]] | 3 | 323 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
void run() {
for (;;) {
int n = sc.nextInt();
if (n == 0) {
break;
}
int[][] wf = new int[11][11];
boolean[] used = new boolean[11];
for (int i = 0; i < wf... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
void run() {
for (;;) {
int n = sc.nextInt();
if (n == 0) {
break;
}
int[][] wf = new int[11][11];
boolean[] used = new boolean[11];
for (int i = 0; i < wf.... | [["-", 0, 57, 64, 196, 0, 1, 0, 11, 12, 499], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22]] | 3 | 433 | 2 |
import static java.lang.Math.*;
import static java.lang.System.out;
import java.util.*;
import java.util.regex.*;
// AOJ
public class Main {
final Scanner sc = new Scanner(System.in);
final int[] vx = {0, 1, 0, -1}, vy = {-1, 0, 1, 0};
static class Point {
int x, y;
Point(int x, int y) {
this.x = ... | import static java.lang.Math.*;
import static java.lang.System.out;
import java.util.*;
import java.util.regex.*;
// AOJ
public class Main {
final Scanner sc = new Scanner(System.in);
final int[] vx = {0, 1, 0, -1}, vy = {-1, 0, 1, 0};
static class Point {
int x, y;
Point(int x, int y) {
this.x = ... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22]] | 3 | 7,716 | 2 |
#include <stdio.h>
#include <string.h>
int map[10][10];
int min(int a, int b) { return a < b ? a : b; }
int cmp(int i, int j, int k) {
if (map[i][j] == -1) {
if (map[i][k] >= 0 && map[k][j] >= 0)
return map[i][k] + map[k][j];
else
return -1;
} else if (map[i][k] == -1 || map[k][j] == -1)
... | #include <stdio.h>
#include <string.h>
int map[10][10];
int min(int a, int b) { return a < b ? a : b; }
int cmp(int i, int j, int k) {
if (map[i][j] == -1) {
if (map[i][k] >= 0 && map[k][j] >= 0)
return map[i][k] + map[k][j];
else
return -1;
} else if (map[i][k] == -1 || map[k][j] == -1)
... | [["-", 0, 1, 0, 11, 12, 41, 15, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 41, 15, 16, 31, 22]] | 0 | 451 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
const int INF = 1 << 30;
const int MAX_V = 10;
const int MAX_E = 45;
int d[MAX_V][MAX_V];
int n;
int V;
void show_d() {
cout << "===" << endl;
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
printf("%3d ", d[i][j]);
}
cout <... | #include <cstdio>
#include <iostream>
using namespace std;
const int INF = 1 << 20;
const int MAX_V = 10;
const int MAX_E = 45;
int d[MAX_V][MAX_V];
int n;
int V;
void show_d() {
cout << "===" << endl;
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
printf("%3d ", d[i][j]);
}
cout <... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 447 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define INF 100000
using namespace std;
int main() {
// int town[11][11];
int to, from, cost;
int n;
while (1) {
cin >> n;
if (!n)
break;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define INF 100000
using namespace std;
int main() {
// int town[11][11];
int to, from, cost;
int n;
while (1) {
cin >> n;
if (!n)
break;
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 436 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#define INF 1e+9;
int E, V;
int cost[50][50];
int d[100];
int main() {
while (cin >> E, E) {
V = 0;
fill(d, d + 100, 0);
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 50; j++) {
cost[i][j] = (i == j) ? 0 : INF
}
... | #include <algorithm>
#include <iostream>
using namespace std;
#define INF 1e+9;
int E, V;
int cost[50][50];
int d[100];
int main() {
while (cin >> E, E) {
V = 0;
fill(d, d + 100, 0);
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 50; j++) {
cost[i][j] = (i == j) ? 0 : INF
}
... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 362 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n) {
string s;
for (int i = 0; i < n; i++)
s += '#';
while (m--) {
string p;
cin >> p;
if (p == "A") {
for (int i = 0; i < n; i++)
if (s[i] == '#') {
s[i] = 'A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n) {
string s;
for (int i = 0; i < n; i++)
s += '#';
while (m--) {
string p;
cin >> p;
if (p == "A") {
for (int i = 0; i < n; i++)
if (s[i] == '#') {
s[i] = 'A... | [["+", 64, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 744 | 1 |
#line 0 "cmacro.cpp"
#include <bits/stdc++.h>
using namespace std;
#define in ,
#define esc_paren(...) __VA_ARGS__
#define pp_empty(...)
#define pp_cat_i(x, y) x##y
#define pp_cat(x, y) pp_cat_i(x, y)
#define pp_inc0 1
#define pp_inc1 2
#define pp_inc2 3
#define pp_inc3 4
#define pp_inc4 5
#define pp_inc5 6
#define ... | #line 0 "cmacro.cpp"
#include <bits/stdc++.h>
using namespace std;
#define in ,
#define esc_paren(...) __VA_ARGS__
#define pp_empty(...)
#define pp_cat_i(x, y) x##y
#define pp_cat(x, y) pp_cat_i(x, y)
#define pp_inc0 1
#define pp_inc1 2
#define pp_inc2 3
#define pp_inc3 4
#define pp_inc4 5
#define pp_inc5 6
#define ... | [["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 2,044 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0)
break;
char ch[n];
for (int i = 0; i < n; i++) {
ch[i] = '#';
}
for (int k = 0; k < m; k++) {
char c;
cin >> c;
if (c == 'A') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0)
break;
char ch[n];
for (int i = 0; i < n; i++) {
ch[i] = '#';
}
for (int k = 0; k < m; k++) {
char c;
cin >> c;
if (c == 'A') {
... | [["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 94], ["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 35]] | 1 | 804 | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
int N, M;
char seat[105];
int left_insert() {
int k = 1;
while (k <= N && seat[k] != '#') {
k++;
}
return (k);
}
int main() {
while (cin >> N >> M, N || M) {
fill_n(seat, 105, '#');
for (int i = 0; i < M; i++) {
... | #include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
int N, M;
char seat[105];
int left_insert() {
int k = 1;
while (k <= N && seat[k] != '#') {
k++;
}
return (k);
}
int main() {
while (cin >> N >> M, N || M) {
fill_n(seat, 105, '#');
for (int i = 0; i < M; i++) {
... | [["+", 0, 52, 15, 339, 51, 16, 12, 23, 0, 24], ["-", 0, 100, 0, 52, 15, 339, 51, 16, 17, 98], ["-", 0, 52, 15, 339, 51, 16, 12, 23, 0, 24], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 106]] | 1 | 558 | 4 |
#include <iostream>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
int findlm(int n, char *in) { rep(i, n) if (in[i] == 0) return i; }
int findNotA(int n, char *in) {
for (int i = n - 1; i >= 0; i--) {
if (in[i] == 0 && (i == 0 || in[i - 1] != 'A') &&
... | #include <iostream>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
int findlm(int n, char *in) { rep(i, n) if (in[i] == 0) return i; }
int findNotA(int n, char *in) {
for (int i = n - 1; i >= 0; i--) {
if (in[i] == 0 && (i == 0 || in[i - 1] != 'A') &&
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 639 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, k;
int a[102], m, n;
string s;
for (;;) {
cin >> m >> n;
if (m + n == 0)
break;
mems... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, k;
int a[102], m, n;
string s;
for (;;) {
cin >> m >> n;
if (m + n == 0)
break;
mems... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 7, 26, 27, 28, 22]] | 1 | 708 | 4 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 620 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
bool en = false;
while (cin >> n >> m && !(n == 0 && m == 0)) {
char chair[101];
char ch;
fill(chair, chair + 101, '#');
for (int i = 0; i < m; i++) {
cin >> ch;
if (ch == 'A') {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
bool en = false;
while (cin >> n >> m && !(n == 0 && m == 0)) {
char chair[101];
char ch;
fill(chair, chair + 101, '#');
for (int i = 0; i < m; i++) {
cin >> ch;
if (ch == 'A') {
... | [["-", 0, 57, 64, 9, 0, 1, 0, 16, 17, 60], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32]] | 1 | 704 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
for (;;) {
cin >> n >> m;
if (!n && !m)
break;
string c;
for (int i = 0; i < n; i++)
c += '#';
for (int i = 0; i < m; i++) {
char g;
cin >> g;
int pos;
if (g == 'A') {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
for (;;) {
cin >> n >> m;
if (!n && !m)
break;
string c;
for (int i = 0; i < n; i++)
c += '#';
for (int i = 0; i < m; i++) {
char g;
cin >> g;
int pos;
if (g == 'A') {
... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 60]] | 1 | 528 | 4 |
#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 <string>
#include <utility>
#include <vector>
using nam... |
#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 <string>
#include <utility>
#include <vector>
using na... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 873 | 6 |
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
void sit_seat(char c, vector<char> &seat) {
if (c == 'A') {
for (int i = 0; i < seat.size(); i++) {
if (seat[i] == 0) {
seat[i] = c;
break;
}
}
} else if (c == 'B') {
bool is_sit = false;
for ... | #include <iostream>
#include <string.h>
#include <vector>
using namespace std;
void sit_seat(char c, vector<char> &seat) {
if (c == 'A') {
for (int i = 0; i < seat.size(); i++) {
if (seat[i] == 0) {
seat[i] = c;
break;
}
}
} else if (c == 'B') {
bool is_sit = false;
for ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 859 | 10 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int chair[100], pos, n, m;
int d(char c) {
if (c == 'A') {
for (int i = 0; i < n; i++) {
if (chair[i] == -1)
return i;
}
} else if (c == 'B') {
for (int i = n - 1; i >= 0; i--) {
if (chair[i] == -1) {... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int chair[100], pos, n, m;
int d(char c) {
if (c == 'A') {
for (int i = 0; i < n; i++) {
if (chair[i] == -1)
return i;
}
} else if (c == 'B') {
for (int i = n - 1; i >= 0; i--) {
if (chair[i] == -1) {... | [["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 638 | 2 |
// 08
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
for (int n, m; cin >> n >> m, n | m;) {
string c(n, '#');
for (int i = 0; i < m; i++) {
char p;
cin >> p;
switch (p) {
case 'B':
int j;
for (j = c.size() - 1; j >= 0; j-... | // 08
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
for (int n, m; cin >> n >> m, n | m;) {
string c(n, '#');
for (int i = 0; i < m; i++) {
char p;
cin >> p;
switch (p) {
case 'B':
int j;
for (j = c.size() - 1; j >= 0; j-... | [["-", 64, 9, 0, 7, 15, 16, 12, 16, 17, 79], ["+", 64, 9, 0, 7, 15, 16, 12, 16, 17, 60]] | 1 | 537 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define INF (1 << 29)
int main() {
char chair[105];
int n, m;
char c;
while (cin >> n >> m, n) {
fill(chair, chair + n, '#');
chair[n] = 0;
for (int i = 0; i < m; i++) {
cin >> c;
switch (c) {
case 'A':... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define INF (1 << 29)
int main() {
char chair[105];
int n, m;
char c;
while (cin >> n >> m, n) {
fill(chair, chair + n, '#');
chair[n] = 0;
for (int i = 0; i < m; i++) {
cin >> c;
switch (c) {
case 'A':... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 514 | 4 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int N_MAX = 100;
void sitA(char *seat, int n) {
int i = 0;
while (seat[i] != '#') {
++i;
}
seat[i] = 'A';
}
void sitB(char *seat, int n) {
int i = n - 1;
while (i > 0) {
if (seat[i] == '#') {
if (seat[i - 1] ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int N_MAX = 100;
void sitA(char *seat, int n) {
int i = 0;
while (seat[i] != '#') {
++i;
}
seat[i] = 'A';
}
void sitB(char *seat, int n) {
int i = n - 1;
while (i > 0) {
if (seat[i] == '#') {
if (seat[i - 1] ... | [["-", 15, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["-", 15, 16, 12, 16, 31, 23, 0, 16, 12, 13]] | 1 | 734 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33]] | 1 | 703 | 2 |
#include <iostream>
using namespace std;
int n, m;
char t[100], ch;
void putA();
void putB();
void putC();
void putD();
int main() {
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++)
t[i] = '#';
for (int i = 0; i < m; i++) {
cin >> ch;
if (ch == 'A')
... | #include <iostream>
using namespace std;
int n, m;
char t[100], ch;
void putA();
void putB();
void putC();
void putD();
int main() {
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++)
t[i] = '#';
for (int i = 0; i < m; i++) {
cin >> ch;
if (ch == 'A')
... | [["-", 0, 1, 0, 11, 12, 23, 0, 41, 64, 13], ["+", 0, 1, 0, 11, 12, 23, 0, 41, 64, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 801 | 5 |
while(n,m=gets.split.map &:to_i)[0]>0
s=?#*n+?0
m.times{(c=gets[0])<?B?(i=s.index ?#):c<?C?(i=n-1
i-=1 while i>=0&&(s[i]!=?#||s[j=i+1]==?A||s[i-1]==?A)
i<0&&i=j-1):c<?D?(j=0
j+=1 while j<n&&(s[j]==?#||s[i=j+1]!=?#&&s[i=j-1]!=?#)
j>=n&&i=n/2):(w=z=1e20
t=[]
u=[]
(0..n-1).map{|k|s[k]!=?#&&w=0;t<<w+=1;s[n-1-k]!=?#&&z=0;u.... | while(n,m=gets.split.map &:to_i)[0]>0
s=?#*n+?0
m.times{(c=gets[0])<?B?(i=s.index ?#):c<?C?(i=n-1
i-=1 while i>=0&&(s[i]!=?#||s[j=i+1]==?A||s[i-1]==?A)
i<0&&i=j-1):c<?D?(j=0
j+=1 while j<n&&(s[j]==?#||s[i=j+1]!=?#&&s[i=j-1]!=?#)
j>=n&&i=n/2):(w=z=1e20
t=[]
u=[]
(0..n-1).map{|k|s[k]!=?#&&w=0;t<<w+=1;s[n-1-k]!=?#&&z=0;u.... | [["-", 0, 42, 0, 754, 75, 739, 0, 768, 0, 769], ["+", 0, 42, 0, 754, 75, 739, 0, 768, 0, 769]] | 4 | 233 | 18 |
import java.util.*;
public class Main {
int n, m, k, start, goal, r;
int[][] cost, time;
final int INF = Integer.MAX_VALUE;
int[] min;
int dijkstra(int[][] V) {
int[] min = new int[m + 1];
Arrays.fill(min, INF);
min[start] = 0;
Queue<int[]> que = new LinkedList<int[]>();
que.offer(new... | import java.util.*;
public class Main {
int n, m, k, start, goal, r;
int[][] cost, time;
final int INF = Integer.MAX_VALUE;
int[] min;
int dijkstra(int[][] V) {
int[] min = new int[m + 1];
Arrays.fill(min, INF);
min[start] = 0;
Queue<int[]> que = new LinkedList<int[]>();
que.offer(new... | [["+", 0, 57, 15, 15, 0, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 17, 79], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 12, 22], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 98]] | 3 | 595 | 4 |
/*
?????????????????? ????????\?????????????¬???¨???
??? ???
???????????´??????????´\????????????????????????????????§????????????????¨??????????????????????????????????
????????????????????§??????????????????????????????????????????????????§????????????????????????????????????
??????????????\????????????????????????... | /*
?????????????????? ????????\?????????????¬???¨???
??? ???
???????????´??????????´\????????????????????????????????§????????????????¨??????????????????????????????????
????????????????????§??????????????????????????????????????????????????§????????????????????????????????????
??????????????\????????????????????????... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 12, 22], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["-", 0, 2, 3, 4, 0, 69, 28, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 28, 69, 28, 22]] | 0 | 645 | 8 |
#include <stdio.h>
#define INF 100000000
int main(void) {
int n, m, a, b, cost, time, l, p, q, r;
int i, j, k;
int d[100][100];
int exp[100][100];
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
d[i][j] = I... | #include <stdio.h>
#define INF 100000000
int main(void) {
int n, m, a, b, cost, time, l, p, q, r;
int i, j, k;
int d[100][100];
int exp[100][100];
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < m; i++) {
for (j = 0; j < m; j++) {
d[i][j] = I... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 514 | 6 |
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
const int MAX_INT = 10000000;
int n, m;
int p, q, r;
int costMap[101][101];
int timeMap[101][101];
int visited[101];
class Node {
public:
int cost, pos;
Node(int p) {
cost = 0;
pos = p;
}
Node(int p, int c, const Node &pre)... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
const int MAX_INT = 10000000;
int n, m;
int p, q, r;
int costMap[101][101];
int timeMap[101][101];
int visited[101];
class Node {
public:
int cost, pos;
Node(int p) {
cost = 0;
pos = p;
}
Node(int p, int c, const Node &pre)... | [["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 35]] | 1 | 686 | 2 |
#include <cmath>
#include <cstring>
#include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
using namespace std;
const int INF = 10000000;
int V;
int d[2][111][111];
void wf() {
FOR(k, 0, V + 1) FOR(i, 0, V + 1) FOR(j, 0, V + 1) {
d[0][i][j] = min(d[0][i][j], d[0][i][k] + d... | #include <cmath>
#include <cstring>
#include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
using namespace std;
const int INF = 10000000;
int V;
int d[2][111][111];
void wf() {
FOR(k, 0, V + 1) FOR(i, 0, V + 1) FOR(j, 0, V + 1) {
d[0][i][j] = min(d[0][i][j], d[0][i][k] + d... | [["-", 0, 9, 0, 1, 0, 11, 12, 11, 12, 22], ["+", 0, 9, 0, 1, 0, 11, 12, 11, 12, 22]] | 1 | 389 | 4 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordere... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordere... | [["-", 12, 23, 0, 41, 64, 69, 28, 69, 28, 22], ["+", 12, 23, 0, 41, 64, 69, 28, 69, 28, 22], ["-", 12, 23, 0, 41, 75, 69, 28, 69, 28, 22], ["+", 12, 23, 0, 41, 75, 69, 28, 69, 28, 22]] | 1 | 418 | 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 rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rev(i, n) for (int(i) = (n)-1; (i) >= 0... | #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 rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rev(i, n) for (int(i) = (n)-1; (i) >= 0... | [["-", 31, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 31, 69, 28, 69, 28, 69, 341, 342, 0, 13]] | 1 | 488 | 2 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
const int MAX_V = 1000;
const int INF = 100000;
int v;
int g[MAX_V][MAX_V];
int g2[MAX_V][MAX_V];
int d[MAX_V];
bool used[MAX_V];
void dijkstra(int s) {
fill(d, d + v, I... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
const int MAX_V = 1000;
const int INF = 100000;
int v;
int g[MAX_V][MAX_V];
int g2[MAX_V][MAX_V];
int d[MAX_V];
bool used[MAX_V];
void dijkstra(int s) {
fill(d, d + v, I... | [["-", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 31, 22]] | 1 | 623 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define _m_ 1
const int INF = 1e9;
int cost[101][101];
int tim[101][101];
int d[101];
bool used[101];
int V;
void dijkstra(int s, int o) {
std::fill(d, d + V, INF);
std::fill(used, used + V, false);
d[s] = 0;
while (_m_) {
int v ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define _m_ 1
const int INF = 1e9;
int cost[101][101];
int tim[101][101];
int d[101];
bool used[101];
int V;
void dijkstra(int s, int o) {
std::fill(d, d + V, INF);
std::fill(used, used + V, false);
d[s] = 0;
while (_m_) {
int v ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 519 | 4 |
#include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define INF 1e9
using namespace std;
typedef long long ll;
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
int main() {
int n, m, a, b, cost, time, l, p, q, r;
while (cin >> n >> m, n || m)... | #include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define INF 1e9
using namespace std;
typedef long long ll;
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
int main() {
int n, m, a, b, cost, time, l, p, q, r;
while (cin >> n >> m, n || m)... | [["-", 0, 11, 12, 11, 31, 69, 28, 69, 28, 22], ["+", 0, 11, 12, 11, 31, 69, 28, 69, 28, 22]] | 1 | 371 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1 << 10
int main() {
int cost[101][101];
int times[101][101];
int n, m;
int a, b, c, t;
while (cin >> n >> m, n | m) {
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 101; j++) {
cost[i][j] = times[i][j] = INF;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 25
int main() {
int cost[101][101];
int times[101][101];
int n, m;
int a, b, c, t;
while (cin >> n >> m, n | m) {
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 101; j++) {
cost[i][j] = times[i][j] = INF;
}
}
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 1, 0, 11, 12, 11, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 22]] | 1 | 354 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, l, n) for (lint i = l; i < n; i++)
#define rer(i, l, n) for (lint i = l;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, l, n) for (lint i = l; i < n; i++)
#define rer(i, l, n) for (lint i = l;... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 503 | 4 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 21
using namespace std;
main() {
int m, n;
while (cin >> m >> n, n) {
int a1[n][n], a2[n][n], q, w, e, r;
r(i, n) r(j, n) {
if (i == j)
a2[i][j] = a1[i][j] = 0;
else
a2[n][n] = a1[i][j] = INF;
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
using namespace std;
main() {
int m, n;
while (cin >> m >> n, n) {
int a1[n][n], a2[n][n], q, w, e, r;
r(i, n) r(j, n) {
if (i == j)
a2[i][j] = a1[i][j] = 0;
else
a2[i][j] = a1[i][j] = INF;
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 327 | 6 |
#include <iostream>
#define INF 1000000;
using namespace std;
int main() {
int n, m;
while (1) {
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
int s_tim[m][m];
int c_money[m][m];
int a, b, cost, tim;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
s_t... | #include <iostream>
#define INF 100000;
using namespace std;
int main() {
int n, m;
while (1) {
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
int s_tim[m][m];
int c_money[m][m];
int a, b, cost, tim;
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
s_ti... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 473 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
using namespace std;
int n, m;
long long gc[110][110];
long long gt[110][110];
void warshallfloyd() {
for (int k = 0; k < m; k++) {
for (int i = 0; i < m; i++... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
using namespace std;
int n, m;
long long gc[110][110];
long long gt[110][110];
void warshallfloyd() {
for (int k = 0; k < m; k++) {
for (int i = 0; i < m; i++... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 405 | 4 |
//青春の片道切符：：ワーシャルフロイド法
/*for(int k=0;k<N;k++){//経由箇所(N<200)
for(int i=0;i<N;i++){//スタート(N<200)
for(int j=0;j<N;j++){//目的(N<200)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}*/
#include <algorithm>
#include <cctype>
#include <iostream>
#include <queu... | //青春の片道切符：：ワーシャルフロイド法
/*for(int k=0;k<N;k++){//経由箇所(N<200)
for(int i=0;i<N;i++){//スタート(N<200)
for(int j=0;j<N;j++){//目的(N<200)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}*/
#include <algorithm>
#include <cctype>
#include <iostream>
#include <queu... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 403 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.