窦小雨的小点子

Toxophily Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 23   Accepted Submission(s) : 9 Problem Description The recreation center o

Prime Ring Problem Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 2   Accepted Submission(s) : 1 Problem Description A ring is compo

Pusher Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/65536K (Java/Other) Total Submission(s) : 8   Accepted Submission(s) : 2 Special Judge Problem Description PusherBoy

Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a

Problem Description Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try your lucky.   Input The first line of the input contain

Another Eight Puzzle Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 9   Accepted Submission(s) : 3 Problem Description Fill the foll

Sequence two Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 2   Accepted Submission(s) : 2 Problem Description Search is important i

Sequence one Time Limit : 6000/2000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 1   Accepted Submission(s) : 1 Problem Description Search is important i

Sudoku Killer Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 6   Accepted Submission(s) : 2 Problem Description 自从2006年3月10日至11日的首届数

天呐撸。这篇文章不管格式了。 这套题用的时间比较多。其中有些东西可能还没完全消化吸收。 简单说一下这章包含的内容。 二分：   单调函数求零点。 三分：    凸函数求最值。（其实有些内容完全可以求导之后，对导函数求零点，得出最值） bfs：   一般是求最短路径，不过这套题中有个最长路的我也用了  BFS 。 DFS： 一般是求最长路径。包括回溯类型和非回溯类

F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x Sample Output -74.4291-178.8534   Author Redow   题目大意：给定函数和 y 值 求函数最小值。思路：连续求导可知导函数单调递增，并且 F ’ （0） 0那么导函数的零点就是原函数的最小值。二分求零点就行了。感想：说好的搜索呢。。。到现在都是

D. Lakes in Berland time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The map of Berland is a rectangle of th

传递 Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 118    Accepted Submission(s): 51 Problem Description 我们称一个有向图G是传递的，当且仅当对任意三个不同

E. Comments time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A rare article in the Internet is posted withou

N皇后问题 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 4   Accepted Submission(s) : 4 Problem Description 在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即

Tempter of the Bone Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 17   Accepted Submission(s) : 6 Problem Description The doggie fo

Problem Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming t

A有1数m，B来猜.B每猜一次，A就说"太大"，"太小"或"对了" 。 问B猜n次可以猜到的最大数。   Input 第1行是整数T,表示有T组数据，下面有T行 每行一个整数n (1 ≤ n ≤ 30)   Output 猜n次可以猜到的最大数   Sample Input 213   S

Turn the corner Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 15   Accepted Submission(s) : 7 Problem Description Mr. West bought a

Line belt Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 31   Accepted Submission(s) : 7 Problem Description In a two-dimensional pl

Cable master Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 20   Accepted Submission(s) : 8 Problem Description Inhabitants of the W

连连看 Time Limit : 20000/10000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 16   Accepted Submission(s) : 4 Problem Description “连连看”相信很多人都玩过。没玩过也没关系，下面我给大

Catch him Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 35   Accepted Submission(s) : 3 Problem Description 在美式足球中，四分卫负责指挥整只球队的进攻战术

Rescue Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 26   Accepted Submission(s) : 9 Problem Description Angel was caught by the MO

A strange lift Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 91   Accepted Submission(s) : 10 Problem Description There is a strang

A strange lift Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 91   Accepted Submission(s) : 10 Problem Description There is a strang

Knight Moves Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 14   Accepted Submission(s) : 6 Problem Description A friend of you is d

Red and Black Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 5   Accepted Submission(s) : 4 Problem Description There is a rectangul

非常可乐 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 13   Accepted Submission(s) : 7 Problem Description 大家一定觉的运动以后喝可乐是一件很惬意的事情，但是see

1085: [SCOI2005]骑士精神 Time Limit: 10 Sec  Memory Limit: 162 MB Submit: 1996  Solved: 1121 [Submit][Status][Discuss] Description 　　在一个5×5的棋盘上有12个白色的骑士和12个黑色的骑士， 且有一个空位。在任何时候一个骑士都能按照骑 士的走法（它可以走到和