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"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
int ans = 0;
vector<int> powers;
int restp[41];
bool check(const vector<vector<int>> &tonari, const vector<bool> &o... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
int ans = 0;
vector<int> powers;
int restp[41];
bool check(const vector<vector<int>> &tonari, const vector<bool> &o... | [["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 654 | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const ... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 233 | 2 |
//#include "bits/stdc++.h"
#include <iostream>
#include <vector>
// #include <map>
// #include <string>
// #include <algorithm>
// #include <numeric>
// #include <limits>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> vec(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int... | //#include "bits/stdc++.h"
#include <iostream>
#include <vector>
// #include <map>
// #include <string>
// #include <algorithm>
// #include <numeric>
// #include <limits>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> vec(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 160 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <random>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MN = 501 * 100... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <random>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MN = 501 * 100... | [["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["-", 0, 11, 12, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 48], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 393 | 42 |
#include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const int MOD = 1000000009;
template <typename T> class Matrix {
private:
int N, M;
vector<vector<T>> data;
template <typ... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const int MOD = 1000000009;
template <typename T> class Matrix {
private:
int N, M;
vector<vector<T>> data;
template <typ... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 1,545 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 1,041 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 727 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 31, 22], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 31, 22], ["-", 31, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 31, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1... | 1 | 903 | 8 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const int mod = 1000000009;
struct Mat {
int v[80][80];
int h, w;
Mat() : h(0), w(0) {}
Mat(int h, int w) : h(h), w(w) {}
};
vector<Mat> A2;
Mat operator*(const Mat &a, const Mat &b) {
Mat c(a.h, b.w);
f... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const int mod = 1000000009;
struct Mat {
int v[80][80];
int h, w;
Mat() : h(0), w(0) {}
Mat(int h, int w) : h(h), w(w) {}
};
vector<Mat> A2;
Mat operator*(const Mat &a, const Mat &b) {
Mat c(a.h, b.w);
f... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, ... | 1 | 1,049 | 8 |
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> Vec;
typedef vector<Vec> Mat;
const ll MOD = 1000000009LL;
Mat mul(const Mat &m1, const Mat &m2) {
int N = m1.size();
int M = m2[0].size();
int K = m1[0].size();
Mat res(N, Vec(M... | #include <cassert>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> Vec;
typedef vector<Vec> Mat;
const ll MOD = 1000000009LL;
Mat mul(const Mat &m1, const Mat &m2) {
int N = m1.size();
int M = m2[0].size();
int K = m1[0].size();
Mat res(N, Vec(M... | [["-", 31, 23, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 31, 23, 0, 16, 31, 69, 341, 342, 0, 22]] | 1 | 661 | 2 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter ... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter ... | [["+", 64, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 64, 1, 0, 492, 3, 4, 0, 16, 12, 499]] | 3 | 1,065 | 2 |
/*
* AOJ #2399 Save Your Privacy!
*/
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, m, i, j, p, count, answer;
unsigned char **candidate, *leaker;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
candidate = malloc((n + 1) * sizeof(candidate[0]));
for (i = 1; i <= n; ... | /*
* AOJ #2399 Save Your Privacy!
*/
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, m, i, j, p, count, answer;
unsigned char **candidate, *leaker;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
candidate = malloc((n + 1) * sizeof(candidate[0]));
for (i = 1; i <= n; ... | [["-", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 0, 70], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 0, 73]] | 0 | 389 | 3 |
import java.util.*;
class Main {
public static void main(String args[]) {
Solve s = new Solve();
s.solve();
}
}
class Solve {
Scanner in = new Scanner(System.in);
void solve() {
int n = in.nextInt();
Set<String> st = new HashSet<String>();
for (int i = 0; i < n; i++) {
String str = ... | import java.util.*;
class Main {
public static void main(String args[]) {
Solve s = new Solve();
s.solve();
}
}
class Solve {
Scanner in = new Scanner(System.in);
void solve() {
int n = in.nextInt();
Set<String> st = new HashSet<String>();
for (int i = 0; i < n; i++) {
String str = ... | [["-", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491]] | 3 | 213 | 2 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
HashSet<String> set = new HashSet<String>();
int N = sc.nextInt();
for (int i = 0; i < N; i++) {
set.add(sc.next());
}
int M = sc.nextInt();
boolean flag = false;
... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
HashSet<String> set = new HashSet<String>();
int N = sc.nextInt();
for (int i = 0; i < N; i++) {
set.add(sc.next());
}
int M = sc.nextInt();
boolean flag = false;
... | [["-", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491]] | 3 | 197 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
String[] U = new String[n];
for (int x = 0; x < n; x++) {
U[x] = s.next();
}
int m = s.nextInt();
String[] T = new String[m];
for (i... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
String[] U = new String[n];
for (int x = 0; x < n; x++) {
U[x] = s.next();
}
int m = s.nextInt();
String[] T = new String[m];
for (i... | [["-", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491]] | 3 | 277 | 2 |
import java.util.HashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
while (sc.hasNext()) {
HashMap<String, Integer> hm = new HashMap<>();
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
... |
import java.util.HashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
while (sc.hasNext()) {
HashMap<String, Integer> hm = new HashMap<>();
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
... | [["-", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491]] | 3 | 219 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
ArrayDeque<String> list = new ArrayDeque<String>();
for (int i = 0; i < n; i++)
list.push(sc.next());
int m = sc.nextInt();
String s = "";
... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
ArrayDeque<String> list = new ArrayDeque<String>();
for (int i = 0; i < n; i++)
list.push(sc.next());
int m = sc.nextInt();
String s = "";
... | [["-", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491]] | 3 | 201 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N, M, flag;
int con = 0;
String[] U = new String[256];
String[] T = new String[256];
N = scan.nextInt();
for (int i = 0; i < N; i++) {
U[i] = scan.nex... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N, M, flag;
int con = 0;
String[] U = new String[256];
String[] T = new String[256];
N = scan.nextInt();
for (int i = 0; i < N; i++) {
U[i] = scan.nex... | [["-", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491]] | 3 | 273 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
enum { OPEN, CLOSE };
typedef struct {
char id[20];
} ID;
int isID(char id[], ID *reg, int regSize) {
int i;
for (i = 0; i < regSize; i++) {
if (strcmp(id, reg[i].id == 0)) {
return 1;
}
}
return 0;
}
int main(void) {
int i;
int ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
enum { OPEN, CLOSE };
typedef struct {
char id[20];
} ID;
int isID(char id[], ID *reg, int regSize) {
int i;
for (i = 0; i < regSize; i++) {
if (strcmp(id, reg[i].id) == 0) {
return 1;
}
}
return 0;
}
int main(void) {
int i;
int ... | [["+", 15, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["-", 0, 57, 15, 23, 0, 2, 3, 4, 0, 25]] | 0 | 331 | 2 |
#include <stdio.h>
#include <string.h>
int main() {
int N, M;
char C[256][10];
char T[256][10];
int i, j;
int flag = 0;
int Unknown;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%s", C[i]);
scanf("%d", &M);
for (i = 0; i < M; i++)
scanf("%s", T[i]);
for (i = 0; i < M; i++) {
U... | #include <stdio.h>
#include <string.h>
int main() {
int N, M;
char C[256][11];
char T[256][11];
int i, j;
int flag = 0;
int Unknown;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%s", C[i]);
scanf("%d", &M);
for (i = 0; i < M; i++)
scanf("%s", T[i]);
for (i = 0; i < M; i++) {
Un... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 241 | 4 |
#include <stdio.h>
#include <string.h>
int find(char u[][11], char t[], int n) {
int i;
for (i = 0; i < n; i++) {
if (strcmp(u[i], t) == 0)
return 1;
}
return 0;
}
int main(void) {
int n, m, i, c;
char u[256][11], t[11];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%s", u[i]);
scanf("... | #include <stdio.h>
#include <string.h>
int find(char u[][11], char t[], int n) {
int i;
for (i = 0; i < n; i++) {
if (strcmp(u[i], t) == 0)
return 1;
}
return 0;
}
int main(void) {
int n, m, i, c;
char u[256][11], t[11];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%s", u[i]);
scanf("... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 238 | 2 |
#include <stdio.h>
#include <string.h>
int main() {
int N, M, i, j, lock;
char U[11][257];
char s[11];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%s", U[i]);
}
scanf("%d", &M);
lock = 1;
for (i = 0; i < M; i++) {
scanf("%s", s);
for (j = 0; j < N; j++) {
if (strcmp(s, U[... | #include <stdio.h>
#include <string.h>
int main() {
int N, M, i, j, lock;
char U[300][11];
char s[11];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%s", U[i]);
}
scanf("%d", &M);
lock = 1;
for (i = 0; i < M; i++) {
scanf("%s", s);
for (j = 0; j < N; j++) {
if (strcmp(s, U[... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 219 | 6 |
#include <stdio.h>
#include <string.h>
int main() {
int N, M;
char U[11][300];
char T[11];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%s", U[i]);
}
scanf("%d", &M);
int lock = 1, flag = 0;
for (int i = 0; i < M; i++) {
scanf("%s", T);
flag = 0;
for (int j = 0; j < N; j+... | #include <stdio.h>
#include <string.h>
int main() {
int N, M;
char U[300][11];
char T[11];
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%s", U[i]);
}
scanf("%d", &M);
int lock = 1, flag = 0;
for (int i = 0; i < M; i++) {
scanf("%s", T);
flag = 0;
for (int j = 0; j < N; j+... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 16, 31, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 16, 31, 2, 3, 4, 0, 69, 71, 22]] | 0 | 214 | 6 |
#include <iostream>
#include <map>
using namespace std;
int main(void) {
int n, m, i;
bool lock;
string u, t, mess;
map<string, bool> mp;
cin >> n;
for (i = 0; i < n; i++) {
cin >> u;
mp[u] = true;
}
lock = true;
cin >> m;
for (i = 0; i < m; i++) {
cin >> t;
if (mp.find(t) == mp.e... | #include <iostream>
#include <map>
using namespace std;
int main(void) {
int n, m, i;
bool lock;
string u, t, mess;
map<string, bool> mp;
cin >> n;
for (i = 0; i < n; i++) {
cin >> u;
mp[u] = true;
}
lock = true;
cin >> m;
for (i = 0; i < m; i++) {
cin >> t;
if (mp.find(t) == mp.e... | [["-", 0, 1, 0, 11, 12, 41, 75, 5, 0, 6], ["+", 0, 1, 0, 11, 12, 41, 75, 5, 0, 6]] | 1 | 155 | 2 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<string> usr_name;
int main() {
vector<string>::iterator it;
int n, m, i = 0, j = 0;
bool k = 0;
string tmp;
cin >> n;
cin.ignore();
for (i = 0; i < n; i++) {
cin >> tmp;
usr_name.push_back(tmp);
cin.ignore();... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<string> usr_name;
int main() {
vector<string>::iterator it;
int n, m, i = 0, j = 0;
bool k = 0;
string tmp;
cin >> n;
cin.ignore();
for (i = 0; i < n; i++) {
cin >> tmp;
usr_name.push_back(tmp);
cin.ignore();... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 229 | 4 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2440
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n)... |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2440
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n)... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 251 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n;
vector<string> sn(n);
rep(i, n) { cin >> sn[i]; }
cin >> m;
bool open... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n;
vector<string> sn(n);
rep(i, n) { cin >> sn[i]; }
cin >> m;
bool open... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 147], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 146]] | 1 | 165 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 114514810
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define SORT(v) sort(ALL(v))
//#define scanf scanf_s
typedef pair<int, int> P;
int n, m;
string id[1000];
... | #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 INF 114514810
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define SORT(v) sort(ALL(v))
//#define scanf scanf_s
typedef pair<int, int> P;
int n, m;
string id[1000];
... | [["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6]] | 1 | 186 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
while (cin >> n) {
vector<string> id;
for (long long int i = 0; i < n; i++) {
string in;
cin >> in;
id.push_back(in);
}
sort(id.begin(), id.end());... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
while (cin >> n) {
vector<string> id;
for (long long int i = 0; i < n; i++) {
string in;
cin >> in;
id.push_back(in);
}
sort(id.begin(), id.end());... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 201 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, M;
int frag = 0;
string U[255];
string T;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> U[i];
}
cin >> M;
for (int j = 0; j < M; j++) {
cin >> T;
for (int i = 0; i < N; i++) {
if (T == U[i]) {
fra... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M;
int frag = 0;
string U[256];
string T;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> U[i];
}
cin >> M;
for (int j = 0; j < M; j++) {
cin >> T;
for (int i = 0; i < N; i++) {
if (T == U[i]) {
fra... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 173 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str[256], man;
int n, m, judge;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> man;
for (int j = 0; j < n; j++) {
if (str[j] == man) {
if (judge == 0) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str[256], man;
int n, m, judge;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> man;
for (int j = 0; j < n; j++) {
if (str[j] == man) {
if (judge == 0) ... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 170 | 2 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string str[100];
for (int i = 0; i < n; i++) {
cin >> str[i];
}
int m;
cin >> m;
int cnt = 0;
for (int j = 0; j < m; j++) {
string str2;
cin >> str2;
for (int k = 0; k < n; k++)... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string str[256];
for (int i = 0; i < n; i++) {
cin >> str[i];
}
int m;
cin >> m;
int cnt = 0;
for (int j = 0; j < m; j++) {
string str2;
cin >> str2;
for (int k = 0; k < n; k++)... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 171 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(), X.end()
#define FOR... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(), X.end()
#define FOR... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 146], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 249 | 4 |
#include <algorithm>
#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;
int main() {
int n;
cin >> n;
map<string, bool> ma;
rep(i, n) {
string s;
cin >> s;
ma[s... | #include <algorithm>
#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;
int main() {
int n;
cin >> n;
map<string, bool> ma;
rep(i, n) {
string s;
cin >> s;
ma[s... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 156 | 2 |
// Author :
// Date :
// Problem:
// Solution:
// Comment:
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define... | // Author :
// Date :
// Problem:
// Solution:
// Comment:
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define... | [["-", 64, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 229 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
bool isLocked = true;
vector<string> map;
int N, M;
cin >> N;
map.clear();
map.resize(N);
for (int i = 0; i < N; ++i) {
string id;
cin >> id;
map[i] = id;
}
cin >> M;
for (i... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
bool isLocked = true;
vector<string> map;
int N, M;
cin >> N;
map.clear();
map.resize(N);
for (int i = 0; i < N; ++i) {
string id;
cin >> id;
map[i] = id;
}
cin >> M;
for (i... | [["-", 64, 9, 0, 1, 0, 11, 12, 91, 17, 92], ["+", 64, 9, 0, 1, 0, 11, 12, 91, 17, 111]] | 1 | 196 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long int ll;
int... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long int ll;
int... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 175 | 2 |
#include <bits/stdc++.h>
#define INF (1001001001)
int dx[8] = {0, 1, 0, -1, -1, 1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
int main() {
int n, m;
scanf("%d", &n);
vector<string> ids(n);
for (int i = 0; i < n; i++) {
cin >> ids[i];
}
bool door = false;
scanf("%d",... | #include <bits/stdc++.h>
#define INF (1001001001)
int dx[8] = {0, 1, 0, -1, -1, 1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
int main() {
int n, m;
scanf("%d", &n);
vector<string> ids(n);
for (int i = 0; i < n; i++) {
cin >> ids[i];
}
bool door = false;
scanf("%d",... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 241 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int now = 0; // 0-close 1-open
string user[257];
string visit[257];
cin >> n;
for (int i = 0; i < n; i++)
cin >> user[i];
cin >> m;
for (int i = 0; i < m; i++)
cin >> visit[i];
for (int i = 0; i < m; i++) {
int flag = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int now = 0; // 0-close 1-open
string user[257];
string visit[257];
cin >> n;
for (int i = 0; i < n; i++)
cin >> user[i];
cin >> m;
for (int i = 0; i < m; i++)
cin >> visit[i];
for (int i = 0; i < m; i++) {
int flag = 0;... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 91,... | 1 | 207 | 11 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define reps(i, f, n) for (int i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define reps(i, f, n) for (int i ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 147], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 146]] | 1 | 242 | 2 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX / 2 - 1
using namespace std;
int main() {
int n, m;
string tmp;
vector<string> user;
bool open = false;
cin >> n;
while (n--) {
cin... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX / 2 - 1
using namespace std;
int main() {
int n, m;
string tmp;
vector<string> user;
bool open = false;
cin >> n;
while (n--) {
cin... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 164 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
int main() {
int n, m;
bool door = false;
string id[256];
string id2;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> id[i];
}
cin >> m;
for (int... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
int main() {
int n, m;
bool door = false;
string id[256];
string id2;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> id[i];
}
cin >> m;
for (int... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 177 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s[300];
while (cin >> n && n) {
for (int i = 0; i < n; i++)
cin >> s[i];
int m;
cin >> m;
bool p = 0, np = 0;
while (m--) {
string str;
cin >> str;
for (int i = 0; i < n; i++)
if (str == s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s[300];
while (cin >> n && n) {
for (int i = 0; i < n; i++)
cin >> s[i];
int m;
cin >> m;
bool p = 0, np = 0;
while (m--) {
string str;
cin >> str;
for (int i = 0; i < n; i++)
if (str == s... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 171 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main(void) {
int N, M;
string s;
bool locked = true;
map<string, bool> ID;
cin >> N;
rep(i, N) {
cin >> s;
ID[s] = true;
}
cin >> M;
rep(i, M) {
cin >> s;
if (ID[s]) {
cout << (lock... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main(void) {
int N, M;
string s;
bool locked = true;
map<string, bool> ID;
cin >> N;
rep(i, N) {
cin >> s;
ID[s] = true;
}
cin >> M;
rep(i, M) {
cin >> s;
if (ID[s]) {
cout << (lock... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6]] | 1 | 133 | 2 |
#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define Getsign(n) ((n > 0) - (n < 0))
#define QWERTYR(c)... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define Getsign(n) ((n > 0) - (n < 0))
#define QWERTYR(c)... | [["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 1 | 230 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<string> v;
rep(i, n) {
string s;
cin >> s;
v.push_back(s);
}
int m;
scanf("%d", &m);
bool b = false;
rep(i, m) {
string s;
cin >> s;
if (find... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<string> v;
rep(i, n) {
string s;
cin >> s;
v.push_back(s);
}
int m;
scanf("%d", &m);
bool b = false;
rep(i, m) {
string s;
cin >> s;
if (find... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 162 | 2 |
#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 <stack>
#include <string>
#include <tuple>
#include <un... | #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 <stack>
#include <string>
#include <tuple>
#include <un... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 326 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i, n) for (i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i, n) for (i... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 223 | 2 |
// 2016-11-30
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
string u[256], t;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> u[i];
}
cin >> m;
bool o = false;
for (int i = 0; i < m; i++) {
cin >> t;
int j;
for (j = 0; j < n; j++) {
if (t == u[j]... | // 2016-11-30
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
string u[256], t;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> u[i];
}
cin >> m;
bool o = false;
for (int i = 0; i < m; i++) {
cin >> t;
int j;
for (j = 0; j < n; j++) {
if (t == u[j]... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 158 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unordered_set<string> a;
int b;
cin >> b;
for (int c = 0; c < b; c++) {
string d;
cin >> d;
a.insert(d);
}
bool e = false;
int f;
cin >> f;
for (int g = 0; g < f; g++) {
string h;
cin >> h;
if (a.find(h) != a.end()) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
unordered_set<string> a;
int b;
cin >> b;
for (int c = 0; c < b; c++) {
string d;
cin >> d;
a.insert(d);
}
bool e = false;
int f;
cin >> f;
for (int g = 0; g < f; g++) {
string h;
cin >> h;
if (a.find(h) != a.end()) {
... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 155 | 2 |
#include <iostream>
#include <set>
#include <string>
using namespace std;
string message[] = {"Opened by ", "Closed by "};
int cnt;
int n, m;
set<string> registered;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
registered.insert(str);
}
cin >> m;
for (int i = 0;... | #include <iostream>
#include <set>
#include <string>
using namespace std;
string message[] = {"Opened by ", "Closed by "};
int cnt;
int n, m;
set<string> registered;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
registered.insert(str);
}
cin >> m;
for (int i = 0;... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 149 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n;
vector<string> v;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
v.push_back(s);
}
cin >> m;
int flg = 0;
for (int j = 0; j < m; j++) {
string s;
cin >> s;
int match = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n;
vector<string> v;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
v.push_back(s);
}
cin >> m;
int flg = 0;
for (int j = 0; j < m; j++) {
string s;
cin >> s;
int match = 0;
for (int i = 0; i < ... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 188 | 2 |
//#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define rep... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define rep... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 648 | 2 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<string> U;
string s;
bool open, f;
for (int i = 0; i < N; ++i) {
cin >> s;
U.push_back(s);
}
cin >> M;
open = false;
for (int i = 0; i < M; ++i) {
cin >> s;
f = true;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<string> U;
string s;
bool open, f;
for (int i = 0; i < N; ++i) {
cin >> s;
U.push_back(s);
}
cin >> M;
open = false;
for (int i = 0; i < M; ++i) {
cin >> s;
f = true;
... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 180 | 2 |
// clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 447 | 2 |
#include <iostream>
#include <map>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
using namespace std;
int N, M;
string S;
map<string, bool> p;
bool s;
int main(void) {
cin >> N;
REP(i, 0, N) {
cin >> S;
p[S] = false;
}
cin >> M;
s = false;
REP(i, 0, M) {
cin >> S;
if (p.co... | #include <iostream>
#include <map>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
using namespace std;
int N, M;
string S;
map<string, bool> p;
bool s;
int main(void) {
cin >> N;
REP(i, 0, N) {
cin >> S;
p[S] = false;
}
cin >> M;
s = false;
REP(i, 0, M) {
cin >> S;
if (p.co... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 156 | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
int read() {
int i;
scanf("%lld", &i);
return i;
}
signed main() {
int N = read();
string U[N];
REP(i, N) { cin >> U[i]; }
int M ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
int read() {
int i;
scanf("%lld", &i);
return i;
}
signed main() {
int N = read();
string U[N];
REP(i, N) { cin >> U[i]; }
int M ... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 212 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
vector<string> u;
cin >> n;
for (int i = 0; i < n; i++) {
string U;
cin >> U;
u.push_back(U);
}
cin >> m;
int ans = 0;
for (int i = 0; i < m; i++) {
string T;
cin >> T;
int judge = 0;
for (int ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
vector<string> u;
cin >> n;
for (int i = 0; i < n; i++) {
string U;
cin >> U;
u.push_back(U);
}
cin >> m;
int ans = 0;
for (int i = 0; i < m; i++) {
string T;
cin >> T;
int judge = 0;
for (int ... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 1 | 189 | 2 |
///
// File: 2440.cpp
// Author: ymiyamoto
//
// Created on Fri Nov 10 15:06:25 2017
//
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
enum status_t {
Open,
Close,
};
int32_t main() {
uint32_t N, U;
cin >> N;
vector<string> registered;
for (uint32_t i =... | ///
// File: 2440.cpp
// Author: ymiyamoto
//
// Created on Fri Nov 10 15:06:25 2017
//
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
enum status_t {
Open,
Close,
};
int32_t main() {
uint32_t N, U;
cin >> N;
vector<string> registered;
for (uint32_t i =... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 203 | 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 pb push_back
typedef long long ll;
typedef pair<int, int> P;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typ... | #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 pb push_back
typedef long long ll;
typedef pair<int, int> P;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typ... | [["-", 0, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 0, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 0, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 0, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 227 | 4 |
#include <bits/stdc++.h>
using namespace std;
void solve(vector<string> ids, vector<string> strs) {
bool s = false, st = false;
for (string x : strs) {
st = s;
for (string y : ids) {
if (x == y) {
if (s) {
s = false;
cout << "Closed by " << y << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
void solve(vector<string> ids, vector<string> strs) {
bool s = false, st = false;
for (string x : strs) {
st = s;
for (string y : ids) {
if (x == y) {
if (s) {
s = false;
cout << "Closed by " << y << endl;
} else {
... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 207 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 226 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 283 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
string tmp;
bool opened = false;
vector<string> pass;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
pass.push_back(tmp);
}
cin >> m;
for (int i = 0; i < m; i++) {
bool matched = false;
cin >> tmp;
for (i... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
string tmp;
bool opened = false;
vector<string> pass;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
pass.push_back(tmp);
}
cin >> m;
for (int i = 0; i < m; i++) {
bool matched = false;
cin >> tmp;
for (i... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 173 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t = 0;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cin >> m;
string b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
for (int j = 0; j < n; j++) {
if (a[j] == b[i]) {
if (t % 2 == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t = 0;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cin >> m;
string b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
for (int j = 0; j < n; j++) {
if (a[j] == b[i]) {
if (t % 2 == 0) {
... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 200 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, count = 0, b;
string u[300], t[300];
int a[300];
cin >> n;
for (int i = 0; i < n; i++)
cin >> u[i];
cin >> m;
for (int i = 0; i < m; i++)
cin >> t[i];
b = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, count = 0, b;
string u[300], t[300];
int a[300];
cin >> n;
for (int i = 0; i < n; i++)
cin >> u[i];
cin >> m;
for (int i = 0; i < m; i++)
cin >> t[i];
b = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 259 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
using namespace std;
// s.....0=�{�� 1=����
int n, m, s = 0, c = 0;
char u[256][11] = {}, t[256][11] = {};
int check(int a, int b);
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", &u[i]);
}
scanf("%d", &m);
f... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
using namespace std;
// s.....0=�{�� 1=����
int n, m, s = 0, c = 0;
char u[256][11] = {}, t[256][11] = {};
int check(int a, int b);
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", &u[i]);
}
scanf("%d", &m);
f... | [["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 1 | 353 | 2 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ut... | [["+", 0, 57, 15, 339, 51, 91, 28, 23, 0, 24], ["+", 0, 57, 15, 339, 51, 91, 28, 23, 0, 25]] | 1 | 319 | 2 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 391 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n;
string id[n];
for (int i = 0; i < n; ++i) {
cin >> id[i];
}
cin >> m;
bool isOpen = false;
for (int i = 0; i < m; ++i) {
string in;
cin >> in;
bool out = false;
for (int j = 0; j < n; ++j) {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n;
string id[n];
for (int i = 0; i < n; ++i) {
cin >> id[i];
}
cin >> m;
bool isOpen = false;
for (int i = 0; i < m; ++i) {
string in;
cin >> in;
bool out = false;
for (int j = 0; j < n; ++j) {
... | [["-", 64, 9, 0, 1, 0, 11, 12, 91, 17, 92], ["+", 64, 9, 0, 1, 0, 11, 12, 91, 17, 111]] | 1 | 171 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
#define INF 1LL << 60
struct Comp {
bool operator()(pair<int, ll> a, pair<int, ll> b) {
return a.second > b.second;
}
};
int sx, sy, gx, gy;
int lx, ly;
bool box[300][300];
ll dist[300][300][6... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
#define INF 1LL << 60
struct Comp {
bool operator()(pair<int, ll> a, pair<int, ll> b) {
return a.second > b.second;
}
};
int sx, sy, gx, gy;
int lx, ly;
bool box[300][300];
ll dist[300][300][6... | [["-", 0, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 12, 13]] | 1 | 798 | 8 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
struct edge {
int v;
ll w;
edge() {}
edge(int v, ll w) : v(v), w(w){};
};
vector<ll> dijkstra(int n, vector<vector<edge>> &G, int s) {
vector<ll> d(n, LLONG_MAX / 10);
d[s] = 0;
priority_queue<pair<ll, int>> ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
struct edge {
int v;
ll w;
edge() {}
edge(int v, ll w) : v(v), w(w){};
};
vector<ll> dijkstra(int n, vector<vector<edge>> &G, int s) {
vector<ll> d(n, LLONG_MAX / 10);
d[s] = 0;
priority_queue<pair<ll, int>> ... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 64, 9, 0, 1, 0, 11, 12, 91, 17, 33], ["+", 64, 9, 0, 1, 0, 11, 12, 91, 28, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 91, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 91, 28, 22]] | 1 | 846 | 9 |
#include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 28, 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], ["+", 28, 69, 341, 342, 0, 16, 31, 23, 0, 25]] | 1 | 1,154 | 6 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | [["-", 341, 342, 0, 2, 3, 4, 0, 118, 119, 120], ["+", 341, 342, 0, 2, 3, 4, 0, 118, 119, 120]] | 1 | 814 | 2 |
#include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
struct S {
int x, y, t;
};
bool operator==(S l, S r) { return l.x == r.x && l.y == r.y && l.t == r.t; }
int to_i(const S &s) { return s.x + 100 + (s.... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
struct S {
int x, y, t;
};
bool operator==(S l, S r) { return l.x == r.x && l.y == r.y && l.t == r.t; }
int to_i(const S &s) { return s.x + 100 + (s.... | [["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 24], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 25]] | 1 | 1,063 | 3 |
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int lx, ly;
inline int convert(const int x, const int y, const int t) {
const int X = 2 * lx + 1;
const int Y = 2 * ly + 1;
const int TOTAL = X * Y;
const int dx = x + lx;
const int dy = y + ly;
return X * dy + ... | #include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int lx, ly;
inline int convert(const int x, const int y, const int t) {
const int X = 2 * lx + 1;
const int Y = 2 * ly + 1;
const int TOTAL = X * Y;
const int dx = x + lx;
const int dy = y + ly;
return X * dy + ... | [["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22]] | 1 | 986 | 1 |
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 3, 4, 0, 83, 0, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 83, 0, 69, 341, 342, 0, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 83, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 83, 0, 13]] | 1 | 1,014 | 6 |
// g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [["-", 12, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 31, 22]] | 1 | 936 | 2 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct Tag {
int x, y, state;
int cost;
Tag(int x, int y, int s, int cost) : x(x), y(y), state(s), cost(cost) {}
bool operator<(const Tag &other) const { return cost > other.cost; }
};
const i... | #include <algorithm>
#include <climits>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct Tag {
int x, y, state;
int cost;
Tag(int x, int y, int s, int cost) : x(x), y(y), state(s), cost(cost) {}
bool operator<(const Tag &other) const { return cost > other.cost; }
};
const i... | [["-", 28, 69, 341, 342, 0, 16, 31, 118, 119, 120], ["+", 28, 69, 341, 342, 0, 16, 31, 118, 119, 120]] | 1 | 643 | 2 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#inclu... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#inclu... | [["+", 12, 69, 28, 69, 341, 342, 0, 2, 63, 22], ["+", 28, 69, 341, 342, 0, 2, 3, 4, 0, 24], ["+", 28, 69, 341, 342, 0, 2, 3, 4, 0, 25]] | 1 | 892 | 3 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [["+", 28, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 28, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 721 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int N, M, T[5005][2], i, j, x1, x2, y1, y2, R;
int in(int a, int b, int c) { return a <= b && b <= c; }
int cmp(const void *a, const void *b) { return ((int *)a)[0] < ((int *)b)[0]; }
int main() {
scanf("%d%d", &N, &M);
for (i = 0; i < N; i++)
scanf("%d... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int N, M, T[5005][2], i, j, x1, x2, y1, y2, R;
int in(int a, int b, int c) { return a <= b && b <= c; }
int cmp(const void *a, const void *b) { return ((int *)a)[0] > ((int *)b)[0]; }
int main() {
scanf("%d%d", &N, &M);
for (i = 0; i < N; i++)
scanf("%d... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 47]] | 0 | 275 | 2 |
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
int num[5001][5001];
int sum[5001][5001];
int main() {
memset(num, 0, sizeof(num));
memset(sum, 0, sizeof(num));
int N, M;
c... | #include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
int num[5001][5001];
int sum[5001][5001];
int main() {
memset(num, 0, sizeof(num));
memset(sum, 0, sizeof(num));
int N, M;
c... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29]] | 1 | 620 | 3 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, m, x1_, y1_, x2_, y2_;
vector<int> x, y;
int main() {
scanf("%d", &n);
scanf("%d", &m);
x = vector<int>(n);
y = vector<int>(n);
for (int i = 0; i < n; i++) {
scanf("%d", &x[i]);
scanf("%d", &y[i]);
}
for (i... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, m, x1_, y1_, x2_, y2_;
vector<int> x, y;
int main() {
scanf("%d", &n);
scanf("%d", &m);
x = vector<int>(n);
y = vector<int>(n);
for (int i = 0; i < n; i++) {
scanf("%d", &x[i]);
scanf("%d", &y[i]);
}
for (i... | [["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 364 | 2 |
#ifndef ___Class_RangeTree
#define ___Class_RangeTree
// ------ Includes ------ //
#include <algorithm>
#include <limits>
#include <vector>
template <typename Type> class RangeTree {
private:
int size_;
std::vector<std::vector<Type>> dat;
inline int query_(int a, int b, Type x, int k, int l, int r) {
// Fin... | #ifndef ___Class_RangeTree
#define ___Class_RangeTree
// ------ Includes ------ //
#include <algorithm>
#include <limits>
#include <vector>
template <typename Type> class RangeTree {
private:
int size_;
std::vector<std::vector<Type>> dat;
inline int query_(int a, int b, Type x, int k, int l, int r) {
// Fin... | [["-", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22]] | 1 | 770 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) ... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72]] | 1 | 578 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | [["-", 15, 339, 51, 2, 3, 4, 0, 16, 12, 22], ["+", 15, 339, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 985 | 2 |
#include <bits/stdc++.h>
// #define int long long
using namespace std;
using pii = pair<int, int>;
#define REPF(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define REP(i, n) REPF(i, 0, n)
#define ALL(c) begin(c), end(c)
int sum[5100][5100];
signed main() {
int n, m;
cin >> n >> m;
vector<int> x(n), y(n);
vec... | #include <bits/stdc++.h>
// #define int long long
using namespace std;
using pii = pair<int, int>;
#define REPF(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define REP(i, n) REPF(i, 0, n)
#define ALL(c) begin(c), end(c)
int sum[5100][5100];
signed main() {
int n, m;
cin >> n >> m;
vector<int> x(n), y(n);
vec... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 568 | 2 |
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const int inf = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(n + 1), y(n + 1);
vector<pair<int, int>> xy(n + 1);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
xy[i] = make_pair(x[i]... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const int inf = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(n + 1), y(n + 1);
vector<pair<int, int>> xy(n + 1);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
xy[i] = make_pair(x[i]... | [["-", 0, 52, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 118, 28, 69, 28, 22], ["+", 0, 52, 15, 339, 51, 16, 12, 118, 17, 131], ["+", 0, 52, 15, 339, 51, 16, 12, 118, 119, 120]] | 1 | 794 | 4 |
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
#define int long long
#define inf 1000000007
#define pa pai... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
// #define int long long
#define inf 1000000007
#define... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148]] | 1 | 1,918 | 3 |
#include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | [["-", 12, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 31, 22]] | 1 | 750 | 4 |
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define rep(i, m, n) for (int i = (m); i < (n); i++)
#define P pair<int, int>
#define pb push_back
#define mk make_pair
using namespace std;
#define Vec(a) vector<int> a
const int INF = 1 << 20;
const int MOD = 1e9 + 7;
int ... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define rep(i, m, n) for (int i = (m); i < (n); i++)
#define P pair<int, int>
#define pb push_back
#define mk make_pair
using namespace std;
#define Vec(a) vector<int> a
const int INF = 1 << 20;
const int MOD = 1e9 + 7;
int ... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 235 | 1 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int x1, y1, x2, y2;
vector<int> x, y;
vector<int> ix, iy;
vector<vector<int>> dp;
cin >> n >> m;
x.resize(n);
y.resize(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];... |
#include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int x1, y1, x2, y2;
vector<int> x, y;
vector<int> ix, iy;
vector<vector<int>> dp;
cin >> n >> m;
x.resize(n);
y.resize(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 592 | 2 |
def compress(used_x)
x_map = {}
used_x.to_a.sort.each_with_index{|x, i| x_map[x] = i}
x_map
end
class Array
def accum
inject([0]){|a, x| a + [a[-1] + x]}
end
def accum!
(1..size-1).each{|i|
self[i] += self[i-1]
}
self.unshift(0)
end
def accum_2d
ac = map{|r| r.accum}
(1..size-1).each{|i|
(1... | def compress(used_x)
x_map = {}
used_x.to_a.sort.each_with_index{|x, i| x_map[x] = i}
x_map
end
class Array
def accum
inject([0]){|a, x| a + [a[-1] + x]}
end
def accum!
(1..size-1).each{|i|
self[i] += self[i-1]
}
self.unshift(0)
end
def accum_2d
ac = map{|r| r.accum}
(1..size-1).each{|i|
(1... | [["-", 8, 734, 0, 121, 64, 749, 0, 94, 0, 94], ["+", 8, 734, 0, 121, 64, 749, 0, 746, 0, 746]] | 4 | 758 | 8 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll inf = (ll)1e15;
ll dist;
int n, m;
ll s[9], d[9];
ll dif[9][9];
inline void wf(void) {
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (dif[i][k] ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll inf = (ll)1e15;
ll dist;
int n, m;
ll s[9], d[9];
ll dif[9][9];
inline void wf(void) {
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (dif[i][k] ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 1,621 | 6 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | [["-", 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, 147], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 946 | 4 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long n, a[209], sz[209], ret, mod = 1000000007;
long long dp[209][209][209], power[5] = {1, 10, 100, 1000, 10000};
long long solve(vector<long long> E, long long num, bool iszero) {
for (int i = 0; i <= E.size(); i++) {
for (int j... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
long long n, a[209], sz[209], ret, mod = 1000000007;
long long dp[209][209][209], power[5] = {1, 10, 100, 1000, 10000};
long long solve(vector<long long> E, long long num, bool iszero) {
for (int i = 0; i <= E.size(); i++) {
for (int j... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 690 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
int A, T, G, C, N;
map<string, vector<string>> M;
map<string, vector<string>> mem;
const lli mod = 1000000007LL;
lli dp[2][51][51][51];
vector<string> rec(const string &s) {
if (mem.count(s))
return mem[s];
for (int i = 0; i < M[s].size(); +... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
int A, T, G, C, N;
map<string, vector<string>> M;
map<string, vector<string>> mem;
const lli mod = 1000000007LL;
lli dp[2][51][51][51];
vector<string> rec(const string &s) {
if (mem.count(s))
return mem[s];
for (int i = 0; i < M[s].size(); +... | [["+", 0, 246, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 246, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 28, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 28, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 23, 0, 24], ["+", 8, 9, 0, 43, 49, 50, 51, 23, 0, 25]] | 1 | 845 | 6 |
#include <bits/stdc++.h>
using namespace std;
vector<string> key, str;
string t, s;
int ind;
void getkey() {
int x = 0;
for (int i = 1; i < t.size(); i++)
if (!x && t[i] != '.')
x = i;
else if (t[i] == '.')
key.push_back(t.substr(x, i - x)), x = 0;
}
void getstr() {
int f = 0;
ind = 0;
s... | #include <bits/stdc++.h>
using namespace std;
vector<string> key, str;
string t, s;
int ind;
void getkey() {
int x = 0;
for (int i = 1; i < t.size(); i++)
if (!x && t[i] != '.')
x = i;
else if (t[i] == '.')
key.push_back(t.substr(x, i - x)), x = 0;
}
void getstr() {
int f = 0;
ind = 0;
s... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 19], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 18]] | 1 | 499 | 4 |
#include <bits/stdc++.h>
using namespace std;
struct obj {
bool isobj;
string name;
string value;
vector<obj *> ob;
obj *par;
};
int main() {
string query;
vector<string> yaml;
string buf;
for (int i = 0; getline(cin, buf); i++) {
if (i == 0) {
query = buf;
} else {
yaml.push_bac... | #include <bits/stdc++.h>
using namespace std;
struct obj {
bool isobj;
string name;
string value;
vector<obj *> ob;
obj *par;
};
int main() {
string query;
vector<string> yaml;
string buf;
for (int i = 0; getline(cin, buf); i++) {
if (i == 0) {
query = buf;
} else {
yaml.push_bac... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 674 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.