Chunzhen的博客

Andryusha and Colored Balloonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndryusha goes through a par

HopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2780 Accepted: 1944DescriptionThe cows play the child's game of hopscotch in a non-traditiona

Meteor ShowerTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12487Accepted: 3375DescriptionBessie hears that an extraordina

Red and BlackTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 27110Accepted: 14737DescriptionThere is a rectangular room, covere

排列2 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6087    Accepted Submission(s): 2335Problem DescriptionRay又对数字的列产生了兴趣：

三个水杯时间限制：1000 ms  |  内存限制：65535 KB难度：4描述 给出三个水杯，大小不一，并且只有最大的水杯的水是装满的，其余两个为空杯子。三个水杯之间相互倒水，并且水杯没有标识，只能根据给出的水杯体积来计算。现在要求你写出一个程序，使其输出使初始状态到达目标状态的最少次数。输入第一行一个整数N(0接下来每组测试数据有两行，第一行给出三个整数V1

非常可乐Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7983    Accepted Submission(s): 3184Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，

Dating with girls(2)Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2694    Accepted Submission(s): 754Problem DescriptionIf y

部分和问题时间限制：1000 ms  |  内存限制：65535 KB难度：2描述 给定整数a1、a2、.......an，判断是否可以从中选出若干数，使它们的和恰好为K。输入首先，n和k，n表示数的个数，k表示数的和。接着一行n个数。（1输出如果和恰好可以为k，输出“YES”，并按输入顺序依次输出是由哪几个数的和组成，否则“NO”样例输入4 13

Curling 2.0Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15474Accepted: 6400DescriptionOn Planet MM-21, after their Olympic

Cow ExhibitionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10929Accepted: 4338Description"Fat and docile, big and dumb, they

New Year and Fireworkstime limit per test2.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne tradition of welcoming the New

1489 蜥蜴和地下室题目来源： CodeForces基准时间限制：1 秒 空间限制：131072 KB 分值: 10 难度：2级算法题 收藏 关注哈利喜欢玩角色扮演的电脑游戏《蜥蜴和地下室》。此时，他正在扮演一个魔术师。在最后一关，他必须和一排的弓箭手战斗。他唯一能消灭他们的办法是一个火球咒语。如果哈利用他的火球咒语攻击第i

1219 - Mafia  PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBDon Seliari gives his right hand Tommas Angelo (Tommy) a

The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23896 Accepted: 9206 Special JudgeDescriptionThe game “The Pilots

Shortest PathTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 821    Accepted Submission(s): 274Problem DescriptionThere is a p

Igor In the Museumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIgor is in the museum and he wants to see

Prime PathTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15098Accepted: 8502DescriptionThe ministers of the cabinet were quite

DeBruijinTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 681    Accepted Submission(s): 396Problem Description旋转鼓的表面分成m块扇形,如图所示(m=

Problem 2188 过河IAccept: 107    Submit: 262Time Limit: 3000 mSec    Memory Limit : 32768 KB Problem Description一天，小明需要把x只羊和y只狼运输到河对面。船可以容纳n只动物和小明。每次小明划船时，都必须至少有一只动物来陪他，不然他会感到厌倦，不安

Lake CountingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 24999Accepted: 12619DescriptionDue to recent rains, water has pool

Catch That CowTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9927    Accepted Submission(s): 3107Problem DescriptionFarmer Jo

SeedingTime Limit: 2 Seconds      Memory Limit: 65536 KB It is spring time and farmers have to plant seeds in the field. Tom has a nice field, which is a rectangle with n * m squares. There

Avoid The Lakes Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6964 Accepted: 3697DescriptionFarmer John's farm was flooded

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34066    Accepted Submission(s): 15082Problem DescriptionA ring

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18204    Accepted Submission(s): 10495Problem DescriptionThe GeoSurvCo

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

N皇后问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12904    Accepted Submission(s): 5811Problem Description在N*N的方格棋盘放置了N个皇后，使得它们

擅长排列的小明时间限制：1000 ms  |            内存限制：65535 KB难度：4描述 小明十分聪明，而且十分擅长排列计算。比如给小明一个数字5，他能立刻给出1-5按字典序的全排列，如果你想为难他，在这5个数字中选出几个数字让他继续全排列，那么你就错了，他同样的很擅长。现在需要你写一个程序来验证擅长排列的小明到底对不对。输入第一行输入整数N（1每

组合数时间限制：3000 ms  |            内存限制：65535 KB难度：3描述 找出从自然数1、2、... 、n（0输入输入n、r。输出按特定顺序输出所有组合。特定顺序：每一个组合中的值从大到小排列，组合之间按逆字典序排列。样例输入5 3样例输出543542541532531521432431421321

ZipperTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7781    Accepted Submission(s): 2754Problem DescriptionGiven three strings,

变形课Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 17924    Accepted Submission(s): 6446Problem Description呃......变形课上Harry碰到了一点小

LottoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6589 Accepted: 4178DescriptionIn the German Lotto you have to select 6 numbers from the set {1,2,...,

Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22572 Accepted: 9288 Special JudgeDescriptionGiven a positive integer n, write a prog

Catch himTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 687    Accepted Submission(s): 316Problem Description在美式足球中，四分卫负责指挥整只

Calling Extraterrestrial Intelligence AgainTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4871    Accepted Submission(s): 2569Probl

Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20940 Accepted: 8118DescriptionYou are trapped in a 3D dungeon and need to find the quickest

迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11290 Accepted: 6751Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,

SubstringsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8078    Accepted Submission(s): 3688Problem DescriptionYou are given a n

最少步数时间限制：3000 ms  |  内存限制：65535 KB难度：4描述 这有一个迷宫，有0~8行和0~8列： 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1 1,1,0,