label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
49 | 24000 | int f(char b[], int m)
{
int i, j, k, l, flag;
for (j = 2; j <= m; j++)
{
for (i = 1; i <= m - 1; i++)
{
flag = 1;
for (k = 0; k < j; k++)
{
if (b[i + k] != b[i + j - k - 1])
{
flag = 0;
}
}
if (flag)
{
for (l = 0; l < j; l++)
{
cout << b[i + l];
}
cout<<endl;
}
}
}
return 0;
}
int main()
{
int m;
char a[501];
for (m = 1; m > 0; m++)
{
if (a[m-1]== '\n')
{
break;
}
a[m] = cin.get();
}
f(a, m);
return 0;
} |
49 | 24001 | int main()
{
int n,i,j,k,t;
int flag;
char a[502];
char p;
i=1;
while(cin.get(p)&&p!='\n')
{
a[i]=p;
n=i;
i++;
} //????????
for(i=2;i<=n;i++) //????????????2?n
for(j=1;j<=n+1-i;j++) //????????????i???j???j+i-1??
{ for(k=0;k<=i-1;k++)
{
if(a[j+k]==a[j+i-1-k]) //?????i????????
flag=1;
else{flag=0;break;}
}
if(flag==1)
{for(t=j;t<=j+i-2;t++)
cout<<a[t]; //???i-1??
cout<<a[j+i-1]<<endl;} //???i?????
}
return 0;
} |
49 | 24002 | /*
* huiwenzilie.cpp
*
* Created on: 2010-12-19
* Author: lz
*/
int main()
{
char c[600];
cin>>c;
int p;
int q;
int i;
int j;
int zilen;
int len=strlen(c);
for(zilen=2;zilen<=len;zilen++)//???????
for(i=0;i<=len-zilen;i++)//???????????
{
p=i;//????????
q=i+zilen-1;//????????
while(p<q)//???????
{
if(c[p]==c[q])
{
p++;
q--;
}
else
break;
}
if(p>=q)
{
for(j=i;j<i+zilen;j++)
cout<<c[j];
cout<<endl;
}
}
return 0;
}
|
49 | 24003 |
void checkstr (char str[] , int) ;
int main ()
{
char str[500] ;
int i = 2 , len ;
cin >> str ;
len = strlen(str) ;
for (i = 2 ; i <= len ; i ++)
{
checkstr(str , i) ;
}
return 0 ;
}
void checkstr (char str[] , int i)
{
int b , e , b1 , b2 , e2 , count = 0 , len ;
len = strlen(str) ;
for (b = 0 ; b <= len - i ; b ++)
{
b2 = b ;
e2 = b + i - 1 ;
for ( b1 = b , e = b + i - 1; b1 < e ; b1 ++ , e --)
{
if (str[b1] == str[e])
count ++ ;
}
if (count == i / 2)
{
for (b1 = b2 ; b1 <= e2 - 1; b1 ++)
{
cout << str[b1] ;
}
cout << str[e2] << endl ;
}
count = 0 ;
}
}
|
49 | 24004 | main()
{int i,j,k,l,m=0,s=0;
char c[500];
scanf("%s",c);
k=strlen(c);
for(i=2;i<=k;i++)
{
for(j=0;j<=k-i;j++)
{
for(l=0;l<=i/2-1;l++)
if(c[l+j]==c[j+i-l-1])m++;
if(m==i/2)
{for(l=0;l<=i-1;l++)
printf("%c",c[j+l]);
s++; }
m=0;
if(s!=0)
printf("\n");
s=0;}
}
} |
49 | 24005 | /*
???????
?????
???2011.11.11
*/
int len; //??????
void ishui(char a[]); //?????????????
int main() //???
{
char a[500];
memset(a, ' ', sizeof(a));
int i = 0;
while((a[i] = cin.get()) != '\n') //?????
{
i++;
}
len = i; //????????
ishui(a); //???????????
return 0;
} //?????
void ishui(char a[]) //??????
{
int i, j, k, l, flag;
for(i = 2 ; i <= len - 1 ; i++) //????????????????
{
for(j = 0 ; j < len ; j++) //?????????
{
flag = 1; //????????1
for(k = 0 ; k < i ; k++) //???????
{
if(a[j + k] != a[j + i - (k + 1)])
{
flag = 0; //???????
break;
}
}
if(flag == 1) //?????????
{
for(l = 0 ; l < k ; l++)
{
cout << a[j + l];
}
cout << endl;
}
}
}
return;
}
|
49 | 24006 | int main()
{
char a[500],temp[500],temp2[500];
int i,k,j,b;
gets(a);
b=strlen(a);
for(i=2;i<=b;i++)
{
for(j=0;j<b-i+1;j++)
{
strncpy(temp,&a[j],i);
for(k=0;k<i;k++)
{
temp2[k]=temp[i-k-1];
}
temp[i]='\0';
temp2[i]='\0';
if(strcmp(temp,temp2)==0) printf("%s\n",temp);
}
}
} |
49 | 24007 |
char s[555];
int f(int i,int j)
{
int k;
if (j==2)
{
if (s[i]==s[i+1])
return 1;
else return 0;
}
else if (j==3)
{
if (s[i]==s[i+2])
return 1;
else return 0;
}
else
{
for (k=0;k<=j/2-1;k++)
if (s[i+k]!=s[i+j-1-k])
break;
if (k==j/2)
return 1;
else return 0;
}
}
int main()
{
int i,j,k,len;
gets(s);
len=strlen(s);
for (i=len;i>0;i--)
s[i]=s[i-1];
s[0]=0;
for (j=2;j<=len;j++)
for (i=1;i<=len+1-j;i++)
if (f(i,j)==1)
{
for (k=i;k<i+j-1;k++)
printf("%c",s[k]);
printf("%c\n",s[i+j-1]);
}
return 0;
} |
49 | 24008 | int i, b = 2;
char a[500] = {0};
int shuchu(char a[],int i)
{
int s, j, k, l;
for (j = 0; j < i; j++)
if (a[j]==a[i])
{
if (i - j + 1 != b)
continue;
s = 1;
for (k = 1; k < (i - j + 1) / 2; k++)
{
if ( a[j+k] != a[i-k] )
{
s = 0;
break;
}
}
if (s == 0)
continue;
if (s == 1)
{
for (l = j; l <= i; l++)
cout << a[l];
cout <<endl;
}
}
return 0;
}
int main()
{
cin >> a;
for (b = 2; b <= 99; b++)
for (i = 1; a[i] != 0; i++)
{
shuchu(a,i);
}
return 0;
} |
49 | 24009 | int main()
{
int i,j,k,t;
char str[500]={"1"};
gets(str);
for(k=1;k<strlen(str)-1;k++)
for(i=0;i<strlen(str)-k;i++){
t=0;
for(j=0;j<(k+1)/2;j++){
if(str[i+j]!=str[i+k-j]){t=1;break;}
}
if(t==0){
for(j=i;j<=i+k;j++)
printf("%c",str[j]);
printf("\n");
}
}
return 0;
} |
49 | 24010 | int main()
{
char str[520];
int len, i, j, k, num;
cin >> str;
len = strlen(str);
for (i = 2; i <= len; i++)
{
for (j = 0; j <= len - i; j++)
{
num = 0;
for (k = 0; k < i; k++)
{
if (str[j + k] == str[j + i - k - 1])
num++;
}
if (num == i)
{
for (k = 0; k < i; k++)
cout << str[j + k];
cout << endl;
}
}
}
return 0;
} |
49 | 24011 | /*
* ????.cpp
*
* Created on: 2010-12-20
* Author: ???
*/
int main()
{
char a[501],b[501],c[501]; //a???????b??????c??????
int i,len,j,k; //len???
cin>>a; //??
len=strlen(a);
for (k=2;k<=len;k++) //????k?????
{
for (i=0;i<501;i++) //???
{
b[i]=c[i]='\0';
}
for (i=0;i<len;i++)
{
if (i+k<=len) //????????
{
for (j=i;j<i+k;j++) //??k???????
b[j-i]=a[j];
for (j=0;j<k;j++) //??
{
c[j]=b[k-j-1];
}
if (strcmp(b,c)==0) //?????????
cout<<b<<endl;
}
else break;
}
}
return 0;
} |
49 | 24012 | int main()
{
char a[500];
cin>>a;
int L; //????????L
for(int i=0;i<500;i++)
{
if(a[i]==0) //???????????????????????????
{
L=i;
break;
}
}
for(int i=1;i<L-1;i++) //??????i???????????????1?????2??L-1?????L?
for(int j=0;j<L-i;j++) //??????j???????????
{ //???????????????????????????????
int flag=1; //???????flag????1????
for(int k=0;k<1+i/2;k++) //??????k????????????????????
{
if(a[j+k]!=a[j+i-k])flag=0; //???????????????flag???0
}
if(flag==1)
{
for(int k=0;k<=i;k++)cout<<a[j+k];
cout<<endl;
}
}
return 0;
}
|
49 | 24013 | //**********************************
//* ???????? *
//* ?????? *
//* ???2010-11-24 *
//* ????????? *
//**********************************
void judge(char n[],int i,int len);
int main()
{
char n[500],str;
int i = 0,len = 2;
cin >> n;
for(len = 2; len <= strlen(n); len++)
for(i = 0; i <= strlen(n) - len; i++)
judge(n,i,len);
return 0;
}
void judge(char n[],int i,int len)
{
int j = 0;
for(j = 0; j < len; j++)
if(n[i + j] != n[i + len - j - 1])
return;
for(j = 0; j < len; j++)
cout << n[i + j];
cout << '\n';
return;
} |
49 | 24014 | int main()
{
char str[500];
int i, j, k,len,l;
cin.getline(str,500);
len=strlen(str);
for (i=2;i<=len;i++)
{
for (k=0;k<=len-i;k++)
{
for (j=k,l=i+k-1; j<i+k; j++,l--)
{
if (str[j] != str[l])
break;
}
if (j==i+k)
{
for (j=k;j<i+k;j++)
cout << str[j];
cout << endl;
}
}
}
return 0;
}
|
49 | 24015 | int main()
{
char str[500];
int lenth,i,l,j,counter;
gets(str);
lenth=strlen(str);
for(i=0;i<=lenth-2;i++)
{
if(str[i]==str[i+1])
printf("%c%c\n",str[i],str[i+1]);
}
for(l=3;l<=lenth;l++)
{
for(i=0;i<=lenth-l;i++)
{
counter=0;
for(j=0;j<=l-1;j++)
{
if(str[i+j]==str[i+l-j-1])
counter+=1;
}
if(counter==l)
{
for(j=0;j<=l-2;j++)
{
printf("%c",str[i+j]);
}
printf("%c\n",str[i+l-1]);
}
}
}
return 0;
}
|
49 | 24016 |
int main()
{
int s,i,j,n,r,ok;
char a[505];
gets(a);
n=strlen(a);
for (r=2;r<=n;r++)
for (i=0;i<=n-r;i++)
{
ok=1;
j=i+r-1;
for (s=i;s<=i+(j-i)/2;s++)
if (a[s]!=a[j+i-s])
{ok=0;break;}
if (ok)
{
for (s=i;s<=j;s++)
printf("%c",a[s]);
printf("\n");
}
}
return 0;
}
|
49 | 24017 | void sub(char common[],char minlen[],int n,int now)
{
char *a,*b;
for(a=common,b=minlen+now;a<common+n;a++,b++)
{
*a=*b;
}
*a='\0';
}
int compare(char a[],int n)
{
int i,flag=1;
for(i=0;i<strlen(a)/2;i++)
{
if(a[i]!=a[strlen(a)-i-1])
{
flag=0;
break;
}
}
return flag;
}
int main()
{
void sub(char common[],char minlen[],int n,int now);
int compare(char a[],int n);
char str[500];
scanf("%s",str);
int i,j;
if(strlen(str)>1)
{
for(i=2;i<=strlen(str);i++)
{
for(j=0;j<strlen(str)-i+1;j++)
{
char substr[500];
sub(substr,str,i,j);
if(compare(substr,i)==1)
{
printf("%s\n",substr);
}
}
}
}
return 0;
} |
49 | 24018 | int main()
{
char c[505];
cin >> c;
int i, j, len;
len = strlen(c);
for (i = 2; i < len; i++)
{
for (j = 0; j <= len - i; j++)
{
int k, l, flag = 1;
for (k = j, l = j + i - 1; k < j + i - 1, l > j; k++, l--)
{
if (c[k] != c[l])
{
flag = 0;
break;
}
}
if (flag == 1)
{
for (int a = j; a < j + i; a++)
cout << c[a];
cout << endl;
}
}
}
return 0;
} |
49 | 24019 | /*
* 37.cpp
*
* Created on: 2013-12-22
* Author: Administrator
*/
int main()
{
int i,j,s,ii,ss,kk;
char a[1000];
cin>>a;
s=strlen(a);
for(i=2;i<=s;i++)
{
ss=0;
for(j=0;j+i<=s;j++)
{
for(ii=0;ii<=i-1;ii++)
if(a[j+ii]==a[j+i-1-ii])
ss=1;
else
{
ss=0; break;
}
if(ss==1)
for(kk=0;kk<i;kk++)
cout<<a[j+kk];
if(ss==1)
cout<<endl;
}
}
return 0;
}
/*
* ?????????????????
???????????????????????????
??? abba cccdeedccc???????
????????????????2
????
????????????????500??
???
abcddcbaab
????
??????????????????????
?????????????????????????????
????abcddcbaab
???
dd
aa
cddc
baab
bcddcb
abcddcba
????
123321125775165561
????
33
11
77
55
2332
2112
5775
6556
123321
165561
??
(??????????)
*/
|
49 | 24020 | int main()
{
static char c[501],c1[501],c2[501];
int n,i,j,p,q,k,s;
gets(c);
for(i=0;;i++)
if(c[i]==0)
{ n=i; break;}
for(i=2;i<=n;i++)
for(j=0;j<=n-i;j++)
{
for(p=0;p<i;p++)
{
c1[p]=c[j+p];
c2[p]=c[j+i-p-1];
}
for(;p<501;p++)
{
c1[p]=0;
c2[p]=0;
}
s=0;
for(k=0;s==0&&k<501;k++)
s=c1[k]-c2[k];
if(s==0)
printf("%s\n",c1);
}
} |
49 | 24021 | int main()
{
char a[500];
int i, j, l, k = 0;
cin.getline(a, 500);
l = strlen(a);
for (i = 2; i <= l; i++)
for (j = 0; j <= l - i; j++)
{
k = j;
while (a[k] == a[2*j+i-1-k] && k < 2*j+i-1-k)
k++;
if (k >= 2*j+i-1-k)
{
for (k = j; k < j+i; k++)
cout << a[k];
cout << endl;
}
}
return 0;
}
|
49 | 24022 | int main()
{
int i,j,k,d,n,t;
char a[600];
scanf("%s",a);
n=strlen(a);
for (d=1;d<=n;d++)
{
for (i=0;i+d<=n-1;i++)
{
if (a[i]==a[i+d])
{
t=0;
if (d%2==1)
{
for(k=0;k<=d/2;k++)
{
if (a[i+k]==a[i+d-k])
{
t=t+1;
}
}
if (t==(d+1)/2)
{
for (k=i;k<=i+d;k++)
{
printf("%c",a[k]);
}
printf("\n");
}
}
else
{
for(k=0;k<=d/2-1;k++)
{
if (a[i+k]==a[i+d-k])
{
t=t+1;
}
}
if (t==d/2)
{
for (k=i;k<=i+d;k++)
{
printf("%c",a[k]);
}
printf("\n");
}
}
}
else
continue;
}
}
return 0;
} |
49 | 24023 | int hw(char w[]){
int l=strlen(w);
for(int i=l>>1-1;i>=0;i--)
if(w[i]!=w[l-i-1])return 0;
return 1;
}
int main(){
char w[10000],p[10000];
cin>>w;
int l=strlen(w);
for(int j=2;j<l;j++)
for(int i=0;i<l-j+1;i++){
memcpy(&p,&w[i],j);
p[j]=0;
if(hw(p))cout<<p<<endl;
}
return 0;
} |
49 | 24024 | int main()
{
int i, j, d, g, k, l;
char a[501];
cin >> a;
d = strlen(a);
for(i = 2; i <= d; i ++)
{
for(j = 0; j + i <= d; j ++)
{
g = 0;
for(k = j, l = j + i - 1; k < l; k ++, l --)
{
if(a[k] != a[l])
{
g = 1;
break;
}
}
if(g == 0)
{
for(k = j; k <= j + i - 1; k ++)
{
cout << a[k];
}
cout << endl;
}
}
}
return 0;
}
|
49 | 24025 | int main()
{
char a[500];
int len,i,j,k,p,flag,m;
gets(a);
len=strlen(a);
for(i=2;i<=len;i=i+2)
{
for(j=0;j<len;j++)
{
flag=0;
for(k=0;k<i/2;k++)
{
if(a[j+k]==a[j+i-1-k])
flag=1;
else {
flag=0;break;
}
}
if(flag)
{
for(m=j;m<j+i;m++)
printf("%c",a[m]);
printf("\n");
}
}
}
return 0;
} |
49 | 24026 | //******************************
//????1000012825 *
//?????? *
//???11.28 *
//??????? *
//******************************
int main ()
{
char str[500], h[500];
int i, len, j, k, l = 0, p, q, flag = 0;
cin.getline( str, 500 );
len = strlen (str); //??????????
for ( i = 2; i <= len ; i++ )
{
for ( j = 0; j <= len - i ; j++ ) //????????2?len,????????
{
l = 0;
for ( k = j; k <= j + i - 1; k++ )
{
h[l++] = str[k]; //??????????????
}
for ( p = 0; p <= i / 2 - 1; p++ ) //?????????????????
{
if ( h[p] != h[ i - 1 - p] )
break;
}
if ( p == i /2 )
{
for ( q = 0; q <= i - 2; q++ )
cout << h[q] ;
cout << h[i - 1] << endl;//?????
}
}
}
return 0;
}
|
49 | 24027 | /*
* huiwen.cpp
*
* Created on: 2011-12-18
* Author: admin
*/
int main(){
int i,begin,begin1,end1,flag,len,length;
char a[501];
cin>>a;
length=strlen(a);
for (len=2;len<=length;len++){//???????
for (begin=0;begin<=length-len;begin++){//??????
begin1=begin;end1=begin+len-1;
flag=1;
while(begin1<end1){//?????????????
if (a[begin1]!=a[end1]){flag=0;break;}
begin1++;end1--;
}
if (flag){
for(i=begin;i<=begin+len-1;i++){//??????
cout<<a[i];
}
cout<<endl;
}
}
}
return 0;
}
|
49 | 24028 | int main()
{
char s[500];
char c;
char e;
int d;
int i,j,k,p;
gets(s);
int m=strlen(s);
for(k=2;k<=m;k++)
{
for(i=0;i<=(m-k);i++)
{
for(j=i;j<(i+(k)/2);j++)
{
d=0;
if(s[j]!=s[k+i-1-(j-i)])
{
d=1;
break;
}
}
if(d==0)
{
printf("\n");
for(p=i;p<i+k;p++)
{
printf("%c",s[p]);
}
}
}
}
return 0;
}
|
49 | 24029 | /*
* 90.cpp
*
* Created on: 2011-12-25
* ???????
*/
int main()
{
char x[501];
cin.getline(x,501);
int n,i,j,k,p;
int begin,end;
p=strlen(x);
for(n=2;n<=500;n++)
{
for(i=0,j=n-1;j<p;i++,j++)
{
begin=i;
end=j;
while(begin<end)
{
if(x[begin]!=x[end]) break;
else
{
begin=begin+1;
end=end-1;
}
}
if(begin>end)
{
for(k=i;k<=j;k++)
{
cout<<x[k];
}
cout<<endl;
}
}
}
return 0;
}
|
49 | 24030 | //**********?????????*****************
//**********???????*********************
//**********?????2012?11?9?************
//**********???1200062701******************
int main()
{
int totallength = 0, flag = 0; //??????????
char a[500];
cin >> a; //???????
for(int b = 0; b < 500; b++)
{
if(a[b] == 0) break; //???????
else
{
totallength++;
}
} //????????
for(int length = 2; length <= 500; length ++)
{
for(int j = 0; j <= totallength - length + 1; j++)
{ //????????????
for(int k = 0; k < length / 2; k++)
{
if(a[j + k] == a[j + length - 1 - k])
{
flag++; //???????
}
}
if(flag == length / 2) //?????????
{
for(int l = j; l <= j + length - 1; l++)
{
cout << a[l];
flag = 0; //???????
}
cout << endl; //???????
} //??????
else
{
flag = 0; //?????????
}
}
}
return 0;
}
|
49 | 24031 |
int main()
{
char a[500];
int i,j,l,k,m=0;
gets(a);
for(i=2;i<=strlen(a);i++)
{
for(j=0;j<=(strlen(a)-i);j++)
{
for(l=j,k=j+i-1;l<=k;l++,k--)
{
if(a[l]==a[k])
m=1;
else
{
m=0;
break;
}
}
if(m==1)
{
for(k=j;k<j+i;k++)
printf("%c",a[k]);
printf("\n");
}
}
}
return 0;
}
|
49 | 24032 | char c[500];
int f(int e0,int s0);
int main(){
int i,j,k,e,s;
scanf("%s",c);
int len;
len=strlen(c);
for(i=0;i<len;i++){
for(j=0;j<len;j++){
if(j-i>=0&&i+j+1<=len){
if(c[j-i]==c[i+j+1]){
s=j-i;
e=i+j+1;
if(f(e,s)){
for(k=s;k<=e;k++)
printf("%c",c[k]);
printf("\n");
}
}
}
}
}
return 0;
}
int f(int e0,int s0){
int i0,sum=0;
for(i0=s0;i0<=e0;i0++){
if(c[i0]!=c[s0+e0-i0])
sum++;
}
if(sum==0)
return 1;
else return 0;
} |
49 | 24033 | /*
??
?????????????????
???????????????????????????
??? abba cccdeedccc???????
????????????????2
????
????????????????500??
???
abcddcbaab
????
??????????????????????
?????????????????????????????
????abcddcbaab
???
dd
aa
cddc
baab
bcddcb
abcddcba
????
123321125775165561
????
33
11
77
55
2332
2112
5775
6556
123321
165561
*/
int main()
{
char str[501]; //?????????
int checklen,strlen,i,j,temp; //checklen??????????
cin>>str;
for (i=0;str[i]!='\0';i++)
{
strlen=i;
} //strlen?????????1
for (checklen=2;checklen<=strlen+1;checklen++) //??????????2????
{
for (i=0;i<=strlen-checklen+1;i++) //?????????????
{
for (j=0;;j++)
{
if ((str[i+j]==str[i+checklen-1-j])&&((i+j)<(i+checklen-1-j))) continue;
else if (str[i+j]!=str[i+checklen-1-j]) break;
else if ((str[i+j]==str[i+checklen-1-j])&&((i+j)>=(i+checklen-1-j)))
{
temp=checklen;
for (temp=0;temp<=checklen-1;temp++)
{
cout<<str[i+temp];
}
cout<<endl;
break;
} //????????????????????
}
}
}
return 0;
} |
49 | 24034 | void huiwen(int k, char a[], int b[])
{
int i;
int j = 0;
for (i = 0; i < (int)strlen(a) + 1 - k; i++)
{
if ((a[i] == a[i+k-1])&&(b[i+1] == 0))
{
for (j = i; j<= i + k - 1; j++)
{
cout << a[j];
}
b[i] = 0;
cout << endl;
}
else
{
b[i] = 1;
}
}
}
int main()
{
char a[501];
int b[500] = {0};
cin >> a;
int i, j = 0, k = 0;
for (k = 2; k <= (int)strlen(a); k += 2)
{
huiwen(k, a, b);
}
return 0;
} |
49 | 24035 | void f1(char a[],int l)
{
char b[501];
int j;
for (j=0;j<l;j++)
{
b[l-j-1]=a[j];
}
b[l]='\0';
if (strcmp(a,b)==0)
puts(a);
}
void f2(char s[],int l,int L)
{
int m,n,i;
char a[501];
for(m=0;m<L-l+2;m++)
{
i=0;
for(n=m;n<m+l;n++)
{
a[i]=s[n];
i=i+1;
}
a[i]='\0';
f1(a,l);
}
}
void f3(char s[], int L)
{
int l;
for (l=2;l<L+1;l++)
f2(s,l,L);
}
void main()
{
char s[501];
gets(s);
int L;
L=strlen(s);
f3(s,L);
}
|
49 | 24036 | int main()
{
char a[600];
int flag;
cin >> a;
int num = strlen(a);
for(int i = 2; i <= num;i++) //????
{
for(int j = 0;j <= num-i+1;j++) //???
{
flag = 0;
for(int k = 0; k < i/2;k++) //??????
{
if(a[j+k] != a[j+i-k-1])
{
flag = 1;
break;
}
}
if(flag == 0)
{
for(int l = j; l<=j+i-1;l++)
cout << a[l];
cout << "\n";
}
}
}
return 0;
}
|
49 | 24037 |
int jichuan(int x , char s[] , int b[] , int l)
{
int p , q , t , i , j ;
for (p = x , q = l - x , t = 0 , i = p ; i <= q ; i ++ )
{
if ((b[i]) && (s[i - x] == s[i + x]))
{
for (j = i - x ; j <= i + x ; j ++ )
cout << s[j] ;
cout << endl ;
t ++ ;
}
else
b[i] = 0 ;
}
return t ;
}
int ouchuan(int x , char s[] , int a[] , int l)
{
int p , q , t , i , j ;
for (p = x - 1, q = l - x , t = 0 , i = p ; i <= q ; i ++ )
{
if ((a[i]) && (s[i - x + 1] == s[i + x]))
{
for (j = i - x + 1; j <= i + x ; j ++ )
cout << s[j] ;
cout << endl ;
t ++ ;
}
else
a[i] = 0 ;
}
return t ;
}
int main()
{
int a[501] , b[501] , l , i , m0 , m1 , max ;
char s[501] ;
cin >> s ;
l = strlen(s) - 1 ;
for (i = 0 ; i <= l ; i ++ )
{
a[i] = 1 ;
b[i] = 1 ;
}
for (m0 = 1 , m1 = 1 , max = (l + 1) / 2 , i = 1 ; i <= max ; i ++ )
{
if (m0 != 0)
m0 = ouchuan(i , s , a , l) ;
if (m1 != 0)
m1 = jichuan(i , s , b , l) ;
if ((m1 == 0) && (m0 == 0))
break ;
}
return 0 ;
}
|
49 | 24038 | int min(int x,int y);
int main()
{
char s[501]={0};
int d[501][501]={0},e[501]={0};
gets(s);
int l,i,j,t;
l=strlen(s);
for (i=1;i<(l-1);i=i+1) //????
{
for (j=1;j<=min(i,l-i-1);j=j+1)
{
if (s[i-j]==s[i+j])
{
d[2*j+1][e[2*j+1]]=i;
e[2*j+1]=e[2*j+1]+1;
}
else
break;
}
}
for (i=0;i<(l-1);i=i+1) //???????????
{
for (j=0;j<=min(i,l-i-1);j=j+1)
{
if (s[i-j]==s[i+1+j])
{
d[2*j+2][e[2*j+2]]=i;
e[2*j+2]=e[2*j+2]+1;
}
else
break;
}
}
for(i=2;i<=l;i=i+1)
{
for (j=0;j<e[i];j=j+1)
{
if (i % 2==0)
{
for(t=(d[i][j]-i/2+1);t<=(d[i][j]+i/2); t=t+1)
printf("%c",s[t]);
printf("\n");
}
else
{
for(t=(d[i][j]-i/2);t<=(d[i][j]+i/2);t=t+1)
printf("%c",s[t]);
printf("\n");
}
}
}
return 0;
}
int min(int x,int y)
{
if (x>y) return(y);
else return(x);
}
|
49 | 24039 | int main()
{int b,i,r,x,y,z,n;
char a[600];
scanf("%s",a);
n=strlen(a);
for(i=2;i<=n;i++)
{for(r=0;r<=n-i;r++)
{z=0;
for(y=0;y<=i/2;y++)
{if(a[r+y]!=a[r+i-1-y]){z=1;break;}
}
if(z==0)
for(b=r;b<=r+i-1;b++)
printf("%c",a[b]);
if(b==r+i-1)
{printf("\n");b=0;}
}
}
} |
49 | 24040 | int print(char str[],int i,int j){
int t,I=i,J=j;
while(str[i]==str[j]&&j>=i){
i++;
j--;
};
if(j<i)
{ for(t=I;t<=J;t++) printf("%c",str[t]);
printf("\n");
}
return 0;
}
void main(){
char str[501];
int i,j,len;
gets(str);
len=strlen(str);
for(i=1;i<len;i++)
for(j=i;j<len;j++)
print(str,j-i,j);
} |
49 | 24041 | int main()
{
char s[1000];
char s1[1000],s2[1000];
int i,j,k=0,l=0,m,len,flag=0;
gets(s);
len=strlen(s);
j=1;
while(j<=len-1)
{
for(i=k;i<=len-j-1;i++)
{
for(m=0;m<=j;m++)
{
s1[m]=s[i+m];
s2[m]=s[i+j-m];
}
s1[m]='\0';
s2[m]='\0';
if(strcmp(s1,s2)==0)printf("%s\n",s1);
}
k++;
if(k=len-j)
{
k=0;j++;
}
}
return 0;
} |
49 | 24042 | char ch[600],length;
void search(int x,int y,int z)
{
int i;
for(i=0;i<z;i++)
if(ch[x-i]!=ch[y+i])return;
for(i=x-z+1;i<=y+z-1;i++)
cout<<ch[i];
cout<<endl;
}
int main()
{
int i,j,k;
cin>>ch;
length=strlen(ch);
for(i=2;i<=length;i++)
{
for(j=(i-1)/2;j<=length-i/2-1;j++)
{
if(i%2==0)search(j,j+1,i/2);
else search(j-1,j+1,i/2);
}
}
return 0;
} |
49 | 24043 | /*
* ????first.cpp
* ???00948343_??
* ?????2012/9/16
* ?????1???100?????????
*/
int main()
{
char a[500], b[30][500], temp[500];
cin >> a;
int length = strlen (a), i, j, k, count=0;
for (i=0;i<length;i++){
for (j=i+1;j<length;j=j+2){
for (k=0;k<(j-i+1)/2;k++){
if (a[i+k]!=a[j-k])
break;
}
if (k==(j-i+1)/2){
for (k=i;k<j+1;k++){
b[count][k-i]=a[k];
}
b[count][j+1-i]='\0';
count++;
}
}
}
for (i=0;i<count-1;i++){
for (j=0;j<count-1-i;j++){
if (strlen(b[j])>strlen(b[j+1])){
strcpy(temp,b[j]);
strcpy(b[j],b[j+1]);
strcpy(b[j+1],temp);
}
}
}
for (i=0;i<count;i++){
cout << b[i] << endl;
}
return 0;
}
|
49 | 24044 | char substr(char s[], int start, int end)
{
while ((end>start)&&(s[start]==s[end]))
{
start++; end--;
}
if(end>start) return 0;
else return 1;
}
void osubstr(char s[], int start, int end)
{
while(start<=end) putchar(s[start++]);
putchar('\n');
}
int main ()
{
char s[500];
int m,n,len,width;
gets(s);
len=strlen(s);
for(width=1; width<len; ++width)
{
for(m=0; m<=len-width;++m)
{
if(substr(s,m,m+width)) osubstr(s,m,m+width);
}
}
getchar();
getchar();
getchar();
}
|
49 | 24045 | int main()
{
int i,j,k,m,n;
char st[500];
scanf("%s",st);
for(i=2;i<=500;i++)
{
for(j=0;j<500-i+1;j++)
{
if(st[j]=='\0')
break;
m=j+i-1;
for(k=j;k<m;k++)
{
if(st[k]!=st[m])
break;
else
m=m-1;
}
if(k>=m)
{
for(n=j;n<j+i;n++)
{
printf("%c",st[n]);
if(n==j+i-1)
printf("\n");
}
}
}
}
}
|
49 | 24046 | void pdjsc(char c[10000])
{
int i,j,k,l,p=0;
char tp,a,b;
l=strlen(c)-1;
for(i=0;i<=l;i++)
{if (c[i]==c[l-i]) continue;
else
{p=1;
break;
}
}
if (p==0) printf("%s\n",c);
}
int main()
{
int i,j,k,l,p=0;
char tp,a,b;
char c[10000]={' '};
char s[10000]={' '};
scanf("%s",s);
l=strlen(s)-1;
for(i=1;i<=l;i++)//i?????????-1?
for (j=0;j<=l-i;j++)//j??????
{for (k=0;k<=i;k++) c[k]=s[k+j];
pdjsc(c);
}
return 7;
} |
49 | 24047 | int main()
{
char a[55]={'\0'};
int i=0,j=0,count=0,k1=0,k2=0,l=0,num=0,m=0;
char c=getchar();
while('\n'!=c)
{
a[i]=c;
i++;
c=getchar();
}
count=i;//???????????????
for(i=2;i<=count;i++)
{
for(j=0;j<=count-i;j++)
{
num=0;
char b[55]={'\0'},d[55]={'\0'};
for(k1=j;k1<i+j;k1++)
b[k1]=a[k1];
for(k2=j;k2<i+j;k2++)
d[k2]=a[i+j-k2-1+j];//????2????????????????
for(l=j;l<i+j;l++)
{
if(b[l]==d[l])
num++;
}
if(num==i)
{
for(m=j;m<i+j;m++)
cout<<b[m];
cout<<'\n';
}
else
continue;
}//????????????????
}
return 0;
} |
49 | 24048 |
int main()
{
char str[501];
int i, j, m,n, k, length, flag;
//???????????????????????????
cin >> str;
length = strlen(str); //?????
for (i = 2; i <= length; i++) //???????????
for (j = 0; j <= length - i; j++)//???????????
{
flag = 1;
for (m = j, n = j + i - 1; m < n; m++, n--)
if (str[m] != str[n])
{
flag = 0; break;
}
if (flag)
{
for (k = j; k <= j + i - 1; k ++)
cout << str[k];
cout << endl;
}
}
return 0;
}
|
49 | 24049 |
int main() {
char a[600];
cin>>a;
int l,i,j,start,num;
char box1[600],box2[600];
for(l=2;l<=strlen(a);l++)
{
for(start=0;start<=strlen(a)-l;start++)
{
memset(box1,600,'\0');
memset(box2,600,'\0');
num=0;
for(i=start;i<start+l;i++)
{
box1[num++]=a[i];
}
for(i=0;i<l;i++)
{
box2[i]=box1[l-1-i];
}
for(i=0;i<l;i++)
{
if(box1[i]!=box2[i])
break;
if(i==l-1)
{
for(j=0;j<l;j++)
{
cout<<box1[j];
}
cout<<endl;
}
}
memset(box1,600,'\0');
memset(box2,600,'\0');
}
}
return 0;
} |
49 | 24050 |
int main()
{
int flag,i,n;
char a[501],*j,*l,*r;
cin>>a;n=strlen(a);
for(i=1;i<n;i++)
{
for(j=a;*(j+i);j++)
{
flag=1;
for(l=j,r=j+i;l<r;l++,r--)
if(*l!=*r){flag=0;break;}
if(flag)
{
for(l=j;l<=j+i;l++)cout<<*l;
cout<<endl;
}
}
}
return 0;
} |
49 | 24051 | //****************************************
//*??: ???? **
//*??: ??? **
//*???2011 11 15 **
//****************************************
int i , l ;
char str[501]; //???????
void f(int num,int len) //????
{
if(len <= 0 ) //?length?????????????
{
int j ;
for(j = i ; j < i + l ; j++)
cout << str[j];
cout << endl;
}
else
{
if( str[num] == str[num + len - 1] ) //????????
f(num + 1 , len - 2); //??????
}
}
int main()
{
int lenth; //??????
cin.getline( str , 501 ); //??????
lenth = strlen(str); //????????
for( l = 2 ; l < lenth ; l++)
for( i = 0 ; i+l-1 <= lenth ; i++)//??
f(i , l); //????
return 0;
} |
49 | 24052 | void print(int x,int y);//???????
char s[502];//???????
int main()
{
int i,j,k=1,length;
cin>>s;//??
length=strlen(s);
while(k<length)//k???????????
{
for(i=0,j=k;j<length;i++,j++)//?????????????????????????????????
{
int begin=i;int end=j;
while(begin<end)
{
if(*(s+begin)!=*(s+end)) {break;}//???begin?end??????????????????
else {begin++;end--;}//????????????????????????????
}
if(begin>=end)//??begin????end???a[i]?a[j]??k??????????
{
print(i,j);//??
}
}
k++;//??+1??????????
}
return 0;
}
void print(int x,int y)//???????????
{
for(int t=x;t<=y;t++)
{
cout<<*(s+t);
}
cout<<endl<<endl;
} |
49 | 24053 | //************************************************
//* ?????4.cpp *
//* ?????? 1200012877 *
//* ???2012 ? 11 ? 18 ? *
//* ????????? *
//************************************************
int main()
{
char win[501];
int sum,t=0;
cin.getline(win,501);
sum=strlen(win);
for(int i=2;i<=500;i=i+2)
{
for(int j=0;j<sum;j++)
{
if (j+i-1>sum)break;
if (win[j]==win[j+i-1])
{
t=0;
for(int p=1;p<=(i/2)-1;p++)
{
if (win[j+p]==win[j+i-1-p])
{
t++;
}
}
if (t==(i/2)-1)
{
for(int k=j;k<=j+i-1;k++)
{
cout<<win[k];
}
cout<<endl;
}
}
}
}
return 0;
}
|
49 | 24054 |
int main()
{
int i,j,a,h=0,k=0,m=0;
char str[500];
gets(str);
a=strlen(str);
for(j=1;j<(a-1);j++){
for(i=0;(i+j)<a;i++){
if((j-1)%2==0){
for(k=0;k<=(j-1)/2;k++){
if(str[i+k]!=str[i+j-k])
h=1;
}
}
else{
for(k=0;k<=j/2;k++){
if(str[i+k]!=str[i+j-k])
h=1;
}
}
if(h==0){
for(h=0;h<j;h++)
printf("%c",str[i+h]);
printf("%c\n",str[i+j]);
}
h=0;
}
}
return 0;
} |
49 | 24055 | int main()
{
char a[501];
int i, j, k, n, flag = 1;
for (i = 0; ; i++)
{
cin.get(a[i]);
if (a[i] == '\n')
break;
}
n = --i;
for (j = 1; j <= n; j++)
{
for (i = 0; i <= n; i++)
{
if (( i + j ) > n )
continue;
flag = 1;
for (k = 0; k <= (j / 2) ; k++)
{
if (a[i + k] != a[i + j - k])
flag = 0;
}
if (flag == 1)
{
for (k = i; k <= (i + j); k++)
cout << a[k];
cout << endl;
}
}
}
return 0;
}
|
49 | 24056 | main()
{
int a,b,c,n,m;
char x[510];
gets(x);
n=strlen(x);
for(a=1;a<=n-1;a++)
{
for(b=0;b<=n-1-a;b++)
{
m=0;
for(c=0;c<=a/2;c++)
{
if(x[b+c]!=x[b+a-c])
m=1;
else;
}
if(m==0)
{
for(c=b;c<=b+a;c++)
printf("%c",x[c]);
printf("\n");
}
else;
}
}
}
|
49 | 24057 | char array[N];
int main()
{
cin>>array;
int len=strlen(array);
for(int t=2; t<=len; t++)//?????????
for(int i=0; i<=len-t; i++)
{
int sum=0;
for(int j=0; j<t/2; j++)//?????????
{
if(array[i+j]==array[i+t-1-j]) sum++;
}
if(sum==t/2)//?
{
for(int j=i; j<i+t; j++)
cout<<array[j];
cout<<endl;
}
}
return 0;
} |
49 | 24058 |
int main()
{
char a[501];
cin>>a;
int n = strlen(a);
char b[n];
int i,j,k = 0,p,q,s = 0;
for (i = 2;i < n;i++)
{
for (k = 0;k < n - i+1;k++)
{
s = 0;
for (j = 0;j < i;j++)
{
b[j] = a[k + j];
}
for (p = 0,q = i-1;p < q;p++,q--)
if (b[p] == b[q])
s++;
if (s == i/2)
{
for(int x = 0;x < i;x++)
{
if (x == i-1)
cout<<b[x]<<endl;
else
cout<<b[x];
}
}
}
}
return 0;
} |
49 | 24059 |
int main(){
int m,i,j,k,c,g;
char a[550];
cin>>a;
c=strlen(a);
for(i=2;i<=c;i++){
for(j=0;j<c-i+1;j++){
g=0;
if(a[j]==a[j+i-1]){
if(i==2)cout<<a[j]<<a[j+i-1]<<endl;
else if(i%2==0&&i!=2){
for(k=1;k<=(i-2)/2;k++){
if(a[j+k]==a[j+i-1-k])
g++;
}
if(g==k-1){
for(m=j;m<j+i-1;m++)
cout<<a[m];
cout<<a[m]<<endl;
}
}
if(i==3)cout<<a[j]<<a[j+1]<<a[j+2]<<endl;
else if(i%2!=0){
for(k=1;k<(i-1)/2;k++){
if(a[j+k]==a[j+i-1-k])g++;
}
if(g==k-1){
for(m=j;m<j+i-1;m++)
cout<<a[m];
cout<<a[m]<<endl;
}
}
}
}
}
return 0;
} |
49 | 24060 |
int ishuiwen(char c[510])
{
int i,f=1;
for(i=0;i<strlen(c);i++)
{
if(c[i]!=c[strlen(c)-i-1])
{
f=0;
break;
}
}
return (f);
}
int main()
{
char c[510],jilu[510];
int i,j,k;
gets(c);
for(i=2;i<=strlen(c);i++)
{
for(j=0;j<=(strlen(c)-i);j++)
{
for(k=j;k<(j+i);k++)
{
jilu[k-j]=c[k];
}
jilu[i]='\0';
if(ishuiwen(jilu))
printf("%s\n",jilu);
}
}
return 0;
} |
49 | 24061 | /*
*???
*2010 - 11 - 30
*?????5 - ????
*/
int main()
{
int fun ( char [], int );//????
char alp[501];
cin >> alp;
int i, j, k, l;
l = strlen( alp );
for ( i = 2; i <= l; i = i + 2 )//???????????????????????????????
{
for ( j = 0; j <= l - i; j++ )//???????????l-i?
{
char str[501];
for ( k = 0; k < i; k++ )
{
str[k] = alp[k + j];
}
str[i] = '\0';//?str????????????
if ( fun ( str, i ) )//??????????????
cout << str << endl;
}
}
return 0;
}
int fun ( char str[], int a )
{
int i, flag = 1;//flag????????????
for ( i = 0; i <= a / 2; i++ )
{
if ( str[i] != str[a - i - 1] )//??????
{
flag = 0;//????
return 0;//??0
break;
}
}
if ( flag )//?????
return 1;//??1
}
|
49 | 24062 | void huiwen( int k ,char a[] )
{
int i,shime = 1 ;
for ( i = 0 ; i <= k / 2 ; i ++ )
if ( a[i] != a[ k - i - 1 ] )
shime = 0 ;
if ( shime )
{
for ( i = 0 ; i < k ; i ++ )
cout << a[i];
cout << endl;
}
}
int main ()
{
char yuan[500],yiduan[500];
int n,i,j,k ;
cin >> yuan ;
n = strlen ( yuan ) ;
for ( k = 2 ; k <= n ; k = k + 2 )
{
for ( i = 0 ; i + k <= n ; i ++ )
{
for ( j = i ; j <= i + k ; j ++ )
yiduan[j - i] = yuan[j] ;
huiwen ( k , yiduan );
}
}
return 0 ;
} |
49 | 24063 | int main()
{
char a[100],c[50][50],e[50];
int i,j,k,l,b,d=0;
for(i=0;;i++)
{
scanf("%c",&a[i]);
if(a[i]=='\n')
break;
}
for(j=0;j<i;j++)
{
for(k=j+1;k<=i;k++)
{
b=0;
for(l=j;l<=k;l++)
{
if(a[l]!=a[k+j-l])
{
b=1;
break;
}
}
if(b==0)
{
for(b=j;b<=k;b++)
c[d][b-j]=a[b];
c[d][k-j+1]='\0';
d++;
}
}
}
for(i=2;i<100;i++)
{
for(j=0;j<d;j++)
{
if(strlen(c[j])==i)
printf("%s\n",c[j]);
}
}
return 0;
} |
49 | 24064 | int main()
{
char str[501]={'\0'};
cin.getline(str,501);
int i,j,k,n=0;
for(n=0;str[n]!='\0';n++);
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
{
for(k=i;k>0;k--)
if(str[j+i-k]!=str[j+k])
break;
if(k==0)
{
for(k=j;k<=j+i;k++)
cout<<str[k];
cout<<endl;
}
}
return 0;
}
|
49 | 24065 | int judge(char *p,int l)
{
char *x,*t;
t=p;
int y=1;
x=t+l-1;
while ((t<=x) && y)
{
if (*t!=*x) y=0;
t++;
x--;
}
return y;
}
void pp(char *p,int l)
{
int i;
char *t;
t=p;
for (i=1;i<=l;i++)
printf("%c",*(p+i-1));
printf("\n");
}
void main()
{
char c[3243];
int i,j,k,l;
char *p;
//freopen("tt.in","r",stdin);
//freopen("tt.out","w",stdout);
gets(c); l=strlen(c); p=c;
for (i=2;i<=l;i++)
for (j=1;j<=l-i+1;j++)
if (judge(p+j-1,i))
pp(p+j-1,i);
} |
49 | 24066 | int main()
{
char str[1000];
int i, j, ii, jj, len, q;
cin >> str;
len = strlen(str);
for (q = 2; q <= len; q++)
{
for (i = 1; str[i] != 0; i++)
{
ii = i;
jj = i;
if (str[i - 1] == str[i + 1])
{
while ((str[ii] == str[jj]) && (ii >= 0) && (str[jj] != 0))
{
if (ii != jj)
{
if (jj - ii + 1 == q){
for (j = ii; j <= jj; j++)
cout << str[j];
cout << endl;}
}
ii --;
jj ++;
}
}
/*else
if ((str[i - 1] == str[i]))
{
ii --;
while ((str[ii] == str[jj]) && (ii >= 0) && (str[jj] != 0))
{
if (ii != jj)
{
for (j = ii; j <= jj; j++)
cout << str[j];
cout << endl;
}
ii --;
jj ++;
}
}*/
else
if (str[i] == str[i + 1])
{
jj ++;
while ((str[ii] == str[jj]) && (ii >= 0) && (str[jj] != 0))
{
if (ii != jj)
{
if (jj - ii + 1 == q)
{
for (j = ii; j <= jj; j++)
cout << str[j];
cout << endl;
}
}
ii --;
jj ++;
}
}
}
}
return 0;
} |
49 | 24067 | int main ()
{
char a[500],b[10000][500]={0},c[10000]={0};
int n,i,j,t=0,k,p=0,m,s=0;
scanf("%s",a);
n=strlen(a);
for(j=2;j<=n;j++)
{
for(i=0;i<n+1-j;i++)
{
for(k=i;k<i+j;k++)
{
b[t][p]=a[k];
p++;
}
b[t][p]='\0';
t++;
p=0;
}
}
for(t=0;b[t][0]!='0';t++)
{
m=strlen(b[t]);
for(i=0;i<m;i++)
{
c[i]=b[t][m-1-i];
}
for(i=0;i<m;i++)
{
if(c[i]==b[t][i])
{
s++;
}
}
if(s==m)
printf("%s\n",b[t]);
s=0;
}
return 0;
} |
49 | 24068 | char b[505];
int check(){
int i,len,j;
len=strlen(b);
for(i=0,j=len-1;i<j;i++,j--)
if(b[i]!=b[j])return 0;
return 1;
}
void main()
{
char a[510];
int i,j,k,len;
gets(a);
len=strlen(a);
for(i=2;i<=len;i++){
for(j=0;j<=len-i;j++){
for(k=0;k<i;k++){
b[k]=a[k+j];
}
b[k]=0;
if(check())printf("%s\n",b);
}
}
}
|
49 | 24069 | //**********************************************
//**???????******************************
//**?????? 1000012741*********************
//**???2010?11?26?************************
//**********************************************
void pal(char str[503], int m, int i) //??pal?????????????????????
{
int j = i, p = i + 1; //????????????j?p
while (str[j] == str[p] && j >= 0 && str[p] != '\0') //????????????
{
j--;
p++;
if (p != (i + 1) && ((p - j - 1) == m)) //?????????????
{
for (int k = j + 1; k < p; k++) //????
cout << str[k];
cout << endl;
}
}
}
int main()
{
char str[503];
int i, j, k, p, m, l; //m?????????l?????????
cin >> str; //?????
l = strlen(str); //????
for (m = 2; m <= l; m = m + 2) //??????????
{
for (i = 0; str[i + 1] != '\0'; i++)
pal(str, m, i);
}
for (m = 3; m <= l; m = m + 2) //??????????
{
for (i = 0; str[i] != '\0'; i++) //??????????
{
j = i - 1;
p = i + 1;
while (str[j] == str[p] && j >= 0 && str[p] != '\0')
{
j--;
p++;
}
if (p != (i + 1) && ((p - j - 1) == m)) //?????????????
{
for (k = j + 1; k < p; k++)
cout << str[k]; //????
cout << endl;
}
}
}
return 0;
}
//********************************************** |
49 | 24070 | int main()
{
char p[501];
scanf("%s",p);
int len=strlen(p);
for(int i=2;i<len;i++)
{
char **q=(char **)malloc(sizeof(char *)*len);
for(int j=0;j<len-i+1;j++)
{
q[j]=(char *)malloc((i+1)*sizeof(char));
for(int h=0;h<i+1;h++)
q[j][h]='\0';
for(int h=0;h<i;h++)
q[j][h]=p[j+h];
}
for(int j=0;j<len-i+1;j++)
{
char temp[501]={'\0'};
int k=0;
for(int h=i-1;h>=0;h--)
{
temp[k]=q[j][h];
k++;
}
if(strcmp(temp,q[j])==0)
printf("%s\n",q[j]);
}
}
}
|
49 | 24071 | int main ()
{
char a[500],b[500],c[500];
int i,k,j,l,m,h,x;
gets(a);
int n=strlen(a);
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
{
m=0;
x=0;
for(k=j;k<=j+i;k++)
{
b[m]=a[k];
m++;
}
for(l=0;l<m;l++)
{
c[l]=b[m-1-l];
}
for(h=0;h<m;h++)
{
if(b[h]!=c[h])
x++;
else x=x;
}
if(x==0)
{
for(k=j;k<=j+i;k++)
printf("%c",a[k]);
printf("\n");
}
}
return 0;
}
|
49 | 24072 | /***************************************************************************
*autour:???
*number:1000012905
*description:????
****************************************************************************/
//hui ???????????????
int hui(char a[], int n)
{
int k = (int) (n / 2);
int i;
//??????
for (i = 0; i <= k; i ++)
{
if(a[i] != a[n - 1 - i])
{break;}
}
//??
if(i == k + 1)
{
return 1;
}
else
{
return 0;
}
}
int main()
{
//??????????
char str[500];
int sl = 0;
cin.getline(str, 501);
sl = strlen(str);
int i, j, k;
char jian[500]; //??????????
int jl = 0; //??????
for (i = 2; i <= sl; i ++)
{
for (j = 0; j <= sl - i; j ++)
{
//??????j???????i???
for (k = j; k < j + i; k ++)
{
jian[k - j] = str[k];
}
jl = i;
//?????????,?????
if(hui(jian, jl))
{
int t;
for (t = 0; t < jl; t ++)
{
cout << jian[t];
}
cout << endl;
}
}
}
return 0;
}
|
49 | 24073 |
int main ()
{
char str[505];
int i, j, m, length, a[255][505] = {0}, flag = 0;
cin.getline (str, 500);
length = strlen(str);
for (i = 0; i < length - 1; i++)
{
if (str[i] == str[i + 1])
{
a[0][i] = 1;
j = 1;
while (i + j + 1 < length && i - j >= 0)
{
if (str[i - j] == str[i + j + 1])
{
a[j][i] = 1;
j++;
}
else
break;
}
}
}
for (i = 0; i < length / 2; i++)
for (j = 0; j <length - 1; j++)
{
if (a[i][j] == 1)
{
flag = 1;
for (m = j - i; m <= j + 1 + i; m++)
cout << str[m];
}
if (flag == 1)
{
cout << endl;
flag = 0;
}
}
return 0;
} |
49 | 24074 | int panduan(char *a,int n)
{
int i,j,k=0;
for (i=0;i<n/2;i++)
{
if (*(a+i)!=*(a+n-1-i)) k=1;
}
if (k==1) return 0;
else return 1;
}
int main()
{
char c[200]={'\0'};
char a[200][200]={'\0'};
int i,j,k,l;
scanf("%s",c);
for (i=2;i<strlen(c);i++)
{
l=strlen(c)-i+1;
for (j=0;j<l;j++)
{
for (k=0;k<i;k++)
{
*(*(a+j)+k)=*(c+j+k);
}
if (panduan(*(a+j),strlen(*(a+j)))==1)printf("%s\n",*(a+j));
}
}
return 0;
}
|
49 | 24075 | int main()
{
char a[100000],b[1000];
int l,i,j,t,p,q;
scanf("%s",&a);
l=strlen(a);
for(i=1;i<l-1;i++)
{
for(j=0;j<l;j++)
{
t=j+i;
p=j;
do{
if(a[p]==a[t])
{
t=t-1;
p=p+1;
}
else
{
break;
}
}while(t>p);
if(t<=p)
{
for(q=j;q<(j+i);q++)
{
printf("%c",a[q]);
}
printf("%c\n",a[j+i]);
}
}
}
return 0;
}
|
49 | 24076 | int main()
{
char a[501]={0};
int i,j,k,t,m,q,p=0;
gets(a);
int b[501]={0};
for(i=0;a[i]!='\0';i++)
if(a[i]==a[i+1])
b[i]=1;//????????
for(j=1;j<250;j++)//j????????? xuyaoxiugai!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
{
for(q=0;q<500;q++)
{ p=0;
if(b[q]==1)
{
for(t=0;t<j;t++)//<<<<<<<<<<========????????
{if(a[q-t]==a[q+t+1])
p++;}
if(p==j)
{for(m=0;m<2*j;m++)
printf("%c",a[q-t+m+1]);
printf("\n");}
}}
}} |
49 | 24077 | //**********************
//*??????? **
//*?????? **
//*???1200012957 **
//*???2012-11-18 **
//***********************
int main ()
{
char str[500];
int i, j, k, len, m, n, count;
cin.getline(str,500);
len = strlen(str);
// i + 1????????i???1??len - 1?
for (i = 1; i < len; i++ )
{
// j??????????
for (j = 0; j < len - i; j++ )
{
// ???i, j???????????????
m = j;
n = j + i;
// ???????
count = 0;
// ?????????????????????
while (str[m] == str[n] && m < n)
{
m++ ;
n-- ;
count++ ;
}
// ???????????????????count??[i / 2] + 1;
if (count == i / 2 + 1)
{
// ?????????
for (k = j; k <= j + i; k++ )
{
cout << str[k];
}
cout << endl;
}
}
}
return 0;
}
|
49 | 24078 | //******************************************
//*???????.cpp **
//*??: ?? 1100012808 **
//*???2011.11.13 **
//******************************************
void zch(char a[])
{
int i = 0, j = 0, k = 0, flag = 0, l;
for (i = 2; i < strlen(a); i++)
{
for (j = 0; j <= strlen(a) - i; j++)
{
for (k = j; k < i / 2 + j; k++)
{
if (a[k] != a[i + j - 1 - (k - j)])
break;
}
if (k == i / 2 + j)
{
for (l = j; l < i + j; l++)
cout << a[l] ;
cout << endl;
cout << endl;
}
}
}
return;
}
int main() //???
{ //?????
char ch[100000];
int i = 0;
cin.getline(ch, 100000);
zch(ch);
return 0;
}
|
49 | 24079 | int main()
{
int t,k,i,j,m;
char c[500];
for(i=0;;i++)
{scanf("%c",&c[i]);
if(c[i]=='\n') break;}
t=i;
for(k=2;k<=t;k++)
{for(i=0;i<(t-k+1);i++)
{for(j=i;j<=(i+k/2);j++)
{if(c[j]!=c[2*i+k-1-j]) break;}
if(j==(i+k/2+1))
{for(m=i;m<i+k;m++)
printf("%c",c[m]);
if(m==i+k) printf("\n");}}}
return 0;
} |
49 | 24080 | int main()
{
char a[500];
int i, j, k, l, flag;
gets(a);
l = strlen(a);
for (i = 1; i < l; i++)
for (j = 0; j < l - i; j++)
{
flag = 1;
for (k = j; k <= j + i; k++)
if (a[k] != a[2*j + i - k])
flag = 0;
if (flag)
{
for (k = j; k <= j + i; k++)
cout << a[k];
cout << endl;
}
}
return 0;
} |
49 | 24081 | int main()
{
char s[600];
int len=2,j,m,i,g=0;
cin>>s;
for(len=2;len<=strlen(s);len++)//???????????
{
for(j=0;j<strlen(s)-len+1;j++)
{
g=0;//??????????
for(m=0;m<=len/2-1;m++)
{
if(s[j+m]!=s[j+len-1-m]){g=1;break;} //??????????? ????g??????
}
if(g==0)
{
for(i=j;i<j+len;i++)
{
cout<<s[i];
}
cout<<endl;
}
}
}
return 0;
}
|
49 | 24082 |
int main()
{
char str[510];
int len = 0, x, y;
cin >> str;
len = strlen(str);
for ( int i = 1; i < len; i++ )
{
for ( int j = 0; j < len - i; j++ )
{
for ( x = j, y = j + i; x < y; x++, y-- )
{
if ( str[x] != str[y] )
break;
}
if ( x >= y )
{
for ( int m = j; m <= j + i; m++ )
cout << str[m];
cout << endl;
}
}
}
return 0;
} |
49 | 24083 | int main()
{
char a[500];
int i, j, k, w;
cin.getline(a, 500);
int len = strlen(a);
for (i = 2; i <= len; i++)
{
if( i%2==0)
{
for( j =0;j <= len-i;j++)
{
for(w=0;w<i/2;w++)
{
if(a[j+w] != a[i+j-1-w])
break;
}
if(w == i/2)
{
for(k = 0; k<i;k++)
cout << a[j+k];
cout << endl;
}
}
}
else
{
for( j =0;j <= len-i;j++)
{
for(w=0;w < i/2 - 1;w++)
{
if(a[j+w] != a[i+j-1-w])
break;
}
if(w == i/2)
{
for(k = 0; k < i; k++)
cout << a[j+k];
cout << endl;
}
}
}
}
return 0;
}
|
49 | 24084 | int main()
{
char a[501];
int b[500] = {0};
cin >> a;
int i, j = 0, k = 0;
for (k = 2; k <= (int)strlen(a); k += 2)
{
for (i = 0; i < (int)strlen(a) + 1 - k; i++)
{
if ((a[i] == a[i+k-1])&&(b[i+1] == 0))
{
for (j = i; j<= i + k - 1; j++)
{
cout << a[j];
}
b[i] = 0;
cout << endl;
}
else
{
b[i] = 1;
}
}
}
return 0;
} |
49 | 24085 | int plalindrome(char *p){//?????????
int n,i;
for(n=0;*(p+n)!=0;n++);
for(i=0;i<n/2;i++)
if(*(p+i)!=*(p+n-1-i))break;
if(i<n/2)return 0;//??0????
return 1;//??1???
}
int main(){
int i,j,k,n;
char string[501],substring[501];
cin.getline(string,501);
for(n=0;string[n]!=0;n++);
for(i=2;i<=n;i++)//??????????? i??????
for(j=0;j<=n-i;j++){//j????????
for(k=0;k<i;k++)substring[k]=string[j+k];
substring[k]=0;
if(plalindrome(substring))cout<<substring<<endl;
}
return 0;
} |
49 | 24086 | void f(int n,char s[],int len);
int main()
{
char s[520];
cin.getline(s,518);
int i,len;
len=strlen(s);
for (i=2;i<=len;i++)
{
f(i,s,len);
}
return 0;
}
void f(int n,char s[],int len)
{
int j,p,k;
for (j=0;j<=len-n;j++)
{
for (p=j;p<=j+n-1;p++)
{
if (s[p]!=s[2*j+n-1-p])
break;
}
if (p==j+n)
{
for (k=j;k<=j+n-1;k++)
{
cout<<s[k];
}
cout<<endl;
}
}
} |
49 | 24087 | void f(char c[],char b[],int n,int i)
{
if(i<=n-1)
{
b[i]=c[n-i-1];
f(c,b,n,i+1);
}
}
int main()
{
char a[501],b[501]={0},c[501]={0};
int n,i,j,k;
gets(a);
n=strlen(a);
for(i=2;i<=n;i++)
{
for(j=0;j+i<=n;j++)
{
for(k=0;k<i;k++)
{
c[k]=a[j+k];
}
f(c,b,i,0);
if(strcmp(c,b)==0)
printf("%s\n",c);
else continue;
}
}
return 0;
}
|
49 | 24088 | //******************************************
//*???????.cpp **
//*??: ?? 1100012808 **
//*???2011.11.13 **
//******************************************
void zch(char a[]) //???????????
{
int i = 0, j = 0, k = 0, flag = 0, l;
for (i = 2; i < strlen(a); i++) //i????????????
{
for (j = 0; j <= strlen(a) - i; j++) //j?????????
{
for (k = j; k < i / 2 + j; k++) //k????????????
{
if (a[k] != a[i + j - 1 - (k - j)])
break;//???????????
}
if (k == i / 2 + j)//????????k??i/2+j
{
for (l = j; l < i + j; l++)//??????????
cout << a[l] ;
cout << endl;
}
}
}
return;
}
int main() //???
{ //?????
char ch[100000];
cin.getline(ch, 100000); //???????
zch(ch); //??zch??
return 0;
} //?????
|
49 | 24089 | /*
* file homework 9_5
* author ??
* date 2010-11-24
* description
???????????????????
*/
int main()
{
char str[501];
int i, j, k, len;
cin >> str;
len = strlen(str);
for (i = 2; i <= len; i ++)
for (j = 0; j <= len - i; j ++)
{
for (k = 0; k <= (i - 1) / 2; k ++)
if (str[j + k] != str[j + i - 1 - k])
break;
if (k > (i - 1) / 2)
{
for (k = 0; k < i; k ++)
cout << str[j + k];
cout << endl;
}
}
return 0;
}
|
49 | 24090 | int main ()
{
char s[501],t[501];
int i,j,l,c,d,temp=0,m,n=0;
scanf("%s",s);
l=strlen(s);
for (i=1;i<=l;i++)
{
for (j=0;j<l-i;j++)
{
d=j+i;
c=j;
while (c<d)
{
if(s[c]==s[d])
{
c++;d--;
}
else
{
temp=1;
break;
}
}
if (temp==0)
{
for (m=j;m<=j+i;m++)
{
t[n]=s[m];
t[n+1]='\0';
n++;
}
printf("%s\n",t);
n=0;
} temp=0;
}
}
return 0;
} |
49 | 24091 | char a[310];
void hui(int i,int l){
int j;
for(j=0;j<l;j++){
if(a[i+j]!=a[l+i-1-j])
return ;
}
for(j=0;j<l;j++)
cout<<a[i+j];
cout<<endl;
return;
}
int main()
{
int n,x,k;
cin>>a;
n=strlen(a);
for(x=2;x<n;x++)
{
for(k=0;k<n;k++){
hui(k,x);
}
}
return 0;
}
|
49 | 24092 | void find(char sen[],char t[],int j,int i);
void trans(char t[],char tt[]);
int main()
{
char sen[501],t[500],tt[500];
int i=2,j,len,p,s,len1;
cin>>sen;
len=strlen(sen);
while(i<=len)//i??????,j??????
{
j=0;
while(j<=len-i)
{
p=1;
find(sen,t,j,i);
trans(t,tt);
for(s=1;s<=i;s++)
{
if(t[s]!=tt[s])
{
p=0;break;
}
}
if(p==1)
{
for(s=1;s<=i;s++)
{
if(s!=i)
{
cout<<t[s];
}
else
{
cout<<t[s]<<endl;
}
}
}
j++;
}
i++;
}
return 0;
}
void find(char sen[],char t[],int j,int i)//??????
{
int k,n;
for(k=j,n=1;k<=j+i-1;k++,n++)
{
t[n]=sen[k];
}
t[n]='\0';
}
void trans(char t[],char tt[])//??????????????
{
int k,n,len;
len=strlen(t);
for(k=1,n=len-1;k<=len-1;k++,n--)
{
tt[n]=t[k];
}
tt[len]='\0';
}
|
49 | 24093 | int main()
{
char str1[500];
int i,j,n,x=0,t;
gets(str1);
for (n=2;n<=strlen(str1);n++)
{
for (i=0;i<strlen(str1);i++)
{
if((i+n)>strlen(str1)) break;
for (j=i;j<=i+n-1;j++)
{
if(str1[j]==str1[i+i+n-1-j]) x=x+1;
}
if(x==n)
{
for(t=i;t<i+n;t++) printf("%c",str1[t]);
printf("\n");
}
x=0;
}
}
return 0;
}
|
49 | 24094 | int main()
{
char s[500];
int length,l,i,j,p,k;
cin>>s;
length=strlen(s);
for(l=2;l<=length;l++)
for(i=0;i<length-l+1;i++)
{
int flag=0;
for(j=i,p=1;j<l/2+i;j++)
{
if(s[j]!=s[j+l-p])
{
flag=1;
break;
}
else
p+=2;
}
if(flag==0)
{
for(k=i;k<i+l;k++)
cout<<s[k];
cout<<endl;
}
}
return 0;
}
|
49 | 24095 | /*????????
????00948344 ??
?????2010//12/31
*/
int main(){
char str[500];
cin>>str;
int i,j,k,l,len;
len=strlen(str);
for(i=2;i<len;i++)
{
for(j=0;j<len+1-i;j++)
{
for(k=j,l=j+i-1;k<l;k++,l--)
{
if(str[k]!=str[l])
break;
}
if(k>=l)
{
for(k=j;k<j+i;k++)
cout<<str[k];
cout<<endl;
}
}
}
return 0;
}
|
49 | 24096 | int main()
{
char a[500];
gets(a);
int i,j,n,t,p;
n=strlen(a);
for(i=2;i<=n;i++){
for(j=0;j<=n-i;j++){
for(t=j;t<j+i/2;t++){
if(a[t]!=a[2*j+i-1-t])
break;
}
if(t==j+i/2){
for(p=j;p<j+i;p++)
printf("%c",a[p]);
printf("\n");
}
}
}
} |
49 | 24097 | int main(){
char a[501];
cin.getline(a,501);
int i,j;
int k;
int p;
int s;
int count=0;
int len;
len=strlen(a);
for(i=0;i<len-1;i++){
if(a[i]==a[i+1]){cout<<a[i]<<a[i+1]<<endl;}
}
for(i=3;i<=len;i++)
for(j=0;j<len;j++){
if(i%2==1){
k=(int)i/2;
if(j-k>=0&&j+k<len){
for(s=1;s<=k;s++){
if(a[j-s]==a[j+s])count++;
else break;
}
if(count==k){
for(p=j-k;p<j+k;p++)
cout<<a[p];
cout<<a[j+k]<<endl;
}count=0;
}
}
else if(i%2==0){
k=(int)i/2-1;
if(j-k>=0&&j+k+1<len){
if(a[j]==a[j+1]){
for(s=1;s<=k;s++){
if(a[j-s]==a[j+1+s])count++;
else break;
}
if(count==k){
for(p=j-k;p<j+k+1;p++)
cout<<a[p];
cout<<a[j+k+1]<<endl;
}
}count=0;
}
}
}
return 0;
} |
49 | 24098 | void f(char s[502],int m)
{
char s1[502];
int i,k=0;
m=strlen(s);
for(i=0;i<m;i++)
{
s1[m-1-i]=s[i];
}
for(i=0;i<m;i++)
{
if(s1[i]==s[i])
k++;
else break;
}
if(k==m)
printf("%s\n",s);
}
int main()
{
char s[502],str[502];
int n,i,j,k;
gets(s);
n=strlen(s);
for(i=2;i<=n;i++)
{
for(j=0;j<=n-i;j++)
{
for(k=0;k<i;k++)
{
str[k]=s[j+k];
}
str[i]='\0';
f(str,i);
}
}
return 0;
}
|
49 | 24099 | int main()
{
char a[500];
int i,j,k,q,m;
gets(a);
for(i=0;;i++)
{if(a[i]==0)
{q=i;break;}
}
char b[500],c[500];
for(i=0;i<500;i++)
{b[i]=0;
c[i]=0;
}
for(i=2;i<=q;i++)//??????
{
for(j=0;j<=q-i;j++)//?j??
{
for(m=0;m<i;m++)
b[m]=a[j+i-m-1];
for(m=0;m<i;m++)
c[m]=a[j+m];
if(strcmp(b,c)==0)
{puts(c);
}
}
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.