ACM ICPC Asia Manila 2009: Problem D

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-d.html

2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem D: ‘Composition of Polynomials’
Input file: d.in
Output file: stdout
Execution time limit: 15 seconds


Given two polynomials, p(x) of degree M, and q(x) of degree N, both with integer coefficients, your problem is to write a computer program that prints the coefficients of the composition polynomial f(x) = p(q(x)).

For example, if p(x) = 2x^3 + 5x – 4 and q(x) = 3x^2 – 4x + 1, then f(x) = p(q(x)) = 2(3x^2 – 4x + 1)^3 + 5( 3x^2 – 4x + 1) – 4 = 54x^6 – 216x^5 + 342x^4 – 272x^3 + 129x^2 – 44x + 3

INPUT. Input shall consist of several data sets. Each data set will be given in three lines of input. The first line will give the values of M and N, separated by one or more spaces. The second line will give the coefficients of each term of p(x), separated by one or more spaces, and arranged in increasing powers of x. The third line will give the coefficients of each term of q(x), separated by one or more spaces, and arranged in increasing powers of x. Both M and N will be between 0 and 10, inclusive. Each coefficient will be small, in the range -20 to 20 inclusive, but a small value raised to 10th power is not guaranteed to be a small integer. Input for the next data set will immediately follow that of the previous data set. An input of M = 0 and N = 0 will signify the end of input data.

SAMPLE INPUT
3 2
-4 5 0 2
1 -4 3
2 2
-7 0 2
5 3 2
0 0

OUTPUT.
For each data set, print one line of output of the form:“Data set N: <composition polynomial>”,
where N is the data set number, starting from 1, and <composition polynomial> is the resulting polynomial in decreasing powers of x, with zero terms omitted. If the power of a term is 1, then the power must not be printed. If the coefficient of a term is 1, you may optionally print or not print the coefficient.

OUTPUT FOR SAMPLE INPUT
Data set 1: 54x^6–216x^5+342x^4–272x^3+129x^2–44x+3
Data set 2: 8x^4+24x^3+58x^2+60x+43


(Acknowledgment: This problem was contributed by Dr. Pablo Manalastas, Ateneo de Manila University).
.

ACM ICPC Asia Manila 2009: Problem J

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-j.html

2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem J: ‘So Long Pal’
Input file: j.in
Output file: stdout
Execution time limit: 120 seconds


A string is a palindrome if it reads the same whether read forward or backward. For example, “MaDaM” and “1234554321” are palindromes, while “APPLE”, “00110”, and “mADam” are not palindromes.

Non-palindromes, however, may also contain palindromes. For example, the longest palindrome in “APPLE” is “PP”, the longest palindrome in “00110” is “0110”, and the longest palindrome in “Philippines” is “ippi”.

Input

The file consists of several test cases, each with a case number and the test case. A test case specifies a string with length 2 up to 100.

Output

For each test case, output the length of the longest palindrome in the string. Note that non-letters and non-digits are considered in searching for palindromes in the string, but are eventually not counted in the length of the longest palindrome.

Sample Input

Case 1: 1234554321
Case 2: Yes
Case 3: M*aD*aM
Case 4: M*aDa*M
Case 5: M*aDa*m
Case 6: 22r1*+00+*1r?
Case 7: ?0&910$$0190+
Case 8: 0&910$0$0+
Case 9: 0&910$+
Case 10: $+*+$

Output for the Sample Input

Case 1: 10
Case 2: 1
Case 3: 1
Case 4: 5
Case 5: 3
Case 6: 6
Case 7: 6
Case 8: 3
Case 9: 1
Case 10: 0


(Acknowledgment: This problem was contributed by Dr. Nelson Marcos, De La Salle University - Manila)

.

ACM ICPC Asia Manila 2009: Problem I

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-i.html


2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem I: ‘U Fill Me Up’
Input file: i.in
Output file: stdout
Execution time limit: 30 seconds

An n x m matrix can be filled by consecutive numbers starting from a number p, in a diagonal fashion starting at the upper right corner. For example, the 4 x 7 matrix below is filled up by numbers starting from 4.

(See Figure 1)

From the matrix, the sum of the elements covered by the region specified by indices (x1, y1) and (x2, y2) can be computed. For example, the sum of the elements covered by the region specified by index (1, 2) to index (2, 4) is 106 (because 21 + 14 + 13 + 23 + 20 + 15 = 106).

Input

The file consists of several test cases, each with a case number and the test case. A test case specifies the dimensions n and m of the matrix (where 0 <> 0, and x1 <= x2 and y1 <= y2). Output

For each test case, output the sum of the elements in the specified region.

Sample Input

Case 1: 4 7 4 1 2 2 4
Case 2: 4 7 4 3 6 4 7
Case 3: 4 7 4 5 2 6 8
Case 4: 4 7 4 4 7 5 10
Case 5: 8 5 1 2 1 2 5

Output for the Sample Input

Case 1: 106
Case 2: 47
Case 3: 0
Case 4: 10
Case 5: 48


(Acknowlegment: This problem was contributed by Dr. Nelson Marcos, De La Salle University - Manila)

.

ACM ICPC Asia Manila 2009: Problem H

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-h.html

NOTE: Click on the images to see larger views.

.

(Acknowledgment: This problem was contributed by Dr. Felix Muga II, Ateneo de Manila University)

.

ACM ICPC Asia Manila 2009: Problem G

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-e.html

( Note: Click on the figure to see a larger view. )

2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem G: ‘A eiH1 aNy 1’
Input file: g.in
Output file: stdout
Execution time limit: 30 seconds

