Added an old event.
This commit is contained in:
parent
728a179a2c
commit
79070d3725
45
events.xml
45
events.xml
|
@ -203,4 +203,49 @@ href="ja2morri@uwaterloo.ca">James Morrison</a>.</p>
|
||||||
<p>Any <a HREF="nntp://news.math.uwaterloo.ca/uw.csc/8305">comments</a> from <a HREF="news:uw.csc">the newsgroup</a> are welcome.</p>
|
<p>Any <a HREF="nntp://news.math.uwaterloo.ca/uw.csc/8305">comments</a> from <a HREF="news:uw.csc">the newsgroup</a> are welcome.</p>
|
||||||
</abstract>
|
</abstract>
|
||||||
</eventitem>
|
</eventitem>
|
||||||
|
|
||||||
|
<eventitem date="2001-06-02" time="10:30 AM" room="MC3006"
|
||||||
|
title="ACM-Style programming contest">
|
||||||
|
<short>Practice for the ACM international programming
|
||||||
|
contest</short>
|
||||||
|
<abstract>
|
||||||
|
<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="http://plg.uwaterloo.ca/~acm00/">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>
|
||||||
|
<pre>
|
||||||
|
Input: Output:
|
||||||
|
|
||||||
|
asfgjh12dsfgg kj0ab12321BA wdDwkj abBA
|
||||||
|
abcbabCdcbaqwerewq abCdcba
|
||||||
|
</pre>
|
||||||
|
|
||||||
|
<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>
|
||||||
|
|
||||||
|
<pre>
|
||||||
|
Input: Output:
|
||||||
|
|
||||||
|
post post pots stop
|
||||||
|
pots start
|
||||||
|
start
|
||||||
|
stop
|
||||||
|
</pre>
|
||||||
|
</abstract>
|
||||||
|
</eventitem>
|
||||||
|
|
||||||
|
|
||||||
</eventdefs>
|
</eventdefs>
|
||||||
|
|
Loading…
Reference in New Issue