STILLxjy

Keep On Movin Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1040 Accepted Submission(s): 733Problem Description Professor Zhang has kind

50. Pow(x, n)实现 pow(x, n) ，即计算 x 的 n 次幂函数。示例 1:输入: 2.00000, 10输出: 1024.00000示例 2:输入: 2.10000, 3输出: 9.26100示例 3:输入: 2.00000, -2输出: 0.25000解释: 2^-2 = (1/2)^2 = 1/4 = 0.25说明:-100.0 < x &l...

42.接雨水 给定 n 个非负整数表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。上面是由数组 [0,1,0,2,1,0,1,3,2,1,2,1] 表示的高度图，在这种情况下，可以接 6 个单位的雨水（蓝色部分表示雨水）。 感谢 Marcos 贡献此图。示例: 输入: [0,1,0,2,1,0,1,3,2,1,2,1] 输出: 6分析： （我们...

题目链接： D. Walking Between Houses 题意： 现在有n个房子排成一列，编号为1~n，起初你在第1个房子里，现在你要进行k次移动，每次移动一都可以从一个房子i移动到另外一个其他的房子j里（i != j），移动的距离为|j - i|。问你进过k次移动后，移动的总和可以刚好是s吗？若可以则输出YES并依次输出每次到达的房子的编号，否则输出NO。分析： 每次至少移动一...

B. And time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard outputThere is an array with n elements a1, a2, …, an and the number x.In one operation...

B. Balanced Substring time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given a string s consisting only of characters 0 and 1. A sub

A. Classroom Watchtime limit per test: 1 secondmemory limit per test: 512 megabytesinput: standard inputoutput: standard outputEighth-grader Vova is on duty today in the class. After classes, he we

Graph Theory Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 346 Accepted Submission(s): 167Problem Description Little Q loves playing w

（HDU 5938）Four OperationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1151 Accepted Submission(s): 338Problem Description Little Ruins i

题目链接： http://codeforces.com/problemset/problem/792/EE. Colored Ballstime limit per test: 1 secondmemory limit per test: 256 megabytesinput: standard inputoutput: standard outputThere are n boxes wi

Divide the Sequence Problem Description Alice has a sequence A, She wants to split A into as much as possible continuous subsequences, satisfying that for each subsequence, every its prefix sum is no

The All-purpose Zero Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1950 Accepted Submission(s): 920Problem Description ?? gets an sequen

It’s All In The Mind Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1608 Accepted Submission(s): 749Problem Description Professor Zhang h

73. 矩阵置零给定一个 m x n 的矩阵，如果一个元素为 0，则将其所在行和列的所有元素都设为 0。请使用原地算法。示例 1:输入:[[1,1,1],[1,0,1],[1,1,1]]输出:[[1,0,1],[0,0,0],[1,0,1]]示例 2:输入:[[0,1,2,0],[3,4,5,2],[1,3,1,5]]输出:[[0,0,0,0],[...