[USACO] sec2-1 Ordered_Fractions

這一題直接枚舉 先判斷分子分母是否互質再記錄

---------------------------------------------------
USER: Lee Pu [leepupu1]
TASK: frac1
LANG: C++

Compiling...
Compile: OK

Executing...
Test 1: TEST OK [0.000 secs, 3252 KB]
Test 2: TEST OK [0.000 secs, 3252 KB]
Test 3: TEST OK [0.000 secs, 3252 KB]
Test 4: TEST OK [0.000 secs, 3252 KB]
Test 5: TEST OK [0.000 secs, 3252 KB]
Test 6: TEST OK [0.011 secs, 3256 KB]
Test 7: TEST OK [0.011 secs, 3256 KB]
Test 8: TEST OK [0.032 secs, 3256 KB]
Test 9: TEST OK [0.086 secs, 3252 KB]
Test 10: TEST OK [0.097 secs, 3256 KB]
Test 11: TEST OK [0.313 secs, 3252 KB]

All tests OK.
YOUR PROGRAM ('frac1') WORKED FIRST TIME! That's fantastic
-- and a rare thing. Please accept these special automated
congratulations.

[USACO] sec2-1 The_Castle

第二章第一題

2-1是基本圖論 而這一題則是Flood Fill

牆壁紀錄運用到位元處理 另外值得一題的是範圍面積利用指標指向面積紀錄陣列
---------------------
USER: Lee Pu [leepupu1]
TASK: castle
LANG: C++

Compiling...
Compile: OK

Executing...
Test 1: TEST OK [0.000 secs, 3216 KB]
Test 2: TEST OK [0.000 secs, 3216 KB]
Test 3: TEST OK [0.000 secs, 3216 KB]
Test 4: TEST OK [0.000 secs, 3216 KB]
Test 5: TEST OK [0.000 secs, 3216 KB]
Test 6: TEST OK [0.000 secs, 3216 KB]
Test 7: TEST OK [0.000 secs, 3216 KB]
Test 8: TEST OK [0.000 secs, 3216 KB]

All tests OK.
Your program ('castle') produced all correct answers! This is your
submission #5 for this problem. Congratulations!

The Code

[USACO] sec1-5_Checker_Challenge

哈!~好事成雙 今天又順利的第一次送出即AC

CH1 終於結束了 邁出下一步吧~
----------------------------------------------------------------
這題使用了神奇的位元運算 利用某位元=1記錄無法放皇后的位置

若是紀錄左斜線 每次遞迴下去時<<1

相反的 弱勢紀錄又斜線 每次遞迴便>>1

另外 p = pos & (~pos + 1); 這行是把從右邊數過來第一個1左邊的位元都清為0
----------------------------------------------------------------
USER: Lee Pu [leepupu1]
TASK: checker
LANG: C++

Compiling...
Compile: OK

Executing...
Test 1: TEST OK [0.000 secs, 3172 KB]
Test 2: TEST OK [0.000 secs, 3172 KB]
Test 3: TEST OK [0.000 secs, 3172 KB]
Test 4: TEST OK [0.000 secs, 3172 KB]
Test 5: TEST OK [0.000 secs, 3172 KB]
Test 6: TEST OK [0.011 secs, 3172 KB]
Test 7: TEST OK [0.054 secs, 3172 KB]
Test 8: TEST OK [0.119 secs, 3172 KB]

All tests OK.
YOUR PROGRAM ('checker') WORKED FIRST TIME! That's fantastic
-- and a rare thing. Please accept these special automated
congratulations.

Here are the test data inputs:

------- test 1 ----
6
------- test 2 ----
7
------- test 3 ----
8
------- test 4 ----
9
------- test 5 ----
10
------- test 6 ----
11
------- test 7 ----
12
------- test 8 ----
13
Keep up the good work!
Thanks for your submission!


The Code

[USACO] sec1-5_Superprime_Rib

又是玩弄質數題

