UVA_247.cpp

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define PF push_front
#define P push
#define INC(i,a,b) for (ll i = a; i <= b; i++)
#define DEC(i,b,a) for (ll i = b; i >= a ; i--)
#define inf LLONG_MAX
#define neginf LLONG_MIN
#define mod  1000000007
#define eps 1e-9
typedef ostringstream OS ;
typedef stringstream SS ;
typedef long long ll ;
typedef unsigned long long ull;
typedef pair < ll , ll > PLL ;
typedef pair < char,ll > PCL ;
typedef deque < double > DD ;
typedef deque < PCL > DCL ;
typedef deque < ll > DL ;
typedef deque < PLL > DLL ;
typedef deque < char > DC ;
typedef deque < string > DS ;
typedef vector < double > VD;
typedef vector < PCL > VCL ;
typedef vector < ll > VL;
typedef vector < PLL > VLL ;
typedef vector < char > VC ;
typedef vector < string > VS ;
typedef map < ll ,ll > MLL ;
typedef map < char,ll > MCL;
typedef map < ll,char > MLC;
typedef map < string,ll> MSL;
typedef priority_queue < PLL > PQLL ;
typedef priority_queue < ll > PQL ;
typedef stack < ll > SKL ;
typedef stack < PLL > SKLL ;
typedef queue < ll > QL ;
typedef queue < PLL > QLL ;
typedef set < ll > SL ;
typedef set < PLL > SLL ;
typedef set < char > SC ;
 
string numtostr(ll n) {
     OS str1 ;
     str1 << n ;
     return str1.str();
}
ll strtonum(string s) {
     ll x ;
     SS str1(s);
     str1 >> x ;
     return x ;
}
ll GCD(ll a, ll b) {
    if ( b == 0 ) return a ;
    else return GCD(b,a%b);
}
ll LCM(ll a , ll b) {
    ll gcd = GCD(a,b);
     return (a/gcd)*b ;
}
ll n,m ;
vector < VL > graph ;
vector < VL > rgraph ;
VL visited ;
VL topsort ;
map < string,ll > mymap1 ;
map < ll,string> mymap2 ;
map < PLL,ll > existence ;
VL component ;
void setting(ll n) {
    graph.clear() ;
    graph.resize(n+3);
    rgraph.clear();
    rgraph.resize(n+3);
    visited.clear();
    visited.resize(n+3);
    topsort.clear();
    mymap1.clear() ;
    mymap2.clear();
    existence.clear();
}
void dfs1(ll node) {
    visited[node] = 1 ;
    for( ll child : graph[node]) 
        if ( !visited[child]) dfs1(child) ;
    topsort.PB(node);
}
void dfs2(ll node) {
    visited[node] = 1 ;
    component.PB(node);
    for( ll child : rgraph[node]) 
        if ( !visited[child]) dfs2(child) ;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll c = 0 ;
    while(1) {
        cin >> n >> m ;
        if (n == 0 && m == 0) break ;
        setting(n);
        if(c) cout << endl;
        ll cnt = 0 ;
        while(m--) {
            char c ;
            string s1,s2 ;
            cin >> s1 >> s2 ;
            if ( mymap1[s1] == 0) {
                mymap1[s1] = ++cnt ;
                mymap2[cnt] = s1 ;
            }
            if ( mymap1[s2] == 0) {
                mymap1[s2] = ++cnt ;
                mymap2[cnt] = s2 ;
            }
            if ( existence[{mymap1[s1],mymap1[s2]}] == 0) {
                graph[mymap1[s1]].PB(mymap1[s2]);
                rgraph[mymap1[s2]].PB(mymap1[s1]);
                existence[{mymap1[s1],mymap1[s2]}] = 1 ;
            }
        }
        INC(i,1,n) {
            if ( !visited[i]) {
                dfs1(i);
            }
        }
        reverse(topsort.begin(),topsort.end());
        visited.clear();
        visited.resize(n+3,0);
        cout << "Calling circles for data set " << ++c << ":" << endl;
        INC(i,0,topsort.size()-1) {
            if ( !visited[topsort[i]]) {
                dfs2(topsort[i]);
                if( component.size() > 1) INC(j,0,component.size()-2) cout << mymap2[component[j]] <<", " ;
                cout << mymap2[component[component.size()-1]] << endl;
                component.clear();
            }
        }

    }   
 
    return 0 ;
}