独行闹市无人问，青灯剑影响素琴

ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K42799Standard<br />A few definitions first:Definition 1A graph G = (V, E) is called ``dense'' if for each pair of non-adjacentvertices u and v, where n = |V| anddenotes the de

Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrinth. To make the problem simply, we assume the labyrinth is a

Fire Net<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1996    Accepted Submission(s): 1159<br /><br />Problem DescriptionSuppose that we have a square city with straight streets. A map o

1197: Sum It UpResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K640256Standard<br />Given a specified total t and a list of n integers, find all distinct sumsusing numbers from the list that add up to t. For example,if t = 4, n =

import java.util.*;public class SudokuSol { /**待求解数独，输入时，待填框中填0**/ static int[][] Matrix=null; /**对框中数字的标记，ind[i][j]==1，表示数字是固定的，ind[i][j]==0,数字是待填的**/ static int[][] ind=null; /**标记是否找到答案*

题目描述：https://oj.leetcode.com/problems/path-sum-ii/

题目描述：https://oj.leetcode.com/problems/path-sum/

题目描述：https://oj.leetcode.com/problems/palindrome-partitioning/给定一个字符串，要求求出该串的所有回文分割方式。其实就是对该字符串的划分树进行深package PalindromePartitioning;import java.util.*;public class Solution { boolean isPalind

题目链接：https://oj.leetcode.com/problems/binary-tree-zigzag-level-order-traversal/

题目描述：https://oj.leetcode.com/problems/permutations/

题目描述：https://oj.leetcode.com/problems/permutations-ii/

<br />#include<iostream>using namespace std;int color[100];int father[100];int b[100];//存储开始探查时间int f[100];//存储结束探查时间int time;struct node{ int m; node* next; node(int n,node* p){ m=n; next=p; }};struc

<br />#include<iostream>#include<queue>using namespace std;int father[100];int d[100];int color[100];const int MAX=1000;struct node{ int m; node* next; node(int n,node* p){ m=n; next=p; }};node* p;s

RescueTime Limit: 1 Second      Memory Limit: 32768 KB Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angels friends want to save

Prime Ring Problem<br />Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 6795    Accepted Submission(s): 3057<br /><br />Problem DescriptionA ring is compose of n circles as shown in diagram.

1182: LottoResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s8192K748353Standard<br />In a Lotto I have ever played, one has to select 6 numbers from the set {1,2,...,49}. A popular strategy to play Lotto - although it doesn't increase your chance

Asteroids!<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1233    Accepted Submission(s): 809<br /><br />Problem DescriptionYou're in space.<br />You want to get home.<br />There are

1349: Oil DepositsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K533260Standard<br />The GeoSurvComp geologic survey company is responsible for detectingunderground oil deposits. GeoSurvComp works with one large rectangularregion of land

2603: 2012世界末日ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE10s65536K22786Standard<br />     种种迹象表明，公元2012年为世界末日，而科学家们进一步预测，人类将被一种神秘的时空机器送到另一个宇宙，所以不要害怕，我们只是搬了个新家而已~<br />     每一次改变都是一种进步，这个新的世界并不像我们的地球，不再有南方北方(不倒翁已为此头疼很久)，不再有贫富贵贱，人们也不会再因为自己的长像头疼，因为同性别的

1066: Fire Net IIResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K535212Standard<br />1st JOJ Cup Online VContest Warmup Problem<br />Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n colu

Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately

Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === <br />"The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroyed in Wor

Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14020 Accepted: 7218<br />DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he

Farm IrrigationTime Limit: 1 Second      Memory Limit: 32768 KB <br />Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a di

题目描述：https://oj.leetcode.com/problems/palindrome-partitioning/