➤ Problem Link : 82B. Sets
✅ C++ Solution :
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n,v;
cin>>n;
if(n==2)
{
int k;
cin>>k;
cin>>v;
cout<<"1 "<<v<<endl;
cout<<k-1<<" ";
for(int j=2;j<=k;j++)
{
cin>>v;
cout<<v<<" ";
}
exit(0);
}
unordered_map<int,string> mp;
unordered_map<string,vector<int> > um;
for(int i=1;i<=(n*(n-1))/2;i++)
{
int k;
cin>>k;
for(int j=1;j<=k;j++)
{
cin>>v;
if(mp.find(v)==mp.end())
mp[v]=to_string(i);
else
mp[v]+=to_string(i);
}
}
for(auto it=mp.begin();it!=mp.end();it++)
um[(*it).second].push_back((*it).first);
for(auto it = um.begin();it!=um.end();it++)
{
int s=(*it).second.size();
int l=(*it).first.length();
cout<<(*it).second.size()<<" ";
for(auto i: (*it).second)
cout<<i<<" ";
cout<<endl;
}
}
Thank you for your patience reading. If you enjoyed this post, I’d be very grateful if you’d help it spread by emailing it to a friend, or sharing it on Whatsapp or Facebook.
😇Happy Learning!!
I am a Member Technical at D.E. Shaw India Pvt. Ltd. CodingWithArt is a blog where you find tricks and solutions to challenging coding and development problems. I aim to build a universal tech platform for every enthusiast out there.