11 2013 档案

B. Valera and Contest
摘要：B. Valera and Contesttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera loves to participate in competitions. Especially in programming contests. Today he has participated in the contest with his team, consisting of n students (including Valer 阅读全文

posted @ 2013-11-30 10:34 _log__ 阅读(181) 评论(0) 推荐(0) 编辑

Problem 2128 最长子串
摘要：Problem 2128 最长子串Accept: 55Submit: 209Time Limit: 3000 mSecMemory Limit : 65536 KBProblem Description问题很简单，给你一个字符串s，问s的子串中不包含s1,s2...sn的最长串有多长。Input输入包含多组数据。第一行为字符串s,字符串s的长度1到10^6次方，第二行是字符串s不能包含的子串个数n,n#include#include#include#include#include#include#define maxn 100002#define LL long longusing names 阅读全文

posted @ 2013-11-28 23:20 _log__ 阅读(255) 评论(0) 推荐(0) 编辑

Problem 2125 简单的等式
摘要：Problem 2125 简单的等式Accept: 96Submit: 375Time Limit: 1000 mSecMemory Limit : 32768 KBProblem Description现在有一个等式如下：x^2+s(x,m)x-n=0。其中s(x,m)表示把x写成m进制时，每个位数相加的和。现在，在给定n，m的情况下，求出满足等式的最小的正整数x。如果不存在，请输出-1。Input有T组测试数据。以下有T(T#include#include#include#include#include#include#define maxn 50002#define LL long lo 阅读全文

posted @ 2013-11-28 23:18 _log__ 阅读(188) 评论(0) 推荐(0) 编辑

pzoj Problem 2127 养鸡场
摘要：Problem 2127 养鸡场Accept: 59Submit: 211Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionJason买来了n米长的竹篱笆，打算将n米长的竹篱笆全部用来围成一个三角形的养鸡场。为方便起见，养鸡场三条边的长度都为正整数。同时，他想让自己的养鸡场看起来更美观一些，要求三条边的长度分别在一个区间范围内。现在，他想知道有多少种不同的方案使得围成的养鸡场满足要求？Input输入包含多组数据。输入数据第一行是一个正整数n，表示竹篱笆的长度。在接下来三行中，第i行的两个正整数为xi，yi。表示三角形的 阅读全文

posted @ 2013-11-28 23:14 _log__ 阅读(7389) 评论(0) 推荐(0) 编辑

热身赛题重现江湖
摘要：热身赛题重现江湖Time Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 13Accepted Submission(s) : 4Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description曾经有人问我，正式比赛会不会有跟热身赛一样的题。我当时说这是个坑。嗯，没错，坑一次。反正，你们都没有在比赛结束后好好思考过这道题吧~~啦啦啦~~啦啦啦~~一本书的页面从自然数1开始顺 阅读全文

posted @ 2013-11-26 17:46 _log__ 阅读(201) 评论(0) 推荐(0) 编辑

B. Levko and Array
摘要：B. Levko and Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLevko has an array that consists of integers:a1, a2, ... , an. But he doesn’t like this array at all.Levko thinks that the beauty of the arrayadirectly depends on valuec(a), which 阅读全文

posted @ 2013-11-22 23:10 _log__ 阅读(397) 评论(0) 推荐(0) 编辑

hdu4778Gems Fight!
摘要：Gems Fight!Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 566Accepted Submission(s): 239Problem Description Alice and Bob are playing "Gems Fight!": There are Gems of G different colors , packed in B bags. Each bag has several Gems. 阅读全文

posted @ 2013-11-22 18:19 _log__ 阅读(170) 评论(0) 推荐(0) 编辑

hdu4770Lights Against Dudely
摘要：Lights Against DudelyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 680Accepted Submission(s): 204Problem DescriptionHarry: "But Hagrid. How am I going to pay for all of this? I haven't any money." Hagrid: "Well there's your 阅读全文

posted @ 2013-11-21 19:30 _log__ 阅读(173) 评论(0) 推荐(0) 编辑

hdu1695GCD
摘要：GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4737Accepted Submission(s): 1693Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x an 阅读全文

posted @ 2013-11-18 23:12 _log__ 阅读(187) 评论(0) 推荐(0) 编辑

RAZLIKA
摘要：DescriptionMirko's newest math homework assignment is a very difficult one! Given a sequence, V, of N integers,remove exactly K of them from the sequence. Let M be the largest difference of any two remainingnumbers in the sequence, and m the smallest such difference. Select the K integers to be 阅读全文

posted @ 2013-11-02 21:32 _log__ 阅读(240) 评论(0) 推荐(0) 编辑