Application of STL in application of Istringstream

Source: Internet
Author: User

Number of words

Time limit:1000/1000 MS (java/others) Memory limit:32768/32768 K (java/others)
Total submission (s): 44427 Accepted Submission (s): 10840


Problem descriptionlily's good friend xiaoou333 recently very empty, he thought of a meaningless thing, is to count the number of different words in an article. Your task below is to help xiaoou333 solve the problem.

Input has multiple sets of data, each set of rows, each of which is a small article. Each small article is composed of lowercase letters and spaces, no punctuation, and when you encounter #, the input ends.

Output each group only outputs an integer, which represents the total number of different words in an article.

Sample Inputyou is my friend#

Sample Output4
#include <iostream>#include<sstream>#include<Set>#include<string>using namespacestd;intMain () {strings;  while(Getline (cin,s) &&s!="#") {Istringstream cin (s); Set<string>words; stringW;  while(cin>>W) Words.insert (W); cout<<words.size () <<Endl; }}

Application of STL in application of Istringstream

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.