铁树银花 - 博客园

Red and Black（DFS入门题）

摘要： Red and BlackTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4260Accepted Submission(s): 2766原题链接：点击打开链接Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a blac 阅读全文

posted @ 2012-09-04 20:42 铁树银花阅读(262) 评论(0) 推荐(0) 编辑

Tempter of the Bone（DFS + 奇偶剪枝，好题）

摘要： Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39780Accepted Submission(s): 10761原题链接：点击打开链接Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began 阅读全文

posted @ 2012-09-04 17:04 铁树银花阅读(719) 评论(0) 推荐(0) 编辑

STL -- vector

摘要： vector1.创建具有一定数量的元素且每个元素具有相同初始值的向量：vector<int> v(10, 1); //向量中有10个元素，每个元素都是12.用下标方式访问向量中的元素vector<int> v(3); //具有3个元素的向量v[1] = 2; //给第二个元素赋值，注意向量下标由0开始cout << v[2] << endl;3.用sort(需要声明头文件“#include<algorithm>”)给向量中的元素排序，若无声明排序函数，默认按照数值大小的非降序排列sort(v.begin(), v.end()); // 阅读全文

posted @ 2012-09-02 21:37 铁树银花阅读(174) 评论(0) 推荐(0) 编辑

Oil Deposits（DFS,基础题）

摘要： Oil DepositsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5776Accepted Submission(s): 3360原题链接：点击打开链接Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one larg 阅读全文

posted @ 2012-09-02 20:41 铁树银花阅读(196) 评论(0) 推荐(0) 编辑

变形课（DFS, 简单）

摘要：变形课Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 7064Accepted Submission(s): 2622原题链接：点击打开链接Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体.Harry已经将他所会阅读全文

posted @ 2012-09-02 17:45 铁树银花阅读(318) 评论(0) 推荐(0) 编辑

Find Terrorists（素数筛选+素因子分解）

