[USACO] sec2-1_Hamming_Codes

sec2-1結束囉~

研究A* 研究到頭暈目眩 想說解題USACO

DFS題 + 位元運算

手感不錯 又是一次過

繼續前進吧~~~

[USACO] sec2-1 Healthy_Holsteins

BFS暴搜 第一個找到的即是符合條件的答案

利用位元儲存使用的飼料
--------------------------------------------------
USER: Lee Pu [leepupu1]
TASK: holstein
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.000 secs, 3176 KB]
Test 4: TEST OK [0.000 secs, 3176 KB]
Test 5: TEST OK [0.000 secs, 3176 KB]
Test 6: TEST OK [0.000 secs, 3176 KB]
Test 7: TEST OK [0.000 secs, 3176 KB]
Test 8: TEST OK [0.011 secs, 3176 KB]
Test 9: TEST OK [0.000 secs, 3176 KB]
Test 10: TEST OK [0.054 secs, 3176 KB]

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

The Code

[USACO] sec-2-1_Sorting_a_Three-Valued_Sequence

一開始竟然想要BUBBLE SORT 真是瘋了

後來看到只要算出1 2 3的各數便可以直接取對調數目(1,2) <=> (2,1)

最後再看輪換的 (1,2) => (2,3) => (3,1) 等
--------------------------------------------------------------------
USER: Lee Pu [leepupu1]
TASK: sort3
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.000 secs, 3172 KB]
Test 7: TEST OK [0.000 secs, 3172 KB]
Test 8: TEST OK [0.000 secs, 3172 KB]

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

[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