如果不能正常显示代码 ,请右键->查看源文件 来查看源代码 里面有代码部分 另外由于网站原因 \n在博客里都显示是/n 请自己更改...


欢迎大家来参观: https://github.com/kongzhidea?tab=repositories 欢迎大家来参观: https://github.com/kongzhidea?tab=repositories

2016-09-07 10:43:32

阅读数 446

评论数 0

程序员编程艺术 pdf下载


2014-03-25 11:33:27

阅读数 2630

评论数 1

fzu count 求区间之间x的个数 离线+树状数组

Problem A Count Accept: 60    Submit: 327 Time Limit: 1000 mSec    Memory Limit : 65536 KB  Problem Description Given an array of positive integer...

2012-03-25 15:00:22

阅读数 793

评论数 0

nankai 2082: 靶形数独 数独(9*9)求所有解 DLX+精确覆盖

2082: 靶形数独 Time Limit: 2000 ms    Memory Limit: 131072 kB   Judge type: Multi-cases (Detailed Mode - 20 cases) Total Submit : 181 (41 users) ...

2011-11-11 19:14:17

阅读数 1063

评论数 0

hdu 4107 Gangster 线段树 成段更新 最后求每一位的值

Problem Description There are two groups of gangsters fighting with each other. The first group stands in a line, but the other group has a magic gu...

2011-10-31 22:01:40

阅读数 657

评论数 0

zoj 3551 Bloodsucker 概率DP

In 0th day, there are n-1 people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the same species, th...

2011-10-31 13:44:48

阅读数 793

评论数 0

zoj 3554 A Miser Boss BFS+DP 减少废状态

There are three different lathes in a factory namely A,B,C. They are all able to work on all kinds of workpieces. And there are n workpieces to be p...

2011-10-31 13:40:04

阅读数 815

评论数 1

hdu 4109 Instrction Arrangement 求关键路径的长度

Problem Description Ali has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instr...

2011-10-31 12:34:58

阅读数 910

评论数 0

hdu 4104 求不能有已知n个数组成的最小的数

Problem Description All the shops use discount to attract customers, but some shops doesn’t give direct discount on their goods, instead, they...

2011-10-31 10:10:45

阅读数 862

评论数 0

hdu 4101 Ali and Baba 求包含-1的外围

Problem Description There is a rectangle area (with N rows and M columns) in front of Ali and Baba, each grid might be one of the following: 1. Emp...

2011-10-31 10:05:40

阅读数 1030

评论数 0

hdu 4105 Electric wave DP

Problem Description Ali was doing a physic experiment which requires him to observe an electric wave. He needs the height of each peak value and v...

2011-10-30 16:52:13

阅读数 803

评论数 0

zoj 3557 How Many Sets II 求Comb(n,m)%p p很大素数 m<=1e4

Given a set S = {1, 2, ..., n}, number m and p, your job is to count how many set T satisfies the following condition: T is a subset of S|T| = mT ...

2011-10-29 15:49:18

阅读数 1056

评论数 0

2011 北京赛区 A bupt 238

// #include #include #include #include #include #include using namespace std; const int maxn=1100; struct Point {     double x,y...

2011-10-27 21:11:57

阅读数 447

评论数 0

2011 北京赛区 I bupt 246 Activation

After 4 years' waiting, the game "Chinese Paladin 5" finally comes out. Tomato is a  crazyfan,andluckilyhegotthefirstrelease.Nowheisathome...

2011-10-27 21:09:31

阅读数 499

评论数 0

113C - Double Happiness 求区间%4=1的素数--可以表示成平方和的形式--的个数(素数筛选法)

On the math lesson a teacher asked each pupil to come up with his own lucky numbers. As a fan of number theory Peter chose prime numbers. Bob was mor...

2011-10-22 19:48:44

阅读数 596

评论数 0

joj 2672 Hanoi Tower Once More 有向无环图的最小路径覆盖=N-最大匹配

2010 Yuanguang Cup ACM-ICPC Collegiate Programming Contest                  Problem I: Hanoi Tower Once More                                 Inpu...

2011-10-20 22:59:51

阅读数 482

评论数 0

Interesting Game SG函数 有一堆石子,每次将一堆石子分解成连续几个数的和,不能分解的人输。问先手胜,败。

Two best friends Serozha and Gena play a game. Initially there is one pile consisting of n stones on the table. During one move one pile should be...

2011-10-20 19:56:33

阅读数 626

评论数 0

joj 2262: Brackets 最多有多少括号匹配

We give the following inductive definition of a " regular brackets " sequence: the empty sequence is a regular brackets sequence, if s i...

2011-10-19 23:40:38

阅读数 612

评论数 0

hdu 3455 Leap Frog

Problem Description Jack and Jill play a game called "Leap Frog" in which they alternate turns jumping over each other. Both Jack and Jill...

2011-10-19 22:29:29

阅读数 466

评论数 0

poj 2723 Get Luffy Out 2-SAT+二分答案

Description Ratish is a young man who always dreams of being a hero. One day his friend Luffy was caught by Pirate Arlong. Ratish set off at once to...

2011-10-19 21:29:31

阅读数 485

评论数 0

取消 删除