数学
博弈论,数论,计算几何等
DeterminedDiligent
这个作者很懒,什么都没留下…
展开
-
POJ 2653 Pick-up sticks【计算几何入门】
http://poj.org/problem?id=2653Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 11638 Accepted: 4390DescriptionStan has n sticks o原创 2016-03-24 20:21:18 · 547 阅读 · 1 评论 -
计算几何--判断线段是否相交
计算几何算法概览一、引言 计算机的出现使得很多原本十分繁琐的工作得以大幅度简化,但是也有一些在人们直观看来很容易的问题却需要拿出一套并不简单的通用解决方案,比如几何问题。作为计算机科学的一个分支,计算几何主要研究解决几何问题的算法。在现代工程和数学领域,计算几何在图形学、机器人技术、超大规模集成电路设计和统计等诸多领域有着十分重要的应用。在本文中,我们将对计算转载 2016-03-24 20:10:08 · 1843 阅读 · 0 评论 -
计算几何常用算法【ACM 】
http://www.zybang.com/question/0e7a7521c0143f0e9d4d4d9bf2458076.html1. 矢量减法设二维矢量 P = (x1,y1) ,Q = (x2,y2)则矢量减法定义为: P - Q = ( x1 - x2 , y1 - y2 )显然有性质 P - Q = - ( Q - P )如不加说明,下面所有的点都看作矢量转载 2016-03-24 19:40:23 · 820 阅读 · 0 评论 -
HDU 杭电5584 LCM Walk【逆推】
http://acm.hdu.edu.cn/showproblem.php?pid=5584LCM WalkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 518 Accepted Submission(s): 2原创 2016-04-08 22:34:20 · 2610 阅读 · 0 评论 -
HDU杭电 1027 Ignatius and the Princess II
http://acm.hdu.edu.cn/showproblem.php?pid=1027Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6406原创 2016-03-08 20:23:26 · 279 阅读 · 0 评论 -
HDU 1220 ( Cube )
http://acm.hdu.edu.cn/showproblem.php?pid=1220CubeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1737 Accepted Submission(s): 1382原创 2016-03-08 20:13:18 · 274 阅读 · 0 评论 -
HDU杭电5630 ( Rikka with Chess )
http://acm.hdu.edu.cn/showproblem.php?pid=5630Rikka with ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 516 Accepted Submissi原创 2016-03-08 20:04:43 · 309 阅读 · 0 评论 -
HD杭电1418 抱歉
http://acm.hdu.edu.cn/showproblem.php?pid=1418Problem Description非常抱歉,本来兴冲冲地搞一场练习赛,由于我准备不足,出现很多数据的错误,现在这里换一个简单的题目:前几天在网上查找ACM资料的时候,看到一个中学的奥数题目,就是不相交的曲线段分割平面的问题,我已经发到论坛,并且lxj 已经得到一个结论,这里就不原创 2016-03-08 19:58:50 · 358 阅读 · 0 评论 -
Codeforces 618A - Slime Combining
http://www.codeforces.com/problemset/problem/618/AA. Slime Combiningtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandar原创 2016-03-08 19:40:40 · 425 阅读 · 0 评论 -
Codeforces 630F - Selection of Personnel
http://www.codeforces.com/problemset/problem/630/FF. Selection of Personneltime limit per test0.5 secondsmemory limit per test64 megabytesinputstandard inputoutputs原创 2016-03-08 19:26:33 · 306 阅读 · 0 评论 -
Codeforces 630N - Forecast
http://www.codeforces.com/problemset/problem/630/NN. Forecasttime limit per test0.5 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard output原创 2016-03-08 19:16:49 · 369 阅读 · 0 评论 -
Codeforces 631A - Interview
http://www.codeforces.com/problemset/problem/631/AA. Interviewtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard原创 2016-03-08 19:12:24 · 661 阅读 · 0 评论 -
codeforces Problem- 630K Indivisibility
http://www.codeforces.com/problemset/problem/630/KK. Indivisibilitytime limit per test0.5 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard原创 2016-03-08 19:04:10 · 412 阅读 · 0 评论 -
Codeforces Problem - 617B Chocolate
http://www.codeforces.com/problemset/problem/617/BB. Chocolatetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output原创 2016-03-08 18:59:55 · 336 阅读 · 0 评论 -
GCD HDU杭电2588 【欧拉函数的应用】
Problem DescriptionThe greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,(1,2)=1,(12,18)=6.(a,b) can be原创 2015-09-01 11:58:40 · 888 阅读 · 1 评论 -
GCD Again HDU杭电1787【欧拉函数】
Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after one ACM contest?No? Oh, you must do this when you want to become a "Big Cattle".Now you will原创 2015-09-01 11:53:46 · 387 阅读 · 0 评论 -
找新朋友 HDU杭电1286 【欧拉函数】
http://acm.hdu.edu.cn/showproblem.php?pid=1286Problem Description新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,把会员从1到N编号,其中会长的号码是N号,凡是和会长是老朋友的,那么该会员的号码肯定和N有大于1的公约数,否则都是新朋友,现在会长想知道究竟有几个新朋友?请你编程序帮会长计算出来。原创 2015-08-27 09:40:29 · 329 阅读 · 0 评论 -
The Euler function HDU杭电2824 【欧拉函数打表】
Problem DescriptionThe Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smaller than n and coprime to n, and this function h原创 2015-08-27 09:35:57 · 560 阅读 · 0 评论 -
Be the Winner HDU杭电2509 【尼姆博弈】
http://acm.hdu.edu.cn/showproblem.php?pid=2509Problem DescriptionLet's consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You can tak原创 2015-10-19 22:52:04 · 424 阅读 · 0 评论 -
hdu杭电 2147 kiki's game
Problem DescriptionRecently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size of the chesserboard is n*m.First of all, a coin is原创 2015-07-25 23:07:24 · 357 阅读 · 0 评论