Jun 112016
 

Babak Final ACM-ICPC 2016 Provincial Sumatra baru saja diselenggarakan pada 28 Mei 2016 yang lalu dalam rangkaian acara IdeaFuse 2016 oleh STIE-STMIK Mikroskil di Medan. Tahun ini IdeaFuse mengalami pelonjakan jumlah peserta hingga mencapai hampir dua kali lipat dengan 43 tim di babak final. Ada 10 soal yang sudah disiapkan untuk babak final dengan tingkat kesulitan yang beragam; post ini akan membahas soal-soal tersebut di halaman selanjutnya.

Pada saat penutupan IdeaFuse 2016, ada yang menghampiri saya (sepertinya coach, lupa nanya dari mana) dan bertanya apakah soal-soal kontes kali ini akan diupload ke online judge. Kebetulan Fredy Ong (ketua juri ACM-ICPC IdeaFuse 2016) ada di samping saya pada saat itu, jadi saya langsung tanyakan ke Fredy: “Fred, boleh gak diupload?”, dan langsung di-OK-in oleh Fredy. Jadi soal IdeaFuse 2016 kali ini sudah saya upload ke Jollybee Online Judge (ID 256..265); kalian bisa langsung mencoba menyelesaikan soal-soalnya di sana.


Jun 112016
 

This post is about last year contest (2015). As you might already noticed, there are no post on INC 2015 and ACM-ICPC 2015 Jakarta in this blog. The reason is … I was quite busy at that time (sorry), and by the time I have free time to do so, I already forget the details.

I’m writing this post for the sake of continuity (and completeness). Also I would like to let you know a couple of things:

  • ACM-ICPC 2015 Jakarta problems are available on ACM-ICPC Live Archieve. I guess it has been around for quite some time as I sent the data immediately after the contest. Alternatively, you can download the problemset HERE.
  • INC 2015 problemset is available to download HERE.
  • I’m not going to write any problem analysis for both INC 2015 and ACM-ICPC 2015 Jakarta in this blog.
  • You can download the problem analysis for ACM-ICPC 2015 Jakarta which was distributed to the contestants HERE.
Jun 092015
 

Untuk kedua kalinya, ACM-ICPC Provincial Sumatra kembali diselenggarakan oleh STMIK Mikroskil dalam rangkaian acara IdeaFuse 2015. Babak final kompetisi ini berlangsung di kota Medan di kampus STMIK Mikroskil, dan diikuti oleh 26 tim dari 14 perguruan tinggi (yang disaring dari ~164 tim di babak penyisihan) yang berada di pulau Sumatra dan sekitarnya.

Soal-soal tahun ini disusun oleh saya (Suhendry Effendy), Steven Halim, Yudi Umar, dan Fredy Ong. Respon dari peserta yang saya dapatkan cukup beragam, ada yang bilang soal tahun ini lebih mudah, ada juga yang bilang lebih susah. Saya pribadi melihat soal tahun ini memiliki rentang tingkat kesulitan yang lebih besar (soal mudahnya lebih mudah, soal sulitnya lebih sulit).

Soal dan pembahasan dari setiap soal di babak final dapat diikuti di halaman selanjutnya (link ada di bawah).


Dec 192014
 

The complete problemset can be downloaded from here:
ACM-ICPC 2014 Jakarta – Problem Set (3.29M)

The problems (and dataset) are also available on:
ACM-ICPC Live Archive

You can practice and submit your solution to the problem there; however, I’m not sure with the time limit setting in this live archieve (might be different to what we used in the real contest).

Please note:

If you want to comment or ask on a specific problem (A..K), please mention which problem you are refering to. This is a single blog post with multiple pages (all comments are pooled into one).

Nov 112014
 

ACM-ICPC INC 2014 – Indonesia National (Programming) Contest – was held on 9th November 2014 with more than 350 participating teams (of three students) from various universities in Indonesia. As usual, INC serves as the qualification round for teams from Indonesia who want to compete in ACM-ICPC Regional Jakarta, which this year’s will be held in December. However, unlike any previous years, Indonesian teams now have other means in order to qualify to ACM-ICPC Regional Jakarta, i.e. become the top 5 in CompFest or top 5 in ICPC Provincial Sumatra (see my previous post about this contest).

In this post, I will discuss each problem posed in the contest. There are 10 problems, from A to J. Link to each problem, along with the problem discussion, can be found on the following pages:

Or you can read my note about this contest on the last page: Notes.

If you want to comment or ask a particular problem, please mention which problem are you referring to (note that this is a single post, with multiple pages).

May 122014
 

Indonesia untuk pertama kalinya mengadakan kompetisi pemrograman ACM-ICPC provincial level (bukan regional). Kompetisi pertama ini diselenggarakan untuk lingkup Sumatera oleh STMIK-STIE Mikroskil di Medan pada 11 Mei 2014 yang lalu. Kompetisi ini dibungkus dalam rangkaian kegiatan perlombaan yang bernama IdeaFuse (penyelenggara merasa kompetisi ACM-ICPC ini tergolong baru bagi mahasiswa di Sumatera, sehingga mereka juga menyelenggarakan kompetisi lainnya untuk menjaring lebih banyak peserta dan memeriahkan suasana). Continue reading »

Nov 082013
 

You can download the complete problem set here:
ACM-ICPC 2013 Jakarta – Problem Set (3.19MB)

These problems will be available on ACM-ICPC Live Archieve so you can practice with this set there. However, I’m not sure the time and memory limit constraint in Live Archieve will be the same with one used in the contest.

  • My Note
  • Questionnaire Feedback
  • Others (winners, scoreboards, authors, etc.)
  • Aug 142013
     

    In this post I will discuss an approximation solution to the minimum vertex cover problem. Actually I have known this simple yet cool algorithm for quite some time, but yesterday I had a chance to revisit this problem again from a class that I take for this semester (CS5234), thus I decided to write a blog about this.

    Minimum vertex cover is a (well-known) problem in graph theory. Given a graph G=(V,E), a vertex cover is a set of vertices such that each edge in the graph is incident to at least one of vertex in the set, thus all edges are “covered” by that set of vertices. The set of all vertices, V, is one valid example of vertex cover. As the name suggests, the minimum vertex cover is the problem of finding a vertex cover with minimum cardinality, or in other word, the vertex cover with minimum size. This problem is NP-Hard (no known polynomial solution, unless P=NP).
    Continue reading »

    Apr 142012
     

    As mentioned in my previous post, here I will give several example of impartial game which turn out to be exactly equivalent to Nim Game.

    Nimble
    Given a line of squares labeled 0, 1, 2, …. Several coins are placed on some squares (it’s possible to have more than one coin on a single square). Two players take turns. One move consists of taking any one coin and moving it to any square to the left of it. It’s possible that the coin moved into a square already containing coins.
    Continue reading »

    Apr 092012
     

    I’ll discuss a little bit about Nim Game. Felix said that he doesn’t understand about Nim Game so he asked me to write a blog. I don’t know whether he really doesn’t understand or he is just looking for a reason to make me write.

    Nim is a two player combinatorial/mathematical game strategy. Given a number of piles which in each pile contains some numbers of stones. In each turn, player choose one pile and remove any number of stones (at least one) from that pile. In a normal play, player who cannot move is considered lose (ie., one who take the last stone is the winner). There is another variation where player who cannot move is considered as winning (misere play).
    Continue reading »