-
Notifications
You must be signed in to change notification settings - Fork 0
/
anagram.c
65 lines (63 loc) · 1.02 KB
/
anagram.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <stdio.h>
#include <stdlib.h>
void sort(char ch[])
{
int i,j;
for(i=0;ch[i+1]!='\0';i++)
{
for(j=0;ch[j+1]!='\0';j++)
{
if(ch[j]>ch[j+1])
{
char temp;
temp=ch[j];
ch[j]=ch[j+1];
ch[j+1]=temp;
}
}
}
return;
}
int comp(char s1[],char s2[])
{
int i=0;
while(1)
{
if(s1[i]=='\0'&&s2[i]=='\0')
break;
if((s1[i]=='\0'&&s2[i]!='\0')||(s2[i]=='\0'&&s1[i]!='\0'))
return 1;
if(s1[i]!=s2[i])
return 1;
i++;
}
return 0;
}
int main()
{
int n;
scanf("%d",&n);
char ch[n][100];
char w[100];
int i;
scanf("%s",w);
for(i=0;i<n;i++)
{
scanf("%s",ch[i]);
}
for(i=0;i<n;i++)
{
sort(ch[i]);
}
sort(w);
for(i=0;i<n;i++)
{
if(comp(ch[i],w)==0)
{
printf("Yes");
return 0;
}
}
printf("No");
return 0;
}