The power of bees

We can use the average bee division method, that is to say, half of the nests and middle bees in the bee calculation can be moved to another new hive

{rrrrrrr}

extended data:

precautions:

1. The breeding of Chinese queen bee does not need to be carried out every year. The biggest purpose of the new queen bee is to make the colony stronger, because the new queen bee has great vitality and high oviposition rate. But there are some excellent varieties of queen bee, in the second year, the momentum will not weaken, and the newly bred queen bee can not exceed, so we need to pay attention to observe whether the colony needs to change the queen

Disease resistance refers to the susceptibility and resistance of bee colony to various diseases. The resistance of bee colony to various diseases is usually evaluated by observing the infection and resistance of bee colony to various diseases. If possible, the method of inoculating pathogen can be used for investigation. Because there are many kinds of bee diseases, the resistance to a certain disease should be noted when examining the resistance. It is generally divided into three levels:

strong: it is not infected with the common diseases in feeding areas; Or after infection, the condition is very light, without treatment can be self-healing

medium: it is easy to cure the common diseases in feeding areas after infection

weak: it is easy to be infected with common diseases in feeding areas, and the incidence is serious, or it is more serious for non common diseases

如果user1和user4有关联，user4和user3有关联，user3和user2有关联，user2和user5有关联，那是不是表示user1和user2，user3，user4，user5都有关联

private static HashMap<String,User> userHashMap = new HashMap<String, User>();
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("请输入N(表示有N条登录信息)");
int N;
N = sc.nextInt();
sc.nextLine();
System.out.println("请输入" + N +"条登录信息格式xxx,yyyy");

int index = 0;
while (index < N)
{
String str = sc.nextLine();
if (str.contains(","))
{
String[] details = str.split(",");
if (details.length == 2)
{
if (userHashMap.containsKey(details[0]))
{
User user = userHashMap.get(details[0]);
user.add_Device(details[1]);
}
else
{
User user = new User(details[0]);
user.add_Device(details[1]);
userHashMap.put(details[0],user);
}
index ++;
}
else
{
System.out.println("格式错误");
}
}
else
{
System.out.println("格式错误");
}
}
System.out.println("请输入要查询的用户");
String userName = sc.nextLine();
Set<String> devices = userHashMap.get(userName).getDevices();
Set<String> associated_user = new HashSet<String>();
associated_user.add(userName);
System.out.println(find(devices,associated_user));
System.out.println(userHashMap);
}

public static Set<String> find(Set<String> devices,Set<String> associated_users)
{
for (String device : devices)
{

Iterator it = userHashMap.keySet().iterator();
while (it.hasNext())
{
String key = (String) it.next();
for (String str : userHashMap.get(key).getDevices())
{
if (str.equals(device) && !associated_users.contains(key))
{
associated_users.add(key);
associated_users.addAll(find(userHashMap.get(key).getDevices(),associated_users));
}
}
}
}
return associated_users;
}

static class User
{
private String name;
private Set<String> devices;


public User(String name)
{
this.name = name;
}

public String getName() {
return name;
}

public void setName(String name) {
this.name = name;
}

public Set<String> getDevices() {
return devices;
}

public void setDevices(Set<String> devices) {
this.devices = devices;
}

public void add_Device(String device)
{
if (devices != null)
{
devices.add(device);
}
else
{
devices = new HashSet<String>();
devices.add(device);
}
}


public String toString() {
return "User{" +
"name='" + name + ''' +
", devices=" + devices +
'}';
}
}