Code-golf is a competition to solve a particular problem in the fewest bytes of source code.
- The question must be Community-wiki. Please flag for moderator attention to make it so.
Code-golf is a competition to solve a particular problem in the fewest bytes of source code.
| (use-srfis '(1 69)) | |
| (read-hash-extend #\# | |
| (lambda (c port) | |
| (define ht (make-hash-table eqv?)) | |
| (define (ht-ref key) | |
| (hash-table-ref ht key (lambda () | |
| (define sym (gensym)) | |
| (hash-table-set! ht key sym) | |
| sym))) | |
| (define (hash-key x) |
| (define-syntax pollute-my-namespace | |
| (let ((letters "abcdefghijklmnopqrstuvwxyz_") | |
| (char->symbol (compose string->symbol string))) | |
| (define (make-macros stx) | |
| (lambda () | |
| (for*/lists (ids syntaxes) | |
| ((x letters) | |
| (y letters)) | |
| (if (char=? x y) | |
| (values (datum->syntax stx (char->symbol #\^ x)) |
| #lang racket | |
| (define (get-candidates) | |
| (define row (sub1 (read))) | |
| (for/seteqv ((i (in-range 16)) | |
| (item (in-producer read)) | |
| #:when (= (quotient i 4) row)) | |
| item)) | |
| (define T (read)) | |
| (for ((c (in-range T))) |
| import java.util.Arrays; | |
| /** | |
| * Demonstration of bound method references. | |
| */ | |
| public class MethodReferenceExample1 { | |
| public static void main(String[] args) { | |
| Arrays.stream(args, 1, args.length).filter(args[0]::contains) | |
| .forEach(System.out::println); | |
| } |
| ;;;; SHA-1 and SHA-2 implementations. | |
| ;;;; Uses R7RS bytevector and byte I/O interfaces. | |
| ;;;; Requires SRFIs 1, 26, 43, and 60. | |
| ;;; Auxiliary definitions to avoid having to use giant tables of constants. | |
| (define primes80 '(2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 | |
| 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 | |
| 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 | |
| 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 |
| package nz.kiwi.chris.demo; | |
| import java.util.Arrays; | |
| import java.util.Comparator; | |
| import com.sun.jna.Callback; | |
| import com.sun.jna.Function; | |
| import com.sun.jna.IntegerType; | |
| import com.sun.jna.Library; | |
| import com.sun.jna.Native; |
I hereby claim:
To claim this, I am signing this object:
| import java.io.DataInputStream; | |
| import java.io.DataOutputStream; | |
| import java.io.File; | |
| import java.io.IOException; | |
| import java.net.ServerSocket; | |
| import java.net.Socket; | |
| import java.util.ArrayList; | |
| import java.util.Arrays; | |
| import java.util.Collection; |
| #lang racket | |
| (for ((c (in-range (read))) | |
| (smax (in-port)) | |
| (line (in-port (compose string-trim read-line)))) | |
| (define-values (extras total) | |
| (for/fold ((extras 0) (total 0)) | |
| ((i (in-range (add1 smax))) | |
| (j (in-string line))) | |
| (define n (- (char->integer j) (char->integer #\0))) | |
| (define cur-extras (max (- i total) 0)) |