bblss123的博客

HDU 5382 GCD?LCM! Solution

Description Mr. Chopsticks keeps N monsters, numbered from 1 to N. In order to train them, he holds N * (N - 1) / 2 competitions and asks the monsters to fight with each other. Any two monsters fight

The yearly Multi-University Training Contest is coming, and ?? had already prepared an interesting and challenging problem for all those intelligent brains. However, when he told teammates about his “wonderful

?? has got a treasure map,the treasure map consists of N nodes,there are N-1 bidirectional roads, Each of them connects a pair of nodes,the N nodes are all connected by the N-1 bidirectional roads.?? can travel

Little White learned the greatest common divisor, so she plan to solve a problem: given x,n,query ∑ni=1∑nj=1gcd(xi−1,xj−1)

The Arithmetic Coconut Median company has n employees. Every person has a direct supervisor except the boss. Boss’s number is 1. Everyone has a Ability Value Ai. The wage of person i is the Median of Ability Va

2016 Multi-University Training Contest 1 1006 Solution

2016 Multi-University Training Contest 2 1001 Solution

2016 Multi-University Training Contest 1 1004 Solution

DescriptionExplorer Bo likes exploring mazes around the world.Now he wants to explore a new maze. The maze has N rooms connected with N−1 roads of length 1 so that the maze looks like a tree. Explore

The ACM kingdom has N cities, numbered from 1 to N. The capital is numbered 1. There are N – 1 roads each connecting two cities in the kingdom such that there exactly one path between any pair of cities.