Assalamualaikum guys. In this post, I’ll discuss on the question given on IIUM Code Jam 2016. The commentary for the questions are from the question author (Zarir, Ayesha and Amjad) with some addition from me. Overall, compared to IIUM Code Jam 2015, the questions in IIUM Code Jam 2016 was much more balanced. There are less very easy question but there are less very hard question too. This is reflected in the ranking which shows a typical ACM-ICPC scoreboard.
Assalamualaikum guys. In this post I’ll discuss on the problem given in IIUM Code Jam 2016 Mock Contest. The questions in the mock contest is meant to be educational. Therefore, the harder question mainly have some ‘tricks’ and ‘quirks’ which are common on an actual ACM-ICPC competition. The question also have explanation or hint on how to solve the problems. Four of the question are made by me (Ashraf) and the last one is made by Bro. Amjad. You can download the dataset through the link below. The dataset uses the Polygon contest format, which is used in Codeforces and is compatible with our contest system.
Last Sunday, IIUM Code Jam 2016 was held at TL-E5-01. 12 local teams participated in the competition. Additionally 12 guest team from University Malaya, UniKL, UITM Shah Alam and UKM participated online.
This 3rd April, ICTSS Education Bureau together with Electrical Engineering Student’s Association (ECESA) is organizing the second IIUM Code Jam. This time around, there would be 8 problem to be solved in 3 hour. In case you don’t know what is IIUM Code Jam, IIUM Code Jam is basically a competitive programming competition modeled after the ACM-ICPC (International Collegiate Programming Contest). In this contest, teams of 3 will compete against each other in a contest that test their problem solving and programming skill. Each team will be given 8 problems of varying difficulties in which they will have to solve through programming. The team that solve most problem win.
Assalamualaikum everyone. On 19th April 2015, IIUM hosted the Malaysia Computing Olympiad 2015. MCO is basically the IOI (International Olympiad Informatics) for Malaysia. And IOI is basically ACM-ICPC for high school student. The format are also a bit different compared to ACM ICPC. In IOI, they contestant compete individually instead of in teams. Also, in IOI they are given 5 problems and 3 hours 2 days to solve. And instead of a ‘Yes/No’ verdict, they have 3 ‘levels’ of correctness (‘sub-tasks’ to be more precise). For example, if they use a naive method, the may pass first level. But not the other 2 level. If they manage to make an efficient solution, then they may pass all the ‘level’. These are the question given on MCO 2015.
Assalamualaikum everyone. In this post I’ll discuss on the problem given in IIUM Code Jam 2015. I’ve uploaded the dataset, which is basically the questions along with the hidden input/output and sample solutions.
Assalamualaikum everyone. IIUM Code Jam is just around the corner and we think that it is best if we give out some practice set. For this practice, we are going to use an online platform that we commonly use to train for an actual ACM ICPC. Its basically an online contest. However, the question that we set are very easy to cater for those who are really new competitive programming. Or in another word, those who are joining the IIUM Code Jam just for the fun of it. In fact, in this post, I’ll be discussing on the answers for the question. However, you should try it yourself first. The contest is available through the link below. The password is “redjam”.