2009-02-01ãã1ã¶æéã®è¨äºä¸è¦§
206 Concealed Square Problem 206 - Project Euler å ¨æ¢ç´¢ãã¦ã¯èº«ãèããªãã®ã§ãããã工夫ãã¾ããããã¨ããåé¡ãªãã§ããããï¼
205 Dice Game Problem 206 - Project Euler ãµã¤ã³ãéã³ã
203 Squarefree Binomial Coefficients Problem 203 - Project Euler ã¨ãããããé©å½ã«ã¤ãã£ããããã®ã¾ã¾è§£ãã¦ãã¾ã£ãã
202 Laserbeam Problem 202 - Project Euler é¡ã®åå°ã¨èããããä¸è§å½¢ããããã並ã¹ã¦ã¿ãããªãã®ãã人ã®å¸¸ã ããããã¨ãæ ¼åç¹ãããã¤ãã§ããããCãåå°ãã¦ã§ããã®ç¹ãè¦åçã«ä¸¦ãã§ããã®ãåããã è¦ã¯ãããæ°ã¨äºãã«ç´ ãªæ°ãããç¯å²ã§â¦
Problem 207 - Project Euler ãã®åé¡ã¯ãããã¿ã
Dropbox ã¦ã§ããµã¼ãã¹ã®ã²ã¨ã¤ã Windows, Mac, Linux ã©ãããã§ã使ããã ãªã³ã©ã³ã§ããã¯ã¢ãããåæãå·®åæ´æ°ãå ±æãã§ããã ã¾ãã§ããã¼ã«ã«ã§ãã¡ã¤ã«ãæ±ã£ã¦ãããã®ããã ããã¯ä¾¿å©ã Ubuntu 8.10ã§ã¯ãhttp://www.getdropbox.com/ã«æ¸â¦
201 Subsets with a unique sum Problem 201 - Project Euler ç¹å¥ãªéåã ãããè³¢ã解æ³ãããã®ãã¨ãæã£ããã©ã æãã¤ããªãã£ãã ãããããåé¡ã¯DPãã»ã¨ãã©ã åé¡ã¯ã©ãDPãæ§æãããã
200 Find the 200th prime-proof sqube containing the contiguous sub-string "200" Problem 200 - Project Euler 2ã5ãå«ã¾ãã¦ããã°ãprime-proofã ã¨ãããã¨ã¯ããã«åããã ã¤ã¾ããprime-proofã®ååæ¡ä»¶ãæ°ã«ãªãã®ã¯å¿ è¦æ¡ä»¶ã ãâ¦
1.6ã§æ§ã ãªæ©è½ã追å ããããããªã®ã§ã1.6ã使ãããã ããããããã±ã¼ã¸ã¯ãªãã ããã°ã£ã¦ãã½ã¼ã¹ãããã«ããããåºæ¬çã«ã¯âã®ã¨ããã«å°å ¥ããã http://www.int.otaru-uc.ac.jp/lyx-howto ã¤ã³ã¹ãã¼ã« ããã±ã¼ã¸ã§ã¤ã³ã¹ãã¼ã«ãããã½ã¼ã¹ãâ¦
æ¯åè¨å®ãåãããªããªãã®ã§ãã¡ã¢ãã¦ããã # The following lines were added by compinstall # Time-stamp:<2009-02-24 20:33:40> zstyle :compinstall filename '/home/toru/.zshrc' #zstyle ':completion:*' list-colors di=34 fi=0 zstyle ':compleâ¦
Haskellããªãã¨ãã¯ãã¾ããªããï¼ ã¨ãããã¨ã§ã % sudo apt-get install ghc haskell-mode.emacsã« (load "/usr/share/emacs/site-lisp/haskell-mode/haskell-site-file")
ãã¼ãã¼ãã¬ã¤ã¢ã¦ãã®ãªãã·ã§ã³ã§ Caps Lockãããä¸ã¤ã®Ctrlã«ãã ã¨ããã¨ããããã«ãCaps Lock 㯠Ctrl ã«ãªãã ããããã©ããããã®Caps Lockãå®ã¯ã¾ã ãCaps Lock ã®æ©è½ããã£ã¦ããã ã¤ã¾ããCaps Lock -> Caps Lock + Ctrl ã¨ããå¤æ´ããâ¦
Texã¯å¿ è¦ã æ¥æ¬èªçã»ããã¢ãããã«ãããå ¥ããããæ°é ãªã®ã§ãããã£ã¬ã³ã¸ãã¦ã¿ãã Tex以å¤ã«ã便å©ãããªãã®ãããã®ã§ãããã«ããã§ãã¯ãå ¥ããã çµæãtexãã¡ã¤ã«ãEUCã«ããã°ãæ®éã«ä½¿ããã ãã ãxdviã®ãã©ã³ããã¿ã«ããã®ã§ã /etcâ¦
ç¾å¨ãè¨å®ä¸ã ã¨ãããããubuntu 8.10 ãå ¥ããã è¨å®ã¡ã¢ã ãã£ã¹ãã¬ã¤ã®è¨å® ãã£ã¹ãã¬ã¤ãé常ã«è¦ã«ããã£ãã xorg.confãå¤æ´ãã¦ããã£ã¹ãã¬ã¤è¨å®ã®ãªãã¬ãã·ã¥ã¬ã¼ããï¼ï¼ããï¼ï¼ã«å¤æ´ãããã è¦ããããªã£ãã Section "Device" Idenâ¦
Problem 198 - Project Euler ã¡ãã£ã¨ãããã¹ã§ããï¼åºæ¬ã¯éä¸çµéã§è¿°ã¹ããã¨ï¼ 以ä¸ã³ã¼ãï¼
ä»æ¥ï¼ä¸èª¿ã®åå ãæ¢ãã¹ãï¼PCãéãã¦ã¿ãï¼ ãããï¼ç®ã«ã¤ãç°å¸¸ã¯ãªãã£ãï¼ ã¾ãï¼ç´ 人ã§ãããï¼åãããããªãï¼ãï¼å¤åï¼æ°ããPCãè²·ããã¨ã«ãªãã®ã ããï¼ ãããï¼Vistaã¯è©å¤ãè¯ããªãï¼ ã¨ãã£ã¦ï¼Linuxã«ä¹ããããã»ã©ã®æ ¹æ°ã¯ãªãï¼ ãâ¦
199 Iterative Circle Packing Problem 199 - Project Euler Apollonian gasket ã£ã¦ãããããã§ãï¼ãã©ã¯ã¿ã«ï¼ Apollonian gasket - Wikipedia åé¡ã¯3ã¤ã®åã«æ¥ããåã®åå¾ãæ±ãããã¨ã ã¨æãã¾ããâ¦
Problem 198 - Project Euler ã¾ã ï¼è§£ãã¦ãã¾ãããï¼èããã¾ã¨ããããã«ï¼ã¡ã¢ï¼ (ã¤ã¾ãï¼ééã£ããã¨ãæ¸ãã¦ããå¯è½æ§ã¢ãª) How many ambiguous numbers x = p/q, 0 x 1/100, are there whose denominator q does not exceed 10^8? ã¾ãç®ã«ã¤ãã®â¦
ãªãã ããã ã§ï¼çµå±PCã®ä¸è¯ã®èª¿æ»ã¯ã§ããï¼ ææ¥ã¯ã¾ã¨ã¾ã£ãæéãåããªãããï¼é£ãããï¼
ã¾ãï¼PCãè½ã¡ãï¼ ã©ãããï¼CPUã«è² è·ããããã¨ï¼è½ã¡ãããã ï¼ ææ¥å°ã調ã¹ã¦ã¿ããï¼
ãã£ã¨ï¼åæ¥è«æã®çºè¡¨çµäºããï¼ å®ç§ãªãã¬ã¼ã³ã§ã¯ãªãã£ãï¼ è³ªåã«ãã¾ããããããããªãã£ããï¼èª¬æãåããã«ããã£ãç®æãããã¨æãï¼ ã¾ã ã¾ã ï¼ã§ããï¼ ãããï¼å½é¢ã®ãã«ãã®ãããªãã®çµã£ãï¼ å°ãæ°ã楽ã«ãªã£ãï¼
便å©ããï¼ ãã¼ã ãã¼ã¸ç§»è»¢ã®ãç¥ãã - Yahoo!ã¸ãªã·ãã£ã¼ãº
dviout ã§ããã«ã¯ãªãã¯âemacs ã§è©²å½ç®æã«é£ã¶ emacs ã§dvi ããã¬ãã¥ã¼âdviout ã§è©²å½ç®æãéã ã¾ãï¼åæã¨ãã¦ï¼platexã«-src-specialã®ãªãã·ã§ã³ãã¤ãã¦ã³ã³ãã¤ã«ï¼ 詳ããã¯é©å½ãªURLãããããããï¼ è¿½è¨ æç¨ã ã¨æãããURL http://www.nnâ¦
ãªãï¼
Inkscapeã§latexã®æ°å¼ãå ¥åï¼ä¾¿å©ï¼ ãã¦ã³ãã¼ã http://www.elisanet.fi/ptvirtan/software/textext/ windowsã§åããã«ã¯å°ãä½æ¥ãå¿ è¦ï¼æ å ±ã¯ä»¥ä¸ï¼ http://www.empitsu.com/wp/?p=411 ä½è ã»çè ã«æè¬ï¼ ä½ã£ãæ°å¼ãé¸æãã¦ï¼ã¨ãã§ã¯ãâTex Texâ¦
Mathematical Illustrations ã¨ãï¼ Postscript language tutorial and cookbook. ã¨ãï¼ æéãã§ãããè¦ã¦ã¿ããï¼ ã¨ããã£ããã©ï¼Asymptoteãªãã¦ã©ããªãã ããï¼ PostScriptã¯å¤ãã¨ããæ°ãããï¼ Asymptote - TeX Wiki
ã¨ããããï¼è³æãã¤ãã£ãï¼ ã¡ãã£ã¨ï¼ç·´ç¿ãã¦ã¿ãï¼ æ¡ã®å®ï¼æéã足ããªã⦠ã©ãããåãï¼ ãããããï¼éãæ»ããã«ï¼ããã¹ããï¼
åæ¥è«æã®çºè¡¨ã®æºåããã¦ããï¼ ãããï¼ãããé£ããï¼ ãªã«ãï¼é£ãããæ´çãã¦ã¿ãï¼ æã¡æéãçãã(çºè¡¨8åï¼è³ªå8å) ç 究ã®èæ¯ããï¼å 容ï¼çµè«ã¨çºè¡¨ãããã¨ãå¤ã ä½ãè¨ãã¹ããï¼ã©ãè¨ãã°ä¼ããã å³å¯ã«ãããã¨ããã¨æéããªã ã¤ã¾â¦
197 Investigating the behaviour of a recursively defined sequence Problem 197 - Project Euler ã©ãã循ç°ããã®ã ããã¨æãï¼ã¯ããã®1000é ãgnuplotã§ããããï¼ å®ã¯ããã«ï¼åæãã¦ããï¼ åæã®ããããåç´ï¼ f :: Double -> Double f x = letâ¦
196 Prime triplets Problem 196 - Project Euler ç´ æ°é¢ä¿ã®åé¡ï¼ code (haskell) ã¨ããããï¼ãã¤ã¼ããªãã®ï¼ å®è¡æéã¯isPrime'ã®å¹çã«ä¾åï¼ ã¤ã¾ãï¼é ãï¼ 1000ç§ãããã£ãï¼ import Data.Maybe (mapMaybe) import Number (isPrime') t :: (Inteâ¦