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.
ABS and MAX
Good morning! It’s 5:32 and I haven’t slept yet, not because that I can’t sleep, but there is an interesting problem that I like to work on (though it’s not important at all!).
1. Write ABS function which takes an integer N as input and return the absolute value of N. Your function should be one-liner (one statement) and may contain only +, -, *, /, (, ), numbers, and variable (ie. N). You’re not allowed to call any other functions (including built-in functions).
2. Write MAX function which takes two integers A and B as input and return the largest value between A and B. Your function should also be one-liner and may contain only +, -, *, /, (, ), numbers, and variables (ie. A and B). You’re allowed only to call one function: ABS.
First Training Day
Feb 28 was the first day of our new training session, but the number of attendance was quite astonishing: one (marcadian). It was expected though considering the announcement was made only the day before. I can’t help but feel pathetic, why should I spend my beautiful weekend with a guy? Yet, I was lucky he’s not a gay… or not yet (someone please tell me)? There was another student came in the middle of the training hour (jeff), be he went home soon…
Warm-up problems:
PKU 2236 - Wireless Network
PKU 2761 - Feed the dogs
PKU 3419 - Difference Is Beautiful
PKU 3421 - X-factor Chains
Spoiler Ahead!
Read the rest of this entry »
