soi.ch
Training | Swiss Olympiad in Informatics
http://www.soi.ch/train
Swiss Olympiad in Informatics. You can find valuable information at the following places:. We provide an overview of the most important C concepts used in olympaid tasks. The document can be found here [german] soi cpp tutorial.pdf. The code snippets can be downloaded separately soi cpp tutorial code.tar.gz. A list of often-used algorithms in SOI-competitions can be found here soi algorithms.pdf. In order to get familiar with the algorithms and datastructures involved, we recommend these sites:.
fheadblog.blogspot.com
FHead's blog: August 2009
http://fheadblog.blogspot.com/2009_08_01_archive.html
FHead．Book 4．Chapter 6．Dreams. Thursday, August 20, 2009. Some advice to computer programming. Computer is more and more important nowadays. Even if you're not doing work directly related to computers, it's still useful to have the tool ready. It speeds up a lot of things. Before you dig into programming, these are a few general things that I wish I had known when I started learning how to program, and I want to share with you. Int x = 10; / x and y are two integers. Int y = 35;. This way you won't get a...
kisakoodaus.fi
kisakoodaus.fi
http://www.kisakoodaus.fi/netti.php
chhung6.blogspot.com
real: 十月 2010
http://chhung6.blogspot.com/2010_10_01_archive.html
SRM 486 - Live. 今次係 300 450 1000. 一打開, 睇完題目 考慮呢題既分數. 令我覺得, google 下會搵到答案. 睇完題意, 有 linearity of expectation DP 感覺). 點知搵黎搵去, 都只係搵到 theoratical expected number of exchanges. 又研究下 Case 3 = 144 / 13 究竟有咩玄機. 又戳下, 答案同 number of inversion 有乜關係. 諗下 google 下. 又諗下. 又 google 下. Member SRM 485 - 被MO屈機. Rush 250 的速度居然比以前了，為甚麼呢？ 是 based on 一些 observation. 但因為有 odd/even 的限制，我的算法才正確. 500 全間 904 都沒有人能做出來. 不過顯然對於 W, H = 50. Waihon 則直覺認為暴搜能過，因為 RectangleAvoiding 條件苛刻. 郭 智 亮 說 ﹕ 「 一 個 人 『 叻 』 沒. 合 團 隊 的 運 作 。 」.
chhung6.blogspot.com
real: 隨筆 2012-08-21 - 近(?)況
http://chhung6.blogspot.com/2012/08/2012-08-21.html
隨筆 2012-08-21 - 近(? 快封塵了 其實先前寫左好幾篇, 最後冇submit. 過去一年 (2011夏 - 2012夏). 學術 / ACM / 工作方面, 我一直. 主要係 engineering work - tune 結果, 加速, visualize 結果. 同埋寫比較麻煩既 technical report, 仲有 presentation. 近日收到通知：終於有一份 journal paper accept 左! 雖然已經退役, 但有時間, 都會去睇/講下 training. 轉營玩 online contest, 似乎都打得 OK密 (Topcoder, Codeforces, InterviewStreet), 近一兩個月少咗. 最苦惱既問題 - 搵/做咩工好, 最尾搞到年頭先開始搵. 用懶 乜都報下既心態, 報一啲就腳既工 - 嚟中大搞 recruitment talk, 而人工又 相對. Ok 既公司 (u know, 香港始終重視金融). 我冇乜考慮過出國. 但, 喺師兄/朋友/朋輩極力鼓勵下, 試. 然後, 冇諗過. 會有 offer.
chhung6.blogspot.com
real: 九月 2010
http://chhung6.blogspot.com/2010_09_01_archive.html
今年的 Team Formation 總算塵埃落定. 還是在趕 11月中的 Conference Deadline. SRM 483 - 0分 悲劇. 160;期待已久的 Rating 大跌的時機終於來了. 便緊張得錯誤開啟了 500. - -. 看完 250 是一道比較直接的整數除法 (好似係). 稍為冷靜以後, 總算把 250 慢慢的 (202.xx) 搞定. 然後開 500. 想了又想, 想出了算法: DP bit pattern. 中段開了 Division Summary 看. 很多人提交了 900. 有很多甚至時 800 以一的提交. 但自己把心一橫, 堅持做 500. 比賽臨終時, 才發現 Transition 錯了. 不能只 consider 上一格 array element. 再看看 Division Summary 及 Room Summary. 悲劇了 大量 900 的 Submission. 現在的 Challenge Phase, 絕大部份的 900 依然屹立不倒. 2010-09-25 Team Training - Shanghai 2009. 題C 和 題D 的難度.
chhung6.blogspot.com
real: [溫故知新,數論] Prmitive Root modulo n
http://chhung6.blogspot.com/2011/07/prmitive-root.html
溫故知新,數論] Prmitive Root modulo n. 以下定義/定理或者未夠嚴僅. 數學人請見諒.). Theorem 1 (Euler's Totient Theorem). 8801; 1 (mod n. Definition 1 (Multiplicative Order). 的 (multiplicative) order modulo n. 8801; 1 (mod n. 以下為 (hopefully) 較直觀的解說：. 的 order 就是 { x. Definition 2 (Primitive Root). 的 order 是 Φ( n. Corollary 1 (Verifying a primitive root). 8660; 對於每個質因數 p. 65292; 有 g. 8802; 1 (mod n. 如何找出(最小的)一個 primitive root modulo n. 就是「頹試」：. Algorithm 1 (Finding the least primitive root). G EndIf. 12288; EndFor. Mod m) / 利用.
cscircles.cemc.uwaterloo.ca
Resources | Computer Science Circles
http://cscircles.cemc.uwaterloo.ca/resources
Skip to primary content. Skip to secondary content. 3: Comments, Quotes. 9: Else, And, Or, Not. 15C: Caesar's JVTIVK JRCRU IVTZGV. If you haven't seen it already, check the Python 3 online index. This is the method that we use for searching the official documentation whenever we're confused. What Should I Do Next? There are a lot of ways to proceed once you're done with CS Circles, depending on what you'd like to focus on next. In Python and in-browser, more advanced material. In Python, more interactive.
chhung6.blogspot.com
real: 三月 2011
http://chhung6.blogspot.com/2011_03_01_archive.html
2011-03-23 Team Training - World Finals 2004. HKG Time - 1900 to 2400. 啱啱尋晚係 research deadline 後. 今次做 World Finals 2004. 標籤： Team Training. SRM 500 - Live. 250 我花了 45 分鐘才通過 sample. 預期會有大量 fail system test 出現. X, x 1) × [y, y 1). 但感覺 500 若能通過 sample. 比起 250，應該有更大機會通過 system test. Petr 等一眾高手完成了全部 3 題. Rng 58 單做 1000 Rank 6th. Rank 4th in room → 沒錢分 sosad. 本人認為，最後討論的 三角形面積方法 的解相當優美. 中學時期，我們都學過用聯立方程組求 線 / 線交點：. 用代入法 (substitution) 或消元法 (elimination) 求出的一般解. 在 x系數 = 0 或 y系數 = 0 的情況需要特別分開處理. 判斷交點 Q 是否在 線段.
chhung6.blogspot.com
real: 十一月 2010
http://chhung6.blogspot.com/2010_11_01_archive.html
2010-11-28 Team Training - Dhaka 2010 - 晨早特訓. HKG Time - 0930 to 1330. 是次 Training CTLi 狀態大勇. 三小時多便 AC 6題 Champ. 最後還在 247 min 做好第 8 題. 標籤： Team Training. 隨筆 2010-11-10 - 忙. 電腦 warn 我 virtual memory too low. 我人腦的 virtual memory 都 too low 了. 隨筆 2010-11-02 - 忙. 比當年 year 3 做 FYP 時更忙. Year 2 core courses x N 當然很忙, 但 year 3 sem 2 做 FYP 時更忙). 怒 cap data＋怒 gen result. 空著肚子 cap data 很難熬. 其中 Pre-processing 要用到 Photoshop. 可恨是 ＿＿ 的 Photoshop 未能 Batch process 所需的工序. 而 Runtime 比較長. 而 Data 又很多. 只好 parallel 三部機一起 process.
