Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int main(){
- int n, m = 0; // m это количество висячих вершин дерева
- cin >> n;
- vector<int> degrees(n);
- for (int i = 0; i < n-1; i++){
- int u, v;
- cin >> u >> v;
- degrees[u-1]++;
- degrees[v-1]++;
- }
- for (int i = 0; i < n; i++){
- if (degrees[i] == 1){
- m++;
- }
- }
- if (n == 1){
- cout << 0 << endl;
- }
- else{
- cout << n - m << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement