Python solutions of Google Code Jam 2009. Solution begins with * means it will get TLE in the largest data set (total computation amount > 10^8, which is not friendly for Python to solve in 5 ~ 15 seconds). A 4-minute timer is set for the small dataset and a 8-minute timer is set for the large dataset this year.
- Code Jam 2008
- Qualification Round
- Round 1A
- Round 1B
- Round 1C
- Round 2
- Round 3
- World Finals
- Code Jam 2010
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| A | Alien Language | ||||||
| B | Watersheds | ||||||
| C | Welcome to Code Jam |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| A | Multi-base happiness | ||||||
| B | Crossing the Road | ||||||
| C | Collecting Cards |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| A | Decision Tree | ||||||
| B | The Next Number | ||||||
| C | Square Math |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| A | All Your Base | ||||||
| B | Center of Mass | ||||||
| C | Bribe the Prisoners | Python | O(Q^3) | O(Q^2) | Easy | DP |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| A | Crazy Rows | Python | O(N^2) | O(N) | Easy | Greedy | |
| B | A Digging Problem | ||||||
| C | Stock Charts | ||||||
| D | Watering Plants |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| A | EZ-Sokoban | ||||||
| B | Alphabetomials | ||||||
| C | Football Team | ||||||
| D | Interesting Ranges |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| A | Year of More Code Jam | ||||||
| B | Min Perimeter | ||||||
| C | Doubly-sorted Grid | ||||||
| D | Wi-fi Towers | ||||||
| E | Marbles | ||||||
| F | Lights |