Matrix Multiplication
Matrix multiplication could be useful to solve some problems. For example, what is the last digit of 1,000,000,000th fibonacci? Calculating fibonacci number using dynamic programming will need O(n) time complexity, we need a faster one to solve this problem.
ICPC Indonesia National Contest 2009
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:
BNPCHS 2009 - Final Round
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:
BNPCHS 2009 - Qualification Round
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.
Daftar finalis dapat dilihat di sini.
Training Session 2009 (for beginner)
Good news from compscidept! Here is the invitation for ACM-ICPC Training Session for new students in BINUS (new to programming contest and ACM-ICPC, not necessarily a new/first year student). If you’re interested, send me an email including:
|
1. Student ID (NIM) 2. Full name 3. Email address 4. Major (jurusan) 5. Regular course schedule (jadwal kuliah) 6. Last GPA 7. Grade for these subjects (if there’s any): [ - ] Algoritma dan Pemrograman [ - ] Struktur Data [ - ] Perancangan dan Analisis Algoritma |
 click the image if you can’t read it |
As usual, there won’t be any entrance test but you should already know how to code because we’re not going to teach you how to write a loop or to create an array in C/C++. BTW, I am in charge with the registration but not with the training. You will be trained by Ricky Winata, 3rd place winner from local team of ACM-ICPC Jakarta 2008. He is smart.
