题目链接:http://dsalgo.openjudge.cn/retrieval/1/
AC代码
#include <stdio.h>
#include <cstring>
char words[10001][16], buff[10001][16], check[16];
int n_words, it;
bool loose_match(const char *s1, const char *s2) {
size_t l1 = strlen(s1), l2 = strlen(s2), it1, it2;
if (l1 == l2) {
for (it1 = 0; s1[it1] && s1[it1]