csu_huangning-CSDN博客

原创 POJ_3254_Corn Fields

Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9881 Accepted: 5226DescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M

2015-08-09 12:28:10 252

原创 POJ_1321_棋盘问题

A - 棋盘问题Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1321Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放

2015-08-09 12:09:35 224

原创 HDU 1017

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1017DescriptionGiven two integers n and m, count the number of pairs of integ

2015-08-09 11:48:55 352

原创 CodeForces 435B

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 435BDescriptionPasha has a positive integer a without leading zeroes.

2015-08-09 11:23:22 264

原创 ZOJ_1093_Monkey and Banana

Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 1093DescriptionA group of researchers are designing an experiment to test the I

2015-08-01 17:33:52 277

原创 POJ_1458_Common Subsequence

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1458DescriptionA subsequence of a given sequence is the given sequence with

2015-08-01 17:27:33 238

原创 hdu_1087_Super Jumping! Jumping! Jumping!

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1087DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! J

2015-08-01 17:24:14 260

原创 HDU_1017_E

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1017DescriptionGiven two integers n and m, count the number of pairs of integ

2015-08-01 17:19:33 288

原创 CodeForces_435B_C

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 435BDescriptionPasha has a positive integer a without leading zeroes.

2015-08-01 17:14:05 326

原创 FZU_1208_最大k乘积问题

Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description设I是一个n位十进制整数。如果将I划分为k段，则可得到k个整数。这k个整数的乘积称为I的一个k乘积。试设计一个算法，对于给定的I和k，求出I的最大k乘积。对于给定的I和k，编程计算I的最大k乘积。 Input输入文件由多

2015-08-01 08:47:43 414

原创 SCU_1114_数字三角

Time Limit:0MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription下图是个数字三角，请编写一个程序计算从顶部至底部某处一条路径，使得该路径所经过的数字总和最大。73 88 1 02 7 4 41．每一步可沿左斜线

2015-07-29 17:54:02 259

原创 poj_1068_Parencodings

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in

2015-07-28 17:05:46 203

原创 poj_2260_Error Correction

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA boolean matrix has the parity property when each row and each column has an ev

2015-07-28 16:59:12 335

原创 hdu_1009_FatMouse' Trade

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the

2015-07-28 16:55:22 170

原创 poj_1065_Wooden Sticks

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known

2015-07-28 16:49:29 411

原创 hdu_1789_Doing Homework again

DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the ho

2015-07-28 16:41:11 226

原创 HDU_1501_ Combining The Strings

Combining The StringsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1501DescriptionGiven three strings, you are to determi

2015-07-28 16:39:28 224

原创 ZOJ_1709 _Oil Deposits

Oil DepositsTime Limit: 2 Seconds Memory Limit: 65536 KBThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rec

2015-07-28 16:34:36 235

原创 HDU_1312_Red and Black

Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12866 Accepted Submission(s): 7960Problem DescriptionThere is a

2015-07-28 16:33:20 229

原创 POJ_1915_Knight Moves

DescriptionBackgroundMr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? The ProblemYour ta

2015-07-27 09:21:29 305

原创 hdu_1312_Red and Black

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 can move to one of four adjacent til

2015-07-27 09:04:54 142

原创 coj_1224: ACM小组的古怪象棋

DescriptionACM小组的Samsara和Staginner对中国象棋特别感兴趣，尤其对马（可能是因为这个棋子的走法比较多吧）的使用进行深入研究。今天他们又在构思一个古怪的棋局:假如Samsara只有一个马了，而Staginner又只剩下一个将，两个棋子都在棋盘的一边，马不能出这一半棋盘的范围，另外这一半棋盘的大小很奇特(n行m列)。Samsara想知道他的马最少需要跳几次

2015-07-27 08:43:19 420

原创 hdu2533_N皇后问题

N皇后问题Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2553Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋

2015-07-25 18:15:03 493

原创 ZOJ_1204_Additive equations

Additive equationsTime Limit: 10 Seconds Memory Limit: 32768 KB We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer se

2015-07-25 18:00:30 353

原创 poj1995_Raising Modulo Numbers

Raising Modulo NumbersTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5214 Accepted: 3039DescriptionPeople are different. Some secretly read magazines f

2015-07-23 09:00:38 236

原创 poj2366_Sacrament of the sum

Sacrament of the sumTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription— The Brother of mine, the Head of Monastic Order wants to

2015-07-23 08:57:32 284

原创 hdu1061_Rightmost Digit

Rightmost DigitTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a positive integer N, you should output the most right digi

2015-07-23 08:53:39 218

原创 hdu2899_Strange fuction

Strange fuctionTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNow, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x

2015-07-23 08:49:06 262

原创 hdu2199_Can you solve this equation?

Can you solve this equation?Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNow,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x +

2015-07-23 08:45:43 254

原创 hdu2141_Can you find it?

Can you find it?Time Limit:3000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGive you three sequences of numbers A, B, C, then we give you a nu

2015-07-23 08:42:55 252

原创 coj1022_菜鸟与大牛

Descriptionblue和AutoGerk是好朋友。他们的相同点是都喜欢研究算法，不同点是AutoGerk已是大牛而blue还是菜鸟。blue经常拿一些自以为很难的问题去问AutoGerk，想难倒他，但是每次AutoGerk都能轻而易举地做出来。就在上个礼拜的星期天下午，AutoGerk正在玩游戏，blue又拿着他的问题来了。AutoGerk一看，依然是如此简单。AutoGerk很想

2015-07-23 08:38:22 885

baidu_29998627的博客