技巧
关注
分享
扫一扫
Jogging_Clown
丢掉盔甲，我依然是骄傲帅气的骑士。
展开
-
Coderforce 626C Block Towers（脑洞啊）
C. Block Towerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudents in a class are making towers of bl原创 2016-02-14 23:17:58 · 1277 阅读 · 0 评论 -
NYOJ 题目952 最大四边形（几何，技巧）
最大四边形时间限制：1000 ms | 内存限制：65535 KB难度：2描述平面坐标上有n个点，你知道能组成四边形中面积最大的是多少吗？输入有多组测试数据第一行整数n，表示有n个点，( 4然后n行，每行x，y表示点的坐标。(没有重复的点)输出最大四边形的面积.(保留六位小数)样例输入50 00 44 04 42 3原创 2015-01-25 21:16:20 · 883 阅读 · 0 评论 -
POJ 题目2442 Sequence（技巧，优先队列）
SequenceTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 7687 Accepted: 2540DescriptionGiven m sequences, each contains n non-negative integer. Now we ma原创 2015-02-25 20:32:03 · 655 阅读 · 2 评论 -
HDOJ 题目3250 Bad Hair Day（技巧）
Bad Hair DayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13562 Accepted: 4576DescriptionSome of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a ba原创 2014-12-30 19:03:16 · 1142 阅读 · 0 评论 -
HDOJ 题目3579 Hello Kiki（中国剩余定理，拓展的欧几里得）
Hello KikiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2270 Accepted Submission(s): 827Problem DescriptionOne day I was shoppi原创 2014-12-13 17:03:11 · 948 阅读 · 0 评论 -
HDOJ 题目1573 X问题（中国剩余定理，拓展欧几里得）
X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3641 Accepted Submission(s): 1182Problem Description求在小于等于N的正整数中有多少个X满足：X mod原创 2014-12-13 18:20:05 · 1417 阅读 · 0 评论 -
HDOJ 题目4474 Yet Another Multiple Problem（bfs，技巧，找一个数的倍数）
Yet Another Multiple ProblemTime Limit: 40000/20000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4057 Accepted Submission(s): 947Problem Description原创 2014-12-30 10:38:23 · 479 阅读 · 0 评论 -
POJ 题目3181 Dollar Dayz（完全背包，技巧）
Dollar DayzTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4231 Accepted: 1646DescriptionFarmer John goes to Dollar Days at The Cow Store and discovers原创 2014-12-07 16:51:50 · 478 阅读 · 0 评论 -
HDOJ 题目4096 BestCoder Sequence（数学，水）
BestCoder SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1095 Accepted Submission(s): 376Problem DescriptionMr Potato is原创 2015-02-03 00:35:45 · 695 阅读 · 0 评论 -
POJ题目2531Network Saboteur（枚举）
Network SaboteurTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9527 Accepted: 4529DescriptionA university network is composed of N computers. System ad原创 2015-02-02 00:31:40 · 497 阅读 · 0 评论 -
POJ题目2282 The Counting Problem（数学）
The Counting ProblemTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3559 Accepted: 1890DescriptionGiven two integers a and b, we write the numbers betwe原创 2015-02-02 17:36:45 · 956 阅读 · 0 评论 -
HDOJ 题目4104 Discount（数学，技巧）
DiscountTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1437 Accepted Submission(s): 865Problem DescriptionAll the shop原创 2014-12-09 20:43:47 · 567 阅读 · 0 评论 -
POJ 题目1496 Word Index（排列组合）
Word IndexTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4700 Accepted: 2666DescriptionEncoding schemes are often used in situations requiring encrypti原创 2015-01-11 18:33:14 · 575 阅读 · 0 评论 -
NYOJ 题目948 Max Gcd（技巧）
Max Gcd时间限制：1000 ms | 内存限制：65535 KB难度：3描述给一个长度为 n 的数列 {an} ，找出 max { gcd(ai , aj) }(i != j)。输入多组测试数据。（100组）第 1 行 1 个数 n。（2接下来的 1 行有 n 个数 ai。（1输出1 行有 1 个数，max { gcd(ai , a原创 2015-02-14 23:48:37 · 854 阅读 · 0 评论 -
HDOJ 题目4725 The Shortest Path in Nya Graph（spfa，建图）
The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2824 Accepted Submission(s): 668Problem Description原创 2015-02-15 23:09:44 · 538 阅读 · 0 评论 -
Codeforce 题目612 D The Union of k-Segments（暴力，排序，技巧）
D. The Union of k-Segmentstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n segments on the原创 2016-01-10 01:38:53 · 757 阅读 · 0 评论 -
BZOJ 题目1503: [NOI2004]郁闷的出纳员（SBT+延迟操作）
1503: [NOI2004]郁闷的出纳员Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 8058 Solved: 2828[Submit][Status][Discuss]DescriptionOIER公司是一家大型专业化软件公司，有着数以万计的员工。作为一名出纳员，我的任务之一便是统计每位员工的工资。这本来是一份不错的工作，原创 2015-08-14 00:29:08 · 1310 阅读 · 0 评论 -
HDOJ 题目4714 Tree2cycle（树形DP）
Tree2cycleTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 1730 Accepted Submission(s): 401Problem DescriptionA tree with N原创 2015-08-10 21:49:55 · 706 阅读 · 0 评论 -
ZOJ 题目3870 Team Formation（数学，位运算）
Team FormationTime Limit: 3 Seconds Memory Limit: 131072 KB For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team fromN students原创 2015-08-11 10:30:58 · 747 阅读 · 0 评论 -
HDOJ 题目4123 Bob’s Race（树的直径+RMQ优化）
Bob’s RaceTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2753 Accepted Submission(s): 888Problem DescriptionBob wants to hol原创 2015-07-28 18:38:38 · 772 阅读 · 0 评论 -
HDOJ 题目4276 The Ghost Blows Light（SPFA+树形DP）
The Ghost Blows LightTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2549 Accepted Submission(s): 795Problem DescriptionMy原创 2015-07-27 21:49:21 · 702 阅读 · 0 评论 -
HDOJ题目4705 Y（简单树形DP+数学）
YTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2284 Accepted Submission(s): 605Problem Description Sample Input原创 2015-07-27 17:11:57 · 444 阅读 · 0 评论 -
HDOJ题目2554 N对数的排列问题（数学）
N对数的排列问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1269 Accepted Submission(s): 942Problem Description有N对双胞胎，他们的年龄分别是1，2原创 2015-05-05 09:19:43 · 836 阅读 · 0 评论 -
POJ题目3613 Cow Relays（Floyd+快速幂）
Cow RelaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5707 Accepted: 2259DescriptionFor their physical fitness program, N (2 ≤ N ≤ 1,000,000) cows h转载 2015-05-02 23:54:17 · 381 阅读 · 0 评论 -
HDOJ 题目4372 Count the Buildings（斯特林第一类数）
Count the BuildingsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 738 Accepted Submission(s): 246Problem DescriptionThere are N原创 2015-04-16 20:05:28 · 935 阅读 · 0 评论 -
POJ 题目3320 Jessica's Reading Problem（技巧）
Jessica's Reading ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7550 Accepted: 2407DescriptionJessica's a very lovely girl wooed by lots of boy原创 2015-03-25 10:39:11 · 588 阅读 · 0 评论 -
HDOJ 提姆1431素数回文 （打表）
素数回文Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12952 Accepted Submission(s): 2977Problem Descriptionxiaoou33对既是素数又是回文的数特原创 2015-03-23 13:49:03 · 771 阅读 · 0 评论 -
POJ 题目1850 Code（组合数学）
CodeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8404 Accepted: 3976DescriptionTransmitting and memorizing information is a task that requires differ原创 2015-01-11 18:20:47 · 796 阅读 · 0 评论 -
HDOJ 题目1695 GCD（欧拉函数，容斥原理）
GCDTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6219 Accepted Submission(s): 2279Problem DescriptionGiven 5 integers: a, b原创 2014-12-05 14:04:09 · 586 阅读 · 0 评论 -
NYOJ 题目442字串和之差（动态规划）
字串和之差时间限制：3000 ms | 内存限制：65535 KB难度：4描述给出一个数列{a1,a2,a3,a4……an},选出一个连续非空子序列，使该序列的绝对值max最大，再选出一个非空子序列（与第一个序列的选择无关），使该序列的绝对值min最小。输出max与min的差值。输入第一行是一个整数m（m每组数据第一行是一个整数 n（n输出输原创 2015-01-10 16:55:22 · 704 阅读 · 0 评论 -
HDOJ 题目4704 Sum（费马小定理，快速幂）
SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1320 Accepted Submission(s): 570Problem Description Sample Input原创 2014-08-17 01:13:41 · 894 阅读 · 2 评论 -
HDOJ 题目2108Shape of HDU（数学）
Shape of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5141 Accepted Submission(s): 2339Problem Description话说上回讲到海东集团推选老总的事情原创 2014-08-13 00:42:36 · 658 阅读 · 0 评论 -
NYOJ 题目127星际之门（一）（生成树个数）
星际之门（一）时间限制：3000 ms | 内存限制：65535 KB难度：3描述公元3000年，子虚帝国统领着N个星系，原先它们是靠近光束飞船来进行旅行的，近来，X博士发明了星际之门，它利用虫洞技术，一条虫洞可以连通任意的两个星系，使人们不必再待待便可立刻到达目的地。帝国皇帝认为这种发明很给力，决定用星际之门把自己统治的各个星系连结在一起。原创 2014-09-21 17:57:03 · 486 阅读 · 0 评论 -
HDOJ题目2095find your present (2)（数学，异或消除）
find your present (2)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/1024 K (Java/Others)Total Submission(s): 15376 Accepted Submission(s): 5838Problem DescriptionIn the n原创 2014-08-11 11:05:46 · 592 阅读 · 0 评论 -
HDOJ 题目1566&题目1544 S-Nim（sg博弈模板）
S-NimTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4451 Accepted Submission(s): 1934Problem DescriptionArthur and his sister Ca原创 2014-08-11 15:13:41 · 540 阅读 · 0 评论 -
HDOJ 题目3389 Game（阶梯博弈）
GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 367 Accepted Submission(s): 244Problem DescriptionBob and Alice are playing a原创 2014-08-08 21:13:54 · 905 阅读 · 0 评论 -
HDOJ题目1058Humble Numbers（数学，丑数）
Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17104 Accepted Submission(s): 7434Problem DescriptionA number whose原创 2014-08-07 22:28:42 · 676 阅读 · 0 评论 -
POJ题目1704（Staircase Nim（阶梯博弈））
Georgia and BobTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7605 Accepted: 2317DescriptionGeorgia and Bob decide to play a self-invented game. They dra原创 2014-08-08 20:44:11 · 961 阅读 · 0 评论 -
HDOJ 题目1133Buy the Ticket（大数，数学）
Buy the TicketTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4606 Accepted Submission(s): 1949Problem DescriptionThe "Harry Pott原创 2014-08-20 20:10:55 · 582 阅读 · 0 评论 -
HDOJ 题目4497 GCD and LCM （组合数学，gcd性质）
GCD and LCM Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 950 Accepted Submission(s): 443Problem DescriptionGiven two positive原创 2014-08-18 16:05:03 · 754 阅读 · 0 评论