Assalamualaikum everyone. Its been awhile since I did a written analysis instead of a video or straight up, not doing it at all. Although recording a video is much more convenient that writing a blog, nothing beats creating a well authored blog post. That, and also the fact I did not finish this round, resulted in this post, albeit, late, because it takes time to type down these things.
Anyway, Round 14 is the second round after the last round which IIUM’s DSA student is scored for participation. Additionally, its kinda exam period for IIUM student… so… we are seeing a much lower participation, even after including participant from Hebron University, Palestine. In fact, looking at the ranking list, 6 out of 10 participant actually came from Hebron! If they did not participate, we would be looking at only 4 participant!
Last Saturday, the 6th round of Code Knights was held, with a total of….. 17 participants. Same as last round, which is also the same as the round before. This round is significantly harder than the last round, which was the easiest round by far.
How hard? Well.. if you compare it to Round 3, its.. OK-lah. The winner for this round goes to anas_95 from IIUM, who also won last round. anas_95 was the only participant who manage to solve 4 problems, but he did not solve problem D. It’s nice to see someone from IIUM winning again, but its starting to get boring. Can someone else win next time? stdLn maybe? Heck, I’m even waiting for lim2481284 to make a comeback.
Last saturday, Code Knights Round 5 was held with a total of 17 participant… which is pretty much the same with round 4. The winner (finally…) goes to anas_95 from IIUM by the virtue of answering all problems faster with less penalty (which is 0). This round is (unfortunately) the easiest round ever with 6 participant answering all problems.
The second place goes to UncleWong from UM and the third place goes to joscmw95 from UTAR. foreveralone, winner of round 4 is at the fourth place. Notable mention includes two time winner lim2481284 from UNITEN which continues his effort of not even trying. You can find the dataset and pdf through the link below:
Last Saturday 8 PM (as usual), Code Knights Round 4 was held at… online. This time, we have 17 contestant including several new participant from UM, UTAR, UKM and others. lim2481284, the winner of the last 2 round seems to have lost his edge, finishing at the 14th place. He is probably busy and have other stuff to do. Meanwhile, shahril, the consistent second-finisher did not participate this time, breaking his consistent-second-place record from the first round and leaving HarshRalph to represent UiTM. The winner for this round goes to a newcomer, foreveralone from UM. He is a newcomer in a sense that he just registered in Code Knights, but not in the sense that he is new in competitive programming. Interestingly joscmw95 actually solved all problem first, but he submitted more wrong submission than foreveralone, resulting in an extra 13 minute penalty compared to foreveralone (each score point is approximately 1 minutes).
As you can see in the scoreboard, all problem was solved. Unfortunately, no single question was solved by everyone. Three participant managed to solve all 5 problems. All of these three participant are new participant. The difficulty of the problems this time seems to be more towards the easy side, but then again, if foreveralone, joscmw95 and UncleWong did not participate, (remember, they were new participant) no one would solve all 5 problems… except for lim2481284 or shahril (if they actually participate). In terms of balance, we probably need to work on making the difficulty ‘spread out’ more. Additionally, there were some issues with problem C and D.
The problemset can be downloaded through the link above. As usual, for IIUM student, the problems can also be accessed from the IIUM ICPC Team codeforces group. Now, if only they would actually practice, that would be great…. On to the problem analysis!
Last Saturday night, the Code Knights Round 3 was held at 8:00 pm on 16th July and lasted for 4 hours. This time the round had 5 problems to solve and a bit tougher than the previous ones (Round 1 & Round 2).
Needless to say, the participants did well. The winner of this round is lim2481284 from uniten university who managed to solve 3 problems. Shahril from uitm managed also to solve 3 problems as well, both of them solved A, B and C. However, Shahril was not as fast as lim2481284 and therefore scored the second place. StdLn solved 2 problems, interesting enough he is the only one who solved problem E. It is also interesting to see Foinni who haven’t solved any problem before the freezing of the scoreboard, yet he managed to solve 2 problems in the last hour of the contest rendering him in the fifth place.
Update: Announcement on next round is available here
Last Saturday (2nd July), the second Code Knights was held from 10 PM to 2 AM. The winner goes to lim2481284 from UNITEN who quite handily solve all 4 questions. shahril and HarshRalph also solve all 4 questions, but not nearly as early as lim.
Congratulation to Lim Kien Seng from UNITEN. All participant managed to solve problem A and D. You can download the dataset through the following link:
Update: Announcement on round 2 is up. See here for details.
Last Saturday, the first round of Code Knights was held from 10 PM to 2 AM. We received 18 registration, however only 8 participated likely due to miscommunication of the contest time. The following are the final scoreboard of the round.
Congratulation to Omar Salim from IIUM who won the first round and is the only participant who manage to solve the ‘Fix the Fence’ problem in time. All participant managed to solve the FizzBuzz problem and most participant answered Yeoh’s Parking. You can download the dataset through the following link:
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.