摘要： Find TerroristsTime limit: 5 secondsThe Prime Minister and his Accumulated Council of Ministers(ACM) are trying hard to find all possible terrorist locations. In his dream, the Prime Minister gets a message from God suggesting that the answer to all terrorist problems are numbers(say one such number 阅读全文

posted @ 2012-09-02 15:45 铁树银花阅读(305) 评论(0) 推荐(0) 编辑

Minesweeper（暴力，注意特判）

摘要： MinesweeperTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 4335原题链接：点击打开链接DescriptionMinesweeper is a single-player computer game. Theobjective of the game is to clear an abstract minefield withoutdetonating a mine. When the game is started, the player is 阅读全文

posted @ 2012-09-02 09:11 铁树银花阅读(399) 评论(0) 推荐(0) 编辑

Large Division (大数取余，有个坑爹的地方)

摘要： Large Division Time Limit:1000MSMemory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatus原题链接：点击打开链接DescriptionGiven two integers, a and b, you should checkwhethera is divisible by b or not. We know that an integerais divisible by an integer b if and only if there exists an integercsuch that 阅读全文

posted @ 2012-09-01 21:38 铁树银花阅读(313) 评论(0) 推荐(0) 编辑

The Center of Gravity（一道很很简单的几何题）

摘要： The Center of GravityTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2994Accepted Submission(s): 1668原题链接：点击打开链接Problem DescriptionEveryone know the story that how Newton discovered the Universal Gravitation. One day, Newton walkedleisurely, sudden 阅读全文

posted @ 2012-09-01 19:13 铁树银花阅读(252) 评论(0) 推荐(0) 编辑

Relax! It's just a game(排列组合，简单)

摘要： Relax! It's just a gameTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 4365DescriptionYou: What's the score? Did I miss much?Me: It's 2-1 for elAhli and the second half just started. The first half was quite boring.You: Who scored first? elAhli 阅读全文

posted @ 2012-08-30 19:01 铁树银花阅读(263) 评论(0) 推荐(0) 编辑

code::blocks不能调试的可能原因

摘要： 1.不是建立project而是直接建立一个file。2.project的保存路径含有中文或空格（如果放在桌面就肯定会含有“桌面”这一中文词）阅读全文

posted @ 2012-08-30 15:59 铁树银花阅读(182) 评论(0) 推荐(0) 编辑

Game with points（数学，难度中）

摘要： Game with pointsTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeSGU 408DescriptionRecently Petya has discovered new game with points. Rules of the game are quite simple. First, there is onlyone pointA0 with coordinates (0, 0). Then Petya have to draw N anothe 阅读全文

posted @ 2012-08-29 21:09 铁树银花阅读(254) 评论(0) 推荐(0) 编辑

Scientific Problem(数学，简单)

摘要： Scientific ProblemTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeSGU 403DescriptionOnce upon a time Professor Idioticideasinventor was travelling by train. Watching cheerless landscape outside the window, he decided to invent the theme of his new scientific 阅读全文

posted @ 2012-08-29 20:23 铁树银花阅读(272) 评论(0) 推荐(0) 编辑

Weed（BFS）

摘要： I - WeedTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeSGU 344DescriptionAndrew has visited his garden for the last time many years ago. Today's property taxes are so high, so Andrew decided to sell his garden. The land was not cultivated for a long tim 阅读全文

posted @ 2012-08-29 10:59 铁树银花阅读(396) 评论(0) 推荐(0) 编辑

N皇后问题（DFS）

摘要： N皇后问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3579Accepted Submission(s): 1654Problem Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。Input共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。Outpu 阅读全文

posted @ 2012-08-28 09:33 铁树银花阅读(350) 评论(0) 推荐(0) 编辑

统计字符(字符串，简单)

摘要：统计字符Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5479Accepted Submission(s): 3418Problem Description统计一个给定字符串中指定的字符出现的次数Input测试输入包含若干测试用例，每个测试用例包含2行，第1行为一个长度不超过5的字符串，第2行为一个长度不超过80的字符串。注意这里的字符串包含空格，即空格也可能是要求被统计的字符之一。当读到'#'时输入结束，相应的结果不要输出。阅读全文

posted @ 2012-08-27 20:16 铁树银花阅读(289) 评论(0) 推荐(0) 编辑

Conversions（水）

摘要： ConversionsTime Limit: 1000/500 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1054Accepted Submission(s): 618Problem DescriptionConversion between the metric and English measurement systems is relatively simple. Often, it involves either multiplying or dividing by a c 阅读全文

posted @ 2012-08-25 23:05 铁树银花阅读(290) 评论(0) 推荐(0) 编辑

Equations（数学，水）

摘要： EquationsTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 689Accepted Submission(s): 315Problem DescriptionAll the problems in this contest totally bored you. And every time you get bored you like playing with quadratic equations of the form a*X2+ b 阅读全文

posted @ 2012-08-25 22:22 铁树银花阅读(329) 评论(0) 推荐(0) 编辑

Kaitou Kid - The Phantom Thief (1)（字符串，简单）

摘要： Kaitou Kid - The Phantom Thief (1)Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1498Accepted Submission(s): 666Problem DescriptionDo you know Kaitou Kid? In the legend, Kaitou Kid is a master of disguise, and can take on the voice and form of any 阅读全文

posted @ 2012-08-25 10:49 铁树银花阅读(438) 评论(0) 推荐(0) 编辑

The Great Team（好题）

摘要： The Great TeamTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1779DescriptionWhen a few students of the Ural State University finished their sport career, the university encountered a lot of problems in team composition. Veterans of sports programming de 阅读全文

posted @ 2012-08-24 21:40 铁树银花阅读(179) 评论(0) 推荐(0) 编辑

Anindilyakwa（简单）

摘要： AnindilyakwaTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1777DescriptionThe language of Australian aborigines anindilyakwa has no numerals. No anindilyakwa can say: “I've hooked eight fishes”. Instead, he says: “I've hooked as many fishes as m 阅读全文

posted @ 2012-08-24 16:51 铁树银花阅读(252) 评论(0) 推荐(0) 编辑

ACMer（数学，有意思）

摘要： ACMerTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2634Accepted Submission(s): 1190Problem DescriptionThere are at least P% and at most Q% students of HDU are ACMers, now I want to know how many students HDU have at least?InputThe input contains 阅读全文

posted @ 2012-08-24 11:56 铁树银花阅读(343) 评论(0) 推荐(0) 编辑

{A} + {B}

摘要： {A} + {B}Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7266Accepted Submission(s): 2948Problem Description给你两个集合，要求{A} + {B}.注:同一个集合中不会有两个相同的元素.Input每组输入数据分为三行,第一行有两个数字n,m(0<n,m<=10000),分别表示集合A和集合B的元素个数.后两行分别表示集合A和集合B.每个元素为不超出int范围的整数,每个元素阅读全文

posted @ 2012-08-24 10:28 铁树银花阅读(246) 评论(0) 推荐(0) 编辑

Enemy at the Gateway

摘要： Enemy at the GatewayTime Limit:8000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVA 11673DescriptionProblem HEnemy at the GatewayInput:Standard InputOutput:Standard OutputThis is the year 9002, the war between the Earth and Triton has broken out. Being a spy for the Earth, yo 阅读全文

posted @ 2012-08-21 19:34 铁树银花阅读(235) 评论(0) 推荐(0) 编辑

Income Tax Hazard (II) （数学，难）

摘要： Income Tax Hazard IITime Limit:1000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVA 11667DescriptionProblem BIncome Tax Hazard (II)Input:Standard InputOutput:Standard OutputThe word tax makes us unhappy and if it is income tax it saddens us even more (have you ever wondered w 阅读全文

posted @ 2012-08-21 16:08 铁树银花阅读(229) 评论(0) 推荐(0) 编辑

Logarithms (数学)

摘要： LogarithmsTime Limit:1000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVA 11666DescriptionProblemALogarithmsInput:Standard InputOutput:Standard OutputFrom time immemorial different series has been an integrated part of mathematics. Series is very important for finding values 阅读全文

posted @ 2012-08-20 21:30 铁树银花阅读(284) 评论(0) 推荐(0) 编辑

Codeforces Round #134 (Div. 2)A. Mountain Scenery(简单)

摘要： A. Mountain Scenerytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Bolek has found a picture withnmountain peaks painted on it. Thenpainted peaks are represented by a non-closed polyline, consisting of2nsegments. The segments go through2n 阅读全文

posted @ 2012-08-20 10:34 铁树银花阅读(191) 评论(0) 推荐(0) 编辑

取石子游戏（威佐夫博奕）

摘要：取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2009Accepted Submission(s): 950Problem Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问最后你是胜者还是阅读全文

posted @ 2012-08-19 20:35 铁树银花阅读(349) 评论(0) 推荐(0) 编辑

Codeforces Round #133 (Div. 2) A. Tiling with Hexagons(数学)

摘要： A. Tiling with Hexagonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSeveral ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the f 阅读全文

posted @ 2012-08-17 15:31 铁树银花阅读(326) 评论(0) 推荐(0) 编辑

Assistance Required（打表）

摘要： Assistance RequiredTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 719Accepted Submission(s): 384Problem DescriptionAfter the 1997/1998 Southwestern European Regional Contest (which was held in Ulm) a large contest party took place. The organizatio 阅读全文

posted @ 2012-08-16 17:05 铁树银花阅读(392) 评论(0) 推荐(0) 编辑

Lifting the Stone（※※※多边形重心）

摘要： Lifting the StoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3290 Accepted Submission(s): 1361Problem DescriptionThere are many secret openings in the floor which are covered by a big heavy stone. When the ... 阅读全文

posted @ 2012-08-15 21:01 铁树银花阅读(200) 评论(0) 推荐(0) 编辑

What Are You Talking About（字典树）

摘要： What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 7547Accepted Submission(s): 2335Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian 阅读全文

posted @ 2012-08-15 11:31 铁树银花阅读(503) 评论(0) 推荐(0) 编辑

The Hardest Problem Ever（字符串处理，易）

摘要： The Hardest Problem EverTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10638Accepted Submission(s): 4748Problem DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In 阅读全文

posted @ 2012-08-14 09:43 铁树银花阅读(266) 评论(0) 推荐(0) 编辑

Average is not Fast Enough!(格式化输入输出)

摘要： Average is not Fast Enough!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2354Accepted Submission(s): 923Problem DescriptionA relay is a race for two or more teams of runners. Each member of a team runs one section of the race. Your task is to hel 阅读全文

posted @ 2012-08-13 23:42 铁树银花阅读(273) 评论(0) 推荐(0) 编辑

Feynman（数学）

摘要： FeynmanTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionRichard Phillips Feynman was a well known American physicist and a recipient of the Nobel Prize in Physics. He worked in theoretical physics and also pioneered the field of quantum computing. He visited Sou 阅读全文

posted @ 2012-08-11 20:49 铁树银花阅读(298) 评论(0) 推荐(0) 编辑

Electricity（简单）

摘要： ElectricityTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionMartin and Isa stopped playing crazy games and finally got married. It's good news! They're pursuing a new life of happiness for both and, moreover, they're moving to a new house in a remote 阅读全文

posted @ 2012-08-11 20:46 铁树银花阅读(299) 评论(0) 推荐(0) 编辑

内存管理（链表，指针操作，繁琐）

摘要：内存管理Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeFZU 1893Description在为进程动态分配内存时,操作系统必须对其进行管理。一种管理内存的方式是，维护一张记录内存使用情况的表来模拟内存的存储情况，其任一表项可能是以下两种情况之一：一个已分配给进程的内存区或者一个空闲的内存区。表中每一个表项含有以下内容：空闲区或已使用内存区的指示标志、内存大小、指向下一表项的指针。一个表项一般有一个前驱表项和一个后继表项（除非这个表项是内存的最底端或最顶端），已阅读全文

posted @ 2012-08-11 10:55 铁树银花阅读(498) 评论(0) 推荐(0) 编辑

[置顶] Card

摘要： CardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 664Accepted Submission(s): 322Problem DescriptionBearchild is playing a card game with himself. But first of all, he needs to shuffle the cards. His strategy is very simple: After putting all the 阅读全文

posted @ 2012-08-10 16:29 铁树银花阅读(241) 评论(0) 推荐(0) 编辑

[置顶] Hamming Problem（打表，需技巧，不错的题）

摘要： Hamming ProblemTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeFZU 1045DescriptionFor each three prime numbers p1, p2 and p3, let's define Hamming sequence Hi(p1, p2, p3), i=1, ... as containing in increasing order all the natural numbers whose only prim 阅读全文

posted @ 2012-08-09 17:09 铁树银花阅读(146) 评论(0) 推荐(0) 编辑

Escape Time II（DFS搜索）

摘要： Escape Time IITime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusPracticeZOJ 3620DescriptionThere is a fire in LTR ’ s home again. The fire can destroy all the things intseconds, so LTR has to escape intseconds. But there are some jewels in LTR ’ s rooms, LTR love jewels 阅读全文

posted @ 2012-08-09 17:00 铁树银花阅读(251) 评论(0) 推荐(0) 编辑

导航

公告