2020-2021 Red dot Design Award
2020-2021 Red Dot Design Award 2020-2021 紅點設計大獎 項目介紹 Red dot design award紅點設計大獎是由德國著名設計協會Design Zentrum NRW在1955年創立，至今已有超過50年的歷史。在Peter Zec?教授的帶領下，...
USACO 2015 US Open, Gold Problem 3. Trapped in the Haybales (Gold)
原題下載 USACO2015FEB-G3 答案 (Analysis by Nick Wu) Sort the haybales by location. Consider two haybales?i?and?j?such that Bessie can start somewhere between those haybales and break through all th...
USACO 2015 US Open, Gold Problem 2. Palindromic Paths
原題下載 USACO2015OPEN-G2 答案 (Analysis by Nick Wu) This is a DP problem where we iteratively count the number of palindromes that we can build from the middle. Let?f(a,r1,r2)?be the number of pal...
USACO 2015 US Open, Gold Problem 1. Googol
原題下載 USACO2015OPEN-G1 答案 (Analysis by Steven Hao) We first present a naive algorithm that recursively iterates through all nodes. Below is Python code implementing this naive algorithm, which...
USACO 2015 US Open, Silver Problem 3. Bessie's Birthday Buffet
原題下載 USACO2015OPEN-S3 答案 (Analysis by Nick Wu) Start by sorting the patches of the grass in increasing order of quality. Let?f(i)?be the maximum energy that we can accumulate if we end at pat...
USACO 2015 US Open, Silver Problem 2. Trapped in the Haybales (Silver)
原題下載 USACO2015OPEN-S2 答案 (Analysis by Nick Wu). If we pick a bale that we want to add hay to, then we can guarantee that Bessie cannot break through that bale. Therefore, once we have picked ...
USACO 2015 US Open, Silver Problem 1. Bessie Goes Moo
原題下載 USACO2015OPEN-S1 答案 (Analysis by Nick Wu) There are?5007?different combinations to check, which is far too many. However, just like with the bronze version of this problem, where we were...
USACO 2015 US Open, Bronze Problem 4. Palindromic Paths (Bronze)
原題下載 USACO2015OPEN-B4 答案 (Analysis by Nick Wu) Our first thought is to try all possible paths that Bessie can take. For small?N, this works out well, but it turns out that for a grid of size?...
USACO 2015 US Open, Bronze Problem 2. Bessie Gets Even
原題下載 USACO2015OPEN-B2 答案 (Analysis by Nick Wu) In a pure brute-force solution, we would try every possible combination of assignments of variables to values. There are 7 variables, with at mo...
