先输入一组数,然后输入其分组,按照分组统计出现的次数并输出。如:
输入数据:3 2 3 8 8 2 3 0
输入分组:1 2 3 2 1 3 1 0
输出:
1={2=0 3=2 8=1}
2={2=1 3=0 8=1}
3={2=1 3=1 8=0}
#include <iostream>
#include <vector>
#include <map>
using namespace std;
void display(map<int,int> m)
{
map<int,int>::iterator it;
for(it=m.begin();it!=m.end();++it)
{
if(it==m.begin())
cout<<it->first<<"="<<it->second;
else
cout<<" "<<it->first<<"="<<it->second;
}
}
int main()
{
int n,m;
vector<int> arr1,arr2;
map<int,map<int,int> > mmap;
cout<<"请输入数据:"<<endl;
while(cin>>n)
{
if(n==0)
break;
arr1.push_back(n);
}
cin.clear();
cout<<"请输入分组:"<<endl;
while(cin>>m)
{
if(m==0)
break;
arr2.push_back(m);
}
vector<int>::iterator it1,it2;
for(it2=arr2.begin(); it2!=arr2.end(); it2++) //非常必要
{
for(it1=arr1.begin(); it1!=arr1.end(); it1++)
mmap[*it2][*it1]=0;
}
for(it1=arr1.begin(),it2=arr2.begin();it1!=arr1.end();it1++,it2++)
((mmap[*it2])[*it1])++;
map<int,map<int,int> >::iterator mit;
for(mit=mmap.begin();mit!=mmap.end();++mit)
{
cout<<mit->first<<"={";
display(mit->second);
cout<<"}"<<endl;
}
}
/*
3 2 3 8 8 2 3 0
1 2 3 2 1 3 1 0
*/
#pragma warning (disable :4786)
#include <iostream>
#include <deque>
#include <map>
using namespace std;
void show(map<int,int> a)
{
map<int,int>::iterator it;
for(it=a.begin();it!=a.end();++it)
{
if(it==a.begin())
cout<<it->first<<"="<<it->second;
else
cout<<" "<<it->first<<"="<<it->second;
}
}
main()
{
int n,m;
deque<int> arr1,arr2;
map<int,map<int,int> > mmap;
cout<<"请输入数据:"<<endl;
while(cin>>n)
{
if(n==0)
break;
arr1.push_front(n);
}
cout<<"请输入分组:"<<endl;
while(cin>>m)
{
if(m==0)
break;
arr2.push_front(m);
}
deque<int>::iterator it1,it2;
for(it2=arr2.begin(); it2!=arr2.end(); it2++)
{
for(it1=arr1.begin(); it1!=arr1.end(); it1++)
mmap[*it2][*it1]=0;
}
for(it1=arr1.begin(),it2=arr2.begin();it1!=arr1.end();it1++,it2++)
((mmap[*it2])[*it1])++;
map<int,map<int,int> >::iterator it;
for(it=mmap.begin();it!=mmap.end();++it)
{
cout<<it->first<<"={";
show(it->second);
cout<<"}"<<endl;
}
}
/*
3 2 3 8 8 2 3 0
1 2 3 2 1 3 1 0
*/