Pagini recente » Cod sursa (job #702494) | Cod sursa (job #1387766) | Cod sursa (job #2803186) | Cod sursa (job #2311835) | Cod sursa (job #3257002)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("countseqmatch.in");
ofstream fout("countseqmatch.out");
int b[100000],a[100000];
int main()
{
int n,m,v[100000],w[100000],i,ct=0,cti=0,cto=0,j;
cin>>m>>n;
for(i=1;i<=m;i++)
{
cin>>v[i];
a[v[i]]++;
cti++;
}
for(i=1;i<=n;i++)
{
cin>>w[i];
b[v[i]]++;
ct++;
}
for(i=1;i<=cti;i++)
for(j=1;j<=ct;j++)
{
if(a[v[i]]==b[v[j]])
cto++;
}
cto++;
cout<<cto;
return 0;
}