算法竞赛入门经典训练指南-第二章
文章平均质量分 87
zhaosdfa
这个作者很懒,什么都没留下…
展开
-
UVa 11916 - Emoogle Grid (离散对数)
Emoogle Grid You have to color an M x N ( 1M, N108) two dimensional grid. You will be provided K ( 2K108) different colors to do so. You will also be provided a list of B ( 0B500)原创 2014-08-19 21:05:52 · 462 阅读 · 0 评论 -
UVaLIve 2889 | LA 2889 | UVa 12050 - Palindrome Numbers (组合数学)
A palindrome is a word, number, or phrase that reads the same forwards as backwards. For example, the name "anna" is a palindrome. Numbers can also be palindromes (e.g. 151 or 753357). Additionally原创 2014-08-27 20:34:49 · 1032 阅读 · 0 评论 -
UVa 11137 - Ingenuous Cubrency (递推 DP 多重背包 )
UVA - 11137Ingenuous CubrencyTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem原创 2014-08-15 16:07:10 · 651 阅读 · 0 评论 -
UVa 10791 - Minimum Sum LCM (数论 推理)
Minimum Sum LCMCrawling in process...Description Minimum Sum LCM LCM (Least Common Multiple) of a set of integers is defined as the minimum n原创 2014-08-28 09:07:37 · 547 阅读 · 0 评论 -
UVa 11806 - Cheerleaders (组合数学 容斥原理)
CheerleadersTime Limit: 2000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionCCheerleaders I原创 2014-08-15 13:39:44 · 554 阅读 · 0 评论 -
UVaLive ( LA ) 3516 - Exploring Pyramids (DP 递推)
Root 3516 - Exploring PyramidsRegionals 2005 >> Europe - NortheasternTime limit: 3.000 seconds原创 2014-08-16 20:40:22 · 469 阅读 · 0 评论 -
UVa 11375 - Matches (递推 JAVA 高精度)
UVA - 11375MatchesTime Limit: 2000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem E:原创 2014-08-15 15:19:40 · 575 阅读 · 0 评论 -
UVa 11361 - Investigating Div-Sum Property (数位DP)
UVA - 11361Investigating Div-Sum PropertyTime Limit: 4000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] Description原创 2014-08-17 10:59:39 · 408 阅读 · 0 评论 -
UVa 11426 - GCD - Extreme (II) (数学 欧拉函数)
UVA - 11426GCD - Extreme (II)Time Limit: 10000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem JGCD Extreme原创 2014-08-18 08:15:48 · 797 阅读 · 0 评论 -
UVa 11754 - Code Feat (中国剩余定理 枚举)
CCode Feat Hooray! Agent Bauer has shot the terrorists, blown up the bad guy base, saved the hostages, exposed the moles in the government, prevented an environmental cata原创 2014-08-18 21:28:40 · 1685 阅读 · 0 评论 -
UVa 10870 - Recurrences (矩阵构造 矩阵快速幂)
RecurrencesTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem ARecurrencesInput: standard in原创 2014-09-17 16:33:57 · 628 阅读 · 0 评论 -
UVA 11427 - Expect the Expected (概率DP 期望)
UVA - 11427Expect the ExpectedTime Limit: 2000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem AExpect the原创 2014-09-17 21:13:02 · 629 阅读 · 0 评论 -
UVa 11038 - How Many O's? (组合数学 数位统计)
UVA - 11038How Many O's?Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem E: How many 0's?A Bened原创 2014-10-19 17:56:27 · 736 阅读 · 0 评论 -
UVa 10883 - Supermean (杨辉三角 通过取对数解决大数除大数)
UVA - 10883SupermeanTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem FSupermeanTime Limit: 2 s原创 2014-10-20 17:56:49 · 729 阅读 · 0 评论 -
UVa 11609 - Teams (组合数学)
TeamsInput: Standard InputOutput: Standard Output In a galaxy far far away there is an ancient game played among the planets. The specialty of the game is that there is no limitation on the nu原创 2014-08-27 16:33:13 · 576 阅读 · 0 评论 -
UVa 11489 - Integer Game (简单博弈 脑筋急转弯)
IInteger Game Two players, S and T, are playing a game where they make alternate moves. S plays first. In this game, they start with an integer N. In each move, a player rem原创 2014-08-27 21:32:51 · 524 阅读 · 0 评论 -
UVa 11401 - Triangle Counting (组合数学)
Triangle CountingTime Limit: 1000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem GTriangle CountingInput:原创 2014-08-15 08:47:55 · 562 阅读 · 0 评论 -
UVa 11722 - Joining with Friend (概率 数形结合)
I I U P C 2 0 0 9 Problem J: Joining with Friend You are going from Dhaka to Chittagong by train and you came to know one of your old friends is going from ci原创 2014-08-20 15:50:58 · 878 阅读 · 0 评论 -
UVa 11762 - Race to 1 (概率 期望 DP 马尔可夫过程)
UVA - 11762Race to 1Time Limit: 10000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionBRace to 1Inpu原创 2014-09-18 10:32:39 · 875 阅读 · 0 评论 -
UVa 11021 - Tribles (概率DP)
TriblesTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem ATribblesInput: Standard InputOu原创 2014-08-20 10:52:00 · 887 阅读 · 0 评论 -
UVa 11388 - GCD LCM (简单数论)
I I U C O N L I N E C O N T E S T 2 0 0 8Problem D: GCD LCMInput: standard inputOutput: standard output The GCD of two positive integers is the larges原创 2014-08-22 16:28:36 · 496 阅读 · 0 评论 -
UVa 11889 - Benefit (数论)
Benefit Recently Yaghoub is playing a new trick to sell some more. When somebody gives him A Tomans, he who never has appropriate changes, asks for B Tomans such that lowest common mul原创 2014-08-23 17:11:20 · 548 阅读 · 0 评论 -
UVa 10780 - How do you add? (简单DP 组合数学 隔板法)
Problem A: How do you add?Larry is very bad at math - he usually uses a calculator, which worked well throughout college. Unforunately, he is now struck in a deserted island with his good buddy Ry原创 2014-08-24 17:19:24 · 686 阅读 · 0 评论 -
UVa 10828 - Back to Kernighan-Ritchie (概率DP 期望 高斯消元)
UVA - 10828Back to Kernighan-RitchieTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem IBack t原创 2014-09-20 23:50:17 · 604 阅读 · 0 评论 -
UVa 10780 - Again Prime? No time (质因式分解)
The problem statement is very easy. Given a number n you have to determine the largest power of m, not necessarily prime, that dividesn!. Input The input file consists of several test cases.原创 2014-08-26 08:12:25 · 876 阅读 · 0 评论 -
UVa 11538 - Chess Queen (组合数学)
Chess QueenTime Limit: 2000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem AChess Queen Input: Standard I原创 2014-08-14 20:19:27 · 596 阅读 · 0 评论 -
UVa 11076 - Add Again (排列之和 组合数学)
Problem CAdd AgainInput: Standard InputOutput: Standard Output Summation of sequence of integers is always a common problem in Computer Science. Rather than computing blindly, some intellige原创 2014-08-27 14:10:58 · 607 阅读 · 0 评论 -
UVa 10892 - LCM Cardinality (因式分解 组合数学)
Problem FLCM CardinalityInput: Standard InputOutput: Standard OutputTime Limit: 2 Seconds A pair of numbers has a unique LCM but a single number can be the LCM of more than one possible pa原创 2014-08-26 10:34:41 · 631 阅读 · 0 评论 -
UVa 11752 - The Super Powers (数论)
AThe Super Powers We all know the Super Powers of this world and how they manage to get advantages in political warfare or even in other sectors. But this is not a politica原创 2014-08-27 15:18:29 · 738 阅读 · 0 评论 -
UVa 11461 - Square Numbers (水题)
ASquare NumbersInput: Standard InputOutput: Standard Output A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some squ原创 2014-08-28 09:16:34 · 639 阅读 · 0 评论 -
UVa 10673 - Play with Floor and Ceil (扩展欧几里得)
UVA - 10673Play with Floor and CeilTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem APlay with Floor and Ceil原创 2014-10-22 12:40:50 · 618 阅读 · 0 评论