2016年09月_门豪杰

原创 POJ2100-Graveyard Design【尺取法】

原题链接 Graveyard Design Time Limit: 10000MS Memory Limit: 64000K Total Submissions: 6388 Accepted: 1519 Case Time Limit: 2000MS DescriptionKing George has recently decided that he would like

2016-09-23 10:13:39 369

原创 POJ2739-Sum of Consecutive Prime Numbers【尺取法】

原题链接 Sum of Consecutive Prime Numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 23548 Accepted: 12865 DescriptionSome positive integers can be represented by a sum of o

2016-09-23 10:12:26 298

原创 POJ2566-Bound Found【尺取法】

原题链接 Bound Found Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 2989 Accepted: 926 Special Judge DescriptionSignals of most probably extra-terrestrial origin have been re

2016-09-23 10:09:47 343

原创 POJ3320-Jessica's Reading Problem【尺取法】

原题链接 Jessica’s Reading Problem Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10854 Accepted: 3639 DescriptionJessica’s a very lovely girl wooed by lots of boys. Recently...

2016-09-23 10:08:32 398

原创 POJ3061-Subsequence【尺取法】

原题链接 Subsequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12626 Accepted: 5331 DescriptionA sequence of N positive integers (10 < N < 100 000), each of them less than

2016-09-23 10:05:16 325

原创 HDU5894-hannnnah_j’s Biological Test【组合数学】

原题链接 hannnnah_j’s Biological TestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 114 Accepted Submission(s): 23Problem Description hannn

2016-09-18 21:05:04 398

原创求逆元的三种方法

逆元是什么?方法一: 最简便的方法方法二: 费马小定理方法三: 扩展欧几里得逆元是什么?每个数a均有唯一的一个与之对应的乘法逆元x，使得(a * x)%m = 1 一个数有逆元的充分必要条件是gcd(a,m)=1，此时逆元唯一存在逆元的含义：模m意义下，1个数a如果有逆元x，那么对于一个数k有k/a=k*x方法一: 最简便的方法最简便的一种方法是...

2016-09-18 19:44:11 7376

原创 Six Degrees of Cowvin Bacon（最短路）

原题链接 Six Degrees of Cowvin Bacon Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4687 Accepted: 2233 DescriptionThe cows have been making movies lately, so they are ready to pla

2016-09-16 19:00:11 576

原创 Wormholes（负圈）

这里写链接内容 Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 45118 Accepted: 16643 DescriptionWhile exploring his many farms, Farmer John has discovered a number of amaz

2016-09-16 18:59:14 333

原创 Agri-Net（最小生成树）

原题链接 Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 52814 Accepted: 21996 DescriptionFarmer John has been elected mayor of his town! One of his campaign promises wa

2016-09-16 18:57:48 285

原创 Out of Hay（最小生成树的最大权）

原题链接 Out of Hay Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15516 Accepted: 6056 DescriptionThe cows have run out of hay, a horrible event that must be remedied immediate

2016-09-16 18:56:42 340

原创 Bad Cowtractors（最大生成树与判定）

原题链接 Bad Cowtractors Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13911 Accepted: 5729 DescriptionBessie has been hired to build a cheap internet network among Farmer John

2016-09-16 18:55:34 360

原创 Dead Fraction（辗转相除法）

原题链接Dead Fraction Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 2668 Accepted: 867 DescriptionMike is frantically scrambling to finish his thesis at the last minute. He needs t

2016-09-16 18:54:30 725

原创 Prime Path（素数筛+BFS）

原题链接 Prime Path Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17661 Accepted: 9948 DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of

2016-09-16 18:53:31 580

原创 X-factor Chains（素数）

原题链接X-factor Chains Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6575 Accepted: 2054 DescriptionGiven a positive integer X, an X-factor chain of length m is a sequence of inte

2016-09-16 18:52:35 1448

原创 Semi-prime H-numbers（素数筛）

原题链接 Semi-prime H-numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8912 Accepted: 3928 DescriptionThis problem is based on an exercise of David Hilbert, who pedagogically

2016-09-16 18:51:32 418

原创 Pseudoprime numbers（快速幂）

原题链接 Pseudoprime numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8994 Accepted: 3793 DescriptionFermat’s theorem states that for any prime number p and for any integer a

2016-09-16 18:50:08 422

原创 Raising Modulo Numbers（快速幂）

原题链接 Raising Modulo Numbers Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 6761 Accepted: 4027 DescriptionPeople are different. Some secretly read magazines full of interesting

2016-09-10 11:57:15 351

