label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
49 | 24100 | int main()
{
char str[503];
int i, j, k, p, m, l;
cin >> str;
l=strlen(str);
for (m=2;m<=l;m=m+2)
{
for (i=0;str[i+1]!='\0';i++)
{
j=i;
p=i+1;
while (str[j]==str[p]&&j>=0&&str[p]!='\0')
{
j--;
p++;
if ( p!=(i+1) && ((p-j-1)==m) )
{
for (k=j+1;k<p;k++)
cout << str[k];
cout << endl;
}
}
}
}
for (i=1;str[i]!='\0';i++)
{
j=i-1;
p=i+1;
while (str[j]==str[p]&&j>=0&&str[p]!='\0')
{
j--;
p++;
}
if (p!=(i+1))
{
for (k=j+1;k<p;k++)
cout << str[k];
cout << endl;
}
}
return 0;
}
|
49 | 24101 | 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 | 24102 | int main()
{char str[550];
cin.getline(str,501);
int length=strlen(str);
for(int i=2;i<=length;i++)
for(int j=0;j<=length-i;j++)
{int flag=1;
for(int k=0;flag&&k<i/2;k++)
if(str[j+k]!=str[j+i-1-k])
flag=0;
if(flag)
{for(int k=0;k<i;k++)
cout<<str[j+k];
cout<<endl;
}
}
return 0;
}
|
49 | 24103 | 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 | 24104 | 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 | 24105 | void main()
{
char s[501];
int i,j,k,x;
int count=0;
int flag=0;
gets(s);
for (i=2;i<=strlen(s);i++)
{
for(j=0;(j+i)<=strlen(s);j++)
{
count=0;flag=0;
for(k=0;k<(i/2);k++)
{
if (s[j+k]==s[j+i-k-1]) count++;
}
if(count==i/2)
{
for(k=0;k<i;k++)
printf("%c",s[j+k]);
printf("\n");
}
}
}
} |
49 | 24106 | 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');
}
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);
} |
49 | 24107 | //****************************************
//*???? **
//*??? 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 | 24108 | int main()
{
char *p;
p=(char *)malloc(sizeof(char)*500);
gets(p);
int i,j,k,flag;
for(j=1;j<strlen(p);j++)
for(i=0;i<strlen(p)-1;i++)
{flag=1;
if(i+j<=strlen(p)){
for(k=0;k<j/2+1;k++)
if(*(p+i+k)!=*(p+i+j-k))
{flag=0;break;}
if(flag)
{for(k=i;k<=i+j;k++)
printf("%c",*(p+k));
printf("\n");} }
}
} |
49 | 24109 |
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 | 24110 | /*
* 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 | 24111 | /*
* 0.cpp
*
* Created on: 2011-12-30
* Author: Alfalfa
*/
int main() {
char string[500];
cin>>string;
int len=strlen(string);
int i,j,k=1;
while(k<len){
for(i=0,j=k; j<len; i++,j++){
int begin=i,end=j;
while(begin<end){
if(string[begin]!=string[end]) break;
else{
begin++;
end--;
}
}
if(begin>=end){
int print=i;
for(print; print<=j; print++)
cout<<string[print];
cout<<endl;
}
}
k++;
}
}
|
49 | 24112 | 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 | 24113 | int main()
{
char s[500];
int len,len0,m,n,i,j,f=0;
gets(s);
len0=strlen(s);
for(len=2;len<=len0;len++){
for(i=0;i<len0-len+1;i++){
j=i+len-1;m=i;n=j;
while(s[m]==s[n] && m<=i+len/2-1){
m++;n--;}
if(m==i+len/2){
for(m=i;m<=j;m++)
printf("%c",s[m]);
printf("\n");
}
}
}
return 0;
} |
49 | 24114 | 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 | 24115 | 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 | 24116 |
/*
* homework3.cpp
*
* Created on: 2012-12-4
* Author: Lixurong
*/
int main()
{
char a[1002];
cin >> a;
for( int i=2; i<=strlen(a); i++ )
{
for( int j=0; j<=strlen(a)-i; j++ )
{
int p=0;
for( int x=0; x<i; x++ )
{
if(a[j+x]!=a[j+i-x-1])
{
p=1;
break;
}
}
if(p==0)
{
for( int x=j; x<j+i; x++ )
{
cout << a[x];
}
cout << endl;
}
}
}
}
|
49 | 24117 | void main()
{
char *s;
int i,n,j,k,m=0,p,**x,y=0,z=0,min,q,a;
x=(int **)malloc(100*sizeof(int*));
for(y=0;y<100;y++)*(x+y)=(int *)malloc(3*sizeof(int));
y=0;
s=(char *)malloc(500*sizeof(char));
gets(s);
n=strlen(s);
for(i=0;i<n;i++)
{m=1;
for(j=i+1;j<n;j++)
if(*(s+i)==*(s+j)){m=0;for(k=i+1;k<=j-1;k++){if(*(s+k)==*(s+j-k+i))m=0;else m=1;}
if(m==0){*(*(x+y))=i;*(*(x+y)+1)=j;*(*(x+y)+2)=j-i;y++;}}
}
for(a=0;a<y;a++)
{min=501;
for(z=0;z<y;z++)
{
if(*(*(x+z)+2)<min){min=*(*(x+z)+2);q=z;}
}
for(p=*(*(x+q)+0);p<=*(*(x+q)+1);p++)
printf("%c",*(s+p));printf("\n");*(*(x+q)+2)=501;
}
} |
49 | 24118 | 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 | 24119 | 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 | 24120 | int check(char c[])
{
int len,i;
char d[1000];
len=strlen(c);
for(i=0;i<len;i++)
*(d+i)=*(c+len-i-1);
*(d+len)='\0';
if(strcmp(c,d)==0)
return 1;
else
return 0;
}
int main()
{
char a[1000];
char b[1000];
int i,j,k,len,m;
scanf("%s",a);
len=strlen(a);
for(i=2;i<=len;i++)
{
for(j=0;j<=len-i;j++)
{
for(m=0;m<i;m++)
*(b+m)=*(a+j+m);
b[i]='\0';
if(check(b))
printf("%s\n",b);
}
}
return 0;
} |
49 | 24121 | //*************************************************
//* 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 | 24122 | 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 | 24123 | //******************************************
//*??????? **
//*?????? 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 | 24124 | /*
* ????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 | 24125 | void main()
{
char str[1000];
int a,b,c,d,e,f,i,j,k,l0,l;
gets(str);
l0=strlen(str);
for(l=2;l<=l0;l++)
{
for(i=0;i<=l0-l;i++)
{
a=0;
for(j=0;j<l/2;j++)
{
if(str[i+j]!=str[l-j+i-1]) {a=1;break;}
}
if(a==0)
{
for(j=i;j<i+l;j++)
printf("%c",str[j]);
printf("\n");
}
}
}
} |
49 | 24126 | //********************************
//*??????? **
//*?????? **
//*???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 | 24127 | 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 | 24128 | //******************************
//**???????
//**????? 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 | 24129 | //********************************************************
//* ???: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 | 24130 | /*
* 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 | 24131 | int main()
{
int i, j, k;
char str[500];
cin.getline(str, 500);
int len = strlen(str);
for (j = 2; j <= len; j++)
{
for (i = 0; i <= len - j; i++)
{
for (k = 0; k < j / 2; k++)
{
if (str[i+k] != str[i+j-k-1])
{
break;
}
}
if (k == j / 2)
{
for (int ii = i; ii < i + j; ii++)
{
cout << str[ii];
}
cout << endl;
}
}
}
return 0;
}
|
49 | 24132 | 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 | 24133 | 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 | 24134 | //
// main.cpp
// ????
//
// Created by ? ?? on 12-11-12.
// Copyright (c) 2012? ? ??. All rights reserved.
//
int main()
{
char a[500];
cin.getline(a, 500);
int la, c, d, sum;
la = strlen(a);
int i, j, k;
for (i = 2; i <= la; i = i + 2)
{
for (j = 0; j <= la - i; j++)
{
d = j;
c = i + j - 1;
sum = 0;
do
{
if (a[d] != a[c])
{
sum++;
}
d++;
c--;
} while (c > d);
if (sum == 0)
{
for (k = j; k <= i + j - 1; k++)
{
cout << a[k];
}
cout << endl;
}
}
}
return 0;
}
|
49 | 24135 | char a[500]={'\0'};
char b[500]={'\0'};
int L=0;
void check(char a[]) //???????????
{
int la=strlen(a);
int i=0,j=la-1;
do
{
if(a[i]==a[j])
{
i++;
j--;
}
else
{
return ;
}
}while(i<=j);
cout<<a<<endl;
}
int main()
{
cin>>a;
L=strlen(a);
int s,i,j;
for(s=2;s<=L;s++)
{
for(i=0;i<=L-s;i++)
{
char *p=&a[i];
for(j=0;j<s;j++)
{
b[j]=*p;
p++;
}
check(b);
}
}
return 0;
}
|
49 | 24136 | main()
{
char s[LEN];
scanf("%s",s);
int slen=strlen(s);
int i,j,k=LEN;
for(i=2;i<=slen;i++)
{
for(j=0;(j+i)<=slen;j++)
{
for(k=j;k<=(j+i-1);k++)
if(s[k]!=s[2*j+i-1-k]) break;
if(k==(j+i))
for(k=j;k<=(j+i-1);k++)
{
printf("%c",s[k]);
if(k==(j+i-1)) printf("\n");
}
k=LEN;
}
}
getchar();
getchar();
getchar();
}
|
49 | 24137 | //???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 | 24138 |
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 | 24139 | char a[501];
int len;
int lookfor(int k)
{
char *p=NULL,*q=NULL;
int i,p1=1,j;
for(i=0;i<=len-k;i++)
{
p=&a[i];p1=1;
q=&a[i+k-1];
while(p<q)
{
if(*p!=*q)
{
p1=0;break;
}
p++;q--;
}
if(p1==1)
{
for(j=0;j<=k-1;j++)
cout<<a[j+i];
cout<<endl;
}
}
return 0;
}
int main()
{
int i;
cin>>a;
len=strlen(a);
for(i=2;i<=len;i++)
lookfor(i);
return 0;
}
|
49 | 24140 | void f(int j,int i,char c[]);
void g(char c[],int m,int j);
int main()
{
char c[501];
int i=0,j,k,m,n,y=0,l;
c[0]=getchar();
while(c[i]!='\n')
{
i++;
c[i]=getchar();
}
for(j=2;j<i;j++)
{
f(j,i,c);
}
}
void f(int j,int i,char c[])
{
int m,n;
for(m=0;m<=i-j;m++)
{
g(c,m,j);
}
}
void g(char c[],int m,int j)
{
int p,q,i;
p=m;
q=m+j-1;
for(;;p++,q--)
{
if(c[p]!=c[q]) break;
else if((p==q)||(p==q-1))
{
for(i=m;i<=m+j-1;i++)
{
printf("%c",c[i]);
}
printf("\n");
}
}
} |
49 | 24141 | 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 | 24142 | 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 | 24143 | 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 | 24144 | 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 | 24145 | 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 | 24146 | /* ???? ????.cpp
* ??? 1200012826 ??
* ??? 2012?11?18?
*/
int main()
{
char a[500], b[500];
int i, j, k, m, p, l;
cin >> a;
l=strlen(a);
for(i=1; i < l; i++)
for(j=0; j < l-1; j++)
{
p=1;
m=i;
for(k=0; k <= i; k++)
{
b[k]=a[j+k];
}
for(k=0; k <= m; k++)
{
if(b[k] == b[m-k])
{
continue;
}
else
{
p=0;
break;
}
}
if(p)
{
for(k=0; k <= m; k++)
{
cout << b[k];
}
cout << endl;
}
}
return 0;
} |
49 | 24147 | 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 | 24148 | 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 | 24149 | 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 | 24150 |
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 | 24151 | 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 | 24152 | 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 | 24153 |
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 | 24154 | 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 | 24155 | //****************************************
//*???????
//*?????? 1100012789
//*???2011.11.11
//****************************************
// ???? a?????? totLen??? cheLen????????????
void check(char a[], int totLen, int cheLen);
int main()
{
char a[500] = {'\0'};
int totLen;
cin >> a;
totLen = strlen(a);
check(a, totLen, 2); // ???????
return 0;
}
void check(char a[], int totLen, int cheLen)
{
int i, flag, j; // flag??????????
if (cheLen > totLen) // ??????
return;
for (i = 0; i <= totLen - cheLen; i++)
{
flag = 1;
for (j = 1; j <= cheLen / 2; j++ ) // ???????
if (a[i + j - 1] != a[i + cheLen - j]) // ????????
{
flag = 0; break;
}
if (flag == 1)
{
for (j = 0; j < cheLen; j++) // ????
{
cout << a[j + i];
}
cout << endl;
}
}
check(a, totLen, cheLen + 1); // ????
} |
49 | 24156 | 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 | 24157 | 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 | 24158 | /*
* 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 | 24159 | 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 | 24160 |
int main()
{
char str[501];
int i,j,k,length,n,s;
gets(str);
length=strlen(str);
for(i=2;i<=length;i++)
for(j=0;j<length;j++)
{
k=0;
for(n=0;n<i;n++)
{
if(str[j+n]==str[j+i-n-1])
k++;
if(k==i)
{ for(s=j;s<=j+n;s++)
printf("%c",str[s]);
printf("\n");
}
}
}
return 0;
} |
49 | 24161 |
void sssss(char *);
int main(void)
{
int d,t,n,i,j,k;
char s[500],sub[500],rsub[500];
int plen;
gets(s);
d=strlen(s);
for(plen=2;plen<=d;plen++)
{
for(j=0;j<=d-plen;j++)
{
strncpy(sub,s+j,plen);
sub[plen]='\0';
strcpy(rsub,sub);
sssss(rsub);
rsub[plen]='\0';
if(strcmp(sub,rsub)==0)
printf("%s\n",sub);
}
}
return 0;}
void sssss(char *s)
{
int d,i;
char tmp;
d=strlen(s);
for(i=0;i<(d+1)/2;i++)
{
tmp=s[i];
s[i]=s[d-1-i];
s[d-1-i]=tmp;
}
} |
49 | 24162 | //???????
//??? 1200017623
//???????
int main(){
int judge(char*,int);
char str[500],temp[500] = {'\0'},*p;
int len,num;
cin>>str;
len = strlen(str);
for(num = 2;num <= len;num++){
for(p = str;p < str + len +1 - num;p++){
strncpy(temp,p,num);
if(judge(temp,num))cout<<temp<<endl;
}
}
return 0;
}
int judge(char *ch,int n){ //???????
char *p,*q;
for(p = ch,q = ch + n - 1;p <= q;p++,q--){
if(*p != *q)return 0;
}return 1;
}
|
49 | 24163 | int main()
{
char a[501]; int i,j,k,t,m,n;
cin>>a;
t=strlen(a);
for (k=1;k<=t-1;k++)
{
for (i=0;i<t-1;i++)
if (i+k<t&&a[i]==a[i+k])
{
for (m=i,n=i+k;m<n;m++,n--)
if (a[m]!=a[n]) break;
if (m>=n)
{for (j=i;j<=i+k;j++)
cout<<a[j];
cout<<endl;
}
}
}
return 0;
}
|
49 | 24164 |
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 | 24165 | 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 | 24166 | 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 | 24167 | 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 | 24168 | /*
* 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 | 24169 | /**
* ???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 | 24170 | 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 | 24171 | int main()
{
static char str[501];
int len,i,j,p,l;
gets(str);
for(len=0;str[len]!='\0';len++);
for(l=2;l<=len;l++)
{
for(i=0;i<=len-l;i++)
{
for(j=0;j<l/2;j++)
{
if(str[i+j]!=str[i+l-1-j])
{
goto here;
}
}
for(p=i;p<i+l;p++)
printf("%c",str[p]);
printf("\n");
here: continue;
}
}
return 0;
}
|
49 | 24172 | int fun(int a[500],int l)
{
int i;
int j=0;
for(i=0;i<l;i++)
if(a[i]!=a[l-i-1])
{
j=1;
return 0;
}
if(j==0)
{
for(i=0;i<l;i++)
printf("%c",a[i]);
printf("\n");
return 0;
}
}
main()
{
char s[500];
int s1[500];
int i,l,j,k;
scanf("%s",s);
l=strlen(s);
for(i=2;i<=l;i++)
{
for(j=0;j<l-i+1;j++)
{
for(k=0;k<i;k++)
s1[k]=s[k+j];
fun(s1,i);
}
}
}
|
49 | 24173 | 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 | 24174 | int main()
{
char c[501];
int a,i,j,m,n;
gets(c);
n=strlen(c);
for(m=2;m<=n;m++)
{
for(i=0;i<=n-m;i++)
{
a=0;
for(j=i;j<m+i;j++)
{
if(c[j]!=c[m+i-j+i-1])
{a=1;break;}
}
if(a==0)
{
for(j=i;j<m+i;j++)
printf("%c",c[j]);
printf("\n");
}
}
}
return 0;
}
|
49 | 24175 | 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 | 24176 | 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 | 24177 | void main(){
char a[501];
int i,j,k,z,n;
gets(a);
n=strlen(a);
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
{
for(k=0;k<=j/2;k++)
{
if(a[i+k]!=a[i+j-k]) break;
}
if(k==j/2+1)
{
for(z=i;z<=i+j;z++)
{ printf("%c",a[z]);
}
printf("\n");
}
}
}
|
49 | 24178 | //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 | 24179 | void main()
{
void huiwen(char c[1000],int);
int i,n;
char c[1000];
gets(c);
for (i=2;i<=strlen(c);i++)
huiwen(c,i);
}
void huiwen(char c[1000],int i)
{
int j,l,flag=0,m;
char *p=c;
for(j=0;j<=strlen(c)-i;j++)
{ for(l=0;l<=i/2;l++)
{
if(*(p+j+l)!=*(p+j+i-l-1))
{flag=1;break;}
}
if(flag==0)
{
for(m=0;m<i;m++)
printf("%c",*(p+j+m));
printf("\n");
}
flag=0;
}
}
|
49 | 24180 | 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 | 24181 | 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 | 24182 |
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 | 24183 | main()
{
char s[500];
int i,j,k,l,t,m;
scanf("%s",s);
l=strlen(s);
for(i=2;i<=l;i++)
{
for(j=0;j<=l-i;j++)
{
t=1;
for(k=j;k<j+i;k++)
{
if(s[k]!=s[j+j+i-1-k])
{
t=0;
break;
}
if(t==0) break;
}
if(t==1)
{
for(m=j;m<j+i;m++)
printf("%c",s[m]);
printf("\n");
}
}
}
} |
49 | 24184 | /*
* 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 | 24185 | char * my_strrev(char *str);
int main()
{
int t,i;
char str[1000];
gets(str);t=2;
char subStr[101], revSubStr[101];
while(t<=strlen(str))
{
for(i=0;i<=strlen(str)-t;i++)
{
strncpy(subStr,str+i,t);
strncpy(revSubStr,str+i,t);
subStr[t] = revSubStr[t] = '\0';
my_strrev(revSubStr);
if(strcmp(subStr,revSubStr)==0)
{
cout<<subStr<<endl;
}
}
t++;
}
return 0;
}
char * my_strrev(char *str)
{
char *right = str;
char *left = str;
char ch;
while (*right) right++;
right--;
while (left < right)
{
ch = *left;
*left++ = *right;
*right-- = ch;
}
return(str);
} |
49 | 24186 | main()
{
int i,j,k,n,bools;
char s[500];
gets(s);
n=strlen(s);
for(k=2;k<=n;k++)
for(i=0;i<=n-k;i++)
{ bools=1;
for(j=i;j<i+k/2;j++)
if(s[j]!=s[2*i+k-j-1])
{bools=0;break;}
if(bools==1)
{ for(j=i;j<=i+k-1;j++)
printf("%c",s[j]);
printf("\n");
}
}
return 0;
}
|
49 | 24187 | int main()
{
char s[500];
int i=0,j=0,k=0,l=0,t=0,p=0;
int a[500];
cin>>s;
for(i=0;;i++)
{
if(s[i]=='\0')
break;
l++;
}
for(i=0;i<l-1;i++)
{
if(s[i]==s[i+1])
{
a[j++]=i;
cout<<s[i]<<s[i+1]<<endl;
}
}
for(k=1;k<l/2;k++){
for(i=0;i<j;i++){
int m=0;
for(t=1;t<=k;t++){
if(a[i]-t<0||a[i]+1+t>l-1)
break;
else
{
if(s[a[i]-t]==s[a[i]+1+t])
m++;
}
}
if(m==k)
{
for(p=a[i]-k;p<=a[i]+1+k;p++)
cout<<s[p];
cout<<endl;
}
}
}
return 0;
} |
49 | 24188 | 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 | 24189 | int main()
{
char a[500];
int l,i,j,m,p,n,k;
scanf("%s",a);
l=strlen(a);
for(i=2;i<=l;i++)
{
for(j=0;j<=l-i;j++)
{
p=1;
m=j;
n=m+i-1;
while(m>=0)
{
if(a[m]!=a[n])
{
p=0;
break;
}
if(m==n||n-m==1)
break;
m++;
n--;
}
if(p==1)
{
for(k=j;k<=j+i-1;k++)//????j???m
printf("%c",a[k]);
printf("\n");
}
}
}
getchar();
getchar();
}
|
49 | 24190 | 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 | 24191 |
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");
}
}
}
|
49 | 24192 | //***************************************
//* ????1.cpp *
//* ??????1100012964? *
//* ?????2011?11? *
//* ????????? *
//***************************************
void check(char *);
int main() //???
{
char a[501]; //?????
cin >> a; //?????
check(a); //??
return 0;
}
void check(char * a) //????????a
{
int i, j, k, l, p, q;
l = strlen(a);
for (i = 2; i <= l; i++) //????????????
{
for (j = 0; j <= l - i; j++)
{
q = 0; //??????q
for (p = j; p < j + i; p++)
{
if (a[p] == a[2 * j + i - p - 1])
q++;
}
if (q == i) //??????????????????
{
for (k = j; k <= j + i - 1; k++)
cout << a[k];
cout << endl;
}
}
}
} //????
|
49 | 24193 | void f(int x,char str[501]);
int main()
{
int le,x=2;
char str[501];
cin>>str;
for(x=2;x<=le;x++)
f(x,str);
return 0;
}
void f(int x,char str[501])
{
int i,le,j,flag=1,p;
le=strlen(str);
for(i=0;i<=le-x;i++)
{
if(x%2==0)
{
for(j=i;j<=i+x/2-1;j++)
if(str[j]!=str[i+i+x-1-j])
flag=0;
if(flag==1)
{
for(p=i;p<=i+x-1;p++)
cout<<str[p];
cout<<endl;
}
flag=1;
}
if(x%2==1)
{
for(j=i;j<=i+(x-1)/2-1;j++)
if(str[j]!=str[i+i+x-1-j])
flag=0;
if(flag==1)
{
for(p=i;p<=i+x-1;p++)
cout<<str[p];
cout<<endl;
}
flag=1;
}
}
}
|
49 | 24194 | /*
* 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 | 24195 | int main()
{
char ch[510];
int a[125000][3];//??????
int n=0,m=0;
int i=0,j=0,k=0;
cin.getline(ch,510,'\n');
while(ch[n]!='\0')//???????
n++;
for(k=0;k<n;k++)//??????
for(i=k+1;i<n;i++)
{
int count=0;
for(j=k;j<=i;j++)
if(ch[j]==ch[k+i-j])
count++;
if(count==i-k+1)//???????
{
a[m][1]=k;//????
a[m][2]=i;//????
a[m][0]=i-k+1;//??
m++;//????????
}
}
for(k=0;k<m-1;k++)//?????
for(i=0;i<m-1-k;i++)
if(a[i][0]>a[i+1][0])
{
int t=0;
t=a[i][0];a[i][0]=a[i+1][0];a[i+1][0]=t;
t=a[i][1];a[i][1]=a[i+1][1];a[i+1][1]=t;
t=a[i][2];a[i][2]=a[i+1][2];a[i+1][2]=t;
}
for(k=0;k<m;k++)
{
for(i=a[k][1];i<=a[k][2];i++)
cout<<ch[i];
cout<<'\n';
}
return 0;
} |
49 | 24196 | int main()
{
char a[500],b[500],c[500];
int i,j=0,l,s=0,n,p,q,k=0;
scanf("%s",a);
l=2;
n=strlen(a);
while(l<=n)
{
for(i=0;i<n+1-l;i++)
{
p=i;
q=i;
for(s=0;s<=l-1;s++)
{
b[j]=a[p+l-1];
p=p-1;
c[j]=a[q];
q=q+1;
j++;
}
for(j=0;j<l;j++)
{
if(b[j]==c[j])
k=k+1;
else;
}
if(k==l)
{
for(j=0;j<l;j++)
{
printf("%c",c[j]);
}
printf("\n");
}
else;
j=0;
k=0;
s=0;
}
l++;
i=0;
}
return 0;
} |
49 | 24197 | int main()
{
char s[100],b[100]={0};
int len,i,j,k,m;
gets(s);
len=strlen(s);
for(i=0;i<len;i++)
b[i+1]=s[i];
for(i=2;i<=len;i++)//i?0?8?0?5?0?3?0?1?0?2?0?2×?0?7?0?7?0?3?0?8?0?2?0?6¤?0?9?0?6?0?5?0?1×?0?6?0?9?0?0?0?2?0?92?0?0?0?2×?0?0·?0?4?0?5?0?1×?0?6?0?6¤?0?2?0?9len?0?0?0?2×?0?0·?0?4
for(j=1;j<=len+1-i;j++)//j?0?8?0?5?0?6¤?0?9?0?6?0?2?0?9i?0?8?0?2?0?3?0?1?0?2?0?2×?0?7?0?7?0?3?0?8?0?2?0?8××?0?0·?0?4?0?8?0?3?0?8?0?5×éb?0?0?0?4?0?8?0?2?0?2?0?3?0?0?0?1?0?5?0?1?0?7?0?71?0?8?0?5len+1-i?0?3?0?5
{
for(k=j;k<=(2*j+i-1)/2;k++)//k?0?8?0?5?0?3?0?1?0?2?0?2×?0?7?0?7?0?3?0?0?0?4?0?8?0?2?0?0÷?0?0?0?2×?0?0·?0?4?0?8?0?3?0?8?0?5×é?0?0?0?4?0?8?0?2?0?2?0?3?0?0?0?1
{
if(b[k]==b[i+2*j-1-k])continue; //?0?3?0?1?0?2?0?2×?0?0?0?7?0?3?0?8?0?2?0?0?0?1?0?4?0?6?0?5?0?1?0?9?0?8?0?6?0?4?0?2?0?3?0?0?0?1?0?8?0?2×?0?0·?0?4?0?3à?0?1?0?1
else break;
}
if(k==(i+2*j-1)/2+1) //?0?9ù?0?7?0?4?0?9?0?8?0?6?0?4?0?2?0?3?0?0?0?1×?0?0·?0?4?0?9?0?4?0?3à?0?1?0?1
{
for(m=j;m<j+i-1;m++)
printf("%c",b[m]);printf("%c\n",b[j+i-1]); //?0?8?0?1?0?6?0?2×?0?0?0?7?0?3
}
}
return 0;
}
|
49 | 24198 | 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 | 24199 | int main()
{
char str[505];
cin >> str;
int len=strlen(str);
int l,s;
for(l=2;l<=len;l++)
{
for(s=0;s<=len-l;s++)
{
int flag=1;
for(int p=s,q=s+l-1;p<q;p++,q--)
{
if(str[p]!=str[q])
{
flag=0;
break;
}
}
if(flag)
{
for(int k=s;k<=s+l-1;k++)
cout<<str[k];
cout<<endl;
}
}
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.