#! /bin/awk -f ## ## ## I'm not super happy with how this code looks. Rest assured, though, ## the C version would look far, far worse. ## ## function qsort(A, left, right, i, last) { if (left >= right) return swap(A, left, left+int((right-left+1)*rand())) last = left for (i = left+1; i <= right; i++) if (A[i] < A[left]) swap(A, ++last, i) swap(A, left, last) qsort(A, left, last-1) qsort(A, last+1, right) } function swap(A, i, j, t) { t = A[i]; A[i] = A[j]; A[j] = t } function escape(s) { gsub("&", "&", s) gsub("<", "<", s) gsub(">", ">", s) return s } function head() { print "" print "Project 2 Scoreboard" print "" print "" print "" print "
" } function foot() { print "
" print "
"
    print "    What is it?"
    print "      It is a hacker/forensic/puzzle game... are you up for a challenge"
    print ""      
    print "    How do I play?"
    print "      Sit at the terminal and make yourself a team."
    print "      Follow instructions from there (involves visiting a website)"
    print ""
    print "    FAQ:"
    print "    Q - What is the picture being projected?"
    print "    A - It is the scoreboard and the image is for you to figure out"
    print "    "
    print "    Q - Are there any hints?"
    print "    A - NO"
    print "    "
    print "    Q - Can I connect remotely and play?"
    print "    A - Sure, connect to our Access Point \"Verizon MiFi A6AD Secure\""
    print "    "
    print "    Q - How do I track my points?"
    print "    A - See first FAQ.  The points are based off of how many"
    print "        puzzles you've solved in each category"
    print "    
" print " " print "" } BEGIN { base = ENVIRON["CTF_BASE"] if (! base) { base = "/var/lib/ctf" } head() } # MAINLOOP { time = $1 hash = $2 cat = $3 points = int($4) # Build a list of team names if (! (hash in team_names)) { fn = sprintf("%s/teams/names/%s", base, hash) getline team_names[hash] < fn close(fn) } # Total points possible so far in this category if (! ((cat, points) in cat_pointval)) { cat_total[cat] += points cat_pointval[cat, points] = 1 } # Enumerate categories if (! (cat in seen_cats)) { seen_cats[cat] = 1 categories[ncats++] = cat } # Points this team has in this category cat_points[hash, cat] += points } END { # Adjust per-category points to a per-category percentage complete for (hash in team_names) { for (cat in cat_total) { cat_score[hash, cat] = cat_points[hash, cat] / cat_total[cat] total_score[hash] += cat_score[hash, cat] } scores[nteams++] = total_score[hash] if (total_score[hash] > max_score) { max_score = total_score[hash] } } # Sort scores qsort(scores, 0, nteams-1) print "

" for (ncat = 0; ncat < ncats; ncat += 1) { printf("%s\n", ncat, categories[ncat]); } print "

" for (i = nteams-1; i >= 0; i -= 1) { score = scores[i]; if (score == scores[i-1]) continue; # Skip duplicates for (hash in team_names) { if (total_score[hash] != score) { continue; } name = escape(team_names[hash]) print "

" printf("%s\n", name) for (ncat = 0; ncat < ncats; ncat += 1) { cat = categories[ncat]; points = cat_points[hash, cat]; if (cat_points[hash, cat] > 0) { width = cat_score[hash, cat] / max_score * 90 printf("", cat, points, name) printf("%d", ncat, width, cat_points[hash, cat]) } } print "

" } } foot() }