处理输入搞了半天,真是坑,交了10来次的WA和SF然后不停改才AC。。到最后也不知道为啥这么写是对的,题目本身没什么难度
#include<stdio.h>
#include<string.h>
static char *src = "the quick brown fox jumps over the lazy dog";
static int match(char *s, char *map)
{
int l1 = strlen(src);
int l2 = strlen(s);
if (l1 != l2)
return 0;
memset(map, 0, 26 * sizeof(char));
int i;
for (i = 0; i < l1; i++)
{
if (s[i] != ' ' && src[i] != ' ')
{
if (!map[s[i] - 'a'])
map[s[i] - 'a'] = src[i];
else if (map[s[i] - 'a'] != src[i])
return 0;
}
else if (s[i] == ' ' && src[i] == ' ')
continue;
else
return 0;
}
return 1;
}
int main()
{
char s[101][81], map[26];
int index = 0, find = 0;
while (1)
{
char *temp = gets(s[index]);
if (temp == NULL || strlen(temp) == 0)
{
if (find)
{
int i, j;
for (i = 0; i < index; i++)
{
for (j = 0; j < strlen(s[i]); j++)
putchar(s[i][j] == ' ' ? ' ' : map[s[i][j] - 'a']);
putchar('\n');
}
}
else
puts("No solution.");
find = 0;
index = 0;
if (temp == NULL)
break;
else
putchar('\n');
}
else
{
if (!find)
find = match(s[index], map);
index++;
}
}
return 0;
}