id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
24,300 | 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 |
24,301 | //***********************************
//*???????? *
//*? ???? 1100062709 *
//*? ??2011.11.15 *
//***********************************
int len; //len?????
void huiwenzichuan (char a[]); //?????
int main()
{
char a[500]; //???????
int i = 0;
while((a[i] = cin.get()) != '\n') //???????
{
i++; //????????
}
len = i; //??????????len
huiwenzichuan (a); //??????
return 0; //?????
}
void huiwenzichuan (char a[]) //?????
{
int i, j, k, flag, m; //??????
for (i = 2; i < len; i++) //????????????????????
{
for (k = 0; k < len; k++)
{
flag = 1; //??????1
for (j = 0;j < i; j++) //?a[k]?????????
{
if (a[k + j] != a[k + i - j - 1])
{
flag = 0; //????????0
break; //?????
}
}
if (flag == 1) //???1??????????
{
for (m = k; m < k + j; m++)
cout << a[m]; //????
cout << endl; //??
}
}
}
return;
}
| 49 |
24,302 | int main()
{
int k,i,j,m;
char a[550];
gets(a);
k=strlen(a);
for(i=k;i>=1;i--)
{a[i]=a[i-1];}
i=2;
while(i<k)
{
j=1;
while(j<=k-i+1)
{
m=j;
while(m<=j+i-1)
{
if(a[m]!=a[2*j+i-1-m]) break;
m=m+1;
}
if(m==i+j)
{
for(m=j;m<=j+i-1;m++)
{printf("%c",a[m]);}
printf("\n");
}
j=j+1;
}
i=i+1;
}
return 0;
} | 49 |
24,303 | void s(char[], int, int);
int main()
{
char a[1000];
cin .getline(a, 1000);
int len = strlen(a);
s(a, 1, len);
return 0;
}
void s (char a[1000], int n, int len)
{
if (n > len / 2)
return;
else
{
for (int i = 0; i + 2 * n - 1 < len; i++)
{
int flag = 1;
for (int j = n; j > 0; j--)
{
if (a[i + n - j] != a[i + j + n - 1])
{
flag = 0;
break;
}
}
if (flag)
{
for (int m = i; m <= i + 2 * n - 1; m++)
cout << a[m];
cout << endl;
}
}
s (a, n + 1, len);
}
}
| 49 |
24,304 |
int p,q;
int flag;
char input[100] ;
int judge(int i,int l)
{
flag = 0 ;
for (p=i;p<(l/2+i);p++)
{
if(input[p] == input[l+2*i-p-1])
flag++;
}
if(flag == l/2) return 1;
else return 0;
}
int main()
{
cin>>input;
int length = strlen(input) ;
int k , d ,w ;
for( d=2;d<=length;d++)
for (k=0;k<length-1;k++)
{
if(judge(k,d)==1)
{
for (w=k;w<k+d;w++)
{
cout<<input[w];
}
cout<<endl;
}
}
}
| 49 |
24,305 | int main()
{
char str[501];
int a,c,i,j,m,n,temp;
gets(str);
c=strlen(str);
for (i=1;i<=c;i++){
for (j=0;j<c-i;j++)
{
temp=0;m=j;n=j+i;
while (m<n){
if (str[m]==str[n]){m++;n--;}
else {temp=0;break;}
temp=1;
}
if (temp==1){
for(a=j;a<=i+j;a++)printf("%c",str[a]);
printf("\n");
}
}
}
return 0;
}
| 49 |
24,306 |
int main()
{
int i,i1,d,sum=0; //d??????????d?2?3?4?5?6???
int pl[500]={0};
int sl[500]={0};
char s[500];
scanf("%s",s);
for (i=0; s[i]!='\0'; i++) {
if (s[i]==s[i+1]) {
printf("%c%c\n",s[i],s[i+1]);
pl[i]=pl[i+1]=2;
}
}
for (i=0; s[i]!='\0'; i++) {
if (s[i]==s[i+2]) {
printf("%c%c%c\n",s[i],s[i+1],s[i+2]);
sl[i+1]=3;
}
}
for (d=4; d<=strlen(s); d++)
{
if (d%2==0)
{
for (i=0; s[i]!='\0'; i++,sum=0)
{
if (pl[i+d/2-1]==(d-2)&&pl[i+d/2]==(d-2)&&s[i+d-1]==s[i])
{
for (i1=i; i1<i+d-1; i1++)
{
printf("%c",s[i1]);
}
printf("%c\n",s[i+d-1]);
pl[i+d/2-1]=pl[i+d/2]=d;
}
}
}
if (d%2==1)
{
for (i=0; s[i]!='\0'; i++,sum=0)
{
if (sl[i+d/2]==(d-2)&&s[i+d-1]==s[i])
{
for (i1=i; i1<i+d-1; i1++)
{
printf("%c",s[i1]);
}
printf("%c\n",s[i+d-1]);
sl[i+d/2]=d;
}
}
}
}
return 0;
}
| 49 |
24,307 | /*
*@ title:?????
*@ date:2010-11-28
*@ author:1000012899 ???
*@ description: ???????
*/
char c[501];
void huiwen(int, int);
int main()
{
int l, i, j;
cin.getline(c,501);
l = strlen(c);
for (i = 2; i <= l ; i++)
for (j = 0; j <= l-i ; j ++)
huiwen(j, i);
return 0;
}
void huiwen(int a, int b)
{
int i, j, n;
for (i = 1; i <= (b + 1) / 2; i ++)
if (c[a-1+i] != c[a+b-i]) break;
if (i == (b + 1) / 2 + 1)
{
for (i = 1 ; i <= b; i ++) cout << c[a-1+i];
cout << endl;
}
}
| 49 |
24,308 | void main()
{
int n=0,i,j,k;
char str[200];
gets(str);
for(i=0;str[i]!='\0';i++)
{
n++;
}
for(i=2;i<=n;i++)
{
for(j=0;j<=n-i;j++)
{
int flag=1;
for(k=0;k<i;k++)
{
if(str[j+k]!=str[j+i-1-k])
{
flag=0;
}
}
if(flag)
{
for(k=j;k<=i+j-1;k++)
{
printf("%c",str[k]);
}
printf("\n");
}
}
}
}
| 49 |
24,309 | int f(char word[500],int len)
{
int i;
for(i=0;i<=len/2;i++)
{
if(word[i]!=word[len-1-i])
{
return 0;
}
}
return 1;
}
int main()
{
char str[500],word[1000][500];
int i,j,len[1000],lenth,m,log;
gets(str);
log=0;
lenth=strlen(str);
for(i=2;i<=lenth;i++)
{
for(j=0;j<=lenth-i;j++)
{
for(m=0;m<i;m++)
{
word[log][m]=str[m+j];
word[log][m+1]='\0';
}
log++;
len[log-1]=strlen(word[log-1]);
}
}
for(i=0;i<log;i++)
{
if(f(word[i],len[i]))
printf("%s\n",word[i]);
}
return 0;
}
| 49 |
24,310 | //****************************************
//*???? **
//*??? 1100012927 **
//*2011.11.13 **
//****************************************
int f(char[], int, int, int);
int k;
int main()
{
int i = 1, b, j = 0;
char a[500];
cin.getline(a,500);
for (j = 0; a[j] != '\0'; j++);
for (i = 1; i < j + 1; i++)
{
for (b = 0; b < j - i; b++)
{
if (f(a, i, b, j))
{
for (k = 0; k <= i; k++)
{
cout << a[b + k];
}
cout << endl;
}
}
}
return 0;
}
int f(char a[], int i, int b, int j)
{
if (a[b] == a[b + i])
{
if (i != 1 && i != 2)
{
i = i - 2; b++;
if(f(a, i, b, j))
return 1;
else
return 0;
}
return 1;
}
else
{
return 0;
}
} | 49 |
24,311 | int main()
{
char a[501],b[2000][501];
int i,j,k,l,p,q,t=0;
scanf("%s",a);
l=strlen(a);
for(i=0;i<=l-1;i++) /*????a[0]????,???????????????????*/
{
for(j=i+1;j<=l-1;j++) //?a[0]????????
{
if(a[i]==a[j]) //?????
{
for(k=1;k<=(j-i+1)/2;k++) //?????????????
{
if(a[i+k]!=a[j-k])
break;
else if(a[i+k]==a[j-k]&&k==(j-i+1)/2)
{
q=0;
t++;
for(p=i;p<=j;p++)
{
b[t][q++]=a[p];
}
b[t][q]='\0';
}
}
}
}
}
for(i=2;i<=l;i++)
{
for(j=1;j<=t;j++)
{
if(strlen(b[j])==i)
{
printf("%s",b[j]);
printf("\n");
}
}
}
} | 49 |
24,312 | 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 |
24,313 | int main()
{
int i,j,l,k,p,q;
char c[500],temp[500]={0};
gets(c);
l=strlen(c);
for(i=1;i<l;i++) //i+1???
{
for(j=0;j<l-i;j++) //j????
{
for(k=0;k<=i;k++)
{
temp[k]=c[j+k];
}
for(p=0;p<=(i+1)/2-1;p++)
{
if(temp[p]!=temp[i-p]) break;
if(p==(i+1)/2-1) printf("%s\n",temp);
}
for(q=0;q<500;q++) temp[q]=0;
}
}
return 0;
} | 49 |
24,314 | int main()
{
int i,j,n,r,flag,k;
char a[501],b[501];
gets(a);
n=strlen(a);
for(i=2;i<=n;i++)
{
for(j=0;j+i-1<n;j++)
{
flag=0;
for(k=1;k<=i;k++)
{
if(a[j+k-1]==a[j+i-k])
continue;
else
{
flag=1;
break;
}
}
if(flag==0)
{
for(r=1;r<=i;r++)
printf("%c",a[j+r-1]);
printf("\n");
}
}
}
return 0;
} | 49 |
24,315 | /*
* ????huiwenzichuan.cpp
* ?????
* ????: 2011-12-28
* ???????
*/
int main(){
char a[500];//????
unsigned int i,j,k,l;//????
cin>>a;//?????
for(k=2;k<strlen(a)+1;k++)//????
{
for(i=0;i<strlen(a)-k+1;i++)//??
{
for(j=i;j<i+k;j++)//???????
{
if(a[j]!=a[2*i+k-1-j])break;//?????????????
else if(j>=2*i+k-1-j){for(l=i;l<i+k;l++)cout<<a[l];cout<<endl;break;}//?????????
}
}
}
return 0;//????
}
| 49 |
24,316 |
int main()
{
char s[505];
int i, j, l;
cin >> s;
l = strlen(s);
for (i = 2; i <= l; i++)
for (j = 0; j <= l - i; j++)
{
int t = i / 2;
int k;
for (k = 0; k < t; k++)
{
if (s[j + k] != s[j + i - k - 1]) break;
}
if (k >= t)
{
for (int m = j; m < j + i; m++)
{
cout << s[m];
}
cout << endl;
}
}
return 0;
}
| 49 |
24,317 | int judge(char *p)
{
int l = strlen(p);
char te[l];
int i,j;
for(i=0;i<l;i++)
te[l-i-1]=p[i];
te[l]='\0';
/*strcpy(p,te);*/
if(strcmp(p,te)==0)
return 1;
else
return 0;
}
main()
{ int i,k,j,t,l,m,h,g,n;
char p[510];
gets(p);
h=strlen(p);
/* printf("%d",judge(p));*/
char temp[h];
for(l=2;l<=h;l++)
{
for(j=0;j<h-l+1;j++)
{ t=j;
for(g=0;g<l;g++)
{
temp[g]=p[t];
t++;
}
temp[g]='\0';
if(judge(temp)==1) printf("%s\n",temp);
}
}
}
| 49 |
24,318 | 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 |
24,319 | int main()
{
char in[501];
char zi[501];
cin.getline(in,500,'\n');
int L,judge=1;
L=strlen(in);
for(int i=2;i<=L;i++)
for(int j=0;j<=L-i;j++)
{
memset(zi,0,sizeof(zi));
for(int k=j;k-j<i;k++)
zi[k-j]=in[k];
judge=1;
for(int k=0;k<i/2;k++)
if(zi[k]!=zi[i-k-1]) {judge=0; break;}
if(judge==1) cout<<zi<<endl;
}
return 0;
}
| 49 |
24,320 | int main()
{
int b,i,m,n,x,y=0;
char a[500];
for(i=0;i<500;i++)
{ scanf("%c",&a[i]);
if(a[i]=='\n')
break;}
for(n=2;n<=i;n++)
{
for(m=0;m<=i-n;m++)
{b=m;
for(x=0;x<n/2;x++)
{ if(a[m+x]==a[m+n-1-x])
{y=0;}
else
{y=1;
break;}}
if(y==0)
{for(b=m;b<m+n;b++)
printf("%c",a[b]);}
printf("\n");
x=0;}m=0;}
return 0;} | 49 |
24,321 | /*
* huiwen string.cpp
*??:???????????
* Created on: 2012-12-19
* Author: ???
*/
int main()
{
char word[501]; //?????????
cin.getline(word,sizeof(word));//?????
int slen=strlen(word); //???????
int len=2,pos=0,num1,num2,i; //??????,??????,??,????????????,
char *p=NULL,*q=NULL; //???????p,q
for(len=2;len<=slen;len++) //??????
{
if(num1==0&&num2==0) //??????????(????)?????,????
break;
if(len%2==0) //??????????
num2=0;
else //?????
num1=0;
for(pos=0;pos<=slen-len;pos++)//????
{
p=word+pos;
q=word+pos+len-1;
do
{
if(*q!=*p) //?????
break;
else
{
p++;
q--;
}
}while(q>p);
if(q<=p)
{
for(i=0;i<len;i++)
cout<<word[pos+i]; //?????
cout<<endl;
if(len%2==0) //??
num2++;
else
num1++;
}
}
}
return 0;
} | 49 |
24,322 | int main()
{
int i,n,m,x,y,z;
char a[500];
gets(a);
for(i=0;a[i]!='\0';i++);
n=i;
for(x=2;x<=n;x++)
for(i=0;i<n-x+1;i++)
{for(y=0,m=1;y<x;y++)
if(a[i+y]!=a[i+x-y-1])
{m=0;break;}
if(m==1)
{for(z=i;z<i+x;z++)
putchar(a[z]);
printf("\n");}
}
return 0;
}
| 49 |
24,323 | int main()
{
char str[501];
int i , j , k ;
int lenth , l , flag;
l = 2; flag = 1;
gets(str);
lenth = strlen(str);
for(l = 2 ; l <= lenth - 1 ; l++)
for(i = 0 ; i <= lenth - l ; i ++)
{
if(str[i] == str[i + l - 1])
{
for(j = i,k = i + l - 1; j < k ; j ++, k--)
{
if(str[j] != str[k])
{
flag = 0;
break;
}
}
if(flag == 1)
{
for(j = i ; j <= i + l - 1; j ++)
printf("%c",str[j]);
printf("\n");
}
flag = 1;
}
}
return 0;
}
| 49 |
24,324 | int main ()
{
char ch[500]; //??????
cin >> ch;
int len = 0; //?????????
len = strlen(ch);
for ( int templen = 2; templen <= len; templen ++ ) //??????
for ( int i = 0; i <= len - templen; i ++ ) //?????????????
for ( int j = i; j < i + templen; j ++ ) //????????????????
{
if ( ch[j] != ch[templen+i-1-(j-i)] ) break;
if ( j == i + templen - 1 )
{
for ( int k = i; k < i + templen; k ++ )
cout << ch[k];
cout << endl;
}
}
return 0;
}
| 49 |
24,325 | //*************************************************
//* file: 1000012912_005.cpp *
//* author : ??? *
//* date : 2010.11.26 *
//* function : ???? *
//*************************************************
void huiwen(int pos, int l , char str[]);
int main()
{
int i, len, l; //l?????
char str[500];
cin.getline(str,500);
len = strlen(str);
for ( l = 2; l <= len; l ++ )
{
for ( i = 0; i < len; i ++ ) //i?????
huiwen(i,l,str);
}
return 0;
}
void huiwen( int pos, int l, char str[])
{
int right, left, j; //left?????right????
for ( left = pos, right = pos + l - 1; right > left; right --, left ++ )
if ( str[left] != str[right] ) //?????????
break;
if ( left >= right ) //????
{
for ( j = pos; j < pos + l; j ++ )
cout << str[j];
cout << endl;
}
} | 49 |
24,326 | /*
* 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 |
24,327 | int main()
{
int len, i, j, k, q, flag = 0;
char a[500];
cin >> a;
len = strlen(a);
for (i = 2; i <= len; i++)
{
for (j = 0; j <= len - i; j++)
{
k = 0;
while (a[j + k] == a[j + i - 1 - k] && k < i)
{
k++;
}
if (k == i)
{
if (flag == 0)
flag = 1;
else
cout << '\n';
for (q = 0; q < i; q++)
{
cout << a[j + q];
}
}
}
}
return 0;
} | 49 |
24,328 | 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 |
24,329 | int main()
{
char a[500];
int len, i, j, k;
cin >> a;
len = strlen(a);
for (i = 2; i <= len; i++)
for (j = 0; j <= len - i; j++)
{
for (k = 0; k < i / 2; k++)
{
if (a[j + k] != a[j + i - 1 - k])
{
k = -1;break;
}
}
if (k != -1)
{
for (k = j; k < j + i; k++)
cout << a[k];
cout << endl;
}
}
return 0;
} | 49 |
24,330 | int main()
{
char a[500];
cin.getline(a,500);
int i,j,k=1,l;
l=strlen(a);
while(k<l)
{
for(i=0,j=k; j<l; i++,j++)
{
int begin=i,end=j;
while(begin<end)
{
if(a[begin]!=a[end]) break;
else
{
begin++;
end--;
}
}
if(begin>=end)
{
int print=i;
for(print; print<=j; print++)
cout<<a[print];
cout<<endl;
}
}
k++;
}
cin.get();cin.get();cin.get();
return 0;
}
| 49 |
24,331 | int main()
{
char a[505],tem1[505],tem2[505],b[505][505];
int len1,p=0,m=1,len[505],count[505];
cin.getline(a,504,'\n');//?????
len1=strlen(a)-1;//????????
for(int i=1;i<=504;i++)
count[i]=i;
for(int i=0;i<=len1-1;i++)
{
for(int j=i+1;j<=len1;j++)//????????????b?
{
memset(tem1,'\0',sizeof(tem1));
memset(tem2,'\0',sizeof(tem2));
p=0;
for(int k=i;k<=j;k++)
{
tem1[p]=a[k];
p++;
}
p=0;
for(int k=j;k>=i;k--)
{
tem2[p]=a[k];
p++;
}
if(strcmp(tem1,tem2)==0)
{
strcpy(b[m],tem1);
m++;
}
}
}
for(int i=1;i<=m-1;i++)//???????? ???
{
len[i]=strlen(b[i]);
}
for(int i=1;i<=m-2;i++)//????
for(int j=1;j<=m-1-i;j++)
{
if(len[j]>len[j+1])
{
int f=len[j];
len[j]=len[j+1];
len[j+1]=f;
int g=count[j];
count[j]=count[j+1];
count[j+1]=g;
}
}
for(int i=1;i<=m-1;i++)//?????
cout<<b[count[i]]<<endl;
return 0;
} | 49 |
24,332 | //*************************************************************
//* ????1000012846_1.cpp *********************************
//* ????? ***********************************************
//* ?????2010?11? *************************************
//* ????????? ***************************************
//*************************************************************
void o( char a[] , int m , int n ) //?????????????????????
{
int p = m , q = n ; //????
for ( ; ; )
{
if (a[m+1] != a[n-1] )
break ;
if ( n - m <= 2 )
{
for ( int i = p ; i <= q ; i++ )
cout << a[i] ;
cout << endl ;
break ;
}
m++ ;
n-- ;
}
}
int main()
{
char a[500] , i , j , k , len ; //??????i,j,k;????len;
cin >> a ; //?????
len = strlen ( a ) ;
for ( k = 1 ; k < len ; k++ )
for ( i = 0 ; i < len ; i++ )
for ( j = i + 1 ; j < len ; j++ )
if ( a[i] == a[j] && j - i == k )
o(a,i,j) ; //????o()
return 0;
} | 49 |
24,333 | int main(){
char a[500];
int i,n,j,p;
gets(a);
for(n=2;n<=strlen(a);n++){
for(i=0;i+n<=strlen(a);i++){
p=1;
for(j=i;j-i<=n-1;j++){
if(a[j]==a[2*i+n-1-j]) p=p*1;
else p=p*0;
}
if(p==1){
for(j=i;j-i<=n-1;j++){
printf("%c",a[j]);
}
printf("\n");
}
}
}
return 0;
} | 49 |
24,334 | //******************************
//????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 |
24,335 | int main()
{
char s[500];
gets(s);
int len;
len=strlen(s);
int n, i, j;
int judge;
for(n=2;n<=len;n++)
{
for(j=0;j<len-n+1;j++)
{
judge=1;
for(i=0;i<n;i++)
{
if(n+j-i-1>=len) break;
else
{
if(s[i+j]!=s[n-1-i+j]) judge=0;
}
}
if(judge==1)
{
for(i=0;i<n;i++)
{
printf("%c", s[i+j]);
}
printf("\n");
}
}
}
return 0;
}
| 49 |
24,336 | int judge(char s[],int start,int wid)
{
int end=start+wid-1;
while((s[start]==s[end])&&(start<end))
{
start++;
end--;
}
if(start>=end)
return(1);
else
return(0);
}
int main()
{
char s[600]={'\0'};
int l,w,i,j,c;
gets(s);
l=strlen(s);
for(w=2;w<=l;w++)
{
for(i=0;i<=l-w;i++)
{
c=judge(s,i,w);
if(c==1)
{
for(j=i;j<=i+w-1;j++)
putchar(s[j]);
printf("\n");
}
}
}
} | 49 |
24,337 | int main()
{
char c;
char str[501];
int i,j,r,flag,t,k;
scanf("%s",str);
for(i=0;str[i]!='\0';i++)
{
t=i+1;
}
for(j=2;j<=t;j++)
{
for(i=0;i<=t-j+1;i++)
{
for(r=i,flag=1,k=j-1;r<=i+j-1;r++,k--)
{
if(str[r]!=str[i+k])
{
flag=0;
break;
}
}
if(flag==1)
{
for(r=i;r<=i+j-1;r++)
{
printf("%c",str[r]);
}
printf("\n");
}
}
}
return 0;
} | 49 |
24,338 | // ???? ?? 1000062708
void t(char[], int);
int main()
{
char a[500],b[500];
int i, j, k, n, m;
cin >> a;
n = strlen(a);
for(i = 2;i <= n;i++)
for(j = 0;j <= n - i;j++)
{
m = 0;
for(k = j;k < j + i;k++)
b[m++] = a[k];
b[i] = '\0';
t(b,i);
}
return 0;
}
void t(char b[], int m)
{
int i;
for(i = 0;i < m / 2;i++)
if(b[i] != b[m - i - 1])
break;
if(i == m / 2)
cout << b << endl;
}
| 49 |
24,339 |
int main()
{
int l;
char p[505];
int b, w;
int i;
int flag;
cin >> p;
l = strlen(p);
for(w = 2; w <= l; w ++)
for(b = 0; b <= l - w; b ++)
{
flag = 1;
for(i = 0; i < w / 2 + 1 ; i++)
{
if(p[b + i] != p[b + w - 1 - i])
{
flag = 0;
break;
}
}
if(flag == 1)
{
for(i = b; i < b + w; i ++)
cout << p[i];
cout << endl;
}
}
return 0;
}
| 49 |
24,340 | 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 |
24,341 | int main()
{
char a[501],*p;
int num=0,i,j,m,len;
scanf("%s",a);
len=strlen(a);
for(i=2;i<=len;i++)
{
for(p=a,j=0;j<=len-i;j++,p++)
{
for(m=i-1;m>0;m-=2,p++)
{
if(*p!=*(p+m))
{
num=1;
break;
}
}
if(num==0)
{
for(p=&a[j],m=1;m<=i;m++,p++)
{
printf("%c",*p);
}
printf("\n");
}
num=0;
p=&a[j];
}
}
return 0;
}
| 49 |
24,342 | int main()
{
int i,j,len,n;
char a[500],b[500];
gets(a);
len=strlen(a);
for(j=0;j<len;j++)
{
for(i=0;i<len;i++)
{
if(i>=j)
if((a[i-j]==a[i+j+1])&&(a[i-j+1]==a[i+j]))
{
n=0;
for(;n<=2*j+1;n++)
{
printf("%c",a[i-j+n]);}
printf("\n");
}
else
continue;
}
}
return 0;
}
| 49 |
24,343 | main()
{ int i,j,k,n,m,l,o;
char s[501];
gets(s);
l=strlen(s);
for(n=2;n<=l;n++)
{ for(i=0;i<=l-n;i++)
for(m=i,o=i+n-1;s[m]==s[o];m++,o--)
if(m>=o)
{for(j=i;j<=i+n-1;j++)
printf("%c",s[j]);
printf("\n");break;
}
}
} | 49 |
24,344 | int main()
{
int len,i,j,k;
char a[501];
scanf("%s",&a);
len=strlen(a);
for(j=1;j<len;j++)//??????
{
for(i=0;i<len-1;i++)//??????
{
int e=0;
if((j+1)%2==0)
{
for(k=i;k<=(j+1)/2+i-1;k++)//??????????
{
if(a[k]!=a[i+i+j-k])
{
e=1;
break;
}
}
}else
{
for(k=i;k<=(j/2-1+i);k++)
{
if(a[k]!=a[i+i+j-k])
{
e=1;
break;
}
}
}
if(e==0) //????
{
for(k=i;k<i+j;k++)
{
printf("%c",a[k]);
}
printf("%c\n",a[i+j]);
}
}
}
return 0;
}
| 49 |
24,345 | char *reverse(char *pt);
int main()
{
char source[501];
char sub[501];
char term[501];
int len;
int sublen;
char *p=source;
gets(source);
len=strlen(source);
for(sublen=2;sublen<=len;sublen++)
{
for(p=source;p<source+len-sublen+1;p++)
{
strncpy(sub,p,sublen);
sub[sublen]='\0';
strcpy(term,sub);
if(strcmp(sub,reverse(term))==0)
printf("%s\n", sub);
}
}
return 0;
}
char *reverse(char *pt)
{
char term[501];
int i;
strcpy(term,pt);
for(i=0;i<strlen(pt);i++)
pt[i]=term[strlen(pt)-i-1];
return pt;
} | 49 |
24,346 | //*************************************
//* ???? *
//* ?????? *
//* ?????2011?12?18? *
//*************************************
int main()
{
int n, i, j, flag, p;
char a[1000];
cin >> a;//?????
n = strlen(a);//????????
for(i = 2; i <= n; i ++)//i??????????????
{
for(p = 0; p <= n - i; p ++)//p???????????
{
flag = 1;//flag???????????
for(j = p; j < p + i; j ++)//j?????????
{
if(a[j] != a[2 * p + i - 1 - j])
{
flag = 0;
break;//????????,flag??0,??????
}
}
if(flag == 1)
{
for(j = p; j < p + i; j ++)
cout << a[j];//???????,????
cout << endl;
}
}
}
return 0;
}
| 49 |
24,347 | /*
* ????.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 |
24,348 | int main()
{
char a[500];
int k[500] = {0};
int times = 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;
}
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 0;
} | 49 |
24,349 |
int main()
{
char a[1000];
int i,j,k,len,l;
cin.getline(a,1000);
len = strlen(a);
for ( l = 2;l < len; l ++ )//??????2????
{
for ( i = 0 ; i < len + 1 - l; i ++)
{
for ( j = i,k = 0;j <= i + l/2; j ++,k ++ )
{
if (a[j] != a[i+l-1-k]) break;
}
if ( j > i + l/2)
{
for ( j = i; j < i + l;j ++ ) cout << a[j];
cout << endl;
}
}
}
return 0;
}
| 49 |
24,350 | /*
* ????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 |
24,351 | 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 |
24,352 | main()
{
char s[102];
int i,j,k;
int n;
scanf("%s",s);
for(i=0;s[i]!='\0';i++)
n=i;
n=i;
for(i=1;i<=n;i++)
{
for(j=0;s[j+i]!='\0';j++)
{
for(k=j;k<=j+i;k++)
{
if(s[k]!=s[2*j+i-k])
{
break;
}
}
if(k==j+i+1)
{
for(k=j;k<=j+i;k++)
{
printf("%c",s[k]);
}
printf("\n");
}
}
}
}
| 49 |
24,353 |
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 |
24,354 | //******************************************
//*??????? **
//*?????? 1100062706 **
//*???2011.11.14 **
//******************************************
void panDuan(int);//
int main()//
{//
int w = 1;//
panDuan(w);//
char a[500];//
char e[500][500];//
cin.getline(a,500);//
int i = 0, k, j, n, m, g = 0, l, t, h = 0, y = 0, b = 0, q = 0, r = 0, x, z;//
int p[500] = {0};//
do
{
if(a[i] != '\0')
i++;//
else
break;
}while(1);
for (k = 2;k < i + 1;k++)
{
for(j = 0;j < i - k + 1;j++)
{
g = 0;
for(m = j, n = j + k - 1; ;m++, n--)
{
if(m >= n||n >= i)
break;
if(a[m] == a[n])//
{g++;}
}
t = j, x = t;
if(g == k/2)//
{
for(l=0;l<k;l++)
cout<<a[t++];
cout<<'\n';
}
}
h=0;
}
return 0;
}//
void panDuan(int a)//
{
if(a != 1)
cout << "false" << endl;//
}
| 49 |
24,355 | 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 |
24,356 | char s[1000],s1[100][100];
int flag=0;
void f(char x,char y);
int main()
{
int i,len[100],k,j,temp;
char s2[100];
gets(s);
for(i=1;s[i]!='\0';i++)
{
if(s[i-1]==s[i])
{
s1[flag][0]=s[i-1];
s1[flag][1]=s[i];
flag++;
f(i-1,i);
}
}
k=flag;
for(i=0;i<k;i++)
len[i]=strlen(s1[i]);
for(i=0;i<k;i++)
{
for(j=1;j<k-i;j++)
{
if(len[j-1]>len[j])
{
temp=len[j-1];
len[j-1]=len[j];
len[j]=temp;
strcpy(s2,s1[j-1]);
strcpy(s1[j-1],s1[j]);
strcpy(s1[j],s2);
}
}
}
for(i=0;i<k;i++)
printf("%s\n",s1[i]);
}
void f(char x,char y)
{
char *p2,*p;
int i;
if(x>=1&&s[y+1]!='\0')
{
if(s[x-1]==s[y+1])
{
p2=&s[y+1];
for(p=&s[x-1],i=0;p<=p2;p++,i++)
s1[flag][i]=*p;
flag++;
f(x-1,y+1);
}
}
} | 49 |
24,357 |
int main()
{
int i,k=0,j,t,p=0;
char a[501];
gets(a);
for(i=0;a[i]!='\0';i++)
k++;
for(i=2;i<=k;i++)
{ for(j=1;j+i-1<=k;j++)
{ p=0;
for(t=j;t<=j+i-1;t++)
{ if(a[t-1]!=a[j+j+i-t-2]) p=1; }
if(p==0)
{ for(t=j;t<=j+i-1;t++) printf("%c",a[t-1]);printf("\n");}
}
}
return 0;
}
| 49 |
24,358 | char str[500];
int huiwen( int i , int length )
{
int j, p = i + length -1;
for (j = i; j <= (2*i + length)/2 ; j++ )
{
if (str[j] != str[p])
return 0;
p--;
}
return 1;
}
int main()
{
int length, i = 0, j;
cin >> str;
for (length = 2; str[length - 1]!='\0';length++)
for (i = 0;str[i+length-1] != '\0'; i++)
{
if (huiwen(i,length))
for (j = i; j < i+length; j++)
{
if( j == i + length -1)
cout << str[j] << endl;
else
cout << str[j];
}
}
return 0;
} | 49 |
24,359 | int main()
{
int i, j, k, l, m, flag;
char a[501];
for (m = 1; m > 0; m++)
{
if (a[m-1]== '\n')
break;
a[m] = cin.get();
}
for (j = 2; j <= m; j++)
{
for (i = 1; i <= m - 1; i++)
{
flag = 1;
for (k = 0; k < j; k++)
{
if (a[i + k] != a[i + j - k - 1])
flag = 0;
}
if (flag)
{
for (l = 0; l<j; l++)
{
if(l == j-1)
cout << a[i + l]<<endl;
else
cout << a[i + l];
}
}
}
}
return 0;
} | 49 |
24,360 | void main(void)
{
char a[501];
int i,j,l,n,k;
gets(a);
n=strlen(a);
for(l=2;l<=n;l++)
{
for(i=0;i<=n-l;i++)
{
k=1;
for(j=0;j<=l/2;j++)
{
if(a[i+j]==a[i+l-1-j])
k=k*1;
else
{
k=k*0;
break;
}
}
if(k)
{
for(j=0;j<l;j++)
printf("%c",a[i+j]);
printf("\n");
}
}
}
} | 49 |
24,361 | //**********************************************
//**???????******************************
//**?????? 1000012741*********************
//**???2010?11?26?************************
//**********************************************
void palin ( char str[], int m) //??palin????????????????????str???????m?????
{
int i, j, p; //??i??????j?p??????
for (i = 0; str[i+1] != '\0'; i++) //??????????
{
if ( m % 2 == 0 ) //?????????
{
j = i; //?????????
p = i + 1;
}
else //?????????
{
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 ( int k = j + 1; k < p; k++) //?????
cout << str[k];
cout << endl;
}
}
}
return; //palin????
}
int main() //?????
{
char str[503]; //?????str
int m, l; //??m????????l????????
cin >> str; //?????
l = strlen(str); //???????
for ( m = 2; m <= l; m = m + 1 ) //???????????
{
palin (str, m); //??palin??
}
return 0; //?????
}
//**********************************************
| 49 |
24,362 |
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 |
24,363 |
int main()
{
char str[500];
int count, s;
cin >> str;
for (int i = 2; i <= strlen(str); i++) //??????????
{
for (int j = 0; j < strlen(str) - i + 1; j++) //??????????????????i
{
count = 0; //???????0
s = 2 * j + i - 1;
for (int k = j; k < j + i; k++) //???????
{
if (str[k] == str[s - k])
{
count++;
}
}
if (i % 2 == 0)
{
if (count == i)
{
for (int p = j; p < j + i; p++)
{
cout << str[p];
}
cout << endl;
}
}
if (i % 2 == 1)
{
if (count == i - 1)
{
for (int q = j; q < j + i; q++)
{
cout << str[q];
}
cout << endl;
}
}
}
}
return 0;
} | 49 |
24,364 | int main()
{
char s[500];
char *p;
int i,l,j,k,m;
scanf("%s",s);
l=strlen(s);
for(i=2;i<l+1;i++)
for(j=0;j<=l-i;j++)
{
k=0;
m=i-1;
for(p=s+j;p<s+j+i;p++)
{
if(*p!=*(p+m)) k++;
m=m-2;
}
if(k==0)
{
for(p=s+j;p<s+j+i;p++)
printf("%c",*p);
printf("\n");
}
}
return 0;
} | 49 |
24,365 |
int isgoodsubstr( char * s, int l, int r )
{
if ( l > r )
return -1;//wrong!
int i = l, j = r;
for ( ; i < j; i++, j-- )
if ( s[i] != s[j] )
return 0;
return 1;
}
int main()
{
char s[501];
gets(s);
int i = 0, j = 0, l = strlen(s);
int k = 0;
for ( i = 2; i <= l; i++ )
{
for ( j = 0; j+i-1 < l; j++ )
{
if ( isgoodsubstr( s, j, j+i-1 ) == 1 )
{
for ( k = j; k <= j+i-1; k++ )
putchar(s[k]);
putchar('\n');
}
}
}
return 0;
} | 49 |
24,366 | /*
* 1204.cpp
*
* Created on: 2012-12-4
* Author: wangyinzhi
*/
int main(){
char a[500];
int i,j,k,t;
cin>>a;
for(i=2;i<=strlen(a);i++){//?????
for(j=i-1;j<strlen(a);j++){//????
for(k=0;k<i/2;k++){
if(a[j-k]!=a[j-i+k+1])//????
break;
}
if(k==i/2){
for(t=0;t<i;t++){
cout<<a[j-i+t+1];//???????
}
cout<<endl;
}
}
}
return 0;
}
| 49 |
24,367 | 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);
}
}
}
} | 49 |
24,368 | int panduan(char *c,int l)
{
int f=0,t=0,i;
if(l%2==0)
{
for(i=0;i<=(l/2)-1;i++)
{
if(*(c+i)==*(c+l-1-i))
f+=1;
}
if(f==l/2)
t=1;
}
else
{ f=0;
for(i=0;i<=(l-3)/2;i++)
{
if(*(c+i)==*(c+l-1-i))
f+=1;
}
if(f==(l-1)/2)
t=1;
}
return(t);
}
int main()
{
int n,*p,i,l,f,k;
char c[100];
int panduan(char *c,int l);
gets(c);
n=strlen(c);
for(i=2;i<=n;i++)
{
for(l=0;l<=n-1;l++)
{
p=&c[l];
f=panduan(p,i);
if(f==1)
{
for(k=l;k<=l+i-2;k++)
{
printf("%c",c[k]);
}
printf("%c\n",c[l+i-1]);
}
}
}
return 0;
}
| 49 |
24,369 |
int main() {
char str[500]={'\0'},b[500]={'\0'};
char a[500]={'\0'};
int c,len,j,i,k,p;
gets(a);
c=strlen(a);
for(len=2;len<=c;len++){
//???
for(k=0;k<=c-len;k++){
//?str??
for(j=k,p=0;j<=len-1+k;j++,p++){
str[p]=a[j];
}
//????b;
for(i=0;i<len;i++){
b[i]=str[len-1-i];
}
//??????
if(strcmp(str,b)==0){
printf("%s\n",str);
}
}
}
return 0;
} | 49 |
24,370 | void fanxu(char *p,int len);
int compare(char *p1,char* p2,int length);
int main()
{
char char_array[500],store1[500],store2[500],*p;
gets(char_array);
p=char_array;
int len,i,j,k;
len=strlen(char_array);
for(k=0;k<=499;k++)
{
store1[k]='\0';
store2[k]='\0';
}
for (i=2;i<=len;i++)
{
for(p=char_array;p<=char_array+len-i;p++)
{
for(k=0;k<=i-1;k++)
{
store1[k]=*(p+k);
store2[k]=store1[k];
}
fanxu(store1,i);
//printf("str1=");
//puts(store1);
//printf("str2=");
///puts(store2);
if (compare(store1,store2,i)==1)
{
puts(store2);
}
}
}
}
void fanxu(char *p,int len)
{
char *l,*m,c;
for (l=p,m=p+len-1;l<m;l++,m--)
{
c=*m;
*m=*l;
*l=c;
}
}
int compare(char *p1,char* p2,int length)
{
int w;
int exist=1;
for (w=0;w<=length-1;w++)
{
if (*(p1+w)!=*(p2+w))
{
exist=0;
}
}
return exist;
}
| 49 |
24,371 |
int main()
{
int k = 2, i = 0, j = 0;
char str[500];
cin >> str;
int len = strlen(str);
int p = 0;
for (k = 2; k <= len; k++)
for (i = 0; i <= len - k; i++)
{
p = 0;
for (j = i; j < i + k / 2; j++)
{
if (str[j] != str[2 * i + k - 1 - j])
break;
else
p++;
if (p == k / 2)
{
for (int t = i; t <= i + k - 1; t++)
cout << str[t];
cout << endl;
}
}
}
return 0;
}
| 49 |
24,372 |
void main()
{
char s[500];
int l,i,k,t,g=0;
scanf("%s",s);
l=strlen(s);
for(k=1;k<l;k++)/*k???????*/
{
for(i=0;i<l-k;i++)/*i???????*/
{
for(t=1;t<=k;t++)
{
g=1;
if(s[i+t-1]!=s[i+2*k-t])/*????*/
{
g=0;
break;
}
}
if(g==1)
{
for(t=i;t<2*k+i;t++)
printf("%c",s[t]);
printf("\n");
}
}
}
}
| 49 |
24,373 | 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 |
24,374 | 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 |
24,375 | int main()
{
char a[500],*p,*p1;
int i,j,n;
scanf("%s",a);
n=strlen(a);
for(i=2;i<=n;i++)
{
for(p=a;p<=a+n-i;p++)
{
for(p1=p;p1<p+i;p1++)
{
if(*p1!=*(p+(p+i-p1-1)))
break;
}
if(p1==p+i)
{for(j=0;j<i;j++) printf("%c",*(p+j));
printf("\n");}
}
}
return 0;
}
| 49 |
24,376 | //*******************************
//????4.cpp *
//???2012?11?10? *
//????? 1? 1200012895 *
//??????? *
//*******************************
int main()
{
char a[501], c; //a??????c??????
int i = 1, j, k, l = 0, t = 0, sum; //i????????j?k?????l?sum??k??????sum?????????
while ((c = cin.get()) != '\n') //??????????a
{
a[i] = c;
i++;
}
i--; //???????
for (sum = 2; sum <= i; sum = sum + 2)
{
for (j = 1; j <= i - sum + 1; j++)
{
for (k = j; k <= sum / 2 + j - 1; k++) //???????????
{
l = sum + j - (k - j + 1);
if (a[k] == a[l])
t++;
l = 0;
}
if (t == sum / 2) //?????????????????????????
{
for (k = j; k <= sum + j - 1; k++)
cout << a[k];
cout << endl;
}
t = 0; //??
}
}
return 0;
}
| 49 |
24,377 | int main()
{
char a[500];
int i,j,k,x;
gets(a);
//i?????????
for(i=2;i<=strlen(a);i++)
{
//j?????????
for(j=0;j<=(strlen(a)-i);j++)
{
x=0;
for(k=0;k<i;k++)
{
if(a[j+k]!=a[j+i-1-k])
{
x=1;
break;
}
}
if(x==0)
{
for(k=j;k<j+i;k++)
printf("%c",a[k]);
}
printf("\n");
}
}
return 0;
}
| 49 |
24,378 | int main()
{
int n,i,j,k,a,b,q,w=0;
char s[500];
scanf("%s",s);
n=strlen(s);
a=n/2;
for(j=1;j<a+1;j++)
{
k=j;
for(i=0;i<n-1;i++)
{
for(b=0;b<k;b++)
{
w=0;
if(s[i+b]==s[i+2*k-b-1])
{
;
}
else
{
w=1;
break;
}
}
if(b==k)
{
for(q=0;q<j*2;q++)
{
printf("%c",s[i+q]);
}
printf("\n");
}
}
}
return 0;
} | 49 |
24,379 | int main()
{
int i,m=0,x,j,k,p;
char a[501];
char b[501];
gets(a);
for(p=2;p<=500;p++)
{
i=0;
for(i=0;a[i]!='\0';i++)
{
j=0;
for(k=i;k<=i+p-1;k++)
{
b[j]=a[k];
j++;
}
b[j]='\0';
m=0;
for(x=0;x<=((p-1)/2);)
{
if(b[x]==a[i+p-1-x])
{
x++;
}
else
{
m=1;
break;
}
}
if(m==0)
{
puts(b);
}
}
}
return 0;
}
| 49 |
24,380 | char s[510];
int num=0;
int k=0;
int len;
struct Str{
int start,end;
int len;
}str[30010];
void run(){
int a=k;
int b=num;
k=num;
int k1,k2;
for(int i=a;i<b;i++){
k1= str[i].start-1;
k2= str[i].end+1;
if(k1>=0&&k2<len&&s[k1]==s[k2]){
str[num].start=k1;
str[num].end=k2;
str[num++].len=k2-k1;
}
}
}
int main(){
cin>>s;
len = strlen(s);
//???????
for(int i=0;i<len-1;i++){
if(s[i]==s[i+1]){
str[num].start = i;
str[num].end = i+1;
str[num++].len = str[i].start-str[i].end;
}
}
k=0;
//?????????????????????????
while(k<num) run();
for(int i=0;i<num;i++){
for(int j=str[i].start;j<=str[i].end;j++){
printf("%c",s[j]);
}
printf("\n");
}
return 0;
}
| 49 |
24,381 |
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];
}
if(judge(b))
cout<<b<<endl;
j++;
}
}
return 0;
}
| 49 |
24,382 |
int main()
{
char a[100];
int i=1,j,m,k,x = 0;
while ((a[i] = cin.get() ) != '\n')
{
i++;
}
m = i - 1;
for (j = 2; j <= m; j++) //????????
{
for (i = 1; i <= m-j+1; i++) //??????
{
for ( k = 0; k <= j/2-1; k++) //??
{
x = 0;
if ( a[i+k] != a[i+j-1-k] )
{
x = 1;
break;
}
}
if (x == 0)
{
for (k = 0; k <= j-1; k++)
{
cout << a[i+k];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,383 | 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 |
24,384 | int main()
{
int i,j,k,l;
char a[501];
gets(a);
for(j=2;j<strlen(a);j=j+2)
{
for(i=0;i<strlen(a);i++)
{
int d=0;
for(k=j/2;k>=0;k--)
{
if(a[i+k]==a[i+j-k-1])
{
continue;
}
else
{
d=1;
break;
}
}
if(d==0)
{
for(l=i;l<i+j;l++)
{
printf("%c",a[l]);
}
putchar('\n');
}
}
}
return 0;
} | 49 |
24,385 | int main()
{ int check(char str[]);
char string[1000];
gets(string);
int n,i;
n=strlen(string);
int j;
int k,m;
int w=0;
int r;
char str2[1000];
for(j=2;j<n;j++)
{
for(m=0;m<=n-j;m++)
{
for(k=m;k<m+j;k++)
{
str2[w]=string[k];
w++;
str2[w]='\0';
if(k==n)
break;
}
r=check(str2);
if(r==1)
{
printf("%s\n", str2);
}
w=0;
}
}
return 0;
}
int check(char str[])
{
int n;
char str1[1000];
strcpy(str1,str);
n=strlen(str);
int i;
char c;
for(i=0;i<=(n-1)/2;i++)
{
c=str[i];
str[i]=str[n-1-i];
str[n-1-i]=c;
}
if(strcmp(str,str1)==0)
return 1;
else
return 0;
}
| 49 |
24,386 | //******************************************
//*???????.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 |
24,387 | int main()
{
int i,j,k,len;
char x[510],temp[510],tran[510];
char *p=x;
scanf("%s",x);
len=strlen(x);
for(i=2;i<=len;i++)
for(j=0;j<=len-i;j++)
{
for(k=0;k<i;k++)
{
temp[k]=x[j+k];
temp[i]='\0';
}
for(k=0;k<i;k++)
tran[i-k-1]=temp[k];
tran[i]='\0';
if(strcmp(temp,tran)==0)
printf("%s\n",temp);
}
return 0;
}
| 49 |
24,388 |
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 |
24,389 | 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 |
24,390 | int main()
{
char s[500];
gets(s);
int a[500][500]={0},b[500]={0};
int l,i,j,k,p=0;
l=strlen(s);
for(i=0;i<l-1;i=i+1)
{
for(j=1;(i+j<l)&&(i-j>=0);j=j+1)
{
if (s[i+j]==s[i-j])
{
a[2*j+1][b[2*j+1]]=i;
b[2*j+1]++;
}
else break;
}
for(j=0;((i-j)>=0)&&(i+1+j<l);j=j+1)
{
if (s[i-j]==s[i+1+j])
{
a[2*j+2][b[2*j+2]]=i;
b[2*j+2]++;
}
else break;
}
}
p=0;
for(i=2;i<=l;i=i+1)
{
if (i%2==0)
{
for(j=0;j<b[i];j=j+1)
{
if(p) printf("\n");
p=p+1;
for (k=a[i][j]-i/2+1;k<=a[i][j]+i/2;k=k+1)
printf("%c",s[k]);
}
}
else
{
for(j=0;j<b[i];j=j+1)
{
if(p) printf("\n");
p++;
for(k=a[i][j]-(i-1)/2;k<=a[i][j]+(i-1)/2;k=k+1)
printf("%c",s[k]);
}
}
}
return 0;
}
| 49 |
24,391 | int main()
{
char a[500] ,b[500]={'0'};
int la,i,j,n=0,m;
cin >> a;
la = strlen(a);
for(m=2;m<=la;m=m+2)
{
for(i=0;i<=la-m;i++)
{
for(j=i;j<=i+m/2-1;j++)
{
if(a[j]==a[m+2*i-1-j])
{
n++;
b[j-i]=a[j];
b[m+i-1-j]=a[m+2*i-1-j];
}
}
if(n==m/2)
{
cout<<b<<endl;
}
n=0;
}
}
return 0;
}
| 49 |
24,392 | /*
* 1000012900.cpp
*
* Created on: 2010-12-23
* Author: Princeyou
*/
int main()
{
char a[500];
cin >> a;
int i,j,l,k,m,n,c;
l=strlen(a);
for(k=1;k<=l/2;k++)
for(i=0;i<l;i++)
{
m=i;
n=i+1;
c=0;
while(a[m]==a[n])
{
c++;
if(c==k)
{
for(j=m;j<=n;j++)
cout << a[j];
cout << endl;
break;
}
m--;
n++;
}
}
return 0;
}
| 49 |
24,393 | main()
{
char a[500];
int i,j,k;
gets(a);
for(i=2;i<=strlen(a);i++)
{
for(j=0;j<strlen(a)+1-i;j++)
{
for(k=0;j+k<=j+i-k-1;k++)
{
if(a[j+k]!=a[j+i-k-1])
break;
}
if(j+k>j+i-k-1)
{
for(k=0;k<i;k++)
printf("%c",a[j+k]);
printf("\n");
}
}
}
} | 49 |
24,394 | char s[501];
int i, j, l;
void even(int k)
{
for (i=(k/2);i<strlen(s)-(k/2);i++)
{
for (j=0;j<=(k/2);j++)
{
if (s[i-j]!=s[i+1+j]) break;
if (j==(k/2))
{
for (l=i-j;l<=i+1+j;l++)
cout << s[l];
cout << endl;
}
}
}
}
void odd(int k)
{
for (i=(k/2+1);i<=strlen(s)-(k/2+1);i++)
{
for (j=1;j<=(k/2+1);j++)
{
if (s[i-j]!=s[i+j]) break;
if (j==(k/2+1))
{
for (l=i-j;l<=i+j;l++)
cout << s[l];
cout << endl;
}
}
}
}
int main()
{
int k=0;
cin.get(s,500);
while(1)
{
odd(k);
k++;
if (k==strlen(s)-2) break;
even(k);
k++;
if (k==strlen(s)) break;
}
return 0;
}
| 49 |
24,395 | 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 |
24,396 | void main()
{
char c[501],*p;
int l,i,j,k,len,flag=1;//l--????
for(i=0;i<500;i++)
{
scanf("%c",&c[i]);
if(c[i]=='\n')
{
len=i+1;
break;
}
}
for(l=2;l<=len;l++)
{
for(j=0;j<=len-l;j++)
{
p=&c[j];//
flag=1;//
for(k=0;k<l/2;k++)
{
if(*(p+k)!=*(p+l-1-k))
{
flag*=0;
break;
}
}
if(flag==1)
{
for(k=0;k<l;k++)
printf("%c",*(p+k));
printf("\n");
}
}
}
}
| 49 |
24,397 | int main()
{
char str[510];
int m,s,i,j,k;
gets(str);
for(j=1;j<strlen(str)-1;j++)
{
for(i=0;i<strlen(str);i++)
{
m=j+1;
for(s=i;s<=m/2-1+i;s++)
if(str[s]!=str[m-s-1+i+i])break;
if(s==m/2+i)
{for(s=i;s<=i+j;s++)printf("%c",str[s]);printf("\n");}
}
}
return 0;
} | 49 |
24,398 | 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 |
24,399 |
int main()
{
int i,j,k,flag,v=0,x,y,xci;
char str[500],hw[100][200];
scanf("%s",str);
int l=strlen(str);
for(i=2;i<=l;i++)
{
xci=i/2;
for(j=0;j+i<=l+1;j++)
{
flag=1;
for(k=0;k<xci;k++)
{
if(str[j+k]!=str[j+i-1-k]) flag=0;
}
if(flag==1)
{
for(x=0;x<i;x++)
hw[v][x]=str[j+x];
hw[v][x]='\0';
v++;
}
}
}
for(i=0;i<v;i++)//
printf("%s\n",hw[i]);
} | 49 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.