Added an old event.

This commit is contained in:
Stefanus Du Toit 2002-04-16 00:22:14 +00:00
parent 728a179a2c
commit 79070d3725
1 changed files with 45 additions and 0 deletions

View File

@ -203,4 +203,49 @@ href="">James Morrison</a>.</p>
<p>Any <a HREF="nntp://">comments</a> from <a HREF="">the newsgroup</a> are welcome.</p>
<eventitem date="2001-06-02" time="10:30 AM" room="MC3006"
title="ACM-Style programming contest">
<short>Practice for the ACM international programming
<p>Our ACM-Style practice contests involve answering five questions in three
hours. Solutions are written in Pascal, C or C++. Seven years in a row,
Waterloo's teams have been in the top ten at the world finals.
For more information, see
<a HREF="">the contest web page</a>.</p>
<h3>Easy Question:</h3>
<p>A palindrome is a sequence of letters that reads the same backwards and
forwards, such as ``Madam, I'm Adam'' (note that case doesn't matter and
only letters are important). Your task is to find the longest palindrome in
a line of text (if there is a tie, print the leftmost one).</p>
Input: Output:
asfgjh12dsfgg kj0ab12321BA wdDwkj abBA
abcbabCdcbaqwerewq abCdcba
<h3>Hard Question:</h3>
<p>An anagram is a word formed by reordering the letters of another word.
Find all sets of anagrams that exist within a large dictionary. The
input will be a sorted list of words (up to 4000 words), one per line.
Output each set of anagrams on a separate line. Each set should be
in alphabetical order, and all lines of sets should be in alphabetical
order. A word with no anagrams is a set of anagrams itself, and should
be displayed with no modifications.</p>
Input: Output:
post post pots stop
pots start