Meeting Slides – 11/03/08

by David Liu on November 3, 2008

Meeting slides for November 3rd, 2008. At this meeting, we discussed Upcoming competitions: USACO November round this weekend, TopCoder Single Round Match on Thursday. Silicon Valley Code Camp (this weekend at Foothill) Problem from the USACO October round (Pasture Walking) (…)

Read the rest of this entry »

Traveling on a Grid

by David Liu on October 6, 2008

You’re traveling from the top-left corner of a grid (0,0) to the bottom-right cell of a NxM grid. N and M are between 0 and 250. Entering each cell has a cost. At each step, you can only move down (…)

Read the rest of this entry »

Fibonacci – Solutions

by David Liu on October 6, 2008

The recursive implementation is based directly on the mathematical definition of the Fibonacci function. // Naive, recursive implementation (slow!) public int fib(int n) { if (n <= 0) return 0; if (n == 1) return 1; return fib(n-1) + fib(n-2); (…)

Read the rest of this entry »

Introduction to Dynamic Programming: Fibonacci

by David Liu on September 28, 2008

Here are some problems to think about before our next meeting. The Fibonacci sequence is defined as a sequence where each value is the sum of the two previous values. The first value is defined to be 0, and the (…)

Read the rest of this entry »

First Club Meeting!

by David Liu on September 22, 2008

Today, we had our first meeting at lunch, in room 608. We covered Introductions Overview of Silver and Gold Level Topics Sample Problem (Bronze Level): Cow Multiplication Resources Members also registered online. Slides are available. Members are encouraged to register (…)

Read the rest of this entry »

Recruitment Presentation

by David Liu on September 22, 2008

We made recruitment presentations in Mr. Peck’s Java and APCS classes 9/19 and 9/22. Here are the recruitment slides.