To solve Party-list seat allocation, ask IT students
By Felix Muga II
Posted Dec. 30, 2010
Straight from computer schools in four countries, IT students were asked to solve the seat allocation of the Party-list system in the Philippines using the Carpio formula.
Last Nov. 20, 2010 the ACM ICPC Philippine National Programming Contest was held in Ateneo de Naga University (ADNU). The event was organized by the Computing Society of the Philippines and the College of Computer Studies of ADNU. The programming competition is recognized by the international organization of computer scientists called Association of Computing Machinery (ACM) through the ACM-ICPC (International Collegiate Programming Contest).
The 2010 ACM-ICPC World Finals were held in Harbin, China from February 1 to 6, 2010. The world title was won by Shanghai Jiao Tong University which solved 7 out of 11 problems. A school team earns a slot in the World Finals if it won an ACM-ICPC Regional Contest.
A regional contest was held in Ateneo de Manila with 55 teams from 28 schools in four countries (the Philippines, Singapore, Vietnam, and Hong Kong/China) participating. Ten programming problems were given. A team from UP Diliman won the Asia Manila Regional Contest by solving ten out 10 problems in the shortest possible time. In the 2010 World Finals the UP Diliman team was able to solve four out of 11 problems and is ranked 36th worldwide out of 103 World Finals qualifiers.
In the recently concluded Philippine edition of ACM-ICPC, one of the 4 teams from UP Diliman is the national champion. The team solved six out of 10 problems. CenPEG senior fellow Dr. Pablo R. Manalastas served as the Contest Chief Judge. Another CenPEG Senior Fellow Dr. Felix P. Muga II also sat in the Panel of Judges. One of the 10 problems posed was on the seat allocation of the Philippine-style Party List System using the Carpio Formula (see PDF attachment).
For further information on the contest, visit http://ccs.adnu.edu.ph/acm-icpc2010/.