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;

#define LL long long
int parent[200001];

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

I-See-You

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

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

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

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;

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

int parent[201];

I-See-You

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

#define INF INT_MAX
int yoo[105][105];

int main()
{
    int node,edge,query,qq=1;
    bool line = false;

I-See-You

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

#define INF INT_MAX
int dis[101][101];

int main()
{
    int node,edge,qq=1;
    while(scanf("%d %d",&node,&edge))

I-See-You

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

int parent[800];
int x[800];
int y[800];
int visited[800][800];

struct data
{

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;

int x[1000];
int y[1000];
int parent[1000];

struct data
{
    int u,v,w;