ACM Programming Problems
Most of our problems are taken from the online source of ACM problems at UVA Online Judge.
- Problems Still Open (taken from ACM weekly Thursday meetings)
- Problem 10207 - The Unreal Tournament
- Problem 11301 - The Great Wall of China
- Problem 11236 - Grocery Store
- Problem 10603 - Fill
- Problem 10290 - {sum+=i++} to Reach N
- Problem 10212 - The Last Non-zero Digit
- Problems Solved at the Meetings
- Problem 146 ID Codes - solved by Nick Glorioso and Vitaliy Kubushyn
- Problem 130 Roman Roulette - solved by Vitaliy Kubushyn
- Problem 100 The 3n+1 problem - solved by Vitaliy Kubushyn
- Problem 10000 Longest Paths - solved by Vitaliy Kubushyn
- Problem 10346 Peter's Smokes - solved by Jia Tse and Vitaliy Kubushyn
- Problem 118 Mutant Flatworld Explorers - solved by Jia Tse and Vitaliy Kubushyn
- Problem 10077 The Stern-Brocot Number System - solved by Jia Tse and Vitaliy Kubushyn
- Problem 168 Theseus and the Minotaur - solved by Nick Glorioso
- Problem 10110 Light, more Light - solved by Nick Glorioso, Mike Rogers, and Jia Tse
- Problem 253 Cube Painting - solved by David Hannasch
- Problem 10297 Beavergnaw - solved by Jia Tse
"Programmer of the Month" honorary title will be implemented on the web site soon. The person will be chosen based on his or her participation and how many problems they have managed to solve. The problems will be weighted by their difficulty and the person's photo will be put on this section for all to see. Vitaliy Kubushyn is exempt from participating for being the one editing this site.
Challenge Problems
Here at the ACM, we love to challenge and be challenged. If you'd like to submit a challege problem, just submit email Vitaliy.
Current List of Challenge Problems:
- 9^9^9 - Open
- 40 envelopes and 40 letters - Solved by James Oravec
- Jia's 1st ACM challenge - Solved by James Oravec
- Jia's 2nd ACM challenge - Solved by James Oravec
- Queens Problem - Solved and Programmed by Jae Adams