steloflute

newLISP: Racket: Porttest tests port connectivity. Example: porttest (C) 2013 KTG host: www.newlisp.org port: 80 Wed Dec 25 20:29:45 2013 www.newlisp.org 80 open Wed Dec 25 20:29:46 2013 www.newlisp.org 80 open

A clock with a sweep second 초침이 부드럽게 움직이는 시계 Screenshot Source Code https://github.com/kimtg/small/blob/master/SweepSecond.rkt Old: License Copyright 2013-2014 KIM Taegyoon Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless requir..

Racket에서 문자열의 인코딩을 변환하는 방법 #lang racket (define msg "Hello, 世界") ; UTF-8 string (displayln msg) (define (utf-8->euc-kr str) (define-values (str2 a b) (bytes-convert (bytes-open-converter "UTF-8" "EUC-KR") (string->bytes/utf-8 str))) str2) (define msg2 (utf-8->euc-kr msg)) ; EUC-KR string (displayln msg2) (read-line) ; 2 (require net/url) (define (read-url url) (port->string (reencode-input-port ..

http://docs.racket-lang.org/reference/Filesystem.html#(def._((lib._racket/file..rkt)._file-~3estring)) (file->string path [#:mode mode-flag]) → string? path : path-string? mode-flag : (or/c 'binary 'text) = 'binary Reads all characters from path and returns them as a string. The mode-flag argument is the same as for open-input-file.

#lang racket (require net/url) (define p (get-pure-port (string->url "http://www.naver.com"))) (let loop () (define r (read-line p)) (cond [(not (eof-object? r)) (display r) (loop)])) 아래는 koscom 에서 kospi200 시세를 얻어오는 예제이다 . (showindex.rkt)#lang racket (require net/url) (require racket/date) (define (read-url url) (port->string (reencode-input-port (get-pure-port (string->url url)) "EUC-KR")))(def..

#lang racket (let loop ([r (set)]) (cond [(>= (set-count r) 6) (display r)] [else (loop (set-add r (add1 (random 45))))]))

Guide:http://docs.racket-lang.org/guide/hash-tables.html Reference:http://docs.racket-lang.org/reference/hashtables.html

Problem 14 05 April 2002 The following iterative sequence is defined for the set of positive integers: n n/2 (n is even) n 3n + 1 (n is odd) Using the rule above and starting with 13, we generate the following sequence: 13 40 20 10 5 16 8 4 2 1 It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is tho..

Problem 13 22 March 2002 Work out the first ten digits of the sum of the following one-hundred 50-digit numbers. 37107287533902102798797998220837590246510135740250 46376937677490009712648124896970078050417018260538 74324986199524741059474233309513058123726617309629 91942213363574161572522430563301811072406154908250 23067588207539346171171980310421047513778063246676 892616706966236338201363784183..

Problem 3 02 November 2001 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? Answer: 6857 Solution in Perl my $num = 600851475143; my $p; for ( $p = 2 ; ; $p++ ) { while ( $num % $p == 0 ) { $num /= $p; } last if ( $num num2 1) (loop (add1 p) num2)] [else (display p)]))) ; imperative, one loop #lang racket (define (problem3) (define num..