/* * Solution Template for Laser Cutter * * Australian Informatics Olympiad 2021 * * This file is provided to assist with reading of input and writing of output * for the problem. You may modify this file however you wish, or * you may choose not to use this file at all. */ import java.io.*; class Solution { /* N is the side length of the initial square. */ private static int N; /* A contains the first sequence of instructions. */ private static char A[] = new char[400005]; /* B contains the second sequence of instructions. */ private static char B[] = new char[400005]; private static int answer; /* * Read the next token from the input file. * Tokens are separated by whitespace, i.e., spaces, tabs and newlines. * If end-of-file is reached then an empty string is returned. */ private static String readToken(BufferedReader in) throws IOException { StringBuffer ans = new StringBuffer(); int next; /* Skip any initial whitespace. */ next = in.read(); while (next >= 0 && Character.isWhitespace((char)next)) next = in.read(); /* Read the following token. */ while (next >= 0 && ! Character.isWhitespace((char)next)) { ans.append((char)next); next = in.read(); } return ans.toString(); } public static void main(String[] args) throws IOException { /* Open the input and output streams for stdin and stdout. */ BufferedReader input_reader = new BufferedReader(new InputStreamReader( System.in)); BufferedWriter output_writer = new BufferedWriter( new OutputStreamWriter(System.out)); /* Read the value of N and the sequences of instructions. */ N = Integer.parseInt(readToken(input_reader)); A = readToken(input_reader).toCharArray(); B = readToken(input_reader).toCharArray(); /* * TODO: This is where you should compute your solution. Store the side * length of the largest square that fits inside the shape into the * variable answer. */ /* Write the answer. */ output_writer.write(answer + "\n"); /* Close the input_reader and output_writer. */ input_reader.close(); output_writer.close(); } }