The recent rise in the number of people contracting the flu virus had led to the study on its spread pattern. Given a population of N people in a community, there will be some people who are naturally immune from the flu virus and there are those who are not. Depending on the movement of the person, he or she also has a varying radius of transmission as represented by circles in Figure 1. However, we shall assume that each person can only be infected at center of his/her area. Figure 1 illustrates the spread of the flu virus after 4 transmissions. The first infected person is labeled with a value of 0, infecting 2, 2, 1 and 1 person, respectively, for each transmission.

(See Figure 1)

The flu virus is eventually contained at this point in time. We shall assume the center point of all people will remain the same.

Input
The input consists of multiple test cases. Each test case starts with a line containing an integer N (1 ≤ N ≤ 30) indicating the number of people in the population. Starting on the next line are 3-tuple data (x y r) representing the persons x, y coordinates and r radius of transmission. Each 3-tuple data are space delimited. Persons who are immune to the flu virus have a radius of 0. The first entry in each test case is the first person affected with the flu virus. The last test case is followed by a line containing a single zero. The coordinate system sets the origin in the top left corner of the entire area. The variables x and y are positive integers not exceeding 200. The variable r is a non-negative integer not exceeding 200.

Output

For each test case, print the case number (starting with 1) followed by the number of transmission before the flu virus is eventually contained.

Sample Input

23
50 30 20
45 20 0
70 25 0
85 30 0
10 30 0
10 40 10
25 35 0
25 20 10
35 35 10
55 35 0
65 35 20
80 40 15
105 40 10
20 55 10
40 50 10
60 50 10
85 50 10
90 55 10
110 55 5
50 65 20
70 65 5
25 70 0
95 75 0
0

Output for the Sample Input

Case 1: 4 transmissions

(Acknowledgment: This problem was contributed by Dr. Caslon Chua, De La Salle University-Manila)

.

ACM ICPC Asia Manila 2009: Problem F

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-f.html


Figure 1. (Note: Click on the figure to see a larger view.)


2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem F: ‘Ordered Pairs and Positive Integers’
Input file: f.in
Output file: stdout
Execution time limit: 60 seconds

See Figure 1.

(Acknowledgment: This problem was contributed by Dr. Allan Sioson, Ateneo de Naga University)
.

ACM ICPC Asia Manila 2009: Problem E

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-e_28.html

Figure 1 and Figure 2.
(Note: Click on the figures to see a larger views.)


2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem E: ‘Been Rational’
Input file: e.in
Output file: stdout
Execution time limit: 30 seconds

.

See Figure 1 and Figure 2.

.

(Acknowledgment: This problem was contributed by Dr. Allan Sioson, Ateneo de Naga University)

.

ACM ICPC Asia Manila 2009: Problem C

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-c_27.html

2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem C: ‘Minimal Bounding Rectangle’
Input file: c.in
Output file: stdout
Execution time limit: 60 seconds

