Solution of Uva 459 - Graph Connectivity

Solution of  UVa 459 - Graph Connectivity   #include<bits/stdc++.h> using namespace std; int p[100]; int prt(int z){ if(p[z]==z) return z; else return p[z]=prt(p[z]); } int main() { int i, t; scanf("%d\n", &t); while(t--){ int x, m[50]={0}, mx=0, y, n, z; string s, a; set<int>ss; scanf("\n"); getline(cin, a); n=(int)a[0]-64; for(i=1; i<=n; i++) p[i]=i; while(getline(cin, s)){ if(s.size()==0) break; else{ x=(int)s[0]-64; y=(int)s[1]-64; p[prt(y)]=prt(x); } } for(i=1; i<=n; i++) { p[i]=prt(i); ss.insert(p[i]); } cout<<ss.size()<<endl; if(t)cout<<endl; } return 0; }