摘要：
转载自：https://blog.csdn.net/riba2534/article/details/78483578 致敬大佬 何为博弈论 那就是若有多个人进行博弈，假设他们都足够聪明（能力已经相当于计算机了），在他们都没有失误并采取最优策略后，一定有一个人胜出，在知道初状态及规则的情况下，求解最 阅读全文
摘要：
题目描述 Alice and Bob are in their class doing drills on multiplication and division. They quickly get bored and instead decide to play a game they inven 阅读全文
摘要：
Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each oth 阅读全文
摘要：
Description A factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products ar 阅读全文
摘要：
Description The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk 阅读全文
摘要：
Description Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A 阅读全文
摘要：
[提交][状态][讨论版] 题目描述 修罗王和邪狼被关进监狱，该监狱的地下秩序实际被不少暗势力所把持，这些暗势力根据其实力不同，划分出了大大小小的势力范围。具体划分方式是这样的：监狱是一个给定的矩形，每一个暗势力的势力范围都必须是一个正方形，划分时，最大的暗势力尽可能多地从矩形中划分一块正方形，接下 阅读全文
摘要：
题目描述 有一条河，左边一个石墩(A区)上有编号为1，2，3，4，…，n的n只青蛙，河中有k个荷叶(C区)，还有h个石墩(D区)，右边有一个石墩(B区)，如下图2—5所示。n只青蛙要过河(从左岸石墩A到右岸石墩B)，规则为： (1)石墩上可以承受任意多只青蛙，荷叶只能承受一只青蛙(不论大小)； (2 阅读全文
摘要：
Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There a 阅读全文
摘要：
Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 阅读全文