Nonogram 比賽規則

總共有 1000 題 25x25 的 nonogram 題目，比賽時間為 2 小時。
排名根據解出正確的題數決定，題數相同再比時間，時間少的獲勝。

1. 題目是由 boardgen.py 產生
   - 黑格的比例依序由 0.5 到 0.35 (越後面的題目大致上會越難)
   - 亂數種子由所有參賽者共同決定
2. input/output 格式
   - 每一題的題號之前都有一個 $，下一行開始就是題目/答案
   - 以 25x25 舉例，每題有 50 行提示，前 25 行提示是上方區塊由上往下的提示，後 25 行的提示是左方區塊由左到右的提示
   - 答案以 25x25 的矩陣表示，0 的地方代表沒有塗黑，1 代表有塗黑
   - 所有數字以 TAB 隔開
3. 解題
   - 會統一找一台機器，在上面跑所有的程式，每支程式只能使用單核心
     機器規格待報名截止，參賽隊伍數量確定之後再通知參賽者
   - 參賽者提供程式的可執行檔
   - 解題時要依照順序解，不可以跳過
   - 如果題目有多解，只要找出其中一組解即可
   - 程式必須要記錄自己的整體解題時間
------------------------------------------------------------------------------------------------------------------------
Nonogram rules

The input file consists of 1000 nonogram puzzles with size 25x25. Time limitation is 2 hours. 
The rank is determined by the number of correctly solved puzzles. 
If two groups have the same numbers of correctly solved puzzles, the rank is determined by the time for solving puzzles. 

1. The puzzles are generated by boardgen.py. 
   - The ratio of black cell ranges from 0.5 to 0.35 in order. 
     (This means that the difficulty of puzzles is roughly increasing in input order.)
   - The random seed is determined by all participants. 
2. Format of input and output
   - There is a symbol "$" before the puzzle number. The description/solution of the puzzle starts from the next line. 
   - For 25x25 nonogram puzzles, there are 50 lines of clues (puzzle description). 
     The former 25 are clues at the top end from up to down. The later 25 are clues at the left end from left to right. 
   - The solutions are stored by 25x25 matrices. 
     A "0" means to leave a cell blank while a "1" means to color a cell black. 
   - All the numbers of clues and solutions are separated by TAB. 
3. Solving
   - All of the programs will run on the same machine. Each program is only allowed to use single CPU core. 
     The specification of machine will be announced after registration deadline. 
   - Participants provide their executable programs. 
   - Each program solves these puzzles in order (cannot skip). 
   - For the puzzles with multiple solutions, the program only needs to generate 1 solution. 
   - Each program needs to record total time to solve the puzzles.