Suhendry’s Blog

Tadaaa!!

I decided to write this write up because of Felix Halim. He has set his IM status to “SUSU BLOG!!” for almost one year (man.. he’s so persistent), and I got annoyed everytime I online and saw my IM list. Not to mention Ilham who sometimes buzz me just to remind me about this write up >.<

click image to enlarge

I haven’t writen this write up before because I’m not quite “familiar” with the problem. By “familiar” I mean not all problem have been verified and solved by me (I fallen ill and have not fully recovered when ICPC).

You can found The ICPC 2009 Jakarta Site link here, and I hope it will not be deleted. The top three teams are:
1. UESTC_floyd from University of Electronic Science and Technology of China.
2. dota from National Taiwan University.
3. Dongskar Pedongi from Institut Teknologi Bandung.

The best team from BINUS (Aeon) got 9^th rank, too bad.. hopefully we can perform better this year.

There are some problems that I don’t fully understand the solution yet. I will add any necessaray review later.

You can download the complete problemset here:
ACM-ICPC 2009 Jakarta - Problem Set (537 KB)

• Problem A - Mystic Craft
• Problem B - Top-10
• Problem C - Random Simple Polygon
• Problem D - Alien
• Problem E - A + B
• Problem F - 1:1000000000000…
• Problem G - The Puzzle Board from God
• Problem H - Hero’s Adventure
• Problem I - Spam Detection
• Problem J - Favorite Time

Thanks to all authors: Ryan Leonel Somali, Felix Halim, Ilham Winata Kurnia, Timotius Sakti, Andoko Chandra, Gunawan Lie, Surya Sujarwo and Ardian Kristanto Purnomo who have helped me prepare all the problemset, solution and testdata.

Yay! Akhirnya selesai juga write-up INC 2009, habis ini ICPC 2009! >:)

Testdata bisa didownload di sini:
INC 2009 - Testcase (ZIP - 992KB)

Pembahasan solusi bisa dilihat di sini:

• Problem A - General Election
• Problem B - Liar Game
• Problem C - Why is Math Book So Sad?
• Problem D - Noodle Team Contest
• Problem E - Palapa Number
• Problem F - New House

Problemset bisa didownload di sini:
BNPCHS 2009 Final Round - Problemset (PDF - 496KB)

Testdata bisa didownload di sini:
BNPCHS 2009 Final Round - Testcase (ZIP - 3091KB)

Pembahasan solusi bisa dilihat di sini:

• Problem A - Teks Fibonacci
• Problem B - BeSaR DaN KeCiL
• Problem C - Rentang Terbesar
• Problem D - Merakit Komputer
• Problem E - Mario Bros
• Problem F - Kaca Patri
• Problem G - Jumlah Pembagi
• Problem H - Drum Minyak Pak Ricat
• Problem I - Jumlah Pangkat
• Problem J - Ordo Keprimaan
• Medalist

Wah, bisa digebuk Felix Halim nih kalau gw ketauan publish pembahasan BNPCHS 2009 Qualification Round sebelum review INC 2009 ama ICPC 2009 Jakarta Site *kabur*.

Well anyway, Babak Penyisihan BNPCHS 2009 baru saja berlalu. Penyisihan kali ini jatuh pada hari Sabtu, 21 November 2009. Mengapa hari Sabtu? Biasanya lomba-lomba di BINUS selalu hari Minggu, tapi tanggal 22 November 2009 ada Ujian Saringan Masuk BINUS, makanya lombanya digeser ke hari Sabtu.

Babak Penyisihan terdiri dari dua tahap: Multiple Choice dan Programming. Babak Multiple Choice terdiri dari 50 soal dengan masing-masing soal bernilai 3 point, sedangkan babak Programming terdiri dari 3 soal dengan masing-masing soal bernilai minimal 70 point.

Mengenai babak multiple choice, soalnya ntar diupload belakangan, belum dirapiin.

• Problem A - Bujur Sangkar Ajaib
• Problem B - Menghitung Palindrom
• Problem C - String Prima

Daftar finalis dapat dilihat di sini.

Bina Nusantara Programming Contest for High School Students (BNPCHS) 2008

Problemset bisa didownload di sini:
BNPCHS 2008 - Problem Set (PDF - 366KB)

Test Data bisa didownload di sini:
BNPCHS 2008 - Test Data (ZIP - 2135KB)

Pembahasan solusi bisa dilihat di sini:

• Problem A - Kamus Panda
• Problem B - Barisan Panda
• Problem C - Anti Rudal
• Problem D - Kelas Bermasalah
• Problem E - Makan Sepuasnya
• Problem F - Fungsi Pak Gaus
• Problem G - Perubahan Minimal
• Problem H - Pasangan Paling “Wah”