2014年08月_zhaosdfa

原创 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 625

原创 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 535

原创 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 510

原创 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 1007

原创 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 562

原创 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 713

原创 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 590

原创 HDU 4497 - GCD and LCM （质因式分解　GCD LCM）

GCD and LCMTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 986 Accepted Submission(s): 459Problem DescriptionGiven two posi

2014-08-27 10:05:40 640

原创 [noip2001普及(初中)组] 第二题《最大公约数和最小公倍数问题》解题报告

题目描述Description输入二个正整数x0,y0(2条件: 1.P,Q是正整数2.要求P,Q以x0为最大公约数,以y0为最小公倍数.试求:满足条件的所有可能的两个正整数的个数.输入描述Input Description二个正整数x0,y0输出描述Output Description满足条件的所有可能的两个正整数的个数

2014-08-26 21:28:06 3044

原创 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 595

原创 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 865

原创 HDU 4966 - GGS-DDU （最小树形图）

多校综合排名前25名的学校请发送邮件到[email protected],告知转账信息（支付宝或者卡号） GGS-DDUTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 310 Accepted Submis

2014-08-25 11:44:41 665

原创 UVa 10780 - How do you add? （简单ＤＰ　组合数学　隔板法）

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 677

原创 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 538

原创 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 482

原创 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 827

原创 UVa 11021 - Tribles （概率ＤＰ）

TriblesTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem ATribblesInput: Standard InputOu

2014-08-20 10:52:00 872

原创 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 453

原创 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 1661

原创 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 778

原创 HDU 4946 - Area of Mushroom （计算几何　凸包）

Area of MushroomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1748 Accepted Submission(s): 423Problem DescriptionTeache

2014-08-17 16:08:23 521

原创 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 393

原创 UVaLive ( LA ) 3516 - Exploring Pyramids （DP 递推）

Root 3516 - Exploring PyramidsRegionals 2005 >> Europe - NortheasternTime limit: 3.000 seconds

2014-08-16 20:40:22 459

原创 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 637

原创 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 567

原创 UVa 11806 - Cheerleaders （组合数学容斥原理）

CheerleadersTime Limit: 2000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionCCheerleaders I

2014-08-15 13:39:44 537

原创 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 545

原创 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 580

原创 HDU 2476 | UVALive 4394 - String painter （区间ＤＰ）

String painterTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1625 Accepted Submission(s): 728Problem DescriptionThere ar

2014-08-13 21:59:56 610

原创 UVaLive 4327 | POJ 3926 - Parade （单调队列优化DP）

ParadeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 658 Accepted: 151DescriptionPanagola, The Lord of city F likes to parade very much. He always insp

2014-08-13 14:50:46 933

原创 HDU 4939 - Stupid Tower Defense （DP）

Stupid Tower DefenseTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 537 Accepted Submission(s): 143Problem DescriptionFSF

2014-08-12 21:39:31 919

原创 UVALive 2038 - Strategic game （经典树形DP）

Strategic gameTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionBob enjoys playing computer

2014-08-11 15:56:06 534

原创 UVa 10817 - Headmaster's Headache （简单DP 状态压缩）

Headmaster's HeadacheTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem D:

2014-08-11 14:15:24 494

原创 UVa 10564 - Paths through the Hourglass （简单DP）

Paths through the HourglassTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem FPaths through

2014-08-11 10:57:20 463

原创 POJ 1018 - Communication System （枚举）

Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23066 Accepted: 8198DescriptionWe have received an order from Pizoor Communications

2014-08-10 16:20:14 437

原创 POJ 1273 - Drainage Ditches　（网络流）

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55767 Accepted: 21378DescriptionEvery time it rains on Farmer John's fields, a pond form

2014-08-10 13:32:08 369

原创 URAL 1057 - Amount of Degrees （入门数位ＤＰ）

Amount of DegreesTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionCreate a code to determi

2014-08-10 10:30:22 380

原创 HDU 4923 - Room and Moor （贪心）

Room and MoorTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 891 Accepted Submission(s): 273Problem DescriptionPM Room

2014-08-09 20:51:04 444

原创 HDU 4912 - Paths on the tree （LCA 贪心）

Paths on the treeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 600 Accepted Submission(s): 210Problem Descriptionbobo

2014-08-08 14:11:46 567

原创 HDU 2586 - How far away ？（LCA）

How far away ？Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5037 Accepted Submission(s): 1907Problem DescriptionThere are n hou

2014-08-06 16:12:28 564

算法导论中文版

空空如也