簡而言之就是要你找從左邊數過來1位 2位 3位 ...都是質數的數字

ex:
7 是質數
71 是質數
719 是質數
7193 也是質數

so 7193符合條件


難得第一次送出就AC

USER: Lee Pu [leepupu1]
TASK: sprime
LANG: C++

Compiling...
Compile: OK

Executing...
Test 1: TEST OK [0.000 secs, 3184 KB]
Test 2: TEST OK [0.000 secs, 3184 KB]
Test 3: TEST OK [0.000 secs, 3184 KB]
Test 4: TEST OK [0.000 secs, 3184 KB]
Test 5: TEST OK [0.000 secs, 3184 KB]

All tests OK.
YOUR PROGRAM ('sprime') WORKED FIRST TIME! That's fantastic
-- and a rare thing. Please accept these special automated
congratulations.

Here are the test data inputs:

------- test 1 ----
4
------- test 2 ----
5
------- test 3 ----
6
------- test 4 ----
7
------- test 5 ----
8
Keep up the good work!
Thanks for your submission!

The Code

[USACO] sec_1-4_The Clocks

過年前來一帖~

有夠詭異的題目

乍看之下用BFS暴搜 DEBUG DE了3小時= =(其實好像還是可以 只是沒找到正確的剪枝而已)

後來想一想(查一查..)由於每個方法轉4次以上就會重複 SO 3^7爆破摟
-----------------------------------------------------------------
試過許多方法 一開始原本要試TBFS(雙向廣度優先搜尋) 後來因為不熟悉用法而且題目要求解路徑

想說太麻煩而改回單純BFS 但又遭遇了一開始提到的問題(重複判斷一直出錯 導致錯誤解)

後來試了下DFS 但好像方法錯了 一直試一直試....

最後只好爬文 剛好看到發人深省的一文

"順序不影響結果 & 鎂種發法超過4次等於沒轉"

怎麼一開始會沒想到呢？ 應該是太執著於DEBUG 而沒有從頭到尾重新檢視題目吧 要以此為鑑阿
-----------------------------------------------------------------
USER: Lee Pu [leepupu1]
TASK: clocks
LANG: C++

Compiling...
Compile: OK

Executing...
Test 1: TEST OK [0.000 secs, 3176 KB]
Test 2: TEST OK [0.000 secs, 3176 KB]
Test 3: TEST OK [0.076 secs, 3176 KB]
Test 4: TEST OK [0.022 secs, 3176 KB]
Test 5: TEST OK [0.054 secs, 3176 KB]
Test 6: TEST OK [0.076 secs, 3176 KB]
Test 7: TEST OK [0.086 secs, 3176 KB]
Test 8: TEST OK [0.054 secs, 3176 KB]
Test 9: TEST OK [0.076 secs, 3176 KB]

All tests OK.
Your program ('clocks') produced all correct answers! This is your
submission #14 for this problem. Congratulations!

Here are the test data inputs:

------- test 1 ----
9 9 12
6 6 6
6 3 6
------- test 2 ----
12 9 12
9 9 9
12 9 12
------- test 3 ----
6 9 3
3 3 9
12 12 12
------- test 4 ----
9 3 9
9 9 9
9 9 9
------- test 5 ----
6 12 12
12 12 12
12 12 12
------- test 6 ----
3 12 9
6 6 6
12 12 12
------- test 7 ----
12 3 3
3 6 6
12 3 6
------- test 8 ----
12 3 9
9 12 12
3 6 9
------- test 9 ----
9 12 9
12 3 12
9 12 9
Keep up the good work!
Thanks for your submission!

CODE

Ubuntu PHP 加裝curl

網路爬文爬了兩小時 一直出現相容錯誤

乾脆直接降級吧

sudo aptitude install php5-curl

夜...

深夜 (對我來說.

望著滿桌滿櫃的書 心思卻已跟著一首接著一首的歌漂蕩走了

難得夜深人靜 好好沈澱一下自己..

發呆一夜吧！