- 博客(29)
- 收藏
- 关注
RSS订阅转载 Home Work
1277: Home WorkTime Limit: 1000 Sec Memory Limit: 64 MBSubmit: 3 Solved: 2[Submit][Status][Web Board]Description临近开学了，大家都忙着收拾行李准备返校，但I_Love_C却不为此担心! 因为他的心思全在暑假作业上：目前为止还未开动(-_-!!还以为
2015-01-20 15:13:35
982
转载 Jesse's Code
1256: Jesse's CodeTime Limit: 1 Sec Memory Limit: 64 MBSubmit: 5 Solved: 3[Submit][Status][Web Board]DescriptionJesse是个数学迷，他最喜欢研究“哥德巴赫猜想”，因此他的计算机密码也都采用素数。 但一直用同一个密码是不安全的，所以他要经常更换他的密码
2015-01-20 14:31:47
514
转载 Redraiment的走法
1254: Redraiment的走法Time Limit: 1 Sec Memory Limit: 64 MBSubmit: 3 Solved: 2[Submit][Status][Web Board]DescriptionRedraiment是个聪明人，总是以奇怪的思考方法思考问题，但不知道为什么，他的解答总是最最巧妙，我们隆重地称他为诡异人！ 有一天Jes
2015-01-20 13:30:07
988
转载 做幻方
1170: 做幻方Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 8 Solved: 1[Submit][Status][Web Board]DescriptionApple最近迷上了做幻方，Apple还是个中高手，只要你说个奇数N就能把N*N的幻方做出来。其实你可以比他做得更好的。Apple总是画得很乱，而你可以
2015-01-20 11:42:12
1007
转载 吃糖果
吃糖果Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 25599 Accepted Submission(s): 7288Problem DescriptionHOHO，终于从Speakless手上赢走
2015-01-19 23:26:31
662
转载 多柱汉诺塔最优算法设计探究
多柱汉诺塔最优算法设计探究引言汉诺塔算法一直是算法设计科目的最具代表性的研究问题，本文关注于如何设计多柱汉诺塔最优算法的探究。最简单的汉诺塔是三个柱子（A、B、C），因此多柱汉诺塔的柱子个数M≥3。下面从三柱汉诺塔说起，慢慢深入我们要关心的问题。1. 三柱汉诺塔三柱汉诺塔是经典的汉诺塔问题，在算法设计中是递归算法的典型问题。其算法是这样的: 首先把A 柱上面的n-
2015-01-19 23:22:55
1676
1
转载 汉诺塔II
汉诺塔IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5592 Accepted Submission(s): 2710Problem Description经典的汉诺塔问题经常作为一个递归的经典例
2015-01-19 23:21:23
515
转载 18岁生日
18岁生日Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20598 Accepted Submission(s): 6487Problem DescriptionGardon的18岁生日就要到了，他当
2015-01-19 21:48:23
564
转载 最小公倍数（我忘了怎么写了！）
最小公倍数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36524 Accepted Submission(s): 20414Problem Description给定两个正整数，计算这两个数的最小公
2015-01-10 14:57:03
325
转载 排序
排序Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36744 Accepted Submission(s): 10405Problem Description输入一行数字，如果我们把这行数字中的‘5’
2015-01-10 14:22:59
337
转载 Ignatius's puzzle
Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6841 Accepted Submission(s): 4716Problem DescriptionIgnatius
2015-01-10 12:12:56
1195
转载 A hard puzzle
A hard puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31902 Accepted Submission(s): 11391Problem Descriptionlcy gives a ha
2015-01-09 21:47:40
487
转载 Calendar Game（博弈）
Calendar GameTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2815 Accepted Submission(s): 1622Problem DescriptionAdam and Eve ent
2015-01-09 19:06:26
447
转载 An Easy Task
An Easy TaskTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15078 Accepted Submission(s): 9627Problem DescriptionIgnatius was bor
2015-01-09 17:52:03
280
转载 DFS
DFSTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5578 Accepted Submission(s): 3450Problem DescriptionA DFS(digital factoria
2015-01-07 16:02:55
331
转载 亲和串
亲和串Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8527 Accepted Submission(s): 3894Problem Description人随着岁数的增长是越大越聪明还是越大越笨，这
2015-01-07 15:17:29
511
转载 熊猫阿波的故事（无顺序抽签问题）
熊猫阿波的故事Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4680 Accepted Submission(s): 3591Problem Description凡看过功夫熊猫这部电影的人都会对影片
2015-01-07 12:21:45
425
转载 Eddy's AC难题
Eddy's AC难题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3972 Accepted Submission(s): 1856Problem DescriptionEddy是个ACMer,他不
2015-01-07 12:06:26
358
转载 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活
悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15962 Accepted Submission(s): 6758Problem Description
2015-01-07 10:30:32
308
转载 MagicBuilding
MagicBuildingTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1524 Accepted Submission(s): 675Problem DescriptionAs the increa
2015-01-07 10:23:30
318
转载 刷票王
using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Timers;using System.Net;using System.IO;namespace ConsoleApplication1{ class Program {
2015-01-06 18:18:39
439
转载 悼念512汶川大地震遇难同胞——重建希望小学
悼念512汶川大地震遇难同胞——重建希望小学Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4618 Accepted Submission(s): 3118Problem Description下面是
2015-01-05 19:41:18
743
转载 素数表
在求解一些问题时，并不是要求判断某一个数是否为素数，而是求解某一区间里面所有的素数，用传统的方法也可以做（先判断后输入），现在有了这个代码，可以有效地判断数字！当然了当区间很大时，这个代码就不适合了！#include#include int num[1000]={1,1};int primes[500];int main(){ int len=0; memset(num,0,si
2015-01-05 19:27:59
302
转载 寻找最大数（三）
寻找最大数（三）时间限制：1000 ms | 内存限制：65535 KB难度：2描述给出一个整数N，每次可以移动2个相邻数位上的数字，最多移动K次，得到一个新的整数。求这个新的整数的最大值是多少。输入多组测试数据。每组测试数据占一行，每行有两个数N和K (1 ≤ N≤ 10^18; 0 ≤ K ≤ 100).输出每组测试数据的
2015-01-05 14:37:51
434
转载 悼念512汶川大地震遇难同胞——一定要记住我爱你（数学函数floor和ceil的应用）
悼念512汶川大地震遇难同胞——一定要记住我爱你Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7615 Accepted Submission(s): 4672Problem Description当
2015-01-04 22:00:36
423
转载 奇数阶魔方
奇数阶魔方Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2232 Accepted Submission(s): 1229Problem Description一个 n 阶方阵的元素是1,2,...,
2015-01-02 17:39:40
382
转载 猜数字
猜数字Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3561 Accepted Submission(s): 2553Problem DescriptionA有1数m，B来猜.B每猜一次，A就说"太大
2015-01-02 14:00:24
424
转载 取(m堆)石子游戏(尼姆博弈)
取(m堆)石子游戏Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1921 Accepted Submission(s): 1107Problem Descriptionm堆石子,两人轮流取.只能在1堆中取.取
2015-01-01 20:34:02
528
转载 尼姆博弈
尼姆博弈有三堆各若干个物品，两个人轮流从某一堆取任意多的物品，规定每次至少取一个，多者不限，最后取光者得胜。这种情况最有意思，它与二进制有密切关系，我们用（a，b，c）表示某种局势，首先（0，0，0）显然是奇异局势，无论谁面对奇异局势，都必然失败。第二种奇异局势是（0，n，n），只要与对手拿走一样多的物品，最后都将导致（0，0，0）。仔细分析一下，（1，2，3）也是奇异局势，无论对
2015-01-01 20:30:12
488
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人