A letter to no one

博客主要是向Linda表达情感,希望她永远做自己的阳光,期待更亲近接触,祝愿她找到真爱、新年幸福。还引用话语表明爱她愿放手让其找幸福,最后祝她新的一年收获朋友、金钱、爱情和成就。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Linda(*lovely girl*):

PROMISE me ,that you will be my sunshine for ever ,no matter how hopeless ,no matter what happens!

Wait until the wishes coming ,I'm very very happy to know about you ,to know you ,but I am still eager some closer touch with you ,wish you happy everyday in the new year and forever!
Also wish you find your ture heart love ,romantic love ,wonderful love! So do I.
But ,now,I did not. I don't know how you have done ,with such a mess problem.(Find another part of you ? Still waiting ?)

Just as you said 
“ Love you ,so let you go ,and find a happier place !
Love you ,so not until you have find your ture love, I'll not set my heart at rest!”
So meaningful words, isn't it ?
Finally wish you , in the new year ,more friends ,more money ,more love ,more achievement,all freely coming to you. MY Lovely girl!

Yours, 
Love you forever
Jerry
(Telephone Number Word Generator) Standard telephone keypads contain the digits 0 through 9. The numbers 2 through 9 each have three letters associated with them, as is indicated by the following table: Many people find it difficult to memorize phone numbers, so they use the correspondence between digits and letters to develop seven-letter words that correspond to their phone numbers. For example, a person whose telephone number is 686-2377 might use the correspondence indi- cated in the above table to develop the seven-letter word “NUMBERS.” Businesses frequently attempt to get telephone numbers that are easy for their clients to remember. If a business can advertise a simple word for its customers to dial, then no doubt the business will receive a few more calls. Each seven-letter word corresponds to exactly one seven-digit telephone number. The restaurant wishing to increase its take-home business could surely do so with the number 825-3688 (i.e., “TAKEOUT”). Each seven-digit phone number corresponds to many separate seven-letter words. Unfortunately, most of these represent unrecognizable juxtaposi- tions of letters. It’s possible, however, that the owner of a barber shop would be pleased to know that the shop’s telephone number, 424-7288, corresponds to “HAIRCUT.” A veterinarian with the phone number 738-2273 would be happy to know that the number corresponds to “PETCARE.” Write a C++ program that, given a seven-digit number, writes to a file every possible seven-letter word corresponding to that number. There are 2187 (3 to the seventh power) such words. Avoid phone numbers with the digits 0 and 1.
06-09
We have come up with the best possible language here at Google, called Googlerese. To translate text into Googlerese, we take any message and replace each English letter with another English letter. This mapping is one-to-one and onto, which means that the same input letter always gets replaced with the same output letter, and different input letters always get replaced with different output letters. A letter may be replaced by itself. Spaces are left as-is. For example (and here is a hint!), our awesome translation algorithm includes the following three mappings: 'a' -> 'y', 'o' -> 'e', and 'z' -> 'q'. This means that "a zoo" will become "y qee". Googlerese is based on the best possible replacement mapping, and we will never change it. It will always be the same. In every test case. We will not tell you the rest of our mapping because that would make the problem too easy, but there are a few examples below that may help. Given some text in Googlerese, can you translate it to back to normal text? 输入 The first line of the input gives the number of test cases, T. T test cases follow, one per line. Each line consists of a string G in Googlerese, made up of one or more words containing the letters 'a' - 'z'. There will be exactly one space (' ') character between consecutive words and no spaces at the beginning or at the end of any line. 1 ≤ T ≤ 30. G contains at most 100 characters. None of the text is guaranteed to be valid English. 输出 For each test case, output one line containing "Case #X: S" where X is the case number and S is the string that becomes G in Googlerese. 样例 输入样例 1 复制 3 ejp mysljylc kd kxveddknmc re jsicpdrysi rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd de kr kd eoya kw aej tysr re ujdr lkgc jv 输出样例 1 Case #1: our language is impossible to understand Case #2: there are twenty six factorial possibilities Case #3: so it is okay if you want to just give up给出这个问题的思路,用C语言
06-11
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值