The Farthest Distance in the World (Tagore)

The farthest distance in the world

世界上最遥远的距离
Is not the distance between life and death
不是生与死的距离
But you do not know I love you when I stand in front of you
而是 站在你面前 你却不知道我爱你

The farthest distance in the world
世界上最遥远的距离
Is not you don‘t know I love you when I stand in front of you
不是 我站在你面前 你不知道我爱你
But I can not say I love you when I love you so madly
而是 爱到痴迷却不能说我爱你

The farthest distance in the world
世界上最遥远的距离
Is not I cannot say I love you when I love you so madly
不是 爱到痴迷 却不能说我爱你
But I can only bury it in my heart dispite the unbearable yearning

而是 想你痛彻心扉 却只能深埋心底

The farthest distance in the world
世界上最遥远的距离
Is not I can only bury it in my heart despite the unbearable yearning
不是 想你痛彻心扉 却只能深埋心底
But we cannot be together when we love each other
而是 彼此相爱 却不能够在一起

The farthest distance in the world
世界上最遥远的距离
Is not we cannot be together when we love each other
不是 彼此相爱 却不能够在一起
But we pretend caring nothing even we know love is unconquerable
而是 明知道真爱无敌 却装作毫不在意

The farthest distance in the world
世界上最遥远的距离
Is not the distance between two trees
不是 树与树的距离
But the branches cannot depend on each other in wind even they grow from the same root
而是 同根生长的树枝 却无法在风中相依

The farthest distance in the world
世界上最遥远的距离
Is not the branches cannot depend on each other
不是 树枝无法相依
But two stars cannot meet even they watch each other

而是 相互了望的星星 却没有交汇的轨迹

The farthest distance in the world
世界上最遥远的距离
Is not the track between two stars
不是 星星之 间的轨迹
But nowhere to search in a tick after two tracks join
而是 纵然轨迹交汇 却在转瞬间无处寻觅

The farthest distance in the world
世界上最遥远的距离
Is not nowhere to search in a tick
不是 瞬间便无处寻觅
But doomed not to be together before they meet
而是 尚未相遇 便注定无法相聚

The farthest distance in the world
世界上最遥远的距离
Is the distance between fish and bird
是鱼与飞鸟的距离
One is in the sky, another is in the sea

一个在天 一个却深潜海底

时间: 2024-10-07 02:20:25

The Farthest Distance in the World (Tagore)的相关文章

I - Long Distance Racing(第二季水)

Description Bessie is training for her next race by running on a path that includes hills so that she will be prepared for any terrain. She has planned a straight path and wants to run as far as she can -- but she must be back to the farm within M se

BestCoder Round #27

Jump and Jump... Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 0    Accepted Submission(s): 0 Problem Description There are n kids and they want to know who can jump the farthest. For each ki

Lou's Pseudo 3d Page

Lou's Pseudo 3d Page   (C) 2013 Louis Gorenfeld, updated May 3, 2013 NEW: Important details on the segmented road system and some additional links NEW: An (optional) explanation of finding field-of-view for the 3d projection formula NEW: An analysis

HDU 5162

题目简单,主要是对名次的处理.下面的代码巧妙的对名次 那一块做了处理.如果 三个同学的 最长距离分别是10 20 30,然后 分别对应的是x[1],x[2],x[3];分别比较,当x[i]>x[j] 时,y[i]++,当所有的成绩都比较完之后,再对y[i]+1即得到 其排名. Jump and Jump... Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submi

hdu 5162 Jump and Jump...(水题)

Problem Description There are n kids and they want to know who can jump the farthest. For each kid, he can jump three times and the distance he jumps is maximum distance amount all the three jump. For example, if the distance of each jump is (10, 30,

HDOJ 5144 NPY and shot 简单物理

三分角度.... NPY and shot Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 236    Accepted Submission(s): 87 Problem Description NPY is going to have a PE test.One of the test subjects is throwing t

UvaLive 5026 Building Roads

传送门 Time Limit: 3000MS Description There is a magic planet in the space. There is a magical country on the planet. There are N cities in the country. The country is magical because there are exactly N −1 magic roads between the N cities, and from eac

hbot固件配置

又入了一台打印机,171到手,本来之前有更好的,无奈别人下手太快,只剩这台了. 175x135x180的样子. 创客的板,还带16g的闪迪内存卡,看到那会儿感觉赚大了! 拿到的时候不少螺丝松的,有的打印件也裂口了,拧紧螺丝,调平后打了打感觉操作很多不习惯, 连上电脑看固件原来是marlin1.0的!上github下载了1.19固件,网上似乎没有找到关于hbot的配置贴, 反正以前琢磨过不少次,直接上configuration.h 凭借经验改了改,基本能用了.之后有待调试. 这个平台用料很足,3点

《算法》BEYOND 部分程序 part 3

? 书中第六章部分程序,加上自己补充的代码,包括 Graham 扫描生成凸包,计算最远点对 ● Graham 扫描生成凸包 1 package package01; 2 3 import java.util.Arrays; 4 import edu.princeton.cs.algs4.StdIn; 5 import edu.princeton.cs.algs4.StdOut; 6 import edu.princeton.cs.algs4.Point2D; 7 import edu.princ