Lines 339-345
Link Here
|
339 |
continue; |
339 |
continue; |
340 |
} |
340 |
} |
341 |
} |
341 |
} |
342 |
levelfound[sp->hs_level] = 1; |
342 |
if (sp->hs_level < NLEVELS && sp->hs_level >= 0) |
|
|
343 |
levelfound[sp->hs_level] = 1; |
343 |
i++, sp++; |
344 |
i++, sp++; |
344 |
} |
345 |
} |
345 |
return (num > MAXHISCORES ? MAXHISCORES : num); |
346 |
return (num > MAXHISCORES ? MAXHISCORES : num); |
Lines 378-389
Link Here
|
378 |
for (i = MINLEVEL; i < NLEVELS; i++) |
379 |
for (i = MINLEVEL; i < NLEVELS; i++) |
379 |
levelfound[i] = 0; |
380 |
levelfound[i] = 0; |
380 |
for (i = 0, sp = scores; i < nscores; i++, sp++) { |
381 |
for (i = 0, sp = scores; i < nscores; i++, sp++) { |
381 |
if (levelfound[sp->hs_level]) |
382 |
if (sp->hs_level < NLEVELS && sp->hs_level >= 0) { |
382 |
sp->hs_time = 0; |
383 |
if (levelfound[sp->hs_level]) |
383 |
else { |
384 |
sp->hs_time = 0; |
384 |
sp->hs_time = 1; |
385 |
else { |
385 |
levelfound[sp->hs_level] = 1; |
386 |
sp->hs_time = 1; |
386 |
} |
387 |
levelfound[sp->hs_level] = 1; |
|
|
388 |
} |
389 |
} |
387 |
} |
390 |
} |
388 |
|
391 |
|
389 |
/* |
392 |
/* |
Lines 437-443
Link Here
|
437 |
continue; |
440 |
continue; |
438 |
} |
441 |
} |
439 |
sp = &hs[item]; |
442 |
sp = &hs[item]; |
440 |
(void)sprintf(buf, |
443 |
(void)snprintf(buf, sizeof(buf), |
441 |
"%3d%c %6d %-11s (%6d on %d)", |
444 |
"%3d%c %6d %-11s (%6d on %d)", |
442 |
item + offset, sp->hs_time ? '*' : ' ', |
445 |
item + offset, sp->hs_time ? '*' : ' ', |
443 |
sp->hs_score * sp->hs_level, |
446 |
sp->hs_score * sp->hs_level, |