Saying Good-bye to Cambridge Again

Very quietly I take my leave,
      As quietly as I came here;
      Quietly I wave good-bye,
      To the rosy clouds in the western sky.

The golden willows by the riverside,
      Are young brides in the setting sun;
      Their reflections on the shimmering waves,
      Always linger in the depth of my heart.

The floating heart growing in the sludge,  
      Sways leisurely under the water;
      In the gentle waves of Cambridge,
      I would be a water plant!

That pool under the shade of elm trees,
      Holds not water but the rainbow from the sky;
      Shattered to pieces among the duckweeds,
      Is the sediment of a rainbow-like dream.

To seek a dream? Just to pole a boat upstream,  
      To where the green grass is more verdant;  
      Or to have the boat fully loaded with starlight,
      And sing aloud in the splendor of starlight.

But I cannot sing aloud,
      Quietness is my farewell music;

Even summer insects keep silence for me,
      Silent is Cambridge tonight!

Very quietly I take my leave,
      As quietly as I came here;
      Gently I flick my sleeves,
      Not even a wisp of cloud will I bring away.

Saying Good-bye to Cambridge Again

时间: 2024-12-09 00:12:08

Saying Good-bye to Cambridge Again的相关文章

codeforces Gym 100500 J. Bye Bye Russia

Problem J. Bye Bye RussiaTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100500/attachments Description It was the last day at Russia, after the World Finals has ended. Coach fegla was travelling back to Cairo on the same day b

前端框架Vue入门

1.Vue简介 Vue是一套构建用户界面的渐进性框架.Vue采用自底向上增量开发的设计,其关注点在图层,与angular的区别就在这里,它关注的是图层,而angular注释的是数据. 2.与React的区别: 2.1相同点 使用Virtual DOM(虚拟dom) 提供响应式(Reactive) 和组件化(Composable)的视图组件 都将核心放在保持核心库上,有配套的路由和负责处理全局状态管理的库 2.2不同点: 性能方面:React和Vue都是 Virtual Dom,但是渲染性能方面V

Good Bye 2014

A:签到,从左往右走一遍判断下有没有遇到t即可 B:先利用floyd求出传递闭包,然后利用这个传递闭包贪心小的尽量往前放即可 C:贪心的策略,放的顺序其实根据拿的顺序就可以确定的,所以只要在拿的顺序上从左往右扫一遍即可 D:先DFS预处理出每条边两边点的个数,然后三元组对于每个边经过都是n - 2次,所以一个边都会被计算到n - 2 * 一边点 * 另一边点个数 代码: #include <cstdio> #include <cstdlib> const int N = 30005

Hello world,Hello 2015,Bye 2014

序 在我写下“在”这个字的时候已经是2014-12-31 19:59,14年最后一天了,总觉得不写点东西祭奠一下那些被自己虐死的脑细胞,心里就不舒服. 那就从生活,工作,学习三个方面,总结一下吧. 生活 仍是一个人,这是2014年唯一的遗憾,没脱单!关键是真没有那个想法,总感觉自己是一个目标很强,事业心很重的人,目标不实现,没有事业,没那个心情去谈对象.也始终相信,该来的总会来,何必特意的去找呢? 话锋一转,说说今年开心的事,话说大学我们专业做开发的唯独我一个,之前大学同学在北京的也是我一个,今

Codeforces Good Bye 2016 D 模拟搜索?

给出烟花的爆炸方式和爆炸次数 问最后有多少个格子会被炸到 如果dfs的话会超时... 利用模拟每一层来搜索..? 思想就是一开始有一个爆炸点向上 然后模拟完第一段 会产生一个爆炸点 朝两个方向 就用vector来存 每一层都处理一段的爆炸点 产生新一段的爆炸点 因为5*30=150 所以图建300就可以了 300 * 300 * 30的时间复杂度 但是常数很大..不过无所谓啦.. 需要注意的是 一个爆炸点可能会同时出现两次朝同一个方向开始爆炸的烟花 这个是没有意义的 所以拿一个数组来记录 不然最

Good Bye 2015 A

Problem A:http://codeforces.com/problemset/problem/611/A A. New Year and Days 题意:某人要在2016年收集糖果,有两种不同的收集方式,按week或month.x表示week的周x或月的x号,只有到每周或每月的x时才会收集一颗糖果,问:在给定的月或周条件内,2016年能收集多少颗糖果. 思路:我是用数组存好,其实也可以更简洁,周的话除了5,6,7是53个,其他都是52个:月的话1-29都是12(闰年),30是11,31是

codeforces Good Bye 2015 B. New Year and Old Property

题目链接:http://codeforces.com/problemset/problem/611/B 题目意思:就是在 [a, b] 这个范围内(1 ≤ a ≤ b ≤ 10^18)统计出符合二进制数表示只有 1 个 0 的数量是多少. *********************** 首先贴出一段绝对会超时的代码,连提交的勇气都木有呢~因为第四组数据已经接近龟速了,所以...(大家可忽略) 1 #include <iostream> 2 #include <cstdio> 3 #

Good Bye 2015 A. New Year and Days 签到

A. New Year and Days Today is Wednesday, the third day of the week. What's more interesting is that tomorrow is the last day of the year 2015. Limak is a little polar bear. He enjoyed this year a lot. Now, he is so eager to the coming year 2016. Lima

Good Bye 2015 C. New Year and Domino 二维前缀

C. New Year and Domino They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so. Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w