1 Attention to detail is something everyone can and should do-especially in a tight job market. Bob Crossley, a human-resources expert notices this in the job applications that come across his desk every day. "It's amazing how many candidates eliminate themselves,"he says.
2 "Resumes(簡(jiǎn)歷)arrive with stains. Some candidates don't bother to spell the company's name correctly. Once I see a mistake, I eliminate the candidate,"Crossley concludes. "if they cannot take care of these details,why should we trust them with a job？" 3 Can we pay too much attention to details？ Absolutely. Perfectionists struggle over little things at the cost of something larger they work toward. "To keep from losing the forest for the trees,"says Charles Garfield, associate professor at the University of California, San Francisco,"we must constantly ask ourselves how the details we're working on fit into the larger picture. If they don't,we should drop them and move to something else. "
4 Garfield compares this process to his work as a computer scientist at NASA. "The Apollo moon launch was slightly off-course 90 percent of the time. "says Garfield. "But a successful landing was still likely because we knew the exact coordinates of our goal. This allowed us to make adjustments as necessary. "Knowing where we want to go helps us judge the importance of every task we undertake.
5 Too often we believe what accounts for others' success is some special secret or a lucky break (機(jī)遇). But rarely is success so mysterious. Again and again,we see that by doing little things within our grasp well, large rewards follow.
A) Don't Be a Perfectionist
B) The Benefits of Knowing Where We Want to Go
C) Hard Work Plus Good Luck
D) The Outcomes of Our Efforts
E) The Importance of Attention to Detail
F) Constantly Asking Ourselves about Details
Paragraph 2______

【說明】
所謂貨郎擔(dān)問題，是指給定一個(gè)無(wú)向圖，并已知各邊的權(quán)，在這樣的圖中，要找一個(gè)閉合回路，使回路經(jīng)過圖中的每一個(gè)點(diǎn)，而且回路各邊的權(quán)之和最小。
應(yīng)用貪婪法求解該問題。程序先計(jì)算由各點(diǎn)構(gòu)成的所有邊的長(zhǎng)度(作為邊的權(quán)值)，按長(zhǎng)度大小對(duì)各邊進(jìn)行排序后，按貪婪準(zhǔn)則從排序后的各邊中選擇邊組成回路的邊，貪婪準(zhǔn)則使得邊的選擇按各邊長(zhǎng)度從小到大選擇。
函數(shù)中使用的預(yù)定義符號(hào)如下：
define M 100
typedef struct{/*x為兩端點(diǎn)p1、p2之間的距離，p1、p2所組成邊的長(zhǎng)度*/
float x;
int p1, p2;
}tdr;
typedef struct{/*p1、p2為和端點(diǎn)相聯(lián)系的兩個(gè)端點(diǎn)，n為端點(diǎn)的度*/
int n, P1, p2;
}tr;
typedef struct{/*給出兩點(diǎn)坐標(biāo)*/
float x,y;
}tpd;
typedef int tl[M];
int n=10;
【函數(shù)】
float distance(tpd a,tpd b);/*計(jì)算端點(diǎn)a、b之間的距離*/
void sortArr(tdr a[M], int m);
/*將已經(jīng)計(jì)算好的距離關(guān)系表按距離大小從小到大排序形成排序表，m為邊的條數(shù)*/
int isCircuit(tr[M], int i, int j);
/*判斷邊(i, j)選入端點(diǎn)關(guān)系表r[M]后，是否形成回路，若形成回路返回0*/
void selected(tr r[M], int i, int j);/*邊(i,j)選入端點(diǎn)關(guān)系表r*/
void course(tr r[M], tl 1[M]);/*從端點(diǎn)關(guān)系表r中得出回路軌跡表*/
void exchange(tdr a[M], int m, int b);
/*調(diào)整表排序表，b表示是否可調(diào)，即是否有邊長(zhǎng)度相同的邊存在*/
void travling(tpd pd[M], int n, float dist, t1 locus[M])
/*dist記錄總路程*/
{
tdr dr[M];/*距離關(guān)系表*/
tr r[M];;/*端點(diǎn)關(guān)系表*/
int i, j, k, h, m;/*h表示選入端點(diǎn)關(guān)系表中的邊數(shù)*/
int b;/*標(biāo)識(shí)是否有長(zhǎng)度相等的邊*/
k=0;
/*計(jì)算距離關(guān)系表中各邊的長(zhǎng)度*/
for(i=1;i＜n;i++){
for(j=i+1;j＜=n;j++){
k++;
dr[k].x=(1);
dr[k].p1=i;
dr[k].p2=j;
}
}
m=k;
sortArr(dr,m);/*按距離大小從小到大排序形成排序表*/
do{
b=1;
dist=0;
k=h=0;
do{
k++;
i=dr[k].p1;
j=dr[k].p2;
if((r[i].n＜=1)&&(r[j].n＜=1)){/*度數(shù)不能大于2*/
if((2)){
/*若邊(i，j)加入r后形成回路，則不能加入*/
(3);
h++;
dist+=dr[k].x;
}else if((4)){
/*最后一邊選入r成回路，則該邊必須加入且得到解*/
selected(r,i,j);
h++;
&n