Nov 082013

### Others

**The Winners**

- 1
^{st}place:**ThanQ**from National University of Singapore (solved 8 problems). - 2
^{nd}place:**Kirino :Ρ**from National Taiwan University (solved 7 problems). - 3
^{rd}place:**Runes of Champion**from FPT University (solved 7 problems).

Scoreboard: (link)

Photos: (facebook’s link)

**Authors**

- Derianto Kusuma (PT Traveloka Indonesia)
- Felix Halim (Google, Inc.)
- Irvan Jahja (MemSQL, Inc.)
- Suhendry Effendy (National University of Singapore)
- Winardi Kurniawan (PT Wayang Force)

**Testers**

- Felix Halim (Google, Inc.)
- Risan (Facebook, Inc.)
- Suhendry Effendy (National University of Singapore)

**Honorary Judges**

- Denny (University of Indonesia)
- Hardy (STMIK Mikroskil)
- Lucky Adhie (Bandung State Polytechnic)
- Niko Ibrahim (Maranatha Christian University)
- Teddy Mantoro (Siswa Bangsa International University)

**Thanks**

- to BINUS University for hosting this prestigious contest,
- to all committes, chaired by Santy Li, for such amazing event,
- to all authors and testers who help us preparing the problems,
- to all honorary judges who help us keeping the contest fair and square,
- to all assistant judges who help us judging a lot of submissions,
- to Muhsin Sodiq, Hutomo Widjaja, and Surya Sujarwo who help us preparing the system,
- to contestants and coaches who participated in ICPC 2013 Jakarta.

are you sure there isn’t mod operation ?

and this : j = j + 1, why it isn’t j = j-1 ?

Ah, you’re right, it should be j =j – 1 (updated).

MOD operation is not needed, What we really need is whether a two substrings have a same hash value or not, not the hash value itself. There are only addition and multiplication operators, so overflowing the result doesn’t matter.

^that comment above is for pasti pas

Halo Mr. Suhendry.

Saya ingin sekali bisa berkompetisi di ACM ICPC. Saya Mahasiswa tingkat 2 di salah satu perguruan tinggi di bandung. Tapi skill koding saya tidak terlalu bagus. algoritma sorting saja masih bingung. Gimana ya kiat nya untuk belajar algoritma yg baik dan benar agar bisa nanti suatu saat ke ACM ICPC?

How to determine which prime number should be used? I tried some prime numbers and the result is not as expected.

(Problem F). Just use large prime number (larger is better, its chance to collide is smaller). I used 1000003 and it’s fine.

I have implemented it and submitted on Live Archive, but got WA 😀

Is there something wrong with my implementation? Could you please check it? http://pastebin.com/ECJX9yEa

I didn’t read your code, but it failed the first sample input: PASTIPAS.

Yes and it works if I do MOD operation, but still WA on Live Archive. Does your solution with above algorithm still work on LA? Maybe you/others have added more test cases to break that hash function? Or my implementation wrong?

I’m the one who send the data to LA and I’m pretty sure LA’s admin was quite busy to do any changes on the dataset.

BTW, I’ve just noticed an error in F’s pseudocode. There is one line which is wrong. Try to figure that out! 🙂

hint: pay attention to the rolling hash (when you do the multiplication with prime number); you might want to check other resources on rolling hash.

^ problem F Pasti Pas!

Problem H can be solved by Dynamic Programming,here I find two states,one is index of the current question,another is wrong answers used/left so far, and then minimize the answer. But this solution does not work,though sample test case gives correct output. I saw another boolean state in some accepted codes in HUST, which tries both minimizing and maximizing. Can you please explain why another state is needed here?