思维
A. Goodbye, Ziyin!
https://codeforc.es/gym/103428/problem/A
题目给出的是一个树,但是如果不是二叉树就寄,特判就好
手慢无
#include<bits/stdc++.h>
//#include<gl/glut.h>
//#include<ctime>
#define ll long long
#define mes(a,b) memset(a,b,sizeof(a))
#define ctn continue
#define ull unsigned long long
#pragma warning(disable:4996)
#define tgg cout<<"---------------"<<endl;
const ll linf = 9223372036854775807;
const int inf = 0x3f3f3f3f;
using namespace std;
const double pi = acos(-1);
const ll maxn = 1e5 + 4;
const int mod = 31011;
const double eps = 1e-8;
const ull p = 131;
const ull pc = 13331;
inline ll gcd(int a, int b) {
while (b ^= a ^= b ^= a %= b);
return a;
}
int deg[1000008];
int main(int argc, char* argv[]) {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t;
cin >> t;
for (int i = 1; i <= t - 1; i++) {
int x, y;
cin >> x >> y;
deg[x]++;
deg[y]++;
}
int num = 0;
bool fal = 0;
for (int i = 1; i <= t; i++) {
if (deg[i] <= 2 && deg[i] >= 1) {
num++;
}
if (deg[i] >= 4) {
fal = 1;
}
}
if (fal) {
cout << 0 << endl;
}else
cout << num << endl;
return 0;
}