steloflute

A program that prints prime numbers소수를 출력하는 프로그램 .Net Framework 필요http://msdn.microsoft.com/en-us/netframework/aa569263.aspx  Program  Source Code  LicenseCopyright 2012 Taegyoon KimLicensed 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 athttp://www.apache.org/licenses/LICENSE-2.0Unless ..

A program that prints prime numbers 소수를 출력하는 프로그램 Program Source Code License Copyright 2012 Taegyoon Kim 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 required by applicable law or agreed to in writing, software distributed ..

A clock with a sweep second 초침이 부드럽게 움직이는 시계 Screenshot Source Code License Copyright 2012-2014 Taegyoon Kim 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 required by applicable law or agreed to in writing, software distribut..

A clock with a sweep second 초침이 부드럽게 움직이는 시계 .Net Framework 필요 http://msdn.microsoft.com/en-us/netframework/aa569263.aspx Screenshot Program Source Code License Copyright 2012-2015 Taegyoon Kim 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/LICE..

.Net Framework 필요 http://msdn.microsoft.com/en-us/netframework/aa569263.aspx Executable: Source: using System; using System.Collections.Generic; using System.Linq; using System.Net; using System.Text; using System.Text.RegularExpressions; using System.Threading; using System.Threading.Tasks; namespace ShowIndex { class Program { static void Main(string[] args) { var client = new WebClient(); var..

Program Source Code #lang racket (processor-count)

#lang racket (require racket/generator) (define (permute v) (generator () (define count 0) (define len (vector-length v)) (define sorted (sort (vector->list v) level (sub1 len)) (begin (set! count (add1 count)) (yield v)) (for ([i sorted]) (unless (for/or ([priorLevel (in-range 0 level)]) (= i (vector-ref v priorLevel))) (vector-set! v level i) (loop (add1 level)))))))) (define (permutations v) ..

#lang racket (define (tokenize s) (let loop ([i 0] [tok ""] [result '()]) (if ( (string-length tok) 0) (list tok) '())))] [(regexp-match #rx"[()]" c) (loop (+ 1 i) "" (if (> (string-length tok) 0) (append result (list tok c)) (append result (list c))))] [else (lo..

#lang racket (define (tokenize s) (let loop ([i 0] [tok ""] [result '()]) (if ( (string-length tok) 0) (list tok) '())))] [(regexp-match #rx"[()]" c) (loop (+ 1 i) "" (if (> (string-length tok) 0) (append result (list tok c)) (append result (list c))))] [else (lo..