euzmin

摘要： 2359: 巴什博弈？ 题目描述 有n个石子，有两人轮流从中取石子，最少a个最多b个，谁没得取（即当轮到他取是已经没有石子可以取了,也就是说此时石子数量小于a）谁赢，现在，LLM先取，问你LLM能赢吗 有n个石子，有两人轮流从中取石子，最少a个最多b个，谁没得取（即当轮到他取是已经没有石子可以取了, 阅读全文

摘要： Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but 阅读全文

摘要： Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whe 阅读全文

摘要： Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph 阅读全文

摘要： 证明详细的博客：http://blog.csdn.net/hillgong/article/details/4214327 模板： 1 #include<iostream> 2 #include<algorithm> 3 #include<queue> 4 #include<cstdio> 5 #i 阅读全文

摘要： The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become t 阅读全文

摘要： A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time 阅读全文

摘要： Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He i 阅读全文

摘要： Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now y 阅读全文

摘要： #include #define inf 1q; bool vis[100000]; memset(vis,0,sizeof vis); vis[s]=1; dis[s]=0; q.push(s); while(!q.empty()){ int f=q.front(); q.pop(); vis[f]... 阅读全文