2015年12月_猿的进化之路

原创 hud1114 完全背包

http://acm.hdu.edu.cn/showproblem.php?pid=1114加礼#——买六个月送域名代金券！Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submi

2015-12-30 16:39:25 289

原创 hdu1087

http://acm.hdu.edu.cn/showproblem.php?pid=1087#include #include #include #include #include using namespace std;const int MAXN=1005;const int INF=1e8;int dp[MAXN],d[MAXN];int main(){

2015-12-30 16:34:05 310

原创 hdu1069 Monkey and Banana

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=68966#problem/C、#include #include #include #include #include using namespace std;struct ac{ int x,y,z,high,dp;} d[205];bool cmp(ac

2015-12-30 16:23:42 339

原创 poj3280

Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7352 Accepted: 3551DescriptionKeeping track of all the cows can be a tricky task so F

2015-12-26 16:36:48 72

原创素因子分解超快的Pollard_rho算法

C - Aladdin and the Flying CarpetTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1341DescriptionIt's said that Aladdin had to

2015-12-21 20:17:16 1018

原创数论欧拉函数

A - Bi-shoe and Phi-shoeTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1370DescriptionBamboo Pole-vault is a massively popul

2015-12-21 15:24:01 518

原创欧拉函数

两种晒发+1中单个查询const int maxn=1500000;int a[maxn];void Init_oula()///预处理求出1到N的欧拉函数的值 { int i,j; memset ( a, 0 ,sizeof (a)) ; for ( i = 2 ; i <= N ; i ++ ) {//筛选求a if

2015-12-21 14:30:55 323

原创 poj3723最小生成树

ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9705 Accepted: 3451DescriptionWindy has a country, and he wants to build an army to protect

2015-12-18 16:11:32 395

原创最小生成树

#include #include using namespace std;const int maxn=10000;struct edge{ int u,v,cost;}es[maxn];bool cmp(edge e1,edge e2){ return e1.cost<e2.cost;}int par[maxn],rank[maxn];void init(

2015-12-18 16:00:14 278

原创 poj1703

Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 38075 Accepted: 11714DescriptionThe police office in Tadu City decides to say ends

2015-12-17 21:23:53 255

原创 poj3255次短路算法

RoadblocksTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10539 Accepted: 3756DescriptionBessie has moved to a small farm and sometimes enjoys returning

2015-12-17 21:11:34 3312 1

原创 codeforce 241div2 D

D. Population Sizetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus develops an interesting theory

2015-12-07 20:50:39 518

原创 hdu1029 B - Ignatius and the Princess IV

B - Ignatius and the Princess IVTime Limit:1000MS Memory Limit:32767KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1029Description"OK, you are not too bad, em

2015-12-04 21:24:51 304

原创 cf C - Booking System

C - Booking SystemTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 416CDescriptionInnovation technologies are on a v

2015-12-04 21:22:44 443

原创 cfB - Art Union

B - Art UnionTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 416BDescriptionA well-known art union called "Kalevich

2015-12-04 21:20:37 320

原创 hdu1176

dpG - 免费馅饼Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1176Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼

2015-12-04 21:16:36 308

原创 cf Guess a number!

A TV show called "Guess a number!" is gathering popularity. The whole Berland, the old and the young, are watching the show.The rules are simple. The host thinks of an integer y and the participants

2015-12-04 21:12:26 438

猿的进化