Differences between revisions 125 and 151 (spanning 26 versions)
Revision 125 as of 2005-04-02 06:33:57
Size: 1627
Editor: lihan
Comment:
Revision 151 as of 2006-11-16 02:28:48
Size: 543
Editor: ZoomQuiet
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
{{{
#!cplusplus
##language:zh
#pragma section-numbers off
||<#d1d1d1>[wiki:selfwww/ 啄木鸟社区总索引页]||<#d1d1d1>WoodpeckerImprove^改进啄木鸟维基^||<#d1d1d1>'''[wiki:self/QuickInWoodpecker 使用啄木鸟Wiki指南]'''||<#d1d1d1>^新人必读^'''[wiki:self/AskForHelp 《提问的智慧》]'''||<#d1d1d1>[:PyCon2006:2006Python大会专题]||
Line 4: Line 5:
#include<stdio.h>
#include<string.h>
typedef struct
{ char ch[50];
   int len;
}SqString;
int creat_string(SqString s1,SqString s2,SqString s);
int check(int a[50][50]);
[[Include(WoodpeckerOrg)]]

----
 * WoodpeckerLog -- ''该死的 Spamer 们!!来吧!!!'' ZoomQuiet 开始进行MoinMoin 管理
Line 14: Line 11:
void main()
{ int i=0;
   SqString s,s1,s2;
   scanf("%s",&s1.ch);
   s1.len=strlen(s1.ch);
   scanf("%s",&s2.ch);
   s2.len=strlen(s2.ch);
   for(i=0;i<10;i++){

   s.ch[i]='*';
 s.len++;
   }
   creat_string(s1,s2,s);
   return ;
}
int creat_string(SqString s1,SqString s2,SqString &s)
{ int i,j,k,m,n,t=0;
   int a[50][50];
   int b[50][50];
   for(i=0;i<50;i++)
    for(j=0;j<50;j++)
           a[i][j]=b[i][j]=0;
   for(i=0;i<s1.len;i++)
    for(j=0;j<s2.len;j++)
     if(s1.ch[i]==s2.ch[j])
      a[i][j]=1;
   k=1;
   while(check(a))
   {
   for(i=0;i<s1.len;i++)
        for(j=0;j<s2.len;j++)
  {
        b[i][j]=a[i][j];
  }
   for(m=0;m<s1.len;m++)
   { while(i<s1.len&&j<s2.len)
   { if(a[i][j]==1&&a[i+k][j+k]==0)
   { a[i][j]=0;
             i=i+k+1;
    j=j+k+1;
   }
         else
   {i++;
    j++;
   }
   }
   }
   for(n=0;n<s2.len;n++)
   { while(i<s1.len&&j<s2.len)
   { if(a[i][j]==1&&a[i+k][j+k]==0)
   { a[i][j]=0;
             i=i+k+1;
    j=j+k+1;
   }
         else
   {i++;
    j++;
   }
   }
   }
   k++;
 }
 while(i<s1.len&&j<s2.len)
   if(b[i][j]==1)
    for(;t<k;t++)
    { s.ch[t]=s1.ch[i];
      i++;
    }
 printf("%s",s.ch);
 return 1;
}
int check(int a[50][50])
{ int i,j;
  for(i=0;i<50;i++)
        for(j=0;j<50;j++)
   if(a[i][j]!=0)
    return 1;
  return 0;
}

...
}}}
::ZoomQuiet [[DateTime(2004-08-09T21:42:16Z)]]

[wiki:selfwww/ 啄木鸟社区总索引页]

WoodpeckerImprove改进啄木鸟维基

[wiki:self/QuickInWoodpecker 使用啄木鸟Wiki指南]

新人必读[wiki:self/AskForHelp 《提问的智慧》]

[:PyCon2006:2006Python大会专题]

Include(WoodpeckerOrg)


::ZoomQuiet DateTime(2004-08-09T21:42:16Z)

FrontPage2.0 (last edited 2009-12-25 07:17:24 by localhost)