-
Notifications
You must be signed in to change notification settings - Fork 0
/
Maths Teacher.java
109 lines (71 loc) · 2.33 KB
/
Maths Teacher.java
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
import java.util.*;
import java.io.*;
class Main{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements()){
try { st = new StringTokenizer(br.readLine()); }
catch (IOException e) { e.printStackTrace(); }
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble(){ return Double.parseDouble(next()); }
String nextLine(){
String str = "";
try { str = br.readLine(); }
catch (IOException e) { e.printStackTrace(); }
return str;
}
}
public static void main(String[] args){
FastReader sc = new FastReader();
int tc =sc.nextInt();
for(int i=0;i<tc;i++){
int n = sc.nextInt();
String s1 =sc.nextLine();
String s2 =sc.nextLine();
System.out.println(call(s1,s2,n));
}
}
public static String call(String s1,String s2,int n){
Map<Character,Integer> news =new LinkedHashMap<>();
Map<Character,Integer> mess =new LinkedHashMap<>();
// System.out.println(s1[1]);
// char[] s11 = s1.toCharArray();
// char[] s22 = s2.toCharArray();
for(int i=0;i<s1.length();i++){
if(news.containsKey(s1.charAt(i))){
news.put(s1.charAt(i),news.get(s1.charAt(i))+1);
}else{
news.put(s1.charAt(i),1);
}
}
for(int i=0;i<s2.length();i++){
if(mess.containsKey(s2.charAt(i))){
mess.put(s2.charAt(i),mess.get(s2.charAt(i))+1);
}else{
mess.put(s2.charAt(i),1);
}
}
// System.out.println(mess+" "+news);
if( news.size() != mess.size()){
return "Not Equivalent";
}
for(int i=0;i<mess.size();i++){
if(news.get(i) != mess.get(i)){
return "Not Equivalent";
}
}
return "Equivalent";
}
}