pancanin

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_set>

static const int dim = 10;

std::string readLine(std::istream& in) {
	std::string str;

pancanin

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_set>

std::string readLine(std::istream& in) {
	std::string str;
	std::getline(in, str);
	return str;

pancanin

#include <iostream>
#include <fstream>
#include <string>
#include <ctype.h>
#include <vector>
#include <sstream>

using namespace std;

struct Game {

pancanin

#include <iostream>
#include <fstream>
#include <string>
#include <ctype.h>
#include <math.h>

using namespace std;

int main()
{

pancanin

#include <iostream>
#include <vector>
#include <math.h>
#include <unordered_map>
#include <string>
#include <fstream>
#include <stack>
#include <unordered_set>
#include <queue>
#include <stack>

pancanin

// Example program
#include <iostream>
#include <string>
#include <vector>
#include <math.h>

using namespace std;

struct Point {
    int x;

pancanin

#include <iostream>
#include <vector>
#include <math.h>
#include <unordered_map>
#include <string>
#include <fstream>
#include <stack>
#include <unordered_set>
#include <queue>
#include <stack>

pancanin

#include <iostream>
#include <vector>
#include <math.h>
#include <unordered_map>
#include <string>
#include <fstream>
#include <stack>
using namespace std;

unordered_map<int, vector<int>> graph;

pancanin

#include <iostream>
#include <vector>
#include <future>
#include <unordered_map>
#include <unordered_set>

using namespace std;

/* A DS for finding the root node of a vertex in a tree. 
!Does not keep track of the original tree structure so it cannot be reconstructed exactly. */

pancanin

#include <iostream>
#include <cstdint>
#include <vector>
#include <limits>
#include <cstring>
#include <sstream>
#include <chrono>
#include <set>
#include <stack>
#include <map>