虫子的生活——C++poj原题

#include <iostream>
#include <stdio.h>
using namespace std;
int in[5000] = {};
int find_father(int x)
{
if (in[x] == x) return x;
in[x] = find_father(in[x]);
return in[x];
}
void make_pair(int x, int y)
{
in[find_father(y)] = find_father(x);
}
bool res;
void printRes(void)
{
if (res) printf("No suspicious bugs found!\n");
else printf("Suspicious bugs found!\n");
}
int main()
{
int n;
int in1, in2;
scanf("%d", &n);
for (int z = 1; z <= n; z++)
{
res = true;
int in_num, ex_num;
scanf("%d %d", &in_num, &ex_num);