NYOJ 170 Network Reliability

Network Reliability time limit:MS | Memory limit:65535 KB Difficulty:3

Describe

Company A is a global provider of Internet Solutions and a senior sponsor of the 2010 World Expo. It will provide advanced network collaboration technology to showcase its "smart + connected" concept of life, while providing visitors with high-quality personal experience and interaction, "information and communication, urban Dream" as the theme throughout. With the help of the fantastic theatrical screens and special effects, the application of ICT is presented, and through vivid stories, the audience is presented with unlimited future social prospects.

For this reason, company A has established a video communication system for the N regions of the Expo Park, each of which establishes a base station, numbered sequentially 1,2,3...,n. Video services are provided for visitors to each region through the communication lines between the base stations.

It is known that a number of fiber optic communication lines have been installed between the base stations, which cover all areas, that is, any two zones are capable of video transmission. But in order to save cost, currently only N-1 line is laid, and in order to reduce the information transmission load of each base station, there are up to three fiber optic communication lines connected with each base station.

However, during the trial operation of the communication system, a company discovered that when a base station fails, it can cause the transmission of information between other regions. In order to improve the reliability of the communication network, a company is prepared to lay a new number of fiber optic lines between the base station, so that any one base station failure, the other base stations can still communicate.

As the cost of laying lines is expensive, company a hopes that the new fiber-optic lines will be as few as possible. A company request Dr. Kong to complete this mission.

Input

There are multiple sets of test data, with EOF as the end flag.
First line: n means there are n base stations
Next there are N-1 lines: x y indicates that the X base Station and the Y base station are connected directly
1<=n<=10000

Output

outputs an integer that indicates the minimum number of new fibre lines to be laid

Sample input

81 33 25 35 4 5 62 72 8

Sample output

3

The problem: Because n points in the topic n-1 edge just can connect all the edges, so that the degree of more than 1 points to remove a connected edge can still be connected, find the number of points of 1 degrees sum, (sum+1)/2 is the result

If n points are said to be greater than n-1 edges, they must be solved with a double-connected algorithm

#include <stdio.h> #include <string.h> #include <vector> #include <map> #include <queue># include<stack> #include <cstdio> #include <string> #include <math.h> #include <algorithm > #define LL Long long#define PI atan (1.0) *4#define DD double#define MAX 20000#define mod 10003#define Dian 1.000000011# Define INF 0x3f3f3fusing namespace Std;int du[max];int main () {int n,m,j,i,t,k,a,b;while (scanf ("%d", &n)!=eof) { memset (du,0,sizeof (du)), for (i=1;i<n;i++) {scanf ("%d%d", &a,&b);d u[a]++;d u[b]++;} int Sum=0;for (i=1;i<=n;i++) {if (du[i]==1)    

　　

NYOJ 170 Network Reliability