label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
49 | 24400 | int main()
{
char a[520],b[520];
int p,q,x;
gets(a);
int n=strlen(a);
for (int l=1;l<=n;l++)
for (int i=0;i+l<n;i++)
{
x=0;
p=i;
q=l+i;
for(;p<q;p++,q--)
if (a[p]!=a[q]) x=1;
if (x==0)
{
for (int k=i;k<=i+l;k++)
printf("%c",a[k]);
printf("\n");
}
}
}
|
49 | 24401 | int check(char a[], int point, int lenth)
{
if(point > 0 && a[point - 1] == a[point + lenth])
return 1;
else return 0;
}
int main()
{
char code[500];
int flag[500];
int i, j, lenth, outlet;
for(i = 0; i < 500; i++)
flag[i] = 1;
cin >> code;
for(outlet = 0, lenth = 0; outlet < strlen(code); lenth += 2)
{
for(i = 0; i < strlen(code); i++)
{
if(flag[i])
{
if(check(code, i, lenth))
{
for(j = i - 1; j <= i + lenth; j++)
{
cout << code[j];
flag[i - 1] = 1;
}
cout << endl;
}
else outlet++;
flag[i] = 0;
}
}
}
return 0;
} |
49 | 24402 | int main()
{
char a[520];
int i,j,k,l,p,n;
cin >> a ;
n=strlen(a);
for(j=1;j<n;j++)
{
for(i=0;i<n;i++)
{
k=j;p=i;
if (a[p]==a[p+k] && k==1) {cout << a[p] << a[p+1] << endl;}
if (a[p]==a[p+k] && k>1)
{
while(a[p]==a[p+k]&&k>1)
{
p++;k=k-2;
}
if(k<2&&a[p]==a[p+k])
{
for(l=i;l<=i+j;l++)
{
cout << a[l] ;
}
cout <<endl;
}
}
}
}
return 0;
}
|
49 | 24403 | /*
* 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 | 24404 |
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 | 24405 | 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 | 24406 | //**********************************
//*????.cpp *
//*?????? *
//*???2011-10-30 *
//**********************************
void checking (char check[], int i)
{
int m, q;
for (m = 0; m < i; m++)
{
if (check[m] != check[i - 1 - m]) //??check???????break???
break;
}
if (m == i)
{
for (q = 0; q < i; q++)
{
cout << check[q]; //????break???????????????????
}
cout << endl;
}
}
int main()
{
int i, j, k, m, n, flag, q;
char str[501];
char check[501]; //???????????????
cin >> str;
n = strlen(str); //????????
for (i = 2; i <= n; i++)
{
flag = 0;
for (j = 0; j < n - i + 1; j ++)
{
for (k = j; k < j + i; k ++)
{
check[k - j] = str[k]; //??????????check??
}
checking (check, i);
}
}
return 0;
}
|
49 | 24407 | int main()
{
char s[500];
gets(s);
int i,j,k,l=0,m=0;
for(i=2;i<strlen(s);i++)
for(j=i/2;j<=(strlen(s)-i/2);j++)
{ l=0;
if(i%2==0)
{
for(k=0;k<i/2;k++)
if(s[j-k-1]!=s[j+k])
{ l=1;break;}
else continue;
}
if(i%2==1)
{ if(j==strlen(s)-i/2)
break;
for(k=1;k<(i/2+1);k++)
if(s[j-k]!=s[j+k])
{l=1;break;}
}
if(l==0)
{for(m=0;m<i-1;m++)
printf("%c",s[j-i/2+m]);
printf("%c\n",s[j+i/2-1]);
}
}
return 0;
} |
49 | 24408 | 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 | 24409 | 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 | 24410 | 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 | 24411 | /*
* 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 | 24412 |
void reverse(int n,char *p1,char *p2)
{
int i;
for (i=0;i<=n-1;i++)
*(p2+i)=*(p1+n-i-1);
*(p2+n)='\0';
}
void recopy(int n,char *p1,char *p2)
{
int i;
for (i=0;i<=n-1;i++)
*(p2+i)=*(p1+i);
*(p2+n)='\0';
}
void process(char *p)
{
int i,j;
char b[strlen(p)+1],c[strlen(p)+1];
for (i=2;i<=strlen(p);i++)
{
for (j=1;j<=strlen(p)-i+1;j++)
{
reverse(i,p+j-1,b);
recopy(i,p+j-1,c);
if (strcmp(b,c)==0)
printf("%s\n",c);
}
}
}
int main(int argc, char *argv[])
{
char a[500];
scanf("%s",a);
char *p;
p=a;
process(p);
return 0;
}
|
49 | 24413 | int main()
{ char a[500]={0};
char b;
int i=0;
while(1)
{ b=cin.get();
if(b=='\n') break;
else
{ a[i]=b;
i=i+1;
}
}
int j;
int k;
int l;
int m;
int u;
for(j=2;j<=i;j++)
{ for(k=0;k<i-j+1;k++)
{ m=0;
for(l=k;l<k+j;l++)
{ if(a[l]!=a[2*k+j-1-l]) m=1;
}
if(m==0)
{ for(u=k;u<k+j;u++) cout<<a[u];
cout<<endl;
}
}
}
return 0;
} |
49 | 24414 | int main()
{
int i=0,x[510],y[510],e,f,count=0;
char a[510],b;
while (b!='\n')
{
cin.get(b);
a[i++]=b;
}//a????0?i-2?
int j1,j2,j3;
for (j1=2;j1<=i-1;j1++)//??
{
for (j2=0;j2<=i-3;j2++)
{
for (j3=0;j3<=j1-1;j3++)//?????????????
{
if (j2+j3<=i-2)
e=a[j2+j3];
f=a[j2+j1-1-j3];
if (e==f)
count++;
if (count==j1)
{
for (int j4=j2;j4<=j2+j1-1;j4++)
cout<<a[j4];
cout<<'\n';
}
}
count=0;
}
}
return 0;
} |
49 | 24415 | /*
* 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 | 24416 | void hw(char a[],int n)
{
int i,j,k,h=0;
for(i=2;i<=n;i++)
{
for(j=0;j<=n-i;j++)
{
for(k=0;k<i;k++)
{
if(a[j+k]==a[j+i-k-1])
{
h=1;
}
else
{
h=0;
break;
}
}
if(h==1)
{
for(h=j;h<j+i;h++)
printf("%c",a[h]);
printf("\n");
h=0;
}
}
}
}
int main()
{
int n;
char a[500];
scanf("%s",a);
n=strlen(a);
hw(a,n);
return 0;
} |
49 | 24417 | 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 | 24418 | 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 | 24419 | //* * * * * * * * * * * * * * * * * * * * * * * *
//*???????? *
//*????????.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 | 24420 | void main()
{
int l,n,i,j,k;
char c[1000];
gets(c);
l=strlen(c);
for(i=1;i<=l-1;i++)
for(j=0;j<l-1;j++)
for(n=0;n<=i/2;n++)
{
if(c[j+n]!=c[j+i-n])break;
else if(c[j+n]==c[j+i-n] && n<i/2)continue;
else
{for(k=j;k<j+i;k++)printf("%c",c[k]);printf("%c\n",c[j+i]);}
}
} |
49 | 24421 | 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 | 24422 | void same(int i, char x[])
{
int j, k;
int flag = 1;
for(j = 0; x[j] != '\0'; j++)
{
flag = 1;
for(k = 0; k < + i / 2; k ++)
{
if(x[k + j] != x[j + i - 1 - k])
{
flag = 0;
break;
}
}
if(flag)
{
for(k = j; k < j + i; k ++)
cout << x[k];
cout << endl;
}
}
}
int main()
{
char x[501];
int i, len;
cin >> x;
len = strlen(x);
for(i = 2; i <= len; i++)
{
same(i, x);
}
return 0;
} |
49 | 24423 | //*******************************************//
//*??????? *//
//*????? *//
//*???2010.12.21 *//
//*******************************************//
void search();//???????
void check(char same[]);
char str[500];
int lenstr;
int main()
{
cin>>str;
lenstr=strlen(str);
search();
}
void search()
{
int i,j,len,t;
for(len=2;len<=lenstr;len=len+2)//???????
{
for(i=0;i<=lenstr-len;i++)//??????
{
char spr[500];
for(j=i,t=0;j<=i+len-1;j++,t++)//???????????????????????????????????????????
spr[t]=str[j];
spr[j]='\0';
check(spr);
}
}
}
void check(char same[500])
{
int lensame;
lensame=strlen(same);
int i,flag=1;
for(i=0;i<=lensame/2-1;i++)//??????????????
{
if(same[lensame-1-i]!=same[i])//??????????
{
flag=0;
break;
}
}
if(flag==1)
{
for(i=0;same[i]!='\0';i++)
cout<<same[i];
cout<<endl;
}
} |
49 | 24424 | int main() {
char a[501] = "0";//??????
int r, i, j, k, m;
cin >> a;
for (i = 0; a[i]; i++) {
}
r = i;
for (i = 2; i <= r; i++) {
if (i % 2 == 0) {
for (j = i / 2 - 1; j <= r - i / 2; j++) {
for (k = 1; k <= i / 2; k++) {
if (a[j - k + 1] != a[j + k])//???????
{
break;
} else
continue;
}
if (k == i / 2 + 1) {
for (m = -i / 2 + 1; m <= i / 2; m++)
cout << a[j + m];
cout << endl;
}
}
}//??????
if (i % 2 == 1) {
for (j = i / 2; j < r - i / 2; j++) {
for (k = 1; k <= i / 2; k++) {
if (a[j - k] != a[j + k]) {
break;
} else
continue;
}
if (k == i / 2 + 1) {
for (m = -i / 2; m <= i / 2; m++)
cout << a[j + m];
cout << endl;
}//??????
}
}
}
return 0;
}
|
49 | 24425 | 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 | 24426 | 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 | 24427 | 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 | 24428 | //******************************************************
//* ? ? ? ?? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 11 ? 24 ? *
//* ? ? ?1000010185 *
//******************************************************
char a[501]; //??a??????
int Judge(int b, int e) //????Judge??a????b???e???????
{
int k = (b + e - 1) / 2;
int i;
for (i = b; i <= k; i ++)
if (a[i] != a[b + e - i])
break;
if (i == k + 1)
return 1;
else
return 0;
}
int main()
{
int l;
cin >> a;
l = strlen(a);
for (int i = 2; i <= l; i ++) //?????2?l??
for (int j = 0; j <= l - i; j ++) //?????????????
if(Judge(j, j + i - 1))
{
for (int k = j; k < i + j; k ++)
cout << a[k];
cout << endl;
}
return 0;
} |
49 | 24429 | char str[500], huiwen[500];
void main()
{
int i, j, m, leng;
int f(int, int);
scanf("%s",str);
for(leng=2; leng<strlen(str); leng++)
{
for(i=0; i<strlen(str); i++)
{
if(f(i, i+leng-1)==1) printf("%s\n",huiwen);
}
}
/*for(i=0; i<strlen(str); i++)
{
for(j=i+1; j<strlen(str); j++)
{
if (f(i, j)==1) printf("%s\n",huiwen);
for(m=0; m<=500; m++) huiwen[m]='\0';
}
}*/
}
int f(int i, int j)
{
int flag=0, k=0;
char s1[500], s2[500];
for(k=0; k<=j-i; k++)
{
s1[k]=str[i+k];
s2[k]=str[j-k];
if(s1[k]==s2[k]) flag=flag;
else flag=flag+1;
}
if(flag==0)
{
for(k=0; k<=j-i; k++)
{
huiwen[k]=s1[k];
}
return 1;
}
else return 0;
} |
49 | 24430 |
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 | 24431 |
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 | 24432 | int main()
{
char a[500],*p1,*p2,*p3,*p4,*p5,*p6;
int i,l,j,flag;
gets(a);
l=strlen(a);
for(j=1;j<=l-1;j++)
{
p1=a;p2=&a[j];
for(i=0;i<l-j;i++,p1++,p2++)
{
p5=p1;p3=p1;p6=p2;p4=p2;
flag=0;
for(;p3<=p4;p3++,p4--)
{
if(*p3!=*p4)flag++;
}
if(flag==0)
{
for(;p5<=p6;p5++)
{
printf("%c",*p5);
}
printf("\n");
}
}
}
return 0;
}
|
49 | 24433 | 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 | 24434 | void srev(char str[500], int len)
{
char rev[500];
int i;
for (i=0; i<len; i++)
*(rev+i)=*(str+len-i-1);
for (i=0; i<len; i++)
*(str+i)=*(rev+i);
}
int main ()
{
char s[500], str[500], rev[500];
gets(s);
int len=strlen(s), i, j;
for (i=2; i<len; i++) {
for (j=0; j<len-i+1; j++) {
strncpy(str, s+j, i);
strncpy(rev, s+j, i);
str[i]=rev[i]='\0';
srev(rev, i);
if (strcmp(str, rev)==0) {
puts(str);
}
}
}
return 0;
} |
49 | 24435 | void main()
{
char str1[500]={0},str2[500]={0};
int i,start,k,l,p=0,q,f,d;
gets(str1);
l=strlen(str1);
for(i=2;i<=l;i++)//?????
{
for(start=0;start<l;start++)//????
{
d=start;
f=0;
p=0;
for(k=start+i-1;k>=start;k--)//????
{
str2[p]=str1[k];
p++;
}
for(q=0;q<p;q++)//??
{
if(str2[q]==str1[d])
{
f=1;
d++;
}
else
{
f=0;
break;
}
}
if(f==1)
{
puts(str2);
}
}
}
}
|
49 | 24436 | int main()
{
char a[500];
int i,j,r=0,k,p,q,m,n;
for(i=0;i<500;i++)
{
scanf("%c",&a[i]);
r++;
if(a[i]=='\n')
break;
}
r=r-1;
for(j=1;j<=r-1;j++)
for(k=0;k<r;k++)
{
m=0;
p=r;
q=j;
for(i=k;i<=k+j/2;i++)
{
if(a[i]==a[i+q])
{
q=q-2;
m++;
}
else
break;
}
if(m==(j+1)/2)
{
for(n=k;n<=k+j;n++)
printf("%c",a[n]);
printf("\n");
}
}
return 0;
} |
49 | 24437 | 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 | 24438 | int main()
{
char str[500];
cin >> str;
int len, i, j, k, flag, count,start, end;
len = strlen(str);
for (i = 2; i <= len - 1; i++) // i???????????
{
for (j = 0; j <= len - i; j++) // j???????????,len - i???????????
{
flag = 0;
count = j;
for (k = j + i - 1; k >= count; count++, k--) // ?k = j?
{
flag = 0;
if (str[count] == str[k])
{
flag = 1; // ????????
}
else
{
flag = 0;
break;
}
// ??i??????????????i?????????k???count?count + 1
if ((flag == 1) && ((k == count) || (k == count + 1)))
{
for (start = j; start <= j + i - 1; start++)
{
cout << str[start];
if (start == j + i - 1)
{
cout << endl;
} // end for
} // end for
} // end if
} // end for k
} // end for j
} // end for i
return 0;
}
|
49 | 24439 | 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 | 24440 |
void pd(char *p,int m)
{
char *head,*end,*t,*q;
head=p;
int zhi=0,j;
end=p+m-1;
for(t=head,q=end;t<=end;t++,q--)
{if(*t==*q)zhi=1;
else{zhi=0;break;}}
if(zhi==1)
{for(t=head;t<=end;t++)
printf("%c",*t);
printf("\n");}
}
void main()
{
char a[1000]={0};
char *p;
int n,i;
gets(a);
for(p=a,n=0;*p!='\0';p++,n++);
for(i=2;i<=n;i++)
for(p=a;p<a+n-i+1;p++)
pd(p,i);
}
|
49 | 24441 | char str[500];
int length;
int check(int start,int len);
int ctr1,ctr2,ctr3;
int main(void)
{
gets(str);
length=strlen(str);
for(ctr1=2;ctr1<=length;ctr1+=2)
{
for(ctr2=0;ctr2<=length-ctr1;ctr2++)
{
check(ctr2,ctr1);
}
}
return 0;
}
int check(int start,int len)
{
char a[500];
char b[500];
int i;
for(i=0;i<500;i++)
{
a[i]='\0';
b[i]='\0';
}
for(i=0;i<len;i++)
{
a[i]=str[i+start];
b[i]=str[len-i+start-1];
}
if(strcmp(a,b)==0)
{
puts(a);
return 1;
}
else
return 0;
}
|
49 | 24442 | 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 | 24443 |
/*
* file homework 9_5
* author ??
* date 2010-11-24
* description
???????????????????
*/
int isHuiwen(char hw[])
{
int len, i;
len = strlen(hw);
for (i = 0; i <= (len - 1) / 2; i ++)
if (hw[i] != hw[len - 1 - i])
break;
if (i > (len - 1) / 2)
return 1;
else
return 0;
}
int main()
{
char str[501], hw[501];
int i, j, len;
cin >> str;
len = strlen(str);
for (i = 2; i <= len; i ++) // i????????
for (j = 0; j <= len - i; j ++)
{
strncpy(hw, str + j, i);
hw[i] = '\0';
if (isHuiwen(hw))
cout << hw << endl;
}
return 0;
}
|
49 | 24444 |
void check(char a[], int i, int j)
{
int k, m = 0;
for (k = 0; k <= i / 2; k++)
{
if (a[j + k] != a[j + i - 1 - k])
{
m = 1;
break;
}
}
if (m != 1)
{
for (k = 0; k < i; k++)
{
cout << a[j + k];
}
cout << endl;
}
}
int main()
{
char a[500];
int n, i, j;
cin.getline(a, 500);
i = 0;
while (a[i] != '\0')
{
i++;
}
n = i;
for (i = 2; i <= n; i++)
{
for (j = 0; j <= n - i; j++)
{
check(a, i, j);
}
}
return 0;
} |
49 | 24445 | //*************************
//*?????? 1200062705
//*????4.????
//*???2012-11-18
//*************************
int main()
{
int i, j, p, n;
char string[501]; // ??????
cin >> string;
n = strlen(string); // ?????
for (i = 2; i <= n; i++) //
{
for (j = 0; j < n; j++)
{
for (p = 0; p < i / 2; p++)
{
if (string[j + p] != string[j + i - p - 1]) break;
}
if (p == i / 2)
{
for (p = j; p < j + i; p++)
{
cout << string[p];
}
cout << endl;
}
}
}
return 0;
}
|
49 | 24446 |
/*
???:Huiwen()
??:???????????,?????1,????0
**/
int Huiwen(char part[])
{
char check[501];
memset(check, 0, sizeof(check));
int i, j, len;
len = strlen(part);
j = len - 1;
for (i = 0; i < len; i++)
check[j--] = part[i];
check[len] = '\0';
return (!(strcmp(part, check)));
}
int main()
{
char input[501];
char part[501];
cin.getline(input, 500);
int i, j, k, t, len, n;
len = strlen(input);
for (n = 2; n <= len; n++)
{
for (i = 0; i <= len - n; i++)
{
memset(part, 0, 501);
part[0] = input[i];
k = 1;
for (j = i + 1; j < i + n; j++)
part[k++] = input[j];
part[k] = '\0';
if (Huiwen(part))
{
for (t = 0; t < k; t++)
cout << part[t];
cout << endl;
}
}
}
return 0;
}
|
49 | 24447 | 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 | 24448 | 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 | 24449 | void main()
{
int i,j,p,m,b,c;
char a[500];
scanf("%s",&a);
c=strlen(a);
for(i=0;i<c;i++)
{
if(a[i]==a[i+1])
printf("%c%c\n",a[i],a[i]);
}
for(p=3;p<c;)
{
for(i=0;i<c-p;i++)
{
b=0;
for(m=0;m<p/2+1;m++)
{
if(a[i+m]==a[p-m+i])
{b++;}
}
if(b==(p/2)+1)
{
for(j=i;j<=i+p;j++)
{
printf("%c",a[j]);
}
printf("\n");
}
}
p+=2;
}
}
|
49 | 24450 | int main()
{
char a[500];
cin.getline(a,500,'\n');
int b=strlen(a);
int wide=2;
while(1)
{
for(int i=0;i<b-1;i++)
{
if(a[i]==a[i+1])
{
if(i+1-i+1==wide)
cout<<a[i]<<a[i+1]<<endl;
int m=i,n=i+1;
while(1)
{
m--;
n++;
if(a[m]==a[n])
{
if(n-m+1==wide)
for(int k=m;k<=n;k++)
cout<<a[k];
cout<<endl;
}
else
break;
}
}
}
wide+=2;
if(wide==b+2)
break;
}
return 0;
}
|
49 | 24451 | 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 | 24452 | int main(){
char a[501];
int k;
cin.getline(a,501);
for(int i=1;i<=strlen(a);i++)
for(int j=0;j<=(strlen(a)-i);j++){
for(k=0;k<=i/2;k++){
if(a[j+k]!=a[j+i-k])break;
}
if(k==(i/2+1)){
for(int l=j;l<=j+i;l++)
cout<<a[l];
cout<<endl;
}
}
return 0;
}
|
49 | 24453 | 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 | 24454 | 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 | 24455 | int main()
{
int i,j,k,n;
char a[501];
cin.getline(a,501);
n=strlen(a);
for(i=2;i<=n;i++)
{
for(j=0;j<=n-i;j++)
{
for(k=0;k<=i/2;k++)
{
if(a[j+k]!=a[j+i-1-k])
break;
}
if(k==i/2+1)
{
for(k=j;k<=j+i-1;k++)
cout<<a[k];
cout<<endl;
}
}
}
return 0;
} |
49 | 24456 | void main()
{
char c[500];
scanf("%s",&c);
int i,j,k,l;
for(i=2;i<=strlen(c);i++)
{
for(j=0;j+i-1<strlen(c);j++)
{
char s1[500]={'\0'},s2[500]={'\0'};
for(k=j;k<=j+i-1;k++)
{
s1[k-j]=c[k];
}
for(l=0;l<i;l++)
{
s2[l]=s1[i-l-1];
}
if(strcmp(s1,s2)==0)
printf("%s\n",s1);
}
}
} |
49 | 24457 | /*
* 1.cpp
*
* Created on: 2011-12-19
* Author: 1100012870
*/
char s[501];
void print(int x,int y) //??????s???x??y?????
{
int i;
for(i=x;i<=y;i++)cout<<s[i];
cout<<endl;
}
int check(int x,int y) //?????????????
{
while(x<y && s[x]==s[y]){ //????????????
x++;
y--;
}
if(x>=y) return 1;
return 0;
}
int main()
{
int i,j,l;
cin.getline(s,501);
l=strlen(s);
for(i=1;i<=l;i++) //????2???????
for(j=0;j<l;j++)
if(j+i<l && check(j,j+i)==1)
print(j,j+i);
return 0;
}
|
49 | 24458 | int f(char(num[]));
int main()
{
int len , i , j , k;
char str[500] , real[500];
cin >> str ;
len = strlen(str) ;
for(i = 2 ; i <= len ; i++)
for (j = 0 ; j < len - i + 1 ; j++)
{
for (k = 0 ; k < i ; k++)
real[k] = str[j + k] ;
real[i] = '\0' ;
if (f(real)) cout << real << endl ;
}
return 0 ;
}
int f(char(num[]))
{
int len , i;
char another[500];
len = strlen(num);
for(i = 0 ; i < len ; i++)
another[i] = num[len -1 -i] ;
another[len] = '\0' ;
if (strcmp(another,num) == 0) return 1 ;
else return 0 ;
} |
49 | 24459 | 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 | 24460 |
int main()
{
char a[500];
char b[500];
int len,i,j,k,judge;
fgets(a,500,stdin);
len=strlen(a)-1;
for(i=0;i<len;i++)
b[len-1-i]=a[i];
for(i=2;i<=len;i++)
for(j=0;j<=len-i;j++)
{
judge=0;
for(k=0;k<=i-1;k++)
{
judge=judge+(a[j+k]-b[len-i-j+k])*(a[j+k]-b[len-i-j+k]);
}
if(judge==0)
{
for(k=0;k<=i-1;k++)
printf("%c",a[j+k]);
printf("\n");
}
}
return 0;
}
|
49 | 24461 | 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 | 24462 | /*
*@ 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 | 24463 | void main()
{
int i=2,j,k,t,m,h,x,p;
char s[1000],b[1000][1000];
gets(s);
m=strlen(s);
for(i=2;i<=m;i=i+2)
{
for(k=0;k<=m-i;k++)
{
h=0;
x=1;
for(j=k;j<=k+i-1;j++)
{
b[k][j]=s[i+k-x];
x++;
}
for(t=k;t<=k+i-1;t++)
{
if(b[k][t]!=s[t])
{ h=1;
break;
}
}
if(h==0)
{
for(p=k;p<=k+i-1;p++)
printf("%c",s[p]);
printf("\n");
}
}
}
}
|
49 | 24464 | /**
* @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 | 24465 | int main()
{
char s[501];
gets(s);
int i,p,q,l,n,j;
n=strlen(s);
for(l=1;l<n;l++)
for(i=0;i<n-l;i++)
{
p=i;
q=i+l;
while(s[p]==s[q]&&p<q)
{
p++;
q--;
}
if(q<=p)
{
for(j=i;j<=i+l;j++)
printf("%c",s[j]);
printf("\n");
}
}
return 0;
} |
49 | 24466 | int main()
{
char str[505] = {0};
cin >> str;
int length = strlen(str);
for (int l = 2 ; l <= length ; l++)
{
for (int i = 0; i <= length - l; i ++)
{
if (str[i] == str[i + l - 1])
{
int m = i + 1, n = i + l - 2;
for (; m <= n ; m ++, n--)
{
if (str[m] != str[n])
break;
}
if (m > n)
{
for (int m = i ; m <= i + l - 1; m++)
cout << str[m];
cout << endl;
}
}
}
}
cin.get();
cin.get();
return 0;
} |
49 | 24467 | //????
//2010?11?24?
//1000012753 ???
char str[1000];
int cycle(int a, int b)
{
while (b >= 0)
{
if (str[a] == str[a + b - 1])
{
a++;
b -= 2;
}
else
return 1;
}
return 0;
}
int main()
{
int i, j, k, l;
cin >> str;
l = strlen(str);
for (i = 2; i <= l; i++)
for (j = 0; j <= l - i; j++)
if (cycle (j, i) == 0)
{
for (k = j; k < j + i; k++)
cout << str[k];
cout << endl;
}
return 0;
} |
49 | 24468 | 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 | 24469 | 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 | 24470 | int main()
{
char s[502];
int l = 0,k = 0,ii = 0,m = 0,step = 0,num = 0,flag = 0,i = 0,j = 0;
cin >> s;
l = strlen (s);
for (j = 2;j <= l;j++) //j?????
{
for (i = 0;i <= l-j;i++) //i??????
{
flag = 1;
for (ii = 1;ii <= j / 2;ii ++)
{
k = i + j - ii;
if (s[i + ii - 1] != s[k])
{
flag = 0;
break;
}
}
if (flag == 1)
{
for (ii = i;ii <= i + j - 1;ii++)
cout << s[ii];
cout << endl;
}
}
}
return 0;
}
|
49 | 24471 | int main()
{
char c[505]={0};
cin.getline(c,505,'\n');
int num,i,j,k,standard,sum=0,q;
for(num=0;;num++)
{
if(c[num]=='\0')
break;
}
for(i=2;i<=num;i++) //??????
{
for(k=0;k<=num-i;k++) //?a[0]???a[num-i]
{
sum=0;
for(j=k;j<=k+i-1;j++)
{
if(c[j]==c[2*k+i-1-j])
standard=1;
else
standard=0;
sum=sum+standard;
}
if(sum==i)
{
for(q=k;q<k+i-1;q++)
cout<<c[q];
cout<<c[k+i-1]<<endl;
}
}
}
return 0;
} |
49 | 24472 |
void string1(char* a, int* x1, int* x2, int len);
void string2(char* a, int* x1, int* x2, int len);
void out(int q,int len, char* a);
int main()
{
char a[501];
int x1[501] = {0};
int x2[501] = {0};
cin >> a;
int j = 0;
for (int i = 1; a[i] != '\0'; i++)
{
if (a[i - 1] == a[i])
{
cout << a[i - 1] << a[i] << endl;
x1[j] = i;
j++;
}
}
j = 0;
for (int i = 1; a[i + 1] != '\0'; i++)
{
if (a[i - 1] == a[i + 1] && a[i] != a[i - 1])
{
cout << a[i - 1] << a[i] << a[i + 1] << endl;
x2[j] = i;
j++;
}
}
//??????2?3???,??????
string1(a, x1, x2, 3);//??????????
}
void string2(char* a, int* x1, int* x2, int len)//len(??)??????
{
int temp1 = 0,temp2 = 0;
for (int i = 0; x1[i] != 0; i++)
{
if(a[x1[i] + len / 2 - 1] == a[x1[i] - len / 2] && x1[i] + len / 2 - 1 != 0 && x1[i] + len / 2 - 1 < 501 && x1[i] - len / 2 >= 0)//?????
{
out(x1[i] - len / 2,len,a);
x1[temp2] = x1[i];
temp2++;
}
}
x1[temp2] = 0;
if(x1[0] == 0 && x2[0] == 0)
exit(0);//?????????????????
string1(a, x1, x2, ++len);
}
void string1(char* a, int* x1, int* x2, int len)//len(??)??????,?string1????
{
int temp1 = 0,temp2 = 0;
for (int i = 0; x2[i] != 0; i++)
{
if(a[x2[i] + len / 2] == a[x2[i] - len / 2] && x2[i] + len / 2 != 0 && x2[i] + len / 2 < 501 && x2[i] - len / 2 >= 0)//?????
{
out(x1[i] - len / 2,len,a);
x2[temp2] = x2[i];//??x2???????
temp2++;
}
}
x2[temp2] = 0;
if(x1[0] == 0 && x2[0] == 0)
exit(0);//?????????????????
string2(a, x1, x2, ++len);
}
void out(int q,int len, char* a)//???????
{
for (int i = 0; i < len; i++)
cout << a[q + i];
cout << endl;
}
|
49 | 24473 | 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 | 24474 | //***********************************************
//* ???? *
//* ?????? *
//* ?????2011?11?13? *
//***********************************************
void huiwen(char a[], int k, int n)//??????
{
int i, j;
for(i = 0; i <= n - k; i ++)//??????
{
for(j = i; j < k / 2 + i; j ++)//??????????
{
if(a[j] != a[k + i * 2 - 1 - j])//???????
break;//?????
}
if(j == k / 2 + i)//??????????????
{
for(j = i; j <= k - 1 + i; j ++)
cout << a[j];//????????
cout << endl;
}
}
return;
}
int main()
{
char a[501];
int k, n;
cin.get(a, 500);//?????
n = strlen(a);//??????
for(k = 2; k <= n; k ++)
{
huiwen(a, k, n);//??????
}
return 0;
} |
49 | 24475 | 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 | 24476 |
int main()
{
char str[500];
cin>>str;
int i;
int size=strlen(str);
for(i=1;i<size;i++)
{
int h,t;
for(h=0;h<size-i;h++)
{
int h1=h;
t=h+i;
int m;
for(;h1<t;h1++,t--)
if(str[h1]!=str[t])
break;
if(h1>t)
{
for(m=h;m<=h+i;m++)
cout<<str[m];
cout<<endl;
}
}
}
cin.get();cin.get();cin.get();
return 0;
}
|
49 | 24477 | int main ()
{
char str[501];
cin >> str;
int len = strlen(str);
int i=0, n=0, m=0, k=0, j=0,flag=0;
for (i = 2; i <= len; i++)
{
for (j = 0; j <= len - i; j++)
{
for (n = j, m = i + j - 1; n < m; n++, m--)
{
flag = 1;
if (str[n] != str[m])
{
flag = 0;
break;
}
}
if (flag)
{
for (k = j; k <= i + j - 1; k++)
cout << str[k];
cout << endl;
}
}
}
return 0;
} |
49 | 24478 |
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 | 24479 | //****************************************************
//* ? ? ?: homework.cpp *
//* ? ?: ??? *
//* ????: 2012?11?10? *
//* ????: ???? *
//****************************************************
int main()
{
char st[502] = {0};
int len, longs, j, k, f; //len????
cin >> st;
len = strlen (st);
for (k = len + 1; k >= 0; k--) st[k + 1] = st[k]; //?????
st[0] = '\0';
for (longs = 2; longs <= len; longs++) //?????????
{
for (j = 1; j <= len - longs + 1; j++) // ??????
{
f = 1;
for (k = j; k <= j + longs - 1; k++) //?????????
{
if (st[k] != st[j + longs - 1 - k + j])
{
f = 0;
break;
}
}
if (f) //??????
{
for (k = j; k <= j + longs - 1; k++) cout << st[k];
cout << endl;
}
}
}
return 0;
}
|
49 | 24480 | 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 | 24481 |
void find (char target[])//??
{
int count = 0;
int i,j,k;
int flag;
char change[500];
for (i = 0;i <= 500;i++)//????????
{
if (target[i] != '\0')
count++;
else
break;
}
for (i = 2;i <= count;i++)//??????
{
for (j = 0;j <= count - i;j++)//????????
{
flag = 1;
for (k = j;k <= j + i - 1;k++)
change[k] = target[k];
for (k = 0;k <= i / 2 - 1;k++)//???????????
{
change[j + k] = target[j + i - 1 - k];
change[j + i - 1 - k] = target[j + k];
}
for (k = 0;k < i - 1;k++)
{
if (change[j + k] != target[j + k])
flag = 0;
}
if (flag == 1)//?????????????
{
for (k = j;k <= j + i - 1;k++)
cout<<target[k];
cout<<endl;
}
}
}
}
int main()
{
char target[500];
cin.getline(target,500);
find(target);
return 0;
} |
49 | 24482 | 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 | 24483 | int main()
{
char c[500];
int x,y,i,j,k,l,m,p=0;
gets(c);
char a[500];
strcpy(a,c);
for(i=0;;i++)
{
if(c[i]=='\0') break;
}
for(k=1;k<i;k++)
{
for(j=0;c[k+j]!='\0';j++)
{
p=0;
strcpy(c,a);
x=c[j];y=c[k+j];
if(x!=y) p=1;
else for(l=1;x==y;l++)
{
x=c[j+l];
y=c[k+j-l];
if(x!=y){p=1; break;}
else if(j+l>=k+j-l) break;
}
if(p==0)
{
for(m=j;m<=k+j;m++)
{
printf("%c",c[m]);
}
printf("\n");
}
}
}
return 0;
} |
49 | 24484 | /*
* draft2.cpp
*
* Created on: 2014-1-4
* Author: Mac
*/
char a[600], b[100], b1[100], *p;
int main()
{
cin >> a;
for(int len = 1; len < strlen(a); len++)
for(int i = 0; i < strlen(a) - len; i++)
{
int j = 0;
for(j = 0; j <= len/2; j++)
{
if(a[i+j] != a[i+len-j])
break;
}
if (j == len/2 + 1)
{
for(int t = 0; t <= len; t++ )
cout << a[i+t];
cout << endl;
}
}
}
|
49 | 24485 | 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 | 24486 | /**
*@file 1000012767_5.cpp
*@author ??
*@date 2010.11.24
*@description
* ???????????
*/
int len; //???? len ?????
void palindrome(char[], int); //???????????????????
void palindrome(char p[], int lenth)
{ //p ??????????????lenth ???????
int j, k, final, judge; //j ??????????????k ?????????
//final ???????????judge ???????????
final = lenth / 2; //???????????????????????????????
for (j = 0; j <= len - lenth; j++) //?????????????
{
judge = 0; //judge ? 0 ???????1 ????
for (k = 1; k <= final; k++) //??????????????
{
if (p[j + k - 1] != p[j + lenth - k])
{
judge = 1; //????????????????????????????
break;
}
}
if (judge == 0) //??????????????????
{
for (k = j; k <= j + lenth - 1; k++)
cout << p[k];
cout << endl;
}
}
}
int main() //???
{
char a[501]; //a ???????????
int i;
cin >> a;
len = strlen (a);
for (i = 2; i <= len; i++)
//i ????????????
palindrome(a, i); //??????????????????????????????
return 0;
} |
49 | 24487 |
char s[500];
int substr(char s[], int start, int end)
{
while ((end>start)&&(s[start]==s[end]))
{
start++; end--;
}
if(end>start)
return 0;
else
return 1;
}
void osubstr(char s[], int start, int end)
{
int i;
for(i=start;i<=end;i++)
putchar(s[i]);
putchar('\n');
}
int main()
{
unsigned int m,n,width;
gets(s);
for(width=1; width<strlen(s); width++)
for(m=0; m<=strlen(s)-width;m++)
if(substr(s, m, m+width))
osubstr(s, m, m+width);
} |
49 | 24488 | int main()
{
char str[502];
cin >> str;
int i,j,len1,len2;
len1 = strlen(str);
for(len2 = 2; len2 < len1; len2++)
{
for(i = 0; i < len1; i++)
{
for(j = i; j < i + len2; j++)
{
if(str[j] != str[2 * i + len2 - 1 - j])
break;
}
if(j == i + len2)
{
for(j = i; j < i + len2; j++)
cout << str[j];
cout << endl;
}
}
}
return 0;
} |
49 | 24489 | int main()
{
void isHuiwen(char s0[500], int i);
char str[500];
char s0[500];
int i, j, k, l;
gets(str);
l = strlen(str);
for (i = 2;i < l;i++)
{
for(j = 0;j <= l - i;j++)
{
for(k = 0;k <= i;k++)
s0[k] = str[k + j];
isHuiwen(s0, i);
}
}
return 0;
}
void isHuiwen(char s0[500], int i)
{
int p;
for(p = 0;p <= i/2;p++)
{
if(s0[p] != s0[i - 1 -p])
return;
}
for(p = 0;p < i;p++)
printf("%c",s0[p]);
printf("\n");
return;
} |
49 | 24490 | 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 | 24491 | int main()
{
char s[1000];
int i,j,k,l,t;
gets(s);
l=strlen(s);
for(j=1;j<l;j++)
{
for(i=0;i+j<l;i++)
{
for(k=0;k<=j;k++)
{
if(s[i+k]==s[i+j-k])
t=1;
else
{
t=0;
break;
}
}
if(t==1)
{
for(k=i;k<=i+j;k++)
printf("%c",s[k]);
printf("\n");
}
}
}
return 0;
}
|
49 | 24492 | //***********************
//???????
//?????? 1200012914
//???2012.11.11
//***********************
int main()
{
char str[501]; //?????\0
int len; //???????len
int i, j, k, l; //??????
cin >> str; //????
len = strlen(str); //????????
for (i = 2; i <= len; i++) //??????????2????len
{
for (j = 0; j <= len - i; j++)
//????????i??????????????len-i+1?
//?????len-i???
{
for (k = 1; k <= i / 2; k++)
//?????????????????i/2?????
{
if (str[j + k - 1] != str[j + i - k]) break;
//?????????????????
}
if (k == i / 2 + 1) //k=1/2+1???????????????
{
for (l = j; l < j + i; l++)
//????????j????i?????????j+i-1??
{
cout << str[l];
}
cout << endl; //????????????
}
}
}
return 0;
}
|
49 | 24493 |
int main()
{
char a[502],b[50000][4],t[4];
char z;
int i,j,k,m,n,p,q,r,s,u;
int count=0;
n=0;
z=cin.get();
while(z!='\n')
{
n++;
a[n]=z;
z=cin.get();//1?n n??? a[n]
}
for(i=1;i<=n-1;i++)//????????????kaoshiwuyali
{
for(j=1;i+j-1>=1&&i+j-1<=n;j++)
{
if((int)a[i+j-1]==(int)a[i-j])
{
b[count+1][1]=i-j;//????
b[count+1][2]=i+j-1;//????
b[count+1][3]=2*j;//??
count++;
}
else
{
break;
}
}
for(k=1;i-k<=n&&i+k<=n;k++)
{
if((int)a[i+k]==(int)a[i-k])
{
b[count+1][1]=i-k;
b[count+1][2]=i+k;
b[count+1][3]=2*k+1;
count++;
}
else
{
break;
}
}
}
for(p=1;p<=count-1;p++)
{
for(m=1;m<=count-p;m++)
{
if(b[m][3]>b[m+1][3]||(b[m][3]==b[m+1][3]&&b[m][1]>b[m+1][1]))
{
for(q=1;q<=3;q++)
{
t[q]=b[m+1][q];
b[m+1][q]=b[m][q];
b[m][q]=t[q];
}
}
}
}
for(r=1;r<=count;r++)
{
for(s=b[r][1];s<=b[r][2];s++)
{
cout<<a[s];
}
cout<<endl;
}
return 0;
}
|
49 | 24494 | 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 | 24495 | int main()
{
char str[500];
cin >> str;
int l = strlen(str), i, j, m = 1, count = 0;
for (m = 1; m < l; m++)
{
for (i = 0; i < l - m; i++)
{
count = 0;
for (j = 0; j <= m / 2 + 1; j++)
{
if (str[i + j] != str[i + m - j])
continue;
else
count++;
}
if (count >= j)
{
for (j = i; j <= i + m; j++)
cout << str[j];
cout << endl;
}
}
}
return 0;
} |
49 | 24496 | //????
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 | 24497 | //*************************************************************
//* ????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 | 24498 | int main()
{
char a[501];
int i,k,len,l;
gets(a);
l=strlen(a);
for(len=2;len<=l;len++)
{
for(i=0;i<=l-len;i++)
{
if(a[i]==a[i+len-1])
{
for(k=1;k<=len/2;k++)
{
if(a[k+i]!=a[i+len-1-k])
break;
}
if(k>len/2)
{
for(k=i;k<i+len;k++)
printf("%c",a[k]);
printf("\n");
}
}
}
}
return 0;
} |
49 | 24499 | 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;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.