原创 kruskal算法和prim算法的实现(最小/大生成树)

最小生成树有kruskal算法和prim算法，前者通过并查集判断是否有环，最后生成一棵树或者是森林。他的复杂度是O(|E|*log|V|)可以说也是相当低了struct edge{int x,y,val;}E[maxn];int n,r;int fa[maxn],deep[maxn];bool cmp(edge a,edge b){ return a.val&lt...

2016-09-09 11:29:36 691

原创 4种最短路算法的实现

首先是邻接表形式的Bellman_Ford算法，他的复杂度是O(|E||V|)，他的优势在于可以计算有负边存在的情况struct edge{int from,to,cost;};int r,n;//r代表边的数量，n代表点的数量edge E[maxr];int d[maxn];void Bellman_ford(int s){ fill(d,d+n,INF); ...

2016-09-09 11:10:52 418

原创五分钟看懂二分搜索

二分就是其实就是不断二分查找答案的过程，将二分的区间分成两部分，一部分为满足条件的，一步分为不满足条件的。对于答案是整数类型的比如求满足x>=k的最小的x那么就要选l，求满足x>k的最小的x就要选r。其中r-1=l。对于求满足x<=k的最大的x那么就要选r，求满足xvoid solve(){ int l=左边界减一点,r=右边界加一点; ...

2016-09-09 10:51:28 286

原创 Dropping tests（二分查找平均值）

原题链接 Dropping tests Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9915 Accepted: 3459 DescriptionIn a certain course, you take n tests. If you get ai out of bi questions corre

2016-09-09 10:12:07 429

原创 Aggressive cows（二分查找最大化最小值）

原题链接 Aggressive cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11377 Accepted: 5576 DescriptionFarmer John has built a new long barn, with N (2 <= N <= 100,000) stalls.

2016-09-09 09:59:41 474

原创 Cable master（二分查找解）

原题链接 Cable master Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 38336 Accepted: 8183 DescriptionInhabitants of the Wonderland have decided to hold a regional programming co

2016-09-09 09:49:02 398

原创 Mario and Mushrooms（组合数学）

原题链接 Mario and MushroomsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 689 Accepted Submission(s): 530Problem Description Mario usually r

2016-09-09 09:43:17 412

原创 Layout（最短路）

原题链接 Layout Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10248 Accepted: 4933 DescriptionLike everyone else, cows like to stand close to their friends when queuing for fee

2016-09-09 09:36:16 436 2

原创数学题（矩阵快速幂）

原题链接题目的意思还是非常明了的，但是如果从l开始一个个地加到r势必会超时，所以就需要找到sn=sum( T(k) )0<=k<=n的方法，也就是找出前n项和的方法。发现这里前n项和有这样的规律那就是Sn=Sn-1 + Sn-2 +Sn-3 S0=1;S1=2;S2=3; 那么当矩阵有n-2次那么多的时候，得到的c矩阵的第一行的第一列的元素就是我们要求的那一项了//htt

2016-09-07 10:38:44 404

原创矩阵快速幂的实现

//#include <algorithm>#include <iostream>#include <utility>#include <sstream>#include <cstring>#include <cstdio>#include <vector>#include <queu

2016-09-06 19:02:51 236

原创 Currency Exchange（Bellman_ford算法）

原题链接 Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 27166 Accepted: 10058 DescriptionSeveral currency exchange points are working in our city. Let us suppo

2016-09-02 22:47:40 476

转载【转】cin、cin.get()、cin.getline()、getline()、gets()等函数的用法

学C++的时候，这几个输入函数弄的有点迷糊；这里做个小结，为了自己复习，也希望对后来者能有所帮助，如果有差错的地方还请各位多多指教（本文所有程序均通过VC 6.0运行）转载请保留作者信息；1、cin1、cin.get()2、cin.getline()3、getline()4、gets()5、getchar()1、cin>> 用法1：最基本，也是最常用的用法，输入一个数字

2016-09-02 22:30:33 214

原创 Silver Cow Party（最短路）

原题链接 Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19130 Accepted: 8734 DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N i

2016-09-02 19:10:53 304

原创 Heavy Transportation（最小生成树的最大权的最短路算法）

原题链接 Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 30776 Accepted: 8174 DescriptionBackground Hugo Heavy is happy. After the breakdown of the Cargoli

2016-09-02 19:10:34 376

原创 Frogger（最大生成树的最小权的最短路做法）

原题链接 Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 38314 Accepted: 12335 DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices F

2016-09-02 19:07:56 271

HowieMen的博客