The fruit in mid-summer

Probably giving up
Is the only means to get closer to you
Probably you will only think of me
When I no longer meet you

Time flies by
The fruit in mid-summer
Still radiates odor full of loneliness in my memory

I will try to leave you
Never think about you again
Although this is not my original intention

You have said
That you would love me for ever
Probably promises
Are made only because of uncertainty

Don‘t use your silence
To cover up anything
When the outcome is so blatantly conspicuous

I thought you would have said something
Before you left me
But you simply turned your head
And refrained from looking at me

Don‘t deliberately say
You still love me
When I see sea current undulates
What matters is your remembering me

You have said
That you would love me for ever
Probably promises
Only proves uncertainty

Don‘t feel sad
Don‘t cover up anything
When the outcome is hat blatantly conspicuous

You don‘t actually have to say anything
To leave me behind
At least the memories of the past belong to me

Probably giving up
Is the only means to get closer to you
Probably you will only think of me
When I no longer meet you

Time flies by
The fruit in mid-summer
Still radiates odor of love in my memory

I thought I wouldn‘t let you perceive anything
But my thoughts were too obvious that they escaped my control
Probably that truly represented my heart

If you would dream of me
Please
Hug me tightly

时间: 2024-11-05 14:38:17

The fruit in mid-summer的相关文章

HDU 2152 Fruit( DP )

Fruit Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3514    Accepted Submission(s): 1998 Problem Description 转眼到了收获的季节,由于有TT的专业指导,Lele获得了大丰收.特别是水果,Lele一共种了N种水果,有苹果,梨子,香蕉,西瓜……不但味道好吃,样子更是好看. 于是,

35.MID() 函数

MID() 函数 MID() 函数 MID 函数用于从文本字段中提取字符. SQL MID() 语法 SELECT MID(column_name,start[,length]) FROM table_name 参数 描述 column_name 必需.要提取字符的字段. start 必需.规定开始位置(起始值是 1). length 可选.要返回的字符数.如果省略,则 MID() 函数返回剩余文本. SQL MID() 实例 我们拥有下面这个 "Persons" 表: Id Last

[2012山东省第三届ACM大学生程序设计竞赛]——Fruit Ninja II

Fruit Ninja II 题目:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2416 Time Limit: 5000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 Have you ever played a popular game named "Fruit Ninja"? Fruit Ninja (known as Fruit Ninja

sdut 2416:Fruit Ninja II(第三届山东省省赛原题,数学题)

Fruit Ninja II Time Limit: 5000MS Memory limit: 65536K 题目描述 Have you ever played a popular game named "Fruit Ninja"?Fruit Ninja (known as Fruit Ninja HD on the iPad and Fruit Ninja THD for Nvidia Tegra 2 based Android devices) is a video game de

微博地址url(id)与mid的相互转换 Java版

原理: 新浪微博的URL都是如:http://weibo.com/2480531040/z8ElgBLeQ这样三部分. 第一部分(绿色部分)为新浪微博的域名,第二部分(红色部分)为博主Uid,第三部分(蓝色)为一串貌似随机的字符串. 如果通过方法能计算出蓝色字串与返回的数组里的对应关系则好解决多了. 首先分组蓝色字串 ,从后往前4个字符一组,得到以下三组字符:z8ElgBLeQ 将它们分别转换成62进制的数值则为 35, 2061702, 8999724  将它们组合起来就是一串 3520617

CString类常用方法----Left(),Mid(),Right() .

CString Left( int nCount ) const;                   //从左边1开始获取前 nCount 个字符 CString Mid( int nFirst ) const;                      //从左边第 nCount+1 个字符开始,获取后面所有的字符 CString Mid( int nFirst, int nCount ) const;    //从左边第 nFirst+1 个字符开始,获取后面  nCount 个字符 CS

FRUIT GIFTS STORE OPENCART 自适应主题模板 ABC-0324

FRUIT GIFTS STORE OPENCART 自适应主题模板 ABC-0324 Features: Coding: HTML5, CSS3, Semantic Code, jQuery, Responsive Gallery Script: Accordion, Carousel, Slider Modules: Account, Affiliate, Banner, Bestsellers, Carousel, Category, Featured, Google Talk, Info

hdu 4000 Fruit Ninja 树状数组

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4000 Recently, dobby is addicted in the Fruit Ninja. As you know, dobby is a free elf, so unlike other elves, he could do whatever he wants.But the hands of the elves are somehow strange, so when he cuts

EXCEL的IF+MID函数结合找出班级信息

如下图所示,我们编号列,其中第3位第4位代表的所在的班级,01代表的是1班,02代表的是2班,03代表的是3班.我们通过EXCEL函数如何找到对应的班级呢.我们从上边分析知道3,4位代表是班级.所以我们要先找出3,4位,EXCEL中提供了MID函数就是专门查找字符串指定位置的字符进行截取,下边是该函数语法MID(查找的字符串,查找字符串开始的位置,需要字符串个数)我们根据这个可以写出公式MID(C3,3,2),最后返回结果就是01,那么EXCEL函数就解决了第一个问题.找到了代表班级的编号了.下

bzoj4393: [Usaco2015 Dec]Fruit Feast

题意: T,A,B.T是上限.A和B可以随意吃但是不能超过T.有一次将吃的东西/2的机会.然后可以继续吃,不能超过T.问最多可以吃多少. =>我们先处理不能/2可以吃到哪些.然后弄个双指针扫一扫就可以了TAT #include<cstdio> #include<cstring> #include<cctype> #include<algorithm> using namespace std; #define rep(i,s,t) for(int i=s