I-See-You

#include <bits/stdc++.h>
using namespace std;
#define PII pair<double,double>

double SQR(double a)
{
    return (a*a);
}

int parent[101];

I-See-You

#include <bits/stdc++.h>
using namespace std;

struct data{
    int u,v;
    int w;
};

int parent[201];

I-See-You

  #include <bits/stdc++.h>
using namespace std;

#define MAX 1005

bool np[MAX];
vector <int> prime;
int prime_size;
int ans[MAX];

I-See-You

#include <bits/stdc++.h>
using namespace std;

#define LL long long
int parent[200001];

struct data
{
    int u,v,w;
};

I-See-You

#include <bits/stdc++.h>
using namespace std;

int parent[1001];
int visited[25001];
struct data
{
    int u,v,w;
};

I-See-You

#include <bits/stdc++.h>
using namespace std;

#define SQR(a) ((a)*(a))
int xx[201];
int yy[201];
int parent[201];
struct data
{
    int u,v,w;

I-See-You

#include <bits/stdc++.h>
using namespace std;

struct data
{
    int u,v,w;
};

int x[505];
int y[505];

I-See-You

#include <bits/stdc++.h>
using namespace std;

#define gc getchar

void scani(int &n)
{
    n = 0;
    char c = 0;
    while(c < 33) c = gc();

I-See-You

#include <bits/stdc++.h>
using namespace std;

#define PII pair <double,double>
#define SQR(a) ((a)*(a))
int parent[1001];

struct data
{
    double dis;

I-See-You

#include <bits/stdc++.h>
using namespace std;

struct data
{
    int u,v,w;
};

int parent[100001];
int forest[100001];