2020-2021 Scholastic Art and Writing Awards
2020-2021 Scholastic Art&Writing Awards 2020-2021 美国艺术与写作大赛 项目介绍 Scholastic Art&Writing Awards美国艺术与写作大赛与美国100多个视觉艺术和文学艺术组织合作，为当地社区带来颁发各学...
2020-2021 International Design Excellence Awards
2020-2021 International Design Excellence Awards 2020-2021 美国国际工业设计优秀奖 项目介绍 The International Design Excellence Awards (IDEA) 美国国际工业设计优秀奖是世界上最负盛名、最严格的年度设计...
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...
