C - Star or Not

You are given a tree with NN vertices and N-1N−1 edges.
The vertices are numbered 1,2,\ldots,N1,2,…,N. The ii-th edge connects Vertex a_i and Vertex b_i.

Determine whether this tree is a star.

Here, a star is a tree where there is a vertex directly connected to all other vertices.

#include<iostream>
using namespace std;
int a[100010][10];
int b[100010]={0};
int main(){
	int t,i=0,cnt=0,k1,k2;
	cin>>t;
	t--;
	while(t--){
		cin>>a[i][1]>>a[i][2];
		b[a[i][1]]++;
		b[a[i][2]]++;
		i++;
	}
	for(int j=1;j<=i+1;j++){
		if(b[j]==i){
			cout<<"Yes"<<endl;
		 	return 0;
		}	
	}
	cout<<"No"<<endl;
	return 0;
} 

数据很可能是漏网之鱼 但还是在virtual judge上苟过了 有点庆幸就复制过来了