DSA Homework 4 - Revizia istoricului

Rhobincu: /* Requirement */

2014-04-10T21:48:39Z

Requirement

Rhobincu: /* Restrictions */

2014-04-10T21:48:08Z

Restrictions

Rhobincu: /* Word Count */

2014-04-10T21:45:54Z

Word Count

Rhobincu: /* Word Count */

2014-04-10T21:45:27Z

Word Count

Rhobincu: Pagină nouă: = Word Count = Little John is learning mandarin. In order to help him look for words in a dictionary, he needs to make a list of all the new words he's encountering as he's reading a...

2014-04-10T21:45:08Z

Pagină nouă: = Word Count = Little John is learning mandarin. In order to help him look for words in a dictionary, he needs to make a list of all the new words he's encountering as he's reading a...

Pagină nouă

= Word Count =

Little John is learning mandarin. In order to help him look for words in a dictionary, he needs to make a list of all the new words he's encountering as he's reading a book, but he only needs each work once.

Help Little John make a list of all the different words in the book.

== Requirement ==

Given a number of words N and a list of N words, output the number K of different words, and the list of those words, in alphabetical order. Words are considered identical only if their latter case matches.

== Input Data ==

A file called ''word_count.in'', containing the number of words N on the first line and N subsequent words, one word per line.

== Output Data ==

A file called ''word_count.out'', containing the number of different words, K on the first line, then K subsequent words, alphabetically ordered, one word per line.

== Restrictions ==
1 ≤ N ≤ 1000000

== Examples ==

{| class="wikitable"
|- bgcolor="#ddeeff" align="left"
|'''Input''' || '''Output'''
|- bgcolor="#ddffdd" align="left"
|
<pre style="font-size:12px">
8
Mircea
a
mancat
cartofi
si
piure
de
cartofi
</pre>
|
<pre style="font-size:12px">
7
Mircea
a
cartofi
de
mancat
piure
si
</pre>
|}

@@ Linia 1: / Linia 1: @@
 = Word Count =
-Little John is learning Mandarin. In order to help him look for words in a dictionary, he needs to make a list of all the new words he's encountering as he's reading a book, but he only needs each work once.
+Little John is learning Mandarin. In order to help him look for words in a dictionary, he needs to make a list of all the new words he's encountering as he's reading a book, but he only needs each word once.
 Help Little John make a list of all the different words in the book.

@@ Linia 7: / Linia 7: @@
 == Requirement ==
-Given a number of words N and a list of N words, output the number K of different words, and the list of those words, in alphabetical order. Words are considered identical only if their latter case matches.
+Given a number of words N and a list of N words, output the number K of different words, and the list of those words, in alphabetical order. Words are considered identical only if their letter case matches.
 == Input Data ==

@@ Linia 19: / Linia 19: @@
 == Restrictions ==
 ≤ N ≤ 1000000
 == Examples ==