Codeforces E. Correcting Mistakes 思维

Top_Spirit

于 2019-01-17 16:21:39 发布

阅读量459

点赞数

分类专栏：知识点文章标签： acm codeforces

本文链接：https://blog.csdn.net/weixin_41190227/article/details/86526488

版权

该问题要求计算两个给定长度相同的不同单词S和T，通过删除一个字符可以转化为多少种不同的原始单词W。提供的解决方案是检查S和T不同字符的位置数量，最多可能的W种类为2。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

E. Correcting Mistakes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Analyzing the mistakes people make while typing search queries is a complex and an interesting work. As there is no guaranteed way to determine what the user originally meant by typing some query, we have to use different sorts of heuristics.

Polycarp needed to write a code that could, given two words, check whether they could have been obtained from the same word as a result of typos. Polycarpus suggested that the most common typo is skipping exactly one letter as you type a word.

Implement a program that can, given two distinct words S and T of the same length n determine how many words W of length n + 1 are there with such property that you can transform W into both S, an

最低0.47元/天解锁文章