[B! algorithm][neta] kiyo_hikoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

kiyo_hiko id:kiyo_hiko

algorithmã¨netaã«é–¢ã™ã‚‹kiyo_hikoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (3)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

å¶æ•°ï¼å¥‡æ•°ã®åˆ¤å®š - OKWAVE
å¤±ç¤¼ã‚’æ‰¿çŸ¥ã§ä¸€è¨€ã€‚ ã‚‚ã—å°ç”Ÿã®ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆã«ã“ã®ã‚ˆã†ãªãƒ—ãƒã‚°ãƒ©ãƒ ã‚’è¨˜è¿°ã—ã¦ã„ã‚‹äººç‰©ãŒã„ã‚‹ã¨ã—ãŸã‚‰ã€ã€Žç¾æ™‚ç‚¹ã®ãƒ—ãƒã‚°ãƒ©ãƒ èƒ½åŠ›ã‚‚ã€å°†æ¥æ€§ã‚‚ç„¡ã„ã€ã¨ã„ã†ã“ã¨ã§æŠœã‘ã¦é ‚ãä»¥å¤–ã‚ã‚Šã¾ã›ã‚“ã€‚ å››å‰‡æ¼”ç®—+å‰°ä½™ç®—ã€ãƒ“ãƒƒãƒˆæ¼”ç®—ã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒ è¨€èªžã«ä¾å˜ã—ãªã„ã€åŸºç¤Žä¸ã®åŸºç¤Žã ã‹ã‚‰ã§ã™ã€‚ ã‚ã¾ã‚Šã«ã‚‚åŸºç¤ŽéŽãŽã¦ã€ãƒã‚«ãƒƒã¨æŠœã‘ã¦é›£ã—ãè€ƒãˆã¦ã—ã¾ã†ã€ã¨ã„ã†ã“ã¨ãŒã‚¼ãƒã§ã‚ã‚‹ã¨ã¯è¨€ã„ã¾ã›ã‚“ã—ã€ãã‚Œã ã‘ã§ä¸Šè¨˜ã®ã‚ˆã†ãªåˆ¤æ–ã¯åŽ³ã—ã™ãŽã‚‹ã€ã¨ã¯å°ç”Ÿã‚‚æ„Ÿã˜ã¾ã™ã€‚ ä¸Šè¨˜ã®ã‚ˆã†ãªåˆ¤æ–ã¯ã€ãƒã‚«ãƒƒã¨æŠœã‘ã‚‹ã«ã—ã¦ã‚‚ã€Žã‚ªã‚¤ã‚ªã‚¤ã—ã£ã‹ã‚Šã—ã¦ãã‚Œã‚ˆã€ã¨ã„ã†ãƒ¬ãƒ™ãƒ«ã§ã‚ã‚‹ã€ã¨ã„ã†ã“ã¨ã‚‚ã‚ã‚Šã¾ã™ãŒã€ä»–ã®äººã«ç›¸è«‡ã§ããªã„ã¨ã„ã†ã‚³ãƒŸãƒ¥ãƒ‹ã‚±ãƒ¼ã‚·ãƒ§ãƒ³èƒ½åŠ›ã®ç„¡ã•ã«ã‚ã‚Šã¾ã™ã€‚ ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ãƒ¬ãƒ™ãƒ«é–‹ç™ºã§ã‚ã‚‹ã€ã¨è²´æ®¿ãŒãŠã£ã—ã‚ƒã£ã¦ã„ã‚‹ã‚†ãˆã«ã€ãã®ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã®ä»•æ§˜(å¼•æ•°ã€è¿”ã‚Šå€¤ç‰)ã‚’æŒ‡ç¤ºã™ã‚‹äººç‰©ãŒã„ã‚‹ã¯ãšã§ã™ãŒã€ãã®äººã«ç›¸è«‡ã§ããªã„ã‚ã‘ãŒç„¡ã„ã‹ã‚‰ãã†åˆ¤æ–ã—ã¾ã™ã€‚ ã“ã‚Œã¯ä»–ã®
kiyo_hiko 2012/05/28
ãƒã‚¿ã«ãƒã‚¿ãƒ¬ã‚¹ã€€ã€ŒPublic Function oddp(ByVal n As Integer) As Boolean \n Do While n > 10 \n n = n - 10 \n Loop \n Select Case n \n Case 0: oddp = False \n Case 1: oddp = True \n (case 9ã¾ã§).. \n End Select \n End Functionã€ åŠ æ¸›ç®—ã¨é †æŽ¥ãƒ»åˆ†å²ãƒ»åå¾©ã®ã¿ã§ãƒ¢ã‚¸ãƒ¥ãƒãªã—

