- 博客(41)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 CodeForces 618B (找规律)
CodeForces 618BDescriptionBob has a permutation of integers from 1 to n. Denote this permutation as p. Thei-th element of p will be denoted aspi. For all pairs of distinct integers
2016-03-30 22:11:21
544
原创 HDU-2106(decimal system)(进制转换)
HDU-2106(decimal system)(进制转换)decimal systemTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4276 Accepted Submission(s): 2419
2016-03-30 21:57:25
388
原创 HDU-1087(Super Jumping! Jumping! Jumping!)(LCS)
HDU-1087(Super Jumping! Jumping! Jumping!)(LCS)Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31034
2016-03-30 21:51:17
417
原创 HDUOJ-1052（poj-2287）（田忌赛马）(贪心)
HDUOJ-1052（poj-2287）（田忌赛马）(贪心)Tian Ji -- The Horse RacingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24864 Accepted Submission(s)
2016-03-27 17:24:16
654
原创 poj1700(ny47)(过河问题)（贪心）
poj1700(ny47)(过河问题)（贪心）Crossing RiverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12680 Accepted: 4828DescriptionA group of N people wishes t
2016-03-26 17:46:00
836
1
原创 NBUT 1647
NBUT 1647 Description输入一个四个数字组成的整数 n,你的任务是数一数有多少种方法,恰好修改一个数字,把它 变成一个完全平方数(不能把首位修改成0)。比如n=7844,有两种方法:3844=62^2和7744=88^2。Input输入第一行为整数 T (1<=T<=1000),即测试数据的组数
2016-03-23 22:34:37
872
原创 UESTC 1271（dp动态规划）
UESTC 1271（dp动态规划） DescriptionDreams of finding lost treasure almost came true recently. A new machine called 'The Revealer' has been invented and it has been used to detect gold which h
2016-03-23 22:18:32
492
原创 UESTC 1012 （进制转换）（思维）
UESTC 1012 （进制转换）（思维）Description有一天人诹Lee在随手帮女神做题，突然女神发现了自己演算纸上的一个式子，但是式子只有两个加数却没有结果，最近在学不同进制加减法的女神忘了这个两个数字是多少进制了（只记得是小于等于10），但是她很好奇在可能的多少进制下这个式子得到的答案长度最长，为了从人赢Lee手中抢走女神，你需要快速计算出这个答案，例如78+87
2016-03-23 22:07:08
437
原创 UESTC 1012 （思维）（找规律）
UESTC 1012(找规律)Description有一天人诹Lee在随手帮女神做题，突然女神发现了自己演算纸上的一个式子，但是式子只有两个加数却没有结果，最近在学不同进制加减法的女神忘了这个两个数字是多少进制了（只记得是小于等于$10$），但是她很好奇在可能的多少进制下这个式子得到的答案长度最长，为了从人赢Lee手中抢走女神，你需要快速计算出这个答案，例如$78+87
2016-03-23 18:59:30
515
原创 HDU-5636(Shortest Path)（floyd最短路径）
HDU-5636(Shortest Path)（floyd最短路径）Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1393 Accepted Submission(s): 440Problem Descrip
2016-03-17 22:17:20
598
原创 BZOJ-2190（仪仗队）（欧拉函数）
BZOJ-2190（仪仗队）（欧拉函数）Crawling in process...Crawling failedTime Limit:10000MS Memory Limit:265216KB 64bit IO Format:%lld & %llu SubmitStatus Description 作为体育委员，C君负责
2016-03-16 22:24:07
1517
原创 HDU-5615(Jam's math problem)(方程求解)
HDU-5615-Jam's math problem（方程求解）Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 870 Accepted Submission(s): 415Problem Description
2016-03-15 19:23:54
476
原创 bzoj 2456 mode
modeCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:1024KB 64bit IO Format:%lld & %lluSubmitStatus Description给你一个n个数的数列，其中某个数出现了超过n div 2次即众数，
2016-03-15 17:54:56
319
原创 HDU-1716()(全排列+重集排列)
HDU-1716()(全排列+重集排列)排列2Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6418 Accepted Submission(s): 2475Problem DescriptionRa
2016-03-15 15:43:14
1035
原创 HDU-1878(欧拉回路)(并查集)
欧拉回路Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11723 Accepted Submission(s): 4301Problem Description欧拉回路是指不令笔离开纸面，可画过图中每条边仅一
2016-03-15 12:38:57
858
原创 HDU-1205(吃糖果)
吃糖果Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 32022 Accepted Submission(s): 9106Problem DescriptionHOHO，终于从Speakless手上赢走了所有的
2016-03-15 12:11:28
326
原创 HDU-2084(数塔)(动态规划)
HDU-2084(数塔)(动态规划)数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 32883 Accepted Submission(s): 19659Problem Description在讲述
2016-03-15 11:56:45
445
原创 Game
GameCrawling in process...Crawling failedTime Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionThere is a legend in the IT City
2016-03-12 21:31:02
318
原创 Interview（位运算）
InterviewCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 631A Description
2016-03-12 20:11:49
440
原创 Divisibility（区间）
DivisibilityCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 597A Descript
2016-03-12 19:43:25
333
原创 Infinite Sequence
Infinite SequenceCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 622A Des
2016-03-12 19:36:54
567
原创 Tricky Sum(等比数列)
Tricky SumCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 598A Descriptio
2016-03-12 18:36:50
622
原创 Wilbur and Swimming Pool(矩形求面积)
Wilbur and Swimming PoolCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 596A
2016-03-12 18:25:25
315
原创 HDOJ--5611（Baby Ming and phone number）（闰年）
Baby Ming and phone numberTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1675 Accepted Submission(s): 437Problem DescriptionBaby
2016-03-12 18:09:29
409
原创 Indivisibility（最大公约数+排列组合）
Indivisibility（最大公约数+最小公倍数+排列组合）Crawling in process...Crawling failedTime Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionI
2016-03-11 22:00:33
1180
原创 Benches（排列组合）
Benches（排列组合）Time Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe city park of IT City contains n east to west paths and n north
2016-03-11 20:17:06
1455
原创 Hexagons!（找规律）
Hexagons!Crawling in process...Crawling failedTime Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionAfter a probationary period
2016-03-11 12:05:52
918
原创 Lucky Numbers（排列问题）（数学）（n个数排列且可重复用，元素个数不定）(等比数列)
Lucky Numbers（排列问题）（数学）（n个数排列且可重复用，元素个数不定）Lucky NumbersCrawling in process...Crawling failedTime Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus
2016-03-11 11:28:36
718
原创 CodeForces 626B
CodeForces 626B DescriptionCatherine has a deck of n cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions:take an
2016-03-09 20:49:48
426
原创 POJ-3187(Backward Digit Sums)(全排列+dfs())
POJ-3187(Backward Digit Sums)(全排列+dfs())Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5706 Accepted: 3309DescriptionFJ and his cows enjoy playing a me
2016-03-09 20:28:02
672
原创 HDU-1027(Ignatius and the Princess II)(全排列dfs（）)
HDU-1027(Ignatius and the Princess II)(全排列dfs（）)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6410 Accepted Submission(s): 3793Pr
2016-03-09 20:02:34
331
原创 HDOJ-2058(The sum problem)(找规律)（数学）
HDOJ-2058(The sum problem)(找规律)（数学）Problem DescriptionGiven a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M. Input
2016-03-03 21:43:47
1156
原创 HDOJ-2057（A + B Again）
HDOJ-2057（A + B Again）Problem DescriptionThere must be many A + B problems in our HDOJ , now a new one is coming.Give you two hexadecimal integers , your task is to calculate the sum of them,a
2016-03-03 19:52:33
2584
原创 HDOJ-1242(Rescue)(bfs+优先队列)
HDOJ-1242(Rescue)Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task
2016-03-03 18:10:52
378
原创 HDOJ-1312(Red and Black)(dfs)
Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15316 Accepted Submission(s): 9481Problem DescriptionThere is a rect
2016-03-03 16:22:10
344
原创 HDOJ-2053(Switch Game)(规律)
Switch GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14484 Accepted Submission(s): 8863Problem DescriptionThere are many la
2016-03-02 21:57:39
894
原创 HDOJ-2056（Rectangles）
RectanglesTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19475 Accepted Submission(s): 6316Problem DescriptionGiven two rectangl
2016-03-02 20:57:21
1832
原创 HDOJ-2052（Picture）
HDOJ-2052（Picture）PictureTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23398 Accepted Submission(s): 11936Problem Description
2016-03-01 22:05:26
418
原创 ny860(又见01背包)
ny860又见01背包时间限制：1000 ms | 内存限制：65535 KB难度：3描述 有n个重量和价值分别为wi和 vi 的物品，从这些物品中选择总重量不超过 W 的物品，求所有挑选方案中物品价值总和的最大值。1111输入多组测试数据。每组测试数据第一行输入，n和 W ，接下来有n行，每行输入两个数，代表第i个物品的
2016-03-01 11:39:59
376
原创 Light Oj1079、hdu2955
Light Oj1079、hdu2955DescriptionAsHarry Potter series is over, Harry has no job. Since he wants to make quickmoney, (he wants everything quick!) so he decided to rob banks. He wants tomake a calcul
2016-03-01 11:37:07
296
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人