OJ Board

#include<cstdio>
#include<iostream>
#include<map>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
#define x first
#define y second
#define MAX 110

typedef pair<double,double>pii;
pii point[MAX];

int parent[MAX];

struct edge
{
int a,b;
double w ...

#include<cstdio>
#include<iostream>
#include<string>
#include<vector>
#include<cstring>
using namespace std;
#define MAX 500

int parent[MAX];

int find_r(int a);
void make_set(int N);
void Union(int a, int b);
int disjoint_count(int n);



void make_set(int N)
{
for(int i=1;i<=N;i++)
parent =i ...

Hello, For the AC output given here ..
1
10 11 //Only one edge
//input
1
10 11
10 0 10 1 10 2 12 1 10 0 10 1 10 2 0 0
0


Case 147: 1 nodes not reachable from node 10 with TTL = 0.
Case 148: 0 nodes not reachable from node 10 with TTL = 1. //here the first one
Case 149: 0 nodes not reachable from ...