Concurrent Clean : [quiz] リストè¦ç´ ã®æ£è¦åŒ–(2) - lethevert is a programmer
http://karetta.jp/article/blog/oneline/008668 ãã‚Œã¯ãã†ã¨ã€ã“ã‚Œã¯ã‚„ã¯ã‚Šç¶™ç¶šã‚’使ã£ã¦è§£ãæ–¹ãŒã„ã„ã¨æ€ã†ã®ã§ã™ã‚ˆã（schemeãªã®ã§ï¼‰ã€‚ maxInt =: 0x7fffffff ::Tree a = Node a [Tree a] norm t = let ([[t2:_]:_],_) = norm_t t end maxInt in t2 where end n = ([[],[]],n) norm_t (Node i ts) cont n = let ([ts2,ts3:tss4],m) = norm_ts ts cont (min i n) in ([[Node (i/m) ts2:ts3]:tss4],m) norm_ts [] cont n = let (ts2,m) = cont n in ([[]:ts2],m) norm_ts
![Concurrent Clean : [quiz] リストè¦ç´ ã®æ£è¦åŒ–(2) - lethevert is a programmer](https://cdn-ak-scissors.b.st-hatena.com/image/square/883a001c38c2c755af41435f0cccf3425ad0dcc9/height=288;version=1;width=512/https%3A%2F%2Fogimage.blog.st-hatena.com%2F17680117127034250673%2F17680117127034347049%2F1555373390)
トラãƒãƒ¼ã‚¹ã‚’一回ã«ã—ã¦ã‚‚ - lethevert is a programmer
http://karetta.jp/article/blog/oneline/008668 http://konoe.lab2.kuis.kyoto-u.ac.jp/~hanatani/tdiary/?date=20061206 計算é‡ãŒæ¸›ã‚‹ã¨ã„ã†ã‚ã‘ã§ã¯ãªã„ã‚“ã ãªã€‚ 逆ã«ã€æœ«å°¾å†å¸°ã§ãªããªã‚‹ã›ã„ã§ã€ç©ºé–“計算é‡ãŒå¢—ãˆã‚‹ã¨ã„ã†ã“ã¨ã‚‚ãªã„ã‚ã‘ã§ã¯ãªã‹ã£ãŸã‚Šã€‚ - http://haskell.g.hatena.ne.jp/jmk/20061206/1165380658 ã¨ã“ã‚ã§ã€ãƒ¢ãƒŠãƒ‰ã‚‚ã“ã†ãªã£ã¦ã„ã‚‹ã¨ä¿„然ã‹ã£ã“ã„ã„ã§ã™ã（何ãŒï¼Ÿï¼‰ - ãã†ã‹ã€ã‚ã‹ã£ãŸã€‚ tnorm t = let (r, m) = runWriter iteration in runReader r (getMin m) where iteration = unComp $ traverse (Comp . fmap tr
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚了日を2020å¹´1月31æ—¥(金)ã«æ±ºå®šã—ã¾ã—㟠- ã¯ã¦ãªã®å‘ŠçŸ¥
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚了日を2020å¹´1月31æ—¥(金)ã«æ±ºå®šã—ã¾ã—㟠以下ã®ã‚¨ãƒ³ãƒˆãƒªã®é€šã‚Šã€ä»Šå¹´æœ«ã‚’目処ã«ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—を終了予定ã§ã‚る旨をãŠçŸ¥ã‚‰ã›ã—ã¦ãŠã‚Šã¾ã—ãŸã€‚ 2019年末を目処ã«ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®æ供を終了ã™ã‚‹äºˆå®šã§ã™ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—日記 ã“ã®ãŸã³ã€æ£å¼ã«çµ‚了日を決定ã„ãŸã—ã¾ã—ãŸã®ã§ã€ä»¥ä¸‹ã®é€šã‚Šã”確èªãã ã•ã„。 終了日: 2020å¹´1月31æ—¥(金) エクスãƒãƒ¼ãƒˆå¸Œæœ›ç”³è«‹æœŸé™:2020å¹´1月31æ—¥(金) 終了日以é™ã¯ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®é–²è¦§ãŠã‚ˆã³æŠ•ç¨¿ã¯è¡Œãˆã¾ã›ã‚“。日記ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãŒå¿…è¦ãªæ–¹ã¯ä»¥ä¸‹ã®è¨˜äº‹ã«ã—ãŸãŒã£ã¦æ‰‹ç¶šãã‚’ã—ã¦ãã ã•ã„。 ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã«æŠ•ç¨¿ã•ã‚ŒãŸæ—¥è¨˜ãƒ‡ãƒ¼ã‚¿ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆã«ã¤ã„㦠- ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—日記 ã”利用ã®ã¿ãªã•ã¾ã«ã¯ã”迷惑をãŠã‹ã‘ã„ãŸã—ã¾ã™ãŒã€ã©ã†ãžã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚ 2020-06-25 追記 ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—日記ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãƒ‡ãƒ¼ã‚¿ã¯2020å¹´2月28
çµåŸŽæµ©ã®ã¯ã¦ãªæ—¥è¨˜ オーãƒãƒ¼ãƒ•ãƒãƒ¼ãƒ»ã‚¯ã‚¤ã‚º
クイズ a, bã¯32ビット符å·ä»˜ãæ•´æ•°ã§ã€a > 0, b > 0ã¨ã™ã‚‹ã€‚a + b < 0ã¨ãªã‚‹ã‚ˆã†ãªa, bã®çµ„ã¿åˆã‚ã›ã¯å…¨éƒ¨ã§ä½•é€šã‚Šã‚ã‚‹ã‹ã€‚ ãŸã¨ãˆã°ã€(a, b) = (1, 2)ã¨(2, 1)ã¯åˆ¥ã®çµ„ã¿åˆã‚ã›ã¨ã—ã¦ã‚«ã‚¦ãƒ³ãƒˆã™ã‚‹ã“ã¨ã€‚ Enjoy! 追記：a + bã‚‚32ビット符å·ä»˜ãæ•´æ•°ã«ãªã‚‹ã¨è€ƒãˆã¦ãã ã•ã„。è¦ã¯æ™®é€šã®(?)コンピュータã§32ビットã®intã®è¶³ã—ç®—ã‚’ã—ãŸã¨ã€‚è² æ•°ã¯2ã®è£œæ•°è¡¨ç¾ã§ã€‚
Welcome To PKU JudgeOnline
Problem Set is the place where you can find large amount of problems from different programming contests.Online Judge System allows you to test your solution for every problem. First of all, read carefully Frequently Asked Questions. Then, choose a problem, solve it and submit your solution. If you want to publish your problems or setup your own online contest, just write us. Peking University ICP
コード圧縮 - 純粋関数型雑記帳
コードをçŸãã™ã‚‹ã®ã£ã¦æ¥½ã—ã„ã§ã™ã‚ˆã？ http://acm.pku.edu.cn/JudgeOnline/showproblem?problem_id=1145 今日ã¯ãªã‚“ã¨ãªãã“ã‚Œã‚’é ‘å¼µã£ã¦ã¿ãŸã€‚ å•é¡Œã¯ã€ãƒ„リーをパーズã—ã¦ã€ ルートã‹ã‚‰ãƒªãƒ¼ãƒ•ã¾ã§ã®æ•°å—ã®å’ŒãŒä¸Žãˆã‚‰ã‚ŒãŸæ•°ã«ãªã‚‹ãƒ‘ス㌠å˜åœ¨ã™ã‚‹ã‹ã©ã†ã‹èª¿ã¹ã‚‹ã¨ã„ã†ã‚‚ã®ã€‚ ã•ã¦ã€ã“ã‚ŒãŒ208Byteã«ãªã‚Šã¾ã—ãŸã€‚ http://acm.pku.edu.cn/JudgeOnline/problemstatus?problem_id=1145&orderby=clen&language=-1 アルゴリズム的ã«ã‚‚ã†ã¡ã‚‡ã£ã¨ãŒã‚“ã°ã‚Œã°200Byteã‚’ 切れるよã†ãªæ°—ãŒã—ãªã„ã§ã‚‚ãªã„ã§ã™ãŒã€ãªã‹ãªã‹é›£ã—ã„ã§ã™ã。 誰ã‹ç§ã®ä»£ã‚ã‚Šã«200Byte切ã£ã¦ãã ã•ã„。 ã„ã‚„ã¾ãã€åˆ‡ã£ã¦ãã‚Œãªãã¦ã‚‚ã„ã„ã§ã™ã‘ã©ã€‚
1
ãŠçŸ¥ã‚‰ã›
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
mathematical oddity, the d(x) function | finalcog
Build for everyone - Google Careers
Karetta|[Gauche] リストè¦ç´ ã®æ£è¦åŒ–
Karetta|[quiz] リストè¦ç´ ã®æ£è¦åŒ–
http://homepage3.nifty.com/iromono/PhysTips/fall.html
{{#tags}}- {{label}}
{{/tags}}