vb

neta

modulo

algorithm
ãƒªãƒ³ã‚¯
#1 Multiples of 3 or 5 - Project Euler
Published on Friday, 5th October 2001, 06:00 pm; Solved by 1031952; Difficulty rating: 5% If we list all the natural numbers below $10$ that are multiples of $3$ or $5$, we get $3, 5, 6$ and $9$. The sum of these multiples is $23$. Find the sum of all the multiples of $3$ or $5$ below $1000$.
kiyo_hiko 2011/10/09
ç™ºæƒ³ã¯30ç§’ã§ã‚³ãƒ¼ãƒ‰åŒ–ã«4åˆ†ãã‚‰ã„ã€‚æœ€è¿‘ãƒ«ãƒ¼ãƒ—ã¨ã‹ãŒç†è§£å‡ºæ¥ãªã„ã®ã§ãƒ«ãƒ¼ãƒ—ã¯ã»ã¨ã‚“ã©ãƒªã‚¹ãƒˆå‡¦ç†ã§æ›¸ã„ã¦ã‚‹ãªã€‚ use List::Util qw/sum/;print sum map {!($_%5)||!($_%3)?$_:0}1..1000-1

perl

algorithm

training

code

neta
ãƒªãƒ³ã‚¯
å¸¸è˜ã‚’è¦†ã™ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼ãã®åã‚‚"sleep sort"ï¼ - Islands in the byte stream (legacy)
Twitterã®TLã§çŸ¥ã£ãŸã®ã ãŒã€å°‘ã—å‰ã«æµ·å¤–ã®æŽ²ç¤ºæ¿ã§"sleep sort"ã¨ã„ã†ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒç™ºæ˜Žã•ã‚Œã€å…¬é–‹ã•ã‚ŒãŸã‚ˆã†ã ã€‚ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒé¢ç™½ã‹ã£ãŸã®ã§ç´¹ä»‹ã—ã¦ã¿ã‚‹ã€‚ Genius sorting algorithm: Sleep sort 1 Name: Anonymous : 2011-01-20 12:22 è«¸å›ï¼ã‚ªãƒ¬ã¯å¤©æ‰ã‹ã‚‚ã—ã‚Œãªã„ã€‚ã“ã®ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã¿ã¦ãã‚Œã€‚ã“ã„ã¤ã‚’ã©ã†æ€ã†ï¼Ÿ #!/bin/bash function f() { sleep "$1" echo "$1" } while [ -n "$1" ] do f "$1" & shift done wait example usage: ./sleepsort.bash 5 3 6 3 6 3 1 4 7 2 Name: Anonymous : 2011-01-20 12:27 >>1 ãªã‚“â€¦ã ã¨
kiyo_hiko 2011/07/08
ã“ã®ã‚½ãƒ¼ãƒˆã‚’ã»ã‚“ã®ã¡ã‚‡ã£ã´ã‚Šã ãŒä½“é¨“ã—ãŸã€ã„ã‚„ä½“é¨“ã—ãŸã¨ã„ã†ã‚ˆã‚Šã¯ã¾ã£ãŸãç†è§£ã‚’è¶…ãˆã¦ã„ãŸã®ã ãŒâ€¦ã€Žè¦ç´ ãŒãã®å€¤åˆ†ã ã‘sleepã—ãŸã¨æ€ã£ãŸã‚‰ã„ã¤ã®ã¾ã«ã‹ã‚½ãƒ¼ãƒˆã•ã‚Œã¦ã„ãŸã€ä½•ã‚’è¨€ã£ã¦ã‚‹ã®ã‹ã‚ã‹ã‚‰ããƒ¼ã¨æ€ã†ãŒ

