yming0221

摘要： http://poj.org/problem?id=3615题意：找一条路径，使得这条路径上最大的两节点权值在所有可能路径中最短，并求出这个值实际上就是Floyd算法，只不过这里不是求的最短路径长度，而是路径上两相邻节点之间的最大距离Cow HurdlesTime Limit:1000MSMemory Limit:65536KDescriptionFarmer John wants the cows to prepare for the county jumping competition, so Bessie and the gang are practicing jumping over 阅读全文

摘要： http://poj.org/problem?id=3132题意就是要求一个数可以分解成指定数个素数的和的种数方法是参考网上的大牛的做法，学习了！Sum of Different PrimesTime Limit:5000MSMemory Limit:65536KDescriptionA positive integer may be expressed as a sum of different prime numbers (primes), in one way or another. Given two positive integersnandk, you should count t 阅读全文