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

Rion778 id:Rion778

algorithmã«é–¢ã™ã‚‹Rion778ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (11)

${{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}}

ãƒ•ãƒã‚¤ãƒ‰ã®å¾ªç’°æ¤œå‡ºæ³• - Wikipedia
ãƒ•ãƒã‚¤ãƒ‰ã®å¾ªç’°æ¤œå‡ºæ³•ï¼ˆè‹±: Floyd's cycle-finding algorithmï¼‰ã¨ã¯ã€ä»»æ„ã®æ•°åˆ—ã«å‡ºç¾ã™ã‚‹å¾ªç’°ã‚’æ¤œå‡ºã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹ã€‚ä»»æ„ã®æ•°åˆ—ã¨ã¯ã€ä¾‹ãˆã°æ“¬ä¼¼ä¹±æ•°åˆ—ãªã©ã§ã‚ã‚‹ãŒã€å˜æ–¹å‘é€£çµãƒªã‚¹ãƒˆã¨ã¿ãªã›ã‚‹æ§‹é€ ã®ã‚ˆã†ãªã‚‚ã®ã®ãƒ«ãƒ¼ãƒ—æ¤œå‡ºã«ã‚‚é©ç”¨ã§ãã‚‹ã€‚ãƒãƒãƒ¼ãƒˆãƒ»ãƒ•ãƒã‚¤ãƒ‰ãŒ1967å¹´ã«ç™ºæ˜Žã—ãŸ[1]ã€‚ã€Œé€Ÿãå‹•ãã€ã¨ã€Œé…ãå‹•ãã€ã¨ã„ã†2ç¨®é¡žã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ï¼ˆãƒã‚¤ãƒ³ã‚¿ï¼‰ã‚’ä½¿ã†ã“ã¨ã‹ã‚‰ã€ã‚¦ã‚µã‚®ã¨ã‚«ãƒ¡ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã„ã£ãŸæ„›ç§°ã‚‚ã‚ã‚‹ã€‚ ã‚°ãƒ©ãƒ•ã®æœ€çŸçµŒè·¯å•é¡Œã‚’è§£ããƒ¯ãƒ¼ã‚·ãƒ£ãƒ«â€“ãƒ•ãƒã‚¤ãƒ‰æ³•ã¨ã¯ï¼ˆåŒã˜ç™ºæ¡ˆè€…ã«ç”±æ¥ã™ã‚‹ã®ã§åŒã˜åå‰ãŒã‚ã‚‹ã€ã¨ã„ã†ç‚¹ä»¥å¤–ã¯ï¼‰ç„¡é–¢ä¿‚ã§ã‚ã‚‹ã€‚ å˜æ–¹å‘é€£çµãƒªã‚¹ãƒˆã®ãƒ«ãƒ¼ãƒ—æ¤œå‡ºãªã©ã‚‚å…¸åž‹çš„ãªã®ã§ã‚ã‚‹ãŒã€å½¢å¼çš„ï¼ˆãƒ•ã‚©ãƒ¼ãƒžãƒ«ï¼‰ãªèª¬æ˜Žã«ã¯æ•°åˆ—ã®ã»ã†ãŒå‘ã„ã¦ã„ã‚‹ã®ã§ã“ã“ã§ã¯æ“¬ä¼¼ä¹±æ•°åˆ—ç”Ÿæˆå™¨ã®ä¾‹ã§èª¬æ˜Žã™ã‚‹ã€‚ãƒãƒ©ãƒ¼ãƒ‰ãƒ»ãƒãƒ¼ç´ å› æ•°åˆ†è§£æ³•ãªã©ã§æ“¬ä¼¼ä¹±æ•°åˆ—ç”Ÿæˆå™¨ã®åˆ†æžãŒé‡è¦ãªãŸã‚ã€ã¨ã„ã£ãŸã“ã¨
Rion778 2017/12/26
algorithm
ãƒªãƒ³ã‚¯
ãƒ€ãƒ¡å‡ºã—ï¼šã‚¢ãƒˆã‚ãƒ³ã®ç¯© - è£ RjpWiki
Julia ã¨ãã©ã R, Python ã«ã‚ˆã‚‹ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ãƒ—ãƒã‚°ãƒ©ãƒ ï¼Œã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ãƒ»ã‚µã‚¤ã‚¨ãƒ³ã‚¹ï¼Œçµ±è¨ˆå¦ 2011-05-11ã€€R ã§ã‚¨ãƒ©ãƒˆã‚¹ãƒ†ãƒã‚¹ã®ç¯©ã€€ã®å¾ŒåŠã«ï¼Œã‚¢ãƒˆã‚ãƒ³ã®ç¯©ã®ãƒ—ãƒã‚°ãƒ©ãƒ ãŒæŽ²è¼‰ã•ã‚Œã¦ã„ã‚‹ã€‚ ã”æœ¬äººã‚‚ã€Œå¤šåˆ†æ¡ä»¶åˆ¤å®šæ¸›ã‚‰ã™ã¨ã‹ã—ã¦Rã«åˆã£ãŸå®Ÿè£…ã—ãªã„ã¨ãƒ€ãƒ¡ãªã‚“ã ã¨æ€ã†ã€ã¨ã„ã†ã¨ãŠã‚Šï¼Œãƒ™ã‚¯ãƒˆãƒ«åŒ–ã‚’ã¯ã‹ã‚‹ã€‚ã¡ãªã¿ã«ï¼Œå…ƒã®ãƒ—ãƒã‚°ãƒ©ãƒ ã§ã¯ for ã‚’é¿ã‘ã‚‹ãŸã‚ã‹ while ã§æ›¸ã„ã¦ã„ã‚‹ãŒã“ã‚Œã¯ã»ã¨ã‚“ã©æ„å‘³ãŒãªã„ã€‚ limit = 10000000 ã§ 23 ç§’ã‹ã‹ã£ã¦ã„ãŸã‚‚ã®ãŒï¼Œæ›¸ãç›´ã™ã¨ 0.4 ç§’ã»ã©ã§è¨ˆç®—çµ‚äº†ã¨ã„ã†ã“ã¨ã«ãªã£ãŸã€‚ ãƒ—ãƒã‚°ãƒ©ãƒ ã¯ä»¥ä¸‹ã®é€šã‚Šã€‚ atkin <- function(limit = 1e+06, return = FALSE) { sqrt.limit <- sqrt(limit) isprime <- logical(limit) for (z in
Rion778 2012/02/13
æ˜”ã®ã“ã¨éŽãŽã¦ä½•ã§whileä½¿ã£ãŸã‹æ—¢ã«æ€ã„å‡ºã›ãªã„ãªãƒ¼ã€‚ä½•ã‹foré¿ã‘ãŸã„ç†ç”±ãŒã‚ã£ãŸã‹ãªã€‚ã¾ãŸæš‡ãŒã‚ã£ãŸã‚‰ã‚„ã£ã¦ã¿ã‚ˆã†ã€‚

R

algorithm
ãƒªãƒ³ã‚¯
ç´ æ•°åˆ¤å®š - ã‚ã©ã‘ãªã„è©±
è¦ç´„ï¼šç´ æ•°åˆ¤å®šã«ä½¿ã‚ã‚Œã‚‹ãƒŸãƒ©ãƒ¼ãƒ©ãƒ“ãƒ³æ³•ã‚’è§£èª¬ã—ãªãŒã‚‰ã€Haskell ã§å®Ÿè£…ã—ã¦ã¿ã‚‹ã€‚ ãƒ•ã‚§ãƒ«ãƒžãƒ¼ãƒ†ã‚¹ãƒˆ å¤§ããªæ•°ã‚’ç¢ºå®Ÿã«ç´ æ•°ã ã¨åˆ¤å®šã™ã‚‹ã«ã¯ã€å¤§å¤‰æ™‚é–“ãŒã‹ã‹ã‚‹ã®ã§ã€å®Ÿç”¨çš„ã«ã¯ã€Œã»ã¼ç´ æ•°ã ã€ã¨ç¢ºçŽ‡çš„ã«åˆ¤å®šã™ã‚‹ã€‚ç¢ºçŽ‡çš„ãªç´ æ•°åˆ¤å®šã®ä»£è¡¨æ ¼ãŒãƒ•ã‚§ãƒ«ãƒžãƒ¼ãƒ†ã‚¹ãƒˆã§ã‚ã‚‹ã€‚ ãƒ•ã‚§ãƒ«ãƒžãƒ¼ãƒ†ã‚¹ãƒˆã«ã¯ã€ä»¥ä¸‹ã«ç¤ºã™ãƒ•ã‚§ãƒ«ãƒžãƒ¼ã®å°å®šç†ã‚’åˆ©ç”¨ã™ã‚‹ã€‚ a^p â‰¡ a (mod p) a ã¯ä»»æ„ã®æ•´æ•°ã€‚p ã¯ç´ æ•°ã§ã‚ã‚‹ã€‚æ³• p ã®ä¸‹ã§ a ã‚’ p ä¹—ã—ãŸã‚‚ã®ã¯ã€a ã¨åˆåŒã§ã‚ã‚‹ã¨è¨€ã†æ„å‘³ã ã€‚a ã«ã¯åˆ¶é™ã¯ãªã„ãŒã€ç‰¹ã« a ã‚’ p ã‚ˆã‚Šå°ã•ã„æ•´æ•°ã€0 â‰¦ a â‰¦ p - 1 ã¨ã™ã‚Œã°ã€a ã‚’ p ä¹—ã—ã¦ã€p ã§å‰²ã‚‹ã¨ a ã«æˆ»ã‚‹ã¨ã‚‚è§£é‡ˆã§ãã‚‹ã€‚ æœ€åˆã«è¦‹ãŸã¨ãã¯ã€ã ã‹ã‚‰ã©ã†ã—ãŸã¨æ€ã‚ã‚Œã‚‹ã‹ã‚‚ã—ã‚Œãªã„ã€‚ã—ã‹ã—ã€æœ‰åãªãƒ•ã‚§ãƒ«ãƒžãƒ¼ã®å¤§å®šç†ãŒå®Ÿç”¨ä¸Šä½•ã®å½¹ã«ã‚‚ç«‹ãŸãªã„ã®ã«å¯¾ã—ã€ãƒ•ã‚§ãƒ«ãƒžãƒ¼ã®å°å®šç†ã¯ã„ã‚ã‚“ãªå ´é¢ã§æ´»èºã™ã‚‹ã€‚ å®Ÿéš›ã«è¨ˆ
Rion778 2011/03/04
math

algorithm
ãƒªãƒ³ã‚¯
Katz's Site - ç®—èœå…¥é–€: ã‚ªãƒ¼ãƒˆãƒžãƒˆãƒ³ã®åŸºç¤Ž
ä»¥ä¸Šã®ã‚ˆã†ãªå›³ã‚„è¡¨ã«ã‚ˆã£ã¦è±¡å¾´ã•ã‚Œã‚‹ã€ çŠ¶æ…‹ã¨ãã®é–“ã®é·ç§»ãŒå®šç¾©ã•ã‚ŒãŸæ§‹é€ ã‚’ ã€ŒçŠ¶æ…‹æ©Ÿæ¢°ã€ ã¨å‘¼ã¶ã€‚ å„ã€…ã®çŠ¶æ…‹ã®æ„å‘³ã¯è€ƒãˆãªã„ã€‚ å…¨ãè€ƒãˆãªã„ã®ã‹ã¨ã„ãˆã°ãã†ã§ã‚‚ãªã„ã®ã ãŒã€ å°‘ãªãã¨ã‚‚ç†è«–ä¸Šã¯çŠ¶æ…‹ã¨ã—ã¦ä½•ã‚’æŒã£ã¦ãã¦ã‚‚æ§‹ã‚ãªã„ã€‚ å¥åº·çŠ¶æ…‹ã®ã‚ˆã†ã«æ˜Žã‚‰ã‹ãªæ„å‘³ã‚’æŒã¤ãƒ¢ãƒŽã‚’çŠ¶æ…‹ã¨ã™ã‚‹äº‹ã‚‚ã‚ã‚‹ã€‚ ä½•ãŒä½•ã ã‹ã•ã£ã±ã‚Šã‚ã‹ã‚‰ãªã„ãƒ¢ãƒŽã‚’çŠ¶æ…‹ã¨ã™ã‚‹äº‹ã‚‚ã‚ã‚‹ã€‚ ã‚¹ã‚´ãƒã‚¯ã®æ¡ç›®ã®ã‚ˆã†ãªãƒ¢ãƒŽã¯å¾Œè€…ã®ä¾‹ã¨è¨€ãˆã‚ˆã†ã€‚ å•é¡Œã‚’è§£ãç‚ºã«æœ€ã‚‚ä¾¿åˆ©ãªãƒ¢ãƒŽã‚’çŠ¶æ…‹ã¨ã—ã¦å®šç¾©ã™ã‚Œã°ã‚ˆã„ã€‚ å°‘ã—å¤‰ã‚ã£ãŸçŠ¶æ…‹æ©Ÿæ¢°ã®ä½¿ç”¨ä¾‹ï¼š è™Žã¨ç¾Šã‚’é€£ã‚ŒãŸäººãŒé‡Žèœã‚’é‹ã‚“ã§ã„ãŸã€‚ ã‚ã‚‹æ‰€ã§å·ã‚’æ¸¡ã‚‹å¿…è¦ãŒç”Ÿã˜ãŸã€‚ èˆŸãŒä¸€è‰˜ã‚ã£ãŸãŒã¨ã¦ã‚‚å°ã•ã„ã€‚ ãã®äººãŒä¹—ã‚‹ã¨ã‚ã¨ã¯è™Žã‹ç¾Šã‹é‡Žèœã®å†…ã®ã„ãšã‚Œã‹ä¸€ã¤ã—ã‹ä¹—ã›ã‚‰ã‚Œãªã„ã€‚ ã—ã‹ã—äººãŒå±…ãªã„æ‰€ã§è™Žã¨ç¾Šã‚’ä¸€ç·’ã«ã™ã‚‹ã¨è™Žã¯ç¾Šã‚’é£Ÿã¹ã¦ã—ã¾ã†ã€‚ åŒæ§˜ã«äººãŒå±…ãªã„ã¨ç¾Šã¯é‡Žèœã‚’é£Ÿã¹ã¦ã—ã¾
Rion778 2010/08/18
programming

algorithm
ãƒªãƒ³ã‚¯
RDBMSã§ä½¿ã‚ã‚Œã‚‹Bæœ¨ã‚’å¦ã¼ã† ï¼ˆ1/3ï¼‰ï¼ ï¼ IT
ç¬¬5å›ž RDBMSã§ä½¿ã‚ã‚Œã‚‹Bæœ¨ã‚’å¦ã¼ã† ã¯ã‚„ã—ã¤ã¨ã‚€ ã‚¢ãƒŠãƒã‚¤ãƒ ãƒ†ã‚¯ãƒŽãƒã‚¸ãƒ¼æ ªå¼ä¼šç¤¾ 2009/6/22 ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆæŒ‡å‘ã«ã‚ˆã£ã¦ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯éš ãºã„ã•ã‚Œã¦ã„ã‚‹ã“ã¨ãŒå¤šããªã£ãŸã€‚ã—ã‹ã—ã€ã€Œç”¨æ„ã•ã‚Œã¦ã„ãªã„å‡¦ç†ã€ãŒæ±‚ã‚ã‚‰ã‚ŒãŸã¨ãã«å¯¾å¿œã§ãã‚‹ã ã‚ã†ã‹ï¼ˆç·¨é›†éƒ¨ï¼‰ ç¬¬3å›žã€ŒAVLæœ¨ã§æœ¨æ§‹é€ ã‚’å¦ã¼ã†ã€ã€ç¬¬4å›žã€Œã‚‚ã£ã¨AVLæœ¨ã§æœ¨æ§‹é€ ã‚’å¦ã¼ã†ã€ã¨2å›žé€£ç¶šã§AVLæœ¨ã«ã¤ã„ã¦è§£èª¬ã—ã¾ã—ãŸã€‚ ä»Šå›žã¯Aã®å¾Œã ã‹ã‚‰Bã¨ã„ã†ã‚ã‘ã§ã¯ã‚ã‚Šã¾ã›ã‚“ãŒã€Bæœ¨ï¼ˆB-Treeï¼‰ã‚’å–ã‚Šä¸Šã’ã¾ã™ã€‚ Bæœ¨ã®å¤‰ç¨®ã§ã‚ã‚‹B+æœ¨ã‚„B*æœ¨ã¯ã€Oracleã‚„PostgreSQLã€Firebirdãªã©ã®ãƒªãƒ¬ãƒ¼ã‚·ãƒ§ãƒŠãƒ«ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã§ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã¨ã—ã¦åˆ©ç”¨ã•ã‚Œã¦ã„ã‚‹ã€ãƒ¡ã‚¸ãƒ£ãƒ¼ãªæœ¨æ§‹é€ ã§ã™ã€‚ ç†è€…ã¯Delphi 2009ã§ã‚µãƒ³ãƒ—ãƒ«ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ä½œæˆã—ã¦ã„ã¾ã™ãŒã€Delphiã‚’ãŠæŒã¡ã§ãªã„æ–¹ã¯ä¸‹è¨˜ã®URLã‹ã‚‰TurboDelphiã‚’ãƒ€ã‚¦ãƒ³ãƒãƒ¼ãƒ‰ã—ã¦
Rion778 2010/08/17
algorithm

database
ãƒªãƒ³ã‚¯
Evaluation of Powers
This is a very interesting probl em with a lots of history. Anyways we will not wonder into it. We shall see how fast can we calculate xn, given x and n where n is a positive integer. The brute force method would be to run a loop from 2 to n and calculate in n-1 steps. We will discuss three methods to do it quickly. Binary Method This the most common method used in programs today. It is also called
Rion778 2010/04/18
math

algorithm
ãƒªãƒ³ã‚¯
Integer Powers of a Number
Rion778 2010/04/17
math

algorithm
ãƒªãƒ³ã‚¯
ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ï¼ˆæœ€çŸçµŒè·¯å•é¡Œï¼‰
ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³• (Dijkstra's Algorithm) ã¯æœ€çŸçµŒè·¯å•é¡Œã‚’åŠ¹çŽ‡çš„ã«è§£ãã‚°ãƒ©ãƒ•ç†è«–ã«ãŠã‘ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ ã‚¹ã‚¿ãƒ¼ãƒˆãƒŽãƒ¼ãƒ‰ã‹ã‚‰ã‚´ãƒ¼ãƒ«ãƒŽãƒ¼ãƒ‰ã¾ã§ã®æœ€çŸè·é›¢ã¨ãã®çµŒè·¯ã‚’æ±‚ã‚ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ä»¥ä¸‹ã®ã‚°ãƒ©ãƒ•ã‚’ä¾‹ã«ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’è§£èª¬ã—ã¾ã™ã€‚ å††ãŒãƒŽãƒ¼ãƒ‰ï¼Œç·šãŒã‚¨ãƒƒã‚¸ã§ï¼ŒsãŒã‚¹ã‚¿ãƒ¼ãƒˆãƒŽãƒ¼ãƒ‰ï¼ŒgãŒã‚´ãƒ¼ãƒ«ãƒŽãƒ¼ãƒ‰ã‚’è¡¨ã—ã¦ã„ã¾ã™ã€‚ ã‚¨ãƒƒã‚¸ã®è¿‘ãã«æ›¸ã‹ã‚Œã¦ã„ã‚‹æ•°å—ã¯ãã®ã‚¨ãƒƒã‚¸ã‚’é€šã‚‹ã®ã«å¿…è¦ãªã‚³ã‚¹ãƒˆï¼ˆãŸã„ã¦ã„è·é›¢ã¾ãŸã¯æ™‚é–“ï¼‰ã§ã™ã€‚ ã“ã“ã§ã¯ã‚¨ãƒƒã‚¸ã«å‘ããŒå˜åœ¨ã—ãªã„ï¼ˆï¼ã©ã¡ã‚‰ã‹ã‚‰ã§ã‚‚é€šã‚Œã‚‹ï¼‰ç„¡å‘ã‚°ãƒ©ãƒ•ã ã¨ã—ã¦æ‰±ã£ã¦ã„ã¾ã™ãŒï¼Œ ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã®å ´åˆã¯ãã‚Œã»ã©ç„¡å‘ã‚°ãƒ©ãƒ•ã¨æœ‰å‘ã‚°ãƒ©ãƒ•ã‚’åŒºåˆ¥ã—ã¦è€ƒãˆã‚‹å¿…è¦ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚ ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã¯DPï¼ˆå‹•çš„è¨ˆç”»æ³•ï¼‰çš„ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ ã¤ã¾ã‚Šï¼Œã€Œæ‰‹è¿‘ã§æ˜Žã‚‰ã‹ãªã“ã¨ã‹ã‚‰é †æ¬¡ç¢ºå®šã—ã¦ã„ãï¼Œãã®ç¢ºå®šã—ãŸæƒ…å ±ã‚’ã‚‚ã¨ã«ã•ã‚‰ã«é ãã¾ã§ç¢ºå®šã—ã¦ã„ã
Rion778 2010/03/28
algorithm

programming

graph
ãƒªãƒ³ã‚¯
ç›´ç·šã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å††ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ã“ã‚Œã‚‚è‰²ã€…ã‚ã‚‹ã®ã§ã™ãŒå¤šã„ã®ã¯ ï¼‘ï¼‰ç·šåˆ†ã®å§‹ç‚¹çµ‚ç‚¹ã§å‡ºæ¥ã‚‹é•·æ–¹å½¢ãŒäº¤ã‚ã‚‹ã‹ï¼Ÿ ï¼’ï¼‰ç·šåˆ†ãŒåŽã¾ã‚‹å††ã‚’æã„ã¦å††åŒå£«ãŒäº¤ã‚ã‚‹ã‹ï¼Ÿ ï¼“ï¼‰ç‰‡æ–¹ã®ç«¯ç‚¹ã‹ã‚‰ç·šåˆ†ã¨ã®è·é›¢ï¼’çµ„ã¿ã‚’æ±‚ã‚ã¦çŸã„æ–¹ ã®ï¼“ã¤ãã‚‰ã„ã‹ãªï¼Ÿ ï¼‘ï¼‰ã¯åˆ¤æ–ã‚’ä¸¦ã¹ã‚Œã°è‰¯ã„ã ã‘ ã—ã‹ã—ã€åˆ†å²ãŒå…¥ã‚‹ã¨CPUã¯é…ã„ã®ã§ã€ ã‚¢ã‚»ãƒ³ãƒ–ãƒ©ãƒ¬ãƒ™ãƒ«ã§å¤§å°æ¯”è¼ƒçµæžœ(CF)ã‚’é›†ã‚ã¦ã¾ã¨ã‚ã¦æ¯”è¼ƒã™ã‚‹ã‚ˆã†ãªå·¥å¤«ãŒå¿…è¦ã§ã™ã€‚ ï¼’ï¼‰å††åŒå£«ãŒäº¤ã‚ã‚‹ã‹ã¯ã€ä¸å¿ƒåŒå£«ã®è·é›¢ã‚’æ±‚ã‚ã¦åŒæ–¹ã®å††ã®åŠå¾„ã® å’Œ(ç·šåˆ†ã®é•·ã•åˆè¨ˆ/2)ã¨ã®å¤§å°æ¯”è¼ƒã—ã¾ã™ã€‚ hypotenuse ã‚’è’ãã€èª¤å·®åˆ†ã‚’å®‰å…¨å´ã«åˆ¤å®šã‚Œã°(åˆ†å²äºˆæ¸¬ã®ãƒŸã‚¹ã§ãƒšãƒŠãƒ«ãƒ†ã‚£ã‚’æ‰•ã†CPUã§ã¯) 1)ã‚ˆã‚Šé«˜é€Ÿã§ã™ã€‚ ï¼“ï¼‰ã¯ç·šåˆ†ã®äº¤å·®åˆ¤å®šã®åˆæ®µã¨å®Ÿã¯åŒã˜è¨ˆç®—ã‚’ã—ã¾ã™ã€‚ ã“ã‚Œä½¿ã†ãªã‚‰ç´ ç›´ã«äº¤å·®åˆ¤å®šã—ãŸæ–¹ãŒãƒžã‚· GUIã®ç‚ºã«ã€å¿…è¦ãªå‡¦ç†ã§ã™ã€‚ ãƒžã‚¦ã‚¹åº§æ¨™ã‚’p0 ç·šåˆ†ãŒç‚¹p1,p2ã‚’é€šã‚‹ã¨ã—ã¦ rx:=p1.x-p0.x , ry:=p
Rion778 2010/03/06
algorithm
ãƒªãƒ³ã‚¯
æœ€å¼·æœ€é€Ÿã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼é¤Šæˆè¬›åº§ï¼šã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼ã®ç™»ç«œé–€ã€ã€Œå‹•çš„è¨ˆç”»æ³•ãƒ»ãƒ¡ãƒ¢åŒ–å†å¸°ã€ã¯ã“ã‚“ãªã«ç°¡å˜ã ã£ãŸ (1/5) - ITmedia ã‚¨ãƒ³ã‚¿ãƒ¼ãƒ—ãƒ©ã‚¤ã‚º
å‹•çš„è¨ˆç”»æ³•ã¨ãƒ¡ãƒ¢åŒ–å†å¸° ä»Šå›žã¯ã€éžå¸¸ã«ã‚ˆãç”¨ã„ã‚‰ã‚Œã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹ã€ã€Œå‹•çš„è¨ˆç”»æ³•ã€ã€Œãƒ¡ãƒ¢åŒ–å†å¸°ã€ã«ã¤ã„ã¦èª¬æ˜Žã—ã¾ã™ã€‚ã“ã®2ã¤ã¯ã‚»ãƒƒãƒˆã§è¦šãˆã¦ã€ä¸¡æ–¹ä½¿ãˆã‚‹ã‚ˆã†ã«ã—ã¦ãŠãã¨ä¾¿åˆ©ã§ã™ã€‚ ãªãŠã€ãƒ¡ãƒ¢åŒ–å†å¸°ã«é–¢ã—ã¦ã¯ã€ç¬¬5ãƒ»6å›žã®é€£è¼‰ã®çŸ¥è˜ã‚’è¸ã¾ãˆãŸä¸Šã§èªã‚“ã§ã„ãŸã ã‘ã‚‹ã¨ã€ç†è§£ãŒæ·±ã¾ã‚Šã¾ã™ã€‚ã¾ã ãŠèªã¿ã«ãªã£ã¦ã„ãªã„æ–¹ã¯ã€ã“ã®æ©Ÿä¼šã«ãœã²ã”è¦§ãã ã•ã„ã€‚ ä¸å¦å—é¨“ãªã©ã‚’çµŒé¨“ã•ã‚ŒãŸæ–¹ã§ã‚ã‚Œã°ã€ã“ã†ã„ã£ãŸå•é¡Œã‚’ä¸€åº¦ã¯è§£ã„ãŸã“ã¨ãŒã‚ã‚‹ã®ã§ã¯ãªã„ã§ã—ã‚‡ã†ã‹ã€‚å°å¦æ ¡ã®çŸ¥è˜ã¾ã§ã§è§£ã“ã†ã¨ã™ã‚Œã°ã€å°‘ã—æ™‚é–“ã¯æŽ›ã‹ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ãŒã€ãã‚Œã§ã‚‚ã“ã‚ŒãŒè§£ã‘ãªã„ã¨ã„ã†æ–¹ã¯å°‘ãªã„ã ã‚ã†ã¨æ€ã„ã¾ã™ã€‚ ã“ã®å•é¡Œã‚’ãƒ—ãƒã‚°ãƒ©ãƒ ã§è§£ã“ã†ã¨ã™ã‚‹ã¨ã€ã•ã¾ã–ã¾ãªè§£æ³•ãŒå˜åœ¨ã—ã¾ã™ã€‚è§£ãæ–¹ã«ã‚ˆã£ã¦è¨ˆç®—æ™‚é–“ã‚„æœ‰åŠ¹ç¯„å›²ãŒå¤§ããå¤‰åŒ–ã—ã¾ã™ã®ã§ã€ãã‚Œãžã‚Œã®ãƒ‘ã‚¿ãƒ¼ãƒ³ã«ã¤ã„ã¦è€ƒãˆã¾ã™ã€‚ ä»¥ä¸‹ã®èª¬æ˜Žã§ã¯ã€ç¸¦hã€æ¨ªwã¨ã—ã¦è¡¨è¨˜ã—ã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œæ™‚é–“ã«é–¢ã—ã¦ã¯ã€
Rion778 2010/03/06
algorithm

Programming
ãƒªãƒ³ã‚¯
ãƒˆãƒƒãƒ—ã‚¯ãƒ©ã‚¹ã ã‘ãŒçŸ¥ã‚‹ã€Œã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒã™ã”ã„ã€â€•â€•ã€ŒæŽ¢ç´¢ã€åŸºç¤Žæœ€é€Ÿãƒžã‚¹ã‚¿ãƒ¼
ãƒˆãƒƒãƒ—ã‚¯ãƒ©ã‚¹ã ã‘ãŒçŸ¥ã‚‹ã€Œã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒã™ã”ã„ã€â€•â€•ã€ŒæŽ¢ç´¢ã€åŸºç¤Žæœ€é€Ÿãƒžã‚¹ã‚¿ãƒ¼ï¼šæœ€å¼·æœ€é€Ÿã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼é¤Šæˆè¬›åº§ï¼ˆ1/4 ãƒšãƒ¼ã‚¸ï¼‰ ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘ã‚‹é‡è¦ãªæ¦‚å¿µã§ã‚ã‚‹ã€ŒæŽ¢ç´¢ã€ã‚’æœ€é€Ÿã§ãƒžã‚¹ã‚¿ãƒ¼ã™ã‚‹ãŸã‚ã«ã€ä»Šå›žã¯å°‘ã—å¿œç”¨ã¨ãªã‚‹æŽ¢ç´¢æ‰‹æ³•ãªã©ã‚’ç´¹ä»‹ã—ãªãŒã‚‰ã€ãã®å®Ÿè·µåŠ›ã‚’è‚²æˆã—ã¾ã™ã€‚å•é¡Œã‚’ã‚°ãƒ©ãƒ•ã¨ã—ã¦è¡¨ç¾ã—ã€åŠ¹çŽ‡ã‚ˆãæŽ¢ç´¢ã™ã‚‹æ–¹æ³•ã‚’ãœã²æ—¥å¸¸ã«ç”Ÿã‹ã—ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ ã¾ã ã¾ã æ´»ç”¨å¯èƒ½ãªæŽ¢ç´¢ å‰å›žã®ã€ŒçŸ¥ã‚Œã°å¤©å›½ã€çŸ¥ã‚‰ãã°åœ°ç„â€•â€•ã€ŽæŽ¢ç´¢ã€è™Žã®å·»ã€ã§ã€ã€ŒæŽ¢ç´¢ã€ã¨ã„ã†æ¦‚å¿µã®åŸºç¤Žã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã—ãŸã€‚ã™ã§ã«æŽ¢ç´¢ã«ã¤ã„ã¦ã‚ˆãç†è§£ã—ã¦ã„ã‚‹æ–¹ã«ã¯ç‰©è¶³ã‚Šãªã‹ã£ãŸã‹ã¨æ€ã„ã¾ã™ãŒã€ã€Œå•é¡Œã‚’ã‚°ãƒ©ãƒ•ã¨ã—ã¦ã†ã¾ãè¡¨ç¾ã—ã€ãã®ã‚°ãƒ©ãƒ•ã‚’åŠ¹çŽ‡ã‚ˆãæŽ¢ç´¢ã™ã‚‹ã€ã¨ã„ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼çš„ãªæ€è€ƒæ³•ãŒã¾ã èº«ã«ã¤ã„ã¦ã„ãªã‹ã£ãŸæ–¹ã«ã¯ã€å¾—ã‚‹ã‚‚ã®ã‚‚ã‚ã£ãŸã®ã§ã¯ãªã„ã§ã—ã‚‡ã†ã‹ã€‚ å‰å›žã¯ã€ã€Œå¹…å„ªå…ˆæŽ¢ç´¢ã€ã¨ã€Œæ·±ã•å„ªå…ˆæŽ¢ç´¢ã€ã¨ã„ã†ã€æ¯”è¼ƒçš„å˜ç´”ãªã‚‚ã®ã‚’ç´¹ä»‹ã—ã¾ã—ãŸãŒ
Rion778 2010/02/06
programming

algorithm
ãƒªãƒ³ã‚¯
1