|5||Erik Troy Uy||2||115|
2004.06.30: Discussion of problems
REMINDER: We will have classes on 2004.06.30.
2004.06.28: Mini-contest: Data structures
|8||11||Neill Wilbert Li||1||112|
|9||12||Peter dela Cruz||1||129|
Keep up the great work! To everyone else: don't be discouraged. Practice greatly helps. =)
Check this site tomorrow afternoon for problems to practice on.
2004.06.21: Mini-contest: Data structures
We had our first mini-contest today, with problems 262 and 330 from http://acm.uva.es/problemset/ . It took us half an hour to set up PC^2, which I configured for Java use. Mark Punzalan successfully solved problem 262 (Transferable Voting) after a few runs that had problems with spoiled ballots. A number of other people attempted a few submissions, but no one else succeeded.
If you study the sample solutions, you can see:
- How input/output is generally handled
- A particular (but not necessarily the best) algorithm for solving the problem
- How ugly code can get when written under time pressure ;)
The sample solution may not address all test cases. Oh well. =)
2004.06.16: Data structures
- Priority Queues
Work on the following problems for practice. Try to solve at least three before Monday. You don't have to solve them in order. Read through the problems to find the ones you think you can solve. Solve them, then move on to more difficult problems.
- Student Grants (144)
- Josephus Problem (130)
- The Skyline Problem (105)
- Jolly Jumpers (10038)
- Poker hands (10315)
- Stack 'em Up (10205)
- Contest scoreboard (10258)
- Accordian patience (127)
- Transaction processing (187)
- Telephone Tangles (139)
- Eeny Meeny (180)
- Clock Patience (170)
- Beggar My Neighbor (162)
- Spreadsheet (196)
You can submit your solutions to the online judge or to me at [email protected].
Please put CS139 in the subject of your e-mail, if you're sending it to me. Outline the input, output, data and processing needed, and ask specific questions. =)
2004.06.14: The first day of classes