sort

algorithm

æ–°ã—ã„

sleep

neta

warota
ãƒªãƒ³ã‚¯
1

ãŠçŸ¥ã‚‰ã›

ã‚‚ã£ã¨èªã‚€

å…¬å¼Twitter

@hatebu
æœ€æ–°ã®äººæ°—ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã®é…ä¿¡

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

jæ¬¡ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

kå‰ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

lã‚ã¨ã§èªã‚€

eã‚³ãƒ¡ãƒ³ãƒˆä¸€è¦§ã‚’é–‹ã

oãƒšãƒ¼ã‚¸ã‚’é–‹ã

è¨å®šã‚’å¤‰æ›´ã—ã¾ã—ãŸx

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ã‚¿ã‚°

é–¢é€£ã‚¿ã‚°ã§çµžã‚Šè¾¼ã‚€ (9)

algorithmã¨netaã«é–¢ã™ã‚‹kiyo_hikoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (3)

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2026å¹´1æœˆç¬¬4é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2026å¹´1æœˆç¬¬3é€±ï¼‰

ã€å®Œäº†ã€‘ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã®è¨ˆç”»ãƒ¡ãƒ³ãƒ†ãƒŠãƒ³ã‚¹ã®ãŠçŸ¥ã‚‰ã›ï¼ˆ2026å¹´1æœˆ23æ—¥(é‡‘) æ·±å¤œ1:30ã€œ3:00ï¼‰

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

ã‚¿ã‚°

é–¢é€£ã‚¿ã‚°ã§çµžã‚Šè¾¼ã‚€ (9)

algorithmã¨netaã«é–¢ã™ã‚‹kiyo_hikoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (3)

å¶æ•°ï¼å¥‡æ•°ã®åˆ¤å®š - OKWAVE

#1 Multiples of 3 or 5 - Project Euler

å¸¸è­˜ã‚’è¦†ã™ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼ãã®åã‚‚"sleep sort"ï¼ - Islands in the byte stream (legacy)

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2026å¹´1æœˆç¬¬4é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2026å¹´1æœˆç¬¬3é€±ï¼‰

ã€å®Œäº†ã€‘ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã®è¨ˆç”»ãƒ¡ãƒ³ãƒ†ãƒŠãƒ³ã‚¹ã®ãŠçŸ¥ã‚‰ã›ï¼ˆ2026å¹´1æœˆ23æ—¥(é‡‘) æ·±å¤œ1:30ã€œ3:00ï¼‰

å…¬å¼Twitter

ã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

é–¢é€£ã‚¿ã‚°ã§çµžã‚Šè¾¼ã‚€ (9)

algorithmã¨netaã«é–¢ã™ã‚‹kiyo_hikoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (3)

å¶æ•°ï¼å¥‡æ•°ã®åˆ¤å®š - OKWAVE

å¸¸è˜ã‚’è¦†ã™ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼ãã®åã‚‚"sleep sort"ï¼ - Islands in the byte stream (legacy)

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2026å¹´1æœˆç¬¬4é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2026å¹´1æœˆç¬¬3é€±ï¼‰

ã€å®Œäº†ã€‘ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã®è¨ˆç”»ãƒ¡ãƒ³ãƒ†ãƒŠãƒ³ã‚¹ã®ãŠçŸ¥ã‚‰ã›ï¼ˆ2026å¹´1æœˆ23æ—¥(é‡‘) æ·±å¤œ1:30ã€œ3:00ï¼‰

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