A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. 

There is exactly one node, called the root, to which no directed edges point. 
Every node except the root has exactly one edge pointing to it. 
There is a unique sequence of directed edges from the root to each node. 
For example, consider the illustrations below, in which nodes are represented by circles and edges are represented by lines with arrowheads. The first two of these are trees, but the last is not. 

In this problem you will be given several descriptions of collections of nodes connected by directed edges. For each of these you are to determine if the collection satisfies the definition of a tree or not.

Input

The input will consist of a sequence of descriptions (test cases) followed by a pair of negative integers. Each test case will consist of a sequence of edge descriptions followed by a pair of zeroes Each edge description will consist of a pair of integers; the first integer identifies the node from which the edge begins, and the second integer identifies the node to which the edge is directed. Node numbers will always be greater than zero.

Output

For each test case display the line "Case k is a tree." or the line "Case k is not a tree.", where k corresponds to the test case number (they are sequentially numbered starting with 1).

Sample Input

6 8  5 3  5 2  6 4
5 6  0 0

8 1  7 3  6 2  8 9  7 5
7 4  7 8  7 6  0 0

3 8  6 8  6 4
5 3  5 6  5 2  0 0
-1 -1

Sample Output

Case 1 is a tree.
Case 2 is a tree.
Case 3 is not a tree.

回头补得一道题

之前学的时候没有过

主要注意的有以下几点

1. 0 0 是一棵树

2. 有环不是一棵树

3. 并查集必须是一棵树

4. 给的数字不连续（坑）

代码如下：

#include<iostream>
#include<cstring>
#include<set>
const int maxn = 1e6 + 5;
int s[maxn], t[maxn];
int fa[maxn];
bool vis[maxn];
using namespace std;

int find(int x){
    if(fa[x] == x)
        return x;
    return fa[x] = find(fa[x]);
}

int main(){
    int f = 1;
    int u = 1;
    while(1){
        int fl = 0;
        int mi = 9999999, mx = -999;
        int cnt = 1;
        memset(fa, 0, sizeof(fa));
        memset(vis, 0, sizeof(vis));
        set<int> a;
        while(1){
            cin >> s[cnt] >> t[cnt];
            if(s[cnt] == 0 && t[cnt] == 0)
                break;
            if(s[cnt] == -1 && t[cnt] == -1){
                f = 0;
                break;
            }
            mx = max(mx, s[cnt]);
            mx = max(mx, t[cnt]);
            mi = min(mi, s[cnt]);
            mi = min(mi, t[cnt]);
            vis[s[cnt]] = 1;
            vis[t[cnt]] = 1;
            cnt++;
        }
        if(f == 0)
            break;
        //cout << cnt << endl;
        for(int i = mi; i <= mx; i++)
            if(vis[i])
                fa[i] = i;
        for(int i = 1; i < cnt; i++){
            if(find(s[i]) == find(t[i])){
                fl = 1;
            }
            else{
                fa[find(s[i])] = find(t[i]);
            }
        }
        set<int> st;
        for(int i = mi; i <= mx; i++){
            if(vis[i])
                st.insert(find(i));
        }
        if(st.size() != 1)
            fl = 1;
        if(mi == 9999999 && mx == -999)
            fl = 0;
        cout << "Case " << u++;
        if(fl == 0)
            cout << " is a tree." << endl;
        else
            cout << " is not a tree." << endl;
     }
}