id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
24,400 | int main()
{
char a[500];
int i,j,n,length;
gets(a);
length=strlen(a);
for(i=0;i<length;i++)
{
if(a[i]==a[i+1])
{
for(j=i;j<i+1;j++)
printf("%c",a[j]);
printf("%c\n",a[j]);
}
}
for(n=1;n<length;n++)
{
for(i=0;i<length-n-1;i++)
{
if(a[i+1]==a[i])
{
if(a[i+n+1]==a[i-n])
{
if(a[i+n]==a[i-n+1])
{
for(j=i-n;j<i+n+1;j++)
printf("%c",a[j]);
printf("%c\n",a[j]);
}
}
}
}
}
return 0;
} | 49 |
24,401 | int main()
{
char m[500];
cin.getline(m,500);
int len,f;
len=strlen(m);
for(int i=2;i<=len;i++)//??
for(int j=0;j<=len-i;j++)//?????
for(int q=j;q<i+j;q++)//q??????
{
f=i+j*2;//???????? ?????????? ???????i j ????
if(m[q]!=m[f-q-1])break;
if((q+1)>=(f-q-2))
{
for(int k=j;k<i+j;k++)
{
if(k==i+j-1)
cout<<m[k]<<endl;
else
cout<<m[k];
}
break;
}
}
return 0;
} | 49 |
24,402 | int main()
{
char str[600];
cin>>str;
int le=strlen(str),p,q;
for(int k=1;k<=le-1;k++)
for(int i=0;i<=le-2&&i+k<=le-1;i++)
{
int flag=1;
for(p=i,q=i+k;p<q;p++,q--)
if(str[p]!=str[q])
{
flag=0;
break;
}
if(flag==1)
{
for(int m=i;m<=i+k;m++)
cout<<str[m];
cout<<endl;
}
if(flag==0)
continue;
}
return 0;
}
| 49 |
24,403 | /*
* fx01.cpp
*
* Created on: 2013-1-11
* Author: SONY
*/
int main(){
char str[501];
cin>>str;
int len;
len=strlen(str);
int i,j;
for(i=2;i<=len;i++)
{
for(j=0;j<=len-i;j++)
{
int m,k,t,b=0;
k=j;
t=j+i-1;
for(m=1;m<=i/2;m++)
{
if(str[k]==str[t])
{
b++;
k++;
t--;
}
else break;
}
if(b==i/2)
{
for(m=j;m<=j+i-1;m++)
{
cout<<str[m];
}
cout<<endl;
}
b=0;
}
}
return 0;
}
| 49 |
24,404 | //****************************************
//*??????? **
//*????? 1100013004 **
//*???2010.11.13 **
//****************************************
int a,i,j,flag = 1;
void recycle(int,char[]);
int main()
{
int i;
char str[500];
cin.getline(str,500);
for(i = 2;str[i] != '\0';i++)
recycle(i,str);
}
void recycle(int a,char str[])
{
for(i = 0;str[i] != '\0';i++)
{
flag = 1;
for(j = 0;j < a;j++)
{
if(str[i + j] != str[i + a - 1 - j])
{
flag = 0;
break;
}
}
if(flag)
{
for(j = i ;j < i + a;j++)
cout<<str[j];
}
cout<<endl;
}
return;
}
| 49 |
24,405 | struct hw{
int s;
int l;
}queue[N];
int main()
{
int len,q=0,i,j;
char str[N];
gets(str);
len=strlen(str);
for(i=0;i<len-1;i++)
{
if(str[i]==str[i+1])
{
queue[q].s=i;
queue[q++].l=2;
}
}
for(i=0;i<q;i++)
{
for(j=0;j<queue[i].l;j++)
printf("%c",str[queue[i].s+j]);
printf("\n");
if(str[queue[i].s-1]==str[queue[i].s+queue[i].l])
{
queue[q].s=queue[i].s-1;
queue[q++].l=queue[i].l+2;
}
}
} | 49 |
24,406 | main()
{ char s[1000];
int m,i,j,k,len,x,y,n,h;
gets(s);
len=strlen(s);
for(n=2;n<=len;n++)
{
for(i=0;i<=len-n;i++)
for(k=i,j=i+n-1;s[k]==s[j];k++,j--)
if(k>=j)
{
for(h=i;h<i+n;h++)
printf("%c",s[h]);
printf("\n");break;}
}
} | 49 |
24,407 | 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 |
24,408 | /*????????
????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 |
24,409 | int main()
{
int m,n,h,i,j,k,l,length,mark;
char str[100],x[100];
gets(str);
length=strlen(str);
for(i=2;i<length;i++)
{
for(j=0;j<=(length-i);j++)
{
m=j;
for(k=0;k<i;k++,j++)
{
x[k]=str[j];
}
mark=0;
if(i%2==0)
{
for(l=0;l<(i/2);l++)
{
if(x[l]==x[(i-l-1)]) mark=mark+1;
else break;
}
if(mark==(i/2))
{
for(h=0;h<i;h++)
{
if(h==(i-1)) printf("%c\n",x[h]);
else printf("%c",x[h]);
}
}
}
if(i%2!=0)
{
for(l=0;l<(i/2);l++)
{
if(x[l]==x[(i-l-1)]) mark=mark+1;
else break;
}
if(mark==(i/2))
{
for(h=0;h<i;h++)
{
if(h==(i-1)) printf("%c\n",x[h]);
else printf("%c",x[h]);
}
}
}
j=m;
}
}
return 0;
}
| 49 |
24,410 | int main()
{
char a[505];
int i,j,k;
gets(a);
for(i=2;i<strlen(a);i++)
for(j=0;j<=strlen(a)-i;j++)
{
for(k=0;k<i;k++)
if(a[k+j]!=a[i+j-1-k]) break;
if(k==i)
{
for(k=j;k<i+j;k++)
printf("%c",a[k]);
printf("\n");
}
}
return 0;
} | 49 |
24,411 | //???2010?11?24?
//???1000010586_???
//???????
int main()
{
int len , i , j , k , l;
char word[500];
cin >> word;
len = strlen( word );
for ( i = 1 ; i <= len / 2 ; i ++ )
{
for ( j = 0 ; j <= len - i ; j ++ )
{
for ( k = 0 ; k <= i - 1 ; k ++ )
{
if ( word[j + k] != word[j + 2 * i - 1 - k] )
break;
}
if ( k == i )
{
for ( l = 0 ; l <= 2 * i - 1 ; l ++ )
cout << word[j + l];
cout << endl;
}
}
}
return 0;
} | 49 |
24,412 | int main()
{
char s[501];
gets(s);
int i,a,b,t,l,n,j;
n=strlen(s);
for(l=1;l<n;l++)
for(i=0;i<n-l;i++)
{
a=i;b=i+l;t=0;
while(s[a]==s[b]&&a<b) {a++;b--;};
if(a>=b)
{
for(j=i;j<=i+l;j++) printf("%c",s[j]);
printf("\n");
}
}
}
| 49 |
24,413 | int main()
{
char str[500]={' '};
cin >> str;
int len=strlen(str);
int i,j,k;
int m;
float leap;
for (i=2;i<=len;i++)
{
if (i%2==0) {leap=0.5;}
else {leap=0;}
for (j=0;j<=len-i;j++)
{
m=1;
for (k=j;k<j+(i-1)/2+leap;k++)
{
if (str[k]!=str[2*j+i-1-k])
{
m=0;
break;
}
}
if (m==1)
{
for (k=j;k<=j+i-1;k++)
{
cout << str[k];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,414 | char b[10000][501];
int main()
{
char a[501];
int i, j, k, l, n, m, o = 0;
cin.getline(a, 501);
n = strlen(a);
for(i = 0; i < n - 1; i++)
for(j = i + 1; j < n; j++)
{ int flag = 1;
if(a[i] == a[j])
{ k = i;
l = j;
for(; k < l; k++, l--)
if(a[k] != a[l])
{ flag = 0;
break;
}
if(flag == 1)
{ for(m = i; m <= j; m++)
b[o][m - i] = a[m];
o++;
}
}
}
for(i = 2; i <= 500; i++)
for(j = 0; j <= o; j++)
if(strlen(b[j]) == i)
cout << b[j] << endl;
return 0;
} | 49 |
24,415 |
int main()
{
char a[501];
char *p,*t,*m;
cin>>a;
int la,i,flag=1;
la=strlen(a);
for(i=1;i<la;i++)
{
for(p=a+i;p<a+la;p++)
{
flag=1;
for(t=p-i,m=p;t<=m;t++,m--)
{
if(*t!=*m)
{
flag=0;
break;
}
}
if(flag)
{
for(t=p-i;t<=p;t++)
cout<<*t;
cout<<endl;
}
}
}
return 0;
} | 49 |
24,416 | /*
* duobianxingyouxi3.cpp
*
* Created on: 2012-12-6
* Author: w
*/
int main(){
char a[500];//?????
cin >> a;
int len=0;
len = strlen(a);//???????
int i=0,j=0,k=0,x=0;
for(i=2;i<=len;i++){//?????
for(j=0;j<len;j++){//???????
x=0;//???
if(i%2==0){//???????
for(k=j;k<=j+(i/2)-1;k++){//????????
if(a[k]!=a[2*j+i-1-k]){//???????????
x=1;
break;}
}
}
else{//??????
for(k=j;k<=j+((i-1)/2)-1;k++){
if(a[k]!=a[2*j+i-1-k]){
x=1;
break;
}
}
}
if(x==0){
for(k=j;k<=j+i-1;k++){//???????
cout << a[k];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,417 | 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 |
24,418 | int main()
{
char str[500];
int i,j,len,n,t,k;
gets(str);
len=strlen(str);
for(n=2;n<=len;n++)
{
for(i=0;i+n-1<len;i++)
{
t=i;
for(j=i+n-1;t<j;j--,t++)
{
if(str[t]!=str[j])
{
break;
}
else
if((j==t+1)||(j==t+2))
{
for(k=i;k<=i+n-1;k++)
printf("%c",str[k]);
printf("\n");
}
}
}
}
return 0;
}
| 49 |
24,419 |
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 |
24,420 | int i , l ;
char str[501];
void f(int number,int length);
int main()
{
int lenth;
gets(str);
lenth = strlen(str);
for( l = 2 ; l <= lenth - 1 ; l++)
for( i = 0 ; i <= lenth - 2 ; i ++)
{
if( i + l - 1 <= lenth)
f(i , l);
}
return 0;
}
void f(int number,int length)
{
int j ;
if(length <= 0 )
{
for(j = i ; j <= i + l - 1 ; j ++)
printf("%c", str[j]) ;
printf("\n");
}
else if( str[number] == str[number + length - 1] )
f(number + 1 , length - 2);
return;
}
| 49 |
24,421 | int main()
{
char str[500] , parlindrome[500] ;
int len ;
cin >> str ;
len = strlen(str) ;
for (int i = 2 ; i <= len ; i++)
{
for (int j = 0 ; j <= len - i ; j++)
{
int k ;
for (k = 0 ; k < i ; k++)
{
if (str[j+k] == str[j+i-1-k])
{
parlindrome[k] = str[j+k] ;
}
else
break ;
}
parlindrome[k] = '\0' ;
if (k == i)
cout << parlindrome << endl ;
}
}
return 0 ;
} | 49 |
24,422 | int main()
{
char a[500];
int i,j,h,l,b[500],k;
gets(a);
l=strlen(a)-1;
for(i=0;i<=l-1;i++)
b[i]=0;
for(i=0;i<=l-1;i++)
{
k=0;
while(a[i-k]==a[i+1+k])
{
k++;
if((i-k<0)||(i+k>l)) break;
}
b[i]=k;
}
for(j=1;j<=l/2+1;j++)
for(i=1;i<=l-2;i++)
if(b[i]>=j)
{
for(h=i-j+1;h<=i+j;h++)
printf("%c",a[h]);
printf("\n");
}
} | 49 |
24,423 | /**
* ???8.cpp
* ??????
* ???10.12.31
* ?????????
*/
void find(int,int,char *);
int main()
{
char a[500];
cin>>a;
int la;
la=strlen(a);
find(1,la,a); //???????
return 0;
}
void find(int n,int la,char a[])
{
if(2*n<=la)
{
int i,j,c,t;
for(i=0;i<la;i++)
{
t=0; //t??????????
c=0; //c??????
for(j=0;j<n;j++)
{
if(a[i-j]==a[i+1+j]) //???????
{
c++;
if(c==n)
{
t=1;
break;
}
}
else
break;
}
if(t==1)
{
for(j=i-n+1;j<i+n+1;j++) //?????????
cout<<a[j];
cout<<endl;
}
}
find(n+1,la,a); //??
}
}
| 49 |
24,424 | void main()
{
char s[500],*p1,*p2,*p;
int i,j,n;
gets (s);
n=strlen(s);
for (i=1;i<n;i++)
{
for (p1=s;*(p1+i)!='\0';p1++)
{
p2=p1+i;
for (j=0;j<i;j++)
{
if (*(p1+j)!=*(p2-j)) break;
}
if (j==i)
{
for (p=p1;p<=p2;p++)
printf("%c",*p);
printf("\n");
}
}
}
}
| 49 |
24,425 | char f1(char ch[],int left,int right)
{
if(left >= right)
{
return 1;
}
else if(ch[left] != ch[right])
{
return 0;
}
else
{
return f1(ch, left+1, right-1);
}
}
char f2(char ch[],int start,int end)
{
while(start<=end)
{
putchar(ch[start++]);
}
putchar('\n');
return '0';
}
main()
{
char ch[500];
int i,l,w;
gets(ch);
l=strlen(ch);
for(w=1;w<=l;w++)
{
for(i=0;i<l-w;i++)
{
if(f1(ch,i,i+w))
f2(ch,i,i+w);
}
}
return 0;
} | 49 |
24,426 |
char a[500];
void checkTheSame(char t[], int n)
{
int len, i, j, k, p;
len = strlen(t);
for (i = 0; i < len - n; i++)
{
j = i + n;
k = i;
while (j > k)
{
if (a[k] != a[j])
break;
k++;
j--;
}
if (j <= k)
{
for (p = i; p <= i + n; p++)
cout << t[p];
cout << endl;
}
}
}
int main()
{
int n = 1, len;
cin.getline(a, 500);
len = strlen(a);
for (n = 1; n < len; n++)
checkTheSame(a, n);
return 0;
} | 49 |
24,427 | int main()
{
char a[500];
int m,i,q,k,p,n;
for (i=0;i<500;i++)
{
scanf("%c",&a[i]);
if (a[i]=='\n')
break;
}
n=i;
for (m=2;m<=n;m++)
{
for(i=0;i<n-m+1;i++)
{
for (q=0;q<m-1;q++)
{
if(a[i+q]!=a[i+m-1-q])
p=p+1;
}
if(p==0)
{ for (k=i;k<i+m;k++)
{
printf("%c",a[k]);
}
printf("\n");
}
p=0;
}
}
return 0;
}
| 49 |
24,428 | main ()
{
char a[500];
int i, j, k, s, l, flag;
cin >> a;
l = strlen(a);
for(i = 2; i <= l; i++)
{
for (j = 0; j <= l - i; j++)
{
flag = 1;
for (k = 0; k < i / 2; k++)
{
if (a[j + k] != a[j + i - k - 1])
{
flag = 0;
break;
}
}
if(flag)
{
for (s = 0; s < i; s++)
cout << a[j + s];
cout << endl;
}
}
}
return 0;
} | 49 |
24,429 | int main()
{
char s[500];
int i,j,p,q,l,t=1;
gets(s);
l=strlen(s);
i=0;j=1;p=0;q=0;
for(j=1;j<l;j++){
for(i=0;i<=l-j;i++){
for(p=i,q=i+j;p<=q;p++,q--){
if(s[p]==s[q])t=t*1;
else t=t*0;}
if(t==1){
for(t=i;t<i+j;t++){printf("%c",s[t]);}printf("%c\n",s[i+j]);}t=1;}}} | 49 |
24,430 | //????
int main()
{
char a[500];
int i = 0, j = 0, k = 0;
cin >> a;
int l = strlen(a);
for (i = 2; i <= l; i++)
{
for (j = 0; j <= l - i; j++)
{
int flag = 1;
for (k = j; k < j + i; k++)
{
if (a[k] != a[j + i + j - k - 1])
{
flag = 0;
break;
}
}
if (flag)
{
for (k = j; k < i + j; k++)
{
cout << a[k];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,431 | main()
{
int i,j,l,k;
char a[500],b[500];
gets(a);
l=strlen(a);
for(i=2;i<=l;i++)
{
for(j=0;j<=l-i;j++)
{
strcpy(b,a);
for(k=j;k<=j+i-1;k++)
{
b[k]=a[2*j+i-1-k];
}
if(strcmp(a,b)==0){for(k=j;k<=j+i-1;k++) printf("%c",a[k]); printf("\n");}
}
}
} | 49 |
24,432 | void run(int i, char a[500])
{
int j, k, l;
char b[500], c[500];
for (j = 0; j < 500; j++)
{
b[j] = '\0';
c[j] = '\0';
}
int len = strlen(a);
for (j = 0; j <= len - i; j++)
{
for (k = 0; k < i; k++)
b[k] = a[j + k];
for (l = 0; l < i; l++)
c[l] = b[strlen(b) - l - 1];
for (k = 0; k < i; k++)
{
if (b[k] != c[k]) break;
}
if (k == i)
{
for (k = 0; k < i; k++)
cout << b[k];
cout << endl;
}
}
}
int main()
{
int i, len;
char a[500];
cin.getline(a,500);
len = strlen(a);
for(i = 2; i <= len; i++)
{
run(i,a);
}
return 0;
} | 49 |
24,433 | //***********************************
//??:??? 1200012772 *********
//??:???? *********
//??:2012?11?16? *********
int main()
{
char a[500];
cin >> a;
int i = 0, j = 0, flag = 1, k = 0;
for (j = 2; j <= strlen(a); j++)
for (i = 0;i <= (strlen(a) - j); i++)
{
for (k = i; k < (i + j); k++)
{
if(a[k] != a[i + i + j - k - 1])
{
flag = 0;
break;
}
}
if (flag)
{
for (k = i; k < (i + j); k++)
cout << a[k];
cout << endl;
}
flag = 1;
}
return 0;
}
| 49 |
24,434 | 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 |
24,435 | /*
* hwzc.cpp
*
* Created on: 2011-12-30
* Author: miaomiao
*/
int main()
{
char string[501];
cin>>string;
int length=strlen(string);
int i,j;
int k=1;
while(k<length)
{
for(i=0,j=k;j<length;i++,j++)
{
int begin=i,end=j;
while(begin<end)
{
if(string[begin]!=string[end])
break;
if(string[begin]==string[end])
{
begin++;
end--;
}
}
if(begin>=end)
{
int print=i;
for(print;print<=j;print++)
cout<<string[print];
cout<<endl;
}
}
k++;
}
return 0;
}
| 49 |
24,436 | void main()
{
char str[500],string[2][250];
int n,i,j,k;
gets(str);
n=strlen(str);
for(i=1;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(str[j]==str[j+i])
{
for(k=0;k<i+1;k++)
{
string[0][k]=str[j+k];
string[0][i+1]='\0';
}
for(k=i;k>=0;k--)
{
string[1][i-k]=str[j+k];
string[1][i+1]='\0';
}
if (strcmp(string[0],string[1])==0)
printf("%s\n",string[0]);
}
}
}
} | 49 |
24,437 | 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 |
24,438 | int main()
{
int i,j,k,l,sign;
char s[501],c[501];
scanf("%s",s);
l=strlen(s);
for(j=2;j<=l;j++)
{
for(i=0;i<=l-j;i++,k=0)
{
for(k=0,sign=0;k<j;k++)
{
c[k]=s[i+k];
if(s[i+k]==s[i+j-1-k])
{
sign++;
}
}
if(sign==j)
{
for(k=0;k<j;k++)
{
printf("%c",c[k]);
}
printf("\n");
}
}
}
return 0;
} | 49 |
24,439 | char a[max];
char b[251],c[251];
void panduan(int i)
{
int k, l;
if (2 * i > strlen(a))return;
for (int j = 0; 2 * i + j <= strlen(a); j++)
{
for ( k = 0; k < i; k++)b[k] = a[j + k];
b[k] = '\0';
for (l = 0; l < i; l++)c[l] = a[j + i * 2 - 1 - l];
c[l] = '\0';
if (strcmp(b, c) == 0){
cout << b;
for (int x = strlen(c) - 1; x >= 0; x--)cout << c[x];
cout << endl;
}
}
panduan(i + 1);
}
int main()
{
cin >> a;
panduan(1);
} | 49 |
24,440 |
int ishuiwen(char p[],int x)
{
int j,result=0;
char q[505]={""};
for(j=0;j<x;j++)
q[j]=p[x-j-1];
if(strcmp(p,q)==0)
result=1;
return result;
}
int main()
{
char a[505],b[505]={""};
int i,len,j,k;
gets(a);
len=strlen(a);
for(i=2;i<=len;i++)
for(j=0;j<len+1-i;j++)
{
for(k=0;k<i;k++)
b[k]=a[k+j];
if(ishuiwen(b,i))
printf("%s\n",b);
}
return 0;
} | 49 |
24,441 | 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;
}
osubstr(char s[],int start,int end)
{
while(start<=end)
{
putchar(s[start++]);
}
putchar('\n');
}
int main()
{
char s[500];
int m,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);
}
}
}
| 49 |
24,442 |
void revchk(char *a,int l)//????????????
{
int i,j=0;
for(i=0;i<=l-1;i++)
if(a[i]!=a[l-1-i])//???????
j=1;
if(j==0)
{
for(i=0;i<=l-1;i++)//???????
cout<<a[i];
cout<<endl;
}
}
int main()
{
int m,n;
char b[500];
cin.getline(b,500);//??
for(m=2;m<=(int)strlen(b);m++)//??2-strlen
for(n=0;n<=(int)strlen(b)-m;n++)//??????m?
revchk(&b[n],m);
return 0;
} | 49 |
24,443 | void main()
{
int i,j,k,p,q,l,m,n;
char a[500];
gets(a);
l=strlen(a);
for(k=0;k<l-1;k++)
{
if(a[k]==a[k+1])
printf("%c%c\n",a[k],a[k+1]);
}
for(i=2;i<l;i++)
{
for(k=0;k<l;k++)
{
p=k;q=i+k;
m=p;n=q;
while(a[p]==a[q]&&p<=q)
{
p++;
q--;
}
if(q-p<1)
{
for(j=m;j<n;j++)
printf("%c",a[j]);
printf("%c\n",a[n]);
}
}
}
}
| 49 |
24,444 | 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 |
24,445 | /*
*8-4
*??? 1200012851
*????
*2012.11.13
**/
int main()
{
char str[500];
int i, j, m, k, t, len, flag = 1;
cin.getline(str, 500);
len = strlen(str);
for (i = 2; i <= len; i++)
{
for (m = 0; m <= len - i; m++)
{
flag = 1;
if (str[m] != str[m + i - 1])
{
continue;
}
else
{
k = m + 1;
t = m + i - 2;
while (k < t)
{
if (str[k] != str[t])
{
flag = 0;
}
k++;
t--;
}
if (flag)
{
for (j = m; j <= m + i - 1; j++)
{
cout << str[j];
}
cout << endl;
}
}
}
}
return 0;
}
| 49 |
24,446 | 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,447 | //* * * * * * * * * * * * * * * * * * * * * * * *
//*???????? *
//*????????.cpp *
//*????? 1000012839 *
//*???2010.11.25 *
//* * * * * * * * * * * * * * * * * * * * * * * *
int main()
{
char a[500]; // ???????
int len[5000], x[5000], y[5000]; // ????len??????????????x,y?????????????????
int i, j, k, l, m, n, flag, count = 0; // ????i, j, k, m, n,?????l???flag???????count?
cin >> a;
l = strlen(a); // ?????
for (i = 0; i < l; i++)
{
for (j = l - 1; j > i; j--)
{
m = i;
n = j;
if (a[m] == a[n]) // ?????????????????
{
flag = 1;
while (n >= m)
{
if (a[n--] != a[m++])
{
flag = 0;
break; // ??????flag??0????
}
}
if (flag) // flag?1????????
{
len[count] = j - i + 1; // ???????
x[count] = i;
y[count] = j; // ???????
count++; // ???1?
}
}
}
}
for (j = 2; j <= l; j++)
{
for (i = 0; i < count; i++)
{
if (len[i] == j) // j???????????????????
{
for (k = x[i]; k <= y[i]; k++)
cout << a[k]; // ???????
cout << endl; // ????????
}
}
}
return 0;
}
| 49 |
24,448 | int main()
{
char a[501],b[501];
int i,j,k,n,q,p,s;
scanf("%s",a);
n=strlen(a);
for(i=2;i<=n;i++)
{
for(j=0;j<n-i+1;j++)
{
for(k=0;k<i;k++)
{
b[k]=a[j+k];
}
for(q=0,s=0;q<=(i-2)/2;q++)
{
if(b[q]!=b[i-1-q])s=1;
}
b[i]='\0';
if(s==0)printf("%s\n",b);
}
}
return 0;
} | 49 |
24,449 | int t,i;
char a[100];
char b[10000][100];
void f(int x)
{int u=1;
int tt=strlen(b[x]);
for(int q=0;q<tt;q++)
{if(b[x][q]!=b[x][tt-q-1])
{u=0;break;}
}if(u==1)cout<<b[x]<<endl;
return;
}
int main()
{int num=0;
cin>>a;
t=strlen(a);
for(int j=2;j<=t;j++)
{for(i=0;i<t-j+1;i++)
{num++;
for(int k=0;k<j;k++)
{
b[num][k]=a[i+k];
}f(num);
}
}
return 0;
}
| 49 |
24,450 | int main()
{int m,n,i,j,sig=0,k,kk;
char s[502];
char *p=s;
scanf("%s",s);
n=strlen(s);
for(i=2;i<=n;i++)
{for(k=0;k<=n-i;k++)
{
for(j=0;j<=i-1;j++)
{if(*(p+j)!=*(p+i-j-1))
{sig=1;break;}
}
if(sig==0)
{for(kk=0;kk<=i-1;kk++)
{printf("%c",*(p+kk));
}
printf("\n");
}
sig=0;
p=p+1;
}
p=s;
}
return 0;
} | 49 |
24,451 | /***************************************************************************
*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 |
24,452 | void f(char a[500])
{
int i,j,k,m,n,flag = 1,c;
cin >> a;
int b = strlen(a);
for (j = 2;j <= b ;j++)
for (i = 0;i + j <= b;i++)
{c = 1;
for (m = i,n = i + j - 1;m < n;m++,n--)
{
if (a[m] != a[n])
{
c = 0;
break;
}
}
if (c)
{
if (flag)
{
flag = 0;
for (k = i;k < i + j;k++)
cout << a[k];
}
else
{
cout <<endl;
for (k = i;k < i + j;k++)
cout << a[k];
}
}
}
}
int main ()
{
char a[500];
f(a);
return 0;
} | 49 |
24,453 |
int find(char *a, int n)
{
int i,j,t,k;
for(i=0;a[i]!='\0';i++)
{
t=1;
if(a[i]==a[i+n-1])
{
j=i+1;k=i+n-2;
do
{
if(a[j]==a[k]){j++;k--;t++;}
else break;
}
while(k>=j);
if(t==n/2||t==n/2+1)
{
for(j=i;j<=i+n-1;j++) printf("%c",a[j]);
printf("\n");
}
}
}
}
main()
{
char a[501];
int l,i;
gets(a);
l=strlen(a);
for(i=2;i<=l;i++)
find(a,i);
} | 49 |
24,454 | int main()
{
char str[530];
int i,j, lng, len, h, k;
cin >> str;
len = strlen(str);
for (lng = 2; lng <= len; lng++)
for(h = 0; h < len; h++)
{
i = h;
j = h + lng - 1;
while (i < j)
{
if(str[i] != str[j])
break;
i++;
j--;
}
if(i == j || i > j)
{
for (k = 0; k < lng - 1; k++)
cout << str[h + k];
cout << str[h + k] << endl;
}
}
return 0;
} | 49 |
24,455 | int main()
{
char a[501];
int i, num = 0, j, z, m;
cin >> a;
for (i = 0; a[i] != '\0'; i++)
num++;
for (i = 2; i <= num; i++)
{
for (j = 0; j <= num - i + 1; j++)
{
if (i % 2 == 0)
{
for (z = j; z <= j + i / 2 - 1; z++)
{
m = j + i - 1 - z + j;
if (a[z] != a[m])
break;
}
if (z == j + i / 2)
{
for (z = j; z <= j + i - 1; z++)
cout << a[z];
cout << endl;
}
}
if (i % 2 == 1)
{
for (z = j; z <= j + (i - 1)/ 2 - 1; z++)
{
m = j + i - 1 - z + j;
if (a[z] != a[m])
break;
}
if (z == j + (i - 1)/ 2)
{
for (z = j; z <= j + i - 1; z++)
cout << a[z];
cout << endl;
}
}
}
}
return 0;
}
| 49 |
24,456 | /*
* 12-6huiwen.cpp
*
* Created on: 2011-12-30
* Author: Dai Guangda
*/
int main()
{
char a[501];
int start,end,zlen,i,j,len;
cin >>a;
len = strlen(a);
for (zlen=2; zlen<=len; zlen++)
{
for (start=0; start<=len-zlen; start++)
{
end = start+zlen-1;
i=start; j=end;
while (a[i]==a[j] && i<j)
{
i++;
j--;
}
if (i>=j)
{
for(i=start; i<=end; i++)
cout <<a[i];
cout <<endl;
}
}
}
return 0;
}
| 49 |
24,457 | int main()
{
char x[500]={"0"};
int length,i,j,m,t,w;
scanf("%s",x);
length=strlen(x);
for(i=2;i<=length;i++)
{
for(j=0;j+i-1<length;j++)
{
m=0;
for(t=0;t<i/2;t++)
{
if(x[j+t]!=x[i+j-1-t])
m=1;
}
if(m==0)
{
for(w=j;w<=i+j-1;w++)
{
printf("%c",x[w]);
}
printf("\n");
}
}
}
return 0;
} | 49 |
24,458 | int main()
{
char a[500],b[500];
cin>>a;
int s=0;
for (int i=0;i<500;i++)
if (a[i]=='\0')
break;
else
s++;
for (int j=2;j<=s;j++)
for (int i=0;i<s;i++)
{
char b[j];
for (int k=i;k<i+j;k++)
b[k]=a[2*i+j-1-k];
for (int m=i;m<i+j;m++)
{
if(a[m]!=b[m])
break;
if (a[m]==b[m]&&m==i+j-1)
{for (int p=i;p<i+j;p++)
cout<<a[p];
cout<<endl;
}
}
}
return 0;
}
| 49 |
24,459 | int main()
{
char str[600];
cin>>str;
int i,j,k,l;
int n=strlen(str);
for(i=2;i<=n;i++)
{
for(j=0;j<=n-i;j++)
{
int flag=1;
for(k=j,l=k+i-1;k<=(j+(i-1)/2);k++,l--)
{
if(str[k]!=str[l])
{
flag=0;
break;
}
}
if(flag==1)
{
for(k=j;k<j+i;k++)
{
cout<<str[k];
}
cout<<endl;
}
}
}
return 0;
} | 49 |
24,460 | void main()
{
char a[505];
int i,j,k,count;
gets(a);
for(i=2;i<=strlen(a);i++)
for(j=0;(j+i)<=strlen(a);j++)
{
count=0;
for(k=0;k<(i/2);k++)
if(a[j+k]==a[j+i-1-k]) count++;
if(count==i/2)
{
for(k=j;k<j+i;k++)
printf("%c",a[k]);
printf("\n");
}
}
}
| 49 |
24,461 | char a[100],sub[1000][100];
int l,sublen,cnt=0;
void jud(char t[100])
{
int i,j,k;
char s1[50],s2[50];
memset(s1,'\0',sizeof(s1));
memset(s2,'\0',sizeof(s2));
if (strlen(t)%2==1)
{
for (i=strlen(t)/2-1;i>=0;i--)
{
s1[strlen(t)/2-1-i]=t[i];
}
for (i=strlen(t)/2+1;i<strlen(t);i++)
{
s2[i-strlen(t)/2-1]=t[i];
}
}
else
{
for (i=strlen(t)/2-1;i>=0;i--)
{
s1[strlen(t)/2-1-i]=t[i];
}
for (i=strlen(t)/2;i<strlen(t);i++)
{
s2[i-strlen(t)/2]=t[i];
}
}
for (i=1;i<=cnt;i++)
{
if (strcmp(sub[i],t)==0||strlen(t)==1)
break;
else
{
if (strcmp(s1,s2)==0)
cout<<t<<endl;
break;
}
}
}
void fen(int sl)
{
int i,j;
for (i=0;i<=l-sl;i++)
{
cnt++;
for (j=0;j<sl;j++)
{
sub[cnt][j]=a[i+j];
}
}
}
void d()
{
int i;
l=strlen(a);
memset(sub,'\0',sizeof(sub));
for (sublen=2;sublen<=l;sublen++)
{
fen(sublen);
}
for (i=1;i<=cnt;i++)
{
jud(sub[i]);
}
}
int main()
{
cin>>a;
d();
return 0;
} | 49 |
24,462 | /*
* fuxi001_huiwen_zichuan.cpp
* name:????
* Created on: 2011-12-21
* Author: zhujile
*/
void check(char *p,char *q)
{
int flag=1; //??
char *st=p,*en=q;
for (;st<en;st++,en--) //??????
{
if (*st==*en) continue;
else {flag=0;break;} //???????
}
if (flag==1) //?????????
{
while(p<=q) //??
{
cout<<*p;
p++;
}
cout<<endl;
}
}
int main(){
char a[501];
cin.getline(a,501); //??
char *p,*q;
int length,k;
length=strlen(a); //????
for (k=1;k<length;k++) //??????
{
p=a;
q=a+k;
for (;q<a+length;p++,q++)
{
if (*p==*q) //???????
check(p,q); //??
}
}
return 0;
}
| 49 |
24,463 | int main()
{
int i, j, k;
int nhuiwen, len;
char str[500];
cin >> str;
len = strlen(str);
for (nhuiwen = 2; nhuiwen <= len; nhuiwen ++)
{
char buf1[500] = {'\0'}, buf2[500] = {'\0'};
for (i = 0; i + nhuiwen - 1 < len; i ++)
{
int n = nhuiwen, m = 0;
for (j = i; j <= i + nhuiwen - 1; j ++)
{
buf1[-- n] = str[j];
buf2[m ++] = str[j];
}
//cout << "n = " << n << endl << "m = " << m << endl;
buf1[nhuiwen] = '\0'; buf2[nhuiwen] = '\0';
if (strcmp(buf1, buf2) == 0)
{
for (k = 0; k < nhuiwen; k ++)
cout << buf1[k];
cout << endl;
}
}
}
return 0;
} | 49 |
24,464 | char str[510];
int flag[510]={0};
int check( int head, int n )
{
if(n==0)
return 1;
if(n==-1)
return 1;
if(str[head]==str[head+n])
{
return check(head+1,n-2);
}
else return 0;
}
int main()
{
int len, i, m=1, k;
cin.getline( str , 500 );
len = strlen(str);
for(m=1; m<len; m++)
{
for(i=0; i<=len-m; i++)
{
if(check(i,m)==1)
{
for(k=i;k<=i+m;k++)
{
cout<<str[k];
}
cout<<endl;
}
}
}
return 0;
}
| 49 |
24,465 | int main()
{
char a[501], b[501];
char c;
int i, l, j, k, m, q, n = 0, p;
cin.getline(a, 501);
l = strlen(a);
for (i = 0; i < l; i++)
b[l - 1 - i] = a[i];
for (j = 2; j <= l; j++)
{
for (m = 0; m <= l - j; m++)
{
n = 0;
p = m;
q = l - p - j;
for (k = 1; k <= j; k++)
{
if (a[p] == b[q])
{
p++;
q++;
n++;
}
else
break;
}
if (n == j)
{
i = 0;
while(i < n)
{
cout << a[m + i];
i++;
}
cout << endl;
}
}
}
return 0;
} | 49 |
24,466 | //*******************************************************
//*11.11?? ???? *
//*????? ?? 1100012844 *
//*???2011?11?11? *
//*******************************************************
void huiwen(char a[]) // ???huiwei??
{
int i, j, n, sum; // n????????
for (n = 2; n <= strlen(a); n++) // n???2
{
// j????n????????????
for (j = 0; j <= strlen(a) - n; j++)
{
sum = n + 2 * j - 1; // ??????????
for (i = j; i <= j + n / 2; i++) // ???????
{
if (a[i] != a[sum - i]) // ??????
break;
}
// ???????????????n???????
if (i == j + n / 2 + 1)
{
// ?????????
for (i = j; i <= n + j - 1; i++)
cout << a[i];
cout << endl;
}
}
}
}
int main()
{
char str[501];
cin >> str;
huiwen(str); // ????
return 0;
} | 49 |
24,467 | 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 |
24,468 | 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 |
24,469 | 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 |
24,470 | int max(int a,int b);
int main()
{
char a[500],b[250][500],p;
int n,m,i,j,k,l[250],s,t=0;
cin.getline(a,500);
n=strlen(a);
for(i=0;i<n-1;i++)
for(j=0;i>=j&&a[i-j]==a[i+1+j];j++)
{
for(k=i-j;k<=i+j+1;k++)
{
b[t][k-i+j]=a[k];
}
l[t]=2*(j+1);
t++;
}
for(i=0;i<n-2;i++)
for(j=0;i>=j&&a[i-j]==a[i+2+j];j++)
{
for(k=i-j;k<=i+j+2;k++)
{
b[t][k-i+j]=a[k];
}
l[t]=2*(j+1)+1;
t++;
}
m=t;
for(i=0;i<m-1;i++)
for(j=0;j<m-1;j++)
if(l[j]>l[j+1])
{
for(k=0;k<max(l[j],l[j+1]);k++)
{
p=b[j][k];
b[j][k]=b[j+1][k];
b[j+1][k]=p;
}
s=l[j];
l[j]=l[j+1];
l[j+1]=s;
}
for(i=0;i<m;i++)
{
for(j=0;j<l[i];j++)
cout<<b[i][j];
cout<<endl;
}
return 0;
}
int max(int a,int b)
{
if(a<b)
return b;
else
return a;
} | 49 |
24,471 | //********************************
//*??????? **
//*?????? **
//*???2012.11.10 **
//*******************************/
int main ()
{
char str[500];
int i, j, k, length, flag = 0;
cin >> str;
length = strlen(str);
for (i = 1; i <= length -1; i++)
{
for (j = 0; j < length - i; j++)
{
if (str[j] == str[j + i])
{
for (k = 0; k <= (i / 2); k++)
{
if (str[j + k] != str[i + j - k])
{
flag = 1;
break;
}
}
for (k = j; (k <= j + i) && (flag == 0); k++)
cout << str[k];
if (flag == 1)
flag = 0;
else
cout << endl;
}
}
}
return 0;
}
| 49 |
24,472 | void main()
{char s[501];
int i,j,n,l,f; scanf("%s",s);l=strlen(s);
for(n=2;n<=l;n++)
{for(i=0;i<=l-n+1;i++)
{f=0;for(j=i;j<=(2*i-1+n)/2;j++){if(s[j]!=s[2*i-1+n-j]) {f=1;break;}}
if(f==1) continue;
else{for(j=i;j<=i-1+n;j++) printf("%c",s[j]);printf("\n");}
}
}
}
| 49 |
24,473 | void strre(char a[])
{
int i,j,k;
char t;
k=strlen(a);
for(j=0,i=k-1;j<k/2;j++,i--)
{
t=a[j];
a[j]=a[i];
a[i]=t;
}
}
void main()
{
int i,j,k=0,t;
char a[600],b[500][500],c[500],d[500];
gets(a);
t=strlen(a);
for(i=0;i<t-2;i++)
for(j=i+1;j<t;j++)
{
strncpy(c,a+i,j-i+1);
c[j-i+1]='\0';
strcpy(d,c);
strre(d);
if(!strcmp(c,d))
{
strcpy(b[k],c);
k++;
}
strcpy(b[k],"\0");
}
for(i=0;i<k-1;i++)
for(j=0;j<k-i-1;j++)
{
if(strlen(b[j])>strlen(b[j+1]))
{
strcpy(c,b[j]);
strcpy(b[j],b[j+1]);
strcpy(b[j+1],c);
}
}
for(i=0;i<k;i++)
printf("%s\n",b[i]);
} | 49 |
24,474 | 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 |
24,475 |
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 |
24,476 | int main()
{
char a[500];
gets(a);
int i,j,n,k,t,m;
n=strlen(a);
for(i=1;i<n;i++)
{
for(j=0;j<n;j++)
{
t=j+i;m=0;
if(t>n-1) break;
t=(t+j)/2;
for(k=j;k<=t;k++)
{
if(a[k]!=a[2*j+i-k]) {m=1;break;}
}
if(m==0)
{for(k=j;k<=j+i;k++)
{
printf("%c",a[k]);
}
printf("\n");
}}
}
}
| 49 |
24,477 | /*
* 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 |
24,478 | int main()
{
char str[500];
int j,p=2,len,flag,m;
gets(str);
len=strlen(str);
for(m=0;m<len;m++)
{
for(j=0;(j<len-m)&&(j>=0);j++)
{
flag=1;
if(str[j]==str[j+m+1])
{
if(j+1==j+m+1)
printf("%c%c\n",str[j],str[j+1]);
else
{
for(p=1;p<=m/2;p++)
{
if(str[j+p]==str[j+m+1-p])
flag*=1;
else
flag*=0;
}
if(flag==1)
{
for(p=j;p<=j+m+1;p++)
printf("%c",str[p]);
printf("\n");
}
}
}
}
}
return 0;
}
| 49 |
24,479 | void main()
{
char a[100];
int l,i,j,k,len,flag;
scanf("%s",a);
len=strlen(a);
for (l=2;l<len;l+=2)
{
for(i=0;i<len;i++)
{
for(j=0;j<l/2;j++)
{
if(a[i+j]==a[i+l-1-j]) flag=1;
else
{
flag=0;
break;}
}
if (flag==1)
{
for(k=i;k<i+l;k++)
printf("%c",a[k]);
printf("\n");
}
}
}
}
// abcddcbaab | 49 |
24,480 |
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 |
24,481 | //***********************
//??????**
//???4.cpp**
//???2012.11.16**
//***********************
int main ()
{
int i, j, n, k;
char a[500];
cin >> a;
n = strlen(a);
for (i = 2; i <= n; i ++)
{
for (j = 0; j <= n - i; j ++)
{
for (k = j; k <= j + i / 2; k ++)
{
if (a[k] == a[i + 2 * j - 1 - k])
continue;
else
break;
}
if (k > j + i / 2)
{
for (k = j; k < j + i; k++)
cout << a[k];
cout << endl;
}
}
}
return 0;
}
| 49 |
24,482 | /*
* huiwenxulie.cpp
*
* Created on: 2011-12-21
* Author: Administrator
*/
int main()
{
char p[501];
cin.getline(p,501);
int n=strlen(p);
for(int k=2;k<=n;k++)
{int i=0;
int j;
for(;i<=n-k;i++)
{
j=i+k-1;
int c=i,d=j;
while(i<j)
{
if(p[i]==p[j])
{
i++;j--;
}
else{break;}
if(i>=j)
{
for(int s=c;s<=d;s++)
{
cout<<p[s];
}
cout<<endl;
}
}i=c;
}
}
return 0;
}
| 49 |
24,483 | 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 |
24,484 | int main()
{
char a[600];
scanf("%s",a);
int L;
int t;
L=strlen(a);
int i,j,k,p;
for(i=2;i<=L;i++)
{
if(i%2==0)
{
for(j=i/2-1;j<=L-i/2;j++)
{ t=0;
for(k=0;k<i/2;k++)
{
if(a[j-k]!=a[j+k+1])
{ t=1;
break;}
}
if(t==0)
{for(p=j-i/2+1;p<=j+i/2;p++)
printf("%c",a[p]);
printf("\n");
}
}
}
}
return 0;
}
| 49 |
24,485 | int main()
{
char str[501];
int l,length,i,j,k,p,start,end;
scanf("%s",str);
length=strlen(str);
for(i=0;i+1<length;i++)
if(str[i]==str[i+1])
printf("%c%c\n",str[i],str[i+1]);//??????2?????
for(l=3;l<=length;l++)//l??????????
{
for(i=0;i+l-1<length;i++)//i????????????
{
start=i;end=i+l-1;//????????
j=i+l-1;
k=i;
while(k<=j)
{
if(str[k]==str[j])
{
k++;
j--;
}
else break;//????????????????
}
if(((l%2==0)&&(k-1==j))||((l%2==1)&&(k-1==j+1)))//??k?j??
for(p=start;p<=end;p++)
printf("%c",str[p]);
printf("\n");
}
}
return 0;
}
| 49 |
24,486 | 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 |
24,487 | int main()
{
char s[550]={0};
int i,num,j,k;
for(i=0;i<550;i++)
{
scanf("%c", &s[i]);
if(s[i]=='\n')
{
s[i]=0;
num=i-1;
break;
}
}
char *p1,*p2;
for(i=2;i<=num+1;i++)
{
p1=(char *)malloc(sizeof(char)*(i+1));
p2=(char *)malloc(sizeof(char)*(i+1));
for(j=0;j<=num+1-i;j++)
{
for(k=j;k<=j+i-1;k++)
{
*(p1+k-j)=s[k];
*(p2+k-j)=s[j+j+i-1-k];
}
*(p1+i)='\0';
*(p2+i)='\0';
if(strcmp(p1,p2)==0) printf("%s\n", p1);
}
free(p1);
free(p2);
}
return 0;
}
| 49 |
24,488 | 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 |
24,489 | char s[600];
int main()
{
int comp(int sta,int lenx);
int i,j,len,p;
gets(s);
len=strlen(s);
for (i=2; i<=len; i++)
for (j=0; j<=len-i; j++)
if (comp(j,i)==1) {
for (p=j; p<=j+i-1; p++) printf("%c",s[p]);
printf("\n");
}
return 0;
}
int comp(int sta,int lenx)
{
int i,j;
for (i=1; i<=lenx/2; i++) if (s[sta+i-1]!=s[sta+lenx-i]) return (0);
return (1);
} | 49 |
24,490 | int main()
{
int n;/*??????*/
char c[501];
gets(c);
n=strlen(c);
int i;
int j;/*j???????????*/
int k;
int x;
int m;/*????????????+1*/
int t;/*?????*/
int q;/*q???????????*/
int p;/*p???????????*/
int y;/*?????????*/
for(i=2;i<=n;i++)/*?1??????n???*//*????? 1??????*/
{
m=n-i+1;
for(j=0;j<m;j++)/*????????????????????*/
{
y=0;
q=i/2+j;
p=j+i-1;
for(k=j;k<q;k++)
{
if(c[k]==c[p-k+j])
y++;
}
if(y==i/2)
{
for(x=j;x<=p;x++)
printf("%c",c[x]);
printf("\n");
}
}
}
return 0;
} | 49 |
24,491 | /**
* @file homework.cpp
* @author ???
* @date 2012-11-12
* @description
* ??????: ????
*/
int main()
{
char sen[500];
int num[500], dis[500], maxdis = 0, k = 1;
int i, j;
cin >> sen;
int n = 0;
for (i = 0; i <= strlen(sen); i++)
{
if (sen[i] == sen[i+1]) // ????????????????????
{
n = n + 1;
num[n] = i;
for (j = 1; j <= i; j++)
{
if(sen[i - j] != sen[i + 1 + j])
break; // ?????????????
}
dis[n] = j; // ???????
if (dis[n] > maxdis)
maxdis = dis[n]; // ????????????
}
else
continue;
}
do
{
// ????2????????????????????
//??????????????????????????????????????????????????????????????dis????
for (i = 1; i <= n; i++)
{
if (dis[i] >= k)
{
for (j = num[i] + 1 - k; j <= num[i] + k - 1; j++)
cout << sen[j];
cout << sen[j] << endl; // ???????????????
}
}
k = k + 1;
} while (k <= maxdis);
return 0;
} | 49 |
24,492 |
void check_palin(char str[], int begin, int end)
{
int i, palin = 1;
for (i = begin; i <= end; i ++)
if (str[i] != str[begin + end - i]) palin = 0;
if (palin)
{
for (i = begin; i <= end; i ++)
cout << str[i];
cout << endl;
}
}
int main()
{
char str[500 + 10];
int i, j, k;
cin.getline(str, 501);
for (j = 2; j <= strlen(str); j ++)
for (i = 0; i < strlen(str); i ++)
check_palin(str, i , i + j - 1);
return 0;
} | 49 |
24,493 | 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 |
24,494 |
int main()
{
char s[501];
int i, j, t;
cin.getline(s,501);
int l = strlen(s);
for (i = 2;i <= l ;i++)
{
for (j = 0;j <= l - i;j++)
{
for (t = j;t <= j + i / 2 - 1 ;t++)
{
if (s[t] != s[2 * j + i - 1 - t])
break;
}
if (t == j + i / 2 )
{
for (int k = j;k <= j + i - 1;k++)
{
cout << s[k];
}
cout << endl;
}
}
}
return 0;
}
| 49 |
24,495 | 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 |
24,496 | char a[1000];
void judge(int left,int right)
{
for (int i=left;i<=right;i++)
{
if (a[i]!=a[right+left-i])
return ;
}
for (int i=left;i<=right;i++)
{
cout<<a[i];
}
cout<<endl;
return;
}
int main()
{
cin.getline(a,1000);
int len=strlen(a);
for (int j=1;j<=len-1;j++)
{
for (int i=0;i<len-1;i++)
{
if (i+j<=len-1)
{judge(i,i+j);
}
}
}
return 0;}
| 49 |
24,497 | void main()
{
char s[500];
unsigned int i,j,flag=0;
char *p;
scanf("%s",s);
for(i=2;i<=strlen(s);i++)
{
for(p=s;*(p+i-1)!='\0';p++)
{
flag=0;
for(j=0;j<i/2;j++)
{
if(*(p+j)!=*(p+i-1-j))
flag=1;
}
if(flag==0)
{
for(j=0;j<i;j++)
putchar(*(p+j));
printf("\n");
}
}
}
} | 49 |
24,498 | int main()
{
char str[505]={'\0'};
char str1[505]={'\0'};
char str2[505]={'\0'};
int length,i,j,k,p;
cin.getline(str,505);
length=strlen(str);
for(i=2;i<=length;i++)//i??????????????
for(j=0;j<=length-i;j++)//j???????????????
{
p=0;
for(k=j;k<j+i;k++)//??????i?????????
{
str1[p]=str[k];
str2[p]=str[j+i-1-(k-j)];
p++;
}
if(strcmp(str1,str2)==0)
{
k=0;
while(str1[k]!='\0')
{
cout<<str1[k];
k++;
}
cout<<endl;
}
}
return 0;
} | 49 |
24,499 |
main()
{
char c[500];
int l,n,i,j,s,p;
n=0;
gets(c);
for(i=0;c[i]!='\0';i++)
n++;
for(l=2;l<=n;l++)
{
for(i=0;i<=n;i++)
{
s=0;
for(j=i;j<=(i+l-1);j++)
{
if(c[j]==c[l+2*i-j-1])
s++;}
if(s==l)
{for(j=i;j<=i+l-1;j++)
printf("%c",c[j]);
printf("\n");}
}
}
}
| 49 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.