nyoj 网络的可靠性

#include<stdio.h>#include<math.h>#include<string.h>int num[10005];int main(){int n;while(~scanf("%d",&n)){memset(num,0,sizeof(num));for(int i=0;i<n-1;i++){int x,y;scanf("%d %d",&x,&y);num[x]++;//计算度 num[y]++;}int f=0;for(int i=1;i<=n;i++){//筛选度为1的基站 if(num[i]==1) f++;}if(f%2==0) printf("%d\n",f/2);else printf("%d\n",f/2+1);}return 0;}