fork download
  1. import java.io.BufferedReader;
  2. import java.io.InputStreamReader;
  3. import java.util.StringTokenizer;
  4.  
  5. public class Main {
  6. private static final char BAN1 = ' ';
  7. private static final char BAN2 = '.';
  8. private static final char BAN3 = ',';
  9.  
  10. public static void main(String[] args) throws Exception{
  11. StringBuilder sb = new StringBuilder();
  12. StringTokenizer st = new StringTokenizer(br.readLine());
  13.  
  14. int k = Integer.parseInt(st.nextToken()) % 26;
  15. int s = Math.abs(Integer.parseInt(st.nextToken()));
  16. char[] words = br.readLine().toCharArray();
  17.  
  18. for(int i = 0; i < s; i++) {
  19. // '.' ',' ' '의 경우 바로 버퍼에 담음
  20. if(words[i] == BAN1 || words[i] == BAN2 || words[i] == BAN3) {
  21. sb.append(words[i]);
  22. continue;
  23. }
  24.  
  25. words[i] += k; // 그 외 알파벳
  26.  
  27. // (words[i] + k)가 ASCII 코드의 알파벳 범위를 벗어나는 경우
  28. if((words[i] > 'Z' && words[i] < 'a') || words[i] > 'z') words[i] %= 26;
  29.  
  30. sb.append(words[i]);
  31. }
  32.  
  33. System.out.println(sb.toString());
  34. }
  35. }
  36.  
Success #stdin #stdout 0.09s 27856KB
stdin
5 37
I love Red Black Tree, how about you.
stdout
N qtj Wji Gqfhp Ywjj, mt fgtzy tz.