[USACO] sec2-2_Party_Lamps

乍看之下以為要用bfs暴搜下去 但c最大為10000 此方法不行

由於只有 4 個開關 最終只有 2^4=16 種可能性 以此方法進行暴破

要特別注意輸出時要排序!

[USACO] sec2-2_Runaround_Numbers

文字待補＝口＝

[USACO] sec2-2_Subset_Sums

待補文字...

[USACO] sec2-2_Preface_Numbering

恩..原本以為需要DP一下 結果竟然直接解就可以了= = ((最大才3499

分解每一個數 在累加~

一次解出~ 不錯!

[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!