Module: Associative arrays: map


Problem

1/9

Lists: Start

Theory Click to read/hide

Error

Problem

Build alphabetic-frequency dictionary: a list of words in alphabetical order, to the right of each word should indicate how many times it occurs in the source file. The sign of the end of the text is "END!". The order in which words are printed does not matter.
 
Input Output
Eat more of those soft French buns END! Eat 1
1 more
these 1
soft 1
French 1
roll 1

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include<iostream>
#include<map>
#include<string>
using namespace std;


int main()
{

	map<string, int> mymap;
	string s;
	while (true)
	{            
	}

	map<string, int>::iterator it;

	for (it = mymap.begin(); it != mymap.end(); ++it)
		cout << it->first << " " << it->second << "\n";
	return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!