http://algorithmics.comp.nus.edu.sg/wiki/ 2009-11-23T15:24:04+08:00 http://algorithmics.comp.nus.edu.sg/wiki/ http://algorithmics.comp.nus.edu.sg/wiki/lib/images/favicon.ico text/html 2007-12-29T09:37:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/100?rev=1198892253 See <http://acm.uva.es/p/v1/100.html> Summary Given an integer n, let the number of iterations of the 3n+1 algorithm for n be the cycle length of n. For a given range of numbers between i and j (including i and j), find the number with largest cycle length. text/html 2007-12-29T09:37:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/getting_started?rev=1198892253 This is for those who are new to the ICPC. * Register an account on the USACO site * Start solving the problems there. * Sometimes you will need to know a specific algorithm to solve a certain problem, hence you should be familiar with all the basic algorithms, otherwise try reading some of the books, online guides, etc (see Training Resources) text/html 2007-12-29T09:37:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/i-whiz_workshop?rev=1198892253 Date 14th December 2006 Time 1000 - 1300 Venue NUS, SoC1, Level 8, PCLab 1 Instructors Aaron Tan, Tok Wee Hyong, Melvin Zhang Program * Introduction to NOI * Familiarisation with the contest environment * Setting up Pascal * Setting up C/C++ * Alternative C/C++ development environment, Dev-C++ text/html 2009-11-06T01:03:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/icpc_workshop?rev=1257440613 Announcements 5 Nov 09 Our achievements for this round of regional contests: NUSSOC2 (Duc, Tien, Phong) got 2nd place in Phuket 2009 and thus advancing to World Final 2010, Harbin, China. Congratulations :) Note: NUSSOC2 also got 7th place in Jakarta 2009. text/html 2007-12-29T09:37:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/icpc_workshop_2005?rev=1198892253 Updated for workshop held in the Semester 2 holidays from May to June of 2005. We will have weekly sessions on Saturday from 10am to 12pm at SoC1 PC Lab 1. The IOI (JC and secondary school students) group have their training from 1pm onward and those who are interested can join their sessions. They will have different lecturers from SoC covering some advance topics in algorithms and data structures. text/html 2007-12-29T09:37:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/icpc_workshop_2006?rev=1198892253 Updated for the 2006/2007 season of the ACM ICPC. The materials for last years workshop can be found at ICPC Workshop 2005 The ACM Lab is located at S16-07-02. Feel free to drop by but remember to call (65166998) first. Registration * Send an email with your name, faculty/year, contact information to <melvin@comp.nus.edu.sg> * After you have registered do check the announcements for our training schedule * Follow the intructions on Getting Started text/html 2009-05-26T15:15:27+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/icpc_workshop_2007?rev=1243322127 We have come to the end of the workshop. You are welcome to continue to make use of the forum for online discussions. Training program Date Day Activity Presenter Venue Time Notes/Slides 26/05/07 Sat Briefing Sun Teck SR1 11-12pm [ Briefing slides] [ How to solve it] 26/05/07 Sat Graph I Wei Tsang SR4 1-4pm IOI WS 02/06/07 Sat Algorithm Design Discuss USACO 1.1 NA SR1 10-12pm [ Algorithm Design] Additional qns: Mobile Coins 02/06/07 Sat Graph II Martin … text/html 2009-08-03T10:10:32+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/icpc_workshop_2008?rev=1249265432 Program Date Activity Instructor Venue Time Notes/Slides Wed, 20th Aug Briefing Sun Teck - 18:00 - 19:00 Sat, 23th Aug ICPC #1 Steven Halim PL6 09:00 - 13:00 6 Problems Wed, 27th Aug ICPC #2 Bramandia PL6 18:00 - 22:00 6 Problems Sat, 30th Aug ICPC #3 Bramandia PL6 09:00 - 13:00 6 Problems + Wiki + Forum + Judge Wed, 3rd Sep Catch-up #1, #2, #3 Felix Halim PL6 18:00 - 22:00 I/O for #1,#2,#3: Sat, 6th Sep Problem Solving Melvin ES1 10:00 - 12:00 See i-… text/html 2007-12-31T11:25:41+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/ioi_assessment?rev=1199071541 Instructions * This is a CLOSED book assessment. * You are not allowed to access the Internet, except to connect to the contest server. * You may ask clarifications about the tasks in the first TWO hours of the contest. * You are only allowed to use the Linux distribution installed on the PCs to develop your solutions. text/html 2008-04-21T09:34:46+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/ioi_practice_2007?rev=1208741686 PS 3 Zi Chun Chuan Yu Wei Quan Wei Zhong Anthony Kah Hou Thomas A 100 10 75 80 30 100 100 B 100 100 90 - 50 40 20 C 10 - 100 - 20 - 10 Total 210 110 265 80 100 140 130 Selection test 1 Zi Chun Chuan Yu Wei Quan Wei Zhong Anthony Thomas Jia Han Kah Hou Jonathan Yi Sheng No Repeats 100 30 20 10 30 - 0 30 - - Weak Spot 100 30 90 - 0 - 30 0 40 - Travel Cost 20 - 20 0 30 … text/html 2008-06-25T09:49:26+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/ioi_results?rev=1214358566 text/html 2009-08-06T02:40:55+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/ioi_workshop?rev=1249497655 Announcements 08/07/09 - Student Presentation and Challenge for 29 and 31 July 09 Please read this [doc file] for details. --- Steven 08/07/09 - Write-Ups and Attendance All 14 trainees (not just the top-4) are invited to continue IOI training in NUS. Please take a look at the schedule (the topics are more advanced) for July and early August sessions. If you need to be excused from school lessons, drop an email to Steven. text/html 2009-05-28T15:48:39+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/ioi_workshop_2003?rev=1243496919 IOI trainees Foo Chuan Yu Sec 4 HCI Yang Zeqi Sec 4 HCI Koh Pang Wei JC 1 RJC Loh Bo Huai, Victor JC 2 VJC Yee Jonathan Sec 3 RI Koh Zi Chun JC 1 HCI Lim Zhuo Min JC 1 HCI Yeang Xian Wei Sec 4 HCI Training Program Date Activity Instructor Venue Time Notes/Slides 14/05/05(S) Overview of algorithmic paradigms Hon Wai SR4 1-6pm Training Program Date Activity Instructor Venue Time Notes/Slides 09/05/08(S) - Aaron, etc PL4 1-6pm Training Program … text/html 2008-05-20T14:18:09+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/ioi_workshop_2006?rev=1211264289 Updated for IOI 2006. The materials for previous workshops can be found at www.comp.nus.edu.sg/~tantc/ioi_training Problems from past OIs can be found at * International Olympiad in Informatics 2001 - 2008 * Central-European Olympiad in Informatics 2002 - 2007 * Baltic Olympiad in Informatics 2000 - 2007 * Balkan Olympiad in Informatics 1997 - 2005 * Croatian Olympiad in Informatics 2001 - 2006 text/html 2008-06-12T13:54:03+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/ioi_workshop_2007?rev=1213250043 Announcements 20/05/07 Archived old page and updated training schedule. --- Melvin Training program (tentative) Date Activity Presenter Venue Time Notes/Slides 12/05/07(S) Take part in APIO - PCLab1 9:30am-3pm [ APIO briefing] Problem set 19/05/07(S) Data structures Colin SR4 1-4pm 21/05/07 Attempt PS1: BtOI 06 Day 1 - - - Tasks [ test data] 26/05/07(S) Graph I Wei Tsang SR4 1-4pm [ Graph I] 26/05/07 Attempt PS2: BtOI 06 Day 2 - - - Tasks [ test data]… text/html 2009-05-26T15:15:27+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/ioi_workshop_2008?rev=1243322127 Announcements 29/05/08 Updated schedule. --- Melvin 21/05/08 Started a new page for 2008. --- Melvin Training program Date Activity Instructor Venue Time Notes/Slides 10/05/08(S) Take part in APIO Sun Teck PCLab1 1-6pm [Briefing slides] [APIO tasks] 28/05/08(W) Intro, PS0, discuss PS0 and APIO 2008 Aaron, Melvin SR5, PL3 1-3:30pm Test data Reports 30/05/08(F) PS1, discuss PS1 Jing Quan PL6 1-3:30pm Test data Reports 30/05-04/06 PS2 Liyong Online Test d… text/html 2007-12-29T09:37:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/meeting05?rev=1198892253 Date April 1, 2006 Scribe Zheng Jia Waclaw Each triangle leans on * three sibling triangles, if it lies at the center * one sibling triangle + triangles its parent leans on (on the same side), if it lies on the border Toplist Compute songs that may only appear within top i. Call such songs TOP(i). If TOP(i) and TOP(i+1) differ only by one song, and |TOP(i)| = i, TOP(i+1) - TOP(i) must contain only the song with ranking i+1 text/html 2007-12-29T09:37:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/practice_sessions?rev=1198892253 After each session, please record down the information in the format shown below. * Under “Members present” use parenthesis to indicate the groupings used in team training, if that session was an individual session no parenthesis is needed. * “Problems attempted” refers to the problems which you have tried to solve but were unable to get the correct solution, for each such problem assign a member to continue to work on it after the session. For each problem, if it was solved brief… text/html 2009-05-27T10:50:32+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/resources?rev=1243392632 Most of the learning and training is carried out at an individual level, this is to be expected since programming is something that needs lots of practice. We also provide a series of short training workshops during the semester 2 holidays. Online Resources The following are some online resources which you might find to be useful: text/html 2009-09-21T23:17:57+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/solution_for_tutorial_swapping?rev=1253546277 Construct a graph `G = (V, E)` as follows. The set of vertices, `V`, are the students. If student `A` can give his slot to student `B` to satisfy student `B`, then add the edge `(A,B)` to `E`. We can reduce the problem to one of finding a covering of as many vertices as possible using directed cycles. text/html 2007-12-29T09:37:33+08:00 http://algorithmics.comp.nus.edu.sg/wiki/training/usaco_progress?rev=1198892253 Name Section Date updated Roopak 3.4 13/05/06 Li Jie 3.2 03/06/06 Wei Kun 2.2 03/06/06 Ayush Kohli 2.2 03/06/06 Qin Yan 2.1 03/06/06 Naef 1.4 03/06/06 Anshul 1.1 27/05/06 Balaji 1.1 13/05/06 Quoc Thinh 1.1 13/05/06 Xiao Hui 1.1 13/05/06