/**
 * Created by william on 11/27/2015.
 */
public class Solution {
    public static void main(String[] args) {

    }

    public static final class Resolver {
        public static String resolve(
                final String input,
                final int shift) {

            throw new UnsupportedOperationException();

        }
    }

}

@@ -1,8 +1,35 @@
+import java.util.Scanner;%0A%0A
 /**%0A * C
@@ -138,223 +138,1084 @@
 ) %7B%0A
-%0A    %7D%0A%0A    public static final class Resolver %7B%0A        public static String resolve(%0A                final String input,%0A                final int shift) %7B%0A%0A            throw new UnsupportedOperationException
+        try (final Scanner scanner = new Scanner(System.in)) %7B%0A            int numChar = scanner.nextInt();%0A            String input = scanner.nextLine(); // read an empty line first.%0A            input = scanner.nextLine();%0A%0A            int shift = scanner.nextInt();%0A            System.out.println(Resolver.resolve(input, shift));%0A        %7D%0A    %7D%0A%0A    public static final class Resolver %7B%0A        public static String resolve(%0A                final String input,%0A                final int shift) %7B%0A%0A            return input.codePoints()%0A                    .map(c -%3E %7B%0A                        if (c %3E= 'a' && c %3C= 'z') %7B%0A                            return (((c + shift) - 'a') %25 26) + 'a';%0A                        %7D else if (c %3E= 'A' && c %3C= 'Z') %7B%0A                            return (((c + shift) - 'A') %25 26) + 'A';%0A                        %7D else %7B%0A                            return c;%0A                        %7D%0A                    %7D)%0A                    .collect(StringBuilder::new, StringBuilder::appendCodePoint, StringBuilder::append)%0A                    .toString
 ();%0A
-%0A
     

update caesar-cipher with solution implementation