The National Olympiad in Informatics (NOI) is an annual informatics competition for secondary school students in China. The first NOI was held in 1984, earlier than IOI.

The contest consists of one practice contest and two official competitions, each involving solving problems of an algorithmic nature. Each day’s competition consists of three problems and contestants have five hours to try to solve them. Students compete on an individual basis, with up to five students competing from each participating province (with around 30 provinces in 2003). Students are selected from similar contests in their own province.

I participated in NOI 2006, 2007 and 2008; also in CTSC 2008 and APIO 2008, was among Bronze medalists all 2008 contests.

Here are some ancient Pascal code of mine for NOI 2008.

KMP Algorithm:

Min-cost Max-flow Algorithm

Max-flow Min-cut Algorithm





Finally, I share all the data I used here: