fork(1) download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main()
  4. {
  5.      int bfn;
  6.      cin>>bfn;
  7.      vector<int> bfi,ffi;
  8.      for(int i=0;i<bfn;i++)
  9.      {
  10.      	int bfid;
  11.      	cin>>bfid;
  12.      	bfi.push_back(bfid);
  13.      	int ffn;
  14.      	cin>>ffn;
  15.      	for(int i=0;i<ffn;i++)
  16.      	{
  17.      		int ffid;
  18.      		cin>>ffid;
  19.      		ffi.push_back(ffid);
  20.      	}
  21.      }
  22.      for(int i=0;i<ffi.size();i++)
  23.      {
  24.      	for(int j=0;j<bfi.size();j++)
  25.      	{
  26.      		if(ffi[i]==bfi[j])
  27.      		{
  28.      			ffi.erase(ffi.begin()+i);
  29.      		}
  30.      	}
  31.      }
  32.      sort(ffi.begin(),ffi.end());
  33.      int count =distance(ffi.begin(),unique(ffi.begin(), ffi.begin() + ffi.size())); 
  34. 	  cout<<count;
  35. 	return 0;
  36. }
Success #stdin #stdout 0s 4536KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/GpK5tj
problem FACEFRND, based on SPOJ submission 26531429 (CPP), 2020-09-04 14:46:30
language:
C++ (gcc 8.3)
created:
3 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!