poj String Matching
来源:互联网 发布:伊斯兰教知乎 编辑:程序博客网 时间:2024/06/05 19:22
Description
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:
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:
CAPILLARYMARSUPIAL
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.
-----------------------------
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.
The words will all be uppercase.
Using the above technique, you are to calculate appx() for the pair of words on the line and print the result.
The words will all be uppercase.
Output
Print the value for appx() for each pair as a reduced fraction,Fractions reducing to zero or one should have no denominator.
Sample Input
CAR CARTTURKEY CHICKENMONEY POVERTYROUGH PESKYA A-1
Sample Output
appx(CAR,CART) = 6/7
appx(TURKEY,CHICKEN) = 4/13
appx(MONEY,POVERTY) = 1/3
appx(ROUGH,PESKY) = 0
appx(A,A) = 1
代码:
#include<stdio.h>#include<string.h>int gcd(int a,int b){return !b?a:gcd(b,a%b);}int main(){char a[100000],b[100000];int i,j,k,d,t1,max,p1,p2,t; while(~scanf("%s",a)){if(strcmp(a,"-1")==0)break;scanf("%s",b);max=0;d=0;t1=0;printf("appx(%s,%s) = ",a,b);p1=strlen(a);p2=strlen(b);if(p1<p2){t=p2;p2=p1;p1=t;}for(i=0;i<p1;i++){for(j=0,k=i;(j<p2)&&(k<p1);j++,k++)if(a[k]==b[j]) d++; if(max<d) max=d; } for(i=0;i<p2;i++) { for(j=0,k=i;(j<p1)&&(k<p2);j++,k++) if(b[k]==a[j]) t1++; if(max<t1) max=t1; } if(max==0) { printf("0\n"); continue; } if(max*2==p1+p2) { printf("1\n"); continue; } printf("%d/%d\n",max*2/gcd(max*2,p1+p2),(p1+p2)/gcd(max*2,p1+p2)); }return 0;}
0 0
- poj 1580 String Matching
- poj String Matching
- POJ 1580 String Matching G++
- poj 1580 String Matching 【字符串处理】
- POJ 1580-String Matching(枚举)
- KMP Matching: String Matching
- String Matching
- String Matching
- String Matching
- Naive String Matching: String Matching
- poj 1580 String Matching【gcd辗转相除法】
- POJ 1580 && HDU 1306 String Matching(水~)
- Finite Automaton Matching: String Matching
- Rabin Karp Matching: String Matching
- PKU 1580 String Matching
- String matching with simmetrics
- Binary String Matching
- 字符串匹配(String Matching)
- 列表
- dfsdfsdgsd
- js图片水平滚动插件,支持上下滚动
- 安卓 调用QQ加群代码
- 图文讲解:iOS App提交流程
- poj String Matching
- NYOJ 456 邮票分你一半(01背包)
- 从零开始学android<GridView网格视图.二十八.>
- python的socket通信实例
- 关于微信上的一些转发即可得iphone的骗术
- 比较简单优美的网站设计
- Android计算函数时间戳的方法
- 从Trie树(字典树)谈到后缀树(10.28修订)(转载)
- POJ 2255 Tree Recovery(二叉树重建)