Meeting: Every Tuesday at 7pm, in King 135 (the downstairs lab)Hey! Guess what! The ExCo has re-applied for next semester, featuring a new instructor - Emma! Hooray! This Year's Results:2009 ACM ICPC East Central N.A. Regionals
Final Standingscongratulations, everyone! We had four teams go, and each got either two or three problems done! (So, together, we got 8 problems done, and kind of won :p?) |
posted Nov 17, 2009 1:54 PM by Kateryna Kuksenok
[
updated Nov 17, 2009 1:56 PM
]
Today, we'll be talking about coordinates and distances. Specifically, different distance measures (Euclidean, Manhattan/Hamiltonian) and instances of having to deal with a coordinate system. The problem is: |
posted Nov 10, 2009 1:38 PM by Kateryna Kuksenok
[
updated Nov 10, 2009 3:46 PM by Michael Brooks
]
Today, we will be talking about prime numbers! Here's the problem: |
posted Oct 27, 2009 3:54 PM by Michael Brooks
We're preparing for the competition. Here are the problems for today: |
posted Oct 6, 2009 1:24 PM by Kateryna Kuksenok
[
updated Oct 6, 2009 4:01 PM
]
Today is mainly about the upcoming competition, and details about that. We'll have the coaches at the meeting.Please consider the following list of problems:AND FILL OUT THIS FORM!!These problems (in no particular order) illustrate the following major (non-exclusive) categories of problems: - Simulating a step-wise process
- Graphical (spatial)
- Recursive Backtracking
- Exhaustive Solutions
- Dynamic Programming
- Graphs (think vertexes and edges)
- Continuous (as opposed to discrete)
- Algorithmic (meaning, involve implementing something really, really similar to the type of algorithm you'd learn about in 280)
- Asinine (in other words, characterized by either lack of consciousness at time of composing of, or overt maliciousness, in problem statement)
- Big Numbers
- Well-illustrated (characterized by appealing clip-art)
|
posted Sep 22, 2009 3:09 PM by Michael Brooks
[
updated Sep 22, 2009 3:45 PM
]
We'll be looking at two small problems: 1) Marbles2) N-QueensWe will not be solving these right now. Just read over them quickly for now. |
posted Sep 15, 2009 3:57 PM by Kateryna Kuksenok
[
updated Sep 15, 2009 4:02 PM
]
posted Sep 8, 2009 11:45 AM by Michael Brooks
[
updated Sep 8, 2009 4:00 PM by Kateryna Kuksenok
]
Today we will be working on this problem: Here's some minimal starter code that you're probably going to use (whether you type it yourself or not) in just about every solution: import java.util.*;public class MainClass { public static void main(String[] args) {
Scanner scanner = new Scanner(System.in); //rest of program... }} |
|
