2017 ACM-ICPC Philippines Southern Luzon

I was a problem setter and judge for the 2017 ACM-ICPC Philippines Southern Luzon Invitational Programming Contest held last October 1, 2017 at the Ateneo de Naga University. Seven teams from five schools joined, which is much less than the numbers in the previous years (15 teams from 9 schools in 2016, 13 from 6 in 2015, 31 from 13 in 2014, 32 from 15 in 2013). The contest problems and solutions are here. I provided two contest problems: “C” (Sharkovski Successor) and “D” (String Substitution). I was also a problem setter and judge in 2016, 2015, 2014, and 2013.

Advertisements

2016 ACM-ICPC Philippines Southern Luzon

slic2016

I was a problem setter and judge for the 2016 ACM-ICPC Philippines Southern Luzon Invitational Contest held last October 1, 2016 at the Ateneo de Naga University.

The winning team was from the University of the Philippines, Los Baños. It solved 7 of the 12 problems. (The teams were given 5 hours.) The results are shown below. (The image has been slightly edited.)

standings

If I’m not mistaken, the warm-up problems were the same as last year’s.  The contest problems are here. I provided two contest problems: “C” (Billiard Paths 1) and “H” (Billiard Paths 2).  (My slides explaining my solutions are here and here.) As you can see from the scoreboard below, two teams attempted problem “C” (and both succeeded), and no team attempted problem “H.”

scores

I was also a problem setter and judge in 20152014, and 2013.

2015 ACM-ICPC Philippines Southern Luzon

icpc2015 I was a problem setter and judge for the 2015 ACM-ICPC Philippines Southern Luzon Invitational Programming Contest held last September 13, 2015 at the Ateneo de Naga University.

The winning team was from Ateneo de Naga University. It solved 5 of the 10 problems. (The teams were given 5 hours.) The results are shown below. (The image has been slightly edited. Click on it to see a higher-resolution version.)

2015icpc
The warm-up problems are here and the contest problems are here. I provided two contest problems: “D” (Freeway Traffic) and “I” (Forest Fire Spread). They are both about cellular automaton models.

I was also a problem setter and judge in 2014 and in 2013.

ACM ICPC Bicol 2014

10649866_512300605568241_2964989848509910029_n I was a problem setter and judge for the ACM ICPC Philippines 2014 National Programming Contest held last September 6, 2014 at the Ateneo de Naga University. (I was also a problem setter and judge in last year’s multi-provincial programming contest.)

There were 31 teams from 13 schools. The winning team was from Ateneo de Manila University. It solved all 10 problems in a little less than 2 hours. (The teams were given 5 hours.) The detailed results are here.

I provided two problems: “B” (Scrabble) and “H” (Boggle). My Scrabble problem was one of the easiest (26 teams answered it correctly) and my Boggle problem was one of the hardest (7 teams answered it correctly).

ACM ICPC Bicol

acmicpcb I was a problem setter and judge for the ACM ICPC Bicol held last August 10, 2013 at the Ateneo de Naga University. Programming was done using C, C++, or Java and judging was done using PC2. There were 32 teams from 15 schools (of these, 4 teams were from 2 schools outside the Bicol region). The winning team was from Ateneo de Manila University and solved all 10 problems in the given 5 hours. A team from Ateneo de Davao University finished in second place with 5 problems solved. (The detailed results are here.)

I provided two problems: “F” (Sharkovski’s Ordering) and “I” (Interior Lattice Points). The first was inspired by a 2008 paper by Ciesielski and Pogoda and the second by chapter 5 of Ian Stewart‘s Another Fine Math You’ve Got Me Into… (New York: W. H. Freeman and Company, 1992).

Problem “F” looks easy (16 teams tried to answer it) but implementing the solution could be a little tricky (only 5 got it correctly). Problem “I” looks difficult (2 teams tried to answer it) but implementing it is not so hard if you know Pick’s Theorem (both teams got it correctly the first time).