void win_checkrec() { int n; win_loadrec(); for (n = 0; n <= NUMREC; n++) if (!strcmp(topID[n], userid)) { if (stage == topStage[n] && steps < topSteps[n]) { topSteps[n] = steps; strcpy(topFROM[n], fromhost); win_sort(); } if (stage > topStage[n]) { topStage[n] = stage; topSteps[n] = steps; strcpy(topFROM[n], fromhost); strcpy(prize[n], "δ"); win_sort(); } return; } if (stage > topStage[NUMREC - 1] || (stage == topStage[NUMREC - 1] && steps < topSteps[NUMREC - 1])) { strcpy(topID[NUMREC - 1], userid); topStage[NUMREC - 1] = stage; topSteps[NUMREC - 1] = steps; strsncpy(topFROM[NUMREC - 1], fromhost, sizeof (topFROM[0])); strcpy(prize[NUMREC - 1], "δ"); win_sort(); return; } }
int win_showrec() { int n; char buf[256]; win_loadrec(); clear(); prints("[44;37m --== и╗ювеепп╟Я ==-- \r\n[m"); prints("[41m No. ID TIME Steps/sec [m\r\n"); for(n=0; n<=19; n++) { sprintf(buf,"[1;37m%3d[32m%13s[0;37m%12d[m %lf \r\n", n+1, topID[n], topT[n], topS[n]); prints(buf); } prints("[41m [m\r\n"); pressanykey(); return 0; }
int win_showrec() { char buf[200]; int n; win_loadrec(); screen_clear(); //% prints("[44;37m --== 扫雷排行榜 ==-- \r\n[m"); prints("[44;37m --== \xc9\xa8\xc0\xd7\xc5\xc5\xd0\xd0\xb0\xf1 ==-- \r\n[m"); prints("[41m No. ID TIME FROM [m\r\n"); for(n=0; n<=19; n++) { sprintf(buf, "[1;37m%3d[32m%13s[0;37m%12d[m%29s\r\n", n+1, topID[n], topT[n], topFROM[n]); prints(buf); } sprintf(buf, "[41m [m\r\n"); prints(buf); pressanykey(); }
void win_showrec() { int n; win_loadrec(); clear(); printf("\033[2J\033[44;37m --== " MY_BBS_NAME " BBS ÍÆÏä×ÓÅÅÐаñ ==-- \r\n\033[m"); printf("\033[41m Ãû´Î Ãû×Ö ¹Ø ×ܲ½Êý " "À´×Ô ³é½± \033[m\r\n"); for (n = 0; n < NUMREC; n++) { printf ("\033[1;37m%3d\033[32m%13s\033[0;37m%12d%10d%20s\033[33m%20s\r\n", n + 1, topID[n], topStage[n], topSteps[n], topFROM[n], prize[n]); } printf("\033[41m " " \033[m\r\n"); pressanykey(); }
void win_showrec() { char buf[200]; int n; win_loadrec(); clear(); prints ("[44;37m -" MY_BBS_NAME " BBS ɨÀ×ÅÅÐаñ- \r\n[m"); prints ("[41m Ãû´Î Ãû×Ö ºÄʱ À´×Ô ³é½±[m\r\n"); for (n = 0; n <= 19; n++) { sprintf(buf, "[1;37m%3d[32m%13s[0;37m%12d[m%29s\033[33m%20s\r\n", n + 1, topID[n], topT[n], topFROM[n], prize[n]); prints(buf); } sprintf(buf, "[41m [m\r\n"); prints(buf); pressanykey(); }
int win_checkrec(int dt) { char id[20]; int n; win_loadrec(); strcpy(id, userid); if(dt < 50){ clear(); prints("р╩йг╩ЗфВхк!!!\n╥ёдЦк╞цъ1╥жжс\n"); refresh(); sleep(60); pressanykey(); return 0; } for(n=0;n<20;n++) if(!strcmp(topID[n], id)) { if(stiger > topS[n]){ topS[n]=stiger; win_saverec(); } if(dt< topT[n]) { topT[n]= dt; strcpy(topFROM[n], fromhost); win_sort(); win_saverec(); } return 0; } if(dt<topT[19]) { strcpy(topID[19], id); topT[19]= dt; topS[19]= stiger; strcpy(topFROM[19], fromhost); win_sort(); win_saverec(); return 0; } return 0; }
void win_checkrec(int dt) { int n; win_loadrec(); for (n = 0; n <= 19; n++) if (!strcmp(topID[n], userid)) { if (dt < topT[n]) { topT[n] = dt; strsncpy(topFROM[n], fromhost, sizeof(topFROM[0])); strcpy(prize[n], "δ"); win_sort(); } return; } if (dt < topT[19]) { strsncpy(topID[19], userid, sizeof(topID[0])); topT[19] = dt; strsncpy(topFROM[19], fromhost, sizeof(topFROM[0])); strcpy(prize[19], "δ"); win_sort(); return; } }
int win_checkrec(int dt) { char id[20]; int n; win_loadrec(); strcpy(id, userid); for(n=0; n<=19; n++) if(!strcmp(topID[n], id)) { if(dt< topT[n]) { topT[n]= dt; strcpy(topFROM[n], fromhost); win_sort(); win_saverec(); } return; } if(dt<topT[19]) { strcpy(topID[19], id); topT[19]= dt; strcpy(topFROM[19], fromhost); win_sort(); win_saverec(); return; } }