上一页 1 ··· 26 27 28 29 30 31 32 33 34 ··· 41 下一页

HDU 1720 A+B Coming

摘要: A+B ComingTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3359Accepted Submission(s): 2087Problem DescriptionMany classmates said to me that A+B is must needs.If you can’t AC this problem, you would invite me for night meal. ^_^InputInput may conta 阅读全文
posted @ 2012-07-15 18:12 江财小子 阅读(144) 评论(0) 推荐(0) 编辑

POJ 1287 Networking

摘要: NetworkingTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4457Accepted: 2421DescriptionYou are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of point 阅读全文
posted @ 2012-07-15 18:08 江财小子 阅读(168) 评论(0) 推荐(0) 编辑

POJ 2739 Sum of Consecutive Prime Numbers

摘要: Sum of Consecutive Prime NumbersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13616Accepted: 7590DescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integ 阅读全文
posted @ 2012-07-15 18:05 江财小子 阅读(1064) 评论(0) 推荐(0) 编辑

回文字符串 (动态规划)

摘要: 回文字符串时间限制:3000 ms | 内存限制:65535 KB难度:4描述所谓回文字符串,就是一个字符串,从左到右读和从右到左读是完全一样的,比如"aba"。当然,我们给你的问题不会再简单到判断一个字符串是不是回文字符串。现在要求你,给你一个字符串,可在任意位置添加字符,最少再添加几个字符,可以使这个字符串成为回文字符串。输入第一行给出整数N(0<N<100)接下来的N行,每行一个字符串,每个字符串长度不超过1000.输出每行输出所需添加的最少字符数样例输入1Ab3bd样例输出2来源IOI 2000上传者//很神奇的一道动态规划,//输入字符串后,逆序,然后 阅读全文
posted @ 2012-07-15 11:11 江财小子 阅读(5949) 评论(0) 推荐(1) 编辑

八数码

摘要: 2 6 4 1 3 7 0 5 88 1 5 7 3 6 4 0 231treap sbt splay//今天写的八数码 速度不行呀、老超时、照着白皮书写的#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <queue>#define MAXSIZE 362888using namespace std;typedef int State[9];State st[MAXSIZE],goal;int dis[MAXSIZ 阅读全文
posted @ 2012-07-14 22:38 江财小子 阅读(223) 评论(0) 推荐(0) 编辑

HDU 1395 2^x mod n = 1

摘要: 2^x mod n = 1Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6543Accepted Submission(s): 1961Problem DescriptionGive a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.InputOne positive integer on each line, the value of n.OutputIf 阅读全文
posted @ 2012-07-13 21:49 江财小子 阅读(255) 评论(0) 推荐(0) 编辑

POJ 3320 Jessica's Reading Problem

摘要: Jessica's Reading ProblemTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5592Accepted: 1646DescriptionJessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to ma 阅读全文
posted @ 2012-07-13 20:08 江财小子 阅读(261) 评论(0) 推荐(0) 编辑

POJ 1840 Eqs

摘要: EqsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 8484Accepted: 4187DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0The coefficients are given integers from the interval [-50,50].It is consider a solution a system (x1, x2, x3, x4, x5) that verifi 阅读全文
posted @ 2012-07-13 18:42 江财小子 阅读(132) 评论(0) 推荐(0) 编辑

HDU 2492 Ping pong

摘要: Ping pongTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1786Accepted Submission(s): 644Problem DescriptionN(3<=N<=20000) ping pong players live along a west-east street(consider the street as a line segment). Each player has a unique skill r 阅读全文
posted @ 2012-07-13 16:57 江财小子 阅读(380) 评论(0) 推荐(0) 编辑

HDU 3006 The Number of set

摘要: The Number of setTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 722Accepted Submission(s): 437Problem Description Given you n sets.All positive integers in sets are not less than 1 and not greater than m.If use these sets to combinate the new set, 阅读全文
posted @ 2012-07-13 15:51 江财小子 阅读(201) 评论(0) 推荐(0) 编辑
上一页 1 ··· 26 27 28 29 30 31 32 33 34 ··· 41 下一页