Suhendry’s Blog

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.

Read the rest of this entry »

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.

Read the rest of this entry »

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 »

…since the last time I posted something in this blog. Let me update some information:

Officially Ended
Since December 2008, I am no longer a staff of BINUS University, my contract has ended and I decided not to extend it. I realized that only a few people know about this, so I think I should make an announcement otherwise many people will think that I still work there. Although I’m no longer a staff, I still have some classes to teach as a part-time lecturer. Currently, I’m teaching two classes, 02PDT and 02PWT of T0026 (Data Structure).

ACM Training in BINUS
Yes, I’m still in charge with this task, but I will gradually decrease my role here. I know that I’m not a good coach, so it is the time to find a better one (and I think they’ve found one ;-)).

Training session for old students will start today:
Thursday, 15:20 - 19:00, Anggrek 722 (yes… the room that we usually borrow from software laboratory).
Saturday, 13:20 - 17:00, Anggrek 722.

I don’t know how long will this session last. If I’m not mistaken, BINUS only ask me to teach Pandemonium and prepare them for World Final, which will end in April. So, let us see what is going to happen…

For newcomer, those who has no experience in programming contest and not familiar with ACM-ICPC, there will be a training session for you in April with Ricky Winata and Felix Jingga as the trainer (I’ll join them only as advisor), don’t worry, their skill is more than enough to teach you. BTW, don’t ask me why it’s April and not March, the decision is no longer with me. Just wait for the announcement.

My Activity (aside from mentioned above)
Preparing for my TOEFL and GRE (…where has my confidence gone?). Exploring another field of computer science (they’re interesting!).

ZJU 3077 - Move to Baggage Office

There are N item to be moved and you have initial strength S. Each item has three properties, v_i - the value of this item, a_i - the strength cost to move this item, b_i - the strength you will regain after moving this item. Your strength should be at least a_i to move the i^th item.

You maybe unable to move all items, so you want to find the maximum value that you can gain.

Read the rest of this entry »