Question

一道c/c++ 程序题

/*Problem Description
You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X,
or its inverse can be found as a substring of any of the given strings.

Input
The first line of the input file contains a single integer t (1 <= t <= 10), the number of test cases,
followed by the input data for each test case. The first line of each test case contains a single integer n (1 <= n <= 100),
the number of given strings, followed by n lines, each representing one string of minimum length 1 and maximum length 100.
There is no extra white space before and after a string.

Output
There should be one line per test case containing the length of the largest string found.

Sample Input
2
3
ABCD
BCDFF
BRCD
2
rose
orchid
Sample Output
2
2*/

Answer 1

#include<iostream>
#include<cstring>
using namespace std;
int t,n;
char s[101][101];
int maxn(char s2[])
{
int l1=strlen(s2),l2=strlen(s2);
char k1[101],k2[101];
int i,j;
bool found;
while(l1>0)
{
for(i=0;i<=l2-l1;i++)
{
strncpy(k1,s2+i,l1);
for(j=0;j<l1;j++)
k2[j]=k1[l1-1-j];
k1[l1]=k2[l1]='\0';
found=true;
for(j=0;j<n;j++)
{
if(strstr(s[j],k1)==NULL&&strstr(s[j],k2)==NULL)
{
found=false;
break;
}
}
if(found)
{
//cout<<k1<<endl;
return l1;
}
}
l1--;
}
return 0;
}
int main()
{
cin>>t;
while(t--)
{
cin>>n;
int i,j=101;
char s1[101];
for(i=0;i<n;i++)
cin>>s[i];
for(i=0;i<n;i++)
if(strlen(s[i])<j)
{
strcpy(s1,s[i]);
j=strlen(s[i]);
}
cout<<int(maxn(s1))<<endl;
}
return 0;
} 试试吧，重装系统还没来得及下软件、

Answer 2

题目网站告诉我