数学
文章平均质量分 86
zhaosdfa
这个作者很懒,什么都没留下…
展开
-
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 · 740 阅读 · 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 · 1034 阅读 · 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 · 599 阅读 · 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 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 · 642 阅读 · 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 · 563 阅读 · 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 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 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 评论 -
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 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 评论 -
HDU 5015 - 233 Matrix (矩阵构造 矩阵快速幂)
233 MatrixTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 644 Accepted Submission(s): 386Problem DescriptionIn our daily lif原创 2014-09-17 19:02:07 · 523 阅读 · 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 · 630 阅读 · 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 评论 -
UVaLive 4847 - Binary Search Tree (与BST有关的计数问题)
UVALive - 4847Binary Search TreeTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionA bin原创 2014-10-07 13:24:25 · 1155 阅读 · 0 评论 -
POJ 2778 - DNA Sequence (AC自动机 矩阵快速幂)
DNA SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11450 Accepted: 4357DescriptionIt's well known that DNA Sequence is a sequence only contai原创 2014-08-04 14:30:40 · 475 阅读 · 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 · 738 阅读 · 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 评论 -
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 · 678 阅读 · 0 评论 -
TYVJ 1022 进制转换
进制转换背景 Background太原成成中学第3次模拟赛 第2道描述 Description对于十进制整数N,试求其-2进制表示。例如,因为 1*1 + 1*-2 + 1*4 + 0*-8 +1*16 + 1*-32 = -13 ,所以(-13)_10 = (110111)_-2。输入格式 InputFo原创 2013-12-15 19:07:47 · 1044 阅读 · 0 评论 -
HDU 1214 - 圆桌会议
圆桌会议Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2931 Accepted Submission(s): 2040Problem DescriptionHDU ACM集训队的队员在暑假集训时经常要讨论自原创 2014-07-02 15:55:45 · 451 阅读 · 0 评论 -
2014百度之星初赛第一轮 HDU 4828 - Grids (卡特兰数 逆元)
GridsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 394 Accepted Submission(s): 151Problem Description 度度熊最近很喜欢玩游戏。这一天他在纸上画了一个原创 2014-07-23 19:45:00 · 760 阅读 · 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 · 1688 阅读 · 0 评论 -
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 评论 -
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 · 889 阅读 · 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 · 881 阅读 · 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 · 877 阅读 · 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 · 498 阅读 · 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 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 · 607 阅读 · 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 · 689 阅读 · 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 评论 -
BZOJ 1008 - HNOI 2008 越狱 乘法原理 快速幂
bzoj突然挂了原创 2014-09-09 13:54:45 · 517 阅读 · 0 评论 -
[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 · 3079 阅读 · 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 · 608 阅读 · 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 · 733 阅读 · 0 评论