Given N points on the plane, namely, (x[0],y[0]), (x[1],y[1]), . . . , (x[N-1],y{N-1]), a divider line is one that passes through two of these points such that all the N points are on one side of the line or on the line itself. Given any divider line L(P, P') that passes through the two points P and P', a unique bounding rectangle R(P, P') of minimal area can be found that contains all the N points inside the rectangle or on its sides, such that one side of R(P, P') is on L(P, P'). You problem is to write a computer program that will determine all such bounding rectangles of minimal area such that one side is on a divider line, and report the the smallest area among all such rectangles.

For example, given the six points A(0,0), B(0,2), C(1,1), D(2,2), E(3,1), and F(4,0). The divider line passing through AB defines a bounding rectangle of minimal area 8 square units. The divider line passing through AF defines a bounding rectangle of minimal area 8 square units. The divider line passing though DF defines a bounding rectangle of minimal area 12 square units. Finally the divider line passing through BD defines a bounding rectangle of minimal area 8 square units. Thus the bounding rectangle of smallest area has 8 square units.

INPUT.
Input shall consist of several data sets. Each data set will be given in several lines. The first line of the data set will contain the value of N. This will be followed by N lines, each line containing the x and y coordinates of one point, separated by spaces. The value of N will not exceed 500. The coordinates x and y will be integers not exceeding 1000 in absolute value. Data for the next data set will immediately follow the data for the previous data set. An input value of N = 0 signifies the end of input.

SAMPLE INPUT
6
0 0
0 2
1 1
2 2
3 1
4 0
3
0 1
1 0
1 1
0

OUTPUT.
For each data set, print one line of output of the form “Data set N: A”, where N is the data set number, starting from 1, and A is the area of the bounding rectangle that is the smallest, given to four decimal places. Note that two sides of a bounding rectangle may meet at a point with non-integer coordinates.

OUTPUT FOR THE SAMPLE INPUT
Data set 1: 8.0000
Data set 2: 1.0000


(Acknowledgment: This problem was contributed by Dr. Pablo Manalastas, Ateneo de Manila University).

.

ACM ICPC Asia Manila 2009: Problem B

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-b.html

2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem B: ‘Typhoon Ondoy’
Input file: b.in
Output file: stdout
Execution time limit: 10 seconds

On September 26, 2009, Typhoon Ondoy brought a month's worth of rainfall to Metro Manila and nearby areas in just a few hours, causing severe flooding which resulted in the loss of many lives and the displacement of hundreds of thousands of people.
Areas under Storm Signal No. 2 included: Aurora, Quirino, Nueva Vizcaya, Nueva Ecija, Pangasinan, Tarlac, Zambales, Pampanga, Bulacan, Rizal, Northern Quezon, and Polillo Island.
Under Storm Signal No. 1 were: Isabela, Mountain Province, Ifugao, Benguet, La Union, Ilocos Sur, the rest of Quezon, Laguna, Cavite, Batangas, Mindoro provinces, Lubang Island, Marinduque, Camarines Norte, Bataan, and Metro Manila.
The Philippine Atmospheric Geophysical and Astronomical Services Administration (PAG-ASA) has come up with a measure to classify typhoons based on wind speed (in kph):
Tropical depressions have wind speeds of 30 to 46 kph (inclusive).
Tropical storms have wind speeds between 47 kph and 89 kph (inclusive).
Typhoons have wind speeds between 90 kph and 183 kph (inclusive).
Super typhoons have wind speeds greater than 183 kph.

TASK: Given a file containing wind speeds (in integer format, ranging from 1 to 255) your task is to produce a computer program that will display the type of typhoon based on wind speed. If the wind speed is between 1 and 29 kph (inclusive) then display the message “No classification”.


SAMPLE INPUT

1 50 100 60 155 200 90 46

SAMPLE OUTPUT

Case 1: No classification
Case 2: Tropical storm
Case 3: Typhoon
Case 4: Tropical storm
Case 5: Typhoon
Case 6: Super typhoon
Case 7: Typhoon
Case 8: Tropical depression


(Acknowledgment: This problem was contributed by Dr. Rafael Saldaña, Ateneo de Manila University)

.

ACM ICPC Asia Manila 2009: Problem A

.
Link to blog post:
http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem.html

2009 ACM ICPC Asia Manila
October 22 – 23, 2009

Problem A: ‘Time Lapse Camera’
Input file: a.in
Output file: stdout
Execution time limit: 30 seconds

Henry has a time lapse camera that can take a set of 3 images in one shot. The three images are taken by the camera at different time lapse. For example, if the first image is taken at 0.33 seconds after the shot, then the second image is automatically taken at 0.51 seconds and the third image is taken at 0.62 seconds after the shot. The time lapses of taking the images are not reliable but the spatial coordinate (x, y) between images remain the same due to high speed shutter.

One nice evening during a sport festival, Henry placed a grid net in front of camera and started shooting the movement of a ball. Once the images were developed, Henry measured and recorded the coordinates of the ball on each image. Now he wants to know the highest height that the ball had achieved in a set of 3 images.

You need to help Henry by writing a program to compute the approximation of height that the ball has achieved in each set of images by assuming that the movement of the ball forms a parabolic curve.

Input

A test case consists of the coordinate of 3 points where the ball was captured by the camera. Input consists of several test cases. Each coordinate will not exceed 500.0 in absolute value. The input is terminated by a zero on a line by itself.

Output

Approximation of highest height that the ball has achieved in each test case

Sample Input

20, 25
50, 25
35, 30
15, 17
12, 23
16, 11
15, 12
25, 20
35, 25
0

Sample Output

Test case 1: 30.00
Test case 2: 23.25
Test case 3: 27.04


(Acknowledgment: This problem was contributed by Dr. Kardi Teknomo, Ateneo de Manila University)

.

ACM ICPC Asia Manila 2009: Problem Set

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-problem-set.html

2009 ACM ICPC Asia Manila Regional
October 22 – 23, 2009
Ateneo de Manila University, Philippines

PROBLEM SET

Letter Code / Title / Input File

A, 'Time Lapse Camera', a.in
B, 'Typhoon Ondoy', b.in
C, 'Minimal Bounding Rectangle', c.in
D, 'Composition of Polynomials', d.in
E, 'Been Rational', e.in
F, 'Ordered Pairs and Positive Integers', f.in
G, 'A eiH1 aNy 1', g.in
H, 'Maximum Value', h.in
I, 'U Fill Me Up', i.in
J, 'So Long Pal', j.in

.

2009 ACM ICPC Asia Manila Regional Onsite Contest: Final Standing

.
Link to blog post:
http://raffysaldana.blogspot.com/2009/10/2009-acm-icpc-asia-manila-regional.html

ACM International Collegiate Programming Contest (ICPC)
Asia Manila Regional Onsite Contest
October 22 - 23, 2009
Ateneo de Manila University, Philippines
Sponsored by IBM

FINAL STANDING

Numbers 1 to 20

Numbers 21 to 40

Numbers 41 to 55
SUMMARY

Number of Teams Participated: 55

Number of Countries/Territories: 4 (Hong Kong, Philippines, Singapore, Vietnam)

Number of Schools: 23

Number of Problems Given: 10

Number of Teams that Solved at least 1 Problem: 55 / 55 (100 %)

Number of Teams that Solved 10 /10 Problems: 6 / 55 (10.9 %)

Winners:

1. CHAMPION: University of the Philippines - Diliman (PHILIPPINES)
'Mga SOGO ni E.T.'

2. First Runner-Up: Ho Chi Minh City University of Science (VIETNAM)
'PASSION'

3. 2nd Runner-Up: National University of Singapore (SINGAPORE)
'NUSSOC1'

Top Ten Schools:

1. University of the Philippines - Diliman (PHILIPPINES)
2. Ho Chi Minh City University of Science (VIETNAM)
3. National University of Singapore (SINGAPORE)
4. Hong Kong University of Science and Technology (HONG KONG)
5. University of Hong Kong (HONG KONG)
6. Ateneo de Manila University (PHILIPPINES)
7. De La Salle University - Manila (PHILIPPINES)
8. University of the Philippines - Los Banos (PHILIPPINES)
9. Ateneo de Naga University (PHILIPPINES)
10. University of Immaculate Conception - Davao (UIC)

Participating Schools:

Asia Pacific College (APC)
Ateneo de Davao University (ADDU)
Ateneo de Manila University (ADMU)
Ateneo de Naga University (ADNU)
Ateneo de Zamboanga University (ADZU)
Cebu Institute of Technology (CIT)
De La Salle Canlubang (DLSC)
De La Salle University - Manila (DLSU)
Don Bosco Technical College (DBTC)
Emilio Aguinaldo College - Manila (EAC)
FEU East Asia College (FEUEAC)
Ho Chi Minh City University of Science (HCMCUS)
Hong Kong University of Science and Technology (HKUST)
National University of Singapore (NUS)
Technological Institute of the Philippines - Manila (TIP)
University of Asia and the Pacific (UA&P)
University of the Immaculate Conception - Davao (UIC)
University of Hong Kong (UHK)
University of the Philippines - Diliman (UPD)
University of the Philippines - Los Banos (UPLB)
University of Saint Louis - Tuguegarao (USLT)
University of San Jose - Recoletos (USJR)
Xavier University (XU)

Prepared by:

Dr. Rafael P. Saldaña
Contest Director
2009 ACM ICPC Asia Manila

Date: 23 October 2009
.

ACM ICPC Asia Manila 2009: Message from Dr. Rafael Saldaña, Contest Director

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/blog-post.html

ACM International Collegiate Programming Contest (ICPC)
Asia Manila Regional Onsite Contest
October 22 - 23, 2009
Ateneo de Manila University, Philippines
Sponsored by IBM

Website: http://www.math.admu.edu.ph/acm




MESSAGE

Mabuhay!

Welcome to the 2009 ACM International Collegiate Programming Contest, Asia Regional Manila hosted by Ateneo de Manila University.

The ACM ICPC is a prestigious event that aims to raise the awareness of the public about the important role of Information Technology in the development of our country and our society.

It’s objective of bringing together bright and talented young people from different countries to take part in a grueling friendly competition, like a mental Olympiad, is quite noble.

To all participants and coaches, I hope that you will take advantage of this opportunity to meet and interact with your fellow competitors from all over the Philippines and other countries in Asia.

I also hope that you will also enjoy your stay at the Ateneo de Manila University.

Finally, I would like to thank the Association for Computing Machinery (ACM) for giving Ateneo de Manila University another chance to host the prestigious ICPC event in Manila. I would also like to thank my co-organizers, judges, volunteers, and our sponsors for making the 2009 Asia Programming Contest-Manila a success.


(Sgd.) Rafael P. Saldaña, Ph.D.
Regional Contest Director
ACM ICPC Asia-Manila Site
Ateneo de Manila University
October 2009

.

ACM ICPC Asia Manila 2009: Message from Prof. C. J. Hwang, Asia Contests Director

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-message-from.html

ACM International Collegiate Programming Contest (ICPC)
Asia Manila Regional Onsite Contest
October 22 - 23, 2009
Ateneo de Manila University, Philippines
Sponsored by IBM

Website: http://www.math.admu.edu.ph/acm




MESSAGE

Welcome and congratulations to all of you for participating in the 2009 ACM International Collegiate Programming Contest (ICPC), Asia Regional in Manila on October 22-23, 2009 at the Ateneo de Manila University.

The ICPC is a very meaningful concept in this generation of science and technology. It will not only broaden the minds of the younger generation, but will also encourage them to advance in technological aspects in the future years. I wish all teams the very best, and the organizers a grand success.

I thank Ateneo de Manila University for hosting the 2009 Asia Programming Contest-Manila.

Finally, I congratulate the winning team and welcome them to participate in the ACM International Collegiate Programming Contest World Finals in Harbin, China on February 1 – 6, 2010.


(Sgd.) Professor C. Jinshong HWANG
ACM ICPC Asia Contests Director
Department of Computer Science
Texas State University – San Marcos, USA

.

ACM ICPC Asia Manila 2009: Judges

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-judges.html

Caption: ACM ICPC Asia Manila 2009 Judges (L-R): Dr. Felix Muga II (ADMU), Dr. Nelson Marcos (DLSU), Dr. Pablo Manalastas (ADMU and UP Diliman), Dr. Rafael Saldana (ADMU), Dr. Kardi Teknomo (ADMU), Dr. Allan Sioson (ADNU). Not in photo: Dr. Henry Adorna (UP Diliman), Dr. Caslon Chua (DLSU), and Prof. Rommel Feria (UP Diliman). From the photo collection of Raffy Saldana (http://raffysaldana.blogspot.com/). All Rights Reserved.

ACM International Collegiate Programming Contest (ICPC)
Asia Manila Regional Onsite Contest
October 22 - 23, 2009
Ateneo de Manila University, Philippines
Sponsored by IBM

Website: http://www.math.admu.edu.ph/acm

BOARD OF JUDGES

Henry Adorna, Ph.D. (University of the Philippines - Diliman)

Caslon Chua, Ph.D. (De La Salle University - Manila)

Pablo Manalastas, Ph.D. (Ateneo de Manila University) (Chief Judge)

Nelson Marcos, Ph.D. (De La Salle University - Manila)

Felix Muga II, Ph.D. (Ateneo de Manila University)

Rafael Saldaña, Ph.D. (Ateneo de Manila University)

Allan Sioson, Ph.D. (Ateneo de Naga University)

Kardi Teknomo, Ph.D. (Ateneo de Manila University)

John Michael Yap (University of the Philippines-Diliman)

.

ACM ICPC Asia Manila 2009: Introduction

.

ACM International Collegiate Programming Contest (ICPC)
Asia Manila Regional Onsite ContestOctober 22 - 23, 2009Ateneo de Manila University, Philippines
Sponsored by IBM

Website: http://www.math.admu.edu.ph/acm

ABOUT THE ACM ICPC

The ACM International Collegiate Programming Contest (ICPC) is an activity of the Association of Computer Machinery (ACM) that provides college students with an opportunity to demonstrate and sharpen their problem-solving and computing skills. This event is supported by IBM.

The contest is a two-tiered competition among teams of students representing institutions of higher education. Teams first compete in Regional Contests, held around the world from October to November each year. The winning team from each Regional Contest advances to the ACM International Collegiate Programming Contest World Finals that is typically held in mid-February to early March. Additional high-ranking teams may be invited to the World Finals as Wild Card teams.

Particularly, the ACM/ICPC Asia Regional Contests invite Asian students to meet, establish friendships, and promote fair competition in programming.

The Asia Region covers all territories and countries in Asia, such as Hong Kong, Taiwan, South Korea, Japan, China, Singapore, Malaysia, Thailand, Philippines, Indonesia, India, Sri Lanka, Burma, Vietnam, Macau, Mongolia, Siberia, Pakistan, Bangladesh, Israel, Iran, Middle-Eastern, and Central Asian Countries, etc. Asia Regional Contests do not divide the region by political territories. A team that advances to the Contest Finals represents the team's university, not the team's political boundary.

The founder director of the Asia Regional Contest is Dr. C. Jinshong Hwang, professor of computer scienceat Texas State University, San Marcos, Texas, USA. Prof. Hwang started with a single Asia Regional Site in Taiwan in 1995. This year (2009) there are 15 Regional Sites in Asia, namely:

• Amritapuri
• Asia Dhaka
• Asia Gwalior-Kanpur
• Asia Harbin
• Asia Hefei
• Asia Hsinchu
• Asia Jakarta
• Asia Manila
• Asia Ningbo
• Asia Phuket
• Asia Seoul
• Asia Shanghai
• Asia Tehran
• Asia Tokyo
• Asia Wuhan
  

ACM/ICPC has received major sponsorship from IBM since July 1997 for World Finals events, ICPC organization and regional contest activities, and most of the software used for Regional Contests. IBM also provides additional funds available to support part of the regional contest activities for each site.

This year (2009) is the third time that Ateneo de Manila University will host an ACM ICPC Asia Regional event. The first time was in 2005 and the second time was in 2006.

In 2005, a Philippine team qualified for the first time to compete in the ACM ICPC World Finals held in Shanghai, China. The team, Res Cogitans, consisted of three students from Ateneo de Manila University (Carlos Miguel Arguelles, Allan Espinosa, and Mark Punzalan) with Dr. Pablo Manalastas of the Ateneo Department of Information Systems and Computer Science as coach. In 2006, the Linden Boyz (Mark Punzalan, Allan Espinosa, and Chistopher Rigor) from Ateneo de Manila University qualified for the ACM ICPC World Finals held in April 2005 in San Antonio, Texas, USA.

The next ACM ICPC World Finals will be held in Harbin, Chinal on February 1 - 6, 2010.

Dr. Rafael P. Saldaña
Contest Director
ACM ICPC 2009
Asia Manila Site

.

ACM ICPC Asia Manila 2009: Awards

.

Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-awards.html

ACM International Collegiate Programming Contest (ICPC)
Asia Manila Regional Onsite Contest
October 22 - 23, 2009
Ateneo de Manila University, Philippines
Sponsored by IBM

Website: http://www.math.admu.edu.ph/acm


AWARDS

The following awards will be given on October 23, 2009 during the Awarding Session:


TOP 3 TEAMS in Asia Manila Regional Site


Champion

1st Runner-Up

2nd Runner-Up


TOP 3 TEAMS from the Philippines


1st Place

2nd Place

3rd Place



SPECIAL CITATIONS


Best Team from Outside the Philippines

Best Team from Metro Manila

Best Team from Luzon (Outside Metro Manila)

Best Team from the Visayas

Best Team from Mindanao


Top Ten Teams (Over-All)

Top Ten Schools (Over-All)

Top Five Schools From the Philippines


Best Coach (Over-All)

Best Coach From the Philippines

Dr. Rafael Saldaña
Contest Director
2009 ACM ICPC Asia Manila Onsite Contest

.

ACM ICPC Asia Manila 2009: Computer Environment

.
Link to blog post:

ACM International Collegiate Programming Contest (ICPC)

Asia Manila Regional Onsite Contest

October 22 - 23, 2009

Ateneo de Manila University, Philippines

Sponsored by IBM

Website: http://www.math.admu.edu.ph/acm

COMPUTER ENVIRONMENT

(Final version, as of 16 October 2009)

Hardware

Pentium 4, 2.26 Ghz

1 G RAM

10 G Hard Disk

ATX type casing

15" CRT Monitor

Logitech US 104 Keyboard

A4 Tech Optical Mouse

Operating Systems and Tools

Ubuntu 8.04

Java 1.6.0_07

GCC 4.2.3

gedit text editor

Eclipse 3.2.2 (for C/C++ and Java)

Contest Software: PC2 ver. 9.1.3

.

ACM ICPC Asia Manila 2009: Team Notebooks

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-2009-team-notebooks.html

2009 ACM International Collegiate Programming Contest (ICPC)
Asia Manila Regional Onsite Contest
October 22 - 23, 2009
Ateneo de Manila University
Website: http://www.math.admu.edu.ph/acm

Rules on Team Notebooks
(as of October 16, 2009)

A team is allowed to bring into the contest area, three copies of a team notebook, one copy for each contestant.

The notebook must be a three-ring binder that can hold 8.5" x 11" letter-size pages. Each notebook should have the name of the school and the name of the team prominently indicated on its front cover.

The notebook must have four sections, each section starting with a tabbed divider, labeled

NOTES, HANDOUTS, REFERENCE, and WORK.

NOTES -- contains at most four (4) pages of single-sided hand-written notes.

HANDOUTS -- contains only those handouts provided by the Asia-Manila ICPC staff. These handouts may include hand-written comments and corrections.

REFERENCE -- contains up to twenty-five pages of printed notes, single spaced, in 12 point font of the team's choice, with one-inch margins on all sides. These notes must be the same for all three members of the team.

WORK -- contains a reasonable number, but not more than 100 pages, of blank bond paper and graphing paper, all letter-size, for the team member to use as scratch papers during the contest.
The notebook may have a plastic pouch containing pencils, pens, erasers, ruler, compass, protractor, and triangles.

The team members may not bring a calculator to the contest.

Each team member may bring a dictionary for translation purposes. The only marking allowed on the dictionary is the identity of the owner.


Clarification (issued on Oct. 18, 2009): A page is defined as one side of a bond paper. So one bond paper with a back-to-back print is considered two pages.

Dr. Rafael Saldaña
Contest Director
2009 ACM ICPC Asia Manila Onsite Contest

.

ACM ICPC Asia Manila 2009: Regional Rules

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-regional.html

2009 ACM International Collegiate Programming Contest (ICPC)
Asia Manila Regional Onsite Contest
October 22 - 23, 2009
Ateneo de Manila University
Sponsored by IBM

Website: http://www.math.admu.edu.ph/acm


To All Concerned (Coaches and Participants):

Please take time to read the ACM ICPC 2009 Regional Rules.

Below is the link:

http://cm.baylor.edu/ICPCWiki/Wiki.jsp?page=Regional%20Rules

Before the contest, coaches (or their official representative) will be asked to sign a document that they have read the 2009 ACM ICPC Regional Contest Rules and their teams shall abide by the rules of the contest.

Failure to follow the contest rules will be a ground for disqualification.

Thank you.


Dr. Rafael Saldaña
Contest Director
2009 ACM ICPC Asia Manila Onsite Contest

.

ACM ICPC Asia Manila 2009: Contest Venue / Program

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/acm-icpc-asia-manila-2009-contest-venue.html

Vicinity Map of Ateneo de Manila University in Katipunan Avenue, Loyola Heights, Quezon City, Philippines (Map courtesy of maps.google.com).

Detailed Map: http://www.ateneo.edu/map/ls-map.htm

.

2009 ACM International Collegiate Programming Contest (ICPC)

Asia Manila Regional Contest / 3rd Philippine National Programming Competition

October 22 - 23, 2009

Ateneo de Manila University, Philippines

.

Sponsored by IBM

.

Hosted by Ateneo de Manila University (ADMU)

.

Organized by: Ateneo Grid and High Performance Computing Group
.

in cooperation with the following organizations:

.

Computing Society of the Philippines (CSP)

.

DISCS, Ateneo de Manila University

.

Computer Society of the Ateneo (COMPSAT)

.

PROGRAM

.

Day 1, Thursday, October 22, 2009

.

10:00 a.m - 12:00 noon REGISTRATION/ PICTURE TAKING

Venue: SOM 111 (Ching Tan Room)

.

12:00 - 2:00 p.m. WELCOME LUNCH/ OPENING SESSION

Blue and Gold Cafeteria, 2nd Floor, Gonzaga Bldg.

.

2:00 - 4:00 p.m. PRACTICE SESSION

CTC Bldg.

ACM ICPC Coaches' Forum

Sharing of Experiences in Coaching ACM ICPC Teams

SOM 111

.

4:00 - 5:30 p.m. Merienda/'Cocktails'

.

Day 2, Friday, October 23, 2009

8:30 - 9:00 a.m. Assembly

CTC Bldg.

.

9:00 a.m. - 2:00 p.m. Contest Proper

CTC Bldg.

ACM ICPC Coaches' Forum

SOM 111

.

2:00 - 4:00 p.m. CLOSING LUNCH/ AWARDING SESSION

Blue and Gold Cafeteria, 2nd Floor, Gonzaga Bldg.

.

For more information, contact:

.

Rafael P. Saldaña, Ph.D.

Contest Director

Asia Programming Contest - Manila Site

Rm. 317, SEC Bld. A

School of Science and Engineering

Ateneo de Manila University

Loyola Heights, Quezon City 1108

PHILIPPINES Tel. +63 2 4266125 Fax. +63 2 4266126

Mobile: +63 928 5043121

E-mails: rsaldana@ateneo.edu

raffysaldana@gmail.com

Website: http://www.math.admu.edu.ph/acm

.

Workshop on Advanced Geographical Information System (GIS) and Satellite Information for Development in Asia

.

Caption: Dr. Rafael Saldaña (center) is shown together with co-participants in the Workshop on Using Advanced Geographic Information System (GIS) and Satellite Information for Development in Asia, 12 October 2009. (From the photo collection of Raffy Saldana, http://raffysaldana.blogspot.com)

Link to blog post: http://raffysaldana.blogspot.com/2009/10/workshop-on-advanced-geographical.html

WORKSHOP ON USING ADVANCED GEOGRAPHICAL INFORMATION SYSTEM (GIS) AND SATELLITE INFORMATION FOR DEVELOPMENT IN ASIA

Organized by

Cabinet Office of the Goverment of Japan

University of Tokyo

Asian Development Bank (ADB), and

Asian Development Bank Institute (ADBI)

at ADB HQ Auditorium A

Metro Manila, Philippines

on 12 October 2009 (Monday)

The rapid technological progress of next-generation geographical information system (NEX-GIS) and satellite technology has presented unlimited and unique opportunities in development projects. For example, surveying and remote sensing by Next-GIS and satellites can drastically reduce risks, costs and human hardships in conducting feasible studies of, designing, and implementing large and complicated projects, projects requiring integration of resources, projects in conflict-zones, and environmentally sensitive projects.

Top researchers, experts and practicioners on GIS and satellites from Japan, and other partners such as the United Nations Economic and Social Commission for Asia and the Pacific (UNESCAP), shared their state-of-the-art technology and experiences. They discussed with ADB experts on how the technology would be used in facilitating the implementation of ADB projects in fields. The workshop will benefited all, including those who are engaged in project preparation, implementation and evaluation.

.

2009 ACM ICPC Asia Manila Regional Contest: Partial List of Participating Teams

.
Link to blog post: http://raffysaldana.blogspot.com/2009/10/view-team-detail.html

2009 ACM ICPC Asia Manila Regional Site Contes
October 22 -23, 2009
Hosted by: Ateneo de Manila University


Partial List of Participating Teams
As of Wednesday, 7 October 2009

TEAM NAME / COACH / INSTITUTION

1. Cookies and Cream
Mallonga-Nisperos, Sheila Dawn
Ateneo de Davao University

2. Bureau of Immoral Robbers
Diy, Walfrido David
Ateneo de Manila University

3. Defiant Legends
Diy, Walfrido David
Ateneo de Manila University

4. ADNU-Faber
Martinez, Joshua
Ateneo de Naga University

5. ADNU-Ignatius
Martinez, Joshua
Ateneo de Naga University

6. ADNU-Xavier
Martinez, Joshua
Ateneo de Naga University

7. ADZU Eagles
Dulaca, Ryan Ciriaco
Ateneo de Zamboanga University

8. ADZU Griffins
Dulaca Ryan Ciriaco
Ateneo de Zamboanga University

9. FEUEAC 1
Metra Enrique
FEU-East Asia College

10. FEUEAC 2
Metra Enrique
FEU-East Asia College

11. FEUEAC 3
Metra Enrique
FEU-East Asia College

12. FEUEAC 4
Metra, Enrique
FEU-East Asia College

13. FEUEAC 5
Metra, Enrique
FEU-East Asia College

14. FU TOAD
AnhDung, Huynh
FPT University

15. HCMUS-Passion
Dang Nguyen, Duc Tien
Ho Chi Minh City University of Science

16. HKUST_Ironhide
Yi, Ke
Hong Kong University of Science and Technology


17. NUSSOC1
Halim, Steven
National University of Singapore

18. Larva
YunFu, SHEN
Shanghai University

19. SCAU_Bumblebee
Liu, Caixing
South China Agricultural University

20. UA&P - A
Cruz, Rey Vincenzo
University of Asia and the Pacific.

21. UA&P - B
Cruz, Rey Vincenzo
University of Asia and the Pacific

22. Far
Chan, Ho Leung
University of Hong Kong

23. longlonglong
Chan, Ho Leung
University of Hong Kong

24. Temp
Chan, Ho Leung
University of Hong Kong

26. Thunder
Chan, Ho Leung
University of Hong Kong

26. UIT
Quoc, Trinh Son
University of Information Technology - Vietnam National University HCM

27. UE-CCSS CYBERLEKATZ
Bana Arne
University of the East

28. ARK
Barrios, Exander
University of the Immac..University of the Immaculate Conception


29. Mga SOGO ni E.T.
Nemenzo Fidel
University of the Phili..University of the Philippines - Diliman

30. SOGO 82
Nemenzo Fidel
University of the Phili..University of the Philippines - Diliman

31. 2 young 2 SOGO
Nemenzo Fidel
University of the Phili..University of the Philippines - Diliman

32. SOGO wag p0h!
Nemenzo Fidel
University of the Phili..University of the Philippines - Diliman

33. SOGO Virgins
Nemenzo Fidel
University of the Phili..University of the Philippines - Diliman


34. Laking SOGO
Nemenzo Fidel
University of the Phili..University of the Philippines - Diliman

35. SOGOng long ong moy poso
Nemenzo Fidel
University of the Phili..University of the Philippines - Diliman


36. De La Salle University 1
Ap-apid Rigan
De La Salle University

37. De La Salle University 2
Ap-apid Rigan
De La Salle University

38. De La Salle University 3
Ap-apid Rigan
De La Salle University

39. De La Salle University 4
Ap-apid Rigan
De La Salle University

40. De La Salle University 5
Ap-apid Rigan
De La Salle University

41. FEUEAC 1 - National
Metra Enrique
FEU-East Asia College

42. FEUEAC 2 - National
Metra Enrique
FEU-East Asia College

43. FEUEAC 3 - National
Metra Enrique
FEU-East Asia College

44. FEUEAC 4 - National
Metra Enrique
FEU-East Asia College

45. FEUEAC 5 - National
Metra Enrique
FEU-East Asia College

46. JOSE MOURINHO
AnhDung Huynh
FPT University

47. PSU - Computer Science
Tan Freya
Palawan State University

48. SLU CICS T1
Montes Carlos Ben
Saint Louis University

49. SPCBA Tigers
Ordoño Zyra Mae
San Pedro College of Bu..San Pedro College of Business Administration

50. UA&P - 1
Cruz Rey Vincenzo
University of Asia and ..University of Asia and the Pacific

51. UA&P - 2
Cruz Rey Vincenzo
University of Asia and ..University of Asia and the Pacific

52. You I See
Barrios Exander
University of the Immaculate Conception

53. UP Firefox 1
Zuniga Philip
University of the Phili..University of the Philippines - Diliman

54. UP Firefox 2
Zuniga Philip
University of the Phili..University of the Philippines - Diliman

55. UP Firefox 3
Zuniga Philip
University of the Phili..University of the Philippines - Diliman

56. Crusader
Fernandez Harriet
Xavier University - Ateneo de Cagayan

PLUS:

3 teams from Ateneo de Manila University
1 team from Cebu Institute of Technology
2 teams from Technological University of the Philippines
1 team from U.P. Los Banos
1 team from U.P. Manila
3 teams from Asia Pacific College

TOTAL: 67 Teams

Workshop on Economic Modeling (Evolutionary Trade), Agent-Based Modeling and Grid Computing (Asian Development Bank) October 7 - 9, 2009

.
Link to this blog post: http://raffysaldana.blogspot.com/2009/10/workshop-on-economic-modeling.html

Caption: Prof. Joshua Epstein of Brookings Institution, Washington, D.C., USA is the main resource person during the Workshop. Link: http://www.brookings.edu/experts/epsteinj.aspx

WORKSHOP ON ECONOMIC MODELING (EVOLUTIONARY TRADE),

AGENT-BASED MODELING, AND GRID COMPUTING

(Workshop on South Asia Strategic Framework for Aid for Trade Road Map)
Auditorium Zone D, Asian Development Bank Headquarters, Manila, Philippines
7–9 October 2009

PROGRAM

DAY 1 Wednesday, 7 October

08:30 Coffee and Registration

09:00-09:15 Introduction:

Welcome Remarks

Ashok Sharma, Director, Financial Sector Public Management and Trade
Division (SAFM), South Asia Department (SARD), Asian Development Bank (ADB)

Review of Agenda
Hans-Peter Brunner, Senior Economist (Trade), SAFM, SARD, ADB

09:15 The Eastern South Asia Economic Map on Diva
[Ongoing GIS work and experts]
Rafael Saldaña, Consultant, ADB // Associate Professor, Ateneo de Manila University

10:00 Presentation: Millennium Development Goals and ADB's Strategy 2020
Shiladitya Chatterjee, Advisor, Office of the Director General, Strategy and Policy
Department (SPD), ADB

Coffee break

10:45 Presentation: Results Based Management at ADB
[How can development results from Aid for Trade interventions be linked to ADB's development indicator system?]

Walter Kolkma, Principal Resource Management Specialist, Results
Management Unit, SPD, ADB 2

11:15 Presentation: South Asia Regional Cooperation Strategy
Bruno Carrasco, Director, Country Coordination and Regional Cooperation Division, SARD, ADB

12.15 Lunch at PDR2 hosted by Ashok Sharma, Director, SAFM, SARD, ADB

02:00 Getting Results: Mapping and Modeling Malaria in Africa
[Case study and demonstration, and how the work in Africa is relevant for ADB]
Dr. Nicolas Maire, Swiss Tropical Institute, Switzerland

Coffee break

03:00 ADB Computing Resources – What can ADB usefully provide for the team? Radhakrishnan Srinivasan, Principal IST Specialist (Enterprise Architect), Office of Information Systems and Technology, ADB

04:00 Volunteer Grid Application – Set-up Possibilities for the Strategic Project
[so team work can begin in earnest over long distances]
Dr. Simon Lin, Academia Sinica, Taiwan

DAY 2 Thursday, 8 October

09:00 Grafting Numeric Model on Logic Algorithm
[This will outline the necessary key elements of a regional mathematical representation of the relevant sector economy]
Rafael Saldaña and Hans-Peter Brunner

Coffee break

10:30 An Agent-Based Model for Trade and Development
[This will explain what agent based models can achieve better than conventional model efforts]
Prof. Joshua Epstein, The Brookings Institution, United States

The NECSI-MIT Approach to Models – What can we learn?
[Review of materials]
Hans-Peter Brunner

12:30 Lunch

02:00 Value Chain Examples in Bangladesh, Northeastern India, and Nepal
[Summary of approach, product selection, and linkage to impact model efforts across the region]
Atdhe Veliu, Global Development Solutions, LLC, United States

Break-off time

Dinner arrangement

DAY 3 Friday, 9 October

09:00 Technical Review of the Inception Report
[Key requirements and content for delivery by 5 November 2009]

Coffee break

10:00 Resource Allocation and Refined Work Plan under the R-PATA 7248
[Making the project work]

12:00 Lunch

02:00 Setting-up Grid Computing for the Project?
Discussion about data collection efforts and coordination with the field
[How do we insure we get reliable and informative impact results from the exercise for ADB?]

Break-off time

High-level Presentations of Eminent Resource Persons

Prof. Joshua Epstein and Dr. Nicolas Maire

.