id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
24,100 | char c[500];
int f(int e0,int s0);
int main(){
int i,j,k,e,s;
scanf("%s",c);
int len;
len=strlen(c);
for(i=0;i<len;i++){
for(j=0;j<len;j++){
if(j-i>=0&&i+j+1<=len){
if(c[j-i]==c[i+j+1]){
s=j-i;
e=i+j+1;
if(f(e,s)){
for(k=s;k<=e;k++)
printf("%c",c[k]);
printf("\n");
}
}
}
}
}
return 0;
}
int f(int e0,int s0){
int i0,sum=0;
for(i0=s0;i0<=e0;i0++){
if(c[i0]!=c[s0+e0-i0])
sum++;
}
if(sum==0)
return 1;
else return 0;
} | 49 |
24,101 | int main()
{
char str[503];
int i, j, k, p, m, l;
cin >> str;
l=strlen(str);
for (m=2;m<=l;m=m+1)
{
for (i=0;str[i+1]!='\0';i++)
{
if (m%2==0)
{
j=i;
p=i+1;
}
else
{
j=i-1;
p=i+1;
}
while (str[j]==str[p]&&j>=0&&str[p]!='\0')
{
j--;
p++;
if ( p!=(i+1) && ((p-j-1)==m) )
{
for (k=j+1;k<p;k++)
cout << str[k];
cout << endl;
}
}
}
}
return 0;
} | 49 |
24,102 | int main()
{
char a[512],b[512],c[512],d[512];
int i,len,k,j;
gets(a);
len=strlen(a);
for(i=1;i*2<=len;i++)
{
k=0;
for(j=0;j+2*i<=len;j++)
{
for(k=0;k<i;k++)
{
b[k]=a[j+k];
b[2*i-1-k]=a[j+2*i-1-k];
c[k]=a[j+k];
d[k]=a[j+2*i-1-k];
}
b[2*i]=0;
c[i]=0;
d[i]=0;
if(!strcmp(c,d))
printf("%s\n",b);
}
}
return 0;
} | 49 |
24,103 | 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 |
24,104 | int main()
{
int i,j,k,m,n;
char st[500];
scanf("%s",st);
for(i=2;i<=500;i++)
{
for(j=0;j<500-i+1;j++)
{
if(st[j]=='\0')
break;
m=j+i-1;
for(k=j;k<m;k++)
{
if(st[k]!=st[m])
break;
else
m=m-1;
}
if(k>=m)
{
for(n=j;n<j+i;n++)
{
printf("%c",st[n]);
if(n==j+i-1)
printf("\n");
}
}
}
}
}
| 49 |
24,105 | int main()
{
char a[100],c[50][50],e[50];
int i,j,k,l,b,d=0;
for(i=0;;i++)
{
scanf("%c",&a[i]);
if(a[i]=='\n')
break;
}
for(j=0;j<i;j++)
{
for(k=j+1;k<=i;k++)
{
b=0;
for(l=j;l<=k;l++)
{
if(a[l]!=a[k+j-l])
{
b=1;
break;
}
}
if(b==0)
{
for(b=j;b<=k;b++)
c[d][b-j]=a[b];
c[d][k-j+1]='\0';
d++;
}
}
}
for(i=2;i<100;i++)
{
for(j=0;j<d;j++)
{
if(strlen(c[j])==i)
printf("%s\n",c[j]);
}
}
return 0;
} | 49 |
24,106 | int main()
{
char a[501]={0};
int i,j,k,t,m,q,p=0;
gets(a);
int b[501]={0};
for(i=0;a[i]!='\0';i++)
if(a[i]==a[i+1])
b[i]=1;//????????
for(j=1;j<250;j++)//j????????? xuyaoxiugai!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
{
for(q=0;q<500;q++)
{ p=0;
if(b[q]==1)
{
for(t=0;t<j;t++)//<<<<<<<<<<========????????
{if(a[q-t]==a[q+t+1])
p++;}
if(p==j)
{for(m=0;m<2*j;m++)
printf("%c",a[q-t+m+1]);
printf("\n");}
}}
}} | 49 |
24,107 | int main()
{
char str[500];
int i, j, k, s, length;
cin.getline(str,500);
length = strlen(str);
for (i = 2; i <= length; i++)
{
for (j = 0; j <= length - i; j++)
{
for (k = j; k < j + i/2; k++)
{
if (str[k] != str[2 * j + i - k - 1])
{
break;
}
}
if (k == j + i/2)
{
for (s = j; s < j + i; s++)
cout << str[s];
cout << endl;
}
}
}
return 0;
} | 49 |
24,108 | //********************************
//*???4.cpp **
//*?????? 1200012768 **
//*???2012.11. **
//*??????? **
//********************************
int main()
{
char ch[500];
int i = 0, j, k, len, flag = 1;
do
{
cin.get(ch[i]);
if (ch[i] == '\n')
break;
i++;
} while (i < 500);
ch[i] = '\0';
len = strlen(ch);
for (j = 2; j <= len; j++)
{
for (i = 0; i <= len - j; i++)
{
for (k = i; k <= i + (j - 1) / 2; k++)
if (ch[k] != ch[2 * i + j - 1 - k])
{
flag = 0;
break;
}
if (flag == 1)
{
for (k = i; k < i + j; k++)
cout << ch[k];
cout << endl;
}
flag = 1;
}
}
return 0;
}
| 49 |
24,109 | /*
* file homework 9_5
* author ??
* date 2010-11-24
* description
???????????????????
*/
int main()
{
char str[501];
int i, j, k, len;
cin >> str;
len = strlen(str);
for (i = 2; i <= len; i ++)
for (j = 0; j <= len - i; j ++)
{
for (k = 0; k <= (i - 1) / 2; k ++)
if (str[j + k] != str[j + i - 1 - k])
break;
if (k > (i - 1) / 2)
{
for (k = 0; k < i; k ++)
cout << str[j + k];
cout << endl;
}
}
return 0;
}
| 49 |
24,110 | int main()
{
char a[500],temp[500],temp2[500];
int i,k,j,b;
gets(a);
b=strlen(a);
for(i=2;i<=b;i++)
{
for(j=0;j<b-i+1;j++)
{
strncpy(temp,&a[j],i);
for(k=0;k<i;k++)
{
temp2[k]=temp[i-k-1];
}
temp[i]='\0';
temp2[i]='\0';
if(strcmp(temp,temp2)==0) printf("%s\n",temp);
}
}
} | 49 |
24,111 | 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)
{
if(h==0)
{
for (l=0; l < k;l++)
{cout << a[t++];e[y][l]=a[t];}
y++;
cout<<'\n';
h=1;
}
else
{
for(b=0;b<y;b++)
{
for(z=0;z<k;z++)
{
if(a[x]==e[b][z])
{
p[b]++;
}
x++;
}
}
r=0;
for(q=0;q<y;q++)
{
if(p[q]==k)
{
r=1;
}
}
for(q=0;q<10;q++)
p[q]=0;
if(r!=1)
{
for (l=0; l < k;l++)
{cout << a[t++];e[y][l]=a[t];}
y++;
cout<<'\n';
}
}
}
}
h=0;
}
return 0;
}
void panDuan(int a)
{
if(a!=1)
cout<<"false"<<endl;
}
| 49 |
24,112 | 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;
} | 49 |
24,113 |
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 |
24,114 |
void f(char a[500])
{
int i,n;
char b[500];
n=strlen(a);
for(i=0;i<=499;i++)
{
if(i<=n-1) b[i]=a[n-1-i];
else b[i]='\0';
}
if(strcmp(a,b)==0) puts(a);
}
void main(void)
{
char s[500];
gets(s);
int n=strlen(s);
int l;
for(l=1;l<=n-1;l++)
{
char a[500];
int i;
for(i=0;i<=n-1-l;i++)
{
int k;
for(k=0;k<=499;k++)
{
if(k<=l) a[k]=s[i+k];
else a[k]='\0';
}
f(a);
}
}
} | 49 |
24,115 | 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 |
24,116 | //*************************************************
//***???????***
//***??????***
//***???2012.11.14***
//*************************************************
int main ()
{
int i = 0,j,k,p,length;
char a[100];
do
{
a[i] = getchar();
}
while (a[i++] != '\n'); //?????
length = i; //???????
for (i = 2; i <= length; i++) //??????????????
{
for (j = 0; j <= length - i - 1; j++) //??????????????
{
p = 1;
for (k = 0; k <= (i - 1) / 2; k++)
{
if (a[j + k] != a[j + i - 1 - k]) //?????????????
p = 0;
}
if (p == 1)
{
for (k = j; k < i + j; k++)
cout << a[k];
cout << endl;
}
}
}
return 0;
} | 49 |
24,117 | void main()
{
int i,j,h,k,r;
char a[500],b[500],c[500];
gets(a);
h=strlen(a);
for(i=2;i<=h;i++)
{
for(j=0;j<=h-i;j++)
{
char b[500]={0},c[500]={0};
for(k=j,r=0;r<i;k++,r++)
{
b[r]=a[k];
c[i-r-1]=a[k];
}
if(strcmp(b,c)==0)
printf("%s\n",b);
}
}
}
| 49 |
24,118 |
int main()
{
char str[501];
int l;
int cnt;
cin >> str;
l = strlen(str);
for (int i = 2; i <= l; i++)
for (int j = 0; j <= l - i; j++)
{
cnt = 0;
for (int k = 0; k <= i - 1; k++)
if (str[j + k] == str[j + i - 1 - k])
cnt++;
if (cnt == i)
{
for (int k = j; k <= j + i - 2; k++)
cout << str[k];
cout << str[j + i - 1] << endl;
}
}
return 0;
} | 49 |
24,119 | int main()
{
char s[80],*h,*t,*f;
int i,j,len,flag=1;
scanf("%s",s);
len=strlen(s);
for(i=2;i<=len;i++)
{
f=s;
for(;f<=(s+len-i);f++)
{
h=f;
t=h+i-1;
for(j=1;j<=(int)(i/2);j++,h++,t--)
{
flag=1;
if(*h!=*t)
{
flag=0;
break;
}
}
if(flag)
{
h=f;
for(;h<f+i;h++)
printf("%c",*h);
printf("\n");
}
}
}
return 0;
} | 49 |
24,120 | 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 |
24,121 | int main()
{
char s[500];
int length,l,i,j,p,k;
cin>>s;
length=strlen(s);
for(l=2;l<=length;l++)
for(i=0;i<length-l+1;i++)
{
int flag=0;
for(j=i,p=1;j<l/2+i;j++)
{
if(s[j]!=s[j+l-p])
{
flag=1;
break;
}
else
p+=2;
}
if(flag==0)
{
for(k=i;k<i+l;k++)
cout<<s[k];
cout<<endl;
}
}
return 0;
}
| 49 |
24,122 | //**********?????????*****************
//**********???????*********************
//**********?????2012?11?9?************
//**********???1200062701******************
int main()
{
int totallength = 0, flag = 0; //??????????
char a[500];
cin >> a; //???????
for(int b = 0; b < 500; b++)
{
if(a[b] == 0) break; //???????
else
{
totallength++;
}
} //????????
for(int length = 2; length <= 500; length ++)
{
for(int j = 0; j <= totallength - length + 1; j++)
{ //????????????
for(int k = 0; k < length / 2; k++)
{
if(a[j + k] == a[j + length - 1 - k])
{
flag++; //???????
}
}
if(flag == length / 2) //?????????
{
for(int l = j; l <= j + length - 1; l++)
{
cout << a[l];
flag = 0; //???????
}
cout << endl; //???????
} //??????
else
{
flag = 0; //?????????
}
}
}
return 0;
}
| 49 |
24,123 | int main()
{
char a[500];
char t[500];//???
char b[1000][500];//?????
cin>>a;
int i,j,k,r;
int count=0;
int l=strlen(a);
for(i=0;i<l;i++)
{
for(k=1;i+k<l;k++)
{
int h=1;//????????
for(j=0;j<=k;j++)
{
if(a[i+j]!=a[i+k-j])
{
h=0;
break;
}
}//??????????????????
if(h==1)
{
for(j=0;j<=k;j++)
{
b[count][j]=a[i+j];
}
count++;
}//???????????b
}
}
for(i=0;i<count;i++)
{
for(j=count-2;j>=i;j--)
{
if( strlen(b[j])>strlen(b[j+1]) )
{
strcpy(t,b[j]);
strcpy(b[j],b[j+1]);
strcpy(b[j+1],t);
}//??????????
}
}
for(r=0;r<count;r++)
{
cout<<b[r]<<endl;
}//??
return 0;
}
| 49 |
24,124 | void judge(int start,int l);
char str[505];
int main()
{
cin>>str;
int l=strlen(str);
for(int i=2;i<=l;i++)
{
for(int j=0;j<=l-i;j++)
{
judge(j,i);
}
}
return 0;
}
void judge(int start,int l)
{
int flag=1;
for(int i=0;i<l/2;i++)
{
if(str[start+i]!=str[start+l-1-i])
{
flag=0;
break;
}
}
if(flag==1)
{
for(int i=start;i<start+l;i++)
{
cout<<str[i];
}
cout<<endl;
}
}
| 49 |
24,125 | int main ()
{
char s[501],t[501];
int i,j,l,c,d,temp=0,m,n=0;
scanf("%s",s);
l=strlen(s);
for (i=1;i<=l;i++)
{
for (j=0;j<l-i;j++)
{
d=j+i;
c=j;
while (c<d)
{
if(s[c]==s[d])
{
c++;d--;
}
else
{
temp=1;
break;
}
}
if (temp==0)
{
for (m=j;m<=j+i;m++)
{
t[n]=s[m];
t[n+1]='\0';
n++;
}
printf("%s\n",t);
n=0;
} temp=0;
}
}
return 0;
} | 49 |
24,126 | int main()
{
int i,j,k=1,l,m,n;
char a[501];
gets(a);
l=strlen(a);
for (m=1;m<l;m++)
{
for (i=0;i<l;i++)
{
j=i+m;
if (a[i]==a[j])
{
for (k=m;k>0;k--)
{
if (a[i+k]!=a[j-k])
{
k=1;
break;
}
}
if (k==0)
{
n=i;
for (;n<=j;n++)
putchar(a[n]);
printf ("\n");
}
}
}
}
return 0;
}
| 49 |
24,127 |
int main()
{
int i,j,a,h=0,k=0,m=0;
char str[500];
gets(str);
a=strlen(str);
for(j=1;j<(a-1);j++){
for(i=0;(i+j)<a;i++){
if((j-1)%2==0){
for(k=0;k<=(j-1)/2;k++){
if(str[i+k]!=str[i+j-k])
h=1;
}
}
else{
for(k=0;k<=j/2;k++){
if(str[i+k]!=str[i+j-k])
h=1;
}
}
if(h==0){
for(h=0;h<j;h++)
printf("%c",str[i+h]);
printf("%c\n",str[i+j]);
}
h=0;
}
}
return 0;
} | 49 |
24,128 | 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 |
24,129 | int main()
{
char a[500];
int i,j,k,m;
gets(a);
int len=strlen(a);
for(i=2;i<=len;i++)
{
for(j=0;j<=len-i;j++)
{
for(k=0;k<i;k++)
{
if(a[j+k]!=a[j+i-1-k])
break;
}
if(k==i)
{
for(m=0;m<i;m++)
putchar(a[j+m]);
printf("\n");
}
}
}
return 0;
} | 49 |
24,130 | /* ?????????????????*/
int huiwen(char *a){
int i,j,len;
len=strlen(a);
/*?????2?????????*/
for(i=len/2-1,j=len/2;i>=0&&j<len;i--,j++){
if(a[i]!=a[j]) break;
}
if(i<0) return 1;
else return 0;
}
int main(){
char a[501],tmp[501];
int i,j,k,len;
scanf("%s",a);
len=strlen(a);
/*?????????1*/
if(len<=1) return 0;
/*?????????????????????2?4?6?8????*/
for(i=2;i<=len;i+=2){
/*??????????????????????????????i???????????????*/
for(j=0;j+i<=len;j++){
/*??for?????????? ?i??????tmp?? */
for(k=0;k<i;k++)
tmp[k]=a[k+j];
/* ?????????????*/
tmp[k]='\0';
/*??????????????????????*/
if(huiwen(tmp)==1) printf("%s\n",tmp);
}
}
getchar();
getchar();
return 0;
}
| 49 |
24,131 |
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 |
24,132 | void shuchu(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++)
{
if(l == j-1)
cout << b[i + l]<<endl;
else
cout << b[i + l];
}
}
}
}
}
int main()
{
int m;
char a[501];
for (m = 1; m > 0; m++)
{
if (a[m-1]== '\n')
break;
a[m] = cin.get();
}
shuchu(a, m);
return 0;
}
| 49 |
24,133 | /*
???????
?????
???2011.11.11
*/
int len; //??????
void ishui(char a[]); //?????????????
int main() //???
{
char a[500];
memset(a, ' ', sizeof(a));
int i = 0;
while((a[i] = cin.get()) != '\n') //?????
{
i++;
}
len = i; //????????
ishui(a); //???????????
return 0;
} //?????
void ishui(char a[]) //??????
{
int i, j, k, l, flag;
for(i = 2 ; i <= len - 1 ; i++) //????????????????
{
for(j = 0 ; j < len ; j++) //?????????
{
flag = 1; //????????1
for(k = 0 ; k < i ; k++) //???????
{
if(a[j + k] != a[j + i - (k + 1)])
{
flag = 0; //???????
break;
}
}
if(flag == 1) //?????????
{
for(l = 0 ; l < k ; l++)
{
cout << a[j + l];
}
cout << endl;
}
}
}
return;
}
| 49 |
24,134 | int main()
{
char s[501];
int i,j,k,p,len;
scanf("%s",s);
len=strlen(s);
for(k=2;k<len;k++)
for(i=0;i<=len-k;i++)
{
for(j=i;j<i+k/2;j++)
if(s[j]!=s[2*i+k-1-j])break;
if(j==i+k/2)
{
for(p=i;p<i+k;p++)
printf("%c",s[p]);
printf("\n");
}
}
return 0;
}
| 49 |
24,135 | int main()
{
char c[505];
cin >> c;
int i, j, len;
len = strlen(c);
for (i = 2; i < len; i++)
{
for (j = 0; j <= len - i; j++)
{
int k, l, flag = 1;
for (k = j, l = j + i - 1; k < j + i - 1, l > j; k++, l--)
{
if (c[k] != c[l])
{
flag = 0;
break;
}
}
if (flag == 1)
{
for (int a = j; a < j + i; a++)
cout << c[a];
cout << endl;
}
}
}
return 0;
} | 49 |
24,136 | 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 |
24,137 | 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 |
24,138 | 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 |
24,139 | 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 |
24,140 |
int main()
{
char a[500];
int i,j,l,k,m=0;
gets(a);
for(i=2;i<=strlen(a);i++)
{
for(j=0;j<=(strlen(a)-i);j++)
{
for(l=j,k=j+i-1;l<=k;l++,k--)
{
if(a[l]==a[k])
m=1;
else
{
m=0;
break;
}
}
if(m==1)
{
for(k=j;k<j+i;k++)
printf("%c",a[k]);
printf("\n");
}
}
}
return 0;
}
| 49 |
24,141 | int main()
{
char p[501];
scanf("%s",p);
int len=strlen(p);
for(int i=2;i<len;i++)
{
char **q=(char **)malloc(sizeof(char *)*len);
for(int j=0;j<len-i+1;j++)
{
q[j]=(char *)malloc((i+1)*sizeof(char));
for(int h=0;h<i+1;h++)
q[j][h]='\0';
for(int h=0;h<i;h++)
q[j][h]=p[j+h];
}
for(int j=0;j<len-i+1;j++)
{
char temp[501]={'\0'};
int k=0;
for(int h=i-1;h>=0;h--)
{
temp[k]=q[j][h];
k++;
}
if(strcmp(temp,q[j])==0)
printf("%s\n",q[j]);
}
}
}
| 49 |
24,142 | int main()
{
char s[501];
int i, j, k=0,l;
cin.get(s,500);
while(1)
{
for (i=(k/2);i<strlen(s)-(k/2);i++)
{
for (j=0;j<=(k/2);j++)
{
if (s[i-j]!=s[i+1+j]) break;
if (j==(k/2))
{
for (l=i-j;l<=i+1+j;l++)
cout << s[l];
cout << endl;
}
}
}
k++;
if (k==strlen(s)-2) break;
for (i=(k/2+1);i<=strlen(s)-(k/2+1);i++)
{
for (j=1;j<=(k/2+1);j++)
{
if (s[i-j]!=s[i+j]) break;
if (j==(k/2+1))
{
for (l=i-j;l<=i+j;l++)
cout << s[l];
cout << endl;
}
}
}
k++;
if (k==strlen(s)) break;
}
return 0;
} | 49 |
24,143 | main()
{
char s[500];
int n,i,j=2,k,m;
scanf("%s",s);
n=strlen(s);
for(;j<=n;j++)
{
if(j%2) m=(j+1)/2;
else m=j/2;
for(k=0;k<=n-j;k++)
{
for(i=k;i<=m+k-1;i++)
{
if(s[i]!=s[j+2*k-1-i]) break;
}
if(i==m+k)
{
for(i=k;i<=j+k-1;i++) printf("%c",s[i]);
printf("\n");
}
}
}
} | 49 |
24,144 | /*
* 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 |
24,145 | //???????
//??? 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 |
24,146 | void Palindrome(char []);
int main()
{
char str1[500];
cin >> str1;
Palindrome(str1);
return 0;
}
void Palindrome(char str1[])
{
int i, k, m, n, a, b;
m = strlen(str1);
for (i = 1; i < m; i++)
{
for (k = 0; k < m; k++)
{
for (a = k,b = k + i; a < b; a++,b--)
{
if (str1[a] != str1[b])
break;
}
if (a == b + 1 || a == b)
{
for(n = k; n <= k + i; n++)
{
cout << str1[n];
}
cout << endl;
}
}
}
} | 49 |
24,147 | 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 |
24,148 | int ju(char str[],int j,int k)
{
int p,m=1;
for(p=k;p<=k+j-1;p++)
{
if(str[p]!=str[2*k+j-1-p])
{
m=0;
}
}
return m;
}
void main()
{
char str[501];
char c;
int i=1,j,k,l;
while((c=getchar())!='\n')
{
str[i]=c;
i++;
}
i--;
for(j=2;j<=i;j++)
{
for(k=1;k<=i-1;k++)
{
if(ju(str,j,k)==1)
{
for(l=k;l<=k+j-1;l++)
printf("%c",str[l]);
printf("\n");
}
}
}
} | 49 |
24,149 | /*
* palindrome substring.cpp
*
* Created on: 2011-12-28
* Author: Administrator
*/
int main()
{
char sen[510];int j,n,k,m,length;//????
cin.getline(sen,510);
length=strlen(sen);
for(n=1;n<=length;n++)//?????????
for(j=0;j<=length-1-n;j++)//?????????
{
m=j;
k=j+n;
while(k>=m&&sen[k]==sen[m])//???????
{
k--;m++;
}
if(k<=m)
{
for(k=j;k<=j+n;k++){cout<<sen[k];}cout<<endl;//????
}
}
return 0;
}
| 49 |
24,150 | //**********************************************
//**???????******************************
//**?????? 1000012741*********************
//**???2010?11?26?************************
//**********************************************
void pal(char str[503], int m, int i) //??pal?????????????????????
{
int j = i, p = i + 1; //????????????j?p
while (str[j] == str[p] && j >= 0 && str[p] != '\0') //????????????
{
j--;
p++;
if (p != (i + 1) && ((p - j - 1) == m)) //?????????????
{
for (int k = j + 1; k < p; k++) //????
cout << str[k];
cout << endl;
}
}
}
int main()
{
char str[503];
int i, j, k, p, m, l; //m?????????l?????????
cin >> str; //?????
l = strlen(str); //????
for (m = 2; m <= l; m = m + 2) //??????????
{
for (i = 0; str[i + 1] != '\0'; i++)
pal(str, m, i);
}
for (m = 3; m <= l; m = m + 2) //??????????
{
for (i = 0; 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) && ((p - j - 1) == m)) //?????????????
{
for (k = j + 1; k < p; k++)
cout << str[k]; //????
cout << endl;
}
}
}
return 0;
}
//********************************************** | 49 |
24,151 | int main()
{
char a[100]={'\0'},b[100]={'\0'},c[100]={'\0'};
int i,j,l0,l;
gets(a);
l0=strlen(a);
l=2;
for(l=2;l<=l0;l++)
{
for(i=0;i<=l0-l;i++)
{
for(j=i;j<i+l;j++)
b[j-i]=a[j];
for(j=0;j<l;j++)
c[j]=b[l-1-j];
if(strcmp(b,c)==0)
{
for(j=0;j<l;j++)
printf("%c",b[j]);
printf("\n");
}
}
}
return 0;
} | 49 |
24,152 | 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 |
24,153 | int print(char str[],int i,int j){
int t,I=i,J=j;
while(str[i]==str[j]&&j>=i){
i++;
j--;
};
if(j<i)
{ for(t=I;t<=J;t++) printf("%c",str[t]);
printf("\n");
}
return 0;
}
void main(){
char str[501];
int i,j,len;
gets(str);
len=strlen(str);
for(i=1;i<len;i++)
for(j=i;j<len;j++)
print(str,j-i,j);
} | 49 |
24,154 |
void pause()
{int n;
scanf("%d",&n);
}
void find_huiwen(char*str,int len,int n)
{void reverse(char*huiwen,char*rev,int geshu);
char * huiwen;
huiwen=(char*)malloc((len+1)*sizeof(char));
char * rev;
rev=(char*)malloc((len+1)*sizeof(char));
int i,j;
for(i=0;i<=n-len;i++)
{for(j=0;j<=len-1;j++)
{huiwen[j]=*(str+i+j);
}
huiwen[len]='\0';
reverse(huiwen,rev,len);//rev???
if(strcmp(rev,huiwen)==0)
printf("%s\n",huiwen);
}
}
void reverse(char*huiwen,char*rev,int geshu)
{
int j;
for(j=0;j<=geshu;j++)
{rev[j]=huiwen[geshu-1-j];
}
rev[geshu]='\0';
}
int main()
{//void pause();
char str[500];
int n;
scanf("%s",str);
n=strlen(str);
//???????
int i;
for(i=2;i<=n;i++)
find_huiwen(str,i,n);
pause();
return 0;
}
| 49 |
24,155 | int main(){
char a[501];
cin.getline(a,501);
int i,j;
int k;
int p;
int s;
int count=0;
int len;
len=strlen(a);
for(i=0;i<len-1;i++){
if(a[i]==a[i+1]){cout<<a[i]<<a[i+1]<<endl;}
}
for(i=3;i<=len;i++)
for(j=0;j<len;j++){
if(i%2==1){
k=(int)i/2;
if(j-k>=0&&j+k<len){
for(s=1;s<=k;s++){
if(a[j-s]==a[j+s])count++;
else break;
}
if(count==k){
for(p=j-k;p<j+k;p++)
cout<<a[p];
cout<<a[j+k]<<endl;
}count=0;
}
}
else if(i%2==0){
k=(int)i/2-1;
if(j-k>=0&&j+k+1<len){
if(a[j]==a[j+1]){
for(s=1;s<=k;s++){
if(a[j-s]==a[j+1+s])count++;
else break;
}
if(count==k){
for(p=j-k;p<j+k+1;p++)
cout<<a[p];
cout<<a[j+k+1]<<endl;
}
}count=0;
}
}
}
return 0;
} | 49 |
24,156 | int main()
{
char a[500];
int r,i,j,k,n,m;
scanf("%s",a);
r=strlen(a);
for(i=2;i<=r;i++)
{
for(k=0;k<=r-i;k++)
{m=k;n=k+i-1;
while(m<n&&(a[m]==a[n]))
{m++;n--;}
if(m>=n) {for(j=k;j<=k+i-1;j++) {putchar(a[j]); }putchar('\n'); }
}
}
return 0;
} | 49 |
24,157 | int main()
{
char a[500];
int c,i,j,u,p;
cin>>a;
for( j=2;j<500;j++)
{ c=j/2;
for( i=0;i<499;i++)
{ if(a[i]=='\0') break;
for( u=0;u<c;u++)
{ if(a[i+u]!=a[i+j-1-u]) break;
if(u==c-1)
if(a[i+c-1]==a[i+j-c])
for(p=i;p<i+j;p++)
{cout<<a[p];
if(p==i+j-1)
cout<<endl;}}}}
return 0;
}
| 49 |
24,158 | //**************************
//*??????? *
//*?????? 1200012775 *
//*???2012/11/13 *
//**************************
int main()
{
char str[500]; //?????
int leap, i, length, k, j; //??????
for (i = 0; ; i++)
{
cin.get(str[i]); //????
if (str[i] == '\n') //?????
{
length = i - 1; //??????????1
break; //????
}
}
for (j = 1; j < length; j++) //???2?length
for (i = 0; i <= length - j; i++) //???0???
{
leap = 0; //????leap?0
for (k = 0; k <= j/2 + 1; k++)
if (str[i + k] != str[i + j - k]) //????
{
leap = 1; //?????
break; //????
}
if (leap == 0) //????
{
for (k = i; k <= i + j; k++)
cout << str[k]; //?????
cout << endl;
}
}
return 0;
} | 49 |
24,159 | 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 |
24,160 | 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 |
24,161 | 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 |
24,162 | char str[510][510][510];
int huiwen(char c1[510])
{
int n,l;
char c2[510];
n=strlen(c1);
for (l=0;l<n;l++)
c2[l]=c1[n-1-l];
c2[n]='\0';
if (strcmp(c1,c2)==0)
return 1;
else
return 0;
}
int main( )
{
char s[510];
int i,j,k,n;
scanf("%s",s);
n=strlen(s);
for (i=2;i<=n;i++)
for (j=0;j<n-i+1;j++)
{
for (k=0;k<i;k++)
str[i][j][k]=s[j+k];
}
for (i=2;i<=n;i++)
for (j=0;j<n-i+1;j++)
{
if (huiwen(str[i][j]))
printf("%s\n",str[i][j]);
}
return 0;
} | 49 |
24,163 | char a[1000] ;
void huiwen(int) ;
int main()
{
cin.getline (a , 1000) ;
huiwen(2) ;
return 0 ;
}
void huiwen (int x)
{
if (x < strlen(a))
{
int i , j , k ;
for (i = 0 ; i < strlen(a) - x + 1 ; i++)
{
for (j = 0 ; j <= (x - 1) / 2 ; j++)
if (a[i + j] != a[i + x - 1 - j]) break ;
if (j == ( x - 1 ) / 2 + 1)
{
for (k = i ; k <= i + x - 1 ; k++)
cout << a[k] ;
cout << endl ;
}
}
huiwen (x + 1) ;
}
} | 49 |
24,164 | int main()
{
char str[501];
int i, j, k, l = 0, length, t1, t2, t;
int a[501] = {0}, b[501] = {0};
int leng[501] = {0};
cin.getline(str, 501);
length = strlen(str);
for(i = 0; i < length; i++)
{
for(j = i + 1; j <length; j++)
{
if(str[i] == str[j])
{
for(k = i + 1; k <= (j + i) / 2; k++)
{
if(str[k] == str[i + j - k])
{
continue;
}
else
break;
}
if(k - 1 == (j + i) / 2)
{
a[l] = i;
b[l] = j;
leng[l] = j - i;
l++;
}
}
}
}
for(i = 0; i < l -1; i++)
{
for(j = 0; j < l - i - 1; j++)
{
if(leng[j] > leng[j + 1])
{
t1 = b[j + 1];
b[j + 1] = b[j];
b[j] = t1;
t2 = a[j + 1];
a[j + 1] = a[j];
a[j] = t2;
t = leng[j +1];
leng[j+1] = leng[j];
leng[j] = t;
}
}
}
for(i = 0; i < l; i++)
{
while(a[i] <= b[i])
{
cout << str[a[i]];
a[i]++;
}
cout << endl;
}
return 0;
}
| 49 |
24,165 | char s[500];
void huiwen(int n,int l)
{
int k,i,j,e,sum=0;
for(k=0;k<l-n+1;k++)
{
e=k+n-1;
for(j=k;j<n/2+k;j++,e--)
{
if(s[j]==s[e]) sum++;
if(s[j]!=s[e])
{
sum=0;
break;
}
if(sum==n/2)
{
for(i=k;i<n+k;i++)
cout<<s[i];
cout<<endl;
sum=0;
}
}
}
}
int main()
{
int m,l;
cin.getline(s,500);
l=strlen(s);
for(m=2;m<l;m++)
huiwen(m,l);
return 0;
} | 49 |
24,166 | 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 |
24,167 | 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 |
24,168 | //**********************************
//*????.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 |
24,169 | 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 |
24,170 | void output(int);
char word[500];
int len;
int main()
{
int i;
cin.getline(word, 500);
len = strlen(word);
for (i = 2; i <= len; i++)
output(i);
return 0;
}
void output(int i)
{
int j, k;
for (j = 0; j <= len - i; j++)
{
k = j;
while (word[k] == word[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 << word[k];
cout << endl;
}
}
}
| 49 |
24,171 | int main()
{
char str[520];
int len, i, j, k, num;
cin >> str;
len = strlen(str);
for (i = 2; i <= len; i++)
{
for (j = 0; j <= len - i; j++)
{
num = 0;
for (k = 0; k < i; k++)
{
if (str[j + k] == str[j + i - k - 1])
num++;
}
if (num == i)
{
for (k = 0; k < i; k++)
cout << str[j + k];
cout << endl;
}
}
}
return 0;
} | 49 |
24,172 | 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 |
24,173 | 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 |
24,174 | 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 |
24,175 | int judge(char *p,int l)
{
char *x,*t;
t=p;
int y=1;
x=t+l-1;
while ((t<=x) && y)
{
if (*t!=*x) y=0;
t++;
x--;
}
return y;
}
void pp(char *p,int l)
{
int i;
char *t;
t=p;
for (i=1;i<=l;i++)
printf("%c",*(p+i-1));
printf("\n");
}
void main()
{
char c[3243];
int i,j,k,l;
char *p;
//freopen("tt.in","r",stdin);
//freopen("tt.out","w",stdout);
gets(c); l=strlen(c); p=c;
for (i=2;i<=l;i++)
for (j=1;j<=l-i+1;j++)
if (judge(p+j-1,i))
pp(p+j-1,i);
} | 49 |
24,176 | void main()
{
int i,j,p,q,k,len;
char s[500];
scanf("%s",s);
len=strlen(s);
for(i=2;i<=len;i++)/*????*/
for(j=0;j<=len-i;j++)/*????*/
{
p=j;
q=j+i-1;
while(p<q)
{
if(s[p]==s[q])
{
p++;
q--;
}
else break;
if(p==q+1 || p==q)
{
for(k=j;k<=j+i-2;k++)
printf("%c",s[k]);
printf("%c\n",s[j+i-1]);
break;
}
}
}
} | 49 |
24,177 | 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 |
24,178 | int main()
{
char str[500];
int lenth,i,l,j,counter;
gets(str);
lenth=strlen(str);
for(i=0;i<=lenth-2;i++)
{
if(str[i]==str[i+1])
printf("%c%c\n",str[i],str[i+1]);
}
for(l=3;l<=lenth;l++)
{
for(i=0;i<=lenth-l;i++)
{
counter=0;
for(j=0;j<=l-1;j++)
{
if(str[i+j]==str[i+l-j-1])
counter+=1;
}
if(counter==l)
{
for(j=0;j<=l-2;j++)
{
printf("%c",str[i+j]);
}
printf("%c\n",str[i+l-1]);
}
}
}
return 0;
}
| 49 |
24,179 |
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 |
24,180 | 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 |
24,181 |
int main() {
char a[600];
cin>>a;
int l,i,j,start,num;
char box1[600],box2[600];
for(l=2;l<=strlen(a);l++)
{
for(start=0;start<=strlen(a)-l;start++)
{
memset(box1,600,'\0');
memset(box2,600,'\0');
num=0;
for(i=start;i<start+l;i++)
{
box1[num++]=a[i];
}
for(i=0;i<l;i++)
{
box2[i]=box1[l-1-i];
}
for(i=0;i<l;i++)
{
if(box1[i]!=box2[i])
break;
if(i==l-1)
{
for(j=0;j<l;j++)
{
cout<<box1[j];
}
cout<<endl;
}
}
memset(box1,600,'\0');
memset(box2,600,'\0');
}
}
return 0;
} | 49 |
24,182 | 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 |
24,183 | int main()
{
char a[500];
int len,i,j,k,p,flag,m;
gets(a);
len=strlen(a);
for(i=2;i<=len;i=i+2)
{
for(j=0;j<len;j++)
{
flag=0;
for(k=0;k<i/2;k++)
{
if(a[j+k]==a[j+i-1-k])
flag=1;
else {
flag=0;break;
}
}
if(flag)
{
for(m=j;m<j+i;m++)
printf("%c",a[m]);
printf("\n");
}
}
}
return 0;
} | 49 |
24,184 | int main()
{
char a[500];
int i, j, k, w;
cin.getline(a, 500);
int len = strlen(a);
for (i = 2; i <= len; i++)
{
if( i%2==0)
{
for( j =0;j <= len-i;j++)
{
for(w=0;w<i/2;w++)
{
if(a[j+w] != a[i+j-1-w])
break;
}
if(w == i/2)
{
for(k = 0; k<i;k++)
cout << a[j+k];
cout << endl;
}
}
}
else
{
for( j =0;j <= len-i;j++)
{
for(w=0;w < i/2 - 1;w++)
{
if(a[j+w] != a[i+j-1-w])
break;
}
if(w == i/2)
{
for(k = 0; k < i; k++)
cout << a[j+k];
cout << endl;
}
}
}
}
return 0;
}
| 49 |
24,185 | /*
*???
*2010 - 11 - 30
*?????5 - ????
*/
int main()
{
int fun ( char [], int );//????
char alp[501];
cin >> alp;
int i, j, k, l;
l = strlen( alp );
for ( i = 2; i <= l; i = i + 2 )//???????????????????????????????
{
for ( j = 0; j <= l - i; j++ )//???????????l-i?
{
char str[501];
for ( k = 0; k < i; k++ )
{
str[k] = alp[k + j];
}
str[i] = '\0';//?str????????????
if ( fun ( str, i ) )//??????????????
cout << str << endl;
}
}
return 0;
}
int fun ( char str[], int a )
{
int i, flag = 1;//flag????????????
for ( i = 0; i <= a / 2; i++ )
{
if ( str[i] != str[a - i - 1] )//??????
{
flag = 0;//????
return 0;//??0
break;
}
}
if ( flag )//?????
return 1;//??1
}
| 49 |
24,186 | int main()
{
int i,j,k,l;
char s[550];
gets(s);
l=strlen(s);
for(i=1;i<=l/2;i++)
{
for(j=i-1;j<=l-1-i;j++)
if(s[j]==s[j+1])
{
for(k=1;k<=i-1;k++)
if(s[j-k]!=s[j+1+k])
break;
if(k>i-1)
{
for(k=j+1-i;k<=j+i;k++)
printf("%c",s[k]);
printf("\n");
}
}
}
return 0;
} | 49 |
24,187 | 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 |
24,188 | 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 |
24,189 | //****************************************
//*???????
//*?????? 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 |
24,190 | int judge(char a[],int i,int k)
{
int j=i+k;
while(a[i]==a[j]&&i<=strlen(a)&&j>=0)
{
i++;j--;
}
if(i>=j)
return 1;
else return 0;
}
int main()
{
char a[510];
memset(a,0,sizeof(char)*510);
gets(a);
/*if(judge(a))
printf("YES");
else printf("NO");*/
int i,j,k;
for(k=1;k<strlen(a);k++)
{
for(i=0;i+k<strlen(a);i++)
{
if(judge(a,i,k))
{
for(j=i;j<=i+k;j++)
printf("%c",a[j]);
putchar('\n');
}
}
}
return 0;
}
| 49 |
24,191 |
int main(){
int m,i,j,k,c,g;
char a[550];
cin>>a;
c=strlen(a);
for(i=2;i<=c;i++){
for(j=0;j<c-i+1;j++){
g=0;
if(a[j]==a[j+i-1]){
if(i==2)cout<<a[j]<<a[j+i-1]<<endl;
else if(i%2==0&&i!=2){
for(k=1;k<=(i-2)/2;k++){
if(a[j+k]==a[j+i-1-k])
g++;
}
if(g==k-1){
for(m=j;m<j+i-1;m++)
cout<<a[m];
cout<<a[m]<<endl;
}
}
if(i==3)cout<<a[j]<<a[j+1]<<a[j+2]<<endl;
else if(i%2!=0){
for(k=1;k<(i-1)/2;k++){
if(a[j+k]==a[j+i-1-k])g++;
}
if(g==k-1){
for(m=j;m<j+i-1;m++)
cout<<a[m];
cout<<a[m]<<endl;
}
}
}
}
}
return 0;
} | 49 |
24,192 | int judge(char front[MAX-1],int m)
{
int i,out;
char back[MAX-1]={""};
for(i=0;i<m;i++)
{
back[i]=front[m-i-1];
}
if(strcmp(back,front)==0)
{
out=1;
}
else
out=0;
return out;
}
int main()
{
int len,i,j,k;
char s[MAX];
scanf("%s",&s);
len=strlen(s);
for(i=2;i<=len;i++)
{
char son[MAX-1][MAX-1]={""};
for(j=0;j<=len-i;j++)
{
char *p=&s[j];
for(k=0;k<i;k++)
{
son[j][k]=*p;
p++;
}
}
for(j=0;j<=len-1;j++)
{
int out;
out=judge(son[j],i);
if(out==1)
{
for(k=0;k<i;k++)
printf("%c",son[j][k]);
printf("\n");
}
}
}
return 0;
}
| 49 |
24,193 | int main() {
int i = 0, L = 0, k = 0, j = 0, c, t = 0;
char a[500];
while ((c = getchar()) != '\n')
a[k++] = c;
for (L = 2; L <= k; L++) {//L?????
t = 0;
for (i = 0; i < k; i++) {
t = 0;
for (int p = L; p > 0; p--) {//???????
if (a[i + L - p] == a[i + p - 1])
t = 1;
if (a[i + L - p] != a[i + p - 1]) {
t = 0;
break;
}
}
if (t == 1) {//??
for (j = i; j < i + L; j++)
cout << a[j];
cout << endl;
}
}
}
return 0;
} | 49 |
24,194 |
int main()
{
char word[SIZE];
int i,j,k,count,length;
gets(word);
length=strlen(word);
for(i=2;i<=length;i++)
{
for(j=0;j<length-i+1;j++)
{
count=0;
for(k=0;k<i;k++)
{
if(word[j+k]==word[j+i-1-k])
{
count++;
}
}
if(count==i)
{
for(k=0;k<i;k++)
{
printf("%c",word[j+k]);
}
printf("\n");
}
}
}
return 0;
}
| 49 |
24,195 | /*
* 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 |
24,196 |
int main()
{
char str[510];
int len = 0, x, y;
cin >> str;
len = strlen(str);
for ( int i = 1; i < len; i++ )
{
for ( int j = 0; j < len - i; j++ )
{
for ( x = j, y = j + i; x < y; x++, y-- )
{
if ( str[x] != str[y] )
break;
}
if ( x >= y )
{
for ( int m = j; m <= j + i; m++ )
cout << str[m];
cout << endl;
}
}
}
return 0;
} | 49 |
24,197 | int main()
{
char a[501];
int len,s=0;
cin.getline(a,501);
len = strlen(a);
for(int i=2;i<len;i++)
for(int j=0;j<=len-i;j++)
{ for(int k=0;k<=i/2-1;k++)
{
if(a[j+k]==a[j+i-1-k])
s++;
}
if(s==i/2)
{for(int m=j;m<=j+i-1;m++)
cout<<a[m];
cout<<endl;
}
s=0;
}
return 0;
} | 49 |
24,198 | void huiwen( int k ,char a[] )
{
int i,shime = 1 ;
for ( i = 0 ; i <= k / 2 ; i ++ )
if ( a[i] != a[ k - i - 1 ] )
shime = 0 ;
if ( shime )
{
for ( i = 0 ; i < k ; i ++ )
cout << a[i];
cout << endl;
}
}
int main ()
{
char yuan[500],yiduan[500];
int n,i,j,k ;
cin >> yuan ;
n = strlen ( yuan ) ;
for ( k = 2 ; k <= n ; k = k + 2 )
{
for ( i = 0 ; i + k <= n ; i ++ )
{
for ( j = i ; j <= i + k ; j ++ )
yiduan[j - i] = yuan[j] ;
huiwen ( k , yiduan );
}
}
return 0 ;
} | 49 |
24,199 | /* ???? ????.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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.