A - Cthulhu CodeForces - 103B (并查集)

…Once upon a time a man came to the sea. The sea was stormy and dark. The man started to call for the little mermaid to appear but alas, he only woke up Cthulhu…

Whereas on the other end of the world Pentagon is actively collecting information trying to predict the monster’s behavior and preparing the secret super weapon. Due to high seismic activity and poor weather conditions the satellites haven’t yet been able to make clear shots of the monster. The analysis of the first shot resulted in an undirected graph with n vertices and m edges. Now the world’s best minds are about to determine whether this graph can be regarded as Cthulhu or not.

To add simplicity, let’s suppose that Cthulhu looks from the space like some spherical body with tentacles attached to it. Formally, we shall regard as Cthulhu such an undirected graph that can be represented as a set of three or more rooted trees, whose roots are connected by a simple cycle.

It is guaranteed that the graph contains no multiple edges and self-loops.

Input
The first line contains two integers — the number of vertices n and the number of edges m of the graph (1 ≤ n ≤ 100, 0 ≤ m ≤ ).

Each of the following m lines contains a pair of integers x and y, that show that an edge exists between vertices x and y (1 ≤ x, y ≤ n, x ≠ y). For each pair of vertices there will be at most one edge between them, no edge connects a vertex to itself.

Output
Print “NO”, if the graph is not Cthulhu and “FHTAGN!” if it is.

Example
Input
6 6
6 3
6 4
5 1
2 5
1 4
5 4
Output
FHTAGN!
Input
6 5
5 6
4 6
3 1
5 1
1 2
Output
NO
题目大意：给你一个无向图判断是否是怪兽 怪兽的标准是无向图成环
而且所有节点连在环上：
解题思路：用并查集判断是否成环并查集将不同集合合并在此题中就是将不同的图连接当出现某边的两点来自同一张图说明此时成环。如果多次出现两点来自同张图那说明边并没有全连在同一个环上。
ac代码：

#include <iostream>
#include <stdio.h>
using namespace std;
int fa[1010];
int find(int x)
{
    if(x != fa[x])
        fa[x] = find(fa[x]);
    return fa[x];
}
int main()
{
    int n, m;
    while(~scanf("%d%d",&n,&m)){
        for(int i = 1; i <= n; i++)
            fa[i] = i;
        int flag, a, b, num, flag2;
        flag = num = flag2 = 0;
        for(int i = 0; i < m; i++){
            cin >> a >> b;
            if(flag2)
                continue;
            int px = find(a), py = find(b);
            if(px != py){
                num++;
                fa[px] = py;
            }
            else{
                if(!flag){
                    num++;
                    flag = 1;
                }
                else
                    flag2 = 1;
            }
        }
        if(!flag2 && flag && num == n)
            cout << "FHTAGN!\n";
        else
            cout << "NO\n";
    }
    return 0;
}