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 <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_se... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_se... | [["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 5,107 | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e16;
vector<vector<long long int>> get_dis(vector<map<int, long long int>> &edge) {
vector<vector<long long int>> d(edge.size(),
vector<long long int>(edge.size(), INF));
for (int i = 0; i < edge.size(); i++... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e16;
vector<vector<long long int>> get_dis(vector<map<int, long long int>> &edge) {
vector<vector<long long int>> d(edge.size(),
vector<long long int>(edge.size(), INF));
for (int i = 0; i < edge.size(); i++... | [["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["-", 0, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 16, 12, 69, 28, 69, 341, 342, 0, 22]] | 1 | 818 | 4 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF (1e9)
#define M 1005
#define N 205
using namespace std;
typedef long long ll;
ll n, m, r, z[M], sld[2][N][N];
void init() { rep(i, 2) rep(j, n) rep(k, n) sld[i][j][k] = INF; }
void add_edge(ll sl, ll x, ll y, ll t) {
sld[sl][... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF (1e9)
#define M 1005
#define N 205
using namespace std;
typedef long long ll;
ll n, m, r, z[M], sld[2][N][N];
void init() { rep(i, 2) rep(j, n) rep(k, n) sld[i][j][k] = INF; }
void add_edge(ll sl, ll x, ll y, ll t) {
sld[sl][... | [["+", 0, 11, 31, 69, 341, 342, 0, 69, 28, 22], ["+", 31, 69, 341, 342, 0, 69, 341, 342, 0, 70], ["+", 31, 69, 341, 342, 0, 69, 341, 342, 0, 73]] | 1 | 632 | 3 |
#include <algorithm>
#include <iostream>
using namespace std;
const int INF = 100000000;
int N, M, R;
int ds[200][200], dl[200][200]; // ship walk
int list[1000];
int dp[1000][200];
int main() {
while (cin >> N >> M, N + M) {
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
if (i == j)
... | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 100000000;
int N, M, R;
int ds[200][200], dl[200][200]; // ship walk
int list[1000];
int dp[1000][200];
int main() {
while (cin >> N >> M, N + M) {
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
if (i == j)
... | [["+", 31, 69, 28, 69, 341, 342, 0, 69, 28, 22], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 70], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 73]] | 1 | 713 | 3 |
//{??????(???)?????????(???)?????????(???)??????,
//??????(???)??????}??¨???????§?????????°?????????????????£?????????.
//??????????§??????????????????¶????????????????????????(????????????????????°,
//????????´???)???????????§???????????§DP?????§????????????
//?§?????????????????????¶???????????????O(N)???????????????... | //{??????(???)?????????(???)?????????(???)??????,
//??????(???)??????}??¨???????§?????????°?????????????????£?????????.
//??????????§??????????????????¶????????????????????????(????????????????????°,
//????????´???)???????????§???????????§DP?????§????????????
//?§?????????????????????¶???????????????O(N)???????????????... | [["+", 0, 11, 31, 69, 341, 342, 0, 69, 28, 22], ["+", 31, 69, 341, 342, 0, 69, 341, 342, 0, 70], ["+", 31, 69, 341, 342, 0, 69, 341, 342, 0, 73]] | 1 | 686 | 3 |
#include <bits/stdc++.h>
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
int v1[203][203], v2[203][203], a1, a2, a3, n, m;
int dp[2][203][203], t, x, pre;
char c;
int main() {
while (cin >> n >> m, n) {
int ans = 1e8;
r(i, 2) r(j, 203) r(k, 203) dp[i][j][k] = 1e8;
r(i, 203) r(j, 203) v1[i... | #include <bits/stdc++.h>
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
int v1[203][203], v2[203][203], a1, a2, a3, n, m;
int dp[2][203][203], t, x, pre;
char c;
int main() {
while (cin >> n >> m, n) {
int ans = 1e8;
r(i, 2) r(j, 203) r(k, 203) dp[i][j][k] = 1e8;
r(i, 203) r(j, 203) v1[i... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 597 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define ... | [["-", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22]] | 1 | 823 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int n, m;
int dl[200][200], ds[200][200], dp[1001][200];
const int inf = 500000000;
int main() {
while (cin >> n >> m, n) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dl[i]... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int n, m;
int dl[200][200], ds[200][200], dp[1001][200];
const int inf = 500000000;
int main() {
while (cin >> n >> m, n) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dl[i]... | [["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 667 | 3 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 635 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static double EPS = 1e-5;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int N = sc.nextInt();
if (N == 0) {
break;
}
double[] x = new double[2 * N];
d... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static double EPS = 1e-5;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int N = sc.nextInt();
if (N == 0) {
break;
}
double[] x = new double[2 * N];
d... | [["+", 0, 7, 8, 196, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 11, 17, 108], ["+", 8, 196, 0, 1, 0, 11, 12, 91, 17, 33], ["+", 8, 196, 0, 1, 0, 11, 12, 91, 439, 499], ["+", 8, 196, 0, 7, 8, 196, 0, 1, 0, 35]] | 3 | 679 | 5 |
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#include <vector>
using namespace ... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#include <vector>
using namespace ... | [["-", 0, 1, 0, 11, 12, 16, 31, 118, 28, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 118, 28, 22]] | 1 | 1,557 | 4 |
/*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define rp(a) while (a--)
#define pb push_back... | /*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define rp(a) while (a--)
#define pb push_back... | [["+", 0, 16, 12, 2, 3, 4, 0, 91, 17, 33], ["-", 0, 16, 12, 2, 3, 4, 0, 91, 17, 33], ["+", 0, 52, 8, 9, 0, 9, 0, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 9, 0, 9, 0, 46]] | 1 | 3,486 | 4 |
#include <bits/stdc++.h>
#define N 55
using namespace std;
typedef complex<double> P;
typedef pair<P, P> L;
const double EPS = 1e-8;
double cross(P a, P b) { return imag(conj(a) * b); }
struct Circle {
P c; //?????????
double r; //??????
Circle(P c = P(0, 0), double r = 0) : c(c), r(r) {}
};
P rotate(P p,... | #include <bits/stdc++.h>
#define N 55
using namespace std;
typedef complex<double> P;
typedef pair<P, P> L;
const double EPS = 1e-8;
double cross(P a, P b) { return imag(conj(a) * b); }
struct Circle {
P c; //?????????
double r; //??????
Circle(P c = P(0, 0), double r = 0) : c(c), r(r) {}
};
P rotate(P p,... | [["-", 51, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 51, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 33], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 72], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 22]] | 1 | 1,009 | 6 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <vector>
using namespace std;
#define EPS 1e-7
typedef complex<double> point;
typedef const point &rpoint;
double cross(rpoint va, rpoint vb) {
return real(va) * imag(vb) - imag(va) * real(vb);
}
double distance_l_p(rpoint a, rpoi... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <vector>
using namespace std;
#define EPS 1e-7
typedef complex<double> point;
typedef const point &rpoint;
double cross(rpoint va, rpoint vb) {
return real(va) * imag(vb) - imag(va) * real(vb);
}
double distance_l_p(rpoint a, rpoi... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 744 | 2 |
#include <bits/stdc++.h>
#define dump(a) cout << #a << "=" << a << endl
using namespace std;
char left_key[15] = {'q', 'w', 'e', 'r', 't', 'a', 's', 'd',
'f', 'g', 'z', 'x', 'c', 'v', 'b'};
char right_key[11] = {'y', 'u', 'i', 'o', 'p', 'h', 'j', 'k', 'l', 'n', 'm'};
bool is_word(string word) { r... | #include <bits/stdc++.h>
#define dump(a) cout << #a << "=" << a << endl
using namespace std;
char left_key[15] = {'q', 'w', 'e', 'r', 't', 'a', 's', 'd',
'f', 'g', 'z', 'x', 'c', 'v', 'b'};
char right_key[11] = {'y', 'u', 'i', 'o', 'p', 'h', 'j', 'k', 'l', 'n', 'm'};
bool is_word(string word) { r... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 308 | 4 |
#include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
while (1) {
getline(cin, s);
if (s[0] == '#') {
break;
} else {
int state = -1, ans = 0;
string left = "qwertasdfgzxcvb";
string right = "yuiophjklnm";
REP(i, s.... | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
while (1) {
getline(cin, s);
if (s[0] == '#') {
break;
} else {
int state = -1, ans = 0;
string left = "qwertasdfgzxcvb";
string right = "yuiophjklnm";
REP(i, s.... | [["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 143 | 2 |
#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>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | #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>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | [["+", 8, 9, 0, 43, 49, 50, 51, 69, 28, 22], ["+", 0, 43, 49, 50, 51, 69, 341, 342, 0, 70], ["+", 51, 69, 341, 342, 0, 69, 341, 342, 0, 73]] | 1 | 304 | 3 |
#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
#define Getsign(n) ((n > 0) - (n < 0))
#define QWERTYR(c) ('y' || 'u' || (c >= 'h' && c <= 'p')... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
#define Getsign(n) ((n > 0) - (n < 0))
#define QWERTYR(c) ... | [["-", 36, 36, 36, 36, 0, 30, 0, 112, 51, 59], ["+", 36, 36, 36, 36, 36, 36, 0, 30, 0, 112], ["+", 36, 36, 36, 36, 0, 30, 0, 112, 141, 22], ["+", 36, 36, 0, 30, 0, 112, 141, 22, 54, 158], ["+", 0, 30, 0, 112, 141, 22, 54, 158, 0, 22], ["+", 0, 112, 141, 22, 54, 158, 0, 22, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 112, ... | 1 | 169 | 3 |
#include <iostream>
#include <string>
using std::cin;
using std::cout;
using std::endl;
int Lefthand(std::string c) {
if (c == "#") {
return -1;
} else if (c == "y" || c == "u" || c == "i" || c == "o" || c == "p" ||
c == "h" || c == "j" || c == "k" || c == "l" || c == "n" ||
c == "m"... | #include <iostream>
#include <string>
using std::cin;
using std::cout;
using std::endl;
int Lefthand(std::string c) {
if (c == "#") {
return -1;
} else if (c == "y" || c == "u" || c == "i" || c == "o" || c == "p" ||
c == "h" || c == "j" || c == "k" || c == "l" || c == "n" ||
c == "m"... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 333 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string a;
string b = "YUIOPHJKLNM";
while (cin >> a && a != "#") {
int c, sum = 0;
bool l = false;
for (int i = 0; i < a.length(); i++) {
l = false;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string a;
string b = "yuiophjklnm";
while (cin >> a && a != "#") {
int c, sum = 0;
bool l = false;
for (int i = 0; i < a.length(); i++) {
l = false;
... | [["-", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6]] | 1 | 173 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, (n))
#define MAX_line 35
int stat[MAX_line];
char N[MAX_line];
bool input() {
REP(i, MAX_line) stat[i] = 0;
REP(i, MAX_line) N[i] = ' ';
cin >> N;
return (N[0] != '#... | #include <algorithm>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, (n))
#define MAX_line 40
int stat[MAX_line];
char N[MAX_line];
bool input() {
REP(i, MAX_line) stat[i] = 0;
REP(i, MAX_line) N[i] = ' ';
cin >> N;
return (N[0] != '#... | [["-", 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, 99, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 263 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define lpin(a, i, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; ... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define lpin(a, i, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; ... | [["-", 75, 76, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 295 | 2 |
// AOJ 2241: Usaneko Matrix
// 2017.12.9
#include <stdio.h>
#include <string.h>
#define N1 9 // 512
#define N2 511
int us[1000002], rus[502], cus[502], dus[2];
int ne[1000002], rne[502], cne[502], dne[2];
char buf[4005], *p;
int getint() {
int n = 0;
while (*p >= '0')
n = (n << 3) + (n << 1) + (*p++ & 0xf);
... | // AOJ 2241: Usaneko Matrix
// 2017.12.9
#include <stdio.h>
#include <string.h>
#define N1 9 // 512
#define N2 511
int us[1000002], rus[502], cus[502], dus[2];
int ne[1000002], rne[502], cne[502], dne[2];
char buf[4005], *p;
int getint() {
int n = 0;
while (*p >= '0')
n = (n << 3) + (n << 1) + (*p++ & 0xf);
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 599 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | [["+", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 33], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 33]] | 1 | 777 | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, u, v, m, x;
map<int, int> Ai, Aj, Bi, Bj, Af, Bf;
int sumA, sumB;
int Ay[1000], Ax[1000], Ac, Ad;
int By[1000], Bx[1000], Bc, Bd;
void init() {
sumA = 0;
Ac = 0;
Ad = 0;
sumB = 0;
Bc = 0;
Bd = 0;
Ai.clear();
Aj.clear();
Af.clear();
Bi.clear();
... | #include <bits/stdc++.h>
using namespace std;
int n, u, v, m, x;
map<int, int> Ai, Aj, Bi, Bj, Af, Bf;
int sumA, sumB;
int Ay[1000], Ax[1000], Ac, Ad;
int By[1000], Bx[1000], Bc, Bd;
void init() {
sumA = 0;
Ac = 0;
Ad = 0;
sumB = 0;
Bc = 0;
Bd = 0;
Ai.clear();
Aj.clear();
Af.clear();
Bi.clear();
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 672 | 2 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | [["-", 8, 9, 0, 37, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 37, 0, 16, 31, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 12, 22]] | 1 | 733 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
P usagi[1000001], neko[1000001];
int urow[505], ucol[505], udia[2], uwin;
int nrow[505], ncol[505], ndia[2], nwin;
int n, u, v, m;
int main() {
fill(usagi, usagi + 1000001, P(-1, -1));
fill(neko, neko + 1000001, P(-1, -1));
cin >> n >> u ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
P usagi[1000001], neko[1000001];
int urow[505], ucol[505], udia[2], uwin;
int nrow[505], ncol[505], ndia[2], nwin;
int n, u, v, m;
int main() {
fill(usagi, usagi + 1000001, P(-1, -1));
fill(neko, neko + 1000001, P(-1, -1));
cin >> n >> u ... | [["-", 12, 23, 0, 16, 31, 69, 341, 342, 0, 13], ["+", 12, 23, 0, 16, 31, 69, 341, 342, 0, 13]] | 1 | 560 | 4 |
//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR... | //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR... | [["-", 15, 339, 51, 16, 12, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 12, 13], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 979 | 6 |
#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, u, v, m;
cin >> n >> u >> v >> m;
bool draw = true;
int val;
vector<pair<int, int>> usagi(1000001), neko(1000001);
vector<int> usanum, nekonum;
for (int i = 0; i < n; i++) {
for (int ... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, u, v, m;
cin >> n >> u >> v >> m;
bool draw = true;
int val;
vector<pair<int, int>> usagi(1000001), neko(1000001);
vector<int> usanum, nekonum;
for (int i = 0; i < n; i++) {
for (int ... | [["-", 31, 91, 28, 69, 341, 342, 0, 16, 12, 22], ["+", 31, 91, 28, 69, 341, 342, 0, 16, 12, 22], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 12, 22], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 12, 22], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 22]] | 1 | 840 | 12 |
n, u, v, m = gets.split.map &:to_i
number_pos = {}
marked = {}
%w(usagi neko).each do |name|
number_pos[name] = {}
(0..n-1).each do |i|
gets.split.map(&:to_i).each.with_index do |k, j|
(number_pos[name][k] ||= []) << [i, j]
end
end
marked[name] = {
:h => [0] * n,
:v => [0] * n,
:up => 0,
:down => 0... | n, u, v, m = gets.split.map &:to_i
number_pos = {}
marked = {}
%w(usagi neko).each do |name|
number_pos[name] = {}
(0..n-1).each do |i|
gets.split.map(&:to_i).each.with_index do |k, j|
(number_pos[name][k] ||= []) << [i, j]
end
end
marked[name] = {
:h => [0] * n,
:v => [0] * n,
:up => 0,
:down => 0... | [["+", 8, 736, 0, 121, 15, 738, 12, 738, 17, 33], ["+", 8, 736, 0, 121, 15, 738, 12, 738, 12, 612]] | 4 | 416 | 2 |
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 q = sc.nextInt();
if (n == 0 && q == 0)
break;
int[] begin = new int[n];
int[] end = new int[n];
String[] ... | 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 q = sc.nextInt();
if (n == 0 && q == 0)
break;
int[] begin = new int[n];
int[] end = new int[n];
String[] ... | [["-", 64, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 64, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 279 | 2 |
#include <stdio.h>
char era_name[1000][20];
int era_year[1000];
int western[1000];
int year;
int i, j;
int main(void) {
int N, Q;
while (1) {
scanf("%d%d", &N, &Q);
if (N == 0 && Q == 0) {
break;
}
for (i = 0; i < N; i++) {
scanf("%s%d%d", era_name[i], &era_year[i], &western[i]);
... | #include <stdio.h>
char era_name[1000][20];
int era_year[1000];
int western[1000];
int year;
int i, j;
int main(void) {
int N, Q;
while (1) {
scanf("%d%d", &N, &Q);
if (N == 0 && Q == 0) {
break;
}
for (i = 0; i < N; i++) {
scanf("%s%d%d", era_name[i], &era_year[i], &western[i]);
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 234 | 2 |
#include <stdio.h>
typedef struct {
char name[20];
int start, max;
} era_t;
int era_max, query_max;
era_t era[1000];
int main(void) {
int i, j;
int query;
int found;
while (1) {
scanf("%d%d", &era_max, &query_max);
if (era_max == 0 && query_max == 0)
break;
for (i = 0; i < era_max; i++)... | #include <stdio.h>
typedef struct {
char name[20];
int start, max;
} era_t;
int era_max, query_max;
era_t era[1000];
int main(void) {
int i, j;
int query;
int found;
while (1) {
scanf("%d%d", &era_max, &query_max);
if (era_max == 0 && query_max == 0)
break;
for (i = 0; i < era_max; i++)... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 263 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int N, Q;
struct Data {
int a, b;
string ss;
Data(){};
Data(int a, int b, string ss) : a(a), b(b), ss(ss){};
bool operator<(const Data &data_) const { return (data_.b) > (b); }
bool operator<(const int &val) con... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int N, Q;
struct Data {
int a, b;
string ss;
Data(){};
Data(int a, int b, string ss) : a(a), b(b), ss(ss){};
bool operator<(const Data &data_) const { return (data_.b) > (b); }
bool operator<(const int &val) con... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 305 | 4 |
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
for (int n, q; cin >> n >> q, n;) {
vector<pair<string, pair<int, int>>> era;
for (int i = 0; i < n; ++i) {
string a;
int b, c;
cin >> a >> b >> c;
era.push_back(make_pair(a,... | #include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
for (int n, q; cin >> n >> q, n;) {
vector<pair<string, pair<int, int>>> era;
for (int i = 0; i < n; ++i) {
string a;
int b, c;
cin >> a >> b >> c;
era.push_back(make_pair(a,... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 215 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 241 | 2 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
long long int n, q;
cin >> n >> q;
if (n == 0)
break;
vector<pair<string, pair<long long int, long long int>>> v;
for (long long int i = 0; i < n; i++) {
string s;
long ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
long long int n, q;
cin >> n >> q;
if (n == 0)
break;
vector<pair<string, pair<long long int, long long int>>> v;
for (long long int i = 0; i < n; i++) {
string s;
long ... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 147], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 257 | 6 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int mai... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int mai... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 226 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#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++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
while (cin >> n >> m) {
if (n == 0 &&... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#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++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
while (cin >> n >> m) {
if (n == 0 &&... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 252 | 2 |
#include <iostream>
#include <string>
using namespace std;
typedef struct {
string name;
long long start;
long long end;
} Era;
int main() {
Era E[10000];
int N, Q, s;
while (1) {
cin >> N >> Q;
if (N == 0 && Q == 0)
break;
for (int i = 0; i < N; i++) {
cin >> E[i].name >> s >> E[... | #include <iostream>
#include <string>
using namespace std;
typedef struct {
string name;
long long start;
long long end;
} Era;
int main() {
Era E[1000];
int N, Q, s;
while (1) {
cin >> N >> Q;
if (N == 0 && Q == 0)
break;
for (int i = 0; i < N; i++) {
cin >> E[i].name >> s >> E[i... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 225 | 4 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
int main() {
int N, Q;
while (cin >> N >> Q, N + Q) {
vector... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
int main() {
int N, Q;
while (cin >> N >> Q, N + Q) {
vector... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 259 | 8 |
#include <iostream>
#include <stack>
#include <map>
#include <string>
using namespace std;
int main() {
int N, Q;
string eraname;
int basedy, westy;
while (cin >> N >> Q && (N != 0 || Q != 0)) {
string nams[10010];
int begin[N], end[N];
for (int i = 0; i < N; i++) {
cin >> eraname >> basedy ... | #include <iostream>
#include <stack>
#include <map>
#include <string>
using namespace std;
int main() {
int N, Q;
string eraname;
int basedy, westy;
while (cin >> N >> Q && (N != 0 || Q != 0)) {
string nams[10010];
int begin[N], end[N];
for (int i = 0; i < N; i++) {
cin >> eraname >> basedy ... | [["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["+", 64, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 205 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, q, i;
int j, b[1010], e[1010], y;
string name[1010];
while (cin >> n >> q, n + q) {
for (i = 0; i < n; i++) {
cin >> name[i] >> j >> e[i];
b[i] = e[i] - j + 1;
}
for (i = 0; i < q; i++) {
cin >> y;
for (j = 0; j ... | #include <iostream>
using namespace std;
int main() {
int n, q, i;
int j, b[1010], e[1010], y;
string name[1010];
while (cin >> n >> q, n + q) {
for (i = 0; i < n; i++) {
cin >> name[i] >> j >> e[i];
b[i] = e[i] - j + 1;
}
for (i = 0; i < q; i++) {
cin >> y;
for (j = 0; j ... | [["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["-", 12, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 12, 16, 31, 16, 12, 69, 341, 342, 0, 22]] | 1 | 186 | 4 |
#include <iostream>
#include <string>
using namespace std;
string S[100000], U;
int n, a, b, c, d, p[100000][2];
int main() {
while (true) {
cin >> a >> b;
if (a == 0 && b == 0) {
break;
}
for (int i = 0; i < a; i++) {
n = 0;
cin >> U >> c >> d;
S[i] = U;
p[i][0] = d - c;... | #include <iostream>
#include <string>
using namespace std;
string S[100000], U;
int n, a, b, c, d, p[100000][2];
int main() {
while (true) {
cin >> a >> b;
if (a == 0 && b == 0) {
break;
}
for (int i = 0; i < a; i++) {
n = 0;
cin >> U >> c >> d;
S[i] = U;
p[i][0] = d - c ... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 225 | 4 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (... | [["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 352 | 4 |
#include <iostream>
using namespace std;
void hoge(int N, int Q) {
string a[N];
int b[N], c[N], d[2 * N];
for (int i = 0; i < N; i++) {
cin >> a[i] >> b[i] >> c[i];
d[2 * i] = c[i] - b[i] + 1;
d[2 * i + 1] = c[i];
}
for (int q = 0; q < Q; q++) {
int e;
cin >> e;
for (int i = 0; i +... | #include <iostream>
using namespace std;
void hoge(int N, int Q) {
string a[N];
int b[N], c[N], d[2 * N];
for (int i = 0; i < N; i++) {
cin >> a[i] >> b[i] >> c[i];
d[2 * i] = c[i] - b[i] + 1;
d[2 * i + 1] = c[i];
}
for (int q = 0; q < Q; q++) {
int e;
cin >> e;
for (int i = 0; i +... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48]] | 1 | 251 | 2 |
// AOJ 0029 English Sentence
// ??????0??????????£? 5???
// map????????£?????°???????????????????????§???????????????????????¬??????????????????????¢?????????????
#include <iostream>
#include <map>
#include <string>
using namespace std;
int N, Q;
string era[10010];
int eby[10010], wy[10010];
int solve() {
cin >> N >>... | // AOJ 0029 English Sentence
// ??????0??????????£? 5???
// map????????£?????°???????????????????????§???????????????????????¬??????????????????????¢?????????????
#include <iostream>
#include <map>
#include <string>
using namespace std;
int N, Q;
string era[10010];
int eby[10010], wy[10010];
int solve() {
cin >> N >>... | [["-", 31, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["+", 31, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["-", 51, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["-", 12, 23, 0, 16, 31, 69, 34... | 1 | 225 | 12 |
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int32_t main() {
while (true) {
uint32_t N, Q;
cin >> N >> Q;
if (N == 0 && Q == 0)
break;
vector<tuple<uint32_t, uint32_t, string>> years;
for (uint32_t _ = 0; _ < N; _++) {
string name;
... | #include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int32_t main() {
while (true) {
uint32_t N, Q;
cin >> N >> Q;
if (N == 0 && Q == 0)
break;
vector<tuple<uint32_t, uint32_t, string>> years;
for (uint32_t _ = 0; _ < N; _++) {
string name;
... | [["-", 0, 16, 31, 16, 12, 16, 31, 16, 31, 22], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 31, 22]] | 1 | 250 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define int long long
typedef pair<int, int> P;
//-----------------------------------------------------------------------
const int SZ = 1005;
int l[SZ], r[SZ];
string name[SZ];
signed... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define int long long
typedef pair<int, int> P;
//-----------------------------------------------------------------------
const int SZ = 1005;
int l[SZ], r[SZ];
string name[SZ];
signed... | [["-", 0, 52, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 52, 0, 89], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 8, 9, 0, 14, 49, 53, 54, 55, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 27, 17, 68], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 205 | 7 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j;
int a[1000], b[1000], m, n, p;
char s[1000][17];
while (cin >> n >> m && n && m) {
for (i = 0; i < n; i++)
cin >> s[i] >> a[i]... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j;
int a[1000], b[1000], m, n, p;
char s[1000][17];
while (cin >> n >> m && n && m) {
for (i = 0; i < n; i++)
cin >> s[i] >> a[i]... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 199 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 31, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["+", 31, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["-", 51, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["-", 12, 16, 31, 16, 12, 69, 3... | 1 | 267 | 12 |
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
for (int n, q; cin >> n >> q, n | q;) {
vector<tuple<string, int, int>> ys;
for (int i = 0; i < n; i++) {
string name;
int year, ad;
cin >> name >> year >> ad;
ys.emplace_back(name, ad - year + 1... | #include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
for (int n, q; cin >> n >> q, n | q;) {
vector<tuple<string, int, int>> ys;
for (int i = 0; i < n; i++) {
string name;
int year, ad;
cin >> name >> year >> ad;
ys.emplace_back(name, ad - year + 1... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 217 | 2 |
#include <stdio.h>
#include <string.h>
int main(void) {
int es[1000], eg[1000], eby, wy, n, q, i, j, query;
char name[1000][18], c;
while (1) {
scanf("%d%d%*c", &n, &q);
if (n == 0 && q == 0)
break;
for (i = 0; i < n; i++) {
j = 0;
while ((c = getchar()) != ' ')
name[i][j++]... | #include <stdio.h>
#include <string.h>
int main(void) {
int es[1000], eg[1000], eby, wy, n, q, i, j, query;
char name[1000][18], c;
while (1) {
scanf("%d%d%*c", &n, &q);
if (n == 0 && q == 0)
break;
for (i = 0; i < n; i++) {
j = 0;
while ((c = getchar()) != ' ')
name[i][j++]... | [["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22]] | 1 | 272 | 2 |
#include <algorithm>
#include <cctype>
#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, s, e) for (int i = (s); i < (e); i++)
#define REPI(... | #include <algorithm>
#include <cctype>
#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, s, e) for (int i = (s); i < (e); i++)
#define REPI(... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 353 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef struct names {
string en;
int eby;
int wy;
};
/*
void sort(names array[], int S) {
int sorted, last;
int i;
names temp;
sorted = S;
while(sorted) {
last = 0;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef struct names {
string en;
int eby;
int wy;
};
/*
void sort(names array[], int S) {
int sorted, last;
int i;
names temp;
sorted = S;
while(sorted) {
last = 0;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 258 | 2 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int Maxn = 1010;
struct Era {
char name[20];
int n;
int year;
} era[Maxn];
int n, m;
void solve(int year) {
int ret = -1;
for (int i = 0; i < n; ++i) {
if (era[i].year < year)
continue;
if (era[i].year - era[i]... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int Maxn = 1010;
struct Era {
char name[20];
int n;
int year;
} era[Maxn];
int n, m;
void solve(int year) {
int ret = -1;
for (int i = 0; i < n; ++i) {
if (era[i].year < year)
continue;
if (era[i].year - era[i]... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 278 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int lnt;
typedef pair<lnt, lnt> P;
lnt par[10000];
struct edge {
lnt u, v, cost;
};
vector<edge> es;
b... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int lnt;
typedef pair<lnt, lnt> P;
lnt par[10000];
struct edge {
lnt u, v, cost;
};
vector<edge> es;
b... | [["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 467 | 2 |
// Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m,... | // Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it, X) for (auto it = (X).begin(); it != (X).end(); it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m,... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 17, 151], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22]] | 1 | 528 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define PII pair<int, int>
#define SIZE(x) ((int)x.size())
using namespace std;
int main() {
int N, M, L, R;
scanf("%d%d%d%d", &N, &L, &M, &R);
R *= 2;
L *= 2;
M *= 2;
int l = R, r = L / 2;
vector<PII> las, cur... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define PII pair<int, int>
#define SIZE(x) ((int)x.size())
using namespace std;
int main() {
int N, M, L, R;
scanf("%d%d%d%d", &N, &L, &M, &R);
R *= 2;
L *= 2;
M *= 2;
int l = R, r = L / 2;
vector<PII> las, cur... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 15, 339, 51, 16, 12, 16, 12, 91, 17, 33]] | 1 | 452 | 3 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int tmp_c = 0;
int H, W, N, i, j, mh[4] = {0, 0, 1, -1}, mw[4] = {1, -1, 0, 0},
flg[31][31]; // r,l,u,d
char M[31][31], T[31][31], t;
int limW(int w) { return 0 <= w && w < W; }
int limH(int h) { return 0 <= h && h < H; }
int dfs(char (*M)[3... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int tmp_c = 0;
int H, W, N, i, j, mh[4] = {0, 0, 1, -1}, mw[4] = {1, -1, 0, 0}, flg[31][31];
char M[31][31], T[31][31], t;
int limW(int w) { return 0 <= w && w < W; }
int limH(int h) { return 0 <= h && h < H; }
int dfs(char (*M)[31], int h, int w, int d, char t... | [["-", 0, 7, 8, 1, 0, 11, 12, 16, 17, 33], ["-", 0, 7, 8, 1, 0, 11, 12, 16, 12, 13]] | 0 | 1,060 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
// BEGIN CUT HERE
#ifdef _MSC_VER
#include <agent... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
// BEGIN CUT HERE
#ifdef _MSC_VER
#include <agent... | [["-", 0, 14, 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, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 688 | 5 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
bool drop(vector<string> &b, int h, int w) {
bool ch = false;
REP(i, w) {
int k = h - 1;
for (int j = h - 1; j >= 0; --j) {
if (b[j][... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
bool drop(vector<string> &b, int h, int w) {
bool ch = false;
REP(i, w) {
int k = h - 1;
for (int j = h - 1; j >= 0; --j) {
if (b[j][... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 757 | 4 |
#include "bits/stdc++.h"
using namespace std;
vector<vector<char>> masu, temp;
int h, w, n;
bool check() {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (temp[i][j] != '.')
return false;
}
}
return true;
}
void fall() {
for (int i = h - 1; i > 0; i--) {
for (int j = ... | #include "bits/stdc++.h"
using namespace std;
vector<vector<char>> masu, temp;
int h, w, n;
bool check() {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (temp[i][j] != '.')
return false;
}
}
return true;
}
void fall() {
for (int i = h - 1; i > 0; i--) {
for (int j = ... | [["+", 0, 14, 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], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 775 | 4 |
#include <iostream>
#include <vector>
using namespace std;
#define loop(x, n) for (int x = 0; x < n; ++x)
int h, w, n;
void fall(int xs, int ys, vector<vector<char>> &field) {
if (ys + 1 < h && field[ys][xs] != '.' && field[ys + 1][xs] == '.') {
field[ys + 1][xs] = field[ys][xs];
field[ys][xs] = '.';
fa... | #include <iostream>
#include <vector>
using namespace std;
#define loop(x, n) for (int x = 0; x < n; ++x)
int h, w, n;
void fall(int xs, int ys, vector<vector<char>> &field) {
if (ys + 1 < h && field[ys][xs] != '.' && field[ys + 1][xs] == '.') {
field[ys + 1][xs] = field[ys][xs];
field[ys][xs] = '.';
fa... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 25]] | 1 | 1,218 | 7 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int h, w, n;
const int mask = (1 << 10) - 1;
bool ableToDeleteAll(vector<vector<int>> field, int i, int j, int rem) {
swap(field[... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int h, w, n;
const int mask = (1 << 10) - 1;
bool ableToDeleteAll(vector<vector<int>> field, int i, int j, int rem) {
swap(field[... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 147], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 700 | 2 |
def lower_bound(arr, v)
l = -1
r = arr.size
while l + 1 < r
m = (l + r) / 2
if arr[m] <= v then l = m
else r = m
end
end
l
end
loop do
n, q = gets.split.map(&:to_i)
break if n == 0
era = {}
n.times do
name, ey, wy = gets.split
era[wy.to_i] = [name, ey.to_i]
end
era = era.s... | def lower_bound(arr, v)
l = -1
r = arr.size
while l + 1 < r
m = (l + r) / 2
if arr[m] <= v then l = m
else r = m
end
end
l
end
loop do
n, q = gets.split.map(&:to_i)
break if n == 0
era = {}
n.times do
name, ey, wy = gets.split
era[wy.to_i] = [name, ey.to_i]
end
era = era.s... | [["+", 8, 736, 0, 121, 75, 759, 75, 95, 0, 95], ["+", 0, 121, 75, 759, 75, 95, 0, 652, 735, 22], ["+", 75, 95, 0, 652, 3, 4, 0, 557, 0, 62], ["+", 75, 95, 0, 652, 3, 4, 0, 557, 0, 6]] | 4 | 245 | 5 |
inputnum,outputnum = (int(n) for n in input().split(' '))
data = {}
while True:
for i in range(inputnum):
temp = input().split(' ')
data[temp[0]] = [int(temp[2]) - int(temp[1]) + 1,int(temp[2])]
for o in range(outputnum):
targ = int(input())
for k,v in data.items():
i... | inputnum,outputnum = (int(n) for n in input().split(' '))
while True:
data = {}
for i in range(inputnum):
temp = input().split(' ')
data[temp[0]] = [int(temp[2]) - int(temp[1]) + 1,int(temp[2])]
for o in range(outputnum):
targ = int(input())
for k,v in data.items():
... | [["+", 36, 36, 36, 36, 0, 656, 0, 52, 0, 89], ["+", 36, 36, 36, 36, 0, 656, 0, 52, 15, 146], ["+", 36, 36, 36, 36, 0, 656, 0, 52, 0, 102], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 0, 89], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 15, 146], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 0, 102]] | 5 | 185 | 6 |
import java.io.IOException;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static int play(char[] seq, boolean first) {
int left = 0, right = 0;
int count = 0;
if (first) {
left = seq[0] - '0';
} else {
... | import java.io.IOException;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static int play(char[] seq, boolean first) {
int left = 0, right = 0;
int count = 0;
if (first) {
left = seq[0] - '0';
} else {
... | [["+", 8, 196, 0, 57, 15, 15, 0, 91, 17, 111]] | 3 | 344 | 1 |
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s;
while (1) {
cin >> s;
if (s == "#")
break;
// now -1 l 1 r
int r = -1, l = -1, ans = 0, now = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1' || s[i] == '4... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s;
while (1) {
cin >> s;
if (s == "#")
break;
// now -1 l 1 r
int r = -1, l = -1, ans = 0, now = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1' || s[i] == '4... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 454 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 404 | 2 |
#include <iostream>
#include <vector>
using namespace std;
string op;
bool check(int lef, int rig) {
if (lef == -1 || rig == -1)
return true;
lef %= 3, rig %= 3;
if (lef == 0 && (rig == 1 || rig == 2))
return false;
else if (lef == 2 && rig == 1)
return false;
return true;
}
int Do(bool step)... | #include <iostream>
using namespace std;
string op;
bool check(int lef, int rig) {
if (lef == -1 || rig == -1)
return true;
lef %= 3, rig %= 3;
if (lef == 0 && (rig == 1 || rig == 2))
return false;
else if (lef == 2 && rig == 1)
return false;
return true;
}
int Do(bool step) {
if (op.size()... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 64, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 273 | 3 |
def game(t, s)
cnt = 0
r = l = s[0]
(1...s.size).each do |i|
t == 1 ? r = s[i] : l = s[i]
if r % 3 == 1 && l % 3 != 1 || r % 3 == 2 && l % 3 == 0
r, l = l, r
t = 1 - t
cnt += 1
end
t = 1 - t
end
cnt
end
while s = gets
break if s == '#'
s = s.chomp.split('').map(&:to_i)
... | def game(t, s)
cnt = 0
r = l = s[0]
(1...s.size).each do |i|
t == 1 ? r = s[i] : l = s[i]
if r % 3 == 1 && l % 3 != 1 || r % 3 == 2 && l % 3 == 0
r, l = l, r
t = 1 - t
cnt += 1
end
t = 1 - t
end
cnt
end
while s = gets.chomp
break if s == '#'
s = s.split('').map(&:to_i)
... | [["+", 0, 493, 0, 89, 15, 662, 12, 652, 17, 131], ["+", 0, 493, 0, 89, 15, 662, 12, 652, 735, 22], ["-", 0, 662, 12, 652, 486, 652, 486, 652, 17, 131], ["-", 0, 662, 12, 652, 486, 652, 486, 652, 735, 22]] | 4 | 143 | 4 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int(x) for x in sys.stdi... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int(x) for x in sys.stdi... | [["-", 8, 196, 0, 57, 15, 666, 0, 557, 0, 6], ["+", 8, 196, 0, 57, 15, 666, 0, 557, 0, 6]] | 5 | 530 | 2 |
#include <bits/stdc++.h>
using namespace std;
int H, W, hp, HP;
char t[1005][1005];
int T, S, P;
map<char, int> mp;
vector<int> u;
int dp[20005][(1 << 12)];
int v[12];
int main() {
while (1) {
u.clear();
cin >> hp >> HP;
if (hp == 0 && HP == 0)
break;
cin >> H >> W;
for (int i = 0; i < H; ... | #include <bits/stdc++.h>
using namespace std;
int H, W, hp, HP;
char t[1005][1005];
int T, S, P;
map<char, int> mp;
vector<int> u;
int dp[1005][(1 << 12)];
int v[12];
int main() {
while (1) {
u.clear();
cin >> hp >> HP;
if (hp == 0 && HP == 0)
break;
cin >> H >> W;
for (int i = 0; i < H; i... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 563 | 6 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
const int N = 1010;
const int M = 12;
const int inf = -inf;
int dp[N][1 << M];
bool solve(int n, int *damage, int m, int ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
const int N = 1010;
const int M = 12;
const int inf = -inf;
int dp[N][1 << M];
bool solve(int n, int *damage, int m, int ... | [["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 726 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using name... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using name... | [["+", 12, 23, 0, 41, 75, 16, 31, 91, 17, 33]] | 1 | 843 | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["+", 49, 50, 51, 16, 31, 16, 31, 91, 17, 33]] | 1 | 754 | 1 |
def solve(s):
dic = {}
ll = 'qwertasdfgzxcvb'
rr = 'yuiophjklnm'
for l_i in list(ll):
dic[l_i] = -1
for r_i in list(rr):
dic[r_i] = 1
ans = 0
prev = 0
for s_i in s:
current = dic[s_i]
if current != prev:
if abs(current - prev) == 2:
... |
def solve(s):
dic = {}
ll = 'qwertasdfgzxcvb'
rr = 'yuiophjklnm'
for l_i in list(ll):
dic[l_i] = -1
for r_i in list(rr):
dic[r_i] = 1
ans = 0
prev = 0
for s_i in s:
current = dic[s_i]
if current != prev:
if abs(current - prev) == 2:
... | [["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 117 | 3 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#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 mp make_pair
using namespace std;
typedef long long ll;
int dx[6] = {1, 1, 0, -1, -1, 0};
int dy[6] =... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#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 mp make_pair
using namespace std;
typedef long long ll;
int dx[6] = {1, 1, 0, -1, -1, 0};
int dy[6] =... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 384 | 4 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; ++i)
#define M(a, b) make_pair(a, b)
#define f first
#define s second
using namespace std;
int dx[] =
{
0, 0, 1, 1, -1, -1,
},
dy[] = {1, -1, 1, 0, -1, 0};
bool v[200][200];
int a, b, t, n;
int main() {
while (cin >> t >> n, t) {
r(i,... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; ++i)
#define M(a, b) make_pair(a, b)
#define f first
#define s second
using namespace std;
int dx[] =
{
0, 0, 1, 1, -1, -1,
},
dy[] = {1, -1, 1, 0, -1, 0};
bool v[200][200];
int a, b, t, n;
int main() {
while (cin >> t >> n, t) {
r(i,... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 1 | 390 | 4 |
#include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
int dx[6] = {0, 1, -1, 1, -1, 0}, dy[6]{1, 1, 0, 0, -1, -1};
bool a[500][500];
int mincost[500][500];
signed main() {
int b, c;
while (cin >> b >> c, b | c) {
memset(a, true, sizeof(a));
memset(mincost, -1, sizeof(mincost));
for (in... | #include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
int dx[6] = {0, 1, -1, 1, -1, 0}, dy[6]{1, 1, 0, 0, -1, -1};
bool a[500][500];
int mincost[500][500];
signed main() {
int b, c;
while (cin >> b >> c, b | c) {
memset(a, true, sizeof(a));
memset(mincost, -1, sizeof(mincost));
for (in... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 372 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i = (x); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e15;
template <typename T> void cmax(T &a, T b) { a = max(a, b); }
tem... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i = (x); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e15;
template <typename T> void cmax(T &a, T b) { a = max(a, b); }
tem... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 478 | 4 |
#include <iostream>
#include <queue>
using namespace std;
int a[1000][1000];
int dx[] = {1, 0, -1, -1, 0, 1}, dy[] = {0, -1, -1, 0, 1, 1};
main() {
int n, t;
while (cin >> t >> n, t) {
for (int i = 0; i < 1000; i++)
for (int j = 0; j < 1000; j++)
a[i][j] = 0;
for (int i = 0; i < n; i++) {
... | #include <iostream>
#include <queue>
using namespace std;
int a[1000][1000];
int dx[] = {1, 0, -1, -1, 0, 1}, dy[] = {0, -1, -1, 0, 1, 1};
main() {
int n, t;
while (cin >> t >> n, t) {
for (int i = 0; i < 1000; i++)
for (int j = 0; j < 1000; j++)
a[i][j] = 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 | 406 | 2 |
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int dy[] = {-1, -1, 0, 0, 1, 1};
const int dx[] = {-1, 0, -1, 1, 0, 1};
int main() {
int n, t;
const int base = 150;
const int MAX_P = 301;
while (cin >> t >> n && !(t == 0 && n == 0)) {
... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int dy[] = {-1, -1, 0, 0, 1, 1};
const int dx[] = {-1, 0, -1, 1, 0, 1};
int main() {
int n, t;
const int base = 150;
const int MAX_P = 301;
while (cin >> t >> n && !(t == 0 && n == 0)) {
... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13]] | 1 | 464 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
int t, n, sx, sy;
bool used[1111][1111];
int dx[] = {1, -1, 0, 0, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1};
int main(void) {
while (cin >> t >> n && t) {
memset(used, false, sizeof(use... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
int t, n, sx, sy;
bool used[1111][1111];
int dx[] = {1, -1, 0, 0, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1};
int main(void) {
while (cin >> t >> n && t) {
memset(used, false, sizeof(use... | [["-", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 355 | 4 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
while (sc.hasNext()) {
int N = sc.nextInt();
if (N == 0)
break;
double[][] dist = new double[N + 2][N + 2];
d... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
while (sc.hasNext()) {
int N = sc.nextInt();
if (N == 0)
break;
double[][] dist = new double[N + 2][N + 2];
d... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 1, 0, 492, 3, 4, 0, 74, 0, 24], ["+", 0, 492, 3, 4, 0, 74, 39, 506, 0, 507], ["+", 0, 1, 0, 492, 3, 4, 0, 74, 0, 25]] | 3 | 354 | 5 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#ifdef DEBUG
#define line() cout << "[... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#ifdef DEBUG
#define line() cout << "[... | [["+", 8, 9, 0, 43, 49, 80, 81, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 12, 13], ["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 24], ["+", 12, 23, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 12, 23, 0, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 25]] | 1 | 314 | 6 |
#include <climits>
#include <iostream>
#include <vector>
int main() {
using namespace std;
int N, i, j, k, c, tmp_cost;
vector<vector<int>> cost;
vector<int> dp;
while (1) {
cin >> N;
if (N == 0)
break;
cost.resize(N);
for (i = 0; i < N; i++)
cost[i].resize(N + 1);
dp.resize(1 ... | #include <climits>
#include <iostream>
#include <vector>
int main() {
using namespace std;
int N, i, j, k, c, tmp_cost;
vector<vector<int>> cost;
vector<int> dp;
while (1) {
cin >> N;
if (N == 0)
break;
cost.resize(N);
for (i = 0; i < N; i++)
cost[i].resize(N + 1);
dp.resize(1 ... | [["+", 8, 9, 0, 7, 8, 7, 8, 9, 0, 45], ["+", 8, 9, 0, 7, 8, 7, 8, 9, 0, 46]] | 1 | 332 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#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;
whi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#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;
whi... | [["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 24], ["+", 12, 23, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 12, 23, 0, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 25]] | 1 | 314 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX_N 20
int dp[1 << MAX_N];
int x[MAX_N][MAX_N];
int y[MAX_N];
int n;
int main() {
while (true) {
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> y[i];
for (int j = 0; j < n; j++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
#define MAX_N 20
int dp[1 << MAX_N];
int x[MAX_N][MAX_N];
int y[MAX_N];
int n;
int main() {
while (true) {
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> y[i];
for (int j = 0; j < n; j++) {
... | [["+", 8, 9, 0, 7, 15, 16, 12, 23, 0, 24], ["+", 0, 7, 15, 16, 12, 23, 0, 16, 31, 13], ["+", 0, 7, 15, 16, 12, 23, 0, 16, 17, 151], ["+", 8, 9, 0, 7, 15, 16, 12, 23, 0, 25]] | 1 | 325 | 4 |
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
// distance between (x1,y1) and (x2,y2)
double cdis(double x1, double y1, double x2, double y2) {
return sqrtl((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
// cos a
double costh(double a, double b, double c) {
return (b * b + c *... | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
// distance between (x1,y1) and (x2,y2)
double cdis(double x1, double y1, double x2, double y2) {
return sqrtl((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
// cos a
double costh(double a, double b, double c) {
return (b * b + c *... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 736 | 2 |
#include <algorithm>
#include <array>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vecto... | #include <algorithm>
#include <array>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vecto... | [["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 14, 8, 9, 0, 57, 64, 116, 0, 35], ["+", 8, 9, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 723 | 6 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | [["-", 0, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 688 | 4 |
#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) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef... | #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) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef... | [["-", 31, 69, 28, 69, 28, 69, 341, 342, 0, 22], ["+", 31, 69, 28, 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], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 689 | 6 |
#include <bits/stdc++.h>
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
struct Point {
double x, y;
Point() {}
Point(double x, double 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... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
struct Point {
double x, y;
Point() {}
Point(double x, double 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... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 2, 3, 4, 0, 16, 12, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 47]] | 1 | 1,058 | 6 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | [["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 45], ["+", 12, 2, 3, 4, 0, 16, 31, 16, 17, 48], ["+", 12, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 17, 85], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 46]] | 1 | 4,692 | 6 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, ... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0,... | 1 | 648 | 8 |
#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;
const int INF = 1e8;
using namespace std;
typedef complex<double> Point;
typedef Point Vector;
//????... | #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;
const int INF = 1e8;
using namespace std;
typedef complex<double> Point;
typedef Point Vector;
//????... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["-", 31, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 31, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 13]] | 1 | 3,724 | 8 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long Int;
Int gcd(Int a, Int b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
Int lcm(Int a, Int b) { return a * b / gcd(a, b); }
int M, N, A, B, C, D;
Int calc(Int x, Int y) {... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long Int;
Int gcd(Int a, Int b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
Int lcm(Int a, Int b) { return a * b / gcd(a, b); }
int M, N, A, B, C, D;
Int calc(Int x, Int y) {... | [["+", 8, 9, 0, 37, 0, 16, 31, 16, 17, 48], ["+", 8, 9, 0, 37, 0, 16, 31, 16, 12, 22]] | 1 | 501 | 2 |
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <queue>
#include <set>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
typedef long long ll;
using namespace std;
int check(int a, int m) {
vector<int> visit(m);
int now = 0;
while (!visit[now]) {
visit[now] = 1;
now =... | #include <algorithm>
#include <cstdio>
#include <numeric>
#include <queue>
#include <set>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
typedef long long ll;
using namespace std;
int check(int a, int m) {
vector<int> visit(m);
int now = 0;
while (!visit[now]) {
visit[now] = 1;
now =... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 48]] | 1 | 433 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.