id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
24,200 | int main()
{
char c[500];
int i,j,h,n,t,f;
scanf("%s",c);
h=strlen(c);
for(i=2;i<=h;i++)
{
for(j=0;j<=h-i;j++)
{
n=-1;t=j;f=2*j+i-1;
while(t<j+i)
{
if(c[t]==c[f-t])
{
n=t;
t++;
}
else break;
}
if(n==i+j-1)
{
for(t=j;t<j+i;t++)
{
printf("%c",c[t]);
}
printf("\n");
}
}
}
return 0;
}
| 49 |
24,201 | //***********************
//???????
//?????? 1200012914
//???2012.11.11
//***********************
int main()
{
char str[501]; //?????\0
int len; //???????len
int i, j, k, l; //??????
cin >> str; //????
len = strlen(str); //????????
for (i = 2; i <= len; i++) //??????????2????len
{
for (j = 0; j <= len - i; j++)
//????????i??????????????len-i+1?
//?????len-i???
{
for (k = 1; k <= i / 2; k++)
//?????????????????i/2?????
{
if (str[j + k - 1] != str[j + i - k]) break;
//?????????????????
}
if (k == i / 2 + 1) //k=1/2+1???????????????
{
for (l = j; l < j + i; l++)
//????????j????i?????????j+i-1??
{
cout << str[l];
}
cout << endl; //????????????
}
}
}
return 0;
}
| 49 |
24,202 | //????
//2010?11?24?
//1000012753 ???
char str[1000];
int cycle(int a, int b)
{
while (b >= 0)
{
if (str[a] == str[a + b - 1])
{
a++;
b -= 2;
}
else
return 1;
}
return 0;
}
int main()
{
int i, j, k, l;
cin >> str;
l = strlen(str);
for (i = 2; i <= l; i++)
for (j = 0; j <= l - i; j++)
if (cycle (j, i) == 0)
{
for (k = j; k < j + i; k++)
cout << str[k];
cout << endl;
}
return 0;
} | 49 |
24,203 | 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 |
24,204 | void huiwen(int i, int l, char a[501])
{
int j, k, flag = 0;
for (j = 0; j <= l - i; j ++)
{
flag = 1;
for (k = 0; k <= i - 1; k ++)
{
if (a[j+k] != a[j+i-1-k])
flag = 0;
}
if (flag)
{
for (k = 0; k <= i - 1; k ++)
cout << a[j+k];
cout << endl;
}
}
}
int main()
{
char a[501];
cin >> a;
int i, l;
l = strlen(a);
for (i = 2; i <= l; i ++)
{
huiwen(i, l, a);
}
return 0;
}
| 49 |
24,205 | //*************************************************
//***???????***
//***??????***
//***???2012.1.11***
//*************************************************
int main ()
{
int i,j,k,flag;
char a[501];
cin >> a;
for (i = 1; a[i] != '\0'; i++)
{
for (j = 0; a[j] != '\0'; j++)
{
flag = 1;
for (k = 0;j + i - k >= j + k; k++)
{
if (a[j + i - k] != a[j + k])
flag = 0;
}
if (flag == 1)
{
for (k = 0; k <= i; k++)
cout << a[j + k];
cout << endl;
}
}
}
return 0;
} | 49 |
24,206 | void f(char *p1,char *p2)
{
char *p=p1,*q=p2;
for(;p1<p2;p1++,p2--)
if(*p1!=*p2) break;
if(p1>=p2) {for(;p<=q;p++) printf("%c",*p);printf("\n");}
}
int main(int argc, char *argv[])
{
char a[500];
int i,j;
char *p,*q;
scanf("%s",a);
for(i=1;i<=strlen(a)-1;i++)
for(j=0;j<strlen(a)-i;j++)
{p=a+j;q=a+i+j;f(p,q);}
return 0;
}
| 49 |
24,207 |
/*
???:Huiwen()
??:???????????,?????1,????0
**/
int Huiwen(char part[])
{
char check[501];
memset(check, 0, sizeof(check));
int i, j, len;
len = strlen(part);
j = len - 1;
for (i = 0; i < len; i++)
check[j--] = part[i];
check[len] = '\0';
return (!(strcmp(part, check)));
}
int main()
{
char input[501];
char part[501];
cin.getline(input, 500);
int i, j, k, t, len, n;
len = strlen(input);
for (n = 2; n <= len; n++)
{
for (i = 0; i <= len - n; i++)
{
memset(part, 0, 501);
part[0] = input[i];
k = 1;
for (j = i + 1; j < i + n; j++)
part[k++] = input[j];
part[k] = '\0';
if (Huiwen(part))
{
for (t = 0; t < k; t++)
cout << part[t];
cout << endl;
}
}
}
return 0;
}
| 49 |
24,208 | /*
* hehe.cpp
*
* Created on: 2012-12-04
* Author:??
* ?????????????????
*???????????????????????????
*??? abba cccdeedccc???????
*/
int main(){
char a[600];
char b[50][200][50];
int lena=0;
cin>>a;
lena=strlen(a); //??a???
for(int i=2;i<=lena;i++)
for(int p=0;p<=lena-i;p++)
{ for(int j=p;j<p+i;j++)
b[i][p][j]=a[j]; //b[][][]????????????????????????
int k=p; //?????????
for( ;k<=p+i/2;k++)
{ if( b[i][p][k]!=b[i][p][2*p+i-1-k]) //?????????????????????????????????2*p+i-1?
break;
}
int judgesame=0;
for(int j=p;j<i+p&&p>=1;j++)
if(b[i][p-1][j-1]==b[i][p][j])
judgesame++; //judgesame?????????????
if(k==(p+i/2+1)&&judgesame!=i)
{ for(int j=p;j<i+p;j++)
cout<<b[i][p][j]; //????
cout<<endl;
}
}
;
return 0;
}
| 49 |
24,209 | int main()
{
char a[100001];
int length,i,j,len,check,t;
scanf("%s",&a);
len=strlen(a);
for(length=2;length<=len;length++)
{
for(i=0;i<len;i++)
{
check=0;
for(j=0;j<=length/2;j++)
{
if(a[i+j]!=a[i+length-1-j])
{
check=1;
break;
}
}
if(check==0)
{
for(t=0;t<length;t++)
printf("%c",a[i+t]);
}
printf("\n");
}
}
return 0;
}
| 49 |
24,210 | int p=1;
int f(char str[500],int lens);
int main()
{
char str[500],lens;
cin.getline(str,500);
lens=strlen(str);
f(str,lens);
return 0;
}
int f(char str[500],int lens)
{
int i,j,flag=0,k=p;
for(i=0;i<lens;i++)
{
while(str[i-k+1]==str[i+k]&&(i-k+1)>=0&&i+k<lens&&k>0)
k--;
if(k==0)
{
flag=1;
for(j=i-p+1;j<=i+p;j++)
cout<<str[j];
cout<<endl;
}
k=p;
}
p++;
if(flag==1)
f(str,lens);
else
return 0;
} | 49 |
24,211 | void main()
{
char c[500];
scanf("%s",&c);
int i,j,k,l;
for(i=2;i<=strlen(c);i++)
{
for(j=0;j+i-1<strlen(c);j++)
{
char s1[500]={'\0'},s2[500]={'\0'};
for(k=j;k<=j+i-1;k++)
{
s1[k-j]=c[k];
}
for(l=0;l<i;l++)
{
s2[l]=s1[i-l-1];
}
if(strcmp(s1,s2)==0)
printf("%s\n",s1);
}
}
} | 49 |
24,212 | int main()
{
char c[505]={0};
cin.getline(c,505,'\n');
int num,i,j,k,standard,sum=0,q;
for(num=0;;num++)
{
if(c[num]=='\0')
break;
}
for(i=2;i<=num;i++) //??????
{
for(k=0;k<=num-i;k++) //?a[0]???a[num-i]
{
sum=0;
for(j=k;j<=k+i-1;j++)
{
if(c[j]==c[2*k+i-1-j])
standard=1;
else
standard=0;
sum=sum+standard;
}
if(sum==i)
{
for(q=k;q<k+i-1;q++)
cout<<c[q];
cout<<c[k+i-1]<<endl;
}
}
}
return 0;
} | 49 |
24,213 | /*
* qimolianxi10.cpp
*
* Created on: 2010-12-17
* Author: l
*/
int main(){
char a[501];//???????
cin.getline(a,501);//??
int i,j,l,k,p;
l=strlen(a);//????
for(i=2;i<=l;i++)//i?????????
for(j=0;j<=l-i;j++)
{
p=1;
for(k=j;k<=j+i/2;k++)
if(a[k]!=a[2*j+i-1-k])
p=0;//p?????????
if(p==1){//?????????
for(k=j;k<j+i;k++)
cout<<a[k];
cout<<endl;//???????
}
}
return 0;
}
| 49 |
24,214 | int main()
{
char array[501];
cin.getline(array,501);
int k,l,i,s=0;
for(i=0;i<strlen(array)-1;i++)
{
if(array[i]==array[i+1])
{
cout<<array[i]<<array[i+1]<<endl;
}
}
for(l=3;l<strlen(array);l++)
{
for(k=0;k<strlen(array)-l;k++)
{
for(i=0;i<=l/2;i++)
{
if(array[k+i]!=array[k+l-i])
{
s++;
break;
}
}
if(s==0)
{
for(i=0;i<=l;i++)
{
cout<<array[k+i];
}
cout<<""<<endl;
}
s=0;
}
}
return 0;
} | 49 |
24,215 |
int main(int argc, char *argv[])
{
int i,j,k,n=0;
char a[500]={'\0'};
gets(a);
for(i=0;i<500;i++)
{if(a[i]=='\0')
{
n=i;
break;
}
}
for(i=1;i<n;i++)
{
for(j=0;j+i<n;j++)
{
for(k=j;k<=j+i;k++)
{
if(a[k]!=a[2*j+i-k])
break;
}
if(k==j+i+1)
{
for(k=j;k<=j+i;k++)
printf("%c",a[k]);
printf("\n");
}
}
}
return 0;
}
| 49 |
24,216 | char str[500], huiwen[500];
void main()
{
int i, j, m, leng;
int f(int, int);
scanf("%s",str);
for(leng=2; leng<strlen(str); leng++)
{
for(i=0; i<strlen(str); i++)
{
if(f(i, i+leng-1)==1) printf("%s\n",huiwen);
}
}
/*for(i=0; i<strlen(str); i++)
{
for(j=i+1; j<strlen(str); j++)
{
if (f(i, j)==1) printf("%s\n",huiwen);
for(m=0; m<=500; m++) huiwen[m]='\0';
}
}*/
}
int f(int i, int j)
{
int flag=0, k=0;
char s1[500], s2[500];
for(k=0; k<=j-i; k++)
{
s1[k]=str[i+k];
s2[k]=str[j-k];
if(s1[k]==s2[k]) flag=flag;
else flag=flag+1;
}
if(flag==0)
{
for(k=0; k<=j-i; k++)
{
huiwen[k]=s1[k];
}
return 1;
}
else return 0;
} | 49 |
24,217 |
char a[501];
int len, i = 0, t = 2, p = 0, j = 0, n = 1;
void back(char m[])
{
len = strlen(m);
do
{
for (j = 0;j <= len - t;j++)
{
for (i = j;i < j + t;i++)
{
if (m[i] == m[j+t-n])
{
if (i + 1 >= j + t -n)
{
for (i = j;i < j + t;i++)
cout << m[i];
cout << '\n';
break;
}
}
else
break;
n++;
}
n = 1;
}
t++;
}while (t <= len);
}
int main()
{
cin >> a;
back(a);
return 0;
}
| 49 |
24,218 | //******************************
//**???????
//**????? 1100017658
//**???2011.11.13
//******************************
void out(int[], char[], int); // ?????
int main() // ?????
{
char a[500];
int k[500] = {0}; // ???????????
cin >> a;
int t = strlen(a); // ?????
for (int x = 0; x < t; x++)
if (a[x] - 'a' == a[x + 1] - 'a')
{
k[x] = 1; // ??
cout << a[x] << a[x + 1] << endl; // ???????
}
out(k, a, t); // ?????
return 0;
} // ?????
void out(int k[], char a[], int t) // ???
{
for (int m = 1; m < t / 2; m++) // ????
{
for (int i = 0; i < t; i++) // ??
{
if (k[i] == 1) // ???????
{
int flag = 0; // ??
int l = 1;
for (; l <= m; l++) // ???????
{
if (a[i - l] - 'a' != a[i + l + 1] - 'a') // ??????
flag = 1;
}
if (flag == 0 && l == m + 1) // ????
{
for (int q = i - m; q <= i + m + 1; q++) // ????
cout << a[q];
cout << endl;
}
}
}
}
return; // ??
} // ?????
| 49 |
24,219 | int main()
{
char a[500];
gets(a);
int i,j,k,b,m,n;
for(j=2;j<=strlen(a);j=j+2)
{
for(i=0;i<strlen(a)-j+1;i++)
{
b=0;
m=i;
n=i+j-1;
for(;m<n;m++,n--)
{
if(a[m]!=a[n]){b=1;
break;}
}
if(b==0)
{
for(k=i;k<=i+j-1;k++)
printf("%c",a[k]);
putchar('\n');
}
}
}
return 0;
} | 49 |
24,220 | int main()
{
char str[505] = {0};
cin >> str;
int length = strlen(str);
for (int l = 2 ; l <= length ; l++)
{
for (int i = 0; i <= length - l; i ++)
{
if (str[i] == str[i + l - 1])
{
int m = i + 1, n = i + l - 2;
for (; m <= n ; m ++, n--)
{
if (str[m] != str[n])
break;
}
if (m > n)
{
for (int m = i ; m <= i + l - 1; m++)
cout << str[m];
cout << endl;
}
}
}
}
cin.get();
cin.get();
return 0;
} | 49 |
24,221 | 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 |
24,222 | int main()
{char a[505],b[505],c[505];
int i,j,len,k,e=0;
scanf("%s",a);
len=strlen(a);
for(i=2;i<=len;i++)
{
for(j=0;j<=len-i;j++)
{ for(k=j;k<=j+i-1;k++)
{ b[k-j]=a[k];}
b[k-j]='\0';
for(k=0;k<i;k++)
{c[i-1-k]=b[k];}
//e=0;
//for(k=0;k<i;k++)
//{if(c[k]!=b[k])
// e=e+1;}
c[i]='\0';
// if(e==0)
if(strcmp(c,b)==0)
printf("%s\n",b);}}
return 0;
}
| 49 |
24,223 | int main()
{
char str[1000]; // ????????
int i, j, ii, jj, len, q; // ??????i, j, ii, ?????q,?????len
cin >> str; // ?????
len = strlen(str); // ????????
for (q = 2; q <= len; q++) // ???????????????
{
for (i = 0; str[i] != 0; i++) // ???????
{
ii = i; // ??????????
// ????????????????????????
while ((str[ii] == str[i + q + i - 1 - ii]) && (ii < i + q / 2))
{
ii ++;
}
if (ii == i + q / 2) // ???????????????????
{
for (j = i; j <= i + q - 1; j++) // ??????
cout << str[j];
cout << endl; // ????
}
}
}
return 0;
} | 49 |
24,224 | /**
*file:????11-24??
*author:???
*date?201011-26
*discription?????
*/
int main ()
{
//????????????????i??????j,k,m?????l?????len???????
char str[501] ;
int i , j , k , l , m , len ;
cin >> str ;
len = strlen( str ) ;
for ( i = 2 ; i <= len ; i ++ )//????????????????
{
for ( j = 0 ; j <= len - i ; j ++ )//?????????
{
l = j + i / 2 ;//l??????????
//??????????????????????????????
for ( k = j ; k <= l ; k ++ )
{
if ( str[k] != str[2*j+i-k-1] ) break ;
}
//?????????????????????????????????????????????
if ( k == l+1 )
{
for ( m = j ; m < j + i ; m ++ )
cout << str[m] ;
cout << endl ;
}
}
}
return 0 ;
} | 49 |
24,225 | int main()
{
char a[520];
int i,j,k,l,p,n;
cin >> a ;
n=strlen(a);
for(j=1;j<n;j++)
{
for(i=0;i<n;i++)
{
k=j;p=i;
if (a[p]==a[p+k] && k==1) {cout << a[p] << a[p+1] << endl;}
if (a[p]==a[p+k] && k>1)
{
while(a[p]==a[p+k]&&k>1)
{
p++;k=k-2;
}
if(k<2&&a[p]==a[p+k])
{
for(l=i;l<=i+j;l++)
{
cout << a[l] ;
}
cout <<endl;
}
}
}
}
return 0;
}
| 49 |
24,226 | //*******************************************//
//*??????? *//
//*????? *//
//*???2010.12.21 *//
//*******************************************//
void search();//???????
void check(char same[]);
char str[500];
int lenstr;
int main()
{
cin>>str;
lenstr=strlen(str);
search();
}
void search()
{
int i,j,len,t;
for(len=2;len<=lenstr;len=len+2)//???????
{
for(i=0;i<=lenstr-len;i++)//??????
{
char spr[500];
for(j=i,t=0;j<=i+len-1;j++,t++)//???????????????????????????????????????????
spr[t]=str[j];
spr[j]='\0';
check(spr);
}
}
}
void check(char same[500])
{
int lensame;
lensame=strlen(same);
int i,flag=1;
for(i=0;i<=lensame/2-1;i++)//??????????????
{
if(same[lensame-1-i]!=same[i])//??????????
{
flag=0;
break;
}
}
if(flag==1)
{
for(i=0;same[i]!='\0';i++)
cout<<same[i];
cout<<endl;
}
} | 49 |
24,227 |
int main()
{
int i,j,k,sign,l;
char s[550];
gets(s);
l=strlen(s);
for(i=2;i<=l;i++)
{
for(j=0;j<l;j++)
{
sign=0;
for(k=j;k<j+i;k++)
{
if(s[k]==s[j+i-1-k+j])
sign++;
}
if(sign==i)
{
for(k=j;k<j+i;k++)
printf("%c",s[k]);
printf("\n");
}
}
}
return 0;
} | 49 |
24,228 |
int main()
{
char s[500];
int i=0,j,l,k,m;
gets(s);
l=strlen(s);
for(j=0;j<=i;j++)
{
for(i=0;i+j+1<l;i++)
{
for(k=0;k<=j;k++)
if (s[i-k]!=s[i+1+k])
break;
if(k==j+1)
{
for(m=0;m<(j+1)*2;m++)
printf("%c",s[i-j+m]);
printf("\n");
}
if(i==l-1)
break;
}
}
return 0;
} | 49 |
24,229 |
int judge(char ch[500])
{
int len=strlen(ch);
for(int i=0;i<=len/2;i++)
{
if(ch[i]!=ch[len-1-i])
return 0;
}
return 1;
}
int main()
{
char a[500]={'\0'},b[500]={'\0'};
cin>>a;
int j,k,len,i;
len=strlen(a);
//cout<<len<<endl;
for(i=2;i<=len;i++){
j=0;
while(j<=len-i)
{
for(k=0;k<i;k++)
{
b[k]=a[j+k];
}
b[k]='\0';
if(judge(b))
cout<<b<<endl;
j++;
}
}
return 0;
}
| 49 |
24,230 | int main()
{
int judge(char ch[]);
char str[501],sub[501];
int len,start,end,i,l;
gets(str);
len=strlen(str);
for(l=2;l<=len;l++) //????2???????
{
for(start=0,end=start+l;end<=len;start++,end++) //?start?????????end????
{
for(i=start;i<end;i++)
{
sub[i-start]=str[i]; //?????
}
sub[end-start]='\0';
if(judge(sub)==1)//??????????????
{
puts(sub);
printf("\n");
}
}
}
return 0;
}
int judge(char ch[])
{
int begin,finish,lenth;
lenth=strlen(ch);
for(begin=0,finish=lenth-1;begin<finish;begin++,finish--)
{
if(ch[begin]!=ch[finish]) //???????????????????????????????????????begin?=finish???
{
return(0); //???????????????????0?
}
}
return(1);//???????0?????????????1?
}
| 49 |
24,231 |
int main()
{
char origin[501]; //??????
int len, i, j, k, lenmax; //len??????lenmax???????
int flag; //??????????
cin.getline(origin, 501); //??????
lenmax = strlen(origin); //????????
for (len = 2; len <= lenmax; len++) //????????
{
for (i = 0; i <= lenmax - len; i++) //??????i?????????len???
{
flag = 1; //?????????
for (j = 0; j <= len / 2; j++)
{
if (origin[i + j] != origin[i + len - j - 1]) //?????????flag???0?????
{
flag = 0;
break;
}
}
if (flag) //???????
{
for (k = i; k <= i + len - 1; k++) //????????
cout << origin[k];
cout << endl;
}
}
}
return 0;
}
| 49 |
24,232 | 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 |
24,233 | int main()
{
char a[1000],b[1000][1000],c[1000][1000];
int i,j,k,num=0,clen[1000],clen0[1000],p=0,shorter;
cin>>a;
int len=strlen(a);
for(i=0;i<len;i++)
{
for(j=i;j<len;j++)
{
p=0;
for(k=i;k<=j;k++)
{
b[num][p]=a[k];
p++;
}
num++;
}
}
int judge=0;
for(i=0;i<num;i++)
{
clen[i]=strlen(b[i]);
j=0;judge=0;
while(1)
{
if(b[i][j]==b[i][clen[i]-j-1])
{
judge=1;
j++;
if(j==clen[i]) break;
continue;
}
else
{
judge=0;
break;
}
}
if(judge==1&&clen[i]>1)
{
strcpy(c[p],b[i]);
clen0[p]=clen[i];
p++;
}
}
shorter=0;
for(i=0;i<p;i++)
{
for(j=0;j<p;j++)
{
if(clen0[j]<clen0[shorter])
{
shorter=j;
}
}
cout<<c[shorter]<<endl;
clen0[shorter]=1000;
}
return 0;
} | 49 |
24,234 | void main()
{
char str1[500]={0},str2[500]={0};
int i,start,k,l,p=0,q,f,d;
gets(str1);
l=strlen(str1);
for(i=2;i<=l;i++)//?????
{
for(start=0;start<l;start++)//????
{
d=start;
f=0;
p=0;
for(k=start+i-1;k>=start;k--)//????
{
str2[p]=str1[k];
p++;
}
for(q=0;q<p;q++)//??
{
if(str2[q]==str1[d])
{
f=1;
d++;
}
else
{
f=0;
break;
}
}
if(f==1)
{
puts(str2);
}
}
}
}
| 49 |
24,235 |
char s[500];
int 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)
{
int i;
for(i=start;i<=end;i++)
putchar(s[i]);
putchar('\n');
}
int main()
{
unsigned int m,n,width;
gets(s);
for(width=1; width<strlen(s); width++)
for(m=0; m<=strlen(s)-width;m++)
if(substr(s, m, m+width))
osubstr(s, m, m+width);
} | 49 |
24,236 | int huiwen(char a[],int m,int n)
{
int i;
while(m<n)
{
if(a[m]!=a[n]) {return 0;break;}
else {m++;n--;}
}
if(m>=n) return 1;
}
void print(char a[],int m,int n)
{
int i;
for(i=m;i<=n;i++)
printf("%c",a[i]);
printf("\n");
}
int main ()
{
char a[500];
int i,j,k,l;
gets(a);
l=strlen(a);
for(i=2;i<=l;i++)
{
for(j=0;j<=l-i;j++)
{
if(huiwen(a,j,j+i-1)==1)
print(a,j,j+i-1);
}
}
}
| 49 |
24,237 | void maxhui(char huichuan[500], char chuan[], int i)
{
int k, l = 1;
for(k = i ; ; k ++)
{
if(chuan[k] == chuan[k - 2 * l + 1])
{
huichuan[l - 1] = chuan[k];
l = l + 1;
}
else break;
}
huichuan[l - 1] = '\0';
}
int main()
{
char chuan[500], huichuan[500][500];
int i, j, k = 0, length, p;
cin.getline(chuan, 500, '\n');
for(i = 1 ; i < strlen(chuan) ; i ++)
{
if(chuan[i] == chuan[i - 1])
{
maxhui(huichuan[k], chuan, i);
k++;
}
}
int maxlen[500], maxlength = 0;
for(i = 0 ; i < k ; i ++)
{
if(strlen(huichuan[i]) > maxlength)maxlength = strlen(huichuan[i]);
}
for(i = 0 ; i < maxlength ; i ++)
{
for(j = 0 ; j < k ; j ++)
{
if(strlen(huichuan[j]) > i)
{
for(p = i ; p >= 0 ; p --)
{
cout << huichuan[j][p];
}
for(p = 0 ; p <= i ; p ++)
{
cout << huichuan[j][p];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,238 | //****************************************
//*??: ???? **
//*??: ??? **
//*???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 |
24,239 |
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 |
24,240 | int main()
{
char str[500];
int i,j,k,l,m;
int t = 1;
cin >> str;
i = strlen (str);
for (j = 1;j <= i - 1;j++)
{
for (k = 0;k <= i - j - 1;k++)
{
if (j % 2 != 0)
{
for (l = 0;l <= (j - 1) / 2;l++)
{
if (str[k + l] != str[k + j - l])
{
t = 0;
break;
}
}
}
else
{
for (l = 0;l <= (j / 2) - 1;l++)
{
if (str[k + l] != str[k + j - l])
{
t = 0;
break;
}
}
}
if (t == 1)
{
for (m = k;m <= k + j;m++)
{
cout << str[m];
}
cout << endl;
}
t = 1;
}
}
return 0;
} | 49 |
24,241 | int main()
{
char c[500],d[500];
int f(char d[]),n,i,j,k,l;
scanf("%s",c);
n=strlen(c);
for(i=2;i<=n;i++)
{
for(j=0;j<n+1-i;j++)
{
for(k=0;k<500;k++) d[k]='\0';
for(k=j;k<j+i;k++)
{
d[k-j]=c[k];
}
if(f(d)==1) printf("%s\n",d);
}
}
scanf("%d",&l);
return 0;
}
int f(char d[])
{
int m,t,s=0,ans;
m=strlen(d);
for(t=0;t<m;t++)
{
if(d[t]==d[m-1-t]) s=s+1;
}
if(s==m) ans=1;
else ans=0;
return ans;
} | 49 |
24,242 |
int main()
{
char a[500];
char b[500];
int len,i,j,k,judge;
fgets(a,500,stdin);
len=strlen(a)-1;
for(i=0;i<len;i++)
b[len-1-i]=a[i];
for(i=2;i<=len;i++)
for(j=0;j<=len-i;j++)
{
judge=0;
for(k=0;k<=i-1;k++)
{
judge=judge+(a[j+k]-b[len-i-j+k])*(a[j+k]-b[len-i-j+k]);
}
if(judge==0)
{
for(k=0;k<=i-1;k++)
printf("%c",a[j+k]);
printf("\n");
}
}
return 0;
}
| 49 |
24,243 | 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 |
24,244 |
char ls[MAX];
int pafind(int start,int len);
int main(){
int len;
cin>>ls;
len=strlen(ls);
for(int ll=2;ll<=len;ll++){
for(int i=0;i<=len-ll;i++){
if(pafind(i,ll)){
for(int j=i;j<i+ll;j++) cout<<ls[j];
cout<<endl;
}
}
}
return 0;
}
int pafind(int start,int len){
int maxl=len/2,ok=1;
for(int i=start;i<start+maxl;i++){
if(ls[i]!=ls[start+len-1-(i-start)]){
ok=0;
break;
}
}
return ok;
} | 49 |
24,245 | /**
* ? ? ??????
* ? ?????
* ????: 2010?11?26?
* ?????????????????????
*/
int main()
{
int i , j, k, t;
char a[501];
cin>>a;
int len = strlen(a);
for( i = 2; i <= len; i++ ) //???????????2???
{
for( j = 0; j < len - i + 1; j++ ) //?????????????????????????????-????????
{
for( k = j; k <= j + i - 1; k++ ) //??j???j+i-1?i?
{
if( a[k] != a[2*j+i-1-k] ) //????i?????????????????????j??i??????????
break;
}
if(k == j + i) //?????????????i??????????
{
for( t = j; t <= j + i - 1; t++) //??j????????i??????,???????????
cout<<a[t];
cout<<endl;
}
}
}
return 0;
} | 49 |
24,246 | /* ????
?????? 2010.11.24 */
void f(int sta,int len,char a[])
{
int g=0,i;
for(i=0;i<len-1-i;i++)
if(a[i+sta]!=a[sta+len-1-i])
{
g=1;
break;
}
if(g==0)
{
for(i=sta;i<sta+len;i++)
cout<<a[i];
cout<<endl;
}
}
int main()
{
int len,sta;
char a[503]={'\0'};
cin.getline(a,sizeof(a));
for(len=2;len<=strlen(a);len++)
for(sta=0;sta+len<=strlen(a);sta++)
f(sta,len,a);
return 0;
} | 49 |
24,247 | int main()
{
char s[500];
char *p;
gets(s);
p=s;
int i,j,k,l,m,t;
l=strlen(s);
for(i=2;i<=l;i++)
{
for(j=0;j<l-i+1;j++)
{
int s=0;
for(t=0;t<i/2;t++)
{
if(*(p+j+t)!=*(p+j+i-1-t))
{
s=1;
break;
}
}
if(s==0)
{
for(m=j;m<j+i;m++)
{
printf("%c",*(p+m));
}
printf("\n");
}
}
}
return 0;
} | 49 |
24,248 | int main()
{
char a[2000];
int i,j,k,c;
for(i=0;i<=500;i++)
a[i]='\0';
gets(a);
for(i=2;i<=500;i=i+2)
for(j=0;j<=500;j++)
{
if(a[j]!='\0')
{
c=1;
for(k=0;k<=i/2;k++)
{
if(a[j+k]!=a[j+i-k-1])
{
c=0;
break;
}
}
}
if(c==1)
{
for(k=j;k<=j+i-1;k++)
printf("%c",a[k]);
printf("\n");
}
}
return 0;
} | 49 |
24,249 | main()
{
char a[800];
int len,num=0;
gets(a);
len=strlen(a);
for(int i=1;i<len;i++)
{
for(int j=0;j<len-i;j++)
{
for(int k=j;k<=(j+i/2);k++)
{
if(a[k]==a[j+j-k+i])
num++;
else
{
num=0;
break;
}
}
if(num==i/2+1)
{
for(int k=j;k<=i+j;k++)
printf("%c",a[k]);
printf("\n");
}
num=0;
}
}
} | 49 |
24,250 | int main()
{
char str[501];
int i, j;
cin >> str;
for (j = 1; str[j] != '\0'; j++)
{
for (i = 0; str[i] != '\0'; i++)
{
for (int l = j, p = 0; l >= 1; p++, l--)
{
if (str[i + p] != str[i + l])
{
break;
}
if (l <= 2)
{
for (int k = i; k <= i + j; k++)
{
cout << str[k];
}
cout << endl;
break;
}
}
}
}
return 0;
} | 49 |
24,251 | int main()
{
char s[500];
int n,i,j,t,k;
scanf("%s",s);
n=strlen(s);
if(n%2==0)
{
for(i=1;i<=(n/2);i++)
{
for(j=0;j<(n-2*i+1);j++)
{
t=0;
for(k=0;k<i;k++)
{
if(s[j+k]==s[j+2*i-1-k])
t=t+1;
}
if(t==i)
{
for(k=j;k<j+2*i;k++)
{
printf("%c",s[k]);
}
printf("\n");
}
}
}
for(i=1;i<((n-1)/2);i++)
{
for(j=0;j<(n-2*i+1+1);j++)
{
t=0;
for(k=0;k<((2*i+1-1)/2);k++)
{
if(s[j+k]==s[j+2*i+1-1-k])
t=t+1;
}
if(t==((2*i+1-1)/2))
{
for(k=j;k<j+2*i+1;k++)
{
printf("%c",s[k]);
}
printf("\n");
}
}
}
}
else
{
for(i=1;i<(n/2);i++)
{
for(j=0;j<(n-2*i+1);j++)
{
t=0;
for(k=0;k<i;k++)
{
if(s[j+k]==s[j+2*i-1-k])
t=t+1;
}
if(t==i)
{
for(k=j;k<j+2*i;k++)
{
printf("%c",s[k]);
}
printf("\n");
}
}
}
for(i=1;i<=((n+1)/2);i++)
{
for(j=0;j<(n-2*i+1+1);j++)
{
t=0;
for(k=0;k<((2*i+1-1)/2);k++)
{
if(s[j+k]==s[j+2*i+1-1-k])
t=t+1;
}
if(t==((2*i+1-1)/2))
{
for(k=j;k<j+2*i+1;k++)
{
printf("%c",s[k]);
}
printf("\n");
}
}
}
}
return 0;
} | 49 |
24,252 | int main()
{
char s[600];
scanf("%s",s);
int l=strlen(s);
int i,j,k;
int hw;
for(i=2;i<=l;i++) //???
{
if(i%2==0) //????????
{
for(j=i/2-1;j<l-i/2;j++) //?????
{
hw=1; //?????
for(k=1;k<=i/2;k++)
{
if(s[j-k+1]!=s[j+k])
{
hw=0;
break;
}
}
if(hw==1)
{
for(k=j-i/2+1;k<=j+i/2;k++)
{
printf("%c",s[k]);
}
printf("\n");
}
}
}
else
if(i%2==1) //bug1???????????
{
for(j=i/2;j<l-i/2-1;j++)
{ //debug??????????????
hw=1;
for(k=1;k<=i/2;k++)
{
if(s[j-k]!=s[j+k])
{
hw=0;
break;
}
}
if(hw==1)//????????????
{
for(k=j-i/2;k<=j+i/2;j++)
{
printf("%c",s[k]);
}
printf("\n");
}
}
}
}
return 0;
}
| 49 |
24,253 | int main()
{
char a[1000];
cin.getline(a,1000);
int len=strlen(a);
int i,j,k,l;
for(j=2;j<=len;j++)
{
for(i=0;i<=len-j;i++)
{
int k;
for(k=i;k<i+j&&a[k]==a[i+j-(k-i)-1];k++);
if(k==i+j) {for(int t=i;t<i+j;t++) cout<<a[t];
cout<<endl;
}
}
}
return 0;
}
| 49 |
24,254 | int main()
{
char str[500]={0},result[500]={0};
int i,j,sum,p,len,x;
scanf("%s",str);
len=strlen(str);
for(i=1;i<=len;i++){//??
for(j=0;j<=len-i;j++){//??
x=-1;
for(p=0;p<500;p++)
result[p]='\0';
for(p=j;p<i+j;p++){//??
x++;
result[x]=str[p];
}
sum=0;
for(p=0;p<x+1;p++){
if(result[p]!=result[x-p])
break;
else sum++;
}
if(sum==x+1&&strlen(result)!=1)
printf("%s\n",result);
}
}
return 0;
}
| 49 |
24,255 | //********************************************************
//* ???:4.cpp *
//* ?????? 1200012948 *
//* ????: 2012 11 13 *
//* ????:???? *
//********************************************************
//??
int main()
{
char a[500];
int l, i, j, m = 0, h, e, k, flag = 0;
cin.getline (a,500);
l = strlen(a); //???????
for (i = 2; i <= l; i++)
{
for(j = 0; j + i <= l; j++)
{
flag = 0;
h = j;
e = j + i - 1;
while (a[h] == a[e])
{
if(flag == 0)
{
m = h; //m????
flag = 1;
}
//????????
h++;
e--;
if (h >= e)
break;
}
if (h >= e)
{
for (k = m; k <= m + i - 1; k++)
{
cout << a[k];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,256 | char l[500];
int len,n=0,record[2000][3];
main()
{
int i,j,k;
void doit(int a,int b);
gets(l);
len=strlen(l);
for (i=0;i<=len-1;i++)
doit(i,i+1);
for (i=2;i<=len;i++)
for (j=1;j<=n;j++)
if (record[j][2]-record[j][1]+1==i){ for (k=record[j][1];k<=record[j][2];k++) printf("%c",l[k]); printf("\n");}
}
void doit(int a,int b)
{
int i,j;
if (l[a]==l[b]&&a-1>=0&&b+1<=len-1) {n++;record[n][1]=a;record[n][2]=b;doit(a-1,b+1);}
if (l[a]==l[b]&&(a==0||b==len-1)) {n++;record[n][1]=a;record[n][2]=b;}
} | 49 |
24,257 | void srev(char str[500], int len)
{
char rev[500];
int i;
for (i=0; i<len; i++)
*(rev+i)=*(str+len-i-1);
for (i=0; i<len; i++)
*(str+i)=*(rev+i);
}
int main ()
{
char s[500], str[500], rev[500];
gets(s);
int len=strlen(s), i, j;
for (i=2; i<len; i++) {
for (j=0; j<len-i+1; j++) {
strncpy(str, s+j, i);
strncpy(rev, s+j, i);
str[i]=rev[i]='\0';
srev(rev, i);
if (strcmp(str, rev)==0) {
puts(str);
}
}
}
return 0;
} | 49 |
24,258 | int main()
{
char a[500];
cin>>a;
int k=strlen(a);
int b[100]={0};
int c[500]={0};//?????????????????????????
int n1=0;
int n2=0;
for(int l=2;l<=k;l=l+2)
{
for(int i=0;i<k-l+1;i++)
{
int time=1;
for(int j=0;j<=(l-2)/2;j++)
{
if(a[i+j]!=a[i+l-1-j])
{
time=0;
break;
}
}
if(time==1)
{
b[n1]=i;//???????????????????????????
n1++;
c[n2]=l;
n2++;
}
}
}
for(int i=0;i<n1;i++)//??????????
{
for(int j=0;j<c[i];j++)
{
cout<<a[b[i]+j];
}
cout<<endl;
}
return 0;
} | 49 |
24,259 | /*
* huiwenzichuan.cpp
*
* Created on: 2011-12-21
* Author: Administrator
*/
int main()
{
char chuan[500];
cin>>chuan;
int lenth=strlen(chuan);
int i,j;
for(int k=1;k<lenth;k++)
{
for(i=0,j=k;j<lenth;i++,j++)
{
int begin=i,end=j;
while(begin<end)
{
if(chuan[begin]!=chuan[end])
{
break;
}
else
{
begin++;
end--;
}
if(begin>=end)
{
for(int a=i;a<=j;a++)
{
cout<<chuan[a];
}
cout<<endl;
}
}
}
}
return 0;
} | 49 |
24,260 |
void find (char target[])//??
{
int count = 0;
int i,j,k;
int flag;
char change[500];
for (i = 0;i <= 500;i++)//????????
{
if (target[i] != '\0')
count++;
else
break;
}
for (i = 2;i <= count;i++)//??????
{
for (j = 0;j <= count - i;j++)//????????
{
flag = 1;
for (k = j;k <= j + i - 1;k++)
change[k] = target[k];
for (k = 0;k <= i / 2 - 1;k++)//???????????
{
change[j + k] = target[j + i - 1 - k];
change[j + i - 1 - k] = target[j + k];
}
for (k = 0;k < i - 1;k++)
{
if (change[j + k] != target[j + k])
flag = 0;
}
if (flag == 1)//?????????????
{
for (k = j;k <= j + i - 1;k++)
cout<<target[k];
cout<<endl;
}
}
}
}
int main()
{
char target[500];
cin.getline(target,500);
find(target);
return 0;
} | 49 |
24,261 |
int main()
{
char str[500];
cin>>str;
int i;
int size=strlen(str);
for(i=1;i<size;i++)
{
int h,t;
for(h=0;h<size-i;h++)
{
int h1=h;
t=h+i;
int m;
for(;h1<t;h1++,t--)
if(str[h1]!=str[t])
break;
if(h1>t)
{
for(m=h;m<=h+i;m++)
cout<<str[m];
cout<<endl;
}
}
}
cin.get();cin.get();cin.get();
return 0;
}
| 49 |
24,262 | void huiwen(char string[500],int full,int length)
{
int x,y,u,i;
for(x=0;x<=full-length+1;x++)
{
i=1;
for(y=x;y<=x+length-1;y++)
{
if(string[y]==string[2*x+length-1-y])
i=i*1;
else
i=i*0;
}
if(i==1)
{
for(u=x;u<=x+length-1;u++)
printf("%c",string[u]);
printf("\n");
}
}
}
int main()
{
char str[500];
gets(str);
int w;
w=strlen(str);
int v;
for(v=2;v<=w;)
{
huiwen(str,w,v);
v=v+2;
}
return 0;
}
| 49 |
24,263 | int main()
{
char a[501];
int i,n,k,j,flag,nf=0;
gets(a);
n=strlen(a);
for(i=2;i<=n;i++)
{
for(j=0;j<n-i+1;j++)
{
flag=1;
for(k=0;k<i/2;k++)
{
if(a[j+k]!=a[j+i-1-k])
{
flag=0;
break;
}
}
if(flag)
{
if(nf)
printf("\n");
for(k=0;k<i;k++)
printf("%c",a[j+k]);
nf=1;
}
}
}
return 0;
} | 49 |
24,264 | 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 |
24,265 | /*???????
*?????
*/
int huiwen(char a[]) //????????
{char b[100]={0};
int i,l;
l=strlen(a);
for(i=0;i<l;i++)
b[l-1-i]=a[i];
if(strcmp(b,a)==0)
return 1;
return 0;}
int main(){
char a[100],s[100];
cin>>a;int l,la=strlen(a),k=0,p=0;
for(l=2;l<=la;l++){ //??????
for(int i=0;i<=la-l;i++){ //???????????
for(int j=i;j<l+i;j++)
{s[p]=a[j];p++;}s[p]='\0'; //????'\0'??
if(huiwen(s))cout<<s<<endl;p=0;}}//????????
return 0;}
| 49 |
24,266 | int f(char a[])
{
int i,j,n;
n=strlen(a);
char b[501];
j=0;
for(i=n-1;i>=0;i--)
b[j++]=a[i];
b[j]='\0';
if(strcmp(a,b)==0) return 1;
else return 0;
}
int main()
{
char a[501],b[501];
gets(a);
int n,i,j,k,s;
n=strlen(a);
for(i=2;i<=n;i++)
for(j=0;j+i-1<n;j++)
{
s=0;
for(k=0;k<500;k++)
b[k]='\0';
for(k=j;k<j+i;k++)
{
b[s++]=a[k];
}
if(f(b)==1) printf("%s\n",b);
}
return 0;
} | 49 |
24,267 | int main()
{
int i,j,k,n,flag,m;
flag=0;
char str[500];
gets(str);
n=strlen(str);
char *p;
for(i=2;i<=n;i++)
{
p=str;
for(j=0;j<=n-i;j++)
{
for(k=j;k<(j+j+i)/2;k++)
{
if(str[k]==str[j+j+i-1-k])
flag=1;
else
{
flag=0;
break;
}
}
if(flag==1)
{
for(m=j;m<=j+i-1;m++)
{
printf("%c",str[m]);
}
printf("\n");
}
}
}
}
| 49 |
24,268 | void main()
{
char s[1000];
int n,i,j,k,m,count=0;
gets(s);
n=strlen(s);
for(k=2;k<=n;k=k+2)
{
for(i=0;i<n;i++)
{
for(j=0;j<k/2;j++)
{
if(s[i+j]==s[i+k-j-1])
count++;
if(j==k/2-1 && count==k/2)
{
for(m=i;m<i+k;m++)
printf("%c",s[m]);
printf("\n");
count=0;
}
else if(j==k/2-1 && count!=k/2) count=0;
}
}
}
} | 49 |
24,269 | int main()
{
char c1[600],c2[600];
int i,j,k,l1;
scanf("%s",c1);
l1=strlen(c1);
for(i=2;i<=l1;i++)
{
for(j=0;j<=l1-i;j++)
{
for(k=0;k<600;k++)
{
c2[k]=0;
}
for(k=0;k<i;k++)
{
c2[k]=c1[j+k];
}
for(k=0;k<i/2;k++)
{
if(c2[k]!=c2[i-1-k]) break;
}
if(k==i/2) printf("%s\n",c2);
}
}
return 0;
}
| 49 |
24,270 |
int main()
{
char a[501];//????
cin.getline( a, 501 );// ??
int length=strlen(a), p=1;
for( int i=2; i<length; i++ )//?????
{
for( int j=0; j<length-i+1; j++ )//??????
{
p=1;
for( int x=0; x<i; x++ )// ??????
{
if(a[j+x]!=a[j+i-x-1])
{
p=0;
break;
}
}
if(p==1)
{
for( int y=0; y<i; y++ )//????
{
cout << a[j+y];
if( y==i-1 )
cout << endl;
}
}
}
}
return 0;
} | 49 |
24,271 | void main()
{
int i,j,p,m,b,c;
char a[500];
scanf("%s",&a);
c=strlen(a);
for(i=0;i<c;i++)
{
if(a[i]==a[i+1])
printf("%c%c\n",a[i],a[i]);
}
for(p=3;p<c;)
{
for(i=0;i<c-p;i++)
{
b=0;
for(m=0;m<p/2+1;m++)
{
if(a[i+m]==a[p-m+i])
{b++;}
}
if(b==(p/2)+1)
{
for(j=i;j<=i+p;j++)
{
printf("%c",a[j]);
}
printf("\n");
}
}
p+=2;
}
}
| 49 |
24,272 | int main()
{
char substr(char s[],int,int);
char osubstr(char s[],int,int);
int len,width,m;
char s[1000];
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);
}
}
}
return 0;
}
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;
}
char osubstr(char s[],int start,int end)
{
while (start<=end) {
putchar(s[start++]);
}
putchar('\n');
} | 49 |
24,273 | int son(char *a,int n)
{
int i;
for(i=0;i<n/2;i++)
{
if(a[i]!=a[n-i-1])return 0;
}
for(i=0;i<n-1;i++)cout<<a[i];
cout<<a[n-1]<<endl;
return 0;
}
int main()
{
char a[500];
cin>>a;
int n;
n=strlen(a);
for(int i=2;i<=n;i++)
{
for(int j=0;j<n-i+1;j++)
{
son(&a[j],i);
}
}
return 0;
} | 49 |
24,274 | int pd(char c[],int i);
int main()
{
char a[501]={'0'},c[501]={'0'},d[501]={'0'};
int n,i,j,k;
gets(a);
n=strlen(a);
for(i=2;i<=n;i++)
{
for(j=0;j<=n-i;j++)
{
for(k=0;k<=500;k++)
d[k]=c[k]='\0';
for(k=0;k<i;k++)
c[k]=a[k+j];
for(k=0;k<i;k++)
d[k]=c[i-k-1];
if(strcmp(c,d)==0)
{
puts(c);
}
}
}
}
| 49 |
24,275 | int main(){
char a[501];
int k;
cin.getline(a,501);
for(int i=1;i<=strlen(a);i++)
for(int j=0;j<=(strlen(a)-i);j++){
for(k=0;k<=i/2;k++){
if(a[j+k]!=a[j+i-k])break;
}
if(k==(i/2+1)){
for(int l=j;l<=j+i;l++)
cout<<a[l];
cout<<endl;
}
}
return 0;
}
| 49 |
24,276 | int maxhui(char chuan[], int i)
{
int k, length = 2;
for(k = i ; ; k ++)
{
if(chuan[k] == chuan[k - length + 1])
length += 2;
else break;
}
length -= 2;
return length;
}
int main()
{
char chuan[500], huichuan[500][500];
int i, j, k = 0, length, p;
cin.getline(chuan, 500, '\n');
for(i = 1 ; i < strlen(chuan) ; i ++)
{
if(chuan[i] == chuan[i - 1])
{
length = maxhui(chuan, i) / 2;
for(j = 0 ; j < length ; j ++)
huichuan[k][j] = chuan[i + j];
huichuan[k][length] = '\0';
k++;
}
}
int maxlen[500], maxlength = 0;
for(i = 0 ; i < k ; i ++)
{
if(strlen(huichuan[i]) > maxlength)maxlength = strlen(huichuan[i]);
}
for(i = 0 ; i < maxlength ; i ++)
{
for(j = 0 ; j < k ; j ++)
{
if(strlen(huichuan[j]) > i)
{
for(p = i ; p >= 0 ; p --)
{
cout << huichuan[j][p];
}
for(p = 0 ; p <= i ; p ++)
{
cout << huichuan[j][p];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,277 | int main()
{
int i=0,x[510],y[510],e,f,count=0;
char a[510],b;
while (b!='\n')
{
cin.get(b);
a[i++]=b;
}//a????0?i-2?
int j1,j2,j3;
for (j1=2;j1<=i-1;j1++)//??
{
for (j2=0;j2<=i-3;j2++)
{
for (j3=0;j3<=j1-1;j3++)//?????????????
{
if (j2+j3<=i-2)
e=a[j2+j3];
f=a[j2+j1-1-j3];
if (e==f)
count++;
if (count==j1)
{
for (int j4=j2;j4<=j2+j1-1;j4++)
cout<<a[j4];
cout<<'\n';
}
}
count=0;
}
}
return 0;
} | 49 |
24,278 | int main() {
char a[501] = "0";//??????
int r, i, j, k, m;
cin >> a;
for (i = 0; a[i]; i++) {
}
r = i;
for (i = 2; i <= r; i++) {
if (i % 2 == 0) {
for (j = i / 2 - 1; j <= r - i / 2; j++) {
for (k = 1; k <= i / 2; k++) {
if (a[j - k + 1] != a[j + k])//???????
{
break;
} else
continue;
}
if (k == i / 2 + 1) {
for (m = -i / 2 + 1; m <= i / 2; m++)
cout << a[j + m];
cout << endl;
}
}
}//??????
if (i % 2 == 1) {
for (j = i / 2; j < r - i / 2; j++) {
for (k = 1; k <= i / 2; k++) {
if (a[j - k] != a[j + k]) {
break;
} else
continue;
}
if (k == i / 2 + 1) {
for (m = -i / 2; m <= i / 2; m++)
cout << a[j + m];
cout << endl;
}//??????
}
}
}
return 0;
}
| 49 |
24,279 | int main()
{
char a[520],b[520];
int p,q,x;
gets(a);
int n=strlen(a);
for (int l=1;l<=n;l++)
for (int i=0;i+l<n;i++)
{
x=0;
p=i;
q=l+i;
for(;p<q;p++,q--)
if (a[p]!=a[q]) x=1;
if (x==0)
{
for (int k=i;k<=i+l;k++)
printf("%c",a[k]);
printf("\n");
}
}
}
| 49 |
24,280 | int main()
{
char a[500]={0};
cin>>a;
int len=0;
for (int i=0;a[i]!=0;i++)
len++; //???????
int res=0;
for (int k=1;k<len;k++)
for (int i=0;i<len-k;i++)
{
for (int p=0;p<k;p++)
{
if (a[i+k]==0)
{
res++;
break;
}
if (a[i+p]!=a[i+k-p])
{
res++;
break; //?i~i+k??????P????P????????++???
}
}
if (res==0) //?????0??????
{
for (int j=i;j<=i+k;j++)
cout<<a[j];
cout<<endl;
}
res=0;
}
return 0;
} | 49 |
24,281 |
void string1(char* a, int* x1, int* x2, int len);
void string2(char* a, int* x1, int* x2, int len);
void out(int q,int len, char* a);
int main()
{
char a[501];
int x1[501] = {0};
int x2[501] = {0};
cin >> a;
int j = 0;
for (int i = 1; a[i] != '\0'; i++)
{
if (a[i - 1] == a[i])
{
cout << a[i - 1] << a[i] << endl;
x1[j] = i;
j++;
}
}
j = 0;
for (int i = 1; a[i + 1] != '\0'; i++)
{
if (a[i - 1] == a[i + 1] && a[i] != a[i - 1])
{
cout << a[i - 1] << a[i] << a[i + 1] << endl;
x2[j] = i;
j++;
}
}
//??????2?3???,??????
string1(a, x1, x2, 3);//??????????
}
void string2(char* a, int* x1, int* x2, int len)//len(??)??????
{
int temp1 = 0,temp2 = 0;
for (int i = 0; x1[i] != 0; i++)
{
if(a[x1[i] + len / 2 - 1] == a[x1[i] - len / 2] && x1[i] + len / 2 - 1 != 0 && x1[i] + len / 2 - 1 < 501 && x1[i] - len / 2 >= 0)//?????
{
out(x1[i] - len / 2,len,a);
x1[temp2] = x1[i];
temp2++;
}
}
x1[temp2] = 0;
if(x1[0] == 0 && x2[0] == 0)
exit(0);//?????????????????
string1(a, x1, x2, ++len);
}
void string1(char* a, int* x1, int* x2, int len)//len(??)??????,?string1????
{
int temp1 = 0,temp2 = 0;
for (int i = 0; x2[i] != 0; i++)
{
if(a[x2[i] + len / 2] == a[x2[i] - len / 2] && x2[i] + len / 2 != 0 && x2[i] + len / 2 < 501 && x2[i] - len / 2 >= 0)//?????
{
out(x1[i] - len / 2,len,a);
x2[temp2] = x2[i];//??x2???????
temp2++;
}
}
x2[temp2] = 0;
if(x1[0] == 0 && x2[0] == 0)
exit(0);//?????????????????
string2(a, x1, x2, ++len);
}
void out(int q,int len, char* a)//???????
{
for (int i = 0; i < len; i++)
cout << a[q + i];
cout << endl;
}
| 49 |
24,282 |
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 |
24,283 | int main()
{
char str[500];
int a,t;
int i=0,j=0,k=2,flag=1;
scanf("%s",str);
a=strlen(str);
for(k=2;k<=a;k++)
{
for(i=0;i<a;i++)
{ flag=1;
j=i;
for(j=i;j<=i+k-1;j++)
{
if(str[j]!=str[2*i-j+k-1])
flag=0;
}
if(flag==1)
{ t=i;
for(t=i;t<=i+k-1;t++)
{ printf("%c",str[t]);
}
printf("\n");
}
}
}
return 0;
} | 49 |
24,284 | //2014.1.2
//zwb
int main ()
{
int i, j, k, flag = 0;
char a[501] = {'\0'};
cin >> a;
int len = strlen(a);
for(i = 2; i <= len; i++)
{
for(j = 0; j <= len - i; j++)
{
flag = 0;
for(k = j; k <= i / 2 + j; k++)
{
if(a[k] != a[i+j+j-1-k])
{
flag = 1;
break;
}
}
if(flag == 0)
{
for(k = j; k <= i + j - 1; k++)
{
cout << a[k];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,285 | int main()
{
void isHuiwen(char s0[500], int i);
char str[500];
char s0[500];
int i, j, k, l;
gets(str);
l = strlen(str);
for (i = 2;i < l;i++)
{
for(j = 0;j <= l - i;j++)
{
for(k = 0;k <= i;k++)
s0[k] = str[k + j];
isHuiwen(s0, i);
}
}
return 0;
}
void isHuiwen(char s0[500], int i)
{
int p;
for(p = 0;p <= i/2;p++)
{
if(s0[p] != s0[i - 1 -p])
return;
}
for(p = 0;p < i;p++)
printf("%c",s0[p]);
printf("\n");
return;
} | 49 |
24,286 | int main()
{
int i, j, begin, end, flag, p;
char a[501];
cin >> a;
for (i = 0; a[i] != '\0'; i++)
p = i;
p++;
for (i = 2; i <= p; i++)
{
for (j = 0; j <= p - i; j++)
{
flag = 1;
for (begin = j, end = j + i - 1; end > begin; begin++, end--)
if (a[begin] != a[end])
{
flag = 0;
break;
}
if (flag == 1)
{
for (begin = j; begin <= j + i - 1; begin++)
cout << a[begin];
cout << endl;
}
}
}
return 0;
} | 49 |
24,287 | //****************************************************
//* ? ? ?: homework.cpp *
//* ? ?: ??? *
//* ????: 2012?11?10? *
//* ????: ???? *
//****************************************************
int main()
{
char st[502] = {0};
int len, longs, j, k, f; //len????
cin >> st;
len = strlen (st);
for (k = len + 1; k >= 0; k--) st[k + 1] = st[k]; //?????
st[0] = '\0';
for (longs = 2; longs <= len; longs++) //?????????
{
for (j = 1; j <= len - longs + 1; j++) // ??????
{
f = 1;
for (k = j; k <= j + longs - 1; k++) //?????????
{
if (st[k] != st[j + longs - 1 - k + j])
{
f = 0;
break;
}
}
if (f) //??????
{
for (k = j; k <= j + longs - 1; k++) cout << st[k];
cout << endl;
}
}
}
return 0;
}
| 49 |
24,288 | void pdjsc(char c[100])
{
int i,j,k,l,m,n,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,n,m,p=0;
char tp,a,b;
char c[100]={' '};
char s[100]={' '};
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 |
24,289 | void ggg( int i, char b[500])
{
int len, j, k, flag;
len = strlen(b);
for( j = 0;j <= (len - i);j++ )
{
for( k = 0;k < i/2;k++ )
{
if( b[j + k] == b[j + i - k - 1] )
{
flag = 1;
}
else
{
flag = 0;
break;
}
}
if( flag == 1 )
{
for( k = j;k < j+i; k++ )
{
cout << b[k];
}
cout << '\n';
}
}
}
int main ()
{
int i, len;
char a[500];
cin.getline(a, 500);
len=strlen(a);
for( i = 2;i <= len;i = i + 2)
{
ggg(i,a);
}
return 0;
}
| 49 |
24,290 | 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 |
24,291 | /*
* huiwenzichuan.cpp
*
* Created on: 2010-11-30
* Author:??
* ????????
*/
void find(char str[500])//????????????
{
int i, j, k, t,length;
length=strlen(str);//length???????
for(i=2;i<=length;i=i+2)//????????????????????
{
for(j=0;j<length-i+1;j++)//????????????
{
for(k=j;k<j+i/2;k++)
{ if(str[k]!=str[2*j+i-1-k]) break; }//??????????????????????
if(k==j+i/2)
{
for(t=j;t<j+i;t++)
{cout<<str[t];}
cout<<endl;
}//??????????????
}
}
}
int main()
{
char str[500];//??????
cin >> str;
find (str);//??????????
return 0;
} | 49 |
24,292 |
void check(char a[], int i, int j)
{
int k, m = 0;
for (k = 0; k <= i / 2; k++)
{
if (a[j + k] != a[j + i - 1 - k])
{
m = 1;
break;
}
}
if (m != 1)
{
for (k = 0; k < i; k++)
{
cout << a[j + k];
}
cout << endl;
}
}
int main()
{
char a[500];
int n, i, j;
cin.getline(a, 500);
i = 0;
while (a[i] != '\0')
{
i++;
}
n = i;
for (i = 2; i <= n; i++)
{
for (j = 0; j <= n - i; j++)
{
check(a, i, j);
}
}
return 0;
} | 49 |
24,293 | int main()
{
char c[500];
cin>>c;
for(int i=2;i<=strlen(c);i++)
{
for(int j=0;j<=strlen(c)-i;j++)
{
int p=1;
for(int k=j;k<j+i/2;k++)
{
if(c[k]!=c[j+j+i-1-k])
{
p=0;
break;
}
}
if(p==1)
{
for(int o=j;o<j+i;o++)
{
cout<<c[o];
}
cout<<endl;
}
}
}
return 0;
} | 49 |
24,294 | char str[500];
int length;
int check(int start,int len);
int ctr1,ctr2,ctr3;
int main(void)
{
gets(str);
length=strlen(str);
for(ctr1=2;ctr1<=length;ctr1+=2)
{
for(ctr2=0;ctr2<=length-ctr1;ctr2++)
{
check(ctr2,ctr1);
}
}
return 0;
}
int check(int start,int len)
{
char a[500];
char b[500];
int i;
for(i=0;i<500;i++)
{
a[i]='\0';
b[i]='\0';
}
for(i=0;i<len;i++)
{
a[i]=str[i+start];
b[i]=str[len-i+start-1];
}
if(strcmp(a,b)==0)
{
puts(a);
return 1;
}
else
return 0;
}
| 49 |
24,295 | int main()
{
char a[600];
cin>>a;
int l;
l=strlen(a);
int i,j,k,m;
for(i=1;i<=l/2;i++)
for(j=i;j<=l-i;j++)
{
m=0;
for(k=i;k>0;k--)
{
if(a[j+k-1]==a[j-k])
m=m+1;
}
if(m==i)
{
for(k=j-i;k<=j+i-1;k++)
cout<<a[k];
cout<<endl;
}
}
return 0;
}
| 49 |
24,296 | int main()
{
char str[502],str1[502];
int i,j,k,l,s,r,temp;
gets(str);
s=strlen(str);
for(k=1;k<=s-1;k++)
{
for(i=0;i<=s-k-1;i++)
{
if(i+k>s-1)
break;
r=1;
for(j=i;j<=i+k;j++)
{
str1[i+k-(j-i)]=str[j];
}
for(j=i;j<=i+k;j++)
{
if (str1[j]!=str[j])
{
r=0;
break;
}
}
if(r==1)
{
for(j=i;j<=i+k;j++)
printf("%c",str[j]);
printf("\n");
}
}
}
} | 49 |
24,297 | int main()
{
char s[500], s2[500], temp1[500], temp2[500];
int len, n, i, j, k;
scanf("%s", s);
len = strlen(s);
for (i=0;i<len;i++) s2[i] = s[len - i - 1];
s2[len]=0;
for (i=2;i<=len;i++)
for (k=0;k<=len-i;k++)
{
for (j=0;j<i;j++) temp1[j] = s[j+k];
temp1[i] = 0;
for (j=0;j<i;j++) temp2[j] = s2[len-k-i+j];
temp2[i] = 0;
if (strcmp(temp1, temp2)==0) printf("%s\n", temp1);
}
return 0;
}
| 49 |
24,298 | int main()
{
char str[501];
cin>>str;
for(int i=2;i<=strlen(str);i++)
{
if(i%2==0)
{
for(int j=0;j<=strlen(str)-i;j++)
{
int k,l=1;
for(k=j;k<j+i/2;k++)
{
if(str[k]==str[i+j-l])
{
l++;
continue;
}
else
break;
}
if(k>=j+i/2)
{
for(int m=j;m<j+i;m++)
cout<<str[m];
cout<<endl;
}
}
}
if(i%2==1)
{
for(int j=0;j<=strlen(str)-i;j++)
{
int k,l=1;
for(k=j;k<j+i/2;k++)
{
if(str[k]==str[i+j-l])
{
l++;
continue;
}
else
break;
}
if(k>=j+i/2)
{
for(int m=j;m<j+i;m++)
cout<<str[m];
cout<<endl;
}
}
}
}
return 0;
} | 49 |
24,299 |
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.