[B! ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ] mzpã®ãƒ

mzp id:mzp

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«é–¢ã™ã‚‹mzpã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (9)

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

æœ€é•·å…±é€šéƒ¨åˆ†ç³»åˆ—é•·ï¼ˆLCSï¼‰ã‚’æ±‚ã‚ã‚‹Javaãƒ—ãƒã‚°ãƒ©ãƒ - sternhellerã®æ—¥è¨˜
ç´ æœ´ã«å®Ÿè£…ã€‚LCSé•·ãŒä½•ãŸã‚‹ã‹ã¯åˆ¥ã®ãƒšãƒ¼ã‚¸ã‚’å‚ç…§ã—ã¦ãã ã•ã„ã€‚ LCSã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€ç³»åˆ—Xã®iç•ªç›®ã‚’xiã€ç³»åˆ—Yã®jç•ªç›®ã‚’yjã¨ã™ã‚‹ã¨ã€ i = 0 ã¾ãŸã¯ j = 0 ã®ã¨ãã€ LCS(i, j) = 0 i, j > 0 ã‹ã¤ xi == yj ã®ã¨ãã€ LCS(i, j) = LCS(i-1, j-1) + 1 i, j > 0 ã‹ã¤ xi != yj ã®ã¨ãã€ LCS(i, j) = max(LCS(i-1, j), LCS(i, j-1)) ã§ã™ãŒã€Javaã¯é…åˆ—ãŒ0ã‚ªãƒªã‚¸ãƒ³ãªã®ã§ã€ã“ã®ã¾ã¾ç´ ç›´ã«å®Ÿè£…ã—ã¦ã—ã¾ã†ã¨ç³»åˆ—Xã¨Yã®ä¸€æ–‡å—ç›®ãŒä¸€è‡´ã—ãŸå ´åˆã§ã‚‚LCSé•·ãŒ0ã«ãªã£ã¦ã—ã¾ã„ã¾ã™ã€‚ãã“ã§ã¡ã‚‡ã£ã¨ãƒˆãƒªãƒƒã‚ãƒ¼ãªå®Ÿè£…ã«ã—ã¦ã¿ã¾ã—ãŸã€‚ public class LongestCommonSubsequence { // å®Ÿè¡Œã‚µãƒ³ãƒ—ãƒ« public static void main(S
mzp 2010/06/23
lcs

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
æœ€é•·å…±é€šéƒ¨åˆ†åˆ—å•é¡Œ (Longest Common Subsequence) - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
éƒ¨åˆ†åˆ— (Subsequence) ã¯ç³»åˆ—ã®ã„ãã¤ã‹ã®è¦ç´ ã‚’å–ã‚Šå‡ºã—ã¦ã§ããŸç³»åˆ—ã®ã“ã¨ã§ã™ã€‚äºŒã¤ã®ç³»åˆ—ã®å…±é€šã®éƒ¨åˆ†åˆ—ã‚’å…±é€šéƒ¨åˆ†åˆ— (Common Subsecuence)ã¨è¨€ã„ã¾ã™ã€‚å…±é€šéƒ¨åˆ†åˆ—ã®ã†ã¡ã€ã‚‚ã£ã¨ã‚‚é•·ã„ã‚‚ã®ã‚’æœ€é•·å…±é€šéƒ¨åˆ†åˆ— (Longest Common Subsequence, LCS) ã¨è¨€ã„ã¾ã™ã€‚ X = <A, B, C, B, D, A, B> Y = <B, D, C, A, B, A> ã¨ã„ã†äºŒã¤ã®ç³»åˆ—ã‹ã‚‰å¾—ã‚‰ã‚Œã‚‹ LCS ã¯ <B, C, B, A> ã§ã€ãã®é•·ã•ã¯ 4 ã§ã™ã€‚é•·ã• 2 ã®<B, D> ã®é•·ã• 3 ã® <A, B, A> ãªã©ã‚‚å…±é€šéƒ¨åˆ†åˆ—ã§ã™ãŒã€æœ€é•·ã§ã¯ãªã„ã®ã§ã“ã‚Œã‚‰ã¯ LCS ã§ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚ã¾ãŸã€LCS ã¯æœ€é•·ã§ã‚ã‚Œã°ä½ç½®ã¯ã©ã“ã§ã‚‚è‰¯ã„ã®ã§ã€ã“ã®å ´åˆ <B, D, A, B> ã‚‚ LCS ã§ã™ã€‚ LCS ã¯å‹•çš„è¨ˆç”»æ³• (Dynamic Prog
mzp 2010/06/23
lcs

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
ã‚¹ãƒšãƒ«ä¿®æ£ãƒ—ãƒã‚°ãƒ©ãƒ ã¯ã©ã†æ›¸ãã‹
Peter Norvig / é’æœ¨é– è¨³ å…ˆé€±ã€2äººã®å‹äºº(ãƒ‡ã‚£ãƒ¼ãƒ³ã¨ãƒ“ãƒ«)ãŒãã‚Œãžã‚Œåˆ¥å€‹ã«GoogleãŒæ¥µã‚ã¦æ—©ãæ£ç¢ºã«ã‚¹ãƒšãƒ«ä¿®æ£ã§ãã‚‹ã®ã«ã¯é©šãã°ã‹ã‚Šã ã¨ç§ã«è¨€ã£ãŸã€‚ãŸã¨ãˆã° speling ã®ã‚ˆã†ãªèªžã§Googleã‚’æ¤œç´¢ã™ã‚‹ã¨ã€0.1ç§’ãã‚‰ã„ã§ç”ãˆãŒè¿”ã£ã¦ãã¦ã€ã‚‚ã—ã‹ã—ã¦: spelling ã˜ã‚ƒãªã„ã‹ã¨è¨€ã£ã¦ãã‚‹(Yahooã‚„Microsoftã®ã‚‚ã®ã«ã‚‚åŒæ§˜ã®æ©Ÿèƒ½ãŒã‚ã‚‹)ã€‚ãƒ‡ã‚£ãƒ¼ãƒ³ã¨ãƒ“ãƒ«ãŒé«˜ã„å®Ÿç¸¾ã‚’æŒã£ãŸã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã§ã‚ã‚Šæ•°å¦è€…ã§ã‚ã‚‹ã“ã¨ã‚’æ€ãˆã°ã€ã‚¹ãƒšãƒ«ä¿®æ£ã®ã‚ˆã†ãªçµ±è¨ˆçš„è¨€èªžå‡¦ç†ã«ã¤ã„ã¦ã‚‚ã£ã¨çŸ¥ã£ã¦ã„ã¦è‰¯ã•ãã†ãªã‚‚ã®ãªã®ã«ã¨ç§ã¯é©šã„ãŸã€‚ã—ã‹ã—å½¼ã‚‰ã¯çŸ¥ã‚‰ãªã‹ã£ãŸã€‚ã‚ˆãè€ƒãˆã¦ã¿ã‚Œã°ã€ åˆ¥ã«å½¼ã‚‰ãŒçŸ¥ã£ã¦ã„ã‚‹ã¹ãç†ç”±ã¯ãªã„ã®ã ã£ãŸã€‚ é–“é•ã£ã¦ã„ãŸã®ã¯å½¼ã‚‰ã®çŸ¥è˜ã§ã¯ãªãã€ç§ã®ä»®å®šã®æ–¹ã ã€‚ ã“ã®ã“ã¨ã«ã¤ã„ã¦ã¡ã‚ƒã‚“ã¨ã—ãŸèª¬æ˜Žã‚’æ›¸ã„ã¦ãŠã‘ã°ã€å½¼ã‚‰ã°ã‹ã‚Šã§ãªãå¤šãã®äººã«æœ‰ç›Šã‹ã‚‚ã—ã‚Œãªã„ã€‚Googleã®
mzp 2007/04/27
*ãƒ—ãƒã‚°ãƒ©ãƒ å‚è€ƒ

Python

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
äº¤å·®ç‚¹å•é¡Œ - madæ—¥è¨˜
å¤§å¦ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã„ã†æŽˆæ¥ã§é¡Œæã«ãªã£ã¦ãŸå•é¡Œã€‚ãã‚Œã«BGL(Boost Graph Library)ã§å–ã‚Šçµ„ã‚“ã§ã¿ãŸã€‚ äº¤å·®ç‚¹å•é¡Œ å·¦å›³ã®æ§˜ãªäº¤å·®ç‚¹ãŒã‚ã‚‹ã€‚ å…¨ã¦ã®é€²è·¯ã«ä¿¡å·ãŒè¨ç½®ã—ã¦ã‚ã‚‹ã€‚ çŸ¢å°æ–¹å‘ã«ã—ã‹é€²ã‚€ã“ã¨ãŒã§ããªã„ã€‚ äº¤å·®ã™ã‚‹é€²è·¯ã¯åŒæ™‚ã«ä¿¡å·ã‚’ç‚¹ç¯ã™ã‚‹ã“ã¨ãŒã§ããªã„ã€‚ åŠ¹çŽ‡è‰¯ãè»Šã‚’é€²ã‚ã‚‹ã“ã¨ã®ã§ãã‚‹ç‚¹ç¯ã®ä»•æ–¹ã‚’æ±‚ã‚ã‚ˆã€‚ ã¨ã„ã†å•é¡Œã€‚ ã¾ãšã€ã“ã†ã„ã£ãŸç¾å®Ÿã®å•é¡Œã‚’æ•°å¦ã®ãƒ¢ãƒ‡ãƒ«ã«ç½®ãæ›ãˆã‚‹ã€‚ãã‚ŒãŒå³å›³ã€‚ ABãªã©ã®ä¸€ã¤ã®ãƒŽãƒ¼ãƒ‰ãŒA->Bãªã©ã¨é€²ã‚€é€²è·¯ã®ä¿¡å·ã‚’è¡¨ã™ã€‚ äº¤å·®ã™ã‚‹é€²è·¯ã¯äº’ã„ã«ç·šã§çµã°ã‚Œã¦ã„ã‚‹ã€‚ åŒæ™‚ã«ç‚¹ç¯ã™ã‚‹ä¿¡å·ã®ãƒŽãƒ¼ãƒ‰ã‚’åŒã˜è‰²ã§å¡—ã‚‹ã€‚ ç·šã§çµã°ã‚Œã¦ã„ã‚‹ãƒŽãƒ¼ãƒ‰ã¯åŒã˜è‰²ã§å¡—ã‚‰ã‚Œã¦ã„ã¦ã¯ã„ã‘ãªã„ã€‚ è‰²ã®æ•°ãŒæœ€ã‚‚å°‘ãªããªã‚‹ã‚ˆã†ãªå¡—ã‚ã‘ã‹ãŸã‚’æŽ¢ã›ã€‚ ã¨ã„ã†æ„Ÿã˜ã§ã€ãƒ¢ãƒ‡ãƒ«åŒ–ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã€‚"è‰²"ã¨ã„ã†æ¦‚å¿µã§è€ƒãˆã‚‹ã®ã¯å››è‰²å•é¡ŒãŒãã®èµ·æºãªã®ã‹ãªã€‚ ã‚“ã§ã€ã“ã®å•é¡Œã¯ã€ŒN
mzp 2006/10/26
äº¤å·®ç‚¹å•é¡Œ

*ãƒ—ãƒã‚°ãƒ©ãƒ å‚è€ƒ

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
SoftURR -- a preliminary software implementation of URR
SoftURRâ€URRã®ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã«ã‚ˆã‚‹å®Ÿè£…ã®è©¦ã¿ version 0.1 å…¬é–‹ã€‚ Project Page ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ softurr-0.1.tar.gz 1. SoftURRã¨ã¯ SoftURRã¯ã€URR(Universal Representation of Real numbers;ä¸‡èƒ½æ•°å€¤è¡¨ç¾æ³•)ã® ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã«ã‚ˆã‚‹å®Ÿè£…ã§ã™ã€‚ URRã¯ã€ç®—è¡“çš„ã«ç¾Žã—ãã€å®Ÿç”¨çš„ã«ã‚‚å„ªã‚ŒãŸæµ®å‹•å°æ•°ç‚¹æ•°ã®è¡¨ç¾æ–¹æ³•ã§ã™ãŒã€ ãƒãƒ¼ãƒ‰ã‚¦ã‚§ã‚¢ã§å®Ÿç¾ã™ã‚‹ã“ã¨ãŒå®¹æ˜“ã§ãªã‹ã£ãŸãŸã‚ã€ IEEE 754ã®ã‚ˆã†ã«åºƒãç”¨ã„ã‚‰ã‚Œã‚‹ã“ã¨ã¯ã‚ã‚Šã¾ã›ã‚“ã§ã—ãŸã€‚ SoftURRã§ã¯ã€"å‹•ã"URRã‚’ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢(x86ã®æ•´æ•°æ¼”ç®—)ã§å®Ÿè£…ã—ã¦ã¿ã‚‹ã“ã¨ã§ã€ URRã‚’å®Ÿç”¨åŒ–ã™ã‚‹ã¨ãã«å¿…è¦ã¨ãªã£ã¦ãã‚‹çŸ¥è˜ã‚„çµŒé¨“ã‚’è“„ç©ã—ã€ æœ€çµ‚çš„ã«ã¯ã€(å¤¢ã¯å¤§ããï¼)è¦æ ¼åŒ–ã«å‘ã‘ãŸæè¨€ã‚’è¡Œã†ã“ã¨ã‚’ç›®æ¨™ã¨ã—ã¦ã„ã¾ã™ã€‚ 2. U
mzp 2006/07/31
URR(Universal Representation of Real numbers;ä¸‡èƒ½æ•°å€¤è¡¨ç¾æ³•)

*ãƒ—ãƒã‚°ãƒ©ãƒ å‚è€ƒ

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
æš—å·ã®å±æ®†åŒ–ã¨æ–°ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ â€” æ—§ãƒ¡ã‚¤ãƒ³ãƒ»ãƒ–ãƒã‚° | Baldanders.info
L ãŒéµé•·ã§ N ãŒè¢«ç½²åãƒ‡ãƒ¼ã‚¿ã®ã‚µã‚¤ã‚ºã§ã™ã€‚ FIPS186-3 ãƒ‰ãƒ©ãƒ•ãƒˆæ¡ˆã§ã¯ã“ã®çµ„ã¿åˆã‚ã›ã®ä¸ã‹ã‚‰é¸æŠžã—ã¦ä½¿ã†ã¹ãã¨ã—ã¦ã„ã¾ã™ã€‚ ã¨ã“ã‚ã§ç½²åãƒ»æš—å·ã«ä½¿ã†éµã®é•·ã•ã¯ã©ã®ç¨‹åº¦ãŒé©å½“ã§ã—ã‚‡ã†ã‹ã€‚ ç¢ºã‹ã«é•·ã‘ã‚Œã°é•·ã„ã»ã©å®‰å…¨ã¨ã„ãˆã¾ã™ãŒï¼Œ é•·ã™ãŽã‚‹éµã¯ã¨ã‚Šã¾ã‚ã—ãŒä¸ä¾¿ã§ã™ã€‚ ã“ã®ä»¶ã«ã¤ã„ã¦ã¯ IPA/ISEC ã«ã‚ˆã‚‹ ã€Œå°†æ¥ã®æš—å·æŠ€è¡“ã«é–¢ã™ã‚‹å®‰å…¨æ€§è¦ä»¶èª¿æŸ»ã€ ãŒå‚è€ƒã«ãªã‚Šã¾ã™ã€‚ è©³ã—ã„å†…å®¹ã¯ãã¡ã‚‰ã‚’èªã‚“ã§ã„ãŸã ãã¨ã—ã¦ï¼Œ çµè«–ã¨ã—ã¦ã¯ï¼Œ ä»Šå¾Œ10å¹´ã®ã‚¹ãƒ‘ãƒ³ã§è€ƒãˆã‚‹ãªã‚‰å…±é€šéµæš—å·ã®éµã§128ãƒ“ãƒƒãƒˆç¨‹åº¦ã§ååˆ†ãªã‚ˆã†ã§ã™ã€‚ 128ãƒ“ãƒƒãƒˆã®å…±é€šéµæš—å·éµã‚’å…¬é–‹éµæš—å·éµã«æ›ç®—ã™ã‚‹ã¨ã©ã®ç¨‹åº¦ã«ãªã‚‹ã‹ã¯é›£ã—ã„ã§ã™ãŒï¼ˆå…ˆã»ã©ç´¹ä»‹ã—ãŸèª¿æŸ»å ±å‘Šæ›¸ã§ã¯å‚è€ƒå€¤ã¨ã—ãªãŒã‚‰ã‚‚ã‹ãªã‚Šå¤§ãã„éµã‚’è¦æ±‚ã—ã¦ã„ã‚‹ã‚ˆã†ã«èªã‚ã¾ã—ãŸãŒï¼‰ï¼Œ ã“ã‚Œã«ã¤ã„ã¦ã¯ RSA Security ã«ã‚ˆã‚‹ ã€ŒA Cost-Based Security
mzp 2006/07/06
*ãƒ—ãƒã‚°ãƒ©ãƒ å‚è€ƒ

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
A 10-MINUTE DESCRIPTION OF HOW JUDY ARRAYS WORK AND WHY THEY ARE SO FAST
A 10-MINUTE DESCRIPTION OF HOW JUDY ARRAYS WORK AND WHY THEY ARE SO FAST By Doug Baskins, [email protected] October 16, 2001, Revised July 2002 As the inventor of the Judy algorithm I've been asked repeatedly, "What makes Judy so fast?" The answer is not simple, but finally I can share all of the details. (In June 2002, Judy was opened sourced with a LGPL license and hosted at http://sourceforge
mzp 2006/07/03
*ãƒ—ãƒã‚°ãƒ©ãƒ å‚è€ƒ

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
Matzã«ã£ã(2006-06-28)
<< 2006/06/ 1 1. [Ruby] Bitwise Magazine :: Ruby programming tutorial 2. [Ruby] Bitwise Magazine :: Ruby Programming 3. [Ruby] mandatory arguments after splat 2 1. å¹³æˆ17å¹´åº¦æƒ…å ±åŒ–æœˆé–“ ç¬¬26å›ž U20ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆ 2. [OSS] ZDNet.com ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹ãƒ–ãƒã‚°:æˆåŠŸã™ã‚‹ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹ãƒ“ã‚¸ãƒã‚¹ãƒ¢ãƒ‡ãƒ«7é¸ 3. [Ruby] Ruby ã®ãƒ–ãƒãƒƒã‚¯ã£ã¦ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã˜ã‚ƒãªã„ã‚ˆãã€‚ã“ã‚Œã£ã¦â€œé©šãæœ€å°ã®æ³•å‰‡â€ã«åã—ãªã„ï¼Ÿ 3 1. SANYO ã‚‚ã¡ã¤ããƒ™ãƒ¼ã‚«ãƒªãƒ¼ 2. å¼•ã£è¶Šã— 3. [æ•™ä¼š] ãƒãƒ—ãƒ†ã‚¹ãƒžä¼š 4. ã€Ž4797336021ã€ 4 1. [æ•™ä¼š] ç¬¬ä¸€å®‰æ¯æ—¥ 5 1. ãƒžãƒ«ãƒãƒ¡ãƒ‡ã‚£ã‚¢é€šä¿¡ã¨åˆ†æ•£å‡¦ç†ç ”ç©¶
mzp 2006/07/03
*ãƒ—ãƒã‚°ãƒ©ãƒ å‚è€ƒ

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
ãƒ™ã‚¤ã‚¸ã‚¢ãƒ³ãƒ•ã‚£ãƒ«ã‚¿ã«ã¤ã„ã¦
æœ€è¿‘è©±é¡Œã®ãƒ™ã‚¤ã‚ºç†è«–ã‚’ç”¨ã„ãŸãƒ•ã‚£ãƒ«ã‚¿ã«ã¤ã„ã¦æ•´ç†ã—ã¦ã¿ã¾ã—ãŸï¼Žã¾ãšï¼Œãƒ™ ã‚¤ã‚ºç†è«–ãŒæ³¨ç›®ã•ã‚Œå§‹ã‚ãŸã¨ã„ã†ãƒ‹ãƒ¥ãƒ¼ã‚¹ã‚’æœ€åˆã«ã¿ãŸã®ãŒï¼Œï¼ï¼³ã‚‚æ³¨ç›®ã™ã‚‹ â€œãƒ™ã‚¤ã‚ºâ€ã£ã¦ä½•ã (oricom.co.jp)ã§ã—ãŸï¼Ž ã“ã®ã¨ãã¯å¯¾ã—ã¦æ°—ã«ã‚‚ã¨ã‚ã¦ã„ã¾ã›ã‚“ã§ã—ãŸãŒï¼Œå†åº¦èˆˆå‘³ã‚’ããã‚‰ã‚Œå‡ºã—ãŸ ã®ãŒï¼Œã‚°ãƒ¼ã‚°ãƒ«ã€ã‚¤ãƒ³ãƒ†ãƒ«ã€MSãŒæ³¨ç›®ã™ã‚‹ãƒ™ã‚¤ã‚ºç†è«–(CNET)ã®ãƒ‹ãƒ¥ãƒ¼ã‚¹ï¼Ž MSã ã‘ãªã‚‰ã¾ã ã—ã‚‚ï¼ŒGoogleãŒï¼Œã¨ã„ã†ã®ãŒè‡ªåˆ†çš„ã«ã¯å¤§ãã‹ã£ãŸã§ã™ï¼Žã—ã‹ ã—ï¼Œã“ã®ãƒ‹ãƒ¥ãƒ¼ã‚¹ã ã‘ã§ã¯ï¼Œã“ã®æŠ€è¡“ãŒå…·ä½“çš„ã«ã©ã®ã‚ˆã†ã«æŽ¡ç”¨ã•ã‚Œã‚‹ã®ã‹ï¼Œ ç‰¹ã«æ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³ã®ã‚ˆã†ãªå¤§è¦æ¨¡ãªã‚‚ã®ã«é©ç”¨å¯èƒ½ã‹ã©ã†ã‹ã¯å¤§ããªç–‘å•ã§ã— ãŸï¼Ž ãã‚‚ãã‚‚ï¼Œã“ã®ãƒ™ã‚¤ã‚ºç†è«–ãŒã©ã“ã«èžã„ã¦ãã‚‹ã®ã‹ã¨ã„ã†ã“ã¨ã‚’è€ƒãˆã‚‹ã¨ãã® ç–‘å•ã¯è‡ªç„¶ã ã¨æ€ã„ã¾ã™ï¼Žãƒ™ã‚¤ã‚ºç†è«–ï¼ˆãƒ™ã‚¤ã‚ºæŽ¨å®šï¼‰ã¯ï¼ŒéŽåŽ»ã«èµ·ããŸäº‹è±¡ã® ç¢ºçŽ‡ã‚’åˆ©ç”¨ã—ã¦æœªæ¥ã‚’äºˆæ¸¬ã™ã‚‹æ‰‹æ³•ã§ã™ï¼Žãã®ãŸã‚ï¼Œç›´æ„Ÿçš„ã«ã¯ãƒ¦ãƒ¼ã‚¶ã”ã¨ã® æœ€é©åŒ–
mzp 2006/02/11
*ãƒ—ãƒã‚°ãƒ©ãƒ å‚è€ƒ

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ãƒªãƒ³ã‚¯
1