Pagini recente » Cod sursa (job #197368) | Cod sursa (job #985437) | Cod sursa (job #2300024) | Cod sursa (job #1286103) | Cod sursa (job #1504072)
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
int n,i,j,cost[10000][10000],x;
vector <int> v[10000];
string s[10000];
long lcp(char a[], char b[]) {
char* p = a;
char* q = b;
while ((*p == *q) && (*q)) {
p++;
q++;
};
return p-a;
}
int main()
{
cin>>n;
for(j=1;j<=n;j++)
for(i=1;i<=n;i++)
{
v[j].push_back(i+n);
v[i+n].push_back(j);
}
for(i=1;i<=n*2;i++)
cin>>s[i];
for(j=1;j<=n;j++)
for(i=1;i<=n;i++)
{
x=lcp(s[j],s[i+n]);
cost[j][i+n]=x;
}
cout<<cost[1][6];
return 0;
}