surinoel

#include <string>
#include <vector>
#include <cstring>

using namespace std;

bool check[31];
bool has[31];

int solution(int n, vector<int> lost, vector<int> reserve) {

surinoel

#include <vector>
#include <iostream>

using namespace std;

void swap(int& a, int& b) {
	int tmp = a;
	a = b;
	b = tmp;
}

surinoel

#include <map>
#include <string>
#include <iostream>

using namespace std;

map<string, int> m1;
map<string, string> m2;

int main(void) {

surinoel

#include <string>
#include <sstream>
#include <iostream>

using namespace std;

// a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z;
bool check[] = { 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 };

int main(void) {

surinoel

#include <queue>
#include <tuple>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

struct bridge {

surinoel

#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

int main(void) {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

surinoel

#include <string>
#include <vector>
#include <cstring>

using namespace std;

int a[5] = { 1, 2, 3, 4, 5 };
int b[8] = { 2, 1, 2, 3, 2, 4, 2, 5 };
int c[10] = { 3, 3, 1, 1, 2, 2, 4, 4, 5, 5 };

surinoel

#include <string>
#include <vector>

using namespace std;

vector<int> solution(int brown, int red) {
	vector<int> answer;
	int b, r;
	b = brown, r = red;
	for (int i = 1; i*i <= r; i++) {

surinoel

#include <vector>
#include <string>
#include <cstring>
#include <algorithm>

using namespace std;

bool check[10000000];
vector<int> totalset;

surinoel

  
#include <iostream>

using namespace std;

int main(void) {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int tc;