/* * Solution Template for Robot Vacuum * * 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. */ #include /* K is the number of instructions. */ int K; /* instrs contains the sequence of instructions. */ char instrs[100005]; int answer; int main(void) { /* Read the value of K and the sequence of instructions. */ scanf("%d", &K); scanf("%s", instrs); /* * TODO: This is where you should compute your solution. Store the fewest * number of instructions you need to add to the end of the sequence into * the variable answer. */ /* Write the answer. */ printf("%d\n", answer); return 0; }