the apple tree

the apple tree

A long time ago, there was a huge apple tree.

A little boy loved to come and lay around it every day. He climbed to the tree top, ate

-the apples, took a nap under the shadow... He loved the tree and the tree loved to play with

him. Time went by... the little boy had grown up and he no longer played around the tree every

day. One day, the boy came back to the tree and he looked sad. "Come and play with me," the

tree asked the boy. "I am no longer a kid, I don‘t play around trees anymore." The boy

replied, "I want toys. I need money to buy them." "Sorry, but I don‘t have money...but you

can pick all my apples and sell them. So, you will have money." The boy was so excited.

He grabbed all the apples on the tree and left happily. The boy never came back after he

picked the apples.The tree was sad.One day, the boy returned and the tree was so excited.

"Come and play with me," the tree said. "I don‘t have time to play. I have to work for

my family. We need a house for shelter. Can you help me?" "Sorry, but I don‘t have a

house. But you can chop off my branches to build your house." So the boy cut all the branches

off the tree and left happily. The tree was glad to see him happy but the boy never came

back since then. The tree was again lonely and sad.One hot summer day, the boy returned

and the tree was delighted. "Come and play with me!" the tree said. "I am sad and

getting old. I want to go sailing to relax myself. Can you give me a boat?" "Use my

trunk to build your boat. You can sail far away and be happy." So the boy cut the

tree trunk to make a boat. He went sailing and never showed up for a long time. The tree was

happy, but it was not true.Finally, the boy returned after he left for so many years. "Sorry,

my boy. But I don’t have anything for you anymore. No more apples for you..." the tree said.

"I don’t have teeth to bite," the boy replied. "No more trunk for you to climb on."

"I am too old for that now," the boy said. "I really can‘t give you anything... the only

thing left is my dying roots,” the tree said with tears.“I don’t need much now, just a place

to rest. I am tired after all these years.” The boy replied. “Good! Old tree roots is the best

place to lean on and rest. Come, Come sit down with me and rest.” The boy sat down and the tree

was glad and smiled with tears...This is a story of everyone. The tree is our parent. When we

were young, we loved to play with Mom and Dad... When we grown up, we left them, and only came

to them when we need something or when we are in trouble. No matter what, parents will always be

there and give everything they could to make you happy. You may think that the boy is cruel to

the tree but that’s how all of us are treating our parents.

转载自:http://dazi.kukuw.com/art_show_389196.html

the apple tree

时间: 2024-08-08 01:26:22

the apple tree的相关文章

POJ3321 Apple Tree

Apple Tree Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 26989   Accepted: 8004 Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been

timus 1018. Binary Apple Tree

1018. Binary Apple Tree Time limit: 1.0 secondMemory limit: 64 MB Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous branch splits up to exactly two new branches. We will enu

poj 2486 a apple tree

题意:n节点的树,从1开始走,总共v步,每个点都有一个价值,求可以获得的最大价值 分析:这个显然可以走回来,那么就加一维表示是否走回祖先 dp[u][i][j]表示从u为根节点的子树,往下走i步,j=0表示不走回来,j=1表示走回来 那么可以得到状态转移方程,不走回来的可能会影响走回来的,如果先算不会来的,那么一个节点在不走回来算一次 在走回来又算一次,所以先算走回来的就可以避免 dp[u][i][0]=max(dp[u][i][0],dp[u][i-j][1]+dp[v][j-1][0]);

cf202-div 1-B - Apple Tree:搜索,数论,树的遍历

http://codeforces.com/contest/348/problem/B B. Apple Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a rooted tree with n vertices. In each leaf vertex there's a single

ural 1018 Binary Apple Tree

1018. Binary Apple Tree Time limit: 1.0 secondMemory limit: 64 MB Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous branch splits up to exactly two new branches. We will enu

2014 Multi-University Training Contest 6 Apple Tree(数学题)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4925 Apple Tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 176    Accepted Submission(s): 120 Problem Description I've bought an orchard an

HDU 4925 Apple Tree(推理)

HDU 4925 Apple Tree 题目链接 题意:给一个m*n矩阵种树,每个位置可以选择种树或者施肥,如果种上去的位置就不能施肥,如果施肥则能让周围果树产量乘2,问最大收益 思路:推理得到肯定是果树和肥料交叉种好,类似国际象棋棋盘,黑的种,白的施肥,由于格子数不多,直接去枚举每个位置即可.如果题目格子数多的话,其实也可以推出公式一步得到答案 代码: #include <cstdio> #include <cstring> const int d[4][2] = {{0, 1}

HDU 4925 Apple Tree (瞎搞)

找到规律,各一个种一棵树,或者施肥.先施肥,先种树一样. Apple Tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 197    Accepted Submission(s): 135 Problem Description I've bought an orchard and decide to plant some

hdu 4925 Apple Tree

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4925 思路:直接计算坐标和,如果为奇数就种树,但要注意行或列为1的情况. 写啦两种代码:一种直接判断计算的,另一种优化计算的 code1: #include<cstdio> #include<iostream> #include<algorithm> #include<cmath> using namespace std; int main() { int T;

POJ-3321 Apple Tree 【DFS序+树状数组】

Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree. The tree has N forks which are connected by branches.