uva 10115

最新推荐文章于 2021-07-28 20:05:23 发布

尘埃092

最新推荐文章于 2021-07-28 20:05:23 发布

阅读量668

点赞数

分类专栏：算法题目

本文链接：https://blog.csdn.net/chenansic/article/details/8896006

版权

算法题目专栏收录该内容

68 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char find[10][90];
char replace[10][90];
char input[300];
void edit( char input[], int time )
{
     char temp1[300], temp2[300];
     int i, j, len1, len2, t, turn, start, change, x, x1, y, y1;
     turn = 0;
     while( turn < time )
     {
	     	start = 0;
	     	len1 = strlen( input );
	     	len2 = strlen( find[turn] );
     		while( start < len1 )
     		{
	            if( input[start] == find[turn][0] )
	            {        
						change = 1;   
	                     for( j = 0, i = start; j < len2; j++,i++ )
                          if( input[i] != find[turn][j] )
                          {
                              change = 0;
                              break;
                          }
	                     if( change )
	                     {
	                         for( x = 0,x1 =0; x < start; x++ )
	                              temp1[x1++] = input[x];
	                         temp1[x1] = '\0';
	                         for( y = start+len2, y1 = 0; y < len1; y++ )
	                              temp2[y1++] = input[y];
	                         temp2[y1] = '\0';
	                         strcat( temp1, replace[turn] ); 
	                         strcat( temp1, temp2 );         
	                         strcpy( input, temp1 );
	                         start = 0;
	                         len1 = strlen( input );
	                     }
	                     else
	                     	start++;                  
	            }
	            else
            		start++;  
	        }
	        turn++; 
    }                	
     printf( "%s\n", input );
};                              
int main()      
{
	int T, i;
    while( scanf( "%d\n", &T ) != EOF && T )
    {
           for( i = 0; i < T; i++ )
           {
                gets( find[i] );
                gets( replace[i] );
           }
           gets( input );
           edit( input, T );    
	}	         
	return 0;
}