String Matching

It's easy to tell if two words are identical - just check the letters. But how do you tell if two words are almost identical? And how close is "almost"?

There are lots of techniques for approximate word matching. One is to determine the best substring match, which is the number of common letters when the words are compared letter-byletter.

The key to this approach is that the words can overlap in any way. For example, consider the words CAPILLARY and MARSUPIAL. One way to compare them is to overlay them:

CAPILLARY
MARSUPIAL

There is only one common letter (A). Better is the following overlay:

CAPILLARY
     MARSUPIAL

with two common letters (A and R), but the best is:

   CAPILLARY
MARSUPIAL

Which has three common letters (P, I and L).

The approximation measure appx(word1, word2) for two words is given by:

     common letters * 2
-----------------------------
length(word1) + length(word2)

Thus, for this example, appx(CAPILLARY, MARSUPIAL) = 6 / (9 + 9) = 1/3. Obviously, for any word W appx(W, W) = 1, which is a nice property, while words with no common letters have an appx value of 0.

Input:

The input for your program will be a series of words, two per line, until the end-of-file flag of -1.

Using the above technique, you are to calculate appx() for the pair of words on the line and print the result. For example:

CAR CART
TURKEY CHICKEN
MONEY POVERTY
ROUGH PESKY
A A
-1

The words will all be uppercase.

Output:

Print the value for appx() for each pair as a reduced fraction, like this:

appx(CAR,CART) = 6/7
appx(TURKEY,CHICKEN) = 4/13
appx(MONEY,POVERTY) = 1/3
appx(ROUGH,PESKY) = 0
appx(A,A) = 1

Fractions reducing to zero or one should have no denominator.

题意概述：

        题目的意思比较简单，就不做说明了。

解题思路：

       这个题没有什么简单的算法，暴力匹配就可以，找到最大的相同字符的个数。

源代码：

#include<iostream>
#include<string>
using namespace std;


unsigned gcd(unsigned m,unsigned n)//m较大，n较小 ，该函数主要返回最大公约数，因为结果都是最简真分数，
{
    if(m%n==0) return n;
    else       return gcd(n,m%n);
}


int  max(string s1,string s2)             //固定一个字符串不动，移动另一个字符串，求得各种情况下相同字符的个数，最终得到最大相同字符的个数
{
     int max1=0;
     for(int i=0;i<s1.size();++i)
     {
         int max2=0;    
         for(int j=0;j<s2.size()&&i+j<s1.size();++j)
             if(s1[i+j]==s2[j])max2++;
         if(max1<max2)max1=max2;
     }
     return max1;
}


int main()
{
    string str1,str2;
    while(cin>>str1&&str1!="-1")
    {
         int num=0;
         cin>>str2;
         num=max(str1,str2);
         if(max(str2,str1)>num)num=max(str2,str1);
         
         if(num!=0)
         {
            unsigned len1=0,len2=0;
            len1=2*num/gcd(str1.size()+str2.size(),2*num);
            len2=(str1.size()+str2.size())/gcd(str1.size()+str2.size(),2*num);
            
            if(len1==len2)cout<<"appx("<<str1<<","<<str2<<") = "<<len1<<endl;
            else cout<<"appx("<<str1<<","<<str2<<") = "<<len1<<"/"<<len2<<endl;
         }
         else cout<<"appx("<<str1<<","<<str2<<") = "<<num<<endl;
    }
    return 0;
}