English Contest -- The Programmer's Dream

2024-04-01 21:38

本文主要是介绍English Contest -- The Programmer's Dream,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

Yes, The Programmer’s Dream!

How many programmers here? I am sure of that every body here has a dream inside. What’s the biggest dream or goal you have in your life at this moment ['məʊm(ə)nt]? Is it making money, saving money, double salary,or becoming a better public speaker? do not speak it out,just keep it in your mind.

I am a programmer,or IT man. I know lots of facts about programmer:

Every morning , it is not the clock get the programmer wake up,but it is the dream get the programmer wake up.

Every evening, the programmer work over time,and over time ,and without compensation.

On the Saturday, the programmer is working overtime in the office, he receive the call from his girlfriend and let him comeback to home,he says: I am on the way back to home and I am blocked in the traffic jam [dʒæm]. in fact, the programmer is lying ,he is still in the office.

One hour later, he receive the second “back to home”call ,he says: I am on the way back to home and I am blocked in the traffic jam.J in fact, theprogrammer is working hard to fix a bug in the software.

One more hour later, he receive the second “back to home” call,he says: I am on the way back to home and I am blocked in the traffic jam. in fact, the programmer is fighting for my dream. 

but what is the programmer’s dream?  Is it be zero bug,clean code,and no delay? Isit one programming language , one platform, one technology? Is it one house,onecar,one girlfriendJ,onefamily?All of these are programmer’ dream.As a programmer, I conclude that the programmer ‘s dream is fighting for the people who love me and who I love. In the other world, the programmer dream is to be founder of a family .

I think of that most of people here are the founder of your family, you already know that this small dream is not easy. the programmer not only raise a family, earn a living but also keep on learning new technology, keep on growing, keep on refreshing knowledge, keep on pushing themselves . Nowadays,we are in the internet age, the best time we are! It is the programmer who help create the internet age, It is the programmer who help create the best time. It is the programmer who create lots of valuable services to simple our life,happy our life,easy our life.

Programmers are true heros ,Programmers are the founder of internet.

But one point I want to highlight is programmers are the founder of internet ,But most programmers are not the founder of their dream.they are the founder of other’s dream. only a few programmer set up a company and run it successfully,only a few programmer create an APP and change the world. only a few programmer become a leader of internet.programmers spend so much time with technology detail, programmers know computer more than themselves,but programmers don't know who they are. programmers are fighting for their family, programmers are fighting for the internet,programmers are fighting for the internet,  programmers are not fighting for their dreams!

I challenge programmers to fight for ourselves,to fight to be a founder to change the world!

I challenge programmers to live our dream. people who are running towards their dreams, life have a special kind of meaning.

I challenge programmers to represent an idea and represent possibilities.

If you still taking about your goals.But you have not done anything,JUST TAKE THE FIRST STEP! It is never late to make dream come true, liujiangfeng leave huawei he has worked for 19 years,zhangyaqin leave Microsof the has worked for 16 years,my teacher who is the professor of UESTC,set up his company at 60 years old.jack luo is a good example as a co-founder of STS….I do not intend to suggest programmers leave the job,leave the company you are working for.I just suggest to invest in our mind and look at our dream, review it every day and saying to ourselves: No matter how bad it is or how bad it gets, I'm going to make it!

Live on our dream, the programmer will contribute more to the internet,to family,contribute more to people who i love and who love me!

thank you!

这篇关于English Contest -- The Programmer's Dream的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/868200

相关文章

2014 Multi-University Training Contest 8小记

1002 计算几何 最大的速度才可能拥有无限的面积。 最大的速度的点 求凸包, 凸包上的点( 注意不是端点 ) 才拥有无限的面积 注意 :  凸包上如果有重点则不满足。 另外最大的速度为0也不行的。 int cmp(double x){if(fabs(x) < 1e-8) return 0 ;if(x > 0) return 1 ;return -1 ;}struct poin

2014 Multi-University Training Contest 7小记

1003   数学 , 先暴力再解方程。 在b进制下是个2 , 3 位数的 大概是10000进制以上 。这部分解方程 2-10000 直接暴力 typedef long long LL ;LL n ;int ok(int b){LL m = n ;int c ;while(m){c = m % b ;if(c == 3 || c == 4 || c == 5 ||

2014 Multi-University Training Contest 6小记

1003  贪心 对于111...10....000 这样的序列,  a 为1的个数,b为0的个数,易得当 x= a / (a + b) 时 f最小。 讲串分成若干段  1..10..0   ,  1..10..0 ,  要满足x非递减 。  对于 xi > xi+1  这样的合并 即可。 const int maxn = 100008 ;struct Node{int

AtCoder Beginner Contest 370 Solution

A void solve() {int a, b;qr(a, b);if(a + b != 1) cout << "Invalid\n";else Yes(a);} B 模拟 void solve() {qr(n);int x = 1;FOR(i, n) FOR(j, i) qr(a[i][j]);FOR(i, n) x = x >= i ? a[x][i]: a[i][x];pr2(

【POJ 2970】The lazy programmer(优先队列+贪心)

这题范围不会超long long全用int存就行了 贪心的话,每次把一个任务加入到队列,如果不能在指定时间完成就到前面找a最小的一个任务补偿时间,当一个任务完成时间等于0的时候这个任务就不再放回队列 #include<cstdio>#include<queue>#include<algorithm>#include<cstring>using namespace std;//ty

CF Bayan 2015 Contest Warm Up B.(dfs+暴力)

B. Strongly Connected City time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output 题目链接: http://codeforces.com/contest/475/probl

CF Bayan 2015 Contest Warm Up A.(模拟+预处理)

A. Bayan Bus time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output 题目链接: http://codeforces.com/contest/475/problem/A The fi

AtCoder Beginner Contest 369 D - Bonus EXP 动态规划

原题链接: https://atcoder.jp/contests/abc369/tasks/abc369_d 思路:   这道题为什么要用动态规划呢,其实,对于第i个怪物,我们有打与不打两种处理方式,而对于打,我们是获得两倍的经验值,还是一倍的经验值,与我们打了奇数只怪物还是打了偶数只怪物有关了,因此我们定义dp[i][0] 为前i只怪物总共打了偶数次,dp[i][1] 为前i只怪物总

2015 Multi-University Training Contest 5 1009 MZL#39;s Border

MZL's Border  Problem's Link:  http://acm.hdu.edu.cn/showproblem.php?pid=5351   Mean:  给出一个类似斐波那契数列的字符串序列,要你求给出的f[n]字符串中截取前m位的字符串s中s[1...i] = s[s.size()-i+1....s.size()]的最大长度。 analyse:   过计算

【UVa】10600 ACM Contest and Blackout 次小生成树

类型:次小生成树 题目大意: 为了举办ACM竞赛,市长决定给所有的n(3 <= n <= 100)所学校提供可靠的电力供应。当且仅当一个学校直接连到电站,或者连到另一个有可靠供应的学校时,才有可靠供应。现在给出在不同学校之间的布线成本,找出最便宜的两种连线方案。一个方案的成本等于其中所有学校之间连线的成本的总和。 题目分析: 次小生成树。 先求出最小生成树,然后枚举所有不在