Fu major data structures and algorithms experimental questions 9.1 stones sean collected a lot of stones, which have many of the same, he wanted to know the collection of many different stones. Input behavior is a positive integer N (2 <N<=50000)表示收集的石头数。 接下来N行，每行1个正整数x代表一个编号为x的石头,两个石头相同当且仅当他们 的编号相同。 输出一行一个整数，表示不同的石头的个数。

stone.cpp
stone.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．