-
Notifications
You must be signed in to change notification settings - Fork 2
/
DRM.java
38 lines (29 loc) · 940 Bytes
/
DRM.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
// Success in 0.15s
import java.util.Scanner;
public class DRM{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
String word = s.substring(0, s.length() / 2),
key = s.substring(s.length() / 2);
sc.close();
word = rotate(word);
key = rotate(key);
System.out.println(merge(word, key));
}
private static String rotate(String s){
int val = 0;
char[] ch = s.toCharArray();
for(char c : ch) val += c - 'A';
for(int i = 0; i < ch.length; i++) ch[i] = rotateChar(ch[i], val);
return new String(ch);
}
private static char rotateChar(char c, int val){
return (char)('A' + (((c - 'A') + val) % 26));
}
private static String merge(String word, String key){
char[] w = word.toCharArray(), k = key.toCharArray();
for(int i = 0; i < w.length; i++) w[i] = rotateChar(w[i], k[i] - 'A');
return new String(w);
}
}