Fading Like a Flower

Fading Like a Flower

In a time where the sun descends alone 伴着落日孤独的脚步

I ran a long long way from home 我开始了一段漫长的追寻

To find a heart that‘s made of stone 去寻找如石头般冰冷的心

I will try, I just need a little time 我会去尝试,但需要一点点时间

To get your face right out of my mind 将你从记忆中完全抹去

To see the world through different eyes 以不同的眼光来看待世界

Every time I see you oh I try to hide away 每次望见你,我都试图逃避

But when we meet it seems I can‘t let go 但当我们相遇,我似乎又难以舍弃

Every time you leave the room I feel I‘m fading like a flower 每次你离**间 我都觉得自己正如花儿一样凋零

Tell me why 告诉我为什么

When I scream there‘s no reply 我大声呼喊却得不到回应

When I reach out there‘s nothing to find 我伸手去抓却一无所获

When I sleep I break down and cry Cry,Yeah 我躺下入睡却失声痛哭

Every time I see you oh I try to hide away 每次望见你,我都试图逃避

But when we meet it seems I can‘t let go 但当我们相遇,我似乎又难以舍弃

Every time you leave the room I feel I‘m fading like a flower 每次你离**间我都觉得自己正如花儿一样凋零

Fading like a rose 如玫瑰花一样凋零

Fading like a rose 如玫瑰花一样凋零

Beaten by the storm 犹如遭受暴风雨侵袭的玫瑰花

I Talking to myself 我告诉自己

Getting washed by the rain 就让风雨降临吧

It‘s such a cold cold town 这是一个冰冷的世界

Oh, it‘s a such cold town 如此冰冷的世界

Every time I see you oh I try to hide away 每次望见你,我都试图逃避

But when we meet it seems I can‘t let go 但当我们相遇,我似乎又难以舍弃

Every time you leave the room I feel I‘m fading like a flower 每次你离**间我都觉得自己正如花儿一样凋零

Every time I see you oh I try to hide away 每次望见你,我都试图逃避

But when we meet it seems I can‘t let go 但当我们相遇,我似乎又难以舍弃

Every time you leave the room I feel I‘m fading like a flower 每次你离**间我都觉得自己正如花儿一样凋零

Every time I see you oh I try to hide away 每次望见你,我都试图逃避

But when we meet it seems I can‘t let go 但当我们相遇,我似乎又难以舍弃

Every time you leave the room I feel I‘m fading like a flower 每次你离**间我都觉得自己正如花儿一样凋零

时间: 2024-11-07 14:30:25

Fading Like a Flower的相关文章

ural 2020 Traffic Jam in Flower Town

2020. Traffic Jam in Flower Town Time limit: 1.0 secondMemory limit: 64 MB Having returned from Sun City, Dunno told all his friends that every shorty may have a personal automobile. Immediately after that so many citizens took a fancy of becoming ro

经典把妹桥段:Flower dance开头对话

听到一首很赞的钢琴曲,Flower Dance,其开头有一段英文对话,如下: Lucy:"They serve the purpose of changing hydrogen into breathable oxygen, and they’re as necessary here as the air is, on Earth." Lucy:“它们把水转化为可供呼吸的氧气,它们像地球上的空气一样重要呢.” Ray:"But I still say……they’re flo

【POJ 2750】 Potted Flower(线段树套dp)

[POJ 2750] Potted Flower(线段树套dp) Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 4566   Accepted: 1739 Description The little cat takes over the management of a new park. There is a large circular statue in the center of the park, surrou

Android开发之神奇的Fading Edge,让你的View更有层次感!

最近在研究Android Framework层源码,发现我们对源码的理解应该建立在对API的理解之上,如果有一些API你没用过,那么即使你在源码中见到这个东西都不知道是干嘛的,更谈不上理解了.一直以来我都很想把View的绘制方法draw详细的走一遍,但是这里涉及到的细节问题是在是太多了,因此,今天我们还是先来看看Fading Edge,为draw方法详解继续打基础. 在这篇博客之前,我已经陆续推出了五篇关于View绘制的文章,相信这五篇博客对你理解本篇博客会有帮助. 1.View绘制详解,从La

Celery+rabbitmq+mysql+flower

flower: http://docs.celeryproject.org/en/latest/getting-started/index.html http://flower.readthedocs.org/en/latest/config.html https://denibertovic.com/posts/celery-best-practices/ http://daimin.github.io/posts/celery-shi-yong.html http://ju.outofmem

花店橱窗(flower)

花店橱窗(flower) 题目描述 某花店现有f束花,每一束花的品种都不一样,同时至少有同样数量的花瓶,被按顺序摆成一行,花瓶的位置是固定的,从左到右按1到V顺序编号,V是花瓶的数目.花束可以移动,并且每束花用1:到f的整数标识.如果i 输入 第1行两个整数f和V,分别为花束数和花瓶数(1≤f≤100,f≤V≤I00).接下来是矩阵Aij,它有i行,每行j个整数,hij表示花束i摆放在花瓶j中的美学值. 输出 第1行是一个整数,为最大的美学值:接下来有f行,每行两个数,为那束花放入那个花瓶的编号

ZOJ 3691 Flower(最大流+二分)

Flower Time Limit: 8 Seconds      Memory Limit: 65536 KB      Special Judge Gao and his girlfriend's relationship becomes better and better after they flying balloon last week. Thus, Gao wants to play a simple but evil game with his girlfriend at a l

UI 架构 - 读Martin Flower相关文章总结

近来看了大师Martin Flower的一些关于UI 架构的文章,为了加强理解特总结如下. 大师从设计的角度入手,阐述了UI 架构的具有代表性跟影响力的模式.其中当然提到了MVC此耳熟能详的模式.并从MVC的源起和演化为我们澄清了对MVC的理解.除了MVC, 大师对UI 架构的其他模式也进行了总结归纳.下面此文简要总结大师对各模式的评述. 1. Forms and Controls此模式出现于client-server应用盛行之时,晚于MVC的出现.同学们接触过VB, VC, Delphi 跟

POJ 2750 Potted Flower (单点修改求线段树上最大子序列和)

题目大意: 在一个序列上每次修改一个值,然后求出它的最大的子序列和. 思路分析: 首先我们不考虑不成环的问题.那就是直接求每个区间的最大值就好了. 但是此处成环,那么看一下下面样例. 5 1 -2 -3 4 5 那么你会发现 max = sum - min 也就是和减去最小区间和也可以得到. 所以我们最后要得到的就是两个东西.注意题目中说的不能全部取得.所以还要判断一下max 是不是等于 sum的. #include <cstdio> #include <iostream> #in