id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
9,300 | void main()
{
char *str[1024];
int n=0,i;
str[0]=(char*)calloc(101,sizeof(char));
while(scanf("%s",str[n])!=EOF)
{
n=n+1;
str[n]=(char*)calloc(101,sizeof(char));
}
for(i=0;i<n-3;i++)
{
if(strcmp(str[i],str[n-2])==0)
printf("%s ",str[n-1]);
else
printf("%s ",str[i]);
}
if(strcmp(str[i],str[n-2])==0)
printf("%s",str[n-1]);
else
printf("%s",str[i]);
}
| 19 |
9,301 | int main()
{
int a=0,b=0,c=0,d[10],i=0,j=0,k=0,l=0;
char s[1000],q[100],w[100];
gets(s);gets(q);gets(w);//??
for(j=0;j<100;j++)
{if(s[j]=='\0'&&a==0)a=j;//"="
if(q[j]=='\0'&&b==0)b=j;
if(w[j]=='\0'&&c==0)c=j;
if(a!=0&&b!=0&&c!=0)break;}
for(i=0;i<=a;i++)
if(s[i]==' '||s[i]=='\0')
for(j=0;j<b;j++)
if(q[j]!=s[i-b+j])break;
else if(s[i-b-1]==' '||i==b){d[k++]=i;j=b;}
if(k!=0)//"||"???break???,"k++"??????
for(i=0;i<a;i++){if(i==d[l]-b){for(j=0;j<c;j++)printf("%c",w[j]);i=d[l]-1;l++;}else printf("%c",s[i]);}
else for(i=0;i<a;i++)printf("%c",s[i]);
return 0;
} | 19 |
9,302 | int main()
{
char a[110],b[110],c[110];
gets(a);
gets(b);
gets(c);
int x,y,z,flag;
x=strlen(a);
y=strlen(b);
z=strlen(c);
for (int i=0;i<x;i++)
{
if((i==0&&a[y]==' ')||(a[i-1]==' '&&(i+y)==x)||(a[i-1]==' '&&a[i+y]==' ')) {
flag=0;
for (int j=0;j<y;j++)
{if (a[i+j]!=b[j])
{flag=1;break;}}
if (flag==0)
{cout<<c;
i+=y-1;continue;}}
cout<<a[i];
}
return 0;
} | 19 |
9,303 | void main()
{
char c=' ';
char *str1,*str2;
str1 = (char *)malloc(100*sizeof(char));
str2 = (char *)malloc(100*sizeof(char));
char str[100][100];
int i,n=0;
for(i=0;i<100;i++)
{
strcpy(str[i],"\0");
scanf("%s",str[i]);
if(c=getchar()!=' ')break;
n++;
}
strcpy(str1,"\0");
strcpy(str2,"\0");
scanf("%s",str1);
scanf("%s",str2);
for(i=0;i<=n;i++)
{
if(strcmp(str1,str[i])==0)
strcpy(str[i],str2);
}
for(i=0;i<=n-1;i++)
printf("%s ",str[i]);
printf("%s",str[n]);
} | 19 |
9,304 | void main()
{
int i,j,p=0,k;
char s[10000],ch[100],a[100],b[100];
gets(s);
gets(a);
gets(b);
for(i=0;s[i]!='\0';i++)
{
for(j=0;(s[i]!=' '&&s[i]!='\0');i++,j++)
ch[j]=s[i];
ch[j]='\0';
if (strcmp(ch,a)==0) strcpy(ch,b);
if (p>0) printf(" ");
printf("%s",ch);
for(k=0;k<=j;k++) ch[k]='\0';
p++;
}
}
| 19 |
9,305 | void main()
{
char a[100],b[100],c[100],*d,*e,*f;
int al,bl,cl,i,j,k;
gets(a);gets(b);gets(c);
al=strlen(a);bl=strlen(b);cl=strlen(c);
d=&a[0];e=&b[0];f=&c[0];
for(i=0;i<al;i++)
{
for(j=0,k=i;(*(d+i-1)==' '||i==0)&&j<bl&&*(d+k)==*(e+j);j++,k++){}
if(j==bl)
{break;}
}
if(j!=bl)
goto line;
for(j=0;j<al-bl-i;j++)
{
*(d+i+j)=*(d+i+j+bl);
}
al=al-bl;
for(j=al-1;j>=i;j--)
{
*(d+j+cl)=*(d+j);
}
for(j=i,k=0;j<cl+i;j++,k++)
{
*(d+j)=*(f+k);
}
al=al+cl;
*(d+al)='\0';
for(i=i+cl;i<al;i++)
{
for(j=0,k=i;(*(d+i-1)==' '||i==0)&&j<bl&&*(d+k)==*(e+j);j++,k++){}
if(j==bl)
{break;}
}
if(j!=bl)
goto line;
for(j=0;j<al-bl-i;j++)
{
*(d+i+j)=*(d+i+j+bl);
}
al=al-bl;
for(j=al-1;j>=i;j--)
{
*(d+j+cl)=*(d+j);
}
for(j=i,k=0;j<cl+i;j++,k++)
{
*(d+j)=*(f+k);
}
al=al+cl;
*(d+al)='\0';
line: puts(a);
}
| 19 |
9,306 | void main()
{
int n,i,j=0;char x,y,z,m=0;
char a[100];
char b[100][100];
char c[100];
char d[100];
gets(a);
scanf("%s",&c);
scanf("%s",&d);
n=strlen(a);
for(i=0;i<n;i++)
{
if (a[i]==' ') {j++;m=0;}
else {b[j][m]=a[i];m++;}
}
for(i=0;i<j+1;i++)
{
if (strcmp(b[i],c)==0) strcpy(b[i],d);
}
for(i=0;i<j;i++)
printf("%s ",b[i]);
printf("%s",b[i]);
} | 19 |
9,307 | int main(){
char a[11],b[101],z[11],s[16][11];
gets(b);
gets(a);
gets(z); //??
int i,j,m,n,l,q[22];
for(i=0,m=0,n=0;b[i]!='\0';i++){
if(b[i]!=' '){
s[m][n]=b[i];
n++;
}
else{
q[m]=n;
n=0;
m++;
}
}
q[m]=n; //????????????
for(i=0,j=0;i<=m;i++){
if(a[0]==s[i][0]){
l=1;
for(j=0;j<q[i];j++){
if(a[j]!=s[i][j]){
l=0;
}
if(q[i]!=strlen(a)){
l=0;
}
}
if(l){
for(j=0;z[j]!='\0';j++){
s[i][j]=z[j];
}
q[i]=j;
}
}
} //??
for(i=0;i<m;i++){
for(j=0;j<q[i];j++){
printf("%c",s[i][j]);
}
printf(" ");
}
for(j=0;j<q[m];j++){
printf("%c\0",s[i][j]);
} //??
return 0;} | 19 |
9,308 |
main(){
char text[100],s[100][20]={'\0'},a[20],b[20];
int i,j=0,k=0,len;
gets(text);
len=strlen(text);
for(i=0;i<len;i++){
if(text[i]!=' '){
s[j][k]=text[i];
k=k+1;
}
else{
j=j+1;
k=0;
}
}
scanf("%s",a);
scanf("%s",b);
for(i=0;i<=j;i++){
if(strcmp(s[i],a)==0){
strcpy(s[i],b);
}
printf("%s",s[i]);
if(i!=j) printf(" ");
}
printf("\n");
}
| 19 |
9,309 | void main()
{
int i,j,k;
char a[100]={""},b[100]={""},c[100]={""},d[100]={""};
gets(c);
gets(a);
gets(b);
for(i=0;;)
{
for(j=0;c[i]!=' '&&c[i]!='\0';i++,j++)
d[j]=c[i];
d[j]='\0';
if(strcmp(d,a)==0)
printf("%s",b);
else for(k=0;k<j;k++)
printf("%c",d[k]);
if(c[i]!='\0') printf(" ");
else break;
i++;
}
}
| 19 |
9,310 | void main(){
char s[101],a[101],b[101],word[101];
int i=0,j,flag,n=0;
gets(s);
gets(a);
gets(b);
while(s[i-1]!=0||i==0){
while(s[i]!=' '&&s[i]!=0){
word[i-n]=s[i];
i++;
}
word[i-n]=0;
flag=1;
for(j=0;j<=strlen(a);j++)
if(a[j]!=word[j])
flag=0;
if(flag)
printf("%s",b);
else printf("%s",word);
if(s[i]!=0)printf("%c",s[i]);
i++;
n=i;
}
} | 19 |
9,311 | const long maxLenth=100;
const long maxwords=10000;
long n;
char word[maxwords+10][maxLenth+10];
char fw[maxLenth+10],tw[maxLenth+10];
main(){
long i,j,k;
char a;
n=0;
do{
scanf("%s",word[++n]);
a=getchar();
}while(a!='\n');
scanf("%s%s",fw,tw);
for(i=1;i<=n;i++){
if(strcmp(fw,word[i])==0)printf("%s",tw);
else printf("%s",word[i]);
if(i<n)printf(" ");
else printf("\n");
}
return 0;
}
| 19 |
9,312 | int main(){
char sz[100],zfc[20][20],a[20],b[20];
gets(sz);
scanf("%s",a);
scanf("%s",b);
int i,j=0,k=0;
for(i=0;i<=strlen(sz);i++){
if(sz[i]!='\0'&&sz[i]!=' '){
zfc[j][k]=sz[i];
k++;
}
if(sz[i]=='\0'||sz[i]==' '){
zfc[j][k]='\0';
j++;
k=0;
}
}
for(i=0;i<=j;i++){
if(strcmp(zfc[i],a)==0){
strcpy(zfc[i],b);
}
}
printf("%s",zfc[0]);
for(i=1;i<j;i++){
printf(" %s",zfc[i]);
}
return 0;
} | 19 |
9,313 |
int main()
{
char ch[200];
char result[200];
char f[200],r[200];
gets(ch);
cin >> f >> r;
ch[strlen(ch)+1]=0;
ch[strlen(ch)]=' ';
memset(result,0,200);
int last = 0;
for(int i=0;i<strlen(ch);i++)
{
if(ch[i]==' ')
{
ch[i]=0;
char *p =ch+last;
if(strcmp(p,f)==0)
sprintf(result,"%s %s",result,r);
else
sprintf(result,"%s %s",result,p);
last = i+1;
ch[i]=' ';
}
}
cout << result+1 << endl;
return 0;
} | 19 |
9,314 | void main()
{
int n,i=0;
char (*s)[100],*a,*b;
s=(char (*)[100])malloc(100*100*sizeof(char));
a=(char *)malloc(100*sizeof(char));
b=(char *)malloc(100*sizeof(char));
while(scanf("%s",*(s+i))!=EOF)
{i++;}
n=i;
strcpy(a,*(s+n-2));
strcpy(b,*(s+n-1));
for(i=0;i<n-2;i++)
{
if (strcmp(a,*(s+i))==0)
{strcpy(*(s+i),b);}
}
for (i=0;i<n-3;i++)
{printf("%s ",*(s+i));}
printf("%s",*(s+n-3));
} | 19 |
9,315 | int main()
{
char s[100];
char a[100];
char t[100];
char b[100];
int k,i,j,word;
word=0;
k=0;
gets(s);
gets(a);
gets(b);
int len;
len=strlen(s);
for(i=0;i<len;i++)
{
if(s[i]==' ')
{word=0;}
else if(word==0)
{ k++;
word=1;}
}
int A=0;
int n;
int m=0;
for(j=0;j<k;j++)
{
for(i=A,n=0;i<len;i++,n++)
{
if(s[i]!=' ')
{t[n]=s[i];}
if(s[i]==' ')
{t[n]='\0';
A=i+1;
break;}
}
if(i==len)
{ t[n]='\0';}
if(strcmp(t,a)==0)
{strcpy(t,b);}
m++;
if(m!=k)
{
printf("%s ",t);
}
if(m==k)
{printf("%s\n",t);}
}
return 0;
}
| 19 |
9,316 | int main()
{
char s[101], a[101], b[101], c[203];
s[0] = a[0] = b[0] = ' ';
gets(&s[1]);
cin >> &a[1] >> &b[1];
int slen = strlen(s) + 1,
alen = strlen(a) + 1,
blen = strlen(b) + 1;
s[slen - 1] = a[alen - 1] = b[blen - 1] = ' ';
s[slen] = a[alen] = b[blen] = '\0';
int i, j;
for (i=0, j=0; i<slen; ++i, ++j)
{
if (strncmp(s+i, a, alen) == 0)
{
strcpy(c+j, b);
i = i + alen - 1;
j = j + blen - 1;
}
else
{
c[j] = s[i];
}
}
c[j-1] = 0;
cout << &c[1] << endl;
return 0;
}
| 19 |
9,317 |
char buffer[1024];
char word[1024];
char replace[1024];
char current[1024];
int main() {
gets(buffer);
scanf("%s %s", word, replace);
int buffer_len = strlen(buffer);
char *buffer_ptr = buffer;
char *buffer_end = buffer + buffer_len;
char *current_ptr = current;
while (buffer_ptr < buffer_end) {
if (*buffer_ptr == ' ') {
*current_ptr = '\0';
if (strcmp(word, current) == 0)
printf("%s ", replace);
else
printf("%s ", current);
current_ptr = current;
} else {
*current_ptr = *buffer_ptr;
++current_ptr;
}
++buffer_ptr;
}
*current_ptr = '\0';
if (strcmp(word, current) == 0)
printf("%s", replace);
else
printf("%s", current);
return 0;
} | 19 |
9,318 | int main()
{
char a[100],b[100],c[100],t=1;
char tihuan[100][100];
int i,j=0,m=-1,n;
gets(a);
scanf("%s",b);
scanf("%s",c);
for(i=0;;i++)
{
if(a[i]==' ')
{
n=m;
m=i;
strncpy(tihuan[j],a+n+1,m-n-1);
tihuan[j][m-n-1]='\0';
j++;
}
if(a[i]=='\0')
{
n=m;
m=i;
strncpy(tihuan[j],a+n+1,m-n-1);
tihuan[j][m-n-1]='\0';
j++;
break;
}
}
for(i=0;i<j;i++)
{
if(strcmp(tihuan[i],b)==0)
{
strcpy(tihuan[i],c);
}
}
for(i=0;i<j;i++)
if(t)
{
printf("%s",tihuan[i]);
t=0;
}
else
printf(" %s",tihuan[i]);
return 0;
}
| 19 |
9,319 | void Input (char *a, char *b, char *c)
{
gets(a);
gets(b);
gets(c);
}
void Swap (char *str, char *FindWord, char *SwapWord)
{
int j,s,k,i=0,SwapWordLength,strLength,FindWordLength,n;
char *p1,*p2;
p1=str;
p2=FindWord;
strLength=strlen(str); //length of the original sentence
FindWordLength=strlen(FindWord); //length of the old word
SwapWordLength=strlen(SwapWord); //length of the new word
n=SwapWordLength-FindWordLength;
while(*p1!='\0'){
if((*p1==*p2)&&(!isalpha(*(p1-1))))
while((*p1==*p2)&&(*p2!='\0'))
{ p1++; p2++; i++; } //i: record how many chars has been read
else { p1++; i++; }
if((*p2=='\0')&&(isalpha(*p1)==0))
{
//find the old word in the sentence
if(n<0)
{
j=i-FindWordLength; //j: beginning place
for(k=0; k<SwapWordLength; k++)
str[j++]=SwapWord[k]; //str[j++]==str[j], j++
for(s=i; s<strLength; s++)
str[j++]=str[s];
while(j<strLength)
str[j++]='\0';
strLength=strlen(str);
}
else
{
for(s=strLength+n; s>i; s--)
str[s]=str[strLength--];
j=i-FindWordLength;
for(k=0; k<SwapWordLength; k++)
str[j++]=SwapWord[k];
strLength=strlen(str);
}
}
p2=FindWord;
}
}
void main(){
char sen[MAX],old[LEN],new[LEN];
Input(sen,old,new);
Swap(sen,old,new);
puts(sen);
}
| 19 |
9,320 | int main()
{
char string[300];
gets(string);
char a[200],b[200];
scanf("%s %s", a, b);
char word[200][200];
int n1,n2,i,k;
int m=0;
int p=0;
n1=strlen(string);
for(i=0;i<n1;i++)
{
if(string[i]==' ')
{
m++;
p=0;
}
else
{
word[m][p]=string[i];
p++;
}
}
if(strcmp(word[0],a)==0)
printf("%s", b);
else
printf("%s", word[0]);
for(k=1;k<=m;k++)
{
if(strcmp(word[k],a)==0)
printf(" %s", b);
else
printf(" %s", word[k]);
}
return 0;
}
| 19 |
9,321 | int main()
{
char a[1000],b[50],e[50];
int c[1000],d[1000];
int i,n,flag1=0,j=0,m,k,x,l,flag2=0,g;
gets(a);
gets(b);
gets(e);
n=strlen(a);
x=strlen(b);
d[0]=0;
for(i=0;i<n;i++)
{
if(a[i]==' '&&flag1==0)
{
c[j]=i;
d[j+1]=i+1;
j++;
flag1=1;
m=i;
}
else
{
if(a[i]==' ')
{
c[j]=i-m-1;
d[j+1]=i+1;
j++;
m=i;
}
}
}
c[j]=n-1-m;
k=j+1;
for(j=0;j<k;j++)
{
if(c[j]==x)
{
g=0;
for(l=d[j];l<d[j]+c[j];l++,g++)
{
if(b[g]!=a[l])
flag2=1;
}
g=0;
if(flag2==0)
{
if(j==0)
printf("%s",e);
else
printf(" %s",e);
}
else
{
if(j==0)
for(l=d[j];l<d[j]+c[j];l++)
printf("%c",a[l]);
else
{printf(" ");
for(l=d[j];l<d[j]+c[j];l++)
printf("%c",a[l]);}
}
flag2=0;
}
else
{
if(j==0)
for(l=d[j];l<d[j]+c[j];l++)
printf("%c",a[l]);
else
{printf(" ");
for(l=d[j];l<d[j]+c[j];l++)
printf("%c",a[l]);}
}
}
return 0;
} | 19 |
9,322 | // Program Test.cpp : ??????????????
//
struct Vocabulary
{
char character[Vocabularysize];
struct Vocabulary *next;
};
int n=0;
char str[Sentencelength];
struct Vocabulary* create()
{
int i;
struct Vocabulary*head;
struct Vocabulary *p1,*p2;
n=0;
int k=0,l=0;
p1=p2=(struct Vocabulary*)malloc(sizeof(struct Vocabulary));//?????????
for(l=k;str[l]!=' ';l++);
for(i=k;i<l;i++)p1->character[i]=str[i];
p1->character[i]='\0';
k=l+1;
i=0;
head=NULL;
while(str[i]!='\0')
{
n=n+1;//?????????????????????
if(n==1)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct Vocabulary *)malloc(sizeof(struct Vocabulary));
if(str[l]!='\0')
{ for(l=k;str[l]!=' '&&l<=strlen(str)-1;l++);
int m;
for(i=k,m=0;i<l;i++,m++)p1->character[m]=str[i];
p1->character[m]='\0';//copy the character
k=l+1;
}
else i=l;
}
p2->next=p1;
p2=p1;
p2->next=NULL;
return (head);
}
void print(struct Vocabulary *head)
{
struct Vocabulary*p;
p=head;
for(p=head;p->next!=NULL;p=p->next)
printf("%s ",p->character);
printf("%s\n",p->character);
}
int main()
{
struct Vocabulary *head;
gets(str);
//
char stra[Sentencelength],strb[Sentencelength];
gets(stra);
gets(strb);
//
head=create();
struct Vocabulary *p=head;
for(p=head;p!=NULL;p=p->next)
{
//
if(strcmp(p->character,stra)==0)
strcpy(p->character,strb);
}
print(head);
return 0;
}
| 19 |
9,323 | void main()
{
int i=0,j,v,x,c,flag;
char str[100],a[10],b[10];
gets(str);
gets(a);
gets(b);
v=strlen(str);
x=strlen(a);
c=strlen(b);
str[v]=' ';
flag=x;
for(i=0;i<x;i++)
{
if(str[i]==a[i])
{
flag--;
}
}
if(flag==0&&str[x]==' ')
{
printf("%s",b);
}
else for(i=0;i<x;i++)
{
printf("%c",str[i]);
}
i=x;
while(i<v)
{ flag=x;
for(j=i;j<i+x;j++)
{
if(str[j]==a[j-i]) flag--;
}
if(flag==0&&str[i-1]==' '&&str[i+x]==' ')
{
printf("%s",b);i=i+x;
}
else
{
printf("%c",str[i]);i++;
}
}
}
| 19 |
9,324 | void main()
{
char str[100],a[100],b[100];
int i=0,j=0,k=0,m=0,n=0;
gets(str);
gets(a);
gets(b);
n=strlen(str);
char words[100][100]={0};
for(k=0;k<n;k++)
{
if(str[k]!=32)
{
words[i][j]=str[k];
j++;
}
else if(str[k]==32)
{
i++;
j=0;
}
}
m=i+1;
for(i=0;i<m;i++)
{
if(strcmp(words[i],a)==0)
strcpy(words[i],b);
else continue;
}
for(i=0;i<m-1;i++)
printf("%s ",words[i]);
printf("%s\n",words[m-1]);
}
| 19 |
9,325 |
void main()
{
char *s,*a,*b,*p,*c,n,*end;
s=(char *)malloc(101*sizeof(char));
a=(char *)malloc(101*sizeof(char));
b=(char *)malloc(101*sizeof(char));
c=(char *)malloc(101*sizeof(char));
gets(s);
gets(a);
gets(b);
p=s;
end=s+strlen(s);
for (;;)
{
sscanf(p,"%s",c);
if (strcmp(c,a)==0) printf("%s",b);
else printf("%s",c);
p=p+strlen(c)+1;
if (p>=end) break;
printf("%c",' ');
}
}
| 19 |
9,326 | void main()
{
char a[1000][1000]={1},b[100],c[100],d;
int i,n=0;
for(i=0;;i++)
{
scanf("%s%c",&a[i],&d);
n++;
if(d=='\n')
break;
}
scanf("%s",&b);
scanf("%s",&c);
for(i=0;i<n;i++)
{
if(strcmp(a[i],b)==0)
printf("%s",c);
else
printf("%s",a[i]);
if(i==n-1)
printf("\n");
else
printf(" ");
}
}
| 19 |
9,327 |
void main()
{
char s[1000],a[100],b[100],out[1000];
void insertb(char *s,char *a,char *b,char *out);
gets(s);
gets(a);
gets(b);
insertb(s,a,b,out);
}
void insertb(char *s,char *a,char *b,char *out)
{
char *p1,*p2,*p3,*p4;
for (p1=s,p2=a;p1<s+strlen(s);)
{
if((*p1==*p2&&p1==s)||(*p1==*p2&&*(p1-1)==32))
{
for(p2=a;p2<a+strlen(a);p2++)
{
if(*p1==*p2) p1++;
else break;
}
if(p2==a+strlen(a))
{
p4=out;
for(p3=s;p3<p1-strlen(a);p4++,p3++)
*p4=*p3;
for(p3=b;p3<b+strlen(b);p4++,p3++)
*p4=*p3;
for(p3=p1;p3<s+strlen(s);p3++,p4++)
*p4=*p3;
*p4='\0';
break;
}
else p2=a;
}
else p1++;
}
if(p2==a+strlen(a)) insertb(out,a,b,s);
else puts(s);
}
| 19 |
9,328 |
int main()
{
char sentence[101];
char word[20];
char subWord[20];
cin.getline(sentence,100);
cin.getline(word,20);
cin.getline(subWord,20);
int i,lenOfSen=0,lenOfWord=0,lenOfsubWord=0;
int left[100],right[100];
int found = 0;
for(i=0;i<100;i++)
{
if(sentence[i]!='\0')
{
lenOfSen++;
}
if(sentence[i]=='\0')
{
break;
}
}
for(i=0;i<20;i++)
{
if(word[i]!='\0')
{
lenOfWord++;
}
if(word[i]=='\0')
{
break;
}
}
for(i=0;i<20;i++)
{
if(subWord[i]!='\0')
{
lenOfsubWord++;
}
if(subWord[i]=='\0')
{
break;
}
}
//xunzhao
for(i = 0;i<lenOfSen;i++)
{
if(sentence[i]==word[0])
{
if(i==0||sentence[i-1]==' ')
{
left[found] = i;
int j;
for( j=1;j<lenOfWord;j++)
{
if(sentence[i+j]!=word[j])
{
break;
}
}
if(j == lenOfWord)
{
if(i+j == lenOfSen||sentence[i+j]==' ')
{
right[found] = i + j;
found++;
}
}
}
}
}
//substitute
char newString[200];
int k=0;
if(found == 0)
{
cout<<sentence<<endl;
}
else
{
int t =0;
for(i =0 ;i<lenOfSen;i++)
{
if (i == left[t])
{
for(int j = 0;j<lenOfsubWord;j++)
{
newString[k++] = subWord[j];
}
i = right[t];
if(t<found) t++;
}
newString[k++] = sentence[i];
}
newString[k]='\0';
cout<<newString<<endl;
}
} | 19 |
9,329 | void main(){
int i=1,t;
char a[20][20],(*p)[20],x[20],y[20];
p=a;
scanf("%s",p);
while(getchar()!='\n'){
scanf("%s",p+i);
i++;
}
scanf("%s%s",x,y);
for(t=0;t<i;t++){
if(strcmp(p+t,x)==0)
printf("%s",y);
else
printf("%s",p+t);
if(t!=i-1)
printf(" ");
}
//printf("%s",p);
}
| 19 |
9,330 | //????
int main()
{
char input[110], replaced[110], replace[110]; //??????????????????????
char *p, *start; //????input??inputL????
int len; //?????????
char temp;
cin.getline(input, 110);
cin.getline(replaced, 110);
cin.getline(replace, 110);
len = strlen(replaced);
p = strstr(input, replaced); //?????????
start = input; //???????
while(p != NULL) //??????
{
if((p == input || isalpha(*(p - 1)) == 0) && isalpha(*(p + len)) == 0)
//??????????
{
*p = '\0'; //??\0?
cout << start << replace;
start = p + len; //start????????????
p = strstr(start, replaced); //p??input?????start?????
}
else
{
p = input + (p - input) + len; //p?????????
temp = *p; //???
*p = '\0';
cout << start;
start = p; //????????
*start = temp; //????
p = strstr(start, replaced);
}
}
cout << start << endl; //????????
return 0;
}
| 19 |
9,331 | int main()
{
char s[1001];
char a[1001];
char b[1001];
char ans[1001]={'\0'};
int i,j,k,p;
gets(s);
gets(a);
gets(b);
int l,la,lb;
l=strlen(s);
la=strlen(a);
lb=strlen(b);
int index;
index=0;
for (i=0;i<l;i++)
{
k=0;
for (j=0;j<la;j++)
{
if (s[i+j]!=a[j]) k=1;
}
if (((i+la)<l)&&(s[i+la]!=' ')) k=1;
if ((i>0)&&(s[i-1]!=' ')) k=1;
if (k==0)
{
for (p=0;p<lb;p++) ans[p+index]=b[p];
index=index+lb-1;
i=i+la-1;
}
if (k>0) ans[index]=s[i];
index++;
}
printf("%s\n",ans);
return 0;
} | 19 |
9,332 | int main()
{
char *s;
char *a;
char *b;
s=(char *)malloc(sizeof (char)*1000);
a=(char *)malloc(sizeof (char)*1000);
b=(char *)malloc(sizeof (char)*1000);
char ans[1001]={'\0'};
int i,j,k,p;
gets(s);
gets(a);
gets(b);
int l,la,lb;
l=strlen(s);
la=strlen(a);
lb=strlen(b);
int index;
index=0;
for (i=0;i<l;i++)
{
k=0;
for (j=0;j<la;j++)
{
if (s[i+j]!=a[j]) k=1;
}
if (((i+la)<l)&&(s[i+la]!=' ')) k=1;
if ((i>0)&&(s[i-1]!=' ')) k=1;
if (k==0)
{
for (p=0;p<lb;p++) ans[p+index]=b[p];
index=index+lb-1;
i=i+la-1;
}
if (k>0) ans[index]=s[i];
index++;
}
printf("%s\n",ans);
free(a);
free(b);
free(s);
return 0;
} | 19 |
9,333 |
void main()
{
char *s,*a,*b,*q,*temp1,*temp2;
int i,j=0,len,lenb,k,flag=1,head=0,tail=0;
s=(char *)malloc(100*sizeof(char));
a=(char *)malloc(100*sizeof(char));
b=(char *)malloc(100*sizeof(char));
temp1=(char *)malloc(200*sizeof(char));
temp2=(char *)malloc(200*sizeof(char));
gets(s);
gets(a);
gets(b);
len=strlen(s);
lenb=strlen(b);
for(i=0;i<len;i++)
{
if(*(s+i)!=' ')
{
if(flag==1)
{
head=i;
flag=0;
}
*(temp1+j)=*(s+i);
j++;
}
else
{
q=s+i;
tail=i;
flag=1;
*(temp1+j)='\0';
j=0;
if(!strcmp(temp1,a))
{
strcpy(temp2,q);
for(k=0;k<lenb;k++)
*(s+head+k)=*(b+k);
*(s+head+k)='\0';
strcat(s,temp2);
}
strcpy(temp1,"\0");
strcpy(temp2,"\0");
}
}
*(temp1+j)='\0';
if(!strcmp(temp1,a))
{
for(k=0;k<lenb;k++)
*(s+head+k)=*(b+k);
*(s+head+k)='\0';
}
puts(s);
}
| 19 |
9,334 |
int main()
{
char s[100],a[100],b[100],c;
int i,j,k,flag=1;
int count=0;
memset(a,0,sizeof(a));
memset(s,0,sizeof(s));
memset(b,0,sizeof(b));
cin.getline(s,100);
cin.getline(a,100);
cin.getline(b,100);
for(i=0;i<=strlen(s);i++)
{
flag=1;
if(s[i] || s[i+1])
{
if(s[i-1]==32 || i==0)
{
for(j=0;a[j]!=0;j++)
{
if(s[i+j]==a[j])
continue;
else{
flag=0;
break;
}
}
if(flag==1)
{
i+=j-1;
for(k=0;b[k]!=0;k++)
{
cout<<b[k];
}
}
else
{
if(s[i]==0)
{
cout<<" ";
}
else
cout<<s[i];
}
}
else cout<<s[i];
}
}
return 0;
}
| 19 |
9,335 | int main()
{
char s[101],a[101],b[101],x[101]={0};
int i,j,n,m;
gets(s);
gets(a);
gets(b);
n=strlen(a);
m=strlen(b);
for(i=0;s[i]!='\0';i++)
{
if((s[i]==a[0]&&s[i-1]==' ')||s[0]==a[0])
{
for(j=0;j<n;j++)
if(s[i+j]!=a[j]) break;
if(n==j) x[i]=1;
}
}
for(i=0;s[i]!='\0';i++)
{
if(x[i]==0) printf("%c",s[i]);
else if(x[i]==1)
{
for(j=0;j<m;j++) printf("%c",b[j]);
i+=n-1;
}
}
printf("\n");
return 0;
}
| 19 |
9,336 | int main(){
char a[100],b[100],c[200];
int i,j=0,k=0,z=0,p,q,r,m,h=0,v;
int t[100],n[100];
char u,w;
gets(c);
scanf("%s",a);
scanf("%s",b);
p=strlen(a);
q=strlen(b);
r=strlen(c);
u=a[0];
for(i=0;i<r;i++){
w=c[i];
if(u==w){
if(i==0||c[i-1]==' '){
t[j]=i;
j+=1;
}
else {
k+=1;
}
}
else {
k+=1;
}
}
if(k==r){
printf("%s",c);
}
else {
for(k=0;k<j;k++){
for(i=1;i<p;i++){
m=t[k];
u=a[i];
w=c[m+i];
if (u!=w){
z+=1;
break;
}
}
if (i==p){
n[h]=t[k];
h+=1;
}
}
if(z==j){
printf("%s",c);
}
else {
m=n[0];
if (m==0){
for(i=0;i<h-1;i++){
for(k=0;k<q;k++){
printf("%c",b[k]);
}
v=n[i+1];
for(k=p+n[i];k<v;k++){
printf("%c",c[k]);
}
}
for(i=0;i<q;i++){
printf("%c",b[i]);
}
for(i=p+n[h-1];i<r;i++){
printf("%c",c[i]);
}
}
else {
for(i=0;i<n[0];i++){
printf("%c",c[i]);
}
for(i=0;i<h-1;i++){
for(k=0;k<q;k++){
printf("%c",b[k]);
}
v=n[i+1];
for(k=p+n[i];k<v;k++){
printf("%c",c[k]);
}
}
for(i=0;i<q;i++){
printf("%c",b[i]);
}
for(i=p+n[h-1];i<r;i++){
printf("%c",c[i]);
}
}
}
}
return 0;
}
| 19 |
9,337 | void main()
{
char s[300],a[200],b[200];
char *temp,*ps,*pa,*pb;
int flag,ls,la,lb;
gets(s);
gets(a);
gets(b);
ls=strlen(s);
la=strlen(a);
lb=strlen(b);
ps=s;
pa=a;
pb=b;
while (ps<s+ls)
{
flag=1;
for (pa=a;((*ps!=' ') && (*ps!='\0'));ps++,pa++)
if (*ps!=*pa) flag=0;
if ((flag) && (pa==a+la))
{
if (la>=lb)
{
ps=ps-la;
while (*pb!='\0') *ps++=*pb++;
if (la>lb)
{
while (*(ps+la-lb)!='\0')
{
*ps=*(ps+la-lb);
ps++;
}
*ps='\0';
}
}
else
{
temp=ps;
for (ps=s+ls;ps>=temp;ps--)
*(ps+lb-la)=*ps;
ps=ps-la+1;
while (*pb!='\0') *ps++=*pb++;
}
pa=a;
pb=b;
ls=strlen(s);
}
ps++;
}
ps=s;
printf("%s",ps);
} | 19 |
9,338 | void main()
{
char s[101],s1[101],s2[101],s4[101];
gets(s);
gets(s1);
gets(s2);
char s3[100][101];
char *p;
char (*p3)[101];
int n,i;
n=strlen(s);
p=s;
p3=s3;
i=0;
for(p=s;p<=(s+n);p++)
{
if((*p==' ')||(*p=='\0'))
{
*((*p3)+i)='\0';
p3++;
i=0;
}
else
{
*((*p3)+i)=*p;
i++;
}
}
*((*p3))='\0';
for(p3=s3;*((*p3))!='\0';p3++)
{
if(strcmp(*p3,s1)==0)
{
strcpy(*p3,s2);
}
}
p3=s3;
strcpy(s4,*p3);
for(p3=s3+1;*((*p3))!='\0';p3++)
{
strcat(s4," ");
strcat(s4,*p3);
}
puts(s4);
} | 19 |
9,339 | /************
* ???????
* ?????1000012923
* ???2010.11.6
* ?????????????
*************/
int main(){
char s0[2001],s1[201],s2[201];
cin.getline(s0,2000);
cin.getline(s1,200);
cin.getline(s2,200);
int L0=0,L1=0,L2=0;
while(s0[L0]!=0)L0++;//???????strlen???
while(s1[L1]!=0)L1++;
while(s2[L2]!=0)L2++;
if(L1==0){
cout<<s0;
return 0;
}
for(int i=0;i<=L0-L1;i++){//??
int is=0;
for(int j=0;j<L1;j++)
if(s0[i+j]!=s1[j]){
is++;
break;
}
if(is!=0)continue;//?????????
if((i!=0&&s0[i-1]!=' ')||(s0[i+L1]!=' '&&s0[i+L1]!=0))continue;//???????????
if(L1>L2)for(int j=i+L1;j<L0;j++)s0[j+L2-L1]=s0[j];//???????
else for(int j=L0-1;j>=i+L1;j--)s0[j+L2-L1]=s0[j];
for(int j=i;j<i+L2;j++)s0[j]=s2[j-i];
L0+=L2-L1;//????
i+=L2;
}
s0[L0]=0;
cout<<s0;
}
| 19 |
9,340 | int main()
{
int j=0,i,l,ls;
char s[105],str[105],a[105],x[105],s1[105]={' ','\0'},s2[2]={' ','\0'};
gets(s);
gets(str);
gets(a);
strcat(s,s2);
strcat(s1,s);
strcpy(s,s1);
l=strlen(str);
ls=strlen(a);
strcpy(x,s);
for(i=0;s[i]!='\0';i++){
if(s[i]==str[j]){
j++;
}else{
j=0;
}
if(l==j&&s[i-j]==' '&&s[i+1]==' '){
if(i-j!=-1){
x[i-j+1]='\0';
strcat(x,a);
}else{
strcpy(x,a);
}
strcat(x,s+i+1);
i=i+ls-l;
j=0;
strcpy(s,x);
}
}
for(i=0;x[i+2]!='\0';i++){
x[i]=x[i+1];
}
x[i]='\0';
printf("%s",x);
return 0;
} | 19 |
9,341 | int main()
{
int a,i,j=0;
char s[101]={0},c[101],d[101];
gets(s);
gets(c);
gets(d);
a=strlen(s);
for(i=0;i<a;i++)
{
char b[101]={0};
while(s[i]!=' '&&i<a)
{
b[j]=s[i];
j++;
i++;
}
if(strcmp(b,c)==0)
{
printf("%s",d);
}
else
{
printf("%s",b);
}
if(i<a)
{
printf(" ");
}
j=0;
}
return 0;
} | 19 |
9,342 | int main()
{
char c[100],s[100],d[100],e[30][30];
int m=0,n=0,l,i;
gets(c);
l=strlen(c);
gets(s);
gets(d);
for(i=0;i<(l+1);i++)
{
e[m][n]=c[i];
n++;
if(c[i]==' ')
{
e[m][n-1]=0;
m++;
n=0;
}
}
for(i=0;i<=m;i++)
if (strcmp(s,e[i])==0) strcpy(e[i],d);
printf("%s",e[0]);
for(i=1;i<=m;i++)
printf(" %s",e[i]);
} | 19 |
9,343 | int main()
{
char s[100],a[100],b[100],r[50][20]={0},t[100];
int i=0,j,c=0,l;
gets(s);
gets(a);
gets(b);
l=strlen(s);
while(i<=l-1)
{j=0;
c++;
while(s[i]!=' '&&i<=l-1)
{r[c][j]=s[i];
j++;
i++;}
i++;}
for(i=1;i<=c-1;i++)
{if(strcmp(r[i],a)==0)
{printf("%s ",b);}
else
{printf("%s ",r[i]);}}
if(strcmp(r[c],a)==0)
{printf("%s",b);}
else
{printf("%s",r[c]);}
return 0;
} | 19 |
9,344 |
void Swap (char *str, char *FindWord, char *SwapWord){
int j,s,k,i=0,SwapWordLength,yc,FindWordLength,n;
char *p1,*p2;
p1=str;
p2=FindWord;
yc=strlen(str);
FindWordLength=strlen(FindWord);
SwapWordLength=strlen(SwapWord);
n=SwapWordLength-FindWordLength;
while(*p1!='\0'){
if((*p1==*p2)&&(!isalpha(*(p1-1))))
while((*p1==*p2)&&(*p2!='\0'))
{ p1++; p2++; i++; }
else { p1++; i++; }
if((*p2=='\0')&&(isalpha(*p1)==0)){
if(n<0){
j=i-FindWordLength;
for(k=0; k<SwapWordLength; k++)
str[j++]=SwapWord[k];
for(s=i; s<yc; s++)
str[j++]=str[s];
while(j<yc)
str[j++]='\0';
yc=strlen(str);
i+=n;
p1+=n;
}
else
{
for(s=yc+n; s>i; s--)
str[s]=str[yc--];
j=i-FindWordLength;
for(k=0; k<SwapWordLength; k++)
str[j++]=SwapWord[k];
yc=strlen(str);
i+=n;
p1+=n;
}
}
p2=FindWord;
}
}
int main(){
char sen[MAX],old[LEN],a[LEN];
gets(sen);
gets(old);
gets(a);
Swap(sen,old,a);
puts(sen);
return 0;
}
| 19 |
9,345 | main()
{
char str[101],a[101],b[101];
int i=0,j,t;
gets(str);
scanf("%s",a);
scanf("%s",b);
do
{
j=0;
t=i;
while (str[i]==a[j]&&j<strlen(a))
{
i++;
j++;
}
if (j==strlen(a))
{
printf(str[i]=='\0'?"%s":"%s ",b);
i++;
}
else
{
do
{
printf("%c",str[t]);
t++;
}
while (str[t]!=' '&&str[t]!='\0');
if (str[t]==' ') printf(" ");
i=t+1;
}
}
while (str[i-1]!='\0');
printf("\n");
return 0;
} | 19 |
9,346 | void main()
{
char stc[201],wrd1[101],wrd2[101],wrdd[100][101];
int i,j=0,k=0,l=0;
gets(stc);
gets(wrd1);
gets(wrd2);
for(i=0;stc[i]!='\0';i++)
{if(stc[i]!=' ')wrdd[j][k]=stc[i],k++;
else wrdd[j][k]='\0',j++,k=0;}
for(i=0;i<=j;i++)
if(strcmp(wrd1,wrdd[i])==0)strcpy(wrdd[i],wrd2);
for(i=0,k=0;l<=j;i++)
{if(wrdd[l][k]!='\0') stc[i]=wrdd[l][k],k++;
else stc[i]=' ',l++,k=0;}
stc[i-1]='\0';
puts(stc);
} | 19 |
9,347 | int main(){
char a[100];
char b[100];
char c[100];
char d[50][100];
gets(a);
scanf("%s",b);
scanf("%s",c);
int chang,i,n,m;
int u=0,v=0;
chang=strlen(a);
for(i=0;i<chang;i++){
if(a[i]!=' '){
d[u][v]=a[i];
v++;
}else{
v=0;
u++;
}
}
for(i=0;i<u;i++){
if(strcmp(b,d[i])==0){
printf("%s ",c);
}else{
printf("%s ",d[i]);
}
}
if(strcmp(b,d[i])==0){
printf("%s",c);
}else{
printf("%s",d[u]);
}
return 0;
}
| 19 |
9,348 |
int main(){
char string[100][100];
char str[1000];
gets(str);
int len=strlen(str);
int i;
int count=0;
for(i=0;i<len+1;i++){
if (str[i]==' '||(str[i]=='\0')){
int k,q=0;
for(k=i-1;k>=0;k--){
if (str[k]==' ') break;
}
for(++k;k<=i;k++){
string[count][q]=str[k];
q++;
}
string[count][q-1]='\0';
count++;
}
}
char from[100];
char to[100];
gets(from);
gets(to);
char *nowword;
int j=0;
for(j=0;j<count;j++){
nowword=string[j];
if (strcmp(nowword,from)==0){
strcpy(nowword,to);
}
}
printf("%s",string[0]);
for(i=1;i<count;i++) printf(" %s",string[i]);
printf("\n");
return 0;
}
| 19 |
9,349 | int main(){
char s[110],a[110],b[110];
gets(s);
scanf("%s%s",a,b);
int n=strlen(s);
int na=strlen(a);
int i,j,ans[30],c=0;
for(i=0;i<n;i++){
if(s[i]==' '||i==0){
int count=0,q;
if(i==0)
q=0;
else
q=i+1;
for(j=q;j<=q+na-1;j++){
if(s[j]!=a[j-q])
break;
count++;
}
if(count==na){
ans[c]=q;
c++;
}
}
}
if(c==0)
printf("%s",s);
else{
int p=0;
for(i=0;i<=c-1;i++){
for(j=p;j<ans[i];j++){
printf("%c",s[j]);
}
printf("%s",b);
p=ans[i]+na;
}
for(j=p;j<n;j++){
printf("%c",s[j]);
}
}
}
| 19 |
9,350 | int main()
{
char zf1[110],zfa[110],zfb[110];
gets(zf1);
gets(zfa);
gets(zfb);
int x=strlen(zf1);
int y=strlen(zfa);
int z=strlen(zfb);
int i,j;
int k=0,m=0,g=0,h=0;
int sz[100];
for(i=0;i<x;i++)
{
if(i==0)
{
if(zf1[i]==zfa[0])
{
k=0;
if(zf1[i+y]==' '||zf1[i+y]=='\0')
{
for(j=0;j<y;j++)
{
if(zf1[i+j]==zfa[j])
{
k++;
}
}
if(k==y)
{
sz[m]=i;
m++;
}
}
}
}
if(i!=0)
{
if(zf1[i]==zfa[0]&&zf1[i-1]==' ')
{
k=0;
if(zf1[i+y]==' '||zf1[i+y]=='\0')
{
for(j=0;j<y;j++)
{
if(zf1[i+j]==zfa[j])
{
k++;
}
}
if(k==y)
{
sz[m]=i;
m++;
}
}
}
}
}
for(j=0;j<x;j++)
{
h=0;
for(i=0;i<m;i++)
{
if(j==sz[i])
{
printf("%s",zfb);
j=j+y-1;
h=1;
break;
}
}
if(h!=1)
{
printf("%c",zf1[j]);
}
}
return 0;
}
| 19 |
9,351 | int main(){
char a[200],b[100],c[100],d[200];
int i,j,na=0,nb=0,nc=0,m=0,l=0,x=0;
gets(a);
gets(b);
gets(c);
for (i=0;a[i]!='\0';i++){
na++;
}
for (i=0;b[i]!='\0';i++){
nb++;
}
for (i=0;c[i]!='\0';i++){
nc++;
}
for (i=0;i<=na+x*(nc-nb)-1;i++){
if (a[i]==b[0]){
l=1;
for (j=1;j<=nb-1;j++){
if (a[i+j]!=b[j])
break;
else l=l+1;
}
if (((l==nb)&&(a[i-1]==' ')&&(a[i+nb]==' '))||((i==0)&&(l==nb)&&(a[i+nb]==' '))||((l==nb)&&(i>=na+x*(nc-nb)-nb-1)&&(a[i-1]==' '))){
for (m=i+nb;m<=na+2;m++){
d[m-i-nb]=a[m];
}
for (m=i;m<=i+nc-1;m++){
a[m]=c[m-i];
}
for (m=i+nc;m<=na+nc-nb+2;m++){
a[m]=d[m-i-nc];
}
i=i+nc-nb;
x=x+1;
}
}
}
a[na+x*(nc-nb)]='\0';
printf("%s",a);
return 0;
}
| 19 |
9,352 | int main(){
char zf[600],dc[30][30],y[30],h[30];
gets(zf);
gets(y);
gets(h);
int n=strlen(zf),a=0,b=0;
for(int i=0;i<n+1;i++){
if(zf[i]!=' '&&zf[i]!='\n'){
dc[a][b]=zf[i];
b++;
}else{
dc[a][b]='\0';
a++;
b=0;
}
}
for(int k=0;k<a+1;k++){
if(strcmp(dc[k],y)==0){
strcpy(dc[k],h);
}
}
printf("%s",dc[0]);
for(int m=1;m<a+1;m++){
printf(" %s",dc[m]);
}
return 0;
}
| 19 |
9,353 |
int main() {
char buf1[100];
char buf2[100];
char buf3[100];
char *tmp;
gets(buf1);
gets(buf2);
gets(buf3);
tmp = buf1;
while ((*tmp) != 0) {
if (strncmp(tmp, buf2, strlen(buf2)) == 0) {
if ((tmp == buf1 || *(tmp-1) == ' ')) {
printf("%s", buf3);
tmp += strlen(buf2);
} else {
printf("%c", *tmp);
++tmp;
}
}
else {
printf("%c", *tmp);
++tmp;
}
}
return 0;
}
| 19 |
9,354 | int main()
{
char s[100],a[100],b[100],c[100][100];
int i,j,m=0,n=0;
gets(s);
gets(a);
gets(b);
for(i=0;i<strlen(s);i++)
{
if(s[i]==' ')
{
n++;
c[n][0]=s[i+1];
m=1;
i++;
}
else
{
c[n][m]=s[i];
m++;
}
}
for(i=0;i<=n;i++)
{
if(strcmp(c[i],a)==0)
strcpy(c[i],b);
}
for(i=0;i<n;i++)
printf("%s ",c[i]);
printf("%s",c[n]);
return 0;
} | 19 |
9,355 | int main()
{
char str[40][101]={'\0'};
char c[101]={'\0'};
cin.getline(c,101);
int i=0,j=0,k=0;
while(c[i]!='\0')
{
if(c[i]!=' ')
{
str[j][k]=c[i];
k++;
}
if(c[i]==' ')
{
j++;
k=0;
}
i++;
}
char st1[100],st2[100];
cin>>st1;
cin>>st2;
for(i=0;i<j+1;i++)
if(strcmp(str[i],st1)==0)
strcpy(str[i],st2);
for(i=0;i<j;i++)
cout<<str[i]<<" ";
cout<<str[j];
return 0;
} | 19 |
9,356 | int main(){
char sen[101],word1[101],word2[101],danci[50][101];
int LEN[50],LEN1,i,k=0,j=0;
gets(sen);
gets(word1);
gets(word2);
LEN1=strlen(sen);
for(i=0;i<LEN1;i++){
if(sen[i]!=' '){
danci[j][k]=sen[i];
k++;
}else{
danci[j][k]='\0';
j++;
k=0;
}
}
danci[j][k]='\0';
for(i=0;i<j;i++){
LEN[i]=strlen(danci[i]);
}
for(i=0;i<=j;i++){
if(strcmp(danci[i],word1)==0){
strcpy(danci[i],word2);
}
}
for(i=0;i<j;i++){
printf("%s ",danci[i]);
}
printf("%s\n",danci[j]);
return 0;
} | 19 |
9,357 |
int main(){
char zfc[101],sor[101],rep[101];
int dec,i,j;
gets(zfc);
scanf("%s",sor);
scanf("%s",rep);
int n=strlen(zfc);
int k=strlen(sor);
for(i=0;i<n;i++){
dec=0;
for(j=i;j<=i+k-1;j++){
if(zfc[j]!=sor[j-i]){
dec=1;
break;
}
}
if(((i==0)&&(dec==0))||((dec==0)&&(zfc[i-1]==' '||zfc[i-1]==','||zfc[i-1]=='.'))){
printf("%s",rep);
i=i+k-1;
}
else{
printf("%c",zfc[i]);
continue;
}
}
return 0;
}
| 19 |
9,358 | int main ()
{
int lena,posi,i,j;
char a[101][100],b[101],c[101],index=0,e[200];
gets(e);
i=0;
for(j=0;j<strlen(e);j++)
{
if(e[j]==' ')
{
index++;
i=0;
}
else
a[index][i++]=e[j];
}
index++;
//printf("%d!\n",index);
scanf("%s",b);
scanf("%s",c);
for(i=0;i<index;i++)
{
if(strcmp(a[i],b)==0) printf("%s",c);
else printf("%s",a[i]);
if(i!=index-1)printf(" ");
}
return 0;
}
| 19 |
9,359 | void main()
{
char *s,*a,*b,*word;
int i,j=0,flag=0;
s=(char*)malloc(100*sizeof(char));
a=(char*)malloc(100*sizeof(char));
b=(char*)malloc(100*sizeof(char));
word=(char*)malloc(100*sizeof(char));
gets(s);
gets(a);
gets(b);
i=0;
while(*(s+i))
{
if (*(s+i)==' ')
{
if (flag!=0) printf(" ");
flag=1;
*(word+j)='\0';
j=0;
if (strcmp(word,a)==0) printf("%s",b);
else printf("%s",word);
}
else
{
*(word+j)=*(s+i);
j++;
}
i++;
}
*(word+j)='\0';
if (flag!=0) printf(" ");
if (strcmp(word,a)==0) printf("%s",b);
else printf("%s",word);
} | 19 |
9,360 | void main()
{
char s[100],c[100][100]={0},a[100],b[100]={0},e[100][100],f[100],*p;
int m,i,n=0,l=0,k=0,d[100]={0},j;
gets(s);
gets(a);
gets(b);
m=strlen(s);
for(p=s;p<s+m;p++)
if(*p==32)
n++;
for(i=0;i<=n;i++)
{
for(j=0;*(s+k)!=32;j++)
{
*(*(c+i)+j)=*(s+k);
k++;
}
if(*(s+k)==32)
k++;
}
for(i=0;i<=n;i++)
if(strcmp(c[i],a)==0)
strcpy(e[i],b);
else
strcpy(e[i],c[i]);
strcpy(f,e[0]);
for(i=1;i<=n;i++)
{
strcat(f," ");
strcat(f,e[i]);
}
printf("%s",f);
}
| 19 |
9,361 | int main(){
char s[101],a[101],b[101];
int n,m;
int i,j,k=0;
gets(s);
scanf("%s%s",a,b);
n=strlen(s);
m=strlen(a);
for(i=0;i<n;i++)
{
if((i==0&&s[i]==a[0]&&s[i+m-1]==a[m-1]&&s[i+m]==' ')||(i!=0&&s[i-1]==' '&&s[i]==a[0]&&s[i+m-1]==a[m-1]&&s[i+m]==' ')||(i+m==n&&s[i-1]==' '&&s[i]==a[0]&&s[i+m-1]==a[m-1])){
for(j=i;j<i+m;j++)
{
if(s[j]==a[j-i])
{
k++;
}
}
if(k==m)
{
printf("%s",b);
i+=m-1;
}else
{
printf("%c",s[i]);
}
k=0;
}else
{
printf("%c",s[i]);
}
}
printf("\n");
return 0;
}
| 19 |
9,362 | void main()
{
char c[101],a[101],b[101],s[10001];
int n[101],i;
for(i=0;i<=100;i++) c[i]=s[i]=a[i]='\0';
gets(c);
gets(a);
gets(b);
int lc;
lc=strlen(c);
n[0]=-1;
int j=1;
for(i=0;i<=(lc-1);i++)
{
if(c[i]==' ')
{
n[j]=i;
j++;
}
}
n[j]=lc;
char x[2];
x[0]=' ';
x[1]='\0';
for(i=1;i<=j;i++)
{
int m;
char ch[101];
for(m=0;m<=100;m++) ch[m]='\0';
for(m=0;m<=(n[i]-n[i-1]-2);m++) ch[m]=c[n[i-1]+m+1];
if(strcmp(a,ch)==0) strcat(s,b);
else strcat(s,ch);
if(i<j) strcat(s,x);
}
puts(s);
} | 19 |
9,363 | int main()
{char a[101]={0},b[100]={0},c[100]={0};//???????a??????b?????c????????
int i,j,k,m,count=0;//i,j,k,m????????count????
int x,y;
int al,bl,cl;
cin.getline(a,100);
cin.getline(b,100);
cin.getline(c,100);
al=strlen(a);//??????????
bl=strlen(b);
cl=strlen(c);
for(i=0;i<=100;i++)
{for(j=0;j<bl;j++)
{if (a[i+j]==b[j])//?a???b????????????????????+1
count++;}//????=b?????????????b?????????????????????0
x=((i>0)&&(a[i-1]==' ')&&((a[i+bl]==' ')||a[i+bl]==(char)0)); //?????????????????????
y=((i==0)&&((a[i+bl]==' '||a[i+bl]==(char)0))); //???????????????
if(count==bl&&(x||y))//?????????a???????????
{if(bl>=cl)//?????????
{for(k=0;k<cl;k++)
a[i+k]=c[k];//??????????????????????
for(m=i+cl;m<al-cl;m++)
a[m]=a[m-cl+bl];}//?????????
else//??????????????
{for(m=100;m>=i+cl;m--)
a[m]=a[m-(cl-bl)];//?????????????c??
for(k=0;k<cl;k++)//???c
a[i+k]=c[k];
}
}
count=0;
}
cout<<a;
}
| 19 |
9,364 |
int main()
{
int i=0,j,count=-1,pos[51],k=0;
char a[51][101],b[101],c[101],d;
while (1)
{
cin>>a[i];
i++;
if (d=cin.get(),d=='\n') break;
}
i--;
cin>>b>>c;
for (j=0;j<=i;j++)
{
if (strcmp(a[j],b)==0)
{
count++;
pos[count]=j;
}
}
for (j=0;j<=i;j++)
{
if ((k<=count)&&(pos[k]==j))
{
if (j==i) cout<<c;
else cout<<c<<" ";
k++;
}
else
{
if (j==i) cout<<a[j];
else cout<<a[j]<<" ";
}
}
return 0;
} | 19 |
9,365 | /**
* ???3.cpp
* ???????
* ??????
* ???2010?11?17?
*/
int main()
{
char a[100],b[100],c[100];
int i,j,k,lena,lenb,lenc,flag;
for(i=0;i<100;i++)
{a[i]=0;}
gets(a); //????????
gets(b);
gets(c);
lena=strlen(a); //?????????
lenb=strlen(b);
lenc=strlen(c);
for(i=0;i<=lena-lenb;i++) //??????a???b?????
{
flag=1;
for(j=0;j<lenb;j++)
{
if(a[i+j]!=b[j])
{flag=0;break;}
}
if(flag==1 && (i==0 || a[i-1]==' ') && (i==lena-lenb || a[i+lenb]==' ') )
{
if(lenb>lenc) //????????
{
for(k=i,j=0;k<i+lenc,j<lenc;k++,j++) //?????
{a[k]=c[j];}
for(k=i+lenc;k<lena;k++) //?????????
{a[k]=a[k+lenb-1];}
i+=lenc-1;
lena-=lenb-lenc;
}
if(lenb==lenc)
{
for(k=i,j=0;k<i+lenc,j<lenc;k++,j++) //?????
{a[k]=c[j];}
}
if(lenb<lenc) //????????
{
for(k=lena-1+lenc-lenb;k>=i+lenc;k--) //??????????
{a[k]=a[k-lenc+lenb];}
for(k=i,j=0;k<i+lenc,j<lenc;k++,j++) //??????
{a[k]=c[j];}
i+=lenc-1;
lena+=lenc-lenb; //??????
}
}
}
cout<<a<<endl;
return 0;
} | 19 |
9,366 | int main()
{
char a[200],b[200],c[200],d[200];
int ai=0,lb,la,lc,bi=0,ci=0,di=0,k;
gets(a);
scanf("%s",&b);
scanf("%s",&c);
lb=strlen(b);la=strlen(a);lc=strlen(c);
while (ai!=la)
{
bi=0;ci=0;
if (ai!=0)
{
if ((a[ai]==b[bi]) && (a[ai-1]==' '))
{
k=ai;
while ((a[ai]==b[bi]) && (a[ai]!=' ') && (a[ai]!='\0'))
{ bi++; ai++; }
if (bi==lb)
{
while (ci!=lc)
{
d[di]=c[ci];
di++;ci++;
}
}
else
{
ai=k;d[di]=a[ai];
di++;ai++;
}
}
else
{
d[di]=a[ai]; ai++;di++;
}
}
else
{
if (a[ai]==b[bi])
{
k=ai;
while (a[ai]==b[bi])
{ bi++; ai++; }
if (bi==lb)
{
while (ci!=lc)
{
d[di]=c[ci];
di++;ci++;
}
}
else
{
ai=k;d[di]=a[ai];
di++;ai++;
}
}
else
{
d[di]=a[ai]; ai++;di++;
}
}
}
// puts(a);puts(b);puts(c);
d[di]='\0';
// printf("%d",la);
puts(d);
return 0;
}
| 19 |
9,367 | /*
* 1000012889_30.3.cpp
*
* Created on: 2010-11-10
* Author: ???
* ??:????
*/
int main(){
int k,i,j,r,h,l,m,n,p,q;
char s[101],a[101],b[101],c[101];
cin.getline(s,101);
cin>>a>>b;
k=strlen(s);
i=strlen(a);
j=strlen(b);
for(r=0;r<=k-i+1;r++){
for(h=r,l=0;h<r+i;h++,l++)
if(s[h]!=a[l])
break;
if(l==i&&((r==0&&s[r+i]==' ')||(r>0&&s[r-1]==' '&&s[r+i]==' ')||(r+i==k&&s[r-1]==' '))){
for(m=0,n=r+i;m<=k-r-i;m++,n++)
c[m]=s[n];
for(p=0,q=r;p<=j;p++,q++)
s[q]=b[p];
strcat(s,c);
k=k-i+j;
r=r+j;
}
}
cout<<s<<endl;
return 0;
}
| 19 |
9,368 | int main()
{
char s[100];//????????
int i=0,count=0,j=0;
char str[100][100];//???????????????
char word1[100],word2[100];//?????????????
cin.getline(s,100,'\n');
for(i=0;i<100;i++)//???????????????????
{
if(s[i]!=' ')
{
str[count][j]=s[i];
j++;
}
else if(s[i]==' ')
{
str[count][j+1]='\0';
count++;
j=0;
continue;
}
else if(s[i]=='\0')
break;
}
cin.getline(word1,100,'\n');
cin.getline(word2,100,'\n');
for(i=0;i<=count;i++)//????????????????????????
{
if(strcmp(str[i],word1)==0)
strcpy(str[i],word2);
}
cout<<str[0];
for(i=1;i<=count;i++)
cout<<' '<<str[i];
return 0;
} | 19 |
9,369 | int main()
{
char s[10000] , a[100] , b[100] ;
gets(s);
gets(a);
gets(b);
int n = strlen(s)-strlen(a) , m = strlen(a) , l = strlen(s) , k[10] , d = 0;
for(int i = 0;i<=n;i++)
{
int c = 0;
for(int j = 0;j<m;j++)
{
if(a[j] != s[j+i])
c ++;
}
if(c == 0 && (int)s[i-1]==32)
{
k[d+1] = i;
d++;
}
else if(c ==0 && (int)s[i]>=65 && (int)s[i]<=90)
{
k[d+1] = i;
d++;
}
}
k[0] = 0;
k[d+1] = l;
for(int q = k[0];q<k[1];q++)
printf("%c",s[q]);
for(int r = 1;r<=d;r++)
{
printf("%s",b);
for(int g = k[r]+m;g<k[r+1];g++)
printf("%c",s[g]);
}
return 0;
} | 19 |
9,370 | int main()
{
char s[100],a[100],b[100];
char zfc[100][100];
int i,j,len,k=1,wz[100];
gets(s);
scanf("%s%s",a,b);
len= strlen(s);
wz[0]=0-1;
for ( i = 0; i<len; i++ ){
if (s[i]==' ' ){
wz[k]=i;
k++;
}
}
wz[k]=len;
for(i=0;i<k;i++){
for(j=wz[i]+1;j<wz[i+1];j++)
zfc[i][j-wz[i]-1]=s[j];
zfc[i][j-wz[i]-1]='\0';
}
if(strcmp(zfc[0],a)!=0){
printf("%s",zfc[0]);
}else{
printf("%s",b);
}
for(i=1;i<k;i++){
if(strcmp(zfc[i],a)!=0){
printf(" %s",zfc[i]);
}else{
printf(" %s",b);
}
}
return 0;
}
| 19 |
9,371 | int main()
{
char name[100],a[100],b[100];
int k=0,j=0,n,i,p;
char word[100][100];
gets(name);
gets(a);
gets(b);
n=strlen(name);
for(i=0;i<n;i++)
{
if(name[i]!=' ')
{
word[k][j]=name[i];
j++;
}
else
{
word[k][j]='\0';
k++;
j=0;
}
}
word[k][j] = '\0';
k++;
for(p=0;p<k;p++)
{
if(strcmp(word[p],a)==0)
{
strcpy(word[p],b);
}
}
for(p=0;p<k-1;p++)
{
printf("%s ",word[p]);
}
printf("%s",word[k-1]);
return 0;
} | 19 |
9,372 | int main()
{
char ch[100],a[100],b[100],c[100][100];
int i,n[100],k,m,j=0;
n[0]=-1;
gets(ch);
gets(a);
gets(b);
for (i=0;ch[i]!='\0';i++)
{
if (ch[i]==' ')
{
j++;
n[j]=i;
for (k=0,m=n[j-1]+1;k<i-n[j-1]-1&&m<i;k++,m++) c[j][k]=ch[m];
}
continue;
}
for (i=n[j]+1;ch[i]!='\0';i++) c[j+1][i-1-n[j]]=ch[i];
for (m=1;m<=j+1;m++)
if (strcmp(c[m],a)==0) strcpy(c[m],b);
for (m=1;m<=j;m++) printf("%s ",c[m]);printf("%s",c[j+1]);
return 0;
} | 19 |
9,373 |
int main()
{
char *p,*max,*min;
char s[110],a[110],b[110];
int l=0;
gets(s);
scanf("%s%s",a,b);
p=strtok(s," ");
while(p)
{
if (l!=0)
printf(" ");
if (strcmp(p,a)==0)
p=b;
printf("%s",p);
p=strtok(NULL," ");
l++;
}
printf("\n");
return 0;
}
| 19 |
9,374 | int main()
{
char s[101];
gets(s);
int l = strlen(s);
s[l] = ' ';
s[l + 1] = '\0';
char a[100];
cin >> a;
char b[100];
cin >> b;
char s1[100];
int i;
int j = 0;
for(i = 0; i < strlen(s); i ++)
{
if(s[i] != ' ')
{
s1[j] = s[i];
j ++;
}
else
{
s1[j] = '\0';
j = 0;
if(strcmp(a, s1) == 0)
cout << b;
else
cout << s1;
if(i != strlen(s) - 1 )
cout << ' ';
}
}
}
| 19 |
9,375 | void main()
{int na,nb,nc,i,j,k,p,num=0;
char a[1000],b[100],c[100];
gets(a);
gets(b);
gets(c);
na=strlen(a);
nb=strlen(b);
nc=strlen(c);
for(i=0;i<1000;i++)
{for(j=0;j<nb;j++)
if(*(a+i+j)!=*(b+j))
break;
if((j==nb&&*(a+i+nb)==' '&&*(a+i-1)==' ')||(j==nb&&i==0&&*(a+i+nb)==' ')||(j==nb&&i==na+num*(nc-nb)-nb&&*(a+i-1)==' '))
{num++;
if(nb>=nc)
{for(k=0;k<nc;k++)
*(a+i+k)=*(c+k);
for(p=0;p<na+num*(nc-nb);p++)
*(a+i+nc+p)=*(a+i+nb+p);}
if(nb<nc)
{for(p=((nc-nb)*num+na-1);p>i+nb-1;p--)
*(a+p)=*(a+p-(nc-nb));
for(k=0;k<nc;k++)
*(a+i+k)=*(c+k);}
}
}
for(i=0;i<(na+num*(nc-nb));i++)
printf("%c",*(a+i));
} | 19 |
9,376 |
int main(){
char str[1000],strd[20],strb[20];
char zfc[50][200];
gets(str);
int i,k;
int j=0,n=0;
for(i=0;str[i]!='\0';i++)
{
if(str[i]==' ')
{
str[i]='\0';
strcpy(zfc[n],(str+j));
n++;
j=i+1;
}
}
strcpy(zfc[n],(str+j));
n++;
gets(strb);
gets(strd);
for(k=0;k<n;k++)
{
if(strcmp(strb,zfc[k])==0){
strcpy(zfc[k],strd);
}
}
printf("%s",zfc[0]);
for(i=1;i<n;i++)
{
printf(" %s",zfc[i]);
}
return 0;
}
| 19 |
9,377 | int main()
{
char d[256];
char words[50][256]={0};
char a[100],b[100];
int n=1,t;
int i,j,k=-1;
gets(d);
gets(a);
gets(b);
for (i=0;d[i]!='\0';i++)
{
if (d[i]==' ')
{
n++;
}
}
for (i=0,t=1;i<n;i++)
{
for (k=k+1,j=0;d[k]!='\0'&&d[k]!=' ';j++,k++)
{
words[i][j]=d[k];
if (a[j]!=d[k])
{
t=0;
}
}
if (t==1&&strlen (a)==strlen (words[i]))
{
for (j=0;b[j]!='\0';j++)
{
words[i][j]=b[j];
}
}
words[i][j]='\0';
t=1;
}
printf ("%s",words[0]);
for (i=1;i<n;i++)
printf (" %s",words[i]);
return 0;
} | 19 |
9,378 | int cincd(char a[]){
int num=0;
for(int i=0;;i++){
a[i]=getchar();
if(a[i]=='\n')break;
num++;
}
return num;
}//????????
void coutt(char a[],int length){
for(int i=0;i<length;i++){
cout<<a[i];
}
}//????????
int main(){
char a[100][20],b[100],c[100];
int x=0,d[100],e,f,num=0;//d???????? ,e?f???b?c???,num?????
for(int j=0;;j++){
a[x][j]=getchar();
if(a[x][j]=='\n'){
d[x]=j;
num=x+1;
break;
}
if(a[x][j]==' '){
d[x]=j;
x++;
j=-1;
}
}//??a
e=cincd(b);
f=cincd(c);
for(int i=0;i<num;i++){
if(i!=0)cout<<" ";
if(d[i]==e){
int length=0;
for(int j=0;j<e;j++){
if(a[i][j]==b[j])length++;
}
if(length==e)coutt(c,f);//???????
else coutt(a[i],d[i]);//????
continue;
}
else coutt(a[i],d[i]);//????
}
return 0;
}
| 19 |
9,379 | /*
* 1000012761_303.cpp
*
* Created on: 2010-11-5
* Author: 378073652
*/
int main(){
char a[100],b[100],c[100],d[10000];
int i=0,j=0,k,la,lb,lc,s=0;
gets(a);
gets(b);
gets(c);
la=strlen(a);
lb=strlen(b);
lc=strlen(c);
for(i=0;i<la;i++){
for(k=0,s=0;k<lb;k++){
if(a[i]==b[k])s=s+1;
i=i+1;}
if((a[i-k-1]==' ')&&(s==lb)||((i-k==0)&&(s==lb))) {i=i-1;for(k=0;k<lc;k=k+1) {d[j]=c[k] ;j=j+1;} }
else {i=i-k; d[j]=a[i];j=j+1;}
}
cout<<d;
}
| 19 |
9,380 | int main()
{
char s[101]={0},a[101]={0},b[101]={0},cmp[101]={0},mark[101]={0};
int i,j,k;
gets(s);
gets(a);
gets(b);
for(i=0;i<=strlen(s)-strlen(a);i++)
{
k=0;
if ((i!=0)&&(s[i-1]!=' ')) {
continue;
}
for(j=0;j<strlen(a);j++)
cmp[k++]=s[j+i];
//printf("%s\n",cmp);
if((strcmp(cmp,a)==0)&&((s[j+i]==' ')||(s[j+i]=='\n')||(s[j+i]=='\0'))) mark[i]=1;
//if(strcmp(cmp,a)==0) mark[i]=1;
}
for(i=0;i<strlen(s);i++)
{
if(mark[i]==0) printf("%c",s[i]);
else
{
printf("%s",b);
while(1)
{
if((s[i]==' ')||(s[i]=='\n')||(s[i]=='\0')) {i--;break;}
else i++;
}
}
}
return 0;
} | 19 |
9,381 | void main()
{
char *p,*a,*b,*t1,*t2,*t3;
int i,j,k,r,n0,n1,n2,n,m;
p=(char*)malloc(200*sizeof(char));
a=(char*)malloc(100*sizeof(char));
b=(char*)malloc(100*sizeof(char));
t1=(char*)malloc(100*sizeof(char));
t2=(char*)malloc(100*sizeof(char));
t3=(char*)malloc(300*sizeof(char));
gets(p);
gets(a);
gets(b);
n=strlen(p);
//strcpy(t1," ");
m=0;
for(i=0,k=0;i<n;i++)
{
//printf("i=%d\n",i);
r=0;
if((*(p+i)==' ')||(i==0))
{
r=1;
if(i!=0) n1=i+1;
else n1=i;
}
//printf("%d %d\n",r,n1);
if(r==1)
{
for(i=n1,j=0;(*(p+i)!=' ')&&(*(p+i)!='\0');i++,j++)
{
*(t1+j)=*(p+i);
}
i=i-1;
*(t1+j)='\0';
}
//puts(t1);
n2=i+1;
if(strcmp(t1,a)==0)
{
if(n2!=n) printf("%s ",b);
else printf("%s",b);
m=1;
}
else
{
if(n2!=n)printf("%s ",t1);
else printf("%s",t1);
strcpy(t1," ");
}
}
}
| 19 |
9,382 | int main()
{
int i,k,n=0,p,j;
char s[100],a[100],b[100];
gets(s);gets(a);gets(b);
i=0;
while (a[i]!='\0') {n++;i++;}
i=0;
while(s[i]!='\0')
{
p=1;
for(j=0;j<n;j++) if (a[j]!=s[i+j]) p=0;
if(p) if (i>1&&s[i-1]!=' ') p=0;
if (p) {printf("%s",b);i=i+n-1;}
else printf("%c",s[i]);
i++;
}
return 0;
} | 19 |
9,383 | int main()
{
int i,j=0,m=0;
char a[100],b[100],c[100];
gets(a);
scanf("%s%s",b,c);
for(i=0;;i++)
{
while(1)
{
if(a[i+j]==b[j]&&a[i+j]!='\0')
{
j++;
continue;
}
else if(b[j]=='\0'&&(a[i+j]==' '||a[i+j]=='\0')&&(a[i-1]==' '||i==0))
{
j=0;
printf("%s",c);
i+=strlen(b)-1;
break;
}
else
{
j=0;
if(a[i]=='\0')
break;
else printf("%c",a[i]);
break;
}
}
if(a[i]=='\0')
break;
}
if(b[j]=='\0')
printf("%s",c);
return 0;
}
| 19 |
9,384 | char chStr[103][101];
int iLen=0;
int main()
{ int i,j=0,k;
while(cin>>chStr[j]) j++;
while(chStr[j-1][iLen]) iLen++;
for(i=0;i<j-2;++i)
{
if(!strcmp(chStr[i],chStr[j-2]))
{
for(k=0;k<101;++k) chStr[i][k]=0;
for(k=0;k<iLen;++k) chStr[i][k]=chStr[j-1][k];
}
}
for(i=0;i<j-3;++i)
{
cout<<chStr[i]<<" ";
}
cout<<chStr[j-3]<<endl;
return 0;}
| 19 |
9,385 | void main()
{
char *s,*a,*b,*p,*w[100];
int i,j,k;
s=(char *)malloc(100*sizeof(char));
a=(char *)malloc(100*sizeof(char));
b=(char *)malloc(100*sizeof(char));
for(i=0;i<100;i++)
{
*s='\0';
*a='\0';
*b='\0';
}
gets(s);
scanf("%s",a);
scanf("%s",b);
w[0]=(char *)malloc(100*sizeof(char));
for(j=0;j<100;j++)
*(w[0]+j)='\0';
i=0;j=0;
for(p=s;*p!='\0';p++)
{
if(*p!=' ')
{
*(w[i]+j)=*p;
j++;
}
else
{
i++;
w[i]=(char *)malloc(100*sizeof(char));
for(j=0;j<100;j++)
*(w[i]+j)='\0';
j=0;
}
}
k=i;
for(i=0;i<k;i++)
{
if(strcmp(w[i],a)==0)
strcpy(w[i],b);
for(j=0;*(w[i]+j)!='\0';j++)
printf("%c",*(w[i]+j));
printf(" ");
}
if(strcmp(w[k],a)==0)
strcpy(w[k],b);
for(j=0;*(w[k]+j)!='\0';j++)
printf("%c",*(w[k]+j));
printf("\n");
} | 19 |
9,386 | void main()
{
char s[100],a[100],b[100],c[100][50];
char *p1=s,*p3=b;
int i=0,j=0,n;
gets(s); gets(a); gets(b);
for( ;*p1!='\0';p1++)
{
if(*p1!=' ')
{
c[i][j]=*p1;//?????????????????
j++;
}
else
{
c[i][j]='\0';
i++;
j = 0;//?????0?????c[i][0].
}
}
c[i][j]='\0';//??????????????'\0'???????????? ?????c[i]?
n=i;
for(i=0;i<=n;i++)
{
if(strcmp(c[i],a)==0)
{
for(j=0;*p3!='\0';p3++,j++)
c[i][j]=*p3;
c[i][j]='\0';
}
p3=b;//????c[i]?a.
}
for(i=0;i<n;i++)
{
printf("%s ",c[i]);
}
printf("%s",c[i]); //????????? ?????????
}
| 19 |
9,387 | void main()
{
char s[100],a[100],b[100],words[100][100];
int i,k=0,n=0;
gets(s);
gets(a);
gets(b);
for (i = 0; s[i] != 0; i++) {
if (s[i] == ' ') {
s[i] = '\0';
strcpy(words[n], (s + k));
n++;
k = i + 1;
}
}
strcpy(words[n], (s + k));
n++;
for(i=0;i<n-1;i++)
{
if(strcmp(words[i],a)==0)
{
printf("%s ",b);
}
else
{
printf("%s ",words[i]);
}
}
if(strcmp(words[n-1],a)==0)
{
printf("%s",b);
}
else
{
printf("%s",words[n-1]);
}
} | 19 |
9,388 | void main()
{
char *s,*a,*b,*c,*e;
s=(char *)malloc(101*sizeof(char));
a=(char *)malloc(101*sizeof(char));
b=(char *)malloc(101*sizeof(char));
c=(char *)malloc(101*sizeof(char));
gets(s);
gets(a);
gets(b);
e=s+strlen(s);
for(;;)
{
sscanf(s,"%s",c);
if(strcmp(a,c)==0) printf("%s",b);
else printf("%s",c);
s=s+strlen(c)+1;
if(s>=e) break;
printf(" ");
}
}
| 19 |
9,389 |
int main()
{
char s[101];
char a[101];
char b[101];
int la, lb; /* Length of string a,b */
char *p; /* position */
char t[101];
char *ss; /* position in s move right one-way */
gets(s);
scanf("%s", a);
scanf("%s", b);
la = strlen(a);
lb = strlen(b);
ss = s;
while ((p=strstr(ss, a))!=NULL) {
if ((p==s||*(p-1)==' ')&&(*(p+la)==' ')) {
strcpy(t, p+la+1);
strcpy(p, b);
*(p+lb) = ' ';
strcpy(p+lb+1, t);
}
if ((p==s||*(p-1)==' ')&&(*(p+la)=='\0')) {
strcpy(p, b);
*(p+lb) = '\0';
}
ss = p + la + 1;
}
puts(s);
return 0;
} | 19 |
9,390 | int main()
{
char word[200],x[200],y[200];
int i,j,len=0,t[200]={0};
char c;
gets(word);
scanf("%s%s",x,y);
for(i=0;i<strlen(word);i++)
{
if ((i == 0) || word[i-1] == ' ')
for(j=0;j<strlen(x);j++)
{
if(word[i+j]!=x[j])
break;
else if ((j==strlen(x)-1) && (word[i+j+1] ==' ' || word[i+j+1] == '\0'))
{
t[i]=1;
}
}
}
for(i=0;i<strlen(word);i++)
{
if(t[i]==0)
{
printf("%c",word[i]);
}
else
{
printf("%s",y);
i=i+strlen(x)-1;
}
}
} | 19 |
9,391 |
int main ()
{
char s[10000],a[101],b[101];
int l0,l1,l2,i,j,k,counter;
gets(s);
gets(a);
gets(b);
l0=strlen(s);
l1=strlen(a);
l2=strlen(b);
i=0;
if (s[i]==a[0])
{
counter=0;
for (j=i+1;j<i+l1;j++){
if (s[j]!=a[j-i])
counter++;}
if (s[i+l1]!=' '&&s[i+l1]!='\0')
counter++;
if (counter==0)
{
if (l1>=l2)
{
for (j=i;j<i+l2;j++)
s[j]=b[j-i];
for (j=i+l1;j<=l0;j++)
s[j-(l1-l2)]=s[j];
}
if (l2>l1)
{
for (j=l0;j>=i+l1;j--)
s[j-(l1-l2)]=s[j];
for (j=i;j<i+l2;j++)
s[j]=b[j-i];
}
}
}
for (i=1;i<l0;i++)
{
if (s[i]==a[0])
{
counter=0;
for (j=i+1;j<i+l1;j++){
if (s[j]!=a[j-i])
counter++;}
if (s[i+l1]!=' '&&s[i+l1]!='\0')
counter++;
if (s[i-1]!=' ')
counter++;
if (counter==0)
{
if (l1>=l2)
{
for (j=i;j<i+l2;j++)
s[j]=b[j-i];
for (j=i+l1;j<=l0;j++)
s[j-(l1-l2)]=s[j];
}
if (l2>l1)
{
for (j=l0;j>=i+l1;j--)
s[j-(l1-l2)]=s[j];
for (j=i;j<i+l2;j++)
s[j]=b[j-i];
}
l0+=l2-l1;
}
}
}
cout<<s<<endl;
} | 19 |
9,392 |
void main()
{
char str[20][20],a[20],b[20],*p1,*p2,*p[20];
int i=0,j;
for(i=0;i<20;i++)
p[i]=str[i];
i=0;
while(1)
{
scanf("%s",str[i]);
if(getchar()=='\n') break;
i++;
}
scanf("%s%s",a,b);
p1=a;p2=b;
for(j=0;j<=i;j++)
if(strcmp(p[j],p1)==0) p[j]=p2;
for(j=0;j<=i;j++)
{
if (j==0)printf("%s",p[j]);
else
printf(" %s",p[j]);
}
} | 19 |
9,393 | int main()
{
char s[100+1],a[100+1],b[100+1];
char *ss[100];
int i,n=0;
gets(s);
gets(a);
gets(b);
ss[n++]=s;
ss[0] = s;
n = 1;
for (i=0; s[i] != '\0'; i++) {
if (s[i] == ' ') {
s[i] = '\0';
ss[n] = &s[i+1];
n++;
}
}
for(i=0;i<n;i++)
{
if(i>0)
{
printf(" ");
}
if(strcmp(ss[i],a)==0)
{
printf("%s",b);
}
else
{
printf(ss[i]);
}
}
return 0;
}
| 19 |
9,394 | int main ()
{
int i,j,index,len,len2;
char str[101],word[101],newword[101],temp[101];
while(gets(str)){
index = 0;
len = strlen(str);
cin>>word;
cin>>newword;
for(i=0;i<=len;i++){
if(str[i] == ' ' || i == len){
temp[index] = '\0';
if(strcmp(temp,word) == 0){
cout<<newword;
}
else{
cout<<temp;
}
if(str[i] == ' '){
printf(" ");
}
else{
printf("\n");
}
index = 0;
memset(temp,0,sizeof(temp));
}
else{
temp[index++] = str[i];
}
}
getchar();
}
return 0;
}
| 19 |
9,395 | void change(char word[30][15], char a[], char b[]);
void getword(char *p,char word[30][15]);
int n=0;
void main()
{
char s[100],word[30][15]={'\0'},a[10],b[10];
char *p=s;
gets(s);scanf("%s%s",a,b);
getword(p,word);
change(word,a,b);
}
void getword(char *p,char word[30][15])
{
int i,j=0;
for(i=0;*p!='\0';i++)
{
while(*p==' ')p+=1;
j=0;
while(*p!=' '&&*p!='\0')
{
word[i][j]=*p;
j+=1;
p+=1;
}
n+=1;
}
}
void change(char word[30][15], char a[], char b[])
{
int i;
for(i=0;i<n;i++)
{
if(i>0)printf(" ");
if(strcmp(word[i],a)==0)printf("%s",b);
else printf("%s",word[i]);
}
} | 19 |
9,396 | main()
{char string[100],word[50][15],subword[15],subed[15];
gets(string);
scanf("%s%s",subed,subword);
char *p=string;
int i=0,j;
while(*p!='\0')
{sscanf(p,"%s",word[i]);
p+=strlen(word[i]);
i++;
if(*p==' ')p++;
}
for(j=0;j<i;j++)
if(strcmp(word[j],subed)==0)strcpy(word[j],subword);
printf("%s",word[0]);
for(j=1;j<i;j++)
printf(" %s",word[j]);
}
| 19 |
9,397 | int main ()
{
char sentence[110],first[110],second[110];
int i,j,flag;
int lens,len1,len2;
cin.getline(sentence,110);
cin.getline(first,110);
cin.getline(second,110);
lens=strlen(sentence);
len1=strlen(first);
for (i=0;i<lens-len1+1;i++)
{
flag=0;
if((i==0&&sentence[i+len1]==' ')||(sentence[i-1]==' '&&sentence[i+len1]==' ')||(i==lens-len1&&sentence[i-1]==' '))
{
for (j=0;j<len1;j++)
{
if(sentence[i+j]==first[j])
flag++;
}
}
if (flag==len1)
{
i=i+len1-1;
cout << second ;
}
else
cout << sentence[i] ;
}
if (flag!=len1)
for (i=lens-len1+1;i<lens;i++)
cout << sentence[i];
return 0;
} | 19 |
9,398 | void main()
{
char str1[100][100]={{0,0}},str2[100],str3[100],str4[100];
int n,i=0,j=0,k[100]={0},m=0;
gets(str2);
scanf("\n");
gets(str3);
scanf("\n");
gets(str4);
n=strlen(str2);
m=strlen(str4);
for(i=0;i<n;i++)
{
if(str2[i]==' ')
{
j=j+1;
k[j]=0;
}
else
{
str1[j][k[j]]=str2[i];
k[j]=k[j]+1;
}
}
for(i=0;i<=j;i++)
{
if(strcmp(str1[i],str3)==0)
{
if(k[i]<m)
{memset(str1[i],0,m);
strcpy(str1[i],str4);
}
else
{
memset(str1[i],0,k[i]);
strcpy(str1[i],str4);
}
}
}
printf("%s",str1[0]);
for(i=1;i<=j;i++)
printf(" %s",str1[i]);
}
| 19 |
9,399 | int main()
{
int i=0,j=0,n,t[100],at,bt,p;
char s[100][100],a[100],b[100];
for(i=0;i<100;i++)
{
for(j=0;j<100;j++)
{
s[i][j]=cin.get();
if(s[i][j]==' ')
{
t[i]=j;
break;
}
else
if(s[i][j]=='\n')
{
t[i]=j;
goto loop;
}
}
}
loop: n=i+1;
for(j=0;j<100;j++)
{
a[j]=cin.get();
if(a[j]=='\n')
{
at=j;
break;
}
}
for(j=0;j<100;j++)
{
b[j]=cin.get();
if(b[j]=='\n')
{
bt=j;
break;
}
}
for(i=0;i<n;i++)
if(t[i]==at)
{
p=1;
for(j=0;j<at-1;j++)
{
p*=s[i][j]-a[j]+1;
}
if(p==1)
{
for(j=0;j<bt;j++)
s[i][j]=b[j];
t[i]=bt;
}
}
for(i=0;i<n;i++)
{
if(i==0)
for(j=0;j<t[i];j++)
cout<<s[i][j];
else
{
cout<<" ";
for(j=0;j<t[i];j++)
cout<<s[i][j];
}
}
cout<<endl;
return 0;
} | 19 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.