Datasets:
broadfield-dev
/
deepmind_code_contests-Broadfield

Dataset card Data Studio Files
xet
Community
description
stringlengths
29
13k
solution
listlengths
0
16.3k
Ramu’s uncle has left him a stable in his Will. But the stable is not in a good condition. The roofs leak and need to be repaired. There are a number of stalls in the stable. A stall may or may not contain a horse. Ramu has to buy new cement sheets to cover these stalls. He has to cover atleast all those stalls that have a horse in them. (You cannot shift horses from one stall to another stall as they are habituated with their place) The Cement sheet Supplier will supply him sheets of any length he wishes, but as a marketing strategy, the supplier will only deliver a small number of total sheets. Ramu wishes to minimize the total length of the sheets he must purchase. Given M, the maximum number of sheets that can be purchased; S the total number of stalls. C the number of horse in the stalls, and the C occupied stall numbers, calculate the minimum number of stalls that must be covered in order to cover all the stalls that have horses in them. Input: The first line of the input contains a single integer T, denoting the number of test cases. The description of T test cases follows. First line of each test case contains space-separated integers M S C. The next C line contains the number of stalls containing horse. Output: Single Line containing minimum number of stalls that must be covered. Constraints 1 ≤ T ≤ 50 1 ≤ M ≤ 50 1 ≤ S ≤ 200 1 ≤ C ≤ S 1 ≤ stall number ≤ S SAMPLE INPUT 1 2 10 3 2 4 10 SAMPLE OUTPUT 4 Explanation For the given test case Cover [2-4] and [10]
[ "# /he/uncle's-will\n\nno_of_tc = input()\nfor tc in range(no_of_tc) :\n\tline = raw_input()\n\tmax_sheets = int(line.split(' ')[0])\n\ttotal_stalls = int(line.split(' ')[1])\n\tfilled_stalls = int(line.split(' ')[2])\n\tstall_map = [False] * total_stalls\n\tfor i in range(filled_stalls) :\tstall_map[input() - 1] = True\n\twhile stall_map and stall_map[0] == False : stall_map.remove(False)\n\twhile stall_map and stall_map[len(stall_map) - 1] == False : stall_map.pop()\n\tif len(stall_map) == 0 :\n\t\tprint 0\n\t\tcontinue\n\n\tstall_gaps = []\n\tstall_gap_cache = 0\n\tcovered_stalls = 1\n\tsheets_used = 1\n\tfor i in range(1, len(stall_map), 1) :\n\t\tif stall_map[i] == True and stall_map[i - 1] == True :\n\t\t\tcovered_stalls += 1\n\t\telif stall_map[i] == False and stall_map[i - 1] == False :\n\t\t\tstall_gap_cache += 1\n\t\telif stall_map[i] == True and stall_map[i - 1] == False :\n\t\t\tcovered_stalls += 1\n\t\t\tsheets_used += 1\n\t\t\tstall_gaps += [stall_gap_cache]\n\t\t\tstall_gap_cache = 0\n\t\telif stall_map[i] == False and stall_map[i - 1] == True :\n\t\t\tstall_gap_cache += 1\n\n\tif sheets_used > max_sheets :\n\t\tstall_gaps.sort(reverse = True)\n\t\tfor i in range(-1, max_sheets - sheets_used - 1, -1) :\n\t\t\tcovered_stalls += stall_gaps[i]\n\tprint covered_stalls" ]
There are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \leq i \leq R) and the j-th column (1 \leq j \leq C). The i-th item is at (r_i, c_i) and has the value v_i. Takahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square). He can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits. Find the maximum possible sum of the values of items he picks up. Constraints * 1 \leq R, C \leq 3000 * 1 \leq K \leq \min(2 \times 10^5, R \times C) * 1 \leq r_i \leq R * 1 \leq c_i \leq C * (r_i, c_i) \neq (r_j, c_j) (i \neq j) * 1 \leq v_i \leq 10^9 * All values in input are integers. Input Input is given from Standard Input in the following format: R C K r_1 c_1 v_1 r_2 c_2 v_2 : r_K c_K v_K Output Print the maximum possible sum of the values of items Takahashi picks up. Examples Input 2 2 3 1 1 3 2 1 4 1 2 5 Output 8 Input 2 5 5 1 1 3 2 4 20 1 2 1 1 3 4 1 4 2 Output 29 Input 4 5 10 2 5 12 1 5 12 2 3 15 1 2 20 1 1 28 2 4 26 3 2 27 4 5 21 3 5 10 1 3 10 Output 142
[ "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.InputMismatchException;\nimport java.util.Iterator;\nimport java.util.List;\nimport java.util.NoSuchElementException;\nimport java.util.stream.LongStream;\n\npublic class Main {\n void solve(MyScanner in, MyWriter out) {\n int R = in.nextInt();\n int C = in.nextInt();\n int K = in.nextInt();\n var v = new long[R][C];\n for (int i = 0; i < K; i++) {\n int r = in.nextInt() - 1;\n int c = in.nextInt() - 1;\n v[r][c] = in.nextLong();\n }\n var dp = new long[R][C][4];\n dp[0][0][1] = v[0][0];\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 0; k < 4; k++) {\n if (i + 1 < R) {\n setIfMax(dp[i + 1][j], 0, dp[i][j][k]);\n setIfMax(dp[i + 1][j], 1, dp[i][j][k] + v[i + 1][j]);\n }\n if (j + 1 < C) {\n setIfMax(dp[i][j + 1], k, dp[i][j][k]);\n if (k + 1 < 4)\n setIfMax(dp[i][j + 1],\n k + 1,\n dp[i][j][k] + v[i][j + 1]);\n }\n }\n }\n }\n out.println(LongStream.of(dp[R - 1][C - 1]).max().getAsLong());\n }\n private static boolean setIfMax(long[] a, int index, long candidate) {\n if (a[index] < candidate) {\n a[index] = candidate;\n return true;\n }\n return false;\n }\n public static void main(String[] args) {\n MyWriter w = new MyWriter(System.out);\n new Main().solve(new MyScanner(System.in), w);\n w.flush();\n }\n static final class MyScanner {\n static final int BUFFER_SIZE = 8192;\n private final InputStream in;\n private final byte[] buffer = new byte[BUFFER_SIZE];\n private int point;\n private int readLength;\n\n MyScanner(InputStream in) {\n this.in = in;\n }\n private int readByte() {\n if (point < readLength) {\n int result = buffer[point];\n point += 1;\n return result;\n }\n try {\n readLength = in.read(buffer);\n } catch (IOException e) {\n throw new AssertionError(null, e);\n }\n if (readLength == -1) {\n return -1;\n }\n point = 1;\n return buffer[0];\n }\n private static boolean isVisibleChar(int c) {\n return 33 <= c && c <= 126;\n }\n char nextChar() {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n return (char)c;\n }\n String next() {\n return next(16);\n }\n String next(int n) {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n StringBuilder b = new StringBuilder(n);\n do {\n b.append((char)c);\n c = readByte();\n } while (c != -1 && isVisibleChar(c));\n return b.toString();\n }\n long nextLong() {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n boolean minus = false;\n long limit = -Long.MAX_VALUE;\n if (c == '-') {\n minus = true;\n limit = Long.MIN_VALUE;\n c = readByte();\n }\n long n = 0L;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n if (n < limit / 10L) {\n throw new InputMismatchException();\n }\n n *= 10L;\n int digit = c - '0';\n if (n < limit + digit) {\n throw new InputMismatchException();\n }\n n -= digit;\n c = readByte();\n } while (c != -1 && isVisibleChar(c));\n return minus ? n : -n;\n }\n int nextInt() {\n long n = nextLong();\n if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE) {\n throw new InputMismatchException();\n }\n return (int)n;\n }\n double nextDouble() {\n return Double.parseDouble(next());\n }\n int[] nextIntArray(int n) {\n int[] result = new int[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextInt();\n }\n return result;\n }\n long[] nextLongArray(int n) {\n long[] result = new long[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextLong();\n }\n return result;\n }\n char[] nextCharArray(int n) {\n char[] result = new char[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextChar();\n }\n return result;\n }\n char[][] next2dCharArray(int h, int w) {\n char[][] result = new char[h][w];\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n result[i][j] = nextChar();\n }\n }\n return result;\n }\n int[][] nextVerticalIntArrays(int arrayCount, int arrayLength) {\n int[][] result = new int[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextInt();\n }\n }\n return result;\n }\n long[][] nextVerticalLongArrays(int arrayCount, int arrayLength) {\n long[][] result = new long[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextLong();\n }\n }\n return result;\n }\n char[][] nextVerticalCharArrays(int arrayCount, int arrayLength) {\n char[][] result = new char[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextChar();\n }\n }\n return result;\n }\n List<String> nextStringList(int n) {\n var result = new ArrayList<String>(n);\n for (int i = 0; i < n; i++) {\n result.add(next());\n }\n return result;\n }\n List<Integer> nextIntList(int n) {\n var result = new ArrayList<Integer>(n);\n for (int i = 0; i < n; i++) {\n result.add(nextInt());\n }\n return result;\n }\n List<Long> nextLongList(int n) {\n var result = new ArrayList<Long>(n);\n for (int i = 0; i < n; i++) {\n result.add(nextLong());\n }\n return result;\n }\n }\n static final class MyWriter extends PrintWriter {\n MyWriter(OutputStream out) {\n super(out);\n }\n void println(int[] x) {\n println(x, \" \");\n }\n void println(int[] x, String delimiter) {\n if (x.length > 0) {\n print(x[0]);\n for (int i = 1; i < x.length; i++) {\n print(delimiter);\n print(x[i]);\n }\n }\n println();\n }\n void println(long[] x) {\n println(x, \" \");\n }\n void println(long[] x, String delimiter) {\n if (x.length > 0) {\n print(x[0]);\n for (int i = 1; i < x.length; i++) {\n print(delimiter);\n print(x[i]);\n }\n }\n println();\n }\n void println(Iterable<?> iterable) {\n println(iterable, \" \");\n }\n void println(Iterable<?> iterable, String delimiter) {\n Iterator<?> i = iterable.iterator();\n if (i.hasNext()) {\n print(i.next());\n while (i.hasNext()) {\n print(delimiter);\n print(i.next());\n }\n }\n println();\n }\n void printLines(int[] x) {\n println(x, System.lineSeparator());\n }\n void printLines(long[] x) {\n println(x, System.lineSeparator());\n }\n void printLines(Iterable<?> iterable) {\n println(iterable, System.lineSeparator());\n }\n }\n}\n", "import java.io.*; \nimport java.math.*;\nimport java.util.*;\npublic class Main { //~IQEmperor~ \n\tpublic static void main(String[] args) {\n\t\tFastScanner I = new FastScanner(); //Input\n\t\tOutPut O = new OutPut(); //Output\n\t\tint R = I.nextInt();\n\t\tint C = I.nextInt();\n\t\tint K = I.nextInt();\n\t\tlong[][] goods = new long[R][C];\n\t\tlong[][] dp = new long[R][C]; //{0,1,2,3} items picked up in row so far\n\t\twhile (K-->0) {\n\t\t\tint r = I.nextInt()-1;\n\t\t\tint c = I.nextInt()-1;\n\t\t\tgoods[r][c] = I.nextLong();\n\t\t}\n\t\tdp[0][0]=goods[0][0];\n\t\tlong lo = 0;\n\t\tlong mid = 0;\n\t\tlong hi = 0;\n\t\tif (dp[0][0]>0) hi = dp[0][0];\n\t\tfor (int c = 1; c < C; c++) {\n\t\t\tif (goods[0][c]>0) {\n\t\t\t\tif (goods[0][c]>hi) {\n\t\t\t\t\tlong M = hi;\n\t\t\t\t\tlong L = mid;\n\t\t\t\t\thi=goods[0][c];\n\t\t\t\t\tmid=M;\n\t\t\t\t\tlo=L;\n\t\t\t\t}else if (goods[0][c]>mid) {\n\t\t\t\t\tlong L = mid;\n\t\t\t\t\tmid=goods[0][c];\n\t\t\t\t\tlo=L;\n\t\t\t\t}else if (goods[0][c]>lo) {\n\t\t\t\t\tlo=goods[0][c];\n\t\t\t\t}\n\t\t\t\tdp[0][c]=lo+mid+hi;\n\t\t\t}else dp[0][c]=dp[0][c-1]; //Just rely on previous cell if no items \n\t\t}\n\t\tfor (int r = 1; r < R; r++) {\n\t\t\tdp[r][0]=dp[r-1][0]+goods[r][0];\n\t\t}\n\t\tfor (int r = 1; r < R; r++) {\n\t\t\tfor (int c = 1; c < C; c++) {\n\t\t\t\tif (goods[r][c]>0) {\n\t\t\t\t\tlong x = 0;\n\t\t\t\t\tlong y = 0;\n\t\t\t\t\tlong z = 0; //{x,y,z} indicate three biggest in sorted order \n\t\t\t\t\tfor (int back = c; back>=0; back--) {\n\t\t\t\t\t\tif (goods[r][back]>0) {\n\t\t\t\t\t\t\tif (goods[r][back]>z) {\n\t\t\t\t\t\t\t\tlong Y = z;\n\t\t\t\t\t\t\t\tlong X = y;\n\t\t\t\t\t\t\t\tz=goods[r][back];\n\t\t\t\t\t\t\t\ty=Y;\n\t\t\t\t\t\t\t\tx=X;\n\t\t\t\t\t\t\t}else if (goods[r][back]>y) {\n\t\t\t\t\t\t\t\tlong X = y;\n\t\t\t\t\t\t\t\ty=goods[r][back];\n\t\t\t\t\t\t\t\tx=X;\n\t\t\t\t\t\t\t}else if (goods[r][back]>x) {\n\t\t\t\t\t\t\t\tx=goods[r][back];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[r][c]=max(dp[r][c],dp[r-1][back]+x+y+z);\n\t\t\t\t\t}\n\t\t\t\t}else {\n\t\t\t\t\tdp[r][c]=max(dp[r-1][c],dp[r][c-1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tO.pln(dp[R-1][C-1]);\n\t}\n\tpublic static long min(long a, long b) {return Math.min(a,b);}\n\tpublic static long max(long a, long b) {return Math.max(a,b);}\n\tpublic static int min(int a, int b) {return Math.min(a,b);}\n\tpublic static int max(int a, int b) {return Math.max(a,b);}\n\tpublic static long abs(long x, long y) {return Math.abs(x-y);}\n\tpublic static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) \n\tans++; return ans;}\n\tpublic static long GCD(long a, long b) {\n\t\tif (a==0||b==0) return Math.max(a,b);\n\t\treturn GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));\n\t}\n\tpublic static long FastExp(long base, long exp, long mod) {\n\t\tlong ans=1;\n\t\twhile (exp>0) {\n\t\t\tif (exp%2==1) ans*=base;\n\t\t\texp/=2;\n\t\t\tbase*=base;\n\t\t\tbase%=mod;\n\t\t\tans%=mod;\n\t\t}\n\t\treturn ans;\n\t}\n\tpublic static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}\n\tpublic static int pop(long x) { //Returns number of bits within a number\n\t\tint cnt = 0;\n\t\twhile (x>0) {\n\t\t\tif (x%2==1) cnt++;\n\t\t\tx/=2;\n\t\t}\n\t\treturn cnt;\n\t}\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint nextInt() {return Integer.parseInt(next());}\n\t\tlong nextLong() {return Long.parseLong(next());};\n\t\tdouble nextDouble() {return Double.parseDouble(next());}\n\t}\n\tstatic class OutPut{\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\tvoid pln(double x) {w.println(x);w.flush();}\n\t\tvoid pln(boolean x) {w.println(x);w.flush();}\n\t\tvoid pln(int x) {w.println(x);w.flush();}\n\t\tvoid pln(long x) {w.println(x);w.flush();}\n\t\tvoid pln(String x) {w.println(x);w.flush();}\n\t\tvoid pln(char x) {w.println(x);w.flush();}\n\t\tvoid pln(StringBuilder x) {w.println(x);w.flush();}\n\t\tvoid pln(BigInteger x) {w.println(x);w.flush();}\n\t\tvoid p(int x) {w.print(x);w.flush();}\n\t\tvoid p(long x) {w.print(x);w.flush();}\n\t\tvoid p(String x) {w.print(x);w.flush();}\n\t\tvoid p(char x) {w.print(x);w.flush();}\n\t\tvoid p(StringBuilder x) {w.print(x);w.flush();}\n\t\tvoid p(BigInteger x) {w.print(x);w.flush();}\n\t\tvoid p(double x) {w.print(x);w.flush();}\n\t\tvoid p(boolean x) {w.print(x);w.flush();}\n\t}\n}\n", "import sys\n\ninput = sys.stdin.readline\nR, C, k = map(int, input().split())\nxs = [[0] * C for _ in range(R)]\nfor _ in range(k):\n r, c, v = map(int, input().split())\n xs[r - 1][c - 1] = v\n\ndp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]\nfor i in range(R):\n for j in range(C):\n for k in range(2, -1, -1):\n dp[k + 1][i][j] = max(dp[k + 1][i][j], dp[k][i][j] + xs[i][j])\n for k in range(4):\n dp[k][i][j + 1] = max(dp[k][i][j + 1], dp[k][i][j])\n dp[0][i + 1][j] = max(dp[0][i + 1][j], dp[k][i][j])\nans = 0\nfor k in range(4):\n ans = max(ans, dp[k][R - 1][C - 1])\nprint(ans)\n", "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\n\n static class Task {\n\n private static final int MOD = 998244353;\n\n private long gcd(long m, long n) {\n if (n == 0) {\n return m;\n }\n return gcd(n, m % n);\n }\n\n // 快速幂\n public int pow(long x, long n, int mod) {\n long res = 1;\n x %= mod;\n while (n > 0) {\n if ((n & 1) == 1) {\n res = res * x % mod;\n }\n\n x = x * x % mod;\n n >>>= 1;\n }\n return (int) res % mod;\n }\n\n\n int[] h,to,next,wt,fa;int ct = 0;\n void init(int n ,int m){\n h = new int[n]; Arrays.fill(h,-1);\n to = new int[m*2+2];\n wt = new int[m*2+2];\n next = new int[m*2+2];\n fa = new int[n];Arrays.fill(fa,-1);\n ct = 0;\n }\n\n void add(int u,int v,int w){\n to[++ct] = v;\n next[ct] = h[u];\n wt[ct] = w;\n h[u] = ct;\n }\n\n\n long[][] mult(long a[][],long b[][], long mod){\n int l1 = a.length;\n int l2 = b.length;\n int l3 = b[0].length;\n long r[][] = new long[l1][l3];\n for(int i=0;i<l1;++i){\n for(int j=0;j<l2;++j){\n for(int k=0;k<l3;++k){\n r[i][k] = (r[i][k] + a[i][j] * b[j][k])%mod;\n }\n }\n }\n return r;\n }\n\n long[][] ones(int len){\n long r[][] = new long[len][len];\n for(int i=0;i<len;++i){\n r[i][i] = 1L;\n }\n return r;\n }\n\n long[][] quick(long a[][], int times,long mod){\n int len = a.length;\n long ans[][] = ones(len);\n\n while(times>0){\n if((times&1)==1) {\n ans = mult(ans, a, mod);\n }\n a = mult(a, a, mod);\n times >>= 1;\n }\n\n return ans;\n }\n\n public static long max(long... a) {\n long x = a[0];\n int len = a.length;\n for (int i = 1; i < len; ++i) {\n x = Math.max(x, a[i]);\n }\n return x;\n }\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n\n int r = in.nextInt();\n int c = in.nextInt();\n int k = in.nextInt();\n long[][] g = new long[r + 1][c + 1];\n for (int i = 0; i < k; i++) g[in.nextInt()][in.nextInt()] = in.nextLong();\n long[][][] dp = new long[4][r + 1][c + 1];\n for (int i = 1; i <= r; i++) {\n for (int x = 1; x <= 3; x++) {\n for (int j = 1; j <= c; j++) {\n dp[x][i][j] = max(dp[x - 1][i][j - 1] + g[i][j], dp[x][i][j - 1]);\n if (x == 1) {\n dp[x][i][j] = max(dp[x][i][j], g[i][j] + max(dp[1][i - 1][j], dp[2][i - 1][j], dp[3][i - 1][j]));\n }\n }\n }\n }\n long ans = max(dp[1][r][c], dp[2][r][c], dp[3][r][c]);\n out.println(ans);\n\n\n\n }\n }\n\n private static void sort(double[] arr) {\n Double[] objArr = Arrays.stream(arr).boxed().toArray(Double[]::new);\n Arrays.sort(objArr);\n for (int i = 0; i < arr.length; i++) {\n arr[i] = objArr[i];\n }\n }\n\n private static void sort(int[] arr) {\n Integer[] objArr = Arrays.stream(arr).boxed().toArray(Integer[]::new);\n Arrays.sort(objArr);\n for (int i = 0; i < arr.length; i++) {\n arr[i] = objArr[i];\n }\n }\n\n private static void sort(long[] arr) {\n Long[] objArr = Arrays.stream(arr).boxed().toArray(Long[]::new);\n Arrays.sort(objArr);\n for (int i = 0; i < arr.length; i++) {\n arr[i] = objArr[i];\n }\n }\n\n private static void solve() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n Task task = new Task();\n task.solve(1, in, out);\n out.close();\n }\n\n public static void main(String[] args) {\n new Thread(null, () -> solve(), \"1\", 1 << 26).start();\n }\n\n static class InputReader {\n\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public int[] nextArray(int n){\n int res[] = new int[n];\n for(int i=0;i<n;++i){\n res[i] = nextInt();\n }\n return res;\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n }\n\n}\n\n\n", "import sys\n\nreadline = sys.stdin.readline\nreadall = sys.stdin.read\nns = lambda: readline().rstrip()\nni = lambda: int(readline().rstrip())\nnm = lambda: map(int, readline().split())\nnl = lambda: list(map(int, readline().split()))\nprn = lambda x: print(*x, sep='\\n')\n\ndef solve():\n h, w, k = nm()\n d = dict()\n for _ in range(k):\n r, c, v = nm()\n d[r * 10000 + c - 10001] = v\n prv = [[0]*4 for _ in range(w+1)]\n nxt = [[0]*4 for _ in range(w+1)]\n for i in range(h):\n for j in range(w):\n f = d.get(i * 10000 + j, 0)\n t = max(prv[j])\n for v in range(4):\n nxt[j][v] = max(nxt[j-1][v], t)\n if v:\n nxt[j][v] = max(nxt[j][v], nxt[j-1][v-1] + f, t + f)\n prv, nxt = nxt, prv\n print(max(prv[w-1]))\n\n return\n\nsolve()\n", "#include <bits/stdc++.h>\n#define maxn 3086\n\nusing namespace std;\n\nint n, m, k;\nint a[maxn][maxn];\nint x, y, z;\nlong long f[maxn][maxn][4];\n\ninline void Max(long long &x, long long y){\n\tx = max(x, y);\n}\n\nint main(){\n\tscanf(\"%d%d%d\", &n, &m, &k);\n\twhile(k--){\n\t\tscanf(\"%d%d%d\", &x, &y, &z);\n\t\ta[x][y] = z;\n\t}\n\tmemset(f, -0x3f, sizeof(f));\n\tf[1][1][0] = 0;\n\tfor(int i = 1;i <= n;i++){\n\t\tfor(int j = 1;j <= m;j++){\n\t\t\tfor(int k = 0;k <= 3;k++){\n\t\t\t\tMax(f[i][j][k], f[i - 1][j][0]);\n\t\t\t\tMax(f[i][j][k], f[i - 1][j][1]);\n\t\t\t\tMax(f[i][j][k], f[i - 1][j][2]);\n\t\t\t\tMax(f[i][j][k], f[i - 1][j][3]);\n\t\t\t\tMax(f[i][j][k], f[i][j - 1][k]);\n\t\t\t}\n\t\t\tif(a[i][j]) for(int k = 3;k;k--) Max(f[i][j][k], f[i][j][k - 1] + a[i][j]);\n\t\t}\n\t}\n\tlong long ans = -1e18;\n\tfor(int i = 0;i <= 3;i++) Max(ans, f[n][m][i]);\n\tprintf(\"%lld\", ans);\n}\n", "import sys\ndef input(): return sys.stdin.readline().strip()\ndef mapint(): return map(int, input().split())\nsys.setrecursionlimit(10**9)\n\nR, C, K = mapint()\nlast_dp = [[0]*4 for _ in range(C)]\ndic = [[0]*C for _ in range(R)]\nfor _ in range(K):\n r, c, v = mapint()\n dic[r-1][c-1] = v\n\nfor r in range(R):\n dp = [[0]*4 for _ in range(C)]\n for c in range(C):\n v = dic[r][c]\n for i in range(4):\n if c!=0:\n dp[c][i] = dp[c-1][i]\n if r!=0:\n dp[c][0] = max(dp[c][0], last_dp[c][i])\n if v!=0:\n for i in range(2, -1, -1):\n dp[c][i+1] = max(dp[c][i+1], dp[c][i]+v)\n last_dp = dp\n\nprint(max(dp[C-1]))", "r,c,k=map(int,input().split())\nitems=[list(map(int,input().split())) for _ in range(k)]\ndp=[[[0 for _ in range(c+1)] for _ in range(r+1)] for _ in range(5)]\nfor x,y,z in items:\n dp[4][x][y]=z\nfor i in range(1,r+1):\n for j in range(1,c+1):\n v=dp[4][i][j]\n dp[0][i][j]=max(dp[0][i][j-1],dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j])\n dp[1][i][j]=max(dp[1][i][j-1],dp[0][i][j-1]+v,max(dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j])+v)\n dp[2][i][j]=max(dp[2][i][j-1],dp[1][i][j-1]+v)\n dp[3][i][j]=max(dp[3][i][j-1],dp[2][i][j-1]+v)\nprint(max(dp[i][r][c] for i in range(4)))", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)\n#define rep3(i, s, n) for (int i = (s); i <=(int) (n); i++)\n#define chmax(x,y) x = max(x,y)\n\n\tint a[3005][3005];\n\tlong long dp[3005][3005][5];\n\n\nint main() {\n\tint R,C,n;\n\tcin >> R >> C >> n;\n\n\trep(i, n) {\n\tint r,c,v;\n\t\tcin >> r >> c >> v;\n\t\ta[r-1][c-1]=v;\n\t}\n\n\trep(i,R){\n \t\trep(j,C) {\n\t\t\tfor (int k=2;k>=0; k--){\n\t\t\t\tchmax(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n\t\t\t}\n\t\t\trep(k,4) {\n\t\t\t\tchmax(dp[i+1][j][0],dp[i][j][k]);\n\t\t\t\tchmax(dp[i][j+1][k],dp[i][j][k]);\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\tlong long ans =0;\n\trep(k,4) chmax(ans,dp[R-1][C-1][k]);\n\n\tcout << ans << endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing vll = vector<ll> ;\n#define all(v) v.begin(),v.end()\n \nll dp[3010][3010][4];\nll item[3010][3010];\n \nint main(){\n int R,C;ll K;\n cin>>R>>C>>K;\n rep(i,K){\n int r,c;cin>>r>>c;r--,c--;\n int v;cin>>v;\n item[r][c]=v;\n }\n dp[0][0][1] = item[0][0];\n rep(i,R){\n rep(j,C){\n rep(k,4){\n dp[i+1][j][0] = max(dp[i+1][j][0],dp[i][j][k]);\n dp[i+1][j][1] = max(dp[i+1][j][1],dp[i][j][k]+item[i+1][j]);\n dp[i][j+1][k] = max(dp[i][j+1][k],dp[i][j][k]);\n if(k+1<=3) dp[i][j+1][k+1] = max(dp[i][j+1][k+1], dp[i][j][k] + item[i][j+1]);\n }\n }\n }\n cout << *max_element(dp[R-1][C-1], dp[R-1][C-1]+4) << endl;\n return 0;\n}", "#include<bits/stdc++.h>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\nll rc[3001][3001];\nint r,c,k;\nll dp[3001][3001][4]; \nint main(){\n\t scanf(\"%d%d%d\",&r,&c,&k);\n\t for(int i=1;i<=k;i++){\n\t \tint x,y,w;\n\t \tscanf(\"%d%d%d\",&x,&y,&w);\n\t \trc[x][y]=w;\n\t }\t \n\t for(int i=1;i<=r;i++){\n\t \tfor(int j=1;j<=c;j++){\n\t \t\tdp[i][j][0]=max(max(dp[i-1][j][0],dp[i-1][j][1]),dp[i-1][j][2])+rc[i][j];\n\t\t\t for(int k=0;k<3;k++){\n\t\t\t \tdp[i][j][k]=max(dp[i][j-1][k],dp[i][j][k]);\n\t \t\t\tif(dp[i][j-1][k]==0){\n\t \t\t\t\tdp[i][j][k]=max(dp[i][j][k],rc[i][j]);\n\t \t\t\t\tbreak;\n\t\t\t\t }else{\n\t\t\t\t \tdp[i][j][k+1]=max(dp[i][j-1][k]+rc[i][j],dp[i][j][k+1]);\n\t\t\t\t }\n\t\t\t }\n\t\t }\n\t }\n\t ll res=0;\n\t for(int i=0;i<3;i++)\n\t res=max(res,dp[r][c][i]);\n\t printf(\"%lld\\n\",res);\n}", "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<vector>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=3010;\nll f[maxn][maxn][4];\nll a[maxn][maxn];\n\nint main()\n{\n\tint r,c,k;cin>>r>>c>>k;\n\twhile(k--){\n\t\tint x,y,z;cin>>x>>y>>z;\n\t\ta[x][y]=z;\n\t}\n\tfor(int i=1;i<=r;i++){\n\t\tfor(int j=1;j<=c;j++){\n\t\t\tfor(int t=1;t<=3;t++){\n\t\t\t\tf[i][j][t]=max(f[i-1][j][3]+a[i][j],max(f[i][j-1][t],f[i][j-1][t-1]+a[i][j]));\n\t\t\t}\n\t\t}\n\t}\n\tcout<<f[r][c][3];\n\treturn 0;\t\n} ", "#!/usr/bin/env python3\n\nR, C, K = list(map(int, input().split()))\n\nV = [[] for i in range(R)]\nfor i in range(K):\n r, c, v = list(map(int, input().split()))\n V[r-1].append([c, v])\n\n\n# dp = [[[0 for j in range(R+1)] for i in range(C+1)]\n\n# print(rck)\ndp = [0] * (C+1)\nfor r in range(1, R+1):\n tmp0 = 0\n tmp1 = 0\n tmp2 = 0\n tmp3 = 0\n V[r-1].sort()\n for c, v in V[r-1]:\n tmp0 = max(dp[c], tmp0)\n tmp1 = max(dp[c], tmp1)\n tmp2 = max(dp[c], tmp2)\n tmp3 = max(dp[c], tmp3)\n\n tmp3 = max(tmp3, tmp2+v)\n tmp2 = max(tmp2, tmp1+v)\n tmp1 = max(tmp1, tmp0+v)\n\n dp[c] = max(tmp0, tmp1, tmp2, tmp3)\n for i in range(1, C+1):\n dp[i] = max(dp[i], dp[i-1])\n # print(dp)\n\nprint(dp[-1])\n", "\nimport java.util.*;\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t\tins.calc();\n\t\tins.showResult();\n\t}\n\n\tint R, C, K;\n\tlong[][] map;\n\tlong[][][] memo;\n\n\tMain(BufferedReader in) throws IOException {\n\t\tString[] tokens = in.readLine().split(\" \");\n\t\tR = Integer.parseInt(tokens[0]);\n\t\tC = Integer.parseInt(tokens[1]);\n\t\tK = Integer.parseInt(tokens[2]);\n\t\tmap = new long[R][C];\n\t\tmemo = new long[R][C][4];\n\t\tfor (int i = 0; i < R; ++i) {\n\t\t\tArrays.fill(map[i], 0);\n\t\t}\n\t\tfor (int i = 0; i < R; ++i) {\n\t\t\tfor (int j = 0; j < C; ++j) {\n\t\t\t\tArrays.fill(memo[i][j], 0L);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < K; ++i) {\n\t\t\ttokens = in.readLine().split(\" \");\n\t\t\tint r = Integer.parseInt(tokens[0]) - 1;\n\t\t\tint c = Integer.parseInt(tokens[1]) - 1;\n\t\t\tlong v = Long.parseLong(tokens[2]);\n\t\t\tmap[r][c] = v;\n\t\t}\n\n\t}\n\n\tvoid calc() {\n\t\tif (map[0][0] > 0L) {\n\t\t\tfor (int i = 1; i < 4; ++i) {\n\t\t\t\tmemo[0][0][i] = map[0][0];\n\t\t\t}\n\t\t}\n\t\t// 初期\n\t\tfor (int r = 1; r < R; ++r) {\n\t\t\tif (map[r][0] > 0L) {\n\t\t\t\tlong v = map[r][0];\n\t\t\t\tmemo[r][0][0] = memo[r - 1][0][3];\n\t\t\t\tfor (int i = 1; i < 4; ++i) {\n\t\t\t\t\tmemo[r][0][i] = memo[r - 1][0][3] + v;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\t\tmemo[r][0][i] = memo[r - 1][0][3];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int c = 1; c < C; ++c) {\n\t\t\tif (map[0][c] > 0L) {\n\t\t\t\tlong v = map[0][c];\n\t\t\t\tmemo[0][c][0] = memo[0][c - 1][0];\n\t\t\t\tfor (int i = 1; i < 4; ++i) {\n\t\t\t\t\tmemo[0][c][i] = Math.max(memo[0][c - 1][i], memo[0][c - 1][i - 1] + v);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\t\tmemo[0][c][i] = memo[0][c - 1][i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// 計算\n\t\tfor (int r = 1; r < R; ++r) {\n\t\t\tfor (int c = 1; c < C; ++c) {\n\t\t\t\tif (map[r][c] > 0L) {\n\t\t\t\t\tlong v = map[r][c];\n\t\t\t\t\t// 拾わない場合\n\t\t\t\t\tmemo[r][c][0] = Math.max(memo[r - 1][c][3], memo[r][c - 1][0]);\n\t\t\t\t\tfor (int i = 1; i < 4; ++i) {\n\t\t\t\t\t\t// 横から来た場合\n\t\t\t\t\t\tmemo[r][c][i] = Math.max(memo[r][c - 1][i], memo[r][c - 1][i - 1] + v);\n\t\t\t\t\t\t// 上から来た場合\n\t\t\t\t\t\tmemo[r][c][i] = Math.max(memo[r][c][i], memo[r - 1][c][3] + v);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// 単純に上下の比較をする\n\t\t\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\t\t\tmemo[r][c][i] = Math.max(memo[r - 1][c][3], memo[r][c - 1][i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid show(int i) {\n\t\tfor (int r = 0; r < R; ++r) {\n\t\t\tfor (int c = 0; c < C; ++c) {\n\t\t\t\tSystem.out.print(memo[r][c][i] + \" \");\n\t\t\t}\n\t\t\tSystem.out.println(\"\");\n\t\t}\n\t\tSystem.out.println(\"\");\n\t}\n\n\tvoid showResult() {\n//\t\tfor (int i = 0; i < 4; ++i) {\n//\t\t\tshow(i);\n//\t\t}\n\t\tlong max = Long.MIN_VALUE / 2;\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tmax = Math.max(memo[R - 1][C - 1][i], max);\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}", "def main():\n import sys\n input = sys.stdin.readline\n\n r,c,k = map(int,input().split())\n b = [[0 for _ in range(c)] for _ in range(r)]\n for i in range(k):\n y,x,v = map(int,input().split())\n y -= 1\n x -= 1\n b[y][x] = v\n\n # dp[j][l]:(i,j)に居て、i行目のアイテムをl個拾ったときの価値最大値。\n dp = [[0 for _ in range(4)] for _ in range(c+1)]\n for i in range(r):\n for j in range(c):\n # アイテムを拾う遷移。個数が多い方から計算する。\n for l in range(2,-1,-1):\n dp[j][l+1] = max(dp[j][l]+b[i][j],dp[j][l+1])\n # 移動する遷移。行を移動する際は、拾ったアイテム数はリセットされる。\n for l in range(4):\n dp[j+1][l] = max(dp[j][l],dp[j+1][l])\n dp[j][0] = max(dp[j][l],dp[j][0])\n ans = 0\n for i in range(4):\n ans = max(dp[c-1][i],ans)\n print(ans)\n\nmain()", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = int64_t;\n#define repb(i,n,b) for (ll i = b; i < (ll)(n); i++)\n#define rep(i,n) repb(i,n,0)\nll dp[3001][3001][4];\nll gds[3001][3001];\nint main(){\n\tll R,C,K;\n\tcin>>R>>C>>K;\n\trep(i,K){\n\t\tll r,c,v;\n\t\tcin>>r>>c>>v;\n\t\tgds[r-1][c-1]=v;\n\t}\n\trep(i,3){\n\t\tdp[0][0][i]=gds[0][0];\n\t}\n\tdp[0][0][3]=0;\n\trepb(c,C,1){\n\t\trep(i,3){\n\t\t\tdp[0][c][i]=max(dp[0][c-1][i+1]+gds[0][c],dp[0][c-1][i]);\n\t\t}\n\t\tdp[0][c][3]=dp[0][c-1][3];\n\t}\n\trepb(r,R,1){\n\t\trep(i,3){\n\t\t\tdp[r][0][i]=gds[r][0]+dp[r-1][0][0];\n\t\t}\n\t\tdp[r][0][3]=dp[r-1][0][0];\n\t}\n\trepb(r,R,1){\n\t\trepb(c,C,1){\n\t\t\trep(i,3){\n\t\t\t\tdp[r][c][i]=max(max(dp[r][c-1][i+1]+gds[r][c],dp[r][c-1][i]),dp[r-1][c][0]+gds[r][c]);\n\t\t\t}\n\t\t\tdp[r][c][3]=max(dp[r][c-1][3],dp[r-1][c][0]);\n\t\t}\n\t}\n\tcout<<dp[R-1][C-1][0]<<endl;\n}\n", "#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define chmax(x, y) x = max(x, y)\nusing namespace std;\ntypedef long long ll;\n\nll a[3005][3005], dp[3005][3005][4];\n\nint main() {\n ll R, C, n, ans = 0, r, c, v;\n cin >> R >> C >> n;\n rep(i, n) cin >> r >> c >> v, a[r - 1][c - 1] = v;\n\n rep(i, R) rep(j, C) {\n for (int k = 2; k >= 0; --k) chmax(dp[i][j][k + 1], dp[i][j][k] + a[i][j]);\n rep(k, 4) {\n chmax(dp[i + 1][j][0], dp[i][j][k]);\n chmax(dp[i][j + 1][k], dp[i][j][k]);\n }\n }\n rep(k, 4) chmax(ans, dp[R - 1][C - 1][k]);\n cout << ans << endl;\n return 0;\n}", "R, C, K = map(int, input().split())\ng = [[-float('inf')]*C for _ in range(R)]\nfor i in range(K):\n r, c, k = map(int, input().split())\n r -= 1\n c -= 1\n g[r][c] = k\n\ndp = [[[0]*(C+1) for _ in range(R+1)] for _ in range(4)]\nfor r in range(R):\n for c in range(C):\n # k[0..3] = 0個拾っている状態から3個拾っている状態\n # indexが大きいほど、小さいアイテムとなるので、小さいものから更新していく\n for k in range(2, -1, -1):\n dp[k+1][r][c] = max(\n dp[k+1][r][c],\n dp[k][r][c]+g[r][c]\n )\n\n for k in range(4):\n dp[0][r+1][c] = max(dp[0][r+1][c], dp[k][r][c])\n dp[k][r][c+1] = max(dp[k][r][c+1], dp[k][r][c])\n\nans = 0\nfor i in range(4):\n ans = max(dp[i][R-1][C-1], ans)\nprint(ans)\n", "#include <bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int>P;\n\nconst int MOD=1000000007;\nconst int INF=0x3f3f3f3f;\nconst ll INFL=0x3f3f3f3f3f3f3f3f;\n\nll dp[5000][5000][4];\nint val[5000][5000];\n\nint main(){\n\tint h,w,K;cin>>h>>w>>K;\n\trep(i,K){\n\t\tint r,c,v;scanf(\"%d%d%d\",&r,&c,&v);r--;c--;\n\t\tval[r][c]=v;\n\t}\n\trep(i,h)rep(j,w)rep(k,4){\n\t\t//pick\n\t\tif(k<=2){\n\t\t\tif(i+1<h)dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]+val[i][j]);\n\t\t\tif(j+1<w)dp[i][j+1][k+1]=max(dp[i][j+1][k],dp[i][j][k]+val[i][j]);\n\t\t}\n\t\tif(i+1<h)dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n\t\tif(j+1<w)dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n\t}\n\tll Max=0;\n\trep(k,4){\n\t\tif(k<=2)Max=max(Max,dp[h-1][w-1][k]+val[h-1][w-1]);\n\t\telse Max=max(Max,dp[h-1][w-1][k]);\n\t}\n\tcout<<Max<<endl;\n}", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n static int n,m;\n static int[][]vals;\n static long[][][]memo;\n\n static long dp(int c,int i,int j){\n if (i==n&&j==m)\n return 0;\n if (memo[c][i][j]!=-1)\n return memo[c][i][j];\n\n long ans=(long)-1e16;\n if (i<n){\n if (vals[i+1][j]!=0){\n ans=Math.max(ans,vals[i+1][j]+dp(2,i+1,j));\n }\n ans=Math.max(ans,dp(3,i+1,j));\n }\n if (j<m){\n if (vals[i][j+1]!=0){\n if (c>0)\n ans=Math.max(ans,vals[i][j+1]+dp(c-1,i,j+1));\n }\n ans=Math.max(ans,dp(c,i,j+1));\n }\n return memo[c][i][j]=ans;\n }\n public static void main(String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n n = sc.nextInt();\n m = sc.nextInt();\n int k = sc.nextInt();\n vals= new int[n+1][m+1];\n memo= new long[4][n+1][m+1];\n while (k-->0)\n vals[sc.nextInt()][sc.nextInt()]=sc.nextInt();\n for (long[][]x:memo)for (long[]z:x)Arrays.fill(z,-1);\n\n pw.println(Math.max(vals[1][1]+dp(2,1,1),dp(3,1,1)));\n pw.close();\n\n }\n\n\n\n static class Scanner {\n BufferedReader br;\n StringTokenizer st;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArr(int n) throws IOException {\n int[] arr = new int[n];\n for (int i = 0; i < n; i++) {\n arr[i] = Integer.parseInt(next());\n }\n return arr;\n }\n\n }\n\n}", "#include<bits/stdc++.h> \nusing namespace std;\nint n,k,mm[3030][3030],m;\nlong long f[3030][3030][4];\nint main() {\nint r,v,c;\n\tscanf(\"%d%d%d\",&n,&m,&k);\n\tfor (int i = 1;i <= k; i++) {\n\t\tscanf(\"%d%d%d\",&r,&c,&v);\n\t\tmm[r][c] = v;\n\t}\n\tfor (int i = 1;i <= n; i++)\n\t\tfor (int j = 1;j <= m; j++) {\n\t\t\n\t\t\t\tf[i][j][0] = max(f[i][j-1][0],f[i-1][j][3]);\n\t\t\t\tf[i][j][1] = f[i][j][0];\n\t\t\t\tf[i][j][1] = max(f[i][j][1],f[i][j][0]+mm[i][j]);\n\t\t\t\tf[i][j][1] = max(f[i][j][1],f[i][j-1][1]);\n\t\t\t\tf[i][j][2] = f[i][j][1];\n\t\t\t\tf[i][j][2] = max(f[i][j][2],f[i][j-1][1]+mm[i][j]);\n\t\t\t\tf[i][j][2] = max(f[i][j][2],f[i][j-1][2]);\n\t\t\t\tf[i][j][3] = f[i][j][2];\n\t\t\t\tf[i][j][3] = max(f[i][j][3],f[i][j-1][2]+mm[i][j]);\n\t\t\t\tf[i][j][3] = max(f[i][j][3],f[i][j-1][3]);\n\t\t}\n\t\t\n\tprintf(\"%lld\\n\",f[n][m][3]);\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long f[3010][3010][4];\nint r, c, k;\nint v[3010][3010];\n\nint main() {\n\tscanf(\"%d%d%d\", &r, &c, &k);\n\twhile (k--) {\n\t\tint x, y; scanf(\"%d%d\", &x, &y);\n\t\tscanf(\"%d\", &v[x][y]);\n\t}\n\tfor (int i = 1; i <= r; ++i)\n\t\tfor (int j = 1; j <= c; ++j) {\n\t\t\tf[i][j][0] = max(f[i][j - 1][0], f[i - 1][j][3]);\n\t\t\tfor (int k = 1; k <= 3; ++k)\n\t\t\t\tf[i][j][k] = max(f[i][j][k - 1],\n\t\t\t\t\t\tmax(f[i][j - 1][k],\n\t\t\t\t\t\t\tmax(f[i][j - 1][k - 1],\n\t\t\t\t\t\t\t\tf[i - 1][j][3]) + v[i][j]));\n\t\t}\n\tprintf(\"%lld\\n\", f[r][c][3]);\n\treturn 0;\n}\n\n", "\"\"\"\ndp[i][j][k] => i行目j列到達時点での最大価値。i行目において拾えるアイテムの数はK個。\n\"\"\"\ndef main():\n import sys\n input = sys.stdin.readline\n R,C,K = map(int,input().split())\n items = [[0]*C for _ in range(R)]\n for _ in range(K):\n r,c,v = map(int,input().split())\n items[r-1][c-1] = v\n\n dp = [[0]*4 for _ in range(C)]\n\n for i in range(R):\n for j in range(C):\n v = items[i][j]\n\n #上から入るパターン\n dp[j][0] = max(dp[j])\n if v:\n dp[j][1] = dp[j][0]+v\n \n #左から入ってくるパターン\n if j > 0:\n for k in range(4):\n #このマスのアイテムをとらないパターン\n dp[j][k] = max(dp[j][k],dp[j-1][k])\n if v and k>0:\n dp[j][k] = max(dp[j][k],dp[j-1][k-1]+v)\n\n print(max(dp[-1]))\nmain()", "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tstatic void solve() {\n\t\tint R = ni(), C = ni(), K = ni();\n\t\tlong[][] f = new long[R+1][C+1];\n\t\tfor(int i=0;i<K;i++) {\n\t\t\tf[ni()][ni()] = ni();\n\t\t}\n\t\tlong[][][] dp = new long[R+1][C+1][4];\n\t\tfor(int i=0;i<R;i++) {\n\t\t\tfor(int j=0;j<C;j++) {\n\t\t\t\tfor(int k=0;k<4;k++) {\n\t\t\t\t\tdp[i+1][j+1][0] = max(dp[i+1][j+1][0], dp[i][j+1][k], dp[i+1][j][0]);\n\t\t\t\t}\t\t\t\n\t\t\t\tfor(int k=1;k<4;k++) {\n\t\t\t\t\tdp[i+1][j+1][k] = dp[i+1][j][k];\n\t\t\t\t}\n\t\t\t\tif(f[i+1][j+1] != 0) {\n\t\t\t\t\tfor(int k=0;k<4;k++) {\n\t\t\t\t\t\tdp[i+1][j+1][1] = max(dp[i+1][j+1][1], dp[i][j+1][k] + f[i+1][j+1]);\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\tfor(int k=1;k<4;k++) {\n\t\t\t\t\t\tdp[i+1][j+1][k] = max(dp[i+1][j+1][k], dp[i+1][j][k-1] + f[i+1][j+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong max = 0;\n\t\tfor(int k=0;k<4;k++) {\n\t\t\tmax = max(max, dp[R][C][k]);\n\t\t}\n\t\tout.println(max);\n\t}\n\t\t\n\t\n\t//constants\n\tstatic final int inf = Integer.MAX_VALUE / 2;\n\tstatic final long linf = Long.MAX_VALUE / 3;\n\tstatic final double dinf = Double.MAX_VALUE / 3;\n\tstatic final long mod = (long) 1e9 + 7;\n\tstatic final int[] dx = { -1, 0, 1, 0 }, dy = { 0, -1, 0, 1 }, dx8 = { -1, -1, -1, 0, 0, 1, 1, 1 }, dy8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\tstatic final double eps = 1e-10, pi = Math.PI;\n\tstatic StringBuilder sb = new StringBuilder();\n\t\n\t//libraries\n\tstatic void printAll(int[] a) {\n\t\tArrays.stream(a).forEach(i->out.print(i + \" \"));\n\t\tout.println();\n\t}\n\tstatic void printAll(long[] a) {\n\t\tArrays.stream(a).forEach(i->out.print(i + \" \"));\n\t\tout.println();\n\t}\n\tstatic void printAll(int[] a, int add) {\n\t\tArrays.stream(a).forEach(i->out.print(i + add + \" \"));\n\t\tout.println();\n\t}\n\tstatic void printAll(long[] a, long add) {\n\t\tArrays.stream(a).forEach(i->out.print(i + add + \" \"));\n\t\tout.println();\n\t}\n\tstatic List<Integer>[] makeTree(List<Integer>[] graph, int vertexNum, int edgeNum) {\n\t\tgraph = new ArrayList[vertexNum];\n\t\tfor(int i=0;i<vertexNum;i++)graph[i] = new ArrayList<>();\n\t\tfor(int i=0;i<edgeNum;i++) {\n\t\t\tint u = ni()-1, v = ni()-1;\n\t\t\tgraph[u].add(v);\n\t\t\tgraph[v].add(u);\n\t\t}\n\t\treturn graph;\n\t}\n\tstatic long[] cum(int a[]) {\n\t\tlong[] cum = new long[a.length + 1];\n\t\tfor(int i=0;i<a.length;i++) cum[i+1] = cum[i] + a[i];\n\t\treturn cum;\n\t}\n\tstatic long[] cum(long a[]) {\n\t\tlong[] cum = new long[a.length + 1];\n\t\tfor(int i=0;i<a.length;i++) cum[i+1] = cum[i] + a[i];\n\t\treturn cum;\n\t}\n\tstatic long sum(int a[]) {\n\t\tlong res = 0;\n\t\tfor(int i=0;i<a.length;i++) res += a[i];\n\t\treturn res;\n\t}\n\tstatic long sum(long a[]) {\n\t\tlong res = 0;\n\t\tfor(int i=0;i<a.length;i++) res += a[i];\n\t\treturn res;\n\t}\n\tstatic void reverse(int ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tint t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic void reverse(long ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tlong t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic void reverse(double ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tdouble t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic void reverse(char ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tchar t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic String getReverse(String s) {\n\t\tchar c[] = s.toCharArray();\n\t\treverse(c);\n\t\ts = String.valueOf(c);\n\t\treturn s;\n\t}\n\tstatic <T> void reverse(List<T> ls) {\n\t\tint sz = ls.size();\n\t\tfor (int i = 0; i < sz / 2; i++) {\n\t\t\tT t = ls.get(i);\n\t\t\tls.set(i, ls.get(sz - 1 - i));\n\t\t\tls.set(sz - 1 - i, t);\n\t\t}\n\t}\n\tstatic <T> void reverse(T[] ar) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tT t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\tstatic void sbnl() {//StringBuilderに改行文字をappendする\n\t\tsb.append(\"\\n\");\n\t}\n\tstatic int lowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int upperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rlowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rupperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int lowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int upperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rlowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rupperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int lowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int upperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rlowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rupperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int lowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int upperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rlowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic int rupperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\tstatic <T> int lowerBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) >= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\tstatic <T> int upperBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) > 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\tstatic <T> int rupperBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) < 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\tstatic <T> int rlowerBound(List<T> ls, T x) {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) <= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\tstatic int[] concat(int x, int arr[]) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\tstatic int[] concat(int arr[], int x) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\tstatic long[] concat(long x, long arr[]) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\tstatic long[] concat(long arr[], long x) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\tstatic char[] concat(char x, char arr[]) {\n\t\tchar ret[] = new char[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\tstatic char[] concat(char arr[], char x) {\n\t\tchar ret[] = new char[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\tstatic int max(int x, int y) {\n\t\treturn Math.max(x, y);\n\t}\n\tstatic int min(int x, int y) {\n\t\treturn Math.min(x, y);\n\t}\n\tstatic int max(int x, int y, int z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\tstatic int min(int x, int y, int z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\tstatic long max(long x, long y) {\n\t\treturn Math.max(x, y);\n\t}\n\tstatic long min(long x, long y) {\n\t\treturn Math.min(x, y);\n\t}\n\tstatic long max(long x, long y, long z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\tstatic long min(long x, long y, long z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\tstatic double max(double x, double y) {\n\t\treturn Math.max(x, y);\n\t}\n\tstatic double min(double x, double y) {\n\t\treturn Math.min(x, y);\n\t}\n\tstatic double max(double x, double y, double z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\tstatic double min(double x, double y, double z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\tstatic void sort(int[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\tstatic void sort(long[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\tstatic void sort(double[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\tstatic void sort(char[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\tstatic void rsort(int[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tint tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\tstatic void rsort(long[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tlong tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\tstatic void rsort(double[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tdouble tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\tstatic void rsort(char[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tchar tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\tstatic void fill(int arr[], int x) {\n\t\tArrays.fill(arr, x);\n\t}\n\tstatic void fill(long arr[], long x) {\n\t\tArrays.fill(arr, x);\n\t}\n\tstatic void fill(boolean arr[], boolean x) {\n\t\tArrays.fill(arr, x);\n\t}\n\tstatic void fill(double arr[], double x) {\n\t\tArrays.fill(arr, x);\n\t}\n\tstatic void fill(int arr[][], int x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\tstatic void fill(long arr[][], long x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\tstatic void fill(double arr[][], double x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\tstatic void fill(boolean arr[][], boolean x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\t//MOD culc\n\tstatic long plus(long x, long y) {\n\t\tlong res = (x + y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\tstatic long sub(long x, long y) {\n\t\tlong res = (x - y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\tstatic long mul(long x, long y) {\n\t\tlong res = (x * y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\tstatic long div(long x, long y) {\n\t\tlong res = x * pow(y, mod - 2) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\tstatic long pow(long x, long y) {\n\t\tif (y < 0)\n\t\t\treturn 0;\n\t\tif (y == 0)\n\t\t\treturn 1;\n\t\tif (y % 2 == 1)\n\t\t\treturn (x * pow(x, y - 1)) % mod;\n\t\tlong root = pow(x, y / 2);\n\t\treturn root * root % mod;\n\t}\n\tpublic static void main(String[] args) throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\t//input\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\tprivate static int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\tprivate static boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\tprivate static int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static char nc() {\n\t\treturn (char) skip();\n\t}\n\tprivate static String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tprivate static char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static long[] nla(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\t\n\t@SuppressWarnings(\"unused\")\n\tprivate static int[][] na(int n, int m){\n\t\tint[][] res = new int[n][m];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tfor(int j=0;j<m;j++) {\n\t\t\t\tres[i][j] = ni();\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t\n\t@SuppressWarnings(\"unused\")\n\tprivate static long[][] nla(int n, int m){\n\t\tlong[][] res = new long[n][m];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tfor(int j=0;j<m;j++) {\n\t\t\t\tres[i][j] = nl();\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t\n\t@SuppressWarnings(\"unused\")\n\tprivate static int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t@SuppressWarnings(\"unused\")\n\tprivate static long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define sz(x) ((int)(x.size()))\n\nint n, m, k;\nlong long a[3000][3000];\nlong long dp[3000][3000][4];\n\nlong long memo(int x, int y, int r) {\n\tif(x < 0 || y < 0) return 0;\n\tif(dp[x][y][r] != -1) return dp[x][y][r];\n\tlong long res = memo(x-1, y, 3);\n\tres = max(res, memo(x, y-1, r));\n\tif(r > 0) res = max(res, a[x][y] + max(memo(x, y-1, r-1), memo(x-1, y, 3)));\n\treturn dp[x][y][r] = res;\n}\n\nint main() {\n\tios::sync_with_stdio(0);\n\tcin.tie(0); cout.tie(0);\n\n\tcin >> n >> m >> k;\n\tfor(int i=0; i<k; i++) {\n\t\tint x, y, c;\n\t\tcin >> x >> y >> c;\n\t\ta[x-1][y-1] = c;\n\t}\n\tmemset(dp, -1, sizeof dp);\n\tcout << memo(n-1, m-1, 3) << endl;\n\n\treturn 0;\n}", "import sys\n\ninp = [int(x) for x in sys.stdin.read().split()]; ii = 0\nshift = int(10**9 + 1)\nrows, cols, k = inp[ii:ii+3]; ii += 3\nitems = [[] for _ in range(rows+1)]\nbest = [0]*(cols+1)\nfor _ in range(k):\n\tr, c, v = inp[ii:ii+3]; ii += 3\n\titems[r].append(c*shift+v)\nfor i in range(rows+1):\n\titems[i].sort()\nans = 0\nfor r in range(1, rows+1):\n\tdp = []\n\tbest1, best2 = 0, 0\n\tRow = items[r]\n\tfor X in Row:\n\t\tc, v = X//shift, X%shift\n\t\tv1 = best[c] + v\n\t\tv2 = best1 + v\n\t\tv3 = best2 + v\n\t\tV = v1\n\t\tif V < v2:\n\t\t\tV = v2\n\t\tif V < v3:\n\t\t\tV = v3\n\t\tdp.append(V)\n\t\tif v1 > best1:\n\t\t\tbest1 = v1\n\t\tif v2 > best2:\n\t\t\tbest2 = v2\n\t\tif ans < V:\n\t\t\tans = V\n\tfor j in range(len(dp)):\n\t\tc = Row[j]//shift\n\t\tif best[c] < dp[j]:\n\t\t\tbest[c] = dp[j]\n\tfor j in range(2, cols+1):\n\t\tif best[j] < best[j-1]:\n\t\t\tbest[j] = best[j-1]\nprint(ans)\n", "R, C, K = map(int, input().split())\n# = int(input())\np = []\nfor k in range(K):\n p.append(list(map(int, input().split())))\n\nmaps = [[0 for _ in range(C)] for _ in range(R)]\nfor k in range(K):\n maps[p[k][0]-1][p[k][1]-1] += p[k][2]\n\npoint1 = [[0 for _ in range(C)] for _ in range(R)]\npoint2 = [[0 for _ in range(C)] for _ in range(R)]\npoint3 = [[0 for _ in range(C)] for _ in range(R)]\n\npoint1[0][0] = maps[0][0]\n\nfor r in range(R):\n for c in range(C):\n a, b, d = point1[r][c], point2[r][c], point3[r][c] \n if c < C - 1:\n x = maps[r][c+1]\n point1[r][c+1] = max(point1[r][c+1], x, a)\n point2[r][c+1] = max(point2[r][c+1], a + x, b)\n point3[r][c+1] = max(point3[r][c+1], b + x, d)\n if r < R - 1:\n point1[r+1][c] = maps[r+1][c] + max(a, b, d)\n\n\nprint(max(point1[-1][-1], point2[-1][-1], point3[-1][-1]))", "import sys\ninput = sys.stdin.buffer.readline\n\nr, c, k = map(int, input().split())\nv = [[0]*(c+1) for i in range(r+1)]\nfor i in range(k):\n cr, cc, cv = map(int, input().split())\n v[cr][cc] = cv\n\ndp = [[0]*4 for _ in range(c+1)]\nlast = [[0]*4 for _ in range(c+1)]\nfor cr in range(1, r+1):\n for cc in range(1, c+1):\n upper = max(last[cc][0], last[cc][1], last[cc][2], last[cc][3])\n dp[cc][0] = max(upper, dp[cc-1][0], dp[cc][0])\n dp[cc][1] = max(dp[cc-1][1], dp[cc-1][0]+v[cr][cc], upper+v[cr][cc])\n dp[cc][2] = max(dp[cc-1][2], dp[cc-1][1]+v[cr][cc])\n dp[cc][3] = max(dp[cc-1][3], dp[cc-1][2]+v[cr][cc])\n last = dp\nprint(max(dp[c]))", "import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.stream.IntStream;\n\n/**\n * 解説通りに実装したソースコード\n */\npublic class Main {\n\n\t/** 一行で最大拾うアイテム数+1 */\n\tprivate static final int MAX = 4;\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint r = scanner.nextInt(), c = scanner.nextInt(), k = scanner.nextInt();\n\t\t\tlong[][] v = new long[r][c];\n\t\t\tIntStream.range(0, r).forEach(i -> Arrays.fill(v[i], 0L));\n\t\t\tIntStream.range(0, k).forEach(i -> v[scanner.nextInt() - 1][scanner.nextInt() - 1] = scanner.nextLong());\n\t\t\tlong[][][] dp = new long[MAX][r][c];\n\t\t\tdp[0][0][0] = 0L;\n\t\t\tdp[1][0][0] = v[0][0];\n\t\t\tIntStream.range(0, r).forEach(i -> IntStream.range(0, c).forEach(j -> {\n\t\t\t\tif (i > 0) {\n\t\t\t\t\tdp[0][i][j] = max(dp[0][i][j],\n\t\t\t\t\t\t\tIntStream.range(0, MAX).mapToLong(l -> dp[l][i - 1][j]).max().getAsLong());\n\t\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\t\tdp[1][i][j] = max(dp[1][i][j],\n\t\t\t\t\t\t\t\tIntStream.range(0, MAX).mapToLong(l -> dp[l][i - 1][j]).max().getAsLong() + v[i][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (j > 0) {\n\t\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\t\tIntStream.range(1, MAX).forEach(\n\t\t\t\t\t\t\t\tl -> dp[l][i][j] = max(dp[l][i][j], dp[l - 1][i][j - 1] + v[i][j], dp[l][i][j - 1]));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tIntStream.range(0, MAX).forEach(l -> dp[l][i][j] = max(dp[l][i][j], dp[l][i][j - 1]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}));\n\t\t\tSystem.out.println(IntStream.range(0, MAX).mapToLong(l -> dp[l][r - 1][c - 1]).max().getAsLong());\n\t\t}\n\t}\n\n\t/**\n\t * 複数のlongのmaxを取得する\n\t * \n\t * @param a 一つ目のlong\n\t * @param b 二つ目以降のlong\n\t * @return 複数のlongのmax\n\t */\n\tprivate static long max(long a, long... b) {\n\t\tlong result = a;\n\t\tfor (long l : b) {\n\t\t\tresult = Math.max(result, l);\n\t\t}\n\t\treturn result;\n\t}\n}\n", "// template for atcode\nimport java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport java.util.stream.Collectors;\n\npublic class Main {\n\n private static final int MOD = (int)1e9 + 7; //998244353;\n // private static final long INF = (long)1e17;\n private static final int INF = (int)1e9;\n\n\n public Main(FastScanner in, PrintWriter out) {\n int R = in.nextInt();\n int C = in.nextInt();\n int K = in.nextInt();\n int[][] A = new int[R + 1][C + 1];\n for (int i = 0; i < K; i++) {\n int r = in.nextInt();\n int c = in.nextInt();\n A[r][c] = in.nextInt();\n }\n // long[][][] dp = new long[R + 1][C + 1][4];\n long[][] dp = new long[C + 1][4];\n long[][] prev = new long[C + 1][4];\n for (int i = 1; i <= R; i++) {\n for (int j = 1; j <= C; j++) {\n Arrays.fill(dp[j], 0);\n for (int k = 0; k <= 3; k++) {\n dp[j][0] = max(dp[j][0], prev[j][k]);\n dp[j][k] = max(dp[j][k], dp[j-1][k]);\n }\n // if (A[i][j] > 0) {\n for (int k = 3; k > 0; k--) {\n dp[j][k] = max(dp[j][k], dp[j][k-1] + A[i][j]);\n }\n // }\n }\n long[][] tmp = dp;\n dp = prev;\n prev = tmp;\n }\n long res = Arrays.stream(prev[C]).max().orElse(0);\n out.println(res);\n }\n\n private int gcd(int a, int b) {\n while (true) {\n if (b == 0) return a;\n int tmp = a;\n a = b;\n b = tmp % b;\n }\n }\n\n private long gcd(long a, long b) {\n while (true) {\n if (b == 0) return a;\n long tmp = a;\n a = b;\n b = tmp % b;\n }\n }\n\n private long powm(long x, long p) {\n long res = 1;\n while (p > 0) {\n if (p % 2 == 1)\n res = res * x % MOD;\n x = x * x % MOD;\n p /= 2;\n }\n return res;\n }\n\n public static void main(String[] args) {\n PrintWriter out = new PrintWriter(System.out);\n // Scanner in = new Scanner(\n // new BufferedReader(new InputStreamReader(System.in)));\n FastScanner in = new FastScanner(System.in);\n\n Main sol = new Main(in, out);\n out.close();\n }\n}\n\n// Pair\nclass Pair<T extends Comparable<? super T>, U extends Comparable<? super U>> implements Comparable<Pair<T, U>> {\n T a;\n U b;\n Pair() { }\n Pair(T a, U b) {\n this.a = a;\n this.b = b;\n }\n\n @Override\n public String toString() { return \"(\"+a.toString()+\", \"+b.toString()+\")\"; }\n\n @Override\n public int hashCode() { return Objects.hash(a, b); }\n\n @Override\n public boolean equals(Object obj) {\n if(this == obj) return true;\n if(obj == null) return false;\n if(this.getClass() != obj.getClass()) return false;\n Pair that = (Pair) obj;\n if(this.a.getClass() != that.a.getClass()) return false;\n if(this.b.getClass() != that.b.getClass()) return false;\n if(!this.a.equals(that.a)) return false;\n if(!this.b.equals(that.b)) return false;\n return true;\n }\n\n @Override\n public int compareTo(Pair<T, U> that) {\n int c = (this.a).compareTo(that.a);\n if(c == 0) c = (this.b).compareTo(that.b);\n return c;\n }\n}\n\n\nclass FastScanner{\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream)\n {\n this.stream = stream;\n }\n\n int read()\n {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars){\n curChar = 0;\n try{\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c)\n {\n return c==' '||c=='\\n'||c=='\\r'||c=='\\t'||c==-1;\n }\n\n boolean isEndline(int c)\n {\n return c=='\\n'||c=='\\r'||c==-1;\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String next(){\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do{\n res.appendCodePoint(c);\n c = read();\n }while(!isSpaceChar(c));\n return res.toString();\n }\n\n String nextLine(){\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do{\n res.appendCodePoint(c);\n c = read();\n }while(!isEndline(c));\n return res.toString();\n }\n}\n", "R, C, K = map(int, input().split())\nitems = [[0]*C for _ in range(R)]\n\nfor i in range(K):\n r, c, v = map(int, input().split())\n items[r-1][c-1] = v\n\ndp = [[0]*4 for _ in range(C)]\n\nfor x in range(1, 4):\n dp[0][x] = items[0][0]\n for j in range(1, C):\n dp[j][x] = max(dp[j-1][x-1] + items[0][j], dp[j-1][x])\n\n#print(items)\n#print(dp)\n\nfor i in range(1, R):\n for j in range(C):\n for x in range(4):\n dp[j][x] = dp[j][3]\n for x in range(1, 4):\n dp[0][x] += items[i][0]\n for j in range(1, C):\n dp[j][x] = max(dp[j-1][x-1] + items[i][j], dp[j-1][x], dp[j][3] + items[i][j])\n #print(dp)\n\nprint(dp[-1][-1])", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing ll = long long;\nint h, w, k, vs[3005][3005], r, c, v;\nll dp[3005][3005][4];\ninline void chmax(ll &a, ll b){if(a<b) a=b;}\nint main(){\n\tscanf(\"%d%d%d\", &h, &w, &k);\n\trep(i,k){\n\t\tscanf(\"%d%d%d\", &r, &c, &v);\n\t\tvs[r-1][c-1] = v;\n\t}\n\tdp[0][0][1] = vs[0][0];\n\trep(i,h) rep(j,w){\n\t\tll m = 0;\n\t\trep(l,4){\n\t\t\tchmax(m, dp[i][j][l]);\n\t\t\tchmax(dp[i][j+1][l], dp[i][j][l]);\n\t\t\tif(l) chmax(dp[i][j+1][l], dp[i][j][l-1]+vs[i][j+1]);\n\t\t}\n\t\tdp[i+1][j][0] = m;\n\t\tdp[i+1][j][1] = m + vs[i+1][j];\n\t}\n\tll ans = 0;\n\trep(l,4) chmax(ans,dp[h-1][w-1][l]);\n\tprintf(\"%lld\\n\", ans);\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n int m = scan.nextInt();\n int kk = scan.nextInt();\n int[][] a = new int[n + 1][m + 1];\n for (int i = 1; i <= kk; i++) {\n int x = scan.nextInt();\n int y = scan.nextInt();\n int val = scan.nextInt();\n a[x][y] = val;\n }\n long[][][] dp = new long[2][m + 1][4];\n int x = 1;\n for (int i = 1; i <= n; i++) {\n int pre = 1 ^ x;\n for (int j = 1; j <= m; j++) {\n dp[x][j][0] = dp[pre][j][3];\n for (int k = 1; k <= 3; k++) {\n long tmp = dp[pre][j][3] + a[i][j];\n tmp = Math.max(tmp, dp[x][j - 1][k]);\n tmp = Math.max(tmp, dp[x][j - 1][k - 1] + a[i][j]);\n dp[x][j][k] = tmp;\n }\n }\n x = pre;\n }\n System.out.println(dp[1 ^ x][m][3]);\n }\n}\n", "def main():\n import sys\n from copy import deepcopy\n input = sys.stdin.readline\n R, C, K = [int(x) for x in input().strip().split()]\n G = [[0] * (C+1) for r in range(R+1)]\n for k in range(K):\n r, c, v = [int(x) for x in input().strip().split()]\n G[r][c] = v\n # for r in range(R+1):\n # print(G[r])\n ans = [[[0] * 4 for _ in range(C+1)] for _ in range(2)]\n for r in range(1, R+1):\n for c in range(1, C+1):\n ans[r%2][c][0] = max(ans[(r-1)%2][c][-1], ans[r%2][c-1][0])\n for i in range(1, 4):\n ans[r%2][c][i] = max(ans[(r-1)%2][c][3], ans[r%2][c-1][i], ans[(r-1)%2][c][3]+G[r][c], ans[r%2][c-1][i-1]+G[r][c])\n\n print(max(ans[R%2][-1]))\n\nif __name__ == '__main__':\n main()\n", "import sys\ninput = sys.stdin.readline\nR, L, K = map(int, input().split())\nV = [0]*(R*L)\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[(c-1)*R+(r-1)] = v\nA, B, C, D = [[0]*(R+1) for _ in range(4)]\nfor i in range(L):\n for j in range(R):\n A[j] = max(A[j-1],B[j-1],C[j-1],D[j-1])\n v = V[i*R+j]\n if v != 0:\n D[j], C[j], B[j] = max(C[j]+v,D[j]), max(B[j]+v,C[j]), max(A[j]+v,B[j])\nprint(max(A[-2],B[-2],C[-2],D[-2]))", "r,c,k = list(map(int, input().split()))\nimport copy\ndp=[[[0]*4 for _ in range(c)] for _ in range(2)]\n\n\nF = [[0]*c for _ in range(r)]\n\nfor _ in range(k):\n x,y,v = list(map(int, input().split()))\n x-=1\n y-=1\n F[x][y] = v\n \nfor nn in range(r):\n for j in range(c):\n i = 1\n val = F[nn][j]\n \n \n mxv = max(dp[i-1][j][0], dp[i-1][j][1], dp[i-1][j][2], dp[i-1][j][3],0)\n\n dp[i][j][3] = max(dp[i][j-1][3], dp[i][j-1][2] + val)\n dp[i][j][2] = max(dp[i][j-1][2], dp[i][j-1][1] + val)\n dp[i][j][1] = max(dp[i][j-1][1], dp[i][j-1][0] + val, mxv + val)\n dp[i][j][0] = mxv\n\n dp[0] = dp[1] \n dp[1] = [[0]*4 for _ in range(c)]\n\nbest = 0\n\n\nfor k in range(4):\n best = max(best, dp[0][c-1][k])\n \nprint(best)", "\n\nimport java.util.*;\nimport java.io.*;\nimport java.util.concurrent.*;\npublic class Main\n{\n\n static long[][][] dp = new long[3001][3001][4];\n static long[][] grid = new long[3001][3001];\n static int r,c,k,a,b;\n static long cc;\n public static void main(String[] args) throws IOException\n {\n Reader in = new Reader();\n r = in.nextInt();\n c = in.nextInt();\n k = in.nextInt();\n\n for (int i=0;i<=3000;i++){\n for(int j=0;j<=3000;j++){\n for(int k=0;k<=3;k++){\n dp[i][j][k] = -1;\n }\n }\n }\n for (int i=0;i<=3000;i++){\n for(int j=0;j<=3000;j++){\n grid[i][j] = 0;\n }\n }\n\n for(int i=0;i<k;i++){\n a = in.nextInt();\n b = in.nextInt();\n cc = in.nextLong();\n a--;\n b--;\n grid[a][b] = cc;\n }\n\n System.out.println(rec(0,0,0));\n }\n\n static long rec(int i,int j,int taken){\n\n if(i==r || j==c)\n return 0;\n if(dp[i][j][taken]!=-1)\n return dp[i][j][taken];\n long temp1 = 0;\n\n if(taken<3){\n temp1 = grid[i][j]+Math.max(rec(i+1,j,0),rec(i,j+1,taken+1));\n }\n long temp2 = Math.max(rec(i+1,j,0),rec(i,j+1,taken));\n dp[i][j][taken] = Math.max(temp1,temp2);\n return dp[i][j][taken];\n }\n\n static class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader()\n {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException\n {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException\n {\n byte[] buf = new byte[64]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1)\n {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException\n {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do\n {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define chmax(x, y) x = max(x, y)\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main(){\n ll R, C, k;\n cin >> R >> C >> k;\n rep(i, k){\n int r, c, v;\n cin >> r >> c >> v;\n a[r-1][c-1] = v;\n }\n rep(i, R) rep(j, C){\n for (int k=2; k>=0; k--){\n chmax(dp[i][j][k+1], dp[i][j][k]+a[i][j]);\n }\n rep(k, 4){\n chmax(dp[i+1][j][0], dp[i][j][k]);\n chmax(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n ll ans = 0;\n rep(k, 4) chmax(ans, dp[R-1][C-1][k]);\n cout << ans << endl;\n return 0;\n}\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.lang.reflect.Field;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\nimport java.util.function.IntUnaryOperator;\nimport java.util.function.LongBinaryOperator;\nimport java.util.function.LongUnaryOperator;\n\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Field f = System.out.getClass().getDeclaredField(\"autoFlush\");\n f.setAccessible(true);\n f.set(System.out, false);\n execute(System.in, System.out);\n }\n\n public static void execute(InputStream in, OutputStream out) {\n ExtendedScanner s = new ExtendedScanner(in);\n Out o = new Out(out);\n solve(s, o);\n o.flush();\n o.close();\n }\n\n public static void solve(ExtendedScanner sc, Out out) {\n int r = sc.nextInt();\n int c = sc.nextInt();\n int k = sc.nextInt();\n long[][] g = new long[r + 1][c + 1];\n for (int i = 0; i < k; i++) g[sc.nextInt()][sc.nextInt()] = sc.nextLong();\n long[][][] dp = new long[4][r + 1][c + 1];\n for (int i = 1; i <= r; i++) {\n for (int x = 1; x <= 3; x++) {\n for (int j = 1; j <= c; j++) {\n dp[x][i][j] = Longs.max(dp[x - 1][i][j - 1] + g[i][j], dp[x][i][j - 1]);\n if (x == 1) {\n dp[x][i][j] = Longs.max(dp[x][i][j], g[i][j] + Longs.max(dp[1][i - 1][j], dp[2][i - 1][j], dp[3][i - 1][j]));\n }\n }\n }\n }\n long ans = Longs.max(dp[1][r][c], dp[2][r][c], dp[3][r][c]);\n out.writeln(ans);\n }\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nclass BasicScanner {\n private final InputStream in;\n private final byte[] buf = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public BasicScanner(InputStream in) {this.in = in;}\n private boolean hasNextByte() {\n if (ptr < buflen) return true;\n ptr = 0;\n try {buflen = in.read(buf);}\n catch (final IOException e) {e.printStackTrace();}\n return buflen > 0;\n }\n private int readByte() {return hasNextByte() ? buf[ptr++] : -1;}\n public boolean hasNext() {\n while (hasNextByte() && !(33 <= buf[ptr] && buf[ptr] <= 126)) ptr++;\n return hasNextByte();\n }\n private StringBuilder nextSequence() {\n if (!hasNext()) throw new NoSuchElementException();\n final StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (33 <= b && b <= 126) {sb.appendCodePoint(b); b = readByte();}\n return sb;\n }\n public char nextChar() {\n return (char) readByte();\n }\n public String next() {\n return nextSequence().toString();\n }\n public String next(int len) {\n return new String(nextChars(len));\n }\n public char[] nextChars() {\n final StringBuilder sb = nextSequence();\n int l = sb.length();\n char[] dst = new char[l];\n sb.getChars(0, l, dst, 0);\n return dst;\n }\n public char[] nextChars(int len) {\n if (!hasNext()) throw new NoSuchElementException();\n char[] s = new char[len];\n int i = 0;\n int b = readByte();\n while (33 <= b && b <= 126 && i < len) {s[i++] = (char) b; b = readByte();}\n if (i != len) throw new NoSuchElementException(String.format(\"length %d is longer than the sequence.\", len));\n return s;\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {minus = true; b = readByte();}\n if (b < '0' || '9' < b) throw new NumberFormatException();\n while (true) {\n if ('0' <= b && b <= '9') n = n * 10 + b - '0';\n else if (b == -1 || !(33 <= b && b <= 126)) return minus ? -n : n;\n else throw new NumberFormatException();\n b = readByte();\n }\n }\n public int nextInt() {return Math.toIntExact(nextLong());}\n public double nextDouble() {return Double.parseDouble(next());}\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nclass Out {\n private final OutputStream out;\n private byte[] buf = new byte[1024];\n private int ptr = 0;\n private static final int AUTO_FLUSH_THRETHOLD = 1 << 17;\n\n public Out(OutputStream out) {\n this.out = out;\n }\n\n public void flush() {\n try {\n out.write(buf, 0, ptr);\n out.flush();\n ptr = 0;\n } catch (IOException e) {e.printStackTrace();}\n }\n\n public void close() {\n try {out.close();} catch (IOException e) {e.printStackTrace();}\n }\n\n public Out writeln() {return write('\\n');}\n public Out writeln(Object o) {return write(o).write('\\n');}\n public Out writeln(String s) {return write(s).write('\\n');}\n public Out writeln(char[] c) {return write(c).write('\\n');}\n public Out writeln(char c) {return write(c).write('\\n');}\n public Out writeln(byte b) {return write(b).write('\\n');}\n public Out writeln(int x) {return write(x).write('\\n');}\n public Out writeln(long x) {return write(x).write('\\n');}\n public Out writeln(double d) {return write(d).write('\\n');}\n\n public Out writeSpace() {return write(' ');}\n \n public Out write(Object o) {\n return write(o.toString());\n }\n\n public Out write(String s) {\n try {\n Field strValueField = s.getClass().getDeclaredField(\"value\");\n strValueField.setAccessible(true);\n byte[] b = (byte[]) strValueField.get(s);\n int l = s.length();\n if (l > AUTO_FLUSH_THRETHOLD) {\n flush();\n int i = 0;\n while (i + AUTO_FLUSH_THRETHOLD < l) {\n out.write(b, i, AUTO_FLUSH_THRETHOLD);\n out.flush();\n i += AUTO_FLUSH_THRETHOLD;\n }\n ensureCapacity(l - i);\n System.arraycopy(b, i, buf, 0, l - i);\n ptr = l - i;\n } else {\n ensureCapacity(ptr + l);\n System.arraycopy(b, 0, buf, ptr, l);\n ptr += l;\n }\n } catch (Exception e) {e.printStackTrace();}\n return this;\n }\n\n public Out write(char[] c) {\n int l = c.length;\n if (l > AUTO_FLUSH_THRETHOLD) {\n flush();\n ensureCapacity(AUTO_FLUSH_THRETHOLD);\n int i = 0;\n while (i + AUTO_FLUSH_THRETHOLD < l) {\n for (int j = 0; j < AUTO_FLUSH_THRETHOLD; j++) {\n buf[ptr++] = (byte) c[i + j];\n }\n flush();\n i += AUTO_FLUSH_THRETHOLD;\n }\n for (; i < l; i++) {\n buf[ptr++] = (byte) c[i];\n }\n } else {\n ensureCapacity(ptr + l);\n for (char ch : c) buf[ptr++] = (byte) ch;\n }\n return this;\n }\n\n public Out write(char c) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = (byte) c;\n return this;\n }\n\n public Out write(byte b) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = b;\n return this;\n }\n\n public Out write(int x) {\n if (x == 0) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = '0';\n return this;\n }\n int d = stringSize(x);\n ensureCapacity(ptr + d);\n if (x < 0) {\n buf[ptr++] = '-';\n x = -x;\n d--;\n }\n int j = ptr + d; \n while (x > 0) {\n buf[--j] = (byte) ('0' + (x % 10));\n x /= 10;\n }\n ptr += d;\n return this;\n }\n\n public Out write(long x) {\n if (x == 0) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = '0';\n return this;\n }\n int d = stringSize(x);\n ensureCapacity(ptr + d);\n if (x < 0) {\n buf[ptr++] = '-';\n x = -x;\n d--;\n }\n int j = ptr + d; \n while (x > 0) {\n buf[--j] = (byte) ('0' + (x % 10));\n x /= 10;\n }\n ptr += d;\n return this;\n }\n\n public Out write(double d) {\n return write(Double.toString(d));\n }\n\n private void ensureCapacity(int cap) {\n if (cap > AUTO_FLUSH_THRETHOLD) {\n flush();\n }\n if (cap >= buf.length) {\n int newLength = buf.length;\n while (newLength < cap) newLength <<= 1;\n byte[] newBuf = new byte[newLength];\n System.arraycopy(buf, 0, newBuf, 0, buf.length);\n buf = newBuf;\n }\n }\n private static int stringSize(long x) {\n int d = 1;\n if (x >= 0) {d = 0; x = -x;}\n long p = -10;\n for (int i = 1; i < 19; i++, p *= 10) if (x > p) return i + d;\n return 19 + d;\n }\n private static int stringSize(int x) {\n int d = 1;\n if (x >= 0) {d = 0; x = -x;}\n int p = -10;\n for (int i = 1; i < 10; i++, p *= 10) if (x > p) return i + d;\n return 10 + d;\n }\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nfinal class ExtendedScanner extends BasicScanner {\n public ExtendedScanner(InputStream in) {super(in);}\n public int[] ints(final int n) {\n final int[] a = new int[n];\n Arrays.setAll(a, $ -> nextInt());\n return a;\n }\n public int[] ints(final int n, final IntUnaryOperator f) {\n final int[] a = new int[n];\n Arrays.setAll(a, $ -> f.applyAsInt(nextInt()));\n return a;\n }\n public int[][] ints(final int n, final int m) {\n final int[][] a = new int[n][];\n Arrays.setAll(a, $ -> ints(m));\n return a;\n }\n public int[][] ints(final int n, final int m, final IntUnaryOperator f) {\n final int[][] a = new int[n][];\n Arrays.setAll(a, $ -> ints(m, f));\n return a;\n }\n public long[] longs(final int n) {\n final long[] a = new long[n];\n Arrays.setAll(a, $ -> nextLong());\n return a;\n }\n public long[] longs(final int n, final LongUnaryOperator f) {\n final long[] a = new long[n];\n Arrays.setAll(a, $ -> f.applyAsLong(nextLong()));\n return a;\n }\n public long[][] longs(final int n, final int m) {\n final long[][] a = new long[n][];\n Arrays.setAll(a, $ -> longs(m));\n return a;\n }\n public long[][] longs(final int n, final int m, final LongUnaryOperator f) {\n final long[][] a = new long[n][];\n Arrays.setAll(a, $ -> longs(m, f));\n return a;\n }\n public char[][] charArrays(final int n) {\n final char[][] c = new char[n][];\n Arrays.setAll(c, $ -> nextChars());\n return c;\n }\n public char[][] charArrays(final int n, final int m) {\n final char[][] c = new char[n][];\n Arrays.setAll(c, $ -> nextChars(m));\n return c;\n }\n public double[] doubles(final int n) {\n final double[] a = new double[n];\n Arrays.setAll(a, $ -> nextDouble());\n return a;\n }\n public double[][] doubles(final int n, final int m) {\n final double[][] a = new double[n][];\n Arrays.setAll(a, $ -> doubles(m));\n return a;\n }\n public String[] strings(final int n) {\n final String[] s = new String[n];\n Arrays.setAll(s, $ -> next());\n return s;\n }\n public String[] strings(final int n, final int m) {\n final String[] s = new String[n];\n Arrays.setAll(s, $ -> next(m));\n return s;\n }\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nfinal class Longs {\n private Longs(){}\n public static long max(long a, long b) {\n return Math.max(a, b);\n }\n public static long max(long a, long b, long c) {\n return Math.max(Math.max(a, b), c);\n }\n public static long max(long a, long b, long c, long d) {\n return Math.max(Math.max(Math.max(a, b), c), d);\n }\n public static long max(long a, long b, long c, long d, long e) {\n return Math.max(Math.max(Math.max(Math.max(a, b), c), d), e);\n }\n public static long max(long a, long b, long c, long d, long e, long f) {\n return Math.max(Math.max(Math.max(Math.max(Math.max(a, b), c), d), e), f);\n }\n public static long max(long a, long b, long c, long d, long e, long f, long g) {\n return Math.max(Math.max(Math.max(Math.max(Math.max(Math.max(a, b), c), d), e), f), g);\n }\n public static long max(long a, long b, long c, long d, long e, long f, long g, long h) {\n return Math.max(Math.max(Math.max(Math.max(Math.max(Math.max(Math.max(a, b), c), d), e), f), g), h);\n }\n public static long max(long a, long... vals) {\n long ret = a; for (long e : vals) ret = Math.max(ret, e);\n return ret;\n }\n public static long min(long a, long b) {\n return Math.min(a, b);\n }\n public static long min(long a, long b, long c) {\n return Math.min(Math.min(a, b), c);\n }\n public static long min(long a, long b, long c, long d) {\n return Math.min(Math.min(Math.min(a, b), c), d);\n }\n public static long min(long a, long b, long c, long d, long e) {\n return Math.min(Math.min(Math.min(Math.min(a, b), c), d), e);\n }\n public static long min(long a, long b, long c, long d, long e, long f) {\n return Math.min(Math.min(Math.min(Math.min(Math.min(a, b), c), d), e), f);\n }\n public static long min(long a, long b, long c, long d, long e, long f, long g) {\n return Math.min(Math.min(Math.min(Math.min(Math.min(Math.min(a, b), c), d), e), f), g);\n }\n public static long min(long a, long b, long c, long d, long e, long f, long g, long h) {\n return Math.min(Math.min(Math.min(Math.min(Math.min(Math.min(Math.min(a, b), c), d), e), f), g), h);\n }\n public static long min(long a, long... vals) {\n long ret = a; for (long e : vals) ret = Math.min(ret, e);\n return ret;\n }\n public static long fold(final LongBinaryOperator func, final long... a) {\n long ret = a[0]; for (int i = 1; i < a.length; i++) ret = func.applyAsLong(ret, a[i]);\n return ret;\n }\n public static boolean isPowerOfTwo(final long n) {return n != 0 && (-n & n) == n;}\n public static int ceilExponent(final long n) {return 63 - Long.numberOfLeadingZeros(n) + (isPowerOfTwo(n) ? 0 : 1);}\n public static int floorExponent(final long n) {return 63 - Long.numberOfLeadingZeros(n) + (n == 0 ? 1 : 0);}\n public static int ceilExponent(final long n, final int base) {\n if (base == 2) return ceilExponent(n);\n int i = 0;\n long m = 1;\n while (m < n) {\n i++;\n final long r = m * base;\n if ((m | base) >> 31 != 0 && r / base != m) break;\n m = r;\n }\n return i;\n }\n /**\n * Caluculate the ceil of a/b. Returns the smallest integer greater than or\n * equal to a/b while 'a/b' rounds fractional parts to ZERO.\n * @param a\n * @param b\n * @return the smallest integer greater than or equal to a/b\n */\n public static long cld(final long a, final long b) {\n if (a > 0 && b > 0) return (a + b - 1) / b;\n if (a < 0 && b < 0) return (a + b + 1) / b;\n return a / b;\n }\n\n /**\n * Caluculate the floor of a/b. Returns the largest integer less than or equal\n * to a/b while 'a/b' rounds fractional parts to ZERO.\n * @param a\n * @param b\n * @return the largest integer less than or equal to a/b\n */\n public static long fld(final long a, final long b) {\n if (a <= 0 && b > 0) return (a - b + 1) / b;\n if (a > 0 && b <= 0) return (a - b - 1) / b;\n return a / b;\n }\n public static String join(final String sep, final long... a) {\n final StringBuilder sb = new StringBuilder();\n for (int i = 0; i < a.length; i++) {\n sb.append(a[i]);\n if (i < a.length - 1) sb.append(sep);\n }\n return sb.toString();\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long dp[3005][3005][4];\nlong long item[3005][3005];\n\nint main() {\n int r, c, k;\n cin >> r >> c >> k;\n for ( int i = 0; i < k; i++ ) {\n int ri, ci;\n long long vi;\n cin >> ri >> ci >> vi;\n item[ri][ci] = vi;\n }\n\n for ( int i = 1; i <= r; i++ ) {\n for ( int j = 1; j <= c; j++ ) {\n for ( int l = 3; l > 0; l-- ) {\n dp[i][j][l] = max(dp[i][j][l], dp[i][j][l-1]+item[i][j]);\n }\n for ( int l = 0; l < 4; l++ ) {\n dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][l]);\n dp[i][j+1][l] = max(dp[i][j+1][l], dp[i][j][l]);\n }\n }\n }\n\n long long ans = 0;\n for ( int l = 0; l < 4; l++ ) {\n ans = max(ans, dp[r][c][l]);\n }\n cout << ans << endl;;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define chmax(x,y) x = max(x,y)\n\nint a[3005][3005];\nll dp[3005][3005][4];\n \nint main() {\n int R, C, n;\n cin >> R >> C >> n;\n rep(i,n) {\n int r, c, v;\n cin >> r >> c >> v;\n a[r-1][c-1] = v;\n }\n \n rep(i,R)rep(j,C) {\n for (int k = 2; k >= 0; k--) {\n chmax(dp[i][j][k+1], dp[i][j][k]+a[i][j]);\n }\n rep(k,4) {\n chmax(dp[i+1][j][0], dp[i][j][k]);\n chmax(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n \n ll ans = 0;\n rep(k,4) chmax(ans, dp[R-1][C-1][k]);\n cout << ans << endl;\n return 0;\n}", "R,C,K=map(int,input().split())\nl=[[0] * C for i in range(R)]\nfor i in range(K):\n a,b,c=map(int,input().split())\n a-=1\n b-=1\n l[a][b]=c\ndp=[[0] * C for i in range(R)]\nfor i in range(R):\n kdp=[0]*4\n for j in range(C):\n if i>0:\n kdp[0]=max(kdp[0],dp[i-1][j])\n for k in range(2,-1,-1):\n kdp[k+1]=max(kdp[k+1],kdp[k]+l[i][j])\n dp[i][j]=max(dp[i][j],kdp[k+1])\nprint(dp[R-1][C-1])", "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int N = 3005;\nint n, m, k, a[N][N];\nlong long dp[N][N][4];\nlong long yo(int i, int j, int k) {\n\tif (i > n || j > m) return 0;\n\tlong long &ret = dp[i][j][k];\n\tif (ret != -1) return ret;\n\tlong long ans = yo(i + 1, j, 0) + (k < 3 ? a[i][j] : 0);\n\tif (k < 3) ans = max(ans, yo(i, j + 1, k + 1) + a[i][j]);\n\tans = max(ans, yo(i, j + 1, k));\n\treturn ret = ans;\n}\nint32_t main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tcin >> n >> m >> k;\n\tfor (int i = 1; i <= k; i++) {\n\t\tint r, c, x; cin >> r >> c >> x;\n\t\ta[r][c] = x;\n\t}\n\tmemset(dp, -1, sizeof dp);\n\tcout << yo(1, 1, 0) << '\\n';\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntemplate<typename T>\nvoid chmax(T &a,T b){\n if(a<b)a=b;\n}\nint R,C,K,r,c,v,d[3123][3123],memo[3123][3123][5];\nint f(int y,int x,int cnt){\n if(cnt<0||y<0||x<0)return -1e18;\n if(~memo[y][x][cnt])return memo[y][x][cnt];\n int res=f(y,x,cnt-1);\n chmax(res,f(y-1,x,3));\n if(cnt)chmax(res,f(y-1,x,3)+d[y][x]);\n chmax(res,f(y,x-1,cnt));\n chmax(res,f(y,x-1,cnt-1)+d[y][x]);\n return memo[y][x][cnt]=res;\n}\n\nsigned main(){\n memset(memo,-1,sizeof(memo));\n memo[0][0][0]=0;\n cin>>R>>C>>K;\n while(K--){\n cin>>r>>c>>v;\n d[r][c]=v;\n }\n cout<<f(R+1,C+1,0)<<endl;\n}\n", "R, L, K = map(int, input().split())\nV = [[0]*R for _ in range(L)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[c-1][r-1] = v\nA, B, C, D = [[0]*(R+1) for _ in range(4)]\nfor i in range(L):\n for j in range(R):\n A[j] = max(A[j-1], B[j-1], C[j-1], D[j-1])\n v = V[i][j]\n if v != 0:\n D[j], C[j], B[j] = max(C[j] + v, D[j]), max(B[j] + v, C[j]), max(A[j] + v, B[j])\n\nprint(max(A[-2], B[-2], C[-2], D[-2]))", "# -*- coding: utf-8 -*-\nimport sys \nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nR, C, K = map(int, readline().split())\ndata = [[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r,c,k = map(int,readline().split())\n data[r][c] = k\n \ndp = [0]*(C+1)\n\nfor i in range(1,R+1):\n di = data[i]\n ndp = [0]*(C+1)\n kdp = [0]*4\n for j in range(1,C+1):\n kdp[0] = max(kdp[0],dp[j])\n for k in range(2,-1,-1):\n kdp[k+1] = max(kdp[k+1],kdp[k]+di[j])\n ndp[j] = max(kdp)\n dp = ndp\nprint(dp[C])", "# -*- coding: utf-8 -*-\n\nR,C,K = map(int, input().split())\n\nitems = [[0 for _ in range(C+1)] for _ in range(R+1)]\nfor i in range(K):\n r,c,v = map(int, input().split())\n items[r][c] = v\n\nDP_prev = [0 for _ in range(C+1)]\nfor r in range(1,R+1):\n DP1 = [0 for _ in range(C+1)]\n DP2 = [0 for _ in range(C+1)]\n DP3 = [0 for _ in range(C+1)]\n for c in range(1,C+1):\n item = items[r][c]\n DP1[c] = max(DP_prev[c]+item,DP1[c-1])\n DP2[c] = max(DP1[c],DP2[c-1],DP1[c-1]+item)\n DP3[c] = max(DP2[c],DP3[c-1],DP2[c-1]+item)\n DP_prev = DP3\n \nprint(DP_prev[C])", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tvar sc = new Scanner(System.in);\n\t\tvar r = sc.nextInt();\n\t\tvar c = sc.nextInt();\n\t\tvar k = sc.nextInt();\n\t\tvar v = new long[r][c];\n\t\tfor (var i = 0; i < k; i++) {\n\t\t\tv[sc.nextInt() - 1][sc.nextInt() - 1] = sc.nextInt();\n\t\t}\n\t\tsc.close();\n\n\t\tfor (var i = 0; i < r; i++) {\n\t\t\tvar rv = new long[c][5];\n\t\t\tfor (var j = 0; j < c; j++) {\n\t\t\t\tvar cv = v[i][j];\n\t\t\t\tfor (var ic = 0; ic < 4; ic++) {\n\t\t\t\t\tvar rv1 = (i > 0 ? v[i - 1][j] : 0);\n\t\t\t\t\tvar rv2 = (j > 0 ? rv[j - 1][ic] : 0);\n\t\t\t\t\tvar rv3 = (j > 0 ? rv[j - 1][ic + 1] : 0);\n\t\t\t\t\tif (cv > 0) {\n\t\t\t\t\t\tif (ic == 0) {\n\t\t\t\t\t\t\trv[j][ic + 1] = Math.max(Math.max(rv1 + cv, rv2 + cv), rv3);\n\t\t\t\t\t\t} else if (rv2 > 0) {\n\t\t\t\t\t\t\trv[j][ic + 1] = Math.max(rv2 + cv, rv3);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (ic == 0) {\n\t\t\t\t\t\t\trv[j][ic] = Math.max(rv1, rv2);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\trv[j][ic] = rv2;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tv[i][j] = Math.max(Math.max(Math.max(rv[j][0], rv[j][1]), rv[j][2]), rv[j][3]);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(v[r - 1][c - 1]);\n\t}\n}\n", "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n public static void main(final String[] args) {\n final FastScanner scanner = new FastScanner(System.in);\n final int r = scanner.nextInt();\n final int c = scanner.nextInt();\n final int k = scanner.nextInt();\n\n final int[][] values = new int[r + 1][c + 1];\n for (int i = 0; i < k; i++) {\n final int x = scanner.nextInt();\n final int y = scanner.nextInt();\n final int v = scanner.nextInt();\n values[x][y] = v;\n }\n\n final long[][][] dp = new long[r + 1][c + 1][4];\n for (int i = 1; i <= r; i++) {\n for (int j = 1; j <= c; j++) {\n final int aboveValue = values[i - 1][j];\n final int leftValue = values[i][j - 1];\n final long maxAbove = max(dp[i - 1][j][0], dp[i - 1][j][1], dp[i - 1][j][2]);\n dp[i][j][0] = max(dp[i][j - 1][0], maxAbove + aboveValue, dp[i - 1][j][3]);\n dp[i][j][1] = max(dp[i][j - 1][0] + leftValue, dp[i][j - 1][1]);\n dp[i][j][2] = max(dp[i][j - 1][1] + leftValue, dp[i][j - 1][2]);\n dp[i][j][3] = max(dp[i][j - 1][2] + leftValue, dp[i][j - 1][3]);\n }\n }\n\n System.out.println(max(dp[r][c][0]+values[r][c], dp[r][c][1]+values[r][c], dp[r][c][2]+values[r][c], dp[r][c][3]));\n }\n\n private static long max(final long... values) {\n Arrays.sort(values);\n return values[values.length - 1];\n }\n\n private static class FastScanner {\n private final BufferedReader reader;\n private StringTokenizer tokenizer;\n\n FastScanner(final InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (final IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n }\n}\n ", "# -*- coding: utf-8 -*-\nimport sys\nfrom collections import defaultdict\nR,C,K=map(int, sys.stdin.readline().split())\n\nvalue=defaultdict(lambda: 0)\nvalue=[ [0 for _ in range(C+1)] for __ in range(R+1) ]\nfor _ in range(K):\n r,c,v=map(int, sys.stdin.readline().split())\n value[r][c]=v\n\ndp0=[0]*(C+1)\ndp1=[0]*(C+1)\ndp2=[0]*(C+1)\ndp3=[0]*(C+1)\n\nfor r in range(1,R+1):\n for c in range(1,C+1):\n #今のマスにアイテムがある場合\n if 0<value[r][c]:\n dp3[c]=max( dp3[c-1], dp2[c-1]+value[r][c] )\n dp2[c]=max( dp2[c-1], dp1[c-1]+value[r][c] )\n dp1[c]=max( dp1[c-1], dp0[c-1]+value[r][c], dp0[c]+value[r][c] )\n dp0[c]=max( dp0[c-1], dp0[c] )\n #今のマスにアイテムがない場合\n else:\n dp0[c]=max( dp0[c-1], dp0[c] )\n dp1[c]=max( dp1[c-1], dp1[c] )\n dp2[c]=max( dp2[c-1], dp2[c] )\n dp3[c]=max( dp3[c-1], dp3[c] )\n\n #上の行にアイテムをコピー\n for c in range(1,C+1):\n dp0[c]=max( dp0[c], dp1[c], dp2[c], dp3[c] )\n dp1=[0]*(C+1)\n dp2=[0]*(C+1)\n dp3=[0]*(C+1)\n\nprint dp0[C]\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint r, c, k;\nint grid[3005][3005];\n\nlong long memo[3005][3005][5];\nlong long dp(int i, int j, int rem) {\n\tif (memo[i][j][rem] != -1) return memo[i][j][rem];\n\tlong long cur = 0;\n\tif (rem == 0) {\n if (i <= r) return memo[i][j][rem] = dp(i + 1, j, 3);\n else return 0;\n\t}\n\tif (j <= c) cur = max(dp(i, j + 1, rem), dp(i, j + 1, rem - 1) + grid[i][j]);\n\tif (i <= r) cur = max(cur, dp(i + 1, j, 3) + grid[i][j]);\n\treturn memo[i][j][rem] = cur;\n}\n\nint main() {\n\tscanf(\"%d%d%d\", &r, &c, &k);\n\tfor (int i = 0; i < k; i++) {\n\t\tint r1, c1, v1; scanf(\"%d%d%d\", &r1, &c1, &v1);\n\t\tgrid[r1][c1] = v1;\n\t}\n\tmemset(memo, -1, sizeof memo);\n\tprintf(\"%lld\\n\", dp(1, 1, 3));\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\ntypedef long long ll;\nusing namespace std;\nint main(void){\n int R,C,K; cin>>R>>C>>K;\n vector<vector<ll>> rcv(R+1,vector<ll>(C+1,0));\n for(int i=0; i<K; ++i){ int r,c; cin>>r>>c; cin>>rcv[r][c];}\n vector<vector<vector<ll>>> dp(R+2,vector<vector<ll>>(C+2,vector<ll>(4,0)));\n for(int i=1; i<=R; ++i) for(int j=1; j<=C; ++j){\n for(int k=3; k>0; --k) dp[i][j][k]=max(dp[i][j][k],dp[i][j][k-1]+rcv[i][j]);\n for(int k=0; k<4; ++k){\n dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n cout<<dp[R+1][C][0];\n return 0;\n}\n", "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n\t\npublic class Main {\n static class Graph0n {\n private ArrayList<Node0n> dt = new ArrayList<>();\n Graph0n(int sz){for(int i=0; i<sz; i++){Node0n node1 = new Node0n();dt.add(node1);}}\n public void add(int vn, int val){ dt.get(vn).add(val); }\n public void add2(int vn, int val){ dt.get(vn).add(val);dt.get(val).add(vn);}\n public int get(int vn, int index){ return dt.get(vn).get(index); }\n public ArrayList<Integer> get(int vn){ return dt.get(vn).getAll(); }\n public int size(){ return dt.size(); }\n public int sizeOf(int vn){ return dt.get(vn).size(); }\n public void clear(){ for(int i=0; i<dt.size(); i++){ dt.get(i).clear(); } }\n public void clear(int i){ dt.get(i).clear(); }\n public static Graph0n make_tree(int vn, FastScanner sc){\n \tGraph0n tree = new Graph0n(vn);\n \tfor(int i=1; i<vn; i++){\n \t int s1 = sc.nexI()-1;\n \t int g1 = sc.nexI()-1;\n \t tree.add2(s1,g1);\n \t}\n \treturn tree;\n }\n private void add_Vertex(Node0n vnew){\n dt.add(vnew);\n }\n }\n static class Node0n { //重みなし無向・有向グラフの頂点\n private ArrayList<Integer> next_vs = new ArrayList<>();\n public void add(int val){ next_vs.add(val); }\n public int get(int ad){ return next_vs.get(ad); }\n public ArrayList<Integer> getAll(){ return next_vs; }\n public int size(){ return next_vs.size(); }\n public void clear(){ next_vs.clear(); }\n public void addAll(Node0n vnew){ this.next_vs.addAll(vnew.next_vs); }\n }\n\n static class Edge {\n int from=-1, v2=-1; long weight;\n public Edge(int vn, long w){\n this.v2 = vn;\n this.weight = w;\n }\n public Edge(int cm, int vn, long w){\n this.from = cm;\n this.v2 = vn;\n this.weight = w;\n }\n }\n static class Edge2 {\n int v2; long cost1,cost2;\n public Edge2(int vn, long w1, long w2){\n this.v2 = vn;\n this.cost1 = w1;\n this.cost2 = w2;\n }\n }\n\n static class Comparator_Edge implements Comparator<Edge>{ //今は小さいのが前に出てくる\n public int compare(Edge a, Edge b){\n if(a.weight>b.weight) return 1;\n else if(a.weight<b.weight) return -1;\n else return a.v2-b.v2;\n }\n }\n \n static class Vector {\n int x,y;\n public Vector(int sx, int sy){\n this.x=sx;\n this.y=sy;\n }\n }\n \n \n //私が好きなアルゴリズム::累積和・UF木\n //PriorityQueueは拡張for文で出すとsortされてない順番で出てくるよ\n //longのbit演算は1L<<posに注意\n //long long\n //JOIはMLEが厳しい shortというものがあるよ。あと、ArrayListはオートボクシングが遅いから、自作listが早いよ\n\tpublic static void main(String[] args) throws Exception {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t\n\t\tint r = sc.nexI();\n\t\tint c = sc.nexI();\n\t\tint nitem = sc.nexI();\n\t\t\n\t\tlong[][] vals = new long[r][c];\n\t\tfill(vals,0);\n\t\t\n\t\tfor(int i=0; i<nitem; i++){\n\t\t int r1 = sc.nexI()-1;\n\t\t int c1 = sc.nexI()-1;\n\t\t vals[r1][c1] = sc.nexL();\n\t\t}\n\t\t\n\t\tlong[][][] dp = new long[r+1][c+1][4]; //r行c列目にいて、k個拾った時のmax(val)\n\t\tfill(dp,0);\n\t\tlong[][] dp2 = new long[r+1][c+1]; //r行c列目にいて、時のmax(val)\n\t\tfill(dp2,0);\n\t\t\n\t\tfor(int i=0; i<r; i++){\n\t\t for(int j=0; j<c; j++){\n\t dp[i+1][j+1][0] = dp2[i][j+1];\n\t\t dp[i+1][j+1][1] = dp[i+1][j+1][0]+vals[i][j]; //隣の行からくるなら拾うべき\n\t\t for(int k=0; k<4; k++){\n\t\t dp[i+1][j+1][k] = max(dp[i+1][j+1][k], dp[i+1][j][k]); //拾わない\n\t\t if(k>0) dp[i+1][j+1][k] = max(dp[i+1][j+1][k], dp[i+1][j][k-1]+vals[i][j]);\n\t\t dp2[i+1][j+1] = max(dp2[i+1][j+1], dp[i+1][j+1][k]);\n\t\t }\n\t\t }\n\t\t}\n\t\t/*\n\t\tfor(int i=0; i<=r; i++){\n\t\t for(int j=0; j<=c; j++){\n\t\t for(int k=0; k<4; k++){\n\t\t out.print(dp[i][j][k]+\"/\");\n\t\t }\n\t\t out.print(\" \");\n\t\t }\n\t\t out.println();\n\t\t}\n\t\t*/\n\t\tout.println(dp2[r][c]);\n\t\t\n\t\tout.flush();\n\t}\n\t\n\tprivate static int INF = (int)1e8;\n\tprivate static long INFL = (long)1e17;\n\tprivate static long e97 = (long)1e9 + 7;\n\t\n\tprivate static void assertion(boolean b) { if(!b) throw new AssertionError(); }\n\n\tprivate static int abs(int a){ return (a>=0) ? a: -a; }\n\tprivate static long abs(long a){ return (a>=0) ? a: -a; }\n\tprivate static double abs(double a){ return (a>=0) ? a: -a; }\n\t\n\tprivate static int min(int a, int b){ return (a>b) ? b : a; }\n\tprivate static long min(long a, long b){ return (a>b) ? b : a; }\n\tprivate static double min(double a, double b){ return (a>b) ? b : a; }\n\t\n\tprivate static int max(int a, int b){ return (a>b) ? a : b; }\n\tprivate static long max(long a, long b){ return (a>b) ? a : b; }\n\tprivate static double max(double a, double b){ return (a>b) ? a : b; }\n\t\n\tprivate static int minN(int... ins){\n\t\tint min = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; }\n\t\treturn min;\n\t}\n\tprivate static int maxN(int... ins){\n\t\tint max = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; }\n\t\treturn max;\n\t}\n\tprivate static long minN(long... ins){\n\t\tlong min = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; }\n\t\treturn min;\n\t}\n\tprivate static long maxN(long... ins){\n\t\tlong max = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; }\n\t\treturn max;\n\t}\n\t\n\tprivate static int minExAd(int[] dt, int ad){\n\t int min=INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static long minExAd(long[] dt, int ad){\n\t long min=INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static int minExVal(int[] dt, int ex_val){\n\t int min=INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static long minExVal(long[] dt, long ex_val){\n\t long min=INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static int maxExAd(int[] dt, int ad){\n\t int max=-INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static long maxExAd(long[] dt, int ad){\n\t long max=-INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static double maxExAd(double[] dt, int ad){\n\t double max=-INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static int maxExVal(int[] dt, int ex_val){\n\t int max=-INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static long maxExVal(long[] dt, long ex_val){\n\t long max=-INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\n private static int sumA(int[] dt){\n int sum =0;\n for(int e: dt){ sum += e; }\n\t\treturn sum;\n }\n private static long sumA(long[] dt){\n long sum =0;\n for(long e: dt){ sum += e; }\n\t\treturn sum;\n }\n private static int sumA(List<Integer> dt){\n int sum =0;\n for(long e: dt){ sum += e; }\n\t\treturn sum;\n }\n\t\n\tprivate static double hypod(double a, double b){\n\t return Math.sqrt(a*a+b*b);\n\t}\n\t\n\tprivate static long factorial(int n) {\n\t\tlong ans=1;\n\t\tfor(long i=n; i>0; i--){ ans*=i; }\n\t\treturn ans;\n\t}\n\t\n\tprivate static long facP(int n, long p) {\n\t\tlong ans=1;\n\t\tfor(long i=n; i>0; i--){\n\t\t ans*=i;\n\t\t ans %= p;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tprivate static long lcm(long m, long n){\n\t long ans = m/gcd(m,n);\n\t ans *= n;\n\t return ans;\n\t}\n\t\n\tprivate static long gcd(long m, long n) {\n\t\tif(m < n) return gcd(n, m);\n\t\tif(n == 0) return m;\n\t\treturn gcd(n, m % n);\n\t}\n\t\n\tprivate static boolean is_prime(long a){\n\t if(a==1) return false;\n\t for(long i=2L; i<=Math.sqrt(a); i++){ if(a%i == 0) return false; }\n\t return true;\n\t}\n\t\n private static long modinv(long a, long p) { //a|p, >1に注意\n long b = p, u = 1L, v = 0L;\n while (b>0) {\n long t = a / b;\n long pe = a%b;\n a=b; b=pe;\n pe= u-t*v;\n u=v; v=pe;\n }\n u %= p; \n if (u < 0) u += p;\n return u;\n }\n \n\tprivate static int pow(int n, int k){\n\t int ans=1;\n\t for(int i=0; i<k; i++) ans *= n;\n\t return ans;\n\t}\n\tprivate static long pow(long n, int k){\n\t long ans=1;\n\t for(int i=0; i<k; i++) ans *= n;\n\t return ans;\n\t}\n\t\n\tprivate static int pow2(int in){ return in*in; }\n\tprivate static long pow2(long in){ return in*in; }\n\tprivate static double pow2(double in){ return in*in; }\n\t\n\tprivate static int getDigit2(long num){\n\t\tlong cf = 1; int d=0;\n\t\twhile(num > cf){ d++; cf = (1L<<d); }\n\t\t\n\t\treturn d; //numは2^d以下\n\t}\n\t\n\tprivate static int getDigit10(long num){\n\t\tlong cf = 1; int d=0;\n\t\twhile(num >= cf){ d++; cf*=10; }\n\t\treturn d; //numはd桁の数で、10^dより小さい\n\t}\n\t\n\tprivate static boolean isINF(int in){\n \tif(((long)in*20)>INF) return true;\n \telse return false;\n\t}\n\tprivate static boolean isINFL(long in){\n \tif((in*10000)>INFL) return true;\n \telse return false;\n\t}\n\t\n\tprivate static long pow10E97(long ob, long soeji, long p){\n\t if(ob==0) return 0;\n\t if(soeji==0) return 1;\n\t\tif(soeji==2) return (ob*ob)%p;\n\t\t\n\t\tint d = getDigit2(soeji);\n\t\tlong[] ob_pow_2pow = new long[d];\n\t\t\n\t\tob_pow_2pow[0] = ob;\n\t\tfor(int i=1; i<d; i++){ ob_pow_2pow[i] = (ob_pow_2pow[i-1]*ob_pow_2pow[i-1])%p; }\n\t\t\n\t\tlong ans=1;\n\t\tfor(int i=d-1; i>=0; i--){\n\t\t\tif(soeji >= (long)(1<<i)){\n\t\t\t\tsoeji -= (long)(1<<i);\n\t\t\t\tans = (ans*ob_pow_2pow[i])%p;\n\t\t\t}\n \t\t}\n\t\treturn ans%p;\n\t}\n\tprivate static long nC2(long n){\n\t\treturn ((n*(n-1))/2L);\n\t}\n\tprivate static int divceil(int numerator, int denominator){\n\t return (numerator+denominator-1)/denominator;\n\t}\n\tprivate static long divceil(long numerator, long denominator){\n\t return (numerator+denominator-1L)/denominator;\n\t}\n\t\n\tprivate static int iflag(int pos){ return (1<<pos); }\n\tprivate static long flag(long pos){ return (1L<<pos); }\n\tprivate static boolean isFlaged(int bit, int pos){\n \tif((bit&(1<<pos)) > 0) return true;\n \telse return false;\n\t}\n\tprivate static boolean isFlaged(long bit, int pos){\n \tif((bit&(1L<<pos)) > 0) return true;\n \telse return false;\n\t}\n\tprivate static int deflag(int bit, int pos){ return bit&~(1<<pos); }\n\tprivate static int countFlaged(int bit){\n\t int ans=0; \n\t for(int i=0; i<getDigit2(bit); i++){\n\t if((bit&(1<<i)) > 0) ans++;\n\t }\n\t return ans;\n\t}\n\tprivate static int countFlaged(long bit){\n\t int ans=0; \n\t for(long i=0; i<getDigit2(bit); i++){\n\t if((bit&(1L<<i)) > 0) ans++;\n\t }\n\t return ans;\n\t}\n\t\n\tprivate static void show2(int bit){\n \tfor(int i=0; i<getDigit2(bit); i++){\n \tif(isFlaged(bit,i)) System.out.print(\"O\");\n \telse System.out.print(\".\");\n \t}\n \tSystem.out.println();\n\t}\n\t\n\tpublic static int biSearch(int[] dt, int target){\n\t\tint left=0, right=dt.length-1;\n\t\tint mid=-1;\n\t\twhile(left<=right){\n\t\t\tmid = (right+left)/2;\n\t\t\tif(dt[mid] == target) return mid;\n\t\t\tif(dt[mid] < target) left=mid+1;\n\t\t\telse right=mid-1;\n\t\t}\n\t\treturn -1;\n\t}\n\tpublic static int biSearchMax(long[] dt, long target){\n\t\tint left=-1, right=dt.length;\n\t\tint mid=-1;\n\t\t\n\t\twhile((right-left)>1){\n\t\t\tmid = left + (right-left)/2;\n\t\t\tif(dt[mid] <= target) left=mid;\n\t\t\telse right=mid;\n\t\t}\n\t\treturn left;//target以下の最大のaddress\n\t}\n\tpublic static int biSearchMaxAL(ArrayList<Long> dt, long target){\n\t\tint left=-1, right=dt.size();\n\t\tint mid=-1;\n\t\t\n\t\twhile((right-left)>1){\n\t\t\tmid = left + (right-left)/2;\n\t\t\tif(dt.get(mid) <= target) left=mid;\n\t\t\telse right=mid;\n\t\t}\n\t\treturn left;//target以下の最大のaddress\n\t}\n\t\n private static int[] Xdir4 = {1,0,0,-1};\n private static int[] Ydir4 = {0,1,-1,0};\n\t \n\tprivate\tstatic int[] Xdir8 = {1,1,1,0,0,-1,-1,-1};\n\tprivate\tstatic int[] Ydir8 = {1,0,-1,1,-1,1,0,-1};\n\t\n\tprivate static boolean is_in_area(int y, int x, int h, int w){\n\t if(y<0) return false;\n\t if(x<0) return false;\n\t if(y>=h) return false;\n\t if(x>=w) return false;\n\t return true;\n\t}\n\t\n\t\n\tstatic void show2(boolean[][] dt, int lit_x, int lit_y){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int j=0; j<dt.length; j++){\n\t\t for(int i=0; i<dt[j].length; i++){\n\t\t\t\tif((i==lit_y) && (j==lit_x)) out.print(\"X\");\n\t\t\t\telse if(dt[j][i]) out.print(\"O\");\n\t\t\t\telse out.print(\".\");\n\t\t\t}\n\t\t\tout.println();\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void show2(int[][] dt, String cmnt){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int i=0; i<dt.length; i++){\n\t\t\tfor(int j=0; j<dt[i].length; j++){\n\t\t\t\tout.print(dt[i][j]+\",\");\n\t\t\t}\n\t\t\tout.println(\"<-\"+cmnt+\":\"+i);\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void show2(long[][] dt, String cmnt){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int i=0; i<dt.length; i++){\n\t\t\tfor(int j=0; j<dt[i].length; j++){\n\t\t\t\tout.print(dt[i][j]+\",\");\n\t\t\t}\n\t\t\tout.println(\"<-\"+cmnt+\":\"+i);\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void show2(ArrayDeque<Long> dt){\t\t//上手くいかなかった時用\n\t\tlong a=0;\n\t\twhile(dt.size()>0){\n\t\t\ta=dt.removeFirst();\n\t\t\tSystem.out.print(a);\n\t\t}\n\t\tSystem.out.println(\"\\n\");\n\t}\n\tstatic void show2(List dt){\t\t//上手くいかなかった時用\n\t \tfor(int i=0; i<dt.size(); i++){\n\t\t\tSystem.out.print(dt.get(i)+\",\");\n\t\t}\n\t\tSystem.out.println(\"\\n\");\n\t}\n\t\n\t\n\tprivate static void prtlnas(int[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t for(int i=0; i<as.length; i++){\n\t out.println(as[i]);\n\t }\n\t out.flush();\n\t}\n\tprivate static void prtlnas(long[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t for(int i=0; i<as.length; i++){\n\t out.println(as[i]);\n\t }\n\t out.flush();\n\t}\n\tprivate static void prtspas(int[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tout.print(as[0]);\n\t for(int i=1; i<as.length; i++){\n\t out.print(\" \"+as[i]);\n\t }\n\t out.println();\n\t out.flush();\n\t}\n\tprivate static void prtspas(long[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tout.print(as[0]);\n\t for(int i=1; i<as.length; i++){\n\t out.print(\" \"+as[i]);\n\t }\n\t out.println();\n\t out.flush();\n\t}\n\tprivate static void prtspas(List as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tout.print(as.get(0));\n\t for(int i=1; i<as.size(); i++){\n\t out.print(\" \"+as.get(i));\n\t }\n\t out.println();\n\t out.flush();\n\t}\n\t\n\t\n private static void fill(boolean[] ob, boolean res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n private static void fill(int[] ob, int res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(long[] ob, long res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(char[] ob, char res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(double[] ob, double res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(boolean[][] ob,boolean res){for(int i=0;i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(int[][] ob, int res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(long[][] ob, long res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(char[][] ob, char res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(double[][] ob, double res){for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(int[][][] ob,int res){for(int i=0;i<ob.length;i++){for(int j=0;j<ob[0].length;j++){for(int k=0;k<ob[0][0].length;k++){ob[i][j][k]=res;}}}}\n\tprivate static void fill(long[][][] ob,long res){for(int i=0;i<ob.length;i++){for(int j=0;j<ob[0].length;j++){for(int k=0;k<ob[0][0].length;k++){ob[i][j][k]=res;}}}}\n\t\n static class FastScanner {\n \tprivate final InputStream in = System.in;\n \tprivate final byte[] buffer = new byte[1024];\n \tprivate int ptr = 0;\n \tprivate int buflen = 0;\n \tprivate boolean hasNextByte() {\n \t\tif (ptr < buflen) {\n \t\t\treturn true;\n \t\t}else{\n \t\t\tptr = 0;\n \t\t\ttry {\n \t\t\t\tbuflen = in.read(buffer);\n \t\t\t} catch (IOException e) {\n \t\t\t\te.printStackTrace();\n \t\t\t}\n \t\t\tif (buflen <= 0) {\n \t\t\t\treturn false;\n \t\t\t}\n \t\t}\n \t\treturn true;\n \t}\n \t\n \tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n \tprivate static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n \tpublic boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n \tpublic String next() {\n \t\tif (!hasNext()) throw new NoSuchElementException();\n \t\tStringBuilder sb = new StringBuilder();\n \t\tint b = readByte();\n \t\twhile(isPrintableChar(b)) {\n \t\t\tsb.appendCodePoint(b);\n \t\t\tb = readByte();\n \t\t}\n \t\treturn sb.toString();\n \t}\n \tpublic long nexL() {\n \t\tif (!hasNext()) throw new NoSuchElementException();\n \t\tlong n = 0;\n \t\tboolean minus = false;\n \t\tint b = readByte();\n \t\tif (b == '-') {\n \t\t\tminus = true;\n \t\t\tb = readByte();\n \t\t}\n \t\tif (b < '0' || '9' < b) {\n \t\t\tthrow new NumberFormatException();\n \t\t}\n \t\twhile(true){\n \t\t\tif ('0' <= b && b <= '9') {\n \t\t\t\tn *= 10;\n \t\t\t\tn += b - '0';\n \t\t\t}else if(b == -1 || !isPrintableChar(b) || b == ':'){\n \t\t\t\treturn minus ? -n : n;\n \t\t\t}else{\n \t\t\t\tthrow new NumberFormatException();\n \t\t\t}\n \t\t\tb = readByte();\n \t\t}\n \t}\n \tpublic int nexI() {\n \t\tlong nl = nexL();\n \t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n \t\treturn (int) nl;\n \t}\n \tpublic double nexD() { return Double.parseDouble(next());}\n \t\n \tpublic void al(long[] array){\n \t \tfor(int i=0; i<array.length; i++){\n \t \t array[i] = nexL();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ai(int[] array){\n \t \tfor(int i=0; i<array.length; i++){\n \t \t array[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void aD(double[] array){\n \t \tfor(int i=0; i<array.length; i++){\n \t \t array[i] = nexD();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ai2(int[] as, int[] bs){\n \t \tfor(int i=0; i<as.length; i++){\n \t \t as[i] = nexI();\n \t \t bs[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void al2(long[] as, long[] bs){\n \t \tfor(int i=0; i<as.length; i++){\n \t \t as[i] = nexL();\n \t \t bs[i] = nexL();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ai3(int[] as, int[] bs, int[] cs){\n \t \tfor(int i=0; i<as.length; i++){\n \t \t as[i] = nexI();\n \t \t bs[i] = nexI();\n \t \t cs[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ad2i(int[][] as){\n \t for(int i=0; i<as.length; i++){\n \t for(int j=0; j<as[0].length; j++){\n \t as[i][j] = nexI();\n \t }\n \t }\n \t return;\n \t}\n \tpublic void ain(int[]... as){\n \t for(int i=0; i<as[0].length; i++){\n \t for(int j=0; j<as.length; j++){\n \t as[j][i] = nexI();\n \t }\n \t }\n \t}\n \tpublic void aln(long[]... as){\n \t for(int i=0; i<as[0].length; i++){\n \t for(int j=0; j<as.length; j++){\n \t as[j][i] = nexL();\n \t }\n \t }\n \t}\n }\n}", "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.InputMismatchException;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.PriorityQueue;\n\npublic class Main {\n\n\tprivate static final String NO = \"NO\";\n\tprivate static final String YES = \"YES\";\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\n\tprivate static final long MOD = 1000000007;\n\tprivate static final int INF = Integer.MAX_VALUE;\n\n\tvoid solve() {\n\t\tint T = 1;\n\t\tfor (int i = 0; i < T; i++)\n\t\t\tsolve(i);\n\t}\n\n\tint n;\n\n\tMap<String, Long> v = new HashMap<String, Long>();\n\n\tstatic class Item implements Comparable<Item> {\n\t\tpublic Item(String l, String r, long c) {\n\t\t\tleft = l;\n\t\t\tright = r;\n\t\t\tcost = c;\n\t\t}\n\n\t\tString left;\n\t\tString right;\n\t\tlong cost;\n\n\t\tpublic boolean isPalindrome() {\n\t\t\tString s = left + right;\n\t\t\tfor (int i = 0; i < s.length() / 2; i++)\n\t\t\t\tif (s.charAt(i) != s.charAt(s.length() - 1 - i))\n\t\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic Item add(String s, long c) {\n\t\t\tif (right.length() == 0 & can(left, s)) {\n\t\t\t\tint l = Math.min(left.length(), s.length());\n\t\t\t\treturn new Item(left.substring(l), s.substring(0, s.length() - l), cost + c);\n\t\t\t} else if (left.length() == 0 & can(s, right)) {\n\t\t\t\tint l = Math.min(right.length(), s.length());\n\t\t\t\treturn new Item(s.substring(l), right.substring(0, right.length() - l), cost + c);\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\n\t\tstatic boolean can(String l, String r) {\n\t\t\tint min = Math.min(l.length(), r.length());\n\t\t\tfor (int i = 0; i < min; i++) {\n\t\t\t\tif (l.charAt(i) != r.charAt(r.length() - 1 - i))\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Item o) {\n\t\t\treturn Long.signum(cost - o.cost);\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn left + \" \" + right + \" \" + cost;\n\t\t}\n\t}\n\n\tvoid solve(int T) {\n\t\tn = ni();\n\t\tint m = ni();\n\t\tint K = ni();\n\t\tint a[][] = new int[n][m];\n\t\tlong dp[][][] = new long[n + 1][m + 1][4];\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint r = ni() - 1;\n\t\t\tint c = ni() - 1;\n\t\t\tint v = ni();\n\t\t\ta[r][c] = v;\n\t\t}\n//\t\ttr(a);\n\t\tfor (int r = 0; r < n; r++) {\n\t\t\tfor (int c = 0; c < m; c++) {\n\t\t\t\tfor (int kk = 1; kk < 4; kk++) {\n\t\t\t\t\tdp[r + 1][c + 1][kk] = Math.max(dp[r][c + 1][3] + a[r][c],\n\t\t\t\t\t\t\tMath.max(dp[r + 1][c][kk], dp[r + 1][c][kk - 1] + a[r][c]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.print(dp[n][m][3]);\n\t}\n\n\t// a^b\n\tlong power(long a, long b) {\n\t\tlong x = 1, y = a;\n\t\twhile (b > 0) {\n\t\t\tif (b % 2 != 0) {\n\t\t\t\tx = (x * y) % MOD;\n\t\t\t}\n\t\t\ty = (y * y) % MOD;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn x % MOD;\n\t}\n\n\tprivate long gcd(long a, long b) {\n\t\twhile (a != 0) {\n\t\t\tlong tmp = b % a;\n\t\t\tb = a;\n\t\t\ta = tmp;\n\t\t}\n\t\treturn b;\n\t}\n\n\tvoid run() throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\tif (!INPUT.isEmpty())\n\t\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().run();\n\t}\n\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\tprivate boolean vis[];\n\n\tprivate int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tprivate double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\tprivate char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '\n\t\t\t\t\t\t\t\t\t// ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n) {\n\t\t\tif (!(isSpaceChar(b)))\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate List<Integer> na2(int n) {\n\t\tList<Integer> a = new ArrayList<Integer>();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta.add(ni());\n\t\treturn a;\n\t}\n\n\tprivate int[][] na(int n, int m) {\n\t\tint[][] a = new int[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = na(m);\n\t\treturn a;\n\t}\n\n\tprivate int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate long[] nl(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\n\tprivate long[][] nl(int n, int m) {\n\t\tlong[][] a = new long[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl(m);\n\t\treturn a;\n\t}\n\n\tprivate long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate static void tr(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n}", "#include <bits/stdc++.h>\n#define rep(i,s,n) for (int i = s; i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nusing pq = priority_queue<ll, vector<ll>, greater<ll>>;\n\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\nll dp[3010][3010][4];\n\nint main() {\n int r,c,K;\n cin >> r >> c >> K;\n vector<vector<ll>> field(r+1,vector<ll>(c+1,0));\n rep(i,0,K) {\n int ri,ci; ll v;\n cin >> ri >> ci >> v;\n field[ri][ci] = v;\n }\n rep(i,1,r+1) rep(j,1,c+1) rep(k,0,4) {\n if (k > 0) {\n chmax(dp[i][j][k],dp[i][j-1][k-1] + field[i][j]);\n }\n chmax(dp[i][j][k],dp[i][j-1][k]);\n chmax(dp[i][j][1],dp[i-1][j][k] + field[i][j]);\n }\n ll ans = 0;\n rep(k,0,4) {\n chmax(ans,dp[r][c][k]);\n }\n cout << ans << endl;\n return 0;\n}\n", "R,C,K=map(int,input().split())\nrcv=[list(map(int,input().split())) for _ in range(K)]\nmat=[[0]*C for _ in range(R)]\nfor r,c,v in rcv:\n mat[r-1][c-1]=v\ndp=[0]*C\nfor i in range(R):\n ndp=[0]*C\n wdp=[0]*4\n for j in range(C):\n wdp[0]=max(wdp[0],dp[j])\n if mat[i][j]>0:\n v=mat[i][j]\n wdp[3]=max(wdp[3],wdp[2]+v)\n wdp[2]=max(wdp[2],wdp[1]+v)\n wdp[1]=max(wdp[1],wdp[0]+v)\n ndp[j]=max(wdp)\n dp=ndp.copy()\nprint(max(wdp))", "R, C, K = map(int, input().split())\n\nV = [[0]*(C+1) for _ in range(R+1)]\ndp1 = [[0,0,0,0] for _ in range(C+1)]\n\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[r][c] = v\n\nfor r in range(1,R+1):\n dp0 = dp1\n dp1 = [[0,0,0,0] for _ in range(C+1)]\n \n for c in range(1,C+1):\n v = V[r][c]\n dprc = dp1[c]\n dprcL = dp1[c-1]\n if v==0:\n dprc[0] = max(max(dp0[c]), dprcL[0])\n for n in range(1,4): dprc[n] = dprcL[n]\n else:\n maxT = max(dp0[c])\n dprc[0] = max(maxT , dprcL[0])\n dprc[1] = max(maxT+v, dprcL[0]+v, dprcL[1])\n dprc[2] = max( dprcL[1]+v, dprcL[2])\n dprc[3] = max( dprcL[2]+v, dprcL[3])\n \n\nprint(max(dp1[C]))\n", "R,C,K = map(int, input().split())\na = [[0] * (C+1) for i in range(R+1)]\ndp = [[[0] * (C+1) for i in range(R+1)] for j in range(4)]\n\nfor i in range(K):\n r,c,v = map(int, input().split())\n r -= 1\n c -= 1\n a[r][c] = v \n \nfor i in range(R):\n for j in range(C):\n for k in range(2,-1,-1):\n dp[k+1][i][j] = max(dp[k+1][i][j], dp[k][i][j] + a[i][j])\n for k in range(4):\n dp[k][i][j+1] = max(dp[k][i][j+1], dp[k][i][j])\n dp[0][i+1][j] = max(dp[0][i+1][j], dp[k][i][j])\nans = 0\nfor k in range(4):\n ans = max(ans, dp[k][R-1][C-1])\n \nprint(ans)\n \n", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tstatic PrintWriter out;\n\tstatic StringBuilder sb;\n\tstatic int mod = 1000000007;\n\tstatic long inf = (long) 1e16;\n\tstatic int n, c, t, r;\n\tstatic ArrayList<Integer>[] ad;\n\tstatic long[][][] memo;\n\tstatic boolean f;\n\tstatic boolean[] vis[];\n\tstatic long[][] mat;\n\tstatic int[] ans, a;\n\tstatic TreeMap<pair, Long> tm;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tr = sc.nextInt();\n\t\tc = sc.nextInt();\n\t\tmemo = new long[r][c][4];\n\t\tfor (long[][] h : memo)\n\t\t\tfor (long[] hh : h)\n\t\t\t\tArrays.fill(hh, -1);\n\t\ttm = new TreeMap<>();\n\t\tint k = sc.nextInt();\n\t\tmat = new long[r][c];\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tmat[sc.nextInt() - 1][sc.nextInt() - 1] = sc.nextLong();\n\t\tSystem.out.println(dp(0, 0, 3));\n\t\tout.flush();\n\t}\n\n\tstatic long dp(int i, int j, int left) {\n\t\tif (i == r || j == c)\n\t\t\treturn 0;\n\t\tif (memo[i][j][left] != -1)\n\t\t\treturn memo[i][j][left];\n\t\tlong ans = Math.max(dp(i + 1, j, 3), dp(i, j + 1, left));\n\t\tif (left > 0 && mat[i][j] > 0) {\n\t\t\tans = Math.max(ans, Math.max(dp(i + 1, j, 3) + mat[i][j], dp(i, j + 1, left - 1) + mat[i][j]));\n\t\t}\n\t\treturn memo[i][j][left] = ans;\n\t}\n\n\tstatic class pair implements Comparable<pair> {\n\t\tint x;\n\t\tint y;\n\n\t\tpair(int x, int y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn x + \" \" + y;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(pair o) {\n\t\t\tif (x == o.x)\n\t\t\t\treturn y - o.y;\n\t\t\treturn x - o.x;\n\t\t}\n\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n\n\t\tpublic Scanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n\n\t\tpublic Long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextArrInt(int n) throws IOException {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextArrLong(int n) throws IOException {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n}\n", "import sys\ninput = sys.stdin.readline\nR, L, K = map(int, input().split())\nV = [[0]*R for _ in range(L)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[c-1][r-1] = v\nA, B, C, D = [[0]*(R+1) for _ in range(4)]\nfor i in range(L):\n for j in range(R):\n A[j] = max(A[j-1],B[j-1],C[j-1],D[j-1])\n v = V[i][j]\n if v != 0:\n D[j], C[j], B[j] = max(C[j]+v,D[j]), max(B[j]+v,C[j]), max(A[j]+v,B[j])\nprint(max(A[-2],B[-2],C[-2],D[-2]))", "import sys\n\n\ndef main():\n input = sys.stdin.readline\n\n r, c, k = map(int, input().split())\n\n items = [[0] * (c + 1) for _ in range(r + 1)]\n for _ in range(k):\n i, j, v = map(int, input().split())\n items[i][j] = v\n\n # dp[m][i][j] = (i行j列時点で、i行でm個のitemを取得している時の価値の最大値)\n dp = [[[0] * (c + 1) for _ in range(r + 1)] for _ in range(4)]\n\n for i in range(1, r + 1):\n for j in range(1, c + 1):\n for m in range(4):\n dp[m][i][j] = max(dp[3][i - 1][j], dp[m][i][j - 1])\n if items[i][j] > 0:\n for m in [2, 1, 0]:\n dp[m + 1][i][j] = max(dp[m + 1][i][j],\n dp[m][i][j] + items[i][j])\n\n print(dp[3][r][c])\n\n\nif __name__ == '__main__':\n main()\n", "import sys\ninput=lambda:sys.stdin.readline().rstrip()\nr,c,k=map(int,input().split())\ndp=[[(c+1)*[0]for _ in range(r+1)]for _ in range(4)]\np=[c*[0]for _ in range(r)]\nfor _ in range(k):\n rr,cc,u=map(int,input().split())\n rr-=1\n cc-=1\n p[rr][cc]=u\nans=0\nfor j in range(1,r+1):\n for k in range(1,c+1):\n dp[0][j][k]=max(dp[0][j-1][k],dp[0][j][k-1])\n t=max(dp[0][j-1][k],dp[1][j-1][k],dp[2][j-1][k],dp[3][j-1][k])\n for i in range(1,4):\n dp[i][j][k]=max(dp[i][j][k],t,dp[i][j][k-1])\n if p[j-1][k-1]:\n dp[i][j][k]=max(dp[i][j][k],dp[i-1][j][k-1]+p[j-1][k-1],t+p[j-1][k-1])\n ans=max(ans,dp[i][j][k])\nprint(ans)\n", "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n static long[][][] dp;\n private static long calculate(int x, int y, int R, int C, int[][] grid, int[] rowCounts){\n if(x < 0 || y < 0 || x >= R || y >= C) return -1;\n if(dp[x][y][rowCounts[x]] != -1) return dp[x][y][rowCounts[x]];\n if(x == R - 1 && y == C - 1){\n if(rowCounts[x] == 3 || grid[x][y] == 0){\n dp[x][y][rowCounts[x]] = 0;\n return 0;\n }\n dp[x][y][rowCounts[x]] = grid[x][y];\n return grid[x][y];\n }\n if(rowCounts[x] == 3 || grid[x][y] == 0){\n long a = calculate(x + 1, y, R, C, grid, rowCounts);\n long b = calculate(x, y + 1, R, C, grid, rowCounts);\n if(a == - 1 && b == -1) {\n dp[x][y][rowCounts[x]] = -1;\n return -1;\n }\n dp[x][y][rowCounts[x]] = Math.max(a, b);\n return Math.max(a, b);\n }else {\n long a = calculate(x + 1, y, R, C, grid, rowCounts);\n long b = calculate(x, y + 1, R, C, grid, rowCounts);\n rowCounts[x]++;\n long c = calculate(x + 1, y, R, C, grid, rowCounts);\n long d = calculate(x, y + 1, R, C, grid, rowCounts);\n if(a == - 1 && b == -1 && c == -1 && d == -1) return -1;\n rowCounts[x]--;\n long l1 = Math.max(a, b);\n long l2 = grid[x][y] + Math.max(c, d);\n if(l1 > l2){\n dp[x][y][rowCounts[x]] = l1;\n return l1;\n }\n dp[x][y][rowCounts[x]] = l2;\n return l2;\n }\n }\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringBuilder sb = new StringBuilder();\n // code goes here\n int[] in = nextIntArray(br, 3);\n int R = in[0];\n int C = in[1];\n int K = in[2];\n\n int[][] vals = new int[K][3];\n int[][] grid = new int[R][C];\n for(int i = 0; i < K; i++){\n StringTokenizer st = new StringTokenizer(br.readLine());\n vals[i][0] = Integer.parseInt(st.nextToken());\n vals[i][1] = Integer.parseInt(st.nextToken());\n vals[i][2] = Integer.parseInt(st.nextToken());\n grid[vals[i][0] - 1][vals[i][1] - 1] = vals[i][2];\n }\n int[] rowCounts = new int[R];\n dp = new long[R][C][4];\n for(int i = 0; i < R; i++){\n for(int j = 0; j < C; j++){\n Arrays.fill(dp[i][j], -1);\n }\n }\n sb.append(calculate(0, 0, R, C, grid, rowCounts));\n System.out.print(sb.toString());\n }\n\n private static int nextInt(BufferedReader br) throws IOException{\n return Integer.parseInt(br.readLine());\n }\n\n private static int[] nextIntArray(BufferedReader br, int n) throws IOException{\n StringTokenizer st = new StringTokenizer(br.readLine());\n int[] arr = new int[n];\n for(int i = 0; i < n; i++){\n arr[i] = Integer.parseInt(st.nextToken());\n }\n return arr;\n }\n\n static class Pair<A, B>{\n A first;\n B second;\n public Pair(A first, B second){\n this.first = first;\n this.second = second;\n }\n }\n}\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <map>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for (int i = 0; i < int(n);i++)\n\nll dp[3010][3010][4];\nll cost[3010][3010];\n\nint main(){\n int r,c,k;\n cin >> r >> c >> k;\n rep(i,k){\n int x,y;\n ll z;\n cin >> x >> y >> z;\n x--;y--;\n cost[x][y] = z;\n }\n rep(i,r)rep(j,c){\n for (int h = 2; h >= 0;h--){\n dp[i][j][h+1] = max(dp[i][j][h+1],dp[i][j][h] + cost[i][j]); \n }\n rep(h,4){\n dp[i+1][j][0] = max(dp[i+1][j][0],dp[i][j][h]);\n dp[i][j+1][h] = max(dp[i][j+1][h],dp[i][j][h]);\n }\n }\n ll ans = 0;\n for (int i = 0; i <= 3;i++){\n ans = max(ans,dp[r-1][c-1][i]);\n }\n cout << ans << endl;\n \n\n return 0;\n \n\n}\n", "#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define ll long long\n#define rep(i,n) for(int i = 0;i < (n); i++)\n#define mod 1000000007\n#define chmax(x,y) x=max(x,y)\n \n//2020/9/16 @ST\n\nint d[3005][3005] = { 0 };\nll dp[3005][3005][4] = { 0 };\n\nint main() {\n\tint r, c, k;\n\tcin >> r >> c >> k;\n\trep(i, k) {\n\t\tint rk, ck, vk;\n\t\tcin >> rk >> ck >> vk;\n\t\td[rk - 1][ck - 1] = vk;\n\t}\n\trep(i, r)\trep(j, c) {\n\t\tfor (int l = 2; l >= 0; l--) {\n\t\t\tchmax(dp[i][j][l + 1], dp[i][j][l] + d[i][j]);\n\t\t}\n\t\trep(l, 4) {\n\t\t\tchmax(dp[i + 1][j][0], dp[i][j][l]);\n\t\t\tchmax(dp[i][j + 1][l], dp[i][j][l]);\n\t\t}\n\t}\n\tll ans = 0;\n\trep(l, 4)chmax(ans, dp[r - 1][c - 1][l]);\n\tcout << ans << endl;\n\treturn 0;\n}", "R,C,K=map(int,input().split())\n\nV=[[0 for _ in range(C)] for _ in range(R)]\n\nfor i in range(K):\n r,c,v=map(int,input().split())\n V[r-1][c-1]=v\n\ndp=[[0 for _ in range(4)] for _ in range(C+1)]\nfor i in range(R):\n ndp=[[0 for _ in range(4)] for _ in range(C+1)]\n for j in range(C):\n ndp[j][0]=max(dp[j])\n\n for j in range(C):\n v=V[i][j]\n for n in range(1,4):\n ndp[j][n]=max(ndp[j-1][n-1]+v,dp[j][3]+v,ndp[j-1][n])\n\n dp=ndp\n\nprint(max(dp[C-1]))\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define M 1000000007\n#define INF ((1LL<<62LL) - 1)\n\nconst int N = 3005;\nint a[N][N];\nint dp[N][N][4];\n\nsigned main(){\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n int r,c,k; cin >> r >> c >> k;\n\n for(int i=0;i<k;i++){\n int x,y,c; cin >> x >> y >> c;\n a[x][y] = c;\n }\n\n for(int i=1;i<=r;i++){\n for(int j=1;j<=c;j++){\n dp[i][j][0] = max(dp[i][j-1][0], dp[i-1][j][0]);\n for(int type = 1;type<=3;type++){\n dp[i][j][type] = a[i][j] + max(dp[i-1][j][3], dp[i][j-1][type-1]);\n dp[i][j][type] = max(dp[i][j][type], dp[i][j-1][type]);\n }\n }\n }\n\n cout << dp[r][c][3] << \"\\n\";\n\n\n}\n", "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.function.*;\nimport java.util.regex.*;\nimport java.util.stream.*;\nimport static java.util.stream.Collectors.joining;\nimport static java.util.stream.Collectors.toList;\n \npublic class Main\n{\n public static void main(String[] args)\n {\n Scanner in=new Scanner(System.in);\n int r=in.nextInt();\n int c=in.nextInt();\n int k=in.nextInt();\n long[][] mat=new long[r][c];\n for(int i=1;i<=k;i++)\n {\n int rr=in.nextInt();\n int cc=in.nextInt();\n rr--;\n cc--;\n long v=in.nextLong();\n mat[rr][cc]=v;\n }\n long[][][] dp=new long[r][c][4];\n dp[r-1][c-1][0]=mat[r-1][c-1];\n dp[r-1][c-1][1]=mat[r-1][c-1];\n dp[r-1][c-1][2]=mat[r-1][c-1];\n dp[r-1][c-1][3]=0;\n for(int i=c-2;i>=0;i--)\n {\n dp[r-1][i][3]=dp[r-1][i+1][3];\n for(int j=2;j>=0;j--)\n {\n if(mat[r-1][i]>0)\n dp[r-1][i][j]=Math.max(dp[r-1][i+1][j],dp[r-1][i+1][j+1]+mat[r-1][i]);\n else\n dp[r-1][i][j]=dp[r-1][i+1][j];\n }\n }\n\n for(int i=r-2;i>=0;i--)\n {\n dp[i][c-1][3]=dp[i+1][c-1][3];\n for(int j=2;j>=0;j--)\n {\n dp[i][c-1][j]=dp[i+1][c-1][0]+mat[i][c-1];\n }\n }\n\n for(int i=r-2;i>=0;i--)\n {\n for(int j=c-2;j>=0;j--)\n {\n dp[i][j][3]=Math.max(dp[i+1][j][0],dp[i][j+1][3]);\n for(int l=2;l>=0;l--)\n {\n if(mat[i][j]>0)\n dp[i][j][l]=Math.max(mat[i][j]+dp[i+1][j][0],Math.max(mat[i][j]+dp[i][j+1][l+1],dp[i][j+1][l]));\n else\n dp[i][j][l]=Math.max(dp[i+1][j][0],dp[i][j+1][l]);\n }\n }\n }\n System.out.println(dp[0][0][0]);\n }\n}\n", "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tvar sc = new Scanner(System.in);\n\t\tvar r = sc.nextInt();\n\t\tvar c = sc.nextInt();\n\t\tvar k = sc.nextInt();\n\t\tvar list = new ArrayList<Item>();\n\t\tfor (var i = 0; i < k; i++) {\n\t\t\tlist.add(new Main().new Item(sc.nextInt(), sc.nextInt(), sc.nextInt()));\n\t\t}\n\t\tsc.close();\n\n\t\tvar v = new long[r][c];\n\t\tfor (var i = 0; i < k; i++) {\n\t\t\tvar item = list.get(i);\n\t\t\tv[item.getR() - 1][item.getC() - 1] = item.getV();\n\t\t}\n\t\tfor (var i = 0; i < r; i++) {\n\t\t\tvar rv = new long[c][5];\n\t\t\tfor (var j = 0; j < c; j++) {\n\t\t\t\tfor (var ic = 0; ic < 4; ic++) {\n\t\t\t\t\tif (ic == 0) {\n\t\t\t\t\t\tvar rv1 = (i > 0 ? v[i - 1][j] : 0);\n\t\t\t\t\t\tvar rv2 = (j > 0 ? rv[j - 1][0] : 0);\n\t\t\t\t\t\tvar rv3 = (j > 0 ? rv[j - 1][1] : 0);\n\t\t\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\t\t\trv[j][1] = Math.max(Math.max(rv1 + v[i][j], rv2 + v[i][j]), rv3);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\trv[j][0] = Math.max(rv1, rv2);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (j > 0 && rv[j - 1][ic] > 0) {\n\t\t\t\t\t\tvar rv2 = rv[j - 1][ic];\n\t\t\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\t\t\tvar rv3 = rv[j - 1][ic + 1];\n\t\t\t\t\t\t\trv[j][ic + 1] = Math.max(rv2 + v[i][j], rv3);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\trv[j][ic] = rv2;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (var j = 0; j < c; j++) {\n\t\t\t\tv[i][j] = Math.max(Math.max(Math.max(rv[j][0], rv[j][1]), rv[j][2]), rv[j][3]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(v[r - 1][c - 1]);\n\t}\n\n\tpublic class Item {\n\t\tprivate int r;\n\t\tprivate int c;\n\t\tprivate int v;\n\n\t\tpublic Item(int r, int c, int v) {\n\t\t\tthis.r = r;\n\t\t\tthis.c = c;\n\t\t\tthis.v = v;\n\t\t}\n\n\t\tpublic int getR() {\n\t\t\treturn r;\n\t\t}\n\n\t\tpublic int getC() {\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic int getV() {\n\t\t\treturn v;\n\t\t}\n\t}\n}\n", "import java.io.*;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\nimport static java.lang.Long.max;\n\npublic class Main {\n static class Pair {\n int num;\n int cut;\n\n Pair(int num, int cut) {\n this.num = num;\n this.cut = cut;\n }\n\n double getVal() {\n return -num / (double) cut;\n }\n }\n\n public static void main(String[] args) throws IOException {\n sc = new MScanner(System.in);\n pw = new PrintWriter(System.out);\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n int[][] board = new int[R + 1][C + 1];\n for (int i = 0; i < K; i++) {\n int r = sc.nextInt();\n int c = sc.nextInt();\n int v = sc.nextInt();\n board[r][c] = v;\n }\n // dp\n long[][][] memo = new long[R + 1][C + 1][4];\n for (int i = 1; i <= R; i++) {\n for (int j = 1; j <= C; j++) {\n // update state 0, from up or left\n long up = 0;\n for (int k = 0; k < 4; k++) {\n up = max(up, memo[i - 1][j][k]);\n }\n memo[i][j][0] = max(memo[i][j - 1][0], up);\n // update state 1\n memo[i][j][1] = memo[i][j - 1][1];\n if (board[i][j] > 0) {\n memo[i][j][1] = max(memo[i][j][1], board[i][j] + memo[i][j - 1][0]);\n memo[i][j][1] = max(memo[i][j][1], board[i][j] + up);\n }\n // update state 2\n memo[i][j][2] = memo[i][j - 1][2];\n if (board[i][j] > 0) {\n memo[i][j][2] = max(memo[i][j][2], board[i][j] + memo[i][j - 1][1]);\n }\n // update state 3\n memo[i][j][3] = memo[i][j - 1][3];\n if (board[i][j] > 0) {\n memo[i][j][3] = max(memo[i][j][3], board[i][j] + memo[i][j - 1][2]);\n }\n }\n }\n long res = 0;\n for (int k = 0; k < 4; k++) {\n res = max(res, memo[R][C][k]);\n }\n pw.println(res);\n\n // pw.println(\"end\");\n // pw.println();\n\n pw.flush();\n // System.out.println(cnt);\n }\n\n /**\n * https://www.slideshare.net/hcpc_hokudai/binary-indexed-tree A space efficient version segment\n * tree. Usually for range sum. Or the required metric can be calulated in that:\n *\n * <p>right_metric = parant_metric - left_metric Only then, we can stop memoizing right_metric\n *\n * <p>The internal structure is a 1-base array, to simplify calculation of parent node's idx. lsb\n * = 3 & -3 = 2 (0x0011 & 0x1101 = 0x0001) lastParentOf3 = 3 - lsb = 2 curParentOf3 = 3 + lsb = 4\n */\n static class FenwickTree {\n private final long[] state;\n private final int size;\n\n FenwickTree(int size) {\n this.size = size;\n state = new long[size + 1];\n }\n\n @Override\n public String toString() {\n return Arrays.toString(state);\n }\n\n long queryRangeSumFromZeroTo(int idx) {\n long sum = 0;\n while (idx != 0) {\n sum += state[idx];\n idx -= (idx & -idx);\n }\n return sum;\n }\n\n /** @param val can be negative */\n void updateElement(int idx, long val) {\n while (idx <= size) {\n state[idx] += val;\n idx += (idx & -idx);\n }\n }\n }\n\n // sc.close();\n // pw.println(cnt);\n // pw.flush();\n\n static PrintWriter pw;\n static MScanner sc;\n\n static class MScanner {\n StringTokenizer st;\n BufferedReader br;\n\n public MScanner(InputStream system) {\n br = new BufferedReader(new InputStreamReader(system));\n }\n\n public MScanner(String file) throws Exception {\n br = new BufferedReader(new FileReader(file));\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int[] intArr(int n) throws IOException {\n int[] in = new int[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n return in;\n }\n\n public long[] longArr(int n) throws IOException {\n long[] in = new long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n return in;\n }\n\n public int[] intSortedArr(int n) throws IOException {\n int[] in = new int[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n shuffle(in);\n Arrays.sort(in);\n return in;\n }\n\n public long[] longSortedArr(int n) throws IOException {\n long[] in = new long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n shuffle(in);\n Arrays.sort(in);\n return in;\n }\n\n public Integer[] IntegerArr(int n) throws IOException {\n Integer[] in = new Integer[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n return in;\n }\n\n public Long[] LongArr(int n) throws IOException {\n Long[] in = new Long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n return in;\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public char nextChar() throws IOException {\n return next().charAt(0);\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n\n public void waitForInput() throws InterruptedException {\n Thread.sleep(3000);\n }\n }\n\n static void shuffle(int[] in) {\n for (int i = 0; i < in.length; i++) {\n int idx = (int) (Math.random() * in.length);\n int tmp = in[i];\n in[i] = in[idx];\n in[idx] = tmp;\n }\n }\n\n static void shuffle(long[] in) {\n for (int i = 0; i < in.length; i++) {\n int idx = (int) (Math.random() * in.length);\n long tmp = in[i];\n in[i] = in[idx];\n in[idx] = tmp;\n }\n }\n}\n", "\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic final class Main {\n\n public static void main(String[] args) {\n final Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n String[] line = in.nextLine().split(\" \");\n final int r = Integer.parseInt(line[0]);\n final int c = Integer.parseInt(line[1]);\n final int K = Integer.parseInt(line[2]);\n final int[][] matrix = new int[r][c];\n for (int i = 0; i < K; i++) {\n line = in.nextLine().split(\" \");\n final int row = Integer.parseInt(line[0]);\n final int col = Integer.parseInt(line[1]);\n final int v = Integer.parseInt(line[2]);\n matrix[row - 1][col - 1] = v;\n }\n final long[][][] dp = new long[r][c][4];\n dp[0][0][1] = matrix[0][0];\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n for (int k = 0; k < 4; k++) {\n if (i > 0) {\n dp[i][j][k] = Math.max(dp[i][j][k], dp[i - 1][j][k]);\n dp[i][j][1] = Math.max(dp[i][j][1], dp[i - 1][j][k] + matrix[i][j]);\n }\n if (j > 0) {\n dp[i][j][k] = Math.max(dp[i][j][k], dp[i][j - 1][k]);\n if (k > 0) {\n dp[i][j][k] = Math.max(dp[i][j][k], dp[i][j - 1][k - 1] + matrix[i][j]);\n }\n }\n }\n }\n }\n long res = 0;\n for (long ans : dp[r - 1][c - 1]) {\n res = Math.max(res, ans);\n }\n System.out.println(res);\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nll dp[3105][3105][5];\nll ara[3105][3105];\n\nll n,m,k;\n\nll call(ll i,ll j,ll tot)\n{\n if(i>n || j>m )\n return 0;\n\n ll &sum=dp[i][j][tot];\n\n\n if(~sum)\n return sum;\n\n sum=0;\n\n if(tot==3)\n {\n sum=(call(i+1,j,0));\n }\n else\n {\n if(ara[i][j]!=0)\n {\n sum=max(call(i,j+1,tot),max(ara[i][j]+call(i,j+1,tot+1),ara[i][j]+call(i+1,j,0)));\n }\n else\n {\n\n sum=max(call(i+1,j,0),call(i,j+1,tot));\n }\n }\n\n return sum;\n\n}\nint main()\n{\n cin>>n>>m>>k;\n ll a,b,c;\n while(k--)\n {\n cin>>a>>b>>c;\n ara[a][b]=c;\n }\n memset(dp,-1,sizeof(dp));\n cout<<call(0,0,0)<<endl;\n return 0;\n}\n", "import sys\ninput=sys.stdin.readline\nR,C,k=map(int,input().split())\nA=[[0]*C for i in range(R)]\nfor i in range(k):\n r,c,v=map(int,input().split())\n A[r-1][c-1]=v\ndp0=[[0]*(C+1) for i in range(R+1)]\ndp1=[[0]*(C+1) for i in range(R+1)]\ndp2=[[0]*(C+1) for i in range(R+1)]\ndp3=[[0]*(C+1) for i in range(R+1)]\nfor i in range(1,R+1):\n for j in range(1,C+1):\n V=A[i-1][j-1]\n dp0[i][j]=max(dp0[i-1][j],dp1[i-1][j],dp2[i-1][j],dp3[i-1][j],dp0[i][j-1])\n dp1[i][j]=max(dp0[i][j]+V,dp1[i][j-1])\n dp2[i][j]=max(dp1[i][j-1]+V,dp2[i][j-1])\n dp3[i][j]=max(dp2[i][j-1]+V,dp3[i][j-1])\nprint(max(dp0[-1][-1],dp1[-1][-1],dp2[-1][-1],dp3[-1][-1]))", "import java.io.IOException;\nimport java.util.Map;\nimport java.io.FileInputStream;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.HashMap;\nimport java.io.FileNotFoundException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\n\npublic class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/main/java/E3\";\n\n FastScanner in;\n PrintWriter out;\n\n public void solve() {\n int R = in.nextInt();\n int C = in.nextInt();\n int K = in.nextInt();\n\n long[][] itemsA = new long[R][C];\n for (int i = 0; i < R; i++) {\n Arrays.fill(itemsA[i], -1);\n }\n for (int i = 0; i < K; i++) {\n int r = in.nextInt() - 1;\n int c = in.nextInt() - 1;\n long v = in.nextLong();\n itemsA[r][c] = v;\n }\n\n long[][][] dp = new long[R+1][C+1][4];\n if (itemsA[0][0] != -1) {\n dp[0][0][1] = itemsA[0][0];\n }\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 0; k < 4; k++) {\n dp[i+1][j][0] = Math.max(dp[i+1][j][0], dp[i][j][k]);\n if (i + 1 < R && itemsA[i + 1][j] != -1) {\n dp[i+1][j][1] = Math.max(dp[i+1][j][1], dp[i][j][k] + itemsA[i+1][j]);\n }\n dp[i][j+1][k] = Math.max(dp[i][j+1][k], dp[i][j][k]);\n if (k < 3 && j + 1 < C && itemsA[i][j+1] != -1) {\n dp[i][j+1][k+1] = Math.max(dp[i][j+1][k+1], dp[i][j][k] + itemsA[i][j+1]);\n }\n }\n }\n }\n long res = 0;\n for (int i = 0; i < 4; i++) {\n res = Math.max(res, dp[R-1][C-1][i]);\n }\n System.out.println(res);\n }\n\n private Long toLong(int r, int c) {\n return r * 300000L + c;\n }\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n}\n\n\nclass FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }\n\n public long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextLongArray(m);\n }\n return map;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }\n\n public double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }\n\n public String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n\n public int[][] nextPackedIntArrays(int packN, int size) {\n int[][] res = new int[packN][size];\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }\n return res;\n }\n}\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.net.ConnectException;\nimport java.rmi.dgc.Lease;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.NoSuchElementException;\nimport java.util.Objects;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}\n\t// ======================================================================\n\tint R, C, K;\n\tint[][] V;\n\tlong memo[][][];\n\tlong calc(int r, int c, int cnt) {\n//\t\tout.println(\"開始　r = \" + r + \" c = \" + c + \" cnt = \" + cnt);\n\t\tif(r == R-1 && c == C-1) {\n\t\t\tif(cnt >= 3) {\n//\t\t\t\tout.println(\" リターン　０\");\n\t\t\t\treturn 0;\n\t\t\t} else {\n//\t\t\t\tout.println(\" リターン　\" + V[r][c]);\n\t\t\t\treturn V[r][c];\n\t\t\t}\n\t\t}\n\t\tif(memo[r][c][cnt] != -1) {\n//\t\t\tout.println(\" リターンメモ　\" + memo[r][c][cnt]);\n\t\t\treturn memo[r][c][cnt];\n\t\t}\n\t\tlong ans = 0;\n\t\tif(r+1 < R)\t{\n\t\t\tif(cnt >= 3)\n\t\t\t\tans = Math.max(ans, calc(r+1, c, 0));\n\t\t\telse \n\t\t\t\tans = Math.max(ans, calc(r+1, c, 0) + V[r][c]);\n\t\t}\n\t\tif(c+1 < C) {\n\t\t\tif(cnt >= 3)\n\t\t\t\tans = Math.max(ans, calc(r, c+1, cnt));\n\t\t\telse {\n\t\t\t\tif(V[r][c] != 0)\n\t\t\t\t\tans = Math.max(ans, calc(r, c+1, cnt+1) + V[r][c]);\n\t\t\t\tans = Math.max(ans, calc(r, c+1, cnt));\n\t\t\t}\n\t\t}\n//\t\tout.println(\"終了　r = \" + r + \" c = \" + c \n//\t\t\t\t\t\t+ \" cnt = \" + cnt + \" ans = \" + ans);\n\t\treturn memo[r][c][cnt] = ans;\n\t}\n\tpublic void solve() {\n\t\tR = ni();\n\t\tC = ni();\n\t\tK = ni();\n\t\tV = new int[R][C];\n\t\tint r, c;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tr = ni() - 1;\n\t\t\tc = ni() - 1;\n\t\t\tV[r][c] = ni();\n\t\t}\n\t\tmemo = new long[R][C][4];\n\t\tfor (int i = 0; i < R; i++) {\n\t\t\tfor (int j = 0; j < C; j++) {\n\t\t\t\tArrays.fill(memo[i][j], -1);\n\t\t\t}\n\t\t}\n\t\tout.println(calc(0,0,0));\n\t}\n\t// ------------------------------------------\n\t// ライブラリ\n\t// ------------------------------------------\n\t// Print\n\tprivate PrintWriter out = new PrintWriter(System.out);\n\t\n\t// Scanner\n\tprivate FastScanner scan = new FastScanner();\n\tint ni(){ return scan.nextInt();}\n\tint[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n\tint[][] ni(int y, int x){int[][] a = new int[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n\tlong nl(){return scan.nextLong();}\n\tlong[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n\tlong[][] nl(int y, int x){long[][] a = new long[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n\tString ns(){return scan.next();}\n\tString[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n\tString[][] ns(int y, int x){String[][] a = new String[y][x];\n\tfor(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n}\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n\tprivate static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n\tpublic boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n\tpublic String next() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tpublic long nextLong() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\tpublic double nextDouble() { return Double.parseDouble(next());}\n}\n", "R, C, K = map(int, input().split())\nV = [[0] * (R + 1) for _ in range(C + 1)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[c][r] = v\n\nX = [[0] * 4 for _ in range(R + 1)]\nfor i in range(1, C + 1):\n Vi = V[i]\n for j in range(1, R + 1):\n v = Vi[j]\n Xj = X[j]\n if v:\n Xj[3] = max(Xj[3], Xj[2] + v)\n Xj[2] = max(Xj[2], Xj[1] + v)\n Xj[0] = max(Xj[0], max(X[j-1]))\n Xj[1] = max(Xj[1], Xj[0] + v)\n else:\n Xj[0] = max(Xj[0], max(X[j-1]))\n\nprint(max(X[R]))", "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint r = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tArrayList<TreeMap<Integer, Integer>> list = new ArrayList<>();\n\t\tfor (int i = 0; i < r; i++) {\n\t\t list.add(new TreeMap<>());\n\t\t}\n\t\tfor (int i = 0; i < k; i++) {\n\t\t int x = sc.nextInt() - 1;\n\t\t int y = sc.nextInt() - 1;\n\t\t int v = sc.nextInt();\n\t\t list.get(x).put(y, v);\n\t\t}\n\t\tlong[][][] dp = new long[4][r][c];\n\t\tfor (int i = 0; i < r; i++) {\n\t\t for (int j = 0; j < c; j++) {\n\t\t if (i > 0) {\n\t\t dp[0][i][j] = dp[3][i - 1][j];\n\t\t }\n\t\t if (j > 0) {\n\t\t for (int l = 0; l < 4; l++) {\n\t\t dp[l][i][j] = Math.max(dp[l][i][j], dp[l][i][j - 1]);\n\t\t }\n\t\t }\n\t\t for (int l = 1; l < 4; l++) {\n\t\t dp[l][i][j] = Math.max(dp[l][i][j], dp[l - 1][i][j]);\n\t\t }\n\t\t if (list.get(i).containsKey(j)) {\n\t\t dp[3][i][j] = Math.max(dp[3][i][j], dp[2][i][j] + list.get(i).get(j));\n\t\t dp[2][i][j] = Math.max(dp[2][i][j], dp[1][i][j] + list.get(i).get(j));\n\t\t dp[1][i][j] = Math.max(dp[1][i][j], dp[0][i][j] + list.get(i).get(j));\n\t\t }\n\t\t }\n\t\t}\n\t\tSystem.out.println(dp[3][r - 1][c - 1]);\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint R,C,K;\nlong long r[200005],c[200005],v[200005];\nlong long a[3005][3005];\nlong long f[3005][3005][4];\nint main()\n{\n\tscanf(\"%d%d%d\",&R,&C,&K);\n\tfor(int i=1;i<=K;++i)\n\t{\n\t\tscanf(\"%lld%lld%lld\",&r[i],&c[i],&v[i]);\n\t\ta[r[i]][c[i]]+=v[i];\n\t}\n\tfor(int i=1;i<=R;++i)\n\t{\n\t\tfor(int j=1;j<=C;++j)\n\t\t{\n\t\t\tfor(int k=1;k<=3;++k)\n\t\t\t{\n\t\t\t\tif(k==1)\n\t\t\t\t{\n\t\t\t\t for(int s=1;s<=3;++s)\n\t\t\t\t f[i][j][k]=max(f[i][j][k],f[i-1][j][s]+a[i][j]);\n\t\t\t\t}\n\t\t\t\tf[i][j][k]=max(f[i][j][k],f[i][j-1][k]);\n\t\t\t\tf[i][j][k]=max(f[i][j][k],f[i][j-1][k-1]+a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tlong long ans=0;\n\tfor(int i=1;i<=3;++i)\n\t ans=max(ans,f[R][C][i]);\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}", "h,w,k=map(int,input().split())\ndp=[[[0]*(w+2) for _ in range(h+2)] for _ in range(4)]\nf=[[0]*(w+1) for _ in range(h+1)]\nfor _ in range(k):\n r,c,v=map(int,input().split())\n f[r][c]=v\nfor i in range(1,h+1):\n for j in range(1,w+1):\n for k in range(3,-1,-1):\n if k:dp[k][i][j]=max(dp[k][i][j],dp[k-1][i][j]+f[i][j])\n dp[0][i+1][j]=max(dp[0][i+1][j],dp[k][i][j])\n dp[k][i][j+1]=max(dp[k][i][j+1],dp[k][i][j])\nprint(max(dp[k][h][w] for k in range(4)))", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long int\nvector<ll>vec;\nll val[3009][3009];\nll dp[3009][3009][4];\nll n,m;\nll call(ll a,ll b,ll c)\n{\n if(b>m)\n {\n return 0;\n }\n if(a>n)\n {\n return 0;\n }\n if(dp[a][b][c]!=-1)\n {\n return dp[a][b][c];\n }\n ll x,y;\n x=y=0;\n if(c<2)\n {\n x=val[a][b]+call(a,b+1,c+1);\n y=val[a][b]+call(a+1,b,0);\n x=max(x,y);\n y=call(a,b+1,c);\n x=max(x,y);\n }\n else\n {\n x=val[a][b]+call(a+1,b,0);\n y=call(a,b+1,c);\n x=max(x,y);\n }\n\n return dp[a][b][c]=x;\n\n}\nint main()\n{\n ll a,b,c,d,e,i,j,k,l,x,y,t,p,r;\n cin>>n>>m>>k;\n for(i=1;i<=k;i++)\n {\n cin>>a>>b>>c;\n val[a][b]=c;\n }\n memset(dp,-1,sizeof(dp));\n x=call(1,1,0);\n cout<<x<<endl;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nint n,m,k,r,c,v,a[3005][3005];\nlong long ans,dp[3005][3005][5];\nint main()\n{\n\tcin>>n>>m>>k;\n\tfor(int i=1;i<=k;i++)\n\t{\n\t\tcin>>r>>c>>v;\n\t\ta[r][c]=v;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t\tfor(int j=1;j<=m;j++)\n\t\t{\n\t\t\tdp[i][j][0]=dp[i][j-1][0];\n\t\t\tfor(int k=0;k<=3;k++)\n\t\t\t{\n\t\t\t\tdp[i][j][0]=max(dp[i][j][0],dp[i-1][j][k]);\n\t\t\t\tdp[i][j][1]=max(dp[i][j][1],dp[i-1][j][k]+(long long)a[i][j]);\n\t\t\t}\n\t\t\tfor(int k=1;k<=3;k++)\n\t\t\t\tdp[i][j][k]=max(max(dp[i][j][k],dp[i][j-1][k]),dp[i][j-1][k-1]+(long long)a[i][j]);\n\t\t}\n\tfor(int i=0;i<=3;i++)\n\t\tans=max(ans,dp[n][m][i]);\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nll dp[3105][3105][5];\nll ara[3105][3105];\n\nll n,m,k;\n\nll call(ll i,ll j,ll tot)\n{\n if(i>n || j>m )\n return 0;\n\n ll &sum=dp[i][j][tot];\n\n\n if(~sum)\n return sum;\n\n sum=0;\n\n if(tot==3)\n {\n sum=(call(i+1,j,0));\n }\n else\n {\n if(ara[i][j]!=0)\n {\n sum=max(call(i,j+1,tot),max(ara[i][j]+call(i,j+1,tot+1),ara[i][j]+call(i+1,j,0)));\n }\n else\n {\n\n sum=max(call(i+1,j,0),call(i,j+1,tot));\n }\n }\n\n return sum;\n\n}\nint main()\n{\n memset(dp,-1,sizeof(dp));\n cin>>n>>m>>k;\n ll a,b,c;\n while(k--)\n {\n cin>>a>>b>>c;\n ara[a][b]=c;\n }\n cout<<call(0,0,0)<<endl;\n return 0;\n}\n", "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n static PrintWriter pw;\n static Scanner sc;\n static long[][][] dp;\n static TreeSet<Integer> arr[][];\n static long max, k, cost;\n static long ceildiv(long x, long y) { return (x+y-1)/y; }\n static int mod(long x, int m) { return (int)((x%m+m)%m); }\n static void put(TreeMap<Integer, Integer> map, Integer p){if(map.containsKey(p)) map.replace(p, map.get(p)+1); else map.put(p, 1); }\n static void rem(TreeMap<Integer, Integer> map, Integer p){ if(map.get(p)==1) map.remove(p);else map.replace(p, map.get(p)-1); }\n static long gcd(long x, long y) {return y==0?x:gcd(y, x%y);}\n static int Int(boolean x){ return x?1:0; }\n public static void main(String[] args) throws Exception {\n sc = new Scanner(System.in);\n pw=new PrintWriter(System.out);\n int r=sc.nextInt(), c=sc.nextInt(), k=sc.nextInt();\n arr=new TreeSet[r][c]; dp=new long[r][c][4];\n while(k-->0){\n int i=sc.nextInt()-1, j=sc.nextInt()-1, v=sc.nextInt();\n if(arr[i][j]==null)\n arr[i][j]=new TreeSet<>(Collections.reverseOrder());\n arr[i][j].add(v);\n }\n for(int i=0; i<r; i++){\n for(int j=0; j<c; j++)\n Arrays.fill(dp[i][j], -1);\n }\n pw.println(solve(0, 0, 3));\n pw.close();\n }\n static long solve(int i, int j, int rem){\n if(dp[i][j][rem]==-1){\n if(rem==0){\n dp[i][j][0]=i< arr.length-1?solve(i+1, j, 3):0;\n }else{\n dp[i][j][rem]=Math.max(i<arr.length-1?solve(i+1, j, 3):0, j<arr[0].length-1?solve(i, j+1, rem):0);\n if(arr[i][j]!=null){\n long sum=0;\n int cnt=0;\n for(int x: arr[i][j]){\n cnt++;\n sum+=x;\n if(cnt>rem)\n break;\n dp[i][j][rem]=Math.max(dp[i][j][rem], sum+Math.max(i<arr.length-1?solve(i+1, j, 3):0, j<arr[0].length-1?solve(i, j+1, rem-cnt):0));\n }\n }\n }\n }\n return dp[i][j][rem];\n }\n static void printArr(int[] arr) {\n for (int i = 0; i < arr.length - 1; i++)\n pw.print(arr[i] + \" \");\n pw.println(arr[arr.length - 1]);\n }\n static void printArr(long[] arr) {\n for (int i = 0; i < arr.length - 1; i++)\n pw.print(arr[i] + \" \");\n pw.println(arr[arr.length - 1]);\n }\n static void printArr(Integer[] arr) {\n for (int i = 0; i < arr.length; i++)\n pw.print(arr[i] + \" \");\n pw.println();\n }\n static void printArr(char[] arr) {\n for (int i = 0; i < arr.length; i++)\n pw.print(arr[i]==0? '1': arr[i]);\n pw.println();\n }\n static void printArr(ArrayList<Integer> list) {\n for (int i = 0; i < list.size(); i++)\n pw.print(list.get(i)+\" \");\n pw.println();\n }\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public Scanner(FileReader r) {\n br = new BufferedReader(r);\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public int[] nextArr(int n) throws IOException {\n int[] arr = new int[n];\n for (int i = 0; i < arr.length; i++)\n arr[i] = nextInt();\n return arr;\n }\n public Integer[] nextsort(int n) throws IOException{\n Integer[] arr=new Integer[n];\n for(int i=0; i<n; i++)\n arr[i]=nextInt();\n return arr;\n }\n public Pair nextPair() throws IOException{\n return new Pair(nextInt(), nextInt());\n }\n public Pair[] nextPairArr(int n) throws IOException{\n Pair[] arr=new Pair[n];\n for(int i=0; i<n; i++)\n arr[i]=nextPair();\n return arr;\n }\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n static class Pair implements Comparable<Pair>{\n int x;\n int y;\n public Pair(int x, int y) {\n this.x=x;\n this.y=y;\n }\n public int hashCode() {\n return (this.x*1000+this.y);\n }\n public int compareTo(Pair p){\n int min1=Math.min(x, y), min2=Math.min(p.x, p.y);\n if(min1!=min2)\n return min1-min2;\n if(x==p.x)\n return y-p.y;\n return x-p.x;\n }\n public boolean equals(Object obj) {\n if (obj == null) {\n return false;\n }\n if (this.getClass() != obj.getClass()) {\n return false;\n }\n Pair p = (Pair) obj;\n return this.x==p.x && this.y==p.y;\n }\n public Pair clone(){\n return new Pair(x, y);\n }\n public String toString(){\n return this.x+\" \"+this.y;\n }\n public void add(Pair p){\n x+=p.x;\n y+=p.y;\n }\n }\n static class Union{\n int[] rep, size;\n int sets;\n public Union(int n){\n rep=new int[n];\n size=new int[n];\n sets=n;\n Arrays.fill(size, 1);\n for(int i=0; i<n; i++)\n rep[i]=i;\n }\n public void join(int x, int y){\n int a=getSet(x), b=getSet(y);\n if(a==b) return;\n sets--;\n if(size[a]>size[b]){\n rep[b]=a;\n size[a]+=size[b];\n }else{\n rep[a]=b;\n size[b]+=size[a];\n }\n }\n public int getSet(int x){\n if(rep[x]==x)\n return x;\n return rep[x]=getSet(rep[x]);\n }\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nll dp[3003][3003][5];\nll item[3003][3003];\n\nvoid chmax(ll &a, ll b) {\n\ta = max(a, b);\n}\n\nint main() {\n\tint R, C, K;\n\tcin >> R >> C >> K;\n\tfor (int i = 0; i < K; i++) {\n\t\tint r, c, v;\n\t\tcin >> r >> c >> v;\n\t\titem[r - 1][c - 1] = v;\n\t}\n\n\tfor (int i = 0; i <= R; i++) {\n\t\tfor (int j = 0; j <= C; j++) {\n\t\t\tfor (int k = 2; k >= 0; k--) {\n\t\t\t\tchmax(dp[i][j][k + 1], dp[i][j][k] + item[i][j]);\n\t\t\t}\n\t\t\tfor (int k = 0; k <= 3; k++) {\n\t\t\t\tchmax(dp[i + 1][j][0], dp[i][j][k]);\n\t\t\t\tchmax(dp[i][j + 1][k], dp[i][j][k]);\n\t\t\t}\n\t\t}\n\t}\n\n\t\n\tll ans = -1;\n\tfor (int i = 0; i <= 3; i++) {\n\t\tans = max(ans, dp[R][C][i]);\n\t}\n\t\n\tcout << ans << endl;\n\treturn 0;\n}\n", "from copy import copy\n\nC,R,K=map(int,input().split())\ndp=[[0]*(R+1) for i1 in range(4)]\nM=[[0]*R for i in range(C)]\nfor i in range(K):\n r,c,v=map(int,input().split())\n M[r-1][c-1]=v\nfor i,l in enumerate(M):\n for num in range(1,4):\n for j in range(R):\n if num==1:\n dp[num][j]= max(dp[num][j-1],dp[num-1][j-1]+M[i][j])\n else:\n dp[num][j]= max(dp[num][j-1],dp[num-1][j],dp[num-1][j-1]+M[i][j])\n dp[0]=dp[-1][1:-1]+[0,dp[-1][0]]\n\nprint(dp[-1][-2])", "#include <bits/stdc++.h>\nusing namespace std;\n\n\nlong long dp[3005][3005][4];\n\nint main(){\n int R, C, K; cin >> R >> C >> K;\n vector<vector<long long>> table(R, vector<long long>(C));\n\n for(int i=0; i<K; ++i){\n int r, c, v;\n cin >> r >> c >> v;\n r--; c--;\n table[r][c] = v;\n }\n\n //init\n for(int i=0; i<R; ++i){\n for(int j=0; j<C; ++j){\n for(int k=0; k<3; ++k){\n //右に行く場合\n //使う場合\n dp[i][j+1][k+1] = max(dp[i][j+1][k+1], dp[i][j][k] + table[i][j]);\n //使わない場合\n dp[i][j+1][k+1] = max(dp[i][j+1][k+1], dp[i][j][k+1]);\n\n //下に行く場合\n dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j+1][k+1]);\n }\n }\n }\n\n cout << dp[R][C-1][0] << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)\n#define rep3(i, s, n) for (int i = (s); i <=(int) (n); i++)\n#define chmax(x,y) x = max(x,y)\n\n\tlong long a[3005][3005];\n\tlong long dp[3005][3005][5];\n\n\nint main() {\n\tint R,C,n;\n\tcin >> R >> C >> n;\n\n\trep(i, n) {\n\tint r,c,v;\n\t\tcin >> r >> c >> v;\n\t\ta[r-1][c-1]=v;\n\t}\n\n\trep(i,R){\n \t\trep(j,C) {\n\t\t\tfor (int k=2;k>=0; k--){\n\t\t\t\tchmax(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n\t\t\t}\n\t\t\trep(k,4) {\n\t\t\t\tchmax(dp[i+1][j][0],dp[i][j][k]);\n\t\t\t\tchmax(dp[i][j+1][k],dp[i][j][k]);\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\tlong long ans =0;\n\trep(k,4) chmax(ans,dp[R-1][C-1][k]);\n\n\tcout << ans << endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint n,m,k;\nlong long dp[3010][3010][5];\nint a,b;\nlong long v[3010][3010];\nint main(){\n\tcin>>n>>m>>k;\n\tlong long c;\n\tfor(int i=1;i<=k;i++){\n\t\tcin>>a>>b>>c;\n\t\tv[a][b]=c;\n\t}\n\tlong long mx=0;\n\tfor(int i=1;i<=n;i++){\n\t\tfor(int j=1;j<=m;j++){\n\t\t\tfor(int kk=1;kk<=3;kk++){\n\t\t\t\tdp[i][j][kk]=max(dp[i-1][j][3]+v[i][j],max(dp[i][j-1][kk-1]+v[i][j],dp[i][j-1][kk]));\n\t\t\t\tmx=max(mx,dp[i][j][kk]);\n\t\t\t}\n\t\t} \n\t}\n\tcout<<mx<<endl;\n\treturn 0;\n}", "from collections import defaultdict\nR, C, K = map(int, input().split())\nrc2v = defaultdict(int)\nfor _ in range(K):\n r, c, v = map(int, input().split())\n r-=1\n c-=1\n rc2v[(r, c)]=v\n\ndp = [0] * C\nfor r in range(R):\n dp_ = [[0] * C for _ in range(4)]\n for c in range(C):\n dp_[3][c] = max(dp_[3][c-1], dp[c])\n dp_[2][c] = dp_[2][c-1]\n dp_[1][c] = dp_[1][c-1]\n dp_[0][c] = dp_[0][c-1]\n if (r, c) in rc2v:\n dp_[0][c] = max(dp_[0][c-1], dp_[1][c]+rc2v[(r, c)])\n dp_[1][c] = max(dp_[1][c-1], dp_[2][c]+rc2v[(r, c)])\n dp_[2][c] = max(dp_[2][c-1], dp_[3][c]+rc2v[(r, c)])\n dp[c] = max(dp_[3][c], dp_[2][c], dp_[1][c], dp_[0][c])\n\nprint(dp[-1])\n", "import sys\nfrom itertools import product\ninput = lambda:sys.stdin.buffer.readline().rstrip()\n\nm, n, k = map(int, input().split())\ngrid = [[0] * n for _ in range(m)]\nfor _ in range(k):\n i, j, v = map(int, input().split())\n i -= 1; j -= 1\n grid[i][j] = v\n\ndp = [[0] * 4 for _ in range(n)]\nfor i in range(m):\n ndp = [[0] * 4 for _ in range(n)]\n for j, k in product(range(n), range(4)):\n # from top\n ndp[j][0] = max(ndp[j][0], dp[j][k])\n ndp[j][1] = max(ndp[j][1], dp[j][k] + grid[i][j])\n # from left\n if j > 0:\n ndp[j][k] = max(ndp[j][k], ndp[j - 1][k])\n if k > 0:\n ndp[j][k] = max(ndp[j][k], ndp[j - 1][k - 1] + grid[i][j])\n dp = ndp\n\nprint(max(dp[-1]))", "R, C, K = map(int, input().split())\n\nItems = [[0] * (C + 1) for _ in range(R + 1)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n Items[r][c] = v\n\n\nDP = [[0] * 4 for _ in range(R + 1)]\n\nfor x in range(1, C+1):\n for y in range(1, R+1):\n v = Items[y][x]\n if v:\n DP[y][3] = max(DP[y][3], DP[y][2] + v)\n DP[y][2] = max(DP[y][2], DP[y][1] + v)\n DP[y][1] = max(max(DP[y][1], DP[y][0] + v), max(DP[y-1]) + v)\n DP[y][0] = max(DP[y][0], max(DP[y-1]))\n else:\n DP[y][0] = max(DP[y][0], max(DP[y-1]))\n\nprint(max(DP[R]))", "#include <bits/stdc++.h>\nusing namespace std;\n\nvoid chmax(int64_t& a, int64_t b){\n a = max(a, b);\n}\n\nint main(){\n int N, M, K;\n cin >> N >> M >> K;\n static int A[3001][3001];\n while(K--){\n int a, b, c;\n cin >> a >> b >> c;\n A[a-1][b-1] = c;\n }\n\n static int64_t dp[3001][3001][5] = {0};\n dp[0][0][1] = A[0][0];\n for(int i=0; i<N; i++) for(int j=0; j<M; j++) for(int k=0; k<4; k++){\n chmax(dp[i+1][j][0], dp[i][j][k]);\n chmax(dp[i+1][j][1], dp[i][j][k] + A[i+1][j]);\n chmax(dp[i][j+1][k], dp[i][j][k]);\n chmax(dp[i][j+1][k+1], dp[i][j][k] + A[i][j+1]);\n }\n\n int64_t ans = 0;\n for(int k=0; k<=3; k++) chmax(ans, dp[N-1][M-1][k]);\n cout << ans << endl;\n return 0;\n}\n", "import sys\nfrom collections import defaultdict\nrange = xrange\ninput = raw_input\n\ninp = [int(x) for x in sys.stdin.read().split()]; ii = 0\n\nn = inp[ii]; ii += 1\nm = inp[ii]; ii += 1\nk = inp[ii]; ii += 1\n\nR = inp[ii + 0: ii + 3 * k: 3]\nC = inp[ii + 1: ii + 3 * k: 3]\nV = inp[ii + 2: ii + 3 * k: 3]\n\nitems = [defaultdict(list) for _ in range(n)]\nfor i in range(k):\n r = R[i] - 1\n c = C[i] - 1\n v = V[i]\n items[r][c].append(v)\n\nDP0 = [0] * m\nDP1 = [0] * m\nDP2 = [0] * m\nDP3 = [0] * m\n\nfor r in range(n):\n for c in range(m):\n if c:\n DP0[c] = max(DP0[c], DP0[c - 1])\n DP1[c] = max(DP1[c], DP1[c - 1])\n DP2[c] = max(DP2[c], DP2[c - 1])\n DP3[c] = max(DP3[c], DP3[c - 1])\n if c in items[r]:\n for v in items[r][c]:\n DP3[c] = max(DP3[c], DP2[c] + v)\n DP2[c] = max(DP2[c], DP1[c] + v)\n DP1[c] = max(DP1[c], DP0[c] + v)\n for c in range(m):\n DP0[c] = max(DP0[c], DP1[c], DP2[c], DP3[c])\nprint DP0[-1] \n", "#include<bits/stdc++.h>\nusing namespace std;\nlong long DP[3030][3030][5];\nlong long val[3030][3030];\nint main()\n{\n\tint R,C,N;\n\tcin>>R>>C>>N;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tint x,y,v;\n\t\tcin>>x>>y>>v;\n\t\tval[x][y]=v;\n\t}\n\tif(val[1][1])\n\t\tDP[1][1][1]=val[1][1];\n\tfor(int i=1;i<=R;i++)\n\t\tfor(int j=1;j<=C;j++)\n\t\t\tfor(int k=0;k<=3;k++)\n\t\t\t{\n\t\t\t\tif(j<C)\n\t\t\t\t{\n\t\t\t\t\tDP[i][j+1][k]=max(DP[i][j+1][k],DP[i][j][k]);\n\t\t\t\t\tif(val[i][j+1])\n\t\t\t\t\t\tDP[i][j+1][k+1]=max(DP[i][j+1][k+1],DP[i][j][k]+val[i][j+1]);\n\t\t\t\t}\n\t\t\t\tif(i<R)\n\t\t\t\t{\n\t\t\t\t\tDP[i+1][j][0]=max(DP[i+1][j][0],DP[i][j][k]);\n\t\t\t\t\tif(val[i+1][j])\n\t\t\t\t\t\tDP[i+1][j][1]=max(DP[i+1][j][1],DP[i][j][k]+val[i+1][j]);\n\t\t\t\t}\n\t\t\t}\n\tcout<<max(max(DP[R][C][0],DP[R][C][1]),max(DP[R][C][2],DP[R][C][3]))<<endl;\n\treturn 0;\n}", "f=lambda:map(int,input().split())\nR,C,K=f()\ng=[[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r,c,v=f()\n g[r][c]=v\ndp=[[[0]*(C+2) for _ in range(R+2)] for _ in range(4)]\nfor i in range(1,R+1):\n for j in range(1,C+1):\n for k in range(3,-1,-1):\n if k: dp[k][i][j]=max(dp[k][i][j],dp[k-1][i][j]+g[i][j])\n dp[0][i+1][j]=max(dp[0][i+1][j],dp[k][i][j])\n dp[k][i][j+1]=max(dp[k][i][j+1],dp[k][i][j])\nprint(max(dp[k][R][C] for k in range(4)))", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MAXN = 3000 + 10;\n\ntypedef long long ll;\n\nint n, m, k, val[MAXN][MAXN];\nll f[4][MAXN][MAXN];\n\nint main() {\n\tscanf(\"%d %d %d\", &n, &m, &k);\n\tfor (int i = 1; i <= k; ++i) {\n\t\tint x, y, _val; scanf(\"%d %d %d\", &x, &y, &_val);\n\t\tval[x][y] = _val;\n\t}\n\tfor (int i = 1; i <= n; ++i) {\n\t\tfor (int j = 1; j <= m; ++j) {\n\t\t\tfor (int pre = 0; pre <= 3; ++pre) f[0][i][j] = max(f[0][i][j], f[pre][i - 1][j]), f[1][i][j] = max(f[1][i][j], f[pre][i - 1][j] + val[i][j]);\n\t\t\tf[0][i][j] = max(f[0][i][j], f[0][i][j - 1]);\n\t\t\tfor (int cnt = 1; cnt <= 3; ++cnt) {\n\t\t\t\tf[cnt][i][j] = max(f[cnt][i][j], max(f[cnt][i][j - 1], f[cnt - 1][i][j - 1] + val[i][j]));\n\t\t\t}\n\t\t}\n\t}\n\tll ans = 0;\n\tfor (int cnt = 0; cnt <= 3; ++cnt) ans = max(ans, f[cnt][n][m]);\n\tprintf(\"%lld\\n\", ans);\n\treturn 0;\n}", "R,C,K = map(int, input().split())\n\nd = [[0 for _ in range(C+1)] for _ in range(R+1)]\n\n#dp[行の中でピックした回数][行][列]　この順じゃないとTLEする\ndp = [[[0 for _ in range(C+1)] for _ in range(R+1)] for _ in range(4)]\n\nfor i in range(K):\n r, c, v = map(int, input().split())\n d[r-1][c-1] = v\nfor i in range(R):\n for j in range(C):\n # kが大きい方からやらないとダメ。01ナップサックと同じ考え方。書き換えられた値を見ないように。\n for k in range(2, -1, -1):\n # 拾う遷移。d[i][j]を取るかどうかという判定\n dp[k+1][i][j] = max(dp[k+1][i][j], dp[k][i][j] + d[i][j])\n for k in range(4):\n dp[0][i+1][j] = max(dp[0][i+1][j], dp[k][i][j])\n dp[k][i][j+1] = max(dp[k][i][j+1], dp[k][i][j])\nans = 0\n\nfor k in range(4):\n ans = max(ans, dp[k][R-1][C-1])\nprint(ans) ", "import sys\ninput=sys.stdin.readline\nr,c,k=map(int,input().split())\nl=[0]*((r+1)*(c+1))\nfor i in range(k):\n a1,a2,a3=map(int,input().split())\n l[a1*(c+1)+a2]=a3\ndp0=[[0 for i in range(c+1)] for j in range(r+1)]\ndp1=[[0 for i in range(c+1)] for j in range(r+1)]\ndp2=[[0 for i in range(c+1)] for j in range(r+1)]\ndp3=[[0 for i in range(c+1)] for j in range(r+1)]\nfor i in range(r):\n for j in range(c):\n x=l[i*(c+1)+j+1]\n y=l[(i+1)*(c+1)+j]\n dp3[i+1][j+1]=max(dp2[i][j+1]+x,dp3[i][j+1],dp2[i+1][j]+y,dp3[i+1][j])\n dp2[i+1][j+1]=max(dp2[i][j+1]+x,dp3[i][j+1],dp1[i+1][j]+y,dp2[i+1][j])\n dp1[i+1][j+1]=max(dp2[i][j+1]+x,dp3[i][j+1],dp0[i+1][j]+y,dp1[i+1][j])\n dp0[i+1][j+1]=max(dp2[i][j+1]+x,dp3[i][j+1],dp0[i+1][j])\nz=l[r*(c+1)+c]\nprint(max(dp2[r][c]+z,dp3[r][c]))", "\nR, C, K = map(int, input().split())\nX = [list(map(int, input().split())) for _ in range(K)]\n\nitems = [[0] * (C + 1) for _ in range(R + 1)]\nfor r, c, v in X:\n items[r][c] = v\n\ndp = [[0] * 4 for _ in range(C + 1)]\nfor i in range(1, R + 1):\n # Vertical transition\n for j in range(1, C + 1):\n dp[j][0] = max(dp[j])\n for k in range(1, 4):\n dp[j][k] = 0\n\n # Horizontal or picking-up transition\n for j in range(1, C + 1):\n for k in reversed(range(4)):\n dp[j][k] = max(dp[j][k], dp[j - 1][k])\n if items[i][j] and k < 3:\n dp[j][k + 1] = max(dp[j][k + 1], dp[j][k] + items[i][j])\n\nprint(max(dp[-1]))\n", "#include <iostream>\n#include <algorithm>\nusing namespace std;\n#define ll long long int\nstruct goods{\n ll x, y, val;\n};\nll dp[3001][3001][4], val[3001][3001];\nint main(){\n ll r, c, n, x, y, ans=0;\n cin>>r>>c>>n;\n for (ll i=1; i<=n; i++) cin>>x>>y, cin>>val[x][y];\n for (ll i=1; i<=r; i++){\n for (ll j=1; j<=c; j++){\n for (ll k=3; k>=0; k--){\n dp[i][j][k]=max(dp[i][j][k], max(dp[i-1][j][3], dp[i][j-1][k]));\n if (k!=3) dp[i][j][k+1]=max(dp[i][j][k+1], dp[i][j][k]+val[i][j]);\n }\n }\n }\n for (ll i=0; i<=3; i++) ans=max(ans, dp[r][c][i]);\n cout<<ans<<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int M = 3e3;\nint n, m, mat[M][M];\nlong long memo[M][M][4];\n\nlong long solve(int i, int j, int cnt) {\n if (i == n || j == m)\n return 0;\n long long &r = memo[i][j][cnt];\n if (r == -1) {\n r = max(solve(i + 1, j, 0), solve(i, j + 1, cnt));\n if (cnt < 3 && mat[i][j])\n r = max(r, mat[i][j] + max(solve(i + 1, j, 0), solve(i, j + 1, cnt + 1)));\n }\n return r;\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n\n memset(memo, -1, sizeof memo);\n int k;\n cin >> n >> m >> k;\n while (k--) {\n int i, j, x;\n cin >> i >> j >> x;\n mat[i - 1][j - 1] = x;\n }\n cout << solve(0, 0, 0) << '\\n';\n}", "r,c,k=map(int,input().split())\nlst=[[0]*(c+1) for i in range(r+1)]\nfor i in range(k):\n s,t,u=map(int,input().split())\n lst[s][t]=u\n\n\ndp1=[[0]*(c+1) for i in range(r+1)]\ndp2=[[0]*(c+1) for i in range(r+1)]\ndp3=[[0]*(c+1) for i in range(r+1)]\n\nfor i in range(1,r+1):\n for j in range(1,c+1):\n dp1[i][j]=max(dp1[i][j-1],dp1[i-1][j]+lst[i][j],dp2[i-1][j]+lst[i][j],dp3[i-1][j]+lst[i][j])\n dp2[i][j]=max(dp2[i][j-1],dp1[i][j-1]+lst[i][j])\n dp3[i][j]=max(dp3[i][j-1],dp2[i][j-1]+lst[i][j])\n\nprint(max(dp1[-1][-1],dp2[-1][-1],dp3[-1][-1],0))\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int R,C,K;\n cin >> R >> C >> K;\n\n vector<vector<int>> m(R, vector<int>(C));\n vector<vector<vector<long long>>> s(R+1, vector<vector<long long>>(C+1 ,vector<long long>(4)));\n\n int r,c,v;\n for(int i=0;i<K;i++){\n cin >> r >> c >> v;\n m[r-1][c-1] = v;\n }\n\n for(int i=0;i<R;i++){\n for(int j=0;j<C;j++){\n for(int k=2;k>=0;k--){\n\ts[i][j][k+1]=max(s[i][j][k+1],s[i][j][k]+m[i][j]);\n }\n for(int k=0;k<4;k++){\n\ts[i+1][j][0]=max(s[i+1][j][0], s[i][j][k]);\n\ts[i][j+1][k]=max(s[i][j+1][k], s[i][j][k]);\n }\n }\n }\n\n long long ans=0;\n for(int k=0;k<4;k++){\n ans=max(ans,s[R-1][C-1][k]);\n // cout << ans << endl;\n }\n cout << ans << endl;\n return 0;\n}\n", "#include <iostream>\nusing namespace std;\n\nlong long r, c, k, a, b, w, g[3005][3005], dp[3005][3005][5];\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cin >> r >> c >> k;\n for (int i = 0; i < k; i++){\n cin >> a >> b >> w;\n g[a][b] = w;\n }\n for (int i = 1; i <= r; i++){\n for (int j = 1; j <= c; j++){\n dp[i][j][0] = max(dp[i][j-1][0], dp[i-1][j][4]);\n dp[i][j][1] = max(dp[i][j-1][1], dp[i-1][j][4]+g[i][j]);\n dp[i][j][2] = max(dp[i][j-1][2], dp[i][j-1][1]+g[i][j]);\n dp[i][j][3] = max(dp[i][j-1][3], dp[i][j-1][2]+g[i][j]);\n dp[i][j][4] = max(max(dp[i][j][0], dp[i][j][1]), max(dp[i][j][2], dp[i][j][3]));\n }\n }\n cout << dp[r][c][4] << \"\\n\";\n}\n", "import java.io.DataInputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Main {\n static class Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[1_000_000]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.') {\n while ((c = read()) >= '0' && c <= '9') {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null)\n return;\n din.close();\n }\n }\n\n void solve(Reader sc, PrintWriter pw) throws IOException {\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n R++;\n C++;\n Map<Integer, Integer> values = new HashMap<>();\n for (int i = 0; i < K; i++) {\n int r = sc.nextInt();\n int c = sc.nextInt();\n int v = sc.nextInt();\n values.put(r * C + c, v);\n }\n\n long[][][] dp = new long[4][R][C];\n// long INF = Long.MAX_VALUE / 10;\n// for (long[][] arrs : dp) {\n// for (long[] arr : arrs) {\n// Arrays.fill(arr, INF);\n// }\n// }\n// dp[0][0][0] = 0;\n\n long result = 0;\n for (int row = 0; row < R; row++) {\n for (int col = 0; col < C; col++) {\n for (int rowCnt = 0; rowCnt <= 3; rowCnt++) {\n// if (dp[rowCnt][row][col] == INF) {\n// continue;\n// }\n //no pickup\n // go right\n if (col + 1 < C) {\n dp[rowCnt][row][col + 1] = Math.max(dp[rowCnt][row][col + 1], dp[rowCnt][row][col]);\n }\n if (row + 1 < R) {\n dp[0][row + 1][col] = Math.max(dp[0][row + 1][col], dp[rowCnt][row][col]);\n }\n\n // pickup\n int key = row * C + col;\n if (values.containsKey(key)) {\n int value = values.get(key);\n // go right\n if (rowCnt < 3) {\n if (col + 1 < C) {\n dp[rowCnt + 1][row][col + 1] = Math.max(dp[rowCnt + 1][row][col + 1], dp[rowCnt][row][col] + value);\n }\n\n if (row + 1 < R) {\n dp[0][row + 1][col] = Math.max(dp[0][row + 1][col], dp[rowCnt][row][col] + value);\n }\n }\n }\n }\n }\n }\n\n for (int i = 0; i <= 3; i++) {\n result = Math.max(result, dp[i][R-1][C - 1] + ((i < 3) ? values.getOrDefault(R * C - 1, 0) : 0));\n }\n pw.println(result);\n }\n\n public static void main(String[] args) throws IOException {\n Reader sc = new Reader();\n// PrintWriter pw = new PrintWriter(System.out);\n PrintWriter pw = new PrintWriter(System.out, true);\n new Main().solve(sc, pw);\n pw.flush();\n pw.close();\n sc.close();\n }\n}\n\n\n", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint R = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tlong val[][] = new long[R][C];\n\t\tfor(int k = 0 ; k < K; ++k){\n\t\t\tint r = sc.nextInt() - 1;\n\t\t\tint c = sc.nextInt() - 1;\n\t\t\tlong v = sc.nextLong();\n\t\t\tval[r][c] = v;\t\t\t\n\t\t}\n\t\tlong prev[] = new long[C];\n\t\tfor(int i = 0 ; i < R ; ++i){\n\t\t\tlong dp[][] = new long[C][4];\n\t\t\tfor(int j = 0 ; j < C ; ++j){\t\t\t\t\n\t\t\t\tdp[j][0] = prev[j];\n\t\t\t\tdp[j][1] = prev[j] + val[i][j];\n\t\t\t\tif(j > 0){\n\t\t\t\t\tdp[j][0] = Math.max(dp[j][0], dp[j - 1][0]);\n\t\t\t\t\tdp[j][1] = Math.max(dp[j - 1][0] + val[i][j] , dp[j][1]);\n\t\t\t\t\tdp[j][1] = Math.max(dp[j - 1][1], dp[j][1]);\n\t\t\t\t\tdp[j][2] = Math.max(dp[j - 1][2], dp[j - 1][1] + val[i][j]);\n\t\t\t\t\tdp[j][3] = Math.max(dp[j - 1][3], dp[j - 1][2] + val[i][j]);\n\t\t\t\t}\n\t\t\t\tprev[j] = Math.max(Math.max(dp[j][0], dp[j][1]) , Math.max(dp[j][2], dp[j][3]));\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(prev[C - 1]);\n\t}\n}\n", "/**\n * author: RM07\n * created: August 15, 2020 7:00 PM\n * motto: Knowledge is Power, Strive for Excellence\n**/\n#include<bits/stdc++.h>\nusing namespace std;\nconst int maxn=3009;\n \nint n,m,K;\n \nint a[maxn][maxn];\n \nlong long f[maxn][maxn][4];\n \nint main(){\n\tcin>>n>>m>>K;\n\twhile(K--){\n\t\tint x,y,z;scanf(\"%d%d%d\",&x,&y,&z);\n\t\ta[x][y]=z;\n\t}\n\tfor(int i=1;i<=n;++i){\n\t\tfor(int j=1;j<=m;++j){\n\t\t\tfor(int k=0;k<=3;++k){\n\t\t\t\tlong long t=max(max(f[i-1][j][0],f[i-1][j][1]),max(f[i-1][j][2],f[i-1][j][3]));\n\t\t\t\tf[i][j][k]=max(f[i][j-1][k],t);\n\t\t\t\tif(k)f[i][j][k]=max(f[i][j-1][k-1]+a[i][j],f[i][j][k]);\n\t\t\t\tif(k)f[i][j][k]=max(f[i][j][k],t+a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",max(max(f[n][m][0],f[n][m][1]),max(f[n][m][2],f[n][m][3])));\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nll dp[3001][3001][4], a[3001][3001];\n\nint main() {\n ll r,c,items, x , y, v, maxi = 0;\n cin >> r >> c >> items;\n while(items--) {\n \tcin >> x >> y >> v;\n \ta[x-1][y-1]=v;\n }\n for(int i=0;i<r;i++) for(int j=0;j<c;j++) {\n for(int k=2;k>=0;k--) {\n dp[i][j][k+1]=max(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n }\n for(int k=0;k<4;k++) {\n if(j+1!=c) dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n if(i+1!=r) dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n }\n }\n for(int i=0;i<r;i++) for(int j=0;j<c;j++) for(int k=0;k<4;k++) maxi=max(maxi,dp[i][j][k]);\n cout << maxi;\n\treturn 0;\n}", "R,C,K = map(int,input().split())\n\ngrid=[[0]*C for _ in range(R)]\nfor i in range(K):\n x,y,v = map(int,input().split())\n grid[x-1][y-1] = v\n\n\ndp0 = [[0]*(C+1) for _ in range(R+1)]\ndp1 = [[0]*(C+1) for _ in range(R+1)]\ndp2 = [[0]*(C+1) for _ in range(R+1)]\ndp3 = [[0]*(C+1) for _ in range(R+1)]\n\nfor i in range(R):\n for j in range(C):\n dp1[i][j] = max(dp1[i][j-1],dp1[i-1][j]+grid[i][j],\n dp2[i-1][j]+grid[i][j],dp3[i-1][j]+grid[i][j])\n dp2[i][j] = max(dp2[i][j-1],dp1[i][j-1]+grid[i][j])\n dp3[i][j] = max(dp3[i][j-1],dp2[i][j-1]+grid[i][j])\nans=max(dp1[R-1][C-1],dp2[R-1][C-1],dp3[R-1][C-1])\nprint(ans)", "R, C, K = map(int, input().split())\nRC = [[0] * C for _ in range(R)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n RC[r-1][c-1] = v\n\n\ndef solve():\n memo = [[0] * 4 for _ in range(C+1)]\n prev = [[0] * 4 for _ in range(C+1)]\n for r in range(1,R+1):\n prev, memo = memo, prev\n for c in range(1,C+1):\n v = RC[r-1][c-1]\n memo[c][0] = max(prev[c][3], memo[c-1][0])\n memo[c][1] = max(memo[c][0] + v, memo[c-1][1])\n memo[c][2] = max(memo[c][1], memo[c-1][1] + v, memo[c-1][2])\n memo[c][3] = max(memo[c][2], memo[c-1][2] + v, memo[c-1][3])\n return memo[-1][3]\n\nif __name__ == \"__main__\":\n print(solve())\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nll dp[3010][3010][4];\nll pt[3010][3010];\n\nint main()\n{\n\tll r,c,k;\n\tcin >> r >> c >> k;\n\tfor(int i = 0;i<k;i++)\n\t{\n\t\tll r,c,v;\n\t\tcin >> r >> c >> v;\n\t\tr--;c--;\n\t\tpt[r][c]=v;\n\t}\n\tfor(int i = 0;i<r;i++)\n\t{\n\t\tfor(int j = 0;j<c;j++)\n\t\t{\n\n\t\t\tfor(int k = 0;k<=3;k++)\n\t\t\t{\n\t\t\t\tif(pt[i][j])dp[i+1][j+1][1] = max(dp[i+1][j+1][1],dp[i][j+1][k]+pt[i][j]);\n\t\t\t\t dp[i+1][j+1][0] = max(dp[i+1][j+1][0],dp[i][j+1][k]);\n\t\t\t}\n\t\t\tfor(int k = 0;k<=3;k++)\n\t\t\t{\n\t\t\t\tif(pt[i][j])\n\t\t\t\t{\n\t\t\t\t\tif(k<3)dp[i+1][j+1][k+1] = max(dp[i+1][j+1][k+1],dp[i+1][j][k]+pt[i][j]);\n\t\t\t\t}\n\t\t\t\tdp[i+1][j+1][k] = max(dp[i+1][j+1][k],dp[i+1][j][k]);\n\t\t\t}\n\t\t}\n\t}\n\tll ans = 0;\n\tfor(int i = 0;i<=3;i++)ans = max(dp[r][c][i],ans);\n\tcout<<ans<<endl;\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n \nll dp[3001][3001][3], a[3001][3001];\n \nint main() {\n ll r,c,items, x , y, v, maxi = 0;\n cin >> r >> c >> items;\n while(items--) {\n \tcin >> x >> y >> v;\n \tx--, y--;\n \tdp[x][y][0] = a[x][y] = v;\n }\n for(int i=0;i<r;i++) for(int j=0;j<c;j++) {\n for(int k=0;k<3;k++) {\n if(k > 0) dp[i][j][k] = max(dp[i][j][k], dp[i][j][k-1]);\n if(j+1 < c) dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k]);\n if(j+1 < c && k > 0) dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k-1] + a[i][j+1]);\n }\n if(i+1 < r) dp[i+1][j][0] = dp[i+1][j][1] = dp[i+1][j][2] = max({dp[i][j][0], dp[i][j][1], dp[i][j][2]}) + a[i+1][j];\n }\n maxi = dp[r-1][c-1][2];\n cout << maxi;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint R, C;\nint V[3005][3005];\nint64_t dp[5][3005][3005];\n\nint64_t f(int rem, int r, int c) {\n\tif (r == R && c == C) {\n\t\tif (rem) return V[r][c];\n\t\treturn 0;\n\t}\n\tif (dp[rem][r][c] != -1) return dp[rem][r][c];\n\tint64_t ans = -1e18;\n\tif (c < C) ans = max(ans, f(rem, r, c+1));\n\tif (r < R) ans = max(ans, f(3, r+1, c));\n\tif (rem && V[r][c]) {\n\t\tif (c < C) ans = max(ans, f(rem-1, r, c+1)+V[r][c]);\n\t\tif (r < R) ans = max(ans, f(3, r+1, c)+V[r][c]);\n\t}\n\treturn dp[rem][r][c] = ans;\n}\n\nint main() {\n\tint K;\n\tcin >> R >> C >> K;\n\tfor (int i = 0 ; i < K; ++i) {\n\t\tint r, c, v;\n\t\tcin >> r >> c >> v;\n\t\tV[r][c] = v;\n\t}\n\tmemset(dp, -1, sizeof dp);\n\tcout << f(3, 1, 1) << endl;\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define chmax(x, y) x = max(x, y)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main(){\n int r, c, k; cin >> r >> c >> k;\n rep(i, k){\n int ri, ci, v; cin >> ri >> ci >> v;\n a[ri - 1][ci - 1] = v;\n }\n\n rep(i, r){\n rep(j, c){\n for(int k = 2; k >= 0; k--){\n chmax(dp[i][j][k + 1], dp[i][j][k] + a[i][j]);\n }\n rep(k, 4){\n chmax(dp[i + 1][j][0], dp[i][j][k]);\n chmax(dp[i][j + 1][k], dp[i][j][k]);\n }\n }\n }\n\n ll ans = 0;\n rep(k, 4) chmax(ans, dp[r - 1][c - 1][k]);\n cout << ans << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 3005;\nlong long dp[N][N][4];\nint v[N][N];\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0), cout.tie(0);\n\n int r, c, k;\n cin >> r >> c >> k;\n while (k--) {\n int x, y;\n cin >> x >> y >> v[x][y];\n }\n for (int i = 1; i <= r; ++i) {\n for (int j = 1; j <= c; ++j) {\n for (int jj = 0; jj < 4; ++jj) dp[i][j][0] = max(dp[i][j][0], dp[i - 1][j][jj]), dp[i][j][1] = max(dp[i][j][1], dp[i - 1][j][jj] + v[i][j]);\n for (int ii = 0; ii < 4; ++ii) {\n dp[i][j][ii] = max(dp[i][j][ii], dp[i][j - 1][ii]);\n if (ii) dp[i][j][ii] = max(dp[i][j][ii], dp[i][j - 1][ii - 1] + v[i][j]);\n }\n }\n }\n long long ans = 0;\n for (int i = 0; i < 4; ++i) ans = max(ans, dp[r][c][i]);\n cout << ans;\n\n return 0;\n}\n", "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n R, C, K, *RCV = map(int, read().split())\n\n item = dict()\n for r, c, v in zip(*[iter(RCV)] * 3):\n item[(r - 1, c - 1)] = v\n\n dp = [0] * (C + 1)\n for i in range(R):\n dp, dp_prev = [0] * (C + 1), dp\n v = [0] * 4\n for j in range(C):\n for k in range(4):\n if v[k] < dp_prev[j + 1]:\n v[k] = dp_prev[j + 1]\n if (i, j) in item:\n for k in range(2, -1, -1):\n if v[k + 1] < v[k] + item[(i, j)]:\n v[k + 1] = v[k] + item[(i, j)]\n dp[j + 1] = v[3]\n\n print(dp[C])\n\n return\n\n\nif __name__ == '__main__':\n main()\n", "R, C, K = map(int, input().split())\nxy = [[0] * (C + 1) for _ in range(R + 1)]\nfor _ in range(K) :\n r, c, v = map(int, input().split())\n xy[r - 1][c - 1] = v\n\ndp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]\nfor cy in range(R + 1) :\n for cx in range(C + 1) :\n if cx < C :\n dp[0][cy][cx + 1] = max(dp[0][cy][cx + 1], dp[0][cy][cx])\n dp[1][cy][cx + 1] = max(dp[1][cy][cx + 1], dp[0][cy][cx] + xy[cy][cx], dp[1][cy][cx])\n dp[2][cy][cx + 1] = max(dp[2][cy][cx + 1], dp[1][cy][cx] + xy[cy][cx], dp[2][cy][cx])\n dp[3][cy][cx + 1] = max(dp[3][cy][cx + 1], dp[2][cy][cx] + xy[cy][cx], dp[3][cy][cx])\n if cy < R :\n dp[0][cy + 1][cx] = max(dp[i][cy][cx] for i in range(3)) + xy[cy][cx]\n dp[0][cy + 1][cx] = max(dp[0][cy + 1][cx], dp[3][cy][cx])\n\nprint(max(dp[i][-1][-1] for i in range(4)))", "// E - Picking Goods\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define chmax(x,y) x=max(x,(y))\n\nint V[3000+1][3000+1];\nll dp[3000+1][3000+1][3+1];\n\nint main(){\n\tint R, C, K; cin>>R>>C>>K;\n\n\trep(i, K){\n\t\tint r, c, v; cin>>r>>c>>v;\n\t\tV[r][c] = v;\n\t}\n\n\trep(i, R+1) rep(j, C+1) rep(k, 3+1){\n\t\tif(i-1 >= 0){\n\t\t\tchmax(dp[i][j][0], dp[i-1][j][k]);\n\t\t\tchmax(dp[i][j][1], dp[i-1][j][k] + V[i][j]);\n\t\t}\n\t\tif(j-1 >= 0){\n\t\t\tchmax(dp[i][j][k], dp[i][j-1][k]);\n\t\t\tif(k-1 >= 0) chmax(dp[i][j][k], dp[i][j-1][k-1] + V[i][j]);\n\t\t}\n\t}\n\n\tll ans = 0;\n\trep(k, 3+1) chmax(ans, dp[R][C][k]);\n\tcout<< ans <<endl;\n}\n", "from sys import stdin\nreadline = stdin.readline\n\nR, C, K = map(int, readline().split())\n\ngoods = [[0] * C for _ in range(R)]\nfor _ in range(K):\n r, c, v = map(int, readline().split())\n goods[r - 1][c - 1] = v\n\nn = [0] * (C + 1)\nfor i in range(R):\n c = [0] * 4\n c[0] = n[0]\n for j in range(C):\n if goods[i][j] != 0:\n for k in range(2, -1, -1):\n if c[k] + goods[i][j] > c[k + 1]:\n c[k + 1] = c[k] + goods[i][j]\n for k in range(4):\n if c[k] > n[j]:\n n[j] = c[k]\n if n[j + 1] > c[0]:\n c[0] = n[j + 1]\n\nprint(max(c))\n", "R,C,K=map(int,input().split())\n\nValue=[[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r,c,v=map(int,input().split())\n Value[r][c]=v\n\nDP=[[0,0,0,0] for _ in range(C+1) ]\n\nfor y in range(1,R+1):\n #下に移動\n for x in range(1,C+1):\n DP[x][0]=max(DP[x])\n DP[x][1]=DP[x][0]+Value[y][x]\n DP[x][2]=DP[x][3]=0\n\n #右に移動\n for x in range(1,C+1):\n for k in range(0,3+1):\n DP[x][k]=max(DP[x][k],DP[x-1][k])\n\n for k in range(1,3+1):\n DP[x][k]=max(DP[x][k],DP[x-1][k-1]+Value[y][x])\n\nprint(max(DP[-1]))", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int MAX = 3050;\nint r,c,k,x,y,val;\nll dp[MAX][MAX][4];\nll room[MAX][MAX];\nint main() {\n cin>>r>>c>>k;\n while(k--){\n cin>>x>>y>>val;\n room[x][y]=val;\n }\n for(int i=1;i<=r;i++){\n for(int j=1;j<=c;j++){\n for(int k=1;k<=3;k++){\n dp[i][j][k]=max(max(dp[i-1][j][3],dp[i][j-1][k]),room[i][j]+max(dp[i][j-1][k-1],dp[i-1][j][3]));\n }\n }\n }\n cout<<dp[r][c][3];\n return 0;\n}\n", "R,C,K=map(int,input().split())\nl=[[0] * C for i in range(R)]\nfor i in range(K):\n a,b,c=map(int,input().split())\n a-=1\n b-=1\n l[a][b]=c\ndp=[0]*C\nfor i in range(R):\n ndp=[0]*C\n kdp=[0]*4\n for j in range(0,C):\n kdp[0]=max(kdp[0],dp[j])\n for k in range(2,-1,-1):\n kdp[k+1]=max(kdp[k+1],kdp[k]+l[i][j])\n ndp[j]=max(kdp)\n dp=ndp\nprint(dp[C-1])\n", "R,C,K = map(int,input().split())\nV = [[0 for c in range(C+1)] for r in range(R+1)]\nfor i in range(K):\n\tr,c,v = map(int,input().split())\n\tV[r][c] = v\n\ndp = [[0 for i in range(4)] for j in range(C+1)]\nfor r in range(1, R+1):\n\tfor c in range(1, C+1):\n\t\tv = V[r][c]\n\t\tunder_val = max(dp[c])\n\t\tdp[c][0] = max(under_val, dp[c-1][0])\n\t\tif v > 0:\n\t\t\tdp[c][1] = max(under_val + v, dp[c-1][0] + v, dp[c-1][1])\n\t\t\tdp[c][2] = max(dp[c-1][1] + v, dp[c-1][2])\n\t\t\tdp[c][3] = max(dp[c-1][2] + v, dp[c-1][3])\n\t\telse:\n\t\t\tdp[c][1] = dp[c-1][1]\n\t\t\tdp[c][2] = dp[c-1][2]\n\t\t\tdp[c][3] = dp[c-1][3]\nprint(max(dp[-1]))", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define chmax(x,y) x = max(x,y)\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n int R, C, n;\n cin >> R >> C >> n;\n\n rep(i,n){\n int r,c,v;\n cin >> r>>c>>v;\n a[r-1][c-1]=v;\n }\n rep(i,R)rep(j,C){\n for(int k=2;k>=0;k--){\n chmax(dp[i][j][k+1], dp[i][j][k]+a[i][j]);\n }\n rep(k,4){\n chmax(dp[i+1][j][0], dp[i][j][k]);\n chmax(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n ll ans=0;\n rep(k,4){\n chmax(ans, dp[R-1][C-1][k]);\n }\n cout << ans << endl;\n return 0;\n}\n", "r,c,k=map(int, input().split())\ngrid=[[0]*(c+1) for _ in range(r+1)]\nfor i in range(k):\n ri,ci,vi=map(int, input().split())\n grid[ri][ci]=vi\n\ndp=[[[0]*(c+1) for _ in range(r+1)] for _ in range(4)]\n\nfor i in range(1,r+1):\n for j in range(1,c+1):\n for k in range(4):\n dp[0][i][j]=max(dp[0][i][j],dp[k][i-1][j])\n dp[k][i][j]=max(dp[k][i][j],dp[k][i][j-1])\n if grid[i][j]!=0:\n dp[1][i][j]=max(dp[1][i][j],dp[0][i-1][j]+grid[i][j])\n for k in range(1,4):\n dp[1][i][j]=max(dp[1][i][j],dp[k][i-1][j]+grid[i][j])\n dp[k][i][j]=max(dp[k][i][j],dp[k-1][i][j-1]+grid[i][j])\n\nans=0\nfor k in range(4):\n ans=max(ans,dp[k][-1][-1])\nprint(ans)", "def main(R,C,K,V):\n dp = [0]*(4*R*C)\n dp[1+4*0+4*C*0] = V[0][0]\n for k in range(4*R*C):\n n = k%4\n j = k//4%C\n i = k//(4*C)\n if n!=0:\n if i != 0 and n==1:\n dp[k] = max(dp[k-4*C-n:k-4*C-n+4])+V[i][j]\n if j != 0:\n dp[k] = max(dp[k],dp[k-4],dp[k-5]+V[i][j])\n if n==0:\n if i != 0:\n dp[k] = max(dp[k-4*C-n:k-4*C-n+4])\n\n print(max(dp[-5:-1]))\n\nif __name__ == '__main__':\n R,C,K = map(int,input().split())\n C += 1\n rcv = [list(map(int,input().split())) for _ in range(K)]\n V = [[0]*C for _ in range(R)]\n for i in range(K):\n r,c,v = rcv[i]\n r -= 1\n c -= 1\n V[r][c] = v\n main(R,C,K,V)", "import java.io.*;\nimport java.util.*;\nimport static java.lang.System.out;\n\npublic class Main {\n static MyReader in = new MyReader();\n\n public static void main(String[] args){\n int R = in.i();\n int C = in.i();\n int K = in.i();\n int[][] v = new int[R][C]; \n for (int i = 0; i < K; i++) {\n int r = in.i() - 1;\n int c = in.i() - 1;\n v[r][c] = in.i();\n }\n \n long[][][] dp = new long[R + 1][C + 1][4];\n for (int i = R - 1; i >= 0; i--) {\n for (int j = C - 1; j >= 0; j--) {\n dp[i][j][0] = max(dp[i + 1][j][3], dp[i][j + 1][0]);\n for (int k = 1; k < 4; k++) {\n dp[i][j][k] = max(dp[i][j + 1][k], dp[i][j][k - 1]);\n }\n\n if (v[i][j] > 0) {\n for (int k = 1; k < 4; k++) {\n dp[i][j][k] = max(dp[i][j][k], v[i][j] + max(dp[i][j + 1][k - 1], dp[i + 1][j][3]));\n dp[i][j][k] = max(dp[i][j][k], dp[i][j][k - 1]);\n }\n } \n\n }\n }\n long ans = dp[0][0][3];\n out.println(ans);\n }\n\n static long max(long a, long b) {\n return a < b ? b : a;\n }\n}\n\nclass MyReader extends BufferedReader {\n char[] cbuf = new char[1024];\n int head = 0;\n int tail = 0;\n\n MyReader() {\n super(new InputStreamReader(System.in));\n }\n\n char next() {\n if (head == tail) {\n try {\n tail = read(cbuf, 0, cbuf.length);\n } catch (IOException e) {}\n head = 0;\n }\n return cbuf[head++];\n }\n\n void back() {\n head--;\n }\n\n boolean minus() {\n boolean minus;\n while (true) {\n char c = next();\n if (c != ' ' && c != '\\n' && c != '\\r') {\n if (!(minus = c == '-')) back();\n return minus;\n }\n }\n }\n\n void skip() {\n while (true) {\n char c = next();\n if (c != ' ' && c != '\\n' && c != '\\r') {\n back();\n break;\n }\n }\n }\n\n char[] s(final int N) {\n skip();\n char[] s = new char[N];\n for (int i = 0; i < s.length; i++) {\n s[i] = next();\n }\n return s;\n }\n\n int i() {\n boolean minus = minus();\n int n = 0;\n while (true) {\n int k = next() - '0';\n if (k < 0 || 9 < k) break;\n n = 10 * n + k;\n }\n return minus ? -n : n;\n }\n\n int[] ii(final int N) {\n int[] a = new int[N];\n for (int j = 0; j < a.length; j++) a[j] = i();\n return a;\n }\n\n long l() {\n boolean minus = minus();\n long n = 0;\n while (true) {\n int k = next() - '0';\n if (k < 0 || 9 < k) break;\n n = 10 * n + k;\n }\n return minus ? -n : n;\n }\n}\n", "R, C, K = map(int, input().split())\n\nV = [[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[r][c] = v\n\nmax_pre = [0]*(C+1)\nfor i in range(R+1):\n now = [[0]*(3+1) for _ in range(C+1)]\n for j in range(C+1):\n v = V[i][j]\n la = lb = 0\n if j > 0:\n la = now[j-1][0]\n lb = now[j-1][1]\n now[j][2] = max(now[j][2], now[j-1][2], lb + v)\n now[j][3] = max(now[j][3], now[j-1][3], now[j-1][2] + v)\n if i > 0:\n now[j][0] = max(now[j][0], max_pre[j], la)\n now[j][1] = max(now[j][1], max_pre[j] + v, la + v, lb)\n max_pre[j] = max(now[j])\n\nprint(max(now[C]))\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\nvector<vector<ll>>v;\nll r,c,k;\nll dp[3005][3005][10];\nll dfs(ll i,ll j,ll cp){\n if(i>r || j>c)return 0;\n if(dp[i][j][cp]!=-1)return dp[i][j][cp];\n ll ans=0;\n if(v[i][j]!=0 && cp>0){\n ll ans1=v[i][j]+dfs(i,j+1,cp-1);\n ll ans2=v[i][j]+dfs(i+1,j,3);\n ans=max(ans1,ans2);\n }\n ll ans1=dfs(i,j+1,cp);\n ll ans2=dfs(i+1,j,3);\n ans=max(ans,max(ans1,ans2));\n return dp[i][j][cp]=ans;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cin>>r>>c>>k;\n vector<vector<ll>>V(r+1,vector<ll>(c+1,0));\n for(ll i=0;i<k;i++){\n ll x,y,z;\n cin>>x>>y>>z;\n V[x][y]=z;\n }\n v=V;\n memset(dp,-1,sizeof(dp));\n ll ans=dfs(1,1,3);\n cout<<ans<<endl;\n return 0;\n}\n\n", "\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic final class Main {\n\n public static void main(String[] args) {\n final Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n String[] line = in.nextLine().split(\" \");\n final int r = Integer.parseInt(line[0]);\n final int c = Integer.parseInt(line[1]);\n final int K = Integer.parseInt(line[2]);\n final int[][] matrix = new int[r][c];\n for (int i = 0; i < K; i++) {\n line = in.nextLine().split(\" \");\n final int row = Integer.parseInt(line[0]);\n final int col = Integer.parseInt(line[1]);\n final int v = Integer.parseInt(line[2]);\n matrix[row - 1][col - 1] = v;\n }\n final long[][][] dp = new long[r][c][4];\n dp[0][0][1] = matrix[0][0];\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n for (int k = 0; k < 4; k++) {\n if (i > 0) { dp[i][j][k] = Math.max(dp[i][j][k], dp[i - 1][j][k]); }\n if (j > 0) { dp[i][j][k] = Math.max(dp[i][j][k], dp[i][j - 1][k]); }\n if (i > 0) { dp[i][j][1] = Math.max(dp[i][j][1], dp[i - 1][j][k] + matrix[i][j]); }\n }\n for (int k = 1; k < 4; k++) {\n if (j > 0) { dp[i][j][k] = Math.max(dp[i][j][k], dp[i][j - 1][k - 1] + matrix[i][j]); }\n }\n }\n }\n long res = 0;\n for (long ans : dp[r - 1][c - 1]) {\n res = Math.max(res, ans);\n }\n System.out.println(res);\n }\n}\n", "import java.util.*;\nimport java.util.function.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\n\n\npublic class Main {\n\n \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n\n long[][] itemValue = new long[R][C];\n for(int k=0; k<K; k++){\n int r = sc.nextInt()-1;\n int c = sc.nextInt()-1;\n itemValue[r][c] = sc.nextLong();\n }\n\n long[][][] dp = new long[4][R][C];\n dp[1][0][0] = itemValue[0][0];\n\n for(int r=0; r<R; r++) for(int c=0; c<C; c++) for(int i=0; i<=3; i++){\n if(c>0) dp[i][r][c] = Math.max(dp[i][r][c], dp[i][r][c-1]);\n if(r>0) dp[0][r][c] = Math.max(dp[0][r][c], dp[i][r-1][c]);\n if(c>0 && i>0) dp[i][r][c] = Math.max(dp[i][r][c], dp[i-1][r][c-1]+itemValue[r][c]);\n if(r>0)dp[1][r][c] = Math.max(dp[1][r][c], dp[i][r-1][c]+itemValue[r][c]);\n }\n\n long ans = 0;\n for(int i=0; i<=3; i++) ans = Math.max(ans, dp[i][R-1][C-1]);\n\n System.out.println(ans);\n //System.err.println(Arrays.deepToString(dp));\n\n }\n}\n", "#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint R,C,K;\nint v[3003][3003];\nlong dp[3003];\nlong tmp[4][3003];\nint main()\n{\n\tcin>>R>>C>>K;\n\tfor(int i=0;i<K;i++)\n\t{\n\t\tint r,c,va;cin>>r>>c>>va;\n\t\tr--,c--;\n\t\tv[r][c]=va;\n\t}\n\tfor(int i=0;i<R;i++)\n\t{\n\t\tfor(int j=0;j<4;j++)for(int k=0;k<C;k++)tmp[j][k]=0;\n\t\tlong MX[3]={};\n\t\tfor(int k=0;k<C;k++)\n\t\t{\n\t\t\tif(k>0)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<4;j++)tmp[j][k]=tmp[j][k-1];\n\t\t\t}\n\t\t\tMX[0]=max(MX[0],dp[k]);\n\t\t\tfor(int j=0;j<3;j++)\n\t\t\t{\n\t\t\t\ttmp[j+1][k]=max(tmp[j+1][k],MX[j]+v[i][k]);\n\t\t\t}\n\t\t\tfor(int j=0;j<3;j++)MX[j]=max(MX[j],tmp[j][k]);\n\t\t}\n\t\tfor(int k=0;k<C;k++)\n\t\t{\n\t\t\tfor(int j=0;j<4;j++)dp[k]=max(dp[k],tmp[j][k]);\n\t\t}\n\t}\n\tcout<<dp[C-1]<<endl;\n}\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nusing ll = long long;\n\nint Item[3005][3005];\nll DP[3005][3005][4];\n\nint main(){\n int R,C,k;cin>>R>>C>>k;\n rep(i,k){\n int r,c,v;\n scanf(\"%d %d %d\",&r,&c,&v);\n r--;c--;\n Item[r][c]=v;\n }\n rep(i,R)rep(j,C){\n for(int k=2;k>=0;k--){\n DP[i][j][k+1]=max(DP[i][j][k+1],DP[i][j][k]+Item[i][j]);\n }\n rep(k,4){\n DP[i+1][j][0]=max(DP[i+1][j][0],DP[i][j][k]);\n DP[i][j+1][k]=max(DP[i][j+1][k],DP[i][j][k]);\n }\n }\n\n ll ans=0;\n rep(k,4)ans=max(ans,DP[R-1][C-1][k]);\n cout<<ans<<endl;\n}", "#include <cstdio>\n#include <bits/stdc++.h>\nusing namespace std;\n\nlong long int items[3005][3005];\nlong long int dp[3005][3005][4];\n\nint main() {\n int r, c, k;\n scanf(\"%d%d%d\", &r, &c, &k);\n for (int l = 0; l < k; l ++) {\n int i, j, v;\n scanf(\"%d%d%d\", &i, &j, &v);\n items[i][j] = v;\n }\n for (int i = 1; i <= r; i++) {\n for (int j = 1; j <= c; j++) {\n for (int m = 0; m < 4; m++) {\n dp[i][j][m] = max(dp[i - 1][j][3], dp[i][j - 1][m]);\n }\n if (items[i][j] > 0) {\n for (int m = 2; m >= 0; m--) {\n dp[i][j][m + 1] = max(dp[i][j][m + 1], dp[i][j][m] + items[i][j]);\n }\n }\n }\n }\n\n printf(\"%lld\\n\", dp[r][c][3]);\n return 0;\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Mufaddal Naya\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n EPickingGoods solver = new EPickingGoods();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class EPickingGoods {\n public void solve(int testNumber, InputReader c, OutputWriter w) {\n// \tw.print(\"Case #\"+testNumber+\": \");\n int R = c.readInt(), C = c.readInt(), k = c.readInt();\n int[][] mat = new int[R][C];\n while (k-- > 0) {\n int u = c.readInt() - 1, v = c.readInt() - 1, val = c.readInt();\n mat[u][v] = val;\n }\n\n long[][][] dp = new long[R][C][4];\n dp[0][0][1] = mat[0][0];\n\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n if (i > 0) {\n dp[i][j][0] = Utils.max(dp[i - 1][j]);\n dp[i][j][1] = Utils.max(dp[i - 1][j]) + mat[i][j];\n }\n if (j > 0) {\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i][j - 1][0]);\n for (int mv = 0; mv < 3; mv++) {\n dp[i][j][mv + 1] =\n Utils.max(dp[i][j][mv + 1], dp[i][j - 1][mv + 1], dp[i][j - 1][mv] + mat[i][j]);\n }\n }\n }\n }\n\n//\t\ttr(dp);\n w.printLine(Utils.max(dp[R - 1][C - 1]));\n\n\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n }\n\n static class Utils {\n public static long max(long... objects) {\n long max = objects[0];\n for (int i = 1; i < objects.length; i++) {\n max = Math.max(max, objects[i]);\n }\n return max;\n }\n\n }\n}\n\n", "#include <bits/stdc++.h>\n#include <string>\n#include <vector>\n#include <algorithm>\n#define rep(i,n) for (int i = 0;i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define chmax(x,y) x = max(x,y)\nint INF = 1e9;\n\nint a[3005][3005];\nll dp[3005][3005][4];\n//配列はグローバルで定義した方がいい？\nint main(){\n int r,c,k;cin >> r >> c >> k;\n rep(i,k){\n int ri,ci,vi;cin >> ri >> ci >> vi;\n --ri;--ci;\n a[ri][ci] = vi;\n }\n\n rep(i,r)rep(j,c){\n for(int k = 2;k >= 0;k--){\n chmax(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n }\n rep(k,4){\n chmax(dp[i+1][j][0],dp[i][j][k]);\n chmax(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n ll ans = 0;\n rep(i,4) ans = max(ans,dp[r-1][c-1][i]);\n cout << ans << endl;\n}", "R,C,K = map(int,input().split())\ndp0 = [[0 for _ in range(C+1)] for f in range(R+1)]\ndp1 = [[0 for _ in range(C+1)] for f in range(R+1)]\ndp2 = [[0 for _ in range(C+1)] for f in range(R+1)]\ndp3 = [[0 for _ in range(C+1)] for f in range(R+1)]\nvl = [[0 for _ in range(C+1)] for f in range(R+1)]\n\nfor i in range(K):\n\tr,c,v = map(int,input().split())\n\tvl[r][c] = v\n\nfor i in range(1, R+1):\n\tfor j in range(1, C+1):\n\t\tdp0[i][j] = max(dp0[i][j], dp0[i-1][j], dp1[i-1][j], dp2[i-1][j], dp3[i-1][j])\n\t\tdp3[i][j] = max(dp3[i][j], dp3[i][j-1], dp2[i][j-1]+vl[i][j], dp2[i][j]+vl[i][j])\n\t\tdp2[i][j] = max(dp2[i][j], dp2[i][j-1], dp1[i][j-1]+vl[i][j], dp1[i][j]+vl[i][j])\n\t\tdp1[i][j] = max(dp1[i][j], dp1[i][j-1], dp0[i][j-1]+vl[i][j], dp0[i][j]+vl[i][j])\n\nprint(max(dp0[R][C], dp1[R][C], dp2[R][C], dp3[R][C]))", "#include<iostream>\n#include<algorithm>\n#define N 3001\nusing namespace std;\nint r,c,n,i,j,d[N][N],a,b,x;\nlong long e[N][N][4];\nbool v[N][N][4];\nlong long w(int x,int y,int k){\n if(x>r||y>c)return 0;\n if(x==r&&y==c)return k<3?d[x][y]:0;\n if(v[x][y][k])return e[x][y][k];\n v[x][y][k]=1;\n e[x][y][k]=max(w(x+1,y,0)+d[x][y],w(x,y+1,k));\n if(k<2){\n e[x][y][k]=max(e[x][y][k],w(x,y+1,k+1)+d[x][y]);\n }\n return e[x][y][k];\n}\nint main(){\n cin>>r>>c>>n;\n while(n--){\n cin>>a>>b>>x;\n d[a][b]=x;\n }\n cout<<w(1,1,0);\n}\n", "R,C,K = map(int,input().split())\nitems = [[0]*(C+1) for _ in range(R+1)]\nfor i in range(K):\n r,c,v = map(int,input().split())\n items[r][c] = v\n\ndp = [[[0]*(C+1) for _ in range(R+1)] for _ in range(4)]\n\nfor y in range(R+1):\n for x in range(C+1):\n for i in range(4):\n position = dp[i][y][x]\n if y+1 <= R:\n dp[0][y+1][x] = max(dp[0][y+1][x], position)\n dp[1][y+1][x] = max(dp[1][y+1][x], position+items[y+1][x])\n if x+1 <= C:\n dp[i][y][x+1] = max(dp[i][y][x+1], position)\n if i < 3:\n dp[i+1][y][x+1] = max(dp[i+1][y][x+1], position+items[y][x+1])\n\nans = 0\nfor i in range(4):\n ans = max(ans, dp[i][-1][-1])\nprint(ans)", "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Main {\n\n public static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastInput in = new FastInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tABC175E solver = new ABC175E();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class ABC175E {\n\t\t\n\t\tstatic StringBuilder sb;\n\t\t\n\t\tpublic void solve(int testNum, FastInput in, PrintWriter out) {\n\t\t\t\n\t\t\tint r = in.nextInt();\n\t\t\tint c = in.nextInt();\n\t\t\tint k = in.nextInt();\n\t\t\t\n\t\t\tMap<String,Integer> hm = new HashMap<String, Integer>();\n\t\t\tsb = new StringBuilder();\n\t\t\t\n\t\t\tlong [][]v = new long [r][c];\n\t\t\tfor(int i = 0 ; i < k ;i++) {\n\t\t\t\tint y = in.nextInt()-1;\n\t\t\t\tint x = in.nextInt()-1;\n\t\t\t\tlong p = in.nextLong();\n\t\t\t\tv[y][x] = p;\n\t\t\t}\n\t\t\t\n\t\t\tlong [][][]dp = new long [r+1][c+1][4];\n\t\t\t\n\t\t\tfor(int i = 0 ; i <= r ;i++) {\n\t\t\t\tfor(int j = 0 ; j <= c ;j++) {\n\t\t\t\t\tfor(int l = 0 ; l < 4 ;l++) {\n\t\t\t\t\t\tdp[i][j][l] = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp[0][0][0] = 0;\n\t\t\tlong ans = 0;\n\t\t\t\n\t\t\tfor(int i = 0 ; i < r ; i++) {\n\t\t\t\tfor(int j = 0 ; j < c ;j++) {\n\t\t\t\t\tfor(int q = 0 ; q <= 3 ; q++) {\n\t\t\t\t\t\tif(q == 3) {\n\t\t\t\t\t\t\tdp[i+1][j][0] = Math.max(dp[i+1][j][0], dp[i][j][3]);\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[i+1][j][0] = Math.max(dp[i][j][q] + v[i][j], dp[i+1][j][0]);\n\t\t\t\t\t\tdp[i][j+1][q+1] = Math.max(dp[i][j][q] + v[i][j], dp[i][j+1][q+1]);\n\t\t\t\t\t\tdp[i][j+1][q] = Math.max(dp[i][j][q], dp[i][j+1][q]);\n\t\t\t\t\t}\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor(int i = 0 ; i <= c ; i++) {\n\t\t\t\tans = Math.max(dp[r][i][0], ans);\n\t\t\t}\n\t\t\t\n\t\t\tout.println(ans);\n\t\t}\n\n\t\t}\n\n\t}\t\n\t\n\t\t class FastInput{\n\t\tprivate final BufferedReader in;\n\t\tprivate String[] buff;\n\t\tprivate int index = 0;\n\t\t\n\t\tpublic FastInput(InputStream im) {\n\t\t\tin = new BufferedReader(new InputStreamReader(im));\n\t\t}\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\treturn in.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\tString next() {\n\t\t\twhile (buff == null || index >= buff.length) {\n\t\t\t\tbuff = nextLine().split(\" \");\n\t\t\t\tindex = 0;\n\t\t\t}\n\t\t\treturn buff[index++];\n\t\t}\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\t\n\t\tDouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tBigInteger nextBigInteger() {\n\t\t\treturn new BigInteger(next());\n\t\t}\n\t\t\n\t\tBigDecimal nextBigDecimal() {\n\t\t\treturn new BigDecimal(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res= new long [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic double[] nextDoubleArray(final int n ) {\n\t\t\tfinal double[] res = new double [n];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\t\n\t\tpublic int[][] nextInt2DArray(final int n , final int m){\n\t\t\tint [][]res = new int [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tpublic long[][] nextLong2DArray(final int n , final int m){\n\t\t\tlong [][]res = new long [n][m];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tfor(int j = 0 ; j < m ;j++) {\n\t\t\t\t\tres[i][j] = nextLong();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tpublic char[][] nextChar2DArray(final int n){\n\t\t\tchar [][]res = new char [n][];\n\t\t\t\n\t\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\t\tString s = next();\n\t\t\t\tres[i] = s.toCharArray();\n\t\t\t}\n\t\t\t\n\t\t\treturn res;\n\t\t}\n\t}\n\t\n\n\n\n", "#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nconst int N=3005;\nint n,m,k,a[N][N],dp[N][N][4];\nvoid chmax(int &a,int b){if(a<b)a=b;}\nsigned main()\n{\n\tios::sync_with_stdio(false);\n\tcin>>n>>m>>k;\n\tfor(int i=1;i<=k;i++)\n\t{\n\t\tint x,y,v;\n\t\tcin>>x>>y>>v;\n\t\ta[x][y]=v;\n\t}\n\tdp[1][1][1]=a[1][1];\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=1;j<=m;j++)\n\t\t{\n\t\t\tfor(int k=0;k<=3;k++)\n\t\t\t{\n\t\t\t\tchmax(dp[i+1][j][0],dp[i][j][k]);\n\t\t\t\tchmax(dp[i][j+1][k],dp[i][j][k]);\n\t\t\t\tchmax(dp[i+1][j][1],dp[i][j][k]+a[i+1][j]);\n\t\t\t\tif(k<3) chmax(dp[i][j+1][k+1],dp[i][j][k]+a[i][j+1]);\n\t\t\t}\n\t\t}\n\t}\n\tcout<<max(max(dp[n][m][0],dp[n][m][1]),max(dp[n][m][2],dp[n][m][3]))<<endl;\n\treturn 0;\n}", "//後日挑戦\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing ll = long long;\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nll v[3005][3005];\nll dp[3005][3005][4];\nint main() {\n int r,c,k;\n cin >> r >> c >> k;\n \n rep(i,k){\n int x,y,z;\n cin >> x >> y >> z;\n x--;y--;\n v[x][y]=z;\n }\n rep(i,r)rep(j,c){\n for(int k=2;k>=0;k--){\n chmax(dp[i][j][k+1],dp[i][j][k]+v[i][j]);\n } \n rep(k,4){\n chmax(dp[i+1][j][0],dp[i][j][k]);\n chmax(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n ll ans=0;\n rep(k,4) chmax(ans,dp[r-1][c-1][k]);\n cout << ans << endl;\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Mufaddal Naya\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n EPickingGoods solver = new EPickingGoods();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EPickingGoods {\n public void solve(int testNumber, InputReader c, OutputWriter w) {\n// \tw.print(\"Case #\"+testNumber+\": \");\n int R = c.readInt(), C = c.readInt(), k = c.readInt();\n int[][] mat = new int[R][C];\n while (k-- > 0) {\n int u = c.readInt() - 1, v = c.readInt() - 1, val = c.readInt();\n mat[u][v] = val;\n }\n\n long[][][] dp = new long[R][C][4];\n dp[0][0][1] = mat[0][0];\n\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n if (i > 0) {\n dp[i][j][0] = Utils.max(dp[i - 1][j]);\n dp[i][j][1] = Utils.max(dp[i - 1][j]) + mat[i][j];\n }\n if (j > 0) {\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i][j - 1][0]);\n for (int mv = 0; mv < 3; mv++) {\n dp[i][j][mv + 1] =\n Utils.max(dp[i][j][mv + 1], dp[i][j - 1][mv + 1], dp[i][j - 1][mv] + mat[i][j]);\n }\n }\n }\n }\n\n//\t\ttr(dp);\n w.printLine(Utils.max(dp[R - 1][C - 1]));\n\n\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n }\n\n static class Utils {\n public static long max(long... objects) {\n long max = objects[0];\n for (int i = 1; i < objects.length; i++) {\n max = Math.max(max, objects[i]);\n }\n return max;\n }\n\n }\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nconst int maxn=3009;\n\nint n,m,K;\n\nint a[maxn][maxn];\n\nlong long f[maxn][maxn][4];\n\nint main(){\n\tcin>>n>>m>>K;\n\twhile(K--){\n\t\tint x,y,z;scanf(\"%d%d%d\",&x,&y,&z);\n\t\ta[x][y]=z;\n\t}\n\tfor(int i=1;i<=n;++i){\n\t\tfor(int j=1;j<=m;++j){\n\t\t\tfor(int k=0;k<=3;++k){\n\t\t\t\tlong long t=max(max(f[i-1][j][0],f[i-1][j][1]),max(f[i-1][j][2],f[i-1][j][3]));\n\t\t\t\tf[i][j][k]=max(f[i][j-1][k],t);\n\t\t\t\tif(k)f[i][j][k]=max(f[i][j-1][k-1]+a[i][j],f[i][j][k]);\n\t\t\t\tif(k)f[i][j][k]=max(f[i][j][k],t+a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\",max(max(f[n][m][0],f[n][m][1]),max(f[n][m][2],f[n][m][3])));\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n int[][] V = new int[R][C];\n for (int i = 0; i < K; i++) {\n int r = sc.nextInt();\n int c = sc.nextInt();\n int v = sc.nextInt();\n V[--r][--c] = v;\n }\n\n long[][][] dp = new long[R][C][4];\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 0; k <= 3; k++) {\n dp[i][j][k] = -1;\n }\n }\n }\n dp[0][0][3] = 0;\n if (V[0][0] > 0) dp[0][0][2] = V[0][0];\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 0; k <= 3; k++) {\n if (dp[i][j][k] == -1) continue;\n if (i+1 < R) {\n // i+1\n long max = 0;\n for (int kk = 0; kk <= 3; kk++) {\n max = Math.max(max,dp[i][j][kk]);\n }\n if (V[i+1][j] > 0) {\n dp[i+1][j][2] = Math.max(dp[i+1][j][2],max+V[i+1][j]);\n }\n dp[i+1][j][3] = Math.max(dp[i+1][j][3],max);\n }\n if (j+1 < C) {\n // j+1\n if (V[i][j+1] > 0 && k > 0) {\n dp[i][j+1][k-1] = Math.max(dp[i][j+1][k-1],dp[i][j][k]+V[i][j+1]);\n }\n dp[i][j+1][k] = Math.max(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n }\n }\n\n long ans = 0;\n for (int k = 0; k <= 3; k++) {\n ans = Math.max(ans,dp[R-1][C-1][k]);\n }\n System.out.println(ans);\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing ll = long long;\n\nint main() {\n int R, C, k;\n cin >> R >> C >> k;\n vector<int> r(k,0), c(k,0), v(k,0);\n rep(i,k) cin >> r[i] >> c[i] >> v[i];\n vector<vector<int>> arr(R,vector<int>(C));\n rep(i,k) arr[r[i]-1][c[i]-1] = v[i];\n vector<vector<vector<ll>>> dp(R+1,vector<vector<ll>>(C+1,vector<ll>(4,0)));\n\n rep(i,R) rep(j,C) {\n for (int k = 2; k >= 0; k--) {\n dp[i][j][k+1] = max(dp[i][j][k+1], dp[i][j][k] + arr[i][j]);\n }\n rep(k, 4) {\n dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][k]);\n dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n ll ans = 0;\n rep(k,4) ans = max(ans,dp[R-1][C-1][k]);\n cout << ans << endl;\n return 0;\n}", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\t\n\tvoid run() {\n\t\tFastScanner sc = new FastScanner();\n\t\tint H=sc.nextInt();\n\t\tint W=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tint[] h=new int[K];\n\t\tint[] w=new int[K];\n\t\tlong[][][] dp=new long[4][H+1][W+1];\n\t\tlong[][] v=new long[H+1][W+1];\n\t\tfor (int i=0;i<K;++i) {\n\t\t\th[i]=sc.nextInt();\n\t\t\tw[i]=sc.nextInt();\n\t\t\tv[h[i]][w[i]]=sc.nextLong();\n\t\t}\n\t\tlong ans=0;\n\t\tfor (int y=1;y<=H;++y) {\n\t\t\tfor (int x=1;x<=W;++x) {\n\t\t\t\tfor (int sum=1;sum<=3;++sum) {\n\t\t\t\t\tdp[sum][y][x]=Math.max(dp[3][y-1][x]+v[y][x], Math.max(dp[sum][y][x-1],dp[sum-1][y][x-1]+v[y][x]));\n\t\t\t\t\tans=Math.max(ans, dp[sum][y][x]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\t\n\tvoid tr(Object...o) {System.out.println(Arrays.deepToString(o));}\n}\n", "import java.io.*;\nimport java.util.*;\n\nclass Solver {\n final int maxR, maxC, k;\n final int[][] rcvs;\n\n Solver(int maxR, int maxC, int k, int[][] rcvs) {\n this.maxR = maxR;\n this.maxC = maxC;\n this.k = k;\n this.rcvs = rcvs;\n }\n\n public long solve() {\n long[][] map = new long[maxR][maxC];\n for (int[] rcv : rcvs) {\n int r = rcv[0] - 1;\n int c = rcv[1] - 1;\n int v = rcv[2];\n map[r][c] = v;\n }\n\n long[][][] dptable = new long[4][maxR][maxC];\n for (int i = 0; i < maxR; i++) {\n for (int j = 0; j < maxC; j++) {\n for (int count = 0; count <= 3; count++) {\n if (i + 1 < maxR) {\n dptable[0][i + 1][j] = Math.max(dptable[0][i + 1][j], dptable[count][i][j]);\n if (count < 3) {\n dptable[0][i + 1][j] = Math.max(dptable[0][i + 1][j], dptable[count][i][j] + map[i][j]);\n }\n }\n if (j + 1 < maxC) {\n dptable[count][i][j + 1] = Math.max(dptable[count][i][j + 1], dptable[count][i][j]);\n if (count < 3) {\n dptable[count + 1][i][j + 1] = Math.max(dptable[count][i][j + 1], dptable[count][i][j] + map[i][j]);\n }\n }\n }\n }\n }\n\n\n \n long maxScore = dptable[3][maxR - 1][maxC - 1];\n for (int i = 0; i < 3; i++) {\n maxScore = Math.max(maxScore, dptable[i][maxR - 1][maxC - 1] + map[maxR - 1][maxC - 1]);\n }\n return maxScore;\n }\n}\n\npublic class Main {\n private static void execute(ContestReader reader, ContestWriter out) {\n int maxR = reader.nextInt();\n int maxC = reader.nextInt();\n int k = reader.nextInt();\n int[][] rcvs = reader.nextInt(k, 3);\n out.println(new Solver(maxR, maxC, k, rcvs).solve());\n }\n \n public static void main(String[] args) {\n ContestReader reader = new ContestReader(System.in);\n ContestWriter out = new ContestWriter(System.out);\n execute(reader, out);\n out.flush();\n }\n}\n\nclass ContestWriter extends PrintWriter {\n ContestWriter(PrintStream printStream) {\n super(printStream);\n }\n\n public void printList(List<? extends Object> list) {\n for (Object object : list) {\n println(object);\n }\n }\n\n public void printListOneLine(List<? extends Object> list) {\n List<String> stringList = new ArrayList<>();\n for (Object object : list) {\n stringList.add(object.toString());\n }\n println(String.join(\" \", stringList));\n }\n}\n\nclass ContestReader {\n private static final int BUFFER_SIZE = 1024;\n \n private final InputStream stream;\n private final byte[] buffer;\n private int pointer;\n private int bufferLength;\n \n ContestReader(InputStream stream) {\n this.stream = stream;\n this.buffer = new byte[BUFFER_SIZE];\n this.pointer = 0;\n this.bufferLength = 0;\n }\n \n private boolean hasNextByte() {\n if (pointer < bufferLength) {\n return true;\n }\n \n pointer = 0;\n try {\n bufferLength = stream.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return bufferLength > 0;\n }\n \n private int readByte() {\n if (hasNextByte()) {\n return buffer[pointer++];\n } else {\n return -1;\n }\n }\n \n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n \n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[pointer])) {\n pointer++;\n }\n return hasNextByte();\n }\n \n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n while(true) {\n int b = readByte();\n if (!isPrintableChar(b)) {\n break;\n }\n sb.appendCodePoint(b);\n }\n return sb.toString();\n }\n \n public String nextLine() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n while(true) {\n int b = readByte();\n if (!isPrintableChar(b) && b != 0x20) {\n break;\n }\n sb.appendCodePoint(b);\n }\n return sb.toString();\n }\n \n public char nextChar() {\n return next().charAt(0);\n }\n \n public int nextInt() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n \n int n = 0;\n boolean minus = false;\n \n {\n int b = readByte();\n if (b == '-') {\n minus = true;\n } else if ('0' <= b && b <= '9') {\n n = b - '0';\n } else {\n throw new NumberFormatException();\n }\n }\n \n while(true){\n int b = readByte();\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n }\n }\n \n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n \n long n = 0;\n boolean minus = false;\n \n {\n int b = readByte();\n if (b == '-') {\n minus = true;\n } else if ('0' <= b && b <= '9') {\n n = b - '0';\n } else {\n throw new NumberFormatException();\n }\n }\n \n while(true){\n int b = readByte();\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n }\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public String[] next(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = next();\n }\n return array;\n }\n \n public String[] nextLine(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLine();\n }\n return array;\n }\n \n public char[] nextChar(int n) {\n char[] array = new char[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextChar();\n }\n return array;\n }\n \n public int[] nextInt(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n \n public long[] nextLong(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n \n public double[] nextDouble(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n \n public char[] nextCharArray() {\n return next().toCharArray();\n }\n \n public String[][] next(int n, int m) {\n String[][] matrix = new String[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = next();\n }\n }\n return matrix;\n }\n \n public int[][] nextInt(int n, int m) {\n int[][] matrix = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextInt();\n }\n }\n return matrix;\n }\n \n public char[][] nextChar(int n, int m) {\n char[][] matrix = new char[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextChar();\n }\n }\n return matrix;\n }\n \n public long[][] nextLong(int n, int m) {\n long[][] matrix = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextLong();\n }\n }\n return matrix;\n }\n \n public double[][] nextDouble(int n, int m) {\n double[][] matrix = new double[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextDouble();\n }\n }\n return matrix;\n }\n \n public char[][] nextCharArray(int n) {\n char[][] matrix = new char[n][];\n for (int i = 0; i < n; i++) {\n matrix[i] = next().toCharArray();\n }\n return matrix;\n }\n}\n\nclass MyAssert {\n public static void myAssert(boolean flag, String message) {\n if (!flag) {\n throw new RuntimeException(message);\n }\n }\n \n public static void myAssert(boolean flag) {\n myAssert(flag, \"\");\n }\n}\n", "#include<iostream>\n#include<vector>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing ll = long long;\nusing P = pair<int, int>;\n#include<algorithm>\n#include<math.h>\n#include<map>\n#include<queue>\n#include<set>\n#define chmax(x,y) x=max(x,y)\n\nint a[3005][3005];\nll dp[3005][3005][4];\nint main() {\n\tint R, C, n;\n\tcin >> R >> C >> n;\n\trep(i, n) {\n\t\tint r, c, v;\n\t\tcin >> r >> c >> v;\n\t\ta[r - 1][c - 1] = v;\n\t}\n\trep(i, R)rep(j, C) {\n\t\tfor (int k = 2; k >= 0; --k) {\n\t\t\tchmax(dp[i][j][k + 1], dp[i][j][k] + a[i][j]);\n\t\t}\n\t\trep(k, 4) {\n\t\t\tchmax(dp[i + 1][j][0], dp[i][j][k]);\n\t\t\tchmax(dp[i][j + 1][k], dp[i][j][k]);\n\t\t}\n\t}\n\tll ans = 0;\n\trep(k, 4)chmax(ans, dp[R - 1][C - 1][k]);\n\tcout << ans << endl;\n\treturn 0;\n\n}", "import sys\nR, C, K = list(map(int, input().split()))\n\nd = [[[0] * (C+1) for _ in range(R+1)] for _ in range(4)]\nt = [[0] * (C+1) for _ in range(R+1)]\n\nfor i in range(K):\n r,c,v = list(map(int, input().split()))\n t[r][c] = v\n\nfor i in range(R+1):\n for j in range(C+1):\n for k in range(4):\n if i!=0:\n d[0][i][j] = max(d[0][i][j], d[k][i-1][j])\n d[1][i][j] = max(d[1][i][j], d[k][i-1][j] + t[i][j])\n\n if j!=0:\n d[k][i][j] = max(d[k][i][j], d[k][i][j-1])\n if k != 0:\n d[k][i][j] = max(d[k][i][j], d[k-1][i][j-1] + t[i][j])\n\na = 0\nfor i in range(4):\n a = max(a, d[i][-1][-1])\nprint(a)\n", "#include<iostream>\n#include<cstring>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nconst int N = 3005;\nconst long long INF = 0x3f3f3f3f3f3f3f3f;\n\nint n, m, k;\nlong long g[N][N], f[N][N][5];\n\nint main()\n{\n\tscanf(\"%d%d%d\", &n, &m, &k);\n\tfor(int i = 0, r, c; i < k; ++i)\n\t{\n\t\tscanf(\"%d%d\", &r, &c);\n\t\tscanf(\"%lld\", &g[r][c]);\n\t}\n\n\tfor(int i = 1; i <= n; ++i)\n\t\tfor(int j = 1; j <= m; ++j)\n\t\t{\n\n\t\t\tf[i][j][0] = max(f[i][j-1][0], f[i-1][j][4]);\n\t\t\tf[i][j][4] = f[i][j][0];\n\t\t\tfor(int l = 1; l <= 3; ++l)\n\t\t\t{\n\t\t\t\tf[i][j][l] = max(max(f[i][j-1][l], f[i-1][j][4] + g[i][j]), f[i][j-1][l-1] + g[i][j]);\n\t\t\t\tf[i][j][4] = max(f[i][j][4], f[i][j][l]);\n\t\t\t}\n\t\t}\n\n\tcout << f[n][m][4]<< endl;\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nconst int maxn=3009;\n\nint n,m,K;\n\nint a[maxn][maxn];\n\nlong long f[maxn][maxn][4];\n\nint main(){\n\tcin>>n>>m>>K;\n\twhile(K--){\n\t\tint x,y,z;scanf(\"%d%d%d\",&x,&y,&z);\n\t\ta[x][y]=z;\n\t}\n\tfor(int i=1;i<=n;++i){\n\t\tfor(int j=1;j<=m;++j){\n\t\t\tfor(int k=0;k<=3;++k){\n\t\t\t\tlong long t=max(max(f[i-1][j][0],f[i-1][j][1]),max(f[i-1][j][2],f[i-1][j][3]));\n\t\t\t\tf[i][j][k]=max(f[i][j-1][k],t);\n\t\t\t\tif(k)f[i][j][k]=max(f[i][j-1][k-1]+a[i][j],f[i][j][k]);\n\t\t\t\tif(k)f[i][j][k]=max(f[i][j][k],t+a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\",max(max(f[n][m][0],f[n][m][1]),max(f[n][m][2],f[n][m][3])));\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\n#define chmax(x, y) x = max(x, y)\nusing namespace std;\nusing ll = long long;\n\n// dp[i][j][k] ((i,j)にいるときの最大値. その行で既にk個のアイテムを選んだとき(k <= K))\n\nint table[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n int R, C, K;\n cin >> R >> C >> K;\n rep(i, K) {\n int r, c, v;\n cin >> r >> c >> v;\n table[r-1][c-1] = v;\n }\n rep(i, R) rep(j, C) {\n for (int k = 2; k >= 0; k--) {\n chmax(dp[i][j][k+1], dp[i][j][k] + table[i][j]);\n }\n rep(k, 4) {\n chmax(dp[i+1][j][0], dp[i][j][k]);\n chmax(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n \n ll ans = 0;\n rep(k, 4) chmax(ans, dp[R-1][C-1][k]);\n cout << ans << endl;\n}", "(R,C,K),*t=[map(int,t.split())for t in open(0)]\nG,*F=eval(\"eval('[0]*-~C,'*R),\"*5)\nfor r,c,v in t:G[r-1][c]=v\nfor r in range(R):\n for x in 1,2,3:\n for c in range(C):F[x][r][c]=max(F[x-1][r][c],max(F[x-1][r][c-1],(x<2)*F[3][r-1][c])+G[r][c+1],F[x][r][c-1])\nprint(F[3][-1][-2])", "# -*- coding: utf-8 -*-\nimport sys\nfrom collections import defaultdict\nR,C,K=map(int, sys.stdin.readline().split())\n\nvalue=defaultdict(lambda: 0)\nvalue=[ [0 for _ in range(C+1)] for __ in range(R+1) ]\nfor _ in range(K):\n r,c,v=map(int, sys.stdin.readline().split())\n value[r][c]=v\n\ndp0=[0]*(C+1)\ndp1=[0]*(C+1)\ndp2=[0]*(C+1)\ndp3=[0]*(C+1)\n\n#dp1[1]=value[1][1]\n\nfor r in range(1,R+1):\n for c in range(1,C+1):\n dp0[c]=max( dp0[c-1], dp0[c] )\n dp1[c]=max( dp1[c-1], dp1[c] )\n dp2[c]=max( dp2[c-1], dp2[c] )\n dp3[c]=max( dp3[c-1], dp3[c] )\n #今のマスにアイテムがある場合\n if 0<value[r][c]:\n dp3[c]=max( dp3[c-1], dp2[c]+value[r][c] )\n dp2[c]=max( dp2[c-1], dp1[c]+value[r][c] )\n dp1[c]=max( dp1[c-1], dp0[c]+value[r][c] )\n\n #上の行にアイテムをコピー\n for c in range(1,C+1):\n dp0[c]=max( dp0[c], dp1[c], dp2[c], dp3[c] )\n dp1=[0]*(C+1)\n dp2=[0]*(C+1)\n dp3=[0]*(C+1)\n\nprint dp0[C]\n", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n long[][] g = new long[R][C];\n for (int i = 0; i < K; i++) {\n int r = sc.nextInt()-1;\n int c = sc.nextInt()-1;\n long v = sc.nextLong();\n g[r][c] = v;\n }\n long[][][] dp = new long[R][C][4];\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n if(0 < i){\n long max = Math.max(dp[i-1][j][0], Math.max(dp[i-1][j][1], Math.max(dp[i-1][j][2], dp[i-1][j][3])));\n dp[i][j][0] = max;\n }\n dp[i][j][1] = dp[i][j][0] + g[i][j];\n if(0 < j){\n dp[i][j][0] = Math.max(dp[i][j-1][0], dp[i][j][0]);\n dp[i][j][1] = Math.max(dp[i][j][1], Math.max(dp[i][j-1][1], dp[i][j-1][0] + g[i][j]));\n dp[i][j][2] = Math.max(dp[i][j-1][2], dp[i][j-1][1] + g[i][j]);\n dp[i][j][3] = Math.max(dp[i][j-1][3], dp[i][j-1][2] + g[i][j]);\n }\n }\n }\n System.out.println(Math.max(dp[R-1][C-1][0], Math.max(dp[R-1][C-1][1], Math.max(dp[R-1][C-1][2], dp[R-1][C-1][3]))));\n sc.close();\n\n }\n\n}\n", "import sys\ninput = sys.stdin.readline\n\ndef solve():\n INF = float('inf')\n\n def max2(x, y): return x if x >= y else y\n\n R, C, K = map(int, input().split())\n Vss = [[0]*(C+1) for _ in range(R+1)]\n for _ in range(K):\n r, c, v = map(int, input().split())\n Vss[r][c] = v\n\n dpMax = [0]*(C+1)\n for i in range(1, R+1):\n dp0 = [0]*(C+1)\n dp1 = [-INF]*(C+1)\n dp2 = [-INF]*(C+1)\n dp3 = [-INF]*(C+1)\n for j in range(1, C+1):\n V = Vss[i][j]\n dp0[j] = max2(dp0[j-1], dpMax[j])\n dp1[j] = max2(dp0[j] + V, dp1[j-1])\n dp2[j] = max2(dp1[j-1] + V, dp2[j-1])\n dp3[j] = max2(dp2[j-1] + V, dp3[j-1])\n dpMax[j] = max(dp0[j], dp1[j], dp2[j], dp3[j])\n\n ans = dpMax[C]\n print(ans)\n\n\nsolve()\n", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n\n int[][] field = new int[R + 1][C + 1];\n for(int i = 0; i < K; i++){\n field[sc.nextInt()][sc.nextInt()] = sc.nextInt();\n }\n\n long[][][] dp = new long[R + 1][C + 1][4];\n\n for(int i = 1; i <= R; i++){\n for(int j = 1; j <= C; j++){\n dp[i][j][0] = Math.max(dp[i - 1][j][3], dp[i][j - 1][0]);\n dp[i][j][1] = Math.max(\n dp[i][j - 1][1],\n Math.max(dp[i - 1][j][3], dp[i][j - 1][0]) + field[i][j]\n );\n dp[i][j][2] = Math.max(\n dp[i][j - 1][2],\n Math.max(dp[i - 1][j][3], dp[i][j - 1][1]) + field[i][j]\n );\n dp[i][j][3] = Math.max(\n dp[i][j - 1][3],\n Math.max(dp[i - 1][j][3], dp[i][j - 1][2]) + field[i][j]\n );\n }\n }\n \n System.out.println(dp[R][C][3]);\n\n }\n\n}\n", "R, C, K = map(int, input().split())\nitem = {}\nfor _ in range(K):\n r, c, v = map(int, input().split())\n item[(r, c)] = v\n\ndp = [[0] * 4 for _ in range(3010)]\nndp = [[0] * 4 for _ in range(3010)]\nfor r in range(1, R+1):\n for c in range(1, C+1):\n prer = max(dp[c])\n ndp[c][0] = max(prer, ndp[c-1][0])\n ndp[c][1] = max(prer, ndp[c-1][1])\n ndp[c][2] = max(prer, ndp[c-1][2])\n ndp[c][3] = max(prer, ndp[c-1][3])\n if item.get((r, c)):\n ndp[c][1] = max(ndp[c][1], max(prer, ndp[c-1][0]) + item[(r,c)])\n ndp[c][2] = max(ndp[c][2], max(prer, ndp[c-1][1]) + item[(r,c)])\n ndp[c][3] = max(ndp[c][3], max(prer, ndp[c-1][2]) + item[(r,c)])\n dp = ndp\n ndp = [[0] * 4 for _ in range(3010)]\n\n#print(dp)\nprint(max(dp[C]))\n", "R, C, K = map(int, input().split())\nA = [[0] * 4 for _ in range(C+1)]\nB = [[-1] * (C+1) for _ in range(R+1)]\nfor k in range(K):\n r, c, v = map(int, input().split())\n B[r][c] = v\n\nfor r in range(1, R+1):\n D = A[:]\n for c in range(1, C+1):\n if B[r][c] == -1:\n A[c][0] = max(A[c-1][0], max(D[c]))\n A[c][1] = max(A[c-1][1], max(D[c]))\n A[c][2] = max(A[c-1][2], max(D[c])) \n A[c][3] = max(A[c-1][3], max(D[c]))\n else:\n A[c][0] = max(A[c-1][0], max(D[c]))\n A[c][1] = max(A[c-1][1], A[c-1][0]+B[r][c], max(D[c])+B[r][c])\n A[c][2] = max(A[c-1][2], A[c-1][1]+B[r][c])\n A[c][3] = max(A[c-1][3], A[c-1][2]+B[r][c])\nprint(max(A[-1]))", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.lang.reflect.Field;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\nimport java.util.function.IntUnaryOperator;\nimport java.util.function.LongBinaryOperator;\nimport java.util.function.LongUnaryOperator;\n\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Field f = System.out.getClass().getDeclaredField(\"autoFlush\");\n f.setAccessible(true);\n f.set(System.out, false);\n execute(System.in, System.out);\n }\n\n public static void execute(InputStream in, OutputStream out) {\n ExtendedScanner s = new ExtendedScanner(in);\n Out o = new Out(out);\n solve(s, o);\n o.flush();\n o.close();\n }\n\n public static void solve(ExtendedScanner sc, Out out) {\n int r = sc.nextInt();\n int c = sc.nextInt();\n int k = sc.nextInt();\n long[][] g = new long[r + 1][c + 1];\n for (int i = 0; i < k; i++) g[sc.nextInt()][sc.nextInt()] = sc.nextLong();\n long[][][] dp = new long[r + 1][c + 1][4];\n for (int i = 1; i <= r; i++) {\n for (int x = 1; x <= 3; x++) {\n for (int j = 1; j <= c; j++) {\n dp[i][j][x] = Longs.max(dp[i][j - 1][x - 1] + g[i][j], dp[i][j - 1][x]);\n if (x == 1) {\n dp[i][j][x] = Longs.max(dp[i][j][x], g[i][j] + Longs.max(dp[i - 1][j][1], dp[i - 1][j][2], dp[i - 1][j][3]));\n }\n }\n }\n }\n out.writeln(Longs.max(dp[r][c][1], dp[r][c][2], dp[r][c][3]));\n }\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nclass BasicScanner {\n private final InputStream in;\n private final byte[] buf = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public BasicScanner(InputStream in) {this.in = in;}\n private boolean hasNextByte() {\n if (ptr < buflen) return true;\n ptr = 0;\n try {buflen = in.read(buf);}\n catch (final IOException e) {e.printStackTrace();}\n return buflen > 0;\n }\n private int readByte() {return hasNextByte() ? buf[ptr++] : -1;}\n public boolean hasNext() {\n while (hasNextByte() && !(33 <= buf[ptr] && buf[ptr] <= 126)) ptr++;\n return hasNextByte();\n }\n private StringBuilder nextSequence() {\n if (!hasNext()) throw new NoSuchElementException();\n final StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (33 <= b && b <= 126) {sb.appendCodePoint(b); b = readByte();}\n return sb;\n }\n public char nextChar() {\n return (char) readByte();\n }\n public String next() {\n return nextSequence().toString();\n }\n public String next(int len) {\n return new String(nextChars(len));\n }\n public char[] nextChars() {\n final StringBuilder sb = nextSequence();\n int l = sb.length();\n char[] dst = new char[l];\n sb.getChars(0, l, dst, 0);\n return dst;\n }\n public char[] nextChars(int len) {\n if (!hasNext()) throw new NoSuchElementException();\n char[] s = new char[len];\n int i = 0;\n int b = readByte();\n while (33 <= b && b <= 126 && i < len) {s[i++] = (char) b; b = readByte();}\n if (i != len) throw new NoSuchElementException(String.format(\"length %d is longer than the sequence.\", len));\n return s;\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {minus = true; b = readByte();}\n if (b < '0' || '9' < b) throw new NumberFormatException();\n while (true) {\n if ('0' <= b && b <= '9') n = n * 10 + b - '0';\n else if (b == -1 || !(33 <= b && b <= 126)) return minus ? -n : n;\n else throw new NumberFormatException();\n b = readByte();\n }\n }\n public int nextInt() {return Math.toIntExact(nextLong());}\n public double nextDouble() {return Double.parseDouble(next());}\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nclass Out {\n private final OutputStream out;\n private byte[] buf = new byte[1024];\n private int ptr = 0;\n private static final int AUTO_FLUSH_THRETHOLD = 1 << 17;\n\n public Out(OutputStream out) {\n this.out = out;\n }\n\n public void flush() {\n try {\n out.write(buf, 0, ptr);\n out.flush();\n ptr = 0;\n } catch (IOException e) {e.printStackTrace();}\n }\n\n public void close() {\n try {out.close();} catch (IOException e) {e.printStackTrace();}\n }\n\n public Out writeln() {return write('\\n');}\n public Out writeln(Object o) {return write(o).write('\\n');}\n public Out writeln(String s) {return write(s).write('\\n');}\n public Out writeln(char[] c) {return write(c).write('\\n');}\n public Out writeln(char c) {return write(c).write('\\n');}\n public Out writeln(byte b) {return write(b).write('\\n');}\n public Out writeln(int x) {return write(x).write('\\n');}\n public Out writeln(long x) {return write(x).write('\\n');}\n public Out writeln(double d) {return write(d).write('\\n');}\n\n public Out writeSpace() {return write(' ');}\n \n public Out write(Object o) {\n return write(o.toString());\n }\n\n public Out write(String s) {\n try {\n Field strValueField = s.getClass().getDeclaredField(\"value\");\n strValueField.setAccessible(true);\n byte[] b = (byte[]) strValueField.get(s);\n int l = s.length();\n if (l > AUTO_FLUSH_THRETHOLD) {\n flush();\n int i = 0;\n while (i + AUTO_FLUSH_THRETHOLD < l) {\n out.write(b, i, AUTO_FLUSH_THRETHOLD);\n out.flush();\n i += AUTO_FLUSH_THRETHOLD;\n }\n ensureCapacity(l - i);\n System.arraycopy(b, i, buf, 0, l - i);\n ptr = l - i;\n } else {\n ensureCapacity(ptr + l);\n System.arraycopy(b, 0, buf, ptr, l);\n ptr += l;\n }\n } catch (Exception e) {e.printStackTrace();}\n return this;\n }\n\n public Out write(char[] c) {\n int l = c.length;\n if (l > AUTO_FLUSH_THRETHOLD) {\n flush();\n ensureCapacity(AUTO_FLUSH_THRETHOLD);\n int i = 0;\n while (i + AUTO_FLUSH_THRETHOLD < l) {\n for (int j = 0; j < AUTO_FLUSH_THRETHOLD; j++) {\n buf[ptr++] = (byte) c[i + j];\n }\n flush();\n i += AUTO_FLUSH_THRETHOLD;\n }\n for (; i < l; i++) {\n buf[ptr++] = (byte) c[i];\n }\n } else {\n ensureCapacity(ptr + l);\n for (char ch : c) buf[ptr++] = (byte) ch;\n }\n return this;\n }\n\n public Out write(char c) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = (byte) c;\n return this;\n }\n\n public Out write(byte b) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = b;\n return this;\n }\n\n public Out write(int x) {\n if (x == 0) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = '0';\n return this;\n }\n int d = stringSize(x);\n ensureCapacity(ptr + d);\n if (x < 0) {\n buf[ptr++] = '-';\n x = -x;\n d--;\n }\n int j = ptr + d; \n while (x > 0) {\n buf[--j] = (byte) ('0' + (x % 10));\n x /= 10;\n }\n ptr += d;\n return this;\n }\n\n public Out write(long x) {\n if (x == 0) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = '0';\n return this;\n }\n int d = stringSize(x);\n ensureCapacity(ptr + d);\n if (x < 0) {\n buf[ptr++] = '-';\n x = -x;\n d--;\n }\n int j = ptr + d; \n while (x > 0) {\n buf[--j] = (byte) ('0' + (x % 10));\n x /= 10;\n }\n ptr += d;\n return this;\n }\n\n public Out write(double d) {\n return write(Double.toString(d));\n }\n\n private void ensureCapacity(int cap) {\n if (cap > AUTO_FLUSH_THRETHOLD) {\n flush();\n }\n if (cap >= buf.length) {\n int newLength = buf.length;\n while (newLength < cap) newLength <<= 1;\n byte[] newBuf = new byte[newLength];\n System.arraycopy(buf, 0, newBuf, 0, buf.length);\n buf = newBuf;\n }\n }\n private static int stringSize(long x) {\n int d = 1;\n if (x >= 0) {d = 0; x = -x;}\n long p = -10;\n for (int i = 1; i < 19; i++, p *= 10) if (x > p) return i + d;\n return 19 + d;\n }\n private static int stringSize(int x) {\n int d = 1;\n if (x >= 0) {d = 0; x = -x;}\n int p = -10;\n for (int i = 1; i < 10; i++, p *= 10) if (x > p) return i + d;\n return 10 + d;\n }\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nfinal class ExtendedScanner extends BasicScanner {\n public ExtendedScanner(InputStream in) {super(in);}\n public int[] ints(final int n) {\n final int[] a = new int[n];\n Arrays.setAll(a, $ -> nextInt());\n return a;\n }\n public int[] ints(final int n, final IntUnaryOperator f) {\n final int[] a = new int[n];\n Arrays.setAll(a, $ -> f.applyAsInt(nextInt()));\n return a;\n }\n public int[][] ints(final int n, final int m) {\n final int[][] a = new int[n][];\n Arrays.setAll(a, $ -> ints(m));\n return a;\n }\n public int[][] ints(final int n, final int m, final IntUnaryOperator f) {\n final int[][] a = new int[n][];\n Arrays.setAll(a, $ -> ints(m, f));\n return a;\n }\n public long[] longs(final int n) {\n final long[] a = new long[n];\n Arrays.setAll(a, $ -> nextLong());\n return a;\n }\n public long[] longs(final int n, final LongUnaryOperator f) {\n final long[] a = new long[n];\n Arrays.setAll(a, $ -> f.applyAsLong(nextLong()));\n return a;\n }\n public long[][] longs(final int n, final int m) {\n final long[][] a = new long[n][];\n Arrays.setAll(a, $ -> longs(m));\n return a;\n }\n public long[][] longs(final int n, final int m, final LongUnaryOperator f) {\n final long[][] a = new long[n][];\n Arrays.setAll(a, $ -> longs(m, f));\n return a;\n }\n public char[][] charArrays(final int n) {\n final char[][] c = new char[n][];\n Arrays.setAll(c, $ -> nextChars());\n return c;\n }\n public char[][] charArrays(final int n, final int m) {\n final char[][] c = new char[n][];\n Arrays.setAll(c, $ -> nextChars(m));\n return c;\n }\n public double[] doubles(final int n) {\n final double[] a = new double[n];\n Arrays.setAll(a, $ -> nextDouble());\n return a;\n }\n public double[][] doubles(final int n, final int m) {\n final double[][] a = new double[n][];\n Arrays.setAll(a, $ -> doubles(m));\n return a;\n }\n public String[] strings(final int n) {\n final String[] s = new String[n];\n Arrays.setAll(s, $ -> next());\n return s;\n }\n public String[] strings(final int n, final int m) {\n final String[] s = new String[n];\n Arrays.setAll(s, $ -> next(m));\n return s;\n }\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nfinal class Longs {\n private Longs(){}\n public static long max(long a, long b) {\n return Math.max(a, b);\n }\n public static long max(long a, long b, long c) {\n return Math.max(Math.max(a, b), c);\n }\n public static long max(long a, long b, long c, long d) {\n return Math.max(Math.max(Math.max(a, b), c), d);\n }\n public static long max(long a, long b, long c, long d, long e) {\n return Math.max(Math.max(Math.max(Math.max(a, b), c), d), e);\n }\n public static long max(long a, long b, long c, long d, long e, long f) {\n return Math.max(Math.max(Math.max(Math.max(Math.max(a, b), c), d), e), f);\n }\n public static long max(long a, long b, long c, long d, long e, long f, long g) {\n return Math.max(Math.max(Math.max(Math.max(Math.max(Math.max(a, b), c), d), e), f), g);\n }\n public static long max(long a, long b, long c, long d, long e, long f, long g, long h) {\n return Math.max(Math.max(Math.max(Math.max(Math.max(Math.max(Math.max(a, b), c), d), e), f), g), h);\n }\n public static long max(long a, long... vals) {\n long ret = a; for (long e : vals) ret = Math.max(ret, e);\n return ret;\n }\n public static long min(long a, long b) {\n return Math.min(a, b);\n }\n public static long min(long a, long b, long c) {\n return Math.min(Math.min(a, b), c);\n }\n public static long min(long a, long b, long c, long d) {\n return Math.min(Math.min(Math.min(a, b), c), d);\n }\n public static long min(long a, long b, long c, long d, long e) {\n return Math.min(Math.min(Math.min(Math.min(a, b), c), d), e);\n }\n public static long min(long a, long b, long c, long d, long e, long f) {\n return Math.min(Math.min(Math.min(Math.min(Math.min(a, b), c), d), e), f);\n }\n public static long min(long a, long b, long c, long d, long e, long f, long g) {\n return Math.min(Math.min(Math.min(Math.min(Math.min(Math.min(a, b), c), d), e), f), g);\n }\n public static long min(long a, long b, long c, long d, long e, long f, long g, long h) {\n return Math.min(Math.min(Math.min(Math.min(Math.min(Math.min(Math.min(a, b), c), d), e), f), g), h);\n }\n public static long min(long a, long... vals) {\n long ret = a; for (long e : vals) ret = Math.min(ret, e);\n return ret;\n }\n public static long fold(final LongBinaryOperator func, final long... a) {\n long ret = a[0]; for (int i = 1; i < a.length; i++) ret = func.applyAsLong(ret, a[i]);\n return ret;\n }\n public static boolean isPowerOfTwo(final long n) {return n != 0 && (-n & n) == n;}\n public static int ceilExponent(final long n) {return 63 - Long.numberOfLeadingZeros(n) + (isPowerOfTwo(n) ? 0 : 1);}\n public static int floorExponent(final long n) {return 63 - Long.numberOfLeadingZeros(n) + (n == 0 ? 1 : 0);}\n public static int ceilExponent(final long n, final int base) {\n if (base == 2) return ceilExponent(n);\n int i = 0;\n long m = 1;\n while (m < n) {\n i++;\n final long r = m * base;\n if ((m | base) >> 31 != 0 && r / base != m) break;\n m = r;\n }\n return i;\n }\n /**\n * Caluculate the ceil of a/b. Returns the smallest integer greater than or\n * equal to a/b while 'a/b' rounds fractional parts to ZERO.\n * @param a\n * @param b\n * @return the smallest integer greater than or equal to a/b\n */\n public static long cld(final long a, final long b) {\n if (a > 0 && b > 0) return (a + b - 1) / b;\n if (a < 0 && b < 0) return (a + b + 1) / b;\n return a / b;\n }\n\n /**\n * Caluculate the floor of a/b. Returns the largest integer less than or equal\n * to a/b while 'a/b' rounds fractional parts to ZERO.\n * @param a\n * @param b\n * @return the largest integer less than or equal to a/b\n */\n public static long fld(final long a, final long b) {\n if (a <= 0 && b > 0) return (a - b + 1) / b;\n if (a > 0 && b <= 0) return (a - b - 1) / b;\n return a / b;\n }\n public static String join(final String sep, final long... a) {\n final StringBuilder sb = new StringBuilder();\n for (int i = 0; i < a.length; i++) {\n sb.append(a[i]);\n if (i < a.length - 1) sb.append(sep);\n }\n return sb.toString();\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n \nll dp[3001][3001][3], a[3001][3001];\n \nll func(int r, int c, int cnt, int row, int col) {\n if(r > row-1 || c > col-1 || cnt < 0) return 0;\n if(dp[r][c][cnt] != -1) return dp[r][c][cnt];\n return dp[r][c][cnt] = max({func(r+1, c, 2, row, col) + a[r][c], func(r, c+1, cnt, row, col), func(r, c+1, cnt-1, row, col) + a[r][c]});\n}\n \nint main() {\n ll r,c,items, x , y, v, maxi = 0;\n cin >> r >> c >> items;\n while(items--) {\n \tcin >> x >> y >> v;\n \ta[x-1][y-1]=v;\n }\n for(int i=0;i<r;i++) for(int j=0;j<c;j++) for(int k=0;k<4;k++) dp[i][j][k] = -1;\n maxi = func(0, 0, 2, r, c);\n cout << maxi;\n\treturn 0;\n}", "R, C, K = map(int, input().split())\n\nV = [[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[r][c] = v\n\nmax_p = [0]*(C+1)\nfor i in range(R+1):\n now0 = [0]*(C+1)\n now1 = [0]*(C+1)\n now2 = [0]*(C+1)\n now3 = [0]*(C+1)\n for j in range(C+1):\n v = V[i][j]\n la = lb = 0\n if j > 0:\n la = now0[j-1]\n lb = now1[j-1]\n now2[j] = max(now2[j], now2[j-1], lb + v)\n now3[j] = max(now3[j], now3[j-1], now2[j-1] + v)\n if i > 0:\n now0[j] = max(now0[j], max_p[j], la)\n now1[j] = max(now1[j], max_p[j] + v, la + v, lb)\n max_p[j] = max(now0[j], now1[j], now2[j], now3[j])\n\nprint(max(now0[C], now1[C], now2[C], now3[C]))\n", "H, W, K = map(int, input().split())\nA = [[0] * W for _ in range(H)]\nfor i in range(K):\n y, x, v = map(int, input().split())\n A[y - 1][x - 1] = v\ndp = [[0] * 4 for i in range(W)]\npre = []\ndp[0][1] = A[0][0]\nfor i in range(H):\n for j in range(W):\n if i:\n dp[j][0] = max(dp[j][0], max(pre[j]))\n dp[j][1] = max(dp[j][1], max(pre[j]) + A[i][j])\n for k in range(4):\n if j:\n if 0 < k:\n dp[j][k] = max(dp[j][k], dp[j - 1][k - 1] + A[i][j])\n dp[j][k] = max(dp[j][k], dp[j - 1][k])\n pre = dp\nans = 0\nfor j in range(W):\n ans = max(ans, max(dp[j]))\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define ull unsigned long long\n#define pb push_back\nconst int maxn=2e5+10;\nconst int mod=998244353;\nint a[3005][3005];\nll dp[3005][3005][5];\n\n\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(0);\n int r,c,k;\n cin>>r>>c>>k;\n while(k--)\n {\n int x,y,z;\n cin>>x>>y>>z;\n a[x][y]=z;\n }\n ll ans=0;\n\n for(int i=1;i<=r;i++)\n {\n for(int j=1;j<=c;j++)\n {\n dp[i][j][0]=max(dp[i][j-1][0],dp[i-1][j][3]);\n ans=max(ans,dp[i][j][0]);\n for(int x=1;x<=3;x++)\n {\n dp[i][j][x]=max(dp[i-1][j][3]+a[i][j],max(dp[i][j-1][x],dp[i][j-1][x-1]+a[i][j]));\n ans=max(ans,dp[i][j][x]);\n }\n }\n }\n cout<<ans<<'\\n';\n\n\n}\n", "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n R, C, K, *RCV = map(int, read().split())\n\n item = [[0] * C for _ in range(R)]\n for r, c, v in zip(*[iter(RCV)] * 3):\n item[r - 1][c - 1] = v\n\n dp = [0] * (C + 1)\n for i in range(R):\n value = [0] * 4\n for j in range(C):\n if value[0] < dp[j + 1]:\n value[0] = dp[j + 1]\n if item[i][j] > 0:\n for k in range(2, -1, -1):\n if value[k + 1] < value[k] + item[i][j]:\n value[k + 1] = value[k] + item[i][j]\n dp[j + 1] = max(value)\n\n print(dp[C])\n\n return\n\n\nif __name__ == '__main__':\n main()\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nr, c, k = map(int, input().split())\npt = [[0 for _ in range(c + 5)] for _ in range(r + 5)]\n\nfor i in range(k):\n r1, c1, v = map(int, input().split())\n pt[r1][c1] = v\n\nmemo = [[0] * 4 for _ in range(c + 1)]\nprev = [[0] * 4 for _ in range(c + 1)]\nfor i in range(1, r + 1):\n memo, prev = prev, memo\n for j in range(1, c + 1):\n V = pt[i][j]\n memo[j][0] = max(prev[j][3], memo[j - 1][0])\n memo[j][1] = max(memo[j][0] + V, memo[j - 1][1])\n memo[j][2] = max(memo[j][1], memo[j - 1][1] + V, memo[j - 1][2])\n memo[j][3] = max(memo[j][2], memo[j - 1][2] + V, memo[j - 1][3])\nprint(memo[-1][3])\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long r, c, k, v[3004][3004], dp[3004][3004][3];\n\nlong long cal(int i, int j, int cnt){\n if(cnt == 3) return cal(i+1, j, 0);\n if(i >= r || j >= c) return 0;\n long long& ret = dp[i][j][cnt];\n if(ret != -1) return ret;\n ret = max(cal(i+1, j, 0), cal(i, j+1, cnt));\n if(v[i][j]) ret = max(ret, max(v[i][j] + cal(i, j+1, cnt+1), v[i][j] + cal(i+1, j, 0)));\n return ret;\n\n}\n\nvoid solve(){\n cin>>r>>c>>k;\n memset(v, 0, sizeof(v));\n for(int i = 0; i < k; i++){\n int R, C, V;\n cin>>R>>C>>V;\n v[R-1][C-1] = V;\n }\n memset(dp, -1, sizeof(dp));\n cout<<cal(0, 0, 0);\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n int TC;\n //cin>>TC;\n TC=1;\n while(TC--){\n solve();\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll ans=0,f[3005][3005][4];\nint n,m,K,a[3005][3005];\nint main(){\n\tcin>>n>>m>>K;\n\tfor(int i=1;i<=K;i++){\n\t\tint x,y,z;\n\t\tscanf(\"%d%d%d\",&x,&y,&z);\n\t\ta[x][y]=z;\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tfor(int j=1;j<=m;j++){\n\t\t\tfor(int k=0;k<=3;k++)f[i][j][k]=max(f[i-1][j][k],f[i][j-1][k]);\n\t\t\tfor(int k=1;k<=3;k++)f[i][j][k]=max(f[i][j][k],f[i][j-1][k-1]+a[i][j]);\n\t\t\tfor(int k=1;k<=3;k++){\n\t\t\t\tfor(int l=0;l<=3;l++)f[i][j][k]=max(f[i][j][k],f[i-1][j][l]+a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int k=0;k<=3;k++)ans=max(ans,f[n][m][k]);\n\tcout<<ans;\n} ", "#include<bits/stdc++.h>\nusing namespace std;\n\n\ntypedef long long ll;\n\nconst int maxn=3010;\n\nint a[maxn][maxn];\nbool vis[maxn];\nll dp[3005][3005][4];\n\nint main() \n{\n int n,m,k;\n cin>>n>>m>>k;\n \n for( int i=1;i<=k;i++ )\n {\n \tint x,y,w;\n \tcin>>x>>y>>w;\n \ta[x][y]=w;\n }\n \n dp[1][1][1]=a[1][1];\n for( int i=1;i<=n;i++ )\n {\n \tfor( int j=1;j<=m;j++ )\n \t{\n \t\tif( i==1 && j==1 ) continue;\n \t\t\n \t\tll maxup=max(dp[i-1][j][3],max(dp[i-1][j][2],max(dp[i-1][j][1],dp[i-1][j][0])));\n \t\tdp[i][j][0]=max(maxup,dp[i-1][j][0]);\n \t\tfor( int k=1;k<=3;k++ )\n \t\t{\n \t\t\tdp[i][j][k]=max(dp[i][j-1][k-1]+a[i][j],dp[i][j-1][k]);\n \t\t}\n \t\tdp[i][j][1]=max(maxup+a[i][j],dp[i][j][1]);\n \t}\n }\n ll ans=max(dp[n][m][0],max(dp[n][m][1],max(dp[n][m][2],dp[n][m][3])));\n cout<<ans<<endl;\n}", "import java.util.Scanner;\n \npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n \tfinal int R = sc.nextInt();\n final int C = sc.nextInt();\n final int K = sc.nextInt();\n \n final int[][] Val = new int[R][C];\n for (int k = 0; k < K; k++) {\n int r = sc.nextInt() - 1;\n int c = sc.nextInt() - 1;\n int v = sc.nextInt();\n Val[r][c] = v;\n }\n \tlong[][][] data = new long[R][C][4];\n \t//00\n {\n int v = Val[0][0];\n if(v>0)\n data[0][0][1]=v;\n }\n \n //left\n for(int i=1;i<R;i++){\n \tdata[i][0][0]=Long.max(data[i-1][0][0],data[i-1][0][1]);\n int v = Val[i][0];\n if(v>0){\n \tdata[i][0][1]=data[i][0][0]+v;\n }\n }\n \n //up\n for(int j=1;j<C;j++){\n \tint v = Val[0][j];\n \tif(0<v){\n data[0][j][0]=data[0][j-1][0];\n for(int p=1;p<4;p++){\n data[0][j][p]=Long.max(data[0][j-1][p],data[0][j-1][p-1]+v);\n }\n \n }else{\n data[0][j]=data[0][j-1];\n }\n \n }\n \n //DP\n \n for(int i=1;i<R;i++){\n \tfor(int j=1;j<C;j++){\n \tint v = Val[i][j];\n \tlong maxUp = maxFrom4(data[i-1][j]);\n \tif(0<v){\n \tdata[i][j][0]=Long.max(data[i][j-1][0],maxUp);\n \tdata[i][j][1]=maxFrom3(data[i][j-1][1],data[i][j-1][0]+v,maxUp+v);\n \tdata[i][j][2]=Long.max(data[i][j-1][2],data[i][j-1][1]+v);\n \tdata[i][j][3]=Long.max(data[i][j-1][3],data[i][j-1][2]+v);\n } else if (data[i][j - 1][0] < maxUp) {\n data[i][j][0] = maxUp;\n data[i][j][1] = data[i][j - 1][1];\n data[i][j][2] = data[i][j - 1][2];\n data[i][j][3] = data[i][j - 1][3];\n } else {\n data[i][j] = data[i][j - 1];\n }\n \t\n }\n }\n System.out.println(maxFrom4(data[R - 1][C - 1]));\n \n }\n\t\tstatic long maxFrom3(long val1, long val2, long val3) {\n return Long.max(Long.max(val1, val2), val3);\n }\n \n \tstatic long maxFrom4(long[] vals) {\n return Long.max(Long.max(vals[0], vals[1]), Long.max(vals[2], vals[3]));\n }\n}\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.lang.reflect.Array;\nimport java.math.BigInteger;\nimport java.nio.Buffer;\nimport java.util.*;\n\npublic class Main {\n public static class FastReader\n {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader()\n {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next()\n {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n\n public static FastReader r=new FastReader();\n public static void main(String[] args){\n int n=r.nextInt();\n int m=r.nextInt();\n long [][]a=new long[n+1][m+1];\n int k=r.nextInt();\n for(int t=0;t<k;++t){\n int i,j;\n long v;\n i=r.nextInt();\n j=r.nextInt();\n v=r.nextLong();\n a[i][j]=v;\n }\n long [][][]dp=new long[n+1][m+1][4];\n dp[1][1][1]=a[1][1];\n dp[1][1][0]=0;\n for(int i=1;i<=n;++i){\n for(int j=1;j<=m;++j){\n if(i==1&&j==1) continue;\n for(int items=0;items<=3;++items){\n dp[i][j][items]=dp[i][j-1][items];\n }\n for(int items=0;items<=3;++items){\n dp[i][j][0]=Math.max(dp[i][j][0],dp[i-1][j][items]);\n }\n if(a[i][j]!=0){\n for(int items=1;items<=3;++items){\n dp[i][j][items]=Math.max(dp[i][j][items],dp[i][j-1][items-1]+a[i][j]);\n }\n for(int items=0;items<=3;++items){\n dp[i][j][1]=Math.max(dp[i][j][1],dp[i-1][j][items]+a[i][j]);\n }\n }\n }\n }\n long ans=0;\n for(int items=0;items<=3;++items){\n ans=Math.max(ans,dp[n][m][items]);\n }\n System.out.println(ans);\n }\n}\n", "\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int R = sc.nextInt();\n int C = sc.nextInt();\n int k = sc.nextInt();\n long[][] p = new long[R][C];\n for(int i = 0; i < k; i++) {\n int r = sc.nextInt() - 1;\n int c = sc.nextInt() - 1;\n long v = sc.nextLong();\n p[r][c] = v;\n }\n long[][][] dp = new long[R][C][4];\n if(p[0][0] > 0) {\n dp[0][0][1] = p[0][0]; \n }\n for(int i = 0; i < R; i++) {\n for(int j = 0; j < C; j++) {\n //下へ行く\n if(i != (R - 1)) {\n for(int m = 0; m < 4; m++) {\n dp[i + 1][j][0] = Math.max(dp[i + 1][j][0], dp[i][j][m]);\n if(p[i + 1][j] > 0) dp[i + 1][j][1] = Math.max(dp[i + 1][j][1], dp[i][j][m] + p[i + 1][j]);\n }\n }\n \n //右へ行く\n if(j != (C - 1)) {\n for(int m = 0; m < 4; m++) {\n dp[i][j + 1][m] = Math.max(dp[i][j + 1][m], dp[i][j][m]);\n if((p[i][j + 1] > 0) && (m > 0)) dp[i][j + 1][m] = Math.max(dp[i][j + 1][m], dp[i][j][m - 1] + p[i][j + 1]);\n }\n }\n }\n }\n long ans = dp[R - 1][C - 1][0];\n ans = Math.max(ans, dp[R - 1][C - 1][1]);\n ans = Math.max(ans, dp[R - 1][C - 1][2]);\n ans = Math.max(ans, dp[R - 1][C - 1][3]);\n System.out.println(ans);\n }\n}", "import java.io.DataInputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Main {\n static class Reader {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n\n public Reader() {\n din = new DataInputStream(System.in);\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public Reader(String file_name) throws IOException {\n din = new DataInputStream(new FileInputStream(file_name));\n buffer = new byte[BUFFER_SIZE];\n bufferPointer = bytesRead = 0;\n }\n\n public String readLine() throws IOException {\n byte[] buf = new byte[1_000_000]; // line length\n int cnt = 0, c;\n while ((c = read()) != -1) {\n if (c == '\\n')\n break;\n buf[cnt++] = (byte) c;\n }\n return new String(buf, 0, cnt);\n }\n\n public int nextInt() throws IOException {\n int ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n } while ((c = read()) >= '0' && c <= '9');\n\n if (neg)\n return -ret;\n return ret;\n }\n\n public long nextLong() throws IOException {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n\n public double nextDouble() throws IOException {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n\n if (c == '.') {\n while ((c = read()) >= '0' && c <= '9') {\n ret += (c - '0') / (div *= 10);\n }\n }\n\n if (neg)\n return -ret;\n return ret;\n }\n\n private void fillBuffer() throws IOException {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n\n private byte read() throws IOException {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n\n public void close() throws IOException {\n if (din == null)\n return;\n din.close();\n }\n }\n\n void solve(Reader sc, PrintWriter pw) throws IOException {\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n R++;\n C++;\n Map<Integer, Integer> values = new HashMap<>();\n for (int i = 0; i < K; i++) {\n int r = sc.nextInt();\n int c = sc.nextInt();\n int v = sc.nextInt();\n values.put(r * C + c, v);\n }\n\n long[][][] dp = new long[4][R][C];\n// long INF = Long.MAX_VALUE / 10;\n// for (long[][] arrs : dp) {\n// for (long[] arr : arrs) {\n// Arrays.fill(arr, INF);\n// }\n// }\n// dp[0][0][0] = 0;\n\n long result = 0;\n for (int row = 0; row < R; row++) {\n for (int col = 0; col < C; col++) {\n for (int rowCnt = 0; rowCnt <= 3; rowCnt++) {\n// if (dp[rowCnt][row][col] == INF) {\n// continue;\n// }\n //no pickup\n // go right\n if (col - 1 >= 0) {\n dp[rowCnt][row][col] = Math.max(dp[rowCnt][row][col - 1], dp[rowCnt][row][col]);\n }\n if (row - 1 >= 0) {\n if (rowCnt == 0) {\n for (int prev = 0; prev <= 3; prev++)\n dp[0][row][col] = Math.max(dp[0][row][col], dp[prev][row - 1][col]);\n }\n }\n\n // pickup\n int key = row * C + col;\n if (values.containsKey(key)) {\n int value = values.get(key);\n // go right\n if (rowCnt >= 1) {\n if (col - 1 >= 0) {\n dp[rowCnt][row][col] = Math.max(dp[rowCnt][row][col], dp[rowCnt - 1][row][col - 1] + value);\n }\n }\n if (row - 1 >= 0) {\n if (rowCnt == 1) {\n for (int prev = 0; prev <= 3; prev++)\n dp[1][row][col] = Math.max(dp[1][row][col], dp[prev][row - 1][col] + value);\n }\n }\n }\n }\n }\n }\n\n for (int i = 0; i <= 3; i++) {\n result = Math.max(result, dp[i][R-1][C - 1]);\n }\n pw.println(result);\n }\n\n public static void main(String[] args) throws IOException {\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n// PrintWriter pw = new PrintWriter(System.out, true);\n new Main().solve(sc, pw);\n pw.flush();\n pw.close();\n sc.close();\n }\n}\n\n\n", "f=lambda:map(int,input().split())\ng=range\nR,C,K=f()\na=[[0]*(R+1) for _ in g(C+1)]\nfor _ in g(K):\n r,c,v=f()\n a[c][r]=v\ndp=[[0]*4 for _ in g(R+1)]\nfor i in g(1,C+1):\n for j in g(1,R+1):\n t=a[i][j]\n if t:\n for k in [3,2,1]:\n dp[j][k]=max(dp[j][k],dp[j][k-1]+t)\n dp[j][1]=max(dp[j][1],max(dp[j-1])+t)\n dp[j][0]=max(dp[j][0],max(dp[j-1]))\nprint(max(dp[R]))", "//package com.company;\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n//****Use Integer Wrapper Class for Arrays.sort()****\npublic class Main {\n static long[][][] dp;\n static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));\n public static void main(String[] Args)throws Exception{\n FastReader scan=new FastReader(System.in);\n int t=1;\n// t=scan.nextInt();\n while(t-->0){\n int r=scan.nextInt();\n int c=scan.nextInt();\n int k=scan.nextInt();\n int[][] mat=new int[r][c];\n for(int i=0;i<k;i++){\n int ri=scan.nextInt();\n int ci=scan.nextInt();\n mat[ri-1][ci-1]=scan.nextInt();\n }\n dp=new long[r][c][4];\n for(int i=r-1;i>=0;i--){\n for(int j=c-1;j>=0;j--){\n for(int l=0;l<4;l++){\n long fi=0;\n if(j<c-1){\n fi=dp[i][j+1][l];\n }\n long se=0;\n if(i<r-1){\n se=dp[i+1][j][3];\n }\n long th=0;\n if(l>0&&mat[i][j]>0){\n th=mat[i][j];\n if(j<c-1){\n th+=dp[i][j+1][l-1];\n }\n th=Math.max(th,mat[i][j]+se);\n }\n dp[i][j][l]=Math.max(fi,Math.max(th,se));\n }\n }\n }\n out.println(dp[0][0][3]);\n }\n out.flush();\n out.close();\n }\n static long recur(int[][] mat,int i,int j,int r,int c,long[][][] dp,int avai){\n if(i==r||j==c){\n return 0;\n }\n if(dp[i][j][avai]!=-1){\n return dp[i][j][avai];\n }\n dp[i][j][avai]=0;\n long fi=recur(mat,i,j+1,r,c,dp,avai);\n long se=recur(mat,i+1,j,r,c,dp,3);\n long th=0;\n if(avai>0) {\n th=mat[i][j]+recur(mat,i,j+1,r,c,dp,avai-1);\n th=Math.max(th,mat[i][j]+se);\n }\n dp[i][j][avai]=Math.max(fi,Math.max(th,se));\n return dp[i][j][avai];\n }\n static class FastReader {\n\n byte[] buf = new byte[2048];\n int index, total;\n InputStream in;\n\n FastReader(InputStream is) {\n in = is;\n }\n\n int scan() throws IOException {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }\n\n String next() throws IOException {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n int nextInt() throws IOException {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n long nextLong() throws IOException {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n }\n}\n", "import sys\ninput = sys.stdin.buffer.readline\nH, W, K = map(int, input().split())\nB = {}\nfor _ in range(K):\n r, c, v = map(int, input().split())\n B[(r, c)] = v\n\ndp = [[0]*(W+1) for _ in range(4)]\n\nfor i in range(1, H+1):\n for j in range(1, W+1):\n if (i, j) in B:\n v = B[(i, j)]\n dp[0][j] = max(dp[0][j-1], dp[0][j], dp[1][j], dp[2][j], dp[3][j])\n dp[1][j] = max(dp[1][j-1], dp[0][j]+v)\n dp[2][j] = max(dp[2][j-1], dp[1][j-1]+v)\n dp[3][j] = max(dp[3][j-1], dp[2][j-1]+v)\n else:\n dp[0][j] = max(dp[0][j-1], dp[0][j], dp[1][j], dp[2][j], dp[3][j])\n dp[1][j] = dp[1][j-1]\n dp[2][j] = dp[2][j-1]\n dp[3][j] = dp[3][j-1]\n\nprint(max(dp[i][-1] for i in range(4)))\n", "R,C,k = map(int,input().split())\ndp1 = [[0]*(C+1) for i in range(R+1)]\ndp2 = [[0]*(C+1) for i in range(R+1)]\ndp3 = [[0]*(C+1) for i in range(R+1)]\nfor i in range(k):\n r,c,v = map(int,input().split())\n dp1[r][c] = v\nfor i in range(1,R+1):\n for j in range(1,C+1):\n a = dp1[i][j]\n dp3[i][j] = max(dp2[i][j-1]+a,dp3[i][j-1])\n dp2[i][j] = max(dp1[i][j-1]+a,dp2[i][j-1])\n dp1[i][j] = max(dp1[i-1][j]+a,dp2[i-1][j]+a,dp3[i-1][j]+a,dp1[i][j-1],a)\nprint(max(dp1[R][C],dp2[R][C],dp3[R][C]))", "#include<bits/stdc++.h>\nusing namespace std;\nconst int N=3e3+7;\nlong long dp[N][N][4],v[N][N];\n\nint main()\n{\n\tint r,c,n;\n\tscanf(\"%d%d%d\",&r,&c,&n);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint x,y;\n\t\tscanf(\"%d%d\",&x,&y);\n\t\tscanf(\"%lld\",&v[x][y]);\n\t}\n\tfor(int i=1;i<=r;i++)\n\t{\n\t\tfor(int j=1;j<=c;j++)\n\t\t{\n\t\t\tint is=v[i][j]?1:0;\n\t\t\tfor(int t=0;t<=3;t++)\n\t\t\t\tdp[i][j][0]=max(dp[i][j][0],dp[i-1][j][t]);\n\t\t\tif(is)\n\t\t\t\tdp[i][j][1]=dp[i][j][0]+v[i][j];\n\n\t\t\tfor(int k=0;k<=3;k++)\n\t\t\t{\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k]);\n\t\t\t\tif(is&&k)\n\t\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k-1]+v[i][j]);\n\t\t\t}\n\n\t\t}\n\t}\n\tlong long ans=0;\n\tfor(int t=0;t<=3;t++)\n\t\tans=max(ans,dp[r][c][t]);\n\tprintf(\"%lld\\n\",ans);\n}\n", "#include<iostream>\nusing namespace std;\nlong long maps[3005][3005]={0};\nlong long dp[3005][3005][5]={0};\nint main(){\n int h,w;\n int k;\n \n \n cin>>h>>w;\n cin>>k;\n for(int i=0;i<k;i++){\n int r,c,v;\n cin>>r>>c>>v;\n maps[r][c]=v;\n }\n \n\n dp[1][1][1]=maps[1][1];\n for(int i=1;i<=h;i++){\n for(int j=1;j<=w;j++){\n for(int l=3;l>=0;l--){\n\tdp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][l]);\n\tdp[i+1][j][1]=max(dp[i+1][j][1],dp[i][j][l]+maps[i+1][j]);\n\tdp[i][j+1][l]=max(dp[i][j+1][l],dp[i][j][l]);\n\tif(l<3){\n\t dp[i][j+1][l+1]=max(dp[i][j+1][l+1],dp[i][j][l]+maps[i][j+1]);\n\t}\n }\n }\n }\n \n long long maxim=0;\n for(int i=0;i<=3;i++){\n maxim=max(maxim,dp[h][w][i]);\n }\n cout<<maxim<<endl;\n return(0);\n}", "import sys\ninput = sys.stdin.readline\n\nr, c, k = map(int, input().split())\nv = [[0 for _ in range(c)] for _ in range(r)]\n\nfor i in range(k):\n rr, cc, vv = map(int, input().split())\n rr, cc = rr - 1, cc - 1\n v[rr][cc] = vv\n\ndp = [[0 for _ in range(c + 1)] for _ in range(4)]\nfor y in range(r):\n tmp = [[0 for _ in range(c + 1)] for _ in range(4)]\n for x in range(c):\n for i in range(2, -1, -1):\n dp[i + 1][x] = max(dp[i + 1][x], dp[i][x] + v[y][x])\n for i in range(4):\n tmp[0][x] = max(tmp[0][x], dp[i][x])\n dp[i][x + 1] = max(dp[i][x + 1], dp[i][x])\n dp = tmp\nprint(dp[0][c - 1])\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\nconst int N=3010;\nLL dp[N][N][4],mp[N][N];\nint main()\n{\n int n,m,nn;\n scanf(\"%d%d%d\",&n,&m,&nn);\n for(int i=1;i<=nn;i++)\n {\n int r,c;\n scanf(\"%d%d\",&r,&c);\n scanf(\"%lld\",&mp[r][c]);\n }\n for(int i=1;i<=n;i++)\n {\n for(int j=1;j<=m;j++)\n {\n for(int k=1;k<=3;k++)\n {\n dp[i][j][k]=max(dp[i][j][k],max(dp[i][j-1][k],dp[i][j-1][k-1]+mp[i][j]));\n dp[i][j][0]=max(dp[i][j][0],dp[i-1][j][k]);\n dp[i][j][1]=max(dp[i][j][1],dp[i-1][j][k]+mp[i][j]);\n }\n }\n }\n LL res=0;\n for(int k=1;k<=3;k++)\n res=max(res,dp[n][m][k]);\n cout<<res<<endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\n#define maxn 3001\nusing namespace std;\ntypedef long long LL;\n\nint n,m,k;\nint ar[maxn][maxn];\nLL dp[maxn][maxn][4];\n\nLL f(int r , int c , int d) {\n\tif(dp[r][c][d] != -1)\n\t\treturn dp[r][c][d];\n\tdp[r][c][d] = 0;\n\tif(r < n) {\n\t\tdp[r][c][d] = max( dp[r][c][d] , f(r+1,c,0) );\n\t\tdp[r][c][d] = max( dp[r][c][d] , f(r+1,c,1) + ar[r+1][c] );\n\t}\n\tif(c < m) {\n\t\tdp[r][c][d] = max( dp[r][c][d] , f(r,c+1,d) );\n\t\tif(d < 3)\n\t\t\tdp[r][c][d] = max( dp[r][c][d] , f(r,c+1,d+1) + ar[r][c+1] );\n\t}\n\treturn dp[r][c][d];\n}\n\nint main() {\n\tscanf(\"%d%d%d\",&n,&m,&k);\n\tfor( int i = 0 , x,y,z ; i < k ; i++ ) {\n\t\tscanf(\"%d%d%d\",&x,&y,&z);\n\t\tar[x][y] = z;\n\t}\n\tmemset(dp,-1,sizeof(dp));\n\tLL ans = max( f(1,1,0) , f(1,1,1) + ar[1][1] );\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define chmax(a, b) a = max(a, b);\n\nlong long dp[3005][3005][4];\n\nint main()\n{\n\tint r, c, n;\n\tcin >> r >> c >> n;\n\tvector<vector<int>> d(3000, vector<int>(3000));\n\tfor(int i = 0; i < n; i++) {\n\t\tint h, w, v;\n\t\tcin >> h >> w >> v;\n\t\td[h - 1][w - 1] = v;\n\t}\n\tfor(int i = 0; i < r; i++) {\n\t\tfor(int j = 0; j < c; j++) {\n\t\t\tfor(int k = 2; k >= 0; k--) {\n\t\t\t\tchmax(dp[i][j][k + 1], dp[i][j][k] + d[i][j]);\n\t\t\t}\n\t\t\tfor(int k = 0; k < 4; k++) {\n\t\t\t\tchmax(dp[i + 1][j][0], dp[i][j][k]);\n\t\t\t\tchmax(dp[i][j + 1][k], dp[i][j][k]);\n\t\t\t}\n\t\t}\n\t}\n\tlong long ans = 0;\n\tfor(int i = 0; i < 4; i++) chmax(ans, dp[r - 1][c - 1][i]);\n\tcout << ans << endl;\n return 0;\n}\n", "R,C,K=map(int, input().split())\nM=[[0 for i in range(C)]for i in range(R)]\nfor i in range(K):\n r,c,v=map(int, input().split())\n r-=1\n c-=1\n M[r][c]=v\ndp0=[[0 for j in range(C)] for i in range(R)]\ndp1=[[0 for j in range(C)] for i in range(R)]\ndp2=[[0 for j in range(C)] for i in range(R)]\ndp3=[[0 for j in range(C)] for i in range(R)]\ndp1[0][0]+=M[0][0]\nfor r in range(R):\n for c in range(C):\n if 0<r:\n dp1[r][c]=max(max(dp1[r-1][c],dp2[r-1][c],dp3[r-1][c])+M[r][c],dp1[r][c])\n dp0[r][c]=max(max(dp1[r-1][c],dp2[r-1][c],dp3[r-1][c]),dp0[r][c])\n if 0<c:\n dp3[r][c]=max(dp2[r][c-1]+M[r][c],dp3[r][c],dp3[r][c-1])\n dp2[r][c]=max(dp1[r][c-1]+M[r][c],dp2[r][c],dp2[r][c-1])\n dp1[r][c]=max(dp0[r][c-1]+M[r][c],dp1[r][c],dp1[r][c-1])\n dp0[r][c]=max(dp0[r][c-1],dp0[r][c])\nprint(max(dp1[-1][-1],dp2[-1][-1],dp3[-1][-1]))", "\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main implements Runnable { // クラス名はMain1\n\n\tPrintWriter out = new PrintWriter(System.out);\n\tInputReader sc = new InputReader(System.in);\n\n\tpublic static void main(String[] args) {\n\t\tThread.setDefaultUncaughtExceptionHandler((t, e) -> System.exit(1));\n\t\tnew Thread(null, new Main(), \"\", 1024 * 1024 * 1024).start(); // 16MBスタックを確保して実行\n\t}\n\n\tpublic void run() {\n\n\t\ttry {\n\t\t\t//String S = sc.next().trim();\n\t\t\tint R = sc.nextInt();\n\t\t\tint C = sc.nextInt();\n\t\t\tint K = sc.nextInt();\n\t\t\tlong[][] rcv = new long[R + 1][C + 1];\n\n\t\t\tfor (int i = 0; i < K; i++) {\n\t\t\t\tint r = sc.nextInt();\n\t\t\t\tint c = sc.nextInt();\n\t\t\t\tlong v = sc.nextLong();\n\t\t\t\trcv[r][c] = v;\n\t\t\t}\n\n\t\t\tlong[][][] dp = new long[R + 1][C + 1][5];\n\n\t\t\tfor (int i = 1; i <= R; i++) {\n\t\t\t\tfor (int j = 1; j <= C; j++) {\n\t\t\t\t\tdp[i][j][0] = Math.max(dp[i][j - 1][0], dp[i - 1][j][4]);\n\t\t\t\t\tdp[i][j][1] = Math.max(dp[i][j - 1][1], dp[i - 1][j][4] + rcv[i][j]);\n\t\t\t\t\tdp[i][j][2] = Math.max(dp[i][j - 1][2], dp[i][j - 1][1] + rcv[i][j]);\n\t\t\t\t\tdp[i][j][3] = Math.max(dp[i][j - 1][3], dp[i][j - 1][2] + rcv[i][j]);\n\t\t\t\t\tdp[i][j][4] = Math.max(Math.max(dp[i][j][0], dp[i][j][1]), Math.max(dp[i][j][2], dp[i][j][3]));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//out.println(Arrays.toString(A));\n\n\t\t\tout.println(dp[R][C][4]);\n\n\t\t} catch (ArithmeticException ae) {\n\t\t\t//ae.printStackTrace();\n\t\t\tthrow new RuntimeException();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tthrow new RuntimeException();\n\t\t} finally {\n\t\t\tout.flush();\n\t\t\tout.close();\n\t\t}\n\n\t}\n\n\t///////////////////////////////////////////////////////////\n\t//Ignore\n\t///////////////////////////////////////////////////////////\n\tstatic class InputReader {\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef int64_t ll;\n\nll r,c,k,a,b,d,dp[3001][3001][4],v[3001][3001];\n\nint main(){\n cin>>r>>c>>k;\n for(int i=1;i<=k;i++){cin>>a>>b>>d;v[a][b]=d;}\n for(int i=1;i<=r;i++){\n for(int j=1;j<=c;j++){\n for(int k=0;k<=3;k++){\n dp[i][j][k]=max(dp[i][j-1][k],dp[i-1][j][3]);\n if(k){\n dp[i][j][k]=max(dp[i][j][k],max(dp[i][j-1][k-1],dp[i-1][j][3])+v[i][j]);\n }\n }\n }\n }\n cout<<dp[r][c][3]<<endl;\n}\n", "# -*- coding: utf-8 -*-\nimport sys\nfrom collections import defaultdict\nR,C,K=map(int, sys.stdin.readline().split())\n\nvalue=defaultdict(lambda: 0)\nvalue=[ [0 for _ in range(C+1)] for __ in range(R+1) ]\nfor _ in range(K):\n r,c,v=map(int, sys.stdin.readline().split())\n value[r][c]=v\n\ndp0=[0]*(C+1)\ndp1=[0]*(C+1)\ndp2=[0]*(C+1)\ndp3=[0]*(C+1)\n\nfor r in range(1,R+1):\n for c in range(1,C+1):\n #今のマスにアイテムがある場合\n if 0<value[r][c]:\n dp3[c]=max( dp3[c-1], dp2[c-1]+value[r][c] )\n dp2[c]=max( dp2[c-1], dp1[c-1]+value[r][c] )\n #dp1[c]=max( dp1[c-1], dp0[c-1]+value[r][c], dp0[c]+value[r][c] )\n dp1[c]=max( dp1[c-1], dp0[c]+value[r][c] )\n #dp0[c]=max( dp0[c-1], dp0[c] )\n dp0[c]=dp0[c]\n #今のマスにアイテムがない場合\n else:\n #dp0[c]=max( dp0[c-1], dp0[c] )\n #dp1[c]=max( dp1[c-1], dp1[c] )\n #dp2[c]=max( dp2[c-1], dp2[c] )\n #dp3[c]=max( dp3[c-1], dp3[c] )\n dp0[c]=dp0[c]\n dp1[c]=dp1[c-1]\n dp2[c]=dp2[c-1]\n dp3[c]=dp3[c-1]\n\n #上の行にアイテムをコピー\n for c in range(1,C+1):\n dp0[c]=max( dp0[c], dp1[c], dp2[c], dp3[c] )\n dp1=[0]*(C+1)\n dp2=[0]*(C+1)\n dp3=[0]*(C+1)\n\nprint dp0[C]\n", "#include <bits/stdc++.h>\n#define fi first\n#define se second\n#define mp make_pair\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst double eps = 1e-8;\nconst int NINF = 0xc0c0c0c0;\nconst int INF = 0x3f3f3f3f;\nconst ll mod = 1e9 + 7;\nconst ll N = 3e3 + 5;\n\nll R,C,K,a[N][N],f[N][N][4];\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cin>>R>>C>>K;\n for(int i=1;i<=K;i++){\n \tint u,v,w;\n \tcin>>u>>v>>w;\n \ta[u][v]=w;\n }\n ll ans=0;\n for(int i=1;i<=R;i++)\n \tfor(int j=1;j<=C;j++)\n \t\tfor(int k=1;k<=3;k++)\n \t\t\tf[i][j][k]=max(f[i-1][j][3]+a[i][j],max(f[i][j-1][k-1]+a[i][j],f[i][j-1][k]));\n cout<<f[R][C][3]<<'\\n';\n return 0;\n}", "r,c,k = map(int,input().split())\ndp = [[[0]*(c+1) for _ in range(r+1)] for _ in range(4)]\ng = [[0]*(c+1) for _ in range(r+1)]\nfor _ in range(k):\n a,b,v = map(int,input().split())\n g[a][b] = v\n\nfor i in range(r+1):\n for j in range(c+1):\n for m in range(4):\n tmp =dp[m][i][j]\n if i+1<=r:\n dp[0][i+1][j] = max(tmp,dp[0][i+1][j])\n dp[1][i+1][j] = max(dp[1][i+1][j],tmp + g[i+1][j])\n if j+1<=c:\n dp[m][i][j+1] = max(dp[m][i][j+1],tmp)\n if m<3:\n dp[m+1][i][j+1] = max(dp[m+1][i][j+1],tmp + g[i][j+1]) \nans = 0\nfor m in range(4):\n ans = max(ans,dp[m][-1][-1])\nprint(ans)\n ", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define ll long long int\n#define pii pair<int,int>\n\nconst ll sz=3010;\nll dp[sz][sz][4];\nll R,C;\nll ara[sz][sz];\n\nll cholo(ll r,ll c, ll rem)\n{\n\n ll &ret=dp[r][c][rem];\n if(~ret) return ret;\n\n ll mx=0;\n if(rem>0) mx=ara[r][c];\n\n if(r+1<=R){\n if(rem>0) mx=max(mx, ara[r][c]+cholo(r+1,c,3));\n else mx=max(mx, cholo(r+1,c,3));\n }\n if(c+1<=C){\n if(rem>0) mx=max(mx, ara[r][c]+cholo(r,c+1,rem-1));\n mx=max(mx, cholo(r,c+1,rem));\n }\n\n return (ret = mx);\n}\n\nint main()\n{\n ll n,m,i,j,k,x;\n\n cin>>R>>C>>k;\n\n for(i=1;i<=k;i++){\n cin>>n>>m>>x;\n ara[n][m]=x;\n }\n\n memset(dp,-1,sizeof dp);\n ll ans=cholo(1,1,3);\n cout<<ans<<'\\n';\n}\n", "#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\nconst int N=3333;\nint a[N][N];\nll f[N][N][4];\nint n,m,k;\nint main(){\n\tint x,y,v;\n\tscanf(\"%d%d%d\",&n,&m,&k);\n\tfor (int i=1; i<=k; i++){\n\t\tscanf(\"%d%d%d\",&x,&y,&v);\n\t\ta[x][y]=v;\t\t\n\t}\n\tfor (int i=1; i<=n; i++)\n\t\tfor (int j=1; j<=m; j++){\n\t\t\tfor (int k=0; k<=3; k++){\n\t\t\t\tif (k)\tf[i][j][k]=max(f[i][j][k],f[i][j-1][k-1]+a[i][j]);\n\t\t\t\tf[i][j][k]=max(f[i][j][k],f[i][j-1][k]);\n\t\t\t}\n\t\t\tfor (int k=0; k<=3; k++){\n\t\t\t\tf[i][j][0]=max(f[i][j][0],f[i-1][j][k]);\n\t\t\t\tf[i][j][1]=max(f[i][j][1],f[i-1][j][k]+a[i][j]);\n\t\t\t}\n\t\t}\n\tll ans=0;\n\tfor (int i=0; i<=3; i++)\n\t\tans=max(ans,f[n][m][i]);\n\tprintf(\"%lld\\n\",ans);\n return 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n private static class FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n int r = sc.nextInt();\n int c = sc.nextInt();\n int k = sc.nextInt();\n long[][] v = new long[r + 1][c + 1];\n for (int i = 0; i < k; i++) {\n int ri = sc.nextInt();\n int ci = sc.nextInt();\n long vi = sc.nextLong();\n v[ri][ci] = vi;\n }\n long[][][] dp = new long[r + 1][c + 1][4];\n for (int i = 1; i <= r; i++) {\n for (int j = 1; j <= c; j++) {\n dp[i][j][0] = dp[i - 1][j][0];\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i - 1][j][1]);\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i - 1][j][2]);\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i - 1][j][3]);\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i][j - 1][0]);\n dp[i][j][1] = dp[i][j - 1][1];\n dp[i][j][1] = Math.max(dp[i][j - 1][0] + v[i][j], dp[i][j][1]);\n dp[i][j][1] = Math.max(dp[i - 1][j][1] + v[i][j], dp[i][j][1]);\n dp[i][j][1] = Math.max(dp[i - 1][j][2] + v[i][j], dp[i][j][1]);\n dp[i][j][1] = Math.max(dp[i - 1][j][3] + v[i][j], dp[i][j][1]);\n dp[i][j][2] = Math.max(dp[i][j - 1][1] + v[i][j], dp[i][j - 1][2]);\n dp[i][j][3] = Math.max(dp[i][j - 1][2] + v[i][j], dp[i][j - 1][3]);\n }\n }\n long result = 0L;\n for (int i = 0; i <= 3; i++) result = Math.max(result, dp[r][c][i]);\n System.out.println(result);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(v) v.begin(), v.end()\n#define ll int64_t\n#define _GLIBCXX_DEBUG\n\nll dp[3005][3005][5];\n ll m[3005][3005];\nint main(){\n int r,c,k;\n cin >> r >> c >> k;\n \n rep(i,r+1){\n rep(j,c+1){\n rep(p,5){\n dp[i][j][p]=0;\n m[i][j]=0;\n }\n }\n }\n rep(i,k){\n int a,b;\n ll x;\n cin >>a>>b>>x;\n m[a][b]=x;\n }\n rep(i,r){\n rep(j,c){\n dp[i+1][j+1][0]=max(dp[i][j+1][4],dp[i+1][j][0]);\n for(int p=1;p<4;p++)\n dp[i+1][j+1][p+1]=max(dp[i][j+1][4]+m[i+1][j+1],max(dp[i+1][j][p]+m[i+1][j+1],dp[i+1][j][p+1]));\n }\n }\n cout << dp[r][c][4] << endl;\n}\n", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nll V[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n ll R, C, K; cin >> R >> C >> K;\n rep(i, K){\n ll r, c, v; cin >> r >> c >> v;\n r--; c--;\n V[r][c] = v;\n }\n\n rep(i, R){\n rep(j, C){\n for (int k = 3; k > 0; k--){\n dp[i][j][k] = max(dp[i][j][k], dp[i][j][k-1] + V[i][j]);\n }\n rep(k, 4){\n dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][k]);\n dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n }\n\n ll ma = 0;\n rep(k, 4){\n ma = max(ma, dp[R-1][C-1][k]);\n }\n cout << ma << endl;\n \n return 0;\n}", "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nusing ll = int64_t;\n#define rep(i, j, n) for (int i = j; i < (int)n; ++i)\n\nll dp[3003][3003][4];\nll gs[3003][3003];\nint main() {\n int r, c, k, y, x, v;\n cin >> r >> c >> k;\n\n rep(i, 0, k) {\n cin >> y >> x >> v;\n --y, --x;\n gs[y][x] = v;\n }\n\n rep(i, 0, r) rep(j, 0, c) rep(a, 0, 4) {\n if (a + 1 < 4) {\n dp[i][j + 1][a + 1] = max(dp[i][j + 1][a + 1], dp[i][j][a] + gs[i][j]);\n dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][a] + gs[i][j]);\n }\n dp[i][j + 1][a] = max(dp[i][j + 1][a], dp[i][j][a]);\n dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][a]);\n }\n\n ll ans = 0;\n rep(a, 0, 4) {\n ans = max(ans, dp[r][c - 1][a]);\n ans = max(ans, dp[r - 1][c][a]);\n }\n cout << ans << '\\n';\n\n return 0;\n}", "#include <iostream>\nusing namespace std;\ntypedef long long Int;\n\nInt H, W, K, h, w, v;\nInt dp[5500][5500][4], fld[5500][5500];\n\nint main() {\n cin >> H >> W >> K;\n for (int _ = 0; _ < K; _++) {\n cin >> h >> w >> v;\n fld[h - 1][w - 1] = v;\n }\n\n for (int i = 1; i <= H; i++) {\n for (int j = 1; j <= W; j++) {\n Int v = fld[i - 1][j - 1];\n for (int k = 0; k < 4; k++) {\n dp[i][j][0] = max(dp[i][j][0], dp[i - 1][j][k]);\n if (0 < i) {\n dp[i][j][1] = max(dp[i][j][1], dp[i - 1][j][k] + v);\n }\n dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k]);\n if (0 < k - 1) {\n dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k - 1] + v);\n }\n }\n }\n }\n\n Int ans = 0;\n for (int i = 0; i < 4; i++) {\n ans = max(ans, dp[H][W][i]);\n }\n cout << ans << endl;\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define ll long long\n#define P pair<int,int>\n#define PI 3.141592653589793\nconst int INF = 1001001001;\nconst ll MX = 1e18;\nconst int mod = 1000000007;\ntemplate<class T> inline bool chmax(T& a, T b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n\tint R, C, n;\n\tcin >> R >> C >> n;\n\trep(i, n) {\n\t\tint r,c,v;\n\t\tcin >> r >> c >> v;\n\t\tr--; c--;\n\t\ta[r][c] = v;\n\t}\n\tdp[0][0][0] = 0;\n\trep(i, R)rep(j, C) {\n\t\tfor (int K = 2; K >= 0; K--) {\n\t\t\tchmax(dp[i][j][K+1], dp[i][j][K] + a[i][j]);\n\t\t}\n\t\trep(k, 4) {\n\t\t\tchmax(dp[i + 1][j][0], dp[i][j][k]);\n\t\t\tchmax(dp[i][j+1][k], dp[i][j][k]);\n\t\t}\n\t}\n\tll ans = 0;\n\trep(k,4) {\n\t\tans = max(ans,dp[R-1][C-1][k]);\n\t}\n\tcout << ans << endl;\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i=0; i<(n); ++i)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint a[3010][3010];\nll dp[3010][3010][4];\n\nint main(){\n int R,C,K;\n cin>>R>>C>>K;\n rep(i,K){\n int r,c,v; cin>>r>>c>>v;\n a[r-1][c-1]=v;\n }\n for(int i=0; i<R; ++i){\n for(int j=0; j<C; ++j){\n for(int k=2; k>=0; --k){\n dp[i][j][k+1]=max(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n }\n rep(k,4){\n dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n }\n ll ans=0;\n rep(i,4)ans=max(ans,dp[R-1][C-1][i]);\n cout<<ans<<endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define pb pushback\n#define fr(i,n) for(int i=0;i<n;i++)\n#define fro(i,j,n) for(int i=j;i<n;i++)\n#define ifr(i,n) for(int i=n-1;i>=0;i--)\n\nint main() {\n int r,c,k,x,y,z;\n\tcin >> r>> c>> k;\n ll a[3*r+1][c];\n int v[r][c];\n fr(i,r){\n fr(j,c){\n v[i][j]=0;\n }\n }\n fr(i,k){\n cin >> x>> y >> z;\n v[x-1][y-1]=z;\n }\n fr(i,3*r+1){\n fr(j,c){\n if(i==0)a[i][j]=0;\n else if(j==0)a[i][j]=a[int((i-1)/3)*3][j]+v[(i-1)/3][0];\n else if(i%3==1){\n a[i][j]=max(a[i-1][j]+v[(i-1)/3][j],a[i][j-1]);\n }\n else{\n a[i][j]=max(a[i-1][j-1]+v[(i-1)/3][j],max(a[i-1][j],a[i][j-1]));\n }\n }\n }\n cout <<a[3*r][c-1]<< endl;\n}", "f,g,h=range,max,input\nR,C,K=map(int,h().split())\nG=[[0]*-~C for i in f(R+1)]\nfor i in'_'*K:r,c,v=map(int,h().split());G[r][c]=v\nF=[[[0]*-~C for i in f(R+1)]for i in f(4)]\nfor r in f(1,R+1):\n\tfor x in f(1,4):\n\t\tfor c in f(1,C+1):F[x][r][c]=g(F[x-1][r][c],F[x-1][r][c-1]+G[r][c],F[x][r][c-1],(x<2)*(G[r][c]+F[3][r-1][c]))\nprint(F[3][R][C])", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nll dp[3001][3001][3], a[3001][3001];\n\nint main() {\n ll r,c,items, x , y, v, maxi = 0;\n cin >> r >> c >> items;\n while(items--) {\n \tcin >> x >> y >> v;\n \tx--, y--;\n \tdp[x][y][0] = a[x][y] = v;\n }\n for(int i=0;i<r;i++) for(int j=0;j<c;j++) {\n for(int k=0;k<3;k++) {\n if(j+1 < c) dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k]);\n if(j+1 < c && k > 0) dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k-1] + a[i][j+1]);\n }\n if(i+1 < r) dp[i+1][j][0] = dp[i+1][j][1] = dp[i+1][j][2] = max({dp[i][j][0], dp[i][j][1], dp[i][j][2]}) + a[i+1][j];\n }\n for(int k=0;k<3;k++) maxi=max(maxi,dp[r-1][c-1][k]);\n cout << maxi;\n\treturn 0;\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n static int rmax = 3;\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int r = Integer.parseInt(scan.next());\n int c = Integer.parseInt(scan.next());\n int k = Integer.parseInt(scan.next());\n int[][] item = new int[r][c];\n for (int i = 0; i < k; i++) {\n int rk = Integer.parseInt(scan.next());\n int ck = Integer.parseInt(scan.next());\n int vk = Integer.parseInt(scan.next());\n rk--;\n ck--;\n item[rk][ck] = vk;\n }\n scan.close();\n\n long[][][] dp = new long[r][c][rmax + 1];\n if (item[0][0] != 0) {\n dp[0][0][1] = item[0][0];\n }\n\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n for (int l = 0; l <= rmax; l++) {\n // 下方向への移動\n if (i + 1 < r) {\n dp[i + 1][j][1] = Math.max(dp[i + 1][j][1], dp[i][j][l] + item[i + 1][j]);\n dp[i + 1][j][0] = Math.max(dp[i + 1][j][0], dp[i][j][l]);\n }\n // 右方向への移動\n if (j + 1 < c) {\n if (l < rmax) {\n dp[i][j + 1][l + 1] = Math.max(dp[i][j + 1][l + 1], dp[i][j][l] + item[i][j + 1]);\n }\n dp[i][j + 1][l] = Math.max(dp[i][j + 1][l], dp[i][j][l]);\n }\n }\n }\n }\n\n long ans = 0;\n for (int l = 0; l <= rmax; l++) {\n ans = Math.max(ans, dp[r - 1][c - 1][l]);\n }\n System.out.println(ans);\n }\n}\n", "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n R, C, K, *RCV = map(int, read().split())\n\n item = dict()\n for r, c, v in zip(*[iter(RCV)] * 3):\n item[(r - 1, c - 1)] = v\n\n dp = [[0] * (C + 1) for _ in range(R + 1)]\n for i in range(R):\n v = [0] * 4\n for j in range(C):\n for k in range(4):\n if v[k] < dp[i][j + 1]:\n v[k] = dp[i][j + 1]\n if (i, j) in item:\n for k in range(2, -1, -1):\n if v[k + 1] < v[k] + item[(i, j)]:\n v[k + 1] = v[k] + item[(i, j)]\n dp[i + 1][j + 1] = v[3]\n\n print(dp[R][C])\n\n return\n\n\nif __name__ == '__main__':\n main()\n", "import java.util.*;\nimport java.io.*;\n \npublic class Main {\n public static void main(String[] args) throws Exception {\n FastScanner sc = new FastScanner(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n int r = sc.nextInt();\n int c = sc.nextInt();\n int K = sc.nextInt();\n long[][] map = new long[r][c];\n long[][][] dp = new long[r+1][c+1][4];\n for(int i = 0; i < r; i++){\n for(int j = 0; j < c; j++){\n Arrays.fill(dp[i][j],-Long.MAX_VALUE);\n }\n }\n dp[0][0][0] = 0;\n for(int i = 0; i < K; i++){\n map[sc.nextInt()-1][sc.nextInt()-1] = sc.nextLong();\n }\n for(int i = 0; i < r; i++){\n for(int j = 0; j < c; j++){\n if(i != 0){\n for(int k = 0; k < 4; k++){\n dp[i][j][0] = Math.max(dp[i][j][0],dp[i-1][j][k]);\n }\n }\n if(j != 0){\n for(int k = 0; k < 4; k++){\n dp[i][j][k] = Math.max(dp[i][j][k],dp[i][j-1][k]);\n }\n }\n for(int k = 3; k >= 0; k--){\n if(map[i][j] == 0 || k == 3){\n continue;\n }else{\n dp[i][j][k+1] = Math.max(dp[i][j][k+1],dp[i][j][k] + map[i][j]);\n }\n }\n }\n }\n /*\n for(int k = 0; k < 4; k++){\n for(int i = 0; i < r; i++){\n for(int j = 0; j < c; j++){\n pw.print(dp[i][j][k] + \" \");\n }\n pw.println();\n }\n pw.println();\n }\n */\n long ans = 0;\n for(int i = 0; i < 4; i++){\n ans = Math.max(ans,dp[r-1][c-1][i]);\n }\n pw.println(ans);\n pw.flush();\n }\n\n static class GeekInteger {\n public static void save_sort(int[] array) {\n shuffle(array);\n Arrays.sort(array);\n }\n \n public static int[] shuffle(int[] array) {\n int n = array.length;\n Random random = new Random();\n for (int i = 0, j; i < n; i++) {\n j = i + random.nextInt(n - i);\n int randomElement = array[j];\n array[j] = array[i];\n array[i] = randomElement;\n }\n return array;\n }\n \n }\n}\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public String[] nextArray(int n) {\n String[] a = new String[n];\n for (int i = 0; i < n; i++)\n a[i] = next();\n return a;\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n } \n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nll dp[3100][3100][5];\nll value[3100][3100];\n\nint main(){\n int r,c,k;\n cin >> r >> c >> k;\n memset(value,0,sizeof(value));\n for(int i=0;i<k;++i){\n ll R,C,V;\n cin >> R >> C >> V;\n value[R][C]=V;\n }\n\n for(int i=0;i<=r;++i){\n for(int j=0;j<=c;++j){\n for(int k=0;k<=3;++k){\n if(i-1>=0){\n dp[i][j][0]=max(dp[i][j][0],dp[i-1][j][k]);\n dp[i][j][1]=max(dp[i][j][1],dp[i-1][j][k]+value[i][j]);\n }\n\n if(j-1>=0){\n dp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k]);\n if(k-1>=0){\n dp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k-1]+value[i][j]);\n }\n }\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<=3;++i)ans=max(ans,dp[r][c][i]);\n\n\n cout << ans << endl;\n return 0;\n\n}\n", "\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\n\nimport java.util.*;\n\npublic class Main {\n long MOD = (long) 1e9 + 7;\n\n InputStream in;\n OutputStream out;\n\n public Main() {\n this(System.in, System.out);\n }\n\n public Main(InputStream in, OutputStream out) {\n this.in = in;\n this.out = out;\n }\n\n void run() {\n Scanner sc = new Scanner(this.in);\n PrintWriter out = new PrintWriter(this.out);\n\n // write your code\n int R = sc.nextInt(), C = sc.nextInt(), K = sc.nextInt();\n int[][] board = new int[R + 1][C + 1];\n for (int i = 0; i < K; i++) {\n board[sc.nextInt()][sc.nextInt()] = sc.nextInt();\n }\n\n long[][][] dp = new long[R + 1][C + 1][4];\n\n for (int r = 1; r <= R; r++) {\n for (int c = 1; c <= C; c++) {\n dp[r][c][0] = max(dp[r - 1][c]);\n dp[r][c][0] = max(dp[r][c][0], dp[r][c - 1][0]);\n dp[r][c][1] = max(dp[r - 1][c]) + board[r][c];\n dp[r][c][1] = max(dp[r][c][1], dp[r][c - 1][1], dp[r][c - 1][0] + board[r][c]);\n dp[r][c][2] = max(dp[r][c - 1][2], dp[r][c - 1][1] + board[r][c]);\n dp[r][c][3] = max(dp[r][c - 1][3], dp[r][c - 1][2] + board[r][c]);\n }\n }\n\n out.println(max(dp[R][C]));\n\n out.flush();\n }\n\n long max(long...vals) {\n long max = 0;\n for (long v : vals) {\n max = Math.max(max, v);\n }\n return max;\n }\n\n void debug(Object... os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}", "import sys\ninput=sys.stdin.readline\nH,W,K=map(int,input().split())\nG=[[0]*W for i in range(H)]\n\nfor i in range(K):\n r,c,v=map(int,input().split())\n r,c=r-1,c-1\n G[r][c]=v\n\ndp=[[[-1]*W for i in range(H)] for i in range(4)]\n\ndp[0][0][0]=0\nif G[0][0]!=0:\n dp[1][0][0]=G[0][0]\n\nfor i in range(H):\n for j in range(W):\n m=max(dp[k][i][j] for k in range(4))\n if i+1<H:\n dp[1][i+1][j]=max(dp[1][i+1][j],m+G[i+1][j])\n dp[0][i+1][j]=max(dp[0][i+1][j],m)\n if j+1<W:\n dp[0][i][j+1]=0\n dp[1][i][j+1]=max(dp[1][i][j+1],dp[1][i][j],dp[0][i][j]+G[i][j+1])\n dp[2][i][j+1]=max(dp[2][i][j+1],dp[2][i][j],dp[1][i][j]+G[i][j+1])\n dp[3][i][j+1]=max(dp[3][i][j+1],dp[3][i][j],dp[2][i][j]+G[i][j+1])\nans=max(dp[i][H-1][W-1] for i in range(4))\nprint(ans)", "import java.io.*;\nimport java.util.StringTokenizer;\n\npublic class Main {\n static FastIO io = new FastIO(\"in.txt\");\n static int R, C, K;\n static long[][] g;\n static long[][][] dp;\n\n static long dfs(int r, int c, int k){\n if(dp[r][c][k] >= 0) return dp[r][c][k];\n if(r == R-1 && c == C-1){\n if(k < 3){\n return g[r][c];\n }else{\n return 0;\n }\n }\n\n long ans = 0;\n if(r + 1 < R){\n if(k < 3){\n ans = Math.max(ans, g[r][c] + dfs(r+1, c, 0));\n }\n ans = Math.max(ans, dfs(r+1, c, 0));\n\n }\n if(c + 1 < C){\n if(k < 3){\n ans = Math.max(ans, g[r][c] + dfs(r, c+1, k+1));\n }\n\n ans = Math.max(ans, dfs(r, c+1, k));\n }\n dp[r][c][k] = ans;\n return ans;\n }\n\n public static void main(String[] args) throws Exception {\n R = io.nextInt(); C = io.nextInt(); K = io.nextInt();\n g = new long[R][C];\n for(int i=0; i<K; i++){\n int r = io.nextInt()-1, c = io.nextInt() - 1, v = io.nextInt();\n g[r][c] = v;\n }\n\n dp = new long[R][C][4];\n for(int i=0; i<R; i++){\n for(int j=0; j<C; j++){\n for(int k=0; k<4; k++){\n dp[i][j][k] = -1;\n }\n }\n }\n\n long ans = dfs(0, 0, 0);\n io.println(ans);\n\n\n io.flush();\n }\n\n static class FastIO {\n static StringBuilder sb = new StringBuilder();\n static BufferedReader br;\n static StringTokenizer st;\n static PrintStream ps = new PrintStream(System.out);\n\n public FastIO(String fname) {\n try {\n File input = new File(fname);\n if (input.exists()) {\n System.setIn(new FileInputStream(fname));\n }\n }catch (Exception e){\n e.printStackTrace();\n }\n\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n void flush(){\n System.out.print(sb.toString());\n sb.setLength(0);\n }\n\n void print(Object o){\n sb.append(o);\n }\n\n void println(Object o){\n sb.append(o);\n sb.append('\\n');\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n }\n}\n", "R,C,K = map(int, input().split())\n\nmaze = [[0 for _ in range(C)] for _ in range(R)]\ndp = [[[0 for _ in range(C+1)] for _ in range(R+1)] for _ in range(4)]\nfor i in range(K):\n r,c,v = map(int, input().split())\n r -=1\n c -= 1\n maze[r][c] = v\n\nfor i in range(R):\n for j in range(C):\n \n for k in range(2, -1, -1):\n dp[k+1][i][j] = max(dp[k+1][i][j], dp[k][i][j] + maze[i][j])\n\n for k in range(4):\n dp[0][i+1][j] = max(dp[0][i+1][j], dp[k][i][j])\n dp[k][i][j+1] = max(dp[k][i][j+1], dp[k][i][j]) \n\nans = 0\n\nfor k in range(4):\n ans = max(ans, dp[k][R-1][C-1]) \n\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef int64_t ll;\n#define rep(i,n) for(int i=1;i<=(int)(n);i++)\nll R,C,K,r,c,v,g[3001][3001],a[3001][3001][4];\n\nint main(){\n\tcin>>R>>C>>K;\n\trep(i,K){cin>>r>>c>>v;g[r][c]=v;}\n\trep(i,R)rep(j,C)rep(k,3)a[i][j][k]=max(a[i-1][j][3]+g[i][j],max(a[i][j-1][k-1]+g[i][j],a[i][j-1][k]));\n\tcout<<a[R][C][3]<<endl;\n}\n", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n\n int[][] field = new int[R + 1][C + 1];\n for(int i = 0; i < K; i++){\n field[sc.nextInt()][sc.nextInt()] = sc.nextInt();\n }\n\n long[][][] dp = new long[R + 1][C + 1][4];\n for(int i = 1; i < R; i++){\n for(int j = 1; j < C; j++){\n Arrays.fill(dp[i][j], Long.MIN_VALUE);\n }\n }\n dp[1][1][0] = 0;\n\n for(int i = 1; i <= R; i++){\n for(int j = 1; j <= C; j++){\n if(field[i][j] > 0){\n dp[i][j][0] = Math.max(dp[i - 1][j][3], dp[i][j - 1][0]);\n dp[i][j][1] = Math.max(dp[i][j - 1][1],\n Math.max(dp[i - 1][j][3], dp[i][j - 1][0]) + field[i][j]);\n dp[i][j][2] = Math.max(dp[i][j - 1][2],\n Math.max(dp[i - 1][j][3], dp[i][j - 1][1]) + field[i][j]);\n dp[i][j][3] = Math.max(dp[i][j - 1][3],\n Math.max(dp[i - 1][j][3], dp[i][j - 1][2]) + field[i][j]);\n }else{\n dp[i][j][0] = Math.max(dp[i - 1][j][3], dp[i][j - 1][0]);\n dp[i][j][1] = Math.max(dp[i - 1][j][3], dp[i][j - 1][1]);\n dp[i][j][2] = Math.max(dp[i - 1][j][3], dp[i][j - 1][2]);\n dp[i][j][3] = Math.max(dp[i - 1][j][3], dp[i][j - 1][3]);\n }\n }\n }\n\n\n System.out.println(dp[R][C][3]);\n\n /*\n for(int i = 0; i < R + 1; i++){\n for(int j = 0; j < C + 1; j++){\n System.out.print(field[i][j] + \" \");\n }\n System.out.println();\n }\n System.out.println();\n\n for(int k = 0; k < 4; k++){\n for(int i = 0; i < R + 1; i++){\n for(int j = 0; j < C + 1; j++){\n System.out.print(dp[i][j][k] + \" \");\n }\n System.out.println();\n }\n System.out.println();\n }\n\n */\n\n }\n\n\n}\n", "R, C, K = map(int, input().split())\nV = [[0]*C for _ in range(R)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[r-1][c-1] = v\ndp = [[0]*4 for _ in range(C+1)]\nfor j in range(C):\n for k in range(1, 4):\n dp[j+1][k] = max(dp[j][k-1]+V[0][j], dp[j][k])\nfor i in range(1, R):\n newdp = [[0]*4 for _ in range(C+1)]\n for j in range(C):\n newdp[j+1][0] = max(max(dp[j+1]), newdp[j][0])\n newdp[j+1][1] = max(max(max(dp[j+1]), newdp[j][0])+V[i][j], newdp[j][1])\n for k in range(2, 4):\n newdp[j+1][k] = max(newdp[j][k-1]+V[i][j], newdp[j][k])\n dp = newdp\nprint(max(dp[-1]))", "R,C,K=map(int,input().split())\nvalue=[[0]*(C+1) for i in range(R+1)]\nfor i in range(K):\n r,c,v=map(int,input().split())\n value[r][c]=v\nDP0=[[0]*(C+1) for i in range(R+1)]\nDP1=[[0]*(C+1) for i in range(R+1)]\nDP2=[[0]*(C+1) for i in range(R+1)]\nDP3=[[0]*(C+1) for i in range(R+1)]\nfor i in range(1,R+1):\n for j in range(1,C+1):\n v=value[i][j]\n a=DP0[i][j-1]\n b=DP1[i][j-1]\n c=DP1[i-1][j]\n d=DP2[i-1][j]\n e=DP3[i-1][j]\n f=DP2[i][j-1]\n DP0[i][j]=max(a,c,d,e)\n DP1[i][j]=max(DP0[i-1][j]+v,c+v,d+v,e+v,b,a+v)\n DP2[i][j]=max(b+v,f)\n DP3[i][j]=max(f+v,DP3[i][j-1])\n\nprint(max(DP0[R][C],DP1[R][C],DP2[R][C],DP3[R][C]))", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n public static void main(String[] args) {\n MyScanner sc = new MyScanner();\n PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));\n int r = sc.nextInt(); int c = sc.nextInt(); int k = sc.nextInt();\n long [][] item = new long[r][c];\n for (int i = 0; i < k; i++) {\n int row = sc.nextInt() - 1; int col = sc.nextInt() - 1;\n long val = sc.nextLong();\n item[row][col] = val;\n }\n long [][][] dp = new long[r][c][4];\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n for (int x = 0; x <= 3; x++) {\n if (item[i][j] > 0) {\n if (x > 0)\n dp[i][j][x] = Math.max(dp[i][j][x], (j == 0 ? 0 : dp[i][j - 1][x - 1]) + item[i][j]);\n for (int y = 0; y <= 3; y++) {\n dp[i][j][1] = Math.max(dp[i][j][1], (i == 0 ? 0 : dp[i - 1][j][y]) + item[i][j]);\n }\n }\n dp[i][j][x] = Math.max(dp[i][j][x], (j == 0 ? 0 : dp[i][j - 1][x]));\n for (int y = 0; y <= 3; y++) {\n dp[i][j][0] = Math.max(dp[i][j][0], (i == 0 ? 0 : dp[i - 1][j][y]));\n }\n }\n }\n }\n long ans = 0;\n for (int x = 0; x <= 3; x++) ans = Math.max(ans, dp[r - 1][c - 1][x]);\n out.println(ans);\n out.close();\n }\n\n\n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n\n }\n\n}", "import java.io.BufferedReader;\nimport java.io.EOFException;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.UncheckedIOException;\nimport java.lang.reflect.Array;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.Deque;\nimport java.util.Objects;\nimport java.util.regex.Pattern;\nimport java.util.stream.Collectors;\n\npublic class Main {\n public void exec() {\n int R = stdin.nextInt();\n int C = stdin.nextInt();\n int K = stdin.nextInt();\n long[][] V = new long[R][C];\n for (int x = 0; x < K; x++) {\n int r = stdin.nextInt()-1;\n int c = stdin.nextInt()-1;\n long v = stdin.nextLong();\n V[r][c] = v;\n }\n\n long[][][] dp = new long[R][C][4];\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n dp[i][j][1] = Math.max(dp[i][j][1], V[i][j]);\n\n for (int k = 0; k < 4; k++) {\n if (i+1 < R) {\n dp[i+1][j][0] = Math.max(dp[i+1][j][0], dp[i][j][k]);\n if(V[i+1][j] > 0) dp[i+1][j][1] = Math.max(dp[i+1][j][1], dp[i][j][k]+V[i+1][j]);\n }\n\n if (j+1 < C) {\n dp[i][j+1][k] = Math.max(dp[i][j+1][k], dp[i][j][k]);\n if (V[i][j+1] > 0 && k < 3) dp[i][j+1][k+1] = Math.max(dp[i][j+1][k+1], dp[i][j][k]+V[i][j+1]);\n }\n }\n }\n }\n stdout.println(Arrays.stream(dp[R-1][C-1]).max().getAsLong());\n }\n\n private static final Stdin stdin = new Stdin();\n private static final Stdout stdout = new Stdout();\n\n public static void main(String[] args) {\n try {\n new Main().exec();\n } finally {\n stdout.flush();\n }\n }\n\n public static class Stdin {\n private BufferedReader stdin;\n private Deque<String> tokens;\n private Pattern delim;\n\n public Stdin() {\n stdin = new BufferedReader(new InputStreamReader(System.in));\n tokens = new ArrayDeque<>();\n delim = Pattern.compile(\" \");\n }\n\n public String nextString() {\n try {\n if (tokens.isEmpty()) {\n String line = stdin.readLine();\n if (line == null) {\n throw new UncheckedIOException(new EOFException());\n }\n delim.splitAsStream(line).forEach(tokens::addLast);\n }\n return tokens.pollFirst();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n public double nextDouble() {\n return Double.parseDouble(nextString());\n }\n\n public long nextLong() {\n return Long.parseLong(nextString());\n }\n\n public String[] nextStringArray(int n) {\n String[] a = new String[n];\n for (int i = 0; i < n; i++) a[i] = nextString();\n return a;\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = nextInt();\n return a;\n }\n\n public double[] nextDoubleArray(int n) {\n double[] a = new double[n];\n for (int i = 0; i < n; i++) a[i] = nextDouble();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) a[i] = nextLong();\n return a;\n }\n }\n\n public static class Stdout {\n private PrintWriter stdout;\n\n public Stdout() {\n stdout = new PrintWriter(System.out, false);\n }\n\n public void printf(String format, Object ... args) {\n String line = String.format(format, args);\n if (line.endsWith(System.lineSeparator())) {\n stdout.print(line);\n } else {\n stdout.println(line);\n }\n }\n\n public void println(Object ... o) {\n String line = Arrays.stream(o).map(Objects::toString).collect(Collectors.joining(\" \"));\n stdout.println(line);\n }\n\n public void debug(Object ... objs) {\n String line = Arrays.stream(objs).map(this::deepToString).collect(Collectors.joining(\" \"));\n stdout.printf(\"DEBUG: %s%n\", line);\n }\n\n private String deepToString(Object o) {\n if (o == null) {\n return \"null\";\n }\n\n // 配列の場合\n if (o.getClass().isArray()) {\n int len = Array.getLength(o);\n String[] tokens = new String[len];\n for (int i = 0; i < len; i++) {\n tokens[i] = deepToString(Array.get(o, i));\n }\n return \"{\" + String.join(\",\", tokens) + \"}\";\n }\n\n return Objects.toString(o);\n }\n\n public void flush() {\n stdout.flush();\n }\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn=3003;\n\nll dp[maxn][maxn][4];\nll val[maxn][maxn];\nint main()\n{\n\tint n,m,k,x,y;\n\tll v;\n\tscanf(\"%d%d%d\",&n,&m,&k);\n\tfor(int i=1;i<=k;i++)\n\t{\n\t\tscanf(\"%d%d%lld\",&x,&y,&v);\n\t\tval[x][y]=v;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=1;j<=m;j++)\n\t\t{\n\t\t\tfor(int k=0;k<=3;k++)\n\t\t\t{\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i-1][j][0]);\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i-1][j][1]);\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i-1][j][2]);\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i-1][j][3]);\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k]);\n\t\t\t}\n\t\t\tif(val[i][j]) for(int k=3;k;k--) dp[i][j][k]=max(dp[i][j][k],dp[i][j][k-1]+val[i][j]); \n\t\t}\n\t}\n\tll ans=0;\n\tfor(int i=0;i<=3;i++)\n\t{\n\t\tans=max(ans,dp[n][m][i]);\n\t}\n\tprintf(\"%lld\",ans);\n } ", "ma = lambda :map(int,input().split())\nlma = lambda :list(map(int,input().split()))\ntma = lambda :tuple(map(int,input().split()))\nni = lambda:int(input())\nyn = lambda fl:print(\"Yes\") if fl else print(\"No\")\nimport collections\nimport math\nimport itertools\nimport heapq as hq\nR,C,K = ma()\nV = [[0 for i in range(R+1)] for j in range(C+1)]\nfor i in range(K):\n r,c,v = ma()\n V[c][r] = v\ndp_prev = [[0]*4 for i in range(C+1)]\ndp_nex = [[0]*4 for i in range(C+1)] #dp[h][k] h列目でmax kこまで選んだ時の最大値\nfor r in range(1,R+1):\n for c in range(1,C+1):\n v = V[c][r]\n for k in range(4):\n if k==0:\n dp_nex[c][0] = max(dp_prev[c][3],dp_nex[c-1][0])\n elif k >0:\n dp_nex[c][k] = max(dp_nex[c-1][k],dp_nex[c-1][k-1]+v,dp_prev[c][3]+v)\n dp_prev,dp_nex = dp_nex,dp_prev\n #print(dp_prev)\n\n\nprint(dp_prev[C][3])\n", "import java.util.*;\n\npublic class Main {\n\n\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int r = sc.nextInt();\n int c = sc.nextInt();\n int k = sc.nextInt();\n int[][] g = new int[r][c];\n for(int i=0; i<k ;i++) {\n int x = sc.nextInt() -1;\n int y = sc.nextInt() -1;\n int v = sc.nextInt();\n g[x][y] = v;\n }\n long[][][] dp = new long[r][c][4];\n if(g[0][0]>0) {\n dp[0][0][1] = g[0][0];\n }\n for(int i=0; i<r; i++) {\n for(int j=0; j<c; j++) {\n for(int q=0; q<=3; q++) {\n if(j+1<c) {\n dp[i][j+1][q] = Math.max(dp[i][j+1][q],dp[i][j][q]);\n if(g[i][j+1]>0 && q<3) {\n dp[i][j+1][q+1] = Math.max(dp[i][j+1][q+1], dp[i][j][q]+g[i][j+1]);\n }\n }\n if(i+1<r) {\n dp[i+1][j][0] = Math.max(dp[i+1][j][0],dp[i][j][q]);\n if(g[i+1][j]>0) {\n dp[i+1][j][1] = Math.max(dp[i+1][j][1], dp[i][j][q]+g[i+1][j]);\n }\n }\n }\n }\n }\n long res = 0;\n for(int i=0; i<4; i++) {\n res = Math.max(res, dp[r-1][c-1][i]);\n }\n System.out.println(res);\n\n\n }\n}", "f=lambda:map(int,input().split())\nR,C,K=f()\ng=[[0]*(R+1) for _ in range(C+1)]\nfor _ in range(K):\n r,c,v=f()\n g[c][r]=v\ndp=[[0]*4 for _ in range(R+1)]\nfor i in range(1,C+1):\n for j in range(1,R+1):\n t=g[i][j]\n if t:\n for k in range(3,0,-1):\n dp[j][k]=max(dp[j][k],dp[j][k-1]+t)\n dp[j][1]=max(dp[j][k],max(dp[j-1])+t)\n dp[j][0]=max(dp[j][0],max(dp[j-1]))\nprint(max(dp[R]))", "R, C, K = map(int,input().split())\nMAP = [[0 for i in range(C)] for j in range(R)]\nDP = [[[0 for i in range(C+1)] for j in range(4)] for k in range(R+1)]\n \nfor _ in range(K):\n r, c, v = map(int,input().split())\n MAP[r-1][c-1] = v\n \nfor i in range(R):\n for j in range(4):\n for k in range(C):\n DP[i+1][j][k+1] = max(DP[i][3][k+1], DP[i+1][j][k])\n if j == 0:\n continue\n v = MAP[i][k]\n if v == 0:\n continue\n DP[i+1][j][k+1] = max(DP[i+1][j][k+1], max(DP[i][3][k+1], DP[i+1][j-1][k]) + v)\n\nprint(DP[R][3][C])\n", "#include <bits/stdc++.h>\nusing namespace std; \nlong long n,m,k;\nlong long dp[3010][3010][4];\nlong long a[3010][3010];\nint main(){\n\tcin>>n>>m>>k;\n\twhile(k--){\n\t\tlong long u,v,w;\n\t\tcin>>u>>v>>w;\n\t\ta[u][v]=w;\n\t}\n\tdp[1][1][1]=a[1][1];\n\tfor(long long i=1;i<=n;i++){\n\t\tfor(long long j=1;j<=m;j++){\n\t\t\tfor(long long k=0;k<=2;k++){\n\t\t\t\tdp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n\t\t\t\tdp[i+1][j][1]=max(dp[i+1][j][1],dp[i][j][k]+a[i+1][j]);\n\t\t\t\tdp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n\t\t\t\tdp[i][j+1][k+1]=max(dp[i][j+1][k+1],dp[i][j][k]+a[i][j+1]);\n\t\t\t}\n\t\t\tdp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][3]);\n\t\t\tdp[i+1][j][1]=max(dp[i+1][j][1],dp[i][j][3]+a[i+1][j]);\n\t\t\tdp[i][j+1][3]=max(dp[i][j+1][3],dp[i][j][3]);\n\t\t}\n\t}\n\tcout<<max(dp[n][m][0],max(dp[n][m][1],max(dp[n][m][2],dp[n][m][3])));\n\treturn 0;\n}", "import sys\nfrom pprint import pprint\n\nR,C,K=map(int,input().split())\n\ngrid=[[0]*C for _ in range(R+1)]\nfor _ in range(K):\n r,c,v=map(int,input().split())\n grid[r][c-1]=v\n\nfor i in range(1,R+1):\n cell=[0]*4\n for j in range(C):\n cell[0]=max(cell[0],grid[i-1][j])\n for k in range(2,-1,-1):\n cell[k+1]=max(cell[k+1],cell[k]+grid[i][j])\n grid[i][j]=max(cell)\n\nprint(grid[-1][-1])\n", "#include <bits/stdc++.h>\nusing namespace std;\nlong long int dp[3001][3001][4];\nlong long int sc[3001][3001];\nint main(){\n int R,C,k;\n cin >> R >> C >> k;\n int r,c;\n long long int v;\n for(int i=0;i<k;i++){\n cin >> r >> c >> v;\n r --; c--;\n sc[r][c]=v;\n }\n for(int i=0;i<R;i++){\n for(int j=0;j<C;j++){\n for(int m=0;m<4;m++){\n if(sc[i][j]>0 && m<3){\n dp[i][j+1][m+1]=max(dp[i][j][m]+sc[i][j],dp[i][j+1][m+1]);\n dp[i+1][j][0]=max(dp[i][j][m]+sc[i][j],dp[i+1][j][0]);\n }\n dp[i][j+1][m]=max(dp[i][j][m],dp[i][j+1][m]);\n dp[i+1][j][0]=max(dp[i][j][m],dp[i+1][j][0]); \n }\n }\n }\n cout << dp[R][C-1][0];\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int N = 3001;\nint g[N][N];\nint64_t dp[N][N][4];\nint R, C, K;\n\nint64_t go(int x, int y, int cnt) {\n if (x == R || y == C) return 0;\n if (dp[x][y][cnt] != -1) return dp[x][y][cnt];\n if (cnt < 3) {\n return dp[x][y][cnt] = max({go(x, y + 1, cnt + 1) + g[x][y], go(x + 1, y, 0) + g[x][y], go(x, y + 1, cnt), go(x + 1, y, 0)});\n } else {\n return dp[x][y][cnt] = max(go(x, y + 1, cnt), go(x + 1, y, 0));\n }\n}\n\nint32_t main()\n{\n ios::sync_with_stdio(false), cin.tie(nullptr);\n cin >> R >> C >> K;\n for (int i = 0; i < K; i++) {\n int x, y, v; cin >> x >> y >> v;\n x--, y--;\n g[x][y] = v;\n }\n memset(dp, -1, sizeof dp);\n cout << go(0, 0, 0);\n\n return 0;\n}", "r, c, k = map(int, input().split())\nv = [map(int, input().split()) for _ in range(k)]\n\nsq = [[0 for _ in range(c)] for _ in range(r)]\nfor ri, ci, vi in v:\n sq[ri - 1][ci - 1] = vi\n\ndp = [[[0 for _ in range(c)] for _ in range(4)] for _ in range(2)]\nfor ri in range(r):\n if 0 < ri:\n for ci in range(c):\n dp[ri % 2][0][ci] = max([dp[1 - ri % 2][i][ci] for i in range(4)])\n for i in range(1, 4):\n dp[ri % 2][i][ci] = 0\n for ci in range(c):\n if 0 < ci:\n for i in range(4):\n dp[ri % 2][i][ci] = max(dp[ri % 2][i][ci], dp[ri % 2][i][ci - 1])\n if 0 < sq[ri][ci]:\n for i in range(2, -1, -1):\n dp[ri % 2][i + 1][ci] = max(dp[ri % 2][i + 1][ci], dp[ri % 2][i][ci] + sq[ri][ci])\n\nans = max([dp[ri % 2][i][-1] for i in range(4)])\nprint(ans)", "# -*- coding: utf-8 -*-\nimport sys \nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nR, C, K = map(int, readline().split())\n\nV = [[0]*(C+1) for _ in range(R+1)]\nfor i in range(K):\n r,c,v = map(int,readline().split())\n V[r][c] = v\n\ndp = [0] * (C+1)\ndp[0] = 0\n\nfor i in range(1,R+1):\n ndp = [0] * (C+1)\n row = V[i]\n ldp = [0] * 4\n for j in range(1,C+1):\n # ldp[0] = max(ldp[0], dp[j])\n ldp[0] = dp[j]\n for k in range(2,-1,-1):\n ldp[k+1] = max(ldp[k+1], ldp[k] + row[j]) # 取る場合と取らない場合\n ndp[j] = max(ldp)\n dp = ndp\nprint(dp[C])", "import java.io.*;\nimport java.util.*;\nimport java.math.BigDecimal;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n FastScanner in;\n PrintWriter out;\n final static int MOD = (int)1e9+7;\n \n void solve(){\n int H = in.nextInt(), W = in.nextInt(), K = in.nextInt();\n long[][] v = new long[H][W];\n for(int i = 0; i < K; i++){\n int y = in.nextInt()-1, x = in.nextInt()-1;\n v[y][x] = in.nextLong();\n }\n \n long[][][] dp = new long[4][H][W];\n dp[1][0][0] = v[0][0];\n for(int i = 0; i < H; i++){\n for(int j = 0; j < W; j++){\n for(int k = 0; k < 4; k++){\n if(i + 1 < H){\n dp[0][i+1][j] = Math.max(dp[0][i+1][j], dp[k][i][j]);\n dp[1][i+1][j] = Math.max(dp[1][i+1][j], dp[k][i][j] + v[i+1][j]);\n }\n if(j + 1 < W){\n dp[k][i][j+1] = Math.max(dp[k][i][j+1], dp[k][i][j]);\n if(k < 3) dp[k+1][i][j+1] = Math.max(dp[k+1][i][j+1], dp[k][i][j] + v[i][j+1]);\n }\n }\n }\n }\n long max = 0;\n for(int i = 0; i < 4; i++) max = Math.max(max, dp[i][H-1][W-1]);\n out.println(max);\n }\n \n public static void main(String[] args) {\n new Main().m();\n }\n \n private void m() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n /*\n try {\n String path = \"input.txt\";\n out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));\n }catch (IOException e){\n e.printStackTrace();\n }\n */\n solve();\n out.flush();\n in.close();\n out.close();\n }\n \n static class FastScanner {\n private Reader input;\n \n public FastScanner() {this(System.in);}\n public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n public void close() {\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n \n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n \n public long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n \n public double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n \n public char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n \n public String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public String nextLine() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n \n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n \n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n \n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n \n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n \n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n \n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n \n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\nlong long A[3010][3010]; \nlong long dp[3010][3010][4]; \nint main(){\n\tios::sync_with_stdio(0);\n\tcin.tie(0); cout.tie(0);\n\tint R, C, K; cin >> R >> C >> K; \n\tfor(int i = 0; i < K; i++){\n\t\tint r, c; long long v; cin >> r >> c >> v; \n\t\tr--; c--; A[r][c] = v; \n\t}\n\tif(A[0][0]) dp[0][0][1] = A[0][0]; \n\tfor(int i = 0; i < R; i++){\n\t\tfor(int j = 0; j < C; j++){\n\t\t\tfor(int k = 0; k <= 3; k++){\n\t\t\t\tdp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k]);\n\t\t\t\tif(A[i][j+1] && (k < 3)) dp[i][j+1][k+1] = max(dp[i][j+1][k+1], dp[i][j][k] + A[i][j+1]); \n\t\t\t\tdp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][k]); \n\t\t\t\tif(A[i+1][j]) dp[i+1][j][1] = max(dp[i+1][j][1], dp[i][j][k] + A[i+1][j]); \t\t \n\t\t\t}\n\t\t}\n\t}\n\tlong long ans = 0; \n\tfor(int i = 0; i <= 3; i++) ans = max(ans, dp[R-1][C-1][i]); \n\tcout << ans << \"\\n\"; \n}", "import sys\nfrom collections import defaultdict\nrange = xrange\ninput = raw_input\n\ninp = [int(x) for x in sys.stdin.read().split()]; ii = 0\n\nn = inp[ii]; ii += 1\nm = inp[ii]; ii += 1\nk = inp[ii]; ii += 1\n\nR = inp[ii + 0: ii + 3 * k: 3]\nC = inp[ii + 1: ii + 3 * k: 3]\nV = inp[ii + 2: ii + 3 * k: 3]\n\nitems = [defaultdict(list) for _ in range(n)]\nfor i in range(k):\n r = R[i] - 1\n c = C[i] - 1\n v = V[i]\n items[r][c].append(v)\n\nDP0 = [0] * m\nDP1 = [0] * m\nDP2 = [0] * m\nDP3 = [0] * m\n\nfor r in range(n):\n itemsr = items[r]\n for c in range(m):\n if c:\n DP0[c] = max(DP0[c], DP0[c - 1])\n DP1[c] = max(DP1[c], DP1[c - 1])\n DP2[c] = max(DP2[c], DP2[c - 1])\n DP3[c] = max(DP3[c], DP3[c - 1])\n if c in itemsr:\n for v in itemsr[c]:\n DP3[c] = max(DP3[c], DP2[c] + v)\n DP2[c] = max(DP2[c], DP1[c] + v)\n DP1[c] = max(DP1[c], DP0[c] + v)\n for c in range(m):\n DP0[c] = DP1[c] = DP2[c] = DP3[c]\nprint DP0[-1] \n", "r, c, k = map(int, input().split())\n\ndp = [[[0,0,0,0] for _j in range(c+1)] for _i in range(2)]\nbord = [[0]*(c+1) for _i in range(r)]\n\nfor _i in range(k):\n _r, _c, _v = map(int, input().split())\n bord[_r-1][_c-1] = _v\n \nfor i in range(r):\n for j in range(c):\n dp[1][j][0] = max(dp[0][j])\n dp[1][j][1] = dp[1][j][0] + bord[i][j]\n for x in range(1, 4):\n dp[1][j][x] = max(\n dp[1][j][x],\n dp[1][j-1][x],\n dp[1][j-1][x-1]+bord[i][j], \n )\n dp[0] = dp[1][::]\n\nprint(max(dp[1][c-1]))", "#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\nint n, m, k;\nconst int N = 3000;\nint cache[N][N][4];\nint a[N][N];\nint dp(int i, int j, int last)\n{\n if (i == n || j == m)\n return 0;\n int &ans = cache[i][j][last];\n if (ans != -1)\n return ans;\n if (last == 3)\n {\n ans = dp(i + 1, j, 0);\n }\n else\n ans = max({ans, a[i][j] + dp(i + 1, j, 0), dp(i, j + 1, last), a[i][j] + dp(i, j + 1, last + 1)});\n return ans;\n}\nint32_t main()\n{\n cin >> n >> m >> k;\n for (int i = 0; i < k; i++)\n {\n int x, y, c;\n cin >> x >> y >> c;\n x--;\n y--;\n a[x][y] = c;\n }\n memset(cache, -1, sizeof(cache));\n cout << dp(0, 0, 0);\n\n return 0;\n}", "# -*- coding: utf-8 -*-\nimport sys\nfrom collections import defaultdict\nR,C,K=map(int, sys.stdin.readline().split())\n\nvalue=defaultdict(lambda: 0)\nvalue=[ [0 for _ in range(C+1)] for __ in range(R+1) ]\nfor _ in range(K):\n r,c,v=map(int, sys.stdin.readline().split())\n value[r][c]=v\n\ndp0=[0]*(C+1)\ndp1=[0]*(C+1)\ndp2=[0]*(C+1)\ndp3=[0]*(C+1)\n\n#dp1[1]=value[1][1]\n\nfor r in range(1,R+1):\n for c in range(1,C+1):\n #今のマスにアイテムがある場合\n if 0<value[r][c]:\n dp3[c]=max( dp3[c-1], dp2[c-1]+value[r][c] )\n dp2[c]=max( dp2[c-1], dp1[c-1]+value[r][c] )\n dp1[c]=max( dp1[c-1], dp0[c-1]+value[r][c], dp0[c]+value[r][c] )\n dp0[c]=max( dp0[c-1], dp0[c] )\n #今のマスにアイテムがない場合\n else:\n dp0[c]=max( dp0[c-1], dp0[c] )\n dp1[c]=max( dp1[c-1], dp1[c] )\n dp2[c]=max( dp2[c-1], dp2[c] )\n dp3[c]=max( dp3[c-1], dp3[c] )\n\n #上の行にアイテムをコピー\n for c in range(1,C+1):\n dp0[c]=max( dp0[c], dp1[c], dp2[c], dp3[c] )\n dp1=[0]*(C+1)\n dp2=[0]*(C+1)\n dp3=[0]*(C+1)\n\nprint dp0[C]\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nll g[4001][4001];\nint r,c,k;\nll dp[4001][4001][4];\nll rec(ll i, ll j, ll taken)\n{\n\tif(i>=r)return 0;\n\tif(j>=c)return 0;\n\tif(dp[i][j][taken]!=-1)return dp[i][j][taken];\n\tll ans=0;\n\n\t\n\tans=rec(i+1,j,0);\n\tif(taken<3){\n\tans=max(ans,rec(i+1,j,0)+g[i][j]);\n\t}\n\tans=max(ans,rec(i,j+1,taken));\n\tif(taken<3){\n\tans=max(ans,rec(i,j+1,taken+1)+g[i][j]);\n\t}\n\n\treturn dp[i][j][taken]=ans;\n\n\n\n}\nint main()\n{\n\t cin>>r>>c>>k;\n\tfor(int i=0;i<r;i++)\n\t{\n\t\tfor(int j=0;j<c;j++)\n\t\t{\n\t\t\tg[i][j]=0;\n\t\t}\n\t}\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tint a,b,v; cin>>a>>b>>v;\n\t\ta--; b--;\n\t\tg[a][b]=v;\n\t}\n\tmemset(dp,-1,sizeof(dp));\n\tcout<<rec(0,0,0);\n\t\n\t\n}", "def solve():\n R, C, K = map(int, input().split())\n item = [[0]*C for _ in range(R)]\n for i in range(K):\n r,c,v = map(int, input().split())\n item[r-1][c-1] = v\n last_dp = [[0]*(C+1) for _ in range(5)]\n for i in range(1,R+1):\n dp = [[0]*(C+1) for _ in range(5)]\n for j in range(1,C+1):\n for k in range(4): #横から取らない\n dp[k][j] = dp[k][j-1]\n #上から取らない\n dp[0][j] = max(dp[0][j],last_dp[-1][j])\n if item[i-1][j-1]>0:\n #上からとる\n dp[1][j] = max(dp[1][j],last_dp[-1][j]+item[i-1][j-1])\n for k in range(1,4): #横から取る\n dp[k][j] = max(dp[k][j],dp[k-1][j-1]+item[i-1][j-1])\n for k in range(4):\n dp[-1][j] = max(dp[-1][j],dp[k][j])\n last_dp = dp\n ans = last_dp[-1][-1]\n return ans\nprint(solve())", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Main main = new Main();\n main.solve();\n }\n public void solve() {\n Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n int R = scan.nextInt();\n int C = scan.nextInt();\n int K = scan.nextInt();\n long[][][] dp = new long[R+1][C+1][4];\n boolean[][] map = new boolean[R][C];\n int[][] cost = new int[R][C];\n for (int i = 0; i < K; i++) {\n int r = scan.nextInt()-1;\n int c = scan.nextInt()-1;\n int v = scan.nextInt();\n map[r][c] = true;\n cost[r][c] = v;\n }\n for (int i = 1; i <= R; i++) {\n for (int j = 1; j <= C; j++) {\n long max = Math.max(dp[i-1][j][0], Math.max(dp[i-1][j][1], Math.max(dp[i-1][j][2], dp[i-1][j][3])));\n dp[i][j][0] = Math.max(dp[i][j-1][0],max);\n dp[i][j][1] = dp[i][j-1][1];\n dp[i][j][2] = dp[i][j-1][2];\n dp[i][j][3] = dp[i][j-1][3];\n if(map[i-1][j-1]) {\n dp[i][j][1] = Math.max(dp[i][j][1],Math.max(dp[i][j-1][0] + cost[i-1][j-1], max + cost[i-1][j-1]));\n dp[i][j][2] = Math.max(dp[i][j][2],dp[i][j-1][1] + cost[i-1][j-1]);\n dp[i][j][3] = Math.max(dp[i][j][3],dp[i][j-1][2] + cost[i-1][j-1]);\n }\n }\n }\n long ans = Math.max(dp[R][C][0], Math.max(dp[R][C][1], Math.max(dp[R][C][2], dp[R][C][3])));\n System.out.println(ans);\n }\n}\n", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i=0; i<(n); ++i)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nint a[3010][3010];\nll dp[3010][3010][4];\n\nint main(){\n int R,C,K;\n cin>>R>>C>>K;\n rep(i,K){\n int r,c,v; cin>>r>>c>>v;\n a[r-1][c-1]=v;\n }\n for(int i=0; i<R; ++i){\n for(int j=0; j<C; ++j){\n for(int k=2; k>=0; --k){\n chmax(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n }\n rep(k,4){\n chmax(dp[i+1][j][0],dp[i][j][k]);\n chmax(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n }\n ll ans=0;\n rep(i,4)chmax(ans,dp[R-1][C-1][i]);\n cout<<ans<<endl;\n}", "#include<bits/stdc++.h>\n#define PI 3.141592653589793238462\nusing namespace std;\ntypedef long long ll;\ntypedef long double db;\nll d[3005][3005][5],a[3005][3005];\nint main(){\n ll r,c,n;cin>>r>>c>>n;\n for(ll i=1;i<=n;i++){\n ll x,y,v;cin>>x>>y>>v;\n a[x][y]=v;\n }\n for(int i=1;i<=r;i++){\n for(int j=1;j<=c;j++){\n for(int k=0;k<=3;k++){\n d[i][j][k]=max(d[i][j][k],d[i][j-1][k]);\n d[i][j][0]=max(d[i][j][0],d[i-1][j][k]);\n if(a[i][j]>0){\n if(k>0) d[i][j][k]=max(d[i][j][k],d[i][j-1][k-1]+a[i][j]);\n d[i][j][1]=max(d[i][j][1],d[i-1][j][k]+a[i][j]);\n }\n }\n }\n }\n ll ans=0;\n for(int i=0;i<=3;i++){\n ans=max(ans,d[r][c][i]);\n }\n cout<<ans<<endl;\n}", "def pri(x):\n for item in x:\n print(item)\n\nr,c,k=map(int,input().split())\n\nfuck=[list(map(int,input().split())) for _ in range(k)]\n\nrck=[[0]*(c+1) for _ in range(r+1)]\n\nfor [rr,cc,kk] in fuck:\n rck[rr][cc]=kk\n#pri(rck)\n#dp[y][x][cnt]\n\ndp=[[0]*4 for _ in range(c+1)]\n#print(dp)\nfor y in range(1,r+1):\n for x in range(1,c+1):\n \n dp[x][0]=max(dp[x-1][0],dp[x][0],dp[x][1],dp[x][2],dp[x][3])\n dp[x][1]=max(dp[x][0]+rck[y][x],dp[x][1],dp[x-1][1])\n dp[x][2]=max(dp[x-1][1]+rck[y][x],dp[x][2],dp[x-1][2],dp[x][1])\n dp[x][3]=max(dp[x-1][2]+rck[y][x],dp[x][3],dp[x-1][3],dp[x][2])\n #print(y,x,dp)\n\nprint(max(dp[-1]))\n \n \n", "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n \npublic class Main {\n\tstatic final long MOD = 1000000007L;\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\t\n\t\tint N = sc.ni();\n\t\tint M = sc.ni();\n\t\tint K = sc.ni();\n\t\tint[][] grid = new int[N][M];\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint r = sc.ni()-1;\n\t\t\tint c = sc.ni()-1;\n\t\t\tint v = sc.ni();\n\t\t\tgrid[r][c] = v;\n\t\t}\n\t\tlong[][][] dp = new long[N][M][4];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < M; j++) {\n\t\t\t\tif (i==0&j==0) {\n\t\t\t\t\tdp[0][0][0] = 0;\n\t\t\t\t\tdp[0][0][1] = grid[0][0];\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int k = 1; k < 4; k++) {\n\t\t\t\t\tlong v = 0;\n\t\t\t\t\tlong w = 0;\n\t\t\t\t\tif (i>0) {\n\t\t\t\t\t\tv = dp[i-1][j][k];\n\t\t\t\t\t\tif (k==1) {\n\t\t\t\t\t\t\tfor (int m = 0; m <= 3; m++) {\n\t\t\t\t\t\t\t\tv = Math.max(v, dp[i-1][j][m]+grid[i][j]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (j > 0) {\n\t\t\t\t\t\tw = Math.max(dp[i][j-1][k], dp[i][j-1][k-1]+grid[i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tdp[i][j][k] = Math.max(v, w);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (int k = 1; k <= 3; k++)\n\t\t\tans = Math.max(dp[N-1][M-1][k],ans);\n\t\tpw.println(ans);\n\t\tpw.close();\n\t}\n\t\n static class FastScanner { \n BufferedReader br; \n StringTokenizer st; \n \n public FastScanner() { \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next() { \n while (st == null || !st.hasMoreElements()) { \n try { \n st = new StringTokenizer(br.readLine());\n } catch (IOException e) { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n }\n \n int ni() { \n return Integer.parseInt(next()); \n }\n \n long nl() { \n return Long.parseLong(next()); \n } \n \n double nd() { \n return Double.parseDouble(next()); \n } \n \n String nextLine() {\n String str = \"\"; \n try { \n str = br.readLine(); \n } catch (IOException e) {\n e.printStackTrace(); \n } \n return str;\n }\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nlong long int L[3003][3003][4];\n\nint G[3003][3003];\nint H,W,K;\n\nsigned main(){\n\tcin>>H>>W>>K;\n\tint h,w,v;\n\tfor(int i=1;i<=K;i++){\n\t\tcin>>h>>w>>v;\n\t\tG[h][w]=v;\n\t}\n\tfor(int h=1;h<H+1;h++){\n\t\tfor(int w=1;w<W+1;w++){\n\t\t\tlong long int X=0;\n\t\t\tfor(int k=0;k<4;k++){\n\t\t\t\tX=max(X,L[h-1][w][k]);\n\t\t\t}\n\t\t\tfor(int k=1;k<4;k++){\n\t\t\t\tL[h][w][k]=max(max(L[h][w-1][k],L[h][w-1][k-1]+G[h][w]),X+G[h][w]);\t\n\t\t\t}\n\t\t}\n\t}\n\t\n\tlong long int ans=0;\n\tfor(int i=0;i<=3;i++){\n\t\tans=max(ans,L[H][W][i]);\n\t} \n\tcout<<ans<<endl;\n\treturn 0;\n}\n", "R,C,K=map(int,input().split())\nl=[[0] * C for i in range(R)]\nfor i in range(K):\n a,b,c=map(int,input().split())\n a-=1\n b-=1\n l[a][b]=c\ndp=[0]*C\nfor i in range(R):\n ndp=[0]*C\n kdp=[0]*4\n kdp[0]=dp[0]\n kdp[1]=l[i][0]+dp[0]\n ndp[0]=kdp[1]\n for j in range(1,C):\n kdp[0]=max(kdp[0],dp[j])\n for k in range(2,-1,-1):\n kdp[k+1]=max(kdp[k+1],kdp[k]+l[i][j])\n ndp[j]=max(kdp)\n dp=ndp\nprint(dp[C-1])", "#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define chmax(x, y) x = max(x, y)\n\nusing namespace std;\nusing ll = long long;\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n int R, C, n;\n cin >> R >> C >> n;\n rep(i, n) {\n int r , c, v;\n cin >> r >> c >> v;\n a[r - 1][c - 1] = v;\n }\n\n rep(i, R) rep(j, C) {\n for (int k = 2; k >= 0; k--) {\n chmax(dp[i][j][k + 1], dp[i][j][k] + a[i][j]);\n }\n rep(k, 4) {\n chmax(dp[i + 1][j][0], dp[i][j][k]);\n chmax(dp[i][j + 1][k], dp[i][j][k]);\n }\n }\n\n ll ans = 0;\n rep(k, 4) chmax(ans, dp[R - 1][C - 1][k]);\n cout << ans << endl;\n\n return 0;\n}", "#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define chmax(x, y) x = max(x, y)\nusing namespace std;\ntypedef long long ll;\n\nll a[3005][3005], dp[3005][3005][4];\n\nint main() {\n ll R, C, n, ans = 0, r, c, v;\n cin >> R >> C >> n;\n rep(i, n) cin >> r >> c >> v, a[r][c] = v;\n\n rep(i, R + 1) rep(j, C + 1) rep(k, 3 + 1) {\n if (i - 1 >= 0) {\n chmax(dp[i][j][0], dp[i - 1][j][k]);\n chmax(dp[i][j][1], dp[i - 1][j][k] + a[i][j]);\n }\n if (j - 1 >= 0) {\n chmax(dp[i][j][k], dp[i][j - 1][k]);\n if (k - 1 >= 0) chmax(dp[i][j][k], dp[i][j - 1][k - 1] + a[i][j]);\n }\n }\n\n rep(k, 4) chmax(ans, dp[R][C][k]);\n cout << ans << endl;\n return 0;\n}", "// package beginner00175;\n\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.PriorityQueue;\n\npublic class Main {\n\tprivate static PrintWriter out;\n\n\tpublic static void solve() {\n\t\tIn in = new In();\n\t\t// BEFORE SUBMISSION :: Change class name to Main and comment out package name\n\t\t// !!!\n\t\tint n = in.ni();\n\t\tint m = in.ni();\n\t\tint K = in.ni();\n\t\tlong[][] vals = new long[n][m];\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tvals[in.ni() - 1][in.ni() - 1] = in.nl();\n\t\t}\n\n\t\tlong[][][] dp = new long[n + 1][m + 1][4];\n\t\tfor (int r = n - 1; r >= 0; r--) {\n\t\t\tfor (int c = m - 1; c >= 0; c--) {\n\t\t\t\tlong bestDown = max4(dp[r + 1][c][0], dp[r + 1][c][1], dp[r + 1][c][2],\n\t\t\t\t\t\tdp[r + 1][c][3]);\n\t\t\t\tfor (int k = 0; k <= 3; k++) {\n\t\t\t\t\tlong down = Math.max(bestDown, (k < 3 ? vals[r][c] : 0) + bestDown);\n\t\t\t\t\tlong right = Math.max(dp[r][c + 1][k], (k < 3 ? vals[r][c] + dp[r][c + 1][k + 1]: dp[r][c + 1][k]));\n\t\t\t\t\tdp[r][c][k] = Math.max(down, right);\n\t\t\t\t}\n//\t\t\t\t{\n//\t\t\t\t\tlong down = bestDown;\n//\t\t\t\t\tlong right = dp[r][c + 1][0];\n//\t\t\t\t\tlong getAndDown = vals[r][c] + bestDown;\n//\t\t\t\t\tlong getAndRight = vals[r][c] + dp[r][c + 1][1];\n//\t\t\t\t\tdp[r][c][0] = max4(down, right, getAndDown, getAndRight);\n//\t\t\t\t}\n//\t\t\t\t{\n//\t\t\t\t\tlong down = bestDown;\n//\t\t\t\t\tlong right = dp[r][c + 1][1];\n//\t\t\t\t\tlong getAndDown = vals[r][c] + bestDown;\n//\t\t\t\t\tlong getAndRight = vals[r][c] + dp[r][c + 1][2];\n//\t\t\t\t\tdp[r][c][1] = max4(down, right, getAndDown, getAndRight);\n//\t\t\t\t}\n//\n//\t\t\t\t{\n//\t\t\t\t\tlong down = bestDown;\n//\t\t\t\t\tlong right = dp[r][c + 1][2];\n//\t\t\t\t\tlong getAndDown = vals[r][c] + bestDown;\n//\t\t\t\t\tlong getAndRight = vals[r][c] + dp[r][c + 1][3];\n//\t\t\t\t\tdp[r][c][2] = max4(down, right, getAndDown, getAndRight);\n//\t\t\t\t}\n//\n//\t\t\t\t{\n//\t\t\t\t\tlong down = bestDown;\n//\t\t\t\t\tlong right = dp[r][c + 1][3];\n//\t\t\t\t\tlong getAndDown = bestDown;\n//\t\t\t\t\tlong getAndRight = dp[r][c + 1][3];\n//\t\t\t\t\tdp[r][c][3] = max4(down, right, getAndDown, getAndRight);\n//\t\t\t\t}\n\t\t\t}\n\t\t}\n\n//\t\tfor(int r = 0;r < n; r++ ) {\n//\t\t\tfor (int c = 0; c < m; c++) {\n//\t\t\t\tSystem.out.print(\"[\" + dp[r][c][0] +\" , \"+dp[r][c][1]+\" , \"+ dp[r][c][0] +\" , \"+dp[r][c][1] + \"] \");\n//\t\t\t}\n//\t\t\tSystem.out.println();\n//\t\t}\n\t\tlong ans = max4(dp[0][0][0], dp[0][0][1], dp[0][0][2], dp[0][0][3]);\n\t\tout.println(ans);\n\n\t}\n\n\tstatic long max4(long a, long b, long c, long d) {\n\t\treturn Math.max(Math.max(a, b), Math.max(c, d));\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// long start = System.nanoTime();\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t\t// System.out.println(\"Elapsed: \" + (System.nanoTime() - start) / 1000000 +\n\t\t// \"ns\");\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static class In {\n\t\tfinal private static int BUFFER_SIZE = 1024;\n\t\tprivate byte[] buf;\n\t\tprivate InputStream is;\n\t\tprivate int buflen;\n\t\tprivate int bufptr;\n\n\t\tpublic In() {\n\t\t\tis = System.in;\n\t\t\tbuf = new byte[BUFFER_SIZE];\n\t\t\tbuflen = bufptr = 0;\n\t\t}\n\n\t\tpublic In(String input) {\n\t\t\tis = new ByteArrayInputStream(input.getBytes());\n\t\t\tbuf = new byte[BUFFER_SIZE];\n\t\t\tbuflen = bufptr = 0;\n\t\t}\n\n\t\tpublic int readByte() {\n\t\t\tif (bufptr >= buflen) {\n\t\t\t\ttry {\n\t\t\t\t\tbuflen = is.read(buf);\n\t\t\t\t} catch (IOException ioe) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tbufptr = 0;\n\t\t\t}\n\t\t\tif (buflen <= 0)\n\t\t\t\treturn -1;\n\t\t\treturn buf[bufptr++];\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tpublic int skip() {\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t\t;\n\t\t\treturn b;\n\t\t}\n\n\t\t/* Next character */\n\t\tpublic char nc() {\n\t\t\treturn (char) skip();\n\t\t}\n\n\t\t/* Next double */\n\t\tpublic double nd() {\n\t\t\treturn Double.parseDouble(ns());\n\t\t}\n\n\t\t/* Next string */\n\t\tpublic String ns() {\n\t\t\tfinal StringBuilder sb = new StringBuilder();\n\t\t\tint b = skip();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\t/* Next integer */\n\t\tpublic int ni() {\n\t\t\tboolean minus = false;\n\t\t\tint num = 0;\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\twhile (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn minus ? -num : num;\n\t\t}\n\n\t\t/* Next long */\n\t\tpublic long nl() {\n\t\t\tboolean minus = false;\n\t\t\tlong num = 0;\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\twhile (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn minus ? -num : num;\n\t\t}\n\n\t\t/* Next integer 1D array */\n\t\tpublic int[] nia(int n) {\n\t\t\tfinal int[] arr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = ni();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next long 1D array */\n\t\tpublic long[] nla(int n) {\n\t\t\tfinal long[] arr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = nl();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next string 1D array */\n\t\tpublic String[] nsa(int n) {\n\t\t\tfinal String[] arr = new String[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = ns();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next char 1D array */\n\t\tpublic char[] nca(int n) {\n\t\t\tfinal char[] arr = new char[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = nc();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next double 1D array */\n\t\tpublic double[] nda(int n) {\n\t\t\tfinal double[] arr = new double[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = nc();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next integer matrix */\n\t\tpublic int[][] nim(int n, int m) {\n\t\t\tfinal int[][] arr = new int[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = ni();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next long matrix */\n\t\tpublic long[][] nlm(int n, int m) {\n\t\t\tfinal long[][] arr = new long[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = nl();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next string matrix */\n\t\tpublic String[][] nsm(int n, int m) {\n\t\t\tfinal String[][] arr = new String[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = ns();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next char matrix */\n\t\tpublic char[][] ncm(int n, int m) {\n\t\t\tfinal char[][] arr = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = nc();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next double matrix */\n\t\tpublic double[][] ndm(int n, int m) {\n\t\t\tfinal double[][] arr = new double[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = nd();\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic static void log(Object... o) {\n\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t\t}\n\t}\n\n}\n", "# coding: utf-8\n# Your code here!\nimport sys\nreadline = sys.stdin.readline\nread = sys.stdin.read\n\nh,w,k,*hwk = map(int,read().split())\nit = iter(hwk)\nb = [[0]*w for _ in range(h+1)]\nfor hi,wi,ki in zip(it,it,it):\n b[hi-1][wi-1] = ki\n\ndp = [[0]*4 for _ in range(w)]\nfor i in range(h):\n ndp = [[0]*4 for _ in range(w)]\n for j in range(w):\n if j != 0:\n ndp[j] = ndp[j-1][:]\n ndp[j][0] = max(ndp[j][0],max(dp[j]))\n \n \n for k in range(3,0,-1):\n ndp[j][k] = max(ndp[j][k],ndp[j][k-1]+ b[i][j])\n \n\n dp = ndp\n\nprint(max(dp[-1]))\n\n#print(dp)\n\n\n\n\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define endl '\\n'\n#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);\nconst int N=3009;\nll a[N][N];\nll dp[N][N][5];\nint r,c,k,l,m,v;\nll f(int i,int j,int cnt)\n{\n if (i>r||j>c)\n return 0;\n if (dp[i][j][cnt]!=-1)\n return dp[i][j][cnt];\n ll mx=0;\n if (cnt<3)\n {\n mx=max(mx,a[i][j]+f(i,j+1,cnt+1));\n mx=max(mx,a[i][j]+f(i+1,j,0));\n }\n mx=max(mx,f(i,j+1,cnt));\n mx=max(mx,f(i+1,j,0));\n return dp[i][j][cnt]=mx;\n}\nint main()\n{\n FASTINOUT;\n cin>>r>>c>>k;\n for (int i=1; i<=k; i++)\n {\n cin>>l>>m>>v;\n a[l][m]=v;\n }\n memset(dp,-1,sizeof dp);\n cout<<f(1,1,0);\n return 0;\n}\n", "import sys\ninput = sys.stdin.buffer.readline\n\nR, C, K = map(int,input().split())\nRC = [[0] * (C+1) for _ in range(R+1)]\n\nfor _ in range(K):\n r, c, v = map(int,input().split())\n RC[r-1][c-1] = v\n\n\ndp = [[[0] * (C+1) for i in range(R+1)] for j in range(4)]\n\ndp[1][0][0] = RC[0][0]\nfor r in range(R):\n for c in range(C):\n for i in range(4):\n dp[i][r][c+1] = max(dp[i][r][c], dp[i][r][c+1])\n if i <= 2:\n dp[i+1][r][c+1] = max(dp[i][r][c] + RC[r][c+1], dp[i+1][r][c+1])\n dp[0][r+1][c] = max(dp[i][r][c], dp[0][r+1][c])\n dp[1][r+1][c] = max(dp[1][r+1][c], dp[0][r+1][c] + RC[r+1][c])\n\nprint(max(dp[0][-2][-2], dp[1][-2][-2], dp[2][-2][-2], dp[3][-2][-2]))\n", "#include <bits/stdc++.h>\n\nusing namespace std ;\n\nconst int MAX = 3000 + 10 ;\n\nint arr[MAX][MAX] ;\nint n , m , k ;\n\nlong long dp[MAX][MAX][4] ;\n\nlong long solve(int i , int j , int cnt)\n{\n\tif(i == n || j == m)\n\t\treturn 0 ;\n\tlong long &ret = dp[i][j][cnt] ;\n\tif(ret != -1)\n\t\treturn ret ;\n\tret = 0 ;\n\tret = max(ret , solve(i+1 , j , 0)) ;\n\tret = max(ret , solve(i , j+1 , cnt)) ;\n\tif(cnt != 3)\n\t{\n\t\tret = max(ret , solve(i+1 , j , 0) + arr[i][j]) ;\n\t\tret = max(ret , solve(i , j+1 , cnt+1) + arr[i][j]) ;\n\t}\n\treturn ret ;\n}\n\nint main()\n{\n\tmemset(dp , -1 , sizeof(dp)) ;\n\tios_base::sync_with_stdio(0) ;\n\tcin.tie(0) ;\n\tcin>>n>>m>>k ;\n\twhile(k--)\n\t{\n\t\tint i , j ;\n\t\tcin>>i>>j ;\n\t\ti-- , j-- ;\n\t\tcin>>arr[i][j] ;\n\t}\n\treturn cout<<solve(0 , 0 , 0)<<\"\\n\" , 0 ;\n}\t\t", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tint r, c, k;\n\tcin >> r >> c >> k;\n\tvector<vector<vector<long long>>> dp(r + 1, vector<vector<long long>>(c + 1, vector<long long>(4)));\n\tvector<vector<long long>> grid(r, vector<long long>(c));\n\tfor (int i = 0; i < k; i++) {\n\t\tint a, b, v;\n\t\tcin >> a >> b >> v;\n\t\tgrid[a - 1][b - 1] = v;\n\t}\n\tfor (int i = 0; i < r; i++) {\n\t\tfor (int j = 0; j < c; j++) {\n\t\t\tvector<long long> dp_before = dp[i][j];\n\t\t\tfor (int k = 0; k <= 3; k++) {\n\t\t\t\tdp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][k]);\n\t\t\t\tdp[i][j + 1][k] = max(dp[i][j + 1][k], dp[i][j][k]);\n\t\t\t\tif (k < 3) {\n\t\t\t\t\tdp[i][j][k + 1] = max(dp[i][j][k + 1], dp_before[k] + grid[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << *max_element(dp[r - 1][c - 1].begin(), dp[r - 1][c - 1].end());\n}\n\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tvar sc = new Scanner(System.in);\n\t\tvar r = sc.nextInt();\n\t\tvar c = sc.nextInt();\n\t\tvar k = sc.nextInt();\n\t\tvar v = new long[r][c][5];\n\t\tfor (var i = 0; i < k; i++) {\n\t\t\tv[sc.nextInt() - 1][sc.nextInt() - 1][0] = sc.nextInt();\n\t\t}\n\t\tsc.close();\n\n\t\tfor (var i = 0; i < r; i++) {\n\t\t\tfor (var j = 0; j < c; j++) {\n\t\t\t\tvar cv = v[i][j][0];\n\t\t\t\tv[i][j][0] = 0;\n\t\t\t\tfor (var ic = 0; ic < 4; ic++) {\n\t\t\t\t\tvar rv1 = (i > 0 ? getValue(v, i - 1, j) : 0);\n\t\t\t\t\tvar rv2 = (j > 0 ? v[i][j - 1][ic] : 0);\n\t\t\t\t\tvar rv3 = (j > 0 ? v[i][j - 1][ic + 1] : 0);\n\t\t\t\t\tif (cv > 0) {\n\t\t\t\t\t\tif (ic == 0) {\n\t\t\t\t\t\t\tv[i][j][ic + 1] = Math.max(Math.max(rv1 + cv, rv2 + cv), rv3);\n\t\t\t\t\t\t} else if (rv2 > 0) {\n\t\t\t\t\t\t\tv[i][j][ic + 1] = Math.max(rv2 + cv, rv3);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (ic == 0) {\n\t\t\t\t\t\t\tv[i][j][ic] = Math.max(rv1, rv2);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tv[i][j][ic] = rv2;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t//System.out.printf(\"%d %d %d %d\\r\\n\", v[i][j][0], v[i][j][1], v[i][j][2], v[i][j][3]);\n\t\t\t}\n\t\t\t//System.out.println(\"----------\");\n\t\t}\n\n\t\tSystem.out.println(getValue(v, r - 1, c - 1));\n\t}\n\n\tprivate static long getValue(long[][][] v, int i, int j) {\n\t\treturn Math.max(Math.max(Math.max(v[i][j][0], v[i][j][1]), v[i][j][2]), v[i][j][3]);\n\t}\n}\n", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing vi=vector<int>;\nusing P = pair<int,int>;\nusing Graph = vector<vector<int>>;\n#define chmax(x,y) x = max(x,y)\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int R,C,n;\n cin >> R >> C >> n;\n rep(i,n){\n int r,c,v;\n cin >> r >> c >> v;\n a[r-1][c-1]=v;\n }\n\n rep(i,R)rep(j,C){\n for(int k=2;k>=0;--k){\n chmax(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n }\n rep(k,4){\n chmax(dp[i+1][j][0],dp[i][j][k]);\n chmax(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n ll ans=0;\n rep(k,4) chmax(ans,dp[R-1][C-1][k]);\n cout << ans << \"\\n\";\n return 0;\n} ", "import sys\ninput = sys.stdin.readline\n\nh, w, k = map(int, input().split())\nG = [[0]*w for _ in range(h)]\nfor _ in range(k):\n r, c, v = map(int, input().split())\n r -= 1\n c -= 1\n G[r][c] = v\ndp = [[[0]*w for i in range(h)] for j in range(4)]\ndp[0][0][0] = 0\ndp[1][0][0] = G[0][0]\nfor i in range(h):\n for j in range(w):\n if j:\n dp[0][i][j] = dp[0][i][j-1]\n for k in range(1, 4):\n dp[k][i][j] = max(dp[k][i][j], dp[k-1][i][j-1]+G[i][j], dp[k][i][j-1])\n if i:\n dp[0][i][j] = max(dp[0][i][j], max(dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j]))\n dp[1][i][j] = max(dp[1][i][j], max(dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j])+G[i][j])\nans = max(dp[0][h-1][w-1],dp[1][h-1][w-1],dp[2][h-1][w-1],dp[3][h-1][w-1])\nprint(ans)", "// template for atcode\nimport java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport java.util.stream.Collectors;\n\npublic class Main {\n\n private static final int MOD = (int)1e9 + 7; //998244353;\n // private static final long INF = (long)1e17;\n private static final int INF = (int)1e9;\n\n\n public Main(FastScanner in, PrintWriter out) {\n int R = in.nextInt();\n int C = in.nextInt();\n int K = in.nextInt();\n int[][] A = new int[R + 1][C + 1];\n for (int i = 0; i < K; i++) {\n int r = in.nextInt();\n int c = in.nextInt();\n A[r][c] = in.nextInt();\n }\n long[][][] dp = new long[R + 1][C + 1][4];\n for (int i = 1; i <= R; i++) {\n for (int j = 1; j <= C; j++) {\n for (int k = 0; k <= 3; k++) {\n dp[i][j][0] = max(dp[i][j][0], dp[i-1][j][k]);\n dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k]);\n }\n // if (A[i][j] > 0) {\n for (int k = 3; k > 0; k--) {\n dp[i][j][k] = max(dp[i][j][k], dp[i][j][k-1] + A[i][j]);\n }\n // }\n }\n }\n long res = Arrays.stream(dp[R][C]).max().orElse(0);\n out.println(res);\n }\n\n private int gcd(int a, int b) {\n while (true) {\n if (b == 0) return a;\n int tmp = a;\n a = b;\n b = tmp % b;\n }\n }\n\n private long gcd(long a, long b) {\n while (true) {\n if (b == 0) return a;\n long tmp = a;\n a = b;\n b = tmp % b;\n }\n }\n\n private long powm(long x, long p) {\n long res = 1;\n while (p > 0) {\n if (p % 2 == 1)\n res = res * x % MOD;\n x = x * x % MOD;\n p /= 2;\n }\n return res;\n }\n\n public static void main(String[] args) {\n PrintWriter out = new PrintWriter(System.out);\n // Scanner in = new Scanner(\n // new BufferedReader(new InputStreamReader(System.in)));\n FastScanner in = new FastScanner(System.in);\n\n Main sol = new Main(in, out);\n out.close();\n }\n}\n\n// Pair\nclass Pair<T extends Comparable<? super T>, U extends Comparable<? super U>> implements Comparable<Pair<T, U>> {\n T a;\n U b;\n Pair() { }\n Pair(T a, U b) {\n this.a = a;\n this.b = b;\n }\n\n @Override\n public String toString() { return \"(\"+a.toString()+\", \"+b.toString()+\")\"; }\n\n @Override\n public int hashCode() { return Objects.hash(a, b); }\n\n @Override\n public boolean equals(Object obj) {\n if(this == obj) return true;\n if(obj == null) return false;\n if(this.getClass() != obj.getClass()) return false;\n Pair that = (Pair) obj;\n if(this.a.getClass() != that.a.getClass()) return false;\n if(this.b.getClass() != that.b.getClass()) return false;\n if(!this.a.equals(that.a)) return false;\n if(!this.b.equals(that.b)) return false;\n return true;\n }\n\n @Override\n public int compareTo(Pair<T, U> that) {\n int c = (this.a).compareTo(that.a);\n if(c == 0) c = (this.b).compareTo(that.b);\n return c;\n }\n}\n\n\nclass FastScanner{\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream)\n {\n this.stream = stream;\n }\n\n int read()\n {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars){\n curChar = 0;\n try{\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c)\n {\n return c==' '||c=='\\n'||c=='\\r'||c=='\\t'||c==-1;\n }\n\n boolean isEndline(int c)\n {\n return c=='\\n'||c=='\\r'||c==-1;\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String next(){\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do{\n res.appendCodePoint(c);\n c = read();\n }while(!isSpaceChar(c));\n return res.toString();\n }\n\n String nextLine(){\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do{\n res.appendCodePoint(c);\n c = read();\n }while(!isEndline(c));\n return res.toString();\n }\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Iterator;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.NoSuchElementException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n EPickingGoods solver = new EPickingGoods();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EPickingGoods {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\n int r = in.readInt(), c = in.readInt(), k = in.readInt();\n\n int[][] grid = new int[r][c];\n\n for (int i = 0; i < k; ++i) {\n int x = in.readInt() - 1;\n int y = in.readInt() - 1;\n int v = in.readInt();\n grid[x][y] = v;\n }\n\n long dp[][][] = new long[r][c][4];\n\n dp[0][0][1] = grid[0][0];\n\n for (int i = 0; i < r; ++i)\n for (int j = 0; j < c; ++j)\n for (int m = 0; m < 4; ++m) {\n\n if (i + 1 < r) {\n dp[i + 1][j][0] = Math.max(dp[i + 1][j][0], dp[i][j][m]);\n dp[i + 1][j][1] = Math.max(dp[i + 1][j][1], dp[i][j][m] + grid[i + 1][j]);\n }\n if (j + 1 < c) {\n dp[i][j + 1][m] = Math.max(dp[i][j + 1][m], dp[i][j][m]);\n if (m + 1 < 4)\n dp[i][j + 1][m + 1] = Math.max(dp[i][j + 1][m + 1], dp[i][j][m] + grid[i][j + 1]);\n }\n }\n out.printLine(ArrayUtils.maxElement(dp[r - 1][c - 1]));\n\n }\n\n }\n\n static class ArrayUtils {\n public static long maxElement(long[] array) {\n return new LongArray(array).max();\n }\n\n }\n\n static class LongArray extends LongAbstractStream implements LongList {\n private long[] data;\n\n public LongArray(long[] arr) {\n data = arr;\n }\n\n public int size() {\n return data.length;\n }\n\n public long get(int at) {\n return data[at];\n }\n\n public void removeAt(int index) {\n throw new UnsupportedOperationException();\n }\n\n }\n\n static interface LongStream extends Iterable<Long>, Comparable<LongStream> {\n public LongIterator longIterator();\n\n default public Iterator<Long> iterator() {\n return new Iterator<Long>() {\n private LongIterator it = longIterator();\n\n public boolean hasNext() {\n return it.isValid();\n }\n\n public Long next() {\n long result = it.value();\n it.advance();\n return result;\n }\n };\n }\n\n default public int compareTo(LongStream c) {\n LongIterator it = longIterator();\n LongIterator jt = c.longIterator();\n while (it.isValid() && jt.isValid()) {\n long i = it.value();\n long j = jt.value();\n if (i < j) {\n return -1;\n } else if (i > j) {\n return 1;\n }\n it.advance();\n jt.advance();\n }\n if (it.isValid()) {\n return 1;\n }\n if (jt.isValid()) {\n return -1;\n }\n return 0;\n }\n\n default public long max() {\n long result = Long.MIN_VALUE;\n for (LongIterator it = longIterator(); it.isValid(); it.advance()) {\n long current = it.value();\n if (current > result) {\n result = current;\n }\n }\n return result;\n }\n\n }\n\n static interface LongList extends LongReversableCollection {\n public abstract long get(int index);\n\n public abstract void removeAt(int index);\n\n default public LongIterator longIterator() {\n return new LongIterator() {\n private int at;\n private boolean removed;\n\n public long value() {\n if (removed) {\n throw new IllegalStateException();\n }\n return get(at);\n }\n\n public boolean advance() {\n at++;\n removed = false;\n return isValid();\n }\n\n public boolean isValid() {\n return !removed && at < size();\n }\n\n public void remove() {\n removeAt(at);\n at--;\n removed = true;\n }\n };\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static interface LongReversableCollection extends LongCollection {\n }\n\n static interface LongIterator {\n public long value() throws NoSuchElementException;\n\n public boolean advance();\n\n public boolean isValid();\n\n }\n\n static interface LongCollection extends LongStream {\n public int size();\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n }\n\n static abstract class LongAbstractStream implements LongStream {\n public String toString() {\n StringBuilder builder = new StringBuilder();\n boolean first = true;\n for (LongIterator it = longIterator(); it.isValid(); it.advance()) {\n if (first) {\n first = false;\n } else {\n builder.append(' ');\n }\n builder.append(it.value());\n }\n return builder.toString();\n }\n\n public boolean equals(Object o) {\n if (!(o instanceof LongStream)) {\n return false;\n }\n LongStream c = (LongStream) o;\n LongIterator it = longIterator();\n LongIterator jt = c.longIterator();\n while (it.isValid() && jt.isValid()) {\n if (it.value() != jt.value()) {\n return false;\n }\n it.advance();\n jt.advance();\n }\n return !it.isValid() && !jt.isValid();\n }\n\n public int hashCode() {\n int result = 0;\n for (LongIterator it = longIterator(); it.isValid(); it.advance()) {\n result *= 31;\n result += it.value();\n }\n return result;\n }\n\n }\n}\n\n", "R, C, k = map(int, input().split())\nxs = [[0] * C for _ in range(R)]\nfor _ in range(k):\n r, c, v = map(int, input().split())\n xs[r - 1][c - 1] = v\n\ndp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]\nfor i in range(R):\n for j in range(C):\n for k in range(2, -1, -1):\n dp[k + 1][i][j] = max(dp[k + 1][i][j], dp[k][i][j] + xs[i][j])\n for k in range(4):\n dp[k][i][j + 1] = max(dp[k][i][j + 1], dp[k][i][j])\n dp[0][i + 1][j] = max(dp[0][i + 1][j], dp[k][i][j])\nans = 0\nfor k in range(4):\n ans = max(ans, dp[k][R - 1][C - 1])\nprint(ans)\n", "import sys\ndef input(): return sys.stdin.readline().rstrip()\n\nR, C, k = (int(x) for x in input().split())\nV = [[0] * (C + 5) for _ in range(R + 5)]\nfor _ in range(k):\n r, c, v = (int(x) for x in input().split())\n V[r][c] = v\n\n# dp[3][i][j]\ndp = [[[0] * (C + 5) for _ in range(R + 5)] for _ in range(4)]\nfor i in range(R + 3):\n for j in range(C + 3):\n for k in range(4):\n # 行移動\n dp[0][i + 1][j] = max(dp[0][i + 1][j], dp[k][i][j])\n dp[1][i + 1][j] = max(dp[1][i + 1][j], dp[k][i][j] + V[i + 1][j])\n # 列移動\n dp[k][i][j + 1] = max(dp[k][i][j + 1], dp[k][i][j])\n if k < 3:\n dp[k + 1][i][j + 1] = max(dp[k + 1][i][j + 1], dp[k][i][j] + V[i][j + 1])\nprint(max(dp[k][R][C] for k in range(4)))\n", "import sys\ninput = sys.stdin.readline\n\nR,C,K=list(map(int,input().split()))\nitemMap = [[0]*(C+1) for _ in range(R+1)]\ndp =[[[0]*(C+1) for _ in range(R+1)] for _ in range(4)]\n\nfor _ in range(K):\n r,c,v=list(map(int,input().split()))\n itemMap[r-1][c-1]=v\n\nfor ir in range(R):\n for ic in range(C):\n for k in range(2,-1,-1):\n #-拾う拾わない遷移-#\n dp[k+1][ir][ic] = max(dp[k+1][ir][ic],dp[k][ir][ic]+itemMap[ir][ic])\n #-位置遷移-#\n for k in range(4):\n dp[0][ir+1][ic] = max(dp[0][ir+1][ic],dp[k][ir][ic])\n dp[k][ir][ic+1] = max(dp[k][ir][ic+1],dp[k][ir][ic])\n\nans = 0\nfor k in range(4):\n ans = max(ans,dp[k][R-1][C-1])\nprint(ans)\n \n \n", "import java.io.*; \nimport java.math.*;\nimport java.util.*;\npublic class Main { //~IQEmperor~ \n\tpublic static void main(String[] args) {\n\t\tFastScanner I = new FastScanner(); //Input\n\t\tOutPut O = new OutPut(); //Output\n\t\tint R = I.nextInt();\n\t\tint C = I.nextInt();\n\t\tint K = I.nextInt();\n\t\tlong[][] goods = new long[R][C];\n\t\tlong[][] dp = new long[R][C]; //{0,1,2,3} items picked up in row so far\n\t\twhile (K-->0) {\n\t\t\tint r = I.nextInt()-1;\n\t\t\tint c = I.nextInt()-1;\n\t\t\tgoods[r][c] = I.nextLong();\n\t\t}\n\t\tdp[0][0]=goods[0][0];\n\t\tArrayList<Long> items = new ArrayList<Long>();\n\t\tif (goods[0][0]>0) items.add(goods[0][0]);\n\t\tfor (int c = 1; c < C; c++) {\n\t\t\tif (goods[0][c]>0) {\n\t\t\t\titems.add(goods[0][c]);\n\t\t\t\tCollections.sort(items);\n\t\t\t\tfor (int i = items.size()-1; i>=max(items.size()-3,0); i--) {\n\t\t\t\t\tlong cur = items.get(i);\n\t\t\t\t\tdp[0][c]+=cur; //3 biggest\n\t\t\t\t}\n\t\t\t}else dp[0][c]=dp[0][c-1]; //Just rely on previous cell if no items \n\t\t}\n\t\tfor (int r = 1; r < R; r++) {\n\t\t\tdp[r][0]=dp[r-1][0]+goods[r][0];\n\t\t}\n\t\tfor (int r = 1; r < R; r++) {\n\t\t\tfor (int c = 1; c < C; c++) {\n\t\t\t\tif (goods[r][c]>0) {\n\t\t\t\t\tlong x = 0;\n\t\t\t\t\tlong y = 0;\n\t\t\t\t\tlong z = 0; //{x,y,z} indicate three biggest in sorted order \n\t\t\t\t\tfor (int back = c; back>=0; back--) {\n\t\t\t\t\t\tif (goods[r][back]>0) {\n\t\t\t\t\t\t\tif (goods[r][back]>z) {\n\t\t\t\t\t\t\t\tlong Y = z;\n\t\t\t\t\t\t\t\tlong X = y;\n\t\t\t\t\t\t\t\tz=goods[r][back];\n\t\t\t\t\t\t\t\ty=Y;\n\t\t\t\t\t\t\t\tx=X;\n\t\t\t\t\t\t\t}else if (goods[r][back]>y) {\n\t\t\t\t\t\t\t\tlong X = y;\n\t\t\t\t\t\t\t\ty=goods[r][back];\n\t\t\t\t\t\t\t\tx=X;\n\t\t\t\t\t\t\t}else if (goods[r][back]>x) {\n\t\t\t\t\t\t\t\tx=goods[r][back];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[r][c]=max(dp[r][c],dp[r-1][back]+x+y+z);\n\t\t\t\t\t}\n\t\t\t\t}else {\n\t\t\t\t\tdp[r][c]=max(dp[r-1][c],dp[r][c-1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tO.pln(dp[R-1][C-1]);\n\t}\n\tpublic static long min(long a, long b) {return Math.min(a,b);}\n\tpublic static long max(long a, long b) {return Math.max(a,b);}\n\tpublic static int min(int a, int b) {return Math.min(a,b);}\n\tpublic static int max(int a, int b) {return Math.max(a,b);}\n\tpublic static long abs(long x, long y) {return Math.abs(x-y);}\n\tpublic static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) \n\tans++; return ans;}\n\tpublic static long GCD(long a, long b) {\n\t\tif (a==0||b==0) return Math.max(a,b);\n\t\treturn GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));\n\t}\n\tpublic static long FastExp(long base, long exp, long mod) {\n\t\tlong ans=1;\n\t\twhile (exp>0) {\n\t\t\tif (exp%2==1) ans*=base;\n\t\t\texp/=2;\n\t\t\tbase*=base;\n\t\t\tbase%=mod;\n\t\t\tans%=mod;\n\t\t}\n\t\treturn ans;\n\t}\n\tpublic static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}\n\tpublic static int pop(long x) { //Returns number of bits within a number\n\t\tint cnt = 0;\n\t\twhile (x>0) {\n\t\t\tif (x%2==1) cnt++;\n\t\t\tx/=2;\n\t\t}\n\t\treturn cnt;\n\t}\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint nextInt() {return Integer.parseInt(next());}\n\t\tlong nextLong() {return Long.parseLong(next());};\n\t\tdouble nextDouble() {return Double.parseDouble(next());}\n\t}\n\tstatic class OutPut{\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\tvoid pln(double x) {w.println(x);w.flush();}\n\t\tvoid pln(boolean x) {w.println(x);w.flush();}\n\t\tvoid pln(int x) {w.println(x);w.flush();}\n\t\tvoid pln(long x) {w.println(x);w.flush();}\n\t\tvoid pln(String x) {w.println(x);w.flush();}\n\t\tvoid pln(char x) {w.println(x);w.flush();}\n\t\tvoid pln(StringBuilder x) {w.println(x);w.flush();}\n\t\tvoid pln(BigInteger x) {w.println(x);w.flush();}\n\t\tvoid p(int x) {w.print(x);w.flush();}\n\t\tvoid p(long x) {w.print(x);w.flush();}\n\t\tvoid p(String x) {w.print(x);w.flush();}\n\t\tvoid p(char x) {w.print(x);w.flush();}\n\t\tvoid p(StringBuilder x) {w.print(x);w.flush();}\n\t\tvoid p(BigInteger x) {w.print(x);w.flush();}\n\t\tvoid p(double x) {w.print(x);w.flush();}\n\t\tvoid p(boolean x) {w.print(x);w.flush();}\n\t}\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define chmax(x,y) x = max(x,y)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main(){\n int R,C,K;\n cin >> R >> C >> K;\n rep(i,K){\n int r,c,v;\n cin >> r >> c >> v;\n a[r-1][c-1] = v;\n }\n\n rep(i,R) rep(j,C){\n for(int k=2;k>=0;k--){\n chmax(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n }\n rep(k,4){\n chmax(dp[i+1][j][0],dp[i][j][k]);\n chmax(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n\n ll ans=0;\n rep(k,4) chmax(ans,dp[R-1][C-1][k]); \n\n cout << ans << endl;\n return 0; \n}", "R, C, K = map(int, input().split())\n\nV = [[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[r][c] = v\n\npre0 = [0]*(C+1)\npre1 = [0]*(C+1)\npre2 = [0]*(C+1)\npre3 = [0]*(C+1)\nfor i in range(R+1):\n now0 = [0]*(C+1)\n now1 = [0]*(C+1)\n now2 = [0]*(C+1)\n now3 = [0]*(C+1)\n for j in range(C+1):\n v = V[i][j]\n la = lb = 0\n if j > 0:\n la = now0[j-1]\n lb = now1[j-1]\n now2[j] = max(now2[j], now2[j-1], lb + v)\n now3[j] = max(now3[j], now3[j-1], now2[j-1] + v)\n if i > 0:\n max_p = max(pre0[j], pre1[j], pre2[j], pre3[j])\n now0[j] = max(now0[j], max_p, la)\n now1[j] = max(now1[j], max_p + v, la + v, lb)\n pre0 = now0\n pre1 = now1\n pre2 = now2\n pre3 = now3\n\nprint(max(now0[C], now1[C], now2[C], now3[C]))\n", "def solve():\n R, C, K = map(int, input().split())\n item = [[0]*C for _ in range(R)]\n for i in range(K):\n r,c,v = map(int, input().split())\n item[r-1][c-1] = v\n last_dp = [[0]*5 for _ in range(C+1)]\n for i in range(1,R+1):\n dp = [[0]*5 for _ in range(C+1)]\n for j in range(1,C+1):\n for k in range(4): #横から取らない\n dp[j][k] = dp[j-1][k]\n #上から取らない\n dp[j][0] = max(dp[j][0],last_dp[j][-1])\n if item[i-1][j-1]>0:\n #上からとる\n dp[j][1] = max(dp[j][1],last_dp[j][-1]+item[i-1][j-1])\n for k in range(1,4): #横から取る\n dp[j][k] = max(dp[j][k],dp[j-1][k-1]+item[i-1][j-1])\n dp[j][4] = max(dp[j][:4])\n last_dp = dp\n ans = max(last_dp[-1])\n return ans\nprint(solve())", "# -*- coding: utf-8 -*-\n\nR,C,K = map(int, input().split())\n\nitems = [[0 for _ in range(C+1)] for _ in range(R+1)]\nfor i in range(K):\n r,c,v = map(int, input().split())\n items[r][c] = v\n\nDP1 = [0 for _ in range(C+1)]\nDP2 = [0 for _ in range(C+1)]\nDP3 = [0 for _ in range(C+1)]\nfor r in range(1,R+1):\n for c in range(1,C+1):\n item = items[r][c]\n DP1[c] = max(DP3[c]+item,DP1[c-1])\n DP2[c] = max(DP1[c],DP2[c-1],DP1[c-1]+item)\n DP3[c] = max(DP2[c],DP3[c-1],DP2[c-1]+item)\n \nprint(DP3[C])", "import java.io.DataInputStream; \nimport java.io.FileInputStream; \nimport java.io.IOException; \nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Scanner; \nimport java.util.StringTokenizer; \nimport java.io.BufferedReader; \nimport java.util.*;\nimport java.math.BigInteger; \n\n\npublic class Main{\n\tpublic static FastReader fs = new FastReader();\n\tstatic int r,c,k;\n\tstatic long grid [][];\n\tstatic long dp [][][];\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\t\n\tstatic void solve() {\n\t\tStringBuffer output = new StringBuffer();\n\t\tr = fs.nextInt();c = fs.nextInt();k = fs.nextInt();\n\t\tgrid = new long [r][c];\n\t\tdp = new long [r+1][c+1][4];\n\t\tfor(int i = 0; i<k; i++)\n\t\t\tgrid[fs.nextInt()-1][fs.nextInt()-1] = fs.nextLong();\n\t\tdp[0][0][1] = grid[0][0];\n\t\tfor(int i = 1; i<r; i++) {\n\t\t\tdp[i][0][1] = max(new long [] {dp[i-1][0][0],dp[i-1][0][1],dp[i-1][0][2],dp[i-1][0][3]}) + grid[i][0];\n\t\t}\n\t\tfor(int i = 1; i<c; i++) {\n\t\t\tfor(int j = 1; j<4; j++)\n\t\t\t\tdp[0][i][j] = max(dp[0][i][j],max(dp[0][i-1][j-1] + grid[0][i],dp[0][i-1][j]));\n\t\t}\n\t\tfor(int i = 1; i<r; i++) {\n\t\t\tfor(int j = 1; j<c; j++) {\n\t\t\t\tdp[i][j][0] = max(dp[i][j][0],max(new long [] {dp[i-1][j][0],dp[i-1][j][1],dp[i-1][j][2],dp[i-1][j][3]}));\n\t\t\t\tdp[i][j][1] = max(new long [] {dp[i-1][j][0],dp[i-1][j][1],dp[i-1][j][2],dp[i-1][j][3]}) + grid[i][j];\n\t\t\t\tfor(int l = 1; l<4; l++) {\n\t\t\t\t\tdp[i][j][l] = max(dp[i][j][l],max(dp[i][j-1][l],dp[i][j-1][l-1]+grid[i][j]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(max(new long [] {dp[r-1][c-1][0],dp[r-1][c-1][1],dp[r-1][c-1][2],dp[r-1][c-1][3]}));\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tThread t = new Thread(null,null,\"\",1 << 28) {\n\t\t\tpublic void run() {\n\t\t\t\tint test_case = 1;\n\t\t\t\t//test_case = fs.nextInt();\n\t\t\t\tfor(int cs = 1; cs <= test_case; cs++) {\n\t\t\t\t\tsolve();\n\t\t\t\t}\n\t\t\t\tout.close();\n\t\t\t}\n\t\t};\n\t\tt.start();\n\t\ttry {\n\t\t\tt.join();\n\t\t} catch (InterruptedException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\tstatic class FastReader \n { \n BufferedReader br; \n StringTokenizer st; \n \n public FastReader() \n { \n br = new BufferedReader(new\n InputStreamReader(System.in)); \n } \n \n String next() \n { \n while (st == null || !st.hasMoreElements()) \n { \n try\n { \n st = new StringTokenizer(br.readLine()); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n \n int nextInt() \n { \n return Integer.parseInt(next()); \n } \n \n long nextLong() \n { \n return Long.parseLong(next()); \n } \n \n double nextDouble() \n { \n return Double.parseDouble(next()); \n } \n \n String nextLine() \n { \n String str = \"\"; \n try\n { \n str = br.readLine(); \n } \n catch (IOException e) \n { \n e.printStackTrace(); \n } \n return str; \n } \n \n int [] readintarray(int n) {\n \tint res [] = new int [n];\n \tfor(int i = 0; i<n; i++)res[i] = nextInt();\n \treturn res;\n }\n long [] readlongarray(int n) {\n \tlong res [] = new long [n];\n \tfor(int i = 0; i<n; i++)res[i] = nextLong();\n \treturn res;\n }\n } \n\t\n\tstatic int ceil(int x,int y) {\n\t\treturn (x % y == 0 ? x / y : (x / y +1));\n\t}\n\t\n\tstatic long ceil(long x,long y) {\n\t\treturn (x % y == 0 ? x / y : (x / y +1));\n\t}\n\t\n\tstatic int max(int x,int y) {\n\t\treturn Math.max(x, y);\n\t}\n\t\n\tstatic int min(int x,int y) {\n\t\treturn Math.min(x, y);\n\t}\n\t\n\tstatic long max(long x,long y) {\n\t\treturn Math.max(x, y);\n\t}\n\t\n\tstatic long min(long x,long y) {\n\t\treturn Math.min(x, y);\n\t}\n\t\n\tstatic int min(int a []) {\n\t\tint x = 1_000_000_00_9;\n\t\tfor(int i = 0; i<a.length; i++)x = min(x,a[i]);\n\t\treturn x;\n\t}\n\t\n\tstatic int max(int a []) {\n\t\tint x = -1_000_000_00_9;\n\t\tfor(int i = 0; i<a.length; i++)x = max(x,a[i]);\n\t\treturn x;\n\t}\n\t\n\tstatic long min(long a []) {\n\t\tlong x = (long)3e18;\n\t\tfor(int i = 0; i<a.length; i++)x = min(x,a[i]);\n\t\treturn x;\n\t}\n\t\n\tstatic long max(long a []) {\n\t\tlong x = -(long)3e18;\n\t\tfor(int i = 0; i<a.length; i++)x = max(x,a[i]);\n\t\treturn x;\n\t}\n\t\n\tstatic int power(int x,int y) {\n\t\tint res = 1;\n\t\twhile(y > 0) {\n\t\t\tif( y % 2 == 1)res = (res * x);\n\t\t\ty >>= 1;\n x = (x * x);\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tstatic long power(long x,long y) {\n\t\tlong res = 1;\n\t\twhile(y > 0) {\n\t\t\tif( y % 2 == 1)res = (res * x);\n\t\t\ty >>= 1;\n x = (x * x);\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tstatic long power(long x,long y,long mod) {\n\t\tlong res = 1;\n\t\tx %= mod;\n\t\twhile(y > 0) {\n\t\t\tif( y % 2 == 1)res = (res * x) % mod;\n\t\t\ty >>= 1;\n x = (x * x) % mod;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tstatic void intsort(int [] a) {\n\t\tList<Integer> temp = new ArrayList<Integer>();\n\t\tfor(int i = 0; i<a.length; i++)temp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tfor(int i = 0; i<a.length; i++)a[i] = temp.get(i);\n\t}\n\t\n\tstatic void longsort(long [] a) {\n\t\tList<Long> temp = new ArrayList<Long>();\n\t\tfor(int i = 0; i<a.length; i++)temp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tfor(int i = 0; i<a.length; i++)a[i] = temp.get(i);\n\t}\n\t\n\tstatic void reverseintsort(int [] a) {\n\t\tList<Integer> temp = new ArrayList<Integer>();\n\t\tfor(int i = 0; i<a.length; i++)temp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tCollections.reverse(temp);\n\t\tfor(int i = 0; i<a.length; i++)a[i] = temp.get(i);\n\t}\n\t\n\tstatic void reverselongsort(long [] a) {\n\t\tList<Long> temp = new ArrayList<Long>();\n\t\tfor(int i = 0; i<a.length; i++)temp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tCollections.reverse(temp);\n\t\tfor(int i = 0; i<a.length; i++)a[i] = temp.get(i);\n\t}\n\t\n\t\n\tstatic void intervalsort(int a [],int start,int end) {\n\t\tArrayList<Integer> temp = new ArrayList<>();\n\t\tfor(int i = start; i<end; i++)\n\t\t\ttemp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tfor(int i = 0; i<temp.size(); i++)\n\t\t\ta[i+start] = temp.get(i);\n\t}\n\t\n\tstatic void intervalsort(long a [],int start,int end) {\n\t\tArrayList<Long> temp = new ArrayList<>();\n\t\tfor(int i = start; i<end; i++)\n\t\t\ttemp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tfor(int i = 0; i<temp.size(); i++)\n\t\t\ta[i+start] = temp.get(i);\n\t}\n\t\n\tstatic void reverseintervalsort(int a [],int start,int end) {\n\t\tArrayList<Integer> temp = new ArrayList<>();\n\t\tfor(int i = start; i<end; i++)\n\t\t\ttemp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tCollections.reverse(temp);\n\t\tfor(int i = 0; i<temp.size(); i++)\n\t\t\ta[i+start] = temp.get(i);\n\t}\n\t\n\tstatic void reverseintervalsort(long a [],int start,int end) {\n\t\tArrayList<Long> temp = new ArrayList<>();\n\t\tfor(int i = start; i<end; i++)\n\t\t\ttemp.add(a[i]);\n\t\tCollections.sort(temp);\n\t\tCollections.reverse(temp);\n\t\tfor(int i = 0; i<temp.size(); i++)\n\t\t\ta[i+start] = temp.get(i);\n\t}\n\t\n\t\n\tstatic class data{\n\t\tpublic long sum;\n\t\t\n\t\tdata(long val){\n\t\t this.sum = val;\n\t\t}\n\t\t\n\t\tdata(){}\n\t\t\n\t\tdata combine(data l, data r) {\n\t\t data res = new data();\n\t\t res.sum = l.sum + r.sum;\n\t\t return res;\n\t\t}\n\t}\n\t\n\tstatic class Seg_Tree extends data{\n\t\tpublic int n;\n\t\tdata [] seg;\n\t\t\n\t\tSeg_Tree(int sz){\n\t\t\tthis.n = sz;\n\t\t\tseg = new data[4*n+4];\n\t\t}\n\t\t\n\t\tvoid build(long a[], int v, int tl, int tr) {\n\t\t if (tl == tr) {\n\t\t seg[v] = new data(a[tl]);\n\t\t } else {\n\t\t int tm = (tl + tr) / 2;\n\t\t build(a, v*2, tl, tm);\n\t\t build(a, v*2+1, tm+1, tr);\n\t\t seg[v] = combine(seg[v*2],seg[v*2+1]);\n\t\t }\n\t\t}\n\n\t\tvoid update(int v, int tl, int tr, int pos, long new_val) {\n\t\t if (tl == tr) {\n\t\t seg[v] = new data(new_val);\n\t\t } else {\n\t\t int tm = (tl + tr) / 2;\n\t\t if (pos <= tm)\n\t\t update(v*2, tl, tm, pos, new_val);\n\t\t else\n\t\t update(v*2+1, tm+1, tr, pos, new_val);\n\t\t seg[v] = combine(seg[v*2],seg[v*2+1]);\n\t\t }\n\t\t}\n\t\t\n\t\tdata query(int v, int tl, int tr, int l, int r) {\n\t\t if (l > r) \n\t\t return new data(0);\n\t\t if (l == tl && r == tr) \n\t\t return seg[v];\n\t\t int tm = (tl + tr) / 2;\n\t\t return combine(query(v*2, tl, tm, l, min(r, tm)),query(v*2+1, tm+1, tr, max(l, tm+1), r));\n\t\t}\n\t}\n\t\n\tstatic class Bit_Tree{\n\t\tstatic int n;\n\t\tstatic int [] bit;\n\t\t\n\t\tBit_Tree(int sz){\n\t\t\tBit_Tree.n = sz;\n\t\t\tBit_Tree.bit = new int[n+1];\n\t\t}\n\t\t\n\t\tstatic int child(int x) {\n\t\t\treturn x + (x & (-x));\n\t\t}\n\t\t\n\t\tstatic int parent(int x) {\n\t\t\treturn x - (x & (-x));\n\t\t}\n\t\t\n\t\tstatic void build(int [] a) {\n\t\t\tfor(int i = 0; i<a.length; i++) {\n\t\t\t\tint start = i+1;\n\t\t\t\twhile(start <= n) {\n\t\t\t\t\tbit[start] += a[i];\n\t\t\t\t\tstart = child(start);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tstatic void update(int idx,int new_val) {\n\t\t\tidx += 1;\n\t\t\twhile(idx <= n) {\n\t\t\t\tbit[idx] += new_val;\n\t\t\t\tidx = child(idx);\n\t\t\t}\n\t\t}\n\t\t\n\t\tstatic int query(int right) {\n\t\t\tint res = 0;\n\t\t\twhile(right > 0) {\n\t\t\t\tres += bit[right];\n\t\t\t\tright = parent(right);\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\t\n\t\tstatic int query(int left,int right) {\n\t\t\treturn query(right) - query(left-1);\n\t\t}\n\t}\n\t\n\tpublic static int gcd(int a, int b) \n { \n BigInteger b1 = BigInteger.valueOf(a); \n BigInteger b2 = BigInteger.valueOf(b); \n BigInteger gcd = b1.gcd(b2); \n return gcd.intValue(); \n } \n \n public static long gcd(long a, long b) \n { \n BigInteger b1 = BigInteger.valueOf(a); \n BigInteger b2 = BigInteger.valueOf(b); \n BigInteger gcd = b1.gcd(b2); \n return gcd.longValue(); \n } \n}", "def main():\n\n R, C, K = map(int, input().split())\n a = dict()\n for _ in range(K):\n r, c, v = map(int, input().split())\n a[(r-1, c-1)] = v\n\n dp = [[[0]*4 for _ in range(C+1)] for _ in range(2)]\n\n for i in range(R):\n for j in range(C):\n v = max(dp[0][j+1])\n u = 0\n if (i, j) in a: u = a[(i, j)]\n dp[1][j+1][0] = max(dp[1][j+1][0], v)\n dp[1][j+1][1] = max(dp[1][j+1][1], dp[1][j][1], dp[1][j][0] + u, v + u)\n dp[1][j+1][2] = max(dp[1][j+1][2], dp[1][j][2], dp[1][j][1] + u )\n dp[1][j+1][3] = max(dp[1][j+1][3], dp[1][j][3], dp[1][j][2] + u )\n dp[1], dp[0] = dp[0], dp[1]\n\n return max(dp[0][C])\n\nif __name__ == '__main__':\n print(main())", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int maxn = 3000 + 10;\nint r, c, k;\nint v[maxn][maxn];\nll f[4][maxn][maxn];\nint main()\n{\n\tscanf(\"%d%d%d\", &r, &c, &k);\n\twhile(k--)\n\t{\n\t\tint x, y, val;\n\t\tscanf(\"%d%d%d\", &x, &y, &val);\n\t\tv[x][y] = val;\n\t}\n\tfor(int i = 1; i <= r; ++i)\n\t\tfor(int j = 1; j <= c; ++j)\n\t\t\tfor(int p = 3; ~p; --p)\n\t\t\t{\n\t\t\t\tif(i > 1) f[p][i][j] = max(f[p][i][j], f[3][i - 1][j]);\n\t\t\t\tif(j > 1) f[p][i][j] = max(f[p][i][j], f[p][i][j - 1]);\n\t\t\t\tif(p < 3) f[p + 1][i][j] = max(f[p + 1][i][j], f[p][i][j] + v[i][j]);\n\t\t\t}\n\tprintf(\"%lld\\n\", f[3][r][c]);\n\treturn 0;\n}", "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n R, C, K, *RCV = map(int, read().split())\n\n item = [[0] * C for _ in range(R)]\n for r, c, v in zip(*[iter(RCV)] * 3):\n item[r - 1][c - 1] = v\n\n dp = [0] * (C + 1)\n for i in range(R):\n dp, dp_prev = [0] * (C + 1), dp\n v = [0] * 4\n for j in range(C):\n for k in range(4):\n if v[k] < dp_prev[j + 1]:\n v[k] = dp_prev[j + 1]\n if item[i][j] > 0:\n for k in range(2, -1, -1):\n if v[k + 1] < v[k] + item[i][j]:\n v[k + 1] = v[k] + item[i][j]\n dp[j + 1] = v[3]\n\n print(dp[C])\n\n return\n\n\nif __name__ == '__main__':\n main()\n", "import java.io.*;\n\nimport java.io.*;\nimport java.util.*;\nimport java.util.PriorityQueue;\n\npublic class Main {\npublic static long gcd(long n, long m){ if(m > n) return gcd(m,n); if(m == 0) return n; return gcd(m, n%m);}\npublic static long lcm(long m, long n){ return (m/gcd(m,n))*n;}\nstatic int mod = 998244353;\nstatic int INF = Integer.MAX_VALUE;\nstatic int[] dx = {0,0,1,-1};\nstatic int[] dy = {1,-1,0,0};\nstatic int[] dx8 = {0,0,1,-1,1,1,-1,-1};\nstatic int[] dy8 = {1,-1,0,0,1,-1,-1,1};\npublic static void main(String[] args){\nFastScanner scanner = new FastScanner();\nint R = scanner.nextInt();\nint C = scanner.nextInt();\nint K = scanner.nextInt();\nint[] r = new int[K];\nint[] c = new int[K];\nint[] v = new int[K];\nMap<Integer,Integer> map = new HashMap<Integer,Integer>();\nfor(int i = 0; i < K; i++){\nr[i] = scanner.nextInt()-1;\nc[i] = scanner.nextInt()-1;\nv[i] = scanner.nextInt();\nmap.put(C*r[i]+c[i],v[i]);\n}\n//dp[i][j][k]:=(i,j)にたどり着いた時、\n//i行目のアイテムをk個拾った時の価値の合計の最大値\nlong[][][] dp = new long[3001][3001][4];\nif(map.containsKey(0)){\ndp[0][0][1] = map.get(0);\n}\nfor(int i = 0; i <= R; i++){\nfor(int j = 0; j <= C; j++){\nif(map.containsKey(C*i+j)){\n//上からくる時\nif(i-1 >= 0){\nfor(int k = 0; k < 4; k++){\nif(i-1 >= 0){\ndp[i][j][0] = Math.max(dp[i][j][0],dp[i-1][j][k]);\ndp[i][j][1] = Math.max(dp[i][j][1],dp[i-1][j][k]+map.get(C*i+j));\n}\n}\n}\n//左からくる時\nif(j-1 >= 0){\ndp[i][j][0] = Math.max(dp[i][j][0],dp[i][j-1][0]);\ndp[i][j][1] = Math.max(dp[i][j][1],dp[i][j-1][1]);\ndp[i][j][2] = Math.max(dp[i][j][2],dp[i][j-1][2]);\ndp[i][j][3] = Math.max(dp[i][j][3],dp[i][j-1][3]);\ndp[i][j][1] = Math.max(dp[i][j][1],dp[i][j-1][0]+map.get(C*i+j));\ndp[i][j][2] = Math.max(dp[i][j][2],dp[i][j-1][1]+map.get(C*i+j));\ndp[i][j][3] = Math.max(dp[i][j][3],dp[i][j-1][2]+map.get(C*i+j));\n}\n}else{\n//上からくる時\nif(i-1 >= 0){\nfor(int k = 0; k < 4; k++){\nif(i-1 >= 0){\ndp[i][j][0] = Math.max(dp[i][j][0],dp[i-1][j][k]);\n}\n}\n}\n//左からくる時\nif(j-1 >= 0){\ndp[i][j][0] = Math.max(dp[i][j][0],dp[i][j-1][0]);\ndp[i][j][1] = Math.max(dp[i][j][1],dp[i][j-1][1]);\ndp[i][j][2] = Math.max(dp[i][j][2],dp[i][j-1][2]);\ndp[i][j][3] = Math.max(dp[i][j][3],dp[i][j-1][3]);\n}\n}\n}\n}\nlong max = 0;\nfor(int k = 0; k < 4; k++){\n//System.out.println(dp[R-1][C-1][k]);\nmax = Math.max(max,dp[R-1][C-1][k]);\n}\nSystem.out.println(max);\n}\npublic static final int lowerBound(final int[] arr, final int value) {\nint low = 0;\nint high = arr.length;\nint mid;\nwhile (low < high){\nmid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\nif (arr[mid] < value) {\nlow = mid + 1;\n} else {\nhigh = mid;\n}\n}\nreturn low;\n}\npublic static int upperBound(int[] array, int value) {\nint low = 0;\nint high = array.length;\nint mid;\nwhile( low < high ) {\nmid = ((high - low) >>> 1) + low; // (high + low) / 2\nif( array[mid] <= value ) {\nlow = mid + 1;\n} else {\nhigh = mid;\n}\n}\nreturn low;\n}\npublic static boolean isPrime(int n){\nif(n == 1) return false;\nif(n == 2 || n == 3) return true;\nfor(int i = 2; i <= Math.sqrt(n); i++){\nif(n % i == 0) return false;\n}\nreturn true;\n}\npublic static char i2c(int i){\nif(0 <= i && i < 26){\nreturn (char)(i + 'a');\n}else{\nreturn (char)(i + 'A' - 26);\n}\n}\nstatic class Point{\nint x; int y;\nPoint(int x, int y){\nthis.x = x;\nthis.y = y;\n}\n}\nstatic class Edge{\nint to;\nEdge(int to){\nthis.to = to;\n}\n}\nstatic class Edge2 implements Comparable<Edge2>{\nint from;\nint to;\nint cost;\nEdge2(int from, int to, int cost){\nthis.from = from;\nthis.to = to;\nthis.cost = cost;\n}\npublic int compareTo(Edge2 e){\nreturn cost-e.cost;\n}\n}\n\nstatic class RMQ {\nprivate int size_, dat[];\nprivate int query_(int a, int b, int k, int l, int r) {\nif(r <= a || b <= l) return 2147483647;\nif(a <= l && r <= b) return dat[k];\nint lc = query_(a, b, 2 * k, l, (l + r) / 2);\nint rc = query_(a, b, 2 * k + 1, (l + r) / 2, r);\nreturn Math.min(lc, rc);\n}\nRMQ(int s) {\nfor(size_ = 1; size_ < s;) size_ *= 2;\ndat = new int[size_ * 2];\nfor(int i = 0; i < size_ * 2; i++) dat[i] = 2147483647;\n}\npublic void update(int pos, int x) {\npos += size_; dat[pos] = x;\nwhile(pos > 1) {\npos /= 2;\ndat[pos] = Math.min(dat[2 * pos], dat[2 * pos + 1]);\n}\n}\npublic int query(int l, int r) {\nreturn query_(l, r, 1, 0, size_);\n}\n}\nstatic int size = 2100000;\nstatic long[] fac = new long[size];\nstatic long[] finv = new long[size];\nstatic long[] inv = new long[size];\n//繰り返し二乗法\npublic static long pow(long x, long n){\nlong ans = 1;\nwhile(n > 0){\nif((n & 1) == 1){\nans = ans * x;\nans %= mod;\n}\nx = x * x % mod;\nn >>= 1;\n}\nreturn ans;\n}\npublic static long div(long x, long y){\nreturn (x*pow(y, mod-2))%mod;\n}\n//fac, inv, finvテーブルの初期化、これ使う場合はinitComb()で初期化必要\npublic static void initComb(){\nfac[0] = finv[0] = inv[0] = fac[1] = finv[1] = inv[1] = 1;\nfor (int i = 2; i < size; ++i) {\nfac[i] = fac[i - 1] * i % mod;\ninv[i] = mod - (mod / i) * inv[(int) (mod % i)] % mod;\nfinv[i] = finv[i - 1] * inv[i] % mod;\n}\n}\n//nCk % mod\npublic static long comb(int n, int k){\nreturn fac[n] * finv[k] % mod * finv[n - k] % mod;\n}\n//n! % mod\npublic static long fact(int n){\nreturn fac[n];\n}\n//(n!)^-1 with % mod\npublic static long finv(int n){\nreturn finv[n];\n}\nprivate static class FastScanner {\nprivate final InputStream in = System.in;\nprivate final byte[] buffer = new byte[1024];\nprivate int ptr = 0;\nprivate int buflen = 0;\nprivate boolean hasNextByte() {\nif (ptr < buflen) {\nreturn true;\n}else{\nptr = 0;\ntry {\nbuflen = in.read(buffer);\n} catch (IOException e) {\ne.printStackTrace();\n}\nif (buflen <= 0) {\nreturn false;\n}\n}\nreturn true;\n}\nprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\nprivate static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\npublic boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\npublic String next() {\nif (!hasNext()) throw new NoSuchElementException();\nStringBuilder sb = new StringBuilder();\nint b = readByte();\nwhile(isPrintableChar(b)) {\nsb.appendCodePoint(b);\nb = readByte();\n}\nreturn sb.toString();\n}\npublic long nextLong() {\nif (!hasNext()) throw new NoSuchElementException();\nlong n = 0;\nboolean minus = false;\nint b = readByte();\nif (b == '-') {\nminus = true;\nb = readByte();\n}\nif (b < '0' || '9' < b) {\nthrow new NumberFormatException();\n}\nwhile(true){\nif ('0' <= b && b <= '9') {\nn *= 10;\nn += b - '0';\n}else if(b == -1 || !isPrintableChar(b)){\nreturn minus ? -n : n;\n}else{\nthrow new NumberFormatException();\n}\nb = readByte();\n}\n}\npublic int nextInt() {\nlong nl = nextLong();\nif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\nreturn (int) nl;\n}\npublic double nextDouble() { return Double.parseDouble(next());}\n}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nll dp[3001][3001][4], a[3001][3001];\n\nint main() {\n ll r,c,items, x , y, v, maxi = 0;\n cin >> r >> c >> items;\n while(items--) {\n \tcin >> x >> y >> v;\n \ta[x-1][y-1]=v;\n }\n for(int i=0;i<r;i++) for(int j=0;j<c;j++) {\n for(int k=2;k>=0;k--) {\n dp[i][j][k+1]=max(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n }\n for(int k=0;k<4;k++) {\n if(j+1!=c) dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n if(i+1!=r) dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n }\n }\n for(int k=0;k<4;k++) maxi=max(maxi,dp[r-1][c-1][k]);\n cout << maxi;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nll dp[3001][3001][3], a[3001][3001];\nint vis[3001][3001][3];\n\nll func(int r, int c, int cnt) {\n if(r < 0 || c < 0 || cnt < 0) return 0;\n if(vis[r][c][cnt]) return dp[r][c][cnt];\n vis[r][c][cnt] = 1;\n return dp[r][c][cnt] = max({func(r-1, c, 2) + a[r][c], func(r, c-1, cnt), func(r, c-1, cnt-1) + a[r][c]});\n}\n\nint main() {\n ll r,c,items, x , y, v, maxi = 0;\n cin >> r >> c >> items;\n while(items--) {\n \tcin >> x >> y >> v;\n \ta[x-1][y-1]=v;\n }\n maxi = func(r-1, c-1, 2);\n cout << maxi;\n\treturn 0;\n}", "#include<bits/stdc++.h>\n#define debug printf(\"%d %s\\n\",__LINE__,__FUNCTION__)\ntypedef long long ll;\ntypedef std::pair<int,int> pii;\n#define pb push_back\n#define mk make_pair\n#define fi first\n#define se second\n\nint _w;FILE* _f;\n\nusing namespace std;\n\nconst int N=3001;\n\nint R,C,K,val[N][N];\n\nll f[N][N][4],ans;\n\nint main(){\n scanf(\"%d%d%d\",&R,&C,&K);\n for(int i=1,u,v,w;i<=K;i++){\n scanf(\"%d%d%d\",&u,&v,&w);\n val[u][v]=w;\n }\n for(int i=1;i<=R;i++){\n for(int j=1;j<=C;j++){\n for(int k=1;k<=3;k++){\n f[i][j][k]=max(max(f[i-1][j][3],f[i][j-1][k-1])+val[i][j],f[i][j-1][k]);\n ans=max(ans,f[i][j][k]);\n }\n }\n }\n printf(\"%lld\\n\",ans);\n return 0;\n}", "# -*- coding: utf-8 -*-\nimport sys\nfrom collections import defaultdict\nR,C,K=map(int, sys.stdin.readline().split())\n\nvalue=defaultdict(lambda: 0)\nvalue=[ [0 for _ in range(C+1)] for __ in range(R+1) ]\nfor _ in range(K):\n r,c,v=map(int, sys.stdin.readline().split())\n value[r][c]=v\n\ndp0=[0]*(C+1)\ndp1=[0]*(C+1)\ndp2=[0]*(C+1)\ndp3=[0]*(C+1)\n\nfor r in range(1,R+1):\n for c in range(1,C+1):\n #今のマスにアイテムがある場合\n if 0<value[r][c]:\n dp3[c]=max( dp3[c-1], dp2[c-1]+value[r][c] )\n dp2[c]=max( dp2[c-1], dp1[c-1]+value[r][c] )\n dp1[c]=max( dp1[c-1], dp0[c-1]+value[r][c], dp0[c]+value[r][c] )\n dp0[c]=max( dp0[c-1], dp0[c] )\n #今のマスにアイテムがない場合\n else:\n #dp0[c]=max( dp0[c-1], dp0[c] )\n #dp1[c]=max( dp1[c-1], dp1[c] )\n #dp2[c]=max( dp2[c-1], dp2[c] )\n #dp3[c]=max( dp3[c-1], dp3[c] )\n dp0[c]=max( dp0[c-1], dp0[c] )\n dp1[c]=dp1[c-1]\n dp2[c]=dp2[c-1]\n dp3[c]=dp3[c-1]\n\n #上の行にアイテムをコピー\n for c in range(1,C+1):\n dp0[c]=max( dp0[c], dp1[c], dp2[c], dp3[c] )\n dp1=[0]*(C+1)\n dp2=[0]*(C+1)\n dp3=[0]*(C+1)\n\nprint dp0[C]\n", "// template for atcode\nimport java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport java.util.stream.Collectors;\n\npublic class Main {\n\n private static final int MOD = (int)1e9 + 7; //998244353;\n // private static final long INF = (long)1e17;\n private static final int INF = (int)1e9;\n\n public Main(FastScanner in, PrintWriter out) {\n int R = in.nextInt();\n int C = in.nextInt();\n int K = in.nextInt();\n int[][] A = new int[R + 1][C + 1];\n for (int i = 0; i < K; i++) {\n int r = in.nextInt();\n int c = in.nextInt();\n A[r][c] = in.nextInt();\n }\n long[][][] dp = new long[R + 1][C + 1][4];\n for (int i = 1; i <= R; i++) {\n for (int j = 1; j <= C; j++) {\n for (int k = 0; k <= 3; k++) {\n dp[i][j][0] = max(dp[i][j][0], dp[i-1][j][k]);\n dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k]);\n }\n // if (A[i][j] > 0) {\n for (int k = 3; k > 0; k--) {\n dp[i][j][k] = max(dp[i][j][k], dp[i][j][k-1] + A[i][j]);\n }\n // }\n }\n }\n long res = 0;\n for (long x : dp[R][C]) res = max(res, x);\n out.println(res);\n }\n\n private int gcd(int a, int b) {\n while (true) {\n if (b == 0) return a;\n int tmp = a;\n a = b;\n b = tmp % b;\n }\n }\n\n private long gcd(long a, long b) {\n while (true) {\n if (b == 0) return a;\n long tmp = a;\n a = b;\n b = tmp % b;\n }\n }\n\n private long powm(long x, long p) {\n long res = 1;\n while (p > 0) {\n if (p % 2 == 1)\n res = res * x % MOD;\n x = x * x % MOD;\n p /= 2;\n }\n return res;\n }\n\n public static void main(String[] args) {\n PrintWriter out = new PrintWriter(System.out);\n // Scanner in = new Scanner(\n // new BufferedReader(new InputStreamReader(System.in)));\n FastScanner in = new FastScanner(System.in);\n\n Main sol = new Main(in, out);\n out.close();\n }\n}\n\n// Pair\nclass Pair<T extends Comparable<? super T>, U extends Comparable<? super U>> implements Comparable<Pair<T, U>> {\n T a;\n U b;\n Pair() { }\n Pair(T a, U b) {\n this.a = a;\n this.b = b;\n }\n\n @Override\n public String toString() { return \"(\"+a.toString()+\", \"+b.toString()+\")\"; }\n\n @Override\n public int hashCode() { return Objects.hash(a, b); }\n\n @Override\n public boolean equals(Object obj) {\n if(this == obj) return true;\n if(obj == null) return false;\n if(this.getClass() != obj.getClass()) return false;\n Pair that = (Pair) obj;\n if(this.a.getClass() != that.a.getClass()) return false;\n if(this.b.getClass() != that.b.getClass()) return false;\n if(!this.a.equals(that.a)) return false;\n if(!this.b.equals(that.b)) return false;\n return true;\n }\n\n @Override\n public int compareTo(Pair<T, U> that) {\n int c = (this.a).compareTo(that.a);\n if(c == 0) c = (this.b).compareTo(that.b);\n return c;\n }\n}\n\n\nclass FastScanner{\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream)\n {\n this.stream = stream;\n }\n\n int read()\n {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars){\n curChar = 0;\n try{\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c)\n {\n return c==' '||c=='\\n'||c=='\\r'||c=='\\t'||c==-1;\n }\n\n boolean isEndline(int c)\n {\n return c=='\\n'||c=='\\r'||c==-1;\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String next(){\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do{\n res.appendCodePoint(c);\n c = read();\n }while(!isSpaceChar(c));\n return res.toString();\n }\n\n String nextLine(){\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do{\n res.appendCodePoint(c);\n c = read();\n }while(!isEndline(c));\n return res.toString();\n }\n}\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n\tstatic final long MOD=1000000007;//998244353;\n\tpublic static void main(String[] args) {\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tInputReader sc=new InputReader(System.in);\n\t\tint R=sc.nextInt();\n\t\tint C=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tHashMap<Integer, Long> hashMap=new HashMap<>();\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint r=sc.nextInt()-1;\n\t\t\tint c=sc.nextInt()-1;\n\t\t\tlong w=sc.nextLong();\n\t\t\thashMap.put(kumi(r, c, C), w);\n\t\t}\n\t\tlong[][][] dp=new long[R+1][C+1][4];\n\t\tfor (int i = 1; i <= R; i++) {\n\t\t\tfor (int j = 1; j <= C; j++) {\n\t\t\t\tfor (int j2 = 0; j2 < 4; j2++) {\n\t\t\t\t\tdp[i][j][0]=Math.max(dp[i][j][0], dp[i-1][j][j2]);\n\t\t\t\t\tdp[i][j][j2]=Math.max(dp[i][j][j2], dp[i][j-1][j2]);\n\t\t\t\t}\n\t\t\t\tif (hashMap.containsKey(kumi(i-1, j-1, C))) {\n\t\t\t\t\tlong w=hashMap.get(kumi(i-1, j-1, C));\n\t\t\t\t\tfor (int j2 = 1; j2 < 4; j2++) {\n\t\t\t\t\t\tdp[i][j][j2]=Math.max(dp[i][j][j2], dp[i][j-1][j2-1]+w);\n\t\t\t\t\t}\n\t\t\t\t\tfor (int j2 = 0; j2 < 4; j2++) {\n\t\t\t\t\t\tdp[i][j][1]=Math.max(dp[i][j][1], dp[i-1][j][j2]+w);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans=0;\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tans=Math.max(ans, dp[R][C][i]);\n\t\t}\n\t\tSystem.out.println(ans);\n \t}\n\tstatic int kumi(int i, int j, int W){\n return i*W+j;//W列の２次配列を一次元にする\n }\n\tstatic class InputReader { \n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n \n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n \n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n \n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n \n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n \n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n \n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define all(V) V.begin(),V.end()\nconst ll MOD = 1000000007;\n\nll M[3010][3010];\nll A[3010][3010][4];\n\nint main() {\n\tint R, C, K;\n\tcin >> R >> C >> K;\n\tint r, c, v;\n\tfor (int i = 0;i <= R;i++) {\n\t\tfor (int j = 0;j <= C;j++) {\n\t\t\tM[i][j] = 0;\n\t\t}\n\t}\n\tfor (int i = 0;i < K;i++) {\n\t\tcin >> r >> c >> v;\n\t\tM[r][c] = v;\n\t}\n\n\tfor (int i = 1;i <= R;i++) {\n\t\tfor (int j = 1;j <= C;j++) {\n\t\t\tA[i][j][0] = max(A[i - 1][j][3], A[i][j - 1][0]);\n\t\t\tA[i][j][1] = max(A[i][j][0] + M[i][j], A[i][j - 1][1]);\n\t\t\tA[i][j][2] = max({ A[i][j][1],A[i][j - 1][1] + M[i][j], A[i][j - 1][2] });\n\t\t\tA[i][j][3] = max({ A[i][j][2],A[i][j - 1][2] + M[i][j], A[i][j - 1][3] });\n\t\t}\n\t}\n\tcout << A[R][C][3] << endl;\n}", "# -*- coding: utf-8 -*-\nimport sys\nsys.setrecursionlimit(10**9)\nINF=10**18\nMOD=10**9+7\ninput=lambda: sys.stdin.readline().rstrip()\nYesNo=lambda b: bool([print('Yes')] if b else print('No'))\nYESNO=lambda b: bool([print('YES')] if b else print('NO'))\nint1=lambda x:int(x)-1\n\nR,C,K=map(int,input().split())\nV=[[0]*C for _ in range(R)]\nfor i in range(K):\n r,c,v=map(int,input().split())\n r-=1\n c-=1\n V[r][c]=v\ndp=[[0]*4 for _ in range(C)]\nprev_dp=[[0]*4 for _ in range(C)]\nfor y in range(R):\n for x in range(C):\n for i in range(2,-1,-1):\n dp[x][i+1]=max(dp[x][i+1],dp[x][i]+V[y][x])\n if x<C-1:\n for i in range(3,-1,-1):\n dp[x+1][i]=max(dp[x+1][i],dp[x][i])\n if y+1<R:\n prev_dp=dp\n dp=[[0]*4 for _ in range(C)]\n for x in range(C):\n dp[x][0]=max(prev_dp[x])\nprint(max(dp[-1]))", "#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nll v[3005][3005];\nll dp[3005][3005][4];\n\nint main()\n{\n int r, c, k;\n cin >> r >> c >> k;\n for(int i = 0; i < k; i++){\n int a, b;\n ll w;\n cin >> a >> b >> w;\n a--; b--;\n v[a][b] = w;\n }\n for(int i = 1; i <= r; i++){\n for(int j = 1; j <= c; j++){\n dp[i][j][0] = max(dp[i][j - 1][0], dp[i - 1][j][3]);\n dp[i][j][1] = max(dp[i][j][0] + v[i - 1][j - 1], dp[i][j - 1][1]);\n dp[i][j][2] = max(max(dp[i][j - 1][1] + v[i - 1][j - 1], dp[i][j - 1][2]), dp[i][j][1]);\n dp[i][j][3] = max(max(dp[i][j - 1][2] + v[i - 1][j - 1], dp[i][j - 1][3]), dp[i][j][2]);\n }\n }\n cout << dp[r][c][3] << endl;\n}\n", "import sys\ninput = sys.stdin.readline\n\nR,C,K=map(int,input().split())\nJ=[tuple(map(int,input().split())) for i in range(K)]\n\n#DP0=[[0]*(C+2) for i in range(R+2)]\nDP1=[[0]*(C+2) for i in range(R+2)]\nDP2=[[0]*(C+2) for i in range(R+2)]\nDP3=[[0]*(C+2) for i in range(R+2)]\n\nMAP=[[0]*C for i in range(R)]\n\nfor x,y,v in J:\n MAP[x-1][y-1]=v\n\nfor i in range(R):\n for j in range(C):\n DP1[i][j]=max(DP1[i][j-1],DP1[i-1][j]+MAP[i][j],DP2[i-1][j]+MAP[i][j],DP3[i-1][j]+MAP[i][j])\n DP2[i][j]=max(DP2[i][j-1],DP1[i][j-1]+MAP[i][j])\n DP3[i][j]=max(DP3[i][j-1],DP2[i][j-1]+MAP[i][j])\n\nANS=0\nfor i in range(R):\n for j in range(C):\n ANS=max(ANS,DP1[i][j],DP2[i][j],DP3[i][j])\nprint(ANS)\n\n", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define chmax(x,y) x = max(x,y);\nconst int di[] = {-1, 0, 1, 0};\nconst int dj[] = {0, -1, 0, 1};\nconst int INF = 1001001001;\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n int R, C, K;\n cin >> R >> C >> K;\n rep(i,K) {\n int r, c, v;\n cin >> r >> c >> v;\n a[r-1][c-1] = v;\n }\n\n rep(i,R)rep(j,C) {\n for (int k = 2; k >= 0; k--) {\n chmax(dp[i][j][k+1], dp[i][j][k] + a[i][j]);\n } \n rep(k,4) {\n chmax(dp[i][j+1][k], dp[i][j][k]);\n chmax(dp[i+1][j][0], dp[i][j][k]);\n }\n }\n ll ans = 0;\n rep(k,4) chmax(ans, dp[R-1][C-1][k]);\n cout << ans << endl;\n return 0;\n}", "h,w,k = map(int, input().split())\nitem = [[0 for _ in range(w)] for _ in range(h)]\nfor i in range(k):\n y,x,v = list(map(int,input().split()))\n item[y-1][x-1]=v\n\ndp = [[[0 for _ in range(w+1)] for _ in range(h+1)] for _ in range(4)]\n\nfor y in range(h):\n for x in range(w):\n for i in range(4):\n dp[0][y+1][x]=max(dp[0][y+1][x],dp[i][y][x])\n dp[i][y][x+1]=max(dp[i][y][x+1],dp[i][y][x])\n if item[y][x]>0:\n for i in range(3):\n dp[0][y+1][x] =max(dp[0][y+1][x], dp[i][y][x]+item[y][x])\n dp[i+1][y][x+1]=max(dp[i+1][y][x+1],dp[i][y][x]+item[y][x])\nans=dp[0][-1][-2]\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\n\nusing LL = long long;\n\nint main() {\n int R, C, K;\n cin >> R >> C >> K;\n\n vector<vector<LL>> V(R+2, vector<LL>(C+2));\n for(auto i=0; i<K; ++i) {\n int r, c, v;\n cin >> r >> c >> v;\n V[r][c] = v;\n }\n\n vector<vector<vector<LL>>> dp(R+3, vector<vector<LL>>(C+3, vector<LL>(5)));\n dp[1][1][1] = V[1][1];\n for(auto i=1; i<=R; ++i) for(auto j=1; j<=C; ++j) for(auto k=0; k<4; ++k) {\n dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][k]);\n dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k]);\n dp[i+1][j][1] = max(dp[i+1][j][1], dp[i][j][k] + V[i+1][j]);\n dp[i][j+1][k+1] = max(dp[i][j+1][k+1], dp[i][j][k] + V[i][j+1]);\n }\n cout << max({dp[R][C][0], dp[R][C][1], dp[R][C][2], dp[R][C][3]}) << endl;\n}\n", "H, W, k = map(int, input().split())\n\"\"\"\ndp[k][i][j]\ni行目、j番目まで来た時に、k個アイテムをとったときの価値の最大値\n\"\"\"\nfs = [[0]*(W+1) for i in range(H+1)]\ndp = [[[-1]*(W+1) for i in range(H+1)] for j in range(4)]\n\n# 価値を受け取る\nfor i in range(k):\n h, w, v = map(int, input().split())\n fs[h-1][w-1] += v\n\n# initialize\ndp[0][0][0] = 0\ndp[1][0][0] = fs[0][0]\n\nfor h in range(H):\n for w in range(W):\n for i in range(4):\n if i == 0:\n dp[i][h][w+1] = max(dp[0][h][w], dp[0][h][w+1])\n else:\n dp[i][h][w+1] = max(dp[i][h][w], dp[i][h][w+1], dp[i-1][h][w]+fs[h][w+1])\n for w in range(W):\n dp[0][h+1][w] = max(dp[0][h][w],dp[1][h][w],dp[2][h][w],dp[3][h][w],0)\n dp[1][h+1][w] = dp[0][h+1][w] + fs[h+1][w]\n\nmx = 0\nfor i in range(4):\n mx = max(dp[i][H-1][W-1],mx)\nprint(mx)", "import sys\ninput = sys.stdin.buffer.readline\nH, W, K = map(int, input().split())\nB = {}\nfor _ in range(K):\n r, c, v = map(int, input().split())\n B[(r, c)] = v\n\ndp = [[0]*4 for _ in range(W+1)]\n\nfor i in range(1, H+1):\n for j in range(1, W+1):\n if (i, j) in B:\n v = B[(i, j)]\n dp[j][0] = max(dp[j-1][0], dp[j][0], dp[j][1], dp[j][2], dp[j][3])\n dp[j][1] = max(dp[j-1][1], dp[j][0]+v)\n dp[j][2] = max(dp[j-1][2], dp[j-1][1]+v)\n dp[j][3] = max(dp[j-1][3], dp[j-1][2]+v)\n else:\n dp[j][0] = max(dp[j-1][0], dp[j][0], dp[j][1], dp[j][2], dp[j][3])\n dp[j][1] = dp[j-1][1]\n dp[j][2] = dp[j-1][2]\n dp[j][3] = dp[j-1][3]\n\nprint(max(dp[-1]))\n", "f=lambda:map(int,input().split())\nR,C,K=f()\ng=[[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r,c,v=f()\n g[r][c]=v\ndp=[[[0]*(C+2) for _ in range(R+2)] for _ in range(4)]\nfor i in range(1,R+1):\n for j in range(1,C+1):\n for k in range(3,-1,-1):\n if k: dp[k][i][j]=max(dp[k][i][j],dp[k-1][i][j]+g[i][j])\n dp[0][i+1][j]=max(dp[0][i+1][j],dp[k][i][j])\n dp[k][i][j+1]=max(dp[k][i][j+1],dp[k][i][j])\nprint(max(dp[i][R][C] for i in range(4)))", "R,C,K=map(int,input().split())\npoint=[[0]*C for _ in range(R)]\nfor _ in range(K):\n r,c,v=map(int,input().split())\n point[r-1][c-1]=v\n\ndp=[[[0]*C for _ in range(R)] for _ in range(4)]\ndp[1][0][0]=point[0][0]\nfor i in range(R):\n for j in range(C-1):\n for k in range(4):\n dp[k][i][j+1]=max(dp[k][i][j+1],dp[k][i][j])\n if k!=0:\n dp[k][i][j+1]=max(dp[k][i][j+1],dp[k-1][i][j]+point[i][j+1])\n if i==R-1:\n break\n for j in range(C):\n mx=0\n for k in range(4):\n mx=max(dp[k][i][j],mx)\n dp[0][i+1][j]=mx\n dp[1][i+1][j]=mx+point[i+1][j]\nans=0\nfor i in range(4):\n ans=max(ans,dp[i][R-1][C-1])\nprint(ans)", "R, C, K = map(int, input().split())\n\nitems = [[0] * C for _ in range(R)]\nfor i in range(K):\n r, c, v = map(int, input().split())\n items[r-1][c-1] = v\n\ndp = [[0] * 4 for _ in range(C)]\n\nfor i in range(R):\n dp2 = [[0] * 4 for _ in range(C)]\n for j in range(C):\n if j != 0:\n dp2[j] = dp2[j-1][:]\n\n dp2[j][0] = max(dp2[j][0], max(dp[j]))\n\n for k in range(3, 0, -1):\n dp2[j][k] = max(dp2[j][k], dp2[j][k-1] + items[i][j])\n\n dp = dp2\n\nprint(max(dp[-1]))\n", "#include<bits/stdc++.h>\n#define ll long long\nusing namespace std;\nll val[3003][3003], mem[3003][3003][5], n, m;\nll dp(int r, int c, int cnt)\n{\n if(r>n || c>m || cnt>3)return -100000000000000000;\n if(r==n && c== m)return (cnt<3)*val[n][m];\n if(mem[r][c][cnt]!=-1)return mem[r][c][cnt];\n return mem[r][c][cnt]= max(max((cnt<3)*val[r][c]+dp(r+1, c, 0), dp(r, c+1, cnt)), val[r][c]+dp(r, c+1, cnt+1));\n}\nint main()\n{\n ll k;\n scanf(\"%lld %lld %lld\", &n, &m, &k);\n while(k--)\n {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n val[x][y]= z;\n }\n memset(mem, -1, sizeof mem);\n printf(\"%lld\\n\", dp(1, 1, 0));\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint n,m,v[3003][3003],K;\nll dp[3003][3003][4];\nint main(){\n\tcin>>n>>m>>K;\n\tfor(int i=1;i<=K;i++){\n\t\tint r,c,V;cin>>r>>c>>V;\n\t\tv[r][c]=V; \n\t}\n\tdp[1][1][0]=0;if(v[1][1]>0)dp[1][1][1]=v[1][1];\n\tfor(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(i>1||j>1){\n\t\tif(j>1){\n\t\t\tfor(int k=0;k<4;k++)dp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k]);\n\t\t\tif(v[i][j]>0)for(int k=0;k<3;k++)dp[i][j][k+1]=max(dp[i][j][k+1],dp[i][j-1][k]+v[i][j]);\n\t\t}\n\t\tif(i>1){\n\t\t\tfor(int k=0;k<4;k++)dp[i][j][0]=max(dp[i][j][0],dp[i-1][j][k]);\n\t\t\tif(v[i][j]>0)for(int k=0;k<4;k++)dp[i][j][1]=max(dp[i][j][1],dp[i-1][j][k]+v[i][j]);\n\t\t}\n\t}\n\tll ans=0;\n\tfor(int i=0;i<4;i++)ans=max(ans,dp[n][m][i]);\n\tcout<<ans;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint R, C, K;\nint val[3000][3000];\nll memo[3000][3000][4];\nbool visited[3000][3000][4];\nll f(int x, int y, int z) {\n\tif (x >= R || y >= C) return 0;\n\tif (visited[x][y][z]) return memo[x][y][z];\n\tvisited[x][y][z] = true;\n\tauto r = f(x+1, y, 0) + (z < 3 ? val[x][y] : 0);\n\tif (z < 3 && val[x][y]) r = max(r, f(x, y+1, z+1) + val[x][y]);\n\tr = max(r, f(x, y+1, z));\n\treturn memo[x][y][z] = r;\n}\nint main() {\n\tcin >> R >> C >> K;\n\tfor (int i = 0; i < K; ++ i) {\n\t\tint r, c, v;\n\t\tcin >> r >> c >> v;\n\t\t-- r; -- c;\n\t\tval[r][c] = v;\n\t}\n\tcout << f(0, 0, 0) << endl;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, m, k;\nlong long x[3005][3005], dp[3005][3005][4], ans;\n\nint main() {\n\tscanf(\"%d%d%d\", &n, &m, &k);\n\twhile (k--) {\n\t\tint ta, tb;\n\t\tlong long tc;\n\t\tscanf(\"%d%d%lld\", &ta, &tb, &tc);\n\t\tx[ta][tb] += tc;\n\t}\n\tfor (int i = 1; i <= n; i++)\n\t\tfor (int j = 1; j <= m; j++) {\n\t\t\tfor (int ii = 0; ii <= 3; ii++) {\n\t\t\t\tdp[i][j][ii] = max(dp[i][j - 1][ii], dp[i - 1][j][3]);\n\t\t\t\tif (ii)\n\t\t\t\t\tdp[i][j][ii] = max(dp[i][j][ii], max(dp[i][j - 1][ii - 1], dp[i - 1][j][3]) + x[i][j]);\n\t\t\t}\n\t\t}\n\tprintf(\"%lld\\n\", dp[n][m][3]);\n}", "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nWhat do you think? What do you think?\n1st on Billboard, what do you think of it\nNext is a Grammy, what do you think of it\nHowever you think, I’m sorry, but shit, I have no fcking interest\n*******************************\nI'm standing on top of my Monopoly board\nThat means I'm on top of my game and it don't stop\ntil my hip don't hop anymore\nhttps://www.a2oj.com/Ladder16.html\n*******************************\n300iq as writer = Sad!\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class Main\n {\n public static void main(String hi[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(infile.readLine());\n int R = Integer.parseInt(st.nextToken());\n int C = Integer.parseInt(st.nextToken());\n int K = Integer.parseInt(st.nextToken());\n int[][] grid = new int[R][C];\n for(int i=0; i < K; i++)\n {\n st = new StringTokenizer(infile.readLine());\n int r = Integer.parseInt(st.nextToken())-1;\n int c = Integer.parseInt(st.nextToken())-1;\n int x = Integer.parseInt(st.nextToken());\n grid[r][c] = x;\n }\n long[][] dp = new long[C][4];\n for(int r=0; r < R; r++)\n {\n long[][] next = new long[C][4];\n for(int c=0; c < C; c++)\n for(int t=0; t < 4; t++)\n {\n next[c][0] = Math.max(next[c][0], dp[c][t]);\n if(grid[r][c] > 0)\n next[c][1] = Math.max(next[c][1], dp[c][t]+grid[r][c]);\n }\n for(int c=1; c < C; c++)\n for(int t=0; t < 4; t++)\n {\n next[c][t] = Math.max(next[c][t], next[c-1][t]);\n if(t < 3 && grid[r][c] > 0)\n next[c][t+1] = Math.max(next[c][t+1], next[c-1][t]+grid[r][c]);\n }\n dp = next;\n }\n long res = 0L;\n for(int t=0; t < 4; t++)\n res = Math.max(res, dp[C-1][t]);\n System.out.println(res);\n }\n }", "R, C, K = map(int, input().split())\n\nmp = [[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r,c,v = map(int, input().split())\n mp[r][c] = v\n\nmemo = [[0]*4 for _ in range(R+1)]\n\nfor j in range(1,C+1):\n for i in range(1,R+1):\n if mp[i][j] > 0:\n memo[i][3] = max(memo[i][3], memo[i][2] + mp[i][j])\n memo[i][2] = max(memo[i][2], memo[i][1] + mp[i][j])\n memo[i][1] = max(memo[i][1], memo[i][0] + mp[i][j], max(memo[i-1])+mp[i][j])\n memo[i][0] = max(memo[i][0], max(memo[i-1]))\n else:\n memo[i][0] = max(memo[i][0], max(memo[i-1]))\n \nprint(max(memo[R]))", "#include<bits/stdc++.h>\n#define maxn 3005\nusing namespace std;\nint arr[maxn][maxn];\nlong long dp[maxn][maxn][4];\nlong long get(int i,int j) {\n\treturn max({dp[i][j][0],dp[i][j][1],dp[i][j][2],dp[i][j][3]});\n}\nint main() {\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\tint r,c,n;\n\tcin >> r >> c >> n;\n\tfor(int i=1;i<=n;i++) {\n\t\tint x,y,v;\n\t\tcin >> x >> y >> v;\n\t\tarr[x][y] = v;\n\t}\n\tfor(int i=1;i<=r;i++)\n\t\tfor(int j=1;j<=c;j++) {\n\t\t\tdp[i][j][0] = max(get(i - 1,j), dp[i][j - 1][0]);\n\t\t\tfor(int k=1;k<=3;k++)\n\t\t\t\tdp[i][j][k] = max({dp[i][j - 1][k],dp[i][j - 1][k - 1] + arr[i][j],get(i - 1,j) + arr[i][j]});\n\t\t}\n\tcout << get(r,c) << endl;\n\treturn 0;\n}\n", "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<n;i++)\nint a[3005][3005];\nll dp[3005][3005][4];\nint main()\n{\nint R,C;\nint K;\n\n\ncin>>R>>C;\ncin>>K;\nrep(i,K)\n{\nint r,c,v;\ncin>>r>>c>>v;\na[r-1][c-1]=v;\n}\n\nfor(int i=0;i<R;i++)\n{\nfor(int j=0;j<C;j++)\n{\nfor(int k=2;k>=0;k--)\ndp[i][j][k+1]=max(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n\nfor(int k=3;k>=0;k--)\n{\n dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n\n\n}\n\n\n\n}\n}\nll ans=0;\nfor(int i=0;i<4;i++)\nans=max(ans,dp[R-1][C-1][i]);\ncout <<ans;\nreturn 0;\n}", "\ndef resolve():\n R, C, K = map(int, input().split())\n G = [[0] * (C+1) for _ in range(R+1)]\n for _ in range(K):\n r, c, v = map(int, input().split())\n G[r][c] = v\n\n DP1 = [0 for _ in range(C + 1)] # c列目までとったとき、最新の行で1個以下とったという条件のもとの最大\n DP2 = [0 for _ in range(C + 1)] # c列目までとったとき、最新の行で2個以下とったという条件のもとの最大\n DP3 = [0 for _ in range(C + 1)] # c列目までとったとき、最新の行で3個以下とったという条件のもとの最大\n\n for r in range(1, R+1):\n for c in range(1, C+1):\n # 更新の順番に注意\n # mid = max(DP1[c], DP2[c], DP3[c]) + I[r][c]\n mid = DP3[c] + G[r][c]\n DP3[c] = max(DP3[c - 1], mid, DP2[c - 1] + G[r][c]) # 3個\n DP2[c] = max(DP2[c - 1], mid, DP1[c - 1] + G[r][c]) # 2個\n DP1[c] = max(DP1[c - 1], mid) # 1個\n\n print(DP3[C])\n\nif __name__ == \"__main__\":\n resolve()", "#include<bits/stdc++.h>\ntypedef long long ll;\nusing namespace std;\nconst int N=3e3+5;\nll r,c,k,x,y,z,g[N][N],dp[N][N][4];\nint main()\n{\n cin>>r>>c>>k;\n while(k--){\n cin>>x>>y>>z;\n g[x][y]=z;\n }\n for(int i=1;i<=r;i++){\n for(int j=1;j<=c;j++){\n for(int k=1;k<=3;k++){\n dp[i][j][k]=max(dp[i-1][j][3]+g[i][j],max(dp[i][j-1][k-1]+g[i][j],dp[i][j-1][k]));\n }\n }\n }\n cout<<dp[r][c][3];\n}\n", "f,h=range,input\nR,C,K=map(int,h().split())\nG=[[0]*-~C for i in f(R+1)]\nfor i in'_'*K:r,c,v=map(int,h().split());G[r][c]=v\nF=[[[0]*-~C for i in f(R+1)]for i in f(4)]\nfor r in f(1,R+1):\n\tfor x in f(1,4):\n\t\tfor c in f(1,C+1):F[x][r][c]=max(F[x-1][r][c],max(F[x-1][r][c-1],(x<2)*F[3][r-1][c])+G[r][c],F[x][r][c-1])\nprint(F[3][R][C])", "import sys\ninput = sys.stdin.readline\n\nr, c, k = map(int, input().split())\nv = [[0 for j in range(c)] for i in range(r)]\n\ndp = [[[0 for j in range(c)] for i in range(r)] for k in range(4)]\n\nfor i in range(k):\n ri, ci, vi = map(int, input().split())\n v[ri-1][ci-1] = vi\n\n\nfor i in range(r):\n if i > 0:\n for j in range(c):\n for k in range(4):\n dp[0][i][j] = max(dp[0][i][j], dp[k][i-1][j])\n for j in range(c):\n if j > 0:\n for k in range(4):\n dp[k][i][j] = max(dp[k][i][j], dp[k][i][j-1])\n if v[i][j]:\n for k in reversed(range(1, 4)):\n dp[k][i][j] = max(dp[k][i][j], dp[k-1][i][j]+v[i][j])\n \n\nans = 0\n\nfor k in range(4):\n ans = max(ans, dp[k][r-1][c-1])\n\nprint(ans)\n \n", "import sys\ninput = sys.stdin.readline\ndef solve():\n R, C, K = map(int, input().split())\n item = [[0]*C for _ in range(R)]\n for i in range(K):\n r,c,v = map(int, input().split())\n item[r-1][c-1] = v\n dp = [[[0]*(C+1) for _ in range(R+1)] for _ in range(4)]\n for i in range(1,R+1):\n for j in range(1,C+1):\n for k in range(4): #横から取らない\n dp[k][i][j] = dp[k][i][j-1]\n #上から取らない\n dp[0][i][j] = max(dp[0][i][j],dp[-1][i-1][j])\n if item[i-1][j-1]>0:\n #上からとる\n dp[1][i][j] = max(dp[1][i][j],dp[-1][i-1][j]+item[i-1][j-1])\n for k in range(1,4): #横から取る\n dp[k][i][j] = max(dp[k][i][j],dp[k-1][i][j-1]+item[i-1][j-1])\n for k in range(1,4):\n dp[k][i][j] = max(dp[k-1][i][j],dp[k][i][j])\n ans = 0\n for k in range(4):\n ans = max(ans,dp[k][-1][-1])\n return ans\nprint(solve())", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\n#define MOD 1000000007\n\nusing namespace std;\nusing ll = long long;\n\nll dp[3001][3001][4] = {};\nll mp[3001][3001] = {};\nll dpm(int dpi, int dpj, int dpk) {\n\tll x = dp[dpi][dpj][0];\n\trep (dpr, dpk+1) x = max(x, dp[dpi][dpj][dpr]);\n\treturn x;\n}\nint main() {\n\tint r, c, n;\n\tcin >> r >> c >> n;\n\n\trep(i,n) {\n\t\tint h, w, v;\n\t\tcin >> h >> w >> v;\n\t\tmp[h][w] += v;\n\t}\n\n\tfor (int i = 1; i <= r; i++) {\n\t\tfor (int j = 1; j <= c; j++) {\n\t\t\trep(k,4) {\n\t\t\t\tif (k == 0) {\n\t\t\t\t\tll m = dpm(i-1, j, 3);\n\t\t\t\t\tm = max(m, dp[i][j-1][0]);\n\t\t\t\t\tdp[i][j][0] = m;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tdp[i][j][k] = mp[i][j] + max(dp[i][j-1][k-1], dpm(i-1,j,3));\n\t\t\t\tdp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k]);\n\t\t\t}\n\t\t}\n\t}\n\tll m = dpm(r, c, 3);\n\tll ans = m;\n\tcout << ans << endl;\n\treturn 0;\n}\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\n\npublic class Main {\n\tlong[][][] DP;\n\t\n\tlong maxDP(int x, int y){\n\t\treturn Math.max(DP[x][y][3],\n\t\t\t\t\tMath.max(DP[x][y][2],\n\t\t\t\t\tMath.max(DP[x][y][1], DP[x][y][0])));\n\t}\n\n\tpublic Main() {\n\t\tFastScanner scanner = new FastScanner();\n\t\tint R = scanner.nextInt();\n\t\tint C = scanner.nextInt();\n\n\t\tDP = new long[C+1][R+1][4];\n\t\tlong[][] values = new long[C+1][R+1];\n\n\t\tint K = scanner.nextInt();\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint y = scanner.nextInt();\n\t\t\tint x = scanner.nextInt();\n\t\t\tvalues[x][y] = scanner.nextLong();\n\t\t}\n\t\t\n\n\t\tfor (int y = 1; y <= R; y++) {\n\t\t\tfor (int x = 1; x <= C; x++) {\n\t\t\t\tlong value = values[x][y];\n\t\t\t\tDP[x][y][0] = Math.max(DP[x-1][y][0], maxDP(x,y-1));\n\t\t\t\tDP[x][y][1] = Math.max(DP[x-1][y][1], DP[x][y][0] + value);\n\t\t\t\tDP[x][y][2] = Math.max(DP[x-1][y][2], DP[x-1][y][1] + value);\n\t\t\t\tDP[x][y][3] = Math.max(DP[x-1][y][3], DP[x-1][y][2] + value);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(maxDP(C, R));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main();\n\t}\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte()) return buffer[ptr++];\n\t\telse return -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Main implements Runnable {\n\tstatic boolean DEBUG;\n\tpublic static void main(String[] args) {\n\t\tDEBUG = args.length > 0 && args[0].equals(\"-DEBUG\");\n\t\tThread.setDefaultUncaughtExceptionHandler((t, e) -> { e.printStackTrace(); System.exit(1); });\n\t\tnew Thread(null, new Main(), \"\", 1 << 31).start();\n\t}\n\n\tpublic void run() {\n\t\tSolver solver = new Solver();\n\t\tsolver.solve();\n\t\tsolver.exit();\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate final InputStream in = System.in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int pointer = 0;\n\t\tprivate int buflen = 0;\n\t\tprivate boolean hasNextByte() {\n\t\t\tif(pointer < buflen) return true;\n\t\t\telse {\n\t\t\t\tpointer = 0;\n\t\t\t\ttry {\n\t\t\t\t\tbuflen = in.read(buffer);\n\t\t\t\t}catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\treturn buflen > 0;\n\t\t\t}\n\t\t}\n\t\tprivate int readByte() { if(hasNextByte()) return buffer[pointer ++]; else return -1; }\n\t\tprivate boolean isPrintableChar(int c) { return isPrintableChar(c, false); }\n\t\tprivate boolean isPrintableChar(int c, boolean includingSpace) { return (includingSpace ? 32 : 33) <= c && c <= 126; }\n\t\tprivate void skipUnprintable() { skipUnprintable(false); }\n\t\tprivate void skipUnprintable(boolean includingSpace) { while(hasNextByte() && !isPrintableChar(buffer[pointer], includingSpace)) pointer++; }\n\t\tprivate boolean hasNext() { return hasNext(false); }\n\t\tprivate boolean hasNext(boolean includingSpace) { skipUnprintable(includingSpace); return hasNextByte(); }\n\t\tprivate StringBuilder sb = new StringBuilder();\n\t\tpublic String next() { return next(false); }\n\t\tpublic String next(boolean includingSpace) {\n\t\t\tif(!hasNext(includingSpace)) throw new NoSuchElementException();\n\t\t\tsb.setLength(0);\n\t\t\tint b = readByte();\n\t\t\twhile(isPrintableChar(b, includingSpace)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tif(!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif(b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif(b < '0' || '9' < b) throw new NumberFormatException();\n\t\t\twhile(true) {\n\t\t\t\tif('0' <= b && b <= '9') n = n * 10 + b - '0';\n\t\t\t\telse if(b == -1 || !isPrintableChar(b)) return minus ? -n : n;\n\t\t\t\telse throw new NumberFormatException();\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Solver {\n\t\tFastScanner sc = new FastScanner();\n\t\tpublic Solver() { }\n\n\t\tString ns() { return ns(false); }\n\t\tString ns(boolean includingSpace) { return sc.next(includingSpace); }\n\t\tString[] ns(int n) { return ns(n, false); }\n\t\tString[] ns(int n, boolean includingSpace) {\n\t\t\tString a[] = new String[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ns(includingSpace);\n\t\t\treturn a;\n\t\t}\n\t\tString[][] ns(int n, int m) { return ns(n, m, false); }\n\t\tString[][] ns(int n, int m, boolean includingSpace) {\n\t\t\tString a[][] = new String[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ns(m, includingSpace);\n\t\t\treturn a;\n\t\t}\n\t\tchar nc() { return ns().charAt(0); }\n\t\tchar[] nc(int n) {\n\t\t\tString str = ns();\n\t\t\tif(n < 0) n = str.length();\n\t\t\tchar a[] = new char[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = str.charAt(i);\n\t\t\treturn a;\n\t\t}\n\t\tchar[][] nc(int n, int m) {\n\t\t\tchar a[][] = new char[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nc(m);\n\t\t\treturn a;\n\t\t}\n\t\tboolean[] nb(int n, char t) {\n\t\t\tchar c[] = nc(-1);\n\t\t\tif(n < 0) n = c.length;\n\t\t\tboolean a[] = new boolean[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = c[i] == t;\n\t\t\treturn a;\n\t\t}\n\t\tboolean[][] nb(int n, int m, char t) {\n\t\t\tboolean a[][] = new boolean[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nb(m, t);\n\t\t\treturn a;\n\t\t}\n\t\tint ni() { return Math.toIntExact(sc.nextLong()); }\n\t\tint[] ni(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ni();\n\t\t\treturn a;\n\t\t}\n\t\tint[][] ni(int n, int m) {\n\t\t\tint a[][] = new int[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ni(m);\n\t\t\treturn a;\n\t\t}\n\t\tlong nl() { return sc.nextLong(); }\n\t\tlong[] nl(int n) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nl();\n\t\t\treturn a;\n\t\t}\n\t\tlong[][] nl(int n, int m) {\n\t\t\tlong a[][] = new long[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nl(m);\n\t\t\treturn a;\n\t\t}\n\t\tdouble nd() { return Double.parseDouble(sc.next()); }\n\t\tdouble[] nd(int n) {\n\t\t\tdouble a[] = new double[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nd();\n\t\t\treturn a;\n\t\t}\n\t\tdouble[][] nd(int n, int m) {\n\t\t\tdouble a[][] = new double[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nd(m);\n\t\t\treturn a;\n\t\t}\n\n\n\t\tString booleanToString(boolean b) { return b ? \"#\" : \".\"; }\n\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tPrintWriter err = new PrintWriter(System.err);\n\t\tStringBuilder sb4prtln = new StringBuilder();\n\t\tvoid prt() { out.print(\"\"); }\n\t\t<T> void prt(T a) { out.print(a); }\n\t\tvoid prtln() { out.println(\"\"); }\n\t\t<T> void prtln(T a) { out.println(a); }\n\t\tvoid prtln(int... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(int element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(long... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(long element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(double... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(double element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(String... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(String element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(char... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(char element : a) sb4prtln.append(element);\n\t\t\tprtln(sb4prtln.toString());\n\t\t}\n\t\tvoid prtln(boolean... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(boolean element : a) sb4prtln.append(booleanToString(element));\n\t\t\tprtln(sb4prtln.toString());\n\t\t}\n\t\tvoid prtln(int[][] a) { for(int[] element : a) prtln(element); }\n\t\tvoid prtln(long[][] a) { for(long[] element : a) prtln(element); }\n\t\tvoid prtln(double[][] a) { for(double[] element : a) prtln(element); }\n\t\tvoid prtln(String[][] a) { for(String[] element : a) prtln(element); }\n\t\tvoid prtln(char[][] a) { for(char[] element : a) prtln(element); }\n\t\tvoid prtln(boolean[][] a) { for(boolean[] element : a) prtln(element); }\n\n\t\tString errconvert(int a) { return isINF(a) ? \"_\" : String.valueOf(a); }\n\t\tString errconvert(long a) { return isINF(a) ? \"_\" : String.valueOf(a); }\n\t\tvoid errprt(int a) { if(DEBUG) err.print(errconvert(a)); }\n\t\tvoid errprt(long a) { if(DEBUG) err.print(errconvert(a)); }\n\t\tvoid errprt() { if(DEBUG) err.print(\"\"); }\n\t\t<T> void errprt(T a) { if(DEBUG) err.print(a); }\n\t\tvoid errprt(boolean a) { if(DEBUG) errprt(booleanToString(a)); }\n\t\tvoid errprtln() { if(DEBUG) err.println(\"\"); }\n\t\tvoid errprtln(int a) { if(DEBUG) err.println(errconvert(a)); }\n\t\tvoid errprtln(long a) { if(DEBUG) err.println(errconvert(a)); }\n\t\t<T> void errprtln(T a) { if(DEBUG) err.println(a); }\n\t\tvoid errprtln(boolean a) { if(DEBUG) errprtln(booleanToString(a)); }\n\t\tvoid errprtln(int... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(int element : a) sb4prtln.append(errconvert(element)+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(long... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(long element : a) sb4prtln.append(errconvert(element)+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(double... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(double element : a) sb4prtln.append(element+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(String... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(String element : a) sb4prtln.append(element+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(char... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(char element : a) sb4prtln.append(element);\n\t\t\t\terrprtln(sb4prtln.toString());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(boolean... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(boolean element : a) sb4prtln.append(booleanToString(element));\n\t\t\t\terrprtln(sb4prtln.toString());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(Object[] a) { if(DEBUG) for(Object element : a) errprtln(element); }\n\t\tvoid errprtln(int[][] a) { if(DEBUG) for(int[] element : a) errprtln(element); }\n\t\tvoid errprtln(long[][] a) { if(DEBUG) for(long[] element : a) errprtln(element); }\n\t\tvoid errprtln(double[][] a) { if(DEBUG) for(double[] element : a) errprtln(element); }\n\t\tvoid errprtln(String[][] a) { if(DEBUG) for(String[] element : a) errprtln(element); }\n\t\tvoid errprtln(char[][] a) { if(DEBUG) for(char[] element : a) errprtln(element); }\n\t\tvoid errprtln(boolean[][] a) { if(DEBUG) for(boolean[] element : a) errprtln(element); }\n\t\tvoid errprtln(Object[][] a) { if(DEBUG) for(Object element : a) { errprtln(element); errprtln(); } }\n\n\t\tvoid reply(boolean b) { prtln(b ? \"Yes\" : \"No\"); }\n\t\tvoid REPLY(boolean b) { prtln(b ? \"YES\" : \"NO\"); }\n\n\t\tvoid flush() { out.flush(); if(DEBUG) err.flush(); }\n\t\tvoid assertion(boolean b) { if(!b) throw new AssertionError(); }\n\n\t\tvoid exit() { flush(); System.exit(0); }\n\t\t<T> void exit(T a) { prtln(a); exit(); }\n\t\tvoid exit(int... a) { prtln(a); exit(); }\n\t\tvoid exit(long... a) { prtln(a); exit(); }\n\t\tvoid exit(double... a) { prtln(a); exit(); }\n\t\tvoid exit(String... a) { prtln(a); exit(); }\n\t\tvoid exit(char... a) { prtln(a); exit(); }\n\t\tvoid exit(boolean... a) { prtln(a); exit(); }\n\t\tvoid exit(int[][] a) { prtln(a); exit(); }\n\t\tvoid exit(long[][] a) { prtln(a); exit(); }\n\t\tvoid exit(double[][] a) { prtln(a); exit(); }\n\t\tvoid exit(String[][] a) { prtln(a); exit(); }\n\t\tvoid exit(char[][] a) { prtln(a); exit(); }\n\t\tvoid exit(boolean[][] a) { prtln(a); exit(); }\n\n\n\t\tfinal long INF = (long)1e18 + 7;\n\t\tboolean isPlusINF(long a) { return a > INF / 10; }\n\t\tboolean isMinusINF(long a) { return isPlusINF(- a); }\n\t\tboolean isINF(long a) { return isPlusINF(a) || isMinusINF(a); }\n\t\tfinal int I_INF = (int)1e9 + 7;\n\t\tboolean isPlusINF(int a) { return a > I_INF / 10; }\n\t\tboolean isMinusINF(int a) { return isPlusINF(- a); }\n\t\tboolean isINF(int a) { return isPlusINF(a) || isMinusINF(a); }\n\n\n\t\tint min(int a, int b) { return Math.min(a, b); }\n\t\tlong min(long a, long b) { return Math.min(a, b); }\n\t\tdouble min(double a, double b) { return Math.min(a, b); }\n\t\t<T extends Comparable<T>> T min(T a, T b) { return a.compareTo(b) <= 0 ? a : b; }\n\t\tint min(int... x) {\n\t\t\tint min = x[0];\n\t\t\tfor(int val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tlong min(long... x) {\n\t\t\tlong min = x[0];\n\t\t\tfor(long val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tdouble min(double... x) {\n\t\t\tdouble min = x[0];\n\t\t\tfor(double val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tint max(int a, int b) { return Math.max(a, b); }\n\t\tlong max(long a, long b) { return Math.max(a, b); }\n\t\tdouble max(double a, double b) { return Math.max(a, b); }\n\t\t<T extends Comparable<T>> T max(T a, T b) { return a.compareTo(b) >= 0 ? a : b; }\n\t\tint max(int... x) {\n\t\t\tint max = x[0];\n\t\t\tfor(int val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tlong max(long... x) {\n\t\t\tlong max = x[0];\n\t\t\tfor(long val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tdouble max(double... x) {\n\t\t\tdouble max = x[0];\n\t\t\tfor(double val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tlong sum(int... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(int element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(long... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(long element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tdouble sum(double... a) {\n\t\t\tdouble sum = 0;\n\t\t\tfor(double element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(boolean... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(boolean element : a) sum += element ? 1 : 0;\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(int[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(long[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tdouble[] sums(double[] a) {\n\t\t\tdouble sum[] = new double[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(boolean[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + (a[i] ? 1 : 0);\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(int[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(long[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tdouble[][] sums(double[][] a) {\n\t\t\tdouble sum[][] = new double[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(boolean[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + (a[i][j] ? 1 : 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tint constrain(int x, int l, int r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tlong constrain(long x, long l, long r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tdouble constrain(double x, double l, double r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tint abs(int x) { return x >= 0 ? x : - x; }\n\t\tlong abs(long x) { return x >= 0 ? x : - x; }\n\t\tdouble abs(double x) { return x >= 0 ? x : - x; }\n\t\tint signum(int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tint signum(long x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tint signum(double x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tlong round(double x) { return Math.round(x); }\n\t\tlong floor(double x) { return (long)Math.floor(x); }\n\t\tint divfloor(int a, int b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }\n\t\tlong divfloor(long a, long b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }\n\t\tlong ceil(double x) { return (long)Math.ceil(x); }\n\t\tint divceil(int a, int b) { return a >= 0 && b > 0 ? (a + b - 1) / b\n\t\t\t\t\t\t\t\t\t\t\t: a < 0 && b < 0 ? divceil(abs(a), abs(b))\n\t\t\t\t\t\t\t\t\t\t\t: - divfloor(abs(a), abs(b)); }\n\t\tlong divceil(long a, long b) { return a >= 0 && b > 0 ? (a + b - 1) / b\n\t\t\t\t\t\t\t\t\t\t\t: a < 0 && b < 0 ? divceil(abs(a), abs(b))\n\t\t\t\t\t\t\t\t\t\t\t: - divfloor(abs(a), abs(b)); }\n\t\tdouble sqrt(int x) { return Math.sqrt((double)x); }\n\t\tdouble sqrt(long x) { return Math.sqrt((double)x); }\n\t\tdouble sqrt(double x) { return Math.sqrt(x); }\n\t\tlong fact(int n) {\n\t\t\tlong ans = 1;\n\t\t\tfor(int i = 1; i <= n; i ++) ans = Math.multiplyExact(ans, i);\n\t\t\treturn ans;\n\t\t}\n\t\tdouble pow(double x, double y) { return Math.pow(x, y); }\n\t\tlong pow(long x, long y) {\n\t\t\tlong ans = 1;\n\t\t\twhile(true) {\n\t\t\t\tif(y % 2 != 0) ans = Math.multiplyExact(ans, x);\n\t\t\t\ty /= 2;\n\t\t\t\tif(y <= 0) return ans;\n\t\t\t\tx = Math.multiplyExact(x, x);\n\t\t\t}\n\t\t}\n\t\tint gcd(int a, int b) {\n\t\t\twhile(true) {\n\t\t\t\tif(b == 0) return a;\n\t\t\t\tint tmp = a;\n\t\t\t\ta = b;\n\t\t\t\tb = tmp % b;\n\t\t\t}\n\t\t}\n\t\tlong gcd(long a, long b) {\n\t\t\twhile(true) {\n\t\t\t\tif(b == 0) return a;\n\t\t\t\tlong tmp = a;\n\t\t\t\ta = b;\n\t\t\t\tb = tmp % b;\n\t\t\t}\n\t\t}\n\t\tlong lcm(long a, long b) { return a / gcd(a, b) * b; }\n\t\tint gcd(int... a) {\n\t\t\tint gcd = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) gcd = gcd(gcd, a[i]);\n\t\t\treturn gcd;\n\t\t}\n\t\tlong gcd(long... a) {\n\t\t\tlong gcd = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) gcd = gcd(gcd, a[i]);\n\t\t\treturn gcd;\n\t\t}\n\t\tdouble random() { return Math.random(); }\n\t\tint random(int max) { return (int)floor(random() * max); }\n\t\tlong random(long max) { return floor(random() * max); }\n\t\tint random(int min, int max) { return random(max - min) + max; }\n\t\tlong random(long min, long max) { return random(max - min) + max; }\n\n\t\tboolean isUpper(char a) { return a >= 'A' && a <= 'Z'; }\n\t\tboolean isLower(char a) { return a >= 'a' && a <= 'z'; }\n\t\tint upperToInt(char a) { return a - 'A'; }\n\t\tint lowerToInt(char a) { return a - 'a'; }\n\t\tint numToInt(char a) { return a - '0'; }\n\t\tint charToInt(char a) { return a >= 'a' ? lowerToInt(a) : a >= 'A' ? upperToInt(a) : numToInt(a); }\n\t\tchar intToUpper(int a) { return (char)(a + 'A'); }\n\t\tchar intToLower(int a) { return (char)(a + 'a'); }\n\t\tchar intToNum(int a) { return (char)(a + '0'); }\n\t\tint[] charToInt(char[] a) {\n\t\t\tint array[] = new int[a.length];\n\t\t\tfor(int i = 0; i < a.length; i ++) array[i] = charToInt(a[i]);\n\t\t\treturn array;\n\t\t}\n\n\t\tlong[] div(long a) {\n\t\t\tList<Long> divList = new ArrayList<Long>();\n\t\t\tfor(long i = 1; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tdivList.add(i);\n\t\t\t\t\tif(i * i != a) divList.add(a / i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong div[] = new long[divList.size()];\n\t\t\tfor(int i = 0; i < divList.size(); i ++) div[i] = divList.get(i);\n\t\t\tArrays.sort(div);\n\t\t\treturn div;\n\t\t}\n\n\t\tlong[][] factor(long a) {\n\t\t\tList<Long> factorList = new ArrayList<Long>();\n\t\t\tList<Long> degreeList = new ArrayList<Long>();\n\t\t\tfor(long i = 2; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tlong count = 0;\n\t\t\t\t\twhile(a % i == 0) { a /= i; count ++; }\n\t\t\t\t\tfactorList.add(i);\n\t\t\t\t\tdegreeList.add(count);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(a > 1) { factorList.add(a); degreeList.add(1L); }\n\t\t\tlong factor[][] = new long[factorList.size()][2];\n\t\t\tfor(int i = 0; i < factorList.size(); i ++) {\n\t\t\t\tfactor[i][0] = factorList.get(i);\n\t\t\t\tfactor[i][1] = degreeList.get(i);\n\t\t\t}\n\t\t\tArrays.sort(factor, (sort1, sort2) -> Long.compare(sort1[0], sort2[0]));\n\t\t\treturn factor;\n\t\t}\n\n\t\tboolean isPrime(long x) {\n\t\t\tboolean ok = x > 1;\n\t\t\tfor(long i = 2; i * i <= x; i ++) {\n\t\t\t\tok &= x % i != 0;\n\t\t\t\tif(!ok) return ok;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean[] prime(int num) {\n\t\t\tboolean prime[] = new boolean[num];\n\t\t\tfill(prime, true);\n\t\t\tif(num > 0) prime[0] = false;\n\t\t\tif(num > 1) prime[1] = false;\n\t\t\tfor(int i = 2; i < num; i ++) if(prime[i]) for(int j = 2; i * j < num; j ++) prime[i * j] = false;\n\t\t\treturn prime;\n\t\t}\n\n\t\tlong[][] countElements(long[] a, boolean sort) {\n\t\t\tint len = a.length;\n\t\t\tlong array[] = new long[len];\n\t\t\tfor(int i = 0; i < len; i ++) array[i] = a[i];\n\t\t\tif(sort) Arrays.sort(array);\n\t\t\tList<Long> elem = new ArrayList<Long>();\n\t\t\tList<Long> cnt = new ArrayList<Long>();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add(array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else tmp ++;\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\t\tlong[][] countElements(String str, boolean sort) {\n\t\t\tint len = str.length();\n\t\t\tchar array[] = str.toCharArray();\n\t\t\tif(sort) Arrays.sort(array);\n\t\t\tList<Long> elem = new ArrayList<Long>();\n\t\t\tList<Long> cnt = new ArrayList<Long>();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add((long)array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else tmp ++;\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\n\t\tint[] baseConvert(long x, int n, int len) {\n\t\t\tint digit[] = new int[len];\n\t\t\tint i = 0;\n\t\t\tlong tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = (int)(tmp % n); tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tint[] baseConvert(long x, int n) {\n\t\t\tlong tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\t\tint[] baseConvert(int x, int n, int len) {\n\t\t\tint digit[] = new int[len];\n\t\t\tint i = 0;\n\t\t\tint tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = (int)(tmp % n); tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tint[] baseConvert(int x, int n) {\n\t\t\tint tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\t\tlong[] baseConvert(long x, long n, int len) {\n\t\t\tlong digit[] = new long[len];\n\t\t\tint i = 0;\n\t\t\tlong tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = tmp % n; tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tlong[] baseConvert(long x, long n) {\n\t\t\tlong tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\n\t\tint numDigits(long a) { return Long.toString(a).length(); }\n\t\tlong bitFlag(int a) { return 1L << (long)a; }\n\t\tboolean isFlagged(long x, int a) { return (x & bitFlag(a)) != 0; }\n\n\t\tlong countString(String str, String a) { return (str.length() - str.replace(a, \"\").length()) / a.length(); }\n\t\tlong countStringAll(String str, String a) { return str.length() - str.replaceAll(a, \"\").length(); }\n\n\n\t\tString reverse(String str) { return (new StringBuilder(str)).reverse().toString(); }\n\t\tvoid reverse(String[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(int[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(long[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(double[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(char[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(boolean[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\t<T> void reverse(T[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid fill(int[] array, int x) { Arrays.fill(array, x); }\n\t\tvoid fill(long[] array, long x) { Arrays.fill(array, x); }\n\t\tvoid fill(double[] array, double x) { Arrays.fill(array, x); }\n\t\tvoid fill(char[] array, char x) { Arrays.fill(array, x); }\n\t\tvoid fill(boolean[] array, boolean x) { Arrays.fill(array, x); }\n\t\tvoid fill(int[][] array, int x) { for(int[] a : array) fill(a, x); }\n\t\tvoid fill(long[][] array, long x) { for(long[] a : array) fill(a, x); }\n\t\tvoid fill(double[][] array, double x) { for(double[] a : array) fill(a, x); }\n\t\tvoid fill(char[][] array, char x) { for(char[] a : array) fill(a, x); }\n\t\tvoid fill(boolean[][] array, boolean x) { for(boolean[] a : array) fill(a, x); }\n\t\tvoid fill(int[][][] array, int x) { for(int[][] a : array) fill(a, x); }\n\t\tvoid fill(long[][][] array, long x) { for(long[][] a : array) fill(a, x); }\n\t\tvoid fill(double[][][] array, double x) { for(double[][] a : array) fill(a, x); }\n\t\tvoid fill(char[][][] array, char x) { for(char[][] a : array) fill(a, x); }\n\t\tvoid fill(boolean[][][] array, boolean x) { for(boolean[][] a : array) fill(a, x); }\n\n\t\tint[] resize(int[] array, int m, int x) {\n\t\t\tint resized[] = new int[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tlong[] resize(long[] array, int m, int x) {\n\t\t\tlong resized[] = new long[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tdouble[] resize(double[] array, int m, int x) {\n\t\t\tdouble resized[] = new double[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tchar[] resize(char[] array, int m, int x) {\n\t\t\tchar resized[] = new char[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tboolean[] resize(boolean[] array, int m, int x) {\n\t\t\tboolean resized[] = new boolean[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tObject[] resize(Object[] array, int m, int x) {\n\t\t\tObject resized[] = new Object[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\n\t\tvoid shuffleArray(int[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tint tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tvoid shuffleArray(long[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tlong tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tvoid shuffleArray(double[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tdouble tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\n\t\tvoid swap(String[] array, int i, int j) {\n\t\t\tString tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(int[] array, int i, int j) {\n\t\t\tint tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(long[] array, int i, int j) {\n\t\t\tlong tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(double[] array, int i, int j) {\n\t\t\tdouble tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(char[] array, int i, int j) {\n\t\t\tchar tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(boolean[] array, int i, int j) {\n\t\t\tboolean tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\t<T> void swap(T[] array, int i, int j) {\n\t\t\tT tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\n\t\tint[] compress(int[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet<Integer> ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tint compressed[] = new int[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Integer x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\t\tlong[] compress(long[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet<Long> ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tlong compressed[] = new long[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Long x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\t\tdouble[] compress(double[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet<Double> ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tdouble compressed[] = new double[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Double x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\n\n\t\tint lowerBound(int[] array, int key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(int[] array, int key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(int[] array, int key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(int[] array, int key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(int[] array, int key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(int[] array, int key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(int[] array, int key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) {\n\t\t\t\t\tok = mid;\n\t\t\t\t}else {\n\t\t\t\t\tng = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(int[] array, int index, int key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater)\n\t\t\t\t|| (array[index] < key && !greater)\n\t\t\t\t|| (array[index] == key && equals);\n\t\t}\n\t\tint lowerBound(long[] array, long key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(long[] array, long key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(long[] array, long key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(long[] array, long key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(long[] array, long key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(long[] array, long key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(long[] array, long key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) {\n\t\t\t\t\tok = mid;\n\t\t\t\t}else {\n\t\t\t\t\tng = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(long[] array, int index, long key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater)\n\t\t\t\t|| (array[index] < key && !greater)\n\t\t\t\t|| (array[index] == key && equals);\n\t\t}\n\t\tint lowerBound(double[] array, double key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(double[] array, double key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(double[] array, double key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(double[] array, double key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(double[] array, double key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(double[] array, double key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(double[] array, double key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) {\n\t\t\t\t\tok = mid;\n\t\t\t\t}else {\n\t\t\t\t\tng = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(double[] array, int index, double key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater)\n\t\t\t\t|| (array[index] < key && !greater)\n\t\t\t\t|| (array[index] == key && equals);\n\t\t}\n\t\t<T extends Comparable<? super T>> int lowerBound(T[] array, T key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\t<T extends Comparable<? super T>> int lowerBound(T[] array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int upperBound(T[] array, T key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\t<T extends Comparable<? super T>> int upperBound(T[] array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\t<T extends Comparable<? super T>> int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\t<T extends Comparable<? super T>> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t<T extends Comparable<? super T>> int binarySearch(T[] array, T key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) {\n\t\t\t\t\tok = mid;\n\t\t\t\t}else {\n\t\t\t\t\tng = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t<T extends Comparable<? super T>> boolean isOKforBinarySearch(T[] array, int index, T key, boolean greater, boolean equals) {\n\t\t\tint compare = array[index].compareTo(key);\n\t\t\treturn (compare > 0 && greater)\n\t\t\t\t|| (compare < 0 && !greater)\n\t\t\t\t|| (compare == 0 && equals);\n\t\t}\n\t\t<T> int lowerBound(T[] array, T key, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, true, true, true, c);\n\t\t}\n\t\t<T> int lowerBound(T[] array, T key, int ng, int ok, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok, c);\n\t\t}\n\t\t<T> int upperBound(T[] array, T key, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, true, true, false, c);\n\t\t}\n\t\t<T> int upperBound(T[] array, T key, int ng, int ok, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok, c);\n\t\t}\n\t\t<T> int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, c);\n\t\t}\n\t\t<T> int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok, c);\n\t\t}\n\t\t<T> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, c);\n\t\t}\n\t\t<T> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok, c);\n\t\t}\n\t\t<T> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, Comparator<? super T> c) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok, c);\n\t\t}\n\t\t<T> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok, Comparator<? super T> c) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok, c);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t<T> int binarySearch(T[] array, T key, boolean greater, boolean equals, int ng, int ok, Comparator<? super T> c) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals, c)) {\n\t\t\t\t\tok = mid;\n\t\t\t\t}else {\n\t\t\t\t\tng = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t<T> boolean isOKforBinarySearch(T[] array, int index, T key, boolean greater, boolean equals, Comparator<? super T> c) {\n\t\t\tint compare = c.compare(array[index], key);\n\t\t\treturn (compare > 0 && greater)\n\t\t\t\t|| (compare < 0 && !greater)\n\t\t\t\t|| (compare == 0 && equals);\n\t\t}\n\t\t<T extends Comparable<? super T>> int lowerBound(List<T> array, T key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\t<T extends Comparable<? super T>> int lowerBound(List<T> array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int upperBound(List<T> array, T key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\t<T extends Comparable<? super T>> int upperBound(List<T> array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int cntBS(List<T> array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\t<T extends Comparable<? super T>> int cntBS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int BS(List<T> array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\t<T extends Comparable<? super T>> int BS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int BS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.size() : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.size();\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\t<T extends Comparable<? super T>> int BS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t<T extends Comparable<? super T>> int binarySearch(List<T> array, T key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) {\n\t\t\t\t\tok = mid;\n\t\t\t\t}else {\n\t\t\t\t\tng = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t<T extends Comparable<? super T>> boolean isOKforBinarySearch(List<T> array, int index, T key, boolean greater, boolean equals) {\n\t\t\tint compare = array.get(index).compareTo(key);\n\t\t\treturn (compare > 0 && greater)\n\t\t\t\t|| (compare < 0 && !greater)\n\t\t\t\t|| (compare == 0 && equals);\n\t\t}\n\t\t<T> int lowerBound(List<T> array, T key, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, true, true, true, c);\n\t\t}\n\t\t<T> int lowerBound(List<T> array, T key, int ng, int ok, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok, c);\n\t\t}\n\t\t<T> int upperBound(List<T> array, T key, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, true, true, false, c);\n\t\t}\n\t\t<T> int upperBound(List<T> array, T key, int ng, int ok, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok, c);\n\t\t}\n\t\t<T> int cntBS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, c);\n\t\t}\n\t\t<T> int cntBS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok, c);\n\t\t}\n\t\t<T> int BS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, c);\n\t\t}\n\t\t<T> int BS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator<? super T> c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok, c);\n\t\t}\n\t\t<T> int BS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, boolean count, Comparator<? super T> c) {\n\t\t\tint ng = ascending ^ greater ? array.size() : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.size();\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok, c);\n\t\t}\n\t\t<T> int BS(List<T> array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok, Comparator<? super T> c) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok, c);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t<T> int binarySearch(List<T> array, T key, boolean greater, boolean equals, int ng, int ok, Comparator<? super T> c) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals, c)) {\n\t\t\t\t\tok = mid;\n\t\t\t\t}else {\n\t\t\t\t\tng = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t<T> boolean isOKforBinarySearch(List<T> array, int index, T key, boolean greater, boolean equals, Comparator<? super T> c) {\n\t\t\tint compare = c.compare(array.get(index), key);\n\t\t\treturn (compare > 0 && greater)\n\t\t\t\t|| (compare < 0 && !greater)\n\t\t\t\t|| (compare == 0 && equals);\n\t\t}\n\n\n\t\t// mods\n\t\tfinal long MOD = (long)1e9 + 7; // 998244353;\n\t\tlong mod(long i) { i %= MOD; return i + (i < 0 ? MOD : 0); }\n\t\tvoid mod(long[] a) { for(int i = 0; i < a.length; i ++) a[i] = mod(a[i]); }\n\t\tvoid mod(long[][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); }\n\t\tvoid mod(long[][][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); }\n\n\t\tlong pow_m(long x, long y) {\n\t\t\tlong ans = 1;\n\t\t\tfor(; y > 0; y /= 2) {\n\t\t\t\tif(y % 2 != 0) ans = mod(ans * x);\n\t\t\t\tx = mod(x * x);\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\t\tlong[] pows_m(long x, int max) {\n\t\t\tlong pow[] = new long[max + 1];\n\t\t\tpow[0] = 1;\n\t\t\tfor(int i = 0; i < max; i ++) pow[i + 1] = mod(pow[i] * x);\n\t\t\treturn pow;\n\t\t}\n\t\tlong fact_m(int n) {\n\t\t\tlong ans = 1;\n\t\t\tfor(int i = 1; i <= n; i ++) ans = mod(ans * i);\n\t\t\treturn ans;\n\t\t}\n\n\t\tfinal int MAX_INV_SIZE = 100_100;\n\t\tMap<Long, Long> invMap = new HashMap<>();\n\t\tlong inv(long x) {\n\t\t\tx = mod(x);\n\t\t\tif(invMap.containsKey(x)) return invMap.get(x);\n\t\t\tif(invMap.size() >= MAX_INV_SIZE) return calInv(x);\n\t\t\tinvMap.put(x, calInv(x));\n\t\t\treturn invMap.get(x);\n\t\t}\n\t\tlong calInv(long x) { return pow_m(x, MOD - 2); }\n\n\t\tfinal int MAX_FACT = 5_000_100;\n\t\tlong fact[];\n\t\tlong invFact[];\n\t\tboolean isFactPrepared = false;\n\t\tMap<Integer, long[]> factMap;\n\t\tvoid prepareFact() {\n\t\t\tfact = new long[MAX_FACT];\n\t\t\tfill(fact, 0);\n\t\t\tinvFact = new long[MAX_FACT];\n\t\t\tfill(invFact, 0);\n\t\t\tfact[0] = 1;\n\t\t\tint maxIndex = min(MAX_FACT, (int)MOD);\n\t\t\tfor(int i = 1; i < maxIndex; i ++) fact[i] = mod(fact[i - 1] * i);\n\t\t\tinvFact[maxIndex - 1] = inv(fact[maxIndex - 1]);\n\t\t\tfor(int i = maxIndex - 1; i > 0; i --) invFact[i - 1] = mod(invFact[i] * i);\n\n\t\t\tfactMap = new HashMap<>();\n\t\t\tisFactPrepared = true;\n\t\t}\n\n\t\tlong P(int n, int r) {\n\t\t\tif(!isFactPrepared) { prepareFact(); }\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\tif(n >= MAX_FACT) {\n\t\t\t\tif(!factMap.containsKey(n)) {\n\t\t\t\t\tlong largeFact[] = new long[MAX_FACT];\n\t\t\t\t\tfactMap.put(n, largeFact);\n\t\t\t\t\tfill(largeFact, -INF);\n\t\t\t\t\tlargeFact[0] = 1;\n\t\t\t\t}\n\t\t\t\tlong largeFact[] = factMap.get(n);\n\t\t\t\tint i = r;\n\t\t\t\twhile(isINF(largeFact[i])) i --;\n\t\t\t\tfor(; i < r; i ++) largeFact[i + 1] = mod(largeFact[i] * (n - i));\n\t\t\t\treturn largeFact[r];\n\t\t\t}\n\t\t\treturn mod(fact[n] * invFact[n - r]);\n\t\t}\n\t\tlong C(int n, int r) {\n\t\t\tif(!isFactPrepared) prepareFact();\n\t\t\tif(n < 0 || r < 0 || n < r) return 0;\n\t\t\treturn mod(P(n, r) * invFact[r]);\n\t\t}\n\t\tlong H(int n, int r) { return C((n - 1) + r, r); }\n\n\n\t\t// grid\n\t\tclass Grids {\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tGrid[][] gs;\n\t\t\tGrid[] gi;\n\t\t\tGrids(int h, int w) {\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tgs = new Grid[h][w];\n\t\t\t\tgi = new Grid[h * w];\n\t\t\t\tfor(int i = 0; i < h; i ++) {\n\t\t\t\t\tfor(int j = 0; j < w; j ++) {\n\t\t\t\t\t\tgs[i][j] = new Grid(i, j, h, w);\n\t\t\t\t\t\tgi[gs[i][j].i] = gs[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid init(boolean[][] b) {\n\t\t\t\tfor(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].b = b[i][j];\n\t\t\t}\n\t\t\tvoid init(long[][] val) {\n\t\t\t\tfor(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].val = val[i][j];\n\t\t\t}\n\n\t\t\tGrid get(int x, int y) { return isValid(x, y, h, w) ? gs[x][y] : null; }\n\t\t\tGrid get(int i) { return get(i / w, i % w); }\n\n\t\t\tint dx[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};\n\t\t\tint dy[] = {0, 0, 0, -1, 1, -1, -1, 1, 1};\n\t\t\tGrid next(int x, int y, int i) { return next(gs[x][y], i); }\n\t\t\tGrid next(Grid g, int i) {\n\t\t\t\treturn isValid(g.x + dx[i], g.y + dy[i], g.h, g.w)\n\t\t\t\t\t? gs[g.x + dx[i]][g.y + dy[i]]\n\t\t\t\t\t: null;\n\t\t\t}\n\t\t}\n\t\tclass Grid implements Comparable<Grid> {\n\t\t\tint x;\n\t\t\tint y;\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tint i;\n\t\t\tboolean b;\n\t\t\tlong val;\n\n\t\t\tGrid() { }\n\t\t\tGrid(int x, int y, int h, int w) { init(x, y, h, w, false, 0); }\n\t\t\tGrid(int x, int y, int h, int w, boolean b) { init(x, y, h, w, b, 0); }\n\t\t\tGrid(int x, int y, int h, int w, long val) { init(x, y, h, w, false, val); }\n\t\t\tGrid(int x, int y, int h, int w, boolean b, long val) { init(x, y, h, w, b, val); }\n\n\t\t\tvoid init(int x, int y, int h, int w, boolean b, long val) {\n\t\t\t\tthis.x = x;\n\t\t\t\tthis.y = y;\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tthis.b = b;\n\t\t\t\tthis.val = val;\n\t\t\t\tthis.i = x * w + y;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+x+\", \"+y+\")\"+\" \"+booleanToString(b)+\" \"+val; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(x, y, h, w, b, val); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tGrid that = (Grid) obj;\n\t\t\t\tif(this.x != that.x) return false;\n\t\t\t\tif(this.y != that.y) return false;\n\t\t\t\tif(this.h != that.h) return false;\n\t\t\t\tif(this.w != that.w) return false;\n\t\t\t\tif(this.b != that.b) return false;\n\t\t\t\tif(this.val != that.val) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Grid that) {\n\t\t\t\tint c = Long.compare(this.val, that.val);\n\t\t\t\tif(c == 0) c = Integer.compare(this.x, that.x);\n\t\t\t\tif(c == 0) c = Integer.compare(this.y, that.y);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\tboolean isValid(int x, int y, int h, int w) { return x >= 0 && x < h && y >= 0 && y < w; }\n\t\tboolean isValid(Grid g) { return isValid(g.x, g.y, g.h, g.w); }\n\n\t\t// graph\n\t\tclass Graph {\n\t\t\tint numNode;\n\t\t\tint numEdge;\n\t\t\tboolean directed;\n\t\t\tSet<Edge> edges = new HashSet<>();\n\t\t\tNode nodes[];\n\t\t\tNode reversedNodes[];\n\n\t\t\tGraph(int numNode, int numEdge, boolean directed) {\n\t\t\t\tthis.numNode = numNode;\n\t\t\t\tthis.numEdge = numEdge;\n\t\t\t\tthis.directed = directed;\n\t\t\t\tnodes = new Node[numNode];\n\t\t\t\treversedNodes = new Node[numNode];\n\t\t\t\tfor(int i = 0; i < numNode; i ++) {\n\t\t\t\t\tnodes[i] = new Node(i);\n\t\t\t\t\treversedNodes[i] = new Node(i);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid init(Set<Edge> edges) {\n\t\t\t\tthis.edges = edges;\n\t\t\t\tfor(Edge e : edges) add(e);\n\t\t\t}\n\n\t\t\tvoid add(Edge e) {\n\t\t\t\tedges.add(e);\n\t\t\t\tnodes[e.source].add(e.target, e.cost);\n\t\t\t\tif(directed) reversedNodes[e.target].add(e.source, e.cost);\n\t\t\t\telse nodes[e.target].add(e.source, e.cost);\n\t\t\t}\n\n\t\t\tvoid remove(Edge e) {\n\t\t\t\tedges.remove(e);\n\t\t\t\tnodes[e.source].remove(e.target, e.cost);\n\t\t\t\tif(directed) reversedNodes[e.target].remove(e.source, e.cost);\n\t\t\t\telse nodes[e.target].remove(e.source, e.cost);\n\t\t\t}\n\n\t\t\tvoid update(Edge e, long cost) {\n\t\t\t\tnodes[e.source].update(e.target, cost);\n\t\t\t\tif(directed) reversedNodes[e.target].update(e.source, cost);\n\t\t\t\telse nodes[e.target].update(e.source, cost);\n\t\t\t\te.cost = cost;\n\t\t\t}\n\t\t\tvoid update(int source, int target, long cost) { update(new Edge(source, target, cost), cost); }\n\n\t\t\tvoid clearNodes() {\n\t\t\t\tfor(Node n : nodes) n.clear();\n\t\t\t\tfor(Node n : reversedNodes) n.clear();\n\t\t\t}\n\t\t}\n\n\t\tclass Node extends HashSet<Edge> {\n\t\t\tint id;\n\n\t\t\tNode(int id) { this.id = id; }\n\t\t\tvoid add(int target, long cost) { add(new Edge(id, target, cost)); }\n\t\t\tvoid remove(int target, long cost) { remove(new Edge(id, target, cost)); }\n\t\t\tvoid update(int target, long cost) { remove(target, cost); add(target, cost); }\n\t\t}\n\n\t\tclass Edge implements Comparable<Edge> {\n\t\t\tint source;\n\t\t\tint target;\n\t\t\tlong cost;\n\t\t\tEdge(int source, int target, long cost) {\n\t\t\t\tthis.source = source;\n\t\t\t\tthis.target = target;\n\t\t\t\tthis.cost = cost;\n\t\t\t}\n\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return source+\" - \"+cost+\" -> \"+target; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(source, target); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tEdge that = (Edge) obj;\n\t\t\t\tif(this.source != that.source) return false;\n\t\t\t\tif(this.target != that.target) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Edge that) {\n\t\t\t\tint c = Long.compare(this.cost, that.cost);\n\t\t\t\tif(c == 0) c = Integer.compare(this.source, that.source);\n\t\t\t\tif(c == 0) c = Integer.compare(this.target, that.target);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\t// Pair, Tuple\n\t\tclass Pair<T extends Comparable<? super T>, U extends Comparable<? super U>> implements Comparable<Pair<T, U>> {\n\t\t\tT a;\n\t\t\tU b;\n\t\t\tPair() { }\n\t\t\tPair(T a, U b) {\n\t\t\t\tthis.a = a;\n\t\t\t\tthis.b = b;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+a.toString()+\", \"+b.toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPair that = (Pair) obj;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(this.b.getClass() != that.b.getClass()) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\tif(!this.b.equals(that.b)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Pair<T, U> that) {\n\t\t\t\tint c = (this.a).compareTo(that.a);\n\t\t\t\tif(c == 0) c = (this.b).compareTo(that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairII implements Comparable<PairII> {\n\t\t\tint a; int b;\n\t\t\tPairII() { }\n\t\t\tPairII(int a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairII that = (PairII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairII that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairIL implements Comparable<PairIL> {\n\t\t\tint a; long b;\n\t\t\tPairIL() { }\n\t\t\tPairIL(int a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairIL that = (PairIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairIL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairID implements Comparable<PairID> {\n\t\t\tint a; double b;\n\t\t\tPairID() { }\n\t\t\tPairID(int a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairID that = (PairID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairID that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLI implements Comparable<PairLI> {\n\t\t\tlong a; int b;\n\t\t\tPairLI() { }\n\t\t\tPairLI(long a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLI that = (PairLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLL implements Comparable<PairLL> {\n\t\t\tlong a; long b;\n\t\t\tPairLL() { }\n\t\t\tPairLL(long a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLL that = (PairLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLD implements Comparable<PairLD> {\n\t\t\tlong a; double b;\n\t\t\tPairLD() { }\n\t\t\tPairLD(long a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLD that = (PairLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDI implements Comparable<PairDI> {\n\t\t\tdouble a; int b;\n\t\t\tPairDI() { }\n\t\t\tPairDI(double a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDI that = (PairDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDL implements Comparable<PairDL> {\n\t\t\tdouble a; long b;\n\t\t\tPairDL() { }\n\t\t\tPairDL(double a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDL that = (PairDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDD implements Comparable<PairDD> {\n\t\t\tdouble a; double b;\n\t\t\tPairDD() { }\n\t\t\tPairDD(double a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDD that = (PairDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\tinterface ITuple {\n\t\t\tpublic StringBuilder toStringBuilder();\n\t\t\t@Override\n\t\t\tpublic String toString();\n\t\t\t@Override\n\t\t\tpublic int hashCode();\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj);\n\t\t}\n\t\tclass BasicTuple<T extends ITuple & Comparable<? super T>, V extends Comparable<? super V>> implements Comparable<BasicTuple> {\n\t\t\tT t;\n\t\t\tV a;\n\t\t\tBasicTuple() { }\n\n\t\t\tStringBuilder sbTuple = new StringBuilder();\n\t\t\tpublic StringBuilder toStringBuilder() {\n\t\t\t\tsbTuple.setLength(0);\n\t\t\t\treturn sbTuple.append(t.toStringBuilder()).append(\", \").append(a);\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+toStringBuilder().toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(t, a); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tBasicTuple that = (BasicTuple) obj;\n\t\t\t\tif(this.t.getClass() != that.t.getClass()) return false;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(!this.t.equals(that.t)) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tpublic int compareTo(BasicTuple that) {\n\t\t\t\tint c = (this.t).compareTo((T) (Object) that.t);\n\t\t\t\tif(c == 0) c = (this.a).compareTo((V) (Object) that.a);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass UniqueTuple<V extends Comparable<? super V>> implements ITuple, Comparable<UniqueTuple> {\n\t\t\tV a;\n\t\t\tUniqueTuple() { }\n\n\t\t\tStringBuilder sbTuple = new StringBuilder();\n\t\t\tpublic StringBuilder toStringBuilder() {\n\t\t\t\tsbTuple.setLength(0);\n\t\t\t\treturn sbTuple.append(a);\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+toStringBuilder().toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(a); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tUniqueTuple that = (UniqueTuple) obj;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tpublic int compareTo(UniqueTuple that) {\n\t\t\t\treturn (this.a).compareTo((V) (Object) that.a);\n\t\t\t}\n\t\t}\n\n\t\tclass Tuple1<T0 extends Comparable<? super T0>> extends UniqueTuple<T0> implements ITuple {\n\t\t\tTuple1() { super(); }\n\t\t\tTuple1(T0 a0) {\n\t\t\t\tsuper();\n\t\t\t\tthis.a = a0;\n\t\t\t}\n\t\t\tT0 get0() { return a; }\n\t\t\tvoid set0(T0 x) { a = x; }\n\t\t}\n\t\tclass Tuple2<\n\t\t\t\tT0 extends Comparable<? super T0>,\n\t\t\t\tT1 extends Comparable<? super T1>>\n\t\t\t\textends BasicTuple<Tuple1<T0>, T1> implements ITuple {\n\t\t\tTuple2() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple2(T0 a0, T1 a1) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple1(a0);\n\t\t\t\tthis.a = a1;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { a = x; }\n\t\t}\n\t\tclass Tuple3<\n\t\t\t\tT0 extends Comparable<? super T0>,\n\t\t\t\tT1 extends Comparable<? super T1>,\n\t\t\t\tT2 extends Comparable<? super T2>>\n\t\t\t\textends BasicTuple<Tuple2<T0, T1>, T2> implements ITuple {\n\t\t\tTuple3() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple3(T0 a0, T1 a1, T2 a2) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple2(a0, a1);\n\t\t\t\tthis.a = a2;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { a = x; }\n\t\t}\n\t\tclass Tuple4<\n\t\t\t\tT0 extends Comparable<? super T0>,\n\t\t\t\tT1 extends Comparable<? super T1>,\n\t\t\t\tT2 extends Comparable<? super T2>,\n\t\t\t\tT3 extends Comparable<? super T3>>\n\t\t\t\textends BasicTuple<Tuple3<T0, T1, T2>, T3> implements ITuple {\n\t\t\tTuple4() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple4(T0 a0, T1 a1, T2 a2, T3 a3) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple3(a0, a1, a2);\n\t\t\t\tthis.a = a3;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { a = x; }\n\t\t}\n\t\tclass Tuple5<\n\t\t\t\tT0 extends Comparable<? super T0>,\n\t\t\t\tT1 extends Comparable<? super T1>,\n\t\t\t\tT2 extends Comparable<? super T2>,\n\t\t\t\tT3 extends Comparable<? super T3>,\n\t\t\t\tT4 extends Comparable<? super T4>>\n\t\t\t\textends BasicTuple<Tuple4<T0, T1, T2, T3>, T4> implements ITuple {\n\t\t\tTuple5() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple5(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple4(a0, a1, a2, a3);\n\t\t\t\tthis.a = a4;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { a = x; }\n\t\t}\n\t\tclass Tuple6<\n\t\t\t\tT0 extends Comparable<? super T0>,\n\t\t\t\tT1 extends Comparable<? super T1>,\n\t\t\t\tT2 extends Comparable<? super T2>,\n\t\t\t\tT3 extends Comparable<? super T3>,\n\t\t\t\tT4 extends Comparable<? super T4>,\n\t\t\t\tT5 extends Comparable<? super T5>>\n\t\t\t\textends BasicTuple<Tuple5<T0, T1, T2, T3, T4>, T5> implements ITuple {\n\t\t\tTuple6() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple6(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple5(a0, a1, a2, a3, a4);\n\t\t\t\tthis.a = a5;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { a = x; }\n\t\t}\n\t\tclass Tuple7<\n\t\t\t\tT0 extends Comparable<? super T0>,\n\t\t\t\tT1 extends Comparable<? super T1>,\n\t\t\t\tT2 extends Comparable<? super T2>,\n\t\t\t\tT3 extends Comparable<? super T3>,\n\t\t\t\tT4 extends Comparable<? super T4>,\n\t\t\t\tT5 extends Comparable<? super T5>,\n\t\t\t\tT6 extends Comparable<? super T6>>\n\t\t\t\textends BasicTuple<Tuple6<T0, T1, T2, T3, T4, T5>, T6> implements ITuple {\n\t\t\tTuple7() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple7(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5, T6 a6) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple6(a0, a1, a2, a3, a4, a5);\n\t\t\t\tthis.a = a6;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return t.get5(); }\n\t\t\tT6 get6() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { t.set5(x); }\n\t\t\tvoid set6(T6 x) { a = x; }\n\t\t}\n\t\tclass Tuple8<\n\t\t\t\tT0 extends Comparable<? super T0>,\n\t\t\t\tT1 extends Comparable<? super T1>,\n\t\t\t\tT2 extends Comparable<? super T2>,\n\t\t\t\tT3 extends Comparable<? super T3>,\n\t\t\t\tT4 extends Comparable<? super T4>,\n\t\t\t\tT5 extends Comparable<? super T5>,\n\t\t\t\tT6 extends Comparable<? super T6>,\n\t\t\t\tT7 extends Comparable<? super T7>>\n\t\t\t\textends BasicTuple<Tuple7<T0, T1, T2, T3, T4, T5, T6>, T7> implements ITuple {\n\t\t\tTuple8() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple8(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5, T6 a6, T7 a7) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple7(a0, a1, a2, a3, a4, a5, a6);\n\t\t\t\tthis.a = a7;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return t.get5(); }\n\t\t\tT6 get6() { return t.get6(); }\n\t\t\tT7 get7() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { t.set5(x); }\n\t\t\tvoid set6(T6 x) { t.set6(x); }\n\t\t\tvoid set7(T7 x) { a = x; }\n\t\t}\n\n\t\tclass TupleIII implements Comparable<TupleIII> {\n\t\t\tint a; int b; int c;\n\t\t\tTupleIII() { }\n\t\t\tTupleIII(int a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIII that = (TupleIII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIII that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIIL implements Comparable<TupleIIL> {\n\t\t\tint a; int b; long c;\n\t\t\tTupleIIL() { }\n\t\t\tTupleIIL(int a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIIL that = (TupleIIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIIL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIID implements Comparable<TupleIID> {\n\t\t\tint a; int b; double c;\n\t\t\tTupleIID() { }\n\t\t\tTupleIID(int a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIID that = (TupleIID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIID that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILI implements Comparable<TupleILI> {\n\t\t\tint a; long b; int c;\n\t\t\tTupleILI() { }\n\t\t\tTupleILI(int a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILI that = (TupleILI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILI that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILL implements Comparable<TupleILL> {\n\t\t\tint a; long b; long c;\n\t\t\tTupleILL() { }\n\t\t\tTupleILL(int a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILL that = (TupleILL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILD implements Comparable<TupleILD> {\n\t\t\tint a; long b; double c;\n\t\t\tTupleILD() { }\n\t\t\tTupleILD(int a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILD that = (TupleILD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILD that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDI implements Comparable<TupleIDI> {\n\t\t\tint a; double b; int c;\n\t\t\tTupleIDI() { }\n\t\t\tTupleIDI(int a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDI that = (TupleIDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDI that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDL implements Comparable<TupleIDL> {\n\t\t\tint a; double b; long c;\n\t\t\tTupleIDL() { }\n\t\t\tTupleIDL(int a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDL that = (TupleIDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDD implements Comparable<TupleIDD> {\n\t\t\tint a; double b; double c;\n\t\t\tTupleIDD() { }\n\t\t\tTupleIDD(int a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDD that = (TupleIDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDD that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLII implements Comparable<TupleLII> {\n\t\t\tlong a; int b; int c;\n\t\t\tTupleLII() { }\n\t\t\tTupleLII(long a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLII that = (TupleLII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLII that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLIL implements Comparable<TupleLIL> {\n\t\t\tlong a; int b; long c;\n\t\t\tTupleLIL() { }\n\t\t\tTupleLIL(long a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLIL that = (TupleLIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLIL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLID implements Comparable<TupleLID> {\n\t\t\tlong a; int b; double c;\n\t\t\tTupleLID() { }\n\t\t\tTupleLID(long a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLID that = (TupleLID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLID that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLI implements Comparable<TupleLLI> {\n\t\t\tlong a; long b; int c;\n\t\t\tTupleLLI() { }\n\t\t\tTupleLLI(long a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLI that = (TupleLLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLL implements Comparable<TupleLLL> {\n\t\t\tlong a; long b; long c;\n\t\t\tTupleLLL() { }\n\t\t\tTupleLLL(long a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLL that = (TupleLLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLD implements Comparable<TupleLLD> {\n\t\t\tlong a; long b; double c;\n\t\t\tTupleLLD() { }\n\t\t\tTupleLLD(long a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLD that = (TupleLLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDI implements Comparable<TupleLDI> {\n\t\t\tlong a; double b; int c;\n\t\t\tTupleLDI() { }\n\t\t\tTupleLDI(long a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDI that = (TupleLDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDL implements Comparable<TupleLDL> {\n\t\t\tlong a; double b; long c;\n\t\t\tTupleLDL() { }\n\t\t\tTupleLDL(long a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDL that = (TupleLDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDD implements Comparable<TupleLDD> {\n\t\t\tlong a; double b; double c;\n\t\t\tTupleLDD() { }\n\t\t\tTupleLDD(long a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDD that = (TupleLDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDII implements Comparable<TupleDII> {\n\t\t\tdouble a; int b; int c;\n\t\t\tTupleDII() { }\n\t\t\tTupleDII(double a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDII that = (TupleDII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDII that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDIL implements Comparable<TupleDIL> {\n\t\t\tdouble a; int b; long c;\n\t\t\tTupleDIL() { }\n\t\t\tTupleDIL(double a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDIL that = (TupleDIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDIL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDID implements Comparable<TupleDID> {\n\t\t\tdouble a; int b; double c;\n\t\t\tTupleDID() { }\n\t\t\tTupleDID(double a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDID that = (TupleDID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDID that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLI implements Comparable<TupleDLI> {\n\t\t\tdouble a; long b; int c;\n\t\t\tTupleDLI() { }\n\t\t\tTupleDLI(double a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLI that = (TupleDLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLL implements Comparable<TupleDLL> {\n\t\t\tdouble a; long b; long c;\n\t\t\tTupleDLL() { }\n\t\t\tTupleDLL(double a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLL that = (TupleDLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLD implements Comparable<TupleDLD> {\n\t\t\tdouble a; long b; double c;\n\t\t\tTupleDLD() { }\n\t\t\tTupleDLD(double a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLD that = (TupleDLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDI implements Comparable<TupleDDI> {\n\t\t\tdouble a; double b; int c;\n\t\t\tTupleDDI() { }\n\t\t\tTupleDDI(double a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDI that = (TupleDDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDL implements Comparable<TupleDDL> {\n\t\t\tdouble a; double b; long c;\n\t\t\tTupleDDL() { }\n\t\t\tTupleDDL(double a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDL that = (TupleDDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDD implements Comparable<TupleDDD> {\n\t\t\tdouble a; double b; double c;\n\t\t\tTupleDDD() { }\n\t\t\tTupleDDD(double a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDD that = (TupleDDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\npublic void solve() {\n\tint h = ni();\n\tint w = ni();\n\tint num = ni();\n\tlong val[][] = new long[h][w];\n\tfor(int i = 0; i < num; i ++) {\n\t\tval[ni() - 1][ni() - 1] = nl();\n\t}\n\tlong dp[][][] = new long[h][w][4];\n\tfill(dp, 0);\n\tdp[0][0][1] = val[0][0];\n\tfor(int i = 0; i < h; i ++) {\n\t\tfor(int j = 0; j < w; j ++) {\n\t\t\tfor(int k = 0; k < 4; k ++) {\n\t\t\t\tif(i > 0) dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k]);\n\t\t\t\tif(j > 0) dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k]);\n\t\t\t\tif(i > 0) dp[i][j][1] = max(dp[i][j][1], dp[i - 1][j][k] + val[i][j]);\n\t\t\t}\n\t\t\tfor(int k = 1; k < 4; k ++) {\n\t\t\t\tif(j > 0) dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k - 1] + val[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tprtln(max(dp[h - 1][w - 1]));\n}\n\n\n\n\t}\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n EPickingGoods solver = new EPickingGoods();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class EPickingGoods {\n public void solve(int testNumber, FastReader s, PrintWriter w) {\n int r = s.nextInt(), c = s.nextInt(), k = s.nextInt();\n int[][] v = new int[r + 1][c + 1];\n while (k-- > 0) v[s.nextInt()][s.nextInt()] = s.nextInt();\n long[][][] dp = new long[4][r + 1][c + 1];\n for (int i = 1; i <= r; i++) {\n for (int j = 1; j <= c; j++) {\n for (int m = 0; m <= 3; m++) {\n dp[1][i][j] = Math.max(dp[1][i][j], dp[m][i - 1][j] + v[i][j]);\n dp[0][i][j] = Math.max(dp[0][i][j], dp[m][i - 1][j]);\n if (m == 0) continue;\n dp[m][i][j] = func.max(dp[m - 1][i][j - 1] + v[i][j],\n dp[m][i - 1][j], dp[m][i][j - 1],\n dp[m][i][j]);\n }\n }\n }\n w.println(func.max(dp[3][r][c], dp[2][r][c], dp[1][r][c], dp[0][r][c]));\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n\n if (numChars == -1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n\n curChar = 0;\n\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (numChars <= 0)\n return -1;\n }\n\n return buf[curChar++];\n }\n\n public int nextInt() {\n\n int c = read();\n\n while (isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n\n if (filter != null)\n return filter.isSpaceChar(c);\n\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class func {\n public static long max(long... v) {\n long max = Integer.MIN_VALUE;\n for (long i : v) max = Math.max(max, i);\n return max;\n }\n\n }\n}\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 3000 + 7;\nint n;\nint m;\nint k;\nll a[N][N];\nll dp[N][N][4];\nll tot[N][N];\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> n >> m >> k;\n for (int i = 1; i <= k; i++) {\n int r, c, x;\n cin >> r >> c >> x;\n a[r][c] = x;\n }\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n for (int k = 1; k <= 3; k++) {\n dp[i][j][k] = max(dp[i][j - 1][k], tot[i - 1][j] + a[i][j]);\n dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k - 1] + a[i][j]);\n }\n for (int k = 1; k <= 3; k++) {\n tot[i][j] = max(tot[i][j], dp[i][j][k]);\n }\n }\n }\n cout << tot[n][m] << \"\\n\";\n return 0;\n}\n", "#include \"bits/stdc++.h\"\n\nusing namespace std;\nusing ll = long long;\n\nconst int mx = 3000 + 9;\n\nint R, C, K;\nll g[mx][mx];\nll dp[mx][mx][4];\n\nll solve(int i, int j, int k) {\n if (i > R) return 0;\n if (j > C) return 0;\n ll& ans = dp[i][j][k];\n if (ans != -1) return ans;\n\n ans = 0;\n if (k > 0) {\n ans = max(ans, g[i][j] + solve(i, j + 1, k - 1));\n ans = max(ans, g[i][j] + solve(i + 1, j, 3));\n }\n\n ans = max(ans, solve(i, j + 1, k));\n ans = max(ans, solve(i + 1, j, 3));\n \n return ans;\n}\n\nint main() {\n scanf(\"%d %d %d\", &R, &C, &K);\n for (int i = 0; i < K; i++) {\n int r, c; ll v;\n scanf(\"%d %d %lld\", &r, &c, &v);\n g[r][c] = v;\n }\n\n memset(dp, -1, sizeof dp);\n ll ans = solve(1, 1, 3);\n printf(\"%lld\\n\", ans);\n}", "#include<cstdio>\n#include<algorithm>\n#include<vector>\nusing namespace std;\ntypedef long long ll;\nconst int MAXN = 3e3 + 5;\nconst int MAXM = 3e3 + 5;\n\nint a[MAXN][MAXN];\n\nint main(void)\n{\n\tint n,m,d;\n\tscanf(\"%d%d%d\",&n,&m,&d);\n\tfor(int i=1; i<=d; ++i)\n\t{\n\t\tint x,y,v;\n\t\tscanf(\"%d%d%d\",&x,&y,&v);\n\t\ta[x][y] = v;\n\t}\n\t\n\tstatic ll f[MAXN][MAXM][5];\n\tfor(int i=1; i<=n; ++i)\n\t\tfor(int j=1; j<=m; ++j)\n\t\t{\n\t\t\tll lst = max(max(f[i-1][j][0], f[i-1][j][1]), max(f[i-1][j][2], f[i-1][j][3]));\n\t\t\t\n\t\t\tf[i][j][0] = max(f[i][j-1][0], lst);\n\t\t\tf[i][j][1] = max(f[i][j-1][1], f[i][j][0] + a[i][j]);\n\t\t\tf[i][j][2] = max(f[i][j-1][2], f[i][j-1][1] + a[i][j]);\n\t\t\tf[i][j][3] = max(f[i][j-1][3], f[i][j-1][2] + a[i][j]);\n\t\t}\n\t\n\tprintf(\"%lld\\n\",max(max(f[n][m][0], f[n][m][1]), max(f[n][m][2], f[n][m][3])));\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define endl \"\\n\"\n\nll g[3010][3010], dp[3010][3010][5];\nint r,c,k,x,y;\n\nll solve(int rr, int cc, int cnt)\n{\n if(rr>r || rr<1 || cc>c || c<1) return 0;\n if(dp[rr][cc][cnt]!= -1) return dp[rr][cc][cnt];\n\n ll ans=0;\n ans = max({solve(rr,cc+1,cnt), solve(rr+1, cc, 0), ans});\n if(cnt<3)\n ans = max({g[rr][cc]+solve(rr,cc+1,cnt+1), g[rr][cc]+solve(rr+1, cc, 0), ans});\n\n dp[rr][cc][cnt]=ans;\n return ans;\n}\nint main()\n{\n memset(dp, -1, sizeof(dp));\n cin>>r>>c>>k;\n for(int i=0; i<k; i++)\n {\n cin>>x>>y;\n cin>>g[x][y];\n }\n\n cout<<solve(1,1,0);\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\n\nint main()\n{\n ios::sync_with_stdio(0);\n cin.tie(0);\n int r,c,k;\n cin >> r >> c >> k;\n vector<vector<int>> v(r+1,vector<int>(c+1,0));\n for(int i=0;i<k;i++)\n {\n int a,b,w;\n cin >> a >> b >> w;\n v[a][b]=w;\n }\n vector<array<ll,4>> now(c+1,{0,0,0,0});\n for(int o=1;o<=r;o++)\n {\n vector<array<ll,4>> nxt(c+1,{0,0,0,0});\n for(int i=1;i<=c;i++)\n {\n nxt[i][0]=max(max({now[i][0],now[i][1],now[i][2],now[i][3]}),nxt[i-1][0]);\n for(int j=3;j>=1;j--) nxt[i][j]=max(nxt[i-1][j],max(nxt[i-1][j-1],nxt[i][j-1])+v[o][i]);\n }\n now=nxt;\n }\n ll res=0;\n for(int j=0;j<=3;j++) res=max(res,now[c][j]);\n cout << res << \"\\n\";\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint a[3010][3010];\nlong long dp[3010][3010][4];\nint n,m,k;\n\nint main()\n{\n\tscanf(\"%d%d%d\",&n,&m,&k);\n\tint x,y,c;\n\tfor(int i=1;i<=k;i++)\n\t{\n\t\tscanf(\"%d%d%d\",&x,&y,&c);\n\t\ta[x][y]=c;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=1;j<=m;j++)\n\t\t{\n\t\t\tdp[i][j][0]=max(dp[i][j-1][0],max(max(dp[i-1][j][0],dp[i-1][j][1]),max(dp[i-1][j][2],dp[i-1][j][3])));\n\t\t\tdp[i][j][1]=max(dp[i][j-1][0],max(max(dp[i-1][j][0],dp[i-1][j][1]),max(dp[i-1][j][2],dp[i-1][j][3])))+a[i][j];\n\t\t\tfor(int k=1;k<=3;k++)\n\t\t\t{\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k]);\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k-1]+a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",max(max(dp[n][m][0],dp[n][m][1]),max(dp[n][m][2],dp[n][m][3])));\n} ", "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tint r = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tlong[][] rcv = new long[r][c];\n\t\tfor(int i = 0; i < K; i++){\n\t\t\tint x = sc.nextInt()-1;\n\t\t\tint y = sc.nextInt()-1;\n\t\t\trcv[x][y] = sc.nextLong();\n\t\t}\n\t\t\n\t\t// 計算\n\t\tlong result = 0;\n\t\tlong[][][] dp = new long[r][c][4];\n\t\tif(rcv[0][0] > 0) dp[0][0][1] = rcv[0][0];\n\t\tfor(int i = 0; i < r; i++){\n\t\t for(int j = 0; j < c; j++){\n\t\t for(int k = 0; k < 4; k++){\n\t\t if(j-1 >= 0) dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k]);\n\t\t if(j-1 >= 0 && k-1 >= 0) dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k-1] + rcv[i][j]);\n\t\t if(i-1 >= 0) dp[i][j][0] = max(dp[i][j][0], dp[i-1][j][k]);\n\t\t if(i-1 >= 0) dp[i][j][1] = max(dp[i][j][1], dp[i-1][j][k] + rcv[i][j]);\n\t\t }\n\t\t }\n\t\t}\n\t\t\n\t\tfor(int k = 0; k < 4; k++){\n\t\t result = max(result, dp[r-1][c-1][k]);\n\t\t}\n\t\t//System.out.println(Arrays.deepToString(dp));\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br; private StringTokenizer tok;\n\t\tpublic Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}\n\t\tprivate void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}\n\t\tprivate boolean hasNext() { return tok != null && tok.hasMoreTokens();}\n\t\tpublic String next() throws IOException { getLine(); return tok.nextToken();}\n\t\tpublic int nextInt() throws IOException { return Integer.parseInt(next());}\n\t\tpublic long nextLong() throws IOException { return Long.parseLong(next());}\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next());}\n\t}\n}\n", "import java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint R = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tint[][] v = new int[R][C];\n\t\t\n\t\tfor(int i=0; i<K; i++) {\n\t\t\tv[sc.nextInt()-1][sc.nextInt()-1] = sc.nextInt();\n\t\t}\n\n\t\tlong[][][] dp = new long[R][C][4];\n\t\tif(v[0][0]>0)\n\t\t\tdp[0][0][1] = v[0][0];\n\t\tfor(int i=0; i<R; i++) {\n\t\t\tfor(int j=0; j<C; j++) {\n\t\t\t\tif(i>0) {\n\t\t\t\t\tfor(int k=0; k<4; k++)\n\t\t\t\t\t\tdp[i][j][0] = Math.max(dp[i][j][0], dp[i-1][j][k]);\n\t\t\t\t\tif(v[i][j]>0) {\n\t\t\t\t\t\tfor(int k=0; k<4; k++)\n\t\t\t\t\t\t\tdp[i][j][1] = Math.max(dp[i][j][1], dp[i-1][j][k]+v[i][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(j>0) {\n\t\t\t\t\tfor(int k=0; k<4; k++)\n\t\t\t\t\t\tdp[i][j][k] = Math.max(dp[i][j][k], dp[i][j-1][k]);\n\t\t\t\t\tif(v[i][j]>0) {\n\t\t\t\t\t\tfor(int k=0; k<3; k++)\n\t\t\t\t\t\t\tdp[i][j][k+1] = Math.max(dp[i][j][k+1], dp[i][j-1][k]+v[i][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor(int i=0; i<4; i++)\n\t\t\tans = Math.max(ans, dp[R-1][C-1][i]);\n\t\tSystem.out.println(ans);\n\t\t\n\t\tsc.close();\n\t}\n\t\n}\n\n", "R,C,K = map(int, input().split())\na = [[0] * (C+1) for i in range(R+1)]\ndp = [[[0] * (C+1) for i in range(R+1)] for j in range(4)]\nfor i in range(K):\n r,c,v = map(int, input().split())\n a[r-1][c-1] = v\n \nfor i in range(R):\n for j in range(C):\n for k in range(2,-1,-1):\n dp[k+1][i][j] = max(dp[k+1][i][j], dp[k][i][j] + a[i][j])\n for k in range(4):\n dp[0][i+1][j] = max(dp[0][i+1][j], dp[k][i][j])\n dp[k][i][j+1] = max(dp[k][i][j+1], dp[k][i][j])\nans = 0\nfor k in range(4):\n ans = max(ans, dp[k][R-1][C-1])\nprint(ans)", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.IntUnaryOperator;\nimport java.util.function.LongUnaryOperator;\n\npublic class Main {\n static In in = new In();\n static Out out = new Out();\n static final long inf = 0x1fffffffffffffffL;\n static final int iinf = 0x3fffffff;\n static final double eps = 1e-9;\n static long mod = 1000000007;\n\n void solve() {\n int w = in.nextInt();\n int h = in.nextInt();\n int m = in.nextInt();\n long[][] first = new long[w][h];\n for (int i = 0; i < m; i++) {\n int x = in.nextInt() - 1;\n int y = in.nextInt() - 1;\n first[x][y] = in.nextLong();\n }\n long[][][] dp = new long[w + 1][h + 1][4];\n for (int i = 0; i <= w; i++) {\n for (int j = 0; j <= h; j++) {\n for (int k = 0; k < 4; k++) {\n dp[i][j][k] = -inf;\n }\n }\n }\n if (first[0][0] > 0) {\n dp[0][0][1] = first[0][0];\n }\n dp[0][0][0] = 0;\n for (int i = 0; i < w; i++) {\n for (int j = 0; j < h; j++) {\n for (int k = 0; k < 4; k++) {\n dp[i][j + 1][k] = Math.max(dp[i][j + 1][k], dp[i][j][k]);\n dp[i + 1][j][0] = Math.max(dp[i + 1][j][0], dp[i][j][k]);\n if (j + 1 < h && first[i][j + 1] > 0 && k <= 2) {\n dp[i][j + 1][k + 1] = Math.max(dp[i][j + 1][k + 1], dp[i][j][k] + first[i][j + 1]);\n }\n if (i + 1 < w && first[i + 1][j] > 0) {\n dp[i + 1][j][1] = Math.max(dp[i + 1][j][1], dp[i][j][k] + first[i + 1][j]);\n }\n }\n }\n }\n long ans = -inf;\n for (int i = 0; i < 4; i++) {\n ans = Math.max(ans, dp[w - 1][h - 1][i]);\n }\n out.println(ans);\n }\n\n public static void main(String[]$) {\n new Main().solve();\n out.flush();\n }\n}\n\nclass In {\n private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);\n private StringTokenizer tokenizer;\n\n String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n } catch (IOException ignored) {\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n char[] nextCharArray() {\n return next().toCharArray();\n }\n\n char[][] nextCharGrid(int n, int m) {\n char[][] a = new char[n][m];\n for (int i = 0; i < n; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n int[] nextIntArray(int n, IntUnaryOperator op) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsInt(nextInt());\n }\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n long[] nextLongArray(int n, LongUnaryOperator op) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsLong(nextLong());\n }\n return a;\n }\n\n List<List<Integer>> nextEdges(int n, int m) {\n List<List<Integer>> res = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n res.add(new ArrayList<>());\n }\n for (int i = 0; i < m; i++) {\n int u = nextInt() - 1;\n int v = nextInt() - 1;\n res.get(u).add(v);\n res.get(v).add(u);\n }\n return res;\n }\n}\n\nclass Out {\n private PrintWriter out = new PrintWriter(System.out);\n boolean autoFlush = false;\n\n void println(Object... a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (Object obj : a) {\n joiner.add(String.valueOf(obj));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(char[] s) {\n out.println(String.valueOf(s));\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(int[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (int i : a) {\n joiner.add(Integer.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(long[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (long i : a) {\n joiner.add(Long.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void flush() {\n out.flush();\n }\n}\n", "#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\nusing namespace std;\nconst int N = 3e3 + 5, mod = 1e9 + 7;\n\nll a[N][N], dp[N][N][4];\nint mark[N][N][4], n, m, k;\n\nll solve(int r, int c, int kam){\n if(r >= n || c >= m || kam >= 3) return 0;\n if(mark[r][c][kam]) return dp[r][c][kam];\n mark[r][c][kam] = 1;\n ll op1 = a[r][c] + solve(r, c + 1, kam + 1);\n ll op2 = solve(r, c + 1, kam);\n ll op3 = a[r][c] + solve(r + 1, c, 0);\n return dp[r][c][kam] = max({op1, op2, op3});\n}\n\nint main(){\n ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);\n cin >> n >> m >> k;\n for(int i = 0; i < k; i++){\n int x, y, val;\n cin >> x >> y >> val;\n x--;\n y--;\n a[x][y] = val;\n }\n cout << solve(0, 0, 0);\n\n return 0;\n}\n", "# -*- coding: utf-8 -*-\n\nR,C,K = map(int, input().split())\n\nitems = [[0 for _ in range(C+1)] for _ in range(R+1)]\nfor i in range(K):\n r,c,v = map(int, input().split())\n items[r][c] = v\n\nDP_prev = [0 for _ in range(C+1)]\nDP1 = [0 for _ in range(C+1)]\nDP2 = [0 for _ in range(C+1)]\nDP3 = [0 for _ in range(C+1)]\nfor r in range(1,R+1):\n for c in range(1,C+1):\n item = items[r][c]\n DP1[c] = max(DP_prev[c]+item,DP1[c-1])\n DP2[c] = max(DP1[c],DP2[c-1],DP1[c-1]+item)\n DP3[c] = max(DP2[c],DP3[c-1],DP2[c-1]+item)\n DP_prev = DP3\n \nprint(DP_prev[C])", "#include <bits/stdc++.h>\n#define roop(i, n) for(int i = 0; i < (n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n#define chmax(x, y) x = max(x, y)\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n int R, C, K;\n cin >> R >> C >> K;\n roop(i, K){\n int r, c, v;\n cin >> r >> c >> v;\n a[r - 1][c - 1] = v;\n }\n roop(i, R){\n roop(j, C){\n for(int k = 2; k >= 0; k--){\n chmax(dp[i][j][k + 1], dp[i][j][k] + a[i][j]);\n }\n roop(k, 4){\n chmax(dp[i + 1][j][0], dp[i][j][k]);\n chmax(dp[i][j + 1][k], dp[i][j][k]);\n }\n }\n }\n ll ans = 0;\n roop(k, 4){\n chmax(ans, dp[R - 1][C - 1][k]);\n }\n cout << ans << endl;\n return 0;\n}", "#include<bits/stdc++.h>\n#define MAX 3000\n#define MOD 1000000007\nusing namespace std;\nint r,c,k;\nint v[MAX+1][MAX+1];\nlong long dp[MAX+1][MAX+1][4];\nbool valid(int x,int y)\n{\n\treturn (x>=1&&x<=r&&y>=1&&y<=c);\n}\nlong long go(int x,int y,int used)\n{\n\tif(!valid(x,y))\n\t\treturn 0;\n\tif(dp[x][y][used]^-1)\n\t\treturn dp[x][y][used];\n\tlong long a = 0, c = 0;\n\tif(used<3)\n\t\ta = v[x][y]*1LL+go(x,y+1,used+1), c = v[x][y]*1LL+go(x+1,y,0);\n\tlong long b = go(x,y+1,used), d = go(x+1,y,0);\n\treturn dp[x][y][used]=max({a,b,c,d});\n}\nint main()\n{\n\tios_base::sync_with_stdio(false);\n\tcin.tie(NULL);\t\n\tcin>>r>>c>>k;\n\tfor(int i=1;i<=r;++i)\n\t\tfor(int j=1;j<=c;++j)\n\t\t\tfor(int t=0;t<4;++t)\n\t\t\t\tdp[i][j][t] = -1;\n\twhile(k--)\n\t{\n\t\tint x,y,w;\n\t\tcin>>x>>y>>w;\n\t\tv[x][y] = w;\n\t}\n\tcout<<go(1,1,0)<<endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n\n#define int long long \n\nconst int N = 3003;\n\nint dp[N][N][4], r, c;\n\nint v[N][N];\n\n\nint f(int i, int j, int k) {\n\tif(i == r && j == c) {\n\t\tif(!k) return 0;\n\t\treturn v[i][j];\n\t}\n\tint res = 0;\n\tif(~dp[i][j][k]) {\n\t\treturn dp[i][j][k];\n\t}\n\tif(i + 1 <= r) {\n\t\tres = max(res, f(i + 1, j, 3));\n\t\tif(k) {\n\t\t\tres = max(res, f(i + 1, j, 3) + v[i][j]);\n\t\t}\n\t}\n\tif(j + 1 <= c) {\n\t\tres = max(res, f(i, j + 1, k));\n\t\tif(k) {\n\t\t\tres = max(res, f(i, j + 1, k - 1) + v[i][j]);\n\t\t}\n\t}\n\treturn dp[i][j][k] = res;\n}\n\n\nint32_t main() {\n\tios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);\n\tint k; cin >> r >> c >> k;\n\tfor(int i = 1; i <= k; i++) {\n\t\tint x, y, z; cin >> x >> y >> z;\n\t\tv[x][y] += z;\n\t}\n\n\t\n\tmemset(dp, -1, sizeof dp);\n\tcout << f(1, 1, 3) << endl;\n}", "#include<bits/stdc++.h>\n#define pf printf\n#define sc(x) scanf(\"%d\",&x);\n#define scs(x) scanf(\"%s\",x);\n#define scl(x) scanf(\"%lld\",&x);\n#define rep(i,s,e) for(int i=s; i<=e; ++i)\n#define dep(i,s,e) for(int i=s; i>=e; --i)\ntypedef long long ll;\nusing namespace std;\nconst int Max=2e5+5;\nll a[3005][3005]; \nint main()\n{\n\tll r,c,k;\n\tscl(r);scl(c);scl(k);\n\tfor(ll i=1;i<=k;i++){\n\t\tll u,v,co;scl(u);scl(v);scl(co);\n\t\ta[u][v]=co;\n\t}ll maxx=0;\n\tfor(int i=1;i<=r;i++){\n\t\tll max1=0,max2=0,max3=0;\n\t\tfor(int j=1;j<=c;j++){\n\t\t\tmax3=max(max3,max2+a[i][j]);max2=max(max2,max1+a[i][j]);max1=max(max1,a[i-1][j]+a[i][j]);\n\t\t\ta[i][j]=max(max1,max(max2,max3));maxx=max(maxx,a[i][j]);\n\t\t}\n\t}pf(\"%lld\\n\",maxx);\n}\n", "# pypy\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\n\nR, C, K = map(int, readline().split())\nrcv = list(map(int, read().split()))\nrr = rcv[::3]\ncc = rcv[1::3]\nvv = rcv[2::3]\nrc2v = {}\nfor _r, _c, _v in zip(rr, cc, vv):\n rc2v[(_r-1, _c-1)] = _v\n\ndp = [[0]*4 for c in range(C)]\n\nfor r in range(R):\n for c in range(C):\n if(c!=0):\n dp[c][0] = max(dp[c-1][0], max(dp[c]))\n else:\n dp[c][0] = max(dp[c])\n\n v = 0\n if (r, c) in rc2v:\n v = rc2v[(r, c)]\n for k in range(1,4):\n if(c!=0):\n dp[c][k] = max(dp[c-1][k], dp[c-1][k-1] + v, dp[c][0] + v)\n else:\n dp[c][k] = dp[c][0] + v\n\nprint(max(dp[-1]))", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] sa = br.readLine().split(\" \");\n\t\tint h = Integer.parseInt(sa[0]);\n\t\tint w = Integer.parseInt(sa[1]);\n\t\tint k = Integer.parseInt(sa[2]);\n\t\tint[][] v = new int[h + 1][w + 1];\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tsa = br.readLine().split(\" \");\n\t\t\tint r = Integer.parseInt(sa[0]);\n\t\t\tint c = Integer.parseInt(sa[1]);\n\t\t\tv[r][c] = Integer.parseInt(sa[2]);\n\t\t}\n\t\tbr.close();\n\n\t\tlong[][][] dp = new long[h + 1][w + 1][4];\n\t\tfor (int i = 1; i <= h; i++) {\n\t\t\tfor (int j = 1; j <= w; j++) {\n\t\t\t\tlong ue = max(dp[i - 1][j]);\n\t\t\t\tdp[i][j][0] = Math.max(ue, dp[i][j - 1][0]);\n\t\t\t\tdp[i][j][1] = dp[i][j - 1][1];\n\t\t\t\tdp[i][j][2] = dp[i][j - 1][2];\n\t\t\t\tdp[i][j][3] = dp[i][j - 1][3];\n\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\tdp[i][j][1] = Math.max(dp[i][j][1], ue + v[i][j]);\n\t\t\t\t\tdp[i][j][1] = Math.max(dp[i][j][1], dp[i][j - 1][0] + v[i][j]);\n\t\t\t\t\tdp[i][j][2] = Math.max(dp[i][j][2], dp[i][j - 1][1] + v[i][j]);\n\t\t\t\t\tdp[i][j][3] = Math.max(dp[i][j][3], dp[i][j - 1][2] + v[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max(dp[h][w]));\n\t}\n\n\tstatic long max(long[] a) {\n\t\tlong ret = 0;\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tret = Math.max(ret, a[i]);\n\t\t}\n\t\treturn ret;\n\t}\n}\n", "\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic final class Main {\n\n public static void main(String[] args) {\n final Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n String[] line = in.nextLine().split(\" \");\n final int r = Integer.parseInt(line[0]);\n final int c = Integer.parseInt(line[1]);\n final int K = Integer.parseInt(line[2]);\n final int[][] matrix = new int[r][c];\n for (int i = 0; i < K; i++) {\n line = in.nextLine().split(\" \");\n final int row = Integer.parseInt(line[0]);\n final int col = Integer.parseInt(line[1]);\n final int v = Integer.parseInt(line[2]);\n matrix[row - 1][col - 1] = v;\n }\n final long[][][] dp = new long[r][c][4];\n dp[0][0][1] = matrix[0][0];\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n for (int k = 0; k < 4; k++) {\n if (i > 0) { dp[i][j][k] = Math.max(dp[i][j][k], dp[i - 1][j][k]); }\n if (j > 0) { dp[i][j][k] = Math.max(dp[i][j][k], dp[i][j - 1][k]); }\n if (i > 0) { dp[i][j][1] = Math.max(dp[i][j][1], dp[i - 1][j][k] + matrix[i][j]); }\n if (k > 0 && j > 0) {\n dp[i][j][k] = Math.max(dp[i][j][k], dp[i][j - 1][k - 1] + matrix[i][j]);\n }\n }\n }\n }\n long res = 0;\n for (long ans : dp[r - 1][c - 1]) {\n res = Math.max(res, ans);\n }\n System.out.println(res);\n }\n}\n", "R, C, K = map(int, input().split())\ninf = float('inf')\nv_list = [[0 for _ in range(C)] for _ in range(R)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n v_list[r - 1][c - 1] = v\n\ndp = [[0, 0, 0, 0] for _ in range(C)]\nfor r in range(R):\n for c in range(C):\n if c > 0:\n dp[c][0] = max(dp[c])\n dp[c][1] = dp[c - 1][1]\n dp[c][2] = dp[c - 1][2]\n dp[c][3] = dp[c - 1][3]\n else:\n dp[c][0] = max(dp[c])\n dp[c][1] = 0\n dp[c][2] = 0\n dp[c][3] = 0\n if v_list[r][c] > 0:\n v = v_list[r][c]\n dp[c][3] = max(dp[c][2] + v, dp[c][3])\n dp[c][2] = max(dp[c][1] + v, dp[c][2])\n dp[c][1] = max(dp[c][0] + v, dp[c][1]) \nprint(max(dp[-1]))", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nll dp[3001][3001][3], a[3001][3001];\n\nll func(int r, int c, int cnt) {\n if(r < 0 || c < 0 || cnt < 0) return 0;\n if(dp[r][c][cnt] != -1) return dp[r][c][cnt];\n return dp[r][c][cnt] = max({func(r-1, c, 2) + a[r][c], func(r, c-1, cnt), func(r, c-1, cnt-1) + a[r][c]});\n}\n\nint main() {\n ll r,c,items, x , y, v, maxi = 0;\n cin >> r >> c >> items;\n while(items--) {\n \tcin >> x >> y >> v;\n \ta[x-1][y-1]=v;\n }\n for(int i=0;i<r;i++) for(int j=0;j<c;j++) for(int k=0;k<4;k++) dp[i][j][k] = -1;\n maxi = func(r-1, c-1, 2);\n cout << maxi;\n\treturn 0;\n}", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.util.stream.LongStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.BufferedOutputStream;\nimport java.io.UncheckedIOException;\nimport java.util.OptionalLong;\nimport java.nio.charset.Charset;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedReader;\nimport java.util.NoSuchElementException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n LightWriter out = new LightWriter(outputStream);\n EPickingGoods solver = new EPickingGoods();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EPickingGoods {\n public void solve(int testNumber, LightScanner in, LightWriter out) {\n int r = in.ints(), c = in.ints(), k = in.ints();\n long[][] v = new long[r][c];\n long[][][] dp = new long[4][r + 1][c + 1];\n for (int i = 0; i < k; i++) v[in.ints() - 1][in.ints() - 1] = in.longs();\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n for (int p = 0; p <= 3; p++) {\n // come up\n dp[0][i + 1][j + 1] = Math.max(dp[0][i + 1][j + 1], dp[p][i][j + 1]);\n // come up and pick\n dp[1][i + 1][j + 1] = Math.max(dp[1][i + 1][j + 1], dp[p][i][j + 1] + v[i][j]);\n // come right\n dp[p][i + 1][j + 1] = Math.max(dp[p][i + 1][j + 1], dp[p][i + 1][j]);\n if (p == 3) continue;\n // come right and pick\n dp[p + 1][i + 1][j + 1] = Math.max(dp[p + 1][i + 1][j + 1], dp[p][i + 1][j] + v[i][j]);\n }\n }\n }\n out.ans(IntMath.max(dp[0][r][c], dp[1][r][c], dp[2][r][c], dp[3][r][c])).ln();\n }\n\n }\n\n static final class IntMath {\n private IntMath() {\n }\n\n public static long max(long... v) {\n return Arrays.stream(v).max().orElseThrow(NoSuchElementException::new);\n }\n\n }\n\n static class LightScanner implements AutoCloseable {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n public long longs() {\n return Long.parseLong(string());\n }\n\n public void close() {\n try {\n this.reader.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n\n static class LightWriter implements AutoCloseable {\n private final Writer out;\n private boolean autoflush = false;\n private boolean breaked = true;\n\n public LightWriter(Writer out) {\n this.out = out;\n }\n\n public LightWriter(OutputStream out) {\n this(new OutputStreamWriter(new BufferedOutputStream(out), Charset.defaultCharset()));\n }\n\n public LightWriter print(char c) {\n try {\n out.write(c);\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter print(String s) {\n try {\n out.write(s, 0, s.length());\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter ans(String s) {\n if (!breaked) {\n print(' ');\n }\n return print(s);\n }\n\n public LightWriter ans(long l) {\n return ans(Long.toString(l));\n }\n\n public LightWriter ln() {\n print(System.lineSeparator());\n breaked = true;\n if (autoflush) {\n try {\n out.flush();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n return this;\n }\n\n public void close() {\n try {\n out.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n}\n\n", "from sys import stdin\nreadline = stdin.readline\n\nR, C, K = map(int, readline().split())\n\ngoods = [[0] * C for _ in range(R)]\nfor _ in range(K):\n r, c, v = map(int, readline().split())\n goods[r - 1][c - 1] = v\n\ndp = [0] * (C + 1)\nfor i in range(R):\n cur = [0] * 4\n cur[0] = dp[0]\n for j in range(C):\n if goods[i][j] != 0:\n for k in range(2, -1, -1):\n cur[k + 1] = max(cur[k + 1], cur[k] + goods[i][j])\n dp[j] = max(cur)\n cur[0] = max(cur[0], dp[j + 1])\n\nprint(max(cur))\n", "R, C, K = map(int, input().split())\ngoods = [[0] * C for _ in range(R)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n goods[r-1][c-1] = v\n\ndp = [[[0] * C for _ in range(4)] for _ in range(R)]\ndp[0][1][0] = goods[0][0]\nfor i in range(R):\n for j in range(4):\n for k in range(C):\n if i < R - 1:\n dp[i+1][0][k] = max(dp[i+1][0][k], dp[i][j][k])\n dp[i+1][1][k] = max(dp[i+1][1][k], dp[i][j][k] + goods[i+1][k])\n \n if k < C - 1:\n dp[i][j][k+1] = max(dp[i][j][k+1], dp[i][j][k])\n if j < 3:\n dp[i][j+1][k+1] = max(dp[i][j+1][k+1], dp[i][j][k] + goods[i][k+1])\n\nres = 0\nfor i in range(4):\n res = max(res, dp[R-1][i][C-1])\n\nprint(res)", "import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.stream.IntStream;\n \n/**\n * 解説通りに実装したソースコード\n */\npublic class Main {\n \n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint r = scanner.nextInt(), c = scanner.nextInt(), k = scanner.nextInt();\n\t\t\tlong[][] v = new long[r][c];\n\t\t\tIntStream.range(0, r).forEach(i -> Arrays.fill(v[i], 0L));\n\t\t\tIntStream.range(0, k).forEach(i -> v[scanner.nextInt() - 1][scanner.nextInt() - 1] = scanner.nextLong());\n\t\t\tlong[][][] dp = new long[4][r][c];\n\t\t\tdp[0][0][0] = 0L;\n\t\t\tdp[1][0][0] = v[0][0];\n\t\t\tIntStream.range(0, r).forEach(i -> IntStream.range(0, c).forEach(j -> {\n\t\t\t\tif (i > 0) {\n\t\t\t\t\tdp[0][i][j] = max(dp[0][i][j],\n\t\t\t\t\t\t\tIntStream.range(0, 4).mapToLong(l -> dp[l][i - 1][j]).max().getAsLong());\n\t\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\t\tdp[1][i][j] = max(dp[1][i][j],\n\t\t\t\t\t\t\t\tIntStream.range(0, 4).mapToLong(l -> dp[l][i - 1][j]).max().getAsLong() + v[i][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (j > 0) {\n\t\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\t\tIntStream.range(1, 4).forEach(\n\t\t\t\t\t\t\t\tl -> dp[l][i][j] = max(dp[l][i][j], dp[l - 1][i][j - 1] + v[i][j], dp[l][i][j - 1]));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tIntStream.range(0, 4).forEach(l -> dp[l][i][j] = max(dp[l][i][j], dp[l][i][j - 1]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}));\n\t\t\tSystem.out.println(IntStream.range(0, 4).mapToLong(l -> dp[l][r - 1][c - 1]).max().getAsLong());\n\t\t}\n\t}\n \n\t/**\n\t * 複数のlongのmaxを取得する\n\t * \n\t * @param a 一つ目のlong\n\t * @param b 二つ目以降のlong\n\t * @return 複数のlongのmax\n\t */\n\tprivate static long max(long a, long... b) {\n\t\tlong result = a;\n\t\tfor (long l : b) {\n\t\t\tresult = Math.max(result, l);\n\t\t}\n\t\treturn result;\n\t}\n}\n", "R,C,K = map(int,input().split())\n\ngrid=[[0]*C for _ in range(R)]\nfor i in range(K):\n x,y,v = map(int,input().split())\n grid[x-1][y-1] = v\ndp1 = [[0]*(C+1) for _ in range(R+1)]\ndp2 = [[0]*(C+1) for _ in range(R+1)]\ndp3 = [[0]*(C+1) for _ in range(R+1)]\n\nfor i in range(R):\n for j in range(C):\n dp1[i][j] = max(dp1[i][j-1],dp1[i-1][j]+grid[i][j],\n dp2[i-1][j]+grid[i][j],dp3[i-1][j]+grid[i][j])\n dp2[i][j] = max(dp2[i][j-1],dp1[i][j-1]+grid[i][j])\n dp3[i][j] = max(dp3[i][j-1],dp2[i][j-1]+grid[i][j])\nans=0\nfor i in range(R):\n for j in range(C):\n ans=max(ans,dp1[i][j],dp2[i][j],dp3[i][j])\nprint(ans)", "#include<bits/stdc++.h>\n\nusing namespace std;\n#define int long long\nconst int N = 3333;\nint dp[N][N][6];\n/*dp(i,j,k)：当前位于 第 i 行,第 j 列,且当行已经取了第 k 个的最大值 */\nint mp[N][N]={0};\nint R,C,K;\nint mc[N];\nsigned main(){\n\tcin>>R>>C>>K;\n\tint r,c,v;\n\tfor(int i=1;i<=K;i++){\n\t\tcin>>r>>c>>v;\n\t\tmp[r][c]=v;\n\t}\n\tfor(int i=1;i<=R;i++){\n\t\tfor(int j=1;j<=C;j++){\n\t\t\tint sum=0;\n\t\t\tfor(int k=0;k<=3;k++){\n\t\t\t\tsum=max(sum,dp[i-1][j][k]);\n\t\t\t}\n\t\t\tfor(int k=1;k<=3;k++){\n\t\t\t\tdp[i][j][k]=max(max(dp[i][j-1][k],dp[i][j-1][k-1]+mp[i][j]),sum+mp[i][j]);\t\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint ans=0;\n\tfor(int i=0;i<=3;i++){\n\t\tans=max(ans,dp[R][C][i]);\n\t} \n\tcout<<ans;\n\treturn 0;\n}", "import java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\npublic class Main {\n\tpublic static void main(String[] args)throws Exception{\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint R=nextInt();\n\t\tint C=nextInt();\n\t\tint K=nextInt();\n\t\tint T[][]=new int[R][C];\n\t\tlong dp[][][]=new long[R][C][4];\n\t\tfor(int i=0;i<K;i++){\n\t\t\tint r=nextInt()-1;\n\t\t\tint c=nextInt()-1;\n\t\t\tint v=nextInt();\n\t\t\tT[r][c]=v;\n\t\t}\n\t\tfor(int i=0;i<R;i++){\n\t\t\tfor(int j=0;j<C;j++){\n\t\t\t\tif(i!=R-1){\n\t\t\t\t\tlong key=Math.max(Math.max(dp[i][j][0]+T[i][j],dp[i][j][1]+T[i][j]),Math.max(dp[i][j][2]+T[i][j],dp[i][j][3]));\n\t\t\t\t\tdp[i+1][j][0]=Math.max(key,dp[i+1][j][0]);\n\t\t\t\t\tdp[i+1][j][1]=Math.max(key,dp[i+1][j][1]);\n\t\t\t\t\tdp[i+1][j][2]=Math.max(key,dp[i+1][j][2]);\n\t\t\t\t\tdp[i+1][j][3]=Math.max(key,dp[i+1][j][3]);\n\t\t\t\t}\n\t\t\t\tif(j!=C-1){\n\t\t\t\t\tdp[i][j+1][0]=Math.max(dp[i][j][0],dp[i][j+1][0]);\n\t\t\t\t\tdp[i][j+1][1]=Math.max(Math.max(dp[i][j][1],dp[i][j][0]+T[i][j]),dp[i][j+1][1]);\n\t\t\t\t\tdp[i][j+1][2]=Math.max(Math.max(dp[i][j][2],dp[i][j][1]+T[i][j]),dp[i][j+1][2]);\n\t\t\t\t\tdp[i][j+1][3]=Math.max(Math.max(dp[i][j][3],dp[i][j][2]+T[i][j]),dp[i][j+1][3]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.max(Math.max(dp[R-1][C-1][0]+T[R-1][C-1],dp[R-1][C-1][1]+T[R-1][C-1]),Math.max(dp[R-1][C-1][2]+T[R-1][C-1],dp[R-1][C-1][3])));\n\t}\n\tpublic static long lmod(long i, long j) {\n\t return (i%j)<0?(i%j)+0+(j<0?-j:j):(i%j+0);\n\t }\n\tstatic boolean isOK(int index,int key,int[]a){\n\t\tif (a[index]>=key) return true;\n\t else return false;\n\t}\n\tstatic int binary_search(int key,int[] a) {\n\t int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1\n\t int ok = (int)a.length; // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は a.size()\n\t while (Math.abs(ok - ng) > 1) {\n\t int mid = (ok + ng) / 2;\n\t if (isOK(mid,key,a)) ok = mid;\n\t else ng = mid;\n\t }\n\t return ok;\n\t}\n\t//FastScanner\n\tstatic InputStream in = System.in;\n\tstatic byte[] buffer = new byte[1024];\n\tstatic int length = 0, p = 0;\n\tpublic static boolean hasNextByte () {\n\t\tif (p < length) return true;\n\t\telse {\n\t\t\tp = 0;\n\t\t\ttry {length = in.read(buffer);}\n\t\t\tcatch (Exception e) {e.printStackTrace();}\n\t\t\tif (length == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static int readByte () {\n\t\tif (hasNextByte() == true) return buffer[p++];\n\t\treturn -1;\n\t}\n\tpublic static boolean isPrintable (int n) {return 33<=n&&n<=126;}\n\tpublic static void skip () {\n\t\twhile (hasNextByte() && !isPrintable(buffer[p])) p++;\n\t}\n\tpublic static boolean hasNext () {skip(); return hasNextByte();}\n\tpublic static String next () {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint temp = readByte();\n\t\twhile (isPrintable(temp)) {\n\t\t\tsb.appendCodePoint(temp);\n\t\t\ttemp = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tpublic static int nextInt () {return Math.toIntExact(nextLong());}\n\tpublic static int[] nextInts (int n) {\n\t\tint[] ar = new int[n];\n\t\tfor (int i=0; i<n; i++) ar[i] = nextInt();\n\t\treturn ar;\n\t}\n\tpublic static long nextLong () {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tboolean minus = false;\n\t\tint temp = readByte();\n\t\tif (temp == '-') {\n\t\t\tminus = true;\n\t\t\ttemp = readByte();\n\t\t}\n\t\tif (temp<'0' || '9'<temp) throw new NumberFormatException();\n\t\tlong n = 0;\n\t\twhile (isPrintable(temp)) {\n\t\t\tif ('0'<=temp && temp<='9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += temp - '0';\n\t\t\t}\n\t\t\ttemp = readByte();\n\t\t}\n\t\treturn minus? -n : n;\n\t}\n}\n\n", "# pypy\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\n\nR, C, K = map(int, readline().split())\nrcv = list(map(int, read().split()))\nrc2v = {}\nfor rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):\n rc2v[(rr, cc)] = vv\n\ndp = [[0]*4 for c in range(C+1)]\nfor r in range(1, R+1):\n for c in range(1, C+1):\n v = rc2v[(r, c)] if (r, c) in rc2v else 0\n dp[c][0] = max(dp[c-1][0], max(dp[c]))\n dp[c][1] = max(dp[c-1][1], dp[c][0] + v)\n for k in range(2, 4):\n dp[c][k] = max(dp[c-1][k], dp[c-1][k-1] + v)\n\nprint(max(dp[-1]))", "#include<bits/stdc++.h>\nusing namespace std;\n\nint n,m,t;\nint a[3005][3005];\nlong long dp[3005][3005][4];\n\nint main(){\n\n scanf(\"%d %d %d\",&n,&m,&t);\n for(int i=0;i<t;i++){\n static int r,c,v;\n scanf(\"%d %d %d\",&r,&c,&v);\n a[r][c]=v;\n }\n for(int i=1;i<=n;i++){\n for(int j=1;j<=m;j++){\n dp[i][j][0]=*max_element(dp[i-1][j],dp[i-1][j]+4);\n dp[i][j][1]=max(max(dp[i][j-1][0],dp[i][j][0])+a[i][j],dp[i][j-1][1]);\n dp[i][j][2]=max(dp[i][j-1][1]+a[i][j],dp[i][j-1][2]);\n dp[i][j][3]=max(dp[i][j-1][2]+a[i][j],dp[i][j-1][3]);\n }\n }\n printf(\"%lld\\n\",*max_element(dp[n][m],dp[n][m]+4));\n\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing UL = unsigned int;\nusing ULL = unsigned long long;\nusing LL = long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nint H,W;\nint K;\nLL G[3000][3000];\nLL dp[3000][3000][4];\n\nint main() {\n scanf(\"%d%d%d\",&H,&W,&K);\n rep(y,H) rep(x,W) G[y][x]=0;\n rep(k,K){\n int y,x,v; scanf(\"%d%d%d\",&y,&x,&v); y--; x--;\n G[y][x] = v;\n }\n rep(y,H)rep(x,W)rep(i,4) dp[y][x][i]=0;\n dp[0][0][1] = G[0][0];\n\n rep(y,H)rep(x,W)rep(i,4){\n if(y!=H-1) dp[y+1][x][0] = max(dp[y+1][x][0],dp[y][x][i]);\n if(y!=H-1) dp[y+1][x][1] = max(dp[y+1][x][1],dp[y][x][i]+G[y+1][x]);\n if(x!=W-1) dp[y][x+1][i] = max(dp[y][x+1][i],dp[y][x][i]);\n if(x!=W-1)if(i!=3) dp[y][x+1][i+1] = max(dp[y][x+1][i+1],dp[y][x][i]+G[y][x+1]);\n }\n\n LL ans=0;\n rep(i,4) ans=max(ans,dp[H-1][W-1][i]);\n cout<<ans<<endl;\n\n return 0;\n}\n", "R,C,k = map(int,input().split())\ndp1 = [[0]*(C+1) for i in range(R+1)]\ndp2 = [[0]*(C+1) for i in range(R+1)]\ndp3 = [[0]*(C+1) for i in range(R+1)]\nitem = [[0]*(C+1) for i in range(R+1)]\nfor i in range(k):\n r,c,v = map(int,input().split())\n dp1[r][c] = v\n\nfor i in range(1,R+1):\n for j in range(1,C+1):\n a = dp1[i][j]\n dp3[i][j] = max(dp2[i][j-1]+a,dp3[i][j-1])\n dp2[i][j] = max(dp1[i][j-1]+a,dp2[i][j-1])\n dp1[i][j] = max(dp1[i-1][j]+a,dp2[i-1][j]+a,dp3[i-1][j]+a,dp1[i][j-1],a)\n\nprint(max(dp1[R][C],dp2[R][C],dp3[R][C]))", "import sys\n\ninp = [int(x) for x in sys.stdin.read().split()]\nii = 0\n\nr, c, k = inp[ii:ii+3]\nii += 3\nv=[0] * (c * r)\nfor _ in range(k):\n ri,ci,a = inp[ii:ii+3]\n ii += 3\n v[(ri-1)*c + (ci-1)]=a\ndp= [0] * (c * r * 4)\nx = c * r\nif v[0]>0: dp[x] = v[0]\n\nfor i in range(r):\n for j in range(c):\n idx = i*c+j\n idx2 = (i-1)*c + j\n idx3 = i*c + j-1\n val = v[idx]\n if i>0:\n a = max(dp[idx2],dp[x + idx2],dp[2*x+idx2],dp[3*x+idx2])\n dp[idx]= a\n dp[x+idx]= a + val\n\n if j>0:\n dp[idx]=max(dp[idx],dp[idx3])\n dp[x + idx]=max(dp[x + idx],dp[idx3]+val,dp[x + idx3])\n dp[2*x + idx]=max(dp[x+idx3]+val,dp[2*x+idx3])\n dp[3*x + idx]=max(dp[2*x+idx3]+val,dp[3*x+idx3])\n\n\nans=0\nfor i in range(4): ans = max(dp[i*x + (r-1)*c + (c-1)],ans)\nprint(ans)\n\n", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)\n#define ALL(v) v.begin(), v.end()\nusing namespace std;\nusing P = pair<int, int>;\ntypedef long long ll;\nll dp[3030][3030][4];\nll T[3030][3030];\n\nint main() {\n int R, C, K;\n cin >> R >> C >> K;\n rep(i, K) {\n int r, c;\n ll v;\n cin >> r >> c >> v;\n r--, c--;\n T[r][c] = v;\n }\n rep(i, R) {\n rep(j, C) {\n for(int k = 2; k >= 0; k--){\n dp[i][j][k + 1] = max(dp[i][j][k] + T[i][j], dp[i][j][k+1]);\n }\n rep(k, 4) {\n dp[i][j + 1][k] = max(dp[i][j][k], dp[i][j + 1][k]);\n dp[i+1][j][0] = max(dp[i][j][k], dp[i+1][j][0]);\n }\n }\n }\n ll ans = 0;\n rep(i, 4) {\n ans = max(ans, dp[R-1][C-1][i]);\n }\n cout << ans << endl;\n}\n", "r,c,k = list(map(int, input().split()))\nimport copy\ndp=[[[0]*4 for _ in range(c)] for _ in range(2)]\n\n\nF = [[0]*c for _ in range(r)]\n\nfor _ in range(k):\n x,y,v = list(map(int, input().split()))\n x-=1\n y-=1\n F[x][y] = v\n \nfor nn in range(r):\n for j in range(c):\n i = 1\n val = F[nn][j]\n \n \n mxv = max(dp[i-1][j][0], dp[i-1][j][1], dp[i-1][j][2], dp[i-1][j][3])\n\n dp[i][j][3] = max(dp[i][j-1][3], dp[i][j-1][2] + val)\n dp[i][j][2] = max(dp[i][j-1][2], dp[i][j-1][1] + val)\n dp[i][j][1] = max(dp[i][j-1][1], dp[i][j-1][0] + val, mxv + val)\n dp[i][j][0] = mxv\n\n dp[0] = dp[1] \n dp[1] = [[0]*4 for _ in range(c)]\n\nbest = 0\n\n\nfor k in range(4):\n best = max(best, dp[0][c-1][k])\n \nprint(best)\n", "\n\nr, c, k = map(int, input().split())\nv = [[0 for _ in range(c)] for _ in range(r)]\nfor _ in range(k):\n ri, ci, vi = map(int, input().split())\n v[ri - 1][ci - 1] = vi\n\ndp = [[0, 0, 0, 0] for _ in range(c)]\nfor i in range(r):\n for j in range(c):\n dpj = dp[j][:]\n if j == 0:\n dp[j] = [max(dpj), max(dpj) + v[i][j], 0, 0]\n else:\n dp[j][0] = max(max(dpj), dp[j - 1][0])\n dp[j][1] = dp[j - 1][1]\n dp[j][2] = dp[j - 1][2]\n dp[j][3] = dp[j - 1][3]\n if v[i][j] > 0:\n dp[j][1] = max(dp[j][1], dp[j - 1][0] + v[i][j], max(dpj) + v[i][j])\n dp[j][2] = max(dp[j][2], dp[j - 1][1] + v[i][j])\n dp[j][3] = max(dp[j][3], dp[j - 1][2] + v[i][j])\n\nprint(max(dp[c - 1]))\n", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String[] head = br.readLine().split(\" \");\n int r = Integer.parseInt(head[0]);\n int c = Integer.parseInt(head[1]);\n int k = Integer.parseInt(head[2]);\n long[][] item_map = new long[r + 1][c + 1];\n for(int i = 0; i < k; i++){\n String[] data = br.readLine().split(\" \");\n int ri = Integer.parseInt(data[0]);\n int ci = Integer.parseInt(data[1]);\n long vi = Long.parseLong(data[2]);\n item_map[ri][ci] = vi;\n }\n br.close();\n\n long[][][] dp = new long[r + 1][c + 1][4];\n for(int r_pos = 1; r_pos <= r; r_pos++){\n for(int c_pos = 1; c_pos <= c; c_pos++){\n //同一行0個の最大値\n dp[r_pos][c_pos][0] = dp[r_pos][c_pos - 1][0];\n dp[r_pos][c_pos][0] = Math.max(dp[r_pos][c_pos][0], dp[r_pos - 1][c_pos][0]);\n dp[r_pos][c_pos][0] = Math.max(dp[r_pos][c_pos][0], dp[r_pos - 1][c_pos][1]);\n dp[r_pos][c_pos][0] = Math.max(dp[r_pos][c_pos][0], dp[r_pos - 1][c_pos][2]);\n dp[r_pos][c_pos][0] = Math.max(dp[r_pos][c_pos][0], dp[r_pos - 1][c_pos][3]);\n\n //同一行1個の最大値\n dp[r_pos][c_pos][1] = dp[r_pos][c_pos - 1][1];\n dp[r_pos][c_pos][1] = Math.max(dp[r_pos][c_pos][1], dp[r_pos][c_pos][0] + item_map[r_pos][c_pos]);\n\n //同一行2個の最大値\n dp[r_pos][c_pos][2] = dp[r_pos][c_pos - 1][2];\n dp[r_pos][c_pos][2] = Math.max(dp[r_pos][c_pos][2], dp[r_pos][c_pos - 1][1] + item_map[r_pos][c_pos]);\n\n //同一行3個の最大値\n dp[r_pos][c_pos][3] = dp[r_pos][c_pos - 1][3];\n dp[r_pos][c_pos][3] = Math.max(dp[r_pos][c_pos][3], dp[r_pos][c_pos - 1][2] + item_map[r_pos][c_pos]);\n }\n }\n\n long ans = 0;\n for(int i = 0; i < 4; i++){\n ans = Math.max(ans, dp[r][c][i]);\n }\n System.out.println(ans);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int sz = 3005;\n\nint r, c, k, a[sz][sz];\nll dp[sz][sz][4];\n\nll fnc(int x, int y, int d) {\n if(x == r && y == c) {\n if(d) return a[x][y];\n return 0;\n }\n ll &w = dp[x][y][d];\n if(w < 0) {\n w = 0;\n if(y < c) w = max(w, fnc(x, y+1, d));\n if(x < r) w = max(w, fnc(x+1, y, 3));\n if(d && a[x][y]) {\n if(y < c) w = max(w, a[x][y] + fnc(x, y+1, d-1));\n if(x < r) w = max(w, a[x][y] + fnc(x+1, y, 3));\n }\n }\n return w;\n}\n\nint main() {\n cin >> r >> c >> k;\n while(k--) {\n int x, y, v;\n scanf(\"%d %d %d\", &x, &y, &v);\n a[x][y] = v;\n }\n memset(dp, -1, sizeof(dp));\n cout << fnc(1, 1, 3) << endl;\n}\n", "import java.util.*;\nimport java.io.*;\nimport java.text.*;\n\npublic class Main {\n //SOLUTION BEGIN\n //Into the Hardware Mode\n void pre() throws Exception{}\n void solve(int TC) throws Exception{\n int R = ni(), C = ni(), K = ni();\n long[][] gain = new long[1+R][1+C];\n for(int i = 0; i< K; i++)gain[ni()][ni()] = nl();\n\n// long[][][] DP = new long[1+R][4][1+C];\n long[][] DP = new long[1+R][1+C];\n for(int i = 1; i<= R; i++){\n long[][] ndp = new long[4][1+C];\n for(int j = 1; j<= C; j++){\n ndp[0][j] = DP[i-1][j];\n ndp[1][j] = DP[i-1][j]+gain[i][j];\n }\n for(int obj = 0; obj <= 3; obj++){\n for(int j = 1; j<= C; j++){\n ndp[obj][j] = Math.max(ndp[obj][j], ndp[obj][j-1]);\n if(obj > 0)ndp[obj][j] = Math.max(ndp[obj][j], ndp[obj-1][j-1]+gain[i][j]);\n }\n }\n for(int j = 0; j<= C; j++){\n for(int obj = 0; obj <= 3; obj++){\n DP[i][j] = Math.max(DP[i][j], ndp[obj][j]);\n }\n }\n }\n pn(DP[R][C]);\n }\n //SOLUTION END\n void hold(boolean b)throws Exception{if(!b)throw new Exception(\"Hold right there, Sparky!\");}\n void exit(boolean b){if(!b)System.exit(0);}\n static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}\n final long IINF = (long)1e17;\n final int INF = (int)1e9+2;\n DecimalFormat df = new DecimalFormat(\"0.00000000000\");\n double PI = 3.141592653589793238462643383279502884197169399, eps = 1e-8;\n static boolean multipleTC = false, memory = true, fileIO = false;\n FastReader in;PrintWriter out;\n void run() throws Exception{\n long ct = System.currentTimeMillis();\n if (fileIO) {\n in = new FastReader(\"\");\n out = new PrintWriter(\"\");\n } else {\n in = new FastReader();\n out = new PrintWriter(System.out);\n }\n //Solution Credits: Taranpreet Singh\n int T = multipleTC? ni():1;\n pre();\n for (int t = 1; t <= T; t++) solve(t);\n out.flush();\n out.close();\n System.err.println(System.currentTimeMillis() - ct);\n }\n public static void main(String[] args) throws Exception{\n if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, \"1\", 1 << 28).start();\n else new Main().run();\n }\n int[][] make(int n, int e, int[] from, int[] to, boolean f){\n int[][] g = new int[n][];int[]cnt = new int[n];\n for(int i = 0; i< e; i++){\n cnt[from[i]]++;\n if(f)cnt[to[i]]++;\n }\n for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];\n for(int i = 0; i< e; i++){\n g[from[i]][--cnt[from[i]]] = to[i];\n if(f)g[to[i]][--cnt[to[i]]] = from[i];\n }\n return g;\n }\n int[][][] makeS(int n, int e, int[] from, int[] to, boolean f){\n int[][][] g = new int[n][][];int[]cnt = new int[n];\n for(int i = 0; i< e; i++){\n cnt[from[i]]++;\n if(f)cnt[to[i]]++;\n }\n for(int i = 0; i< n; i++)g[i] = new int[cnt[i]][];\n for(int i = 0; i< e; i++){\n g[from[i]][--cnt[from[i]]] = new int[]{to[i], i, 0};\n if(f)g[to[i]][--cnt[to[i]]] = new int[]{from[i], i, 1};\n }\n return g;\n }\n int find(int[] set, int u){return set[u] = (set[u] == u?u:find(set, set[u]));}\n int digit(long s){int ans = 0;while(s>0){s/=10;ans++;}return ans;}\n long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}\n int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}\n int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}\n void p(Object... o){for(Object oo:o)out.print(oo+\" \");}\n void pn(Object... o){for(Object oo:o)out.print(oo+\" \");out.println();}\n void pni(Object... o){for(Object oo:o)out.print(oo+\" \");out.println();out.flush();}\n String n()throws Exception{return in.next();}\n String nln()throws Exception{return in.nextLine();}\n int ni()throws Exception{return Integer.parseInt(in.next());}\n long nl()throws Exception{return Long.parseLong(in.next());}\n double nd()throws Exception{return Double.parseDouble(in.next());}\n\n class FastReader{\n BufferedReader br;\n StringTokenizer st;\n public FastReader(){\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastReader(String s) throws Exception{\n br = new BufferedReader(new FileReader(s));\n }\n\n String next() throws Exception{\n while (st == null || !st.hasMoreElements()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch (IOException e){\n throw new Exception(e.toString());\n }\n }\n return st.nextToken();\n }\n\n String nextLine() throws Exception{\n String str;\n try{\n str = br.readLine();\n }catch (IOException e){\n throw new Exception(e.toString());\n }\n return str;\n }\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntemplate<typename T>\nvoid chmax(T &a,T b){\n if(a<b)a=b;\n}\nint R,C,K,r,c,v,d[3123][3123],memo[3123][3123][5];\nint f(int y,int x,int cnt){\n if(y<0||x<0)return 0;\n if(~memo[y][x][cnt])return memo[y][x][cnt];\n int res=0;\n for(int i=0;i<=3;i++)chmax(res,f(y-1,x,i));\n for(int i=0;i<=cnt;i++)chmax(res,f(y,x-1,i));\n if(cnt)for(int i=0;i<=3;i++)chmax(res,f(y-1,x,i)+d[y][x]);\n if(cnt)chmax(res,f(y,x-1,cnt-1)+d[y][x]);\n return memo[y][x][cnt]=res;\n}\n\nsigned main(){\n memset(memo,-1,sizeof(memo));\n cin>>R>>C>>K;\n while(K--){\n cin>>r>>c>>v;\n d[r][c]=v;\n }\n cout<<f(R+1,C+1,0)<<endl;\n}\n", "import sys\ninput = sys.stdin.readline\nR, L, K = map(int, input().split())\nV = [0]*(R*L)\nmax2 = lambda x, y: x if x > y else y\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[(c-1)*R+(r-1)] = v\nA, B, C, D = [[0]*(R+1) for _ in range(4)]\nfor i in range(L):\n for j in range(R):\n A[j] = max(A[j-1],B[j-1],C[j-1],D[j-1])\n v = V[i*R+j]\n if v != 0:\n D[j], C[j], B[j] = max2(C[j]+v,D[j]), max2(B[j]+v,C[j]), max2(A[j]+v,B[j])\nprint(max(A[-2],B[-2],C[-2],D[-2]))", "f,g,h=range,max,input\nR,C,K=map(int,h().split())\nG=[[0]*-~C for i in f(R+1)]\nfor i in'_'*K:r,c,v=map(int,h().split());G[r][c]=v\nF=[[[0]*-~C for i in f(R+1)]for i in f(4)]\nfor r in f(1,R+1):\n\tfor x in f(1,4):\n\t\tfor c in f(1,C+1):F[x][r][c]=g(F[x-1][r][c],F[x-1][r][c-1]+G[r][c],F[x][r][c-1],(x<2)*(G[r][c]+g(F[1][r-1][c],F[2][r-1][c],F[3][r-1][c])))\nprint(F[3][R][C])", "// Originalcode: https://atcoder.jp/contests/abc175/submissions/15970101\n\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(v) v.begin(), v.end()\n#define ll int64_t\n#define _GLIBCXX_DEBUG\n\nll dp[3005][3005][5];\nll m[3005][3005];\n\nint main(){\n int r,c,k;\n cin >> r >> c >> k;\n rep(i,k){\n int a,b;\n ll x;\n cin >>a>>b>>x;\n m[a][b]=x;\n }\n rep(i,r){\n rep(j,c){\n dp[i+1][j+1][0]=max(dp[i][j+1][4],dp[i+1][j][0]);\n for(int p=1;p<4;p++)\n dp[i+1][j+1][p+1]=max(dp[i][j+1][4]+m[i+1][j+1],max(dp[i+1][j][p]+m[i+1][j+1],dp[i+1][j][p+1]));\n }\n }\n cout << dp[r][c][4] << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int M = 3e3;\nint mat[M][M], n, m;\nlong long memo[M][M][4];\n\nlong long solve(int i, int j, int cnt) {\n if (i == n || j == m)\n return 0;\n\n long long &result = memo[i][j][cnt];\n if (result == -1) {\n result = max(solve(i + 1, j, 0), solve(i, j + 1, cnt));\n if (cnt < 3)\n result = max(result, mat[i][j] + max(solve(i + 1, j, 0), solve(i, j + 1, cnt + 1)));\n }\n return result;\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n\n memset(memo, -1, sizeof memo);\n int k;\n cin >> n >> m >> k;\n\n while (k--) {\n int x, y, val;\n cin >> x >> y >> val;\n x--;\n y--;\n mat[x][y] = val;\n }\n cout << solve(0, 0, 0) << '\\n';\n}", "#include<bits/stdc++.h>\nusing namespace std;\nconst int maxn=3009;\n\nint n,m,K;\n\nint a[maxn][maxn];\n\nlong long f[maxn][maxn][4];\n\nint main(){\n\tcin>>n>>m>>K;\n\twhile(K--){\n\t\tint x,y,z;scanf(\"%d%d%d\",&x,&y,&z);\n\t\ta[x][y]=z;\n\t}\n\tfor(int i=1;i<=n;++i){\n\t\tfor(int j=1;j<=m;++j){\n\t\t\tfor(int k=0;k<=3;++k){\n\t\t\t\tlong long t=max(max(f[i-1][j][0],f[i-1][j][1]),max(f[i-1][j][2],f[i-1][j][3]));\n\t\t\t\tf[i][j][k]=max(f[i][j-1][k],t);\n\t\t\t\tif(k)f[i][j][k]=max(f[i][j-1][k-1]+a[i][j],f[i][j][k]);\n\t\t\t\tif(k)f[i][j][k]=max(f[i][j][k],t+a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",max(max(f[n][m][0],f[n][m][1]),max(f[n][m][2],f[n][m][3])));\n\treturn 0;\n}", "#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\nconst int n=3000;\nlong long int dp[3000][3000][4];\nlong long int a[3000][3000];\nlong long int fun(long int x,long int y,long int z)\n{\n //cout<<x<<\" \"<<y<<\" \"<<z<<endl;\n if(x<0 || y<0)\n return 0;\n if(dp[x][y][z]!=-1)\n return dp[x][y][z];\n dp[x][y][z]=max(fun(x-1,y,3),fun(x,y-1,z));\n if(z>0)\n dp[x][y][z]=max(dp[x][y][z],a[x][y]+max(fun(x-1,y,3),fun(x,y-1,z-1)));\n return dp[x][y][z];\n}\nint main() {\n long int r,c,k;\n cin>>r>>c>>k;\n memset(dp,-1,sizeof(dp));\n memset(a,0,sizeof(a));\n long int aa,bb,cc;\n for(long int i=0;i<k;i++)\n {\n cin>>aa>>bb>>cc;\n a[aa-1][bb-1]=cc;\n }\n cout<<fun(r-1,c-1,3);\n //goes here\n\treturn 0;\n}\n", "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nr,c,k = map(int,readline().split())\ndata = list(map(int,read().split()))\nd = dict()\nit = iter(data)\nfor ri,ci,vi in zip(it,it,it):\n d[(ri-1)*5000 + (ci-1)] = vi\n\ndp_max = [0] * (c)\n\nfor i in range(r):\n dp = [0] * 4\n for j in range(c):\n dp[0] = max(dp[0],dp_max[j])\n if( i*5000+j in d):\n ci = d[i*5000+j]\n for k in range(3,0,-1):\n dp[k] = max(dp[k], dp[k-1] + ci)\n\n dp_max[j] = max(dp)\n\nprint(dp_max[-1])", "R, C, K = map(int, input().split())\n\nI = [[0 for _ in range(C+1)] for _ in range(R+1)]\nfor i in range(K): \n r, c, v = map(int, input().split())\n I[r][c] = v \n \nDP1 = [0 for _ in range(C+1)] #c列目までとったとき、最新の行で1個以下とったという条件のもとの最大\nDP2 = [0 for _ in range(C+1)] #c列目までとったとき、最新の行で2個以下とったという条件のもとの最大\nDP3 = [0 for _ in range(C+1)] #c列目までとったとき、最新の行で3個以下とったという条件のもとの最大\n#print(I)\n\nfor r in range(1,R+1):\n for c in range(1,C+1): \n #更新の順番に注意\n #mid = max(DP1[c], DP2[c], DP3[c]) + I[r][c]\n mid = DP3[c] + I[r][c] \n DP3[c] = max(DP3[c-1], mid, DP2[c-1] + I[r][c]) #3個\n DP2[c] = max(DP2[c-1], mid, DP1[c-1] + I[r][c]) #2個\n DP1[c] = max(DP1[c-1], mid) #1個\n #print(DP3)\n \nprint(DP3[C])\n \n \n ", "#!/usr/bin python3\n# -*- coding: utf-8 -*-\n\nr, c, k = map(int, input().split())\nitm = [[0]*(c) for _ in range(r)]\nfor i in range(k):\n ri, ci, vi = map(int, input().split())\n itm[ri-1][ci-1] = vi\n\ndp0 = [[0]*4 for c_ in range(3005)]\ndp1 = [[0]*4 for c_ in range(3005)]\n\nfor i in range(r):\n for j in range(c):\n nowv = itm[i][j]\n dp0[j][3] = max(dp0[j][3], dp0[j][2] + nowv)\n dp0[j][2] = max(dp0[j][2], dp0[j][1] + nowv)\n dp0[j][1] = max(dp0[j][1], dp0[j][0] + nowv)\n\n dp0[j+1][0] = max(dp0[j+1][0], dp0[j][0])\n dp0[j+1][1] = max(dp0[j+1][1], dp0[j][1])\n dp0[j+1][2] = max(dp0[j+1][2], dp0[j][2])\n dp0[j+1][3] = max(dp0[j+1][3], dp0[j][3])\n\n dp1[j][0] = max(dp1[j][0], max(dp0[j]))\n dp0 = dp1.copy()\n\nprint(max(dp1[c-1]))\n", "def main():\n R, C, K = map(int, input().split())\n V = {}\n for _ in range(K):\n r, c, v = map(int, input().split())\n V[(r - 1, c - 1)] = v\n dp = [(0, 0, 0, 0) for _ in range(C)]\n for r in range(R):\n p0, p1, p2, p3 = 0, 0, 0, 0\n for c in range(C):\n m = max(dp[c])\n if (r, c) in V:\n v = V[(r, c)]\n n0, n1, n2, n3 = max(m, p0), max(p1, max(p0, m) + v), max(p2, p1 + v), max(p3, p2 + v)\n else:\n n0, n1, n2, n3 = max(m, p0), p1, p2, p3\n dp[c] = (n0, n1, n2, n3)\n p0, p1, p2, p3 = n0, n1, n2, n3\n\n return max(dp[-1])\n\nprint(main())\n", "def main():\n import sys\n my_input = sys.stdin.readline\n H, W, K = map(int, my_input().split())\n V = [[0] * W for _ in range(H)]\n for i in range(K):\n h, w, v = map(int, my_input().split())\n h, w = h - 1, w - 1\n V[h][w] = v\n\n # dp1 ~ 4[h][w][x] := h行w列にいて、h行からn個アイテムを拾っている時の価値の総和の最大値\n dp0 = [[0] * (W + 1) for _ in range(H + 1)]\n dp1 = [[0] * (W + 1) for _ in range(H + 1)]\n dp2 = [[0] * (W + 1) for _ in range(H + 1)]\n dp3 = [[0] * (W + 1) for _ in range(H + 1)]\n\n for h in range(1, H + 1):\n for w in range(1, W + 1):\n dp1[h][w] = max(\n dp1[h][w],\n dp3[h - 1][w] + V[h - 1][w - 1],\n dp1[h][w - 1],\n dp0[h][w - 1] + V[h - 1][w - 1]\n )\n\n dp2[h][w] = max(\n dp2[h][w],\n dp3[h - 1][w] + V[h - 1][w - 1],\n dp2[h][w - 1],\n dp1[h][w - 1] + V[h - 1][w - 1]\n )\n\n dp3[h][w] = max(\n dp3[h][w],\n dp3[h - 1][w] + V[h - 1][w - 1],\n dp3[h][w - 1],\n dp2[h][w - 1] + V[h - 1][w - 1]\n )\n\n print(dp3[-1][-1])\n\n\nif __name__ == \"__main__\":\n main()\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define SZ(a) ((int)(a).size())\ntypedef long long int64;\nint64 dp[3333][3333][4],v[3333][3333];\nint main(){\n#ifdef LOCAL\n freopen(\".a.in\", \"r\", stdin);\n#endif\n ios_base::sync_with_stdio(false),cout.tie(0),cin.tie(0);\n int n,m,k;cin>>n>>m>>k;\n for(int i=0;i<k;++i){\n int x,y;cin>>x>>y;\n cin>>v[x][y];\n }\n for(int i=1;i<=n;++i){\n for(int j=1;j<=m;++j){\n if(v[i][j]){\n for(int a=3;a;--a)dp[i][j][a]=max(dp[i][j][a-1]+v[i][j],dp[i][j][a]);\n }\n for(int a=0;a<=3;++a)dp[i+1][j][0]=max(dp[i][j][a],dp[i+1][j][0]);\n for(int a=0;a<=3;++a)dp[i][j+1][a]=max(dp[i][j][a],dp[i][j+1][a]);\n }\n }\n int64 res=dp[n][m][0];\n for(int a=0;a<=3;++a)res=max(res,dp[n][m][a]);\n cout<<res<<'\\n';\n return 0;\n}\n//2020.08.15 21:02:54\n", "r,c,k=map(int,input().split())\na=[list(map(int,input().split())) for _ in range(k)]\ndp=[[[0 for _ in range(c+1)]for _ in range(r+1)]for _ in range(5)]\nfor x,y,z in a:\n dp[4][x][y]=z\nfor i in range(1,r+1):\n for j in range(1,c+1):\n v=dp[4][i][j]\n dp[0][i][j]=max(dp[0][i][j-1],dp[0][i-1][j],dp[1][i-1][j],dp[2][i-1][j],dp[3][i-1][j])\n dp[1][i][j]=max(dp[1][i][j-1],dp[0][i][j-1]+v,dp[0][i-1][j]+v,dp[1][i-1][j]+v,dp[2][i-1][j]+v,dp[3][i-1][j]+v)\n dp[2][i][j]=max(dp[2][i][j-1],dp[1][i][j-1]+v)\n dp[3][i][j]=max(dp[3][i][j-1],dp[2][i][j-1]+v)\nprint(max([dp[i][r][c] for i in range(4)]))", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint n, m, k;\nll a[3030][3030], dp[3030][3030][4];\n\nint main(){\n\tios_base::sync_with_stdio(0);cin.tie(0);\n\tcin >> n >> m >> k;\n\tfor(int i=1;i<=k;i++){\n\t\tint x, y, v; cin >> x >> y >> v;\n\t\ta[x][y] = v;\n\t}\n\n\tfor(int i=1;i<=n;i++){\n\t\tfor(int j=1;j<=m;j++){\n\t\t\tfor(int k=0;k<=3;k++){\n\t\t\t\tdp[i][j][0] = max(dp[i][j][0], dp[i-1][j][k]);\n\t\t\t\tif(a[i][j]) dp[i][j][1] = max(dp[i][j][1], dp[i-1][j][k] + a[i][j]);\n\n\t\t\t\tdp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k]);\n\t\t\t\tif(a[i][j] && k <= 2) dp[i][j][k+1] = max(dp[i][j][k+1], dp[i][j-1][k] + a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << max({dp[n][m][3], dp[n][m][2], dp[n][m][1], dp[n][m][0]});\n}", "#include<bits/stdc++.h>\n#define LL long long\nusing namespace std;\n\nLL dp[3005][3005][4];\nint a[3005][3005];\nint r,c;\nint main()\n{\n\tint i,j,k;\n\tscanf(\"%d%d%d\",&r,&c,&k);\n\twhile(k--)\n\t{\n\t\tint t1,t2,t3;\n\t\tscanf(\"%d%d%d\",&t1,&t2,&t3);\n\t\ta[t1][t2]=t3;\n\t}\n\tfor(i=1;i<=r;i++)\n\t\tfor(j=1;j<=c;j++)\n\t\t{\n\t\t\tfor(k=0;k<4;k++)\n\t\t\t\tdp[i][j][0]=max(dp[i][j][0],dp[i-1][j][k]);\n\t\t\tfor(k=0;k<4;k++)\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k]);\n\t\t\tif(a[i][j])\n\t\t\t{\n\t\t\t\tfor(k=0;k<4;k++)\n\t\t\t\t\tdp[i][j][1]=max(dp[i][j][1],dp[i-1][j][k]+a[i][j]);\n\t\t\t\tfor(k=1;k<4;k++)\n\t\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k-1]+a[i][j]);\n\t\t\t}\n\t\t}\n\tLL ans=0;\n\tfor(k=0;k<4;k++)\n\t\tans=max(ans,dp[r][c][k]);\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "// package beginner00175;\n\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.PriorityQueue;\n\npublic class Main {\n\tprivate static PrintWriter out;\n\n\tpublic static void solve() {\n\t\tIn in = new In();\n\t\t// BEFORE SUBMISSION :: Change class name to Main and comment out package name\n\t\t// !!!\n\t\tint n = in.ni();\n\t\tint m = in.ni();\n\t\tint k = in.ni();\n\t\tlong[][] vals = new long[n][m];\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tvals[in.ni() - 1][in.ni() - 1] = in.nl();\n\t\t}\n\n\t\tlong[][][] dp = new long[n + 1][m + 1][4];\n\t\tfor (int r = n - 1; r >= 0; r--) {\n\t\t\tfor (int c = m - 1; c >= 0; c--) {\n\t\t\t\tlong bestDown = max4(dp[r + 1][c][0], dp[r + 1][c][1], dp[r + 1][c][2],\n\t\t\t\t\t\tdp[r + 1][c][3]);\n\t\t\t\t{\n\t\t\t\t\tlong down = bestDown;\n\t\t\t\t\tlong right = dp[r][c + 1][0];\n\t\t\t\t\tlong getAndDown = vals[r][c] + bestDown;\n\t\t\t\t\tlong getAndRight = vals[r][c] + dp[r][c + 1][1];\n\t\t\t\t\tdp[r][c][0] = max4(down, right, getAndDown, getAndRight);\n\t\t\t\t}\n\t\t\t\t{\n\t\t\t\t\tlong down = bestDown;\n\t\t\t\t\tlong right = dp[r][c + 1][1];\n\t\t\t\t\tlong getAndDown = vals[r][c] + bestDown;\n\t\t\t\t\tlong getAndRight = vals[r][c] + dp[r][c + 1][2];\n\t\t\t\t\tdp[r][c][1] = max4(down, right, getAndDown, getAndRight);\n\t\t\t\t}\n\n\t\t\t\t{\n\t\t\t\t\tlong down = bestDown;\n\t\t\t\t\tlong right = dp[r][c + 1][2];\n\t\t\t\t\tlong getAndDown = vals[r][c] + bestDown;\n\t\t\t\t\tlong getAndRight = vals[r][c] + dp[r][c + 1][3];\n\t\t\t\t\tdp[r][c][2] = max4(down, right, getAndDown, getAndRight);\n\t\t\t\t}\n\n\t\t\t\t{\n\t\t\t\t\tlong down = bestDown;\n\t\t\t\t\tlong right = dp[r][c + 1][3];\n\t\t\t\t\tlong getAndDown = bestDown;\n\t\t\t\t\tlong getAndRight = dp[r][c + 1][3];\n\t\t\t\t\tdp[r][c][3] = max4(down, right, getAndDown, getAndRight);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n//\t\tfor(int r = 0;r < n; r++ ) {\n//\t\t\tfor (int c = 0; c < m; c++) {\n//\t\t\t\tSystem.out.print(\"[\" + dp[r][c][0] +\" , \"+dp[r][c][1]+\" , \"+ dp[r][c][0] +\" , \"+dp[r][c][1] + \"] \");\n//\t\t\t}\n//\t\t\tSystem.out.println();\n//\t\t}\n\t\tlong ans = max4(dp[0][0][0], dp[0][0][1], dp[0][0][2], dp[0][0][3]);\n\t\tout.println(ans);\n\n\t}\n\n\tstatic long max4(long a, long b, long c, long d) {\n\t\treturn Math.max(Math.max(a, b), Math.max(c, d));\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// long start = System.nanoTime();\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t\t// System.out.println(\"Elapsed: \" + (System.nanoTime() - start) / 1000000 +\n\t\t// \"ns\");\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static class In {\n\t\tfinal private static int BUFFER_SIZE = 1024;\n\t\tprivate byte[] buf;\n\t\tprivate InputStream is;\n\t\tprivate int buflen;\n\t\tprivate int bufptr;\n\n\t\tpublic In() {\n\t\t\tis = System.in;\n\t\t\tbuf = new byte[BUFFER_SIZE];\n\t\t\tbuflen = bufptr = 0;\n\t\t}\n\n\t\tpublic In(String input) {\n\t\t\tis = new ByteArrayInputStream(input.getBytes());\n\t\t\tbuf = new byte[BUFFER_SIZE];\n\t\t\tbuflen = bufptr = 0;\n\t\t}\n\n\t\tpublic int readByte() {\n\t\t\tif (bufptr >= buflen) {\n\t\t\t\ttry {\n\t\t\t\t\tbuflen = is.read(buf);\n\t\t\t\t} catch (IOException ioe) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tbufptr = 0;\n\t\t\t}\n\t\t\tif (buflen <= 0)\n\t\t\t\treturn -1;\n\t\t\treturn buf[bufptr++];\n\t\t}\n\n\t\tpublic boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tpublic int skip() {\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t\t;\n\t\t\treturn b;\n\t\t}\n\n\t\t/* Next character */\n\t\tpublic char nc() {\n\t\t\treturn (char) skip();\n\t\t}\n\n\t\t/* Next double */\n\t\tpublic double nd() {\n\t\t\treturn Double.parseDouble(ns());\n\t\t}\n\n\t\t/* Next string */\n\t\tpublic String ns() {\n\t\t\tfinal StringBuilder sb = new StringBuilder();\n\t\t\tint b = skip();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\t/* Next integer */\n\t\tpublic int ni() {\n\t\t\tboolean minus = false;\n\t\t\tint num = 0;\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\twhile (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn minus ? -num : num;\n\t\t}\n\n\t\t/* Next long */\n\t\tpublic long nl() {\n\t\t\tboolean minus = false;\n\t\t\tlong num = 0;\n\t\t\tint b;\n\t\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t\t;\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\twhile (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn minus ? -num : num;\n\t\t}\n\n\t\t/* Next integer 1D array */\n\t\tpublic int[] nia(int n) {\n\t\t\tfinal int[] arr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = ni();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next long 1D array */\n\t\tpublic long[] nla(int n) {\n\t\t\tfinal long[] arr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = nl();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next string 1D array */\n\t\tpublic String[] nsa(int n) {\n\t\t\tfinal String[] arr = new String[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = ns();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next char 1D array */\n\t\tpublic char[] nca(int n) {\n\t\t\tfinal char[] arr = new char[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = nc();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next double 1D array */\n\t\tpublic double[] nda(int n) {\n\t\t\tfinal double[] arr = new double[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarr[i] = nc();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next integer matrix */\n\t\tpublic int[][] nim(int n, int m) {\n\t\t\tfinal int[][] arr = new int[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = ni();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next long matrix */\n\t\tpublic long[][] nlm(int n, int m) {\n\t\t\tfinal long[][] arr = new long[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = nl();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next string matrix */\n\t\tpublic String[][] nsm(int n, int m) {\n\t\t\tfinal String[][] arr = new String[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = ns();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next char matrix */\n\t\tpublic char[][] ncm(int n, int m) {\n\t\t\tfinal char[][] arr = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = nc();\n\t\t\treturn arr;\n\t\t}\n\n\t\t/* Next double matrix */\n\t\tpublic double[][] ndm(int n, int m) {\n\t\t\tfinal double[][] arr = new double[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tarr[i][j] = nd();\n\t\t\treturn arr;\n\t\t}\n\n\t\tpublic static void log(Object... o) {\n\t\t\tSystem.out.println(Arrays.deepToString(o));\n\t\t}\n\t}\n\n}\n", "import sys\n\nR, C, K = map(int, input().split())\nitem = [[0] * (C + 1) for _ in range(R + 1)] # dp配列と合わせるために, 0行目, 0列目を追加している.\nfor s in sys.stdin.readlines():\n r, c, v = map(int, s.split())\n item[r][c] = v\n\ndp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]\nfor i in range(R + 1):\n for j in range(C + 1):\n for k in range(4):\n here = dp[k][i][j]\n if i + 1 <= R:\n dp[0][i + 1][j] = max(dp[0][i + 1][j], here)\n dp[1][i + 1][j] = max(dp[1][i + 1][j], here + item[i + 1][j])\n if j + 1 <= C:\n dp[k][i][j + 1] = max(dp[k][i][j + 1], here)\n if k < 3:\n dp[k + 1][i][j + 1] = max(dp[k + 1][i][j + 1], here + item[i][j + 1])\nans = 0\nfor k in range(4):\n ans = max(ans, dp[k][-1][-1])\nprint(ans)", "#import<bits/stdc++.h>\n#define endl '\\n'\nusing namespace std;\ntypedef long long LL;\nLL i,j,k,m,n,s,v,x,y,e[3018][3018],f[3018][3018],g[3018][3018],h[3018][3018],p[3018][3018];\nint main()\n{\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tcout.tie(0);\n\tcin>>n>>m>>k;\n\tfor(;i++<k;)\n\t{\n\t\tcin>>x>>y>>v;\n\t\tp[x][y]=v;\n\t}\n\tfor(i=0;i++<n;)\n\t{\n\t\tfor(j=0;j++<m;)\n\t\t{\n\t\t\tv=max(max(e[i-1][j],f[i-1][j]),max(g[i-1][j],h[i-1][j]));\n\t\t\tif(p[i][j])\n\t\t\t{\n\t\t\t\te[i][j]=max(e[i][j-1],v);\n\t\t\t\tf[i][j]=max(f[i][j-1],e[i][j]+p[i][j]);\n\t\t\t\tg[i][j]=max(g[i][j-1],f[i][j-1]+p[i][j]);\n\t\t\t\th[i][j]=max(h[i][j-1],g[i][j-1]+p[i][j]);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\te[i][j]=max(e[i][j-1],v);\n\t\t\t\tf[i][j]=f[i][j-1];\n\t\t\t\tg[i][j]=g[i][j-1];\n\t\t\t\th[i][j]=h[i][j-1];\n\t\t\t}\n\t\t}\n\t}\n\tcout<<max(max(e[n][m],f[n][m]),max(g[n][m],h[n][m]));\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int R,C,K;\n cin>>R>>C>>K;\n vector<vector<int64_t>> p(R,vector<int64_t>(C));\n for(int i=0;i<K;i++){\n int a,b;\n int64_t c;\n cin>>a>>b>>c;\n a--,b--;\n p[a][b]=c;\n }\n vector<int64_t> dp(C);\n for(int i=0;i<R;i++){\n vector<int64_t> ndp(C);\n vector<int64_t> kdp(4);\n for(int j=0;j<C;j++){\n kdp[0]=max(kdp[0],dp[j]);\n ndp[j]=kdp[0];\n for(int k=2;k>=0;k--){\n kdp[k+1]=max(kdp[k+1],kdp[k]+p[i][j]);\n ndp[j]=max(ndp[j],kdp[k+1]);\n } \n }\n dp=ndp;\n }\n cout<<dp[C-1]<<endl;\n}", "# from sys import stdin\n# input = stdin.readline\n(R,C,K) = map(int, input().split())\nrcv = [list(map(int, input().split())) for _ in range(K)]\n \ngrids = [[0]*C for _ in range(R)]\n \nfor r,c,v in rcv:\n grids[r-1][c-1] = v\n \ndp = [0] * C\n\nfor r in range(R):\n# print(dp)\n ndp = [0] * C\n elm = [0] * 4\n for c in range(C):\n elm[0] = max(elm[0], dp[c])\n value = grids[r][c]\n if value:\n nelm = [0] * 4\n nelm[0] = elm[0]\n# print(f'{value=}')\n# print(f'{ elm=}')\n# print(f'{nelm=}')\n for i in range(3)[::-1]:\n nelm[i + 1] = max(elm[i + 1], elm[i] + value)\n# print(f'{value=}')\n# print(f'{ elm=}')\n# print(f'{nelm=}')\n elm = nelm\n ndp[c] = max(elm)\n dp = ndp\n \n\nprint(dp[-1])", "#include<bits/stdc++.h>\nusing namespace std;\nlong long val[4000][4000];\nlong long dp[3001][3001][4];\nlong long max_val(long long r,long long c, long long cnt)\n{\n\tif(r<0 || c<0)\n\t\treturn 0;\n\tif(dp[r][c][cnt]!=-1)\n\t\treturn dp[r][c][cnt];\n\tlong long c1=0, c2=0;\n\tif(cnt>0)\n\t\tc1 = max(max_val(r-1,c,3),max_val(r,c-1,cnt-1)) + val[r][c];\n\n\tc2 = max(max_val(r-1,c,3),max_val(r,c-1,cnt));\n\tdp[r][c][cnt] = max(c1,c2);\n\treturn dp[r][c][cnt];\n}\nint main()\n{\n\tlong long r,c,k;\n\tcin>>r>>c>>k;\n\tfor (int i = 0; i <= r; ++i)\n\t{\n\t\tfor(int j = 0; j <= c ;j++)\n\t\t{\n\t\t\tfor (int h = 0; h < 4; ++h)\n\t\t\t{\n\t\t\t\tdp[i][j][h] = -1;\n\t\t\t}\n\t\t}\n\t}\n\tfor (long long i = 0; i < k; ++i)\n\t{\n\t\tlong long x,y,v;\n\t\tcin>>x>>y>>v;\n\t\tval[x-1][y-1] = v;\n\t}\n\n\tcout<<max_val(r-1,c-1,3)<<endl;\n\n\t\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nusing ll = long long;\n#define chmax(x,y) x = max(x,y)\n\nint Item[3005][3005];\nll DP[3005][3005][4];\n\nint main(){\n int R,C,k;cin>>R>>C>>k;\n rep(i,k){\n int r,c,v;\n scanf(\"%d %d %d\",&r,&c,&v);\n r--;c--;\n Item[r][c]=v;\n }\n rep(i,R)rep(j,C){\n for(int k=2;k>=0;k--){\n chmax(DP[i][j][k+1],DP[i][j][k]+Item[i][j]);\n }\n rep(k,4){\n chmax(DP[i+1][j][0],DP[i][j][k]);\n chmax(DP[i][j+1][k],DP[i][j][k]);\n }\n }\n\n ll ans=0;\n rep(k,4)chmax(ans,DP[R-1][C-1][k]);\n cout<<ans<<endl;\n}", "R,C,K = map(int, input().split())\n\nd = [[0 for _ in range(C+1)] for _ in range(R+1)]\ndp = [[[0 for _ in range(C+1)] for _ in range(R+1)] for _ in range(4)]\n\nfor i in range(K):\n r, c, v = map(int, input().split())\n d[r-1][c-1] = v\nfor i in range(R):\n for j in range(C):\n # kが大きい方からやらないとダメ。01ナップサックと同じ考え方。書き換えられた値を見ないように。\n for k in range(2, -1, -1):\n # 拾う遷移。d[i][j]を取るかどうかという判定\n dp[k+1][i][j] = max(dp[k+1][i][j], dp[k][i][j] + d[i][j])\n for k in range(4):\n dp[0][i+1][j] = max(dp[0][i+1][j], dp[k][i][j])\n dp[k][i][j+1] = max(dp[k][i][j+1], dp[k][i][j])\nans = 0\n\nfor k in range(4):\n ans = max(ans, dp[k][R-1][C-1])\nprint(ans) ", "#!/usr/bin/env python3\nr, c, k = map(int, input().split())\nitems = [[0] * (c+1) for _ in range(r+1)]\nfor _ in range(k):\n R, C, V = map(int, input().split())\n items[R][C] = V\n\ndp1 = [[0] * (c+1) for _ in range(r+1)]\ndp2 = [[0] * (c+1) for _ in range(r+1)]\ndp3 = [[0] * (c+1) for _ in range(r+1)]\n\nfor i in range(1, r+1):\n for j in range(1, c+1):\n dp1[i][j] = max(dp1[i][j-1], dp1[i-1][j] + items[i][j], dp2[i-1][j] + items[i][j], dp3[i-1][j] + items[i][j])\n dp2[i][j] = max(dp2[i][j-1], dp1[i][j-1] + items[i][j])\n dp3[i][j] = max(dp3[i][j-1], dp2[i][j-1] + items[i][j])\n\nans = max(dp1[r][c], dp2[r][c], dp3[r][c])\nprint(ans)", "import sys\ninput = sys.stdin.readline\n\nR, C, K = map(int, input().split())\nitems = [[0] * (C+1) for _ in range(R+1)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n items[r][c] = v\ndp = [[0] * 4 for _ in range(C+1)]\nfor i in range(1, R+1):\n ndp = [[0] * 4 for _ in range(C+1)]\n for j in range(1, C+1):\n for k in range(4):\n ndp[j][0] = max(ndp[j][0], dp[j][k])\n ndp[j][k] = max(ndp[j][k], ndp[j-1][k])\n if items[i][j]:\n for k in range(3, 0, -1):\n ndp[j][k] = max(ndp[j][k], ndp[j][k-1] + items[i][j])\n dp = ndp\nprint(max(dp[C]))", "import java.util.Arrays;\n\npublic class Main {\n\n private static void solve() {\n int r = ni();\n int c = ni();\n\n int k = ni();\n\n long[][] table = new long[r][c];\n for (int i = 0; i < k; i++) {\n int y = ni() - 1;\n int x = ni() - 1;\n int v = ni();\n table[y][x] = v;\n }\n\n long[][][] dp = new long[r][c][4];\n for (long[][] v : dp)\n for (long[] u : v)\n Arrays.fill(u, Long.MIN_VALUE / 2);\n dp[0][0][0] = 0;\n\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n\n if (i > 0) {\n for (int s = 0; s < 4; s++) {\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i - 1][j][s]);\n }\n }\n if (j > 0)\n for (int s = 0; s < 4; s++) {\n dp[i][j][s] = Math.max(dp[i][j][s], dp[i][j - 1][s]);\n }\n\n if (table[i][j] > 0)\n for (int s = 3; s > 0; s--) {\n dp[i][j][s] = Math.max(dp[i][j][s], dp[i][j][s - 1] + table[i][j]);\n }\n }\n }\n\n long ret = 0;\n for (int s = 0; s < 4; s++) {\n ret = Math.max(dp[r - 1][c - 1][s], ret);\n }\n System.out.println(ret);\n }\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = args.length > 0 ? args[0] : null;\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n", "#include <bits/stdc++.h>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint r,c,k;\nll dp[3005][3005][4];\nll fie[3005][3005];\n\nint main(void){\n\tscanf(\"%d%d%d\",&r,&c,&k);\n\tfor(int i=0;i<k;i++){\n\t\tint a,b,c;\n\t\tscanf(\"%d%d%d\",&a,&b,&c);\n\t\ta--;\n\t\tb--;\n\t\tfie[a][b]=c;\n\t}\n\tdp[0][0][0]=0;\n\tfor(int i=0;i<r;i++){\n\t\tfor(int j=0;j<c;j++){\n\t\t\tfor(int k=0;k<=3;k++){\n\t\t\t\tdp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n\t\t\t\tdp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n\t\t\t\tif(k<3){\n\t\t\t\t\tdp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]+fie[i][j]);\n\t\t\t\t\tdp[i][j+1][k+1]=max(dp[i][j+1][k+1],dp[i][j][k]+fie[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tll ans=0;\n\tfor(int i=0;i<=3;i++){\n\t\tans=max(ans,dp[r-1][c-1][i]);\n\t\tif(i<3){\n\t\t\tans=max(ans,dp[r-1][c-1][i]+fie[r-1][c-1]);\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}\n", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] sa = br.readLine().split(\" \");\n\t\tint h = Integer.parseInt(sa[0]);\n\t\tint w = Integer.parseInt(sa[1]);\n\t\tint k = Integer.parseInt(sa[2]);\n\t\tint[][] v = new int[h + 1][w + 1];\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tsa = br.readLine().split(\" \");\n\t\t\tint r = Integer.parseInt(sa[0]);\n\t\t\tint c = Integer.parseInt(sa[1]);\n\t\t\tv[r][c] = Integer.parseInt(sa[2]);\n\t\t}\n\t\tbr.close();\n\n\t\tlong[][][] dp = new long[h + 1][w + 1][4];\n\t\tfor (int x = 1; x <= h; x++) {\n\t\t\tfor (int y = 1; y <= w; y++) {\n\t\t\t\tfor (int z = 1; z <= 3; z++) {\n\t\t\t\t\tdp[x][y][z] = Math.max(dp[x][y - 1][z], dp[x][y - 1][z - 1] + v[x][y]);\n\t\t\t\t}\n\t\t\t\tlong ue = max(dp[x - 1][y]);\n\t\t\t\tdp[x][y][0] = Math.max(dp[x][y - 1][0], ue);\n\t\t\t\tdp[x][y][1] = Math.max(dp[x][y][1], ue + v[x][y]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max(dp[h][w]));\n\t}\n\n\tstatic long max(long[] a) {\n\t\tlong ret = 0;\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tret = Math.max(ret, a[i]);\n\t\t}\n\t\treturn ret;\n\t}\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n \n final int R = sc.nextInt();\n final int C = sc.nextInt();\n final int K = sc.nextInt();\n \n final int[][] Vs = new int[R][C];\n for (int k = 0; k < K; k++) {\n int r = sc.nextInt() - 1;\n int c = sc.nextInt() - 1;\n int v = sc.nextInt();\n Vs[r][c] = v;\n }\n \n final long[][][] dp = new long[R][C][4];\n \n // 原点\n {\n int v = Vs[0][0];\n if (0 < v) {\n dp[0][0][1] = v;\n }\n }\n \n // 左端\n for (int i = 1; i < R; i++) {\n dp[i][0][0] = Long.max(dp[i - 1][0][0], dp[i - 1][0][1]);\n \n int v = Vs[i][0];\n if (0 < v) {\n dp[i][0][1] = dp[i][0][0] + v;\n }\n }\n \n // 上端\n for (int j = 1; j < C; j++) {\n int v = Vs[0][j];\n if (0 < v) {\n dp[0][j][0] = dp[0][j - 1][0];\n dp[0][j][1] = Long.max(dp[0][j - 1][1], dp[0][j - 1][0] + v);\n dp[0][j][2] = Long.max(dp[0][j - 1][2], dp[0][j - 1][1] + v);\n dp[0][j][3] = Long.max(dp[0][j - 1][3], dp[0][j - 1][2] + v);\n } else {\n dp[0][j] = dp[0][j - 1];\n }\n }\n \n // メイン部分\n for (int i = 1; i < R; i++) {\n for (int j = 1; j < C; j++) {\n int v = Vs[i][j];\n long vFromUpper = max4(dp[i - 1][j]);\n if (0 < v) {\n dp[i][j][0] = Long.max(dp[i][j - 1][0], vFromUpper);\n dp[i][j][1] = max3(dp[i][j - 1][1], dp[i][j - 1][0] + v, vFromUpper + v);\n dp[i][j][2] = Long.max(dp[i][j - 1][2], dp[i][j - 1][1] + v);\n dp[i][j][3] = Long.max(dp[i][j - 1][3], dp[i][j - 1][2] + v);\n \n } else if (dp[i][j - 1][0] < vFromUpper) {\n dp[i][j][0] = vFromUpper;\n dp[i][j][1] = dp[i][j - 1][1];\n dp[i][j][2] = dp[i][j - 1][2];\n dp[i][j][3] = dp[i][j - 1][3];\n } else {\n dp[i][j] = dp[i][j - 1];\n }\n }\n }\n \n System.out.println(max4(dp[R - 1][C - 1]));\n }\n \n private static long max3(long val1, long val2, long val3) {\n return Long.max(Long.max(val1, val2), val3);\n }\n \n private static long max4(long[] vals) {\n return Long.max(Long.max(vals[0], vals[1]), Long.max(vals[2], vals[3]));\n }\n}\n", "import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.stream.IntStream;\n\n/**\n * 解説通りに実装したソースコード\n */\npublic class Main {\n\n\t/** 一行で最大拾うアイテム数+1 */\n\tprivate static final int MAX = 4;\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint r = scanner.nextInt(), c = scanner.nextInt(), k = scanner.nextInt();\n\t\t\tlong[][] v = new long[r][c];\n\t\t\tIntStream.range(0, r).forEach(i -> Arrays.fill(v[i], 0L));\n\t\t\tIntStream.range(0, k).forEach(i -> v[scanner.nextInt() - 1][scanner.nextInt() - 1] = scanner.nextLong());\n\t\t\tlong[][][] dp = new long[MAX][r][c];\n\t\t\tdp[0][0][0] = 0L;\n\t\t\tdp[1][0][0] = v[0][0];\n\t\t\tIntStream.range(0, r).forEach(i -> IntStream.range(0, c).forEach(j -> {\n\t\t\t\tif (i > 0) {\n\t\t\t\t\tdp[0][i][j] = max(dp[0][i][j],\n\t\t\t\t\t\t\tIntStream.range(0, MAX).mapToLong(l -> dp[l][i - 1][j]).max().getAsLong());\n\t\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\t\tdp[1][i][j] = max(dp[1][i][j],\n\t\t\t\t\t\t\t\tIntStream.range(0, MAX).mapToLong(l -> dp[l][i - 1][j]).max().getAsLong() + v[i][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (j > 0) {\n\t\t\t\t\tif (v[i][j] > 0) {\n\t\t\t\t\t\tdp[0][i][j] = max(dp[0][i][j], dp[0][i][j - 1]);\n\t\t\t\t\t\tIntStream.range(1, MAX).forEach(\n\t\t\t\t\t\t\t\tl -> dp[l][i][j] = max(dp[l][i][j], dp[l - 1][i][j - 1] + v[i][j], dp[l][i][j - 1]));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tIntStream.range(0, MAX).forEach(l -> dp[l][i][j] = max(dp[l][i][j], dp[l][i][j - 1]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}));\n\t\t\tSystem.out.println(IntStream.range(0, MAX).mapToLong(l -> dp[l][r - 1][c - 1]).max().getAsLong());\n\t\t}\n\t}\n\n\t/**\n\t * 複数のlongのmaxを取得する\n\t * \n\t * @param a 一つ目のlong\n\t * @param b 二つ目以降のlong\n\t * @return 複数のlongのmax\n\t */\n\tprivate static long max(long a, long... b) {\n\t\tlong result = a;\n\t\tfor (long l : b) {\n\t\t\tresult = Math.max(result, l);\n\t\t}\n\t\treturn result;\n\t}\n}\n", "r, c, k = map(int, input().split())\ndp = [[[0] * (c+1) for _ in range(r+1)] for _ in range(4)]\n\nv_dict = dict()\nfor _ in range(k):\n y, x, v = map(int, input().split())\n v_dict[(y, x)] = v\n\nfor y in range(1, r+1):\n for x in range(1, c+1):\n prev_y_max = 0\n for i in range(4):\n prev_y_max = max(dp[i][y-1][x], prev_y_max)\n dp[0][y][x] = max(prev_y_max, dp[0][y][x-1])\n if (y, x) in v_dict:\n v = v_dict[(y, x)]\n dp[1][y][x] = max(prev_y_max + v, dp[0][y][x-1] + v, dp[1][y][x-1])\n dp[2][y][x] = max(dp[1][y][x-1] + v, dp[2][y][x-1])\n dp[3][y][x] = max(dp[2][y][x-1] + v, dp[3][y][x-1])\n else:\n for i in range(1, 4):\n dp[i][y][x] = dp[i][y][x-1]\nans = 0\nfor i in range(4):\n ans = max(dp[i][r][c], ans)\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int MAX = 3050;\nint r,c,k,x,y,val;\nll dp[MAX][MAX][4];\nll room[MAX][MAX];\nint main() {\n cin>>r>>c>>k;\n while(k--){\n cin>>x>>y>>val;\n room[x][y]=val;\n }\n for(int i=1;i<=r;i++){\n for(int j=1;j<=c;j++){\n for(int k=1;k<=3;k++){\n dp[i][j][k]=max(max(room[i][j]+dp[i-1][j][3],dp[i][j-1][k]),room[i][j]+dp[i][j-1][k-1]);\n }\n }\n }\n cout<<dp[r][c][3];\n return 0;\n}\n", "R,C,K = map(int,input().split())\nRCV = [list(map(int,input().split())) for _ in [0]*K]\n\nV = [[0]*(C+1) for _ in [0]*(R+1)]\n\nfor r,c,v in RCV:\n V[r][c] = v\n\nans = [[[0]*(C+1) for _ in [0]*(R+1)] for _ in [0]*4]\n\nfor r in range(1,R+1):\n for c in range(C+1):\n ans[0][r][c] = max(ans[0][r-1][c],ans[1][r-1][c],ans[2][r-1][c],ans[3][r-1][c])\n i = 1\n for c in range(1,C+1):\n ans[i][r][c] = max(ans[i][r][c],ans[i][r][c-1],ans[i-1][r][c]+V[r][c])\n for i in range(2,4):\n for c in range(1,C+1):\n ans[i][r][c] = max(ans[i][r][c],ans[i][r][c-1],ans[i-1][r][c-1]+V[r][c])\n\nout = max(ans[0][-1][-1],ans[1][-1][-1],ans[2][-1][-1],ans[3][-1][-1])\nprint(out)", "def main():\n import sys\n input=sys.stdin.readline\n h,w,k=map(int,input().split())\n H=range(h)\n W=range(w)\n dp=[[[0]*w for j in H] for i in range(4)]\n for _ in range(k):\n r,c,v=map(int,input().split())\n dp[0][r-1][c-1]=v\n if dp[0][0][0]!=0:\n dp[1][0][0]=dp[0][0][0]\n dp[0][0][0]=0\n for y in H:\n for x in W:\n v=dp[0][y][x]\n dp[0][y][x]=0\n for i in range(4):\n if 0<x:\n if dp[i][y][x]<dp[i][y][x-1]:\n dp[i][y][x]=dp[i][y][x-1]\n if 0<i and v!=0 and dp[i][y][x]<dp[i-1][y][x-1]+v:\n dp[i][y][x]=dp[i-1][y][x-1]+v\n if 0<y:\n if dp[0][y][x]<dp[i][y-1][x]:\n dp[0][y][x]=dp[i][y-1][x]\n if v!=0 and dp[1][y][x]<dp[i][y-1][x]+v:\n dp[1][y][x]=dp[i][y-1][x]+v\n print(max([dp[i][h-1][w-1] for i in range(4)]))\nmain()", "r, c, k = map(int, input().split())\nitem = [[0] * (c + 1) for _ in range(r + 1)] # dp配列と合わせるために, 0行目, 0列目を追加している.\nfor _ in range(k):\n i, j, v = map(int, input().split())\n item[i][j] = v\n\ndp = [[[0] * (c + 1) for _ in range(r + 1)] for _ in range(4)]\nfor i in range(r + 1):\n for j in range(c + 1):\n for k in range(4):\n here = dp[k][i][j]\n\n if i + 1 <= r:\n dp[0][i + 1][j] = max(dp[0][i + 1][j], here)\n dp[1][i + 1][j] = max(dp[1][i + 1][j], here + item[i + 1][j])\n\n if j + 1 <= c:\n dp[k][i][j + 1] = max(dp[k][i][j + 1], here)\n if k < 3:\n dp[k + 1][i][j + 1] = max(dp[k + 1][i][j + 1], here + item[i][j + 1])\n\nans = max(dp[k][-1][-1] for k in range(4))\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint r,c,k;\nint a[3005][3005];\nll dp[3005][3005][3];\nll f(int row,int col,int cnt)\n{\n ll &ret=dp[row][col][cnt];\n if(row>r||col>c) ret=0;\n if(ret!=-1) return ret;\n ret=0;\n if(a[row][col])\n {\n ret+=a[row][col];\n if(cnt==2)\n ret+=f(row+1,col,0);\n else\n ret+=max(f(row+1,col,0),f(row,col+1,cnt+1));\n }\n ret=max({ret,f(row+1,col,0),f(row,col+1,cnt)});\n return ret;\n}\nint main(void)\n{\n cin>>r>>c>>k;\n memset(a,0,sizeof(a));\n memset(dp,-1,sizeof(dp));\n for(int i=0;i<k;++i)\n {\n int row,col,val;\n cin>>row>>col>>val;\n a[row][col]=val;\n }\n cout<<f(1,1,0)<<endl;\n return 0;\n}", "R,C,k=map(int,input().split())\nrcv = [[0 for _ in range(C+1)] for _ in range(R+1)]\nfor i in range(k):\n r,c,v = map(int,input().split())\n rcv[r][c] = v\n# dp: 各場所までの合計の最大値\ndp0=[[0 for _ in range(C+1)] for _ in range(R+1)]\ndp1=[[0 for _ in range(C+1)] for _ in range(R+1)]\ndp2=[[0 for _ in range(C+1)] for _ in range(R+1)]\ndp3=[[0 for _ in range(C+1)] for _ in range(R+1)]\ndp1[1][1] = rcv[1][1]\nfor r in range(1,R+1):\n for c in range(1,C+1):\n dp1[r][c] = max(dp0[r][c]+rcv[r][c],dp0[r][c-1]+rcv[r][c],dp1[r][c-1])\n dp2[r][c] = max(dp1[r][c-1]+rcv[r][c],dp2[r][c-1])\n dp3[r][c] = max(dp2[r][c-1]+rcv[r][c],dp3[r][c-1])\n \n if r < R:\n dp0[r+1][c] = max(dp0[r][c],dp1[r][c],dp2[r][c],dp3[r][c])\nprint(max(dp0[R][C],dp1[R][C],dp2[R][C],dp3[R][C]))", "#include <bits/stdc++.h>\nusing namespace std; \n\n#define ll long long\n\nll n,m,k;\nll a[3000][3000];\nll dp[3000][3000][4];\n\nll solve(int i,int j,int rem){\n\tif(i==n-1 && j==m-1){\n\t\tif(a[i][j]!=0 && rem>=1) return a[i][j];\n\t\telse return 0;\n\t}\n\tif(dp[i][j][rem]!=-1LL) return dp[i][j][rem];\n\tll req = 0;\n\tif(j+1<m){\n\t\treq = max(req,solve(i,j+1,rem));\n\t\tif(rem>0 && a[i][j]!=0) req = max(req,a[i][j] + solve(i,j+1,rem-1));\n\t}\n\tif(i+1<n){\n\t\treq = max(req,solve(i+1,j,3));\n\t\tif(rem>0 && a[i][j]!=0) req = max(req,a[i][j] + solve(i+1,j,3));\n\t}\n\tdp[i][j][rem] = req;\n\treturn req;\n}\n\nint main() {\n\tmemset(a,0,sizeof(a));\n\tmemset(dp,-1LL,sizeof(dp));\n\tcin>>n>>m>>k;\n\tfor(ll i=0;i<k;i++){\n\t\tll r,c,v;\n\t\tcin>>r>>c>>v;\n\t\tr--;c--;\n\t\ta[r][c] = v;\n\t}\n\tcout<<solve(0,0,3)<<\"\\n\";\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);\n#define ll long long\nconst int N=3e3+5;\nll a[N][N],dp[N][N][4],n,m;\nll go(ll i,ll j,ll k)\n{\n if(i==n+1 || j==m+1)\n {\n return 0;\n }\n else if(dp[i][j][k]!=-1)\n {\n return dp[i][j][k];\n }\n else if(k==3)\n {\n return go(i+1,j,0);\n }\n else\n {\n return dp[i][j][k]=max({go(i+1,j,0)+a[i][j],go(i,j+1,k+1)+a[i][j],go(i,j+1,k)});\n }\n}\nint main()\n{\n ft\n ll t,i,j,k,l,r,p;\n cin>>n>>m>>k;\n memset(a,0,sizeof(a));\n memset(dp,-1,sizeof(dp));\n for(i=0;i<k;i++)\n {\n cin>>l>>r>>p;\n a[l][r]=p;\n }\n cout<<go(1,1,0)<<\"\\n\";\n return 0;\n}\n\n", "import sys\ndef input(): return sys.stdin.readline().strip()\ndef mapint(): return map(int, input().split())\nsys.setrecursionlimit(10**9)\n\nR, C, K = mapint()\ndp = [[[0]*C for _ in range(R)] for _ in range(4)]\nfrom collections import defaultdict\ndic = [[0]*C for _ in range(R)]\nfor _ in range(K):\n r, c, v = mapint()\n dic[r-1][c-1] = v\n\nfor r in range(R):\n for c in range(C):\n v = dic[r][c]\n for i in range(4):\n if c!=0:\n dp[i][r][c] = dp[i][r][c-1]\n if r!=0:\n dp[0][r][c] = max(dp[0][r][c], dp[i][r-1][c])\n for i in range(2, -1, -1):\n dp[i+1][r][c] = max(dp[i+1][r][c], dp[i][r][c]+v)\n\nans = 0\nfor i in range(4):\n ans = max(ans, dp[i][R-1][C-1])\nprint(ans)\n", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n int[][] V = new int[R][C];\n for (int i = 0; i < K; i++) {\n int r = sc.nextInt();\n int c = sc.nextInt();\n int v = sc.nextInt();\n V[--r][--c] = v;\n }\n\n long[][][] dp = new long[R][C][4];\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 0; k <= 3; k++) {\n dp[i][j][k] = -1;\n }\n }\n }\n dp[0][0][3] = 0;\n if (V[0][0] > 0) dp[0][0][2] = V[0][0];\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n long max = 0;\n for (int k = 0; k <= 3; k++) {\n max = Math.max(max,dp[i][j][k]);\n }\n for (int k = 0; k <= 3; k++) {\n if (dp[i][j][k] == -1) continue;\n if (i+1 < R) {\n // i+1\n if (V[i+1][j] > 0) {\n dp[i+1][j][2] = Math.max(dp[i+1][j][2],max+V[i+1][j]);\n }\n dp[i+1][j][3] = Math.max(dp[i+1][j][3],max);\n }\n if (j+1 < C) {\n // j+1\n if (V[i][j+1] > 0 && k > 0) {\n dp[i][j+1][k-1] = Math.max(dp[i][j+1][k-1],dp[i][j][k]+V[i][j+1]);\n }\n dp[i][j+1][k] = Math.max(dp[i][j+1][k],dp[i][j][k]);\n }\n }\n }\n }\n\n long ans = 0;\n for (int k = 0; k <= 3; k++) {\n ans = Math.max(ans,dp[R-1][C-1][k]);\n }\n System.out.println(ans);\n }\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\n\nint main() {\n\tint r, c, k; cin >> r >> c >> k;\n\tvector<vector<ll> > g1(r + 1, vector<ll> (c + 1)), g2(g1), g3(g2), g(g1);\n\tfor (int i = 0; i < k; ++i) {\n\t\tint row, col, val; cin >> row >> col >> val;\n\t\tg[row][col] = val;\n\t}\n\tg1[1][1] = g2[1][1] = g3[1][1] = g[1][1];\n\tfor (int i = 1; i <= r; ++i) {\n\t\tfor (int j = 1; j <= c; ++j) {\n\t\t\t\n\t\t\t\tif (i > 1) {\n\t\t\t\t\tg1[i][j] = g3[i-1][j] + g[i][j] ;\n\t\t\t\t\tg2[i][j] = g1[i][j];\n\t\t\t\t\tg3[i][j] = g2[i][j];\n\t\t\t\t}\n\t\t\t\tif (j > 1) {\n\t\t\t\t\tg1[i][j] = max({g[i][j], g1[i][j-1], g1[i][j]});\n\t\t\t\t\tg2[i][j] = max({g[i][j] + g1[i][j-1], g2[i][j], g2[i][j-1]});\n\t\t\t\t\tg3[i][j] = max({g3[i][j], g[i][j] + g2[i][j-1], g3[i][j-1]});\n\t\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\tcout << g3[r][c] << endl;\n}", "#include <bits/stdc++.h>\n#define pb push_back\ntypedef long long ll;\nusing namespace std;\nconst int mx = 3e3;\nll dp[mx + 3][mx + 3][5];\nll arr[mx + 3][mx + 3];\nint main() {\n\tll r, c, k;\n\tcin >> r >> c >> k;\n\twhile (k--) {\n\t\tll x, y, v;\n\t\tcin >> x >> y >> v;\n\t\tarr[x][y] = v;\n\t}\n\t\n\tfor (int i = 1; i <= r; ++i) {\n\t\tfor (int j = 1; j <= c; ++j) {\n\t\t\tdp[i][j][0] = dp[i - 1][j][4];\n\t\t\tdp[i][j][1] = max(dp[i][j - 1][1], max(dp[i - 1][j][4], dp[i][j - 1][0]) + arr[i][j]);\n dp[i][j][2] = max(dp[i][j - 1][1] + arr[i][j], dp[i][j - 1][2]);\n dp[i][j][3] = max(dp[i][j - 1][2] + arr[i][j], dp[i][j - 1][3]);\n\n for (int k = 0; k < 4; ++k)\n \tdp[i][j][4] = max(dp[i][j][k], dp[i][j][4]); \n\t\t}\n\t}\n\n\tcout << dp[r][c][4] << endl;\n}", "import java.io.*; \nimport java.math.*;\nimport java.util.*;\npublic class Main{ //~IQEmperor~ \n\tpublic static void main(String[] args) {\n\t\tFastScanner I = new FastScanner(); //Input\n\t\tOutPut O = new OutPut(); //Output\n\t\t/*long ret = 0;\n\t\tdouble s = System.nanoTime();\n\t\tfor (int i = 1; i <= 3000; i++) {\n\t\t\tfor (int j = 1; j <= 3000; j++) {\n\t\t\t\tfor (int k = 1; k <= 3000; k++) {\n\t\t\t\t\tret++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tO.pln(ret);\n\t\tdouble e = System.nanoTime();\n\t\te-=s;\n\t\tO.pln(e/(double)(1e9));*/\n\t\tint R = I.nextInt();\n\t\tint C = I.nextInt();\n\t\tint K = I.nextInt();\n\t\tlong[][] goods = new long[R][C];\n\t\tlong[][] dp = new long[R][C]; //{0,1,2,3} items picked up in row so far\n\t\tlong ans = 0;\n\t\twhile (K-->0) {\n\t\t\tint r = I.nextInt()-1;\n\t\t\tint c = I.nextInt()-1;\n\t\t\tgoods[r][c] = I.nextLong();\n\t\t}\n\t\tdp[0][0]=goods[0][0];\n\t\tArrayList<Long> items = new ArrayList<Long>();\n\t\tif (goods[0][0]>0) items.add(goods[0][0]);\n\t\tfor (int c = 1; c < C; c++) {\n\t\t\tif (goods[0][c]>0) {\n\t\t\t\titems.add(goods[0][c]);\n\t\t\t\tCollections.sort(items);\n\t\t\t\tfor (int i = items.size()-1; i>=max(items.size()-3,0); i--) {\n\t\t\t\t\tlong cur = items.get(i);\n\t\t\t\t\tdp[0][c]+=cur; //3 biggest\n\t\t\t\t}\n\t\t\t}else dp[0][c]=dp[0][c-1]; //Just rely on previous cell if no items \n\t\t}\n\t\tfor (int r = 1; r < R; r++) {\n\t\t\tdp[r][0]=dp[r-1][0]+goods[r][0];\n\t\t}\n\t\tfor (int r = 1; r < R; r++) {\n\t\t\tfor (int c = 1; c < C; c++) {\n\t\t\t\tif (goods[r][c]>0) {\n\t\t\t\t\tlong x = 0;\n\t\t\t\t\tlong y = 0;\n\t\t\t\t\tlong z = 0; //{x,y,z} indicate three biggest in sorted order \n\t\t\t\t\tfor (int back = c; back>=0; back--) {\n\t\t\t\t\t\tif (goods[r][back]>0) {\n\t\t\t\t\t\t\tif (goods[r][back]>z) {\n\t\t\t\t\t\t\t\tlong Y = z;\n\t\t\t\t\t\t\t\tlong X = y;\n\t\t\t\t\t\t\t\tz=goods[r][back];\n\t\t\t\t\t\t\t\ty=Y;\n\t\t\t\t\t\t\t\tx=X;\n\t\t\t\t\t\t\t}else if (goods[r][back]>y) {\n\t\t\t\t\t\t\t\tlong X = y;\n\t\t\t\t\t\t\t\ty=goods[r][back];\n\t\t\t\t\t\t\t\tx=X;\n\t\t\t\t\t\t\t}else if (goods[r][back]>x) {\n\t\t\t\t\t\t\t\tx=goods[r][back];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[r][c]=max(dp[r][c],dp[r-1][back]+x+y+z);\n\t\t\t\t\t}\n\t\t\t\t}else {\n\t\t\t\t\tdp[r][c]=max(dp[r-1][c],dp[r][c-1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tO.pln(dp[R-1][C-1]);\n\t}\n\tpublic static long min(long a, long b) {return Math.min(a,b);}\n\tpublic static long max(long a, long b) {return Math.max(a,b);}\n\tpublic static int min(int a, int b) {return Math.min(a,b);}\n\tpublic static int max(int a, int b) {return Math.max(a,b);}\n\tpublic static long abs(long x, long y) {return Math.abs(x-y);}\n\tpublic static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) \n\tans++; return ans;}\n\tpublic static long GCD(long a, long b) {\n\t\tif (a==0||b==0) return Math.max(a,b);\n\t\treturn GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));\n\t}\n\tpublic static long FastExp(long base, long exp, long mod) {\n\t\tlong ans=1;\n\t\twhile (exp>0) {\n\t\t\tif (exp%2==1) ans*=base;\n\t\t\texp/=2;\n\t\t\tbase*=base;\n\t\t\tbase%=mod;\n\t\t\tans%=mod;\n\t\t}\n\t\treturn ans;\n\t}\n\tpublic static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}\n\tpublic static int pop(long x) { //Returns number of bits within a number\n\t\tint cnt = 0;\n\t\twhile (x>0) {\n\t\t\tif (x%2==1) cnt++;\n\t\t\tx/=2;\n\t\t}\n\t\treturn cnt;\n\t}\n\tstatic class FastScanner {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st=new StringTokenizer(\"\");\n\t\tString next() {\n\t\t\twhile (!st.hasMoreTokens())\n\t\t\t\ttry {\n\t\t\t\t\tst=new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tint nextInt() {return Integer.parseInt(next());}\n\t\tlong nextLong() {return Long.parseLong(next());};\n\t\tdouble nextDouble() {return Double.parseDouble(next());}\n\t}\n\tstatic class OutPut{\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\tvoid pln(double x) {w.println(x);w.flush();}\n\t\tvoid pln(boolean x) {w.println(x);w.flush();}\n\t\tvoid pln(int x) {w.println(x);w.flush();}\n\t\tvoid pln(long x) {w.println(x);w.flush();}\n\t\tvoid pln(String x) {w.println(x);w.flush();}\n\t\tvoid pln(char x) {w.println(x);w.flush();}\n\t\tvoid pln(StringBuilder x) {w.println(x);w.flush();}\n\t\tvoid pln(BigInteger x) {w.println(x);w.flush();}\n\t\tvoid p(int x) {w.print(x);w.flush();}\n\t\tvoid p(long x) {w.print(x);w.flush();}\n\t\tvoid p(String x) {w.print(x);w.flush();}\n\t\tvoid p(char x) {w.print(x);w.flush();}\n\t\tvoid p(StringBuilder x) {w.print(x);w.flush();}\n\t\tvoid p(BigInteger x) {w.print(x);w.flush();}\n\t\tvoid p(double x) {w.print(x);w.flush();}\n\t\tvoid p(boolean x) {w.print(x);w.flush();}\n\t}\n}", "#include <iostream>\nusing namespace std;\ntypedef long long ll;\n#define chmax(x, y) x = max(x, y);\nint V[3100][3100];\nll dp[3100][3100][5];\n\nint main() {\n int R, C, K; cin >> R >> C >> K;\n for (int i = 0; i < K; i++) {\n int r, c, v; cin >> r >> c >> v;\n V[r-1][c-1] = v;\n }\n\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 2; k >= 0; k--) {\n chmax(dp[i][j][k+1], dp[i][j][k] + V[i][j]);\n }\n for (int k = 0; k < 4; k++) {\n chmax(dp[i+1][j][0], dp[i][j][k]);\n chmax(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n }\n \n ll ans = 0;\n for (int k = 0; k < 4; k++) chmax(ans, dp[R-1][C-1][k]);\n cout << ans << endl;\n return 0;\n}", "rows, cols, k = map(int, input().split())\nitems = [[] for _ in range(rows+1)]\nbest = [0]*(cols+1)\nfor _ in range(k):\n\tr, c, v = map(int, input().split())\n\titems[r].append([c, v])\nfor i in range(rows+1):\n\titems[i].sort()\nans = 0\nfor r in range(1, rows+1):\n\tdp = []\n\tbest1, best2 = 0, 0\n\tRow = items[r]\n\tfor c, v in Row:\n\t\tv1 = best[c] + v\n\t\tv2 = best1 + v\n\t\tv3 = best2 + v\n\t\tV = max(v1, v2, v3)\n\t\tdp.append(V)\n\t\tif v1 > best1:\n\t\t\tbest1 = v1\n\t\tif v2 > best2:\n\t\t\tbest2 = v2\n\t\tif ans < V:\n\t\t\tans = V\n\tfor j in range(len(dp)):\n\t\tif best[Row[j][0]] < dp[j]:\n\t\t\tbest[Row[j][0]] = dp[j]\n\tfor j in range(2, cols+1):\n\t\tif best[j] < best[j-1]:\n\t\t\tbest[j] = best[j-1]\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\nconst int maxN = 3009,INF=-10;\nlong long int dp[maxN][maxN][4],c[maxN][maxN];\nint n,m;\nlong long int f(int i,int j,int d){\n if(i<=0||j<=0||i>n||j>m||d<0)return INF;\n if(i==n && j==m)return d?c[i][j]:0;\n if(dp[i][j][d]!=-1)return dp[i][j][d];\n long long int ret ;\n if(d>0) ret = max( c[i][j] + max( f(i+1,j,3) , f(i,j+1,d-1) ) , f(i,j+1,d) );\n else ret = max( f(i+1,j,3) , f(i,j+1,d) );\n return dp[i][j][d]=ret;\n}\nint main(){\n int k;\n cin >> n >> m >> k ;\n for(int i=0;i<k;i++){\n int ni,mi,vi;\n cin >> ni >> mi >> vi ;\n c[ni][mi]=vi;\n }\n memset(dp,-1,sizeof(dp));\n cout << f(1,1,3) << endl ;\n}", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\t\n\tvoid run() {\n\t\tFastScanner sc = new FastScanner();\n\t\tint H=sc.nextInt();\n\t\tint W=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tint[] h=new int[K];\n\t\tint[] w=new int[K];\n\t\tlong[][][] dp=new long[4][H][W];\n\t\tlong[][] v=new long[H][W];\n\t\tfor (int i=0;i<K;++i) {\n\t\t\th[i]=sc.nextInt()-1;\n\t\t\tw[i]=sc.nextInt()-1;\n\t\t\tv[h[i]][w[i]]=sc.nextLong();\n\t\t}\n\t\tdp[1][0][0]=Math.max(0, v[0][0]);\n\t\tfor (int y=0;y<H;++y) {\n\t\t\tfor (int x=0;x<W;++x) {\n\t\t\t\tint[] dx= {1,0};\n\t\t\t\tint[] dy= {0,1};\n\t\t\t\tfor (int i=0;i<2;++i) {\n\t\t\t\t\tint nx=x+dx[i];\n\t\t\t\t\tint ny=y+dy[i];\n\t\t\t\t\tif (nx<0||ny<0||nx>=W||ny>=H) continue;\n\t\t\t\t\tfor (int src=0;src<=3;++src) {\n\t\t\t\t\t\tdp[src][ny][nx]=Math.max(dp[src][ny][nx], dp[src][y][x]);\n\t\t\t\t\t\tif (dx[i]==1 && src<3) {\n\t\t\t\t\t\t\tdp[src+1][ny][nx]=Math.max(dp[src+1][ny][nx], dp[src][y][x]+v[ny][nx]);\n\t\t\t\t\t\t} else if (dy[i]==1) {\n\t\t\t\t\t\t\tdp[0][ny][nx]=Math.max(dp[0][ny][nx], dp[src][y][x]);\n\t\t\t\t\t\t\tdp[1][ny][nx]=Math.max(dp[1][ny][nx], dp[src][y][x]+v[ny][nx]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans=0;\n\t\tfor (int sum=0;sum<=3;++sum) {\n\t\t\tans=Math.max(ans, dp[sum][H-1][W-1]);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\t\n\tvoid tr(Object...o) {System.out.println(Arrays.deepToString(o));}\n}\n", "R, C, K = map(int,input().split())\nV = [[]for i in range(R)]\nfor i in range(K):\n r,c,v = map(int,input().split())\n V[r-1].append([c,v])\ncost = [0]*(C+1)\nfor r in range(R):\n V[r].sort()\n hoge = [0,0,0,0]\n for c,v in V[r]:\n for i in range(3,0,-1):\n hoge[i] = max(cost[c]+v,hoge[i-1]+v,hoge[i])\n hoge[0] = cost[c]\n cost[c] = max(hoge)\n for i in range(1,C+1):\n cost[i] = max(cost[i],cost[i-1])\n\nprint(cost[-1]) ", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nll g[4001][4001];\nint r,c,k;\nll dp[4001][4001][4];\nll rec(ll i, ll j, ll taken)\n{\n\tif(i>=r)return 0;\n\tif(j>=c)return 0;\n\tif(dp[i][j][taken]!=-1)return dp[i][j][taken];\n\tll ans=0;\n\tif(taken<3 && i<r && j<c){\n\t\tans=g[i][j];\n\t}\n\telse{ans=0;}\n\t\n\tans=rec(i+1,j,0);\n\tif(taken<3){\n\tans=max(ans,rec(i+1,j,0)+g[i][j]);\n\t}\n\tans=max(ans,rec(i,j+1,taken));\n\tif(taken<3){\n\tans=max(ans,rec(i,j+1,taken+1)+g[i][j]);\n\t}\n\n\treturn dp[i][j][taken]=ans;\n\n\n\n}\nint main()\n{\n\t cin>>r>>c>>k;\n\tfor(int i=0;i<r;i++)\n\t{\n\t\tfor(int j=0;j<c;j++)\n\t\t{\n\t\t\tg[i][j]=0;\n\t\t}\n\t}\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tint a,b,v; cin>>a>>b>>v;\n\t\ta--; b--;\n\t\tg[a][b]=v;\n\t}\n\tmemset(dp,-1,sizeof(dp));\n\tcout<<rec(0,0,0);\n\t\n\t\n}", "#include <iostream>\n#include <cstdio>\n#include <algorithm>\nusing namespace std;\n#define endl '\\n'\n#define ll long long\n#define pi pair<int, int>\n#define f first\n#define s second\n\nconst int mxn = 3001, w = 4;\nint n, m, k;\nll a[mxn][mxn];\nll dp[mxn][mxn][w];\n\nint main(){\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tcin >> n >> m >> k;\n\t\n\tfor(int i = 0; i < k; i++){\n\t int x, y;\n\t cin >> x >> y >> a[x][y];\n\t}\n\t\n\tfor(int i = 1; i <= n; i++)\n\tfor(int j = 1; j <= m; j++){\n\t dp[i][j][0] = max(dp[i][j - 1][0], dp[i - 1][j][w - 1]);\n \tfor(int l = 1; l < w; l++){\n \t dp[i][j][l] = max({\n \t dp[i - 1][j][w - 1] + a[i][j], \n \t dp[i][j - 1][l],\n \t dp[i][j - 1][l - 1] + a[i][j]\n \t });\n \t}\n\t}\n\t\n\tcout << dp[n][m][w - 1];\n\n\treturn 0;\n}", "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Reader sc = new Reader();\n PrintWriter pw = new PrintWriter(System.out);\n \n try {\n int n = sc.nextInt();\n int m = sc.nextInt();\n int k = sc.nextInt();\n int[][] val = new int[n+1][m+1];\n for(int i=0 ; i<k ; i++) {\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n val[x][y] = z;\n }\n\n long[][][] dp = new long[n+1][m+1][4];\n\n for(int i=1 ; i<=n ; i++) {\n for(int j=1 ; j<=m ; j++) {\n for(int x=0 ; x<=3 ; x++) {\n dp[i][j][x] = dp[i][j-1][x];\n }\n\n for(int x=1 ; x<=3 ; x++) {\n dp[i][j][x] = Math.max(dp[i][j][x], val[i][j] + dp[i][j-1][x-1]);\n }\n\n long max = 0;\n for(int x=0 ; x<=3 ; x++) {\n max = Math.max(max, dp[i-1][j][x]);\n }\n\n for(int x=0 ; x<=3 ; x++) {\n dp[i][j][x] = Math.max(max, dp[i][j][x]);\n }\n dp[i][j][1] = Math.max(max + val[i][j], dp[i][j][1]);\n }\n }\n\n long ans = 0;\n for(int i=0 ; i<=3 ; i++) {\n ans = Math.max(ans, dp[n][m][i]);\n }\n pw.println(ans);\n\n }\n finally {\n pw.flush();\n pw.close();\n }\n }\n \n static class Reader {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n String next() {\n while(!st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n }\n catch(IOException io) {\n io.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n }\n}\n", "#include <bits/stdc++.h>\n#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);\n#define int long long\n#define endl \"\\n\"\nusing namespace std;\n\nint r, c, k;\nint grid[3005][3005];\nint dp[3005][3005][4]; //row col taken\n\nint compute(int i,int j,int taken){\n if(i>r || j>c)return 0;\n int &ans=dp[i][j][taken];\n if(ans!=-1)return ans;\n if(taken>=3){\n ans=max(compute(i+1,j,0),compute(i,j+1,taken));\n }\n else{\n ans=max({compute(i+1,j,0)+grid[i][j],compute(i,j+1,taken+1)+grid[i][j],compute(i,j+1,taken)});\n }\n return ans;\n}\nint32_t main() {\n\n fast\n cin >> r >> c >> k;\n int x, y, value;\n\n for(int i = 0; i < k; i++) {\n cin >> x >> y >> value;\n grid[x][y] = value;\n }\n memset(dp,-1,sizeof dp);\n int ans=compute(0,0,0);\n cout << ans<< endl;\n\n\n\n\n return 0;\n}\n\n", "#include <bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n#define chmax(x, y) x = max(x, y)\n\nint items[3001][3001];\nll dp[3001][3001][4];\n\nint main() {\n int R, C, K;\n cin >> R >> C >> K;\n rep(i, K) {\n int r, c, v;\n cin >> r >> c >> v;\n items[r-1][c-1] = v;\n }\n\n rep(i, R) rep(j, C) {\n for (int k = 2; k >= 0; --k) {\n chmax(dp[i][j][k+1], dp[i][j][k] + items[i][j]);\n }\n rep(k, 4) {\n chmax(dp[i][j+1][k], dp[i][j][k]);\n chmax(dp[i+1][j][0], dp[i][j][k]);\n }\n }\n\n ll ans = 0;\n rep(k, 4) chmax(ans, dp[R-1][C-1][k]);\n cout << ans << endl;\n return 0;\n}", "import java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\n static Input in = new Input(System.in);\n static PrintWriter out = new PrintWriter(System.out);\n\n public static void main(String[] args) {\n int R = in.nextInt();\n int C = in.nextInt();\n int[][] V = new int[R][C];\n for (int K = in.nextInt(); K > 0; K--)\n V[in.nextInt() - 1][in.nextInt() - 1] = in.nextInt();\n long[][] max = new long[R][C];\n // r = 0\n long sum = 0;\n int[] top = new int[3];\n for (int c = 0; c < C; c++) {\n if (top[0] < V[0][c]) {\n sum -= top[0];\n top[0] = V[0][c];\n sum += top[0];\n Arrays.sort(top);\n }\n max[0][c] = sum;\n }\n for (int r = 1; r < R; r++) {\n for (int s = 0; s < C; s++) {\n if (V[r][s] == 0) {\n max[r][s] = Math.max(max[r][s], max[r - 1][s]);\n continue;\n }\n sum = max[r - 1][s];\n top = new int[3];\n for (int c = s; c < C; c++) {\n if (top[0] < V[r][c]) {\n sum -= top[0];\n top[0] = V[r][c];\n sum += top[0];\n Arrays.sort(top);\n }\n max[r][c] = Math.max(max[r][c], sum);\n if (top[0] > V[r][s]) break;\n }\n }\n }\n out.println(max[R-1][C-1]);\n\n out.flush();\n }\n\n static class Input {\n private BufferedReader br;\n private String[] buff;\n private int index = 0;\n\n Input(InputStream is) {\n br = new BufferedReader(new InputStreamReader(is));\n }\n String nextLine() {\n try {\n return br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return null;\n }\n String next() {\n while (buff == null || index >= buff.length) {\n buff = nextLine().split(\" \");\n index = 0;\n }\n return buff[index++];\n }\n byte nextByte() {\n return Byte.parseByte(next());\n }\n short nextShort() {\n return Short.parseShort(next());\n }\n int nextInt() {\n return Integer.parseInt(next());\n }\n long nextLong() {\n return Long.parseLong(next());\n }\n float nextFloat() {\n return Float.parseFloat(next());\n }\n double nextDouble() {\n return Double.parseDouble(next());\n }\n BigInteger nextBigInteger() {\n return new BigInteger(next());\n }\n BigDecimal nextBigDecimal() {\n return new BigDecimal(next());\n }\n }\n}\n", "\nimport java.io.*;\nimport java.util.*;\n\npublic class Main{\n\tstatic BufferedReader br;\n\tstatic int cin() throws Exception\n\t{\n\t\treturn Integer.valueOf(br.readLine());\n\t}\n\tstatic int[] split() throws Exception\n\t{\n\t\tString[] cmd=br.readLine().split(\" \");\n\t\tint[] ans=new int[cmd.length];\n\t\tfor(int i=0;i<cmd.length;i++)\n\t\t{\n\t\t\tans[i]=Integer.valueOf(cmd[i]);\n\t\t}\n\t\treturn ans;\n\t}\n\tstatic long[] splitL() throws IOException\n\t{\n\t\tString[] cmd=br.readLine().split(\" \");\n\t\tlong[] ans=new long[cmd.length];\n\t\tfor(int i=0;i<cmd.length;i++)\n\t\t{\n\t\t\tans[i]=Long.valueOf(cmd[i]);\n\t\t}\n\t\treturn ans;\n\t}\n\tstatic long[][][]dp;\n\tstatic int[][]val;\n\tstatic long solve(int i,int j,int items)\n\t{\n\t\tif(i==val.length || j==val[0].length)\n\t\t\treturn 0;\n\t\tif(dp[i][j][items]!=-1)\n\t\t\treturn dp[i][j][items];\n\t\tlong res=0;\n\t\tres=Math.max(solve(i+1,j,0),solve(i,j+1,items));\n\t\tif(val[i][j]!=0)\n\t\t{\n\t\t\tres=Math.max(res,(long)val[i][j]+solve(i+1,j,0));\n\t\t\tif(items<3)\n\t\t\t\tres=Math.max(res, (long)val[i][j]+solve(i,j+1,items+1));\n\t\t\telse\n\t\t\t\tres=Math.max(solve(i+1,j,0),solve(i,j+1,items));\n\t\t}\n\t\tdp[i][j][items]=res;\n\t\treturn res;\n\t}\n\tpublic static void main(String[] args) throws Exception{\n\t\t// TODO Auto-generated method stub\n\t\tbr=new BufferedReader(new InputStreamReader(System.in));\n\t\tint[]ar=split();\n\t\tint r=ar[0];\n\t\tint c=ar[1];\n\t\tint k=ar[2];\n\t\tval=new int[r][c];\n\t\tfor(int i=0;i<k;i++)\n\t\t{\n\t\t\tar=split();\n\t\t\tval[ar[0]-1][ar[1]-1]=ar[2];\n\t\t}\n\t\tdp=new long[r+1][c+1][4];\n\t\tfor(int i=0;i<=r;i++)\n\t\t{\n\t\t\tfor(int j=0;j<=c;j++)\n\t\t\t{\n\t\t\t\tArrays.fill(dp[i][j], -1);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(solve(0,0,0));\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define Maxn 4010\n\nint R, C, K, x, y, z, cost[Maxn][Maxn];\nlong long f[Maxn][Maxn][4];\n\nint main()\n{\n\tscanf(\"%d%d%d\", &R, &C, &K);\n\tfor (int i=1; i<=K; i++)\n\t{\n\t\tscanf(\"%d%d%d\", &x, &y, &z);\n\t\tcost[x][y]=z;\n\t}\n\tfor (int i=1; i<=R; i++)\n\t\tfor (int j=1; j<=C; j++)\n\t\t{\n\t\t\tfor (int k=0; k<=3; k++) f[i][j][0]=max(f[i][j][0], f[i-1][j][k]);\n\t\t\tfor (int k=0; k<=3; k++) f[i][j][k]=max(f[i][j][k], f[i][j-1][k]);\n\t\t\tif (cost[i][j])\n\t\t\t{ \n\t\t\t\tfor (int k=0; k<=3; k++) f[i][j][1]=max(f[i][j][1], f[i-1][j][k]+cost[i][j]);\n\t\t\t\tfor (int k=0; k<3; k++) f[i][j][k+1]=max(f[i][j][k+1], f[i][j-1][k]+cost[i][j]);\n\t\t\t}\n\t\t}\n\tlong long Res=0; for (int i=0; i<=3; i++) Res=max(Res, f[R][C][i]);\n\tprintf(\"%lld\\n\", Res);\n}", " import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport javax.sound.sampled.ReverbType;\n\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tstatic ArrayList<Integer> adj[];\n\t// static PrintWriter out = new PrintWriter(System.out);\n\n\tstatic int[][] notmemo;\n\tstatic int k;\n\tstatic int[] a;\n\tstatic int b[];\n\tstatic int m;\n\n\tstatic class Pair implements Comparable<Pair> {\n\t\tint d;\n\t\tint s;\n\n\t\tpublic Pair(int b, int l) {\n\t\t\td = b;\n\t\t\ts = l;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\tif (o.d - o.s > this.d - this.s) {\n\t\t\t\treturn 1;\n\t\t\t} else if (o.d - o.s < this.d - this.s) {\n\t\t\t\treturn -1;\n\t\t\t} else\n\t\t\t\treturn 0;\n\n\t\t}\n\n\t}\n\n\tstatic Pair s1[];\n\tstatic ArrayList<Pair> adjlist[];\n\t// static char c[];\n\tpublic static long mod = (long) (1e9 + 7);\n\tstatic int V;\n\tstatic long INF = (long) 1E16;\n\tstatic int n;\n\tstatic int c;\n\tstatic int d[];\n\tstatic int z;\n\tstatic Pair p[];\nstatic int R;\nstatic int C;\nstatic int K;\nstatic long grid[][];\n\tpublic static void main(String args[]) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tR=sc.nextInt();\n\t\tC=sc.nextInt();\n\t\tK=sc.nextInt();\n\t\tgrid=new long[R][C];\n\t\twhile(K-->0) {\n\t\t\tint r1=sc.nextInt()-1;\n\t\t\tint c1=sc.nextInt()-1;\n\t\t\tgrid[r1][c1]=sc.nextInt();\n\t\t}\n\t\tmemo=new long[R+1][C+1][4];\n\t\tfor(long x[][]:memo) {\n\t\t\tfor(long y[]:x) {\n\t\t\t\tArrays.fill(y,-1);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(dp(0,0,0));\n\t}\n\tstatic ArrayList<Integer> euler=new ArrayList<>();\n\t\tstatic long dp(int i,int j,int count) {\n\t\t\tif(i==R-1&&j==C-1) {\n\t\t\t\tif(count<3) {\n\t\t\t\t\treturn grid[i][j];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\treturn 0;\n\t\t\t}\n\t\t\telse if(i>=R||j>=C) {\n\t\t\t\treturn -INF;\n\t\t\t}\n\t\t\tif(memo[i][j][count]!=-1) {\n\t\t\t\treturn memo[i][j][count];\n\t\t\t}\n\t\t\tlong ans=0;\n\t\t\tans=Math.max(ans,dp(i+1,j,0));\n\t\t\tans=Math.max(ans,dp(i,j+1,count));\n\t\t\t\n\t\t\tif(count<3) {\n\t\t\t\tans=Math.max(ans,dp(i+1,j,0)+grid[i][j]);\n\t\t\t\tans=Math.max(ans,dp(i,j+1,count+1)+grid[i][j]);\n\t\t\t}\n\t\t\t\n\treturn memo[i][j][count]=ans;\n\t\t\n\t\t}\n\n\tstatic ArrayList<Integer> arr;\n\n\t\nstatic long total[];\nstatic TreeMap<Integer,Integer> map1;\n\n\t\tstatic int zz;\n//static int dp(int idx,int left,int state) {\n//if(idx>=k-((zz-left)*2)||idx+1==n) {\n//\treturn 0;\n//}\n//if(memo[idx][left][state]!=-1) {\n//\treturn memo[idx][left][state];\n//}\n//int ans=a[idx+1]+dp(idx+1,left,0);\n//if(left>0&&state==0&&idx>0) {\n//\tans=Math.max(ans,a[idx-1]+dp(idx-1,left-1,1));\n//}\n//return memo[idx][left][state]=ans;\n//}21\nstatic HashMap<Integer,Integer> map;\nstatic int maxa=0;\nstatic int ff=123123;\n\nstatic long dist[][];\nstatic long[][][] memo;\n\n\n\tstatic long modmod=998244353;\n\tstatic int dx[]= {1,-1,0,0};\n\t static int dy[]= {0,0,1,-1};\t\n\tstatic class BBOOK implements Comparable<BBOOK>{\n\t\tint t;\n\t\tint alice;\n\t\tint bob;\n\t\tpublic BBOOK(int x,int y,int z) {\n\t\tt=x;\n\t\talice=y;\n\t\tbob=z;\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(BBOOK o) {\n\t\t\treturn this.t-o.t;\n\t\t}\n\t}\n\tprivate static long lcm(long a2, long b2) {\n\treturn (a2*b2)/gcd(a2,b2);\n\t}\n\tstatic class Edge implements Comparable<Edge>\n\t{\n\t\tint node;long cost ; long time; \n\t\t\n\t\tEdge(int a, long b,long c) { node = a;\tcost = b; time=c; }\n\t\t\n\t\tpublic int compareTo(Edge e){ return Long.compare(time,e.time);\t}\n\t}\n\t\n static void sieve(int N)\t// O(N log log N) \n\t{\n\t\tisComposite = new int[N+1];\t\t\t\t\t\n\t\tisComposite[0] = isComposite[1] = 1;\t\t\t// 0 indicates a prime number\n\t\tprimes = new ArrayList<Integer>();\n \n\t\tfor (int i = 2; i <= N; ++i) \t\t\t\t\t//can loop till i*i <= N if primes array is not needed O(N log log sqrt(N)) \n\t\t\tif (isComposite[i] == 0) \t\t\t\t\t//can loop in 2 and odd integers for slightly better performance\n\t\t\t{\n\t\t\t\tprimes.add(i);\n\t\t\t\tif(1l * i * i <= N)\n\t\t\t\t\tfor (int j = i * i; j <= N; j += i)\t// j = i * 2 will not affect performance too much, may alter in modified sieve\n\t\t\t\t\t\tisComposite[j] = 1;\n\t\t\t} \n\t}\n static TreeSet<Integer> factors;\n static ArrayList<Integer> primeFactors(int N)\t\t// O(sqrt(N) / ln sqrt(N))\n\t{\n\t\tArrayList<Integer> factors = new ArrayList<Integer>();\t\t//take abs(N) in case of -ve integers\n\t\tint idx = 0, p = primes.get(idx);\n\n\t\twhile(1l*p * p <= N)\n\t\t{\n\t\t\twhile(N % p == 0) { factors.add(p); N /= p; }\n\t\t\tp = primes.get(++idx);\n\t\t}\n\n\t\tif(N != 1)\t\t\t\t\t\t// last prime factor may be > sqrt(N)\n\t\t\tfactors.add(N);\t\t\t\t// for integers whose largest prime factor has a power of 1\n\t\treturn factors;\n\t}\n\n\tstatic class UnionFind {\n\t\tint[] p, rank, setSize;\n\t\tint numSets;\n\t\tint max[];\n\n\t\tpublic UnionFind(int N) {\n\t\t\tp = new int[numSets = N];\n\t\t\trank = new int[N];\n\t\t\tsetSize = new int[N];\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tp[i] = i;\n\t\t\t\tsetSize[i] = 1;\n\t\t\t}\n\t\t}\n\n\t\tpublic int findSet(int i) {\n\t\t\treturn p[i] == i ? i : (p[i] = findSet(p[i]));\n\t\t}\n\n\t\tpublic boolean isSameSet(int i, int j) {\n\t\t\treturn findSet(i) == findSet(j);\n\t\t}\n\t\tpublic int chunion(int i,int j, int x2) {\n\t\t\tif (isSameSet(i, j))\n\t\t\t\treturn 0;\n\t\t\tnumSets--;\n\t\t\tint x = findSet(i), y = findSet(j);\n\t\t\tint z=findSet(x2);\n\t\t\tp[x]=z;;\n\t\t\tp[y]=z;\n\t\treturn x;\n\t\t}\n\n\t\tpublic void unionSet(int i, int j) {\n\t\t\tif (isSameSet(i, j))\n\t\t\t\treturn;\n\t\t\tnumSets--;\n\t\t\tint x = findSet(i), y = findSet(j);\n\t\t\tif (rank[x] > rank[y]) {\n\t\t\t\tp[y] = x;\n\t\t\t\tsetSize[x] += setSize[y];\n\n\n\t\t\t} else {\n\t\t\t\tp[x] = y;\n\t\t\t\tsetSize[y] += setSize[x];\n\t\t\t\tif (rank[x] == rank[y])\n\t\t\t\t\trank[y]++;\n\n\n\t\t\t}\n\t\t}\n\n\t\t\n\n\t\tpublic int numDisjointSets() {\n\t\t\treturn numSets;\n\t\t}\n\n\t\tpublic int sizeOfSet(int i) {\n\t\t\treturn setSize[findSet(i)];\n\t\t}\n\t}\n\n\n\tstatic class Quad implements Comparable<Quad> {\n\t\tint u;\n\t\tint v;\n\t\tchar state;\n\t\tint turns;\n\n\t\tpublic Quad(int i, int j, char c, int k) {\n\t\t\tu = i;\n\t\t\tv = j;\n\t\t\tstate = c;\n\t\t\tturns = k;\n\t\t}\n\n\t\tpublic int compareTo(Quad e) {\n\t\t\treturn (int) (turns - e.turns);\n\t\t}\n\n\t}\n\n\tstatic long manhatandistance(long x, long x2, long y, long y2) {\n\t\treturn Math.abs(x - x2) + Math.abs(y - y2);\n\t}\n\n\tstatic long fib[];\n\n\tstatic long fib(int n) {\n\t\tif (n == 1 || n == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (fib[n] != -1) {\n\t\t\treturn fib[n];\n\t\t} else\n\t\t\treturn fib[n] = ((fib(n - 2) % mod + fib(n - 1) % mod) % mod);\n\t}\n\n\tstatic class Point implements Comparable<Point>{\n\t\tlong x, y;\n\n\t\tPoint(long counth, long counts) {\n\t\t\tx = counth;\n\t\t\ty = counts;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Point p )\n\t\t{\n\t\t\treturn Long.compare(p.y*1l*x, p.x*1l*y);\n\t\t}\n\t}\n\n\tstatic TreeSet<Long> primeFactors(long N) // O(sqrt(N) / ln sqrt(N))\n\t{\n\t\tTreeSet<Long> factors = new TreeSet<Long>(); // take abs(N) in case of -ve integers\n\t\tint idx = 0, p = primes.get(idx);\n\n\t\twhile (p * p <= N) {\n\t\t\twhile (N % p == 0) {\n\t\t\t\tfactors.add((long) p);\n\t\t\t\tN /= p;\n\t\t\t}\n\t\t\tif (primes.size() > idx + 1)\n\t\t\t\tp = primes.get(++idx);\n\t\t\telse\n\t\t\t\tbreak;\n\t\t}\n\n\t\tif (N != 1) // last prime factor may be > sqrt(N)\n\t\t\tfactors.add(N); // for integers whose largest prime factor has a power of 1\n\t\treturn factors;\n\t}\n\n\tstatic boolean visited[];\n\n\t/**\n\t * static int bfs(int s) { Queue<Integer> q = new LinkedList<Integer>();\n\t * q.add(s); int count=0; int maxcost=0; int dist[]=new int[n]; dist[s]=0;\n\t * while(!q.isEmpty()) {\n\t * \n\t * int u = q.remove(); if(dist[u]==k) { break; } for(Pair v: adj[u]) {\n\t * maxcost=Math.max(maxcost, v.cost);\n\t * \n\t * \n\t * \n\t * if(!visited[v.v]) {\n\t * \n\t * visited[v.v]=true; q.add(v.v); dist[v.v]=dist[u]+1; maxcost=Math.max(maxcost,\n\t * v.cost); } }\n\t * \n\t * } return maxcost; }\n\t **/\n\n\tstatic boolean[] vis2;\n\n\tstatic boolean f2 = false;\n\n\tstatic long[][] matMul(long[][] a2, long[][] b, int p, int q, int r) // C(p x r) = A(p x q) x (q x r) -- O(p x q x\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// r)\n\t{\n\t\tlong[][] C = new long[p][r];\n\t\tfor (int i = 0; i < p; ++i) {\n\t\t\tfor (int j = 0; j < r; ++j) {\n\t\t\t\tfor (int k = 0; k < q; ++k) {\n\t\t\t\t\tC[i][j] = (C[i][j] + (a2[i][k] % mod * b[k][j] % mod)) % mod;\n\t\t\t\t\tC[i][j] %= mod;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t\treturn C;\n\t}\n\tpublic static int[] schuffle(int[] a2) {\n\t\tfor (int i = 0; i < a2.length; i++) {\n\t\t\tint x = (int) (Math.random() * a2.length);\n\t\t\tint temp = a2[x];\n\t\t\ta2[x] = a2[i];\n\t\t\ta2[i] = temp;\n\t\t}\n\t\treturn a2;\n\t}\n\n\n\tstatic boolean vis[];\n\tstatic HashSet<Integer> set = new HashSet<Integer>();\n\n\tstatic long modPow(long ways, long count, long mod) // O(log e)\n\t{\n\t\tways %= mod;\n\t\tlong res = 1;\n\t\twhile (count > 0) {\n\t\t\tif ((count & 1) == 1)\n\t\t\t\tres = (res * ways) % mod;\n\t\t\tways = (ways * ways) % mod;\n\t\t\tcount >>= 1;\n\t\t}\n\t\treturn res % mod;\n\t}\n\n\tstatic long gcd(long l, long o) {\n\t\tif (o == 0) {\n\t\t\treturn l;\n\t\t}\n\t\treturn gcd(o, l % o);\n\t}\n\n\tstatic int[] isComposite;\n\tstatic int[] valid;\n\n\tstatic ArrayList<Integer> primes;\n\tstatic ArrayList<Integer> l1;\n\n\t\n\tstatic TreeSet<Integer> primus = new TreeSet<Integer>();\n\t\n\tstatic void sieveLinear(int N)\n\t{\n\t\tint[] lp = new int[N + 1];\t\t\t\t\t\t\t\t//lp[i] = least prime divisor of i\n\t\tfor(int i = 2; i <= N; ++i)\n\t\t{\n\t\t\tif(lp[i] == 0)\n\t\t\t{\n\t\t\t\tprimus.add(i);\n\t\t\t\tlp[i] = i;\n\t\t\t}\n\t\t\tint curLP = lp[i];\n\t\t\tfor(int p: primus)\n\t\t\t\tif(p > curLP || p * i > N)\n\t\t\t\t\tbreak;\n\t\t\t\telse\n\t\t\t\t\tlp[p * i] = i;\n\t\t}\n\t}\n\t\n\n\tpublic static long[] schuffle(long[] a2) {\n\t\tfor (int i = 0; i < a2.length; i++) {\n\t\t\tint x = (int) (Math.random() * a2.length);\n\t\t\tlong temp = a2[x];\n\t\t\ta2[x] = a2[i];\n\t\t\ta2[i] = temp;\n\t\t}\n\t\treturn a2;\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n\n\t\tpublic Scanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n\n\t\tpublic Long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\n\t\tpublic int[] nxtArr(int n) throws IOException {\n\t\t\tint[] ans = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tans[i] = nextInt();\n\t\t\treturn ans;\n\t\t}\n\t\t\n\t}\n\tpublic static int[] sortarray(int a[]) {\n\t\tschuffle(a);\n\t\tArrays.sort(a);\n\t\treturn a;\n\t\t}\n\t\tpublic static long[] sortarray(long a[]) {\n\t\t\tschuffle(a);\n\t\t\tArrays.sort(a);\n\t\t\treturn a;\n\t\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define chmax(x,y) x = max(x,y)\n\n\nll dp[3005][3005][4];\nint A[3005][3005];\n\nint main() {\n int R,C,K;\n cin >> R >> C >> K;\n\n rep(i,K) {\n int r,c,v;\n cin >> r >> c >> v;\n r--;\n c--;\n A[r][c]= v;\n }\n\n rep(i,R) rep(j,C) {\n if(i > 0) {\n rep(k,4){\n chmax(dp[i][j][0], dp[i-1][j][k]);\n }\n }\n if(j > 0){\n rep(k,4){\n chmax(dp[i][j][k], dp[i][j-1][k]);\n }\n }\n int v = A[i][j];\n if (v > 0) {\n for(int k=3; k>0; k--){\n chmax(dp[i][j][k], dp[i][j][k-1] + v);\n }\n }\n }\n \n ll ans = 0;\n rep(k,4){\n chmax(ans, dp[R-1][C-1][k]);\n }\n cout << ans << endl;\n return 0;\n}\n", "\nmax2 = lambda x,y: x if x > y else y\nmin2 = lambda x,y: x if x < y else y\n\nimport sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\ndef solve(R,C,rcv):\n\n rows = [list() for _ in range(R)]\n for r,c,v in rcv:\n rows[r-1].append((c-1,v))\n\n dp = [0]*C\n\n for row in rows:\n row.sort()\n row.append((C,0))\n ri = 0\n c,v = row[ri]\n\n t1 = 0\n t2 = 0\n t3 = 0\n for j in range(C):\n if c == j:\n t3 = max2(t2+v,t3)\n t2 = max2(t1+v,t2)\n t1 = max2(dp[j]+v,t1)\n ri += 1\n c,v = row[ri]\n \n dp[j] = max(t3,t2,t1,dp[j])\n\n return dp[-1]\n\n\n\n\nif __name__ == '__main__':\n R,C,K = map(int,readline().split())\n m = map(int,read().split())\n print(solve(R,C,zip(m,m,m)))", "import sys\ninput = sys.stdin.readline\nR,C,K = map(int,input().split())\nlis = [[0] * (C+1) for i in range(R+1)]\nfor _ in range(K):\n r,c,v = map(int,input().split())\n lis[r][c] = v\n\ndp = [[[0] * (C+1) for _ in range(R+1)] for _ in range(4)]\n#print(dp)\nfor i in range(1,R+1):\n for j in range(1,C+1):\n for k in range(4):\n dp[0][i][j] = max(dp[0][i][j],dp[k][i-1][j])\n dp[1][i][j] = max(dp[1][i][j],dp[k][i-1][j] + lis[i][j])\n\n dp[k][i][j] = max(dp[k][i][j],dp[k][i][j-1])\n if k > 0:\n dp[k][i][j] = max(dp[k][i][j],dp[k-1][i][j-1] + lis[i][j])\n# print(dp[0])\n# print(dp[1])\n# print(dp[2])\n# print(dp[3])\nprint(max(dp[0][R][C],dp[1][R][C],dp[2][R][C],dp[3][R][C]))\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\ntypedef long long ll;\ntypedef pair<int, int> P;\ntemplate <class T>\ninline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\nint field[3005][3005];\nll dp[3005][3005][4];\nint main() {\n int R, C, n;\n cin >> R >> C >> n;\n REP(i, n) {\n int r, c, v;\n cin >> r >> c >> v, r--, c--;\n field[r][c] = v;\n }\n REP(i, R) REP(j, C) {\n for (int k = 2; k >= 0; k--) {\n chmax(dp[i][j][k + 1], dp[i][j][k] + field[i][j]); //拾ったことの遷移\n }\n REP(k, 4) {\n chmax(dp[i + 1][j][0], dp[i][j][k]);\n chmax(dp[i][j + 1][k], dp[i][j][k]);\n }\n }\n ll ans = 0;\n REP(k, 4) chmax(ans, dp[R - 1][C - 1][k]);\n cout << ans << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong a[3333][3333], d[4], e[3333];\nint main() {\n int r, c, k;\n cin >> r >> c >> k;\n for(int i = 0; i < k; i++) {\n int x, y, v;\n cin >> x >> y >> v;\n a[x - 1][y - 1] = v;\n }\n for(int i = 0; i < r; i++) {\n fill(d, d + 4, 0);\n for(int j = 0; j < c; j++) {\n for(int l = 4; l--;) {\n d[l] = max(d[l], e[j]);\n if(l)\n d[l] = max({d[l], d[l - 1] + a[i][j], e[j] + a[i][j]});\n }\n e[j] = d[3];\n }\n }\n cout << d[3] << endl;\n return 0;\n}\n", "r,c,k = map(int,input().split())\nv = [[0]*(c+1) for i in range(r+1)]\nfor i in range(k):\n x,y,z = map(int,input().split())\n v[x][y] = z\ndp = [[0]*4 for i in range(r+1)]\nfor i in range(1,c+1):\n for j in range(1,r+1):\n if v[j][i]>0:\n dp[j][3] = max(dp[j][2]+v[j][i],dp[j][3])\n dp[j][2] = max(dp[j][1]+v[j][i],dp[j][2])\n dp[j][1] = max(dp[j][0]+v[j][i],dp[j][1],max(dp[j-1])+v[j][i])\n dp[j][0] = max(dp[j][0],max(dp[j-1]))\nprint(max(dp[r]))", "def main():\n r, c, k = map(int, input().split())\n d = [[0]*c for _ in [0]*r]\n for _ in range(k):\n t1, t2, t3 = map(int, input().split())\n d[t1-1][t2-1] = t3\n dp = [[0]*4 for _ in [0]*c]\n dp[0][1] = d[0][0]\n for x in range(r):\n dp2 = [[0]*4 for _ in [0]*c]\n for y in range(c):\n for z in range(4):\n if y != c-1:\n if z != 3:\n dp[y+1][z+1] = max(dp[y+1]\n [z+1], dp[y][z]+d[x][y+1])\n dp[y+1][z] = max(dp[y+1][z], dp[y][z])\n if x != r-1:\n dp2[y][1] = max(dp2[y][1],\n max(dp[y])+d[x+1][y])\n dp2[y][0] = max(dp2[y][0], max(dp[y]))\n if x != r-1:\n dp = dp2\n print(max(dp[c-1]))\n\n\nmain()", "import sys\n\ninp = [int(x) for x in sys.stdin.read().split()]; ii = 0\n\nrows, cols, k = inp[ii:ii+3]; ii += 3\nitems = [[] for _ in range(rows+1)]\nbest = [0]*(cols+1)\nfor _ in range(k):\n\tr, c, v = inp[ii:ii+3]; ii += 3\n\titems[r].append([c, v])\nfor i in range(rows+1):\n\titems[i].sort()\nans = 0\nfor r in range(1, rows+1):\n\tdp = []\n\tbest1, best2 = 0, 0\n\tRow = items[r]\n\tfor c, v in Row:\n\t\tv1 = best[c] + v\n\t\tv2 = best1 + v\n\t\tv3 = best2 + v\n\t\tV = v1\n\t\tif V < v2:\n\t\t\tV = v2\n\t\tif V < v3:\n\t\t\tV = v3\n\t\tdp.append(V)\n\t\tif v1 > best1:\n\t\t\tbest1 = v1\n\t\tif v2 > best2:\n\t\t\tbest2 = v2\n\t\tif ans < V:\n\t\t\tans = V\n\tfor j in range(len(dp)):\n\t\tif best[Row[j][0]] < dp[j]:\n\t\t\tbest[Row[j][0]] = dp[j]\n\tfor j in range(2, cols+1):\n\t\tif best[j] < best[j-1]:\n\t\t\tbest[j] = best[j-1]\nprint(ans)\n", "R, C, K = map(int, input().split())\npoints_dict = dict()\nfor _ in range(K):\n r, c, v = map(int, input().split())\n points_dict[r * 30000 + c] = v\n\ndp = [[[0] * (C+1) for _ in range(R+1)] for _ in range(4)] # dp[4][R+1][C+1]\nindex = 0\nfor i in range(1, R+1):\n for j in range(1, C+1):\n #移動\n for k in range(4):\n if dp[0][i][j] < dp[k][i-1][j]:\n dp[0][i][j] = dp[k][i-1][j]\n if dp[k][i][j] < dp[k][i][j-1]:\n dp[k][i][j] = dp[k][i][j-1]\n #あれば、拾うかどうか\n if i * 30000 + j in points_dict:\n v = points_dict[i * 30000 + j]\n for k in range(3, 0, -1):\n if dp[k][i][j] < dp[k-1][i][j] + v:\n dp[k][i][j] = dp[k-1][i][j] + v\n\"\"\"\nfor i in range(4):\n print(i)\n print(*dp[i], sep = '\\n')\n\"\"\"\nprint(max((dp[i][R][C] for i in range(4))))\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nll R, C, K;\nll Dp[3001][3001][4], V[3001][3001];\n#define maxupd(A, B) (A) = max((A), (B))\nll Res;\nint main() {\n cin >> R >> C >> K;\n for (ll i = 0; i < K; ++i) {\n ll r, c, v;\n cin >> r >> c >> v;\n V[r][c] = v;\n }\n for (ll r = 1; r <= R; ++r) {\n for (ll c = 1; c <= C; ++c) {\n for (ll k = 0; k <= 3; ++k) {\n maxupd(Dp[r][c][0], Dp[r - 1][c][k]);\n maxupd(Dp[r][c][k], Dp[r][c - 1][k]);\n }\n for (ll k = 2; k >= 0; --k) {\n maxupd(Dp[r][c][k + 1], Dp[r][c][k] + V[r][c]);\n }\n }\n }\n for (ll k = 0; k <= 3; ++k) maxupd(Res, Dp[R][C][k]);\n cout << Res << endl;\n return 0;\n}\n", "import sys\n\nR, C, K = map(int, input().split())\nitem = [[0] * (C + 1) for _ in range(R + 1)]\nfor s in sys.stdin.readlines():\n r, c, v = map(int, s.split())\n item[r][c] = v\n\ndp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]\nfor i in range(R + 1):\n for j in range(C + 1):\n for k in range(4):\n here = dp[k][i][j]\n # 次の行\n if i + 1 <= R:\n dp[0][i + 1][j] = max(dp[0][i + 1][j], here)\n dp[1][i + 1][j] = max(dp[1][i + 1][j], here + item[i + 1][j])\n # 次の列\n if j + 1 <= C:\n dp[k][i][j + 1] = max(dp[k][i][j + 1], here)\n if k < 3:\n dp[k + 1][i][j + 1] = max(dp[k + 1][i][j + 1], here + item[i][j + 1])\nans = 0\nfor k in range(4):\n ans = max(ans, dp[k][-1][-1])\nprint(ans)\n", "import sys\nread = sys.stdin.buffer.read\nreadlines = sys.stdin.buffer.readlines\ninput = sys.stdin.buffer.readline\nH, W, K = map(int, input().split())\nB = {}\n\nfor _ in range(K):\n r, c, v = map(int, input().split())\n B[(r-1,c-1)] = v\n\ndp = [[0]*(W+1) for _ in range(4)]\n \nfor i in range(H):\n for j in range(W):\n if (i, j) in B:\n v = B[(i, j)]\n dp[0][j+1] = max(dp[0][j], dp[0][j+1], dp[1][j+1], dp[2][j+1], dp[3][j+1])\n dp[1][j+1] = max(dp[1][j], dp[0][j+1]+v)\n dp[2][j+1] = max(dp[2][j], dp[1][j]+v)\n dp[3][j+1] = max(dp[3][j], dp[2][j]+v)\n else:\n dp[0][j+1] = max(dp[0][j], dp[0][j+1], dp[1][j+1], dp[2][j+1], dp[3][j+1])\n dp[1][j+1] = dp[1][j]\n dp[2][j+1] = dp[2][j]\n dp[3][j+1] = dp[3][j]\nprint(max(dp[i][-1] for i in range(4)))", "R, C, K = map(int, input().split())\nrcv = [list(map(int, input().split())) for _ in range(K)]\n\nboard = [[0] * (C + 1) for _ in range(R + 1)]\nfor r, c, v in rcv:\n board[r][c] = v\n\ndp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]\n\nfor r in range(1, R + 1):\n for c in range(1, C + 1):\n v = board[r][c]\n for i in range(4):\n dp[0][r][c] = max(dp[0][r][c], dp[i][r-1][c])\n dp[1][r][c] = max(dp[1][r][c], dp[i][r-1][c] + v)\n\n dp[i][r][c] = max(dp[i][r][c], dp[i][r][c-1])\n if i > 0:\n dp[i][r][c] = max(dp[i][r][c], dp[i-1][r][c-1] + v)\n\nans = 0\nfor i in range(4):\n ans = max(ans, dp[i][R][C])\n\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\ntemplate <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }\ntemplate <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define ll long long \nint a[3005][3005];\nlong long dp[3005][3005][4];\n//解説写し\nint main() {\n\tint R,C,K;\n\tcin>>R>>C>>K;\n\trep(i,K){\n\t\tint r,c,v;\n\t\tcin>>r>>c>>v;\n\t\ta[r-1][c-1]=v;\n\t}\n\trep(i,R)rep(j,C){\n\t\tfor(int k=2;k>=0;k--){\n\t\t\tchmax(dp[i][j][k+1],dp[i][j][k]+a[i][j]);\n\t\t}\n\t\trep(k,4){\n\t\t\tchmax(dp[i+1][j][0],dp[i][j][k]);//次の行に行ったら、リセットしてk=0とする\n\t\t\tchmax(dp[i][j+1][k],dp[i][j][k]);\n\t\t}\n\t}\n\tll ans=0;\n\trep(k,4)chmax(ans,dp[R-1][C-1][k]);\n\tcout<<ans<<endl;\n}\n\t", "R,C,K = map(int,input().split())\nJ=[0] * K\nfor i in range(K):\n J[i] = list(map(int,input().split()))\n\n#DP0 = [[0]*(C+2) for i in range(R+2)]\nDP1 = [[0]*(C+2) for i in range(R+2)]\nDP2 = [[0]*(C+2) for i in range(R+2)]\nDP3 = [[0]*(C+2) for i in range(R+2)]\n\nMAP = [[0]*C for i in range(R)]\n\nfor x,y,v in J:\n MAP[x-1][y-1] = v\n#print(MAP)\nfor i in range(R):\n for j in range(C):\n DP1[i][j] = max(DP1[i][j-1],DP1[i-1][j]+MAP[i][j],DP2[i-1][j]+MAP[i][j],DP3[i-1][j]+MAP[i][j])\n DP2[i][j] = max(DP2[i][j-1],DP1[i][j-1]+MAP[i][j])\n DP3[i][j] = max(DP3[i][j-1],DP2[i][j-1]+MAP[i][j])\n\n#print(DP1)\n#print(DP2)\n#print(DP3)\nANS=0\nfor i in range(R):\n for j in range(C):\n ANS=max(ANS,DP1[i][j],DP2[i][j],DP3[i][j])\nprint(ANS)\n\n", "import sys\ninput=lambda: sys.stdin.readline().rstrip()\nr,c,k=map(int,input().split())\nD=[[0]*c for _ in range(r)] \nfor _ in range(k):\n\tri,ci,v=map(int,input().split())\n\tri-=1\n\tci-=1\n\tD[ri][ci]=v\n\nDP=[[[0]*(c+1) for _ in range(r+1)] for i in range(4)]\nfor i in range(r):\n\tfor j in range(c):\n\t\tv=D[i][j]\n\n\t\tfor ii in range(4):\n\t\t\tDP[0][i][j]=max(DP[0][i][j],DP[ii][i-1][j])\n\t\t\tif v!=0:\n\t\t\t\tDP[1][i][j]=max(DP[1][i][j],DP[ii][i-1][j]+v)\n\n\t\t\tDP[ii][i][j]=max(DP[ii][i][j],DP[ii][i][j-1])\n\t\t\tif v!=0 and ii!=0:\n\t\t\t\tDP[ii][i][j]=max(DP[ii][i][j],DP[ii-1][i][j-1]+v)\nans=0\nfor i in range(4):\n\tans=max(ans,DP[i][r-1][c-1])\nprint(ans)\n\n", "def max2(x,y):\n return x if x > y else y\n\nR, L, K = map(int, input().split())\nV = [[0]*R for _ in range(L)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[c-1][r-1] = v\nA, B, C, D = [[0]*(R+1) for _ in range(4)]\nfor i in range(L):\n for j in range(R):\n A[j] = max(A[j-1], B[j-1], C[j-1], D[j-1])\n v = V[i][j]\n if v != 0:\n D[j], C[j], B[j] = max2(C[j] + v, D[j]), max2(B[j] + v, C[j]), max2(A[j] + v, B[j])\n\nprint(max(A[-2], B[-2], C[-2], D[-2]))", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.lang.reflect.Array;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.Map.Entry;\nimport java.util.NoSuchElementException;\nimport java.util.Set;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\npublic class Main {\n\n\tprivate static void solve() {\n\t\tint r = ni();\n\t\tint c = ni();\n\t\tint K = ni();\n\t\tlong[][] vs = new long[r + 1][c + 1];\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint ri = ni() - 1;\n\t\t\tint ci = ni() - 1;\n\t\t\tint vi = ni();\n\t\t\tvs[ri][ci] = vi;\n\t\t}\n\t\tlong[][][] dp = new long[r + 1][c + 1][4];\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\t\tlong cv = dp[i][j][k];\n\t\t\t\t\tlong v = vs[i][j];\n\t\t\t\t\tboolean pickable = v > 0 && k < 3;\n\n\t\t\t\t\tdp[i + 1][j][0] = max(dp[i + 1][j][0], cv);\n\t\t\t\t\tdp[i][j + 1][k] = max(dp[i][j + 1][k], cv);\n\t\t\t\t\tif (pickable) {\n\t\t\t\t\t\tdp[i + 1][j][0] = max(dp[i + 1][j][0], cv + v);\n\t\t\t\t\t\tdp[i][j + 1][k + 1] = max(dp[i][j + 1][k + 1], cv + v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n//\t\tfor (int i = 0; i < r; i++) {\n//\t\t\tString s = \"\";\n//\t\t\tfor (int j = 0; j < c; j++) {\n//\t\t\t\tif (j > 0)\n//\t\t\t\t\ts += \", \";\n//\t\t\t\ts += \"(\";\n//\t\t\t\tfor (int k = 0; k < 4; k++) {\n//\t\t\t\t\tif (k > 0)\n//\t\t\t\t\t\ts += \",\";\n//\t\t\t\t\ts += dp[i][j][k];\n//\t\t\t\t}\n//\t\t\t\ts += \")\";\n//\t\t\t}\n//\t\t\tSystem.out.println(s);\n//\t\t}\n\t\tlong ans = max(dp[r - 1][c][0], max(dp[r - 1][c][1], max(dp[r - 1][c][2], dp[r - 1][c][3])));\n\t\tout(ans);\n\t}\n\n\tstatic int min(int a, int b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic long min(long a, long b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic <A extends Comparable<? super A>> A min(A a, A b) {\n\t\treturn a.compareTo(b) < 0 ? a : b;\n\t}\n\n\tstatic int max(int a, int b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic long max(long a, long b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic <A extends Comparable<? super A>> A max(A a, A b) {\n\t\treturn a.compareTo(b) > 0 ? a : b;\n\t}\n\n\tstatic int clamp(int a, int min, int max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic long clamp(long a, long min, long max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic int abs(int a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic long abs(long a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic <A extends Comparable<? super A>> A clamp(A a, A min, A max) {\n\t\treturn a.compareTo(min) < 0 ? min : a.compareTo(max) > 0 ? max : a;\n\t}\n\n\tstatic void out(String val) {\n\t\tIO.out(val);\n\t}\n\n\tstatic void out(Object val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(int val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(long val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(char val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(double val) {\n\t\tIO.out(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t}\n\n\tstatic void out(boolean val) {\n\t\tIO.out(val ? \"true\" : \"false\");\n\t}\n\n\tstatic void outn(String val) {\n\t\tIO.outn(val);\n\t}\n\n\tstatic void outn(Object val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(int val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(long val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(char val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(double val) {\n\t\tIO.outn(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t}\n\n\tstatic void outn(boolean val) {\n\t\tIO.outn(val ? \"true\" : \"false\");\n\t}\n\n\tstatic void kil(String val) {\n\t\tIO.out(val);\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(Object val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(int val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(long val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(char val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(double val) {\n\t\tIO.out(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(boolean val) {\n\t\tIO.out(val ? \"true\" : \"false\");\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic String ns() {\n\t\treturn IO.next();\n\t}\n\n\tstatic int ni() {\n\t\treturn IO.nextInt();\n\t}\n\n\tstatic long nl() {\n\t\treturn IO.nextLong();\n\t}\n\n\tstatic double nd() {\n\t\treturn IO.nextDouble();\n\t}\n\n\tstatic char nc() {\n\t\treturn IO.nextChar();\n\t}\n\n\tstatic String[] nss(int n) {\n\t\tString[] as = new String[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.next();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int[] nis(int n) {\n\t\tint[] as = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextInt();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic long[] nls(int n) {\n\t\tlong[] as = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextLong();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic double[] nds(int n) {\n\t\tdouble[] as = new double[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextDouble();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic char[] ncs(int n) {\n\t\tchar[] as = new char[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextChar();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic String[][] nss2(int n, int m) {\n\t\tString[][] as = new String[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.next();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int[][] nis2(int n, int m) {\n\t\tint[][] as = new int[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextInt();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic long[][] nls2(int n, int m) {\n\t\tlong[][] as = new long[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextLong();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic double[][] nds2(int n, int m) {\n\t\tdouble[][] as = new double[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextDouble();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic char[][] ncs2(int n, int m) {\n\t\tchar[][] as = new char[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextChar();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int parseInt(String val) {\n\t\treturn Integer.parseInt(val);\n\t}\n\n\tstatic long parseLong(String val) {\n\t\treturn Long.parseLong(val);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tsolve();\n\t\t\tIO.flush();\n\t\t} catch (NumberFormatException e) {\n\t\t\te.printStackTrace();\n\t\t} catch (OutOfMemoryError e) {\n\t\t\te.printStackTrace(); // this will be detected as RE\n\t\t}\n\t}\n}\n\nfinal class IO {\n\tprivate static final InputStream in = System.in;\n\tprivate static final PrintWriter out = new PrintWriter(System.out, false);\n\tprivate static final byte[] buffer = new byte[1024];\n\tprivate static int ptr = 0;\n\tprivate static int len = 0;\n\n\tprivate static boolean hasNextByte() {\n\t\tif (ptr < len)\n\t\t\treturn true;\n\t\tptr = 0;\n\t\ttry {\n\t\t\tlen = in.read(buffer);\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn len > 0;\n\t}\n\n\tprivate static int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tstatic boolean hasNext() {\n\t\tbyte c;\n\t\twhile (hasNextByte() && ((c = buffer[ptr]) < '!' || c > '~'))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tstatic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (b >= '!' && b <= '~') {\n\t\t\tsb.append((char) b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tstatic char nextChar() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\treturn (char) readByte();\n\t}\n\n\tstatic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tint sign = 1;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tsign = -1;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b)\n\t\t\tthrow new NumberFormatException();\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9')\n\t\t\t\tn = n * 10 + b - '0';\n\t\t\telse if (b == -1 || b < '!' || b > '~')\n\t\t\t\treturn n * sign;\n\t\t\telse\n\t\t\t\tthrow new NumberFormatException();\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tstatic int nextInt() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tint n = 0;\n\t\tint sign = 1;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tsign = -1;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b)\n\t\t\tthrow new NumberFormatException();\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9')\n\t\t\t\tn = n * 10 + b - '0';\n\t\t\telse if (b == -1 || b < '!' || b > '~')\n\t\t\t\treturn n * sign;\n\t\t\telse\n\t\t\t\tthrow new NumberFormatException();\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tstatic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tstatic void out(String val) {\n\t\tout.println(val);\n\t}\n\n\tstatic void outn(String val) {\n\t\tout.print(val);\n\t}\n\n\tstatic void flush() {\n\t\tout.flush();\n\t}\n}\n\n// TODO: paste library here\n\nclass UF<A> { // Union Find Tree\n\tprivate int[] parents;\n\tprivate int[] ranks;\n\tprivate ArrayList<A> roots;\n\tprivate F.XXX<A, A, A> merger;\n\n\tUF(int n, F.IX<A> maker, F.XXX<A, A, A> merger) {\n\t\tthis.merger = merger;\n\t\tparents = new int[n];\n\t\tranks = new int[n];\n\t\troots = U.make(n, maker);\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tparents[i] = i;\n\t\t}\n\t}\n\n\tint index(int i) {\n\t\tint p = parents[i];\n\t\tif (i == p) {\n\t\t\treturn i;\n\t\t}\n\t\treturn parents[i] = index(p);\n\t}\n\n\tboolean same(int i, int j) {\n\t\treturn index(i) == index(j);\n\t}\n\n\tA root(int i) {\n\t\treturn roots.get(index(i));\n\t}\n\n\tvoid unite(int i, int j) {\n\t\ti = index(i);\n\t\tj = index(j);\n\t\tif (i == j)\n\t\t\treturn;\n\t\tA r = merger.f(root(i), root(j));\n\t\tif (ranks[i] < ranks[j]) {\n\t\t\ti ^= j;\n\t\t\tj ^= i;\n\t\t\ti ^= j;\n\t\t}\n\t\tparents[j] = i;\n\t\troots.set(i, r);\n\t\tif (ranks[i] == ranks[j])\n\t\t\tranks[i]++;\n\t}\n}\n\nclass MS<A> {\n\tprivate TreeMap<A, Long> tm;\n\n\tMS() {\n\t\ttm = new TreeMap<A, Long>();\n\t}\n\n\tMS(Comparator<A> comp) {\n\t\ttm = new TreeMap<A, Long>(comp);\n\t}\n\n\tvoid add(A a, long num) {\n\t\tif (tm.containsKey(a))\n\t\t\ttm.put(a, tm.get(a) + num);\n\t\telse\n\t\t\ttm.put(a, num);\n\t}\n\n\tvoid add(A a) {\n\t\tadd(a, 1);\n\t}\n\n\tlong remove(A a, long num) {\n\t\tif (tm.containsKey(a)) {\n\t\t\tlong n = tm.get(a);\n\t\t\tif (n <= num) {\n\t\t\t\ttm.remove(a);\n\t\t\t\treturn n;\n\t\t\t}\n\t\t\ttm.put(a, n - num);\n\t\t\treturn num;\n\t\t}\n\t\treturn 0;\n\t}\n\n\tboolean remove(A a) {\n\t\treturn remove(a, 1) == 1;\n\t}\n\n\tlong removeAll(A a) {\n\t\treturn remove(a, Long.MAX_VALUE);\n\t}\n\n\tlong num(A a) {\n\t\treturn tm.containsKey(a) ? tm.get(a) : 0;\n\t}\n\n\tint size() {\n\t\treturn tm.size();\n\t}\n\n\tA floor(A a) {\n\t\treturn tm.floorKey(a);\n\t}\n\n\tUP<A, Long> floorNum(A a) {\n\t\tEntry<A, Long> e = tm.floorEntry(a);\n\t\treturn e == null ? null : UP.make(e.getKey(), e.getValue());\n\t}\n\n\tA ceil(A a) {\n\t\treturn tm.ceilingKey(a);\n\t}\n\n\tUP<A, Long> ceilNum(A a) {\n\t\tEntry<A, Long> e = tm.ceilingEntry(a);\n\t\treturn e == null ? null : UP.make(e.getKey(), e.getValue());\n\t}\n\n\tvoid clear() {\n\t\ttm.clear();\n\t}\n\n\tSet<A> keySet() {\n\t\treturn tm.keySet();\n\t}\n\n\tCollection<Long> valueSet() {\n\t\treturn tm.values();\n\t}\n\n\tSet<Entry<A, Long>> entrySet() {\n\t\treturn tm.entrySet();\n\t}\n\n\tpublic String toString() {\n\t\treturn tm.toString();\n\t}\n}\n\nclass WUF<A, W> { // Weighted Union Find Tree\n\tprivate int[] parents;\n\tprivate int[] ranks;\n\tprivate ArrayList<A> roots;\n\tprivate ArrayList<W> weights;\n\tprivate F.XXX<A, A, A> merger;\n\tprivate F.XXX<W, W, W> add;\n\tprivate F.XX<W, W> inv;\n\tprivate W e;\n\n\tWUF(int n, F.IX<A> maker, F.XXX<A, A, A> merger, F.XXX<W, W, W> add, F.XX<W, W> inv, W e) {\n\t\tthis.merger = merger;\n\t\tthis.add = add;\n\t\tthis.inv = inv;\n\t\tthis.e = e;\n\t\tparents = new int[n];\n\t\tranks = new int[n];\n\t\troots = U.make(n, maker);\n\t\tweights = U.make(n, i -> e);\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tparents[i] = i;\n\t\t}\n\t}\n\n\tint index(int i) {\n\t\tint p = parents[i];\n\t\tif (i == p) {\n\t\t\treturn i;\n\t\t}\n\t\tint r = index(p);\n\t\tweights.set(i, add.f(weights.get(i), weights.get(p)));\n\t\treturn parents[i] = r;\n\t}\n\n\tboolean same(int i, int j) {\n\t\treturn index(i) == index(j);\n\t}\n\n\tA root(int i) {\n\t\treturn roots.get(index(i));\n\t}\n\n\tW weight(int i) {\n\t\tindex(i);\n\t\treturn weights.get(i);\n\t}\n\n\tW diff(int i, int j) {\n\t\treturn sub(weight(j), weight(i));\n\t}\n\n\tvoid unite(int i, int j, W w) {\n\t\tw = add(w, weight(i));\n\t\tw = sub(w, weight(j));\n\t\ti = index(i);\n\t\tj = index(j);\n\t\tif (i == j)\n\t\t\treturn;\n\t\tA r = merger.f(root(i), root(j));\n\t\tif (ranks[i] < ranks[j]) {\n\t\t\ti ^= j;\n\t\t\tj ^= i;\n\t\t\ti ^= j;\n\t\t\tw = inv.f(w);\n\t\t}\n\t\tparents[j] = i;\n\t\troots.set(i, r);\n\t\tif (ranks[i] == ranks[j])\n\t\t\tranks[i]++;\n\t\tweights.set(j, w);\n\t}\n\n\tprivate W add(W a, W b) {\n\t\treturn a == e ? b : b == e ? a : add.f(a, b);\n\t}\n\n\tprivate W sub(W a, W b) {\n\t\treturn b == e ? a : add(a, inv.f(b));\n\t}\n}\n\nclass PQ<A> { // Priority Queue\n\tstatic class E { // Entry\n\t\tprivate Object a;\n\t\tprivate int index;\n\n\t\tprivate E(Object a, int index) {\n\t\t\tthis.a = a;\n\t\t\tthis.index = index;\n\t\t}\n\t}\n\n\tprivate int n;\n\tprivate E[] as;\n\tprivate Comparator<A> comp;\n\n\tPQ(Comparator<A> comp) {\n\t\tthis.comp = comp;\n\t\tas = new E[64];\n\t\tn = 1;\n\t}\n\n\tE add(A a) {\n\t\tE res = addEntry(a);\n\t\tfixUp(n - 1);\n\t\treturn res;\n\t}\n\n\tA pop() {\n\t\tint max = n - 1;\n\t\tif (max == 0)\n\t\t\treturn null;\n\t\tif (max == 1) {\n\t\t\treturn removeLast();\n\t\t}\n\n\t\tE tmp = as[1];\n\t\tas[1] = as[max];\n\t\tas[max] = tmp;\n\t\tas[1].index = 1;\n\t\tas[max].index = max;\n\n\t\tA res = removeLast();\n\t\tfixDown(1);\n\t\treturn res;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA get(E e) {\n\t\treturn (A) e.a;\n\t}\n\n\tvoid remove(E e) {\n\t\tint k = ((E) e).index;\n\t\tint max = n - 1;\n\t\tif (k == max) {\n\t\t\tremoveLast();\n\t\t\treturn;\n\t\t}\n\n\t\tE tmp = as[k];\n\t\tas[k] = as[max];\n\t\tas[max] = tmp;\n\t\tas[k].index = k;\n\t\tas[max].index = max;\n\n\t\tremoveLast();\n\t\tif (!fixDown(k))\n\t\t\tfixUp(k);\n\t}\n\n\tvoid update(E e, A a) {\n\t\tint k = e.index;\n\t\tas[k].a = a;\n\t\tif (!fixDown(k))\n\t\t\tfixUp(k);\n\t}\n\n\tboolean isEmpty() {\n\t\treturn n == 1;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate A removeLast() {\n\t\tn--;\n\t\tE res = as[n];\n\t\tres.index = -1;\n\t\tas[n] = null;\n\t\treturn (A) res.a;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate boolean fixUp(int k) {\n\t\tboolean res = false;\n\t\twhile (k > 1) {\n\t\t\tint nk = k >> 1;\n\t\t\tif (comp.compare((A) as[k].a, (A) as[nk].a) < 0) {\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t\tres = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\treturn res;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate boolean fixDown(int k) {\n\t\tboolean res = false;\n\t\twhile (k << 1 < n) {\n\t\t\tA a = (A) as[k].a;\n\t\t\tA l = (A) as[k << 1].a;\n\t\t\tif (k << 1 == n - 1) {\n\t\t\t\tif (comp.compare(a, l) <= 0)\n\t\t\t\t\tbreak;\n\t\t\t\tres = true;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[k << 1];\n\t\t\t\tas[k << 1] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[k << 1].index = k << 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tA r = (A) as[k << 1 | 1].a;\n\t\t\tif (comp.compare(a, l) <= 0 && comp.compare(a, r) <= 0)\n\t\t\t\tbreak;\n\t\t\tres = true;\n\t\t\tif (comp.compare(l, r) < 0) {\n\t\t\t\tint nk = k << 1;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t} else {\n\t\t\t\tint nk = k << 1 | 1;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tprivate E addEntry(A a) {\n\t\tif (n == as.length)\n\t\t\tas = U.doubleSize(as);\n\t\treturn as[n] = new E(a, n++);\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tpublic String toString() {\n\t\tif (n == 1)\n\t\t\treturn \"[]\";\n\t\tString s = null;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tA a = (A) as[i].a;\n\t\t\tif (s == null)\n\t\t\t\ts = \"[\" + a;\n\t\t\telse\n\t\t\t\ts += \", \" + a;\n\t\t}\n\t\treturn s + \"]\";\n\t}\n}\n\nclass Graph {\n\t/**\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t * \n\t * @param forEachEdge\n\t * (index:int, (edgeTo:int, edgeCost:long) -> void) -> void\n\t * @return\n\t * [0] = dist, [1] = prev\n\t */\n\tstatic long[][] dijkstraL(int n, int from, F.II numEdges, F.IXV<F.ILV> forEachEdge) {\n\t\tlong inf = Long.MAX_VALUE;\n\t\tlong[][] res = new long[n][2];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tres[i][0] = i == from ? 0 : inf;\n\t\t\tres[i][1] = -1;\n\t\t}\n\t\tPQ<long[]> q = new PQ<long[]>((a, b) -> Long.compare(a[1], b[1]));\n\n\t\tPQ.E[] qes = new PQ.E[n];\n\t\tArrayList<long[]> ups = new ArrayList<long[]>(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tups.add(new long[] { i, inf });\n\t\t}\n\n\t\tboolean[] fixed = new boolean[n];\n\t\tups.get(from)[1] = 0;\n\t\tqes[from] = q.add(ups.get(from));\n\n\t\twhile (!q.isEmpty()) {\n\t\t\tlong[] up = q.pop();\n\t\t\tint i = (int) up[0];\n\t\t\tif (fixed[i])\n\t\t\t\tcontinue;\n\t\t\tfixed[i] = true;\n\t\t\tlong dist = up[1];\n\t\t\tif (dist == inf)\n\t\t\t\tbreak;\n\t\t\tforEachEdge.f(i, (j, weight) -> {\n\t\t\t\tif (fixed[j])\n\t\t\t\t\treturn;\n\t\t\t\tlong[] resj = res[j];\n\t\t\t\tlong newDist = dist + weight;\n\t\t\t\tif (Long.compare(resj[0], newDist) > 0) {\n\t\t\t\t\tresj[0] = newDist;\n\t\t\t\t\tresj[1] = i;\n\t\t\t\t\tq.add(new long[] { j, newDist });\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t\treturn res;\n\t}\n\n\t/**\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t * \n\t * @param forEachEdge\n\t * (index:int, (edgeTo:int, edgeCost:long) -> void) -> void\n\t * @return\n\t * [0] = dist, [1] = prev\n\t */\n\tstatic double[][] dijkstraD(int n, int from, F.II numEdges, F.IXV<F.IDV> forEachEdge) {\n\t\tdouble inf = Double.POSITIVE_INFINITY;\n\t\tdouble[][] res = new double[n][2];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tres[i][0] = i == from ? 0 : inf;\n\t\t\tres[i][1] = -1;\n\t\t}\n\t\tPQ<double[]> q = new PQ<double[]>((a, b) -> Double.compare(a[1], b[1]));\n\n\t\tPQ.E[] qes = new PQ.E[n];\n\t\tArrayList<double[]> ups = new ArrayList<double[]>(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tups.add(new double[] { i, inf });\n\t\t}\n\n\t\tboolean[] fixed = new boolean[n];\n\t\tups.get(from)[1] = 0;\n\t\tqes[from] = q.add(ups.get(from));\n\n\t\twhile (!q.isEmpty()) {\n\t\t\tdouble[] up = q.pop();\n\t\t\tint i = (int) up[0];\n\t\t\tif (fixed[i])\n\t\t\t\tcontinue;\n\t\t\tfixed[i] = true;\n\t\t\tdouble dist = up[1];\n\t\t\tif (dist == inf)\n\t\t\t\tbreak;\n\t\t\tforEachEdge.f(i, (j, weight) -> {\n\t\t\t\tif (fixed[j])\n\t\t\t\t\treturn;\n\t\t\t\tdouble[] resj = res[j];\n\t\t\t\tdouble newDist = dist + weight;\n\t\t\t\tif (Double.compare(resj[0], newDist) > 0) {\n\t\t\t\t\tresj[0] = newDist;\n\t\t\t\t\tresj[1] = i;\n\t\t\t\t\tq.add(new double[] { j, newDist });\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t\treturn res;\n\t}\n\n}\n\nclass UP<A, B> { // Unordered Pair\n\tA a;\n\tB b;\n\n\tUP(A a, B b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic <A, B> UP<A, B> make(A a, B b) {\n\t\treturn new UP<A, B>(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof UP))\n\t\t\treturn false;\n\t\tUP<?, ?> p = (UP<?, ?>) o;\n\t\tboolean aok = a == null ? p.a == null : a.equals(p.a);\n\t\tboolean bok = b == null ? p.b == null : b.equals(p.b);\n\t\treturn aok && bok;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a.toString() + \", \" + b.toString() + \")\";\n\t}\n}\n\nclass P<A extends Comparable<? super A>, B extends Comparable<? super B>> extends UP<A, B>\n\t\timplements Comparable<P<A, B>> { // Pair\n\tP(A a, B b) {\n\t\tsuper(a, b);\n\t}\n\n\tstatic <A extends Comparable<? super A>, B extends Comparable<? super B>> P<A, B> make(A a, B b) {\n\t\treturn new P<A, B>(a, b);\n\t}\n\n\tpublic int compareTo(P<A, B> o) {\n\t\tint sa = a.compareTo(o.a);\n\t\tint sb = b.compareTo(o.b);\n\t\treturn sa != 0 ? sa : sb;\n\t}\n}\n\nclass PI implements Comparable<PI> { // Pair int\n\tint a;\n\tint b;\n\n\tPI(int a, int b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic PI make(int a, int b) {\n\t\treturn new PI(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof PI))\n\t\t\treturn false;\n\t\tPI p = (PI) o;\n\t\treturn a == p.a && b == p.b;\n\t}\n\n\tpublic int compareTo(PI o) {\n\t\tint sa = a - o.a;\n\t\tint sb = b - o.b;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \")\";\n\t}\n}\n\nclass PL implements Comparable<PL> { // Pair long\n\tlong a;\n\tlong b;\n\n\tPL(long a, long b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic PL make(long a, long b) {\n\t\treturn new PL(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof PL))\n\t\t\treturn false;\n\t\tPL p = (PL) o;\n\t\treturn a == p.a && b == p.b;\n\t}\n\n\tpublic int compareTo(PL o) {\n\t\tlong sa = a - o.a;\n\t\tlong sb = b - o.b;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \")\";\n\t}\n}\n\nclass UT<A, B, C> { // Unordered Tuple\n\tA a;\n\tB b;\n\tC c;\n\n\tUT(A a, B b, C c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic <A, B, C> UT<A, B, C> make(A a, B b, C c) {\n\t\treturn new UT<A, B, C>(a, b, c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof UT))\n\t\t\treturn false;\n\t\tUT<?, ?, ?> t = (UT<?, ?, ?>) o;\n\t\tboolean aok = a == null ? t.a == null : a.equals(t.a);\n\t\tboolean bok = b == null ? t.b == null : b.equals(t.b);\n\t\tboolean cok = c == null ? t.c == null : c.equals(t.c);\n\t\treturn aok && bok && cok;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a.toString() + \", \" + b.toString() + \", \" + c.toString() + \")\";\n\t}\n}\n\nclass T<A extends Comparable<? super A>, B extends Comparable<? super B>, C extends Comparable<? super C>>\n\t\textends UT<A, B, C> implements Comparable<T<A, B, C>> { // Tuple\n\tT(A a, B b, C c) {\n\t\tsuper(a, b, c);\n\t}\n\n\tstatic <A extends Comparable<? super A>, B extends Comparable<? super B>, C extends Comparable<? super C>> T<A, B, C> make(\n\t\t\tA a, B b, C c) {\n\t\treturn new T<A, B, C>(a, b, c);\n\t}\n\n\tpublic int compareTo(T<A, B, C> o) {\n\t\tint sa = a.compareTo(o.a);\n\t\tint sb = b.compareTo(o.b);\n\t\tint sc = c.compareTo(o.c);\n\t\treturn sa != 0 ? sa : sb != 0 ? sb : sc;\n\t}\n}\n\nclass TI implements Comparable<TI> { // Tuple int\n\tint a;\n\tint b;\n\tint c;\n\n\tTI(int a, int b, int c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic TI make(int a, int b, int c) {\n\t\treturn new TI(a, b, c);\n\t}\n\n\tTL toLong() {\n\t\treturn TL.make(a, b, c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof TI))\n\t\t\treturn false;\n\t\tTI t = (TI) o;\n\t\treturn a == t.a && b == t.b && c == t.c;\n\t}\n\n\tpublic int compareTo(TI o) {\n\t\tint sa = a - o.a;\n\t\tint sb = b - o.b;\n\t\tint sc = c - o.c;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : sc > 0 ? 1 : sc < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \", \" + c + \")\";\n\t}\n}\n\nclass TL implements Comparable<TL> { // Tuple long\n\tlong a;\n\tlong b;\n\tlong c;\n\n\tTL(long a, long b, long c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic TL make(long a, long b, long c) {\n\t\treturn new TL(a, b, c);\n\t}\n\n\tTI toInt() {\n\t\treturn TI.make((int) a, (int) b, (int) c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof TL))\n\t\t\treturn false;\n\t\tTL t = (TL) o;\n\t\treturn a == t.a && b == t.b && c == t.c;\n\t}\n\n\tpublic int compareTo(TL o) {\n\t\tlong sa = a - o.a;\n\t\tlong sb = b - o.b;\n\t\tlong sc = c - o.c;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : sc > 0 ? 1 : sc < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \", \" + c + \")\";\n\t}\n}\n\nfinal class U { // Utilities\n\tprivate U() {\n\t}\n\n\tstatic <A> ArrayList<A> make(int n, F.IX<A> maker) {\n\t\tArrayList<A> res = new ArrayList<A>();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres.add(maker.f(i));\n\t\treturn res;\n\t}\n\n\tstatic boolean[] makeB(int n, F.IB maker) {\n\t\tboolean[] res = new boolean[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic int[] makeI(int n, F.II maker) {\n\t\tint[] res = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic long[] makeL(int n, F.IL maker) {\n\t\tlong[] res = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic <A> A[] makeX(int n, F.IX<A> maker, A[] as) {\n\t\tA[] res = Arrays.copyOf(as, n);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic <A> ArrayList<A> filter(ArrayList<A> as, F.XB<A> pred) {\n\t\tArrayList<A> res = new ArrayList<A>();\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\tres.add(a);\n\t\treturn res;\n\t}\n\n\tstatic <A> int count(ArrayList<A> as, F.XB<A> pred) {\n\t\tint res = 0;\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\tres++;\n\t\treturn res;\n\t}\n\n\tstatic <A> ArrayList<A> concat(ArrayList<A> as, ArrayList<A> bs) {\n\t\tArrayList<A> res = new ArrayList<A>();\n\t\tres.addAll(as);\n\t\tres.addAll(bs);\n\t\treturn res;\n\t}\n\n\tstatic <A> boolean any(ArrayList<A> as, F.XB<A> pred) {\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tstatic <A> boolean all(ArrayList<A> as, F.XB<A> pred) {\n\t\tfor (A a : as)\n\t\t\tif (!pred.f(a))\n\t\t\t\treturn false;\n\t\treturn true;\n\t}\n\n\tstatic <A> ArrayList<A> flatten(ArrayList<ArrayList<A>> ass) {\n\t\tArrayList<A> res = new ArrayList<A>();\n\t\tfor (ArrayList<A> as : ass)\n\t\t\tres.addAll(as);\n\t\treturn res;\n\t}\n\n\tstatic <A, B> B foldl(ArrayList<A> as, F.XXX<B, A, B> f, B e) {\n\t\tB res = e;\n\t\tfor (A a : as)\n\t\t\tres = f.f(res, a);\n\t\treturn res;\n\t}\n\n\tstatic <A, B> B foldr(ArrayList<A> as, F.XXX<A, B, B> f, B e) {\n\t\tB res = e;\n\t\tfor (int i = as.size() - 1; i >= 0; i--)\n\t\t\tres = f.f(as.get(i), res);\n\t\treturn res;\n\t}\n\n\tstatic <A> ArrayList<A> reverse(ArrayList<A> as) {\n\t\tint size = as.size();\n\t\treturn make(size, i -> as.get(size - 1 - i));\n\t}\n\n\tstatic boolean[] reverse(boolean[] as) {\n\t\tint size = as.length;\n\t\treturn makeB(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic int[] reverse(int[] as) {\n\t\tint size = as.length;\n\t\treturn makeI(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic long[] reverse(long[] as) {\n\t\tint size = as.length;\n\t\treturn makeL(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic <A> A[] reverse(A[] as) {\n\t\tint size = as.length;\n\t\treturn makeX(size, i -> as[size - 1 - i], as);\n\t}\n\n\tstatic <A extends Comparable<? super A>> UP<TreeMap<A, Integer>, ArrayList<A>> compress(ArrayList<A> as) {\n\t\tTreeSet<A> set = new TreeSet<A>(as);\n\t\tTreeMap<A, Integer> map = new TreeMap<A, Integer>();\n\t\tArrayList<A> imap = new ArrayList<A>();\n\t\tint i = 0;\n\t\tfor (A a : set) {\n\t\t\tmap.put(a, i++);\n\t\t\timap.add(a);\n\t\t}\n\t\treturn UP.make(map, imap);\n\t}\n\n\tstatic <A, B> ArrayList<B> map(ArrayList<A> as, F.XX<A, B> f) {\n\t\treturn make(as.size(), (i) -> f.f(as.get(i)));\n\t}\n\n\tstatic <A, B> ArrayList<B> mapi(ArrayList<A> as, F.XIX<A, B> f) {\n\t\treturn make(as.size(), (i) -> f.f(as.get(i), i));\n\t}\n\n\tstatic <A, B> ArrayList<UP<A, B>> zip(ArrayList<A> as, ArrayList<B> bs) {\n\t\treturn make(min(as.size(), bs.size()), (i) -> UP.make(as.get(i), bs.get(i)));\n\t}\n\n\tstatic int min(int a, int b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic long min(long a, long b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic <A extends Comparable<? super A>> A min(A a, A b) {\n\t\treturn a.compareTo(b) < 0 ? a : b;\n\t}\n\n\tstatic int max(int a, int b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic long max(long a, long b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic <A extends Comparable<? super A>> A max(A a, A b) {\n\t\treturn a.compareTo(b) > 0 ? a : b;\n\t}\n\n\tstatic int clamp(int a, int min, int max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic long clamp(long a, long min, long max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic <A extends Comparable<? super A>> A clamp(A a, A min, A max) {\n\t\treturn a.compareTo(min) < 0 ? min : a.compareTo(max) > 0 ? max : a;\n\t}\n\n\tstatic int abs(int a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic long abs(long a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic void forEachBitPerm(int n, int k, F.IV f) {\n\t\tfor (int i = (1 << k) - 1; i < 1 << n;) {\n\t\t\tf.f(i);\n\t\t\tint t = (i | i - 1) + 1;\n\t\t\ti = t | ((t & -t) / (i & -i) >> 1) - 1;\n\t\t}\n\t}\n\n\tstatic int nextBitPerm(int a) {\n\t\tint t = (a | a - 1) + 1;\n\t\treturn t | ((t & -t) / (a & -a) >> 1) - 1;\n\t}\n\n\tstatic void mebius(int n, F.IIV f) { // s, i\n\t\tint bit = 1;\n\t\tint exp = 0;\n\t\tfor (int i = 1; i < 1 << n; i++) {\n\t\t\tf.f(i ^ bit, exp);\n\t\t\tif ((i & i + 1) == 0) {\n\t\t\t\tbit <<= 1;\n\t\t\t\texp++;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic void zeta(int n, F.IIV f) { // s, i\n\t\tint m = (1 << n) - 1;\n\t\tint bit = 1;\n\t\tint exp = 0;\n\t\tfor (int i = (1 << n) - 2; i >= 0; i--) {\n\t\t\tf.f(i ^ bit, exp);\n\t\t\tif ((~i & ~i + 1 & m) == 0) {\n\t\t\t\tbit <<= 1;\n\t\t\t\texp++;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic <A> ArrayList<A> toAL(A[] as) {\n\t\treturn make(as.length, i -> as[i]);\n\t}\n\n\tstatic <A> A[] doubleSize(A[] as) {\n\t\treturn Arrays.copyOf(as, as.length << 1);\n\t}\n\n\tstatic long searchL(long ng, long ok, F.LB isOk) {\n\t\twhile (ng - ok > 1 || ok - ng > 1) {\n\t\t\tlong mid = ng + ok >> 1;\n\t\t\tif (isOk.f(mid))\n\t\t\t\tok = mid;\n\t\t\telse\n\t\t\t\tng = mid;\n\t\t}\n\t\treturn ok;\n\t}\n\n\tstatic int searchI(int ng, int ok, F.IB isOk) {\n\t\treturn (int) searchL((long) ng, (long) ok, (mid) -> isOk.f((int) mid));\n\t}\n}\n\nfinal class F { // Functions\n\tprivate F() {\n\t}\n\n\tinterface VV {\n\t\tvoid f();\n\t}\n\n\tinterface BV {\n\t\tvoid f(boolean a);\n\t}\n\n\tinterface BXV<A> {\n\t\tvoid f(boolean a, A b);\n\t}\n\n\tinterface BXXV<A, B> {\n\t\tvoid f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXV<A, B, C> {\n\t\tvoid f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBV<A> {\n\t\tvoid f(A a, boolean b);\n\t}\n\n\tinterface XXBV<A, B> {\n\t\tvoid f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBV<A, B, C> {\n\t\tvoid f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IV {\n\t\tvoid f(int a);\n\t}\n\n\tinterface IXV<A> {\n\t\tvoid f(int a, A b);\n\t}\n\n\tinterface IXXV<A, B> {\n\t\tvoid f(int a, A b, B c);\n\t}\n\n\tinterface IXXXV<A, B, C> {\n\t\tvoid f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIV<A> {\n\t\tvoid f(A a, int b);\n\t}\n\n\tinterface XXIV<A, B> {\n\t\tvoid f(A a, B b, int c);\n\t}\n\n\tinterface XXXIV<A, B, C> {\n\t\tvoid f(A a, B b, C c, int d);\n\t}\n\n\tinterface LV {\n\t\tvoid f(long a);\n\t}\n\n\tinterface LXV<A> {\n\t\tvoid f(long a, A b);\n\t}\n\n\tinterface LXXV<A, B> {\n\t\tvoid f(long a, A b, B c);\n\t}\n\n\tinterface LXXXV<A, B, C> {\n\t\tvoid f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLV<A> {\n\t\tvoid f(A a, long b);\n\t}\n\n\tinterface XXLV<A, B> {\n\t\tvoid f(A a, B b, long c);\n\t}\n\n\tinterface XXXLV<A, B, C> {\n\t\tvoid f(A a, B b, C c, long d);\n\t}\n\n\tinterface DV {\n\t\tvoid f(double a);\n\t}\n\n\tinterface DXV<A> {\n\t\tvoid f(double a, A b);\n\t}\n\n\tinterface DXXV<A, B> {\n\t\tvoid f(double a, A b, B c);\n\t}\n\n\tinterface DXXXV<A, B, C> {\n\t\tvoid f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDV<A> {\n\t\tvoid f(A a, double b);\n\t}\n\n\tinterface XXDV<A, B> {\n\t\tvoid f(A a, B b, double c);\n\t}\n\n\tinterface XXXDV<A, B, C> {\n\t\tvoid f(A a, B b, C c, double d);\n\t}\n\n\tinterface XV<A> {\n\t\tvoid f(A a);\n\t}\n\n\tinterface XXV<A, B> {\n\t\tvoid f(A a, B b);\n\t}\n\n\tinterface XXXV<A, B, C> {\n\t\tvoid f(A a, B b, C c);\n\t}\n\n\tinterface XXXXV<A, B, C, D> {\n\t\tvoid f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBV {\n\t\tvoid f(boolean a, boolean b);\n\t}\n\n\tinterface BIV {\n\t\tvoid f(boolean a, int b);\n\t}\n\n\tinterface BLV {\n\t\tvoid f(boolean a, long b);\n\t}\n\n\tinterface BDV {\n\t\tvoid f(boolean a, double b);\n\t}\n\n\tinterface IBV {\n\t\tvoid f(int a, boolean b);\n\t}\n\n\tinterface IIV {\n\t\tvoid f(int a, int b);\n\t}\n\n\tinterface ILV {\n\t\tvoid f(int a, long b);\n\t}\n\n\tinterface IDV {\n\t\tvoid f(int a, double b);\n\t}\n\n\tinterface LBV {\n\t\tvoid f(long a, boolean b);\n\t}\n\n\tinterface LIV {\n\t\tvoid f(long a, int b);\n\t}\n\n\tinterface LLV {\n\t\tvoid f(long a, long b);\n\t}\n\n\tinterface LDV {\n\t\tvoid f(long a, double b);\n\t}\n\n\tinterface DBV {\n\t\tvoid f(double a, boolean b);\n\t}\n\n\tinterface DIV {\n\t\tvoid f(double a, int b);\n\t}\n\n\tinterface DLV {\n\t\tvoid f(double a, long b);\n\t}\n\n\tinterface DDV {\n\t\tvoid f(double a, double b);\n\t}\n\n\tinterface VB {\n\t\tboolean f();\n\t}\n\n\tinterface BB {\n\t\tboolean f(boolean a);\n\t}\n\n\tinterface BXB<A> {\n\t\tboolean f(boolean a, A b);\n\t}\n\n\tinterface BXXB<A, B> {\n\t\tboolean f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXB<A, B, C> {\n\t\tboolean f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBB<A> {\n\t\tboolean f(A a, boolean b);\n\t}\n\n\tinterface XXBB<A, B> {\n\t\tboolean f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBB<A, B, C> {\n\t\tboolean f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IB {\n\t\tboolean f(int a);\n\t}\n\n\tinterface IXB<A> {\n\t\tboolean f(int a, A b);\n\t}\n\n\tinterface IXXB<A, B> {\n\t\tboolean f(int a, A b, B c);\n\t}\n\n\tinterface IXXXB<A, B, C> {\n\t\tboolean f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIB<A> {\n\t\tboolean f(A a, int b);\n\t}\n\n\tinterface XXIB<A, B> {\n\t\tboolean f(A a, B b, int c);\n\t}\n\n\tinterface XXXIB<A, B, C> {\n\t\tboolean f(A a, B b, C c, int d);\n\t}\n\n\tinterface LB {\n\t\tboolean f(long a);\n\t}\n\n\tinterface LXB<A> {\n\t\tboolean f(long a, A b);\n\t}\n\n\tinterface LXXB<A, B> {\n\t\tboolean f(long a, A b, B c);\n\t}\n\n\tinterface LXXXB<A, B, C> {\n\t\tboolean f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLB<A> {\n\t\tboolean f(A a, long b);\n\t}\n\n\tinterface XXLB<A, B> {\n\t\tboolean f(A a, B b, long c);\n\t}\n\n\tinterface XXXLB<A, B, C> {\n\t\tboolean f(A a, B b, C c, long d);\n\t}\n\n\tinterface DB {\n\t\tboolean f(double a);\n\t}\n\n\tinterface DXB<A> {\n\t\tboolean f(double a, A b);\n\t}\n\n\tinterface DXXB<A, B> {\n\t\tboolean f(double a, A b, B c);\n\t}\n\n\tinterface DXXXB<A, B, C> {\n\t\tboolean f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDB<A> {\n\t\tboolean f(A a, double b);\n\t}\n\n\tinterface XXDB<A, B> {\n\t\tboolean f(A a, B b, double c);\n\t}\n\n\tinterface XXXDB<A, B, C> {\n\t\tboolean f(A a, B b, C c, double d);\n\t}\n\n\tinterface XB<A> {\n\t\tboolean f(A a);\n\t}\n\n\tinterface XXB<A, B> {\n\t\tboolean f(A a, B b);\n\t}\n\n\tinterface XXXB<A, B, C> {\n\t\tboolean f(A a, B b, C c);\n\t}\n\n\tinterface XXXXB<A, B, C, D> {\n\t\tboolean f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBB {\n\t\tboolean f(boolean a, boolean b);\n\t}\n\n\tinterface BIB {\n\t\tboolean f(boolean a, int b);\n\t}\n\n\tinterface BLB {\n\t\tboolean f(boolean a, long b);\n\t}\n\n\tinterface BDB {\n\t\tboolean f(boolean a, double b);\n\t}\n\n\tinterface IBB {\n\t\tboolean f(int a, boolean b);\n\t}\n\n\tinterface IIB {\n\t\tboolean f(int a, int b);\n\t}\n\n\tinterface ILB {\n\t\tboolean f(int a, long b);\n\t}\n\n\tinterface IDB {\n\t\tboolean f(int a, double b);\n\t}\n\n\tinterface LBB {\n\t\tboolean f(long a, boolean b);\n\t}\n\n\tinterface LIB {\n\t\tboolean f(long a, int b);\n\t}\n\n\tinterface LLB {\n\t\tboolean f(long a, long b);\n\t}\n\n\tinterface LDB {\n\t\tboolean f(long a, double b);\n\t}\n\n\tinterface DBB {\n\t\tboolean f(double a, boolean b);\n\t}\n\n\tinterface DIB {\n\t\tboolean f(double a, int b);\n\t}\n\n\tinterface DLB {\n\t\tboolean f(double a, long b);\n\t}\n\n\tinterface DDB {\n\t\tboolean f(double a, double b);\n\t}\n\n\tinterface VI {\n\t\tint f();\n\t}\n\n\tinterface BI {\n\t\tint f(boolean a);\n\t}\n\n\tinterface BXI<A> {\n\t\tint f(boolean a, A b);\n\t}\n\n\tinterface BXXI<A, B> {\n\t\tint f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXI<A, B, C> {\n\t\tint f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBI<A> {\n\t\tint f(A a, boolean b);\n\t}\n\n\tinterface XXBI<A, B> {\n\t\tint f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBI<A, B, C> {\n\t\tint f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface II {\n\t\tint f(int a);\n\t}\n\n\tinterface IXI<A> {\n\t\tint f(int a, A b);\n\t}\n\n\tinterface IXXI<A, B> {\n\t\tint f(int a, A b, B c);\n\t}\n\n\tinterface IXXXI<A, B, C> {\n\t\tint f(int a, A b, B c, C d);\n\t}\n\n\tinterface XII<A> {\n\t\tint f(A a, int b);\n\t}\n\n\tinterface XXII<A, B> {\n\t\tint f(A a, B b, int c);\n\t}\n\n\tinterface XXXII<A, B, C> {\n\t\tint f(A a, B b, C c, int d);\n\t}\n\n\tinterface LI {\n\t\tint f(long a);\n\t}\n\n\tinterface LXI<A> {\n\t\tint f(long a, A b);\n\t}\n\n\tinterface LXXI<A, B> {\n\t\tint f(long a, A b, B c);\n\t}\n\n\tinterface LXXXI<A, B, C> {\n\t\tint f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLI<A> {\n\t\tint f(A a, long b);\n\t}\n\n\tinterface XXLI<A, B> {\n\t\tint f(A a, B b, long c);\n\t}\n\n\tinterface XXXLI<A, B, C> {\n\t\tint f(A a, B b, C c, long d);\n\t}\n\n\tinterface DI {\n\t\tint f(double a);\n\t}\n\n\tinterface DXI<A> {\n\t\tint f(double a, A b);\n\t}\n\n\tinterface DXXI<A, B> {\n\t\tint f(double a, A b, B c);\n\t}\n\n\tinterface DXXXI<A, B, C> {\n\t\tint f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDI<A> {\n\t\tint f(A a, double b);\n\t}\n\n\tinterface XXDI<A, B> {\n\t\tint f(A a, B b, double c);\n\t}\n\n\tinterface XXXDI<A, B, C> {\n\t\tint f(A a, B b, C c, double d);\n\t}\n\n\tinterface XI<A> {\n\t\tint f(A a);\n\t}\n\n\tinterface XXI<A, B> {\n\t\tint f(A a, B b);\n\t}\n\n\tinterface XXXI<A, B, C> {\n\t\tint f(A a, B b, C c);\n\t}\n\n\tinterface XXXXI<A, B, C, D> {\n\t\tint f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBI {\n\t\tint f(boolean a, boolean b);\n\t}\n\n\tinterface BII {\n\t\tint f(boolean a, int b);\n\t}\n\n\tinterface BLI {\n\t\tint f(boolean a, long b);\n\t}\n\n\tinterface BDI {\n\t\tint f(boolean a, double b);\n\t}\n\n\tinterface IBI {\n\t\tint f(int a, boolean b);\n\t}\n\n\tinterface III {\n\t\tint f(int a, int b);\n\t}\n\n\tinterface ILI {\n\t\tint f(int a, long b);\n\t}\n\n\tinterface IDI {\n\t\tint f(int a, double b);\n\t}\n\n\tinterface LBI {\n\t\tint f(long a, boolean b);\n\t}\n\n\tinterface LII {\n\t\tint f(long a, int b);\n\t}\n\n\tinterface LLI {\n\t\tint f(long a, long b);\n\t}\n\n\tinterface LDI {\n\t\tint f(long a, double b);\n\t}\n\n\tinterface DBI {\n\t\tint f(double a, boolean b);\n\t}\n\n\tinterface DII {\n\t\tint f(double a, int b);\n\t}\n\n\tinterface DLI {\n\t\tint f(double a, long b);\n\t}\n\n\tinterface DDI {\n\t\tint f(double a, double b);\n\t}\n\n\tinterface VL {\n\t\tlong f();\n\t}\n\n\tinterface BL {\n\t\tlong f(boolean a);\n\t}\n\n\tinterface BXL<A> {\n\t\tlong f(boolean a, A b);\n\t}\n\n\tinterface BXXL<A, B> {\n\t\tlong f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXL<A, B, C> {\n\t\tlong f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBL<A> {\n\t\tlong f(A a, boolean b);\n\t}\n\n\tinterface XXBL<A, B> {\n\t\tlong f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBL<A, B, C> {\n\t\tlong f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IL {\n\t\tlong f(int a);\n\t}\n\n\tinterface IXL<A> {\n\t\tlong f(int a, A b);\n\t}\n\n\tinterface IXXL<A, B> {\n\t\tlong f(int a, A b, B c);\n\t}\n\n\tinterface IXXXL<A, B, C> {\n\t\tlong f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIL<A> {\n\t\tlong f(A a, int b);\n\t}\n\n\tinterface XXIL<A, B> {\n\t\tlong f(A a, B b, int c);\n\t}\n\n\tinterface XXXIL<A, B, C> {\n\t\tlong f(A a, B b, C c, int d);\n\t}\n\n\tinterface LL {\n\t\tlong f(long a);\n\t}\n\n\tinterface LXL<A> {\n\t\tlong f(long a, A b);\n\t}\n\n\tinterface LXXL<A, B> {\n\t\tlong f(long a, A b, B c);\n\t}\n\n\tinterface LXXXL<A, B, C> {\n\t\tlong f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLL<A> {\n\t\tlong f(A a, long b);\n\t}\n\n\tinterface XXLL<A, B> {\n\t\tlong f(A a, B b, long c);\n\t}\n\n\tinterface XXXLL<A, B, C> {\n\t\tlong f(A a, B b, C c, long d);\n\t}\n\n\tinterface DL {\n\t\tlong f(double a);\n\t}\n\n\tinterface DXL<A> {\n\t\tlong f(double a, A b);\n\t}\n\n\tinterface DXXL<A, B> {\n\t\tlong f(double a, A b, B c);\n\t}\n\n\tinterface DXXXL<A, B, C> {\n\t\tlong f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDL<A> {\n\t\tlong f(A a, double b);\n\t}\n\n\tinterface XXDL<A, B> {\n\t\tlong f(A a, B b, double c);\n\t}\n\n\tinterface XXXDL<A, B, C> {\n\t\tlong f(A a, B b, C c, double d);\n\t}\n\n\tinterface XL<A> {\n\t\tlong f(A a);\n\t}\n\n\tinterface XXL<A, B> {\n\t\tlong f(A a, B b);\n\t}\n\n\tinterface XXXL<A, B, C> {\n\t\tlong f(A a, B b, C c);\n\t}\n\n\tinterface XXXXL<A, B, C, D> {\n\t\tlong f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBL {\n\t\tlong f(boolean a, boolean b);\n\t}\n\n\tinterface BIL {\n\t\tlong f(boolean a, int b);\n\t}\n\n\tinterface BLL {\n\t\tlong f(boolean a, long b);\n\t}\n\n\tinterface BDL {\n\t\tlong f(boolean a, double b);\n\t}\n\n\tinterface IBL {\n\t\tlong f(int a, boolean b);\n\t}\n\n\tinterface IIL {\n\t\tlong f(int a, int b);\n\t}\n\n\tinterface ILL {\n\t\tlong f(int a, long b);\n\t}\n\n\tinterface IDL {\n\t\tlong f(int a, double b);\n\t}\n\n\tinterface LBL {\n\t\tlong f(long a, boolean b);\n\t}\n\n\tinterface LIL {\n\t\tlong f(long a, int b);\n\t}\n\n\tinterface LLL {\n\t\tlong f(long a, long b);\n\t}\n\n\tinterface LDL {\n\t\tlong f(long a, double b);\n\t}\n\n\tinterface DBL {\n\t\tlong f(double a, boolean b);\n\t}\n\n\tinterface DIL {\n\t\tlong f(double a, int b);\n\t}\n\n\tinterface DLL {\n\t\tlong f(double a, long b);\n\t}\n\n\tinterface DDL {\n\t\tlong f(double a, double b);\n\t}\n\n\tinterface VD {\n\t\tdouble f();\n\t}\n\n\tinterface BD {\n\t\tdouble f(boolean a);\n\t}\n\n\tinterface BXD<A> {\n\t\tdouble f(boolean a, A b);\n\t}\n\n\tinterface BXXD<A, B> {\n\t\tdouble f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXD<A, B, C> {\n\t\tdouble f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBD<A> {\n\t\tdouble f(A a, boolean b);\n\t}\n\n\tinterface XXBD<A, B> {\n\t\tdouble f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBD<A, B, C> {\n\t\tdouble f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface ID {\n\t\tdouble f(int a);\n\t}\n\n\tinterface IXD<A> {\n\t\tdouble f(int a, A b);\n\t}\n\n\tinterface IXXD<A, B> {\n\t\tdouble f(int a, A b, B c);\n\t}\n\n\tinterface IXXXD<A, B, C> {\n\t\tdouble f(int a, A b, B c, C d);\n\t}\n\n\tinterface XID<A> {\n\t\tdouble f(A a, int b);\n\t}\n\n\tinterface XXID<A, B> {\n\t\tdouble f(A a, B b, int c);\n\t}\n\n\tinterface XXXID<A, B, C> {\n\t\tdouble f(A a, B b, C c, int d);\n\t}\n\n\tinterface LD {\n\t\tdouble f(long a);\n\t}\n\n\tinterface LXD<A> {\n\t\tdouble f(long a, A b);\n\t}\n\n\tinterface LXXD<A, B> {\n\t\tdouble f(long a, A b, B c);\n\t}\n\n\tinterface LXXXD<A, B, C> {\n\t\tdouble f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLD<A> {\n\t\tdouble f(A a, long b);\n\t}\n\n\tinterface XXLD<A, B> {\n\t\tdouble f(A a, B b, long c);\n\t}\n\n\tinterface XXXLD<A, B, C> {\n\t\tdouble f(A a, B b, C c, long d);\n\t}\n\n\tinterface DD {\n\t\tdouble f(double a);\n\t}\n\n\tinterface DXD<A> {\n\t\tdouble f(double a, A b);\n\t}\n\n\tinterface DXXD<A, B> {\n\t\tdouble f(double a, A b, B c);\n\t}\n\n\tinterface DXXXD<A, B, C> {\n\t\tdouble f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDD<A> {\n\t\tdouble f(A a, double b);\n\t}\n\n\tinterface XXDD<A, B> {\n\t\tdouble f(A a, B b, double c);\n\t}\n\n\tinterface XXXDD<A, B, C> {\n\t\tdouble f(A a, B b, C c, double d);\n\t}\n\n\tinterface XD<A> {\n\t\tdouble f(A a);\n\t}\n\n\tinterface XXD<A, B> {\n\t\tdouble f(A a, B b);\n\t}\n\n\tinterface XXXD<A, B, C> {\n\t\tdouble f(A a, B b, C c);\n\t}\n\n\tinterface XXXXD<A, B, C, D> {\n\t\tdouble f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBD {\n\t\tdouble f(boolean a, boolean b);\n\t}\n\n\tinterface BID {\n\t\tdouble f(boolean a, int b);\n\t}\n\n\tinterface BLD {\n\t\tdouble f(boolean a, long b);\n\t}\n\n\tinterface BDD {\n\t\tdouble f(boolean a, double b);\n\t}\n\n\tinterface IBD {\n\t\tdouble f(int a, boolean b);\n\t}\n\n\tinterface IID {\n\t\tdouble f(int a, int b);\n\t}\n\n\tinterface ILD {\n\t\tdouble f(int a, long b);\n\t}\n\n\tinterface IDD {\n\t\tdouble f(int a, double b);\n\t}\n\n\tinterface LBD {\n\t\tdouble f(long a, boolean b);\n\t}\n\n\tinterface LID {\n\t\tdouble f(long a, int b);\n\t}\n\n\tinterface LLD {\n\t\tdouble f(long a, long b);\n\t}\n\n\tinterface LDD {\n\t\tdouble f(long a, double b);\n\t}\n\n\tinterface DBD {\n\t\tdouble f(double a, boolean b);\n\t}\n\n\tinterface DID {\n\t\tdouble f(double a, int b);\n\t}\n\n\tinterface DLD {\n\t\tdouble f(double a, long b);\n\t}\n\n\tinterface DDD {\n\t\tdouble f(double a, double b);\n\t}\n\n\tinterface VX<A> {\n\t\tA f();\n\t}\n\n\tinterface BX<A> {\n\t\tA f(boolean a);\n\t}\n\n\tinterface BXX<A, B> {\n\t\tB f(boolean a, A b);\n\t}\n\n\tinterface BXXX<A, B, C> {\n\t\tC f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXX<A, B, C, D> {\n\t\tD f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBX<A, B> {\n\t\tB f(A a, boolean b);\n\t}\n\n\tinterface XXBX<A, B, C> {\n\t\tC f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBX<A, B, C, D> {\n\t\tD f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IX<A> {\n\t\tA f(int a);\n\t}\n\n\tinterface IXX<A, B> {\n\t\tB f(int a, A b);\n\t}\n\n\tinterface IXXX<A, B, C> {\n\t\tC f(int a, A b, B c);\n\t}\n\n\tinterface IXXXX<A, B, C, D> {\n\t\tD f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIX<A, B> {\n\t\tB f(A a, int b);\n\t}\n\n\tinterface XXIX<A, B, C> {\n\t\tC f(A a, B b, int c);\n\t}\n\n\tinterface XXXIX<A, B, C, D> {\n\t\tD f(A a, B b, C c, int d);\n\t}\n\n\tinterface LX<A> {\n\t\tA f(long a);\n\t}\n\n\tinterface LXX<A, B> {\n\t\tB f(long a, A b);\n\t}\n\n\tinterface LXXX<A, B, C> {\n\t\tC f(long a, A b, B c);\n\t}\n\n\tinterface LXXXX<A, B, C, D> {\n\t\tD f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLX<A, B> {\n\t\tB f(A a, long b);\n\t}\n\n\tinterface XXLX<A, B, C> {\n\t\tC f(A a, B b, long c);\n\t}\n\n\tinterface XXXLX<A, B, C, D> {\n\t\tD f(A a, B b, C c, long d);\n\t}\n\n\tinterface DX<A> {\n\t\tA f(double a);\n\t}\n\n\tinterface DXX<A, B> {\n\t\tB f(double a, A b);\n\t}\n\n\tinterface DXXX<A, B, C> {\n\t\tC f(double a, A b, B c);\n\t}\n\n\tinterface DXXXX<A, B, C, D> {\n\t\tD f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDX<A, B> {\n\t\tB f(A a, double b);\n\t}\n\n\tinterface XXDX<A, B, C> {\n\t\tC f(A a, B b, double c);\n\t}\n\n\tinterface XXXDX<A, B, C, D> {\n\t\tD f(A a, B b, C c, double d);\n\t}\n\n\tinterface XX<A, B> {\n\t\tB f(A a);\n\t}\n\n\tinterface XXX<A, B, C> {\n\t\tC f(A a, B b);\n\t}\n\n\tinterface XXXX<A, B, C, D> {\n\t\tD f(A a, B b, C c);\n\t}\n\n\tinterface XXXXX<A, B, C, D, E> {\n\t\tE f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBX<A> {\n\t\tA f(boolean a, boolean b);\n\t}\n\n\tinterface BIX<A> {\n\t\tA f(boolean a, int b);\n\t}\n\n\tinterface BLX<A> {\n\t\tA f(boolean a, long b);\n\t}\n\n\tinterface BDX<A> {\n\t\tA f(boolean a, double b);\n\t}\n\n\tinterface IBX<A> {\n\t\tA f(int a, boolean b);\n\t}\n\n\tinterface IIX<A> {\n\t\tA f(int a, int b);\n\t}\n\n\tinterface ILX<A> {\n\t\tA f(int a, long b);\n\t}\n\n\tinterface IDX<A> {\n\t\tA f(int a, double b);\n\t}\n\n\tinterface LBX<A> {\n\t\tA f(long a, boolean b);\n\t}\n\n\tinterface LIX<A> {\n\t\tA f(long a, int b);\n\t}\n\n\tinterface LLX<A> {\n\t\tA f(long a, long b);\n\t}\n\n\tinterface LDX<A> {\n\t\tA f(long a, double b);\n\t}\n\n\tinterface DBX<A> {\n\t\tA f(double a, boolean b);\n\t}\n\n\tinterface DIX<A> {\n\t\tA f(double a, int b);\n\t}\n\n\tinterface DLX<A> {\n\t\tA f(double a, long b);\n\t}\n\n\tinterface DDX<A> {\n\t\tA f(double a, double b);\n\t}\n}\n\nclass SA { // suffix array\n\tstatic int[] makeSA(String s) {\n\t\tint n = s.length() + 1;\n\t\tint[] cs = new int[n];\n\t\tcs[n - 1] = 0;\n\t\tfor (int i = 0; i < n - 1; i++)\n\t\t\tcs[i] = s.charAt(i) + 1;\n\t\tArrayList<Integer> acs = U.make(n, i -> cs[i]);\n\t\tTreeMap<Integer, Integer> tm = U.compress(acs).a;\n\t\tint k = tm.size();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tcs[i] = tm.get(cs[i]);\n\t\treturn makeSA(cs, n, k);\n\t}\n\n\tstatic int[] makeLCP(String s, int[] sa) { // lcp(i, i+1)\n\t\tint n = sa.length;\n\t\tint[] r = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tr[sa[i]] = i;\n\t\tint[] lcp = new int[n];\n\t\tint l = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint idx = r[i];\n\t\t\tif (idx == n - 1) {\n\t\t\t\tlcp[idx] = -1;\n\t\t\t\tl = 0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tint p = sa[idx];\n\t\t\tint q = sa[idx + 1];\n\t\t\tif (l > 0)\n\t\t\t\tl--;\n\t\t\twhile (p + l < n - 1 && q + l < n - 1 && s.charAt(p + l) == s.charAt(q + l))\n\t\t\t\tl++;\n\t\t\tlcp[idx] = l;\n\t\t}\n\t\treturn lcp;\n\t}\n\n\tstatic F.III lcpQuery(String s) {\n\t\tint n = s.length() + 1;\n\t\tint[] sa = makeSA(s);\n\t\tint[] lcp = makeLCP(s, sa);\n\t\tint[] inv = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tinv[sa[i]] = i;\n\t\t}\n\t\tST<Integer> st = new ST<Integer>(n, (a, b) -> a < b ? a : b, Integer.MAX_VALUE);\n\t\tst.init(i -> i < n ? lcp[i] : Integer.MAX_VALUE);\n\t\treturn (i, j) -> {\n\t\t\tif (i == j)\n\t\t\t\treturn n - 1 - i;\n\t\t\ti = inv[i];\n\t\t\tj = inv[j];\n\t\t\tif (i > j) {\n\t\t\t\ti ^= j;\n\t\t\t\tj ^= i;\n\t\t\t\ti ^= j;\n\t\t\t}\n\t\t\treturn st.query(i, j);\n\t\t};\n\t}\n\n\tprivate static int[] makeSA(int[] cs, int n, int k) {\n\t\tboolean[] isS = new boolean[n];\n\t\tboolean[] isLms = new boolean[n];\n\t\tint[] lmss = new int[n];\n\t\tint numLmss = 0;\n\t\tisS[n - 1] = true;\n\t\tfor (int i = n - 2; i >= 0; i--)\n\t\t\tisS[i] = cs[i] < cs[i + 1] || cs[i] == cs[i + 1] && isS[i + 1];\n\t\tfor (int i = 1; i < n; i++)\n\t\t\tif (!isS[i - 1] && isS[i]) {\n\t\t\t\tlmss[numLmss++] = i;\n\t\t\t\tisLms[i] = true;\n\t\t\t}\n\t\tint[] sa = inducedSort(cs, n, numLmss, k, lmss, isS);\n\t\tint[] lmss2 = new int[numLmss];\n\t\tnumLmss = 0;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (isLms[sa[i]])\n\t\t\t\tlmss2[numLmss++] = sa[i];\n\t\tint num = 0;\n\t\tsa[lmss2[0]] = 0;\n\t\tfor (int i = 0; i < numLmss - 1; i++) {\n\t\t\tint p = lmss2[i];\n\t\t\tint q = lmss2[i + 1];\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (cs[p] != cs[q] || isLms[p] != isLms[q]) {\n\t\t\t\t\tsa[lmss2[i + 1]] = ++num;\n\t\t\t\t\tbreak;\n\t\t\t\t} else if (j > 0 && (isLms[p] || isLms[q])) {\n\t\t\t\t\tsa[lmss2[i + 1]] = num;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tp++;\n\t\t\t\tq++;\n\t\t\t}\n\t\t}\n\t\tif (num + 1 < numLmss) {\n\t\t\tnumLmss = 0;\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tif (isLms[i])\n\t\t\t\t\tlmss2[numLmss++] = sa[i];\n\t\t\tlmss2 = makeSA(lmss2, numLmss, num + 1);\n\t\t\tfor (int i = 0; i < numLmss; i++)\n\t\t\t\tlmss2[i] = lmss[lmss2[i]];\n\t\t}\n\t\treturn inducedSort(cs, n, numLmss, k, lmss2, isS);\n\t}\n\n\tprivate static int[] inducedSort(int[] cs, int n, int numLmss, int k, int[] lmss, boolean[] isS) {\n\t\tint[] sa = new int[n];\n\t\tint[] bin = new int[k + 1];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tbin[cs[i] + 1]++;\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tbin[i + 1] += bin[i];\n\t\tint[] counts = new int[k];\n\t\tfor (int i = numLmss - 1; i >= 0; i--) { // put LMS backward\n\t\t\tint c = cs[lmss[i]];\n\t\t\tsa[bin[c + 1] - 1 - counts[c]++] = lmss[i];\n\t\t}\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tcounts[i] = 0;\n\t\tfor (int i = 0; i < n; i++) { // put L forward\n\t\t\tint s = sa[i] - 1;\n\t\t\tif (s < 0 || isS[s])\n\t\t\t\tcontinue;\n\t\t\tint c = cs[s];\n\t\t\tsa[bin[c] + counts[c]++] = s;\n\t\t}\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tcounts[i] = 0;\n\t\tfor (int i = n - 1; i >= 0; i--) { // put S backward\n\t\t\tint s = sa[i] - 1;\n\t\t\tif (s < 0 || !isS[s])\n\t\t\t\tcontinue;\n\t\t\tint c = cs[s];\n\t\t\tsa[bin[c + 1] - 1 - counts[c]++] = s;\n\t\t}\n\t\treturn sa;\n\t}\n}\n\nclass ST<A> { // Segment Tree\n\tprivate ArrayList<A> as;\n\tprivate int h;\n\tprivate int n;\n\tprivate F.XXX<A, A, A> merger;\n\tprivate A e;\n\n\tST(int num, F.XXX<A, A, A> merger, A e) {\n\t\tthis.merger = merger;\n\t\tthis.e = e;\n\t\th = 0;\n\t\twhile ((1 << h) < num)\n\t\t\th++;\n\t\tn = 1 << h;\n\t\tas = U.make(2 * n, i -> e);\n\t}\n\n\tvoid init(A a) {\n\t\tinit(i -> a);\n\t}\n\n\tvoid init(A[] as) {\n\t\tinit(i -> i < as.length ? as[i] : e);\n\t}\n\n\tvoid init(F.IX<A> maker) {\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tas.set(n + i, maker.f(i));\n\t\tfor (int i = n - 1; i > 0; i--)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA get(int i) {\n\t\treturn query(i, i + 1);\n\t}\n\n\tvoid set(int i, A a) {\n\t\tas.set(i += n, a);\n\t\twhile ((i >>= 1) > 0)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA query(int l, int r) {\n\t\tl += n;\n\t\tr += n;\n\t\tA al = e;\n\t\tA ar = e;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tal = merge(al, as.get(l++));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tar = merge(as.get(--r), ar);\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t}\n\t\treturn merge(al, ar);\n\t}\n\n\tprivate A merge(A a, A b) {\n\t\treturn a == e ? b : b == e ? a : merger.f(a, b);\n\t}\n}\n\nclass LST<A, Op> { // Lazy Segment Tree\n\tprivate ArrayList<A> as;\n\tprivate ArrayList<Op> lazy;\n\tprivate F.XXX<A, A, A> merger;\n\tprivate F.XXIX<A, Op, A> applier;\n\tprivate F.XXX<Op, Op, Op> opMerger;\n\tprivate A e;\n\tprivate Op id;\n\tprivate int h;\n\tprivate int n;\n\n\tLST(int num, F.XXX<A, A, A> merger, F.XXIX<A, Op, A> applier, F.XXX<Op, Op, Op> opMerger, A e, Op id) {\n\t\tthis.merger = merger;\n\t\tthis.applier = applier;\n\t\tthis.opMerger = opMerger;\n\t\tthis.e = e;\n\t\tthis.id = id;\n\t\th = 0;\n\t\twhile ((1 << h) < num)\n\t\t\th++;\n\t\tn = 1 << h;\n\t\tint size = n << 1;\n\t\tas = U.make(size, i -> e);\n\t\tlazy = U.make(size, i -> id);\n\t}\n\n\tvoid init(A a) {\n\t\tinit(i -> a);\n\t}\n\n\tvoid init(A[] as) {\n\t\tinit(i -> i < as.length ? as[i] : e);\n\t}\n\n\tvoid init(F.IX<A> maker) {\n\t\tfor (int i = 0; i < n << 1; i++)\n\t\t\tlazy.set(i, id);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tas.set(n + i, maker.f(i));\n\t\tfor (int i = n - 1; i > 0; i--)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA get(int i) {\n\t\treturn query(i, i + 1);\n\t}\n\n\tvoid set(int i, A a) {\n\t\tprop(i += n);\n\t\tas.set(i, a);\n\t\tlazy.set(i, id);\n\t\tbackprop(i);\n\t}\n\n\tA query(int l, int r) {\n\t\tprop(l += n);\n\t\tprop(r += n - 1);\n\t\tr++;\n\t\tA al = e;\n\t\tA ar = e;\n\t\tint len = 1;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tal = merge(al, eval(l++, len));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tar = merge(eval(--r, len), ar);\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t\tlen <<= 1;\n\t\t}\n\t\treturn merge(al, ar);\n\t}\n\n\tvoid apply(int l, int r, Op o) {\n\t\tprop(l += n);\n\t\tprop(r += n - 1);\n\t\tint a = l;\n\t\tint b = r;\n\t\tr++;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tlazy.set(l, mergeOp(lazy.get(l++), o));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tlazy.set(--r, mergeOp(lazy.get(r), o));\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t}\n\t\tbackprop(a);\n\t\tbackprop(b);\n\t}\n\n\tint size() {\n\t\treturn n;\n\t}\n\n\tprivate A merge(A a, A b) {\n\t\treturn a == e ? b : b == e ? a : merger.f(a, b);\n\t}\n\n\tprivate Op mergeOp(Op o, Op p) {\n\t\treturn o == id ? p : p == id ? o : opMerger.f(o, p);\n\t}\n\n\tprivate A apply(A a, Op o, int len) {\n\t\treturn o == id ? a : applier.f(a, o, len);\n\t}\n\n\tprivate A eval(int k, int len) {\n\t\treturn apply(as.get(k), lazy.get(k), len);\n\t}\n\n\tprivate void flush(int k, int len) {\n\t\tOp o = lazy.get(k);\n\t\tif (o == id)\n\t\t\treturn;\n\t\tlazy.set(k << 1, mergeOp(lazy.get(k << 1), o));\n\t\tlazy.set(k << 1 | 1, mergeOp(lazy.get(k << 1 | 1), o));\n\t\tas.set(k, apply(as.get(k), o, len));\n\t\tlazy.set(k, id);\n\t}\n\n\tprivate void prop(int k) {\n\t\tfor (int i = h; i > 0; i--)\n\t\t\tflush(k >> i, 1 << i);\n\t}\n\n\tprivate void backprop(int k) {\n\t\tint len = 1;\n\t\twhile ((k >>= 1) > 0) {\n\t\t\tas.set(k, merge(eval(k << 1, len), eval(k << 1 | 1, len)));\n\t\t\tlen <<= 1;\n\t\t}\n\t}\n}\n\ninterface Magma<A> {\n\tA g(A a, A b);\n}\n\ninterface Associative {\n}\n\ninterface Unital<A> {\n\tA e();\n}\n\ninterface Invertible<A> {\n\tA inv(A a);\n}\n\ninterface Commutative {\n}\n\ninterface SemiGroup<A> extends Magma<A>, Associative {\n}\n\ninterface Monoid<A> extends SemiGroup<A>, Unital<A> {\n\tstatic <A> Monoid<A> make(F.XXX<A, A, A> g, A e) {\n\t\treturn new Monoid<A>() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface CommutativeMonoid<A> extends Monoid<A>, Commutative {\n\tstatic <A> CommutativeMonoid<A> make(F.XXX<A, A, A> g, A e) {\n\t\treturn new CommutativeMonoid<A>() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Group<A> extends Monoid<A>, Invertible<A> {\n\tstatic <A> Group<A> make(F.XXX<A, A, A> g, F.XX<A, A> inv, A e) {\n\t\treturn new Group<A>() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\n\t\t\tpublic A inv(A a) {\n\t\t\t\treturn a.equals(e) ? e : inv.f(a);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface AbelianGroup<A> extends Group<A>, CommutativeMonoid<A> {\n\tstatic <A> AbelianGroup<A> make(F.XXX<A, A, A> g, F.XX<A, A> inv, A e) {\n\t\treturn new AbelianGroup<A>() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\n\t\t\tpublic A inv(A a) {\n\t\t\t\treturn a.equals(e) ? e : inv.f(a);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Ring<A> {\n\tAbelianGroup<A> add();\n\n\tMonoid<A> mul();\n\n\tdefault A zero() {\n\t\treturn add().e();\n\t}\n\n\tdefault A one() {\n\t\treturn mul().e();\n\t}\n\n\tstatic <A> Ring<A> make(F.XXX<A, A, A> add, F.XX<A, A> neg, F.XXX<A, A, A> mul, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), Monoid.make(mul, one));\n\t}\n\n\tstatic <A> Ring<A> make(AbelianGroup<A> add, Monoid<A> mul) {\n\t\treturn new Ring<A>() {\n\t\t\tpublic AbelianGroup<A> add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic Monoid<A> mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface CommutativeRing<A> extends Ring<A> {\n\tCommutativeMonoid<A> mul();\n\n\tstatic <A> CommutativeRing<A> make(F.XXX<A, A, A> add, F.XX<A, A> neg, F.XXX<A, A, A> mul, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), CommutativeMonoid.make(mul, one));\n\t}\n\n\tstatic <A> CommutativeRing<A> make(AbelianGroup<A> add, CommutativeMonoid<A> mul) {\n\t\treturn new CommutativeRing<A>() {\n\t\t\tpublic AbelianGroup<A> add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic CommutativeMonoid<A> mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface EuclideanRing<A> extends CommutativeRing<A> {\n\tA div(A a, A b);\n\n\tA mod(A a, A b);\n\n\tstatic <A> EuclideanRing<A> make(F.XXX<A, A, A> add, F.XX<A, A> neg, F.XXX<A, A, A> mul, F.XXX<A, A, A> div,\n\t\t\tF.XXX<A, A, A> mod, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), CommutativeMonoid.make(mul, one), div, mod);\n\t}\n\n\tstatic <A> EuclideanRing<A> make(AbelianGroup<A> add, CommutativeMonoid<A> mul, F.XXX<A, A, A> div,\n\t\t\tF.XXX<A, A, A> mod) {\n\t\tfinal A zero = add.e();\n\t\tfinal A one = mul.e();\n\t\treturn new EuclideanRing<A>() {\n\t\t\tpublic AbelianGroup<A> add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic CommutativeMonoid<A> mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\n\t\t\tpublic A div(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? a : div.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A mod(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? zero : mod.f(a, b);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Field<A> extends EuclideanRing<A> {\n\tAbelianGroup<A> mul();\n\n\tstatic <A> Field<A> make(F.XXX<A, A, A> add, F.XX<A, A> neg, F.XXX<A, A, A> mul, F.XX<A, A> inv, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), AbelianGroup.make(mul, inv, one));\n\t}\n\n\tstatic <A> Field<A> make(AbelianGroup<A> add, AbelianGroup<A> mul) {\n\t\tfinal A zero = add.e();\n\t\tfinal A one = mul.e();\n\t\treturn new Field<A>() {\n\t\t\tpublic AbelianGroup<A> add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic AbelianGroup<A> mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\n\t\t\tpublic A div(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? a : mul.g(a, mul.inv(b));\n\t\t\t}\n\n\t\t\tpublic A mod(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn zero;\n\t\t\t}\n\t\t};\n\t}\n}\n\nfinal class Alg {\n\tprivate Alg() {\n\t}\n\n\tstatic <A extends Comparable<? super A>> A gcd(A a, A b, EuclideanRing<A> ring) {\n\t\tAbelianGroup<A> add = ring.add();\n\t\tA zero = add.e();\n\t\tint sa = a.compareTo(zero);\n\t\tint sb = b.compareTo(zero);\n\t\tif (sa == 0)\n\t\t\treturn b;\n\t\tif (sb == 0)\n\t\t\treturn a;\n\t\tif (sa < 0)\n\t\t\ta = add.inv(a);\n\t\tif (sb < 0)\n\t\t\tb = add.inv(b);\n\t\tif (a.compareTo(b) < 0) {\n\t\t\tA tmp = a;\n\t\t\ta = b;\n\t\t\tb = tmp;\n\t\t}\n\t\twhile (true) {\n\t\t\tA c = ring.mod(a, b);\n\t\t\tif (c.compareTo(zero) == 0)\n\t\t\t\treturn b;\n\t\t\ta = b;\n\t\t\tb = c;\n\t\t}\n\t}\n\n\tstatic long gcd(long a, long b) {\n\t\tif (a == 0)\n\t\t\treturn b;\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\tif (a < 0)\n\t\t\ta = -a;\n\t\tif (b < 0)\n\t\t\tb = -b;\n\t\tif (a < b) {\n\t\t\ta ^= b;\n\t\t\tb ^= a;\n\t\t\ta ^= b;\n\t\t}\n\t\twhile (true) {\n\t\t\tlong c = a % b;\n\t\t\tif (c == 0)\n\t\t\t\treturn b;\n\t\t\ta = b;\n\t\t\tb = c;\n\t\t}\n\t}\n\n\tstatic int gcd(int a, int b) {\n\t\treturn (int) gcd((long) a, (long) b);\n\t}\n\n\tstatic <A extends Comparable<A>> int[] lis(F.IX<A> access, int size) {\n\t\tObject[] dp = new Object[size];\n\t\tint[][] dpIndices = new int[size][2];\n\t\tdp[0] = access.f(0);\n\t\tint len = 1;\n\t\tint lidx = 0;\n\t\tfor (int i = 1; i < size; i++) {\n\t\t\tA ai = access.f(i);\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tint idx = U.searchI(-1, len, j -> ai.compareTo((A) dp[j]) <= 0); // replace <= with < to return NLDS\n\t\t\tdp[idx] = ai;\n\t\t\tdpIndices[idx][0] = i;\n\t\t\tif (idx == len) {\n\t\t\t\tlidx = i;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t\tif (idx > 0)\n\t\t\t\tdpIndices[i][1] = dpIndices[idx - 1][0];\n\t\t}\n\t\tint[] res = new int[len];\n\t\tres[len - 1] = lidx;\n\t\tfor (int i = len - 1; i >= 0; i--) {\n\t\t\tres[i] = lidx;\n\t\t\tlidx = dpIndices[lidx][1];\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic <A> A pow(A a, long b, Monoid<A> monoid) {\n\t\tA res = monoid.e();\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres = monoid.g(res, a);\n\t\t\ta = monoid.g(a, a);\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic <A> A pow(A a, BigInteger b, Monoid<A> monoid) {\n\t\tA res = monoid.e();\n\t\twhile (b.compareTo(BigInteger.ZERO) > 0) {\n\t\t\tif ((b.and(BigInteger.ONE)).intValueExact() != 0)\n\t\t\t\tres = monoid.g(res, a);\n\t\t\ta = monoid.g(a, a);\n\t\t\tb = b.divide(BigInteger.valueOf(2));\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic long pow(long a, long b) {\n\t\tlong res = 1;\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres *= a;\n\t\t\ta *= a;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic <A extends Comparable<? super A>> T<A, A, A> extgcd(A a, A b, EuclideanRing<A> ring) { // returns (x, y, d) s.t. ax + by = d\n\t\tAbelianGroup<A> add = ring.add();\n\t\tCommutativeMonoid<A> mul = ring.mul();\n\t\tA zero = add.e();\n\t\tA one = mul.e();\n\t\tA sa = a.compareTo(zero) < 0 ? add.inv(one) : one;\n\t\tA sb = b.compareTo(zero) < 0 ? add.inv(one) : one;\n\t\ta = mul.g(a, sa);\n\t\tb = mul.g(b, sb);\n\t\tA x = one;\n\t\tA y = zero;\n\t\tA z = zero;\n\t\tA w = one;\n\t\twhile (b.compareTo(zero) > 0) {\n\t\t\tA q = ring.div(a, b);\n\t\t\tA t = z;\n\t\t\tz = add.g(x, add.inv(mul.g(q, z)));\n\t\t\tx = t;\n\t\t\tt = w;\n\t\t\tw = add.g(y, add.inv(mul.g(q, w)));\n\t\t\ty = t;\n\t\t\tt = b;\n\t\t\tb = add.g(a, add.inv(mul.g(q, b)));\n\t\t\ta = t;\n\t\t}\n\t\treturn T.make(mul.g(x, sa), mul.g(y, sb), a);\n\t}\n\n\tstatic TL extgcd(long a, long b) {\n\t\tint sa = a < 0 ? -1 : 1;\n\t\tint sb = b < 0 ? -1 : 1;\n\t\ta *= sa;\n\t\tb *= sb;\n\t\tlong x = 1;\n\t\tlong y = 0;\n\t\tlong z = 0;\n\t\tlong w = 1;\n\t\twhile (b > 0) {\n\t\t\tlong q = a / b;\n\t\t\tlong t = z;\n\t\t\tz = x - q * z;\n\t\t\tx = t;\n\t\t\tt = w;\n\t\t\tw = y - q * w;\n\t\t\ty = t;\n\t\t\tt = b;\n\t\t\tb = a - q * b;\n\t\t\ta = t;\n\t\t}\n\t\treturn TL.make(x * sa, y * sb, a);\n\t}\n\n\tstatic TI extgcd(int a, int b) {\n\t\treturn extgcd((long) a, (long) b).toInt();\n\t}\n\n\tstatic ArrayList<PI> factorize(int n) { // factor, exponent\n\t\tArrayList<PI> res = new ArrayList<PI>();\n\t\tfor (int i = 2; i * i <= n; i++) {\n\t\t\tint count = 0;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tn /= i;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count > 0)\n\t\t\t\tres.add(PI.make(i, count));\n\t\t}\n\t\tif (n > 1)\n\t\t\tres.add(PI.make(n, 1));\n\t\treturn res;\n\t}\n\n\tstatic ArrayList<PL> factorize(long n) { // factor, exponent\n\t\tArrayList<PL> res = new ArrayList<PL>();\n\t\tfor (int i = 2; i * i <= n; i++) {\n\t\t\tint count = 0;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tn /= i;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count > 0)\n\t\t\t\tres.add(PL.make(i, count));\n\t\t}\n\t\tif (n > 1)\n\t\t\tres.add(PL.make(n, 1));\n\t\treturn res;\n\t}\n\n\tstatic <A> A arithSum(A a, A d, long num, Ring<A> ring) {\n\t\treturn arithGeomSum(a, d, ring.one(), ring.one(), num, ring);\n\t}\n\n\tstatic <A> A geomSum(A b, A r, long num, Ring<A> ring) {\n\t\treturn arithGeomSum(ring.one(), ring.zero(), b, r, num, ring);\n\t}\n\n\tstatic <A> A arithGeomSum(A a, A d, A b, A r, long num, Ring<A> ring) { // Σ(a+(i-1)d)br^(i-1)\n\t\tAbelianGroup<A> add = ring.add();\n\t\tMonoid<A> mul = ring.mul();\n\t\tMonoid<MN<A>> matMul = Mat.mulRing(3, ring);\n\t\tA zero = ring.zero();\n\t\tA one = ring.one();\n\t\tMN<A> mat = pow(Mat.make(new Object[][] { { r, d, a }, { zero, r, r }, { zero, zero, one } }), num - 1, matMul);\n\t\treturn mul.g(add.g(add.g(mul.g(mat.at(0, 0), a), mul.g(mat.at(0, 1), r)), mat.at(0, 2)), b);\n\t}\n}\n\nclass MN<A> {\n\tfinal int m;\n\tfinal int n;\n\tprivate final Object[][] as;\n\n\tstatic class Scalar<A> extends MN<A> {\n\t\tfinal long l;\n\t\tA a;\n\n\t\tScalar(int m, int n, long l, A zero, A oneTimesL) {\n\t\t\tsuper(m, n, (i, j) -> i == j ? oneTimesL : zero);\n\t\t\tthis.a = oneTimesL;\n\t\t\tthis.l = l;\n\t\t}\n\t}\n\n\tMN(int m, int n, Mat.Accessor<A> accessor) {\n\t\tthis.m = m;\n\t\tthis.n = n;\n\t\tas = new Object[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tas[i][j] = accessor.at(i, j);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic String toString() {\n\t\tString s = \"\";\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\ts += i == 0 ? \"[[ \" : \" [ \";\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\ts += (j == 0 ? \"\" : \", \") + as[i][j];\n\t\t\t}\n\t\t\ts += i == m - 1 ? \" ]]\" : \" ]\\n\";\n\t\t}\n\t\treturn s;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA at(int i, int j) {\n\t\treturn (A) as[i][j];\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA[][] toArray() {\n\t\tA[][] res = (A[][]) Array.newInstance(as[0][0].getClass(), m, n);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (A) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tint[][] toIntArray() {\n\t\tint[][] res = new int[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (int) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tlong[][] toLongArray() {\n\t\tlong[][] res = new long[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (long) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tdouble[][] toDoubleArray() {\n\t\tdouble[][] res = new double[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (double) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n}\n\nclass Mat<A> {\n\tinterface Accessor<A> {\n\t\tA at(int i, int j);\n\t}\n\n\tprivate static <A> MN.Scalar<A> make(int m, int n, long l, A zero, A oneTimesL) {\n\t\treturn new MN.Scalar<A>(m, n, l, zero, oneTimesL);\n\t}\n\n\tstatic <A> MN<A> make(int m, int n, Accessor<A> accessor) {\n\t\treturn new MN<A>(m, n, accessor);\n\t}\n\n\tstatic <A> MN<A> make(int m, int n, A[][] as) {\n\t\treturn new MN<A>(m, n, (i, j) -> as[i][j]);\n\t}\n\n\tstatic MN<Long> make(int[][] as) {\n\t\treturn new MN<Long>(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> (long) as[i][j]);\n\t}\n\n\tstatic MN<Long> make(long[][] as) {\n\t\treturn new MN<Long>(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> as[i][j]);\n\t}\n\n\tstatic MN<Double> make(double[][] as) {\n\t\treturn new MN<Double>(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> as[i][j]);\n\t}\n\n\tstatic <A> MN<A> make(int[][] as, F.IX<A> toA) {\n\t\treturn new MN<A>(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic <A> MN<A> make(long[][] as, F.LX<A> toA) {\n\t\treturn new MN<A>(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic <A> MN<A> make(double[][] as, F.DX<A> toA) {\n\t\treturn new MN<A>(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic <A, B> MN<A> make(B[][] as, F.XX<B, A> toA) {\n\t\treturn new MN<A>(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tstatic <A> MN<A> make(Object[][] as) {\n\t\treturn new MN<A>(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> (A) as[i][j]);\n\t}\n\n\tstatic <A> MN<A> eye(int n, Ring<A> ring) {\n\t\treturn make(n, n, (i, j) -> i == j ? ring.mul().e() : ring.add().e());\n\t}\n\n\tstatic <A> AbelianGroup<MN<A>> add(int m, int n, Ring<A> ring) {\n\t\treturn AbelianGroup.make((a, b) -> add(a, b, ring), a -> neg(a, ring), make(m, n, 0, ring.zero(), ring.zero()));\n\t}\n\n\tstatic <A> Monoid<MN<A>> mulRing(int n, Ring<A> ring) {\n\t\treturn Monoid.make((a, b) -> mul(a, b, ring), make(n, n, 1, ring.zero(), ring.one()));\n\t}\n\n\tstatic <A> AbelianGroup<MN<A>> mulField(int n, Field<A> field) {\n\t\treturn AbelianGroup.make((a, b) -> mul(a, b, field), a -> inv(a, field),\n\t\t\t\tmake(n, n, 1, field.zero(), field.one()));\n\t}\n\n\tstatic <A> MN<A> add(MN<A> a, MN<A> b, Ring<A> ring) {\n\t\tint m = U.max(a.m, b.m);\n\t\tint n = U.max(a.n, b.n);\n\t\tAbelianGroup<A> add = ring.add();\n\t\tif (a instanceof MN.Scalar && b instanceof MN.Scalar) {\n\t\t\tMN.Scalar<A> as = ((MN.Scalar<A>) a);\n\t\t\tMN.Scalar<A> bs = ((MN.Scalar<A>) b);\n\t\t\treturn make(m, n, as.l + bs.l, ring.zero(), add.g(as.a, bs.a));\n\t\t}\n\t\treturn make(m, n, (i, j) -> add.g(a.at(i, j), b.at(i, j)));\n\t}\n\n\tstatic <A> MN<A> neg(MN<A> a, Ring<A> ring) {\n\t\tif (a instanceof MN.Scalar) {\n\t\t\tMN.Scalar<A> as = ((MN.Scalar<A>) a);\n\t\t\treturn make(a.m, a.n, -as.l, ring.zero(), ring.add().inv(as.a));\n\t\t}\n\t\treturn make(a.m, a.n, (i, j) -> ring.add().inv(a.at(i, j)));\n\t}\n\n\tstatic <A> MN<A> mul(MN<A> a, MN<A> b, Ring<A> ring) {\n\t\tint m = a.m;\n\t\tint u = U.max(a.n, b.m);\n\t\tint n = b.n;\n\t\tAbelianGroup<A> add = ring.add();\n\t\tMonoid<A> mul = ring.mul();\n\t\tif (a instanceof MN.Scalar && b instanceof MN.Scalar) {\n\t\t\tMN.Scalar<A> as = ((MN.Scalar<A>) a);\n\t\t\tMN.Scalar<A> bs = ((MN.Scalar<A>) b);\n\t\t\treturn make(m, n, as.l * bs.l, ring.zero(), mul.g(as.a, bs.a));\n\t\t}\n\t\treturn make(m, n, (i, j) -> {\n\t\t\tA res = ring.zero();\n\t\t\tfor (int k = 0; k < u; k++)\n\t\t\t\tres = add.g(res, mul.g(a.at(i, k), b.at(k, j)));\n\t\t\treturn res;\n\t\t});\n\t}\n\n\tstatic <A> A det(MN<A> a, Field<A> field) {\n\t\treturn detInv(a, field).a;\n\t}\n\n\tstatic <A> MN<A> inv(MN<A> a, Field<A> field) {\n\t\tUP<A, MN<A>> detInv = detInv(a, field);\n\t\tif (detInv.a.equals(field.zero()))\n\t\t\tthrow new ArithmeticException(\"inverse does not exist: det=0\");\n\t\treturn detInv.b;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate static <A> UP<A, MN<A>> detInv(MN<A> a, Field<A> field) {\n\t\tif (a.m != a.n)\n\t\t\tthrow new IllegalArgumentException(\"matrix not square\");\n\t\tif (field.zero() instanceof Long) {\n\t\t\tUP<Long, MN<Long>> detInv = detInvLong((MN<Long>) a, (Field<Long>) field);\n\t\t\treturn UP.make((A) detInv.a, (MN<A>) detInv.b);\n\t\t}\n\t\tint n = a.n;\n\t\tAbelianGroup<A> add = field.add();\n\t\tAbelianGroup<A> mul = field.mul();\n\t\tA zero = field.zero();\n\t\tA one = field.one();\n\t\tA[][] m1 = a.toArray();\n\t\tA[][] m2 = eye(n, field).toArray();\n\t\tA res = one;\n\t\tint sign = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint pivot = -1;\n\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\tif (!m1[j][i].equals(zero)) {\n\t\t\t\t\tpivot = j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pivot == -1) {\n\t\t\t\treturn UP.make(zero, null);\n\t\t\t}\n\t\t\tif (pivot != i) {\n\t\t\t\tsign = -sign;\n\t\t\t\tA tmp;\n\t\t\t\tfor (int j = i; j < n; j++) { // [0, i) are zero\n\t\t\t\t\ttmp = m1[i][j];\n\t\t\t\t\tm1[i][j] = m1[pivot][j];\n\t\t\t\t\tm1[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\ttmp = m2[i][j];\n\t\t\t\t\tm2[i][j] = m2[pivot][j];\n\t\t\t\t\tm2[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tA d = m1[i][i];\n\t\t\tres = mul.g(res, d);\n\t\t\td = mul.inv(d);\n\t\t\tm1[i][i] = one;\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tm1[i][j] = mul.g(m1[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tm2[i][j] = mul.g(m2[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (i == j)\n\t\t\t\t\tcontinue;\n\t\t\t\tA mult = m1[j][i];\n\t\t\t\tm1[j][i] = zero;\n\t\t\t\tfor (int k = i + 1; k < n; k++) {\n\t\t\t\t\tm1[j][k] = add.g(m1[j][k], add.inv(mul.g(m1[i][k], mult)));\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tm2[j][k] = add.g(m2[j][k], add.inv(mul.g(m2[i][k], mult)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn UP.make(sign == 1 ? res : add.inv(res), make(m2));\n\t}\n\n\tprivate static UP<Long, MN<Long>> detInvLong(MN<Long> a, Field<Long> field) {\n\t\tif (a.m != a.n)\n\t\t\tthrow new IllegalArgumentException(\"matrix not square\");\n\t\tint n = a.n;\n\t\tAbelianGroup<Long> add = field.add();\n\t\tAbelianGroup<Long> mul = field.mul();\n\t\tlong zero = field.zero();\n\t\tlong one = field.one();\n\t\tlong[][] m1 = a.toLongArray();\n\t\tlong[][] m2 = eye(n, field).toLongArray();\n\t\tlong res = one;\n\t\tint sign = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint pivot = -1;\n\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\tif (m1[j][i] != zero) {\n\t\t\t\t\tpivot = j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pivot == -1) {\n\t\t\t\treturn UP.make(zero, null);\n\t\t\t}\n\t\t\tif (pivot != i) {\n\t\t\t\tsign = -sign;\n\t\t\t\tlong tmp;\n\t\t\t\tfor (int j = i; j < n; j++) { // [0, i) are zero\n\t\t\t\t\ttmp = m1[i][j];\n\t\t\t\t\tm1[i][j] = m1[pivot][j];\n\t\t\t\t\tm1[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\ttmp = m2[i][j];\n\t\t\t\t\tm2[i][j] = m2[pivot][j];\n\t\t\t\t\tm2[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong d = m1[i][i];\n\t\t\tres = mul.g(res, d);\n\t\t\td = mul.inv(d);\n\t\t\tm1[i][i] = one;\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tm1[i][j] = mul.g(m1[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tm2[i][j] = mul.g(m2[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (i == j)\n\t\t\t\t\tcontinue;\n\t\t\t\tlong mult = m1[j][i];\n\t\t\t\tm1[j][i] = zero;\n\t\t\t\tfor (int k = i + 1; k < n; k++) {\n\t\t\t\t\tm1[j][k] = add.g(m1[j][k], add.inv(mul.g(m1[i][k], mult)));\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tm2[j][k] = add.g(m2[j][k], add.inv(mul.g(m2[i][k], mult)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn UP.make(sign == 1 ? res : add.inv(res), make(m2));\n\t}\n\n\tstatic <A> Ring<MN<A>> ring(int n, Ring<A> ring) {\n\t\treturn Ring.make(add(n, n, ring), mulRing(n, ring));\n\t}\n\n\tstatic <A> Field<MN<A>> field(int n, Field<A> field) {\n\t\treturn Field.make(add(n, n, field), mulField(n, field));\n\t}\n\n\tstatic <A> VM<MN<A>> vm(int n, Ring<A> ring) {\n\t\tif (ring instanceof Field)\n\t\t\treturn vmField(n, (Field<A>) ring);\n\t\treturn vmRing(n, ring);\n\t}\n\n\tprivate static <A> VM<MN<A>> vmRing(int n, Ring<A> ring) {\n\t\tRing<MN<A>> matRing = ring(n, ring);\n\t\tMonoid<MN<A>> matMul = matRing.mul();\n\t\tAbelianGroup<A> add = ring.add();\n\t\tMonoid<A> mul = ring.mul();\n\t\tA zero = add.e();\n\t\tA one = mul.e();\n\t\treturn new VM<MN<A>>(matRing, null, null, (a, b) -> {\n\t\t\tif (b instanceof MN.Scalar) {\n\t\t\t\tMN.Scalar<A> bs = ((MN.Scalar<A>) b);\n\t\t\t\tif (bs.l < 0)\n\t\t\t\t\tthrow new RuntimeException(\"pow(MN, <0) is not defined\");\n\t\t\t\treturn Alg.pow(a, bs.l, matMul);\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"pow(MN, MN) is not defined\");\n\t\t}, null, l -> make(n, n, l, zero, Alg.pow(one, l, add)), a -> a);\n\t}\n\n\tprivate static <A> VM<MN<A>> vmField(int n, Field<A> field) {\n\t\tField<MN<A>> matField = field(n, field);\n\t\tAbelianGroup<MN<A>> matMul = matField.mul();\n\t\tA zero = field.zero();\n\t\tA one = field.one();\n\t\treturn new VM<MN<A>>(matField, (a, b) -> {\n\t\t\tif (b instanceof MN.Scalar) {\n\t\t\t\tMN.Scalar<A> bs = ((MN.Scalar<A>) b);\n\t\t\t\tif (bs.l < 0)\n\t\t\t\t\treturn Alg.pow(inv(a, field), -bs.l, matMul);\n\t\t\t\treturn Alg.pow(a, bs.l, matMul);\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"pow(MN, MN) is not defined\");\n\t\t}, a -> inv(a, field), l -> make(n, n, l, zero, Alg.pow(one, l, field.add())), a -> a);\n\t}\n}\n\nclass VM<A> {\n\tprivate final HashMap<String, A> env;\n\tprivate final Evaluator<A> etor;\n\tprivate final F.XX<A, A> filter;\n\n\tVM(F.XXX<A, A, A> add, F.XXX<A, A, A> sub, F.XXX<A, A, A> mul, F.XXX<A, A, A> div, F.XXX<A, A, A> mod,\n\t\t\tF.XXX<A, A, A> pow, F.XX<A, A> neg, F.XX<A, A> fact, F.LX<A> fromInt, F.XX<A, A> filter) {\n\t\tenv = new HashMap<String, A>();\n\t\tetor = SimpleLang.makeEvaluator((s, a) -> {\n\t\t\tenv.put(s, a);\n\t\t\treturn a;\n\t\t}, add, sub, mul, div, mod, pow, neg, fact, fromInt, s -> {\n\t\t\tif (env.containsKey(s))\n\t\t\t\treturn env.get(s);\n\t\t\tthrow new RuntimeException(\"no such variable: \" + s);\n\t\t});\n\t\tthis.filter = filter;\n\t}\n\n\tVM(Ring<A> ring, F.XXX<A, A, A> div, F.XXX<A, A, A> mod, F.XXX<A, A, A> pow, F.XX<A, A> fact, F.LX<A> fromInt,\n\t\t\tF.XX<A, A> filter) {\n\t\tthis(ring.add()::g, (a, b) -> ring.add().g(a, ring.add().inv(b)), ring.mul()::g, div, mod, pow, ring.add()::inv,\n\t\t\t\tfact, fromInt, filter);\n\t}\n\n\tVM(EuclideanRing<A> ring, F.XXX<A, A, A> pow, F.XX<A, A> fact, F.LX<A> fromInt, F.XX<A, A> filter) {\n\t\tthis(ring, ring::div, ring::mod, pow, fact, fromInt, filter);\n\t}\n\n\tvoid clear() {\n\t\tenv.clear();\n\t}\n\n\tA get(String id) {\n\t\treturn env.get(id);\n\t}\n\n\tvoid print(String id, F.XV<String> printer) {\n\t\tprinter.f(\"\" + get(id));\n\t}\n\n\t@SafeVarargs\n\tfinal void set(String idsSp, A... as) {\n\t\tString[] ids = idsSp.trim().split(\" +\");\n\t\tint n = ids.length;\n\t\tif (as.length != n)\n\t\t\tthrow new IllegalArgumentException(\"argument size mismatch: \" + n + \" != \" + as.length);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tset(ids[i], as[i]);\n\t}\n\n\tvoid set(String id, A a) {\n\t\tenv.put(id, filter.f(a));\n\t}\n\n\tA run(String expr) {\n\t\treturn AST.eval(SimpleLang.parse(expr), etor);\n\t}\n}\n\nclass AST { // Abstract Syntax Tree\n\tstatic class AssignOp extends AST {\n\t\tString id;\n\t\tAST r;\n\n\t\tAssignOp(String id, AST r) {\n\t\t\tthis.id = id;\n\t\t\tthis.r = r;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Assign(\" + id + \", \" + r + \")\";\n\t\t}\n\t}\n\n\tstatic class Multi extends AST {\n\t\tArrayList<AST> as;\n\n\t\tMulti(ArrayList<AST> as) {\n\t\t\tthis.as = as;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\tString s = \"\";\n\t\t\tfor (AST a : as)\n\t\t\t\ts += s.isEmpty() ? a : \"; \" + a;\n\t\t\treturn \"Multi(\" + s + \")\";\n\t\t}\n\t}\n\n\tstatic class BinOp extends AST {\n\t\tAST l;\n\t\tAST r;\n\t\tString op;\n\n\t\tBinOp(AST l, String op, AST r) {\n\t\t\tthis.l = l;\n\t\t\tthis.op = op;\n\t\t\tthis.r = r;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"BinOp(\" + l + \", \" + op + \", \" + r + \")\";\n\t\t}\n\t}\n\n\tstatic class UnOp extends AST {\n\t\tAST a;\n\t\tString op;\n\n\t\tUnOp(String op, AST a) {\n\t\t\tthis.op = op;\n\t\t\tthis.a = a;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"UnOp(\" + op + \", \" + a + \")\";\n\t\t}\n\t}\n\n\tstatic class Int extends AST {\n\t\tlong v;\n\n\t\tInt(long v) {\n\t\t\tthis.v = v;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Int(\" + v + \")\";\n\t\t}\n\t}\n\n\tstatic class Id extends AST {\n\t\tString s;\n\n\t\tId(String s) {\n\t\t\tthis.s = s;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Id(\" + s + \")\";\n\t\t}\n\t}\n\n\tstatic <A> A eval(AST a, Evaluator<A> etor) {\n\t\tif (a instanceof AssignOp)\n\t\t\treturn etor.assign(((AssignOp) a).id, eval(((AssignOp) a).r, etor));\n\t\tif (a instanceof Multi) {\n\t\t\tA last = null;\n\t\t\tfor (AST a2 : ((Multi) a).as)\n\t\t\t\tlast = eval(a2, etor);\n\t\t\treturn last;\n\t\t}\n\t\tif (a instanceof BinOp)\n\t\t\treturn etor.binOp(((BinOp) a).op, eval(((BinOp) a).l, etor), eval(((BinOp) a).r, etor));\n\t\tif (a instanceof UnOp)\n\t\t\treturn etor.unOp(((UnOp) a).op, eval(((UnOp) a).a, etor));\n\t\tif (a instanceof Int)\n\t\t\treturn etor.fromInt(((Int) a).v);\n\t\tif (a instanceof Id)\n\t\t\treturn etor.id(((Id) a).s);\n\t\tthrow new RuntimeException(\"unexpected ast: \" + a);\n\t}\n}\n\ninterface Evaluator<A> {\n\tA assign(String s, A a);\n\n\tA binOp(String op, A a, A b);\n\n\tA unOp(String op, A a);\n\n\tA fromInt(long a);\n\n\tA id(String s);\n}\n\nclass Seq<A> {\n\tArrayList<A> as;\n\tint ptr;\n\n\tSeq(ArrayList<A> as) {\n\t\tthis.as = as;\n\t\tptr = 0;\n\t}\n\n\tboolean hasNext(int num) {\n\t\treturn ptr + num < as.size();\n\t}\n\n\tboolean hasNext() {\n\t\treturn hasNext(0);\n\t}\n\n\tA next(int num) {\n\t\treturn ptr + num < as.size() ? as.get(ptr + num) : null;\n\t}\n\n\tA next() {\n\t\treturn next(0);\n\t}\n\n\tA read() {\n\t\treturn hasNext() ? as.get(ptr++) : null;\n\t}\n\n\tA read(A a) {\n\t\tif (!hasNext())\n\t\t\tthrow new RuntimeException(\"unexpected EOF\");\n\t\tif (!isNext(a))\n\t\t\tthrow new RuntimeException(\"expected \" + a + \" but got\" + next());\n\t\treturn read();\n\t}\n\n\tA read(F.XX<A, Boolean> f) {\n\t\tif (!hasNext())\n\t\t\tthrow new RuntimeException(\"unexpected EOF\");\n\t\tif (!f.f(next()))\n\t\t\tthrow new RuntimeException(\"f(\" + next() + \") returned false\");\n\t\treturn read();\n\t}\n\n\tboolean isNext(A a) {\n\t\treturn a.equals(next());\n\t}\n\n\tboolean isNext(@SuppressWarnings(\"unchecked\") A... as) {\n\t\tfor (A a : as)\n\t\t\tif (isNext(a))\n\t\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tboolean isNext(F.XX<A, Boolean> f) {\n\t\treturn hasNext() && f.f(next());\n\t}\n\n\tA readIf(F.XX<A, Boolean> f) {\n\t\tif (isNext(f))\n\t\t\treturn read();\n\t\treturn null;\n\t}\n\n\tA readIf(@SuppressWarnings(\"unchecked\") A... as) {\n\t\tfor (A a : as)\n\t\t\tif (isNext(a)) {\n\t\t\t\tptr++;\n\t\t\t\treturn a;\n\t\t\t}\n\t\treturn null;\n\t}\n\n\tpublic String toString() {\n\t\treturn as.toString();\n\t}\n}\n\nclass Token extends P<String, Integer> {\n\tprivate static final int ID = 1;\n\tprivate static final int SYM = 2;\n\tprivate static final int INT = 3;\n\n\tToken(String s, int type) {\n\t\tsuper(s, type);\n\t}\n\n\tboolean is(String s) {\n\t\treturn a.equals(s);\n\t}\n\n\tstatic Token ofId(String s) {\n\t\treturn new Token(s, ID);\n\t}\n\n\tstatic Token ofSym(String s) {\n\t\treturn new Token(s, SYM);\n\t}\n\n\tstatic Token ofInt(String s) {\n\t\treturn new Token(s, INT);\n\t}\n\n\tboolean isId() {\n\t\treturn b == ID;\n\t}\n\n\tboolean isSym() {\n\t\treturn b == SYM;\n\t}\n\n\tboolean isInt() {\n\t\treturn b == INT;\n\t}\n}\n\nclass SimpleLang {\n\tprivate static class Tokenizer {\n\t\tprivate static final String SYMS = \"+-*/%^!()=;\";\n\n\t\tSeq<Character> sc;\n\t\tArrayList<Token> ts;\n\n\t\tTokenizer(String s) {\n\t\t\tsc = new Seq<Character>(U.make(s.length(), i -> s.charAt(i)));\n\t\t}\n\n\t\tSeq<Token> parse() {\n\t\t\tts = new ArrayList<Token>();\n\t\t\tparseAll();\n\t\t\treturn new Seq<Token>(ts);\n\t\t}\n\n\t\tprivate static boolean isSpace(char c) {\n\t\t\treturn c == ' ' || c == '\\t' || c == '\\r' || c == '\\n';\n\t\t}\n\n\t\tprivate static boolean isDigit(char c) {\n\t\t\treturn c >= '0' && c <= '9';\n\t\t}\n\n\t\tprivate static boolean isSymbol(char c) {\n\t\t\treturn SYMS.indexOf(c) != -1;\n\t\t}\n\n\t\tprivate static boolean isAlpha(char c) {\n\t\t\treturn c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z' || c == '_';\n\t\t}\n\n\t\tprivate void parseAll() {\n\t\t\twhile (sc.hasNext()) {\n\t\t\t\twhile (sc.isNext(Tokenizer::isSpace))\n\t\t\t\t\tsc.read();\n\t\t\t\tif (!sc.hasNext())\n\t\t\t\t\tbreak;\n\t\t\t\tif (sc.isNext(Tokenizer::isAlpha)) {\n\t\t\t\t\tparseId();\n\t\t\t\t} else if (sc.isNext(Tokenizer::isDigit)) {\n\t\t\t\t\tparseInt();\n\t\t\t\t} else if (sc.isNext(Tokenizer::isSymbol)) {\n\t\t\t\t\tparseSym();\n\t\t\t\t} else {\n\t\t\t\t\tthrow new RuntimeException(\"invalid character: \" + sc.next());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprivate void parseId() {\n\t\t\tString s = sc.read().toString();\n\t\t\twhile (sc.isNext(Tokenizer::isAlpha) || sc.isNext(Tokenizer::isDigit))\n\t\t\t\ts += sc.read().toString();\n\t\t\tts.add(Token.ofId(s));\n\t\t}\n\n\t\tprivate void parseInt() {\n\t\t\tString s = sc.read().toString();\n\t\t\twhile (sc.isNext(Tokenizer::isDigit))\n\t\t\t\ts += sc.read().toString();\n\t\t\tts.add(Token.ofInt(s));\n\t\t}\n\n\t\tprivate void parseSym() {\n\t\t\tString s = sc.read().toString();\n\t\t\tts.add(Token.ofSym(s));\n\t\t}\n\t}\n\n\tprivate static class Parser {\n\t\tSeq<Token> ts;\n\n\t\tParser(Seq<Token> ts) {\n\t\t\tthis.ts = ts;\n\t\t}\n\n\t\tAST parse() {\n\t\t\treturn parseExpr();\n\t\t}\n\n\t\tprivate AST parseExpr() {\n\t\t\treturn parseMultiExpr();\n\t\t}\n\n\t\tprivate AST parseMultiExpr() {\n\t\t\treadSemicolons();\n\t\t\tAST a = parseAssignExpr();\n\t\t\tif (readSemicolons()) {\n\t\t\t\tArrayList<AST> as = new ArrayList<AST>();\n\t\t\t\tas.add(a);\n\t\t\t\tdo {\n\t\t\t\t\tif (!ts.hasNext())\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tas.add(parseAssignExpr());\n\t\t\t\t} while (readSemicolons());\n\t\t\t\tif (as.size() == 1)\n\t\t\t\t\treturn a;\n\t\t\t\treturn new AST.Multi(as);\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate boolean readSemicolons() {\n\t\t\tif (!ts.isNext(t -> t.is(\";\")))\n\t\t\t\treturn false;\n\t\t\tdo {\n\t\t\t\tts.read();\n\t\t\t} while (ts.isNext(t -> t.is(\";\")));\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate AST parseAssignExpr() {\n\t\t\tAST a = parseAddSubOp();\n\t\t\tif (ts.isNext(t -> t.is(\"=\"))) {\n\t\t\t\tts.read();\n\t\t\t\tif (!(a instanceof AST.Id))\n\t\t\t\t\tthrow new RuntimeException(\"cannot assign to \" + a);\n\t\t\t\treturn new AST.AssignOp(((AST.Id) a).s, parseAssignExpr());\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseAddSubOp() {\n\t\t\tAST a = parseMulDivModOp();\n\t\t\twhile (ts.isNext(t -> t.is(\"+\") || t.is(\"-\")))\n\t\t\t\ta = new AST.BinOp(a, ts.read().a, parseMulDivModOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseMulDivModOp() {\n\t\t\tAST a = parsePowOp();\n\t\t\twhile (ts.isNext(t -> t.is(\"*\") || t.is(\"/\") || t.is(\"%\")))\n\t\t\t\ta = new AST.BinOp(a, ts.read().a, parsePowOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parsePowOp() {\n\t\t\tAST a = parseNegateOp();\n\t\t\tif (ts.isNext(t -> t.is(\"^\")))\n\t\t\t\treturn new AST.BinOp(a, ts.read().a, parsePowOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseNegateOp() {\n\t\t\tif (ts.isNext(t -> t.is(\"-\")))\n\t\t\t\treturn new AST.UnOp(ts.read().a, parseNegateOp());\n\t\t\treturn parseFactOp();\n\t\t}\n\n\t\tprivate AST parseFactOp() {\n\t\t\tAST a = parsePrimary();\n\t\t\twhile (ts.isNext(t -> t.is(\"!\")))\n\t\t\t\ta = new AST.UnOp(ts.read().a, a);\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parsePrimary() {\n\t\t\tif (ts.isNext(t -> t.isId()))\n\t\t\t\treturn new AST.Id(ts.read().a);\n\t\t\tif (ts.isNext(t -> t.isInt()))\n\t\t\t\treturn new AST.Int(Long.parseLong(ts.read().a));\n\t\t\tif (ts.readIf(t -> t.is(\"(\")) != null) {\n\t\t\t\tAST e = parseExpr();\n\t\t\t\tts.read(t -> t.is(\")\"));\n\t\t\t\treturn e;\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"unexpected token: \" + ts.next());\n\t\t}\n\t}\n\n\tstatic HashMap<String, AST> cache = new HashMap<String, AST>();\n\n\tstatic <A> Evaluator<A> makeEvaluator(F.XXX<String, A, A> assign, F.XXX<A, A, A> add, F.XXX<A, A, A> sub,\n\t\t\tF.XXX<A, A, A> mul, F.XXX<A, A, A> div, F.XXX<A, A, A> mod, F.XXX<A, A, A> pow, F.XX<A, A> neg,\n\t\t\tF.XX<A, A> fact, F.LX<A> fromInt, F.XX<String, A> id) {\n\t\treturn new Evaluator<A>() {\n\t\t\tpublic A assign(String s, A a) {\n\t\t\t\treturn assign.f(s, a);\n\t\t\t}\n\n\t\t\tpublic A binOp(String op, A a, A b) {\n\t\t\t\tswitch (op) {\n\t\t\t\tcase \"+\":\n\t\t\t\t\treturn add.f(a, b);\n\t\t\t\tcase \"-\":\n\t\t\t\t\treturn sub.f(a, b);\n\t\t\t\tcase \"*\":\n\t\t\t\t\treturn mul.f(a, b);\n\t\t\t\tcase \"/\":\n\t\t\t\t\treturn div.f(a, b);\n\t\t\t\tcase \"%\":\n\t\t\t\t\treturn mod.f(a, b);\n\t\t\t\tcase \"^\":\n\t\t\t\t\treturn pow.f(a, b);\n\t\t\t\t}\n\t\t\t\tthrow new RuntimeException(\"invalid binOp: \" + op);\n\t\t\t}\n\n\t\t\tpublic A unOp(String op, A a) {\n\t\t\t\tswitch (op) {\n\t\t\t\tcase \"-\":\n\t\t\t\t\treturn neg.f(a);\n\t\t\t\tcase \"!\":\n\t\t\t\t\treturn fact.f(a);\n\t\t\t\t}\n\t\t\t\tthrow new RuntimeException(\"invalid unOp: \" + op);\n\t\t\t}\n\n\t\t\tpublic A fromInt(long a) {\n\t\t\t\treturn fromInt.f(a);\n\t\t\t}\n\n\t\t\tpublic A id(String s) {\n\t\t\t\treturn id.f(s);\n\t\t\t}\n\t\t};\n\t}\n\n\tstatic AST parse(String s) {\n\t\tif (cache.containsKey(cache)) {\n\t\t\treturn cache.get(s);\n\t\t}\n\t\tTokenizer l = new Tokenizer(s);\n\t\tSeq<Token> ts = l.parse();\n\t\tParser p = new Parser(ts);\n\t\tAST a = p.parse();\n\t\tcache.put(s, a);\n\t\treturn a;\n\t}\n}\n\nclass Mod {\n\tfinal long mod;\n\tfinal AbelianGroup<Long> add;\n\tfinal AbelianGroup<Long> mul;\n\tfinal Field<Long> field;\n\tfinal VM<Long> vm;\n\tprivate final boolean prime;\n\tprivate final HashMap<Long, Integer> logMap;\n\tprivate long[] facts;\n\tprivate long[] invs;\n\tprivate long[] invFacts;\n\tprivate long[] factors;\n\n\tMod(long mod) {\n\t\tthis.mod = mod;\n\t\tprepareFacts(0);\n\t\tprime = BigInteger.valueOf(mod).isProbablePrime(100);\n\t\tadd = AbelianGroup.make((a, b) -> (a + b) % mod, a -> mod - a, 0l);\n\t\tmul = AbelianGroup.make((a, b) -> (a * b) % mod, a -> {\n\t\t\tif (prime)\n\t\t\t\treturn pow(a, mod - 2);\n\t\t\tTL t = Alg.extgcd(a, mod);\n\t\t\tif (t.c != 1)\n\t\t\t\tthrow new ArithmeticException(\"inv(\" + a + \") does not exist\");\n\t\t\treturn (t.a % mod + mod) % mod;\n\t\t}, 1l);\n\t\tfield = Field.make(add, mul);\n\t\tlogMap = new HashMap<Long, Integer>();\n\t\tvm = new VM<Long>(field, this::pow, this::fact, a -> (a % mod + mod) % mod, a -> (a % mod + mod) % mod);\n\t}\n\n\tlong fact(long a) {\n\t\tif (a >= Integer.MAX_VALUE)\n\t\t\tthrow new RuntimeException(\"fact(\" + a + \") too big\");\n\t\tprepareFacts((int) a);\n\t\treturn facts[(int) (a % mod)];\n\t}\n\n\tlong invFact(int a) {\n\t\tprepareFacts(a);\n\t\treturn invFacts[(int) (a % mod)];\n\t}\n\n\tlong inv(long a) {\n\t\treturn mul.inv(a);\n\t}\n\n\tlong pow(long a, long b) {\n\t\tif (b == 0)\n\t\t\treturn 1;\n\t\tif (b == 1)\n\t\t\treturn a;\n\t\tif (b < 0) {\n\t\t\ta = inv(a);\n\t\t\tb = -b;\n\t\t}\n\t\ta %= mod;\n\t\tlong res = 1;\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres = res * a % mod;\n\t\t\ta = a * a % mod;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tlong order(long a) { // computes the order of `a` in O(sqrt(mod)) time\n\t\ta %= mod;\n\t\tif (a == 0)\n\t\t\treturn 0;\n\t\tif (a == 1)\n\t\t\treturn 1;\n\t\tif (factors == null) {\n\t\t\tArrayList<Long> fs = new ArrayList<Long>();\n\t\t\tfor (long i = 2; i * i < mod; i++) {\n\t\t\t\tif ((mod - 1) % i == 0)\n\t\t\t\t\tfs.add(i);\n\t\t\t}\n\t\t\tfactors = new long[fs.size()];\n\t\t\tfor (int i = 0; i < fs.size(); i++) {\n\t\t\t\tfactors[i] = fs.get(i);\n\t\t\t}\n\t\t}\n\t\tfor (long f : factors) {\n\t\t\tif (pow(a, f) == 1)\n\t\t\t\treturn f;\n\t\t}\n\t\treturn mod - 1;\n\t}\n\n\tPL log(long a, long b) { // log_b(a) in O(sqrt(mod)) time\n\t\ta %= mod;\n\t\tb %= mod;\n\t\tif (b == 1 || b == 0)\n\t\t\treturn a == b ? PL.make(1, 1) : PL.make(-1, 0);\n\t\tif (a == 0)\n\t\t\treturn PL.make(-1, 0);\n\t\tlong order = order(b);\n\t\tif (a == 1)\n\t\t\treturn PL.make(0, order);\n\t\tlong orderSqrtL = sqrtCeil(order);\n\t\tif (orderSqrtL > Integer.MAX_VALUE)\n\t\t\tthrow new RuntimeException(\"order(\" + b + \") too big: \" + order);\n\t\tint orderSqrt = (int) sqrtCeil(order);\n\t\tlogMap.clear();\n\t\tlogMap.put(1l, 0);\n\t\tlong p = 1;\n\t\tfor (int i = 1; i < orderSqrt; i++) {\n\t\t\tp = p * b % mod;\n\t\t\tlogMap.put(p, i);\n\t\t}\n\t\tlong ib = pow(b, mod - orderSqrt - 1);\n\t\tp = a;\n\t\tfor (int i = 1; i < orderSqrt; i++) {\n\t\t\tp = p * ib % mod;\n\t\t\tif (logMap.containsKey(p))\n\t\t\t\treturn PL.make((i * orderSqrt + logMap.get(p)) % order, order);\n\t\t}\n\t\treturn PL.make(-1, 0);\n\t}\n\n\tprivate long sqrtCeil(long a) {\n\t\treturn U.searchL((long) Math.sqrt(a * 0.9), (long) Math.sqrt(a * 1.1) + 1, mid -> mid * mid >= a);\n\t}\n\n\tprivate void prepareFacts(int n) {\n\t\tif (facts == null) {\n\t\t\tfacts = new long[1024];\n\t\t\tinvs = new long[1024];\n\t\t\tinvFacts = new long[1024];\n\t\t\tprepareFactsIn(0, 1024);\n\t\t}\n\t\tif (n >= mod)\n\t\t\tn = (int) (mod - 1);\n\t\twhile (facts.length <= n) {\n\t\t\tint prevL = facts.length;\n\t\t\tint newL = prevL << 1;\n\t\t\tfacts = Arrays.copyOf(facts, newL);\n\t\t\tinvs = Arrays.copyOf(invs, newL);\n\t\t\tinvFacts = Arrays.copyOf(invFacts, newL);\n\t\t\tprepareFactsIn(prevL, newL);\n\t\t}\n\t}\n\n\tprivate void prepareFactsIn(int from, int until) {\n\t\tif (until > mod)\n\t\t\tuntil = (int) mod;\n\t\tfor (int i = from; i < until; i++) {\n\t\t\tif (i == 0) {\n\t\t\t\tfacts[0] = 1;\n\t\t\t\tinvs[0] = 0;\n\t\t\t\tinvFacts[0] = 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (i == 1) {\n\t\t\t\tfacts[1] = 1;\n\t\t\t\tinvs[1] = 1;\n\t\t\t\tinvFacts[1] = 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfacts[i] = facts[i - 1] * i % mod;\n\t\t\tinvs[i] = (mod - mod / i) * invs[(int) (mod % i)] % mod;\n\t\t\tinvFacts[i] = invFacts[i - 1] * invs[i] % mod;\n\t\t}\n\t}\n}\n", "import sys\ninput = sys.stdin.readline\n\nR,C,K = map(int,input().split())\n\ndp = [[0]*4 for i in range(C+1)]\nprev = [0]*(C+1)\ntb = [[0]*(C+1) for i in range(R+1)]\n\nfor i in range(K):\n r,c,v = map(int,input().split())\n tb[r][c] = v\n\nfor i in range(1,R+1):\n for j in range(1,C+1):\n pmx = 0\n for k in range(4):\n mx = dp[j-1][k]\n if k > 0:\n mx = max(mx,dp[j-1][k-1]+tb[i][j])\n if k == 0:\n mx = max(mx,prev[j])\n elif k == 1:\n mx = max(mx,prev[j]+tb[i][j])\n dp[j][k] = mx\n pmx = max(pmx,mx)\n prev[j] = pmx\n\nprint(prev[C])\n", "R,C,K=map(int,input().split())\nG=[[0]*(C+1) for i in range(R+1)]\nfor i in range(K):\n r,c,v=map(int,input().split())\n G[r][c]=v\ndp=[[0]*(C+1) for i in range(R+1)]\nfor i in range(1,R+1):\n d1,d2,d3=0,0,0\n for j in range(1,C+1):\n v=G[i][j]\n if v!=0:\n if d2!=0:\n d3=max(d3,d2+v)\n if d1!=0:\n d2=max(d2,d1+v)\n d1=max(dp[i-1][j]+v,d1)\n else:\n d1=max(dp[i-1][j],d1)\n dp[i][j]=max(d1,d2,d3)\nprint(dp[R][C])\n", "R, C, K = map(int, input().split())\n\nV = [[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[r][c] = v\n\nmax_p = [0]*(C+1)\nfor i in range(R+1):\n now0, now1, now2, now3 = [[0]*(C+1) for _ in range(4)]\n for j in range(C+1):\n v = V[i][j]\n la = lb = 0\n if j > 0:\n la = now0[j-1]\n lb = now1[j-1]\n now2[j] = max(now2[j], now2[j-1], lb + v)\n now3[j] = max(now3[j], now3[j-1], now2[j-1] + v)\n if i > 0:\n now0[j] = max(now0[j], max_p[j], la)\n now1[j] = max(now1[j], max_p[j] + v, la + v, lb)\n max_p[j] = max(now0[j], now1[j], now2[j], now3[j])\n\nprint(max(now0[C], now1[C], now2[C], now3[C]))\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here! \n Scanner sc = new Scanner(System.in);\n int r = sc.nextInt();\n int c = sc.nextInt();\n int n = sc.nextInt();\n \n int[][] array = new int[r+1][c+1];\n for (int i = 0; i < n; i++) {\n int row = sc.nextInt() - 1;\n int col = sc.nextInt() - 1;\n int val = sc.nextInt();\n array[row][col] = val;\n }\n // for (int[] a : array) {\n // System.out.println(Arrays.toString(a));\n // }\n \n long[][][] dp = new long[r+1][c+1][4];\n for (int i = 0; i <= r; i++) {\n for (int j = 0; j <= c; j++) {\n for (int k = 0; k < 4; k++) {\n // 取って右に行く\n if (j+1 <= c && k != 3) {\n dp[i][j+1][k+1] = Math.max(dp[i][j+1][k+1], dp[i][j][k] + array[i][j]);\n }\n // 取らずに右に行く\n if (j+1 <= c) {\n dp[i][j+1][k] = Math.max(dp[i][j+1][k], dp[i][j][k]);\n }\n // 取って下に行く\n if (i+1 <= r && k != 3) {\n dp[i+1][j][0] = Math.max(dp[i+1][j][0], dp[i][j][k] + array[i][j]);\n }\n // 取らずに下に行く\n if (i+1 <= r) {\n dp[i+1][j][0] = Math.max(dp[i+1][j][0], dp[i][j][k]);\n }\n }\n }\n }\n // for (long[][] a : dp) {\n // for (long[] b : a) {\n // System.out.println(Arrays.toString(b));\n // }\n // }\n // System.out.println(dp[1][5][3]);\n \n long ans = 0;\n for (int i = 0; i < 4; i++) {\n // System.out.println(dp[r][c][i]);\n ans = Math.max(ans, dp[r][c][i]);\n }\n System.out.println(ans);\n }\n}", "# -*- coding: utf-8 -*-\n\nR,C,K = map(int, input().split())\n\nitems = [[0 for _ in range(C+1)] for _ in range(R+1)]\nfor i in range(K):\n r,c,v = map(int, input().split())\n items[r][c] = v\n\nDP_prev = [0 for _ in range(C+1)]\n\nfor r in range(1,R+1):\n DP = [[0 for _ in range(C+1)],[0 for _ in range(C+1)],[0 for _ in range(C+1)]]\n for c in range(1,C+1):\n item = items[r][c]\n DP1 = max(DP_prev[c]+item,DP[0][c-1])\n DP2 = max(DP1,DP[1][c-1],DP[0][c-1]+item)\n DP3 = max(DP2,DP[2][c-1],DP[1][c-1]+item)\n DP[0][c] = DP1\n DP[1][c] = DP2\n DP[2][c] = DP3\n DP_prev = DP[2]\n \nprint(DP_prev[C])", "f,h=range,input\nR,C,K=map(int,h().split())\nl=lambda:[-~C*[0]for i in f(R+1)]\nG=l()\nfor i in'_'*K:r,c,v=map(int,h().split());G[r][c]=v\nF=[l()for i in f(4)]\nfor r in f(1,R+1):\n\tfor x in f(1,4):\n\t\tfor c in f(1,C+1):F[x][r][c]=max(F[x-1][r][c],max(F[x-1][r][c-1],(x<2)*F[3][r-1][c])+G[r][c],F[x][r][c-1])\nprint(F[3][R][C])", "def solve():\n R, C, K = map(int, input().split())\n item = [[0]*C for _ in range(R)]\n for i in range(K):\n r,c,v = map(int, input().split())\n item[r-1][c-1] = v\n dp = [[[0]*(C+1) for _ in range(R+1)] for _ in range(4)]\n for i in range(1,R+1):\n for j in range(1,C+1):\n for k in range(4): #横から取らない\n dp[k][i][j] = dp[k][i][j-1]\n #上から取らない\n dp[0][i][j] = max(dp[0][i][j],dp[-1][i-1][j])\n if item[i-1][j-1]>0:\n #上からとる\n dp[1][i][j] = max(dp[1][i][j],dp[-1][i-1][j]+item[i-1][j-1])\n for k in range(1,4): #横から取る\n dp[k][i][j] = max(dp[k][i][j],dp[k-1][i][j-1]+item[i-1][j-1])\n for k in range(1,4):\n dp[k][i][j] = max(dp[k-1][i][j],dp[k][i][j])\n ans = 0\n for k in range(4):\n ans = max(ans,dp[k][-1][-1])\n return ans\nprint(solve())", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,a,b) for(long long i = (a); i < (b); i++)\n#define all(a) a.begin(),a.end()\n#define allr(a) a.rbegin(),a.rend()\nusing ll = long long;\n\nll dp[3001][3001][4];\n\nvoid solve()\n{\nll r,c,k;\ncin>>r>>c>>k;\nvector<vector<ll>> v(r+1,vector<ll>(c+1,0));\nwhile(k--){\n\t\tll a,b;\n\t\tcin>>a>>b;\n\t\tll x;\n\t\tcin>>x;\n\t\tv[a][b]=x;\n}\n\t\n\ndp[0][0][0]=0;\ndp[1][1][0]=0;\nfor(ll i=1;i<=r;i++){\n\tdp[i][1][0]=0;\n}\nfor(ll i=1;i<=r;i++){\n\tfor(ll j=1;j<=c;j++)\n\t\t{\n\t\t\tfor(ll k=1;k<=3;k++){\n\t\t\t\tdp[i][j][k]=max(dp[i-1][j][3],dp[i][j-1][k]);\n\t\t\t}\n\t\t\t\n\t\t\tfor(ll k=1;k<=3;k++){\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],max(dp[i-1][j][3]+v[i][j],dp[i][j-1][k-1]+v[i][j]));\n\t\t\t}\n\t\t\t\n\t\t}\n}\n\nll temp=0;\ntemp=dp[r][c][3];\n\ncout<<temp;\n}\n\n\n\nint main(){\n\tll t;\n\t//cin>>t;\n\tt=1;\n\twhile(t--){\n\t\t\tsolve();\n\tcout<<endl;\n\t}\n\n\n\n}", "f,h=range,input\nR,C,K=map(int,h().split())\nl=lambda:[-~C*[0]for i in f(R+1)]\nG=l()\nfor i in'_'*K:r,c,v=map(int,h().split());G[r][c]=v\nF=[l()for i in f(4)]\nfor r in f(1,R+1):\n\tfor x in f(3):\n\t\tfor c in f(1,C+1):F[x+1][r][c]=max(F[x][r][c],max(F[x][r][c-1],(x<1)*F[3][r-1][c])+G[r][c],F[x+1][r][c-1])\nprint(F[3][R][C])", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define x first\n#define y second\n#define mp make_pair\n#define pb push_back\n\ntypedef long long ll;\n\nconst ll MOD = 1e9+7;\nconst ll INF = 1e9+5;\n\nint n, m, k;\nll v[3005][3005];\n\nll memo[3005][3005][4];\n\nll dp(int x, int y, int h) {\n\tif (x>n or y>m) return 0;\n\tif (memo[x][y][h] != -1) return memo[x][y][h];\n\tll sol = 0;\n\tif (v[x][y] and h) {\n\t\tsol = max(sol, v[x][y] + max(dp(x+1, y, 3), dp(x, y+1, h-1)));\n\t}\n\tsol = max(sol, max(dp(x+1, y, 3), dp(x, y+1, h)));\n\treturn memo[x][y][h] = sol;\n}\n\nint main() {\n\tmemset(memo, -1, sizeof memo);\n\tscanf(\"%d%d%d\", &n, &m, &k);\n\tfor (int i=0 ; i<k ; i++) {\n\t\tint x, y, w;\n\t\tscanf(\"%d%d%d\", &x, &y, &w);\n\t\tv[x][y] = w;\n\t}\n\tprintf(\"%lld\\n\", dp(1, 1, 3));\n\treturn 0;\n}", "import sys\ninput=sys.stdin.readline\ndef main():\n\tR,C,K=map(int,input().split())\n\tlis=[[0]*(C) for i in range(R)]\n\tfor i in range(K):\n\t\ta,b,c=map(int,input().split())\n\t\tlis[a-1][b-1]=c\n\tdp0=[[0]*(C+1) for i in range(R+1)]\n\tdp1=[[0]*(C+1) for i in range(R+1)]\n\tdp2=[[0]*(C+1) for i in range(R+1)]\n\tdp3=[[0]*(C+1) for i in range(R+1)]\n\tfor i in range(1,R+1):\n\t\tfor j in range(1,C+1):\n\t\t\tfor x,y in ((dp0,0),(dp1,dp0),(dp2,dp1),(dp3,dp2)):\n\t\t\t\tt=lis[i-1][j-1]\n\t\t\t\tx[i][j]=max(x[i-1][j],x[i][j])\n\t\t\t\tx[i][j]=max(x[i][j-1],x[i][j])\n\t\t\t\tif t!=0:\n\t\t\t\t\tdp1[i][j]=max(dp1[i][j],x[i-1][j]+t)\n\t\t\t\t\tif y!=0:\n\t\t\t\t\t\tx[i][j]=max(x[i][j],y[i][j-1]+t)\n\tprint(max(dp0[-1][-1],dp1[-1][-1],dp2[-1][-1],dp3[-1][-1]))\nif __name__ == '__main__':\n\tmain()", "#include<cstdio>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<stdio.h>\n#include<locale.h>\n#include<math.h>\n#include<set>\n#include<stack>\n#include<queue>\nusing namespace std;\nint R,C,K;\nint v[3002][3002]={};\nlong long int mae[3002]={};//前の行の最大スコア\nlong long int nw[3002][4]={};//今の行のスコア\nint main()\n{\n scanf(\"%d %d %d\",&R,&C,&K);\n for(int i=0;i<K;i++)\n {\n\tint a,b,vl;\n\tscanf(\"%d %d %d\",&a,&b,&vl);\n\tv[a][b]=vl;\n }\n for(int i=1;i<=R;i++)\n {\n\tfor(int j=1;j<=C;j++)\n\t{\n\t\tfor(int l=1;l<=3;l++)\n\t\t{\n\t\t nw[j][l]=max(nw[j-1][l],max(nw[j-1][l-1]+v[i][j],mae[j]+v[i][j]));\n\t\t}\n\t }\n\tfor(int j=1;j<=C;j++)\n\t{\n\t\tmae[j]=nw[j][3];\n\t}\n }\n long long int ans=0;\n printf(\"%lld\",nw[C][3]);\n}", "R, C, K = map(int, input().split())\n\nitems = [[0] * C for _ in range(R)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n items[r - 1][c - 1] = v\n\ndp0 = [[0] * (C + 1) for _ in range(R + 1)]\ndp1 = [[0] * (C + 1) for _ in range(R + 1)]\ndp2 = [[0] * (C + 1) for _ in range(R + 1)]\ndp3 = [[0] * (C + 1) for _ in range(R + 1)]\n\nfor r in range(R):\n for c in range(C):\n v = items[r][c]\n for fr, to in ((dp2, dp3), (dp1, dp2), (dp0, dp1)):\n to[r][c] = max(to[r][c], fr[r][c] + v)\n\n for dp in (dp0, dp1, dp2, dp3):\n dp[r][c + 1] = max(dp[r][c + 1], dp[r][c])\n dp0[r + 1][c] = max(dp0[r + 1][c], dp[r][c])\n\nans = max(\n dp0[R - 1][C], dp0[R][C - 1],\n dp1[R - 1][C], dp1[R][C - 1],\n dp2[R - 1][C], dp2[R][C - 1],\n dp3[R - 1][C], dp3[R][C - 1],\n)\n\nprint(ans)\n", "import sys\n\nsys.setrecursionlimit(500005)\nstdin = sys.stdin\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().strip()\n\nR, C, K = na()\ng = [[0] * C for _ in range(R)]\nfor i in range(K):\n r, c, v = na()\n g[r-1][c-1] = v\n\nI = -9999999999999999999\ndp = [I] * C\ndp[0] = 0\nfor i in range(R):\n ndp = [I] * C\n row = g[i]\n ldp = [I] * 4\n for j in range(C):\n ldp[0] = max(ldp[0], dp[j])\n for k in range(2,-1,-1):\n ldp[k+1] = max(ldp[k+1], ldp[k] + row[j])\n ndp[j] = max(ldp)\n dp = ndp\n\nprint(dp[C-1])\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.*;\n \npublic class Main {\n \n void solve() throws IOException {\n int R = ni();\n int C = ni();\n int K = ni();\n int[][] item = new int[R][C];\n for (int i = 0; i < K; i++) {\n int r = ni()-1;\n int c = ni()-1;\n int v = ni();\n item[r][c] = v;\n }\n long[][][] dp = new long[R][C][4];\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 0; k < 4; k++) {\n dp[i][j][k] = Long.MIN_VALUE;\n }\n }\n }\n dp[0][0][0] = 0;\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 2; k >=0 ; k--){\n if(dp[i][j][k] >= 0) {\n dp[i][j][k+1] = Math.max(dp[i][j][k+1], dp[i][j][k] + item[i][j]);\n }\n }\n for (int k = 0; k < 4; k++) {\n if(dp[i][j][k] >= 0){\n if(i+1<R){\n dp[i+1][j][0] = Math.max(dp[i+1][j][0], dp[i][j][k]);\n }\n if(j+1<C){\n dp[i][j+1][k] = Math.max(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n } \n }\n }\n\n long ans = dp[R-1][C-1][3];\n ans = Math.max(ans, dp[R-1][C-1][2]);\n ans = Math.max(ans, dp[R-1][C-1][1]);\n ans = Math.max(ans, dp[R-1][C-1][0]);\n out.println(ans);\n }\n int top3(int[] v, int s, int t){\n int firs=0;\n int seco=0;\n int thir=0;\n for (int i = s; i <= t; i++) {\n if(firs < v[i]){\n thir = seco;\n seco = firs;\n firs = v[i];\n }else if(seco < v[i]){\n thir = seco;\n seco = v[i];\n }else if(thir < v[i]){\n thir = v[i];\n }\n }\n return firs + seco + thir;\n }\n final int mod = 1000000007;\n final BigInteger MOD = BigInteger.valueOf(mod);\n int upperBound(ArrayList<Long> list, Long target){\n int i = Collections.binarySearch(list, target, new UpperBoundComparator<Long>());\n return ~i;\n }\n class UpperBoundComparator<T extends Comparable<? super T>> implements Comparator<T>{\n public int compare(T x, T y){\n return (x.compareTo(y) > 0) ? 1 : -1;\n }\n }\n int lowerBound(ArrayList<Long> list, Long target){\n int i = Collections.binarySearch(list, target, new LowerBoundComparator<Long>());\n return ~i;\n }\n class LowerBoundComparator<T extends Comparable<? super T>> implements Comparator<T>{\n public int compare(T x, T y){\n return (x.compareTo(y) >= 0) ? 1 : -1;\n }\n }\n int mul(int x, int y){\n int val = (int)((x * 1L * y) % mod);\n return val>=0 ? val : val+mod;\n }\n int add(int x, int y) {\n x += y;\n if(x < 0) x += mod;\n if(x>=mod) x -= mod;\n return x;\n }\n int sub(int x, int y){\n x = add(x,mod-y);\n if(x < 0) x += mod;\n if(x>=mod) x -= mod;\n return x;\n }\n String ns() throws IOException {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine(), \" \");\n }\n return tok.nextToken();\n }\n \n int ni() throws IOException {\n return Integer.parseInt(ns());\n }\n \n long nl() throws IOException {\n return Long.parseLong(ns());\n }\n \n double nd() throws IOException {\n return Double.parseDouble(ns());\n }\n \n String[] nsa(int n) throws IOException {\n String[] res = new String[n];\n for (int i = 0; i < n; i++) {\n res[i] = ns();\n }\n return res;\n }\n \n int[] nia(int n) throws IOException {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = ni();\n }\n return res;\n }\n \n long[] nla(int n) throws IOException {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nl();\n }\n return res;\n }\n \n static BufferedReader in;\n static PrintWriter out;\n static StringTokenizer tok;\n \n public static void main(String[] args) throws IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n tok = new StringTokenizer(\"\");\n Main main = new Main();\n main.solve();\n out.close();\n }\n}", "H, W, K = map(int, input().split())\nA = [[0] * W for _ in range(H)]\nfor i in range(K):\n y, x, v = map(int, input().split())\n A[y - 1][x - 1] = v\ndp = [[0] * 4 for i in range(W)]\npre = []\ndp[0][1] = A[0][0]\nfor i in range(H):\n for j in range(W):\n for k in range(4):\n if i:\n if k == 1:\n dp[j][k] = max(dp[j][k], max(pre[j]) + A[i][j])\n if k == 0:\n dp[j][k] = max(dp[j][k], max(pre[j]))\n if j:\n if 0 < k:\n dp[j][k] = max(dp[j][k], dp[j - 1][k - 1] + A[i][j])\n dp[j][k] = max(dp[j][k], dp[j - 1][k])\n pre = dp\nans = 0\nfor j in range(W):\n ans = max(ans, max(dp[j]))\nprint(ans)\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n new Main().solve();\n }\n\n private void solve() throws IOException {\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(System.out);\n\n StringTokenizer tokenizer = new StringTokenizer(f.readLine());\n int r = Integer.parseInt(tokenizer.nextToken());\n int c = Integer.parseInt(tokenizer.nextToken());\n int k = Integer.parseInt(tokenizer.nextToken());\n long[][][] dp = new long[r][c][4];\n int[][] map = new int[r][c];\n for (int i = 0; i < k; i++) {\n tokenizer = new StringTokenizer(f.readLine());\n int r1 = Integer.parseInt(tokenizer.nextToken()) - 1;\n int c1 = Integer.parseInt(tokenizer.nextToken()) - 1;\n int v = Integer.parseInt(tokenizer.nextToken());\n map[r1][c1] = v;\n }\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n if (i != 0) {\n for (int l = 0; l < 4; l++) {\n dp[i][j][0] = Math.max(dp[i - 1][j][l], dp[i][j][0]);\n }\n }\n if (j != 0) {\n for (int l = 0; l < 4; l++) {\n dp[i][j][l] = Math.max(dp[i][j - 1][l], dp[i][j][l]);\n }\n }\n for (int l = 2; l >= 0; l--) {\n if (dp[i][j][l] == 0 && l != 0) continue;\n dp[i][j][l + 1] = Math.max(dp[i][j][l + 1], dp[i][j][l] + map[i][j]);\n }\n }\n }\n\n long max = 0;\n for (int i = 0; i < 4; i++) max = Math.max(max, dp[r - 1][c - 1][i]);\n\n /*\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n System.out.print(map[i][j] + \" \");\n }\n System.out.println();\n }\n System.out.println();\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n System.out.print(Arrays.toString(dp[i][j]) + \" \");\n }\n System.out.println();\n } */\n\n out.println(max);\n\n out.close();\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nint a[3002][3002];\nint dp[3003][3002][4];\n\nint32_t main(){\n\tios_base::sync_with_stdio(false);\n\tcin.tie(NULL);\n\tint r,c,k;\n\tcin >> r >> c >> k;\n\n\tfor(int i = 1; i <= k; i++){\n\t\tint x,y,c;\n\t\tcin >> x >> y >> c;\n\t\ta[x][y] = c;\n\t}\n\tfor(int i = 1; i <= r; i++){\n\t\tfor(int j = 1; j <= c; j++){\n\t\t\tfor(int k = 0; k <= 3; k++){\n\t\t\t\tdp[i][j][0] = max(dp[i][j][0], dp[i - 1][j][k]);\n\t\t\t\tdp[i][j][1] = max(dp[i][j][1] , a[i][j] + dp[i - 1][j][k]);\n\t\t\t}\n\t\t\tdp[i][j][0] = max(dp[i][j][0],dp[i][j - 1][0]);\n\t\t\tfor(int k = 1; k <= 3; k++){\n\t\t\t\tdp[i][j][k] = max({dp[i][j][k], a[i][j] + dp[i][j - 1][k - 1],dp[i][j - 1][k]});\n\t\t\t}\n\t\t}\n\t}\n\tcout << max({dp[r][c][0],dp[r][c][1],dp[r][c][2],dp[r][c][3]});\n}\n", "import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n\n R,C,K = LI()\n\n m = [[0] * (C+1) for _ in range(R+1)]\n dp = [[0] * 4 for _ in range(C+1)]\n for _ in range(K):\n r,c,v = LI()\n m[r][c] = v\n\n for i in range(1,R+1):\n for j in range(1,C+1):\n b_max = max(dp[j])\n dp[j][0] = max(dp[j-1][0],b_max)\n if m[i][j] > 0:\n for k in range(1,4):\n dp[j][k] = max(dp[j-1][k],dp[j-1][k-1]+m[i][j])\n dp[j][1] = max(dp[j][1],b_max+m[i][j])\n else:\n for k in range(1,4):\n dp[j][k] = dp[j-1][k]\n print(max(dp[-1]))\n\nif __name__ == '__main__':\n main()", "R, C, K = map(int, input().split())\nT = [[0]*(C+2) for _ in range(R+2)]\ndp = [[[0]*(C+2) for _ in range(R+2)] for _ in range(4)]\nfor i in range(K):\n r, c, v = map(int, input().split())\n T[r][c] = v\ndp[1][1][1] = T[1][1]\ndp[0][1][1] = 0\n\nfor i in range(1, R+1):\n for j in range(1, C+1):\n for k in range(4):\n dp[0][i+1][j] = max(dp[0][i+1][j], dp[k][i][j])\n dp[1][i+1][j] = max(dp[1][i+1][j], dp[k][i][j] + T[i+1][j])\n dp[k][i][j+1] = max(dp[k][i][j+1], dp[k][i][j])\n if k <= 2:\n dp[k+1][i][j+1] = max(dp[k+1][i][j+1], dp[k][i][j] + T[i][j+1])\nans = 0\nfor k in range(4):\n ans = max(ans, dp[k][R][C])\nprint(ans)", "r, c, k = map(int, input().split())\n\ndp = [[[0,0,0,0] for _j in range(c+1)] for _i in range(2)]\nbord = [[0]*(c+1) for _i in range(r)]\n\nfor _i in range(k):\n _r, _c, _v = map(int, input().split())\n bord[_r-1][_c-1] = _v\n \nfor i in range(r):\n for j in range(c):\n dp[1][j][0] = max(dp[0][j])\n dp[1][j][1] = max(\n dp[1][j][0] + bord[i][j],\n dp[1][j-1][1],\n dp[1][j-1][0]+bord[i][j]\n )\n\n dp[1][j][2] = max(\n dp[1][j-1][2],\n dp[1][j-1][1]+bord[i][j], \n )\n dp[1][j][3] = max(\n dp[1][j-1][3],\n dp[1][j-1][2]+bord[i][j], \n )\n\n dp[0] = dp[1][::]\n\nprint(max(dp[1][c-1]))", "#!/usr/bin/env python3\nr, c, k = map(int, input().split())\nitems = [[0] * (c+1) for _ in range(r+1)]\nfor _ in range(k):\n R, C, V = map(int, input().split())\n items[R][C] = V\n\ndp1 = [[0] * (c+1) for _ in range(r+1)]\ndp2 = [[0] * (c+1) for _ in range(r+1)]\ndp3 = [[0] * (c+1) for _ in range(r+1)]\n\nfor i in range(1, r+1):\n for j in range(1, c+1):\n v = items[i][j]\n dp1[i][j] = max(dp1[i][j-1], dp1[i-1][j] + v, dp2[i-1][j] + v, dp3[i-1][j] + v)\n dp2[i][j] = max(dp2[i][j-1], dp1[i][j-1] + v)\n dp3[i][j] = max(dp3[i][j-1], dp2[i][j-1] + v)\n\nans = max(dp1[r][c], dp2[r][c], dp3[r][c])\nprint(ans)", "/**\n * Created by Aminul on 8/15/2020.\n */\n\nimport java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n new Thread(null ,new Runnable(){\n public void run(){\n try{solveIt();} catch(Exception e){e.printStackTrace(); System.exit(1);}\n }\n },\"Main\",1<<28).start();\n }\n\n public static void solveIt() throws Exception {\n FastReader in = new FastReader(System.in);\n PrintWriter pw = new PrintWriter(System.out);\n n = in.nextInt();\n m = in.nextInt();\n int k = in.nextInt();\n arr = new int[n][m];\n for (int i = 0; i < k; i++) {\n int x = in.nextInt() - 1, y = in.nextInt() - 1;\n arr[x][y] = in.nextInt();\n }\n dp = new long[4][n][m];\n for (int i = 0; i < 4; i++) {\n for (long a[] : dp[i]) Arrays.fill(a, -1);\n }\n pw.println(solve(0, 0, 3));\n pw.close();\n }\n\n static int n, m;\n static long dp[][][];\n static int arr[][];\n\n static long solve(int r, int c, int k) {\n if (r >= n || c >= m) return 0;\n if (dp[k][r][c] != -1) return dp[k][r][c];\n\n long down = solve(r + 1, c, 3);\n long res = solve(r, c + 1, k);\n res = max(res, down);\n if (k > 0 && arr[r][c] > 0) {\n long right = arr[r][c] + solve(r, c + 1, k - 1);\n res = max(res, right);\n res = max(res, arr[r][c] + down);\n }\n return dp[k][r][c] = res;\n }\n\n static void debug(Object... obj) {\n System.err.println(Arrays.deepToString(obj));\n }\n\n static class FastReader {\n InputStream is;\n private byte[] inbuf = new byte[1024];\n private int lenbuf = 0, ptrbuf = 0;\n\n public FastReader(InputStream is) {\n this.is = is;\n }\n\n public int readByte() {\n if (lenbuf == -1) throw new InputMismatchException();\n if (ptrbuf >= lenbuf) {\n ptrbuf = 0;\n try {\n lenbuf = is.read(inbuf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (lenbuf <= 0) return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n public boolean isSpaceChar(int c) {\n return !(c >= 33 && c <= 126);\n }\n\n private boolean isEndOfLine(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int skip() {\n int b;\n while ((b = readByte()) != -1 && isSpaceChar(b)) ;\n return b;\n }\n\n public String next() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while (!(isSpaceChar(b))) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n\n public String nextLine() {\n int c = skip();\n StringBuilder sb = new StringBuilder();\n while (!isEndOfLine(c)) {\n sb.appendCodePoint(c);\n c = readByte();\n }\n return sb.toString();\n }\n\n public int nextInt() {\n int num = 0, b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n while (true) {\n if (b >= '0' && b <= '9') {\n num = (num << 3) + (num << 1) + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n public long nextLong() {\n long num = 0;\n int b;\n boolean minus = false;\n while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n\n while (true) {\n if (b >= '0' && b <= '9') {\n num = (num << 3) + (num << 1) + (b - '0');\n } else {\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public char[] next(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while (p < n && !(isSpaceChar(b))) {\n buf[p++] = (char) b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n public char readChar() {\n return (char) skip();\n }\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nint main() {\n int H, W, K; cin >> H >> W >> K;\n vector<vector<int>> v(H, vector<int>(W));\n for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) {\n int r, c, x; cin >> r >> c >> x; r--, c--;\n v[r][c] = x;\n }\n vector<vector<vector<ll>>> dp(H+1, vector<vector<ll>>(W+1, vector<ll>(4, 0)));\n for (int i = H - 1; i >= 0; i--) {\n for (int j = W - 1; j >= 0; j--) {\n for (int k = 0; k < 4; k++) {\n auto& res = dp[i][j][k];\n res = max(res, dp[i][j+1][k]);\n res = max(res, dp[i+1][j][0]);\n if (k != 3) {\n res = max(res, dp[i][j+1][k+1] + v[i][j]);\n res = max(res, dp[i+1][j][0] + v[i][j]);\n }\n }\n }\n }\n cout << dp[0][0][0] << endl;\n}", "R,C,K=map(int,input().split())\nm=[[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r,c,v=map(int,input().split())\n m[r][c]=v\nd=[[0]*4 for _ in range(R+1)]\nfor j in range(1,C+1):\n for i in range(1,R+1):\n t=m[i][j]\n if t>0:\n d[i][3]=max(d[i][3],d[i][2]+t)\n d[i][2]=max(d[i][2],d[i][1]+t)\n d[i][1]=max(d[i][1],d[i][0]+t,max(d[i-1])+t)\n d[i][0]=max(d[i][0],max(d[i-1]))\n else:\n d[i][0]=max(d[i][0],max(d[i-1]))\nprint(max(d[R]))", "#include<bits/stdc++.h>\nusing namespace std;\nlong long n,m,k,vl[3030][3030],dp[3030][3030][4];\nint main()\n{\n\tcin>>n>>m>>k;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tlong long a,b,c;\n\t\tcin>>a>>b>>c;\n\t\tvl[a][b]=c;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=1;j<=m;j++)\n\t\t{\n\t\t\tfor(int k=0;k<=3;k++)\n\t\t\t{\n\t\t\t\tif(k!=3)\n\t\t\t\t{\n\t\t\t\t\tdp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]+vl[i][j]);\n\t\t\t\t}\n\t\t\t\tdp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k]);\n\t\t\t\tdp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]);\n\t\t\t\tif(k!=3)\n\t\t\t\t{\n\t\t\t\t\tdp[i][j+1][k+1]=max(dp[i][j+1][k+1],dp[i][j][k]+vl[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<max(dp[n][m][0]+vl[n][m],max(dp[n][m][1]+vl[n][m],max(dp[n][m][2]+vl[n][m],dp[n][m][3])))<<endl;\n\treturn 0;\n}", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.lang.reflect.Field;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\nimport java.util.function.IntUnaryOperator;\nimport java.util.function.LongUnaryOperator;\n\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Field f = System.out.getClass().getDeclaredField(\"autoFlush\");\n f.setAccessible(true);\n f.set(System.out, false);\n execute(System.in, System.out);\n }\n\n public static void execute(InputStream in, OutputStream out) {\n ExtendedScanner s = new ExtendedScanner(in);\n Out o = new Out(out);\n solve(s, o);\n o.flush();\n o.close();\n }\n\n public static void solve(ExtendedScanner sc, Out out) {\n int r = sc.nextInt();\n int c = sc.nextInt();\n int k = sc.nextInt();\n long[][] g = new long[r][c];\n int[] rs = new int[k];\n int[] cs = new int[k];\n long[] vs = new long[k];\n for (int i = 0; i < k; i++) {\n rs[i] = sc.nextInt() - 1;\n cs[i] = sc.nextInt() - 1;\n vs[i] = sc.nextLong();\n g[rs[i]][cs[i]] = vs[i];\n }\n long[][][] dp = new long[4][r][c];\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n for (int x = 0; x <= 3; x++) {\n long vr = i > 0 ? dp[x][i - 1][j] : 0;\n long vc = j > 0 ? dp[x][i][j - 1] : 0;\n if (x == 0) {\n if (i > 0) {\n long v01 = Math.max(dp[0][i - 1][j], dp[1][i - 1][j]);\n long v23 = Math.max(dp[2][i - 1][j], dp[3][i - 1][j]);\n long v = Math.max(v01, v23);\n dp[x][i][j] = Math.max(dp[x][i][j], v);\n }\n } else { \n dp[x][i][j] = Math.max(vr, vc);\n long vc2 = j > 0 ? dp[x - 1][i][j - 1] : 0;\n dp[x][i][j] = Math.max(dp[x][i][j], vc2 + g[i][j]);\n if (x == 1 && i > 0) {\n long v01 = Math.max(dp[0][i - 1][j], dp[1][i - 1][j]);\n long v23 = Math.max(dp[2][i - 1][j], dp[3][i - 1][j]);\n long v = Math.max(v01, v23);\n dp[x][i][j] = Math.max(dp[x][i][j], v + g[i][j]);\n }\n }\n }\n }\n }\n long ans = Math.max(Math.max(dp[0][r - 1][c - 1], dp[1][r - 1][c - 1]), Math.max(dp[2][r - 1][c - 1], dp[3][r - 1][c - 1]));\n out.writeln(ans);\n }\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nclass BasicScanner {\n private final InputStream in;\n private final byte[] buf = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public BasicScanner(InputStream in) {this.in = in;}\n private boolean hasNextByte() {\n if (ptr < buflen) return true;\n ptr = 0;\n try {buflen = in.read(buf);}\n catch (final IOException e) {e.printStackTrace();}\n return buflen > 0;\n }\n private int readByte() {return hasNextByte() ? buf[ptr++] : -1;}\n public boolean hasNext() {\n while (hasNextByte() && !(33 <= buf[ptr] && buf[ptr] <= 126)) ptr++;\n return hasNextByte();\n }\n private StringBuilder nextSequence() {\n if (!hasNext()) throw new NoSuchElementException();\n final StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (33 <= b && b <= 126) {sb.appendCodePoint(b); b = readByte();}\n return sb;\n }\n public char nextChar() {\n return (char) readByte();\n }\n public String next() {\n return nextSequence().toString();\n }\n public String next(int len) {\n return new String(nextChars(len));\n }\n public char[] nextChars() {\n final StringBuilder sb = nextSequence();\n int l = sb.length();\n char[] dst = new char[l];\n sb.getChars(0, l, dst, 0);\n return dst;\n }\n public char[] nextChars(int len) {\n if (!hasNext()) throw new NoSuchElementException();\n char[] s = new char[len];\n int i = 0;\n int b = readByte();\n while (33 <= b && b <= 126 && i < len) {s[i++] = (char) b; b = readByte();}\n if (i != len) throw new NoSuchElementException(String.format(\"length %d is longer than the sequence.\", len));\n return s;\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {minus = true; b = readByte();}\n if (b < '0' || '9' < b) throw new NumberFormatException();\n while (true) {\n if ('0' <= b && b <= '9') n = n * 10 + b - '0';\n else if (b == -1 || !(33 <= b && b <= 126)) return minus ? -n : n;\n else throw new NumberFormatException();\n b = readByte();\n }\n }\n public int nextInt() {return Math.toIntExact(nextLong());}\n public double nextDouble() {return Double.parseDouble(next());}\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nclass Out {\n private final OutputStream out;\n private byte[] buf = new byte[1024];\n private int ptr = 0;\n private static final int AUTO_FLUSH_THRETHOLD = 1 << 17;\n\n public Out(OutputStream out) {\n this.out = out;\n }\n\n public void flush() {\n try {\n out.write(buf, 0, ptr);\n out.flush();\n ptr = 0;\n } catch (IOException e) {e.printStackTrace();}\n }\n\n public void close() {\n try {out.close();} catch (IOException e) {e.printStackTrace();}\n }\n\n public Out writeln() {return write('\\n');}\n public Out writeln(Object o) {return write(o).write('\\n');}\n public Out writeln(String s) {return write(s).write('\\n');}\n public Out writeln(char[] c) {return write(c).write('\\n');}\n public Out writeln(char c) {return write(c).write('\\n');}\n public Out writeln(byte b) {return write(b).write('\\n');}\n public Out writeln(int x) {return write(x).write('\\n');}\n public Out writeln(long x) {return write(x).write('\\n');}\n public Out writeln(double d) {return write(d).write('\\n');}\n\n public Out writeSpace() {return write(' ');}\n \n public Out write(Object o) {\n return write(o.toString());\n }\n\n public Out write(String s) {\n try {\n Field strValueField = s.getClass().getDeclaredField(\"value\");\n strValueField.setAccessible(true);\n byte[] b = (byte[]) strValueField.get(s);\n int l = s.length();\n if (l > AUTO_FLUSH_THRETHOLD) {\n flush();\n int i = 0;\n while (i + AUTO_FLUSH_THRETHOLD < l) {\n out.write(b, i, AUTO_FLUSH_THRETHOLD);\n out.flush();\n i += AUTO_FLUSH_THRETHOLD;\n }\n ensureCapacity(l - i);\n System.arraycopy(b, i, buf, 0, l - i);\n ptr = l - i;\n } else {\n ensureCapacity(ptr + l);\n System.arraycopy(b, 0, buf, ptr, l);\n ptr += l;\n }\n } catch (Exception e) {e.printStackTrace();}\n return this;\n }\n\n public Out write(char[] c) {\n int l = c.length;\n if (l > AUTO_FLUSH_THRETHOLD) {\n flush();\n ensureCapacity(AUTO_FLUSH_THRETHOLD);\n int i = 0;\n while (i + AUTO_FLUSH_THRETHOLD < l) {\n for (int j = 0; j < AUTO_FLUSH_THRETHOLD; j++) {\n buf[ptr++] = (byte) c[i + j];\n }\n flush();\n i += AUTO_FLUSH_THRETHOLD;\n }\n for (; i < l; i++) {\n buf[ptr++] = (byte) c[i];\n }\n } else {\n ensureCapacity(ptr + l);\n for (char ch : c) buf[ptr++] = (byte) ch;\n }\n return this;\n }\n\n public Out write(char c) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = (byte) c;\n return this;\n }\n\n public Out write(byte b) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = b;\n return this;\n }\n\n public Out write(int x) {\n if (x == 0) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = '0';\n return this;\n }\n int d = stringSize(x);\n ensureCapacity(ptr + d);\n if (x < 0) {\n buf[ptr++] = '-';\n x = -x;\n d--;\n }\n int j = ptr + d; \n while (x > 0) {\n buf[--j] = (byte) ('0' + (x % 10));\n x /= 10;\n }\n ptr += d;\n return this;\n }\n\n public Out write(long x) {\n if (x == 0) {\n ensureCapacity(ptr + 1);\n buf[ptr++] = '0';\n return this;\n }\n int d = stringSize(x);\n ensureCapacity(ptr + d);\n if (x < 0) {\n buf[ptr++] = '-';\n x = -x;\n d--;\n }\n int j = ptr + d; \n while (x > 0) {\n buf[--j] = (byte) ('0' + (x % 10));\n x /= 10;\n }\n ptr += d;\n return this;\n }\n\n public Out write(double d) {\n return write(Double.toString(d));\n }\n\n private void ensureCapacity(int cap) {\n if (cap > AUTO_FLUSH_THRETHOLD) {\n flush();\n }\n if (cap >= buf.length) {\n int newLength = buf.length;\n while (newLength < cap) newLength <<= 1;\n byte[] newBuf = new byte[newLength];\n System.arraycopy(buf, 0, newBuf, 0, buf.length);\n buf = newBuf;\n }\n }\n private static int stringSize(long x) {\n int d = 1;\n if (x >= 0) {d = 0; x = -x;}\n long p = -10;\n for (int i = 1; i < 19; i++, p *= 10) if (x > p) return i + d;\n return 19 + d;\n }\n private static int stringSize(int x) {\n int d = 1;\n if (x >= 0) {d = 0; x = -x;}\n int p = -10;\n for (int i = 1; i < 10; i++, p *= 10) if (x > p) return i + d;\n return 10 + d;\n }\n}\n\n\n/**\n * @author https://atcoder.jp/users/suisen\n */\nfinal class ExtendedScanner extends BasicScanner {\n public ExtendedScanner(InputStream in) {super(in);}\n public int[] ints(final int n) {\n final int[] a = new int[n];\n Arrays.setAll(a, $ -> nextInt());\n return a;\n }\n public int[] ints(final int n, final IntUnaryOperator f) {\n final int[] a = new int[n];\n Arrays.setAll(a, $ -> f.applyAsInt(nextInt()));\n return a;\n }\n public int[][] ints(final int n, final int m) {\n final int[][] a = new int[n][];\n Arrays.setAll(a, $ -> ints(m));\n return a;\n }\n public int[][] ints(final int n, final int m, final IntUnaryOperator f) {\n final int[][] a = new int[n][];\n Arrays.setAll(a, $ -> ints(m, f));\n return a;\n }\n public long[] longs(final int n) {\n final long[] a = new long[n];\n Arrays.setAll(a, $ -> nextLong());\n return a;\n }\n public long[] longs(final int n, final LongUnaryOperator f) {\n final long[] a = new long[n];\n Arrays.setAll(a, $ -> f.applyAsLong(nextLong()));\n return a;\n }\n public long[][] longs(final int n, final int m) {\n final long[][] a = new long[n][];\n Arrays.setAll(a, $ -> longs(m));\n return a;\n }\n public long[][] longs(final int n, final int m, final LongUnaryOperator f) {\n final long[][] a = new long[n][];\n Arrays.setAll(a, $ -> longs(m, f));\n return a;\n }\n public char[][] charArrays(final int n) {\n final char[][] c = new char[n][];\n Arrays.setAll(c, $ -> nextChars());\n return c;\n }\n public char[][] charArrays(final int n, final int m) {\n final char[][] c = new char[n][];\n Arrays.setAll(c, $ -> nextChars(m));\n return c;\n }\n public double[] doubles(final int n) {\n final double[] a = new double[n];\n Arrays.setAll(a, $ -> nextDouble());\n return a;\n }\n public double[][] doubles(final int n, final int m) {\n final double[][] a = new double[n][];\n Arrays.setAll(a, $ -> doubles(m));\n return a;\n }\n public String[] strings(final int n) {\n final String[] s = new String[n];\n Arrays.setAll(s, $ -> next());\n return s;\n }\n public String[] strings(final int n, final int m) {\n final String[] s = new String[n];\n Arrays.setAll(s, $ -> next(m));\n return s;\n }\n}\n", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String[] header = br.readLine().split(\" \");\n long ans = 0;\n int r = Integer.parseInt(header[0]);\n int c = Integer.parseInt(header[1]);\n int k = Integer.parseInt(header[2]);\n\n long[][] map = new long[r + 1][c + 1];\n\n for (int i = 0; i < k; i++) {\n String[] line = br.readLine().split(\" \");\n int ri = Integer.parseInt(line[0]);\n int ci = Integer.parseInt(line[1]);\n long vi = Long.parseLong(line[2]);\n map[ri][ci] = vi;\n }\n br.close();\n\n long[][][] dp = new long[r + 1][c + 1][4];\n for (int i = 1; i <= r; i++) {\n for (int j = 1; j <= c; j++) {\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i - 1][j][0]);\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i - 1][j][1]);\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i - 1][j][2]);\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i - 1][j][3]);\n dp[i][j][0] = Math.max(dp[i][j][0], dp[i][j - 1][0]);\n\n dp[i][j][1] = Math.max(dp[i][j][1], dp[i][j][0] + map[i][j]);\n dp[i][j][1] = Math.max(dp[i][j][1], dp[i][j - 1][0] + map[i][j]);\n dp[i][j][1] = Math.max(dp[i][j][1], dp[i][j - 1][1]);\n\n\n dp[i][j][2] = Math.max(dp[i][j - 1][2], dp[i][j - 1][1] + map[i][j]);\n dp[i][j][3] = Math.max(dp[i][j - 1][3], dp[i][j - 1][2] + map[i][j]);\n }\n }\n for(int i = 0; i <= 3; i++){\n ans = Math.max(ans, dp[r][c][i]);\n }\n System.out.println(ans);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int R,C,K;\n cin>>R>>C>>K;\n vector<vector<int64_t>> p(R,vector<int64_t>(C));\n for(int i=0;i<K;i++){\n int a,b;\n int64_t c;\n cin>>a>>b>>c;\n a--,b--;\n p[a][b]=c;\n }\n vector<vector<int64_t>> dp(R,vector<int64_t>(C));\n for(int i=0;i<R;i++){\n vector<int64_t> kdp(4);\n for(int j=0;j<C;j++){\n if(i!=0){\n kdp[0]=max(kdp[0],dp[i-1][j]);\n }\n for(int k=2;k>=0;k--){\n kdp[k+1]=max(kdp[k+1],kdp[k]+p[i][j]);\n dp[i][j]=max(dp[i][j],kdp[k+1]);\n } \n }\n }\n cout<<dp[R-1][C-1]<<endl;\n}", "#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nint A[3100][3100],B[3100][3100][5];\nsigned main(){\n int H,W,K;\n cin>>H>>W>>K;\n for(int i=0;i<K;i++){\n int x,y,c;\n cin>>x>>y>>c;\n A[x-1][y-1]=c;\n }\n for(int i=0;i<H;i++){\n B[i+1][0][0]=max({B[i+1][0][0],B[i][0][0],B[i][0][1],B[i][0][2],B[i][0][3]});\n if(A[i][0])B[i+1][0][1]=B[i+1][0][0]+A[i][0];\n for(int j=1;j<W;j++){\n for(int k=0;k<4;k++)B[i+1][j][k]=B[i+1][j-1][k];\n B[i+1][j][0]=max(B[i+1][j][0],max({B[i][j][0],B[i][j][1],B[i][j][2],B[i][j][3]}));\n if(A[i][j])B[i+1][j][1]=max(B[i+1][j][1],B[i+1][j][0]+A[i][j]);\n for(int k=0;k<3;k++)\n if(B[i+1][j-1][k])B[i+1][j][k+1]=max(B[i+1][j][k+1],B[i+1][j-1][k]+A[i][j]);\n }\n }\n cout<<max({B[H][W-1][0],B[H][W-1][1],B[H][W-1][2],B[H][W-1][3]})<<endl;\n}", "#include <bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n#define chmax(x, y) x = max(x, y)\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n int R, C, K;\n cin >> R >> C >> K;\n rep(i, K) {\n int r, c, v;\n cin >> r >> c >> v;\n a[r-1][c-1] = v;\n }\n\n rep(i, R) rep(j, C) {\n for (int k = 2; k >= 0; k--) {\n chmax(dp[i][j][k+1], dp[i][j][k] + a[i][j]);\n }\n rep(k, 4) {\n chmax(dp[i+1][j][0], dp[i][j][k]);\n chmax(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n\n ll ans = 0;\n rep(k, 4) chmax(ans, dp[R-1][C-1][k]);\n cout << ans << endl;\n return 0;\n}", "import sys\ndef main():\n input = sys.stdin.readline\n R, C, k = map(int, input().split())\n s = [[0] * (C + 1) for i in range(R + 1)]\n dp = [[[0] * (C + 1) for i in range(R + 1)] for j in range(4)]\n for i in range(k):\n r, c, v = map(int, input().split())\n s[r][c] = v\n for i in range(R):\n for j in range(C):\n m = max(dp[0][i][j + 1], dp[1][i][j + 1], dp[2][i][j + 1], dp[3][i][j + 1])\n for k in range(4):\n if k == 0:\n dp[k][i + 1][j + 1] = max(dp[k][i + 1][j], m)\n else:\n dp[k][i + 1][j + 1] = max(dp[k][i + 1][j], dp[k - 1][i + 1][j] + s[i + 1][j + 1])\n dp[1][i + 1][j + 1] = max(dp[1][i + 1][j + 1], s[i + 1][j + 1] + m)\n print(max(dp[0][R][C], dp[1][R][C], dp[2][R][C], dp[3][R][C]))\nif __name__ == \"__main__\":\n main()\n", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define chmax(x,y) x = max(x,y)\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n int R, C, n;\n cin >> R >> C >> n;\n rep(i,n) {\n int r, c, v;\n cin >> r >> c >> v;\n a[r-1][c-1] = v;\n }\n\n rep(i,R)rep(j,C) {\n for (int k = 2; k >= 0; k--) {\n chmax(dp[i][j][k+1], dp[i][j][k]+a[i][j]);\n }\n rep(k,4) {\n chmax(dp[i+1][j][0], dp[i][j][k]);\n chmax(dp[i][j+1][k], dp[i][j][k]);\n }\n }\n\n ll ans = 0;\n rep(k,4) chmax(ans, dp[R-1][C-1][k]);\n cout << ans << endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nlong long r,c,k,x,y,v,ans;\nlong long m[3005][3005],f[3005][3005][5];\nint main()\n{\n\tcin>>r>>c>>k;\n\tfor(int i=1;i<=k;++i)\n\t{\n\t\tcin>>x>>y>>v;\n\t\tm[x][y]=v;\n\t}\n\tfor(int i=1;i<=r;++i)\n\t for(int j=1;j<=c;++j)\n\t for(int k=1;k<=3;++k)\n\t f[i][j][k]=max(f[i-1][j][3]+m[i][j],max(f[i][j-1][k-1]+m[i][j],f[i][j-1][k])),\n\t ans=max(ans,f[i][j][k]);\n\tcout<<ans;\n\treturn 0;\n}", "f,h=range,input\nR,C,K=map(int,h().split())\nG=[-~C*[0]for i in f(R+1)]\nfor i in'_'*K:r,c,v=map(int,h().split());G[r][c]=v\nF=[[-~C*[0]for i in f(R+1)]for i in f(4)]\nfor r in f(1,R+1):\n\tfor x in f(1,4):\n\t\tfor c in f(1,C+1):F[x][r][c]=max(F[x-1][r][c],max(F[x-1][r][c-1],(x<2)*F[3][r-1][c])+G[r][c],F[x][r][c-1])\nprint(F[3][R][C])", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\nll ans = 0;\n\nint main()\n{\nll r , c , k ;\ncin >> r >> c >> k ;\nvector<vector<vector<ll>>> v(r, vector<vector<ll>>(c, vector<ll>(3,-(1LL<<60))));\nvector<vector<ll>> vv(r, vector<ll>(c,0) );\nrep(i,k){\n ll rr , cc , vvv ;\n cin >> rr >> cc >> vvv ;\n vv[rr-1][cc-1]=vvv;\n}\nv[0][0][0]=vv[0][0];\nrep(i,r){\n rep(j,c){\n v[i][j][0]=vv[i][j];\n rep(l,3){\n if(j!=0)v[i][j][l]=max(v[i][j][l],v[i][j-1][l]);\n if(j!=0&&l!=0)v[i][j][l]=max(v[i][j][l],v[i][j-1][l-1]+vv[i][j]);\n if(i!=0)v[i][j][l]=max(v[i][j][l],*max_element(v[i-1][j].begin(),v[i-1][j].end())+vv[i][j]);\n }\n }\n}\ncout << *max_element(v[r-1][c-1].begin(),v[r-1][c-1].end()) << endl;\nreturn 0;\n}", "# pypy\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\n\nR, C, K = map(int, readline().split())\nrcv = list(map(int, read().split()))\nrc2v = {}\nfor rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):\n rc2v[(rr, cc)] = vv\n\ndp = [[0]*4 for c in range(C+1)]\nfor r in range(1, R+1):\n for c in range(1, C+1):\n v = rc2v[(r, c)] if (r, c) in rc2v else 0\n dp[c][0] = max(dp[c-1][0], max(dp[c]))\n dp[c][1] = max(dp[c-1][1], dp[c][0] + v)\n dp[c][2] = max(dp[c-1][2], dp[c-1][1] + v)\n dp[c][3] = max(dp[c-1][3], dp[c-1][2] + v)\n\nprint(max(dp[-1]))", "R,C,K= map(int,input().split(\" \"))\noriginal=[[0]*(C+1) for i in range(R+1)]\nfor _ in range(K):\n r,c,v= map(int,input().split(\" \"))\n original[r][c]=v\nd1=[[0]*(C+1) for i in range(R+1)]\nd2=[[0]*(C+1) for i in range(R+1)]\nd3=[[0]*(C+1) for i in range(R+1)]\nfor i in range(1,R+1):\n for j in range(1,C+1):\n curr= original[i][j]\n d1[i][j]=max(d1[i-1][j]+curr,d2[i-1][j]+curr,d3[i-1][j]+curr,d1[i][j-1],curr)\n d2[i][j]=max(d2[i][j-1],d1[i][j-1]+curr)\n d3[i][j]=max(d3[i][j-1],d2[i][j-1]+curr)\nprint(max(d1[-1][-1],d2[-1][-1],d3[-1][-1]))", "import sys\ninput = sys.stdin.readline\nR,C,K = map(int,input().split())\nRCV = [tuple(map(int,input().split())) for i in range(K)]\n\ngoods = [dict() for _ in range(R)]\nfor r,c,v in RCV:\n r,c = r-1,c-1\n goods[r][c] = v\n\ndp0 = [[0]*4 for _ in range(C)]\ndp1 = [[0]*4 for _ in range(C)]\nif 0 in goods[0]:\n dp1[0][1] = goods[0][0]\nfor i in range(R):\n for j in range(C):\n if i:\n pre = max(dp0[j])\n dp1[j][0] = pre\n if j in goods[i]:\n dp1[j][1] = pre + goods[i][j]\n if j:\n for k in range(4):\n dp1[j][k] = max(dp1[j][k], dp1[j-1][k])\n if j in goods[i]:\n for k in reversed(range(3)):\n dp1[j][k+1] = max(dp1[j][k+1], dp1[j-1][k] + goods[i][j])\n dp0 = dp1\n dp1 = [[0]*4 for _ in range(C)]\nprint(max(dp0[-1]))", "//package com.company;\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n//****Use Integer Wrapper Class for Arrays.sort()****\npublic class Main {\n static long[][][] dp;\n static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));\n public static void main(String[] Args)throws Exception{\n FastReader scan=new FastReader(System.in);\n int t=1;\n// t=scan.nextInt();\n while(t-->0){\n int r=scan.nextInt();\n int c=scan.nextInt();\n int k=scan.nextInt();\n int[][] mat=new int[r][c];\n for(int i=0;i<k;i++){\n int ri=scan.nextInt();\n int ci=scan.nextInt();\n mat[ri-1][ci-1]=scan.nextInt();\n }\n dp=new long[r][c][4];\n for(int i=r-1;i>=0;i--){\n for(int j=c-1;j>=0;j--){\n for(int l=0;l<4;l++){\n long fi=0;\n if(j<c-1){\n fi=dp[i][j+1][l];\n }\n long se=0;\n if(i<r-1){\n se=dp[i+1][j][3];\n }\n long th=0;\n if(l>0){\n th=mat[i][j];\n if(j<c-1){\n th+=dp[i][j+1][l-1];\n }\n th=Math.max(th,mat[i][j]+se);\n }\n dp[i][j][l]=Math.max(fi,Math.max(th,se));\n }\n }\n }\n out.println(dp[0][0][3]);\n }\n out.flush();\n out.close();\n }\n static long recur(int[][] mat,int i,int j,int r,int c,long[][][] dp,int avai){\n if(i==r||j==c){\n return 0;\n }\n if(dp[i][j][avai]!=-1){\n return dp[i][j][avai];\n }\n dp[i][j][avai]=0;\n long fi=recur(mat,i,j+1,r,c,dp,avai);\n long se=recur(mat,i+1,j,r,c,dp,3);\n long th=0;\n if(avai>0) {\n th=mat[i][j]+recur(mat,i,j+1,r,c,dp,avai-1);\n th=Math.max(th,mat[i][j]+se);\n }\n dp[i][j][avai]=Math.max(fi,Math.max(th,se));\n return dp[i][j][avai];\n }\n static class FastReader {\n\n byte[] buf = new byte[2048];\n int index, total;\n InputStream in;\n\n FastReader(InputStream is) {\n in = is;\n }\n\n int scan() throws IOException {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0) {\n return -1;\n }\n }\n return buf[index++];\n }\n\n String next() throws IOException {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n int nextInt() throws IOException {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n long nextLong() throws IOException {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = scan();\n }\n for (; c >= '0' && c <= '9'; c = scan()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n }\n}\n", "from collections import defaultdict\nimport sys\ninput=sys.stdin.readline\nr,c,k=map(int,input().split())\nl=[0]*((r+1)*(c+1))\nfor i in range(k):\n a1,a2,a3=map(int,input().split())\n l[a1*(c+1)+a2]=a3\ndp0=[[0 for i in range(c+1)] for j in range(r+1)]\ndp1=[[0 for i in range(c+1)] for j in range(r+1)]\ndp2=[[0 for i in range(c+1)] for j in range(r+1)]\ndp3=[[0 for i in range(c+1)] for j in range(r+1)]\nfor i in range(r):\n for j in range(c):\n x=l[i*(c+1)+j+1]\n y=l[(i+1)*(c+1)+j]\n dp3[i+1][j+1]=max(dp2[i][j+1]+x,dp3[i][j+1],dp2[i+1][j]+y,dp3[i+1][j])\n dp2[i+1][j+1]=max(dp2[i][j+1]+x,dp3[i][j+1],dp1[i+1][j]+y,dp2[i+1][j])\n dp1[i+1][j+1]=max(dp2[i][j+1]+x,dp3[i][j+1],dp0[i+1][j]+y,dp1[i+1][j])\n dp0[i+1][j+1]=max(dp2[i][j+1]+x,dp3[i][j+1],dp0[i+1][j])\nz=l[r*(c+1)+c]\nprint(max(dp2[r][c]+z,dp3[r][c]))", "import sys\n\ninput = sys.stdin.readline\nR, C, K = map(int, input().split())\nvalues = [[0]*C for _ in range(R)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n values[r-1][c-1] = v\n\ndp = [[[0 for _ in range(C+1)] for _ in range(R+1)] for _ in range(4)]\n\nfor r in range(R-1, -1, -1):\n # dp[0][r][C - 1] = dp[3][r + 1][C - 1]\n # for i in range(1, 4):\n # dp[i][r][C-1] = dp[3][r + 1][C-1][3]+values[r][C-1]\n for c in range(C-1, -1, -1):\n v = values[r][c]\n for i in range(4):\n if i == 0 or v == 0:\n dp[i][r][c] = max(dp[3][r+1][c], dp[i][r][c+1])\n else:\n dp[i][r][c] = max(dp[3][r + 1][c]+v, dp[i][r][c + 1], dp[i-1][r][c + 1] + v)\n\nprint(dp[3][0][0])\n", "#include <bits/stdc++.h>\n#define int long long \nusing namespace std;\nint n,m,k,r[200010],c[200010],v[200010];\nint val[3010][3010],dp[3010][3010][5];\nsigned main()\n{\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout.tie(0);\n\tcin>>n>>m>>k;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tcin>>r[i]>>c[i]>>v[i];\n\t\tval[r[i]][c[i]]=v[i];\n\t}\n\t\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=1;j<=m;j++)\n\t\t{\n\t\t\tdp[i][j][0]=max(dp[i-1][j][1],max(dp[i-1][j][2],dp[i-1][j][3]));\n\t\t\tdp[i][j][1]=max(dp[i][j-1][1],max(dp[i-1][j][1],max(dp[i-1][j][2],dp[i-1][j][3]))+val[i][j]);\n\t\t\tdp[i][j][2]=max(dp[i][j-1][2],dp[i][j-1][1]+val[i][j]);\n\t\t\tdp[i][j][3]=max(dp[i][j-1][3],dp[i][j-1][2]+val[i][j]);\n\t\t}\n\t}\n\t\n\tcout<<max(dp[n][m][0],max(dp[n][m][1],max(dp[n][m][2],dp[n][m][3])))<<endl;\n\t\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nll R,C,K;\nll V[3005][3005];\nll dp[3005][3005][4];\nll dp1[3005][3005];\nint main(){\n cin>>R>>C>>K;\n for(int i=0;i<K;i++){\n ll r,c,v;cin>>r>>c>>v;\n V[r][c]=v;\n }for(int i=1;i<=R;i++)\n for(int j=1;j<=C;j++){\n if(V[i][j]==0){\n dp[i][j][0]=max(dp[i][j-1][0],dp1[i-1][j]);\n dp[i][j][1]=dp[i][j-1][1];\n dp[i][j][2]=dp[i][j-1][2];\n dp[i][j][3]=dp[i][j-1][3];\n }else{\n dp[i][j][0]=max(dp[i][j-1][0],dp1[i-1][j]);\ndp[i][j][1]=max(dp[i][j-1][1],max(dp[i][j-1][0],dp1[i-1][j])+V[i][j]);\n dp[i][j][2]=max(dp[i][j-1][2],dp[i][j-1][1]+V[i][j]);\n dp[i][j][3]=max(dp[i][j-1][3],dp[i][j-1][2]+V[i][j]);\n \n }dp1[i][j]=max(max(dp[i][j][0],dp[i][j][1]),max(dp[i][j][2],dp[i][j][3]));\n \n }cout<<dp1[R][C]<<endl;\n return 0;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int R = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n long[][] masu = new long[R][C];\n for (int i = 0; i < K; i++) {\n int r, c;\n long v;\n r = sc.nextInt() - 1;\n c = sc.nextInt() - 1;\n v = sc.nextLong();\n masu[r][c] = v;\n }\n long[][][] maxVal = new long[R][C][4];\n for (int r = 0; r < R; r++) {\n for (int c = 0; c < C; c++) {\n for (int k = 0; k < 4; k++) {\n maxVal[r][c][k] = 0;\n }\n }\n }\n for (int c = 0; c < C; c++) {\n maxVal[0][c][0] = 0;\n }\n for (int r = 0; r < R; r++) {\n for (int c = 0; c < C; c++) {\n if (c + 1 < C) {\n for (int k = 0; k < 3; k++) {\n maxVal[r][c + 1][k + 1] = Math.max(maxVal[r][c + 1][k + 1], Math.max(maxVal[r][c][k] + masu[r][c], maxVal[r][c][k + 1]));\n }\n }\n if (r + 1 < R) {\n for (int k = 0; k < 4; k++) {\n maxVal[r + 1][c][0] = calculateMax(masu[r][c], maxVal[r][c]);\n }\n }\n }\n }\n System.out.println(calculateMax(masu[R-1][C-1], maxVal[R-1][C-1]));\n }\n\n private static long calculateMax(long masuVal, long[] longs) {\n return Math.max(Math.max(longs[0]+ masuVal, longs[1]+ masuVal), Math.max(longs[2]+ masuVal, longs[3]));\n }\n}\n", "R, C, K = map(int, input().split())\n\nI = [[0 for _ in range(C+1)] for _ in range(R+1)]\nfor i in range(K): \n r, c, v = map(int, input().split())\n I[r][c] = v \n \nDP1 = [0 for _ in range(C+1)] #c行目までとったとき、c行目で1個以下とったときの最大\nDP2 = [0 for _ in range(C+1)] #c行目までとったとき、c行目で2個以下とったときの最大\nDP3 = [0 for _ in range(C+1)] #c行目までとったとき、c行目で3個以下とったときの最大\n#print(I)\n\nfor r in range(1,R+1):\n for c in range(1,C+1): \n #更新の順番に注意\n #mid = max(DP1[c], DP2[c], DP3[c]) + I[r][c]\n mid = DP3[c] + I[r][c] \n DP3[c] = max(DP3[c-1], mid, DP2[c-1] + I[r][c]) #3個\n DP2[c] = max(DP2[c-1], mid, DP1[c-1] + I[r][c]) #2個\n DP1[c] = max(DP1[c-1], mid) #1個\n #print(DP3)\n \nprint(DP3[C])\n \n \n ", "#include<bits/stdc++.h>\nusing namespace std;\nconst int N=3e3+10;\ntypedef long long ll;\nint n,m,d;\nll dp[N][N][4],a[N][N];\nint main(){\n\tscanf(\"%d%d%d\",&n,&m,&d);\n\tfor(int i=1,x,y,z;i<=d;i++){\n\t\tscanf(\"%d%d%d\",&x,&y,&z);\n\t\ta[x][y]=(ll)z;\n\t}\n\tfor(int i=1;i<=n;i++)\n\tfor(int j=1;j<=m;j++)\n\tfor(int k=1;k<=3;k++){\n\t\tdp[i][j][k]=max(dp[i-1][j][3]+a[i][j],max(dp[i][j-1][k-1]+a[i][j],dp[i][j-1][k]));\n\t}\n\tprintf(\"%lld\\n\",dp[n][m][3]);\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst int MAX_N = 3002;\nll dp[MAX_N][MAX_N][4];\nll v[MAX_N][MAX_N];\nint N, M, K;\n\nvoid solve()\n{\n\tdp[0][0][0]=0, dp[0][0][1]=v[0][0];\n\tfor(int i=0;i<N;++i)for(int j=0;j<M;++j){\n\t\tfor(int k=0;k<=3;++k){\n\t\t\tll cur = dp[i][j][k];\n\t\t\tif(i+1<N){ // down\n\t\t\t\tdp[i+1][j][0]=max(dp[i+1][j][0], cur);\n\t\t\t\tdp[i+1][j][1]=max(dp[i+1][j][1],cur+v[i+1][j]);\n\t\t\t}\n\t\t\tif(j+1<M){ //right\n\t\t\t\tdp[i][j+1][k]=max(dp[i][j+1][k],cur);\n\t\t\t\tif(k+1<=3) dp[i][j+1][k+1]=max(dp[i][j+1][k+1],cur+v[i][j+1]);\n\t\t\t}\n\t\t}\n\t}\n\tll ans = 0;\n\tfor(int i=0;i<=3;++i) ans=max(ans, dp[N-1][M-1][i]);\n\tcout<<ans;\n}\t\n\nint main()\n{\n\tint a, b, c;\n\tcin >> N >> M >> K;\n\tfor(int i=0;i<K;++i){\n\t\tcin >> a >> b >> c;\n\t\tv[a-1][b-1]=c;\n\t}\n\tsolve();\n\treturn 0;\n}", "R,C,K=map(int,input().split())\nf,g=range,max\nG=[[0]*(C+1)for i in f(R+1)]\nfor i in'_'*K:r,c,v=map(int,input().split());G[r][c]=v\nF=[[[0]*(C+1)for i in f(R+1)]for i in f(4)]\nfor r in f(1,R+1):\n\tfor x in f(1,4):\n\t\tfor c in f(1,C+1):F[x][r][c]=g(F[x-1][r][c-1]+G[r][c],F[x][r][c-1],(x<2)*(G[r][c]+g(F[1][r-1][c],F[2][r-1][c],F[3][r-1][c])))\nprint(g(F[1][R][C],F[2][R][C],F[3][R][C]))", "#!/usr/bin/env python3\nr, c, k = map(int, input().split())\nitems = [[0] * (c+1) for _ in range(r+1)]\nfor _ in range(k):\n R, C, V = map(int, input().split())\n items[R][C] = V\n\ndp0 = [[0] * (c+1) for _ in range(r+1)]\ndp1 = [[0] * (c+1) for _ in range(r+1)]\ndp2 = [[0] * (c+1) for _ in range(r+1)]\ndp3 = [[0] * (c+1) for _ in range(r+1)]\n\nfor i in range(1, r+1):\n for j in range(1, c+1):\n dp0[i][j] = max(dp0[i][j-1], dp0[i-1][j], dp1[i-1][j], dp2[i-1][j], dp3[i-1][j])\n dp1[i][j] = max(dp1[i][j-1], dp0[i-1][j] + items[i][j], dp1[i-1][j] + items[i][j], dp2[i-1][j] + items[i][j], dp3[i-1][j] + items[i][j], dp0[i][j-1] + items[i][j])\n dp2[i][j] = max(dp2[i][j-1], dp1[i][j-1] + items[i][j])\n dp3[i][j] = max(dp3[i][j-1], dp2[i][j-1] + items[i][j])\n\nans = max(dp0[r][c], dp1[r][c], dp2[r][c], dp3[r][c])\nprint(ans)", "#include <iostream>\n#include <algorithm>\ntypedef long long ll;\nusing namespace std;\n\nll dp[3010][3010][4]={}, item[3010][3010]={};\n\nint main() {\n\tint R, C, K;\n\tcin >> R >> C >> K;\n\tfor(int i=0; i<K; ++i){\n\t\tint r, s;\n\t\tll v;\n\t\tcin >> r >> s >> v;\n\t\titem[r][s]=v;\n\t}\n\tfor(int i=1; i<=R; ++i){\n\t\tfor(int j=1; j<=C; ++j){\n\t\t\tfor(int k=0; k<=3; ++k){\n\t\t\t\tdp[i][j][0]=max(dp[i][j][0], dp[i-1][j][k]);\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k], dp[i][j-1][k]);\n\t\t\t}\n\t\t\tif(item[i][j]){\n\t\t\t\tfor(int k=2; k>=0; --k){\n\t\t\t\t\tdp[i][j][k+1]=max(dp[i][j][k+1], dp[i][j][k]+item[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tll ans=0;\n\tfor(int i=0; i<=3; ++i) ans=max(ans, dp[R][C][i]);\n\tcout << ans << endl;\n\treturn 0;\n}", "R, C, K = map(int, input().split())\n\nV = [[0]*(C+1) for _ in range(R+1)]\nfor _ in range(K):\n r, c, v = map(int, input().split())\n V[r][c] = v\n\npre = [[0]*(3+1) for _ in range(C+1)]\nfor i in range(R+1):\n now = [[0]*(3+1) for _ in range(C+1)]\n for j in range(C+1):\n for k in range(3+1):\n if i-1 >= 0:\n now[j][0] = max(now[j][0], pre[j][k])\n now[j][1] = max(now[j][1], pre[j][k] + V[i][j])\n\n if j-1 >= 0:\n now[j][k] = max(now[j][k], now[j-1][k])\n if k-1 >= 0:\n now[j][k] = max(now[j][k], now[j-1][k-1] + V[i][j])\n pre = now\n\nprint(max(now[C]))\n", "#include <bits/stdc++.h>\n#define roop(i, n) for(int i = 0; i < (n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n#define chmax(x, y) { x = max(x, y); }\n\nint a[3005][3005];\nll dp[3005][3005][4];\n\nint main() {\n int R, C, K;\n cin >> R >> C >> K;\n roop(i, K){\n int r, c, v;\n cin >> r >> c >> v;\n a[r - 1][c - 1] = v; //各マスのアイテム\n }\n roop(i, R){\n roop(j, C){\n for(int k = 2; k >= 0; k--){\n chmax(dp[i][j][k + 1], dp[i][j][k] + a[i][j]);\n }\n roop(k, 4){\n chmax(dp[i + 1][j][0], dp[i][j][k]);\n chmax(dp[i][j + 1][k], dp[i][j][k]);\n }\n }\n }\n ll ans = 0;\n roop(k, 4){\n chmax(ans, dp[R - 1][C - 1][k]);\n }\n cout << ans << endl;\n return 0;\n}", "import sys\ninput = sys.stdin.buffer.readline\n\ndef main():\n R, C, K = map(int, input().split())\n State = [[0]*R for _ in range(C)]\n for _ in range(K):\n r, c, v = map(int, input().split())\n State[c-1][r-1] += v\n\n dp = [[0]*4 for _ in range(C+1)]\n\n for r in range(R):\n ndp = [[0]*4 for _ in range(C+1)]\n for c in range(C):\n ndp[c+1][0] = max(ndp[c+1][0], max(dp[c+1]))\n ndp[c+1][1] = ndp[c+1][0] + State[c][r]\n for n in range(4):\n if ndp[c][n] > ndp[c+1][n]:\n ndp[c+1][n] = ndp[c][n]\n if n < 3 and ndp[c][n] + State[c][r] > ndp[c+1][n+1]:\n ndp[c+1][n+1] = ndp[c][n] + State[c][r]\n dp = ndp\n \n print(max(dp[C]))\n\nif __name__ == \"__main__\":\n main()", "import java.util.*;\nimport java.io.*;\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n static PrintWriter out = new PrintWriter(System.out);\n static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n long mod = 998244353;\n List<Integer>[] tree;\n ArrayList<Integer> ans;\n public static void main(String[] args) throws Exception {\n Main main = new Main();\n // int t = sc.nextInt();\n int t= 1;\n while(t-->0){\n out.println(main.solve());\n }\n out.flush();\n }\n long solve() throws Exception{\n int H = sc.nextInt(), W = sc.nextInt(), K = sc.nextInt();\n long[][] rec = new long[H+1][W+1];\n long[][] rowMax = new long[H+1][W+1];\n for(int i=0; i<K; i++){\n int r = sc.nextInt(), c = sc.nextInt(), v = sc.nextInt();\n rec[r][c] = v;\n }\n long[][][] res = new long[H+1][W+1][4];\n for(int i=1; i<=H;i++){\n for(int j=1;j<=W;j++){\n long maxi = 0;\n for(int k=0; k<4;k++) maxi = Math.max(maxi, res[i-1][j][k]);\n res[i][j][0] = maxi;\n for(int k=1; k<4;k++) res[i][j][k] = res[i][j-1][k];\n if(rec[i][j]!=0){\n // another possibility\n res[i][j][1] = Math.max(res[i][j][1], res[i][j][0]+rec[i][j]);\n res[i][j][2] = Math.max(res[i][j][2], res[i][j-1][1]+rec[i][j]);\n res[i][j][3] = Math.max(res[i][j][3], res[i][j-1][2]+rec[i][j]);\n }\n }\n }\n long ans = 0;\n for(int i=0; i<4;i++) ans = Math.max(ans, res[H][W][i]);\n return ans;\n }\n int paIn(String s){return Integer.parseInt(s);}\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nconst int N=3e3+20;\n\nint n,m,k,x,y,v,a[N][N];\nlong long dp[N][N][4];\n\nint main()\n{\n\tscanf(\"%d%d%d\",&n,&m,&k);\n\twhile(k--)\n\t{\n\t\tscanf(\"%d%d%d\",&x,&y,&v);\n\t\ta[x][y]=v;\n\t}\n\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=1;j<=m;j++)\n\t\t{\n\t\t\tlong long pv=0;\n\t\t\tfor(int k=1;k<=3;k++) pv=max(pv,dp[i-1][j][k]+a[i][j]);\n\t\t\tfor(int k=1;k<=3;k++)\n\t\t\t{\n\t\t\t\tdp[i][j][k]=max(pv,dp[i][j-1][k]);\n\t\t\t\tdp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k-1]+a[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\n\tlong long ans=0;\n\tfor(int k=1;k<=3;k++) ans=max(ans,dp[n][m][k]);\n\tprintf(\"%lld\",ans);\n}", "#include<bits/stdc++.h>\nusing namespace std;\n \n#define INF 1234567890\n#define ll long long\n\nint N, M, K;\nint g[3030][3030];\nll dp[3030][3030][4];\n\nint main()\n{\n\tscanf(\"%d %d %d\", &N, &M, &K);\n\tfor(int i=1; i<=K; i++)\n\t{\n\t\tint y, x, val;\n\t\tscanf(\"%d %d %d\", &y, &x, &val);\n\t\tg[y][x] = val;\n\t}\n\tfor(int i=1; i<=N; i++)\n\t\tfor(int j=1; j<=M; j++)\n\t\t\tfor(int k=0; k<=3; k++)\n\t\t\t{\n\t\t\t\tll &ret = dp[i][j][k];\n\t\t\t\tif (i == 1 && j == 1)\n\t\t\t\t{\n\t\t\t\t\tif (k != 3) ret = g[i][j];\n\t\t\t\t\telse ret = 0;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (i > 1)\n\t\t\t\t{\n\t\t\t\t\tret = max(ret, dp[i-1][j][0]);\n\t\t\t\t\tif (k != 3) ret = max(ret, dp[i-1][j][0] + g[i][j]);\n\t\t\t\t}\n\t\t\t\tif (j > 1)\n\t\t\t\t{\n\t\t\t\t\tret = max(ret, dp[i][j-1][k]);\n\t\t\t\t\tif (k != 3) ret = max(ret, dp[i][j-1][k+1] + g[i][j]);\n\t\t\t\t}\n\t\t\t}\n\tprintf(\"%lld\", dp[N][M][0]);\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nconst int N=3e3+5;\nint a[N][N];long long f[N][N][3];\nint main(){\n\tint r,c,k,x,y,z;scanf(\"%d%d%d\",&r,&c,&k);\n\tfor(int i=0;i<k;i++){\n\t\tscanf(\"%d%d%d\",&x,&y,&z);\n\t\ta[x][y]=z;\n\t}\n\tfor(int i=1;i<=r;i++){\n\t\tfor(int j=1;j<=c;j++){\n\t\t\tfor(int k=0;k<3;k++){\n\t\t\t\tf[i][j][k]=max(f[i-1][j][2],(k?f[i][j-1][k-1]:0))+a[i][j];\n\t\t\t\tf[i][j][k]=max(f[i][j][k],f[i][j-1][k]);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\",f[r][c][2]);\n\treturn 0;\n}", "# -*- coding: utf-8 -*-\nimport sys\nfrom collections import defaultdict\nR,C,K=map(int, sys.stdin.readline().split())\n\nvalue=defaultdict(lambda: 0)\nvalue=[ [0 for _ in range(C+1)] for __ in range(R+1) ]\nfor _ in range(K):\n r,c,v=map(int, sys.stdin.readline().split())\n value[r][c]=v\n\ndp0=[0]*(C+1)\ndp1=[0]*(C+1)\ndp2=[0]*(C+1)\ndp3=[0]*(C+1)\n\nfor r in range(1,R+1):\n for c in range(1,C+1):\n #今のマスにアイテムがある場合\n if 0<value[r][c]:\n dp3[c]=max( dp3[c-1], dp2[c-1]+value[r][c] )\n dp2[c]=max( dp2[c-1], dp1[c-1]+value[r][c] )\n dp1[c]=max( dp1[c-1], dp0[c-1]+value[r][c], dp0[c]+value[r][c] )\n dp0[c]=max( dp0[c-1], dp0[c] )\n #今のマスにアイテムがない場合\n else:\n #dp0[c]=max( dp0[c-1], dp0[c] )\n #dp1[c]=max( dp1[c-1], dp1[c] )\n #dp2[c]=max( dp2[c-1], dp2[c] )\n #dp3[c]=max( dp3[c-1], dp3[c] )\n dp0[c]=dp0[c]\n dp1[c]=dp1[c-1]\n dp2[c]=dp2[c-1]\n dp3[c]=dp3[c-1]\n\n #上の行にアイテムをコピー\n for c in range(1,C+1):\n dp0[c]=max( dp0[c], dp1[c], dp2[c], dp3[c] )\n dp1=[0]*(C+1)\n dp2=[0]*(C+1)\n dp3=[0]*(C+1)\n\nprint dp0[C]\n", "#!/usr/bin/env python3\n\ndef main():\n R, C, K = map(int, input().split())\n S = [[0]*(C+1) for _ in range(R+1)]\n for i in range(K):\n r, c, v = map(int, input().split())\n S[r][c] = v\n\n dp = [[[0]*(C+1) for _ in range(R+1)] for _ in range(4)]\n\n for i in range(1,R+1):\n for j in range(1,C+1):\n V = S[i][j]\n for k in range(4):\n dp[0][i][j] = max(dp[0][i][j], dp[k][i-1][j])# アイテムを取らないで下に進む\n dp[1][i][j] = max(dp[1][i][j], dp[k][i-1][j] + V)# アイテムを取って下に進む\n dp[k][i][j] = max(dp[k][i][j], dp[k][i][j-1])# アイテムを取らないで右に進む\n if k > 0:\n dp[k][i][j] = max(dp[k][i][j], dp[k-1][i][j-1] + V)# アイテムを取って右に進む\n ans = 0\n for k in range(4):\n ans = max(ans, dp[k][R][C])\n print(ans)\n\nif __name__ == \"__main__\":\n main()" ]
We have three boxes A, B, and C, each of which contains an integer. Currently, the boxes A, B, and C contain the integers X, Y, and Z, respectively. We will now do the operations below in order. Find the content of each box afterward. * Swap the contents of the boxes A and B * Swap the contents of the boxes A and C Constraints * 1 \leq X,Y,Z \leq 100 * All values in input are integers. Input Input is given from Standard Input in the following format: X Y Z Output Print the integers contained in the boxes A, B, and C, in this order, with space in between. Examples Input 1 2 3 Output 3 1 2 Input 100 100 100 Output 100 100 100 Input 41 59 31 Output 31 41 59
[ "X, Y, Z = map(int,input().split())\n\nprint(Z, X, Y)", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main()\n{\n\tll a,b,c;\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b;\t\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int a, b, c;\n cin >> a >> b >> c;\n cout << c << \" \" << a << \" \" << b << \"\\n\";\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{int a,b,c;\ncin>>a>>b>>c;\nswap(a,b);\nswap(a,c);\ncout<<a<<' '<<b<<' '<<c;}", "#include <iostream>\n\n\nint main() {\n\tint X, Y, Z;\n\tstd::cin >> X >> Y >> Z;\n\n\tstd::cout << Z << \" \" << X << \" \" << Y;\n}\n", "#include<iostream>\nusing namespace std;\nint main()\n{\n\tint a,b,c;\tcin>>a>>b>>c;\n\tswap(a,b) , swap(a,c);\n\tcout<<a<<\" \"<<b<<\" \"<<c<<endl;\n}", "x, y, z = map(int, input().split())\nprint(z,x,y)", "#include<iostream>\n\nint main() {\n int a, b, c; std::cin >> a >> b >> c;\n \n std::cout << c << \" \" << a << \" \" << b << \"\\n\";\n}", "\n\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint x = Integer.parseInt(sc.next());\n\t\tint y = Integer.parseInt(sc.next());\n\t\tint z = Integer.parseInt(sc.next());\n\n\t\tSystem.out.println(z + \" \" + x + \" \" + y);\n\t}\n\n}\n", "x, y, z = map(int, raw_input().split())\n \nprint(str(z)+\" \"+str(x)+\" \"+str(y))", "a,b,c = input().split()\nprint(' '.join([c,a,b]))", "s=input().split()\nprint(\"%s %s %s\" % (s[2],s[0],s[1]))", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\t\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint x = scan.nextInt();\n\t\tint y = scan.nextInt();\n\t\tint z = scan.nextInt();\n\t\t\n\t\tSystem.out.println(z+\" \"+x+\" \"+y);\n\t}\n\n}\n", "import java.util.*;\npublic class Main{\n \n public static void main(String[] args) {\nScanner scanner=new Scanner(System.in);\nString a=scanner.next();\nString b =scanner.next();\nString c =scanner.next();\n\nSystem.out.print(c+\" \"+ a+ \" \"+b);\n }\n\n\n}", "a,b,c=input().split()\nprint(\"{} {} {}\".format(c,a,b))", "*s,c=input().split();print(c,*s)", "x,y,z = (int(x) for x in input().split())\n\nprint(z,x,y)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int X = scan.nextInt();\n int Y = scan.nextInt();\n int Z = scan.nextInt();\n scan.close();\n\n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n}", "N,X,Y=map(int,input().split())\nprint(Y,N,X)", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tlong long q,w,e;\n\tcin>>q>>w>>e;\n\tcout<<e<<\" \"<<q<<\" \"<<w;\n}", "X, Y, Z = input().split()\nprint(Z+' '+X+' '+Y)", "x,y,z = map(int, input().split())\nprint(*[z,x,y])", "a,b,c = [int(x) for x in input().split()]\nprint(c,a,b)", "a, b, c = map(str, input().split())\n\nprint(c+' '+a+' '+b)", "[X,Y,Z] = input().split()\nprint(Z+' '+X+' '+Y)", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n long X,Y,Z;cin >>X>>Y>>Z;\n cout<<Z<<\" \"<<X<<\" \"<<Y<<endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nint main()\n{\n\tcin>>a>>b>>c;\n\tcout<<c<<' '<<a<<' '<<b;\n\treturn 0;\n}", "x,y,z=map(int,input().split())\nres = [z,x,y]\nprint(*res)", "X,Y,Z=map(int, raw_input().split())\nX,Y=Y,X\nX,Z=Z,X\nprint X,Y,Z", "import java.util.*;\npublic class Main{\n public static void main (String args[]){\n Scanner sc = new Scanner(System.in);\n \n int b = sc.nextInt();\n int c = sc.nextInt();\n int a = sc.nextInt();\n \n System.out.println(a + \" \" + b + \" \" + c);\n }\n}", "a = input().split()\nprint(a[2], a[0], a[1])", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a=sc.nextInt(),b=sc.nextInt(),c=sc.nextInt();\n sc.close();\n System.out.printf(\"%d %d %d\\n\",c,a,b);\n }\n}", "x,y,z=[int(i) for i in input().split()]\n\nprint(z,x,y)", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint x,y,z;\nint main(){\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n}", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n int i,j,k;\n cin>>i>>j>>k;\n cout<<k<<\" \"<<i<<\" \"<<j;\n \n return 0;\n}", "#include <iostream>\n#include <vector>\nusing namespace std;\nint main(void){\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n}", "a,sd,f=map(int,input().split())\nprint(f,a,sd)", "#include <iostream>\nusing namespace std;\n\nint main(){\n\n\tint x,y,z;\n\tcin >> x >> y >> z;\n\tcout << z <<' '<< x << ' ' << y;\n\treturn 0;\n}\n", "X, Y, Z = map(int, input().split())\n# Z X Y\nprint(Z,X,Y)", "\nimport java.util.Scanner;\n\npublic class Main { \n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n String x = scanner.next();\n String y = scanner.next();\n String z = scanner.next();\n\n System.out.println(z + \" \" + x + \" \" + y);\n\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<z<<\" \"<<x<<\" \"<<y<<endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n final Scanner input = new Scanner(System.in);\n\n int a,b,c;\n a = input.nextInt();\n b = input.nextInt();\n c = input.nextInt();\n\n System.out.printf(\"%d %d %d\",c,a,b);\n }\n}\n", "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] argv) {\n Scanner sc = new Scanner(System.in);\n String[] ints = sc.nextLine().split(\" \");\n System.out.println(ints[2] + \" \" + ints[0] +\" \" + ints[1]);\n }\n}", "#include<bits/stdc++.h> //ABC 161_a\nusing namespace std;\nint main(){\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<z<<\" \"<<x<<\" \"<<y;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a,b,c;\n cin>>a>>b>>c;\n printf(\"%d %d %d\",c,a,b);\n \n}", "XYZ = input().split()\nprint(XYZ[2], XYZ[0], XYZ[1])\n", "X,Y,Z = input().split()\ns = Z +' '+ X + ' ' + Y\nprint(s)", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt(); \n\t System.out.println(c);\n System.out.println(a);\n System.out.println(b);\n\t}\n}", "#include<bits/stdc++.h>\nint main()\n{\n int a,b,c;\n scanf(\"%d%d%d\",&a,&b,&c);\n printf(\"%d %d %d\\n\",c,a,b);\n return 0;\n}\n", "A,B,C = list(map(int,input().split(\" \")))\n\nprint(C,A,B)", "a,b,c=input().split()\nprint(c+\" \"+a+\" \"+b)", "import java.util.*;\nclass Main\n{\n public static void main(String args[])\n {\n Scanner sc=new Scanner(System.in);\n int x=sc.nextInt();\n int y=sc.nextInt();\n int z=sc.nextInt();\n System.out.println(z+\" \"+x+\" \"+y);\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int A,B,C;\n cin>>A>>B>>C;\n cout<<C<<\" \"<<A<<\" \"<<B;\n}", "X,Y,Z = map(int, input().split())\n\nprint(Z,X,Y,sep=\" \")", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nint main(){\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tprintf(\"%d %d %d\",c,a,b);\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\n\t\tint x=s.nextInt(), y=s.nextInt(), z=s.nextInt();\n\t\tint a,b,c;\n\t\ta=y;\n\t\tb=x;\n\t\tc=a;\n\t\ta=z;\n\t\tSystem.out.println(a+\" \"+b+\" \"+c);\n\n\t}\n\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<' '<<x<<' '<<y;\n \n}", "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int X = scan.nextInt();\n int Y = scan.nextInt();\n int Z = scan.nextInt();\n \n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n \n}", "#include<stdio.h>\n\nint main()\n{\n\tint A, B, C;\n\tscanf(\"%d %d %d\", &A, &B, &C);\n\t\n\tprintf(\"%d %d %d\", C, A, B);\n\t\n}\n\n", "x,y,z=map(int,input().split())\nlst=[z,x,y]\nprint(*lst)", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tSystem.out.println(a + \" \" + b + \" \" + c);\n\n\t}\n\n}\n", "Y,Z,X = input().split()\nprint(X,Y,Z)", "A,B,C = (int(x) for x in input().split())\nprint(C,A,B)\n", "import java.util.*;\n\nclass Main{\npublic static void main(String[] args) {\n Scanner reader=new Scanner(System.in);\n int x=reader.nextInt();\n int y=reader.nextInt();\n int z=reader.nextInt();\n System.out.println(z+\" \"+x+\" \"+y);\n}\n }\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\ttry(Scanner sc = new Scanner(System.in)) {\n\t\t\t\n\t\t\tint a = sc.nextInt();\n\t\t\tint b = sc.nextInt();\n\t\t\tint c = sc.nextInt();\n\t\t\t\n\t\t\tSystem.out.println(String.format(\"%d %d %d\", c, a, b));\n\t\t}\n\t}\n\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a,b,c;\n\t cin>>a>>b>>c;\n\t cout<<c<<\" \"<<\" \"<<a<<\" \"<<b; \n}\n", "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args) {\n Scanner kbd = new Scanner(System.in);\n int a=kbd.nextInt();\n int b=kbd.nextInt();\n int c=kbd.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n\n }}\n", "#include <bits/stdc++.h>\nint a, b, c;\nint main() {\n\tstd::cin >> a >> b >> c;\n\tstd::cout << c << ' ' << a << ' ' << b << '\\n';\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n System.out.print(z+\" \"+x+\" \"+y);\n }\n}\n", "a=input()\na,b,c=a.split(\" \")\nprint(c,a,b)", "#include<stdio.h>\n#include<iostream>\n\nint main(){\n int X,Y,Z;\n scanf(\"%d %d %d\",&X,&Y,&Z);\n printf(\"%d %d %d\\n\",Z,X,Y);\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner kb = new Scanner(System.in);\n\t\tint x = kb.nextInt();\n\t\tint y = kb.nextInt();\n\t\tint z = kb.nextInt();\n\t\tSystem.out.println(z + \" \" + x + \" \" + y);\n\t\tkb.close();\n\t}\n\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args ) throws Exception {\n Scanner sc = new Scanner(System.in);\n int X = sc.nextInt();\n int Y = sc.nextInt();\n int Z = sc.nextInt();\n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n}", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n\n System.out.printf(\"%d %d %d\", c, a, b);\n }\n}", "import java.util.*;\n\npublic class Main{\n\n\tpublic static void main(String[] args){\n\t\tScanner s = new Scanner(System.in);\n\t\tint a = s.nextInt();\n\t\tint b = s.nextInt();\n\t\tint c = s.nextInt();\n\t\t\n\t\tint tmp = a;\n\t\ta =b;\n\t\tb=tmp;\n\t\t\n\t\ttmp=a;\n\t\ta=c;\n\t\tc=tmp;\n\t\t\n\t\tSystem.out.println(a+\" \"+b+\" \"+c);\n\t\t\n\t}\n\n}", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t\tScanner cin = new Scanner(System.in);\n\t\t\n\t\tint X,Y,Z;\n\t\t\n\t\tX = cin.nextInt();\n\t\tY = cin.nextInt();\n\t\tZ = cin.nextInt();\n\t\t\n\t\tSystem.out.printf(\"%d %d %d\",Z,X,Y);\n\n\t}\n\n}\n", "import java.util.*;\npublic class Main{\npublic static void main(String[] args) throws Exception{\n \tScanner sc = new Scanner(System.in);\n \tint a,b,c;\n \ta = sc.nextInt();\n \tb = sc.nextInt();\n \tc = sc.nextInt();\n \tSystem.out.println(c + \" \" + a + \" \" + b);\n }\n}", "a,b,c=map(int, input().split(\" \"))\nprint(c,a,b)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int X,Y,Z;\n\n cin>>X>>Y>>Z;\n\n printf(\"%d %d %d\\n\",Z,X,Y);\n\n} ", "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a=sc.nextInt(),b=sc.nextInt(),c=sc.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint x,y,z;\nint main()\n{\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y<<endl;\n} ", "x= input().split()\nprint(x[2],x[0],x[1])", "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args){\n Scanner scn = new Scanner(System.in);\n String a = scn.next();\n String b = scn.next();\n String c = scn.next();\n scn.close();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n}\n", "import java.util.*;\npublic class Main {\n public static void main(final String[] args) {\n final Scanner sc = new Scanner(System.in);\n\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n\n sc.close();\n System.out.println(C + \" \" + A + \" \" + B);\n }\n}", "x,y,z = input().split()\n\na = z\nb = x\nc = y\n\nprint(a,b,c)", "import java.util.Scanner; \n\nclass Main{\n\n public static void main(String[] args){\n\n Scanner scan = new Scanner(System.in);\n\n int A = scan.nextInt();\n int B = scan.nextInt();\n int C = scan.nextInt();\n \n int w = A;\n A = B;\n B = w;\n w = A;\n A = C;\n C = w;\nSystem.out.println(A+\" \"+B+\" \"+C);\n\n }\n}", "x, y, z = map(int, raw_input().strip().split())\nprint z, x, y", "nums = input().split()\nprint(nums[2], *nums[:2])\n", "a, b, c = map(int, input().split())\nprint(*[c,a,b])", "X,Y,Z = input().split()\nprint(\" \".join([Z,X,Y]))", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n\tll x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<z<<' '<<x<<' '<<y;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<z<<' '<<x<<' '<<y<<endl;\n\treturn 0;\n} \n", "a,b,c=map(int,input().split());print(c,a,b)", "#include <iostream> \nusing namespace std;\n\nint main(){\n int a,b,c ;\n cin >> a>> b>> c;\n cout << c << \" \" << a << \" \" << b << endl ;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int x, y, z;\n cin >> x >> y >> z;\n printf(\"%d %d %d\", z, x, y);\n}\n", "a,b,c = map(int, input().split())\t\t# 5 7 2\nprint(c,a,b)\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n System.out.println(c + \" \" + a + \" \" + b);\n }\n\n\n}\n\n// x * 3 <= 16", "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String args[]){\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tString a = sc.next();\n\t\tString b = sc.next();\n\t\tString c = sc.next();\n\t\t\n\t\tSystem.out.println(c+\" \"+a+\" \"+b); \n\t}\n}", "X, Y, Z = list(map(int, input().split()))\n\nprint(Z, X, Y)", "#include <bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nint main(){\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b;\n\treturn 0;\n}\n", "#include <iostream>\nusing namespace std;\n\nint x, y, z;\n\nint main(){\n cin >> x >> y >> z;\n printf(\"%d %d %d\", z, x, y);\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint x,y,z;\n\nint main() {\n\tcin>>x>>y>>z;\n\tcout<<z<<' '<<x<<' '<<y<<endl;\n\treturn 0;\n} ", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n,m,z;\n\tcin>>n>>m;\n\tcin>>z;\n\tcout<<z<<' '<<n<<' '<<m<<endl; \n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint n,m,c;\n\tcin>>n>>m>>c;\n\tcout<<c<<\" \"<<n<<\" \"<<m;\n\t\n\t return 0;\n}", "X, Y, Z = map(str, input().split())\n\nprint(Z, X, Y)\n", "#include<iostream>\nusing namespace std;\nint main()\n{\nint x,y,z;\ncin >> x >> y >> z;\ncout << z << ' ' << x << ' ' << y;\n}\n", "a, b, c = list(input().split())\n\nprint(c+' '+a+' '+b)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int T = s.nextInt();\n int m=s.nextInt();\n int c=s.nextInt();\n System.out.println(c+\" \"+T+\" \"+m);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int X = scanner.nextInt();\n int Y = scanner.nextInt();\n int Z = scanner.nextInt();\n System.out.printf(\"%d %d %d\\n\", Z, X, Y);\n }\n}\n", "#include<iostream>\nusing namespace std;\n\nint main() {\n int A, B, C;\n cin >> A >> B >> C; \n cout << C << \" \" << A << \" \" << B;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n string x, y, z;\n cin >>x >>y >>z;\n cout <<z+\" \" <<x+\" \" <<y <<endl;\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String A = sc.next();\n String B = sc.next();\n String C = sc.next();\n\n System.out.println(C + \" \" + A + \" \" + B);\n }\n}\n", "#include<iostream>\nusing namespace std;\nint main()\n{\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n}", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int X, Y, Z;\n cin >> X >> Y >> Z;\n \n cout << Z << \" \" << X << \" \" << Y;\n}", "import java.util.Scanner;\npublic class Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int i,j,k,l,m,n,x,y,z;\n x=sc.nextInt();\n y=sc.nextInt();\n z=sc.nextInt();\n System.out.println(z+\" \"+x+\" \"+y);\n \n }\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n int X,Y,Z;\n cin>>X>>Y>>Z;\n cout<<Z<<' '<<X<<' '<<Y<<endl;\n}\n \n", "x,y,z=input().split();print(z,x,y)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn =new Scanner(System.in);\n\t\tint X = scn.nextInt(), Y =scn.nextInt(), Z = scn.nextInt();\n\t\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n\n\t}\n\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n // 整数の入力\n int X = sc.nextInt();\n int Y = sc.nextInt();\n int Z = sc.nextInt();\n\n // 出力\n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n}\n", "x,y,z=map(int,input().split())\nprint(z,x,y,sep=\" \")", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int x,y,z;\n cin>>x>>y>>z;\n \n cout<<z<<\" \"<<x<<\" \"<<y<<\"\\n\";\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b;\n return 0;\n \n}", "k=list(input().split(' '))\nprint(k[2]+\" \"+k[0]+\" \"+k[1])", "import java.util.*;\n\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n int X = sc.nextInt();\n int Y = sc.nextInt();\n int Z = sc.nextInt();\n\n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n}\n", "x,y,z=input().split()\nprint(z,x,y, sep=\" \")", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\t\n\tcout<<c<<\" \"<<a<<\" \"<<b<<endl;\n}\n\n\n//なぜWA?", "x,y,z = input().split()\nprint(z + ' ' + x + ' ' + y)", "s=input().split()\nprint(\" \".join([s[2],s[0],s[1]]))", "import java.util.*;\nimport java.lang.Math.*;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\tint c=sc.nextInt();\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t}\n}", "s = input().split()\n\nprint(s[2]+\" \"+s[0]+\" \"+s[1])", "#include <stdio.h>\n\nint main(){\n\tint a,b,c;\n\twhile(~scanf(\"%d %d %d\",&a,&b,&c))\n\t printf(\"%d %d %d\\n\",c,a,b);\n\treturn 0;\n} ", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint a,b,c;\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tprintf(\"%d %d %d\\n\",c,a,b);\n} ", "#include <bits/stdc++.h>\nusing namespace std;\nint main () {\n long long a,b,c;\n cin>>a>>b>>c;\n \n cout<<c<<\" \"<<a<<\" \"<<b<<endl;\n}", "#include<bits/stdc++.h>\n#include<iostream>\nusing namespace std;\nint main()\n{\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<z<<\" \"<<x<<\" \"<<y;\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n int X = sc.nextInt();\n int Y = sc.nextInt();\n int Z = sc.nextInt();\n int a = Z;\n int b = X;\n int c = Y;\n System.out.println(a+\" \"+b+\" \"+c);\n }\n}", "X, Y, Z = map(str, input().split())\nprint(Z+\" \"+X+\" \"+Y)", "import java.util.Scanner;\nclass Main{\n\tpublic static void main(String[] args){\n \tScanner console = new Scanner(System.in);\n \tint X = console.nextInt();\n int Y = console.nextInt();\n int Z = console.nextInt();\n System.out.println(Z + \" \" + X + \" \" + Y);\n\t}\n\t\n}", "import java.util.*;\nimport java.math.*;\n \npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n int x = cin.nextInt();\n int y = cin.nextInt();\n int z = cin.nextInt();\n System.out.println(z+\" \"+x+\" \"+y);\n }\n}\n", "#include <iostream>\nusing namespace std;\nint main(void){\n int a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b<<endl;\n \n}\n", "X,Y,Z=map(int,input().split());print(Z,X,Y)", "\nimport java.util.Scanner;\nclass Main{\npublic static void main(String[]args){\n\nScanner sc= new Scanner(System.in);\nint X =sc.nextInt();\nint Y =sc.nextInt();\nint Z =sc.nextInt();\n\n\nint num=Y;\nY = X;\nint ans =Z;\nZ = num;\n\nSystem.out.println(ans);\nSystem.out.println(Y);\nSystem.out.println(Z);\n\n}\n}", "X,Y,Z = map(int,input().split(' '))\nprint(Z,X,Y)", "#include <stdio.h>\nint main(){int a,b,c,t;scanf(\"%d%d%d\",&a,&b,&c);t=a,a=b,b=t,t=a,a=c,c=t;return printf(\"%d %d %d\\n\",a,b,c),0;}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n\n System.out.println(C + \" \" + A + \" \" + B);\n }\n}", "lis = input().split()\nprint(lis[2],lis[0],lis[1])", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int x = scanner.nextInt();\n int y = scanner.nextInt();\n int z = scanner.nextInt();\n\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "X,Y,Z = map(int, input().split())\n#Y X Z\nprint(Z,X,Y)\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\t// 入力値の取得\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\t\n\t\t// 結果の出力\n\t\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n\n\t\tsc.close();\n\t}\n}\n", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\tScanner sc=new Scanner (System.in);\n\tint a=sc.nextInt();\n\tint b=sc.nextInt();\n\tint c=sc.nextInt();\n\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t\t\n\t}\n\n}", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\n\t\tSystem.out.print(C + \" \" + A + \" \" + B);\n\t\t\t\n\treturn;\n\n\t}\n}", "n = list(map(int,input().split()))\nprint(n[2],n[0],n[1])", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nlong long a,b,c;\n\nint main(){\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b;\n}\n ", "import java.util.*;\npublic class Main {\n\n\n public static void main(String[] args) {\n Scanner in=new Scanner(System.in);\n int a =in.nextInt();\n int b=in.nextInt();\n int c=in.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n}\n\n", "abc = input().split()\nprint(abc[2], abc[0], abc[1])", "a,b,c=map(int,input().split())\nprint(c,a,b)", "#include<bits/stdc++.h> //ABC 161_a\nusing namespace std;\nint main(){\n\tint x,y,z,t;\n\tcin>>x>>y>>z;\n\tcout<<z<<\" \"<<x<<\" \"<<y;\n\treturn 0;\n}", "#abc161a\nx,y,z=map(int,raw_input().split())\nx,y=y,x\nx,z=z,x\nprint x,y,z\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n int x,y,z;\n cin >> x >> y >> z;\n cout<<z<<\" \"<<x<<\" \"<<y<<\" \"<<endl;\n \n}", "x, y,z = map(int,input().split(' '))\nprint(z,x,y)", " import java.util.*;\n public class Main {\n \tpublic static void main(String[] args){\n \t\tScanner sc = new Scanner(System.in);\n \t\tint a = sc.nextInt();\n \t\tint b = sc.nextInt();\n \t\tint c = sc.nextInt();\n \t\tSystem.out.print(c+\" \"+a+\" \"+b);\n\n \t}\n }", "a,b,c = map(int, input().strip().split())\nprint(c,a,b)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int X, Y, Z; cin >> X >> Y >> Z;\n printf(\"%d %d %d\", Z, X, Y);\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int X = sc.nextInt();\n int Y = sc.nextInt();\n int Z = sc.nextInt();\n sc.close();\n\n String ans = Z + \" \" + X + \" \" + Y;\n System.out.println(ans);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String [] args){\n Scanner scn= new Scanner(System.in);\n int a=scn.nextInt();\n int b=scn.nextInt();\n int c =scn.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n\t}}", "X, Y, Z=(int(x) for x in input().split())\nprint(Z, X, Y)", "a = list(map(int, input().split()))\nprint(a[2],a[0],a[1])", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt(); int y = sc.nextInt(); int z = sc.nextInt();\n System.out.println(z + \" \" + x + \" \" + y);\n sc.close();\n }\n}", "inp = input().split()\nprint(inp[2], inp[0], inp[1])", "x, y, z = list(map(int, input().split()))\nprint(z, x, y)", "a,b,c = input().split()\nprint(\" \".join((c,a,b)))", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String[] K = sc.nextLine().split(\" \");\n System.out.println(K[2] + \" \" + K[0] + \" \" + K[1]);\n }\n}\n", "X,Y,Z = map(str,input().split())\nprint(Z+' '+X+' '+Y)", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String x = sc.next();\n String y = sc.next();\n String z = sc.next();\n\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}\n", "a = input()\n\na, b, c = a.split()\n\nprint(c, a, b)\n", "x, y, z= input().split()\nw=z\nz=y\ny=x\nx=w\nprint(x, y, z)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long X,Y,Z;cin>>X>>Y>>Z;\n cout<<Z<<\" \"<<X<<\" \"<<Y;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\n\t\tSystem.out.print(c + \" \");\n\t\tSystem.out.print(a + \" \");\n\t\tSystem.out.print(b);\n\t\tsc.close();\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b;\n}\n", "import java.util.Scanner;\n\nclass Main{\n public static void main(String args[]){\n int x,y,z;\n Scanner sc = new Scanner(System.in);\n \n x = sc.nextInt();\n y = sc.nextInt();\n z = sc.nextInt();\n \n System.out.println(z);\n System.out.println(x);\n System.out.println(y);\n }\n}\n ", "A,B,C = input().split()\n\nprint(C, A, B, sep=' ')", "a, b, c = map(int, raw_input().split())\na, b = b, a\na, c = c, a\nprint '{} {} {}'.format(a, b, c)", "#include <iostream>\n\nint main() {\n\tint a,b,c;\n\tstd::cin >> a >> b >> c;\n\tstd::cout << c << \" \" << a << \" \" << b << std::endl;\n}", "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner=new Scanner(System.in);\n\t\tint a=scanner.nextInt();\n\t\tint b=scanner.nextInt();\n\t\tint c=scanner.nextInt();\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint x = scan.nextInt();\n\t\tint y = scan.nextInt();\n\t\tint z = scan.nextInt();\n\t\tscan.close();\n\n\n\t\tSystem.out.println(z+\" \"+x+\" \"+y);\n\t}\n}\n", "a,b,c=input().split()\nprint(c,a,b)", "import java.util.Scanner;\nclass Main\n{\n public static void main(String args[])\n {\n Scanner sc=new Scanner(System.in);\n int a,b,c;\n a=sc.nextInt();\n b=sc.nextInt();\n c=sc.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n};\n", "#include<iostream>\nusing namespace std;\nint main()\n{\n int a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b;\n}", "X,Y,Z=input().split()\nprint(Z,X,Y)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\ttry(Scanner sc = new Scanner(System.in)) {\n\t\t\tint x = sc.nextInt();\n\t\t\tint y = sc.nextInt();\n\t\t\tint z = sc.nextInt();\n\n\t\t\tSystem.out.println(z + \" \" + x + \" \" + y);\n\t\t}\n\n\t}\n\n}\n", "\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n String X = sc.next();\n String Y = sc.next();\n String Z = sc.next();\n System.out.println(Z+\" \"+X+\" \"+Y);\n\n }\n}", "#ABC161-A\nx,y,z=map(int,input().split())\nprint(z,x,y)\n", "#include<iostream>\nusing namespace std;\nint a,b,c;\nint main(){\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b<<endl;\n} ", "#include<bits/stdc++.h>\nusing namespace std;\nint X,Y,Z;\nint main(){\n cin>>X>>Y>>Z;\n cout<<Z<<\" \"<<X<<\" \"<<Y<<endl;\n return 0;\n}\n", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint a,b,c;\n\nint main()\n{\n\tcin>>a>>b>>c;\n\tswap(a,b),swap(a,c);\n\tcout<<a<<\" \"<<b<<\" \"<<c;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int a,b,c;cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b;\n\n}", "#include<iostream>\nusing namespace std;\n int main()\n{\n long long a,s,d;\n cin>>a>>s>>d;\n cout<<d<<\" \"<<a<<\" \"<<s<<endl;\n\n\n }\n", "X,Y,Z=input().split()\nprint(int(Z),int(X),int(Y))", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nint n,m,k;\n cin>>n>>m>>k;\n swap(n,m);swap(n,k);\n cout<<n<<\" \"<<m<<\" \"<<k;\n}", "X, Y, Z = input().split(' ')\nprint(Z, X, Y)", "A, B, C=input().split()\nprint(C + ' ' + A + ' ' + B)", "#include<bits/stdc++.h>\nusing namespace std;\n \nint main(){\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int X = scanner.nextInt();\n int Y = scanner.nextInt();\n int Z = scanner.nextInt();\n\n System.out.printf(\"%d %d %d%n\", Z, X ,Y);\n }\n}\n", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n\n int x = stdIn.nextInt();\n int y = stdIn.nextInt();\n int z = stdIn.nextInt();\n\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n int c = scan.nextInt();\n System.out.printf(\"%d %d %d\",c,a,b);\n\n }\n}", "#include<cstdio>\nint main()\n{\n\tint a,b,c,x;\n\tscanf(\"%d %d %d\",&a,&b,&c);\n\tprintf(\"%d %d %d\\n\",c,a,b);\n\treturn 0;\n}\n", "a = list(input().split())\nprint(a[2],a[0],a[1])\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(void){\n int x,y,z; cin>>x>>y>>z;\n printf(\"%d %d %d\",z,x,y);\n return 0;\n}", "x, y, z = input(\"\").split()\nprint(z, x, y)", "#include <iostream>\nint main()\n{int x,y,z;\nstd::cin >> x >> y >> z;\nstd::cout << z << \" \" << x << \" \" << y << std::endl;\n}\n\n", "#A\nx, y, z=map(int,input().split())\nprint(z, x, y)", "x,y,z = map(int,input().split());print(z,x,y)", "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args)\n {\n Scanner scan =new Scanner (System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n int c = scan.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n}", "a,b,c=map(str,input().split())\nprint(c,a,b)\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tint z = sc.nextInt();\n\t\tSystem.out.println(String.format(\"%d %d %d\", z, x, y));\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\n\nint x,y,z;\ncin>>x>>y>>z;\n//cab\ncout<<z<<' '<<x<<' '<<y<<endl;\n\n\n}", "a, b, c = map(int, input().split())\nprint(f\"{c} {a} {b}\")", "(x,y,z) = input().split(' ')\nprint(' '.join((z,x,y)))\n", "#include<iostream>\n\nint main() {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n printf(\"%d %d %d\\n\", z, x, y);\n return 0;\n}", "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner v = new Scanner(System.in);\n\t\tint a = v.nextInt();\n\t\tint b = v.nextInt();\n\t\tint c = v.nextInt();\n\t\tint z = a;\n\t\ta = b;\n\t\tb = z;\n\t\tz = a;\n\t\ta = c;\n\t\tc = z;\n\t\tSystem.out.printf(\"%d %d %d\",a,b,c);\n\t}\n}\n", "#include <iostream>\nusing namespace std;\nint main(){\n int a,b,c;\n cin >>a >> b >> c;\n cout << c << ' '<< a<<' '<< b<<'\\n';\n\n}", "import java.util.*;\nimport java.math.RoundingMode;\nimport java.math.BigDecimal;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\t\n\t\tint z = sc.nextInt();\n\t\tSystem.out.println(z+\" \"+x+\" \"+y);\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nint main()\n{\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b;\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\t// 整数の入力\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tint z = sc.nextInt();\n\n\t\t// 出力\n\t\tSystem.out.println(z + \" \" + x + \" \" + y);\n\t}\n}", "a, b, c = input().split()\nprint(int(c), int(a), int(b))", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\n\t\tSystem.out.printf(\"%d %d %d\", c, a, b);\n\t}\n\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\tint[] cab = {Z,X,Y};\n\t\tfor(int i : cab) {\n\t\t\tSystem.out.print(i + \" \");\n\t\t}\n\t\tsc.close();\n\t}\n}\n", "#include<cstdio>\n\nint main(){\n int a,b,c;\n scanf(\"%d %d %d\", &a, &b, &c);\n printf(\"%d %d %d\", c,a,b);\n return 0;\n}", "A, B, C = map(str, input().split())\n\nprint(C, A, B)", "a, b, c = map(int, raw_input().split())\na, b, = b, a\na, c = c, a\n\nprint a,b,c", "#include <bits/stdc++.h>\nusing namespace std;\n\nint a, b, c;\n\nint main() {\n cin >> a >> b >> c;\n printf(\"%d %d %d\", c, a, b);\n}\n", "import java.util.Scanner;\npublic class Main\n{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n int c = scanner.nextInt();\n \n System.out.println(c + \" \" + a +\" \"+ b);\n\t}\n}\n", "A, B, C = map(int, raw_input().split())\nprint C, A, B", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\n\t\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n\t}\n\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int X,Y,Z;\n cin>>X>>Y>>Z;\n cout<<Z<<' '<<X<<' '<<Y<<endl;\n}", "#include<cstdio>\nint main(){int x,y,z;scanf(\"%d %d %d\",&x,&y,&z);printf(\"%d %d %d\",z,x,y);}", "x,y,z=(map(int,input().split()))\nprint(z,x,y)", "x,y,z=map(str,input().split())\nprint(z+' '+x+' '+y)", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n sc.close();\n \n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\nint X,Y,Z;\ncin>>X>>Y>>Z;\ncout << Z <<' ' << X << ' ' << Y;\nreturn 0;\n}\n\n", "#include<iostream>\nusing namespace std;\n\nsigned main() \n{\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b<<endl;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int X = sc.nextInt();\n int Y = sc.nextInt();\n int Z = sc.nextInt();\n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n}\n", "a=input()\na=a.split()\na=(a[2],a[0],a[1])\nprint(*a)", "#include<bits/stdc++.h>\nusing namespace std;\nlong long t,n,m,a,b,c;\nint main()\n{\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b<<endl;\n} ", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b<<'\\n';\n}", "#include <iostream>\n\nint main() {\n int A,B,C;\n scanf(\"%d %d %d\",&A,&B,&C);\n printf(\"%d %d %d\",C,A,B);\n return 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String [] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint x= scan.nextInt();\n\t\tint y= scan.nextInt();\n\t\tint z= scan.nextInt();\n\t\tscan.close();\n\t\tSystem.out.print(z+\" \"+x+\" \"+y);\n\t}\n}\n", "#include<stdio.h>\nint main(){\n\tint a,b,c;\n\twhile(~scanf(\"%d%d%d\",&a,&b,&c))\n\t{\n\t\tprintf(\"%d %d %d\\n\",c,a,b);\n\t}\n} ", "A,B,C = [int(n) for n in input().split()]\nprint(C,A,B)", "#include<iostream>\n\nint main(){\n int a,b,c;\n std::cin >> a >> b >> c;\n std::cout << c<<\" \"<< a <<\" \"<< b <<\"\\n\";\n return 0;\n}", "ABC = input().split()\nprint(ABC[2], ABC[0], ABC[1])\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\tsc.close();\n\t\tint a = Y;\n\t\tint b = X;\n\t\tint c = a;\n\t\ta = Z;\n\t\tSystem.out.println(a + \" \" + b + \" \" + c);\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b,c;\n cin >> a >>b >>c;\n cout << c << ' ' << a << ' ' << b;\n}", "x,y,z=map(str, input().split())\nprint(z,x,y)", "a,b,c=[int(s) for s in input().split()]\nprint(*[c,a,b])", "import java.util.*;\npublic class Main{\n public static void main(String []args){\n int a,b,c;\n Scanner sc=new Scanner(System.in);\n a=sc.nextInt();\n b=sc.nextInt();\n c=sc.nextInt();\n System.out.print(c+\" \"+a+\" \"+b);\n } \n}\n", "B,C,A=map(int,input().split())\nprint(A,B,C)", "#include<cstdio>\nusing namespace std;\n\nint x,y,z;\n\nint main()\n{\n scanf(\"%d%d%d\",&x,&y,&z);\n printf(\"%d %d %d\",z,x,y);\n return 0;\n}", "import java.util.Scanner;\npublic class Main\n{\n\tpublic static void main(String[] args)\n {\n \t Scanner sc = new Scanner(System.in);\n \t\n \tString[] sep = sc.nextLine().split(\" \");\n \tSystem.out.println(sep[2] + \" \" + sep[0] + \" \" + sep[1]);\n }\n}", "import java.util.Scanner;\n//import java.util.Arrays;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tSystem.out.println(c + \" \" + a + \" \" + b);\n\t}\n}\n", "s = input().split()\n\nprint(s[2],s[0],s[1])", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int s, y, z;\n cin >>s>>y>>z;\n cout <<z<<' '<<s<<' '<<y;\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n \t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\t\tSystem.out.println(C+\" \"+A+\" \"+B);\n\t\t\n\t\t\n \tsc.close();\n }\n\t\t\n\t\t\n}\n", "\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint X=in.nextInt();\n\t\tint Y=in.nextInt();\n\t\tint Z=in.nextInt();\n\t\tSystem.out.print(Z+\" \"+X+\" \"+Y);\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint X=scan.nextInt();\n\t\tint Y=scan.nextInt();\n\t\tint Z=scan.nextInt();\n\t\tint a=0;\n\t\ta=X;\n\t\tX=Y;\n\t\tY=a;\n\t\ta=X;\n\t\tX=Z;\n\t\tZ=a;\n\t\tSystem.out.println(X+\" \"+Y+\" \"+Z);\n\n\t}\n\n}\n", "a,b,c=map(int,input().split())\na,b,c=c,a,b\nprint(a,b,c)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int b= sc.nextInt();\n int c = sc.nextInt();\n int a = sc.nextInt();\n System.out.println(a + \" \" + b + \" \" + c);\n }\n}\n", "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String X = sc.next(); \n String Y = sc.next(); \n String Z = sc.next(); \n System.out.println(Z+\" \"+X+\" \"+Y);\n \n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\" \" <<\" \" <<x<<\" \" <<y;\n}", "#include <iostream>\nusing namespace std;\nint main(){\n\tint a,b,c;\n\tcin>>b>>c>>a;\n\tcout<<a<<' '<<b<<' '<<c<<endl;\n\treturn 0;\n}", "l = input().split()\nprint(l[2], l[0], l[1])\n", "input = raw_input\n\nx, y, z = map(int, input().split(\" \"))\nyy = y\ny = x\nx = yy\n\nxx = x\nx = z\nz = xx\n\nprint(\"%d %d %d\" % (x, y, z))", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n\tScanner s = new Scanner(System.in);\n int a = s.nextInt();\n int b = s.nextInt();\n int c = s.nextInt();\n System.out.print(c + \" \" + a + \" \" + b);\n }\n}\n", "#include <cstdio>\nusing namespace std;\nint a,b,c; \nint main(){\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tprintf(\"%d %d %d\\n\",c,a,b);\n\treturn 0;\n}\n", "x,y,z=map(int,input().split())\n\nprint(z,\"\",x,\"\",y)", "import java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.List;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t Scanner sc = new Scanner(System.in);\n\t\tString[] array = sc.nextLine().split(\" \");\n\t System.out.println(array[2] + \" \" + array[0] + \" \" + array[1]);\n\t}\n}\n", "#include <cstdio>\n\nint main()\n{\n int x, y, z;\n scanf(\"%d%d%d\", &x, &y, &z);\n printf(\"%d %d %d\\n\", z, x, y);\n return 0;\n}", "A, B, C = input().split()\n\nprint(C + \" \" + A + \" \" + B)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint a, b, c;\n\nint main() {\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b<<endl;\n}\n", "import java.util.*; \nimport java.lang.*; \n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint X = scan.nextInt();\n\t\tint Y = scan.nextInt();\n\t\tint Z = scan.nextInt();\n\t\t\n\t\tSystem.out.println(Z);\n\t\tSystem.out.println(X);\n\t\tSystem.out.println(Y);\t\t\n\t}\n}", "x,y,z=input().split()\nprint(*[z,x,y])", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n\n System.out.println(C + \" \" + A + \" \" + B);\n}\n}\n", "//package atcoder.ABC;\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input = new java.util.Scanner(System.in);\n\t\t\n\t\tString a = input.next();\n\t\tString b = input.next();\n\t\tString c = input.next();\n\t\t\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t\t\n\t}\n\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(final String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt();\n\t\t\n\t\tSystem.out.println(c + \" \" + a + \" \" + b);\n\t}\n}\n", "X, Y ,Z = (map(int, input().split()))\n\nprint(Z,X,Y)\n", "import java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = Integer.parseInt(sc.next());\n\t\tint Y = Integer.parseInt(sc.next());\n\t\tint Z = Integer.parseInt(sc.next());\n\t\tSystem.out.println(Z + \" \"+ X + \" \"+Y);\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int a,z,x;\n cin>>a>>z>>x;\n cout <<x<<\" \"<<a<<\" \"<<z;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A=sc.nextInt(), B=sc.nextInt(), C=sc.nextInt();\n \n System.out.println(C + \" \" + A + \" \" +B);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int X,Y,Z;\n cin>>X>>Y>>Z;\n cout<<Z<<' '<<X<<' '<<Y;\n return 0;\n}", "n=list(input().split())\nprint(n[2], n[0], n[1])", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\nint a,b,c;\ncin >> a >> b >> c ;\ncout << c <<\" \"<< a <<\" \" << b <<endl;\n}\n", "list = input().split()\nprint(list[2],list[0],list[1])", "x,y,z=map(int,input().split())\ns=[z,x,y]\nprint(*s)", "import java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tint z = sc.nextInt();\n\n\t\tSystem.out.println(z +\" \"+ x + \" \"+ y);\n\t}\n\t\n\t\n}\n", "import java.util.*;\nimport java.io.PrintWriter;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\tint c=sc.nextInt();\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t}\n}\n", "import java.util.Scanner;\npublic class Main{\n\t public static void main(String args[]){\n\t Scanner scanner = new Scanner(System.in);\n\nint a=scanner.nextInt();\nint b=scanner.nextInt();\nint c=scanner.nextInt();\n\nSystem.out.println(c+\" \"+a+\" \"+b);\n}\n\t }", "l = input().split()\n\nprint(l[2])\nprint(l[0])\nprint(l[1])", "a,b,c=list(map(int,input().split()))\nprint(c,a,b)", "x, y, z = map(int, input().split())\nprint(f\"{z} {x} {y}\")", "X, Y, Z = input().split()\nprint(' '.join([Z, X, Y]))", "x,y,z = [int(s) for s in input().split()]\nprint(z,x,y)", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n\n System.out.println(C + \" \" + A + \" \" + B); \n }\n}", "A, B, C = map(str, input().split())\n\nprint(C+' '+A+' '+B)", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint x = scan.nextInt();\n\t\tint y = scan.nextInt();\n\t\tint z = scan.nextInt();\n\n\t\tSystem.out.print(z + \" \");\n\t\tSystem.out.print(x + \" \");\n\t\tSystem.out.print(y);\n\n\t}\n}\n", "X, Y, Z = map(int, raw_input().split())\n\ndef swap(A, B):\n return B, A\n\nX, Y = swap(X, Y)\nX, Z = swap(X, Z)\nprint(str(X) + \" \" + str(Y)+ \" \" + str(Z))\n", "x, y, z = input().split()\nprint(z + \" \" + x + \" \" + y)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\tSystem.out.print(Z + \" \" + X + \" \" + Y);\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int x,y,z;\ncin>>x>>y>>z;\ncout<<z<<\" \" <<x<<\" \" <<y<<\" \";\n }\n\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString x = sc.next();\n\t\tString y = sc.next();\n\t\tString z = sc.next();\n\t\tSystem.out.println(z + \" \" + x + \" \" + y);\n\n\t\tsc.close();\n\t}\n\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[] a = new int[3];\n for (int i = 0; i < 3; i++) { a[i] = sc.nextInt(); }\n System.out.println(a[2] + \" \" + a[0] + \" \" + a[1]);\n sc.close();\n }\n}", "a,b,c = map(int, raw_input().split(' '))\na,b = b,a\na,c = c,a\nprint a,b,c", "#include <cstdio>\n\n\n\nint main(){\n int A,B,C;\n scanf(\"%d%d%d\",&A,&B,&C);\n\n printf(\"%d %d %d\\n\",C,A,B);\n\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\t\n\t\tint[] d = {a, b, c};\n\t\t\n\t\tSystem.out.println(d[2] + \" \" + d[0] + \" \" + d[1] );\n\t\t\n\t\t\n\t}\n\n}", "# A\nA, B, C = map(int,input().split())\nprint(C, A, B)", "//package cf;\n\nimport java.util.*;\nimport java.io.*;\nclass Main {\n public static void main(String[] args) throws IOException {\n Scanner io = new Scanner(System.in);\n int x = io.nextInt(), y = io.nextInt(), z = io.nextInt();\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}\n\n\n", "a, b, c = map(int, input().split())\nprint(f'{c} {a} {b}')", "a,b,c=map(int,(input().split()))\nprint(c,a,b)", "X, Y, z = map(int, input().split())\nprint(z,X,Y)", "#include<bits/stdc++.h>\n\nint main(){\n int x,y,z;\n scanf(\"%d%d%d\",&x,&y,&z);\n printf(\"%d %d %d\\n\",z,x,y);\n return 0;\n}", "x,y,z=map(int,input().split())\nprint(z,x,y,sep=' ') \n", "#include<iostream>\nusing namespace std;\nint main() {\n int A,B,C;\n cin >> A >> B >> C;\n printf(\"%d %d %d\\n\",C,A,B);\n}", "# ABC161_A\nx,y,z=map(int,input().split())\nprint(z,x,y)\n", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n // write your code here\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n\t// write your code here\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n System.out.println(\"\"+z+\" \"+x+\" \"+y);\n }\n}\n", "#include <iostream>\n\nint main(){\n std::string x, y, z;\n std::cin >> x >> y >> z;\n std::cout << z+\" \"+x+\" \"+y << std::endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n \n System.out.println(\"\" + z + \" \" + x + \" \" + y);\n }\n}\n", "X,Y,Z=map(int,input().split())\nprint(f'{Z} {X} {Y}')", "#include <cstdio>\nint main(){\n int X,Y,Z;\n scanf(\"%d %d %d\",&X,&Y,&Z);\n printf(\"%d %d %d\\n\",Z,X,Y);\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tint X = scan.nextInt();\n\t\tint Y = scan.nextInt();\n\t\tint Z = scan.nextInt();\n\n\t\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n\t}\n\n}", "#include<iostream>\nusing namespace std;\nint a,b,c;\nint main()\n{\n cin >> b >> c >> a;\n cout << a << \" \" << b << \" \" << c;\n}\n", "X,Y,Z = map(int,(input().split()))\nprint(Z,X,Y)", "#include<iostream>\nusing namespace std;\nint main() {\n long long int a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b;\n return 0;\n}", "a,b,c=(int(i) for i in input().split())\nprint(c,a,b)", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint x,y,z,q;\n\tcin>>x>>y>>z;\n\tcout<<z<<\" \"<<x<<\" \"<<y;\n\treturn 0;\n}", "x,y,z=[int(e) for e in input().split()]\nprint(z,x,y)", "print(*(lambda a, b, c: (c, a, b))(*input().split()))\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tint z = sc.nextInt();\n \n\t\tSystem.out.println(z + \" \" + x + \" \" + y);\n\n\t\tsc.close();\n\t}\n}\n ", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tint z = sc.nextInt();\n\t\tsc.close();\n\n\t\tSystem.out.println(z + \" \" + x + \" \" + y);\n\t}\n}\n", "a,b,c = input().split()\nprint(c+' '+a+' '+b) ", "#include <bits/stdc++.h>\nusing namespace std;\nint X,Y,Z;\n\n\nint main(){\n cin >> X >> Y >> Z;\n cout << Z <<\" \" << X << \" \"<< Y;\n\n}", "l=list(map(int,input().split()))\nprint(l[-1],l[0],l[1])", "L=list(map(int,input().split()))\nprint(L[2],L[0],L[1])", "#include<bits/stdc++.h>\nusing namespace std;\nint main() \n{\n long x,y,z;\n cin>>x>>y>>z;\t\n cout<<z<<\" \"<<x<<\" \"<<y<<\"\\n\";\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tsc.close();\n\n\t\tSystem.out.println(c + \" \" + a + \" \" + b);\n\t}\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n long a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b;\n}", "l = list(map(int, input().split()))\nprint(l[2],l[0],l[1])", "#include<iostream>\nusing namespace std;\nint main()\n{\n\tint x,y,z,a,b,c;\n\tcin>>x>>y>>z;\n\ta=z;\n\tb=x;\n\tc=y;\n\tprintf(\"%d %d %d\",a,b,c);\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main()\n{\nint a,b,c;\ncin>>a>>b>>c;\ncout<<c<<\" \"<<a<<\" \"<<b;\n}\n", "import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\npublic static void main(String[] args){\nScanner scan=new Scanner(System.in);\nint x=scan.nextInt();\nint y=scan.nextInt();\nint z=scan.nextInt();\n\nSystem.out.println(z+\" \"+x+\" \"+y);\n\n\n}\n}", "X,Y,Z=input().split();print(Z,X,Y)", "x, y, z = map(int, (input().split()))\nprint(z, x, y)\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint X, Y, Z; cin >> X >> Y >> Z;\ncout << Z << \" \" << X << \" \" << Y << \"\\n\";\n}", "import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner s=new Scanner(System.in);\n\t\t\n\t\tlong a=s.nextLong();\n\t\tlong b=s.nextLong();\n\t\tlong c=s.nextLong();\n\t\t\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t\t\n\t}\n\t\n}", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n \tScanner sc = new Scanner(System.in);\n \tint a = sc.nextInt();\n \tint b = sc.nextInt();\n \tint c = sc.nextInt();\n \tSystem.out.println(c + \" \" + a + \" \" + b);\n }\n}", "x, y, z = input().split()\nprint(int(z), int(x), int(y))", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n int c = scan.nextInt();\n scan.close();\n\n System.out.println(c + \" \" + a + \" \" + b);\n }\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n int a,b,c;\n cin>>a>>b>>c;\n cout<<c<<' '<<a<<' '<<b;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y<<endl;\n}\n", "import java.util.Scanner;\n class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\nScanner sc=new Scanner(System.in);\nint a=sc.nextInt();\nint b=sc.nextInt();\nint c=sc.nextInt();\nint d;\nd=a;\na=b;\nb=d;\nint e;\ne=a;\na=c;\nc=e;\nSystem.out.println(a+\" \"+b+\" \"+c);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int x,y,z;\n cin >> x >> y >> z;\n printf(\"%d %d %d\\n\",z, x, y);\n}\n", "A,B,C = map(int,input().split())\nprint(*[C,A,B])", "X, Y, Z = map(int, raw_input().split())\nA, B, C = Z, X, Y\nprint A, B, C\n", "X,Y,Z=map(int,input().split())\nprint(Z,\"\",X,\"\",Y)", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint a,b,c;\n\tcin>>b>>c>>a;\n\tcout<<a<<\" \"<<b<<\" \"<<c;\n\treturn 0;\n}\n", "import java.util.*;\n \nclass Main{\n public static void main(String[] args){\n Scanner scan=new Scanner(System.in);\n String a=scan.next();\n String b=scan.next();\n String c=scan.next();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n}\n", "import java.util.Scanner;\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner stdInt = new Scanner(System.in);\n\n\t\tint a = stdInt.nextInt();\n\t\tint b = stdInt.nextInt();\n\t\tint c = stdInt.nextInt();\n\n\t\tSystem.out.println(c + \" \" + a + \" \" + b);\n\t}\n}", "A,B,C=list(map(int,input().split()))\nprint(C,A,B)", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint x = s.nextInt();\n\t\tint y = s.nextInt();\n\t\tint z = s.nextInt();\n\t\tint w;\n\n\t\tw = z;\n\t\tz = y;\n\t\ty = x;\n\t\tx = w;\n\n\t\tSystem.out.println(x + \" \" + y + \" \" + z);\n\n\t\ts.close();\n\n\t}\n\n}\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint x,y,z;cin>>x>>y>>z;\n\tcout<<z<<' '<<x<<' '<<y<<endl;\n\treturn 0;\n}\n", "x = input().split()\nprint(x[2]+\" \"+x[0]+\" \"+x[1])\n", "import java.util.Arrays;\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint x = scan.nextInt();\n\t\tint y = scan.nextInt();\n\t\tint z = scan.nextInt();\n\t\t\n\t\tSystem.out.println(z+\" \"+x+\" \"+y);\n\t\t\n\t}\t\n}\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint a, b, c;\n\tcin>>a;\n\tcin>>b;\n\tcin>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b;\n\treturn 0;\n}", "n=input().split()\nprint(n[2],n[0],n[1])", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int A,B,C;\n cin >> A >> B >> C;\n cout << C << ' ' << A << ' ' << B;\n}", "import java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\n\t\tSystem.out.println(Z);\n\t\tSystem.out.println(X);\n\t\tSystem.out.println(Y);\n\t}\n\n}", "X,Y,Z = (int(a) for a in input().split())\nprint(Z,X,Y)", "x,y,z = [int(x) for x in input().split()]\nprint(z,x,y)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\ttry {\n\t\t\tint X = sc.nextInt();\n\t\t\tint Y = sc.nextInt();\n\t\t\tint Z = sc.nextInt();\n\t\t\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n\n\t\t} finally\n\n\t\t{\n\t\t\tsc.close();\n\t\t}\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\n int X,Y,Z;\n cin>>X>>Y>>Z;\n\n cout<<Z<<\" \"<<X<<\" \"<<Y<<\" \"<<endl;\n\n}", "#include<cstdio>\nusing namespace\tstd;\n\nint main() {\n\tint x, y, z;\n\tscanf(\"%d %d %d\", &x, &y, &z);\n\tprintf(\"%d %d %d\", z, x, y);\n}", "x,y,z = input().split(None, 3)\nprint(z,x,y)", "X, Y, Z = map(int, input().split())\nprint(*[Z, X, Y])", "#include<iostream>\n\nint main(){\n int X,Y,Z;\n std::cin >> X >> Y >> Z;\n std::cout <<Z<<\" \"<<X<<\" \"<<Y<<std::endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nint a,b,c;\ncin >> a >>b >>c;\ncout << c <<\" \" << a <<\" \" << b <<\" \";\n}", "raw = input().split(\" \")\nprint(raw[2], raw[0], raw[1])", "#include<cstdio>\nint main()\n{\n\tchar a[1000],b[1000],c[1000];\n\tscanf(\"%s %s %s\",a,b,c);\n\tprintf(\"%s %s %s\",c,a,b);\n}", "\nimport java.util.Scanner;\npublic class Main {\n \n public static void main(String[] args) { \n\t\tScanner sc = new Scanner(System.in);\nint X=sc.nextInt();\nint Y=sc.nextInt();\nint Z=sc.nextInt();\n System.out.printf(\"%d %d %d\",Z,X,Y);\n\n } \n}", "x,y,z= map(str, input().split())\n\nprint(z,x,y, sep=' ')", "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n System.out.println(\"\" + c + \" \" + a + \" \" + b);\n }\n}", "x,y,z=map(int,input().split())#整数を複数の変数に格納\n\nprint(z,x,y)", "#include<bits/stdc++.h>\nint main()\n{\n int a,b,c;\n std::cin>>a>>b>>c;\n printf(\"%d %d %d\\n\",c,a,b);\n return 0;\n}", "#include <stdio.h>\nint main(void){\n int a, b, c;\n scanf(\"%d %d %d\", &b, &c, &a);\n printf(\"%d %d %d\\n\", a, b, c);\n return 0;\n}", "#include <cstdio>\n\nint a, b, c;\n\nint main() {\n scanf(\"%d%d%d\", &a, &b, &c);\n printf(\"%d %d %d\", c, a, b);\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint a, b, c;\n\nint main()\n{\n\tscanf(\"%d%d%d\", &a, &b, &c);\n\tprintf(\"%d %d %d\", c, a, b);\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<z<<' '<<x<<' '<<y<<'\\n'; \n} ", "A=input().split()\nprint(A[2],A[0],A[1])", "X,Y,Z=input().split()\nprint(Z + \" \" + X + \" \" + Y)\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int a = s.nextInt();\n int b=s.nextInt();\n int c=s.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n}", "a,b,c = map(int,raw_input().split())\nprint c,a,b", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tString str = sc.nextLine();\n\t\tString s[] = str.split(\" \");\n\t\t\n\n\t\tSystem.out.println(s[2]+\" \"+s[0]+\" \"+s[1]);\n\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint n,m,s;\nint main(){\n\tcin>>n>>m>>s;\n\tcout<<s<<\" \"<<n<<\" \"<<m;\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b,c;\n\nint main(){\n\tcin>>a>>b>>c;\n\tswap(a,b);swap(a,c);\n\tcout<<a<<' '<<b<<' '<<c;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<z<<\" \"<<x<<\" \"<<y<<\" \"<<endl;\n}\n", "A, B, C = map(int, input().split())\nprint(C, A, B)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n Integer X = input.nextInt();\n Integer Y = input.nextInt();\n Integer Z = input.nextInt();\n\n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n}", "import java.util.Scanner;\npublic class Main{\n public static void main (String[] args){\n Scanner scan = new Scanner(System.in);\n int x = scan.nextInt();\n int y = scan.nextInt();\n int z = scan.nextInt();\n System.out.println(z+\" \"+x+\" \"+y);\n }\n}", "a = [i for i in input().split()]\nprint(a[2], a[0], a[1])", "X, Y, Z = map(int, input().split(\" \"))\nprint(Z, X, Y)", "A,B,C = input().split()\nprint(C,A,B)\n", "X,Y,Z = (int(i) for i in input().split())\n\nprint(Z,X,Y)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nint x,y,z,t;\ncin>>x>>y>>z;\n\ncout<<z<<\" \"<<x<<\" \"<<y<<endl;\n\n\n}\n", "#include<iostream>\nusing namespace std;\nint main() {\nint a,b,c;\n cin >> a>> b>>c;\n printf(\"%d %d %d\", c, a, b);\n return 0;\n}\n", "a,b,c=input().split();print(c,a,b)", "a,b,c=(int(x) for x in input().split())\n\nprint(c,a,b)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt(), y = sc.nextInt(), z = sc.nextInt();\n int tmp = y;\n y = x;\n x = z;\n z = tmp;\n System.out.println(x + \" \" + y + \" \" + z);\n }\n}", "a,b,c=map(int, input().split())\nprint(c,' ',a,' ',b)", "#include <stdio.h>\nint main(){\n\tint x,y,z,t;\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tt=x,x=y,y=t;\n\tt=x,x=z,z=t;\n\tprintf(\"%d %d %d\\n\",x,y,z);\n}", "#include<iostream>\n\nusing namespace std;\n\nint main(){\n int a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<< a<<\" \"<<b<<endl;\n return 0;\n}", "import java.util.*;\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String[] nums = sc.nextLine().split(\" \");\n System.out.println(nums[2] + \" \" + nums[0] + \" \" + nums[1]);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tint z = sc.nextInt();\n\n\t\tSystem.out.println(z + \" \" + x + \" \" + y );\n\t}\n}\n", "#include <bits/stdc++.h>\n\nint main()\n{\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n printf(\"%d %d %d\", z, x, y);\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b<<\" \"<<endl;\n\n}", "#include<iostream>\n\nusing namespace std;\n\nint X, Y, Z;\n\nint main() {\n\tcin >> X >> Y >> Z;\n\tcout << Z << \" \" << X << \" \" << Y << endl;\n}", "(A, B, C) = input().split(' ')\nprint(C, A, B)\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n,m,k;\n cin>>n>>m>>k;\n cout<<k<<\" \"<<n<<\" \"<<m;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A,B,C;\n\n\t\tB = sc.nextInt();\n\t\tC = sc.nextInt();\n\t\tA = sc.nextInt();\n\n\t\tSystem.out.println(A + \" \" + B + \" \" + C);\n\t}\n}", "i,j,k = list(map(int , input().split()))\nprint(k,i,j)\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint X,Y,Z;\n\tcin>>X>>Y>>Z;\n\tcout<<Z<<\" \"<<X<<\" \"<<Y;\n\treturn 0;\n} ", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\"\\t\"<<x<<\"\\t\"<<y;\n return 0;\n}", "x, y, z = (i for i in input().split())\nprint(z, x, y)\n", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\n\t\tScanner sc=new Scanner(System.in);\n\n\t\tint x=sc.nextInt();\n\t\tint y=sc.nextInt();\n\t\tint z=sc.nextInt();\n\t\t\n\t\tSystem.out.println(z+ \" \" +x+ \" \" +y);\n\t\t\n\t\tsc.close();\n\t}\n\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tbyte a = sc.nextByte();\n\t\tbyte b = sc.nextByte();\n\t\tbyte c = sc.nextByte();\n\t\tsc.close();\n\t\tSystem.out.println(c + \" \"+ a + \" \" + b);\n\t}\n}", "import java.util.*;\nclass Main{\npublic static void main(String args[]){\nScanner sc = new Scanner(System.in);\nint A = sc.nextInt();\nint B = sc.nextInt();\nint C = sc.nextInt();\nSystem.out.println(C+\" \"+A+\" \"+B);\n\n}\n}", "x,y,z=input().split()\nprint(z,x,y)", "x,y,z = list(map(int,input().split()));\nprint(z,x,y)", "#include <bits/stdc++.h>\n \nint main(){\n int x,y,z;\n scanf(\"%d%d%d\",&x,&y,&z);\n printf(\"%d %d %d\",z,x,y);\n return 0;\n}", "x, y, z = input().split()\nprint(\" \".join([z, x, y]))", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint a, b, c;\n\tcin >> a >> b >> c;\n\tprintf(\"%d %d %d\\n\", c, a, b);\n\n\treturn 0;\n}", "import java.util.Scanner;\n\nclass Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\t\n\t\tint a = scanner.nextInt();\n\t\tint b = scanner.nextInt();\n\t\tint c = scanner.nextInt();\n\t\t\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\n\t}\n\n}\n", "st=input().split()\nprint(st[2]+\" \"+st[0]+\" \"+st[1])", "num=input().split()\nprint(num[2],num[0],num[1])", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int s = sc.nextInt();\n int l = sc.nextInt();\n int r = sc.nextInt();\n System.out.println(r+\" \"+s+\" \" + l);\n }\n}", "#include <iostream>\nusing namespace std;\nint main(){\n \tint a,b,c;\n \tcin>>a>>b>>c;\n \tcout<<c<<' '<<a<<' '<<b<<endl;\n \n}", "// A - ABC Swap\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint x,y,z; cin>>x>>y>>z;\n\tcout<<z<<\" \"<<x<<\" \"<<y<<endl;\n}", "#include<iostream>\nsigned main()\n{\n \tint a,b,c;\n \tstd::cin>>a>>b>>c;\n \tstd::cout<<c<<\" \"<<a<<\" \"<<b;\n}", "#include<iostream>\nusing namespace std;\n\nint a,b,c;\n\nint main()\n{\n\tcin >> a >> b >> c;\n\tcout << c << \" \" << a << \" \" << b;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\nlong long a,b,c,d;\ncin>>a>>b>>c;\ncout<<c<<\" \"<<a<<\" \"<<b;\n\n\n}\n\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int x = scan.nextInt();\n int y = scan.nextInt();\n int z = scan.nextInt();\n System.out.print(z + \" \" + x + \" \" + y);\n }\n}", "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\n\t\tSystem.out.printf(\"%d %d %d\",Z,X,Y);\n\n\t\tsc.close();\n\n\t}\n\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int x = in.nextInt();\n int y = in.nextInt();\n int z = in.nextInt();\n in.close();\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int X,Y,Z;\n cin>>X>>Y>>Z;\n printf(\"%d %d %d\",Z,X,Y);\n}", "a = list(input().split(' '))\nprint(a[2], a[0], a[1])", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int X,Y,Z;\n cin>>X>>Y>>Z;\n cout<<Z<<\" \"<<X<<\" \"<<Y;\n\n\n}", "#include <iostream>\nint x, y, z;\n\nint main() {\n std::cin >> x >> y >> z;\n std::cout << z << \" \" << x << \" \" << y;\n}", "b,c,a = input().split()\nprint(\"{} {} {}\".format(a,b,c))", "#include <stdio.h>\n\nint main(void)\n{\n\tint X,Y,Z;\n\tscanf(\"%d%d%d\",&X,&Y,&Z);\n\tprintf(\"%d %d %d\\n\",Z,X,Y);\n\treturn 0;\n}\n\n\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main (String args[]) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt(); \n\t\tint c = scan.nextInt(); \n\t\t\n\t\tSystem.out.println(c + \" \" + a + \" \" + b);\n\t}\n}", "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n Scanner s = new Scanner(System.in);\n int x = s.nextInt();\n int y = s.nextInt();\n int z = s.nextInt();\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "import java.util.*;\nclass Main{\npublic static void main(String[]args){\nScanner sc=new Scanner(System.in);\n String a=sc.next(),b=sc.next();\n System.out.println(sc.next()+\" \"+a+\" \"+b);\n}\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n System.out.println(c + \" \" + a + \" \" + b );\n }\n}", "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner stdIn = new Scanner(System.in);\n int X = stdIn.nextInt();\n int Y = stdIn.nextInt();\n int Z = stdIn.nextInt();\n System.out.println(Z+\" \"+X+\" \"+Y);\n }\n}", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n int c,a,b;\n cin>>a>>b>>c;\n\n cout<<c<<\" \"<<a<<\" \"<<b<<endl;\n\n\n}", "import java.util.*;\nimport java.math.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n\n System.out.println(z+\" \"+x+\" \"+y);\n\n }\n\n}\n", "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args) {\n Scanner in=new Scanner(System.in);\n int a=in.nextInt();\n int b=in.nextInt();\n int c=in.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n}", "#include <stdio.h>\nint a, b, c;\nint main() {\n\tscanf(\"%d%d%d\", &a, &b, &c);\n\tprintf(\"%d %d %d\\n\", c, a, b);\n}", "n, m, h = map(int, input().split())\n\nprint(h, n, m)", "import java.util.*;\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n System.out.print(c + \" \" + a + \" \" + b);\n System.out.println();\n }\n}\n", "import java.util.Scanner;\npublic class Main{\n public static void main(String[]args){\n Scanner scan = new Scanner(System.in);\n\n int a,b,c;\n a=scan.nextInt();\n b=scan.nextInt();\n c=scan.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n}\n", "b, c, a = map(int, input().split())\nprint(a, b, c)", "A,B,C = input().split()\nprint(\" \".join([C,A,B]))", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int x = scanner.nextInt();\n int y = scanner.nextInt();\n int z = scanner.nextInt();\n\n System.out.println(z + \" \" + x + \" \" + y);\n\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint x, y, z;\nint main ()\n{\n\tcin >>x >>y >>z;\n\tcout <<z <<\" \" <<x <<\" \" <<y;\n\treturn 0;\n}", "X,Y,Z=[int(i) for i in input().split(\" \")]\nprint(Z,X,Y)\n", "a,b,c = map(int, input().split())\nprint(c,a,b,sep=\" \")", "a,b,c=list(map(int,input().split()))\nl=[c,a,b]\nprint(*l)", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner s = new Scanner(System.in);\n \tint x = s.nextInt();\n \tint y = s.nextInt();\n \tint z = s.nextInt();\n \tSystem.out.printf(\"%d %d %d\\n\", z, x, y);\n }\n}", "S=input().split()\nprint(S[2],S[0],S[1])", "a,b,c=list(input().split())\nprint(c, a, b)", "a, b, c = input().rstrip().split()\nprint(c, a, b)", "X,Y,Z = input().split()\n\nX,Y = Y,X\nX,Z = Z,X\nprint(X,Y,Z)", "import java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner sc=new Scanner(System.in);\n int a=sc.nextInt();\n int b=sc.nextInt();\n int c=sc.nextInt();\n int temp=a;\n a=b;\n b=temp;\n temp=a;\n a=c;\n c=temp;\n System.out.println(a+\" \"+b+\" \"+c);\n }\n}", "X, Y, Z = input().split(\" \")\nprint(Z, X, Y)", "#!/usr/bin/env python\n\nfrom sys import stdin, stderr\n\ndef main():\n A = map(int, stdin.readline().split())\n res = A[-1:] + A[:-1]\n print(' '.join(map(str, res)))\n\n return 0\n\nif __name__ == '__main__': main()\n", "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t}\n}", "li = input().split()\nprint(li[2]+\" \"+li[0]+\" \"+li[1])", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc =new Scanner(System.in);\n\t\tint x=sc.nextInt();\n\t\tint y=sc.nextInt();\n\t\tint z=sc.nextInt();\n\t\tSystem.out.print(z+\" \"+x+\" \"+y);\n\t\tsc.close();\n\t}\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\tSystem.out.print(Z + \" \");\n\t\tSystem.out.print(X + \" \");\n\t\tSystem.out.println(Y);\n\t}\n}\n", "X, Y, Z = input().split(' ')\nprint(' '.join([Z, X, Y]))\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint x,y,z;\n \tscanf(\"%d %d %d\",&x,&y,&z);\n \tprintf(\"%d %d %d\",z,x,y);\n}", "x, y, z = map(int, input().split(\" \"))\nprint(z, x, y)", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\tsc.close();\n\n\t\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n\t}\n}\n", "#include <cstdio>\n\nusing namespace std;\n\nint A, B, C;\n\nint main() {\n scanf(\"%d %d %d\", &A, &B, &C);\n printf(\"%d %d %d\", C, A, B);\n}\n", "#include <iostream>\nusing namespace std;\nint a, b, c;\nint main() {\n cin >> a >> b >> c;\n cout << c << \" \" << a << \" \" << b;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\nint x,y,z; cin>>x>>y>>z;\n cout<<z<<' '<<x<<' '<<y;\n cout<<'\\n';\n}", "user = input().split()\nprint(user[2], user[0], user[1])", "import java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\tScanner sc = new Scanner(System.in);\n\tint a = Integer.parseInt(sc.next());\n\tint b = Integer.parseInt(sc.next());\n\tint c = Integer.parseInt(sc.next());\n\t\n\tSystem.out.println( c +\" \" + a + \" \" + b);\n\t}\n}\n", "#include<stdio.h>\nint main()\n{\n int a,b,c;\n scanf(\"%d %d %d\",&a,&b,&c);\n printf(\"%d %d %d\\n\",c,a,b);\n \n}\n", "# A\nX,Y,Z= list(map(int, input().split()))\nprint(Z,X,Y)", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n // TODO Auto-generated method stub\n Scanner in = new Scanner(System.in);\n int a = in.nextInt(), b = in.nextInt(), c = in.nextInt();\n System.out.println(c + \" \" + a + \" \" + b);\n }\n\n}\n", "import java.util.*;\npublic class Main{\npublic static void main(String[] args){\n int a,b,c;\n Scanner s=new Scanner(System.in);\n a=s.nextInt();\n b=s.nextInt();\n c=s.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n}\n}", "abc = input().split(\" \")\nprint(abc[2], abc[0], abc[1] )", "#include <iostream>\nusing namespace std;\nint a, b, c;\nint main() {\n cin >> a >> b >> c;\n cout << c << ' ' << a << ' ' << b << endl;\n}", "#A\nX,Y,Z=map(int,input().split())\nprint(Z,X,Y)", "#include <iostream>\nusing namespace std;\nint a,b,c;\nint main()\n{\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b<<\"\\n\";\n}\n\n", "x, y, z = map(int, raw_input().split())\n\nprint z, x, y", "A=list(map(int,input().split()))\nprint(A[2],A[0],A[1])", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a,b,c;\n cin >> b >> c >> a;\n cout << a << \" \" << b << \" \" << c;\n}", "#include <iostream>\n\nint main()\n{\n\tint A, B, C;\n\tstd::cin >> A >> B >> C;\n\tstd::cout << C <<\" \"<< A <<\" \"<< B;\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\tSystem.out.print(Z+\" \");\n\t\tSystem.out.print(X+\" \");\n\t\tSystem.out.print(Y);\n\t}\n}\n", "#include<iostream>\nusing namespace std;\nint main (void)\n{\nint x,y,z;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n}", "import java.io.*;\nimport java.util.*;\n\npublic class Main{\n public static void main(String[] args)throws Exception{\n Scanner sc=new Scanner(System.in);\n int x=sc.nextInt(),y=sc.nextInt(),z=sc.nextInt();\n System.out.printf(\"%d %d %d\\n\",z,x,y);\n }\n}", "X,Y,Z=input().split()\nN=[X,Y,Z]\nprint(N[2],N[0],N[1])\n", "str = input().split()\nprint(str[2],str[0],str[1])", "import java.util.*;\n\nclass Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n System.out.println(c);\n System.out.println(a);\n System.out.println(b);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int x, y, z;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y<<endl;\n}", "a, b, c = input().strip().split(\" \")\nprint(c, a, b)", "import java.util.Scanner;\nclass Main {\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n int c = scan.nextInt();\n System.out.println(c + \" \" + a + \" \" + b);\n }\n}\n", "import java.util.*;\n\n/*\n問題文\n\n*/\n\npublic class Main {\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int z = sc.nextInt();\n\n System.out.println(z + \" \" + x + \" \" + y);\n }\n}", "import java.util.*;\nclass Main\n{\n public static void main(String[] args) \n {\n Scanner sc = new Scanner(System.in);\n \n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n \n System.out.println(c + \" \" + a + \" \" + b);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint x = scan.nextInt();\n\t\tint y = scan.nextInt();\n\t\tint z = scan.nextInt();\n\t\t\n\t\tSystem.out.printf(\"%d %d %d\\n\",z,x,y);\n\t}\n}", "y,z,x=map(int,(input().split()))\n\nprint(x,y,z)", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b;\n\t\n\t\n\treturn 0;\n } ", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args)\n {\n Scanner scanner = new Scanner(System.in);\n int X = scanner.nextInt();\n int Y = scanner.nextInt();\n int Z = scanner.nextInt();\n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n}\n", "import java.util.Scanner;\n \npublic class Main {\n\tpublic static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n \n int X =sc.nextInt();\n int Y =sc.nextInt();\n int Z =sc.nextInt();\n \n System.out.println(Z+\" \"+X+\" \"+Y);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tstatic Main instance = new Main();\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\t//入力値\n\t\tint X = scan.nextInt();\n\t\tint Y = scan.nextInt();\n\t\tint Z = scan.nextInt();\n\n\t\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n\t}\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String a = sc.next(),b = sc.next(),c = sc.next();\n System.out.println(c + \" \" + a + \" \" + b);\n }\n}\n", "L=[i for i in input().split()]\nprint(L[2],L[0],L[1])", "import sys\nI=input().split()\nprint(I[2],I[0],I[1])", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint a,b,c;\n\tcin>>a>>b>>c;\n \tcout<<c<<\" \"<<a<<\" \"<<b<<\"\\n\";\n return(0);\n}", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n\tScanner sc = new Scanner(System.in);\n\tint X = sc.nextInt();\n\tint Y = sc.nextInt();\n\tint Z = sc.nextInt();\n\tSystem.out.print(Z+\" \"+X+\" \"+Y);\n }\n}\n", "/*package whatever //do not write package name here */\n\nimport java.io.*;\n\nimport java.util.*;\npublic class Main{\n\tpublic static void main (String[] args) {\n\tScanner s=new Scanner(System.in);\n\tint a=s.nextInt();\n\tint b=s.nextInt();\n\tint c=s.nextInt();\n\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t}\n}", "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t}\n\n}\n", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] n = new int[3];\n\t\tArrays.setAll(n, i -> sc.nextInt());\n\t\tSystem.out.println(n[2] + \" \" + n[0] + \" \" + n[1]);\n\t\t\n\t}\n}\n", "import java.util.*;\npublic class Main\n{\n public static void main(String args[])\n {\n Scanner in=new Scanner(System.in);\n int A=in.nextInt();\n int B=in.nextInt();\n int C=in.nextInt();\n A=A^B;\n B=A^B;\n A=A^B;\n A=A^C;\n C=A^C;\n A=A^C;\n System.out.print(A+\" \"+B+\" \"+C);\n }\n}", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint X, Y, Z;\n\n\tcin >> X >> Y >> Z;\n\tprintf(\"%d %d %d\\n\", Z, X, Y);\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int a,b,c;\n cin>>a>>b>>c;\n printf(\"%d %d %d\\n\",c,a,b);\n}\n", "import java.util.*;\n\npublic class Main\n{\n\tpublic static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = 0;\n a=sc.nextInt();\n int b = 0;\n b=sc.nextInt();\n int c = 0;\n c=sc.nextInt();\n System.out.println(c+\" \"+a+\" \"+b);\n }\n\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint X = stdIn.nextInt();\n\t\tint Y = stdIn.nextInt();\n\t\tint Z = stdIn.nextInt();\n\n\t\tSystem.out.println(Z + \" \" + X + \" \"+ Y);\n\t\tstdIn.close();\n\t}\n}", "# CAB\nl = input().split()\nprint(l[2],l[0],l[1])", "#include <iostream>\nusing namespace std;\nint main(){\nint x , y , z;\ncin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\nreturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tprivate static Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\n\t\tint x = scan.nextInt();\n\t\tint y = scan.nextInt();\n\t\tint z = scan.nextInt();\n\n\t\tSystem.out.println(z +\" \"+ x +\" \"+ y);\n\n\t}\n}", "(x,y,z) = list(input().split())\nprint(z+\" \"+x+\" \"+y)", "a,b,c=map(int,input().split())\nprint(c,a,b,sep=' ')", "x,y,z=map(int,input().strip().split(' ')) \nprint(z,x,y)", "//ABCSwap.java\nimport java.util.Scanner;\nclass Main\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\tint x=sc.nextInt();\n int y=sc.nextInt();\n int z=sc.nextInt();\n\n System.out.println(z+\" \"+x+\" \"+y);\n sc.close();\n }\n}", "#include <cstdio>\n\nint a, b, c;\n\nint main() {\n scanf(\"%d%d%d\", &a, &b, &c);\n printf(\"%d %d %d\\n\", c, a, b);\n return 0;\n}\n", "#include<iostream>\nusing namespace std;\nint main()\n{\n int a,b,c,t;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b<<endl;\n return 0;\n}", "x, y, z = input().split()\nprint(' '.join([z, x, y]))", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long x,y,z;\n cin>>x>>y>>z;\n printf(\"%lld %lld %lld\\n\",z,x,y);\n}", "Y, Z, X =map(int, input().split())\nprint(X,Y,Z)", "#include<cstdio>\nusing namespace std;\nint X,Y,Z;\nint main(){\n\tscanf(\"%d%d%d\",&X,&Y,&Z);\n\tprintf(\"%d %d %d\\n\",Z,X,Y);\n\treturn 0;\n} ", "import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int X = sc.nextInt();\n int Y = sc.nextInt();\n int Z = sc.nextInt();\n System.out.printf(\"%d %d %d\\n\", Z,X,Y);\n }\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\nint main(void) {\nint x,y,z;cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n}", "x = list(input().split())\nprint(x[2],x[0],x[1])", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b<<endl;\n}", "x,y,z = map(int, input().split()) #複数の数字\nprint(z,x,y)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tcout<<c<<\" \"<<a<<\" \"<<b<<\" \"<<endl;\n return(0);\n}", "import java.util.*;\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n System.out.print(C +\" \" + A + \" \" + B);\n }\n}\n", "#include <cstdio>\n\nint main()\n{\n\tint a, b, c;\n\tscanf(\"%d %d %d\", &a, &b, &c);\n\tprintf(\"%d %d %d\\n\", c, a, b);\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\nint main()\n{\n\tint a,s,d;\n\tcin>>a>>s>>d;\n\tcout<<d<<\" \"<<a<<\" \"<<s<<endl;\n\treturn 0;\n}", "A, B, C = input().split(' ')\nprint(C, A, B)", "a = input().split()\n\nprint(int(a[2]),int(a[0]),int(a[1]))", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int X; int Y; int Z; cin>>X>>Y>>Z;\n cout<<Z<<\" \"<<X<<\" \"<<Y<<endl;\n}", "X,Y,Z = [int(i) for i in input().split()]\nprint(Z,X,Y)", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a=sc.nextInt(),b=sc.nextInt(),c=sc.nextInt();\n\t\t\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t\tsc.close();\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int64_t x,y,z;\n \n cin >> x >> y >> z;\n \n\n cout << z <<\" \"<<x<<\" \"<<y;\n}\n", "import java.util.*;\nimport java.lang.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tSystem.out.println(c+\" \"+a+\" \"+b);\n\t}\n}", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n \tint a,b,c,d;\n \ta=sc.nextInt();\n \tb=sc.nextInt();\n \tc=sc.nextInt();\n \t\n \td=a;\n \ta=b;\n \tb=d;\n \td=a;\n \ta=c;\n \tc=d;\n \tSystem.out.print(a+\" \"+b+\" \"+c);\n }\n}", "#include <stdio.h>\nint main(){\n int a,b,c;\n scanf(\"%d %d %d\",&a,&b,&c);\n printf(\"%d %d %d\\n\",c,a,b); \n return 0;\n}", "X,Y,Z = map(int, raw_input().split())\nprint Z,X,Y", "a = input().split()\nprint(a[2] +' ' +a[0]+' ' + a[1])", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String a = sc.next();\n String b = sc.next();\n String c = sc.next();\n \n System.out.println(c + \" \" + a + \" \" + b);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A,B,C;\n\t\tA = sc.nextInt();\n\t\tB = sc.nextInt();\n\t\tC= sc.nextInt();\n\t\tSystem.out.println(C+\" \"+A+\" \" +B);\n\t}\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\n\n\nint main() {\n\n\tint x, y, z;\n\tcin >> x >> y >> z;\n\n\tcout << z << \" \" << x << \" \" << y;\n\n}", "x,y,z = input().split(\" \")\nprint(z,x,y)", "#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint a,b,c;\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tprintf(\"%d %d %d\\n\",c,a,b);\n\treturn 0;\n}", "a = input().split()\nprint(a[2] + \" \" + a[0] + \" \" + a[1])", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int X = scanner.nextInt();\n int Y = scanner.nextInt();\n int Z = scanner.nextInt();\n\n System.out.println(Z + \" \" + X + \" \" + Y);\n }\n}", "a,b,c = input().split(\" \")\nprint(c,a,b)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner input = new Scanner(System.in);\n\t\tint A = input.nextInt();\n\t\tint B = input.nextInt();\n\t\tint C = input.nextInt();\n\t\tSystem.out.println(C+\" \"+A+\" \"+B);\n\t}\n}", "import java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint i1,i2,i3;\n\tcin>>i1>>i2>>i3;\n\tcout<<i3<<\" \"<<i1<<\" \"<<i2<<endl;\n}\n", "#include <iostream>\n\nint main()\n{\n\tint a, b, c;\n\t\n\tstd::cin >> a >> b >> c;\n\t\n\tstd::cout << c << ' ' << a << ' ' << b;\n}\n", "X,Y,Z=map(int,input().split())\nprint(Z,\"\\t\",X,\"\\t\",Y)", "import java.util.*;\n\npublic class Main {\n\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n\n System.out.println(c + \" \" + a + \" \" + b);\n\n sc.close();\n }\n\n}", "b, c, a= input().split()\nprint(a, b, c) ", "a = input()\nb = a.split()\nprint(b[2]+' '+b[0]+' '+b[1])", "#include<cstdio>\nusing namespace std;\nint main(){\n\tint a,b,c;\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tprintf(\"%d %d %d\",c,a,b);\n\treturn 0;\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n int Y = sc.nextInt();\n int Z = sc.nextInt();\n String ans = Z + \" \" + X + \" \" + Y;\n System.out.println(ans);\n return;\n }\n}", "#include<iostream>\nusing namespace std;\n\nint main()\n{\n\t\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\n\tcout<<z<<\" \"<<x<<\" \"<<y;\n\tcout<<endl;\n\treturn 0;\n\n}", "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n\t//入力の読み込み\n\tScanner sc = new Scanner(System.in);\n\tint X = sc.nextInt();\n\tint Y = sc.nextInt();\n\tint Z = sc.nextInt();\n\n\t//出力\n\tSystem.out.println(Z + \" \" + X + \" \" + Y);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nsigned main(){\n\tint a,b,c;\n cin>>a>>b>>c;\n cout<<c<<\" \"<<a<<\" \"<<b<<endl;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n int x,y,z;\n cin >> x >>y >>z;\n cout << z<<endl <<x<<endl <<y;\n}", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n\tScanner sc = new Scanner(System.in);\n\tint A = sc.nextInt();\n\tint B = sc.nextInt();\n\tint C = sc.nextInt();\n\tint D = 0;\n\n\tD = A;\n\tA = C;\n\tC = B;\n\tB = D;\n\tSystem.out.println(A + \" \" + B + \" \" + C);\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n String S = \"\";\n Scanner sc = new Scanner(System.in);\n S = sc.nextLine();\n String[] S1 = S.split(\" \");\n System.out.println(S1[S1.length - 1]+\" \"+S1[0]+ \" \"+ S1[1]);\n }\n}\n", "#include<cstdio>\n\nint a, b, c;\n\nint main() {\n scanf(\"%d %d %d\", &a, &b, &c);\n printf(\"%d %d %d\\n\", c, a, b);\n}\n", "X = input().split()\nprint(X[2], X[0], X[1])\n", "m = map(int,raw_input().split())\nm[0],m[1] = m[1],m[0]\nm[0],m[-1] = m[-1],m[0]\nprint ' '.join([str(i) for i in m])\n", "X,Y,Z = map(int, input().split())\nprint(Z,X,Y,sep = ' ')", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint x, y, z;\n\nint main(){\n cin >> x >> y >> z;\n cout << z << \" \" << x << \" \" << y;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint A = stdIn.nextInt();\n\t\tint B = stdIn.nextInt();\n\t\tint C = stdIn.nextInt();\n\t\t\n\t\tSystem.out.println(C + \" \" + A + \" \" + B);\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint Y = sc.nextInt();\n\t\tint Z = sc.nextInt();\n\t\t\n\t\t\n\t\tSystem.out.println(Z+\" \"+X+\" \"+Y);\n\n\t\t\n\t}\n}\n\n\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int n1 = sc.nextInt();\n int n2 = sc.nextInt();\n int n3 = sc.nextInt();\n System.out.println(n3 + \" \" + n1 + \" \" + n2);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int x,y,z,tmp;\n cin>>x>>y>>z;\n cout<<z<<\" \"<<x<<\" \"<<y;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int x,y,z;\n cin>>x>>y>>z;\n cout<<z<<' '<<x<<' '<<y<<endl;\n}\n", "#include <iostream>\nusing namespace std;\nint main(){\n\tint x, y, z;\n\tcin >> x >> y >> z;\n\tcout << z << \" \" << x << \" \" << y << endl;;\n}", "#include <iostream>\n\nint main()\n{\n\tint x, y, z;\n\tstd::cin >> x >> y >> z;\n\tstd::cout << z << ' ' << x << ' ' << y;\n}\n", "import java.util.Scanner;\nimport java.lang.Math;\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n sc.close();\n\n System.out.print(C+\" \"+ A +\" \" + B);\n }\n}", "#include<iostream>\nint main(){\n long long int a,b,c;\n std::cin >> a >> b >> c;\n std::cout << c << \" \" << a << \" \" << b;\n return 0;\n}", "a,b,c=input().split()\nb,a=a,b\nc,a=a,c\nprint(a,b,c)\n\n", "#include <iostream>\nusing namespace std;\n \nint main() {\n\tint X, Y, Z;\n\tcin>>X>>Y>>Z;\n\tcout<<Z<<' '<<X<<' '<<Y;\n}" ]
Takahashi and Aoki are training for long-distance races in an infinitely long straight course running from west to east. They start simultaneously at the same point and moves as follows towards the east: * Takahashi runs A_1 meters per minute for the first T_1 minutes, then runs at A_2 meters per minute for the subsequent T_2 minutes, and alternates between these two modes forever. * Aoki runs B_1 meters per minute for the first T_1 minutes, then runs at B_2 meters per minute for the subsequent T_2 minutes, and alternates between these two modes forever. How many times will Takahashi and Aoki meet each other, that is, come to the same point? We do not count the start of the run. If they meet infinitely many times, report that fact. Constraints * 1 \leq T_i \leq 100000 * 1 \leq A_i \leq 10^{10} * 1 \leq B_i \leq 10^{10} * A_1 \neq B_1 * A_2 \neq B_2 * All values in input are integers. Input Input is given from Standard Input in the following format: T_1 T_2 A_1 A_2 B_1 B_2 Output Print the number of times Takahashi and Aoki will meet each other. If they meet infinitely many times, print `infinity` instead. Examples Input 1 2 10 10 12 4 Output 1 Input 100 1 101 101 102 1 Output infinity Input 12000 15700 3390000000 3810000000 5550000000 2130000000 Output 113
[ "t = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = t[0] * (a[0] - b[0])\ny = x + t[1] * (a[1] - b[1])\nif x*y > 0:\n\tprint(0)\nelif x*y == 0:\n\tprint('infinity')\nelif abs(x) % abs(y) == 0:\n\tprint(2 * (abs(x) // abs(y)))\nelse:\n\tprint(2 * (abs(x) // abs(y)) + 1)", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nA1 *= T1\nA2 *= T2\nB1 *= T1\nB2 *= T2\nif A1 > B1:\n A1, B1 = B1, A1\n A2, B2 = B2, A2\nC = B1 - A1\nD = A2 - B2\n\nif C == D:\n print(\"infinity\")\nelif C > D:\n print(0)\nelse:\n q, r = divmod(C, (D - C))\n if r == 0:\n print(2 * q)\n else:\n print(2 * q + 1)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong t1 = sc.nextLong();\n\t\tlong t2 = sc.nextLong();\n\t\tlong a1 = sc.nextLong();\n\t\tlong a2 = sc.nextLong();\n\t\tlong b1 = sc.nextLong();\n\t\tlong b2 = sc.nextLong();\n\n\t\tlong sub1 = (a1 - b1) * t1;\n\t\tlong sub2 = (a2 - b2) * t2;\n\n\t\tif (sub1 + sub2 == 0) {\n\t\t\tSystem.out.println(\"infinity\");\n\t\t\treturn;\n\t\t} else if (sub1 > 0 && sub2 > 0) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t} else if (sub1 < 0 && sub2 < 0) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tif (sub1 < 0) {\n\t\t\tsub1 = -sub1;\n\t\t\tsub2 = -sub2;\n\t\t}\n\n\t\tlong dist = sub1 + sub2;\n\n\t\tif (dist < 0) {\n\t\t\tif ((sub1 % (-dist) == 0)) {\n\t\t\t\tSystem.out.println((sub1 / (-dist)) * 2);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tSystem.out.println((sub1 / (-dist)) * 2 + 1);\n\t\t\treturn;\n\t\t}\n\t\tSystem.out.println(0);\n\t}\n\n}", "#include <iostream>\nusing namespace std;\nint main(void){\n long long t1, t2, a1, a2, b1, b2, c1, c2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n c1 = (a1 - b1) * t1;\n c2 = (a2 - b2) * t2;\n\n if(c1 < 0){\n c1 *= -1;\n c2 *= -1;\n }\n\n if(c1+c2 == 0){\n puts(\"infinity\");\n return 0;\n }else if(c1 < 0 || c1+c2 > 0){\n puts(\"0\");\n return 0;\n }\n long long c3 = - c1 - c2, ans;\n ans = c1 / c3 * 2 + 1;\n if(c1 % c3 == 0) ans--;\n cout << ans << endl;\n return 0;\n}\n", "import java.util.*;\n\npublic class Main {\n\n static long T1;\n static long T2;\n static long A1;\n static long A2;\n static long B1;\n static long B2;\n static void swap(long a, long b) {\n long tmp = a;\n a = b;\n b = tmp;\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n T1 = Long.parseLong(sc.next());\n T2 = Long.parseLong(sc.next());\n A1 = Long.parseLong(sc.next());\n A2 = Long.parseLong(sc.next());\n B1 = Long.parseLong(sc.next());\n B2 = Long.parseLong(sc.next());\n\n long ans = 0;\n long diff = 0;\n if ((A1*T1+A2*T2)-(B1*T1+B2*T2)==0) {\n if (A1==B1) System.out.println(0);\n else System.out.println(\"infinity\");\n return;\n }\n if ((A1*T1+A2*T2)-(B1*T1+B2*T2)<0) {\n long tmp_aa = A1;\n A1 = B1;\n B1 = tmp_aa;\n\n long tmp_bb = A2;\n A2 = B2;\n B2 = tmp_bb;\n // swap(A1, B1);\n // swap(A2, B2);\n }\n // if ((A1*T1+A2*T2)-(B1*T1+B2*T2)>0) {\n ans = 0L;\n diff = (A1*T1+A2*T2)-(B1*T1+B2*T2);\n\n if (A1>=B1) {\n ans = 0;\n } else {\n ans = ((B1*T1)-(A1*T1))/diff*2+1;\n if (((B1*T1)-(A1*T1))%diff==0) ans--;\n // System.out.println(((A1*T1+A2*T2)-(B1*T1))/diff*2);\n // ans = Math.min(((A1*T1+A2*T2)-(B1*T1))/diff*2+1, ans);\n }\n // System.out.println(\"A1, A2 \"+A1+\" \"+A2);\n // }\n System.out.println(ans);\n // System.out.println(diff);\n }\n}", "T1, T2 = [int(i) for i in input().split()]\nA1, A2 = [int(i) for i in input().split()]\nB1, B2 = [int(i) for i in input().split()]\n\nd1 = T1*(A1-B1)\nd2 = T2*(B2-A2)\n\nif d1 == d2:\n print('infinity')\n\nif d1 * (d2 - d1) < 0:\n print(0)\n\nif d1 * (d2 - d1) > 0:\n if d1 % (d2 - d1) != 0:\n print(d1 // (d2 - d1) * 2+ 1)\n else:\n print(d1 // (d2 - d1) * 2)", "\nT1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\np = (A1 - B1) * T1\nq = (A2 - B2) * T2\nif p < 0:\n p *= -1\n q *= -1\n\nif p + q > 0:\n print(0)\nelif p + q == 0:\n print('infinity')\nelse:\n s = -p // (p + q)\n t = -p % (p + q)\n if t != 0:\n print(s*2+1)\n else:\n print(s*2)\n", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\n\n\nif (b1 - a1) * t1 == (a2 - b2) * t2:\n print(\"infinity\")\n import sys\n sys.exit()\n\np1 = (b1 - a1) * t1 \np2 = (b1 - a1) * t1 + (b2 - a2) * t2\n\nif p1 * p2 > 0:\n print(0)\n import sys\n sys.exit()\n\nimport math\n\nif abs(p1)%abs(p2) == 0:\n print(2*math.ceil(abs(p1)/abs(p2)))\nelse:\n print(2*math.ceil(abs(p1)/abs(p2))-1)", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n ll t1,t2,a1,a2,b1,b2;cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n if(t1*a1+t2*a2==t1*b1+t2*b2){\n cout << \"infinity\" << endl;\n return 0;\n }\n ll c1=a1-b1;\n ll c2=a2-b2;\n if(c1<0){\n c1*=-1;\n c2*=-1;\n }\n if(c1*t1+c2*t2>0){\n cout << 0 << endl;\n return 0;\n }\n ll u=c1*t1;\n ll v=c1*t1+c2*t2;\n if(abs(u)%abs(v)==0){\n cout << abs(u)/abs(v)*2 << endl;\n }\n else{\n cout << abs(u)/abs(v)*2+1 << endl;\n }\n}", "#include <bits/stdc++.h>\n#define l_ength size\nconst int inf = (1<<30);\nconst int mod = 1000000007;\nusing ll = long long;\nusing namespace std;\n\nint main(){\n\tll t1, t2, a1, a2, b1, b2; cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\tif( a1 < b1 ){\n\t\tswap(a1, b1);\n\t\tswap(a2, b2);\n\t}\n\t// かならず a1 > b1\n\tll d = (t1*a1+t2*a2) - (t1*b1+t2*b2);\n\tif( d == 0 ){\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif( d > 0 ){\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\td *= (-1);\n\tll a = t1*a1-t1*b1;\n\tll p = (a+d-1)/d;\n\tll ex = 0;\n\tif( (t1*a1-t1*b1)%d == 0 ) ex = 1;\n\tcout << p*2-1+ex << endl;\n}", "#include <cstdio>\n#include <algorithm>\n\nint main()\n{\n long long t1, t2;\n long long a1, a2;\n long long b1, b2;\n scanf(\"%lld%lld%lld%lld%lld%lld\", &t1, &t2, &a1, &a2, &b1, &b2);\n if (t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2)\n {\n puts(\"infinity\");\n }\n else\n {\n long long dif = (t1 * a1 + t2 * a2) - (t1 * b1 + t2 * b2);\n if (dif < 0)\n {\n std::swap(a1, b1);\n std::swap(a2, b2);\n dif = -dif;\n }\n if (a1 > b1)\n {\n puts(\"0\");\n }\n else\n {\n printf(\"%lld\\n\", 2 * ((t1 * (b1 - a1) + dif - 1) / dif) - 1 + (t1 * (b1 - a1) % dif == 0 ? 1 : 0));\n }\n }\n return 0;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n long long t1,t2,a1,a2,b1,b2,c,d,n,res;\n cin >> t1 >> t2;\n cin >> a1 >> a2;\n cin >> b1 >> b2;\n if(a1>b1){\n c=t1*(a1-b1);\n d=t2*(b2-a2)-c;\n }else{\n c=t1*(b1-a1);\n d=t2*(a2-b2)-c;\n }\n if(d<0){\n cout << \"0\" << endl;\n return 0;\n }\n if(d==0){\n cout << \"infinity\" << endl;\n return 0;\n }\n n=c/d;\n res=2*n+1;\n if(c%d==0)\n res--;\n cout << res << endl;\n return 0;\n}", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nif (a1>b1 and a2>b2) or (b1>a1 and b2>a2):\n print(0)\nelif abs(a1-b1)*t1>abs(a2-b2)*t2:\n print(0)\nelif abs(a1-b1)*t1==abs(a2-b2)*t2:\n print('infinity')\nelse:\n d1=abs(a1-b1)*t1\n d2=abs(a2-b2)*t2\n l=0\n r=10**18+1\n while r-l!=1:\n mid=(l+r)//2\n if d1*(mid+1)-d2*mid<0:\n r=mid\n else:\n l=mid\n if d1*(l+1)-d2*l==0:\n print(2*l)\n else:\n print(2*l+1)", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\n\nAx = A1 * T1 + A2 * T2\nBx = B1 * T1 + B2 * T2\ndiff = abs(Ax - Bx)\n\nif diff == 0:\n print('infinity')\n exit()\n\nif not ((A1 * T1 > B1 * T1 and Ax < Bx) or (A1 * T1 < B1 * T1 and Ax > Bx)):\n print(0)\n exit()\n\n\nans = 2 * ((abs(B1 - A1) * T1) // diff)\nif (abs(B1 - A1) * T1) % diff != 0:\n ans += 1\nprint(ans)\n\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nA1 *= T1\nA2 *= T2\nB1 *= T1\nB2 *= T2\nif A1 > B1:\n A1, B1 = B1, A1\n A2, B2 = B2, A2\nC = B1 - A1\nD = A2 - B2\n\nif A1 + A2 == B1 + B2:\n print(\"infinity\")\n exit()\nelif C > D:\n print(0)\n exit()\n\nq, r = divmod(C, (D - C))\nif r == 0:\n print(2 * q)\nelse:\n print(2 * q + 1)", "from math import ceil\nt1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\na1 -= b1\na2 -= b2\na1 *= t1\na2 *= t2\nif a1 + a2 == 0:\n print(\"infinity\")\n exit()\nif a1*(a1+a2) > 0:\n print(0)\n exit()\n\nx = -a1/(a1+a2)\nn = ceil(x)\nif n == x:\n print(2*n)\nelse:\n print(2*n-1)", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\ndelta1 = (a1 - b1) * t1\ndelta2 = (a2 - b2) * t2\n\nif delta1 + delta2 == 0:\n print('infinity')\n exit()\n\nif delta1 * delta2 >= 0:\n print(0)\n exit()\n\nif abs(delta1) > abs(delta2):\n print(0)\n exit()\n\nsteps = abs(delta1 + delta2)\n\nans = 2 * (min(abs(delta1), abs(delta2)) // steps) + 1\n\nif min(abs(delta1), abs(delta2)) % steps == 0:\n ans -= 1\n\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = long long;\n\nint main()\n{\n i64 t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n i64 p = (a1 - b1) * t1, q = (a2 - b2) * t2;\n if (0 < p)\n {\n p *= -1;\n q *= -1;\n }\n if (p + q < 0)\n cout << 0 << endl;\n else if (p + q == 0)\n cout << \"infinity\" << endl;\n else if (-p % (p + q) == 0)\n cout << -p / (p + q) * 2 << endl;\n else\n cout << -p / (p + q) * 2 + 1 << endl;\n return 0;\n}\n", "import java.util.*;\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\tlong T1, T2;\n\tlong A1, A2;\n\tlong B1, B2;\n\tlong times = 1;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t\tins.calc();\n\t\tins.showResult();\n\t}\n\n\tMain(BufferedReader in) throws IOException {\n\t\tString[] tokens = in.readLine().split(\" \");\n\t\tT1 = Long.parseLong(tokens[0]);\n\t\tT2 = Long.parseLong(tokens[1]);\n\t\ttokens = in.readLine().split(\" \");\n\t\tA1 = Long.parseLong(tokens[0]);\n\t\tA2 = Long.parseLong(tokens[1]);\n\t\ttokens = in.readLine().split(\" \");\n\t\tB1 = Long.parseLong(tokens[0]);\n\t\tB2 = Long.parseLong(tokens[1]);\n\t}\n\n\tvoid calc() {\n\t\tlong diff1 = B1 - A1;\n\t\tlong diff2 = B2 - A2;\n\t\tif ((diff1 * T1 + diff2 * T2) == 0L) {\n\t\t\ttimes = -1;\n\t\t} else if (notMeet(diff1, diff2)) {\n\t\t\ttimes = 0;\n\t\t} else {\n\t\t\tlong middlePos = Math.abs(diff1 * T1);\n\t\t\tlong cyclePos = Math.abs(diff1 * T1 + diff2 * T2);\n\t\t\tif (middlePos < cyclePos) {\n\t\t\t\ttimes = 1;\n\t\t\t} else if (middlePos % cyclePos == 0) {\n\t\t\t\ttimes = middlePos / cyclePos * 2;\n\t\t\t} else {\n\t\t\t\ttimes = middlePos / cyclePos * 2 + 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tboolean notMeet(long diff1, long diff2) {\n\t\tif (diff1 * T1 < 0 && (diff1 * T1 + diff2 * T2) < 0) {\n\t\t\treturn true;\n\t\t} else if (diff1 * T1 > 0 && (diff1 * T1 + diff2 * T2) > 0) {\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid showResult() {\n\t\tif (times < 0) {\n\t\t\tSystem.out.println(\"infinity\");\n\t\t} else {\n\t\t\tSystem.out.println(times);\n\t\t}\n\t}\n}", "t = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\ncycle = t[0] * (a[0] - b[0]) + t[1] * (a[1] - b[1])\n\nif(cycle == 0):\n print('infinity')\n exit()\n\nafter_t1 = t[0] * (a[0] - b[0])\n\nif(cycle * after_t1 > 0):\n print(0)\n exit()\n\nafter_t1 = abs(after_t1)\ncycle = abs(cycle)\n\nans = 1 + 2 * (after_t1//cycle) - (after_t1 % cycle == 0) * 1\n\nprint(ans)", "T1,T2 = map(int, input().split())\nA1,A2 = map(int, input().split())\nB1,B2 = map(int, input().split())\nd1,d2 = (A1-B1)*T1,(A2-B2)*T2\nif d1 < 0: d1,d2 = -d1,-d2\nif d1+d2 == 0: print(\"infinity\")\nelif d1+d2>0: print(0)\nelif d1 % (-(d1+d2)) == 0: print(d1//(-(d1+d2))*2)\nelse: print(d1//(-(d1+d2))*2+1)", "T1,T2 = map(int,input().split())\nA1,A2 = map(int,input().split())\nB1,B2 = map(int,input().split())\nA1 -= B1\nA2 -= B2\nif A1 < 0:\n A1 *= -1\n A2 *= -1\n\nif A1*T1 > -A2*T2:\n print(0)\nelif A1*T1 == -A2*T2:\n print(\"infinity\")\nelse:\n dx = -A2*T2 -A1*T1\n ans = (A1*T1)//dx *2 +1\n if (A1*T1)%dx == 0:\n ans -= 1\n print(ans)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong t1 = sc.nextLong();\n\t\tlong t2 = sc.nextLong();\n\t\tlong a1 = sc.nextLong();\n\t\tlong a2 = sc.nextLong();\n\t\tlong b1 = sc.nextLong();\n\t\tlong b2 = sc.nextLong();\n\t\tsc.close();\n\n\t\tif (a1 > b1) {\n\t\t\tlong z = a1;\n\t\t\ta1 = b1;\n\t\t\tb1 = z;\n\t\t\tz = a2;\n\t\t\ta2 = b2;\n\t\t\tb2 = z;\n\t\t}\n\n\t\tlong c1 = a1 * t1;\n\t\tlong c2 = a2 * t2;\n\t\tlong d1 = b1 * t1;\n\t\tlong d2 = b2 * t2;\n\t\tlong c = c1 + c2;\n\t\tlong d = d1 + d2;\n\t\tif (c == d) {\n\t\t\tSystem.out.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif (c < d) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tlong x1 = d1 - c1;\n\t\tlong x = c - d;\n\t\tlong ans = 1;\n\t\tans += x1 / x * 2;\n\t\tif (x1 % x == 0) {\n\t\t\tans--;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "#include <bits/stdc++.h>\n#define Int int64_t\n\nusing namespace std;\n\nint main() {\n\tInt T1, T2, A1, A2, B1, B2;\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\n\tInt P = T1 * (A1 - B1);\n\tInt Q = T2 * (A2 - B2);\n\n\tif (P > 0) {\n\t\tP *= -1;\n\t\tQ *= -1;\n\t}\n\n\tif (P + Q == 0) {\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif (P + Q < 0) { \n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\n\tInt ans = -P / (P + Q) * 2;\n\tif (-P % (P + Q) != 0) { ++ans; }\n\tcout << ans << endl;\n\n\treturn 0;\n}\n", "T1,T2,A1,A2,B1,B2=map(int, open(0).read().split())\nD1,D2 = (A1-B1)*T1, (A1-B1)*T1+(A2-B2)*T2\nif D1*D2 > 0: print(0)\nelif D2 == 0: print(\"infinity\")\nelif -D1%D2 == 0: print(-D1//D2*2)\nelse: print(-D1//D2*2+1)", "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\n\nsigned main(){\n\tlint t1, t2; cin >> t1 >> t2;\n\tlint a1, a2, b1, b2; cin >> a1 >> a2 >> b1 >> b2;\n\tlint P = (a1 - b1) * t1;\n\tlint Q = (a2 - b2) * t2;\n\tif(P > 0) P *= -1, Q *= -1;\n\tif(P == -Q){\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif(P + Q < 0){\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tlint ans = 0;\n\tlint S = -P / (P + Q), T = -P % (P + Q);\n\tif(T == 0) ans = S * 2;\n\telse ans = S * 2 + 1;\n\tcout << ans << endl;\n}\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nd = (T1 * A1 - T1 * B1) + (T2 * A2 - T2 * B2)\nd1 = (T1 * A1 - T1 * B1)\n\nimport math\nif d == 0:\n ans = 'infinity'\nelse:\n ans = 0\n\n # T1\n if d1 == 0:\n ans += 1\n elif d * d1 < 0:\n ans += abs(d1) // abs(d)\n\n # T2\n if d1 * d < 0:\n ans += math.ceil(abs(d1) / abs(d))\n\nprint(ans)\n", "tt = list(map(int, input().split()))\naa = list(map(int, input().split()))\nbb = list(map(int, input().split()))\n\np = (aa[0] - bb[0]) * tt[0]\nq = (aa[1] - bb[1]) * tt[1]\n\nif p > 0:\n\tp *= -1\n\tq *= -1\n\nif p + q < 0:\n\tprint(0)\nelif p + q == 0:\n\tprint(\"infinity\")\nelse:\n\tr, s = divmod((-1 * p), (p + q))\n\tif s == 0:\n\t\tprint(r * 2)\n\telse:\n\t\tprint(r * 2 + 1)", "# -*- coding: utf-8 -*-\n# \nimport math\nimport sys\nimport itertools\n#import numpy as np\n\n# なんこか入力\na,b = map(int, input().split())\n# なんこか入力\nc,d = map(int, input().split())\n# なんこか入力\ne,f = map(int, input().split())\n\np = (e-c)*a\nq = (f-d)*b\n#print(p,q)\nif p*q >0 or p*(p+q)>0:\n print(\"0\")\nelif p == -q:\n print(\"infinity\")\nelif (-p) % (p+q) == 0:\n print(-p//(p+q)*2)\nelse:\n print(-p//(p+q)*2+1)\n\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\nimport java.util.PriorityQueue;\n\npublic class Main {\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n long t1 = sc.nextLong();\n long t2 = sc.nextLong();\n long a1 = sc.nextLong();\n long a2 = sc.nextLong();\n long b1 = sc.nextLong();\n long b2 = sc.nextLong();\n\n if(t1*a1 + t2*a2 == t1*b1+t2*b2){\n System.out.println(\"infinity\");\n return;\n }\n\n if(t1*a1 + t2*a2 < t1*b1+t2*b2){\n long tmp = a1;\n a1 = b1;\n b1 = tmp;\n tmp = a2;\n a2 = b2;\n b2 = tmp;\n }\n\n if(a1 > b1){\n System.out.println(0);\n return;\n }\n if(a1 == b1){\n System.out.println(1);\n return;\n } \n\n long la1 = a1 * t1;\n long la2 = a2 * t2;\n long la3 = la1 + la2;\n long lb1 = b1 * t1;\n long lb2 = b2 * t2;\n long lb3 = lb1 + lb2;\n\n long ans = (b1*t1-a1*t1) / (t1*a1 + t2*a2 - t1*b1-t2*b2) * 2 + 1;\n if((b1*t1-a1*t1) % (t1*a1 + t2*a2 - t1*b1-t2*b2) == 0) ans--;\n System.out.println(ans);\n }\n\n\n\n private static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n}\n\n", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nx,y=t1*(a1-b1),t2*(a2-b2)\nif (x+y)==0:\n print(\"infinity\")\nelif x*(x+y)>0:\n print(0)\nelse:\n if x>0:\n x1,x2=x,x+y\n else:\n x1,x2=-x,-(x+y)\n if x1%x2==0:\n print(2*abs(x1//x2))\n else:\n print(2*abs(x1//x2)-1)\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nD1 = T1 * A1 - T1 * B1\nD2 = T1 * A1 + T2 * A2 - T1 * B1 - T2 * B2\n\nif D1 * D2 > 0:\n print(0)\nelif D2 == 0:\n print(\"infinity\")\nelse:\n D1 = abs(D2 - D1)\n D2 = abs(D2)\n c = (D1 // D2) * 2 - 1\n if D1 % D2 == 0:\n c -= 1\n print(c)\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst ll MOD = 1e9 + 7;\n\nint main() {\n\tll T1, T2;\n\tcin >> T1 >> T2;\n\tll A1, A2;\n\tcin >> A1 >> A2;\n\tll B1, B2;\n\tcin >> B1 >> B2;\n\tif (A1 > B1) {\n\t\tswap(A1, B1);\n\t\tswap(A2, B2);\n\t}\n\tll diff = A1 * T1 + A2 * T2 - (B1*T1 + B2 * T2);\n\tif (diff < 0) {\n\t\tcout << 0 << endl;\n\t}\n\telse if (diff == 0) {\n\t\tcout << \"infinity\" << endl;\n\t}\n\telse {\n\t\tll tot = (B1 - A1)*T1;\n\t\tll cnt = 1 + tot / diff * 2;\n\t\tif (tot >= diff && tot%diff == 0) cnt--;\n\t\tcout << cnt << endl;\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define INF 1LL<<62\n#define inf 1000000007\n\nint main() {\n\tll t1,t2,a1,a2,b1,b2;\n\tcin>>t1>>t2>>a1>>a2>>b1>>b2;\n\tif(a1<b1){\n\t\tswap(a1,b1);\n\t\tswap(a2,b2);\n\t}\n\tll ma=(a1-b1)*t1;\n\tll mi=ma+t2*(a2-b2);\n\tif(mi==0){\n\t\tcout<< \"infinity\";\n\t}\n\telse if(mi>0){\n\t\tcout << 0;\n\t}\n\telse{\n\t\tmi=abs(mi);\n\t\tif(ma%mi==0){\n\t\t//\tcout << \"k\";\n\t\t\tcout << 2*(ma/mi);\n\t\t}\n\t\telse{\n\t\t\tcout << 1+2*(ma/mi);\n\t\t}\n\t}\n\t// your code goes here\n\treturn 0;\n}", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\n\ns1=a1*t1+a2*t2\ns2=b1*t1+b2*t2\nts=t1+t2\nif s1==s2:\n print(\"infinity\")\n exit()\nfaster=1 if s1>s2 else 2\n\nif (a1>b1 and faster==1) or (a1<b1 and faster==2):\n print(0)\n exit()\n\nif faster==2:\n a1,b1=b1,a1\n a2,b2=b2,a2\n\nd=abs(s1-s2)\ncnt=(b1*t1-a1*t1)//d\nr=(b1*t1-a1*t1)%d\nprint(cnt*2+1 if r!=0 else cnt*2)\n", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\ns1=t1*a1+t2*a2\ns2=t1*b1+t2*b2\nif s1>s2:\n\ts2,s1=s1,s2\nif s1==s2:\n\tprint(\"infinity\")\n\texit()\nimport math\ncnt=math.ceil(s1/(s2-s1))\naa=t1*a1\nbb=t1*b1\naaa=t1*a1+t2*a2\nbbb=t1*b1+t2*b2\nif (aa>bb and aaa>bbb) or (aa<bb and aaa<bbb):\n\tprint(0)\n\texit()\nq=abs(aa-bb)\nans=q//(s2-s1)*2+1\nif q%(s2-s1)==0:\n\tans-=1\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#define rep(i,s,n) for(int i = s; i < (int)(n); i++)\n\nint main() {\n int t1,t2;ll a1,a2,b1,b2,p,q;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n p = (a1-b1)*t1;q = (a2-b2)*t2;\n if(p > 0){p *= -1;q *= -1;}\n if(p+q < 0){cout << 0 << endl;return 0;}\n else if(p+q == 0){cout << \"infinity\" << endl;return 0;}\n else{\n ll s = -p/(p+q),t = (-p)%(p+q);\n if(t != 0) cout << s*2+1 << endl;\n else cout << s*2 << endl;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n ll t1,t2,a1,a2,b1,b2; cin>>t1>>t2>>a1>>a2>>b1>>b2;\n ll x1=t1*a1,x2=t2*a2,y1=t1*b1,y2=t2*b2;\n if(x1+x2==y1+y2){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n if((x1+x2)>(y1+y2) && a1>b1){\n cout<<0<<endl;\n return 0;\n }else if((x1+x2)<(y1+y2) && a1<b1){\n cout<<0<<endl;\n return 0;\n }else{\n if(a1>b1){ //aのほうが常に長い距離にする\n swap(a1,b1); swap(a2,b2);\n swap(x1,y1); swap(x2,y2);\n }\n ll d=y1-x1,diff=(x1+x2)-(y1+y2);\n ll ans=1,i=1;\n ans+=(d/diff)*2;\n if(d%diff==0) ans--;\n cout<<ans<<endl;\n return 0;\n }\n}", "import sys\n\nt1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\na = a1 * t1 + a2 * t2\nb = b1 * t1 + b2 * t2\nha = a1 * t1\nhb = b1 * t1\nif a == b or ha == hb:\n print (\"infinity\")\n sys.exit(0)\n\nif a > b:\n a, b = b, a\n ha, hb = hb, ha\n\ngap = b - a\nhgap = ha - hb\n\nif hgap < 0:\n print (0)\n sys.exit(0)\n\nans = 2 * (hgap // gap) + (1 if hgap % gap > 0 else 0)\nprint (ans)\n\n\n", "import java.io.PrintStream;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main(new Scanner(System.in), System.out, System.err).exec();\n\t}\n\tpublic final Scanner sc;\n\tpublic final PrintStream out, err;\n\tpublic Main(final Scanner sc, final PrintStream out, final PrintStream err) {\n\t\tthis.sc = sc;this.out = out;this.err = err;\n\t}\n\tstatic public final long pair(int a, int b) {return (((long)a) << 32) + b;}\n\tstatic public final int getPair1(long v) {return (int)(v >> 32);}\n\tstatic public final int getPari2(long v) {return (int)(v & 0xFFFFFFFF);}\n\n\tstatic public final long quad(long a, long b, long c, long d) {\n\t\treturn ((a&0xFFFF)<< 48) + ((b&0xFFFF)<< 32) + ((c&0xFFFF)<< 16) +(d&0xFFFF);}\n\tstatic public final int getQuad1(long v) {return (int)( v >> 48 );}\n\tstatic public final int getQuad2(long v) {return (int)((v >> 32) & 0xFFFF);}\n\tstatic public final int getQuad3(long v) {return (int)((v >> 16) & 0xFFFF);}\n\tstatic public final int getQuad4(long v) {return (int)( v & 0xFFFF);}\n\n\tstatic public final long record(int e, int m, int i) {\n\t\treturn quad(-1, e, m, i);\n\t}\n\tstatic public final int re(long record) {\n\t\treturn getQuad2(record);\n\t}\n\tstatic public final int rm(long record) {\n\t\treturn getQuad3(record);\n\t}\n\tstatic public final int ri(long record) {\n\t\treturn getQuad4(record);\n\t}\n\n\t//------------------------------------------\n\n\tprivate int p;\n\tprivate int[] inv;\n\tprivate int[] fact;\n\tprivate int[] finv;\n\tpublic final int mod(long v) {\n\t\tv %= p;\n\t\treturn (int)(v < 0 ? v+p : v);\n\t}\n\tpublic final int mul(long a, long b) {\n\t\treturn mod(a*b);\n\t}\n\tpublic final void initFact(double limit, double p) {\n\t\tinitFact((int)limit, (int)p);\n\t}\n\tpublic final void initFact(int limit, int p) {\n\t\tthis.p = p;\n\t\tthis.inv = new int[limit+1];\n\t\tthis.fact = new int[limit+1];\n\t\tthis.finv = new int[limit+1];\n\t\tfact[1] = finv[1] = inv[0] = inv[1] = 1;\n\t\tfor(int i=2;i<=limit;i++) {\n\t\t\tint a = p / i;\n\t\t\tint b = p % i;\n\t\t\tinv[i] = mul(-a, inv[b]);\n\t\t\tfact[i] = mul(fact[i-1], i);\n\t\t\tfinv[i] = mul(finv[i-1], inv[i]);\n\t\t}\n\t}\n\tpublic final int comb(int m, int n) {\n\t\treturn mul(mul(fact[m], finv[n]), finv[m-n]);\n\t}\n\n\t//------------------------------------------\n\n\tpublic void exec() throws Exception{\n\t\tfinal long T1 = sc.nextLong();\n\t\tfinal long T2 = sc.nextLong();\n\t\tlong A1 = sc.nextLong();\n\t\tlong A2 = sc.nextLong();\n\t\tlong B1 = sc.nextLong();\n\t\tlong B2 = sc.nextLong();\n\t\tlong AD = T1*A1+T2*A2;\n\t\tlong BD = T1*B1+T2*B2;\n\t\tif(AD==BD){\n\t\t\t// 合計で同じ距離を進む場合、T1+T2倍数時点で毎回であう。\n\t\t\tout.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif(AD<BD) {\n\t\t\t// 早いほうをAにする。\n\t\t\tlong tmp = A1;\n\t\t\tA1 = B1;\n\t\t\tB1 = tmp;\n\t\t\ttmp = A2;\n\t\t\tA2 = B2;\n\t\t\tB2 = tmp;\n\t\t\tAD = T1*A1+T2*A2;\n\t\t\tBD = T1*B1+T2*B2;\n\t\t}\n//\t\terr.println(A1+\",\"+A2+\",\"+AD);\n//\t\terr.println(B1+\",\"+B2+\",\"+BD);\n\t\tif(A1>B1) {\n\t\t\t// トータルでAのほうが早いかつ、初動もAのほうが早い場合、\n\t\t\t// Bはいつまでも追いつくことができないため、回数は0回になる。\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\t// それ以外の場合、初動の位置が、T1での移動で追いつく範囲であれば、\n\t\t// 出会うことがあるが、それ以上離れてしまった場合、初動の追い上げでも出会うことはない。\n\t\tlong diff = AD - BD; // T1+T2で話される距離。\n//\t\terr.println(\"diff = \"+diff);\n\n\t\tlong N = ((T1)*(B1-A1)) / diff; // 何回まで追いつく可能性があるか。\n\t\tlong mod = ((T1)*(B1-A1)) % diff; // ピッタリか判定する。\n//\t\terr.println(\"N = \"+N);\n\t\tif(mod == 0) {\n\t\t\t// ピッタリの場合、あと1回。原点抜かすのでー1．\n\t\t\tout.println(N*2);\n\t\t}else {\n\t\t\t//　ピッタリではない場合、あと2回、原点抜かすのでー１．\n\t\t\tout.println(N*2+1);\n\t\t}\n\t}\n}\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\tlong long t1,t2,a1,a2,b1,b2;\n\tcin>>t1>>t2>>a1>>a2>>b1>>b2;\n\tlong long d1=(b1-a1)*t1,d2=(b2-a2)*t2;\n\tif(d1+d2==0){\n\t\tcout<<\"infinity\";\n\t\treturn 0;\n\t}\n\tif(d1<0){\n\t\td1*=-1;\n\t\td2*=-1;\n\t}\n\tif(d1+d2>0){\n\t\tcout<<0;return 0;\n\t}\n\tlong long x=-(d1+d2);\n\tif(d1%x){\n\t\tcout<<2*(d1/x)+1 ;\n\t}\n\telse cout<<2*(d1/x);\n\n}", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\nc1 = t1*(a1-b1)\nc2 = t2*(a2-b2)\nd = c1 + c2\nif d == 0:\n print(\"infinity\")\nelif c1*c2 > 0 or c1*d > 0:\n print(0)\nelse:\n if abs(c1)%abs(d)==0:\n print((abs(c1)//abs(d))*2)\n else:\n print((abs(c1)//abs(d))*2+1)", "import static java.lang.Math.abs;\n\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.Iterator;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n static void solve(MyScanner in, MyWriter out) {\n long t1 = in.nextLong();\n long t2 = in.nextLong();\n long a1 = in.nextLong();\n long a2 = in.nextLong();\n long b1 = in.nextLong();\n long b2 = in.nextLong();\n\n long d1 = a1 * t1 - b1 * t1;\n long d2 = a2 * t2 - b2 * t2;\n int s1 = Long.signum(d1);\n int s2 = Long.signum(d2);\n\n if (s1 == s2 || abs(d1) > abs(d2)) {\n out.println(0);\n } else if (abs(d1) == abs(d2)) {\n out.println(\"infinity\");\n } else {\n long m = abs(d1);\n long n = abs(d2) - abs(d1);\n long q = m / n;\n long r = m % n;\n out.println(q * 2 + (r == 0 ? 0 : 1));\n }\n }\n\n public static void main(String[] args) {\n MyWriter w = new MyWriter(System.out);\n solve(new MyScanner(System.in), w);\n w.flush();\n }\n\n static final class MyScanner {\n static final int BUFFER_SIZE = 8192;\n private final InputStream in;\n private final byte[] buffer = new byte[BUFFER_SIZE];\n private int point;\n private int readLength;\n MyScanner(InputStream in) {\n this.in = in;\n }\n private byte readByte() {\n if (point < readLength) {\n byte result = buffer[point];\n point += 1;\n return result;\n }\n try {\n readLength = in.read(buffer);\n } catch (IOException e) {\n throw new AssertionError(null, e);\n }\n if (readLength == -1) {\n return -1;\n }\n point = 1;\n return buffer[0];\n }\n private static boolean isPrintableCharExceptSpace(byte c) {\n return 33 <= c && c <= 126;\n }\n public char nextChar() {\n byte c = readByte();\n while (!(c == -1 || isPrintableCharExceptSpace(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n return (char)c;\n }\n public String next() {\n return next(16);\n }\n public String next(int n) {\n byte c = readByte();\n while (!(c == -1 || isPrintableCharExceptSpace(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n StringBuilder b = new StringBuilder(n);\n do {\n b.append((char)c);\n c = readByte();\n } while (c != -1 && isPrintableCharExceptSpace(c));\n return b.toString();\n }\n public long nextLong() {\n byte c = readByte();\n while (!(c == -1 || isPrintableCharExceptSpace(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n boolean minus = false;\n if (c == '-') {\n minus = true;\n c = readByte();\n }\n long result = 0L;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n result = result * 10L + (c - '0');\n c = readByte();\n } while (c != -1 && isPrintableCharExceptSpace(c));\n return minus ? -result : result;\n }\n public int nextInt() {\n long n = nextLong();\n if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE) {\n throw new InputMismatchException();\n }\n return (int)n;\n }\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n public int[] nextIntArray(int n) {\n int[] result = new int[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextInt();\n }\n return result;\n }\n public long[] nextLongArray(int n) {\n long[] result = new long[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextLong();\n }\n return result;\n }\n public char[] nextCharArray(int n) {\n char[] result = new char[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextChar();\n }\n return result;\n }\n public char[][] next2dCharArray(int n, int m) {\n char[][] result = new char[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n result[i][j] = nextChar();\n }\n }\n return result;\n }\n public int[][] nextVerticalIntArrays(int arrayCount, int arrayLength) {\n int[][] result = new int[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextInt();\n }\n }\n return result;\n }\n public long[][] nextVerticalLongArrays(int arrayCount,\n int arrayLength) {\n long[][] result = new long[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextLong();\n }\n }\n return result;\n }\n public char[][] nextVerticalCharArrays(int arrayCount,\n int arrayLength) {\n char[][] result = new char[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextChar();\n }\n }\n return result;\n }\n }\n static final class MyWriter extends PrintWriter {\n MyWriter(OutputStream out) {\n super(out);\n }\n public void joinAndPrintln(int[] x) {\n joinAndPrintln(x, \" \");\n }\n public void joinAndPrintln(int[] x, String delimiter) {\n StringBuilder b = new StringBuilder();\n if (x.length > 0) {\n b.append(x[0]);\n for (int i = 1; i < x.length; i++) {\n b.append(delimiter).append(x[i]);\n }\n }\n println(b.toString());\n }\n public void joinAndPrintln(long[] x) {\n joinAndPrintln(x, \" \");\n }\n public void joinAndPrintln(long[] x, String delimiter) {\n StringBuilder b = new StringBuilder();\n if (x.length > 0) {\n b.append(x[0]);\n for (int i = 1; i < x.length; i++) {\n b.append(delimiter).append(x[i]);\n }\n }\n println(b.toString());\n }\n public void joinAndPrintln(Iterable<?> iterable) {\n joinAndPrintln(iterable, \" \");\n }\n public void joinAndPrintln(Iterable<?> iterable, String delimiter) {\n StringBuilder b = new StringBuilder();\n for (Iterator<?> i = iterable.iterator(); i.hasNext();) {\n b.append(i.next());\n while (i.hasNext()) {\n b.append(delimiter).append(i.next());\n }\n }\n println(b.toString());\n }\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll mod = 1000000007;\nconst ll mod998 = 998244353;\nconst ll intmax = 2147483647;\nconst ll llmax = 9223372036854775807;\nconst char sp = ' ';\n\nll T1, T2, A1, A2, B1, B2;\n\nint main() {\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\tA1 -= B1;\n\tA2 -= B2;\n\tif (A1*T1 + A2*T2 == 0) {\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif (A1*T1 + A2*T2 > 0) {\n\t\tA1 = -A1;\n\t\tA2 = -A2;\n\t}\n\tif (A1*T1 < 0) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tll X = A1*T1;\n\tll Y = -(A1*T1 + A2*T2);\n\tif (X%Y == 0) {\n\t\tcout << X / Y * 2 << endl;\n\t}\n\telse {\n\t\tcout << X / Y * 2 + 1 << endl;\n\t}\n}", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\nif a1>b1:\n a1, a2, b1, b2 = b1, b2, a1, a2\ninit = (a1-b1)*t1+(a2-b2)*t2\nif init<0:\n print(0)\n exit(0)\nelif init==0:\n print('infinity')\n exit(0)\nlim = (b1-a1)*t1\nif lim%init==0:\n print(lim//init*2)\nelse:\n print(lim//init*2+1)", "#include <bits/stdc++.h>\n#define Int int64_t\n\nusing namespace std;\n\nint main() {\n\tInt T1, T2, A1, A2, B1, B2;\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\n\tInt Tx = T1 * A1 + T2 * A2;\n\tInt Ax = T1 * B1 + T2 * B2;\n\n\tif (Tx == Ax) {\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\n\tInt Tx1 = T1 * A1;\n\tInt Ax1 = T1 * B1;\n\tif ((Tx1 < Ax1 && Tx < Ax) || (Tx1 > Ax1 && Tx > Ax)) {\n\t\tcerr << \"fu\" << endl;\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\n\tif (Tx > Ax) {\n\t\tswap(Ax1, Tx1);\n\t\tswap(Ax, Tx);\n\t}\n\tInt x = (Tx1 - Ax1) / (Ax - Tx);\n\tInt ans = 2 * x;\n\tif ((Tx1 - Ax1) % (Ax - Tx) != 0) { ++ans; }\n\t\n\tcout << ans << endl;\n\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll t1,t2,a1,a2,b1,b2; cin >>t1>>t2>>a1>>a2>>b1>>b2;\n ll p,q;\n p=(a1-b1)*t1; q=(a2-b2)*t2;\n if(p>0){\n p=-p; q=-q;\n }\n if(p+q<0){\n cout << 0 << endl;\n }else if(p+q==0){\n cout << \"infinity\"<<endl;\n }else{\n ll r=-p/(p+q);\n ll s=-p%(p+q);\n if(s==0){\n cout << r*2 << endl;\n }else{\n cout << r*2+1 << endl;\n }\n }\n}", "T1, T2 = map(int,input().split())\nA1, A2 = map(int,input().split())\nB1, B2 = map(int,input().split())\n\nLA = T1*A1+T2*A2\nLB = T1*B1+T2*B2\nif LA == LB:\n print(\"infinity\")\n exit()\nelif LA < LB:\n LA, LB = LB, LA \n A1, B1 = B1, A1\n A2, B2 = B2, A2\n\nl = LA - LB\nr = T1*B1-T1*A1 \nif r < 0:\n print(0)\n exit()\nelse:\n # print(\"===\")\n # print(l,r)\n if r%l==0:\n print( (r//l)*2)\n else:\n print( (r//l)*2 +1 )\n", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\nll t1,t2,a1,b1,a2,b2;\nint main() {\n\tscanf(\"%lld%lld%lld%lld%lld%lld\",&t1,&t2,&a1,&a2,&b1,&b2);\n\tif(a1*t1+a2*t2==b1*t1+b2*t2) printf(\"infinity\\n\");\n\telse {\n\t\tif(a1>b1) swap(a1,b1),swap(a2,b2);\n\t\tif(a1*t1+a2*t2<b1*t1+b2*t2) printf(\"0\\n\");\n\t\telse {\n\t\t\tll x=a1*t1+a2*t2-b1*t1-b2*t2,y=b1*t1-a1*t1;\n\t\t\tprintf(\"%lld\\n\",(y/x)*2+(y%x?1:0));\n\t\t}\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i=0; i<(n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n\nint main(){\n ll t1,t2,a1,a2,b1,b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n a1*=t1;\n b1*=t1;\n a2*=t2;\n b2*=t2;\n if(a1+a2<b1+b2){\n swap(a1,b1);\n swap(a2,b2);\n }\n if(a1+a2==b1+b2){cout<<\"infinity\"<<endl; return 0;}\n if(a1>b1){cout<<0<<endl; return 0;}\n ll c=b1-a1;\n ll d=(a1+a2)-(b1+b2);\n ll ans=(c/d+1)*2-1;\n if(c%d==0)ans--;\n cout<<ans<<endl;\n}", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n int t1 = sc.nextInt();\n int t2 = sc.nextInt();\n long a1 = sc.nextLong();\n long a2 = sc.nextLong();\n long b1 = sc.nextLong();\n long b2 = sc.nextLong();\n long p = (a1-b1)*t1;\n long q = (a2-b2)*t2;\n if (p>0){\n p*=-1;\n q*=-1;\n }\n if (p+q<0)System.out.println(0);\n else if (p+q==0)System.out.println(\"infinity\");\n else {\n long ans = (-p-q%(p+q))/(p+q)*2;\n if (q%(p+q)!=0)ans++;\n System.out.println(ans);\n }\n }\n\n public static long MOD = 1000000007L;\n public static int tenE9 = 1000000000;\n static Basic basic = new Basic();\n static FastScanner sc = new FastScanner();\n public static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n }\n public static class Basic {\n //math\n private final int MAX = 51;\n private final long MOD = Main.MOD;\n private final long[] fac = new long[MAX];\n private final long[] finv = new long[MAX];\n private final long[] inv = new long[MAX];\n public long factorial(long num) {\n if (num < 2) return 1;\n else return num * factorial(num - 1);\n }\n public long modFactorial(long num) {\n if (num < 2) return 1;\n else return num*modFactorial(num-1)%MOD;\n }\n public int arraySum(int[] array) {\n int ans = 0;\n for (int value : array) ans += value;\n return ans;\n }\n public double log(double base, double antilogarithm) {\n return Math.log(antilogarithm) / Math.log(base);\n }\n public long gcd(long x, long y) {\n if (y == 0) return x;\n else return gcd(y, x % y);\n }\n public long lcm(long x, long y) {\n return x / gcd(x, y) * y;\n }\n public HashMap<Long, Long> factorization(long num) {\n HashMap<Long, Long> hash = new HashMap<>();\n long n = num;\n long count = 2;\n while (n > 1) {\n while (n % count == 0) {\n n /= count;\n if (hash.containsKey(count)) hash.put(count, hash.get(count) + 1);\n else hash.put(count, 1L);\n }\n count++;\n }\n return hash;\n }\n public int sum(int[] num) {\n int ans = 0;\n for (int i = 0; i < num.length; i++) {\n ans += num[i];\n }\n return ans;\n }\n public int[] reduce(int small, int big) {\n int ins = 2;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n } else {\n ins++;\n }\n }\n return new int[]{small, big};\n }\n public int reduceCount(int small, int big) {\n int ins = 2;\n int ans = 0;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n ans++;\n } else {\n ins++;\n }\n }\n return ans;\n }\n public int binarySearch(int[] array, int target) {\n int pos = -1;\n int left = 0;\n int right = array.length - 1;\n int middle;\n while (pos == -1 && left <= right) {\n middle = (left + right) / 2;\n if (array[middle] == target) pos = middle;\n else if (array[middle] > target) right = middle - 1;\n else left = middle + 1;\n }\n return pos;\n }\n public int upperBound(int[] ar, long d, int n, int f){\n int p = n;\n int q = f;\n while (p-q>1){\n int mid = (p+q)/2;\n if (ar[mid]==d){\n return mid+1;\n }\n if (ar[mid]<d)q=mid;\n else p=mid;\n\n }\n return p;\n }\n public long modPow(long a, long n, long mod) {\n long res = 1;\n while (n > 0) {\n if ((n & 1) != 0) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n public long modinv(long a, long mod) {\n return modPow(a, mod - 2, mod);\n }\n public void COMinit() {\n fac[0] = 1;\n fac[1] = 1;\n finv[0] = 1;\n finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[(int)(MOD % i)] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n public long COM(int n, int k) {\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n-k]%MOD)% MOD;\n }\n public long PER(int n, int k){\n return fac[n]*finv[n-k]%MOD;\n }\n public long HCOM(int n, int k) {\n return COM(n + k - 1, k);\n }\n public boolean[] getIsPrimeArray(int max){\n boolean[] ret = new boolean[max+1];\n Arrays.fill(ret,true);\n ret[0]=false;\n ret[1]=false;\n for (int i=2;i<=max;i++){\n if (ret[i]){\n int c = 2*i;\n while (c<=max){\n ret[c]=false;\n c+=i;\n }\n }\n }\n return ret;\n }\n\n //array\n public int[] remove(int[] ar, int pos) {\n int[] ret = new int[ar.length - 1];\n for (int i = 0; i < pos; i++) ret[i] = ar[i];\n for (int i = pos + 1; i < ar.length; i++) ret[i - 1] = ar[i];\n return ret;\n }\n public int[] nextArray(int size,int cons){\n int[] ret = new int[size];\n for (int i=0;i<size;i++)ret[i]=sc.nextInt()+cons;\n return ret;\n }\n public int[] reverse(int[] ar){\n int[] ret = new int[ar.length];\n for (int i=0;i<ar.length;i++){\n ret[i]=ar[ar.length-1-i];\n }\n return ret;\n }\n public long[] cumulative_sum(int[] ar){\n long[] ret = new long[ar.length+1];\n ret[0]=0;\n for (int i=0;i<ar.length;i++)ret[i+1]=ret[i]+ar[i];\n return ret;\n }\n //graph\n public void warshall_floyd(int[][] d) {\n int n = d.length;\n for (int k = 0; k < n; k++)\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) d[i][j] = Math.min(d[i][j], d[i][k] + d[k][j]);\n }//隣接行列が引数。辺が無い場合、INFを入力。\n public int[] bellman_ford(int[][] d, int size, int start){\n int e = d.length;\n int[] ans = new int[size];\n Arrays.fill(ans,Integer.MAX_VALUE);\n ans[start]=0;\n for (int i=0;i<size;i++){\n for (int[] a : d) {\n if (ans[a[1]] > ans[a[0]] + a[2]) {\n ans[a[1]] = ans[a[0]] + a[2];\n if (i == size - 1) {\n System.out.println(\"negative loop\");\n break;\n }\n }\n }\n }\n return ans;\n }//辺を配列の要素として管理。\n\n\n }\n public static class Queue<T>{\n private final int max = 10000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){return (head == (tail+1)%max);}\n public void enqueue(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T dequeue(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n }\n public static class Deque<T>{\n private final int max = 10000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){\n return (head == (tail+1)%max);\n }\n public void pushFirst(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n head--;\n if (head==-1)head=max-1;\n queue[head] = v;\n }\n public void pushLast(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T popFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n public T popLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n if (--tail==-1)tail=max-1;\n return queue[tail];\n }\n\n public T peekFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[head];\n }\n public T peekLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[tail];\n }\n }\n public static class Stack<T>{\n private final int max = 100000;\n private final T[] stack =(T[]) new Object[max];\n private int top = 0;\n public boolean isEmpty(){return (top==0);}\n public boolean isFull(){return (top==max);}\n public void init(){top=0;}\n public void push(T v){\n if (isFull()){\n System.out.println(\"error: stack is full.\");\n return;\n }\n stack[top++] = v;\n }\n public T pop(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[--top];\n }\n public T peek(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[top];\n }\n }\n public static class Pair<K,V>{\n private K A;\n private V B;\n Pair(K a,V b){\n A=a;\n B=b;\n }\n public void changeA(K a){A=a;}\n public void changeB(V b){B=b;}\n public void changeAB(K a,V b){A=a;B=b;}\n public static Comparator numberSortWithA = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A){\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n public static Comparator numberSortWithB = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B){\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n }\n public static class Graph{\n private final HashMap<Integer,HashSet<Integer>> graph = new HashMap<>();\n private final int Size;\n Graph(int size){\n for (int i=0;i<size;i++)graph.put(i,new HashSet<>());\n Size = size;\n }\n\n public void addEdge(int node1,int node2){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).add(node2);\n graph.get(node2).add(node1);\n }\n }\n public void addDirectEdge(int from,int to){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).add(to);\n }\n }\n public int[] depth(int root){\n Queue<Integer> q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n int[] depth = new int[Size];\n Arrays.fill(depth,-1);\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v)){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+1;\n }\n }\n }\n return depth;\n }\n public HashSet<Integer> getConnected(int pos){return graph.get(pos);}\n }\n public static class WeightedGraph{\n private final HashMap<Integer,HashMap<Integer,Integer>> graph = new HashMap<>();\n private final int Size;\n private long[] Depth;\n WeightedGraph(int size){\n for (int i=0;i<size;i++)graph.put(i,new HashMap<>());\n Size = size;\n }\n\n public void addEdge(int node1,int node2,int weight){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).put(node2,weight);\n graph.get(node2).put(node1,weight);\n }\n }\n public void addDirectEdge(int from,int to,int weight){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).put(to,weight);\n }\n }\n public int[] dijkstra(int root){\n Comparator<int[]> c = new Comparator<int[]>() {\n @Override\n public int compare(int[] o1, int[] o2) {\n return Integer.compare(o1[1], o2[1]);\n }\n };\n PriorityQueue<int[]> q = new PriorityQueue<>(c);\n q.add(new int[]{root,0});\n int[] ret = new int[Size];\n Arrays.fill(ret,Integer.MAX_VALUE);\n ret[root]=0;\n while (!q.isEmpty()){\n int[] v = q.poll();\n if (v[1]<=ret[v[0]]){\n HashMap<Integer,Integer> h = graph.get(v[0]);\n for (int u : h.keySet()){\n if (ret[u]>v[1]+h.get(u)){\n ret[u]=v[1]+h.get(u);\n q.add(new int[]{u,ret[u]});\n }\n }\n }\n }\n return ret;\n }\n\n public long[] Depth(int root){\n Queue<Integer> q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n long[] depth = new long[Size];\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v).keySet()){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+graph.get(v).get(u);\n }\n }\n }\n Depth = depth.clone();\n return depth;\n }\n\n }\n public static class UnionFindTree{\n int[] parent;\n int[] rank;\n int[] Size;\n int Number;\n public UnionFindTree(int size){\n this.parent = new int[size];\n this.rank = new int[size];\n this.Size = new int[size];\n makeSet();\n }\n public void makeSet(){\n for (int i=0;i<Size.length;i++){\n parent[i]=i;\n rank[i]=0;\n Size[i]=1;\n }\n Number= Size.length;\n }\n public void unite(int x, int y){\n int xRoot = find(x);\n int yRoot = find(y);\n if (rank[xRoot]>rank[yRoot]){\n parent[yRoot] = xRoot;\n Size[xRoot]+=Size[yRoot];\n Number--;\n }else if (rank[xRoot]<rank[yRoot]){\n parent[xRoot] = yRoot;\n Size[yRoot]+=Size[xRoot];\n Number--;\n }else if (xRoot!=yRoot){\n parent[yRoot] = xRoot;\n rank[xRoot]++;\n Size[xRoot]+=Size[yRoot];\n Number--;\n }\n }\n public int find(int i){\n if (i!= parent[i]){\n parent[i]=find(parent[i]);\n }\n return parent[i];\n }\n public boolean same(int x, int y){\n return find(x) == find(y);\n }\n public int getSize(int i){return Size[find(i)];}\n boolean isConnected(){\n return Number<2;\n }\n }\n public static class BitSearch<T>{\n T[] Array;\n int Width;\n int Length;\n BitSearch(T[] t, int width){\n Array = t;\n Width = width;\n Length = Array.length;\n }\n void start(){\n long max = (long)Math.pow(Width,Length);\n for (long i=0;i<max;i++){\n StringBuilder s = new StringBuilder(Long.toString(i, Width));\n while (s.length()<Length) s.insert(0, \"0\");\n run(s);\n }\n }\n void run(StringBuilder s){\n\n }\n }\n\n}\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nd1 = (A1 - B1) * T1\nd2 = d1 + (A2 - B2) * T2\nif (d1 > 0 and d2 > 0) or (d1 < 0 and d2 < 0):\n print(0)\n exit()\nif d2 == 0:\n print('infinity')\n exit()\nd1 = abs(d1)\nd2 = abs(d2)\nif d1 % d2 == 0:\n print(d1 // d2 * 2)\nelse:\n print(1 + d1 // d2 * 2)\n", "T1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\nX=(B1-A1)*T1\nY=(B2-A2)*T2\nif X>0:\n X=-X\n Y=-Y\nif X+Y<0:\n print(0)\nelif X+Y==0:\n print(\"infinity\")\nelse:\n A=(-X)//(X+Y)\n B=(-X)%(X+Y)\n if B!=0:\n print(2*A+1)\n else:\n print(2*A)\n", "import math\n\nt1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\n\nif a1*t1+a2*t2 == b1*t1+b2*t2:\n\tprint('infinity')\n\texit(0)\n\nif (a1*t1 < b1*t1 and a1*t1+a2*t2 < b1*t1+b2*t2) or (a1*t1 > b1*t1 and a1*t1+a2*t2 > b1*t1+b2*t2):\n\tprint(0)\n\texit(0)\n\nm = abs(a1*t1-b1*t1)\ns = abs(a1*t1+a2*t2-b1*t1-b2*t2)\nif m%s == 0:\n\tprint((m//s)*2)\nelse:\n\tprint((m//s)*2+1)", "#include<bits/stdc++.h>\nusing namespace std;\n\nusing Lint=long long;\n\nint main()\n{\n Lint t[2],a[2],b[2];\n cin>>t[0]>>t[1]>>a[0]>>a[1]>>b[0]>>b[1];\n\n Lint X=(a[0]-b[0])*t[0];\n Lint Y=(a[1]-b[1])*t[1];\n\n if(X+Y==0){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n if(X+Y<0) X=-X,Y=-Y;\n\n if(X>0){\n cout<<0<<endl;\n return 0;\n }\n if(X==0){\n cout<<1<<endl;\n return 0;\n }\n Lint ans=(-X)/(X+Y)*2+((-X)%(X+Y)!=0);\n cout<<ans<<endl;\n return 0;\n}", "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n\t\npublic class Main {\n static class Graph0n {\n private ArrayList<Node0n> dt = new ArrayList<>();\n Graph0n(int sz){for(int i=0; i<sz; i++){Node0n node1 = new Node0n();dt.add(node1);}}\n public void add(int vn, int val){ dt.get(vn).add(val); }\n public void add2(int vn, int val){ dt.get(vn).add(val);dt.get(val).add(vn);}\n public int get(int vn, int index){ return dt.get(vn).get(index); }\n public ArrayList<Integer> get(int vn){ return dt.get(vn).getAll(); }\n public int sizeOf(int vn){ return dt.get(vn).size(); }\n public void clear(){ for(int i=0; i<dt.size(); i++){ dt.get(i).clear(); } }\n public void clear(int i){ dt.get(i).clear(); }\n public static Graph0n make_tree(int vn, FastScanner sc){\n \tGraph0n tree = new Graph0n(vn);\n \tfor(int i=1; i<vn; i++){\n \t int s1 = sc.nexI()-1;\n \t int g1 = sc.nexI()-1;\n \t tree.add2(s1,g1);\n \t}\n \treturn tree;\n }\n }\n static class Node0n { //重みなし無向・有向グラフの頂点\n private ArrayList<Integer> next_vs = new ArrayList<>();\n public void add(int val){ next_vs.add(val); }\n public int get(int ad){ return next_vs.get(ad); }\n public ArrayList<Integer> getAll(){ return next_vs; }\n public int size(){ return next_vs.size(); }\n public void clear(){ next_vs.clear(); }\n }\n\n static class Edge {\n int from=-1, v2=-1; long weight;\n public Edge(int vn, long w){\n this.v2 = vn;\n this.weight = w;\n }\n public Edge(int cm, int vn, long w){\n this.from = cm;\n this.v2 = vn;\n this.weight = w;\n }\n }\n static class Edge2 {\n int v2; long cost1,cost2;\n public Edge2(int vn, long w1, long w2){\n this.v2 = vn;\n this.cost1 = w1;\n this.cost2 = w2;\n }\n }\n\n static class Comparator_Edge implements Comparator<Edge>{ //今は小さいのが前に出てくる\n public int compare(Edge a, Edge b){\n if(a.weight>b.weight) return 1;\n else if(a.weight<b.weight) return -1;\n else return a.v2-b.v2;\n }\n }\n \n static class Vector {\n int x,y;\n public Vector(int sx, int sy){\n this.x=sx;\n this.y=sy;\n }\n }\n \n \n //私が好きなアルゴリズム::累積和・UF木\n //PriorityQueueは拡張for文で出すとsortされてない順番で出てくるよ\n //longのbit演算は1L<<posに注意\n //long long\n //JOIはMLEが厳しい shortというものがあるよ。\n\tpublic static void main(String[] args) throws Exception {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\t/*\n\t\tint nt = sc.nexI();\n\t\tint nroad = sc.nexI();\n\t\tint nfes = sc.nexI();\n\t\tint nq = sc.nexI();\n\t\t\n\t\tList<List<Edge>> graph = new ArrayList<>();\n\t\tfor(int i=0; i<nt; i++){\n\t\t List<Edge> emp = new ArrayList<>();\n\t\t graph.add(emp);\n\t\t}\n\t\tfor(int i=0; i<nroad; i++){\n\t\t int s1 = sc.nexI()-1;\n\t\t int g1 = sc.nexI()-1;\n\t\t int ln1 = sc.nexI();\n\t\t graph.get(s1).add(new Edge(g1, ln1));\n\t\t graph.get(g1).add(new Edge(s1, ln1));\n\t\t}\n\t\t\n\t\tlong[] d8fes = new long[nt];\n\t\tfill(d8fes, INFL);\n\t\t\n\t\tQueue<Edge> dijk = new PriorityQueue<>(new Comparator_Edge());\n\t\tfor(int i=0; i<nfes; i++){\n\t\t int s1 = sc.nexI()-1;\n\t\t dijk.add(new Edge(s1, 0L));\n\t\t}\n\t\twhile(dijk.size()>0){\n\t\t Edge dw = dijk.poll();\n\t\t if(d8fes[dw.v2]>dw.weight){\n\t\t d8fes[dw.v2] = dw.weight;\n \t\t for(Edge e: graph.get(dw.v2)){\n \t\t long d8dw = dw.weight + e.weight;\n \t\t if(d8fes[e.v2]>d8dw) dijk.add(new Edge(e.v2, d8dw));\n \t\t }\n\t\t }\n\t\t}\n\t\tprtspas(d8fes);*/\n\t\t\n\t\tlong t1 = sc.nexL();\n\t\tlong t2 = sc.nexL();\n\t\tlong a1 = sc.nexL();\n\t\tlong a2 = sc.nexL();\n\t\tlong b1 = sc.nexL();\n\t\tlong b2 = sc.nexL();\n\t\t\n\t\tif(a1>b1){\n\t\t long swap = a1;\n\t\t a1=b1;\n\t\t b1=swap;\n\t\t swap=a2;\n\t\t a2=b2;\n\t\t b2=swap;\n\t\t}\n\t\tif(a2<b2){\n\t\t System.out.println(0);\n\t\t return;\n\t\t}\n\t\t//a1<b1, a2>b2\n\t\t/* /\n\t\t /／\n\t\t ／/\n\t\t B/ /\n\t\t / /A\n\t\t/／\n\t\t*/\n\t\tlong medB_A = t1*(b1-a1);\n\t\tlong lasA_B = t2*(a2-b2)- medB_A;\n\t\t\n\t\tif(lasA_B==0){\n\t System.out.println(\"infinity\");\n\t\t return;\n\t\t}\n\t\tif(lasA_B<0){\n\t\t System.out.println(0);\n\t\t return;\n\t\t}\n\t\t\n\t\t//lasA_Bずつ引き離されるが、途中で medB_Aだけ巻き返す\n\t\tlong ans = (medB_A%lasA_B==0) ? 0 : 1;\n\t\tans += (medB_A/lasA_B)*2;\n\t\t\n\t\tout.println(ans);\n\t\t\n\t\t\n\t out.flush();\n\t}\n\t\n\tprivate static int INF = (int)1e8;\n\tprivate static long INFL = (long)1e17;\n\tprivate static long e97 = (long)1e9 + 7;\n\t\n\tprivate static void assertion(boolean b) { if(!b) throw new AssertionError(); }\n\n\tprivate static int abs(int a){ return (a>=0) ? a: -a; }\n\tprivate static long abs(long a){ return (a>=0) ? a: -a; }\n\tprivate static double abs(double a){ return (a>=0) ? a: -a; }\n\t\n\tprivate static int min(int a, int b){ return (a>b) ? b : a; }\n\tprivate static long min(long a, long b){ return (a>b) ? b : a; }\n\tprivate static double min(double a, double b){ return (a>b) ? b : a; }\n\t\n\tprivate static int max(int a, int b){ return (a>b) ? a : b; }\n\tprivate static long max(long a, long b){ return (a>b) ? a : b; }\n\tprivate static double max(double a, double b){ return (a>b) ? a : b; }\n\t\n\tprivate static int minN(int... ins){\n\t\tint min = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; }\n\t\treturn min;\n\t}\n\tprivate static int maxN(int... ins){\n\t\tint max = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; }\n\t\treturn max;\n\t}\n\tprivate static long minN(long... ins){\n\t\tlong min = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; }\n\t\treturn min;\n\t}\n\tprivate static long maxN(long... ins){\n\t\tlong max = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; }\n\t\treturn max;\n\t}\n\t\n\tprivate static int minExAd(int[] dt, int ad){\n\t int min=INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static long minExAd(long[] dt, int ad){\n\t long min=INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static int minExVal(int[] dt, int ex_val){\n\t int min=INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static long minExVal(long[] dt, long ex_val){\n\t long min=INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static int maxExAd(int[] dt, int ad){\n\t int max=-INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static long maxExAd(long[] dt, int ad){\n\t long max=-INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static int maxExVal(int[] dt, int ex_val){\n\t int max=-INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static long maxExVal(long[] dt, long ex_val){\n\t long max=-INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\n private static int sumA(int[] dt){\n int sum =0;\n for(int e: dt){ sum += e; }\n\t\treturn sum;\n }\n private static long sumA(long[] dt){\n long sum =0;\n for(long e: dt){ sum += e; }\n\t\treturn sum;\n }\n private static int sumA(List<Integer> dt){\n int sum =0;\n for(long e: dt){ sum += e; }\n\t\treturn sum;\n }\n\t\n\tprivate static boolean same3(long a, long b, long c){\n \tif(a!=b) return false;\n \tif(b!=c) return false;\n \tif(c!=a) return false;\n \treturn true;\n\t}\n\tprivate static boolean dif3(long a, long b, long c){\n \tif(a==b) return false;\n \tif(b==c) return false;\n \tif(c==a) return false;\n \treturn true;\n\t}\n\tprivate static boolean triangle_inequality(int a, int b, int c){\n\t if((a+b)<c) return false;\n\t if((b+c)<a) return false;\n\t if((c+a)<b) return false;\n\t return true;\n\t}\n\t\n\tprivate static double hypod(double a, double b){\n\t return Math.sqrt(a*a+b*b);\n\t}\n\t\n\tprivate static long factorial(int n) {\n\t\tlong ans=1;\n\t\tfor(long i=n; i>0; i--){ ans*=i; }\n\t\treturn ans;\n\t}\n\t\n\tprivate static long facP(int n, long p) {\n\t\tlong ans=1;\n\t\tfor(long i=n; i>0; i--){\n\t\t ans*=i;\n\t\t ans %= p;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tprivate static long lcm(long m, long n){\n\t long ans = m/gcd(m,n);\n\t ans *= n;\n\t return ans;\n\t}\n\t\n\tprivate static long gcd(long m, long n) {\n\t\tif(m < n) return gcd(n, m);\n\t\tif(n == 0) return m;\n\t\treturn gcd(n, m % n);\n\t}\n\t\n\tprivate static boolean is_prime(long a){\n\t if(a==1) return false;\n\t for(long i=2L; i<=Math.sqrt(a); i++){ if(a%i == 0) return false; }\n\t return true;\n\t}\n\t\n private static long modinv(long a, long p) { //a|p, >1に注意\n long b = p, u = 1L, v = 0L;\n while (b>0) {\n long t = a / b;\n long pe = a%b;\n a=b; b=pe;\n pe= u-t*v;\n u=v; v=pe;\n }\n u %= p; \n if (u < 0) u += p;\n return u;\n }\n \n\tprivate static int pow(int n, int k){\n\t int ans=1;\n\t for(int i=0; i<k; i++) ans *= n;\n\t return ans;\n\t}\n\tprivate static long pow(long n, int k){\n\t long ans=1;\n\t for(int i=0; i<k; i++) ans *= n;\n\t return ans;\n\t}\n\t\n\tprivate static int pow2(int in){ return in*in; }\n\tprivate static long pow2(long in){ return in*in; }\n\tprivate static double pow2(double in){ return in*in; }\n\t\n\tprivate static int getDigit2(long num){\n\t\tlong cf = 1; int d=0;\n\t\twhile(num >= cf){ d++; cf = (1L<<d); }\n\t\t\n\t\treturn d; //numはd桁の数で、2^dより小さい\n\t}\n\t\n\tprivate static int getDigit10(long num){\n\t\tlong cf = 1; int d=0;\n\t\twhile(num >= cf){ d++; cf*=10; }\n\t\treturn d; //numはd桁の数で、10^dより小さい\n\t}\n\t\n\tprivate static boolean isINF(int in){\n \tif(((long)in*20)>INF) return true;\n \telse return false;\n\t}\n\tprivate static boolean isINFL(long in){\n \tif((in*10000)>INFL) return true;\n \telse return false;\n\t}\n\t\n\tprivate static long pow10E97(long ob, long soeji, long p){\n\t if(ob==0) return 0;\n\t if(soeji==0) return 1;\n\t\tif(soeji==2) return (ob*ob)%p;\n\t\t\n\t\tint d = getDigit2(soeji);\n\t\tlong[] ob_pow_2pow = new long[d];\n\t\t\n\t\tob_pow_2pow[0] = ob;\n\t\tfor(int i=1; i<d; i++){ ob_pow_2pow[i] = (ob_pow_2pow[i-1]*ob_pow_2pow[i-1])%p; }\n\t\t\n\t\tlong ans=1;\n\t\tfor(int i=d-1; i>=0; i--){\n\t\t\tif(soeji >= (long)(1<<i)){\n\t\t\t\tsoeji -= (long)(1<<i);\n\t\t\t\tans = (ans*ob_pow_2pow[i])%p;\n\t\t\t}\n \t\t}\n\t\treturn ans%p;\n\t}\n\tprivate static long nC2(long n){\n\t\treturn ((n*(n-1))/2L);\n\t}\n\tprivate static int divceil(int numerator, int denominator){\n\t return (numerator+denominator-1)/denominator;\n\t}\n\tprivate static long divceil(long numerator, long denominator){\n\t return (numerator+denominator-1L)/denominator;\n\t}\n\t\n\tprivate static int iflag(int pos){ return (1<<pos); }\n\tprivate static long flag(long pos){ return (1L<<pos); }\n\tprivate static boolean isFlaged(int bit, int pos){\n \tif((bit&(1<<pos)) > 0) return true;\n \telse return false;\n\t}\n\tprivate static boolean isFlaged(long bit, int pos){\n \tif((bit&(1L<<pos)) > 0) return true;\n \telse return false;\n\t}\n\tprivate static int deflag(int bit, int pos){ return bit&~(1<<pos); }\n\tprivate static int countFlaged(int bit){\n\t int ans=0; \n\t for(int i=0; i<getDigit2(bit); i++){\n\t if((bit&(1<<i)) > 0) ans++;\n\t }\n\t return ans;\n\t}\n\tprivate static int countFlaged(long bit){\n\t int ans=0; \n\t for(long i=0; i<getDigit2(bit); i++){\n\t if((bit&(1L<<i)) > 0) ans++;\n\t }\n\t return ans;\n\t}\n\t\n\tprivate static void show2(int bit){\n \tfor(int i=0; i<getDigit2(bit); i++){\n \tif(isFlaged(bit,i)) System.out.print(\"O\");\n \telse System.out.print(\".\");\n \t}\n \tSystem.out.println();\n\t}\n\t\n\tpublic static int biSearch(int[] dt, int target){\n\t\tint left=0, right=dt.length-1;\n\t\tint mid=-1;\n\t\twhile(left<=right){\n\t\t\tmid = (right+left)/2;\n\t\t\tif(dt[mid] == target) return mid;\n\t\t\tif(dt[mid] < target) left=mid+1;\n\t\t\telse right=mid-1;\n\t\t}\n\t\treturn -1;\n\t}\n\tpublic static int biSearchMax(long[] dt, long target){\n\t\tint left=-1, right=dt.length;\n\t\tint mid=-1;\n\t\t\n\t\twhile((right-left)>1){\n\t\t\tmid = left + (right-left)/2;\n\t\t\tif(dt[mid] <= target) left=mid;\n\t\t\telse right=mid;\n\t\t}\n\t\treturn left;//target以下の最大のaddress\n\t}\n\tpublic static int biSearchMaxAL(ArrayList<Integer> dt, long target){\n\t\tint left=-1, right=dt.size();\n\t\tint mid=-1;\n\t\t\n\t\twhile((right-left)>1){\n\t\t\tmid = left + (right-left)/2;\n\t\t\tif(dt.get(mid) <= target) left=mid;\n\t\t\telse right=mid;\n\t\t}\n\t\treturn left;//target以下の最大のaddress\n\t}\n\t\n private static int[] Xdir4 = {1,0,0,-1};\n private static int[] Ydir4 = {0,1,-1,0};\n\t \n\tprivate\tstatic int[] Xdir8 = {1,1,1,0,0,-1,-1,-1};\n\tprivate\tstatic int[] Ydir8 = {1,0,-1,1,-1,1,0,-1};\n\t\n\tprivate static boolean is_in_area(int y, int x, int h, int w){\n\t if(y<0) return false;\n\t if(x<0) return false;\n\t if(y>=h) return false;\n\t if(x>=w) return false;\n\t return true;\n\t}\n\t\n\t\n\tstatic void show2(boolean[][] dt, int lit_x, int lit_y){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int j=0; j<dt.length; j++){\n\t\t for(int i=0; i<dt[j].length; i++){\n\t\t\t\tif((i==lit_y) && (j==lit_x)) out.print(\"X\");\n\t\t\t\telse if(dt[j][i]) out.print(\"O\");\n\t\t\t\telse out.print(\".\");\n\t\t\t}\n\t\t\tout.println();\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void show2(int[][] dt, String cmnt){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int i=0; i<dt.length; i++){\n\t\t\tfor(int j=0; j<dt[i].length; j++){\n\t\t\t\tout.print(dt[i][j]+\",\");\n\t\t\t}\n\t\t\tout.println(\"<-\"+cmnt+\":\"+i);\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void show2(long[][] dt, String cmnt){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int i=0; i<dt.length; i++){\n\t\t\tfor(int j=0; j<dt[i].length; j++){\n\t\t\t\tout.print(dt[i][j]+\",\");\n\t\t\t}\n\t\t\tout.println(\"<-\"+cmnt+\":\"+i);\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void show2(ArrayDeque<Long> dt){\t\t//上手くいかなかった時用\n\t\tlong a=0;\n\t\twhile(dt.size()>0){\n\t\t\ta=dt.removeFirst();\n\t\t\tSystem.out.print(a);\n\t\t}\n\t\tSystem.out.println(\"\\n\");\n\t}\n\tstatic void show2(List dt){\t\t//上手くいかなかった時用\n\t \tfor(int i=0; i<dt.size(); i++){\n\t\t\tSystem.out.print(dt.get(i)+\",\");\n\t\t}\n\t\tSystem.out.println(\"\\n\");\n\t}\n\t\n\t\n\tprivate static void prtlnas(int[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t for(int i=0; i<as.length; i++){\n\t out.println(as[i]);\n\t }\n\t out.flush();\n\t}\n\tprivate static void prtlnas(long[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t for(int i=0; i<as.length; i++){\n\t out.println(as[i]);\n\t }\n\t out.flush();\n\t}\n\tprivate static void prtspas(int[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tout.print(as[0]);\n\t for(int i=1; i<as.length; i++){\n\t out.print(\" \"+as[i]);\n\t }\n\t out.println();\n\t out.flush();\n\t}\n\tprivate static void prtspas(long[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tout.print(as[0]);\n\t for(int i=1; i<as.length; i++){\n\t out.print(\" \"+as[i]);\n\t }\n\t out.println();\n\t out.flush();\n\t}\n\tprivate static void prtspas(List as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tout.print(as.get(0));\n\t for(int i=1; i<as.size(); i++){\n\t out.print(\" \"+as.get(i));\n\t }\n\t out.println();\n\t out.flush();\n\t}\n\t\n\t\n private static void fill(boolean[] ob, boolean res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n private static void fill(int[] ob, int res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(long[] ob, long res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(char[] ob, char res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(double[] ob, double res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(boolean[][] ob,boolean res){for(int i=0;i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(int[][] ob, int res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(long[][] ob, long res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(char[][] ob, char res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(double[][] ob, double res){for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(int[][][] ob,int res){for(int i=0;i<ob.length;i++){for(int j=0;j<ob[0].length;j++){for(int k=0;k<ob[0][0].length;k++){ob[i][j][k]=res;}}}}\n\tprivate static void fill(long[][][] ob,long res){for(int i=0;i<ob.length;i++){for(int j=0;j<ob[0].length;j++){for(int k=0;k<ob[0][0].length;k++){ob[i][j][k]=res;}}}}\n\t\n static class FastScanner {\n \tprivate final InputStream in = System.in;\n \tprivate final byte[] buffer = new byte[1024];\n \tprivate int ptr = 0;\n \tprivate int buflen = 0;\n \tprivate boolean hasNextByte() {\n \t\tif (ptr < buflen) {\n \t\t\treturn true;\n \t\t}else{\n \t\t\tptr = 0;\n \t\t\ttry {\n \t\t\t\tbuflen = in.read(buffer);\n \t\t\t} catch (IOException e) {\n \t\t\t\te.printStackTrace();\n \t\t\t}\n \t\t\tif (buflen <= 0) {\n \t\t\t\treturn false;\n \t\t\t}\n \t\t}\n \t\treturn true;\n \t}\n \t\n \tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n \tprivate static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n \tpublic boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n \tpublic String next() {\n \t\tif (!hasNext()) throw new NoSuchElementException();\n \t\tStringBuilder sb = new StringBuilder();\n \t\tint b = readByte();\n \t\twhile(isPrintableChar(b)) {\n \t\t\tsb.appendCodePoint(b);\n \t\t\tb = readByte();\n \t\t}\n \t\treturn sb.toString();\n \t}\n \tpublic long nexL() {\n \t\tif (!hasNext()) throw new NoSuchElementException();\n \t\tlong n = 0;\n \t\tboolean minus = false;\n \t\tint b = readByte();\n \t\tif (b == '-') {\n \t\t\tminus = true;\n \t\t\tb = readByte();\n \t\t}\n \t\tif (b < '0' || '9' < b) {\n \t\t\tthrow new NumberFormatException();\n \t\t}\n \t\twhile(true){\n \t\t\tif ('0' <= b && b <= '9') {\n \t\t\t\tn *= 10;\n \t\t\t\tn += b - '0';\n \t\t\t}else if(b == -1 || !isPrintableChar(b) || b == ':'){\n \t\t\t\treturn minus ? -n : n;\n \t\t\t}else{\n \t\t\t\tthrow new NumberFormatException();\n \t\t\t}\n \t\t\tb = readByte();\n \t\t}\n \t}\n \tpublic int nexI() {\n \t\tlong nl = nexL();\n \t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n \t\treturn (int) nl;\n \t}\n \tpublic double nexD() { return Double.parseDouble(next());}\n \t\n \tpublic void al(long[] array){\n \t \tfor(int i=0; i<array.length; i++){\n \t \t array[i] = nexL();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ai(int[] array){\n \t \tfor(int i=0; i<array.length; i++){\n \t \t array[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ai2(int[] as, int[] bs){\n \t \tfor(int i=0; i<as.length; i++){\n \t \t as[i] = nexI();\n \t \t bs[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void al2(long[] as, long[] bs){\n \t \tfor(int i=0; i<as.length; i++){\n \t \t as[i] = nexL();\n \t \t bs[i] = nexL();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ai3(int[] as, int[] bs, int[] cs){\n \t \tfor(int i=0; i<as.length; i++){\n \t \t as[i] = nexI();\n \t \t bs[i] = nexI();\n \t \t cs[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ad2i(int[][] as){\n \t for(int i=0; i<as.length; i++){\n \t for(int j=0; j<as[0].length; j++){\n \t as[i][j] = nexI();\n \t }\n \t }\n \t return;\n \t}\n \tpublic void ain(int[]... as){\n \t for(int i=0; i<as[0].length; i++){\n \t for(int j=0; j<as.length; j++){\n \t as[j][i] = nexI();\n \t }\n \t }\n \t}\n \tpublic void aln(long[]... as){\n \t for(int i=0; i<as[0].length; i++){\n \t for(int j=0; j<as.length; j++){\n \t as[j][i] = nexL();\n \t }\n \t }\n \t}\n }\n}", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\np=a1-b1\nq=a2-b2\nif p*t1+q*t2==0:print('infinity');exit()\nelif p<0:p,q=-p,-q\n#p>0\nif p*t1+q*t2>0:print(0)\nelse:\n a=p*t1\n d=-(a+q*t2)\n print(2*(a//d)+int(not(not a%d)))\n", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\np1 = t1*a1\nq1 = t1*b1\np2 = p1+t2*a2\nq2 = q1+t2*b2\nif p2 == q2:\n print(\"infinity\")\n exit()\nif (p1>q1 and p2>q2) or (p1<q1 and p2<q2):\n print(0)\n exit()\nx = abs(p1-q1)\ny = abs(q2-p2)\nif x%y == 0:\n ans = (x//y)*2\nelse:\n ans = (x//y)*2+1\nprint(ans)\n ", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nconst int MOD = 1e9+7;\nconst int N = 100001;\n\nint main () {\n\tll t1, t2, a1, a2, b1, b2; cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\tll a = t1*(a1-b1), b = t2*(a2-b2);\n\tif (a > 0)\n\t\ta *= -1LL, b *= -1LL;\n\tif (a+b < 0) {\n\t\tcout << 0 << endl;\n\t} else if (a+b == 0) {\n\t\tcout << \"infinity\" << endl;\n\t} else {\n\t\tll s = -a/(a+b), t = abs(a)%(abs(a+b));\n\t\tcout << 2LL*s+(t != 0) << endl; \n\t}\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\nusing lint=long long;\n\nint main(){\n\tlint t1,t2,a1,a2,b1,b2;\n\tscanf(\"%lld%lld%lld%lld%lld%lld\",&t1,&t2,&a1,&a2,&b1,&b2);\n\n\tif(a1<b1){\n\t\tswap(a1,b1);\n\t\tswap(a2,b2);\n\t}\n\n\tlint d=(a1-b1)*t1+(a2-b2)*t2;\n\tif (d> 0) return puts(\"0\"),0;\n\telse if(d==0) return puts(\"infinity\"),0;\n\n\td=-d;\n\tlint ans;\n\tif((a1-b1)*t1%d==0) ans=2*(((a1-b1)*t1)/d);\n\telse ans=2*(((a1-b1)*t1)/d+1)-1;\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}\n", "T_1, T_2 = map(int, input().split())\nA_1, A_2 = map(int, input().split())\nB_1, B_2 = map(int, input().split())\n\nf = (A_1 - B_1) * T_1\ns = (A_2 - B_2) * T_2\n\nif f * (f + s) > 0:\n\tans = 0\nelif f * (f + s) == 0:\n\tans = 'infinity'\nelse:\n\tans = 1\n\tif f < 0:\n\t\tf *= -1\n\t\ts *= -1\n\td = f + s\n\tdiv, mod = divmod(f, abs(d))\n\tans += div * 2\n\tif mod == 0:\n\t\tans -= 1\n\nprint(ans)", "T1,T2 = map(int,input().split())\nA1,A2 = map(int,input().split()) #高橋君\nB1,B2 = map(int,input().split()) #青木君\nD1,D2 = (A1-B1)*T1, (A1-B1)*T1+(A2-B2)*T2\nif D1*D2 > 0: print(0)\nelif D2 == 0: print(\"infinity\")\nelif -D1%D2 == 0: print(-D1//D2*2)\nelse: print(-D1//D2*2+1)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\n long long p = (a1 - b1) * t1, q = (a2 - b2) * t2;\n if (p > 0) {\n p *= -1;\n q *= -1;\n }\n\n if (p + q < 0) cout << 0 << endl;\n else if (p + q == 0) cout << \"infinity\" << endl;\n else {\n if (-p % (p + q) == 0) cout << -p / (p + q) * 2 << endl;\n else cout << 1 + -p / (p + q) * 2 << endl;\n }\n}", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nv1, v2 = A1 - B1, A2 - B2\nd1, d2 = v1 * T1, v2 * T2\nif d1 > 0:\n d1 *= -1\n d2 *= -1\n\nif d1 + d2 < 0:\n print(0)\nelif d1 + d2 == 0:\n print(\"infinity\")\nelif d1 + d2 > 0:\n s, t = divmod(-d1, d1+d2)\n ans = 2*s + (t!=0)\n print(ans)", "import math\n\nT1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nif (A1 - B1) * T1 + (A2 - B2) * T2 == 0:\n print(\"infinity\")\nelse:\n D, D1 = (A1 - B1) * T1 + (A2 - B2) * T2, (A1 - B1) * T1\n if (D1 > 0) == (D > 0):\n print(0)\n else:\n if D1 % D == 0:\n print(2 * math.floor(-D1 / D))\n else:\n print(2 * math.floor(-D1 / D) + 1)\n", "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nint main(int argc, const char *argv[]) {\n ll t1, t2;\n cin >> t1 >> t2;\n\n ll a1, a2, b1, b2;\n cin >> a1 >> a2 >> b1 >> b2;\n\n ll p = (a1 - b1) * t1;\n ll q = (a2 - b2) * t2;\n if (p > 0) {\n p *= -1;\n q *= -1;\n }\n\n if (p + q < 0) {\n cout << 0 << '\\n';\n return 0;\n } else if (p + q == 0) {\n cout << \"infinity\" << '\\n';\n return 0;\n }\n\n ll s, t;\n s = -p / (p + q);\n t = -p % (p + q);\n\n if (t != 0) {\n cout << s * 2 + 1 << '\\n';\n } else {\n cout << s * 2 << '\\n';\n }\n\n return 0;\n}", "s,t = map(int,input().split())\nk,l = map(int,input().split())\nm,n = map(int,input().split())\na = (k-m)*s\nb = (l-n)*t\n\nif a+b == 0:\n print(\"infinity\")\nelif a>0 and a+b>0:\n print(0)\nelif a<0 and a+b<0:\n print(0)\nelse:\n div = abs(a) // abs(a+b)\n if div == abs(a) / abs(a+b):\n print(div*2)\n else:\n print(div*2+1)", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll t1, t2;\n ll a1, a2;\n ll b1, b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n a1 *= t1; a2 *= t2;\n b1 *= t1; b2 *= t2;\n ll p = a1 - b1;\n ll q = a2 - b2;\n if(p<0)p = -p,q = -q;\n ll pq = p+q;\n if(pq==0){\n cout << \"infinity\" << endl;\n return 0;\n }else if(pq>0){\n cout << 0 << endl;\n return 0;\n }else{\n ll ans;\n ans = (p/(-pq))*2+1;\n if(p%(-pq)==0)ans -= 1;\n cout << ans << endl;\n return 0;\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nint main(){\n i64 t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n i64 p = (a1 - b1)*t1, q = (a2 - b2)*t2;\n if(p > 0){\n p *= -1;\n q *= -1;\n }\n if(p+q < 0)cout << 0 << endl;\n else if(p+q == 0)cout << \"infinity\" << endl;\n else{\n if((-p)%(p+q) == 0)cout << 2*(-p/(p+q)) << endl;\n else cout << 2*(-p/(p+q))+1 << endl;\n }\n\n return 0;\n}", "t1,t2=[int(j) for j in input().split()]\na1,a2=[int(j) for j in input().split()]\nb1,b2=[int(j) for j in input().split()]\nc1,c2=a1-b1,a2-b2\nd1,d2=c1*t1,c2*t2\nif d1>0:\n d1=-d1\n d2=-d2\nif d1+d2<0:\n print(0)\nelif d1+d2==0:\n print(\"infinity\")\nelse:\n print(2*(-d1//(d2+d1))+[0,1][int(bool(-d1%(d2+d1)))])", "#include <bits//stdc++.h>\nusing namespace std;\ntypedef long long int ll;\nint main(void) {\n ll t1, t2, a1, a2, b1, b2; cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n ll p = (a1 - b1) * t1, q = (a2 - b2) * t2;\n if (p >= 0) p *= -1, q *= -1;\n if (p + q < 0) cout << 0 << endl;\n else if (p + q == 0) cout << \"infinity\" << endl;\n else {\n ll s = -p / (p + q), t = -p % (p + q);\n if (t != 0) cout << s * 2 + 1 << endl;\n else cout << s * 2 << endl;\n }\n}", "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n// import java.awt.Point;\n \npublic class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n static int mod = 1_000_000_007;\n // int mod = 998244353;\n // long inf = Long.MAX_VALUE/2;\n int inf = Integer.MAX_VALUE/2;\n\n void solve(){\n long t1 = nl();\n long t2 = nl();\n long a1 = nl();\n long a2 = nl();\n long b1 = nl();\n long b2 = nl();\n\n long D = a1*t1-b1*t1;\n long E = a2*t2-b2*t2;\n\n // out.println(D+\" \"+E);\n\n if((D>0&&E>0)||(D<0&&E<0)||Math.abs(E)<Math.abs(D)){\n out.println(0);\n return;\n }\n D = Math.abs(D);\n E = -Math.abs(E);\n long diff = -(D+E);\n if(diff==0){\n out.println(\"infinity\");\n return;\n }\n // out.println(diff);\n long ans = 0; \n long times = D/diff;\n ans += 2 * times;\n long res = D - diff*times;\n while(true){\n if(res<=0) break;\n res += E;\n if(res<=0) ans++;\n else break;\n res += D;\n if(res>=0) ans++;\n else break;\n }\n out.println(ans);\n }\n\n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n \n public static void main(String[] args) throws Exception { new Main().run(); }\n \n private byte[] inbuf = new byte[1024];\n private int lenbuf = 0, ptrbuf = 0;\n \n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n \n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n \n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n \n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b) && b != ' ')){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n \n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n \n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n \n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }\n \n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef double D;\ntypedef pair<ll,ll> P;\n#define M 1000000007\n#define F first\n#define S second\n#define PB push_back\n#define INF 100000000000000000\nll a,b,c,d,e,f,x,y;\nint main(void){\n cin>>a>>b>>c>>d>>e>>f;\n x=(c-e)*a;\n y=(d-f)*b;\n if(x<0)x*=-1LL,y*=-1LL;\n if(x+y==0){\n\t\tcout<<\"infinity\"<<endl;\n\t\treturn 0;\n\t}\n\tif(x+y>0){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tll p=-x-y;\n\tif(x%p==0){\n\t\tcout<<x/p*2LL<<endl;\n\t}else{\n\t\tcout<<x/p*2LL+1LL<<endl;\n\t}\n}\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nave_a = t1 * a1 + t2 * a2\nave_b = t1 * b1 + t2 * b2\nif ave_a == ave_b:\n print('infinity')\n exit()\n\nhalf, all = t1 * (b1 - a1), ave_a - ave_b\nans = half // all * 2 + (half % all != 0)\nprint(max(0, ans))\n", "import sys\nreadline = sys.stdin.buffer.readline\ndef even(n): return 1 if n%2==0 else 0\n\nT1,T2 = map(int,readline().split())\nA1,A2 = map(int,readline().split())\nB1,B2 = map(int,readline().split())\n\nP = (A1 - B1) * T1\nQ = (A2 - B2) * T2\nif P > 0:\n\tP *= -1\n\tQ *= -1\n \nif P + Q < 0:\n\tprint(0)\nelif P + Q == 0:\n\tprint(\"infinity\")\nelse:\n\tS = (-P) // (P + Q)\n\tT = (-P) % (P + Q)\n\tif T != 0:\n\t\tprint(S * 2 + 1)\n\telse:\n\t\tprint(S * 2)", "s,t,a,b,x,y=map(int,open(0).read().split())\nif a*s+b*t==x*s+y*t:\n print('infinity')\n exit()\nif a<x:a,b,x,y=x,y,a,b\nif a*s+b*t>x*s+y*t:\n print(0)\n exit()\nn=(a*s-x*s)/(x*s+y*t-(a*s+b*t))\nm=int(n)\nprint(m*2+(n>m))", "T1,T2 = map(int, input().split())\nA1,A2 = map(int, input().split())\nB1,B2 = map(int, input().split())\nd1 = (A1-B1)*T1\nd2 = (A2-B2)*T2\nif d1<0: d1,d2 = -d1,-d2\nif d1+d2==0: print(\"infinity\")\nelif d1+d2>0: print(0)\nelif d1%(-d1-d2) == 0: print(2*(d1//(-d1-d2)))\nelse: print(2*(d1//(-d1-d2))+1)", "#include <cstdio>\n#include <algorithm>\nusing namespace std;\nint main() {\n\tlong long int T, t, A, a, B, b;\n\tscanf(\"%lld %lld %lld %lld %lld %lld\", &T, &t, &A, &a, &B, &b);\n\tif (T * A + t * a == T * B + t * b) printf(\"infinity\");\n\telse {\n\t\tif (A < B) {\n\t\t\tswap(A, B);\n\t\t\tswap(a, b);\n\t\t}\n\t\tif (T * A + t * a > T * B + t * b) printf(\"0\");\n\t\telse {\n\t\t\tlong long ans = T * (A - B) / (T * (B - A) + t * (b - a));\n\t\t\tlong long rans = ans * 2 + 2;\n\t\t\tif (ans * (T * (B - A) + t * (b - a)) == T * (A - B)) --rans;\n\t\t\t--rans;\n\t\t\tprintf(\"%lld\", rans);\n\t\t}\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tlong long T1, T2, A1, A2, B1, B2; \n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2; \n\tif(T1 * A1 + T2 * A2 == T1 * B1 + T2 * B2){\n\t\tcout << \"infinity\" << endl; return 0; \n\t}\n\tlong long D = T1 * A1 + T2 * A2 - (T1 * B1 + T2 * B2); // 1周期の差\n\tlong long M = T1 * A1 - T1 * B1; // 1周期の中央での差\n\tif(M > 0 && D > 0){\n\t\tcout << 0 << endl; return 0; \n\t}\n\tif(M < 0 && D < 0){\n\t\tcout << 0 << endl; return 0; \n\t}\n\tlong long ans = (abs(M) / abs(D)) * 2 + 1; \n\tif(abs(M) % abs(D) == 0) ans --; \n\tcout << ans << endl; \n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll T1, T2, A1, A2, B1, B2; \n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\n ll P = T1*(A1-B1);\n ll Q = T2*(A2-B2);\n if(P+Q==0){\n cout << \"infinity\" << endl;\n return 0;\n } else if(P+Q<0){\n swap(A1, B1);\n swap(A2, B2);\n }\n\n if(A1>B1){\n cout << 0 << endl;\n return 0;\n }\n\n ll s = -P / (P+Q);\n ll t = -P % (P+Q);\n if(t==0) cout << 2*s << endl;\n else cout << 2*s + 1 << endl;\n}", "\nT1,T2 = map(int,input().split())\nA1,A2 = map(int,input().split())\nB1,B2 = map(int,input().split())\n\nd1 = A1*T1-B1*T1\nd2 = A2*T2-B2*T2\n\nimport sys\nif d1+d2 == 0:\n print('infinity')\n sys.exit()\nelif d1*d2 > 0 or (abs(d1)-abs(d2)>0 and d1*d2<0):\n print(0)\n sys.exit()\n \nelse:\n start = abs(d1)\n delta = abs(d2+d1)\n ans = start//delta * 2\n if (start%delta)!=0:\n ans += 1\n print(ans)\n \n \n \n\n ", "t1,t2 = map(int, input().split())\na1,a2 = map(int, input().split())\nb1,b2 = map(int, input().split())\n\nd1=(a1-b1)*t1\nd2=(a2-b2)*t2\n\n\nif abs(d1) == abs(d2):\n print(\"infinity\")\n exit()\n\nif abs(d1) > abs(d2) or d1*d2>0:\n print(0)\n exit()\n\ndif = abs(d2) - abs(d1)\n\nans=2*(abs(d1)//dif)\nif abs(d1)%dif != 0:\n ans+=1\nprint(ans)", "#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nsigned main() {\n int T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\n int P = (A1 - B1) * T1, Q = (A2 - B2) * T2;\n\n if (P > 0) {\n P *= -1;\n Q *= -1;\n }\n\n if (P + Q < 0) {\n cout << 0 << endl;\n } else if (P + Q == 0) {\n cout << \"infinity\" << endl;\n } else if (P + Q > 0) {\n int S = abs(P) / abs(P + Q), T = abs(P) % abs(P + Q);\n if (T != 0) {\n cout << 2 * S + 1 << endl;\n } else {\n cout << 2 * S << endl;\n }\n }\n\n return 0;\n}\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nif ((a1 - b1) * (a2 - b2) > 0) or (abs(a1 - b1) * t1 > abs(a2 - b2) * t2):\n print(0)\nelif abs(a1 - b1) * t1 == abs(a2 - b2) * t2:\n print(\"infinity\")\nelse:\n d, m = divmod(abs(a1 - b1) * t1, abs(a2 - b2) * t2 - abs(a1 - b1) * t1)\n ans = d * 2\n if m > 0:\n ans += 1\n print(ans)\n", "#include<iostream>\n#include<cmath>\nusing namespace std;\n\nint main() {\n long T1, T2;\n long A1, A2, B1, B2;\n cin>>T1>>T2;\n cin>>A1>>A2;\n cin>>B1>>B2;\n if((A1-B1)*T1+(A2-B2)*T2==0) cout<<\"infinity\"<<endl;\n else if(((A1-B1)*T1>0 & (A1-B1)*T1+(A2-B2)*T2>0) | ((A1-B1)*T1<0 & (A1-B1)*T1+(A2-B2)*T2<0))cout<<0<<endl;\n else {\n long a = (A1-B1)*T1+(A2-B2)*T2;\n if(abs(A1-B1)*T1%abs(a)==0) cout<<2*(abs(A1-B1)*T1/abs(a))<<endl;\n else cout<<2*(abs(A1-B1)*T1/abs(a))+1<<endl;\n }\n}\n", "// In God We Trust\n\n\n# include <bits/stdc++.h>\nusing namespace std;\n\n# define INF 1 << 31 - 1\n# define pb push_back\n# define fi first\n# define se second\n\n# define int long long\n\nsigned main(){\n int t1, t2;\n cin >> t1 >> t2;\n int a1, a2;\n cin >> a1 >> a2;\n int b1, b2;\n cin >> b1 >> b2;\n int a, b;\n a = t1 * abs(a1 - b1);\n b = t2 * abs(a2 - b2);\n if (a > b or (a1 > b1 and a2 > b2) or (b1 > a1 and b2 > a2))\n cout << 0;\n else if (a == b)\n cout << \"infinity\";\n else{\n int c = b - a;\n if (a % c == 0)\n cout << a / c * 2;\n else\n cout << 1 + a / c * 2; \n }\n\n cout << endl;\n}\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\nusing ll = long long;\n\nint main(){\n\tios_base::sync_with_stdio(false);\n\tll t1, t2, a1, a2, b1, b2;\n\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\tll a3 = a1 * t1 + a2 * t2;\n\tll b3 = b1 * t1 + b2 * t2;\n\tif(a3 == b3){\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif(a3 > b3){\n\t\tswap(a1, b1);\n\t\tswap(a2, b2);\n\t\tswap(a3, b3);\n\t}\n\tif(a1 < b1){\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tconst ll d1 = (a1 - b1) * t1;\n\tconst ll d2 = b3 - a3;\n\tconst ll answer = d1 / d2 * 2 + (d1 % d2 == 0 ? 0 : 1);\n\tcout << answer << endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n\nint main() {\n using namespace std;\n unsigned long T_1, T_2, A_1, A_2, B_1, B_2;\n cin >> T_1 >> T_2 >> A_1 >> A_2 >> B_1 >> B_2;\n if(A_1 < B_1){\n swap(A_1, B_1);\n swap(A_2, B_2);\n }\n A_1 *= T_1;\n A_2 *= T_2;\n B_1 *= T_1;\n B_2 *= T_2;\n auto t_1 = A_1 - B_1;\n if(A_1 + A_2 > B_1 + B_2)return 0 & puts(\"0\");\n if(A_1 + A_2 == B_1 + B_2)return 0 & puts(\"infinity\");\n auto t_2 = B_1 + B_2 - (A_1 + A_2);\n cout << 2 * ((t_1 - 1) / t_2) + (t_1 % t_2 == 0) + 1 << endl;\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nusing Lint=long long;\n\nint main()\n{\n Lint t[2],a[2],b[2];\n cin>>t[0]>>t[1]>>a[0]>>a[1]>>b[0]>>b[1];\n\n Lint X=(a[0]-b[0])*t[0];\n Lint Y=(a[1]-b[1])*t[1];\n if(X>0) X=-X,Y=-Y;\n\n if(X+Y<0) cout<<0<<endl;\n else if(X+Y==0) cout<<\"infinity\"<<endl;\n else{\n Lint ans=(-X)/(X+Y)*2+((-X)%(X+Y)!=0);\n cout<<ans<<endl;\n }\n return 0;\n}", "#include <iostream>\nusing namespace std;\nint main() {\n long long t1, t2, a1, a2, b1, b2; cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n long long d1 = a1 * t1 + a2 * t2, d2 = b1 * t1 + b2 * t2,\n denom = d1 - d2, numer = b1 * t1 - a1 * t1;\n if (denom == 0) cout << \"infinity\\n\";\n else {\n if (denom < 0) { denom *= -1; numer *= -1; }\n if (numer < 0) { cout << \"0\\n\"; }\n else {\n long long lim = numer / denom, rem = numer % denom;\n long long ans = 2 * lim + 1;\n if (rem == 0) ans--;\n cout << ans << endl;\n }\n }\n}\n", "#include <stdio.h>\nlong long t[2], a[2], b[2];\nlong long w, x, y, z, e, f;\nlong long ans;\nint main() {\n\tscanf(\"%lld%lld\", t, t + 1);\n\tscanf(\"%lld%lld\", a, a + 1);\n\tscanf(\"%lld%lld\", b, b + 1);\n\tif (t[0] * a[0] + t[1] * a[1] == t[0] * b[0] + t[1] * b[1]) {\n\t\tprintf(\"infinity\\n\");\n\t\treturn 0;\n\t}\n\tx = t[0]; y = t[1];\n\tif (t[0] * a[0] + t[1] * a[1] > t[0] * b[0] + t[1] * b[1]) {\n\t\tw = b[0] - a[0];\n\t\tz = b[1] - a[1];\n\t}\n\telse {\n\t\tw = a[0] - b[0];\n\t\tz = a[1] - b[1];\n\t}\n\tif (w < 0) {\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\te = w * x + z * y;\n\tf = w * x;\n\te = -e;\n\tans = f / e * 2;\n\tif (f % e)ans++;\n\tprintf(\"%lld\\n\", ans);\n}", "t,T,a,A,b,B=map(int, open(0).read().split())\nx,y=(a-b)*t,(A-B)*T\nif x+y==0:\n r=\"infinity\"\nelse:\n s,t=divmod(-x, x+y)\n r=0 if s<0 else s*2+(1 if t else 0)\nprint(r)", "#include <bits/stdc++.h>\n\nusing ll = long long;\nusing namespace std;\n\nint main() {\n int t1, t2;\n ll a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n ll d1 = t1 * (a1 - b1);\n ll d2 = d1 + t2 * (a2 - b2);\n if ((d1 > 0 && d2 > 0) || (d1 < 0 && d2 < 0)) {\n cout << 0 << endl;\n } else if (d1 == 0 || d2 == 0) {\n cout << \"infinity\" << endl;\n } else {\n ll count = abs(d1) / abs(d2) + 1;\n if (abs(d1) % abs(d2)) {\n cout << 2 * count - 1 << endl;\n } else {\n cout << 2 * count - 2 << endl;\n }\n }\n return 0;\n}\n", "import math\nT1, T2 = map(int,input().split())\nA1, A2 = map(int,input().split())\nB1, B2 = map(int,input().split())\n\nif A1*T1+A2*T2 == B1*T1+B2*T2:\n print('infinity')\nelif (A1-B1)*T1/((A1-B1)*T1+(A2-B2)*T2) > 0:\n print(0) \nelse:\n n = abs((A1-B1)*T1/((A1-B1)*T1+(A2-B2)*T2))\n meet = math.ceil(n) + int(n)\n print(meet) ", "ma = lambda: map(int, input().split())\nt,u = ma(); a,c = ma(); b,d = ma()\np = (a-b)*t; q = (c-d)*u\nif p < 0: p *= -1; q *= -1\nif p+q > 0: print(0)\nelif p+q == 0: print('infinity')\nelse:\n t = -p-q\n print(1+(p//t)*2 if p%t else (p//t)*2)", "T1, T2, A1, A2, B1, B2 = map(int, open(0).read().split())\n\nP = (A1 - B1) * T1\nQ = (A2 - B2) * T2\n\nif P > 0:\n P, Q = -P, -Q\n\nif P + Q < 0:\n print(0)\nelif P + Q == 0:\n print(\"infinity\")\nelse:\n S, T = divmod(-P, P + Q)\n print(S * 2 + (T != 0))\n", "t,T,a,A,b,B=map(int,open(0).read().split())\nx,y=(b-a)*t,(A-B)*T\nif y-x==0:\n r=\"infinity\"\nelse:\n s,t=divmod(x,y-x)\n r=max(0,s*2+(t!=0))\nprint(r)", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll t1, a1, b1, t2, a2, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\n a1 *= t1;\n a2 *= t2;\n b1 *= t1;\n b2 *= t2;\n a2 += a1;\n b2 += b1;\n if (a2 == b2) {\n cout << \"infinity\" << endl;\n return 0;\n }\n\n if (a2 < b2) {\n swap(a1, b1);\n swap(a2, b2);\n }\n\n ll d = a2 - b2;\n ll c = b1 - a1;\n ll ans = 0;\n if (c > 0) {\n ans = (c - 1) / d + 1;\n ans *= 2;\n ans--;\n if (c % d == 0) ans++;\n }\n\n cout << ans << endl;\n\n return 0;\n}", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\nif a1 < b1:\n a1, b1 = b1, a1\n a2, b2 = b2, a2\na1 *= t1\nb1 *= t1\na2 *= t2\nb2 *= t2\na = a1 + a2\nb = b1 + b2\nif a == b:\n print(\"infinity\")\nelif a > b:\n print(0)\nelse:\n d1 = a1 - b1\n d2 = b2 - a2\n if d1 % (d2 - d1) == 0:\n ans = d1 // (d2 - d1) * 2\n else:\n ans = d1 // (d2 - d1) * 2 + 1\n print(ans)\n \n ", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\ndelta1 = A1 - B1\ndelta2 = A2 - B2\n\nd = delta1 * T1 + delta2 * T2\nT = T1 + T2\n\nif d == 0:\n print(\"infinity\")\n exit()\n\nif delta1 * delta2 > 0:\n print(0)\n exit()\n\nif delta1 * d > 0:\n print(0)\n exit()\n\nn = int(delta1 * T1 // d) * (-1)\nans = 2 * n - 1\nif delta1 * T1 == n * d * (-1):\n ans += 1\n\nprint(max(ans, 0))", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll t1,t2,a1,a2,b1,b2;\nint main()\n{\n scanf(\"%lld%lld%lld%lld%lld%lld\",&t1,&t2,&a1,&a2,&b1,&b2);\n ll p=(a1-b1)*t1,q=(a2-b2)*t2;\n if(p>0) p*=-1,q*=-1;\n if(p+q<0){cout<<0;return 0;}\n if(p+q==0){cout<<\"infinity\";return 0;}\n ll k=-p/(p+q);\n k*=2;\n if(-p%(p+q)) k++;\n printf(\"%lld\\n\",k);\n}\n", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\n\nx1 = (a1-b1) * t1\nx2 = (a2-b2) * t2 + x1\n \nif x2 ==0:\n print(\"infinity\")\nelif x1*x2>0:\n print(0)\nelse:\n print(abs(x1) // abs(x2) * 2 + (abs(x1)%abs(x2) > 0))", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n long T1 = scanner.nextLong();\n long T2 = scanner.nextLong();\n long A1 = scanner.nextLong();\n long A2 = scanner.nextLong();\n long B1 = scanner.nextLong();\n long B2 = scanner.nextLong();\n long c1 = A1 * T1 - B1 * T1;\n long c2 = A2 * T2 - B2 * T2;\n if (c1 + c2 == 0) {\n System.out.println(\"infinity\");\n return;\n }\n if ((c1 > 0 && c1 + c2 > 0) || (c1 < 0 && c1 + c2 < 0)) {\n System.out.println(0);\n return;\n }\n long d1 = Math.abs(c1);\n long d2 = Math.abs(c1 + c2);\n long r = d1 / d2 * 2 + 1;\n if (d1 % d2 == 0) r--;\n System.out.println(r);\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\n\nint main() {\n ll T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n if (T1 * A1 + T2 * A2 == T1 * B1 + T2 * B2) {\n cout << \"infinity\" << endl;\n return 0;\n }\n if (A1 > B1) {\n swap(A1, B1);\n swap(A2, B2);\n }\n ll one_time = A1 * T1 + A2 * T2 - B1 * T1 - B2 * T2;\n if (one_time < 0) {\n cout << 0 << endl;\n return 0;\n }\n ll t1_diff = B1 * T1 - A1 * T1;\n ll res = 2 * (t1_diff / one_time);\n if (t1_diff % one_time != 0) {\n res++;\n }\n cout << res << endl;\n return 0;\n}", "import sys\n\ninput = sys.stdin.readline\n\nt1, t2 = list(map(int,input().split()))\na1, a2 = list(map(int,input().split()))\nb1, b2 = list(map(int,input().split()))\n\nda1 = a1*t1\nda2 = da1 + a2*t2\ndb1 = b1*t1\ndb2 = db1 + b2*t2\n\nif da2==db2:\n\tans = 'infinity'\nelse:\n\tif (da1-db1)*(da2-db2)>0:\n\t\tans = 0\n\telse:\n\t\tfdif = abs(da1-db1)\n\t\tsdif = abs(da2-db2)\n\t\titeration = fdif//sdif\n\t\tmod = fdif%sdif\n\t\tif mod==0:\n\t\t\tans = iteration*2\n\t\telse:\n\t\t\tans = iteration*2+1\n\nprint(ans)", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\nif (a1 - b1 >= 0) == (a2 - b2 >= 0):\n print(0)\n exit()\n\nd1 = (a1 - b1) * t1\nd2 = (a2 - b2) * t2\nd1, d2 = abs(d1), abs(d2)\n\nif d1 > d2:\n print(0)\n exit()\nif d1 == d2:\n print('infinity')\n exit()\n\ncnt = 0\nD = d2 - d1\ncnt += (d1 // D) * 2\nif d1 % D != 0:\n cnt += 1\n\nprint(cnt)\n", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nx=(a1-b1)*t1\ny=(a2-b2)*t2\nif x>0:\n x*=-1\n y*=-1\nif x+y<0:print(0)\nelif x+y==0:print(\"infinity\")\nelse:\n ans=(-x)//(x+y)\n if (-x)%(x+y):print(ans*2+1)\n else:print(ans*2)", "#include <bits/stdc++.h>\n\n#define rep(i, n) for(int (i) = 0; i < (n); ++(i))\n\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\n\nint main() {\n ll T1, T2, A1, A2, B1, B2;\n std::cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\n ll P, Q;\n P = T1 * (A1 - B1);\n Q = T2 * (A2 - B2);\n if(P > 0) {\n P = -P;\n Q = -Q;\n }\n\n if(P + Q < 0) {\n std::cout << \"0\" << '\\n';\n return 0;\n }\n if(P + Q == 0) {\n std::cout << \"infinity\" << '\\n';\n return 0;\n }\n\n ll S = - P / (P + Q);\n ll T = - P % (P + Q);\n\n ll ans = 2 * S;\n if(T > 0) {\n ++ans;\n }\n\n std::cout << ans << '\\n';\n}\n", "# -*- coding: utf-8 -*-\nfrom math import floor\n\ndef solve():\n T1, T2 = map(int, input().split())\n A1, A2 = map(int, input().split())\n B1, B2 = map(int, input().split())\n C1 = T1*(A1-B1)\n C = C1 + T2*(A2-B2)\n if C == 0:\n return 'infinity'\n elif C1/C > 0:\n return '0'\n elif C1/C > -1:\n return '1'\n else:\n res = 2*(floor(-C1/C)+1)-1-(C1/C).is_integer()\n return str(res)\n\nif __name__ == '__main__':\n print(solve())\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\t// your code goes here\n\tlong long s,t,a,b,c,d,i,j,l,r,m;\n\tcin >> s >> t >> a >> c >> b >> d;\n\tif(s*a+t*c==s*b+t*d){\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif(a<b){\n\t\tswap(a,b); swap(c,d);\n\t}\n\tif(a>b&&c>d){\n\t\tcout << \"0\" << endl;\n\t\treturn 0;\n\t}\n\tl=s*(a-b); r=t*(c-d);\n\tif(l+r>0){\n\t\tcout << \"0\" << endl;\n\t\treturn 0;\n\t}\n\tr=-r;\n\tif(l%(r-l)==0) m=l/(r-l);\n\telse m=floor(l/(r-l));\n\tif(l%(r-l)==0) cout << 2*m << endl;\n\telse cout << 2*m+1 << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(){\n ll T1,T2,A1,A2,B1,B2;\n cin>>T1>>T2>>A1>>A2>>B1>>B2;\n ll a=T1*(A1-B1),b=T2*(A2-B2);\n if(a<0){a*=-1;b*=-1;}\n if(a+b>0){cout<<\"0\"<<endl;return 0;}\n if(a+b==0){cout<<\"infinity\"<<endl;return 0;}\n ll dp=a,ans=0;\n if(a%(a+b)==0){cout<<-2*(a/(a+b))<<endl;return 0;}\n if(a%(a+b)!=0){cout<<-2*(a/(a+b))+1<<endl;return 0;}\n}", "t1, t2 = map(int,input().split())\na1, a2 = map(int,input().split())\nb1, b2 = map(int,input().split())\na1 *= t1\nb1 *= t1\na2 *= t2\nb2 *= t2\n\nif a1 + a2 == b1 + b2:\n print(\"infinity\")\n exit()\nif (a1 < b1 and a1+a2 < b1+b2) or (b1 < a1 and b1+b2 < a1+a2):\n print(0)\n exit()\n\nd2 = abs(a1+a2-b1-b2)\nd1 = abs(a1-b1)\nprint(1 + 2*(d1//d2) - (d1 % d2 == 0))", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\nif a1*t1+a2*t2>=b1*t1+b2*t2:\n a1,a2,b1,b2 = b1,b2,a1,a2\nd = b1*t1+b2*t2 - (a1*t1+a2*t2)\nif d == 0:\n print('infinity')\n\nelif a1*t1<b1*t1:\n print(0)\nelse:\n if (a1*t1 - b1*t1)*2%d ==0:\n print(((a1*t1 - b1*t1)*2+d-1)//d)\n else:\n print((a1*t1 - b1*t1)//d*2+1)\n", "from math import ceil\nt1,t2,a1,a2,b1,b2=map(int,open(0).read().split())\nw,x,y,z=t1*a1,t2*a2,t1*b1,t2*b2\nif w+x==y+z:\n\tprint(\"infinity\")\n\texit()\nif (w-y)*(w+x-y-z)>0:\n\tprint(0)\n\texit()\na1=min(w,y)\nb1=max(w,y)\nc1=max(w+x,y+z)\nc2=min(w+x,y+z)\nprint(2*int((b1-a1)//(c1-c2))+int((b1-a1)%(c1-c2)>0))", "T1,T2,A1,A2,B1,B2=map(int,open(0).read().split())\nD1,D2=(A1-B1)*T1,(A1-B1)*T1+(A2-B2)*T2\nif D1*D2>0:print(0)\nelif D2==0:print(\"infinity\")\nelse:print(-D1//D2*2+1-(-D1%D2==0))", "#include <bits/stdc++.h>\n \nusing namespace std;\n\nlong long t1, t2, a1, a2, b1, b2;\n\nint main() {\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\n if (t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2) {\n cout << \"infinity\\n\";\n return 0;\n }\n if (t1 * a1 + t2 * a2 < t1 * b1 + t2 * b2) {\n swap(a1, b1); swap(a2, b2);\n } \n if (a1 > b1) {\n cout << \"0\\n\";\n return 0;\n }\n\n long long q1 = t1 * (b1 - a1);\n long long q2 = (t1 * a1 + t2 * a2) - (t1 * b1 + t2 * b2);\n long long ans = q1 / q2;\n ans *= 2;\n if (q1 % q2 != 0) ans++;\n cout << ans << '\\n';\n}", "\nT1, T2 = list(map(int, input().split()))\nA1, A2 = list(map(int, input().split()))\nB1, B2 = list(map(int, input().split()))\n\n\nL1 = T1 * (A1- B1)\nL2 = L1 + T2 * (A2- B2)\n\nif L1 * L2 > 0:\n print(0)\nelif L2 == 0:\n print(\"infinity\")\nelse:\n M = (-L1) / L2\n ans = 2 * int(M) + 1\n if float(int(M)) == M:\n ans -= 1\n print(ans)\n\n", "\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.InputMismatchException;\nimport java.util.List;\nimport java.util.Map.Entry;\nimport java.util.NoSuchElementException;\n\npublic class Main implements Runnable { // クラス名はMain1\n\n\tPrintWriter out = new PrintWriter(System.out);\n\tInputReader sc = new InputReader(System.in);\n\tstatic int mod = 1000000000 + 7; //10^9+7\n\tint[] dx = { 1, 0, -1, 0 }, dy = { 0, 1, 0, -1 }; //4 directions\n\n\tpublic static void main(String[] args) {\n\t\tThread.setDefaultUncaughtExceptionHandler((t, e) -> System.exit(1));\n\t\tnew Thread(null, new Main(), \"\", 1024 * 1024 * 1024).start(); // 16MBスタックを確保して実行\n\t}\n\n\tpublic void run() {\n\n\t\ttry {\n\t\t\t/**\n\t\t\t * 2の累乗一覧\n\t\t\t * http://www.gaoshukai.com/20/06/0022/\n\t\t\t *\n\t\t\t * Bit 全探索\n\t\t\t\t//Nは要素数 (bit全探索)\n\t\t\t\t//計算量はO(2^N) Nが0-20~25 (30は多分無理)くらいまでしか使えない\n\t\t\t\tOut: for (int bit = 0; bit < (1 << N); bit++) {\n\t\t\t\t\tout.println(Integer.toBinaryString(bit));\n\t\t\t\t\tIn: for (int j = 0; j < N; j++) {\n\t\t\t\t\t\tout.println(1 & (bit >> j));\n\t\t\t\t\t\t//1が立ってれば対象。例えば101だったら1桁目と3桁目は選ばれている\n\t\t\t\t\t\t//「二進数iをjだけ右にビットシフトしたときの、iの1桁目と1とでビット論理積をとって、演算結果が1であるなら処理を実行する」\n\t\t\t\t\t\tif ((1 & bit >> j) == 1) {\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t *\n\t\t\t * 表示系\n\t\t\t * out.println();\n\t\t\t * out.println(\"i:\" + i + \" ,j:\" + j);\n\t\t\t * out.println(Arrays.toString(A));\n\t\t\t *\n\t\t\t * Sort (Arrays)\n\t\t\t * Integer[] A = new Integer[N];\n\t\t\t * Desc : Arrays.sort(A , Collections.reverseOrder());\n\t\t\t * Asc : Arrays.sort(A);\n\t\t\t *\n\t\t\t * 定義系\n\t\t\t * int[] s = new int[M];\n\t\t\t * ArrayDeque<Integer> deq= new ArrayDeque<>();//先頭と末尾への要素の追加・先頭と末尾の要素の取り出しと削除が定数時間\n\t\t\t * ArrayList<Integer> arr = new ArrayList<Integer>();//定数時間\n\t\t\t * HashMap<Integer,Integer> hm = new HashMap<>(); //定数時間\n\t\t\t *\n\t\t\t * //要素の追加と、最小の要素の取り出しと削除が対数時間\n\t\t\t * PriorityQueue<Integer> pq = new PriorityQueue<>();//昇順\n\t\t\t * PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder()); //逆順。降順\n\t\t\t *\n\t\t\t * TreeSet<Integer> ts = new TreeSet<>();//対数時間(重複はできない)\n\t\t\t *\n\t\t\t * 文字系\n\t\t\t * String S = sc.next().trim();\n\t\t\t * for (char i = 'a'; i <= 'z'; i++) {}\n\t\t\t * S.substring(1,2);//あいうえお → い\n\t\t\t * S.substring(0,1); // 1文字目をとりたいとき\n\t\t\t *\n\t\t\t * //同じ文字の繰り返し\n\t\t\t * String goy = String.join(\"\", Collections.nCopies(2, \"U\")); //Uを２回繰り返し\n\t\t\t *\n\t\t\t * 文字列のSort\n\t\t\t * String sorted = S.chars().sorted().collect(StringBuilder::new,StringBuilder::appendCodePoint, StringBuilder::append) .toString();\n\t\t\t */\n\t\t\t// long l = sc.nextLong();\n\t\t\t//String S = sc.next().trim();\n\t\t\t//int N = sc.nextInt();\n\t\t\t//int[] A = new int[N];\n\t\t\tint T1 = sc.nextInt();\n\t\t\tint T2 = sc.nextInt();\n\t\t\tlong A1 = sc.nextLong();\n\t\t\tlong A2 = sc.nextLong();\n\t\t\tlong B1 = sc.nextLong();\n\t\t\tlong B2 = sc.nextLong();\n\n\t\t\tlong P = (A1 - B1) * T1;\n\t\t\tlong Q = (A2 - B2) * T2;\n\n\t\t\tif (P < 0) {\n\t\t\t\tif (P + Q < 0) {\n\t\t\t\t\tout.println(0);\n\t\t\t\t} else if (P + Q == 0) {\n\t\t\t\t\tout.println(\"infinity\");\n\t\t\t\t} else {\n\t\t\t\t\tlong ans = (-P / (P + Q)) * 2 + ((-P % (P + Q)) != 0 ? 1 : 0);\n\t\t\t\t\tout.println(ans);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (P + Q > 0) {\n\t\t\t\t\tout.println(0);\n\t\t\t\t} else if (P + Q == 0) {\n\t\t\t\t\tout.println(\"infinity\");\n\t\t\t\t} else {\n\t\t\t\t\tlong ans = (-P / (P + Q)) * 2 + ((-P % (P + Q)) != 0 ? 1 : 0);\n\t\t\t\t\tout.println(ans);\n\t\t\t\t}\n\t\t\t}\n\n\t\t} catch (ArithmeticException ae) {\n\t\t\t//ae.printStackTrace();\n\t\t\tthrow new RuntimeException();\n\t\t} catch (Exception e) {\n\t\t\t//e.printStackTrace();\n\t\t\tthrow new RuntimeException();\n\t\t} finally {\n\t\t\tout.flush();\n\t\t\tout.close();\n\t\t}\n\n\t}\n\n\tclass Exm implements Comparable<Exm> {\n\n\t\tpublic int a;\n\t\tpublic int b;\n\n\t\tpublic Exm(int a, int b) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Exm o) {\n\n\t\t\t//return this.a - o.a;//昇順\n\t\t\t// return o.a - this.a;//降順\n\n\t\t\t//複数項目で並び替え。aの降順、aが同じならbの降順\n\t\t\tif (this.a == o.a) {\n\t\t\t\treturn o.b - this.b;\n\t\t\t} else {\n\t\t\t\treturn o.a - this.a;\n\t\t\t}\n\t\t}\n\t}\n\n\t//Arrays.sort(Sample,new Comp());\n\tclass Comp implements Comparator<Exm> {\n\t\tpublic int compare(Exm be, Exm af) {\n\t\t\treturn Long.compare(af.a, be.a);\n\t\t}\n\t}\n\n\t/**\n\t *\n\t * @param n\n\t * @param m\n\t * @return Combinationの数を返す(mod無しなので、大きい値には使用できない桁溢れする)\n\t */\n\tlong calcCombination(int n, int m) {\n\t\tif (n < m || m < 0) {\n\t\t\tthrow new IllegalArgumentException(\"引数の値が不正です ( n : \" + n + \", m : \" + m + \")\");\n\t\t}\n\t\tlong c = 1;\n\t\tm = (n - m < m ? n - m : m);\n\t\tfor (int ns = n - m + 1, ms = 1; ms <= m; ns++, ms++) {\n\t\t\tc *= ns;\n\t\t\tc /= ms;\n\t\t}\n\t\treturn c;\n\t}\n\n\t/*\n\t * 使用するときはModに注意。Global変数を参照\n\t */\n\tpublic static long comb(long a, long b) {\n\t\tif (a < b)\n\t\t\treturn 0;\n\t\tlong res = 1;\n\t\tlong inv = pow(fact(Math.min(b, a - b)), mod - 2);\n\t\tfor (long i = a; i > a - Math.min(b, a - b); i--) {\n\t\t\tres *= i;\n\t\t\tres %= mod;\n\t\t}\n\t\tres *= inv;\n\t\tres %= mod;\n\t\treturn res;\n\t}\n\n\tpublic static long pow(long x, long n) {\n\t\tlong res = 1;\n\t\twhile (n > 0) {\n\t\t\tif ((n & 1) == 1) {\n\t\t\t\tres *= x;\n\t\t\t\tres %= mod;\n\t\t\t}\n\t\t\tx *= x;\n\t\t\tx %= mod;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static long fact(long n) {\n\t\tlong res = 1;\n\t\twhile (n > 0) {\n\t\t\tres *= n;\n\t\t\tres %= mod;\n\t\t\tn--;\n\t\t}\n\t\treturn res;\n\t}\n\n\t/*\n\t * HashmapのSort\n\t * hmはhashmap\n\t * keyvalは\"key\" or \"val\"を指定して\n\t * ascdescは\"asc\" or \"desc\"を指定して\n\t */\n\tprivate static List<Entry<Integer, Integer>> sortHashMapValue(HashMap<Integer, Integer> hm, String keyval,\n\t\t\tString ascdesc) {\n\t\t// 1.Map.Entryのリストを作成する\n\t\tList<Entry<Integer, Integer>> list_entries = new ArrayList<Entry<Integer, Integer>>(hm.entrySet());\n\n\t\t// 2.比較関数Comparatorを使用してMap.Entryの値を比較する(昇順)\n\t\tCollections.sort(list_entries, new Comparator<Entry<Integer, Integer>>() {\n\t\t\tpublic int compare(Entry<Integer, Integer> obj1, Entry<Integer, Integer> obj2) {\n\t\t\t\tif (keyval.equals(\"val\")) {\n\t\t\t\t\tif (ascdesc.equals(\"asc\")) {\n\t\t\t\t\t\t// 昇順(value)\n\t\t\t\t\t\treturn obj1.getValue().compareTo(obj2.getValue());\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// 降順(value)\n\t\t\t\t\t\treturn obj2.getValue().compareTo(obj1.getValue());\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (ascdesc.equals(\"asc\")) {\n\t\t\t\t\t\t// 昇順(value)\n\t\t\t\t\t\treturn obj1.getKey().compareTo(obj2.getKey());\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// 降順(value)\n\t\t\t\t\t\treturn obj2.getKey().compareTo(obj1.getKey());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\t/*\n\t\t// 3. ループで要素順に値を取得する\n\t\tfor (Entry<Integer, Integer> entry : list_entries) {\n\t\t\tout.println(entry.getKey() + \" : \" + entry.getValue());\n\t\t}\n\t\t*/\n\t\treturn list_entries;\n\t}\n\n\t// 高速なScanner\n\tstatic class InputReader {\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n#define MOD 1000000007\n#define INF 800000000\n#define MAX 1000\n\nint main(){\n ll T1,T2,A1,A2,B1,B2;\n cin>>T1>>T2>>A1>>A2>>B1>>B2;\n if(T1*A1+T2*A2==T1*B1+T2*B2){\n cout<<\"infinity\"<<endl;\n }else{\n ll dx1=T1*B1-T1*A1;\n ll dx2=T1*B1+T2*B2-T1*A1-T2*A2;\n if((dx1>0&&dx2>0)||(dx1<0&&dx2<0)){\n cout<<0<<endl;\n }else{\n if(dx1<0){\n dx1=-dx1;\n }else{\n dx2=-dx2;\n }\n if(dx1%dx2==0){\n cout<<dx1/dx2*2<<endl;\n }else{\n cout<<dx1/dx2*2+1<<endl;\n }\n }\n }\n}\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\ntaka = T1 * A1 + T2 * A2\naoki = T1 * B1 + T2 * B2\nif taka == aoki:\n print(\"infinity\")\n quit()\nif taka > aoki:\n taka, aoki = aoki, taka\n A1, B1 = B1, A1\n A2, B2 = B2, A2\nif A1 < B1:\n print(0)\n quit()\nif A1 == B2:\n print(1)\n quit()\nfirst_diff = A1 * T1 - B1 * T1\ndiff = aoki - taka\nprint(first_diff // diff * 2 + (first_diff % diff != 0))\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nusing Lint=long long;\n\nLint solve(Lint X,Lint Y)\n{\n if(X<0) X=-X,Y=-Y;\n if(X==0) return 1;\n else{\n if(X+Y>0) return 0;\n else{\n Lint res=(X/abs(X+Y)+1)*2-1;\n if(X%abs(X+Y)==0) res--;\n return res;\n }\n }\n}\n\nint main()\n{\n Lint T1,T2,A1,A2,B1,B2; cin>>T1>>T2>>A1>>A2>>B1>>B2;\n Lint X=(A1-B1)*T1;\n Lint Y=(A2-B2)*T2;\n if(X+Y==0) cout<<\"infinity\"<<endl;\n else cout<<solve(X,Y)<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int t1, t2;\n ll a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n ll ab1 = (a1 - b1)*t1;\n ll ab2 = (a2 - b2)*t2;\n if(ab1+ab2 == 0){\n cout << \"infinity\" << endl;\n return 0;\n }\n if((ab1>0 && ab1+ab2>0) || (ab1<0 && ab1+ab2<0)){\n cout << 0 << endl;\n return 0;\n }\n ll ans = abs(ab1) / abs(ab1+ab2) *2 +1;\n if(abs(ab1) % abs(ab1+ab2) ==0) --ans;\n cout << ans << endl;\n}", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n TaskF solver = new TaskF();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class TaskF {\n public void solve(int testNumber, FastInput in, FastOutput out) {\n long t1 = in.readInt();\n long t2 = in.readInt();\n long[] a = new long[]{in.readLong(), in.readLong()};\n long[] b = new long[]{in.readLong(), in.readLong()};\n\n long aDist = a[0] * t1 + a[1] * t2;\n long bDist = b[0] * t1 + b[1] * t2;\n if (aDist == bDist) {\n out.println(\"infinity\");\n return;\n }\n if (aDist > bDist) {\n {\n long tmp = aDist;\n aDist = bDist;\n bDist = tmp;\n }\n {\n long[] tmp = a;\n a = b;\n b = tmp;\n }\n }\n\n long maxExcess = a[0] * t1 - b[0] * t1;\n long single = bDist - aDist;\n if (maxExcess == 0) {\n out.println(t1);\n return;\n }\n\n if (maxExcess < 0) {\n out.println(0);\n return;\n }\n\n long ans = maxExcess / single * 2 + 1;\n if (maxExcess % single == 0) {\n ans--;\n }\n out.println(ans);\n }\n\n }\n\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(String c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput println(int c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput println(long c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n}\n\n", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\n\np,q=(a1-b1)*t1,(a2-b2)*t2\nif p>0:\n p*=-1\n q*=-1\nif p+q<0:\n print(0)\nif p+q==0:\n print('infinity')\nif p+q>0:\n s,t=divmod((-p),(p+q))\n print(s*2+1) if t!=0 else print(s*2)", "T = list(map(int,input().split()))\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\n\nd = [(A[i] - B[i])*T[i] for i in range(2)]\nif d[0] < 0:\n d = [-d[0],-d[1]]\ns = sum(d)\nif s == 0:\n print('infinity')\nelif s > 0:\n print(0)\nelse:\n print(d[0]//(-s)*2 + 1 - (d[0]%s == 0))\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nA1, A2 = A1 * T1, A2 * T2\nB1, B2 = B1 * T1, B2 * T2\n\n\nif A1 + A2 == B1 + B2:\n print('infinity')\n exit()\n\n\nif A1 + A2 < B1 + B2:\n A1, A2, B1, B2 = B1, B2, A1, A2\nD = (A1 + A2) - (B1 + B2)\nRemain = B1 - A1\n\nprint(max(0, Remain // D * 2 + (Remain % D != 0)))\n", "#include<iostream>\n#include<cstdio>\n#include<queue>\n#include<vector>\n#include<string.h>\n#include<algorithm>\n#include<map>\n\nusing namespace std;\n\n\nlong long T1,T2,A1,A2,B1,B2,i,j,k,l,n1,n2,m;\n\nint main()\n{\n cin >> T1>>T2>>A1>>A2>>B1>>B2;\n if(A1<B1)\n {\n i=B1;\n B1=A1;\n A1=i;\n \n i=B2;\n B2=A2;\n A2=i;\n }\n n1=T1*(A1-B1);\n n2=T2*(B2-A2);\n l=n2-n1;\n if(l<0)\n {\n cout <<0;\n return 0;\n }\n \n if(l==0)\n {\n cout <<\"infinity\";\n return 0;\n }\n \n m=n1/(n2-n1)+1;\n k=n1%(n2-n1);\n \n if(k>0)\n {\n cout << 2*m-1;\n }\n else\n {\n cout << 2*m-2;\n }\n \n \n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n long long A = A1 - B1, B = A2 - B2;\n if(A < 0) { A = -A; B = -B;}\n\n if(A * T1 + B * T2 > 0) {\n cout << 0 << endl;\n } else if(A * T1 + B * T2 == 0) {\n cout << \"infinity\\n\";\n } else {\n long long a = A * T1, b = (A * T1 + B * T2) * (-1);\n if(a % b == 0) cout << 2 * (a / b) << endl;\n else cout << 2 * (a / b) + 1 << endl;\n }\n}", "T1,T2=[int(i) for i in input().split()]\nA1,A2=[int(i) for i in input().split()]\nB1,B2=[int(i) for i in input().split()]\nif((B1-A1)*((B1-A1)*T1+(B2-A2)*T2)>0):\n print(0);\n exit();\nif((B1-A1)*T1+(B2-A2)*T2==0):\n print(\"infinity\")\n exit();\nans=(abs((B1-A1)*T1)//abs((B1-A1)*T1+(B2-A2)*T2))*2+1\nif(abs((B1-A1)*T1)%abs((B1-A1)*T1+(B2-A2)*T2)==0):\n ans-=1\nprint(ans)\n\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nif t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2:\n print('infinity')\n exit()\n\nif a1 < b1:\n a1, a2, b1, b2 = b1, b2, a1, a2\nd1 = (a1-b1)*t1\nd2 = (a2-b2)*t2\nif d1 + d2 > 0:\n print(0)\n exit()\nif d1 == d2:\n print('infinity')\n exit()\n\ndd = abs(d1 + d2)\nif d1 % dd == 0:\n print(d1 // dd*2)\nelse:\n print((d1+dd-1)//dd*2-1)\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nC1 = A1 - B1\nC2 = A2 - B2\nif C1 > 0:\n C1, C2 = -C1, -C2\n\nx1 = C1 * T1 + C2 * T2\nx2 = x1 + C1 * T1\n\nif x1 == 0:\n print('infinity')\nelif x1 < 0:\n print(0)\nelse:\n if 0 < x2:\n count = 1\n elif 0 == x2:\n count = 2\n else:\n n = (-x2 + x1 - 1) // x1\n count = 1 + 2 * n\n if x2 % x1 == 0:\n count += 1\n print(count)", "import sys\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\n\nT1,T2 = MI()\nA1,A2 = MI()\nB1,B2 = MI()\n\nif A1*T1 + A2*T2 == B1*T1 + B2*T2:\n print('infinity')\n exit()\n\nif A1*T1 + A2*T2 > B1*T1 + B2*T2:\n A1,B1 = B1,A1\n A2,B2 = B2,A2\n\nif A1 < B1:\n print(0)\n exit()\n\nif ((A1-B1)*T1) % (B1*T1+B2*T2-A1*T1-A2*T2) != 0:\n print(((A1-B1)*T1)//(B1*T1+B2*T2-A1*T1-A2*T2)*2+1)\nelse:\n print(((A1-B1)*T1)//(B1*T1+B2*T2-A1*T1-A2*T2)*2)\n", "#include <bits/stdc++.h>\n#include <stdlib.h>\nusing namespace std;\ntypedef long long ll;\nconst ll mod=1000000007;\nconst ll BIG=1e15;\n\nint main(){\n ll T1,T2,A1,A2,B1,B2;\n cin>>T1>>T2>>A1>>A2>>B1>>B2;\n ll S=T1*(A1-B1)+T2*(A2-B2);\n ll C=T1*(A1-B1);\n if(S==0) cout<<\"infinity\"<<endl;\n else if(S>0 && C>0) cout<<0<<endl;\n else if(S<0 && C<0) cout<<0<<endl;\n else{\n C=abs(C);\n S=abs(S);\n ll ans=C/S;\n ans*=2;\n if((C%S)>0) ans++;\n cout<<ans<<endl;\n }\n\n}", "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n int t1, t2;\n cin >> t1 >> t2;\n ll a1, a2;\n cin >> a1 >> a2;\n ll b1, b2;\n cin >> b1 >> b2;\n if (a1 > b1) {\n swap(a1, b1);\n swap(a2, b2);\n }\n ll diff = t1*(a1-b1)+t2*(a2-b2);\n if (diff == 0) {\n cout << \"infinity\" << endl;\n return 0;\n }\n if (diff < 0) {\n cout << 0 << endl;\n return 0;\n }\n // cout << diff << endl;\n ll d1 = t1*(b1-a1);\n ll d2 = t2*(a2-b2);\n ll ans = 2* (d1/diff);\n if (d1 % diff > 0) {\n ans += 1;\n }\n cout << ans << endl;\n}\n", "import sys\nsys.setrecursionlimit(10 ** 7)\ninput = sys.stdin.readline\n\nt, tt = map(int, input().split())\na, aa = map(int, input().split())\nb, bb = map(int, input().split())\n\nif a*t+aa*tt == b*t+bb*tt or a*t == b*t:\n print('infinity')\n exit()\n\ndiff1 = a*t-b*t\n\ndiff12 = a*t+aa*tt - (b*t+bb*tt)\n\nif diff1*diff12>0:\n print(0)\n exit()\n\ndiff1 = abs(diff1)\ndiff12 = abs(diff12)\n\nif diff1%diff12==0:\n print(-(-diff1//diff12)*2)\nelse:\n print(-(-diff1//diff12)*2-1)\n", "\nt1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nd1 = t1 * (a1 - b1)\nd2 = t2 * (a2 - b2)\n\nif d1 > 0:\n d1 *= -1\n d2 *= -1\n\nif d1 + d2 == 0:\n print(\"infinity\")\nelif d1 + d2 < 0:\n print(0)\nelse:\n cnt = -d1 // (d1 + d2)\n t = -d1 % (d1 + d2)\n ans = 2 * cnt + int(t != 0)\n print(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nint main() {\n Int T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n A1 -= B1;\n A2 -= B2;\n if (A1 == 0 || A1 * T1 + A2 * T2 == 0) {\n cout << \"infinity\\n\";\n return 0;\n }\n if (A1 * T1 + A2 * T2 < 0) {\n A1 *= -1, A2 *= -1;\n }\n if (A1 > 0) {\n cout << \"0\\n\";\n return 0;\n }\n Int X = -A1 * T1;\n Int S = A1 * T1 + A2 * T2;\n if (X % S == 0) {\n cout << X / S * 2 << endl;\n } else {\n cout << X / S * 2 + 1 << endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\n#define ll long long\n#define V vector<long long>\n#define VV vector<vector<long long>>\n#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))\nusing namespace std;\n\nint main(){\n ll t1,t2;\n cin>>t1>>t2;\n ll a1,a2;\n cin>>a1>>a2;\n ll b1,b2;\n cin>>b1>>b2;\n ll d1=(a1-b1)*t1;\n ll d2=(a2-b2)*t2;\n if(d1+d2==0){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n if((d1>0&&(d1+d2)>0)||(d1<0&&(d1+d2)<0)){\n cout<<0<<endl;\n }else{\n ll cross=-d1/(d1+d2);\n if(abs(d1)%abs(d1+d2)==0){\n cout<<cross*2<<endl;\n }else{\n cout<<cross*2+1<<endl;\n }\n }\n}\n", "#include <bits/stdc++.h>\ntypedef long long ll;\n#define rep(i,n) for(ll i=0;i<(n);i++)\n#define sz(x) ll(x.size())\nusing namespace std;\n\nint main() {\n ll ans=0,t1,t2,a1,a2,b1,b2,p,q,s,t;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n p=(a1-b1)*t1;\n q=(a2-b2)*t2;\n if(p>0) {\n \tp*=-1; q*=-1;\n }\n if(p+q<0) puts(\"0\");\n else if(p+q==0) puts(\"infinity\");\n else{\n \ts=-p/(p+q);\n \tt=-p-(p+q)*s;\n \tans+=s*2;\n \tif(t!=0) ans++;\n cout << ans << endl;\n }\n}\n", "import java.util.*;\nimport java.io.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tSolver solver = new Solver();\n\t\tsolver.solve();\n\t\tsolver.exit();\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate final InputStream in = System.in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int ptr = 0;\n\t\tprivate int buflen = 0;\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (ptr < buflen) {\n\t\t\t\treturn true;\n\t\t\t}else{\n\t\t\t\tptr = 0;\n\t\t\t\ttry {\n\t\t\t\t\tbuflen = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\tif (buflen <= 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n\t\tprivate boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n\t\tprivate void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n\t\tpublic boolean hasNext() { skipUnprintable(); return hasNextByte();}\n\t\tpublic String next() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile(isPrintableChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif (b < '0' || '9' < b) {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\twhile(true){\n\t\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\t\tn *= 10;\n\t\t\t\t\tn += b - '0';\n\t\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\t\treturn minus ? -n : n;\n\t\t\t\t}else{\n\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Solver {\n\t\tFastScanner sc = new FastScanner();\n\t\tpublic Solver() { }\n\n\t\tString ns() { return sc.next(); }\n\t\tString[] ns(int n) {\n\t\t\tString a[] = new String[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ns(); }\n\t\t\treturn a;\n\t\t}\n\t\tString[][] ns(int n, int m) {\n\t\t\tString a[][] = new String[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ns(m); }\n\t\t\treturn a;\n\t\t}\n\t\tchar[] nc(int n) {\n\t\t\tString str = ns();\n\t\t\tchar a[] = new char[str.length()];\n\t\t\tfor(int i = 0; i < str.length(); i ++) { a[i] = str.charAt(i); }\n\t\t\treturn a;\n\t\t}\n\t\tchar[][] nc(int n, int m) {\n\t\t\tchar a[][] = new char[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nc(m); }\n\t\t\treturn a;\n\t\t}\n\t\tboolean[] nb(int n, char t) {\n\t\t\tboolean a[] = new boolean[n];\n\t\t\tchar c[] = nc(n);\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = c[i] == t; }\n\t\t\treturn a;\n\t\t}\n\t\tboolean[][] nb(int n, int m, char t) {\n\t\t\tboolean a[][] = new boolean[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nb(m, t); }\n\t\t\treturn a;\n\t\t}\n\t\tint ni() { return (int)sc.nextLong(); }\n\t\tint[] ni(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ni(); }\n\t\t\treturn a;\n\t\t}\n\t\tint[][] ni(int n, int m) {\n\t\t\tint a[][] = new int[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ni(m); }\n\t\t\treturn a;\n\t\t}\n\t\tlong nl() { return sc.nextLong(); }\n\t\tlong[] nl(int n) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nl(); }\n\t\t\treturn a;\n\t\t}\n\t\tlong[][] nl(int n, int m) {\n\t\t\tlong a[][] = new long[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nl(m); }\n\t\t\treturn a;\n\t\t}\n\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tPrintWriter err = new PrintWriter(System.err);\n\t\tvoid prt() { out.print(\"\"); }\n\t\t<T> void prt(T a) { out.print(a); }\n\t\tvoid prtln() { out.println(\"\"); }\n\t\t<T> void prtln(T a) { out.println(a); }\n\t\tvoid prtln(int... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(int element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(long... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(long element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(double... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(double element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(String... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(String element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(char... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(char element : a){ sb.append(element); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(int[][] a) { for(int[] element : a){ prtln(element); } }\n\t\tvoid prtln(long[][] a) { for(long[] element : a){ prtln(element); } }\n\t\tvoid prtln(double[][] a) { for(double[] element : a){ prtln(element); } }\n\t\tvoid prtln(String[][] a) { for(String[] element : a){ prtln(element); } }\n\t\tvoid prtln(char[][] a) { for(char[] element : a){ prtln(element); } }\n\t\tvoid errprt() { err.print(\"\"); }\n\t\t<T> void errprt(T a) { err.print(a); }\n\t\tvoid errprt(boolean a) { errprt(a ? \"#\" : \".\"); }\n\t\tvoid errprtln() { err.println(\"\"); }\n\t\t<T> void errprtln(T a) { err.println(a); }\n\t\tvoid errprtln(boolean a) { errprtln(a ? \"#\" : \".\"); }\n\t\tvoid errprtln(int... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(int element : a){ sb.append(element+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(long... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(long element : a){ sb.append(element+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(double... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(double element : a){ sb.append(element+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(String... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(String element : a){ sb.append(element+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(char... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(char element : a){ sb.append(element); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(boolean... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(boolean element : a){ sb.append((element ? \"#\" : \".\")+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(int[][] a) { for(int[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(long[][] a) { for(long[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(double[][] a) { for(double[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(String[][] a) { for(String[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(char[][] a) { for(char[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(boolean[][] a) { for(boolean[] element : a){ errprtln(element); } }\n\n\t\tvoid reply(boolean b) { prtln(b ? \"Yes\" : \"No\"); }\n\t\tvoid REPLY(boolean b) { prtln(b ? \"YES\" : \"NO\"); }\n\n\t\tvoid flush() { out.flush(); err.flush(); }\n\t\tvoid exit() { flush(); System.exit(0); }\n\n\t\tint min(int a, int b) { return Math.min(a, b); }\n\t\tlong min(long a, long b) { return Math.min(a, b); }\n\t\tdouble min(double a, double b) { return Math.min(a, b); }\n\t\tint min(int... x) {\n\t\t\tint min = x[0];\n\t\t\tfor(int val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tlong min(long... x) {\n\t\t\tlong min = x[0];\n\t\t\tfor(long val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tdouble min(double... x) {\n\t\t\tdouble min = x[0];\n\t\t\tfor(double val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tint max(int a, int b) { return Math.max(a, b); }\n\t\tlong max(long a, long b) { return Math.max(a, b); }\n\t\tdouble max(double a, double b) { return Math.max(a, b); }\n\t\tint max(int... x) {\n\t\t\tint max = x[0];\n\t\t\tfor(int val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tlong max(long... x) {\n\t\t\tlong max = x[0];\n\t\t\tfor(long val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tdouble max(double... x) {\n\t\t\tdouble max = x[0];\n\t\t\tfor(double val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tlong sum(int... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(int element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(long... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(long element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\t\tdouble sum(double... a) {\n\t\t\tdouble sum = 0;\n\t\t\tfor(double element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\n\t\tlong abs(double x) { return (long)Math.abs(x); }\n\t\tlong round(double x) { return Math.round(x); }\n\t\tlong floor(double x) { return (long)Math.floor(x); }\n\t\tlong ceil(double x) { return (long)Math.ceil(x); }\n\t\tdouble sqrt(double x) { return Math.sqrt(x); }\n\t\tdouble pow(double x, double y) { return Math.pow(x, y); }\n\t\tlong pow(long x, long y) { return (long)Math.pow(x, y); }\n\t\tint gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n\t\tlong gcd(long a, long b) { return b == 0 ? a : gcd(b, a % b); }\n\t\tlong lcm(long a, long b) { return a * b / gcd(a, b); }\n\n\t\tlong[] div(long a) {\n\t\t\tList<Long> divList = new ArrayList<Long>();\n\t\t\tfor(long i = 1; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tdivList.add(i);\n\t\t\t\t\tif(i * i != a) { divList.add(a / i); };\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlong div[] = new long[divList.size()];\n\t\t\tfor(int i = 0; i < divList.size(); i ++) { div[i] = divList.get(i); }\n\t\t\treturn div;\n\t\t}\n\n\t\tlong[][] factor(long a) {\n\t\t\tList<Long> factorList = new ArrayList<Long>();\n\t\t\tList<Long> degreeList = new ArrayList<Long>();\n\t\t\tfor(long i = 2; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tlong count = 0;\n\t\t\t\t\twhile(a % i == 0) {\n\t\t\t\t\t\ta /= i;\n\t\t\t\t\t\tcount ++;\n\t\t\t\t\t}\n\t\t\t\t\tfactorList.add(i);\n\t\t\t\t\tdegreeList.add(count);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(a > 1) {\n\t\t\t\tfactorList.add(a);\n\t\t\t\tdegreeList.add(1L);\n\t\t\t}\n\t\t\tlong factor[][] = new long[factorList.size()][2];\n\t\t\tfor(int i = 0; i < factorList.size(); i ++) {\n\t\t\t\tfactor[i][0] = factorList.get(i);\n\t\t\t\tfactor[i][1] = degreeList.get(i);\n\t\t\t}\n\t\t\treturn factor;\n\t\t}\n\n\t\tlong[][] countElements(long[] a, boolean sort) {\n\t\t\tint len = a.length;\n\t\t\tlong array[] = new long[len];\n\t\t\tfor(int i = 0; i < len; i ++) {\n\t\t\t\tarray[i] = a[i];\n\t\t\t}\n\t\t\tif(sort) { Arrays.sort(array); }\n\t\t\tList<Long> elem = new ArrayList<Long>();\n\t\t\tList<Long> cnt = new ArrayList<Long>();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add(array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else {\n\t\t\t\t\ttmp ++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\t\tlong[][] countElements(String str, boolean sort) {\n\t\t\tint len = str.length();\n\t\t\tchar array[] = str.toCharArray();\n\t\t\tif(sort) { Arrays.sort(array); }\n\t\t\tList<Long> elem = new ArrayList<Long>();\n\t\t\tList<Long> cnt = new ArrayList<Long>();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add((long)array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else {\n\t\t\t\t\ttmp ++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\n\t\tint numDigits(long a) { return Long.toString(a).length(); }\n\t\tlong bitFlag(int a) { return 1L << (long)a; }\n\t\tboolean isFlagged(long x, int a) { return (x & bitFlag(a)) != 0; }\n\n\t\tlong countString(String str, String a) { return (str.length() - str.replace(a, \"\").length()) / a.length(); }\n\t\tlong countStringAll(String str, String a) { return str.length() - str.replaceAll(a, \"\").length(); }\n\n\t\tvoid reverse(String array[]) {\n\t\t\tString reversed[] = new String[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(int array[]) {\n\t\t\tint reversed[] = new int[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(long array[]) {\n\t\t\tlong reversed[] = new long[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(double array[]) {\n\t\t\tdouble reversed[] = new double[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(boolean array[]) {\n\t\t\tboolean reversed[] = new boolean[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid fill(int array[], int x) { Arrays.fill(array, x); }\n\t\tvoid fill(long array[], long x) { Arrays.fill(array, x); }\n\t\tvoid fill(double array[], double x) { Arrays.fill(array, x); }\n\t\tvoid fill(boolean array[], boolean x) { Arrays.fill(array, x); }\n\t\tvoid fill(int array[][], int x) { for(int a[] : array) { fill(a, x); } }\n\t\tvoid fill(long array[][], long x) { for(long a[] : array) { fill(a, x); } }\n\t\tvoid fill(double array[][], double x) { for(double a[] : array) { fill(a, x); } }\n\t\tvoid fill(boolean array[][], boolean x) { for(boolean a[] : array) { fill(a, x); } }\n\n\t\tlong INF = (long)1e+15;\n\t\tboolean isINF(long a) { return abs(a) > INF / 1000; }\n\t\tboolean isPlusINF(long a) { return a > 0 && isINF(a); }\n\t\tboolean isMinusINF(long a) { return isPlusINF(- a); }\n\n\n\t\t// mods\n\t\tlong MOD = (long)1e9 + 7; // 998244353;\n\t\tpublic long mod(long i) { return i % MOD + ((i % MOD) < 0 ? MOD : 0); }\n\n\t\tlong pow_m(long x, long y) {\n\t\t\tif (y == 0) { return 1;\n\t\t\t}else {\n\t\t\t\tlong tmp = pow_m(x, y / 2);\n\t\t\t\treturn mod(mod(tmp * tmp) * (y % 2 == 0 ? 1 : x));\n\t\t\t}\n\t\t}\n\n\t\tlong inv(long x) { return pow_m(x, MOD - 2); }\n\n\t\tint MAX_FACT = 5_000_100;\n\t\tlong fact[];\n\t\tlong invFact[];\n\t\tvoid prepareFact() {\n\t\t\tfact = new long[MAX_FACT];\n\t\t\tArrays.fill(fact, 0);\n\t\t\tinvFact = new long[MAX_FACT];\n\t\t\tArrays.fill(invFact, 0);\n\t\t\tfact[0] = 1;\n\t\t\tint maxIndex = min(MAX_FACT, (int)MOD);\n\t\t\tfor(int i = 1; i < maxIndex; i ++) { fact[i] = mod(fact[i - 1] * i); }\n\t\t\tinvFact[maxIndex - 1] = inv(fact[maxIndex - 1]);\n\t\t\tfor(int i = maxIndex - 1; i > 0; i --) { invFact[i - 1] = mod(invFact[i] * i); }\n\t\t}\n\n\t\tlong P(int n, int r) {\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\treturn mod(fact[n] * invFact[n - r]);\n\t\t}\n\t\tlong C(int n, int r) {\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\treturn mod(P(n, r) * invFact[r]);\n\t\t}\n\t\tlong H(int n, int r) { return C((n - 1) + r, r); }\n\n\n\t\t// grid\n\t\tclass Grid implements Comparable<Grid> {\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tlong val;\n\n\t\t\tGrid() { }\n\t\t\tGrid(int h, int w) {\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t}\n\t\t\tGrid(int h, int w, long val) {\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tthis.val = val;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic int compareTo(Grid g) {\n\t\t\t\treturn Long.compare(this.val, g.val);\n\t\t\t}\n\t\t}\n\n\n\t\t// graph\n\t\tclass Graph {\n\t\t\tint numNode;\n\t\t\tint numEdge;\n\t\t\tboolean directed;\n\t\t\tEdge edges[];\n\t\t\tNode nodes[];\n\t\t\tNode reversedNodes[];\n\n\t\t\tGraph(int numNode, int numEdge, Edge edges[], boolean directed) {\n\t\t\t\tthis.numNode = numNode;\n\t\t\t\tthis.numEdge = numEdge;\n\t\t\t\tthis.directed = directed;\n\t\t\t\tthis.edges = edges;\n\t\t\t\tnodes = new Node[numNode];\n\t\t\t\treversedNodes = new Node[numNode];\n\t\t\t\tfor(int i = 0; i < numNode; i ++) {\n\t\t\t\t\tnodes[i] = new Node(i);\n\t\t\t\t\treversedNodes[i] = new Node(i);\n\t\t\t\t}\n\n\t\t\t\tfor(Edge edge : edges) {\n\t\t\t\t\tnodes[edge.source].add(edge.target, edge.cost);\n\t\t\t\t\tif(directed) {\n\t\t\t\t\t\treversedNodes[edge.target].add(edge.source, edge.cost);\n\t\t\t\t\t}else {\n\t\t\t\t\t\tnodes[edge.target].add(edge.source, edge.cost);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid clearNodes() {\n\t\t\t\tfor(Node n : nodes) { n.clear(); }\n\t\t\t\tfor(Node n : reversedNodes) { n.clear(); }\n\t\t\t}\n\t\t}\n\n\t\tclass Node {\n\t\t\tint id;\n\t\t\tArrayList<Edge> edges = new ArrayList<Edge>();\n\n\t\t\tNode(int id) {\n\t\t\t\tthis.id = id;\n\t\t\t}\n\t\t\tvoid add(int target, long cost) {\n\t\t\t\tedges.add(new Edge(id, target, cost));\n\t\t\t}\n\t\t\tvoid clear() {\n\t\t\t\tedges.clear();\n\t\t\t}\n\t\t}\n\n\t\tclass Edge implements Comparable<Edge> {\n\t\t\tint source;\n\t\t\tint target;\n\t\t\tlong cost;\n\t\t\tEdge(int source, int target, long cost) {\n\t\t\t\tthis.source = source;\n\t\t\t\tthis.target = target;\n\t\t\t\tthis.cost = cost;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic int compareTo(Edge e) {\n\t\t\t\treturn Long.compare(this.cost, e.cost);\n\t\t\t}\n\t\t}\n\npublic void solve() {\n\tlong t[] = nl(2);\n\tlong a[] = nl(2);\n\tlong b[] = nl(2);\n\ta[0] *= t[0];\n\ta[1] *= t[1];\n\tb[0] *= t[0];\n\tb[1] *= t[1];\n\tlong diff = sum(a) - sum(b);\n\tif(diff == 0) { prtln(\"infinity\"); return; }\n\tif(diff < 0) {\n\t\tfor(int i = 0; i < 2; i ++) {\n\t\t\tlong tmp = a[i];\n\t\t\ta[i] = b[i];\n\t\t\tb[i] = tmp;\n\t\t}\n\t\tdiff *= -1;\n\t}\n\tif(a[0] > b[0]) { prtln(0); return; }\n\tif(a[0] == b[0]) { prtln(1); return; }\n\tprtln((long)((b[0] - a[0]) / diff) * 2 + 1 + ((b[0] - a[0]) % diff == 0 ? -1 : 0));\n}\n\n\n\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tlong long T1,T2,A1,A2,B1,B2;\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\t\n\tif((T1*A1+T2*A2)==(T1*B1+T2*B2)){\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\t\n\tif((T1*A1+T2*A2)<(T1*B1+T2*B2)){\n\t\tswap(A1,B1);\n\t\tswap(A2,B2);\n\t}\n\t\n\tlong long diff1=T1*(B1-A1);\n\tlong long diff2=T2*(A2-B2);\n\tlong long diff=diff2-diff1;\n\t\n\tif(diff1<0){\n\t\tcout << \"0\" << endl;\n\t\treturn 0;\n\t}\n\t\n\tlong long ans=diff1/diff*2;\n\tif(diff1%diff>0)ans++;\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\nll t1,t2,a1,a2,b1,b2;\nint main(){\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n a1*=t1;\n a2*=t2;\n b1*=t1;\n b2*=t2;\n if(a1+a2==b1+b2){\n cout<<\"infinity\\n\";\n return 0;\n }\n if(a1<b1^a1+a2>b1+b2){\n cout<<0<<endl;\n return 0;\n }\n ll c1=abs(a1-b1),c2=abs(a2-b2);\n if(c1>c2){\n ll t=c1;\n c1=c2;\n c2=t;\n }\n cout<<c1/(c2-c1)*2+(c1%(c2-c1)?1:0)<<endl;\n}", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<iomanip>\n#include<set>\n#include<queue>\n\nusing namespace std;\n\nint main()\n{\n\tlong long t,s,a,b,c,d;\n\tcin >> t >> s >> a >> b >> c >> d;\n\ta=a-c; // 区間tにおける増加分\n\tb=b-d; // 区間sにおける増加分\n\tif((a>0 and b>0) or (a<0 and b<0))\n\t{\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\ta=abs(a);\n\tb=(-1)*abs(b);\n\ta*=t; // 10^15\n\tb*=s; // 10^15\n\t\n//\tcout << a << endl;\n//\tcout << b << endl;\n\n\tlong long x=a+b;\n\n\tif(x>0)\n\t{\n\t\tcout << 0 << endl;\n\t}\n\telse if(x==0)\n\t{\n\t\tcout << \"infinity\" << endl;\n\t}\n\telse\n\t{\n\t\tcout << ((a+abs(x)-1)/abs(x))*2+(a%abs(x)==0 ? 1:0)-1 << endl;\n\t}\n\n\n\n\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define INF 1LL<<62\n#define inf 1000000007\n\nint main() {\n\tll t1,t2,a1,a2,b1,b2;\n\tcin>>t1>>t2>>a1>>a2>>b1>>b2;\n\tll f1=a1-b1;ll f2=a2-b2;\n\tif(f1>0&&f2>0||f1<0&&f2<0){\n\t\tcout << 0;\n\t\treturn 0;\n\t}\n\tf1=abs(f1);f2=abs(f2);\n\tll dx1=t1*f1;\n\tll dx2=t2*f2;\n\tif(dx1-dx2>0){\n\t\tcout << 0;\n\t\treturn 0;\n\t}\n\tif(dx1==dx2){\n\t\tcout <<\"infinity\";\n\t\treturn 0;\n\t}\n\tdx2=abs(dx2-dx1);\n\tll cnt=(dx1+dx2-1)/dx2;\n\tll ans=cnt*2;\n\tif(dx1%dx2!=0){\n\t\tans--;\n\t}\n\tcout <<ans;\n\t// your code goes here\n\treturn 0;\n}", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.Reader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n FIntervalRunning solver = new FIntervalRunning();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class FIntervalRunning {\n public void solve(int testNumber, MyInput in, PrintWriter out) {\n long t1 = in.nextLong();\n long t2 = in.nextLong();\n long a1 = in.nextLong();\n long a2 = in.nextLong();\n long b1 = in.nextLong();\n long b2 = in.nextLong();\n\n long p1 = t1 * a1 + t2 * a2;\n long p2 = t1 * b1 + t2 * b2;\n if (p1 == p2) {\n out.println(\"infinity\");\n return;\n }\n\n long d1 = t1 * a1 - t1 * b1;\n long d2 = p1 - p2;\n if (d1 < 0) {\n d1 = -d1;\n d2 = -d2;\n }\n\n if (d2 > 0) {\n out.println(\"0\");\n return;\n }\n\n d2 = -d2;\n out.println((d1 + d2 - 1) / d2 + Math.max(0, d1 / d2));\n }\n\n }\n\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n\n }\n}\n\n", "#include <stdio.h>\nlong long t[2], a[2], b[2];\nlong long w, x, y, z, e, f;\nlong long ans;\nint main() {\n\tscanf(\"%lld%lld\", t, t + 1);\n\tscanf(\"%lld%lld\", a, a + 1);\n\tscanf(\"%lld%lld\", b, b + 1);\n\tif (a[0] == b[0])printf(\"wa\\n\");\n\tif (a[1] == b[1])printf(\"wa\\n\");\n\tx = t[0]; y = t[1];\n\tw = b[0] - a[0];\n\tz = b[1] - a[1];\n\te = w * x + z * y;\n\tif (e == 0) {\n\t\tprintf(\"infinity\\n\");\n\t\treturn 0;\n\t}\n\tif (e > 0) {\n\t\tw = -w;\n\t\tz = -z;\n\t\te = -e;\n\t}\n\tif (w < 0) {\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\tf = w * x;\n\te = -e;\n\tans = f / e * 2;\n\tif (f % e)ans++;\n\tprintf(\"%lld\\n\", ans);\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll t1,t2,a1,a2,b1,b2;\nint main()\n{\n scanf(\"%lld%lld%lld%lld%lld%lld\",&t1,&t2,&a1,&a2,&b1,&b2);\n ll a=a1-b1,b=a2-b2;\n if(a<0) a*=-1,b*=-1;\n ll k=t1*a+t2*b;\n if(k==0) {printf(\"infinity\\n\");return 0;}\n if(k>0){printf(\"0\\n\");return 0;}\n ll ans=a*t1/(-k)+(-b)*t2/(-k);\n if(-b*t2%(-k)==0) ans--;\n printf(\"%lld\\n\",ans);\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n a1 *= t1;\n a2 *= t2;\n b1 *= t1;\n b2 *= t2;\n\n if (a1 + a2 == b1 + b2) {\n cout << \"infinity\" << endl;\n return 0;\n }\n\n if ((a1 < b1 && a1 + a2 < b1 + b2) || (a1 > b1 && a1 + a2 > b1 + b2)) {\n cout << 0 << endl;\n }\n else {\n ll x1 = abs(a1 - b1), x2 = abs((a1 + a2) - (b1 + b2));\n if (x1 % x2 == 0) cout << (x1 / x2) * 2 << endl;\n else cout << (x1 / x2) * 2 + 1 << endl;\n }\n\n\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nint main() {\n ll T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n ll d1 = A1 - B1, d2 = A2 - B2;\n ll once = d1 * T1 + d2 * T2;\n if (once == 0) {\n cout << \"infinity\" << endl;\n return 0;\n } else if ((d1 > 0 && once > 0) || (d1 < 0 && once < 0)) {\n cout << 0 << endl;\n return 0;\n }\n ll ans = d1 * T1 / (- once);\n if (d1 * T1 % (- once) == 0) {\n ans *= 2;\n } else {\n ans = 2 * ans + 1;\n }\n cout << ans << endl;\n}", "#include <iostream>\nusing namespace std;\ntypedef long long ll;\nint main() {\n int t[2];\n cin >> t[0] >> t[1];\n ll a[2], b[2];\n cin >> a[0] >> a[1];\n cin >> b[0] >> b[1];\n\n if(a[0] < b[0]) {\n swap(a[0], b[0]);\n swap(a[1], b[1]);\n }\n\n ll c[2] = {a[0] - b[0], a[1] - b[1]};\n ll d[2] = {c[0] * t[0], c[1] * t[1]};\n if(0 < d[0] + d[1]) {\n cout << 0 << endl;\n return 0;\n }\n if(d[0] == -d[1]) {\n cout << \"infinity\" << endl;\n return 0;\n }\n\n ll dx = -d[1] - d[0];\n ll ans = 1;\n ans += 2 * (d[0] / dx);\n if(d[0] % dx == 0) ans--;\n cout << ans << endl;\n return 0;\n}", "#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n ll t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n if (a1 > b1) {\n swap(a1, b1);\n swap(a2, b2);\n }\n ll p = (a1-b1)*t1;\n ll q = (a2-b2)*t2;\n if (p+q < 0) {\n cout << 0 << endl;\n return 0;\n }\n if (p+q == 0) {\n cout << \"infinity\" << endl;\n return 0;\n }\n if ((-p)%(p+q) != 0) {\n cout << ((-p)/(p+q))*2 + 1 << endl;\n }\n else {\n cout << ((-p)/(p+q))*2 << endl;\n }\n}", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\nif a1*t1+a2*t2==b1*t1+b2*t2:\n print(\"infinity\")\n quit()\nx = (a1-b1)*t1\ny = (a2-b2)*t2\nif x < 0:\n x,y = -x,-y\nd = x+y\nif d > 0:\n print(0)\n quit()\nif x%(-d) == 0:\n print(2*(x//(-d)))\nelse:\n print(2*(x//(-d))+1)\n\n", "T1,T2 = list(map(int,input().split()))\nA1,A2 = list(map(int,input().split()))\nB1,B2 = list(map(int,input().split()))\n\na1 = A1*T1\na2 = A2*T2\nb1 = B1*T1\nb2 = B2*T2\n\nif a1+a2 < b1+b2:\n a1,b1 = b1,a1\n a2,b2 = b2,a2\n#print(a1,a2,b1,b2)\n\nif a1+a2 == b1+b2:\n print('infinity')\nelse:\n if a1 > b1:\n print(0)\n else:\n c = (b1-a1)/((a1+a2)-(b1+b2))\n print(int(c)*2 if c.is_integer() else int(c)*2+1)\n", "// I SELL YOU...! \n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<functional>\n#include<queue>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\nsigned main(){\n ll t0,t1,a0,a1,b0,b1;\n ll cnt=0;\n ll p1,p0,diff;\n cin >> t0 >> t1 >> a0 >> a1 >> b0 >> b1;\n p0 = t0*(a0-b0);\n p1 = p0 + t1*(a1-b1);\n if(p1==0){\n cout << \"infinity\"<<endl;\n return 0;\n }\n if((p0>0&&p1>0)||(p0<0&&p1<0)){\n cout << 0 << endl;\n return 0;\n }\n if(p1<0){\n p0 *= -1;\n p1 *= -1;\n } \n cnt++;\n cnt += (-p0 / p1)*2;\n if((-p0)%p1 == 0) cnt--;\n cout << cnt << endl;\n}\n", "from math import floor\nt1, t2 = map(int,input().split())\na1, a2 = map(int,input().split())\nb1, b2 = map(int,input().split())\n\nv1 = a1-b1\nv2 = a2-b2\n\nm1 = v1*t1\nm2 = v2*t2\n\nif m1>0:\n m1 *= -1\n m2 *= -1\n\nif m1 == -m2:\n print('infinity')\nelif m1+m2>0:\n ans = floor(-m1/(m2+m1)) * 2\n if m1%(m2+m1) != 0:\n ans += 1\n print(ans)\nelse:\n print(0)", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\na1 -= b1\na2 -= b2\nif a1 < 0:\n a1 *= -1\n a2 *= -1\nd = a1 * t1 + a2 * t2\nif d > 0:\n print(0)\nelif d == 0:\n print('infinity')\nelse:\n d *= -1\n l = a1 * t1\n if l % d != 0:\n print(l//d*2+1)\n else:\n print(l//d*2)\n #print(a1,a2)\n #print(d,l)", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n long long T1, T2;\n cin>>T1>>T2;\n long long A1, A2;\n cin>>A1>>A2;\n long long B1, B2;\n cin>>B1>>B2;\n\n long long X = T1*(A1-B1);\n long long Y = T2*(A2-B2);\n if (X<0)\n X *= -1,\n Y *= -1;\n if (X+Y>0)\n cout<<0<<endl;\n if (X+Y==0)\n cout<<\"infinity\"<<endl;\n if (X+Y<0)\n {\n long long t = -(X+Y);\n cout<<(X/t)*2+1-(X%t==0?1:0)<<endl;\n }\n}\n", "import java.io.*;\nimport java.util.*;\n \n \n \npublic class Main {\n\t\n\tstatic InputReader in = new InputReader(System.in);\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\t\n\tstatic int oo = (int)1e9;\n//\tstatic long oo = (long)1e15;\n\tstatic int mod = 1_000_000_007;\n\t\n\tstatic int[] di = {1, 0, 0, -1};\n\tstatic int[] dj = {0, -1, 1, 0};\n\t\n\tstatic int M = 100005;\n\tstatic double EPS = 1e-5;\n\t\n\t\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tlong t1 = in.nextLong();\n\t\tlong t2 = in.nextLong();\n\t\tlong a1 = in.nextLong();\n\t\tlong a2 = in.nextLong();\n\t\tlong b1 = in.nextLong();\n\t\tlong b2 = in.nextLong();\n\t\t\n\t\tPair a = new Pair(a1 * t1, a2 * t2);\n\t\tPair b = new Pair(b1 * t1, b2 * t2);\n\t\tif(a.first == b.first || a.first + a.second == b.first + b.second) {\n\t\t\tSystem.out.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif(a.first < b.first) {\n\t\t\tPair tmp = a;\n\t\t\ta = b;\n\t\t\tb = tmp;\n\t\t}\n\t\tif(a.first + a.second > b.first + b.second) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong d1 = a.first - b.first;\n\t\tlong d2 = b.first + b.second - a.first - a.second;\n\t\tlong ans = d1 / d2 * 2 + 1;\n\t\tif(d1 % d2 == 0)\n\t\t\tans--;\n\t\tSystem.out.println(ans);\n\t\t\n\t\tout.close();\n\t}\n\t\n\tstatic class Pair {\n\t\tlong first, second;\n\n\t\tpublic Pair(long first, long second) {\n\t\t\tsuper();\n\t\t\tthis.first = first;\n\t\t\tthis.second = second;\n\t\t}\n\t}\n\t\n\t\n\tstatic int find(int[] g, int x) {\n\t\treturn g[x] = g[x] == x ? x : find(g, g[x]);\n\t}\n\t\n\tstatic void union(int[] g, int[] size, int x, int y) {\n\t\tx = find(g, x); y = find(g, y);\n\t\tif(x == y)\n\t\t\treturn;\n\t\tif(size[x] < size[y]) {\n\t\t\tg[x] = y;\n\t\t\tsize[y] += size[x];\n\t\t}\n\t\telse {\n\t\t\tg[y] = x;\n\t\t\tsize[x] += size[y];\n\t\t}\n\t}\n\t\n\tstatic class Segment {\n\t\tSegment left, right;\n\t\tlong sum;\n\t\tlong lazy;\n\t\t\n\t\tpublic Segment(long[] a, int l, int r) {\n\t\t\tsuper();\n\t\t\tif(l == r) {\n\t\t\t\tsum = a[l];\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint mid = (l + r) / 2;\n\t\t\tleft = new Segment(a, l, mid);\n\t\t\tright = new Segment(a, mid+1, r);\n\t\t\tsum = left.sum + right.sum;\n\t\t}\n\t\t\n\t\tboolean covered(int ll, int rr, int l, int r) {\n\t\t\treturn ll <= l && rr >= r;\n\t\t}\n\t\t\n\t\tboolean noIntersection(int ll, int rr, int l, int r) {\n\t\t\treturn ll > r || rr < l;\n\t\t}\n\t\t\n\t\tvoid lazyPropagation(int l, int r) {\n\t\t\tif(lazy != 0) {\n\t\t\t\tset(lazy, l, r); \n\t\t\t\tif(left != null) {\n\t\t\t\t\tleft.lazy += lazy;\n\t\t\t\t\tright.lazy += lazy;\n\t\t\t\t}\n\t\t\t\tlazy = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvoid set(long delta, int l, int r) {\n\t\t\tint sz = r - l + 1;\n\t\t\tsum += delta * sz; \n\t\t}\n\t\t\n\t\tlong query(int ll, int rr, int l, int r) {\n\t\t\tlazyPropagation(l, r);\n\t\t\tif(noIntersection(ll, rr, l, r))\n\t\t\t\treturn 0;\n\t\t\tif(covered(ll, rr, l, r))\n\t\t\t\treturn sum;\n\t\t\tint mid = (l + r) / 2;\n\t\t\tlong leftSum = left.query(ll, rr, l, mid);\n\t\t\tlong rightSum = right.query(ll, rr, mid+1, r);\n\t\t\treturn leftSum + rightSum;\n\t\t}\n\t\t\n//\t\tint query(int k, int l, int r) {\n//\t\t\tSegment trace = this;\n//\t\t\twhile(l < r) {\n//\t\t\t\tint mid = (l + r) / 2;\n//\t\t\t\tif(trace.left.size > k) {\n//\t\t\t\t\ttrace = trace.left;\n//\t\t\t\t\tr = mid;\n//\t\t\t\t}\n//\t\t\t\telse {\n//\t\t\t\t\tk -= trace.left.size;\n//\t\t\t\t\ttrace = trace.right;\n//\t\t\t\t\tl = mid + 1;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\treturn trace.val;\n//\t\t}\n\t\t\n\t\tvoid update(int ll, int rr, long add, int l, int r) {\n\t\t\tlazyPropagation(l, r);\n\t\t\tif(noIntersection(ll, rr, l, r))\n\t\t\t\treturn;\n\t\t\tif(covered(ll, rr, l, r)) {\n\t\t\t\tset(add, l, r);\n\t\t\t\tif(left != null) {\n\t\t\t\t\tleft.lazy += add;\n\t\t\t\t\tright.lazy += add;\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint mid = (l + r) / 2;\n\t\t\tleft.update(ll, rr, add, l, mid);\n\t\t\tright.update(ll, rr, add, mid+1, r);\n\t\t\tsum = left.sum + right.sum;\n\t\t}\n\t}\n\t\n\tstatic long pow(long a, long n, long mod) {\n\t\tif(n == 0)\n\t\t\treturn 1;\n\t\tif(n % 2 == 1)\n\t\t\treturn a * pow(a, n-1, mod) % mod;\n\t\tlong x = pow(a, n / 2, mod);\n\t\treturn x * x % mod;\n\t}\n\t\n\t\n\tstatic int[] getPi(char[] a) {\n\t\tint m = a.length;\n\t\tint j = 0;\n\t\tint[] pi = new int[m];\n\t\tfor(int i = 1; i < m; ++i) {\n\t\t\twhile(j > 0 && a[i] != a[j])\n\t\t\t\tj = pi[j-1];\n\t\t\tif(a[i] == a[j]) {\n\t\t\t\tpi[i] = j + 1;\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\treturn pi;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn a * b / gcd(a, b);\n\t}\n\t\n\tstatic boolean nextPermutation(int[] a) {\n\t\tfor(int i = a.length - 2; i >= 0; --i) {\n\t\t\tif(a[i] < a[i+1]) {\n\t\t\t\tfor(int j = a.length - 1; ; --j) {\n\t\t\t\t\tif(a[i] < a[j]) {\n\t\t\t\t\t\tint t = a[i];\n\t\t\t\t\t\ta[i] = a[j];\n\t\t\t\t\t\ta[j] = t;\n\t\t\t\t\t\tfor(i++, j = a.length - 1; i < j; ++i, --j) {\n\t\t\t\t\t\t\tt = a[i];\n\t\t\t\t\t\t\ta[i] = a[j];\n\t\t\t\t\t\t\ta[j] = t;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t\n\tstatic void shuffle(Object[] a) {\n\t\tRandom r = new Random();\n\t\tfor(int i = a.length - 1; i > 0; --i) {\n\t\t\tint si = r.nextInt(i);\n\t\t\tObject t = a[si];\n\t\t\ta[si] = a[i];\n\t\t\ta[i] = t;\n\t\t}\n\t}\n\t\n\tstatic void shuffle(int[] a) {\n\t\tRandom r = new Random();\n\t\tfor(int i = a.length - 1; i > 0; --i) {\n\t\t\tint si = r.nextInt(i);\n\t\t\tint t = a[si];\n\t\t\ta[si] = a[i];\n\t\t\ta[i] = t;\n\t\t}\n\t}\n\t\n\tstatic void shuffle(long[] a) {\n\t\tRandom r = new Random();\n\t\tfor(int i = a.length - 1; i > 0; --i) {\n\t\t\tint si = r.nextInt(i);\n\t\t\tlong t = a[si];\n\t\t\ta[si] = a[i];\n\t\t\ta[i] = t;\n\t\t}\n\t}\n\t\n\tstatic int lower_bound(int[] a, int n, int k) {\n\t\tint s = 0;\n\t\tint e = n;\n\t\tint m;\n\t\twhile (e - s > 0) {\n\t\t\tm = (s + e) / 2;\n\t\t\tif (a[m] < k)\n\t\t\t\ts = m + 1;\n\t\t\telse\n\t\t\t\te = m;\n\t\t}\n\t\treturn e;\n\t}\n\tstatic int lower_bound(long[] a, int n, long k) {\n\t\tint s = 0;\n\t\tint e = n;\n\t\tint m;\n\t\twhile (e - s > 0) {\n\t\t\tm = (s + e) / 2;\n\t\t\tif (a[m] < k)\n\t\t\t\ts = m + 1;\n\t\t\telse\n\t\t\t\te = m;\n\t\t}\n\t\treturn e;\n\t}\n\t\n\tstatic int gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\tstatic long gcd(long a, long b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\t\n//\tstatic class Pair implements Comparable<Pair> {\n//\t\tint first, second;\n// \n//\t\tpublic Pair(int first, int second) {\n//\t\t\tsuper();\n//\t\t\tthis.first = first;\n//\t\t\tthis.second = second;\n//\t\t}\n// \n//\t\t@Override\n//\t\tpublic int compareTo(Pair o) {\n//\t\t\treturn this.first != o.first ? this.first - o.first : this.second - o.second;\n//\t\t}\n//\t\t\n////\t\t@Override\n////\t\tpublic int compareTo(Pair o) {\n////\t\t\treturn this.first != o.first ? o.first - this.first : o.second - this.second;\n////\t\t}\n// \n//\t\t@Override\n//\t\tpublic int hashCode() {\n//\t\t\tfinal int prime = 31;\n//\t\t\tint result = 1;\n//\t\t\tresult = prime * result + first;\n//\t\t\tresult = prime * result + second;\n//\t\t\treturn result;\n//\t\t}\n// \n//\t\t@Override\n//\t\tpublic boolean equals(Object obj) {\n//\t\t\tif (this == obj)\n//\t\t\t\treturn true;\n//\t\t\tif (obj == null)\n//\t\t\t\treturn false;\n//\t\t\tif (getClass() != obj.getClass())\n//\t\t\t\treturn false;\n//\t\t\tPair other = (Pair) obj;\n//\t\t\tif (first != other.first)\n//\t\t\t\treturn false;\n//\t\t\tif (second != other.second)\n//\t\t\t\treturn false;\n//\t\t\treturn true;\n//\t\t}\n//\t}\n}\n \n \n \nclass InputReader {\n \n\tprivate final InputStream stream;\n\tprivate final byte[] buf = new byte[8192];\n\tprivate int curChar, snumChars;\n \n\tpublic InputReader(InputStream st) {\n\t\tthis.stream = st;\n\t}\n \n\tpublic int read() {\n\t\tif (snumChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= snumChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (snumChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n \n\tpublic int nextInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tpublic long nextLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tpublic int[] nextIntArray(int n) {\n\t\tint a[] = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = nextInt();\n\t\t}\n\t\treturn a;\n\t}\n \n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n \n\tpublic String nextLine() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isEndOfLine(c));\n\t\treturn res.toString();\n\t}\n \n\tpublic boolean isSpaceChar(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n \n\tprivate boolean isEndOfLine(int c) {\n\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t}\n \n}", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\n\nd1 = (a1-b1)*t1\nd2 = (b2-a2)*t2\n\nif d1 == d2:\n print('infinity')\n \nif d1 * (d2 - d1) < 0:\n print(0)\n\nif d1*(d2-d1)>0:\n if d1%(d1-d2)==0:\n print((d1//(d2-d1))*2)\n else:\n print((d1//(d2-d1))*2+1)", "t1, t2 = map(int, raw_input().split(' '))\na1, a2 = map(int, raw_input().split(' '))\nb1, b2 = map(int, raw_input().split(' '))\nv1 = a1 * t1 + a2 * t2\nv2 = b1 * t1 + b2 * t2\nif v1 == v2:\n\tprint('infinity')\nelse:\n\tif(v1 < v2):\n\t\tv1, v2 = v2, v1\n\t\ta1, a2, b1, b2 = b1, b2, a1, a2\n\tlo = 0\n\thi = 10**100\n\tans = 0\n\twhile lo <= hi:\n\t\tmid = (lo + hi) / 2\n\t\tat_a = mid * v1\n\t\tat_b = mid * v2\n\t\tif at_b + b1 * t1 >= at_a + a1 * t1:\n\t\t\tans = mid\n\t\t\tlo = mid + 1\n\t\telse:\n\t\t\thi = mid - 1\n\tmv = 0\n\tif ans * v1 + a1 * t1 < ans * v2 + b1 * t1:\n\t\tmv = 1\n\tprint(2*ans + mv)\n", "#include <bits/stdc++.h>\n#define ROOP(i, N) for(int i=0; i++; i<N)\n#define RVROOP(i, N) for(int i=N; i--; i>=0)\n#define INF 1e9\n#define MOD 1000000007\n#define ALL(v) v.begin(), v.end()\nusing namespace std;\ntypedef long long ll;\nint main() {\n ll T1,T2,A1,A2,B1,B2;\n cin>>T1>>T2>>A1>>A2>>B1>>B2;\n ll p=(A1-B1)*T1, q=(A2-B2)*T2;\n if(p>0){\n p*=(-1);\n q*=(-1);\n }\n if(p+q<0){\n cout<<\"0\"<<endl;\n }\n else if(p+q==0){\n cout<<\"infinity\"<<endl;\n }\n else{\n ll S,T;\n S=-p/(p+q);\n T=-p%(p+q);\n if(T==0){\n cout<<2*S<<endl;\n }\n else{\n cout<<2*S+1<<endl;\n }\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int64_t a,b,c,d,e,f;\n cin>>a>>b>>c>>d>>e>>f;\n int64_t i=a*(c-e);\n int64_t j=b*(d-f);\n if(i+j==0){\n cout<<\"infinity\"<<endl;\n }\n else if(i>0 && j>=0){\n cout<<0<<endl;\n }\n else if(i<0 && j<=0){\n cout<<0<<endl;\n }\n else{\n if(i>0){\n i=-i;\n j=-j;\n }\n if(i+j<0){\n cout<<0<<endl;\n }\n else{\n if((-i)%(i+j)!=0){\n cout<<((-i)/(i+j))*2+1<<endl;\n }\n else{\n cout<<((-i)/(i+j))*2<<endl;\n }\n }\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint main() {\n int64_t t1,t2,a1,a2,b1,b2;\n cin >> t1>>t2>>a1>>a2>>b1>>b2;\n a1 -= b1; a2 -= b2;\n int64_t l1 = a1*t1; int64_t l2 = a2*t2;\n if(l1+l2 == 0){\n cout << \"infinity\" << endl;\n }\n else{\n if(l1+l2 < 0){\n l1 *= -1; l2*= -1;\n }\n if(l1 == 0) cout << 1 << endl;\n else if(l1 > 0) cout << 0 << endl;\n else{\n int64_t k = l2/(l1+l2);\n if(l2%(l1+l2)==0) cout << 2*k-2 << endl;\n else cout << 2*k-1 << endl;\n }\n }\n}", "#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint main()\n{\n ll t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n if(a1 < b1){\n swap(a1, b1);\n swap(a2, b2);\n }\n if(t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2){\n cout << \"infinity\" << endl;\n return 0;\n }\n if(t1 * a1 + t2 * a2 > t1 * b1 + t2 * b2){\n cout << 0 << endl;\n return 0;\n }\n ll mdif = t1 * a1 - t1 * b1;\n ll ldif = (t1 * b1 + t2 * b2) - (t1 * a1 + t2 * a2);\n if(mdif % ldif == 0) cout << mdif / ldif * 2 << endl;\n else cout << (mdif / ldif) * 2 + 1 << endl;\n}", "import sys\ninput = sys.stdin.readline\nT = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\np = (a[0] - b[0]) * T[0]\nq = (a[1] - b[1]) * T[1]\n\nif p > 0:\n p *= -1\n q *= -1\nif p + q < 0:\n print(0)\nelif p + q > 0:\n print(-p // (p + q) * 2 + ((-p % (p + q)) > 0))\nelse:\n print(\"infinity\")", "T = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\n\nda, db = 0, 0\nfor i in range(2):\n da += T[i] * A[i]\n db += T[i] * B[i]\n\nif da == db:\n print(\"infinity\")\n exit()\n\nx = (B[0] - A[0]) * T[0]\ny = da - db\n\nprint(max(0, x // y * 2 + (0 if x % y == 0 else 1)))\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nv1, v2 = A1 - B1, A2 - B2\nd1, d2 = v1 * T1, v2 * T2\nif d1 > 0:\n d1 *= -1\n d2 *= -1\n\nif d1 + d2 < 0:\n print(0)\nelif d1 + d2 == 0:\n print(\"infinity\")\nelif d1 + d2 > 0:\n s, t = divmod(-d1, d1+d2)\n print(2*s+(t!=0))", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author anand.oza\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n FIntervalRunning solver = new FIntervalRunning();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class FIntervalRunning {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n long[] t = in.readLongArray(2);\n long[] a = in.readLongArray(2);\n long[] b = in.readLongArray(2);\n\n long A = 0, B = 0;\n for (int i = 0; i < 2; i++) {\n A += a[i] * t[i];\n B += b[i] * t[i];\n }\n\n if (A == B) {\n out.println(\"infinity\");\n return;\n }\n\n if (A < B) {\n long tmp = A;\n A = B;\n B = tmp;\n long[] tmp2 = a;\n a = b;\n b = tmp2;\n }\n // now A eventually leaves B completely\n\n long X = t[0] * a[0];\n long Y = t[0] * b[0];\n\n if (X > Y) {\n out.println(0);\n return;\n }\n\n long D1 = Math.abs(X - Y);\n long D2 = Math.abs(A - B);\n long answer = (D1 + D2 - 1) / D2;\n answer *= 2;\n if (D1 % D2 != 0)\n answer--;\n out.println(answer);\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public long[] readLongArray(int n) {\n long[] x = new long[n];\n for (int i = 0; i < n; i++) {\n x[i] = nextLong();\n }\n return x;\n }\n\n }\n}\n\n", "import sys\nt1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nn1=(b1-a1)*t1\nn2=(b2-a2)*t2\nif n1*n2>0 or abs(n1)>abs(n2):\n print(0)\n sys.exit()\nif abs(n1)==abs(n2):\n print('infinity')\n sys.exit()\nc=abs(n1)//abs(n1+n2)\nwhile (c+1)*abs(n1+n2)<=abs(n1):\n c+=1\nans=2*c\nif abs(n1)%(abs(n1+n2))!=0:\n ans+=1\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < (int)n; i++)\nusing ll = long long;\n\nint main(){\n ll t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2;\n cin >> a1 >> a2;\n cin >> b1 >> b2;\n ll l1 = a1*t1+a2*t2, l2 = b1*t1+b2*t2;\n if(l1 == l2) {\n cout << \"infinity\" << endl;\n return 0;\n }\n if(l1 < l2) {\n swap(l1,l2); swap(a1,b1); swap(a2,b2);\n }\n if(a1 > b1) {\n cout << 0 << endl;\n return 0;\n }\n ll ans = (b1-a1)*t1/(l1-l2);\n if((b1-a1)*t1 % (l1-l2)) cout << ans*2 + 1 << endl;\n else cout << ans*2 << endl;\n return 0;\n}", "import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long T1 = sc.nextLong(), T2 = sc.nextLong();\n long A1 = sc.nextLong(), A2 = sc.nextLong();\n long B1 = sc.nextLong(), B2 = sc.nextLong();\n long D1 = A1-B1, D2 = A2-B2;\n\n /*easier problem:\n * Yoichi runs D1 m/min for T1 minutes, and then runs D2 m/min for T2 minutes.\n * How many times will Yoichi pass the start point?\n * Notice: D1 and/or D2 might be negative.\n */\n\n if(T1*D1+T2*D2==0) System.out.println(\"infinity\");\n else if((T1*D1>0)==(T1*D1+T2*D2>0)) System.out.println(0);\n else{\n if(D1>0){\n D1 *= -1;\n D2 *= -1;\n }\n //now we can assume them: D1<0, D2>0, and T1*D1+T2*D2>0.\n long cycleDistance = T1*D1+T2*D2;\n long backLimit = Math.abs(D1*T1);\n System.out.println(2 * (backLimit/cycleDistance) + (backLimit%cycleDistance==0 ? 0 : 1));\n\n }\n }\n}\n", "T1,T2=map(int, input().split())\nA1,A2=map(int, input().split())\nB1,B2=map(int, input().split())\nC1=A1*T1\nD1=A2*T2\nC2=B1*T1\nD2=B2*T2\nif (A1-B1)*(A2-B2)>0:\n print(0)\nelse:\n C=C1-C2\n D=D1-D2\n if C<0:\n C=-C\n D=-D\n E=C+D\n if E>0:\n print(0)\n elif E==0:\n print(\"infinity\")\n else:\n k=C//int(-E)\n if k==C/int(-E):\n print(2*k)\n else:\n print(2*k+1)\n ", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\tlong long T1, T2;\n\tcin >> T1 >> T2;\n\tlong long A1, A2, B1, B2;\n\tcin >> A1 >> A2 >> B1 >> B2;\n\tlong long X = (A1 - B1)*T1;\n\tlong long Y = (A2 - B2)*T2;\n\tif (X > 0) {\n\t\tX = -1 * X;\n\t\tY = -1 * Y;\n\t}\n\tif (0 == (X + Y)) {\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif (0 > (X + Y)) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tlong long ans = 0;\n\tans = (-1 * X) / (X + Y);\n\tans *= 2;\n\tif (0 == (-1*X)%(X+Y)) {\n\t\tans--;\n\t}\n\tans++;\n\tcout << ans << endl;\n\treturn 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n\tll t1,t2,a1,a2,b1,b2;\n\tcin>>t1>>t2;\n\tcin>>a1>>a2;cin>>b1>>b2;\t\n\tll x=a1*t1+a2*t2,y=b1*t1+b2*t2;\n\tif(x==y)cout<<\"infinity\"<<endl;\n\telse if((x>y&&a1<b1)||(x<y&&a1>b1)){\n\t\tll t=(a1-b1)*t1;\n\t\tll d=y-x;\n\t\tif(t%d!=0)cout<<t/d*2+1<<endl;\n\t\telse cout<<t/d*2<<endl;\n\t}\n\telse cout<<0<<endl;\n return 0;\n}", "#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint main() {\n\tunsigned long long t1, t2, a1, b1, a2, b2;\n\tcin>>t1>>t2>>a1>>a2>>b1>>b2;\n\tif (a1*t1+a2*t2 == b1*t1+b2*t2) {\n\t\tcout<<\"infinity\"<<endl;\n\t\treturn 0;\n\t}\n\tif (a1*t1+a2*t2 < b1*t1+b2*t2) {\n\t\tswap(a1, b1);\n\t\tswap(a2, b2);\n\t}\n\n\tif (a1*t1 > b1*t1) {\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\n\t// Then A1<B1 && A2>B2\n\tunsigned long long delta = a1*t1 + a2*t2 - b1*t1 - b2*t2;\n\tlong long ans = (b1*t1 - a1*t1) / delta;\n\tans = ans*2 + 1; // 1 is the first time.\n\tif ((b1*t1 - a1*t1) % delta == 0)\n\t\tans--;\n\tcout<<ans<<endl;\n\treturn 0;\n}", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\ndiff1 = (A1 - B1) * T1\ndiff2 = (A2 - B2) * T2\n\nif diff1 > 0:\n diff1, diff2 = -1 * diff1, -1 * diff2\n\nif diff1 + diff2 < 0:\n print(0)\nelif diff1 + diff2 == 0:\n print('infinity')\nelse:\n q, r = divmod(-diff1, diff1 + diff2)\n print(2*q + (1 if r != 0 else 0))", "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\nsigned main() {\n ios::sync_with_stdio(false); cin.tie(0);\n long long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n long long x = t1 * (a1 - b1);\n long long y = t2 * (a2 - b2);\n if (x + y == 0) {\n cout << \"infinity\\n\";\n return 0;\n }\n if ((__int128) x * (x + y) >= 0) {\n cout << 0 << '\\n';\n return 0;\n }\n __int128 p = abs(x);\n __int128 q = abs(x + y);\n cout << (long long) (p / q * 2) + 1 - (p % q == 0) << '\\n';\n return 0;\n}", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nx=(a1-b1)*t1\ny=(a2-b2)*t2\nif x+y==0:\n print('infinity')\nelif x*(x+y)>0:\n print(0)\nelse:\n k=x//(-x-y)\n if x%(-x-y)==0:\n print(k*2)\n else:\n print(k*2+1)", "from math import ceil\n\nT1,T2 = map(int,input().split())\nA1,A2 = map(int,input().split())\nB1,B2 = map(int,input().split())\n\na = A1-B1\nb = A2-B2\n\nd = T1*a + T2*b\n\nif d == 0:\n print('infinity')\n exit()\nif a*b > 0 or a*d > 0:\n print(0)\n exit()\n\nx = abs(T1*a)\nd = abs(d)\n\ncnt = (x+d-1)//d\nif cnt*d == x:\n cnt = 2*cnt\nelse:\n cnt = 2*cnt-1\n\nprint(cnt)", "t = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nf_a = t[0]*a[0]\nf_b = t[0]*b[0]\nif f_a < f_b:\n x = 1\nelse:\n x = -1\n\ns_a = f_a + t[1]*a[1]\ns_b = f_b + t[1]*b[1]\nif s_a < s_b:\n y = 1\nelse:\n y = -1\n\nif s_a==s_b:\n print('infinity')\nelse:\n if x==y:\n print(0)\n else: \n s = abs(f_a-f_b)\n t = abs(s_a-s_b)\n print((s//t*2)+(s%t!=0))\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=int(a);i<int(b);i++)\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n\n\nint main(){\n ll t1,t2,a1,a2,b1,b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n ll da1=t1*a1,db1=t1*b1,da2=da1+t2*a2,db2=db1+t2*b2;\n if(da2==db2){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n if((da1>db1&&da2>db2)||(da1<db1&&da2<db2)){\n cout<<0<<endl;\n return 0;\n }\n ll an=2*(abs(da1-db1)/(ll)abs(da2-db2))+1;\n if(abs(da1-db1)%(ll)abs(da2-db2)==0)an--;\n cout<<an<<endl;\n}\n\n \n\n\n\n\n\n\n\n", "#include <iostream>\n#include <map>\nusing namespace std;\n\nint main() {\n using Int = long long;\n \n Int t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n \n Int d1 = t1 * (b1 - a1);\n Int d2 = t2 * (b2 - a2);\n \n if (d1 + d2 == 0) {\n cout << \"infinity\" << endl;\n return 0;\n }\n \n if (d1 < 0) {\n d1 *= -1;\n d2 *= -1;\n }\n \n if (d1 + d2 > 0) {\n cout << 0 << endl;\n return 0;\n }\n \n Int m = -(d1 + d2);\n \n if (d1 % m == 0) {\n cout << 2 * (d1 / m) << endl;\n } else {\n cout << 2 * (d1 / m) + 1 << endl;\n }\n}", "def main():\n t1, t2 = map(int, raw_input().split())\n a1, a2 = map(int, raw_input().split())\n b1, b2 = map(int, raw_input().split())\n ax1 = t1 * a1\n bx1 = t1 * b1\n ax2 = t2 * a2\n bx2 = t2 * b2\n if ax1 + ax2 == bx1 + bx2:\n print 'infinity'\n return\n if ax1 + ax2 < bx1 + bx2:\n ax1, bx1 = bx1, ax1\n ax2, bx2 = bx2, ax2\n init_d = bx1 - ax1\n if init_d < 0:\n print 0\n return\n total_delta = ax1 + ax2 - bx1 - bx2\n ans = 1 + (init_d / total_delta) * 2\n if init_d % total_delta == 0:\n ans -= 1\n print ans\n\nmain()\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nfrom math import *\n\nx = A1*T1 + A2*T2 - (B1*T1 + B2*T2)\ny = A1*T1 - B1*T1\nif(x ==0 or y==0):\n print('infinity')\nelif(y * x > 0):\n print(0)\nelse:\n z = floor(abs(y) / abs(x))\n if abs(y) == z * abs(x):\n print(floor(abs(y)/abs(x))*2)\n else:\n print(floor(abs(y)/abs(x))*2+1)\n\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tstatic PrintWriter out;\n\tstatic InputReader ir;\n\n\tstatic void solve() {\n\t\tint[] t = ir.nextIntArray(2);\n\t\tlong[] a = ir.nextLongArray(2);\n\t\tlong[] b = ir.nextLongArray(2);\n\t\tif (a[0] == b[0]) {\n\t\t\tout.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif (a[0] * t[0] + a[1] * t[1] == b[0] * t[0] + b[1] * t[1]) {\n\t\t\tout.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif (a[0] < b[0]) {\n\t\t\tlong tmp = a[0];\n\t\t\ta[0] = b[0];\n\t\t\tb[0] = tmp;\n\t\t\ttmp = a[1];\n\t\t\ta[1] = b[1];\n\t\t\tb[1] = tmp;\n\t\t}\n\t\tif (a[0] * t[0] + a[1] * t[1] > b[0] * t[0] + b[1] * t[1]) {\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong d = b[0] * t[0] + b[1] * t[1] - (a[0] * t[0] + a[1] * t[1]);\n\t\tlong res = ((a[0] - b[0]) * t[0]) / d + ((b[1] - a[1]) * t[1]) / d;\n\t\tif (((b[1] - a[1]) * t[1]) % d == 0)\n\t\t\tres--;\n\t\tout.println(res);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tir = new InputReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\tstatic class InputReader {\n\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n\n\tstatic void tr(Object... o) {\n\t\tout.println(Arrays.deepToString(o));\n\t\tout.flush();\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int64_t T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n if(A1 < B1){\n swap(A1, B1);\n swap(A2, B2);\n }\n int64_t d1 = T1*(A1-B1);\n int64_t d2 = T2*(A2-B2);\n int64_t d = d1 + d2;\n if(d > 0){\n cout << 0 << endl;\n return 0;\n }\n if(d == 0){\n cout << \"infinity\" << endl;\n return 0;\n }\n\n int64_t c1 = d1 / abs(d);\n int64_t ans = 2*c1 + (d1%abs(d) > 0);\n cout << ans << endl;\n return 0;\n}\n", "#include <iostream>\n#include <algorithm>\ntypedef long long ll;\nusing namespace std;\n\nint main() {\n\tll T1, T2, A1, A2, B1, B2;\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\tif(A1*T1+A2*T2==B1*T1+B2*T2){\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif(A1*T1+A2*T2>B1*T1+B2*T2){\n\t\tswap(A1, B1);\n\t\tswap(A2, B2);\n\t}\n\tif(A1<B1){\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tll d=(B1*T1+B2*T2)-(A1*T1+A2*T2);\n\tll f=((A1-B1)*T1+d-1)/d;\n\tif(((A1-B1)*T1)%d==0) cout << f*2 << endl;\n\telse cout << f*2-1 << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\nconst int mod = 1e9 + 7;\n\nint main() {\n long long t1, t2, a1, a2, b1, b2, ma, mb;\n cin >> t1 >> t2;\n cin >> a1 >> a2;\n cin >> b1 >> b2;\n if (a1 < b1) {\n swap(a1, b1);\n swap(a2, b2);\n }\n ma = a1 * t1 + a2 * t2;\n mb = b1 * t1 + b2 * t2;\n if (ma == mb) {\n cout << \"infinity\\n\";\n } else if (ma > mb) {\n cout << \"0\\n\";\n } else {\n long long l = (a1 - b1) * t1, r = mb - ma;\n cout << (l / r) * 2 + ((l % r) != 0 ? 1 : 0) << '\\n';\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n\tlong long T1, T2, A1, A2, B1, B2;\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\tlong long x = T1 * (A1-B1);\n\tlong long y = T2 * (A2-B2) + x;\n\tif (y == 0) {\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif (y < 0) {\n\t\tx = -x;\n\t\ty = -y;\n\t}\n\tif (x >= 0) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tlong long r = 1 + (-x / y) * 2;\n\tif (-x % y == 0) -- r;\n\tcout << r << endl;\n\t//cerr << x << endl;\n\t//cerr << y << endl;\n}\n", "t1,t2 = [int(i) for i in input().split()]\na1,a2 = [int(i) for i in input().split()]\nb1,b2 = [int(i) for i in input().split()]\n\nc1,c2 = (a1-b1)*t1,(a2-b2)*t2\n\nif c1 < 0:\n c1 *= -1\n c2 *= -1\n\nif c1 + c2 == 0:\n print('infinity')\nelif c1 + c2 > 0:\n print(0)\nelse:\n num = -c1 // (c1 + c2)\n print(num * 2 if -c1 % (c1 + c2) == 0 else num * 2 + 1)\n ", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tboolean in = false;\n\t\t\n\t\tlong t1,t2,a1,a2,b1,b2, f1, f2;\n\t\tif(!in)\n\t\t{\n\t\t\tt1 = sc.nextLong();\n\t\t\tt2 = sc.nextLong();\n\t\t\ta1 = sc.nextLong();\n\t\t\tb1 = sc.nextLong();\n\t\t\ta2 = sc.nextLong();\n\t\t\tb2 = sc.nextLong();\n\t\t\tf1 = (a1-a2)*t1;\n\t\t\tf2 = (b2-b1)*t2;\n//\t\t\tSystem.out.println(a1 + \" \" + a2);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tlong sf1 = sc.nextLong();\n\t\t\tlong sf2 = sc.nextLong();\n\t\t\tf1 = sf1;\n\t\t\tf2 = sf2;\n\t\t}\n\t\t\n\t\tif(f1 < 0)\n\t\t{\n\t\t\tf1 *= -1;\n\t\t\tf2 *= -1;\n\t\t}\n\t\t\n\t\tlong dis = f1;\n\t\tlong bf = f2-f1;\n//\t\tSystem.out.println(f1 + \" \" + f2 + \" \" + bf);\n\t\t\n\t\tif(f1 == f2)\n\t\t{\n\t\t\tSystem.out.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tlong score = 0;\n\t\tif(dis > bf && bf > 0)\n\t\t{\n\t\t\tscore += (dis/bf)*2;\n\t\t\tdis = dis%bf;\n\t\t}\n\t\tif(dis > 0 && bf > 0)\n\t\t\tscore++;\n\t\t\n\t\tSystem.out.println(score);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (int)(n); ++i)\n#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)\n\nint main() {\n int mod=1000000007;\n long t1,t2,a1,a2,b1,b2;\n cin >> t1>>t2>>a1>>a2>>b1>>b2;\n long k=t1*a1;\n long m=t1*b1;\n long l=k+t2*a2;\n long n=m+t2*b2;\n if((m-k>0&&n-l>0)||(m-k<0&&n-l<0)){\n cout<<0<<endl;\n }\n else if(n-l==0){\n cout<<\"infinity\"<<endl;\n }\n else{\n if(abs(m-k)%abs(n-l)==0){\n cout<<abs(m-k)/abs(n-l)*2<<endl;\n }\n else{\n cout<<abs(m-k)/abs(n-l)*2+1<<endl;\n }\n }\n\n}", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Silviase\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n FMitsui solver = new FMitsui();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class FMitsui {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n long t1 = in.nextLong();\n long t2 = in.nextLong();\n long a1 = in.nextLong();\n long a2 = in.nextLong();\n long b1 = in.nextLong();\n long b2 = in.nextLong();\n long suma1 = a1 * t1;\n long suma2 = a2 * t2;\n long sumb1 = b1 * t1;\n long sumb2 = b2 * t2;\n long asum = suma1 + suma2;\n long bsum = sumb1 + sumb2;\n if (asum > bsum) {\n if (suma1 > sumb1) {\n out.println(\"0\");\n } else {\n long dif = asum - bsum;\n long tmpdif = sumb1 - suma1;\n if (tmpdif % dif == 0) {\n out.println(tmpdif / dif * 2);\n } else {\n out.println(tmpdif / dif * 2 + 1);\n }\n }\n }\n if (asum < bsum) {\n if (suma1 < sumb1) {\n out.println(\"0\");\n } else {\n // a1 > b1 && a2 < b2\n long diff = bsum - asum;\n long tmpdiff = suma1 - sumb1;\n if (tmpdiff % diff == 0) {\n out.println(tmpdiff / diff * 2);\n } else {\n out.println(tmpdiff / diff * 2 + 1);\n }\n }\n }\n if (asum == bsum) {\n out.println(\"infinity\");\n }\n }\n\n }\n}\n\n", "// F.\n\n#include <iostream>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long LL;\n\nint main(int argc, char* argv[]) {\n\tcout.precision(20);\n#ifdef _MSC_VER\n\twhile (true)\n#endif\n\t{\n\t\tLL t1 = -1, t2, a1, a2, b1, b2;\n\t\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\t\tif (t1 < 0) return 0;\n\t\tLL p = (a1 - b1) * t1, q = (a2 - b2) * t2;\n\t\tif (p < 0) {\n\t\t\tp = -p, q = -q;\n\t\t}\n\t\tif (p + q == 0) {\n\t\t\tcout << \"infinity\" << endl;\n\t\t} else {\n\t\t\tLL ans = 0;\n\t\t\tif (p + q < 0) {\n\t\t\t\tLL r = p / -(p + q), s = p % -(p + q);\n\t\t\t\tans = r * 2 + (s != 0);\n\t\t\t}\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n\n int t1,t2;\n ll a1,b1,a2,b2;\n cin>>t1>>t2;\n cin>>a1>>a2>>b1>>b2;\n if(a1<b1) swap(a1,b1),swap(a2,b2);\n\n ll s1=t1*a1+t2*a2;\n ll s2=t1*b1+t2*b2;\n if(s1==s2){\n printf(\"infinity\\n\");\n return 0;\n }\n if(s1>s2){\n printf(\"0\\n\");\n return 0;\n }\n ll len=t1*(a1-b1);\n ll d=s2-s1;\n\n ll ans=1+2*(len/d)-(len%d==0);\n printf(\"%lld\\n\", ans);\n\n return 0;\n}", "T1, T2 = list(map(int, input().split()))\nA1, A2 = list(map(int, input().split()))\nB1, B2 = list(map(int, input().split()))\n\na = (A1-B1)*T1\nb = (A2-B2)*T2\n\nif a<0:\n a,b = -a,-b\n \n#print(a,b)\n \nif a+b>0:\n print(0)\n\nelif a+b ==0:\n print('infinity')\n\nelif a+b<0:\n #print(a//(-b-a),a%(-b-a))\n print(2 *(a//(-b-a)) + bool(a%(-b-a)))\n ", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n int t1,t2;\n ll a1,a2,b1,b2;\n cin >> t1 >> t2;\n cin >> a1 >> a2;\n cin >> b1 >> b2;\n\n a1=a1*t1;\n a2=a2*t2;\n b1=b1*t1;\n b2=b2*t2;\n if(a1+a2<b1+b2){\n swap(a1,b1);\n swap(a2,b2);\n }\n if(a1+a2==b1+b2){\n cout << \"infinity\" << endl;\n return 0;\n }else{\n if(a1>b1){\n cout << \"0\" << endl;\n return 0;\n }else{\n ll c=b1-a1;\n ll d=(a1+a2)-(b1+b2);\n ll ans;\n if(c%d==0) ans=c/d*2;\n else ans=c/d*2+1;\n\n cout << ans << endl;\n }\n }\n return 0;\n}\n", "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(10 ** 7)\n\nt1, t2, a1, a2, b1, b2 = map(int, read().split())\nv1 = t1 * (a1 - b1)\nv2 = t2 * (a2 - b2)\nif v1 > 0:\n v1 *= -1\n v2 *= -1\nif v1 + v2 == 0:\n print('infinity')\nelif v1 + v2 < 0:\n print(0)\nelse:\n s, t = divmod(-v1, v1 + v2)\n ans = s * 2\n if t != 0:\n ans += 1\n print(ans)\n", "T = [int(t) for t in input().split()]\nA = [int(t) for t in input().split()]\nB = [int(t) for t in input().split()]\n\nd1 = T[0]*(A[0]-B[0])\nd2 = d1 + T[1]*(A[1]-B[1])\n\nif d2 == 0:\n ans = \"infinity\"\nelif d1 > 0 and d2 > 0:\n ans = 0\nelif d1 < 0 and d2 < 0:\n ans = 0\nelse:\n d1 = abs(d1)\n d2 = abs(d2)\n ans = d1 // d2 * 2\n if d1%d2 != 0:\n ans += 1 \n \n \nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main()\n{\n\tll T1, T2;\n\tll A1, A2;\n\tll B1, B2;\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\tA1 *= T1;\n\tA2 *= T2;\n\tB1 *= T1;\n\tB2 *= T2;\n\tif (A1 + A2 == B1 + B2) {\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif (A1 < B1 && A1 + A2 < B1 + B2) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tif (A1 > B1 && A1 + A2 > B1 + B2) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tif (A1 > B1) swap(A1, B1), swap(A2, B2);\n\tll d = (A1 + A2) - (B1 + B2);\n\tcout << ((B1 - A1) / d * 2 + ((B1 - A1) % d != 0)) << endl;\n\treturn 0;\n}\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nif a1 < b1:\n a1,a2,b1,b2 = b1,b2,a1,a2\nif a1*t1+a2*t2 == b1*t1+b2*t2:\n print(\"infinity\")\n exit()\nelif a1*t1+a2*t2 > b1*t1+b2*t2:\n print(0)\n exit()\n\nq = a1*t1-b1*t1\nw = (b1*t1+b2*t2) - (a1*t1+a2*t2)\nwe = int(q/w)\ne = we*2-1\nif q%w:\n e+=2\nelse:\n e+=1\nprint(e)", "import math\nt1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\n#相対速度\nc1,c2=a1-b1,a2-b2\n#離れる距離\nd1,d2=abs(c1*t1),-abs(c2*t2)\n\nif (c1>0 and c2>0) or (c1<0 and c2<0) or d1+d2>0:\n print(0)\nelif d1+d2==0:\n print(\"infinity\")\nelse:\n x=d1//(-(d1+d2))\n y=d1%(-(d1+d2))\n if y==0:\n print(2*x)\n else:\n print(2*x+1)\n", "import sys\n\nt1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\np1 = (b1 - a1) * t1\np2 = (b2 - a2) * t2\n\nif p1 + p2 == 0:\n print('infinity')\n sys.exit()\n\nif p1 + p2 < 0:\n p1 *= -1\n p2 *= -1\n\nif p1 > 0:\n print(0)\n sys.exit()\n\nans = int((-1 * p1) / (p1+p2)) * 2 + 1\n\nif (-1 * p1) % (p1+p2) == 0:\n ans -= 1\n\nprint(ans)\n", "t1,t2 = list(map(int, input().split()))\na1,a2 = list(map(int, input().split()))\nb1,b2 = list(map(int, input().split()))\n\nptr1 = (b1 - a1) * t1\nptr2 = ptr1 + (b2 - a2) * t2\nptr3 = ptr2 + (b1 - a1) * t1\nptr4 = ptr3 + (b2 - a2) * t2\n\nif ptr2 == 0:\n ans = 'infinity'\nelif ptr1 * ptr2 > 0:\n ans = 0\nelse:\n ans = 1 + 2 * (abs(ptr1) // abs(ptr2))\n if abs(ptr1) % abs(ptr2) == 0:\n ans -= 1\n\nprint(ans)", "#include <cstdio>\n#include <algorithm>\nusing namespace std;\nlong long t1,t2;\nlong long a1,a2;\nlong long b1,b2;\n\nint main(){\n scanf(\"%lld%lld%lld%lld%lld%lld\",&t1,&t2,&a1,&a2,&b1,&b2);\n \n if (t1*a1+t2*a2==t1*b1+t2*b2){\n printf(\"infinity\\n\");\n return 0;\n }\n \n if (t1*a1+t2*a2<t1*b1+t2*b2){\n swap(a1,b1);\n swap(a2,b2);\n }\n \n if (a1>b1){\n printf(\"0\\n\");\n return 0;\n }\n \n long long q1=t1*(b1-a1),q2=(t1*a1+t2*a2)-(t1*b1+t2*b2);\n //printf(\"%lld %lld\\n\",q1,q2);\n long long ans=q1/q2;\n ans*=2;\n if (q1%q2!=0) ans++;\n printf(\"%lld\\n\",ans);\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n\nint main(){\n ll T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n ll alpha = T1*(A1-B1) + T2*(A2-B2);\n ll beta = T2*(A2-B2);\n\n if(alpha == 0){\n cout << \"infinity\" << endl;\n }else{\n ll ans = max(0ll, beta/alpha) + max(0ll, ll(1.0*beta/alpha-1));\n if(beta%alpha==0) ans--; \n cout << max(0ll, ans) << endl;\n }\n}", "list1 = list(map(int, input().split()))\nlist2 = list(map(int, input().split()))\nlist3 = list(map(int, input().split()))\nx=list1[0]\ny=list1[1]\na=list2[0]\nb=list2[1]\nc=list3[0]\nd=list3[1]\nif a * x + b * y == c * x + d * y:\n print(\"infinity\")\nelse:\n if a * x + b * y < c * x + d * y:\n a,c=c,a\n b,d=d,b\n t = a * x + b * y - (c * x + d * y)\n if a>c:\n print(0)\n else:\n k=x*(c-a)\n if k%t==0:\n print((k//t)*2)\n else:\n print((k//t)*2+1)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long t1,t2,a1,a2,b1,b2;cin>>t1>>t2>>a1>>a2>>b1>>b2;\n long long x = a1*t1+a2*t2,y=b1*t1+b2*t2;\n \n if(x==y){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n //long long r = t1*a1-t1*b1;\n if((x>y&&a1<b1)||(x<y&&a1>b1)){\n long long A = (a1-b1)*t1;\n long long B = y-x;\n long long n=A/B;\n n*=2;\n if(A%B==0)n--;\n cout<<1+n<<endl;\n return 0;\n }\n cout<<0<<endl;\n return 0;\n}", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nX1 = T1 * (A1 - B1)\nX2 = T2 * (A2 - B2)\n\nD = X1 + X2\nif D == 0:\n\tprint(\"infinity\")\nelse:\n\tif X1 < 0:\n\t\tX1, X2 = [-X1, -X2]\n\telse:\n\t\tD = -D\n\t\n\tif D < 0:\n\t\tprint(\"0\")\n\telse:\n\t\tif X1 % D == 0:\n\t\t\tprint((X1 // D) * 2)\n\t\telse:\n\t\t\tprint((X1 // D) * 2 + 1)\n\t\n\n", "T1, T2=map(int,input().split())\nA1, A2=map(int,input().split())\nB1, B2=map(int,input().split())\n\nif A1 - B1 > 0:\n A1, B1 = B1, A1\n A2, B2 = B2, A2\n \nd = (A1 - B1) * T1 + (A2 - B2) * T2\n\nif d > 0:\n if ((B1 - A1) * T1) % d == 0:\n print(((B1 - A1) * T1 // d) * 2)\n else:\n print(((B1 - A1) * T1 // d) * 2 + 1)\nelif d < 0:\n print(0)\nelse:\n print(\"infinity\")", "import java.util.*;\nimport java.util.Map.Entry;\n\nimport javax.swing.text.Segment;\nimport javax.xml.ws.WebEndpoint;\n\nimport java.io.*;\nimport java.lang.reflect.Array;\nimport java.math.BigInteger;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n \npublic class Main //implements Runnable\n{\n// static int dx[]={-1,0,1,0};\n// static int dy[]={0,-1,0,1};\n\tstatic double s;\n\t\n public static void main(String[] args) throws Exception, IOException{ \n// long mod=1000000007;\n Reader sc = new Reader(System.in);\n PrintWriter out=new PrintWriter(System.out);\n\n// int n=sc.nextInt();\n long t=sc.nextLong();\n long tt=sc.nextLong();\n long a=sc.nextLong();\n long aa=sc.nextLong();\n long b=sc.nextLong();\n long bb=sc.nextLong();\n long s=(b-a)*t+(bb-aa)*tt;\n if(t*a+tt*aa==t*b+tt*bb) {\n \tret(\"infinity\");\n }\n long r=0,rr;\n r=t*(a-b)/s;\n if(r<0)r=0;\n\n rr=(tt*(aa-bb)+t*(a-b))/s;\n if(rr<0) {\n \trr=t*(a-b)/s;\n \tif(rr<0)rr=0;\n \telse rr=(long)ceil((double)t*(a-b)/s);\n }\n \n out.println(r+rr);\n \tout.flush();\n }\n\n\n static void ret(String ans) {\n \tSystem.out.println(ans);\n \tSystem.exit(0);\n }\n \n static boolean validpos(int x,int y,int r, int c){\n return x<r && 0<=x && y<c && 0<=y;\n }\n\n static void db(Object... os){\n System.err.println(Arrays.deepToString(os));\n }\n}\n\n//\n//class P {\n//\tint x, y, d;\n//\tP(int x, int y, int d) {\n//\t this.x=x;\n//\t this.y=y;\n//\t this.d=d;\n//\t}\n//}\n\nclass P implements Comparable<P>{\n int a,b;\n P(int a, int b) {\n \tthis.b=b;\n \tthis.a=a;\n }\n\n public int compareTo(P p){\n return -p.a+a;//as\n }\n}\n\nclass Reader\n{ \n private BufferedReader x;\n private StringTokenizer st;\n \n public Reader(InputStream in)\n {\n x = new BufferedReader(new InputStreamReader(in));\n st = null;\n }\n public String nextString() throws IOException\n {\n while( st==null || !st.hasMoreTokens() )\n st = new StringTokenizer(x.readLine());\n return st.nextToken();\n }\n public int nextInt() throws IOException\n {\n return Integer.parseInt(nextString());\n }\n public int[] nextIntArray(int size) throws IOException{\n int r[] = new int[size];\n for (int i = 0; i < size; i++) {\n r[i] = this.nextInt(); \n }\n return r;\n }\n public long[] nextLongArray(int size) throws IOException{\n long r[] = new long[size];\n for (int i = 0; i < size; i++) {\n r[i] = this.nextLong(); \n }\n return r;\n }\n public char[] getCharSet() throws IOException{\n return this.nextString().toCharArray();\n } \n public long nextLong() throws IOException\n {\n return Long.parseLong(nextString());\n }\n public double nextDouble() throws IOException\n {\n return Double.parseDouble(nextString());\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long t1,t2;\n cin >> t1 >> t2;\n long long a1,a2,b1,b2;\n cin >> a1 >> a2 >> b1 >> b2;\n long long p,q;\n if(a1>b1) {\n p=t1*(a1-b1);\n q=t2*(a2-b2);\n }\n else {\n p=t1*(b1-a1);\n q=t2*(b2-a2);\n }\n if(p+q==0) {\n cout << \"infinity\" << endl;\n }\n else if(p+q>0) {\n cout << 0 << endl;\n }\n else {\n long long ans=2*(p/(-(p+q)));\n if(p%(-(p+q))!=0) {\n ans++;\n }\n cout << ans << endl;\n }\n}", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\nc1,c2 = b1-a1,b2-a2\nd = t1*c1 + t2*c2\nif d == 0:\n print('infinity')\nelif c1 * c2 > 0:\n print(0)\nelse:\n if c1 < 0:\n c1 *= -1 \n c2 *= -1\n d *= -1\n top = c1 * t1\n d = -d\n #print(top,d)\n if d < 0:\n print(0)\n elif top % d != 0:\n print(top//d*2+1)\n else:\n print(top//d*2)", "import math\nt1,t2 = map(int, input().split())\nc1,c2 = map(int, input().split())\nd1,d2 = map(int, input().split())\n\nx = [(c1*t1, c2*t2),(d1*t1, d2*t2)]\n\nx.sort(reverse=True)\n\nif x[0][0]+x[0][1] == x[1][0]+x[1][1]:\n print(\"infinity\")\nelif x[0][0]+x[0][1] > x[1][0]+x[1][1]:\n print(0)\nelse:\n n = (x[0][0]-x[1][0]+0.0)/(x[1][0]+x[1][1]-x[0][0]-x[0][1])\n m = math.ceil(n)\n if math.floor(n) == m:\n print(2*m)\n else:\n print(2*m-1)", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nc1,c2=a1-b1,a2-b2\nif t1*c1+t2*c2==0:\n print('infinity')\nelse:\n # t1+t2でどれだけ二人が離れるか。\n d=t1*c1+t2*c2\n if c2*d<0:\n print(0)\n elif abs(t2*c2)<abs(d):\n print(0)\n else:\n tmp=((t2*c2)//d)\n if (t2*c2)%d==0:\n print(2*tmp-2)\n else:\n print(2*tmp-1)\n", "#include <bits/stdc++.h>\n#define MAX (ll)(1e5 + 4)\n#define MOD (ll)(1e9 + 7)\n#define INF (ll)(1e18 + 3)\n#define PI (double)(3.14159265)\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n\nint main () {\n\tll t1, t2, a1, a2, b1, b2;\n\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\tll s = (a1 - b1) * t1, ss = (a2 - b2) * t2;\n\tif (s + ss == 0) {\n\t\tcout << \"infinity\\n\";\n\t\treturn 0;\n\t}\n\tif (((s < 0 && ss > 0) || (ss < 0 && s > 0)) && abs (ss) > abs (s)) {\n\t\tss = abs (ss), s = abs (s);\n\t\tll d = abs (ss) - abs (s);\n\t\tcout << 2 * (s / d) + ((s % d) > 0) << \"\\n\";\n\t}\n\telse {\n\t\tcout << \"0\\n\";\n\t}\n}\n", "t=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nif a[0]>b[0]:\n a,b=b,a\np=t[0]*(a[0]-b[0])\nq=t[1]*(a[1]-b[1])\nif p+q==0:\n print('infinity')\nelif p+q<0:\n print(0)\nelse:\n k=-p//(p+q)\n if -p%(p+q)==0:\n print(2*k)\n else:\n print(2*k+1)\n", "t1,t2=map(int, input().split())\na1,a2=map(int, input().split())\nb1,b2=map(int, input().split())\na1*=t1\na2*=t2\nb1*=t1\nb2*=t2\nif a1<b1:\n a1,a2,b1,b2=b1,b2,a1,a2\n#a1>b2\nif a1+a2==b1+b2:\n print('infinity')\n exit()\n\na1-=b1;b2-=a2\n\nb2-=a1\nif b2<0:\n print(0)\n exit()\n\nans=1+(a1//b2)*2\nif a1%b2==0:\n ans-=1####\n\nprint(ans)", "T1,T2 = map(int,input().split())\nA1,A2 = map(int,input().split())\nB1,B2 = map(int,input().split())\n\ndis1 = (A1 - B1) * T1\ndis2 = (A2 - B2) * T2\n\nif dis1 > 0:\n dis1 = -dis1\n dis2 = -dis2\n\nif dis1 + dis2 <0:\n print(0)\n\nelif dis1 == -dis2:\n print(\"infinity\")\n \nelse:\n S = dis1//(dis1+dis2)\n R = dis1%(dis1+dis2) \n if R == 0:\n ans = S*2 \n else:\n ans = S*2 + 1\n \n print(abs(ans))\n ", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nave_a = t1 * a1 + t2 * a2\nave_b = t1 * b1 + t2 * b2\nif ave_a < ave_b:\n (a1, a2), (b1, b2) = (b1, b2), (a1, a2)\n ave_a, ave_b = ave_b, ave_a\n\nif ave_a == ave_b:\n print('infinity')\n exit()\n\nhalf, all = t1 * (b1 - a1), ave_a - ave_b\nans = half // all * 2 + (half % all != 0)\nprint(max(0, ans))\n", "#include<bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long int ll;\n\nint main(){\n ios_base::sync_with_stdio(false);\n cin.tie(0);cout.tie(0);\n\n ll t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\n ll p = (b1 - a1) * t1, q = (b2 - a2) * t2;\n\n if(p + q == 0){\n cout << \"infinity\" << endl;\n return 0;\n }\n ll shift = p + q;\n if((p > 0 && shift < 0) || (p < 0 && shift > 0)){\n ll k = p / shift;\n k = abs(k);\n ll ans = 2 * k + 1;\n if(abs(k * shift) == abs(p)) ans--;\n cout << ans << endl;\n }else{\n cout << 0 << endl;\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\nll ans = 0;\n\nint main()\n{\nll t1 , t2 ;\ncin >> t1 >> t2 ;\nll a1 , a2 ;\ncin >> a1 >> a2 ;\nll b1 , b2 ;\ncin >> b1 >> b2 ;\nif(a1<b1){\n swap(a1,b1);\n swap(a2,b2);\n}\nif(a1*t1+a2*t2>b1*t1+b2*t2){\n cout << 0 << endl;\n return 0;\n}\nif(a1*t1+a2*t2==b1*t1+b2*t2){\n cout << \"infinity\" << endl;\n return 0;\n}\nll cal=a1*t1-b1*t1;\nll cal2=b1*t1+b2*t2-a1*t1-a2*t2;\nll k=cal/cal2;\nans=1+k*2;\nif(cal%cal2==0)ans--;\ncout << ans << endl;\nreturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n\tcin.tie(0);\t\n\tcout.tie(0);\t\n\tios_base::sync_with_stdio(0);\n\tll ta,tb,af,ab,bf,bb;\n\tcin >> ta >> tb >> af >> ab >> bf >> bb;\n\taf *= ta;\n\tbf *= ta;\n\tab *= tb;\n\tbb *= tb;\n\tif(af + ab == bf + bb){\n\t\tcout << \"infinity\" << '\\n';\n\t}\n\telse{\n\t\tif(af + ab > bf + bb){\n\t\t\tswap(af,bf);\n\t\t\tswap(ab,bb);\n\t\t}\n\t\tif(af < bf){\n\t\t\tcout << 0 << '\\n';\n\t\t}\n\t\telse{\n\t\t\tll k = (af-bf)/(bf + bb - af - ab);\n\t\t\tll cor = k * (bf + bb - af - ab) == af - bf;\n\t\t\tcout << 2*(k + 1) - 1 - cor << '\\n'; \n\t\t}\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong t1,t2,a1,a2,b1,b2,ans=0;\n\n\nint main() {\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n if(a1>b1) {\n swap(a1,b1);\n swap(a2,b2);\n }\n if((t1*a1)+(t2*a2)>(t1*b1)+(t2*b2)) {\n ans=((b1-a1)*t1)/((a1-b1)*t1+(a2-b2)*t2)*2;\n if(((b1-a1)*t1)%((a1-b1)*t1+(a2-b2)*t2)!=0) ans++;\n }\n if((t1*a1)+(t2*a2)==(t1*b1)+(t2*b2)) {\n ans=-1;\n }\n if(ans>=0) cout << ans << endl;\n else cout << \"infinity\" << endl;\n}", "t1, t2 = (int(x) for x in input().split())\na1, a2 = (int(x) for x in input().split())\nb1, b2 = (int(x) for x in input().split())\n\nif a1 < b1:\n a1, b1 = b1, a1\n a2, b2 = b2, a2\n\nif a1 * t1 + a2 * t2 > b1 * t1 + b2 * t2:\n print(0)\n exit()\nelif a1 * t1 + a2 * t2 == b1 * t1 + b2 * t2:\n print(\"infinity\")\n exit()\n\nd1 = (a1 - b1) * t1\nd2 = (b2 - a2) * t2\nk = d1 // (d2 - d1)\nif d1 % (d2 - d1) == 0:\n print(2 * k)\nelse:\n print(2 * k + 1)\n", "\n#include <iostream>\n\n\nusing namespace std;\n\n\nint T1, T2;\nlong long A1, A2, B1, B2;\n\n\n\nint main()\n{\n\n\tcin >> T1;\n\tcin >> T2;\n\tcin >> A1;\n\tcin >> A2;\n\tcin >> B1;\n\tcin >> B2;\n\n\n\tlong long C1 = A1 - B1;\n\tlong long C2 = A2 - B2;\n\n\tlong long tx = C1 * T1;\n\tlong long bx = tx + C2 * T2;\n\n\tif (bx == 0) {\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\n\tif ( !((tx > 0) ^ (bx > 0))) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\n\tlong long int ans = ((-tx) / bx) * 2 + 1;\n \n\tif ((-tx) % bx == 0) { ans--; }\n\n\tcout << ans << endl;\n\n\treturn 0;\n\n\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nint64_t T1,T2,A1,A2,B1,B2;\n cin>>T1>>T2>>A1>>A2>>B1>>B2;\n int64_t A=A1-B1;\n int64_t B=A2-B2;\n if((0<A&&0<B)||(A<0&&B<0))\n cout<<0<<endl;\n else if(A*T1+B*T2==0)\n cout<<\"infinity\"<<endl;\n else{\n if((0<A&&0<A*T1+B*T2)||(A<0&&A*T1+B*T2<0))\n cout<<0<<endl;\n else{\n int64_t a=abs(A*T1);\n int64_t b=abs(A*T1+B*T2);\n if(a%b==0)\n cout<<2*(a/b)<<endl;\n else\n cout<<2*(a/b)+1<<endl;\n \n \n }\n \n \n \n }\n return 0;\n}\n", "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n static long mod = (int)Math.pow(10,9)+7;\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tlong t1 = sc.nextLong();\n\t\tlong t2 = sc.nextLong();\n\t\tlong a1 = sc.nextLong();\n\t\tlong a2 = sc.nextLong();\n\t\tlong b1 = sc.nextLong();\n\t\tlong b2 = sc.nextLong();\n\t\tlong p = (a1-b1)*t1;\n\t\tlong q = (a2-b2)*t2;\n\t\tif(p < 0){\n\t\t if(p+q < 0){\n\t\t pw.println(0);\n\t\t }else if(p+q == 0){\n\t\t pw.println(\"infinity\");\n\t\t }else{\n\t\t long ans = (-p/(p+q))*2;\n\t\t if(-p%(p+q) != 0) ans++;\n\t\t pw.println(ans);\n\t\t }\n\t\t}else{\n\t\t if(p+q > 0){\n\t\t pw.println(0);\n\t\t }else if(p+q == 0){\n\t\t pw.println(\"infinity\");\n\t\t }else{\n\t\t long ans = (-p/(p+q))*2;\n\t\t if(-p%(p+q) != 0) ans++;\n\t\t pw.println(ans);\n\t\t }\n\t\t}\n\t\tpw.close();\n\t}\n}\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n } \n}\n\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n long long T[2], A[2], B[2];\n cin >> T[0] >> T[1] >> A[0] >> A[1] >> B[0] >> B[1];\n for(int i = 0; i < 2; ++i){\n B[i] -= A[i];\n A[i] = 0;\n }\n if(T[0]*B[0]+T[1]*B[1] == 0){\n puts(\"infinity\");\n return 0;\n }\n if(B[0] < 0) B[0] *= -1, B[1] *= -1;\n long long t = -(T[0]*B[0]+T[1]*B[1]);\n if(t < 0){\n cout << 0 << endl;\n return 0;\n }\n long long ans = 2*(T[0]*B[0]/t);\n if((B[0]*T[0])%t){\n ++ans;\n }\n cout << ans << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int64_t T1,T2,A1,A2,B1,B2;\n cin>>T1>>T2>>A1>>A2>>B1>>B2;\n if(T1*A1+T2*A2==T1*B1+T2*B2){\n cout<<\"infinity\"<<endl;\n }\n else{\n if(T1*A1+T2*A2<T1*B1+T2*B2){\n swap(A1,B1);\n swap(A2,B2);\n }\n if(A1>B1){\n cout<<\"0\"<<endl;\n }\n else{\n int64_t D=T1*A1+T2*A2-(T1*B1+T2*B2);\n int64_t C=T1*(B1-A1);\n if(C%D){\n cout<<(C/D)*2+1<<endl;\n }\n else{\n cout<<(C/D)*2<<endl;\n }\n }\n }\n}", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\nimport math\nf = (a1-b1)*t1\ns = (a2-b2)*t2\nif f == -s:\n print(\"infinity\")\nelif (f>0 and f+s>0) or (f<0 and f+s<0):\n print(0)\nelif f//(-(f+s)) == math.ceil(f/(-(f+s))):\n print(f//(-(f+s))*2)\nelse:\n print(f//(-(f+s))*2+1)", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n if (A1 == B1 || T1 * A1 + T2 * A2 == T1 * B1 + T2 * B2) {\n cout << \"infinity\" << endl;\n return 0;\n }\n\n if (T1 * A1 + T2 * A2 <= T1 * B1 + T2 * B2) {\n swap(A1, B1);\n swap(A2, B2);\n }\n\n if (B1 > A1) {\n ll m = T1 * (B1 - A1);\n cout << (m / (T1 * (A1 - B1) + T2 * (A2 - B2))) * 2 +\n (m % (T1 * (A1 - B1) + T2 * (A2 - B2)) != 0)\n << endl;\n } else {\n cout << 0 << endl;\n }\n return 0;\n}", "import sys\ninput = sys.stdin.readline\n\nT1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\n\nDA=(T1*A1,T2*A2)\nDB=(T1*B1,T2*B2)\n\nif sum(DA)==sum(DB):\n print(\"infinity\")\n sys.exit()\n\nif DA[0]>DB[0]:\n DA,DB=DB,DA\n\nif sum(DA)<sum(DB):\n print(0)\n sys.exit()\n\nrep=(DB[0]-DA[0])//(sum(DA)-sum(DB))\nminus=0\nif (DB[0]-DA[0])%(sum(DA)-sum(DB))==0:\n minus=1\nprint(rep*2+1-minus)", "def f():\n\tfrom math import ceil\n\tT1,T2 = map(int,input().split())\n\tA1,A2 = map(int,input().split())\n\tB1,B2 = map(int,input().split())\n\tif B1 > A1:\n\t\tA1,A2,B1,B2 = B1,B2,A1,A2\n\tdiff1 = (A1 - B1) * T1\n\tfac = (B2 - A2) * T2 - diff1\n\tif fac == 0:\n\t\tprint(\"infinity\")\n\telif diff1 / fac < 0:\n\t\tprint(0)\n\telif diff1 / fac <= 1:\n\t\tprint(1)\n\telse:\n\t\tprint(2 * ceil(diff1 / fac) - int(diff1 % fac != 0))\nf()", "#include<iostream>\nusing namespace std;\n\nint main() {\n long T1, T2, A1, A2, B1, B2; cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n if (T1*A1+T2*A2==T1*B1+T2*B2) { cout << \"infinity\" << endl; return 0; }\n long M1 = T1*A1-T1*B1, M2=T2*A2-T2*B2;\n if (M1+M2<0) {M1 = -M1; M2=-M2;}\n if (M2 > 0) cout<<(max(0L, (M2-1)/(M1+M2)-1) + max(0L, M2/(M1+M2)))<<endl;\n else cout<<(max(0L, (M2)/(M1+M2)-1) + max(0L, (M2+1)/(M1+M2)-1))<<endl;\n}", "//繰り返し二乗法 repow(b,p)(b,p,modder)\n//ユークリッド互除法で最大公約数 gcd\n//gcdで最小公倍数 lcm\n//約数列挙divList(int)\n//約数列挙divSet(int)\n//素数判定iP(long)とtameshiwari(long)\n//二項係数クラスNCK\n////NCK(max,modder)\n////pre(max,modder)\n////nCk(n,k)\n//BSA()()()(List<T>,T,int,int,Comparator<T>)\n//BSF()()()(List<T>,T,int,int,Comparator<T>)\n//BSL()()()(List<T>,T,int,int,Comparator<T>)\n//BSA()()()(T[],T,int,int,Comparator<T>)\n//BSF()()()(T[],T,int,int,Comparator<T>)\n//BSL()()()(T[],T,int,int,Comparator<T>)\n//BSA()()()(int[],int,int,int,syojun)\n//BSF()()()(int[],int,int,int,syojun)\n//BSL()()()(int[],int,int,int,syojun)\n//int kmp(String t,String p)\n//文字列文字ソートStSort(String)\n//二次元整数座標オブジェクトXy\n////マンハッタン距離manht(Xy)\n////toString\n////偏角ソート用hencom\n////偏角henkaku\n////equals\n//ユニオンファインドUnFd\n////boolean isRoot(i)\n////int rootOf(i)\n////boolean ud(i,j)\n////boolean marge(i,j)\n////int[] roots()\n//スキャナーScnr\n////next nextBuilder nextInt nextLong nextDouble()\n////nextAInt nextALong nextADouble(n)(a[],n)(a[],off,len)\n////nextLInt nextLLong nextLDouble(n)\n//static PrintWriter out = new PrintWriter(System.out);\nimport java.util.*;\nimport java.io.*;\n\nclass Main{\n static int repow(int b,int p){\n long a = b;\n long res=1;\n while(p>0){\n if(p%2==1){\n res*=a;\n }\n a*=a;\n p/=2;\n }\n return (int)res;\n }\n static int repow(int b,int p,int modder){\n long a = b%modder;\n long res=1;\n while(p>0){\n if(p%2==1){\n res=(res*a)%modder;\n }\n a=(a*a)%modder;\n p/=2;\n }\n return (int)res;\n }\n static long repow(long b,long p){\n long a = b;\n long res=1;\n while(p>0){\n if(p%2==1){\n res*=a;\n }\n a*=a;\n p/=2;\n }\n return res;\n }\n static long repow(long b,long p,long modder){\n long a = b%modder;\n long res=1;\n while(p>0){\n if(p%2==1){\n res=(res*a)%modder;\n }\n a=(a*a)%modder;\n p/=2;\n }\n return res;\n }\n static long gcd(long c,long d){\n while(true){\n long f=c%d;\n if(f==0){\n return d;\n }\n c=d;\n d=f;\n }\n }\n static long lcm(long c,long d){\n return c/gcd(c,d)*d;\n }\n static ArrayList<Integer> divList(int n){\n ArrayList<Integer> div=new ArrayList<Integer>();\n for(int i=1;i*i<=n;i++){\n if(n%i==0){\n div.add(i);\n if(i*i!=n){\n div.add((int)(n/i));\n }\n }\n }\n return div;\n }\n static HashSet<Integer> divSet(int n){\n HashSet<Integer> div=new HashSet<Integer>();\n for(int i=1;i*i<=n;i++){\n if(n%i==0){\n div.add(i);\n div.add((int)(n/i));\n }\n }\n return div;\n }\n static boolean iP(long n){\n if(n==2){\n return true;\n }\n if((n&1)==0||n==1){\n return false;\n }\n// if(n>3037007383L){\n if(n>Integer.MAX_VALUE){\n return tameshiwari(n);\n }\n long d=n-1;\n int s=0;\n while((d&1)==0){\n d/=2;\n s++;\n }\n int[] aa = {2,3,5,7,11,13,17};\n for(int i=0;i<7&&aa[i]<n;i++){\n int a = aa[i];\n long t = d;\n long y=repow(a,t,n);\n while(t!=n-1&&y!=1&&y!=n-1){\n y = (y*y)%n;\n t=t<<1;\n }\n if(y!=n-1&&(t&1)==0){\n return false;\n }\n }\n return true;\n }\n static boolean tameshiwari(long n){\n for(long i=2;i*i<=n;i++){\n if(n%i==0){\n return false;\n }\n }\n return true;\n }\n static class NCK{\n int max;\n int modder;\n long[] fac;\n long[] finv;\n long[] inv;\n NCK(){\n this(510000,1000000007);\n }\n NCK(int max,int modder){\n this.max=max;\n this.modder=modder;\n pre();\n }\n void pre(){\n fac = new long[max];\n finv = new long[max];\n inv = new long[max];\n fac[0]=fac[1]=1;\n finv[0]=finv[1]=1;\n inv[1]=1;\n for(int i=2;i<max;i++){\n fac[i]=fac[i-1]*i%modder;\n inv[i]=modder-inv[modder%i]*(modder/i)%modder;\n finv[i]=finv[i-1]*inv[i]%modder;\n }\n }\n long nCk(int n,int k){\n if(n<k){return 0;}\n if(n<0||k<0){return 0;}\n return fac[n]*(finv[k]*finv[n-k]%modder)%modder;\n }\n }\n static <T extends Comparable<T>> int BSA(List<T> l,T target){\n return BSA(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSA(List<T> l,T target,Comparator<T> c){\n return BSA(l,target,0,l.size(),c);\n }\n static <T extends Comparable<T>> int BSA(List<T> l,T target,int left,int right){\n return BSA(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSA(List<T> l,T target,int left,int right,Comparator<T> c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>0){\n rt=lt+(rt-lt)/2-1;\n }else{\n return lt+(rt-lt)/2;\n }\n }\n return -1;\n }\n static <T extends Comparable<T>> int BSF(List<T> l,T target){\n return BSF(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSF(List<T> l,T target,Comparator<T> c){\n return BSF(l,target,0,l.size(),c);\n }\n static <T extends Comparable<T>> int BSF(List<T> l,T target,int left,int right){\n return BSF(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSF(List<T> l,T target,int left,int right,Comparator<T> c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>=0){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static <T extends Comparable<T>> int BSL(List<T> l,T target){\n return BSL(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSL(List<T> l,T target,Comparator<T> c){\n return BSL(l,target,0,l.size(),c);\n }\n static <T extends Comparable<T>> int BSL(List<T> l,T target,int left,int right){\n return BSL(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSL(List<T> l,T target,int left,int right,Comparator<T> c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<=0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>0){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static <T extends Comparable<T>> int BSA(T[] a,T target){\n return BSA(a,target,0,a.length,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSA(T[] a,T target,Comparator<T> c){\n return BSA(a,target,0,a.length,c);\n }\n static <T extends Comparable<T>> int BSA(T[] a,T target,int left,int right){\n return BSA(a,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSA(T[] a,T target,int left,int right,Comparator<T> c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=a[lt+(rt-lt)/2];\n if(c.compare(gaze,target)<0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>0){\n rt=lt+(rt-lt)/2-1;\n }else{\n return lt+(rt-lt)/2;\n }\n }\n return -1;\n }\n static <T extends Comparable<T>> int BSF(T[] a,T target){\n return BSF(a,target,0,a.length,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSF(T[] a,T target,Comparator<T> c){\n return BSF(a,target,0,a.length,c);\n }\n static <T extends Comparable<T>> int BSF(T[] a,T target,int left,int right){\n return BSF(a,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSF(T[] a,T target,int left,int right,Comparator<T> c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=a[lt+(rt-lt)/2];\n if(c.compare(gaze,target)<0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>=0){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static <T extends Comparable<T>> int BSL(T[] a,T target){\n return BSL(a,target,0,a.length,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSL(T[] a,T target,Comparator<T> c){\n return BSL(a,target,0,a.length,c);\n }\n static <T extends Comparable<T>> int BSL(T[] a,T target,int left,int right){\n return BSL(a,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static <T> int BSL(T[] a,T target,int left,int right,Comparator<T> c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=a[lt+(rt-lt)/2];\n if(c.compare(gaze,target)<=0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>0){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static int BSA(int[] a,int target){\n return BSA(a,target,0,a.length,true);\n }\n static int BSA(int[] a,int target, boolean syojun){\n return BSA(a,target,0,a.length,syojun);\n }\n static int BSA(int[] a,int target,int left,int right){\n return BSA(a,target,left,right,true);\n }\n static int BSA(int[] a,int target,int left,int right,boolean syojun){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n int gaze=a[lt+(rt-lt)/2];\n if((syojun&&gaze<target)||(!syojun&&gaze>target)){\n lt=lt+(rt-lt)/2+1;\n }else if((syojun&&gaze>target)||(!syojun&&gaze<target)){\n rt=lt+(rt-lt)/2-1;\n }else{\n return lt+(rt-lt)/2;\n }\n }\n return -1;\n }\n static int BSF(int[] a,int target){\n return BSF(a,target,0,a.length,true);\n }\n static int BSF(int[] a,int target,boolean syojun){\n return BSF(a,target,0,a.length,syojun);\n }\n static int BSF(int[] a,int target,int left,int right){\n return BSF(a,target,left,right,true);\n }\n static int BSF(int[] a,int target,int left,int right,boolean syojun){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n int gaze=a[lt+(rt-lt)/2];\n if((syojun&&gaze<target)||(!syojun&&gaze>target)){\n lt=lt+(rt-lt)/2+1;\n }else if((syojun&&gaze<=target)||(!syojun&&gaze>=target)){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static int BSL(int[] a,int target){\n return BSL(a,target,0,a.length,true);\n }\n static int BSL(int[] a,int target,boolean syojun){\n return BSL(a,target,0,a.length,syojun);\n }\n static int BSL(int[] a,int target,int left,int right){\n return BSL(a,target,left,right,true);\n }\n static int BSL(int[] a,int target,int left,int right,boolean syojun){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n int gaze=a[lt+(rt-lt)/2];\n if((syojun&&gaze<=target)||(!syojun&&gaze>=target)){\n lt=lt+(rt-lt)/2+1;\n }else if((syojun&&gaze>target)||(!syojun&&gaze<target)){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static int BSA(long[] a,long target){\n return BSA(a,target,0,a.length,true);\n }\n static int BSA(long[] a,long target, boolean syojun){\n return BSA(a,target,0,a.length,syojun);\n }\n static int BSA(long[] a,long target,int left,int right){\n return BSA(a,target,left,right,true);\n }\n static int BSA(long[] a,long target,int left,int right,boolean syojun){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n long gaze=a[lt+(rt-lt)/2];\n if((syojun&&gaze<target)||(!syojun&&gaze>target)){\n lt=lt+(rt-lt)/2+1;\n }else if((syojun&&gaze>target)||(!syojun&&gaze<target)){\n rt=lt+(rt-lt)/2-1;\n }else{\n return lt+(rt-lt)/2;\n }\n }\n return -1;\n }\n static int BSF(long[] a,long target){\n return BSF(a,target,0,a.length,true);\n }\n static int BSF(long[] a,long target,boolean syojun){\n return BSF(a,target,0,a.length,syojun);\n }\n static int BSF(long[] a,long target,int left,int right){\n return BSF(a,target,left,right,true);\n }\n static int BSF(long[] a,long target,int left,int right,boolean syojun){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n long gaze=a[lt+(rt-lt)/2];\n if((syojun&&gaze<target)||(!syojun&&gaze>target)){\n lt=lt+(rt-lt)/2+1;\n }else if((syojun&&gaze<=target)||(!syojun&&gaze>=target)){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static int BSL(long[] a,long target){\n return BSL(a,target,0,a.length,true);\n }\n static int BSL(long[] a,long target,boolean syojun){\n return BSL(a,target,0,a.length,syojun);\n }\n static int BSL(long[] a,long target,int left,int right){\n return BSL(a,target,left,right,true);\n }\n static int BSL(long[] a,long target,int left,int right,boolean syojun){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n long gaze=a[lt+(rt-lt)/2];\n if((syojun&&gaze<=target)||(!syojun&&gaze>=target)){\n lt=lt+(rt-lt)/2+1;\n }else if((syojun&&gaze>target)||(!syojun&&gaze<target)){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static int kmp(String t,String p){\n int[] f=new int[p.length()+1];\n int i=0;\n int j=1;\n f[1]=0;\n while(j<p.length()){\n if(i==0||p.charAt(i-1)==p.charAt(j-1)){\n i++;\n j++;\n f[j]=i;\n }else{\n i=f[i];\n }\n }\n i=1;\n j=1;\n while(i<=p.length()&&j<=t.length()){\n if(i==0||p.charAt(i-1)==t.charAt(j-1)){\n i++;\n j++;\n }else{\n i=f[i];\n }\n }\n return i==(p.length()+1)?j-i:-1;\n }\n static String StSort(String s){\n StringBuilder sb = new StringBuilder(s);\n int lg = sb.length();\n int l;\n int r;\n int gaze;\n for(int i=1;i<lg;i++){\n l=0;\n r=i-1;\n while(l<=r){\n gaze=(l+r)/2;\n if(sb.charAt(gaze)<=sb.charAt(i)){\n l=gaze+1;\n }else if(sb.charAt(gaze)>sb.charAt(i)){\n r=gaze-1;\n }\n }\n sb.insert(l,sb.charAt(i));\n sb.deleteCharAt(i+1);\n }\n return sb.toString();\n }\n static class Xy{\n int x;\n int y;\n Xy(int x,int y){\n this.x=x;\n this.y=y;\n }\n public int manht(Xy o){\n return Math.abs(x-o.x)+Math.abs(y-o.y);\n }\n public String toString(){\n return \"[\"+x+\",\"+y+\"]\";\n }\n public double henkaku(){\n return Math.atan2(y,x);\n }\n public static int hencom(Xy s1,Xy s2){\n return (int)Math.signum(s1.henkaku()-s2.henkaku());\n }\n public boolean equals(Object o){\n return x==((Xy)o).x&&y==((Xy)o).y;\n }\n }\n static class UnFd{\n int n;\n int[] a;\n int forest;\n UnFd(int n){\n forest=this.n=n;\n a = new int[n];\n for(int i=0;i<n;i++){\n a[i] = i;\n }\n }\n boolean isRoot(int i){\n return a[i]==i;\n }\n int rootOf(int i){\n if(isRoot(i)){\n return i;\n }\n return a[i] = rootOf(a[i]);\n }\n boolean ud(int i,int j){\n return rootOf(i)==rootOf(j);\n }\n boolean marge(int i,int j){\n if(ud(i,j)){\n return false;\n }\n i=rootOf(i);\n j=rootOf(j);\n a[Integer.max(i,j)]=Integer.min(i,j);\n forest-=1;\n return true;\n }\n int[] roots(){\n int[] rs = new int[forest];\n int p=0;\n for(int i=0;i<n;i++){\n if(isRoot(i)){\n rs[p]=i;\n p++;\n }\n }\n return rs;\n }\n }\n static class Scnr{\n private final InputStream ins;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n Scnr(){\n this(System.in);\n }\n Scnr(InputStream in){\n ins = in;\n }\n private boolean hasNextByte(){\n if(ptr<buflen){\n return true;\n }else{\n ptr = 0;\n try{\n buflen = ins.read(buffer);\n }catch(IOException e){\n e.printStackTrace();\n }\n if(buflen<=0){\n return false;\n }\n }\n return true;\n }\n private int readByte(){\n if(hasNextByte()){\n return buffer[ptr++];\n }else{\n return -1;\n }\n }\n private static boolean isPrintableChar(int c){\n return 33<=c&&c<=126;\n }\n public boolean hasNext(){\n while(hasNextByte()&&!isPrintableChar(buffer[ptr])){\n ptr++;\n }\n return hasNextByte();\n }\n public String next(){\n return nextBuilder().toString();\n }\n public StringBuilder nextBuilder(){\n if(!hasNext()){\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb;\n }\n public double nextDouble(){\n return Double.parseDouble(next());\n }\n public long nextLong(){\n if(!hasNext()){\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if(b=='-'){\n minus=true;\n b=readByte();\n }\n if(b<'0'||'9'<b){\n throw new NumberFormatException();\n }\n while(true){\n if('0'<=b&&b<='9'){\n n*=10;\n n+=b-'0';\n }else if(b==-1||!isPrintableChar(b)){\n return minus?-n:n;\n }else{\n throw new NumberFormatException();\n }\n b=readByte();\n }\n }\n public int nextInt(){\n long nl=nextLong();\n if(nl<Integer.MIN_VALUE||Integer.MAX_VALUE<nl){\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n public int[] nextAInt(int n){\n int[] a = new int[n];\n nextAInt(a,n);\n return a;\n }\n public void nextAInt(int[] a,int n){\n nextAInt(a,0,n);\n }\n public void nextAInt(int[] a,int off,int len){\n for(int i=off;i<off+len;i++){\n a[i] = nextInt();\n }\n }\n public long[] nextALong(int n){\n long[] a = new long[n];\n nextALong(a,n);\n return a;\n }\n public void nextALong(long[] a,int n){\n nextALong(a,0,n);\n }\n public void nextALong(long[] a,int off,int len){\n for(int i=off;i<off+len;i++){\n a[i] = nextLong();\n }\n }\n public double[] nextADouble(int n){\n double[] a = new double[n];\n nextADouble(a,n);\n return a;\n }\n public void nextADouble(double[] a,int n){\n nextADouble(a,0,n);\n }\n public void nextADouble(double[] a,int off,int len){\n for(int i=off;i<off+len;i++){\n a[i] = nextDouble();\n }\n }\n public List<Integer> nextLInt(int n){\n List<Integer> l = new ArrayList<>(n);\n for(int i=0;i<n;i++){\n l.add(sc.nextInt());\n }\n return l;\n }\n public List<Long> nextLLong(int n){\n List<Long> l = new ArrayList<>(n);\n for(int i=0;i<n;i++){\n l.add(sc.nextLong());\n }\n return l;\n }\n public List<Double> nextLDouble(int n){\n List<Double> l = new ArrayList<>(n);\n for(int i=0;i<n;i++){\n l.add(sc.nextDouble());\n }\n return l;\n }\n }\n \n static Scnr sc = new Scnr();\n static PrintWriter out = new PrintWriter(System.out);\n public static void main(String args[]){\n int t1=sc.nextInt();\n int t2=sc.nextInt();\n long a1=sc.nextLong();\n long a2=sc.nextLong();\n a1-=sc.nextLong();\n a2-=sc.nextLong();\n if(t1*a1+t2*a2==0){\n out.println(\"infinity\");\n }else if(Long.signum(a1)==Long.signum(a2)){\n out.println(0);\n }else{\n long l1=t1*a1;//-1\n long l2=t2*a2;//12\n if(Math.abs(l1)>Math.abs(l2)){\n out.println(0);\n }else{\n l1=Math.abs(l1);\n l2=Math.abs(l2);\n long sa=l2-l1;\n if(l1%sa==0){\n out.println((l1/sa)*2);\n }else{\n out.println((l1/sa)*2+1);\n }\n }\n }\n out.flush();\n }\n}", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nif t1*a1+t2*a2 == t1*b1+t2*b2:\n\tprint(\"infinity\")\nelif (a1-b1) * (t1*(a1-b1) + t2*(a2-b2)) > 0:\n\tprint(0)\nelse:\n\tif a1 > b1:\n\t\tx = (a1-b1)*t1\n\t\ty = (b2-a2)*t2 - x\n\telse:\n\t\tx = (b1-a1)*t1\n\t\ty = (a2-b2)*t2 - x\n\n\tans = 1 + (x//y)*2\n\tif x%y == 0:\n\t\tans -= 1\n\n\tprint(ans)\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nc1 = T1*A1-T1*B1\nc2 = T2*A2-T2*B2\nif c1 > 0:\n c1 *= -1\n c2 *= -1\npower = c1+c2\nif power == 0:\n print('infinity')\nelif power < 0:\n print(0)\nelse:\n ans = 2*(-c1//power)+(c1%power > 0)\n print(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\ntemplate<typename T>\nvoid fin(T a){\n cout<<a<<endl;\n exit(0);\n}\n\nsigned main(){\n int t1,t2,a1,a2,b1,b2;cin>>t1>>t2>>a1>>a2>>b1>>b2;\n a1-=b1;a2-=b2;\n if(a1>0)a1*=-1,a2*=-1;\n int A=t1*a1+t2*a2,B=-t1*a1;\n if(A<0)fin(0);\n if(A==0)fin(\"infinity\");\n int ans=B/A*2+1;\n if(B%A==0)ans--;\n cout<<ans<<endl;\n}\n/*\nあまりがある時　(B/A*2+1)\nあまりがない時　(B/A*2)\n*/\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll n,m,a,b,c,d,A,B;\nint main(void){\n\tcin>>n>>m>>a>>b>>c>>d;\n\tif((a-c)>0&&(b-d)>0){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tif((a-c)<0&&(b-d)<0){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tA=abs(a-c)*n;\n\tB=abs(b-d)*m;\n\tif(A==B){\n\t\tcout<<\"infinity\"<<endl;\n\t\treturn 0;\n\t}\n\tif(A>B){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\telse {\n\t\tif(A%(B-A)==0){\n\t\t\tcout<<(A/(B-A))*2<<endl;\n\t\t\treturn 0;\n\t\t}\n\t\tcout<<(A/(B-A))*2+1<<endl;\n\t}\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef long long ll;\n\nint main(){\n ll t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n ll d1=(a1-b1)*t1, d2=(a2-b2)*t2;\n if(d1>0){\n d1*=-1, d2*=-1;\n }\n\n if(d2<0) cout << 0 << endl;\n else if(d1+d2==0) cout << \"infinity\" << endl;\n else if(d1+d2<0) cout << 0 << endl;\n else{\n ll ans=2*(ll)((-d1)/(d1+d2));\n if((-d1)%(d1+d2)!=0) ans++;\n cout << ans << endl;\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=1e9+7;\nint main()\n{\n ll t1,t2,a1,a2,b1,b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n if(a1*t1+a2*t2==b1*t1+b2*t2)\n {\n cout<<\"infinity\";\n return 0;\n }\n ll c1=(a1-b1)*t1,c2=(a2-b2)*t2;\n if(c1>=0&&c2>=0)\n {\n cout<<\"0\";\n return 0;\n }\n if(c1<=0&&c2<=0)\n {\n cout<<\"0\";\n return 0;\n }\n\n if(abs(c1)>abs(c2))\n {\n cout<<\"0\";\n return 0;\n }\n else cout<<(2LL*(c1/(-(c1+c2))))+1-(c1%(c1+c2)==0)<<'\\n';\n return 0;\n\n\n}\n", "T1,T2,A1,A2,B1,B2=map(int, open(0).read().split())\nC1,C2=A1-B1,A2-B2\nif C1<0: C1,C2=-C1,-C2\nY1=C1*T1\nY2=Y1+C2*T2\nif Y2>0:\n print(0)\nelif Y2==0:\n print(\"infinity\")\nelse:\n print(1+Y1//(-Y2)*2-(Y1%(-Y2)==0))", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll t1,t2,a1,b1,a2,b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n ll p=(a1-b1)*t1;\n ll q=(a2-b2)*t2;\n if(p>0) {\n p=-p; \n q=-q;\n }\n if(p+q<0) cout << 0 << endl;\n else if(p+q==0) cout << \"infinity\" << endl;\n else if(p%(p+q)==0) cout << -p/(p+q)*2 << endl;\n else cout << -p/(p+q)*2+1 << endl;\n \n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nusing Lint=long long;\n\nLint solve(Lint X,Lint Y)\n{\n if(X+Y==0) return -1;\n\n if(X<0) X=-X,Y=-Y;\n if(X==0) return 1;\n else{\n if(X+Y>0) return 0;\n else{\n Lint res=X/abs(X+Y)*2;\n if(X%abs(X+Y)!=0) res++;\n return res;\n }\n }\n}\n\nint main()\n{\n Lint t[2],a[2],b[2];\n cin>>t[0]>>t[1]>>a[0]>>a[1]>>b[0]>>b[1];\n\n Lint X=(a[0]-b[0])*t[0];\n Lint Y=(a[1]-b[1])*t[1];\n Lint ans=solve(X,Y);\n if(ans==-1) cout<<\"infinity\"<<endl;\n else cout<<ans<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll ans=0,t1,t2,a,b,c,d;\nint main(){\n scanf(\"%lld %lld %lld %lld %lld %lld\",&t1,&t2,&a,&b,&c,&d);\n a-=c; b-=d; a*=t1; b*=t2;\n if(a+b==0) printf(\"infinity\\n\");\n else if(a>0&&a+b>0) printf(\"0\\n\");\n else if(a<0&&a+b<0) printf(\"0\\n\");\n else{\n b=fabs(b+a); a=fabs(a);\n ans=a/b*2;\n if(a%b!=0) ans++;\n printf(\"%lld\\n\",ans);\n }\n}\n", "import java.util.*;\nimport java.io.*;\nimport java.util.function.*;\n\nclass Main {\n static Scanner scanner = new Scanner();\n static int mod = 1000000007;\n static long inf = 0xfffffffffffffffL;\n\n void solve() {\n long t1 = scanner.nextLong();\n long t2 = scanner.nextLong();\n long a1 = scanner.nextLong() * t1;\n long a2 = scanner.nextLong() * t2;\n long b1 = scanner.nextLong() * t1;\n long b2 = scanner.nextLong() * t2;\n if (b1 > a1) {\n long temp = b1;\n b1 = a1;\n a1 = temp;\n temp = b2;\n b2 = a2;\n a2 = temp;\n }\n long a = b1 - a1;\n long b = b2 - a2;\n long d = a + b;\n if (d == 0) {\n System.out.println(\"infinity\");\n } else if (d <= 0) {\n System.out.println(0);\n } else {\n long ans = (-a + d - 1) / d * 2 - 1;\n if (a % d == 0) {\n ans++;\n }\n System.out.println(ans);\n }\n }\n\n public static void main(String[]$) {\n try {\n new Main().solve();\n System.out.flush();\n } catch (Throwable t) {\n System.out.flush();\n t.printStackTrace();\n }\n }\n}\n\nclass System {\n static PrintWriter out = new PrintWriter(java.lang.System.out);\n\n static void exit() {\n java.lang.System.exit(0);\n }\n}\n\nclass Scanner {\n private BufferedReader reader = new BufferedReader(new InputStreamReader(java.lang.System.in), 0x10000);\n private StringTokenizer tokenizer;\n\n String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n } catch (IOException ignored) {\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n char[][] nextCharArray(int n, int m) {\n char[][] a = new char[n][m];\n for (int i = 0; i < n; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n int[] nextIntArray(int n, IntUnaryOperator op) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsInt(nextInt());\n }\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n long[] nextLongArray(int n, LongUnaryOperator op) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsLong(nextLong());\n }\n return a;\n }\n}\n", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n int t1 = sc.nextInt();\n int t2 = sc.nextInt();\n long a1 = sc.nextLong();\n long a2 = sc.nextLong();\n long b1 = sc.nextLong();\n long b2 = sc.nextLong();\n\n\n long d1 = t1 * a1 + t2 * a2;\n long d2 = t1 * b1 + t2 * b2;\n if(d1 == d2) {\n System.out.println(\"infinity\");\n return;\n }\n if(a1 < b1 && a2 < b2 || a1 > b1 && a2 > b2) {\n System.out.println(0);\n return;\n }\n\n if(d1 < d2) {\n long temp = a1;\n a1 = b1;\n b1 = temp;\n temp = a2;\n a2 = b2;\n b2 = temp;\n temp = d1;\n d1 = d2;\n d2 = temp;\n }\n long d = d1 - d2;\n if(a1 > b1) {\n System.out.println(0);\n return;\n }\n\n long adv = ((b1-a1) * t1);\n\n long div = adv / d;\n long rem = adv % d;\n\n long res = div * 2;\n if( rem > 0) res++;\n\n\n System.out.println(res);\n }\n\n\n}\n", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n\nint t1, t2;\nll a1, a2, b1, b2;\n\nint main() {\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n if (a1 < b1) {\n swap(a1, b1);\n swap(a2, b2);\n }\n ll d = (b1 * t1 + b2 * t2) - (a1 * t1 + a2 * t2);\n if (d < 0) {\n cout << 0 << endl;\n return 0;\n }\n if (d == 0) {\n cout << \"infinity\" << endl;\n return 0;\n }\n ll d0 = a1 * t1 - b1 * t1;\n ll k = d0 / d;\n ll ans = 2 * k + 1;\n if (d * k == d0) ans--;\n cout << ans << endl;\n return 0;\n}", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n# 必ずB1の方を大きくする必要がある\nif A1 > B1:\n B1, A1 = A1, B1\n B2, A2 = A2, B2\nP = T1*(A1-B1) # Pは負の値\nQ = T2*(A2-B2)\nif P + Q == 0:\n print(\"infinity\")\n exit()\nelif P + Q < 0: # 出会う位置まで戻ってこれなかった\n print(0)\n exit()\nelif P + Q > 0: # 限られた数だけあえる\n if (-P % (P + Q)) == 0:\n print(2*(-P // (P+Q)))\n else:\n print(2*(-P // (P+Q))+1)\n", "/**\n * Created at 21:40 on 2019-12-01\n */\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n static FastScanner sc = new FastScanner();\n static Output out = new Output(System.out);\n\n static final int[] dx = {0, 1, 0, -1};\n static final int[] dy = {-1, 0, 1, 0};\n\n static final long MOD = (long) (1e9 + 7);\n static final long INF = Long.MAX_VALUE / 2;\n\n static final int e5 = (int) 1e5;\n\n public static class Solver {\n public Solver() {\n\n long T1 = sc.nextLong();\n long T2 = sc.nextLong();\n long A1 = sc.nextLong();\n long A2 = sc.nextLong();\n long B1 = sc.nextLong();\n long B2 = sc.nextLong();\n\n long averageDif = A1*T1+A2*T2 - (B1*T1+B2*T2);\n\n if (averageDif == 0) {\n out.println(\"infinity\");\n return;\n } else if (averageDif < 0) {\n long temp = A1;\n A1 = B1;\n B1 = temp;\n temp = A2;\n A2 = B2;\n B2 = temp;\n }\n\n //Aの方がBより速い\n\n long d1 = (A1-B1) * T1;\n long d2 = (A2-B2) * T2;\n long d = d1 + d2; //d > 0\n\n if (d1 > 0) {\n out.println(0);\n } else {\n long q = (-d1+d-1)/d;\n long r = (-d1)%d;\n if (r == 0) {\n out.println(q*2-1+1);\n } else {\n out.println(q*2-1);\n }\n }\n\n }\n }\n\n public static void main(String[] args) {\n new Solver();\n out.flush();\n }\n\n static class FastScanner {\n private InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n\n public void load() {\n try {\n in = new FileInputStream(next());\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n public boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public int[] nextIntArray(int N, boolean oneBased) {\n if (oneBased) {\n int[] array = new int[N + 1];\n for (int i = 1; i <= N; i++) {\n array[i] = sc.nextInt();\n }\n return array;\n } else {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = sc.nextInt();\n }\n return array;\n }\n }\n\n public long[] nextLongArray(int N, boolean oneBased) {\n if (oneBased) {\n long[] array = new long[N + 1];\n for (int i = 1; i <= N; i++) {\n array[i] = sc.nextLong();\n }\n return array;\n } else {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = sc.nextLong();\n }\n return array;\n }\n }\n }\n\n static class Output extends PrintWriter {\n\n private long startTime;\n\n public Output(PrintStream ps) {\n super(ps);\n }\n\n public void print(int[] a, String separator) {\n for (int i = 0; i < a.length; i++) {\n if (i == 0) print(a[i]);\n else print(separator + a[i]);\n }\n println();\n }\n\n public void print(long[] a, String separator) {\n for (int i = 0; i < a.length; i++) {\n if (i == 0) print(a[i]);\n else print(separator + a[i]);\n }\n println();\n }\n\n public void print(String[] a, String separator) {\n for (int i = 0; i < a.length; i++) {\n if (i == 0) print(a[i]);\n else print(separator + a[i]);\n }\n println();\n }\n\n public void print(ArrayList a, String separator) {\n for (int i = 0; i < a.size(); i++) {\n if (i == 0) print(a.get(i));\n else print(separator + a.get(i));\n }\n println();\n }\n\n public void start() {\n startTime = System.currentTimeMillis();\n }\n\n public void time(String s) {\n long time = System.currentTimeMillis() - startTime;\n println(s + \"(\" + time + \")\");\n }\n\n }\n\n}\n", "T1,T2 = map(int,input().split())\nA1,A2 = map(int,input().split())\nB1,B2 = map(int,input().split())\n\nC1 = (A1-B1)*T1\nC2 = (A2-B2)*T2\n\nif C1+C2==0:\n print('infinity')\nelif C1*(C1+C2)>0:\n print(0)\nelse:\n if abs(C1)%abs(C1+C2)==0:\n print(abs(C1)//abs(C1+C2)*2)\n else:\n print(abs(C1)//abs(C1+C2)*2+1)", "T1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\nOU=T1*(A1-B1)\nHUKU=T2*(A2-B2)\nTOTAL=OU+HUKU\nif TOTAL==0:\n print(\"infinity\")\nelif (OU>0 and TOTAL>0) or (OU<0 and TOTAL<0):\n print(0)\nelif (OU>0 and TOTAL*(-1)>OU) or (OU<0 and TOTAL*(-1)<OU):\n print(1)\nelse:\n K=int(OU/TOTAL)*-1\n if (OU%TOTAL)==0:\n print(K*2)\n else:\n print(K*2+1)\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint t1,t2,a1,a2,b1,b2;\nsigned main(){\ncin>>t1>>t2>>a1>>a2>>b1>>b2;\nint t3=t1*a1,t4=t1*b1,t5=t2*a2,t6=t2*b2;\nif(t3>t4&&t5>t6){\n\tprintf(\"0\");\n\treturn 0;\n}\nif(t3<t4&&t5<t6){\n\tprintf(\"0\");\n\treturn 0;\n}\nif(t3<t4&&t3+t5<t4+t6){\n\tprintf(\"0\");\n\treturn 0;\n}\nif(t3>t4&&t3+t5>t4+t6){\n\tprintf(\"0\");\n\treturn 0;\n}\nif(t3>t4){\n\tswap(t3,t4);\n\tswap(t5,t6);\n}\n//cout<<t3<<\" \"<<t5<<endl;\nint temp=t3+t5-t4-t6;\nif(!temp){\n\tprintf(\"infinity\");\n\treturn 0;\n}\nint temp2=t4-t3;\n//cout<<temp<<\" \"<<temp2;\nint op=(temp2/temp)*2;\nif(temp2%temp==0)op--;\ncout<<op+1;\n\nreturn 0;\n}\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\na = (a1-b1)*t1\nb = (a2-b2)*t2\nif a < 0:\n a *= -1\n b *= -1\n\nif a == -b:\n print(\"infinity\")\n exit()\nif a+b > 0:\n print(0)\nelse:\n c = -a-b\n print((a+c-1)//c + a//c)\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nlong long t1,t2,a1,a2,b1,b2;\nlong long d1,d2;\nlong long down,up;\n\nint main() {\n\tcin>>t1>>t2>>a1>>a2>>b1>>b2;\n\td1=t1*(a1-b1);\n\td2=t2*(a2-b2);\n\tif(d1==(-d2)) {\n\t\tcout<<\"infinity\"<<endl;\n\t\treturn 0;\n\t}\n\tdown=min(min(down,d1),d1+d2);\n\tup=max(max(up,d1),d1+d2);\n\tlong long ans=0;\n\tif(d1+d2>0) {\n\t\tans+=((-down)/(d1+d2)+1)*2;\n\t\tif(ans>0) --ans;\n\t\tif((-down)%(d1+d2)==0) --ans;\n\t}\n\telse {\n\t\tans+=(up/(-d1-d2)+1)*2;\n\t\tif(ans>0) --ans;\n\t\tif(up%(-d1-d2)==0) --ans;\n\t}\n\tcout<<ans<<endl;\n}", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\nx1 = (a1 - b1) * t1\nx2 = (a2 - b2) * t2\nif (x1 > 0 and x2 > 0) or (x1 < 0 and x2 < 0) or abs(x1) > abs(x2):\n print(0)\nelif x1 + x2 == 0:\n print('infinity')\nelse:\n diff = x1 + x2\n ans = 1 + abs(x1) // abs(diff) * 2\n if abs(x1) % abs(diff) == 0:\n ans -= 1\n print(ans)", "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tlong T1 = nl(), T2 = nl();\n\t\tlong A1 = nl(), A2 = nl();\n\t\tlong B1 = nl(), B2 = nl();\n\t\tif(A1*T1+A2*T2 == B1*T1+B2*T2){\n\t\t\tout.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif(A1*T1+A2*T2 < B1*T1+B2*T2){\n\t\t\t{long d = A1; A1 = B1; B1 = d;}\n\t\t\t{long d = A2; A2 = B2; B2 = d;}\n\t\t}\n\t\tlong D = A1*T1+A2*T2 - (B1*T1+B2*T2);\n\t\t\n\t\tlong ans = 0;\n\t\t\n\t\tif(A1-B1 < 0){\n\t\t\t// h*D\n\t\t\t// h*D+T1*(A1-B1) <= 0\n\t\t\tlong h = -T1*(A1-B1)/D;\n\t\t\tans += 2*(h+1);\n\t\t\t\n\t\t\t// 3,6 8,2\n\t\t\t// 3,6 11,8 14,14 22,16,25,22 33,24\n\t\t\t\n\t\t\tif(h*D == -T1*(A1-B1)){\n\t\t\t\tans--;\n\t\t\t}\n\t\t\tout.println(ans-1);\n\t\t}else{\n\t\t\tout.println(0);\n\t\t}\n\t}\n\t\n\tstatic int cross(long T, long A, long B, long al)\n\t{\n\t\tif(al == 0 && A == B)return -1;\n\t\tif(Long.signum(al) * Long.signum(al+T*A-T*B) <= 0)return 1;\n\t\treturn 0;\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tlong S = System.currentTimeMillis();\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\ttr(G-S+\"ms\");\n\t}\n\t\n\tprivate static boolean eof()\n\t{\n\t\tif(lenbuf == -1)return true;\n\t\tint lptr = ptrbuf;\n\t\twhile(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\t\t\n\t\ttry {\n\t\t\tis.mark(1000);\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b == -1){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn true;\n\t\t\t\t}else if(!isSpaceChar(b)){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate static int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n//\tprivate static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\t\n\tprivate static String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate static char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate static char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate static int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate static int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "import math\nt1, t2, a1, a2, b1, b2 = [int(_) for _ in open(0).read().split()]\nc1 = (b1 - a1) * t1\nc2 = c1 + (b2 - a2) * t2\nif c1 * c2 > 0:\n print(0)\n exit()\nif c2 == 0:\n print('infinity')\n exit()\nif c1 < 0:\n c1 *= -1\n c2 *= -1\nans = 2 * (c1 // (-c2)) + (c1 % c2 != 0)\nprint(ans)\n", "import math\n\nT1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nif A1 > B1:\n F1, F2 = A1, A2\n S1, S2 = B1, B2\nelse:\n F1, F2 = B1, B2\n S1, S2 = A1, A2\n\noi = F1 * T1 - S1 * T1\nnuki = S2 * T2 - F2 * T2 - oi\n\nif nuki == 0:\n print(\"infinity\")\nelif nuki > 0:\n enc = oi // nuki * 2\n if oi % nuki != 0:\n enc = enc + 1\n print(enc)\nelse:\n print(0)", "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nll t1,t2,a1,a2,b1,b2;\nll x,y;\n\nint main(){\n\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n x=t1*(a1-b1);\n y=t2*(b2-a2);\n if(x<0){\n x=-x;y=-y;\n }\n if(x>y){\n cout<<0<<endl;\n return 0;\n }\n if(x==y){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n cerr<<x<<' '<<y<<endl;\n cout<<x/(y-x)*2+((bool)(x%(y-x)))<<endl;\n\n return 0;\n}", "T1, T2, A1, A2, B1, B2 = map(int, open(0).read().split())\nP = (A1-B1)*T1\nQ = (A2-B2)*T2\nif P>0:\n P *= -1\n Q *= -1\nif P+Q<0:\n print(0)\nelif P+Q==0:\n print('infinity')\nelse:\n S,T = divmod(-P,P+Q)\n if T!=0:\n print(S*2+1)\n else:\n print(S*2)", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nP = (A1 - B1) * T1\nQ = (A2 - B2) * T2\n\nif P > 0:\n P *= -1\n Q *= -1\n\nif P + Q < 0:\n print(0)\nelif P + Q == 0:\n print('infinity')\nelse:\n S, T = divmod(-P, P+Q)\n if T != 0:\n print(S * 2 + 1)\n else:\n print(S * 2)\n", "T1, T2=(int(i) for i in input().split())\nA1, A2=(int(i) for i in input().split())\nB1, B2=(int(i) for i in input().split())\n\nif T1*A1+T2*A2==T1*B1+T2*B2:\n print(\"infinity\")\nelif ((A1>B1) & (T1*A1+T2*A2-(T1*B1+T2*B2)>0)) or ((A1<B1) & (T1*A1+T2*A2-(T1*B1+T2*B2)<0)):\n print(0)\nelse:\n d=abs(T1*A1+T2*A2-(T1*B1+T2*B2))#T1+T2だけ走った後離れている距離\n ss=0\n if abs(T1*(A1-B1))%d==0:\n ss=1\n \n print(abs(T1*(A1-B1))//d*2-ss+1)\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nd1 = T1*A1 - T1*B1\nd2 = T2*A2 - T2*B2\nd3 = d1+d2\nif d3 == 0:\n print('infinity')\n exit()\n\nif (d1 > 0 and d3 > 0) or (d1 < 0 and d3 < 0):\n print(0)\n exit()\n\nd1 = abs(d1)\nd3 = abs(d3)\nif d1 % d3 == 0:\n print(d1 // d3 * 2)\nelse:\n print(d1 // d3 * 2 + 1)", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\ntemplate<typename T>\nvoid fin(T a){\n cout<<a<<endl;\n exit(0);\n}\n\nsigned main(){\n int t1,t2,a1,a2,b1,b2;cin>>t1>>t2>>a1>>a2>>b1>>b2;\n a1-=b1;a2-=b2;\n if(a1>0)a1*=-1,a2*=-1;\n int A=t1*a1+t2*a2,B=-t1*a1;\n if(A<0)fin(0);\n if(!A)fin(\"infinity\");\n fin(B/A+(B-1)/A+1);\n}\n", "t1, t2 = map(int, input().split())\na1,a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n#t1で生まれる差\nP = (a1 - b1) * t1\n#t2で生まれる差\nQ = (a2 - b2) * t2\n#P < 0 のことを仮定する\nif P > 0:\n P *= -1\n Q *= -1\n\nif P + Q < 0:\n print(0)\nelif P + Q == 0:\n print(\"infinity\")\nelse:\n #つぎのPを足したときに、負にいくかどうか？\n i = P * (-1)\n if i % (P + Q) == 0:\n print(2 * (i // (P + Q)))\n else:\n print(2 * (i // (P + Q)) + 1)\n", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nif (a1*t1-b1*t1)*(a1*t1+a2*t2-b1*t1-b2*t2)>0:print(0)\nelif (a1*t1-b1*t1)*(a1*t1+a2*t2-b1*t1-b2*t2)==0:print('infinity')\nelse:print(-(a1*t1-b1*t1)//(a1*t1+a2*t2-b1*t1-b2*t2)*2+((a1*t1-b1*t1)%(a1*t1+a2*t2-b1*t1-b2*t2)!=0))", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n cin.tie(nullptr); ios::sync_with_stdio(false);\n\n using ll = long long;\n ll T1,T2; cin>>T1>>T2;\n ll A1,A2; cin>>A1>>A2;\n ll B1,B2; cin>>B1>>B2;\n ll d1 = T1*(A1-B1);\n ll dd = d1 + T2*(A2-B2);\n if (dd == 0) {\n cout << \"infinity\" << endl;\n } else if (d1/abs(d1) == dd/abs(dd)) {\n cout << 0 << endl;\n } else {\n ll ans;\n if (abs(d1)%abs(dd) == 0) {\n ans = abs(d1)/abs(dd)*2;\n } else {\n ans = abs(d1)/abs(dd)*2+1;\n }\n cout << ans << endl;\n }\n return 0;\n}\n", "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n long t1, t2, a1, a2, b1, b2;\n void run() {\n Scanner sc = new Scanner(System.in);\n\n t1 = sc.nextLong();\n t2 = sc.nextLong();\n a1 = sc.nextLong();\n a2 = sc.nextLong();\n b1 = sc.nextLong();\n b2 = sc.nextLong();\n\n if (t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2) {\n System.out.println(\"infinity\");\n return;\n }\n\n if (t1 * a1 < t1 * b1 && t1 * a1 + t2 * a2 < t1 * b1 + t2 * b2) {\n System.out.println(0);\n return;\n }\n\n if (t1 * b1 < t1 * a1 && t1 * b1 + t2 * b2 < t1 * a1 + t2 * a2) {\n System.out.println(0);\n return;\n }\n\n long d = Math.abs(t1 * a1 + t2 * a2 - t1 * b1 - t2 * b2);\n debug(d, t1 * a1, t1 * b1, t1 * a1 + t2 * a2, t1 * b1 + t2 * b2);\n long d2 = Math.abs(t2 * a2 - t2 * b2);\n long d1 = Math.abs(t1 * a1 - t1 * b1);\n debug(d, d1, d2, t1 * a1, t1 * b1, t1 * a1 + t2 * a2, t1 * b1 + t2 * b2);\n\n\n long cnt = 2 * (d1 / d) + 1;\n\n if (d1 % d == 0) cnt--;\n\n System.out.println(cnt);\n }\n\n void debug(Object...os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n}\n", "t0, t1 = map(int, input().split())\na0, a1 = map(int, input().split())\nb0, b1 = map(int, input().split())\nd0 = (a0 - b0) * t0\nd1 = (a1 - b1) * t1\nif d0 < 0:\n d0, d1 = -d0, -d1\nif d0 + d1 == 0:\n print('infinity')\n exit()\nif d0 + d1 > 0:\n print(0)\n exit()\nq, r = d0 // (-(d0+d1)), d0 % (-(d0+d1))\nif r == 0:\n print(2 * q)\nelse:\n print(2 * q + 1)\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n long long t1,t2;cin>>t1>>t2;\n long long a1,a2;cin>>a1>>a2;\n long long b1,b2;cin>>b1>>b2;\n long long a1g=(a1-min(a1,b1))*t1;\n long long a2g=(a2-min(a2,b2))*t2;\n long long b1g=(b1-min(a1,b1))*t1;\n long long b2g=(b2-min(a2,b2))*t2;\n if(a1g==0&&a2g==0||b1g==0&&b2g==0)cout<<0<<endl;\n else\n {\n long long p1=a1g+b1g;\n long long p2=a2g+b2g;\n if(p1==p2)cout<<\"infinity\"<<endl;\n else if(p1>p2)cout<<0<<endl;\n else\n {\n long long p=p1/(p2-p1);\n long long ans=p*2+1;\n if(p1%(p2-p1)==0)ans--;\n cout<<ans<<endl;\n } \n }\n}\n", "#F\nt1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\nl1 = (a1-b1)*t1\nl2 = (a2-b2)*t2\n\n \nif (l1+l2)==0:\n print('infinity')\nelif (l1)*(l1+l2)>0:\n print(0)\nelse:\n zure = abs(l1+l2)\n oitsuki = abs(l1)\n n = oitsuki//zure\n if n * zure == oitsuki:\n print(2*n)\n else:\n print(2*n+1)", "#include <bits/stdc++.h>\nusing namespace std;\nlong long t1,t2,a1,b1,a2,b2;\nint main()\n{\n cin>>t1>>t2>>a1>>b1>>a2>>b2;\n if (a1*t1+b1*t2==a2*t1+b2*t2) puts(\"infinity\");\n else {\n long long res=0;\n long long f1=t1*a1,f2=t2*b1;\n long long g1=t1*a2,g2=t2*b2;\n if (f1<g1) {\n swap(f1,g1);\n swap(f2,g2);\n }\n if (f1+f2<g1+g2) {\n res+=2*((f1-g1)/(g1+g2-f1-f2));\n if ((f1-g1)%(g1+g2-f1-f2))\n ++res;\n }\n cout<<res<<endl;\n }\n return 0;\n}\n", "#include<bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\n\nint main()\n{\n vector<ll> t(2), a(2), b(2);\n cin >> t[0] >> t[1] >> a[0] >> a[1] >> b[0] >> b[1];\n if(b[0] > a[0]) {\n swap(a[0], b[0]);\n swap(a[1], b[1]);\n }\n\n ll ad = t[0] * a[0] + t[1] * a[1];\n ll bd = t[0] * b[0] + t[1] * b[1];\n cerr << bd - ad << endl;\n\n if(bd - ad < 0) {\n cout << 0 << endl;\n }\n if(bd - ad == 0) {\n cout << \"infinity\" << endl;\n }\n if(bd - ad > 0) {\n ll sa = a[0] *t[0] - b[0] * t[0];\n cout << (sa / (bd - ad))*2 + 1 - ((sa % (bd - ad)) == 0)<< endl;\n }\n\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<(n); i++)\nint t[2];\nlong long a[2], b[2], c,d;\nint main(){\n\tscanf(\"%d%d%lld%lld%lld%lld\", t,t+1,a,a+1,b,b+1);\n\tc = (a[0]-b[0]) * t[0];\n\td = c + (a[1]-b[1]) * t[1];\n\tif(c > 0) d = -d;\n\telse c = -c;\n\tif(d == 0) puts(\"infinity\");\n\telse if(d < 0) printf(\"0\\n\");\n\telse printf(\"%lld\\n\", c/d*2+(c%d!=0));\n}", "#include <bits/stdc++.h>\ntypedef long long ll;\nusing namespace std;\nll T[2],A[2],B[2],N,D,ans;\n\nint main(void){\n cin >> T[0] >> T[1] >> A[0] >> A[1] >> B[0] >> B[1];\n if(A[0]<B[0]){\n swap(A[0],B[0]);\n swap(A[1],B[1]);\n }\n D = (B[0]*T[0] +B[1]*T[1])-(A[0]*T[0] +A[1]*T[1]);\n //cout << D << endl;\n if(D==0){cout << \"infinity\" << endl;return 0;}\n if(D<0){cout << 0 << endl;return 0;}\n if(D>0){\n N = (T[0]*A[0] - T[0]*B[0])/D;\n ans = N*2+1;\n if((T[0]*A[0] - T[0]*B[0])%D==0)ans--;\n cout << ans << endl;\n }\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n long long v1 = a1 - b1;\n long long v2 = a2 - b2;\n long long x1 = v1 * t1;\n long long x2 = v2 * t2;\n long long T = x1 + x2;\n if(T == 0) cout << \"infinity\" << endl;\n else if((x1>0 && T>0) || (x1<0 && T<0)) cout << 0 << endl;\n else{\n if (x1 < 0) x1 *= -1;\n else T *= -1;\n \n long long n = x1 / T;\n if (x1 % T != 0){\n cout << 2*n+1 << endl;\n }\n else{\n cout << 2*n << endl;\n }\n }\n}\n ", "t,T,a,A,b,B=map(int,open(0).read().split())\nx,y=(b-a)*t,(A-B)*T\nif y-x==0:\n r=\"infinity\"\nelse:\n s,t=divmod(x,y-x)\n r=max(0,s*2+bool(t))\nprint(r)\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll t1,t2,a1,a2,b1,b2;\nint main()\n{\n\n scanf(\"%lld%lld%lld%lld%lld%lld\",&t1,&t2,&a1,&a2,&b1,&b2);\n ll a=a1-b1,b=a2-b2;\n if(a<0) a*=-1,b*=-1;\n ll k=t1*a+t2*b;\n if(k==0) {printf(\"infinity\\n\");return 0;}\n if(k>0){printf(\"0\\n\");return 0;}\n ll ans=a*t1/(-k)-b*t2/(-k);\n if(-b*t2%(-k)==0) ans--;\n printf(\"%lld\\n\",ans);\n}\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\natot1 = (a1 - b1) * t1\natot2 = (a2 - b2) * t2\nif atot1 > 0:\n atot1 *= -1\n atot2 *= -1\n\n\nif atot1 + atot2 < 0:\n print(0)\n exit()\nif atot1 == - atot2:\n print('infinity')\n exit()\nS = (-atot1) // (atot1 + atot2)\nT = (-atot1) % (atot1 + atot2)\nif T != 0:\n print(2 * S + 1)\nelse:\n print(2 * S)\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long t1,t2,a1,a2,b1,b2;\n cin>>t1>>t2;\n cin>>a1>>a2;\n cin>>b1>>b2;\n long long saa=t1*a1-t1*b1;\n long long sab=t2*a2-t2*b2;\n long long sac=saa+sab;\n long long num=abs(saa/sac);\n long long num2=abs(saa%sac);\n if(sac==0){\n cout<<\"infinity\"<<endl;\n }else if(saa>0&&sac>0){\n cout<<\"0\"<<endl;\n }else if(saa<0&&sac<0){\n cout<<\"0\"<<endl;\n }else{\n if(num2==0){\n cout<<2*num<<endl;\n }else{\n cout<<2*num+1<<endl;\n }\n }\n return 0;\n}", "#include<bits/stdc++.h>\n \nusing namespace std;\ntypedef long long ll;\n \nint main(){ \n \n ll t1,t2; cin >> t1 >> t2;\n ll a1,b1,a2,b2; cin >> a1 >> a2 >> b1 >> b2;\n \n if( a1 < b1 ){ swap(a1,b1); swap(a2,b2);}\n \n ll d1 = (a1-b1)*t1; ll d2 = (a2-b2)*t2;\n \n if( d1+d2 > 0){ cout << 0 << endl;}\n else if( d1+d2 == 0 ){ cout <<\"infinity\" << endl;}\n else{\n \n ll k = ceil( (long double)d2/(d1+d2) );\n \n if( d1*k+d2*(k-1) < 0){ cout << 2*k-3 << endl;}\n else{ cout << 2*k-2 << endl;}\n \n }\n \n return 0;\n}", "t1, t2 = map(int,input().split())\na1, a2 = map(int,input().split())\nb1, b2 = map(int,input().split())\n \ndef ispos(x):\n return x==abs(x)\n\nfirst = (a1-b1)*t1\nsecond = (a2-b2)*t2\nnet = first+second\nif net == 0:\n print(\"infinity\")\nelif ispos(first) == ispos(net):\n print(0)\nelse:\n res = 1\n first = -abs(first)\n second = abs(second)\n net = first+second\n res += 2*int(abs(first)/net)\n if first%net == 0:\n res -= 1\n print(res)\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\na3 = a1 * t1 + a2 * t2\nb3 = b1 * t1 + b2 * t2\nif a3 == b3:\n print(\"infinity\")\nelse:\n if a3 < b3:\n a1, a2, a3, b1, b2, b3 = b1, b2, b3, a1, a2, a3\n diff = a3 - b3\n width = (b1 - a1) * t1\n if width < 0:\n print(0)\n else:\n ans = 1\n ans += (width // diff) * 2\n if not width % diff:\n ans -= 1\n print(ans)", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nn1=(b1-a1)*t1\nn2=(b2-a2)*t2\nif n1*n2>0 or abs(n1)>abs(n2):\n print(0)\nelif abs(n1)==abs(n2):\n print('infinity')\nelse:\n c=abs(n1)//abs(n1+n2)\n while (c+1)*abs(n1+n2)<=abs(n1):\n c+=1\n ans=2*c\n if abs(n1)%(abs(n1+n2))!=0:\n ans+=1\n print(ans)", "#include <iostream>\n\nusing namespace std;\n\ntypedef long long ll;\n\n\nint main() {\n ll t1,t2;\n ll a1,a2,b1,b2;\n cin >> t1 >> t2;\n cin >> a1 >> a2;\n cin >> b1 >> b2;\n\n if(t1*a1 < t1*b1) {\n swap(a1,b1);\n swap(a2,b2);\n }\n \n\n ll tmp1 = t1*a1-t1*b1;\n\t\t\t \n ll tmp2 = t1*a1+t2*a2-(t1*b1+t2*b2);\n if(tmp2 == 0) {\n cout << \"infinity\" << endl;\n return 0;\n }\n else if (tmp2 > 0) {\n cout << 0 << endl;\n return 0;\n }\n\n if((tmp1 % (-tmp2)) == 0) {\n cout << (tmp1 / -tmp2) * 2 << endl;\n }\n else {\n cout << (tmp1 / -tmp2) * 2 + 1 << endl;\n }\n}\n", "import java.io.*;\nimport java.util.*;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n FastScanner in;\n PrintWriter out;\n int MOD = (int)1e9+7;\n long ceil(long a, long b){return (a + b - 1) / b;}\n long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}\n long lcm(long a, long b){return a / gcd(a, b) * b;}\n \n void solve() {\n int T1 = in.nextInt(), T2 = in.nextInt();\n long A1 = in.nextLong(), A2 = in.nextLong(), B1 = in.nextLong(), B2 = in.nextLong();\n if((A1 * T1 > B1 * T1 && A1 * T1 + A2 * T2 > B1 * T1 + B2 * T2)){\n out.println(\"0\");\n return;\n }\n \n if((A1 * T1 < B1 * T1 && A1 * T1 + A2 * T2 < B1 * T1 + B2 * T2)){\n out.println(\"0\");\n return;\n }\n \n if((A1 * T1 + A2 * T2) == (B1 * T1 + B2 * T2)){\n out.println(\"infinity\");\n return;\n }\n \n long D1 = (A1 - B1) * T1, D2 = (A2 - B2) * T2;\n if(D1 > 0){\n long c = -(D1 + D2);\n long ans = 0;\n ans += 2 * (D1 / c);\n if(D1 % c != 0) ans++;\n out.println(ans);\n }else{\n long c = (D1 + D2);\n long ans = 0;\n ans += 2 * ((-D1) / c);\n if((-D1) % c != 0) ans++;\n out.println(ans);\n }\n }\n \n public static void main(String[] args) {\n new Main().m();\n }\n\n private void m() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n /*\n try {\n String path = \"output.txt\";\n out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));\n }catch (IOException e){\n e.printStackTrace();\n }\n */\n solve();\n out.flush();\n in.close();\n out.close();\n }\n\n static class FastScanner {\n private Reader input;\n\n public FastScanner() {this(System.in);}\n public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n public void close() {\n try {\n this.input.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n public int nextInt() {return (int) nextLong();}\n\n public long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n\n public double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n\n public char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n\n public String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n\n public String nextLine() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (b != -1 && b != '\\n') {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n\n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n\n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n\n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n\n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n\n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n\n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n\n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tstatic long solve(long T1 , long T2 , long A1 , long A2 , long B1 , long B2){\n\t\tlong LA = T1 * A1 + T2 * A2;\n\t\tlong LB = T1 * B1 + T2 * B2;\n\t\tif(LA == LB){\n\t\t\treturn -1;\n\t\t}\n\t\tif(A1 > B1 && A2 > B2){\n\t\t\treturn 0;\n\t\t}\n\t\tif(B1 > A1 && B2 > A2){\n\t\t\treturn 0;\n\t\t}\n\t\tif(A1 < B1 && A2 > B2){\n\t\t\tif(LA < LB){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tlong lead = LA - LB;\n\t\t\tlong LA1 = T1 * A1;\n\t\t\tlong LB1 = T1 * B1;\t\t\n\t\t\tlong k = (LB1 - LA1) / lead;\n\t\t\tif((LB1 - LA1) % lead == 0){\n\t\t\t\treturn 2 * k;\n\t\t\t}else{\n\t\t\t\treturn 2 * k + 1;\n\t\t\t}\n//\t\t\tSystem.out.println(LA+\" \"+LB+\" \"+(LA - LB)+\" \"+(LB1 - LA1) +\" \"+k);\n//\t\t\treturn 2 * k + 1;\n\t\t}\n\t\tif(A1 > B1 && A2 < B2){\n\t\t\tif(LA > LB){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tlong lead = LB - LA;\n\t\t\tlong LA1 = T1 * A1;\n\t\t\tlong LB1 = T1 * B1;\n\t\t\tlong k = (LA1 - LB1) / lead;\n\t\t\tif((LA1 - LB1) % lead == 0){\n\t\t\t\treturn 2 * k;\n\t\t\t}else{\n\t\t\t\treturn 2 * k + 1;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong T1 = sc.nextLong();\n\t\tlong T2 = sc.nextLong();\n\t\tlong A1 = sc.nextLong();\n\t\tlong A2 = sc.nextLong();\n\t\tlong B1 = sc.nextLong();\n\t\tlong B2 = sc.nextLong();\n\t\tlong ret = solve(T1 , T2 , A1 , A2 , B1, B2);\n\t\tif(ret < 0){\n\t\t\tSystem.out.println(\"infinity\");\n\t\t}else{\n\t\t\tSystem.out.println(ret);\n\t\t}\n\t}\n}\n", "#include<bits/stdc++.h>\n#define puts(x) cout << x << \"\\n\"\nusing namespace std;\nlong long t1, t2, a1, a2, b1, b2;\nint main() {\n\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\ta1 = (a1 - b1) * t1;\n\ta2 = (a2 - b2) * t2;\n\tif (a1 + a2 == 0)puts(\"infinity\");\n\telse if (a1/abs(a1) * a2 > 0 || abs(a1) > abs(a2))puts(0);\n\telse {\n\t\tlong long ans = (abs(a2) / abs(a1 + a2)) * 2 - 1;\n\t\tif (abs(a2) % abs(a1 + a2) == 0)ans--;\n\t\tputs(ans);\n\t}\n}", "s,t = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\na = a1-b1\nb = a2-b2\nif a*b>0:print(0);exit()\nif abs(a)*s ==abs(b)*t:print('infinity');exit()\nelif abs(a)*s >abs(b)*t:print(0);exit()\nif (abs(a)*s)%(abs(b)*t-abs(a)*s):\n print(int(abs(a)*s//(abs(b)*t-abs(a)*s))*2+1)\nelse:\n print(int(abs(a)*s//(abs(b)*t-abs(a)*s))*2)\n", "#include <bits/stdc++.h>\n#define int long long\ntypedef long long ll;\nusing namespace std;\n\nll T1, T2, A1, A2, B1, B2, ans=0, tmp=0;\n\nsigned main(){\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n if(A1*T1+A2*T2==B1*T1+B2*T2) {\n cout << \"infinity\" << endl;\n return 0;\n }\n if(A1>B1&&A2*T2+A1*T1>B2*T2+B1*T1||A1<B1&&A2*T2+A1*T1<B2*T2+B1*T1) {\n cout << 0 << endl;\n return 0;\n }\n ans = abs((A1-B1)*T1)/abs((A1-B1)*T1+(A2-B2)*T2);\n ans = 2*ans+1;\n //cout << ans << endl;\n if(abs((A1-B1)*T1)%abs((A1-B1)*T1+(A2-B2)*T2)==0) {\n ans--;\n }\n cout << ans << endl;\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(){\n ll T1,T2,A1,A2,B1,B2;cin>>T1>>T2>>A1>>A2>>B1>>B2;\n ll C=T1*A1-T1*B1,D=T2*A2-T2*B2,ans=0;\n if(C+D==0){\n \tcout<<\"infinity\"<<endl;\n \treturn 0;\n }\n if(C>0){\n if(C+D<0){\n ans=C/(-C-D)*2;\n if(C%(C+D))ans+=1;\n }\n }\n else{\n if(C+D>0){\n ans=-C/(C+D)*2;\n if(C%(C+D))ans+=1;\n }\n }\n\tcout<<ans<<endl;\n return 0;\n}", "from math import ceil\nt1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\na = t1 * (a1 - b1)\nb = t2 * (a2 - b2)\nif a > 0:\n a *= -1\n b *= -1\nif a + b < 0:\n print(0)\nelif a + b > 0:\n if (-1 * a) % (a + b):\n print(((-1 * a) // (a + b)) * 2 + 1)\n else:\n print((-1 * a) // (a + b) * 2)\nelse:\n print(\"infinity\")", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\np = t1 * (a1-b1)\nn = t2 * (a2-b2)\n\nans = 0\none = p + n\n\nif one == 0:\n ans = \"infinity\"\n\n\nelif one < 0:\n if p > 0:\n ans += (p//(-one)) * 2 + 1\n if p % one == 0:\n ans -= 1\n\nelse:\n if p < 0:\n ans += ((-p) // one) * 2 + 1\n if p % one == 0:\n ans -= 1\n\nprint(ans)\n", "#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nconstexpr int mod=1e9+7;\nsigned main(){\n int t1,t2,a1,a2,b1,b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n a1*=t1,a2*=t2,b1*=t1,b2*=t2;\n a2+=a1,b2+=b1;\n if(a2==b2){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n if(a2<b2){\n swap(a1,b1);\n swap(a2,b2);\n }\n if(a1>b1){\n cout<<0<<endl;\n return 0;\n }\n cout<<(b1-a1)/(a2-b2)*2+!!((b1-a1)%(a2-b2))<<endl;\n}\n", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\n\np=(a1-b1)*t1\nq=(a2-b2)*t2\nif p>0:\n p*=-1\n q*=-1\n\nif p+q<0:\n print(0)\nelif p+q==0:\n print('infinity')\nelse:\n s,t=divmod(-p,p+q)\n if t!=0:\n print(s*2+1)\n else:\n print(s*2)", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <string>\n#include <cmath>\n\nusing ll = long long;\n\nusing namespace std;\n\nint main() {\n long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n long d1 = t1 * (a1 - b1),\n d2 = t2 * (a2 - b2);\n if (d1 == 0 || d1 + d2 == 0) {\n cout << \"infinity\\n\";\n return 0;\n }\n long ab1 = abs(d1),\n ab2 = abs(d1 + d2);\n if (d1 / ab1 == (d1 + d2) / ab2) {\n cout << 0 << '\\n';\n return 0;\n }\n cout << 2 * (ab1 / ab2) + (ab1 % ab2 > 0) << '\\n';\n return 0;\n}", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nAd = A1 * T1 + A2 * T2\nBd = B1 * T1 + B2 * T2\nif Ad == Bd:\n print('infinity')\nelse:\n if Bd > Ad:\n Ad, Bd = Bd, Ad\n A1, B1 = B1, A1\n if A1 > B1:\n print(0)\n else:\n num = (B1 - A1) * T1 // (Ad - Bd)\n if (B1 - A1) * T1 % (Ad - Bd) == 0:\n print(num * 2)\n else:\n print(num * 2 + 1)\n", "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tstatic void solve() {\n\t\tlong[] t = nla(2);\n\t\tlong[] a = nla(2);\n\t\tlong[] b = nla(2);\n\t\t\n\t\tlong xa = 0, xb = 0;\n\t\tfor(int i=0;i<2;i++) {\n\t\t\txa += a[i] * t[i];\n\t\t\txb += b[i] * t[i];\n\t\t}\n\t\tif(xa < xb) {\n\t\t\tlong[] tmp = a; a = b; b = tmp;\n\t\t\tlong tmp2 = xa; xa = xb; xb = tmp2;\n\t\t}\n\t\t\n\t\t//xa > xbで考えてよい\n\t\tlong dx = xa - xb;\n\t\tif(dx == 0) {\n\t\t\tout.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tlong[] sa = new long[2], sb = new long[2];\n\t\tfor(int i=0;i<2;i++) {\n\t\t\tsa[i] = a[i] * t[i];\n\t\t\tsb[i] = b[i] * t[i];\n\t\t}\n\t\tif(sa[0] > sb[0]) {\n\t\t\tout.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong nearX = sb[0] - sa[0];\n\t\tlong ans = nearX / dx * 2 + 1;\n\t\tif(nearX % dx == 0) ans --; \n\t\tout.println(ans);\n\t}\n\t\t\n\n\t//constant\n\tstatic final long mod = (long) 1e9 + 7;\n\tstatic final int dx[] = { -1, 0, 1, 0 }, dy[] = { 0, -1, 0, 1 };\n\tstatic final int[] dx8 = { -1, -1, -1, 0, 0, 1, 1, 1 }, dy8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\tstatic final int inf = Integer.MAX_VALUE / 2;\n\tstatic final long linf = Long.MAX_VALUE / 3;\n\tstatic final double dinf = Double.MAX_VALUE / 3;\n\tstatic final double eps = 1e-10;\n\tstatic final double pi = Math.PI;\n\tstatic StringBuilder sb = new StringBuilder();\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\n\t//libraries\n\tstatic void reverse(int ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tint t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\n\tstatic void reverse(long ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tlong t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\n\tstatic void reverse(double ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tdouble t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\n\tstatic void reverse(char ar[]) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tchar t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\n\tstatic String getReverse(String s) {\n\t\tchar c[] = s.toCharArray();\n\t\treverse(c);\n\t\ts = String.valueOf(c);\n\t\treturn s;\n\t}\n\n\tstatic <T> void reverse(List<T> ls) {\n\t\tint sz = ls.size();\n\t\tfor (int i = 0; i < sz / 2; i++) {\n\t\t\tT t = ls.get(i);\n\t\t\tls.set(i, ls.get(sz - 1 - i));\n\t\t\tls.set(sz - 1 - i, t);\n\t\t}\n\t}\n\n\tstatic <T> void reverse(T[] ar) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tT t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\n\tstatic void sbnl() {//StringBuilderに改行文字をappendする\n\t\tsb.append(\"\\n\");\n\t}\n\n\tstatic int lowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic <T> int lowerBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) >= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic <T> int upperBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) > 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic <T> int rupperBound(List<T> ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) < 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic <T> int rlowerBound(List<T> ls, T x) {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) <= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int[] concat(int x, int arr[]) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\n\tstatic int[] concat(int arr[], int x) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic long[] concat(long x, long arr[]) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\n\tstatic long[] concat(long arr[], long x) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic int max(int x, int y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic int min(int x, int y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic int max(int x, int y, int z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic int min(int x, int y, int z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic long max(long x, long y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic long min(long x, long y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic long max(long x, long y, long z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic long min(long x, long y, long z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic double max(double x, double y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic double min(double x, double y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic double max(double x, double y, double z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic double min(double x, double y, double z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic void sort(int[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(long[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(double[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(char[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void rsort(int[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tint tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(long[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tlong tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(double[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tdouble tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(char[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tchar tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void fill(int arr[], int x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(long arr[], long x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(boolean arr[], boolean x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(double arr[], double x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(int arr[][], int x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(long arr[][], long x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(double arr[][], double x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(boolean arr[][], boolean x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\t//MOD culc\n\tstatic long plus(long x, long y) {\n\t\tlong res = (x + y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long sub(long x, long y) {\n\t\tlong res = (x - y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long mul(long x, long y) {\n\t\tlong res = (x * y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long div(long x, long y) {\n\t\tlong res = x * pow(y, mod - 2) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long pow(long x, long y) {\n\t\tif (y < 0)\n\t\t\treturn 0;\n\t\tif (y == 0)\n\t\t\treturn 1;\n\t\tif (y % 2 == 1)\n\t\t\treturn (x * pow(x, y - 1)) % mod;\n\t\tlong root = pow(x, y / 2);\n\t\treturn root * root % mod;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\t//input\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\n\tprivate static int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate static boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate static int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate static String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate static char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static long[] nla(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\n\tprivate static int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n}\n", "import java.util.*;\nimport java.io.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong T1 = sc.nextLong();\n\t\tlong T2 = sc.nextLong();\n\t\tlong A1 = sc.nextLong();\n\t\tlong A2 = sc.nextLong();\n\t\tlong B1 = sc.nextLong();\n\t\tlong B2 = sc.nextLong();\n\t\tA1 -= B1;\n\t\tA2 -= B2;\n\t\tB1 = 0;\n\t\tB2 = 0;\n\t\t// 何回原点に戻ってくるか？\n\n\t\tif (A1 < 0) {\n\t\t\tA1 *= -1;\n\t\t\tA2 *= -1;\n\t\t}\n\t\tlong d = A1 * T1 + A2 * T2;\n\t\tif (d == 0) {\n\t\t\tSystem.out.println(\"infinity\");\n\t\t\treturn;\n\t\t} else if (d > 0) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\t// long long MAX=9*1e18\n\t\td = Math.abs(d);\n\t\tA2 = Math.abs(A2);\n\t\t// 始点は 0,-d,-2d,..., -md\n\t\t//\n\t\t// A1*T1 <= m*dなるdについて2d-1が答え。\n\t\tlong m = A1 * T1 / d;\n\t\tif (A1 * T1 - (m + 1) * d >= 0)\n\t\t\t++m;\n\t\tint bonus = 0;\n\t\tif (A1 * T1 == m * d)\n\t\t\t++bonus;\n\t\tSystem.out.println(2 * (m + 1) - 1 - bonus);\n\t}\n\n\tvoid tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n\n}\n", "t,T,a,A,b,B=map(int, open(0).read().split())\nx,y=(b-a)*t,(A-B)*T\nif y-x==0:\n r=\"infinity\"\nelse:\n s,t=divmod(x,y-x)\n r=max(0,s*2+(1 if t else 0))\nprint(r)", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main(void){\n ll t[2], a[2], b[2];\n cin >> t[0] >> t[1];\n cin >> a[0] >> a[1];\n cin >> b[0] >> b[1];\n ll am = t[0]*a[0];\n ll bm = t[0]*b[0];\n ll ah = t[0]*a[0] + t[1]*a[1];\n ll bh = t[0]*b[0] + t[1]*b[1];\n if (ah == bh) {\n cout << \"infinity\" << endl;\n return 0;\n }\n if ((am-bm > 0) ^ (ah-bh > 0)) {\n ll dm = abs(am-bm);\n ll dh = abs(ah-bh);\n ll res = (dm/dh)*2+1;\n if (dm % dh == 0) res--;\n cout << res << endl;\n } else {\n cout << 0 << endl;\n }\n return 0;\n}\n", "T1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\n\nif A1<B1:\n A1,B1=B1,A1\n A2,B2=B2,A2\n\nif A2>=B2:\n print(0)\nelse:\n sta=T1*(A1-B1)\n gen=T2*(A2-B2)\n if sta==-gen:\n print(\"infinity\")\n elif sta+gen>0:\n print(0) \n else:\n ans=sta//abs(sta+gen)*2+1\n if sta%abs(sta+gen)==0:\n ans-=1\n print(ans)", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nmid = (A1 - B1) * T1\nend = mid + (A2 - B2) * T2\nif end == 0:\n\tprint(\"infinity\")\nelif mid*end > 0:\n\tprint(0)\nelse:\n\tif mid % end == 0:\n\t\tprint(-2*(int(mid/end)))\n\telse:\n\t\tprint(1-2*(int(mid/end)))", "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n#define MAXN 200002\n#define LL long long\nusing namespace std;\nLL a,b,c,d,t1,t2;\nint main()\n{\n cin>>t1>>t2>>a>>b>>c>>d;\n \n LL A=(a-c)*t1;\n LL B=A+(b-d)*t2;\n \n if(B==0)\n {\n printf(\"infinity\\n\");\n }\n else if((B>0&&A>0)||(B<0&&A<0))\n {\n cout<<0<<endl;\n }\n else\n {\n cout<<-(A/B)*2+(A%B!=0)<<endl;\n }\n \n return 0;\n}\n", "inpl = lambda: list(map(int,input().split()))\nT1, T2 = inpl()\nA1, A2 = inpl()\nB1, B2 = inpl()\nDA = A1*T1 + A2*T2\nDB = B1*T1 + B2*T2\nif DA == DB:\n print('infinity')\n exit()\nelif DB > DA:\n A1, A2, B1, B2, DA, DB = B1, B2, A1, A2, DB, DA\n # swap A & B. DA > DB.\nif A1 > B1:\n print(0)\n exit()\n\ndD = DA - DB\nCA = A1*T1\nCB = B1*T1\ndC = CB - CA\n\nn = dC // dD\nif dC % dD == 0:\n m = 2*n - 1\nelse:\n m = 2*n\nprint(m+1)\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nusing int64 = long long;\n\nint main() {\n int64 T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\n if(A1 < B1) {\n swap(A1, B1);\n swap(A2, B2);\n }\n\n int64 S = T1 * A1 + T2 * A2;\n int64 T = T1 * B1 + T2 * B2;\n\n if(S == T) {\n cout << \"infinity\" << endl;\n } else {\n int64 U = B2 * T2 - A2 * T2;\n if(U % (T - S) == 0) cout << max(U / (T - S) * 2 - 2, 0LL) << endl;\n else cout << max(U / (T - S) * 2 - 1, 0LL) << endl;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ll t[2], a[2], b[2];\n cin >> t[0] >> t[1];\n cin >> a[0] >> a[1];\n cin >> b[0] >> b[1];\n\n ll p = (b[0]-a[0])*t[0];\n ll q = (b[1]-a[1])*t[1];\n if(p + q == 0){\n cout << \"infinity\\n\";\n } else if (abs(q) < abs(p) || (q > 0 && p > 0) || (q < 0 && p < 0)){\n cout << 0 << endl;\n } else {\n ll dx = abs(p + q);\n ll n = abs(p) / dx;\n if(abs(p) == n * dx){\n cout << 2 * n << endl;\n } else {\n cout << 2 * n + 1 << endl;\n }\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main () {\n long long T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n long long a1 = A1*T1, a2 = A2*T2, b1 = B1*T1, b2 = B2*T2;\n if (a1+a2 == b1+b2) {\n puts(\"infinity\");\n return 0;\n }\n if (a1 < b1) {\n swap(a1, b1);\n swap(a2, b2);\n }\n // a1 > b1\n if (a1+a2 > b1+b2) {\n puts(\"0\");\n return 0;\n }\n // a1+a2 < b1+b2\n long long c = (b1+b2)-(a1+a2);\n long long ans = 1;\n ans += ((a1-b1) / c) * 2;\n if ((a1-b1) % c == 0) {\n ans--;\n }\n cout << ans << endl;\n}", "T = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\nif A[0] > B[0]:\n A, B = B, A\n\nif A[1] < B[1]:\n print(0)\n exit()\n\nd = (B[0] - A[0]) * T[0]\nk = (A[1] - B[1]) * T[1] - d\n\nif k < 0:\n print(0)\n exit()\n\nif k == 0:\n print(\"infinity\")\n exit()\n\nans = 1 + (d // k) * 2\nif d // k == d / k:\n ans -= 1\n\nprint(ans)", "a,b,c,d,e,f=map(int,open(0).read().split());g,h=(c-e)*a,(d-f)*b\nif g>0:g,h=-g,-h\ni=g+h\nif i<0:print(0)\nelif i==0:print(\"infinity\")\nelse:print(2*(-g//i)+[0,1][int(bool(-g%i))])", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\n\nif (a1<b1 and a2<b2) or (a1>b1 and a2>b2):\n print(0)\n exit()\n\nif a1 > b1:\n a1,b1 = b1,a1\n a2,b2 = b2,a2\n\n_b1 = b1 - a1\n_a2 = a2 - b2\n\nv1 = t1*_b1\nv2 = t2*_a2\n\nif v1 == v2:\n print('infinity')\n exit()\n\nif v1 > v2:\n print(0)\n exit()\n\nd = v2 - v1\nk = v1 // d\n\nans = k*2 + 1\nif v2*k == v1*(k+1):\n ans -= 1\nprint(ans)", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\n\nif t1*a1+t2*a2 == t1*b1+t2*b2 or a1 == b1:\n print('infinity')\n exit()\n\nif a1 < b1:\n a1,b1 = b1,a1\n a2,b2 = b2,a2\n\n\n\nif a1*t1 + a2*t2 > b1*t1+b2*t2:\n print(0)\n exit()\n\nres = 1\na = a1*t1\nb = b1*t1\n#Aの方が上\njudge = True\n\nc = a1*t1-b1*t1\nd = -c - a2*t2 + b2*t2\n\nif d > c:\n print(1)\n exit()\n\nif c%d == 0:\n res -= 1\n\nres += (c//d)*2\n\nprint(res)\n", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll t1, t2;\n ll a1, a2;\n ll b1, b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n a1 *= t1; a2 *= t2;\n b1 *= t1; b2 *= t2;\n a2 += a1;\n b2 += b1;\n if (a2 == b2) {\n puts(\"infinity\");\n return 0;\n }\n if (a2 < b2) {\n swap(a1,b1);\n swap(a2,b2);\n }\n ll d = a2-b2;\n ll c = b1-a1;\n ll ans = 0;\n if (c > 0) {\n ans = (c-1)/d+1;\n ans *= 2;\n ans--;\n if (c%d == 0) ans++;\n }\n cout << ans << endl;\n return 0;\n}", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nv1, v2 = b1 - a1, b2 - a2\nx1, x2 = t1 * v1, t2 * v2\nif x1 + x2 == 0:\n print('infinity')\nelse:\n if x1 < 0:\n x1, x2 = [x1 * -1, x2 * -1]\n\n if x1 + x2 > 0:\n print(0)\n else:\n dx = abs(x1 + x2)\n c = (x1 // dx) * 2 + 1\n if x1 % dx == 0:\n c -= 1\n \n print(c)", "\n\n\nimport java.awt.Point;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.FileOutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintStream;\nimport java.io.PrintWriter;\nimport java.io.Serializable;\nimport java.util.AbstractList;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.Iterator;\nimport java.util.Locale;\nimport java.util.Map.Entry;\nimport java.util.NoSuchElementException;\nimport java.util.RandomAccess;\nimport java.util.Set;\nimport java.util.function.BinaryOperator;\nimport java.util.function.UnaryOperator;\n\npublic class Main implements Runnable{\n\n\tprivate void solve(FastIO io, String[] args) {\n\t\t/*\n\t\t * author: 31536000\n\t\t * 三井住友信託銀行プログラミングコンテスト2019 F問題\n\t\t * 考察メモ\n\t\t * まず、T1A1+T2A2が高橋くんの周期、T1B1+T2B2が青木くんの周期\n\t\t * これが同値の場合、必ずT1+T2ごとに出会うのでinfinity\n\t\t * そうでない場合を考える\n\t\t * そうでない場合、必ずどちらかが早い\n\t\t * 仮に青木君の方が早いとして考える(そうじゃなきゃ入れ替えときゃ良いので)\n\t\t * この時、4通りに場合分けできる\n\t\t * 1. A1<B1, A2<B2\n\t\t * これは無理ね、もう追いつけない\n\t\t * 2. A1>B1, A2<B2\n\t\t * これはT1+T2の移動で1回だけ追い抜かされてから追い抜き返す形、2回出会う(初手だけ-1を忘れずに！)\n\t\t * で、T1+T2の移動で青木君がD(=T1B1+T2B2-T1A1-T2A2)だけ進むとする\n\t\t * そうすると、最終的にDx≧T1A1-T1B1となる時が来る\n\t\t * そうするともう高橋くんは追いつけないので、これで終わり(ただし同値があるなら1回増える)\n\t\t * 3. A1<B1, A2>B2\n\t\t * これは追いつけないね(最初で抜かして、その後も追いつけず終わってるので)\n\t\t * 4. A1>B1, A2>B2\n\t\t * 仮定に反するので無いです\n\t\t *\n\t\t * よって2のケース以外は答えは0\n\t\t *\n\t\t */\n\t\tlong T1 = io.nextLong(), T2 = io.nextLong();\n\t\tlong A1 = io.nextLong(), A2 = io.nextLong(), B1 = io.nextLong(), B2 = io.nextLong();\n\t\tif (T1 * A1 + T2 * A2 == T1 * B1 + T2 *B2) { // 無限回\n\t\t\tio.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif (T1 * A1 + T2 * A2 > T1 * B1 + T2 *B2) { // 入れ替え\n\t\t\tA1 ^= B1;\n\t\t\tB1 ^= A1;\n\t\t\tA1 ^= B1;\n\t\t\tA2 ^= B2;\n\t\t\tB2 ^= A2;\n\t\t\tA2 ^= B2;\n\t\t} // 以下、T1A1 + T2A2 < T1B1 + T2B2 …つまり青木君の方が早い\n\t\tif (A1 > B1 && A2 < B2) {\n\t\t\tlong D = T1 * B1 + T2 * B2 - T1 * A1 - T2 * A2; // T1+T2で広がる差\n\t\t\tlong x = (T1 * A1 - T1 * B1) / D; // x >= (T1 * A1 - T1 * B1) / D, なお同値なら少し変わる\n\t\t\tif (D * x == T1 * A1 - T1 * B1) {\n\t\t\t\tio.println(2 * x);\n\t\t\t} else {\n\t\t\t\tio.println(2 * x + 1);\n\t\t\t}\n\t\t} else {\n\t\t\tio.println(0);\n\t\t}\n\n\t}\n\n\t/** デバッグ用コードのお供に */\n\tprivate static boolean DEBUG = false;\n\t/** 確保するメモリの大きさ(単位: MB)*/\n\tprivate static final long MEMORY = 64;\n\tprivate final FastIO io;\n\tprivate final String[] args;\n\n\tpublic static void main(String[] args) {\n\t Thread.setDefaultUncaughtExceptionHandler((t, e) -> e.printStackTrace());\n\t new Thread(null, new Main(args), \"\", MEMORY * 1048576).start();\n\t}\n\n\tpublic Main(String[] args) {\n\t\tthis(new FastIO(), args);\n\t}\n\n\tpublic Main(FastIO io, String... args) {\n\t\tthis.io = io;\n\t\tthis.args = args;\n\t\tif (DEBUG) io.setAutoFlush(true);\n\t}\n\n\t@Override\n\tpublic void run() {\n\t\tsolve(io, args);\n\t\tio.flush();\n\t}\n\n\t// 以下、ライブラリ\n\n\t/**\n\t * 高速な入出力を提供します。\n\t * @author 31536000\n\t *\n\t */\n\tpublic static class FastIO {\n\t\tprivate InputStream in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int read = 0;\n\t\tprivate int length = 0;\n\t\tprivate PrintWriter out;\n\t\tprivate PrintWriter err;\n\t\tprivate boolean autoFlush = false;\n\n\t\tpublic FastIO() {\n\t\t\tthis(System.in, System.out, System.err);\n\t\t}\n\n\t\tpublic FastIO(InputStream in, PrintStream out, PrintStream err) {\n\t\t\tthis.in = in;\n\t\t\tthis.out = new PrintWriter(out, false);\n\t\t\tthis.err = new PrintWriter(err, false);\n\t\t}\n\n\t\tpublic final void setInputStream(InputStream in) {\n\t\t\tthis.in = in;\n\t\t}\n\n\t\tpublic final void setInputStream(File in) {\n\t\t\ttry {\n\t\t\t\tthis.in = new FileInputStream(in);\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic final void setOutputStream(PrintStream out) {\n\t\t\tthis.out = new PrintWriter(out, false);\n\t\t}\n\n\t\tpublic final void setOutputStream(File out) {\n\t\t\ttry {\n\t\t\t\tthis.out = new PrintWriter(new FileOutputStream(out), false);\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic final void setErrorStream(PrintStream err) {\n\t\t\tthis.err = new PrintWriter(err, false);\n\t\t}\n\n\t\tpublic final void setErrorStream(File err) {\n\t\t\ttry {\n\t\t\t\tthis.err = new PrintWriter(new FileOutputStream(err), false);\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tpublic final void setAutoFlush(boolean flush) {\n\t\t\tautoFlush = flush;\n\t\t}\n\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (read < length) return true;\n\t\t\tread = 0;\n\t\t\ttry {\n\t\t\t\tlength = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn length > 0;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\treturn hasNextByte() ? buffer[read++] : -1;\n\t\t}\n\n\t\tprivate static boolean isPrintableChar(int c) {\n\t\t\treturn 33 <= c && c <= 126;\n\t\t}\n\n\t\tprivate static boolean isNumber(int c) {\n\t\t\treturn '0' <= c && c <= '9';\n\t\t}\n\n\t\tpublic final boolean hasNext() {\n\t\t\twhile (hasNextByte() && !isPrintableChar(buffer[read])) read++;\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic final char nextChar() {\n\t\t\tif (!hasNextByte()) throw new NoSuchElementException();\n\t\t\treturn (char)readByte();\n\t\t}\n\n\t\tpublic final char[][] nextChar(int height) {\n\t\t\tchar[][] ret = new char[height][];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = next().toCharArray();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final String next() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b;\n\t\t\twhile (isPrintableChar(b = readByte())) sb.appendCodePoint(b);\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic final String nextLine() {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b;\n\t\t\twhile(!isPrintableChar(b = readByte()));\n\t\t\tdo sb.appendCodePoint(b); while(isPrintableChar(b = readByte()) || b == ' ');\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic final long nextLong() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif (!isNumber(b)) throw new NumberFormatException();\n\t\t\twhile (true) {\n\t\t\t\tif (isNumber(b)) {\n\t\t\t\t\tn *= 10;\n\t\t\t\t\tn += b - '0';\n\t\t\t\t} else if (b == -1 || !isPrintableChar(b)) return minus ? -n : n;\n\t\t\t\telse throw new NumberFormatException();\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tpublic final int nextInt() {\n\t\t\tlong nl = nextLong();\n\t\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\t\treturn (int) nl;\n\t\t}\n\n\t\tpublic final double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic final int[] nextInt(int width) {\n\t\t\tint[] ret = new int[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextInt();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final int[] nextInts() {\n\t\t\treturn nextInts(\" \");\n\t\t}\n\n\t\tpublic final int[] nextInts(String parse) {\n\t\t\tString[] get = nextLine().split(parse);\n\t\t\tint[] ret = new int[get.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = Integer.valueOf(get[i]);\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final long[] nextLong(int width) {\n\t\t\tlong[] ret = new long[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextLong();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final long[] nextLongs() {\n\t\t\treturn nextLongs(\" \");\n\t\t}\n\n\t\tpublic final long[] nextLongs(String parse) {\n\t\t\tString[] get = nextLine().split(parse);\n\t\t\tlong[] ret = new long[get.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = Long.valueOf(get[i]);\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final int[][] nextInt(int width, int height) {\n\t\t\tint[][] ret = new int[height][width];\n\t\t\tfor (int i = 0, j;i < height;++ i) for (j = 0;j < width;++ j) ret[i][j] = nextInt();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final long[][] nextLong(int width, int height) {\n\t\t\tlong[][] ret = new long[height][width];\n\t\t\tfor (int i = 0, j;i < height;++ i) for (j = 0;j < width;++ j) ret[j][i] = nextLong();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final boolean[] nextBoolean(char T) {\n\t\t\tchar[] s = next().toCharArray();\n\t\t\tboolean[] ret = new boolean[s.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = s[i] == T;\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final boolean[][] nextBoolean(char T, int height) {\n\t\t\tboolean[][] ret = new boolean[height][];\n\t\t\tfor (int i = 0;i < ret.length;++ i) {\n\t\t\t\tchar[] s = next().toCharArray();\n\t\t\t\tret[i] = new boolean[s.length];\n\t\t\t\tfor (int j = 0;j < ret[i].length;++ j) ret[i][j] = s[j] == T;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic final Point nextPoint() {\n\t\t\treturn new Point(nextInt(), nextInt());\n\t\t}\n\n\t\tpublic final Point[] nextPoint(int width) {\n\t\t\tPoint[] ret = new Point[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextPoint();\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tprotected void finalize() throws Throwable {\n\t\t\ttry {\n\t\t\t\tsuper.finalize();\n\t\t\t} finally {\n\t\t\t\tin.close();\n\t\t\t\tout.close();\n\t\t\t\terr.close();\n\t\t\t}\n\t\t}\n\n\t\tpublic final boolean print(boolean b) {\n\t\t\tout.print(b);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn b;\n\t\t}\n\n\t\tpublic final Object print(boolean b, Object t, Object f) {\n\t\t\treturn b ? print(t) : print(f);\n\t\t}\n\n\t\tpublic final char print(char c) {\n\t\t\tout.print(c);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic final char[] print(char[] s) {\n\t\t\tout.print(s);\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic final double print(double d) {\n\t\t\tout.print(d);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic final double print(double d, int length) {\n\t\t\tif (d < 0) {\n\t\t\t\tout.print('-');\n\t\t\t\td = -d;\n\t\t\t}\n\t\t\td += Math.pow(10, -length) / 2;\n\t\t\tout.print((long)d);\n\t\t\tout.print('.');\n\t\t\td -= (long)d;\n\t\t\tfor (int i = 0;i < length;++ i) {\n\t\t\t\td *= 10;\n\t\t\t\tout.print((int)d);\n\t\t\t\td -= (int)d;\n\t\t\t}\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic final float print(float f) {\n\t\t\tout.print(f);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn f;\n\t\t}\n\n\t\tpublic final int print(int i) {\n\t\t\tout.print(i);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic final long print(long l) {\n\t\t\tout.print(l);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic final Object print(Object obj) {\n\t\t\tif (obj.getClass().isArray()) {\n\t\t\t\tif (obj instanceof boolean[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof byte[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof short[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof int[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof long[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof float[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof double[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof char[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof Object[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse print(obj, \" \");\n\t\t\t} else {\n\t\t\t\tout.print(obj);\n\t\t\t\tif (autoFlush) flush();\n\t\t\t}\n\t\t\treturn obj;\n\t\t}\n\n\t\tpublic final String print(String s) {\n\t\t\tout.print(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic final Object print(Object array, String... parse) {\n\t\t\tprint(array, 0, parse);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn array;\n\t\t}\n\n\t\tprivate final Object print(Object array, int check, String... parse) {\n\t\t\tif (check >= parse.length) {\n\t\t\t\tif (array.getClass().isArray()) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\t\tprint(array);\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tString str = parse[check];\n\t\t\tif (array instanceof Object[]) {\n\t\t\t\tObject[] obj = (Object[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0], check + 1, parse);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i], check + 1, parse);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tif (array instanceof Collection) {\n\t\t\t\tIterator<?> iter = ((Collection<?>)array).iterator();\n\t\t\t\tif (!iter.hasNext()) return array;\n\t\t\t\tprint(iter.next(), check + 1, parse);\n\t\t\t\twhile(iter.hasNext()) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(iter.next(), check + 1, parse);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tif (!array.getClass().isArray()) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\tif (check != parse.length - 1) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\tif (array instanceof boolean[]) {\n\t\t\t\tboolean[] obj = (boolean[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof byte[]) {\n\t\t\t\tbyte[] obj = (byte[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t} else if (array instanceof short[]) {\n\t\t\t\tshort[] obj = (short[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof int[]) {\n\t\t\t\tint[] obj = (int[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof long[]) {\n\t\t\t\tlong[] obj = (long[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof float[]) {\n\t\t\t\tfloat[] obj = (float[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof double[]) {\n\t\t\t\tdouble[] obj = (double[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof char[]) {\n\t\t\t\tchar[] obj = (char[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else throw new AssertionError();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic final Object[] print(String parse, Object... args) {\n\t\t\tprint(args[0]);\n\t\t\tfor (int i = 1;i < args.length;++ i) {\n\t\t\t\tprint(parse);\n\t\t\t\tprint(args[i]);\n\t\t\t}\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic final Object[] printf(String format, Object... args) {\n\t\t\tout.printf(format, args);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic final Object printf(Locale l, String format, Object... args) {\n\t\t\tout.printf(l, format, args);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic final void println() {\n\t\t\tout.println();\n\t\t\tif (autoFlush) flush();\n\t\t}\n\n\t\tpublic final boolean println(boolean b) {\n\t\t\tout.println(b);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn b;\n\t\t}\n\n\t\tpublic final Object println(boolean b, Object t, Object f) {\n\t\t\treturn b ? println(t) : println(f);\n\t\t}\n\n\t\tpublic final char println(char c) {\n\t\t\tout.println(c);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic final char[] println(char[] s) {\n\t\t\tout.println(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic final double println(double d) {\n\t\t\tout.println(d);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic final double println(double d, int length) {\n\t\t\tprint(d, length);\n\t\t\tprintln();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic final float println(float f) {\n\t\t\tout.println(f);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn f;\n\t\t}\n\n\t\tpublic final int println(int i) {\n\t\t\tout.println(i);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic final long println(long l) {\n\t\t\tout.println(l);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic final Object println(Object obj) {\n\t\t\tprint(obj);\n\t\t\tprintln();\n\t\t\treturn obj;\n\t\t}\n\n\t\tpublic final String println(String s) {\n\t\t\tout.println(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic final Object println(Object array, String... parse) {\n\t\t\tprint(array, parse);\n\t\t\tprintln();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic final boolean debug(boolean b) {\n\t\t\terr.print(b);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn b;\n\t\t}\n\n\t\tpublic final Object debug(boolean b, Object t, Object f) {\n\t\t\treturn b ? debug(t) : debug(f);\n\t\t}\n\n\t\tpublic final char debug(char c) {\n\t\t\terr.print(c);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic final char[] debug(char[] s) {\n\t\t\terr.print(s);\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic final double debug(double d) {\n\t\t\terr.print(d);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic final double debug(double d, int length) {\n\t\t\tif (d < 0) {\n\t\t\t\terr.print('-');\n\t\t\t\td = -d;\n\t\t\t}\n\t\t\td += Math.pow(10, -length) / 2;\n\t\t\terr.print((long)d);\n\t\t\terr.print('.');\n\t\t\td -= (long)d;\n\t\t\tfor (int i = 0;i < length;++ i) {\n\t\t\t\td *= 10;\n\t\t\t\terr.print((int)d);\n\t\t\t\td -= (int)d;\n\t\t\t}\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic final float debug(float f) {\n\t\t\terr.print(f);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn f;\n\t\t}\n\n\t\tpublic final int debug(int i) {\n\t\t\terr.print(i);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic final long debug(long l) {\n\t\t\terr.print(l);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic final Object debug(Object obj) {\n\t\t\tif (obj.getClass().isArray()) {\n\t\t\t\tif (obj instanceof boolean[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof byte[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof short[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof int[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof long[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof float[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof double[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof char[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof Object[][]) debug(obj, \"\\n\", \" \");\n\t\t\t\telse debug(obj, \" \");\n\t\t\t} else {\n\t\t\t\terr.print(obj);\n\t\t\t\tif (autoFlush) flush();\n\t\t\t}\n\t\t\treturn obj;\n\t\t}\n\n\t\tpublic final String debug(String s) {\n\t\t\terr.print(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic final Object debug(Object array, String... parse) {\n\t\t\tdebug(array, 0, parse);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn array;\n\t\t}\n\n\t\tprivate final Object debug(Object array, int check, String... parse) {\n\t\t\tif (check >= parse.length) {\n\t\t\t\tif (array.getClass().isArray()) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\t\tdebug(array);\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tString str = parse[check];\n\t\t\tif (array instanceof Object[]) {\n\t\t\t\tObject[] obj = (Object[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0], check + 1, parse);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i], check + 1, parse);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tif (array instanceof Collection) {\n\t\t\t\tIterator<?> iter = ((Collection<?>)array).iterator();\n\t\t\t\tif (!iter.hasNext()) return array;\n\t\t\t\tdebug(iter.next(), check + 1, parse);\n\t\t\t\twhile(iter.hasNext()) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(iter.next(), check + 1, parse);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tif (!array.getClass().isArray()) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\tif (check != parse.length - 1) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\tif (array instanceof boolean[]) {\n\t\t\t\tboolean[] obj = (boolean[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof byte[]) {\n\t\t\t\tbyte[] obj = (byte[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i]);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t} else if (array instanceof short[]) {\n\t\t\t\tshort[] obj = (short[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof int[]) {\n\t\t\t\tint[] obj = (int[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof long[]) {\n\t\t\t\tlong[] obj = (long[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof float[]) {\n\t\t\t\tfloat[] obj = (float[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof double[]) {\n\t\t\t\tdouble[] obj = (double[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof char[]) {\n\t\t\t\tchar[] obj = (char[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tdebug(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tdebug(str);\n\t\t\t\t\tdebug(obj[i]);\n\t\t\t\t}\n\t\t\t} else throw new AssertionError();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic final Object[] debug(String parse, Object... args) {\n\t\t\tdebug(args[0]);\n\t\t\tfor (int i = 1;i < args.length;++ i) {\n\t\t\t\tdebug(parse);\n\t\t\t\tdebug(args[i]);\n\t\t\t}\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic final Object[] debugf(String format, Object... args) {\n\t\t\terr.printf(format, args);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic final Object debugf(Locale l, String format, Object... args) {\n\t\t\terr.printf(l, format, args);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic final void debugln() {\n\t\t\terr.println();\n\t\t\tif (autoFlush) flush();\n\t\t}\n\n\t\tpublic final boolean debugln(boolean b) {\n\t\t\terr.println(b);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn b;\n\t\t}\n\n\t\tpublic final Object debugln(boolean b, Object t, Object f) {\n\t\t\treturn b ? debugln(t) : debugln(f);\n\t\t}\n\n\t\tpublic final char debugln(char c) {\n\t\t\terr.println(c);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic final char[] debugln(char[] s) {\n\t\t\terr.println(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic final double debugln(double d) {\n\t\t\terr.println(d);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic final double debugln(double d, int length) {\n\t\t\tdebug(d, length);\n\t\t\tdebugln();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic final float debugln(float f) {\n\t\t\terr.println(f);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn f;\n\t\t}\n\n\t\tpublic final int debugln(int i) {\n\t\t\terr.println(i);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic final long debugln(long l) {\n\t\t\terr.println(l);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic final Object debugln(Object obj) {\n\t\t\tdebug(obj);\n\t\t\tdebugln();\n\t\t\treturn obj;\n\t\t}\n\n\t\tpublic final String debugln(String s) {\n\t\t\terr.println(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic final Object debugln(Object array, String... parse) {\n\t\t\tdebug(array, parse);\n\t\t\tdebugln();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic final void flush() {\n\t\t\tout.flush();\n\t\t\terr.flush();\n\t\t}\n\t}\n\n\tpublic enum BoundType {\n\t\tCLOSED, OPEN;\n\t}\n\n\tpublic static class Range<C> implements Serializable{\n\n\t\tprivate static final long serialVersionUID = -4702828934863023392L;\n\t\tprotected C lower;\n\t\tprotected C upper;\n\t\tprotected BoundType lowerType;\n\t\tprotected BoundType upperType;\n\t\tprivate Comparator<? super C> comparator;\n\n\t\tprotected Range(C lower, BoundType lowerType, C upper, BoundType upperType) {\n\t\t\tthis(lower, lowerType, upper, upperType, null);\n\t\t}\n\n\t\tprotected Range(C lower, BoundType lowerType, C upper, BoundType upperType, Comparator<? super C> comparator) {\n\t\t\tthis.lower = lower;\n\t\t\tthis.upper = upper;\n\t\t\tthis.lowerType = lowerType;\n\t\t\tthis.upperType = upperType;\n\t\t\tthis.comparator = comparator;\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> range(C lower, BoundType lowerType, C upper, BoundType upperType) {\n\t\t\tif (lower != null && upper != null) {\n\t\t\t\tint comp = lower.compareTo(upper);\n\t\t\t\tif (comp > 0) return new Range<C>(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))return new Range<C>(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t}\n\t\t\treturn new Range<C>(lower, lowerType, upper, upperType);\n\t\t}\n\n\t\tpublic static <C> Range<C> range(C lower, BoundType lowerType, C upper, BoundType upperType, Comparator<? super C> comparator) {\n\t\t\tif (lower != null && upper != null) {\n\t\t\t\tint comp = comparator.compare(lower, upper);\n\t\t\t\tif (comp > 0) return new Range<C>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN)) return new Range<C>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t\t}\n\t\t\treturn new Range<C>(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> all() {\n\t\t\treturn range((C)null, BoundType.OPEN, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static <C> Range<C> all(Comparator<? super C> comparator) {\n\t\t\treturn range((C)null, BoundType.OPEN, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> atMost(C upper) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static <C> Range<C> atMost(C upper, Comparator<? super C> comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> lessThan(C upper) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static <C> Range<C> lessThan(C upper, Comparator<? super C> comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> downTo(C upper, BoundType boundType) {\n\t\t\treturn range(null, BoundType.OPEN, upper, boundType);\n\t\t}\n\n\t\tpublic static <C> Range<C> downTo(C upper, BoundType boundType, Comparator<? super C> comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, boundType, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> atLeast(C lower) {\n\t\t\treturn range(lower, BoundType.CLOSED, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static <C> Range<C> atLeast(C lower, Comparator<? super C> comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> greaterThan(C lower) {\n\t\t\treturn range(lower, BoundType.OPEN, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static <C> Range<C> greaterThan(C lower, Comparator<? super C> comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> upTo(C lower, BoundType boundType) {\n\t\t\treturn range(lower, boundType, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static <C> Range<C> upTo(C lower, BoundType boundType, Comparator<? super C> comparator) {\n\t\t\treturn range(lower, boundType, null, BoundType.OPEN, comparator );\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> open(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static <C> Range<C> open(C lower, C upper, Comparator<? super C> comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> openClosed(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static <C> Range<C> openClosed(C lower, C upper, Comparator<? super C> comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> closedOpen(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static <C> Range<C> closedOpen(C lower, C upper, Comparator<? super C> comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> closed(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static <C> Range<C> closed(C lower, C upper, Comparator<? super C> comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> singleton(C value) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static <C> Range<C> singleton(C value, Comparator<? super C> comparator) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> empty() {\n\t\t\treturn range((C)null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static <C> Range<C> empty(Comparator<? super C> comparator) {\n\t\t\treturn range((C)null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> Range<C> encloseAll(Iterable<C> values) {\n\t\t\tC lower = values.iterator().next();\n\t\t\tC upper = lower;\n\t\t\tfor (C i : values) {\n\t\t\t\tif (lower.compareTo(i) > 0) lower = i;\n\t\t\t\tif (upper.compareTo(i) < 0) upper = i;\n\t\t\t}\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static <C> Range<C> encloseAll(Iterable<C> values, Comparator<? super C> comparator) {\n\t\t\tC lower = values.iterator().next();\n\t\t\tC upper = lower;\n\t\t\tfor (C i : values) {\n\t\t\t\tif (comparator.compare(lower, i) > 0) lower = i;\n\t\t\t\tif (comparator.compare(upper, i) < 0) upper = i;\n\t\t\t}\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tprotected int compareLower(C value) {\n\t\t\treturn compareLower(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareLower(C value, BoundType boundType) {\n\t\t\treturn compareLower(lower, lowerType, value, boundType);\n\t\t}\n\n\t\tprotected int compareLower(C lower, BoundType lowerType, C value) {\n\t\t\treturn compareLower(lower, lowerType, value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareLower(C lower, BoundType lowerType, C value, BoundType boundType) {\n\t\t\tif (lower == null) return value == null ? 0 : -1;\n\t\t\telse if (value == null) return 1;\n\t\t\tint compare;\n\t\t\tif (comparator == null) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tComparable<C> comp = (Comparable<C>)lower;\n\t\t\t\tcompare = comp.compareTo(value);\n\t\t\t} else compare = comparator.compare(lower, value);\n\t\t\tif (compare == 0) {\n\t\t\t\tif (lowerType == BoundType.CLOSED) -- compare;\n\t\t\t\tif (boundType == BoundType.CLOSED) ++ compare;\n\t\t\t}\n\t\t\treturn compare;\n\t\t}\n\n\t\tprotected int compareUpper(C value) {\n\t\t\treturn compareUpper(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareUpper(C value, BoundType boundType) {\n\t\t\treturn compareUpper(upper, upperType, value, boundType);\n\t\t}\n\n\t\tprotected int compareUpper(C upper, BoundType upperType, C value) {\n\t\t\treturn compareUpper(upper, upperType, value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareUpper(C upper, BoundType upperType, C value, BoundType boundType) {\n\t\t\tif (upper == null) return value == null ? 0 : 1;\n\t\t\tif (value == null) return -1;\n\t\t\tint compare;\n\t\t\tif (comparator == null) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tComparable<C> comp = (Comparable<C>)upper;\n\t\t\t\tcompare = comp.compareTo(value);\n\t\t\t} else compare = comparator.compare(upper, value);\n\t\t\tif (compare == 0) {\n\t\t\t\tif (upperType == BoundType.CLOSED) ++ compare;\n\t\t\t\tif (boundType == BoundType.CLOSED) -- compare;\n\t\t\t}\n\t\t\treturn compare;\n\t\t}\n\n\t\tpublic boolean hasLowerBound() {\n\t\t\treturn lower != null;\n\t\t}\n\n\t\tpublic C lowerEndpoint() {\n\t\t\tif (hasLowerBound()) return lower;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic BoundType lowerBoundType() {\n\t\t\tif (hasLowerBound()) return lowerType;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic boolean hasUpperBound() {\n\t\t\treturn upper != null;\n\t\t}\n\n\t\tpublic C upperEndpoint() {\n\t\t\tif (hasUpperBound()) return upper;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic BoundType upperBoundType() {\n\t\t\tif (hasUpperBound()) return upperType;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\t/**\n\t\t * この区間が空集合か判定します。\n\t\t * @return 空集合ならばtrue\n\t\t */\n\t\tpublic boolean isEmpty() {\n\t\t\treturn lower == null && upper == null && lowerType == BoundType.CLOSED;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間の左側に位置するか判定します。<br>\n\t\t * 接する場合は区間の左側ではないと判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間の左側に位置するならtrue\n\t\t */\n\t\tpublic boolean isLess(C value) {\n\t\t\treturn isLess(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected boolean isLess(C value, BoundType boundType) {\n\t\t\treturn compareLower(value, boundType) > 0;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間の右側に位置するか判定します。<br>\n\t\t * 接する場合は区間の右側ではないと判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間の右側に位置するならtrue\n\t\t */\n\t\tpublic boolean isGreater(C value) {\n\t\t\treturn isGreater(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprivate boolean isGreater(C value, BoundType boundType) {\n\t\t\treturn compareUpper(value, boundType) < 0;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間内に位置するか判定します。<br>\n\t\t * 接する場合も区間内に位置すると判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間内に位置するならtrue\n\t\t */\n\t\tpublic boolean contains(C value) {\n\t\t\treturn !isLess(value) && !isGreater(value) && !isEmpty();\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数すべてが区間内に位置するか判定します。<br>\n\t\t * 接する場合も区間内に位置すると判定します。\n\t\t * @param value 調べる要素\n\t\t * @return 全ての要素が区間内に位置するならtrue\n\t\t */\n\t\tpublic boolean containsAll(Iterable<? extends C> values) {\n\t\t\tfor (C i : values) if (!contains(i)) return false;\n\t\t\treturn true;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた区間がこの区間に内包されるか判定します。<br>\n\t\t *\n\t\t * @param other\n\t\t * @return 与えられた区間がこの区間に内包されるならtrue\n\t\t */\n\t\tpublic boolean encloses(Range<C> other) {\n\t\t\treturn !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);\n\t\t}\n\n\t\t/**\n\t\t * 与えられた区間がこの区間と公差するか判定します。<br>\n\t\t * 接する場合は公差するものとします。\n\t\t * @param value 調べる引数\n\t\t * @return 区間が交差するならtrue\n\t\t */\n\t\tpublic boolean isConnected(Range<C> other) {\n\t\t\tif (this.isEmpty() || other.isEmpty()) return false;\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(other.lower, other.lowerType)) {\n\t\t\t\tlower = other.lower;\n\t\t\t\tlowerType = other.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(other.upper, other.upperType)) {\n\t\t\t\tupper = other.upper;\n\t\t\t\tupperType = other.upperType;\n\t\t\t} else {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t}\n\t\t\tif (lower == null || upper == null) return true;\n\t\t\tint comp = compareLower(lower, lowerType, upper, upperType);\n\t\t\treturn comp <= 0;\n\t\t}\n\t\t/**\n\t\t * この区間との積集合を返します。\n\t\t * @param connectedRange 積集合を求める区間\n\t\t * @return 積集合\n\t\t */\n\t\tpublic Range<C> intersection(Range<C> connectedRange) {\n\t\t\tif (this.isEmpty() || connectedRange.isEmpty()) {\n\t\t\t\tif (comparator == null) return new Range<C>(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t\treturn empty(comparator);\n\t\t\t}\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(connectedRange.lower, connectedRange.lowerType)) {\n\t\t\t\tlower = connectedRange.lower;\n\t\t\t\tlowerType = connectedRange.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(connectedRange.upper, connectedRange.upperType)) {\n\t\t\t\tupper = connectedRange.upper;\n\t\t\t\tupperType = connectedRange.upperType;\n\t\t\t} else {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t}\n\t\t\tif (comparator == null) {\n\t\t\t\treturn new Range<C>(lower, lowerType, upper, upperType);\n\t\t\t}\n\t\t\treturn range(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\t/**\n\t\t * この区間との和集合を返します。\n\t\t * @param other 和集合を求める区間\n\t\t * @return 和集合\n\t\t */\n\t\tpublic Range<C> span(Range<C> other) {\n\t\t\tif (other.isEmpty()) return new Range<C>(lower, lowerType, upper, upperType);\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(other.lower, other.lowerType)) {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = other.lower;\n\t\t\t\tlowerType = other.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(other.upper, other.upperType)) {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t} else {\n\t\t\t\tupper = other.upper;\n\t\t\t\tupperType = other.upperType;\n\t\t\t}\n\t\t\treturn new Range<C>(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object object) {\n\t\t\tif (this == object) return true;\n\t\t\tif (object instanceof Range) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tRange<C> comp = (Range<C>) object;\n\t\t\t\treturn compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0 && lowerType == comp.lowerType && upperType == comp.upperType;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tif (lower == null && upper == null) return 0;\n\t\t\telse if (lower == null) return upper.hashCode();\n\t\t\telse if (upper == null) return lower.hashCode();\n\t\t\treturn lower.hashCode() ^ upper.hashCode();\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\tif (isEmpty()) return \"()\";\n\t\t\treturn (lowerType == BoundType.OPEN ? \"(\" : \"[\") + (lower == null ? \"\" : lower.toString()) + \"..\" + (upper == null ? \"\" : upper.toString()) + (upperType == BoundType.OPEN ? \")\" : \"]\");\n\t\t}\n\t}\n\n\tpublic static class IterableRange<C> extends Range<C> implements Iterable<C>{\n\n\t\tprivate static final long serialVersionUID = 9065915259748260688L;\n\t\tprotected UnaryOperator<C> func;\n\n\t\tprotected IterableRange(C lower, BoundType lowerType, C upper, BoundType upperType, UnaryOperator<C> func) {\n\t\t\tsuper(lower, lowerType, upper, upperType);\n\t\t\tthis.func = func;\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> IterableRange<C> range(C lower, BoundType lowerType, C upper, BoundType upperType, UnaryOperator<C> func) {\n\t\t\tif (lower == null || upper == null) return new IterableRange<C>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\tint comp = lower.compareTo(upper);\n\t\t\tif (comp > 0) return new IterableRange<C>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN)) return new IterableRange<C>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn new IterableRange<C>(lower, lowerType, upper, upperType, func);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> IterableRange<C> open(C lower, C upper, UnaryOperator<C> func) {\n\t\t\tif (lower == null) return new IterableRange<C>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> IterableRange<C> openClosed(C lower, C upper, UnaryOperator<C> func) {\n\t\t\tif (lower == null) return new IterableRange<C>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> IterableRange<C> closedOpen(C lower, C upper, UnaryOperator<C> func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> IterableRange<C> closed(C lower, C upper, UnaryOperator<C> func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static <C extends Comparable<? super C>> IterableRange<C> singleton(C value, UnaryOperator<C> func) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);\n\t\t}\n\n\t\tprotected class Iter implements Iterator<C> {\n\t\t\tC now;\n\t\t\tIter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn !isGreater(now);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final C next() {\n\t\t\t\tC ret = now;\n\t\t\t\tnow = func.apply(now);\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\tprotected class EmptyIter implements Iterator<C> {\n\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic C next() {\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator<C> iterator() {\n\t\t\treturn lower == null || upper == null ? new EmptyIter() : new Iter();\n\t\t}\n\n\t\tpublic int getDistance() {\n\t\t\tC check = upper;\n\t\t\tint ret = 0;\n\t\t\twhile (lower != check) {\n\t\t\t\tcheck = func.apply(check);\n\t\t\t\t++ ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\tpublic static class IntRange extends IterableRange<Integer>{\n\n\t\tprivate static final long serialVersionUID = 5623995336491967216L;\n\t\tprivate final boolean useFastIter;\n\n\t\tprivate static class Next implements UnaryOperator<Integer> {\n\n\t\t\t@Override\n\t\t\tpublic Integer apply(Integer value) {\n\t\t\t\treturn value + 1;\n\t\t\t}\n\t\t}\n\n\t\tprotected IntRange() {\n\t\t\tsuper(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());\n\t\t\tuseFastIter = true;\n\t\t}\n\n\t\tprotected IntRange(UnaryOperator<Integer> func) {\n\t\t\tsuper(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\tuseFastIter = false;\n\t\t}\n\n\t\tprotected IntRange(int lower, BoundType lowerType, int upper, BoundType upperType) {\n\t\t\tsuper(lower, lowerType, upper, upperType, new Next());\n\t\t\tuseFastIter = true;\n\t\t}\n\n\t\tprotected IntRange(int lower, BoundType lowerType, int upper, BoundType upperType, UnaryOperator<Integer> func) {\n\t\t\tsuper(lower, lowerType, upper, upperType, func);\n\t\t\tuseFastIter = false;\n\t\t}\n\n\t\tpublic static IntRange range(int lower, BoundType lowerType, int upper, BoundType upperType) {\n\t\t\tif (lower > upper) return new IntRange();\n\t\t\tif (lowerType == BoundType.OPEN) ++ lower;\n\t\t\tif (upperType == BoundType.OPEN) -- upper;\n\t\t\treturn new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange range(int lower, BoundType lowerType, int upper, BoundType upperType, UnaryOperator<Integer> func) {\n\t\t\tif (lower > upper) return new IntRange(func);\n\t\t\tif (lowerType == BoundType.OPEN) ++ lower;\n\t\t\tif (upperType == BoundType.OPEN) -- upper;\n\t\t\treturn new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange open(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange open(int lower, int upper, UnaryOperator<Integer> func) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange open(int upper) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange open(int upper, UnaryOperator<Integer> func) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange openClosed(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange openClosed(int lower, int upper, UnaryOperator<Integer> func) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange closedOpen(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange closedOpen(int lower, int upper, UnaryOperator<Integer> func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange closed(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange closed(int lower, int upper, UnaryOperator<Integer> func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange closed(int upper) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange closed(int upper, UnaryOperator<Integer> func) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange singleton(int value) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange singleton(int value, UnaryOperator<Integer> func) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);\n\t\t}\n\n\t\tprivate class FastIter implements Iterator<Integer> {\n\t\t\tint now;\n\t\t\tpublic FastIter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn now <= upper;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final Integer next() {\n\t\t\t\treturn now++;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\tprivate class Iter implements Iterator<Integer> {\n\t\t\tint now;\n\t\t\tpublic Iter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn now <= upper;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final Integer next() {\n\t\t\t\tint ret = now;\n\t\t\t\tnow = func.apply(now);\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator<Integer> iterator() {\n\t\t\treturn lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();\n\t\t}\n\n\t\t@Override\n\t\tpublic int getDistance() {\n\t\t\tint ret = upper - lower;\n\t\t\tif (upperType == BoundType.CLOSED) ++ ret;\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic int getClosedLower() {\n\t\t\treturn lower;\n\t\t}\n\n\t\tpublic int getOpenLower() {\n\t\t\treturn lower - 1;\n\t\t}\n\n\t\tpublic int getClosedUpper() {\n\t\t\treturn upperType == BoundType.CLOSED ? upper : upper - 1;\n\t\t}\n\n\t\tpublic int getOpenUpper() {\n\t\t\treturn upperType == BoundType.CLOSED ? upper + 1 : upper;\n\t\t}\n\t}\n\n\t/**\n\t * 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t */\n\tpublic interface Associative<T> extends BinaryOperator<T>{\n\t\t/**\n\t\t * repeat個のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数、1以上であること\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tif (repeat < 1) throw new IllegalArgumentException(\"undefined operation\");\n\t\t\tT ret = element;\n\t\t\t-- repeat;\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t */\n\tpublic interface Inverse<T> extends BinaryOperator<T>{\n\t\tpublic T inverse(T element);\n\t}\n\n\t/**\n\t * 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t */\n\tpublic interface Commutative<T> extends BinaryOperator<T>{\n\n\t}\n\n\t/**\n\t * 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t */\n\tpublic interface Identity<T> extends BinaryOperator<T>{\n\t\t/**\n\t\t * 単位元を返します。\n\t\t * @return 単位元\n\t\t */\n\t\tpublic T identity();\n\t}\n\n\t/**\n\t * 演算が群であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t */\n\tpublic interface Group<T> extends Monoid<T>, Inverse<T>{\n\t\t/**\n\t\t * repeat個のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\t@Override\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tT ret = identity();\n\t\t\tif (repeat < 0) {\n\t\t\t\trepeat = -repeat;\n\t\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\t\treturn inverse(ret);\n\t\t\t}\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t * 演算がモノイドであることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t */\n\tpublic interface Monoid<T> extends Associative<T>, Identity<T> {\n\t\t/**\n\t\t * repeat個のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数、0以上であること\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\t@Override\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tif (repeat < 0) throw new IllegalArgumentException(\"undefined operation\");\n\t\t\tT ret = identity();\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t * 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t */\n\tpublic interface CommutativeMonoid<T> extends Monoid<T>, Commutative<T> {\n\n\t}\n\n\t/**\n\t * 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t */\n\tpublic interface Abelian<T> extends Group<T>, CommutativeMonoid<T> {\n\n\t}\n\n\t/**\n\t * 演算が半環であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface Semiring<T, A extends CommutativeMonoid<T>, M extends Monoid<T>> {\n\t\tpublic A getAddition();\n\t\tpublic M getMultiplication();\n\t\tpublic default T add(T left, T right) {\n\t\t\treturn getAddition().apply(left, right);\n\t\t}\n\n\t\tpublic default T multiply(T left, T right) {\n\t\t\treturn getMultiplication().apply(left, right);\n\t\t}\n\n\t\tpublic default T additiveIdentity() {\n\t\t\treturn getAddition().identity();\n\t\t}\n\n\t\tpublic default T multipleIdentity() {\n\t\t\treturn getMultiplication().identity();\n\t\t}\n\n\t\tpublic default int characteristic() {\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t/**\n\t * 演算が環であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface Ring<T, A extends Abelian<T>, M extends Monoid<T>> extends Semiring<T, A, M>{\n\n\t}\n\n\t/**\n\t * 演算が可換環に属することを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface CommutativeRing<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends Ring<T, A, M>{\n\n\t}\n\n\t/**\n\t * 演算が整域であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface IntegralDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends CommutativeRing<T, A, M>{\n\t\tpublic boolean isDivisible(T left, T right);\n\t\tpublic T divide(T left, T right);\n\t}\n\n\t/**\n\t * 演算が整閉整域であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface IntegrallyClosedDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends IntegralDomain<T, A, M>{\n\n\t}\n\n\t/**\n\t * 演算がGCD整域であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface GCDDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends IntegrallyClosedDomain<T, A, M>{\n\t\tpublic T gcd(T left, T right);\n\t\tpublic T lcm(T left, T right);\n\t}\n\n\t/**\n\t * 素元を提供します。\n\t * @author 31536000\n\t *\n\t * @param <T> 演算の型\n\t */\n\tpublic static class PrimeElement<T> {\n\t\tpublic final T element;\n\t\tpublic PrimeElement(T element) {\n\t\t\tthis.element = element;\n\t\t}\n\t}\n\n\tpublic interface MultiSet<E> extends Collection<E>{\n\t\tpublic int add(E element, int occurrences);\n\t\tpublic int count(Object element);\n\t\tpublic Set<E> elementSet();\n\t\tpublic boolean remove(Object element, int occurrences);\n\t\tpublic int setCount(E element, int count);\n\t\tpublic boolean setCount(E element, int oldCount, int newCount);\n\t}\n\n\t/**\n\t * 演算が一意分解整域であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface UniqueFactorizationDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends GCDDomain<T, A, M>{\n\t\tpublic MultiSet<PrimeElement<T>> PrimeFactorization(T x);\n\t}\n\n\t/**\n\t * 演算が主イデアル整域であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface PrincipalIdealDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends UniqueFactorizationDomain<T, A, M> {\n\n\t}\n\n\t/**\n\t * 演算がユークリッド整域であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface EuclideanDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends PrincipalIdealDomain<T, A, M>{\n\t\tpublic T reminder(T left, T right);\n\t}\n\n\t/**\n\t * 演算が体であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param <T> 二項演算の型\n\t * @param <A> 和に関する演算\n\t * @param <M> 積に関する演算\n\t */\n\tpublic interface Field<T, A extends Abelian<T>, M extends Abelian<T>> extends EuclideanDomain<T, A, M>{\n\t\t@Override\n\t\tpublic default boolean isDivisible(T left, T right) {\n\t\t\treturn !right.equals(additiveIdentity());\n\t\t}\n\n\t\t@Override\n\t\tpublic default T divide(T left, T right) {\n\t\t\tif (isDivisible(left, right)) throw new ArithmeticException(\"divide by Additive Identify\");\n\t\t\treturn multiply(left, getMultiplication().inverse(right));\n\t\t}\n\n\t\t@Override\n\t\tpublic default T reminder(T left, T right) {\n\t\t\tif (isDivisible(left, right)) throw new ArithmeticException(\"divide by Additive Identify\");\n\t\t\treturn additiveIdentity();\n\t\t}\n\n\t\t@Override\n\t\tpublic default T gcd(T left, T right) {\n\t\t\treturn multipleIdentity();\n\t\t}\n\n\t\t@Override\n\t\tpublic default T lcm(T left, T right) {\n\t\t\treturn multipleIdentity();\n\t\t}\n\n\t\t@Override\n\t\tpublic default MultiSet<PrimeElement<T>> PrimeFactorization(T x) {\n\t\t\tHashMultiSet<PrimeElement<T>> ret = HashMultiSet.create(1);\n\t\t\tret.add(new PrimeElement<T>(x));\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\tpublic static class HashMultiSet<E> implements MultiSet<E>, Serializable{\n\n\t\tprivate static final long serialVersionUID = -8378919645386251159L;\n\t\tprivate final transient HashMap<E, Integer> map;\n\t\tprivate transient int size;\n\n\t\tprivate HashMultiSet() {\n\t\t\tmap = new HashMap<>();\n\t\t\tsize = 0;\n\t\t}\n\n\t\tprivate HashMultiSet(int distinctElements) {\n\t\t\tmap = new HashMap<>(distinctElements);\n\t\t\tsize = 0;\n\t\t}\n\n\t\tpublic static <E> HashMultiSet<E> create() {\n\t\t\treturn new HashMultiSet<>();\n\t\t}\n\n\t\tpublic static <E> HashMultiSet<E> create(int distinctElements) {\n\t\t\treturn new HashMultiSet<>(distinctElements);\n\t\t}\n\n\t\tpublic static <E> HashMultiSet<E> create(Iterable<? extends E> elements) {\n\t\t\tHashMultiSet<E> ret = new HashMultiSet<>();\n\t\t\tfor (E i : elements) ret.map.compute(i, (v, e) -> e == null ? 1 : ++e);\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic int size() {\n\t\t\treturn size;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean isEmpty() {\n\t\t\treturn size == 0;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean contains(Object o) {\n\t\t\treturn map.containsKey(o);\n\t\t}\n\n\t\tprivate class Iter implements Iterator<E> {\n\n\t\t\tprivate final Iterator<Entry<E, Integer>> iter = map.entrySet().iterator();\n\t\t\tprivate E value;\n\t\t\tprivate int count = 0;\n\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\tif (count > 0) return true;\n\t\t\t\tif (iter.hasNext()) {\n\t\t\t\t\tEntry<E, Integer> entry = iter.next();\n\t\t\t\t\tvalue = entry.getKey();\n\t\t\t\t\tcount = entry.getValue();\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic E next() {\n\t\t\t\t-- count;\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator<E> iterator() {\n\t\t\treturn new Iter();\n\t\t}\n\n\t\t@Override\n\t\tpublic Object[] toArray() {\n\t\t\tObject[] ret = new Object[size];\n\t\t\tint read = 0;\n\t\t\tfor (Entry<E, Integer> i : map.entrySet()) Arrays.fill(ret, read, read += i.getValue(), i.getKey());\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic <T> T[] toArray(T[] a) {\n\t\t\tObject[] src = toArray();\n\t\t\tif (a.length < src.length) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tT[] ret = (T[])Arrays.copyOfRange(src, 0, src.length, a.getClass());\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tSystem.arraycopy(src, 0, a, 0, src.length);\n\t\t\treturn a;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean add(E e) {\n\t\t\tadd(e, 1);\n\t\t\treturn true;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean remove(Object o) {\n\t\t\treturn remove(o, 1);\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean containsAll(Collection<?> c) {\n\t\t\tboolean ret = true;\n\t\t\tfor (Object i : c) ret |= contains(i);\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean addAll(Collection<? extends E> c) {\n\t\t\tboolean ret = false;\n\t\t\tfor (E i : c) ret |= add(i);\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean removeAll(Collection<?> c) {\n\t\t\tboolean ret = false;\n\t\t\tfor (Object i : c) ret |= remove(i);\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean retainAll(Collection<?> c) {\n\t\t\treturn removeAll(c);\n\t\t}\n\n\t\t@Override\n\t\tpublic void clear() {\n\t\t\tmap.clear();\n\t\t\tsize = 0;\n\t\t}\n\n\t\t@Override\n\t\tpublic int add(E element, int occurrences) {\n\t\t\tsize += occurrences;\n\t\t\treturn map.compute(element, (k, v) -> v == null ? occurrences : v + occurrences) - occurrences;\n\t\t}\n\n\t\t@Override\n\t\tpublic int count(Object element) {\n\t\t\treturn map.getOrDefault(element, 0);\n\t\t}\n\n\t\t@Override\n\t\tpublic Set<E> elementSet() {\n\t\t\treturn map.keySet();\n\t\t}\n\n\t\tpublic Set<Entry<E, Integer>> entrySet() {\n\t\t\treturn map.entrySet();\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean remove(Object element, int occurrences) {\n\t\t\ttry {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tE put = (E) element;\n\t\t\t\treturn map.compute(put, (k, v) -> {\n\t\t\t\t\tif (v == null) return null;\n\t\t\t\t\tif (v < occurrences) {\n\t\t\t\t\t\tsize -= v;\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tsize -= occurrences;\n\t\t\t\t\treturn v - occurrences;\n\t\t\t\t}) != null;\n\t\t\t} catch (ClassCastException E) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic int setCount(E element, int count) {\n\t\t\tInteger ret = map.put(element, count);\n\t\t\tint ret2 = ret == null ? 0 : ret;\n\t\t\tsize += count - ret2;\n\t\t\treturn ret2;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean setCount(E element, int oldCount, int newCount) {\n\t\t\tboolean ret = map.replace(element, oldCount, newCount);\n\t\t\tif (ret) size += newCount - oldCount;\n\t\t\treturn ret;\n\t\t}\n\n\t}\n\n\tpublic static class ModInteger extends Number implements Field<ModInteger, Abelian<ModInteger>, Abelian<ModInteger>>{\n\n\t\tprivate static final long serialVersionUID = -8595710127161317579L;\n\t\tprivate final int mod;\n\t\tprivate int num;\n\n\t\tprivate final Addition add;\n\t\tprivate final Multiplication mul;\n\n\t\tprivate class Addition implements Abelian<ModInteger> {\n\n\t\t\t@Override\n\t\t\tpublic ModInteger identity() {\n\t\t\t\treturn new ModInteger(mod, 0);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger inverse(ModInteger element) {\n\t\t\t\treturn new ModInteger(element, element.mod - element.num);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger apply(ModInteger left, ModInteger right) {\n\t\t\t\treturn new ModInteger(left).addEqual(right);\n\t\t\t}\n\t\t}\n\n\t\tprivate class Multiplication implements Abelian<ModInteger> {\n\n\t\t\t@Override\n\t\t\tpublic ModInteger identity() {\n\t\t\t\treturn new ModInteger(mod, 1);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger apply(ModInteger left, ModInteger right) {\n\t\t\t\treturn new ModInteger(left).multiplyEqual(right);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger inverse(ModInteger element) {\n\t\t\t\treturn new ModInteger(element, element.inverse(element.num));\n\t\t\t}\n\n\t\t}\n\n\t\t@Override\n\t\tpublic int characteristic() {\n\t\t\treturn mod;\n\t\t}\n\n\t\tpublic ModInteger(int mod) {\n\t\t\tthis.mod = mod;\n\t\t\tnum = 0;\n\t\t\tadd = new Addition();\n\t\t\tmul = new Multiplication();\n\t\t}\n\n\t\tpublic ModInteger(int mod, int num) {\n\t\t\tthis.mod = mod;\n\t\t\tthis.num = validNum(num);\n\t\t\tadd = new Addition();\n\t\t\tmul = new Multiplication();\n\t\t}\n\n\t\tpublic ModInteger(ModInteger n) {\n\t\t\tmod = n.mod;\n\t\t\tnum = n.num;\n\t\t\tadd = n.add;\n\t\t\tmul = n.mul;\n\t\t}\n\n\t\tprivate ModInteger(ModInteger n, int num) {\n\t\t\tmod = n.mod;\n\t\t\tthis.num = num;\n\t\t\tadd = n.add;\n\t\t\tmul = n.mul;\n\t\t}\n\n\t\tprivate int validNum(int n) {\n\t\t\tn %= mod;\n\t\t\tif (n < 0) n += mod;\n\t\t\treturn n;\n\t\t}\n\n\t\tprivate int validNum(long n) {\n\t\t\tn %= mod;\n\t\t\tif (n < 0) n += mod;\n\t\t\treturn (int)n;\n\t\t}\n\n\t\tprotected int inverse(int n) {\n\t\t\tint m = mod, u = 0, v = 1, t;\n\t\t\twhile(n != 0) {\n\t\t\t\tt = m / n;\n\t\t\t\tm -= t * n;\n\t\t\t\tu -= t * v;\n\t\t\t\tif (m != 0) {\n\t\t\t\t\tt = n / m;\n\t\t\t\t\tn -= t * m;\n\t\t\t\t\tv -= t * u;\n\t\t\t\t} else {\n\t\t\t\t\tv %= mod;\n\t\t\t\t\tif (v < 0) v += mod;\n\t\t\t\t\treturn v;\n\t\t\t\t}\n\t\t\t}\n\t\t\tu %= mod;\n\t\t\tif (u < 0) u += mod;\n\t\t\treturn u;\n\t\t}\n\n\t\tpublic boolean isPrime(int n) {\n\t\t\tif ((n & 1) == 0) return false; // 偶数\n\t\t\tfor (int i = 3, j = 8, k = 9;k <= n;i += 2, k += j += 8) if (n % i == 0) return false;\n\t\t\treturn true;\n\t\t}\n\n\t\t@Override\n\t\tpublic int intValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic long longValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic float floatValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic double doubleValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\tprotected ModInteger getNewInstance(ModInteger mod) {\n\t\t\treturn new ModInteger(mod);\n\t\t}\n\n\t\tpublic ModInteger add(int n) {\n\t\t\treturn getNewInstance(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger add(long n) {\n\t\t\treturn getNewInstance(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger add(ModInteger n) {\n\t\t\treturn getNewInstance(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger addEqual(int n) {\n\t\t\tnum = validNum(num + n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger addEqual(long n) {\n\t\t\tnum = validNum(num + n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger addEqual(ModInteger n) {\n\t\t\tif ((num += n.num) >= mod) num -= mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtract(int n) {\n\t\t\treturn getNewInstance(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtract(long n) {\n\t\t\treturn getNewInstance(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtract(ModInteger n) {\n\t\t\treturn getNewInstance(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(int n) {\n\t\t\tnum = validNum(num - n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(long n) {\n\t\t\tnum = validNum(num - n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(ModInteger n) {\n\t\t\tif ((num -= n.num) < 0) num += mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger multiply(int n) {\n\t\t\treturn getNewInstance(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiply(long n) {\n\t\t\treturn getNewInstance(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiply(ModInteger n) {\n\t\t\treturn getNewInstance(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(int n) {\n\t\t\tnum = (int)((long)num * n % mod);\n\t\t\tif (num < 0) num += mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(long n) {\n\t\t\treturn multiplyEqual((int) (n % mod));\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(ModInteger n) {\n\t\t\tnum = (int)((long)num * n.num % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger divide(int n) {\n\t\t\treturn getNewInstance(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divide(long n) {\n\t\t\treturn getNewInstance(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divide(ModInteger n) {\n\t\t\treturn getNewInstance(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divideEqual(int n) {\n\t\t\tnum = (int)((long)num * inverse(validNum(n)) % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger divideEqual(long n) {\n\t\t\treturn divideEqual((int)(n % mod));\n\t\t}\n\n\t\tpublic ModInteger divideEqual(ModInteger n) {\n\t\t\tnum = (int)((long)num * n.inverse(n.num) % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger pow(int n) {\n\t\t\treturn getNewInstance(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger pow(long n) {\n\t\t\treturn getNewInstance(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger pow(ModInteger n) {\n\t\t\treturn getNewInstance(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger powEqual(int n) {\n\t\t\tlong ans = 1, num = this.num;\n\t\t\tif (n < 0) {\n\t\t\t\tn = -n;\n\t\t\t\twhile (n != 0) {\n\t\t\t\t\tif ((n & 1) != 0) ans = ans * num % mod;\n\t\t\t\t\tn >>>= 1;\n\t\t\tnum = num * num % mod;\n\t\t\t\t}\n\t\t\t\tthis.num = inverse((int)ans);\n\t\t\t\treturn this;\n\t\t\t}\n\t\t\twhile (n != 0) {\n\t\t\t\tif ((n & 1) != 0) ans = ans * num % mod;\n\t\t\t\tn >>>= 1;\n\t\t\t\t\tnum = num * num % mod;\n\t\t\t}\n\t\t\tthis.num = (int)ans;\n\t\t\treturn this;\n\t\t}\n\t\tpublic ModInteger powEqual(long n) {\n\t\t\treturn powEqual((int)(n % (mod - 1)));\n\t\t}\n\n\t\tpublic ModInteger powEqual(ModInteger n) {\n\t\t\tlong num = this.num;\n\t\t\tthis.num = 1;\n\t\t\tint mul = n.num;\n\t\t\twhile (mul != 0) {\n\t\t\t\tif ((mul & 1) != 0) this.num *= num;\n\t\t\t\tmul >>>= 1;\n\t\t\t\tnum *= num;\n\t\t\t\tnum %= mod;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(int n) {\n\t\t\tnum = validNum(n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(long n) {\n\t\t\tnum = validNum(n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(ModInteger n) {\n\t\t\tnum = n.num;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic int toInt() {\n\t\t\treturn num;\n\t\t}\n\n\t\tpublic int getMod() {\n\t\t\treturn mod;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object x) {\n\t\t\tif (x instanceof ModInteger) return ((ModInteger)x).num == num && ((ModInteger)x).mod == mod;\n\t\t\treturn false;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn num ^ mod;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn String.valueOf(num);\n\t\t}\n\n\t\t@Deprecated\n\t\tpublic String debug() {\n\t\t\tint min = num, ans = 1;\n\t\t\tfor (int i = 2;i < min;++ i) {\n\t\t\t\tint tmp = multiply(i).num;\n\t\t\t\tif (min > tmp) {\n\t\t\t\t\tmin = tmp;\n\t\t\t\t\tans = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min + \"/\" + ans;\n\t\t}\n\n\t\t@Override\n\t\tpublic Addition getAddition() {\n\t\t\treturn add;\n\t\t}\n\n\t\t@Override\n\t\tpublic Multiplication getMultiplication() {\n\t\t\treturn mul;\n\t\t}\n\t}\n\n\t/**\n\t * 素数を法とする演算上で、組み合わせの計算を高速に行います。\n\t * @author 31536000\n\t *\n\t */\n\tpublic static class ModUtility {\n\t\tprivate final int mod;\n\t\tprivate int[] fact, inv, invfact;\n\n\t\t/**\n\t\t * modを法として、演算を行います。\n\t\t * @param mod 法とする素数\n\t\t */\n\t\tpublic ModUtility(Prime mod) {\n\t\t\tthis(mod, 2);\n\t\t}\n\n\t\t/**\n\t\t * modを法として、演算を行います。\n\t\t * @param mod 法とする素数\n\t\t * @param calc 予め前計算しておく大きさ\n\t\t */\n\t\tpublic ModUtility(Prime mod, int calc) {\n\t\t\tthis.mod = mod.prime;\n\t\t\tprecalc(calc);\n\t\t}\n\n\t\t/**\n\t\t * calcの大きさだけ、前計算を行います。\n\t\t * @param calc 前計算をする大きさ\n\t\t */\n\t\tpublic void precalc(int calc) {\n\t\t\t++ calc;\n\t\t\tif (calc < 2) calc = 2;\n\t\t\tfact = new int[calc];\n\t\t\tinv = new int[calc];\n\t\t\tinvfact = new int[calc];\n\t\t\tfact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;\n\t\t\tfor (int i = 2;i < calc;++ i) {\n\t\t\t\tfact[i] = (int)((long)fact[i - 1] * i % mod);\n\t\t\t\tinv[i] = (int)(mod - (long)inv[mod % i] * (mod / i) % mod);\n\t\t\t\tinvfact[i] = (int)((long)invfact[i - 1] * inv[i] % mod);\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * modを法とする剰余環上で振舞う整数を返します。\n\t\t * @return modを法とする整数、初期値は0\n\t\t */\n\t\tpublic ModInteger create() {\n\t\t\treturn new ModInt();\n\t\t}\n\n\t\t/**\n\t\t * modを法とする剰余環上で振舞う整数を返します。\n\t\t * @param n 初期値\n\t\t * @return modを法とする整数\n\t\t */\n\t\tpublic ModInteger create(int n) {\n\t\t\treturn new ModInt(n);\n\t\t}\n\n\t\tprivate class ModInt extends ModInteger {\n\n\t\t\tprivate static final long serialVersionUID = -2435281861935422575L;\n\n\t\t\tpublic ModInt() {\n\t\t\t\tsuper(mod);\n\t\t\t}\n\n\t\t\tpublic ModInt(int n) {\n\t\t\t\tsuper(mod, n);\n\t\t\t}\n\n\t\t\tpublic ModInt(ModInteger mod) {\n\t\t\t\tsuper(mod);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tprotected ModInteger getNewInstance(ModInteger mod) {\n\t\t\t\treturn new ModInt(mod);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tprotected int inverse(int n) {\n\t\t\t\treturn ModUtility.this.inverse(n);\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * modを法として、nの逆元を返します。<br>\n\t\t * 計算量はO(log n)です。\n\t\t * @param n 逆元を求めたい値\n\t\t * @return 逆元\n\t\t */\n\t\tpublic int inverse(int n) {\n\t\t\ttry {\n\t\t\t\tif (inv.length > n) return inv[n];\n\t\t\t\t int m = mod, u = 0, v = 1, t;\n\t\t\t\t while(n != 0) {\n\t\t\t\t\t t = m / n;\n\t\t\t\t\t m -= t * n;\n\t\t\t\t\t u -= t * v;\n\t\t\t\t\t if (m != 0) {\n\t\t\t\t\t\t t = n / m;\n\t\t\t\t\t\t n -= t * m;\n\t\t\t\t\t\t v -= t * u;\n\t\t\t\t\t } else {\n\t\t\t\t\t\t v %= mod;\n\t\t\t\t\t\t if (v < 0) v += mod;\n\t\t\t\t\t\t return v;\n\t\t\t\t\t }\n\t\t\t\t }\n\t\t\t\t u %= mod;\n\t\t\t\t if (u < 0) u += mod;\n\t\t\t\t return u;\n\t\t\t} catch (ArrayIndexOutOfBoundsException e) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * n!を、modを法として求めた値を返します。<br>\n\t\t * 計算量はO(n)です。\n\t\t * @param n 階乗を求めたい値\n\t\t * @return nの階乗をmodで割った余り\n\t\t */\n\t\tpublic int factorial(int n) {\n\t\t\ttry {\n\t\t\t\tif (fact.length > n) return fact[n];\n\t\t\t\tlong ret = fact[fact.length - 1];\n\t\t\t\tfor (int i = fact.length;i <= n;++ i) ret = ret * i % mod;\n\t\t\t\treturn (int)ret;\n\t\t\t} catch (ArrayIndexOutOfBoundsException e) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * nPkをmodで割った余りを求めます。<br>\n\t\t * 計算量はO(n-k)です。\n\t\t * @param n 左辺\n\t\t * @param k 右辺\n\t\t * @return nPkをmodで割った余り\n\t\t */\n\t\tpublic int permutation(int n, int k) {\n\t\t\tif (k < 0) throw new IllegalArgumentException();\n\t\t\tif (n < k) return 0;\n\t\t\tif (fact.length > n) return (int)((long)fact[n] * invfact[n - k] % mod);\n\t\t\tlong ret = 1;\n\t\t\tfor (int i = n - k + 1;i <= n;++ i) ret = ret * i % mod;\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\t/**\n\t\t * nCkをmodで割った余りを求めます。<br>\n\t\t * 計算量はO(n-k)です。\n\t\t * @param n 左辺\n\t\t * @param k 右辺\n\t\t * @return nCkをmodで割った余り\n\t\t */\n\t\tpublic int combination(int n, int k) {\n\t\t\tif (k < 0) throw new IllegalArgumentException();\n\t\t\tif (n < k) return 0;\n\t\t\tif (fact.length > n) return (int)((long)fact[n] * invfact[k] % mod * invfact[n - k] % mod);\n\t\t\tlong ret = 1;\n\t\t\tif (n < 2 * k) k = n - k;\n\t\t\tif (invfact.length > k) ret = invfact[k];\n\t\t\telse ret = inverse(factorial(k));\n\t\t\tfor (int i = n - k + 1;i <= n;++ i) ret = ret * i % mod;\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\t/**\n\t\t * 他項係数をmodで割った余りを求めます。<br>]\n\t\t * 計算量はO(n)です。\n\t\t * @param n 左辺\n\t\t * @param k 右辺、合計がn以下である必要がある\n\t\t * @return 他項係数\n\t\t */\n\t\tpublic int multinomial(int n, int... k) {\n\t\t\tint sum = 0;\n\t\t\tfor (int i : k) sum += i;\n\t\t\tlong ret = factorial(n);\n\t\t\tif (fact.length > n) {\n\t\t\t\tfor (int i : k) {\n\t\t\t\t\tif (i < 0) throw new IllegalArgumentException();\n\t\t\t\t\tret = ret * invfact[i] % mod;\n\t\t\t\t\tsum += i;\n\t\t\t\t}\n\t\t\t\tif (sum > n) return 0;\n\t\t\t\tret = ret * invfact[n - sum] % mod;\n\t\t\t} else {\n\t\t\t\tfor (int i : k) {\n\t\t\t\t\tif (i < 0) throw new IllegalArgumentException();\n\t\t\t\t\tif (invfact.length > i) ret = ret * invfact[i] % mod;\n\t\t\t\t\telse ret = ret * inverse(factorial(i)) % mod;\n\t\t\t\t\tsum += i;\n\t\t\t\t}\n\t\t\t\tif (sum > n) return 0;\n\t\t\t\tif (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;\n\t\t\t\telse ret = ret * inverse(factorial(n - sum)) % mod;\n\t\t\t}\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\t/**\n\t\t * n個からk個を選ぶ重複組み合わせnHkをmodで割った余りを求めます。<br>\n\t\t * 計算量はO(min(n, k))です。\n\t\t * @param n 左辺\n\t\t * @param k 右辺\n\t\t * @return nHkをmodで割った余り\n\t\t */\n\t\tpublic int multichoose(int n, int k) {\n\t\t\treturn combination(mod(n + k - 1), k);\n\t\t}\n\n\t\t/**\n\t\t * カタラン数C(n)をmodで割った余りを求めます。<br>\n\t\t * 計算量はO(n)です。\n\t\t * @param n 求めたいカタラン数の番号\n\t\t * @return カタラン数\n\t\t */\n\t\tpublic int catalan(int n) {\n\t\t\treturn divide(combination(mod(2 * n), n), mod(n + 1));\n\t\t}\n\n\t\t/**\n\t\t * nのm乗をmodで割った余りを求めます。<br>\n\t\t * 計算量はO(log m)です。\n\t\t * @param n 床\n\t\t * @param m 冪指数\n\t\t * @return n^mをmodで割った余り\n\t\t */\n\t\tpublic int pow(int n, int m) {\n\t\t\tlong ans = 1, num = n;\n\t\t\tif (m < 0) {\n\t\t\t\tm = -m;\n\t\t\t\twhile (m != 0) {\n\t\t\t\t\tif ((m & 1) != 0) ans = ans * num % mod;\n\t\t\t\t\tm >>>= 1;\n\t\t\t\t\tnum = num * num % mod;\n\t\t\t\t}\n\t\t\t\treturn inverse((int)ans);\n\t\t\t}\n\t\t\twhile (m != 0) {\n\t\t\t\tif ((m & 1) != 0) ans = ans * num % mod;\n\t\t\t\tm >>>= 1;\n\t\t\t\tnum = num * num % mod;\n\t\t\t}\n\t\t\treturn (int)ans;\n\t\t}\n\n\t\t/**\n\t\t * nのm乗をmodで割った余りを求めます。<br>\n\t\t * 計算量はO(log m)です。\n\t\t * @param n 床\n\t\t * @param m 冪指数\n\t\t * @return n^mをmodで割った余り\n\t\t */\n\t\tpublic int pow(long n, long m) {\n\t\t\treturn pow((int)(n % mod), (int)(n % (mod - 1)));\n\t\t}\n\n\t\t/**\n\t\t * 現在のmod値のトーシェント数を返します。<br>\n\t\t * なお、これはmod-1に等しいです。\n\t\t * @return トーシェント数\n\t\t */\n\t\tpublic int totient() {\n\t\t\treturn mod - 1;\n\t\t}\n\n\t\t/**\n\t\t * nのトーシェント数を返します。<br>\n\t\t * 計算量はO(sqrt n)です。\n\t\t * @param n トーシェント数を求めたい値\n\t\t * @return nのトーシェント数\n\t\t */\n\t\tpublic static int totient(int n) {\n\t\t\tint totient = n;\n\t\t\tfor (int i = 2;i * i <= n;++ i) {\n\t\t\t\tif (n % i == 0) {\n\t\t\t\t\ttotient = totient / i * (i - 1);\n\t\t\t\t\twhile ((n %= i) % i == 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (n != 1) totient = totient / n * (n - 1);\n\t\t\treturn totient;\n\t\t}\n\n\t\t/**\n\t\t * nをmodで割った余りを返します。\n\t\t * @param n 演算する値\n\t\t * @return nをmodで割った余り\n\t\t */\n\t\tpublic int mod(int n) {\n\t\t\treturn (n %= mod) < 0 ? n + mod : n;\n\t\t}\n\n\t\t/**\n\t\t * nをmodで割った余りを返します。\n\t\t * @param n 演算する値\n\t\t * @return nをmodで割った余り\n\t\t */\n\t\tpublic int mod(long n) {\n\t\t\treturn (int)((n %= mod) < 0 ? n + mod : n);\n\t\t}\n\n\t\t/**\n\t\t * n+mをmodで割った余りを返します。\n\t\t * @param n 足される値\n\t\t * @param m 足す値\n\t\t * @return n+mをmodで割った余り\n\t\t */\n\t\tpublic int add(int n, int m) {\n\t\t\treturn mod(n + m);\n\t\t}\n\n\t\t/**\n\t\t * n-mをmodで割った余りを返します。\n\t\t * @param n 引かれる値\n\t\t * @param m 引く値\n\t\t * @return n-mをmodで割った余り\n\t\t */\n\t\tpublic int subtract(int n, int m) {\n\t\t\treturn mod(n - m);\n\t\t}\n\n\t\t/**\n\t\t * n*mをmodで割った余りを返します。\n\t\t * @param n 掛けられる値\n\t\t * @param m 掛ける値\n\t\t * @return n*mをmodで割った余り\n\t\t */\n\t\tpublic int multiply(int n, int m) {\n\t\t\tint ans = (int)((long)n * m % mod);\n\t\t\treturn ans < 0 ? ans + mod : ans;\n\t\t}\n\n\t\t/**\n\t\t * n/mをmodで割った余りを返します。\n\t\t * @param n 割られる値\n\t\t * @param m 割る値\n\t\t * @return n/mをmodで割った余り\n\t\t */\n\t\tpublic int divide(int n, int m) {\n\t\t\treturn multiply(n, inverse(m));\n\t\t}\n\n\t\t/**\n\t\t * fを通ることが分かっているfの要素数-1次の関数について、xの位置における値をmodで割った余りを返します。<br>\n\t\t * 計算量はO(f)です。\n\t\t * @param f 関数の形\n\t\t * @param x 求める位置\n\t\t * @return 求めたい値をmodで割った余り\n\t\t */\n\t\tpublic ModInteger lagrangePolynomial(ModInteger[] f, int x) {\n\t\t\tif (f.length > x) return f[x];\n\t\t\tif (x > fact.length) precalc(x);\n\t\t\tModInteger ret = create(0);\n\t\t\tModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];\n\t\t\tdp[0] = create(1);\n\t\t\tdp2[f.length - 1] = create(1);\n\t\t\tfor (int i = 1;i < f.length;++ i) {\n\t\t\t\tdp[i] = dp[i - 1].multiply(x - i - 1);\n\t\t\t\tdp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);\n\t\t\t}\n\t\t\tfor (int i = 0;i < f.length;++ i) {\n\t\t\t\tModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i]).multiplyEqual(inv[f.length - 1 - i]);\n\t\t\t\tif ((f.length - i & 1) == 0) ret.addEqual(tmp);\n\t\t\t\telse ret.subtractEqual(tmp);\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t * 素数を渡すためのクラスです。<br>\n\t * 中身が確実に素数であることを保証するときに使ってください。\n\t *\n\t * @author 31536000\n\t *\n\t */\n\tpublic static class Prime extends Number{\n\n\t\tprivate static final long serialVersionUID = 8216169308184181643L;\n\t\tpublic final int prime;\n\n\t\t/**\n\t\t * 素数を設定します。\n\t\t *\n\t\t * @param prime 素数\n\t\t * @throws IllegalArgumentException 素数以外を渡した時\n\t\t */\n\t\tpublic Prime(int prime) {\n\t\t\tif (!isPrime(prime)) throw new IllegalArgumentException(prime + \" is not prime\");\n\t\t\tthis.prime = prime;\n\t\t}\n\n\t\tprivate static final int bases[] = {15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620, 560, 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028, 2213, 6219, 620, 3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113, 7061, 803, 1269, 3875, 422, 751, 580, 4729, 10239, 746, 2951, 556, 2206, 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17, 15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903, 737, 1887, 7447, 1888, 2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41, 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352, 6435, 165, 1169, 3315, 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263, 27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524, 3577, 236, 2360, 6146, 2850, 55637, 1753, 4178, 8466, 222, 2579, 2743, 2031, 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159, 1725, 3597, 3366, 14336, 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788, 434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183, 8126, 1870, 3296, 7455, 8947, 25017, 541, 19115, 368, 566, 5674, 411, 522, 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007, 35201, 4706, 1152, 1785, 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42, 4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816, 5197, 13330, 7054, 2818, 3199, 811, 922, 350, 7514, 4452, 3449, 2663, 4708, 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194};\n\n\t\tprivate static boolean isSPRP(int n, int a) {\n\t\t\tint d = n - 1, s = 0;\n\t\t\twhile ((d & 1) == 0) {\n\t\t\t\t++s;\n\t\t\t\td >>= 1;\n\t\t\t}\n\t\t\tlong cur = 1, pw = d;\n\t\t\twhile (pw != 0) {\n\t\t\t\tif ((pw & 1) != 0) cur = (cur * a) % n;\n\t\t\t\ta = (int)(((long)a * a) % n);\n\t\t\t\tpw >>= 1;\n\t\t\t}\n\t\t\tif (cur == 1) return true;\n\t\t\tfor (int r = 0; r < s; r++ ) {\n\t\t\t\tif (cur == n - 1) return true;\n\t\t\t\tcur = (cur * cur) % n;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた値が素数か否かを判定します。<br>\n\t\t * この実装はhttp://ceur-ws.org/Vol-1326/020-Forisek.pdfに基づきます。\n\t\t * @param x 判定したい値\n\t\t * @return xが素数ならtrue\n\t\t */\n\t\tpublic static boolean isPrime(int x) {\n\t\t\tif (x == 2 || x == 3 || x == 5 || x == 7) return true;\n\t\t\tif ((x & 1) == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;\n\t\t\tif (x < 121) return x > 1;\n\t\t\tlong h = x;\n\t\t\th = ((h >> 16) ^ h) * 0x45d9f3b;\n\t\t\th = ((h >> 16) ^ h) * 0x45d9f3b;\n\t\t\th = ((h >> 16) ^ h) & 0xFF;\n\t\t\treturn isSPRP(x, bases[(int)h]);\n\t\t}\n\n\t\t@Override\n\t\tpublic int intValue() {\n\t\t\treturn prime;\n\t\t}\n\n\t\t@Override\n\t\tpublic long longValue() {\n\t\t\treturn prime;\n\t\t}\n\n\t\t@Override\n\t\tpublic float floatValue() {\n\t\t\treturn prime;\n\t\t}\n\n\t\t@Override\n\t\tpublic double doubleValue() {\n\t\t\treturn prime;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn String.valueOf(prime);\n\t\t}\n\t}\n\n\tpublic static class AbstractArray<T> extends AbstractList<T> implements RandomAccess{\n\n\t\tprivate final Object[] array;\n\n\t\tpublic AbstractArray(int size) {\n\t\t\tarray = new Object[size];\n\t\t}\n\n\t\tpublic AbstractArray(T[] array) {\n\t\t\tthis(array.length);\n\t\t\tSystem.arraycopy(array, 0, this.array, 0, array.length);\n\t\t}\n\n\t\t@Override\n\t\tpublic T set(int index, T element) {\n\t\t\tT ret = get(index);\n\t\t\tarray[index] = element;\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic T get(int index) {\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tT ret = (T)array[index];\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic Object[] get() {\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic T[] get(T[] array) {\n\t\t\tif (array.length < this.array.length) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tT[] ret = (T[])Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tSystem.arraycopy(this.array, 0, array, 0, this.array.length);\n\t\t\treturn array;\n\t\t}\n\n\t\t@Override\n\t\tpublic int size() {\n\t\t\treturn array.length;\n\t\t}\n\n\t\tpublic int length() {\n\t\t\treturn size();\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn Arrays.hashCode(array);\n\t\t}\n\n\t\tprivate class Iter implements Iterator<T> {\n\t\t\tprivate int index;\n\n\t\t\tprivate Iter() {\n\t\t\t\tindex = 0;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn index < array.length;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic T next() {\n\t\t\t\treturn get(index++);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator<T> iterator() {\n\t\t\treturn new Iter();\n\t\t}\n\t}\n\n\tpublic static class Array<T> extends AbstractArray<T> implements Serializable{\n\n\t\tprivate static final long serialVersionUID = 2749604433067098063L;\n\n\t\tpublic Array(int size) {\n\t\t\tsuper(size);\n\t\t}\n\n\t\tpublic Array(T[] array) {\n\t\t\tsuper(array);\n\t\t}\n\n\t\tpublic T front() {\n\t\t\treturn get(0);\n\t\t}\n\n\t\tpublic T back() {\n\t\t\treturn get(size() - 1);\n\t\t}\n\t}\n}\n", "T1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\na,b,c,d=T1*A1,T1*B1,T2*A2,T2*B2\nif a+c==b+d:\n print('infinity')\nelse:\n if (a-b)*(a+c-b-d)>0:\n print(0)\n else:\n x,y=abs(a-b),abs(a+c-b-d)\n if x%y==0:\n print(x//y*2)\n else:\n print(x//y*2+1)", "#include <iostream>\n#include <utility>\nusing namespace std;\n\nint main() {\n long long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\n // make a1 > b1\n if (a1 < b1) {\n swap(a1, b1);\n swap(a2, b2);\n }\n\n auto d1 = (a1 - b1) * t1; // d1 > 0\n auto d2 = (a2 - b2) * t2;\n\n if (d1 + d2 == 0) {\n cout << \"infinity\";\n return 0;\n }\n if (d1 + d2 > 0) {\n cout << 0;\n return 0;\n }\n\n if (-d1 % (d1 + d2) == 0) {\n auto n = -d1 / (d1 + d2);\n cout << (2 * n);\n return 0;\n }\n\n auto n = -d1 / (d1 + d2);\n cout << (2 * n + 1);\n return 0;\n}", "#include <stdio.h>\nlong long t[2], a[2], b[2];\nlong long w, x, y, z, e, f;\nlong long ans;\nint main() {\n\tscanf(\"%lld%lld\", t, t + 1);\n\tscanf(\"%lld%lld\", a, a + 1);\n\tscanf(\"%lld%lld\", b, b + 1);\n\tx = t[0]; y = t[1];\n\tw = b[0] - a[0];\n\tz = b[1] - a[1];\n\te = w * x + z * y;\n\tif (e == 0) {\n\t\tprintf(\"infinity\\n\");\n\t\treturn 0;\n\t}\n\tif (e > 0) {\n\t\tw = -w;\n\t\tz = -z;\n\t\te = -e;\n\t}\n\tif (w < 0) {\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\tf = w * x;\n\te = -e;\n\tans = f / e * 2;\n\tif (f % e)ans++;\n\tprintf(\"%lld\\n\", ans);\n}", "s,t,a,b,x,y=map(int,open(0).read().split())\ni=(x-a)*s\nj=(b-y)*t-i\nprint(max(0,i//j*2+(i%j!=0))if j else'infinity')", "from math import floor, ceil\n\nT1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nif A1 > B1:\n A1, A2, B1, B2 = B1, B2, A1, A2\n\ndiff = T1 * (B1 - A1) + T2 * (B2 - A2)\n\nif diff == 0:\n print(\"infinity\")\nelif diff > 0:\n print(0)\nelse:\n c = T1 * (B1 - A1) / (- diff)\n ans = floor(c) + ceil(c)\n print(ans)\n", "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#define MOD 1000000007\n#define INF 1 << 30\n\nusing namespace std;\ntypedef long long ll;\n\nint Sign(ll a) {\n\treturn (a > 0) - (a < 0);\n}\n\nint main(void) {\n\tint num, i, j;\n\tll ans = 1;\n\tll d1, d2, a1, a2, b1, b2, t1, t2;\n\tcin >> t1 >> t2;\n\tcin >> a1 >> a2;\n\tcin >> b1 >> b2;\n\td1 = (a1 - b1) * t1;\n\td2 = (a2 - b2) * t2 + d1;\n\tif (Sign(d1) * Sign(d2) >= 0) {\n\t\tif (Sign(d1) * Sign(d2) == 0)\n\t\t\tprintf(\"infinity\\n\");\n\t\telse\n\t\t\tprintf(\"0\\n\");\n\t}\n\telse {\n\t\tans += abs(d1) / abs(d2) * 2;\n\t\tif (abs(d1) % abs(d2) == 0)\n\t\t\tans--;\n\t\tcout << ans << \"\\n\";\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\n \nusing namespace std;\n\nint main(void)\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tlong long int t1, t2;\n\tlong long int a1, a2, b1, b2;\n\n\tcin >> t1 >> t2;\n\tcin >> a1 >> a2;\n\tcin >> b1 >> b2;\n\n\tlong long int d1 = (a1 - b1)*t1;\n\tlong long int d2 = (a2 - b2)*t2;\n\tif(d1>0)\n\t{\n \t\td1 = -1*d1;\n \t\td2 = -1*d2;\n\t}\n\n\tif(d1+d2<0)\n\t{\n\t\tcout << 0 << '\\n';\n\t\treturn 0;\n\t}\n\telse if(d1+d2==0)\n\t{\n\t\tcout << \"infinity\" << '\\n';\n\t\treturn 0;\n\t}\n\n\tlong long int res = -d1/(d1+d2);\n\tif((-d1)%(d1+d2)==0)\n\t{\n\t\tcout << 2*res << '\\n';\n\t}\n\telse\n\t{\n\t\tcout << 2*res+1 << '\\n';\n\t}\n\t\n\treturn 0;\n}\n", "T1,T2 = map(int,input().split())\nA1,A2 = map(int,input().split())\nB1,B2 = map(int,input().split())\n\nif A1>B1:\n A1,A2,B1,B2 = B1,B2,A1,A2\nD1 = B1-A1\nD2 = B2-A2\n\nif D1*T1 + D2*T2 > 0:\n print(0)\n exit()\nif D1*T1 + D2*T2 == 0:\n print('infinity')\n exit()\n\np = D1*T1\nq = -D2*T2\nd = q-p\nk = p//d\nb = int(q*k == p*(k+1))\nprint(1 + k*2 - b)", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n vector<ll> t(2), a(2), b(2);\n cin >> t[0] >> t[1] >> a[0] >> a[1] >> b[0] >> b[1];\n\n ll as = t[0] * a[0] + t[1] * a[1], bs = t[0] * b[0] + t[1] * b[1];\n if (as == bs) {\n cout << \"infinity\" << endl;\n return 0;\n } else if (as < bs) {\n swap(a[0], b[0]);\n swap(a[1], b[1]);\n }\n\n vector<ll> d{t[0] * a[0] - t[0] * b[0], t[1] * a[1] - t[1] * b[1]};\n d[1] += d[0];\n if (d[0] > 0) {\n cout << 0 << endl;\n return 0;\n }\n cout << ((-d[0]) % d[1] == 0 ? (-d[0]) / d[1] * 2 : (-d[0]) / d[1] * 2 + 1) << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nint main()\n{\n\tll t1,t2,a1,a2,b1,b2;\n\tscanf(\"%lld %lld\",&t1,&t2);\n\tscanf(\"%lld %lld\",&a1,&a2);\n\tscanf(\"%lld %lld\",&b1,&b2);\n\tll a=a1-b1,b=a2-b2;\n\tif(a<0)\n\t{\n\t\ta=-a,b=-b;\n\t}\n\tll sum=a*t1+b*t2;\n\tif(sum==0)\n\t{\n\t\tputs(\"infinity\");\n\t\treturn 0;\n\t}\n\tif(sum>0)\n\t{\n\t\tputs(\"0\");\n\t\treturn 0;\n\t}\n\tll ret=a*t1/(-sum)+(-b)*t2/(-sum);\n\tif((-b)*t2%(-sum)==0) ret--;\n\tprintf(\"%lld\\n\",ret);\n\treturn 0;\n}\n", "a,b=map(int,input().split())\nc,d=map(int,input().split())\ne,f=map(int,input().split())\nif (c>e and d>f) or (c<e and d<f):\n print(0)\nelse:\n if c<e:\n c,d,e,f=e,f,c,d\n s=(c-e)*a\n t=(f-d)*b\n if s>t:\n print(0)\n elif s==t:\n print(\"infinity\")\n else:\n print(int(s/(t-s))+int(t/(t-s))-(1 if s%(t-s)==0 else 0))", "#!/usr/bin python3\n# -*- coding: utf-8 -*-\n\nt1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\ns1 = a1 - b1\ns2 = a2 - b2\n\n# a1 が先行にする\nif s1<0:\n s1*=-1\n s2*=-1\n\nd = s1*t1 + s2*t2\nmxd = s1*t1\n\nif d>0:\n print(0)\nelif d==0:\n print('infinity')\nelse:\n if mxd%abs(d)==0:\n print(mxd//abs(d)*2)\n else:\n print(mxd//abs(d)*2+1)\n", "import sys\n\nt1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nif (a1-b1)*t1+(a2-b2)*t2 == 0:\n print(\"infinity\")\n sys.exit()\n\ne1 = (a1-b1)*t1\ne2 = e1 + (a2-b2)*t2\n\nif e1*e2 > 0:\n print(0)\n sys.exit()\n\ne1, e2 = abs(e1), abs(e2)\n\nif e1%e2:\n print(1+2*(e1//e2))\nelse:\n print(2*(e1//e2))", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t1 = sc.nextInt();\n int t2 = sc.nextInt();\n long a1 = sc.nextLong();\n long a2 = sc.nextLong();\n long b1 = sc.nextLong();\n long b2 = sc.nextLong();\n\n if (a1 * t1 + a2 * t2 == b1 * t1 + b2 * t2) {\n System.out.println(\"infinity\");\n System.exit(0);\n }\n\n long dif1 = a1 * t1 - b1 * t1;\n long dif2 = a2 * t2 - b2 * t2;\n\n long ans;\n // aの方が最初に早い || bの方が最初に早い\n if ((dif1 > 0 && dif1 + dif2 < 0) || (dif1 < 0 && dif1 + dif2 > 0)) {\n if (-dif1 % (dif1 + dif2) == 0) {\n ans = -dif1 / (dif1 + dif2) * 2;\n } else {\n ans = -dif1 / (dif1 + dif2) * 2 + 1;\n }\n } else {\n ans = 0;\n }\n System.out.println(ans);\n\n sc.close();\n }\n\n}\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nave_a, ave_b = t1 * a1 + t2 * a2, t1 * b1 + t2 * b2\nif ave_a < ave_b:\n a1, a2, b1, b2 = b1, b2, a1, a2\n ave_a, ave_b = ave_b, ave_a\n\nif ave_a == ave_b:\n print('infinity')\n exit()\n\nfirst, second = t1 * (b1 - a1), ave_a - ave_b\nans = first // second * 2 + (first % second != 0)\nprint(max(0, ans))\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int MAXN=2e5+10,MAXM=2e6+10;\nconst int INF=INT_MAX,MOD=1e9+7;\nconst ll llINF=~(1ll<<63);\n\n\nint main()\n{\n ll t1,t2,a1,a2,b1,b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n ll ans=(a1-b1)*t1+(a2-b2)*t2;\n if(!ans)return puts(\"infinity\"),0;\n ll x1=t1*a1-t1*b1;\n if(!x1)return puts(\"infinity\"),0;\n if((x1>0)==(ans<0))\n {\n ll p=x1+ans,res=0;\n if(abs(x1)%abs(ans))res++;\n printf(\"%lld\",abs(x1/ans)*2+res);\n }\n else return puts(\"0\"),0;\n return 0;\n}\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\n\nP = (A1-B1)*T1\nQ = (A2-B2)*T2\n\nif(P > 0):\n P *= -1\n Q *= -1\n \nif(P+Q<0):\n print(0)\nelif(P+Q==0):\n print('infinity')\nelse:\n if((-P)%(P+Q)==0):\n print((-P)//(P+Q)*2)\n else:\n print((-P)//(P+Q)*2+1)", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nll t1, t2;\nll a1, a2;\nll b1, b2;\n\nvoid solve() {\n ll s, t;\n s = a1*t1 - b1*t1;\n t = s + a2*t2 - b2*t2;\n if (t == 0) cout << \"infinity\" << endl;\n else if ((s>0 && t>0) || (s<0 && t<0)) cout << 0 << endl;\n else {\n ll u = (s > 0 ? s / (-t) : (-s) / t);\n ll v = (s > 0 ? s % (-t) : (-s) % t);\n cout << u*2LL + (v ? 1LL : 0LL) << endl;\n }\n}\n\nint main() {\n cin >> t1 >> t2;\n cin >> a1 >> a2;\n cin >> b1 >> b2;\n solve();\n return 0;\n}", "#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=int(a);i<int(b);++i)\nusing namespace std;\ntypedef long long ll;\nint INF = (1LL << 30) - 1;\nint MOD = 1e9+7;\nint main(){\n ll T1,T2,A1,A2,B1,B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n ll p = (A1 - B1) * T1;\n ll q = (A2 - B2) * T2;\n if(p > 0){\n p *= -1;\n q *= -1;\n }\n if(p + q < 0){\n cout << 0 << endl;\n }else if(p + q == 0){\n cout << \"infinity\" << endl;\n }else{\n ll s = (-p) / (p + q);\n ll t = (-p) % (p + q);\n cout << (s * 2 + (t == 0 ? 0 : 1)) << endl;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing ll=long long;\n\nconst ll X=1000000007;\n\nint main() {\n ll T1,T2,A1,A2,B1,B2,TA,TB,AA,AB,D;\n cin>>T1>>T2>>A1>>A2>>B1>>B2;\n TA=T1*A1;\n TB=T2*A2;\n AA=T1*B1;\n AB=T2*B2;//高橋青木の前後半で進む距離\n D=TA+TB-AA-AB;\n if(TA+TB==AA+AB){\n cout<<\"infinity\"<<endl;\n }\n else{\n if(D<0){swap(TA,AA);swap(TB,AB);D=-D;}\n //以降は高橋の方が先に進む場合のみ\n if(TA>AA){cout<<0<<endl;}\n else{\n ll d=AA-TA;\n if(d%D==0){\n cout<<2*(d/D)<<endl;\n }\n else{\n cout<<2*(d/D)+1<<endl;\n }\n }\n }\n}\n\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nd1 = T1*(A1-B1)\nd2 = T2*(A2-B2)\nif d1>d2:\n d1 *= -1\n d2 *= -1\n\nif (d1>0 and d1+d2>0) or (d1<0 and d1+d2<0):\n print(0)\nelif d1+d2==0:\n print(\"infinity\")\nelse:\n v = (abs(d1)//(d1+d2))\n ans = v*2\n pos = d1+v*(d1+d2)\n if pos<0 and pos+d2>=0:\n ans += 1\n print(ans)", "import math\nt1,t2 = map(int,(input().split(' ')))\na1,a2 = map(int,(input().split(' ')))\nb1,b2 = map(int,(input().split(' ')))\nn = t1*a1+t2*a2\nm = t1*b1+t2*b2\nif(n==m):\n print(\"infinity\")\n exit(0)\nans1 = max(0,math.ceil((b1-a1)*t1/(n-m)))\nans2 = max(0,math.ceil((t1*(b1-a1)+t2*(b2-a2))/(n-m))-1)\n#if((t1*(b1-a1))%(n-m) == 1):\n# ans3 = 1\n#else:\n# ans3 = 0\nans3 = max(0,math.floor(t1*(b1-a1)/(n-m))+1)\nprint(max(ans1+ans2+ans3-1,0))", "#include <bits/stdc++.h>\n \n#define ll long long\n#define loop(a) loopi(i,a)\n#define loopi(i,a) for(int i=0; i<a; i++)\n#define pii pair<int,int>\n#define pll pair<ll,ll>\n \nusing namespace std;\n \nconst int mod=1e9+7;\n \nint main(){\n\tios_base::sync_with_stdio(0),cin.tie(0);\n\tll t1,t2,a1,a2,b1,b2;\n\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\tll diff=a1*t1+a2*t2-b1*t1-b2*t2;\n\tif(diff==0){\n\t\tcout << \"infinity\\n\";\n\t\treturn 0;\n\t}\n\tif(diff<0){\n\t\tswap(a1,b1);\n\t\tswap(a2,b2);\n\t\tdiff*=-1;\n\t}\n\tif(a1>b1){\n\t\tcout << \"0\\n\";\n\t\treturn 0;\n\t}\n\tll x=b1*t1-a1*t1;\n\tll ans=1+2*((x-1)/diff);\n\tif(x%diff==0) ans++;\n\tcout << ans << \"\\n\";\n\treturn 0;\n}\n", "#include <iostream>\n#include <string>\n#define llint long long\n#define mod 1000000007\n\nusing namespace std;\n\nllint t1, t2;\nllint a1, a2, b1, b2;\n\nint main(void)\n{\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\tif(a1 < b1) swap(a1, b1), swap(a2, b2);\n\t\n\tllint d1 = a1-b1, d2 = a2-b2;\n\tllint dif = d1*t1+d2*t2;\n\t\n\tif(dif == 0){\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif(dif > 0){\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\t\n\tdif *= -1;\n\t\n\tllint top = d1*t1;\n\tllint ans = (top+dif-1)/dif*2;\n\tif(top % dif == 0) ans++;\n\tcout << ans-1 << endl;\n\t\n\treturn 0;\n}", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long t1 = sc.nextLong();\n long t2 = sc.nextLong();\n long a1 = sc.nextLong();\n long a2 = sc.nextLong();\n long b1 = sc.nextLong();\n long b2 = sc.nextLong();\n if(a1*t1+a2*t2==b1*t1+b2*t2)System.out.println(\"infinity\");\n else if((a1>b1&&a2>b2)||(a1<b1&&a2<b2))System.out.println(0);\n else if(a1>=b1&&a2<=b2){\n long d = (a2-b2)*t2+(a1-b1)*t1;\n if(d>0)System.out.println(0);\n else if(d<0){\n if((b1*t1-a1*t1)%d!=0)System.out.println(((b1*t1-a1*t1)/d)*2+1);\n else System.out.println(((b1*t1-a1*t1)/d)*2);\n }\n }\n else if(a1<=b1&&a2>=b2){\n long d = (b2-a2)*t2+(b1-a1)*t1;\n if(d>0)System.out.println(0);\n else if(d<0){\n if((a1*t1-b1*t1)%d!=0)System.out.println(((a1*t1-b1*t1)/d)*2+1);\n else System.out.println(((a1*t1-b1*t1)/d)*2);\n }\n }\n }\n}", "import math\nT1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\nC1,C2=A1-B1,A2-B2\nD1,D2=T1*C1,T2*C2\n\nif D1==-D2:\n print(\"infinity\")\n exit(0)\n\ndiff=0\nx=-1\nans=0\n\nif D1*(D1+D2)<0:\n ans+=1\n diff+=D1+D2\nelse:\n print(ans)\n exit(0)\n\nif diff*(diff+D1)<=0:\n ans+=2*abs((diff+D1)//(D1+D2))\n\nif diff+(D1+D2)*abs((diff+D1)//(D1+D2))+D1==0:\n ans+=1\nif diff+(D1+D2)*abs((diff+D1)//(D1+D2))+D1+D2==0:\n ans+=1\n\nprint(ans)", "t1,t2=map(int,input().split())\na,b=map(int,input().split())\nc,d=map(int,input().split())\nx=t1*(a-c)\ny=t2*(b-d)\nif x<0:\n x=-x\n y=-y\nif x+y==0:\n print('infinity')\nelif x+y>0:\n print(0)\nelse:\n print(min(1,x%abs(x+y))+2*(x//abs(x+y)))", "t1,t2 = map(int, input().split())\na1,a2 = map(int, input().split())\nb1,b2 = map(int, input().split())\nx,y=(a1-b1)*t1 + (a2-b2)*t2, (a1-b1)*t1\nif x == 0:\n print(\"infinity\")\nelif x*y > 0:\n print(0)\nelse:\n s,t = divmod(abs(y), abs(x))\n print(s*2+(1 if t else 0))\n", "t0, t1 = map(int, input().split())\na0, a1 = map(int, input().split())\nb0, b1 = map(int, input().split())\nd0 = (a0 - b0) * t0\nd1 = (a1 - b1) * t1\nif d0 < 0:\n d0, d1 = -d0, -d1\nif d0 + d1 == 0:\n print('infinity')\n exit()\nif d0 + d1 > 0:\n print(0)\n exit()\nd = -(d0 + d1)\nq, r = d0 // d, d0 % d\nprint(2 * q + min(r, 1))\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nA1T1 = A1 * T1\nA2T2 = A2 * T2\nB1T1 = B1 * T1\nB2T2 = B2 * T2\nX = A1T1 - B1T1\nY = A2T2 - B2T2\nZ = X + Y\n\nif Z == 0:\n print(\"infinity\")\nelif X * Z > 0:\n print(0)\nelse:\n W = abs(X) // abs(Z)\n if (abs(X) / abs(Z)).is_integer():\n print(W * 2)\n else:\n print(W * 2 + 1)\n", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\n\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\nconst ll MOD = pow(10,9)+7;\nconst ll LLINF = pow(2,61)-1;\nconst int INF = pow(2,30)-1;\n\n\nint main() {\n ll T1, T2; cin >> T1 >> T2;\n ll A1, A2; cin >> A1 >> A2;\n ll B1, B2; cin >> B1 >> B2;\n if (A1*T1+A2*T2==B1*T1+B2*T2) { cout << \"infinity\" << endl; return 0; }\n if (A1<B1) { swap(A1,B1); swap(A2,B2); }\n ll d1 = A1*T1 - B1*T1;\n ll d2 = (B1*T1+B2*T2) - (A1*T1+A2*T2);\n if (d2<0) cout << 0 << endl;\n else cout << d1/d2*2+(d1%d2!=0) << endl;\n // cout << d1 << \" \" << d2 << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nsigned main()\n{\n int T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2; \n cin >> A1 >> A2; \n cin >> B1 >> B2; \n A1 *= T1; A2 *= T2; B1 *= T1; B2 *= T2; \n\n if(A1+A2 == B1+B2) {puts(\"infinity\"); return 0;}\n if(A1+A2 < B1+B2) { swap(A1, B1); swap(A2, B2); }\n if(A1 > B1) {puts(\"0\"); return 0;}\n\n // A1 < B1\n int D1=A1-B1;\n int D2=A2-B2;\n\n assert(D1<0);\n assert(D2>0);\n\n int S = abs(D1)/(D1+D2);\n int T = abs(D1)%(D1+D2);\n\n if(T==0) cout << 2*S << endl;\n else cout << 2*S + 1 << endl;\n}\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n long long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n if (t1 * a1 + t2 * a2 > t1 * b1 + t2 * b2) {\n swap(a1, b1);\n swap(a2, b2);\n }\n if (t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2) {\n cout << \"infinity\";\n } else if (a1 < b1) {\n cout << 0;\n } else {\n long long top = t1 * (a1 - b1), bot = t1 * (b1 - a1) + t2 * (b2 - a2);\n long long result = 2 * (top / bot);\n if (top % bot != 0) {\n result++;\n }\n cout << result;\n }\n return 0;\n}\n", "t1, t2 = map(int,input().split())\na1, a2 = map(int,input().split())\nb1, b2 = map(int,input().split())\n\na1 = t1*a1\na2 = t2*a2\nb1 = t1*b1\nb2 = t2*b2\n\nif (a1 + a2) == (b1 + b2):\n print('infinity')\n exit(0)\n\nelif (a1 + a2) > (b1 + b2):\n a1, b1 = b1, a1\n a2, b2 = b2, a2\nif b1 > a1:\n print(0)\n exit(0)\n\ntmp00 = a1 - b1\ntmp01 = b1 + b2 - a1 - a2\n\nans = tmp00 // tmp01 * 2 + 1\nif tmp00 % tmp01 == 0:\n ans -= 1\n\nprint(ans)", "#include<iostream>\nusing namespace std;\nlong T1,T2,A1,A2,B1,B2;\nint main()\n{\n\tcin>>T1>>T2>>A1>>A2>>B1>>B2;\n\tlong X=A1*T1+A2*T2,Y=B1*T1+B2*T2;\n\tif(X==Y)\n\t{\n\t\tcout<<\"infinity\"<<endl;\n\t}\n\telse\n\t{\n\t\tlong d,D;\n\t\tif(X>Y)\n\t\t{\n\t\t\td=B1*T1-A1*T1;\n\t\t\tD=X-Y;\n\t\t}\n\t\telse\n\t\t{\n\t\t\td=A1*T1-B1*T1;\n\t\t\tD=Y-X;\n\t\t}\n\t\tif(d<0)cout<<0<<endl;\n\t\telse if(d==0)cout<<1<<endl;\n\t\telse\n\t\t{\n\t\t\tlong ans=1;\n\t\t\td-=D;\n\t\t\tif(d>=0)\n\t\t\t{\n\t\t\t\tans+=d/D*2;\n\t\t\t\td%=D;\n\t\t\t\tans+=2;\n\t\t\t\tif(d==0)ans--;\n\t\t\t}\n\t\t\tcout<<ans<<endl;\n\t\t}\n\t}\n}\n", "#include <iostream>\nusing namespace std;\nint main(void){\n long long T1,T2,A1,A2,B1,B2,a,c,ans;\n cin>>T1>>T2>>A1>>A2>>B1>>B2;\n if((A1-B1)*T1+(A2-B2)*T2==0){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n if((A1-B1)*T1+(A2-B2)*T2<0){\n c=A1;A1=B1;B1=c;\n c=A2;A2=B2;B2=c;\n }\n if(A1>B1){\n cout<<0<<endl;\n return 0;\n }\n a=(A1-B1)*T1+(A2-B2)*T2;\n if((B1*T1-A1*T1)%a==0){\n ans=((B1*T1-A1*T1-1)/a+1)*2;\n }else{\n ans=((B1*T1-A1*T1)/a+1)*2-1;\n }\n if(ans<0){\n ans=0;\n }\n cout<<ans<<endl;\n}\n", "import sys\n\n# Input\nT1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nrunout = T1 * A1 - T1 * B1\nTotalDiff = (T1 * A1 - T1 * B1) + (T2 * A2 - T2 * B2)\n\nif TotalDiff == 0:\n print('infinity')\n sys.exit()\nelif runout * TotalDiff > 0:\n print(0)\n sys.exit()\n\nrunout = abs(runout)\nTotalDiff = abs(TotalDiff)\n\ncnt = 0\ncnt = (runout // TotalDiff) * 2\nif runout % TotalDiff != 0:\n cnt += 1\nprint(cnt)\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\nif a1 < b1:\n a1, b1 = b1, a1\n a2, b2 = b2, a2\nf = (a1-b1)*t1\nl = (b2-a2)*t2\nif f > l:\n print(0)\nelif f == l:\n print(\"infinity\")\nelse:\n print(2 * (f//(l-f)) + int(f%(f-l)!=0))", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\na1 -= b1\na2 -= b2\n\nif a1*t1+a2*t2 == 0:\n\tprint(\"infinity\")\n\tquit()\n\nif a1 < 0:\n\ta1 = -a1\n\ta2 = -a2\n\n# assert a1 > 0\n\nif a2 > 0:\n\tprint(0)\n\tquit()\n\n# assert a2 < 0\n\nd = a1*t1+a2*t2\n\nif d > 0:\n\tprint(0)\n\tquit()\n\nans = ((a1*t1-1)//(-d)+1)*2-1\nif a1*t1%(-d) == 0:\n\tans += 1\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nvector<ll> nums[100005];\nint main(){\n ll t1,t2,a1,a2,b1,b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n if(a1<b1){\n swap(a1,b1);\n swap(a2,b2);\n }\n ll t=t1*(a1-b1),d=t+t2*(a2-b2);\n if(d>0) cout<<0<<endl;\n else if(d==0) cout<<\"infinity\"<<endl;\n else{\n t*=-1;\n ll ans=t/d;\n ans*=2;\n if((ans/2)*d==t) ans--;\n cout<<ans+1<<endl;\n }\n\n}\n", "import sys\nimport math\nt1, t2 = [int(i) for i in sys.stdin.readline().split()]\na1, a2 = [int(i) for i in sys.stdin.readline().split()]\nb1, b2 = [int(i) for i in sys.stdin.readline().split()]\na1 -= b1\na2 -= b2\n_sum = a1 * t1 + a2 * t2\nif _sum == 0:\n print(\"infinity\")\nelif _sum * a1 > 0:\n print(\"0\")\nelse:\n cnt = (-a1 * t1) / _sum\n res = math.ceil(cnt) * 2 - 1 + (cnt % 1 == 0)\n print(res)", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main (String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong t1 = sc.nextLong();\n\t\tlong t2 = sc.nextLong();\n\t\tlong a1 = sc.nextLong();\n\t\tlong a2 = sc.nextLong();\n\t\tlong b1 = sc.nextLong();\n\t\tlong b2 = sc.nextLong();\n\t\t\n\t\tlong c1 = a1-b1;\n\t\tlong c2 = a2-b2;\n\n\t\tlong total = c1*t1+c2*t2;\n\t\tlong mid = c1*t1;\n\t\tif (total==0) {\n\t\t\tSystem.out.println(\"infinity\");\n\n\t\t} else if ((total>0 && mid>0) || (total<0 && mid<0)){\n\t\t\tSystem.out.println(0);\n\n\t\t} else if (mid%total==0){\n\t\t\tSystem.out.println(-mid/total*2);\n\t\t} else {\n\t\t\tSystem.out.println(-mid/total*2+1);\n\t\t}\n\t}\n\n}\n\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nlong long t1,t2,a1,a2,b1,b2,a,b,s,ret;\nint main(){\n\t//freopen(\"input.txt\",\"r\",stdin);\n\t//freopen(\"output.txt\",\"w\",stdout);\n\tios::sync_with_stdio(false);\n\tcin.tie(NULL);\n\tcout.tie(NULL);\n\tcin>>t1>>t2;\n\tcin>>a1>>a2;\n\tcin>>b1>>b2;\n\ta=a1-b1;\n\tb=a2-b2;\n\tif(a<0){\n\t\ta=-a;\n\t\tb=-b;\n\t}\n\ts=a*t1+b*t2;\n\tif(s==0){\n\t\tcout<<\"infinity\"<<endl;\n\t\treturn 0;\n\t}\n\tif(s>0){\n\t\tcout<<\"0\"<<endl;\n\t\treturn 0;\n\t}\n\tif(s<0){\n\t\tret=a*t1/(-s)+(-b)*t2/(-s);\n\t\tif((-b)*t2%(-s)==0LL)\n\t\t\tret-=1LL;\n\t\tcout<<ret<<endl;\n\t\treturn 0;\n\t}\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nlong long T1, T2, A1, A2, B1, B2;\nint main() {\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n long long SA = A1*T1 + A2*T2;\n long long SB = B1*T1 + B2*T2;\n if(SA == SB) cout << \"infinity\";\n else if((SA > SB && A1 > B1) || (SA < SB && A1 < B1)) cout << 0;\n else {\n long long ds = abs(SA - SB);\n long long rd = abs(A1 - B1) * T1;\n long long ans = (rd / ds) * 2;\n if(rd % ds) ans++;\n cout << ans;\n }\n}", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\na, b, ans = 0, 0, 0\nn1 = (A1-B1)*T1\nn2 = n1 + (A2-B2)*T2\nif n2 == 0:\n print('infinity')\nelif n1*n2 < 0:\n ans += 2 * (abs(n1)//abs(n2))\n if abs(n1)%abs(n2) > 0:\n ans += 1\n print(ans)\nelse:\n print(0)", "#include <bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (int)n; i++)\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ll t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\n ll diff1 = (a1 - b1) * t1;\n ll diff2 = (a2 - b2) * t2;\n\n if(0 < diff1) {\n diff1 = -diff1;\n diff2 = -diff2;\n }\n\n if(diff1 + diff2 < 0) {\n cout << 0 << endl;\n return 0;\n } else if(diff1 + diff2 == 0) {\n cout << \"infinity\" << endl;\n return 0;\n }\n\n ll answer = (-diff1/(diff1+diff2)) * 2 + (-diff1%(diff1+diff2) != 0);\n cout << answer << endl;\n\n return 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong t1 = sc.nextLong();\n\t\tlong t2 = sc.nextLong();\n\t\tlong a1 = sc.nextLong();\n\t\tlong a2 = sc.nextLong();\n\t\tlong b1 = sc.nextLong();\n\t\tlong b2 = sc.nextLong();\n\n\t\tlong tsum = t1 * a1 + t2 * a2;\n\t\tlong asum = t1 * b1 + t2 * b2;\n\t\tif (tsum == asum) {\n\t\t\tSystem.out.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\n\t\tif (asum > tsum) {\n\t\t\tlong tmp = a1;\n\t\t\ta1 = b1;\n\t\t\tb1 = tmp;\n\n\t\t\ttmp = a2;\n\t\t\ta2 = b2;\n\t\t\tb2 = tmp;\n\t\t}\n\n\t\tif (b1 < a1) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tlong delta1 = (b1 - a1) * t1;\n\t\tlong delta2 = Math.abs(asum - tsum);\n\n\t\tSystem.out.println((delta1 / delta2) * 2 + (delta1 % delta2 > 0 ? 1 : 0));\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n long p = t1 * (b1 - a1), q = t2 * (b2 - a2);\n if(p > 0 && q > 0 || p < 0 && q < 0 || abs(p) > abs(q)) {\n cout << 0 << endl;\n return 0;\n }\n p = abs(p), q = abs(q);\n if(p == q) {\n cout << \"infinity\" << endl;\n return 0;\n }\n cout << p / (q - p) * 2 + !!(p % (q - p)) << endl;\n return 0;\n}\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\nimport java.lang.*;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tlong t1 = sc.nextLong();\n\t\tlong t2 = sc.nextLong();\n\t\tlong a1 = sc.nextLong();\n\t\tlong a2 = sc.nextLong();\n\t\tlong b1 = sc.nextLong();\n\t\tlong b2 = sc.nextLong();\n\t\tlong a = a1 * t1 + a2 * t2;\n\t\tlong b = b1 * t1 + b2 * t2;\n\t\tif (a == b) {\n\t\t\tSystem.out.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif ((a1 >= b1 && a2 >= b2) || (a1 <= b1 && a2 <= b2)) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tif (a < b) {\n\t\t\tlong diff = b - a;\n\t\t\tif (a1 > b1) {\n\t\t\t\tif ((a1 * t1 - b1 * t1) % diff == 0) {\n\t\t\t\t\tSystem.out.println((a1 * t1 - b1 * t1) / diff * 2);\n\t\t\t\t} else {\n\t\t\t\t\tSystem.out.println((a1 * t1 - b1 * t1) / diff * 2 + 1);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tSystem.out.println(0);\n\t\t\t}\n\t\t} else {\n\t\t\tlong diff = a - b;\n\t\t\tif (a1 < b1) {\n\t\t\t\tif ((b1 * t1 - a1 * t1) % diff == 0) {\n\t\t\t\t\tSystem.out.println((b1 * t1 - a1 * t1) / diff * 2);\n\t\t\t\t} else {\n\t\t\t\t\tSystem.out.println((b1 * t1 - a1 * t1) / diff * 2 + 1);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tSystem.out.println(0);\n\t\t\t}\n\t\t}\n\t}\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int readByte() {\n\t\tif (hasNextByte()) {\n\t\t\treturn buffer[ptr++];\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n\t\t\tptr++;\n\t\t}\n\t\treturn hasNextByte();\n\t}\n\tpublic String next() {\n\t\tif (!hasNext()) {\n\t\t\tthrow new NoSuchElementException();\n\t\t}\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tpublic long nextLong() {\n\t\tif (!hasNext()) {\n\t\t\tthrow new NoSuchElementException();\n\t\t}\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || Integer.MAX_VALUE < nl) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\treturn (int) nl;\n\t}\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\nfirst = a1 * t1 - b1 * t1\nsecond = (a2 * t2 - b2 * t2)\nlast = second + first\nif first * last > 0:\n ans = 0\nelif (abs(last) == 0):\n ans = 'infinity'\nelse:\n s = abs(first) // abs(last)\n t = abs(first) % abs(last)\n ans = 2 * s\n if t != 0:\n ans += 1\nprint(ans)", "#include<iostream>\n#include<cstdint>\n\nint64_t T1, T2, V1, V2;\n\nint main() {\n int64_t A1, A2, B1, B2; std::cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n V1 = A1-B1; V2 = A2-B2;\n if(V1 < 0) { V1 = -V1; V2 = -V2; }\n int64_t dm = V1*T1, d = dm + V2*T2;\n if(d > 0) { std::cout << \"0\" << std::endl; return 0; }\n if(d == 0) { std::cout << \"infinity\" << std::endl; return 0; }\n int64_t ans = 1;\n int64_t r = (dm-1)/(-d);\n ans += r*2;\n if(dm%(-d)==0) ++ans;\n std::cout << ans << std::endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint T1, T2;\nll A1, A2;\nll B1, B2;\n\nint main()\n{\n cin >> T1 >> T2;\n cin >> A1 >> A2; A1 *= T1; A2 *= T2;\n cin >> B1 >> B2; B1 *= T1; B2 *= T2;\n if (A1 + A2 == B1 + B2) { printf(\"infinity\\n\"); return 0; }\n if (A1 + A2 > B1 + B2) { swap(A1, B1); swap(A2, B2); }\n if (A1 > B1) {\n ll r = (A1 - B1) / (B1 + B2 - A1 - A2);\n ll res = 2ll * r;\n if ((A1 - B1) % (B1 + B2 - A1 - A2)) res++;\n cout << res << endl;\n } else printf(\"0\\n\");\n return 0;\n}\n", "#include <bits/stdc++.h>\ntypedef long long int LL;\ntypedef unsigned long long int ULL;\nusing namespace std;\n\n// 插入此處\n\nint main() {\n std::ios::sync_with_stdio(false);\n cin.tie(0);\n LL T1, T2; cin >> T1 >> T2;\n LL A1, A2, B1, B2;\n cin >> A1 >> A2 >> B1 >> B2;\n if (A1 - B1 < 0) {\n swap(A1, B1);\n swap(A2, B2);\n }\n LL s1 = (A1-B1)*T1;\n LL s2 = (A2-B2)*T2;\n if ((A1-B1)*T1 + (A2-B2)*T2 > 0) cout << \"0\" << endl;\n else if ((A1-B1)*T1 + (A2-B2)*T2 == 0) cout << \"infinity\" << endl;\n else cout << s1/(-(s1+s2)) * 2 - 1 + (s1%(-(s1+s2)) == 0 ? 1 : 2) << endl;\n\n return 0;\n}\n", "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.InputMismatchException;\nimport java.util.List;\nimport java.util.Set;\n\npublic class Main {\n\n\tprivate static final String NO = \"NO\";\n\tprivate static final String YES = \"YES\";\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\n\tprivate static final long MOD = 1000000007;\n\tprivate static final long inf = 100000000000L;\n\n\tvoid solve() {\n\t\tint T = 1;\n\t\tfor (int i = 0; i < T; i++)\n\t\t\tsolve(i);\n\t}\n\n\tint n;\n\n\tvoid solve(int T) {\n\t\tlong t1 = nl();\n\t\tlong t2 = nl();\n\t\tlong a1 = nl();\n\t\tlong a2 = nl();\n\t\tlong b1 = nl();\n\t\tlong b2 = nl();\n\n\t\tlong a = a1 - b1, b = a2 - b2;\n\t\tif (a < 0) {\n\t\t\ta = -a;\n\t\t\tb = -b;\n\t\t}\n\t\tlong sum = a * t1 + b * t2;\n\t\tif (sum == 0) {\n\t\t\tout.print(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\tif (sum > 0) {\n\t\t\tout.print(\"0\");\n\t\t\treturn;\n\t\t}\n\t\tlong ret = a * t1 / (-sum) + (-b) * t2 / (-sum);\n\t\tif ((-b) * t2 % (-sum) == 0)\n\t\t\tret--;\n\t\tout.print(ret);\n\t}\n\n\t// a^b\n\tlong power(long a, long b) {\n\t\tlong x = 1, y = a;\n\t\twhile (b > 0) {\n\t\t\tif (b % 2 != 0) {\n\t\t\t\tx = (x * y) % MOD;\n\t\t\t}\n\t\t\ty = (y * y) % MOD;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn x % MOD;\n\t}\n\n\tprivate long gcd(long a, long b) {\n\t\twhile (a != 0) {\n\t\t\tlong tmp = b % a;\n\t\t\tb = a;\n\t\t\ta = tmp;\n\t\t}\n\t\treturn b;\n\t}\n\n\tvoid run() throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\n\t\tlong s = System.currentTimeMillis();\n\t\tsolve();\n\t\tout.flush();\n\t\tif (!INPUT.isEmpty())\n\t\t\ttr(System.currentTimeMillis() - s + \"ms\");\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().run();\n\t}\n\n\tprivate byte[] inbuf = new byte[1024];\n\tpublic int lenbuf = 0, ptrbuf = 0;\n\tprivate boolean vis[];\n\n\tprivate int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\tprivate double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\tprivate char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '\n\t\t\t\t\t\t\t\t\t// ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n) {\n\t\t\tif (!(isSpaceChar(b)))\n\t\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate List<Integer> na2(int n) {\n\t\tList<Integer> a = new ArrayList<Integer>();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta.add(ni());\n\t\treturn a;\n\t}\n\n\tprivate int[][] na(int n, int m) {\n\t\tint[][] a = new int[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = na(m);\n\t\treturn a;\n\t}\n\n\tprivate int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate long[] nl(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\n\tprivate long[][] nl(int n, int m) {\n\t\tlong[][] a = new long[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl(m);\n\t\treturn a;\n\t}\n\n\tprivate long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate static void tr(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic class Pair<K, V> {\n\n\t\t/**\n\t\t * Key of this <code>Pair</code>.\n\t\t */\n\t\tprivate K key;\n\n\t\t/**\n\t\t * Gets the key for this pair.\n\t\t * \n\t\t * @return key for this pair\n\t\t */\n\t\tpublic K getKey() {\n\t\t\treturn key;\n\t\t}\n\n\t\t/**\n\t\t * Value of this this <code>Pair</code>.\n\t\t */\n\t\tprivate V value;\n\n\t\t/**\n\t\t * Gets the value for this pair.\n\t\t * \n\t\t * @return value for this pair\n\t\t */\n\t\tpublic V getValue() {\n\t\t\treturn value;\n\t\t}\n\n\t\t/**\n\t\t * Creates a new pair\n\t\t * \n\t\t * @param key The key for this pair\n\t\t * @param value The value to use for this pair\n\t\t */\n\t\tpublic Pair(K key, V value) {\n\t\t\tthis.key = key;\n\t\t\tthis.value = value;\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * <code>String</code> representation of this <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * The default name/value delimiter '=' is always used.\n\t\t * </p>\n\t\t *\n\t\t * @return <code>String</code> representation of this <code>Pair</code>\n\t\t */\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn key + \"=\" + value;\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * Generate a hash code for this <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * The hash code is calculated using both the name and the value of the\n\t\t * <code>Pair</code>.\n\t\t * </p>\n\t\t *\n\t\t * @return hash code for this <code>Pair</code>\n\t\t */\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\t// name's hashCode is multiplied by an arbitrary prime number (13)\n\t\t\t// in order to make sure there is a difference in the hashCode between\n\t\t\t// these two parameters:\n\t\t\t// name: a value: aa\n\t\t\t// name: aa value: a\n\t\t\treturn key.hashCode() * 13 + (value == null ? 0 : value.hashCode());\n\t\t}\n\n\t\t/**\n\t\t * <p>\n\t\t * Test this <code>Pair</code> for equality with another <code>Object</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * If the <code>Object</code> to be tested is not a <code>Pair</code> or is\n\t\t * <code>null</code>, then this method returns <code>false</code>.\n\t\t * </p>\n\t\t *\n\t\t * <p>\n\t\t * Two <code>Pair</code>s are considered equal if and only if both the names and\n\t\t * values are equal.\n\t\t * </p>\n\t\t *\n\t\t * @param o the <code>Object</code> to test for equality with this\n\t\t * <code>Pair</code>\n\t\t * @return <code>true</code> if the given <code>Object</code> is equal to this\n\t\t * <code>Pair</code> else <code>false</code>\n\t\t */\n\t\t@Override\n\t\tpublic boolean equals(Object o) {\n\t\t\tif (this == o)\n\t\t\t\treturn true;\n\t\t\tif (o instanceof Pair) {\n\t\t\t\tPair pair = (Pair) o;\n\t\t\t\tif (key != null ? !key.equals(pair.key) : pair.key != null)\n\t\t\t\t\treturn false;\n\t\t\t\tif (value != null ? !value.equals(pair.value) : pair.value != null)\n\t\t\t\t\treturn false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t}\n\n}", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\nsa1=(a1-b1)*t1\nsa2=(a2-b2)*t2\nif sa1>=0:\n sa1*=-1\n sa2*=-1\nif sa1+sa2==0:\n print(\"infinity\")\nif sa1+sa2<0:\n print(0)\nif sa1+sa2>0:\n ans=((-sa1)//(sa2+sa1))*2+1\n if sa1%(sa1+sa2)==0:\n ans-=1\n print(ans)\n", "T1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\n\nif B1>A1:\n A1,A2,B1,B2=B1,B2,A1,A2\n \nif A1*T1+A2*T2>B1*T1+B2*T2:\n print(0)\n exit()\nif A1*T1+A2*T2==B1*T1+B2*T2:\n print(\"infinity\")\n exit()\n\nx=(T1*A1-T1*B1)//((B1-A1)*T1+(B2-A2)*T2)+1\nans=2*x-1\nif (T1*A1-T1*B1)%((B1-A1)*T1+(B2-A2)*T2)==0:\n ans-=1\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tlong T1 = scn.nextLong(), T2 = scn.nextLong(), A1 = scn.nextLong(), A2 = scn.nextLong(), B1 = scn.nextLong(),\n\t\t\t\tB2 = scn.nextLong();\n\t\tlong ans = 0;\n\t\tif (A1 < B1) {\n\t\t\tlong buf1 = A1, buf2 = A2;\n\t\t\tA1 = B1;\n\t\t\tA2 = B2;\n\t\t\tB1 = buf1;\n\t\t\tB2 = buf2;\n\t\t}\n\t\tif (A2 < B2) {\n\t\t\tlong d = (B1 * T1 + B2 * T2) - (A1 * T1 + A2 * T2);\n\t\t\tif (d == 0) {\n\t\t\t\tSystem.out.println(\"infinity\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (d > 0) {\n\t\t\t\tif ((A1 -B1)* T1 % d == 0) {\n\t\t\t\t\tans = ((A1 - B1) * T1 / d)*2;\n\t\t\t\t} else {\n\t\t\t\t\tans = ((A1 - B1) * T1 / d)*2 + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\tlong long T1, T2, A1, A2, B1, B2;\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\tif (T1 * A1 + T2 * A2 == T1 * B1 + T2 * B2) {\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif (A1 < B1) swap(A1, B1), swap(A2, B2);\n\tif (T1 * A1 + T2 * A2 > T1 * B1 + T2 * B2) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tlong long SA1 = T1 * A1, SA2 = T2 * A2, SB1 = T1 * B1, SB2 = T2 * B2;\n\tlong long ANS = (SA1 - SB1 - 1) / (SB1 + SB2 - SA1 - SA2) * 2 + 1;\n\tlong long ANS2 = (ANS + 1) / 2;\n\tif (ANS2 * (SB1 + SB2 - SA1 - SA2) == SA1 - SB1) cout << ANS2 * 2 << endl;\n\telse cout << ANS << endl;\n}", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\np = (a1 - b1) * t1\nq = (a2 - b2) * t2\nif p > 0:\n p = -1 * p\n q = -1 * q\n\nif p + q < 0:\n print(0)\nelif p + q == 0:\n print('infinity')\nelse:\n s = -p // (p+q)\n t = -p % (p+q)\n if t == 0:\n print(2*s)\n else:\n print(2*s+1)", "from math import ceil\nT1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\n\n\n#A1>=B1にする\nif A1>=B1:\n pass\nelse:\n A1,B1=B1,A1\n A2,B2=B2,A2\n\nD1=(A1-B1)*T1#>=0\nD2=(A2-B2)*T2#?\n\nif D1==-D2:\n print(\"infinity\")\nelif D1+D2>=0:\n print(\"0\")\nelse:\n diff = abs(D1+D2)#マイからこれだけ差が開く\n if D1%diff==0:\n print(D1//diff*2)\n else:\n print(ceil(D1/diff)*2-1)\n", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\nif t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2:\n print(\"infinity\")\n exit()\nif a1 < b1:\n tnp = a1\n a1 = b1\n b1 = tnp\n tnp = a2\n a2 = b2\n b2 = tnp\nif (a1-b1) * t1 + (a2-b2) * t2 > 0:\n print(0)\n exit()\nnum = -(a1-b1) * t1 - (a2-b2) * t2\nans = 1\n\nans += ((a1-b1)*t1 // num)*2\nif (a1-b1)*t1 % num == 0:\n ans -= 1\nprint(ans)", "*T, = map(int,input().split())\n*A, = map(int,input().split())\n*B, = map(int,input().split())\n\nif A[0]*T[0]+A[1]*T[1] == B[0]*T[0]+B[1]*T[1]:\n print(\"infinity\")\nelse:\n if A[0]<B[0] : A,B = B,A\n if A[0]*T[0]+A[1]*T[1] > B[0]*T[0]+B[1]*T[1] :\n print(0)\n else:\n L = (A[0]-B[0]) * T[0]\n d = -((A[0]-B[0]) * T[0] + (A[1]-B[1]) * T[1])\n ans = L//d*2 + (L%d>0)\n print(ans)", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n\nint main() {\n\n // cin.tie(0);\n // ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n LL T1,T2,A1,A2,B1,B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n LL D1 = A1-B1, D2 = A2-B2;\n if(D1 > 0){\n D1 = -D1;\n D2 = -D2;\n }\n\n LL X = T1*D1, Y = T2*D2;\n\n if(D2 < 0){\n cout << 0 << endl;\n }else if(-X == Y){\n cout <<\"infinity\" << endl;\n }else if(X+Y < 0){\n cout << 0 << endl;\n }else{\n LL res = (-X)/(X+Y)*2 + (((-X)%(X+Y)==0)?0:1);\n cout << res << endl;\n }\n\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int T1, T2;\n long long A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n \n long long a=T1*A1-T1*B1, b=T2*A2-T2*B2;\n if(a==-b){\n cout << \"infinity\"<< endl;\n return 0;\n }\n long long ans=0;\n if((a<0 && a+b>0) || (a>0 && a+b<0)){\n ans=abs(a/(a+b))*2;\n if(a%(a+b)!=0) ans++;\n }\n cout << ans << endl; \n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint T1, T2;\nlong long A1, A2, B1, B2, P, Q;\nint main()\n{\n cin >> T1 >> T2;\n cin >> A1 >> A2;\n cin >> B1 >> B2;\n P = (A1 - B1) * T1;\n Q = (A2 - B2) * T2;\n if(P > 0){\n P *= -1;\n Q *= -1;\n }\n if( P + Q < 0){\n cout << 0 << endl;\n }\n else if(P + Q == 0)\n {\n cout << \"infinity\" << endl;\n }\n else\n {\n long long int S = (-P) / (P+Q);\n long long int T = (-P) % (P+Q);\n if (T!=0)\n cout << S * 2+1 << endl;\n else\n cout << S * 2 << endl;\n }\n return 0;\n}", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nd1 = (A1-B1)*T1\nd2 = (A2-B2)*T2\n\nif d1*d2>0:\n print(0)\n exit()\n\nif d1<0:\n d1 *= -1\n d2 *= -1\n\nif d1+d2>0:\n print(0)\n exit()\n\nif d1+d2==0:\n print('infinity')\n exit()\n\nt = -d2-d1\n\nif d1%t==0:\n print(d1//t*2)\nelse:\n print(d1//t*2+1)", "#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n long long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\n if (a1 > b1) {\n swap(a1, b1);\n swap(a2, b2);\n }\n\n if (a1 == b1 || t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2) {\n cout << \"infinity\" << endl;\n } else if (t1 * a1 + t2 * a2 < t1 * b1 + t2 * b2) {\n cout << \"0\" << endl;\n } else {\n long long d1 = t1 * b1 - t1 * a1;\n long long d2 = (t1 * a1 + t2 * a2) - (t1 * b1 + t2 * b2);\n cout << 2 * (d1 / d2) - (d1 % d2 == 0 ? 1 : 0) + 1 << endl;\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long s, t; cin >> s >> t;\n long long a, b, c, d; cin >> a >> b >> c >> d;\n a *= s; c *= s; b *= t; d *= t;\n b += a; d += c;\n if (b == d) {\n cout << \"infinity\" << endl;\n return 0;\n }\n if ((b > d) == (a > c)) {\n cout << 0 << endl;\n return 0;\n }\n if (b > d) {\n swap(b, d); swap(a, c);\n }\n long long x = d - b;\n long long y = a - c;\n cout << (y / x) * 2 + 1 - (y % x == 0) << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long t[2], a[2], b[2];\n\nvoid solve();\n\nint main() {\n cin >> t[0] >> t[1] >> a[0] >> a[1] >> b[0] >> b[1];\n solve();\n return 0;\n}\n\nvoid solve() {\n long long x = (a[0] - b[0]) * t[0],\n y = (b[1] - a[1]) * t[1];\n if(x == y) {\n cout << \"infinity\" << endl;\n return;\n }\n if((x < 0 && y > 0) || (x > 0 && y < 0) ||\n abs(x) - abs(y) > 0) {\n cout << 0 << endl;\n return;\n }\n if(x < 0) {\n x *= -1;\n y *= -1;\n }\n y -= x;\n cout << (x % y != 0) + 2 * (x / y) << endl;\n}", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main()\n{\n\tlong long A1, A2, B1, B2, T1, T2, D1, D2, D3, p, q;\n\tcin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\tD1 = (A1 - B1) * T1;\n\tD2 = (A2 - B2) * T2;\n\n\tif (D1 < 0) {\n\t\tD1 *= -1; D2 *= -1;\n\t}\n\tif (D1 + D2 > 0) {\n\t\tcout << 0;\n\t}\n\telse if (D1 + D2 == 0) {\n\t\tcout << \"infinity\";\n\t}\n\telse {\n\t\t// D1 + D2 < 0\n\t\t// abs(D1) < abs(D2)\n\t\tD3 = -(D1 + D2);\n\t\tp = D1 / D3, q = D1 % D3;\n\t\tif (q) cout << p * 2 + 1;\n\t\telse cout << p * 2;\n\t}\n\treturn 0;\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n // TODO solve\n public static void main(final String[] args) {\n final Scanner scanner = new Scanner(System.in);\n final long t1 = scanner.nextInt();\n final long t2 = scanner.nextInt();\n final long tmp1 = scanner.nextLong();\n final long tmp2 = scanner.nextLong();\n final long tmp3 = scanner.nextLong();\n final long tmp4 = scanner.nextLong();\n\n final long a1;\n final long a2;\n final long b1;\n final long b2;\n if (tmp1 > tmp3) {\n a1 = tmp1;\n a2 = tmp2;\n b1 = tmp3;\n b2 = tmp4;\n } else {\n b1 = tmp1;\n b2 = tmp2;\n a1 = tmp3;\n a2 = tmp4;\n }\n\n final long distanceInT1 = (a1 - b1) * t1;\n final long distanceInT2 = b2 * t2 + b1 * t1 - (a2 * t2 + a1 * t1);\n if (distanceInT2 == 0) {\n System.out.println(\"infinity\");\n return;\n }\n if (distanceInT2 < 0) {\n System.out.println(0);\n return;\n }\n if (distanceInT1 < distanceInT2) {\n System.out.println(1);\n return;\n }\n if (distanceInT1 % distanceInT2 == 0) {\n System.out.println(2 * (distanceInT1 / distanceInT2));\n return;\n }\n System.out.println(1 + 2 * (distanceInT1 / distanceInT2));\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n\tll t1,t2,a1,a2,b1,b2;\n\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\ta1 *= t1;\n\ta2 *= t2;\n\tb1 *= t1;\n\tb2 *= t2;\n\tif((a1 + a2) < (b1 + b2)){\n\t\tswap(a1,b1);\n\t\tswap(a2,b2);\n\t}\n\tll c1,c2;\n\tc1 = a1 - b1;\n\tc2 = a2 - b2;\n\tif(c1 + c2 == 0){\n\t\tcout << \"infinity\" << endl;\n\t}\n\telse if(c1 > 0){\n\t\tcout << 0 << endl;\n\t}\n\telse{\n\t\tll sum = 0;\n\t\tif(c1 < 0)\n\t\t\tsum--;\n\t\tsum += c2 / (c1 + c2) * 2;\t\n\t\tif(c2 % (c1 + c2) == 0)\n\t\t\tsum--;\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\n\nint main() {\n int64 T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n int64 S = T1 * A1 + T2 * A2;\n int64 T = T1 * B1 + T2 * B2;\n if(S == T) {\n cout << \"infinity\" << endl;\n } else {\n int64 U = B2 * T2 - A2 * T2;\n cout << max(U / (T - S) * 2 - 1 - (U % (T - S) == 0), 0LL) << endl;\n }\n}\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nP = (A1 - B1) * T1\nQ = (A2 - B2) * T2\nif P > 0:\n\tP *= -1\n\tQ *= -1\n\nif P + Q < 0:\n\tprint(0)\nelif P + Q == 0:\n\tprint(\"infinity\")\nelse:\n\tS = (-P) // (P + Q)\n\tT = (-P) % (P + Q)\n\tif T != 0:\n\t\tprint(S * 2 + 1)\n\telse:\n\t\tprint(S * 2)\n", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n\tint t1,t2;\n\tcin >> t1 >> t2;\n\tll a1,a2;\n\tcin >> a1 >> a2;\n\tll b1,b2;\n\tcin >> b1 >> b2;\n\t\n\t\n\tll dist1 = a1*t1 - b1*t1;\n\tll dist2 = a2*t2 - b2*t2;\n\t\n\tif(dist1 > 0){\n\t\tdist1 *= -1;\n\t\tdist2 *= -1;\n\t}\n\t\n\tif(dist1 + dist2 == 0){\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\tif(dist1 + dist2 < 0){\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\t\n\t\n\tll s = (-dist1)/(dist1 + dist2);\n\tll t = (-dist1)%(dist1 + dist2);\n\t\n\tif(t == 0){\n\t\tcout << 2*s << endl;\n\t}\n\telse{\n\t\tcout << 2*s+1 << endl;\n\t}\n\treturn 0;\n}\n", "import java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.IntPredicate;\nimport java.util.function.LongPredicate;\n\npublic class Main {\n\n static int T1, T2;\n static long A1, A2, B1, B2;\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n T1 = sc.nextInt();\n T2 = sc.nextInt();\n A1 = sc.nextLong();\n A2 = sc.nextLong();\n B1 = sc.nextLong();\n B2 = sc.nextLong();\n\n System.out.println(solve());\n }\n\n static String solve() {\n // 距離にしてしまう\n A1 = A1 * T1;\n A2 = A2 * T2;\n B1 = B1 * T1;\n B2 = B2 * T2;\n\n if( A1 + A2 == B1 + B2 ) return \"infinity\";\n\n // A側を先に行くほうにする\n if( A1 + A2 < B1 + B2 ) {\n long t1 = A1;\n A1 = B1;\n B1 = t1;\n long t2 = A2;\n A2 = B2;\n B2 = t2;\n }\n\n // 先行する上に前半早いので追いつかない\n if( A1 > B1 ) return \"0\";\n\n // Aが後半早い+ 距離も長いのでそのうちBは追いつけなくなる\n // 何ターン目まで追いかけっこが成立するかでわかる\n // 算数するかにぶたんするか\n // ...算数が苦手なのでにぶたんする\n long turn = maximizeL(0, Long.MAX_VALUE/2, t -> {\n // Bが前半のうちにAを上回ることができるか\n // longがoverflowするのでBigInteger\n // 大した回数ではないので問題ない\n BigInteger b = BigInteger.valueOf(B1+B2).multiply(BigInteger.valueOf(t-1)).add(BigInteger.valueOf(B1));\n BigInteger a = BigInteger.valueOf(A1+A2).multiply(BigInteger.valueOf(t-1)).add(BigInteger.valueOf(A1));\n return b.compareTo(a) >= 0;\n // return (B1 + B2) * (t-1) + B1 >= (A1 + A2) * (t-1) + A1;\n });\n\n // 追っかけっこが成立してるターン * 2\n // 0の分を引く\n long ans = turn*2 - 1;\n\n // コーナーケース\n // 最後のターンの折り返し地点で同値になっている場合-1\n BigInteger lb = BigInteger.valueOf(B1+B2).multiply(BigInteger.valueOf(turn-1)).add(BigInteger.valueOf(B1));\n BigInteger la = BigInteger.valueOf(A1+A2).multiply(BigInteger.valueOf(turn-1)).add(BigInteger.valueOf(A1));\n if( lb.equals(la) ) {\n ans--;\n }\n return String.valueOf(ans);\n }\n\n static long maximizeL(long lo, long hi, LongPredicate p) {\n while(lo < hi) {\n long x = ((hi - lo) >>> 1) + lo;\n if( p.test(x) ) {\n lo = x + 1;\n } else {\n hi = x;\n }\n }\n return lo - 1;\n }\n\n @SuppressWarnings(\"unused\")\n static class FastScanner {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = nextInt();\n return a;\n }\n\n int[] nextIntArray(int n, int delta) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = nextInt() + delta;\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) a[i] = nextLong();\n return a;\n }\n }\n\n static void writeLines(int[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (int a : as) pw.println(a);\n pw.flush();\n }\n\n static void writeLines(long[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (long a : as) pw.println(a);\n pw.flush();\n }\n\n static void writeSingleLine(int[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (int i = 0; i < as.length; i++) {\n if (i != 0) pw.print(\" \");\n pw.print(as[i]);\n }\n pw.println();\n pw.flush();\n }\n\n static int max(int... as) {\n int max = Integer.MIN_VALUE;\n for (int a : as) max = Math.max(a, max);\n return max;\n }\n\n static int min(int... as) {\n int min = Integer.MAX_VALUE;\n for (int a : as) min = Math.min(a, min);\n return min;\n }\n\n static void debug(Object... args) {\n StringJoiner j = new StringJoiner(\" \");\n for (Object arg : args) {\n if (arg == null) j.add(\"null\");\n else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));\n else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));\n else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));\n else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));\n else j.add(arg.toString());\n }\n System.err.println(j.toString());\n }\n\n static void printSingleLine(int[] array) {\n PrintWriter pw = new PrintWriter(System.out);\n for (int i = 0; i < array.length; i++) {\n if (i != 0) pw.print(\" \");\n pw.print(array[i]);\n }\n pw.println();\n pw.flush();\n }\n\n static int lowerBound(int[] array, int value) {\n int lo = 0, hi = array.length, mid;\n while (lo < hi) {\n mid = (hi + lo) / 2;\n if (array[mid] < value) lo = mid + 1;\n else hi = mid;\n }\n return lo;\n }\n\n static int upperBound(int[] array, int value) {\n int lo = 0, hi = array.length, mid;\n while (lo < hi) {\n mid = (hi + lo) / 2;\n if (array[mid] <= value) lo = mid + 1;\n else hi = mid;\n }\n return lo;\n }\n}\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n public static void main(String[] args) throws IOException\n {\n BufferedReader r = new BufferedReader(new InputStreamReader(System.in), 1);\n String s;\n String sl[];\n\n s = r.readLine();\n sl = s.split(\" \");\n long t1 = Long.parseLong(sl[0]);\n long t2 = Long.parseLong(sl[1]);\n\n s = r.readLine();\n sl = s.split(\" \");\n long a1 = Long.parseLong(sl[0]);\n long a2 = Long.parseLong(sl[1]);\n\n s = r.readLine();\n sl = s.split(\" \");\n long b1 = Long.parseLong(sl[0]);\n long b2 = Long.parseLong(sl[1]);\n\n a1 -= b1;\n a2 -= b2;\n\n if(a1 < 0)\n {\n a1 = - a1;\n a2 = - a2;\n }\n\n long v = a1 * t1 + a2 * t2;\n\n if(v == 0)\n {\n System.out.println(\"infinity\");\n System.exit(0);\n }\n\n if(v > 0)\n {\n System.out.println(\"0\");\n System.exit(0);\n }\n\n long a = a1 * t1;\n long b = a2 * t2;\n// System.out.println(a);\n// System.out.println(b);\n// System.out.println(v);\n// System.out.println(a / (- v));\n// System.out.println((- b + v + (- v - 1)) / (- v));\n\n System.out.println(a / (- v) + (- b + v + (- v - 1)) / (- v));\n\n }\n\n}\n\nclass RemRing\n{\n long module;\n\n public RemRing(long module)\n {\n this.module = module;\n }\n\n public long sum(long a, long b)\n {\n return (a + b + module) % module;\n }\n\n public long sub(long a, long b)\n {\n return (a - b + module) % module;\n }\n\n public long prod(long a, long b)\n {\n return (a * b) % module;\n }\n\n public long div(long a, long b)\n {\n return (a * inv(b)) % module;\n }\n\n public long inv(long a)\n {\n long b = this.module;\n long u = 1;\n long v = 0;\n while (b > 0)\n {\n long t = a / b;\n a -= t * b;\n u -= t * v;\n long z = a;\n a = b;\n b = z;\n z = u;\n u = v;\n v = z;\n }\n u %= this.module;\n if (u < 0)\n u += this.module;\n return u;\n }\n}\n", "T1,T2 = map(int,input().split())\nA1,A2 = map(int,input().split()) #高橋君\nB1,B2 = map(int,input().split()) #青木君\n\nD1,D2 = (A1-B1)*T1, (A1-B1)*T1+(A2-B2)*T2\n\nif D1*D2 > 0:\n print(0)\nelif D2 == 0:\n print(\"infinity\")\nelse:\n if -D1%D2 == 0:\n print(-D1//D2*2)\n else:\n print(-D1//D2*2+1)", "t1, t2 = list(map(int, input().split()))\na1, a2 = list(map(int, input().split()))\nb1, b2 = list(map(int, input().split()))\n\nfin_gap = t1 * (a1 - b1) + t2 * (a2 - b2)\nmid_gap = t1 * (a1 - b1) \n\nif fin_gap == 0:\n print(\"infinity\")\nelse:\n if mid_gap * fin_gap > 0:\n print(0)\n else:\n \n mod = abs(mid_gap) % abs(fin_gap)\n q = abs(mid_gap) // abs(fin_gap)\n \n if mod == 0:\n ans = q * 2\n else:\n ans = q * 2 + 1\n \n print(ans)", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tlong t1=sc.nextLong();\n\t\tlong t2=sc.nextLong();\n\t\tlong a1=sc.nextLong();\n\t\tlong a2=sc.nextLong();\n\t\tlong b1=sc.nextLong();\n\t\tlong b2=sc.nextLong();\n\t\tif((a1>b1 && a1*t1+a2*t2>b1*t1+b2*t2) || (b1>a1 && a1*t1+a2*t2<b1*t1+b2*t2)){\n\t\t\tSystem.out.println(0);\n\t\t}else if(a1*t1+a2*t2==b1*t1+b2*t2){\n\t\t\tSystem.out.println(\"infinity\");\n\t\t}else{\n\t\t\tlong kk=0;\n\t\t\tif((Math.abs(a1*t1-b1*t1)%Math.abs(a1*t1+a2*t2-(b1*t1+b2*t2)))==0){\n\t\t\t\tkk=-1;\n\t\t\t}\n\t\t\tSystem.out.println(kk+1+2*(Math.abs(a1*t1-b1*t1)/Math.abs(a1*t1+a2*t2-(b1*t1+b2*t2))));\n\t\t}\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int64_t t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n if (t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2) {\n cout << \"infinity\" << endl;\n } else if ((t1 * a1 > t1 * b1) == (t1 * a1 + t2 * a2 > t1 * b1 + t2 * b2)) {\n cout << 0 << endl;\n } else {\n cout << 1 + 2 * (abs(t1 * a1 - t1 * b1) / abs((t1 * a1 + t2 * a2) - (t1 * b1 + t2 * b2)))\n - (abs(t1 * a1 - t1 * b1) % abs((t1 * a1 + t2 * a2) - (t1 * b1 + t2 * b2)) == 0);\n }\n}\n", "#include<bits/stdc++.h>\n#define INF 9223372036854775807LL\n#define inf 1000000007\n#define lol long long\n#define abs(x,y) (max(x,y)-min(x,y))\n#define mp make_pair\n#define fi first\n#define se second\nusing namespace std;\nlol a,b,c;\nlol x,y;\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n lol d=0,e=0,f=0;\n lol ans=0;\n string s;\n cin >>x>>y;\n cin >>a>>b>>c>>d;\n e=(a-c)*x,f=(b-d)*y;\n if(e==-f){\n cout <<\"infinity\\n\";\n return 0;\n }\n if(e<0) e=-e,f=-f;\n if(e+f>0){\n cout <<0<<'\\n';\n return 0;\n }\n c=-e/(e+f);\n if(-e%(e+f)==0)\n cout <<c*2<<'\\n';\n else cout <<c*2+1<<'\\n';\n return 0;\n}\n", "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\nsigned main() {\n ios::sync_with_stdio(false); cin.tie(0);\n long long t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n long long x = t1 * (a1 - b1);\n long long y = t2 * (a2 - b2);\n if (x + y == 0) {\n cout << \"infinity\\n\";\n return 0;\n }\n if ((__int128) x * (x + y) >= 0) {\n cout << 0 << '\\n';\n return 0;\n }\n __int128 p = abs(x);\n __int128 q = abs(x + y);\n cout << (long long) (p / q * 2) + (p % q != 0) << '\\n';\n return 0;\n}", "#include\"bits/stdc++.h\"\nusing namespace std;\n#define REP(k,m,n) for(ll (k)=(m);(k)<(n);(k)++)\n#define rep(i,n) REP((i),0,(n))\nusing ll=long long;\n\nll T1,T2,A1,A2,B1,B2;\n\nint main()\n{\n\tcin>>T1>>T2>>A1>>A2>>B1>>B2;\n\tll diff = abs((A1-B1)*T1+(A2-B2)*T2);\n\tll gain = abs(A1-B1)*T1;\n\tif(diff==0){\n\t\tcout<<\"infinity\"<<endl;\n\t\treturn 0;\n\t}\n\tif((A1*T1>B1*T1)==(A1*T1+A2*T2>B1*T1+B2*T2)){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tcout<<2*(gain/diff+1)-1 - (gain%diff==0?1:0)<<endl;\n\treturn 0;\n}\n", "def main():\n t1,t2=map(int,input().split())\n a1,a2=map(int,input().split())\n b1,b2=map(int,input().split())\n if t1*a1+t2*a2==t1*b1+t2*b2:\n return 'infinity'\n if a1<b1:\n a1,b1=b1,a1\n a2,b2=b2,a2\n if a2>b2:\n return 0\n d1=(a1-b1)*t1\n d2=(b2-a2)*t2\n if d1>d2:\n return 0\n d=d2-d1\n if d1%d==0:\n return d1//d*2\n return d1//d*2+1\n \nif __name__=='__main__':\n print(main())", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tlong long T1,T2,a,b,c,d,e,f;\n\tcin>>T1>>T2>>a>>c>>b>>d;\n\tif(a*T1+c*T2==b*T1+d*T2){\n\t\tcout<<\"infinity\";\n\t\treturn 0;\n\t}\n\tif(a<b)swap(a,b),swap(c,d);\n\te=a-b;f=c-d; \n\tif(e*T1+f*T2>0&&e*T1>0){\n\t\tcout<<0;\n\t\treturn 0;\n\t}\n\tif(e*T1+f*T2<0&&e*T1<0){\n\t\tcout<<0;\n\t\treturn 0;\n\t}\n\tcout<<2ll*(((a-b)*T1)/(-e*T1-f*T2))+bool(((a-b)*T1)%(1ll*(-e*T1-f*T2)));\n}", "import sys\nT1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nif A1*T1+A2*T2 == B1*T1+B2*T2:\n print('infinity') \n sys.exit()\nd1 = A1*T1-B1*T1\nd2 = A2*T2-B2*T2\nd = d1+d2\nif d1<0:\n d = -d\n d1 = -d1\n d2 = -d2\nif d>0:\n print(0)\n sys.exit()\nd = -d\nif d1%d == 0:\n print(d1//d*2)\nelse:\n ans = d1//d*2+1\n print(ans)\n\n\n", "T1,T2=map(int,input().split())\nA1,A2=map(int,input().split())\nB1,B2=map(int,input().split())\n\nDA=T1*A1+T2*A2\nDB=T1*B1+T2*B2\ndA=T1*A1\ndB=T1*B1\nF=abs(DA-DB)\nf=abs(dA-dB)\nif F==0:\n\tprint(\"infinity\")\nelif DA>DB:\n\tif dA>dB:\n\t\tprint(0)\n\telse:\n\t\tif f%F==0:\n\t\t\tprint((int(f//F))*2)\n\t\telse:\n\t\t\tprint((int(f//F))*2+1)\nelse:\n\tif dA<dB:\n\t\tprint(0)\n\telse:\n\t\tif f%F==0:\n\t\t\tprint((int(f//F))*2)\n\t\telse:\n\t\t\tprint((int(f//F))*2+1)", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\ntypedef long long ll;\nint main(){\n ll t1,t2,a1,a2,b1,b2;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n ll X01=(a1-b1)*t1,X02=X01+(a2-b2)*t2;\n if(X02==0){cout<<\"infinity\";return 0;}\n if(X01<0&&X02<0){cout<<0;return 0;}\n if(X01>0&&X02>0){cout<<0;return 0;}\n cout<<1-(abs(X01)%abs(X02)==0)+abs(X01)/abs(X02)*2;\n}", "import sys\nread = sys.stdin.read\n\nT1, T2, A1, A2, B1, B2 = map(int, read().split())\nanswer = 0\nv1 = A1 - B1\nv2 = A2 - B2\nd = v1 * T1 + v2 * T2\n\nif d == 0:\n print('infinity')\n exit()\nelif v1 * d > 0:\n print(0)\n exit()\n\nif v1 * T1 % -d == 0:\n print(v1 * T1 // -d * 2)\nelse:\n print(v1 * T1 // -d * 2 + 1)", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\nsA = T1*A1+T2*A2\nsB = T1*B1+T2*B2\nif sA == sB:\n print(\"infinity\")\n exit()\nhA = T1*A1\nhB = T1*B1\nif sA > sB:\n hA, sA, hB, sB = hB, sB, hA, sA\n#print(hA, sA, hB, sB)\nif hA < hB:\n print(0)\n exit()\nif (hA-hB)%(sB-sA) == 0:\n r = 2*((hA-hB)//(sB-sA))\nelse:\n r = 2*((hA-hB)//(sB-sA))+1\nprint(r)\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.math.BigInteger;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tint T1 = sc.nextInt();\n\t\tint T2 = sc.nextInt();\n\t\tlong A1 = sc.nextLong();\n\t\tlong A2 = sc.nextLong();\n\t\tlong B1 = sc.nextLong();\n\t\tlong B2 = sc.nextLong();\n\t\t\n\t\t// 無限判定\n\t\tBigInteger AT1 = new BigInteger(Long.toString((long)A1*T1));\n\t\tBigInteger BT1 = new BigInteger(Long.toString((long)B1*T1));\n\t\tBigInteger AT2 = new BigInteger(Long.toString((long)A2*T2));\n\t\tBigInteger BT2 = new BigInteger(Long.toString((long)B2*T2));\n\t\tAT2 = AT2.add(AT1);\n\t\tBT2 = BT2.add(BT1);\n\t\tif (AT2.compareTo(BT2) == 0) {\n\t\t\tSystem.out.println(\"infinity\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t// すれ違い判定\n\t\tif (AT1.compareTo(BT1) > 0 == AT2.compareTo(BT2) > 0) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t// ここまでくれば必ずT1-T2の間に1度すれ違う\n\t\tBigInteger result = BigInteger.ZERO;\n\t\tBigInteger X1 = AT1.subtract(BT1).abs();\n\t\tBigInteger AT1T2 = AT2.add(AT1);\n\t\tBigInteger BT1T2 = BT2.add(BT1);\n \n if (AT1.compareTo(BT1) > 0 ^ AT1T2.compareTo(BT1T2) > 0) {\n System.out.println(1);\n return;\n }\n \n \n\t\tBigInteger X2 = AT1T2.subtract(BT1T2).abs();\n\t\tBigInteger sabun = X1.subtract(X2);\n\t\tBigInteger kaisu = X1.divide(sabun);\n\t\tBigInteger amari = X1.remainder(sabun);\n\t\tif (amari.compareTo(BigInteger.ZERO) == 0) {\n\t\t\t// 差分が割り切れる場合は2*差分が答え\n\t\t\tresult = kaisu.multiply(new BigInteger(\"2\"));\n\t\t} else {\n\t\t\tresult = kaisu.multiply(new BigInteger(\"2\")).add(BigInteger.ONE);\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(result.toString());\n\t\t\n\t}\n\t\n\t\n\t\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}\n", "T1, T2 = list(map(int, input().split()))\nA1, A2 = list(map(int, input().split()))\nB1, B2 = list(map(int, input().split()))\n\na, b = A1 * T1, A2 * T2\nc, d = B1 * T1, B2 * T2\n\nif a + b == c+ d:\n print(\"infinity\")\n exit()\nif a + b < c+d:\n a,b,c,d = c,d,a,b\nif a > c:\n print(0)\n exit()\nelse:\n num = 0\n if (c-a) % (a+b-c-d) == 0:\n num = 1\n print((c-a-1) // (a+b-c-d) * 2+num+1)\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < n; i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint main()\n{\n\tll t1,t2,a1,a2,b1,b2;\n\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\tif (a1*t1 + a2*t2 == b1*t1 + b2*t2)\n\t{\n\t\tcout << \"infinity\" << endl;\n\t\treturn 0;\n\t}\n\n\tif (a1 < b1)\n\t{\n\t\tswap(a1,b1);\n\t\tswap(a2,b2);\n\t}\n\n\tif (a1*t1 + a2*t2 > b1*t1 + b2*t2)\n\t{\n\t\tcout << \"0\" << endl;\n\t}\n\telse\n\t{\n\t\tll diff = (b1*t1 + b2*t2) - (a1*t1 + a2*t2);\n\t\tll ans = 1 + (a1*t1 - b1*t1) / diff * 2;\n\t\tif ((a1*t1 - b1*t1) % diff == 0) ans--;\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "T1, T2 = list(map(int, input().split()))\nA1, A2 = list(map(int, input().split()))\nB1, B2 = list(map(int, input().split()))\n\nif A1*T1+A2*T2==B1*T1+B2*T2:\n print('infinity')\n exit()\n\nif A1*T1+A2*T2 < B1*T1+B2*T2:\n A1, B1 = B1, A1\n A2, B2 = B2, A2\n\nif A1>B1:\n print(0)\n exit()\n\nDtot = (A1*T1+A2*T2) - (B1*T1+B2*T2)\nDmin = (B1*T1) - (A1*T1)\n\nans = 2*((Dmin-1)//Dtot) + 1\nif Dmin%Dtot==0: ans+=1\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n long long T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n if(T1 * A1 + T2 * A2 == T1 * B1 + T2 * B2) puts(\"infinity\");\n else {\n if(T1 * A1 + T2 * A2 > T1 * B1 + T2 * B2) {\n swap(A1, B1);\n swap(A2, B2);\n }\n if(A1 < B1) puts(\"0\");\n else {\n cout << (A1 - B1) * T1 / ((T1 * B1 + T2 * B2) - (T1 * A1 + T2 * A2)) * 2 + 1 - ((A1 - B1) * T1 % ((T1 * B1 + T2 * B2) - (T1 * A1 + T2 * A2)) == 0)<< endl;\n }\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint t[2];\nlong long a[2], b[2], x, y;\n\nint main() {\n\tcin >> t[0] >> t[1] >> a[0] >> a[1] >> b[0] >> b[1];\n\tx = (a[0] - b[0]) * t[0];\n\ty = (a[1] - b[1]) * t[1];\n\n\tif (x + y == 0)\n\t\tcout << \"infinity\" << endl;\n\telse if ((x > 0) ^ (x + y > 0))\n\t\tcout << -x / (x + y) + (abs(y) - 1) / abs(x + y) << endl;\n\telse\n\t\tcout << 0 << endl;\n}\n", "t1,t2 = list(map(int, input().split()))\na1,a2 = list(map(int, input().split()))\nb1,b2 = list(map(int, input().split()))\nx=(a1-b1)*t1 + (a2-b2)*t2\nif x == 0:\n print(\"infinity\")\nelif x*(a1-b1) > 0:\n print(0)\nelse:\n s,t = divmod(abs((a1-b1)*t1), abs(x))\n if t:\n print(s*2+1)\n else:\n print(s*2)\n", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\n\na=a1-b1\nb=a2-b2\n\nif a<=0:\n a *= -1\n b *= -1\n\nX=t1*a\nY=t2*b\n\n\nif X+Y==0:\n print('infinity')\nelif X+Y>0:\n print(0)\nelse:\n T=X//abs(X+Y)\n if X%abs(X+Y)==0:\n print(T*2)\n else:\n print(T*2+1)\n", "def sumitb2019_f():\n t1, t2 = map(int, input().split())\n a1, a2 = map(int, input().split())\n b1, b2 = map(int, input().split())\n\n p = (a1 - b1) * t1\n q = (a2 - b2) * t2\n if p > 0:\n p *= -1\n q *= -1\n\n if p + q < 0:\n ans = 0\n elif p + q == 0:\n ans = 'infinity'\n else:\n s, t = divmod(-p, p + q)\n if t == 0: ans = s * 2\n else: ans = s * 2 + 1\n print(ans)\n\nif __name__ == '__main__':\n sumitb2019_f()", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll t1,t2,a1,a2,b1,b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n a1 *= t1;\n a2 *= t2;\n b1 *= t1;\n b2 *= t2;\n a2 += a1;\n b2 += b1;\n if(a2 == b2) {\n cout << \"infinity\" << '\\n';\n return 0;\n }\n if(a2 < b2) {\n swap(a1, b1);\n swap(a2, b2);\n }\n\n if(a1 > b1) {\n cout << 0 << '\\n';\n return 0;\n }\n\n ll c = b1-a1;\n ll d = a2-b2;\n\n // how many turns c can catch up d\n cout << c/d*2 + (c%d>0) << '\\n';\n\n return 0;\n}", "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n private static String solve(long t1, long t2, long c1, long c2) {\n// System.err.printf(\"%d %d %d %d\\n\", t1, t2, c1, c2);\n long d1 = t1 * c1;\n long d2 = t2 * c2;\n // k * d1 - (k - 1) d2 > 0\n // k * d1 - k * d2 - d2 > 0\n // (d1 - d2) k > d2\n // k < d2 / (d2 - d1)\n if (d2 % (d2 - d1) == 0) {\n return String.format(\"%d\", 2 * (d2 / (d2 - d1) - 1));\n } else {\n return String.format(\"%d\", 2 * (d2 / (d2 - d1) - 1) + 1);\n }\n }\n \n private static String solve(long t1, long t2, long a1, long a2, long b1, long b2) {\n// System.err.println(\"1\");\n if (t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2) {\n return \"infinity\";\n }\n \n// System.err.println(\"1\");\n long c1 = a1 - b1;\n long c2 = a2 - b2;\n if (c1 > 0 && c2 > 0) {\n return \"0\";\n }\n if (c1 < 0 && c2 < 0) {\n return \"0\";\n }\n if (t1 * c1 > 0 && (t1 * c1 + t2 * c2) > 0) {\n return \"0\";\n }\n if (t1 * c1 < 0 && (t1 * c1 + t2 * c2) < 0) {\n return \"0\";\n }\n \n return solve(t1, t2, Math.abs(c1), Math.abs(c2));\n }\n \n private static void execute(ContestReader reader, PrintWriter out) {\n long t1 = reader.nextLong();\n long t2 = reader.nextLong();\n long a1 = reader.nextLong();\n long a2 = reader.nextLong();\n long b1 = reader.nextLong();\n long b2 = reader.nextLong();\n out.println(solve(t1, t2, a1, a2, b1, b2));\n }\n \n public static void main(String[] args) {\n ContestReader reader = new ContestReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n execute(reader, out);\n out.flush();\n }\n}\n\nclass ContestReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n \n ContestReader(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n \n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public long nextLong() {\n return Long.parseLong(next());\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public String[] next(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = next();\n }\n return array;\n }\n \n public int[] nextInt(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n \n public long[] nextLong(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n \n public double[] nextDouble(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n \n public char[] nextCharArray() {\n return next().toCharArray();\n }\n \n public int[][] nextInt(int n, int m) {\n int[][] matrix = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextInt();\n }\n }\n return matrix;\n }\n \n public long[][] nextLong(int n, int m) {\n long[][] matrix = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextLong();\n }\n }\n return matrix;\n }\n \n public double[][] nextDouble(int n, int m) {\n double[][] matrix = new double[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextDouble();\n }\n }\n return matrix;\n }\n \n public char[][] nextCharArray(int n) {\n char[][] matrix = new char[n][];\n for (int i = 0; i < n; i++) {\n matrix[i] = next().toCharArray();\n }\n return matrix;\n }\n}\n", "t1,t2 = map(int,input().split())\na1,a2 = map(int,input().split())\nb1,b2 = map(int,input().split())\nv1 = [a1,b1]\nd = a1*t1 + a2*t2 - b1*t1 - b2*t2\nif d == 0:\n print(\"infinity\")\n exit()\nif d > 0:\n f = 0\n s = 1\nelse:\n f = 1\n s = 0\n d = -d\nl = t1*(v1[s]-v1[f])\nif l < 0:\n print(0)\n exit()\ntm = int(l//d)\nif int(l%d) == 0:\n print(2*tm)\nelse:\n print(1+2*tm)", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nng = \"infinity\"\n\nfirst = t1 * a1 - t1 * b1\nsecond = t1 * a1 + t2 * a2 - t1 * b1 - t2 * b2\n\nif second == 0:\n print(ng)\n exit()\n\nif first * second > 0:\n print(0)\n exit()\n\nif first < 0:\n first *= -1\n second *= -1\nsecond *= -1\nans = 2 * (first // second) + 1\nif first % second == 0:ans -=1\nprint(ans)", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\n\nif a1 * t1 + a2 * t2 == b1 * t1 + b2 * t2:\n print('infinity')\n exit()\n\nif a1 * t1 + a2 * t2 < b1 * t1 + b2 * t2:\n a1, a2, b1, b2 = b1, b2, a1, a2\n\nif a1 > b1:\n print(0)\n exit()\n\nx = (b1 - a1) * t1\ny = a1 * t1 + a2 * t2 - b1 * t1 - b2 * t2\n\nif x % y == 0:\n print(x // y * 2)\nelse:\n print(x // y * 2 + 1)", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\na = a1 - b1\nb = a2 - b2\nif a < 0:\n a = -a\n b = -b\np = t1 * a + t2 * b\nif p > 0:\n print(0)\n exit()\nif p == 0:\n print('infinity')\n exit()\ntop = a * t1\np = -p\nans = (top // p + 1) * 2 - 1 - (top % p == 0)\nprint(ans)", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nP = (A1 - B1) * T1\nQ = (A2 - B2) * T2\n\nif P > 0:\n P *= -1\n Q *= -1\n \nif P + Q < 0:\n print(0)\nelif P + Q == 0:\n print(\"infinity\")\nelse:\n S = -P // (P + Q)\n T = -P % (P + Q)\n if T != 0:\n print(S * 2 + 1)\n else:\n print(S * 2)\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nlong long t1,t2,a1,a2,b1,b2,a,b,s,ret;\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(NULL);\n\tcout.tie(NULL);\n\tcin>>t1>>t2;\n\tcin>>a1>>a2;\n\tcin>>b1>>b2;\n\ta=a1-b1;\n\tb=a2-b2;\n\tif(a<0){\n\t\ta=-a;\n\t\tb=-b;\n\t}\n\ts=a*t1+b*t2;\n\tif(s==0){\n\t\tcout<<\"infinity\"<<endl;\n\t\treturn 0;\n\t}\n\tif(s>0){\n\t\tcout<<\"0\"<<endl;\n\t\treturn 0;\n\t}\n\tif(s<0){\n\t\tret=a*t1/(-s)+(-b)*t2/(-s);\n\t\tif((-b)*t2%(-s)==0LL)\n\t\t\tret-=1LL;\n\t\tcout<<ret<<endl;\n\t\treturn 0;\n\t}\n\treturn 0;\n}\n", "TAB = [list(map(int, input().split())) for _ in range(3)]\nT = TAB[0]\nA = TAB[1]\nB = TAB[2]\ndV1, dV2 = A[0] - B[0], A[1] - B[1]\n\ndL1, dL2 = dV1 * T[0], dV2 * T[1]\nif dL1 + dL2 == 0:\n print(\"infinity\")\nelse:\n if dL1 * (dL1 + dL2) > 0:\n print(0)\n else:\n m = dL2 * T[0] - dL1 * T[1]\n n = dL1 + dL2\n m += n * T[1]\n cnt = m // (n * (T[0] + T[1]))\n if m % (n * (T[0] + T[1])) == 0:\n print(2*cnt-2)\n else:\n print(2*cnt-1)", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll t1,t2,a1,a2,b1,b2;\nint main()\n{\n scanf(\"%lld%lld%lld%lld%lld%lld\",&t1,&t2,&a1,&a2,&b1,&b2);\n ll a=a1-b1,b=a2-b2;\n if(a<0) a*=-1,b*=-1;\n ll k=t1*a+t2*b;\n if(k==0) {printf(\"infinity\\n\");return 0;}\n if(k>0){printf(\"0\\n\");return 0;}\n ll ans=a*t1/(-k)*2+(b*t2%k!=0);\n printf(\"%lld\\n\",ans);\n}\n", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\nusing namespace std;\ntypedef long long int ll;\n\nint main() {\n ll t1, t2, a1, a2, b1, b2;\n cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n ll a = t1 * a1 - t1 * b1;\n ll b = t2 * a2 - t2 * b2;\n if (a > 0) {\n a *= -1;\n b *= -1;\n }\n if (a + b < 0) cout << 0 << endl;\n else if (a + b == 0) cout << \"infinity\" << endl;\n else {\n ll s = -a / (a + b);\n ll t = -a % (a + b);\n if (t == 0) cout << s * 2 << endl;\n else cout << s * 2 + 1 << endl;\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll,ll>;\nconst ll mod = 1e9+7;\n\nint main(void){\n ll t1,t2;\n ll a1,a2;\n ll b1,b2;\n cin >> t1 >> t2;\n cin >> a1 >> a2;\n cin >> b1 >> b2;\n if(b1 > a1){\n swap(a1,b1);\n swap(a2,b2);\n }\n ll A = (a1 - b1) * t1;\n ll B = (b2 - a2) * t2;\n if(A == B){\n puts(\"infinity\");\n return 0;\n }\n if(A > B){\n puts(\"0\");\n return 0;\n }\n ll cnt = A / (B-A);\n if(A % (B-A) == 0){\n cout << 2 * cnt << endl;\n } else {\n cout << 2 * cnt + 1 << endl;\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long int n,t1,t2,a1,a2,b1,b2,sa1,sa2,kotae;\n cin>>t1>>t2>>a1>>a2>>b1>>b2;\n sa1=a1*t1-b1*t1;\n sa2=a2*t2-b2*t2+sa1;\n if(sa1>0&&sa2>0){\n cout<<0;\n return 0;\n }\n if(sa1<0&&sa2<0){\n cout<<0;\n return 0;\n }\n if(sa2==0){\n cout<<\"infinity\";\n return 0;\n }\n sa1=abs(sa1);\n sa2=abs(sa2);\n kotae=sa1/sa2*2+1;\n if(sa1%sa2==0){\n kotae--;\n }\n cout<<kotae;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n ll step = T1*A1+T2*A2 - (T1*B1+T2*B2);\n ll hop = T1 * (A1 - B1); // != 0\n if(step == 0) {\n cout << \"infinity\" << \"\\n\";\n return 0;\n }\n if((step > 0) == (hop > 0)){\n cout << 0 << \"\\n\";\n return 0;\n }\n if(step < 0) step *= -1;\n if(hop < 0) hop *= -1;\n ll ans = hop / step;\n ans = ans * 2 + 1;\n if(hop % step == 0) ans--;\n cout << ans << \"\\n\";\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,a) for(int i=0;i<(a);i++)\nconst ll MOD=1000000007;\n//const ll MOD=998244353;\n\nint main(){\n ll T[2],A[2],B[2];\n cin>>T[0]>>T[1];\n cin>>A[0]>>A[1];\n cin>>B[0]>>B[1];\n ll X=T[0]*A[0]+T[1]*A[1];\n ll Y=T[0]*B[0]+T[1]*B[1];\n \n if(X==Y){\n cout<<\"infinity\\n\";\n return 0;\n }\n if(X>Y&&A[0]>B[0]){\n cout<<0<<endl;\n return 0;\n }\n if(X<Y&&A[0]<B[0]){\n cout<<0<<endl;\n return 0;\n }\n \n ll D=abs(X-Y);\n ll Z=abs(A[0]-B[0])*T[0];\n \n cout<<Z/D*2+(Z%D!=0)<<endl;\n return 0;\n}", "#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nsigned main(){\n int A,B,C,D,E,F;\n cin>>A>>B>>C>>D>>E>>F;\n C-=E,D-=F;\n E=A*C,F=B*D;\n if(E<0)E*=-1,F*=-1;\n if(E+F>0)puts(\"0\");\n else if(E+F==0)puts(\"infinity\");\n else if(E%(-E-F))cout<<E/(-E-F)*2+1<<endl;\n else cout<<E/(-E-F)*2<<endl;\n}", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n FIntervalRunning solver = new FIntervalRunning();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class FIntervalRunning {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n long t1 = in.readLong();\n long t2 = in.readLong();\n long a1 = in.readLong();\n long a2 = in.readLong();\n long b1 = in.readLong();\n long b2 = in.readLong();\n\n if (t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2) {\n out.printLine(\"infinity\");\n return;\n }\n\n if (a1 < b1 && a2 < b2 || a1 > b1 && a2 > b2) {\n out.printLine(0);\n return;\n }\n\n if (a1 > b1) {\n long tmp = a1;\n a1 = b1;\n b1 = tmp;\n tmp = a2;\n a2 = b2;\n b2 = tmp;\n }\n\n if (t1 * a1 + t2 * a2 < t1 * b1 + t2 * b2) {\n out.printLine(0);\n return;\n }\n\n long diff1 = t1 * b1 - t1 * a1;\n long diff2 = t1 * a1 + t2 * a2 - (t1 * b1 + t2 * b2);\n\n long ans = 1 + diff1 / diff2 * 2;\n if (diff1 % diff2 == 0) ans--;\n out.printLine(ans);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n}\n\n", "T1, T2 = map(int, input().split())\nA1, A2 = map(int, input().split())\nB1, B2 = map(int, input().split())\n\nif A1 < B1:\n A1, A2, B1, B2 = B1, B2, A1, A2\n\nxa = A1*T1 + A2*T2\nxb = B1*T1 + B2*T2\nif xa > xb:\n print(0)\nelif xa == xb:\n print('infinity')\nelse:\n d1 = (A1 - B1) * T1\n d2 = xb - xa\n n = d1 // d2\n if d1 % d2 == 0:\n print(2*n)\n else:\n print(2*n + 1)\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nint32_t main() {\n\tios::sync_with_stdio(0);cin.tie(0);\n\tint t1, t2, a1, a2, b1, b2;\n\tcin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\tint da = t1*a1+t2*a2, db = t1*b1+t2*b2, da1 = t1*a1, db1 = t1*b1;\n\tif(da == db)\n\t\treturn !(cout << \"infinity\");\n\tif((da < db) == (da1 < db1))\n\t\treturn !(cout << 0);\n\tint x = abs(da1-db1), y = abs(da-db);\n\tcout << ((x+y-1)/y)*2-1+(x % y == 0);\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nconst int MOD = 1000000007;\nstruct edge {int to,costa,costb;};\n\nsigned main() {\nint t1,t2,a1,a2,b1,b2,ans;\ncin>>t1>>t2>>a1>>a2>>b1>>b2;\nif(a1<b1){\n a1*=-1;\n b1*=-1;\n a2*=-1;\n b2*=-1;\n}\n\nif((a1-b1)*t1+(a2-b2)*t2>0){\n cout<<0;\n return 0;\n}\nif((a1-b1)*t1+(a2-b2)*t2==0){\n cout<<\"infinity\";\n return 0;\n}\nint x=(a1-b1)*t1,y=(a1-b1)*t1+(a2-b2)*t2;y*=-1;\n ans=2*(x/y);\nif(x%y==0){\n cout<<ans;\n}else {\n //cerr<<(abs(a1-b1)*t1)%abs(abs(a1-b1)*t1-abs(a2-b2)*t2)<<endl;\n cout<<1+ans;\n}\n\n\nreturn 0;\n}\n", "\npublic class Main {\n\n private static void solve() {\n long t1 = nl();\n long t2 = nl();\n\n long a1 = nl();\n long a2 = nl();\n\n long b1 = nl();\n long b2 = nl();\n long ret = solve1(t1, t2, a1, a2, b1, b2);\n if (ret < 0) {\n System.out.println(\"infinity\");\n } else {\n System.out.println(ret);\n }\n\n // long t1 = 3;\n // long t2 = 5;\n // long max = 20;\n // for (long a1 = 1; a1 < max; a1++) {\n // for (long a2 = 1; a2 < max; a2++) {\n // for (long b1 = 1; b1 < max; b1++) {\n // for (long b2 = 1; b2 < max; b2++) {\n // long ret1 = solve1(t1, t2, a1, a2, b1, b2);\n // long ret2 = solve2(t1, t2, a1, a2, b1, b2);\n //\n // if (ret1 != ret2) {\n // System.out.printf(\"%d %d (%d %d %d %d)\", ret1, ret2, a1, a2, b1, b2);\n // if (ret1 != ret2) {\n // System.out.println(\"NG\");\n // } else {\n // System.out.println();\n // }\n // }\n // }\n // }\n // }\n // }\n }\n\n private static long solve1(long t1, long t2, long a1, long a2, long b1, long b2) {\n if (a1 > b1) {\n long tmp = a1;\n a1 = b1;\n b1 = tmp;\n\n tmp = a2;\n a2 = b2;\n b2 = tmp;\n }\n\n // a1 < b1\n\n long sa = t1 * a1 + t2 * a2;\n long sb = t1 * b1 + t2 * b2;\n if (sa == sb) {\n return -1;\n }\n\n if (a1 == b1) {\n return 1;\n }\n\n if (sa < sb) {\n return 0;\n }\n\n // a1 < b1 && a2 > b2, sa > sb\n long n = (b1 - a1) * t1 / (sa - sb);\n\n if ((b1 - a1) * t1 % (sa - sb) == 0) {\n return n * 2;\n } else {\n return n * 2 + 1;\n }\n\n }\n\n private static long solve2(long t1, long t2, long a1, long a2, long b1, long b2) {\n long sa = t1 * a1 + t2 * a2;\n long sb = t1 * b1 + t2 * b2;\n if (sa == sb) {\n return -1;\n }\n if (a1 == b1) {\n return 1;\n }\n\n long inf = 10000;\n long a = 0;\n long b = 0;\n long ret = 0;\n for (int i = 0; i < inf; i++) {\n long na, nb;\n if (i % 2 == 0) {\n na = a + a1 * t1;\n nb = b + b1 * t1;\n } else {\n na = a + a2 * t2;\n nb = b + b2 * t2;\n }\n if (i > 0 && Long.signum(na - nb) != Long.signum(a - b)) {\n ret++;\n } else if (i == 0 && na == nb) {\n ret++;\n }\n a = na;\n b = nb;\n }\n return ret;\n }\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = args.length > 0 ? args[0] : null;\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n\n", "t1, t2 = map(int, input().split())\na1, a2 = map(int, input().split())\nb1, b2 = map(int, input().split())\nif t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2:\n print(\"infinity\")\nelse:\n dis1 = t1 * (a1 - b1)\n dis2 = t1 * (a1 - b1) + t2 * (a2 - b2)\n if dis1 * dis2 > 0:\n print(0)\n else:\n if dis1 % dis2 == 0:\n print((-dis1 // dis2) * 2)\n else:\n print((-dis1 // dis2 + 1) * 2 - 1)", "t1,t2=map(int,input().split())\na1,a2=map(int,input().split())\nb1,b2=map(int,input().split())\n\nd1=t1*a1+t2*a2\nd2=t1*b1+t2*b2\n\nimport sys\nif d1>d2:\n dif=d1-d2\n gap=(b1-a1)*t1\nelif d1<d2:\n dif=d2-d1\n gap=(a1-b1)*t1\nelse:\n print('infinity')\n sys.exit()\n\nif (b1-a1)*(b2-a2)>0 or (b1-a1)*(d2-d1)>0:\n print(0)\n sys.exit()\nif gap%dif!=0:\n print(gap//dif*2+1)\nelse:\n print(gap//dif*2)", "#include<bits/stdc++.h>\nusing namespace std;\n#define MOD 1000000007\n\nint main() {\n\n long long T1,T2,A1,A2,B1,B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n\n long long d1 = (A1-B1)*T1,d2 = (A2-B2)*T2;\n\n if(d1 > 0) {\n d1 *= -1;\n d2 *= -1;\n }\n\n if(d1+d2 < 0) cout << 0 << endl;\n else if(d1+d2 == 0) cout << \"infinity\" << endl;\n else {\n long long n = -d1 / (d1+d2);\n long long r = -d1 % (d1+d2);\n if(r == 0) cout << n*2 << endl;\n else cout << n*2+1 << endl;\n }\n}\n\n\n\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int MOD=1e9+7;\nconst int INF=1e9;\nconst ll LINF=1e18;\n\nint main(){\n ll s,t;\n cin>>s>>t;\n ll a,b,c,d;\n cin>>a>>b>>c>>d;\n ll x=s*(a-c);\n ll y=t*(b-d);\n if(x+y==0){\n cout<<\"infinity\"<<endl;\n return 0;\n }\n if(x+y<0){\n x=-x;\n y=-y;\n }\n if(x>0){\n cout<<0<<endl;\n return 0;\n }\n ll u=(-x)/(x+y)+1;\n ll ans=((-x)/(x+y)+1)*2-1;\n if((x+y)*(u-1)+x==0){\n ans-=1;\n }\n cout<<ans<<endl;\n}", "#include <iostream>\n#include <cstdint>\n\nusing Int = std::int64_t;\n\nint main() {\n\tInt t1, t2, a1, a2, b1, b2;\n\tstd::cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;\n\n\tInt x = t1 * (b1 - a1) + t2 * (b2 - a2);\n\t\n\tInt h = t1 * (a1 - b1);\n\n\tif (x == 0) {\n\t\tstd::cout << \"infinity\" << std::endl;\n\t\treturn 0;\n\t}\n\n\tif ((x > 0) != (h > 0))\n\t\tstd::cout << 0 << std::endl;\n\telse\n\t\tstd::cout << 1 + h / x * 2 - (h % x == 0 ? 1 : 0) << std::endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint main (){\n\tll t1,t2,a1,a2,b1,b2;\n\tscanf (\"%lld%lld%lld%lld%lld%lld\",&t1,&t2,&a1,&a2,&b1,&b2);\n\tif (a1>b1) swap(a1,b1),swap(a2,b2);\n\tif (a2<b2) {puts(\"0\");return 0;}\n\tll l1=a1*t1+a2*t2,l2=b1*t1+b2*t2;\n\tif (l1<l2) {puts(\"0\");return 0;}\n\tif (l1==l2) {puts(\"infinity\");return 0;}\n\tll d1=t1*b1-t1*a1,d2=t2*a2-t2*b2,dt=l1-l2;\n\tprintf (\"%lld\",d1/dt*2+(d1%dt!=0));\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n vector<ll> t(2), a(2), b(2), d(2);\n cin >> t[0] >> t[1] >> a[0] >> a[1] >> b[0] >> b[1];\n\n for (int i = 0; i < 2; i++) d[i] = t[i] * a[i] - t[i] * b[i];\n for (int i = 0; i + 1 < 2; i++) d[i + 1] += d[i];\n\n if (d[1] == 0) {\n cout << \"infinity\" << endl;\n return 0;\n } else if (d[1] < 0) {\n for (int i = 0; i < 2; i++) d[i] = -d[i];\n }\n\n if (d[0] > 0) {\n cout << 0 << endl;\n } else {\n cout << -d[0] / d[1] * 2 + int(-d[0] % d[1] != 0) << endl;\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nll solve() {\n ll T1, T2, A1, A2, B1, B2;\n cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;\n ll c1 = A1 - B1;\n ll c2 = A2 - B2;\n ll d = c1 * T1 + c2 * T2;\n if ( d == 0 ) return -1;\n if ( d < 0 ) {\n d = -d, c1 = -c1, c2 = -c2;\n }\n if ( c1 > 0 ) return 0;\n ll f = -c1 * T1;\n ll r = f / d;\n ll ans = 1 + 2*r;\n if ( r * d == f ) ans--;\n return ans;\n}\n\nint main() {\n auto ans = solve();\n if ( ans < 0 ) cout << \"infinity\" << \"\\n\";\n else cout << ans << \"\\n\";\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n try (Scanner sc = new Scanner(System.in)) {\n int T1 = sc.nextInt();\n int T2 = sc.nextInt();\n long A1 = sc.nextLong();\n long A2 = sc.nextLong();\n long B1 = sc.nextLong();\n long B2 = sc.nextLong();\n\n if ((A1 * T1 + A2 * T2) == (B1 * T1 + B2 * T2)) {\n System.out.println(\"infinity\");\n return;\n }\n\n if (A1 > B1) {\n A1 = A1 - B1;\n B2 = B2 - A2;\n } else {\n A1 = B1 - A1;\n B2 = A2 - B2;\n }\n\n long d1 = A1 * T1;\n long d2 = B2 * T2;\n\n if (d1 - d2 > 0) {\n System.out.println(0);\n return;\n }\n\n long ans = (d1 / (d2 - d1)) * 2;\n\n if (d1 % (d2 - d1) != 0) {\n ans++;\n }\n\n System.out.println(ans);\n }\n }\n\n}\n" ]
You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. Constraints * All values in input are integers. * 0 \leq L < R \leq 2 \times 10^9 Input Input is given from Standard Input in the following format: L R Output Print the minimum possible value of (i \times j) \mbox{ mod } 2019 when i and j are chosen under the given condition. Examples Input 2020 2040 Output 2 Input 4 5 Output 20
[ "l,r = map(int,input().split())\nr = min(r, l+4038)\nans = 2018\nfor i in range(l,r):\n for j in range(l+1,r+1):\n if ans > i*j%2019:\n ans = i*j%2019\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint l=sc.nextInt(),r=sc.nextInt();\n\t\tsc.close();\n\t\tif(r-l>=2018) System.out.println(0);\n\t\telse {\n\t\t\tlong min=2018;\n\t\t\tfor(int i=l;i<r;i++) {\n\t\t\t\tfor(int j=i+1;j<=r;j++) {\n\t\t\t\t\tlong temp =(long)i*j;\n\t\t\t\t\tlong mod = temp%2019;\n\t\t\t\t\tif(mod<min) min=mod;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t}\n}", "L,R=map(int,input().split())\nleft,right=L%2019,R%2019\nprint(0 if R-L>=2019 else min([i*j%2019 for i in range(left,right+1) for j in range(i+1,right+1)]))", "l,r = map(int,input().split())\nr = min(r, l+673)\nans = 2018\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n x = i*j%2019\n ans = min(ans,x)\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long l,r;\n cin >> l >> r;\n r = min(r,l+2019);\n int ans = 2018;\n for(long long i = l;i <= r;i++){\n for(long long j = i+1;j <= r;j++){\n int x = (i*j)%2019;\n ans = min(ans,x);\n }\n }\n cout << ans << endl;\n return 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tsc.close();\n\n\t\tint mod = 2019;\n\t\tint ml = l % mod;\n\t\tint mr = r % mod;\n\t\tif (ml == 0 || mr == 0 || l / mod < r / mod) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tint ans = mod;\n\t\t\tfor (int i = ml; i < mr; i++) {\n\t\t\t\tfor (int j = i + 1; j <= mr; j++) {\n\t\t\t\t\tint val = i * j % mod;\n\t\t\t\t\tans = Math.min(ans, val);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfinal int M = 2019;\n\t\tlong l = sc.nextLong();\n\t\tlong r = sc.nextLong();\n\t\tlong lm = l % M;\n\t\tlong rm = r % M;\n\n\t\tif (lm >= rm || r - l >= M - 1) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tlong answer = 2018;\n\t\tfor (long i = lm; i < rm; i++) {\n\t\t\tfor (long j = i + 1; j <= rm; j++) {\n\t\t\t\tanswer = Math.min(answer, (i * j) % M);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n}\n", "l, r = map(int, input().split())\na = 10**5\nif r - l >= 2017:\n\tprint (0)\n\texit()\nelse:\n\tfor i in range(l,r+1):\n\t\tfor j in range(i+1,r+1):\n\t\t\ta = min(a,i*j%2019)\nprint (a)", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tlong L = scan.nextLong();\n\t\tlong R = scan.nextLong();\n\t\tlong min = Long.MAX_VALUE;\n\n\t\tfor(long i=L;i<R;i++) {\n\t\t\tfor(long j=L+1;j<=R;j++) {\n\n\t\t\tlong re = (i*j)%2019;\n\t\t\tif(re < min) {\n\t\t\t\tmin = re;\n\t\t\t}else if(re == 0) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(min);\n\t\tscan.close();\n\n\t}\n\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String args[]) throws Exception {\n Scanner sc = new Scanner(System.in);\n int l = sc.nextInt();\n int r = sc.nextInt();\n int pL = l % 2019;\n int pR = r % 2019;\n \n int min = Integer.MAX_VALUE;\n if(r - l >= 2019 || l <= 2019 && 2019 <= r)\n \tmin = 0;\n else {\n \tfor(int i = pL; i <= pR; i++) {\n \t\tfor(int j = pL; j <= pR; j++) {\n \t\t if(j == i) continue;\n \t\t\tmin = Math.min(min, i * j % 2019);\n \t\t}\n \t}\n }\n System.out.println(min);\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n\nll l, r, ans=2019;\n\nint main() {\n cin >> l >> r;\n for (ll i = l; i <= min(r, l+2018); i++) {\n for (ll j = i+1; j <= min(r, i+2019); j++) {\n ans = min(ans, (i*j)%2019);\n }\n }\n cout << ans << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define LL long long\n#define M 25\nint main(){//3 673\n\tint L,R;\n\tcin>>L>>R;\n\tif(R-L+1>=673)puts(\"0\");\n\telse{\n\t\tLL ans=1e9;\n\t\tfor(int i=L;i<=R;i++)\n\t\t\tfor(int j=i+1;j<=R;j++)\n\t\t\t\tans=min(ans,1LL*i*j%2019);\n\t\tcout<<ans;\n\t}\n\treturn 0;\n}", "//JSD\n#include<iostream>\n#define ll long long \nusing namespace std;\nint main(){\n\tll l,r;\n\tcin>>l>>r;\n\tif(r-l+1>=2019){\n\t\tcout<<\"0\";\n\t}\n\telse{\n\t\tll ans=2020;\n\t\tfor(ll i=l;i<r;i++){\n\t\t\tfor(ll j=i+1;j<=r;j++){\n\t\t\t\tll p=(i*j)%2019;\n\t\t\t\tans=min(ans,p);\n\t\t\t}\n\t\t}\n\t\tcout<<ans;\n\t}\n\tcout<<\"\\n\";\n\treturn 0;\n}", "import java.util.*;\nimport static java.lang.Integer.*;\n//import static java.lang.Long.*;\n//import static java.lang.Math.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tlong i,j;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = parseInt(sc.next());\n\t\tint r = parseInt(sc.next());\n\t\tsc.close();\n\t\tlong a;\n\t\tint l2019 = l / 2019;\n\t\tint r2019 = r / 2019;\n\t\tif(l2019!=r2019) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tlong min1 = 2000000000;\n\t\t\tfor(i=l;i<r;i++) {\n\t\t\t\tfor(j=i+1;j<=r;j++) {\n\t\t\t\t\ta = i*j % 2019;\n\t\t\t\t\tif(a < min1) {\n\t\t\t\t\t\tmin1 = a;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min1);\n\t\t}\n\t}\n}\n", "L, R = map(int, input().split())\nif R - L > 2019:\n print(0)\nelse:\n x = 2019\n for i in range(L, R+1):\n for j in range(i+1, R+1):\n x = min(x, i*j%2019)\n print(x)", "L,R=map(int,input().split())\nr=2018\nfor i in range(L,min(R,L+2019)):\n for j in range(L+1,min(R+1,L+2020)):\n r=min(r,(i*j)%2019)\nprint(r)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\n\t\tif ( R - L > 2019 ) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tlong ans = 2019;\n\t\t\tfor ( long i = L ; i < R ; i++ ) {\n\t\t\t\tfor ( long j = i + 1 ; j <= R ; j++ ) {\n\t\t\t\t\tlong mod = (i * j) % 2019;\n\t\t\t\t\tif ( ans > mod ) {\n\t\t\t\t\t\tans = mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l=sc.nextInt();\n\t\tint r=sc.nextInt();\n\n\t\tif(r-l>=2019)\n\t\t\tSystem.out.print(0);\n\t\telse {\n\t\t\tSystem.out.print(full(r,l));\n\t\t}\n\n\t}\n\t\n\tpublic static int full(int r, int l) {\n\t\tint saishou = 2018;\n\t\tfor(int i=l;i<r;i++) {\n\t\t\tfor(int j=i+1;j<=r;j++) {\n\t\t\t\tif(((i%2019)*(j%2019))%2019 < saishou)\n\t\t\t\t\tsaishou = ((i%2019)*(j%2019))%2019;\n\t\t\t}\n\t\t}\n\t\treturn saishou;\n\t}\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n\tlong long l, r; cin >> l >> r;\n\tr = min(r, l + 2019);\n\tlong long ans = 1e18;\n\tfor (long long i = l; i <= r; ++i) \n\t\tfor (long long j = i + 1; j <= r; ++j)\n\t\t\tans = min(ans, (i * j) % 2019);\n\tcout << ans << '\\n';\t\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing ll=long long;\n\nint main()\n{\n ll l,r,ans=2018;\n cin>>l>>r;\n r=min(r,l+4038);\n for(ll i=l;i<=r;i++){\n for(ll j=i+1;j<=r;j++){\n ans=min(ans,i*j%2019);\n }\n }\n cout<<ans;\n}", "import java.util.Scanner;\n \nclass Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n int r = sc.nextInt();\n long remain = (long)(2 * Math.pow(10,9)) * 2;\n a:for (long i = l; i < r; i++) {\n for (long j = i + 1; j <= r; j++) {\n if(i*j % 2019 < remain)\n remain = i*j % 2019;\n if(remain == 0)\n break a;\n }\n }\n\t\tSystem.out.println(remain);\n\t}\n}", "L,R = map(int,input().split())\n\nif R-L>=2018: print(0)\nelse:\n min_=2018\n for i in range(L,R):\n for j in range(i+1,R+1):\n min_=min(min_, i*j%2019)\n print(min_) ", "l,r = map(int,input().split())\nr = min(r,l+2019)\nans = 2019\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n ans = min(ans,i*j%2019)\nprint(ans)", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n long min = 10000;\n if(r-l >= 2019){\n System.out.println(0);\n return;\n }\n else{\n \tfor(long i = l;i <= r-1;i++){\n \tfor(long j = i+1;j <= r;j++){\n \tmin = Math.min(min,(i*j)%2019);\n }\n }\n }\n System.out.println(min);\n\t}\n} \n", "#include <algorithm>\n#include <iostream>\nusing namespace std;\nconst int MOD = 2019;\nint main() {\n int L, R, m{MOD};\n cin >> L >> R;\n R = min(R - L, MOD);\n L %= MOD;\n for (int i = 0; i < R; ++i)\n for (int j = i; j < R; ++j) m = min(m, (L + i) * (L + j + 1) % MOD);\n cout << m << endl;\n}\n", "import java.util.*;\n\npublic class Main {\n\n public static void main (String[] args) {\n\n Scanner sc = new Scanner(System.in);\n \n long L = sc.nextLong();\n long R = sc.nextLong();\n\n sc.close();\n\n long r = Math.min(R, L+2020);\n\n long min = 2018;\n \n for (long i = L; i <= r; i++){\n for (long j = i + 1; j <= r; j++){\n long m = i*j%2019;\n min = Math.min(min, m);\n }\n }\n\n System.out.println(min);\n \n }\n\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String args[]) {\n\n Scanner sc = new Scanner(System.in);\n int l = sc.nextInt();\n int r = sc.nextInt();\n\n if (l >= 2019) {\n int minus = 2019 * (l / 2019);\n l -= minus;\n r -= minus;\n }\n\n if (r > 2019) {\n r = 2019;\n }\n\n int result = 2018;\n for (int i = l; i < r; i++) {\n for (int j = l + 1; j <= r; j++) {\n result = Math.min(result, i * j % 2019);\n }\n }\n\n System.out.println(result);\n }\n}\n", "l,r=map(int,input().split());s=range(l,min(r+1,l+2019));print(min(i*j%2019for i in s for j in s if i<j))", "l,r=map(int,input().split())\nprint(0 if r-l>671 else min(i*j%2019 for i in range(l,r) for j in range(i+1,r+1)))", "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Main{\npublic static void main (String[] args){\n\tScanner sc = new Scanner(System.in);\n\tlong l = Long.parseLong(sc.next());\n\tlong r = Long.parseLong(sc.next());\n\tlong min = (l*r)%2019;\n\tif((r - l) >= 2018){\n\t\tSystem.out.println(0);\n\t}else{\n\t\tfor(long i = l; i < r; i++){\n\t\t\tfor(long j = i+1; j < r+1; j++){\n\t\t\t\tif((j*i)%2019 < min){\n\t\t\t\t\tmin = ((j*i)%2019);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tSystem.out.println(min);\n\t}\n}\n}\n", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\npublic static void main(String[] args) {\n\t\t\n\t\tScanner keyboard = new Scanner(System.in); \n\t\t\n\t\tlong L = keyboard.nextLong();\n\t\tlong R = keyboard.nextLong();\n\t\tlong x = 2019;\n\t\t\n\t\tif(R-L>=2018) {\n\t\t\tSystem.out.print(0);\n\t\t}else{\n\t\t\tfor(long i = L; i <=R; i++) {\n\t\t\t\tfor(long j = i+1; j <=R; j++) {\n\t\t\t\t\tLong amari = (i*j) % 2019;\n\t\t\t\t\tx = (amari<=x)? amari:x ;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.print(x);\n\t\t}\n\t\tkeyboard.close();\t\n\t}\n}\n", "l,r=map(int,input().split());s=range(l,r+1)[:2019];print(min(i*j%2019for i in s for j in s if i<j))", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main() {\n ll l,r;\n cin >> l >> r;\n r=min(r,l+4038);\n int ans=2018;\n for(ll i=l;i<r+1;++i) {\n for(ll j=i+1;j<r+1;++j) {\n int x=i*j%2019;\n ans=min(ans,x);\n }\n }\n cout << ans << endl;\n return 0;\n}\n ", "#include <bits/stdc++.h>\n#define ll long long \nusing namespace std;\n\nint main() \n{\n\tll l , r;\n\tcin >> l >> r;\n\tif(r-l>2019)\n\t\tcout << 0;\n\telse\n\t{\n\t\tll ans = 2019*2019 ;\n\t\tfor(ll i = l ; i <= r ; i++)\n\t\t\tfor(ll j = i+1 ; j <= r ; j++)\n\t\t\t\tans = min(ans,((i%2019)*(j%2019))%2019);\n\t\tcout << ans;\n\t}\n}", "l,r=map(int,input().split())\nmini=2019\nL=l\nR=r+1 if r-l<2019*2 else l+2019+1\nfor i in range(L,R):\n for j in range(i+1,R):\n mini=min(mini,i*j%2019)\nprint(mini)", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n long l = scan.nextLong();\n long r = scan.nextLong();\n\n if (l == 0){\n System.out.println(0);\n return;\n }\n\n if (r-l >= 2018){\n System.out.println(0);\n return;\n }\n\n int a1 = (int) l%2019;\n int a2 = (int) r%2019;\n \n int small = 2019;\n for (int j=a1; j < a2; j++){\n for (int k = j+1;k<=a2;k++){\n int kk = (int) (j*k)%2019;\n if (kk<small){\n small = kk;\n }\n }\n }\n\n System.out.println(small%2019);\n }\n\n}\n", "import sys\nl,r=map(int,sys.stdin.readline().split())\nr=min(r,l+673)\nans=2019\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n ans=min(ans,(i*j)%2019)\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nint L,R;\n\nint main(){\n\tcin >> L >> R;\n\tif(R-L>=2019) puts(\"0\");\n\telse {\n\t\tll ans=0x3f3f3f3f;\n\t\tfor(int i=L;i<=R;i++)\n\t\t\tfor(int j=i+1;j<=R;j++)\n\t\t\tans=min(ans,1ll*i*j%2019);\n\t\tcout<<ans;\n\t}\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint l,r;\n\tscanf(\"%d%d\",&l,&r);\n\tif(l%2019==0||(r/2019)-(l/2019)){printf(\"0\");return 0;}\n\tr%=2019,l%=2019;int ans=2019;\n\tfor(int i=l;i<=r;i++)for(int j=i+1;j<=r;j++)ans=min(ans,i*j%2019);\n\tprintf(\"%d\",ans);\n\treturn 0;\n}", "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n r = Math.min(r,(l+2019));\n long mod = 2019L;\n long ans = (long)Math.pow(10,9)+7;\n for(long i = l; i < r; i++){\n for(long j = i+1; j <= r; j++){\n long tmp = ((i%mod)*(j%mod))%mod;\n ans = Math.min(ans,tmp);\n }\n }\n System.out.println(ans);\n }\n}", "L,R = map(int,input().split())\nans = float(\"inf\")\nfor i in range(L,min(L+2019,R+1)):\n for j in range(i+1,min(L+2019,R+1)):\n ans = min(ans, i*j%2019)\nprint(ans)", "l,r=map(int,input().split())\nr+=1\nif r>=l+2019:\n\tr=l+2019\nans=10000000\nfor i in range(l,r):\n\tfor j in range(l,i):\n\t\tans=min(ans,(i*j)%2019)\nprint(ans)", "#include <bits/stdc++.h>\n#define ll long long \nusing namespace std;\n\nint main() \n{\n\tll l , r;\n\tcin >> l >> r;\n\tif(r-l>2020)\n\t\tcout << 0;\n\telse\n\t{\n\t\tll ans = 2019*2019 ;\n\t\tfor(ll i = l ; i <= r ; i++)\n\t\t\tfor(ll j = i+1 ; j <= r ; j++)\n\t\t\t\tans = min(ans,((i%2019)*(j%2019))%2019);\n\t\tcout << ans;\n\t}\n}", "L, R = map(int, input().split())\nif R-L>=2019:\n print(0)\nelse:\n print(min([((i*j)%2019) for i in range(L,R) for j in range(i+1,R+1)]))", "l, r = map(int, input().split())\nif r - l >= 672:\n print(0)\nelse:\n print(min(i * j % 2019 for i in range(l, r + 1) for j in range(l, i)))", "l,r = map(int,input().split())\nans = 2019\n\nfor i in range(l,min(l + 2019,r + 1)):\n\tfor j in range(l,i):\n\t\tans = min((i*j)%2019,ans)\nprint(ans)\n", "l, r = map(int, input().split())\n\nans=2018\ntr=min(2019, r-l)\nfor i in range(l, l+tr):\n for j in range(l+1, l+tr+1):\n ans = min(ans, (i*j)%2019)\n\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\nlong long ans;\nint main(){\n\tlong long l,r;\n\tscanf(\"%lld%lld\",&l,&r);\n\tr=min(r,l+2019*2);\n\tans=1e9;\n\tfor (long long i=l; i<=r; i++){\n\t\tfor (long long j=i+1; j<=r; j++){\n\t\t\tans=min(ans,i*j%2019);\n\t\t}\n\t}\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tlong long a,b;\n\tcin>>a>>b;\n\tint mn = 2019;\n\tif(b-a+1>=2019) cout<<0;\n\telse{\n\t\tfor(int i=a; i<=b; i++){\n\t\t\tfor(int j=i+1; j<=b; j++){\n\t\t\t\tmn = min(mn,( (i%2019)*(j%2019) )%2019);\n\t\t\t}\n\t\t}\n\t\tcout<<mn;\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n\nint main() {\n long L,R;\n cin>>L>>R;\n long ans=1234567890;\n for(long i=L;i<R;i++){\n for(long j=i+1;j<=R;j++){\n ans=min((i*j)%2019,ans);\n if(ans==0){\n cout<<0<<endl;\n return 0;\n }\n }\n }\n cout<<ans<<endl;\n }\n", "L,R=map(int,input().split())\nif R-L>2019: print(0)\nelse:\n ans=[i*j%2019 for i in range(L,R) for j in range(L+1,R+1)]\n print(min(ans))", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tlong long l,r;cin>>l>>r;\n\tif(r-l>=2019){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tlong long ans=2019;\n\tfor(long long i=l;i<r;i++){\n\t\tfor(long long j=i+1;j<=r;j++){\n\t\t\tans=min(ans,(i*j)%2019);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}\n", "l, r = map(int, input().split())\nmod = 2019\nr = min(r, l+mod+1)\n\nans = 2020\n\nfor i in range(l, r):\n for j in range(i+1, r+1):\n ans = min(ans, i*j%mod)\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint L = Integer.parseInt(sc.next());\n\t\tint R = Integer.parseInt(sc.next());\n\t\tint ans = 2019;\n\n\t\tif (L + 2019 < R) {\n\t\t\tR = L + 2019;\n\t\t}\n\n\t\tint i;\n\t\tint j;\n\t\tint mod;\n\t\tfor (i = L; i <= R-1; i++) {\n\t\t\tfor (j = i + 1; j <= R; j++) {\n\t\t\t\tmod = ((i % 2019) * (j % 2019)) % 2019;\n\t\t\t\tif (mod < ans) {\n\t\t\t\t\tans = mod;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll l,r; \n cin >> l >> r;\n \n int m = 2018;\n \n r = min(r, l+4038);\n for (ll i=l; i<r; i++){\n for (ll j=i+1;j<=r;j++){\n int x = i*j%2019;\n m = min(m, x);\n }\n }\n cout << m << endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int L = scanner.nextInt();\n int R = scanner.nextInt();\n int l = L % 2019;\n int r = R % 2019;\n if (l >= r || R - L > 2019) {\n System.out.println(0);\n return;\n }\n\n int min = l * r % 2019;\n for (int i = l; i < r; i++) {\n for (int j = i + 1; j <= r; j++) {\n min = Math.min(min, i * j % 2019);\n }\n }\n System.out.println(min);\n }\n}\n", "#include<iostream>\n\nusing namespace std;\n\nlong long L,R,y;\nint main(){\n int l,r,x=2100;\n\n cin>>L>>R;\n\nl=L%2019;\nr=R%2019;\n\ny=R-L;\n\n\nif(r<=l || 2019<=y){\n cout<<0;\n}else{\n for(int i=l;i<r;i++){\n for(int j=i+1;j<r+1;j++){\n x=min(x,(i*j)%2019);\n }\n }\n cout<<x;\n}\n\n\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main()\n{\n ll l, r;\n cin >> l >> r;\n r = min(r, l + 4038);\n ll ans = 2019;\n for (ll i = l; i <= r; i++)\n {\n for (ll j = i + 1; j <= r; j++)\n {\n ans = min(ans, (i * j) % 2019);\n }\n }\n cout << ans << endl;\n}\n", "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\tlong long l, r, ans = 3000; cin >> l >> r;\n\tfor (long long i = l; i <= min(r, l + 2019); ++i)\n\t\tfor (long long j = i + 1; j <= min(r, l + 2019); ++j)\n\t\t\tans = min(ans, (i * j) % 2019);\n\tcout << ans << endl;\n\t\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint l,r;\n\tlong long ans=1e9;;\n\tscanf(\"%d%d\",&l,&r);\n\tint mx=min(r,l+2019);\n\tfor(int i=l;i<=mx;++i)\n\t\tfor(int j=i+1;j<=mx;++j)ans=min(ans,1ll*i*j%2019);\n\tcout<<ans;\n}", "#include <iostream>\nusing namespace std;\nint main(){\n\tlong long a,b,min1(999999999);\n\tcin>>a>>b;\n\tfor(long long i=a;i<b;i++){\n\t\tfor(long long j=i+1;j<=b;j++){\n\t\t\tif((i*j)%2019<min1) min1=(i*j)%2019;\n\t\t\tif(!min1) break;\n\t\t}\n\t\tif(!min1) break;\n\t}\n\tcout<<min1;\n}", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n if(r-l>=2019){\n System.out.println(0);\n return;\n }\n long min = 2020l;\n for(int i = (int)l;i<(int)r;i++){\n for(int j = i + 1;j<=(int)r;j++){\n long ii = i % 2019;\n long jj = j % 2019;\n min = Math.min(min,(ii*jj)%2019);\n }\n }\n System.out.println(min);\n }\n}\n", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tsc.close();\n\t\tlong ans = Long.MAX_VALUE;\n\t\tfor (long i = L; i <= R - 1; i++) {\n\t\t\tfor (long j = i + 1; j <= R; j++) {\n\t\t\t\tans = Math.min(ans, (i * j) % 2019);\n\t\t\t\tif (ans == 0) {\n\t\t\t\t\tSystem.out.println(ans);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import java.util.*;\n\npublic class Main {\n\n public static void main (String[] args) {\n\n Scanner sc = new Scanner(System.in);\n \n long L = sc.nextLong();\n long R = sc.nextLong();\n\n sc.close();\n\n long r = Math.min(R, L + 2019);\n\n long min = 2018;\n \n for (long i = L; i <= r; i++){\n for (long j = i + 1; j <= r; j++){\n long m = (i % 2019) * (j % 2019) % 2019;\n min = Math.min(min, m);\n }\n }\n\n System.out.println(min);\n \n }\n\n}", "L,R=map(int,input().split())\na=[]\nif R-L>=2019:\n\tprint(0)\nelse:\n\tfor i in range(L,R+1):\n\t\tfor j in range(i+1,R+1):\n\t\t\ta.append(((i%2019)*(j%2019))%2019)\n \n\tprint(min(a))", "import java.util.*;\n \npublic class Main{\n public static void main(String[]args){\n Scanner sc = new Scanner(System.in);\n String[] S = sc.nextLine().split(\" \");\n int L = Integer.parseInt(S[0]);\n int R = Integer.parseInt(S[1]);\n \n int min = 2019;\n for(int i = L; i <= R && i < L+2018; i++){\n for(int j = i+1; j <= R && j < L+2019; j++){\n int n = (i % 2019) * (j % 2019);\n if(n % 2019 < min){\n min = n%2019;\n }\n }\n }\n \n System.out.println(min);\n }\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tlong l = sc.nextLong();\n\t\tlong r = sc.nextLong();\n\t\t\n\t\tint l2 = (int) (l % 2019);\n\t\tint r2 = (int) (r % 2019);\n\n\t\tif(r - l > 2019) {\n\t\t\tSystem.out.println(0);\n\t\t}\n\t\telse if(l2 <= r2) {\n\t\t\tint min = l2 * r2 % 2019;\n\t\t\tfor (int i = l2; i <= r2; i++) {\n\t\t\t\tfor (int j = i+1; j <= r2; j++) {\n\t\t\t\t\tint mod = i * j % 2019;\n\t\t\t\t\tif(min > mod) {\n\t\t\t\t\t\tmin = mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}else {\n\t\t\tSystem.out.println(0);\n\t\t}\n\t}\n}\n", "L, R = list(map(int, input().split()))\n\nans = 2019\nfor l in range(L, L+2019):\n for r in range(l+1, min(R+1, L+2020)):\n ans = min(ans, l*r % 2019)\nprint(ans)\n", "\nimport java.util.*;\n\nclass Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l=sc.nextInt();\n long r=sc.nextInt();\n long ans=2018;\n for(int i=0;i<Math.min(r-l,2019);i++){\n for(int j=i+1;j<Math.min(r-l+1,2019);j++){\n ans=Math.min((l+i)*(l+j)%2019,ans);\n }\n }\n System.out.println(ans);\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint arr[2019];\nint main(){\n\tint l,r;\n\tcin>>l>>r;\n\tif(r-l>=2018||r%2019<l%2019){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tl%=2019,r%=2019;\n\tint ans=3000;\n\tfor(int i=l;i<=r-1;i++)\n\t\tfor(int j=i+1;j<=r;j++)\n\t\t\tans=min(ans,i*j%2019);\n\tcout<<ans<<endl;\n}\n", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nint main(){\n ll L,R,ans=2e9;\n cin>>L>>R;\n for(ll i=L;i<=R;i++){\n for(ll j=i+1;j<=R;j++){\n ans=min(ans,i*j%2019);\n if(i*j%2019==0){\n cout<<\"0\"<<endl;\n return 0;\n }\n }\n }\n cout<<ans<<endl;\n}\n\n", "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint L = sc.nextInt();\n\t\tint R = sc.nextInt();\n\t\tint mod = 2019;\n\t\tint L_mod = L%2019;\n\t\tint R_mod = R%2019;\n\t\tif (R-L>=2018 || L_mod>=R_mod) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tfor (int i=L_mod;i<R_mod;i++) {\n\t\t\t\tfor (int j=i+1;j<=R_mod;j++) {\n\t\t\t\t\tmin = Math.min(min, i*j%mod);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main () {\n long L, R;\n cin >> L >> R;\n long ans = 2020;\n for(long i = L; i <= L + 2018 && i <= R; i++){\n for(long j = i + 1; j <= L + 2018 && j <= R; j++){\n ans = min(ans,(i * j) % 2019);\n }\n }\n cout << ans << endl;\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n static final long MOD = 1000000007;\n public static void main(String[] args) {\n final Scanner scanner = new Scanner(System.in);\n long L = scanner.nextInt();\n long R = scanner.nextInt();\n if ((R - L) >= 1000) {\n System.out.println(0);\n return;\n }\n long ans = 1000000;\n for (long i = L; i < R; i++) {\n for (long j = i+1; j <= R; j++) {\n ans = Math.min(ans, (i*j) % 2019L);\n }\n }\n System.out.println(ans);\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\nlong long int N,M,L=3000;\n cin >>N>>M;\n for(long long int i=N;i<M;i++){\n if(L==0)break;\n for(long long int j=N+1;j<M+1;j++){\n L=min(L,(i*j)%2019);\n if(L==0)break;\n }\n }\n cout <<L;\n}", "l,r = map(int,input().split())\n\na = []\nr = min(r,l+2019)\nfor i in range(l,r):\n for j in range(i+1,r+1):\n a.append(i*j%2019)\n\nprint(min(a))\n \n", "import java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tint minmod = 2020;\n\t\tloop: for(long i = L; i < R; i++) {\n\t\t\tfor(long j = i + 1; j <= R; j++) {\n\t\t\t\tminmod = (int) Math.min(minmod, (i % 2019) * (j % 2019) % 2019);\n\t\t\t\tif(minmod % 2019 == 0) {\n\t\t\t\t\tbreak loop;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(minmod);\n\t}\n\n}", "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint L = sc.nextInt();\n\t\tint R = sc.nextInt();\n\t\tif(R-L > 673) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tL %= 2019;\n\t\tR %= 2019;\n\t\tif(L >= R)\n\t\t\tR += 2019;\n\t\tint ans = 2018;\n\t\tfor(int i = L; i < R; i++)\n\t\t\tfor(int j = i+1; j <= R; j++)\n\t\t\t\tans = Math.min(ans, i * j % 2019);\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tlong L = stdIn.nextInt();\n\t\tlong R = stdIn.nextInt();\n\t\tfor(long i = L; i <= R; i++) {\n\t\t\tif(i%673 == 0 && ((R-L+1) >= 3 || i-1 >= L)) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong min = 2018;\n\t\tfor(long i = L; i < R; i++) {\n\t\t\tfor(long j = i+1; j <= R; j++) {\n\t\t\t\tif((i*j)%2019 < min) {\n\t\t\t\t\tmin = (i*j)%2019;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\n\t}\n\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int64_t l,r;cin>>l>>r;\n int64_t ans=2020;\n if(r-l>2023){\n cout <<0<<endl;\n return 0;\n }\n else{\n for(int64_t i=l;i<=r-1;i++){\n for(int64_t j=i+1;j<=r;j++){\n ans=min(ans,(i*j)%2019);\n }\n }\n }\n cout <<ans<<endl;\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n if(r-l>=2019){System.out.println(0);}\n else{l%=2019;\n r%=2019;\n if(l<r){int ans = 2019;\n for(int i=l;i<r;i++){for(int j=i+1;j<=r;j++)\n {ans = Math.min(ans,(i*j)%2019);}\n }\n System.out.println(ans);}\n\t\telse{System.out.println(0);}\n }\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n\tll l,r;\n\tcin>>l>>r;\n\tif(r-l>=2019){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\telse{\n\t\tll ans=5000;\n\t\tfor(ll i=l;i<=r;i++){\n\t\t\tfor(ll j=i+1;j<=r;j++){\n\t\t\t\tans=min(ans,(i%2019*j%2019)%2019);\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}", "L,R=map(int, raw_input().split())\na=L%2019\nb=R%2019\n\nT=[]\nans=float(\"inf\")\nif a<b:\n\tT=range(a,b+1)\n\tif R-L>2018:\n\t\tprint 0\n\t\tquit()\n\telse:\n\t\tl=len(T)\n\t\tfor i in range(l):\n\t\t\tfor j in range(i+1,l):\n\t\t\t\tans=min(ans, (T[i]*T[j])%2019 )\n\n\t\tprint ans\nelse:\n\tprint 0\n\tquit()\n\n", "from itertools import*\na,b=map(int,input().split())\nif b-a>=2019:\n print(0)\nelse:\n print(min(s*t%2019 for s,t in combinations(range(a,b+1),2)))", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner scn=new Scanner(System.in);\n long L =scn.nextLong();\n long R =scn.nextLong(); \n R=Math.min(R,L+4038);\n long answer = 2018;\n for(long i=L;i<=R;i++){\n for(long j=i+1;j<=R;j++){\n long x = i*j%2019;\n answer=Math.min(answer,x);\n }\n }\n System.out.println(answer);\n }\n}", "import java.util.Scanner;\n\nclass Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tlong min = 2019;\n\n\t\tfor(int i=0; i<2019; i++){\n\t\t\tlong x = l+i;\n\t\t\tfor(int j=i+1; j<2019; j++){\n\t\t\t\tlong y = l+j;\n\t\t\t\tif(x>r || y>r) break;\n\t\t\t\tmin = Math.min(min, (x*y)%2019);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n long l = sc.nextLong();\n long r = sc.nextLong();\n\n long min = Long.MAX_VALUE;\n if (r - l > 2019) {\n min = 0;\n } else {\n flag:\n for (long i = l; i < r; i++) {\n for (long j = l + 1; j <= r; j++) {\n min = Math.min(min, (i * j) % 2019);\n if (min == 0) break flag;\n }\n }\n }\n\n\n System.out.println(min);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint main(){\n\tll ans=1e9;\n\tll a,b;\n\tcin>>a>>b;\n\tb=min(b,a+4038);\n\tfor(ll i=a;i<=b;i++){\n\t\tfor(ll j=i+1;j<=b;j++){\n\t\t\tans=min(ans,i*j%2019);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\nusing namespace std;\nint main() {\nll l,r;\ncin>>l>>r;\nll ans = 1e18;\nif ((l-1)/2019!=(r/2019)) {cout<<0;return 0;}\nfor (ll i = l;i<=r;i++)\n for (ll j = i + 1;j<=r;j++)\n ans = min(ans,(i*j)%2019);\n cout<<ans;return 0;}\n", "import itertools\n\nL, R = map(int, raw_input().split())\n\nif R - L >= 2019:\n L = 0\n R = 2018\n\nprint min([(i * j) % 2019 for i, j in itertools.combinations(range(L, R + 1), 2)])\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long def,l,r,t,ans=2019;cin>>l>>r;\n def=(r-l)%2020;l%=2019;r=l+def;\n \n for(long long i=l;i<=r-1;i++){\n for(long long j=i+1;j<=r;j++){\n ans=min(ans,(i*j)%2019);\n }\n }\n cout<<ans;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextLong();\n\t\tlong r = sc.nextLong();\n\t\tif (2019 <= r - l) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong m = 0;\n\t\tlong min = 2019l;\n\t\tlong calc = 0;\n\t\tfor (long i = l; i < r; i++) {\n\t\t\tm = i * i;\n\t\t\tfor (long j = i + 1; j <= r; j++) {\n\t\t\t\tm += i;\n\t\t\t\tcalc = m % 2019;\n\t\t\t\tif (calc < min) {\n\t\t\t\t\tmin = calc;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(min);\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long l = in.nextLong();\n long r = in.nextLong();\n long min = Long.MAX_VALUE;\n long r1 = Math.min(r, l+2019);\n for(long i=l; i<=r1; i++) {\n long r2 = Math.min(r, i+2019);\n for(long j=i+1; j<=r2; j++) {\n long mod = (i*j)%2019;\n min = Math.min(min, mod);\n }\n }\n System.out.println(min);\n }\n}\n", "L, R = map(int, input().split())\nr = L + min(2019, R - L)\nans = 2019\nfor i in range(L, r):\n for j in range(i + 1, r + 1):\n ans = min(ans, (i * j) % 2019)\nprint(ans)", "L,R = map(int,input().split())\n\nR = min(R,L+2019)\n\nans = 2019\nfor i in range(L,R):\n for j in range(i+1,R+1):\n ans = min(ans,i*j%2019)\n\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong l = in.nextInt();\n\t\tlong r = in.nextInt();\n\n\t\tif(r - l >= 2019) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tl = l % 2019;\n\t\tr = r % 2019;\n\n\t\tint tes = 2 * 1000000000;\n\n\t\tif((l * r) % 2019 == 0) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tlong min = 2019;\n\n\t\tfor(long i = l; i <= r-1; i++) {\n\t\t\tfor(long j = i + 1; j <= r; j++) {\n\n\t\t\t\tlong tmp = (i * j) % 2019;\n\t\t\t\tmin = (min <= tmp) ? min : tmp;\n\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(min);\n\t}\n}\n", "public class Main {\n\tpublic static void main(String[] args) {\n\t\tjava.util.Scanner s = new java.util.Scanner(System.in);\n\t\tlong l = s.nextLong();\n\t\tlong r = s.nextLong();\n\t\tSystem.out.println(calc(l, r));\n\t}\n\n\tpublic static long calc(long l, long r) {\n\t\tlong next2019 = l - l % 2019 + 2019;\n\t\tif (l == 0 || r >= next2019) {\n\t\t\treturn 0;\n\t\t}\n\t\tlong min = Long.MAX_VALUE;\n\t\tfor (long i = l; i < next2019 && i < r; i++) {\n\t\t\tfor (long j = i + 1; j < next2019 && j <= r; j++) {\n\t\t\t\tmin = Math.min(min, (i * j) % 2019);\n\t\t\t\tif ((i * j) % 2019 == 0) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn min;\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L, R;\n\t\tL = sc.nextLong();\n\t\tR = sc.nextLong();\n\n\t\tlong ans = 2019;\n\t\tif(L == 2019 || R == 2019) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tif(R - L >= 2019) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t} else if(R - L < 2019) {\n\t\t\tfor (long i = L; i < R; i++) {\n\t\t\t\tfor (long j = L + 1; j <= R; j++) {\n\t\t\t\t\tlong res = ((i * j) % 2019);\n\t\t\t\t\tans = Math.min(ans, res);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextInt();\n\t\tlong r = sc.nextInt();\n\t\tlong min = 2018;\n\t\tfor (long i = l; i < r; i++) {\n\t\t\tif (min == 0)\n\t\t\t\tbreak;\n\t\t\tfor (long j = i + 1; j <= r; j++) {\n\t\t\t\tif (i * j % 2019 < min)\n\t\t\t\t\tmin = i * j % 2019;\n\t\t\t\tif (min == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(min);\n\t}\n}\n", "import java.util.*;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tfinal int MOD = 1000000007;\n\tfinal int MAX = Integer.MAX_VALUE;\n\tfinal long LMAX = Long.MAX_VALUE;\n\tfinal int LEN = 100000;\n\n\tvoid doIt() {\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tif(r - l > 2019) {\n\t\t\tSystem.out.println(0);\n\t\t}\n\t\t\n\t\telse {\n\t\t\tlong min = LMAX;\n\t\t\tfor(long i = l; i <= r; i++) {\n\t\t\t\tfor(long j = i + 1; j <= r; j++) {\n\t\t\t\t\tif(min > (i * j) % 2019) {\n\t\t\t\t\t\tmin = (i * j) % 2019;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().doIt();\n\t}\n}\n", "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int l = sc.nextInt();\n int r = sc.nextInt();\n long ans = 2020;\n\n r = Math.min(r, l+2019*2);\n\n for(long i=l; i<=r; ++i) {\n for(long j=i+1; j<=r; ++j) {\n ans = Math.min(ans, i*j%2019);\n }\n }\n System.out.println(ans);\n }\n}", "import sys\nL,R=map(int, sys.stdin.readline().split())\nsho1=L/2019\nsho2=R/2019\nif 1<=sho2-sho1:\n print 0\nelse:\n ans=float(\"inf\")\n for i in range(L,R):\n for j in range(i+1,R+1):\n ans=min(ans,i*j%2019) \n print ans", "l,r=map(int,input().split())\nif r-l>=2019:\n print(0)\n exit()\nans=2020\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n ans=min((i*j)%2019,ans)\nprint(ans)", "l,r=map(int, input().split())\n\nans=2019\nfor i in range(l, min(l+2019, r)):\n for j in range(i+1, min(i+2020, r+1)):\n ans=min(ans, (i*j)%2019)\n\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint32_t main() {\n\tint l, r; cin>>l>>r;\n\tif(r - l > 1e4){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tint ans = 2019;\n\tfor(int i = l; i < r; i++){\n\t\tfor(int j = i + 1; j <= r; j++){\n\t\t\tans = min(ans, i * j % 2019);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}\n", "l,r=map(int,input().split())\n\nans=2018\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n ans=min(ans,(i*j)%2019)\n if ans==0:\n print(0)\n exit()\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextLong();\n\t\tlong r = sc.nextLong();\n\t\tsc.close();\n\t\tif(r - l >= 2018) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong lMod = (l + 2019) % 2019;\n\t\tlong rMod = (r + 2019) % 2019;\n if(rMod < lMod)\n rMod += 2019;\n\t\tlong min = 100000;\n\t\tfor(long i = lMod ; i <= rMod - 1 ; i++) {\n\t\t\tfor(long j = i + 1 ; j <= rMod ; j++) {\n\t\t\t\tmin = Math.min((i * j) % 2019 , min);\n\t\t\t}\n\t\t}\n System.out.println(min);\n\n\t}\n}\n\n", "#include <algorithm>\n#include <climits>\n#include <iostream>\nusing namespace std;\n\nint main() {\n\tlong L, R, ans = 0;\n\tcin >> L >> R;\n\tif (673 > R - L) {\n\t\tans = LONG_MAX;\n\t\tfor (long i = L; i < R; ++i) {\n\t\t\tfor (long j = 1 + L; j <= R; ++j) ans = min(ans, i * j % 2019);\n\t\t}\n\t}\n\tcout << ans;\n}", "import java.util.*;\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint L=sc.nextInt();\n\t\tint R=sc.nextInt();\n\t\tlong min=0;\n\t\tif(L%2019==0||R%2019==0||L/2019<R/2019){\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tfor(long i=L;i<=R;i++){\n\t\t\tfor(long j=i+1;j<=R;j++){\n\t\t\t\tlong a=(i*j)%2019;\n\t\t\t\tif((i==L&&j==L+1)||min>a){min=a;}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}", "l,r=map(int,input().split())\nif r-l>=2019:print(0)\nelse:\n MIN=10000\n for i in range(l,r):\n for j in range(i+1,r+1):\n p = i*j%2019\n if p<MIN:MIN=p\n print(MIN)", "#include<bits/stdc++.h>\nusing namespace std;\n#define LL long long\nint a,b;\nLL Ans=1e9;\nint main() {\n\tscanf(\"%d%d\",&a,&b);\n\tfor(int i=a; i<=min(b,a+5000); i++) {\n\t\tfor(int j=i+1; j<=min(b,a+5000); j++)\n\t\t\tAns=min(1LL*i*j%2019,Ans);\n\t}\n\tprintf(\"%lld\",Ans);\n}", "import java.util.Scanner;\n \npublic class Main {\n \n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner input = new Scanner(System.in);\n\t\tint N = input.nextInt();\n int D = input.nextInt();\n long remain = (long)(2 * Math.pow(10,9)) * 2;\n for (long i = N; i < D; i++) {\n for (long j = i + 1; j <= D; j++) {\n if((i*j)%2019 < remain)\n remain = (i*j)%2019;\n if(remain == 0)\n break;\n }\n if(remain == 0)\n break;\n }\n\t\tSystem.out.println(remain);\n\t}\n}", "l,r=map(int,input().split())\nd=range(l,r+1)[:673]\nprint(min(i*j%2019 for i in d for j in d if i<j))", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint N,L,R,ans = 2020;\n\tcin >> L >> R;\n\tN = R-L;\n\tfor(int i=L; i < L+min(2019,N); i++){\n\t\tfor(int j=i+1; j <= min(R,i+2019); j++){\n\t\t\tans = min(((i%2019)*(j%2019)) % 2019,ans);\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint l,r;\nint main()\n{\n\tscanf(\"%d%d\",&l,&r);\n\tif(r-l+1>=2020)\n\t\tprintf(\"0\");\n\telse\n\t{\n\t\tint ans=100000;\n\t\tfor(int i=l;i<=r;i++)\n\t\t\tfor(int j=l;j<i;j++)\n\t\t\t\tans=min(ans,int(1ll*i*j%2019));\n\t\tprintf(\"%d\",ans);\n\t}\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner input = new Scanner(System.in);\n\t\tlong N = input.nextInt();\n long D = input.nextInt();\n long remain = (long)(2 * Math.pow(10,9)) * 2;\n for (long i = N; i < D; i++) {\n for (long j = i + 1; j <= D; j++) {\n if((i*j)%2019 < remain)\n remain = (i*j)%2019;\n if(remain == 0)\n break;\n }\n if(remain == 0)\n break;\n }\n\t\tSystem.out.println(remain);\n\t}\n}\n", "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong a = sc.nextInt();\n\t\tlong b = sc.nextInt();\n\t\tlong min = 2019;\n\t\tfor(int i = 0; i < 2019; i++){\n\t\t\tfor(int j = i+1; j < 2019; j++){\n\t\t\t\tlong x = a+i, y = a+j;\n\t\t\t\tif(x > b || y > b) break;\n\t\t\t\tmin = Long.min(min, (x*y)%2019);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n\n}\n", "l,r=map(int,input().split())\nd=range(l,r+1)\nprint(0 if r-l>671 else min(i*j%2019 for i in d for j in d if i<j))", "#include<bits/stdc++.h>\nusing namespace std;\nlong long l,r;\n\nint main()\n{\n\tcin>>l>>r;\n\tif((r/2019-l/2019)>0)\n\t\tcout<<0<<endl;\n\telse\n\t{\n\t\tlong long ans=2020;\n\t\tfor(long long i=l;i<=r;i++)\n\t\t{\n\t\t\tfor(long long j=i+1;j<=r;j++)\n\t\t\t{\n\t\t\t\tans=min(ans,(i*j%2019));\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint l, r;\n\tscanf(\"%d%d\", &l, &r);\n\tint ans = 2019;\n\tint start = l%2019, end = start+min(2019*2, r-l+1);\n\tfor (int i = start; i < end; ++i) {\n\t\tfor (int j = i+1; j < end; ++j) {\n\t\t\tans = min(i*j%2019, ans);\n\t\t}\n\t}\n\tprintf(\"%d\\n\", ans);\n}\n", "import java.util.*;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tint ans = 0;\n\t\t\n\t\tint k = ((l-1)/2019 + 1)*2019; //L <= k\n\t\tif(l == 0){\n\t\t\tk = 0;\n\t\t}\n\n\t\tif(k <= r){\n\t\t\tans = 0;\n\t\t}else{\n\t\t\tans = 2018;\n\t\t\tint min = l % 2019;\n\t\t\tint max = r % 2019;\n\t\t\tfor(int i = min ; i < max ; i++)\n\t\t\t{\n\t\t\t\tfor(int j = i+1 ; j <= max ; j++){\n\t\t\t\t\tans = ans > ((i*j) % 2019) ? ((i*j) % 2019) : ans;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n\n}", "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n\n long NUM=2019;\n Scanner sc = new Scanner(System.in);\n // 整数の入力\n int L=sc.nextInt();\n int R=(sc.nextInt()-L);\n if(R>=2019){\n System.out.println(0);\n return;\n\n }\n L=L%2019;\n R=R+L+1;\n int result=2019*2019;\n for(int i=L;i<R;i++){\n for(int j=i+1;j<R;j++){\n int a=(i*j)%2019;\n if(a<result){\n result=a;\n }\n }\n }\n\n System.out.println(result);\n\n\n }\n}\n", "import java.util.*;\n\n\n class Main\n { \n\tpublic static void main(String args[])\n \t{ \n\n\t\tScanner sc =new Scanner(System.in);\n\t\tlong l = sc.nextInt();\n\t\tlong r = sc.nextInt();\n\t\t\n\t\tlong res = Integer.MAX_VALUE;\n\t\t\n\t\tif(r - l >= 2019){\n\t\t\tSystem.out.println(0); \n\t\t\treturn;\n\t\t}\n\t\t\n\t\tfor(long i = l; i <= r; i++){\n\t\t\tfor(long j = i+1; j <= r; j++){\n\t\t\t\tres = Math.min(res, i*j%2019);\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(res);\n\n \t}\n }", "import java.util.Scanner;\n \npublic class Main {\n \n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner input = new Scanner(System.in);\n\t\tlong N = input.nextInt();\n long D = input.nextInt();\n long remain = (long)(2 * Math.pow(10,9)) * 2;\n for (long i = N; i < D; i++) {\n for (long j = i + 1; j <= D; j++) {\n if(i*j %2019 < remain)\n remain = i*j %2019;\n if(remain == 0)\n break;\n }\n if(remain == 0)\n break;\n }\n\t\tSystem.out.println(remain);\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tlong lNum = s.nextInt();\n\t\tlong rNum = s.nextInt();\n\t\ts.close();\n\t\tlong min = 2019;\n\t\tif (lNum / 2019 == rNum / 2019) {\n\t\t\tfor (long i = lNum; i < rNum; i++) {\n\t\t\t\tfor (long j = i + 1; j <= rNum; j++) {\n\t\t\t\t\tlong amari = (i * j) % 2019;\n\t\t\t\t\tif (amari < min) {\n\t\t\t\t\t\tmin = amari;\n\t\t\t\t\t}\n\t\t\t\t\tif(amari == 0) {\n\t\t\t\t\t\tmin = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}else {\n\t\t\tmin = 0;\n\t\t}\n\t\tSystem.out.println(min);\n\n\t}\n\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tsc.close();\n\n\t\tint a = l / 2019;\n\t\tint b = r / 2019;\n\t\tif (a < b) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tl %= 2019;\n\t\tr %= 2019;\n\t\tif (l >= r) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tint ans = Integer.MAX_VALUE;\n\t\tfor (int i = l; i < r; i++) {\n\t\t\tfor (int j = i + 1; j <= r; j++) {\n\t\t\t\tans = Math.min(ans, i * j % 2019);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint L = sc.nextInt();\n\t\tint R = sc.nextInt();\n\t\tsc.close();\n\t\tint mod = 2019;\n\t\t\n\t\tfor(int i=L;i<=R;i++) {\n\t\t\tif(i%2019==0) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\t\n\t\tL%=mod;\n\t\tR%=mod;\n\t\t\n\t\tint ans = Integer.MAX_VALUE;\n\t\tfor(int i=L;i<R;i++) {\n\t\t\tfor(int j=L+1;j<=R;j++) {\n\t\t\t\tint tmp = i*j;\n\t\t\t\ttmp %= mod;\n\t\t\t\tans = Math.min(ans, tmp);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "l,r=map(int,input().split())\nm=2019\nc=m-1\nr=min(r,l+m-1)\nfor i in range(l,r):\n for j in range(i+1,r+1):\n s=i*j\n c=min(c,s%m)\nprint(c)\n", "import java.util.*;\n\npublic class Main {\n \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long L = sc.nextLong();\n long R = sc.nextLong();\n long min = Long.MAX_VALUE;\n for (long i = L; i < R; i++) {\n for (long j = L+1; j <= R; j++) {\n long num = (i*j)%2019;\n if (num < min) {\n min = num;\n } else if (num == 0) {\n System.out.println(0);\n return;\n }\n }\n }\n System.out.println(min);\n }\n}", "L,R = map(int,input().split())\nans = 2020\n\nfor i in range(L,min(L+2019,R)):\n for j in range(L+1,min(L+2019,R)+1):\n ans = min(ans,i*j%2019)\n\nprint(ans)", "(L,R) = map(int,input().split())\n\nval = 2019\n\nfor l in range(L,min(R,L+2019)):\n for r in range(l+1,min(R+1,l+1+2019)):\n val = min((l*r)%2019,val)\n \nprint(val)", "L, R = map(int, input().split())\nif R-L >= 2019:\n print (0)\nelse:\n print (min([((i % 2019) * (j % 2019)) % 2019 for i in range(L,R) for j in range(i+1,R+1)]))", "l,r = map(int,input().split())\nans = 2019\nr = min(r+1,l+2020)\n\nfor i in range(l,r):\n for j in range(i+1,r):\n ans = min(ans,i*j%2019)\n\nprint(ans)", "L, R = map(int,input().split())\nif R - L >= 2019:\n print(0)\nelse:\n ans = 2019\n print(min([i*j%2019 for i in range(L, R) for j in range(i+1, R+1)]))", "L,R=map(int, input().split())\nm=2019\nfor i in range(L,min(R+1,L+2019)):\n for j in range(i+1,min(R+1,L+2019)):\n m=min(m,i*j%2019)\nprint(m)", "#include<bits/stdc++.h>\nusing namespace std;\nint l,r;\nint main(){\n\tscanf(\"%d%d\",&l,&r);\n\tif(r-l+1>=2019){\n\t\tputs(\"0\");\n\t\treturn 0;\n\t}\n\tlong long ans=1e10;\n\tfor(int i=l;i<=r;i++)\n\tfor(int j=i+1;j<=r;j++){\n\t\tlong long k=i*1ll*j;\n\t\tans=min(ans,k%2019);\n\t}\n\tprintf(\"%d\\n\",ans);\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\n\t\tif (R - L >= 2019) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tlong ans = Long.MAX_VALUE;\n\t\tfor (long i = L; i < R; i++) {\n\t\t\tlong tmp =0;\n\t\t\tfor (long j = i+1; j <= R; j++) {\n\t\t\t\ttmp=(i*j)%2019;\n\t\t\t\tans = Math.min(ans, tmp);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "L,R = map(int, input().split())\nR = min(R, L+2019)\nans = 2018\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n x = (i*j)%2019\n ans = min(ans,x)\nprint(ans)", "#include <iostream>\n#define int long long\nusing namespace std;\nint32_t main()\n{\n int a,b; cin>>a>>b;\n if( abs(a/2019 - b/2019) > 0) cout<<0;\n else{\n int ans = 99999;\n for(int i = a; i <= b; i++)\n for(int j = i + 1; j <= b; j++)\n ans = min(ans,(i*j) % 2019);\n cout<<ans;\n }\n}\n", "L,R = map(int,input().split())\nans = 4*(10**18)\nif R-L >= 2019:\n print(0)\nelse:\n for i in range(L,R):\n for j in range(L+1,R+1):\n ans = min(ans,i*j%2019)\n print(ans)", "#include<iostream>\nusing namespace std;\n\nint main() {\n int64_t L, R,ans = 2020;\n\tcin>>L>>R;\n\tfor (long l=L;l<L+2020;l++) {\n for (long r=R;r>R-2020;r--) {\n if(l<r)ans=min(ans,l%2019*r%2019);\n }\n }\n\tcout<<ans<<endl;\n}\n", "import java.math.BigDecimal;\nimport java.util.*;\n\npublic class Main {\n\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n String s = sc.nextLine();\n long l = Long.parseLong(s.split(\" \")[0]);\n long r = Long.parseLong(s.split(\" \")[1]);\n\n long ans = 10000;\n for(long i = l; i <= Math.min(r, l + 2018); i++){\n for(long j = i + 1; j <= Math.min(r, l + 2018); j++){\n ans = Math.min(ans, i * j % 2019);\n }\n }\n\n System.out.println(ans);\n return;\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long L, R, Min=2019, i, j;\n cin >> L >> R;\n R = min(R, L + 2019);\n for(i=L;i<=R;i++){\n for(j=i+1;j<=R;j++){\n long long i_=i%2019, j_=j%2019;\n Min = min(Min, (i_*j_)%2019);\n }\n }\n cout << Min << endl;\n return 0;\n}", "L, R = map(int, input().split())\nR = min(R, L+2019)\nprint(min([i * j % 2019 for i in range(L, R+1) for j in range(i+1, R+1)]))\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String args[] ){\n\t\tScanner sc =new Scanner(System.in);\n\tlong n = sc.nextLong();\n\tlong m =sc.nextLong();\n\tlong min = 2018;\n\t\n\t\n\tif(m*m<2019) {\n\t\tlong data =(n*(n+1))%2019;\n\t\tmin =data;\n\t}else{\n\t\tfor(long i=n;i<m;i++) {\n\t\t\tfor(long j=i+1;j<=m;j++) {\n\t\t\t\tlong data =(i*j)%2019;\n\t\t\t\tif(min > data) {\n\t\t\t\t\t//System.out.println(i+\" \"+j);\n\t\t\t\t\tmin =data;\n\t\t\t\t}\n\t\t\t\tif(min==0) break;\n\t\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t\tif(min==0) break;\n\t\t}\n\t\t}\n\t\n\t\n\tSystem.out.println(min);\n\t\n\t\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n int l,r;cin>>l>>r;\n r=min(r,l+2019);\n int mn=2019;\n for (int i=l;i<r;i++)\n for (int j=i+1;j<=r;j++)\n mn=min(mn,i%2019*(j%2019)%2019);\n cout<<mn<<endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n long long int l,r,c,i,m=2019,j;\n cin>>l>>r;\nif(r>l+2019)\n r=l+2019;\n for(j=l;j<r;j++)\n {\n\n for(i=l+1;i<=r;i++)\n {\n c=((j*i)%2019);\n\n if(c<m)\n m=c;\n\n }\n }\n cout<<m<<endl;\n\n\n return 0;\n}", "import java.util.Scanner;\n \npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n int r = sc.nextInt();\n long remain = (long)(2 * Math.pow(10,9)) * 2;\n a:for (long i = l; i < r; i++) {\n for (long j = i + 1; j <= r; j++) {\n if(i*j % 2019 < remain)\n remain = i*j % 2019;\n if(remain == 0)\n break a;\n }\n }\n\t\tSystem.out.println(remain);\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tlong int l,r; cin >> l >> r;\n\n\tlong int ans=2019;\n\n\tfor(long int i=l;i<r && i<l+2019;i++){\n\t\tfor(long int j=i+1; j<=r && j<l+2019; j++){\n\t\t\tif(ans > (i*j)%2019){\n\t\t\t\tans = (i*j)%2019;\n\t\t\t}\n\t\t}\n\t}\ncout << ans << endl;\n}", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int L=sc.nextInt();\n int R=sc.nextInt();\n\n //0 < L <= i < j <= R\n\n int mod,ii,jj;\n int ans = 2019;\n int cnt =0;\n\nif(R-L<2019){\n for(int i=L;i<R;i++){\n ii = i % 2019;\n for(int j=i+1;j<=R;j++){\n jj = j % 2019;\n mod = (ii*jj) % 2019;\n if(mod<ans) ans=mod;\n }\n }\n System.out.println(ans);\n}\nelse{\n System.out.println(\"0\");\n}\n\n }\n}\n", "L, R = map(int, input().split())\nprint(min([((L + i) * (L + j)) % 2019 for i in range(min(R - L + 1, 2019)) for j in range(min(R - L + 1, 2019)) if i < j]))", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n ll i,j,cnt=0;\n int L,R;\n cin>>L>>R;\n if(L+2018<=R){\n cout<<0;\n return 0;\n }\n ll mi=INT_MAX;\n for(i=L;i<=R;i++){\n for(j=i+1;j<=R;j++){\n mi=min(mi,i*j%2019);\n }\n }\n cout<<mi<<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n\nint main(){\n\tLL n, m, up, ans = 3000;\n\tcin >> n >> m;\n\tup = min(m, n + 2019);\n\tfor(LL i = n; i < up; i++)\n\t\tfor(LL j = i + 1; j <= up; j++)\n\t\t\tans = min(ans, (i % 2019 * j % 2019) % 2019);\n\tcout << ans << endl;\n}", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int left = sc.nextInt();\n int right = sc.nextInt();\n right -= left;\n left = left % 2019;\n right += left;\n\n int ans = 2020;\n int rightLimit = Math.min(left+2018, right);\n for(int i = left; i <= rightLimit; i++){\n for(int j = i+1; j <= rightLimit; j++){\n int num = (i * j) % 2019;\n ans = Math.min(ans, num);\n }\n }\n System.out.println(ans);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n static int MODULUS = 2019;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int L = sc.nextInt();\n int R = sc.nextInt();\n\n System.out.println(solve(L, R));\n\n sc.close();\n }\n\n static long solve(int L, int R) {\n long result = Long.MAX_VALUE;\n for (int i = L; i < R && i - L < MODULUS; ++i) {\n for (int j = i + 1; j <= R && j - L < MODULUS; ++j) {\n result = Math.min(result, (long) i * j % MODULUS);\n }\n }\n\n return result;\n }\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\nint l,r,a=5000000,c,x,y;\nint main(){\n\tcin>>l>>r;\n\tx=l%2019,y=r%2019;\n\tif(r-l>=2018){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tif(x>=y)y+=2019;\n\t\n\tfor(int i=x;i<y;i++){\n\t\tfor(int j=i+1;j<=y;j++){\n\t\t\tc=i*j;\n\t\t\tc%=2019;\n\t\t\ta=min(a,c);\n\t\t\n\t\t}\n\t}\n\tcout<<a<<endl;\n}\n", "///見ました\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n long long l,r;\n cin >> l >> r;\n r = min(r,l+4038);\n \n int ans=2018;\n \n for(long long i=l; i<r; i++){\n for(long long j=l+1; j<=r; j++){\n int x = i*j%2019;\n ans = min(ans,x);\n }\n }\n \n cout << ans << endl;\n \n}\n", "L,R = map(int,input().split())\n\nans = 2018\nif R-L >= 2018:\n\tprint(0)\nelse:\n\tfor i in range(L,R):\n\t\tfor j in range(i+1,R+1):\n\t\t\tans = min(ans,(i*j)%2019)\n\tprint(ans)", "l,r = map(int,input().split())\nr = min(r,l + 1346)\nans = 2019\nfor i in range(l,r):\n for j in range(i + 1,r+1):\n \tans = min(ans,i*j%2019)\nprint(ans)", "l,r=map(int,input().split())\nans=10**10\nfor i in range(l,min(l+2019,r)):\n for j in range(l+1,min(l+2019,r)+1):\n ans=min(ans,i*j%2019)\nprint(ans)", "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\nlong long L,R;\n cin>>L>>R;\n long long Min=2018;\n if(R-L<2019){\n for(long long i=L; i<R; i++){\nfor (long long j=i+1; j<=R; j++){\n Min=min(Min,(i*j)%2019);\n}}\n printf(\"%lld\",Min);\n }\n else{\n cout<<0<<endl;}\n}\n \n", "#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n\tint a,b,i,j,m=3000,x,y;\n\tcin>>a>>b;\n\tif(b-a+1>=2019)puts(\"0\");\n\telse {\n\t\tfor(i=a; i<b; i++)for(j=i+1; j<=b; j++)x=i%2019,y=j%2019,m=min(m,(x*y)%2019);\n\t\tcout<<m;\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long int \n\nint main(){\n ll i,j,k,n,m;\n cin>>n>>m;\n if(m-n+1>=2019) cout<<\"0\\n\";\n else {\n ll ans=2020;\n for(i=n;i<=m;i++)\n {\n for(j=i+1;j<=m;j++) ans=min(ans,(i*j)%2019); \n }\n cout<<ans<<\"\\n\";\n }\n \n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tlong long L, R;\n\tcin >> L >> R;\n\tlong long ans = 2036;\n\tfor(long long i = L; i <= min(L + 4036, R); i++){\n\t\tfor(long long j = i + 1; j <= min(L + 4036, R); j++){\n\t\t\tans = min(ans, (i * j) % 2019);\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "l,r=map(int,input().split())\nn=r-l if r-l < 2019 else 2019\nans=(r*l)%2019\nfor i in range(l, l+n+1):\n for j in range(i+1, l+n+1):\n ans=min(ans, (i*j)%2019)\nprint(ans)", "import java.util.Scanner;\n\nclass Main {\n public static void main(final String[] args) {\n Scanner scan = new Scanner(System.in);\n int L = scan.nextInt();\n int R = scan.nextInt();\n int ans = Integer.MAX_VALUE;\n long x = 0;\n if (R - L >= 2019) {\n System.out.println(0);\n System.exit(0);\n }\n for (int i = L; i < R; i++) {\n for (int j = L + 1; j <= R; j++) {\n int m = (int)(((long)i * j) % 2019);\n ans = Math.min(ans, m);\n }\n }\n System.out.println(ans);\n }\n}", "import collections\nl,r = map(int, raw_input().split(' '))\ncc = collections.Counter([n % 2019 for n in range(l, min(r, l + 2019)+1) ])\n\nm = +float('inf')\nfor a in cc:\n\tfor b in cc:\n\t\tif a!=b or cc[a] > 1:\n\t\t\tm = min(m,(a*b) % 2019)\nprint m", "#include <bits/stdc++.h>\nusing namespace std;\nlong long int l,r;\nint ans=2019;\nint main()\n{\n\tcin>>l>>r;\n\tif(r-l>=2019)\n\t\tans=0;\n\telse\n\t\tfor(long long int i=l;i<=r;i++)\n\t\t\tfor(long long int j=l;j<i;j++)\n\t\t\t{\n\t\t\t\tint z=(i*j)%2019;\n\t\t\t\tif(z<ans)\n\t\t\t\t\tans=z;\n\t\t\t}\n\t\t\t\t\n\tcout<<ans;\n\treturn 0;\n} ", "L,R = map(int,input().split())\nR = min(R,L+2019)\nans = 2019\n\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n ans = min(ans,i*j%2019)\n\nprint(ans)", "import java.io.InputStream;\nimport java.io.PrintStream;\nimport java.util.Scanner;\n\npublic class Main {\n\tInputStream in = System.in;\n\tPrintStream out = System.out;\n\n\tpublic void _main(String[] args) {\n\t\tScanner sc = new Scanner(in);\n\n\t\tint L = sc.nextInt();\n\t\tint R = sc.nextInt();\n\n\t\tsc.close();\n\n\t\tR = Math.min(L + 2019, R);\n\n\t\tint ans = Integer.MAX_VALUE;\n\t\tfor(int x=L;x<R;x++) {\n\t\t\tfor(int y=x+1;y<=R;y++) {\n\t\t\t\tif(x==y)continue;\n\t\t\t\t\n\t\t\t\tint m = (int)(((long)x * y) % 2019);\n\t\t\t\tans = Math.min(ans, m);\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main()._main(args);\n\t}\n}\n", "l,r=map(int,input().split())\nans=10**15\nfor i in range(l,min(r,l+2100)):\n for j in range(i+1,min(r+1,l+2100)):\n ans=min(ans,(i*j)%2019)\n\nprint(ans)\n ", "#include<bits/stdc++.h> \nusing namespace std;\nint main(){ \n int a,b,c;\n cin>>a>>b;\n c=2019;\n for(int i=a;i<min(b,a+2019);i++){\n for(int j=i+1;j<min(b+1,a+2019+1);j++){\n c=min(c,i%2019*(j%2019)%2019);\n }\n }\n cout<<c<<endl;\n }", "/*\n非負整数L、Rが与えられます。\n２つの整数i,jをL<=i<j<=Rを満たすように選びます。\n(i*J)mod2019の最小値を求めてください。\n */\n\n\nimport java.util.*;\n\npublic class Main{\n public static void main(String[]args){\n Scanner sc=new Scanner(System.in);\n while(sc.hasNext()){\n long L=sc.nextLong();\n long R=sc.nextLong();\n long ans=1000000000;\n if(R-L>=2019){\n System.out.println(0);\n }else{\n for(long i=L;i<R;i++){\n for(long j=i+1;j<=R;j++){\n ans=Math.min(ans,(i*j)%2019);\n }\n }\n System.out.println(ans);\n }\n }\n }\n}\n", "L, R = map(int, input().split())\nif R-L >= 2020:\n print(0)\nelse:\n m = 2020\n for i in range(L, R):\n for j in range(i+1,R+1):\n m = min(m, (i*j)%2019)\n print(m)", "l,r = map(int,input().split())\nli = []\nr = min(r,l+4040)\nfor i in range(l,r):\n for j in range(i+1,r+1):\n li.append(i*j%2019)\nprint(min(li))", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n long l, r;\n Scanner scanner = new Scanner(System.in);\n l = scanner.nextInt();\n r = scanner.nextInt();\n \n if(r - l >= 2019){\n System.out.println(0);\n }else{\n long min = 2018;\n for(long i = l; i <= r - 1; i++){\n for(long j = i + 1; j <= r; j++){\n long ij = (i * j) % 2019;\n if(ij < min){\n min = ij;\n }\n }\n }\n System.out.println(min);\n }\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long L,R,result=2018;\n cin >> L >> R;\n if(R-L>=2019){\n result = 0;\n }else{\n for(long long i=L;i<R;i++){\n for(long long j=i+1;j<=R;j++){\n result = min(result,(i*j)%2019);\n }\n }\n }\n cout << result << endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n long min = 2018;\n r = Math.min(r, Math.min(r, l + 2019));\n for (long i = l; i < r; i++) {\n for (long j = i + 1; j <= r; j++) {\n if (i % 2019 == 0) {\n System.out.println(0);\n return;\n }\n min = Math.min(min, (i * j) % 2019);\n }\n }\n System.out.println(min);\n }\n\n}\n", "l,r=map(int,input().split())\nans = 2019\nfor i in range(l,min(r,l+2030)):\n\tfor j in range(i+1,min(r+1,i+2030)):\n\t\tans = min(ans,i*j%2019)\nprint(ans)\n\n", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n long long L, R;\n cin >> L >> R;\n R = min(R, L + 2019);\n \n long long a = 2018;\n for (auto i = L; i <= R; i++) {\n for (auto j = i + 1; j <= R; j++) {\n long long x = i * j % 2019;\n a = min(a, x);\n }\n }\n cout << a;\n}", "L, R = map(int, input().split())\nmod = 2019\nans = mod - 1\nR = min(R, L+mod-1)\nfor i in range(L, R):\n for j in range(i+1, R+1):\n ans = min(ans, i * j % mod)\nprint(ans)", "l, r = map(int, input().split())\nans = 2019\ncnt = min(l + 2019, r)\nfor i in range(l, cnt):\n for j in range(i + 1, cnt + 1):\n ans = min(ans, i*j % 2019)\nprint(ans)\n", "import java.util.*;\nimport java.lang.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tlong ans = 0;\n\t\tlong minium = 2019;\n\t\tif( R-L < 2019 ){\n\t\t\tloop:for( long i=L; i<=R-1; i++ ){\n\t\t\t\tfor( long j=i+1; j<=R; j++ ){\n\t\t\t\t\tans = ((i%2019L)*(j%2019L))%2019L;\n\t\t\t\t\tminium = Math.min(ans,minium);\n\t\t\t\t\tif( minium==0 ){\n\t\t\t\t\t\tbreak loop;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tminium = 0;\n\t\t}\n\t\tSystem.out.println(minium);\n\t}\n}\n", "import java.util.Scanner;\n\nclass Main {\n private static final int mod = 2019;\n private static void solve(long l, long r) {\n if (r - l >= 2018) {\n System.out.println(0);\n return;\n }\n Long min = null;\n for (long i = l; i <= r; i++) {\n for (long j = i + 1; j <= r; j++) {\n long m = (i * j) % mod;\n if (min == null || min > m) min = m;\n }\n }\n System.out.println(min);\n }\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n solve(l, r);\n }\n}", "l,r=map(int,input().split())\n\nans=2020\nif r-l>=2019:\n ans=0\nelse:\n for i in range(l,r+1):\n for j in range(i+1,r+1):\n ans = min(ans,i*j%2019)\nprint(ans)", "L, R = map(int,input().split(\" \"))\n\nm = 2018\n\nif R-L>=2019:\n print(0)\n exit()\n\nfor l in range(L,R):\n for r in range(l+1,R+1):\n m = min(m,l*r%2019)\n\nprint(m)\n", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n static void answer(long n){\n System.out.println(n);\n System.exit(0);\n }\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long L = sc.nextLong();\n long R = sc.nextLong();\n if(R-L>2100) answer(0);\n\n long ans = 2500;\n for(long i=L; i<=R; i++)for(long j=i+1; j<=R; j++){\n ans = Math.min(ans, (i*j)%2019);\n }\n answer(ans);\n\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nlong long l,r;\nint main(){\n\tscanf(\"%lld%lld\",&l,&r);\n\tif(r-l+1>=2019)cout<<0<<endl;\n\telse{\n\t\tlong long ans=2019;\n\t\tfor(long long i=l;i<r;i++){\n\t\t\tfor(long long j=i+1;j<=r;j++){\n\t\t\t\tans=min(i*j%2019,ans);\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}", "l, r = map(int, input().split())\nif r - l > 2019:\n print(0)\nelse:\n print(min([i * j % 2019 for i in range(l, r) for j in range(i+1, r+1)]))\n", "import java.io.*;\n\npublic class Main{\n\tpublic static final int YEAR = 2019;\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] line = br.readLine().split(\" \");\n\t\tint L = Integer.parseInt(line[0]);\n\t\tint R = Integer.parseInt(line[1]);\n\t\t\n\t\tif( R - L != R%YEAR - L%YEAR ){\n\t\t\tSystem.out.println(0);\n\t\t}else{\n\t\t\tL %= YEAR; R %= YEAR;\n\t\t\tint min = L*(L+1)%YEAR;\n\t\t\tfor(int i=L; i<R; i++) for(int j=i+1; j<=R; j++)\n\t\t\t\tif( i*j%YEAR < min )\n\t\t\t\t\tmin = i*j%YEAR;\n\t\t\tSystem.out.println(min);\n\t\t}\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\n\t\tlong ans = 2018;\n\n\t\tR = Math.min(R, L + 2019);\n\n\t\tfor (long i=L; i<=R; i++) {\n\t\t\tfor (long j=i+1; j<=R; j++){\n\t\t\t\tans = Math.min(ans, (i*j)% 2019);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\n\nint main()\n{\n lint L, R;\n cin >> L >> R;\n\n lint m = 2019;\n for (lint i = L; i < R and 0 < m; ++i)\n {\n for (lint j = i + 1; j <= R and 0 < m; ++j)\n {\n m = min((i * j) % 2019, m);\n }\n }\n cout << m << \"\\n\";\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint l,r;\nlong long ans=1e18;\nint main(){\n\tscanf(\"%d%d\",&l,&r);\n\tif(l/2019!=r/2019)ans=0;\n\telse {\n\t\tfor(int i=l;i<=r;i++){\n\t\t\tfor(int j=i+1;j<=r;j++){\n\t\t\t\tans=min(ans,1LL*i*j%2019);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n typedef long long ll;\n \nint main() {\nll l,r;\ncin>>l>>r;\nll ans=2020;\nfor(ll i=l;(i<r) && (i<l+2020);i++){\nfor(ll j=i+1;(j<=r) && (j<i+2021);j++){\n ans=min(ans, i*j%2019);\n}\n}\ncout<<ans<<endl;\n}\n", "L, R = map(int, input().split(\" \"))\n\nans = 2019\n\nR = min(R, L + 2019)\nfor l in range(L, R):\n for r in range(l + 1, R + 1):\n ans = min(ans, l * r % 2019)\nprint(ans)\n", "l,r=map(int,input().split())\nans=2019\nfor i in range(l,min(l+2019-1,r)):\n for j in range(l+1,min(l+2019,r+1)):\n ans=min(ans,((i%2019)*(j%2019))%2019)\nprint(ans)\n", "#include<iostream>\nusing namespace std;\nint main()\n{\n\tint l,r,min1=1<<30;\n\tcin>>l>>r;\n\tif(r-l>=2018)\n\t{\n\t\tcout<<0;\n\t\treturn 0;\n\t}\n\tfor(int i=l;i<=r-1;i++)\n\t\tfor(int j=i+1;j<=r;j++)\n\t\t{\n\t\t\tint a=i%2019,b=j%2019;\n\t\t\tmin1=min(min1,a*b%2019);\n\t\t}\n\tcout<<min1;\n\treturn 0;\n}", "l,r = map(int,input().split())\nmini = 2019\nfor i in range(l,min(r-1,l+2018)+1):\n for j in range(max(l+1,r-2018),r+1):\n mini = min(mini,(i*j)%2019)\nprint(mini)", "import sys\nL,R=map(int, sys.stdin.readline().split())\nsho1=(L-1)/2019\nsho2=R/2019\nif 1<=sho2-sho1:\n print 0\nelse:\n ans=float(\"inf\")\n for i in range(L,R):\n for j in range(i+1,R+1):\n ans=min(ans,i*j%2019) \n print ans", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int l,r;\n cin>>l>>r;\n r=min(r,l+2018);\n int ans=2018*2018;\n for(int i=l;i<=r;i++){\n for(int j=i+1;j<=r;j++){\n int x=i%2019;\n int y=j%2019;\n ans=min(ans,(x*y)%2019);\n }\n }\n cout<<ans<<endl;\n}\n", "L,R=map(int, input().split())\na=2019\nfor i in range(L,min(R,L+2019)):\n for j in range(i+1,min(R+1,L+2019)):\n d=(i*j)%2019\n if d<a:\n a=d\nprint(a)", "l, r = map(int, input().split())\nif r-l>= 2019:\n\tprint(0)\nelse:\n\ta = 10**9\n\tfor i in range(l,r+1):\n\t\tfor j in range(i+1,r+1):\n\t\t\ta = min((i*j)%2019,a)\n\tprint (a)\n", "#include <cstdio>\n#include <algorithm>\nusing namespace std;\nint L, R, m = 2019;\nint main() {\n scanf(\"%d %d\", &L, &R);\n for(int i = L; i < R && m > 0; i++) {\n for(int j = i+1; j <= R && m > 0; j++) {\n m = min(m, (i%2019)*(j%2019)%2019);\n }\n }\n printf(\"%d\", m);\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n \n ll L,R;\n \n cin >>L >>R;\n \n\tif(R-L>=2019) \n cout<<\"0\";\n\telse {\n\t\tll ans=0x3f3f3f3f;\n\t\tfor(int i=L;i<=R;i++)\n\t\t\tfor(int j=i+1;j<=R;j++)\n\t\t\tans=min(ans,1ll*i*j%2019);\n\t\tcout<<ans;\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\n \npublic class Main {\n \n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner input = new Scanner(System.in);\n\t\tlong N = input.nextInt();\n long D = input.nextInt();\n long remain = (long)(2 * Math.pow(10,9)) * 2;\n a:for (long i = N; i < D; i++) {\n for (long j = i + 1; j <= D; j++) {\n if((i*j)%2019 < remain)\n remain = (i*j)%2019;\n if(remain == 0)\n break a;\n }\n }\n\t\tSystem.out.println(remain);\n\t}\n}", "def main():\n a, b = map(int, raw_input().split())\n if b - a >= 2019:\n print 0\n return\n best = 2018\n for i in xrange(a, b):\n for j in xrange(i + 1, b + 1):\n best = min(best, i * j % 2019)\n print best\n\n\nif __name__ == '__main__':\n main()\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextInt();\n\t\tlong r = sc.nextInt();\n\n\t\tif(r-l+1 >= 2019) {\n\t\t\tSystem.out.println(\"0\");\n\t\t\treturn;\n\t\t}\n\t\tlong ans = 2019;\n\t\tfor(long i=l; i<r; i++) {\n\t\t\tfor(long j=i+1; j<=r; j++) {\n\t\t\t\tlong tmp = (i*j)%2019;\n\t\t\t\tans = Math.min(ans, tmp);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int mod=2019;\n\nint main()\n{\n\tint ans=mod,l,r;\n\tscanf(\"%d%d\",&l,&r);\n\tif(r-l>=mod) {\n\t\tprintf(\"0\");\n\t\treturn 0;\n\t}\n\tl%=mod,r%=mod;\n\tfor(int i=l;i<=r;++i)\n\t\tfor(int j=i+1;j<=r;++j) {\n\t\t\tans=min(ans,i*j%mod);\n\t\t}\n\tcout<<ans;\n}", "M=2019;L,R=map(int,input().split())\nl,r=L%M,R%M;s=range(l,r+1)\nprint(0 if R//M-L//M>0 else min(i*j%M for i in s for j in s if i<j))", "import java.util.Scanner;\n \nclass Main {\n public static void main(String args[]) {\n Scanner scanner = new Scanner(System.in);\n long L = scanner.nextLong();\n long R = scanner.nextLong();\n long min = 2018;\n \n if((R-L)<2019){\n for(long i=L; i<R; i++){\n for(long j=(i+1); j<=R; j++){\n if(min>i*j%2019){\n min = i*j%2019;\n }\n }\n }\n }else{\n min = 0;\n }\n System.out.println(min);\n \n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint l,r;cin>>l>>r;\n if(r-l>=2019)cout<<0<<endl,exit(0);\n l%=2019;r%=2019;if(l>r)r+=2019;\n int ans=2019;\n for(int i=l;i<=r;i++)for(int j=i+1;j<=r;j++){\n \tans=min(ans,i*j%2019);\n }\n cout<<ans<<endl;\n}\n", "l,r=map(int,input().split())\ns=range(l,r+1)[:2019]\nprint(min(i*j%2019for i in s for j in s if i<j))", "l,r=map(int,input().split())\nif r-l>672: print(0); exit()\nm=[i%2019 for i in range(l,r+1)]\na=2019\nfor i in m:\n for j in m:\n if i<j: a=min(a,i*j%2019)\nprint(a)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int l, r; cin >> l >> r;\n\n int ans = 2019;\n for(long long i=l; i<r && i<=l+2019; ++i){\n for(long long j=i+1; j<=r && j<=i+1+2019; ++j){\n int x = i*j % 2019;\n\n ans = min(x, ans);\n }\n }\n\n cout << ans << endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint lNum = s.nextInt();\n\t\tint rNum = s.nextInt();\n\t\tint ldim = lNum % 2019;\n\t\tint rdim = rNum % 2019;\n\t\ts.close();\n\t\tint min = 2019;\n\t\tif (lNum / 2019 == rNum / 2019) {\n\t\t\tfor (int i = ldim; i < rdim; i++) {\n\t\t\t\tfor (int j = i + 1; j <= rdim; j++) {\n\t\t\t\t\tint amari = (i * j) % 2019;\n\t\t\t\t\tif (amari < min) {\n\t\t\t\t\t\tmin = amari;\n\t\t\t\t\t}\n\t\t\t\t\tif(amari == 0) {\n\t\t\t\t\t\tmin = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}else {\n\t\t\tmin = 0;\n\t\t}\n\t\tSystem.out.println(min);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int64_t l,r;\n cin>>l>>r;\n int64_t ans=10000000000;\n\n if(r-l>=2019){\n cout<<0<<endl;\n }\n\n else{\n for(int64_t i=l;i<r;i++){\n for(int64_t j=l+1;j<=r;j++){\n ans=min(ans,(i*j)%2019);\n }\n }\n cout<<ans<<endl;\n }\n}\n", "#include<iostream>\nusing namespace std;\nlong L,R,ans=2020;\nint main() {\n\tcin >> L >> R;\n\tfor(long l=L; l<L+2020; l++) {\n for(long r=R; r>R-2020; r--) {\n\t\t if (l<r) {\n ans = min(ans, l%2019*r%2019);\n }\n\t }\n }\n\tcout << ans << endl;\n}\n", "import java.util.*;\nimport java.math.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t// 整数の入力\n\t\tlong l = sc.nextLong();\n\t\tlong r = sc.nextLong();\n\t\tlong CONST_YEAR = 2019l;\n\t\tlong resultMod =2019l;\n\n\t\tfor (long i = l; i < r; i++) {\n\t\t\tfor (long j = i+1; j <= r; j++) {\n\t\t\t\tlong result = i*j;\n\t\t\t\tlong mod = result % CONST_YEAR;\n\t\t\t\tif(mod == 0l){\n\t\t\t\t\tresultMod =0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tresultMod =Math.min(mod, resultMod);\n\t\t\t}\n\t\t\tif(resultMod==0l){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(resultMod);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int L,R;\n cin>>L>>R;\n if((L-1)/2019!=R/2019)\n cout<<0<<endl;\n else{\n L%=2019;\n R%=2019;\n int k=2019;\n for(int i=L;i<R;i++)\n for(int j=i+1;j<=R;j++)\n k=min(k,i*j%2019);\n cout<<k<<endl;\n }\n}", "import java.util.*;\n\npublic class Main {\n\n static int mod = 2019;\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n long lmod = l % mod;\n long diff = r - l;\n if(2019 <= lmod + diff) System.out.println(0);\n else{\n long ans = 2019;\n for (long i = l; i < r; i++) {\n for (long j = i+1; j <= r; j++) {\n ans = Math.min(ans, i * j % mod);\n }\n }\n System.out.println(ans);\n }\n sc.close();\n\n }\n\n}\n", "import java.util.Scanner;\n \npublic class Main {\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner input = new Scanner(System.in);\n\t\tlong l = input.nextInt();\n long r = input.nextInt();\n long remain = (long)(2 * Math.pow(10,9)) * 2;\n for (long i = l; i < r; i++) {\n for (long j = i + 1; j <= r; j++) {\n if(i*j %2019 < remain)\n remain = i*j %2019;\n if(remain == 0)\n break;\n }\n if(remain == 0)\n break;\n }\n\t\tSystem.out.println(remain);\n\t}\n}", "#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n#define LL long long\nint l,r,ans=2020;\nint main()\n{\n\tscanf(\"%d%d\",&l,&r);\n\tif(r-l+1>=2019)\n\t{\n\t\tprintf(\"0\");\n\t\treturn 0;\n\t}\n\tfor(int i=l;i<r;i++)\n\t\tfor(int j=i+1;j<=r;j++)\n\t\t\tans=min(ans,int(1LL*i*j%2019));\n\tprintf(\"%d\",ans);\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = int_fast64_t;\nint main(){\n Int l,r;\n cin >> l >> r;\n\tInt ans = 1e9;\n\tif(l+2018 <= r){\n\t\tans = 0;\n\t}else{\n\t\tfor(Int i=l; i<r; ++i)\n\t\t\tfor(Int j=i+1; j<=r; ++j)\n\t\t\t\tans = min(ans, i*j%2019);\n\t}\n\tcout << ans << \"\\n\";\n return 0;\n}", "l,r=map(int,input().split())\n\nans=10000\nth=l+min(r-l,2020)\nfor i in range(l,th):\n for j in range(i+1,th+1):\n ans=min(ans,(i*j)%2019)\n\nprint(ans)", "l, r = map(int, raw_input().split())\n\nif r-l >= 2019:\n print \"0\"\nelse:\n res = 2018\n for i in range(l,r):\n for j in range(i+1, r+1):\n res = min(res, (i*j) % 2019)\n print res\n", "L, R = map(int, input().split())\n\nans = min(\n (i * j) % 2019\n for i in range(L, min(R, L + 2019) + 1)\n for j in range(i + 1, min(R, i + 2019) + 1)\n)\n\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main(){\n int L, R;\n cin >> L >> R;\n int ans = 2019;\n for (int i = L; i <= min(R, L + 2020); ++i)\n for (int j = L; j < i; ++j)\n ans = min(ans, (i % 2019) * (j % 2019) % 2019);\n \n cout << ans << '\\n';\n \n \n}", "L,R = map(int,input().split())\nA = []\nfor i in range(min((R-L), 2020)):\n for j in range(i+1, min((R-L+1), 2021)):\n A.append((i+L)*(j+L)%2019)\nprint(min(A))", "import java.util.Scanner;\n\npublic class Main {\n private static final int MOD = 2019;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int L = sc.nextInt();\n int R = sc.nextInt();\n\n System.out.println(solve(L, R));\n }\n\n private static int solve(int L, int R) {\n int min = 2018;\n\n if (R-L >= 2019) return 0;\n\n L %= MOD;\n R %= MOD;\n if (L>R) return 0;\n\n for (int i=L; i<R; i++) {\n for (int j=L+1; j<=R; j++) {\n min = Math.min(min, i*j%MOD);\n }\n }\n\n return min;\n }\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n long L = sc.nextLong();\n long R = sc.nextLong();\n\n \n long res=2019;\n \n long bai = L/2019;\n\n if(L%2019==0 || 2019*(bai+1)<=R){\n res = 0;\n }else{\n for(long i=L; i<R; i++){\n for(long j=i+1; j<R+1; j++){\n res = Math.min(res,(i*j)%2019);\n }\n }\n }\n System.out.println(res);\n \n }\n }", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tlong N = R;\n\n\t\tif (R > L + 2019) {\n\t\t\tN = L + 2019;\n\t\t}\n\t\tint ans = Integer.MAX_VALUE;\n\t\tfor (long i = L; i <= N; i++) {\n\t\t\tfor (long j = i + 1; j <= N; j++) {\n\t\t\t\tans = (int) Math.min(ans, i * j % 2019);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n}", "import java.util.Scanner;\n\n/**\n * Main\n */\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n long L = sc.nextLong();\n long R = sc.nextLong();\n\n sc.close();\n \n int min = 2019;\n\n if(R-L > 2018){\n min = 0;\n }else{\n for(long i = L; i <= R-1; i++){\n for(long j= i+1; j <= R; j++){\n long tmp = i*j%2019;\n min = (int) Math.min(tmp, min);\n }\n }\n }\n System.out.println(min);\n }\n}", "l,r=map(int,input().split())\nX=[]\nif r-l>=2019:\n print(0)\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n X.append((i*j)%2019)\n print(min(X))", "import java.io.IOException;\nimport java.util.*;\n\npublic class Main {\n public static int map[][]=new int[11][11];\n public static void main(String args[]){\n Scanner sc=new Scanner(System.in);\n long L=sc.nextLong();\n long R=sc.nextLong();\n\n long diff=R-L;\n long lmod=L%2019;\n if(lmod+diff>=2019){\n System.out.println(0);\n return;\n }\n \n long ans=999999;\n for(long i=L;i<R;i++){\n for(long j=i+1;j<=R;j++){\n ans=Math.min(ans,i*j%2019);\n }\n }\n System.out.println(ans);\n }\n\n\n}", "L,R=map(int,input().split())\nans=0\nif R-L<2019:\n ans=min([i*j%2019 for i in range(L,R) for j in range(i+1,R+1)])\nprint(ans)", "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int l = sc.nextInt();\n int r = sc.nextInt();\n int result = 2018;\n loop: for (long i = l; i < r; i++) {\n for (long j = i + 1; j <= r; j++) {\n result = Math.min(result, (int)((i * j) % 2019));\n if ((i * j) % 2019 == 0) {\n break loop;\n }\n }\n }\n System.out.println(result);\n sc.close();\n }\n}", "L,R= list(map(int, input().split()))\nN = min(R-L+1,2019)\nMOD = 2019\nm = MOD\n\nfor i in range(L,L+N):\n for j in range(i+1,L+N):\n m = min(m,(i*j)%MOD)\n\nprint(m)", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\t\tlong l = sc.nextLong();\n\t\t\tlong r = sc.nextLong();\n\t\t\tlong sub = r - l;\n\n\t\t\tif (2019 < sub) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tlong result = 2020;\n\t\t\tfor (long i = l; i < r; i++) {\n\t\t\t\tif (i % 2019 == 0) {\n\t\t\t\t\tSystem.out.println(0);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tfor (long j = i + 1; j <= r; j++) {\n\t\t\t\t\tif ((i * j) % 2019 < result) {\n\t\t\t\t\t\tresult = (i * j) % 2019;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSystem.out.println(result);\n\t\t}\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long l,r;\n cin>>l>>r;\n int ans=30000;\n r=min(r,l+4038);\n for(long long i=l;i<=r;i++){\n for(long long j=i+1;j<=r;j++){\n int x=i*j%2019;\n ans=min(ans,x);\n }\n }\n cout<<ans<<endl;\n}\n \n \n \n \n", "import java.util.*;\n\npublic class Main{\n public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n int L = scanner.nextInt();\n int R = scanner.nextInt();\n\n int mod = 2018;\n \n for(int i=L; i<Math.min(L+2018, R); i++){\n for(int j=i+1; j<=Math.min(L+2018, R); j++){\n int modl = i % 2019;\n int modr = j % 2019;\n int modlr = (modl * modr) % 2019;\n if(modlr < mod){\n mod = modlr;\n }\n }\n }\n System.out.println(mod);\n }\n}", "l,r=map(int,input().split())\nif r-l>=2019:\n print(0)\nelse:\n tmp=2019\n for i in range(l,r+1):\n for j in range(i+1,r+1):\n tmp=min(tmp,(i*j)%2019)\n print(tmp)", "L,R=map(int,input().split())\n\nans=2018\nl=min(L+2019, R+1)\nfor i in range(L, l-1):\n\tfor j in range(i+1,l):\n\t\tans=min(ans,(i*j)%2019)\nprint(ans)", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n long tmp = 2018;\n\n if(r-l >= 2019){\n tmp = 0;\n }else{\n for(long i = l;i < r;++i){\n for(long j = i+1;j <= r;++j){\n tmp = Math.min(tmp,(i*j)%2019);\n }\n }\n \n }\n System.out.println(tmp);\n }\n }\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int l, r, ans = 2019;\n cin >> l >> r;\n r = min(r, l + 2019);\n for (int i = l; i < r; i++)\n for (int j = i + 1; j <= r; j++)\n ans = min(ans, (i % 2019) * (j % 2019) % 2019);\n cout << ans << endl;\n}\n", "l,r=[int(x) for x in input().split()]\nL=l%2019\na=2020\nfor i in range(1,2020):\n if l+i<=r:\n for j in range(i):\n a=min((L+j)*(L+i)%2019,a)\nprint(a)", "import java.util.*;\nimport java.io.*;\npublic class Main{\n public static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter ou = new PrintWriter(System.out);\n\t\tint l = Integer.parseInt(sc.next());\n\t\tint r = Integer.parseInt(sc.next());\n\t\tsc.close();\n\t\tr -= l;\n\t\tl %= 2019;\n\t\tr += l;\n\t\tint yono = 2019;\n\t\tif(r - l > 2019){\n\t\t\tyono = 0;\n\t\t}else{\n\t\t\tfor(int i = l ; i <= r ; i++){\n\t\t\t\tfor(int j = l ; j < i ; j++){\n\t\t\t\t\tyono = Math.min(yono , (i * j) % 2019);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tou.print(yono + \"\\n\");\n\t\tou.flush();\n }\n}", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long a = in.nextLong();\n long b = in.nextLong();\n\n if (b - a >= 2019) System.out.println(0);\n else {\n long min = Long.MAX_VALUE;\n for (long i = a; i <= b; ++i) {\n for (long j = i + 1; j <= b; ++j) {\n min = Math.min(min, ((i % 2019) * (j % 2019)) % 2019);\n }\n }\n\n System.out.println(min);\n }\n }\n}", "import java.util.Scanner;\n\npublic class Main{\n\tstatic long a;\n\tstatic long b;\n\tstatic long x;\n\tpublic static void main(String[] args){\n\t\tScanner scan = new Scanner(System.in);\n\t\tlong l = scan.nextLong();\n\t\tlong r = scan.nextLong();\n\n\t\tif(r - l > 2020) {\n\t\t\tr = l + 2020;\n\t\t}\n\n\t\tlong ans = Long.MAX_VALUE;\n\t\tfor(long i = l; i <= r - 1; i++) {\n\t\t\tfor(long j = i + 1; j <= r; j++) {\n\t\t\t\tif(ans > ((i % 2019) * j) % 2019) {\n\t\t\t\t\tans = ((i % 2019) * j) % 2019;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner scanner = new Scanner(System.in);\n long L = scanner.nextInt();\n long R = scanner.nextInt();\n scanner.close();\n\n R = Math.min(R, L + 4038);\n\n long ans = 2018;\n for(long i = L; i < R; i++) {\n for(long j = i + 1; j <= R; j++) {\n ans = Math.min(ans, i * j % 2019);\n }\n }\n System.out.println(ans);\n }\n}", "l,r=map(int,input().split())\nif l//2019!=r//2019:\n print(0)\n exit()\n\nans=2019\nfor i in range(l,r):\n for k in range(i+1,r+1):\n ans=min(ans,i*k%2019)\nprint(ans)", "temp=input().split()\nL=int(temp[0])\nR=int(temp[1])\n\nif R-L>=2019:\n print(0)\nelse:\n print(min([(i*j)%2019 for i in range(L, R) for j in range(i+1, R+1)]))", "x,y=list(map(int, input().split()))\n\nif y>x+2020:\n\ty=x+2020\n\nans=2019\nfor i in range (x,y+1):\n\tfor j in range (i+1,y+1):\n\t\tif (i*j)%2019<ans:\n\t\t\tans=(i*j)%2019\nprint(ans)", "import itertools\nL,R = map(int,input().split())\nans = 2019\nfor i,j in itertools.combinations(range(L,min(R+1,L+2020)), 2):\n ans = min(ans, i*j%2019)\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int L,R;\n cin >>L>>R;\n int ans = 2019;\n for(int i=L;i<min(R,L+2019);i++){\n for(int j=R;j>max(L,R-2019);j--){\n ans=min(ans,(i%2019)*(j%2019)%2019);\n \n }\n }\n \n cout <<ans<<endl;\n}\n\n\n", "\nimport java.util.*;\n\nclass Main{\n public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n int L = stdIn.nextInt(); int R = stdIn.nextInt();\n int answer = 2018;\n if( R - L + 1 >= 673) answer = 0;\n else{\n for(int i = L; i <= R -1; i++){\n for(int j = i + 1; j <= R; j++){\n if(answer > (i % 2019) * (j % 2019) % 2019){\n answer = (i % 2019) * (j % 2019) % 2019;\n }\n }\n }\n }\n System.out.println(answer);\n }\n}", "l,r=map(int,input().split())\nif r-l>=2019:\n print(0)\nelse:\n a=float(\"inf\")\n for i in range(l,r):\n for j in range(l+1,r+1):\n a=min(i*j%2019,a)\n print(a)", "l,r=map(int,input().split())\nans=2020\nfor i in range(l,min(r,l+2019)):\n for j in range(i+1,min(r,i+2019)+1):\n ans=min(ans,(i*j)%2019)\nprint(ans)", "import java.util.*;\n\nclass Main{\n\tpublic static void main(String[] $) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint l=s.nextInt(),r=s.nextInt();\n\n\t\tif(l%2019==0||r%2019==0||l/2019<r/2019) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tlong res=Integer.MAX_VALUE;\n\t\tfor(long i=l;i<=r;++i) {\n\t\t\tfor(long j=i+1;j<=r;++j) {\n\t\t\t\tres=Math.min(res,i%2019*j%2019);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(res);\n\t}\n}", "L, R = [int(_) for _ in input().split()]\n\nans = 10000\nR = min(R, L + 2019)\nfor j in range(L, R+1):\n for i in range(L, j):\n ans = min((i*j)%2019, ans)\nprint(ans)\n", "l,r=map(int,input().split())\na=0\nif r-l<2019:\n \ta=min([(i*j)%2019 for i in range(l,r+1) for j in range(i+1,r+1)])\nprint(a)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tsc.close();\n\n\t\tint mod = 2019;\n\t\tif (l / mod < r / mod) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tint ml = l % mod;\n\t\t\tint mr = r % mod;\n\t\t\tint ans = mod;\n\t\t\tfor (int i = ml; i < mr; i++) {\n\t\t\t\tfor (int j = i + 1; j <= mr; j++) {\n\t\t\t\t\tans = Math.min(ans, i * j % mod);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "l,r=map(int,input().split())\nif r - l >= 2018:\n print(0)\n exit()\n\nm=10000\nfor i in range(l,r):\n for j in range(i+1,r+1):\n m = min(m,(i*j)%2019)\n\nprint(m)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\n\t\tfinal int divide = 2019;\n\t\tlong ans =1000000000;\n\n\t\tif(R - L >= 2019)System.out.println(0);\n\t\telse {\n\t\t\tfor(long i=L; i<R; i++) {\n\t\t\t\tfor(long j =i+1; j<=R; j++) {\n\t\t\t\t\tans = Math.min(ans, (i*j)%divide);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n}\n", "import java.util.Scanner;\n \npublic class Main {\n\tpublic static void main(String[] args) {\n \n\t\tlong a,b;\n \n\t\tScanner sc = new Scanner(System.in);\n \n\t\ta = sc.nextLong();\n\t\tb = sc.nextLong();\n \n\t\tlong ans = 2018;\n \n\t\tif (b - a >= 2019) {\n\t\t\tans = 0;\n\t\t} else {\n \n\t\t\tfor (long i = a; i < b; ++i) {\n\t\t\t\tfor (long j = i+1; j <= b; ++j) {\n\t\t\t\t\tans = Math.min(ans, (i * j) % 2019);\n\t\t\t\t}\n \n\t\t\t}\n \n\t\t}\n \n\t\t\tSystem.out.println(ans);\n \t}\n \n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n,L,R;\n\tint ans=2020;\n\tcin>>L>>R;\n\tn=R-L;\n\tfor(int i=L;i<L+min(2019,n);i++){\n\t\tfor(int j=i+1;j<=min(R,i+2019);j++){\n\t\t\tans=min(((i%2019)*(j%2019))%2019,ans);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n \n Scanner sc = new Scanner(System.in);\n long a = sc.nextLong();\n long b = sc.nextLong();\n long res = 2020;\n if(b - a >= 2019){\n res = 0;\n }else{\n for(long i = a; i < b; i++){\n for(long j = a + 1; j <= b; j++){\n res = Math.min(res, (i * j) % 2019);\n }\n }\n }\n System.out.println(res);\n }\n}", "import java.util.Scanner;\n\n\npublic class Main{\n\n\tpublic static void main(String args[]){\n\n\t\tlong MOD=1000000007L;\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong L=sc.nextLong();\n\t\tlong R=sc.nextLong();\n\t\tint l=(int)L%2019;\n\t\tint r=(int)R%2019;\n\t\tint ans=2018;\n\n\t\tif((int)L/2019 != (int)R/2019)System.out.println(0);\n\t\telse{\n\t\t\tfor(int i=l;i<r;++i){\n\t\t\t\tfor (int j=l+1;j<=r;++j){\n\t\t\t\t\tans=Math.min(ans, (i*j)%2019);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n\tlong long l, r; cin >> l >> r;\n\tr = min(r, l + 4038);\n\tlong long ans = 1e18;\n\tfor (long long i = l; i <= r; ++i) \n\t\tfor (long long j = i + 1; j <= r; ++j)\n\t\t\tans = min(ans, (i * j) % 2019);\n\tcout << ans << '\\n';\t\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n long long L,R;cin>>L>>R;\n if(R-L>3000)cout<<0<<endl;\n else{\n long long res=2018;\n for(long long i=L;i<R;i++){\n for(long long j=i+1;j<=R;j++){\n res=min(res,(i*j)%2019);}\n }\n cout<<res<<endl;\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int l,r;\n cin>> l >> r;\n \n int ans=2019;\n if (r-l+1 >= 2019) ans=0;\n else {\n for (int i=l; i<r; i++){\n for (int j=i+1; j<=r; j++){\n ans=min((i%2019)*(j%2019)%2019,ans);\n }\n }\n }\n cout<< ans <<endl;\n}", "#include<iostream>\nusing namespace std;\n\nint main() {\n\tint L, R;\n\tcin >> L >> R;\n\tint m = 2019;\n\tif (L/2019 != R/2019) {\n\t\tm = 0;\n\t}\telse {\n\t\tfor (int i = L % 2019; i <= R % 2019; i++) {\n\t\t\tfor (int j = i + 1; j <= R % 2019; j++) {\n\t\t\t\tm = min(m, (i * j) % 2019);\n\t\t\t}\n\t\t}\n\t}\n\tcout << m << endl;\n}\n", "l,r=map(int,input().split())\nm,ans=2019,2018\nr=min(r,l+2019*2)\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n i%=m\n j%=m\n ans=min(ans,(i*j)%m)\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long l,r;\n cin >> l >> r;\n r = min(r,l+4038);\n int ans = 2018;\n for(long long i = l;i <= r;i++){\n for(long long j = i+1;j <= r;j++){\n int x = (i*j)%2019;\n ans = min(ans,x);\n }\n }\n cout << ans << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tlong long l,r,i,j,ans=3000;\n\tcin>>l>>r;\n\tif(r/2019!=l/2019)\n\t{\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tl%=2019;\n\tr%=2019;\n\tfor(i=l;i<=r;i++)\n\t{\n\t\tfor(j=i+1;j<=r;j++)\n\t\t{\n\t\t\tans=min(ans,(i*j)%2019);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong l = in.nextLong();\n\t\tlong r = in.nextLong();\n\t\tif(r-l+1>=2019) System.out.println(0);\n\t\telse {\n\t\t\tlong min = Long.MAX_VALUE;\n\t\t\tfor(long i=l;i<=r;i++) {\n\t\t\t\tfor(long j=i+1;j<=r;j++) {\n\t\t\t\t\tlong tmp = ((i%2019)*(j%2019))%2019;\n\t\t\t\t\tif(tmp<min) min = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t\t\n\t\tin.close();\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tlong l,r,i,j,ans=2018,mod=2019;\n\tcin >> l >> r;\n\tr=min(r,l+2019);\n\tfor(i=l; i<r; i++){\n\t\tfor(j=i+1; j<=r; j++){\n\t\t\tans=min(ans,(i*j)%mod);\n\t\t}\n\t}\n\tcout << ans;\n}", "L, R = map(int,input().split())\n\nans = 2019\nfor i in range(L, min(L + 2019, R)):\n for j in range(L + 1, min(L + 2020, R + 1)):\n ans = min((i*j) % 2019, ans)\n\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong(), r = sc.nextLong();\n long res = Long.MAX_VALUE;\n r = Math.min(l + 2019L, r);\n for(long i = l; i <= r; i++) {\n for(long j = i + 1; j <= r; j++) {\n res = Math.min(res, (i * j) % 2019L);\n }\n }\n System.out.println(res);\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint main(){\n\tll ans=1e9;\n\tll a,b;\n\tcin>>a>>b;\n\tif(a/2019!=b/2019){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tfor(ll i=a;i<=b;i++){\n\t\tfor(ll j=i+1;j<=b;j++){\n\t\t\tans=min(ans,i*j%2019);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tlong L,R;\n\tcin>>L>>R;\n\tint ans=2018;\n\tif(R-L+1 > 2019)ans = 0;\n\telse{\n\t\tfor(long i=L;i<R;++i){\n\t\t\tfor(long j=i+1;j<=R;++j){\n\t\t\t\tif(ans>(i*j)%2019)ans = (i*j)%2019;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n long ans = 0;\n if((r - l) <= 2019) {\n long t = 2019;\n for(long i = l; i < r; i++) {\n for(long j = i + 1; j <= r; j++) {\n long i2 = (i % 2019);\n long j2 = (j % 2019);\n t = Math.min(t, (i2 * j2) % 2019);\n }\n }\n ans = t;\n }\n System.out.println(ans);\n }\n}\n", "l,r=map(int,input().split())\na=0\nif r-l<2019:\n \ta=min([(i%2019*j%2019) for i in range(l,r+1) for j in range(i+1,r+1)])\nprint(a%2019)", "import java.util.*;\npublic class Main {\n \n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int L = sc.nextInt();\n int R = sc.nextInt();\n \n if ((R / 2019) > (L / 2019)) {\n System.out.println(0);\n return;\n }\n\n int ans = Integer.MAX_VALUE;\n for (int l = L; l < R; l++) {\n for (int r = l+1; r <=R; r++) {\n int mod = (int)(((long)l*r)%(long)2019);\n if (mod < ans) {\n ans = mod;\n }\n }\n }\n \n System.out.println(ans);\n } \n}\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tlong long int l,r,d;\n\tcin>>l>>r;\n\t\n\tif(r-l>2019)\n\t\td=0;\n\telse{\n\t\td=(l*(l+1))%2019;\n\t\tfor(int i=l;i<=r;i++){\n\t\t\tfor(int m=i+1;m<=r;m++){\n\t\t\t\tif(((i%2019)*(m%2019))%2019<d)\n\t\t\t\t\td=((i%2019)*(m%2019))%2019;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<d<<endl;\n\t\n\treturn 0;\n}", "import java.util.*;\nimport static java.lang.Math.*;\nimport java.math.BigInteger;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\n\t\t// 計算\n\t\tint result = Integer.MAX_VALUE;\n\t\tfor(int i = l; i < min(l + 2019, r + 1); i++){\n\t\t for(int j = i + 1; j < min(l + 2019, r + 1); j++){\n\t\t result = min(result, ((i%2019)*(j%2019))%2019);\n\t\t }\n\t\t}\n\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n}\n", "s=range(*eval(input().replace(' ',',1+')))[:673];print(min(i*j%2019for i in s for j in s if i<j))", "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tif (r - l + 1 >= 2019 || r % 2019 < l % 2019) {\n\t\t System.out.println(0);\n\t\t return;\n\t\t}\n\t\tint min = Integer.MAX_VALUE;\n\t\tfor (int i = l; i < r; i++) {\n\t\t for (int j = i + 1; j <= r; j++) {\n\t\t min = Math.min(min, (i % 2019) * (j % 2019) % 2019);\n\t\t }\n\t\t}\n\t\tSystem.out.println(min);\n }\n}\n", "l,r = map(int, input().split())\n\nif r - l >= 2019:\n print(0)\n exit()\n\nans = 10**9\nfor i in range(l,r):\n for j in range(i+1, r+1):\n ans = min(ans, i*j%2019)\nprint(ans)", "L,R=map(int,input().split())\nif R-L>=2019:\n print(0)\nelse:\n x=[i*j%2019 for i in range(L,R) for j in range(i+1,R+1)]\n print(min(x))", "L, R = map(int, input().split())\nR = min(R, L+2018)\nans = 2018\nfor i in range(L, R):\n for j in range(i+1, R+1):\n ans = min(ans, (i*j)%2019)\nprint(ans)\n", "L, R = map(int, input().split())\nMOD = 2019\n\nprint(min(\n (i * j) % MOD\n for i in range(L, R + 1)\n for j in range(i + 1, R + 1)\n) if R - L < MOD - 1 else 0)\n", "a, b = map(int, input().split())\n\nc = []\nfor i in range(a, min(b, a+2019) + 1):\n for j in range(i+1, min(b, a+2019) + 1):\n c.append((i * j) % 2019)\n\nprint(min(c))", "L,R=map(int,input().split())\nR=min(R,L+2019)\n\nans=2019\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n ans=min(ans, (i*j)%2019)\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tlong long l, r, ans = 2018;\n\tcin >> l >> r;\n\tr = min(l + 2019, r);\n\tfor (long long i = l; i <= r; ++i) {\n\t\tfor (long long j = i + 1; j <= r; ++j) {\n\t\t\tans = min(ans, i * j % 2019);\n\t\t}\n\t}\n\tcout << ans << endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\n\t\tint mod = 2019;\n\n\t\tint l = in.nextInt();\n\t\tint r = in.nextInt();\n\t\t\n\t\t// 2019の倍数が必ずある場合\n\t\tif(r-l >= mod) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tlong IbyJ = 0;\n\t\tlong min = Long.MAX_VALUE;\n\n\t\tfor ( long i = l; i < r; i++ ) {\n\t\t\tfor ( long j = i + 1; j <= r; j++ ) {\n\t\t\t\tIbyJ = i * j;\n\t\t\t\tmin = (IbyJ % mod) < min ? (IbyJ % mod) : min;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\n\t\tin.close();\n\t}\n}", "#include<iostream>\n#include<math.h>\nusing namespace std;\nint n,m,ans=2019*2019;\nint main()\n{\n\tcin>>n>>m;\n\tif(m-n>=2019)\n\t\tcout<<0<<endl;\n\telse\n\t{\n\t\t for(int i=n;i<m;i++)\n\t\t\tfor(int o=i+1;o<=m;o++)\n\t\t\t\tans=min(ans,((i%2019)*(o%2019)%2019));\n\t\tcout<<ans<<endl;\n\t}\n}", "def remainder_min(l,r):\n sml = 2*(10**9)**2+1\n _r = min(r,l+2019)\n for i in range(l,_r):\n for j in range(i+1,_r+1):\n num = i * j\n rem = num % 2019\n if rem == 0:\n return 0\n sml = min(sml,rem)\n return sml\n\nif __name__ == '__main__':\n l,r = map(int,raw_input().split())\n print remainder_min(l,r)", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main(){\n long long int L,R;\n cin >> L >> R;\n \n R=min(R,L+4038);\n int ans =2018;\n \n for(long long int i=L;i<=R;i++){\n for(long long int j=i+1;j<=R;j++){\n int x=i*j%2019;\n ans=min(x,ans);\n }\n }\n \n cout << ans << endl;\n}", "#include <iostream>\n#include <cstdio>\nusing namespace std;\n\nlong long a, b, mn = 1e9;\nint main() {\n\tlong long i, j;\n\tcin>>a>>b;\n\tfor(i=a; i<=min(a+2019, b); i++) for(j=i+1; j<=min(a+2019, b); j++) {\n\t\tmn = min(mn, i * j % 2019);\n\t}\n\tcout<<mn;\n\treturn 0;\n}\n", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tlong L = scan.nextLong();\n\t\tlong R = scan.nextLong();\n\t\t\n\t\tlong min = Long.MAX_VALUE;\n\t\t\n\t\tif(Math.abs(L - R) >= 2019) {\n\t\t\tSystem.out.println(0);\n\t\t\tscan.close();\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tfor(long i = L; i < R; i++) {\n\t\t\tfor(long j = i + 1; j <= R; j++) {\n\t\t\t\tif(min > (i * j) % 2019) {\n\t\t\t\t\tmin = (i * j) % 2019;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t\tscan.close();\n\t}\n\n}", "l, r = (int(_) for _ in input().split())\nr = min(r,l+2019)\nx = [i*ii%2019 for i in range(l,r+1) for ii in range(i+1,r+1)]\nprint(min(x))\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t long L =sc.nextLong();\n\t long R = sc.nextLong();\n\t int min = Integer.MAX_VALUE;\n\n\t for(int i=0;i<2018;i++) {\n\t \tlong num1 = L+i;\n\t \tif(num1>R)break;\n\t \tfor(int j=i+1;j<2019;j++) {\n\t\t \tlong num2 = L+j;\n\t\t \tif(num2>R)break;\n\t\t \tint a = (int)(((num1%2019)*(num2%2019))%2019);\n\t\t \tmin = Math.min(a,min);\n\t \t}\n\t }\n\t System.out.println(min);\n\t}\n\n\n\n}", "import java.util.*;\n \npublic class Main {\n public static void main (String[] arg) {\n Scanner scan = new Scanner(System.in);\n long L = scan.nextLong();\n long R = scan.nextLong();\n long min = 2019;\n \n if(R-L >= 2018-(L%2019)){\n System.out.println(0);\n return;\n } else {\n for(Long i = L; i < R; i++){\n for(int j = 1; j <= R-i; j++){\n if((i*(i+j))%2019 < min){\n min = (i*(i+j))%2019;\n }\n }\n }\n System.out.println(min);\n }\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n\t\n\tll l,r; cin>>l>>r;\n\tif(r-l>=2019) cout << 0 << endl;\n\telse{\n\t\tint m{2020};\n\t\tfor(ll i=l; i<r; i++){\n\t\t\tfor(ll j=i+1; j<=r; j++){\n\t\t\t\tm = min<ll>(m,(i*j)%2019);\n\t\t\t}\n\t\t}\n\t\tcout << m << endl;\n\t}\n\t\n}", "import java.util.*;\n\npublic class Main {\n public static void main (String[] args) {\n Scanner sc = new Scanner(System.in);\n\n long l = sc.nextInt();\n long r = sc.nextInt();\n \n long ans = 2019;\n LABEL:for (long i = l; i < r; i++) {\n for (long j = l + 1; j <= r; j++) {\n ans = Math.min(ans, (i * j) % 2019);\n if (ans == 0) break LABEL;\n }\n }\n \n System.out.println(ans);\n }\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int l=sc.nextInt();\n int r=sc.nextInt();\n int po=Math.min(r-l+1,2019);\n long ans=100000000;\n for(int i=0;i<po-1;i++){\n for(int j=i+1;j<po;j++){\n long ans2=1;\n ans2=((long)(l+i))*(l+j);\n ans2%=2019;\n ans=Math.min(ans,ans2);\n }\n }\n System.out.println(ans);\n }\n}\n", "import java.util.Scanner;\n \npublic class Main {\n \n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n long L = scan.nextLong();\n long R = scan.nextLong();\n \n long result = 2018;\n\n for (long i = L; i < R; i++){\n for (long j = i + 1; j <= R; j++){\n long mod = (i * j) % 2019;\n if(result == 0) break;\n if(result > mod) result = mod;\n if(result == 0) break;\n }\n }\n\n System.out.println(result);\n }\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n ll l,r;\n cin>>l>>r;\n int ans=2018;\n r = min(r,l+4038);\n for(ll i=l;i<=r;i++){\n for(ll j=i+1;j<=r;j++){\n int x = i*j%2019;\n ans=min(ans,x);\n }\n }\n cout<<ans<<endl;\n return 0;\n}\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n long long L,R; cin>>L>>R;\n \n if (R-L>2019) cout<<0<<endl;\n else{\n long long ans=2018;\n for (long long i=L;i<R;++i)\n for (long long j=i+1;j<=R;++j)\n ans = min(ans,(i*j)%2019);\n cout<<ans<<endl;\n }\n}\n ", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l=sc.nextLong(),r=sc.nextLong(),min=Long.MAX_VALUE;\n\t\tif(l==0 || r-l>=2018) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tfor(long i=l;i<r;i++) {\n\t\t\t\tif(i%2019==0) {\n\t\t\t\t\tSystem.out.println(0);\n\t\t\t\t\tSystem.exit(0);\n\t\t\t\t}\n\t\t\t\tfor(long j=l+1;j<=r;j++) {\n\t\t\t\t\tmin=Math.min(min, (i*j)%2019);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t}\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n long long l,r;\n scanf(\"%lld%lld\",&l,&r);\n r=min(r,l+5000);\n long long ans=2018;\n for(long long i=l;i<=r;i++)\n for(long long j=i+1;j<=r;j++)\n {\n ans=min(ans,i*j%2019);\n }\n printf(\"%lld\\n\",ans);\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tlong long l,r;\n\tcin>>l>>r;\n\tif(r-l>=2018)\n\t{\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tlong long ans=2018;\n\tfor(long long i=l;i<=r;i++)\n\t\tfor(long long j=i+1;j<=r;j++)\n\t\t\tans=min(ans,i*j%2019);\n\tcout<<ans<<endl;\n\treturn 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint L = sc.nextInt();\n\t\tint R = sc.nextInt();\n\t\tint min = 2018;\n\t\tif (R - L > 2019) {\n\t\t\tSystem.out.print(0);\n\t\t} else {\n\t\t\tint LMod = Math.floorMod(L, 2019);\n\t\t\tint RMod = Math.floorMod(R, 2019);\n\t\t\tif (LMod < RMod) {\n\t\t\t\tfor (int i = LMod; i < RMod; i++) {\n\t\t\t\t\tfor (int j = i + 1; j <= RMod; j++) {\n\t\t\t\t\t\tint surPlus = (i * j) % 2019;\n\t\t\t\t\t\tif (surPlus < min) {\n\t\t\t\t\t\t\tmin = surPlus;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.print(min);\n\t\t\t} else {\n\t\t\t\tSystem.out.print(0);\n\t\t\t}\n\t\t}\n\t}\n}\n", "l, r=map(int, input().split())\n\nif(r-l>3000):\n print(0)\n \nelse:\n ans=2019\n for i in range(l,r):\n for j in range(i+1,r+1):\n ans=min(ans, (i*j)%2019)\n print(ans)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nlong long a,b,c,d,e,f,i,j;\ncin >> a >> b;\nif(abs(a-b)>=2019)\n f=2019;\nelse\n f=abs(a-b);\nlong long l=2045;\nfor(i=a;i<=a+f;i++)\n{\n for(j=i+1;j<=a+f;j++)\n {\n l=min(l,(j*i)%2019);\n\n }\n}\ncout << l << endl;\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tlong long l, r, ans = 2018;\n\tcin >> l >> r;\n\tr = min(r, l + 2018);\n\tfor (long long i = l; i <= r; ++i) {\n\t\tfor (long long j = i + 1; j <= r; ++j) {\n\t\t\tans = min(ans, i * j % 2019);\n\t\t}\n\t}\n\tcout << ans << endl;\n}\n", "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n r = Math.min(r,(l+2019));\n long mod = 2019L;\n long ans = (long)Math.pow(10,9)+7;\n for(long i = l; i < r; i++){\n for(long j = i+1; j <= r; j++){\n //System.out.println(i + \" \"+ j + \" \" + ((i*j)%mod));\n long tmp = ((i%mod)*(j%mod))%mod;\n ans = Math.min(ans,tmp);\n }\n }\n System.out.println(ans);\n }\n}", "import java.util.*;\npublic class Main {\n public static void main(String [] args){\n Scanner sc = new Scanner(System.in);\n int L = sc.nextInt();\n int R = sc.nextInt();\n long opt=2019;\n if(L==0||R-L>=2019) opt=0;\n else{\n for(long i=L;i<R;i++){\n for(long j=i+1;j<=R;j++){\n long num = (i*j)%2019;\n if(opt>num) opt=num;\n }\n }\n }\n System.out.println(opt);\n }\n}\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tlong long a,b;\n\tcin>>a>>b;\n\tif(b-a>=2019)cout<<\"0\"<<'\\n';\n\telse{\n\t\tint ans=2018;\n\t\tfor(long long i=a+1;i<=b;i++){\n\t\t\tfor(long long j=a;j<i;j++){\n\t\t\t\tif((i*j)%2019<ans)ans=(i*j)%2019;\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<'\\n';\n\t}\n}", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int L=sc.nextInt();\n int R=sc.nextInt();\n\n //0 < L <= i < j <= R\n\n int mod,ii,jj;\n int ans = 2019;\n int cnt =0;\n\n for(int i=L;i<R;i++){\n ii = i % 2019;\n for(int j=i+1;j<=R;j++){\n jj = j % 2019;\n mod = (ii*jj) % 2019;\n if(mod<ans) ans=mod;\n if(ans==0){break;}\n }\n if(ans==0){break;}\n }\n System.out.println(ans);\n\n//kan nin gu\n\n }\n}\n", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tint p = 2019;\n\t\t\n\t\tboolean flag1 = false;\n\t\tif(r - l >= 2019)\n\t\t\tflag1 = true;\n\t\t\n\t\tint L = l % p;\n\t\tint R = r % p;\n\t\tif(R - L <= 0)\n\t\t\tflag1 = true;\n\t\t\n\t\tif(flag1)\n\t\t\tSystem.out.println(0);\n\t\telse {\n\t\t\tlong min = 2019;\n\t\t\tfor(int i = l ; i < r; i++) {\n\t\t\t\tfor(int j = i + 1; j <= r; j++) {\n\t\t\t\t\tlong lr =((long)i * j) % p;\n\t\t\t\t\tmin = Math.min(min, lr);\n\t\t\t\t}\t\t\n\t\t\t}\n\t\tSystem.out.println(min);\n\t\t\n\t\t}\n\t}\n\n}\n", "l,r = map(int,raw_input().split())\n\nif r-l >= 2019:\n\tbest = 0\nelse:\n\tlm = l%2019\n\trm = r%2019\n\tif r > l:\n\t\ta = range(lm,rm+1)\n\t\tbest = 2019\n\t\tfor i in xrange(len(a)-1):\n\t\t\tfor j in xrange(i+1,len(a)):\n\t\t\t\ttemp = (a[i]*a[j])%2019\n\t\t\t\tif temp < best:\n\t\t\t\t\tbest = temp\n\telse:\n\t\tbest = 0\nprint best", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n ll L, R;\n cin >> L >> R;\n R = min(R, L + 4038);\n ll res = 2018;\n for (ll i = L; i <= R; ++i) {\n for (ll j = i + 1; j <= R; ++j) {\n res = min(res, (i * j) % 2019);\n }\n }\n cout << res << endl;\n}", "#include<cstdio>\n#include<algorithm>\nusing namespace std;\n\nint l, r;\n\nint main() {\n\tscanf(\"%d%d\", &l, &r);\n\t\n\tif(r-l>=2019) puts(\"0\");\n\telse {\n\t\tint ans = 2018;\n\t\tfor(int i=l;i<=r;i++)\n\t\t\tfor(int j=i+1;j<=r;j++)\n\t\t\t\tans = min(ans, int(1LL*i*j%2019));\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\t\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tlong long l,r;\n\tcin>>l>>r;\n\tif((l-1)/2019!=r/2019)\n\t{\n\t\tcout<<0;\n\t\treturn 0;\n\t}\n\tint ans=2018*2018;\n\tfor(long long i=l;i<r;i++)\n\t{\n\t\tfor(long long k=i+1;k<=r;k++)\n\t\t{\n\t\t\tif((k*i)%2019<ans && k!=i)\n\t\t\t\tans=(k*i)%2019;\n\t\t}\n\t}\n\tcout<<ans;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tlong long int a,b,big=2020,minn=10000;\n\tcin>>a>>b;\n\tfor(long long int i=a;i<=b;i++){\n\t\tfor(long long int j=i+1;j<=b;j++){\n\t\t\tminn=min(minn,(i*j)%2019);\n\t\t\tif(minn==0){\n\t\t\t\tcout<<0;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<minn;\n}", "l,r = map(int,input().split())\nminer = 2020\nr = min(r,l+2020)\nfor i in range(l,r):\n for j in range(i+1,r+1):\n miner = min(miner,i*j%2019)\nprint(miner)", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int l,r,k=0,ans=2019;\n cin>>l>>r;\n if(r-l>=2019)cout<<0<<endl;\n else\n {\n \tfor(int i=l;i<r;i++)\n {\n for(int j=l+1;j<=r;j++)\n {\n ans=min(ans,((i%2019)*(j%2019))%2019);\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}", "#include<iostream>\nusing namespace std;\nint ans=2019;\nlong L,R;\nint main()\n{\n\tcin>>L>>R;\n\tfor(int i=L;i<=R&&i<=L+2019;i++)\n\t{\n\t\tfor(int j=i+1;j<=R&&j<=i+2019;j++)\n\t\t{\n\t\t\tlong I=i,J=j;\n\t\t\tif(I*J%2019<ans)ans=I*J%2019;\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}\n", "import java.util.*;\nimport java.io.*;\n\npublic class Main\n{\n\tpublic static void main(String [] Args)\n\t{\n\t\tScanner in=new Scanner(System.in);\n\t\tint l=in.nextInt();\n\t\tint r=in.nextInt();\n\t\tif(r-l>2019)\n\t\t{\n\t\t\tSystem.out.println(0);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint p=l%2019;\n\t\t\tr=r%2019;\n\t\t\tif(r<p)\n\t\t\t{\n\t\t\t\tr=r+2019;\n\t\t\t}\n\t\t\tint min=2019;\n\t\t\tfor(int i=p;i<=r;i++)\n\t\t\t{\n\t\t\t\tfor(int j=i+1;j<=r;j++)\n\t\t\t\t{\n\t\t\t\t\tint ans=(i*j)%2019;\n\t\t\t\t\tif(ans<min)\n\t\t\t\t\t{\n\t\t\t\t\t\tmin=ans;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t}\n}\n\t", "l, r = map(int, input().split())\na = 10**5\nfor i in range(l,r+1):\n\tfor j in range(i+1,r+1):\n\t\ta = min(a,i*j%2019)\n\t\tif a == 0:\n\t\t\tprint (0)\n\t\t\texit()\nprint (a)\n", "#include <bits/stdc++.h>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint main(){\n\tint l,r; cin>>l>>r;\n\n\tif(r-l>=2019) cout<<0<<endl;\n\telse{\n\t\tint ans=2019;\n\t\tfor(int i=l;i<=r;i++) for(int j=i+1;j<=r;j++) ans=min(ans,(int)((long long)i*j%2019));\n\t\tcout<<ans<<endl;\n\t}\n\n\treturn 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = Long.parseLong(sc.next());\n\t\tlong R = Long.parseLong(sc.next());\n\t\tsc.close();\n\t\tlong mod = 2018;\n\t\tlong cal = 0;\n\t\tfor(long i = L;i <= R;i++) {\n\t\t\tfor(long j = i+1;j <=R;j++) {\n\t\t\t\tcal = (i * j)%2019;\n\t\t\t\tif(cal < mod) {\n\t\t\t\t\tmod = cal;\n\t\t\t\t}else if(cal == 0) {\n\t\t\t\t\tSystem.out.println(0);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(mod);\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextInt();\n\t\tlong r = sc.nextInt();\n\t\tlong min = 2018;\n\t\tfor (long i = l; i < r; i++) {\n\n\t\t\tfor (long j = i + 1; j <= r; j++) {\n\t\t\t\tif (min == 0)\n\t\t\t\t\tbreak;\n\t\t\t\tif (i * j % 2019 < min)\n\t\t\t\t\tmin = i * j % 2019;\n\t\t\t\tif (min == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(min);\n\t}\n}\n", "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextInt();\n long r = sc.nextInt();\n long min = 10000;\n for(long L = l; L < l + 2019; L++){\n for(long R = L + 1; R <= r && R < L + 2020; R++){\n min = Math.min(((L % 2019) * (R % 2019)) % 2019, min);\n }\n }\n System.out.println(min);\n }\n}\n", "M=2019;l,r=map(int,input().split())\nprint(0 if r//M-l//M>0 else min(i*j%M for i in range(l,r) for j in range(i+1,r+1)))", "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l=sc.nextLong();\n\t\tlong r=sc.nextLong();\n\t\tlong min=Long.MAX_VALUE;\n\t\tif((l%2019)>(r%2019) || l==2019 || r-l+1>=2019 || l==0 ){\n\t\t\tSystem.out.println(0);\n\t\t}else{\n\t\t\tfor(long i=l; i<=r; i++){\n\t\t\t\tfor(long j=i+1; j<=r; j++){\n\t\t\t\t\tmin=Math.min(min,((i%2019)*(j%2019))%2019);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t\t\n\t\t\n\t}\n}\n\n\n", "#include<iostream>\nusing namespace std;\nlong L,R,ans=2020;\nint main()\n{\n\tcin>>L>>R;\n\tfor(long l=L;l<L+2020;l++)for(long r=R;r>R-2020;r--)\n\t{\n\t\tif(l<r)ans=min(ans,l%2019*r%2019);\n\t}\n\tcout<<ans<<endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int L,R;\n cin >> L>>R;\n int m=((L%2019)*(R%2019))%2019;\n \n for (int i=L;i<min(L+2019,R);i++){\n int l=i%2019;\n for (int j=i+1;j<min(i+2019,R+1);j++){\n int r=j%2019;\n m=min(m,(l*r)%2019);\n }\n }\n cout << m<<endl;\n \n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int def,l,r,t,ans=2019;cin>>l>>r;\n def=(r-l)%2020;l%=2019;r=l+def;\n \n for(int i=l;i<=r-1;i++){\n for(int j=i+1;j<=r;j++){\n ans=min(ans,(i*j)%2019);\n }\n }\n cout<<ans;\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t Scanner sc = new Scanner(System.in);\n\t long l = sc.nextLong();\n\t long r = sc.nextLong();\n \n if(r > l+4038)\n r = l+4038;\n \n long min = 2018;\n long num;\n int cnt = 0;\n for(long i = l; i < r; i++) {\n for(long j = l+1; j <= r; j++) {\n num = ((i*j)%2019);\n if(num < min) {\n min = num;\n if(num == 0) {\n break;\n }\n }\n }\n }\n System.out.println(min);\n\t}\n}", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew ABC133().c();\n\t}\n}\n\nclass ABC133{\n\t\tvoid c(){\n\t\t\t\tlong L, R;\n\t\t\t\tlong M = 2019L;\n\t\t\t\tScanner in = new Scanner(System.in);\n\t\t\t\tL = in.nextLong();\n\t\t\t\tR = in.nextLong();\n\t\t\t\tint ans = 2018;\n\t\t\t\tlong maxI = (long)Math.min(R, L+M);\n\t\t\t\tfor(long i=L; i<=maxI; ++i){\n\t\t\t\t\t\tlong maxJ = (long)Math.min(R, i+1L+M);\n\t\t\t\t\t\tfor(long j=i+1; j<=maxJ; ++j){\n\t\t\t\t\t\t\t\tans = (int)Math.min(ans, i*j%M);\n\t\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println(ans);\n\t\t\t\tin.close();\n\t\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nunsigned long long L, R, i, j, ans=2019; cin >> L >> R;\nif(R-L+1>673){ cout << 0 << \"\\n\"; return 0; }\nfor(i=L; i<R; i++){ for(j=i+1; j<=R; j++){ ans=min(ans, (i*j)%2019); } }\ncout << ans << \"\\n\"; return 0;\n}", "L, R = map(int, input().split())\nif R-L+1 >= 2019:\n print(0)\nelse:\n print(min(((L+i)*(L+i+j+1))% 2019 for i in range(R-L+1) for j in range(R-L+1-i-1) ))\n", "\nimport java.util.Scanner;\n \npublic class Main {\n \n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n long L = scan.nextLong();\n long R = scan.nextLong();\n \n long result = 2018;\n\n for (long i = L; i < R; i++){\n for (long j = i + 1; j <= R; j++){\n long mod = (i * j) % 2019;\n if(result > mod) result = mod;\n if(result == 0) break;\n }\n if(result == 0) break;\n }\n\n System.out.println(result);\n }\n}", "L, R = map(int, input().split())\nR = min(R, L+4038)\nans = 2018\nfor i in range(L, R):\n for j in range(i+1, R+1):\n ans = min((i*j)%2019, ans)\nprint(ans)\n", "l,r = map(int, input().split())\nans = 2019\nif r-l >= 2018:\n print(0)\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n ans = min(ans, i*j%2019)\n print(ans)", "l, r=map(int, input().split())\nx, y=l//2019, r//2019\np=0\nif x==y:\n\tp=2019\n\tfor i in range(l, r):\n\t\tfor j in range(i+1, r+1):\n\t\t\tp=min(p, (((i%2019)*(j%2019))%2019))\nprint(p)", "import java.util.*;\n\n\n class Main\n { \n\tpublic static void main(String args[])\n \t{ \n\n\t\tScanner sc =new Scanner(System.in);\n\t\tlong l = sc.nextInt();\n\t\tlong r = sc.nextInt();\n\t\t\n\t\tlong res = Integer.MAX_VALUE;\n\t\t\n\t\tloop: for(long i = l; i <= r; i++){\n\t\t\tfor(long j = i+1; j <= r; j++){\n\t\t\t\tres = Math.min(res, i*j%2019);\n\t\t\t\t\n\t\t\t\tif(res == 0) break loop;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(res);\n\n \t}\n }", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\nlong l, r;\n\t\tl = s.nextInt();\n\t\tr = s.nextInt();\n\t\tlong ans = 2019;\n\t\tfor (long i = l; i <= r; i++) {\n\t\t\tfor (long j = i+1; j <= r; j++) {\n\t\t\t\tans = Math.min(ans, (i * j) % 2019);\n if(ans==0)break;\n\t\t\t}\n if(ans==0)break;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nlong long L, R;\n\nint main(){\n\tlong long ans = 2018;\n\tcin >> L >> R;\n\tfor(long long i = L; i <= min(R, L+2019); ++i){\n\t\tfor(long long j = i+1; j <= min(R, L+2019); ++j){\n\t\t\tans = min(ans, (i%2019)*(j%2019)%2019);\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[]) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\n\t\tif(R-L >= 2019) {\n\t\t\tSystem.out.println(0);\n\t\t}else {\n\t\t\tlong ans = 2019;\n\t\t\tfor(long i=L;i<=R;i++) {\n\t\t\t\tfor(long j=i+1;j<=R;j++) {\n\t\t\t\t\tif(i*j % 2019 < ans) {\n\t\t\t\t\t\tans = i*j % 2019;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(ans == 0) {\n\t\t\t\t\t\tSystem.out.println(0);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n}\n", "import java.util.*;\nimport java.util.stream.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner in = new Scanner(System.in);\n int L = in.nextInt(), R = in.nextInt();\n int ans = Integer.MAX_VALUE;\n for (int i = L; i < Math.min(L + 2019, R); i++) {\n for (int j = i + 1; j <= Math.min(L + 2019, R); j++) {\n ans = Math.min(ans, (int) (((long) i * (long) j) % 2019));\n }\n }\n System.out.println(ans);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n static final int MOD = 2019;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n long L = sc.nextInt();\n long R = sc.nextInt();\n\n R = Math.min(R, L + 2019); //Rを狭めても結果は一緒　2019を2週すれば同じmodが2個以上取れるのでi<jの場合も対応可能\n long ans = 2018;\n\n for (long i = L; i <= R; i++) {\n for (long j = i + 1; j <= R; j++) {\n long x = i * j % 2019;\n ans = Math.min(ans, x);\n }\n }\n\n System.out.println(ans);\n\n }\n\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define M (2019)\nll l,r,ans=1e9;\n\nint main(){\n\tscanf(\"%lld%lld\",&l,&r);\n\tif (r-l>=2019){\n\t\tprintf(\"0\"); return 0;\n\t}\n\tfor (int i=l;i<r;i++)\n\t\tfor (int j=i+1;j<=r;j++)\n\t\t\tans=min(ans,1ll*i%M*j%M);\n\tprintf(\"%lld\",ans);\n}\n", "import sys\n\nL,R=map(int,input().split())\nM=2019\n\nR=min(R,L+2*M-1)\n\nX=M+1\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n X=min(X,(i*j)%M)\nprint(X)\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nlong long L,R,Ans;\n\nint main()\n{\n\tcin>>L>>R;\n\tAns=0;\n\tif(R-L<2019)\n\t{\n\t\tAns=2019;\n\t\tfor(long long i=L;i<=R;i++) \n\t\t\tfor(long long j=i+1;j<=R;j++) \n\t\t\t\tAns=min(Ans,((i%2019ll)*(j%2019ll))%2019ll);\n\t}\n\tcout<<Ans<<endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextLong();\n\t\tlong d = sc.nextLong();\n\n\t\t// 0\n\t\t// d*(d-1)\n\t\t// n*(n+1)\n\t\t// 51(d-n)\n\t\tlong ans=3000;\n\n\t\tif (d-n>2022) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\nfor(long i=n;i<=d-1;i++){\n\tfor(long k=i+1;k<=d;k++){\n\n\t\tif(ans>((i%2019)*(k%2019))%2019){\n\t\t\tans=((i%2019)*(k%2019))%2019;\n\n\t\t}\n\t}\n}\n\nSystem.out.println(ans);\n\t\t}\n\t}\n}", "L,R = map(int,(input().split()))\nmod = 2019\nMin = 2018\nfor i in range(L,min(L+mod,R)):\n for j in range(i+1,min(L+mod,R+1)):\n Min = min(i*j%2019,Min)\nprint(Min)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint l,r,ans=2019;\n\tcin>>l>>r;\n\n\tif(r-l>=2019){\n\t\tcout<<0;\n\t}else{\n\t\tfor(int i=l;i<=r-1;i++){\n\t\t\t\n\t\t\tfor(int j=l+1;j<=r;j++){\n\t\t\t\tans=min(ans,(i%2019)*(j%2019)%2019);\n\t\t\t}\n\t\t}\n\t\tcout <<ans<<endl;\n\t}\n\t\n\t\n\treturn 0;\n}\n\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n if(r - l >= 2019){\n System.out.println(0);\n return;\n }\n long ans = Long.MAX_VALUE;\n for(long i = l; i < r; i++){\n for(long j = i + 1; j <= r; j++){\n ans = Math.min(ans,(i * j) % 2019);\n }\n }\n System.out.println(ans);\n }\n}", "import java.util.*;\n\npublic class Main {\n\tstatic final int MOD = 2019;\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tif (b - a > MOD) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tint min = Integer.MAX_VALUE;\n\t\tfor (int i = a; i < b; i++) {\n\t\t\tfor (int j = i + 1; j <= b; j++) {\n\t\t\t\tmin = Math.min(min, ((i % MOD) * (j % MOD) % MOD));\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}\n", "\nimport java.util.Scanner;\npublic class Main {\n\tstatic int mod = 1000000007;\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextInt();\n\t\tlong m = sc.nextInt();\n\t\tlong ans = Integer.MAX_VALUE;\n\t\tloop:for(long i = n; i <= m; i++) {\n\t\t\tfor(long j = i+1; j <= m; j++) {\n\t\t\t\tans = Math.min(ans, (i*j)%2019);\n\t\t\t\tif(ans == 0) {\n\t\t\t\t\tbreak loop;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long l, r; cin >> l >> r;\n long long ans=2018;\n for(long long i=l; i<min(r, l+2019); i++){\n for(long long j=i+1; j<min(r+1, i+2020); j++){\n ans=min(ans, (i*j)%2019);\n }\n }\n cout << ans << endl;\n}\n", "L,R=map(int,input().split())\nA=[]\nR=min(R,L+2019)\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n A.append((i*j)%2019)\nprint(min(A))", "import sys\nl,r=map(int,input().split())\nif l+2019<=r:\n print(0)\n sys.exit()\nmn=2018*2018\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n mn=min(mn,i*j%2019)\nprint(mn)", "l,r=map(int,input().split())\na=2019\nif r-l>=2019:\n print(0)\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n a=min((i*j)%2019,a)\n print(a)", "l,r = map(int,input().split())\nr = min(r, l+673)\nans = 2018\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n x = (i*j)%2019\n ans = min(ans,x)\nprint(ans)", "l,r=map(int,input().split())\n\nans=10000\nfor i in range(l,l+min(r-l,2020)):\n for j in range(i+1,l+min(r-l,2020)+1):\n ans=min(ans,(i*j)%2019)\n\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int l,r;\n cin>>l>>r;\n if(r-l>2017)cout<<\"0\"<<endl;\n else{\n int m=2018;\n for(int i=l;i<r;i++){\n for(int j=i+1;j<=r;j++)m=min(m,(i%2019)*(j%2019)%2019);\n }\n cout<<m<<endl;\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint l,r,ans=1e9;\nint main()\n{\n\tcin>>l>>r;\n\tif(r-l>=2019)cout<<0;\n\telse\n\t{\n\t\tl%=2019,r%=2019;\n\t\tif(r<l)r+=2019;\n\t\tfor(int i=l;i<=r;i++)\n\t\t\tfor(int j=i+1;j<=r;j++)\n\t\t\t\tans=min(ans,(i*j)%2019);\n\t\tcout<<ans;\n\t}\n}", "L,R=map(int,input().split())\nans =[]\nif R-L>=2019:\n print(0)\n exit()\n\nfor i in range(L,R):\n for j in range(i+1,R+1):\n ans.append((i*j)%2019)\n\nprint(min(ans))", "L, R = map(int, open(0).read().split())\n\nans = 2020\nm = min(L + 2020, R) + 1\nfor i in range(L, m):\n for j in range(i + 1, m):\n \tans = min(ans, i * j % 2019)\n\nprint(ans)\n", "l,r = map(int,input().split())\nif r-l >= 2019:\n\tans = 0\nelse:\n\tans = 2020\n\tfor i in range(l, r+1):\n\t\tfor j in range(i+1, r+1):\n\t\t\tans = min(ans, (i*j)%2019)\nprint(ans)", "L,R = map(int, raw_input().split())\n\nif 2019 <= R - L:\n print(0)\nelse:\n l_mod = L % 2019\n r_mod = R % 2019\n if r_mod < l_mod:\n print(0)\n else:\n min = 2018\n for i in range(l_mod, r_mod):\n for j in range(i + 1, r_mod + 1):\n x = i * j % 2019\n if x < min:\n min = x\n print(min)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\n\t\tlong min = 9999;\n\n\t\tfor (long i = l; i < r; i++) {\n\t\t\tfor (long j = i + 1; j <= r; j++) {\n\t\t\t\tlong num = (i * j) % 2019;\n\t\t\t\tif (min > num) {\n\t\t\t\t\tmin = num;\n\t\t\t\t\tif (min == 0) {\n\t\t\t\t\t\tSystem.out.println(min);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(min);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\t\n long long int l,r,ans=2020;\n\t\n\tcin >> l >> r;\n\t\n\t\n\tfor(long long int i=l;i<min(r,l+2020);i++)\n\t{\n\t\tfor(long long int j=i+1;j<=min(r,l+2020);j++)\n\t\t{\n\t\t if((i*j)%2019<ans) ans = (i*j)%2019;\n\t\t}\n\t}\n\t\n\tcout << ans;\n\n\treturn 0;\n}", "L,R=map(int,input().split())\nif R-L>=2019:\n ans=0\nelse:\n ans=2020\n for i in range(L,R+1):\n for j in range(i+1,R+1):\n ans=min(ans,(i*j)%2019)\nprint(ans)", "l,r = map(int,input().split())\nr = min(r, l+673)\nans = 2018\nfor i in range(l,r):\n for j in range(l+1,r+1):\n if ans > i*j%2019:\n ans = i*j%2019\nprint(ans)", "l,r = map(int,input().split())\nif r-l>=2019 :\n print(0)\nelse :\n x=[i*j%2019 for i in range(l, r) for j in range(i+1, r+1)]\n print(min(x))", "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[])\n\t{\n\t\tScanner scan=new Scanner(System.in);\n\t\tlong l=scan.nextLong();\n\t\tlong r=scan.nextLong();\n\t\tlong ans=Long.MAX_VALUE;\n\t\tfor(long i=l;i<=(Math.min(r, l+2018));i++)\n\t\t{\n\t\t\tfor(long j=i+1;j<=Math.min(r,l+2018);j++)\n\t\t\t{\n\t\t\t\tans=Math.min(ans,((i%2019)*(j%2019))%2019);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\t\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint l,r,ans=2019;\nint main() {\n\tscanf(\"%d%d\",&l,&r);\n\tif(r-l>2020)ans=0;\n\telse {\n\t\tfor(int i=l; i<=r; i++) {\n\t\t\tfor(int j=i+1; j<=r; j++) {\n\t\t\t\tans=min(ans,(i%2019)*(j%2019)%2019);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\",ans);\n}", "L, R = map(int, input().split())\n\nans = 10**10\nfor i in range(L, min(L+2019, R+1)):\n for j in range(i+1, min(L+2019, R+1)):\n ans = min(ans, i*j%2019)\n\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int64_t l, r;\n cin >> l >> r;\n r = min(r, l+2019);\n int ans = 2018;\n for(int64_t i=l; i<r; i++){\n for(int64_t j=i+1; j<=r; j++){\n int x = (int64_t)i*j%2019;\n ans = min(ans, x);\n }\n }\n cout << ans << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n\tlong long a,b;\n\tcin>>a>>b;\n\tif(fabs(a-b)>2018){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tll mi=10000;\n\tfor(ll i=a;i<=b;i++){\n\t\tfor(ll j=i+1;j<=b;j++){\n\t\t\tif(i*j%2019<mi){\n\t\t\t\tmi=i*j%2019;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<mi<<endl;\n\treturn 0;\n}", "from itertools import combinations as f\nl,r=map(int,input().split())\nprint(min([i*j%2019 for i,j in f(range(l,r+1)[:2019],2)]))", "m=2018\nL,R=map(int,input().split())\nfor i in range(L,min(R+1,L+2019)):\n for j in range(i+1,min(R+1,L+2019)):\n m=min(m,i*j%2019)\nprint(m)", "l,r=map(int,input().split())\nif r-l>2018:\n print(\"0\")\n exit()\nans=2018\nfor i in range(l,r):\n for j in range(i+1,r+1):\n ans=min(ans,(j*i)%2019)\nprint(ans)\n", "L, R = map(int, raw_input().split())\n\nR = min(R, L+2019)\nans = 99999999\nfor i in range(L, R+1):\n for j in range(i+1, R+1):\n ans = min(ans, i*j%2019)\nprint ans\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n ll a,b,ans=2020;\n cin >> a >> b;\n for(ll i = a; i <= min(a+2019,b); i++ ){\n for(ll j = i+1; j <= min(i+2020,b); j++){\n ans = min(ans,(i*j)%2019);\n }\n }\n cout << ans << endl;\n}\n", "L, R = map(int,input().split())\na = 10**10\nfor i in range(L,min(R,L+2019)+1):\n for j in range(i+1,min(R,L+2019)+1):\n a = min(a,(i*j)%2019)\nprint(a)", "l,r = map(int, input().split())\nans = 2019\nfor i in range(l, min(r, l+2018)):\n for j in range(i+1, min(r+1, l+2019)):\n ans = min(ans, (i*j) % 2019)\nprint(ans) ", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long a,b,t, res=2020;\n\n cin>>a>>b;\n b=min(b,a+2019);\n for(long i=a; i<=b; i++){\n for(long j=i+1;j<=b; j++){\n t=(i*j)%2019;\n res= min(t, res);\n }\n }\n cout<<res;\n\n\nreturn 0;\n}\n", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n long long L,R;\n long long ans = 2019;\n cin >> L >> R;\n\n for(long long i=L; i<=L+2019; i++){\n for(long long j=i+1; j<=i+2019 && j<=R; j++){\n ans = min(ans, (i * j) % 2019);\n }\n }\n\n cout << ans << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nsigned main(){\n int L,R;cin>>L>>R;\n if(R-L>3000){\n cout<<0<<endl;\n return 0;\n }\n int ans=3000;\n for(int i=L;i<=R;i++){\n for(int j=i+1;j<=R;j++){\n ans=min(ans,i*j%2019);\n }\n }\n cout<<ans<<endl;\n}\n", "l,r=map(int,input().split());s=range(l,r+1)[:673];print(min(i*j%2019for i in s for j in s if i<j))", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tlong long l,r;\n\tcin >> l >> r;\n\tif(r-l>10*2019)\n\t{\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tlong long ans=(1<<30);\n\tfor(long long i=l;i<=r;i++)\n\t\tfor(long long j=i+1;j<=r;j++)\n\t\t\tans=min(ans,(i*j)%2019);\n\tcout << ans << endl;\n}", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int l=sc.nextInt();\n int r=sc.nextInt();\n int tmp=10000;\n if(r-l>=2019){\n System.out.println(0);\n return;\n }else{\n l=l%2019;\n r=r%2019;\n for(int i=l;i<=r-1;i++){\n for(int j=l+1;j<=r;j++){\n if(tmp>(i*j)%2019){\n tmp=(i*j)%2019;\n }\n }\n }\n System.out.println(tmp);\n \n \n }\n \n }\n \n\n \n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint L,R;cin>>L>>R;\n\tif(L%2019==0 or R%2019==0 or L/2019!=R/2019){puts(\"0\");return 0;}\n\tint ans=2019;\n\tfor(int i=L;i<=R;i++)\n\t\tfor(int j=i+1;j<=R;j++)\n\t\t\tans=min(1ll*ans,1ll*i*j%2019);\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong a = sc.nextInt();\n\t\tlong b = sc.nextInt();\n\t\tlong min = a * (a + 1) % 2019;\n\t\tc:for(long i = a; i <= b; i++){\n\t\t\tfor(long j = i + 1; j <= b; j++){\n\t\t\t\tif(i * j % 2019 < min){\n\t\t\t\t\tmin = i * j % 2019;\n\t\t\t\t}\n\t\t\t\tif(min == 0){\n\t\t\t\t\tbreak c;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\n\t}\n\n}\n", "l,r=map(int,input().split( ))\np=2019\nif r-l>=p:\n\tprint(0)\nelse:\n\ttmp=p\n\tfor i in range(l,r+1):\n\t\tfor j in range(i+1,r+1):\n\t\t\ttmp=min(tmp,(i*j)%p)\n\tprint(tmp)\n", "L, R = map(int, input().split())\n\nif R-L>=2019:\n\tprint(0)\nelse:\n\tans = 2018\n\tfor i in range(L, R):\n\t\tfor j in range(i+1, R+1):\n\t\t\tans = min(ans, i*j%2019)\n\tprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tif (r - l >= 2019) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tlong min = Integer.MAX_VALUE;\n\t\t\tlong a;\n\t\t\tfor (int i = l; i < r; i++) {\n\t\t\t\tfor (int j = l + 1; j <= r; j++) {\n\t\t\t\t\ta = ((long) i * j) % 2019;\n\t\t\t\t\tmin = Math.min(min, a);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t}\n}\n", "l,r=map(int,input().split())\nm=2018*2019\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n m=min(m,(i*j)%2019)\n if m==0:\n print(m)\n exit()\nprint(m)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long L = sc.nextInt();\n long R = sc.nextInt();\n int result = 2019;\n int tmp = 0;\n loop: for (; L < R; L++) {\n if (L % 2019 == 0) {\n result = 0;\n break;\n }\n for (long i = L + 1; i <= R; i++) {\n if (i % 2019 == 0) {\n result = 0;\n break loop;\n }\n tmp = (int) ((L * i) % 2019);\n if (tmp < result)\n result = tmp;\n }\n }\n System.out.println(result);\n }\n}", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nint main(){\n ll mod = 2019;\n ll L, R; cin >> L >> R;\n R = min(L + mod, R);\n ll ans = 2019;\n for(ll i=L; i<=R; i++) for(ll j=i+1; j<=R; j++){\n ans = min(ans, (i*j)%mod);\n }\n cout << ans << endl;\n}\n", "import java.util.Scanner;\n \npublic class Main {\n static Scanner stdIn = new Scanner(System.in);\n public static void main(String[] args){\n int l = stdIn.nextInt();\n int r = stdIn.nextInt();\n \n int min = Integer.MAX_VALUE;\n for(int i=l; (i<=r-1 && i<l+2019); i++){\n for(int j=i+1; (j<=r && j<i+2020); j++){\n if(((long)i*j) % 2019 < min){\n min = (int)(((long)i*j) % 2019);\n }\n }\n }\n \n System.out.println(min);\n }\n}", "L,R = map(int, input().split())\nP = min(R, L+2018)\nc = []\nfor i in range(L,P+1):\n for j in range(L,P+1):\n if i != j:\n c.append((i * j) % 2019)\nprint(min(c))", "l,r=map(int,input().split())\nif r-l>=2019:\n print(0)\nelse:\n a=2019\n for i in range(l,r):\n for j in range(i+1,r+1):\n a=min((i%2019)*(j%2019)%2019,a)\n print(a)", "L, R = map(int, input().split())\n \nif 2019 <= R - L:\n print(0)\nelse:\n a=min([(i*j)%2019 for i in range(L,R+1) for j in range(i+1,R+1)])\n print(a)\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong min = sc.nextLong();\n\t\tlong max = sc.nextLong();\n\t\tif(min / 2019 != max / 2019) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong ans = 2200;\n\t\tfor(long i = min; i <= max; i ++) {\n\t\t\tfor(long j = i + 1; j <= max; j ++) {\n\t\t\t\tans = Math.min(ans , (i * j) % 2019);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "#!/usr/bin/env python\n\nfrom collections import deque\nimport itertools as ite\nimport sys\nimport math\n\nsys.setrecursionlimit(1000000)\n\nINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\nL, R = map(int, raw_input().split())\nif R / 2019 != L / 2019 or L % 2019 == 0:\n print 0\n exit()\nans = 2019\nfor i in range(L, R + 1):\n for j in range(i + 1, R + 1):\n ans = min(ans, i * j % 2019)\nprint ans", "#include<bits/stdc++.h>\n#define ll long long\nusing namespace std;\nint main()\n{\n ll l,r;\n cin>>l>>r;\n //ll num=r-l+1;\n \tr=min(r,l+2019);\n ll mi=2018*2017;\n for(ll i=l;i<=r;i++)\n {\n for(ll j=i+1;j<=r;j++)\n {\n mi=min(mi,(i*j)%2019);\n }\n }\n cout<<mi<<endl;\n}\n", "#include<cstdio>\nint main()\n{\n\tlong long int a,b,i,ss=10000,s,j;\n\tscanf(\"%lld%lld\",&a,&b);\n\t if(b/2019>a/2019)\n\tprintf(\"0\\n\");\n\telse\n\t{\n\tfor(i=a;i<b;i++)\n\tfor(j=i+1;j<=b;j++)\n\t{\n\t\ts=(i*j)%2019;\n\t\tif(s<ss)\n\t\tss=s;\n\t}\n\tprintf(\"%lld\",ss);\n}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main() {\n int L,R; cin>>L>>R;\n if(R-L>3000){\n cout<<0<<endl;\n return 0;\n }\n int best=3000;\n for(int i=L; i<=R; i++){\n for(int j=i+1; j<=R; j++){\n best=min(best,(i*j)%2019);\n }\n }\n cout<<best<<endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint L = sc.nextInt();\n\t\tint R = sc.nextInt();\n\t\tint mod = 0;\n\t\tint minMod = Integer.MAX_VALUE;\n\n\t\tfor (int i = L; i < R; i++) {\n\t\t\tfor (int j = i + 1; j <= R; j++) {\n\t\t\t\tmod = (i % 2019) * (j % 2019) % 2019;\n\t\t\t\tminMod = Math.min(minMod, mod);\n\t\t\t\tif ((j - i) % 2019 == 0) break;\n\t\t\t}\n\t\t\tif (i % 2019 == 0) break;\n\t\t}\n\n\t\tSystem.out.println(minMod);\n\t}\n}\n", "#include <iostream>\n#include <cstdio>\nusing namespace std;\n\nlong long a, b, mn = 1e9;\nint main() {\n\tlong long i, j;\n\tcin>>a>>b;\n\tif(a/2019 == b/2019) {\n\t\tfor(i=a; i<=b; i++) for(j=i+1; j<=b; j++) mn = min(mn, i * j % 2019);\n\t} else mn = 0;\n\tcout<<mn;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define INF 1LL<<62\n#define inf 1000000007 \n\n\nint main() {\n\tll l,r,ans=INF;\n\tcin>>l>>r;\n\tr=min(r,l+2019);\n\tfor(ll i=l;i<r;i++){\n\t\tll sum=0;\n\t\tfor(ll j=i+1;j<=r;j++){\n\t\t\tsum=(i*j)%2019;\n\t\t\tans=min(ans,sum);\n\t\t}\n\t}\n\tcout <<ans;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L, R, ans;\n\t\tL = sc.nextLong();\n\t\tR = sc.nextLong();\n\t\tsc.close();\n\t\tR = Math.min(R, L + 4038);\n\t\tans = 2100;\n\t\tfor (long i = L; i < R; i++) {\n\t\t\tfor (long j = i + 1; j <= R; j++) {\n\t\t\t\tlong a = (i * j) % 2019;\n\t\t\t\tif (ans > a) {\n\t\t\t\t\tans = a;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong(), R = sc.nextLong();\n\t\tif(R - L > 2019) System.out.println(0);\n\t\telse {\n\t\t\tlong ans = Long.MAX_VALUE;\n\t\t\tfor(long i = L; i <= R; i++) {\n\t\t\t\tfor(long j = i + 1; j <= R; j++) {\n\t\t\t\t\tans = Math.min(ans, (i * j) % (long)2019);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "l,r=map(int,input().split())\na=[]\nif r-l>=2018:\n print(0)\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n a.append(i*j%2019)\n print(min(a))", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString str[] = br.readLine().split(\" \");\n\n\t\tlong l = Long.parseLong(str[0]);\n\t\tlong r = Long.parseLong(str[1]);\n\n\t\tif (r - l >= 2019) {\n\t\t\tSystem.out.println(\"0\");\n\t\t} else {\n\t\t\tlong ans = 2018;\n\t\t\tfor (long i = l; i < r; i++) {\n\t\t\t\tfor (long j = i + 1; j <= r; j++) {\n\t\t\t\t\tans = Math.min(ans, (i * j) % 2019);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.run();\n\t}\n\n\tlong mod = 2019;\n\tpublic void run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextLong();\n\t\tlong r = sc.nextLong();\n\n\t\tlong ans = 1001001001;\n\t\tfor(long i=l+1; i<=Math.min(r, l+mod); i++) {\n\t\t\tfor(long j=l; j<i; j++) {\n\t\t\t\tlong tmp = i*j;\n\t\t\t\ttmp %= mod;\n\t\t\t\tans = Math.min(ans, tmp);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n}\n", "#include<bits/stdc++.h>\n#define ll long long\n#define mod 1000000007\nusing namespace std;\nint main()\n{\nll l,r;\ncin>>l>>r;\nif(r-l>=2019)\n{\ncout<<0<<endl;\n}\nelse\n{\nll ans=2020;\nfor(ll i=l;i<=r;i++)\n{\nfor(ll o=i+1;o<=r;o++)\n{\nans=min(ans,((i%2019)*(o%2019))%2019);\n}\n}\ncout<<ans<<endl;\n}\n}", "import java.util.*;\nimport java.lang.*;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tif (r - l >= 2019) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tint min = 2019;\n\t\t\tfor (int i = l % 2019; i <= l % 2019 + (r - l); i++) {\n\t\t\t\tfor (int j = i + 1; j <= l % 2019 + (r - l); j++) {\n\t\t\t\t\tmin = Math.min(min, i * j % 2019);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(min);\n\t\t}\n\t}\n}", "import java.util.Scanner;\n \npublic class Main {\n\tpublic static void main(String[] args) {\n \n\t\tlong a,b;\n \n\t\tScanner sc = new Scanner(System.in);\n \n\t\ta = sc.nextLong();\n\t\tb = sc.nextLong();\n \n\t\tlong ans = 2018;\n \n\t\tif (b - a >= 2018) {\n\t\t\tans = 0;\n\t\t} else {\n \n\t\t\tfor (long i = a; i < b; ++i) {\n\t\t\t\tfor (long j = i+1; j <= b; ++j) {\n\t\t\t\t\tans = Math.min(ans, (i * j) % 2019);\n\t\t\t\t}\n \n\t\t\t}\n \n\t\t}\n \n\t\t\tSystem.out.println(ans);\n \n\t}\n \n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\ntypedef long long ll;\nint main(){\n ll L,R;\n cin>>L>>R;\n if(R-L>=2019) cout<<0;\n else{\n ll m=2018;\n for(ll i=L;i<=R;i++)for(ll j=i+1;j<=R;j++) m=min(m,i*j%2019);\n cout<<m;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll l,r,res=2018;\n cin>>l>>r;\n if(r-l>=2019) r=l+2018;\n for(ll i=l; i<=r-1; i++){\n for(ll j=i+1; j<=r; j++){\n ll p=(i*j)%2019;\n res=min(p,res);\n }\n }\n cout<<res;\n}\n", "l, r = map(int, raw_input().split(\" \"))\n\nans = -1\nif r - l >= 2019 or (l % 2019) - (r % 2019) > 0:\n ans = 0\nelse:\n for i in range(l, r):\n for j in range(i + 1, r + 1):\n tmp = (i * j) % 2019\n if ans < 0 or ans > tmp:\n ans = tmp\n\nprint(ans)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int l,r,ans=2019;\n cin>>l>>r;\n for(long long i=l;i<=r;i++){\n for(long long j=i+1;j<=r;j++){\n int a=i*j%2019;\n ans=min(a,ans);\n if (ans==0) break;\n }\n if(ans==0)break;\n }\n cout<<ans<<endl;\n}\n", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint l = in.nextInt();\n\t\tint r = in.nextInt();\n\t\t\n int mod = 2019;\n\t\t// 2019の倍数が必ずある場合\n\t\tif(r-l >= mod) {\n\t\t\tSystem.out.println(0);\n\t\t\tin.close();\n\t\t\treturn;\n\t\t}\n\n\t\tlong min = Long.MAX_VALUE;\n\t\tlong remain = 0;\n\t\tfor ( long i = l; i < r; i++ ) {\n\t\t\tfor ( long j = i + 1; j <= r; j++ ) {\n\t\t\t\tremain = i * j % mod;\n\t\t\t\tmin = remain < min ? remain : min;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t\tin.close();\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n\n if (r - l >= 2019) {\n System.out.print(0);\n return;\n }\n\n long min = 2019;\n for (long i = l; i <= r - 1; i++) {\n for (long j = i+1; j <= r; j++) {\n long mod = (i * j) % 2019;\n if (min > mod) {\n min = mod;\n }\n }\n }\n System.out.print(min);\n }\n}", "#include <iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n\tlong long int l,r,i,j,range,start,ans=2019;\n\tcin>>l>>r;\n\tif (r-l+1>=2019) \n\t{\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tfor (i=l;i<r;i++)\n\t{\n\t\tfor (j=i+1;j<=r;j++)\n\t\t{\n\t\t\tans=min(ans,(i*j)%2019);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "#abc133c\n\nl,r=map(int,raw_input().split())\nr=min(r,l+673)\nres=2018\nfor i in xrange(l,r+1):\n for j in xrange(i+1,r+1):\n res=min(res,i*j%2019)\nprint res\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scn=new Scanner(System.in);\n\t\tint l=scn.nextInt();\n\t\tint r=scn.nextInt();\n\t\tif((2019<l||r<2019)&&r-l<2019) {\n\t\t\tl=l%2019;\n\t\t\tr=r%2019;\n\t\t\tif(l<r)\n\t\t\tfunc(l,r);\n\t\t\telse {\n\t\t\t\tSystem.out.println(0);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(0);\n\t\t}\n\t}\n\t\n\tpublic static void func(int l, int r) {\n\t\t\n\t\tint min=Integer.MAX_VALUE;\n\t\tfor(int i=l;i<r;i++) {\n\t\t\tfor(int j=i+1;j<=r;j++) {\n\t\t\t\tint x=(i*j)%2019;\n\t\t\t\tif(x<min) {\n\t\t\t\t\tmin=x;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\n\t}\n\n}\n", "l, r = map(int, input().split())\n\nif 673 < r - l:\n ans = 0\nelse:\n ans = min([i * j % 2019 for i in range(l, r) for j in range(i + 1, r + 1)])\nprint(ans)", "import java.util.*;\npublic class Main {\n\n public static void main (String[] args) {\n\n Scanner sc = new Scanner(System.in);\n long L = sc.nextInt();\n long R = sc.nextInt();\n sc.close();\n\n long min = 2019;\n\n for(int i = 0; i < 2019; i++){\n for(int j = i + 1; j < 2019; j++){\n long a = L + i;\n long b = L + j;\n if (a <= R && b <= R){\n long m = (a*b)%2019;\n if (m < min){\n min = m;\n }\n }\n }\n }\n\n System.out.println(min);\n\n }\n \n}", "l, r = map(int, raw_input().split())\n\nr = min(r, l + 2019)\nprint min(i * j % 2019 for i in xrange(l, r + 1) for j in xrange(l, i))\n\n", "l,r=map(int,input().split())\na=range(l,r+1)[:673]\nprint(min(i*j % 2019 for i in a for j in a if i<j))", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString[] line = sc.nextLine().split(\" \");\n\n\t\tint L = Integer.parseInt(line[0]);\n\t\tint R = Integer.parseInt(line[1]);\n\n\t\tlong minVal = Integer.MAX_VALUE;\n\t\tfor (long i = L; i <= R; i++) {\n\t\t\tfor (long j = i + 1; j <= R; j++) {\n\t\t\t\tminVal = Math.min(minVal, (i * j) % 2019);\n\t\t\t\tif (minVal == 0) {\n\t\t\t\t\tSystem.out.println(minVal);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(minVal);\n\t}\n}", "L,R = map(int,input().split())\nif R-L>=2018:\n print(0)\nelse:\n print(min(min((l*r)%2019 for r in range(l+1,R+1)) for l in range(L,R)))", "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n long l,r;\n long m=2018;\n cin>>l>>r;\n r=min(r,l+2019);\n for(long i=l;i<r;i++){\n for(long j=i+1;j<=r;j++){\n \t long x= (i*j)%2019;\n m=min(x,m);\n \t}\n }\n cout<<m<<endl;\n return 0;\n}", "l,r=list(map(int,input().split()))\nm=2018\nfor i in range(l,min(r+1,l+2019)):\n for j in range(i+1,min(r+1,l+2019)):\n m=min(m,i*j%2019)\nprint(m)", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\tint l, r;\n\tcin >> l >> r;\n\tlong long ans = (1LL*l*r)%2019;\n\tfor (int i = l; i < min(r, l+5000); i++) {\n\t\tfor (int j = i+1; j <= min(r, l+5000); j++) ans = min(ans, (1LL*i*j)%2019);\n\t}\n\tcout << ans << endl;\n}\n", "L,R=map(int,input().split())\nR=min(R,L+4038)\nans=2020\nfor i in range(L,R+1):\n for j in range(L,R+1):\n if i!=j: ans=min(ans,(i*j)%2019)\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n long long l,r;\n cin>>l>>r;\n r=min(r,l+4038);\n int ans=2018;\n for(long long i=l;i<=r;i++){\n for(long long j=i+1;j<=r;j++){\n int res=(i*j)%2019;\n ans=min(ans,res);\n }\n }\n cout<<ans<<endl;\n return 0;\n}\n", "#include <iostream>\nusing namespace std;\nint main(){\n long long L,R,ans;\n cin >> L >> R;\n if(R-L>2019-1)ans=0;\n else{\n ans=2019;\n for(long long i=L;i<R;i++){\n for(long long k=i+1;k<=R;k++){\n if((i*k)%2019<ans)ans=(i*k)%2019;\n }\n }\n }\n cout << ans << flush;\n return 0;\n}", "l, r = list(map(int, input().split()))\nif r-l >=2019:\n\tprint(0)\nelse:\n\tx= [i*j%2019 for i in range(l,r) for j in range (i+1,r+1)]\n\tx.sort()\n\tprint(x[0])", "import math\nL, R = map(int, input().split())\nm = 2018\nfor i in range(L, min(L+2018, R)+1):\n for j in range(i+1, min(i+2019, R)+1):\n m = min(m, i*j%2019)\nprint(m)\n", "#include<iostream>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint l,r,ans=999999999;\tcin>>l>>r;\n\tfor(int i=l;i<=r&&i<=l+2500;i++)\n\t\tfor(int j=i+1;j<=r&&j<=l+2500;j++)\n\t\t\tans=min(ans , ( (i%2019) * (j%2019)%2019 ) );\n\tcout<<ans<<endl;\n}", "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Main{\npublic static void main (String[] args){\n\tScanner sc = new Scanner(System.in);\n\tlong l = Integer.parseInt(sc.next());\n\tlong r = Integer.parseInt(sc.next());\n\tlong min = 2019;\n\tif((r - l) >= 673){\n\t\tSystem.out.println(0);\n\t}else{\n\t\tfor(long i = l; i < r; i++){\n\t\t\tfor(long j = i+1; j <= r; j++){\n\t\t\t\tif((j*i)%2019 < min){\n\t\t\t\t\tmin = ((j*i)%2019);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tSystem.out.println(min);\n\t}\n}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n \n int L = sc.nextInt();\n int R = sc.nextInt();\n \n int min = 2019 * 2019;\n R = Math.min(R, L + 2050);\n \n for(int i = L; i < R; i++){\n for(int j = i + 1; j <= R; j++){\n min = Math.min(min, ( (i % 2019) * (j % 2019) ) % 2019 );\n }\n }\n \n System.out.println( min );\n \n }\n}\n", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tlong ans = 0;\n\t\tlong minium = 2019;\n\t\tif( R-L < 2019 ){\n\t\t\tloop:for( long i=L; i<=R-1; i++ ){\n\t\t\t\tfor( long j=i+1; j<=R; j++ ){\n\t\t\t\t\tans = ((i%2019L)*(j%2019L))%2019L;\n\t\t\t\t\tminium = Math.min(ans,minium);\n\t\t\t\t\tif( minium==0 ){\n\t\t\t\t\t\tbreak loop;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tminium = 0;\n\t\t}\n\t\tSystem.out.println(minium);\n\t}\n}\n", "L,R=map(int,input().split())\nleft,right=L%2019,R%2019\nprint(0 if R-L>=2019 else min(i*j%2019 for i in range(left,right+1) for j in range(i+1,right+1)))", "import java.util.*;\n\nimport static java.lang.Math.round;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int l = sc.nextInt();\n int r = sc.nextInt();\n int modl = l% 2019;\n int modr = r%2019;\n long ans =2018;\n\n if(modr<= r-l){\n System.out.println(0);\n }else{\n for(int p=modl; p < modr; p++){\n for(int q=p+1; q <= modr; q++){\n ans = Math.min(ans, (p*q)%2019);\n\n }\n }\n System.out.println(ans);\n\n }\n\n\n\n\n\n\n }\n }", "L, R = map(int, input().split())\n\nR = min(R, L + 2019)\nout = 2020\nfor i in range(L, R):\n for j in range(i + 1, R + 1):\n out = min(out, (i * j) % 2019)\n\nprint(out)\n\n\n", "import java.util.Scanner;\n\npublic class Main {\n //\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int l = sc.nextInt(), r = sc.nextInt();\n System.out.println(sln(l, r));\n sc.close();\n }\n\n static int sln(int l, int r) {\n if (r - l >= 2019) return 0;\n int res = 2019;\n for (int i = l; i < r; i++) {\n for (int j = i + 1; j <= r; j++) {\n int mod = ((j % 2019) * (i % 2019)) % 2019;\n res = Math.min(res, mod);\n }\n }\n return res;\n }\n}\n", "l,r=map(int,input().split());s=range(l,r+1);print(+(r-l<2e3)and min(i*j%2019for i in s for j in s if i<j))", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int l,r;\n cin>>l>>r;\n int ans=2020;\n if(r-l>=2019){cout<<0; return 0;}\n for(int i=l;i<r;i++){\n for(int j=i+1;j<=r;j++){\n int a=i%2019;\n int b=j%2019;\n ans=min(ans,a*b%2019);\n }\n }\n cout<<ans;\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int l = sc.nextInt();\n int r = sc.nextInt();\n int min = Integer.MAX_VALUE;\n for (int i = l; i < r && i < l + 2019; i++) {\n for (int j = i + 1; j <= r && j < l + 2019; j++) {\n int mi = i % 2019;\n int mj = j % 2019;\n int mm = (mi * mj) % 2019;\n if (mm < min) {\n min = mm;\n }\n }\n }\n System.out.println(min);\n }\n}\n", "s, e = map(int, input().split())\nans = 10 ** 9\nb = min(s+2019, e)\nfor i in range(s, b + 1):\n for j in range(i+1, b+1):\n ans = min(ans, i*j%2019)\nprint(ans)", "l,r = map(int,raw_input().split())\n\nnow = [0]*2020\n\na = l\nwhile a < r+1:\n now[a % 2019] = 1\n a += 1\n if now[0] == 1 or (now[3]==1 and now[673]==1):\n print 0\n exit(0)\n\nans = 2019*2019\nfor x in range(2019):\n if now[x] == 1:\n for y in range(2019):\n if now[y] == 1 and x != y:\n buf = (x*y)%2019\n if ans > buf:\n ans = buf\nprint ans\n", "L,R=map(int,input().split())\nR=min(R,L+2019)\nminimum=2018\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n minimum=min(minimum,i*j%2019)\nprint(minimum)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong R = sc.nextLong();\n\t\tlong L = sc.nextLong();\n\t\t\n\t\tlong min = Long.MAX_VALUE;\n\t\t\n\t\tif(L - R > 2019) {\n\t\t\tmin = 0;\n\t\t} else {\n\t\t\tfor(long i = R; i < L; i++) {\n\t\t\t\tfor(long j = L; j > i; j--) {\n\t\t\t\t\tmin = Math.min(i* j % 2019, min);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(min);\n\t\tsc.close();\n\t}\n\n}\n", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint M = 2019;\n\t\tint L = sc.nextInt();\n\t\tint R = sc.nextInt();\n\t\tint ans = M;\n\t\tif (R - L <= M) {\n\t\t\tfor (int i = L; i <= R; i++) {\n\t\t\t\tfor (int j = i + 1; j <= R; j++) {\n\t\t\t\t\tans = Math.min(((i%M) * (j%M)) % M, ans);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tL = L % M;\n\t\t\tR = (R % M) + M;\n\t\t\tfor (int i = L; i <= R; i++) {\n\t\t\t\tfor (int j = i + 1; j <= R; j++) {\n\t\t\t\t\tans = Math.min(((i%M) * (j%M)) % M, ans);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll l,r; \n cin >> l >> r;\n \n int m = 2018;\n \n r = min(r, l+2019);\n for (ll i=l; i<r; i++){\n for (ll j=i+1;j<=r;j++){\n int x = i*j%2019;\n m = min(m, x);\n }\n }\n cout << m << endl;\n}\n", "L,R=map(int,input().split())\nleft=L%2019\nright=R%2019\nprint(0 if R-L>=2019 else min([i*j%2019 for i in range(left,right+1) for j in range(i+1,right+1)]))", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n\n if (r > l + 2018) {\n System.out.println(0);\n System.exit(0);\n }\n\n long res = 2019;\n\n for (long i = l; i <= r; ++i) {\n for (long j = l; j <= r; ++j) {\n if (i == j)\n continue;\n res = ((i * j) % 2019 < res) ? (i * j) % 2019 : res;\n }\n }\n\n System.out.println(res);\n }\n}", "import java.util.Scanner;\n\nclass Main {\n public static void main(final String[] args) {\n Scanner scan = new Scanner(System.in);\n long L = scan.nextLong();\n long R = scan.nextLong();\n int ans = Integer.MAX_VALUE;\n long x = 0;\n if (R - L >= 2019) {\n System.out.println(0);\n System.exit(0);\n }\n for (long i = L; i < R; i++) {\n for (long j = L + 1; j <= R; j++) {\n int m = (int) ((i * j) % 2019);\n ans = Math.min(ans, m);\n }\n }\n System.out.println(ans);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main()\n{\n\tlong long l,r;\n\tcin >> l >> r;\n\tr = min(r,l+4038);\n\tint ans = 2018;\n\tfor(long long i = l; i <= r; i++)\n\t{\n\t\tfor(long long j = i + 1; j <= r; j++)\n\t\t{\n\t\t\tint x = i*j%2019;\n\t\t\tans = min(ans, x);\n\t\t}\n\t}\ncout << ans << endl;\nreturn 0;\n}", "L,R=map(int,input().split())\nm=10**4\na=min(R,L+2019)\n\nfor i in range(L,a):\n for j in range(i+1,a+1):\n m=min(i*j%2019,m)\nprint(m)", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint L = sc.nextInt();\n\t\tint R = sc.nextInt();\n\t\tint min = (L%2019)*(R%2019)%2019;\n\t\tif (R-L > 2019){\n\t\t System.out.println(0);\n\t\t return;\n\t\t}\n\t\tfor(int i=L;i<R;i++){\n\t\t for(int j=i+1;j<=R;j++){\n\t\t if((i%2019)*(j%2019)%2019 < min){\n\t\t min = (i%2019)*(j%2019)%2019;\n\t\t }\n\t\t }\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}", "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main() {\n\tlong long l, r;\n\tcin>>l>>r;\n\tlong long ans = 2019*2019;\n\tfor (long long i=l; i<l+2019 && i<=r; i++) {\n\t\tfor (long long j=i+1; j<=i+2019 && j<=r; j++)\n\t\t\tans = min(ans, i*j%2019);\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "l,r = map(int,input().split())\n\nans = 2018\nfor i in range(l,l+2019):\n for j in range(i+1,min(r+1,i+2019)):\n ans = min(ans,(i*j)%2019)\nprint(ans)", "#include<iostream>\nusing namespace std;\nint main(){\n\tunsigned long long l,r;\n\tcin>>l>>r;\n\tif(r-l>=2018){\n\t\tcout<<0;\n\t\treturn 0;\n\t}\n\tunsigned long long minv=-1;\n\tfor(unsigned long long i=l;i<r;++i)\n\t\tfor(unsigned long long j=i+1;j<=r;++j)\n\t\t\tminv=min(minv,i*j%2019);\n\tcout<<minv;\n\treturn 0;\n}", "import java.util.*;\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n long min = Long.MAX_VALUE;\n int cnt = 0;\n// if(r-l>=2018) {\n// System.out.println(0);\n// return;\n// }\n for(long i = l; i<Math.min(r,l+2018); i++) {\n cnt=0;\n for(long j = i+1; j<=r; j++) {\n cnt++;\n if(cnt>=2019) break;\n min = Math.min((i*j)%2019, min);\n }\n }\n System.out.println(min);\n }\n}", "l,r=map(int,input().split())\n\nans=2018*2017\nfor i in range(l,min(r,l+2019)):\n for j in range(i+1,min(r,l+2019)+1):\n ans=min(ans,(i*j) % 2019)\nprint(int(ans))\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint l, r;\n\tscanf(\"%d %d\", &l, &r);\n\tif(r-l+1 >= 2019) printf(\"0\\n\");\n\telse {\n\t\tint ans = 2020;\n\t\tfor (int i=l; i<=r; i++){\n\t\t\tfor (int j=i+1; j<=r; j++){\n\t\t\t\tans = min(ans, ((i%2019) *(j%2019))%2019);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n}", "#include <iostream>\nusing namespace std;\nint main()\n{\n\tint l,r,mi=2000000005;\n\tcin>>l>>r;\n\tr=min(r,l+2019);\n\tfor(int i=l;i<=r;i++)\n\t{\n\t\tfor(int j=i+1;j<=r;j++)\n\t\t{\n\t\t\tmi=min(mi,((i%2019)*(j%2019))%2019);\n\t\t}\n\t}\n\tcout<<mi;\n\treturn 0;\n}", "L, R = map(int, input().split())\n\nres = 0\nif R - L < 2019:\n res = min([(i % 2019 * j % 2019) for i in range(L, R + 1) for j in range(i + 1, R + 1)])\nprint(res % 2019)\n", "#include <bits/stdc++.h>\n\n#define ll long long\n\n#define p 2019\n\nusing namespace std;\n\nint main()\n\n{\n\n\tint l, r;\n\n\tcin >> l >> r;\n\n\tif (r - l >= p) {puts(\"0\"); return 0;}\n\n\tll ans = p;\n\n\tfor (ll i = l; i < r; i ++) for (ll j = i + 1; j <= r; j ++) ans = min(ans, i * j % p);\n\n\tcout << ans << endl;\n\n}", "#include<iostream>\n#include<cmath>\nusing namespace std;\nint main()\n{\n\tint i,j,l,r,m=2019,c[2019]={0};\n\tcin>>l>>r;\n\tif(r-l<2018)for(i=l;i<=r;i++)c[i%2019]=1;\n\telse for(i=0;i<2019;i++)c[i]=1;\n\tfor(i=0;i<2018;i++)for(j=i+1;j<2019;j++)if(c[i]&&c[j])m=min(m,i*j%2019);\n\tcout<<m<<endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[]args) {\n\t\ttry(Scanner scan = new Scanner(System.in)){\n\t\t\tfinal int MOD = 2019;\n\t\t\t\n\t\t\tint L = scan.nextInt();\n\t\t\tint R = scan.nextInt();\n\t\t\t\n\t\t\tif(L/MOD==R/MOD){\n\t\t\t\tint start = L%MOD;\n\t\t\t\tint last = R%MOD;\n\t\t\t\tint minmod = 2018;\n\t\t\t\t\n\t\t\t\tfor(int i =start;i<=last-1;i++) {\n\t\t\t\t\tfor(int j = start+1;j<=last;j++){\n\t\t\t\t\t\tint c = i*j%MOD;\n\t\t\t\t\t\tif(minmod>c) {\n\t\t\t\t\t\t\tminmod=c;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tSystem.out.println(minmod);\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t}else{\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tSystem.out.println(0);\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t}\n\t\t\n\t\n\n}\n", "l, r = map(int, input().split())\nif r-l >2019:\n\tl = r-2019\ns = 10**9\nfor i in range(l,r+1):\n\tfor j in range(i+1,r+1):\n\t\ts = min(s,i*j%2019)\nprint (s)\n", "L, R = map(int, input().split())\n\nmod = 2018\n\nfor i in range(L, min(L+2019, R+1)):\n for j in range(i+1, min(i+2019, R+1)):\n mod = min(mod, i*j % 2019)\n\nprint(mod)\n", "L,R=map(int,input().split())\nif R-L>=2019:\n\tprint(0)\nelse:\n\tans=2018\n\tfor i in range(L,R+1):\n\t\tfor j in range(i+1,R+1):\n\t\t\tans=min(ans,(i*j)%2019)\n\tprint(ans)", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\tlong long L, R;\n\tscanf(\"%lld%lld\", &L, &R);\n\t\n\tint ans = 2019;\n\tfor(long long i = L; i <= min(R, L+2024); i ++){\n\t\tfor(long long j = i+1; j <= min(R, i+2024); j ++){\n\t\t\tans = min(i*j%2019, (long long)ans);\n\t\t}\n\t}\n\tprintf(\"%d\", ans);\n}\n", "L,R=map(int,input().split())\nif (R-L)>=673:\n print(0)\nelse:\n ans=2019\n for i in range(L,R):\n for j in range(i+1,R+1):\n ans=min(ans,(i*j)%2019)\n print(ans)", "L, R = map(int, input().split())\nans = 2019\nfor i in range(L, min(R+1, L+2019)):\n for j in range(i+1, min(R+1, L+2019)):\n ans = min(ans, (i*j)%2019)\nprint(ans)\n", "import java.util.*;\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint L=sc.nextInt();\n\t\tint R=sc.nextInt();\n\t\tint Mi,Mj;\n\t\tint answer=Math.floorMod(L*R, 2019);\n\t\tsc.close();\n\t\tfor(int i=L;i<R;i++) {\n\t\t\tif((R-L+1)>=2019) {\n\t\t\t\tanswer=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int j=(i+1);j<=R;j++) {\n\t\t\t\tMi=Math.floorMod(i, 2019);\n\t\t\t\tMj=Math.floorMod(j, 2019);\n\t\t\t\tif(Math.floorMod(Mi*Mj, 2019)<answer) {\n\t\t\t\t\tanswer=Math.floorMod(Mi*Mj, 2019);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n long long l,r;\n cin>>l>>r;\n r=min(r,l+2019);\n int ans=2018;\n for(long long i=l;i<=r;i++){\n for(long long j=i+1;j<=r;j++){\n int res=(i*j)%2019;\n ans=min(ans,res);\n }\n }\n cout<<ans<<endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int64_t n,m;\n cin >> n >> m;\n int64_t ans=2018;\n if(m-n>2019){\n ans=0;\n }else{\n for(int64_t i=n;i<m;i++){\n for(int64_t j=i+1;j<=m;j++){\n ans=min((i*j)%2019,ans);\n }\n }\n }\n cout << ans << endl;\n return 0;\n}", "L,R=map(int,input().split())\nans=[]\nR=min(R,L+2019)\nfor i in range(L,R):\n for j in range(i+1,R+1):\n ans.append(i*j%2019)\nprint(min(ans))", "L,R=map(int,input().split())\nM=2019;l=L%M;r=R%M\nprint(0 if l>r or R-L>671 else min(i*j%M for i in range(l,r) for j in range(i+1,r+1)))", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main() {\n\tll l,r;\n\tcin>>l>>r;\n\tll ans=10000;\n\tif(r-l>=2100)ans=0;\n\telse{\n\t\tfor(int i=l;i<r;i++)for(int j=i+1;j<=r;j++){\n\t\t\tll p=i%2019,q=j%2019;\n\t\t\tans=min(ans,(p*q)%2019);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "L,R=map(int,input().split())\nif R-L>2017:\n print(0)\n quit()\nans=2018\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n ans=min(ans,(i*j)%2019)\nprint(ans)\n", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long L = sc.nextLong(); \n long R = sc.nextLong(); \n\n long min = 2019;\n if(R-L>=2018){\n System.out.println(0);\n return;\n }\n for(long i=L; i<R;i++){\n // System.out.println(i);\n for(long j=i+1; j<=R;j++){\n // System.out.println(i+\"aaa\");\n min = Math.min((i*j)%2019, min);\n }\n }\n System.out.println(min);\n }\n}\n\n", "l,r = map(int,input().split())\nr = min(r,l+678)\nans = 2018\n\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n ans = min(i*j%2019,ans)\nprint(ans)", "#include<algorithm>\n#include<iostream>\nusing namespace std;\n\nint main(){\n int L,R;cin>>L>>R;\n long int ans=1e+9;\n for(long int i=L+1;i<=min(R,L+2019);i++){\n for(long int j=L;j<i;j++){\n ans=min(ans,(i*j)%2019);\n }\n }\n cout<<ans<<endl;\n}\n", "#include<bits/stdc++.h>\n#define ld long long\nusing namespace std;\nint main()\n{\n\tint l,r;\n\tcin>>l>>r;\n\tr=min(r,l+2019);\n\tint temp=2020;\n\tfor(int i=l;i<r;i++)\n\t{\n\t\tfor(int j=i+1;j<=r;j++)\n\t\t{\n\t\t\tint t1=((i%2019)*(j%2019))%2019;\n\t\t\ttemp=min(temp,t1);\n\t\t}\n\t}\n\tcout<<temp<<endl;\n}\n", "#include<stdio.h>\n\nint main()\n{\n\tint l,r;\n\tlong long i,j;\n\tscanf(\"%d%d\",&l,&r);\n\tif (r-l>2019) printf(\"0\\n\");\n\telse {\n\t\tint mm=2019;\n\t\tfor (i=l;i<=r;i++)\n\t\tfor (j=i+1;j<=r;j++) {\n\t\t\tint tt=(i*j)%2019;\n\t\t\tif (tt<mm) mm=tt;\n\t\t}\n\t\tprintf(\"%d\\n\",mm);\n\t}\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\n\nlong l, r, m, t;\n\nint main(){\n\tcin >> l >> r;\n\tm = 2019;\n\tfor (int i = l; i <= min(l + 2019, r-1); ++i){\n\t\tfor (int j = l+1; j <= min(l+2020, r); ++j){\n\t\t\tt = ((i % 2019) * (j % 2019)) % 2019;\n\t\t\tif (t < m) m = t;\n\t\t}\n\t}\n\tcout << m;\n}", "import java.util.*; \n\nclass Main{\npublic static void main(String[] args){\n\tScanner sc=new Scanner(System.in);\n long l=sc.nextLong();\n long r=sc.nextLong();\n\t\tlong min=l*(l+1)%2019;\n \n \tif((r-l)>=2018){\n \t\tSystem.out.println(0);\n \t}else if((r-l)<(2019-l%2019)){\n \t\tfor(long e=l;e<r;e++){\n for(long f=e+1;f<=r;f++){\n \t min=Math.min(min,e*f%2019);\n }\n if(min==0){break;}\n }\n \tSystem.out.println(min);\n \t }else{\n\n \tSystem.out.println(0);\n }\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int64_t L, R;\n cin >> L >> R;\n int64_t Ans=2019;\n for(int64_t i=L; i<min(R, L+2019); i++){\n for(int64_t j=i+1; j<=min(R, i+2019); j++){\n Ans=min(Ans, (i*j)%2019);\n }\n }\n cout << Ans << endl;\n}", "import java.util.*;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.HashMap;\n\nclass Main{\n public static void main(String[] args){\n \n Scanner sc = new Scanner(System.in);\n \n long L = sc.nextLong();\n long R = sc.nextLong();\n long ans = Long.MAX_VALUE;\n loop:for(long i=L; i<=R; i++){\n for(long j=i+1; j<=R; j++){\n ans = Math.min(ans, (i * j) % 2019);\n if(ans==0){\n break loop;\n }\n }\n }\n System.out.println(ans);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long L,R;\n cin >> L >> R;\n if(R-L+1>=2020) R = L+2018;\n \n long long ans = 2020;\n for(long long i=L;i<=R;i++){\n for(long long j=i+1;j<=R;j++){\n ans = min(ans,(i*j)%2019);\n }\n }\n \n cout << ans << endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tlong l,r;\n\tcin>>l>>r;\n\tlong t=2019;\n\tfor(long i=l;i<=r;i++)\n\t{\n\t\tfor(long j=i+1;j<=r;j++)\n\t\t{\n\t\t\tt=min(t,(i*j)%2019);\n \tif(t==0)\n {\n cout<<t;\n return 0;\n }\n\t\t}\n\t}\n\tcout<<t;\n\treturn 0;\n}", "l,r=map(int,input().split())\na=2019\nr=min(l+a,r)\nfor i in range(l,r):\n for j in range(l+1,r+1):\n a=min(a,(i*j)%2019)\nprint(a)\n\n", "l,r=map(int,input().split())\nm=l*r%2019\nif r-l>2019:\n print(0)\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n m=min(m,i*j%2019)\n print(m)", "L, R = map(int, input().split())\nans = 2018\nfor x in range(L, min(R, L+2019)):\n for y in range(L+1, min(R+1, L+2019)):\n ans = min(ans, (x*y)%2019)\nprint(ans)\n", "L, R = map(int, input().split())\n\nmi = 10**20\nfor i in range(L, min(R, L+2030)):\n for j in range(i+1, min(R+1, i+2030)):\n mi = min(mi, i*j%2019)\nprint(mi)", "L,R=map(int,input().split())\nif R-L>2019:\n print(\"0\")\nelse:\n x=[i*j%2019 for i in range(L, R) for j in range(L+1, R+1)]\n print(min(x))", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tlong L2019 = L % 2019;\n\t\tlong R2019 = R % 2019;\n\t\t\n\t\tif(L/2019 != R/2019 || L2019 == 0) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tlong ans = Long.MAX_VALUE;\n\t\t\n\t\tfor(long i = L2019; i <= R2019-1; i++) {\n\t\t\tfor(long j = i+1; j<= R2019; j++) {\n\t\t\t\tans = (ans < (i*j)%2019) ? ans : (i*j)%2019;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "l,r = map(int,input().split())\nans = 2019\nfor i in range(l,min(l+2019,r)):\n for j in range(l+1,min(l+2019,r+1)):\n ans = min(ans,i*j%2019)\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int L,R;cin>>L>>R;\n int ans=2018;\n int Rf=min(R-L,2019);\n for(int i=L;i<L+Rf;i++){\n for(int j=i+1;j<=L+Rf;j++){\n int ansy=((i%2019)*(j%2019))%2019;\n ans=min(ansy,ans);\n }\n }\n cout<<ans<<endl;\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextLong();\n\t\tlong r = sc.nextLong();\n\n\t\tlong min = 9999;\n\t\tfor(long i = l ; i < r ; i++) {\n\t\t\tfor(long j = i + 1 ; j <= r ; j++) {\n\t\t\t\tlong mod = (i * j) % 2019;\n\t\t\t\tif(mod == 0L) {\n\t\t\t\t\tSystem.out.println(mod);\n\t\t\t\t\tSystem.exit(0);;\n\t\t\t\t}\n\t\t\t\tif(mod < min) {\n\t\t\t\t\tmin = mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t\tsc.close();\n\n\t}\n\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n long int l,r;\n cin>>l>>r;\n r=min(r,l+2019);\n long int ans=1e9+2;\n for(long int i=l;i<r;i++)\n {\n for(long int j=i+1;j<=r;j++)\n ans=min(ans,(i*j)%2019);\n }\n cout<<ans<<endl;\n}\n", "L,R=map(int,input().split())\nans=10**10\nfor i in range(L,min(L+2019,R)):\n for j in range(L+1,min(L+2019,R)+1):\n ans=min(ans,i*j %2019)\nprint(ans)", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args)throws Exception{\n\t\tScanner stdIn=new Scanner(System.in);\n\t\tlong L=stdIn.nextLong();\n\t\tlong R=stdIn.nextLong();\n\t\tlong A[]=new long[2019];\n\t\tlong min=2019,z=L,y=0;\n\t\tint x=0,w=0,v=0;\n\t\twhile(z<=R){\n\t\t\tif(z==L)\n\t\t\t\ty=z%2019;\n\t\t\tif(z!=L&&z%2019==y)\n\t\t\t\tbreak;\n\t\t\tA[x]=z%2019;\n\t\t\tx++;\n\t\t\tz++;\n\t\t}z=L;\n\t\twhile(w<x){\n\t\t\tv=w+1;\n\t\t\twhile(v<x){\n\t\t\t\tlong c=(A[w]*A[v])%2019;\n\t\t\t\tif(c<min)\n\t\t\t\t\tmin=c;\n\t\t\t\tv++;\n\t\t\t}\n\t\t\tw++;\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}", "L,R=map(int,input().split())\nans=2019\nfor i in range(L,R):\n\tfor j in range(i+1, R+1):\n\t\tif j%2019==0:\n\t\t\tprint(0)\n\t\t\texit()\n\t\tans=min(ans,(i*j)%2019)\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint l = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tlong ans = 2018;\n\n\t\tif (r - l > 2018) {\n\t\t\tSystem.out.println(0);\n\t\t\tSystem.exit(0);\n\t\t} else {\n\t\t\tl %= 2019;\n\t\t\tr %= 2019;\n\n\t\t\tfor (int i = l; i < r; i++) {\n\t\t\t\tfor (int j = i + 1; j <= r; j++) {\n\t\t\t\t\tlong mul = i * j;\n\t\t\t\t\tmul %= 2019;\n\t\t\t\t\tif (mul < ans) {\n\t\t\t\t\t\tans = mul;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n ll l,r;\n cin >> l >> r;\n r = min(r,l+4038);\n int ans = 2018,x;\n for(ll i = l;i <= r;i++){\n for(ll j = i + 1;j <= r;j++){\n x = i*j%2019;\n ans = min(ans,x);\n }\n }\n cout << ans << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint L,R;\n\nint main(){\n\tscanf(\"%d%d\",&L,&R);\n\tint ans=1e9;\n\tfor(int i=L;i<L+2019 && L<R;i++)\n\t\tfor(int j=i+1;j<=R && j<=i+2019;j++)\n\t\t\tif((i%2019)*(j%2019)%2019<ans)\n\t\t\t\tans=(i%2019)*(j%2019)%2019;\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}", "l,r=map(int,input().split())\nans=2020\nfor i in range(l,r):\n for j in range(i+1,r+1):\n ans=min(ans,(i*j)%2019)\n if ans==0:\n print(ans)\n exit()\nprint(ans)\n\n", "#include<bits/stdc++.h>\n#define ll long long\nusing namespace std;\nll le,ri;\nint main(){\n\tcin>>le>>ri;\n\tri=min(ri,le+2019*3);\n\tll minn=1e9;\n\tfor(ll i=le;i<=ri;i++){\n\t\tfor(ll j=i+1;j<=ri;j++){\n\t\t\tminn=min(minn,i*j%2019);\n\t\t}\n\t}\n\tcout<<minn;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nll l,r,ans=2019;\nint main(){\n cin>>l>>r;\n for(int i=l;i<=min(l+2019,r);i++){\n for(int j=i+1;j<=min(l+2019,r);j++)\n ans=min(ans,1ll*i%2019*j%2019);\n }\n cout<<ans<<endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n long long l,r;\n cin>>l>>r;\n long long mina=2018;\n r=min(r,l+2019);\n for(auto i=l;i<=r;++i)\n for(auto j=i+1;j<=r;++j)\n {\n mina=min(mina,(i*j)%2019);\n }\n cout<<mina;\n }", "L, R = map(int,input().split())\nif R-L+1 >= 2019:\n\tprint(0)\nelse:\n\tprint(min([(i*j)%2019 for i in range(L,R+1) for j in range(i+1,R+1)]))", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long l = in.nextInt();\n long r = in.nextInt();\n\n long min = Long.MAX_VALUE;\n for (long i = l; i <= Math.min(r, l + 2019) ; i++) {\n for (long j = l; j <= Math.min(r, l + 2019); j++) {\n if (i == j) continue;\n\n min = Math.min(min, (i * j) % 2019);\n }\n }\n\n System.out.println(min);\n }\n}", "#include <bits/stdc++.h>\n\n#define MAXN 200001\n\n#define MOD 2019\n\nusing namespace std;\n\nint A, B, mid, out=INT_MAX;\n\nint main(){\n\n\tcin>>A>>B;\tfor(int i=A;i<min(A+2019, B);i++)\n\n\t\tfor(int j=A+1;j<=min(A+2019, B);j++)\n\n\t\t\tout=min(out, ((i%MOD)*(j%MOD))%MOD);\n\n\tcout<<out;\n\n}", "#include<bits/stdc++.h>\n#define LL long long\nusing namespace std;\nLL L,R;\nint main(){\n\tscanf(\"%lld%lld\",&L,&R);\n\tLL mi=2e9;\n\tfor(LL i=L;i<=min(R,L+2019);i++){\n\t\tfor(LL j=i+1;j<=min(R,L+2019);j++){\n\t\t\tmi=min(mi,i*j%2019);\t\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",mi);\n\treturn 0;\n}", "#include<stdio.h>\n\nint main()\n{\n\tunsigned long long a,b,i,j,t=2018,m;\n\tscanf(\"%ld%ld\",&a,&b);\n\tfor(i=a;i<=b-1;i++)\n\t{\n\t\tfor(j=i+1;j<=b;j++)\n\t\t{\n\t\tm=i*j%2019;\n\t\tif(m<t)\n\t\tt=m;\n\t\tif(t==0)\n\t\tbreak;\t\n\t\t}\n\t\tif(t==0)\n\t\tbreak;\n\t}\n\tprintf(\"%ld\",t);\n }", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tif (L%2019==0||R%2019==0) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn ;\n\t\t}\n\t\tif (L/2019!=R/2019) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn ;\n\t\t}\n\t\tint min = 2019;\n\t\tfor (long i=L;i<R;i++) {\n\t\t\tfor (long j=i+1;j<=R;j++) {\n\t\t\t\tint temp = (int) (((i%2019)*(j%2019))%2019);\n\t\t\t\tif (temp<min) {\n\t\t\t\t\tmin = temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(void) {\n\tlong long l, r;\n\tcin >> l >> r;\n\tr = min(r, l+4038);\n\tint ans = 2018;\n\tfor (long long i = l; i <= r; i++) {\n\t\tfor (long long j = i+1; j <= r; j++) {\n\t\t\tint x = i * j % 2019;\n\t\t\tans = min(ans, x);\n\t\t}\n\t}\n \tcout << ans << endl;\n\treturn 0;\n}\n", "#include <iostream>\nusing namespace std;\nint main(){\n\tint l,r;\n\tcin>>l>>r;\n\tif(r-l>=2019){\n\t\tcout<<0;\n\t}\n\telse{\n\t\tint ans=2018;\n\t\tfor(int i=l;i<r;i++){\n\t\t\tfor(int j=i+1;j<=r;j++){\n\t\t\t\tans=min(ans,((i%2019)*(j%2019))%2019);\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\n\t\t// input\n\t\tlong left = scan.nextLong();\n\t\tlong right = scan.nextLong();\n\n\t\t// check\n\t\tlong min = Long.MAX_VALUE;\n\t\tfin: for(long i = left; i < right; i++) {\n\t\t\tfor(long j = i + 1; j <= right; j++) {\n\t\t\t\tif(i * j % 2019 < min) {\n\t\t\t\t\tmin = i * j % 2019;\n\t\t\t\t}\n\t\t\t\tif(j % 2019 == 0 || i % 2019 == 0) {\n\t\t\t\t\tmin = 0;\n\t\t\t\t\tbreak fin;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(min);\n\t}\n}\n\n", "L, R=map(int, input().split())\nminv=2019\nif R-L>=2019:\n minv=0\nelse:\n for i in range(L, R):\n for j in range(i+1, R+1):\n minv=min(minv, (i*j)%2019)\nprint(minv)", "ans=2019\nl,r=map(int,input().split())\nfor i in range(min(2019,r-l)):\n for j in range(i+1,min(2019,r-l+1)):\n ans=min(ans,((l+i)*(l+j))%2019)\n \nprint(ans)", "L,R=map(int, input().split())\nR=min(R,L+2019)\nans=2019*2019\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n tmp=(i*j)%2019\n ans=min(ans,tmp)\nprint(ans)", "l,r=map(int,input().split())\nM=2019;s=range(l,r+1)\nprint(0 if r//M-l//M>0 else min(i*j%M for i in s for j in s if i<j))", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n \n r = Math.min(r, l+2019);\n long min = 2018;\n for(long i = l; i <= r; i++)\n for(long j = i+1; j <= r; j++)\n min = Math.min(min, i*j%2019);\n System.out.println(min); \n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int L, R; cin >> L >> R;\n int ans=2019;\n for(int i=L;i<min(L+2018, R);i++){\n for(int j=L+1;j<=min(L+2018,R);j++){\n int k=((i%2019)*(j%2019))%2019;\n if(ans>k){\n ans=k;\n }\n }\n }\n cout << ans << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint l,r,up,ans;\nint main()\n{\n\tans=2020;\n\tscanf(\"%d%d\",&l,&r);\n\tup=min(r,l+2019); \n\tfor(int i=l;i<=up;++i)\n\t{\n\t\tfor(int j=i+1;j<=up;++j)\n\t\tans=min(1ll*ans,(1ll*i*j)%2019);\n\t}\n\tprintf(\"%d\\n\",ans);\n return 0;\n}", "#include<stdio.h>\nint main()\n{\n\tlong long a,b,m=1000000;\n\tscanf(\"%lld%lld\",&a,&b);\n\tif(b-a>2019)printf(\"0\\n\");\n\telse\n\t{\n\t\tfor(long long i=a;i<b;i++)\n\t\t{\n\t\t\tfor(long long j=i+1;j<=b;j++)\n\t\t\t{\n\t\t\t\tif((i%2019*j%2019)%2019<m)m=(i%2019*j%2019)%2019;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%lld\\n\",m);\n\t}\n}", "L, R = map(int, input().split())\nans = 2018\nfor i in range(L, min(R, L+2019)+1):\n for j in range(i+1, min(R, i+2019)+1):\n ans = min(ans, i*j%2019)\nprint(ans)", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t Scanner sc = new Scanner(System.in);\n\t long l = sc.nextLong();\n\t long r = sc.nextLong();\n \n \n if(r-l > 3000) {\n System.out.println(0);\n }else {\n \n long min = 2018;\n for(long i = l; i < r; i++) {\n for(long j = l+1; j <=r; j++) {\n long num = (i*j)%2019;\n if(num<min) {\n min = num;\n }\n }\n }\n System.out.println(min);\n\n \n }\n\n \n\t}\n}", "l,r = (int(i) for i in input().split())\na = []\nfor i in range(l,min(r,l+2019)):\n for j in range(i+1,min(r,l+2019)+1):\n a.append(i*j%2019)\nprint(min(a))", "from itertools import combinations as f\nL, R = map(int, input().split())\n\ns = set(map(lambda x:x%2019, range(L, R+1)[:2019]))\n\nprint(min([i*j%2019 for i, j in f(s, 2)]))\n", "from itertools import combinations as f\nl,r=map(int,input().split())\ns=set(map(lambda x:x%2019,range(l,r+1)[:2019]))\nprint(min([i*j%2019 for i,j in f(s,2)]))", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long l,r; cin>>l>>r;\n long long ans=2018;\n \n if(r-l>=2019) cout<<0<<endl;\n else{\n for(long long i=l;i<r;i++){\n for(long long j=i+1;j<=r;j++){\n\t ans=min(ans,(i*j)%2019);\n }\n }\n cout<<ans<<endl;\n }\n}\n", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tsc.close();\n\t\tlong anser = 0;\n\t\tlong min = 2 * (long) Math.pow(10, 9);\n\t\t//大きすぎる値は制約を越えるので０を出す\n\t\tif(R-L>=2018) System.out.println(0);\n\t\telse {\n\t\t\tfor(long i = L ; i<=R;i++) {\n\t\t\t\tfor(long j = i+1; j <= R; j++) {\n\t\t\t\t\tanser = (i*j)%2019;\n\t\t\t\t\tmin = Math.min(anser, min);\n\t\t\t\t}\n\t\t\t}\n\t\tSystem.out.println(min);\n\t\t}\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint main(){\n ll L,R,ans=2019;\n cin>>L>>R;\n if(R-L>=2018){cout<<0<<endl;return 0;}\n else{\n for(ll i=L;i<=R-1;i++){\n for(ll j=i+1;j<=R;j++){ans=min(ans,i*j%2019);}\n }\n cout<<ans<<endl;\n }\n}", "L, R = map(int, input().split())\nans = 10**100\nfor i in range(L, min(R, L+2019)):\n for j in range(i+1, min(R+1, L+2019)):\n ans = min(ans, (i*j) % 2019)\nprint(ans)\n", "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main() {\n\tlong long l, r;\n\tcin >> l >> r;\n\tlong long res = 1e10;\n\tfor (long long i = l; i <= min(2019 + l, r); i++) {\n\t\tfor (long long j = i + 1; j <= min(2019 + l, r); j++) {\n\t\t\tres = min(res, i * j % 2019);\n\t\t}\n\t}\n\tcout << res << endl;\n}", "l,r = map(int,input().split())\nr = min(r,l+2019)\nc = [4*10**18]\nfor i in range(l,r):\n for j in range(i+1,r+1):\n c.append((i*j)%2019)\nprint(min(c))", "import java.util.Scanner;\nclass Main {\n public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n long l = stdIn.nextInt();\n long r = stdIn.nextInt();\n \n long min = 2018;\n for(long i = l;i < l + 2019 && i < r;i++) {\n for(long j = r;j > r - 2019 && j > i;j--) {\n if((i*j)%2019 < min){\n min = (i*j)%2019;\n }\n }\n }\n\n System.out.println(min);\n \n \n }\n}\n\n", "L, R = map(int,input().split())\n\nR = min(R, L+673)\nans = 2018\nfor i in range(L, R+1):\n for j in range(i+1, R+1):\n ans = min(ans, i*j%2019)\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint l, r;\n\tscanf(\"%d%d\", &l, &r);\n\tint ans = 2019;\n\tint start = l%2019, end = start+min(2019, r-l+1);\n\tfor (int i = start; i < end; ++i) {\n\t\tfor (int j = i+1; j < end; ++j) {\n\t\t\tans = min(i*j%2019, ans);\n\t\t}\n\t}\n\tprintf(\"%d\\n\", ans);\n}", "L,R=map(int,input().split())\na=2020\nfor i in range(L,min(R, L+2020)):\n for j in range(i+1, min(R+1, L+2020)):\n a=min(a, (i%2019*j%2019)%2019)\nprint(a)", "L,R=map(int,input().split())\nM=2019;l,r=L%M,R%M\nprint(0 if R//M-L//M>0 else min(i*j%M for i in range(l,r) for j in range(i+1,r+1)))", "L,R=map(int, input().split())\nR=min(R,L+2019)\nans=2019*2019\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n num=(i*j)%2019\n ans=min(ans,num)\nprint(ans)", "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\n typedef long long ll;\n ll l,r;\n int ans=2018;\n cin >> l >> r;\n r=min(r,l+2019);\n for(ll i=l;i<r;i++){\nfor(ll j=l+1;j<=r;j++) {\n int x=i*j%2019;\n ans=min(x,ans);\n }\n }\n cout << ans << endl;\n\n}\n", "l,r = map(int,input().split())\ns = range(l,r+1)[:673]\nprint(min(i*j%2019 for i in s for j in s if i<j))", "import java.util.*;\n\npublic class Main {\n\n public static void main (String[] args) {\n\n Scanner sc = new Scanner(System.in);\n \n long L = sc.nextLong();\n long R = sc.nextLong();\n\n sc.close();\n\n long r = Math.min(R, L+4038);\n\n long min = 2018;\n \n for (long i = L; i <= r; i++){\n for (long j = i + 1; j <= r; j++){\n long m = i*j%2019;\n min = Math.min(min, m);\n }\n }\n\n System.out.println(min);\n \n }\n\n}\n", "mod = 2019\nl, r = map(int, input().split())\nm = min(r, l + mod)\nMN=[]\nfor i in range(l, m):\n for j in range(i+1, m+1):\n MN.append(i*j%mod)\nprint(min(MN))", "l,r=map(int,input().split())\n\na=0\nif r-l<2019:\n a=min([x*y%2019 for x in range(l,r+1) for y in range(x+1,r+1)])\nprint(a)", "L,R = map(int,input().split())\nif (R-L >= 2019):\n print(0)\nelse:\n res = 2019\n for i in range(L,R):\n for j in range(i+1,R+1):\n res = min(res,(i*j)%2019)\n print(res)", "#include<bits/stdc++.h>\nusing namespace std;\n#define P 2019\nint l,r,i,j,ans,mi;\nint main() {\n\tscanf(\"%d%d\",&l,&r);\n\tif(r-l>=2018) {\n\t\tputs(\"0\");\n\t\treturn 0;\n\t}\n\tans=P;\n\tfor(i=l; i<r; i++)\n\t\tfor(j=i+1; j<=r; j++)\n\t\t\tmi=1ll*i*j%P,ans=min(ans,mi);\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}", "L,R = map(int,input().split())\n\nans = 2019\nfor i in range(L,min(L+2019,R)):\n for j in range(i+1,min(L+2019,R+1)):\n ans = min(ans,(i*j)%2019)\n\nprint(ans)", "l,r = map(int,input().split())\nr = min(l+2019,r)\n\nans = 2019\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n ans = min(ans, (i*j)%2019)\nprint(ans)\n", "import java.util.*;\n\nclass Main{\n final static long mod = 1000000007;\n //\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int l = sc.nextInt();\n int r = sc.nextInt();\n int min = 2018;\n if(r / 2019 - l / 2019 >= 1){\n System.out.println(0);\n return;\n }\n l %= 2019;\n r %= 2019;\n for(int i = l; i <= r; i++){\n for(int j = i + 1; j <= r; j++){\n min = Math.min(min, i * j % 2019);\n }\n }\n System.out.println(min);\n\n }\n}", "import java.util.*;\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n long min = Long.MAX_VALUE;\n int cnt = 0;\n if(r-l>=2018) {\n\n System.out.println(0);\n return;\n }\n for(long i = l; i<r; i++) {\n for(long j = i+1; j<=r; j++) {\n cnt++;\n //if(cnt>=2020) break;\n min = Math.min((i*j)%2019, min);\n }\n //if(cnt>=2020) break;\n }\n System.out.println(min);\n }\n}", "l, r=map(int, input().split())\nif r-l>672:\n\tp=0\nelse:\n\tx=[]\n\tfor i in range(l, r):\n\t\tfor j in range(i+1, r+1):\n\t\t\tx.append((i*j)%2019)\n\tp=min(x)\nprint(p)", "import java.util.*;\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long l = sc.nextLong();\n long r = sc.nextLong();\n long min = Long.MAX_VALUE;\n int cnt = 0;\n if(r-l>=2018) {\n\n System.out.println(0);\n return;\n }\n for(long i = l; i<r; i++) {\n for(long j = i+1; j<=r; j++) {\n cnt++;\n //if(cnt>=2019) break;\n min = Math.min((i*j)%2019, min);\n }\n if(min==0) break;\n }\n System.out.println(min);\n }\n}", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int l=sc.nextInt();\n int r=sc.nextInt();\n int min = 2019*2019;\n for(int i=l;i<=r&&i<=l+2019;i++){\n for(int j=i+1;j<=r&&j<=i+2019;j++){\n min=Math.min( ( ((i%2019)*(j%2019))%2019 ) ,min);\n }\n }\n System.out.println( min );\n }\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int l = scanner.nextInt();\n int r = scanner.nextInt();\n boolean b = r-l>=2019;\n l %= 2019;\n r %= 2019;\n if (l>r||b) {\n System.out.println(0);\n }else {\n int min = 2019;\n for (int i=l;i<r;i++){\n for (int j=i+1;j<=r;j++){\n min = Math.min(min,(i*j)%2019);\n }\n }\n System.out.println(min);\n }\n\n\n }\n}\n", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long L = sc.nextLong();\n long R = sc.nextLong();\n long mL = L%2019;\n long mR = R%2019;\n long out = 3000;\n if(R-L >= 2018 || mL > mR){\n System.out.println(0);\n } else {\n for (long i=mL; i<=mR-1; i++) {\n for (long j=i+1; j<=mR; j++) {\n if(out > (i*j)%2019){\n out = (i*j)%2019;\n }\n }\n }\n System.out.println(out);\n }\n }\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nlong long l,r,ans=2019;\n\nint main(){\n\tcin>>l>>r;\n\tfor(long long i=l;i<=min(r,l+2020);i++){\n\t\tfor(long long j=i+1;j<=min(r,i+2020);j++){\n\t\t\tans=min(ans,(i*j)%2019);\n\t\t}\n\t}\n\tcout<<ans;\n\t\n\treturn 0;\n}", "l,r = map(int,input().split())\n\nif r-l >= 2018:\n print(0)\nelse:\n ans = 2019\n for i in range(l,r):\n for j in range(i+1,r+1):\n ans = min(ans,(i*j)%2019)\n print(ans)\n", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong L = sc.nextLong();\n\t\tlong R = sc.nextLong();\n\t\tif(R - L >= 2019) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tlong ans = Long.MAX_VALUE;\n\t\t\tfor(long i = L; i <= R; i++) {\n\t\t\t\tfor(long j = i + 1; j <= R; j++) {\n\t\t\t\t\tans = Math.min(ans, (i * j) % 2019);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n static final int MOD = 2019;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n long L = sc.nextInt();\n long R = sc.nextInt();\n\n R = Math.min(R, L + 4038);\n long ans = 2018;\n\n for (long i = L; i <= R; i++) {\n for (long j = i + 1; j <= R; j++) {\n long x = i * j % 2019;\n ans = Math.min(ans, x);\n }\n }\n\n System.out.println(ans);\n\n }\n\n}\n", "#include<iostream>\nusing namespace std;\nint ans=0x3f3f3f3f;\nint main(){\n\tint l,r;\n\tcin>>l>>r;\n\tif(r-l+1>2019){\n\t\tcout<<0<<endl;\n\t}\n\telse{\n\t\tl%=2019,r%=2019;\n\t\tfor(int i=l;i<=r-1;i++){\n\t\t\tfor(int j=i+1;j<=r;j++){\n\t\t\t\tint k=(i*j)%2019;\n\t\t\t\tans=min(ans,k);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}", "l,r=map(int,input().split());s=range(l,r+1);print(+(r-l<2019)and min(i*j%2019for i in s for j in s if i<j))", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tlong long l,r;\n\tint ans;\n\tans = 20200000;\n\tcin>>l>>r;\n\tif(r - l > 2017){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tfor(long long i=l;i<r;i++){\n\t\tfor(long long j=i+1;j<=r;j++){\n\t\t\tif((i*j)%2019 < ans)\n\t\t\t\tans = (i*j)%2019;\n\t\t}\n\t}\t\n\tcout<<ans<<endl;\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong l = sc.nextLong();\n\t\tlong r = sc.nextLong();\n\t\tlong div = 2019;\n\t\tif(l / div == r / div) {\n\t\t\tlong ans = Long.MAX_VALUE;\n\t\t\tfor(long i = l % div; i < r % div; i++) {\n\t\t\t\tfor(long j = i + 1; j < r % div + 1; j++) {\n\t\t\t\t\tans = Math.min(ans, (i * j) % div);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t} else {\n\t\t\tSystem.out.println(0);\n\t\t}\n\n\t}\n\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n final Scanner sc = new Scanner(System.in);\n\n final long l = sc.nextLong();\n final long r = sc.nextLong();\n\n long ans = Long.MAX_VALUE;\n\n if (r - l >= 2020) {\n ans = 0;\n } else {\n for (long i = l; i <= r; i++) {\n for (long j = l; j <= r; j++) {\n if (i == j) continue;\n ans = Math.min(ans, (i*j) % 2019);\n }\n }\n }\n\n System.out.println(ans);\n }\n}\n", "L,R=map(int,input().split())\nR=min(L+2019,R)\nm=3000\nfor x1 in range(L,R):\n for x2 in range(x1+1,R+1):\n if m>(x1*x2)%2019:m=(x1*x2)%2019\nprint(m)", "l,r=map(int,input().split())\nans=3000\nif r-l<673:\n for i in range(l+1,r+1):\n for j in range(l,i):\n ans=min(ans,i*j%2019)\nelse:\n ans=0\nprint(ans)", "import java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tlong l=Long.parseLong(scan.next());\n\t\tlong r=Long.parseLong(scan.next());\n\t\t\n\t\tif (r-l>=2018) {\n\t\t\tSystem.out.print(0);\n\t\t}else {\n\t\t\tlong min=2019;\n\t\t\tfor (long i = l;i<r;++i) {\n\t\t\t\tfor (long k=i+1;k<=r;++k) {\n\t\t\t\t\tmin=Math.min(min, (i*k)%2019);\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.print(min);\n\t\t}\n\n}\n}\n//end", "L,R = map(int,input().split())\nans = float(\"inf\")\n\nfor i in range(L,min(R,L+2019)):\n for j in range(i+1,min(R,L+2019)+1):\n ans = min(ans,(i*j)%2019)\n \nprint(ans)", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\tint l = Integer.parseInt(sc.next());\n int r = Integer.parseInt(sc.next());\n int d = r-l;\n \n if (d >= 2019) {\n System.out.println(\"0\");\n return;\n }\n \n int pro = 0;\n int ans = 2019;\n \n\tfor (int i=l; i<=r; i++){\n for (int j=i+1; j<=r; j++){\n pro = ((i%2019) * (j%2019) ) % 2019;\n //System.out.println(i+\", \"+j+\" : \" + pro);\n if (pro < ans) {\n ans = pro;\n }\n }\n }\n\n System.out.println(ans);\n\n }\n}\n", "l,r=map(int,input().split())\n\nans=10000\nfor i in range(l,r):\n for j in range(i+1,r+1):\n ans=min(ans,(i*j)%2019)\n if ans==0:\n print(0)\n exit()\nprint(ans)", "import sys\n\ndef solve(l, r):\n if r - l >= 2018:\n return 0\n\n ans = (l * r) % 2019\n for i in range(l, r+1):\n for j in range(l + 1, r+1):\n if i == j:\n continue\n\n # print(i, j)\n ans = min(ans, (i * j) % 2019)\n\n return ans\n\n\nif __name__ == \"__main__\":\n l, r = map(int, sys.stdin.readline().rstrip().split(\" \"))\n print solve(l, r)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong l = Integer.parseInt(sc.next());\n\t\tlong r = Integer.parseInt(sc.next());\n\n\t\tlong min = Integer.MAX_VALUE;\n\n\t\tfor (long i = l; i < r; i++) {\n\t\t\tfor (long j = i + 1; j <= r; j++) {\n\t\t\t\tlong mod = (i % 2019 * j % 2019) % 2019;\n\t\t\t\tif (mod == 0) {\n\t\t\t\t\tSystem.out.println(0);\n\t\t\t\t\tSystem.exit(0);\n\t\t\t\t} else if (mod < min) {\n\t\t\t\t\tmin = mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}", "\n\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long L = sc.nextLong();\n long R = sc.nextLong();\n\n if(R-L>3000) {\n System.out.println(0);\n } else {\n long res = 2018;\n for(long i = L; i < R; i++) {\n for(long j = L+1; j <= R; j++) {\n res = Math.min(res, (i*j)%2019);\n }\n }\n System.out.println(res);\n }\n }\n}\n", "l,r=map(int,input().split())\n\nif r-l>2019:\n print(0)\nelse:\n mn=2019\n for i in range(l,r):\n for j in range(i+1,r+1):\n mn=min(mn,(i*j)%2019)\n print(mn)", "#include <iostream>\n#include <cmath>\nusing namespace std;\nint main(){\n\tint a,b;int c=2019;\n\tcin>>a>>b;\n\tif(b/2019!=a/2019){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\ta%=2019;b%=2019;\n\tfor(int i=a;i<b;i++)for(int j=i+1;j<=b;j++){\n\t\tint d=(i*j)%2019;\n\t\tif(c>d)c=d;\n\t}\n\tcout<<c<<endl;\n}", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nint main(){\n ll n,m;\n cin>>n>>m;\n ll ans=2019;\n for (ll i = n; i < min(m,n+2020); ++i) {\n for (ll j = i+1; j <=min(m,i+2020) ; ++j) {\n ans=min(ans,i*j%2019);\n }\n }\n cout<<ans;\n return 0;\n}", "l,r = map(int,input().split())\nr = min(r,l+2017)\nans = 2018\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n x = i*j%2019\n ans = min(ans,x)\nprint(ans)", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int L = sc.nextInt();\n int R = sc.nextInt();\n boolean zero = false; \n \n if(L-R>=2019) zero = true;\n for(int i = L;i<R;i++)\n {\n if(i%2019==0) \n {\n zero = true;\n break;\n }\n }\n L = L%2019;\n R = R%2019;\n int min = 2017*2018;\n if(!zero)\n {\n for(int i = L;i<R;i++)\n {\n for(int k = i+1;k<=R;k++)\n {\n if(min>(i*k)%2019) min = (i*k)%2019; \n }\n }\n }\n if(zero) System.out.println(0);\n else System.out.println(min);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long int\nint main(){\n\tll l, r, res=2020;\n\tcin>>l>>r;\n\tif(r-l>=2019) return cout<<0, 0;\n\tfor(ll j=l;j<=r;j++){\n\t\tfor(ll i=l;i<j;i++)\n\t\t\tres=min(res,(i*j)%2019);\n\t}\n\tcout<<res;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int l,r;\n cin>>l>>r;\n r=min(r,l+2019);\n int ans=2019;\n for(long long i=l;i<r;i++){\n for(long long j=i+1;j<=r;j++){\n ans=min(ans,(int)((i*j)%2019));\n }\n }\n cout<<ans<<endl;\n return 0;\n}\n", "L, R = map(int, input().split())\nR = min(R, L+4038)\nans = 2018\nfor i in range(L, R):\n for j in range(L+1, R+1):\n ans = min((i*j) % 2019, ans)\nprint(ans)\n", "L, R = list(map(int, input().split()))\n\nif R - L >= 2019:\n print(0)\nelse:\n l = [i * j % 2019 for i in range(L, R+1) for j in range(i+1, R+1)]\n print(min(l))", "#include<iostream>\n#define ll long long\nusing namespace std;\n\nint main(){\n ll L,R; cin >> L >> R;\n ll ans = 2018;\n for(ll i=L;i<=R;i++)\n {\n for(ll k=i+1;k<=R;k++)\n {\n if(ans==0) break;\n ans=min(ans,(i*k)%2019);\n }\n if(ans==0) break;\n }\n cout<<ans;\n}\n \n \n", "#include<bits/stdc++.h>\nusing namespace std;\nint l,r,k,p;\nint main(){\n\tcin>>l>>r;\n\tk=l%2019;\n\tp=k;\n\tk=l+2019-k;\n\tif(k<=r)puts(\"0\");\n\telse {\n\t\tl=l%2019,r=r%2019;\n\t\tint ans=2020;\n\t\tfor(int i=l;i<=r;i++)\n\t\t\tfor(int j=i+1;j<=r;j++)ans=min(ans,i*j%2019);\n\t\tprintf(\"%d\",ans);\n\t}\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint l,r;\n\tcin>>l>>r;\n\tint dis=min(r-l,2019);\n\tl%=2019;\n\tr=l+dis;\n\tint ans=999999999;\n\tfor(int i=l;i<=r;i++)\n\tfor(int j=i+1;j<=r;j++)\n\tans=min(ans,(i*j)%2019);\n\tcout<<ans;\n}", "#include<iostream>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint main(){\n\tint L,R,l,r,ans;\n\tcin>>L>>R;\n\tl=L%2019;r=R%2019;\n\tif(R-L>=2018||l>r)ans=0;\n\telse{\n\t\tans=2019;\n\t\tfor(int i=l;i<=r-1;i++){\n\t\t\tfor(int j=i+1;j<=r;j++){\n\t\t\t\tans=min(ans,(i*j)%2019);\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main (){\n\tint a,b,ans=2018;\n\tcin>>a>>b;\n\tif(b-a>=2019)puts(\"0\");\n\telse{\n\t\tfor(int i=a;i<=b;i++){\n\t\t\tfor(int j=i+1;j<=b;j++){\n\t\t\t\tans=min(ans,((i%2019)*(j%2019))%2019);\n\t\t\t}\n\t\t}\n\tcout<<ans<<endl;\n\t}\n\treturn 0;\n} ", "L, R = map(int, input().split())\nmod = 2019\nif R - L >= mod:\n x = list(range(mod))\nelse:\n x = list(range(L,R+1))\nprint(min(i*j % mod for j in x for i in x if j != i))", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner s = new Scanner(System.in)) {\n\t\t\tfinal int L = s.nextInt();\n\t\t\tfinal int R = s.nextInt();\n\n\t\t\tif (R - L >= 2019) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t} else {\n\t\t\t\tint ret = 2019;\n\t\t\t\tfor (int i = L % 2019; i < R % 2019; i++) {\n\t\t\t\t\tfor (int j = i + 1; j <= R % 2019; j++) {\n\t\t\t\t\t\tif ((i * j) % 2019 < ret) {\n\t\t\t\t\t\t\tret = (i * j) % 2019;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println(ret);\n\t\t\t}\n\t\t}\n\t}\n}\n", "l, r = map(int, input().split())\nif r-l > 2019:\n print(0)\nelse:\n print(min(i * j % 2019 for i in range(l, r + 1) for j in range(l, i)))\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\n\t\tlong l;\n\t\tlong r;\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tl = sc.nextInt();\n\t\tr = sc.nextInt();\n\n\t\tlong res;\n\n\t\tif (r - l >= 2018) {\n\t\t\tres = 0;\n\t\t} else {\n\n\t\t\tres = 2018;\n\n\t\t\tfor (long i = l; i < r; i++) {\n\n\t\t\t\tfor (long j = i+1;j <= r; ++j) {\n\t\t\t\t\tres = Math.min(res, (i * j) % 2019);\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(res);\n\n\n\t}\n}\n", "l,r=map(int,input().split())\na=2019\nif r-l>=2019:\n print(0)\n exit(0)\nfor i in range(l,r):\n for j in range(i+1,r+1):\n a=min(i*j%2019,a)\nprint(a)\n" ]
You are given positive integers A and B. If A is a divisor of B, print A + B; otherwise, print B - A. Constraints * All values in input are integers. * 1 \leq A \leq B \leq 20 Input Input is given from Standard Input in the following format: A B Output If A is a divisor of B, print A + B; otherwise, print B - A. Examples Input 4 12 Output 16 Input 8 20 Output 12 Input 1 1 Output 2
[ "#include <bits/stdc++.h>\nint main() {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n if (b % a == 0) printf(\"%d\\n\", a+b);\n else printf(\"%d\\n\", b-a);\n}", "a,b = list(map(int,input().split()))\nprint(a+b if b%a == 0 else b-a)\n", "a, b = (int(i) for i in input().split())\nprint(a+b) if b%a == 0 else print(b-a)", "#118_A\nA,B=map(int,input().split())\nprint(A+B if B%A==0 else B-A)", "a,b=map(int, input().split())\nc=b%a\nif c==0:\n print(a+b)\nelse:\n print(b-a)", "a, b = map(int, input().split())\nprint('{}'.format(a+b if b%a == 0 else b-a))", "x, y = map(int, input().split())\nif y % x == 0:\n print(x+y)\nelse:\n print(y-x)\n", "A,B = map(int,input().split(\" \"))\n\nif B%A==0:\n print(A+B)\nelse:\n print(B-A)", "import java.util.Scanner;\n//import java.util.Arrays;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tSystem.out.println(b % a == 0 ? a + b : b - a);\n\t}\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint ans;\n\t\tif(B % A == 0) {\n\t\t\tans = A + B;\n\t\t} else {\n\t\t\tans = B - A;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "import java.util.*;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\t\n\tvoid doIt() {\n\t\tsA();\n\t}\n\t\n\tvoid sA() {\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tif(b % a == 0) {\n\t\t\tSystem.out.println(a + b);\n\t\t}\n\t\telse System.out.println(b - a);\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().doIt();\n\t}\n}\n", "b,c = map(int, input().split())\nif c%b==0:\n\tprint(b+c)\nelse:\n\tprint(c-b)", "a,b=map(int,input().split())\n\nif a%b==0 or b%a==0:\n print(a+b)\nelse:\n print(b-a)", "a,b=map(int,input().split());print(b+[a,-a][b%a>0])", "a,b = [int(x) for x in input().split()]\n\nif b%a==0:print(a+b)\nelse:print(b-a)", "a, b = map(int, input().split(\" \"))\nprint( b + a if b%a==0 else b - a )", "#include <stdio.h>\nint a,b;\nint main(){\n\tscanf(\"%d %d\",&a,&b);\n\tprintf(\"%d\",(b%a==0)?a+b:b-a);\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tprintf(\"%d\",(b%a==0?a+b:b-a));\n\treturn 0;\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tsc.close();\n\t\tSystem.out.println(b%a==0 ? a+b : b-a);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a,b;\n cin >> a >> b;\n b += b%a == 0 ? a : -a;\n cout << b << endl;\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tscan.close();\n\t\tSystem.out.println((b%a==0)? a+b:b-a);\n\t}\n}", "import java.util.*;\n\npublic class Main{\n\tpublic static void main (String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint result_1 = A + B;\n\t\tint result_2 = B - A;\n\t\tif (B % A == 0){\n\t\t\tSystem.out.println(result_1);\t\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(result_2);\n\t\t}\n\t}\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n if(B%A==0){\n System.out.println(A+B);\n }else{\n System.out.println(B-A);\n }\n }\n}", "a,b = map(int,input().split())\n\nans = b-a\nif b%a == 0:\n ans = a+b\nprint(ans)\n", "#include <iostream>\n\nint main()\n{\n int a, b;\n std::cin >> a >> b;\n std::cout << ( b%a==0 ? a+b : b-a ) << std::endl;\n}", "#!/usr/bin/env python2\n\"\"\"\nThis file is part of https://github.com/cheran-senthil/PyRival\nCopyright 2019 Cheran Senthilkumar <[email protected]>\n\n\"\"\"\nfrom __future__ import division, print_function\n\nimport itertools\nimport os\nimport sys\nfrom atexit import register\nfrom io import BytesIO\n\n\nclass dict(dict):\n \"\"\"dict() -> new empty dictionary\"\"\"\n\n def items(self):\n \"\"\"D.items() -> a set-like object providing a view on D's items\"\"\"\n return dict.iteritems(self)\n\n def keys(self):\n \"\"\"D.keys() -> a set-like object providing a view on D's keys\"\"\"\n return dict.iterkeys(self)\n\n def values(self):\n \"\"\"D.values() -> an object providing a view on D's values\"\"\"\n return dict.itervalues(self)\n\n\ndef gcd(x, y):\n \"\"\"greatest common divisor of x and y\"\"\"\n while y:\n x, y = y, x % y\n return x\n\n\nrange = xrange\n\nfilter = itertools.ifilter\nmap = itertools.imap\nzip = itertools.izip\n\nsys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))\nsys.stdout = BytesIO()\nregister(lambda: os.write(1, sys.stdout.getvalue()))\n\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\n\n\ndef main():\n a, b = map(int, input().split())\n\n if b % a == 0:\n print(a + b)\n else:\n print(b - a)\n\n\nif __name__ == '__main__':\n main()\n", "#include<stdio.h>\nint main(){\n\tint A,B;\n\tscanf(\"%d %d\", &A,&B);\n\tprintf(\"%d\\n\", (B%A == 0) ? A+B : B-A);\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tsc.close();\n\t\tSystem.out.println(B%A==0 ? A+B : B-A);\n\t}\n\n}", "t,x = map(int,input().split())\nif x % t == 0:\n print(t+x)\nelse:\n print(x-t)", "#include<iostream>\nusing namespace std;\nint main(){\n int a,b;\n cin>>a>>b;\n cout<<(b%a==0?a+b:b-a)<<endl;\n}", "A, B = map(int, raw_input().split())\nif B % A == 0:\n ans = A + B\nelse:\n ans = B - A\n\nprint str(ans)", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n Scanner key = new Scanner(System.in);\n int A = key.nextInt();\n int B = key.nextInt();\n System.out.println((B%A==0) ? (A+B) : (B-A));\n }\n}\n", "a, b = map(int, input().split())\nif b%a == 0:\n print(b+a)\nelse:\n print(b-a)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner reader = new Scanner(System.in);\n\t\tint a = reader.nextInt();\n\t\tint b = reader.nextInt();\n\n\t\tif (b % a == 0) {\n\t\t\tSystem.out.print(a+b);\n\t\t} else {\n\t\t\tSystem.out.print(b-a);\n\t\t}\n\t}\n\n\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int ans = b - a;\n if(b % a == 0) ans = a + b;\n System.out.println(ans);\n }\n}", "a,b = [int(k) for k in input().split()]\nif b%a:\n print(abs(b-a))\nelse:\n print(a+b)", "\n#include<iostream>\n\nint main() {\n\tint a, b;\n\tstd::cin >> a >> b;\n\n\tstd::cout << (b%a == 0 ? a + b : b - a) << \"\\n\";\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\t\n\t\tif (B%A==0)\n\t\t\tSystem.out.println(A+B);\n\t\telse\n\t\t\tSystem.out.println(B-A);\n\n\t\tsc.close();\n\t}\n\n}\n", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){ \n Scanner sc=new Scanner(System.in);\n int A=sc.nextInt();\n int B=sc.nextInt();\n int ans=B%A==0?A+B:B-A;\n System.out.println(ans);\n }\n}", "A, B = map(int, input().split())\nprint(B-A if B%A else A+B)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n \n if( B % A == 0 ){\n System.out.println(A+B);\n } else {\n System.out.println(B-A);\n }\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan= new Scanner(System.in);\n\t\tint a=scan.nextInt();\n\t\tint b=scan.nextInt();\n\t\tif(b%a==0) System.out.println(a+b);\n\t\telse System.out.println(Math.abs(b-a));\n\n\t}\n\n}\n", "a,b=map(int,input().split());print(b-a if b%a else b+a)\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String... args) {\n\t\t// 入力\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\n\t\tint result;\n\n\t\tif (b % a == 0)\n\t\t\tresult = a + b;\n\t\telse\n\t\t\tresult = b - a;\n\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a,b,c;cin>>a>>b;\n if(b%a==0) cout<<a+b<<endl;\n else cout<<b-a<<endl;\n}", "x,y=map(int,input().split())\nprint([y-x,x+y][y%x==0])", "A,B =[int(x) for x in input().split()]\nprint(A+B if B%A==0 else B-A)", "#A\na,b = map(int,input().split())\n\nprint((a+b) if b%a==0 else (b-a))", "x,y=list(map(int, input().split()))\nif y%x==0:\n\tprint(x+y)\nelse:\n\tprint(y-x)", "import java.util.*;\n \npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int ans = 0;\n ans = b%a==0 ? a+b:b-a;\n System.out.println(ans);\n }\n }", "import java.util.*;\n\npublic class Main {\n\n static final int MOD = 1000000007;\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt(),b=sc.nextInt();\n System.out.println(b%a==0?a+b:b-a);\n\n }\n}\n", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if ((b % a) == 0)\n System.out.println(a + b);\n else\n System.out.println(b - a);\n }\n}\n", "#include <stdio.h>\n\nint main(){\nint a,b;\nscanf(\"%d %d\", &a,&b);\n(b%a==0) ? printf(\"%d\",b+a) : printf(\"%d\",b-a);\n\n\t\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tif(B%A == 0) {\n\t\t\tSystem.out.println(A+B);\n\t\t}\n\t\telse System.out.println(B-A);\n\t\t\n\t\t//System.out.println();\n\t}\n}", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\nif(b%a==0){\n\tSystem.out.println(a+b);\n}else{\n\t\tSystem.out.println(b-a);\n\t\t\n\t}}}", "(A, B) = map(int,input().split())\nif B % A == 0:\n print(A+B)\nelse:\n print(B-A)", "A,B=input().split()\nA=int(A)\nB=int(B)\nprint((B%A==0)*(A+B)+(B%A!=0)*(B-A))", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;\n cin>>a>>b;\n cout<<(b%a?b-a:b+a);\n return 0;\n}", "#118 A\nA,B= map(int,input().split())\nprint(A+B if B%A==0 else B-A)", "import java.util.*;\n \nclass Main {\n public static void main(String[] args) {\n \n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n \n if(B%A==0){System.out.println(A+B);}\n else{System.out.println(B-A);}\n\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a,b;\n cin>>a>>b;\n if(b%a==0) cout<<a+b;\n else cout<<b-a;\n}\n", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n System.out.println(b%a == 0 ? b+a : b-a);\n }\n}", "#include <cstdio>\nint A, B;\n \nint main() {\n scanf(\" %d%d\", &A, &B);\n printf(\"%d\\n\", ((B % A) == 0) ? (A+B) : (B-A));\n return 0;\n}", "a,b = map(int,input().split(\" \"))\nif (b%a == 0):\n print(a+b)\nelse :\n print(b-a)", "a, b = map(int, input().split(\" \"))\nprint(a+b if b%a == 0 else b-a)", "#include<iostream>\nusing namespace std;\nint a,b;\nint main()\n{\ncin>>a>>b;\nif(b%a)cout<<b-a<<endl;\nelse cout<<a+b<<endl;\nreturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b,c;\n cin>>a>>b;\n c=(b%a==0)?a+b:b-a;\n cout<< c;\n}", "a,b = (int(i) for i in input().split())\nif b%a: print(b-a)\nelse: print(a+b)", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint a,b;cin>>a>>b;\n\tif(b%a){\n\t\tcout<<b-a<<endl;\n\t}else{\n\t\tcout<<a+b<<endl;\n\t}\n\treturn 0;\n}", "A, B = list(map(int, input().split()))\nprint((B-A) if B%A else (A+B))", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n\tint A, B;\n\tcin >> A >> B;\n\n\tcout << ((B % A == 0) ? A + B : B - A) << endl;\n\treturn 0;\n}\n", "# -*- coding: utf-8 -*-\n\na, b = map(int, raw_input().split())\n\nans = 0\n\nif b%a == 0:\n ans = a+b\nelse:\n ans = b-a\n\nprint ans\n", "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt(); int b = sc.nextInt();\n if (b % a == 0) {\n System.out.println(b + a);\n } else {\n System.out.println(b - a);\n }\n }\n}", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n\tint a, b;\n \tcin >> a >> b;\n \tif (b % a) cout << b - a;\n \telse cout << a + b;\n}", "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n \tScanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n if (B % A == 0) {\n System.out.println(A + B);\n } else {\n System.out.println(B - A);\n }\n }\n}", "#include<bits/stdc++.h>\nint main()\n{\n\tint a,b;\n\tstd::cin>>a>>b;\n\tif(b%a==0)\n\t{\n\t\tstd::cout<<a+b;\n\t}\n\telse\n\t{\n\t\tstd::cout<<b-a;\n\t}\n\texit(0);\n}", "#include <iostream>\n\nusing namespace std;\n\nint main(){\nint A,B;\n cin>>A>>B;\n if(B%A==0){cout<<A+B<<endl;}else{cout<<B-A<<endl;}\n}\n", "A,B = map(int,input().split())\nprint(A+B) if B//A == B/A else print(B-A)", "a,b=map(int,input().split())\nc=b//a\nif c*a==b:\n print(a+b)\nelse:\n print(b-a)", "#include <iostream>\nusing namespace std;\nint main(void) {\n\tint A,B;\n\tcin >> A >> B;\n\tif (B%A == 0) {\n\t\tcout<<A+B;\n\t}\n\telse {\n\t\tcout << B-A;\n\t}\n}", "import java.util.Arrays;\nimport java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(b%a==0){\n System.out.println(a+b);\n }else{\n System.out.println(b-a);\n }\n }\n}\n", "A, B = map(int, input().split())\nprint(A+B) if(B % A == 0) else print(B-A)\n", "A,B=map(int, raw_input().split())\nprint A+B if B%A==0 else B-A\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n if (B % A == 0) System.out.println(A + B);\n else System.out.println(B - A);\n }\n}\n", "#include <iostream>\n\nint main() {\n int A, B;\n std::cin >> A >> B;\n std::cout << ((B%A)==0? A + B: B - A) << std::endl;\n return 0;\n}\n", "a, b = map(int, raw_input().strip().split(' '))\n\nif b % a == 0 : \n print a + b\nelse : \n print b - a\n", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[]args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint A = 0,B = 0,x = 0;\n\n\t\tA = sc.nextInt();\n\t\tB = sc.nextInt();\n\t\tx = B % A;\n\n\t\tif(x == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t}else {\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tSystem.out.println(b % a == 0 ? (a + b) : (b - a));\n\t}\n}", "A, B = map(int, input().split())\n\nprint(A+B if B%A==0 else B-A)", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\t// get a integer\n\t\tint A = sc.nextInt();\n\t\t// get two integers separated with half-width break\n\t\tint B = sc.nextInt();\n\n\t\tif ((B % A) == 0)\n\t\t\tSystem.out.println(A+B);\n\t\telse \n\t\t\tSystem.out.println(B-A);\n\t}\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a, b;\n cin >> a >>b;\n cout << (b%a ? b-a : a+b) << endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\n\t\tif (B % A == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t} else {\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\t}\n}", "a,s=map(int,input().split())\nif s%a==0:\n print(a+s)\nelse:\n print(s-a)", "import java.util.*;\n\npublic class Main {\n public static void main(String... args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n if (B % A == 0) System.out.println(A + B);\n else System.out.println(B - A);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a,b;\n\t\ta = sc.nextInt();\n\t\tb = sc.nextInt();\n\t\t\n\t\tif(b%a==0) \n\t\t\tSystem.out.println(a+b);\n\t\telse\n\t\t\tSystem.out.println(b-a);\n\t}\n}\n", "#include<stdio.h>\nint main()\n{\n\tint a, b, c;\n\tscanf(\"%d%d\", &a, &b);\n\tc = b % a == 0 ? a + b : b - a;\n\tprintf(\"%d\", c);\n\treturn 0;\n}", "#include <iostream>\n\nint main() {\n int A, B;\n std::cin >> A >> B;\n std::cout << (B + ((B % A) ? -A : A)) << std::endl;\n}\n", "import sys\nfrom collections import deque\nimport copy\nimport math\ndef get_read_func(fileobject):\n if fileobject == None :\n return raw_input\n else:\n return fileobject.readline\n\ndef main():\n if len(sys.argv) > 1:\n f = open(sys.argv[1])\n else:\n f = None\n read_func = get_read_func(f);\n input_raw = read_func().strip().split()\n [A, B] = [int(input_raw[0]), int(input_raw[1])]\n if B % A == 0:\n print A+B\n else:\n print B-A\n\nif __name__ == '__main__':\n main()\n", "A,B=map(int,input().split());print([B-A,A+B][B%A==0])\n", "a,b=map(int,input().split())\n\nif b%a==0:\n\tres=b+a\nelse:\n\tres=b-a\n\nprint(res)", "a,b=map(int,input().split())\nif (b%a) == 0:\n print(a+b)\nelse:\n print(b-a)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc=new Scanner(System.in);\n\n\t\tint A=sc.nextInt();\n\t\tint B=sc.nextInt();\n\n\t\tint ans=0;\n\n\t\tif(B%A==0) ans=A+B;\n\t\telse ans=B-A;\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\n\t}\n\n}\n", "A,B=map(int,input().split());print(B-A if B%A else A+B)", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tif(b%a == 0) {\n\t\t\tSystem.out.println(a+b);\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\t\t\n\t\t\n\t\t\n }\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint a, b;\nint main()\n{\n\tcin >> a >> b;\n\tcout << ((b % a) ? b - a : a + b) << endl;\n\treturn 0;\n}\n", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int a, b; cin >> a >> b;\n cout << ((b % a == 0) ? a + b : b - a) << endl;\n return 0;\n}", "a,b = map(int, input().split())\nif (b//a) * a == b:\n print(a+b)\nelse:\n print(b-a)", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(b%a == 0){\n System.out.print(a+b);\n }else{\n System.out.print(b-a);\n }\n }\n}", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t int b = sc.nextInt(); \n\t if(b%a == 0) System.out.println(a+b);\n\t else System.out.println(b-a);\n\t}\n}", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint a, b; cin >> a >> b;\n \tif (b % a) cout << b - a;\n \telse cout << b + a;\n return 0;\n}", "#include <iostream>\nusing namespace std;\nint main() {\n int A,B; cin>>A>>B;\n printf(\"%d\\n\", B%A==0 ? A+B : B-A );\n}", "import java.util.*;\n class Main{\n\n public static void main(String []args){\n Scanner sc=new Scanner(System.in);\n int a=sc.nextInt();\n int b=sc.nextInt();\n if(b%a==0)\n System.out.println(a+b);\n else\n System.out.println(b-a);\n }\n}", "import java.util.Scanner;\nclass Main{\n public static void main(String args[]){\n Scanner scan=new Scanner(System.in);\n int a=scan.nextInt();\n int b=scan.nextInt();\n int ans=0;\n if(b%a==0){\n ans=a+b;\n }else{\n ans=b-a;\n }\n System.out.println(ans);\n }\n}\n", "a,b=map(int,input().split());print(a+b-2*a*(b%a>0))", "a,b=map(int,open(0).read().split())\nprint(a+b) if b%a==0 else print(b-a)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int A,B;\n cin>>A>>B;\n int ans=B-A;\n if(B%A==0) ans=A+B;\n cout<<ans<<endl;\n }", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tsc.close();\n\n\t\tif (b % a == 0) {\n\t\t\tSystem.out.println(a + b);\n\t\t} else {\n\t\t\tSystem.out.println(b - a);\n\t\t}\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\t\n\t\tif(b%a==0){\n\t\t\tSystem.out.println(a+b);\n\t\t}else{\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\t\n\t\tif(b%a==0)System.out.println(a+b);\n\t\telse System.out.println(b-a);\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint A, B;\n\tcin >> A >> B;\n\tif (B % A) cout << B - A;\n\telse cout << A + B;\n}", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tif(b % a ==0) System.out.println(a+b);\n\t\telse System.out.println(b-a);\n\t\tsc = null;\n\t}\n}\n", "#include\"bits/stdc++.h\"\nusing namespace std;\nlong long a,b;\nint main()\n{\n cin>>a>>b;\n if(b%a==0)\n cout<<a+b;\n else\n cout<<abs(a-b);\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n\n if (b % a == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n }\n}", "a,b = map(int,input().split(\" \"))\nif b % a == 0:\n print(a + b)\nelse:\n print(b-a)", "# -*- coding: utf-8 -*-\nimport sys\n\ndef io_generator():\n\twhile True:\n\t\tyield raw_input()\n\n#+++++++++++++++++++\n\ndef main(io):\n\ta,b= map(int, io.next().split())\n\tif b%a==0:\n\t\treturn a+b\n\telse:\n\t\treturn b-a\n\n#++++++++++++++++++++\n\nif __name__ == \"__main__\":\n\tio=io_generator()\n\tprint main(io)\n", "A, B = map(int, input().split())\nprint(A + B if B / A == int(B / A) else B - A)\n", "a,b = map(int,(input().split()))\nif b%a==0:\n print(a+b)\nelse:\n print(b-a)", "A, B = map(int, input().split())\nprint(A + B if not B % A else B - A)", "#include <iostream>\n\nint main(){\n int a, b;\n std::cin>>a>>b;\n \n if(b%a==0){\n std::cout<<a+b<<\"\\n\";\n }else{\n std::cout<<b-a<<\"\\n\";\n }\n}", "a, b = map(int, input().split());print(b - a if b % a else a + b)\n", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int x,y;\n x = sc.nextInt();\n y = sc.nextInt();\n if(y%x==0){\n System.out.println(x+y);\n }\n else{\n System.out.println(y-x);\n }\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner stdin = new Scanner(System.in);\n\t\tint a = stdin.nextInt();\n\t\tint b = stdin.nextInt();\n\t\tif(b%a==0) {\n\t\t\tSystem.out.println(a+b);\n\t\t}else {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint A,B;\n\tcin>>A;\n\tcin>>B;\n\tif(B%A==0){\n\t\tcout<<(B+A);\n\t}else{\n\t\tcout<<(B-A);\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int A,B;\n cin >> A >> B;\n cout << ((B % A == 0) ? A + B : B - A) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int A, B;\n cin >> A >> B;\n cout << (B % A ? B - A : B + A) << endl;\n}", "A,B=list(map(int,input().split()))\nprint((A+B)*(B%A==0)+(B-A)*(B%A>0))", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt(),\n B = sc.nextInt();\n if(B%A > 0){\n System.out.println(B-A);\n } else{\n System.out.println(A+B);\n }\n }\n}", "A,B=map(int,input().split())\nmod=B%A\nif mod==0:\n print(A+B)\nelse:\n print(B-A)", "A,B=tuple(map(int,input().split()))\nif B%A==0:\n print(A+B)\nelse:\n print(B-A)", "#include <bits/stdc++.h>\nusing namespace std;\nint a, b;\nint main(){\n cin >> a >> b;\n cout << (b%a == 0 ? a + b : b - a) << endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint numA = scanner.nextInt();\n\t\tint numB = scanner.nextInt();\n\t\tint ans;\n\t\tif(numB % numA ==0){\n\t\t\tans = numA + numB;\n\t\t}else{\n\t\t\tans = numB - numA;\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tscanner.close();\n\t}\n\t\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) {\n try (Scanner in = new Scanner(System.in)) {\n int A = in.nextInt();\n int B = in.nextInt();\n System.out.println(B % A == 0 ? (A + B) : (B - A));\n }\n }\n}\n", "# include <iostream>\n\nusing namespace std;\n\nint main () {\n int a,b;\n cin>>a>>b;\n if(b%a==0) cout<<(a+b);\n else cout<<(b-a);\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\nint a,b;\ncin>>a>>b;\nif(b%a==0)cout<<a+b;\nelse cout <<b-a;\ncout<<endl;\n\nreturn 0;\n\n}\n", "#include <iostream>\nint main(){\n long long a,b;\n std::cin >> a >> b;\nif (b % a == 0) std::cout << a+ b;\nelse std::cout << b - a;\n}", "A, B = map(int, raw_input().split())\n\nif B%A == 0:\n print '{}'.format(A+B)\nelse: # B%A != 0\n print '{}'.format(B-A)\n", "A,B=map(int,input().split())\nprint((A+B,B-A)[B%A!=0])", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a , b;\n cin >> a >> b;\n cout << (b%a==0 ? b+a : b-a) << endl;\n}", "#include <stdio.h>\n\nint main() {\n int A, B;\n scanf(\"%d %d\", &A, &B);\n printf(\"%d\\n\", (B%A) ? B-A : A+B);\n return 0;\n}\n", "#include<iostream>\nusing namespace std;\nint main() {\n int a, b;\n cin >> b >> a;\n if(a%b) cout << a-b << endl;\n else cout << a+b << endl;\n}", "A, B = list(map(int, input().split()))\nprint(B-A if B%A else A+B)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int a, b;\n cin >> a >> b;\n cout << b + (b % a == 0 ? a : -a)<< endl;\n}", "A,B = map(int,input().split())\nC = B%A\nif (C == 0):\n print(A+B)\nelse:\n print(B-A)", "#18:39\na,b = map(int,input().split())\nif b % a == 0:\n print(b+a)\nelse:\n print(b-a)", "A,B=map(int,input().split(' '))\nif B%A==0:\n print(A+B)\nelse:\n print(B-A)", "a, b = map(int, input().split(' '))\nprint(a + b) if b % a == 0 else print(b - a)", "#include<stdio.h>\nint main(){\n\tint i,j,n,m;\n\tscanf(\"%d%d\",&n,&m);\n\tif(m%n==0) printf(\"%d\\n\",n+m);\n\telse printf(\"%d\\n\",m-n);\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint a = scanner.nextInt(), b = scanner.nextInt();\n\t\t\tSystem.out.println((0 == b % a) ? a + b : b - a);\n\t\t}\n\t}\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n int A,B;\n cin>>A>>B;\n if(B%A==0)cout<<A+B;\n else cout<<B-A;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int A, B;\n cin >> A >> B;\n cout << (B%A == 0 ? A + B : B - A);\n}", "A,B = map(int,input().split())\nans = B - A\nif B % A == 0:\n ans = A + B\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tsc.close();\n\t\tif (B % A == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t} else {\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\t}\n}\n", "#include <cstdio>\nint main () {\n int A, B;\n scanf(\"%d %d\", &A, &B)+1;\n \n printf(\"%d\", (B % A == 0) ? B + A : B - A);\n \n return 0;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if (b % a == 0) System.out.println(a + b);\n else System.out.println(b - a);\n }\n}", "[a,b]=map(int,input().split())\nprint(a+b if b%a==0 else b-a)\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if (b % a == 0) {\n System.out.println(a + b);\n return;\n }\n System.out.println(b - a);\n }\n\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[]args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\tSystem.out.println((b/a*a==b)?a+b:b-a);\n\t}\n}", "A, B = map(int, input().split())\n\nif B % A == 0:\n print(A+B)\nelse:\n print(B-A)", "#include <stdio.h>\n\nint main(){\n\tint A, B;\n\tscanf(\"%d %d\", &A, &B);\n\t\n\tB%A==0?printf(\"%d\", A+B):printf(\"%d\", B-A);\n\t\n\n\treturn 0;\n}\n", "a,b=input().split()\na=int(a)\nb=int(b)\nif b%a==0:\n print(a+b)\nelse:\n print(b-a)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int x,y;\n cin >> x >> y;\n\n cout << (y%x==0?y+x:y-x);\n}", "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n if (B % A == 0) {\n System.out.println(A + B);\n } else {\n System.out.println(B - A);\n }\n }\n}", "a, b = map(int, raw_input().split())\nd = b + a\nx = b - a\nif b % a == 0:\n print d\nelse:\n print x", "#include <iostream>\n\nint main(){\nint A;\nint B;\nscanf(\"%d %d\",&A,&B);\nif(B%A==0){\n printf(\"%d\",A+B);\n}\n\nelse{\n printf(\"%d\",B-A);\n}\n \n }", "A,B = map(int,input().split())\nprint(A+B-2*A*(B%A>0))", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n \n Scanner sc = new Scanner(System.in);\n \n int numberA = sc.nextInt();\n int numberB = sc.nextInt();\n \n if(numberB%numberA == 0){\n System.out.println(numberA + numberB);\n }else {\n System.out.println(numberB - numberA);\n }\n \n }\n}", "a, b = map(int, input().split(' '))\nprint(a + b if b % a == 0 else b - a)", "a,b=map(int,input().split())\nprint([b-a,b+a][b%a==0])", "N,K=map(int,input().split())\nprint(N+K if K%N==0 else K-N)", "import java.util.Scanner;\n\nclass Main{\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\t\t\t//文字の入力\n\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tif(b%a == 0){\n\t\t\tSystem.out.println(a + b);\n\t\t}else{\n\t\t\tSystem.out.println(b - a);\n\t\t}\n\t}\n}\n\n", "(a, b) = map(int, input().split())\nprint(a + b if b % a == 0 else b - a)", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint A, B;\n\tcin>>A>>B;\n\tif(B%A==0){\n\t\tcout<<A+B;\n\t} else{\n\t\tcout<<B-A;\n\t}\n\treturn 0;\n}\n", "#include <cstdio>\n\nint main(){\n int a,b;\n scanf(\"%d%d\",&a,&b);\n if(b%a==0) printf(\"%d\",a+b);\n else printf(\"%d\",b-a);\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint a,b;\n\nint main()\n{\n cin >> a >> b;\n if(b % a == 0) cout << a+b;\n else cout << b-a;\n}", "import java.util.Scanner;\n\nclass Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n if (b % a == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n }\n\n}\n", "A, B = (int(x) for x in input().split())\nprint(A+B if B%A==0 else B-A)", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int a = Integer.parseInt(sc.next());\n int b = Integer.parseInt(sc.next());\n\n System.out.println((b % a == 0) ? a + b : b - a);\n }\n}\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n int a, b;\n \tcin >> a >> b;\n cout << (b % a < 1 ? a + b : b - a) << endl;\n}", "import java.util.Scanner;\n\n//AtCoder Beginner Contest 118\n//A\tB +/- A\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tsc.close();\n\t\tSystem.out.println((B % A) == 0 ? B + A : B - A);\n\t}\n}\n", "a,b = map(int,input().split())\nif b%a:\n print(b-a)\nelse:\n print(b+a)", "#include<cstdio>\nint main(){\n int a,b;\n scanf(\"%d%d\",&a,&b);\n printf(\"%d\",(b%a==0)?(a+b):(b-a));\n return 0;\n}", "a,b=map(int,input().split())\nif b/a==(int(b/a)):\n print(a+b)\nelse:\n print(b-a)", "a,b = map(int,input().split())\nanswer = a+b if b%a==0 else b-a\nprint(answer)", "a,b=[int(i) for i in input().split()];print([a+b,b-a][b%a!=0])", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b;\nint main(){\n\tcin>>a>>b; \n\tif(b%a==0) cout<<a+b<<endl;\n\telse cout<<b-a<<endl;\n\treturn 0;\n}", "A, B = map(int, input().split())\nprint([A + B, B - A][not(B % A == 0)])\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong a = sc.nextLong();\n\t\tlong b = sc.nextLong();\n\t\tSystem.out.println(b % a == 0 ? a + b : b - a);\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int A,B;\n cin >> A >> B;\n cout << (B%A ? B-A : A+B) << endl;\n}", "m,n=map(int,input().split())\nprint(m+n if n%m==0 else n-m)\n", "#include <iostream> \nusing namespace std;\n\nint main()\n{\n int A,B;\n cin >> A >> B;\n if(B%A == 0)\n cout << B+A;\n else \n cout << B - A;\n}\n", "A, B = list(map(int, input().split()))\nprint(A+B if B%A==0 else B-A)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tCalc c = new Calc();\n\t\tc.abc118A();\n\t}\n}\n\nclass Calc{\n\tvoid abc118A() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tif(b%a == 0) {\n\t\t\tSystem.out.println(a+b);\n\t\t}else {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\t}\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint A = in.nextInt();\n\t\tint B = in.nextInt();\n\t\tif (B % A == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t} else {\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\t}\n}\n", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n System.out.println((b % a == 0) ? a + b : b - a);\n }\n}\n", "A,B = map(int,input().split())\n\nprint([A+B,B-A][B%A!=0])", "#include <iostream>\nint main(){\n int A, B;\n std::cin >> A >> B;\n std::cout << (B % A ? B - A : B + A) << \"\\n\";\n}", "a,b=map(int,input().split())\nif(int(b%a)==0):\n print(a+b)\nelse:\n print(b-a)", "import java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt(), B = sc.nextInt();\n\t\tif (B%A == 0) System.out.println(A+B);\n\t\telse System.out.println(B-A);\n\t}\n\n}", "a,b=map(int,input().split());print(b+a*(2*(not b%a)-1))", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int a,b;\n cin>>a>>b;\n if(b%a) cout<<b-a;\n else cout<<a+b;\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n \tScanner sc = new Scanner(System.in);\n \n \tint A = sc.nextInt(), B = sc.nextInt();\n \tif (B % A == 0) {\n \tSystem.out.println(A+B);\n } else {\n \tSystem.out.println(B-A);\n }\n }\n}", "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(b % a == 0){\n System.out.println(a+b);\n }else{\n System.out.println(b-a);\n }\n }\n}\n", "#include <iostream>\nusing namespace std;\nint main()\n{\n\tint x, y;\n\tcin >> x >>y;\n\tif (y%x == 0)\n\t\tcout << x + y;\n\telse\n\t\tcout << y - x;\n\n\n}", "#include<cstdio>\n\nint a,b;\n\nint main() {\n\tscanf(\"%d%d\",&a,&b);\n\tif(b%a==0)\n\t\tprintf(\"%d\\n\",b+a);\n\telse printf(\"%d\\n\",b-a);\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(b % a == 0) System.out.println(a + b);\n else System.out.println(b - a);\n \n } \n}", "#include <bits/stdc++.h>\nusing namespace std;\nint a, b;\nint main()\n{\n\tcin >> a >> b;\n\tcout << ((b % a == 0)?(a + b):(b - a));\n\tcout << endl;\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tSystem.out.println(b + a * (b % a == 0 ? 1 : -1));\n\t}\n}", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint a,b;\n\tcin>>a>>b;\n\tcout<<(b+(b%a==0?a:-a));\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\nint main(){\n int a,b,c;\n cin>>a>>b;\n if(b%a==0) c=a+b;\n else c=b-a;\n cout<<c<<endl;\n return 0;\n}", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n long long a, b;\n cin >> a >> b;\n cout << (b % a == 0? a + b:b - a);\n}", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n int A, B;\n cin >> A >> B;\n cout << (B%A == 0 ? A + B : B - A);\n return 0;\n}\n", "a,s=map(int,input().split())\nif s%a:\n print(s-a)\nelse:\n print(a+s)\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a, b;\n cin >> a >> b;\n\n cout << (b % a == 0 ? (a + b) : (b - a)) << endl;\n}\n", "a, b = map(int, raw_input().split())\nif b%a == 0:\n print a + b\nelse:\n print b - a", "a, b = (int(i) for i in input().split()) \nprint(a+b if b%a == 0 else b-a)\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\n\t\tif (b % a == 0) {\n\t\t\tSystem.out.print(a + b);\n\t\t} else {\n\t\t\tSystem.out.print(b - a);\n\t\t}\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n\n cout << (m % n == 0 ? n + m : m - n) << endl;\n}", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tint a;\n\t\tint b;\n\t\tint c=0;\n\t\tScanner sc = new Scanner(System.in);\n\t\ta = sc.nextInt();\n\t\tb = sc.nextInt();\n\n\t\tif(b%a==0){\n\t\t\tc=a+b;\n\t\t} else {\n\t\t\tc=b-a;\n\t\t}\n\n\t\tSystem.out.println(c);\n\t\treturn;\n\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main(){\n int a,b;cin>>a>>b;int c;\n if(b%a==0)c=a+b;\n else c=b-a;\n cout << c << endl;\n}", "a,b=map(int,input().split())\nprint([a+b,b-a][b%a>0])", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int a,b;\n cin>>a>>b;\n if(b%a==0)cout<<a+b;\n else cout<<b-a;\nreturn 0;\n}\n", "A,B = map(int,input().split())\nif B%A==0:\n print(B+A)\nelse:\n print(B-A)", "A,B = [int(x) for x in input().split()]\nif B%A==0:\n print(A+B)\nelse:\n print(B-A)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\n\t\tif (b % a == 0) {\n\t\t\tSystem.out.println(a+b);\n\n\t\t} else {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\t}\n}", "#include<iostream>\n\nint main() {\n\tint a, b;\n\t\tstd::cin >> a >> b;\n\t\tif (b%a == 0)printf(\"%d\", a + b);\n\t\telse printf(\"%d\", b - a);\n}", "a, b = [int(i) for i in input().split()]\nprint([a+b,b-a][b%a!=0])", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt(), B = sc.nextInt();\n\t\tif(B%A == 0)System.out.println(A+B);\n\t\telse System.out.println(B-A);\n\t\tsc.close();\n\t}\n\n}", "a,b = map(int, input().split())\nif b%a == 0:\n x = b + a\nelse:\n x = b - a\nprint(x)", "#include<stdio.h>\n\nint main()\n{\n int a,b;\n scanf(\"%d%d\",&a,&b);\n \n printf(\"%d\\n\",(b%a)? b-a:a+b);\n return 0;\n}", "\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a,b=0;\n\t\t\n\t\ta=sc.nextInt();\n\t\tb=sc.nextInt();\n\t\t\n\t\tif(b%a==0)System.out.println(a+b);\n\t\telse System.out.println(b-a);\n\t\t\n\t}\n\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a=sc.nextInt(),b=sc.nextInt();\n\t\tSystem.out.println(b%a==0?a+b:b-a);\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt(), b = sc.nextInt();\n if(b % a == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\t@SuppressWarnings(\"resource\")\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a = scanner.nextInt();\n\t\tint b = scanner.nextInt();\n\n\t\tif (b % a == 0) {\n\t\t\tSystem.out.println(a+b);\n\t\t} else {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\n\t}\n\n}", "import java.util.Scanner;\n\nclass Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n System.out.println( b%a==0?a+b:b-a );\n }\n}\n", "A,B=map(int,input().split())\na=0\nif B%A==0:\n a=A+B\nelse:\n a=B-A\nprint(a)", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int result = (B%A) !=0 ? B-A : A+B;\n System.out.println(result);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a,b;\n\tcin>>a>>b;\n\tif(b%a==0)\n\t{\n\t\tcout<<a+b;\n\t}\n\telse\n\tcout<<b-a;\n\treturn 0;\n}", "A, B = [int(x) for x in input().split()]\nprint(A+B if (B%A == 0) else B-A)\n", "a,b = map(int,input().split())\nif(b%a==0):\n print(a+b)\nelse:\n print(b-a)", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int t,x;\n cin >>t>>x;\n if(x%t==0){cout<<t+x<<endl;}\n else{cout<<x-t<<endl;}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int A,B;cin>>A>>B;\n int ans=(B%A==0) ? (A+B) : (B-A);\n cout<< ans <<endl;\n}", "import java.util.Scanner;\n\n class Main{\n public static void main(String args[]){\n Scanner scan = new Scanner(System.in);\n\n int a = scan.nextInt();\n int b = scan.nextInt();\n\n if(b%a==0){\n System.out.println(a+b);\n }else {\n System.out.println(b-a);\n }\n }\n }", "#include<iostream>\nusing namespace std;\nint a,b;\nint main(){\n\tcin>>a>>b;\n\tif(b%a==0) cout<<a+b;\n\telse cout<<b-a;\n\treturn 0;\n} ", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n \n int result = b - a;\n if (b % a == 0) result = a + b;\n \n System.out.println(result);\n }\n}\n", "import java.util.Scanner;\n\n//Scanner sc = new Scanner(System.in);\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\t\n\t\tif(B%A == 0) System.out.println(A + B);\n\t\telse System.out.println(B - A);\n\t\t\n\t}\n}\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n int A,B;\n cin >> A >> B;\n int ans=0;\n ans=B%A==0?A+B:B-A;\n cout << ans;\n}", "a,b=map(int,input().split())\nans = a+b if (b%a==0) else b-a\nprint(ans)\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\n\t\tif (B % A == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t} else {\n\t\t\tSystem.out.println(Math.abs(A - B));\n\t\t}\n\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;\n cin>>a>>b;\n if(b%a==0)cout<<a+b<<endl;\n else cout<<b-a<<endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;cin>>a>>b;\n b%a==0?cout<<a+b:cout<<b-a;\n}", "n,m = map(int,input().split())\nif m%n==0:\n print(m+n)\nelse:\n print(m-n)", "A,B=map(int,input().split())\nprint([B-A,A+B][B%A==0])", "import java.util.*;\n\nclass Main{\npublic static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\nint A=sc.nextInt();\nint B=sc.nextInt();\n if((B%A)==0){\nSystem.out.println(A+B);\n }else{\n System.out.println(B-A);\n }\n}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint A = scanner.nextInt();\n\t\tint B = scanner.nextInt();\n\t\tif (B % A == 0)\n\t\t\tSystem.out.println(A + B);\n\t\telse\n\t\t\tSystem.out.println(B - A);\n\t\tscanner.close();\n\t}\n}", "#118a\na,b=map(int,input().split())\nif b%a==0:\n print(a+b)\nelse:\n print(b-a)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int A, B;\n cin >> A >> B;\n cout << ((B % A) ? B - A : A + B) << \"\\n\";\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int A,B; cin>>A>>B;\n if(B%A){cout<<B-A;}\n else{cout<<A+B;}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint a,b;\n \tcin >> a >> b;\n \tcout << (b%a==0?a+b:b-a);\n \treturn 0;\n}", "a,b=map(int,input().split());print(b-a*(2*(b%a>0)-1))", "a,b = map(int, input().split())\nif b % a:\n print(b-a)\nelse:\n print(a+b)", "a,b=map(int,input().split());print(a+b if b%a==0 else b-a)", "#include <iostream>\nusing namespace std;\n\nint main(){\n int A,B;\n cin>>A>>B;\n if(!(B%A))cout<<B+A<<endl;\n else cout<<B-A<<endl;\n}", "A,B=map(int,input().split());print(A+B if B%A==0 else B-A)", "A,B=map(int,input().split(\" \"))\nif(B%A==0):\n print(A+B)\nelse:\n print(B-A)", "a,b = map(int,input().split())\n\nif b%a != 0:\n print(b-a)\nelse:\n print(b+a)", "#include<iostream>\nusing namespace std;\n\nint main(){\n \n int a,b;\n cin >> a >> b;\n \n cout << ( (b*100/a) % 100 == 0? a+b : b-a ) << endl;\n \n}", "import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tif (b % a == 0) {\n\t\t\tSystem.out.println(a + b);\n\t\t} else {\n\t\t\tSystem.out.println(b - a);\n\t\t}\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n private static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n int a = sc.nextInt(), b = sc.nextInt();\n System.out.println(b % a == 0 ? a + b : b - a);\n }\n}", "#include <iostream>\n\nint main(){\n\tint a, b;\n\tstd::cin>>a>>b;\n\tif(b%a==0) std::cout<<a+b<<'\\n';\n\telse{\n\t\tstd::cout<<b-a<<'\\n';\n\t\t}\n\t\n\treturn 0;\n\t}\n", "[A,B] = list(map(int,input().split()))\n\nif B%A == 0:\n print(A+B)\nelse:\n print(B-A)", "A,B=input().split()\na=int(A)\nb=int(B)\nif b%a==0:\n print(a+b)\nelse:\n print(b-a)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = Integer.parseInt(sc.next());\n\t\tint b = Integer.parseInt(sc.next());\n\t\tsc.close();\n\n\t\tif(b % a == 0) {\n\t\t\tSystem.out.println((a+b));\n\t\t}else {\n\t\t\tSystem.out.println((b-a));\n\t\t}\n\n\t}\n\n}\n", "#include <stdio.h>\nint a, b;\nint main () {\n scanf(\"%d%d\", &a, &b);\n if (b % a == 0) printf(\"%d\\n\", a + b);\n else printf(\"%d\\n\", b - a);\n}", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint A = scan.nextInt();\n\t\tint B = scan.nextInt();\n\t\tscan.close();\n\n\t\tSystem.out.println(B % A == 0 ? A + B : B - A);\n\t}\n}", "a,b = (int(j) for j in input().split())\nif b%a == 0:\n print(a+b)\nelse:\n print(b-a)", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main () {\n int A, B;\n cin >> A >> B;\n cout << ((B % A == 0) ? B + A : B - A) << \"\\n\";\n}\n", "# include<bits/stdc++.h>\nusing namespace std;\nint m,n;\nint main()\n{ cin>>n>>m;\n if(!(m%n))cout<<m+n;\n else cout<<m-n;\n return 0;\n}\n\n", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\n# AtCoder Beginner Contest 118：A - B +- A\n\n\ndef main():\n A, B = [int(i) for i in raw_input().strip().split(' ')]\n\n if B % A == 0:\n print A+B\n else:\n print B-A\n\n\nif __name__ == '__main__':\n main()\n", "public class Main {\n private static java.util.Scanner scanner = new java.util.Scanner(System.in);\n\n public static void main(String[] args) {\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n System.out.println(b % a == 0 ? a + b : b - a);\n }\n}", "#include <iostream>\n#include <cstdlib>\n\nint main()\n{\n int a,b;\n std::cin >>a>>b;\n \n std::cout<< ( b/a*a==b?b+a:b-a);\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n \t//データ取り込み\n\t\tScanner sc = new Scanner(System.in);\n \t\n\t\tint A = sc.nextInt();\n \tint B = sc.nextInt();\n \tif(B%A ==0){\n \tSystem.out.println(A+B);\n }else{\n \tSystem.out.println(B-A);\n }\n\t\t\n }\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\nint i, a, b;\ncin >> a >> b;\nif(b%a==0)\ncout << a+b;\nelse\ncout << b-a;\n\nreturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint a,b;\n\tcin>>a>>b;\n\tint z=(b%a==0)?a+b:b-a;\n\tcout<<z<<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a,b;\n cin>>a>>b;\n if(b%a==0)cout<<b+a<<endl;\n else cout<<b-a<<endl;\n}\n", "#include <iostream>\n\nusing namespace std;\n\nint main(int argc, char* argv[]) {\n\tint a,b;\n\tcin>>a>>b;\n\tcout << (b%a==0? a+b : b-a)<<endl;\n}\n", "a, b = list(map(int, input().split()))\nprint([a+b,b-a][b%a!=0])", "#include <stdio.h>\n\nint main(){\n\tint A, B;\n\tscanf(\"%d %d\", &A, &B);\n\t\n\tB%A == 0 ? printf(\"%d\\n\", B + A) : printf(\"%d\\n\", B - A);\n\t\n\t\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint main() {\n int A, B;\n cin >> A >> B;\n cout << (B % A ? B - A : B + A);\n}", "A,B = map(int, raw_input().split())\n\nif not B%A:\n\tprint A+B\nelse:\n\tprint B-A", "import java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if (b % a == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b -a);\n }\n\n }\n}\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n int a, b;\n cin >> a >> b;\n cout << (b % a ? b - a : b + a) << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b;\nint main(){\n\tcin>>a>>b;\n\tif(b%a==0){\n\t\tcout<<a+b;\n\t}else{\n\t\tcout<<b-a;\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int A;\n int B;\n A = sc.nextInt();\n B = sc.nextInt();\n if(B%A==0){\n System.out.println(A+B);\n }\n else{\n System.out.println(B-A);\n }\n }\n}", "#include <iostream>\n#include <cstdio>\nusing namespace std;\n\nint a, b;\nint main() {\n\tcin >> a >> b;\n\tcout << (b%a ? b-a : a+b);\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b; \nint main(){\n\tcin>>a>>b;\n\tif(b%a==0) cout<<a+b;\n\telse cout<<b-a;\n \treturn 0;\n}", "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] args){\n Scanner scn = new Scanner(System.in);\n \n int A = scn.nextInt();\n int B = scn.nextInt(); \n int C = 0;\n \n if(B%A==0){\n C=A+B;\n }else{\n C=B-A;\n }\n System.out.print(C);\n }\n}\n ", "a, b = map(int, input().split())\nprint(b-a if b%a else b+a)", "import java.util.*;\npublic class Main {\n\t public static void main(String[] args) throws Exception {\n\t \n\t @SuppressWarnings(\"resource\")\n\t\t\tScanner scanner = new Scanner(System.in);\n\t int A = scanner.nextInt();\n\t int B = scanner.nextInt();\n\t System.out.println(B % A == 0?A+B:B-A);\n\t }\n\t}", "import java.util.*;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = Integer.parseInt(sc.next());\n int b = Integer.parseInt(sc.next());\n if(b % a == 0) System.out.println(a+b);\n else System.out.println(b-a);\n } \n}", "#abc118a\n\na,b=map(int,raw_input().split())\nif b%a==0:\n print a+b\nelse:\n print b-a\n", "#include<iostream>\nusing namespace std;\n\nint main(void) {\n\tint a, b;\n\tcin >> a >> b;\n\tcout << ((b%a == 0)?(a+b) : (b-a)) << endl;\n\treturn 0;\n}", "a, b = map(int, raw_input().split())\nif (b%a) == 0:\n print a + b\nelse:\n print b - a\n", "a,b=map(int,input().split())\nprint(b-a if b%a>0 else a+b)", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint A, B;\n\tcin >> A >> B;\n\tif (B % A) cout << B - A;\n\telse cout << A + B;\n}", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args)\n\t{\n\t\tint a,b;\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\ta = sc.nextInt();\n\n\t\tb = sc.nextInt();\n\n\n\t\tif( b%a ==0) {\n\t\t\tSystem.out.println(a+b);\n\n\n\t\t}else {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\n\t}\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scnr = new Scanner(System.in);\n \tint a = scnr.nextInt();\n \tint b = scnr.nextInt();\n \tif (b % a == 0) {\n \tSystem.out.println(a + b);\n } else {\n \tSystem.out.println(b - a);\n }\n }\n}", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint x =0;\n\t\tif((1<=A&&A<=20)&&(1<=B&&B<=20)&&(A<=B)) {\n\tif(B%A == 0) {\n\t\tx=A+B;\n\t}\n\telse {\n\t\tx=B-A;\n\t}\n\tSystem.out.println(x);\n\t\t}\n\t}\n}", "#include<stdio.h>\nint main(){\n int a,b;\n scanf(\"%d %d\",&a,&b);\n if(b%a==0)printf(\"%d\\n\",a+b);\n else printf(\"%d\",b-a);\n return 0;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n\tint a, b;\n\tcin >> a >> b;\n\tcout << (b % a ? b - a : b + a);\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n int A, B;\n cin >> A >> B;\n cout << (B % A == 0 ? A+B : B-A) << endl; \n return 0;\n}", "x,y=list(map(int,input().split(\" \")))\nif y%x==0:\n print(x+y)\nelse:\n print(y-x)", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint a, b; scanf(\"%d %d\", &a, &b);\n\tprintf(\"%d\\n\", b % a ? b - a : b + a);\n\treturn 0;\n}", "a = list(map(int, input().split()))\nprint(a[0]+a[1] if a[1]%a[0]==0 else a[1]-a[0])", "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int a,b;cin>>a>>b;\n if(b%a==0)\n cout<<a+b;\n else\n cout<<b-a;\n return 0;\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt(), B = sc.nextInt();\n if (B%A==0) {\n System.out.println(A+B);\n return;\n }\n System.out.println(B-A);\n }\n}\n", "import java.util.*;\nclass Main\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\t\n\t\tif(b%a==0){\n\t\t\tSystem.out.println(a+b);\n\t\t}\n\t\telse{\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\t}\n}", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n System.out.println(b % a == 0 ? a + b : b - a);\n scan.close();\n }\n}\n", "# include \"iostream\"\n# include \"cstdio\"\n\nusing namespace std;\n\nint A,B;\n\nint main(){\n\tscanf(\"%d%d\",&A,&B);\n\tprintf(\"%d\",B%A?B-A:A+B);\n\treturn 0;\n}", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int a=sc.nextInt();\n int b=sc.nextInt();\n System.out.println(b%a==0?a+b:b-a);\n }\n}\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n int a,b;\n cin>>a>>b;\n cout<<(b%a==0?a+b:b-a);\n}\n", "#include<iostream>\nusing namespace std;\nint main(){\n long A,B,C;\n cin>>A>>B;\n B%A==0 ? C=A+B:C=B-A;\n cout<<C<<endl;\n}", "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n // 整数の入力\n int A = sc.nextInt();\n int B = sc.nextInt();\n\t\t\n \tif(B % A == 0){\n System.out.println(A+B);\n }\n else{\n System.out.println(B-A);\n }\n\n\n }\n}", "import java.util.*;\n\npublic class Main {\n\n \n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a=sc.nextInt();\n int b=sc.nextInt();\n System.out.println(b%a==0?a+b:b-a);\n\n }\n\n \n\n}", "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String args[]){\n \tScanner sc = new Scanner(System.in);\n int a = Integer.parseInt(sc.next());\n int b = Integer.parseInt(sc.next());\n if(b%a == 0){\n \tSystem.out.println(a+b);\n }else{\n \tSystem.out.println(b-a);\n }\n }\n}", "import java.util.*;\nimport java.io.*;\n\n/*\n AtCoder contest\n coder : yoichidon\n */\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n System.out.println(B%A==0 ? A+B : B-A);\n\n\n\n }\n}\n", "import java.util.*;\nclass Main\n{\n public static void main (String[] args)\n {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int b = sc.nextInt();\n int ans = 0;\n if(b % n == 0) ans = n + b;\n else ans = b - n;\n System.out.println(ans);\n }\n}\n ", "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n if (B % A == 0) {\n System.out.println(A + B);\n } else {\n System.out.println(B - A);\n }\n sc.close();\n }\n}", "a,b=map(int,input().split())\nprint([a+b,b-a][b%a!=0])", "A, B = map(int,input().split())\nif (B//A == B/A):\n print(A+B)\nelse: print(B-A)", "a,b=map(int,input().split())\nprint((str(b-a),str(a+b))[b%a==0])", "a, b = map(int, input().split())\nprint([b+a,b-a][b%a>0])", "A,B = map(int,input().split())\n\nif B%A==0:\n print(int(A+B))\nelse:\n print(int(B-A))", "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int a, b;\n cin>>a>>b;\n \n if(b%a==0)\n cout<<a+b;\n else\n cout<<b-a;\n return 0;\n}", "#include<iostream>\nint main(){\nint a,b;\nstd::cin >> a >> b;\nstd::cout << (b%a?b-a:b+a);\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\t\n\t\tif(B % A == 0) {\n\t\t\tSystem.out.println(A+B);\n\t\t}else {\n\t\t\tSystem.out.println(B-A);\n\t\t}\n\t\tsc.close();\n\t}\n}\n", "# include<iostream>\nusing namespace std;\nint main (){\nint a,b;\ncin>>a>>b;\nif (b%a==0){\n cout<<a+b;\n}\nelse cout<<b-a;\n}", "n, m = map(int, input().split())\nif m % n :\n print(m - n)\nelse :\n print(n + m)\n ", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n int a,b;\n cin >> a >> b;\n if(b%a==0)cout << a+b;\n else cout << b-a;\n}\n", "A, B = map(int, raw_input().split())\nif B%A == 0: print A+B\nelse: print B-A", "A, B = [int(n) for n in input().split()]\nprint(A+B if B%A==0 else B-A)\n", "4,12\na,b = map(int, raw_input().split(' '))\nprint a + b if (b % a == 0) else -a + b", "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n static Scanner sc = new Scanner(System.in);\n\n\n public static void main(String[] args) {\n int a = sc.nextInt();\n int b = sc.nextInt();\n if (b % a == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint a = Integer.parseInt(sc.next());\n\t\tint b = Integer.parseInt(sc.next());\n\n\t\tSystem.out.println(b%a==0 ? a+b : b-a);\n\t}\n}", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n \n if(B%A==0) System.out.println(A+B);\n else System.out.println(B-A);\n }\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int a,b;\n cin>>a>>b;\n int ans=b-a;\n if(b%a==0)ans=b+a;\n cout<<ans<<endl;\n return 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\n\t\tSystem.out.println(b % a == 0 ? a + b : b - a);\n\n\t\tsc.close();\n\t}\n}\n", "a, b = map(int, raw_input().split())\nc = b/a\nif c*a == b:\n print(a+b)\nelse:\n print(b-a)", "#include\"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\tint A, B;\n\tcin >> A >> B;\n\tcout << (B % A == 0 ? A + B : B - A) << endl;\n\treturn 0;\n}", "A, B = [int(_) for _ in input().split()]\nprint(B - A if B%A else A + B)", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n //約数か判断\n if((b % a) == 0){\n System.out.println(a + b);\n }else{\n System.out.println(-a + b);\n }\n }\n}", "print((lambda a,b: b-a if b%a else a+b)(*[int(i) for i in input().split()]))", "import java.util.*;\n \npublic class Main {\n public static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n int B = sc.nextInt();\n if (B%A == 0)\n System.out.print(A+B);\n else\n System.out.print(B-A);\n }\n}", "A, B = map(int, input().split())\nprint(B - A) if B % A else print(A + B)\n", "a, b=[int(x) for x in input().split()]\nprint(a+b if b%a==0 else b-a)", "import sys\nnum = [int(s) for s in sys.stdin.readline().split()]\nif num[1]%num[0] == 0 :\n print (num[0]+num[1])\nelse :\n print (num[1]-num[0]) ", "import java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic int a = Integer.parseInt(sc.next());\n\tstatic int b = Integer.parseInt(sc.next());\n\tpublic static void main(String[] args) {\n\t\tif (b%a==0) {\n\t\t\tSystem.out.println(a+b);\n\t\t} else {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n int a,b;cin>>a>>b;\n cout<<(b%a?b-a:b+a)<<endl;\n}", "a,b = list(map(int, input().split()))\nr = a + b if b % a == 0 else b - a\nprint(r)", "#include <cstdio>\n\nint main(){\n int A, B;\n scanf(\"%d%d\", &A, &B);\n printf(\"%d\\n\", (B%A) ? B-A : A+B);\n return 0;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n\tint x,y;\n\tcin>>x>>y;\n\tif(y%x==0)\n\t\tcout<<x+y;\n\telse\n\t\tcout<<y-x;\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\t\n\t\tint a=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\tif(a%b==0 || b%a==0)\n\t\t\tSystem.out.println(a+b);\n\t\telse\n\t\t\tSystem.out.println(Math.abs(a-b));\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(void){\nint a,b;cin>>a>>b;\ncout<<(b%a==0?(a+b):(b-a))<<endl;\nreturn 0;}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;\n cin>>a>>b;\n if(b%a) cout<<b-a<<\"\\n\";\n else cout<<a+b<<\"\\n\";\n}", "#include <bits/stdc++.h>\nint main() {\n\tint a, b; std::cin >> a >> b;\n\tb % a ? std::cout << b - a : std::cout << a + b;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int a,b;\n char c1, c2;\n cin>>a>>b;\n cout << (b%a==0 ? a+b : b-a);\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tif (B%A==0) {\n\t\t\tSystem.out.println(A+B);\n\t\t} else {\n\t\t\tSystem.out.println(B-A);\n\t\t}\n\t}\n}\n", "#include<iostream>\nint main(){int A,B;std::cin>>A>>B;std::cout<<(B%A?B-A:B+A);}", "#include<iostream>\nusing namespace std;\nint main(){\n int a,b;cin>>a>>b;\n cout<<(b%a?b-a:a+b)<<endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if (b % a == 0) System.out.println(a + b);\n else System.out.println(b - a);\n\n sc.close();\n }\n}", "a, b = map(int, input().split(' '))\nprint((a + b) if b % a == 0 else (b - a))", "A,B = map(int,input().split())\ns = B%A\nif s ==0:\n print(A+B)\nelse:\n print(B-A)", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args) {\n try(\n Scanner scanner = new Scanner(System.in);) {\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n if(b/a == (double)b/a){\n System.out.println(b + a);\n } else {\n System.out.println(b - a);\n }\n }\n }\n}", "#include<iostream>\nint main(){\n int A,B;\n std::cin >> A >> B;\n if(B%A == 0) std::cout<<A+B;\n else std::cout<<B-A;\n}", "A, B = map(int, raw_input().split())\n\nif B % A == 0: print (A+B)\nelse: print (B-A)", "import java.util.*;\n\nclass Main {\n public static void main(String args[]) {\n Scanner inp = new Scanner(System.in);\n int a = inp.nextInt();\n int b = inp.nextInt();\n if (b % a == 0) System.out.println(a + b);\n else System.out.println(b - a);\n inp.close();\n }\n}\n", "#include<iostream>\nusing namespace std;\nint main(){\n int A,B; cin >> A >> B;\n cout << (B % A == 0 ? A+B:B-A) << endl; \n}", "a,b=map(int,input().split());print([b+a,b-a][b%a>0])", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint ans;\n\t\tif (b % a == 0) {\n\t\t\tans = a + b;\n\t\t} else {\n\t\t\tans = b - a;\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\tsc.close();\n\t}\n}\n", "a,b=(map(int, input().split()))\nif b%a==0:\n print(a+b)\nelse:\n print(b-a)", "#include <stdio.h>\n\nint main ()\n{\n\tint A;\n\tint B;\n\t\n\tscanf(\"%d %d\", &A, &B);\n\t\n\tB%A==0? printf(\"%d\", A+B): printf(\"%d\", B-A);\n\t\n\treturn 0;\n}", "a, b = map(int, input().split())\nans = a + b if b % a == 0 else b - a\nprint(ans)\n", "a,b = (int(x) for x in input().split())\n\nprint(a + b if b % a == 0 else b - a)", "A, B = [int(s) for s in input().split()]\nprint(A + B if B % A == 0 else B - A)", "A, B = map(int, input().split())\nprint(B%A==0 and A+B or B-A)\n", "#include <iostream>\nusing namespace std;\nint a, b;\nint main() {\n\tcin>>a>>b;\n\tcout<<(b%a ? b-a : b+a);\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a,b;\n cin>>a>>b;\n if (b%a) cout<<b-a;\n else cout<<a+b;\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n int a,b;\n cin>>a>>b;\n cout << (b/a*a==b? a+b:b-a) <<endl;\n }", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint A,B;\n cin>>A>>B;\n if(B%A == 0){\n cout<<A+B;\n }\n else{\n cout<<B-A;\n }\n}", "import java.util.Scanner;\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A, B;\n\t\tA = sc.nextInt();\n\t\tB = sc.nextInt();\n\t\t\n\t\tif(B % A == 0) \n\t\t\tSystem.out.println(A + B);\n\t\telse\n\t\t\tSystem.out.println(B - A);\n\t\t\n\n\t}\n\n\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a,b;\n\tcin>>a>>b;\n\tif(b/a*a==b)\n\tcout<<a+b;\n\telse\n\tcout<<b-a;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n q_1();\n }\n\n private static void q_1() {\n try (Scanner scan = new Scanner(System.in)) {\n int a = scan.nextInt();\n int b = scan.nextInt();\n\n System.out.println(b % a == 0 ? b + a : b - a);\n }\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int A, B;\n cin >> A >> B;\n cout << ((B % A == 0) ? (A + B) : (B - A)) << endl;\n}", "import java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tint A = scn.nextInt();\n\t\tint B = scn.nextInt();\n\t\tSystem.out.println((B %A == 0)?A + B:B- A);\n\t}\n\n}\n", "\nimport java.util.Scanner;\n\npublic class Main { \n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint A, B, ans;\n\t\tA = in.nextInt();\n\t\tB = in.nextInt();\n\t\t\n\t\tif (B%A == 0) ans = A+B;\n\t\telse ans = B -A;\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}\n", "a, b = map(int, input().split())\n\nprint(a + b) if b % a == 0 else print ( b - a)", "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint A, B;\n\t\tA = scanner.nextInt();\n\t\tB = scanner.nextInt();\n\t\tif (B % A == 0){\n\t\t\tSystem.out.println(A + B);\n\t\t}else{\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint a,b;\nint main()\n{\n\tcin>>a>>b;\n\tif(b % a == 0) cout<<b+a;\n\telse cout<<b-a;\n}", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n if (B % A == 0){\n System.out.println(B + A);\n }\n else{\n System.out.println(B - A);\n }\n }\n}", "import math\nA,B=map(int, input().split())\nprint (B+A-2*A*math.ceil(B%A/20))", "#2019/10/10\nA, B = map(int, open(0).read().split())\nprint(A+B if B%A==0 else B-A)", "#include <iostream>\nusing namespace std;\n\nint main() {\n int a,b;\n cin>>a>>b;\n cout<<b+(b%a?-a:a)<<endl;\n}\n", "a,b=map(int, input().split())\n\nif b%a==0:\n x=a+b\nelse:\n x=b-a\n\nprint(x)", "[print(b-(-1)**(b%a==0)*a)for a,b in [[int(i) for i in input().split()]]]", "a, b = map(int, input().split())\n\nprint(b+a if b%a == 0 else b-a)", "a, b = map(int, input().split())\nprint(b + a) if b % a == 0 else print(b - a)\n", "#include <cstdio>\nint a, b;\nint main(){\n\tscanf(\"%d%d\", &a, &b);\n\tif (b % a == 0) printf(\"%d\\n\", a + b);\n\telse printf(\"%d\\n\", b - a);\n}\n", "A, B = map(int, input().split())\nprint(B - A if B % A else B + A)", "#include <iostream>\nusing namespace std;\n\nint main(){\n int A, B;\n cin >> A >> B;\n if (B % A == 0) cout << A + B;\n else cout << B - A;\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\n\t\tSystem.out.println(b%a == 0 ? a + b : b - a);\n\t}\n\n}\n", "a,b=list(map(int,input().split()))\nif b%a==0:\n print(b+a)\nelse:\n print(b-a)", "#include <iostream>\nusing namespace std;\nint main(){\nint a,b,ans;\n cin >>a >>b;\n if(b%a==0)ans=a+b;\n else ans=b-a;\ncout <<ans<<endl;\n \n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int a, b;\n cin >> a >> b;\n cout << (b % a == 0 ? b + a : b - a); \n}", "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n \n int ans = b % a == 0 ? a + b : b - a;\n \n System.out.println(ans);\n }\n}\n", "list = [int(i) for i in raw_input().split()]\nif list[1]%list[0] == 0:\n \tprint(list[0]+list[1])\nelse:\n\tprint(list[1]-list[0])\n", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b;\nint main()\n{\n\tcin>>a>>b;\n if(b%a)\n cout<<b-a;\n else\n cout<<b+a;\n}\n", "a, b = map(int, raw_input().strip().split())\nif b % a == 0: print a + b\nelse: print b - a", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner tc=new Scanner(System.in);\n\t\t\n\t\tint a=tc.nextInt(), b=tc.nextInt(), c=0;\n\t\tif(a%b==0 || b%a==0) {c=a+b;}\n\t\telse {c=b-a;}\n\t\tSystem.out.println(c);\n\t\n \n\t\t\n\t\t// TODO Auto-generated method stub\n\n\t}\n\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nint main()\n{\n cin>>a>>b;\n if(b%a==0)cout<<a+b<<endl;\n else cout<<b-a<<endl;\n}\n\n", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n if (B % A == 0)\n System.out.println(B + A);\n else\n System.out.println(B - A);\n }\n}\n", "import java.util.Scanner;\n\n\npublic class Main {\n\tstatic int A,B;\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\t A = sc.nextInt();\n\t\t B = sc.nextInt();\n\n\t\tsc.close();\n\n\t\tif(B%A == 0){\n\t\t\tSystem.out.println(B+A);\n\t\t}else{\n\t\t\tSystem.out.println(B-A);\n\t\t}\n\t}\n}", "A,B = (int(X) for X in input().split())\nif B%A==0: print(B+A)\nelse: print(B-A)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n if (b % a == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n }\n}", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t Scanner sc = new Scanner(System.in);\n\t int a = sc.nextInt();\n\t int b = sc.nextInt();\n\t\t\tint X = 0;\n\t if(b % a ==0){\n\t \tX= a + b;\n\t }else {\n\t \tX= b - a;\n\t }\n\t \n\t System.out.println(X);\n\t}\n}", "#include <iostream>\nusing namespace std;\nint main(){\n int a=0;\n int b=0;\n cin>>a>>b;\n \n if(b%a==0){cout<<a+b;}else{cout<<b-a;}\n}", "N, K = list(map(int, input().split()))\nprint(N + K) if K % N == 0 else print(K - N) ", "a,b=map(int,input().split());print([a+b,b-a][b%a>0])", "#include<stdio.h>\nint main()\n{\n\tint A,B;\n\tscanf(\"%d%d\", &A,&B);\n\tif(B%A==0)\n\t{\n\t\tprintf(\"%d\", A+B);\n\t}\n\telse\n\tprintf(\"%d\", B-A);\n\treturn 0;\t\n}", "#include <iostream>\nint main(){\n\tint a,b;\n\tstd::cin>>a>>b;\n\tif(b%a==0)std::cout<<a+b;\n\telse std::cout<<b-a;\n\treturn 0;\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n \n\t\t// 整数の入力\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n \n\t\t// 出力\n\t\tSystem.out.println(b % a == 0 ? a + b : b - a);\n\t}\n}\n", "a,b=map(int,input().split(\" \"))\nprint([a+b,b-a][b%a>0])", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner s=new Scanner(System.in);\n\t\tint A=s.nextInt();\n\t\tint B=s.nextInt();\n\t\tSystem.out.println(B%A==0?A+B:B-A);\n\t}\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint a,b;\n\tcin>>a>>b;\n\tif(b%a==0)a+=b;\n\telse a=b-a;\n\tcout<<a;\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n if (B % A == 0) {\n System.out.println(A+B);\n } else {\n System.out.println(B-A);\n }\n\n }\n\n}", "#include <iostream>\nusing namespace std;\n\nint main(void) {\n int a,b; cin >> a >> b;\n cout << (b%a==0 ? a+b : b-a) << endl;\n}", "a,b=[int(s) for s in input().split()]\nif(b%a==0):\n print(a+b)\nelse:\n print(b-a)", "#include<iostream>\nusing namespace std;\nint main(){int a,b;cin>>a>>b;cout<<b+(b%a==0?a:-a)<<endl;}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint A, B;\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tA = scan.nextInt();\n\t\tB = scan.nextInt();\n\t\t\n\t\tSystem.out.print((B % A == 0) ? (A+B) : (B-A));\n\t}\n\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n int c = b % a;\n if(c == 0) System.out.println(a+b);\n else System.out.println(b-a);\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n if(B % A == 0){\n System.out.println(B + A);\n }else{\n System.out.println(B - A);\n }\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(b % a == 0) System.out.println(a + b);\n else System.out.println(b - a);\n }\n}", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tint ans;\n\t\tif(b%a==0){ans=a+b;}else{ans=b-a;}\n\t\tSystem.out.println(ans);\n\t}\n}", "A, B = map(int, input().split())\nif B % A:\n print(B - A)\nelse:\n print(A + B)", "A, B = map(int, input().split())\nprint(\"{}\".format(A + B if B % A == 0 else B - A))", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int a,b;cin >> a >> b;\n cout << ((b%a == 0)? a+b:b-a) << endl;\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner in = new Scanner(System.in)) {\n int a = in.nextInt();\n int b = in.nextInt();\n System.out.println(b % a == 0 ? a + b : b - a);\n }\n }\n}", "a, p=map(int,input().split())\nprint(p-a if p%a else p+a)", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int a = in.nextInt();\n int b = in.nextInt();\n in.close();\n int ans = b % a == 0 ? a + b : b - a;\n \n System.out.println(ans);\n }\n}", "A,B=list(map(int,input().split()))\nif B%A==0:\n print(A+B)\nelse:\n print(B-A)\n", "a,b=map(int,input().split());print((b-a)*(b%a>0)or a+b)", "A,B=map(int,input().split())\nprint((A+B) if B%A==0 else(B-A))", "if __name__ == '__main__':\n a, b = map(int, raw_input().split())\n\n if b % a == 0:\n print a + b\n else:\n print b - a", "A, B = map( int, input().split() )\nprint( A+B ) if B % A == 0 else print( B-A )", "a, b = map(int, input().split())\nprint(b - a if b % a else a + b)\n", "#include <stdio.h>\nint a,b;\n\nint main()\n{\n scanf(\"%d %d\",&a,&b);\n if(b%a) printf(\"%d\\n\",b-a);\n else printf(\"%d\\n\",a+b);\n}", "a,b=map(int,input().split())\nprint(a+b if (b%a)==0 else (b-a))", "#include <iostream>\nusing namespace std;\n\nint main(){\n int a, b; cin >> a >> b;\n cout << ((b%a) ? b-a : a+b) << endl;\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n static Scanner s = new Scanner(System.in);\n public static void main(String[] args) {\n final int A = s.nextInt();\n final int B = s.nextInt();\n System.out.println(B % A == 0 ? A + B : B - A);\n }\n}\n", "#include<stdio.h>\n\nint main(){\n\t\n\tint A,B;\n\tscanf(\"%d %d\",&A, &B );\n\t\n\t(B%A == 0) ? printf(\"%d\\n\", A+B) : printf(\"%d\\n\", B-A);\n\t\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\nint main(void){\n int a,b;\n cin >> a >> b;\n if(b%a==0) cout << a+b;\n else cout << b-a;\n}", "a, b = [int(i) for i in input().split()]\n\nprint(a+b if b%a == 0 else b-a)\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\t// スペース区切りの整数の入力\n\t\tint b = sc.nextInt();\n int c = a+b;\n int d = b-a;\n\t\tSystem.out.println(b%a==0?c:d);\n\t}\n}", "#include<iostream> \nusing namespace std; \nint main(){\n\tlong long a,b;\n\tcin >> a >> b;\n\tif(!(b%a))\n\t\tcout << a+b;\n\telse\n\t\tcout << b-a;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n int a,b;\n cin>>a>>b;\n if(b%a==0){\n cout<<a+b;\n }\n else{\n cout<<b-a;\n }\n}", "A,B = map(int,input().split())\n\nif B%A == 0:\n print(A+B)\nelse:\n print(-A+B)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\t\n\t\tif(B % A == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t}else{\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\t}\n}", "import java.util.*;\npublic class Main{\n\tpublic static void main(String args[]){\n Scanner s=new Scanner(System.in);\n int a=s.nextInt();\n int b=s.nextInt();\n System.out.println((b%a==0)?a+b:(b-a));\n }\n}", "A,B=map(int,input().split())\nif 0==B%A: print(A+B)\nelse: print(B-A)\n", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int a = sc.nextInt();\n int b = sc.nextInt();\n int ans1 = a+b;\n int ans2 = b-a;\n\n System.out.println(b%a == 0 ? a+b:b-a);\n }\n}", "// A - B +/- A\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint a,b; cin>>a>>b;\n\tcout<< (b%a? b-a: b+a) <<endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint a= sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = 0;\n\t\t\n\t\tif(b%a==0) {\n\t\t\tSystem.out.println(a+b);\n\t\t}else {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\t}\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int A,B;\n cin >>A >> B;\n cout << B-A+(B%A==0)*2*A<<endl;\n}", "a,b = map(int, input().split(' '))\n \nif b%a == 0 :\n print(b+a)\nelse :\n print(b -a)", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = b % a;\n if (c == 0)\n System.out.println(a+b);\n else\n System.out.println(b-a);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint a,b;\n\tcin >> a >> b;\n\n\tcout << (b%a==0?a+b:b-a) << endl;\n\treturn 0;\n}", "a,b=map(int,input().split())\nprint(a+b if a%b==0 or b%a==0 else abs(a-b))", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int A,B;\ncin>>A>>B;\n if(B%A==0){\n cout<<A+B<<endl;\n }\n else\n cout<<B-A<<endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a,b,c; cin>>a>>b;\n \n c = b%a==0 ? a+b:b-a;\n \n cout<<c<<endl;\n}\n\n\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int A = scan.nextInt();\n int B = scan.nextInt();\n\n if (B % A == 0) {\n System.out.print(B + A);\n } else {\n System.out.print(B - A);\n }\n }\n}", "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\tint ans=0;\n\t\tif(b%a==0) {\n\t\t\tans=a+b;\n\t\t\tSystem.out.println(ans);\n\t\t}else {\n\t\t\tans=b-a;\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int a, b; cin >> a >> b;\n cout << ((b % a == 0) ? (a + b) : (b - a)) << endl;\n}\n", "#include <cstdio>\nint a,b;\nint main()\n{\n\tscanf(\"%d%d\",&a,&b);\n\tif(b%a==0) printf(\"%d\",a+b);\n\telse printf(\"%d\",b-a);\n} ", "#include<iostream>\nusing namespace std;\n\nint main(){\n int a,b;\n cin>>a>>b;\n int ans=b%a==0?a+b:b-a;\n cout<<ans<<endl;\n return 0;\n}", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n \tScanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = (int)b/a;\n if(c*a == b) System.out.println(a+b);\n else System.out.println(b-a);\n }\n}\n", "n,k = map(int, input().split())\n\n\nif k%n==0:\n print(n+k)\nelse:\n print(k-n)\n", "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n Scanner s = new Scanner(System.in);\n\n int a = s.nextInt();\n int b = s.nextInt();\n\n if(b % a == 0){\n System.out.println(a+b);\n }else{\n System.out.println(b-a);\n }\n }\n}\n", "A, B = map(int, raw_input().split())\n\nif 0 == B % A:\n print A + B\nelse:\n print B - A", "import java.util.Scanner;\n\npublic class Main {\n public static void main (String[] args) {\n Scanner in = new Scanner(System.in);\n\n while (in.hasNext()) {\n int A = in.nextInt();\n int B = in.nextInt();\n\n if (B % A == 0) {\n System.out.println(A + B);\n } else {\n System.out.println(B - A);\n }\n }\n }\n}", "a,b=[int(e) for e in input().split()]\nif(b%a==0):print(a+b)\nelse:print(b-a)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int A = scanner.nextInt();\n int B = scanner.nextInt();\n\n if(B%A == 0){\n System.out.println(A + B);\n }else {\n System.out.println(B - A);\n }\n }\n}\n", "#include<iostream>\nusing namespace std;\nint main (void)\n{\n int a,b;\n cin>>a>>b;\n if(b%a==0){cout<<a+b<<endl;}\n else{cout<<b-a<<endl;}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\n\t\tif (B % A == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t\t\n\t\t} else {\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\n\t}\n\n}\n", "A,B = map(int,input().split())\n[print(A+B) if B%A == 0 else print(B-A)]", "import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\t Scanner sc = new Scanner(System.in);\n\t\t int a = sc.nextInt();\n\t\t int b = sc.nextInt();\n\t\t \n\t\t if (b % a == 0) {\n\t\t\t System.out.println(a + b);\n\t\t }\n\t\t else {\n\t\t\t System.out.println(b - a);\n\t\t }\n\t}\t\t\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int A,B;\n cin >> A >> B;\n cout << (B % A == 0 ? A + B : B - A) << endl;\n}", "#include<stdio.h>\nint a,b;\nint main()\n{\n\tscanf(\"%d%d\",&a,&b);\n \tif(b%a==0)printf(\"%d\\n\",a+b);\n else printf(\"%d\\n\",b-a);\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n \tint M = sc.nextInt();\n int N = sc.nextInt();\n\t\tif (N % M == 0)System.out.println(N + M);\n else System.out.println(N - M) ;\n\t}\n}\n", "import java.util.*;\n\nclass Main{\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tif(b%a == 0){\n\t\t\tSystem.out.print(a+b);\n\t\t}else{\n\t\t\tSystem.out.print(b-a);\n\t\t}\n\t}\n}\n", "A, B = list(map(int, raw_input().split()))\n\nif B % A == 0: print str(A+B)\nelse: print str(B-A)\n\n\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n \n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n System.out.println(B % A == 0 ? A + B : B - A);\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int a, b;\n cin >> a >> b;\n cout << (b % a == 0 ? a + b : b - a) << \"\\n\";\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a,b;\n cin>>a>>b;\n cout<<(b%a==0? a+b:b-a);\n}", "A,B = map(int,input().split())\nx = A + B if B % A == 0 else B - A\nprint(x)", "#include <iostream>\nusing namespace std;\nint main() {\n int a, b;\n cin >> a >> b;\n cout << ((b%a==0)? a+b : b-a) << endl;\n}", "import java.util.Scanner;\n \npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n System.out.println((B % A == 0)?A+B:B-A);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt(), b = sc.nextInt();\n\t\tif(b%a == 0) System.out.println(a+b);\n\t\telse System.out.println(b - a);\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;\n cin>>a>>b;\n cout<<(b%a?b-a:a+b)<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint a,b;\n\tcin>>a>>b;\n\n\tif(b%a==0)cout<<b+a;\n\telse cout<<b-a;\n\t\n\t\n}\n", "#include<bits/stdc++.h> \nusing namespace std;\n\nint32_t main(){\n\tint a, b; cin>>a>>b;\n\tcout<<(b % a == 0 ? a + b : b - a)<<endl;\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(b%a==0){\n System.out.println(a+b);\n }\n else{\n System.out.println(b-a);\n }\n }\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n // 整数の入力\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(b % a == 0){\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n\n }\n}\n", "A, B = [int(i) for i in input().split()]\nprint(A + B if B % A == 0 else B - A)", "A, B = [int(i) for i in input().split()]\nprint(B+A) if B % A == 0 else print(B-A)", "#include <iostream>\nusing namespace std;\nint main () {\n int x, y;\n cin >> x >> y;\n y%x==0 ? cout << x+y : cout << y-x;\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a,b;\n cin>>a>>b;\n cout<<(b%a==0?a+b:b-a)<<endl;\n}\n", "#include<iostream>\nusing namespace std;\nint main(void){\n int a,b;\n cin>>a>>b;\n cout<<(b%a?b-a:a+b);\n return 0;\n}", "A,B=map(int,raw_input().split())\n\n#print A,B\n\nif (B % A) == 0:\n print A+B\nelse:\n print B-A\n", "A, B = map(int,input().split())\nans = A+B if B % A == 0 else B-A\nprint(ans)", "\nif __name__ == \"__main__\":\n a, b = map(int, raw_input().split(\" \"))\n if b % a:\n print(str(b - a))\n else:\n print(str(a + b))", "A, B = map(int, input().split())\nans = (A + B if B % A == 0 else B - A)\nprint(ans)\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if ((b % a) == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n\n }\n}", "#include <iostream>\nint main() {\n\tint a,b;\n\tstd::cin>>a>>b;\n\tif(b%a==0) std::cout<<a+b;\n\telse std::cout<<b-a;\n}", "import java.util.Scanner;\nimport java.util.Locale;\nimport java.time.LocalDate;\nimport java.time.format.DateTimeFormatter;\n\npublic class Main {\n public static void main(String[] args ){\n\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n System.out.println( B % A == 0 ? A + B : B - A);\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint a = cin.nextInt();\n\t\tint b = cin.nextInt();\n\t\tif (b % a == 0) \n\t\t\tSystem.out.println(a + b);\n\t\telse \n\t\t\tSystem.out.println(b - a);\n\t}\n}", "A,B = map(int, input().split(\" \"))\nprint(A+B if B%A == 0 else B-A)", "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();//A\n int b = sc.nextInt();//B\n if(b % a == 0){//BがAで割り切れるかつまり余りがゼロか\n System.out.println(a + b);//A+Bの表示\n } else {\n System.out.println(b - a);//B-Aの表示\n }\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A, B;\n\t\tA = sc.nextInt();\n\t\tB = sc.nextInt();\n\t\tif (B % A == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t} else {\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\n\t\tsc.close();\n\n\t}\n\n}", "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n System.out.println((B % A == 0 ? A + B : B - A));\n }\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int a,b;\n cin >> a >> b;\n cout << (((b/a)*a == b) ? (a+b) : (b-a));\n return 0;\n}", "a=[int(i) for i in input().split()]\nprint(a[0]+a[1] if a[1]%a[0]==0 else a[1]-a[0])", "a, b = map(int, input().split())\n\nprint (a + b) if(b % a == 0) else print (b - a)\n", "#include <cstdio>\n\nint main()\n{\n int a, b;\n scanf(\"%d %d\", &a, &b);\n printf(\"%d\\n\", b % a == 0 ? a + b : b - a);\n return 0;\n}", "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n if (B % A == 0){\n System.out.println(B + A);\n }else{\n System.out.println(B - A);\n }\n sc.close();\n }\n}\n", "A,B=[int(_) for _ in input().split()]\nprint( A+B if B % A ==0 else B-A)\n", "A, B = map(int, input().split())\nprint(B+A if B%A == 0 else B-A)", "A,B = map(int,input().split())\nif round(B%A) == 0:\n print(A + B)\nelse:\n print(B-A)", "A, B = [int(s) for s in input().split(' ')]\nprint(A + B if B % A == 0 else B - A)", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b;\nint main(){\n\tscanf(\"%d%d\",&a,&b);\n\tif (b%a==0) printf(\"%d\",a+b);\n\telse printf(\"%d\",b-a);\n}", "import java.util.*;\nimport java.io.*;\nimport java.lang.*;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if (b%a == 0)\n System.out.println(a+b);\n else\n System.out.println(b-a);\n\n }\n}\n", "import java.util.Scanner;\nclass Main{\n public static void main(String[] args) {\n Scanner scn=new Scanner(System.in);\n int A = scn.nextInt();\n int B = scn.nextInt();\n if(B%A==0){\n System.out.println(A+B);\n }else{\n System.out.println(B-A);\n }\n }\n}\n", "a, b = (int(x) for x in input().split())\nprint(a+b) if b % a == 0 else print(b-a)", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int a,b;\n cin>>a;\n cin>>b;\n \n if(b%a==0)cout<<a+b;\n else cout<<b-a;\n}", "#include <iostream>\nusing namespace std;\n\nint main() {\n int a ; int b;\n\tcin>>a>>b;\n\tif(b%a==0){\n\t\tcout<<a+b;\n\t}\n\telse{\n\t\tcout<<b-a;\n\t}\n\n\t\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a = Integer.parseInt(sc.next());\n int b = Integer.parseInt(sc.next());\n \n if(b%a==0){\n System.out.println(a+b);\n }else{\n System.out.println(b-a);\n }\n }\n}\n", "a, b = [int(x) for x in input().split()]\nprint([a + b, b - a][int(bool(b % a))])", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in);) {\n int num1 = sc.nextInt();\n int num2 = sc.nextInt();\n\n int answer = (num2 % num1 == 0) ? num1 + num2 : num2 - num1;\n System.out.println(answer);\n }\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nsigned main(){\n int a,b;\n cin>>a>>b;\n if(b%a==0) cout<<a+b;\n else cout<<b-a;\n cout<<\"\\n\";\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint ans = (b % a == 0) ? a + b : b - a;\n\t\tSystem.out.println(ans);\n\t}\n}\n", "A, B = map(int, raw_input().split())\nif B%A == 0:\n print A+B\nif B%A != 0:\n print B-A\n", "import java.util.Scanner;\n \npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\t\n\t\tSystem.out.println(B % A == 0 ? A+B : B-A);\n\t}\n\t\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n \n int a, b;\n cin >> a >> b;\n \n cout << ((b % a == 0) ? a+b : b-a) << endl;\n}\n", "a, b = map(int, input().split())\nx = a + b if b % a == 0 else b - a\nprint(x)", "a, b = map(int, input().split())\nprint((a + b) if b % a == 0 else (b - a))\n", "A,B = map(int,input().split())\nif B % A != 0:\n print(B-A)\nelse:\n print(A+B)", "A, B = map(int, input().split())\nif (B%A == 0):\n print(A+B)\nelse:\n print(B-A)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n Main m = new Main();\n int a = sc.nextInt();\n int b = sc.nextInt();\n System.out.println(b % a == 0 ? a+b : b-a);\n }\n}", "A, B = map(int, input().split())\n\nprint(A + B if (B % A == 0) else B - A)\n", "a,b = map(int,input().split())\nprint(a+b if (b%a)==0 else b-a)", "#include <iostream>\nusing namespace std;\n\nint main() {\n int A,B; cin >> A >> B;\n cout << ((B / A) * A == B ? A + B : B - A) << endl;\n}\n", "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n System.out.println((B % A == 0) ? B + A : B - A);\n }\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scn=new Scanner(System.in);\n\t\tint a=scn.nextInt();\n\t\tint b=scn.nextInt();\n\t\tSystem.out.println(b%a==0?a+b:b-a);\n\t}\n\n}\n", "n,m=map(int,input().split())\nprint(m-n if m%n else n+m)", "#include <iostream>\n\nint main(){\n int a, b;\n\n std::cin >> a >> b;\n\n std::cout << ((b%a) == 0 ? a + b : b - a);\n\n return 0;\n}", "\na, b, = map(int, input().split())\nprint(a+b if b%a==0 else b-a) ", "#include <iostream>\nusing namespace std;\n\nint main(){\n int a, b; cin >> a >> b;\n cout << (b%a ? b-a : a+b) << endl;\n return 0;\n}", "a,b=map(int,input().split());print(b + a*(b%a==0) - a*(b%a>0))", "import java.util.*;\n\npublic class Main \n{\n public static void main(String[] args)\n {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(b%a==0)\n System.out.print(a+b);\n \telse\n System.out.print(b-a);\n sc.close();\n }\n}\n", "a, b = map(int, input().split())\nprint((-1)**(b%a != 0)*a+b)", "#include <stdio.h>\nint main(void) {\n\tint A,B;\n\tscanf(\"%d%d\", &A,&B);\n\tif (B%A)printf(\"%d\",B-A );\n\telse printf(\"%d\",A+B);\n\treturn 0;\n}\n", "A,B = map(int,(input().split()))\nif B%A == 0:\n print(A+B)\nelse:\n print(B-A)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a = scanner.nextInt();\n\t\tint b = scanner.nextInt();\n\t\t\n\t\tif(b % a == 0){\n\t\t\tSystem.out.println(a + b);\n\t\t}else{\n\t\t\tSystem.out.println(b - a);\n\t\t}\n\t}\n}", "import java.util.*;\nimport java.io.*;\n\nimport static java.lang.System.in;\n\npublic class Main {\n public static void main(String[] args)throws IOException{\n Scanner sc = new Scanner(System.in);\n int a= sc.nextInt(), b =sc.nextInt();\n int ans = b%a==0?a+b:b-a;\n System.out.println(ans);\n }\n}\n", "[a,b]=map(int,input().split())\nif b % a == 0:\n print(a + b)\nelse:\n print(b - a)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in);) {\n new Main().solve(sc);\n }\n }\n\n void solve(Scanner sc) {\n int a = sc.nextInt();\n int b = sc.nextInt();\n System.out.println((b % a == 0 ? a + b : b - a));\n }\n}\n", "#include <iostream>\nusing namespace std;\nint a,b;\nint main(void){\n cin>>a>>b;\n if(b%a==0)cout<<a+b<<endl;\n else cout<<b-a<<endl;\n}\n", "a,b, = map(int,input().split())\nif b%a == 0:\n print(a+b)\nelse:\n print(b-a)", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int a, b;\n cin >> a >> b;\n cout << ((b % a) ? b - a : b + a) << endl;\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\nint main(){\n int a,b;\n cin>>a>>b;\n cout<<(b%a==0? a+b:b-a);\n}", "a,b = map(int, input().split())\n\nif b%a==0:\n ret = a+b\nelse:\n ret=b-a\n\nprint(ret)", "import java.util.*;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n \n int A = sc.nextInt(), B = sc.nextInt();\n \n if (B % A == 0)\n System.out.println((A + B));\n else\n System.out.println((B - A));\n }\n}", "A=list(map(int,input().split()))\nprint(sum(A) if A[1]%A[0]==0 else A[1]-A[0])", "#include<bits/stdc++.h>\nusing namespace std;\nint n,m;\nint main()\n{\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tprintf(\"%d\",b%a==0?a+b:b-a);\n}\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n int a,b; cin >> a >> b;\n cout << (b%a ? b-a : a+b);\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[]) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tString[] s = sc.nextLine().split(\" \");\n\n\t\tint a = Integer.parseInt(s[0]);\n\t\tint b = Integer.parseInt(s[1]);\n\n\t\tif(b % a == 0) {\n\t\t\tSystem.out.println((a+b));\n\t\t}else {\n\t\t\tSystem.out.println((b-a));\n\t\t}\n\t}\n\n}", "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n sc.close();\n if(b % a == 0){\n System.out.println(a + b);\n }else{\n System.out.println(b - a);\n }\n }\n}", "import java.util.*;\nimport java.io.*;\npublic class Main{\n public static void main(String args[])\n {\n Scanner sc = new Scanner(System.in);\n\tint a,b;\n a = sc.nextInt();\n b = sc.nextInt();\n \tif(b%a==0)\n System.out.println(a+b);\n else\n System.out.println(b-a);\n }\n}\n", "#include <stdio.h>\nint main(){\nint a,b;\n scanf(\"%d%d\",&a,&b);\n if(b%a==0)printf(\"%d\",a+b);\n else printf(\"%d\\n\",b-a);\n}", "#include<iostream>\n\nint main() {\n\tint a, b;\n\t::std::cin >> a >> b;\n\t::std::cout << (b%a ? b - a : a + b) << ::std::endl;\n}\n", "a,b=map(int,input().split())\nprint(b-a+2*a*(b%a==0))", "a,b=map(int,input().split())\nc=a+b if b%a==0 else b-a\nprint(c)", "import java.util.Scanner;\nclass Main{\n\npublic static void main(String[]args){\nScanner scan=new Scanner(System.in);\n int a=scan.nextInt();\n int b=scan.nextInt();\n System.out.println(b%a==0?a+b:b-a);\n\n}\n}", "a,b=map(int,input().split())\nprint([b-a,a+b][b%a==0])", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint ans = 0;\n\n\t\tif (B%A == 0) {\n\t\t\tans = A+B;\n\t\t} else {\n\t\t\tans = B-A;\n\t\t}\n\n\t\tSystem.out.println( ans );\n\t}\n}", "a, b = map(int, input().split())\nprint(a + b if b//a == b/a else b - a)", "a , b = [int(i) for i in raw_input().split(' ')]\nif b % a == 0:\n\tprint a + b\nelse:\n \tprint b - a", "a,b=list(map(int,input().split()))\nprint(b+a if b%a==0 else b-a)", "A,B = list(map(int,input().split()))\n\nif B%A==0:\n print(B+A)\nelse:\n print(B-A)", "n,k=map(int,input().split())\nprint(n+k if k%n ==0 else k-n)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = Integer.parseInt(sc.next());\n\t\tint B = Integer.parseInt(sc.next());\n\t\tsc.close();\n\n\t\tif(B % A == 0) {\n\t\t\tSystem.out.println(A + B);\n\t\t}else {\n\t\t\tSystem.out.println(B - A);\n\t\t}\n\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int T, X;\n cin >> T >> X;\n cout << (X%T == 0? T+X:X-T);\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\n\t\tSystem.out.println(b % a == 0 ? a + b : b - a);\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint a=s.nextInt();\n\t\tint b=s.nextInt();\n\t\n\t\t\n\t\tif(b%a==0) {\n\t\t\tSystem.out.println(a+b+\"\");\n\t\t}else {\n\t\t\tSystem.out.println(b-a+\"\");\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\ts.close();\n\t}\n\n}\n", "#include <iostream>\nusing namespace std;\nint main(void){\n int a,b; cin>>a>>b;\n if(b%a==0) cout<<a+b<<endl;\n else cout <<b-a<<endl;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt(), B = sc.nextInt();\n System.out.println((B % A == 0) ? A + B : B - A);\n }\n}", "a,b = map(int,input().split())\nprint(a+b-2*a*(b%a!=0))", "import sys\n\nl = map(int, raw_input().split())\n\nif l[1]%l[0]==0:\n print(l[0]+l[1])\n\nelse:\n print(l[1]-l[0])\n", "a,b=map(int, input().split())\nprint(a+b if b%a==0 else b-a)", "a,b = map(int,input().split())\nans = a+b\nif b % a != 0:\n ans = b-a\nprint(ans)\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().solve(new Scanner(System.in));\n\t}\n\t\n\tpublic void solve(Scanner sc) {\n\t\tint a = Integer.parseInt(sc.next());\n\t\tint b = Integer.parseInt(sc.next());\n\t\t\n\t\tif(b%a == 0) {\n\t\t\tSystem.out.println(a+b);\n\t\t} else {\n\t\t\tSystem.out.println(b-a);\n\t\t}\n\t\t\n\t}\n}\n", "a,b=map(int,input().split());print([b-a,a+b][b%a==0])", "A, B = [int(a) for a in input().split(\" \")]\nprint(A+B if B%A==0 else B-A)", "A,B=map(int,input().split());print(B-A if B%A!=0else A+B)", "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n if ((B % A) == 0) {\n System.out.println(A + B);\n } else {\n System.out.println(B - A);\n }\n\n }\n}", "a, b = [int(_) for _ in input().split()]\nprint(a + b if b % a == 0 else b - a)\n", "a,b=map(int,input().split())\nprint(a+b if (b%a==0) else b-a)", "a,b=map(int,input().split());print([b-a,a+b][b%a<1])", "A,B=map(int,input().split())\nif(A>0 and B%A==0):\n print(B+A)\nelse:\n print(B-A)\n " ]
You are given an integer L. Construct a directed graph that satisfies the conditions below. The graph may contain multiple edges between the same pair of vertices. It can be proved that such a graph always exists. * The number of vertices, N, is at most 20. The vertices are given ID numbers from 1 to N. * The number of edges, M, is at most 60. Each edge has an integer length between 0 and 10^6 (inclusive). * Every edge is directed from the vertex with the smaller ID to the vertex with the larger ID. That is, 1,2,...,N is one possible topological order of the vertices. * There are exactly L different paths from Vertex 1 to Vertex N. The lengths of these paths are all different, and they are integers between 0 and L-1. Here, the length of a path is the sum of the lengths of the edges contained in that path, and two paths are considered different when the sets of the edges contained in those paths are different. Constraints * 2 \leq L \leq 10^6 * L is an integer. Input Input is given from Standard Input in the following format: L Output In the first line, print N and M, the number of the vertices and edges in your graph. In the i-th of the following M lines, print three integers u_i,v_i and w_i, representing the starting vertex, the ending vertex and the length of the i-th edge. If there are multiple solutions, any of them will be accepted. Examples Input 4 Output 8 10 1 2 0 2 3 0 3 4 0 1 5 0 2 6 0 3 7 0 4 8 0 5 6 1 6 7 1 7 8 1 Input 5 Output 5 7 1 2 0 2 3 1 3 4 0 4 5 0 2 4 0 1 3 3 3 5 1
[ "#解説参照\nl=int(input())\nr=0\nwhile 2**(r+1)<=l:\n r+=1\nn=r+1\nans=[]\nfor i in range(r):\n ans.append((i+1,i+2,0))\n ans.append((i+1,i+2,2**i))\n\nfor t in range(n-1,0,-1):\n if l-2**(t-1)>=2**r:\n ans.append((t,n,l-2**(t-1)))\n l-=2**(t-1)\nprint(n,len(ans))\nfor a in ans:\n print(*a)", "#include <cstdio>\nint main(){\n\tint L,min=233,ans=0; scanf(\"%d\",&L);\n\tfor (int i=0;i<20;i++) if ((1<<i)&L) min=i,ans++;\n\tans+=min*2; if (min==19) ans--;\n\tprintf(\"20 %d\\n\",ans);\n\tfor (int i=1;i<=min;i++) printf(\"%d %d %d\\n%d %d %d\\n\",i,i+1,0,i,i+1,1<<i-1);\n\tint x=min==19?524288:0;\n\tfor (int i=0;i<19;i++) if (1<<i&L) printf(\"%d %d %d\\n\",i+1,20,x),x+=1<<i;\n}", "#include <bits/stdc++.h>\n#define fi first\n#define se second\n#define rep(i,s,n) for (int i = (s); i < (n); ++i)\n#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)\n#define all(a) a.begin(),a.end()\n#define rall(a) a.rbegin(),a.rend()\n#define len(x) (int)(x).size()\n#define dup(x,y) (((x)+(y)-1)/(y))\n#define pb push_back\n#define Field(T) vector<vector<T>>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n\nvoid print3(int x, int y, int z) {\n printf(\"%d %d %d\\n\",x,y,z);\n}\n\nint main() {\n int l;\n cin >> l;\n int n = 0;\n while(l >= (1 << n)) {\n n++;\n }\n int m = (n-1)*2 + __builtin_popcount(l) - 1;\n cout << n << \" \" << m << endl;\n rep(i,1,n) {\n print3(i,i+1,0);\n print3(i,i+1,1<<(i-1));\n }\n int k = l;\n rep(i,0,n-1) {\n if (l & (1 << i)) {\n k -= (1<<i);\n print3(i+1,n,k);\n }\n }\n return 0;\n}\n", "#include <cmath>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nstruct edge {\n int src;\n int dst;\n int cost;\n};\n\nint main() {\n int L, N, M;\n cin >> L;\n\n vector< edge > e;\n\n N = floor(log2(L)) + 1;\n M = 0;\n\n for (int i = 1; i < N; i++) {\n e.push_back((edge){i, i + 1, 0});\n e.push_back((edge){i, i + 1, int(pow(2, i - 1))});\n M += 2;\n }\n\n for (int i = N - 1; i >= 1; i--) {\n if (L - pow(2, N - 1) >= pow(2, i - 1)) {\n e.push_back((edge){i, N, int(L - pow(2, i - 1))});\n L -= pow(2, i - 1);\n M++;\n }\n }\n\n cout << N << \" \" << M << endl;\n for (int i = 0; i < M; i++) {\n cout << e[i].src << \" \" << e[i].dst << \" \" << e[i].cost << endl;\n }\n}", "import math\nl = int(input())\nn = math.floor(math.log2(l)) + 1\ne = []\nfor v in range(n-1):\n e.append([v+1, v+2, 0])\n e.append([v+1, v+2, 2**v])\n if (l>>v)&1:\n e.append([v+1, n, l-2**v])\n l -= 2**v\nprint(n, len(e))\nfor x in e:\n print(\" \".join(map(str, x)))", "l=bin(int(input()))[2:];n=len(l);print(n,2*n+l.count(\"1\")-3)\nfor i in range(1,n):print(i,i+1,0);print(i,i+1,1<<(i-1))\nw=1<<(n-1)\nfor i in range(1,n)[::-1]:\n if l[n-i]==\"1\":print(i,n,w);w+=1<<(i-1)", "#include <stdio.h>\n\nint main(){\n int L;\n int n,e=0;\n scanf(\"%d\",&L);\n\n for(n=0;L>=2<<n;n++)\n if(L&1<<n)\n e++;\n\n printf(\"%d %d\\n\",n+1,e+2*n);\n\t\n e=0;\n for(int i=0;L>=2<<i;i++){\n printf(\"%d %d %d\\n\",i+1,i+2,0);\n printf(\"%d %d %d\\n\",i+1,i+2,1<<i);\n if(L&1<<i){\n printf(\"%d %d %d\\n\",i+1,n+1,(1<<n)+((1<<i)-1)&L);\n // printf(\"%d %d %d\\n\",i+1,n+1,(1<<n)+e);\n e+=1<<i;\n }\n }\n}\n", "l=int(input())\nd=l.bit_length()\ng=[]\nfor i in range(d-1):\n g.append((i+1,i+2,0))\n g.append((i+1,i+2,2**(d-i-2)))\ns=1<<(d-1)\nfor i in range(d-1)[::-1]:\n if (1<<i)&l:\n g.append((1,d-i,s))\n s+=1<<i\nprint(d,len(g))\nfor u,v,c in g:\n print(u,v,c)", "#include<iostream>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\n\nll p2[50] = {};\n\nll pow2(ll n){\n if(n==0 || n==1) return n+1;\n if(p2[n] != 0) return p2[n];\n else return pow2(n/2)*pow2(n/2)*pow2(n-2*(n/2));\n}\n\nint main()\n{\n ll l,n=0,m=0,k[30];\n cin >> l;\n while(pow2(n)<=l) n++;\n m=2*(n-1);\n for(ll i=0;i<n;i++){\n k[i]=(l%pow2(i+1)-l%pow2(i))/pow2(i);\n if(i<n-1 && k[i]==1) m++;\n }\n cout<< n << \" \" << m<<endl;\n for(ll i=1;i<n;i++) cout<< i << \" \" << i+1 << \" \" << 0 << endl << i << \" \" << i+1 << \" \" << pow2(n-i-1) << endl;\n for(ll i=0;i<n-1;i++){\n if(k[i]==1) cout<< 1 << \" \" << n-i << \" \" << l-l%pow2(i+1) << endl;\n }\n \n}", "#include <bits/stdc++.h>\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n// const bool debug=true;\nconst bool debug=false;\n#define DEBUG if(debug==true)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\nll l;\n \nstruct edge {\n ll from,to,weight;\n edge(ll from, ll to, ll weight) : from(from), to(to), weight(weight){}\n};\n \nint main(void) {\n cin >> l;\n vector<edge> e;\n ll cnt;\n ll max_n=0;\n for(cnt=1;(1LL<<cnt)<=l;cnt++){\n e.push_back(edge(cnt,cnt+1,0)); \n e.push_back(edge(cnt,cnt+1,(1LL<<cnt-1))); \n max_n+=1LL<<cnt-1;\n }\n ll cur;\n while(max_n!=l-1){\n cur=log2(l-max_n-1)+1;\n DEBUG{\n cout << cur << endl;\n }\n e.push_back(edge(cur,cnt,max_n+1));\n max_n+=(1LL<<cur-1);\n }\n cout << cnt << \" \" << e.size() << endl;\n for(auto x:e){\n printf(\"%lld %lld %lld\\n\",x.from, x.to, x.weight);\n }\n \n return 0;\n}", "#\n# 　　 ⋀_⋀　 \n#　　 (･ω･) \n# .／ Ｕ ∽ Ｕ＼\n# │＊　合　＊│\n# │＊　格　＊│ \n# │＊　祈　＊│ \n# │＊　願　＊│ \n# │＊　　　＊│ \n# ￣\n#\nimport sys\nsys.setrecursionlimit(10**6)\ninput=sys.stdin.readline\nfrom math import floor,sqrt,factorial,hypot,log #log2ないｙｐ\nfrom heapq import heappop, heappush, heappushpop\nfrom collections import Counter,defaultdict,deque\nfrom itertools import accumulate,permutations,combinations,product,combinations_with_replacement\nfrom bisect import bisect_left,bisect_right\nfrom copy import deepcopy\nfrom fractions import gcd\nfrom random import randint\ndef ceil(a,b): return (a+b-1)//b\ninf=float('inf')\nmod = 10**9+7\ndef pprint(*A): \n for a in A: print(*a,sep='\\n')\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [I() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n L=I()\n power = 1\n N = 1\n while power<<1 <= L:\n power<<=1\n N+=1\n \n ans = []\n for i in range(N-1):\n ans.append((i+1,i+2,0))\n ans.append((i+1,i+2,1<<i))\n for i in range(N-1)[::-1]:\n X=L-(1<<i)\n if(X>=power): #X<(1<<N)ならダブる\n ans.append((i+1,N,X))\n L-=1<<i\n M=len(ans)\n print(N,M)\n for a in ans:\n print(*a)\nif __name__ == '__main__':\n main()", "L = int(input())\nedges = []\n\np2 = 1\nN = 1\n\n\"\"\" 2べきのとき多重辺\n 0 0 0 0 ...\n1 === 2 === 3 === 4 === 5 ...\n 1 2 4 8 ...\n\"\"\"\nwhile L >= p2 * 2:\n N += 1\n p2 *= 2\n edges.append((N - 1, N, 0))\n edges.append((N - 1, N, 2 ** (N - 2)))\n\nrest = L - p2\ntmp = p2\nfor i in range(N, -1, -1):\n if (rest >> i) & 1:\n edges.append((i + 1, N, tmp))\n tmp += 2 ** i\n\nM = len(edges)\n# assert N <= 20 and M <= 60\nprint(N, M)\nfor edge in edges:\n print(*edge)\n", "#include <bits/stdc++.h>\n#define INF (1<<30)\n#define MOD 1000000007\n#define l_ength size\nusing ll = long long;\nusing namespace std;\n\nint main(){\n\tint l;\n\tcin >> l;\n\tint cnt = 0; \n\tint k;\n\tfor( k = 0; (1<<k) <= l; k++ ){\n\t\tif( (1<<k) & l ){\n\t\t\t++cnt;\n\t\t}\n\t}\n\tcout << k << \" \" << 2*(k-1)+cnt-1 << endl;\n\tfor( int i = 0; i < k-1; ++i ){\n\t\tcout << i+1 << \" \" << i+2 << \" \" << (1<<i) << endl;\n\t\tcout << i+1 << \" \" << i+2 << \" \" << 0 << endl;\n\t}\n\tint herum = l;\n\tfor( int i = 0; i < k-1; ++i ){\n\t\tif( (1<<i) & l ){\n\t\t\therum -= (1<<i);\n\t\t\tcout << i+1 << \" \" << k << \" \" << herum << endl; \n\t\t}\n\t}\n\treturn 0;\n}", "// I SELL YOU...! \n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<functional>\n#include<queue>\n#include<chrono>\n#include<iomanip>\n#include<map>\n#include<set>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll,ll>;\nusing TP = tuple<ll,ll,ll>;\nvoid init_io(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(18);\n}\nsigned main(){\n init_io();\n ll l,n=0;\n cin >> l;\n vector<TP> ans;\n ll r=1,c=0,rc=1;\n while(r<=l){\n r*=2;\n c++;\n }\n r/=2;\n c--;\n for(int i=0;i<c;i++){\n n++;\n ans.push_back(TP(n,n+1,0));\n ans.push_back(TP(n,n+1,rc));\n rc*=2;\n }\n ll v = r;\n n++;\n rc/=2;\n for(int i=n-2;i>=0;i--){\n //cout << l<<\"de \"<<r<<\" \"<<rc<<endl;\n if(l-r>=rc){\n ans.push_back(TP(i+1,n,v));\n v+=rc;\n l-=rc;\n }\n rc/=2;\n }\n cout << n <<\" \"<<ans.size()<<endl;\n for(auto tp:ans){\n cout << get<0>(tp)<<\" \"<<get<1>(tp)<<\" \"<<get<2>(tp)<<endl;\n }\n}\n", "L = int(input())\nN = L.bit_length()\nC = []\nfor i in range(N-1):\n C.append((N-i-1, N-i, 1 << i))\n C.append((N-i-1, N-i, 0))\nv = 1\nfor i in range(N-1):\n if v & L:\n L ^= v\n C.append((1, N-i, L))\n v <<= 1\nprint(N, len(C))\nfor x, y, z in C:\n print(x, y, z)\n", "from collections import defaultdict, Counter\nfrom itertools import product, groupby, count, permutations, combinations\nfrom math import pi, sqrt\nfrom collections import deque\nfrom bisect import bisect, bisect_left, bisect_right\nfrom string import ascii_lowercase\nfrom functools import lru_cache\nimport sys\nsys.setrecursionlimit(10000)\nINF = float(\"inf\")\nYES, Yes, yes, NO, No, no = \"YES\", \"Yes\", \"yes\", \"NO\", \"No\", \"no\"\ndy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]\ndy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]\n\n\ndef inside(y, x, H, W):\n return 0 <= y < H and 0 <= x < W\n\n\ndef ceil(a, b):\n return (a + b - 1) // b\n\n\ndef main():\n L = int(input())\n\n m = []\n while L > 1:\n if L % 2 == 0:\n m.append(0)\n L //= 2\n else:\n m.append(1)\n L -= 1\n\n ans = []\n last = 1\n l = 1\n for x in m[::-1]:\n if x == 0:\n for i in range(len(ans)):\n ans[i][2] *= 2\n\n ans.append([last, last + 1, 0])\n ans.append([last, last + 1, 1])\n last += 1\n l *= 2\n else:\n ans.append([1, last, l])\n l += 1\n\n print(last, len(ans))\n for x in ans:\n print(*x)\n\n\nif __name__ == '__main__':\n main()\n", "// https://atcoder.jp/contests/abc108/tasks/arc102_b\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)\n#define DUMP(a, n) REP(_i, n) printf(\"%d%c\", a[_i], _i + 1 == n ? '\\n' : ' ')\n#define DUMP2D(a, n, m) REP(_i, n) REP(_j, m) printf(\"%d%c\", a[_i][_j], _j + 1 == m ? '\\n' : ' '); puts(\"\")\n\nconst int L_MAX = 1e6;\nconst int N_MAX = 20;\n\nint L;\nint N;\nint M;\nint bs[N_MAX];\n\nstruct edge { int from, to, len; };\nvector<edge> es;\n\nvoid solve() {\n N = 0, M = 0;\n for (int l = L; l > 0; l >>= 1) {\n bs[N++] = l & 1;\n }\n\n int k = L;\n REP(i, N - 1) {\n es.push_back({i + 1, i + 2, 0});\n es.push_back({i + 1, i + 2, 1 << i});\n if (bs[i]) {\n k ^= 1 << i;\n es.push_back({i + 1, N, k});\n }\n }\n\n M = es.size();\n printf(\"%d %d\\n\", N, M);\n REP(i, M) printf(\"%d %d %d\\n\", es[i].from, es[i].to, es[i].len);\n}\n\nvoid input() {\n scanf(\"%d\", &L);\n}\n\nint main() {\n input();\n solve();\n return 0;\n}\n", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static class Edge {\n\t\tpublic int src, dst, length;\n\n\t\tpublic Edge(int src, int dst, int length) {\n\t\t\tthis.src = src;\n\t\t\tthis.dst = dst;\n\t\t\tthis.length = length;\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint L = Integer.parseInt(in.nextLine());\n\t\tint nodeNum = getNodeNum(L);\n\t\t// System.out.println(\"nodeNum: \" + nodeNum);\n\t\tList<Edge> edges = genEdges(nodeNum, L);\n\t\tSystem.out.println(nodeNum + \" \" + edges.size());\n\t\tfor (Edge edge : edges) {\n\t\t\tSystem.out.println(edge.src + \" \" + edge.dst + \" \" + edge.length);\n\t\t}\n\t\tin.close();\n\t}\n\n\tpublic static int getNodeNum(int L) {\n\t\tint result = 0;\n\t\tfor (int i = 1; i <= 20; ++i) {\n\t\t\tif (Math.pow(2.0, (double) i) > L) {\n\t\t\t\tresult = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static List<Edge> genEdges(int nodeNum, int L) {\n\t\tList<Edge> result = new ArrayList<>();\n\t\tfor (int i = 1; i + 1 <= nodeNum; ++i) {\n\t\t\tint length = (int) Math.pow(2.0, i - 1);\n\t\t\tresult.add(new Edge(i, i + 1, length));\n\t\t\tresult.add(new Edge(i, i + 1, 0));\n\t\t}\n\t\tint l = L;\n\t\tfor (int i = nodeNum - 1; i >= 1; --i) {\n\t\t\tif (l - Math.pow(2, i - 1) >= Math.pow(2.0, nodeNum - 1)) {\n\t\t\t\t// System.out.println(i + \", \");\n\t\t\t\tresult.add(new Edge(i, nodeNum, (int) (l - Math.pow(2, i - 1))));\n\t\t\t\tl -= Math.pow(2.0, i - 1);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n}", "l = int(input())\n# l = 1000000\nr = 1\nwhile 2 ** r <= l:\n r += 1\nr = min(19, r - 1)\n# print(r)\n\nn = r + 1\n# print(n)\n\nts = [i for i in range(1, n)]\nts.reverse()\n# print(ts)\n\nm = (n - 1) * 2\n\npoints = {}\n\nfor t in ts:\n a = l - 2 ** (t - 1)\n b = 2 ** r\n if a >= b:\n points[t] = a\n l -= 2 ** (t - 1)\n\nm += len(points)\nprint(n, m)\nfor i in range(1, (n - 1) * 2 + 1):\n p = (i - 1) // 2 + 1\n if i % 2 == 0:\n print(p, p + 1, 0)\n else:\n print(p, p + 1, 2 ** (p - 1))\n\nfor k in points.keys():\n print(k, n, points[k])\n", "L = int(input())\nB = bin(L)\nN = len(B)-2\nLines = []\nfor i in range(1,N):\n Lines.append((i,i+1,0))\n Lines.append((i,i+1,2**(i-1)))\n\nfor i in range(N-1):\n if B[N+1-i] == '1':\n Lines.append((i+1,N,L-2**i))\n L -= 2**i\n\nprint(N,len(Lines))\nfor Line in Lines:\n print(\"{} {} {}\".format(Line[0],Line[1],Line[2]))", "import sys\nsys.setrecursionlimit(10000000)\nMOD = 10 ** 9 + 7\nINF = 10 ** 15\n\ndef main():\n L = int(input())\n edges = []\n vertex = 1\n flag = True\n before = -1\n for i in range(19,-1,-1):\n if (L>>i)&1:\n if flag:\n flag = False\n vertex = i + 1\n for j in range(1,vertex):\n edges.append((j,j + 1,0))\n edges.append((j,j + 1,1<<(j - 1)))\n before = 1<<i\n else:\n edges.append((i + 1,vertex,before))\n before += 1<<i\n print(vertex,len(edges))\n for t in edges:\n print(*t)\nif __name__ == '__main__':\n main()", "#include<iostream>\n#include<iomanip>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<functional>\n#include<map>\n#include<cstdlib>\n#include<complex>\n#include<numeric>\n#include<set>\n#include<deque>\n#include<queue>\n\nusing namespace std;\nusing Int = long long;\nInt INF = 1LL << 60;\nconst Int MOD = 1000000000 + 7;\n\nint main() {\n\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tInt L;\n\tcin >> L;\n\n\tL--;\n\n\tInt k = 1;\n\tvector<vector<Int>> ans;//from, to , 重み\n\twhile (true) {\n\t\tif ((1LL<<k)-1<=L) {\n\t\t\tans.push_back({ k,k + 1,0 });\n\t\t\tans.push_back({ k,k + 1,1LL<<(k-1) });\n\t\t\tk++;\n\t\t}\n\t\telse {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tInt rest = L - ((1LL << (k-1)) - 1);//残り通り数\n\tfor (Int i = 25; i >= 0; i--) {\n\t\tif (rest>=(1LL<<i)) {\n\t\t\tans.push_back({ i + 1,k,L - (1LL << i) + 1 });\n\t\t\trest -= (1LL << i);\n\t\t\tL -= (1LL << i);\n\t\t}\n\t}\n\n\tInt len = ans.size();\n\tcout << k << \" \" << len << \"\\n\";\n\tfor (Int i = 0; i < len; i++) {\n\t\tcout << ans[i][0]<<\" \"<<ans[i][1]<<\" \"<<ans[i][2] << \"\\n\";\n\t}\n\n}\n", "L = int(input())\n\nN, r = 0, 1\n\nwhile r <= L:\n r *= 2\n N += 1\n\nG = []\nfor i in range(1, N):\n G.append( [i, i+1, 0] )\n G.append( [i, i+1, int(2**(i-1))] )\n\nremain = L - int(2**(N-1))\n\nfor i in range(N-1, 0, -1):\n if remain == 0:\n break\n\n if remain >= int(2**(i-1)): \n G.append( [i, N, L-remain] )\n remain -= int(2**(i-1))\n\nprint (N, len(G))\n\nfor i in G:\n print (\" \".join(map(str, i)))\n", "L = int(input())\n\nx = L\n\nxs1 = []\nxs2 = []\nxs3 = []\n\nfor i in range(19):\n c = 18 - i\n xs1.append((i + 1, i + 2, 0))\n\n#print(\"x=\", x)\n\nb = 0\n\nfor i in range(20):\n n = 19 - i\n r = 2 ** n\n if x >= r:\n m = n\n x -= r\n b += r\n #print(n, r, x, b)\n break\n\n#print(\"m=\", m)\n#print(\"i=\", i)\n\nfor i in range(i + 1, 20):\n n = 19 - i\n r = 2 ** n\n if x >= r:\n xs3.append((n + 1, 20, b))\n x -= r\n b += r\n #print(n, r, x, b)\n\nfor i in range(m):\n xs2.append((i + 1, i + 2, 2**i))\n\nxs = xs1 + xs2 + xs3\n\nprint(20, len(xs))\n\nfor x in xs:\n print(*x)\n", "#include <bits/stdc++.h>\n#define sp ' '\n#define nyan \"(=^・ω・^=)\"\n#define mkp make_pair\n#define intmax 2147483647\n#define llmax 9223372036854775807\n#define lP pair<ll,ll>\n#define iP pair<int,int>\ntypedef long long ll;\nusing namespace std;\nconst int mod = 1000000007;\n\nint L, t;\nvector<pair<pair<int, int>, int>>v;\n\nint main() {\n\tcin >> L;\n\tfor (int i = 1; i != 19; ++i) {\n\t\tv.push_back(mkp(mkp(i, i + 1), 0));\n\t\tv.push_back(mkp(mkp(i, i + 1), 1 << (i - 1)));\n\t}\n\tif (L&(1 << 19)) {\n\t\tv.push_back(mkp(mkp(19, 20), 0));\n\t\tv.push_back(mkp(mkp(19, 20), 1 << 18));\n\t\tt += 1 << 19;\n\t}\n\tfor (int i = 19; i; --i) {\n\t\tif (L&(1 << i - 1)) {\n\t\t\tv.push_back(mkp(mkp(i, 20), t));\n\t\t\tt += 1 << i - 1;\n\t\t}\n\t}\n\tcout << 20 << sp << v.size() << endl;\n\tfor (int i = 0; i != v.size(); ++i)\n\t\tcout << v[i].first.first << sp << v[i].first.second << sp << v[i].second << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define FOR(i,a,b) for(int i=(a); i<(b); i++)\n#define ALL(v) v.begin(), v.end()\n#define RALL(v) v.rbegin(), v.rend()\ntypedef long long ll;\nint main(){\n int l; cin >> l;\n vector<tuple<int, int, int>> ans;\n int r = log2(l);\n for(int i = 1; i <= r; i++){\n ans.push_back(make_tuple(i, i+1, 0));\n ans.push_back(make_tuple(i, i+1, 1<<(i-1)));\n }\n\n for(int i = r; i >= 1; i--){\n int a = l - (1<<(i-1));\n if(a < (1<<r)) continue;\n ans.push_back(make_tuple(i, r+1, a));\n l = a;\n }\n\n int n = r+1;\n int m = ans.size();\n cout << n << \" \" << m << endl;\n for(auto t : ans) cout << get<0>(t) << \" \" << get<1>(t) << \" \" << get<2>(t) << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(long i = 0; i < n; i++)\n#define erep(i, n) for(long i = 1; i <= n; i++)\nconst long MOD = 1000000007;\n#define all(a) a.begin(), a.end()\n#define show(ans) cout << ans << endl;\n\n\nint main() {long L;\ncin >> L;\nvector<long> ans1, ans2, ans3;\nlong r = 1;\nwhile(pow(2, r) <= L) r++;\nr--;\nerep(i, r){\n ans1.push_back(i); ans2.push_back(i+1); ans3.push_back(0);\n ans1.push_back(i); ans2.push_back(i+1); ans3.push_back(pow(2, i-1));\n\n // cout << i << ' ' << i+1 << ' ' << 0 << endl;\n // cout << i << ' ' << i+1 << ' ' << pow(2, i-1) << endl;\n}\nlong X = L - (pow(2, r));\nlong tmp = pow(2, r);\nfor(long i = r-1; i >= 0; i--){\n if((1 << i) & X){\n // cout << i+1 << ' ' << r+1 << ' ' << tmp << endl;\n ans1.push_back(i+1); ans2.push_back(r+1); ans3.push_back(tmp);\n tmp += pow(2, i);\n }\n}\ncout << r+1 << ' ' << ans1.size() << endl;\nrep(i, ans1.size()){\n cout << ans1[i] << ' ' << ans2[i] << ' ' << ans3[i] << endl;\n}\n\n// show(ans);\n return 0;\n \n}\n\n", "def main():\n L = int(input())\n N = 2\n while 2**N <= L:\n N += 1\n L -= 2**(N-1)\n E = []\n for i in range(N-1):\n E.append((N-i-1, N-i, 0))\n E.append((N-i-1, N-i, 2**i))\n i = 0\n nxt = 2**(N-1)\n for i in range(2, N+1):\n tmp = 2**(N-i)\n if tmp <= L:\n E.append((1, i, nxt))\n L -= tmp\n nxt += tmp\n print(N, len(E))\n for u, v, w in E:\n print(u, v, w)\n\n\nif __name__ == \"__main__\":\n main()\n", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint l;\nconst int n = 20;\nint m = 0;\nvector<int> et[n];\nvector<int> ec[n];\n\nint main() {\n\tint i, j;\n\t\n\tcin >> l;\n\t\n\tint mul = 1;\n\tfor (i = n - 2; i >= 1; i--) {\n\t\tet[i].push_back(i + 1);\n\t\tec[i].push_back(mul);\n\t\tet[i].push_back(i + 1);\n\t\tec[i].push_back(0);\n\t\tmul *= 2;\n\t\tm += 2;\n\t}\n\t\n\tint offset = 0;\n\tfor (i = 1; i < n; i++) {\n\t\tmul = (1 << (n - 1 - i));\n\t\twhile (offset + mul <= l) {\n\t\t\tet[0].push_back(i);\n\t\t\tec[0].push_back(offset);\n\t\t\toffset += mul;\n\t\t\tm++;\n\t\t}\n\t}\n\t\n\tcout << n << \" \" << m << endl;\n\tfor (i = 0; i < n; i++) {\n\t\tfor (j = 0; j < et[i].size(); j++) {\n\t\t\tcout << i + 1 << \" \" << et[i][j] + 1 << \" \" << ec[i][j] << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "L = int(input())\nfor i in range(21):\n if 2**i > L:\n r = i-1\n break\n \nN = r+1\nans = []\nfor i in range(1, N):\n ans.append([str(i), str(i+1), str(2**(i-1))])\n ans.append([str(i), str(i+1), str(0)])\n\nt = N-1\nwhile t >= 1:\n if L-2**(t-1) >= 2**r:\n ans.append([str(t), str(N), str(L-2**(t-1))])\n L -= 2**(t-1)\n t -= 1\n \nprint(N, len(ans))\nfor i in range(len(ans)):\n print(\" \".join(ans[i]))", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint n = 1, m = 0;\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile((1<<n-1)-1<l) n++;\n\t\tn--;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tsb.append(String.valueOf(i)+' '+String.valueOf(i+1)+\" 0\\n\");\n\t\t\tsb.append(String.valueOf(i)+' '+String.valueOf(i+1)+' '+String.valueOf(1<<(i-1))+\"\\n\");\n\t\t\tm += 2;\n\t\t}\n\t\tint max = (1<<n-1)-1;\n\t\twhile(l-max>1) {\n\t\t\tint k = 1;\n\t\t\twhile((1<<k-1)<l-max) k++;\n\t\t\tk--;\n\t\t\tsb.append(String.valueOf(k)+' '+String.valueOf(n)+' '+String.valueOf(max+1)+\"\\n\");\n\t\t\tm++;\n\t\t\tmax += (1<<k-1);\n\t\t}\n\t\tSystem.out.printf(\"%d %d\\n\",n,m);\n\t\tSystem.out.println(new String(sb));\n\t\tsc.close();\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n//#undef int\n#define mk make_pair\n#define pb push_back\ntypedef pair<int, int> pii;\nconst int mod = 1000000007;\nconst int INF = 1000000009;\nconst long long INFL = 1000000000000000018ll;\n\nint L;\n\nsigned main()\n{\n cin >> L;\n int n = 1, cnt = 0ll;\n while(n <= L){\n n *= 2;\n cnt++;\n }\n n /= 2;\n int l = L;\n int M = 0ll;\n while(l){\n if(l & 1ll){\n M++;\n }\n l >>= 1;\n }\n printf(\"%lld %lld\\n\", cnt, M - 1 + (cnt - 1) * 2);\n int a = 1;\n for(int i = 1; i < cnt; i++){\n printf(\"%lld %lld %lld\\n\", i, i + 1, a);\n printf(\"%lld %lld %lld\\n\", i, i + 1, 0);\n a *= 2ll;\n }\n l = L;\n for(int i = cnt - 2; i >= 0; i--){\n if(L & (1ll << i)){\n printf(\"%lld %lld %lld\\n\", i + 1, cnt, L - (1ll << i));\n L -= (1ll << i);\n }\n }\n\n return 0;\n}\n\n/*\n\n\n*/\n", "L = int(input())\nN=0\nA=[]\nret=[]\nwhile True:\n N += 1\n A.append(L % 2)\n L //= 2\n if L<1:\n break\n\ns=2\nl=1\nM = 0\nfor i in range(len(A)-2,-1,-1):\n ret.append(\"{0} {1} {2}\".format(s-1, s, l))\n ret.append(\"{0} {1} {2}\".format(s-1, s, 0))\n M += 2\n if A[i]==1:\n l *= 2\n ret.append(\"{0} {1} {2}\".format(1, s, l))\n l += 1\n M += 1\n else:\n l *= 2\n \n s += 1\n \nprint (\"{0} {1}\".format(N, M))\nfor r in ret:\n print (r)", "n=int(input())\nt=n\nar=[]\nwhile(t>0):\n ar.append(t)\n if t%2==0:\n t=t//2\n else:\n t-=1\nclass Graph():\n def __init__(self):\n self.vertices=set()\n self.edges=[]\n def addedge(self,a,b,w):\n self.edges.append([a,b,w])\n self.vertices.add(a)\n self.vertices.add(b)\ng=Graph()\ng.addedge(0,1,0)\ng.addedge(0,1,1)\nfor i in range(3,len(ar)+1):\n if ar[-i]==ar[-i+1]+1:\n g.addedge(0,len(g.vertices)-1,ar[-i]-1)\n else:\n for j in g.edges:\n j[2]*=2\n g.addedge(len(g.vertices)-1,len(g.vertices),0)\n g.addedge(len(g.vertices)-2,len(g.vertices)-1,1)\n\n\nprint(len(g.vertices),len(g.edges))\n\nfor i in g.edges:\n print(i[0]+1,i[1]+1,i[2])\n\n\n\n", "n=int(input())\ncnt=0\nwhile 2**cnt-1<n:\n cnt+=1\ncnt-=1\ngraph=[]\nfor i in range(cnt):\n graph.append((1+i,2+i,2**i))\n graph.append((1+i,2+i,0))\nexistmax=2**cnt-1\nfor i in range(1,cnt+1)[::-1]:\n if 2**(i-1)-1+existmax+1<=n-1:\n graph.append((i,cnt+1,existmax+1))\n existmax=existmax+1+2**(i-1)-1\nL=len(graph)\nprint(cnt+1,L)\nfor i in graph:\n print(*i)\n", "#!/usr/bin/env python3\n\ndef main():\n L = int(input())\n\n N = 0\n e = []\n\n d = L\n k = 0\n while 0 < d:\n d = int(d / 2)\n k += 1\n if 2 <= k:\n e.append((k - 1, k, 0))\n e.append((k - 1, k, 2 ** (k - 2)))\n\n N = k\n\n d = L\n k = 0\n s = []\n while 1 < d:\n d, m = int(d / 2), d % 2\n if m == 1:\n s.append(k)\n k += 1\n\n a = 2 ** (N - 1)\n for i in range(len(s) - 1, -1, -1):\n k = s[i]\n e.append((k + 1, N, a))\n a += 2 ** k\n\n\n print('{} {}'.format(N, len(e)))\n for v in e:\n print('{} {} {}'.format(v[0], v[1], v[2]))\n\nif __name__ == '__main__':\n main()\n\n", "L = int(input())\nL2 = bin(L)[2:]\nN = len(L2)\nL2d = L2[1:]\nL2u = int(\"0b\"+L2,0) - int(\"0b\"+L2d,0)\nL2u2 = L2u//2\ntmp = 1\nM = 0\nAns = []\nif L2u != 0:\n tmpN = N\n while tmp != L2u:\n Ans.append([tmpN-1,tmpN,0])\n Ans.append([tmpN-1,tmpN,tmp])\n tmp *= 2\n tmpN -= 1\n M += 2\nflag = 0\nfor i in range(len(L2d)):\n if L2d[i] == \"1\" and flag == 0:\n Ans.append([1, i+2, L2u])\n tmp = 2**(N-i-2)\n M += 1\n flag = 1\n B = L2u\n elif L2d[i] == \"1\":\n Ans.append([1, i+2, B+tmp])\n B = B+tmp\n tmp = 2**(N-i-2)\n M += 1\nprint(*[N,M])\nfor i in range(M):\n print(*Ans[i])", "import sys\nsys.setrecursionlimit(10**9)\nINF=10**18\nMOD=10**9+7\ndef input(): return sys.stdin.readline().rstrip()\n\ndef main():\n L=int(input())\n tmp=L\n tmp2=L\n l=[]\n while tmp2!=0:\n c=0\n while tmp!=1:\n tmp//=2\n c+=1\n l.append(c)\n tmp2-=2**c\n tmp=tmp2\n N=l[0]+1\n M=0\n ans=[]\n w=1\n for i in range(l[0]):\n ans.append((i+1,i+2,0))\n ans.append((i+1,i+2,w))\n M+=2\n w*=2\n for x in l[1:]:\n ans.append((x+1,N,w))\n w+=2**x\n M+=1\n print(N,M)\n for z in ans:\n print(*z)\n \n\nif __name__ == '__main__':\n main()\n", "// review\n\n#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\ntypedef long long ll;\n\nll l;\n\nvoid solve() {\n int n = 0;\n while (l >= pow(2, n)) {\n n++;\n }\n\n vector<vector<ll> > v;\n for (int i=1;i<n;i++) {\n v.push_back({i, i+1, (ll)pow(2, i-1)});\n v.push_back({i, i+1, 0});\n }\n\n for (int i=n-1;i>0;i--) {\n if (l - pow(2, i-1) >= pow(2, n-1)) {\n v.push_back({i, n, (ll)(l - pow(2, i-1))});\n l -= pow(2, i-1);\n }\n }\n cout << n << \" \" << v.size() << endl;\n for (int i=0;i<v.size();i++) {\n cout << v[i][0] << \" \" << v[i][1] << \" \" << v[i][2] << endl;\n }\n}\n\nint main() {\n cin >> l;\n solve();\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntypedef long double ld;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\n#define F first\n#define S second\n \nconst int mx=200010;\nconst ll mod=1e9+7;\n\n\n\nint main(){\n int l;\n cin>>l;\n int ansnode=0;\n vector <pair<P,int>> ansv;\n \n int kasu=l;\n int longe=floor(log2(l));\n\n int cnt=0;\n while(cnt<longe){\n ansv.push_back({{cnt+1,cnt+2},0});\n ansv.push_back({{cnt+1,cnt+2},pow(2,cnt)});\n cnt++;\n }\n\n ansnode=cnt+1;\n \n int mpass=ansnode-1;\n int mainpass=pow(2,longe);\n while(kasu>mainpass){\n if(kasu-pow(2,mpass)>=mainpass){\n ansv.push_back({{mpass+1,ansnode},kasu-pow(2,mpass)});\n kasu=kasu-pow(2,mpass);\n }\n mpass--;\n }\n\n cout << ansnode << \" \" <<ansv.size() <<endl;\n rep(i,ansv.size()){\n cout << ansv[i].F.F << \" \" <<ansv[i].F.S << \" \" << ansv[i].S << endl;\n }\n return 0;\n}\n \n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n int n,m,l;\n cin >> l;\n int x = 0;\n int nn = l;\n while(nn>0){\n x++;\n nn >>= 1;\n }\n n = x;\n m = 0;\n \n vector<vector<pair<int, int>>> G(n);\n for(int i = 1; i < n;i++){\n G[i].push_back({i + 1, 1 << (i-1)});\n G[i].push_back({i + 1, 0});\n m += 2;\n }\n for(int i = n-1; i >= 1;i--){\n if(l - (1<<(i-1))>=1<<(x-1)){\n m++;\n G[i].push_back({n, l - (1 << (i-1))});\n l -= 1 << (i-1);\n }\n }\n printf(\"%d %d\\n\", n, m);\n for(int i = 1; i < n; i++) {\n for(pair<int,int> p:G[i]){\n printf(\"%d %d %d\\n\", i, p.first, p.second);\n }\n }\n return 0;\n}", "L = int(input())\nN = L.bit_length()\nres = []\nfor i in range(N - 1):\n res.append((i + 1, i + 2, 0))\n res.append((i + 1, i + 2, 2**i))\nrem = L - 2**(N - 1) \nk = 2**(N - 1)\nfor i in range(rem.bit_length())[::-1]:\n if (rem >> i) & 1:\n res.append((i + 1, N, k))\n k += 2**i\nprint(N, len(res))\nfor r in res:\n print(*r)", "#include <cmath>\n#include <cstdio>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <set>\n#include <map>\n#define REP(i,n) for(ll i = 0; i < (ll)n; i++)\n#define INF 1000000000000000\nusing namespace std;\ntypedef long long ll;\ntypedef double db;\ntypedef string str;\n\nstruct edge{ll from, to, weight;};\n\nint main(){\n ll L;\n cin >> L;\n ll N = floor(log2(L))+1;\n vector<edge> E;\n for(ll i = 1; i <= N-1; i++){\n edge e;\n e.from = i, e.to = i+1, e.weight = 1<<(i-1);\n E.push_back(e);\n e.weight = 0;\n E.push_back(e);\n }\n ll max = (1<<(N-1)) - 1;\n while(max!=L-1){\n edge e;\n e.from = floor(log2(L-max-1))+1, e.to = N; e.weight = max+1;\n E.push_back(e);\n max += 1<<(e.from-1);\n }\n cout << N << \" \" << E.size() << endl;\n for(auto e: E){\n cout << e.from << \" \" << e.to << \" \" << e.weight << endl;\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<int, int> ii;\n\nstruct fastio {\n fastio() {\n ios::sync_with_stdio(false);\n cout << setprecision(10) << fixed;\n cin.tie(0);\n }\n};\n\nfastio _fast_io;\n\n\nstruct Edge {\n int a, b, c;\n void print() {\n cout << a << ' ' << b << ' ' << c << endl;\n }\n};\n\nint n;\nint b;\nint sum;\nEdge e[61];\nint E;\n\nint main() {\n cin >> n;\n int temp = n;\n while (temp) {\n temp >>= 1;\n ++b;\n }\n for (int i = 1; i < b; ++i) {\n e[E++] = Edge {i, i + 1, 1 << (b - i - 1)};\n e[E++] = Edge {i, i + 1, 0};\n }\n int cur = 1 << (b - 1);\n for (int i = 2; i <= b; ++i) {\n if (cur + (1 << (b - i)) - 1 < n) {\n e[E++] = Edge {1, i, cur};\n cur += (1 << (b - i));\n }\n }\n\n cout << b << ' ' << E << endl;\n for (int i = 0; i < E; ++i) {\n e[i].print();\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\nconst int mod=1000000007,MAX=100003;\n\nint main(){\n \n int L;cin>>L;\n int N,cnt=-1;\n for(int i=1;;i++){\n if((1<<i)>L){\n N=i;\n break;\n }\n }\n for(int i=0;i<N;i++){\n if(L&(1<<i)) cnt++;\n }\n cout<<N<<\" \"<<2*(N-1)+cnt<<endl;\n \n for(int i=1;i<N;i++){\n cout<<i<<\" \"<<i+1<<\" \"<<0<<endl;\n cout<<i<<\" \"<<i+1<<\" \"<<(1<<(N-i-1))<<endl;\n }\n \n int now=(1<<(N-1));\n for(int i=N-2;i>=0;i--){\n if(L&(1<<i)){\n cout<<1<<\" \"<<N-i<<\" \"<<now<<endl;\n now+=(1<<i);\n }\n }\n}\n\n", "L = int(input())\n\nr = 0\n\nwhile 2**(r+1) <= L:\n r += 1\n\nE = []\nfor i in range(1,r+1):\n E.append((i,i+1,0))\n E.append((i,i+1,2**(i-1)))\n\nN = r+1\n\nfor i in range(N-1,0,-1):\n if L-(2**(i-1))>=2**r:\n E.append((i,N,L-2**(i-1)))\n L -= 2**(i-1)\n\nprint(N,len(E))\nfor e in E:\n print(e[0],e[1],e[2])", "#include <iostream>\n#include <algorithm>\n#include <tuple>\n#include <vector>\n#define int long long\nusing namespace std;\n\nsigned main() {\n int L; cin >> L;\n vector<tuple<int, int, int> > G;\n\n for(int i = 1; i <= 18; ++i) {\n G.push_back(make_tuple(i, i + 1, 0));\n G.push_back(make_tuple(i, i + 1, (1 << (i - 1))));\n }\n\n int Z = L, sum = 0;\n for(int i = 19; i >= 1; --i) {\n while(Z >= (1 << (i - 1))) {\n G.push_back(make_tuple(i, 20, sum));\n sum += (1 << (i - 1));\n Z -= (1 << (i - 1));\n }\n }\n\n cout << 20 << \" \" << G.size() << endl;\n for(int i = 0; i < G.size(); ++i) {\n cout << get<0>(G[i]) << \" \" << get<1>(G[i]) << \" \" << get<2>(G[i]) << endl;\n }\n\n return 0;\n}\n", "# -*- coding: utf-8 -*-\n\n# PyPy3 2.4はPython 3.2.5互換. math.log2はPython 3.3で追加.\nfrom math import log, floor\n\nL = int(input())\n\nN = floor(log(L, 2)) + 1\nedge = []\n\n# 長さ0の辺\nfor i in range(1, N):\n edge.append((i, i+1, 0))\n\n# 長さ2**(i-1)の辺\nfor i in range(1, N):\n edge.append((i, i+1, 2**(i-1)))\n\n# ここまでで長さ0,...,X-1のパスが完成\nX = 2 ** (N-1)\n\n# 残りの辺\nwhile L > X:\n r = floor(log(L - X, 2))\n edge.append((r + 1, N, X))\n X += 2 ** r\n\n# 出力\nM = len(edge)\nprint(N, M)\nfor e in edge:\n print(' '.join(map(str, e)))", "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom functools import reduce\n\n\nINF = float('inf')\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef I(): return int(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return sys.stdin.readline().strip()\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef LSR(n): return [LS() for i in range(n)]\ndef SRL(n): return [list(S()) for i in range(n)]\ndef MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]\nmod = 1000000007\n\n\nl = I()\nans = []\nd = len(bin(l)) - 2\nret = 2 ** (d - 1)\n\n\nremain = l-(2**(d - 1))\nret = 2 ** (d - 1)\nfor i in range(d-1, 0, -1):\n ans += [(i, i + 1, 0)]\n ans += [(i, i + 1, 2 ** (i - 1))]\n if 1 << (i-1) & remain:\n ans += [(i, d, ret)]\n ret += 2 ** (i - 1)\n\n\n\n\nprint(d, len(ans))\nfor k in ans:\n print(*k)", "#!/usr/bin/env python3\nimport sys\n\n\ndef solve(L: int):\n sL = \"{:b}\".format(L)\n N = len(sL)\n M = 2 * (N - 1) + sL.count(\"1\") - 1\n print(N, M)\n for i in range(N - 1):\n print(i + 1, i + 2, 0)\n print(i + 1, i + 2, 2 ** i)\n for i, c in enumerate(reversed(sL[1:])):\n if c == \"0\":\n continue\n print(i + 1, N, int(sL[:-i - 1], 2) * 2 ** (i + 1))\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n L = int(next(tokens)) # type: int\n solve(L)\n\n\nif __name__ == '__main__':\n main()\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\n\n#define REP(i, n) for(int i = 0; i < n; i++)\n#define REPR(i, n) for(int i = n; i >= 0; i--)\n#define FOR(i, m, n) for(int i = m; i < n; i++)\n#define ALL(obj) (obj).begin(), (obj).end()\n#define INF 1e9\n#define LINF 1e18\n\nstruct Edge{\n int from,to,cost;\n};\n\nint main() {\n int L; cin >> L;\n\n int p = 20;\n while(L<(1<<p)){\n p--;\n }\n\n int N = p+1;\n\n vector<Edge> ans;\n FOR(i,1,p+1){\n ans.push_back({i, i+1,0});\n ans.push_back({i, i+1, (1<<(i-1))});\n }\n\n while(p>0){\n if(L-(1<<(p-1)) >= (1<<(N-1)) ){\n L -= (1<<(p-1));\n ans.push_back({p, N, L});\n }\n p--;\n\n }\n\n cout << N << \" \" << ans.size() << endl;\n\n\n\n for(auto x: ans){\n cout << x.from << \" \" << x.to << \" \" << x.cost << endl;\n }\n return 0;\n}", "L = int(input())\nN = len(bin(L)[2:])\nans = []\nfor i in range(1, N):\n ans.append((i, i+1, 0))\n ans.append((i, i+1, 1<<(i-1)))\nn = 1 << (N-1)\nwhile n < L:\n i = 1\n while (1<<i) - 1 + n < L:\n i += 1\n ans.append((i, N, n))\n n += 1 << (i-1)\nprint(N, len(ans))\nfor a in ans:\n print(*a)\n", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\n#define REP(i, n) for(int i = 0; i < (int)(n); ++i)\n#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)\n\nstruct edge{ int to, cost; };\n\nint main()\n{\n int L;\n cin >> L;\n\n // 2^r <= L なる最大の r を求める\n int tmp = L, r = 0;\n while(tmp > 1){ \n tmp /= 2;\n ++r;\n }\n\n int N = r+1, M = 0;\n vector<vector<edge>> G(N);\n // i -> i+1 に 0 と 2^i の辺を張ることで\n // 0 ~ 2^r-1 までの経路を作れる\n REP(i, N-1){\n G[i].push_back({i+1, 0});\n G[i].push_back({i+1, (int) pow(2, i)});\n M += 2;\n }\n\n // 残りの辺を張る\n for(int i = N-2; i >= 0; --i){\n int length = L - pow(2, i);\n if( length >= pow(2, r)){\n G[i].push_back({N-1, length});\n L -= pow(2, i);\n ++M;\n }\n }\n\n cout << N << \" \" << M << endl;\n REP(i, N){\n for(auto e: G[i]) cout << i+1 << \" \" << e.to+1 << \" \" << e.cost << endl;\n }\n\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\nusing LL = long long;\nconst LL LINF = 1e18;\nconst LL MOD = 1e9+7;\n\n\nint main(){\n LL L;cin >> L;\n int r = 0;\n LL uku = 1;\n while(L >= uku){\n r++;\n uku *= 2;\n }\n r--;\n vector<pair<pair<int,int>,int>> Edge;\n for(int a = 1;a <= r;a++){\n Edge.push_back(make_pair(make_pair(a,a+1),pow(2,a-1)));\n Edge.push_back(make_pair(make_pair(a,a+1),0));\n }\n for(int t = r;t >= 1;t--){\n // cout<<t<<\" \"<<L-pow(2,t-1)<<\" \"<<pow(2,r)<<endl;\n if(L-pow(2,t-1) >= pow(2,r)){\n \n Edge.push_back(make_pair(make_pair(t,r+1),L-pow(2,t-1)));\n L-=pow(2,t-1);\n }\n }\n cout<<r+1<<\" \"<<Edge.size()<<endl;\n for(int a = 0;a < Edge.size();a++){\n cout<<Edge.at(a).first.first<<\" \"<<Edge.at(a).first.second<<\" \"<<Edge.at(a).second<<endl;\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntemplate <typename T> void read(T &t) {\n\tt=0; char ch=getchar(); int f=1;\n\twhile ('0'>ch||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }\n\tdo {(t*=10)+=ch-'0';ch=getchar();} while ('0'<=ch&&ch<='9'); t*=f;\n}\nconst int maxn=100;\nint n,a[maxn],b[maxn],c[maxn],tot;\nint lg,d[maxn];\nvoid add(int x,int y,int z) {\n\ta[++tot]=x; b[tot]=y; c[tot]=z;\n}\nint main() {\n\n\tread(n);\n\tfor (int i=0;i<20;i++)\n\t\tif (n&(1<<i)) d[++lg]=i;\n\tfor (int i=1;i<=d[lg];i++)\n\t\tadd(i,i+1,0),add(i,i+1,(1<<(i-1)));\n\tn=(1<<d[lg]);\n\tfor (int i=lg-1;i>=1;i--)\n\t\tadd(d[i]+1,d[lg]+1,n),n+=(1<<d[i]);\n\tprintf(\"%d %d\\n\",d[lg]+1,tot);\n\tfor (int i=1;i<=tot;i++)\n\t\tprintf(\"%d %d %d\\n\",a[i],b[i],c[i]);\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < (int)n; i++)\nusing ll = long long;\n\nstruct edge {\n int from, to, cost;\n};\n\nint main(){\n int l;\n cin >> l;\n if(l == 2) {\n cout << 2 << \" \" << 2 << endl;\n cout << 1 << \" \" << 2 << \" \" << 0 << endl;\n cout << 1 << \" \" << 2 << \" \" << 1 << endl;\n return 0; \n }\n int n = l -1;\n vector<int> a;\n while(n > 1) {\n a.push_back(n%2);\n n /= 2;\n }\n reverse(a.begin(),a.end());\n int s = a.size();\n vector<edge> v;\n rep(i,s) {\n v.push_back(edge{i,i+1,1<<(s-1-i)});\n v.push_back(edge{i,i+1,0});\n }\n int b = 1<<s;\n rep(i,s) {\n if(a[i] == 1) {\n v.push_back(edge{0,i+1,b});\n b += 1<<(s-i-1);\n }\n }\n v.push_back(edge{0,s,b});\n cout << s+1 << \" \" << v.size() << endl;\n for(auto k : v) {\n cout << k.from+1 << \" \" << k.to+1 << \" \" << k.cost << endl;\n } \n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\n\n#define REP(i, n) for(int i = 0; i < n; i++)\n#define REPR(i, n) for(int i = n; i >= 0; i--)\n#define FOR(i, m, n) for(int i = m; i < n; i++)\n#define ALL(obj) (obj).begin(), (obj).end()\n#define INF 1e9\n#define LINF 1e18\n\nstruct Edge{\n int from,to,cost;\n};\n\nint main() {\n int L; cin >> L;\n\n int p = 20;\n while(L<(1<<p)){\n p--;\n }\n\n int N = p+1;\n\n vector<Edge> ans;\n FOR(i,1,p+1){\n ans.push_back({i, i+1,0});\n ans.push_back({i, i+1, (1<<(i-1))});\n }\n\n L -= 1<<(N-1);\n\n while(p>0){\n if(L >= (1<<(p-1))){\n L -= (1<<(p-1));\n ans.push_back({p, N, L+(1<<(N-1)) });\n }\n p--;\n\n }\n\n cout << N << \" \" << ans.size() << endl;\n\n\n\n for(auto x: ans){\n cout << x.from << \" \" << x.to << \" \" << x.cost << endl;\n }\n return 0;\n}", "\nfrom collections import deque\nL = int(input())\n\nLbin = (bin(L)[2:])[::-1]\nN = len(Lbin)\nM = 0\nE = deque()\n\nfor i in range(0, N - 1):\n E.append(((i + 1, i + 2), 0))\n E.append(((i + 1, i + 2), 2 ** i))\n M += 2\n\nweight = L\nfor i in range(0, N - 1):\n if Lbin[i] == '1': # 2^iの位\n weight -= 2 ** i\n E.append(((i + 1, N), weight))\n M += 1\n\nprint(N, M)\nfor e in E:\n print(e[0][0], e[0][1], e[1])\n", "import sys\n\nclass paiza_fmt_input:\n def __init__(self):\n self.cur = 0\n self.all_input = []\n\n def input_all(self):\n for line in sys.stdin:\n self.all_input.append(line)\n\n def get_one_line_with_split(self):\n input_cur = self.all_input[self.cur]\n self.cur += 1\n splitted_input = input_cur.split()\n return splitted_input\n\ndef get_bit_list(num):\n bit_list = []\n for i in range(64):\n if (num >> i) & 1:\n bit_list.append(i)\n return bit_list\n\n\n\ndef solve(inputs):\n line1_input = list(map(int, inputs.get_one_line_with_split()))\n path_num = line1_input[0]\n bit_list = get_bit_list(path_num)\n # print(bit_list)\n\n max_bit = bit_list[-1]\n # print(max_bit)\n\n dags = []\n for i in range(max_bit):\n dags.append([i+1, i+2, 0])\n dags.append([i+1, i+2, pow(2, i)])\n # print(dags)\n\n end_node_no = bit_list[-1] + 1\n bit_list.pop()\n ofs_num_cur = pow(2, max_bit)\n while True:\n if not bit_list:\n break\n bit = bit_list.pop()\n\n dags.append([bit+1, end_node_no, ofs_num_cur])\n ofs_num_cur += pow(2, bit)\n # print(dags)\n\n # output\n print(end_node_no, len(dags))\n for dag in dags:\n print(*dag)\n\n\n\n\n\ninputs = paiza_fmt_input()\ninputs.input_all()\nsolve(inputs)\n", "L = int(input())\nr = 0\nanswer = []\n\nwhile 2**r <= L:\n r += 1\nN = r\n\nfor i in range(1,r):\n answer.append([i,i+1,0])\n answer.append([i,i+1,2**(i-1)])\n\n\nfor t in range(N-1,0,-1):\n if L - 2**(t-1) >= 2**(r-1):\n answer.append([t,N,L-2**(t-1)])\n L -= 2**(t-1)\n\nanswer.insert(0,[N,len(answer)])\n\nfor ans in answer:\n print(*ans)", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(int argc, const char *argv[]) {\n int l;\n cin >> l;\n\n vector<int> sum_pow2{0}, pow2;\n int n = 0;\n for (int i = 1; i <= l; i *= 2) {\n sum_pow2.push_back(sum_pow2.back() + i);\n pow2.push_back(i);\n n++;\n }\n\n int m = (n - 1) * 2, lim = l;\n stringstream sout;\n for (int idx = 0, cur = l; cur != 1; idx++, cur /= 2) {\n if (cur % 2 == 1) {\n lim = lim - 1 - sum_pow2[idx];\n sout << idx + 1 << ' ' << n << ' ' << lim << '\\n';\n m++;\n cur--;\n }\n\n if (idx < n - 1) {\n sout << idx + 1 << ' ' << idx + 2 << ' ' << 0 << '\\n';\n sout << idx + 1 << ' ' << idx + 2 << ' ' << pow2[idx] << '\\n';\n }\n }\n\n cout << n << ' ' << m << '\\n';\n cout << sout.str();\n}", "//#pragma GCC optimize(\"Ofast,no-stack-protector\")\n//#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx\")\n//#pragma GCC target(\"avx,tune=native\")\n#include<bits/stdc++.h>\n//#include<ext/pb_ds/assoc_container.hpp>\nusing namespace std;\n//using namespace __gnu_pbds;\nconst int inf=0x3f3f3f3f;\nconst double eps=1e-6;\nconst int mod=1000000007;\ntypedef long long ll;\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\nint calc(int x,int lg){\n\treturn lg+lg+__builtin_popcount(x-(1<<lg));\n}\nint l;\nint main(){\n\tcin>>l;int lg;\n\tfor(int i=0;i<=20;i++){\n\t\tif((1<<i)<=l)lg=i;\n\t}\n\tcout<<lg+1<<\" \"<<calc(l,lg)<<endl;\n\tint n=lg+1;\n\tfor(int i=1;i<n;i++)cout<<i<<\" \"<<i+1<<\" \"<<(1<<i-1)<<endl;\n\tfor(int i=1;i<n;i++)cout<<i<<\" \"<<i+1<<\" \"<<0<<endl;\n\tint L=1<<lg,R=l;\n\tfor(int i=n-1;i>=1;i--){\n\t\tint cnt=1<<i-1;\n\t\tif(R-L>=cnt){\n\t\t\tcout<<i<<\" \"<<n<<\" \"<<L<<endl;\n\t\t\tL+=cnt;\n\t\t}\n\t}\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n StringBuilder sb = new StringBuilder();\n int a = 1;\n int p = 0;\n while((1 << a) <= n){\n sb.append(a + \" \" + (a+1) + \" \" + 0 + \"\\n\");\n p++;\n sb.append(a + \" \" + (a+1) + \" \" + (1 << (a-1)) + \"\\n\");\n p++;\n a++;\n }\n a--;\n int b = 1 << a;\n int last = a + 1;\n for (int i = a; i > 0; i--) {\n int c = (1 << (i-1)) -1;\n if(b + c < n){\n sb.append(i + \" \" + last + \" \" + b + \"\\n\");\n p++;\n b += c+1;\n }\n }\n a++;\n System.out.println(a + \" \" + p);\n System.out.println(sb.toString());\n sc.close();\n\n }\n\n}\n", "#include <iostream>\n#include <vector>\n#include <tuple>\n\nlong myPOW2( long p )\n{\n\tlong result = 1;\n\n\tfor ( long i = 0; i < p; i++ )\n\t{\n\t\tresult *= 2;\n\t}\n\n\treturn ( result );\n}\n\nint main()\n{\n\tlong L;\n\tstd::cin >> L;\n\n\tint r = 0;\n\tlong tmpL;\n\twhile( myPOW2( r ) <= L ) { ++r; }\n\n\tlong N = r;\n\tstd::vector<std::tuple<long, long, long> > v;\n\n\tfor ( int i = 1; i < N; ++i )\n\t{\n\t\t// 頂点iからi+1へ長さ0の辺と長さ2^iの辺を張る\n\t\tv.emplace_back( std::make_tuple( i, i + 1, 0 ) );\n\t\tv.emplace_back( std::make_tuple( i, i + 1, myPOW2( i - 1 ) ) );\n\t}\n\n\tfor ( int t = N - 1; t >= 1; --t )\n\t{\n\t\tif ( L - myPOW2( t - 1 ) >= myPOW2( r - 1 ) )\n\t\t{\n\t\t\tv.emplace_back( t, N, L - myPOW2( t - 1 ) );\n\t\t\tL -= myPOW2( t - 1 );\n\t\t}\n\t}\n\n\tstd::cout << N << \" \" << v.size() << std::endl;\n\tfor ( auto &&it : v )\n\t{\n\t\tstd::cout << std::get<0>( it ) << \" \"\n\t\t\t\t << std::get<1>( it ) << \" \"\n\t\t\t\t << std::get<2>( it ) << std::endl;\n\t}\n\n\treturn ( 0 );\n}\n", "import math\n\nL = int(input())\nr = int(math.log2(L))\n\n# r+1頂点\nvertex = r + 1\nedge = 2 * r\nres = []\nfor i in range(1,r+1):\n res.append([i,i+1,0])\n res.append([i,i+1,2**(i-1)])\n\nfor i in range(r,0,-1):\n if L-2**(i-1)>=2**r:\n L -= 2**(i-1)\n res.append([i,vertex,L])\n edge += 1\n\nprint(vertex,edge)\nfor l in res:\n print(*l)\n", "l = int(input())\n\nif l <= 60:\n n = 2\n print(n, l)\n for i in range(l):\n print(1, n, i)\n exit()\n\np = []\ntemp = l\nwhile temp > 0:\n p.append(temp % 2)\n temp //= 2\n\nans = []\nres = []\nn = len(p)\ntemp = 1\nfor i in range(n - 1):\n ans.append([i + 1, i + 2, 0])\n ans.append([i + 1, i + 2, temp])\n temp *= 2\n\nm = l - temp + 1\ns = n\nfuga = temp\nwhile m > 0 and s > 0:\n #print(s, temp, m)\n if m > temp:\n m -= temp\n ans.append([s, n, fuga])\n fuga += temp\n #print(m)\n temp //= 2\n s -= 1\n\nprint(n, len(ans))\nt = 1\nfor x in ans:\n print(x[0], x[1], x[2])", "#18:55\nl = int(input())\ns = bin(l)[2:]\nn = len(s)\nm = 0\nans = []\nfor i in range(n-1):\n ans.append([i+1,i+2,0])\n ans.append([i+1,i+2,2**(n-2-i)])\n m += 2\n#print(ans,m)\nimp = 2 ** (n-1)\nfor i in range(n-1,0,-1):\n if s[i] == '1':\n ans.append([1,i+1,imp])\n m += 1\n imp += 2 ** (n-1-i)\nprint(n,m)\nfor x in ans:\n print(' '.join(list(map(str,x))))", "L = int(input())\n\nN = 1\nl = L\nwhile l // 2 >= 1:\n N += 1\n l //= 2\n\nG = [[] for _ in range(N + 1)]\n\nfor i in range(1, N):\n G[i].append([i + 1, 0])\n G[i].append([i + 1, 2 ** (N - 1 - i)])\n\nM = 2 * (N - 1)\ntmp = 2 ** (N - 1)\n\nfor i in range(N - 2, -1, -1):\n if (L >> i) & 1:\n G[1].append([N - i, tmp])\n tmp += 2 ** i\n M += 1\n\nif N > 20 or M > 60:\n print ('error')\n\nprint (N, M)\nfor i in range(1, N):\n for j in G[i]:\n print (i, *j)", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pint = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing edge = pair<int, ll>;\nusing Graph = vector<vector<int>>; \nusing WeightedGraph = vector<vector<edge>>;\nconst ll INF = 1LL << 60;\nconst int INF32 = 1 << 29;\nconst ll MOD = 1000000007;\n\nint main(){\n int n = 20;\n int L;cin >> L;\n WeightedGraph G(n);\n vector<int> sum(n);\n int M = 0;\n int n2 = 19;\n for(int i = 1; i < n; ++i){\n G[i-1].push_back({i,0});\n int beki = (1<<(i-1));\n sum[i]=sum[i-1]+beki;\n if(sum[i]<L){\n G[i-1].push_back({i,beki});\n M = 2*beki;\n ++n2;\n }\n }\n for(int i = n-1; i >= 0; --i){\n if(sum[i]+M<L){\n G[i].push_back({n-1,M});\n M += sum[i]+1;\n ++n2;\n }\n }\n cout << n << \" \" << n2 << endl;\n for(int i = 0; i < n; ++i){\n for(auto e : G[i]){\n cout << i+1 << \" \" << e.first+1 << \" \" << e.second << endl;\n }\n }\n}\n", "#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <tuple>\nusing namespace std;\n\n#define FOR(i, j, k) for (int i = j; i < k; i++)\n#define REP(i, j) FOR(i, 0, j)\ntypedef long long int ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vi> vvi;\n\nint main() {\n\n int L;\n cin >> L;\n\n vi v;\n\n int x = 0;\n while (L >= (1 << x)) {\n v.push_back(x);\n x++;\n }\n // v.push_back(x);\n\n int n = v.size();\n vector<tuple<int, int, int>> es;\n REP(i, x) {\n if (L < (1 << (i + 1))) break;\n es.emplace_back(i, i + 1, 0);\n es.emplace_back(i, i + 1, 1 << i);\n }\n\n int y = (1 << x - 1);\n L -= y;\n for (int i = x - 2; i >= 0; i--) {\n if (L & (1 << i)) {\n es.emplace_back(i, n - 1, y);\n y += (1 << i);\n // L -= (1 << i);\n }\n }\n\n cout << n << \" \" << es.size() << endl;\n for (auto& tup: es) {\n int i, j, k;\n tie(i, j, k) = tup;\n\n cout << i + 1 << \" \" << j + 1 << \" \" << k << endl;\n }\n\n return 0;\n}\n", "import sys\n\nreadline = sys.stdin.buffer.readline\nMOD = 10 ** 9 + 7\nINF = float('INF')\nsys.setrecursionlimit(10 ** 5)\n\n\ndef main():\n def calc(x):\n for i in range(100):\n if 2 ** (i + 1) > x:\n return i\n\n from collections import defaultdict\n\n l = int(input())\n n = calc(l) + 1\n edge = []\n for u in range(1, n):\n edge.append((u, u + 1, 0))\n edge.append((u, u + 1, 2 ** (u - 1)))\n\n mx = 2 ** (n - 1) - 1\n rem = (l - 1) - mx\n bit = format(rem, \"b\")\n bit = bit[::-1]\n\n cur = mx\n\n for u, o in enumerate(bit, 1):\n if o == \"1\":\n edge.append((u, n, cur + 1))\n cur += 2 ** (u - 1)\n\n print(n, len(edge))\n\n for u, v, w in edge:\n print(u, v, w)\n\n\nif __name__ == '__main__':\n main()\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int l = in.nextInt();\n\n int n = Integer.toBinaryString(l).length();\n int m = (n - 1) * 2 + Integer.bitCount(l) - 1;\n\n out.println(n + \" \" + m);\n\n int pow2 = 1;\n for (int i = 1; i < n; i++) {\n out.println(i + \" \" + (i + 1) + \" \" + 0);\n out.println(i + \" \" + (i + 1) + \" \" + pow2);\n if (((l >> (i - 1)) & 1) == 1) {\n out.println(i + \" \" + n + \" \" + (l & (-1 << i)));\n }\n pow2 <<= 1;\n }\n }\n\n }\n\n static class InputReader {\n private BufferedReader br;\n private StringTokenizer st;\n\n public InputReader(InputStream inputStream) {\n br = new BufferedReader(new InputStreamReader(inputStream));\n st = new StringTokenizer(\"\");\n }\n\n public String nextString() {\n while (!st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine(), \" \");\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n }\n}\n\n", "L = int(input())\n \nret = []\ncount = 0\nfor i in range(19, 0, -1) :\n while L - (1 << (i - 1)) >= 0 :\n ret.append((i, count))\n count += 1 << (i - 1)\n L -= 1 << (i - 1)\n\nN = ret[0][0]\nM = len(ret) + 2 * (N - 1)\n\nprint(N + 1, M)\nfor i in range(1, N) :\n print(i, i + 1, 0)\n print(i, i + 1, 1 << (i - 1))\nfor r in ret :\n print(r[0], N + 1, r[1])", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define repr(i, n) for (int i = (n); i >= 0; --i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define FORR(i, m, n) for (int i = (m); i >= (n); --i)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nusing namespace std;\ntypedef long long ll;\nconst ll mod = 1000000007;\nconst ll mod2 = 998244353;\nconst int INF = 1000000005;\nconst long double EPS = 1e-10;\n\nstruct Edge {\n int f, t, c;\n\n Edge(int f, int t, int c): f(f), t(t), c(c) {}\n};\n\nint main() {\n int l;\n cin >> l;\n\n int res = 2, n = 1;\n while (res <= l) {\n res *= 2;\n n++;\n }\n\n vector<Edge> e;\n res /= 4;\n int c = res;\n FOR(i, 1, n) {\n e.push_back(Edge(i, i + 1, c));\n e.push_back(Edge(i, i + 1, 0));\n c /= 2;\n }\n\n l -= res * 2;\n c = res * 2;\n FOR(i, 2, n + 1) {\n if (l >= res) {\n e.push_back(Edge(1, i, c));\n l -= res;\n c += res;\n }\n res /= 2;\n }\n\n int m = e.size();\n cout << n << \" \" << m << endl;\n rep(i, m) {\n cout << e[i].f << \" \" << e[i].t << \" \" << e[i].c << endl;\n }\n\n\n \n return 0;\n}", "L=int(input())\nketa=0\nwhile(2**keta -1<L):\n keta+=1\n\n\nedge=[]\ntmp=1\nfor i in range(0,keta-1):\n edge.append(\"{} {} 0\".format(keta-1-i,keta-i))\n edge.append(\"{} {} {}\".format(keta-1-i,keta-i,tmp))\n tmp*=2\n if(L & 1<<(keta-2-i)):\n edge.append(\"{} {} {}\".format(keta-1-i,keta,tmp))\n tmp+=1\n\nif(L==1):\n edge=[\"1 2 0\"]\n\nprint(\"{} {}\".format(keta,len(edge)))\nfor e in edge:\n print(e)", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int L, N;\n vector<pair<pair<int, int>, int> > edges;\n\n cin >> L;\n\n //Find most significant bit of L\n for (int lg = 20; lg >= 0; lg--) {\n if (L & (1 << lg)) {\n N = lg;\n break;\n }\n }\n\n //Create graph with N + 1 vertices and 2 * N edges. Node i is connected with node i + 1 with 2 edges, each with weight 0 and 2^(i - 1)\n for (int i = 1; i <= N; i++) {\n edges.push_back({{i, i + 1}, 0});\n edges.push_back({{i, i + 1}, (1 << (i - 1))});\n }\n\n //For other on bits in i in L, we add an edge from vertex i + 1 to vertex N + 1 and it's weight is equal to sum of previous on bits\n int sum = (1 << N);\n for (int lg = N - 1; lg >= 0; lg--) {\n if (L & (1 << lg)) {\n edges.push_back({{lg + 1, N + 1}, sum});\n sum += (1 << lg);\n }\n }\n\n cout << N + 1 << \" \" << (int) edges.size() << endl;\n for (auto edge: edges)\n cout << edge.first.first << \" \" << edge.first.second << \" \" << edge.second << endl;\n}\n", "L = int(input())\n\nEdges = []\n\nn = 1\nwhile 2**(n-1)-1 < L:\n n += 1\nn -= 1\n\nfor i in range(1, n):\n Edges.append([i, i+1, 0])\n Edges.append([i, i+1, 2**(i-1)])\n\nremain = L - 2**(n-1)\nfor x in range(n-1, 0, -1):\n if 2**(x-1) <= remain:\n Edges.append([x, n, L-remain])\n remain -= 2**(x-1)\n\nprint(n, len(Edges))\nfor u, v, w in Edges:\n print(u, v, w)\n\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long ll;\ntypedef pair<ll,ll> P;\nconst ll mod=1000000007;\nconst ll LINF=1LL<<60;\nconst int INF=1<<30;\n\nint main(){\n\tint l;cin>>l;\n\tint keta = log2(l) + 1;\n\tvector<P> g;\n\tvector<int> dist;\n\t// cout << keta << endl;\n\t// cout << fixed << setprecision(10) << pow(2.0,20.0) << endl;\n\tfor(int i = 1; i < keta; i++) {\n\t\tg.pb(mp(i,i + 1));\n\t\tg.pb(mp(i,i + 1));\n\t\tdist.pb(pow(2,i - 1));\n\t\tdist.pb(0);\n\t}\n\tfor(int i = keta - 1; i > 0; i--) {\n\t\tif (l - pow(2,i - 1) >= pow(2,keta - 1)){\n\t\t\tg.pb(mp(i, keta));\n\t\t\tdist.pb(l - pow(2,i - 1));\n\t\t\tl -= pow(2,i -1);\n\t\t\t// cout << l << endl;\n\t\t}\n\t}\n\tcout << keta << \" \" << g.size() << endl;\n\tfor(int i = 0; i < g.size(); i++) {\n\t\tcout << g[i].fs << \" \" << g[i].sc << \" \" << dist[i] << endl; \n\t}\n\treturn 0;\n}", "import math\n\nL = int(input())\nn = int(math.log2(L))\nN = n + 1\n\nedges = []\nfor i in range(1, N):\n edges.append((i, i + 1, 0))\n edges.append((i, i + 1, 2 ** (n - i)))\n\nres = L - 2 ** n\nbits = format(res, '0' + str(n) + 'b')\nweight = 2 ** n\nfor i, bit in enumerate(bits):\n if int(bit):\n edges.append((1, i + 2, weight))\n weight += 2 ** (n - i - 1)\n\nprint(N, len(edges))\nfor row in edges:\n print(*row)\n", "l = int(input())\nr = len(bin(l)[2:])-1\n\nw = 2**r\noutlist = []\n\nfor t in range(r,0, -1):\n if l - 2**r >= 2**(t-1):\n outlist.append(\"{} {} {}\".format(t, r+1, w))\n w += 2**(t-1)\n l = l-2**(t-1)\n\nprint(r+1, len(outlist)+2*r)\nfor i in range(1, r+1):\n print(\"{} {} 0\".format(i, i+1))\n print(\"{} {} {}\".format(i, i+1, 2**(i-1)))\nfor j in outlist:\n print(j)", "L = int(input())\ndef divideBin(n):\n d = 1\n ans=[]\n while n > 0:\n r,q=divmod(n,2)\n ans.append(q*d)\n d *= 2\n n = r\n return(ans)\ndivided = divideBin(L)\nN = len(divided)\nM = 2*(N-1) + len([x for x in divided if x!=0]) - 1\nprint(N,M)\nfor i in range(1,N):\n print(i,i+1,0)\n print(i,i+1,pow(2,i-1))\nnode = N-1\nvalue = divided[N-1]\nwhile node > 0:\n if divided[node-1] != 0:\n print(node,N,value)\n value += divided[node-1]\n node -= 1", "# 頂点は0番から始まるとして、出力時に+1する\ndef graph(L):\n beki = 1\n for n in range(20):\n beki *= 2\n if beki > L: break\n\n ans = []\n Li = 1\n for i in range(n):\n ans += [(i + 1, i + 2, 0)]\n ans += [(i + 1, i + 2, Li)]\n Li *= 2\n\n Lnext = Li\n nokori_kosu = L - Li\n i = n - 1\n way_i = Li // 2\n while nokori_kosu > 0:\n while way_i > nokori_kosu:\n way_i //= 2\n i -= 1\n ans += [(i + 1, n + 1, Lnext)]\n Lnext += way_i\n nokori_kosu -= way_i\n print(n + 1, len(ans))\n for x in ans:\n print(*x)\n\n\nL = int(input())\ngraph(L)\n", "#include<bits/stdc++.h>\nusing namespace std;\nint L;\nint p[25], eid;\nstruct edge{\n int v, w, nxt;\n}e[200];\nvoid add(int u, int v, int w){\n e[eid].v = v;\n e[eid].w = w;\n e[eid].nxt = p[u];\n p[u] = eid++;\n}\nint main(){\n memset(p, -1, sizeof p);\n eid = 0;\n scanf(\"%d\", &L);\n int n = 0, tmp = L;\n while(tmp){\n n++;\n tmp >>= 1;\n }\n for(int i = 1; i < n; ++i){\n add(i, i+1, 0);\n add(i, i+1, 1<<(i-1));\n }\n int w = 1<<(n-1);\n for(int i = n - 2; i >= 0; --i){\n if(L&(1<<i)){\n add( i+1, n, w);\n w += 1<<i;\n }\n }\n printf(\"%d %d\\n\", n, eid);\n for(int i = 1; i <= n; ++i){\n for(int j = p[i]; ~j; j = e[j].nxt){\n printf(\"%d %d %d\\n\", i, e[j].v, e[j].w);\n }\n }\n return 0;\n}\n", "l=int(input())\nfor i in range(1,21):\n if 2**i>l:\n n=i\n break\nm=2*(n-1)\ndata=[]\nfor i in range(1,n):\n data.append([i,i+1,0])\n data.append([i,i+1,2**(n-i-1)])\nadd=2**(n-1)\nfor i in range(1,n):\n if (l>>n-1-i)&1==1:\n data.append([1,i+1,add])\n add+=2**(n-1-i)\n m+=1\nprint(str(n)+\" \"+str(m))\nfor u in data:\n print(*u)", "import math\nl=int(input())\nn=int(math.log2(l)+1)\nE=[]\nfor i in range(n-1):\n E.append([i+1,i+2,0])\n E.append([i+1,i+2,2**i])\ni=n-2\nwhile l>2**(n-1):\n t=l-2**i\n if t>2**(n-1)-1:\n E.append([i+1,n,t])\n l=t\n i-=1\nprint(n,len(E))\nfor i in range(len(E)):\n print(*E[i])\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\nstruct edge {\n int u, v, w;\n};\n\nint main () {\n int L;\n cin >> L;\n\n int l = 0;\n while((1<<(l+1)) <= L) l++;\n if(L == 1) {\n printf(\"2 1\\n1 2 0\\n\");\n return 0;\n }\n\n int N = l+1;\n vector<edge> edges;\n for(int i = 1; i <= l; i++) {\n edges.push_back(edge{i,i+1,0});\n edges.push_back(edge{i,i+1,(1<<(l-i))});\n }\n\n int k = L - (1<<l);\n int w = (1<<l);\n for(int i = 20; i >= 0; i--) {\n if((k>>i) & 1) {\n edges.push_back(edge{1,N-i,w});\n w += 1<<i;\n }\n }\n\n printf(\"%d %d\\n\", N, edges.size());\n for(auto e: edges) {\n printf(\"%d %d %d\\n\", e.u, e.v, e.w);\n }\n\n return 0;\n}\n", "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <cstring>\nusing namespace std;\nvector<pair<pair<int,int>,int> >a;\nint main(){\n\tint l;\n\tcin>>l;\n\tvector<int>v;\n\tint t=0;\n\twhile(l){\n\t\tif(l%2)v.push_back(t);\n\t\tl/=2;\n\t\tt++;\n\t}\n\tint n=v.back()+1;\n\tfor(int i=1;i<n;i++)\n\t{\n\t\ta.push_back(make_pair(make_pair(i,i+1),0));\n\t\ta.push_back(make_pair(make_pair(i,i+1),(1<<(i-1))));\n\t}\n\tint sum=1<<v.back();\n\tfor(int i=(int)v.size()-2;i>=0;i--){\n\t\tint y=v[i]+1;\n\t\ta.push_back(make_pair(make_pair(y,n),sum));\n\t\tsum+=1<<v[i];\n\t}\n\tcout<<n<<\" \"<<a.size()<<endl;\n\tfor(int i=0;i<a.size();i++)\n\t\tcout<<a[i].first.first<<\" \"<<a[i].first.second<<\" \"<<a[i].second<<endl;\n\t\n}", "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<unordered_map>\n#include<stack>\n#include<random>\n#include<set>\n#include<map>\n#include<functional>\nusing namespace std;\n#define int long long\n#define inf 1145141919\n#define rep(i,n) for(int i=0;i<n;i++)\ntypedef pair<int, int>P;\ntypedef pair<int, P> PP;\nstruct edge { int to, cost; };\nconst long long mod = 1000000007;\nvector<edge>G[22];\nsigned main() {\n\tint l; cin >> l;\n\tint V = 0;\n\trep(i, 20) {\n\t\tif ((1 << i) <= l&&l < (1 << (i + 1)))V = i + 1;\n\t}\n\trep(i, V-1) {\n\t\t\tG[i].push_back({ i + 1,0 });\n\t\t\tG[i].push_back({ i + 1,1 << i });\n\t}\n\tint nm = 1 << (V-1);\n\tint ed = (V-1)* 2;\n\tfor (int i = V - 1; i >= 0; i--) {\n\t\tif (nm + (1 << i) <= l) {\n\t\t\tG[i].push_back({ V-1,nm});\n\t\t\tnm += 1 << i;\n\t\t\ted++;\n\t\t}\n\t}\n\tcout << V << ' ' << ed << endl;\n\trep(i, V) {\n\t\trep(j, G[i].size()) {\n\t\t\tcout<<i+1<<' ' << G[i][j].to+1 << ' ' << G[i][j].cost << endl;\n\t\t}\n\t}\n}", "L = int(input())\n\nb = bin(L-1)[2:]\nl = len(b)\nout = []\nfor i in range(1,l+1):\n out.append([i,i+1,0])\nfor i in range(2,l+1):\n out.append([i,i+1,1<<(l-i)])\n\nif not \"0\" in b:\n out.append([1,2,1<<(l-1)])\n b = \"\"\nwhile len(b)>0 and b != \"0\":\n if b[-1] == \"0\":\n out.append([1,len(b)+1,int((b+\"0\"*l)[:l],2)])\n b = bin(int(b,2)-1)[2:]\n b = b[:-1]\n\nif l < 20:\n print(l+1,len(out))\n for sub in out:\n print(\" \".join(map(str,sub)))\nelse:\n print(l,len(out)-1)\n for u,v,w in out[1:]:\n u = max(1,u-1)\n v = max(1,v-1)\n print(u,v,w)", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int maxd = 20;\n\nint l, tl, dl, ce, t = 1;\nbool b[maxd];\n\nsigned main () {\n scanf(\"%d\", &l);\n tl = l;\n while (l) {\n if (l & 1) {\n b[dl] = 1;\n ce++;\n }\n l >>= 1;\n dl++;\n }\n printf(\"%d %d\\n\", dl, (dl - 1) * 2 + ce - 1);\n l = tl;\n for (int i = 1; i < dl; ++i) {\n printf(\"%d %d %d\\n\", i, i + 1, 0);\n printf(\"%d %d %d\\n\", i, i + 1, t);\n if (b[i - 1]) {\n printf(\"%d %d %d\\n\", i, dl, l - t);\n l -= t;\n }\n t <<= 1;\n }\n}\n", "#include \"bits/stdc++.h\"\n#define MOD 1000000007\n#define inf 0x3f3f3f3f3f3f3f3f\n#define pi acos(-1.0)\n#define ri register int\n#define int long long\n#ifdef ONLINE_JUDGE\nconst int maxn = 3e5 + 10;\n#else\nconst int maxn = 1e3 + 10;\n#endif\nusing namespace std;\nint L;\nsigned main()\n{\n ios::sync_with_stdio(false);\n cin >> L;\n int cnt = 0;\n while ((1 << (cnt + 1)) <= L) {\n ++cnt;\n }\n vector<vector<int>> edges;\n int V = 2;\n for (ri i = 1; i <= cnt; ++i) {\n edges.push_back({ V - 1, V, 0 });\n edges.push_back({ V - 1, V, 1 << (i - 1) });\n ++V;\n }\n V -= 1;\n int sub = L - (1 << cnt), fuck = 1 << cnt;\n for (ri i = 1; i < V; ++i) {\n if (sub & 1 << (i - 1)) {\n edges.push_back({ i, V, fuck });\n fuck += 1 << (i - 1);\n }\n }\n cout << V << \" \" << edges.size() << endl;\n for (auto e : edges) {\n cout << e[0] << \" \" << e[1] << \" \" << e[2] << endl;\n }\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,x,y) for(int i=x;i<y;i++)\n#define range(a) (a).begin(),(a).end()\n#define print(A,x,n) rep(i,0,n){cout<<(i ? \" \":\"\")<<A[i]x;}cout<<endl;\n#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}\nconst long mod=1e9+7;\nconst int size=1e5;\nconst int inf=1e9;\nint main(){\n\tint L;cin>>L;\n\tint n = 0;int cnt = 0;\n int temp = L;\n\twhile(temp){\n n++;\n cnt += temp % 2;\n temp /= 2;\n }\n cout<<n<<\" \"<<2 * (n - 1) + cnt - 1<<endl;\n\trep(i,1,n){\n\t\tcout<<i<<\" \"<<i + 1<<\" \"<<0<<endl;\n\t\tcout<<i<<\" \"<<i + 1<<\" \"<<(1<<i-1)<<endl;\n\t}\n\tint t = (1<<n-1);\n\tfor(int i = n-2; i>=0; i--){\n\t\tif(L & (1<<i)){\n\t\t\tcout<<i + 1<<\" \"<<n<<\" \"<<t<<endl;\n\t\t\tt += (1<<i);\n\t\t}\n\t}\n}", "L=int(input())\nL_list=list(str(bin(L)))\ndel L_list[0:2]\nN=len(L_list)\nfor i in range(N):\n L_list[i]=int(L_list[i])\nM=2*N-2\nfor n in range(1,N):\n if L_list[n]==1:\n M+=1\nprint(N,M)\nfor i in range(N):\n L_list[i]=int(L_list[i])\nfor n in range(N-1):\n print(n+1,n+2,0)\n print(n+1,n+2,2**(N-n-2))\nA=2**(N-1)\nfor n in range(1,N):\n if L_list[n]==1:\n print(1,n+1,A)\n A+=2**(N-n-1)\n \n \n \n\n", "L = int(input())\n\nn = 0\nwhile 2**n <= L:\n n += 1\n\nside_lst = []\n \nrest = L - 2**(n-1)\nnext_num = 2**(n-1)\n\nm = n\nwhile rest > 0:\n if rest >= 2**(m-2):\n side_lst.append([m-1, n, next_num])\n next_num += 2**(m-2)\n rest -= 2**(m-2)\n m -= 1\n \nprint(n, len(side_lst)+(n-1)*2)\nfor i in side_lst:\n print(i[0], i[1], i[2])\n \nfor i in range(1, n):\n print(i, i+1, 0)\n print(i, i+1, 2**(i-1))", "#include<iostream>\n#include <cstring>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\n\n\nint main(){\n int N; cin >> N;\n vector<int> bits;\n rep(i, 21){\n if((1<<i)&N){\n bits.push_back(i);\n }\n }\n reverse(bits.begin(), bits.end());\n int V = bits[0]+1;\n int E = 2*bits[0]+bits.size()-1;\n cout << V << \" \" << E << endl;\n rep(i, V-1){\n cout << i+1 << \" \" << i+2 << \" \" << 0 <<endl;\n cout << i+1 << \" \" << i+2 << \" \" << (1<<i) << endl;\n }\n int cost = (1<<(V-1));\n rep(i, bits.size()-1){\n cout << bits[i+1]+1 << \" \" << V << \" \" << cost << endl;\n cost+=(1<<bits[i+1]);\n } \n}", "#include <iostream>\n#include <cmath>\n#include <vector>\nusing namespace std;\n\nstruct Edge {\n int from, to, cost;\n};\n\nint main() {\n int l;\n cin >> l;\n int r = log2(l);\n vector<Edge> es;\n int nv = r + 1, ne = 2 * r;\n for (int i = 0; i < r; i++) {\n es.push_back(Edge{i + 1, i + 2, 0});\n es.push_back(Edge{i + 1, i + 2, 1 << i});\n }\n int pow_r = 1 << r;\n for (int i = r; i >= 1 && l - pow_r > 0; i--) {\n int pow_i = 1 << (i - 1);\n if (l - pow_r >= pow_i) {\n l -= pow_i;\n es.push_back(Edge{i, nv, l});\n ne++;\n }\n }\n\n\n cout << nv << \" \" << ne << endl;\n for (Edge e : es)\n cout << e.from << \" \" << e.to << \" \" << e.cost << endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nqueue<pair< pair<int, int>, int> > que;\n\nint main(){\n int l;\n cin >> l;\n\n int p = 1;\n int n = 1;\n while(p*2 <= l){\n p *= 2;\n n += 1;\n }\n int ans_n = n;\n\n int xx = 1;\n for(int i = n-1;i >= 1;i--){\n que.push(make_pair(make_pair(i, i+1), 0));\n que.push(make_pair(make_pair(i, i+1), xx));\n xx *= 2;\n }\n\n l = l ^ (1 << (n-1));\n\n int r = n;\n int w = p;\n int x = 1;\n\n while(l > 0){\n if(l & 1){\n que.push(make_pair(make_pair(1, r), w));\n w += x;\n }\n x *= 2;\n l >>= 1;\n r--;\n }\n\n cout << ans_n << \" \" << que.size() << endl;\n while(!que.empty()){\n pair<pair<int, int> , int> p = que.front();\n cout << p.first.first << \" \" << p.first.second << \" \"<< p.second << endl;\n que.pop();\n }\n\n return 0;\n}\n", "#include <bits/stdc++.h>\n#define REP(i,n) for(ll i = 0; i < (ll)n; i++)\n#define FOR(i,a,b) for (ll i=(a);i<(ll)b; i++)\n#define ALL(obj) (obj).begin(),(obj).end()\n#define INF 1000000000000000\nusing namespace std;\ntypedef long long ll;\ntypedef double db;\ntypedef string str;\ntypedef pair<ll,ll> p;\nconst int MOD = 1000000007;\n\n\nint main() {\n int L;\n cin >> L;\n int N = 0;//頂点\n int pow = 1;\n while (pow <= L) pow *= 2, ++N;\n int M = (N-1)*2 + __builtin_popcount(L)-1;\n cout<<N<<\" \"<<M<<endl;\n REP(i,N-1){\n cout<<i+1<<\" \"<<i+2<<\" \"<<0<<endl;\n cout<<i+1<<\" \"<<i+2<<\" \"<<(1<<i)<<endl;\n }\n int cur = 1<<(N-1);//N-1からN\n for(int i = N-2;i >= 0;i--){\n if(L&(1<<i)){\n //Lのi bit目が立っているか\n cout<<i+1<<\" \"<<N<<\" \"<<cur<<endl;\n cur += (1<<i);\n }\n }\n}", "#include <iostream>\n#include <cstring>\n#include <vector>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <queue>\n#include <cstdio>\n#include <cmath>\n#include <stack>\ntypedef long long ll;\n#define INF 0x3f3f3f3f\n\nusing namespace std;\nint N = 0, M = 0, L = 0;\nstring result;\nchar temp_char[1024];\nvoid add_edge(int from, int to, int weight)\n{\n\tsprintf(temp_char, \"%d %d %d\\n\", from, to, weight);\n\tresult += temp_char;\n\tM++;\n}\n\nint max_r(int num)\n{\n\tint p = 0;\n\twhile( (1L << p) <= num)\n\t{\n\t\tp++;\n\t}\n\treturn p - 1;\n}\nint main(int argc, char *argv[]) {\n\tcin >> L;\n\tint r = max_r(L);\n\tN = r + 1;\n\tfor(int i = 1; i <= r; i++)\n\t{\n\t\tadd_edge(i, i + 1, (1 << (i - 1)));\n\t\tadd_edge(i, i + 1, 0);\n\t}\n\t\n\tint current = 1 << r;\n\tint remind = L - current;\n\twhile(remind)\n\t{\n\t\tint p = max_r(remind);\n\t\tadd_edge(p + 1, N, current);\n\t\tcurrent += 1 << p;\n\t\tremind = L - current;\n\t}\n\tcout << N << \" \" << M << endl;\n\tcout << result;\n}", "L = int(input())\nans = []\n\n# 頂点数はbitの長さ\nN = len(bin(L)[2:])\n\n# 頂点間に0の辺と2**iの辺を張る\nfor i in range(N - 1)[::-1]:\n ans.append([i + 1, i + 2, 2 ** (N - i - 2)])\n ans.append([i + 1, i + 2, 0])\n\n# 表現できてないパスの個数\nneed = L - (2 ** (N - 1))\n\n# 表現できてないコスト（大きい順）\ncost = list(range(2 ** (N - 1), 2 ** (N -1) + need))\n\n# コストのリスト上を移動するマーカー\nmarker = 0\n\n# どこにバイパスを張るか\nbit = bin(need)[2:][::-1]\n\n# バイパスを張っていく\nfor i in range(len(bit)):\n if bit[i] != \"1\":\n continue\n\n # 辺を追加\n ans.append([1, N - i, cost[marker]])\n\n # マーカーを進める\n marker += 2 ** i\n\nprint(N, len(ans))\nfor a in ans:\n print(\" \".join(map(str, a)))\n", "import math\nl = int(input())\nr = math.floor(math.log2(l))\nn = r+1\npow2r = pow(2, r)\nlst = list([i, i+1, 0] for i in range(1, n)) + list([i, i+1, pow(2, i-1)] for i in range(1, n))\nfor i in range(1, n)[::-1]:\n p = pow(2, i-1)\n if l - p >= pow2r:\n lst.append([i, n, l-p])\n l -= p\nprint(n, len(lst))\nfor u, v, w in lst:\n print(u, v, w)", "#include <bits/stdc++.h>\n// D - All Your Paths are Different Lengths\n\nusing namespace std;\n\nvector<pair<pair<int,int>,int>> edges;\n\nint main() {\n int L,N,i;\n\n scanf(\"%d\",&L);\n\n N = log2(L) + 1;\n\n for (i = 1;i < N;i++) {\n edges.push_back({{i,i + 1},0});\n edges.push_back({{i,i + 1},1 << (i - 1)});\n }\n\n i = (1 << (N - 1));\n while (i < L) {\n edges.push_back({{log2(L - i) + 1,N},i});\n i += (1 << (int) (log2(L - i)));\n }\n\n printf(\"%d %d\\n\",N,edges.size());\n for (pair<pair<int,int>,int> p : edges)\n printf(\"%d %d %d\\n\",p.first.first,p.first.second,p.second);\n\n return 0;\n}\n", "import java.io.*;\nimport java.util.*;\nimport java.util.List;\n\nclass Main {\n static Scanner scanner = new Scanner();\n\n public static void main(String[]$) throws IOException {\n int l = scanner.nextInt();\n int r = Integer.toBinaryString(l).length() - 1;\n System.out.println(r + 1);\n List<Edge> edges = new ArrayList<>();\n for (int i = 0; i < r; i++) {\n edges.add(new Edge(i + 1, i + 2, 0));\n edges.add(new Edge(i + 1, i + 2, 1 << i));\n }\n for (int i = r; i > 0; i--) {\n int j = l - (1 << i - 1);\n if (j >= 1 << r) {\n edges.add(new Edge(i, r + 1, j));\n l = j;\n }\n }\n System.out.println(edges.size());\n for (Edge edge : edges) {\n System.out.println(edge);\n }\n }\n\n static class Edge {\n int to;\n int from;\n int cost;\n\n Edge(int to, int from, int cost) {\n this.to = to;\n this.from = from;\n this.cost = cost;\n }\n\n @Override\n public String toString() {\n return String.format(\"%s %s %s\", to, from, cost);\n }\n }\n\n static class Scanner {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 1 << 15);\n StringTokenizer tokenizer;\n\n String next() throws IOException {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n }\n}", "import math\n\nL = int(input())\nr = math.floor(math.log2(L))\nN = r + 1\n\nE_list = []\n\nfor i in range(1, N):\n E_list.append((i, i+1, 0))\n E_list.append((i, i+1, 2**(r - i)))\n if L - 2**(N-i-1) >= 2**r:\n E_list.append((1, i+1, L - 2**(N-i-1)))\n L -= 2**(N-i-1)\n\nM = len(E_list)\n\nprint(N, M)\nfor e in E_list:\n print(e[0], e[1], e[2])\n\n", "// practice with Dukkha\n#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nint ii[60], jj[60], ww[60], m;\n\nvoid add(int i, int j, int w) {\n\tii[m] = i;\n\tjj[m] = j;\n\tww[m] = w;\n\tm++;\n}\n\nint main() {\n\tint l; cin >> l;\n\tint k = 0;\n\twhile (1 << k + 1 <= l)\n\t\tk++;\n\tfor (int i = 0; i < k; i++) {\n\t\tint j = i + 1;\n\t\tadd(i, j, 0);\n\t\tadd(i, j, 1 << i);\n\t}\n\tfor (int i = 0; i < k; i++)\n\t\tif (l & 1 << i)\n\t\t\tadd(i, k, l ^= 1 << i);\n\tcout << k + 1 << ' ' << m << '\\n';\n\twhile (m--)\n\t\tcout << ii[m] + 1 << ' ' << jj[m] + 1 << ' ' << ww[m] << '\\n';\n\treturn 0;\n}\n", "#include <iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<cctype>\n#include<queue>\n#include<deque>\n#include<regex>\n#include<stack>\n#include<stdio.h>\n#include<vector>\n#include<set>\n#include<map>\n#include<iomanip>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\ntypedef int long long ll;\n\nint main(){\n\nll l;\ncin>>l;\nll r=0;\n// for (r=1;r<=19;++r) {\n// if (l < pow(2,r)) {\n// break;\n// }\n// }\nfor(int i=1;i<20;i++){\n if (l < pow(2,i)) {\n break;\n }else{\n r=i;\n }\n}\n//r--;\nvector<vector<ll>> ans;\nfor(ll i=1;i<=r;i++){\n ans.push_back({i,i+1,0});\n ans.push_back({i,i+1,static_cast<ll>(pow(2,i-1))});\n\n}\n\nfor(ll i=r;i>=1;i--){\n if(l-pow(2,i-1)>=pow(2,r)){\n ans.push_back({i,r+1,l-static_cast<ll>(pow(2,i-1))});\n l-=pow(2,i-1);\n}\n\n}\n cout<<r+1<<' '<<ans.size()<<endl;\nfor(auto ea:ans){\n cout<<ea[0]<<' '<<ea[1]<<' '<<ea[2]<<endl;\n}\n\n\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int l;\n cin >> l;\n\n int p=0;\n for(int i=1; i<20; i++){\n if(pow(2,i) > l) break;\n p += 1;\n }\n\n l = l - pow(2,p);\n int count = 0;\n vector<vector<int>> ans;\n for(int i=p; i>=1; i--){\n if(l - pow(2,i-1) >= 0){\n ans.push_back({i, p+1, l - (int)pow(2,i-1) + (int)pow(2,p)});\n count += 1;\n l -= pow(2,i-1);\n }\n }\n\n cout << p+1 << \" \" << 2*p + count << endl;\n for(int i=0; i<p; i++){\n cout << i+1 << \" \" << i+2 << \" \" << 0 << endl;\n cout << i+1 << \" \" << i+2 << \" \" << pow(2,i) << endl;\n }\n for(int i=0; i<count; i++){\n cout << ans[i][0] << \" \" << ans[i][1] << \" \" << ans[i][2] << endl;\n }\n return 0;\n}", "import sys\ndef I(): return int(sys.stdin.readline().rstrip())\n\n\nL = I()\nN = L.bit_length()\nM = 2*(N-1)\nANS = [[i,i+1,0] for i in range(1,N)] + [[i,i+1,2**(N-1-i)] for i in range(1,N)]\n\na = 1 << (N-1)\nfor i in range(N-2,-1,-1):\n if (L >> i) & 1:\n ANS.append([1,N-i,a])\n M += 1\n a += 1 << i\n\nprint(N,M)\nfor i in range(M):\n print(*ANS[i])\n", "L = int(input())\ndef digits_count(n):\n cnt = 0\n while n != 0:\n cnt += 1\n n //= 2\n return cnt\ndef doubling(n, m):\n y = 1\n base = n\n while m != 0:\n if m % 2 == 1:\n y *= base\n base *= base\n m //= 2\n return y\nm = digits_count(L)\nA = [0 for _ in range(m)]\nfor i in range(m, 0, -1):\n A[i-1] = L % 2\n L //= 2\nbinomial = [1 for _ in range(m)]\nfor i in range(1, m):\n binomial[i] = binomial[i-1] * 2\nvert = [[i*m+i+1, binomial[i]] for i in range(m-1)]\nvert = vert[:] + [[i*m+i+1, 0] for i in range(m-1)]\nS = doubling(2, m - 1)\nfor i in range(1, m):\n if A[i] == 1:\n vert.append([(m-i-1)*m+m-1, S])\n S += binomial[m-i-1]\nprint(m, len(vert))\nfor i in vert:\n print(i[0] // m + 1, i[0] % m + 1, i[1])", "def gen_graph(i,step,L):\n # index iから始める\n # 0からweight*(L-1)までのL種の長さを作る\n if L == 1:\n return [i],[]\n v,e = gen_graph(i+1,2*step,L//2)\n v = [i] + v\n e = e + [(i,i+1,0),(i,i+1,step)]\n # (0 or 1)+(L//2種の偶数)が作れている\n if L%2 == 0:\n return v,e\n e.append((i,v[-1],step*(L-1)))\n return v,e\n\nL = int(input())\n\nv,e = gen_graph(1,1,L)\nprint(len(v),len(e))\nfor a,b,c in e:\n print(a,b,c)\n\n\n", "\ndef get_node(num):\n now_num = 1\n count = 1\n while 1:\n if now_num > num:\n count -= 1\n break\n count += 1\n now_num *= 2\n return count\n\ndef get_ans_data(node_num):\n ans_data = []\n for i in range(1, node_num):\n data = [i, i + 1, 2**(i - 1)]\n data2 = [i, i + 1, 0]\n ans_data.append(data)\n ans_data.append(data2)\n return ans_data\n\ndef main():\n num = int(input())\n\n node_num = get_node(num)\n ans_data = get_ans_data(node_num)\n\n now_path = 2 ** (node_num - 1)\n now_num = node_num - 1\n\n\n for i in range(now_num, 0, -1):\n now_data = 2 ** (i - 1)\n if num - now_data >= now_path:\n ans_data.append((i, node_num, num - now_data))\n num -= now_data\n\n print(node_num, len(ans_data))\n for data in ans_data:\n print(' '.join(list(map(str, data))))\n\n\nif __name__ == '__main__':\n main()\n", "import java.util.*;\nimport java.io.*;\npublic class Main {\n\tstatic boolean DEBUG;\n\tpublic static void main(String[] args) {\n\t\tDEBUG = args.length > 0 && args[0].equals(\"-DEBUG\");\n\t\tSolver solver = new Solver();\n\t\tsolver.solve();\n\t\tsolver.exit();\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate final InputStream in = System.in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int ptr = 0;\n\t\tprivate int buflen = 0;\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (ptr < buflen) {\n\t\t\t\treturn true;\n\t\t\t}else{\n\t\t\t\tptr = 0;\n\t\t\t\ttry {\n\t\t\t\t\tbuflen = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\tif (buflen <= 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n\t\tprivate boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n\t\tprivate void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n\t\tpublic boolean hasNext() { skipUnprintable(); return hasNextByte();}\n\t\tpublic String next() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile(isPrintableChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif (b < '0' || '9' < b) {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\twhile(true){\n\t\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\t\tn *= 10;\n\t\t\t\t\tn += b - '0';\n\t\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\t\treturn minus ? -n : n;\n\t\t\t\t}else{\n\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Solver {\n\t\tFastScanner sc = new FastScanner();\n\t\tpublic Solver() { }\n\n\t\tString ns() { return sc.next(); }\n\t\tString[] ns(int n) {\n\t\t\tString a[] = new String[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ns(); }\n\t\t\treturn a;\n\t\t}\n\t\tString[][] ns(int n, int m) {\n\t\t\tString a[][] = new String[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ns(m); }\n\t\t\treturn a;\n\t\t}\n\t\tchar[] nc(int n) {\n\t\t\tString str = ns();\n\t\t\tchar a[] = new char[max(n, str.length())];\n\t\t\tfor(int i = 0; i < str.length(); i ++) { a[i] = str.charAt(i); }\n\t\t\treturn a;\n\t\t}\n\t\tchar[][] nc(int n, int m) {\n\t\t\tchar a[][] = new char[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nc(m); }\n\t\t\treturn a;\n\t\t}\n\t\tboolean[] nb(int n, char t) {\n\t\t\tchar c[] = nc(-1);\n\t\t\tif(n < 0) n = c.length;\n\t\t\tboolean a[] = new boolean[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = c[i] == t; }\n\t\t\treturn a;\n\t\t}\n\t\tboolean[][] nb(int n, int m, char t) {\n\t\t\tboolean a[][] = new boolean[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nb(m, t); }\n\t\t\treturn a;\n\t\t}\n\t\tint ni() { return (int)sc.nextLong(); }\n\t\tint[] ni(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ni(); }\n\t\t\treturn a;\n\t\t}\n\t\tint[][] ni(int n, int m) {\n\t\t\tint a[][] = new int[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ni(m); }\n\t\t\treturn a;\n\t\t}\n\t\tlong nl() { return sc.nextLong(); }\n\t\tlong[] nl(int n) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nl(); }\n\t\t\treturn a;\n\t\t}\n\t\tlong[][] nl(int n, int m) {\n\t\t\tlong a[][] = new long[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nl(m); }\n\t\t\treturn a;\n\t\t}\n\t\tdouble nd() { return Double.parseDouble(sc.next()); }\n\t\tdouble[] nd(int n) {\n\t\t\tdouble a[] = new double[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nd(); }\n\t\t\treturn a;\n\t\t}\n\t\tdouble[][] nd(int n, int m) {\n\t\t\tdouble a[][] = new double[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nd(m); }\n\t\t\treturn a;\n\t\t}\n\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tPrintWriter err = new PrintWriter(System.err);\n\t\tvoid prt() { out.print(\"\"); }\n\t\t<T> void prt(T a) { out.print(a); }\n\t\tvoid prtln() { out.println(\"\"); }\n\t\t<T> void prtln(T a) { out.println(a); }\n\t\tvoid prtln(int... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(int element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(long... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(long element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(double... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(double element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(String... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(String element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(char... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(char element : a){ sb.append(element); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(int[][] a) { for(int[] element : a){ prtln(element); } }\n\t\tvoid prtln(long[][] a) { for(long[] element : a){ prtln(element); } }\n\t\tvoid prtln(double[][] a) { for(double[] element : a){ prtln(element); } }\n\t\tvoid prtln(String[][] a) { for(String[] element : a){ prtln(element); } }\n\t\tvoid prtln(char[][] a) { for(char[] element : a){ prtln(element); } }\n\t\tString errconvert(int a) { return isINF(a) ? \"_\" : String.valueOf(a); }\n\t\tString errconvert(long a) { return isINF(a) ? \"_\" : String.valueOf(a); }\n\t\tvoid errprt(int a) { if(DEBUG) { err.print(errconvert(a)); } }\n\t\tvoid errprt(long a) { if(DEBUG) { err.print(errconvert(a)); } }\n\t\tvoid errprt() { if(DEBUG) { err.print(\"\"); } }\n\t\t<T> void errprt(T a) { if(DEBUG) { err.print(a); } }\n\t\tvoid errprt(boolean a) { if(DEBUG) { errprt(a ? \"#\" : \".\"); } }\n\t\tvoid errprtln() { if(DEBUG) { err.println(\"\"); } }\n\t\tvoid errprtln(int a) { if(DEBUG) { err.println(errconvert(a)); } }\n\t\tvoid errprtln(long a) { if(DEBUG) { err.println(errconvert(a)); } }\n\t\t<T> void errprtln(T a) { if(DEBUG) { err.println(a); } }\n\t\tvoid errprtln(boolean a) { if(DEBUG) { errprtln(a ? \"#\" : \".\"); } }\n\t\tvoid errprtln(int... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(int element : a){ sb.append(errconvert(element)+\" \"); }\n\t\t\t\terrprtln(sb.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(long... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(long element : a){ sb.append(errconvert(element)+\" \"); }\n\t\t\t\terrprtln(sb.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(double... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(double element : a){ sb.append(element+\" \"); }\n\t\t\t\terrprtln(sb.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(String... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(String element : a){ sb.append(element+\" \"); }\n\t\t\t\terrprtln(sb.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(char... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(char element : a){ sb.append(element); }\n\t\t\t\terrprtln(sb.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(boolean... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tfor(boolean element : a){ sb.append((element ? \"#\" : \".\")+\" \"); }\n\t\t\t\terrprtln(sb.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(int[][] a) { if(DEBUG) { for(int[] element : a){ errprtln(element); } } }\n\t\tvoid errprtln(long[][] a) { if(DEBUG) { for(long[] element : a){ errprtln(element); } } }\n\t\tvoid errprtln(double[][] a) { if(DEBUG) { for(double[] element : a){ errprtln(element); } } }\n\t\tvoid errprtln(String[][] a) { if(DEBUG) { for(String[] element : a){ errprtln(element); } } }\n\t\tvoid errprtln(char[][] a) { if(DEBUG) { for(char[] element : a){ errprtln(element); } } }\n\t\tvoid errprtln(boolean[][] a) { if(DEBUG) { for(boolean[] element : a){ errprtln(element); } } }\n\n\t\tvoid reply(boolean b) { prtln(b ? \"Yes\" : \"No\"); }\n\t\tvoid REPLY(boolean b) { prtln(b ? \"YES\" : \"NO\"); }\n\n\t\tvoid flush() { out.flush(); if(DEBUG) { err.flush(); } }\n\t\tvoid exit() { flush(); System.exit(0); }\n\n\t\tint min(int a, int b) { return Math.min(a, b); }\n\t\tlong min(long a, long b) { return Math.min(a, b); }\n\t\tdouble min(double a, double b) { return Math.min(a, b); }\n\t\tint min(int... x) {\n\t\t\tint min = x[0];\n\t\t\tfor(int val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tlong min(long... x) {\n\t\t\tlong min = x[0];\n\t\t\tfor(long val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tdouble min(double... x) {\n\t\t\tdouble min = x[0];\n\t\t\tfor(double val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tint max(int a, int b) { return Math.max(a, b); }\n\t\tlong max(long a, long b) { return Math.max(a, b); }\n\t\tdouble max(double a, double b) { return Math.max(a, b); }\n\t\tint max(int... x) {\n\t\t\tint max = x[0];\n\t\t\tfor(int val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tlong max(long... x) {\n\t\t\tlong max = x[0];\n\t\t\tfor(long val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tdouble max(double... x) {\n\t\t\tdouble max = x[0];\n\t\t\tfor(double val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tlong sum(int... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(int element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(long... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(long element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\t\tdouble sum(double... a) {\n\t\t\tdouble sum = 0;\n\t\t\tfor(double element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(int[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) { sum[i + 1] = sum[i] + a[i]; }\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(long[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) { sum[i + 1] = sum[i] + a[i]; }\n\t\t\treturn sum;\n\t\t}\n\t\tdouble[] sums(double[] a) {\n\t\t\tdouble sum[] = new double[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) { sum[i + 1] = sum[i] + a[i]; }\n\t\t\treturn sum;\n\t\t}\n\n\t\tlong abs(double x) { return (long)Math.abs(x); }\n\t\tlong round(double x) { return Math.round(x); }\n\t\tlong floor(double x) { return (long)Math.floor(x); }\n\t\tlong ceil(double x) { return (long)Math.ceil(x); }\n\t\tdouble sqrt(double x) { return Math.sqrt(x); }\n\t\tdouble pow(double x, double y) { return Math.pow(x, y); }\n\t\tlong pow(long x, long y) { return (long)Math.pow(x, y); }\n\t\tint gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n\t\tlong gcd(long a, long b) { return b == 0 ? a : gcd(b, a % b); }\n\t\tlong lcm(long a, long b) { return a * b / gcd(a, b); }\n\n\t\tint upperToInt(char a) { return a - 'A'; }\n\t\tint lowerToInt(char a) { return a - 'a'; }\n\t\tint numToInt(char a) { return a - '0'; }\n\t\tint charToInt(char a) { return a >= 'a' ? lowerToInt(a) : a >= 'A' ? upperToInt(a) : numToInt(a); }\n\t\tchar intToUpper(int a) { return (char)(a + 'A'); }\n\t\tchar intToLower(int a) { return (char)(a + 'a'); }\n\t\tchar intToNum(int a) { return (char)(a + '0'); }\n\n\t\tlong[] div(long a) {\n\t\t\tList<Long> divList = new ArrayList<Long>();\n\t\t\tfor(long i = 1; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tdivList.add(i);\n\t\t\t\t\tif(i * i != a) { divList.add(a / i); };\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlong div[] = new long[divList.size()];\n\t\t\tfor(int i = 0; i < divList.size(); i ++) { div[i] = divList.get(i); }\n\t\t\treturn div;\n\t\t}\n\n\t\tlong[][] factor(long a) {\n\t\t\tList<Long> factorList = new ArrayList<Long>();\n\t\t\tList<Long> degreeList = new ArrayList<Long>();\n\t\t\tfor(long i = 2; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tlong count = 0;\n\t\t\t\t\twhile(a % i == 0) {\n\t\t\t\t\t\ta /= i;\n\t\t\t\t\t\tcount ++;\n\t\t\t\t\t}\n\t\t\t\t\tfactorList.add(i);\n\t\t\t\t\tdegreeList.add(count);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(a > 1) {\n\t\t\t\tfactorList.add(a);\n\t\t\t\tdegreeList.add(1L);\n\t\t\t}\n\t\t\tlong factor[][] = new long[factorList.size()][2];\n\t\t\tfor(int i = 0; i < factorList.size(); i ++) {\n\t\t\t\tfactor[i][0] = factorList.get(i);\n\t\t\t\tfactor[i][1] = degreeList.get(i);\n\t\t\t}\n\t\t\tArrays.sort(factor, (sort1, sort2) -> Long.compare(sort1[0], sort2[0]));\n\t\t\treturn factor;\n\t\t}\n\n\t\tboolean isPrime(long x) {\n\t\t\tboolean ok = x > 1;\n\t\t\tfor(long i = 2; i * i <= x; i ++) {\n\t\t\t\tok &= x % i != 0;\n\t\t\t\tif(!ok) return ok;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean[] prime(int num) {\n\t\t\tboolean prime[] = new boolean[num];\n\t\t\tfill(prime, true);\n\t\t\tprime[0] = false;\n\t\t\tprime[1] = false;\n\t\t\tfor(int i = 2; i < num; i ++) {\n\t\t\t\tif(prime[i]) {\n\t\t\t\t\tfor(int j = 2; i * j < num; j ++) {\n\t\t\t\t\t\tprime[i * j] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn prime;\n\t\t}\n\n\t\tlong[][] countElements(long[] a, boolean sort) {\n\t\t\tint len = a.length;\n\t\t\tlong array[] = new long[len];\n\t\t\tfor(int i = 0; i < len; i ++) {\n\t\t\t\tarray[i] = a[i];\n\t\t\t}\n\t\t\tif(sort) { Arrays.sort(array); }\n\t\t\tList<Long> elem = new ArrayList<Long>();\n\t\t\tList<Long> cnt = new ArrayList<Long>();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add(array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else {\n\t\t\t\t\ttmp ++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\t\tlong[][] countElements(String str, boolean sort) {\n\t\t\tint len = str.length();\n\t\t\tchar array[] = str.toCharArray();\n\t\t\tif(sort) { Arrays.sort(array); }\n\t\t\tList<Long> elem = new ArrayList<Long>();\n\t\t\tList<Long> cnt = new ArrayList<Long>();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add((long)array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else {\n\t\t\t\t\ttmp ++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\n\t\tint numDigits(long a) { return Long.toString(a).length(); }\n\t\tlong bitFlag(int a) { return 1L << (long)a; }\n\t\tboolean isFlagged(long x, int a) { return (x & bitFlag(a)) != 0; }\n\n\t\tlong countString(String str, String a) { return (str.length() - str.replace(a, \"\").length()) / a.length(); }\n\t\tlong countStringAll(String str, String a) { return str.length() - str.replaceAll(a, \"\").length(); }\n\n\t\tint lowerBound(long array[], long key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(long array[], long key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(long array[], long key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(long array[], long key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(long array[], long key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(long array[], long key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(long array[], long key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(long array[], long key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(long array[], long key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(long array[], long key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(long array[], long key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) {\n\t\t\t\t\tok = mid;\n\t\t\t\t}else {\n\t\t\t\t\tng = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(long array[], int index, long key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater)\n\t\t\t\t|| (array[index] < key && !greater)\n\t\t\t\t|| (array[index] == key && equals);\n\t\t}\n\n\t\tvoid reverse(String array[]) {\n\t\t\tString reversed[] = new String[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(int array[]) {\n\t\t\tint reversed[] = new int[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(long array[]) {\n\t\t\tlong reversed[] = new long[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(double array[]) {\n\t\t\tdouble reversed[] = new double[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(boolean array[]) {\n\t\t\tboolean reversed[] = new boolean[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid fill(int array[], int x) { Arrays.fill(array, x); }\n\t\tvoid fill(long array[], long x) { Arrays.fill(array, x); }\n\t\tvoid fill(double array[], double x) { Arrays.fill(array, x); }\n\t\tvoid fill(boolean array[], boolean x) { Arrays.fill(array, x); }\n\t\tvoid fill(int array[][], int x) { for(int a[] : array) { fill(a, x); } }\n\t\tvoid fill(long array[][], long x) { for(long a[] : array) { fill(a, x); } }\n\t\tvoid fill(double array[][], double x) { for(double a[] : array) { fill(a, x); } }\n\t\tvoid fill(boolean array[][], boolean x) { for(boolean a[] : array) { fill(a, x); } }\n\t\tvoid fill(int array[][][], int x) { for(int a[][] : array) { fill(a, x); } }\n\t\tvoid fill(long array[][][], long x) { for(long a[][] : array) { fill(a, x); } }\n\t\tvoid fill(double array[][][], double x) { for(double a[][] : array) { fill(a, x); } }\n\t\tvoid fill(boolean array[][][], boolean x) { for(boolean a[][] : array) { fill(a, x); } }\n\n\t\tvoid shuffleArray(int[] array){\n\t\t\tint n = array.length;\n\t\t\tRandom rnd = new Random();\n\t\t\tfor(int i = 0; i < n; i ++){\n\t\t\t\tint tmp = array[i];\n\t\t\t\tint randomPos = i + rnd.nextInt(n - i);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tvoid shuffleArray(long[] array){\n\t\t\tint n = array.length;\n\t\t\tRandom rnd = new Random();\n\t\t\tfor(int i = 0; i < n; i ++){\n\t\t\t\tlong tmp = array[i];\n\t\t\t\tint randomPos = i + rnd.nextInt(n - i);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tvoid shuffleArray(double[] array){\n\t\t\tint n = array.length;\n\t\t\tRandom rnd = new Random();\n\t\t\tfor(int i = 0; i < n; i ++){\n\t\t\t\tdouble tmp = array[i];\n\t\t\t\tint randomPos = i + rnd.nextInt(n - i);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\n\t\tlong INF = (long)1e18 + 7;\n\t\tboolean isINF(long a) { return abs(a) > INF / 1000; }\n\t\tboolean isPlusINF(long a) { return a > 0 && isINF(a); }\n\t\tboolean isMinusINF(long a) { return isPlusINF(- a); }\n\t\tint I_INF = (int)1e9 + 7;\n\t\tboolean isINF(int a) { return abs(a) > I_INF / 1000; }\n\t\tboolean isPlusINF(int a) { return a > 0 && isINF(a); }\n\t\tboolean isMinusINF(int a) { return isPlusINF(- a); }\n\n\n\t\t// mods\n\t\tlong MOD = (long)1e9 + 7; // 998244353;\n\t\tpublic long mod(long i) { i %= MOD; return i + (i < 0 ? MOD : 0); }\n\n\t\tlong pow_m(long x, long y) {\n\t\t\tif (y == 0) { return 1;\n\t\t\t}else {\n\t\t\t\tlong tmp = pow_m(x, y / 2);\n\t\t\t\treturn mod(mod(tmp * tmp) * (y % 2 == 0 ? 1 : x));\n\t\t\t}\n\t\t}\n\t\tlong[] pows_m(long x, int max) {\n\t\t\tlong pow[] = new long[max + 1];\n\t\t\tpow[0] = 1;\n\t\t\tfor(int i = 0; i < max; i ++) {\n\t\t\t\tpow[i + 1] = mod(pow[i] * x);\n\t\t\t}\n\t\t\treturn pow;\n\t\t}\n\n\t\tint MAX_INV_SIZE = 100_100;\n\t\tHashMap<Long, Long> invMap = new HashMap<>();\n\t\tlong inv(long x) {\n\t\t\tx = mod(x);\n\t\t\tif(invMap.containsKey(x)) { return invMap.get(x); }\n\t\t\tif(invMap.size() >= MAX_INV_SIZE) { return calInv(x); }\n\t\t\tinvMap.put(x, calInv(x));\n\t\t\treturn invMap.get(x);\n\t\t}\n\t\tlong calInv(long x) { return pow_m(x, MOD - 2); }\n\n\t\tint MAX_FACT = 5_000_100;\n\t\tlong fact[];\n\t\tlong invFact[];\n\t\tboolean isFactPrepared = false;\n\t\tHashMap<Integer, long[]> factMap;\n\t\tvoid prepareFact() {\n\t\t\tfact = new long[MAX_FACT];\n\t\t\tArrays.fill(fact, 0);\n\t\t\tinvFact = new long[MAX_FACT];\n\t\t\tArrays.fill(invFact, 0);\n\t\t\tfact[0] = 1;\n\t\t\tint maxIndex = min(MAX_FACT, (int)MOD);\n\t\t\tfor(int i = 1; i < maxIndex; i ++) { fact[i] = mod(fact[i - 1] * i); }\n\t\t\tinvFact[maxIndex - 1] = inv(fact[maxIndex - 1]);\n\t\t\tfor(int i = maxIndex - 1; i > 0; i --) { invFact[i - 1] = mod(invFact[i] * i); }\n\n\t\t\tfactMap = new HashMap<>();\n\t\t\tisFactPrepared = true;\n\t\t}\n\n\t\tlong P(int n, int r) {\n\t\t\tif(!isFactPrepared) { prepareFact(); }\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\tif(n >= MAX_FACT) {\n\t\t\t\tif(!factMap.containsKey(n)) {\n\t\t\t\t\tlong largeFact[] = new long[MAX_FACT];\n\t\t\t\t\tfactMap.put(n, largeFact);\n\t\t\t\t\tfill(largeFact, -INF);\n\t\t\t\t\tlargeFact[0] = 1;\n\t\t\t\t}\n\t\t\t\tlong largeFact[] = factMap.get(n);\n\t\t\t\tint i = r;\n\t\t\t\twhile(isINF(largeFact[i])) { i --; }\n\t\t\t\tfor(; i < r; i ++) { largeFact[i + 1] = mod(largeFact[i] * (n - i)); }\n\t\t\t\treturn largeFact[r];\n\t\t\t}\n\t\t\treturn mod(fact[n] * invFact[n - r]);\n\t\t}\n\t\tlong C(int n, int r) {\n\t\t\tif(!isFactPrepared) { prepareFact(); }\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\treturn mod(P(n, r) * invFact[r]);\n\t\t}\n\t\tlong H(int n, int r) { return C((n - 1) + r, r); }\n\n\n\t\t// grid\n\t\tclass Grids {\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tGrid[][] gs;\n\t\t\tGrids(int h, int w) {\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tgs = new Grid[h][w];\n\t\t\t\tfor(int i = 0; i < h; i ++) {\n\t\t\t\t\tfor(int j = 0; j < w; j ++) {\n\t\t\t\t\t\tgs[i][j] = new Grid(i, j, h, w);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid init(boolean[][] b) {\n\t\t\t\tfor(int i = 0; i < h; i ++) {\n\t\t\t\t\tfor(int j = 0; j < w; j ++) {\n\t\t\t\t\t\tgs[i][j].b = b[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tvoid init(long[][] val) {\n\t\t\t\tfor(int i = 0; i < h; i ++) {\n\t\t\t\t\tfor(int j = 0; j < w; j ++) {\n\t\t\t\t\t\tgs[i][j].val = val[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint dx[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};\n\t\t\tint dy[] = {0, 0, 0, -1, 1, -1, -1, 1, 1};\n\t\t\tGrid next(Grid g, int i) {\n\t\t\t\treturn isValid(g.x + dx[i], g.y + dy[i], g.h, g.w)\n\t\t\t\t\t? gs[g.x + dx[i]][g.y + dy[i]]\n\t\t\t\t\t: null;\n\t\t\t}\n\t\t}\n\t\tclass Grid implements Comparable<Grid> {\n\t\t\tint x;\n\t\t\tint y;\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tint i;\n\t\t\tboolean b;\n\t\t\tlong val;\n\n\t\t\tGrid() { }\n\t\t\tGrid(int x, int y, int h, int w) { init(x, y, h, w, false, 0); }\n\t\t\tGrid(int x, int y, int h, int w, boolean b) { init(x, y, h, w, b, 0); }\n\t\t\tGrid(int x, int y, int h, int w, long val) { init(x, y, h, w, false, val); }\n\t\t\tGrid(int x, int y, int h, int w, boolean b, long val) { init(x, y, h, w, b, val); }\n\n\t\t\tvoid init(int x, int y, int h, int w, boolean b, long val) {\n\t\t\t\tthis.x = x;\n\t\t\t\tthis.y = y;\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tthis.b = b;\n\t\t\t\tthis.val = val;\n\t\t\t\ti = x * w + y;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic int compareTo(Grid g) {\n\t\t\t\treturn Long.compare(this.val, g.val);\n\t\t\t}\n\t\t}\n\n\t\tboolean isValid(int x, int y, int h, int w) {\n\t\t\treturn x >= 0 && x < h && y >= 0 && y < w;\n\t\t}\n\t\tboolean isValid(Grid g) {\n\t\t\treturn isValid(g.x, g.y, g.h, g.w);\n\t\t}\n\n\t\t// graph\n\t\tclass Graph {\n\t\t\tint numNode;\n\t\t\tint numEdge;\n\t\t\tboolean directed;\n\t\t\tEdge edges[];\n\t\t\tNode nodes[];\n\t\t\tNode reversedNodes[];\n\n\t\t\tGraph(int numNode, int numEdge, Edge edges[], boolean directed) {\n\t\t\t\tthis.numNode = numNode;\n\t\t\t\tthis.numEdge = numEdge;\n\t\t\t\tthis.directed = directed;\n\t\t\t\tthis.edges = edges;\n\t\t\t\tnodes = new Node[numNode];\n\t\t\t\treversedNodes = new Node[numNode];\n\t\t\t\tfor(int i = 0; i < numNode; i ++) {\n\t\t\t\t\tnodes[i] = new Node(i);\n\t\t\t\t\treversedNodes[i] = new Node(i);\n\t\t\t\t}\n\n\t\t\t\tfor(Edge edge : edges) {\n\t\t\t\t\tnodes[edge.source].add(edge.target, edge.cost);\n\t\t\t\t\tif(directed) {\n\t\t\t\t\t\treversedNodes[edge.target].add(edge.source, edge.cost);\n\t\t\t\t\t}else {\n\t\t\t\t\t\tnodes[edge.target].add(edge.source, edge.cost);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid clearNodes() {\n\t\t\t\tfor(Node n : nodes) { n.clear(); }\n\t\t\t\tfor(Node n : reversedNodes) { n.clear(); }\n\t\t\t}\n\t\t}\n\n\t\tclass Node {\n\t\t\tint id;\n\t\t\tArrayList<Edge> edges = new ArrayList<Edge>();\n\n\t\t\tNode(int id) {\n\t\t\t\tthis.id = id;\n\t\t\t}\n\t\t\tvoid add(int target, long cost) {\n\t\t\t\tedges.add(new Edge(id, target, cost));\n\t\t\t}\n\t\t\tvoid clear() {\n\t\t\t\tedges.clear();\n\t\t\t}\n\t\t}\n\n\t\tclass Edge implements Comparable<Edge> {\n\t\t\tint source;\n\t\t\tint target;\n\t\t\tlong cost;\n\t\t\tEdge(int source, int target, long cost) {\n\t\t\t\tthis.source = source;\n\t\t\t\tthis.target = target;\n\t\t\t\tthis.cost = cost;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic int compareTo(Edge e) {\n\t\t\t\treturn Long.compare(this.cost, e.cost);\n\t\t\t}\n\t\t}\n\npublic void solve() {\n\tint l = ni();\n\tl --;\n\tint crt = 1;\n\tList<Edge> edges = new ArrayList<>();\n\tint numNode = 20;\n\twhile(l >= 0 && crt < numNode) {\n\t\tif(l % 2 == 0) {\n\t\t\tedges.add(new Edge(crt, numNode, l));\n\t\t\tl --;\n\t\t}else {\n\t\t\tl /= 2;\n\t\t\tedges.add(new Edge(crt, crt + 1, 0));\n\t\t\tedges.add(new Edge(crt, crt + 1, l + 1));\n\t\t\tcrt ++;\n\t\t}\n\t}\n\tprtln(numNode, edges.size());\n\tassert(edges.size() <= 60);\n\tassert(crt <= numNode);\n\tfor(int i = 0; i < edges.size(); i ++) {\n\t\tprtln(edges.get(i).source, edges.get(i).target, edges.get(i).cost);\n\t}\n}\n\n\n\n\t}\n}", "#!/usr/bin/env python3\nimport sys\n\n\ndef solve(L: int):\n tmp = L\n a = []\n while tmp > 0:\n a.append(tmp)\n tmp //= 2\n a.reverse()\n #print(a)\n e = []\n for i in range(1, len(a)):\n e.append([i, i + 1, 0])\n e.append([i, i + 1, a[i - 1]])\n if a[i] % 2 > 0:\n e.append([1, i + 1, a[i] - 1])\n print(len(a), len(e))\n for t in e:\n print(t[0], t[1], t[2])\n return\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n L = int(next(tokens)) # type: int\n solve(L)\n\nif __name__ == '__main__':\n main()\n", "#include <bits/stdc++.h>\n#include <algorithm>\nusing namespace std;\nint digits(int n){\n\tint count = 0; \n\twhile(n > 0){\n\t\tcount ++; \n\t\tn /= 2; \n\t}\n\treturn count; \n}\nint ketawa(int n){\n\tint sum = 0; \n\twhile(n > 0){\n\t\tsum += n % 2; \n\t\tn /= 2; \n\t}\n\treturn sum; \n}\nint main(){\n\tint L; \n\tcin >> L; \n\tint N = digits(L); \n\tint M = N * 2 + ketawa(L) - 3; \n\tcout << N << \" \" << M << endl; \n\tfor(int i = 1; i < N; i++){\n\t\tcout << i << \" \" << i+1 << \" \" << 0 << endl; \n\t\tcout << i << \" \" << i+1 << \" \" << (1 << (N - 1 - i)) << endl; \n\t}\n\tfor(int i = 2; i <= N; i++){\n\t\tint a = (L >> (N-i)); \n\t\tif(a % 2) cout << 1 << \" \" << i << \" \" << ((a >> 1) << (N-i+1)) << endl; \n\t}\n}", "L = int(input())\n\nl = L\nr = 1\nnodes = 1\nbits = 0\nwhile l!=1:\n bits += l & 1\n l>>=1\n r<<=1\n nodes+=1\nprint(str(nodes)+\" \"+str((nodes-1)*2+bits))\n#main part\nfor i in range(1,nodes):\n r>>=1\n print(str(i)+\" \"+str(i+1)+\" \"+str(0))\n print(str(i)+\" \"+str(i+1)+\" \"+str(r))\n\nr = 1<<(nodes-1)\nd = r\nfor i in range(1,nodes):\n if (r>>i)&L:\n print(str(1)+\" \"+str(i+1)+\" \"+str(d))\n d+= (r>>i)\n \n", "# encoding: utf-8\nL = int(input())\n\n# length\nfor l_max in range(1, 21):\n if 2 ** l_max > L: break\n\n# encode L - 2 ** (l_max - 1)\nbits_sub = [None] * l_max\nL_temp = L - 2 ** (l_max - 1)\nfor l in range(l_max):\n bits_sub[l] = L_temp % 2\n L_temp = L_temp // 2\n\n# result\nN = l_max\nM = 2 * (l_max - 1) + sum(bits_sub)\nprint(N, M) # oh...\n\n# main path\nfor i in range(l_max - 1):\n for j in range(2):\n print(i + 1, i + 2, j * (2 ** i))\n\n# sub path\nmaxlen = 2 ** (l_max - 1)\nfor i, bit in enumerate(bits_sub):\n if bit == 0: continue\n for j in range(bit):\n print(i + 1, l_max, maxlen)\n maxlen += 2 ** i", "L = int(input())\n\n\nN = L.bit_length()\nans = []\nfor i in range(N - 1):\n ans.append((i, i + 1, 0))\n ans.append((i, i + 1, 2 ** (N - i - 2)))\n\n\nX = L - 2 ** (N - 1)\ndist = 2 ** (N - 1)\nfor i in reversed(range(X.bit_length())):\n if X & (1 << i):\n ans.append((0, N - i - 1, dist))\n dist += (2 ** i)\n\n\nprint(N, len(ans))\nfor a, b, d in ans:\n print(a + 1, b + 1, d)\n", "import static java.lang.Math.*;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.InputMismatchException;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.util.stream.Stream;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic long LINF = 1L << 55;\n\tstatic int MOD = 1000000007;\n\tstatic int[] mh4 = { 0, -1, 1, 0 };\n\tstatic int[] mw4 = { -1, 0, 0, 1 };\n\tstatic int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\tstatic int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\n\t@SuppressWarnings(\"unchecked\")\n\tstatic class TaskX {\n\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint l = in.nextInt();\n\n\t\t\tint r = f(l);\n\t\t\tList<E>[] g = new ArrayList[r+1];\n\t\t\tg = Stream.generate(ArrayList::new).limit(r+1).toArray(List[]::new);\n\n\t\t\tint m = 0;\n\t\t\tfor (int i = 0; i < r; i++) {\n\t\t\t\tg[i].add(new E(i+1, 0));\n\t\t\t\tg[i].add(new E(i+1, (int)Math.pow(2, i)));\n\t\t\t\tm += 2;\n\t\t\t}\n\n\t\t\tint min = (int)pow(2, r);\n\t\t\tint max = l-1;\n\n\t\t\tfor (int i = r; i >= 0; i--) {\n\t\t\t\tif (min + (int)pow(2, i)-1 <= max) {\n\t\t\t\t\tg[i].add(new E(r, min));\n\t\t\t\t\tmin += (int)pow(2, i);\n\t\t\t\t\tm++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.printf(\"%d %d\\n\", r+1, m);\n\t\t\tfor (int i = 0; i < r+1; i++) {\n\t\t\t\tfor (int j = 0; j < g[i].size(); j++) {\n\t\t\t\t\tout.printf(\"%d %d %d\\n\", i+1, g[i].get(j).to+1, g[i].get(j).cost);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\n\tstatic int f(int n) {\n\t\tint ret = 0;\n\t\twhile (n / 2 > 0) {\n\t\t\tret++;\n\t\t\tn /= 2;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic class E {\n\t\tint to, cost;\n\n\t\tpublic E(int to, int cost) {\n\t\t\tsuper();\n\t\t\tthis.to = to;\n\t\t\tthis.cost = cost;\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic int[] nextIntArrayDec(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic int[] nextIntArray1Index(int n) {\n\t\t\tint[] res = new int[n + 1];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i + 1] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArrayDec(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray1Index(int n) {\n\t\t\tlong[] res = new long[n + 1];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i + 1] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic double[] nextDoubleArray(int n) {\n\t\t\tdouble[] res = new double[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\t}\n\n}\n", "from itertools import accumulate\nL = int(input())\np2 = [2 ** i for i in range(20)]\np2acc = list(accumulate(p2))\n\nfor i in range(19, -1, -1):\n if L >= p2[i]:\n N = i + 1\n break\n\nans = []\nfor i in range(N - 1):\n ans.append((i, i + 1, 0))\n ans.append((i, i + 1, 2 ** i))\n\n# 表現できてないパスの数\nremain = L - 2 ** (N - 1)\n# 次のバイパスの長さ\nbypass = 2 ** (N - 1)\n\nwhile remain:\n for i in range(19, -1, -1):\n if remain >= p2[i]:\n ans.append((i, N - 1, bypass))\n remain -= p2[i]\n bypass += p2acc[i - 1] + 1\n\nprint(N, len(ans))\nfor u, v, w in ans:\n print(u + 1, v + 1, w)\n", "l = int(input())\nr = 0\ng = []\n\nwhile 2**r <= l:\n r += 1\nfor i in range(1,r):\n g.append((i,i+1,0))\n g.append((i,i+1,2**(i-1)))\nn = r\nl -= 2**(r-1)\nedge = 2**(n-1)\nwhile l > 0:\n if l < 2**(r-1):\n r -= 1\n continue\n l -= 2**(r-1)\n g.append((r,n,edge))\n edge += 2**(r-1)\n\nprint(n,len(g))\nfor a,b,c in g:\n print(a,b,c)\n", "import copy\nn = int(input())\na = [2**x for x in range(0,21) ]\nb = 0\nfor i, name in enumerate(a):\n b_copy = copy.deepcopy(b)\n b = name\n if b > n:\n break\n\nans = []\nans_l = []\nc = n - b_copy\nfor j in range(i-1)[::-1]:\n if a[j] <= c:\n c -= a[j]\n ans.append(j)\n ans_l.append(b_copy)\n b_copy += a[j]\n\nN = i\nH = 0\nA = []\n\nfor k in range(1, i):\n A.append([k, k+1, 0])\n A.append([k, k+1, 2**(k-1) ])\n H += 2\n if k-1 in ans:\n A.append([k, N, ans_l[ans.index(k-1)]])\n H += 1\n\nprint(\" \".join([str(N), str(H)]))\nfor kk in A:\n print(\" \".join(list(map(str, kk))))", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n#include<string>\n#include<map>\n#include<set>\n#include<queue>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n#define repn(i, n) for(int i = 1; i <= n; i++)\n#define repr(i, n) for(int i = (n-1); i >= 0; i--)\n#define all(x) (x).begin(), (x).end()\n#define lint long long\n\nstruct edge{ int from, to, l; };\n\nint main(){\n int L; cin >> L;\n int r = 0;\n while(1){\n if((int)pow(2, r + 1) <= L) r++;\n else break;\n }\n \n int N = r + 1;\n vector<edge> E;\n for(int i = N - 1; i >= 1; i--){\n if(L - (int)pow(2, i - 1) >= (int)pow(2, r)){\n E.push_back(edge{i, N, L - (int)pow(2, i - 1)});\n L -= (int)pow(2, i - 1);\n }\n }\n\n int M = r * 2 + (int)E.size();\n cout << N << \" \" << M << endl;\n repn(i, r){\n cout << i << \" \" << i + 1 << \" \" << 0 << endl;\n cout << i << \" \" << i + 1 << \" \" << (int)pow(2, i - 1) << endl;\n }\n for(auto& e : E){\n cout << e.from << \" \" << e.to << \" \" << e.l << endl;\n }\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ndeque<int> deq;\n\nvoid rec(int x) {\n deq.push_front(x);\n if (x == 1) {\n return;\n } else if (x % 2 == 1) {\n rec(x - 1);\n } else {\n rec(x / 2);\n }\n}\n\nstruct edge {\n int from, to, cost;\n};\n\nint main() {\n int l;\n cin >> l;\n rec(l);\n vector<edge> e;\n int now = 1;\n for (auto d: deq) {\n if (d == 1) continue;\n if (d % 2 == 1) {\n e.push_back({1, now, d - 1});\n } else {\n for (auto &v: e) {\n v.cost *= 2;\n }\n e.push_back({now, now + 1, 1});\n e.push_back({now, now + 1, 0});\n now++;\n }\n }\n cout << now << \" \" << e.size() << endl;\n for (auto &v: e) {\n cout << v.from << \" \" << v.to << \" \" << v.cost << endl;\n }\n return 0;\n}", "#include<iostream>\n#include<cmath>\n#include<vector>\nusing namespace std;\n\nint main(){\n\tint L;\n\tcin >> L;\n\tint r=(int) log2(L);\n\tint N=r+1;\n\tvector<int> v,u,w;\n\tfor(int i=1;i<N;i++){\t\n\t\tv.push_back(i);\n\t\tu.push_back(i+1);\n\t\tw.push_back(0);\n\t\tv.push_back(i);\n\t\tu.push_back(i+1);\n\t\tw.push_back(pow(2,i-1));\n\t}\n\tfor(int i=N-1;i>0;i--){\n\t\tif(L-pow(2,i-1)>=pow(2,r)){\n\t\t\tv.push_back(i);\n\t\t\tu.push_back(N);\n\t\t\tw.push_back(L-pow(2,i-1));\n\t\t\tL-=pow(2,i-1);\n\t\t}\n\t}\n\tcout << N << ' ' << v.size() << endl;\n\tfor(int i=0;i<v.size();i++){\n\t\tcout << v[i] << ' ' << u[i] << ' ' << w[i] << endl;\n\t}\n}\n", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int l=sc.nextInt();\n sc.close();\n int n=0, m=0;\n while(l>=(1<<n++));n--;\n StringBuilder sb =new StringBuilder();\n int sum=0;\n for(int bit=0;bit<n-1;bit++){\n sb.append((bit+1)+\" \"+(bit+2)+\" \"+0+\"\\n\");\n m++;\n sb.append((bit+1)+\" \"+(bit+2)+\" \"+(1<<bit)+\"\\n\");\n m++;\n if((l&(1<<bit))!=0){\n sb.append((bit+1)+\" \"+n+\" \"+(l-sum-(1<<bit))+\"\\n\");\n sum+=(1<<bit);\n m++;\n }\n }\n System.out.println(n+\" \"+m);\n System.out.print(sb);\n }\n}\n", "l = int(input())\nn = len(bin(l)) - 3\ntmp = 2 ** n\nprint(n + 1, 2 * n + bin(l)[3:].count('1'))\nfor i in range(n):\n print(i+1, i+2, 0)\n print(i+1, i+2, 2 ** i)\n if l & (1<<i):\n print(i+1, n+1, tmp)\n tmp += 2 ** i\n\n", "import sys\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\n# L と 2 ** n の差\nL = ir()\nlength = L.bit_length()\nedges = []\nfor i in range(1, length):\n edges.append((i, i+1, 0))\n edges.append((i, i+1, 2**(i-1)))\n\nfor i in range(length-1):\n if L >> i & 1:\n L -= 2**i\n edges.append((i+1, length, L))\n\nprint(length, len(edges))\nfor e in edges:\n print(*e)\n\n# 56", "l=int(input())\nfor i in range(21):\n if 2 ** i > l:\n n = i\n break\n\nm = (n - 1) * 2\n \ns = l - 2 ** (n - 1)\nvalue = 2 ** (n - 1)\n\npath_add = [0 for i in range(n - 1)]\npath_add_value = [0 for i in range(n - 1)]\n\nfor i in range(n - 1):\n if s >= 2 ** (n - 2 - i) :\n s -= 2 ** (n - 2 - i)\n path_add[-(i + 1)] = 1\n path_add_value[-(i + 1)] = value\n value += 2 ** (n - 2 - i)\n \n#print(path_add)\n#print(path_add_value)\n#print(s) \n \nprint(n, m + sum(path_add))\nfor i in range(n - 1):\n print(i + 1, i + 2, 0)\n print(i + 1, i + 2, 2 ** i)\n \nfor i in range(n - 1):\n if path_add[i] == 1:\n print(i + 1, n, path_add_value[i]) \n ", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int L;\n cin >> L;\n int n2 = 2;\n int keta = 1;\n while (n2 <= L) {\n n2 = n2 * 2;\n keta++;\n }\n vector<bool> t2(keta,false);\n int num1 = -3;\n for (int i=0; i<keta; i++) {\n if (L%2 == 1) {\n t2[keta-1-i] = true;\n num1++;\n }\n L = L/2;\n }\n int maxx = n2/4;\n cout << keta << ' ' << keta * 2 + num1 << endl;\n int i = 1;\n while (maxx != 0) {\n cout << i << ' ' << i+1 << ' ' << maxx << endl;\n cout << i << ' ' << i+1 << ' ' << 0 << endl;\n maxx = maxx/2;\n i++;\n }\n int size = n2/2;\n n2 = size/2;\n for (int i=1; i<keta; i++) {\n if (t2[i]) {\n cout << 1 << ' ' << i+1 << ' ' << size << endl;\n size += n2;\n }\n n2 = n2 / 2;\n }\n}", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int l=sc.nextInt();\n sc.close();\n int n=0, m=0;\n while(l>=(1<<n++));n--;\n StringBuilder sb =new StringBuilder();\n for(int bit=1;bit<n;bit++, m+=2){\n sb.append(bit+\" \"+(bit+1)+\" \"+0+\"\\n\"+bit+\" \"+(bit+1)+\" \"+(1<<(bit-1))+\"\\n\");\n if((l&(1<<(bit-1)))!=0){\n sb.append(bit+\" \"+n+\" \"+(l>>bit<<bit)+\"\\n\");\n m++;\n }\n }\n System.out.println(n+\" \"+m);\n System.out.print(sb);\n }\n}\n", "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static Scanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args){\n\t\t//D\n\t\tint L = sc.nextInt();\n\t\tint N = 0;\n\t\tint M = 0;\n\t\tArrayList<int[]> ans = new ArrayList<>();\n\n\n\t\twhile(1 << N <= L)N++;\n\n\t\tfor(int i = 1; i < N ; i++){\n\t\t\tans.add(new int[]{i,i+1,0});\n\t\t\tans.add(new int[]{i,i+1,1<<(i-1)});\n\t\t}\n\n\t\tint now = (1 << (N-1)) -1;\n\n\t\tfor(int i = N-1 ; i >= 1 ; i--){\n\t\t\tif(now == L-1)break;\n\t\t\tint tmp = 1 << (i-1);\n\t\t\tif(now + tmp <= L-1){\n\t\t\t\tans.add(new int[]{i,N,now+1});\n\t\t\t\tnow += tmp;\n\t\t\t}\n\t\t}\n\n\t\tM = ans.size();\n\n\t\tSystem.out.println(N+\" \"+M);\n\t\tfor(int[] result : ans){\n\t\t\tSystem.out.println(result[0]+\" \"+result[1]+\" \"+result[2]);\n\t\t}\n\t}\n}\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint L = sc.nextInt();\n\t\tsc.close();\n\t\t\n\t\tint r = 1;\n\t\twhile(L/(int)Math.pow(2,(r+1)) > 0) r++;\n\t\t\n\t\tint N = r + 1;\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint cnt = 0;\n\t\tfor(int i=0;i<r;i++) {\n\t\t\tsb.append((i+1) + \" \" + (i+2) + \" \" + 0 + \"\\n\");\n\t\t\tsb.append((i+1) + \" \" + (i+2) + \" \" + (int)Math.pow(2, i) + \"\\n\");\n\t\t\tcnt += 2;\n\t\t}\n\t\t\n\t\tint tmpMax = (int)Math.pow(2,r)-1;\n\t\tint rem = (L-1) - tmpMax;\n\t\t\n\t\tfor(int i=25;i>=0;i--) {\n\t\t\tif(((rem>>i)&1)==1) {\n\t\t\t\tsb.append((i+1) + \" \" + N + \" \" + (tmpMax+1) + \"\\n\");\n\t\t\t\ttmpMax += (1<<i);\n\t\t\t\tcnt ++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(N + \" \" + cnt);\n\t\tSystem.out.println(sb.toString());\n\t}\n}", "import math\n\nL = int(input())\nN = int(math.log2(L))+1\n\nM = 2*(N-1)\n\n# print(N, )\nedges = []\nfor i in range(N-1):\n edges.append('{0} {1} {2}'.format((i+1) , (i+2), 0))\n \nfor i in range(N-1):\n edges.append('{0} {1} {2}'.format((i+1) , (i+2), 2**i))\n\nnode = L-2**(N-1)\nX = 2**(N-1)\n\nwhile node > 0:\n M += 1\n t = int(math.log2(node))+1\n edges.append('{0} {1} {2}'.format(t, N, X))\n node -= 2**(t-1)\n X += 2**(t-1)\n \noutput = \"\"\"{0} {1}\n{2}\"\"\".format(N,M,'\\n'.join(edges))\nprint(output)", "l = int(input())\n\np = 0\nwhile True:\n if 2**p > l:\n p -= 1\n break\n else:\n p += 1\n \nn = p+1\nm = 2*p\nans = []\nfor i in range(1, n):\n ans.append([i, i+1, 0])\n ans.append([i, i+1, 2**(i-1)])\n \nwhile l > 2**p:\n for i in range(n-1, 0, -1):\n if l-2**(i-1) >= 2**p:\n ans.append([i, n, l-2**(i-1)])\n l = l-2**(i-1)\n m += 1\n break\n\nprint(n, m)\nfor a in ans:\n print(' '.join(list(map(str, a))))\n", "#include <bits/stdc++.h>\n\nstruct Edge {\n\tint from, to, distance;\n};\n\nint main()\n{\n\tint l;\n\tscanf(\"%d\", &l);\n\n\tstd::vector<Edge> edges;\n\tint n;\n\tfor (int i = 0; (1 << (i + 1)) <= l; i++)\n\t{\n\t\tedges.push_back((Edge){i, i + 1, 0});\n\t\tedges.push_back((Edge){i, i + 1, 1 << i});\n\t\tn = i + 1;\n\t}\n\tfor (int i = 0; (1 << (i + 1)) <= l; i++)\n\t{\n\t\tif (!((1 << i) & l)) continue;\n\t\tedges.push_back((Edge){i, n, (l & ~((1 << i) - 1) - (1 << i))});\n\t}\n\t\n\tprintf(\"%d %d\\n\", n + 1, edges.size());\n\tfor (auto &e: edges)\n\t{\n\t\tprintf(\"%d %d %d\\n\", e.from + 1, e.to + 1, e.distance);\n\t}\n\n\treturn 0;\n}", "/// referenced: https://beta.atcoder.jp/contests/abc108/submissions/3146147\n#include<bits/stdc++.h>\nusing namespace std;\nvoid print(int u,int v,int w){\n printf(\"%d %d %d\\n\",u,v,w);\n}\nint L;\nint main(){\n cin>>L;\n int n=1,r=0;\n while(2*n<=L){\n n*=2;\n ++r;\n }\n int N=r+1;\n int M=2*r+__builtin_popcount(L-n);\n printf(\"%d %d\\n\",N,M);\n for(int i=0;i<r;++i){\n print(i+1,i+2,0);\n print(i+1,i+2,1<<i);\n }\n for(int t=r-1;L>n;--t){\n if(L-(1<<t)>=n){\n L-=1<<t;\n print(t+1,N,L);\n }\n }\n}\n", "L = int(input())\nN = len(bin(L)[2:])\nM = 0\nLines = []\nfor i in range(N-1):\n M += 2\n Lines.append((i+1,i+2,0))\n Lines.append((i+1,i+2,2**i))\n\ntmp = 2**(N-1)\nfor i,j in enumerate(bin(L)[3:],1):\n if j == '1':\n M += 1\n Lines.append((N-i,N,tmp))\n tmp += 2**(N-i-1)\n\n\n\nprint(N,M)\nfor Line in Lines:\n print(\"{} {} {}\".format(Line[0],Line[1],Line[2]))", "#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int L;\n cin >> L;\n int l = L;\n vector<int> digit;\n while (l) {\n digit.push_back(l%2);\n l >>= 1;\n }\n int size = digit.size();\n printf(\"%d \", size);\n vector<pair<pair<int, int>, int> > edges;\n int length = 1;\n for (int i = 1; i < size; i++) {\n edges.push_back(make_pair(make_pair(i, i+1), 0));\n edges.push_back(make_pair(make_pair(i, i+1), length));\n length *= 2;\n }\n for (int i = 1; i < size; i++) {\n if (digit[size-i-1] == 1) {\n edges.push_back(make_pair(make_pair(size-i, size), length));\n length += 1<<(size-i-1);\n }\n }\n printf(\"%d\\n\", (int)edges.size());\n for (const auto &edge : edges) {\n printf(\"%d %d %d\\n\", edge.first.first, edge.first.second, edge.second);\n }\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nint main() {\n cin.tie(0); ios::sync_with_stdio(false);\n\n int L;\n cin >> L;\n\n int d = 0;\n for (int p = 2; p <= L; p *= 2) ++d;\n\n int sum = pow(2, d), res = L - sum;\n const int n = d + 1, m = 2 * d + __builtin_popcount(res);\n\n cout << n << ' ' << m << '\\n';\n for (int i = 1, p = 1; i < n; ++i) {\n cout << i << ' ' << i + 1 << ' ' << 0 << '\\n';\n cout << i << ' ' << i + 1 << ' ' << p << '\\n';\n p *= 2;\n }\n\n // add edge : (i + 1) -- sum --> (n)\n for (int i = d - 1; 0 <= i; --i) {\n if (res >> i & 1) {\n cout << i + 1 << ' ' << n << ' ' << sum << '\\n';\n sum += pow(2, i);\n }\n }\n\n return 0;\n}\n", "def main():\n L = int(input())\n r = 0\n while 2 ** (r+1) <= L:\n r += 1\n assert r < 20\n N = r + 1\n edges = list()\n for i in range(1, N):\n edges.append((i, i + 1, 0))\n edges.append((i, i + 1, 2**(i - 1)))\n for t in range(N - 1, 0, -1):\n if L - 2**(t - 1) >= 2**r:\n edges.append((t, N, L - 2**(t - 1)))\n L -= 2**(t - 1)\n print('{} {}'.format(N, len(edges)))\n for e in edges:\n print(' '.join(map(str, e)))\n\n\nif __name__ == '__main__':\n main()", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ve vector\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n\nint main(){\n using ti = tuple<int,int,int>;\n int l;\n cin >> l;\n ve<ti> ans;\n int i = 1;\n while(pow(2,i)<=l){\n ans.push_back(ti(i,i+1,pow(2,i-1)));\n ans.push_back(ti(i,i+1,0));\n i++;\n }\n int n = pow(2,i-1);\n while(1){\n int k = l-n;\n int j = 0;\n while(k){\n k /= 2;\n j++;\n }\n if(j == 0)break;\n ans.push_back(ti(j,i,n));\n n += pow(2,j-1);\n }\n sort(ans.begin(), ans.end());\n cout << i<<\" \"<< ans.size() << endl;\n rep(i,ans.size()){\n printf(\"%d %d %d\\n\", get<0>(ans[i]), get<1>(ans[i]), get<2>(ans[i]));\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n \nint L, N = 0;\nvector<vector<int>> edge;\n\nint main(void){\n\t\n\tscanf(\"%d\", &L);\n while(1 << N <= L) ++N;\n \n for(int i = 1; i < N; ++i){\n edge.push_back({i, i + 1, 1 << (i - 1)});\n edge.push_back({i, i + 1, 0});\n }\n\t\n\tint corrent = (1 << (N - 1)) - 1;\n\t\n\tfor(int i = N - 1; i >= 1 && corrent != L - 1; i--){\n\t \n\t int add = 1 << (i - 1);\n\t \n\t if(corrent + add <= L - 1){\n\t edge.push_back({i, N, corrent + 1});\n\t corrent += add;\n\t }\n\t \n\t}\n\t\n\tprintf(\"%d %d\\n\", N, (int)edge.size());\n\tfor(auto i : edge) printf(\"%d %d %d\\n\", i[0], i[1], i[2]);\n\t\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <array>\n#include <set>\n#include <cmath>\n#include <string>\n#include <queue>\n#include <list>\n#include <bitset>\n#include <unordered_map>\n#include <algorithm>\n#include <functional>\n#include <iomanip> // std::std::setprecision(X)\n#include <limits> //std::numeric_limits<int>::max(), min()\n\nint main (void) {\n int L; std::cin >> L;\n\n std::array<bool, 20> k = { false } ;\n int digit = 0, c = 0;\n int tmpL = L;\n while(tmpL) {\n if ( tmpL & 1 ) {\n k[digit] = true;\n c++;\n }\n tmpL >>= 1;\n digit++;\n }\n\n int N = digit;\n int M = (digit-1)*2 + (c-1);\n std::cout << N << \" \" << M << std::endl;\n\n int t = 1;\n for (int i = 1; i < digit; i++) {\n std::cout << i << \" \" << i+1 << \" \" << 0 << std::endl;\n std::cout << i << \" \" << i+1 << \" \" << t << std::endl;\n if (k[i-1] == true) {\n std::cout << i << \" \" << digit << \" \" << L - t << std::endl;\n L -= t;\n }\n t <<= 1;\n }\n\n return 0;\n}", "L = int(input())\nrec = []\nr = 0\nK = L\nwhile K > 1:\n K //= 2\n r += 1\n\nN = r + 1\nfor i in range(1, N):\n rec.append([i, i + 1, 0])\n rec.append([i, i + 1, 2 ** (i - 1)])\n\nfor i in range(N - 1, 0, -1):\n if L - 2 ** (i - 1) >= 2 ** r:\n rec.append([i, N, L - 2 ** (i - 1)])\n L -= 2 ** (i - 1)\n\nrec.sort()\nprint(N, len(rec))\nfor i, j, k in rec:\n print(i, j, k)", "def in_list(l, l_t, a):\n l[a] = l_t\n\n\nans_list = [[] for _ in range(60)]\np = 0\n\nl = int(input())\nbin_str = format(l, '020b')\nfor i in range(20):\n c = 0\n if c == 0 and str(bin_str)[i] == '1':\n c = 1\n n = 20-i\n k = i\n break;\nfor j in range(1, n):\n in_list(ans_list, [j, j+1, 0], p)\n p += 1\n in_list(ans_list, [j, j+1, 2**(n-1-j)], p)\n p += 1\nc = 2**(n-1)\n\nfor m in range(k+1, 20):\n if str(bin_str[m]) == '1':\n in_list(ans_list, [1, n+m-20+1, c], p)\n p += 1\n c += 2 ** (19-m)\n\nprint(n, p)\nfor q in range(p):\n print(ans_list[q][0], ans_list[q][1], ans_list[q][2])", "#include<bits/stdc++.h>\nusing namespace std;\nvector<int> g[21],d[21];\nvoid solve(int x,int l){\n\tif(x==1)return;\n\tif(l&1)g[1].push_back(x),d[1].push_back(l-1);\n\tif(l/2==0)return;\n\tg[x-1].push_back(x);\n\tg[x-1].push_back(x);\n\td[x-1].push_back(0);\n\td[x-1].push_back(l/2);\n\tsolve(x-1,l/2);\n}\nint main(){\n\tint l;\n\tscanf(\"%d\",&l);\n\tsolve(20,l);\n\tint num=0;\n\tfor(int i=1;i<21;i++)num+=g[i].size();\n\tprintf(\"20 %d\\n\",num);\n\tfor(int i=1;i<=20;i++){\n\t\tfor(int j=0;j<g[i].size();j++){\n\t\t\tprintf(\"%d %d %d\\n\",i,g[i][j],d[i][j]);\n\t\t}\n\t}\n}", "L=int(input())\nl=0\npp=0\ntmp=L\nwhile tmp>0:l+=1;pp+=tmp%2;tmp//=2\nprint(l,l*2-3+pp)\nfor i in range(1,l):\n print(i,i+1,0)\n a=1<<(i-1)\n print(i,i+1,a)\n if L&a:L-=a;print(i,l,L)", "#include <bits/stdc++.h>\nusing namespace std;\nint N;\nint cnt;\nvector<tuple<int,int,int>>vt;\n\nint main(){\n cin>>N;\n int l = floor(log2(N));\n int high = 1<<l;\n int x=1;\n while(high/=2){\n vt.push_back(make_tuple(x,x+1,0));\n vt.push_back(make_tuple(x,x+1,high));\n x++;\n }\n high = 1<<l;\n int cur = high;\n x=2;\n while(high/=2){\n if(cur+high<=N){\n vt.push_back(make_tuple(1,x,cur)); \n cur+=high;\n }\n x++;\n }\n cout<<l + 1<<' '<<vt.size()<<'\\n';\n for(auto& tp:vt){\n cout<<get<0>(tp)<<' ';\n cout<<get<1>(tp)<<' ';\n cout<<get<2>(tp)<<'\\n';\n }\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing Vi = vector<int>;\nusing Vl = vector<ll>;\nusing Pii = pair<int, int>;\nusing Pll = pair<ll, ll>;\n\nconstexpr int I_INF = INT_MAX;\nconstexpr ll L_INF = LLONG_MAX;\n\n//===\n\n\n\n\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint L; cin >> L;\n\t\n\tint r = 0;\n\twhile (L >= (1 << r)) ++r;\n\t--r;\n\n\tvector<pair<Pii, int>> edges;\n\tfor (int i = 0; i < r; ++i) {\n\t\tedges.emplace_back(make_pair(i + 1, i + 2), 0);\n\t\tedges.emplace_back(make_pair(i + 1, i + 2), (1 << i));\n\t}\n\n\tint R = (1 << r);\n\tfor (int i = r - 1; i >= 0; --i) {\n\t\tint s = L - (1 << i);\n\t\tif (s >= R) {\n\t\t\tedges.emplace_back(make_pair(i + 1, r + 1), s);\n\t\t\tL = s;\n\t\t}\n\t}\n\n\tcout << r + 1 << \" \" << edges.size() << \"\\n\";\n\tfor (const auto& e : edges) {\n\t\tcout << e.first.first << \" \" << e.first.second << \" \" << e.second << \"\\n\";\n\t}\n\n\treturn 0;\n}", "# D - All Your Paths are Different Lengths\n\nL = int(input())\n\nN = 2\nwhile 2**N-1 <= L-1:\n N += 1\n\nedge = []\nfor i in range(1,N):\n edge.append([i,i+1,0])\n edge.append([i,i+1,2**(i-1)])\n\nfor i in reversed(range(1,N)):\n if L - 2**(i-1) > 2**(N-1) - 1:\n edge.append([i,N,L-2**(i-1)])\n L = L-2**(i-1)\n\nprint(N, len(edge))\nfor x in edge:\n print(*x)", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int l = in.readInt();\n\n int n = Integer.toBinaryString(l).length();\n int m = (n - 1) * 2 + Integer.bitCount(l) - 1;\n\n out.printLine(n, m);\n\n int pow2 = 1;\n for (int i = 1; i < n; i++) {\n out.printLine(i, i + 1, 0);\n out.printLine(i, i + 1, pow2);\n if (((l >> (i - 1)) & 1) == 1) {\n out.printLine(i, n, l & (-1 << i));\n }\n pow2 <<= 1;\n }\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n }\n}\n\n", "#include<bits/stdc++.h>\nint L,M,N,c,i;\nint main(){\n scanf(\"%d\",&L);\n N=floor(log2(L))+1;\n M=(N-1)*2+__builtin_popcount(L-(1<<(N-1)));\n printf(\"%d %d\\n\",N,M);\n for(i=1;i<N;i++)printf(\"%d %d %d\\n%d %d %d\\n\",i,i+1,0,i,i+1,1<<(i-1));\n c=1<<(N-1);\n for(i=N-2;i>=0;i--)if(L&(1<<i))printf(\"%d %d %d\\n\",i+1,N,c),c+=1<<i;\n}\n", "import java.util.Scanner;\n \npublic class Main {\n \n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint n = 1, m = 0;\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile((1<<n-1)-1<l) n++;\n\t\tn--;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tsb.append(Convert(i,i+1,0));\n\t\t\tsb.append(Convert(i,i+1,1<<i-1));\n\t\t\tm += 2;\n\t\t}\n\t\tint max = (1<<n-1)-1;\n\t\twhile(l-max>1) {\n\t\t\tint k = 1;\n\t\t\twhile((1<<k-1)<l-max) k++;\n\t\t\tk--;\n\t\t\tsb.append(Convert(k, n, max+1));\n\t\t\tm++;\n\t\t\tmax += (1<<k-1);\n\t\t}\n\t\tSystem.out.printf(\"%d %d\\n\",n,m);\n\t\tSystem.out.println(new String(sb));\n\t\tsc.close();\n\t}\n\tpublic static String Convert(int a, int b, int c) {\n\t\treturn String.valueOf(a)+' '+String.valueOf(b)+' '+String.valueOf(c)+\"\\n\";\n\t}\n}", "L = int(input())\nfor i in range(20):\n if 2**i > L: N = i; break\nelse: N = 20\nM = N*2-2\nadd_path = []\nfor i in range(1,N)[::-1]:\n if L-2**(i-1) >= 2**(N-1): add_path.append([i, L-2**(i-1)]); L -= 2**(i-1)\nprint(N, M+len(add_path))\nfor i in range(1,N):\n print(i, i+1, 0); print(i, i+1, 2**(i-1))\nfor i in add_path:\n print(i[0], N, i[1])\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint L; cin >> L;\n\tint l[30], g[30], ToLast[30];\n\tint n=0, m=0;\n\t--L;\n\twhile(L>0){\n\t ToLast[n]=L%2;\n\t l[n]=1-L%2;\n\t g[n]=1+L/2;\n\t L=(L+1)/2 - 1;\n\t m += 3-ToLast[n];\n\t ++n;\n\t}\n\tcout << n+1 << ' ' << m << endl;\n\tfor(int i=0; i<n; ++i){\n\t cout << i+1 << ' ' << i+2 << ' ' << l[i] << endl;\n\t cout << i+1 << ' ' << i+2 << ' ' << g[i] << endl;\n\t if(ToLast[i]==0) cout << i+1 << ' ' << n+1 << ' ' << 0 << endl;\n\t}\n\treturn 0;\n}\n", "l = int(input())\ns = bin(l)[2:]\nn = len(s)\nm = 0\nans = []\nfor i in range(n-1):\n ans.append([i+1, i+2, 0])\n ans.append([i+1, i+2, 2**(n-2-i)])\n m += 2\nimp = 2**(n-1)\nfor i in range(n-1, 0, -1):\n if s[i] == '1':\n ans.append([1, i+1, imp])\n m += 1\n imp += 2 ** (n-1-i)\nprint(n, m)\nfor x in ans:\n print(' '.join(list(map(str, x))))", "import java.util.Scanner;\nimport java.util.stream.IntStream;\n\n/**\n * 解説通りに作成したソースコード\n */\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint l = scanner.nextInt(), r = 0;\n\t\t\twhile ((1 << (r + 1)) <= l) {\n\t\t\t\tr++;\n\t\t\t}\n\t\t\tint n = r + 1, count = 2 * r;\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor (int i = r; i >= 1; i--) {\n\t\t\t\t// System.out.println(\"l=\" + l + \", r=\" + r + \", i=\" + i);\n\t\t\t\tif ((l - (1 << (i - 1))) >= (1 << r)) {\n\t\t\t\t\tl -= 1 << (i - 1);\n\t\t\t\t\tsb.append(i + \" \" + n + \" \" + l).append(\"\\n\");\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(n + \" \" + count);\n\t\t\tIntStream.rangeClosed(1, r).forEach(i -> {\n\t\t\t\tSystem.out.println(i + \" \" + (i + 1) + \" 0\");\n\t\t\t\tSystem.out.println(i + \" \" + (i + 1) + \" \" + (1 << (i - 1)));\n\t\t\t});\n\t\t\tSystem.out.print(sb.toString());\n\t\t}\n\t}\n}\n", "l = int(input())\nl -= 1\nto = [[] for _ in range(14)]\nfor i in range(1, 13):\n to[i].append((i + 1, 0 * 3 ** (12 - i)))\n to[i].append((i + 1, 1 * 3 ** (12 - i)))\n to[i].append((i + 1, 2 * 3 ** (12 - i)))\nd = []\nl_upto = []\nt = l\ns = 0\nfor i in range(13):\n d.append(t % 3)\n s += (t % 3) * 3 ** i\n l_upto.append(s)\n t //= 3\n\nfor i, t in enumerate(d):\n for s in range(t + (i == 0)):\n to[0].append((13 - i, l - l_upto[i] + 3 ** i * s))\nprint(14, sum(map(len, to)))\nfor i in range(len(to)):\n for j, cost in to[i]:\n print(i + 1, j + 1, cost)\n\n", "import sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda :sys.stdin.readline().rstrip()\ndef iterate(L,n,m,edges,mode):\n # L -> L+1\n if(mode&1 or L==1):\n edges+=[(1,n,L)]\n return L+1,n,m+1,edges\n # L -> 2*L\n else:\n edges=[(u,v,2*w) for u,v,w in edges]\n edges+=[(n,n+1,0),(n,n+1,1)]\n return 2*L,n+1,m+2,edges\n \ndef resolve():\n L=int(input())\n res=[L%2]\n while(L!=1):\n if(L&1): L-=1\n else: L//=2\n res.append(L%2)\n res.reverse()\n\n # initialize\n L=1\n n=2\n m=1\n edges=[(1,2,0)]\n\n # iterate\n for mode in res[1:]:\n L,n,m,edges=iterate(L,n,m,edges,mode)\n\n # output\n print(n,m)\n for e in edges:\n print(*e)\nresolve()", "L = int(input())\nans = []\nfor i in range(1,19):\n ans.append((i,i+1,0))\n ans.append((i,i+1,2**(i-1)))\ncur = 0\nflag = True\nfor i in range(20)[::-1]:\n if L >> i & 1:\n if flag:\n for _ in range(2):\n ans.append((i,20,cur))\n cur += 1 << (i-1)\n else:\n ans.append((i+1,20,cur))\n cur += 1 << i\n else:\n flag = False\nprint(20,len(ans))\nfor tpl in ans:\n print(*tpl)\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint num_digits(int i) {\n int n = 0;\n while (i > 0) {\n i /= 2;\n n++;\n }\n return n;\n}\n\nint main() {\n int L;\n cin >> L;\n int N = num_digits(L);\n int M = 0;\n vector<vector<pair<int, int>>> E(N, vector<pair<int, int>>());\n for (int i = 0; i < N - 1; i++) {\n int d = pow(2, i);\n E[i].push_back({i + 1, 0});\n E[i].push_back({i + 1, d});\n M += 2;\n }\n for (int i = 0; i < N - 1; i++) {\n if (L & (1 << i)) {\n int d = (L >> (i + 1)) << (i + 1);\n E[i].push_back({N - 1, d});\n M++;\n }\n }\n cout << N << \" \" << M << endl;\n for (int i = 0; i < N; i++) {\n for (auto e : E[i]) {\n cout << i + 1 << \" \" << e.first + 1 << \" \" << e.second << endl;\n }\n }\n\n return 0;\n}\n/* vim:set fdm=marker: */\n", "#include <bits/stdc++.h>\n\n#define rep(i, n) for(int i = 0; i<(n); i++)\n#define chmax(x, y) x = max(x, y)\n#define chmin(x, y) x = min(x, y)\nusing namespace std;\n\nconst int MOD = 1000000007;\n\nstruct Edge {\n int from;\n int to;\n long long cost;\n};\n\nvector<Edge> ans;\n\nvoid bypass(int add, int L) {\n if (L <= 0) return;\n\n for (int k = 19; k >= 0; --k) {\n if (L >= (1 << k)) {\n ans.push_back({k + 1, 20, add});\n bypass(add + (1 << k), L - (1 << k));\n break;\n }\n }\n}\n\nint main() {\n int L;\n cin >> L;\n\n for (int i = 1; i < 20; i++) ans.push_back({i, i + 1, 0});\n\n for (int k = 19; k >= 1; k--) {\n if (L >= (1 << k)) {\n for (int i = 1; i <= k; i++) {\n ans.push_back({i, i + 1, 1 << (i - 1)});\n }\n\n bypass(1 << k, L - (1 << k));\n break;\n }\n }\n\n cout << 20 << \" \" << ans.size() << endl;\n for (auto e : ans) {\n cout << e.from << \" \" << e.to << \" \" << e.cost << endl;\n }\n}", "#include <stdio.h>\n\nint main()\n{\n\tint L, N = 2, M, i = 4, rem = 0, sum = 0;\n\tscanf(\"%d\", &L);\n\n\twhile (L >= i)\n\t\ti <<= 1, N++;\n\tM = 2 * (N-1), i >>= 1;\n\tif (L != i) {\n\t\trem = i = L - i;\n\t\twhile (i)\n\t\t\tM += (i&1), i >>= 1;\n\t}\n\tprintf(\"%d %d\\n\", N, M);\n\n\tfor (i = 1; i < N; i++) {\n\t\tprintf(\"%d %d 0\\n\", i, i+1);\n\t\tprintf(\"%d %d %d\\n\", i, i+1, 1 << (N-1-i));\n\t}\n\t\n\tif (rem) {\n\t\tfor (i = 0; i < N-1; i++)\n\t\t\tif (rem & (1<<i)) {\n\t\t\t\tsum += 1<<i;\n\t\t\t\tprintf(\"1 %d %d\\n\", N-i, L-sum);\n\t\t\t}\n\t}\n\n\treturn 0;\n}", "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\npublic final class Main {\n\n public static void main(String[] args) {\n final FastScanner fs = new FastScanner();\n int l = fs.nextInt();\n int idx = 0;\n final int h = (int) (Math.log(l) / Math.log(2));\n final int[][] edges = new int[60][3];\n for (int i = 0; i < h; i++) {\n final int j = i + 1;\n edges[idx++] = new int[] { i, j, 0 };\n edges[idx++] = new int[] { i, j, 1 << i };\n }\n for (int i = 0; i < h; i++) {\n if ((l & 1 << i) != 0) {\n l ^= 1 << i;\n edges[idx++] = new int[] { i, h, l };\n }\n }\n System.out.println(h + 1 + \" \" + idx);\n for (int i = 0; i < idx; i++) {\n final int u = edges[i][0] + 1;\n final int v = edges[i][1] + 1;\n final int w = edges[i][2];\n System.out.println(u + \" \" + v + ' ' + w);\n }\n }\n\n static final class Util {\n public static void shuffleSort(int[] x) {\n shuffle(x);\n Arrays.sort(x);\n }\n\n public static void shuffleSort(long[] x) {\n shuffle(x);\n Arrays.sort(x);\n }\n\n public static void shuffle(int[] x) {\n final Random r = new Random();\n\n for (int i = 0; i <= x.length - 2; i++) {\n final int j = i + r.nextInt(x.length - i);\n swap(x, i, j);\n }\n }\n\n public static void shuffle(long[] x) {\n final Random r = new Random();\n\n for (int i = 0; i <= x.length - 2; i++) {\n final int j = i + r.nextInt(x.length - i);\n swap(x, i, j);\n }\n }\n\n public static void swap(int[] x, int i, int j) {\n final int t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n public static void swap(long[] x, int i, int j) {\n final long t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n private Util() {}\n }\n\n static class FastScanner {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n private String next() {\n while (!st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n //noinspection CallToPrintStackTrace\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n int[] nextIntArray(int n) {\n final int[] a = new int[n];\n for (int i = 0; i < n; i++) { a[i] = nextInt(); }\n return a;\n }\n\n long[] nextLongArray(int n) {\n final long[] a = new long[n];\n for (int i = 0; i < n; i++) { a[i] = nextLong(); }\n return a;\n }\n }\n}\n", "#include<iostream>\n#include<vector>\n#include<utility>\n#include<algorithm>\n#include<stack>\n#include<set>\nusing namespace std ;\nusing ll = long long ;\nusing vll = vector<ll> ;\nusing vvll = vector<vll> ;\nusing pll = pair<ll,ll> ;\nll INF = 1e15 ;\nvoid chmin(ll &a,ll b){if(a>b) a = b ;}\nvoid chmax(ll &a,ll b){if(a<b) a = b ;}\nvoid YorN(bool a){cout << (a?\"YES\":\"NO\") << \"\\n\" ;}\n\nint main(){\n\tll l ; cin >> l ;\n\tll a = 0 ;\n\tll sub = 1 ;\n\twhile(sub<=l){\n\t\ta++ ;\n\t\tsub *= 2 ;\n\t}\n\ta-- ;\n\tll n = a+1 ;\n\tll m = 2*a ;\n\tfor(int i=0;i<a;i++) if(l>>i&1) m++ ;\n\tvector<vector<pll>> g(n) ;\n\tfor(int i=0;i<n-1;i++){\n\t\tg[n-2-i].emplace_back(n-1-i,0) ;\n\t\tg[n-2-i].emplace_back(n-1-i,1<<i) ;\n\t}\n\ta = 1<<n-1 ;\n\tfor(int i=n-2;i>=0;i--){\n\t\tif(l>>i&1){\n\t\t\tg[0].emplace_back(n-1-i,a) ;\n\t\t\ta += 1<<i ;\n\t\t}\n\t}\n\tcout << n << \" \" << m << endl ;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<g[i].size();j++){\n\t\t\tcout<< i+1 << \" \" << g[i][j].first+1 << \" \" << g[i][j].second << endl ; \n\t\t}\n\t}\n}", "#include <cstdio>\nusing namespace std;\nint is_ok[20];\nint main(int argc, char const *argv[])\n{\n\tint l;\n\tscanf(\"%d\",&l);\n\tint now = l;\n\tint cnt = 0,cur = 0;\n\twhile(l)\n\t{\n\t\tif(l & 1)\n\t\t{\n\t\t\tis_ok[cnt] = 1;\n\t\t\tcur++;\n\t\t}\n\t\tl >>= 1;\n\t\tcnt++;\n\t}\n\tprintf(\"%d %d\\n\",cnt,(cnt - 1) * 2 + cur - 1);\n\tint t = 1;\n\tl = now;\n\tfor(int i = 1;i < cnt; ++i)\n\t{\n\t\tprintf(\"%d %d %d\\n%d %d %d\\n\",i,i + 1,0,i,i + 1,t);\n\t\tif(is_ok[i - 1])\n\t\t{\n\t\t\tprintf(\"%d %d %d\\n\",i,cnt,l - t);\n\t\t\tl -= t;\n\t\t}\n\t\tt <<= 1;\n\t}\n\treturn 0;\n}", "def d_all_your_paths_are_different_lengths(L):\n do = []\n while L > 2:\n if L % 2 == 0:\n do.append('*2')\n L >>= 1\n else:\n do.append('+1')\n L -= 1\n do.reverse()\n\n vertex = 2\n l = 2\n edge = [[1, 2, 0], [1, 2, 1]]\n for op in do:\n if op == '*2':\n edge = [[v1, v2, c * 2] for v1, v2, c in edge]\n edge.append([vertex, vertex + 1, 0])\n edge.append([vertex, vertex + 1, 1])\n vertex += 1\n l *= 2\n elif op == '+1':\n edge.append([1, vertex, l])\n l += 1\n\n ans = '{} {}\\n'.format(vertex, len(edge))\n ans += '\\n'.join([' '.join(map(str, row)) for row in edge])\n return ans\n\nL = int(input())\nprint(d_all_your_paths_are_different_lengths(L))\n", "#include<iostream>\n#include<math.h>\n#include<vector>\n\nusing namespace std;\n\nint main() {\n\tint L;\n\tcin >> L;\n\n\tint r = 0;\n\tint i = L;\n\twhile(i != 1) {\n\t\ti /= 2;\n\t\tr += 1;\n\t}\n\n\tint N = r + 1;\n\tvector<vector<int>> result;\n\tvector<int> hen(3, 0);\n\tfor(int i = 1; i < N; i++) {\n\t\then[0] = i; hen[1] = i + 1; hen[2] = 0;\n\t\tresult.push_back(hen);\n\t\then[2] = (int)pow(2, (double)i-1);\n\t\tresult.push_back(hen);\n\t}\n\n\tfor(int i = r; i > 0; i--) {\n\t\tif(L - pow(2, (double)r) >= pow(2, (double)i-1)){\n\t\t\tL -= pow(2, (double)i-1);\n\t\t\then[0] = i; hen[1] = N; hen[2] = L;\n\t\t\tresult.push_back(hen);\n\t\t}\n\t}\n\n\tcout << N << \" \" << result.size() << endl;\n\tfor(int i = 0; i < result.size(); i++)\n\t\tcout << result[i][0] << \" \" << result[i][1] << \" \" << result[i][2] << endl;\n\n\treturn 0;\n}", "\nL = int(input())\n\ndigit = L.bit_length() # 必要なビット数(頂点数)\n\nif 2**digit > L :\n digit -= 1\n\nans = []\nfor i in range(1, digit+1) :\n ans.append([i, i+1, 0])\n ans.append([i, i+1, 2**(i-1)])\n\nL = L - 2**digit # 残り本数\n\ntmp = 0\nfor i in range(digit, 0, -1) :\n if L - 2**(i - 1) >= 0 :\n ans.append([i, digit+1, 2**digit + tmp])\n L -= 2**(i - 1)\n tmp += 2**(i - 1)\n\nprint(digit+1, len(ans))\nfor a in ans :\n print(*a)", "import math\n\nL = int(input())\n\nN = math.floor(math.log2(L)) + 1\n\nedge = []\nfor i in range(N - 1):\n edge.append((i + 1, i + 2, 0))\n edge.append((i + 1, i + 2, (1 << i)))\n\nfor i in range(N - 1, 0, -1):\n if L - (1 << (i - 1)) >= 2 ** (N - 1):\n edge.append((i, N, L - (1 << (i - 1))))\n L -= (1 << (i - 1))\n\nprint(N, len(edge))\nfor e in edge:\n print(str(e).lstrip('(').rstrip(')').replace(',', ''))", "import java.io.IOException;\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\nimport java.io.PrintWriter;\n\nimport java.util.Arrays;\nimport java.util.ArrayList;\n\nclass Edge implements Comparable<Edge> {\n // 頂点番号 最小コスト\n int to;\n int cost;\n\n Edge(int to, int cost) {\n this.to = to;\n this.cost = cost;\n }\n\n // x.compereTo(y)\n // x は cost\n // y は Edge.cost\n @Override\n public int compareTo(Edge edge) {\n return this.cost - edge.cost;\n }\n}\n\n@SuppressWarnings(\"unchecked\")\npublic class Main {\n static final String sp = \" \";\n\n public static void main(String[] args) throws IOException {\n final String s;\n\n try (\n BufferedReader reader = new BufferedReader(\n new InputStreamReader(System.in))) {\n s = reader.readLine();\n }\n\n PrintWriter out = new PrintWriter(System.out);\n\n int L = Integer.parseInt(s);\n\n // log 2\n int r = (int)Math.floor(Math.log(L) / Math.log(2.0));\n\n int N = r + 1;\n\n ArrayList<Edge>[] routeList = new ArrayList[N];\n\n for (int i = 0; i < N; i++) routeList[i] = new ArrayList<>();\n\n int cnt = 0;\n\n // t = {0, 1, …, N - 1}\n // 頂点 t + 1 から t + 2 へ\n // コスト 2^t と 0 の辺を張る\n for (int t = 0; t < N - 1; t++) {\n // 0-indexed\n routeList[t].add(new Edge(t + 1, (int)Math.pow(2,t)));\n routeList[t].add(new Edge(t + 1, 0));\n cnt++;\n cnt++;\n }\n\n // t = {N - 1, N - 2, …, 1}\n // 2^r <= L - 2^(t-1) 満たすなら\n // 頂点 t から 頂点 N に対してコスト L - 2^(t-1) の辺を張る\n // L から 2^(t-1)を引く\n for (int t = N - 1; 0 < t; t--) {\n int num1 = (int)Math.pow(2, r);\n\n int num2 = (int)Math.pow(2, t - 1);\n if (num1 - 1 < L - num2) {\n // 0-indexed\n routeList[t - 1].add(new Edge(N - 1, L - num2));\n cnt++;\n L -= num2;\n }\n }\n\n // 頂点の数 辺の数\n out.println(N + sp + cnt);\n for (int i = 0; i < N; i++) {\n for (Edge e : routeList[i]) {\n // 0-indexed\n Integer from = i + 1;\n int to = e.to + 1;\n int cost = e.cost;\n out.println(from + sp + to + sp + cost);\n }\n }\n\n out.flush();\n }\n}\n", "import math\nL=int(input())\n\nN=int(math.log(L,2))\n\nprint(N+1,bin(L)[3:].count(\"1\")+2*N)\n\n\nfor i in range(1,N+1):\n print(i,i+1,0)\n print( i, i+1 , 2**(i-1) )\n\n\ntmp=2**N\nfor i in range(N,0,-1):\n if tmp+2**(i-1)-1<=L-1:\n print(i,N+1,tmp)\n tmp=tmp+2**(i-1)", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\n#define REP(i, n) for(int i = 0; i < (int)(n); ++i)\n#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)\n\nstruct edge{ int to, cost; };\n\nint main()\n{\n int L;\n cin >> L;\n\n // グラフの構築の問題では X -> X+1 と X -> 2X の作り方を具体的に導くのが大事\n // 2^r <= L なる最大の r を求める\n int tmp = L, r = 0;\n while(tmp > 1){ \n tmp /= 2;\n ++r;\n }\n\n int N = r+1, M = 0;\n vector<vector<edge>> G(N);\n // i -> i+1 に 0 と 2^i の辺を張ることで\n // 0 ~ 2^r-1 までの経路を作れる\n REP(i, N-1){\n G[i].push_back({i+1, 0});\n G[i].push_back({i+1, (int) pow(2, i)});\n M += 2;\n }\n\n // 残りの辺を張る\n for(int i = N-2; i >= 0; --i){\n int length = L - pow(2, i);\n if( length >= pow(2, r)){\n G[i].push_back({N-1, length});\n L -= pow(2, i);\n ++M;\n }\n }\n\n cout << N << \" \" << M << endl;\n REP(i, N){\n for(auto e: G[i]) cout << i+1 << \" \" << e.to+1 << \" \" << e.cost << endl;\n }\n\n return 0;\n}", "/*\nID: jerrywcy\nTASK: AtCoder ABC 108 Problem D\nLINK: https://abc108.contest.atcoder.jp/tasks/abc108_d\nLANG: C++\n*/\n#include <bits/stdc++.h>\n \nusing namespace std;\n\nint l;\nbool te[20];\n \nint main() {\n int i,j;\n cin>>l;\n \n int tl=l;\n int dl=0;\n int ce=0;\n while (tl){\n \tif (tl&1){\n \t\tte[dl]=1;\n \t\tce++;\n\t\t}\n\t\ttl>>=1;\n\t\tdl++;\n\t}\n\t\n\tcout<<dl<<' '<<(dl-1)*2+ce-1<<endl;\n\t\n\tlong long t=1;\n\tfor (i=1;i<dl;i++){\n\t\tcout<<i<<' '<<i+1<<' '<<0<<endl;\n\t\tcout<<i<<' '<<i+1<<' '<<t<<endl;\n\t\tif (te[i-1]){\n\t\t\tcout<<i<<' '<<dl<<' '<<l-t<<endl;\n\t\t\tl-=t;\n\t\t}\n\t\tt<<=1;\n\t}\n \n return 0;\n}", "import sys\nfrom math import log2, floor\n\nL = int(sys.stdin.readline().rstrip())\n\ndef main():\n n = floor(log2(L)) + 1\n m = 2 * (n - 1)\n edges = []\n for i in range(1, n):\n edges.append((i, i+1, 0))\n edges.append((i, i+1, 2**(i-1)))\n \n cur = 2 ** (n - 1)\n q = L - cur\n for i in range(1, n):\n q, r = divmod(q, 2)\n if not r:\n continue\n else:\n edges.append((i, n, cur))\n cur += 2 ** (i - 1)\n m += 1\n \n yield (n, m)\n for e in edges:\n yield e\n\nif __name__ == '__main__':\n ans = main()\n for i in ans:\n print(*i, sep=' ')", "#include <cstdio>\n\ninline int readin(){\n\tint x=0,c;\n\tfor (;(c=getchar())<'0'||c>'9';);\n\tfor (;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+c-48;\n\treturn x;\n}\n\nint main(){\n\tint L=readin();\n\tint min=233,ans=0;\n\tfor (int i=0;i<20;i++) if ((1<<i)&L) min=i,ans++;\n\tans+=min*2;\n\tif (min==19) ans--;\n\tprintf(\"20 %d\\n\",ans);\n\tfor (int i=1;i<=min;i++) printf(\"%d %d %d\\n%d %d %d\\n\",i,i+1,0,i,i+1,1<<(i-1));\n\tint x=min==19?524288:0;\n\tfor (int i=0;i<19;i++) if ((1<<i)&L) printf(\"%d %d %d\\n\",i+1,20,x),x+=1<<i;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define all(x) (x).begin(),(x).end()\n#define foreach(u,v) for(auto (u) : (v))\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll, ll> pll;\ntypedef vector<ll> vl;\n\nconst int inf = 1e9;\nconst ll linf = 1LL<<60;\nconst ll mod = 1e9 + 7;\nconst double eps = 1e-9;\n\n/*\n*/\n\nint main()\n{\n int L;\n cin >> L;\n\n int n = 0, pow = 1;\n while(pow <= L) pow *= 2, n++;\n\n vector<tuple<int, int, int>> ans;\n rep(i, n-1){\n ans.pb(mt(i+1, i+2, 0));\n ans.pb(mt(i+1, i+2, 1<<i));\n }\n\n int cur = 1<<(n-1);\n for(int i = n-2; i >= 0; i--){\n if(L & 1<<i){\n ans.pb(mt(i+1, n, cur));\n cur += (1<<i);\n }\n }\n\n printf(\"%d %d\\n\", n, (int)ans.size());\n for(auto u : ans){\n int a, b, c;\n tie(a, b, c) = u;\n printf(\"%d %d %d\\n\", a, b, c);\n }\n\n return 0;\n}\n", "from math import log2\n\nL = int(input())\nn = int(log2(L))\nprint(n + 1, format(L, \"b\").count(\"1\") - 1 + 2 * n)\nLi = 1\nfor i in range(n):\n print(i + 1, i + 2, 0)\n print(i + 1, i + 2, Li)\n Li *= 2\nmask = 2\nfor i in range(n):\n if L >> i & 1:\n print(i + 1, n + 1, L - (L & mask - 1))\n mask *= 2\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)\n#define rrep(i,s,e) for(int (i) = (s);(i) >= (e);(i)--)\n\nvector<int> u;\nvector<int> v;\nvector<int> w;\n\n\nsigned main() {\n int l;cin>>l;\n int tmp = l;\n int cnt = 0;\n int cost = 1;\n while(tmp/2)\n {\n tmp/=2;\n cnt++;\n u.push_back(cnt);\n v.push_back(cnt+1);\n w.push_back(0);\n u.push_back(cnt);\n v.push_back(cnt+1);\n w.push_back(cost);\n cost *= 2;\n }\n int endN = cnt+1;\n cnt = 0;\n l -= cost;\n\n while(l){\n tmp = l;\n cnt = 0;\n while(tmp/2)\n {\n tmp/=2;\n cnt++;\n }\n u.push_back(cnt+1);\n v.push_back(endN);\n w.push_back(cost);\n int a=1;\n rep(i,0,cnt-1) a*=2;\n cost += a;\n l -= a;\n }\n\n cout << endN << \" \" << u.size() << endl;\n\n rep(i,0,u.size()-1) cout << u[i] <<\" \"<<v[i]<<\" \"<<w[i]<<endl;\n}\n", "#include<bits/stdc++.h>\nint L,M,N,r,c;\nint main(){\n scanf(\"%d\",&L);\n N=floor(log2(L))+1;\n r=L-(1<<(N-1));\n M=(N-1)*2+__builtin_popcount(r);\n c=1<<(N-1);\n printf(\"%d %d\\n\",N,M);\n for(int i=1;i<N;i++)printf(\"%d %d %d\\n%d %d %d\\n\",i,i+1,0,i,i+1,1<<(i-1));\n for(int i=N-2;i>=0;i--)if(L&(1<<i))printf(\"%d %d %d\\n\",i+1,N,c),c+=1<<i;\n}\n", "import sys\ninput = sys.stdin.readline\n\nL = int(input())\nans = [[1,2,0],[1,2,1]]#L=2の答え\nS=1\nT=2\ndef recursion(x):\n global T\n if x == 2:\n return\n \n if x%2==1:\n recursion(x-1)\n ans.append([S,T,x-1])\n \n else:\n recursion(x//2)\n for i in range(len(ans)):\n ans[i][2] = 2*ans[i][2]\n T += 1\n ans.append([T-1,T,0])\n ans.append([T-1,T,1])\n return\n\nrecursion(L)\nprint(T,len(ans))\nfor i,j,k in ans:\n print(i,j,k)\n \n\n\n", "#include <iostream>\n#include <vector>\n#include <array>\n\nusing namespace std;\ntypedef long long ll;\n\nll num_bits(ll x){\n ll ret = 0;\n for(ret = 0; x > 0; ret++, x /= 2){}\n return ret;\n}\n\nint main(){\n ll l;\n cin >> l;\n ll k = num_bits(l);\n const ll n = k;\n vector<array<ll, 3>> edges;\n for(ll i = 1; i < k; ++i){\n edges.push_back({i, i + 1, 1 << (i - 1)});\n edges.push_back({i, i + 1, 0});\n }\n ll shift = 1 << (k - 1);\n l -= shift;\n while(l > 0){\n k = num_bits(l);\n edges.push_back({k, n, shift});\n l -= (1 << (k - 1));\n shift += 1 << (k - 1);\n }\n\n cout << n << ' ' << edges.size() << endl;\n for(int i = 0; i < edges.size(); ++i){\n cout << edges.at(i).at(0) << ' ' << edges.at(i).at(1) << ' '\n << edges.at(i).at(2) << endl;\n }\n return 0;\n}\n", "L = int(input())\n\nN = L.bit_length()\n\nE = []\nfor i in range(1, N):\n E.append((i, i + 1, 0))\n E.append((i, i + 1, 2 ** (i - 1)))\n\ns = 2 ** (N - 1)\nfor i in reversed(range(N - 1)):\n if (L >> i) & 1:\n E.append((i + 1, N, s))\n s += 2 ** i\n\nprint(N, len(E))\nfor a, b, c in E:\n print(a, b, c)\n", "import math\nl=int(input())\nn=math.floor(math.log2(l))\nedge=[]\nfor i in range(n):\n edge.append((i+1,i+2,0))\n edge.append((i+1,i+2,2**i))\ni=n-1\nwhile l>2**n:\n m=l-2**i\n if m>=2**n:\n edge.append((i+1,n+1,m))\n l=m\n i-=1\nprint(n+1,len(edge))\nfor a,b,c in edge:\n print(a,b,c)\n", "L = int(input())\nv = list(map(int,bin(L)[:2:-1]))\nN = len(v)+1\nedges = []\nunit = 1\nfor i in range(N-1):\n L -= unit*v[i]\n edges.append((i+1, i+2, 0))\n edges.append((i+1, i+2, unit))\n if v[i]:\n edges.append((i+1, N, L))\n unit *= 2\n\nprint(N, len(edges))\nfor a, b, c in edges:\n print(a, b, c)", "L = int(input())\nr = 0\nwhile 1:\n r += 1\n if 2**r > L or r == 20:\n N = r\n break\n\npath = []\nfor i in range(1,N):\n path.append([i, i+1, 0])\n path.append([i, i+1, 2**(i-1)])\n\nfor t in range(N-1,0,-1):\n if L - 2**(t-1) > 2**(N-1)-1:\n path.append([t, N, L - 2**(t-1) ])\n L -= 2**(t-1)\n\n\nM = len(path)\nprint(\"{} {}\".format(N, M))\nfor i in range(M):\n print(\" \".join(map(str,path[i])))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\n# 終了後に解説を見て解けた\n# パス数が２のべき乗であれば簡単にグラフを構築できることに気付きたかった。\n#\n# 本番中は、10進法で考えて 頂点1と頂点2の間を辺{0, 100, 200, ..., 900}で繋ぎ、頂点2と頂点3の間を辺{0, 10, ..., 90}で繋ぎ、\n# などという事を考えていたが、それ以上進展させることが難しかった。\n\n\nimport array\nfrom bisect import *\nfrom collections import *\nimport fractions\nimport heapq \nfrom itertools import *\nimport math\nimport random\nimport re\nimport string\nimport sys\n\nL = int(input())\n\nv = 1\nedges = [] # (from, to, cost)\n\n# L = 37の場合を例にとりコメントを付与\n# まず長さ0 ~ 31までのパスを作成する。\n# 頂点1 -> 頂点2を0の辺と1の辺で結ぶ\n# 頂点2 -> 頂点3を0の辺と2の辺で結ぶ\n# 頂点3 -> 頂点4を0の辺と4の辺で結ぶ\n# 頂点4 -> 頂点5を0の辺と8の辺で結ぶ\n# 頂点5 -> 頂点6を0の辺と16の辺で結ぶ\nn = 2\ncost = 1\nwhile n <= L:\n edges.append((v, v+1, 0))\n edges.append((v, v+1, cost))\n cost *= 2\n v += 1\n n *= 2\n\n# 頂点6をv_sink(最終到達点)とする\nv_sink = v\n\n# ここから先、長さ32, 33, 34, 35, 36のパスを生成することになる。\n# 頂点3と頂点6を、32の辺で直でつなぐと、長さ32, 33, 34, 35のパスが作れる。\n# 頂点1と頂点6を、36の辺で直でつなぐと、長さ36のパスが作れる。\nn //= 2\nN = n\nL -= N\n\nwhile L > 0:\n if L >= n:\n edges.append((v, v_sink, N))\n L -= n\n N += n\n n //= 2\n v -= 1\n\nprint(v_sink, len(edges))\nfor e in edges:\n print(*e)", "l = int(input())\nn = l.bit_length()\nedge = list()\nfor i in range(1,n):\n edge.append((i,i+1,0))\n edge.append((i,i+1,1<<(i-1)))\nt = l - (1<<(n-1))\ncnt = (n-1)*2\nwhile t:\n m = t.bit_length()\n edge.append((m,n,l-t))\n t -= (1<<m-1)\n cnt += 1\nprint(n,cnt)\nfor t in edge:\n print(*t)", "# coding: utf-8\nimport sys\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\nL = ir()\nedges = []\nlength = L.bit_length()\nfor i in range(1, length):\n edges.append((i, i+1, 2**(i-1)))\n edges.append((i, i+1, 0))\n\n# 2**(length-1)-1までの数は完了\n# Lに近い切れ端から処理していく\nfor i in range(length-1):\n if L >> i & 1:\n L -= 2 ** i\n edges.append((i+1, length, L))\n\nprint(length, len(edges))\nfor x in edges:\n print(*x)\n", "L = int(input())\n\nN = len(str(bin(L)))-2\n\nbitL = [0] *20\nsplitL = [0] * 20\nsumL = [0] * 20\n\nfor i in range(19,-1,-1):\n if L % 2 == 1:\n bitL[i] = 1\n L = L // 2\n\nfor i in range(19,-1,-1):\n splitL[i] = int(bitL[i]) * 2**(19-i)\n\nfor i in range(20):\n\n if i == 0:\n sumL[i] = splitL[i]\n else:\n sumL[i] =splitL[i]+sumL[i-1]\n\n#print(splitL)\n#print(sumL)\n#print(bitL)\n\nedge = []\n \nfor i in range(N-1):\n edge.append([i+1,i+2,0])\n edge.append([i+1,i+2,2**i])\n\n\nfor i in range(21-N,20):\n if bitL[i] == 1:\n edge.append([20-i,N,sumL[i-1]])\n\n\nprint(N,len(edge))\n\nfor i in range(len(edge)):\n print(edge[i][0],edge[i][1],edge[i][2])", "L = int(input())\n\nN = L.bit_length()\nn = []\nfor i in range(1, N):\n n += [[i, i + 1, 0], [i, i + 1, 2**(i - 1)]]\nv = 2**(N - 1) - 1\nwhile L - 1 - v > 0:\n b = min(N - 1, (L - 1 - v).bit_length())\n n += [[b, N, v + 1]]\n v += 2**(b - 1)\nM = len(n)\nprint(N, M)\nfor _ in n:\n print(*_)\n", "L=int(input())\n\nans = []\nm = 0\nadd = -1\nmask = 0xffffff\nfor i in range(24):\n mask >>= 1\n d = 24 - i - 1\n if ((~mask) & L) != 0:\n if add == -1:\n n = d+1\n add = 1 << d\n b = 1\n # [0, 2^d) の範囲\n for i in range(1,d+1):\n ans.append(str(i) + \" \" + str(i+1) + \" 0\")\n ans.append(str(i) + \" \" + str(i+1) + \" \" + str(b))\n b *= 2\n m += 2\n else :\n ans.append(str(d+1) + \" \" + str(n) + \" \" + str(add))\n add += (1 << d)\n m += 1\n L &= mask\n# print(\" \",d,L,mask)\nprint(n,m)\nfor i in ans:\n print(i)\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int (i)=(0);(i)<(long long)(n);++(i))\nusing ll = long long;\nusing P = pair<int, int>;\nusing namespace std;\n\ntemplate<class T> void vin(vector<T>& v, int n) {\n v.resize(n);\n for (int i = 0; i < n; ++i) {\n cin >> v[i];\n }\n}\n\nstruct Edge {\n int s, t, w;\n};\n\nint main() {\n int L;\n cin >> L;\n vector<Edge> g;\n int r = log2(L);\n int n = r + 1;\n rep(i, r) {\n Edge e1, e2;\n e1.s = i+1;\n e1.t = i+2;\n e1.w = 0;\n e2.s = i+1;\n e2.t = i+2;\n e2.w = pow(2, i);\n g.push_back(e1);\n g.push_back(e2);\n }\n int t = n-1;\n for (; t>=1; --t) {\n int a = pow(2, t-1);\n if (L-a>=pow(2, r)) {\n Edge e;\n e.s = t;\n e.t = n;\n e.w = L-a;\n L -= a;\n g.push_back(e);\n }\n }\n cout << n << ' ' << g.size() << endl;\n for (auto e : g) {\n cout << e.s << ' ' << e.t << ' ' << e.w << endl;\n }\n return 0;\n}\n", "from math import log2\nn = int(input())\nr, ans = int(log2(n)), []\nfor i in range(1,r+1):\n ans.append([i,i+1,2**(i-1)])\nfor i in range(r, 0, -1):\n if n - 2**(i-1) >= 2**r:\n ans.append([i, r+1, n-2**(i-1)])\n n -= 2**(i-1)\nprint(r+1, len(ans)+r)\nfor i in range(1,r+1):\n print(i, i+1, 0)\nfor i,j,k in ans:\n print(i, j, k)\n\n", "#include <iostream>\n#include <cmath>\n#include <vector>\n\nusing namespace std;\n\nstruct Edge {\n\tint s, e, l;\n};\n\nvector<Edge> edge;\n\nint binary_pow(int x, int n) {\n\tif (n == 0)return 1;\n\telse if (n == 1) return x;\n\telse if (n % 2 == 0) {\n\t\tint tmp = binary_pow(x, n / 2);\n\t\treturn tmp * tmp;\n\t}\n\telse {\n\t\tint tmp = binary_pow(x, n / 2);\n\t\treturn tmp * tmp *x;\n\t}\n}\n\nint main() {\n\tint L;\n\n\tcin >> L;\n\n\tint N;\n\tfor (N = 1; binary_pow(2, N) <= L; N++);\n\n\tfor (int i = 1; i < N; i++) {\n\t\tedge.push_back({ i,i + 1,binary_pow(2,i - 1) });\n\t\tedge.push_back({ i,i + 1,0 });\n\t}\n\n\t//まだ表現されていない値:len\n\tint len = binary_pow(2, N - 1), index = N - 1;\n\n\n\twhile (len < L && index > 0) {\n\t\tif (len + binary_pow(2, index-1) - 1 <= L -1) {\n\t\t\tedge.push_back({ index, N,len });\n\t\t\tlen += binary_pow(2, index-1);\n\t\t}\n\t\tindex--;\n\t}\n\n\tcout << N << \" \" << edge.size() << endl;\n\n\tfor (int i = 0; i < edge.size(); i++) {\n\t\tcout << edge[i].s << \" \" << edge[i].e << \" \" << edge[i].l << endl;\n\t}\n\n\treturn 0;\n}", "#include <iostream>\n#include <cstdio>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n int l;cin>>l;\n int t1=l;\n int d1=0;\n bool te[20];\n int ce=0;\n rep(i,20)te[i]=0;\n while(l)\n {\n if(l&1)\n {\n te[d1]=1;\n ce++;\n }\n l>>=1;\n d1++;\n\n }\n cout<<d1<<\" \"<<(d1-1)*2+ce-1<<endl;\n l=t1;\n int t=1;\n for(int i=1;i<d1;i++)\n {\n cout<<i<<\" \"<<i+1<<\" \"<<0<<endl;\n cout<<i<<\" \"<<i+1<<\" \"<<t<<endl;\n if(te[i-1])\n {\n cout<<i<<\" \"<<d1<<\" \"<<l-t<<endl;\n l-=t;\n }\n t<<=1;\n }\n return 0;\n}", "#include<iostream>\n#include<sstream>\n#include<vector>\n#include<iterator>\n#include<utility>\n#include<cmath>\nusing namespace std;\n\nint main(void)\n{\n\tint L;\n\tcin >> L;\n\n\tint cntNode = 0;\n\tint cntEdge = 0;\n\tfor(int i=1; i*2<=L; i*=2)\n\t\tcntNode++;\n\tcntNode++;\n\n\tvector<vector<pair<int, int>>> graph(cntNode, vector<pair<int, int>>());\n\tfor(int i=0; i<cntNode-1; i++){\n\t\tgraph[i].push_back(make_pair(i+1, 0));\n\t\tgraph[i].push_back(make_pair(i+1, pow(2, i)));\n\n\t\tcntEdge += 2;\n\t}\n\n\tfor(int i=cntNode; i>=0; i--){\n\t\tint left = L - pow(2, i);\n\t\tint right = int(pow(2, cntNode-1));\n\t\tif(left < right)\n\t\t\tcontinue;\n\n\t\tgraph[i].push_back(make_pair(cntNode-1, left));\n\t\tL -= pow(2, i);\n\t\tcntEdge++;\n\t}\n\n\tcout << cntNode << \" \" << cntEdge << endl;\n\tfor(int i=0; i<cntNode; i++){\n\t\tfor(int j=0; j<graph[i].size(); j++){\n\t\t\tint n = graph[i][j].first;\n\t\t\tint w = graph[i][j].second;\n\t\t\tcout << i+1 << \" \" << n+1 << \" \" << w << endl;\n\t\t}\n\t}\n\n\n\treturn 0;\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author __shangu__\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DAllYourPathsAreDifferentLengths solver = new DAllYourPathsAreDifferentLengths();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DAllYourPathsAreDifferentLengths {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt(), bitn = 0;\n bitn = Integer.toBinaryString(n).length();\n out.printf(\"%d %d\\n\", bitn, bitn * 2 + Integer.bitCount(n) - 3);\n\n for (int i = 0; i < bitn - 1; ++i) {\n out.printf(\"%d %d %d\\n\", i + 1, i + 2, 0);\n out.printf(\"%d %d %d\\n\", i + 1, i + 2, 1 << i);\n\n if ((n >> i & 1) == 1) {\n out.printf(\"%d %d %d\\n\", i + 1, bitn, (-1 << i + 1) & n);\n }\n }\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "L = t = int(input())\nX = []\nB = 4\nwhile L:\n X.append(L%B)\n L//=B\n\nE = []\nN = len(X)*2\nfor i, x in enumerate(X[:-1]):\n r = B**i\n t -= r*x\n for k in range(0, x):\n E.append((2*i+1, 2*i+2, r*k))\n\n E.append((2*i+2, 2*i+3, 0))\n\n for k in range(x, B):\n E.append((2*i+1, 2*i+3, r*k))\n\n E.append((2*i+2, N, t))\n\nfor k in range(0, X[-1]):\n E.append((N-1, N, B**(len(X)-1)*k))\n\nprint(N, len(E))\nfor e in E:\n print(*e)", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint L; cin >> L;\n\tint l[30], g[30];\n\tint n=0, m=0;\n\t--L;\n\twhile(L>0){\n\t l[n]=1-L%2;\n\t g[n]=1+L/2;\n\t L=(L+1)/2 - 1;\n\t m += 2+l[n];\n\t ++n;\n\t}\n\tcout << n+1 << ' ' << m << endl;\n\tfor(int i=0; i<n; ++i){\n\t cout << i+1 << ' ' << i+2 << ' ' << l[i] << endl;\n\t cout << i+1 << ' ' << i+2 << ' ' << g[i] << endl;\n\t if(l[i]==1) cout << i+1 << ' ' << n+1 << ' ' << 0 << endl;\n\t}\n\treturn 0;\n}\n", "#include<cstdio>\n\nusing namespace std;\n\nint main(){\n\tint l; scanf(\"%d\", &l);\n\tint n = 1, r = 0;\n\twhile(2 * n <= l) { n *= 2; r++; }\n\tint m = 2 * r + __builtin_popcount(l - n);\n\tprintf(\"%d %d\\n\", r + 1, m);\n\tfor(int i = 0; i < r; i++){\n\t\tprintf(\"%d %d %d\\n\", i + 1, i + 2, 0);\n\t\tprintf(\"%d %d %d\\n\", i + 1, i + 2, 1 << i);\n\t}\n\tfor(int i = r - 1; l > n; i--) if(l - (1 << i) >= n){\n\t\tl -= 1 << i;\n\t\tprintf(\"%d %d %d\\n\", i + 1, r + 1, l);\n\t}\n\treturn 0;\n}", "import math\nL = int(input())\nN = math.floor(math.log2(L))+1\n\nM = N*2-2\nadd_path = []\nfor i in range(1,N)[::-1]:\n if L-2**(i-1) >= 2**(N-1):\n add_path.append([i, L-2**(i-1)]); L -= 2**(i-1)\nprint(N, M+len(add_path))\nfor i in range(1,N):\n print(i, i+1, 0)\n print(i, i+1, 2**(i-1))\nfor i in add_path:\n print(i[0], N, i[1])", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.stream.Collectors;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int L = sc.nextInt();\n\n System.out.println(solve(L));\n\n sc.close();\n }\n\n static String solve(int L) {\n Graph graph = new Graph();\n search(graph, L);\n\n return String.format(\"%d %d\\n%s\", graph.vertexNum, graph.edges.size(),\n graph.edges.stream().map(edge -> String.format(\"%d %d %d\", edge.from, edge.to, edge.weight))\n .collect(Collectors.joining(\"\\n\")));\n }\n\n static void search(Graph graph, int pathNum) {\n if (pathNum == 1) {\n return;\n }\n\n int currentVertex = graph.vertexNum;\n\n ++graph.vertexNum;\n graph.edges.add(new Edge(currentVertex, graph.vertexNum, 0));\n graph.edges.add(new Edge(currentVertex, graph.vertexNum, pathNum / 2));\n\n search(graph, pathNum / 2);\n\n if (pathNum % 2 != 0) {\n graph.edges.add(new Edge(currentVertex, graph.vertexNum, pathNum - 1));\n }\n }\n}\n\nclass Graph {\n int vertexNum = 1;\n List<Edge> edges = new ArrayList<>();\n}\n\nclass Edge {\n int from;\n int to;\n int weight;\n\n Edge(int from, int to, int weight) {\n this.from = from;\n this.to = to;\n this.weight = weight;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nconst int MAX = 1e5 + 5;\nconst int INF = 1001001001;\nconst int MOD = 1e9 + 7;\n\nint main(){\n int L;\n cin >> L;\n\n int r = 1;\n int N = 1;\n while (r * 2 <= L) {\n r *= 2;\n N++;\n }\n\n vector<vector<P>> G(N, vector<P>());\n r = 1;\n int M = 0;\n rep(i, N - 1) {\n G[i].emplace_back(i + 1, 0);\n G[i].emplace_back(i + 1, r);\n M += 2;\n r *= 2;\n }\n\n vector<int> nums(21);\n nums[0] = 1;\n rep(i, 20) nums[i + 1] = nums[i] * 2;\n\n for (int i = N - 2; i >= 0; --i) {\n if (r + nums[i] - 1 < L) {\n G[i].emplace_back(N - 1, r);\n r += nums[i];\n M++;\n }\n }\n\n cout << N << \" \" << M << endl;\n rep(i, N) {\n for (auto j : G[i]) {\n cout << i + 1 << \" \" << j.first + 1 << \" \" << j.second << endl;\n }\n }\n}", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\n\nint main() {\n int L;\n cin >> L;\n\n int x = 0;\n while (1<<x <= L) {\n x++;\n }\n x--;\n\n int cnt = 0;\n vector<string> path;\n for (int i = 0; i < x; i++) {\n path.push_back(to_string(i + 1) + \" \" + to_string(i + 2) + \" 0\");\n path.push_back(to_string(i + 1) + \" \" + to_string(i + 2) + \" \" + to_string(1<<i));\n cnt++;\n }\n\n int z = (L - (1<<x));\n int s = 1<<x;\n for (int i = x - 1; i >= 0; i--) {\n if (z & (1<<i)) {\n path.push_back(to_string(i + 1) + \" \" + to_string(x + 1) + \" \" + to_string(s));\n\n s += (1<<i);\n }\n }\n\n cout << (x + 1) << \" \" << path.size() << endl;\n rep(i, path.size()) {\n cout << path[i] << endl;\n }\n}", "import java.util.*;class Main{public static void main(String[]a){Scanner c=new Scanner(System.in);int l=c.nextInt(),n=0,m=0;while(l>=(1<<n++));n--;String s=\"\";for(int b=0;++b<n;s+=b+\" \"+(b+1)+\" \"+0+\"\\n\"+b+\" \"+(b+1)+\" \"+(1<<(b-1))+\"\\n\",m+=2)if((l&(1<<(b-1)))!=0){s+=b+\" \"+n+\" \"+(l>>b<<b)+\"\\n\";m++;}System.out.print(n+\" \"+m+\"\\n\"+s);}}", "import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n L = int(input())\n\n Lstr = bin(L)[2:]\n\n N = len(Lstr)\n M = (N - 1) * 2 + (Lstr.count(\"1\") - 1)\n\n print(N, M)\n c = 1\n for i in range(1, N):\n print(i, i + 1, c)\n print(i, i + 1, 0)\n c *= 2\n\n c = 2 ** (N - 1)\n for i, v in enumerate(Lstr[::-1]):\n if i == N - 1:\n continue\n if v == \"1\":\n print(i + 1, N, c)\n c += 2 ** i\n\n\n\nif __name__ == '__main__':\n main()\n", "from math import log2,floor\nL = int(input())\nans = []\n\nr = floor(log2(L))\n\nfor i in range(r):\n ans.append('{} {} {}'.format(i+1,i+2,0))\n ans.append('{} {} {}'.format(i+1,i+2,2**i))\n\nfor t in range(r-1,-1,-1):\n if 2**r <= L-2**t:\n ans.append('{} {} {}'.format(t+1,r+1,L-2**t))\n L -= 2**t\n\nprint('{} {}'.format(r+1,len(ans)))\nfor s in ans:\n print(s)", "#include <bits/stdc++.h>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint main(){\n\tint L; cin>>L;\n\n\tint n;\n\tfor(n=0;(1<<n)<=L;n++);\n\n\tvector<vector<pair<int,int>>> G(n);\n\trep(i,n-1){\n\t\tG[i].emplace_back(i+1,0);\n\t\tG[i].emplace_back(i+1,1<<(n-i-2));\n\t}\n\tint sum=1<<(n-1);\n\trep(i,n-1) if(L>>(n-i-2)&1) {\n\t\tG[0].emplace_back(i+1,sum);\n\t\tsum+=1<<(n-i-2);\n\t}\n\n\tint m=0;\n\trep(u,n) m+=G[u].size();\n\n\tprintf(\"%d %d\\n\",n,m);\n\trep(u,n) for(auto e:G[u]) printf(\"%d %d %d\\n\",u+1,e.first+1,e.second);\n\n\treturn 0;\n}\n", "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<cstdlib>\n#include<queue>\n#include<cmath>\n\nusing namespace std;\n\n#define rep(i, n) for(long int i = 0; i < n; i++)\n\nstruct edge {int from, to, cost;};\n\nint main(){\n int l;\n cin >> l;\n int r = 0;\n int k = l;\n while(k / 2 != 0){\n k /= 2;\n r++;\n \n }\n vector<edge> G;\n k = 1;\n rep(i, r){\n edge g;\n g.from = i + 1;\n g.to = i + 2;\n g.cost = k;\n G.push_back(g);\n g.cost = 0;\n G.push_back(g);\n k *= 2;\n }\n k = 1;\n rep(i, r-1) k *= 2;\n int bi = k * 2;\n // cout << bi << endl;\n for (int i = r; i >= 1; i--){\n if (l - k >= bi){\n edge g;\n g.from = i;\n g.to = r + 1;\n g.cost = l - k;\n G.push_back(g);\n l -= k;\n }\n k /= 2;\n }\n cout << r + 1 << \" \" << G.size() << endl;\n rep(i, G.size()){\n cout << G[i].from << \" \" << G[i].to << \" \" << G[i].cost << endl;\n }\n}\n", "L = int(input())\n\ndef power2(i):\n power = 0\n while i > 1:\n i //= 2\n power += 1\n return power\n\nr = power2(L)\nN = r + 1\nM = []\nfor i in range(1, N):\n M.append([i, i+1, 0])\n M.append([i, i+1, 2**(i-1)])\n\nfor i in range(N-1, 0, -1):\n if L - 2 ** (i-1) >= 2 ** r:\n M.append([i, N, L-2**(i-1)])\n L -= 2**(i-1)\nM.sort()\nprint(N, len(M))\nfor i in M:\n print(i[0], i[1], i[2])", "L = int(input())\nN = L.bit_length()\n\nnode = [i for i in range(1, N + 1)]\nedge = []\n\nfor x, y in zip(node[:-1], node[1:]):\n edge.append((x, y, 0))\n\nx = 1\nwhile L > 1:\n if L & 1:\n L -= 1\n edge.append((x, N, L))\n else:\n L //= 2\n edge.append((x, x + 1, L))\n x += 1\n\nprint(N, len(edge))\nfor e in edge:\n print(*e)", "#include <iostream>\n#include <vector>\n#include <tuple>\nusing namespace std;\n\nlong long L; vector<tuple<int, int, int>>G;\n\nint main() {\n\tcin >> L;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tG.push_back(make_tuple(i, i + 1, 0));\n\t\tG.push_back(make_tuple(i, i + 1, (1 << (i - 1))));\n\t}\n\tint Z = L, sum = 0;\n\tfor (int i = 19; i >= 1; i--) {\n\t\twhile (Z >= (1 << (i - 1))) {\n\t\t\tG.push_back(make_tuple(i, 20, sum));\n\t\t\tsum += (1 << (i - 1)); Z -= (1 << (i - 1));\n\t\t}\n\t}\n\tcout << 20 << \" \" << G.size() << endl;\n\tfor (int i = 0; i < G.size(); i++) cout << get<0>(G[i]) << \" \" << get<1>(G[i]) << \" \" << get<2>(G[i]) << endl;\n\treturn 0;\n}", "#include <algorithm>\n#include <climits>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <vector>\n\n#define int long long int\nconstexpr int INF = std::numeric_limits<int>::max();\nconstexpr int NINF = std::numeric_limits<int>::min();\nusing namespace std;\n\nvoid solve() {\n int L;\n cin >> L;\n L--;\n vector<int> v;\n vector<tuple<int, int, int>> m;\n\n for (int i = 0; (1 << i) - 1 <= L; i++) {\n v.push_back((1 << i) - 1);\n }\n\n for (int i = 1; i < v.size(); i++) {\n m.emplace_back(i, i + 1, 1 << (i - 1));\n m.emplace_back(i, i + 1, 0);\n }\n\n int x = 1 << (v.size() - 1);\n while (x <= L) {\n int i = 1;\n while (v[i] + x <= L) {\n i++;\n }\n\n m.emplace_back(i, v.size(), x);\n x = x + v[i - 1] + 1;\n }\n\n printf(\"%ld %ld\\n\", v.size(), m.size());\n for (auto &a : m) {\n printf(\"%lld %lld %lld\\n\", get<0>(a), get<1>(a), get<2>(a));\n }\n}\n\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n solve();\n return 0;\n}\n", "L = int(input())\nN = len(str(bin(L)))-3\nE = []\n\nfor n in range(N):\n E.append((n+1,n+2,0))\n E.append((n+1,n+2,2**(N-n-1)))\n \nH = 2**N\n\nfor i,c in enumerate(str(bin((L)))[2:]):\n if c==\"1\" and i:\n E.append((1,i+1,H))\n H+=2**(N-i)\n\nprint(N+1,len(E))\nfor e in E:\n print(*e)\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <deque>\n#include <queue>\n#include <algorithm>\n#include <set>\n#include <map>\n#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))\n#define vvi std::vector<std::vector<int> >\n#define vvl std::vector<std::vector<ll> >\n#define MODs 1000000007;\ntypedef long long int ll;\nusing namespace std;\n\nint main(int argc, char const *argv[]) {\n int L, now=1, count=0, d=1;\n std::cin >> L;\n while(now<=L) count++, now*=2;\n count--, now/=2;\n vvi ans = vv(0, 3, 0, int);\n for(int i=0;i<count;i++){\n ans.push_back(std::vector<int> {i+1, i+2, d});\n ans.push_back(std::vector<int> {i+1, i+2, 0});\n d*=2;\n }\n for(int i=count-1;i>=0;i--){\n if((L-(1<<i))>=(1<<count)){\n ans.push_back(std::vector<int> {i+1, count+1, L-(1<<i)});\n L-=(1<<i);\n }\n }\n std::cout << count+1 << \" \" << ans.size() << '\\n';\n for(int i=0;i<ans.size();i++) std::cout << ans[i][0]<<\" \"<<ans[i][1]<<\" \"<<ans[i][2] << '\\n';\n return 0;\n}\n", "#include <bits/stdc++.h>\n\n#define fst(t) std::get<0>(t)\n#define snd(t) std::get<1>(t)\n#define thd(t) std::get<2>(t)\n#define unless(p) if(!(p))\n#define until(p) while(!(p))\n\nusing ll = std::int64_t;\nusing P = std::tuple<int,int>;\n\nint L;\nconstexpr int N = 20;\nint M;\nstd::vector<P> G[21];\n\nvoid f(int i, int l){\n if(i == N){\n return;\n }\n\n if(l & 1){\n G[i].emplace_back(N, l - 1);\n M += 1;\n }\n\n if(l >= 2){\n G[i].emplace_back(i + 1, 0);\n G[i].emplace_back(i + 1, l / 2);\n M += 2;\n f(i + 1, l / 2);\n }\n}\n\nint main(){\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n std::cin >> L;\n\n f(1, L);\n\n printf(\"%d %d\\n\", N, M);\n\n for(int i=1;i<=N;++i){\n for(auto &p : G[i]){\n int j, w;\n std::tie(j, w) = p;\n\n printf(\"%d %d %d\\n\", i, j, w);\n }\n }\n}\n", "#include <bits/stdc++.h>\n#define rep(i,a,b) for(int i=int(a);i<int(b);++i)\n#define SIZE 200005\n#define INF 1000000005LL\n#define MOD 1000000007\n\nusing namespace std;\ntypedef long long int ll;\ntypedef pair <int,int> P;\n\nint tmp[25];\n\nvoid init(){\n tmp[0] = 1;\n rep(i,1,22){\n tmp[i] = tmp[i-1]*2;\n }\n}\n\nint main(){\n int L;\n cin >> L;\n\n init();\n\n vector<int> U;\n while(L>0){\n U.push_back(L%2);\n L /= 2;\n }\n\n int N = U.size();\n int M = (N-1)*2-1;\n rep(i,0,N) if(U[i]==1) M++;\n cout << N << \" \" << M << endl;\n reverse(U.begin(),U.end());\n\n int a = 0;\n rep(i,0,N){\n if(U[i] == 1 && i != 0){\n cout << 1 << \" \" << i+1 << \" \" << a << endl;\n }\n if(U[i] == 1) a += tmp[N-i-1];\n }\n\n rep(i,1,N){\n cout << i << \" \" << i+1 << \" \" << 0 << endl;\n cout << i << \" \" << i+1 << \" \" << tmp[N-i-1] << endl;\n }\n\n\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int L;\n cin >> L;\n int count = 0, top;//count:1の数 top:最上位の1の位置\n int arr[21]={0};\n for(int i = 0; i <= 20; i++){\n if((L >> i) & 1 == 1){//i桁目が1\n arr[count] = i;\n count++;\n top = i;\n }\n }\n\n if(count == 1){\n cout << top + 1 << \" \" << top * 2 << endl;\n for(int i = 0; i < top; i++){\n cout << top - i << \" \" << top - i + 1 << \" \" << pow(2, i) << endl;\n cout << top - i << \" \" << top - i + 1 << \" \" << 0 << endl;\n }\n }else{\n cout << top + 1 << \" \" << top * 2 + count - 1 << endl;\n for(int i = 0; i < top; i++){\n cout << top - i << \" \" << top - i + 1 << \" \" << pow(2, i) << endl;\n cout << top - i << \" \" << top - i + 1 << \" \" << 0 << endl;\n }\n for(int i = 0; i < count - 1; i++){\n int temp = L;\n temp = temp >> arr[i] + 1;\n temp = temp << arr[i] + 1;\n cout << 1 << \" \" << top + 2 - arr[i] - 1 << \" \" << temp << endl;\n }\n }\n}", "l=int(input())\nk=l\ncnt=0\nwhile k>1:\n k//=2\n cnt+=1\nedge=[[] for _ in range(cnt)]\ne=2*cnt\nfor i in range(cnt):\n edge[i].append((i+1,0))\n edge[i].append((i+1,2**i))\nfor i in reversed(range(cnt)):\n if l-2**i>=2**cnt:\n edge[i].append((cnt,l-2**i))\n l-=2**i\n e+=1\nprint(cnt+1,e)\nfor i in range(cnt):\n for j,d in edge[i]:\n print(i+1,j+1,d)", "# -*- coding: utf-8 -*-\n\n#############\n# Libraries #\n#############\n\nimport sys\ninput = sys.stdin.readline\n\nimport math\n#from math import gcd\nimport bisect\nimport heapq\nfrom collections import defaultdict\nfrom collections import deque\nfrom collections import Counter\nfrom functools import lru_cache\n\n#############\n# Constants #\n#############\n\nMOD = 10**9+7\nINF = float('inf')\nAZ = \"abcdefghijklmnopqrstuvwxyz\"\n\n#############\n# Functions #\n#############\n\n######INPUT######\ndef I(): return int(input().strip())\ndef S(): return input().strip()\ndef IL(): return list(map(int,input().split()))\ndef SL(): return list(map(str,input().split()))\ndef ILs(n): return list(int(input()) for _ in range(n))\ndef SLs(n): return list(input().strip() for _ in range(n))\ndef ILL(n): return [list(map(int, input().split())) for _ in range(n)]\ndef SLL(n): return [list(map(str, input().split())) for _ in range(n)]\n\n\n#####Shorten#####\ndef DD(arg): return defaultdict(arg)\n\n#####Inverse#####\ndef inv(n): return pow(n, MOD-2, MOD)\n\n######Combination######\nkaijo_memo = []\ndef kaijo(n):\n if(len(kaijo_memo) > n): return kaijo_memo[n]\n if(len(kaijo_memo) == 0): kaijo_memo.append(1)\n while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)\n return kaijo_memo[n]\n\ngyaku_kaijo_memo = []\ndef gyaku_kaijo(n):\n if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]\n if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)\n while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)\n return gyaku_kaijo_memo[n]\n\ndef nCr(n,r):\n if n == r: return 1\n if n < r or r < 0: return 0\n ret = 1\n ret = ret * kaijo(n) % MOD\n ret = ret * gyaku_kaijo(r) % MOD\n ret = ret * gyaku_kaijo(n-r) % MOD\n return ret\n\n######Factorization######\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0: \n cnt+=1 \n temp //= i\n arr.append([i, cnt])\n if temp!=1: arr.append([temp, 1])\n if arr==[]: arr.append([n, 1])\n return arr\n\n#####MakeDivisors######\ndef make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i: \n divisors.append(n//i)\n return divisors\n\n#####MakePrimes######\ndef make_primes(N):\n max = int(math.sqrt(N))\n seachList = [i for i in range(2,N+1)]\n primeNum = []\n while seachList[0] <= max:\n primeNum.append(seachList[0])\n tmp = seachList[0]\n seachList = [i for i in seachList if i % tmp != 0]\n primeNum.extend(seachList)\n return primeNum\n\n#####GCD#####\ndef gcd(a, b):\n while b: a, b = b, a % b\n return a\n\n#####LCM#####\ndef lcm(a, b):\n return a * b // gcd (a, b)\n\n#####BitCount#####\ndef count_bit(n):\n count = 0\n while n:\n n &= n-1\n count += 1\n return count\n\n#####ChangeBase#####\ndef base_10_to_n(X, n):\n if X//n: return base_10_to_n(X//n, n)+[X%n]\n return [X%n]\n\ndef base_n_to_10(X, n):\n return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))\n\ndef base_10_to_n_without_0(X, n):\n X -= 1\n if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]\n return [X%n]\n\n#####IntLog#####\ndef int_log(n, a):\n count = 0\n while n>=a:\n n //= a\n count += 1\n return count\n\n#############\n# Main Code #\n#############\n\nL = I()\n\nN = len(bin(L))-2\n\nans = []\nfor i in range(1,N):\n if L%2:\n ans.append([i,N,L-1])\n ans.append([i,i+1,L//2])\n ans.append([i,i+1,0])\n L //= 2\n\nprint(N,len(ans))\nfor a,b,c in ans:\n print(a,b,c)", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst ll MOD = 1e9+7;\nconst ll INF = 1e18;\n#define rep(i,m,n) for(ll i = (m); i <= (n); i++)\n#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)\n#define print(x) cout << (x) << endl;\n#define printa(x,m,n) for(ll i = (m); i <= n; i++){cout << (x[i]) << \" \";} cout<<endl;\n\nll l;\nstring s;\n\nint main(){\n\tcin.tie(0); ios::sync_with_stdio(false);\n\t\n\tcin >> l;\n\tvector<vector<P>> ans;\n\tans.resize(21);\n\tll n = 0;\n\tll pow[30];\n\tpow[0] = 1;\n\trep(i, 1, 20){\n\t\tpow[i] = 2*pow[i-1];\n\t}\n\t\n\trep(i, 1, 19){\n\t\tans[i].push_back(P(i+1, 0));\n\t\tn++;\n\t\tif(l >= pow[i]){\n\t\t\tans[i].push_back(P(i+1, pow[i-1]));\n\t\t\tn++;\n\t\t}\n\t}\n\t\n\trep(i, 1, 19){\n\t\tif(l%pow[i] != 0 && l > pow[i]){\n\t\t\tans[i].push_back(P(20, l-pow[i-1]));\n\t\t\tn++;\n\t\t\tl -= pow[i-1];\n\t\t}\n\t}\n\t\n\tcout << 20 << \" \" << n << endl;\n\trep(i, 1, 19){\n\t\tfor(ll j = 0; j < ans[i].size(); j++){\n\t\t\tcout << i << \" \" << ans[i][j].first << \" \" << ans[i][j].second << endl; \n\t\t}\n\t}\n\t\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n int l;\n cin >> l;\n\n int n = 1;\n while ((1 << n) <= l) {\n n++;\n }\n\n vector<int> a(0), b(0), c(0);\n for (int i = 0; i < n - 1; i++) {\n a.push_back(i);\n b.push_back(i + 1);\n c.push_back(0);\n\n a.push_back(i);\n b.push_back(i + 1);\n c.push_back(1 << i);\n }\n\n for (int i = n - 2, j = l; i >= 0; i--) {\n if ((1 << (n - 1)) + (1 << i) <= j) {\n a.push_back(i);\n b.push_back(n - 1);\n c.push_back(j - (1 << i));\n j -= (1 << i);\n }\n }\n\n int m = a.size();\n\n cout << n << \" \" << m << endl;\n for (int i = 0; i < m; i++) {\n cout << a[i] + 1 << \" \" << b[i] + 1 << \" \" << c[i] << endl;\n }\n}\n", "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tfinal Scanner sc = new Scanner(System.in);\n\t\tlong L;\n\t\tL = sc.nextLong();\n\t\tsolve(L);\n\t}\n\n\tstatic void solve(long L) {\n\t\tStringBuilder sb = new StringBuilder();\n\t\tlong n = 0;\n\t\tlong a = 1;\n\t\twhile (a <= L) {\n\t\t\ta *= 2;\n\t\t\tn++;\n\t\t}\n\t\ta /= 2;\n\n\t\tsb.append(n).append(\" \");\n\t\tList<long[]> es = new ArrayList<>();\n\t\tint b = 1;\n\t\tfor (long i = 1; i < n; i++) {\n\t\t\tes.add(new long[]{i, i + 1, 0});\n\t\t\tes.add(new long[]{i, i + 1, b});\n\t\t\tb *= 2;\n\t\t}\n\n\t\tlong x = 1;\n\t\tlong t = n - 1;\n\t\tfor (int i = 0; i < t; i++) {\n\t\t\tx *= 2;\n\t\t}\n\n\n\t\twhile (t >= 0) {\n\t\t\tif (L - x >= a) {\n\t\t\t\tes.add(new long[]{t + 1, n, L - x});\n\t\t\t\tL -= x;\n\t\t\t}\n\t\t\tx /= 2;\n\t\t\tt--;\n\t\t}\n\n\t\tsb.append(es.size()).append(\"\\n\");\n\t\tfor (int i = 0; i < es.size(); i++) {\n\t\t\tsb.append(es.get(i)[0]).append(\" \")\n\t\t\t\t\t.append(es.get(i)[1]).append(\" \")\n\t\t\t\t\t.append(es.get(i)[2]).append(\"\\n\");\n\t\t}\n\n\t\tSystem.out.print(sb.toString());\n\t}\n}\n", "#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<int> u;\nvector<int> v;\nvector<int> w;\n\nint main() {\n int L;\n cin >> L;\n int r = 1, r_count = 0, M = 0;;\n while (r * 2 <= L) {\n r *= 2;\n r_count++;\n }\n int N = r_count + 1, length = 1;\n for (int i = 1; i <= r_count; i++) {\n u.push_back(i);\n v.push_back(i + 1);\n w.push_back(0);\n u.push_back(i);\n v.push_back(i + 1);\n w.push_back(length);\n length *= 2;\n }\n length /= 2;\n for (int i = N - 1; i >= 1; i--) {\n if (L - length >= r) {\n u.push_back(i);\n v.push_back(N);\n w.push_back(L - length);\n L -= length;\n }\n length /= 2;\n }\n cout << N << \" \" << u.size() << endl;\n for (int i = 0; i < u.size(); i++) {\n cout << u[i] << \" \" << v[i] << \" \" << w[i] << endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long int LL;\n\n#define lowbit(x) ((x)&-(x))\n\nint x;\nint n,m;\nvector<pair<pair<int,int>,int> > v;\n\nint main(int argc, char const *argv[]){\n while(~scanf(\"%d\",&x)){\n v.clear();\n\n n = 1;\n \n int tmp = x;\n while(tmp - lowbit(tmp) > 0) {\n tmp -= lowbit(tmp);\n }\n\n for(int i=2,tem=1;tem<tmp;++i,tem<<=1){\n // (i-1)->(i) : tem\n v.push_back({{i-1,i},tem});\n v.push_back({{i-1,i},0});\n ++n;\n }\n\n for(int i=n-2;x > tmp;i--) if(x - (1<<i) >=tmp ){\n x -= 1<<i;\n v.push_back({{i+1,n},x});\n }\n\n printf(\"%d %d\\n\",n,v.size());\n for(auto x: v){\n printf(\"%d %d %d\\n\",x.first.first,x.first.second,x.second);\n }\n\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll MOD = 1e9 + 7;\nconst ll INF = 1LL << 60;\n#define rep(i, a, n) for (ll i = (a); i < (n); i++)\n#define debug(x) cerr << #x << \": \" << x << endl;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\nint main() {\n int L;\n cin >> L;\n int N = 0;\n int pow = 1;\n while(pow <= L) pow *= 2, N++;\n int M = (N-1)*2 + __builtin_popcount(L) - 1;\n\n cout << N << \" \" << M << endl;\n rep(i, 0, N-1) {\n cout << i+1 << \" \" << i+2 << \" \" << 0 << endl;\n cout << i+1 << \" \" << i+2 << \" \" << (1<<i) << endl;\n }\n int cur = 1<<(N-1);\n for(int i = N-2; i >= 0; i--) {\n if (L & (1<<i)) {\n cout << i+1 << \" \" << N << \" \" << cur << endl;\n cur += (1<<i);\n }\n }\n}", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n long l;\n cin >> l;\n long r;\n for (r=1;r<=19;++r) {\n if (l < pow(2,r)) {\n break;\n }\n }\n --r;\n vector<vector<long>> ans;\n for (long i=1;i<=r;++i) {\n ans.push_back({i,i+1,0});\n ans.push_back({i,i+1,static_cast<long>(pow(2,i-1))});\n }\n for (long i=r;i>=1;--i) {\n if (l - pow(2,i-1) >= pow(2,r)) {\n ans.push_back({i,r+1,l-static_cast<long>(pow(2,i-1))});\n l -= pow(2,i-1);\n }\n }\n cout << r+1 << ' ' << ans.size() << \"\\n\";\n for (auto each_ans : ans) {\n cout << each_ans[0] << ' ' << each_ans[1] << ' ' << each_ans[2] << \"\\n\";\n }\n return 0;\n}", "L = int(input())\n\nk = L.bit_length()\nans = []\nfor i in range(1, k):\n ans.append([i,i+1,0])\n ans.append([i,i+1,1<<(k-i-1)])\n\nfor i in range(k-1):\n if L & 1<<i:\n mask = (1<<(k+1)) - (1<<(i+1))\n w = L & mask\n ans.append([1, k-i, w])\n\nprint(k, len(ans))\nfor i in ans:\n print(*i)", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\nconst ll mo=1000000007;\nll ans=0;\nll dp[0][0];\n\nint main()\n{\nll n;\ncin >> n;\nll bi[20]={};\nll max,sum,coun=0;\nrep(i,20){\n if(((n>>i)&1LL)==1){\n bi[i]++;\n max=i;\n coun++;\n }\n}\ncout << max+1<<' '<< max*2+coun-1<< endl;\nrep(i,max){\n cout << i+1<<' '<<i+2 <<' '<<'0'<< endl;\n cout << i+1<<' '<<i+2 << ' '<< (1<<i)<<endl;\n}\nsum=(1LL<<max);\nrep(i,max){\n if(bi[i]==1){\n cout << i+1<<' '<<max+1 <<' '<<sum<< endl;\n sum+=(1LL<<(i));\n }\n}\nreturn 0;\n}\n\n\n\n", "// practice with kaiboy\nimport java.io.*;\nimport java.util.*;\n\npublic class Main extends PrintWriter {\n\tMain() { super(System.out); }\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] $) {\n\t\tMain o = new Main(); o.main(); o.flush();\n\t}\n\n\tint[] ii = new int[60];\n\tint[] jj = new int[60];\n\tint[] ww = new int[60];\n\tint m;\n\tvoid add(int i, int j, int w) {\n\t\tii[m] = i; jj[m] = j; ww[m] = w; m++;\n\t}\n\tvoid main() {\n\t\tint l = sc.nextInt();\n\t\tint k = 0;\n\t\twhile (1 << k + 1 <= l)\n\t\t\tk++;\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tint j = i + 1;\n\t\t\tadd(i, j, 0);\n\t\t\tadd(i, j, 1 << i);\n\t\t}\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tif ((l & 1 << i) != 0)\n\t\t\t\tadd(i, k, l ^= 1 << i);\n\t\tprintln(k + 1 + \" \" + m);\n\t\twhile (m-- > 0)\n\t\t\tprintln((ii[m] + 1) + \" \" + (jj[m] + 1) + \" \" + ww[m]);\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int MOD=1e9+7;\nconst int INF=1e9;\n\nint main(){\n int l;\n cin>>l;\n if(l==2){\n cout<<\"2 2\\n1 2 0\\n1 2 1\"<<endl;\n return 0;\n }\n int n;\n for(int i=19;i>=0;i--){\n if((l-1)&(1<<i)){\n n=i+1;\n break;\n }\n }\n int m=n-1+n-1+1,t=1<<(n-1);\n vector<pair<int,int>> ans;\n for(int i=2;i<=n;i++){\n if((l-1)&(1<<(n-i))){\n ans.push_back({i,t});\n m++;\n t+=1<<(n-i);\n }\n }\n cout<<n<<\" \"<<m<<endl;\n for(int i=1;i<=n-1;i++){\n cout<<i<<\" \"<<i+1<<\" \"<<0<<endl;\n }\n for(int i=1;i<=n-1;i++){\n cout<<i<<\" \"<<i+1<<\" \"<<(1<<(n-i-1))<<endl;\n }\n for(auto p:ans){\n cout<<\"1 \"<<p.first<<\" \"<<p.second<<endl;\n }\n cout<<1<<\" \"<<n<<\" \"<<l-1<<endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nstruct f{\n\tint a,b,c;\n};\nint main(){\n\tint o;\n\tcin>>o;\n\tvector<f> e;\n\tint r=log2(o);\n\tint n=r+1;\n\tfor(int i=0;i<r;i++){\n\t\te.push_back(f{i+1,i+2,0});\n\t\te.push_back(f{i+1,i+2,1<<i});\n\t}\n\tint p=1<<r;\n\tfor(int i=r;i>=1 && o-p>0;i--){\n\t\tint w=1<<(i-1);\n\t\tif(o-p>=w){\n\t\t\to-=w;\n\t\t\te.push_back(f{i,n,o\t});\n\t\t}\n\t}\n\tcout<<n<<' '<<e.size()<<endl;\n\tfor(int i=0;i<e.size();i++)\n\tcout<<e[i].a<<' '<<e[i].b<<' '<<e[i].c<<endl;\n}", "#include <algorithm>\n#include <iostream>\n#include <cstring>\n#include <cstdio>\n#define ML 1000005\n\nusing namespace std;\n\nstruct EDGE\n{\n\tint u, v, w;\n\tEDGE (const int& nu = 0, const int& nv = 0, const int& nw = 0) : u(nu), v(nv), w(nw) {}\n} E[66];\nint N = 0, M = 0, L;\n\nint main()\n{\n\tint mxp = 0;\n\tscanf(\"%d\", &L);\n\tif(L == 1)\n\t{\n\t\tprintf(\"%d %d\\n%d %d %d\\n\", 2, 1, 1, 2, 0);\n\t\treturn 0;\n\t}\n\tfor(int i=19; i>=0; i--)\n\t\tif(L>>i & 1)\n\t\t{\n\t\t\tmxp = i;\n\t\t\tbreak;\n\t\t}\n\tN = mxp + 1;\n\tfor(int i=0; i<mxp; i++) E[++M] = EDGE(i+1, i+2, 1<<i), E[++M] = EDGE(i+1, i+2, 0);\n\tfor(int i=0; i<mxp; i++)\n\t\tif(L>>i & 1)\n\t\t\tE[++M] = EDGE(i+1, N, ((L>>i)^1)<<i);\n\t//E[++M] = EDGE(1, N, L);\n\tprintf(\"%d %d\\n\", N, M);\n\tfor(int i=1; i<=M; i++) printf(\"%d %d %d\\n\", E[i].u, E[i].v, E[i].w);\n\treturn 0;\n}", "#!usr/bin/env python3\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef LS():return [list(x) for x in sys.stdin.readline().split()]\ndef S(): return list(sys.stdin.readline())[:-1]\ndef IR(n):\n return [I() for i in range(n)]\ndef LIR(n):\n return [LI() for i in range(n)]\ndef SR(n):\n return [S() for i in range(n)]\ndef LSR(n):\n return [LS() for i in range(n)]\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n#A\ndef A():\n return\n\n#B\ndef B():\n return\n\n#C\ndef C():\n return\n\n#D\ndef D():\n l = I()\n l = list(map(int,bin(l)[2:]))\n n = len(l)\n ans = []\n for i in range(n-1):\n ans.append((i+1,i+2,0))\n ans.append((i+1,i+2,1<<i))\n w = (1<<(n-1))\n for i in range(1,n):\n if l[i]:\n x = n-i\n ans.append((x,n,w))\n w += (1<<(x-1))\n print(n,len(ans))\n for x,y,w in ans:\n print(x,y,w)\n return\n\n#E\ndef E():\n return\n\n#F\ndef F():\n return\n\n#G\ndef G():\n return\n\n#H\ndef H():\n return\n\n#Solve\nif __name__ == \"__main__\":\n D()\n", "import sys\n\n\nL=int(input())-1\nif L==1:\n print(2,2)\n print(1,2,0)\n print(1,2,1)\n sys.exit()\n\nM=0\nthreelist=[]\nj=1\ni=1\nwhile i<=10**6:\n i=3**j-1\n threelist.append(i)\n j+=1\n\n\nthreelist=threelist[::-1]\n\nj=0\nwhile True:\n if L>=threelist[j]:\n break\n else:\n j+=1\n\nnode=len(threelist)-j\n\nPATH=[]\nfor i in range(2,2+node):\n PATH.append((i,i+1,0))\n\n PATH.append((i,i+1,3**(node+2-i-1)))\n PATH.append((i,i+1,2*3**(node+2-i-1)))\n M+=3\n\nwhile L>0:\n j=0\n while True:\n if L>=threelist[j]:\n break\n else:\n j+=1\n\n k=len(threelist)-j\n rest=L-(3**k-1)\n\n PATH.append((1,node+2-k,rest))\n M+=1\n\n L=rest-1\n\n if L==0:\n PATH.append((1,node+2,0))\n M+=1\n break\n if L==1:\n PATH.append((1,node+2,0))\n PATH.append((1,node+2,1))\n M+=2\n break\n\nprint(node+2,M)\nfor pa in PATH:\n print(pa[0],pa[1],pa[2])\n", "from math import log2\nL=int(input())\nans=[]\ni=1\nwhile True:\n if 2**i>L:\n last=i\n break\n ans.append([i,i+1,2**(i-1)])\n ans.append([i,i+1,0])\n i+=1\n\"\"\"for i in ans:\n print(i)\nprint(last)\"\"\"\nnum=2**(last-1)\na=L-num\nwhile a>0:\n ans.append([int(log2(a))+1,last,num])\n num+=2**(int(log2(a)))\n a=L-num\nprint(last,len(ans))\nfor i in ans:\n print(*i)\n", "import math\nL = int(input())\nN = math.floor(math.log2(L))+1\nM = N*2-2\n\nadd_path = []\nfor i in range(1,N)[::-1]:\n if L-2**(i-1) >= 2**(N-1):\n add_path.append([i, L-2**(i-1)])\n L -= 2**(i-1)\n\nprint(N, M+len(add_path))\n[print(i, i+1, 2**(i-1)*j) for i in range(1,N) for j in range(2)]\n[print(i[0], N, i[1]) for i in add_path]", "#!/usr/bin/env python3\nimport sys\nfrom math import *\nfrom itertools import *\nfrom collections import *\nfrom functools import *\ntry:\n from math import gcd\nexcept Exception:\n from fractions import gcd\n\n\n\ndef solve(L: int):\n r = 0\n while (2 ** r) <= L:\n r += 1\n r -= 1\n\n edges = []\n nodes = list(range(1, r+2))\n for s, d in zip(nodes, nodes[1:]):\n edges.append((s, d, 0))\n edges.append((s, d, 2 ** (s - 1)))\n\n base = 2 ** r\n for n in list(reversed(nodes))[1:]:\n c = 2 ** (n - 1)\n if base <= (L - c):\n edges.append((n, nodes[-1], L - c))\n L -= c\n ret = ['{} {}'.format(r + 1, len(edges))] + ['{} {} {}'.format(s, d, c) for s, d, c in edges]\n return '\\n'.join(ret)\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n L = int(next(tokens)) # type: int\n result = solve(L)\n print(result)\n\nif __name__ == '__main__':\n main()\n", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint L = sc.nextInt();\n\n\t\tint lt = L;\n\t\tint N = getN(L)+1;\n\t\tSystem.out.print(N + \" \");\n\t\t\n\t\tList<String> map = new ArrayList<>();\n\n\n\t\tfor (int i = 1; i < N; i++) {\n\t\t\tmap.add(i + \" \" + (i + 1)+\" \"+ 0);\n\t\t\tmap.add(i + \" \" + (i + 1)+\" \"+ (1 << (i-1)));\n\t\t}\n\t\tif (lt!=(1<<(N-1)))\n\t\tfor (int i=getN(L);i>=1;i--) {\n\t\t\tif (lt - (1<<(i-1)) >=(1<<(getN(L)))) {\n\t\t\t\tmap.add(i + \" \" + N +\" \"+ (lt - (1<<(i-1))));\n\t\t\t\tlt -= (1<<(i-1));\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(map.size());\n\t\tfor (String key : map) {\n\t\t\tSystem.out.print(key);\n\t\t\tSystem.out.println();\n\t\t}\n\t}\n\n\tprivate static int getN(int l) {\n\t\tint i = 0;\n\t\twhile ((1 << i) <= l)\n\t\t\ti++;\n\t\treturn i-1;\n\t}\n}\n", "l = int(input())\n\nv_count = 1\nadditional_e = []\nwhile True:\n if l == 1:\n break\n elif l%2 == 0:\n l = l//2\n v_count += 1 \n elif l%2 == 1:\n l -= 1\n additional_e.append(v_count)\n\nprint(v_count, (v_count-1)*2 + len(additional_e))\n\nfor i in range(1,v_count):\n print(i, i+1, 0)\n print(i, i+1, 2**(i-1))\n\nnum = 2**(v_count-1)\n\nfor i in additional_e[::-1]:\n print(i, v_count, num)\n num = num + (2**(i-1))\n\n", "import math\n\nl = int(input()) - 1\nn = int(math.log2(l + 1) + 1)\nres = []\nfor i in range(n - 1):\n res.append([i + 1, i + 2, 0])\n res.append([i + 1, i + 2, 2 ** i])\ni = n - 2\nwhile l > 2 ** (n - 1) - 1:\n t = l - 2 ** i + 1\n if t > 2 ** (n - 1) - 1:\n res.append([i + 1, n, t])\n l = t - 1\n i -= 1\nprint(n, len(res))\nfor i in range(len(res)):\n print(res[i][0],res[i][1],res[i][2])\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int L; cin >> L;\n int N = 2, p = 2;\n while (p * 2 <= L) {\n N++;\n p *= 2;\n }\n int M = (N - 1) * 2 - 1;\n int l = L;\n while (l) {\n M += l % 2;\n l /= 2;\n }\n cout << N << \" \" << M << \"\\n\";\n\n p = L - p;\n l = L;\n for (int i = 1; i < N; i++) {\n cout << i << \" \" << i+1 << \" \" << 0 << \"\\n\";\n cout << i << \" \" << i+1 << \" \"<< (1 << i-1) << \"\\n\";\n if (1 << i - 1 & p) {\n l -= 1 << i-1;\n cout << i << \" \" << N << \" \" << l << \"\\n\";\n }\n }\n}", "import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint l = in.nextInt();\n\t\tin.close();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tString ls = System.lineSeparator();\n\t\tStack<Integer> stack = new Stack<>();\n\t\tint node = 0;\n\t\tint edge = 0;\n\t\twhile(l>0) {\n\t\t\tstack.add(l&1);\n\t\t\tl = l>>1;\n\t\t}\n\t\tnode = stack.size();\n\t\tint num = node;\n\t\tint sum = 0;\n\t\tstack.pop();\n\t\tsum += pow2(num-1);\n\t\twhile(!stack.isEmpty()) {\n\t\t\tnum--;\n\t\t\tsb.append(num + \" \" + (num+1) + \" \" + 0 + ls);\n\t\t\tsb.append(num + \" \" + (num+1) + \" \" + pow2(num-1) + ls);\n\t\t\tedge += 2;\n\t\t\tif(stack.pop()==1) {\n\t\t\t\tsb.append(num + \" \" + node + \" \" + sum + ls);\n\t\t\t\tsum += pow2(num-1);\n\t\t\t\tedge += 1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(node + \" \" + edge);\n\t\tSystem.out.println(sb.toString());\n\t}\n\t\n\tpublic static int pow2(int exp) {\n\t\tint ans = 1;\n\t\tfor(int i=0;i<exp;i++) {\n\t\t\tans *= 2;\n\t\t}\n\t\treturn ans;\n\t}\n\n}\n", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rrep(i, n) for (int i = n - 1; i >= 0; i--)\nusing namespace std;\n#define INF ((1<<30)-1)\n#define LINF (1LL<<60)\n#define EPS (1e-10)\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst int MOD = 1000000007;\nconst int MOD2 = 998244353;\n\n// ref : https://drken1215.hatenablog.com/entry/2018/09/02/020500\n\nint main(){\n ll l;\n cin >> l;\n ll n = 0, p = 1;\n while(p <= l) {\n p *= 2;\n n++;\n }\n ll m = (n - 1) * 2 + __builtin_popcount(l) - 1;\n\n cout << n << \" \" << m << endl;\n rep(i, n-1) {\n cout << i+1 << \" \" << i+2 << \" \" << 0 << endl;\n cout << i+1 << \" \" << i+2 << \" \" << (1ll<<i) << endl;\n }\n \n ll now = 1<<(n-1);\n\n rrep(i, n-1){\n if (l & (1<<i)) {\n cout << i+1 << \" \" << n << \" \" << now << endl;\n now += (1ll<<i);\n }\n }\n return 0;\n}\n", "L = int(input())\n\np = 0\nans = []\nwhile(L >= 2 ** (p + 1)):\n ans.append([p + 1, p + 2, 2 ** p])\n ans.append([p + 1, p + 2, 0])\n p += 1\n\nendN = p + 1\n\ntmp = 2 ** p\nL -= tmp\n\nwhile(L != 0):\n p = 0\n while(L - 2 ** p >= 0):\n p += 1\n\n ans.append([p, endN, tmp])\n L -= 2 ** (p - 1)\n tmp += 2**(p - 1)\n\n# print(p, ans)\n\nprint(endN, len(ans))\nfor a, b, c in ans:\n print(a, b, c)", "# -*- coding: utf-8 -*-\n\n\"\"\"\nちょっと編集\n・残り調べるとこ、ビットシフトにしてみた。この方が前からいけるしいいかな。\n\"\"\"\n\nL = int(input())\n\n# 2べきで表せる基本部分を作る\nedges = []\n# baseは基本部分の守備範囲\nv = base = 1\nwhile base * 2 <= L:\n edges.append([v, v+1, 0])\n edges.append([v, v+1, base])\n base *= 2\n v += 1\n# ゴールの頂点\nend = edges[-1][1]\n# 残りがいくつか\nrest = L - base\n# 残りを2べきに分割\nfor i in range(19):\n if rest >> i & 1:\n num = 2 ** i\n # ちょうどいい位置(ここより手前で2**iまでを網羅)にバイパスを作る感じ\n edges.append([i+1, end, L-rest])\n rest -= num\nprint(v, len(edges))\nfor i in range(len(edges)):\n print(*edges[i])\n", "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n int l;\n cin >> l;\n\n int n = 20;\n vector<vector<int>> ret;\n for (int i = 2; i < n; i++) {\n ret.push_back({i, i + 1, 0});\n ret.push_back({i, i + 1, 1 << n - 1 - i});\n }\n\n for (int i = 2; i <= n; i++) {\n int x = 1 << n - i;\n while (l >= x) {\n ret.push_back({1, i, l - x});\n l -= x;\n }\n }\n\n cout << n << \" \" << ret.size() << endl;\n for (auto edge:ret) cout << edge[0] << \" \" << edge[1] << \" \" << edge[2] << endl;\n return 0;\n}", "import sys\nimport math\n\ninput_methods=['clipboard','file','key']\nusing_method=1\ninput_method=input_methods[using_method]\n\ntin=lambda : map(int, input().split())\nlin=lambda : list(IN())\nmod=1000000007\n\n#+++++\n\ndef main():\n\tL = int(input())\n\t#b , c = tin()\n\t#s = input()\n\tv = int(math.log2(L))\n\t#pa(v)\n\tnum_p = v\n\tpath_info=[]\n\tfor i in range(v):\n\t\tpath_info.append([i,i+1,0])\n\t\tpath_info.append([i,i+1,2**i])\n\t\n\t#for li in path_info:\n\t#\tprint(*li)\n\t\n\tnokori = L - (2 ** v)\n\t\n\t#print(nokori)\n\tfor i in range(v+1):\n\t\tm = v - i\n\t\tif 2 ** m <= nokori:\n\t\t\tpath_info.append([m, v, L - nokori])\n\t\t\tnokori -= 2 ** m\n\tprint(v+1, len(path_info))\n\tfor l in path_info:\n\t\tf,t,w = l\n\t\tprint(*[f+1, t+1, w])\n\t\n\t\n#+++++\nisTest=False\n\ndef pa(v):\n\tif isTest:\n\t\tprint(v)\n\t\t\ndef input_clipboard():\n\timport clipboard\n\tinput_text=clipboard.get()\n\tinput_l=input_text.splitlines()\n\tfor l in input_l:\n\t\tyield l\n\nif __name__ == \"__main__\":\n\tif sys.platform =='ios':\n\t\tif input_method==input_methods[0]:\n\t\t\tic=input_clipboard()\n\t\t\tinput = lambda : ic.__next__()\n\t\telif input_method==input_methods[1]:\n\t\t\tsys.stdin=open('inputFile.txt')\n\t\telse:\n\t\t\tpass\n\t\tisTest=True\n\telse:\n\t\tpass\n\t\t#input = sys.stdin.readline\n\t\t\t\n\tret = main()\n\tif ret is not None:\n\t\tprint(ret)\n", "#include <bits/stdc++.h>\n//#include <atcoder/all>\n#define ll long long int\n#define MOD 1000000007\n#define P pair<ll,ll>\n#define INF 1000000000000000000\n\n//using namespace atcoder;\nusing namespace std;\n\nint main(void){\n ll l;\n cin >> l;\n \n ll n = 0;\n while ((1 << n) <= l){\n n++;\n }\n vector<tuple<ll,ll,ll>> m(0);\n for (ll i = 0; i < n-1; i++){\n m.emplace_back(make_tuple(i+1, i+2, 0));\n m.emplace_back(make_tuple(i+1, i+2, (1LL << i)));\n }\n ll t = l % (1LL << (n-1));\n\n ll k = 0;\n for (ll i = 0; i < n; i++){\n if ((t >> i) & 1){\n k |= (1 << i);\n m.emplace_back(make_tuple(i+1, n, (1LL << (n-1)) + t - k));\n }\n }\n cout << n << \" \" << m.size() << endl;\n for (auto p : m){\n ll u = get<0>(p);\n ll v = get<1>(p);\n ll w = get<2>(p);\n\n cout << u << \" \" << v << \" \" << w << endl;\n }\n\n\n return 0;\n}\n", "def getN():\n return int(input())\ndef getNM():\n return map(int, input().split())\ndef getList():\n return list(map(int, input().split()))\ndef getArray(intn):\n return [int(input()) for i in range(intn)]\ndef input():\n return sys.stdin.readline().rstrip()\ndef rand_N(ran1, ran2):\n return random.randint(ran1, ran2)\ndef rand_List(ran1, ran2, rantime):\n return [random.randint(ran1, ran2) for i in range(rantime)]\ndef rand_ints_nodup(ran1, ran2, rantime):\n ns = []\n while len(ns) < rantime:\n n = random.randint(ran1, ran2)\n if not n in ns:\n ns.append(n)\n return sorted(ns)\n\ndef rand_query(ran1, ran2, rantime):\n r_query = []\n while len(r_query) < rantime:\n n_q = rand_ints_nodup(ran1, ran2, 2)\n if not n_q in r_query:\n r_query.append(n_q)\n return sorted(r_query)\n\nfrom collections import defaultdict, deque, Counter\nfrom sys import exit\nfrom decimal import *\nimport heapq\nfrom math import sqrt, pi\nfrom fractions import gcd\nimport random\nimport string\nimport copy\nfrom itertools import combinations, permutations, product\nfrom operator import mul, itemgetter\nfrom functools import reduce\nfrom bisect import bisect_left, bisect_right\n\nimport sys\nsys.setrecursionlimit(1000000000)\nmod = 10 ** 9 + 7\n\n#############\n# Main Code #\n#############\n\nL = int(input())\n\nLstr = bin(L)[2:]\n\nN = len(Lstr)\nM = (N - 1) * 2 + (Lstr.count(\"1\") - 1)\n\nprint(N, M)\nc = 1\nfor i in range(1, N):\n print(i, i + 1, c)\n print(i, i + 1, 0)\n c *= 2\n\nc = 2 ** (N - 1)\nfor i, v in enumerate(Lstr[::-1]):\n if i == N - 1:\n continue\n if v == \"1\":\n print(i + 1, N, c)\n c += 2 ** i", "# from https://atcoder.jp/contests/abc108/submissions/4342595\nimport math\n\n\ndef main():\n l = int(input())\n n = math.floor(math.log2(l)) + 1\n e = []\n for v in range(n-1):\n v2 = 2 ** v\n e.append([v + 1, v + 2, 0])\n e.append([v + 1, v + 2, v2])\n if (l >> v) & 1:\n e.append([v + 1, n, l - v2])\n l -= v2\n print(n, len(e))\n for x in e:\n print(*x)\n\n\nmain()\n", "#import math\nL = int(input())\n#r = math.floor(math.log2(L))\nr = L.bit_length()-1\nN = r+1\ngraph = []\nappend = graph.append\nfor i in range(1,r+1):\n append([i,i+1,0])\n append([i,i+1,2**(i-1)])\n\nfor t in range(N-1,0,-1):\n if L-2**(t-1) >= 2**r:\n append([t,N,L-2**(t-1)])\n L -= 2**(t-1)\n\nprint(N,len(graph))\nfor g in graph:\n print(*g)\n", "#encdong utf-8\n\nl = int(input())\n\n#最大の２のn乗\nfor i in range(21):\n if 2**i >l:\n n = i\n break\n\nm = (n-1)*2\n\ns = l-2**(n-1)\nvalue = 2**(n-1)\n\npath_add = [0 for i in range(n-1)]\npath_add_value = [0 for i in range(n-1)]\n\nfor i in range(n-1):\n if s >= 2**(n-2-i):\n s -= 2**(n-2-i)\n path_add[-(i+1)] = 1\n path_add_value[-(i+1)]=value\n value += 2**(n-2-i)\n\nprint(n,m+sum(path_add))\nfor i in range(n-1):\n print(i+1,i+2,0)\n print(i+1,i+2,2**i)\n\nfor i in range(n-1):\n if path_add[i] == 1:\n print(i+1, n, path_add_value[i])", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef unsigned long long ull;\n\nvector<int> getBit(int n){\n\tvector<int> ret;\n\twhile(n){\n\t\tret.push_back(n&1);\n\t\tn >>= 1;\n\t}\n\treverse(ret.begin(), ret.end());\n\treturn ret;\n}\n\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(NULL);\n\tcout.tie(NULL);\n\tcout<<setprecision(32);\n\n\tint l;\n\tcin>>l;\n\tif(l == 2){\n\t\tcout<<\"2 2\\n1 2 0\\n1 2 1\\n\";\n\t\texit(0);\n\t}\n\tvector<int> bit = getBit(l - 1);\n\tint n = bit.size();\n\tvector<pair<int, pair<int, int> > >edges;\n\tfor(int i = n - 1; i >= 1; i--){\n\t\tedges.push_back({0, {i, i + 1}});\n\t\tedges.push_back({1<<(n - 1 - i), {i, i + 1}});\n\t}\n\tfor(int i = 2; i <= n; i++){\n\t\tint val = (l-1)>>(n - i);\n\t\tif(val&1){\n\t\t\tedges.push_back({(val>>1)<<(n - i + 1), {1, i}});\n\t\t}\n\t}\n\tedges.push_back({l - 1, {1, n}});\n\tcout<<n<<\" \"<<edges.size()<<'\\n';\n\tfor(auto pp : edges){\n\t\tcout<<pp.second.first<<\" \"<<pp.second.second<<\" \"<<pp.first<<'\\n';\n\t}\n\n\treturn 0;\n}", "from math import log2\n\n\nL = int(input())\nr = int(log2(L))\nN = r + 1\nedge = []\nfor i in range(r):\n edge.append((i + 1, i + 2, 2 ** i))\n edge.append((i + 1, i + 2, 0))\nfor t in range(N - 1, 0, -1):\n s = L - 2 ** (t - 1)\n if s >= 2 ** r:\n edge.append((t, N, s))\n L = s\n\nprint(N, len(edge))\nfor e in edge:\n print(*e)\n", "L = int(input())\nn = L.bit_length()\nans = []\nfor i in range(1,n):\n ans.append((i,i+1,0))\n ans.append((i,i+1,2**(n-i-1)))\nbinL = bin(L)\nfor i in range(1,n):\n if binL[i+2] == \"1\":\n mask = int(binL[:i+2],2)<<(n-i)\n ans.append((1,i+1,L&mask))\nprint(n,len(ans))\nfor edge in ans:\n print(*edge)", "import sys,collections as cl,bisect as bs\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9+7\nMax = sys.maxsize\ndef l(): #intのlist\n\treturn list(map(int,input().split()))\ndef m(): #複数文字\n\treturn map(int,input().split())\ndef onem(): #Nとかの取得\n\treturn int(input())\ndef s(x): #圧縮\n\ta = []\n\tif len(x) == 0:\n\t\treturn []\n\taa = x[0]\n\tsu = 1\n\tfor i in range(len(x)-1):\n\t\tif aa != x[i+1]:\n\t\t\ta.append([aa,su])\n\t\t\taa = x[i+1]\n\t\t\tsu = 1\n\t\telse:\n\t\t\tsu += 1\n\ta.append([aa,su])\n\treturn a\ndef jo(x): #listをスペースごとに分ける\n\treturn \" \".join(map(str,x))\ndef max2(x): #他のときもどうように作成可能\n\treturn max(map(max,x))\ndef In(x,a): #aがリスト(sorted)\n k = bs.bisect_left(a,x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\ndef pow_k(x, n):\n ans = 1\n while n:\n if n % 2:\n ans *= x\n x *= x\n n >>= 1\n return ans\n\n\"\"\"\ndef nibu(x,n,r):\n\tll = 0\n\trr = r\n\twhile True:\n\t\tmid = (ll+rr)//2\n\n\tif rr == mid:\n\t\treturn ll\n\tif (ここに評価入れる):\n\t\trr = mid\n\telse:\n\t\tll = mid+1\n\"\"\"\n\nn = onem()\nnn = n\nN = 1\nco = 0\nwhile True:\n\tN *= 2\n\tif n < N:\n\t\tbreak\n\tco += 1\n\tif co > 19:\n\t\tbreak\n\ndata = []\n\nap = 1\nfor i in range(1,co+1):\n\tdata.append([i,i+1,0])\n\tdata.append([i,i+1,ap])\n\tap *= 2\nfor i in range(co,-1,-1):\n\tif n - pow(2,i) >= pow(2,co):\n\t\tdata.append([i+1,co+1,n-pow(2,i)])\n\t\tn -= pow(2,i)\nprint(co+1,len(data))\nfor i in range(len(data)):\n\tprint(jo(data[i]))", "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename T>\nvoid out(T x) { cout << x << endl; exit(0); }\n#define watch(x) cout << (#x) << \" is \" << (x) << endl\n\n\n\n\ntypedef long long ll;\nconst ll mod = 1e9+7;\nconst int maxn = 1e6 + 5;\n\n\nint L;\n\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n cin>>L;\n\n int hi=0;\n\n const int N = 20;\n\n\n vector<pair<int,int>> v;\n\n for (int i=2; i<=N; i++) {\n\tint ways = 1<<(N-i);\n\twhile (hi+ways<=L) {\n\t v.push_back({i, hi});\n\t hi += ways;\n\t}\n }\n\n\n int nodes = N;\n int edges = (N-2)*2 + (int)v.size();\n\n cout<<nodes<<\" \"<<edges<<\"\\n\";\n\n for (int i=2; i<N; i++) {\n\tint wei = 1<<(N-1-i);\n\tcout<<i<<\" \"<<i+1<<\" \"<<wei<<\"\\n\";\n\tcout<<i<<\" \"<<i+1<<\" \"<<0<<\"\\n\";\n }\n\n\n for (auto ed: v) {\n\tcout<<1<<\" \"<<ed.first<<\" \"<<ed.second<<\"\\n\";\n }\n\n\n return 0;\n}\n", "L = int(input())\nb = format(L, 'b')\nn = len(b)\nm = 2 * (n - 1) + b.count('1') - 1\nprint(n, m)\nfor i in range(1, n):\n print(i, i + 1, 0)\n print(i, i + 1, 2 ** (i - 1))\nw = 2 ** (n - 1)\nfor j in range(20,-1,-1):\n if (L - w) >> j & 1:\n print(j + 1, n, w)\n w += 2 ** j", "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct edge {\n int from;\n int to;\n int len;\n};\n\nint main() {\n int l;\n cin >> l;\n int r = 0;\n for ( int i = 1; i*2 <= l; i*=2 ) { r++; }\n int r2 = 1 << r;\n if ( r > 19 ) { r = 19; }\n\n int n = r+1;\n vector<edge> es;\n for ( int i = 1; i < n; i++ ) {\n edge t;\n t.from = i;\n t.to = i+1;\n t.len = 0;\n es.push_back(t);\n t.len = 1 << (i-1);\n es.push_back(t);\n }\n\n for ( int i = n-1; i >= 1; i-- ) {\n int s = l - (1 << (i-1));\n if ( s < r2 ) { continue; }\n edge t;\n t.from = i;\n t.to = n;\n t.len = s;\n es.push_back(t);\n l = s;\n }\n\n\n cout << n << ' ' << es.size() << endl;\n for ( int k = 0; k < es.size(); k++ ) {\n cout << es[k].from << ' ' << es[k].to << ' ' << es[k].len << endl;\n } \n return 0;\n}\n", "#include<stdio.h>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\n#include<bitset>\n#include<vector>\n#include<math.h>\n#define ls(x) (x<<1)\n#define rs(x) ((x<<1)|1)\n#define ll long long\nusing namespace std;\nint l;\nstruct nod\n{\n int to,val;\n};\nvector<nod>g[25];\nint main()\n{\n int n=0,m=-1;\n scanf(\"%d\",&l);\n int x=l;\n while(x)\n {\n n++;\n if(x&1)m++;\n x>>=1;\n }\n m+=2*(n-1);\n for(int i=1;i<n;i++)\n {\n g[i].push_back((nod){i+1,0});\n g[i].push_back((nod){i+1,1<<(n-i-1)});\n }\n int sum=(1<<(n-1))-1;\n for(int i=n-2;i>=0;i--)\n {\n if((1<<i)&l)\n {\n g[1].push_back((nod){n-i,sum+1});\n sum+=(1<<i);\n }\n }\n printf(\"%d %d\\n\",n,m);\n for(int i=1;i<n;i++)\n {\n for(int j=0;j<g[i].size();j++)\n {\n printf(\"%d %d %d\\n\",i,g[i][j].to,g[i][j].val);\n }\n }\n}\n", "#include <iostream>\n#include <cstring>\n#include <limits.h>\n#include <algorithm>\n#include <math.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n\nint main(void){\n int l, b = 1, cnt = 0;\n vector<int> u, v, w;\n cin >> l;\n \n while (b <= l) {\n b *= 2; cnt++;\n }\n for (int i = 1; i <= cnt - 1; i++) {\n u.push_back(i); v.push_back(i + 1); w.push_back(pow(2, i - 1));\n u.push_back(i); v.push_back(i + 1); w.push_back(0);\n }\n l -= b / 2;\n int n = cnt, k = b / 2;\n \n while (l != 0) {\n cnt = 0;\n b = 1;\n while (b <= l) {\n b *= 2; cnt++;\n }\n u.push_back(cnt); v.push_back(n); w.push_back(k);\n k += b / 2;\n l -= b / 2;\n }\n \n \n cout << n << \" \" << u.size() << endl;\n for (int i = 0; i < u.size(); i++) cout << u[i] << \" \" << v[i] << \" \" << w[i] << endl;\n}\n", "n = int(input())\nans = []\ncount = 1\ntwo = 1\nfor i in range(20):\n if two*2 <= n:\n count += 1\n ans.append([count-1,count,0])\n ans.append([count-1,count,two])\n two *= 2\n else:\n break\n\nfor i in range(count,0,-1):\n if n - pow(2,i-1) >= two:\n \n ans.append([i,count,n-pow(2,i-1)])\n n -= pow(2,i-1)\nprint(count,len(ans))\nfor i in ans:\n print(*i)\n", "l=int(input())\nn=len(bin(l-1))-2 #頂点数\nV=[]\nif all([(l-1)>>i&1 for i in range(n)]):\n n+=1\n for i in range(n-1):\n V.append([i+1,i+2,0])\n V.append([i+1,i+2,2**(n-i-2)])\n\n\nelse:\n for i in range(n-1):\n V.append([i+1,i+2,0])\n V.append([i+1,i+2,2**(n-i-2)])\n\n now=2**(n-1)\n for i in range(n-2):\n if (l-1)>>(n-i-2)&1:\n V.append([1,i+2,now])\n now+=2**(n-i-2)\n if (l-1)&1:\n V.append([1,n-1,now])\n else:\n V.append([1,n,now])\nprint(n,len(V))\nfor v in V:\n print(*v)", "L = int(input())\n\nr = 0\nwhile 2 ** (r + 1) <= L:\n r += 1\n \nN = r + 1\nedges = []\nfor i in range(1, N):\n edges.append([i, i + 1, 0])\n edges.append([i, i + 1, 2 ** (i - 1)])\n \nfor t in reversed(range(1, N)):\n if L - 2 ** (t - 1) >= 2 ** r:\n edges.append([t, N, L - 2 ** (t - 1)])\n L -= 2 ** (t - 1)\n \nprint(N, len(edges))\nfor v in edges:\n print(*v)\n\n", "from itertools import dropwhile\nl=int(input())\nk=[(l>>i & 1) for i in range(20)][::-1]\nk=list(dropwhile(lambda x:x==0,k))\n#print(k)\nn=len(k)\npath=[]\nfor i in range(n-1):\n path.append((i+1,i+2,0))\n path.append((i+1,i+2,2**i))\n\npath_len=2**(n-1)\nfor i in range(1,n):\n if k[i]:\n x=n-1-i\n path.append((x+1,n,path_len))\n path_len+=(2**x)\n\nm=len(path)\nprint(n,m)\nfor i in path:\n print(i[0],i[1],i[2])", "#include <cstdio>\nusing namespace std;\nint a[300],b[300],c[300];\nint m;\nvoid push(int aa,int bb,int cc){\n m++;\n a[m]=aa;\n b[m]=bb;\n c[m]=cc;\n}\nint main() {\n int L;\n scanf(\"%d\",&L);\n L--;\n int x=1,n=20;\n while(L>=0){\n if (L==0){\n if (x<n)\n push(x,n,0);\n break;\n }\n if (L==1){\n push(x,n,0);\n push(x,n,1);\n break;\n }\n if (L%2==0)\n push(x,n,L);\n L=(L+1)/2;\n push(x,x+1,0);\n push(x,x+1,L);\n L--;\n x++;\n }\n printf(\"%d %d\\n\",n,m);\n for (int i=1;i<=m;i++)\n printf(\"%d %d %d\\n\",a[i],b[i],c[i]);\n return 0;\n}\n", "L = int(input())\n\npaths = []\nn = 2\nv = 1\nwhile n <= L:\n paths.append((v, v+1, 0))\n paths.append((v, v+1, n//2))\n v += 1\n n *= 2\nn //= 2\n\nvlast = v\nnn = n\nll = L - n\n\nwhile ll > 0:\n if ll >= n:\n paths.append((v, vlast, nn))\n ll -= n\n nn += n\n n //= 2\n v -= 1\n\nprint(vlast, len(paths))\nfor e in paths:\n print(*e)\n", "#include <bits/stdc++.h>\n \n#define int long long\n \n#define REP(i,n) for(int i=0;i<n;i++)\n#define FOR(i,m,n) for(int i=m;i<n;i++)\n#define FORR(i,m,n) for(int i=m;i>=n;i--)\n#define pb(x) push_back(x)\n#define mp(x, y) make_pair(x, y) \n#define SORT(x) sort((x).begin(),(x).end())\n#define INF 99999999999\n#define MOD (int)(1e9)+7\n \nusing namespace std;\n \nint dy[4]={1, 0, -1, 0};\nint dx[4]={0, 1, 0, -1};\n \nint32_t main(){\n int l;\n cin >> l;\n \n int r=0;\n while((1 << r+1) <= l) r++;\n\n int n = r+1;\n cout << n << \" \";\n\n vector<int> fr, to, len;\n REP(i, r){\n fr.pb(i+1);\n to.pb(i+2);\n len.pb(0);\n\n fr.pb(i+1);\n to.pb(i+2);\n len.pb(1 << i);\n }\n\n for(int i=n-1; i>0; i--){\n if(l-(1 << (i-1))>=(1 << r)){\n fr.pb(i);\n to.pb(n);\n len.pb(l-(1 << (i-1)));\n l-=(1 << (i-1));\n }\n }\n\n cout << fr.size() << endl;\n REP(i, fr.size()){\n cout << fr[i] << \" \" << to[i] << \" \" << len[i] << endl;\n }\n}", "L = int(input())\nN = len(bin(L)[2:])\nR = 1 << N - 1\nUVW = sum([[(i, i+1, 0), (i, i+1, 1<<i-1)] for i in range(1, N)], [])\nfor i, s in enumerate(bin(L)[:2:-1], 1):\n if s == \"1\":\n UVW.append((i, N, R))\n R += 1 << i - 1\n\nprint(N, len(UVW))\nfor t in UVW:\n print(*t)", "#include <iostream>\n#include <iomanip>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <queue>\n#include <numeric>\n#include <random>\n#include <algorithm>\n#include <functional>\n\nusing namespace std;\ntypedef long long ll;\n\nconst int INF = (1 << 30) - 1;\nconst ll INFLL= (1LL << 61) - 1;\nconst int MOD = 1000000007;\n#define ALL(a) (a).begin(),(a).end()\n#define rALL(a) (a).rbegin(),(a).rend()\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int L;\n cin>>L;\n int r=0,tmp=1;\n while(2*tmp<=L){\n tmp*=2;r++;\n }\n vector<tuple<int,int,int>> ans;\n REP(i,r){\n ans.emplace_back(i+1,i+2,1<<i);\n ans.emplace_back(i+1,i+2,0);\n }\n\n for(int i=r;i>=1;i--){\n if(L-(1<<(i-1))>=(1<<r)){\n ans.emplace_back(i,r+1,L-(1<<(i-1)));\n L-=(1<<(i-1));\n }\n }\n\n cout<<r+1<<' '<<ans.size()<<endl;\n for(auto e:ans){\n cout<<get<0>(e)<<' '<<get<1>(e)<<' '<<get<2>(e)<<endl;\n }\n}\n", "#!usr/bin/env python3\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5)\nstdin = sys.stdin\ndef LI(): return list(map(int, stdin.readline().split()))\ndef LF(): return list(map(float, stdin.readline().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\ndef II(): return int(stdin.readline())\ndef IF(): return float(stdin.readline())\ndef LS(): return list(map(list, stdin.readline().split()))\ndef S(): return list(stdin.readline().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\n\n#A\ndef A():\n n = II()\n a = n // 2\n b = n - a\n print(a*b)\n return\n\n#B\ndef B():\n x1, y1, x2, y2 = LI()\n a = x2 - x1\n b = y2 - y1\n print(x2 - b, y2 + a, x1 - b, y1 + a)\n return\n\n#C\ndef C():\n n, k = LI()\n if k % 2:\n print((n // k)** 3)\n else:\n print(int((n//k)**3 + ((n-k/2)//k+1)**3))\n \n return\n\n# D\n# 解説AC\n# a→bの辺に関していえばこの辺を2辺張ってしまえば2*n本で\n# 2^n個のパスの組み合わせができることに気づけなかった\n# i→i+1へ辺を出して長さは0 or 1<<i-1の辺を張ることで\n# 和のi番目のbitを立たせるかを選ばせることができる\n# さらに、Lのi番目のbitが立っているときにi番目のbitを立たせる\n# もしくは最上位のbitを立たせてかつ、そのbitを除くi番目より上位の\n# 立っているbitすべてを立たせたものの和を辺の長さとして辺を張ることで\n# 解が得られる（はず）\ndef D():\n l = II()\n lBit = bin(l)[:1:-1]\n #print(lBit)\n n = len(lBit)\n ans = []\n for i in range(1, n):\n ans += [(i, i + 1, 0)] + [(i, i + 1, 1 << i - 1)]\n b = 1 << n - 1\n for i in range(n - 1):\n if lBit[-2 - i] == \"1\":\n ans += [(n - i - 1, n, b)]\n b += 1 << (n - i - 2)\n print(n,len(ans))\n for a in ans:\n print(*a)\n return\n\n\n#Solve\nif __name__ == '__main__':\n D()\n", "L = int(input())\n\nN = len(bin(L)[2:])\nM = 2*(N-1) + bin(L)[3:].count(\"1\")\nprint(N, M)\n\nfor i in range(1, N):\n print(i, i+1, 0)\n print(i, i+1, 2**(i-1))\n\ntemp = L\nfor i in range(1, N):\n if bin(L)[-i] == \"1\":\n print(i, N, temp-2**(i-1))\n temp -= 2**(i-1)", "L = int(input())\nA, N, D = [(1<<i) for i in range(21)], L.bit_length(), []\nfor i in reversed(range(1,N)):\n D += [(i,i+1,0),(i,i+1,A[N-1-i])]\nP = A[N-1]\nfor i in range(2,N+1):\n s = N-i\n if (L>>s)&1==1:\n D += [(1,i,P)]\n P += A[s]\nprint(N,len(D))\nfor x,y,c in D:\n print(x,y,c)", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nvector<tuple<int,int,int>> q;\n\nint main() {\n\tint l;\n\tcin >> l;\n\tint ncnt = 1;\n\twhile (pow(2,ncnt)-1 < l) {\n\t\tncnt++;\n\t}\n\tint node[ncnt];\n\tfor (int i;i < ncnt;i++) {\n\t\tnode[i] = pow(2,i) - 1;\n\t\tif (i != ncnt-1) {\n\t\t\tq.push_back(make_tuple(i+1,i+2,0));\n\t\t\tq.push_back(make_tuple(i+1,i+2,pow(2,i)));\n\t\t}\n\t}\n\tint nmax = node[ncnt-1] + 1;\n\tfor (int i = ncnt - 1;i >= 0;i--) {\n\t\tif (node[i] + nmax < l) {\n\t\t\tq.push_back(make_tuple(i+1,ncnt,nmax));\n\t\t\tif (node[i] + nmax == l - 1) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnmax += node[i] + 1;\n\t\t}\n\t}\n\tcout << ncnt << \" \" << q.size() << endl;\n\tfor (int i = 0;i < q.size();i++) {\n\t\tcout << get<0>(q[i]) << \" \" << get<1>(q[i]) << \" \" << get<2>(q[i]) << endl;\n\t}\n}", "#include <iostream>\n#include <cstring>\n\nusing namespace std;\n\nint main() {\n int l;\n cin >> l;\n\n int tl = l;\n int dl = 0;\n bool te[20];\n int ce = 0;\n memset(te, 0, sizeof(te));\n while (l) {\n if (l & 1) {\n te[dl] = true;\n ce++;\n }\n l >>= 1;\n dl++;\n }\n cout << dl << \" \" << (dl-1)*2+ce-1 << endl;\n l = tl;\n int t = 1;\n for (int i = 1; i < dl; i++) {\n cout << i << \" \" << i+1 << \" \" << 0 << endl;\n cout << i << \" \" << i+1 << \" \" << t << endl;\n if (te[i-1]) {\n cout << i << \" \" << dl << \" \" << l - t << endl;\n l -= t;\n }\n t <<= 1;\n }\n\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Edge {\n int from, to, cost;\n};\n\nint main() {\n int l;\n cin >> l;\n int r = log2(l);\n vector<Edge> edges;\n int n = r + 1;\n for (int i = 0; i < r; i++) {\n edges.push_back(Edge{i + 1, i + 2, 0});\n edges.push_back(Edge{i + 1, i + 2, 1 << i});\n }\n int pow_r = 1 << r;\n for (int i = r; i >= 1 && l - pow_r > 0; i--) {\n int pow_i = 1 << (i - 1);\n if (l - pow_r >= pow_i) {\n l -= pow_i;\n edges.push_back(Edge{i, n, l});\n }\n }\n\n cout << n << \" \" << edges.size() << endl;\n for (Edge e : edges) cout << e.from << \" \" << e.to << \" \" << e.cost << endl;\n return 0;\n}\n", "import math\n\nL = int(input())\nn = int(math.log2(L))\n\ndag = []\nfor i in range(1, n+1):\n dag.append(' '.join(map(str, [i, i+1, 2**(i-1)])))\n dag.append(' '.join(map(str, [i, i+1, 0])))\n\nfor i in range(n, 0, -1):\n if L - 2**(i-1) >= 2**n:\n L -= 2**(i-1)\n dag.append(' '.join(map(str, [i, n+1, L])))\n\nprint(n+1, len(dag))\nprint('\\n'.join(dag))\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct data {\n long long from, to, dis;\n};\n\nlong long x, n = 0;\nvector<data> v;\n\nvoid solve();\n\nint main() {\n cin >> x;\n solve();\n cout << n << \" \" << v.size() << endl;\n for(int i = 0; i < v.size(); ++i)\n cout << v[i].from + 1 << \" \" << v[i].to + 1 << \" \"\n << v[i].dis << endl;\n return 0;\n}\n\nvoid solve() {\n long long now = 0;\n while(1LL << (n + 1) <= x) ++n;\n for(int i = 0; i < n; ++i) {\n v.push_back({i, i + 1, 1 << i});\n v.push_back({i, i + 1, 0});\n }\n x -= (1LL << n);\n ++n;\n now = 1LL << (n - 1);\n for(int i = n - 2; i >= 0; --i)\n if(1LL << i <= x) {\n v.push_back({i, n - 1, now});\n x -= 1LL << i;\n now += 1LL << i;\n }\n}", "#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nint L;\nint M;\nint main(void) {\n\n\tcin >> L;\n\n\tint N = 1;\n\tint num = 1;\n\tfor (;; N++) {\n\t\tnum *= 2;\n\t\tif (num > L) { break; }\n\t}\n\t\n\n\tcout << N ;\n\n\t//==================== M\n\tM = 2 * (N - 1);\n\n\tint A = L - num / 2;\n\n\twhile (A) {\n\t\tint j = 0;\n\t\tint m = 1;\n\t\tfor (;; j++) {\n\t\t\tif (m <= A && A <2 * m) { break; }\n\t\t\tm *= 2;\n\t\t}\n\t\t//cout << \"j= \" << j << endl;\n\t\tM++;\n\t\tA -= pow(2, j);\n\t}\n\n\n\tcout <<\" \" <<M << endl;\n\t//=============================\n\n\n\tfor (int i = 1; i <= N - 1; i++) {\n\t\tcout << i << \" \" << i + 1 << \" \" << 0 << endl;\n\t}\n\n\tint w = 1;\n\tfor (int i = N; i >= 2; i--) {\n\t\tcout << i - 1 << \" \" << i << \" \" << w << endl;\n\t\tw *= 2;\n\t}\n\t\n\n\t A = L - num / 2;\n\n\twhile (A) {\n\t\tint j = 0;\n\t\tint m = 1;\n\t\tfor (;; j++) {\n\t\t\tif (m <= A && A <2 * m) { break; }\n\t\t\tm *= 2;\n\t\t}\n\t\t//cout << \"j= \" << j << endl;\n\n\t\tcout << 1 << \" \" << N - j << \" \" << L - A << endl;\n\n\t\tA -= pow(2, j);\n\t}\n\n\t//system(\"pause\");\n\treturn 0;\n}", "def d_all_your_paths_are_different_lengths(L):\n # l=2から始めて、lを2倍するか+1するかを何回か行ってLにしたい。\n # その回数を最小にするには、Lから始めて、Lが偶数なら2で割って奇数なら1引くことを\n # 繰り返した回数を調べればいい。\n do = [] # 2からLにするには*2と+1をどのように行えばいいか？\n while L > 2:\n if L % 2 == 0:\n do.append('*2')\n L >>= 1\n else:\n do.append('+1')\n L -= 1\n do.reverse()\n\n # 解説(英語版の Solution 2.)に従って辺を構成\n vertex = 2 # 現時点での頂点数\n edge = [[1, 2, 0], [1, 2, 1]] # L=2のときはこのようにつなぐ他ない\n l = 2\n for op in do:\n if op == '*2':\n # 各辺の長さを2倍、新しい頂点に長さ0,1の辺をつなぐ\n edge = [[v1, v2, c * 2] for v1, v2, c in edge]\n edge.append([vertex, vertex + 1, 0])\n edge.append([vertex, vertex + 1, 1])\n vertex += 1\n l *= 2\n elif op == '+1':\n # 先頭と末尾の頂点に長さlの辺をつなぐ\n edge.append([1, vertex, l])\n l += 1\n\n # 出力形式に沿った文字列を構成\n ans = '{} {}\\n'.format(vertex, len(edge))\n ans += '\\n'.join([' '.join(map(str, row)) for row in edge])\n return ans\n\nL = int(input())\nprint(d_all_your_paths_are_different_lengths(L))\n", "import java.io.*;\nimport java.util.*;\n\nclass Edge {\n final int src;\n final int dst;\n final int cost;\n \n Edge(int src, int dst, int cost) {\n this.src = src;\n this.dst = dst;\n this.cost = cost;\n }\n}\n\npublic class Main {\n private static final int GOAL_NODE = 20;\n \n private static List<Edge> solve(int src, int l) {\n if (src == GOAL_NODE && l <= 1) {\n return Collections.emptyList();\n }\n if (l <= 1) {\n return Arrays.asList(new Edge(src, GOAL_NODE, 0));\n }\n if (l <= 2) {\n return Arrays.asList(\n new Edge(src, GOAL_NODE, 0),\n new Edge(src, GOAL_NODE, 1)\n );\n }\n List<Edge> edges = new ArrayList<>();\n if (l % 2 == 1) {\n edges.add(new Edge(src, GOAL_NODE, l-1));\n }\n edges.add(new Edge(src, src + 1, 0));\n edges.add(new Edge(src, src + 1, l / 2));\n edges.addAll(solve(src + 1, l / 2));\n return edges;\n }\n \n private static List<Edge> solve(int l) {\n return solve(1, l);\n }\n \n private static void execute(ContestReader reader, PrintWriter out) {\n int l = reader.nextInt();\n List<Edge> edges = solve(l);\n out.printf(\"%d %d\\n\", GOAL_NODE, edges.size());\n for (Edge edge : edges) {\n out.printf(\"%d %d %d\\n\", edge.src, edge.dst, edge.cost);\n }\n }\n \n public static void main(String[] args) {\n ContestReader reader = new ContestReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n execute(reader, out);\n out.flush();\n }\n}\n\nclass ContestReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n \n ContestReader(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n \n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public long nextLong() {\n return Long.parseLong(next());\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public String[] nextArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = next();\n }\n return array;\n }\n \n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n \n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n \n public double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n \n public int[][] nextIntMatrix(int n, int m) {\n int[][] matrix = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextInt();\n }\n }\n return matrix;\n }\n \n public long[][] nextLongMatrix(int n, int m) {\n long[][] matrix = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextLong();\n }\n }\n return matrix;\n }\n \n public double[][] nextDoubleMatrix(int n, int m) {\n double[][] matrix = new double[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextDouble();\n }\n }\n return matrix;\n }\n}\n\nclass ModCalculator {\n private final long mod;\n \n ModCalculator(long mod) {\n this.mod = mod;\n }\n \n public long add(long a, long b) {\n return (a + b) % mod;\n }\n \n public long mul(long a, long b) {\n return (a * b) % mod;\n }\n \n public long pow(long a, long b) {\n if (b == 0) {\n return 1;\n }\n long v = pow(mul(a, a), b / 2);\n if (b % 2 == 1) {\n return mul(v, a);\n } else {\n return v;\n }\n }\n \n public long inverse(long a) {\n return pow(a, mod - 2);\n }\n \n public long div(long a, long b) {\n return mul(a, inverse(b));\n }\n}\n \nclass ModCombinationCache {\n private final ModCalculator modCalculator;\n private final List<Long> factorialCache;\n private final List<Long> factorialInverseCache;\n \n public ModCombinationCache(ModCalculator modCalculator) {\n this.modCalculator = modCalculator;\n factorialCache = new ArrayList<>();\n factorialCache.add(1L);\n factorialInverseCache = new ArrayList<>();\n factorialInverseCache.add(1L);\n }\n \n private void resize(int n) {\n for (int i = factorialCache.size() - 1; i < n; i++) {\n long v = modCalculator.mul(factorialCache.get(i), i + 1);\n factorialCache.add(v);\n factorialInverseCache.add(modCalculator.inverse(v));\n }\n }\n \n public long getP(int n) {\n resize(n);\n return factorialCache.get(n);\n }\n \n public long getC(int n, int k) {\n resize(n);\n return modCalculator.mul(factorialCache.get(n), modCalculator.mul(factorialInverseCache.get(k), factorialInverseCache.get(n-k)));\n }\n}\n\nclass Algorithm {\n private static void swap(Object[] list, int a, int b) {\n Object tmp = list[a];\n list[a] = list[b];\n list[b] = tmp;\n }\n \n public static <T extends Comparable<? super T>> boolean nextPermutation(T[] ts) {\n int rightMostAscendingOrderIndex = ts.length - 2;\n while (rightMostAscendingOrderIndex >= 0 &&\n ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostAscendingOrderIndex + 1]) >= 0) {\n rightMostAscendingOrderIndex--;\n }\n if (rightMostAscendingOrderIndex < 0) {\n return false;\n }\n \n int rightMostGreatorIndex = ts.length - 1;\n while (ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostGreatorIndex]) >= 0) {\n rightMostGreatorIndex--;\n }\n \n swap(ts, rightMostAscendingOrderIndex, rightMostGreatorIndex);\n for (int i = 0; i < (ts.length - rightMostAscendingOrderIndex - 1) / 2; i++) {\n swap(ts, rightMostAscendingOrderIndex + 1 + i, ts.length - 1 - i);\n }\n return true;\n }\n \n public static void shuffle(int[] array) {\n Random random = new Random();\n int n = array.length;\n for (int i = 0; i < n; i++) {\n int randomIndex = i + random.nextInt(n - i);\n \n int temp = array[i];\n array[i] = array[randomIndex];\n array[randomIndex] = temp;\n }\n }\n \n public static void shuffle(long[] array) {\n Random random = new Random();\n int n = array.length;\n for (int i = 0; i < n; i++) {\n int randomIndex = i + random.nextInt(n - i);\n \n long temp = array[i];\n array[i] = array[randomIndex];\n array[randomIndex] = temp;\n }\n }\n \n public static void sort(int[] array) {\n shuffle(array);\n Arrays.sort(array);\n }\n \n public static void sort(long[] array) {\n shuffle(array);\n Arrays.sort(array);\n }\n}\n\nclass UnionFind {\n int[] parents;\n int[] ranks;\n\n UnionFind(int n) {\n parents = new int[n];\n ranks = new int[n];\n\n for (int i = 0; i < n; i++) {\n parents[i] = i;\n }\n }\n\n public int getRoot(int index) {\n if (parents[index] == index) {\n return index;\n } else {\n parents[index] = getRoot(parents[index]);\n return parents[index];\n }\n }\n\n public boolean sameGroup(int a, int b) {\n return getRoot(a) == getRoot(b);\n }\n\n public void merge(int a, int b) {\n int rootA = getRoot(a);\n int rootB = getRoot(b);\n if (rootA == rootB) {\n return;\n }\n if (ranks[rootA] < ranks[rootB]) {\n parents[rootA] = rootB;\n } else if (ranks[rootB] < ranks[rootA]) {\n parents[rootB] = rootA;\n } else {\n parents[rootA] = rootB;\n ranks[rootB]++;\n }\n }\n}\n", "\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\npublic final class Main {\n \n public static void main(String[] args) {\n final FastScanner fs = new FastScanner();\n int l = fs.nextInt();\n int k = 0;\n int idx = 0;\n final int[][] edges = new int[60][3];\n while (1 << k + 1 <= l) {\n k++;\n }\n for (int i = 0; i < k; i++) {\n final int j = i + 1;\n edges[idx++] = new int[] { i, j, 0 };\n edges[idx++] = new int[] { i, j, 1 << i };\n }\n for (int i = 0; i < k; i++) {\n if ((l & 1 << i) != 0) {\n edges[idx++] = new int[] { i, k, l ^= 1 << i };\n }\n }\n System.out.println(k + 1 + \" \" + idx);\n for (int i = 0; i < idx; i++) {\n final int u = edges[i][0] + 1;\n final int v = edges[i][1] + 1;\n final int w = edges[i][2];\n System.out.println(u + \" \" + v + \" \" + w);\n }\n }\n\n static final class Util {\n public static void shuffleSort(int[] x) {\n shuffle(x);\n Arrays.sort(x);\n }\n\n public static void shuffleSort(long[] x) {\n shuffle(x);\n Arrays.sort(x);\n }\n\n public static void shuffle(int[] x) {\n final Random r = new Random();\n\n for (int i = 0; i <= x.length - 2; i++) {\n final int j = i + r.nextInt(x.length - i);\n swap(x, i, j);\n }\n }\n\n public static void shuffle(long[] x) {\n final Random r = new Random();\n\n for (int i = 0; i <= x.length - 2; i++) {\n final int j = i + r.nextInt(x.length - i);\n swap(x, i, j);\n }\n }\n\n public static void swap(int[] x, int i, int j) {\n final int t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n public static void swap(long[] x, int i, int j) {\n final long t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n private Util() {}\n }\n\n static class FastScanner {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n private String next() {\n while (!st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n //noinspection CallToPrintStackTrace\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n int[] nextIntArray(int n) {\n final int[] a = new int[n];\n for (int i = 0; i < n; i++) { a[i] = nextInt(); }\n return a;\n }\n\n long[] nextLongArray(int n) {\n final long[] a = new long[n];\n for (int i = 0; i < n; i++) { a[i] = nextLong(); }\n return a;\n }\n }\n}\n", "#include <iostream>\n#include <string>\n#include <vector>\n \nusing namespace std;\n \nint main () {\n long L;\n vector<string> ans;\n cin >> L;\n for (int i = 1; i < 20; i++) {\n if (L == 1) {\n ans.push_back(to_string(i) + \" \" + to_string(i + 1) + \" 0\");\n continue;\n }\n if (L % 2 != 0) {\n ans.push_back(to_string(i) + \" 20 \" + to_string(L - 1));\n L--;\n }\n L /= 2;\n ans.push_back(to_string(i) + \" \" + to_string(i + 1) + \" \" + to_string(L));\n ans.push_back(to_string(i) + \" \" + to_string(i + 1) + \" \" + to_string(0));\n }\n cout << 20 << \" \" << ans.size() << endl;\n for (string s: ans) {\n cout << s << endl;\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define fi first\n#define se second\n#define mp make_pair\n#define pb push_back\n#define all(x) x.begin(),x.end()\n#define dbg(x) cout<<#x<<\":\"<<x<<endl\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef pair<ll,P> PP;\n\nint main(){\n ll l;\n cin>>l;\n if(l==2){\n cout<<\"2 2\"<<endl;\n cout<<\"1 2 0\"<<endl;\n cout<<\"1 2 1\"<<endl;\n return 0;\n }\n l--;\n vector<ll> bt;\n ll t=l;\n ll cnt=0;\n while(t){\n cnt+=t%2;\n bt.pb(t%2);\n t/=2;\n }\n\n ll n=bt.size();\n cout<<n<<\" \"<<(n-1)*2+cnt<<endl;\n ll k=pow(2,n-2);\n for(int i=0;i<n-1;i++){\n cout<<i+1<<\" \"<<i+2<<\" \"<<0<<endl;\n cout<<i+1<<\" \"<<i+2<<\" \"<<k<<endl;\n k/=2;\n }\n \n cout<<1<<\" \"<<n<<\" \"<<l<<endl;\n for(int i=0;i<bt.size()-1;i++){\n if(bt[i]==0)continue;\n l-=pow(2,i);\n cout<<1<<\" \"<<n-i<<\" \"<<l<<endl;\n }\n return 0;\n}\n\n", "L = int(input())\n\n# 必要な頂点数を出す\nN = 0\nfor i in range(21):\n if 2 ** i > L:\n break\n else:\n N = i\nN += 1\n\n# ここから頂点番号は0-indexedとし、出力時に1-indexedにする\nG = []\n# 頂点iと頂点i+1との間にコスト0の辺とコスト2^(頂点番号)の辺を張る\nfor i in range(N - 1):\n G.append((i, i + 1, 0))\n G.append((i, i + 1, 2 ** i))\n\n# 表現できてないコストを列挙\nR = list(range(2 ** (N - 1), L))\nmarker = 0 # どこまで表現したかを表すマーカー\nB = bin(len(R))[2:][::-1] # どこにバイパスを張るか\n\n# バイパスを張っていく\nfor i in range(len(B) - 1, -1, -1):\n if B[i] == '0':\n continue\n\n G.append((i, N - 1, R[marker]))\n marker += 2 ** i\n\nprint(N, len(G))\nfor u, v, w in G:\n print(u + 1, v + 1, w)\n", "l=int(input())\nll=l\nl3=[]\nwhile True:\n if ll//3==0:\n l3.append(ll)\n break\n else:\n l3.append(ll%3)\n ll=ll//3\nN=len(l3)+1\nedge=[]\nfor i in range(1,len(l3)):\n edge.append([i,i+1,0])\n edge.append([i,i+1,1*3**(i-1)])\n edge.append([i,i+1,2*3**(i-1)])\n\na=0\nfor i in range(len(l3)):\n for j in range(l3[i]):\n edge.append([i+1,N,j*3**i+a])\n a+=l3[i]*3**i\n\nprint(N,len(edge))\nfor i in edge:\n print(i[0],i[1],i[2])", "#include\"bits/stdc++.h\"\nusing namespace std;\n\ntypedef pair<int, int> P;\nint n = 2;\nint m = 2;\nmap<P, vector<int>> e;\n\nvoid dfs(int l) {\n if (l == 2) {\n e[P(1, 2)].push_back(0);\n e[P(1, 2)].push_back(1);\n } else if (l % 2 == 0) {\n dfs(l / 2);\n for (auto edge: e) {\n P p = edge.first;\n for (int i = 0; i < e[p].size(); i++) {\n e[p][i] *= 2;\n }\n }\n e[P(n, n + 1)].push_back(0);\n e[P(n, n + 1)].push_back(1);\n n += 1;\n m += 2;\n } else {\n dfs(l - 1);\n e[P(1, n)].push_back(l - 1);\n m++;\n }\n}\n\nvoid Main() {\n int l;\n cin >> l;\n\n dfs(l);\n\n cout << n << \" \" << m << endl;\n for (auto edge: e) {\n P p = edge.first;\n for (int i = 0; i < e[p].size(); i++) {\n cout << p.first << \" \" << p.second << \" \" << edge.second[i] << endl;\n }\n }\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios_base::sync_with_stdio(false);\n std::cout << std::fixed << std::setprecision(15);\n Main();\n return 0;\n}\n\n", "L=int(input());n=len(str(bin(L)))-3;e=[];h=2**n\nfor i in range(1,n+1):\n e+=[(i,i+1,0),(i,i+1,2**(n-i))]\n if 2**(n-i)&L:e+=[(1,i+1,h)];h+=2**(n-i)\nprint(n+1,len(e))\nfor v in e:print(*v)", "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main() {\n int L, L_, N, M, R;\n cin >> L;\n \n N = 0;\n M = -2;\n L_ = L;\n \n while(L_!=0) {\n N++;\n M += 2;\n L_ /= 2;\n }\n \n R = L-pow(2,N-1);\n for(int i=0; i<N; i++) {\n if (R & (1<<i)) {\n M++;\n }\n }\n \n cout << N << \" \" << M << endl;\n \n for(int i=0; i<N-1; i++) {\n cout << i+1 << \" \" << i+2 << \" \" << 0 << endl;\n cout << i+1 << \" \" << i+2 << \" \" << pow(2,i) << endl;\n }\n \n int res = pow(2,N-1);\n for(int i=N-1; i>=0; i--) {\n if (R & (1<<i)) {\n cout << i+1 << \" \" << N << \" \" << res << endl;\n res = res + pow(2,i);\n }\n }\n \n return 0;\n}", "L = int(input())\n\nLbin = (bin(L)[2:])[::-1]\nN = len(Lbin)\nM = 2 * (N - 1) + Lbin.count(\"1\") - 1\nprint(N, M)\n\nfor i in range(0, N - 1):\n print(i + 1, i + 2, 0)\n print(i + 1, i + 2, 2 ** i)\n\nweight = L\nfor i in range(0, N - 1):\n if Lbin[i] == '1': # 2^iの位\n weight -= 2 ** i\n print(i + 1, N, weight)", "import math\n\nl = int(input())\n\nn = int(math.log2(l)) + 1\ng = []\n\nfor i in range(1, n):\n g.append([i, i + 1, 2**(n - i - 1)])\n g.append([i, i + 1, 0])\n \ns = 2**(n - 1)\n\nwhile l > s:\n t = n - int(math.log2(l - s))\n g.append([1, t, s])\n s += 2**int(math.log2(l - s))\n \nprint(n, len(g))\nfor i in range(0, len(g)):\n print(\" \".join(list(map(str, g[i]))))", "L = int(input())\nB = bin(L)\nN = len(B)-2\n\nprint(N,2*N+B.count(\"1\")-3)\n\nfor i in range(1,N):\n print(i,i+1,0)\n print(i,i+1,2**(i-1))\n if int(B[N+2-i]):\n print(i,N,L-2**(i-1))\n L -= 2**(i-1)", "import math\nL = int(input())\ns = int(math.log2(L))\nN = s+1\n\ncount = 0\ngraph = []\nfor i in range(N-1,0,-1):\n if L - 2 ** (i-1) >= 2 ** s:\n graph.append([i, N ,L-2 ** (i-1)])\n L = L - 2 ** (i-1)\n count += 1\n\nprint(N, end = ' ')\nprint(2*(N-1)+count)\n\n\n\nfor i in range(N,1,-1):\n print(i-1, end = ' ')\n print(i, end = ' ')\n print(0)\n print(i - 1, end=' ')\n print(i, end=' ')\n print(2 ** (i-2))\n\nfor i in range(len(graph)):\n print(graph[i][0], end = ' ')\n print(graph[i][1], end = ' ')\n print(graph[i][2])\n", "#include <bits/stdc++.h>\n\n// #include <atcoder/all>\n\n// #LIB#\n\nusing namespace std;\n// using namespace atcoder;\nusing ll = long long;\n#define double long double\n#define rep(i, n) for (long long i = 0; i < (n); ++i)\n#define repr(i, a, b) for (auto i = (a); i < (b); ++i)\n#define itr(x, c) for (auto&& x : (c))\n#define updatemax(t, v) ((t) = std::max((t), (v)))\n#define updatemin(t, v) ((t) = std::min((t), (v)))\n#ifdef ONLINE_JUDGE\n#define endl _endl\nconst char _endl = (cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout.precision(16), '\\n');\n#endif\n\nint main() {\n ll l;\n cin >> l;\n vector<tuple<ll, ll, ll>> edges;\n ll gn = 1;\n while (l >= 2) {\n if (l & 1) {\n edges.emplace_back(gn, -1, l - 1);\n --l;\n }\n edges.emplace_back(gn, gn + 1, 0);\n edges.emplace_back(gn, gn + 1, l / 2);\n ++gn;\n l /= 2;\n }\n cout << gn << \" \" << edges.size() << endl;\n itr(e,edges){\n auto [ea, eb, ec] = e;\n cout << ea << \" \" << (eb == -1 ? gn : eb) << \" \" << ec << endl;\n }\n}\n", "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#define For(i, n) for(int i = 0; i < (n); i ++)\n#define Range(container) container.begin(), container.end()\n#define Cin(T, x) T x; cin >> x;\n#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i];\n#define Cout(val) cout << (val) << \"\\n\";\nusing namespace std;\nusing ll = long long;\n\nint main(void){\n Cin(int, l);\n vector<int> bits;\n while(l){\n bits.push_back(l & 1);\n l >>= 1;\n }\n int n = (int)bits.size();\n int m = 2*(n-1) + accumulate(Range(bits), -1);\n printf(\"%d %d\\n\", n, m);\n \n for(int i = 1; i < n; i ++){\n printf(\"%d %d 0\\n\", i, i+1);\n printf(\"%d %d %d\\n\", i, i+1, 1 << (i-1));\n }\n int need = 1 << (n-1);\n for(int i = n-1; i > 0; i --){\n if(bits[i-1] == 0) continue;\n printf(\"%d %d %d\\n\", i, n, need);\n need += 1 << (i-1);\n }\n}\n\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n\nvector<ll>F, T, W;\nll N;\nvoid push(ll f, ll t, ll w){\n F.push_back(f);\n T.push_back(t);\n W.push_back(w);\n}\nvoid show(){\n cout << N << \" \" << F.size() << endl;\n for(ll i = 0; i < F.size(); i++){\n cout << F[i] << \" \" << T[i] << \" \" << W[i] << endl;\n }\n}\n\nint main(){\n\n ll L;\n cin >> L;\n ll mx[22] = {};\n for(ll i = 2; i <= 21; i++){\n mx[i] = (1LL << (i - 1)) - 1;\n }\n for(N = 1; ;N++)if(mx[N + 1] >= L)break;\n for(ll i = 1; i < N; i++){\n push(i, i + 1, 0);\n push(i, i + 1, 1 << (i - 1));\n }\n for(ll i = mx[N] + 1; i < L; i++){\n ll sz = L - i;\n ll from = 1;\n for(;;from++)if(i + mx[from + 1] >= L)break;\n push(from, N, i);\n i += mx[from];\n }\n show();\n \n return 0;\n}\n", "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <climits>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\n#define DEBUG 1\nusing namespace std;\nconstexpr int kMod = 1000000007;\ntypedef long long LL;\ntypedef tuple<int, int, int> TP;\n\nint main() {\n int L; cin >> L;\n int k = 1, N = 0;\n while (k <= L) {\n k *= 2; ++N;\n }\n int r = N - 1;\n int kr = k/2;\n\n vector<TP> es;\n k = 1;\n for (int i = 1; i < N; ++i) {\n es.push_back({i, i + 1, 0});\n es.push_back({i, i + 1, k});\n k *= 2;\n }\n\n k /= 2;\n for (int i = N - 1; i > 0; --i) {\n if (L - k >= kr) {\n es.push_back({i, N, L - k});\n L -= k;\n }\n k /= 2;\n }\n\n cout << N << \" \" << es.size() << endl;\n for (auto [u, v, w] : es) {\n cout << u << \" \" << v << \" \" << w << endl;\n }\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint L;\nvector<P> G[30]; // const, to\nvector<bool> op; // T: x2, F: +1\nint s,t,now,e;\n\nvoid gen_op(int num){\n\tif(num == 2) return;\n\tif(num%2 != 0){\n\t\tgen_op(num-1);\n\t\top.push_back(false);\n\t}else{\n\t\tgen_op(num/2);\n\t\top.push_back(true);\t\n\t}\n\treturn;\n}\n\nvoid make_graph(){\n\tfor (int i = 0;i < op.size();i++){\n\t\tif(op[i]){\n\t\t\tfor (int j = s;j < t;j++){\n\t\t\t\tfor (int k = 0;k < G[j].size();k++){\n\t\t\t\t\tG[j][k].first *= 2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tG[t].push_back(P(0,t+1));\n\t\t\tG[t].push_back(P(1,t+1));\n\t\t\tt++;\n\t\t\te += 2;\n\t\t\tnow *= 2;\n\t\t}else{\n\t\t\tG[s].push_back(P(now,t));\n\t\t\tnow += 1;\n\t\t\te++;\n\t\t}\n\t}\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tcin >> L;\n\n\tG[1].push_back(P(0,2));\n\tG[1].push_back(P(1,2));\n\ts = 1;\n\tt = 2;\n\tnow = 2;\n\te = 2;\n\n\tgen_op(L);\n\tmake_graph();\n\n\tcout << t << \" \" << e << endl;\n\n\tfor (int i = s;i < t;i++){\n\t\tfor (int j = 0;j < G[i].size();j++){\n\t\t\tcout << i << \" \" << G[i][j].second << \" \" << G[i][j].first << endl;\n\t\t}\n\t}\n\n\treturn 0;\n\n}\n", "l = int(input())\nn = 1\nll = l\nwhile ll > 1:\n n += 1\n ll = ll // 2\ns = 1\ne = []\nwhile l > 1:\n h = l // 2\n e.append((s, s + 1, 0))\n e.append((s, s + 1, h))\n if l > h * 2:\n e.append((s, n, l - 1))\n l = h\n s += 1\n\nprint(n, len(e))\nfor x, y, w in e:\n print(x, y, w)", "\nimport java.io.*;\n\nimport static java.lang.Math.*;\nimport static java.lang.Math.min;\n\nimport java.util.stream.Stream;\nimport java.util.*;\n\n/**\n * @author baito\n */\nclass P implements Comparable<P> {\n int x, y;\n\n P(int a, int b) {\n x = a;\n y = b;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (!(o instanceof P)) return false;\n P p = (P) o;\n return x == p.x && y == p.y;\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(x, y);\n }\n\n @Override\n public int compareTo(P p) {\n return x == p.x ? y - p.y : x - p.x; //xで昇順にソート\n //return (x == p.x ? y - p.y : x - p.x) * -1; //xで降順にソート\n //return y == p.y ? x - p.x : y - p.y;//yで昇順にソート\n //return (y == p.y ? x - p.x : y - p.y)*-1;//yで降順にソート\n }\n}\n\n@SuppressWarnings(\"unchecked\")\npublic class Main {\n static boolean DEBUG = true;\n static StringBuilder sb = new StringBuilder();\n static int INF = 1234567890;\n static int MINF = -1234567890;\n static long LINF = 123456789123456789L;\n static long MLINF = -123456789123456789L;\n static long MOD = 1000000007;\n static double EPS = 1e-10;\n static int[] y4 = {0, 1, 0, -1};\n static int[] x4 = {1, 0, -1, 0};\n static int[] y8 = {0, 1, 0, -1, -1, 1, 1, -1};\n static int[] x8 = {1, 0, -1, 0, 1, -1, 1, -1};\n static ArrayList<Long> Fa;\n static boolean[] isPrime;\n static int[] primes;\n static char[][] ban;\n static long maxRes = MLINF;\n static long minRes = LINF;\n\n static int L;\n static long[] A;\n\n public static void solve() throws Exception {\n //longを忘れるなオーバーフローするぞ\n L = ni();\n int N = 0;\n {\n int pow = 1;\n while (pow <= L) {\n pow *= 2;\n N++;\n }\n }\n int M = (N - 1) * 2 + Integer.bitCount(L) - 1;\n System.out.println(N + \" \" + M);\n int next = 0;\n for (int cur = 1, pow = 1; cur < N; cur++, pow *= 2) {\n System.out.println(cur + \" \" + (cur + 1) + \" \" + 0);\n System.out.println(cur + \" \" + (cur + 1) + \" \" + pow);\n next = pow * 2;\n }\n int sum = next / 2 - 1;\n for (int v = N - 1; v >= 0; v--) {\n if (sum + next < L) {\n System.out.println(v + \" \" + N + \" \" + next);\n if (next == L - 1) break;\n next += sum + 1;\n }\n sum -= 1 << (v - 2);\n if (sum < 0) break;\n }\n\n }\n\n public static boolean calc(long va) {\n //貪欲にギリギリセーフを選んでいく。\n int v = (int) va;\n return true;\n }\n\n //条件を満たす最大値、あるいは最小値を求める\n static int mgr(long ok, long ng, long w) {\n //int ok = 0; //解が存在する\n //int ng = N; //解が存在しない\n while (Math.abs(ok - ng) > 1) {\n long mid;\n if (ok < 0 && ng > 0 || ok > 0 && ng < 0) mid = (ok + ng) / 2;\n else mid = ok + (ng - ok) / 2;\n\n if (calc(mid)) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n if (calc(ok)) return (int) ok;\n else return -1;\n }\n\n boolean equal(double a, double b) {\n return a == 0 ? abs(b) < EPS : abs((a - b) / a) < EPS;\n }\n\n public static void matPrint(long[][] a) {\n for (int hi = 0; hi < a.length; hi++) {\n for (int wi = 0; wi < a[0].length; wi++) {\n System.out.print(a[hi][wi] + \" \");\n }\n System.out.println(\"\");\n }\n }\n\n //rにlを掛ける l * r\n public static long[][] matMul(long[][] l, long[][] r) throws IOException {\n int lh = l.length;\n int lw = l[0].length;\n int rh = r.length;\n int rw = r[0].length;\n //lwとrhが,同じである必要がある\n if (lw != rh) throw new IOException();\n long[][] res = new long[lh][rw];\n for (int i = 0; i < lh; i++) {\n for (int j = 0; j < rw; j++) {\n for (int k = 0; k < lw; k++) {\n res[i][j] = modSum(res[i][j], modMul(l[i][k], r[k][j]));\n }\n }\n }\n return res;\n }\n\n public static long[][] matPow(long[][] a, int n) throws IOException {\n int h = a.length;\n int w = a[0].length;\n if (h != w) throw new IOException();\n long[][] res = new long[h][h];\n for (int i = 0; i < h; i++) {\n res[i][i] = 1;\n }\n long[][] pow = a.clone();\n while (n > 0) {\n if (bitGet(n, 0)) res = matMul(pow, res);\n pow = matMul(pow, pow);\n n >>= 1;\n }\n return res;\n }\n\n public static void chMax(long v) {\n maxRes = Math.max(maxRes, v);\n }\n\n public static void chMin(long v) {\n minRes = Math.min(minRes, v);\n }\n\n\n //2点間の行き先を配列に持たせる\n static int[][] packE(int n, int[] from, int[] to) {\n int[][] g = new int[n][];\n int[] p = new int[n];\n for (int f : from)\n p[f]++;\n for (int t : to)\n p[t]++;\n for (int i = 0; i < n; i++)\n g[i] = new int[p[i]];\n for (int i = 0; i < from.length; i++) {\n g[from[i]][--p[from[i]]] = to[i];\n g[to[i]][--p[to[i]]] = from[i];\n }\n return g;\n }\n\n\n public static boolean bitGet(BitSet bit, int keta) {\n return bit.nextSetBit(keta) == keta;\n }\n\n public static boolean bitGet(long bit, int keta) {\n return ((bit >> keta) & 1) == 1;\n }\n\n public static int restoreHashA(long key) {\n return (int) (key >> 32);\n }\n\n public static int restoreHashB(long key) {\n return (int) (key & -1);\n }\n\n //正の数のみ\n public static long getHashKey(int a, int b) {\n return (long) a << 32 | b;\n }\n //数学関係--------------------------------\n\n //a/bを返す\n public static long ceil(long a, long b) {\n return (a % b == 0) ? a / b : a / b + 1;\n }\n\n public static long sqrt(long v) {\n long res = (long) Math.sqrt(v);\n while (res * res > v) res--;\n return res;\n }\n\n static long ncr2(int a, int b) {\n if (b == 0) return 1;\n else if (a < b) return 0;\n long res = 1;\n for (int i = 0; i < b; i++) {\n res *= a - i;\n res /= i + 1;\n }\n return res;\n }\n\n static long ncrdp(int n, int r) {\n if (n < r) return 0;\n long[][] dp = new long[n + 1][r + 1];\n for (int ni = 0; ni < n + 1; ni++) {\n dp[ni][0] = dp[ni][ni] = 1;\n for (int ri = 1; ri < ni; ri++) {\n dp[ni][ri] = dp[ni - 1][ri - 1] + dp[ni - 1][ri];\n }\n }\n return dp[n][r];\n }\n\n public static int mod(int a, int m) {\n return a >= 0 ? a % m : (int) (a + ceil(-a, m) * m) % m;\n }\n\n static long modNcr(int n, int r) {\n if (n < 0 || r < 0 || n < r) return 0;\n if (Fa == null || Fa.size() <= n) factorial(n);\n long result = Fa.get(n);\n result = modMul(result, modInv(Fa.get(n - r)));\n result = modMul(result, modInv(Fa.get(r)));\n return result;\n }\n\n public static long modSum(long... lar) {\n long res = 0;\n for (long l : lar)\n res = (res + l % MOD) % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modDiff(long a, long b) {\n long res = a % MOD - b % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modMul(long... lar) {\n long res = 1;\n for (long l : lar)\n res = (res * l % MOD) % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modDiv(long a, long b) {\n long x = a % MOD;\n long y = b % MOD;\n long res = (x * modInv(y)) % MOD;\n return res;\n }\n\n static long modInv(long n) {\n return modPow(n, MOD - 2);\n }\n\n static void factorial(int n) {\n if (Fa == null) {\n Fa = new ArrayList<>();\n Fa.add(1L);\n Fa.add(1L);\n }\n for (int i = Fa.size(); i <= n; i++) {\n Fa.add((Fa.get(i - 1) * i) % MOD);\n }\n }\n\n static long modPow(long x, long n) {\n long res = 1L;\n while (n > 0) {\n if ((n & 1) == 1) {\n res = res * x % MOD;\n }\n x = x * x % MOD;\n n >>= 1;\n }\n return res;\n }\n\n //↑nCrをmod計算するために必要\n static long lcm(long n, long r) {\n return n / gcd(n, r) * r;\n }\n\n static int gcd(int n, int r) {\n return r == 0 ? n : gcd(r, n % r);\n }\n\n static long gcd(long n, long r) {\n return r == 0 ? n : gcd(r, n % r);\n }\n\n public static int u0(int a) {\n if (a < 0) return 0;\n return a;\n }\n\n public static long u0(long a) {\n if (a < 0) return 0;\n return a;\n }\n\n public static int[] toIntArray(int a) {\n int[] res = new int[keta(a)];\n for (int i = res.length - 1; i >= 0; i--) {\n res[i] = a % 10;\n a /= 10;\n }\n return res;\n }\n\n public static Integer[] toIntegerArray(int[] ar) {\n Integer[] res = new Integer[ar.length];\n for (int i = 0; i < ar.length; i++) {\n res[i] = ar[i];\n }\n return res;\n }\n\n public static long bitGetCombSizeK(int k) {\n return (1 << k) - 1;\n }\n\n //k個の次の組み合わせをビットで返す 大きさに上限はない 110110 -> 111001\n public static long bitNextComb(long comb) {\n long x = comb & -comb; //最下位の1\n long y = comb + x; //連続した下の1を繰り上がらせる\n return ((comb & ~y) / x >> 1) | y;\n }\n\n public static int keta(long num) {\n int res = 0;\n while (num > 0) {\n num /= 10;\n res++;\n }\n return res;\n }\n\n public static boolean isOutofIndex(int x, int y, int w, int h) {\n if (x < 0 || y < 0) return true;\n if (w <= x || h <= y) return true;\n return false;\n }\n\n public static boolean isOutofIndex(int x, int y, char[][] ban) {\n if (x < 0 || y < 0) return true;\n if (ban[0].length <= x || ban.length <= y) return true;\n return false;\n }\n\n public static int arrayCount(int[] a, int v) {\n int res = 0;\n for (int i = 0; i < a.length; i++) {\n if (a[i] == v) res++;\n }\n return res;\n }\n\n public static int arrayCount(long[] a, int v) {\n int res = 0;\n for (int i = 0; i < a.length; i++) {\n if (a[i] == v) res++;\n }\n return res;\n }\n\n public static int arrayCount(int[][] a, int v) {\n int res = 0;\n for (int hi = 0; hi < a.length; hi++) {\n for (int wi = 0; wi < a[0].length; wi++) {\n if (a[hi][wi] == v) res++;\n }\n }\n return res;\n }\n\n public static int arrayCount(long[][] a, int v) {\n int res = 0;\n for (int hi = 0; hi < a.length; hi++) {\n for (int wi = 0; wi < a[0].length; wi++) {\n if (a[hi][wi] == v) res++;\n }\n }\n return res;\n }\n\n public static int arrayCount(char[][] a, char v) {\n int res = 0;\n for (int hi = 0; hi < a.length; hi++) {\n for (int wi = 0; wi < a[0].length; wi++) {\n if (a[hi][wi] == v) res++;\n }\n }\n return res;\n }\n\n public static void setPrimes() {\n int n = 100001;\n isPrime = new boolean[n];\n List<Integer> prs = new ArrayList<>();\n Arrays.fill(isPrime, true);\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i * i <= n; i++) {\n if (!isPrime[i]) continue;\n prs.add(i);\n for (int j = i * 2; j < n; j += i) {\n isPrime[j] = false;\n }\n }\n primes = new int[prs.size()];\n for (int i = 0; i < prs.size(); i++)\n primes[i] = prs.get(i);\n }\n\n public static void revSort(int[] a) {\n Arrays.sort(a);\n reverse(a);\n }\n\n public static void revSort(long[] a) {\n Arrays.sort(a);\n reverse(a);\n }\n\n public static int[][] copy(int[][] ar) {\n int[][] nr = new int[ar.length][ar[0].length];\n for (int i = 0; i < ar.length; i++)\n for (int j = 0; j < ar[0].length; j++)\n nr[i][j] = ar[i][j];\n return nr;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static <T extends Number> int lowerBound(final List<T> lis, final T value) {\n int low = 0;\n int high = lis.size();\n int mid;\n\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (lis.get(mid).doubleValue() < value.doubleValue()) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static <T extends Number> int upperBound(final List<T> lis, final T value) {\n int low = 0;\n int high = lis.size();\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (lis.get(mid).doubleValue() < value.doubleValue()) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static int lowerBound(final int[] arr, final int value) {\n int low = 0;\n int high = arr.length;\n int mid;\n\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] < value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static int upperBound(final int[] arr, final int value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] <= value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値がなければ挿入できる最小のインデックス\n */\n public static long lowerBound(final long[] arr, final long value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] < value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値がなければ挿入できる最小のインデックス\n */\n public static long upperBound(final long[] arr, final long value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] <= value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n //次の順列に書き換える、最大値ならfalseを返す\n public static boolean nextPermutation(int A[]) {\n int len = A.length;\n int pos = len - 2;\n for (; pos >= 0; pos--) {\n if (A[pos] < A[pos + 1]) break;\n }\n if (pos == -1) return false;\n\n //posより大きい最小の数を二分探索\n int ok = pos + 1;\n int ng = len;\n while (Math.abs(ng - ok) > 1) {\n int mid = (ok + ng) / 2;\n if (A[mid] > A[pos]) ok = mid;\n else ng = mid;\n\n }\n\n swap(A, pos, ok);\n reverse(A, pos + 1, len - 1);\n\n\n return true;\n }\n\n //次の順列に書き換える、最小値ならfalseを返す\n public static boolean prevPermutation(int A[]) {\n int len = A.length;\n int pos = len - 2;\n for (; pos >= 0; pos--) {\n if (A[pos] > A[pos + 1]) break;\n }\n if (pos == -1) return false;\n\n //posより小さい最大の数を二分探索\n int ok = pos + 1;\n int ng = len;\n while (Math.abs(ng - ok) > 1) {\n int mid = (ok + ng) / 2;\n if (A[mid] < A[pos]) ok = mid;\n else ng = mid;\n\n }\n\n swap(A, pos, ok);\n reverse(A, pos + 1, len - 1);\n\n\n return true;\n }\n\n\n static <T> void swap(T[] x, int i, int j) {\n T t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n static void swap(int[] x, int i, int j) {\n int t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n public static void reverse(int[] x) {\n int l = 0;\n int r = x.length - 1;\n while (l < r) {\n int temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(long[] x) {\n int l = 0;\n int r = x.length - 1;\n while (l < r) {\n long temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(char[] x) {\n int l = 0;\n int r = x.length - 1;\n while (l < r) {\n char temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(int[] x, int s, int e) {\n int l = s;\n int r = e;\n while (l < r) {\n int temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n static int length(int a) {\n int cou = 0;\n while (a != 0) {\n a /= 10;\n cou++;\n }\n return cou;\n }\n\n static int length(long a) {\n int cou = 0;\n while (a != 0) {\n a /= 10;\n cou++;\n }\n return cou;\n }\n\n static int cou(boolean[] a) {\n int res = 0;\n for (boolean b : a) {\n if (b) res++;\n }\n return res;\n }\n\n static int cou(String s, char c) {\n int res = 0;\n for (char ci : s.toCharArray()) {\n if (ci == c) res++;\n }\n return res;\n }\n\n static int countC2(char[][] a, char c) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n if (a[i][j] == c) co++;\n return co;\n }\n\n static int countI(int[] a, int key) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n if (a[i] == key) co++;\n return co;\n }\n\n static int countI(int[][] a, int key) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n if (a[i][j] == key) co++;\n return co;\n }\n\n static void fill(int[][] a, int v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = v;\n }\n\n static void fill(char[][] a, char c) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = c;\n }\n\n static void fill(long[][] a, long v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = v;\n }\n\n static void fill(int[][][] a, int v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n for (int k = 0; k < a[0][0].length; k++)\n a[i][j][k] = v;\n }\n\n static void fill(long[][][] a, long v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n for (int k = 0; k < a[0][0].length; k++)\n a[i][j][k] = v;\n }\n\n static int max(int... a) {\n int res = Integer.MIN_VALUE;\n for (int i : a) {\n res = Math.max(res, i);\n }\n return res;\n }\n\n static long max(long... a) {\n long res = Integer.MIN_VALUE;\n for (long i : a) {\n res = Math.max(res, i);\n }\n return res;\n }\n\n static long min(long... a) {\n long res = Long.MAX_VALUE;\n for (long i : a) {\n res = Math.min(res, i);\n }\n return res;\n }\n\n static int max(int[][] ar) {\n int res = Integer.MIN_VALUE;\n for (int i[] : ar)\n res = Math.max(res, max(i));\n return res;\n }\n\n static long max(long[][] ar) {\n long res = Integer.MIN_VALUE;\n for (long i[] : ar)\n res = Math.max(res, max(i));\n return res;\n }\n\n static int min(int... a) {\n int res = Integer.MAX_VALUE;\n for (int i : a) {\n res = Math.min(res, i);\n }\n return res;\n }\n\n\n static int min(int[][] ar) {\n int res = Integer.MAX_VALUE;\n for (int i[] : ar)\n res = Math.min(res, min(i));\n return res;\n }\n\n static int sum(int[] a) {\n int cou = 0;\n for (int i : a)\n cou += i;\n return cou;\n }\n\n static long sum(long[] a) {\n long cou = 0;\n for (long i : a)\n cou += i;\n return cou;\n }\n\n //便利クラス\n static class CouMap {\n public HashMap<Long, Long> map;\n public HashMap<String, Long> maps;\n\n CouMap() {\n map = new HashMap();\n maps = new HashMap();\n }\n\n public void put(long key) {\n put(key, 1);\n }\n\n public void put(String key) {\n put(key, 1);\n }\n\n public void put(long key, long value) {\n Long nowValue = map.get(key);\n map.put(key, nowValue == null ? value : nowValue + value);\n }\n\n public void put(String key, long value) {\n Long nowValue = maps.get(key);\n maps.put(key, nowValue == null ? value : nowValue + value);\n }\n\n public Long get(long key) {\n return map.get(key);\n }\n\n // public HashMap<Long, Long> returnMap()\n // {\n // return map;\n // }\n }\n\n //FastScanner\n\n static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer tokenizer = null;\n\n public static String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n /*public String nextChar(){\n return (char)next()[0];\n }*/\n public static String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public static long nl() {\n return Long.parseLong(next());\n }\n\n public static String n() {\n return next();\n }\n\n public static int ni() {\n return Integer.parseInt(next());\n }\n\n public static double nd() {\n return Double.parseDouble(next());\n }\n\n public static int[] nia(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n\n //1-index\n public static int[] niao(int n) {\n int[] a = new int[n + 1];\n for (int i = 1; i < n + 1; i++) {\n a[i] = ni();\n }\n return a;\n }\n\n public static int[] niad(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni() - 1;\n }\n return a;\n }\n\n public static P[] npa(int n) {\n P[] p = new P[n];\n for (int i = 0; i < n; i++) {\n p[i] = new P(ni(), ni());\n }\n return p;\n }\n\n public static P[] npad(int n) {\n P[] p = new P[n];\n for (int i = 0; i < n; i++) {\n p[i] = new P(ni() - 1, ni() - 1);\n }\n return p;\n }\n\n public static int[][] nit(int h, int w) {\n int[][] a = new int[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = ni();\n }\n }\n return a;\n }\n\n public static int[][] nitd(int h, int w) {\n int[][] a = new int[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = ni() - 1;\n }\n }\n return a;\n }\n\n static int[][] S_ARRAY;\n static long[][] S_LARRAY;\n static int S_INDEX;\n static int S_LINDEX;\n\n //複数の配列を受け取る\n public static int[] niah(int n, int k) throws Exception {\n if (S_ARRAY == null) {\n S_ARRAY = new int[k][n];\n for (int j = 0; j < n; j++) {\n for (int i = 0; i < k; i++) {\n S_ARRAY[i][j] = ni();\n }\n }\n }\n return S_ARRAY[S_INDEX++];\n }\n\n public static long[] nlah(int n, int k) throws Exception {\n if (S_LARRAY == null) {\n S_LARRAY = new long[k][n];\n for (int j = 0; j < n; j++) {\n for (int i = 0; i < k; i++) {\n S_LARRAY[i][j] = nl();\n }\n }\n }\n return S_LARRAY[S_LINDEX++];\n }\n\n public static char[] nca() {\n char[] a = next().toCharArray();\n return a;\n }\n\n public static char[][] nct(int h, int w) {\n char[][] a = new char[h][w];\n for (int i = 0; i < h; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n public static String[] nsa(int n) {\n String[] res = new String[n];\n for (int i = 0; i < n; i++) {\n res[i] = n();\n }\n return res;\n }\n\n //スペースが入っている場合\n public static char[][] ncts(int h, int w) {\n char[][] a = new char[h][w];\n for (int i = 0; i < h; i++) {\n a[i] = nextLine().replace(\" \", \"\").toCharArray();\n }\n return a;\n }\n\n public static char[][] nctp(int h, int w, char c) {\n char[][] a = new char[h + 2][w + 2];\n //char c = '*';\n int i;\n for (i = 0; i < w + 2; i++)\n a[0][i] = c;\n for (i = 1; i < h + 1; i++) {\n a[i] = (c + next() + c).toCharArray();\n }\n for (i = 0; i < w + 2; i++)\n a[h + 1][i] = c;\n return a;\n }\n\n //スペースが入ってる時用\n public static char[][] nctsp(int h, int w, char c) {\n char[][] a = new char[h + 2][w + 2];\n //char c = '*';\n int i;\n for (i = 0; i < w + 2; i++)\n a[0][i] = c;\n for (i = 1; i < h + 1; i++) {\n a[i] = (c + nextLine().replace(\" \", \"\") + c).toCharArray();\n }\n for (i = 0; i < w + 2; i++)\n a[h + 1][i] = c;\n return a;\n }\n\n public static long[] nla(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }\n\n public static long[][] nlt(int h, int w) {\n long[][] a = new long[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = nl();\n }\n }\n return a;\n }\n\n public static void main(String[] args) throws Exception {\n long startTime = System.currentTimeMillis();\n solve();\n System.out.flush();\n long endTime = System.currentTimeMillis();\n if (DEBUG) System.err.println(endTime - startTime);\n }\n\n}\n", "#include <iostream>\n#include <vector>\n#include <tuple>\n#include <cmath>\nusing namespace std;\nint main()\n{\n int L;\n cin >> L;\n int N = (int)log2(L) + 1;\n vector<tuple<int, int, int>> v;\n for (int i = 1; i <= N-1; i++) {\n v.push_back(make_tuple(i, i+1, 0));\n v.push_back(make_tuple(i, i+1, 1<<(N-1-i)));\n }\n int bit = 1 << (N - 1);\n int pos = 1;\n int curr = 1 << (N - 1);\n int rest = L - (1 << (int)log2(L));\n while (bit) {\n if (rest & bit) {\n v.push_back(make_tuple(1, pos, curr));\n curr += 1 << (N-pos);\n }\n pos++;\n bit >>= 1;\n }\n cout << N << \" \" << v.size() << endl;\n for (auto tup : v) {\n int u, v, w;\n tie(u, v, w) = tup;\n cout << u << \" \" << v << \" \" << w << endl;\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ii = pair<int, int>;\n#define sz(x) (int)(x).size()\n\nusing iii = tuple<int, int, int>;\nint l;\n\nvoid solve() {\n int n = 0;\n for (int i = 20; i >= 0; i--)\n if (l & (1 << i)) { n = i + 1; break; }\n vector<iii> edges;\n for (int i = 0; i < n - 1; i++) {\n edges.push_back(iii(i + 1, i + 2, 0));\n edges.push_back(iii(i + 1, i + 2, (1 << i)));\n }\n int cur = (1 << (n - 1));\n for (int i = 0; i < n - 1; i++) if (l & (1 << i)) {\n edges.push_back(iii(i + 1, n, cur));\n cur += (1 << i);\n }\n assert(cur == l);\n\n printf(\"%d %d\\n\", n, sz(edges));\n for (int i = 0; i < sz(edges); i++) {\n printf(\"%d %d %d\\n\", get<0>(edges[i]), get<1>(edges[i]), get<2>(edges[i]));\n }\n}\n\nint main() {\n scanf(\"%d\", &l);\n solve();\n}\n\n", "L = int(input())\n\nbL = bin(L)[2:]\n\nN = len(bL)\nL = 2 * (N-1) + bL[1:].count('1')\nprint(N, L)\n\nfor i, b in enumerate(bL[1:]):\n if b == '1':\n print(1, i+2, 0)\n\nM, m = 0, 0\nfor i, b in enumerate(bL[:0:-1]):\n add = M - m + 1\n if b == '1':\n print(N-i-1, N-i, add)\n print(N-i-1, N-i, 2*add)\n m += add\n M += 2 * add\n else:\n print(N-i-1, N-i, 0)\n print(N-i-1, N-i, add)\n M += add\n\n", "L=int(input())\nl=0\npp=0\ntmp=L\nwhile tmp>0:l+=1;pp+=tmp%2;tmp//=2\nprint(l,l*2-3+pp)\nfor i in range(1,l):\n print(i,i+1,0)\n a=1<<i-1\n print(i,i+1,a)\n if L&a:L-=a;print(i,l,L)", "#include<iostream>\n#include <algorithm>\n#include<string>\n#include <bitset>\n#include <vector>\n#include <functional>\n#include <climits>\n#include <iomanip>\n#include <utility>\n#include <stack>\n#include <math.h>\nusing namespace std;\nusing ll = long long;\nint main()\n{\n\tll a, b = 0, c = 0, d = 0;\n\tll l;\n\tll memo[2][100];\n\tcin >> l;\n\twhile (1)\n\t{\n\t\ta = 1;\n\t\tb = 0;\n\t\tif (c==l)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\twhile (l - c > a * 2&&b<18)\n\t\t{\n\t\t\ta *= 2;\n\t\t\tb++;\n\t\t}\n\n\t\tif (l - c == 1)\n\t\t{\n\t\t\tmemo[0][d] = 20;\n\t\t\tmemo[1][d] = c;\n\t\t\t\n\t\t\t//cout << 1 << \" \" << 20 << \" \" << c << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmemo[0][d] = 20-b;\n\t\t\tmemo[1][d] = c;\n\t\t\t//cout << 1 << \" \" << 20 - b << \" \" << c << endl;\n\t\t}\n\t\tc += a;\n\t\td++;\n\t}\n\tcout << 20 <<\" \" <<d+36<< endl;\n\tfor (int i = 2; i < 20; i++)\n\t{\n\t\tcout << i << \" \" << i + 1 << \" \" << 0 << endl;\n\t}\n\tfor (int i = 2; i < 20; i++)\n\t{\n\t\tcout << i << \" \" << i + 1 << \" \" << pow(2, 19 - i) << endl;\n\t}\n\tfor (int i = 0; i < d; i++)\n\t{\n\t\tcout << 1 << \" \" << memo[0][i] << \" \" << memo[1][i] << endl;\n\t}\n\n\t//cout << c + d << endl;\n\n\treturn 0;\n}", "#include <algorithm>\n#include <cmath>\n#include <climits>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n\nstruct edge {\n int v1;\n int v2;\n int c;\n};\n\nint main() {\n int l; std::cin >> l;\n int n = int(log2(l))+1;\n\n std::vector<edge> es;\n for (int i = 1; i < n; i++) {\n es.push_back(edge{i-1, i, 0});\n es.push_back(edge{i-1, i, int(pow(2, i-1))});\n }\n for (int m = n-1; m > 0; m--) {\n int sub = l - pow(2, m-1);\n if (sub >= pow(2, n-1)) {\n l -= pow(2, m-1);\n es.push_back(edge{m-1, n-1, sub});\n }\n }\n\n std::cout << n << \" \" << es.size() << std::endl;\n for(auto e : es) {\n std::cout << e.v1+1 << \" \" << e.v2+1 << \" \" << e.c << std::endl;\n }\n}\n", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n int l;\n cin >> l;\n\n vector<string> res = {};\n\n int n = 0;\n int pow = 1;\n while (pow <= l) {\n pow *= 2;\n n++;\n }\n\n for (int i = 0; i < (n - 1); i++) {\n string xx = to_string(i + 1);\n string yy = to_string(i + 2);\n res.push_back(xx + \" \" + yy + \" 0\");\n res.push_back(xx + \" \" + yy + \" \" + to_string(1<<i));\n }\n\n int path = 2 * (n - 1);\n\n int x = 1<<(n - 1);\n for (int i = n - 2; i >= 0; i--) {\n // 作ることのできるパス\n if (l & 1<<i) {\n path++;\n res.push_back(to_string(i + 1) + \" \" + to_string(n) + \" \" + to_string(x));\n x += 1<<i;\n }\n }\n\n cout << n << \" \" << path << endl;\n for (string s : res) {\n cout << s << endl;\n }\n}", "L = int(input())\n\nb = []\nwhile L > 0:\n b.append(L % 2)\n L = int(L / 2)\n\np = []\n\ncost = 1\nfor i in range(len(b), 1, -1):\n p.append((i - 1, i, 0))\n p.append((i - 1, i, cost))\n cost *= 2\n\ncost2 = cost\nfor i in range(2, len(b) + 1):\n cost2 = int(cost2 / 2)\n if b[-i] % 2 == 1:\n p.append((1, i, cost))\n cost += cost2\n\nprint(len(b), len(p))\nfor tp in p:\n print(tp[0], tp[1], tp[2])", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n\nint main(){\n int N;\n cin >> N;\n int d = 2;\n while ((N >> d) != 0) d++;\n vector<pair<pair<int, int>, int>> ans;\n for (int i = 1; i <= 19; i++) ans.push_back({{i, i+1}, 0});\n for (int i = 1; i < d; i++) ans.push_back({{i, i+1}, (1 << (i-1))});\n int t = (1 << (d-1));\n for (int i = 19; i >= 1; i--) {\n if (t + ((1 << (i-1)) - 1) < N) {\n ans.push_back({{i, 20}, t});\n t += (1 << (i-1));\n }\n }\n cout << 20 << \" \" << ans.size() << endl;\n for (auto p : ans) {\n cout << p.first.first << \" \" << p.first.second << \" \" << p.second << endl;\n }\n return 0;\n}", "def solve(l):\n n = 0\n while 2**n <= l:\n n += 1\n E = []\n for i in range(n-1, -1, -1):\n x = 2**i\n if i != n-1:\n E.append((i, i+1, 0))\n E.append((i, i+1, x))\n if l - x >= 2**(n-1):\n E.append((i, n-1, l-x))\n l -= x\n print(n, len(E))\n for u, v, x in E:\n print(u+1, v+1, x)\n\nl = int(input())\nsolve(l)", "#include <cmath>\n#include <cstdio>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <set>\n#include <map>\n#define REP(i,n) for(ll i = 0; i < (ll)n; i++)\n#define INF 1000000000000000\nusing namespace std;\ntypedef long long ll;\ntypedef double db;\ntypedef string str;\n\nstruct edge{ll from, to, weight;};\n\nint main(){\n ll L;\n cin >> L;\n ll hoge = L;\n ll cnt = 0;\n while(hoge!=0){\n hoge = hoge/2;\n cnt++;\n }\n ll N = cnt;\n vector<edge> E;\n for(ll i = 1; i <= N-1; i++){\n edge e;\n e.from = i, e.to = i+1, e.weight = 1<<(i-1);\n E.push_back(e);\n e.weight = 0;\n E.push_back(e);\n }\n ll max = (1<<(N-1)) - 1;\n while(max!=L-1){\n edge e;\n e.from = floor(log2(L-max-1))+1, e.to = N; e.weight = max+1;\n E.push_back(e);\n max += 1<<(e.from-1);\n }\n cout << N << \" \" << E.size() << endl;\n for(auto e: E){\n cout << e.from << \" \" << e.to << \" \" << e.weight << endl;\n }\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint l;\nint main () {\n cin >> l;\n int n = log2(l) + 1;\n int m = __builtin_popcount(l) - 1 + (n - 1) * 2;\n int lst = 1;\n cout << n << \" \" << m << endl;\n \n for (int i = 0; i < n - 1; i++) {\n\tcout << i + 1 << \" \" << i + 2 << \" \" << 0 << '\\n';\n\tcout << i + 1 << \" \" << i + 2 << \" \" << lst << '\\n';\n\tlst *= 2;\n }\n int k = __builtin_popcount(l) - 1;\n int cur = n - 1;\n l -= pow(2, cur);\n for (int i = n - 2; i >= 0; i--) {\n\tif (l >= pow(2, i)) {\n\t l -= pow(2, i);\n\t cout << cur << \" \" << n << \" \" << lst << '\\n';\n\t lst += pow(2, i);\n\t}\n\tcur--;\n }\n\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef pair<int,int> pii;\ntypedef long long int ll;\n\n#define INF 1 << 30\n#define REP(i,n) for(ll i=0; i<(int)(n); i++)\n#define FOR(i,k,n) for(ll i=(k);i<(int)(n);i++)\nint l;\nint r;\nvector<pii> v;\n\nint main(){\n cin >> l;\n r = log2(l);\n int n = r+1;\n int m = 2*r;\n l -= pow(2,r);\n int node = n-1;\n int len = pow(2,r);\n while(l > 0 && node > 0){\n //cout << node <<endl;\n if(l>=pow(2,node-1)){\n v.push_back(pii(node,len));\n m++;\n l -= pow(2,node-1);\n len += pow(2,node-1);\n }\n node--;\n }\n cout << n << \" \" << m <<endl;\n REP(i,n-1){\n cout << i+1 << \" \" << i+2 << \" \" << pow(2,i) << endl;\n cout << i+1 << \" \" << i+2 << \" \" << 0 << endl;\n }\n for(int i = 0; i < v.size();i++){\n cout << v[i].first << \" \" << n << \" \" << v[i].second << endl;\n }\n}\n", "L = int(input())\nnode = 0\nfor i in range(21):\n if L < 2**i:\n L2 = 2**(i-1)\n N = i\n node = i - 1\n break\n\nl = L - L2\n\nL_reg = L2\nL_tmp = L2\nL_new = L2\nL_bai = 1\n\na = []\nb = []\n\ndef make_arr(init, N, a, b):\n global L_reg\n global L_tmp # 各再帰計算時の値\n global L_new # 単純なループ用\n global L_bai\n\n L_new = L_reg\n\n if [init, N] in a:\n # L_tmp = L_new\n L_tmp = L_new - L_bai\n L_bai *= 2\n # L_new += 1\n make_arr(init+1, N, a, b)\n a.remove([init, N])\n b.remove(max(b))\n else:\n a.append([init, N])\n b.append(L_new)\n L_reg += 1\n L_bai = 1\n\n\nfor i in range(l):\n make_arr(1,N,a,b)\n\nfor i in range(len(a)):\n a[i].append(b[i])\n\narr_0 = []\narr_2 = []\n\nfor i in range(node):\n arr_0.append([i + 1, i + 2, 0])\n arr_2.append([i + 1, i + 2, 2**i])\n\nprint(node+1,len(arr_0)+len(arr_2)+len(a))\nfor i in arr_0:\n print(i[0], i[1], i[2])\nfor i in arr_2:\n print(i[0], i[1], i[2])\nfor i in a:\n print(i[0], i[1], i[2])", "#include <iostream>\n#include <utility>\n#include <tuple>\n#include <string>\n#include <cstdint>\n#include <vector>\n#include <array>\n#include <queue>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <cmath>\n#include <cassert>\nusing namespace std;\nusing i64 = int64_t;\nstruct E { int v, w; };\nint id(int u) { return 20 - u; }\nint l;\nvector<E> g[20];\nint main() {\n cin >> l;\n for (int u = 19; u > 0; --u) {\n g[u].push_back({ u - 1, 0 });\n }\n for (int i = 0; (1 << (i + 1)) <= l; ++i) {\n g[i + 1].push_back({ i, 1 << i });\n }\n for (int i = 0; i < 19; ++i) {\n if ((l & (1 << i))) {\n int x = l & ~((1 << (i + 1)) - 1);\n if (x != 0) {\n g[19].push_back({ i, x });\n }\n }\n }\n int size = 0;\n for (int u = 0; u < 20; ++u) size += g[u].size();\n cout << 20 << ' ' << size << endl;\n for (int u = 19; u >= 0; --u) {\n for (E e : g[u]) {\n cout << id(u) << ' ' << id(e.v) << ' ' << e.w << endl;\n }\n }\n return 0;\n}", "#include <bits/stdc++.h>\n\ntypedef std::pair<int, int> pii; \n\nint n, m, i, j, k, L, cntE;\nstd::vector<pii> gra[70];\n\ninline void adde(int u, int v, int w) {\n gra[u].push_back(std::make_pair(v, w)); \n cntE++; \n}\n\nint main() {\n scanf(\"%d\", &L);\n int cntV = 0, _L = L;\n while (_L) {\n cntV++;\n _L >>= 1;\n }\n for (int i = 1; i < cntV; i++) {\n adde(i, i + 1, 0);\n adde(i, i + 1, 1 << (cntV - i - 1));\n }\n int sum = 1 << (cntV - 1);\n for (int i = cntV - 1; i >= 1; i--) {\n if (L & (1 << (i - 1))) {\n adde(1, cntV - i + 1, sum);\n sum += 1 << (i - 1);\n }\n }\n printf(\"%d %d\\n\", cntV, cntE);\n for (int i = 1; i <= cntV; i++) {\n for (pii E : gra[i]) {\n printf(\"%d %d %d\\n\", i, E.first, E.second);\n }\n }\n return 0; \n}", "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(10 ** 9)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\n# MOD = 998244353\n\n\nL = int(sys.stdin.buffer.readline())\n# 2べきなら2個ずつ辺を張ればOK\nV = L.bit_length()\nans = []\nfor v in range(V - 1):\n ans.append((v, v + 1, 0))\n ans.append((v, v + 1, 2 ** v))\n\npos = V - 2\nw = 1 << L.bit_length() - 1\nwhile pos >= 0:\n if L & (1 << pos):\n ans.append((pos, V - 1, w))\n w |= L & (1 << pos)\n pos -= 1\nE = len(ans)\nprint(V, E)\nfor r in ans:\n v, u, w = r\n v += 1\n u += 1\n print(v, u, w)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<P, int> PI;\nvector<PI> v;\n\nint main()\n{\n\tint l;\n\tcin >> l;\n\n\tint r;\n\tfor( r = 0; r <= 19; r++ ) {\n\t\tif( (1 << (r + 1) ) > l ) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tint n = r + 1;\n\tfor( int i = 1; i < n; i++ ) {\n\t\tv.push_back(make_pair( make_pair(i, i + 1), 0 ) );\n\t\tv.push_back(make_pair( make_pair(i, i + 1), 1 << (i - 1) ) );\n\t}\n\tfor( int t = n; t > 0; t-- ) {\n\t\tif( l - (1 << (t - 1) ) >= (1 << r) ) {\n\t\t\tv.push_back(make_pair( make_pair(t, n), l - (1 << (t - 1) ) ) );\n\t\t\tl -= 1 << (t - 1);\n\t\t}\n\t}\n\n\tcout << n << \" \" << v.size() << endl;\n\tfor( int i = 0; i < v.size(); i++ ) {\n\t\tcout << v[i].first.first << \" \" << v[i].first.second << \" \" << v[i].second << endl;\n\t}\n\n\treturn 0;\n}\n", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n List<int[]> edges = new ArrayList<>();\n int L = scanner.nextInt();\n\n int r = findR(L);\n int N = r + 1;\n for (int i = N - 1; i >= 1; i--) {\n edges.add(new int[]{i, i + 1, 0});\n edges.add(new int[]{i, i + 1, 1 << (N - i - 1)});\n }\n\n int k = L - (1 << r);\n for (int i = r - 1; i >= 0; i--) {\n int d = 1 << i;\n if (k >= d) {\n edges.add(new int[]{1, N - i, L - k});\n k -= d;\n }\n }\n\n System.out.printf(\"%d %d\\n\", N, edges.size());\n for (int[] edge : edges) {\n System.out.printf(\"%d %d %d\\n\", edge[0], edge[1], edge[2]);\n }\n }\n\n private static int findR(int L) {\n int left = 0;\n int right = (int) Math.floor(Math.log(L) / Math.log(2)) + 1;\n while (right - left > 1) {\n int mid = (left + right) / 2;\n if (1L << mid > L) {\n right = mid;\n } else {\n left = mid;\n }\n }\n return left;\n }\n}\n", "#include \"bits/stdc++.h\"\n#include \"math.h\"\n \nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vll;\ntypedef vector<vll> vvll;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<int> vin;\n#define rep(i,a,b) for(ll i=(a);i<(b);++i)\n#define SIZE(a) int((a).size();\nconst int INF=INT_MAX;\nstruct edge{ll from,to,length;};\nint main(){\n ll l;cin>>l;\n ll copy=l,r=0,n,m;\n while(copy>1){\n copy/=2;r++;\n }\n ll _copy=l;\n l-=pow(2,r);\n n=r+1;m=2*r;\n ll t=r;\n vll tt(0);\n while(l>0){\n if(l>=pow(2,t-1)){\n l-=pow(2,t-1);\n tt.push_back(t);\n }\n t--;\n }\n m+=tt.size();\n vector<edge> g(m);\n rep(i,0,r){\n g[i*2].from=i+1;g[i*2].to=i+2;g[i*2].length=0;\n g[i*2+1].from=i+1;g[i*2+1].to=i+2;g[i*2+1].length=pow(2,i);\n }\n rep(i,0,tt.size()){\n g[2*r+i].from=tt[i];g[2*r+i].to=n;g[2*r+i].length=_copy-pow(2,tt[i]-1);\n _copy-=pow(2,tt[i]-1);\n }\n cout<<n<<\" \"<<m<<endl;\n rep(i,0,m){\n cout<<g[i].from<<\" \"<<g[i].to<<\" \"<<g[i].length<<endl;\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,N) for(i=0;i<N;i++)\ntypedef long long ll;\ntypedef struct{\n int from,to,cost;\n}edge;\n\nint main(void){\n int i,n_node=1,n_2=1,L;\n cin >> L;\n vector<edge> v;\n while(2*n_2<=L&&n_node<20){\n v.push_back({n_node,n_node+1,n_2});\n n_2*=2;\n n_node++;\n }\n int N_2=n_2;\n for(i=n_node-1;i>0;i--){\n n_2/=2;\n if(L-n_2>=N_2){\n v.push_back({i,n_node,L-n_2});\n L-=n_2;\n }\n }\n REP(i,n_node-1){\n v.push_back({i+1,i+2,0});\n }\n cout << n_node << \" \" << v.size() << endl;\n REP(i,v.size()){\n cout << v[i].from << \" \" << v[i].to << \" \" << v[i].cost << endl;\n }\n return 0;\n}\n", "L = int(input())\nN = len(bin(L)) - 2 #N: Lの2進法での桁数\nnodes = []\nfor i in range(N - 1):\n u1, v1, w1 = i + 1, i + 2, 0\n u2, v2, w2 = i + 1, i + 2, (1 << i)\n nodes.append([u1, v1, w1])\n nodes.append([u2, v2, w2])\nfor i in range(1, N):\n if (L >> (i - 1)) & 1 == 1:\n u, v, w = i, N, (L >> i ) << i\n nodes.append([u, v, w])\nM = len(nodes)\nprint(N, M)\nfor i in range(M):\n u, v, w = nodes[i]\n print(u, v, w)", "L = int(input())\n\nN = L.bit_length()\n\nedges = [[] for _ in range(N)]\nfor i in range(N - 1):\n edges[i].append((i + 1, 0))\n edges[i].append((i + 1, 2**i))\n\nnow = 2**(N - 1)\n\nfor i in range(N - 1)[:: -1]:\n cnt = 2**i\n if L - now >= cnt:\n edges[i].append((N - 1, now))\n now += cnt\n\nM = sum(len(edges[i]) for i in range(N))\nprint(N, M)\n\nfor i in range(N):\n for to, cost in edges[i]:\n print(i + 1, to + 1, cost)", "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint popcount(long long n) { int cnt = 0; for ( ; n; n &= n - 1) cnt++; return cnt; }\nint MSB1(long long x) { int d = 0; while ((1LL << d) <= x) d++; return d; }\n\nint main() {\n int L; cin >> L;\n int n = MSB1(L);\n int m = (n - 1) * 2 + popcount(L) - 1;\n cout << n << \" \" << m << endl;\n for (int i = 0; i + 1 < n; i++) {\n cout << i + 1 << \" \" << i + 2 << \" \" << 0 << endl;\n cout << i + 1 << \" \" << i + 2 << \" \" << (1 << i) << endl;\n }\n int cur = 1 << (n - 1);\n for (int i = n - 2; i >= 0; i--) if (L & (1 << i)) {\n cout << i + 1 << \" \" << n << \" \" << cur << endl;\n cur += 1 << i;\n }\n return 0;\n}\n", " #include <bits/stdc++.h>\n using namespace std;\n typedef long long ll;\n typedef pair<ll, ll> P;\n \n int L, N = 0;\n vector<vector<int>> edge;\n \n int main(void){\n \t\n \tscanf(\"%d\", &L);\n while(1 << N <= L) ++N;\n \n for(int i = 1; i < N; ++i){\n edge.push_back({i, i + 1, 1 << (i - 1)});\n edge.push_back({i, i + 1, 0});\n }\n \t\n \tint corrent = (1 << (N - 1)) - 1;\n \t\n \tfor(int i = N - 1; i >= 1 && corrent != L - 1; i--){\n \t \n \t int add = 1 << (i - 1);\n \t \n \t if(corrent + add <= L - 1){\n \t edge.push_back({i, N, corrent + 1});\n \t corrent += add;\n \t }\n \t \n \t}\n \t\n \tprintf(\"%d %d\\n\", N, (int)edge.size());\n \tfor(auto i : edge) printf(\"%d %d %d\\n\", i[0], i[1], i[2]);\n \t//for(auto i : edge) if (i[0]==i[1]&&i[1]==i[2]){} \n return 0;\n }", "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\n\nconst int MAX = (int)(1e5 + 5);\nconst ll INF = (ll)(1e10 + 5);\n\nint l;\n\nint n = 20;\n\nvector<tuple<int, int, int>> ans;\n\nint main(void) {\n // Here your code !\n scanf(\"%d\", &l);\n\n int r;\n\n for (ll i = 1; i <= n; ++i) {\n if ((1 << i) > l) {\n r = i - 1;\n break;\n }\n }\n\n for (int i = 0; i < r; ++i) {\n int node = i + 1;\n ans.push_back(make_tuple(node, node + 1, 0));\n ans.push_back(make_tuple(node, node + 1, 1 << i));\n }\n\n for (int i = r; i >= 1; --i) {\n if (l - (1 << r) >= (1 << (i - 1))) {\n ans.push_back(make_tuple(i, r + 1, l - (1 << (i - 1))));\n l -= 1 << (i - 1);\n }\n }\n\n printf(\"%d %d\\n\", r + 1, ans.size());\n\n for (auto &e: ans) {\n printf(\"%d %d %d\\n\", get<0>(e), get<1>(e), get<2>(e));\n }\n\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int mxn = 22;\nvector< pair<int , int > > adj[mxn];\nint main()\n{\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tcout.tie(0);\n\tint n;\n\tcin>>n;\n\tint pw[22];\n\tpw[0] = 1;\n\tfor(int i = 1; i < 22; i++)\n\t{\n\t\tpw[i] = pw[i-1] *2;\n\t}\n\tvector< int > vt;\n\twhile(n)\n\t{\n\t\tvt.push_back(n%2);\n\t\tn/=2;\n\t}\n\t//reverse(vt.begin() , vt.end());\n\tn = vt.size();\n\tint edge = 0;\n\tfor(int i = 1; i < n; i++)\n\t{\n\t\tadj[i].push_back(make_pair(i+1 , 0));\n\t\tadj[i].push_back(make_pair(i+1 , pw[i-1]));\n\t\tedge +=2;\n\t}\n\tint last = pw[n-1];\n\tfor(unsigned int i = 0; i < vt.size()-1; i++)\n\t{\n\t\tif(vt[i]==1)\n\t\t{\n\t\t\tadj[i+1].push_back(make_pair(n , last));\n\t\t\tlast += pw[i];\n\t\t\tedge+=1;\n\t\t}\n\t}\n\tcout<<n<<\" \"<<edge<<endl;\n\tfor(int i = 1; i <= n; i++)\n\t{\n\t\tfor(auto v: adj[i])\n\t\t{\n\t\t\tcout<<i<<\" \"<<v.first<<\" \"<<v.second<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n", "L = int(input())\nk = 1\npower = 4\nwhile L >= power:\n k += 1\n power *= 2\n\npower = 1\nans = []\nfor i in range(k):\n ans.append([k-i, k+1-i, 0])\n ans.append([k-i, k+1-i, power])\n power *= 2\n\nN = k+1\nl = power\nrest = L - l\nwhile rest > 0:\n power = 1\n k = 0\n while rest >= power * 2:\n power *= 2\n k += 1\n ans.append([1, N-k, l])\n l += power\n rest -= power\n\nprint(*[N, len(ans)])\nfor i in ans:\n print(*i)", "#include <bits/stdc++.h> \nusing namespace std;\ntypedef long long ll;\nll INFL = 1000000000000000010;//10^18 = 2^60\nint INF = 2000000000;//10^9\nll MOD = 998244353;\n\nint main() {\n int L;\n cin >> L;\n L--;\n int cnt = 0;\n int M = 0;\n vector<pair<pair<int, int>,int>> ANS(0);\n for(int i = 0; i < 20; i++){// 2^cnt <= L < 2^(cnt+1)\n if(pow(2, i) - 1 <= L){\n cnt = i;\n }\n }\n \n for(int i = 0; i < cnt; i++){\n ANS.push_back({{i+1, i+2}, 0});\n ANS.push_back({{i+1, i+2}, pow(2, i)});\n }\n int V = cnt + 1;//頂点数\n M += pow(2, cnt) -1;\n while(L != M){\n cnt--;\n if(L - M >= pow(2, cnt)){\n ANS.push_back({{cnt+1, V},M+1});\n M += pow(2, cnt);\n }\n }\n \n cout << V << \" \" << ANS.size() << endl;\n for(int i = 0; i < ANS.size(); i++){\n cout << ANS.at(i).first.first << \" \" << ANS.at(i).first.second << \" \" << ANS.at(i).second << endl;\n }\n}", "def f(k,L,p): \n m = L\n while m%3 > 0:\n p += [[k+1,20,(m-1)*(3**k)]]\n m = m-1\n if m == 0:\n print(20,len(p))\n for l in p:\n print(\" \".join([str(t) for t in l]))\n quit()\n for i in range(3):\n p += [[k+1,k+2,i*(3**k)]]\n m = m//3\n if m > 0:\n return f(k+1,m,p)\n\n\n\n\nf(0,int(input()),[])", "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct edge {\n ll src, dst, cost;\n edge() {}\n edge(ll a, ll b, ll c) : src(a), dst(b), cost(c) {}\n};\n\nint main() {\n ll L, r = 1;\n ll N = 0, M;\n vector<edge> G;\n\n cin >> L;\n\n while (r <= L) {\n r *= 2;\n N++;\n }\n for (ll i = 1; i < N; i++) {\n G.push_back( edge(i, i+1, 0) );\n G.push_back( edge(i, i+1, (1<<(i-1))) );\n }\n\n ll remain = L - (1<<(N-1));\n\n for (ll i = N-1; i >= 1; i--) {\n if (!remain) { break; }\n\n if ( remain >= (1 << (i-1)) ) {\n G.push_back( edge(i, N, L-remain) );\n remain -= (1 << (i-1));\n }\n }\n\n M = G.size();\n\n cout << N << \" \" << M << endl;\n\n for (auto &e: G) {\n cout << e.src << \" \" << e.dst << \" \" << e.cost << endl;\n }\n\n return 0;\n}", "L = int(input())\n\nprint(L.bit_length(), 2*(L.bit_length()-1) + (bin(L)[3:]).count('1'))\nfor i in range(L.bit_length()-1,0,-1):\n print(i,i+1,0)\n print(i,i+1,1<<(i-1))\n if (L >> i-1) & 1:\n print(i,L.bit_length(),L>>i<<i)\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <set>\n#include <queue>\n#include <stack>\n#include <map>\n#include <algorithm>\n#include <math.h>\n#include <cassert>\n#define rep(i,n) for(int i = 0; i < n; ++i )\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n\nint main() {\n int l;\n cin >> l;\n int n = 1;\n while(1<<n<=l) ++n;\n\n vector<tuple<int,int,int>> ans;\n rep(i,n-1) {\n ans.emplace_back(i,i+1,0);\n ans.emplace_back(i,i+1,1<<i);\n }\n l -= 1<<(n-1);\n int val = 1<<(n-1);\n for(int p = n-2; p>=0; --p){\n if(l>=1<<p){\n ans.emplace_back(p,n-1,val);\n val += 1<<p;\n l -= 1<<p;\n }\n }\n cout << n << \" \" << ans.size() << endl;\n rep(i,ans.size()){\n int u,v,w;\n tie(u,v,w) = ans[i];\n printf(\"%d %d %d\\n\",u+1,v+1,w);\n }\n}", "import static java.lang.Math.*;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.InputMismatchException;\nimport java.util.List;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic long LINF = 1L << 55;\n\tstatic int MOD = 1000000007;\n\tstatic int[] mh4 = { 0, -1, 1, 0 };\n\tstatic int[] mw4 = { -1, 0, 0, 1 };\n\tstatic int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\tstatic int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\n\tstatic class TaskX {\n\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint l = in.nextInt();\n\n\t\t\t// l 以下の最大の2べきの整数 r を求める\n\t\t\tint r = f(l);\n\n\t\t\t// 追加するパスの経路数\n\t\t\tint x = l - (int)pow(2, r);\n\n\t\t\t// 基準のグラフを構築\n\t\t\tList<P> list = new ArrayList<>();\n\t\t\tfor (int i = 1; i <= r; i++) {\n\t\t\t\tlist.add(new P(i, i+1, 0));\n\t\t\t\tlist.add(new P(i, i+1, (int)pow(2, i-1)));\n\t\t\t}\n\n\t\t\t// 値の最大値と構築するノードの情報をもとに辺を構築\n\t\t\tint max = l;\n\t\t\tchar[] info = g(r, x).toCharArray();\n\t\t\tfor (int i = r; i >= 0; i--) {\n\t\t\t\tif (info[i] == '0') continue;\n\t\t\t\tmax--;\n\t\t\t\tint cost = max - ((int)pow(2, i) - 1);\n\t\t\t\tlist.add(new P(i+1, r+1, cost));\n\t\t\t\tmax = cost;\n\t\t\t}\n\n\t\t\tout.printf(\"%d %d\\n\", r+1, list.size());\n\t\t\tfor (P p : list) {\n\t\t\t\tout.println(p);\n\t\t\t}\n\n\t\t}\n\t}\n\n\tstatic class P {\n\t\tint l, r, c;\n\n\t\tpublic P(int l, int r, int c) {\n\t\t\tsuper();\n\t\t\tthis.l = l;\n\t\t\tthis.r = r;\n\t\t\tthis.c = c;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn l + \" \" + r + \" \" + c;\n\t\t}\n\t}\n\n\tstatic int f(int l) {\n\t\tint ret = 0;\n\t\tint num = 1;\n\t\twhile (num * 2 <= l) {\n\t\t\tret++;\n\t\t\tnum *= 2;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic String g(int r, int x) {\n\t\tString str = Integer.toBinaryString(x);\n\t\tstr = String.format(\"%\"+(r+1)+\"s\", str).replace(\" \", \"0\");\n\t\treturn reverse(str);\n\t}\n\n\tstatic String reverse(String str) {\n\t\tStringBuilder sb = new StringBuilder();\n\t\tsb.append(str);\n\t\treturn sb.reverse().toString();\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic int[] nextIntArrayDec(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArrayDec(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\t}\n\n\tstatic long max(long... n) {\n\t\tlong ret = n[0];\n\t\tfor (int i = 0; i < n.length; i++) {\n\t\t\tret = Math.max(ret, n[i]);\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic int max(int... n) {\n\t\tint ret = n[0];\n\t\tfor (int i = 0; i < n.length; i++) {\n\t\t\tret = Math.max(ret, n[i]);\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic long min(long... n) {\n\t\tlong ret = n[0];\n\t\tfor (int i = 0; i < n.length; i++) {\n\t\t\tret = Math.min(ret, n[i]);\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic int min(int... n) {\n\t\tint ret = n[0];\n\t\tfor (int i = 0; i < n.length; i++) {\n\t\t\tret = Math.min(ret, n[i]);\n\t\t}\n\t\treturn ret;\n\t}\n\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint l, u[100], v[100], w[100];\n\nint main() {\n\tcin >> l;\n\tint eid = 0, t = 0;\n\twhile((1<<t+1) <= l) t++;\n\tfor(int i = 1; i <= t; i++) {\n\t\tu[++eid] = i, v [eid] = i+1, w[eid] = 0;\n\t\tu[++eid] = i, v [eid] = i+1, w[eid] = (1<<i-1);\n\t}\n\tint r = l-(1<<t), p = (1<<t)-1;\n\t//cout << \"r=\" << r << \" p=\" << p << endl;\n\tfor(int i = 20; i >= 0; i--) { //边数 \n\t\tif(r-(1<<i) >= 0) {\n\t\t\tr -= (1<<i);\n\t\t\tint x = p+1;\n\t\t\tp += (1<<i);\n\t\t\tu[++eid] = i+1, v [eid] = t+1, w[eid] = x;\n\t\t}\n\t}\n\tcout << t+1 << \" \" << eid << endl;\n\tfor(int i = 1; i <= eid; i++) {\n\t\tcout << u[i] << \" \" << v[i] << \" \" << w[i] << endl;\n\t}\n\treturn 0;\n}", "def main():\n L = int(input())\n n = 1\n while 2**n <= L:\n n += 1\n n -= 1\n ans = []\n for i in range(1, n+1):\n ans.append([i, i+1, 0])\n ans.append([i, i+1, 2**(i-1)])\n for i in reversed(range(1, n+1)):\n if L-2**(i-1) >= 2**n:\n ans.append([i, n+1, L-2**(i-1)])\n L -= 2**(i-1)\n print(n+1, len(ans))\n for u, v, w in ans:\n print(u, v, w)\n\nif __name__ == \"__main__\":\n main()", "#include<iostream>\n#include<climits>\n#include<algorithm>\n#include<cmath>\n#include<vector>\n#include<string>\nusing namespace std;\ntypedef long long ll;\n\nll log(ll x, ll n){\n\tif(x==1){\n\t\treturn n;\n\t}else{\n\t\treturn log(x/2, n+1);\n\t}\n}\n\nll beki(ll x , ll n){\n\t\n\tll ans = 1;\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tans *= x;\n\t}\n\treturn ans;\n\t\n}\n\nint main(){\n\tll L;\n\tcin >> L;\n\n\tll r = log(L,0);\n\n\tll N = r+1;\n\n\tll M = 0;\n\tll buff[60][3];\n\t\n\tfor(int i = 0; i < N-1; i++)\n\t{\n\t\tbuff[M][0] = i+1;\n\t\tbuff[M][1] = i+2;\n\t\tbuff[M][2] = 0;\n\t\tbuff[M+1][0] = i+1;\n\t\tbuff[M+1][1] = i+2;\n\t\tbuff[M+1][2] = beki(2,i);\n\t\tM += 2;\n\t}\n\t\n\t\n\tfor(int i = N-1; i >= 1; i--)\n\t{\n\n\t\tif (L-beki(2,i-1) >= beki(2,r)){\n\t\t\tbuff[M][0] = i;\n\t\t\tbuff[M][1] = N;\n\t\t\tbuff[M][2] = L - beki(2,i-1);\n\t\t\tM++;\n\t\t\tL = L - beki(2,i-1);\n\t\t}\n\t}\n\t\n\tcout << N << \" \" << M << endl;\n\t\n\tfor(int i = 0; i < M; i++)\n\t{\n\t\tcout << buff[i][0] << \" \" << buff[i][1] << \" \" << buff[i][2] << endl;\n\t}\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define REP(i, n) for(int i = 0;i < n;i++)\n#define REPR(i, n) for(int i = n;i >= 0;i--) \n#define FOR(i, m, n) for(int i = m;i < n;i++)\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\n#define SORT(v, n) sort(v, v+n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define llong long long\n#define pb(a) push_back(a)\n#define INF 999999999\nusing namespace std;\ntypedef pair<int, int> P;\ntypedef pair<llong, llong> LP;\ntypedef pair<int, P> PP;\ntypedef pair<llong, LP> LPP;\n\n\n\nint main(){\n\n int l;\n cin>>l;\n int keta;\n REP(i,25){\n if(l<pow(2,i)){\n keta = i;\n break;\n }\n }\n int x = l;\n int a[keta];\n REP(i,keta){\n a[i] = x%2;\n x -= x%2;\n x /= 2;\n }\n\n int count = 0;\n REP(i,keta){\n if(a[i]==1){\n count++;\n }\n }\n int n,m;\n n = keta;\n m = count+keta*2-3;\n cout<<n<<\" \"<<m<<endl;\n\n FOR(i,1,n){\n cout<<i<<\" \"<<i+1<<\" \"<<0<<endl;\n cout<<i<<\" \"<<i+1<<\" \"<<pow(2,n-i-1)<<endl;\n }\n\n int sum = 0;\n REP(i,n-1){\n if(a[i]==1){\n sum += pow(2,i);\n cout<<1<<\" \"<<n-i<<\" \"<<l-sum<<endl;\n }\n }\n\n return 0;\n}", "L=int(input())\nn=len(str(bin(L)))-3\ne=[]\nfor i in range(n):\n e.append((i+1, i+2, 0))\n e.append((i+1, i+2, 2**(n-i-1)))\nh=2**n\nfor i, c in enumerate(str(bin((L)))[2:]):\n if c==\"1\"and i:\n e.append((1,i+1,h))\n h+=2**(n-i)\nprint(n+1,len(e))\nfor i in e:print(*i)", "L=int(input())\nN,D,p=L.bit_length(),[],print\nP=1<<(N-1)\nfor i in range(2,N+1):\n s=N-i\n D+=[(i-1,i,0),(i-1,i,1<<s)]\n if (L>>s)&1:D+=[(1,i,P)];P+=1<<s\np(N,len(D))\nfor x,y,c in D:p(x,y,c)", "L = int(input())\nr = 0\nwhile 2 ** r <= L:\n r += 1\nr -= 1\n\nans = []\nN = r + 1\nfor i in range(1, N):\n ans.append((i, i + 1, 0))\n ans.append((i, i + 1, 2 ** (i - 1)))\n \nfor t in range(N - 1, 0, -1):\n if L - 2 ** (t - 1) >= 2 ** r:\n ans.append((t, N, L - 2 ** (t - 1)))\n L -= 2 ** (t - 1)\n \nprint(N, len(ans))\nfor i in ans:\n print(i[0], i[1], i[2])", "/**\n * Created at 18:48 on 2019-08-24\n */\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n static FastScanner sc = new FastScanner();\n static Output out = new Output(System.out);\n\n static final int[] dx = {0, 1, 0, -1};\n static final int[] dy = {-1, 0, 1, 0};\n\n static final long MOD = (long) (1e9 + 7);\n static final long INF = Long.MAX_VALUE / 2;\n\n public static class Solver {\n public Solver() {\n\n int L = sc.nextInt();\n\n String l2 = Integer.toBinaryString(L);\n\n int N = l2.length();\n int M = 2*(N-1) + Integer.bitCount(L) - 1;\n\n out.println(N + \" \" + M);\n\n for (int i=1; i<N; i++) {\n out.println(i + \" \" + (i+1) + \" \" + (1<<(N-1-i)));\n out.println(i + \" \" + (i+1) + \" 0\");\n }\n\n int cost = L;\n for (int i=0; i<l2.length()-1; i++) {\n if (l2.charAt(N-1-i) == '0') continue;\n\n cost -= 1<<i;\n out.println(\"1 \" + (N-i) + \" \" + cost);\n }\n\n }\n }\n\n public static void main(String[] args) {\n new Solver();\n out.flush();\n }\n\n static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n public boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public int[] nextIntArray(int N, boolean oneBased) {\n if (oneBased) {\n int[] array = new int[N + 1];\n for (int i = 1; i <= N; i++) {\n array[i] = sc.nextInt();\n }\n return array;\n } else {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = sc.nextInt();\n }\n return array;\n }\n }\n\n public long[] nextLongArray(int N, boolean oneBased) {\n if (oneBased) {\n long[] array = new long[N + 1];\n for (int i = 1; i <= N; i++) {\n array[i] = sc.nextLong();\n }\n return array;\n } else {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = sc.nextLong();\n }\n return array;\n }\n }\n }\n\n static class Output extends PrintWriter {\n\n public Output(PrintStream ps) {\n super(ps);\n }\n\n public void print(int[] a, String separator) {\n for (int i = 0; i < a.length; i++) {\n if (i == 0) print(a[i]);\n else print(separator + a[i]);\n }\n println();\n }\n\n public void print(long[] a, String separator) {\n for (int i = 0; i < a.length; i++) {\n if (i == 0) print(a[i]);\n else print(separator + a[i]);\n }\n println();\n }\n\n public void print(String[] a, String separator) {\n for (int i = 0; i < a.length; i++) {\n if (i == 0) print(a[i]);\n else print(separator + a[i]);\n }\n println();\n }\n\n public void print(ArrayList a, String separator) {\n for (int i = 0; i < a.size(); i++) {\n if (i == 0) print(a.get(i));\n else print(separator + a.get(i));\n }\n println();\n }\n }\n\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nstruct Edge {\n int src, dst, w;\n Edge(int _s, int _d, int _w) : src(_s), dst(_d), w(_w) {}\n Edge() {}\n};\n\nint main() {\n cin.tie(0); ios::sync_with_stdio(false);\n\n ll L;\n cin >> L;\n\n int d = 0;\n for (int p = 2; p <= L; p *= 2) ++d;\n\n const int n = d + 1;\n vector<Edge> edge;\n for (int i = 1, p = 1; i < n; ++i) {\n edge.emplace_back(Edge(i, i + 1, 0));\n edge.emplace_back(Edge(i, i + 1, p));\n p *= 2;\n }\n\n int sum = pow(2, d), res = L - sum;\n for (int i = d - 1; 0 <= i; --i) {\n if (res >> i & 1) {\n edge.emplace_back(Edge(i + 1, n, sum));\n sum += pow(2, i);\n }\n }\n\n // Output\n cout << n << ' ' << edge.size() << '\\n';\n for (const auto &e : edge)\n cout << e.src << ' ' << e.dst << ' ' << e.w << '\\n';\n\n return 0;\n}\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint L = sc.nextInt();\n\t\tint r=0;\n\t\tList<Pair> resList = new ArrayList<>();\n\t\tfor(int i=19;i>0;i--){\n\t\t\tif(Math.pow(2, i)<=L){\n\t\t\t\tr = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tint N = r+1;\n\t\tfor(int i=1;i<N;i++){\n\t\t\tresList.add(new Pair(i,i+1,0));\n\t\t\tresList.add(new Pair(i, i+1, (int)Math.pow(2, i-1)));\n\t\t}\n\t\tfor(int i=r;i>0;i--){\n\t\t\tint tmp = (int) Math.pow(2, i-1);\n\t\t\tif((L-tmp)>=Math.pow(2, r)){\n\t\t\t\tresList.add(new Pair(i, N, L-tmp));\n\t\t\t\tL -= tmp;\n\t\t\t}\n\t\t}\n\t\tout.println(N+\" \"+resList.size());\n\t\tfor(Pair tmp: resList){\n\t\t\tout.println(tmp.u+\" \"+tmp.v+\" \"+tmp.w);\n\t\t}\n\t\tout.flush();\n\t}\n}\n\nclass Pair{\n\tfinal int u;\n\tfinal int v;\n\tfinal int w;\n\tpublic Pair(int u, int v, int w){\n\t\tthis.u=u;\n\t\tthis.v=v;\n\t\tthis.w=w;\n\t}\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}", "#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n \nint main(){\n int L;\n vector<vector<int>> ans;\n int r=1,i=1;\n\n cin >> L;\n \n while(2*r<=L){\n ans.push_back({i,i+1,0});\n ans.push_back({i,i+1,r});\n ++i;\n r*=2;\n }\n \n while(r!=L){\n int j=log2(L-r);\n ans.push_back({j+1,i,r});\n r+=pow(2,j);\n }\n \n cout << i << \" \" << ans.size() << endl;\n for(int i=0;i<ans.size();++i) {\n cout << ans[i][0] << \" \" << ans[i][1] << \" \" << ans[i][2] << endl;\n }\n \n return 0;\n}", "#include<iostream>\n#include<climits>\n#include<vector>\n#include<list>\n#include<functional>\n#include<algorithm>\n#include<string>\n#include<cmath>\n#include<complex>\n#include<set>\n#include<map>\n#include<stack>\n#include<queue>\n#include<deque>\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define INF (int)1e9\n#define INFL (ll)1e11\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\n\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint L;\n\tcin >> L;\n\tvector<int> pow2;\n\tint tmp = 1;\n\twhile (tmp <= L) {\n\t\tpow2.push_back(tmp);\n\t\ttmp *= 2;\n\t}\n\tint N = pow2.size();\n\tint M = 2 * (N - 1);\n\tint i = N - 2;\n\tvector<pair<int, int>> sd;\n\twhile (L > pow2[N - 1]) {\n\t\tif (L - pow2[i] >= pow2[N - 1]) {\n\t\t\tL -= pow2[i];\n\t\t\tsd.push_back(P(i + 1, L));\n\t\t\tM++;\n\t\t}\n\t\ti--;\n\t}\n\tcout << N << \" \" << M << \"\\n\";\n\tfor (int i = 1;i < N;i++) {\n\t\tcout << i << \" \" << i + 1 << \" \" << 0 << \"\\n\";\n\t\tcout << i << \" \" << i + 1 << \" \" << pow2[i - 1] << \"\\n\";\n\t}\n\tREP(i, sd.size()) {\n\t\tcout << sd[i].first << \" \" << N << \" \" << sd[i].second << \"\\n\";\n\t}\n\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <cmath>\n#include <map>\n\n#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)\n#define rep(i,n) reps(i,0,n)\nusing namespace std;\nusing ll = long long;\n\nstruct edge{ll from,to,weight;};\nint vertex,num=1;\nvector<edge> g;\nvector<int> v;\n\nvoid multi_2(){\n for(auto &elem : g){\n elem.weight *= 2;\n }\n vertex++;\n \n num *= 2;\n g.push_back({vertex,vertex+1,1});\n g.push_back({vertex,vertex+1,0});\n}\n\nvoid plus_1(){\n g.push_back({1,vertex+1,num});\n num++;\n}\n\nint main(){\n ll L;\n cin >> L;\n ll tmp = L;\n vertex=0;\n \n while(tmp > 0){\n v.push_back(tmp%2);\n tmp /= 2;\n }\n\n reps(i,1,v.size()){\n if(v[v.size()-1-i] == 0){\n multi_2();\n }else{\n multi_2();\n plus_1();\n }\n }\n cout << vertex+1 << \" \" << g.size() << endl;\n for(auto e : g){\n cout << e.from << \" \" << e.to << \" \" << e.weight << endl;\n }\n\n return 0;\n} ", "L = int(input()) - 1\n\nN = []\nn = 0\n\nfor i in range(20):\n if 2 ** i - 1 > L:\n break\n n = i\n\nc = 2 ** n - 1\nd = 2 ** (n - 1)\nm = 2 * n\nn += 1\n\nfor i in range(n-1, 0, -1):\n A = [(i, i+1, 0), (i, i+1, d)]\n if L - (d - 1) > c:\n L -= d\n m += 1\n A.append((i, n, L+1))\n N.append(A)\n d //= 2\n \nprint(n, m)\nfor a in N:\n for b in a:\n print(*b)", "L = int(input())\n\nr = 0\nwhile 2 ** r <= L:\n r += 1\n\nE = []\nfor i in range(1, r):\n E.append((i, i + 1, 0))\n E.append((i, i + 1, 2 ** (i - 1)))\n\n# 2**(r-1) ～ L-1 のPATHがない。\n\nn = 2 ** (r - 1)\n\n###\nwhile True:\n d = L - 1 - n + 1\n if d <= 0:\n break\n zi = 0\n while 2 ** (zi) <= d:\n zi += 1\n\n E.append((zi, r, n))\n n = n + 2 ** (zi - 1)\n\nprint(\"{} {}\".format(r, len(E)))\n\nfor e in E:\n print(\"{} {} {}\".format(e[0], e[1], e[2]))\n", "#include<iostream>\n#include<vector>\n#include<string>\n\nusing namespace std;\n\nint main(){\n\tint l, ans = 0;\n\tcin >> l;\n\tint n = 1, m = 0;\n\twhile((1 << n) <= l) n++;\n\tvector<int> a(n);\n\tvector<string> s;\n\tfor(int i = 1; i < n; i++){\n\t\tint x = 1 << (i - 1);\n\t\ts.push_back(to_string(i) + \" \" + to_string(i + 1) + \" 0\");\n\t\ts.push_back(to_string(i) + \" \" + to_string(i + 1) + \" \" + to_string(x));\n\t\ta[i] = a[i - 1] + x;\n\t}\n\tint t = a[n - 1] + 1;\n\tfor(int i = n - 1; i >= 0; i--){\n\t\tif(a[i] + t <= l - 1){\n\t\t\ts.push_back(to_string(i + 1) + \" \" + to_string(n) + \" \" + to_string(t));\n\t\t\tt = a[i] + t + 1;\n\t\t}\n\t}\n\tm = s.size();\n\tcout << n << \" \" << m << endl;\n\tfor(auto&& i : s){\n\t\tcout << i << endl;\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#include<chrono>\n#define ll long long\nusing namespace std;\nll MOD = 1e9 + 7;\nll A, B, H, N, M, L, K, W, X, Y, Z;\nll ans = 0;\nint main() {\n\tcin >> L;\n\tvector<tuple<int,int,int>>path;\n\tvector<bool>flag;\n\twhile (L != 2) {\n\t\tif (L & 1) {\n\t\t\tL--;\n\t\t\tflag.push_back(1);\n\t\t}\n\t\telse {\n\t\t\tL /= 2;\n\t\t\tflag.push_back(0);\n\t\t}\n\t}\n\tpath.push_back(make_tuple(1, 2, 0));\n\tpath.push_back(make_tuple(1, 2, 1));\n\tN = 2;\n\tll l = 2;\n\tfor (int i = flag.size() - 1; i >= 0; i--) {\n\t\tif (flag[i]) {\n\t\t\tpath.push_back(make_tuple(1, N, l));\n\t\t\tl++;\n\t\t}\n\t\telse {\n\t\t\tfor (int j = 0; j < path.size(); j++) {\n\t\t\t\tget<2>(path[j]) *= 2;\n\t\t\t}\n\t\t\tpath.push_back(make_tuple(N, N + 1, 0));\n\t\t\tpath.push_back(make_tuple(N, N + 1, 1));\n\t\t\tN++;\n\t\t\tl *= 2;\n\t\t}\n\t}\n\tcout << N <<\" \"<< path.size() << endl;\n\tfor (tuple<int, int, int> i : path)\n\t\tcout << get<0>(i) <<\" \"<< get<1>(i) <<\" \"<< get<2>(i) << endl;\n}\n", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define zero_pad(num) setfill('0') << std::right << setw(num)\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\n\nint main() {\n int l;\n cin >> l;\n int d;\n rep(i, 20){\n if(1 & (l >> i))d = i + 1;\n }\n\n int n = d;\n int m = 2 * (d - 1);\n vector<int> u, v, w;\n rep(i, d - 1)rep(j, 2){\n u.push_back(i+1);\n v.push_back(i+2);\n w.push_back(j * pow(2, i));\n }\n for(int i = d - 2; i >= 0; i--){\n if(l - pow(2, i) >= pow(2, d - 1)){\n u.push_back(i+1);\n v.push_back(d);\n w.push_back(l - pow(2, i));\n l -= pow(2, i);\n m++;\n }\n }\n cout << n << ' ' << m << endl;\n rep(i, u.size()){\n cout << u[i] << ' ' << v[i] << ' ' << w[i] << endl;\n }\n}", "###############################################################################\n\nfrom sys import stdout\nfrom bisect import bisect_left as binl\nfrom copy import copy, deepcopy\n\n\nmod = 1\n\n\ndef intin():\n input_tuple = input().split()\n if len(input_tuple) <= 1:\n return int(input_tuple[0])\n return tuple(map(int, input_tuple))\n\n\ndef intina():\n return [int(i) for i in input().split()]\n\n\ndef intinl(count):\n return [intin() for _ in range(count)]\n\n\ndef modadd(x, y):\n global mod\n return (x + y) % mod\n\n\ndef modmlt(x, y):\n global mod\n return (x * y) % mod\n\n\ndef lcm(x, y):\n while y != 0:\n z = x % y\n x = y\n y = z\n return x\n\n\ndef combination(x, y):\n assert(x >= y)\n\n if y > x // 2:\n y = x - y\n\n ret = 1\n\n for i in range(0, y):\n j = x - i\n i = i + 1\n\n ret = ret * j\n ret = ret // i\n\n return ret\n\n\ndef get_divisors(x):\n retlist = []\n for i in range(1, int(x**0.5) + 3):\n if x % i == 0:\n retlist.append(i)\n retlist.append(x // i)\n return retlist\n\n\ndef get_factors(x):\n retlist = []\n for i in range(2, int(x**0.5) + 3):\n while x % i == 0:\n retlist.append(i)\n x = x // i\n retlist.append(x)\n return retlist\n\n\ndef make_linklist(xylist):\n linklist = {}\n for a, b in xylist:\n linklist.setdefault(a, [])\n linklist.setdefault(b, [])\n linklist[a].append(b)\n linklist[b].append(a)\n return linklist\n\n\ndef calc_longest_distance(linklist, v=1):\n distance_list = {}\n distance_count = 0\n distance = 0\n vlist_previous = []\n vlist = [v]\n nodecount = len(linklist)\n\n while distance_count < nodecount:\n vlist_next = []\n for v in vlist:\n distance_list[v] = distance\n distance_count += 1\n vlist_next.extend(linklist[v])\n distance += 1\n vlist_to_del = vlist_previous\n vlist_previous = vlist\n vlist = list(set(vlist_next) - set(vlist_to_del))\n\n max_distance = -1\n max_v = None\n for v, distance in distance_list.items():\n if distance > max_distance:\n max_distance = distance\n max_v = v\n\n return (max_distance, max_v)\n\n\ndef calc_tree_diameter(linklist, v=1):\n _, u = calc_longest_distance(linklist, v)\n distance, _ = calc_longest_distance(linklist, u)\n return distance\n\n\n###############################################################################\n\n\ndef main():\n L = intin()\n\n r = 0\n while True:\n if 2**(r+1) > L:\n break\n r += 1\n\n n = r + 1\n\n path_list = []\n path_list.extend([(i + 1, i + 2, 0) for i in range(r)])\n path_list.extend([(i + 1, i + 2, 2**i) for i in range(r)])\n\n remain = L - 2**r\n next = 2**r\n\n for i in reversed(list(range(r))):\n if remain >= 2**i:\n path_list.append((i + 1, n, next))\n remain -= 2**i\n next += 2**i\n\n print('%d %d' % (n, len(path_list)))\n for path in path_list:\n print('%d %d %d' % path)\n\n\nif __name__ == '__main__':\n main()\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,a) for(int i = 0; i < (a); i++)\n#define ALL(a) (a).begin(),(a).end()\ntypedef long long ll;\ntypedef pair<int, int> P;\nconst int INF = 1e9;\nconst long long LINF = 1e18;\nconst long long MOD = 1e9 + 7;\n\nsigned main(){\n int l;\n cin >> l;\n int cnt = 0;\n while(pow(2, cnt) <= l) cnt++;\n vector<vector<int>> ans;\n for(int i = 1; i < cnt; i++){\n ans.push_back({i, i + 1, 0});\n ans.push_back({i, i + 1, (int)pow(2, i - 1)});\n }\n int now = pow(2, cnt - 1) - 1;\n for(int i = cnt - 1; i > 0; i--){\n if(l - now > pow(2, i - 1)){\n ans.push_back({i, cnt, now + 1});\n now += pow(2, i - 1);\n }\n }\n cout << cnt << \" \" << ans.size() << endl;\n REP(i,ans.size()){\n cout << ans[i][0] << \" \" << ans[i][1] << \" \" << ans[i][2] << endl;\n } \n return 0;\n}", "# -*- coding: utf-8 -*-\n\nfrom math import log2, floor\n\nL = int(input())\n\nN = floor(log2(L)) + 1\nedge = []\n\n# 長さ0の辺\nfor i in range(1, N):\n edge.append((i, i+1, 0))\n\n# 長さ2**(i-1)の辺\nfor i in range(1, N):\n edge.append((i, i+1, 2**(i-1)))\n\n# ここまでで長さ0,...,X-1のパスが完成\nX = 2 ** (N-1)\n\n# 残りの辺\nwhile L > X:\n r = floor(log2(L - X))\n edge.append((r + 1, N, X))\n X += 2 ** r\n\n# 出力\nM = len(edge)\nprint(N, M)\nfor e in edge:\n print(' '.join(map(str, e)))\n", "l=int(input())\nfor i in range(1,21):\n\tif 2**i>l:\n\t\tr=i-1\n\t\tbreak\nans=[]\nfor i in range(r):\n\tans.append((i+1,i+2,0))\n\tans.append((i+1,i+2,2**i))\nnow=2**r-1\nfor i in range(r,0,-1):\n\tif 2**(i-1)+now<=l-1:\n\t\tans.append((i,r+1,now+1))\n\t\tnow+=2**(i-1)\nprint(r+1,len(ans))\nfor x in ans:\n\tprint(*x)", "l = int(input())\n\nb = bin(l)[2:][::-1]\n\nl = []\nfor i in range(len(b)):\n if b[i] == '1':\n l.append(i)\n\nk = l.pop()\n\nnodes = [i for i in range(1, k + 2)]\nedges = []\nfor i in range(len(nodes) - 1):\n edges.append([nodes[i], nodes[i+1], 2 ** (k - i - 1)])\n edges.append([nodes[i], nodes[i+1], 0])\n\ncovered = 2 ** k - 1\nfor x in l:\n edges.append([1, k + 1 - x, covered + 1])\n covered = edges[-1][-1] + 2 ** x - 1\n\nprint(max(nodes), len(edges))\nfor u, v, w in edges:\n print(u, v, w)\n", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\tint L;\n\tcin >> L;\n\tvector<tuple<int,int, int>>Ans;\n\tint N = 2;\n\tint pow = 1;\n\tAns.push_back(make_tuple(N-1,N,0)); \n\tAns.push_back(make_tuple(N - 1, N, pow));\n\twhile (pow*4 -1 < L ) {\n\t\tpow *= 2;\n\t\tN++;\n\t\tAns.push_back(make_tuple(N - 1, N, 0));\n\t\tAns.push_back(make_tuple(N - 1, N, pow));\n\t}\n\tL--;\n\tint now = pow * 2 - 1;\n\twhile (L != now) {\n\t\tint num = now + 1;\n\t\tint powsub = 1;\n\t\tint count = 0;\n\t\twhile ((powsub * 2 - 1) + num <= L) {\n\t\t\tpowsub *= 2;\n\t\t\tcount++;\n\t\t}\n\t\tAns.push_back(make_tuple(1 + count,N, num));\n\t\tnow = num + powsub - 1; \n\t}\n\tcout << N<<\" \"<<Ans.size()<<endl;\n\tfor (int n = 0;n<Ans.size();++n) {\n\t\tcout << get<0>(Ans[n]) << \" \"<<get<1>(Ans[n]) << \" \"<<get<2>(Ans[n]) << endl;\n\t}\n\treturn 0;\n}", "l = input()\nk = 0\nwhile 2 ** (k + 1) <= l:\n\tk += 1\nn = k + 1\ne = []\nfor i in range(k):\n\te.append((i + 1, i + 2, 0))\n\te.append((i + 1, i + 2, 2 ** i))\n\nfor i in range(k):\n\tif l >> i & 1:\n\t\te.append((i + 1, n, (l - 1) >> (i + 1) << (i + 1)))\n\nprint n, len(e)\nfor x, y, z in e:\n\tprint x, y, z", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)\n#define rep(i,n) REP(i,0,n)\nconst int inf = 1e9+7;\nconst ll longinf = 1LL<<60;\nconst ll mod = 1e9+7;\n\nstruct data {\n int from, to;\n int cost;\n data(int from, int to, int cost): from(from), to(to), cost(cost) {}\n};\n\nint main() {\n int L;\n cin >> L;\n int r = floor(log2(L));\n int N = r+1;\n vector<data> ans;\n REP(i, 1, r+1) {\n ans.push_back(data(i, i+1, 0));\n ans.push_back(data(i, i+1, pow(2, i-1)));\n }\n for(int i=N-1; i>=1; i--)\n if(L - pow(2, i-1) >= pow(2, r)) {\n ans.push_back(data(i, N, L-pow(2, i-1)));\n L -= pow(2, i-1);\n }\n cout << N << ' ' << ans.size() << endl;\n for(auto a: ans)\n cout << a.from << ' ' << a.to << ' ' << a.cost << endl;\n return 0;\n}\n\n", "import sys\nfrom math import ceil\ndef input(): return sys.stdin.readline().strip()\n\n\ndef main():\n L = int(input())\n \"\"\"\n L=Xのときにグラフが作れたとして、L=X*2, L=X+1の２パターンを\n 構成できたら辺の数をlog(L)の増大率で任意のLに対して目的のグラフを構成できる。\n L=X+1の場合はスタートとゴールの間に長さLの辺を追加するだけでよい。\n L=X*2の場合はL=Xのときの辺長をすべて２倍して、さらにゴールから長さ0, 1の二重辺をつけ足せばよい。\n \"\"\"\n\n # 先に頂点と辺の数だけ求める\n N = 2\n M = 2\n even = 0\n order = [L]\n while L != 2:\n if L % 2 == 0:\n N += 1\n M += 2\n L //= 2\n even += 1\n else:\n M += 1\n L -= 1\n order.append(L)\n print(\"{} {}\".format(N, M))\n order.pop()\n \n # 次に各辺間の距離を求める\n #print(order)\n print(\"{} {} {}\".format(1, 2, 0))\n print(\"{} {} {}\".format(1, 2, 2** even))\n edge = 2\n while order:\n L = order.pop()\n if L % 2 == 0:\n even -= 1\n print(\"{} {} {}\".format(edge, edge + 1, 0))\n print(\"{} {} {}\".format(edge, edge + 1, 2 ** even))\n edge += 1\n else:\n print(\"{} {} {}\".format(1, edge, (L - 1) * 2 ** even))\n \n\n\nif __name__ == \"__main__\":\n main()\n", "import math\nL = int(input())\nr = math.floor(math.log2(L))\nN = r+1\ngraph = []\nfor i in range(1,r+1):\n graph.append([i,i+1,0])\n graph.append([i,i+1,2**(i-1)])\nfor t in range(N-1,0,-1):\n if L-2**(t-1) >= 2**r:\n graph.append([t,N,L-2**(t-1)])\n L -= 2**(t-1)\n\nprint(N,len(graph))\nfor g in graph:\n print(*g)\n", "#include<bits/stdc++.h>\nusing namespace std;\nstruct edge\n{\n\tint u,v,w;\n\tedge(int u=0,int v=0,int w=0):u(u),v(v),w(w){}\n}e[100005];\nint main()\n{\n//\tfreopen(\"f.in\",\"r\",stdin);\n//\tfreopen(\"f.out\",\"w\",stdout);\n\tint l,jl1,jl2;\n\tcin>>l;\n\tfor(int i=2;(1<<i-1)<=l;i++)\n\t{\n\t\tjl1=i,jl2=l-(1<<i-1);\n\t}\n\tint n=jl1;\n\tcout<<n<<\" \";\n\tint m=0;\n\tfor(int i=1;i<jl1;i++)\n\t{\n\t\te[++m]=edge(i,i+1,0);\n\t\te[++m]=edge(i,i+1,(1<<i-1));\n\t}\n\tint tt=(1<<jl1-1);\n\tfor(int i=20;i>=0;i--)if(jl2&(1<<i))\n\t{\n\t\tjl2^=(1<<i);\n\t\te[++m]=edge(i+1,n,tt);\n\t\ttt+=1<<i;\n\t}\n\tcout<<m<<endl;\n\tfor(int i=1;i<=m;i++)\n\t{\n\t\tprintf(\"%d %d %d\\n\",e[i].u,e[i].v,e[i].w);\n\t}\n\treturn 0;\n}", "#define rep(i,n) for (int i = 0; i < n; i++)\n#define _USE_MATH_DEFINES\n#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include <vector>\n#include <cstring>\n#include <queue>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <cmath>\n#include <math.h>\n#include <complex>\n#include <cassert>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<ll, ll> p;\ntypedef complex<double> com;\nconst int mod = 1e9 + 7;\nconst int MOD = 998244353;\nconst ll INF = 1e18;\nstruct edge {\n\tint from, to, cost;\n};\n\n\nint main() {\n\tint l; cin >> l;\n\tint r = 30;\n\twhile (pow(2, r) > l) r--;\n\tint m = r + 1, cnt = 0;\n\tvector<edge> e;\n\trep(i, r) {\n\t\te.push_back({ i + 1,i + 2,(int)pow(2,i) });\n\t\te.push_back({ i + 1,i + 2,0 });\n\t\tcnt += 2;\n\t}\n\trep(i, m) {\n\t\tint j = m - i;\n\t\tif (j == 0) continue;\n\t\tif (l - pow(2, j - 1) < pow(2, r)) continue;\n\t\te.push_back({ j, m, (int)(l - pow(2, j - 1)) });\n\t\tcnt++;\n\t\tl -= pow(2, j - 1);\n\t}\n\tcout << m << \" \" << cnt << endl;\n\trep(i, cnt) {\n\t\tcout << e[i].from << \" \"<< e[i].to <<\" \"<< e[i].cost << endl;\n\t}\n\treturn 0;\n}\n", "import java.util.Scanner;\nimport java.util.stream.IntStream;\n\n/**\n * 解説どおりに作成したソースコード\n */\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint l = scanner.nextInt();\n\t\t\tint r = 0;\n\t\t\twhile ((1 << (r + 1)) <= l) {\n\t\t\t\tr++;\n\t\t\t}\n\t\t\tint n = r + 1;\n\t\t\tint count = 2 * r;\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor (int i = r; i >= 1; i--) {\n\t\t\t\t// System.out.println(\"l=\" + l + \", r=\" + r + \", i=\" + i);\n\t\t\t\tif ((l - (1 << (i - 1))) >= (1 << r)) {\n\t\t\t\t\tl -= 1 << (i - 1);\n\t\t\t\t\tsb.append(i + \" \" + n + \" \" + l).append(\"\\n\");\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(n + \" \" + count);\n\t\t\tIntStream.rangeClosed(1, r).forEach(i -> {\n\t\t\t\tSystem.out.println(i + \" \" + (i + 1) + \" 0\");\n\t\t\t\tSystem.out.println(i + \" \" + (i + 1) + \" \" + (1 << (i - 1)));\n\t\t\t});\n\t\t\tSystem.out.print(sb.toString());\n\t\t}\n\t}\n}\n", "import java.util.*;\nimport static java.lang.Math.*;\nimport java.math.BigInteger;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tint l = sc.nextInt();\n\t\t\n\t\t// 計算\n\t\tArrayList<Integer[]> result = new ArrayList<Integer[]>();\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\twhile(l > 1){\n\t\t if(l%2 == 0){\n\t\t l = l/2;\n\t\t list.add(2);\n\t\t }else{\n\t\t l = l - 1;\n\t\t list.add(1);\n\t\t }\n\t\t}\n\t\tint v = 1;\n\t\tint e = 1;\n\t\tfor(int i = list.size(); i > 0; i--){\n\t\t if(list.get(i-1) == 1){\n\t\t Integer[] edge = {1, v, e};\n\t\t e++;\n\t\t result.add(edge);\n\t\t }else{\n\t\t for(Integer[] edge : result){\n\t\t edge[2] *= 2;\n\t\t }\n\t\t Integer[] edge0 = {v, v+1, 0};\n\t\t Integer[] edge1 = {v, v+1, 1};\n\t\t v++;\n\t\t e *= 2;\n\t\t result.add(edge0);\n\t\t result.add(edge1);\n\t\t }\n\t\t}\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(v + \" \" + result.size());\n\t\tfor(Integer[] edge : result){\n\t\t System.out.println(edge[0] + \" \" + edge[1] + \" \" + edge[2]);\n\t\t}\n\t}\n}\n", "from math import log, floor\nL = int(input())\nn = floor(log(L, 3))\nl = [(L // (3**(n + 1 - i))) % 3 for i in range(1, n + 2)]\nN = n + 2\nuvws = [(i, i + 1, j * 3**(n + 1 - i)) \n for i in range(2, n + 2)\n for j in range(3)] + \\\n [(1, i, j * 3**(n + 2 - i) + sum(l[k - 1] * 3**(n + 1 - k) for k in range(1, i - 1)))\n for i in range(2, n + 3)\n for j in range(l[i - 2])]\nM = len(uvws)\nprint('{} {}'.format(N, M))\nfor uvw in uvws:\n print('{} {} {}'.format(*uvw))", "L=int(input())-1\nfor i in range(1,21):\n if 2**i>L+1:\n N=i\n break\nM=2*(N-1)\nl=[]\nfor i in range(1,N):\n l.append((i,i+1,2**(i-1)))\n l.append((i,i+1,0))\nL-=2**(N-1)-1\nt=2**(N-1)\nfor i in range(N-1,-1,-1):\n if 2**i<=L:\n l.append((i+1,N,t))\n L-=2**i\n t+=2**i\n M+=1\nprint(N,M)\nfor i in l:\n print(*i)", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(int argc, const char *argv[]) {\n int l;\n cin >> l;\n\n vector<int> sum_pow2{0};\n int log2l = 0;\n for (int i = 1; i <= l; i *= 2) {\n sum_pow2.push_back(sum_pow2.back() + i);\n log2l++;\n }\n\n int n = log2l, m = (n - 1) * 2;\n int cur = l, lim = l, idx = 0;\n stringstream sout;\n while (cur != 1) {\n if (cur % 2 == 1) {\n m++;\n cur--;\n sout << idx + 1 << ' ' << n << ' ' << lim - 1 - sum_pow2[idx] << '\\n';\n lim = lim - 1 - sum_pow2[idx];\n }\n\n cur /= 2;\n idx++;\n }\n\n for (int i = 0, pow2 = 1; i < n - 1; ++i, pow2 *= 2) {\n sout << i + 1 << ' ' << i + 2 << ' ' << 0 << '\\n';\n sout << i + 1 << ' ' << i + 2 << ' ' << pow2 << '\\n';\n }\n\n cout << n << ' ' << m << '\\n';\n cout << sout.str();\n}", "import math\nL = int(input())\nr = int(math.log2(L))\n\nres = []\nfor i in range(1, r+1):\n res.append([i, i+1, 0])\n res.append([i, i+1, 2**(i-1)])\n\nfor t in range(r, 0, -1):\n if L >= 2**r + 2**(t-1):\n L -= 2**(t-1)\n res.append([t, r+1, L])\n\nprint(r+1, len(res))\nfor i in range(len(res)):\n print(res[i][0], res[i][1], res[i][2])\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pli = pair<ll, int>;\nusing pil = pair<int, ll>;\nusing uint = unsigned int;\nusing matrix = vector<vector<uint>>;\ntemplate <typename T>\nusing Graph = vector<vector<T>>;\nconst int MOD = 1e9 + 7;\nconst ld PI = acos(-1);\n\nstruct edge {\n int from, to, len;\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int L;\n cin >> L;\n\n int N = 0;\n vector<edge> ans;\n while ((1 << N) <= L)\n N++;\n\n for (int i = 0; (L >> i) > 1; i++) {\n ans.push_back({N - i - 1, N - i, 0});\n ans.push_back({N - i - 1, N - i, 1 << i});\n }\n\n int len = (1 << (N - 1));\n for (int i = N - 2; i >= 0; --i) {\n if (L & (1 << i)) {\n ans.push_back({1, N - i, len});\n len |= (1 << i);\n }\n }\n\n printf(\"%d %d\\n\", N, ans.size());\n for (auto e : ans)\n printf(\"%d %d %d\\n\", e.from, e.to, e.len);\n\n return 0;\n}\n", "import math\nL = int(input())\n\nn = int(math.log2(L))\nw1 = pow(2,n-1)\nw1n = bin(L - pow(2, n))\np = 2 * n + w1n.count('1')\nprint(str(n + 1) + \" \" + str(p))\n\nprint(\"1 2 0\")\nprint(\"1 2 \" + str(w1))\nfor i in range(2, n + 1):\n print(str(i) + \" \" + str(i + 1) + \" 0\")\n print(str(i) + \" \" + str(i + 1) + \" \" + str(pow(2, n - i)))\n\nw = L - 1\nfor i in range(len(w1n) - 2):\n if w1n[-1] == '1':\n print(\"1 \" + str(n + 1 - i) + \" \" + str(w))\n w -= pow(2, i)\n w -= pow(2, i)\n w1n = w1n[:-1]\n if w1n.count('1') == 0:\n break", "def all_your_paths_are_different_lengths(L: int)->tuple:\n if L == 1:\n return 2, [(1, 2, 0)]\n\n r = 0\n while 2 ** (r+1) <= L:\n r = r + 1\n\n N = r + 1\n edges = []\n power2 = 1\n for i in range(1, N):\n edges.append((i, i+1, 0))\n edges.append((i, i+1, power2))\n power2 = power2 * 2\n\n for t in range(N-1, 0, -1):\n if L - (2**(t-1)) >= 2**r:\n edges.append((t, N, L - 2**(t-1)))\n L = L - 2**(t-1)\n\n return N, edges\n\n\nif __name__ == \"__main__\":\n L = int(input())\n N, edges = all_your_paths_are_different_lengths(L)\n print(N, len(edges))\n for u, v, w in edges:\n print(u, v, w)\n", "L=int(input())\n\np=[1]*21\nN=0\nfor i in range(20):\n p[i+1]=p[i]*2\n if p[i+1]>L:\n N=i+1\n break\n\n \nans=[]\nM=0\nfor i in range(N-1):#2の累乗\n ans.append([i+1,i+2,0])\n ans.append([i+1,i+2,p[i]])\n M+=2\n \npath=L-p[N-1]#２進数表記でbitが1なら終点への辺を足す\nN2=len(bin(path))-2 \n\n\n#途中の頂点から終点まで\nfor i in range(N):\n if path&1 ==1:\n ans.append([i+1,N,L-p[i]])\n M+=1\n L-=p[i]\n path=path>>1\n \nprint(' '.join(map(str, [N,M])))\nfor i in range(M):\n print(' '.join(map(str, ans[i])))", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int l;\n cin >> l;\n \n int n = 20;\n \n vector<int> u, v, w;\n for(int i = 1; i < 20; i++){\n u.emplace_back(i);\n v.emplace_back(i + 1);\n w.emplace_back(0);\n }\n \n int next = 1;\n \n int boundary = 1;\n while(true){\n if(pow(2, boundary + 1) - 1 < l) boundary++;\n else break;\n }\n for(int i = 1; i <= boundary; i++){\n u.emplace_back(i);\n v.emplace_back(i + 1);\n w.emplace_back(pow(2, i - 1));\n }\n \n next = pow(2, boundary);\n \n while(next != l){\n int dif = l - next;\n boundary = 0;\n while(true){\n if(pow(2, boundary + 1) - 1 < dif) boundary++;\n else break;\n }\n u.emplace_back(boundary + 1);\n v.emplace_back(20);\n w.emplace_back(next);\n next += pow(2, boundary);\n }\n \n cout << n << \" \" << u.size() << '\\n';\n for(int i = 0; i < u.size(); i++){\n cout << u.at(i) << \" \" << v.at(i) << \" \" << w.at(i) << '\\n';\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int L;\n cin >> L;\n int r = 0;\n while(L >> (r + 1)) ++r;\n int cnt = __builtin_popcount(L) - 1;\n\n cout << r + 1 << ' ' << 2 * r + cnt << endl;\n for(int i=0; i<r; ++i) {\n cout << i + 1 << ' ' << i + 2 << ' ' << 0 << endl;\n cout << i + 1 << ' ' << i + 2 << ' ' << (1 << i) << endl;\n }\n for(int i=r-1; i>=0; --i) {\n if(L - (1 << i) >= (1 << r)) {\n cout << i + 1 << ' ' << r + 1 << ' ' << L - (1 << i) << endl;\n L ^= (1 << i);\n }\n }\n}", "L = int(input())\nv = 1\nedges = []\nn = 2\ncost = 1\nwhile n<=L:\n edges.append((v,v+1,0))\n edges.append((v,v+1,cost))\n cost *=2\n v += 1\n n *=2\ngoal = v\nn//=2\nN = n\nL -=N\nwhile L>0:\n if L>=n:\n edges.append((v,goal,N))\n L-=n\n N+=n\n n//=2\n v-=1\nprint(goal,len(edges))\nfor e in edges:\n print(*e)", "L=int(input())\ncount=0\nk=1\nmax=0\nLL=format(L,'b')\nN=len(LL)\nM=(len(LL)-1)*2+LL.count('1')-1\n#print(LL)\nprint(N,M)\nmax=2**(N-1)-1\nfor n in range(1,N):\n print(n,n+1,0)\n print(n,n+1,k)\n k*=2\n if LL[::-1][n-1]=='1' and n!=N:\n print(n,N,max+1)\n max+=2**(n-1)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int L;\n scanf(\"%d\",&L);\n int vtx = 0,cp=L,edg;\n vector<int> V; //pos of zeros\n for(int it,i=0;(it=1<<i)<=L;i++){\n if(it&L)\n V.push_back(i); //10000 -> 0(0000~1111), the place of 1->0.\n vtx = i+1;\n edg = 2*(vtx-1) + V.size()-1;\n }\n printf(\"%d %d\\n\",vtx,edg);\n for(int i=1;i<vtx;i++){\n printf(\"%d %d %d\\n\",i,i+1,1<<(vtx-1-i));\n printf(\"%d %d %d\\n\",i,i+1,0);\n }\n for(int x:V){\n //x : the place of i\n int it = 1<<x;\n int from =1,to = vtx - x;\n int val = L - (L&(2*it-1));\n //printf(\"%d\\n\",L&(2*it-1));\n if(val!=0) printf(\"%d %d %d\\n\",from,to,val);\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing P = pair<int, int>;\n\nint f (int x) {\n\tint r = 0;\n\twhile (r < 19 and (1 << (r + 1)) <= x) r++;\n\treturn r;\n}\n\nint main() {\n\tint l;\n\tcin >> l;\n\tconst int r = f(l);\n\t\n\tvector<pair<P, int>> edge;\n\tfor (int v = 0; v < r; v++) {\n\t\tedge.emplace_back(P(v, v + 1), 0);\n\t\tedge.emplace_back(P(v, v + 1),(1 << v));\n\t}\n\t\n\tfor (int v = r - 1; v >= 0; v--) {\n\t\tint val = l - (1 << v);\n\t\tif (val >= (1 << r)) {\n\t\t\tedge.emplace_back(P(v, r), val);\n\t\t\tl = val;\n\t\t}\n\t}\n\t\n\tcout << r + 1 << ' ' << edge.size() << '\\n';\n\tfor (const auto &e : edge) {\n\t\tint v, u; tie(v, u) = e.first;\n\t\tcout << v + 1 << ' ' << u + 1 << ' ' << e.second << '\\n';\n\t}\n\t\n\treturn 0;\n}", "L=int(input())\nn=L.bit_length()\nif L==2**n:\n n+=1\npath=[]\nfor i in range(1,n):\n path.append([i,i+1,0])\n path.append([i,i+1,2**(i-1)])\nk=(L-1)-(2**(n-1)-1)\ncur=2**(n-1)\nwhile k>0:\n if k==1:\n kk=1\n else:\n kk=k.bit_length()\n path.append([kk,n,cur])\n cur+=2**(kk-1)\n k=L-cur\nprint(n,len(path))\nfor p in path:\n print(*p)", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n#define rep(i,m,n) for(int i=m;i<n;i++)\nll mod=1e9+7;\n\nint power(int n){\n int res=1;\n rep(i,0,n) res*=2;\n return res;\n}\n\nint main(){\n int l;\n cin>>l;\n vector<bool> v;\n int a=l;\n while(a>0){\n v.push_back(a%2);\n a/=2;\n }\n int n=v.size();\n reverse(v.begin(),v.end());\n //cout<<n<<endl;\n vector<int> b,c,d;\n rep(i,0,n-1){\n b.push_back(i);\n c.push_back(i+1);\n d.push_back(0);\n }\n int cur=1;\n rep(i,0,n-1){\n b.push_back(i);\n c.push_back(i+1);\n d.push_back(cur);\n cur*=2;\n }\n rep(i,1,n){\n if(v[i]){\n b.push_back(n-1-i);\n c.push_back(n-1);\n d.push_back(cur);\n cur+=power(n-1-i);\n }\n }\n int e=b.size();\n cout<<n<<' '<<e<<endl;\n rep(i,0,e){\n cout<<b[i]+1<<' '<<c[i]+1<<' '<<d[i]<<endl;\n }\n}", "#include<bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\nusing namespace std;\n\nint main(){\n long long l;\n cin>>l;\n int n=floor(log2(l));\n //long long dp[n]={};\n string ans=\"\";\n int m=0;\n rep(i,n){\n ans+=to_string(i+1)+\" \"+to_string(i+2)+\" 0\"+\"\\n\";\n m++;\n ans+=to_string(i+1)+\" \"+to_string(i+2)+\" \"+to_string(1<<(n-i-1))+\"\\n\";\n m++;\n }\n\n long long cmax=(1<<n);\n l-=cmax;\n int cn;\n while (l>=1){\n cn=n-floor(log2(l))+1;\n ans+=\"1 \"+to_string(cn)+\" \"+to_string(cmax)+\"\\n\";\n m++;\n cmax+=(1<<(int)floor(log2(l)));\n l-=(1<<(int)floor(log2(l)));\n\n}\n cout<<n+1<<\" \"<<m<<endl<<ans;\n return 0;\n}\n", "L = int(input())\nnum = 2\nstart = 1\nend = 2\npath = [[1, 2, 0], [1, 2, 1]]\nfunc = []\ndef plus1(s, t, n):\n\tglobal num\n\tpath.append([s, t, n])\n\tnum += 1\n\ndef times2(s, t, n):\n\tglobal end, num\n\tfor edge in path:\n\t\tedge[2] *= 2\n\tpath.append([t, t+1, 0])\n\tpath.append([t, t+1, 1])\n\tend += 1\n\tnum *= 2\n\nwhile L > 2:\n\tif L % 2 == 1:\n\t\tfunc.append(plus1)\n\t\tL -= 1\n\telse:\n\t\tfunc.append(times2)\n\t\tL //= 2\nfunc.reverse()\n\nfor f in func:\n\tf(start, end, num)\n\nprint(end, len(path))\nfor u, v, w in path:\n\tprint(u, v, w)", "# -*- coding: utf-8 -*-\n\n\"\"\"\n参考：https://minus9d.hatenablog.com/entry/2018/09/02/004610\n・2べきで作るといいのは気づいたんだけどなぁ。\n・2べき以外の数値をどうつなげばうまく処理できるかまとめられず…。\n\"\"\"\n\nL = int(input())\n\n# 2べきで表せる基本部分を作る\nedges = []\n# baseは基本部分の守備範囲\nv = base = 1\nwhile base * 2 <= L:\n edges.append([v, v+1, 0])\n edges.append([v, v+1, base])\n base *= 2\n v += 1\n# ゴールの頂点\nend = edges[-1][1]\n# 残りがいくつか\nrest = L - base\n# 残りを2べきに分割\nfor i in range(18, -1, -1):\n num = 2 ** i\n if rest >= num:\n # ちょうどいい位置(ここより手前で2**iまでを網羅)にバイパスを作る感じ\n edges.append([i+1, end, L-rest])\n rest -= num\nprint(v, len(edges))\nfor i in range(len(edges)):\n print(*edges[i])\n", "#include<bits/stdc++.h>\n#define maxn 100005\n#define inf (1<<30)\n#define mod 1000000007\nusing namespace std;\ntypedef long long LL;\nint read()\n{\n\tchar c=getchar();int f=1,sum=0;\n\twhile(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}\n\twhile(c>='0' && c<='9'){sum=sum*10+c-'0';c=getchar();}\n\treturn sum*f;\n}\nint L;\nint bit[25],sum[25];\nvoid init()\n{\n\tsum[0]=bit[0]=1;\n\tfor(int i=1;i<=21;i++)\n\t{\n\t\tbit[i]=bit[i-1]<<1;\n\t\tsum[i]=sum[i-1]+bit[i];\n\t}\n}\nint res[25],tot; \nint main()\n{\n\tinit();\n\tL=read();\n\tfor(int i=0;bit[i]<=L;i++)\n\t{\n\t\tif(L&bit[i])\n\t\tres[++tot]=i;\n\t}\n\tprintf(\"%d %d\\n\",res[tot]+1,res[tot]*2+tot-1);\n\tfor(int i=1;i<=res[tot];i++)\n\t\tprintf(\"%d %d 0\\n\",i,i+1);\n\tfor(int i=res[tot]+1;i>=2;i--)\n\t\tprintf(\"%d %d %d\\n\",i-1,i,bit[res[tot]+1-i]);\n\tint maxa=sum[res[tot]-1];\n\tfor(int i=tot-1;i>=1;i--)\n\t{\n\t\tmaxa++;\n\t\tprintf(\"1 %d %d\\n\",res[tot]+1-res[i],maxa);\n\t\tmaxa+=sum[res[i]-1];\n\t}\n\treturn 0;\n}\n", "#!/usr/bin/env python3\n\nimport math\n\nl = int(input())\n\nr = math.floor(math.log2(l))\n\nnum_vertex = 0\nnum_edge = 0\n\nnum_vertex += r+1\n\nprint_list = []\nfor i in range(r):\n print_list.append([i+1, i+2, 0])\n print_list.append([i+1, i+2, 2**i])\n num_edge += 2\n\n\nfor i in reversed(range(r+1)):\n if l-2**i >= 2**r:\n print_list.append([i+1, r+1, l-2**i])\n l -= 2**i\n num_edge += 1\n\nprint(num_vertex, num_edge)\nfor i in print_list:\n print(*i)\n", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint l = sc.nextInt();\n\t\tint m = l;\n\t\tint num = 0;\n\t\tm = m;\n\t\twhile(m > 0) {\n\t\t\tm = m/2;\n\t\t\tnum += 1;\n\t\t}\n\t\tint rest = l - (int)Math.pow(2, num-1);\n\t\tint a[] = new int[num];\n\t\tint i = 0;\n\t\twhile(rest > 0) {\n\t\t\ta[i] = rest % 2;\n\t\t\trest = rest/2;\n\t\t\ti += 1;\n\t\t}\n\n\t\tint road = 0;\n\n\t\tfor(int j = 0;j<a.length;j++) {\n\t\t\troad += a[j];\n\t\t}\n\t\troad = road + 2*(num -1);\n\n\t\tSystem.out.println(num + \" \" + road);\n\t\tfor(int j=0;j<num-1;j++) {\n\t\t\tSystem.out.println((j+1) + \" \" + (j+2) + \" \" + 0);\n\t\t\tSystem.out.println((j+1) + \" \" + (j+2) + \" \" + (int)Math.pow(2, j));\n\t\t}\n\t\tint rsum = 0;\n\t\tfor(int j=0;j<num;j++) {\n\t\t\tif(a[j] == 1) {\n\t\t\t\tSystem.out.println((j+1) + \" \" + num + \" \" + ((int)Math.pow(2, num-1) + rsum));\n\t\t\t\trsum += (int)Math.pow(2, j);\n\t\t\t}\n\t\t}\n\n\t}\n}", "def main():\n l=int(input())\n n=1\n while (1<<n)<=l:\n n+=1\n ans=[]\n for i in range(n-1):\n ans.append([i,i+1,0])\n ans.append([i,i+1,1<<i])\n l-=1<<(n-1)\n val=1<<(n-1)\n for p in range(n-2,-1,-1):\n if l>=(1<<p):\n ans.append([p,n-1,val])\n val+=1<<p\n l-=1<<p\n print(n,len(ans))\n for a,b,c in ans:\n print(a+1,b+1,c)\nmain()", "L = int(input())\n\ndef decompose(L):\n if L < 2:\n assert L == 1\n return []\n r = L % 2\n return [r] + decompose((L - r) // 2)\n\ndec = decompose(L)\n\nN = len(dec) + 1\nedge = []\n\nbase = 1\nfor i in range(len(dec) - 1, -1, -1):\n for w in range(2):\n edge.append((i+1, i+2, w * base))\n base *= 2\n for w in range(dec[i]):\n edge.append((i+1, N, base + w))\n base += dec[i]\n\nM = len(edge)\nprint(N, M)\nfor e in edge:\n print(' '.join(map(str, e)))\n", "#include <bits/stdc++.h>\n#define pb push_back\n#define REP(i, n) for (signed long long i = 0; i < (n); i++)\n#define MOD 998244353\n#define INF 98765431219876543\n#define bitcnt(a) (ll) __builtin_popcount((a))\n#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))\n#define ub(a, b) upper_bound((a).begin(), (a).end(), (b))\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<ll, P> PP;\n\nint main() {\n ll l, bs;\n cin >> l;\n vector<string> v;\n REP(i, 21) {\n if (pow(2, i) > l) {\n bs = i;\n break;\n }\n }\n cout << bs;\n REP(i, bs - 1) {\n v.pb(to_string((i + 1)) + \" \" + to_string((i + 2)) + \" \" + to_string(int(pow(2, bs - 2 - i))));\n\n v.pb(to_string((i + 1)) + \" \" + to_string((i + 2)) + \" \" + to_string(0));\n }\n int x = 1 << (bs - 1);\n for (int i = bs - 2; i >= 0; i--) {\n if ((l >> i) & 1) {\n v.pb(to_string(1) + \" \" + to_string(bs - i) + \" \" + to_string(x));\n x += 1 << i;\n }\n }\n cout << \" \" << v.size() << endl;\n\n for (auto &a : v) {\n cout << a << endl;\n }\n}", "from collections import defaultdict,deque\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inp(): return int(input())\ndef inpl(): return list(map(int, input().split()))\ndef inpls(): return list(input().split())\n\nL = int(input())\nN = L.bit_length()\n\nLines = []\nfor i in range(1,N):\n\tLines.append([i,i+1,0])\n\tLines.append([i,i+1,1<<(N-i-1)])\n\ntmp = 1<<(N-1)\nfor k in reversed(range(N-1)):\n\tif L>>k & 1:\n\t\tLines.append([1,N-k,tmp])\n\t\ttmp += 1<<k\n\nprint(N,len(Lines))\nfor a,zu,nyan in Lines:\n\tprint(a,zu,nyan)\n", "# D - All Your Paths are Different Lengths\n\nL = int(input())\nr = 0\nwhile pow(2, r+1) <= L:\n r += 1\n\nN = r + 1 \n\nedge = []\nfor i in range(N-1): \n edge.append((i+1, i+2, 0))\n edge.append((i+1, i+2, pow(2, i)))\n\nM = r * 2\nremain = L - pow(2, r)\n\nfor i in range(N-1)[::-1]:\n if remain < pow(2, i):\n continue\n else:\n edge.append((i+1, N, L-remain))\n M += 1\n remain -= pow(2, i)\n\nprint(N, M)\nfor e in edge:\n print(' '.join(map(str, e)))", "#include<iostream>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#define N 30\nusing namespace std;\n\nint n,m,l,now,num[N];\nvector<int>son[N],val[N];\n\nint main()\n{\n int i,j;\n cin>>n;\n now=n;\n for(; n; n/=2)\n {\n num[++l]=n%2;\n }\n// reverse(num+1,num+l+1);\n// for(i=1;i<=l;i++) cout<<num[i]<<\" \";return 0;\n for(i=2; i<l; i++)\n {\n son[i-1].push_back(i);\n val[i-1].push_back(0);\n son[i-1].push_back(i);\n val[i-1].push_back((1 << (i-2)));\n }\n for(i=l-1; i>=1; i--)\n {\n if(!num[i]) continue;\n now-=(1 << (i-1));\n son[i].push_back(l);\n val[i].push_back(now);\n }\n now-=(1 << (l-1));\n son[l-1].push_back(l);\n val[l-1].push_back(now);\n son[l-1].push_back(l);\n val[l-1].push_back((1 << (l-2))+now);\n\n for(i=1; i<=l; i++) m+=son[i].size();\n cout<<l<<\" \"<<m<<endl;\n for(i=1; i<=l; i++)\n {\n for(j=0; j<son[i].size(); j++)\n {\n printf(\"%d %d %d\\n\",i,son[i][j],val[i][j]);\n }\n\n }\n}", "import math\n\n\nl = int(input())\nnode = int(math.log2(l)) + 1\nedges = []\n\nfor _from in range(1, node):\n edges.append([_from, _from+1, 0])\n edges.append([_from, _from+1, 2**(_from-1)])\n\ncount = 2 ** (node-1)\nlack = l - count\nlength = 2 ** (node-1)\n\nfor _from in range(node-1, 0, -1):\n if not lack:\n break\n add_line = 2 ** (_from-1)\n if add_line > lack:\n continue\n edges.append([_from, node, length])\n lack -= add_line\n length += add_line\n\nprint(node, len(edges))\nfor _from, to, length in edges:\n print(_from, to, length)\n", "#include <iostream>\n#include <stdio.h>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nint main(){\n \n int L;\n vector< vector<int> > ans;\n int r = 1, i = 1;\n \n cin >> L;\n \n while( 2*r <= L ) {\n ans.push_back( {i,i+1,0} );\n ans.push_back( {i,i+1,r} );\n i++; r*=2;\n }\n\n while( r != L ) {\n int j = (int)log2(L-r);\n ans.push_back( {j+1,i,r} );\n r += (int)pow(2,j);\n }\n \n printf(\"%d %d\\n\", i, (int)ans.size());\n for ( int i = 0; i < ans.size(); i++) {\n printf(\"%d %d %d\\n\", ans[i][0], ans[i][1], ans[i][2] );\n }\n \n}\n", "# mada dame datta.\ndef main():\n L = int(input())\n b = bin(L)[2:]\n bl = len(b)\n r = []\n for i in range(bl-1):\n r.append((i+1, i+2, 0))\n r.append((i+1, i+2, 2**i))\n if L == 2**(bl-1):\n pr(r)\n return\n end = bl\n for i in reversed(range(1, end)):\n if L - 2**(i-1) >= 2**(end-1):\n r.append((i, end, L-2**(i-1)))\n L -= 2**(i-1)\n pr(r)\ndef pr(r):\n m = 0\n for i in r:\n m = max(m, i[1])\n print(m, len(r))\n for i in r:\n print(i[0], i[1], i[2])\nmain()\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef tuple<ll,ll,ll> T;\n\nint main() {\n ll L; cin >> L;\n ll r = 0;\n for (ll i = 0; i < 30; i++) {\n if (L >= 1 << i) {r = i;}\n }\n vector<T> es;\n for (ll i = 0; i < r; i++) {\n es.push_back(T(i+1,i+2,0));\n es.push_back(T(i+1,i+2,1 << i));\n }\n ll leng = 1 << r;\n for (ll i = r-1; i >= 0; i--) {\n if (L >> i & 1) {\n es.push_back(T(i+1,r+1,leng));\n leng += (1 << i);\n }\n }\n cout << r+1 << \" \" << es.size() << endl;\n for (ll i = 0; i < es.size(); i++) {\n cout << get<0>(es[i]) << \" \" << get<1>(es[i]) << \" \" << get<2>(es[i]) << endl;\n }\n}", "l = int(input())\nn = l.bit_length()\nANS = []\nfor i in range(1, n):\n ANS.append((i, i + 1, 0))\n ANS.append((i, i + 1, 2**(i - 1)))\nfor i in reversed(range(1, n)):\n if l - 2**(i - 1) >= 2**(n - 1):\n l -= 2**(i - 1)\n ANS.append((i, n, l))\nprint(n, len(ANS))\nfor ans in ANS:\n print(*ans)\n", "import math\nl=int(input())-1\nn=int(math.log2(l+1)+1)\nE=[]\nfor i in range(n-1):\n E.append([i+1,i+2,0])\n E.append([i+1,i+2,2**i])\ni=n-2\nwhile l>2**(n-1)-1:\n t=l-2**i+1\n if t>2**(n-1)-1:\n E.append([i+1,n,t])\n l=t-1\n i-=1\nprint(n,len(E))\nfor i in range(len(E)):\n print(*E[i])", "import java.util.*;\nimport java.io.*;\n\nclass Main {\n\tpublic static void main(String... args) {\n\t\tint L = IN.nextInt();\n\t\t\n\t\tList<Integer> nums = new ArrayList<>();\n\t\tint i = 18;\n\t\tint a = L;\n\t\twhile (a > 0) {\n\t\t\tint b = (int) Math.pow(2, i);\n\t\t\tif (b <= a) {\n\t\t\t\tnums.add(i + 1);\n\t\t\t\ta -= b;\n\t\t\t} else {\n\t\t\t\ti -= 1;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint N = nums.get(0) + 1;\n\t\t\n\t\tList<int[]> G = new ArrayList<>();\n\t\tfor (int n = 1; n <= N - 2; n++) {\n\t\t\tG.add(new int[] {n, n + 1, 0});\n\t\t\tG.add(new int[] {n, n + 1, (int) Math.pow(2, n - 1)});\n\t\t}\n\t\t\n\t\tint base = 0;\n\t\tCollections.reverse(nums);\n\t\tfor (int j: nums) {\n\t\t\tG.add(new int[] {j, N, base});\n\t\t\tbase += (int) Math.pow(2, j -1);\n\t\t}\n\n\t\tputs(N + \" \" + G.size());\n\t\tfor (int[] x: G) {\n\t\t\tputs(x[0] + \" \" + x[1] + \" \" + x[2]);\n\t\t}\n\t\tflush();\n\t}\n\n\tstatic final Scanner IN = new Scanner(System.in);\n\tstatic final PrintWriter OUT = new PrintWriter(System.out);\n\tstatic <T> void puts(T arg) { OUT.println(arg); }\n\tstatic void flush() { OUT.flush(); }\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\nconst int inf = 0x3f3f3f3f;\nconst int mod = 1e9 + 7;\nconst int maxn = 2e5 + 100;\n\nstruct node {\n int u, v, w;\n} e[100];\nint tot = 0;\nint b[100];\n\nint main() {\n\n int l;\n scanf(\"%d\", &l);\n for (int i = 1; i < 20; i++) {\n e[tot++] = {i, i + 1, 0};\n }\n b[0] = 1;\n int to = 0;\n for (int i = 1; i <= 21; i++) {\n b[i] = b[i - 1] * 2;\n if (b[i] - 1 < l) to = i;\n }\n for (int i = 1; i <= to; i++) {\n e[tot++] = {i, i + 1, b[i - 1]};\n }\n\n int now = b[to];\n while (now != l) {\n int rest = l - now;\n to = 0;\n for (int i = 1; i <= 21; i++) {\n if (b[i] - 1 < rest) to = i;\n }\n e[tot++] = {to + 1, 20, now};\n now += b[to];\n }\n printf(\"%d %d\\n\", 20, tot);\n for (int i = 0; i < tot; i++) {\n printf(\"%d %d %d\\n\", e[i].u, e[i].v, e[i].w);\n }\n return 0;\n}\n", "def iin(): return int(input())\n\nl = iin()\nstack = []\n\nans = [[1, 2, 0]]\nx = l\nwhile True:\n if x == 1:\n break\n #x > 2を条件に加えた理由: \n #x = 1 -> 2の操作を*2で済ませると[1, 2, 0], [2, 3, 0], [2, 3, 1] となり、\n #頂点数が21以上になるケースが出るため, x = 1 -> 2は+1で済ませる\n while x % 2 == 0 and x > 2:\n x //= 2\n stack.append('*2')\n if x == 1:\n break\n x -= 1\n stack.append('+1')\n\nlast_v_num = 2\nx = 1#L, つまりパスの数\nwhile len(stack) > 0:\n op = stack.pop()\n# print(op)\n if op == '+1':\n x += 1#パスの数を増やす\n ans.append([1, last_v_num, x - 1])#頂点1と最後の頂点を直接結ぶ, 辺の重みはパスの数 - 1\n elif op == '*2':\n x *= 2#パスの数を増やす\n for i in range(len(ans)):\n ans[i][2] *= 2#w *= 2して, 既存のパスの重みを2倍にする\n #最後の頂点の後ろに, 新たな頂点を加えて結ぶ, 辺の重みは0と1\n ans.append([last_v_num, last_v_num + 1, 0])\n ans.append([last_v_num, last_v_num + 1, 1])\n last_v_num += 1\n\nN = last_v_num\nM = len(ans)\nprint(N, M)\nfor u, v, w in ans:\n print(u, v, w)", "#include <iostream>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <queue>\n#include <map>\n#include <set>\n#include <stack>\n#include<algorithm>\n#include<sstream>\n#include<iomanip>\n\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll MOD_CONST = 1000000007;\nconst ll BIG_NUM = 1000000000000000000;\n\n\n\nint main() {\n\tint l;\n\tcin >> l;\n\n\tint r = 0;\n\twhile (true) {\n\t\tif ((1 << (r + 1)) <= l) {\n\t\t\tr++;\n\t\t}\n\t\telse {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\n\tint n = r+1;\n\t\n\t\n\tset<pair<int,int>> path;\n\n\tvector<pair<int, int>>toGoalPath;\n\t{\n\t\tint l_tmp = l;\n\t\tfor (int i = n - 1;i > 0;i--) {\n\t\t\tif (l_tmp - (1 << (i - 1)) >= (1 << r)) {\n\t\t\t\ttoGoalPath.emplace_back(make_pair(i, l_tmp - (1 << (i - 1))));\n\t\t\t\tl_tmp -= (1 << (i - 1));\n\n\t\t\t}\n\t\t}\n\t}\n\n\tint m = 2 * (n - 1) + toGoalPath.size();\n\tcout << n << \" \" <<m<< endl;\n\tfor (int i = 1; i <n ;i++) {\n\t\tcout << i << \" \" << i+1 << \" \" << 0 << endl;\n\t\tcout << i << \" \" << i + 1 << \" \" << (1 <<(i-1)) << endl;\n\t}\n\t\n\tfor (auto it = toGoalPath.begin(); it != toGoalPath.end(); it++) {\n\t\tcout << it->first << \" \" << n << \" \" << it->second << endl;\n\t\t\n\t}\n\t\n}\n\t\n", "import java.util.*;\n \npublic class Main {\n \n private static Scanner sc;\n \n public static void main(String[] args) {\n sc = new Scanner(System.in);\n \n long l = sc.nextInt();\n \n List<Long> u = new ArrayList<>();\n List<Long> v = new ArrayList<>();\n List<Long> w = new ArrayList<>();\n \n long p = 1;\n long i = 1;\n while (p <= l / 2) {\n u.add(i);\n v.add(i + 1);\n w.add(0L);\n u.add(i);\n v.add(i + 1);\n w.add(p);\n p *= 2;\n i++;\n }\n \n long r = l - p;\n long q = p;\n long b = 0;\n long rp2 = r;\n for (long j = i - 1; rp2 > 0; j--) {\n p /= 2;\n long rp21 = rp2 / p;\n \n if (rp21 == 0) {\n continue;\n }\n b += q;\n u.add(j);\n v.add(i);\n w.add(b);\n q = p;\n rp2 = rp2 - p;\n }\n \n System.out.println(i + \" \" + u.size());\n for (int j = 0; j < u.size(); j++) {\n System.out.println(u.get(j) + \" \" + v.get(j) + \" \" + w.get(j));\n }\n }\n \n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int l;\n cin >> l;\n int n = log2(l);\n\n vector<tuple<int, int, int>> ans;\n for (int i = 0; i < n; i++) {\n ans.emplace_back(i + 1, i + 2, 0);\n ans.emplace_back(i + 1, i + 2, 1 << i);\n }\n\n for (int t = n; t >= 0; t--) {\n int s = l - (1 << t);\n if (s >= 1 << n) {\n ans.emplace_back(t + 1, n + 1, s);\n l = s;\n }\n }\n\n cout << n + 1 << \" \" << ans.size() << endl;\n for (auto& e : ans) cout << get<0>(e) << \" \" << get<1>(e) << \" \" << get<2>(e) << endl;\n}\n", "#include<bits/stdc++.h>\n#define reg register\ntypedef long long ll;\nusing namespace std;\nint L,cnt;\nint st[61],to[61],cost[61];\nint main(){\n\tios::sync_with_stdio(false);\n\tcin>>L;reg int pos=0;\n\tfor(reg int i=20;i&&(!pos);i--)if(L&(1<<i))pos=i;\n\tfor(reg int i=1;i<pos;i++){\n\t\tst[++cnt]=i;to[cnt]=i+1;cost[cnt]=0;\n\t\tst[++cnt]=i;to[cnt]=i+1;cost[cnt]=1<<(i-1);\n\t}\n\tst[++cnt]=pos;to[cnt]=20;cost[cnt]=0;\n\tst[++cnt]=pos;to[cnt]=20;cost[cnt]=1<<(pos-1);\n\treg int l=1<<pos;\n\twhile(l<L){\n\t\tpos=0;for(reg int i=20;i&&(!pos);i--)if((1<<i)&(L-l))pos=i;\n\t\tst[++cnt]=pos+1;to[cnt]=20;cost[cnt]=l;l|=1<<pos;\n\t}\n\tcout<<20<<' '<<cnt<<endl;\n\tfor(reg int i=1;i<=cnt;i++)\n\t\tcout<<st[i]<<' '<<to[i]<<' '<<cost[i]<<endl;\n\treturn 0;\n}", "#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <functional>\n\nusing namespace std;\ntypedef long long int ll;\ntypedef tuple<int,int,int> edge;\n\n#define repi(i,a,b) for(ll i=a;i<b;i++)\n#define rep(i,a) repi(i,0,a)\n#define rrep(i,a) for(ll i=a-1;i>=0;i--)\n\nint main(){\n int L;\n cin >> L;\n\n int N = 1;\n int L_ = L;\n while(L_ >>= 1) N++;\n vector<edge> edges;\n repi(i, 1, N){\n edges.emplace_back(i, i+1, 0);\n edges.emplace_back(i, i+1, 1 << (i-1));\n }\n\n L_ = L;\n repi(i, 1, N){\n if(L_ % 2) edges.emplace_back(i, N, (L_-1) << (i-1));\n L_ >>= 1;\n }\n printf(\"%d %d\\n\", N, (int)edges.size());\n for(auto it = edges.begin(); it != edges.end(); ++it){\n printf(\"%d %d %d\\n\", get<0>(*it), get<1>(*it), get<2>(*it));\n }\n return 0;\n}\n", "L = int(input())\n\ndef decompose(L):\n if L < 3:\n return [L]\n r = L % 3\n return [r] + decompose((L - r) // 3)\n\ndec = decompose(L)\n\nN = len(dec) + 1\nedge = []\n\nfor w in range(dec[-1]):\n edge.append((N-1, N, w))\n\nbase = dec[-1]\nfor i in range(len(dec) - 2, -1, -1):\n for w in range(3):\n edge.append((i+1, i+2, w * base))\n base = 3 * base\n for w in range(dec[i]):\n edge.append((i+1, N, base + w))\n base += dec[i]\n\nM = len(edge)\nprint(N, M)\nfor e in edge:\n print(' '.join(map(str, e)))", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<ll> vll;\ntypedef vector<int> vi;\nconst ll MOD = 1e9 + 7;\nconst int maxn = 1e6 + 10;\n\nstruct edge {\n int s;\n int e;\n int w;\n edge(int s, int e, int w) {\n this->s = s;\n this->e = e;\n this->w = w;\n }\n};\n\nint main() {\n int L;\n cin >> L;\n vector<edge> graph;\n int r = log2(L);\n int n = r + 1;\n int x = 1;\n for (int i = 1; i < n; ++i) {\n graph.push_back(edge(i, i + 1, 0));\n graph.push_back(edge(i, i + 1, x));\n x <<= 1;\n }\n int w = 0;\n while (L & (x - 1)) {\n L = L & (x - 1);\n w += x;\n r = log2(L);\n graph.push_back(edge(r + 1, n, w));\n if (r <= 0) break;\n x = 1 << r;\n }\n cout << n << \" \" << graph.size() << endl;\n for (auto& e : graph) {\n cout << e.s << \" \" << e.e << \" \" << e.w << endl;\n }\n return 0;\n}\n\nstatic int speedUp = []() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n return 0;\n}();", "#include <bits/stdc++.h>\nusing namespace std;\n#define ALL(A) (A).begin(),(A).end()\n#define ll long long\nconst ll mod = 1e9+7;\nconst ll INF = 2*1e18;\nconst int inf = 1e9+7;\nint func(int x,int y){\n\tif(y==0)return 1;\n\tint ret = 1;\n\tfor(int i=1;i<=y;i++){\n\t\tret*=x;\n\t}\n\treturn ret;\n}\nint main(void){\n\tint L;\n\tcin >> L;\n\tint N,r=1,X=2;\n\twhile(X<=L){\n\t\tr++;\n\t\tX*=2;\n\t}\n\tr--;\n\tN = r + 1;\n\tvector<tuple<int,int,int>> v;\n\tfor(int i = 1;i<N;i++){\n\t\tv.push_back(make_tuple(i,i+1,0));\n\t\tv.push_back(make_tuple(i,i+1,func(2,i-1)));\n\t\t//printf(\"%d %d %d\\n\",i,i+1,0);\n\t\t//printf(\"%d %d %d\\n\",i,i+1,func(2,i-1));\n\t} \n\tfor(int i=N-1;i>=1;i--){\n\t\tif( (L-func(2,i-1) ) >=func(2,r) ){\n\t\t\t//printf(\"%d %d %d\\n\",i,N,L-func(2,i-1));\n\t\t\tv.push_back(make_tuple(i,N,L-func(2,i-1)));\n\t\t\tL-=func(2,i-1);\n\t\t}\n\t}\n\tcout << N <<\" \" << v.size() << endl;\n\tfor(int i=0;i<v.size();i++){\n\t\tcout << get<0>(v[i]) <<\" \"<< get<1>(v[i]) <<\" \"<< get<2>(v[i]) <<endl;\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, a, b) for (ll i = (a); i < (b); i++)\ntypedef uint64_t ull;\ntypedef int64_t ll;\ntypedef std::pair<ll, ll> PLL;\n\nstruct edge {\n ll from, to, val;\n};\n\nsigned main() {\n ll L;\n cin>>L;\n\n vector<edge> edges;\n\n ll d = 0;\n while ((1ll << (d+1)) <= L){\n d++;\n }\n\n rep(i,1,d+1){\n edges.push_back({i,i+1,0});\n edges.push_back({i,i+1,1LL<<(i-1)});\n }\n\n ll val = 1ll << d; //32\n for (ll i = d-1; i>=0; i--) {\n if ((L & (1ll<<i)) == 0)\n continue;\n // printf(\"val=%d\\n\",val);\n edges.push_back({i+1,d+1,val});\n val += 1ll << i;\n }\n\n printf(\"%d %d\\n\", d+1, edges.size());\n for(auto e : edges){\n printf(\"%d %d %d\\n\", e.from, e.to, e.val);\n }\n\n return 0;\n}\n", "length = int(input())\ngoal = 0\nwhile 2**goal <= length:\n goal += 1\nedge = []\nfor i in range(1,goal):\n edge.append((i, i+1, 0))\n edge.append((i, i+1, 2**(i-1)))\nremain = length - 2**(goal - 1)\ndef addedge(r, s):\n if r == 1:\n edge.append((1, goal, s))\n return\n if r == 2:\n edge.append((1, goal, s))\n edge.append((1, goal, s+1))\n return\n else:\n k = 0\n while 2**k <= r:\n k += 1\n remain = r - 2**(k-1)\n edge.append((k, goal, s))\n if remain:\n addedge(remain, s + 2**(k-1))\nif remain:\n shift = 2**(goal-1)\n addedge(remain, shift)\nprint(goal, len(edge))\nfor v1, v2, w in edge:\n print(v1, v2, w)", "import math\nl = int(input())\n\n# l -= 1\nn = math.floor(math.log2(l)) + 1\nedge = []\nfor i in range(1, n):\n edge.append((i, i+1, 0))\nfor j, i in enumerate(reversed(range(1, n))):\n edge.append((i, i+1, 2**j))\n\nl2 = l - 2**(n-1)\nc = 2**(n-1)\n# print(\"test\", c, l2)\nwhile l2 > 0:\n l_mini = 1\n while l_mini * 2 <= l2:\n l_mini *= 2\n # print(\"test\", c, l2, int(math.log2(l_mini)))\n edge.append((1, n-int(math.log2(l_mini)), c))\n l2 -= l_mini\n c += l_mini\n\nprint(n, len(edge))\nfor i in range(len(edge)):\n print(*edge[i])\n", "l = int(input())\nn = 0\nwhile 2**n <= l:\n n += 1\np = []\nfor i in range(1, n):\n p.append((i, i + 1, 0))\n p.append((i, i + 1, 2**(i-1)))\n if l // (2**(i-1)) % 2 == 1:\n p.append((i, n, l // 2**i * 2**i))\nm = len(p)\nprint(n, m)\nfor i in p:\n print(*i)\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\nusing namespace std;\nusing ll = long long ;\nusing P = pair<int,int> ;\nusing pll = pair<long long,long long>;\nconstexpr int INF = 1e9;\nconstexpr long long LINF = 1e17;\nconstexpr int MOD = 1000000007;\nconstexpr double PI = 3.14159265358979323846;\n\nstruct edge{\n int u,v,w;\n};\n\nint main(){\n int L;\n cin >> L;\n int p = 1;\n int c = 0;\n while((p<<1)<L) p<<=1,++c;\n if(L!=p*2){\n p>>=1;\n --c;\n }\n int n = c+2;\n \n vector<edge> ans;\n\n int q = 1;\n int sum = 1;\n for(int i=n-1;i>=1;i--){\n ans.push_back(edge{i,i+1,q});\n ans.push_back(edge{i,i+1,0});\n q <<= 1;\n sum *= 2;\n }\n\n for(int i=n-2;i>=0;i--){\n if(L>>i&1){\n ans.push_back(edge{1,n-i,sum});\n sum += (1<<i);\n }\n }\n\n cout << n << \" \" << ans.size() << endl;\n rep(i,ans.size()){\n cout << ans[i].u << \" \" << ans[i].v << \" \" << ans[i].w << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n\nusing ll = long long;\n\nusing namespace std;\n\nstruct edge{int u, v, w;};\n\nint main() {\n int l;\n cin >> l;\n int d = 1 << 20, i = 1;\n for ( ; (2 * d & l) == 0; d >>= 1);\n vector<edge> ans;\n for (int cur=2 * d; d > 0; (i++, d >>= 1)) {\n ans.push_back(edge{i, i+1, 0});\n ans.push_back(edge{i, i+1, d});\n if (l - cur >= d) {\n ans.push_back(edge{1, i+1, cur});\n cur += d;\n }\n }\n cout << i << ' ' << ans.size() << '\\n';\n for (auto &e:ans) cout << e.u << ' ' << e.v << ' ' << e.w << '\\n';\n return 0;\n}" ]
There are N people. The name of the i-th person is S_i. We would like to choose three people so that the following conditions are met: * The name of every chosen person begins with `M`, `A`, `R`, `C` or `H`. * There are no multiple people whose names begin with the same letter. How many such ways are there to choose three people, disregarding order? Note that the answer may not fit into a 32-bit integer type. Constraints * 1 \leq N \leq 10^5 * S_i consists of uppercase English letters. * 1 \leq |S_i| \leq 10 * S_i \neq S_j (i \neq j) Input Input is given from Standard Input in the following format: N S_1 : S_N Output If there are x ways to choose three people so that the given conditions are met, print x. Examples Input 5 MASHIKE RUMOI OBIRA HABORO HOROKANAI Output 2 Input 4 ZZ ZZZ Z ZZZZZZZZZZ Output 0 Input 5 CHOKUDAI RNG MAKOTO AOKI RINGO Output 7
[ "import java.util.HashMap;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n HashMap<String,Long> namelist = new HashMap<>();\n String s = \"MARCH\";\n for(int i = 0;i<s.length();i++){\n namelist.put(String.valueOf(s.charAt(i)), Long.valueOf(0));\n }\n for (int i = 0; i < n; i++) {\n String name = String.valueOf(sc.next().charAt(0));\n if(namelist.containsKey(name)){\n namelist.put(name,namelist.get(name)+1);\n }\n }\n \n long ans=0;\n \n for(int i =0;i<s.length()-2;i++){\n long a = namelist.get(String.valueOf(s.charAt(i)));\n for(int j=i+1;j<s.length()-1;j++){\n long b = namelist.get(String.valueOf(s.charAt(j)));\n for(int k = j+1;k<s.length();k++){\n long c = namelist.get(String.valueOf(s.charAt(k)));\n ans += a*b*c;\n }\n }\n }\n System.out.println(ans);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n string s;\n long long int a[5]={};\n string march=\"MARCH\";\n for(int i=0;i<n;i++){\n cin>>s;\n \n for(int j=0;j<5;j++)\n if(s.at(0)==march[j])\n a[j]++;\n \n }\n long long int ans=0;\n \n for(int i=0;i<3;i++)\n for(int j=i+1;j<4;j++)\n for(int k=j+1;k<5;k++){\n ans+=a[i]*a[j]*a[k];\n \n }\n \n \n cout<<ans;\n return 0;\n \n}", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt(); in.nextLine();\n Map<Character, Long> map = new HashMap<Character, Long>(){{\n put('M', 0L); put('A', 0L); put('R', 0L); put('C', 0L); put('H', 0L);\n }};\n for (int i = 0; i < n; i++) {\n char ch = in.nextLine().charAt(0);\n if(map.containsKey(ch)){\n map.put(ch, map.get(ch) + 1);\n }\n }\n long ans = 0;\n ans += map.get('M') * map.get('A') * map.get('R');\n ans += map.get('M') * map.get('A') * map.get('C');\n ans += map.get('M') * map.get('A') * map.get('H');\n ans += map.get('M') * map.get('R') * map.get('C');\n ans += map.get('M') * map.get('R') * map.get('H');\n ans += map.get('M') * map.get('C') * map.get('H');\n ans += map.get('A') * map.get('R') * map.get('C');\n ans += map.get('A') * map.get('R') * map.get('H');\n ans += map.get('A') * map.get('C') * map.get('H');\n ans += map.get('R') * map.get('C') * map.get('H');\n System.out.println(ans);\n }\n}\n", "#include <iostream>\n#include <stdio.h>\n#include <string.h>\n#define MAX_A 2333\n#define MAX_L 15\n#define int long long\n\nusing namespace std;\n\nconst char c[]=\"MARCH\";\n\nint n;\nint f[MAX_A];\nchar s[MAX_L];\n\nint cal()\n{\n\tint ans=0;\n\tfor(int i=0;i<5;i++)\n\t{\n\t\tfor(int j=i+1;j<5;j++)\n\t\t{\n\t\t\tfor(int k=j+1;k<5;k++)\n\t\t\t{\n\t\t\t\tans+=f[c[i]]*f[c[j]]*f[c[k]];\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\nsigned main()\n{\n\tscanf(\"%lld\",&n);\n\tfor(int i=1;i<=n;i++) scanf(\"%s\",s),f[s[0]]++;\n\tprintf(\"%lld\\n\",cal());\n}\n", "#include<iostream>\n#include<string>\n\nconst char c[5]={'M','A','R','C','H'};\n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n \n string s;\n long cnt[5]={0};\n for(int i=0;i<n;i++){\n cin >> s;\n for(int j=0;j<5;j++){\n if(s[0]==c[j]) cnt[j]++;\n } \n }\n \n long long res=0;\n \n for(int i=0;i<5;i++){\n for(int j=i+1;j<5;j++){\n for(int k=j+1;k<5;k++){\n res=res+cnt[i]*cnt[j]*cnt[k];\n }\n }\n }\n\n cout << res << endl;\n\n}", "import itertools\nN = int(input())\n# N=10^5\ncount={}\nfor i in range(N):\n c = input()[0]\n count[c] = count.get(c, 0)+1\ns = 0\nfor a,b,c in itertools.combinations(\"MARCH\", 3):\n s += count.get(a,0)*count.get(b,0)*count.get(c,0)\nprint(s)\n \n\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n int N;\n cin >> N;\n string S;\n char b[5]={'M','A','R','C','H'};\n long long a[5]={};\n rep(i,N){\n cin >> S;\n rep(j,5) if(S[0]==b[j]) a[j]++;\n }\n int c[10]={0,0,0,0,0,0,1,1,1,2};\n int d[10]={1,1,1,2,2,3,2,2,3,3};\n int e[10]={2,3,4,3,4,4,3,4,4,4};\n long long ans=0;\n rep(i,10) ans+=a[c[i]]*a[d[i]]*a[e[i]];\n cout << ans <<endl;\n return 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[]k = new int[5];\n\t\tint N = sc.nextInt();\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tchar c = sc.next().charAt(0);\n\t\t\tif(c == 'M') k[0]++;\n\t\t\telse if(c == 'A') k[1]++;\n\t\t\telse if(c == 'R') k[2]++;\n\t\t\telse if(c == 'C') k[3]++;\n\t\t\telse if(c == 'H') k[4]++;\n\t\t}\n\t\tsc.close();\n\t\tlong sum = 0;\n\t\tfor(int i = 0; i < 3; i++) {\n\t\t\tfor(int j = i + 1; j < 4; j++) {\n\t\t\t\tfor(int l = j + 1; l < 5; l++) {\n\t\t\t\t\tsum += (long)k[i] * k[j] * k[l];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n}", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] head = new long[5];\n for(int i = 0;i<n;i++){\n String s = sc.next();\n char[] c = s.toCharArray();\n if(c[0]=='M'){\n head[0]++;\n }else if(c[0]=='A'){\n head[1]++;\n }else if(c[0]=='R'){\n head[2]++;\n }else if(c[0]=='C'){\n head[3]++;\n }else if(c[0]=='H'){\n head[4]++;\n }\n }\n long ans = 0l;\n for(int i = 0;i<3;i++){\n for(int j = i+1;j<4;j++){\n for(int k = j+1;k<5;k++){\n ans += head[i]*head[j]*head[k];\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "#include <iostream>\n#include <string>\n#include <vector>\ntypedef long long ll;\nusing namespace std;\n\nint main(){\n int N;\n ll M=0,A=0,R=0,C=0,H=0;\n cin >> N;\n vector<char> S;\n string tmp;\n while(cin >> tmp){\n char f=tmp[0];\n if(f=='M'){M++;}\n else if(f=='A'){A++;}\n else if(f=='R'){R++;}\n else if(f=='C'){C++;}\n else if(f=='H'){H++;} \n }\n ll ans=M*A*R +M*A*C +M*A*H +M*R*C +M*R*H+ M*C*H +A*R*C+ A*R*H +A*C*H +R*C*H;\n cout << ans;\n return 0;\n}", "_,*l=open(0)\nimport itertools as it\nprint(sum(x*y*z for x,y,z in it.combinations([sum(s[0]==c for s in l) for c in 'MARCH'],3)))", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main()\n{\n int N; cin >> N;\n map<char, ll> cnt;\n for (int i = 0; i < N; ++i) {\n string s; cin >> s;\n cnt[s[0]]++;\n }\n\n string P = \"MMMMMMAAAR\";\n string Q = \"AAARRCRRCC\";\n string R = \"RCHCHHCHHH\";\n\n ll ans = 0;\n for (int i = 0; i < 10; ++i) {\n ans += cnt[P[i]] * cnt[Q[i]] * cnt[R[i]];\n }\n\n cout << ans << endl;\n}", "import itertools\n*s, = open(0)\nprint(sum(i*j*k for i,j,k in itertools.combinations([sum(t.startswith(l) for t in s) for l in \"MARCH\"], 3)))", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner scanner;\n\n\tpublic static void main(String[] args) {\n\t scanner = new Scanner(System.in);\n\n\t int N=gi();\n\t long[] m=new long[5];\n\t String march=\"MARCH\";\n\n\t for (int i=0; i<N; i++) {\n\t \tString s=gs();\n\t \tfor (int j=0; j<5; j++) {\n char c=march.charAt(j);\n if(s.charAt(0)==c)m[j]++;\n\t \t}\n\t }\n\t \n\t long sum=0;\n\t for (int i=0; i<5; i++) {\n\t \tfor (int j=i+1; j<5; j++) {\n\t \t\tfor (int k=j+1; k<5; k++) {\n\t sum+=m[i]*m[j]*m[k];\n\t\t \t}\n\t \t}\n\t }\n\n\t System.out.println(sum);\n// if (f) {\n// \t String a=Sq.substring(0, S.lastIndexOf(T)) + T + Sq.substring(S.lastIndexOf(T)+T.length());\n// \t System.out.print(a.replaceAll(\"\\\\?\", \"a\"));\n// }else {\n// \tSystem.out.print(\"UNRESTORABLE\");\n// }\n\t}\n\n\t// 文字列として入力を取得\n\tpublic static String gs() {\n\t\treturn scanner.next();\n\t}\n\n\t// intとして入力を取得\n\tpublic static int gi() {\n\t\treturn Integer.parseInt(scanner.next());\n\t}\n\n\t// longとして入力を取得\n\tpublic static long gl() {\n\t\treturn Long.parseLong(scanner.next());\n\t}\n\n\t// doubleとして入力を取得\n\tpublic static double gd() {\n\t\treturn Double.parseDouble(scanner.next());\n\t}\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\n\nstring M = \"MARCH\";\nint main() {\n\tint N;\n\tlong long cnt[5] = {};\n\tcin >> N;\n\tfor(int i = 0; i < N; i++) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor(int j = 0; j < 5; j++) {\n\t\t\tif(s[0] == M[j]) {\n\t\t\t\tcnt[j]++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tlong long res = 0;\n\tfor(int i = 0; i < 3; i++) {\n\t\tfor(int j = i + 1; j < 4; j++) {\n\t\t\tfor(int k = j + 1; k < 5; k++) {\n\t\t\t\tres += cnt[i] * cnt[j] * cnt[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout << res << endl;\n}\n", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main(){\n long long int n;\n cin>>n;\n vector<long long int> a(5,0);\n for(long long int i=0;i<n;i++){\n string s;\n cin>>s;\n if(s[0]=='M')a[0]++;\n if(s[0]=='A')a[1]++;\n if(s[0]=='R')a[2]++;\n if(s[0]=='C')a[3]++;\n if(s[0]=='H')a[4]++;\n }\n long long int ans=0;\n for(int i=0;i<3;i++){\n for(int j=i+1;j<4;j++){\n for(int k=j+1;k<5;k++)ans+=a[i]*a[j]*a[k];\n }\n }\n cout<<ans<<endl;\n}\n", "#include\"bits/stdc++.h\"\n\nusing namespace std;\nlong long C[9], V[99];\nlong long N;\nlong long cnt;\nchar A[15];\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcin >> N;\n\n\twhile(N--){\n\t\tcin >> A;\n\t\tV[A[0]]++;\n\t}\n\tC[0] = V['M'];\n\tC[1] = V['A'];\n\tC[2] = V['R'];\n\tC[3] = V['C'];\n\tC[4] = V['H'];\n\tfor (int i = 0; i < 5; i++) \n\t\tfor (int j = i + 1; j < 5; j++) \n\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\tcnt += C[i] * C[j] * C[k];\n\t\t\t}\n\n\tcout << cnt << endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n\n int march[] = new int[5];\n for (int i = 0; i < n; i++) {\n String str = sc.next();\n char ch = str.charAt(0);\n switch(ch) {\n case 'M' :\n march[0]++;\n break;\n case 'A' :\n march[1]++;\n break;\n case 'R' :\n march[2]++;\n break;\n case 'C' :\n march[3]++;\n break;\n case 'H' :\n march[4]++;\n break;\n }\n }\n// for (int i = 0; i < 5; i++) {\n// System.out.println(march[i]);\n// }\n\n// System.out.println(\"---------------------------------\");\n\n long ans = 0;\n\n for (int i = 0; i <= 2; i++) {\n for (int j = i+1; j <=3 ; j++) {\n for (int k = j+1; k <=4 ; k++) {\n ans += count(march[i], march[j], march[k]);\n// System.out.println(i + \"/\"+ j + \"/\" + k + \":\" + count(march[i], march[j], march[k]));\n }\n }\n }\n\n System.out.println(ans);\n sc.close();\n }\n\n static long count(long a, long b, long c) {\n return a * b * c;\n }\n\n}\n", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\n\n\tpublic class Main {\n\t\t\n\t\t\n\n\t\tpublic static void main(String[] args) {\n\n\t\t\tScanner sc = new Scanner(System.in);\n\t \n\t\t\tint n = sc.nextInt();\n\t\t\tMap<Character,Long> m = new HashMap<Character,Long>();\n\t\t\tlong one = 1;\n\t\t\t\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\tchar[] s = sc.next().toCharArray();\n\t\t\t\tm.merge(s[0], one, Long::sum);\n\t\t\t}\n\t\t\t\n\t\t\tlong[] num = new long[5];\n\t\t\tchar[] march = \"MARCH\".toCharArray();\n\t\t\tlong sum =0;\n\t\t\tlong kind =0;\n\t\t\tlong subst =0;\n\t\t\t\n\t\t\tif(n<3) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int i=0;i<5;i++) {\n\t\t\t\tif(m.containsKey(march[i])) {\n\t\t\t\t\tnum[i] = m.get(march[i]);\n\t\t\t\t}\n\t\t\t\tif(num[i]>0) {\n\t\t\t\t\tkind++;\n\t\t\t\t}\n\t\t\t\tsum += num[i];\n\t\t\t}\n\t\t\tlong ret = 0;\n\t\t\t\n\t\t\tfor(int i=0;i<5;i++) {\n\t\t\t\tfor(int j=i+1;j<5;j++) {\n\t\t\t\t\tfor(int k=j+1;k<5;k++) {\n\t\t\t\t\t\tret += num[i]*num[j]*num[k];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tSystem.out.println(ret);\n\t\t}\n\t\t\n\t}\n", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(void){\n long n,ans,a,r,c,h,m;\n a = r = c = h = m = 0;\n string b;\n cin >> n;\n for(int i = 0;i < n;i ++){\n cin >> b;\n if(b[0] == 'A')a ++;\n else if(b[0]=='R')r ++;\n else if(b[0]=='C')c ++;\n else if(b[0]=='M')m ++;\n else if(b[0]=='H')h ++;\n }\n\n cout << a*r*c + a*r*m + a*r*h + a*c*m + a*c*h + a*m*h + r*c*m +r*c*h + r*m*h + c*m*h << endl;\n}", "import itertools\n\nN = int(input())\n\nd = {'M':0, 'A':0, 'R':0, 'C':0, 'H':0}\n\nfor i in range(N):\n s = input()\n if s[0] in d:\n d[s[0]] += 1\n\nc = itertools.combinations('MARCH', 3)\n\nans = 0\n\nfor i, j, k in c:\n ans += d[i]*d[j]*d[k]\n\nprint(ans)\n\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n long mod = (long)Math.pow(10,9)+7;\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n char[] march = {'M','A','R','C','H'};\n long[] a = new long[5];\n for(int i = 0; i < n; i++){\n String s = sc.next();\n char f = s.charAt(0);\n for(int j = 0; j < 5; j++){\n if(march[j] == f){\n a[j]++;\n break;\n }\n }\n }\n long ans = 0;\n for(int i = 0; i < 5; i++){\n for(int j = i+1; j < 5; j++){\n for(int k = j+1; k < 5; k++){\n ans += (a[i] * a[j] * a[k]); \n }\n }\n }\n System.out.println(ans);\n }\n}", "l=[input()[0] for _ in range(int(input()))]\nimport itertools as it\nprint(sum(x*y*z for x,y,z in it.combinations([l.count(c) for c in 'MARCH'],3)))", "import java.util.Scanner;\n\n\npublic class Main {\n\t\n\tstatic int[][] memory;\n\t\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n \n int N = sc.nextInt();\n \n int count = 0;\n int[] member = new int[5];\n int select = 3;\n \n \n for(int i = 0;i<N;i++){\n \t\n \tString line = sc.next();\n \t\n \tif('M'==line.charAt(0)){\n \t\tmember[0]++;\n \t\t\n \t}else if('A'==line.charAt(0)){\n \t\tmember[1]++;\n \t}else if('R'==line.charAt(0)){\n \t\tmember[2]++;\n \t}else if('C'==line.charAt(0)){\n \t\tmember[3]++;\n \t}else if('H'==line.charAt(0)){\n \t\tmember[4]++;\n \t}\n \t\n \t\n \t\n }\n \n long ans = result(member,select,0);\n \n System.out.println(ans);\n\t\t\n\t}\n\n\tprivate static long result(int[] member,int count,int choise) {\n\t\t\n\t\tlong ans=1;\n\t\t\n\t\tif(choise==member.length-1)\n\t\t\tif(count==1)\treturn member[choise];\n\t\t\telse if(count==0)\treturn 1;\n\t\t\telse return 0;\n\t\t\n\t\tif(count>0&&member[choise]>0){\n\t\t\tans = (result(member,count,choise+1)+result(member,count-1,choise+1)*member[choise]);\n\t\t}else{\n\t\t\tans = result(member,count,choise+1);\n\t\t}\n\t\t\n\t\treturn ans;\n\t\t\n\t}\n\t\t\n\n \n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\t//System.out.println(N);\n\t\tlong m=0;\n\t\tlong a=0;\n\t\tlong r=0;\n\t\tlong c=0;\n\t\tlong h=0;\n\t\tfor(int i =0;i<N;i++){\n\t\t\tString str=sc.next();\n\t\t\t//System.out.println(str);\n\t\t\tchar hoge =str.charAt(0);\n\t\t\t//System.out.println(hoge);\n\t\t\tif(hoge== 'M'){\n\t\t\t\t//System.out.println(\"M\");\n\t\t\t\tm++;\n\t\t\t}else if(hoge=='A'){\n\t\t\t\ta++;\n\t\t\t\t//System.out.println(\"A\");\n\t\t\t}else if(hoge=='R'){\n\t\t\t\tr++;\n\t\t\t\t//System.out.println(\"R\");\n\t\t\t}else if(hoge=='C'){\n\t\t\t\tc++;\n\t\t\t\t//System.out.println(\"C\");\n\t\t\t}else if(hoge=='H'){\n\t\t\t\th++;\n\t\t\t\t//System.out.println(\"H\");\n\t\t\t}\n\t\t}\n\t\tlong ans=0;\n\t\tans = m*(a*(r+c+h)+r*(c+h)+c*h)+a*(r*(c+h)+c*h)+r*c*h;\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint main()\n{\n\tint n;\n\tcin>>n;\n\tstring s[n];\n\tfor(int i=0;i<n;i++)\n\t\tcin>>s[i];\n\tll m=0,a=0,r=0,c=0,h=0;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(s[i][0]=='M')\n\t\t\tm++;\n\t\telse if(s[i][0]=='A')\n\t\t\ta++;\n\t\telse if(s[i][0] =='R')\n\t\t\tr++;\n\t\telse if(s[i][0]=='C')\n\t\t\tc++;\n\t\telse if(s[i][0]=='H')\n\t\t\th++;\n\n\t}\n\n\tll ways = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n\tcout<<ways<<\"\\n\";\n}\n", "import java.util.*;\npublic class Main{\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] a = new long[5];\n Arrays.fill(a,0);\n for(int i = 0;i < N;i++){\n String s = sc.next();\n if(s.charAt(0) == 'M')a[0]++;\n if(s.charAt(0) == 'A')a[1]++;\n if(s.charAt(0) == 'R')a[2]++;\n if(s.charAt(0) == 'C')a[3]++;\n if(s.charAt(0) == 'H')a[4]++;\n }\n System.out.println(a[0]*a[1]*a[2]+a[1]*a[2]*a[3]+a[2]*a[3]*a[4]+a[3]*a[4]*a[0]+a[4]*a[0]*a[1]+a[0]*a[1]*a[3]+a[1]*a[2]*a[4]+a[2]*a[3]*a[0]+a[3]*a[4]*a[1]+a[4]*a[0]*a[2]);\n}}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong f(vector<long>& C, int n, int i, long acc) {\n if (n == 3) return acc;\n else if (acc == 0 || i == 5) return 0;\n return f(C, n + 1, i + 1, acc * C[i]) + f(C, n, i + 1, acc);\n}\n\nint main() {\n int N;\n cin >> N;\n string XX = \"MARCH\";\n vector<long> C(XX.size(), 0);\n string S;\n for (int i = 0; i < N; i++) {\n cin >> S;\n auto tmp = XX.find(S[0]);\n if (tmp != string::npos) C[tmp]++;\n }\n cout << f(C, 0, 0, 1) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n int n;\n cin >> n;\n ll cnt[256] {};\n for (int i = 0; i < n; i++) {\n string s;\n cin >> s;\n cnt[s[0]]++;\n }\n string ma = \"MARCH\";\n ll ans = 0;\n for (int i = 0; i < 3; i++)\n for (int j = i+1; j < 4; j++)\n for (int k = j+1; k < 5; k++)\n ans += cnt[ma[i]] * cnt[ma[j]] * cnt[ma[k]];\n cout << ans;\n return 0;\n}", "from itertools import combinations as cmbs\nimport sys\nc = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nfor i in range(int(input())):\n si = sys.stdin.readline()\n if si[0] in c:\n c[si[0]] += 1\nans = 0\nfor i,j,k in cmbs(c.values(),r=3):\n t = i*j*k\n ans += t\nprint(ans)\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n String[] str = new String[n];\n for (int i = 0; i < n; i++) {\n str[i] = sc.next();\n }\n long[] march = new long[5];\n for (int i = 0; i < n; i++) {\n switch (str[i].charAt(0)) {\n case 'M':\n march[0]++;\n break;\n case 'A':\n march[1]++;\n break;\n case 'R':\n march[2]++;\n break;\n case 'C':\n march[3]++;\n break;\n case 'H':\n march[4]++;\n break;\n }\n }\n long ans = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 4; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += march[i] * march[j] * march[k];\n }\n }\n }\n System.out.println(ans);\n\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n map<char,long long int> mp;\n string s;\n for(int i=0;i<n;i++){\n cin >> s;\n mp[s[0]]++;\n }\n long long int ans=0;\n vector<char> v = {'M','A','R','C','H'};\n for(auto u:v){\n for(auto x:v){\n for(auto y:v){\n if(u!=x && u!=y && x!=y)ans += mp[u]*mp[x]*mp[y];\n }\n }\n }\n ans /= 6;\n cout << ans;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long mp[1000];\nlong long res;\nint n;\n\nint main() {\n\tscanf(\"%d\", &n);\n\tfor(int i = 1; i <= n; i++) {\n\t\tchar ch[1000];\n\t\tscanf(\"%s\", ch);\n\t\tmp[ch[0]]++;\n\t}\n\tint P[6] = {0, 'M', 'A', 'R', 'C', 'H'};\n\tfor(int i = 1; i <= 3; i++)\n\t\tfor(int j = i + 1; j <= 4; j++)\n\t\t\tfor(int k = j + 1; k <= 5; k++)\n\t\t\t\tres += mp[P[i]] * mp[P[j]] * mp[P[k]];\n\tprintf(\"%lld\\n\", res);\n\treturn 0;\n}", "n = int(input())\ns = \"MARCH\"\nd = { i:0 for i in s }\nfor _ in range(n):\n f = input()[0]\n if f in s:\n d[f] += 1\nans = 0\nfor i in range(3):\n for j in range(i+1, 4):\n for k in range(j+1, 5):\n ans += d[s[i]]*d[s[j]]*d[s[k]]\nprint(ans)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long march[] = new long[5];\n \n for(int i = 0; i < N; i++) {\n String S = sc.next();\n char x = S.charAt(0);\n \n switch(x){\n case 'M':\n march[0]++;\n break;\n case 'A':\n march[1]++;\n break;\n case 'R':\n march[2]++;\n break;\n case 'C':\n march[3]++;\n break;\n case 'H':\n march[4]++;\n break;\n }\n }\n \n long sum = 0;\n for(int a = 0; a < 3; a++) {\n for(int b = a + 1; b < 4; b++) {\n for(int c = b + 1; c < 5; c++){\n sum += march[a] * march[b] * march[c];\n }\n }\n }\n \n System.out.println(sum);\n \n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nint x[5],ans;\n\nsigned main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(s[0]=='M')x[0]++;\n\t\telse if(s[0]=='A')x[1]++;\n\t\telse if(s[0]=='R')x[2]++;\n\t\telse if(s[0]=='C')x[3]++;\n\t\telse if(s[0]=='H')x[4]++;\n\t}\n\tfor(int i=0;i<5;i++){\n\t\tfor(int j=i+1;j<5;j++){\n\t\t\tfor(int k=j+1;k<5;k++){\n\t\t\t\tans+=x[i]*x[j]*x[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "from itertools import combinations\nfrom collections import Counter\n\nN = int(input())\nS = Counter()\n\nfor i in range(N):\n S[input()[0]] += 1\n\ntmp = []\nfor a,b,c in combinations('MARCH',3):\n tmp.append(int((S[a] * S[b] * S[c])))\n\nprint(sum(tmp))\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(void){\n int N;cin>>N;\n string s;\n ll m,a,r,h,c;m=0;a=0;r=0;h=0;c=0;\n for(int i=0;i<N;i++){\n cin>>s;\n if(s[0]=='M')m++;\n if(s[0]=='A')a++;\n if(s[0]=='R')r++;\n if(s[0]=='C')c++;\n if(s[0]=='H')h++;\n }\n cout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n \n long long s[100] = {0};\n for(int i=0; i<n; i++){\n string v;\n cin >> v;\n s[v[0]]++;\n }\n\n long long ss[5] = {s['M'], s['A'], s['R'], s['C'], s['H']};\n \n long long ans = 0;\n for(int i=0; i<3; i++){\n for(int j=i+1; j<4; j++){\n for(int k=j+1; k<5; k++){\n ans+=ss[i] * ss[j] * ss[k];\n }\n }\n }\n\n cout << ans << endl;\n \n \n return 0;\n}\n", "from itertools import combinations\nN = int(input())\nd = [0]*128\nfor _ in range(N): d[ord(input()[0])] += 1\nprint(sum([d[ord(p0)]*d[ord(p1)]*d[ord(p2)] for p0,p1,p2 in combinations('MARCH', 3)]))\n", "N=int(input())\nn=[input()[0] for _ in range(N)]\nm,a,r,c,h=n.count(\"M\"),n.count(\"A\"),n.count(\"R\"),n.count(\"C\"),n.count(\"H\")\nprint(m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h)", "n = int(input())\nA = ''\n\nfor i in range(n):\n a = input()\n A += a[0]\n\nm = A.count('M')\na = A.count('A')\nr = A.count('R')\nc = A.count('C')\nh = A.count('H')\n\nans = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h\nprint(ans)", "import java.util.*;\nimport static java.lang.Math.*;\nimport java.math.BigInteger;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tint n = sc.nextInt();\n\t\tint[] march = new int[5];\n\t\tfor(int i = 0; i < n; i++){\n\t\t String s = sc.next();\n\t\t if(s.charAt(0) == 'M') march[0]++;\n\t\t if(s.charAt(0) == 'A') march[1]++;\n\t\t if(s.charAt(0) == 'R') march[2]++;\n\t\t if(s.charAt(0) == 'C') march[3]++;\n\t\t if(s.charAt(0) == 'H') march[4]++;\n\t\t}\n\t\t\n\t\t// 計算\n\t\tlong result = 0;\n\t\tfor(int i = 0; i < 1<<5; i++){\n\t\t if(Integer.bitCount(i) != 3) continue;\n\t\t long cnt = 1;\n\t\t for(int j = 0; j < 5; j++){\n\t\t if(((i>>j)&1) == 1){\n\t\t cnt *= (long)march[j];\n\t\t }\n\t\t }\n\t\t result += cnt;\n\t\t}\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n}\n\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nint a[6];\nint main ()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tstring s;\n\t\tcin >> s;\n\t\tif(s[0] == 'M') a[0]++;\n\t\tif(s[0] == 'A') a[1]++;\n\t\tif(s[0] == 'R') a[2]++;\n\t\tif(s[0] == 'C') a[3]++;\n\t\tif(s[0] == 'H') a[4]++;\n\t}\n\tlong long ans = 0;\n\tfor(int i = 0; i < 5; i++)\n\t{\n\t\tfor(int j = i + 1; j < 5; j++)\n\t\t{\n\t\t\tfor(int k = j + 1; k < 5; k++)\n\t\t\t{\n\t\t\t\tans += (1LL * a[i] * a[j] * a[k]);\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans;\n}", "_,*l=open(0);from itertools import*;print(sum(x*y*z for x,y,z in combinations([sum(c==s[0]for s in l)for c in'MARCH'],3)))", "import java.util.*;\n \npublic class Main{\n\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n \n int N = sc.nextInt();\n String[] S = new String[N];\n for(int i = 0; i < N; i++){\n S[i] = sc.next();\n }\n sc.close();\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n for(int i = 0; i < N; i++){\n if(S[i].charAt(0) == 'M')\n m++;\n if(S[i].charAt(0) == 'A')\n a++;\n if(S[i].charAt(0) == 'R')\n r++;\n if(S[i].charAt(0) == 'C')\n c++;\n if(S[i].charAt(0) == 'H')\n h++;\n }\n long sum = 0;\n sum += m*a*r +\n m*a*c +\n m*a*h +\n m*r*c +\n m*r*h +\n m*c*h +\n a*r*c +\n a*r*h +\n a*c*h +\n r*c*h;\n\n System.out.println(sum);\n }\n}", "import java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\n\t@SuppressWarnings(\"resource\")\n\tpublic static void main(String args[]) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tSet<String> marchSet = new HashSet<>();\n\t\tlong march[] = new long[5];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString s = scanner.next();\n\t\t\tmarchSet.add(s);\n\t\t}\n\n\t\tfor (String s : marchSet) {\n\t\t\tif (s.charAt(0) == 'M')\n\t\t\t\tmarch[0]++;\n\t\t\telse if (s.charAt(0) == 'A')\n\t\t\t\tmarch[1]++;\n\t\t\telse if (s.charAt(0) == 'R')\n\t\t\t\tmarch[2]++;\n\t\t\telse if (s.charAt(0) == 'C')\n\t\t\t\tmarch[3]++;\n\t\t\telse if (s.charAt(0) == 'H')\n\t\t\t\tmarch[4]++;\n\t\t}\n\n\t\tlong cnt = 0;\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tfor (int j = i + 1; j < 5; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tcnt += (march[i] * march[j] * march[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = int64_t;\nint main(){\n\tll n;\n\tcin >> n;\n\tll po[5] = {};\n\tstring s = \"MARCH\";\n\tmap<char, ll> m;\n\tfor(ll i = 0; i < 5; i++) m[s[i]] = i;\n\tfor(ll i = 0; i < n; i++){\n\t\tstring yo;\n\t\tcin >> yo;\n\t\tif(m.find(yo[0]) == m.end()) continue;\n\t\tpo[m[yo[0]]]++;\n\t}\n\tll ans = 0;\n\tfor(ll i = 0; i < 5; i++)for(ll j = i + 1; j < 5; j++)for(ll k = j + 1; k < 5; k++) ans += po[i] * po[j] * po[k];\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);i++)\ntypedef long long ll;\nusing namespace std;\n\nstring T=\"MARCH\";\nstring S;\nll N,C[5],ans;\n\nint main(void){\n cin >> N;\n rep(i,N){\n cin >> S;\n rep(i,5)if(T[i] == S[0])C[i]++; \n }\n \n for(int i=0;i<5;i++){\n for(int j=i+1;j<5;j++){\n for(int k=j+1;k<5;k++) ans+=C[i]*C[j]*C[k];\n\n }\n }\n\n cout << ans << endl;\n}\n", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] march = new long[5];\n\t\tString s;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ts = sc.next();\n\t\t\tif(s.charAt(0) == 'M') march[0]++;\n\t\t\tif(s.charAt(0) == 'A') march[1]++;\n\t\t\tif(s.charAt(0) == 'R') march[2]++;\n\t\t\tif(s.charAt(0) == 'C') march[3]++;\n\t\t\tif(s.charAt(0) == 'H') march[4]++;\n\t\t}\n\t\tint[][] num = {{0,1,2},{0,1,3},{0,1,4},{0,2,3},{0,2,4},{0,3,4},{1,2,3},{1,3,4},{1,2,4},{2,3,4}};\n\t\t\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < 10; i++) {\n\t\t\tans += march[num[i][0]]*march[num[i][1]]*march[num[i][2]];\n\t\t}\n\t\tSystem.out.println(ans);\n\t\t\n\t\tsc.close();\n\t}\n\t\n\n\tvoid debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tlong combination(int n, int r, int m) { //nCr mod m\n\t\tlong[][] Combination = new long[n + 1][n + 1];\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tCombination[i][0] = 1;\n\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\tCombination[i][j] = (Combination[i - 1][j - 1] + Combination[i - 1][j]) % m;\n\t\t\t}\n\t\t}\n\t\treturn Combination[n][r];\n\t}\n\n\tint gcd(int a, int b) {\n\t\tif (a < b) {\n\t\t\tint c = a;\n\t\t\ta = b;\n\t\t\tb = c;\n\t\t}\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn gcd(b, a % b);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}\n", "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint[] n = new int[5];\n\t\tfor(int i=0; i<N; i++) {\n\t\t\tString s = sc.next();\n\t\t\tif(s.charAt(0) == 'M') {\n\t\t\t\tn[0]++;\n\t\t\t} else if(s.charAt(0) == 'A') {\n\t\t\t\tn[1]++;\n\t\t\t} else if(s.charAt(0) == 'R') {\n\t\t\t\tn[2]++;\n\t\t\t} else if(s.charAt(0) == 'C') {\n\t\t\t\tn[3]++;\n\t\t\t} else if(s.charAt(0) == 'H') {\n\t\t\t\tn[4]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong count = 0;\n\t\tfor(int i=0; i<5; i++) {\n\t\t\tint a = n[i];\n\t\t\tfor(int j = i+1; j<5; j++) {\n\t\t\t\tint b = n[j];\n\t\t\t\tfor(int k = j+1; k<5; k++) {\n\t\t\t\t\tint c = n[k];\n\t\t\t\t\tcount += 1L * a*b*c;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(count);\n\t\t\n\t\t\n\t\t\n\t}\n\n}\n", "from itertools import combinations as comb\nn = int(input())\nd = {'M':0,'A':0,'R':0,'C':0,'H':0}\nfor i in range(n):\n try:\n d[input()[0]] += 1\n except:\n continue\nc = 0\nl = d.values()\nfor i,j,k in comb(l,3):\n c += i*j*k\nprint(c)", "import java.util.*;class Main{public static void main(String[] args){Scanner c=new Scanner(System.in);long[] s=new long[5];int n=c.nextInt();int a;for(int i=0;i<n;i++){a=0;switch(c.next().charAt(0)){case 'M':a++;case 'A':a++;case 'R':a++;case 'C':a++;case 'H':s[a]++;}}long m=0;for(int i=0;i<3;i++)for(int j=i+1;j<4;j++)for(int k=j+1;k<5;k++)m+=s[i]*s[j]*s[k];System.out.println(m);}}", "import java.util.*;\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] cnt = new long[5];\n for(int i = 0; i<N; i++) {\n char c = sc.next().charAt(0);\n if(c=='M') cnt[0]++;\n if(c=='A') cnt[1]++;\n if(c=='R') cnt[2]++;\n if(c=='C') cnt[3]++;\n if(c=='H') cnt[4]++;\n }\n\n long sum = 0;\n for(int i = 0; i<3; i++) {\n for(int j = i+1; j<4; j++) {\n for(int k = j+1; k<5; k++) {\n sum += cnt[i]*cnt[j]*cnt[k];\n }\n }\n }\n System.out.println(sum);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n\nint main() {\n int n;\n int64_t cnt = 0;\n cin >> n;\n \n map<char,int64_t>mp;\n for (int i = 0; i < n; i++) {\n string s;\n cin >> s;\n char a = s.at(0);\n mp[a]++;\n }\n \n int64_t c = mp['M'];\n int64_t b = mp['A'];\n int64_t e = mp['R'];\n int64_t d = mp['C'];\n int64_t f = mp['H'];\n \n cnt += b*(c*d + c*e + c*f + d*e + d*f + e*f)+c*(d*e + d*f + e*f) + d*e*f;\n cout << cnt << endl;\n}", "from collections import Counter\nimport itertools\n\nN = int(input())\nS = [input()[0] for _ in range(N)]\n\nc = Counter(S)\nprint(sum(c[x]*c[y]*c[z] for x, y, z in itertools.combinations('MARCH', 3)))\n", "n = int(input())\nss = \"MARCH\"\nc = [0 for i in range(5)]\nfor i in range(n):\n\ts = input()\n\tfor j in range(5):\n\t\tif s[0] == ss[j]:\n\t\t\tc[j] += 1\nans = 0\nfor i in range(5):\n\tfor j in range(i+1,5):\n\t\tfor k in range(j+1,5):\n\t\t\tans += c[i]*c[j]*c[k]\nprint (ans)", "from itertools import*;d=[0]*91\nfor _ in[0]*int(input()):d[ord(input()[0])]+=1\nprint(sum(p*q*r for p,q,r in combinations([d[t]for t in[77,65,82,67,72]],3)))", "from itertools import*;d=[0]*91\nfor s in open(0).readlines():d[ord(s[0])]+=1\nprint(sum(d[p]*d[q]*d[r]for p,q,r in combinations(map(ord,'MARCH'),3)))", "import collections\nimport itertools\n\nN = int(input())\nS = [input() for _ in range(N)]\n\ncnt = collections.Counter()\nfor s in S:\n cnt[s[0]] += 1\n\nans = 0\nfor x, y, z in itertools.combinations(\"MARCH\", 3):\n ans += cnt[x] * cnt[y] * cnt[z]\nprint(ans)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n char[] initials = {'M', 'A', 'R', 'C', 'H'};\n int n = sc.nextInt();\n HashMap<Character, Long> map = new HashMap<>();\n for(int i = 0; i < n; i++) {\n String name = sc.next();\n char initial = name.charAt(0);\n if(initial == 'M' || initial == 'A' || initial == 'R' || initial == 'C' || initial == 'H') {\n map.put(initial, map.getOrDefault(initial, 0L) + 1);\n }\n }\n long count = 0;\n for(int i = 0; i < 3; i++) {\n for(int j = i + 1; j < 4; j++) {\n for(int k = j + 1; k < 5; k++) {\n count += (map.getOrDefault(initials[i], 0L) * map.getOrDefault(initials[j], 0L) * map.getOrDefault(initials[k], 0L));\n }\n }\n }\n System.out.println(count);\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\t\n\t\tlong[] MARCH = new long[5];\n\t\t\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\t String S = sc.next();\n\t\t\tif(S.charAt(0) == 'M') {\n\t\t\t\tMARCH[0]++;\n\t\t\t} else if(S.charAt(0) == 'A') {\n\t\t\t\tMARCH[1]++;\n\t\t\t} else if(S.charAt(0) == 'R') {\n\t\t\t\tMARCH[2]++;\n\t\t\t} else if(S.charAt(0) == 'C') {\n\t\t\t\tMARCH[3]++;\n\t\t\t} else if(S.charAt(0) == 'H') {\n\t\t\t\tMARCH[4]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong total = 0;\n\t\t\n\t\tfor(int i = 0; i < 3; i++) {\n\t\t\tfor(int j = i + 1; j < 4; j++) {\n\t\t\t\tfor(int k = j + 1; k < 5; k++) {\n\t\t\t\t\ttotal += MARCH[i] * MARCH[j] * MARCH[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(total);\n\t\t\n\t}\n}\n", "import java.io.*;\nimport java.util.*;\n \npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n String march = \"MARCH\";\n TreeMap<Character,Integer> mp = new TreeMap<Character, Integer>();\n for(int i = 0; i<5; i++){\n mp.put(march.charAt(i), 0); \n }\n for(int i = 1; i<=N; i++){\n String s = sc.next();\n mp.put(s.charAt(0), mp.containsKey(s.charAt(0)) ? mp.get(s.charAt(0))+1 : 1);\n }\n long ans = 0;\n for(int i = 0; i<5; i++){\n for(int j = i+1; j<5; j++){\n for(int k = j+1; k<5; k++){\n ans += 1L * mp.get(march.charAt(i)) * mp.get(march.charAt(j)) * mp.get(march.charAt(k));\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint N;\n\tlong M=0;\n\tlong A=0;\n\tlong R=0;\n\tlong C=0;\n\tlong H=0;\n\tcin >>N;\n\tfor (int i=0; i<N; i++) {\n\t\tstring S;\n\t\tcin >>S;\n\t\tchar s=S.at(0);\n\t\tif ('M'==s)\n\t\t\tM++;\n\t\telse if ('A'==s)\n\t\t\tA++;\n\t\telse if ('R'==s)\n\t\t\tR++;\n\t\telse if ('C'==s)\n\t\t\tC++;\n\t\telse if ('H'==s)\n\t\t\tH++;\n\t}\n\tlong SS=0;\n\tSS +=M*A*(R+C+H);\n\tSS +=M*R*(C+H);\n\tSS +=M*C*H;\n\tSS +=A*R*(C+H);\n\tSS +=A*C*H;\n\tSS +=R*C*H;\n\tcout << SS << endl;\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main(){\n \n int n;\n cin >> n;\n string s[100100];\n long m=0,a=0,r=0,c=0,h=0;\n for (int i=0; i<n; i++){\n \tcin >> s[i];\n if(s[i][0]=='M') m++;\n else if(s[i][0]=='A') a++;\n else if(s[i][0]=='R') r++;\n else if(s[i][0]=='C') c++;\n else if(s[i][0]=='H') h++;\n }\n \n long sum=0;\n \n sum= m*a*r+ m*a*c+ m*a*h+ m*r*c+ m*r*h+ m*c*h+ c*a*r+ h*a*r+ c*a*h+ c*h*r;\n \n cout << sum << endl;\n \n}", "import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main {\n\npublic static void main(String [] args){\n\n long N;\n long M =0,A =0,R =0,C =0,H =0;\n long count =0;\n String name;\n Scanner input = new Scanner(System.in);\n\n N = input.nextLong();\n\n for (long i=0; i<N; i++ ) {\n name = input.next();\n if (name.startsWith(\"M\",0) ==true) {\n M++;\n }else if (name.startsWith(\"A\",0) ==true) {\n A++;\n }else if (name.startsWith(\"R\",0) ==true) {\n R++;\n }else if (name.startsWith(\"C\",0) ==true) {\n C++;\n }else if (name.startsWith(\"H\",0) ==true) {\n H++;\n }\n }\n\n count = M*A*R + M*A*C + M*A*H + M*R*C + M*R*H + M*C*H + A*R*C +A*R*H +A*C*H + R*C*H;\n\n System.out.println(count);\n}\n}\n", "from itertools import combinations\nfrom collections import Counter\n\nN = int(input())\nS = Counter()\nfor _ in range(N):\n S[input()[0]] += 1\nprint(sum([S[a]*S[b]*S[c] for a, b, c in combinations('MARCH', 3)]))\n", "n = int(input())\nd = {'M':0,'A':0,'R':0,'C':0,'H':0}\nfor _ in range(n):\n s= input()\n if s[0] in d:\n d[s[0]] += 1\nmarch = list('MARCH')\nfrom itertools import combinations\n\nans = 0\nfor a,b,c in combinations(march,3):\n ans += d[a]*d[b]*d[c]\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\nint64_t N;\n cin>>N;\n vector<int64_t> A(5,0);\n for(int i=0;i<N;i++){\n string s;\n cin>>s;\n char x=s.at(0);\n if(x=='M') A.at(0)++;\n if(x=='A') A.at(1)++;\n if(x=='R') A.at(2)++;\n if(x=='C') A.at(3)++;\n if(x=='H') A.at(4)++;\n }int64_t ans=0;\n for(int i=0;i<3;i++){\n for(int j=i+1;j<4;j++){\n for(int k=j+1;k<5;k++)\n ans+=A.at(i)*A.at(j)*A.at(k);\n }\n \n }\n cout<<ans<<endl;\n \n return 0;\n}", "# include <iostream>\n# include <map>\nusing namespace std;\nconst int N=6;\nmap <char,int> a;\nlong long b[N];\nstring c;\nlong long s;\nint n;\nvoid work (void)\n{\n\tint i,j,k;\n\tfor (i=1;i<=3;i++)\n\tfor (j=i+1;j<=4;j++)\n\tfor (k=j+1;k<=5;k++)\n\ts+=b[i]*b[j]*b[k];\n\tcout<<s;\n}\nint main (void)\n{\n\tint i;\n\ta['A']=1;\n\ta['C']=2;\n\ta['H']=3;\n\ta['M']=4;\n\ta['R']=5;\n\tcin>>n;\n\tfor (i=1;i<=n;i++)\n\t{\n\t\tcin>>c;\n\t\tb[a[c[0]]]++;\n\t}\n\twork ();\n\treturn 0;\n}\n", "import java.util.ArrayList;\nimport java.util.Scanner;\n\nclass Main{\n\n\tpublic static void main(String[] args) {\n\n\n\n\n\t\tScanner scan = new Scanner(System.in);\n\t\tlong N = scan.nextInt();\n\t\tArrayList<String> namebox = new ArrayList<String>();\t\n\t\tlong[] judge = new long[5];\n\t\tfor(int i= 0;i < N;i++){\n\t\t\tString x = scan.next();\n\t\t\tnamebox.add(x);\n\t\t\tif(x.charAt(0) == 'M'){\n\t\t\t\tjudge[0]++;\n\t\t\t}else if(x.charAt(0) == 'A'){\n\t\t\t\tjudge[1]++;\n\t\t\t}else if(x.charAt(0) == 'R'){\n\t\t\t\tjudge[2]++;\n\t\t\t}else if(x.charAt(0) == 'C'){\n\t\t\t\tjudge[3]++;\n\t\t\t}else if(x.charAt(0) == 'H'){\n\t\t\t\tjudge[4]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans = (judge[0]*judge[1]*judge[2]) + (judge[0]*judge[1]*judge[3]) + (judge[0]*judge[1]*judge[4]) + (judge[0]*judge[2]*judge[3]) \n\t\t\t\t+ (judge[0]*judge[2]*judge[4]) + (judge[0]*judge[3]*judge[4]) + (judge[1]*judge[2]*judge[3]) + (judge[1]*judge[2]*judge[4])\n\t\t\t\t+ (judge[1]*judge[3]*judge[4]) + (judge[2]*judge[3]*judge[4]) ;\n\t\t\n\t\tSystem.out.println(ans);\n\n\t}\n\n\n\n\n\n\n}\n", "#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nsigned main(){\n int N; cin>>N;\n map<char,int> dic;\n for(int i=0;i<N;i++){\n string S; cin>>S;\n dic[S[0]]++;\n }\n int ans=0;\n ans+=dic['M']*dic['A']*(dic['R']+dic['C']+dic['H']);\n ans+=dic['M']*dic['R']*(dic['C']+dic['H']);\n ans+=dic['M']*dic['C']*dic['H'];\n ans+=dic['A']*dic['R']*(dic['C']+dic['H']);\n ans+=dic['C']*dic['H']*(dic['A']+dic['R']);\n cout<<ans<<endl;\n}", "#include<bits/stdc++.h>\n#define ll long long\nusing namespace std;\nstring s;\nll a[5],ans;\nint n;\nint main()\n{\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tcin>>s;\n\t\tswitch(s[0])\n\t\t{\n\t\t\tcase 'M':a[0]++;break;\n\t\t\tcase 'A':a[1]++;break;\n\t\t\tcase 'R':a[2]++;break;\n\t\t\tcase 'C':a[3]++;break;\n\t\t\tcase 'H':a[4]++;break;\n\t\t}\n\t}\n\tfor(int i=0;i<5;i++)\n\tfor(int j=i+1;j<5;j++)\n\tfor(int k=j+1;k<5;k++)\n\tans+=a[i]*a[j]*a[k];\n\tcout<<ans<<endl;\n\treturn 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n\n public static void main(String[] args) throws IOException\n {\n BufferedReader r = new BufferedReader(new InputStreamReader(System.in), 1);\n String s = r.readLine();\n int n = Integer.parseInt(s);\n\n long b[] = {0, 0, 0, 0, 0};\n\n for(int i = 0; i < n; i++)\n {\n s = r.readLine();\n char c = s.charAt(0);\n switch(c)\n {\n case 'M':\n b[0]++;\n break;\n case 'A':\n b[1]++;\n break;\n case 'R':\n b[2]++;\n break;\n case 'C':\n b[3]++;\n break;\n case 'H':\n b[4]++;\n break;\n }\n }\n\n long a = 0;\n\n for(int i = 0; i < 3; i++)\n for(int j = i + 1; j < 4; j++)\n for(int k = j + 1; k < 5; k++)\n {\n a += b[i] * b[j] * b[k];\n }\n\n System.out.println(a);\n\n }\n\n}\n", "\n\nimport java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tchar c = sc.next().charAt(0);\n\n\t\t\tint index = 0;\n\t\t\tswitch(c){\n\t\t\tcase 'M':\n\t\t\t\tindex = 0;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tindex = 1;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tindex = 2;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tindex = 3;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tindex = 4;\n\t\t\t\tbreak;\n\t\t\tdefault :\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tcount[index]++;\n\t\t}\n\n//\t\tfor(int i = 0; i < 5; i++){\n//\t\t\tSystem.out.println(count[i]);\n//\t\t}\n\n\t\tdfs(0, -1);\n\n\t\tSystem.out.println(result);\n\t}\n\n\tstatic int count[] = new int[5];\n\tstatic int index[] = new int[3];\n\tstatic long result = 0;\n\n\tstatic void dfs(int depth, int prevIndex){\n\t\tif(depth == 3){\n\t\t\tlong tmp = 1;\n\n\t\t\tfor(int i = 0; i < 3; i++){\n//\t\t\t\tSystem.out.print(index[i] + \" \");\n\t\t\t\ttmp *= count[index[i]];\n\t\t\t}\n//\t\t\tSystem.out.println(\"tmp \"+tmp);\n\n\t\t\tresult += tmp;\n\n\t\t\treturn;\n\t\t}\n\n\t\tfor(int i = prevIndex + 1; i < 5; i++){\n\t\t\tindex[depth] = i;\n\t\t\tdfs(depth + 1, i);\n\t\t}\n\t}\n\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N;\n cin>>N;\n long long int m=0,a=0,r=0,c=0,h=0;\n vector<string> S(N);\n for(int i=0;i<N;i++){\n cin>>S.at(i);\n switch (S.at(i).at(0)){\n case 'M':m++;break;\n case 'A':a++;break;\n case 'R':r++;break;\n case 'C':c++;break;\n case 'H':h++;break;\n default:break;\n }\n }\n cout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;\n \n \n \n}", "import java.math.BigDecimal;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n char[] a = {'M', 'A', 'R', 'C', 'H'};\n int[] count = new int[5];\n int n = sc.nextInt();\n for(int i=0; i<n; i++) {\n String name = sc.next();\n for(int j=0; j<5; j++) {\n if(name.charAt(0) == a[j]) {\n count[j]++;\n }\n }\n }\n BigDecimal res = new BigDecimal(\"0\");\n for(int i=0; i<5; i++) {\n for(int j=i+1; j<5; j++) {\n for(int k=j+1; k<5; k++){\n res = res.add(new BigDecimal((long)count[i] * count[j] * count[k]));\n }\n }\n }\n\n System.out.println(res.toPlainString());\n }\n\n}\n", "from itertools import*;print(sum(p*q*r for p,q,r in combinations(map(list(zip(*open(0).readlines()))[0].count,'MARCH'),3)))", "from itertools import combinations\nn = int(input())\ns = list(map(lambda s:s[0], [input() for _ in range(n)]))\nmarchn = [s.count(c) for c in list(\"MARCH\")]\nans = 0\nfor li in combinations(marchn, 3):\n ans += li[0] * li[1] * li[2]\nprint(ans)", "N = int(input())\nS = [input()[0] for i in range(N)]\nfrom collections import Counter\nctr = Counter(S)\n \nans = 0\nimport itertools\nfor ptn in itertools.combinations('MARCH', 3):\n a,b,c = ptn\n ans += ctr[a] * ctr[b] * ctr[c]\nprint(ans)", "import java.io.*;\npublic class Main {\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tlong[] counts = new long[5];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tswitch (br.readLine().charAt(0)) {\n\t\t\t\tcase 'M' :\n\t\t\t\tcounts[0]++;\n\t\t\t\tbreak;\n\t\t\t\tcase 'A' :\n\t\t\t\tcounts[1]++;\n\t\t\t\tbreak;\n\t\t\t\tcase 'R' :\n\t\t\t\tcounts[2]++;\n\t\t\t\tbreak;\n\t\t\t\tcase 'C' :\n\t\t\t\tcounts[3]++;\n\t\t\t\tbreak;\n\t\t\t\tcase 'H' :\n\t\t\t\tcounts[4]++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tlong count = 0;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tcount += counts[i] * counts[j] * counts[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}\n", "from itertools import combinations\nfrom collections import Counter\nn = int(input())\nC = Counter()\nfor i in range(n):\n C[input()[0]] +=1\n\n\nprint(sum(C[a]*C[b]*C[c] for a,b,c in combinations('MARCH',3)\n))", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n \tScanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n for(int i = 0;i < n;i++){\n \tString fi = sc.next().substring(0,1);\n if(fi.equals(\"M\"))m++;\n else if(fi.equals(\"A\"))a++;\n else if(fi.equals(\"R\"))r++;\n else if(fi.equals(\"C\"))c++;\n else if(fi.equals(\"H\"))h++;\n }\n long sum = m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;\n System.out.println(sum);\n }\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n \n while (n-- > 0) {\n char chr = sc.next().charAt(0);\n \n switch (chr) {\n case 'M':\n m++;\n break;\n case 'A':\n a++;\n break;\n case 'R':\n r++;\n break;\n case 'C':\n c++;\n break;\n case 'H':\n h++;\n break;\n }\n }\n \n long count = 0;\n count += m * a * r;\n count += m * a * c;\n count += m * a * h;\n count += m * r * c;\n count += m * r * h;\n count += m * c * h;\n count += a * r * c;\n count += a * r * h;\n count += a * c * h;\n count += r * c * h;\n \n System.out.println(count);\n }\n}\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) {Main instance = new Main();sc = instance.new Scanner();instance.solve();}\n private class Scanner {String[] s = new String[0];String regex = \" \";int i = 0;BufferedReader br = new BufferedReader(new InputStreamReader(System.in));public String next() {try {if (i < s.length) { return s[i++];}String st = br.readLine();while (\"\".equals(st)) { st = br.readLine(); }s = st.split(regex, 0);i = 0;return s[i++];} catch (IOException e) { return null; }}public int nextInt(){return Integer.parseInt(next());}} \n private static Scanner sc;\n\n private void solve() {\n int N = sc.nextInt();\n long M = 0, A = 0, R = 0, C = 0, H = 0;\n for (int i = 0; i < N; i++) {\n switch(sc.next().charAt(0)){\n case 'M': M++; break;\n case 'A': A++; break;\n case 'R': R++; break;\n case 'C': C++; break;\n case 'H': H++; break;\n }\n }\n System.out.println(\n M*A*R + M*A*C + M*A*H + M*R*C + M*R*H + M*C*H +\n A*R*C + A*R*H + A*C*H +\n R*C*H \n );\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner in = new Scanner(System.in)) {\n int N = in.nextInt();\n String[] S = new String[N];\n for (int i = 0; i < N; i++) {\n S[i] = in.next();\n }\n\n int[] MARCH = new int[5];\n for (int i = 0; i < N; i++) {\n int index = index(S[i].substring(0, 1));\n if (index < 0) {\n continue;\n }\n MARCH[index]++;\n }\n\n long sum = 0;\n for (int mask = 0; mask < (1 << 5); mask++) {\n if (Integer.bitCount(mask) != 3) {\n continue;\n }\n long count = 1;\n for (int i = 0; i < 5; i++) {\n if ((mask & (1 << i)) == 0) {\n continue;\n }\n count *= MARCH[i];\n }\n sum += count;\n }\n\n System.out.println(sum);\n }\n }\n\n private static int index(String s) {\n return \"MARCH\".indexOf(s);\n }\n}\n", "from itertools import combinations as cmbs\nimport sys\nc = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nsys.stdin.readline()\nfor si in sys.stdin:\n if si[0] in c:\n c[si[0]] += 1\nans = sum(i*j*k for i,j,k in cmbs(c.values(),r=3))\nprint(ans)\n", "import java.util.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tC(sc);\n\t}\n\t\n\tpublic static void A(Scanner sc) {\n\t\tout.println(sc.nextInt()/3);\n\t}\n\t\n\tpublic static void B(Scanner sc) {\n\t\tint n = sc.nextInt();\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(sc.next().charAt(0)=='Y') {\n\t\t\t\tout.println(\"Four\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tout.println(\"Three\");\n\t}\n\t\n\tpublic static void C(Scanner sc) {\n\t\tHashMap<Character, Integer> map = new HashMap<Character, Integer>();\n\t\tint N = sc.nextInt();\n\t\tfor(int i=0;i<N;i++) {\n\t\t\tchar c = sc.next().charAt(0);\n\t\t\tif(map.containsKey(c)) map.put(c,map.get(c)+1);\n\t\t\telse map.put(c,1);\n\t\t}\n\t\tArrayList<Integer> arr = new ArrayList<Integer>();\n\n\t\tHashSet<Character> lis = new HashSet<Character>(Arrays.asList('M','A','R','C','H'));\n\t\tfor(Character c : map.keySet()) {\n\t\t\tif(lis.contains(c)) {\n\t\t\t\tarr.add(map.get(c));\n\t\t\t}\n\t\t}\n\t\tout.println(retksum(arr.toArray(new Integer[arr.size()]),0,3));\n\t}\n\t// arrからidx以降からk個選んで、掛け合わせる。全ての組み合わせに対して和\n\tpublic static long retksum(Integer[] arr, int idx, int k) {\n\t\tif(k==0) return 1;\n\t\tif(arr.length-idx<k) return 0;\n\t\treturn arr[idx]*retksum(arr, idx+1, k-1) + retksum(arr,idx+1,k);\n\t}\n}", "from itertools import combinations\ndef main():\n s = [i[0] for i in open(0).read().split()[1:]]\n c = (s.count(\"M\"),s.count(\"A\"),s.count(\"R\"),s.count(\"C\"),s.count(\"H\"))\n a = sum(x*y*z for x, y, z in combinations(c, 3))\n print(a)\nmain()", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n long m[5]={0,0,0,0,0};\n long sum=0;\n for(int i=0;i<N;i++){\n string S;\n cin >> S;\n if(S[0]=='M')m[0]+=1;\n else if(S[0]=='A')m[1]+=1;\n else if(S[0]=='R')m[2]+=1;\n else if(S[0]=='C')m[3]+=1;\n else if(S[0]=='H')m[4]+=1;\n }\n for(int i=0;i<5;i++){\n for(int j=0;j<i;j++){\n for(int k=0;k<j;k++){\n sum+=m[i]*m[j]*m[k];\n }\n }\n }\n cout << sum;\n}\n\n", "from itertools import combinations\n\nN = int(input())\nd = {'M': 0, 'A': 0, 'R': 0, 'C': 0, 'H': 0}\nfor _ in range(N):\n s = input()[0]\n if s in 'MARCH':\n d[s] += 1\nans = 0\nfor a, b, c in combinations(d.values(), 3):\n ans += a * b * c\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main(){\n int n;\n cin >> n;\n string t = \"MARCH\";\n int cnt[5] = {};\n for(int i = 0; i < n ; i++ ){\n string s;\n cin >> s;\n for(int j = 0 ; j < 5 ; j++ )if(s[0] == t[j])cnt[j]++;\n }\n int ans=0;\n for(int i=0;i<5;i++)\n for(int j=i+1;j<5;j++)\n for(int k=j+1;k<5;k++)\n\tans+=cnt[i]*cnt[j]*cnt[k];\n cout<<ans<<endl;\n return 0;\n}\n", "import itertools\nn = int(input())\narr = [input()[0] for i in range(n)]\nword = ['M','A','R','C','H']\nans = 0\ncon = list(itertools.combinations(word,3))\nfor i in con:\n ans += arr.count(i[0]) * arr.count(i[1]) * arr.count(i[2])\nprint(ans)", "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tMap<Character, Set<String>> map = new HashMap<>();\n\t\tfor(int i =0; i < n; i++) {\n\t\t\tString s = sc.next();\n\t\t\tif(!s.matches(\"^[MARCH].*\")) continue;\n\t\t\tchar c = s.charAt(0);\n\t\t\tif(!map.containsKey(c)) map.put(c, new HashSet<String>());\n\t\t\tmap.get(c).add(s);\n\t\t}\n\t\tif(map.size() < 3) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tList<Set<String>> list = new ArrayList<>(map.values());\n\t\tlong sum = 0;\n\t\tfor(int i = 0;i < list.size(); i++){\n\t\t\tfor(int j = i+1; j < list.size(); j++){\n\t\t\t\tfor(int k = j+1; k < list.size(); k++){\n\t\t\t\t\tlong l = (long)list.get(i).size() * (long)list.get(j).size() * (long)list.get(k).size();\n\t\t\t\t\tsum += l;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sum);\n\n\t}\n}\n", "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n sc.nextLine();\n long[] march = new long[5];\n \n String l;\n int i;\n while(n-- > 0){\n l = sc.nextLine();\n i = getInd(l.charAt(0));\n if(i != -1){\n march[i]++;\n }\n }\n \n \n long res = 0;\n for(i = 0; i < 3; i++){\n for(int j = i+1; j < 4; j++){\n for(int k = j+1; k < 5; k++)\n res += march[i]* march[j]*march[k];\n }\n }\n \n System.out.println(res);\n }\n private static int getInd(char c){\n if(c == 'M')\n return 0;\n else if(c == 'A')\n return 1;\n else if(c == 'R')\n return 2;\n else if(c == 'C')\n return 3;\n else if(c == 'H')\n return 4;\n return -1;\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[5];//m a r c h\n\t\tString str;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tstr = sc.next();\n\t\t\tif (str.startsWith(\"M\")) {\n\t\t\t\ta[0]++;\n\t\t\t} else if (str.startsWith(\"A\")) {\n\t\t\t\ta[1]++;\n\t\t\t} else if (str.startsWith(\"R\")) {\n\t\t\t\ta[2]++;\n\t\t\t} else if (str.startsWith(\"C\")) {\n\t\t\t\ta[3]++;\n\t\t\t} else if (str.startsWith(\"H\")) {\n\t\t\t\ta[4]++;\n\t\t\t}\n\t\t}\n\t\tlong sum = 0;\n\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tsum += a[i] * a[j] * a[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n}\n", "import java.util.Scanner;\n\n/**\n * Created by Santa on 2016/10/16.\n */\npublic class Main {\n\n static class pair {\n public int a;\n public int b;\n\n pair(){\n this.a = 0;\n this.b = 0;\n }\n\n pair(int a, int b){\n this.a = a;\n this.b = b;\n }\n\n public void set(int a, int b) {\n this.a = a;\n this.b = b;\n }\n }\n\n public static void main(String[] args){\n Scanner scanner = new Scanner(System.in);\n\n int N = scanner.nextInt();\n long[] map = new long[5];\n\n for (int i = 0; i < N; i++) {\n String s = scanner.next();\n\n if(s.charAt(0) == 'M')map[0]++;\n if(s.charAt(0) == 'A')map[1]++;\n if(s.charAt(0) == 'R')map[2]++;\n if(s.charAt(0) == 'C')map[3]++;\n if(s.charAt(0) == 'H')map[4]++;\n }\n\n long ans = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i + 1; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += map[i] * map[j] * map[k];\n }\n }\n }\n\n System.out.println(ans);\n }\n\n\n\n}\n\n\n", "n=int(input())\ns=[input() for _ in [0]*n]\nmarch=[0]*5\nfor x in s:\n if x[0] in 'MARCH':\n march['MARCH'.index(x[0])]+=1\nans=0\nfor i in range(5):\n for j in range(i+1,5):\n for k in range(j+1,5):\n ans+=march[i]*march[j]*march[k]\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint mark[30], n;\nstring s;\nchar ch[5] = {'M', 'A', 'R', 'C', 'H'};\nlong long ans;\n\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(0);cout.tie(0);\n\t\n\tcin >> n;\n\tfor (int i = 0; i < n; i++){\n\t\tcin >> s;\n\t\tmark[s[0] - 'A']++;\n\t}\t\n\tfor (int i = 0; i < 5; i++)\n\t\tfor (int j = i + 1; j < 5; j++)\n\t\t\tfor (int k = j + 1; k < 5; k++)\n\t\t\t\tans += (1LL * mark[ch[k] - 'A'] * mark[ch[j] - 'A'] * mark[ch[i] - 'A']);\n\tcout << ans;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t// 要素の入力、格納\n\t\tint N = sc.nextInt();\n\t\tlong m = 0;\n\t\tlong a = 0;\n\t\tlong r = 0;\n\t\tlong c = 0;\n\t\tlong h = 0;\n\t\tString head = \"\";\n\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\thead = sc.next().substring(0, 1);\n\t\t\tif (head.equals(\"M\")) {\n\t\t\t\tm++;\n\t\t\t} else if (head.equals(\"A\")) {\n\t\t\t\ta++;\n\t\t\t} else if (head.equals(\"R\")) {\n\t\t\t\tr++;\n\t\t\t} else if (head.equals(\"C\")) {\n\t\t\t\tc++;\n\t\t\t} else if (head.equals(\"H\")) {\n\t\t\t\th++;\n\t\t\t}\n\t\t}\n\n\t\tlong ans = m * a * r + m * a * c + m * a * h + m * r * c + m * r * h + m * c * h + a * r * c + a * r * h\n\t\t\t\t+ a * c * h + r * c * h;\n\n\t\t// 出力\n\t\tSystem.out.println(ans);\n\t}\n}\n", "from itertools import*\nN,*S=open(0)\nprint(sum(a*b*c for a,b,c in combinations([sum(1 for s in S if s[0]==c) for c in \"MARCH\"],3)))", "n=int(input())\ns=[input()[0] for _ in [0]*n]\nl=['M','A','R','C','H']\nL=[s.count(x) for x in l]\na=0\nfor i in range(3):\n for j in range(i+1,4):\n for k in range(j+1,5):\n a+=L[i]*L[j]*L[k]\nprint(a)", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll n,ans;\n cin >> n;\n ll m = 0,a = 0,r = 0,c = 0,h = 0;\n for(int i = 0;i < n;i++){\n string s;\n cin >> s;\n if(s[0] == 'M') m++;\n if(s[0] == 'A') a++;\n if(s[0] == 'R') r++;\n if(s[0] == 'C') c++;\n if(s[0] == 'H') h++;\n }\n ans = m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;\n cout << ans << endl;\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] record = new long[26];\n for(int i=0;i<N;i++){\n String cur = sc.next();\n char initial = cur.charAt(0);\n record[initial-'A'] += 1;\n }\n long[] med = new long[5];\n med[0] = record[0];\n med[1] = record['C'-'A'];\n med[2] = record['H'-'A'];\n med[3] = record['M'-'A'];\n med[4] = record['R'-'A'];\n long ans = 0;\n ans += med[0]*med[1]*med[2];\n ans += med[0]*med[1]*med[3];\n ans += med[0]*med[1]*med[4];\n ans += med[0]*med[2]*med[3];\n ans += med[0]*med[2]*med[4];\n ans += med[0]*med[3]*med[4];\n ans += med[1]*med[2]*med[3];\n ans += med[1]*med[2]*med[4];\n ans += med[1]*med[3]*med[4];\n ans += med[2]*med[3]*med[4];\n System.out.println(ans);\n\n\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n String s[] = new String[n];\n long M = 0;\n long A = 0;\n long R = 0;\n long C = 0;\n long H = 0;\n for (int i = 0; i < n; i++) {\n s[i] = sc.next();\n char c = s[i].charAt(0);\n if (c == 'M') {\n M++;\n } else if (c == 'A') {\n A++;\n } else if (c == 'R') {\n R++;\n } else if (c == 'C') {\n C++;\n } else if (c == 'H') {\n H++;\n }\n }\n long ans = 0;\n long MA = M * A;\n ans += MA * R;\n ans += MA * C;\n ans += MA * H;\n long MR = M * R;\n ans += MR * C;\n ans += MR * H;\n ans += M * C * H;\n long AR = A * R;\n ans += AR * C;\n ans += AR * H;\n ans += A * C * H;\n ans += R * C * H;\n System.out.println(ans);\n\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N;\n cin>>N;\n vector<string> S(N);\n int64_t M=0,A=0,R=0,C=0,H=0;\n for(int i=0;i<N;++i){\n cin>>S.at(i); \n if(S.at(i).at(0)=='M'){++M;}\n if(S.at(i).at(0)=='A'){++A;}\n if(S.at(i).at(0)=='R'){++R;}\n if(S.at(i).at(0)=='C'){++C;}\n if(S.at(i).at(0)=='H'){++H;}\n }\n\n int64_t sum=M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H;\n cout<<sum<<endl;\n}", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tString s[] = new String[n];\n\t\tlong m = 0;\n\t\tlong a = 0;\n\t\tlong r = 0;\n\t\tlong c = 0;\n\t\tlong h = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ts[i] = scan.next();\n\t\t\tchar head = s[i].charAt(0);\n\t\t\tif (head == 'M') {\n\t\t\t\tm++;\n\t\t\t} else if (head == 'A') {\n\t\t\t\ta++;\n\t\t\t} else if (head == 'R') {\n\t\t\t\tr++;\n\t\t\t} else if (head == 'C') {\n\t\t\t\tc++;\n\t\t\t} else if (head == 'H') {\n\t\t\t\th++;\n\t\t\t}\n\t\t}\n\t\tlong sum = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n\t\tSystem.out.println(sum);\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nstring z;\nint M,A,R,C,H;\nint main(){\n while(cin>>z){\n if(z[0]=='M')M++;\n if(z[0]=='A')A++;\n if(z[0]=='R')R++;\n if(z[0]=='C')C++;\n if(z[0]=='H')H++;\n }\n long long int a=C+H,b=A+R,c=A*R,d=C*H;\n cout<<c*(M+a)+d*(M+b)+(M*a*b)<<endl;\n}\n", "#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\ntypedef long long int ll;\nint main(){\n ll n,m=0,a=0,r=0,c=0,h=0;\n cin >>n;\n string s;\n for(ll i=0;i<n;i++) {\n cin >>s;\n if(s[0]=='M') m++;\n if(s[0]=='A') a++;\n if(s[0]=='R') r++;\n if(s[0]=='C') c++;\n if(s[0]=='H') h++;\n }\ncout <<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.nextLine());\n long[] d = {0, 0, 0, 0, 0};\n for (int i = 0; i < n; i++) {\n String name = sc.nextLine();\n if (name.charAt(0) == 'M') {\n d[0]++;\n } else if (name.charAt(0) == 'A') {\n d[1]++;\n } else if (name.charAt(0) == 'R') {\n d[2]++;\n } else if (name.charAt(0) == 'C') {\n d[3]++;\n } else if (name.charAt(0) == 'H') {\n d[4]++;\n }\n }\n sc.close();\n\n long p = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = i+1; j < 4; j++) {\n for (int k = j+1; k < 5; k++) {\n if (d[i] * d[j] * d[k] > 0) {\n p += d[i] * d[j] * d[k];\n }\n }\n }\n }\n System.out.println(p);\n }\n}\n", "#include <iostream>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define REP(i,k,n) for(int i=k;i<n;i++)\nusing namespace std;\nint main(){\n int N;\n long long ans = 0;\n cin >> N;\n int C[6]={};\n string dict = \"MARCH\";\n rep(i,N){\n string S;\n cin >> S;\n C[dict.find(S[0])+1]++;\n }\n REP(i,1,4){\n REP(j,i+1,5){\n REP(k,j+1,6){\n ans += (long long)C[i]*C[j]*C[k];\n }\n }\n }\n cout << ans << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main()\n{\n\tll n;\n\tcin >> n;\n\tll cnt[5]={};\n\twhile(n--)\n\t{\n\t\tstring x;\n\t\tcin >> x;\n\t\tif(x[0]=='M')cnt[0]++;\n\t\telse if(x[0]=='R')cnt[1]++;\n\t\telse if(x[0]=='A')cnt[2]++;\n\t\telse if(x[0]=='C')cnt[3]++;\n\t\telse if(x[0]=='H')cnt[4]++;\n\t}\n\tll ans = 0;\n\tfor(ll i = 0;i<5;i++)\n\t{\n\t\tfor(ll j = i+1;j<5;j++)\n\t\t{\n\t\t\tfor(ll k = j+1;k<5;k++)\n\t\t\t{\n\t\t\t\tans += cnt[i]*cnt[j]*cnt[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\nlong long h[5],n,i,j,k,num;\nint main()\n{\n\tstring s;\n\tcin>>n;\n\tfor (i=0;i<n;i++)\n\t{\n\t\tcin>>s;\n\t\tif(s[0]=='M') h[0]++;\n\t\tif(s[0]=='A') h[1]++;\n\t\tif(s[0]=='R') h[2]++;\n\t\tif(s[0]=='C') h[3]++;\n\t\tif(s[0]=='H') h[4]++;\n\t}\n\tfor (i=0;i<3;i++)\n\t\tfor (j=i+1;j<4;j++)\n\t\t\tfor (k=j+1;k<5;k++)\n\t\t\t\tnum+=h[i]*h[j]*h[k];\n\tcout<<num;\n\treturn 0; \n}", "from collections import Counter\nfrom itertools import combinations\n\nN = int(raw_input())\nc = Counter(raw_input()[0] for _ in range(N))\n\nans = 0\nfor (l1, l2, l3) in combinations(\"MARCH\", 3):\n ans += c[l1] * c[l2] * c[l3]\n\nprint(ans)", "N=int(input())\nS=[input()[0] for _ in range(N)]\nC=[S.count(c) for c in \"MARCH\"]\nprint(C[0]*C[1]*C[2]+C[0]*C[1]*C[3]+C[0]*C[1]*C[4]+C[0]*C[2]*C[3]+C[0]*C[2]*C[4]+C[0]*C[3]*C[4]+C[1]*C[2]*C[3]+C[1]*C[2]*C[4]+C[1]*C[3]*C[4]+C[2]*C[3]*C[4])\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long n,M=0,A=0,R=0,C=0,H=0; cin >> n;\n vector<string> s(n);\n for(int i=0;i<n;i++){\n cin >> s[i];\n if(s[i][0]=='M'){\n M++;\n }\n if(s[i][0]=='A'){\n A++;\n }\n if(s[i][0]=='R'){\n R++;\n }\n if(s[i][0]=='C'){\n C++;\n }\n if(s[i][0]=='H'){\n H++;\n }\n }\n long long ans=M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H;\n cout << ans << endl;\n\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint n;string s;map<char,long>d;\nint main(){\n cin>>n;\n while(n--)cin>>s,d[s[0]]++;\n long m=d['M'],a=d['A'],r=d['R'],c=d['C'],h=d['H'];\n cout<<m*a*(r+c+h)+(m+a+r)*c*h+(m+a)*r*(c+h);\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long cnt=0,n,d[5];\n cin >> n;\n int c[26]={};\n for(int i=0;i<n;i++){\n string s;\n cin >> s;\n c[s.at(0)-65]++;\n }\n d[0]=c[0];\n d[1]=c[2];\n d[2]=c[7];\n d[3]=c[12];\n d[4]=c[17];\n for(int i=0;i<5;i++){\n for(int j=i+1;j<5;j++){\n for(int k=j+1;k<5;k++){\n cnt += d[i]*d[j]*d[k];\n }\n }\n }\n cout << cnt << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nlong long ans;\nint a[5];\nstring m = \"MARCH\";\n\nint main(){\n//\tcin.tie(0);\n//\tios::sync_with_stdio(false);\n\tcin >> n;\n\tfor(int i=0; i<n; ++i){\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor(int j=0; j<5; ++j)\n\t\t\tif(m[j] == s[0])\n\t\t\t\t++a[j];\n\t}\n\tfor(int i=0; i<3; ++i)\n\t\tfor(int j=i+1; j<4; ++j)\n\t\t\tfor(int k=j+1; k<5; ++k)\n\t\t\t\tans += (long long)a[i] * a[j] * a[k];\n\tcout << ans << \"\\n\";\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n vector<char> x={'M','A','R','C','H'};\n vector<int64_t> c(x.size(),0);\n for(int i=0;i<n;i++){\n string s;\n cin>>s;\n for(int j=0;j<x.size();j++)\n if(s.at(0)==x.at(j))\n c.at(j)++;\n }\n int64_t a=0;\n for(int i=0;i<c.size();i++)\n for(int j=i+1;j<c.size();j++)\n for(int k=j+1;k<c.size();k++)\n a+=c.at(i)*c.at(j)*c.at(k);\n cout<<a<<endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\nint N;\nscanf(\"%d\",&N);\nvector<long long> A(5);\nchar c[5] = {'M','A','R','C','H'};\nfor(int i=0; i<N; i++){\n\tchar name[100];\n\tscanf(\"%s\",name);\n\tfor(int j=0; j<5;j++){\n\t\tif(name[0]==c[j]){\n\t\t\tA[j]++;\n\t\t\tbreak;\n\t\t}\n\t}\n}\nlong long ans = A[0]*A[1]*(A[2]+A[3]+A[4])+(A[0]+A[1])*A[2]*(A[3]+A[4])+(A[0]+A[1]+A[2])*A[3]*A[4];\nprintf(\"%lld\\n\", ans);\nreturn 0;\n}\n", "from collections import Counter\nimport itertools\n\nn = int(input())\ns = [input()[0] for _ in range(n)]\n\ncnt = Counter(s)\nans = 0\nfor x, y, z in itertools.combinations(\"MARCH\", 3):\n ans += cnt[x] * cnt[y] * cnt[z]\nprint(ans)", "#include<cstdio>\n\nint main(){\n\tunsigned N;\n\tscanf(\"%u\\n\", &N);\n\tunsigned long long a=0, b=0, c=0, d=0, e=0;\n\tfor (unsigned i = 0; i < N; ++i)\t{\n\t\tchar tmp[15];\n\t\tscanf(\"%s\", tmp);\n\t\tif(tmp[0] == 'M') a++;\n\t\tif(tmp[0] == 'A') b++;\n\t\tif(tmp[0] == 'R') c++;\n\t\tif(tmp[0] == 'C') d++;\n\t\tif(tmp[0] == 'H') e++;\n\t}\n\tunsigned long long answer = a*(b*(c+d+e)+c*(d+e)+d*e)+b*(c*(d+e)+d*e)+c*d*e;\n\tprintf(\"%llu\\n\", answer);\n\treturn 0;\n}", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n\n int name[] = new int [5];\n Arrays.fill(name, 0);\n for (int i = 0; i < n; i++) {\n String s = in.next();\n if (s.charAt(0) == 'M') name[0]++;\n if (s.charAt(0) == 'A') name[1]++;\n if (s.charAt(0) == 'R') name[2]++;\n if (s.charAt(0) == 'C') name[3]++;\n if (s.charAt(0) == 'H') name[4]++;\n }\n\n long total = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 4; j++) {\n for (int k = j + 1; k < 5; k++) {\n total += (long)name[i] * name[j] * name[k];\n }\n }\n }\n\n System.out.println(total);\n }\n}", "#include <iostream>\n#include <cstdio>\nusing namespace std;\nlong long n, s, c[9], v[99];\nchar a[15];\nint main() {\n\tint i, j, k;\n\tcin>>n;\n\twhile(n--) {\n\t\tscanf(\"%s\", a);\n\t\tv[a[0]]++;\n\t}\n\tc[0] = v['M'];\n\tc[1] = v['A'];\n\tc[2] = v['R'];\n\tc[3] = v['C'];\n\tc[4] = v['H'];\n\tfor(i=0; i<5; i++) for(j=i+1; j<5; j++) for(k=j+1; k<5; k++) {\n\t\ts += c[i] * c[j] * c[k];\n\t}\n\tcout<<s;\n\treturn 0;\n}", "// C - March\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstring T{\"MARCH\"};\nvector<int>\nA{0,0,0,0,0,0,1,1,1,2},\nB{1,1,1,2,2,3,2,2,3,3},\nC{2,3,4,3,4,4,3,4,4,4};\n\nint main(){\n\tint N; cin>>N;\n\n\tmap<char,ll> S; for(auto c:T) S[c] = 0;\n\n\twhile(N--){\n\t\tstring s; cin>>s;\n\t\tfor(auto c:T) if(s[0]==c) S[c]++;\n\t}\n\n\tll ans = 0;\n\tfor(int i=0; i<10; ++i)\n\t\tans += S[T[A[i]]] * S[T[B[i]]] * S[T[C[i]]];\n\tcout<< ans <<endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nchar P[100001][110];\nint main()\n{\n\tlong long int N,M=0,A=0,R=0,C=0,H=0;\n\tscanf(\"%lld\",&N);\n\tfor(int i=0;i<N;i++)\n\t {\n\t \tscanf(\"%s\",P[i]);\n\t \tif(P[i][0]=='M') M++;\n\t \tif(P[i][0]=='A') A++;\n\t \tif(P[i][0]=='R') R++;\n\t \tif(P[i][0]=='C') C++;\n\t \tif(P[i][0]=='H') H++;\n\t\t}\n\tlong long int sum=0;\n\tsum=(M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+R*C*H+A*C*H);\n\tprintf(\"%lld\\n\",sum);\n\treturn 0;\n } \n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); i++) \n#define all(v) begin(v),end(v)\nusing ll = long long;\n\nint main() {\n int n;cin>>n;\n vector<string> s(n);\n rep(i,n)cin>>s[i];\n string t=\"MARCH\";\n vector<ll> cnt(5);\n rep(i,n){\n rep(j,5){\n if(t[j]==s[i][0])cnt[j]++;\n }\n }\n ll ans=0;\n rep(i,5)for(int j=i+1;j<5;j++)for(int k=j+1;k<5;k++){\n ans+=cnt[i]*cnt[j]*cnt[k];\n }\n cout<<ans<<endl;\n}", "from itertools import combinations\n\nn = int(input())\nD = {\"M\": 0, \"A\": 0, \"R\": 0, \"C\": 0, \"H\": 0}\nfor _ in range(n):\n s = input()[0]\n if s in D:\n D[s] += 1\nprint(sum([i * j * k for i, j, k in combinations(D.values(), 3)]))\n", "#include <iostream>\n#include <map>\nusing namespace std;\n\nint main() {\n\tint N;\n\tchar Heads[5] = { 'M','A','R','C','H' };\n\tcin >> N;\n\tmap<char, int>Nums;\n\tfor (int i = 0; i < N; i++) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tNums[s[0]]++;\n\t}\n\tlong long ans = 0;\n\tfor (int i = 0; i < 5; i++) {\n\t\tfor (int j = i + 1; j < 5; j++) {\n\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\tans += (long long)Nums[Heads[i]] * Nums[Heads[j]] * Nums[Heads[k]];\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n}\n", "n,*s=map(str,open(0).read().split())\na=[0]*5\nans=0\nfor i in s:\n if i[0] in \"MARCH\":\n a[\"MARCH\".index(i[0])]+=1\nfor i in range(3):\n for j in range(i+1,4):\n for k in range(j+1,5):\n ans+=a[i]*a[j]*a[k]\nprint(ans)", "N=int(input())\nA=\"\"\nfor i in range(N):\n k=input()\n A+=k[0]\nm=A.count(\"M\")\na=A.count(\"A\")\nr=A.count(\"R\")\nc=A.count(\"C\")\nh=A.count(\"H\")\nprint(m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h)", "import java.util.*;\n\nclass Main{\n\t\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint N = sc.nextInt();\n\t\t\n\t\t\n\t\tlong M = 0L;\n\t\tlong A = 0L;\n\t\tlong R = 0L;\n\t\tlong C = 0L;\n\t\tlong H = 0L;\n\t\t\n\t\tchar initial ;\n\t\tfor(int i = 0 ; i < N ; i ++){\n\t\t\tinitial = sc.next().charAt(0);\n\t\t\tswitch(initial){\n\t\t\tcase 'M':\n\t\t\t\tM = M + 1L;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tA = A + 1L;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tR = R + 1L;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tC = C + 1L;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tH = H + 1L;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong total = M * A * R \n\t\t + M * A * C \n\t\t + M * A * H \n\t\t + M * R * C \n\t\t + M * R * H\n\t\t + M * C * H\n\t\t + A * R * C \n\t\t + A * R * H \n\t\t + A * C * H\n\t\t + R * C * H;\n\t\t\n\t\tSystem.out.println( total);\n\t}\n}\n", "from collections import defaultdict\nimport itertools\nN=int(input())\nd=defaultdict(int)\n\nfor i in range(N):\n d[input()[0]]+=1\nans=0\nfor A,B,C in itertools.combinations(\"MARCH\",3):\n ans+=d[A]*d[B]*d[C]\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define ll long long\nint main(){\n ll N;\n cin>>N;\n string A[N+1];\n string M=\"MARCH\";\n ll X[6]={0};\n rep(i,N){\n cin>>A[i];\n rep(j,5) if(A[i][0]==M[j]) X[j]++;\n }\n ll ans=0;\n rep(i,3) rep(j,3-i) rep(k,3-i-j) ans+=X[i]*X[i+j+1]*X[i+j+k+2];\n cout<<ans<<endl;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n int[] P ={0 ,0 ,0 ,0 ,0 ,0 ,1 ,1 ,1 ,2};\n int[] Q ={1 ,1 ,1 ,2 ,2 ,3 ,2 ,2 ,3 ,3};\n int[] R ={2 ,3 ,4 ,3 ,4 ,4 ,3 ,4 ,4 ,4};\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] D = new long[5];\n for (int i = 0; i < N; i++) {\n String name = sc.next();\n if (name.charAt(0) == 'M') D[0]++;\n if (name.charAt(0) == 'A') D[1]++;\n if (name.charAt(0) == 'R') D[2]++;\n if (name.charAt(0) == 'C') D[3]++;\n if (name.charAt(0) == 'H') D[4]++;\n }\n long res = 0;\n for (int d = 0; d < 10; d++) {\n res += D[P[d]] * D[Q[d]] * D[R[d]];\n }\n\n System.out.println(res);\n }\n}\n", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tString s[] = new String[N];\n\t\tlong m = 0;\n\t\tlong a = 0;\n\t\tlong r = 0;\n\t\tlong c = 0;\n\t\tlong h = 0;\n\t\tfor(int i=0; i<N; i++){\n\t\t\ts[i] = sc.next();\n\t\t\tchar head = s[i].charAt(0);\n\t\t\tif(head=='M')m++;\n\t\t\telse if(head=='A')a++;\n\t\t\telse if(head=='R')r++;\n\t\t\telse if(head=='C')c++;\n\t\t\telse if(head=='H')h++;\n\t\t}\n\t\tlong total = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n\t\tSystem.out.println(total);\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nlong long n,m,a,r,c,h;\nstring s;\nint main(){\n cin>>n;\n for(int i=1;i<=n;i++)\n {\n \tcin>>s;\n \tif(s[0]=='M') m++;\n \tif(s[0]=='A') a++;\n \tif(s[0]=='R') r++;\n \tif(s[0]=='C') c++;\n \tif(s[0]=='H') h++;\n\t}\n\tcout<<m*a*r+m*a*c+m*a*h+a*r*c+a*r*h+r*c*h+m*r*c+m*r*h+m*c*h+a*c*h;\n\treturn 0;\n}\n//68871358\n//76140264\n//25446011\n//200841159", "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tMap<String,Integer> list = new HashMap<String,Integer>();\n\t\tString object = \"MARCH\";\n\t\tint num = sc.nextInt();\n\t\tString a[] = {\"M\",\"A\",\"R\"};\n\t\tString b[] = {\"M\",\"A\",\"C\"};\n\t\tString c[] = {\"M\",\"A\",\"H\"};\n\t\tString d[] = {\"M\",\"R\",\"C\"};\n\t\tString e[] = {\"M\",\"R\",\"H\"};\n\t\tString f[] = {\"M\",\"C\",\"H\"};\n\t\tString g[] = {\"A\",\"R\",\"C\"};\n\t\tString h[] = {\"A\",\"R\",\"H\"};\n\t\tString j[] = {\"A\",\"C\",\"H\"};\n\t\tString k[] = {\"R\",\"C\",\"H\"};\n\t\t\n\t\tArrayList<String[]> com = new ArrayList<String[]>();\n\t\tcom.add(a);\n\t\tcom.add(b);\n\t\tcom.add(c);\n\t\tcom.add(d);\n\t\tcom.add(e);\n\t\tcom.add(f);\n\t\tcom.add(g);\n\t\tcom.add(h);\n\t\tcom.add(j);\n\t\tcom.add(k);\n\t\t\n\t\tfor(int i=0;i<num;i++){\n\t\t\tString value = sc.next();\n\t\t\tString first = value.substring(0,1);\n\t\t\tif(object.contains(first)){\n\t\t\t\tif(!list.containsKey(first)){\n\t\t\t\t\tlist.put(first, 0);\n\t\t\t\t}\n\t\t\t\tlist.put(first , list.get(first) + 1);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(list.size() < 3){\n\t\t\tSystem.out.println(0);\n\t\t}else{\n\t\t\tlong comb = 0;\n\t\t\tfor(String[] obj : com){\n\t\t\t\t long co = 1;\n\t\t\t\tfor(String ob : obj){\n\t\t\t\t\tif(list.containsKey(ob)){\n\t\t\t\t\tco = co * list.get(ob);\n\t\t\t\t\t}else{\n\t\t\t\t\t\tco = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcomb = comb + co;\n\t\t\t}\n\t\t\tSystem.out.println(comb);\n\t\t}\n\t}\n}", "import collections\nimport itertools\nn = int(input())\ns = []\nfor _ in range(n):\n s.append(input())\ns = [i[0] for i in s if i[0] in \"MARCH\"]\nl = collections.Counter(s)\nc = 0\nfor i,j,k in itertools.combinations(l.keys(), 3):\n c += l[i]*l[j]*l[k]\nprint(c)", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n public void run() {\n\n try(BufferedReader in = new BufferedReader(new InputStreamReader(System.in))) {\n\n int n = Integer.parseInt(in.readLine());\n char[] ch = {'M','A','R','C','H'};\n long[] cnt = new long[5];\n char sf;\n for(int i=0; i<n; i++) {\n sf = in.readLine().charAt(0);\n for (int j=0; j<ch.length; j++) {\n if(sf == ch[j]) {\n cnt[j]++;\n break;\n }\n }\n }\n\n long ans=0;\n for (int i=0; i<5; i++) {\n for (int j=i+1; j<5; j++) {\n for (int k=j+1; k<5; k++) {\n ans += cnt[i] * cnt[j] * cnt[k];\n }\n }\n }\n\n System.out.println(ans);\n }\n catch(IOException e) {\n System.err.println(e);\n }\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();scan.nextLine();\n\t\tString[] S = new String[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tS[i] = scan.nextLine();\n\t\t}\n\t\tlong[] s = new long[5];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (S[i].charAt(0) == 'M') s[0]++;\n\t\t\telse if (S[i].charAt(0) == 'A') s[1]++;\n\t\t\telse if (S[i].charAt(0) == 'R') s[2]++;\n\t\t\telse if (S[i].charAt(0) == 'C') s[3]++;\n\t\t\telse if (S[i].charAt(0) == 'H') s[4]++;\n\t\t}\n\n\t\tlong ans = 0;\n\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tfor (int j = i + 1; j < 5; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tans += (s[i]*s[j]*s[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public Main () {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long ans;\n long m, a, r, c, h;\n m = 0; a = 0; r = 0; c = 0; h = 0;\n\n for (int i = 0; i < n; i++) {\n char s = sc.next().charAt(0);\n switch (s) {\n case 'M':\n m++;\n break;\n case 'A':\n a++;\n break;\n case 'R':\n r++;\n break;\n case 'C':\n c++;\n break;\n case 'H':\n h++;\n }\n }\n\n ans = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h\n + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n\n System.out.println(ans);\n }\n\n public static void main (String[] args) {\n new Main();\n }\n\n}\n", "from itertools import combinations\nn=int(input())\ns=[input()[0] for _ in range(n)]\na=[]\nfor i in ['M','A','R','C','H']:\n a+=[s.count(i)]\nans=0\nfor i in combinations(a,3):\n ans+=i[0]*i[1]*i[2]\nprint(ans)", "import java.util.*;\nimport static java.lang.Integer.*;\nimport static java.lang.Long.*;\nimport static java.lang.Math.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\tpublic static int M = 5;\n\tpublic static void main(String[] args) {\n\t\tint i,j,k;\n\t\tScanner sc = new Scanner(in);\n\t\tint n = parseInt(sc.next());\n\t\tchar[] s = null; \n\t\tlong[] ma = new long[M]; \n\t\tfor (i = 0; i < n; i++) {\n\t\t\ts = sc.next().toCharArray();\n\t\t\tswitch(s[0]) {\n\t\t\tcase 'M':\n\t\t\t\tma[0]++;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tma[1]++;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tma[2]++;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tma[3]++;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tma[4]++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tsc.close();\n\t\tlong ans = 0L;\n\t\tfor (i = 0; i < M-2; i++) {\n\t\t\tfor (j = i+1; j < M-1; j++) {\n\t\t\t\tfor (k = j+1; k < M; k++) {\n\t\t\t\t\tans += ma[i]*ma[j]*ma[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n}\n", "march = ['M', 'A', 'R', 'C', 'H']\ncounter = [0, 0, 0, 0, 0]\nN = int(raw_input())\nfor i in range(0, N):\n\ts = raw_input()\n\tfor j in range(0, 5):\n\t\tif s[0] == march[j]:\n\t\t\tcounter[j] = counter[j] + 1\nans = 0\nfor i in range(0, 5):\n\tfor j in range(i+1, 5):\n\t\tfor k in range(j+1, 5):\n\t\t\tans = ans + counter[i] * counter[j] * counter[k]\n\nprint ans", "n=int(input())\ns=[input()[0] for i in range(n)]\nfrom collections import Counter\n\nsc=Counter(s)\nans=0\nfrom itertools import combinations\nfor a,b,c in combinations(\"MARCH\",3):\n ans+=sc[a]*sc[b]*sc[c]\nprint(ans)\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong[] a = new long[5];\n\t\tint n = in.nextInt();\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tString str = in.next();\n\t\t\tchar c = str.charAt(0);\n\t\t\tif(c=='M') a[0]++;\n\t\t\telse if(c=='A') a[1]++;\n\t\t\telse if(c=='R') a[2]++;\n\t\t\telse if(c=='C') a[3]++;\n\t\t\telse if(c=='H') a[4]++;\n\t\t}\n\t\tlong sum = 0;\n\t\tfor(int i=0;i<=2;i++) {\n\t\t\tfor(int j=i+1;j<=3;j++) {\n\t\t\t\tfor(int k=j+1;k<=4;k++) {\n\t\t\t\t\tsum += a[i]*a[j]*a[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sum);\n\t\tin.close();\n\t}\n\n}\n", "import java.util.*;\npublic class Main{\npublic static void main(String[]args){\nScanner sc=new Scanner(System.in);\nint n=sc.nextInt();\n long m=0,a=0, r=0,c=0, h=0;\n\tfor(int i=0;i<n;i++){\n String s=sc.next().substring(0,1);\n \tif(s.equals(\"M\"))m++;\n else if(s.equals(\"A\"))a++;\n else if(s.equals(\"R\"))r++;\n else if(s.equals(\"C\"))c++;\n else if(s.equals(\"H\"))h++;\n }\n System.out.println(m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h);\n}\n\n}\n", "n=int(input())\ns=[]\nc=[]\nans=0\nfor i in range(n):\n s.append(input()[0])\nfor x in 'MARCH':\n c.append(s.count(x))\nfor i in range(3):\n for j in range(i+1,4):\n for k in range(j+1,5):\n ans+=c[i]*c[j]*c[k]\nprint(ans)", "#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\nmap<char,long long int>q;\nint main()\n{\n int n;\n scanf(\"%d\",&n);\n char str[16];\n for(int i=0;i<n;i++)\n {\n scanf(\"%s\",str);\n q[str[0]]++;\n }\n long long int sum=0;\n sum+=q['M']*q['A']*(q['R']+q['C']+q['H'])+q['A']*q['R']*(q['C']+q['H'])+q['R']*q['C']*q['H']+q['M']*q['R']*(q['C']+q['H'])+q['M']*q['C']*q['H']+q['A']*q['C']*q['H'];\n printf(\"%lld\",sum);\n\n\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String [] args){\n Scanner sc =new Scanner(System.in);\n int N =sc.nextInt();\n String s[] = new String[N];\n long m=0;\n long a=0;\n long r=0;\n long c=0;\n long h=0;\n for (int i=0;i<N;i++) {\n s[i] = sc.next();\n if(s[i].charAt(0) == 'M') {\n m++;\n }\n if(s[i].charAt(0) =='A') {\n a++;\n }\n if(s[i].charAt(0) =='R') {\n r++;\n }\n if(s[i].charAt(0) =='C') {\n c++;\n }\n if(s[i].charAt(0)=='H') {\n h++;\n }\n }\n long ans =m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h\n +a*r*c + a*r*h + a*c*h + r*c*h;\n System.out.println(ans);\n\n }\n}", "from itertools import*;d={};g=d.get\nfor t in open(0).read().split():d[t[0]]=g(t[0],0)+1\nprint(sum(p*q*r for p,q,r in combinations([g(t,0)for t in'MARCH'],3)))", "#include <iostream>\nusing namespace std;\n\ntypedef long long ll;\nchar a[15];\nll v[100], cnt[10];\nll n, ans;\n\nint main()\n{\n ll i, j, k;\n\n cin >> n;\n for(i=0; i<n; i++)\n {\n cin >> a;\n v[a[0]]++;\n }\n\n cnt[0]=v['M'];\n cnt[1]=v['A'];\n cnt[2]=v['R'];\n cnt[3]=v['C'];\n cnt[4]=v['H'];\n\n for(i=0; i<5; i++)\n for(j=i+1; j<5; j++)\n for(k=j+1; k<5; k++)\n ans+=cnt[i]*cnt[j]*cnt[k];\n\n cout << ans;\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] a = new long[5];\n \n \n for (int i = 0; i < n; i++) {\n char ch = sc.next().charAt(0);\n if (ch == 'M')\n a[0]++;\n else if (ch == 'A')\n a[1]++;\n else if (ch == 'R')\n a[2]++;\n else if (ch == 'C')\n a[3]++;\n else if (ch == 'H')\n a[4]++;\n }\n \n long ans = 0;\n for (int i = 0; i <= 2; i++) {\n for (int j = i+1; j <= 3; j++) {\n for (int k = j+1; k <= 4; k++) {\n ans += a[i] * a[j] * a[k];\n }\n }\n }\n \n System.out.println(ans);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\t//System.out.println(N);\n\t\tlong m=0;\n\t\tlong a=0;\n\t\tlong r=0;\n\t\tlong c=0;\n\t\tlong h=0;\n\t\tfor(int i =0;i<N;i++){\n\t\t\tString str=sc.next();\n\t\t\t//System.out.println(hoge);\n\t\t\tif(str.startsWith(\"M\")){\n\t\t\t\t//System.out.println(\"M\");\n\t\t\t\tm++;\n\t\t\t}else if(str.startsWith(\"A\")){\n\t\t\t\ta++;\n\t\t\t\t//System.out.println(\"A\");\n\t\t\t}else if(str.startsWith(\"R\")){\n\t\t\t\tr++;\n\t\t\t\t//System.out.println(\"R\");\n\t\t\t}else if(str.startsWith(\"C\")){\n\t\t\t\tc++;\n\t\t\t\t//System.out.println(\"C\");\n\t\t\t}else if(str.startsWith(\"H\")){\n\t\t\t\th++;\n\t\t\t\t//System.out.println(\"H\");\n\t\t\t}\n\t\t}\n\t\tlong ans=0;\n\t\tans = m*(a*(r+c+h)+r*(c+h)+c*h)+a*(r*(c+h)+c*h)+r*c*h;\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n}\n", "from itertools import combinations\nfrom collections import defaultdict\nd = defaultdict(int)\n\nn = int(input())\nfor _ in range(n):\n d[input()[0]] += 1\n\nans = 0\nfor com in combinations('MARCH', 3):\n ans += d[com[0]] * d[com[1]] * d[com[2]]\nprint(ans)", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[5];\n\t\tlong total = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tchar s = sc.next().charAt(0);\n\t\t\tswitch (s) {\n\t\t\t\tcase 'M':\n\t\t\t\ta[0]++;\n\t\t\t\tbreak;\n\t\t\t\tcase 'A':\n\t\t\t\ta[1]++;\n\t\t\t\tbreak;\n\t\t\t\tcase 'R':\n\t\t\t\ta[2]++;\n\t\t\t\tbreak;\n\t\t\t\tcase 'C':\n\t\t\t\ta[3]++;\n\t\t\t\tbreak;\n\t\t\t\tcase 'H':\n\t\t\t\ta[4]++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tlong answer = 0;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tanswer += a[i] * a[j] * a[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(answer);\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n;\n long long m=0,r=0,c=0,h=0,a=0;\n cin>>n;\n vector<string>s(n);\n for(int i=0;i<n;i++)cin>>s[i];\n for(int i=0;i<n;i++)\n {\n if(s[i][0]=='M')m++;\n if(s[i][0]=='A')a++;\n if(s[i][0]=='R')r++;\n if(s[i][0]=='C')c++;\n if(s[i][0]=='H')h++;\n }\n long long ans=(m*a*r)+(m*a*c)+(m*a*h)+(m*r*c)+(m*r*h)+(m*c*h)+(a*r*c)+(a*r*h)+(a*c*h)+(r*c*h);\n cout<<ans<<endl;\n return 0;\n}", "n = int(input())\ns = []\nfor _ in range(n):\n s.append(input()[0])\nimport collections\nc = collections.Counter(s)\nlis = [c[\"M\"],c[\"A\"],c[\"R\"],c[\"C\"],c[\"H\"]]\nfrom itertools import *\nans=0\nfor tmp in combinations(lis,3):\n ans+=tmp[0]*tmp[1]*tmp[2]\nprint(ans)", "from itertools import*;s,*_=zip(*open(0));print(sum(p*q*r for p,q,r in combinations(map(s.count,'MARCH'),3)))", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(){\n int N;\n cin >> N;\n long long cnt[5] = {};\n string tag = \"MARCH\";\n for(int i = 0; i < N; ++i){\n string s;\n cin >> s;\n auto id = tag.find(s[0]);\n if(id == string::npos) continue;\n ++cnt[id];\n }\n long long ans = 0;\n for(int i = 0; i < 5; ++i){\n for(int j = 0; j < i; ++j){\n for(int k = 0; k < j; ++k){\n ans += cnt[i]*cnt[j]*cnt[k];\n }\n }\n }\n cout << ans << endl;\n}\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n public void run() {\n\n try(BufferedReader in = new BufferedReader(new InputStreamReader(System.in))) {\n\n int n = Integer.parseInt(in.readLine());\n char[] ch = {'M','A','R','C','H'};\n long[] cnt = new long[5];\n String ln;\n for(int i=0; i<n; i++) {\n ln = in.readLine();\n char sf = ln.charAt(0);\n for (int j=0; j<ch.length; j++) {\n if(sf == ch[j]) {\n cnt[j]++;\n break;\n }\n }\n }\n\n long ans=0;\n for (int i=0; i<5; i++) {\n for (int j=i+1; j<5; j++) {\n for (int k=j+1; k<5; k++) {\n ans += cnt[i] * cnt[j] * cnt[k];\n }\n }\n }\n\n System.out.println(ans);\n }\n catch(IOException e) {\n System.err.println(e);\n }\n }\n}", "#include<bits/stdc++.h>\n\nint_fast64_t n, ans, march[5];\nchar s[16];\n\nint main(){\n\tscanf(\"%ld\", &n);\n\tfor(int i=0; i<n; i++){\n\t\tscanf(\"%s\", s);\n\t\tif(s[0]=='M') march[0]++;\n\t\tif(s[0]=='A') march[1]++;\n\t\tif(s[0]=='R') march[2]++;\n\t\tif(s[0]=='C') march[3]++;\n\t\tif(s[0]=='H') march[4]++;\n\t}\n\t\n\tfor(int i=0; i<5; i++) for(int j=i+1; j<5; j++) for(int k=j+1; k<5; k++){\n\t\tans += march[i] * march[j] * march[k];\n\t}\n\tprintf(\"%ld\\n\", ans);\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tlong[] a = new long[5];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString[] s = sc.next().split(\"\");\n\t\t\tif (s[0].equals(\"M\"))\n\t\t\t\ta[0]++;\n\t\t\tif (s[0].equals(\"A\"))\n\t\t\t\ta[1]++;\n\t\t\tif (s[0].equals(\"R\"))\n\t\t\t\ta[2]++;\n\t\t\tif (s[0].equals(\"C\"))\n\t\t\t\ta[3]++;\n\t\t\tif (s[0].equals(\"H\"))\n\t\t\t\ta[4]++;\n\t\t}\n\t\tlong ans = 0;\n\t\tans += a[0] * a[1] * a[2];\n\t\tans += a[1] * a[2] * a[3];\n\t\tans += a[2] * a[3] * a[4];\n\t\tans += a[0] * a[2] * a[3];\n\t\tans += a[0] * a[2] * a[4];\n\t\tans += a[0] * a[3] * a[4];\n\t\tans += a[0] * a[1] * a[3];\n\t\tans += a[0] * a[1] * a[4];\n\t\tans += a[1] * a[2] * a[4];\n\t\tans += a[1] * a[3] * a[4];\n\t\tSystem.out.println(ans);\n\t}\n}", "#prag\\\nma GCC optimize(\"O3\")\n#include<bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nvector<int> v;\nmap<char,int> m;\nchar ch[5]={'M','A', 'R', 'C','H'};\n\nint main()\n{\n\tios::sync_with_stdio(false);\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tstring s;\n\t\tcin>>s;\n\t\tm[s[0]]++;\n\t}\n\tll ans=0;\n\tfor(int i=0;i<=2;i++)\n\t\tfor(int j=i+1;j<=3;j++)\n\t\t\tfor(int k=j+1;k<=4;k++)\n\t\t\t{\n\t\t\t\tans+=(ll)m[ch[i]]*(ll)m[ch[j]]*(ll)m[ch[k]];\n\t\t\t}\n\tcout<<ans<<endl;\n}", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t@SuppressWarnings(\"resource\")\n\t\tScanner stdin = new Scanner(System.in);\n\n\t\tint inN = stdin.nextInt();\n\t\tMap<Character, Integer> nameMap = new HashMap<>();\n\t\tfor (int i = 0; i < inN; i++) {\n\t\t\tchar first = stdin.next().charAt(0);\n\t\t\tint count = nameMap.getOrDefault(first, 0) + 1;\n\t\t\tnameMap.put(first, count);\n\t\t}\n\n\t\tchar[][] firstArray = {\n\t\t\t{\n\t\t\t\t'M', 'A', 'R'\n\t\t\t}, {\n\t\t\t\t'M', 'A', 'C'\n\t\t\t}, {\n\t\t\t\t'M', 'A', 'H'\n\t\t\t}, {\n\t\t\t\t'M', 'R', 'C'\n\t\t\t}, {\n\t\t\t\t'M', 'R', 'H'\n\t\t\t}, {\n\t\t\t\t'M', 'C', 'H'\n\t\t\t}, {\n\t\t\t\t'A', 'R', 'C'\n\t\t\t}, {\n\t\t\t\t'A', 'R', 'H'\n\t\t\t}, {\n\t\t\t\t'A', 'C', 'H'\n\t\t\t}, {\n\t\t\t\t'R', 'C', 'H'\n\t\t\t}\n\t\t};\n\n\t\tlong count = 0;\n\t\tfor (char[] array : firstArray) {\n\t\t\tlong pattern = 1;\n\t\t\tfor (char first : array) {\n\t\t\t\tif (nameMap.containsKey(first)) {\n\t\t\t\t\tpattern *= nameMap.get(first);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tpattern = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount += pattern;\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n}\n", "N = input()\nC = [0]*5\nfor _ in range(N):\n s = raw_input()[0]\n if s in \"MARCH\":\n C[\"MARCH\".index(s)] += 1\nans = 0\nfor i in range(5):\n for j in range(i):\n for k in range(j):\n ans += C[i]*C[j]*C[k]\nprint ans\n", "import sys\nfrom itertools import combinations as comb\nn, *S = open(0).read().split()\ns = [i[0] for i in S]\nc = [s.count(i) for i in 'MARCH']\nret = sum(x * y * z for x, y, z in comb(c, 3))\nprint(ret)", "o=ord;d=[0]*128\nfor t in open(0).read().split():d[o(t[0])]+=1\nprint(sum(d[o(p)]*d[o(q)]*d[o(r)]for p,q,r in __import__('itertools').combinations('MARCH',3)))", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n\n Map<String, Long> map = new HashMap<>();\n map.put(\"M\",0L);\n map.put(\"A\",0L);\n map.put(\"R\",0L);\n map.put(\"C\",0L);\n map.put(\"H\",0L);\n\n for (int i = 0; i < n; i++){\n String s = String.valueOf(sc.next().charAt(0));\n if (map.containsKey(s)) {\n map.put(s, map.get(s) + 1);\n }\n }\n long sum = 0;\n\n sum += map.get(\"M\")*map.get(\"A\")*map.get(\"R\");\n sum += map.get(\"M\")*map.get(\"A\")*map.get(\"C\");\n sum += map.get(\"M\")*map.get(\"A\")*map.get(\"H\");\n sum += map.get(\"M\")*map.get(\"R\")*map.get(\"C\");\n sum += map.get(\"M\")*map.get(\"R\")*map.get(\"H\");\n sum += map.get(\"M\")*map.get(\"C\")*map.get(\"H\");\n sum += map.get(\"A\")*map.get(\"R\")*map.get(\"C\");\n sum += map.get(\"A\")*map.get(\"R\")*map.get(\"H\");\n sum += map.get(\"A\")*map.get(\"C\")*map.get(\"H\");\n sum += map.get(\"R\")*map.get(\"C\")*map.get(\"H\");\n\n System.out.println(sum);\n }\n}", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] alp = new long[28];\n int[] id = {'M'-'A', 'A'-'A', 'R'-'A','C'-'A', 'H'-'A'};\n long ans = 0;\n for(int i = 0;i < N;i++) alp[sc.next().charAt(0)-'A']++;\n for(int i = 0;i <= 2;i++){\n for(int j = i+1;j <= 3;j++){\n for(int k = j+1;k <= 4;k++){\n ans += alp[id[i]]*alp[id[j]]*alp[id[k]];\n }\n }\n }\n System.out.println(ans); \n }\n}", "#include <iostream>\nusing namespace std;\n \nint main() \n{\n\tlong long i,j,n,ans=0;\n\tlong m=0,a=0,r=0,c=0,h=0;\n\tstring s[100001];\n \tcin >> n;\n\n\tfor(i=0;i<n;i++){\n\t\tcin >> s[i];\n\t} \n\tfor(i=0;i<n;i++){\n\t\tif(s[i][0]=='M'){\n\t\t\tm++;\n\t\t}\n\t\tif(s[i][0]=='A'){\n\t\t\ta++;\n\t\t}\n\t\tif(s[i][0]=='R'){\n\t\t\tr++;\n\t\t}\n\t\tif(s[i][0]=='C'){\n\t\t\tc++;\n\t\t}\n\t\tif(s[i][0]=='H'){\n\t\t\th++;\n\t\t}\n\t} \n\tans=(m*a*r)+(m*a*c)+(m*a*h)+(m*r*c)+(m*r*h)+(m*c*h)+(a*r*c)+(a*r*h)+(a*c*h)+(r*c*h);\n\tcout << ans << endl;\n\treturn 0;\n}", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n\n long[] count = new long[5];\n List<Character> symbols = new ArrayList<Character>() {\n {\n add('M');\n add('A');\n add('R');\n add('C');\n add('H');\n }\n };\n for (int i = 0; i < N; i++) {\n String name = sc.next();\n int index = symbols.indexOf(name.toCharArray()[0]);\n if (index != -1) {\n count[index] = count[index] + 1;\n }\n }\n\n long ans = 0;\n for (int i = 0; i < symbols.size(); i++) {\n for (int j = i + 1; j < symbols.size(); j++) {\n for (int k = j + 1; k < symbols.size(); k++) {\n ans += count[i] * count[j] * count[k];\n }\n }\n }\n System.out.println(ans);\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\n long long i, j, k, Sum=0, N;\n cin>>N;\n map<char, long long> S;\n string s;\n vector<char> I={'M', 'A', 'R', 'C', 'H'};\n \n for(i=0; i<N; i++){\n cin>>s;\n S[s[0]]++;\n }\n for(i=0; i<5; i++){\n for(j=i+1; j<5; j++){\n for(k=j+1; k<5; k++){\n Sum+=S[I[i]]*S[I[j]]*S[I[k]];\n }\n }\n }\n cout << Sum << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long int n,m=0,a=0,r=0,c=0,h=0;cin>>n;string s[n];\n for(int i=0;i<n;i++){\n cin>>s[i];\n if(s[i].at(0)=='M')m++;\n else if(s[i].at(0)=='A')a++;\n else if(s[i].at(0)=='R')r++;\n else if(s[i].at(0)=='C')c++;\n else if(s[i].at(0)=='H')h++;\n }\n// cout<<m<<a<<r<<c<<h;\n cout<<m*a*r +m*a*c +m*a*h +m*r*c +m*r*h +m*c*h +a*r*c +a*r*h +a*c*h +r*c*h;\n}", "import itertools\nn = int(input())\ns = [input()[0] for i in range(n)]\n\nc = [s.count(i) for i in 'MARCH']\nans = sum(c[i]*c[j]*c[k] for i,j,k in itertools.combinations(range(5), 3))\nprint(ans)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n long m,a,r,c,h;\n m = a = r = c = h = 0;\n int[] P ={0 ,0 ,0 ,0 ,0 ,0 ,1 ,1 ,1 ,2};\n int[] Q ={1 ,1 ,1 ,2 ,2 ,3 ,2 ,2 ,3 ,3};\n int[] R ={2 ,3 ,4 ,3 ,4 ,4 ,3 ,4 ,4 ,4};\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] S = new long[5];\n for (int i = 0; i < N; i++) {\n String name = sc.next();\n if (name.charAt(0) == 'M') m++;\n if (name.charAt(0) == 'A') a++;\n if (name.charAt(0) == 'R') r++;\n if (name.charAt(0) == 'C') c++;\n if (name.charAt(0) == 'H') h++;\n }\n S[0]=m; S[1]=a; S[2]=r; S[3]=c; S[4]=h;\n long res = 0;\n for (int d = 0; d < 10; d++) {\n res += S[P[d]] * S[Q[d]] * S[R[d]];\n }\n\n System.out.println(res);\n }\n}\n", "#include<bits/stdc++.h>\n#define ll long long\nusing namespace std;\nll f[30];\nll n;\nchar x[30];\nll ans=0;\nint main(){\n\tios::sync_with_stdio(false);\n\tcin>>n;\n\tfor (ll i=1;i<=n;i++){\n\t\tcin>>x; f[x[0]-'A']++;\n\t}\n\tll m=f[12],a=f[0];\n\tll r=f[17],c=f[2];\n\tll h=f[7];\n\t//cout<<m<<a<<r<<c<<h<<endl;\n\tans=r*c*h+a*c*h+a*r*h+a*r*c+m*c*h+m*r*h+m*r*c+m*a*h+m*a*c+m*a*r;\n\tcout<<ans;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n long[] march = new long[5];\n for (int i = 0; i < n; i++) {\n String s = sc.next();\n if (s.startsWith(\"M\")) {\n march[0]++;\n } else if (s.startsWith(\"A\")) {\n march[1]++;\n } else if (s.startsWith(\"R\")) {\n march[2]++;\n } else if (s.startsWith(\"C\")) {\n march[3]++;\n } else if (s.startsWith(\"H\")) {\n march[4]++;\n }\n }\n long ans = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i + 1; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += march[i] * march[j] * march[k];\n }\n }\n }\n System.out.println(ans);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString[] s = new String[n];\n\t\tfor(int i = 0 ; i < n; i++) s[i] = sc.next();\n\t\tlong[] a = new long[5];\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tif(s[i].charAt(0) == 'M') a[0]++;\n\t\t\tif(s[i].charAt(0) == 'A') a[1]++;\n\t\t\tif(s[i].charAt(0) == 'R') a[2]++;\n\t\t\tif(s[i].charAt(0) == 'C') a[3]++;\n\t\t\tif(s[i].charAt(0) == 'H') a[4]++;\n\t\t}\n\t\tlong ans = 0;\n\t\tfor(int i = 0 ; i < 5 ; i++) {\n\t\t\tfor(int j = i + 1 ; j < 5 ; j++) {\n\t\t\t\tfor(int k = j + 1 ; k < 5 ; k++) {\n\t\t\t\t\tans += a[i] * a[j] * a[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "#089_C\nfrom collections import Counter\nfrom itertools import combinations\nn = int(input())\ns = [input()[0] for _ in range(n)]\ncnt = Counter(s)\nans = 0\nfor a, b, c in combinations('MARCH', 3):\n ans += cnt[a] * cnt[b] * cnt[c]\nprint(ans)", "import java.util.*;\n\npublic class Main {\n\n\tstatic long Examine(long countM,long countA,long countR,long countC,long countH) {\n\t\tlong count = 0;\n\t\tcount += countR * countC * countH;\n\t\tcount += countA * countC * countH;\n\t\tcount += countA * countR * countH;\n\t\tcount += countA * countR * countC;\n\t\t\n\t\tcount += countM * countC * countH;\n\t\tcount += countM * countR * countH;\n\t\tcount += countM * countR * countC;\n\t\t\n\t\tcount += countM * countA * countH;\n\t\tcount += countM * countA * countC;\n\t\t\n\t\tcount += countM * countA * countR;\n\n\t\treturn count;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tString[] names = new String[N];\n\t\tlong countM = 0;\n\t\tlong countA = 0;\n\t\tlong countR = 0;\n\t\tlong countC = 0;\n\t\tlong countH = 0;\n\t\tString[] I = new String[N];\n\t\tfor(int i = 0;i < N;i++) {\n\t\t\tnames[i] = sc.next();\n\t\t\tI[i] = names[i].substring(0,1);\n\t\t}\n\t\tfor(int k = 0;k < N;k++) {\n\t\t\tif(I[k].equals(\"M\")) countM++;\n\t\t\telse if(I[k].equals(\"A\")) countA++;\n\t\t\telse if(I[k].equals(\"R\")) countR++;\n\t\t\telse if(I[k].equals(\"C\")) countC++;\n\t\t\telse if(I[k].equals(\"H\")) countH++;\n\t\t}\n\t\tSystem.out.println(Examine(countM,countA,countR,countC,countH));\n\t\tsc.close();\n\t}\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n array<int, 128> cnt={};\n int n; cin>>n;\n for(string s; n--; ) {\n cin>>s;\n cnt[s[0]]++;\n }\n long res=0;\n for(int i=0; i<(1<<5); ++i) if (__builtin_popcount(i)==3) {\n long c=1;\n for(int j=0; j<5; ++j) if ((i>>j)&1) c*=cnt[\"MARCH\"[j]];\n res+=c;\n }\n cout<<res<<endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nstring z;\nint M,A,R,C,H;\nint main(){\n while(cin>>z){\n switch(z[0]){\n case 'M':M++;break;\n case 'A':A++;break;\n case 'R':R++;break;\n case 'C':C++;break;\n case 'H':H++;break;\n }\n }\n long long int x=C+H,y=A+R,v=A*R,t=C*H;\n cout<<v*(M+x)+t*(M+y)+(M*x*y)<<endl;\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] list = new long[5];\n\t\tfor(int i = 0; i < 5; i++) {\n\t\t\tlist[i] = 0;\n\t\t}\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tString s = sc.next();\n\t\t\tif(s.charAt(0) == 'M')\n\t\t\t\tlist[0]++;\n\t\t\telse if(s.charAt(0) == 'A')\n\t\t\t\tlist[1]++;\n\t\t\telse if(s.charAt(0) == 'R')\n\t\t\t\tlist[2]++;\n\t\t\telse if(s.charAt(0) == 'C')\n\t\t\t\tlist[3]++;\n\t\t\telse if(s.charAt(0) == 'H')\n\t\t\t\tlist[4]++;\n\t\t}\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < 5; i++) {\n\t\t\tfor(int j = i + 1; j < 5; j++) {\n\t\t\t\tfor(int k = j + 1; k < 5; k++) {\n\t\t\t\t\tans += list[i] * list[j] * list[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); i++) \n#define all(v) begin(v),end(v)\nusing ll = long long;\n\nint main() {\n int n;cin>>n;\n string t=\"MARCH\";\n vector<int> cnt(5);\n rep(i,n){\n string s;cin>>s;\n rep(j,5){\n if(s[0]==t[j])cnt[j]++;\n }\n }\n ll ans=0;\n rep(i,3)for(int j=i+1;j<4;j++)for(int k=j+1;k<5;k++){\n ans+=(ll)cnt[i]*cnt[j]*cnt[k];\n }\n cout<<ans<<endl;\n}", "import itertools as i,collections as c;n,*a=open(0).read().split()\nprint(sum(p*q*r for p,q,r in i.combinations(c.Counter(s[0]for s in a if s[0]in\"MARCH\").values(),3)))", "from collections import Counter\nfrom itertools import combinations\nn = int(input())\nS = [input()[0] for _ in range(n)]\nC = Counter(S)\nans = 0\nfor i, j, k in combinations(['M', 'A', 'R', 'C', 'H'], 3):\n ans += C[i] * C[j] * C[k]\nprint(ans)\n", "N = int(raw_input())\nNames = []\nn_M, n_A, n_R, n_C, n_H = 0,0,0,0,0\nfor i in range(N):\n\tName = raw_input()\n\tif Name[0] == \"M\":\n\t\tn_M += 1\n\tif Name[0] == \"A\":\n\t\tn_A += 1\n\tif Name[0] == \"R\":\n\t\tn_R += 1\n\tif Name[0] == \"C\":\n\t\tn_C += 1\n\tif Name[0] == \"H\":\n\t\tn_H += 1\n\nC = (n_M * n_A * n_R + \n\tn_M * n_A * n_C +\n\tn_M * n_A * n_H +\n\tn_M * n_R * n_C +\n\tn_M * n_R * n_H +\n\tn_M * n_C * n_H +\n\tn_A * n_R * n_C +\n\tn_A * n_R * n_H +\n\tn_A * n_C * n_H +\n\tn_R * n_C * n_H\n\t)\n\nprint C", "from itertools import combinations\nn=int(input())\nd=dict({'M':0,'A':0,'R':0,'C':0,'H':0})\nfor _ in range(n):\n s=input()[0]\n if s in d:\n d[s]+=1\nans=0\nfor a,b,c in list(combinations(d.keys(),3)):\n ans+=(d[a]*d[b]*d[c])\nprint(ans)\n", "#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<int> c(5);\n\tfor (int i = 0; i < N; ++i) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tif (string(\"MARCH\").find(s[0]) != string::npos) {\n\t\t\t++c[string(\"MARCH\").find(s[0])];\n\t\t}\n\t}\n\tlong long ans = 0;\n\tfor (int i = 0; i < 5; ++i) {\n\t\tfor (int j = 0; j < i; ++j) {\n\t\t\tfor (int k = 0; k < j; ++k) {\n\t\t\t\tans += 1LL * c[i] * c[j] * c[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "import java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\n\t/** 選ぶ人数 */\n\tprivate static final int N = 3;\n\t/** 対象となる頭文字 */\n\tprivate static final Set<Character> MARCHS = new HashSet<>(Arrays.asList('M', 'A', 'R', 'C', 'H'));\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint n = scanner.nextInt();\n\t\t\tMap<Character, Integer> map = new HashMap<>();\n\t\t\tIntStream.range(0, n).forEach(i -> {\n\t\t\t\tString s = scanner.next();\n\t\t\t\tchar c = s.charAt(0);\n\t\t\t\tif (MARCHS.contains(c)) {\n\t\t\t\t\tmap.put(c, map.getOrDefault(c, 0) + 1);\n\t\t\t\t}\n\t\t\t});\n\t\t\tint[] count = map.values().stream().mapToInt(Integer::intValue).toArray();\n\t\t\tSystem.out.println(IntStream.range((1 << N) - 1, (1 << count.length)).filter(i -> N == Integer.bitCount(i))\n\t\t\t\t\t.mapToLong(i -> IntStream.range(0, count.length).filter(j -> 0 != (i & (1 << j)))\n\t\t\t\t\t\t\t.mapToLong(j -> (long) count[j]).reduce(1L, (a, b) -> a * b))\n\t\t\t\t\t.sum());\n\t\t}\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint a[105];\nlong long n,cnt;\nint main()\n{\n\tstring s,r=\"MARCH\";\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>s;\n\t\ta[s[0]]++;\n\t}\n\tfor(int i=0;i<3;i++)\n\t{\n\t\tfor(int j=i+1;j<4;j++)\n\t\t{\n\t\t\tfor(int k=j+1;k<5;k++)\n\t\t\t{\n\t\t\t\tcnt+=1ll*a[r[i]]*a[r[j]]*a[r[k]];\t\n\t\t\t}\t\n\t\t}\t\n\t} \n\tprintf(\"%lld\",cnt);\n\treturn 0;\n}", "#include <bits/stdc++.h>\ntypedef long long ll;\nusing namespace std;\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,a) FOR(i,0,a)\nconst int MAX_N=1e5;\nint N;\n\nstring march=\"MARCH\";\n\nll cnt['Z'-'A'+1];\n\nint main(){\n\tcin>>N;\n\tREP(i,N){\n\t\tstring s;\n\t\tcin>>s;\n\t\tcnt[s[0]-'A']++;\n\t}\n\tll ans=0;\n\tREP(bit,1<<5){\n\t\tint c=0;\n\t\tll a=1;\n\t\tREP(i,5){\n\t\t\tif (bit&(1<<i)){\n\t\t\t\tc++;\n\t\t\t\ta*=cnt[march[i]-'A'];\n\t\t\t}\n\t\t}\n\t\tif (c==3){\n\t\t\tans+=a;\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "import itertools\n\nn=int(input())\nli=[]\n\nfor i in range(n):\n li.append(input()[0])\n\ntm=list(itertools.combinations([\"M\",\"A\",\"R\",\"C\",\"H\"],3))\nans=0\n\nfor j1,j2,j3 in tm:\n ans+=li.count(j1)*li.count(j2)*li.count(j3)\n\nprint(ans)\n", "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main() {\n\tstring a;\n\tunsigned long long b,h=0;\n\tunsigned long long c = 0, d = 0, e = 0, f = 0, g = 0;\n\tcin >> b;\n\tfor (int i = 0;i < b;i++)\n\t{\n\t\tcin >> a;\n\t\tif (a[0] == 'M')c++;\n\t\tif (a[0] == 'A')d++;\n\t\tif (a[0] == 'R')e++;\n\t\tif (a[0] == 'C')f++;\n\t\tif (a[0] == 'H')g++;\n\n\t}\n\n\th = c * d * e + c * d * f + c * d*g + c * e*f + c * e*g + c * f*g + d * e*f + d * e*g + d * f*g + e * f*g;\n\tcout << h << endl;\n\treturn 0;\n}\n\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[]) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint N = sc.nextInt();\n\t\tsc.nextLine();\n\n\t\tString[] S = new String[N];\n\t\tlong[] march = new long[5];\n\t\tfor(int i=0;i<N;i++) {\n\t\t\tS[i] = sc.nextLine();\n\n\t\t\tswitch(S[i].charAt(0)) {\n\t\t\t\tcase 'M':\n\t\t\t\t\tmarch[0]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'A':\n\t\t\t\t\tmarch[1]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'R':\n\t\t\t\t\tmarch[2]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'C':\n\t\t\t\t\tmarch[3]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'H':\n\t\t\t\t\tmarch[4]++;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tlong ans=0;\n\t\tfor(int i=0;i<3;i++) {\n\t\t\tif(march[i] == 0) continue;\n\t\t\tfor(int j=i+1;j<4;j++) {\n\t\t\t\tif(march[j] == 0) continue;\n\t\t\t\tfor(int k=j+1;k<5;k++) {\n\t\t\t\t\tif(march[k] == 0) continue;\n\t\t\t\t\tans += march[i]*march[j]*march[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "from collections import Counter\nn = int(input())\nA = [input()[0] for i in range(n)]\n\nA = Counter(A)\nm = A['M']\na = A['A']\nr = A['R']\nc = A['C']\nh = A['H']\n\nprint(m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h)", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tString s =\"\";\n\t\tlong m=0,a=0,r=0,c=0,h=0;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ts=sc.next();\n\t\t\ts = String.valueOf(s.charAt(0));\n\t\t\tif(s.equals(\"M\")) {\n\t\t\t\tm++;\n\t\t\t}\n\t\t\tif(s.equals(\"A\"))\n\t\t\t\ta++;\n\t\t\tif(s.equals(\"R\"))\n\t\t\t\tr++;\n\t\t\tif(s.equals(\"C\"))\n\t\t\t\tc++;\n\t\t\tif(s.equals(\"H\"))\n\t\t\t\th++;\n\n\t\t}\n\t\tlong kekka = m*(a*(r+c+h)+r*(c+h)+c*h)+a*(r*(c+h)+c*h)+r*c*h;\n\t\tSystem.out.print(kekka);\n\n\t}\n\n}\n", "n = int(input())\ns = []\n\nfor i in range(n):\n s.append(input())\n\nl = [s[i][0] for i in range(n)]\n\nm = l.count('M')\na = l.count('A')\nr = l.count('R')\nc = l.count('C')\nh = l.count('H')\n\nprint(m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h)", "#include<cstdio>\n\nint main(){\n\tunsigned N;\n\tscanf(\"%u\\n\", &N);\n\tunsigned long long a=0, b=0, c=0, d=0, e=0;\n\tfor (unsigned i = 0; i < N; ++i)\t{\n\t\tchar tmp[15];\n\t\tscanf(\"%s\", tmp);\n\t\tif(tmp[0] == 'M') a++;\n\t\tif(tmp[0] == 'A') b++;\n\t\tif(tmp[0] == 'R') c++;\n\t\tif(tmp[0] == 'C') d++;\n\t\tif(tmp[0] == 'H') e++;\n\t}\n\tprintf(\"%llu\\n\", a*(b*(c+d+e)+c*(d+e)+d*e)+b*(c*(d+e)+d*e)+c*d*e);\n\treturn 0;\n}", "#include <cstdio>\n#include <map>\nusing namespace std;\nint N; long long ans;\nchar c[10]; map<char, long long> m;\nchar I[5] = {'M', 'A', 'R', 'C', 'H'};\nint main() {\n scanf(\"%d\", &N);\n for(int i = 0; i < N; i++) {\n scanf(\"%s\", c); m[c[0]]++;\n }\n for(int i = 0; i < 3; i++) {\n for(int j = i+1; j < 4; j++) {\n for(int k = j+1; k < 5; k++) {\n ans += m[I[i]]*m[I[j]]*m[I[k]];\n }\n }\n }\n printf(\"%ld\", ans);\n}", "from collections import Counter\nfrom itertools import combinations as comb\n\nN = int(input())\nd = Counter()\nfor _ in range(N):\n s = input()\n d[s[0]] += 1\n\nans = 0\nfor i, j, k in comb([\"M\",\"A\",\"R\",\"C\",\"H\"], 3):\n ans += d[i]*d[j]*d[k]\nprint(ans)\n", "import collections\ncc = collections.Counter()\nfor _ in range(int(raw_input())): \n\ts = raw_input()\n\tcc[s[0]] +=1\t\n\ndef dfs(i, total ,cumul, cc, k, s):\n\tif i == len(s):\n\t\tif k == 0:\n\t\t\ttotal[0] += cumul\n\t\treturn \n\n\tif k:\n\t\tdfs(i+1, total, cumul * cc[s[i]], cc,k - 1, s)\n\tdfs(i+1, total, cumul, cc, k, s)\n\ntotal = [0]\ndfs(0, total, 1 , cc, 3, 'MARCH')\nprint total[0]", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); i++) \n#define all(v) begin(v),end(v)\nusing ll = long long;\n\nint main() {\n int n;cin>>n;\n vector<string> s(n);\n rep(i,n)cin>>s[i];\n string t=\"MARCH\";\n vector<int> cnt(5);\n rep(i,n){\n rep(j,5){\n if(t[j]==s[i][0])cnt[j]++;\n }\n }\n ll ans=0;\n rep(i,5)for(int j=i+1;j<5;j++)for(int k=j+1;k<5;k++){\n ans+=(ll)cnt[i]*cnt[j]*cnt[k];\n }\n cout<<ans<<endl;\n}", "n=int(input())\nfrom collections import *\nd=Counter()\nfor _ in range(n): d[input()[0]]+=1\nimport itertools as it\nprint(sum(d[s]*d[t]*d[r] for s,t,r in it.combinations('MARCH',3)))", "import java.util.*;\n\npublic class Main {\n\n public static void main(String args[]) {\n\n // 入力\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n String[] s = new String[n];\n for (int i = 0; i < n; i++) {\n s[i] = sc.next();\n }\n\n // 主処理\n long[] count = new long[5];\n for (int i = 0; i < s.length; i++) {\n if (s[i].startsWith(\"M\")) {\n count[0]++;\n } else if (s[i].startsWith(\"A\")) {\n count[1]++;\n } else if (s[i].startsWith(\"R\")) {\n count[2]++;\n } else if (s[i].startsWith(\"C\")) {\n count[3]++;\n } else if (s[i].startsWith(\"H\")) {\n count[4]++;\n }\n }\n\n long[] array = Arrays.stream(count).filter(c -> 0 < c).toArray();\n long result = 0;\n\n if (3 <= array.length) {\n List<Long> list = new ArrayList<>();\n for (int i = 0; i < array.length; i++) {\n for (int j = i + 1; j < array.length; j++) {\n for (int k = j + 1; k < array.length; k++) {\n long num = array[i] * array[j] * array[k];\n list.add(num);\n }\n }\n }\n result = list.stream().mapToLong(c -> c).sum();\n }\n\n // 出力\n System.out.println(result);\n sc.close();\n }\n}\n", "import itertools\n\nn = int(raw_input())\nli = list()\nfor m in range(0,n):\n li.append(raw_input())\n\nm = len(filter(lambda x: x[0]==\"M\" ,li))\na = len(filter(lambda x: x[0]==\"A\" ,li))\nr = len(filter(lambda x: x[0]==\"R\" ,li))\nc = len(filter(lambda x: x[0]==\"C\" ,li))\nh = len(filter(lambda x: x[0]==\"H\" ,li))\n\ncon = [m, a, r, c, h]\nprint sum(map(lambda x: x[0]*x[1]*x[2] , list(itertools.combinations(con, 3))))", "import itertools as i,collections as c\nn,*a=open(0).read().split()\nb=c.Counter(s[0]for s in a if s[0]in\"MARCH\")\nprint(sum(p*q*r for p,q,r in i.combinations(b.values(),3)))", "from itertools import combinations\nN=int(input())\nnums={}\nfor i in \"MARCH\":\n nums[i]=0\nfor i in range(N):\n s=input().strip()\n if s[0] in \"MARCH\":\n nums[s[0]]+=1\nct=0\nfor a,b,c in combinations(\"MARCH\",3):\n ct+=nums[a]*nums[b]*nums[c]\nprint(ct)", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint main(){\n ll N,M=0,A=0,R=0,C=0,H=0;\n cin>>N;\n for(ll i=0;i<N;i++){\n string s;\n cin>>s;\n if(s.at(0)=='M'){M++;}\n if(s.at(0)=='A'){A++;}\n if(s.at(0)=='R'){R++;}\n if(s.at(0)=='C'){C++;}\n if(s.at(0)=='H'){H++;}\n }\n cout<<M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H<<endl;\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n Map<String, List<String>> map = new HashMap<>();\n for (int i = 0; i < N; i++) {\n String S = sc.next();\n String top = S.substring(0,1);\n if (top.matches(\"[MARCH]\")) {\n if (map.containsKey(top)) {\n map.get(top).add(S);\n } else {\n List<String> list = new ArrayList<String>();\n list.add(S);\n map.put(top, list); \n }\n }\n }\n List<String> keys = new ArrayList<>(map.keySet());\n long count = 0;\n if (keys.size() < 3) {\n System.out.println(0);\n } else {\n for (int i = 0; i < keys.size()-2; i++) {\n String key1 = keys.get(i);\n for (int j = i+1; j < keys.size()-1; j++) {\n String key2 = keys.get(j);\n for (int k = j+1; k < keys.size(); k++) {\n String key3 = keys.get(k);\n long size1 = map.get(key1).size();\n long size2 = map.get(key2).size();\n long size3 = map.get(key3).size();\n count += size1*size2*size3;\n }\n }\n }\n System.out.println(count);\n }\n } \n}\n", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int lli;\n\nint main(){\n\tint n;\n\tcin >> n;\n\tvector<lli> num(256, 0);\n\tfor(int i=0; i<n; i++){\n\t\tstring s;\n\t\tcin >> s;\n\t\tnum[s[0]]++;\n\t}\n\tlli ans = 0;\n\tvector<int> per{'M','A','R','C','H'};\n\tsort(per.begin(), per.end());\n\tdo{\n\t\tans += num[per[0]] *num[per[1]] *num[per[2]];\n\t}while(next_permutation(per.begin(), per.end()));\n\tcout << ans/(2*3*2) << endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\nclass Main {\n\n private static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n int n = sc.nextInt();\n int m = 0, a = 0, r = 0, c = 0, h = 0;\n for (int i = 0; i < n; i++) {\n char ch = sc.next().charAt(0);\n if (ch == 'M') {\n m++;\n } else if (ch == 'A') {\n a++;\n } else if (ch == 'R') {\n r++;\n } else if (ch == 'C') {\n c++;\n } else if (ch == 'H') {\n h++;\n }\n }\n long count = ((long) m * a * r) + ((long) m * a * c) + ((long) m * a * h)\n + ((long) m * r * c) + ((long) m * r * h) + ((long) m * c * h)\n + ((long) a * r * c) + ((long) a * r * h) + ((long) a * c * h)\n + ((long) r * c * h);\n System.out.println(count);\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in);) {\n solve(sc);\n }\n }\n\n public static void solve(Scanner sc) {\n long[] nums = new long[5];\n int n = sc.nextInt();\n for (int i = 0; i < n; i++) {\n String name = sc.next();\n switch (name.charAt(0)) {\n case 'M':\n nums[0]++;\n break;\n case 'A':\n nums[1]++;\n break;\n case 'R':\n nums[2]++;\n break;\n case 'C':\n nums[3]++;\n break;\n case 'H':\n nums[4]++;\n break;\n }\n }\n\n long ans = 0l;\n for (int i = 0; i < 5 - 2; i++) {\n for (int j = i + 1; j < 5 - 1; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += nums[i] * nums[j] * nums[k];\n }\n }\n }\n System.out.println(ans);\n }\n}", "from itertools import*\nn,*a=open(0).read().split()\nprint(sum(p*q*r for p,q,r in combinations(map([i[0]for i in a].count,\"MARCH\"),3)))", "import itertools\nn = int(input())\ns = [input()[0] for _ in range(n)]\nc = list(itertools.combinations(set(filter(lambda x: x in \"MARCH\", s)), 3))\n\nans = 0\nfor _c in c:\n ans += s.count(_c[0])*s.count(_c[1])*s.count(_c[2])\nprint(ans)\n", "m_count = 0\na_count = 0\nr_count = 0\nc_count = 0\nh_count = 0\n\nn = input()\n\nfor i in range(n):\n name = raw_input()\n if name[0] == 'M':\n m_count += 1\n elif name[0] == 'A':\n a_count += 1\n elif name[0] == 'R':\n r_count += 1\n elif name[0] == 'C':\n c_count += 1\n elif name[0] == 'H':\n h_count += 1\n\ncount = 0\ncount += m_count * a_count * r_count\ncount += m_count * r_count * c_count\ncount += m_count * c_count * h_count\ncount += a_count * r_count * c_count\ncount += a_count * c_count * h_count\ncount += r_count * c_count * h_count\ncount += m_count * a_count * c_count\ncount += m_count * a_count * h_count\ncount += m_count * r_count * h_count\ncount += a_count * r_count * h_count\n\nprint count\n", "import itertools\nN = int(raw_input())\nS = [raw_input() for _ in range(N)]\nmarch = list(\"MARCH\")\nI = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nfor s in S:\n if s[0] in I.keys():\n I[s[0]] += 1\nfor i in march:\n if I[i] < 1:\n I.pop(i)\nK = list(I.keys())\nans = long(0)\nfor c in list(itertools.combinations(K, 3)):\n ans += I[c[0]]*I[c[1]]*I[c[2]]\nprint ans\n\n", "n=int(input())\ns=[input() for _ in range(n)]\nfrom collections import Counter\ncnt=0\nd=Counter()\nimport itertools\nans=0\nfor i in s:\n d[i[0]]+=1\nfor i , j,k in itertools.combinations(\"MARCH\",3):\n ans+=d[i]*d[j]*d[k]\nprint(ans)", "#include<iostream>\nusing namespace std;\n\nint n, p[5];\nint main(){\n long long ans = 0;\n char s[15], ch[] = \"MARCH\";\n cin >> n;\n\n while(n--){\n cin >> s;\n for(int k=0; k<5; ++k)\n if(s[0] == ch[k]) ++p[k];\n }\n\n for(int i=0; i<3; ++i){\n for(int j=i+1; j<4; ++j){\n for(int k=j+1; k<5; ++k){\n ans += (long long)p[i] * p[j] * p[k];\n } \n } \n }\n cout << ans << endl;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n for (int i = 0; i < N; i++) {\n String s = sc.next();\n if (s.charAt(0) == 'M') m++;\n if (s.charAt(0) == 'A') a++;\n if (s.charAt(0) == 'R') r++;\n if (s.charAt(0) == 'C') c++;\n if (s.charAt(0) == 'H') h++; \n }\n long ans = 0;\n if (m > 0) {\n ans += (m * a * r) + (m * a * c) + (m * a * h) + (m * r * c) + (m * r * h) + (m * c * h);\n }\n if (a > 0) {\n ans += (a * r * c) + (a * r * h) + (a * c * h);\n }\n if (r > 0) {\n ans += (r * c * h);\n }\n System.out.println(ans);\n }\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n double N = sc.nextInt();\n double topM = 0;\n double topA = 0;\n double topR = 0;\n double topC = 0;\n double topH = 0;\n for (int i=0;i<N;i++){\n String name = sc.next();\n if (name.startsWith(\"M\")){\n topM += 1;\n }else if (name.startsWith(\"A\")){\n topA += 1;\n }else if (name.startsWith(\"R\")){\n topR += 1;\n }else if (name.startsWith(\"C\")){\n topC += 1;\n }else if (name.startsWith(\"H\")){\n topH += 1;\n }\n }\n List<Double> names = new ArrayList<>();\n names.add(topM); names.add(topA);\n names.add(topR); names.add(topC);\n names.add(topH);\n double result = 0;\n for (int i=0;i<5;i++){\n for (int j=i+1;j<5;j++){\n for (int k=j+1;k<5;k++){\n result += names.get(i) * names.get(j) * names.get(k);\n }\n }\n }\n System.out.printf(\"%.0f\", result);\n }\n}", "from itertools import combinations\nN = int(input())\nL = [input()[0] for _ in range(N)]\n\nans = sum(x * y * z for x,y,z in combinations([L.count(s) for s in \"MARCH\"], 3))\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint N, H[5];\n\nint main(){\n\tlong long res = 0;\n\tcin >> N;\n\tfor(int i = 0; i < N; i++){\n\t\tstring s;\n\t\tcin >> s;\n\t\tif(s[0] == 'M') H[0]++;\n\t\telse if(s[0] == 'A') H[1]++;\n\t\telse if(s[0] == 'R') H[2]++;\n\t\telse if(s[0] == 'C') H[3]++;\n\t\telse if(s[0] == 'H') H[4]++;\n\t}\n\tfor(int i = 0; i < 3; i++)\n\t\tfor(int j = i + 1; j < 4; j++)\n\t\t\tfor(int k = j + 1; k < 5; k++)\n\t\t\t\tres += (long long)H[i] * H[j] * H[k];\n\tprintf(\"%lld\\n\", res);\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long n,ans=0;\n cin >> n;\n vector<char> march={'M','A','R','C','H'};\n vector<long> a(5);\n for(int i=0;i<n;i++) {\n string s;\n cin >> s;\n for(int j=0;j<5;j++) {\n if(s[0]==march[j]) {\n a[j]++;\n break;\n }\n }\n }\n for(int i=0;i<5;i++) {\n for(int j=i+1;j<5;j++) {\n for(int k=j+1;k<5;k++) {\n ans+=a[i]*a[j]*a[k];\n }\n }\n }\n cout << ans << endl;\n}", "#include <iostream>\nint main(){\n char name[11];\n int n;\n long int m=0,a=0,r=0,c=0,h=0;\n scanf(\"%d\",&n);\n for(int i=0;i<n;i++){\n scanf(\"%s\",name);\n if(name[0]=='M'){\n m++;\n }else if(name[0]=='A'){\n a++;\n }else if(name[0]=='R'){\n r++;\n }else if(name[0]=='C'){\n c++;\n }else if(name[0]=='H'){\n h++;\n }\n }\n printf(\"%ld\\n\",m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h);\n return 0;\n}", "import java.util.HashMap;\nimport java.util.Scanner;\n\nclass Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tHashMap<Character, Integer> cnt = new HashMap<Character, Integer>();\n\t\tchar[] march = {'M', 'A', 'R', 'C', 'H'};\n\t\tfor(char c : march) cnt.put(c, 0);\n\t\tint N = sc.nextInt();\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tString S = sc.next();\n\t\t\tchar st = S.charAt(0);\n\t\t\tboolean exist = false;\n\t\t\tfor(char c : march) exist |= (st == c);\n\t\t\tif(exist) cnt.put(st, cnt.get(st) + 1);\n\t\t}\n\t\tlong ans = 0;\n\t\tint comb = (1 << 3) - 1;\n\t\twhile(comb < (1 << 5)){\n\t\t\tboolean make = true;\n\t\t\tfor(int i = 0; i < 5; i++) {\n\t\t\t\tif(((comb >> i) & 1) == 1) make &= (cnt.get(march[i]) > 0);\n\t\t\t}\n\t\t\tif(!make) {\n\t\t\t\tint x = (comb & -comb), y = comb + x;\n\t\t\t\tcomb = ((comb & ~y) / x >> 1) | y;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 0; i < 5; i++) {\n\t\t\t\tif(((comb >> i) & 1) == 1) {\n\t\t\t\t\ttmp *= (long)cnt.get(march[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tans += tmp;\n\n\t\t\tint x = (comb & -comb), y = comb + x;\n\t\t\tcomb = ((comb & ~y) / x >> 1) | y;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n long[] count = new long[5];\n\n for (int i = 0; i < n; i++) {\n String str = String.valueOf(sc.next().charAt(0));\n\n if (str.equals(\"M\")) {\n count[0]++;\n } else if (str.equals(\"A\")) {\n count[1]++;\n } else if (str.equals(\"R\")) {\n count[2]++;\n } else if (str.equals(\"C\")) {\n count[3]++;\n } else if (str.equals(\"H\")) {\n count[4]++;\n }\n }\n\n long ans = 0;\n\n for (int i = 0; i < 3; i++) {\n for (int j = i+1; j < 4; j++) {\n for (int k = j+1; k < 5; k++) {\n ans += count[i] * count[j] * count[k];\n }\n }\n }\n\n System.out.println(ans);\n }\n}\n", "#include <iostream>\nusing namespace std;\n\nint n;\nstring s;\nint k[30];\nint w[] = {0, 2, 7, 12, 17};\n\nint main () {\n\n\tcin >> n;\n\tfor (int i = 0; i < n; i ++) {\n\t\tcin >> s;\n\t\tk[ s[0]-'A' ] ++;\n\t\t//cout << s[0]-'A' << \"\\n\";\n\t}\n\t\n\tlong long int sol = 0;\n\tfor (int i = 0; i < 5; i ++) {\n\t\tfor (int j = i+1; j < 5; j ++) {\n\t\t\tfor (int l = j+1; l < 5; l ++) {\n\t\t\t\tsol += 1LL * k[ w[i] ] * k[ w[j] ] * k[ w[l] ];\n\t\t\t}\n\t\t}\n\t}\n\tcout << sol;\n\n\treturn 0;\n}", "n = input()\ns = [raw_input().strip() for _ in xrange(n)]\ndic = {'M':0,'A':0,'R':0,'C':0,'H':0}\nfor i in s:\n\tif i[0] in \"MARCH\":\n\t\tdic[i[0]] += 1\nkey = \"MARCH\"\nans = 0\nfor i in range(5):\n\tfor j in range(i+1,5):\n\t\tfor k in range(j+1,5):\n\t\t\tans += (dic[key[i]]*dic[key[j]]*dic[key[k]])\nprint ans\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n; cin>>n;\n vector<long long> num(5,0);\n string x=\"MARCH\";\n for(int i=0;i<n;i++){\n string s; cin>>s;\n for(int j=0;j<5;j++){\n if(s[0]==x[j]) num[j]++;\n }\n }\n long long ans=0;\n for(int i=0;i<3;i++){\n for(int j=i+1;j<4;j++){\n for(int k=j+1;k<5;k++){\n ans+=num[i]*num[j]*num[k];\n }\n }\n }\n cout<<ans<<endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < (n);i++)\ntypedef long long ll;\n\n\nint main(){\n int N;\n cin >> N;\n vector<string> s(N);\n rep(i,N) cin >> s[i];\n string match = \"MARCH\";\n map<char,ll> m;\n rep(i,N) m[s[i][0]]++;\n ll res = 0;\n rep(i,5) for(int j = i + 1; j < 5 ; j++) for(int k = j + 1; k < 5 ; k++) {\n res += m[match[i]] * m[match[j]] * m[match[k]];\n }\n cout << res << endl;\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\t\n\t\tlong n1=0,n2=0,n3=0,n4=0,n5=0;\n\t\tString m[]=new String[n];\n\t\tString a[]=new String[n];\n\t\tString r[]=new String[n];\n\t\tString c[]=new String[n];\n\t\tString h[]=new String[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tString s=sc.next();\n\t\t\tif(s.charAt(0)=='M'){\n\t\t\t\tn1++;\n\t\t\t}\n\t\t\tif(s.charAt(0)=='A'){\n\t\t\t\tn2++;\t\n\t\t\t}\n\t\t\tif(s.charAt(0)=='R'){\n\t\t\t\tn3++;\n\t\t\t}\n\t\t\tif(s.charAt(0)=='C'){\n\t\t\t\tn4++;\n\t\t\t}\n\t\t\tif(s.charAt(0)=='H'){\n\t\t\t\tn5++;\n\t\t\t}\n\t\t}\n\t\tlong sum=0;\n\t\tsum+=n1*n2*n3;\n\t\tsum+=n1*n2*n4;\n\t\tsum+=n1*n2*n5;\n\t\tsum+=n1*n3*n4;\n\t\tsum+=n1*n3*n5;\n\t\tsum+=n1*n4*n5;\n\t\tsum+=n2*n3*n4;\n\t\tsum+=n2*n3*n5;\n\t\tsum+=n2*n4*n5;\n\t\tsum+=n3*n4*n5;\n\t\tSystem.out.println(sum);\n\t}\n\n}\n", "#include<cstdio>\nint main(){\n\tint n;\n\tscanf(\"%d\",&n);\n\tlong long int m=0;\n\tlong long int a=0;\n\tlong long int r=0;\n\tlong long int c=0;\n\tlong long int h=0;\n\tfor(int i=0;i<n;i++){\n\t\tchar s[20]={};\n\t\tscanf(\"%s\",s);\n\t\tif(s[0]=='M')m++;\n\t\tif(s[0]=='A')a++;\n\t\tif(s[0]=='R')r++;\n\t\tif(s[0]=='C')c++;\n\t\tif(s[0]=='H')h++;\n\t}\n\tprintf(\"%lld\\n\",m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h);\n\treturn 0;\n}", "import collections\ncc = collections.Counter([raw_input()[0] for _ in range(int(raw_input()))])\n\n\ndef dfs(i, total ,cumul, cc, k, s):\n\tif i == len(s) or k == 0:\n\t\tif k == 0: total[0] += cumul\n\t\treturn \n\t\n\tdfs(i+1, total, cumul * cc[s[i]], cc,k - 1, s)\n\tdfs(i+1, total, cumul, cc, k, s)\n\ntotal = [0]\ndfs(0, total, 1 , cc, 3, 'MARCH')\nprint total[0]", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] b = {0, 0, 0, 0, 0};\n\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tString str = sc.next();\n\t\t\tswitch(str.charAt(0)) {\n\t\t\tcase 'M': b[0]++; break;\n\t\t\tcase 'A': b[1]++; break;\n\t\t\tcase 'R': b[2]++; break;\n\t\t\tcase 'C': b[3]++; break;\n\t\t\tcase 'H': b[4]++; break;\n\t\t\t}\n\t\t}\n\n\t\tlong a = 0;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\ta += b[i] * b[j] * b[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(a);\n\t}\n}\n", "N=int(input())\nC=[0]*6\n\nfor _ in range(N):\n C['MARCH'.find(input()[0])]+=1\n\nfrom itertools import*\nD=list(combinations(C[:5],3))\n\nans=0\nfor i,j,k in D:\n ans+=i*j*k\n\nprint(ans)", "m=[0]*5\nfor i in range(int(input())):\n try: m[\"MARCH\".index(input()[0])]+=1\n except: continue\nans = 0\nfor i in range(5):\n for j in range(i+1,5):\n for k in range(j+1, 5):\n ans += m[i]*m[j]*m[k]\nprint(ans)", "from collections import Counter\nfrom itertools import combinations\nN = int(input())\nSlist = [input() for _ in range(N)]\nSc = Counter([S[0] for S in Slist])\nans = 0\nfor x, y, z in combinations(list(\"MARCH\"), 3):\n ans += Sc[x] * Sc[y] * Sc[z]\nprint(ans)", "n = int(input())\ns = []\nfor i in range(n):\n a = input()[0]\n if a in [\"M\",\"A\",\"R\",\"C\",\"H\"]:\n s.append(a)\nans = 0 \nimport itertools\nfor i,j,k in itertools.combinations([\"M\",\"A\",\"R\",\"C\",\"H\"], 3):\n ans += s.count(i) * s.count(j) * s.count(k)\nprint(ans)", "#include <bits/stdc++.h>\n#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(void) {\n ll N;\n cin >> N;\n string t = \"MARCH\";\n vector<ll> cnt(5, 0);\n REP(i, 0, N) {\n string S;\n cin >> S;\n REP(j, 0, 5) if(S[0] == t[j]) cnt[j]++;\n }\n\n ll ans = 0;\n REP(i, 0, 5) REP(j, i + 1, 5) REP(k, j + 1, 5) {\n ans += cnt[i] * cnt[j] * cnt[k];\n }\n cout << ans << endl;\n}\n", "#include <bits/stdc++.h>\n#define ll long long\n\nusing namespace std;\n\nint main(){\n ll N,ans=0;\n cin>>N;\n vector<ll> v(5,0);\n vector<string> S(N);\n for(ll i=0;i<N;i++){\n string s;\n cin>>s;\n char c=s[0];\n if(c=='M') v[0]++;\n else if(c=='A') v[1]++;\n else if(c=='R') v[2]++;\n else if(c=='C') v[3]++;\n else if(c=='H') v[4]++;\n }\n for(ll i=0;i<5;i++){\n for(ll j=i+1;j<5;j++){\n for(ll k=j+1;k<5;k++) ans+=v[i]*v[j]*v[k];\n }\n }\n cout<<ans<<endl;\n}\n", "import itertools\nN=int(input())\nl=[0]*5\nm=list('MARCH')\nfor i in range(N):\n S=input()\n if S[0] in m:\n l[m.index(S[0])]+=1\nans=0\nfor i in list(itertools.combinations(l,3)):\n m=1\n for j in i:\n m*=j\n ans+=m\nprint(ans)", "from itertools import combinations as c\nn=int(input())\nl=[0]*5\nfor i in range(n):\n s=input()\n s=s[0]\n if s in \"MARCH\":\n l[\"MARCH\".index(s)]+=1\nans=0\nfor x,c,v in c(range(5),3):\n ans+=l[x]*l[c]*l[v]\nprint(ans)", "from itertools import combinations as cmbs\nimport sys\nc = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nfor i in range(int(input())):\n si = sys.stdin.readline()\n if si[0] in c:\n c[si[0]] += 1\nans = sum(i*j*k for i,j,k in cmbs(c.values(),r=3))\nprint(ans)\n", "import sys\n\nN=int(raw_input())\nlist_S=[raw_input() for i in range(N)]\n\nlist_MARCH=[\"M\", \"A\", \"R\", \"C\", \"H\"]\nlist_only_MARCH=[i for i in list_S if i[0] in list_MARCH]\n\nnum_MARCH=len(list_only_MARCH)\nlist_num=[0, 0, 0, 0, 0]\nfor i in list_only_MARCH:\n if i[0]==\"M\": list_num[0]=list_num[0]+1\n elif i[0]==\"A\": list_num[1]=list_num[1]+1\n elif i[0]==\"R\": list_num[2]=list_num[2]+1\n elif i[0]==\"C\": list_num[3]=list_num[3]+1\n elif i[0]==\"H\": list_num[4]=list_num[4]+1\n\nans_num=num_MARCH*(num_MARCH-1)*(num_MARCH-2)/6\nif ans_num==0:\n print 0\n sys.exit()\n\nfor i in list_num:\n if i==2: ans_num=ans_num-(num_MARCH-2)\n elif i>=3:\n ans_num=ans_num-(i*(i-1)*(i-2)/6)\n ans_num=ans_num-((num_MARCH-i)*i*(i-1)/2)\n\nprint ans_num", "import java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\tstatic boolean visit[] = new boolean[5];\n\tstatic long[] arr = new long[5];\n\tpublic static void main(String[] args) {\n\t\tfinal Scanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tSet<String> m = new HashSet<>();\n\t\tSet<String> a = new HashSet<>();\n\t\tSet<String> r = new HashSet<>();\n\t\tSet<String> c = new HashSet<>();\n\t\tSet<String> h = new HashSet<>();\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tString s = sc.next();\n\t\t\tswitch (s.charAt(0)) {\n\t\t\tcase 'M':\n\t\t\t\tm.add(s);\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\ta.add(s);\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tr.add(s);\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tc.add(s);\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\th.add(s);\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tarr = new long[5];\n\t\tarr[0] = m.size();\n\t\tarr[1] = a.size();\n\t\tarr[2] = r.size();\n\t\tarr[3] = c.size();\n\t\tarr[4] = h.size();\n\t\tint count = 0;\n\t\tfor(int i = 0; i < 5; i++) {\n\t\t\tif(arr[i] != 0) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tArrays.sort(arr);\n\t\tlong ans = 0L;\n\t\tif(count < 3) {\n\t\t\tSystem.out.println(0);\n\t\t} else if(count == 3) {\n\t\t\tSystem.out.println(arr[4]*arr[3]*arr[2]);\n\t\t} else if(count == 4) {\n\t\t\tSystem.out.println(arr[4]*arr[3]*arr[2]+arr[4]*arr[3]*arr[1]+arr[4]*arr[1]*arr[2]+arr[1]*arr[3]*arr[2]);\n\t\t} else {\n\t\t\t//System.out.println(bfs(0, 0L));\n\t\t\tSystem.out.println(arr[0]*arr[1]*arr[2]+arr[0]*arr[1]*arr[3]+arr[0]*arr[1]*arr[4]+arr[0]*arr[2]*arr[3]+arr[0]*arr[2]*arr[4]+arr[0]*arr[3]*arr[4]+arr[1]*arr[2]*arr[3]+arr[1]*arr[2]*arr[4]+arr[1]*arr[3]*arr[4]+arr[2]*arr[3]*arr[4]);\n\t\t}\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N;\n cin >> N;\n vector<string> S(100009);\n for(int i=0;i<N;i++){cin >> S[i];}\n long long m=0,a=0,r=0,c=0,h=0;\n for(int i=0;i<N;i++){\n if(S[i][0]=='M'){m++;}\n if(S[i][0]=='A'){a++;}\n if(S[i][0]=='R'){r++;}\n if(S[i][0]=='C'){c++;}\n if(S[i][0]=='H'){h++;}\n }\n long long ans=m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h;\n cout << ans << endl;\n}", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n Scanner scanner = new Scanner(System.in);\n int N = scanner.nextInt();\n String[] S = new String[N];\n long[] count = new long[5];\n long ans = 0;\n\n for (int i = 0; i < N; i++){\n S[i] = scanner.next();\n }\n for (int i = 0; i < N; i++){\n if(S[i].charAt(0) == 'M'){\n count[0]++;\n } else if (S[i].charAt(0) == 'A'){\n count[1]++;\n } else if (S[i].charAt(0) == 'R'){\n count[2]++;\n } else if (S[i].charAt(0) == 'C'){\n count[3]++;\n } else if (S[i].charAt(0) == 'H'){\n count[4]++;\n }\n }\n ans = count[0] * count[1] * count[2] + count[0] * count[1]* count[3] +\n count[0] * count[1] * count[4] + count[0] * count[2] * count[3] +\n count[0] * count[2] * count[4] + count[0] * count[3] * count[4] +\n count[1] * count[2] * count[3] + count[1] * count[2] * count[4] +\n count[1] * count[3] * count[4] + count[2] * count[3] * count[4];\n\n System.out.println(ans);\n }\n}\n", "from itertools import combinations\ndef main():\n s = [i[0] for i in open(0).read().split()[1:]]\n c = [s.count(i) for i in \"MARCH\"]\n a = sum(x*y*z for x, y, z in combinations(c, 3))\n print(a)\nmain()", "from itertools import combinations\n\n\nN, *S = open(0).read().split()\nMARCH = (\"M\", \"A\", \"R\", \"C\", \"H\")\ncnt = {c: 0 for c in MARCH}\nfor s in S:\n if s[0] in MARCH:\n cnt[s[0]] += 1\nprint(sum(cnt[a] * cnt[b] * cnt[c] for a, b, c in combinations(MARCH, 3)))\n", "n=int(input())\nm=0;a=0;r=0;c=0;h=0\nfor i in range(n):\n x=input()\n if x[0]=='M':m+=1\n elif x[0]=='A':a+=1\n elif x[0]=='R':r+=1\n elif x[0]=='C':c+=1\n elif x[0]=='H':h+=1\nprint(m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h)", "from itertools import combinations\nfrom collections import Counter\n\nn = int(input())\nS = Counter()\nfor i in range(n):\n S[input()[0]] += 1 # Counter == dictionary\n \nprint(sum([S[a]*S[b]*S[c] for a, b, c in combinations(\"MARCH\", 3)])) ", "from itertools import*;d=[0]*128\nfor t in open(0).read().split():d[ord(t[0])]+=1\nprint(sum(p*q*r for p,q,r in combinations([d[ord(t)]for t in'MARCH'],3)))", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n BufferedReader rd;\n\n Main() throws IOException {\n rd = new BufferedReader(new InputStreamReader(System.in));\n compute();\n }\n\n private void compute() throws IOException {\n int n = pint();\n long[] cnt = new long[200];\n for(int i=0;i<n;i++) {\n String s = rd.readLine();\n cnt[s.charAt(0)]++;\n }\n char[] d = \"MARCH\".toCharArray();\n long res = 0;\n for(int i=0;i<32;i++) {\n if(Integer.bitCount(i) == 3) {\n int u = 1;\n char[] chosen = new char[3];\n int ic = 0;\n for(int k=0;k<5;k++) {\n if((i&u)>=1) {\n chosen[ic] = d[k];\n ic++;\n }\n u <<= 1;\n }\n res += cnt[chosen[0]] * cnt[chosen[1]] * cnt[chosen[2]];\n }\n }\n out(res);\n }\n\n private int pint() throws IOException {\n return pint(rd.readLine());\n }\n\n private int pint(String s) {\n return Integer.parseInt(s);\n }\n\n private static void out(Object x) {\n System.out.println(x);\n }\n\n public static void main(String[] args) throws IOException {\n new Main();\n }\n}\n", "#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nsigned main(){\n string s=\"MARCH\";\n int c[5]={0};\n int n;\n cin >> n;\n for (int i=0;i<n;++i){\n string t;\n cin >> t;\n for (int j=0;j<5;++j){\n if (t[0]==s[j]){\n c[j]++;\n }\n }\n }\n int ans=0;\n for (int i=0;i<5;++i){\n for (int j=i+1;j<5;++j){\n for (int k=j+1;k<5;++k){\n ans+=c[i]*c[j]*c[k];\n }\n }\n }\n cout << ans << endl;\n return 0;\n}", "from itertools import*\nn = int(input())\ns = [input() for i in range(n)]\ns = [s[i][0] for i in range(n)]\nd=[0]*128\nfor t in s:\n d[ord(t[0])]+=1\nprint(sum(p*q*r for p,q,r in combinations([d[ord(t)] for t in'MARCH'],3)))", "from itertools import combinations as cmbs\nimport sys\nc = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nfor si in map(lambda s:s[0],sys.stdin):\n if si in c:\n c[si] += 1\nans = sum(i*j*k for i,j,k in cmbs(c.values(),r=3))\nprint(ans)\n", "public class Main {\n private static java.util.Scanner scanner = new java.util.Scanner(System.in);\n\n public static void main(String[] args) {\n int n = scanner.nextInt();\n long m = 0, a = 0, r = 0, c = 0, h = 0;\n for (int i = 0; i < n; i++) {\n switch (scanner.next().charAt(0)) {\n case 'M': m++; continue;\n case 'A': a++; continue;\n case 'R': r++; continue;\n case 'C': c++; continue;\n case 'H': h++;\n }\n }\n System.out.println(m * a * r + m * a * c + m * a * h + m * r * c + m * r * h + m * c * h + a * r * c + a * r * h + a * c * h + r * c * h);\n }\n}", "#include<cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n\tint n; scanf(\"%d\", &n);\n\tint c[5] = {};\n\tfor(int i = 0; i < n; i++){\n\t\tchar s[20]; scanf(\"%s\", s);\n\t\tif(s[0] == 'M') c[0]++;\n\t\tif(s[0] == 'A') c[1]++;\n\t\tif(s[0] == 'R') c[2]++;\n\t\tif(s[0] == 'C') c[3]++;\n\t\tif(s[0] == 'H') c[4]++;\n\t}\n\tll res = 0;\n\tfor(int i = 0; i < 3; i++) for(int j = i + 1; j < 4; j++)\n\t\tfor(int k = j + 1; k < 5; k++) res += (ll)c[i] * c[j] * c[k];\n\tprintf(\"%lld\\n\", res);\n\treturn 0;\n}", "import itertools\nn=int(input())\nl=[]\nfor i in range(n):l.append(input()[0])\nc=[]\nul=[\"M\",\"A\",\"R\",\"C\",\"H\"]\nfor i in ul:c.append(l.count(i))\ncc=itertools.combinations(c, 3)\nans=0\nfor i,j,k in cc:ans+=i*j*k\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n long long n;\n cin >> n;\n long long a[5]={0};\n for(int i=0;i<n;i++){\n string s;\n cin >> s;\n if(s[0]=='M')a[0]++;\n if(s[0]=='A')a[1]++;\n if(s[0]=='R')a[2]++;\n if(s[0]=='C')a[3]++;\n if(s[0]=='H')a[4]++;\n }\n long long ans=0;\n for(int i=0;i<5;i++)for(int j=i+1;j<5;j++)for(int k=j+1;k<5;k++)ans+=a[i]*a[j]*a[k];\n cout << ans << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n\nint main(){\n int N;\n cin>>N;\n long m,a,r,c,h;\n m=a=r=c=h=0;\n string tmp;\n rep(i,N) {\n cin>>tmp;\n if(tmp.at(0)=='M') m++;\n else if(tmp.at(0)=='A') a++;\n else if(tmp.at(0)=='R') r++;\n else if(tmp.at(0)=='C') c++;\n else if(tmp.at(0)=='H') h++;\n }\n long ans=m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h;\n cout<<ans<<endl;\n}", "n=int(input())\nmarch=[]\nfor i in range(n):\n x=input()\n march.append(x[0])\n\nm=march.count('M')\na=march.count('A')\nr=march.count('R')\nc=march.count('C')\nh=march.count('H')\nways=m*a*r+m*a*c+m*a*h+m*r*c+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h+m*r*h\nprint(ways)\n", "import java.util.*;\nimport java.math.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n long a=0,b=0,c=0,d=0,e=0;\n for(int i=0;i<n;i++){\n String str = sc.next();\n switch(str.charAt(0)){\n case 'M': a++; break;\n case 'A': b++; break;\n case 'R': c++; break;\n case 'C': d++; break;\n case 'H': e++; break;\n }\n }\n System.out.println(\na*b*c + \na*b*d + \na*b*e + \na*c*d + \na*c*e + \na*d*e + \nb*c*d + \nb*c*e + \nb*d*e + \nc*d*e);\n }\n}\n", "#include <bits/stdc++.h>\n\n#define x first\n#define y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef long double ld;\n\nll cnt[256];\nchar all[5] = {'M','A','R','C','H'};\n\nint main()\n{\n int n;string s; cin >> n;\n while(n--) cin >>s, ++cnt[s[0]];\n ll ans = 0;\n for(int i=0;i<5;++i)\n for(int j=i+1;j<5;++j)\n for(int k=j+1;k<5;++k) ans += cnt[all[i]]*cnt[all[j]]*cnt[all[k]];\n cout << ans;\n}\n\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t@SuppressWarnings(\"resource\")\n\t\tScanner stdin = new Scanner(System.in);\n\n\t\tint inN = stdin.nextInt();\n\t\tint[] nameCount = new int[5];\n\t\tfor (int i = 0; i < inN; i++) {\n\t\t\tint index = getIndex(stdin.next());\n\t\t\tif (index >= 0) {\n\t\t\t\tnameCount[index]++;\n\t\t\t}\n\t\t}\n\n\t\tfinal char[][] firstArray = {\n\t\t\t{\n\t\t\t\t'M', 'A', 'R'\n\t\t\t}, {\n\t\t\t\t'M', 'A', 'C'\n\t\t\t}, {\n\t\t\t\t'M', 'A', 'H'\n\t\t\t}, {\n\t\t\t\t'M', 'R', 'C'\n\t\t\t}, {\n\t\t\t\t'M', 'R', 'H'\n\t\t\t}, {\n\t\t\t\t'M', 'C', 'H'\n\t\t\t}, {\n\t\t\t\t'A', 'R', 'C'\n\t\t\t}, {\n\t\t\t\t'A', 'R', 'H'\n\t\t\t}, {\n\t\t\t\t'A', 'C', 'H'\n\t\t\t}, {\n\t\t\t\t'R', 'C', 'H'\n\t\t\t}\n\t\t};\n\n\t\tlong count = 0;\n\t\tfor (char[] array : firstArray) {\n\t\t\tlong pattern = 1;\n\t\t\tfor (char first : array) {\n\t\t\t\tpattern *= nameCount[getIndex(first)];\n\t\t\t}\n\t\t\tcount += pattern;\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n\n\tprivate static int getIndex(char first) {\n\t\tswitch (first) {\n\t\t\tcase 'M':\n\t\t\t\treturn 0;\n\t\t\tcase 'A':\n\t\t\t\treturn 1;\n\t\t\tcase 'R':\n\t\t\t\treturn 2;\n\t\t\tcase 'C':\n\t\t\t\treturn 3;\n\t\t\tcase 'H':\n\t\t\t\treturn 4;\n\t\t\tdefault:\n\t\t\t\treturn -1;\n\t\t}\n\t}\n\n\tprivate static int getIndex(String name) {\n\t\tchar first = name.charAt(0);\n\t\treturn getIndex(first);\n\t}\n}\n", "import itertools\nN=int(input())\nkey='MARCH'\ncnt=[0]*5\nfor i in range(N):\n S=input()\n for j in range(5):\n if(S[0]==key[j]):\n cnt[j]+=1\nans=0\nfor v in itertools.combinations(cnt,3):\n ans+=v[0]*v[1]*v[2]\nprint(ans)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n Map<Character, Integer> map = new HashMap<>();\n for (int i = 0; i < N; i++) {\n String s = sc.next();\n char c = s.charAt(0);\n if (c == 'M' || c == 'A' || c == 'R' || c == 'C' || c == 'H') {\n map.put(c, map.getOrDefault(c, 0)+1);\n }\n }\n\n int n = map.size();\n if (n < 3) {\n System.out.println(0);\n return;\n }\n \n int[] count = new int[n];\n int idx = 0;\n for (int value : map.values()) {\n count[idx++] = value;\n }\n \n long ans = 0;\n int p = 1 << n;\n for (int i = 0; i < p; i++) {\n ans += calc(count, i);\n }\n \n System.out.println(ans);\n }\n \n private static long calc(int[] count, int i) {\n long mul = 1;\n int shift = 0;\n int bit = 0;\n while (i != 0) {\n if (i % 2 == 1) {\n bit++;\n mul *= count[shift];\n }\n i /= 2;\n shift++;\n }\n return bit == 3 ? mul : 0;\n }\n}", "a,b,c,d,e = 0,0,0,0,0\nfor _ in [0]*int(input()):\n s = input()[0]\n if s == \"M\":\n a += 1\n elif s == \"A\":\n b += 1\n elif s == \"R\":\n c += 1\n elif s == \"C\":\n d += 1\n elif s == \"H\":\n e += 1\nprint(a*b*(c+d+e)+(a+b)*(c*d+d*e+e*c)+c*d*e)", "from itertools import*;x=[s[0]for s in open(0).readlines()];print(sum(p*q*r for p,q,r in combinations([x.count(s)for s in\"MARCH\"],3)))", "N=int(input())\n\ndic={'M':0,'A':0,'R':0,'C':0,'H':0}\nk = dic.keys()\n\nfor i in range(N):\n s=input()\n if s[0] in k:\n dic[s[0]]+=1\n\nfrom itertools import combinations\n\nans=0\nfor p,q,r in combinations(k,3):\n ans+=dic[p]*dic[q]*dic[r]\n\nprint(ans)\n", "import java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\n\t@SuppressWarnings(\"resource\")\n\tpublic static void main(String args[]) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tSet<String> marchSet = new HashSet<>();\n\t\tint march[] = new int[5];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString s = scanner.next();\n\t\t\tmarchSet.add(s);\n\t\t}\n\n\t\tfor (String s : marchSet) {\n\t\t\tif (s.charAt(0) == 'M')\n\t\t\t\tmarch[0]++;\n\t\t\telse if (s.charAt(0) == 'A')\n\t\t\t\tmarch[1]++;\n\t\t\telse if (s.charAt(0) == 'R')\n\t\t\t\tmarch[2]++;\n\t\t\telse if (s.charAt(0) == 'C')\n\t\t\t\tmarch[3]++;\n\t\t\telse if (s.charAt(0) == 'H')\n\t\t\t\tmarch[4]++;\n\t\t}\n\n\t\tlong cnt = 0;\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tfor (int j = i + 1; j < 5; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tcnt += (long)march[i] *(long) march[j] *(long) march[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(cnt);\n\n\t}\n}", "import java.util.Scanner;\n\nclass Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n for(int i = 0; i < n; i++){\n String str = sc.next().substring(0,1);\n if(str.equals(\"M\")){\n m++;\n }\n if(str.equals(\"A\")){\n a++;\n }\n if(str.equals(\"R\")){\n r++;\n }\n if(str.equals(\"C\")){\n c++;\n }\n if(str.equals(\"H\")){\n h++;\n }\n }\n long ans = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n System.out.println(ans);\n }\n}", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = Integer.parseInt(scan.nextLine());\n\t\tlong[] count ={0,0,0,0,0};// m a r c h\n\t\tString s;\n\t\tchar ini;\n\t\tfor (int i = 0;i < n;++i){\n\t\t\ts=scan.nextLine();\n\t\t\tini = s.charAt(0);\n\t\t\tswitch (ini) {\n\t\t\t\tcase 'M':++count[0];\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'A':++count[1];\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'R':++count[2];\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'C':++count[3];\n\t\t\t\t\t break;\n\t\t\t\tcase 'H':++count[4];\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\tlong ans=0;\n\t\t\tfor (int i = 0;i<5;++i){\n\t\t\t\tfor(int k = i+1;k<5;++k){\n\t\t\t\t\tfor(int j =k+1;j<5;++j){\n\t\t\t\t\t\tans+=count[i]*count[k]*count[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.print(ans);\n\n\t}\n}\n//end", "from itertools import combinations\nfrom collections import Counter\nN = int(input())\nS = Counter()\nfor _ in range(N):\n S[input()[0]] += 1\nprint(sum([S[p0]*S[p1]*S[p2] for p0,p1,p2 in combinations('MARCH', 3)]))\nquit()\n", "import itertools\nN = int(input())\nd = {'M':0 ,'A':0 ,'R':0 ,'C':0 ,'H':0}\nfor i in range(N):\n S = input()\n if S[0] in d:\n d[S[0]] += 1\n\nans = 0\nfor i, j, k in itertools.combinations(d.keys(), 3):\n ans += d[i] * d[j] * d[k]\n\nprint(ans)\n", "import java.util.*;\n\npublic class Main {\n\n public static void main (String[] args) {\n\n Scanner sc = new Scanner(System.in);\n \n int N = sc.nextInt();\n \n String[] S = new String[N];\n\n for (int i = 0; i < N; i++) {\n String s_ = sc.next();\n S[i] = s_.substring(0,1);\n }\n\n sc.close();\n\n // 0:M 1:A 2:R 3:C 4:H\n long[] arr = new long[5];\n\n for (int i = 0; i < N; i++) {\n if (S[i].equals(\"M\")) {\n arr[0]++;\n } else if (S[i].equals(\"A\")) {\n arr[1]++;\n } else if (S[i].equals(\"R\")) {\n arr[2]++;\n } else if (S[i].equals(\"C\")) {\n arr[3]++;\n } else if (S[i].equals(\"H\")) {\n arr[4]++;\n }\n }\n\n long count = 0;\n\n count += arr[0] * arr[1] * arr[2];\n count += arr[0] * arr[1] * arr[3];\n count += arr[0] * arr[1] * arr[4];\n count += arr[0] * arr[2] * arr[3];\n count += arr[0] * arr[2] * arr[4];\n count += arr[0] * arr[3] * arr[4];\n count += arr[1] * arr[2] * arr[3];\n count += arr[1] * arr[2] * arr[4];\n count += arr[1] * arr[3] * arr[4];\n count += arr[2] * arr[3] * arr[4];\n\n System.out.println(count);\n \n }\n\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.run();\n\t}\n\n\tpublic void run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint cnt[] = new int[5];\n\t\tint n=sc.nextInt();\n\t\tfor(int i=0; i<n; i++) {\n\t\t\tswitch(sc.next().charAt(0)) {\n\t\t\tcase 'M':\n\t\t\t\tcnt[0]++;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tcnt[1]++;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tcnt[2]++;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tcnt[3]++;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tcnt[4]++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor(int i=0; i<(1<<5); i++) {\n\t\t\tint c=0;\n\t\t\tlong tmp=0;\n\t\t\tfor(int j=0; j<5; j++) {\n\t\t\t\tif(((i>>j)&1)==1) {\n\t\t\t\t\tif(c==0) {\n\t\t\t\t\t\ttmp = cnt[j];\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttmp = tmp * cnt[j];\n\t\t\t\t\t}\n\t\t\t\t\tc++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(c==3){\n\t\t\t\tans += tmp;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n\n}\n", "#include<iostream>\n#include<string>\n#include<map>\n\nusing namespace std;\n\nstring march = \"MARCH\"; \n\nint main(){\n int n;\n long long ans=0;\n string s[100009];\n map<char, long long> m;\n cin >> n;\n for(int i=0;i<n;i++){\n cin >> s[i];\n m[s[i][0]]++;\n }\n for(int i=0;i<3;i++){\n for(int j=i+2;j<5;j++){\n for(int k=i+1;k<j;k++){\n ans += m[march[i]]*m[march[j]]*m[march[k]];\n }\n }\n }\n cout << ans << endl;\n}", "d={t:0for t in'MARCH'};a=0\nfor t in open(0).read().split():\n if t[0]in d:d[t[0]]+=1\nfor i in range(32):\n c=t=1\n for j,l in enumerate(d.values()):\n if i>>j&1:t*=l;c+=1\n a+=t*(c==4)\nprint(a)", "#include <iostream>\n\nusing namespace std;\ntypedef long long ll;\n\nll m,a,r,c,h;\n\nint main() {\n int n;\n cin >> n;\n for(int i=0; i<n; i++) {\n string s;\n cin >> s;\n if(s[0]=='M') m++;\n if(s[0]=='A') a++;\n if(s[0]=='R') r++;\n if(s[0]=='C') c++;\n if(s[0]=='H') h++;\n }\n ll res = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n cout << res << endl;\n\n}", "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tlong[] name = new long[5];\n\t\tlong count = 0;\n\t\tfor (int i=0; i<N; i++){\n\t\t\tchar ini = sc.next().charAt(0);\n\t\t\tif (ini=='M'){\n\t\t\t\tname[0]++;\t\t\t\t\n\t\t\t}else if (ini=='A'){\n\t\t\t\tname[1]++;\t\t\t\t\n\t\t\t}else if (ini=='R'){\n\t\t\t\tname[2]++;\t\t\t\t\n\t\t\t}else if (ini=='C'){\n\t\t\t\tname[3]++;\t\n\t\t\t}else if (ini=='H'){\n\t\t\t\tname[4]++;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < name.length; i++) {\n\t\t\tfor (int j = i + 1; j < name.length; j++) {\n\t\t\t\tfor (int k = j + 1; k < name.length; k++) {\n\t\t\t\t\tcount += name[i] * name[j] * name[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t}\n\n}", "N = int(input())\nS = [input()[0] for i in range(N)]\nM = S.count(\"M\")\nA = S.count(\"A\")\nR = S.count(\"R\")\nC = S.count(\"C\")\nH = S.count(\"H\")\nprint(M * (A * (R + C + H) + R * (C + H) + C * H) + A * (R * (C + H) + C * H) + R * C * H)\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in); \n\t\tint n = Integer.parseInt(sc.next());\n\t\tString[] s = new String[n];\n\t\tlong[] march = new long[5];\n for(int i=0;i<n;i++){\n s[i] = sc.next();\n if(s[i].charAt(0) == 'M') march[0]++;\n else if(s[i].charAt(0) == 'A') march[1]++;\n else if(s[i].charAt(0) == 'R') march[2]++;\n else if(s[i].charAt(0) == 'C') march[3]++;\n else if(s[i].charAt(0) == 'H') march[4]++;\n else continue;\n }\n long ans = 0;\n for(int i=0; i<3; i++) {\n for(int j=i+1; j<4; j++) {\n for(int k=j+1; k<5; k++) {\n ans += march[i]*march[j]*march[k];\n }\n }\n }\n System.out.println(ans);\n\t}\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tint n = Integer.parseInt(br.readLine());\n\n\t\tint a[] = { 0, 0, 0, 0, 0, 0, 1, 1, 1, 2 };\n\t\tint b[] = { 1, 1, 1, 2, 2, 3, 2, 2, 3, 3 };\n\t\tint c[] = { 2, 3, 4, 3, 4, 4, 3, 4, 4, 4 };\n\n\t\tlong value[] = new long[5];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString str[] = br.readLine().split(\"\");\n\n\t\t\tif (str[0].equals(\"M\")) {\n\t\t\t\tvalue[0]++;\n\t\t\t} else if (str[0].equals(\"A\")) {\n\t\t\t\tvalue[1]++;\n\t\t\t} else if (str[0].equals(\"R\")) {\n\t\t\t\tvalue[2]++;\n\t\t\t} else if (str[0].equals(\"C\")) {\n\t\t\t\tvalue[3]++;\n\t\t\t} else if (str[0].equals(\"H\")) {\n\t\t\t\tvalue[4]++;\n\t\t\t}\n\t\t}\n\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tans += value[a[i]] * value[b[i]] * value[c[i]];\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import itertools\nN = input()\nS = [raw_input() for _ in range(N)]\nnums = {}\nfor s in S:\n initial = s[0]\n if not initial in nums:\n nums[initial] = 1\n else:\n nums[initial] += 1\n\nres = 0\nfor a, b, c in itertools.combinations('MARCH', 3):\n if a not in nums or b not in nums or c not in nums:\n continue\n res += nums[a] * nums[b] * nums[c]\nprint res\n\n", "\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.concurrent.atomic.AtomicLong;\n\npublic class Main {\n public static void main(final String[] args) {\n final Scanner scanner = new Scanner(System.in);\n final Set<String> march = new HashSet<>(Arrays.asList(\"MARCH\".split(\"\")));\n final Map<String, AtomicLong> countMap = new HashMap<>();\n final int n = scanner.nextInt();\n scanner.nextLine();\n for (int i = 0; i < n; i++) {\n final String prefix = scanner.nextLine().split(\"\")[0];\n if (march.contains(prefix)) {\n countMap.computeIfAbsent(prefix, count -> new AtomicLong())\n .incrementAndGet();\n }\n }\n\n final List<AtomicLong> counts = new ArrayList<>(countMap.values());\n long answer = 0;\n\n for (int i = 0; i < counts.size() - 2; i++) {\n for (int j = i + 1; j < counts.size() - 1; j++) {\n for (int k = j + 1; k < counts.size(); k++) {\n answer += counts.get(i).get() * counts.get(j).get() * counts.get(k).get();\n }\n }\n }\n\n System.out.println(answer);\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] cnt = new long[5];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tchar ch = sc.next().charAt(0);\n\t\t\tif (ch == 'M') cnt[0]++;\n\t\t\tif (ch == 'A') cnt[1]++;\n\t\t\tif (ch == 'R') cnt[2]++;\n\t\t\tif (ch == 'C') cnt[3]++;\n\t\t\tif (ch == 'H') cnt[4]++;\n\t\t}\n\t\tsc.close();\n\n\t\tint c = 0;\n\t\tfor (int i = 0; i < cnt.length; i++) {\n\t\t\tif (cnt[i] > 0) c++;\n\t\t}\n\t\tif (c < 3) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\n\t\tlong ans = 0L;\n\t\tfor (int i = 0; i < cnt.length; i++) {\n\t\t\tfor (int j = i + 1; j < cnt.length; j++) {\n\t\t\t\tfor (int k = j + 1; k < cnt.length; k++) {\n\t\t\t\t\tans += cnt[i] * cnt[j] * cnt[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint N = in.nextInt(); in.nextLine();\n\t\tint[] ary = new int[5];\n\t\twhile( N-- > 0 ) {\n\t\t\tchar c = in.nextLine().charAt(0);\n\t\t\tswitch(c) {\n\t\t\t\tcase 'M': ary[0]++; break;\n\t\t\t\tcase 'A': ary[1]++; break;\n\t\t\t\tcase 'R': ary[2]++; break;\n\t\t\t\tcase 'C': ary[3]++; break;\n\t\t\t\tcase 'H': ary[4]++; break;\n\t\t\t\tdefault: break;\n\t\t\t}\n\t\t}\n\t\t//Arrays.fill(ary,20000);\n\t\t//System.out.println(Arrays.toString(ary));\n\t\tlong total = 0;\n\t\tfor( int i = 0; i < 3; i++ ) {\n\t\t\tfor( int j = i+1; j < 4; j++ ) {\n\t\t\t\tfor( int k = j+1 ; k < 5; k++ ) {\n\t\t\t\t\ttotal += (long)ary[i]*ary[j]*ary[k];\n\t\t\t\t\t//System.out.printf(\"%d %d %d\\n\",i,j,k);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(total);\n\t}\n}", "import java.io.*;\n \npublic class Main{\n public static void main(String[] args) {\n try {\n long result;\n int n, i = 0;\n long num[] = {0, 0, 0, 0, 0};\n \n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n \n n = Integer.parseInt(reader.readLine());\n String name[] = new String[n];\n char nameF[] = new char[n];\n \n for(i = 0; i < n; i++){\n name[i] = reader.readLine();\n }\n \n for(i = 0; i < n; i++){\n nameF[i] = name[i].charAt(0);\n }\n \n for(i = 0; i < n; i++){\n if (nameF[i] == 'M') {\n num[0] = ++num[0];\n }\n if (nameF[i] == 'A') {\n num[1] = ++num[1];\n }\n if (nameF[i] == 'R') {\n num[2] = ++num[2];\n }\n if (nameF[i] == 'C') {\n num[3] = ++num[3];\n }\n if (nameF[i] == 'H') {\n num[4] = ++num[4];\n }\n }\n \n result = num[0]*num[1]*(num[2]+num[3]+num[4])+num[0]*num[2]*(num[3]+num[4])+num[0]*num[3]*num[4]\n +num[1]*num[2]*(num[3]+num[4])+num[1]*num[3]*num[4] + num[2]*num[3]*num[4];\n \n System.out.println(result);\n }\n catch (Exception e) {\n \n }\n }\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nlong long cnt[27];\nstring MARCH = \"MARCH\";\n\nint main(){\n int N;cin>>N;\n for(int i=0;i<N;i++){\n\tstring s;cin>>s;\n cnt[s[0] - 'A']++;\n }\n \n long long ans = 0;\n for(int i=0;i<5;i++){\n\tfor(int j=i+1;j<5;j++){\n\t for(int k=j+1;k<5;k++){\n\t\tans += cnt[MARCH[i]-'A'] * cnt[MARCH[j]-'A'] * cnt[MARCH[k]-'A'];\n }\n\t}\n }\n \n cout<<ans<<endl;\n \n return 0;\n}\n", "from itertools import combinations\nfrom collections import Counter\n\nN = int(input())\ncnt = Counter([input()[0] for _ in range(N)])\nans = sum(cnt[i] * cnt[j] * cnt[k] for i, j, k in combinations('MARCH', 3))\nprint(ans)", "from collections import Counter\nfrom itertools import combinations\n\nN = int(input())\nS = [input() for i in range(N)]\n\nxs = Counter(s[0] for s in S)\n\nprint(sum(xs[a] * xs[b] * xs[c] for a, b, c in combinations(\"MARCH\", 3)))\n", "from collections import Counter\nimport itertools\n\nN = int(input())\nname = Counter([input()[0] for _ in range(N)])\n\nans = 0\n\nfor i,j,k in itertools.combinations('MARCH',3):\n ans += name[i] * name[j] * name[k]\nprint(ans)", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nN = input()\nm = 0\na = 0\nr = 0\nc = 0\nh = 0\nfor i in range(N):\n\tS = raw_input()\n\tif S[:1] == \"M\":\n\t\tm += 1\n\telif S[:1] == \"A\":\n\t\ta += 1\n\telif S[:1] == \"R\":\n\t\tr += 1\n\telif S[:1] == \"C\":\n\t\tc += 1\n\telif S[:1] == \"H\":\n\t\th += 1\nprint m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h\t", "from itertools import*;c=list(zip(*open(0).readlines()))[0].count;print(sum(c(p)*c(q)*c(r)for p,q,r in combinations('MARCH',3)))", "#include <iostream>\nusing namespace std;\n\nint main() {\n\t long long int n,ans=0;\ncin>>n;\nstring s;\nlong long int a[26]={};\n\nfor(int i=0;i<n;i++){\ncin>>s;\na[s[0]-'A']++;\n}\n\nint x[5]={0,2,7,12,17};\n\nfor(int i=0;i<5;i++){\nfor(int j=i+1;j<5;j++){\nfor(int k=j+1;k<5;k++){\nans+=a[x[i]]*a[x[j]]*a[x[k]];\n}\n}\n}\n\ncout<<ans;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint n;\nchar s[15];\nlong long an[10];\nlong long ans;\nint main()\n{\n\tscanf(\"%d\",&n);\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\"%s\",s);\n\t\tif(s[0]=='M') an[1]++;\n\t\tif(s[0]=='A') an[2]++;\n\t\tif(s[0]=='R') an[3]++;\n\t\tif(s[0]=='C') an[4]++;\n\t\tif(s[0]=='H') an[5]++;\n\t}\n\tfor(int i=1;i<=3;i++)\n\t\tfor(int j=i+1;j<=4;j++)\n\t\t\tfor(int k=j+1;k<=5;k++)\n\t\t\t\tans+=an[i]*an[j]*an[k];\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "import itertools\nN = int(input())\nS = [input()[0] for T in range(N)]\nMARCH = [S.count('M'),S.count('A'),S.count('R'),S.count('C'),S.count('H')]\nTotal = 0\nfor T in itertools.combinations(MARCH,3):\n Total += T[0]*T[1]*T[2]\nprint(Total)", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n static Map<String, Integer> map = new HashMap<>();\n static {\n map.put(\"M\", 0);\n map.put(\"A\", 1);\n map.put(\"R\", 2);\n map.put(\"C\", 3);\n map.put(\"H\", 4);\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = Integer.parseInt(sc.nextLine());\n\n int[] march = new int[5];\n for (int i = 0; i < N; i++) {\n String initial = String.valueOf(sc.next().charAt(0));\n if (map.containsKey(initial)) {\n march[map.get(initial)]++;\n }\n }\n\n long ans = solve(N, march);\n\n System.out.println(ans);\n }\n\n public static long solve(int n, int[] march) {\n long ans = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i + 1; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n int mi = march[i];\n int mj = march[j];\n int mk = march[k];\n ans += (long) mi * mj * mk;\n }\n }\n }\n return ans;\n }\n}\n", "n=int(input())\nL=[input()[0] for _ in range(n)]\nL=[L.count(s) for s in 'MARCH']\na=0\nfor i in range(3):\n for j in range(i+1,4):\n for k in range(j+1,5):\n a+=L[i]*L[j]*L[k]\nprint(a)", "#include <bits/stdc++.h>\nusing namespace std;\n\nstring t = \"MARCH\";\nint cnt[5];\n\nint main()\n{\n string s;\n int n;\n cin >> n;\n while (n--)\n {\n cin >> s;\n int pos = t.find(s[0]);\n if (~pos) cnt[pos]++;\n }\n long long ans = 0;\n for (int i = 0; i < 5; i++)\n for (int j = i + 1; j < 5; j++)\n for (int k = j + 1; k < 5; k++)\n ans += 1LL * cnt[i] * cnt[j] * cnt[k];\n cout << ans << endl;\n return 0;\n}", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n static public final char[] n = new char[]{'M', 'A', 'R', 'C', 'H'};\n static public Map<Character, Integer> map = new HashMap<Character, Integer>();\n public static void main(String[] args) {\n for (int i = 0; i < 5; i++) map.put(n[i], 0);\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n for (int i = 0; i < N; i++) {\n char c = sc.next().toCharArray()[0];\n if(map.containsKey(c)) map.put(c, map.get(c) + 1);\n }\n long ans = 0;\n for (int i = 0; i < 3; i++) {\n if(map.get(n[i]) == 0) continue;\n for (int j = i + 1; j < 4; j++) {\n if(map.get(n[j]) == 0) continue;\n for (int k = j + 1; k < 5; k++) {\n if(map.get(n[k]) == 0) continue;\n ans += (long)map.get(n[i]) * map.get(n[j]) * map.get(n[k]);\n }\n }\n }\n\n System.out.println(ans);\n sc.close();\n }\n\n}\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <math.h>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\nmap<char,ll> m;\nll n;cin>>n;\nfor(int i=0;i<n;i++){\n string s;cin>>s;\n m[s[0]]++;\n}\nvector<ll> v(5);\nv[0]=m['M'];\nv[1]=m['A'];\nv[2]=m['R'];\nv[3]=m['C'];\nv[4]=m['H'];\nll ans=0;\nfor(int i=0;i<5;i++)for(int j=i+1;j<5;j++)for(int z=j+1;z<5;z++){\n ans+=ll(v[i]*v[j]*v[z]);\n}\ncout<<ans;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n long long n;\n cin >> n;\n long long a[5]={0};\n for(int i=0;i<n;i++){\n string s;\n cin >> s;\n if(s[0]=='M')a[0]++;\n if(s[0]=='A')a[1]++;\n if(s[0]=='R')a[2]++;\n if(s[0]=='C')a[3]++;\n if(s[0]=='H')a[4]++;\n }\n sort(a,a+4);\n long long ans=0;\n for(int i=0;i<5;i++)for(int j=i+1;j<5;j++)for(int k=j+1;k<5;k++)ans+=a[i]*a[j]*a[k];\n cout << ans << endl;\n}", "import collections\ncc = collections.Counter()\nfor _ in range(int(raw_input())): \n\tcc[raw_input()[0]] +=1\t\n\ndef dfs(i, total ,cumul, cc, k, s):\n\tif i == len(s) or k == 0:\n\t\tif k == 0: total[0] += cumul\n\t\treturn \n\tif k:\n\t\tdfs(i+1, total, cumul * cc[s[i]], cc,k - 1, s)\n\n\tdfs(i+1, total, cumul, cc, k, s)\n\ntotal = [0]\ndfs(0, total, 1 , cc, 3, 'MARCH')\nprint total[0]", "import java.util.Scanner;\n\npublic class Main {\n\n\tstatic int[] f = { 0, 0, 0, 0, 0, 0, 1, 1, 1, 2 };\n\tstatic int[] s = { 1, 1, 1, 2, 2, 3, 2, 2, 3, 3 };\n\tstatic int[] t = { 2, 3, 4, 3, 4, 4, 3, 4, 4, 4 };\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint N = in.nextInt();\n\t\tlong[] count = new long[5];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tString S = in.next();\n\t\t\tif (S.charAt(0) == 'M') {\n\t\t\t\tcount[0]++;\n\t\t\t}\n\t\t\tif (S.charAt(0) == 'A') {\n\t\t\t\tcount[1]++;\n\t\t\t}\n\t\t\tif (S.charAt(0) == 'R') {\n\t\t\t\tcount[2]++;\n\t\t\t}\n\t\t\tif (S.charAt(0) == 'C') {\n\t\t\t\tcount[3]++;\n\t\t\t}\n\t\t\tif (S.charAt(0) == 'H') {\n\t\t\t\tcount[4]++;\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tans += count[f[i]] * count[s[i]] * count[t[i]];\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tin.close();\n\t}\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin>>n;\n\t\n\tstring s[100000];\n\tlong long m=0,a=0,r=0,c=0,h=0;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>s[i];\n\t\t\n\t\tif(s[i][0]=='M') m++;\n\t\tif(s[i][0]=='A') a++;\n\t\tif(s[i][0]=='R') r++;\n\t\tif(s[i][0]=='C') c++;\n\t\tif(s[i][0]=='H') h++;\n\t}\n\t\n\tcout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;\n\t\n\treturn 0;\n}", "from itertools import combinations\nn, *S = open(0).read().split()\n# 頭文字だけ抜き出す.\ncap = [s[0] for s in S]\n# M,A,R,C,H,それぞれ頭文字の中にある数をカウント.\ncnt = [cap.count(i) for i in \"MARCH\"]\n# 組み合わせの合計を取る.\nans = sum(x*y*z for x, y, z in combinations(cnt, 3))\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[5];\n\t\tsc.nextLine();\n\t\twhile (n-- > 0) {\n\t\t\tString s = sc.nextLine();\n\t\t\tif (s.length() == 0) continue;\n\t\t\tswitch (s.charAt(0)) {\n\t\t\t\tcase 'M':\n\t\t\t\t\ta[0]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'A':\n\t\t\t\t\ta[1]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'R':\n\t\t\t\t\ta[2]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'C':\n\t\t\t\t\ta[3]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'H':\n\t\t\t\t\ta[4]++;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tlong answer = 0;\n\t\tfor (int i = 0; i < a.length - 2; i++) {\n\t\t\tfor (int j = i + 1; j < a.length - 1; j++) {\n\t\t\t\tfor (int k = j + 1; k < a.length; k++) {\n\t\t\t\t\tanswer += a[i] * a[j] * a[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\n\t}\n}\n", "#include <iostream>\nusing namespace std;\n \nint main() \n{\n\tlong i,j,n,ans=0;\n\tlong m=0,a=0,r=0,c=0,h=0;\n\tstring s[100001];\n \tcin >> n;\n\n\tfor(i=0;i<n;i++){\n\t\tcin >> s[i];\n\t} \n\tfor(i=0;i<n;i++){\n\t\tif(s[i][0]=='M'){\n\t\t\tm++;\n\t\t}\n\t\tif(s[i][0]=='A'){\n\t\t\ta++;\n\t\t}\n\t\tif(s[i][0]=='R'){\n\t\t\tr++;\n\t\t}\n\t\tif(s[i][0]=='C'){\n\t\t\tc++;\n\t\t}\n\t\tif(s[i][0]=='H'){\n\t\t\th++;\n\t\t}\n\t} \n\tans=(m*a*r)+(m*a*c)+(m*a*h)+(m*r*c)+(m*r*h)+(m*c*h)+(a*r*c)+(a*r*h)+(a*c*h)+(r*c*h);\n\tcout << ans << endl;\n\treturn 0;\n}", "from itertools import combinations\nfrom collections import Counter\ns = 0\nn = int(input())\nl = Counter(list(input()[0] for _ in range(n)))\nfor a,b,c in combinations(\"MARCH\",3):\n s += l[a]*l[b]*l[c]\nprint(s)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] a = new long[5];\n for (int i = 0; i < n; i++) {\n String s = sc.next();\n if (s.charAt(0) == 'M') {\n a[0]++;\n } else if (s.charAt(0) == 'A') {\n a[1]++;\n } else if (s.charAt(0) == 'R') {\n a[2]++;\n } else if (s.charAt(0) == 'C') {\n a[3]++;\n } else if (s.charAt(0) == 'H') {\n a[4]++;\n }\n }\n long ans = a[0]*a[1]*a[2] + a[0]*a[1]*a[3] + a[0]*a[1]*a[4] + a[0]*a[2]*a[3] + a[0]*a[2]*a[4] +\n a[0]*a[3]*a[4] + a[1]*a[2]*a[3] + a[1]*a[2]*a[4] + a[1]*a[3]*a[4] + a[2]*a[3]*a[4];\n System.out.println(ans);\n }\n}\n", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Map<Character, Integer> map = new HashMap<>();\n char[] chars = {'M', 'A', 'R', 'C', 'H'};\n for(int i = 0; i < chars.length; i++){\n map.put(chars[i], 0);\n }\n for(int i = 0; i < n; i++){\n switch(sc.next().charAt(0)){\n case 'M':\n map.put('M', map.get('M')+1);\n break;\n case 'A':\n map.put('A', map.get('A')+1);\n break;\n case 'R':\n map.put('R', map.get('R')+1);\n break;\n case 'C':\n map.put('C', map.get('C')+1);\n break;\n case 'H':\n map.put('H', map.get('H')+1);\n break;\n default:\n break;\n }\n }\n long sum = 0;\n for(int i = 0; i <= 2; i++){\n for(int j = i + 1; j <= 3; j++){\n for(int k = j + 1; k <= 4; k++){\n sum += (long)map.get(chars[i]) * map.get(chars[j]) * map.get(chars[k]);\n }\n }\n }\n System.out.println(sum);\n }\n}", "from itertools import*;o=ord;d=[0]*128\nfor t in open(0).read().split():d[o(t[0])]+=1\nprint(sum(d[o(p)]*d[o(q)]*d[o(r)]for p,q,r in combinations('MARCH',3)))", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int N = in.nextInt();\n long[] cnt = new long[5];\n String march = \"MARCH\";\n for (int i = 0; i < N; i++) {\n char ini = in.next().charAt(0);\n int find = march.indexOf(ini);\n if (find > -1) {\n cnt[find]++;\n }\n }\n long ans = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i + 1; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += cnt[i] * cnt[j] * cnt[k];\n }\n }\n }\n out.println(ans);\n }\n\n }\n}\n\n", "from itertools import combinations\nfrom collections import Counter\nN = int(input())\nctr = Counter([input()[0] for i in range(N)])\n\nans = 0\nfor i,j,k in combinations('MARCH',3):\n ans += ctr[i]*ctr[j]*ctr[k]\nprint(ans)", "import java.util.*;\n\nimport static java.lang.System.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n\n long[] startNum = new long['Z' - 'A' + 1];\n for (int i = 0; i < N; i++) {\n String str = sc.next();\n startNum[str.charAt(0) - 'A']++;\n }\n\n long comb = 0;\n char[] march = new char[]{'M', 'A', 'R', 'C', 'H' };\n\n for (int i = 0; i < march.length; i++) {\n for (int j = i + 1; j < march.length; j++) {\n for (int k = j + 1; k < march.length; k++) {\n comb += startNum[march[i] - 'A'] * startNum[march[j] - 'A'] * startNum[march[k] - 'A'];\n }\n }\n }\n out.println(comb);\n }\n}", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n C solver = new C();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class C {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n // 入力\n int n = Integer.parseInt(in.next());\n // 出現する頭文字の回数\n int[] ins = new int[5];\n for (int i = 0; i < n; i++) {\n String tmp = in.next();\n if (tmp.startsWith(\"M\")) ins[0]++;\n if (tmp.startsWith(\"A\")) ins[1]++;\n if (tmp.startsWith(\"R\")) ins[2]++;\n if (tmp.startsWith(\"C\")) ins[3]++;\n if (tmp.startsWith(\"H\")) ins[4]++;\n }\n long ans = 0;\n // ありうるMARCHの組合せ\n int[] c1 = {0, 0, 0, 0, 0, 0, 1, 1, 1, 2};\n int[] c2 = {1, 1, 1, 2, 2, 3, 2, 2, 3, 3};\n int[] c3 = {2, 3, 4, 3, 4, 4, 3, 4, 4, 4};\n\n for (int i = 0; i < 10; i++) {\n ans += (long) ins[c1[i]] * (long) ins[c2[i]] * (long) ins[c3[i]];\n }\n\n // 出力\n out.println(ans);\n\n }\n\n }\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); i++) \n#define all(v) begin(v),end(v)\nusing ll = long long;\n\nint main() {\n int n;cin>>n;\n string t=\"MARCH\";\n vector<ll> vec(5);\n rep(i,n){\n string s;cin>>s;\n rep(j,5){\n if(s[0]==t[j])vec[j]++;\n }\n }\n ll ans=0;\n rep(i,3)for(int j=i+1;j<4;j++)for(int k=j+1;k<5;k++){\n ans+=vec[i]*vec[j]*vec[k];\n }\n cout<<ans<<endl;\n}", "from itertools import combinations as c\nfrom operator import mul\nd = {k: 0 for k in 'MARCH'}\nfor _ in xrange(input()):\n n = raw_input()[0]\n if n in 'MARCH':\n d[n] += 1\nr = [k for k, v in d.iteritems() if v]\nprint sum([reduce(mul, [d[k] for k in _]) for _ in c(r, 3)])\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\nLL num[5]={0},n,ans=0;\nint main(){\n\tLL i,j,k;\n\tcin>>n;\n\tchar s[50];\n\twhile(n--){\n\t\tscanf(\"%s\",s);\n\t\tif(s[0]=='M')num[0]++;\n\t\tif(s[0]=='A')num[1]++;\n\t\tif(s[0]=='R')num[2]++;\n\t\tif(s[0]=='C')num[3]++;\n\t\tif(s[0]=='H')num[4]++;\n\t}\n\tn=0;\n\tfor(i=0;i<5;i++){\n\t\tfor(j=i+1;j<5;j++){\n\t\t\tfor(k=j+1;k<5;k++){\n\t\t\t\tans+=(num[i]*num[j]*num[k]);\n\t\t\t\tn++;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n static final char[] BEGINS = { 'M', 'A', 'R', 'C', 'H' };\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int N = sc.nextInt();\n String[] S = new String[N];\n for (int i = 0; i < S.length; ++i) {\n S[i] = sc.next();\n }\n\n System.out.println(solve(S));\n\n sc.close();\n }\n\n static long solve(String[] S) {\n Map<Character, Integer> beginToCount = new HashMap<>();\n for (String name : S) {\n char begin = name.charAt(0);\n\n beginToCount.put(begin, beginToCount.getOrDefault(begin, 0) + 1);\n }\n\n long result = 0;\n for (int i = 0; i < BEGINS.length; ++i) {\n for (int j = i + 1; j < BEGINS.length; ++j) {\n for (int k = j + 1; k < BEGINS.length; ++k) {\n result += (long) beginToCount.getOrDefault(BEGINS[i], 0) * beginToCount.getOrDefault(BEGINS[j], 0)\n * beginToCount.getOrDefault(BEGINS[k], 0);\n }\n }\n }\n\n return result;\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\n\t\tint[] a = new int[5];\n\t\tString march = \"MARCH\";\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString s = sc.next();\n\t\t\tint idx = march.indexOf(s.charAt(0));\n\t\t\tif (idx != -1)\n\t\t\t\ta[idx]++;\n\t\t}\n\n\t\tlong ret = 0;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\t\tlong k2 = a[i] * a[j];\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tret += k2 * a[k];\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ret);\n\t}\n}\n", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n Map<String, Long> h = new HashMap<>();\n h.put(\"M\", 0L);\n h.put(\"A\", 0L);\n h.put(\"R\", 0L);\n h.put(\"C\", 0L);\n h.put(\"H\", 0L);\n for (int i = 0; i < n; i++) {\n String s = sc.next();\n if (h.containsKey(s.substring(0, 1))) {\n h.put(s.substring(0, 1), h.get(s.substring(0, 1)) + 1L);\n }\n }\n sc.close();\n long ans = 0;\n ans += h.get(\"M\") * h.get(\"A\") * h.get(\"R\");\n ans += h.get(\"M\") * h.get(\"A\") * h.get(\"C\");\n ans += h.get(\"M\") * h.get(\"A\") * h.get(\"H\");\n ans += h.get(\"M\") * h.get(\"R\") * h.get(\"C\");\n ans += h.get(\"M\") * h.get(\"R\") * h.get(\"H\");\n ans += h.get(\"M\") * h.get(\"C\") * h.get(\"H\");\n ans += h.get(\"A\") * h.get(\"R\") * h.get(\"C\");\n ans += h.get(\"A\") * h.get(\"R\") * h.get(\"H\");\n ans += h.get(\"A\") * h.get(\"C\") * h.get(\"H\");\n ans += h.get(\"R\") * h.get(\"C\") * h.get(\"H\");\n System.out.println(ans);\n }\n}", "n=int(raw_input())\ns=[str(raw_input()) for i in range(n)]\nm,a,r,c,h=0,0,0,0,0\nfor i in range(n):\n\tif s[i][0]==\"M\":\n\t\tm+=1\n\telif s[i][0]==\"A\":\n\t\ta+=1\n\telif s[i][0]==\"R\":\n\t\tr+=1\n\telif s[i][0]==\"C\":\n\t\tc+=1\n\telif s[i][0]==\"H\":\n\t\th+=1\n\nsl=[m,a,r,c,h]\ntl=[[1,1,1,0,0],[1,1,0,1,0],[1,1,0,0,1],[1,0,1,1,0],[1,0,1,0,1],[1,0,0,1,1],[0,1,1,1,0],[0,1,1,0,1],[0,1,0,1,1],[0,0,1,1,1]]\n\nans=[]\n\nfor i in range(10):\n\ttmpl=[]\n\tctr=0\n\tfor k in range(5):\n\t\tif tl[i][k]*sl[k]!=0:\n\t\t\tctr+=1\n\t\t\ttmpl.append(tl[i][k]*sl[k])\n\tif ctr==3:\n\t\tans.append(tmpl[0]*tmpl[1]*tmpl[2])\nprint sum(ans)\n", "n = int(input())\nS = ''\n\nfor i in range(n):\n S += input()[0]\n \nm = S.count('M')\na = S.count('A')\nr = S.count('R')\nc = S.count('C')\nh = S.count('H')\n\nprint(m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h)", "from itertools import*;d={}\nfor t in open(0).read().split():d[t[0]]=d.get(t[0],0)+1\nprint(sum(p*q*r for p,q,r in combinations([d.get(t,0)for t in'MARCH'],3)))", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n long long N, ans=0;\n cin >> N;\n string S[N];\n long long M=0, A=0, R=0, C=0, H=0;\n for(int i=0; i<N; i++) {\n cin >> S[i];\n if(S[i][0]=='M') {\n M++;\n }\n if(S[i][0]=='A') {\n A++;\n }\n if(S[i][0]=='R') {\n R++;\n }\n if(S[i][0]=='C') {\n C++;\n }\n if(S[i][0]=='H') {\n H++;\n }\n }\n ans=M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H;\n cout << ans << endl;\n}", "from itertools import combinations\nn, *S = open(0).read().split()\nn = int(n)\nmarch = []\nfor c in 'MARCH':\n march.append(len([s for s in S if s[0] == c]))\nans = 0\nfor a, b, c in combinations(march, 3):\n ans += a*b*c\nprint(ans)", "#include <iostream>\nusing namespace std;\n#include <algorithm>\n\n#define REP(i,a,b) for(int64_t i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\nchar c[5] = {'M', 'A', 'R', 'C', 'H'};\nint64_t a[5];\n\nint main(){\nrep(i,5) a[i] = 0;\n\nint64_t n;\ncin >> n;\n\nrep(i,n){\n\tchar tmp[15];\n\tcin >> tmp;\n\trep(j,5){\n\t\tif(tmp[0] == c[j]){ a[j]++;}\n\t}\n}\n\nint64_t out = 0;\nrep(i,5){ REP(j,i+1,5){ REP(k,j+1,5){\n\tout += a[i] * a[j] * a[k];\n}}}\n\ncout << out <<endl;\n\nreturn 0;\n}\n", "#include <cstdio>\n#define MAXN 14\n\nint main(void)\n{\n\n\tlong long i,c0,c1,c2,N,m[5]={0};\n\tlong long s;\n\tchar name[MAXN];\n\tconst char sign[7]=\"MARCH\";\n\tscanf(\"%lld\",&N);\n\tfor(i=0;i<N;i++)\n\t{\n\t\tscanf(\"%s\",name);\n\t\tfor(int j=0;j<5;j++)\n\t\t\tif(name[0]==sign[j])\n\t\t\t\tm[j]++;\n\t}\n\ts=0;\n\tfor(c0=0;c0<5;c0++)\n\t\tfor(c1=c0+1;c1<5;c1++)\n\t\t\tfor(c2=c1+1;c2<5;c2++)\n\t\t\t\ts+=m[c0]*m[c1]*m[c2];\n\tprintf(\"%lld\\n\",s);\n\treturn 0;\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); i++) \n#define all(v) begin(v),end(v)\nusing ll = long long;\n\nint main() {\n int n;cin>>n;\n vector<ll> vec(5);\n string t=\"MARCH\";\n rep(i,n){\n string s;cin>>s;\n rep(j,5){\n if(s[0]==t[j])vec[j]++;\n }\n }\n ll ans=0;\n rep(i,3)for(int j=i+1;j<4;j++)for(int k=j+1;k<5;k++){\n ans+=vec[i]*vec[j]*vec[k];\n }\n cout<<ans<<endl;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String args[]) throws IOException{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t//StringTokenizer st = new StringTokenizer(br.readLine());\n\t\t\n\t\t//StringBuilder sb = new StringBuilder();\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint arr[] = new int[5];\n\t\t\n\t\tfor(int i=0;i<n;i++){\n\t\t\tchar c = sc.next().charAt(0);\n\t\t\tswitch(c){\n\t\t\tcase 'M':\n\t\t\t\tarr[0]++;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tarr[1]++;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tarr[2]++;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tarr[3]++;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tarr[4]++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans = 0;\n\t\tfor(int i=0;i<5;i++){\n\t\t\tfor(int j=i+1;j<5;j++){\n\t\t\t\tfor(int k=j+1;k<5;k++){\n\t\t\t\t\tans += (long)arr[i]*arr[j]*arr[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[]) {\n\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\n\t\t\tint n = sc.nextInt();\n\t\t\tsc.nextLine();\n\n\t\t\tMap<String, Long> map = new HashMap<>();\n\t\t\tfor (int i = 0; i < n; i++) {\n\n\t\t\t\tString s = sc.nextLine();\n\t\t\t\tif (!s.matches(\"^[MARCH].*$\")) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tinc(map, s.substring(0, 1));\n\n\t\t\t}\n\n\t\t\tlong ans = 0;\n\t\t\tList<Long> list = new ArrayList<>(map.values());\n\t\t\tfor (int i = 0; i < list.size() - 2; i++) {\n\t\t\t\tfor (int j = i + 1; j < list.size() - 1; j++) {\n\t\t\t\t\tfor (int k = j + 1; k < list.size(); k++) {\n\n\t\t\t\t\t\tlong c = 1;\n\t\t\t\t\t\tc *= list.get(i).longValue();\n\t\t\t\t\t\tc *= list.get(j).longValue();\n\t\t\t\t\t\tc *= list.get(k).longValue();\n\n\t\t\t\t\t\tans += c;\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\n\t\t}\n\n\t}\n\n\tprivate static final <T> void inc(Map<T, Long> map, T key) {\n\n\t\tLong val = map.get(key);\n\n\t\tif (null == val) {\n\t\t\tval = Long.valueOf(1);\n\n\t\t} else {\n\t\t\tval = Long.valueOf(val.longValue() + 1);\n\t\t}\n\n\t\tmap.put(key, val);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n int n;\n cin>>n;\n string m=\"MARCH\";\n map<char,int> c;\n for (int i=0;i<n;i++) {\n string s;cin>>s;\n c[s[0]]++;\n }\n ll ans=0;\n for (int i=0;i<5;i++)\n for (int j=i+1;j<5;j++)\n for (int k=j+1;k<5;k++)\n ans+=(ll)c[m[i]]*c[m[j]]*c[m[k]];\n cout<<ans<<endl;\n return 0;\n}", "import java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint N = sc.nextInt();\n\t\tString[] S = new String[N];\n\n\t\tfor(int i = 0 ; i < N ; i++){\n\t\t\tS[i] = sc.next();\n\t\t}\n\n\t\tsc.close();\n\n\n\n\t\tint tmp = N;\n\t\tlong M = 0;\n\t\tlong A = 0;\n\t\tlong R = 0;\n\t\tlong C = 0;\n\t\tlong H = 0;\n\n\t\tfor(int i = 0 ; i < N ; i++){\n\t\t\tif(!S[i].substring(0, 1).equals(\"M\") && !S[i].substring(0, 1).equals(\"A\") && !S[i].substring(0, 1).equals(\"R\") && !S[i].substring(0, 1).equals(\"C\") && !S[i].substring(0, 1).equals(\"H\")){\n\t\t\t\ttmp--;\n\t\t\t}\n\t\t\telse if(S[i].substring(0, 1).equals(\"M\")){\n\t\t\t\tM++;\n\t\t\t}\n\t\t\telse if(S[i].substring(0, 1).equals(\"A\")){\n\t\t\t\tA++;\n\t\t\t}\n\t\t\telse if(S[i].substring(0, 1).equals(\"R\")){\n\t\t\t\tR++;\n\t\t\t}\n\t\t\telse if(S[i].substring(0, 1).equals(\"C\")){\n\t\t\t\tC++;\n\t\t\t}\n\t\t\telse if(S[i].substring(0, 1).equals(\"H\")){\n\t\t\t\tH++;\n\t\t\t}\n\t\t}\n\n\t\tif(tmp == 0){\n\t\t\tSystem.out.println(\"0\");\n\t\t}\n\t\telse{\n\t\t\tlong[] T = {M,A,R,C,H};\n\n\t\t\tlong ans = 0;\n\t\t\tfor(int i = 0 ; i < 5 ; i++){\n\t\t\t\tfor(int j = i+1 ; j < 5 ; j++){\n\t\t\t\t\tfor(int k = j+1 ; k < 5 ; k++){\n\t\t\t\t\t\tans += (T[i]*T[j]*T[k]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\t\t}\n\n\t}\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n long list[] = {0,0,0,0,0};\n for(int x=1;x<=n;x++) {\n String first = sc.next();\n String top = first.substring(0,1);\n if(top.equals(\"M\")) {\n list[0] += 1;\n }\n if(top.equals(\"A\")) {\n list[1] += 1;\n }\n if(top.equals(\"R\")) {\n list[2] += 1;\n }\n if(top.equals(\"C\")) {\n list[3] += 1;\n }\n if(top.equals(\"H\")) {\n list[4] += 1;\n }\n }\n System.out.println(list[0]*list[1]*list[2]+list[0]*list[1]*list[3]+list[0]*list[1]*list[4]+list[0]*list[2]*list[3]+list[0]*list[2]*list[4]+list[0]*list[3]*list[4]+list[1]*list[2]*list[3]+list[1]*list[2]*list[4]+list[1]*list[3]*list[4]+list[2]*list[3]*list[4]);\n }\n}\n", "from itertools import*;d=[0]*91\nfor _ in[0]*int(input()):d[ord(input()[0])]+=1\nprint(sum(p*q*r for p,q,r in combinations([d[ord(t)]for t in'MARCH'],3)))", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n int n;\n string s;\n cin >> n;\n int i;\n long long a[5]={},ans=0;\n for(i=0;i<n;i++){\n cin >> s;\n if(s[0]=='M')a[0]++;\n if(s[0]=='A')a[1]++;\n if(s[0]=='R')a[2]++;\n if(s[0]=='C')a[3]++;\n if(s[0]=='H')a[4]++;\n }\n int j,k;\n for(i=0;i<3;i++){\n for(j=i+1;j<4;j++){\n for(k=j+1;k<5;k++){\n ans+=a[i]*a[j]*a[k];\n }\n }\n }\n cout << ans << endl;\n return 0;\n}\n", "#include <iostream>\n#include <map>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n\tint N;\n\tcin >> N;\n\tmap<char, long long> m;\n\tfor (int i = 0; i < N; ++i) {\n\t\tstring S;\n\t\tcin >> S;\n\t\t++m[S[0]];\n\t}\n\t\n\tlong long ans = 0;\n\n\tconst string F = \"MARCH\";\n\tfor (int i = 0; i < 5; ++i) {\n\t\tfor (int j = i + 1; j < 5; ++j) {\n\t\t\tfor (int k = j + 1; k < 5; ++k) {\n\t\t\t\tans += m[F[i]] * m[F[j]] * m[F[k]];\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << ans << endl;\n}\n", "import sys\nfrom collections import deque\nimport copy\nimport math\ndef get_read_func(fileobject):\n if fileobject == None :\n return raw_input\n else:\n return fileobject.readline\n\ndef is_tasai(S):\n appare_set = set([])\n for s in S:\n if s in appare_set:\n return False\n appare_set.add(s)\n return True\n\ntable = {}\ndef comb(n, r):\n a = 1L\n b = 1L\n for i in range(r):\n a *= n - i\n b *= r - i\n return a/b\n\n## if (n, r) in table:\n## return table[(n, r)]\n## if n == r:\n## table[(n, r)] = 1L\n## return 1L\n## if r == 0:\n## table[(n, r)] = 1L\n## return 1L\n## if n == 0:\n## return 0L\n## table[(n, r)] = comb(n-1, r-1)+ comb(n-1, r)\n## return table[(n, r)]\n\n\ndef main():\n if len(sys.argv) > 1:\n f = open(sys.argv[1])\n else:\n f = None\n read_func = get_read_func(f);\n input_raw = read_func().strip().split()\n [N] = [int(input_raw[0])]\n initial_dict = {}\n initial_dict[\"M\"] = 0\n initial_dict[\"A\"] = 0\n initial_dict[\"R\"] = 0\n initial_dict[\"C\"] = 0\n initial_dict[\"H\"] = 0\n\n for i in range(N):\n input_raw = read_func().strip().split()\n if input_raw[0][0] in initial_dict:\n initial_dict[input_raw[0][0]] += 1\n M = 0\n for s in initial_dict:\n M += initial_dict[s]\n remove_num = 0L\n for s in initial_dict:\n remove_num += comb(initial_dict[s], 2) * (M - initial_dict[s])\n remove_num += comb(initial_dict[s], 3)\n print comb(M, 3) - remove_num\n\n\nif __name__ == '__main__':\n main()\n", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint num[] = new int[5];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tString S = sc.next();\n\t\t\tswitch (S.charAt(0)) {\n\t\t\t\tcase 'M':\n\t\t\t\t\tnum[0]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'A':\n\t\t\t\t\tnum[1]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'R':\n\t\t\t\t\tnum[2]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'C':\n\t\t\t\t\tnum[3]++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'H':\n\t\t\t\t\tnum[4]++;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tfor (int j = i+1; j < 5; j++) {\n\t\t\t\tfor (int k = j+1; k < 5; k++) {\n\t\t\t\t\tans += (long)num[i] * (long)num[j] * (long)num[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "n=int(input())\nl=[0]*5\nm='MARCH'\nfor i in range(n):\n s=input()\n f=s[0]\n for i in range(5):\n if f==m[i]:\n l[i]+=1\n break\nx=0\nfor i in range(3):\n for j in range(i+1,4):\n for k in range(j+1,5):\n x+=l[i]*l[j]*l[k]\nprint(x)", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = Integer.parseInt(sc.next());\n\t\tString S[] = new String[N];\n\t\tlong num[] = new long[5];\n\t\tArrays.fill(num, 0);\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tS[i] = sc.next();\n\t\t\tif(S[i].substring(0, 1).equals(\"M\")) {\n\t\t\t\tnum[0]++;\n\t\t\t}\n\t\t\tif(S[i].substring(0, 1).equals(\"A\")) {\n\t\t\t\tnum[1]++;\n\t\t\t}\n\t\t\tif(S[i].substring(0, 1).equals(\"R\")) {\n\t\t\t\tnum[2]++;\n\t\t\t}\n\t\t\tif(S[i].substring(0, 1).equals(\"C\")) {\n\t\t\t\tnum[3]++;\n\t\t\t}\n\t\t\tif(S[i].substring(0, 1).equals(\"H\")) {\n\t\t\t\tnum[4]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans = 0;\n\t\tint P[] = {0, 0, 0, 0, 0, 0, 1, 1, 1, 2};\n\t\tint Q[] = {1, 1, 1, 2, 2, 3, 2, 2, 3, 3};\n\t\tint R[] = {2, 3, 4, 3, 4, 4, 3, 4, 4, 4};\n\t\tfor(int i = 0; i < 10; i++) {\n\t\t\tans += num[P[i]] * num[Q[i]] * num[R[i]];\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "#include<cstdio>\nconst char c[]={'M','A','R','C','H'};\nchar s[15];\nint a[10];\nint main()\n{\n\tint n;scanf(\"%d\",&n);\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\"%s\",s);\n\t\tfor(int j=0;j<5;j++)\n\t\tif(c[j]==s[0]) a[j]++;\n\t}\n\tlong long ans=0;\n\tfor(int i=0;i<5;i++)\n\tfor(int j=i+1;j<5;j++)\n\tfor(int k=j+1;k<5;k++) ans+=1LL*a[i]*a[j]*a[k];\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n} ", "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nint main() {\n int n; cin >> n;\n vector<long long> cnt(128);\n while (n--) {\n string s; cin >> s;\n cnt[s[0]]++;\n }\n long long ans = 0;\n string march = \"MARCH\";\n rep(i, 5) rep(j, i) rep(k, j) {\n ans += cnt[march[i]] * cnt[march[j]] * cnt[march[k]];\n }\n cout << ans << endl;\n return 0;\n}\n", "from itertools import combinations\nn,*s=map(str,open(0).read().split())\na=[0]*5\nfor i in s:\n if i[0] in \"MARCH\":\n a[\"MARCH\".index(i[0])]+=1\nprint(sum([a[x]*a[y]*a[z] for x,y,z in combinations(range(5),3)]))", "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[5];//marchを数える。\n for (int i = 0; i < n; i++) {\n String s = sc.next();\n if (s.charAt(0) == 'M') a[0]++;\n if (s.charAt(0) == 'A') a[1]++;\n if (s.charAt(0) == 'R') a[2]++;\n if (s.charAt(0) == 'C') a[3]++;\n if (s.charAt(0) == 'H') a[4]++;\n }\n long sum = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = i+1; j < 4; j++) {\n for (int k = j+1; k < 5 ; k++) {\n long tmp = a[i] * a[j];\n sum += tmp * a[k];\n }\n\n }\n }\n System.out.println(sum);\n }\n}\n", "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[]args) {\n\t\ttry(Scanner scan = new Scanner(System.in)){\n\t\t\tint N = scan.nextInt();\n\t\t\t\n\t\t\tString [] S = new String[N];\n\t\t\tMap<String,Long>map = new HashMap<String,Long>();\n\t\t\tfor(int i = 0;i<N;i++) {\n\t\t\t\tS[i] = scan.next();\n\t\t\t\tchar a = S[i].charAt(0);\n\t\t\t\t\n\t\t\t\tif(a=='M'||a=='A'||a=='R'||a=='C'||a=='H') {\n\t\t\t\t\tif(map.containsKey(S[i].substring(0, 1))){\n\t\t\t\t\t\tmap.put(S[i].substring(0, 1), map.get(S[i].substring(0, 1))+1);\n\t\t\t\t\t\t}else {\n\t\t\t\t\t\t\tmap.put(S[i].substring(0, 1), (long)1);\n\t\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tlong []shu = new long[map.size()];\n\t\t\tArrayList<Long>as = new ArrayList<Long>(map.values());\n\t\t\tint k = 0;\n\t\t\tfor(String key:map.keySet()) {\n\t\t\t\tshu[k] = map.get(key);\n\t\t\t\tk++;\n\t\t\t}\n\t\t\t\n\t\t\tlong goukei = 0;\n\t\t\t\n\t\t\tif(map.size()<3) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t\t\n\t\t\t}else{\n\t\t\t\t\n\t\t\t\tfor(int i = 0;i<map.size()-2;i++) {\n\t\t\t\t\tfor(int j = i+1;j<map.size()-1;j++) {\n\t\t\t\t\t\tfor(int z=j+1;z<map.size();z++) {\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tgoukei+=as.get(i)*as.get(j)*as.get(z);\n\t\t\t\t\t\t\t//System.out.println(shu[i]*shu[j]*shu[z]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tSystem.out.println(goukei);\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t}\n\t\t\n\n}\n", "#include<bits/stdc++.h>//atcoder.089.C\nusing namespace std;\nint main(){\n\tlong long n,m,i,j,b=0;\n\tcin>>n;\n\tlong long a[6]={0};\n\tstring s[n+1];\n\tfor(i=1;i<=n;i++){\n\t\tcin>>s[i];\n\t\tif(s[i][0]=='M')a[1]++;\n\t\tif(s[i][0]=='A')a[2]++;\n\t\tif(s[i][0]=='R')a[3]++;\n\t\tif(s[i][0]=='C')a[4]++;\n\t\tif(s[i][0]=='H')a[5]++;\n\t}\n\tfor(i=1;i<=3;i++){\n\t\tif(a[i]!=0)\n\t\t\tfor(j=i+1;j<=4;j++){\n\t\t\t\tif(a[j]!=0)\n\t\t\t\t\tfor(m=j+1;m<=5;m++){\n\t\t\t\t\t\tif(a[m]!=0)b=b+a[i]*a[j]*a[m];\n\t\t\t\t\t}\n\t\t\t}\n\t}\n\tcout<<b;\n\treturn 0;\n}", "from itertools import combinations\nimport sys\nn = int(sys.stdin.readline().rstrip())\ns = [sys.stdin.readline().rstrip()[0] for _ in range(n)]\nsum = 0\nfor i,j,k in combinations([s.count(l) for l in \"MARCH\"],3):\n sum +=i * j * k\nprint(sum)", "import itertools as i,collections as c;print(sum(p*q*r for p,q,r in i.combinations(c.Counter(s[0]for s in open(0).readlines()[1:]if s[0]in\"MARCH\").values(),3)))", "import java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.ArrayDeque;\nimport java.util.Queue;\nimport java.util.LinkedList;\n\npublic class Main {\n\n public static void main(String[] args) {\n new Main().solve();\n }\n\n void solve() {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long ans = 0;\n String S[] = new String[N];\n long s[] = new long[5];\n Arrays.fill(s, 0);\n for (int i = 0; i < N; i++) {\n S[i] = sc.next();\n }\n for (int i = 0; i < N; i++) {\n if (S[i].charAt(0) == 'M') {\n s[0]++;\n }\n if (S[i].charAt(0) == 'A') {\n s[1]++;\n }\n if (S[i].charAt(0) == 'R') {\n s[2]++;\n }\n if (S[i].charAt(0) == 'C') {\n s[3]++;\n }\n if (S[i].charAt(0) == 'H') {\n s[4]++;\n }\n }\n for (int i = 0; i < 5; i++) {\n for (int j = i + 1; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += s[i] * s[j] * s[k];\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\nint a[30];\nstring s;\nint main()\n{\n\tint i,j,k,n,m,x,y,z,w,q;\n\tscanf(\"%d\",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tcin>>s;\n\t\ta[s[0]-'A']++;\n\t}\n\tll ans;//march\n\tx=a['M'-'A'];\n\ty=a[0];\n\tz=a['R'-'A'];\n\tw=a[2];\n\tq=a['H'-'A'];\n\tans=1ll*x*y*z+1ll*x*y*w+1ll*x*y*q+1ll*x*z*w+1ll*x*z*q+1ll*x*w*q+1ll*y*z*w+1ll*y*z*q+1ll*y*w*q+1ll*z*w*q;\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int N = scanner.nextInt();\n int[] captoi = new int[26];\n for (int i = 0; i < 26; i++) captoi[i] = -1;\n int id = 0;\n for (char c : new char[] {'M', 'A', 'R', 'C', 'H'}) captoi[c - 'A'] = id++;\n long[] capCount = new long[5];\n for (int i = 0; i < N; i++) {\n int c = scanner.next().charAt(0) - 'A';\n if (captoi[c] >= 0) capCount[captoi[c]]++;\n }\n\n long count = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 4; j++) {\n for (int k = j + 1; k < 5; k++) {\n count += capCount[i] * capCount[j] * capCount[k];\n }\n }\n }\n System.out.println(count);\n }\n}\n", "import itertools\nn = int(input())\nd = {'M': 0, 'A': 0, 'R': 0, 'C': 0, 'H': 0}\nfor i in range(n):\n s = input()\n if s[0] in d:\n d[s[0]] += 1\nans = 0\nfor v in itertools.combinations(d, 3):\n ans += d[v[0]] * d[v[1]] * d[v[2]]\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\n\t\tlong[] names = new long[5];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint index = nameIndex(sc.next());\n\t\t\tif (index != -1)\n\t\t\t\tnames[index]++;\n\t\t}\n\n\t\tlong count = 0;\n\t\tfor (int i = 0; i < names.length; i++) {\n\t\t\tfor (int j = i + 1; j < names.length; j++) {\n\t\t\t\tfor (int k = j + 1; k < names.length; k++) {\n\t\t\t\t\tcount += names[i] * names[j] * names[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n\tstatic int nameIndex(String str) {\n\t\tswitch (str.charAt(0)) {\n\t\tcase 'M':\n\t\t\treturn 0;\n\t\tcase 'A':\n\t\t\treturn 1;\n\t\tcase 'R':\n\t\t\treturn 2;\n\t\tcase 'C':\n\t\t\treturn 3;\n\t\tcase 'H':\n\t\t\treturn 4;\n\t\tdefault:\n\t\t\treturn -1;\n\t\t}\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int N; cin>>N;\n vector<long long>A(N);\n for(int i=0;i<N;i++){\n string S; cin>>S;\n if(S.at(0)=='M')A[0]++;\n if(S.at(0)=='A')A[1]++;\n if(S.at(0)=='R')A[2]++;\n if(S.at(0)=='C')A[3]++;\n if(S.at(0)=='H')A[4]++;\n }\n cout<<A[0]*A[1]*A[2]+A[0]*A[1]*A[3]+A[0]*A[1]*A[4]+A[0]*A[2]*A[3]+A[0]*A[2]*A[4]+A[0]*A[3]*A[4]+A[1]*A[2]*A[3]+A[1]*A[2]*A[4]+A[1]*A[3]*A[4]+A[2]*A[3]*A[4]<<endl;\n}", "from collections import defaultdict\nimport itertools\n\nN=input()\nl=[\"M\",\"A\",\"R\",\"C\",\"H\"]\nC=defaultdict(lambda: 0)\n\nfor i in range(N):\n\tS=raw_input()\n\tif S[0] in l:\n\t\tC[S[0]]+=1\n\nP=list(itertools.combinations(C.keys(),3))\n\nans=0\nfor x,y,z in P:\n\tans+=C[x]*C[y]*C[z]\n\nprint ans", "import itertools\nfrom collections import Counter\n\nn=int(input())\ns=[input()[0] for _ in range(n)]\nd=Counter(s)\nans=0\nfor i,j,k in itertools.combinations(\"MARCH\",3):\n ans+=d[i]*d[j]*d[k]\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tlong long march[5]={};\n\tlong long ans=0;\n\tstring s;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>s;\n\t\tif(s[0]=='M')\n\t\tmarch[0]++;\n\t\tif(s[0]=='A')\n\t\tmarch[1]++;\n\t\tif(s[0]=='R')\n\t\tmarch[2]++;\n\t\tif(s[0]=='C')\n\t\tmarch[3]++;\n\t\tif(s[0]=='H')\n\t\tmarch[4]++;\n\t}\n\tfor(int i=0;i<3;i++)\n\t{\n\t\tfor(int j=i+1;j<4;j++)\n\t\t{\n\t\t\tfor(int k=j+1;k<5;k++)\n\t\t\t{\n\t\t\t\tans+=march[i]*march[j]*march[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans;\n\treturn 0;\n}", "from itertools import combinations\nn = int(input())\nw = [0] * 5\nmarch = 'MARCH'\nfor i in range(n):\n s = input()[0]\n if s in march:\n w[march.index(s)] += 1\nprint(sum(map(lambda a:a[0]*a[1]*a[2], combinations(w, 3))))", "import itertools\nimport collections\nn = int(input())\nc = collections.Counter([input()[0] for i in range(n)])\ns = [c[x] for x in 'MARCH']\n\ncnt = 0\nfor x in itertools.combinations(s, 3):\n cnt += x[0] * x[1] * x[2]\nprint(cnt)\n", "#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\nint n,a[10];\nstring s;\nsigned main(){\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>s;\n\t\tif(s[0]=='M')a[0]++;\n\t\telse if(s[0]=='A')a[1]++;\n\t\telse if(s[0]=='R')a[2]++;\n\t\telse if(s[0]=='C')a[3]++;\n\t\telse if(s[0]=='H')a[4]++;\n\t}\n\tcout<<a[0]*a[1]*a[2]+a[0]*a[1]*a[3]+a[0]*a[1]*a[4]+a[0]*a[2]*a[3]+a[0]*a[2]*a[4]+a[0]*a[3]*a[4]+a[1]*a[2]*a[3]+a[1]*a[2]*a[4]+a[1]*a[3]*a[4]+a[2]*a[3]*a[4]<<endl;\n}\n", "from itertools import*\nx=sorted(s[0]for s in open(0).readlines()[1:])\n#print(list(x))\nc=[len(list(v))for k,v in groupby(x)if k in\"MARCH\"]\n#print(c)\ny=combinations(c,3)\n#print(list(y))\nprint(sum(p*q*r for p,q,r in list(y)))", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().execute();\n\t}\n\n\tpublic void execute() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfinal int N = sc.nextInt();\n\t\tint[] march = new int[5];\n\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tString si = sc.next();\n\t\t\tswitch (si.charAt(0)) {\n\t\t\tcase 'M':\n\t\t\t\tmarch[0]++;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tmarch[1]++;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tmarch[2]++;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tmarch[3]++;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tmarch[4]++;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t}\n\t\t}\n\n\t\tlong patterns = 0;\n\t\tfor (int i = 0; i < 5; i++) {\n\t\t\tfor (int j = i + 1; j < 5; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tpatterns += (long)march[i] * march[j] * march[k];\t\t\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(patterns);\n\t\tsc.close();\n\t}\n\n}", "from itertools import combinations as cmbs\nfrom sys import stdin\nc = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nfor si in map(lambda s:s[0],stdin):\n if si in c:\n c[si] += 1\nprint(sum(i*j*k for i,j,k in cmbs(c.values(),r=3)))\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n int64_t m=0,a=0,r=0,c=0,h=0;\n cin>>N;\n for(int i=0;i<N;i++){\n string s;\n cin>>s;\n if(s.at(0)=='M'){\n m++;\n }\n else if(s.at(0)=='A'){\n a++;\n }\n else if(s.at(0)=='R'){\n r++;\n }\n else if(s.at(0)=='C'){\n c++;\n }\n else if(s.at(0)=='H'){\n h++;\n }\n }\n cout<<m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h<<endl;\n}", "p=list(\"MARCH\")\nd=[0]*5\nn=int(input())\nfor i in range(n):\n r=input()\n q=r[0]\n if r[0] in p:\n d[p.index(r[0])]+=1\nc=0\nfor i in range(3):\n for j in range(i+1,4):\n for s in range(j+1,5):\n c+=d[i]*d[j]*d[s]\nprint(c)", "import itertools\nn=int(input())\nm=list(\"MARCH\")\nd=[0]*5\nfor i in range(n):\n s=input()\n for j in range(len(m)):\n if s[0]==m[j]:\n d[j]+=1\nans=0\nfor i in list(itertools.combinations(list(range(5)), 3)):\n k=list(i)\n ans+=d[k[0]]*d[k[1]]*d[k[2]]\nprint(ans)", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\tmap<char, long long int> mp;\n\tlong long int N, count = 0;\n\tstring S;\n\tcin >> N;\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> S;\n\t\tmp[S[0]]++;\n\t}\n\tlong long int M = mp['M'], A = mp['A'], R = mp['R'], C = mp['C'], H = mp['H'];\n\tcount += M * A * (R + C + H);\n\tcount += (M + A) * R * (C + H);\n\tcount += (M + A + R) * C * H;\n\tcout << count;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); i++) \n#define all(v) begin(v),end(v)\nusing ll = long long;\n\nint main() {\n int n;cin>>n;\n vector<string> s(n);\n string t=\"MARCH\";\n vector<ll> vec(5);\n rep(i,n){\n cin>>s[i];\n rep(j,5){\n if(s[i][0]==t[j])vec[j]++;\n }\n }\n ll ans=0;\n rep(i,3)for(int j=i+1;j<4;j++)for(int k=j+1;k<5;k++){\n ans+=vec[i]*vec[j]*vec[k];\n }\n cout<<ans<<endl;\n}", "// C - March\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n\tstring T{\"MARCH\"};\n\n\tint N; cin>>N;\n\n\tvector<int> C(T.size());\n\twhile(N--){\n\t\tstring s; cin>>s;\n\t\tfor(int t=0; t<T.size(); ++t)\n\t\t\tif(s[0]==T[t]) C[t]++;\n\t}\n\n\tll ans = 0;\n\tfor(int i=0; i<C.size(); ++i)\n\t\tfor(int j=i+1; j<C.size(); ++j)\n\t\t\tfor(int k=j+1; k<C.size(); ++k)\n\t\t\t\tans += (ll)C[i] * C[j] * C[k];\n\tcout<< ans <<endl;\n}", "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tstring march=\"MARCH\";\n\tvector<long long> c(5,0);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor(int j=0;j<5;j++)\n\t\t\tif(s[0]==march[j])\n\t\t\t\tc[j]++;\n\t}\n\tlong long ans=0;\n\n\tfor(int i=0;i<5-2;i++)\n\t\tfor(int j=i+1;j<5-1;j++)\n\t\t\tfor(int k=j+1;k<5;k++)\n\t\t\t\tans+=(c[i]*c[j]*c[k]);\n\t\n\tcout << ans << endl;\n\n\n\t\n}\n", "import java.util.*;\npublic class Main {\n\n public static void main(String[] args) { \n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n\n Map<Character, Integer> freq = new HashMap<>();\n freq.put('M', 0);\n freq.put('A', 0);\n freq.put('R', 0);\n freq.put('C', 0);\n freq.put('H', 0);\n\n for(int i = 0; i < n; i++) {\n char c = sc.next().charAt(0);\n if(freq.containsKey(c))\n freq.put(c, freq.get(c) + 1);\n }\n\n long cnt = 0;\n List<Integer> vals = new ArrayList<>(freq.values());\n for(int i = 0; i < vals.size(); i++) {\n long a = vals.get(i);\n if(a == 0) continue;\n for(int j = i + 1; j < vals.size(); j++) {\n long b = vals.get(j);\n if(b == 0) continue;\n for(int k = j + 1; k < vals.size(); k++) {\n long c = vals.get(k);\n if(c == 0) continue;\n cnt += a * b * c;\n }\n }\n }\n \n\n System.out.println(cnt);\n }\n}\n", "from itertools import combinations\n\ninput = open(0).read\n\nSn = [i[0] for i in input().split() if i[0] in \"MARCH\"]\n\n\ndef main():\n\n print(\n sum(x * y * z for x, y, z\n in combinations([Sn.count(s) for s in \"MARCH\"], 3)))\n\n return\n\n\nmain()\n", "import itertools\nN = int(input())\nS = [input()[0] for _ in range(N)]\nS = [v for v in S if v in 'MARCH']\ns = list(set(S))\nc = 0\nfor v in itertools.combinations(s, 3):\n c += S.count(v[0]) * S.count(v[1]) * S.count(v[2])\nprint(c)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tchar c[] = \"MARCH\";\n\tvector<int> a(5);\n\tint n;\n\tcin >> n;\n\tstring s;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> s;\n\t\tfor (int j = 0; j < 5; j++) {\n\t\t\tif (s[0] == c[j])\n\t\t\t\ta[j]++;\n\t\t}\n\t}\n\tlong long ans = 0;\n\tfor (int i = 0; i < 3; i++) {\n\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\tans += (long long) a[i] * a[j] * a[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n}\n", "import java.util.*;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.HashMap;\n\nclass Main{\n public static void main(String[] args){\n \n Scanner sc = new Scanner(System.in);\n \n int N = sc.nextInt();\n long m = 0L;\n long a = 0L;\n long r = 0L; \n long c = 0L;\n long h = 0L;\n long[] D = new long[5];\n int[] x = {0, 0, 0, 0, 0, 0, 1, 1, 1, 2};\n int[] y = {1, 1, 1, 2, 2, 3, 2, 2, 3, 3};\n int[] z = {2, 3, 4, 3, 4, 4, 3, 4, 4, 4};\n\n for(int i=0; i<N; i++){\n String s = sc.next();\n if(s.charAt(0)=='M') m++;\n if(s.charAt(0)=='A') a++;\n if(s.charAt(0)=='R') r++;\n if(s.charAt(0)=='C') c++;\n if(s.charAt(0)=='H') h++;\n }\n D[0] = m;\n D[1] = a;\n D[2] = r;\n D[3] = c;\n D[4] = h;\n\n long ans = 0L;\n for(int i=0; i<10; i++){\n ans += 0L + D[x[i]] * D[y[i]] * D[z[i]];\n }\n System.out.println(ans);\n }\n}", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n C solver = new C();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class C {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n // 入力\n int n = Integer.parseInt(in.next());\n // 出現する頭文字の回数\n long[] ins = new long[5];\n for (int i = 0; i < n; i++) {\n String tmp = in.next();\n if (tmp.startsWith(\"M\")) ins[0]++;\n if (tmp.startsWith(\"A\")) ins[1]++;\n if (tmp.startsWith(\"R\")) ins[2]++;\n if (tmp.startsWith(\"C\")) ins[3]++;\n if (tmp.startsWith(\"H\")) ins[4]++;\n }\n long ans = 0;\n // ありうるMARCHの組合せ\n int[] c1 = {0, 0, 0, 0, 0, 0, 1, 1, 1, 2};\n int[] c2 = {1, 1, 1, 2, 2, 3, 2, 2, 3, 3};\n int[] c3 = {2, 3, 4, 3, 4, 4, 3, 4, 4, 4};\n\n for (int i = 0; i < 10; i++) {\n ans += ins[c1[i]] * ins[c2[i]] * ins[c3[i]];\n }\n\n // 出力\n out.println(ans);\n\n }\n\n }\n}\n\n", "from itertools import combinations as cmbs\nimport sys\nc = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nfor i in range(int(input())):\n si = sys.stdin.readline()[0]\n if si in c:\n c[si] += 1\nans = sum(i*j*k for i,j,k in cmbs(c.values(),r=3))\nprint(ans)\n", "N=int(input())\nS=list(input()[0] for _ in range(N))\nm=S.count('M')\na=S.count('A')\nr=S.count('R')\nc=S.count('C')\nh=S.count('H')\nprint(m*a*r+m*a*c+m*a*h\n +m*r*c+m*r*h\n +m*c*h\n +a*r*c+a*r*h\n +a*c*h\n +r*c*h)", "#include<iostream>\nusing namespace std;\nlong long n,a[129],ans;\nchar b[6]={0,'M','A','R','C','H'};\nint main(){\n\tcin >> n;\n\tfor(int i=1;i<=n;i++){\n\t\tstring s1;\n\t\tcin >> s1;\n\t\ta[s1[0]]++;\n\t}\n\tfor(int i=1;i<=5;i++){\n\t\tfor(int j=i+1;j<=5;j++){\n\t\t\tfor(int k=j+1;k<=5;k++){\n\t\t\t\tans+=a[b[i]]*a[b[j]]*a[b[k]];\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans;\n\treturn 0;\n}", "import itertools\n\n\nN = int(input())\nD = {'M': 0, 'A': 0, 'R': 0, 'C': 0, 'H': 0}\nfor i in range(N):\n s = input()\n if s[0] in D.keys():\n D[s[0]] += 1\nans = 0\nfor v in itertools.combinations(D.values(), 3):\n ans += v[0] * v[1] * v[2]\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t}\n\n\tvoid solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tlong[] SMatch = new long [5];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tString s = sc.next();\n\t\t\t\t if(s.substring(0, 0+1).equals(\"M\"))SMatch[0]++;\n\t\t\telse if(s.substring(0, 0+1).equals(\"A\"))SMatch[1]++;\n\t\t\telse if(s.substring(0, 0+1).equals(\"R\"))SMatch[2]++;\n\t\t\telse if(s.substring(0, 0+1).equals(\"C\"))SMatch[3]++;\n\t\t\telse if(s.substring(0, 0+1).equals(\"H\"))SMatch[4]++;\n\t\t}\n\t\tsc.close();\n\t\tlong res=0;\n\t\tint[] P={0,0,0,0,0,0,1,1,1,2};\n\t\tint[] Q={1,1,1,2,2,3,2,2,3,3};\n\t\tint[] R={2,3,4,3,4,4,3,4,4,4};\n\t\tfor(int i=0;i<10;i++)res += SMatch[P[i]]*SMatch[Q[i]]*SMatch[R[i]];\n\n\t\tSystem.out.println(res);\n\t}\n\n}\n", "from itertools import*;s,*_=zip(*open(0).readlines());print(sum(p*q*r for p,q,r in combinations(map(s.count,'MARCH'),3)))", "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner scan = new Scanner(System.in);\n \n long[] arr = new long[5];\n int n = scan.nextInt();\n \n for(int x = 0; x < n; x++){\n String temp = scan.next();\n switch(temp.charAt(0)){\n case 'M':\n arr[0]++;\n break;\n \n case 'A':\n arr[1]++;\n break;\n \n case 'R':\n arr[2]++;\n break;\n \n case 'C':\n arr[3]++;\n break;\n \n case 'H':\n arr[4]++;\n break;\n \n default:\n break;\n }\n }\n \n long ans = 0;\n \n for(int i = 0; i < 3; i++){\n for(int j = i+1; j < 4; j++){\n for(int k = j+1; k < 5; k++){\n ans += arr[i]*arr[j]*arr[k];\n }\n }\n }\n\n System.out.println(ans);\n \n }\n}\n", "n=int(input())\nU=list()\nfor i in range(n):\n\ti=input()\n\tU.append(i)\nm=a=r=c=h=0\nfor x in U:\n\tif x[0]=='M':\n\t\tm+=1\n\tif x[0]=='A':\n\t\ta+=1\n\tif x[0]=='R':\n\t\tr+=1\n\tif x[0]=='C':\n\t\tc+=1\n\tif x[0]=='H':\n\t\th+=1\nsig=(m+a+r)*c*h+m*a*(r+c+h)+(m+a)*r*(c+h)\nprint(sig)\n", "import itertools\nn = int(input())\na = [\"M\",\"A\",\"R\",\"C\",\"H\"]\nb = [0]*5\nfor i in range(n):\n s = input()\n for j in range(5):\n if a[j] == s[0]:\n b[j] += 1\nans = 0\nfor k in itertools.combinations(b,3):\n ans += k[0]*k[1]*k[2]\nprint(ans)", "import java.util.*;\nimport java.lang.*;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n String s[] = new String[n];\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n for (int i = 0; i < n; i++) {\n s[i] = sc.next();\n if (s[i].charAt(0) == 'M') {\n m++;\n } else if (s[i].charAt(0) == 'A') {\n a++;\n } else if (s[i].charAt(0) == 'R') {\n r++;\n } else if (s[i].charAt(0) == 'C') {\n c++;\n } else if (s[i].charAt(0) == 'H') {\n h++;\n }\n }\n System.out.println(m * a * (r + c + h) + m * r * (c + h) + m * c * h + a * r * (c + h) + a * c * h + r * c * h);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n char[] S = new char[N];\n int[] count = new int[5];\n int check =0;\n for (int i =0; i<N; i++) {\n S[i] = sc.next().charAt(0);\n if (S[i] == 'M') count[0]++;\n if (S[i] == 'A') count[1]++;\n if (S[i] == 'R') count[2]++;\n if (S[i] == 'C') count[3]++;\n if (S[i] == 'H') count[4]++;\n }\n for (int i =0; i<5; i++) {\n if (count[i] == 0) check++;\n }\n if (check >= 3) {\n System.out.println(0);\n return;\n }\n \n long ans =0;\n for (int i =0; i<=2; i++) {\n for (int j =i+1; j<=3; j++) {\n for (int k =j+1; k<=4; k++) {\n ans += (long)count[i] * count[j] * count[k];\n }\n }\n }\n System.out.println(ans);\n \n }\n} \n", "from itertools import*;N,*S=open(0);print(sum(a*b*c for a,b,c in combinations([sum(1for s in S if s[0]==c)for c in\"MARCH\"],3)))", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n String march=\"MARCH\";\n long[] a=new long[6];\n for(int i=0;i<n;i++){\n a[march.indexOf(sc.next().charAt(0))+1]++;\n }\n long ans=0; \n for(int i=1;i<=3;i++){\n for(int j=i+1;j<=4;j++){\n for(int k=j+1;k<=5;k++){\n ans+=a[i]*a[j]*a[k];\n }\n }\n }\n System.out.println(ans);\n }\n}", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn=new Scanner(System.in);\n\t\tint N=stdIn.nextInt();\n\t\tString s=\"\";\n\t\tlong S[]=new long[5];\n\t\tint z=0,y=0,x=0;\n\t\tlong ans=0;\n\t\twhile(z<N){\n\t\t\ts=stdIn.next();\n\t\t\ts=s.substring(0,1);\n\t\t\tif(s.equals(\"M\"))\n\t\t\t\tS[0]++;\n\t\t\tif(s.equals(\"A\"))\n\t\t\t\tS[1]++;\n\t\t\tif(s.equals(\"R\"))\n\t\t\t\tS[2]++;\n\t\t\tif(s.equals(\"C\"))\n\t\t\t\tS[3]++;\n\t\t\tif(s.equals(\"H\"))\n\t\t\t\tS[4]++;\n\t\t\tz++;\n\t\t}z=0;\n\t\twhile(z<3){\n\t\t\ty=z+1;\n\t\t\twhile(y<4){\n\t\t\t\tx=y+1;\n\t\t\t\twhile(x<5){\n\t\t\t\t\tans+=S[z]*S[y]*S[x];\n\t\t\t\t\tx++;\n\t\t\t\t}\n\t\t\t\tx=0;y++;\n\t\t\t}\n\t\t\ty=0;z++;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\nlong N = sc.nextInt();\nlong m = 0;\nlong a = 0;\nlong r = 0;\nlong c = 0;\nlong h = 0;\n\nString name;\nfor(int i = 0;i<N;i++){\nname = sc.next();\nif(name.startsWith(\"M\")){\nm++;\n}else if(name.startsWith(\"A\")){\na++;\n}else if(name.startsWith(\"R\")){\nr++;\n}else if(name.startsWith(\"C\")){\nc++;\n}else if(name.startsWith(\"H\")){\nh++;\n}\n}\nlong ans;\nans = m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;\n System.out.println(ans);\n }\n}\n", "from itertools import *\nN = int(input())\nD = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\n\nfor n in range(N):\n s = input()\n if s[0] in \"MARCH\":\n D[s[0]]+=1\n\nprint(sum(a*b*c for a,b,c in combinations(D.values(),3)))", "import itertools\nm = a = r = c = h = 0\nfor i in xrange(input()):\n s = raw_input()\n if s[0] == \"M\":\n m += 1\n elif s[0] == \"A\":\n a += 1\n elif s[0] == \"R\":\n r += 1\n elif s[0] == \"C\":\n c += 1\n elif s[0] == \"H\":\n h += 1\nans = 0\nfor i in itertools.combinations((m,a,r,c,h), 3):\n ans += i[0]*i[1]*i[2]\nprint ans\n", "import java.util.*;\nimport java.lang.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint N = sc.nextInt();\n\t\tchar[] alp = new char[]{'M','A','R','C','H'};\n\t\tlong[] count = new long[5];\n\t\tfor( int i=1; i<=N; i++ ){\n\t\t\tString ss = sc.next();\n\t\t\tchar cc = ss.charAt(0);\n\t\t\tfor( int j=0; j<=4; j++ ){\n\t\t\t\tif( cc==alp[j] ){\n\t\t\t\t\tcount[j]++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor( int i=0; i<=2; i++ ){\n\t\t\tfor( int j=i+1; j<=3; j++ ){\n\t\t\t\tfor( int k=j+1; k<=4; k++ ){\n\t\t\t\t\tans += count[i]*count[j]*count[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\t\n\t\tArrayList<String> x = new ArrayList<String>();\n\t\tint i;\n\t\tlong count = 0, countM = 0, countA = 0, countR = 0, countC = 0, countH = 0;\n\t\tfor(i = 0; i < N; i++){\n\t\t\tString name = sc.next();\n\t\t\tchar c = name.charAt(0);\n\t\t\tif(c == 'M'){\n\t\t\t\tcountM++;\n\t\t\t\tcount++;\n\t\t\t}else if(c == 'A'){\n\t\t\t\tcountA++;\n\t\t\t\tcount++;\n\t\t\t}else if(c == 'R'){\n\t\t\t\tcountR++;\n\t\t\t\tcount++;\n\t\t\t}else if(c == 'C'){\n\t\t\t\tcountC++;\n\t\t\t\tcount++;\n\t\t\t}else if(c == 'H'){\n\t\t\t\tcountH++;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(count == 0){\n\t\t\tSystem.out.println(0);\n\t\t}else{\n\t\t\tlong ans = countM * (countA *(countR + countC + countH) + countR *(countC + countH) + countC * countH) + countA *(countR * (countC + countH) + countC * countH) + countR * countC * countH; \n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "import itertools\nn,*s=open(0).read().split()\nd={'M':0,'A':0,'R':0,'C':0,'H':0}\nfor i in s:\n k=i[0]\n if k in d:\n d[k]+=1\np=0\nfor i,j,k in itertools.combinations(d.values(),3):\n p+=i*j*k\nprint(p)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] D = new long[5];\n for (int i = 0; i < N; i++) {\n String name = sc.next();\n if (name.charAt(0) == 'M') D[0]++;\n if (name.charAt(0) == 'A') D[1]++;\n if (name.charAt(0) == 'R') D[2]++;\n if (name.charAt(0) == 'C') D[3]++;\n if (name.charAt(0) == 'H') D[4]++;\n }\n long res = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i+1; j < 5; j++) {\n for (int k = j+1; k < 5; k++) {\n res += D[i] * D[j] * D[k];\n }\n }\n }\n System.out.println(res);\n }\n}\n", "from collections import Counter\nfrom itertools import combinations\n\nN = int(input())\nS = [input()[0] for _ in range(N)]\nC = Counter(S)\n\nans = 0\nfor x, y, z in combinations(\"MARCH\", 3):\n ans += C[x]*C[y]*C[z]\n\nprint(ans)", "from collections import Counter\nimport itertools\n\nN = int(input())\nS = [input()[0] for _ in range(N)]\ncounter = Counter(S)\n\nans = 0\nfor x,y,z in itertools.combinations('MARCH',3):\n ans += counter[x] * counter[y] * counter[z]\n\nprint(ans)\n", "n = input()\nkeywords = list(\"MARCH\")\nm = len(keywords)\nD = dict(zip(keywords, [0] * m))\nfor i in range(n):\n s = raw_input()\n c = s[0]\n if c in D:\n D[c] += 1\nans = 0\nfor i in range(m):\n for j in range(i+1, m):\n for k in range(j+1, m):\n ans += D[keywords[i]] * D[keywords[j]] * D[keywords[k]]\nprint ans", "from itertools import combinations\nfrom collections import Counter\n\nn = int(input())\ns = [input()[0] for _ in range(n)]\n\nc =Counter(s)\nans = 0\nfor x, y, z in combinations(\"MARCH\", 3):\n ans += c[x] * c[y] * c[z]\n\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n long[] cnt = new long[5]; // MARCH\n\n for (int i = 0; i < n; i++) {\n char c = sc.next().charAt(0);\n switch(c) {\n case ('M'): cnt[0]++; break;\n case ('A'): cnt[1]++; break;\n case ('R'): cnt[2]++; break;\n case ('C'): cnt[3]++; break;\n case ('H'): cnt[4]++; break;\n }\n }\n sc.close();\n\n long ans = 0;\n for (int i = 0; i < 3; i++) {\n if (cnt[i] == 0)\n continue;\n for (int j = i+1; j < 4; j++) {\n if (cnt[j] == 0)\n continue;\n for (int k = j+1; k < 5; k++) {\n if (cnt[k] == 0)\n continue;\n ans += cnt[i] * cnt[j] * cnt[k];\n }\n }\n }\n\n System.out.println(ans);\n }\n}\n", "N=int(input())\nhead=\"MARCH\"\ncount=[0]*5\nanswer=0\n\nfor i in range(N):\n S=input()\n for j in range(5):\n if S[0]==head[j]:\n count[j]+=1\n\n\nfor i in range(5):\n for j in range(i):\n for k in range(j):\n answer+=count[i]*count[j]*count[k]\n\nprint(answer)", "N = int(input())\nS = [input()[0] for _ in range(N)]\n\nfrom collections import Counter\ndic = Counter(S)\n\nfrom itertools import combinations\n\nresult = 0\nfor a, b, c in combinations(\"MARCH\", 3):\n result += dic[a] * dic[b] * dic[c]\nprint(result)", "N = int(input())\ndic = [0]*128\nfor _ in range(N): dic[ord(input()[0])] += 1\nM,A,R,C,H = [dic[ord(x)] for x in list('MARCH')]\nprint(M*A*R + M*A*C + M*A*H + M*R*C + M*R*H + M*C*H + A*R*C + A*R*H + A*C*H + R*C*H)\n", "import java.util.*;\nimport java.io.InputStreamReader;\nimport java.io.BufferedReader;\n\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n int[] march = new int[5];\n \n for (int i = 0; i < n; i++) {\n String s = br.readLine();\n if (s.charAt(0) == 'M') march[0]++;\n if (s.charAt(0) == 'A') march[1]++;\n if (s.charAt(0) == 'R') march[2]++;\n if (s.charAt(0) == 'C') march[3]++;\n if (s.charAt(0) == 'H') march[4]++;\n }\n \n long ans = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i+1; j < 5; j++) {\n for (int k = j+1; k < 5; k++) {\n ans += (long)march[i]*march[j]*march[k];\n }\n }\n }\n \n System.out.println(ans);\n }\n}\n\n\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nconst int N = 5;\nconst string march = \"MARCH\";\n\nll n, ans, cnt[N];\nstring s;\n\nint main() {\n\tios::sync_with_stdio(false), cin.tie(0);\n\tcin >> n;\n\twhile(n--) {\n\t\tcin >> s;\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tif(s[0] == march[i])\n\t\t\t\tcnt[i]++;\n\t}\n\tfor (int i = 0; i < N; i++)\n\t\tfor (int j = i + 1; j < N; j++)\n\t\t\tfor (int k = j + 1; k < N; k++)\n\t\t\t\tans += cnt[i] * cnt[j] * cnt[k];\n\tcout << ans;\n\treturn 0;\n}", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n long n = 0;\n String S[] = new String [N];\n for(int i=0;i<N;i++){\n S[i] = String.valueOf(sc.next().charAt(0));\n if(S[i].equals(\"M\"))\n m++;\n else if(S[i].equals(\"A\"))\n a++;\n else if(S[i].equals(\"R\"))\n r++;\n else if(S[i].equals(\"C\"))\n c++;\n else if(S[i].equals(\"H\"))\n h++;\n }\n \n\n\n//\t\tSystem.out.println(m + \" \" + a + \" \"+ r + \" \"+ c + \" \"+ h );\n n = m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h ;\n\n System.out.println(n);\n\t}\n}", "#include<bits/stdc++.h>\n#define ll long long\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\nusing namespace std;\nint main(){\n int N;\n cin>>N;\n ll a[26]={};\n rep(i,N){\n string s;\n cin>>s;\n a[(int)s[0]-'A']++;\n }\n ll ans=0;\n int t[5]={'M'-'A','A'-'A','R'-'A','C'-'A','H'-'A'};\n rep(i,5)rep(j,5)rep(k,5)if(i>j and j>k) ans+=a[t[i]]*a[t[j]]*a[t[k]];\n cout<<ans<<endl;\n return 0;\n}\n", "from itertools import combinations\nfrom collections import Counter\nN = int(input())\nS = Counter()\nfor i in range(N):\n S[input()[0]]+=1\nprint(sum([S[a]*S[b]*S[c] for a,b,c in combinations(\"MARCH\",3)]))", "import java.util.Scanner;\n\npublic class Main { \n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n char[] S = new char[N];\n int[] count = new int[5];\n int check =0;\n for (int i =0; i<N; i++) {\n S[i] = sc.next().charAt(0);\n if (S[i] == 'M') count[0]++;\n if (S[i] == 'A') count[1]++;\n if (S[i] == 'R') count[2]++;\n if (S[i] == 'C') count[3]++;\n if (S[i] == 'H') count[4]++;\n }\n for (int i =0; i<5; i++) {\n if (count[i] == 0) check++;\n }\n if (check >= 3) {\n System.out.println(0);\n } else {\n long ans =0;\n for (int i =0; i<=2; i++) {\n for (int j =i+1; j<=3; j++) {\n for (int k =j+1; k<=4; k++) {\n ans += (long)count[i] * count[j] * count[k];\n }\n }\n }\n System.out.println(ans);\n }\n }\n} ", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); i++) \n#define all(v) begin(v),end(v)\nusing ll = long long;\n\nint main() {\n int n;cin>>n;\n string t=\"MARCH\";\n vector<int> vec(5);\n rep(i,n){\n string s;cin>>s;\n rep(j,5){\n if(s[0]==t[j])vec[j]++;\n }\n }\n ll ans=0;\n rep(i,3)for(int j=i+1;j<4;j++)for(int k=j+1;k<5;k++){\n ans+=(ll)vec[i]*vec[j]*vec[k];\n }\n cout<<ans<<endl;\n}", "import java.util.*;\n\npublic class Main {\n\n\tstatic long Examine(long countM,long countA,long countR,long countC,long countH) {\n\t\tlong count = 0;\n\t\tcount += countM * countA * countR;\n\t\tcount += countM * countA * countC;\n\t\tcount += countM * countA * countH;\n\t\t\n\t\tcount += countM * countR * countC;\n\t\tcount += countM * countR * countH;\n\t\t\n\t\tcount += countM * countC * countH;\n\t\t\n\t\tcount += countA * countR * countC;\n\t\tcount += countA * countR * countH;\n\t\t\n\t\tcount += countA * countC * countH;\n\t\t\n\t\tcount += countR * countC * countH;\n\n\t\treturn count;\n\t}\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tString[] names = new String[N];\n\t\tlong countM = 0;\n\t\tlong countA = 0;\n\t\tlong countR = 0;\n\t\tlong countC = 0;\n\t\tlong countH = 0;\n\t\tString[] I = new String[N];\n\t\tfor(int i = 0;i < N;i++) {\n\t\t\tnames[i] = sc.next();\n\t\t\tI[i] = names[i].substring(0,1);\n\t\t}\n\t\tfor(int k = 0;k < N;k++) {\n\t\t\tif(I[k].equals(\"M\")) countM++;\n\t\t\telse if(I[k].equals(\"A\")) countA++;\n\t\t\telse if(I[k].equals(\"R\")) countR++;\n\t\t\telse if(I[k].equals(\"C\")) countC++;\n\t\t\telse if(I[k].equals(\"H\")) countH++;\n\t\t}\n\t\tSystem.out.println(Examine(countM,countA,countR,countC,countH));\n\t\tsc.close();\n\t}\n\n}", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public void main(Scanner sc) {\n String march[] = \"MARCH\".split(\"\");\n long cnt[] = new long[5];\n Arrays.fill(cnt, 0);\n\n int n = sc.nextInt();\n for (int i = 0; i < n; i++) {\n String str = sc.next();\n for (int j = 0; j < 5; j++) {\n if (str.startsWith(march[j])) {\n cnt[j]++;\n }\n }\n }\n\n long ans = 0L;\n ans += cnt[0] * cnt[1] * cnt[2];\n ans += cnt[0] * cnt[1] * cnt[3];\n ans += cnt[0] * cnt[1] * cnt[4];\n ans += cnt[0] * cnt[2] * cnt[3];\n ans += cnt[0] * cnt[2] * cnt[4];\n ans += cnt[0] * cnt[3] * cnt[4];\n ans += cnt[1] * cnt[2] * cnt[3];\n ans += cnt[1] * cnt[2] * cnt[4];\n ans += cnt[1] * cnt[3] * cnt[4];\n ans += cnt[2] * cnt[3] * cnt[4];\n\n System.out.println(ans);\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n new Main().main(sc);\n sc.close();\n }\n}\n", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tlong[] cnt = new long[5]; // 'M','A','R','C','H'\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString name = sc.next();\n\t\t\tswitch (name.charAt(0)) {\n\t\t\tcase 'M':\n\t\t\t\tcnt[0]++;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tcnt[1]++;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tcnt[2]++;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tcnt[3]++;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tcnt[4]++;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < cnt.length - 2; i++) {\n\t\t\tfor (int j = i + 1; j < cnt.length - 1; j++) {\n\t\t\t\tfor (int k = j + 1; k < cnt.length; k++) {\n\t\t\t\t\tans += cnt[i] * cnt[j] * cnt[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n}\n", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scanner = new Scanner(System.in);\n \tint n = scanner.nextInt();\n String name[] = new String[n];\n\t\tfor(int t = 0;t<n;t++) {\n\t\t\tname[t] = scanner.next();\n name[t] = String.valueOf(name[t].charAt(0));\n }\n int x = 0;\n\t\tLong amnt[] = {0L,0L,0L,0L,0L};\n String moji[] = {\"M\",\"A\",\"R\",\"C\",\"H\"};\n int s;\n for(x = 0;x < n;x++){\n \tfor(s = 0;s<5;s++){\n \t\tif(moji[s].equals(name[x])){\n amnt[s]++;\n }\n }\n }\n\t\tLong ans = amnt[0]*(amnt[1]*(amnt[2]+amnt[3]+amnt[4])+amnt[2]*(amnt[3]+amnt[4])+amnt[3]*amnt[4])+amnt[1]*(amnt[2]*amnt[3]+amnt[2]*amnt[4]+amnt[3]*amnt[4])+amnt[2]*amnt[3]*amnt[4];\n System.out.println(ans);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing Graph=vector<vector<int>>;\n\nint main(){\n int N;\n cin>>N;\n map<char,ll> m;\n for(int i=0;i<N;i++){\n string S;\n cin>>S;\n char c=S.at(0);\n if(m.count(c)==0){\n m[c]=1;\n }else{\n m[c]++;\n }\n }\n\n ll a=m['M'],b=m['A'],c=m['R'],d=m['C'],e=m['H'];\n ll ans=a*b*c+a*b*d+a*b*e+a*c*d+a*c*e+a*d*e+b*c*d+b*c*e+b*d*e+c*d*e;\n cout<<ans<<endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nmap<char,long>m;\nint main(){\n int n;\n cin>>n;\n string a[100005];\n for(int i=1;i<=n;i++){\n string y;\n cin>>y;\n m[y[0]]++;\n }\n unsigned long res=0;\n char c[6]={'M','A','R','C','H'};\n for(int i=0;i<=2;i++){\n for(int j=i+1;j<=3;j++){\n for(int k=j+1;k<=4;k++){\n res+=m[c[i]]*m[c[j]]*m[c[k]];\n }\n }\n }\n cout<<res;\n}", "n=int(input())\ncnt=[0]*5\ncheck='MARCH'\nfor i in range(n):\n s=input()\n for j in range(5):\n if s[0]==check[j]:\n cnt[j]+=1\n break\nans=0\nfor i in range(5):\n for j in range(i+1,5):\n for k in range(j+1,5):\n ans+=cnt[i]*cnt[j]*cnt[k]\nprint(ans)", "import java.util.*;\nimport static java.lang.System.*;\n\nclass Main {\n public static final int MOD = 1000000007;\n public static final int INF = 1000000000;\n public static void main(String[] args) {\n Scanner sc = new Scanner(in);\n int N = sc.nextInt();\n String S[] = new String[N];\n Integer march[] = new Integer[5];\n Arrays.fill(march, 0);\n for(int i=0; i<N; i++){\n S[i] = sc.next();\n if(S[i].charAt(0) == 'M') march[0]++;\n if(S[i].charAt(0) == 'A') march[1]++;\n if(S[i].charAt(0) == 'R') march[2]++;\n if(S[i].charAt(0) == 'C') march[3]++;\n if(S[i].charAt(0) == 'H') march[4]++;\n }\n long ans = 0;\n for(int i=0; i<5; i++){\n for(int j=i+1; j<5; j++){\n for(int k=j+1; k<5; k++){\n ans += (long)march[i] * march[j] * march[k];\n }\n }\n }\n out.println(ans);\n \n }\n\n public static int gcd(int a, int b){\n if(b == 0) return a;\n return gcd(b, a%b);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n int N;\n cin >> N;\n map<char, ll> m;\n for (int i = 0; i < N; i++) {\n string S;\n cin >> S;\n m[S[0]]++;\n }\n ll ans = 0;\n char c[5] = {'M', 'A', 'R', 'C', 'H'};\n for (int i = 0; i < 5; i++) {\n for (int j = i + 1; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += m[c[i]] * m[c[j]] * m[c[k]];\n }\n }\n }\n cout << ans << endl;\n}", "import java.util.Scanner;\n\nclass Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n String s[] = new String [n];\n for(int i = 0;i < n;i++){\n s[i] = sc.next();\n }\n\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n for(int i = 0;i < n;i++){\n if(s[i].indexOf('M') == 0){\n m++;\n }\n if(s[i].indexOf('A') == 0){\n a++;\n }\n if(s[i].indexOf('R') == 0){\n r++;\n }\n if(s[i].indexOf('C') == 0){\n c++;\n }\n if(s[i].indexOf('H') == 0){\n h++;\n }\n }\n\n long sum = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n\n System.out.println(sum);\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n\nint main(){\n long n,m,a,r,c,h;\n m=0;a=0;r=0;c=0;h=0;\n cin>>n;\n string s;\n rep(i,n){\n cin>>s;\n if(s[0]=='M')m++;\n if(s[0]=='A')a++;\n if(s[0]=='R')r++;\n if(s[0]=='C')c++;\n if(s[0]=='H')h++;\n }\n \n cout<<m*a*(r+c+h) + m*r*(c+h) + m*c*h + a*r*(c+h) + a*c*h + r*c*h<<endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner reader = new Scanner(System.in);\n\t\tint N = reader.nextInt();\n\t\tlong[] arr = new long[5];\n\t\tString str = \"MARCH\";\n\t\tString remain = \"MARCH\";\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tchar ch = reader.next().charAt(0);\n\t\t\tint index = str.indexOf(ch);\n\t\t\tif (index != -1) {\n\t\t\t\tarr[index]++;\n\t\t\t\tremain = remain.replace(Character.toString(ch), \"\");\n\t\t\t}\n\t\t}\n\t\tint size = str.length() - remain.length();\n\t\tif (size < 3) {\n\t\t\tSystem.out.print(ans);\n\t\t\treturn;\n\t\t}\n\t\tlong[] only = new long[size];\n\t\tlong[] incre = new long[size];\n\t\tint count = 0;\n\t\tint current = 0;\n\t\twhile (count < size) {\n\t\t\tif (arr[current] > 0) {\n\t\t\t\tonly[count] = arr[current];\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tcurrent++;\n\t\t}\n\n\t\tincre[size-1] = only[size-1];\n\t\tfor (int i = size-2; i > 0; i--) {\n\t\t\tincre[i] = incre[i+1] + only[i];\n\t\t}\n\t\tfor (int i = 0; i < size - 2; i++) {\n\t\t\tfor (int j = i + 1; j < size - 1; j++) {\n\t\t\t\tans += only[i] * only[j] * incre[j+1];\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(ans);\n\t\treader.close();\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint numPpl = Integer.parseInt(scanner.nextLine());\n\t\tint M = 1;\n\t\tint A = 2;\n\t\tint R = 4;\n\t\tint C = 8;\n\t\tint H = 16;\n\t\tint[] numMARCH = new int[17];\n\t\tint[] comb3Chars = {\n\t\t\t\tM + A + R,\n\t\t\t\tM + A + C,\n\t\t\t\tM + A + H,\n\t\t\t\tM + R + C,\n\t\t\t\tM + R + H,\n\t\t\t\tM + C + H,\n\t\t\t\tA + R + C,\n\t\t\t\tA + R + H,\n\t\t\t\tA + C + H,\n\t\t\t\tR + C + H,\n\t\t\t\t};\n\n\t\tfor (int pIdx = 0; pIdx < numPpl; pIdx++) {\n\t\t\tchar firstChar = scanner.nextLine().charAt(0);\n\t\t\tif(firstChar == 'M') numMARCH[M]++;\n\t\t\tif(firstChar == 'A') numMARCH[A]++;\n\t\t\tif(firstChar == 'R') numMARCH[R]++;\n\t\t\tif(firstChar == 'C') numMARCH[C]++;\n\t\t\tif(firstChar == 'H') numMARCH[H]++;\n\t\t}\n\n\t\tlong result = 0;\n\t\tfor (int comb3Char: comb3Chars) {\n\t\t\tlong tmpResult = 1;\n\t\t\tif ((comb3Char & M) > 0) tmpResult = numMARCH[M] == 0L ? 0L : tmpResult * numMARCH[M];\n\t\t\tif ((comb3Char & A) > 0) tmpResult = numMARCH[A] == 0L ? 0L : tmpResult * numMARCH[A];\n\t\t\tif ((comb3Char & R) > 0) tmpResult = numMARCH[R] == 0L ? 0L : tmpResult * numMARCH[R];\n\t\t\tif ((comb3Char & C) > 0) tmpResult = numMARCH[C] == 0L ? 0L : tmpResult * numMARCH[C];\n\t\t\tif ((comb3Char & H) > 0) tmpResult = numMARCH[H] == 0L ? 0L : tmpResult * numMARCH[H];\n\t\t\tresult += tmpResult;\n\t\t}\n\t\tSystem.out.println(result);\n\t}\n}\n", "import itertools\nn = int(input())\ns = []\nc=0\nfor i in range(n):\n s.append(input()[0])\nseq = list(itertools.combinations([\"M\",\"A\",\"R\",\"C\",\"H\"],3))\nfor l in seq:\n c += s.count(l[0])*s.count(l[1])*s.count(l[2])\nprint(c)", "#include <cstdio>\n#include <map>\n\nint main()\n{\n std::map<char, long long> m;\n int n;\n scanf(\"%d\", &n);\n char s[11];\n for (int i = 0; i < n; ++i)\n {\n scanf(\"%s\", s);\n m[*s]++;\n }\n \n long long ans = 0;\n const char march[] = \"MARCH\";\n for (int i = 0; i < 3; ++i)\n {\n for (int j = i + 1; j < 4; ++j)\n {\n for (int k = j + 1; k < 5; ++k)\n {\n ans += m[march[i]] * m[march[j]] * m[march[k]];\n }\n }\n }\n printf(\"%lld\\n\", ans);\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n cin>>n;\n long long m=0,a=0,r=0,c=0,h=0;\n for(int i=0;i<n;i++){\n string s;\n cin>>s;\n if(s.at(0)=='M')m++;\n if(s.at(0)=='A')a++;\n if(s.at(0)=='R')r++;\n if(s.at(0)=='C')c++;\n if(s.at(0)=='H')h++;\n }\n cout<<m*(a*r+a*c+a*h+r*c+r*h+c*h)+a*(r*c+r*h+c*h)+r*c*h<<endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long n,m=0,a=0,r=0,c=0,h=0;\n string s;\n long long ans;\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>s;\n if(s[0]=='M'){m++;}\n else if(s[0]=='A'){a++;}\n else if(s[0]=='R'){r++;}\n else if(s[0]=='C'){c++;}\n else if(s[0]=='H'){h++;}\n }\n ans=m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;\n cout<<ans;\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CMarch solver = new CMarch();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CMarch {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n long[] c = new long[256];\n int n = in.nextInt();\n for (int i = 0; i < n; i++) {\n c[in.next().charAt(0)]++;\n }\n long ans = 0;\n ans += c['M'] * c['A'] * c['R'];\n ans += c['M'] * c['A'] * c['C'];\n ans += c['M'] * c['A'] * c['H'];\n ans += c['M'] * c['R'] * c['C'];\n ans += c['M'] * c['R'] * c['H'];\n ans += c['M'] * c['C'] * c['H'];\n ans += c['A'] * c['R'] * c['C'];\n ans += c['A'] * c['R'] * c['H'];\n ans += c['A'] * c['C'] * c['H'];\n ans += c['R'] * c['C'] * c['H'];\n out.println(ans);\n }\n\n }\n}\n\n", "N=int(input())\nname=[input()[0] for _ in range(N)]\nm=name.count(\"M\")\na=name.count(\"A\")\nr=name.count(\"R\")\nc=name.count(\"C\")\nh=name.count(\"H\")\nprint(m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h)", "import itertools\n\nn = int(input())\n\nT = 'MARCH'\nct = [0 for _ in range(5)]\nfor _ in range(n):\n s = input()\n if s[0] not in T:\n continue\n ct[T.find(s[0])] += 1\n\nans = 0\nfor x,y,z in itertools.combinations(ct,3):\n ans += x*y*z\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int64_t n,i,j,k,ans=0;\n string s;\n vector<int64_t> z(5);\n cin>>n;\n for(i=0;i<n;i++){\n cin>>s;\n if(s.at(0)=='M') z.at(0)++;\n else if(s.at(0)=='A') z.at(1)++;\n else if(s.at(0)=='R') z.at(2)++;\n else if(s.at(0)=='C') z.at(3)++;\n else if(s.at(0)=='H') z.at(4)++;\n }\n for(i=0;i<3;i++) for(j=i+1;j<4;j++)for(k=j+1;k<5;k++) ans+=z.at(i)*z.at(j)*z.at(k);\n cout<<ans<<endl;\n}", "#include<bits/stdc++.h>\n#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)\n#define all(v) v.begin(), v.end()\nusing ll = long long;\nusing namespace std;\n\nint main() {\n int n;cin>>n;\n string s;\n ll m=0,a=0,r=0,c=0,h=0;\n rep(i,n){\n cin>>s;\n if(s[0]=='M')m++;\n if(s[0]=='A')a++;\n if(s[0]=='R')r++;\n if(s[0]=='C')c++;\n if(s[0]=='H')h++;\n }\n cout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;\n}", "import itertools\nN = int(input())\nS = [input()[0] for i in range(N)]\nmarch = [\"M\", \"A\", \"R\", \"C\", \"H\"]\nsum = 0\nfor c in list(itertools.combinations(march,3)):\n sum += S.count(c[0]) * S.count(c[1]) * S.count(c[2])\nprint(sum)", "#include <iostream>\n#include <map>\nusing namespace std;\nint N; long long ans;\nchar c[10]; map<char, long long> m;\nchar I[5] = {'M', 'A', 'R', 'C', 'H'};\nint main() {\n scanf(\"%d\", &N);\n for(int i = 0; i < N; i++) {\n cin >> c; m[c[0]]++;\n }\n for(int i = 0; i < 3; i++) {\n for(int j = i+1; j < 4; j++) {\n for(int k = j+1; k < 5; k++) {\n ans += m[I[i]]*m[I[j]]*m[I[k]];\n }\n }\n }\n cout << ans;\n}", "import itertools as i,collections as c\nb=c.Counter(s[0]for s in open(0).readlines()[1:] if s[0]in\"MARCH\")\nprint(sum(p*q*r for p,q,r in i.combinations(b.values(),3)))", "import java.util.HashMap;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tString[] s = new String[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ts[i] = sc.next();\n\t\t}\n\n\t\tHashMap<Character, Integer> hm = new HashMap<>();\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\thm.put(s[i].charAt(0), hm.getOrDefault(s[i].charAt(0), 0) + 1);\n\t\t}\n\n\t\tchar[] c = { 'M', 'A', 'R', 'C', 'H' };\n\t\tint[] ar = new int[5];\n\t\tfor (int i = 0; i < ar.length; i++) {\n\t\t\tar[i] = hm.getOrDefault(c[i], 0);\n\t\t\t//\t\t\tSystem.out.println(ar[i]);\n\t\t}\n\n\t\tlong ans = 0l;\n\t\tans += (long) ar[0] * ar[1] * ar[2];\n\t\tans += (long) ar[0] * ar[1] * ar[3];\n\t\tans += (long) ar[0] * ar[1] * ar[4];\n\t\tans += (long) ar[0] * ar[2] * ar[3];\n\t\tans += (long) ar[0] * ar[2] * ar[4];\n\t\tans += (long) ar[0] * ar[3] * ar[4];\n\t\tans += (long) ar[1] * ar[2] * ar[3];\n\t\tans += (long) ar[1] * ar[2] * ar[4];\n\t\tans += (long) ar[1] * ar[3] * ar[4];\n\t\tans += (long) ar[2] * ar[3] * ar[4];\n\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\n\nlong long A[10];\n\nint main(){\n\tint n;\n\tstring s;\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tcin >> s;\n\t\tif(s[0]=='M') A[0]++;\n\t\tif(s[0]=='A') A[1]++;\n\t\tif(s[0]=='R') A[2]++;\n\t\tif(s[0]=='C') A[3]++;\n\t\tif(s[0]=='H') A[4]++;\n\t}\n\t\n\tlong long sum=0;\n\tfor(int i=0;i<5;i++){\n\t\tfor(int j=i+1;j<5;j++){\n\t\t\tfor(int k=j+1;k<5;k++){\n\t\t\t\tsum+=A[i]*A[j]*A[k];\n\t\t\t}\n\t\t}\n\t}\n\t\n\tcout << sum << endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main{\n\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n\n // input\n int num = scan.nextInt();\n long[] initial = new long[5];\n for(int i = 0; i < num; i++){\n String temp = scan.next();\n switch(temp.charAt(0)){\n case 'M':\n initial[0] += 1;\n break;\n case 'A':\n initial[1] += 1;\n break;\n case 'R':\n initial[2] += 1;\n break;\n case 'C':\n initial[3] += 1;\n break;\n case 'H':\n initial[4] += 1;\n }\n }\n\n // search\n long sum = 0;\n for(int a = 0; a < 3; a++){\n for(int b = a + 1; b < 4; b++){\n for(int c = b + 1; c < 5; c++){\n if(initial[a] == 0 || initial[b] == 0 || initial[c] == 0){\n continue;\n }\n sum += initial[a] * initial[b] * initial[c];\n }\n }\n }\n\n // answer\n System.out.println(sum);\n\n }\n}", "import collections\ndef dfs(i, cumul, cc, k, s): return (cumul if k == 0 else 0) if (i == len(s) or k == 0) else (dfs(i+1, cumul * cc[s[i]], cc,k - 1, s) +dfs(i+1, cumul, cc, k, s))\nprint dfs(0, 1 , collections.Counter([raw_input()[0] for _ in range(int(raw_input()))]), 3, 'MARCH')\n", "/*\n * Click `Run` to execute the snippet below!\n */\n\nimport java.io.*;\nimport java.util.*;\n\n/*\n * To execute Java, please define \"static void main\" on a class\n * named Solution.\n *\n * If you need more classes, simply define them inline.\n */\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n String march = \"MARCH\";\n TreeMap<Character,Integer> mp = new TreeMap<Character, Integer>();\n for(int i = 0; i<5; i++){\n mp.put(march.charAt(i), 0); \n }\n for(int i = 1; i<=N; i++){\n String s = sc.next();\n mp.put(s.charAt(0), mp.containsKey(s.charAt(0)) ? mp.get(s.charAt(0))+1 : 1);\n }\n long ans = 0;\n for(int i = 0; i<5; i++){\n for(int j = i+1; j<5; j++){\n for(int k = j+1; k<5; k++){\n ans += 1L * mp.get(march.charAt(i)) * mp.get(march.charAt(j)) * mp.get(march.charAt(k));\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nll s[5];\n\nint main(){\n\tint N;\n\tcin>>N;\n\tfor(int i=0;i<N;i++){\n\t\tstring str;\n\t\tcin>>str;\n\t\tif(str[0]=='M')s[0]++;\n\t\tif(str[0]=='A')s[1]++;\n\t\tif(str[0]=='R')s[2]++;\n\t\tif(str[0]=='C')s[3]++;\n\t\tif(str[0]=='H')s[4]++;\n\t}\n\tll ans=0;\n\tfor(int i=0;i<3;i++){\n\t\tfor(int j=i+1;j<4;j++){\n\t\t\tfor(int k=j+1;k<5;k++){\n\t\t\t\tans+=s[i]*s[j]*s[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n\tios::sync_with_stdio(0);\n\t\n\tll n;\n\tcin >> n;\n\tstring s;\n\tll m = 0, a = 0, r = 0, c = 0, h = 0;\n\twhile (cin >> s) {\n\t\tif (s[0] == 'M') m++;\n\t\tif (s[0] == 'A') a++;\n\t\tif (s[0] == 'R') r++;\n\t\tif (s[0] == 'C') c++;\n\t\tif (s[0] == 'H') h++;\n\t}\n\tll ans;\n\tans = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n\tcout << ans;\n\t\n\treturn 0;\n}", "import collections\ncc = collections.Counter()\nfor _ in range(int(raw_input())): \n\ts = raw_input()\n\tcc[s[0]] +=1\t\n\ndef dfs(i, total ,cumul, cc, k, s):\n\tif i == len(s):\n\t\tif k == 0:\n\t\t\ttotal[0] += cumul\n\t\treturn \n\n\tdfs(i+1, total, cumul * cc[s[i]], cc,k - 1, s)\n\tdfs(i+1, total, cumul, cc, k, s)\n\ntotal = [0]\ndfs(0, total, 1 , cc, 3, 'MARCH')\nprint total[0]", "one = {'M':0, 'A':0, 'R':0, 'C':0, 'H':0}\nn=int(input())\nfor i in range(n):\n c=input()[0]\n one[c] = one.get(c,0)+1\nm,a,r,c,h=one['M'],one['A'],one['R'],one['C'],one['H']\nprint(m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h)", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n private static Map<Character, Integer> map = new HashMap<Character, Integer>() {\n {\n put('M', 0);\n put('A', 1);\n put('R', 2);\n put('C', 3);\n put('H', 4);\n }\n };\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n String[] s = new String[n];\n long[] cnt = new long[5];\n for (int i = 0; i < n; i++) {\n s[i] = sc.next();\n char c = s[i].charAt(0);\n if (!map.containsKey(c)) {\n continue;\n }\n cnt[map.get(c)]++;\n }\n long sum = 0;\n for (int i = 0; i < map.size(); i++) {\n for (int j = i + 1; j < map.size(); j++) {\n for (int k = j + 1; k < map.size(); k++) {\n sum += cnt[i] * cnt[j] * cnt[k];\n }\n }\n }\n System.out.println(sum);\n }\n\n}\n", "import java.util.Scanner;\n\n\npublic class Main {\n\t\n\tstatic int[][] memory;\n\t\n public static void main(String[] args) {\n // 自分の得意な言語で\n // Let's チャレンジ！！\n\n Scanner sc = new Scanner(System.in);\n \n int N = sc.nextInt();\n \n int count = 0;\n int[] member = new int[5];\n \n for(int i = 0;i<N;i++){\n \t\n \tString line = sc.next();\n \t\n \tif('M'==line.charAt(0)){\n \t\tmember[0]++;\n \t\t\n \t}else if('A'==line.charAt(0)){\n \t\tmember[1]++;\n \t}else if('R'==line.charAt(0)){\n \t\tmember[2]++;\n \t}else if('C'==line.charAt(0)){\n \t\tmember[3]++;\n \t}else if('H'==line.charAt(0)){\n \t\tmember[4]++;\n \t}\n \t\n \t\n \t\n }\n \n long ans = result(member,0,0);\n \n System.out.println(ans);\n\t\t\n\t}\n\n\tprivate static long result(int[] member,int count,int choise) {\n\t\t\n\t\tlong ans=1;\n\t\t\n\t\tif(choise==4)\n\t\t\tif(count==2)\treturn member[choise];\n\t\t\telse if(count==3)\treturn 1;\n\t\t\telse return 0;\n\t\t\n\t\tif(count<3&&member[choise]>0){\n\t\t\tans = (result(member,count,choise+1)+result(member,count+1,choise+1)*member[choise]);\n\t\t}else{\n\t\t\tans = result(member,count,choise+1);\n\t\t}\n\t\t\n\t\treturn ans;\n\t\t\n\t}\n\t\t\n\n \n}", "n=int(input())\np=[]\nfor i in range(n):\n s=input()\n p.append(s[0])\nm=p.count(\"M\")\na=p.count(\"A\")\nr=p.count(\"R\")\nc=p.count(\"C\")\nh=p.count(\"H\")\nprint(m*a*r+m*a*h+m*a*c+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h)", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(){\n string march = \"MARCH\";\n int N;\n cin >> N;\n long long C[26];\n fill(C,C+26,0);\n for(int i = 0; i < N; ++i){\n string s;\n cin >> s;\n ++C[s[0]-'A'];\n }\n long long ans = 0;\n for(int i = 0; i < 5; ++i){\n for(int j = 0; j < i; ++j){\n for(int k = 0; k < j; ++k){\n ans += C[march[i]-'A']*C[march[j]-'A']*C[march[k]-'A'];\n }\n }\n }\n cout << ans << endl;\n}\n", "from itertools import combinations as c\nn = int(input())\nS = [input().replace(\"\\n\", \"\")[0] for _ in range(n)]\ncnt = [S.count(i) for i in \"MARCH\"]\nprint(sum(i*j*k for i, j, k in c(cnt, 3)))", "N=int(input())\nname=[input()[0] for _ in range(N)]\nm,a,r,c,h=name.count(\"M\"),name.count(\"A\"),name.count(\"R\"),name.count(\"C\"),name.count(\"H\")\nprint(m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h)", "from collections import Counter\nfrom itertools import combinations\nN = int(input())\nS = [input()[0] for _ in range(N)]\ncnt = Counter(S)\nans = 0\nfor elem in combinations('MARCH', 3):\n ans += cnt[elem[0]]*cnt[elem[1]]*cnt[elem[2]]\nprint(ans)\n\n", "N = int(input())\nS = [input()[0] for i in range(N)]\nM = S.count('M')\nA = S.count('A')\nR = S.count('R')\nC = S.count('C')\nH = S.count('H')\nprint(M*A*R + M*A*C + M*A*H + M*R*C + M*R*H + M*C*H + A*R*C + A*R*H + A*C*H + R*C*H)", "#include <bits/stdc++.h>\nusing namespace std;\nconst int march[5] = {0, 2, 7, 12, 17};\nint main(){\n int N;\n cin >> N;\n long long name[26] = {};\n string S;\n for(int i = 0; i < N; i++){\n cin >> S;\n name[int(S[0]) - 65] += 1;\n }\n long long ans = 0;\n for(int i = 0; i < 3; i++){\n for(int j = i + 1; j < 4; j++){\n for(int k = j + 1; k < 5; k++){\n ans += name[march[i]] * name[march[j]] * name[march[k]];\n }\n }\n }\n cout << ans << endl;\n return 0;\n}", "#!/usr/bin/env python\n\nfrom collections import deque\nimport itertools as it\nimport sys\nimport math\n\nsys.setrecursionlimit(1000000)\n\nN = input()\nA = [0, 0, 0, 0, 0]\nfor i in range(N):\n S = raw_input()\n if S[0] in 'MARCH':\n A['MARCH'.find(S[0])] += 1\n\nans = 0\n\nfor a, b, c in it.combinations(A, 3):\n ans += a * b * c\n\nprint ans", "import java.util.Arrays;\nimport java.util.Scanner;\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tsc.nextLine();\n\t\t\n\t\tlong[] map = new long[26];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tchar S = sc.nextLine().charAt(0);\n\t\t\tswitch(S) {\n\t\t\t\tcase 'M':\n\t\t\t\tcase 'A':\n\t\t\t\tcase 'R':\n\t\t\t\tcase 'C':\n\t\t\t\tcase 'H':\n\t\t\t\t\tmap[(int) S - 65] += 1;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tArrays.sort(map);\n\t\tlong[] march = Arrays.copyOfRange(map, 21, 26);\n\t\t\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = i + 1; j < 4; j++) {\n\t\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\t\tans += march[i] * march[j] * march[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}", "import itertools\nn = int(raw_input())\n\nd = {'M':0,'A':0,'R':0,'C':0,'H':0}\n\nfor i in range(n):\n\ts = raw_input()\n\tif d.has_key(s[0]):\n\t\td[s[0]] += 1\n\ncount = 0\n\nfor comb in list(itertools.combinations(d.keys(),3)):\n\tcount += d[comb[0]]* d[comb[1]]*d[comb[2]]\n\nprint count", "#include<iostream>\nusing namespace std;\nlong ans,n,a[6];\nstring s;\nint main()\n{\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>s;\n\t\ta[s[0]=='M'?0:s[0]=='A'?1:s[0]=='R'?2:s[0]=='C'?3:s[0]=='H'?4:5]++;\n\t}\n\tfor(int i=0;i<5;i++)\n\t{\n\t\tfor(int j=i+1;j<5;j++)\n\t\t{\n\t\t\tfor(int k=j+1;k<5;k++)\n\t\t\t{\n\t\t\t\tans+=a[i]*a[j]*a[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[]args) {\n\t\ttry(Scanner scan = new Scanner(System.in)){\n\t\t\tint N = scan.nextInt();\n\t\t\t\n\t\t\tString [] S = new String[N];\n\t\t\tMap<String,Integer>map = new HashMap<String,Integer>();\n\t\t\tfor(int i = 0;i<N;i++) {\n\t\t\t\tS[i] = scan.next();\n\t\t\t\tchar a = S[i].charAt(0);\n\t\t\t\t\n\t\t\t\tif(a=='M'||a=='A'||a=='R'||a=='C'||a=='H') {\n\t\t\t\t\tif(map.containsKey(S[i].substring(0, 1))){\n\t\t\t\t\t\tmap.put(S[i].substring(0, 1), map.get(S[i].substring(0, 1))+1);\n\t\t\t\t\t\t}else {\n\t\t\t\t\t\t\tmap.put(S[i].substring(0, 1), 1);\n\t\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tlong []shu = new long[map.size()];\n\t\t\tint k = 0;\n\t\t\tfor(String key:map.keySet()) {\n\t\t\t\tshu[k] = map.get(key);\n\t\t\t\tk++;\n\t\t\t}\n\t\t\t\n\t\t\tlong goukei = 0;\n\t\t\t\n\t\t\tif(map.size()<3) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t\t\n\t\t\t}else{\n\t\t\t\t\n\t\t\t\tfor(int i = 0;i<map.size()-2;i++) {\n\t\t\t\t\tfor(int j = i+1;j<map.size()-1;j++) {\n\t\t\t\t\t\tfor(int z=j+1;z<map.size();z++) {\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tgoukei+=shu[i]*shu[j]*shu[z];\n\t\t\t\t\t\t\t//System.out.println(shu[i]*shu[j]*shu[z]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tSystem.out.println(goukei);\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t}\n\t\t\n\n}\n", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint N = sc.nextInt();\n\t\tchar[] alp = new char[]{'M','A','R','C','H'};\n\t\tlong[] count = new long[5];\n\t\tfor( int i=1; i<=N; i++ ){\n\t\t\tString ss = sc.next();\n\t\t\tchar cc = ss.charAt(0);\n\t\t\tfor( int j=0; j<=4; j++ ){\n\t\t\t\tif( cc==alp[j] ){\n\t\t\t\t\tcount[j]++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor( int i=0; i<=2; i++ ){\n\t\t\tfor( int j=i+1; j<=3; j++ ){\n\t\t\t\tfor( int k=j+1; k<=4; k++ ){\n\t\t\t\t\tans += count[i]*count[j]*count[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "N = int(raw_input())\n\nline = ['a' for i in range(N)]\n\nlis = [ 0 for i in range(5)]\n\nfor i in range(N):\n lit = raw_input()\n if lit[0] == 'M':\n lis[0] += 1\n elif lit[0] == 'A':\n lis[1] += 1\n elif lit[0] == 'R':\n lis[2] += 1\n elif lit[0] == 'C':\n lis[3] += 1\n elif lit[0] == 'H':\n lis[4] += 1\n\ntot = (lis[0] * lis[1] * (lis[2] + lis[3] + lis[4]) + lis[0] * lis[2] * (lis[3] + lis[4]) + lis[0] * lis[3] * lis[4] + \n lis[1] * lis[2] * (lis[3] + lis[4]) + lis[1] * lis[3] * lis[4] + lis[2] * lis[3] * lis[4])\n\nprint tot", "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tlong[] march = new long[5];\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tString S = sc.next();\n\t\t\tif(S.charAt(0) == 'M')\n\t\t\t\tmarch[0] += 1;\n\t\t\tif(S.charAt(0) == 'A')\n\t\t\t\tmarch[1] += 1;\n\t\t\tif(S.charAt(0) == 'R')\n\t\t\t\tmarch[2] += 1;\n\t\t\tif(S.charAt(0) == 'C')\n\t\t\t\tmarch[3] += 1;\n\t\t\tif(S.charAt(0) == 'H')\n\t\t\t\tmarch[4] += 1;\n\t\t}\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < 3; i++) {\n\t\t\tfor(int j = i+1; j < 4; j++) {\n\t\t\t\tfor(int k = j+1; k < 5; k++) {\n\t\t\t\t\tans += march[i]*march[j]*march[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define ll long long int\n\nint main(){\nint n;\ncin>>n;\nstring S[n];\nmap<char,ll>m;\nrep(i,n){\n cin>>S[i];\n m[S[i][0]]++;\n}\nchar a[5]={'M','A','R','C','H'};\nll count=0;\nfor(int i=0;i<3;i++){\n for(int j=i+1;j<4;j++){\n for(int k=j+1;k<5;k++){\n\ncount+=m[a[i]]*m[a[j]]*m[a[k]];\n\n }\n }\n}\n\n\ncout<<count<<endl;\n return 0;\n}\n", "import itertools as ite\nN=int(input())\nC=[0]*6\nJ=\"MARCH\"\nfor i in range(N):\n C[J.find(input()[0])]+=1\nans=0\nfor i,j,k in list(ite.combinations(range(5),3)):\n ans+=C[i]*C[j]*C[k]\nprint(ans)\n", "import java.io.InputStream;\nimport java.io.PrintStream;\nimport java.util.Scanner;\n\npublic class Main {\n\tInputStream in = System.in;\n\tPrintStream out = System.out;\n\n\tprivate long f(int[] s, int i, int n) { \n\t\tif (n == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tif (s.length <= i) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tlong result = 0;\n\t\tresult += s[i] * f(s, i + 1, n - 1);\n\t\tresult += f(s, i + 1, n);\n\n\t\treturn result;\n\t}\n\n\tpublic void _main(String[] args) {\n\t\tScanner sc = new Scanner(in);\n\n\t\tint N = sc.nextInt();\n\t\tint[] s = new int[5];\n\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tString S = sc.next();\n\t\t\tswitch (S.charAt(0)) {\n\t\t\tcase 'M':\n\t\t\t\ts[0]++;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\ts[1]++;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\ts[2]++;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\ts[3]++;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\ts[4]++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tsc.close();\n\n\t\tlong ans = f(s, 0, 3);\n\n\t\tout.println(ans);\n\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main()._main(args);\n\t}\n}\n", "import java.util.*;\n\n// さっきの提出がWAになるのでとりあえずintをlongにしてみる\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\n\t\tlong a[];\n\t\ta = new long[5];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString str = sc.next();\n\t\t\tif (str.matches(\"M.*\")) {\n\t\t\t\ta[0]++;\n\t\t\t}\n\t\t\tif (str.matches(\"A.*\")) {\n\t\t\t\ta[1]++;\n\t\t\t}\n\t\t\tif (str.matches(\"R.*\")) {\n\t\t\t\ta[2]++;\n\t\t\t}\n\t\t\tif (str.matches(\"C.*\")) {\n\t\t\t\ta[3]++;\n\t\t\t}\n\t\t\tif (str.matches(\"H.*\")) {\n\t\t\t\ta[4]++;\n\t\t\t}\n\t\t}\n\n\t\tlong result = 0;\n\n\t\tresult += a[0] * a[1] * a[2];\n\t\tresult += a[0] * a[1] * a[3];\n\t\tresult += a[0] * a[1] * a[4];\n\t\tresult += a[0] * a[2] * a[3];\n\t\tresult += a[0] * a[2] * a[4];\n\t\tresult += a[0] * a[3] * a[4];\n\t\tresult += a[1] * a[2] * a[3];\n\t\tresult += a[1] * a[2] * a[4];\n\t\tresult += a[1] * a[3] * a[4];\n\t\tresult += a[2] * a[3] * a[4];\n\t\tSystem.out.println(result);\n\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n String s[] = new String[n];\n String march = \"MARCH\";\n long[] d = new long[5];\n for(int i=0;i<n;i++){\n s[i] = scanner.next();\n for(int j=0;j<5;j++){\n if(s[i].charAt(0) == march.charAt(j)){\n d[j]++;\n break;\n }\n }\n }\n\n int[] x = {0,0,0,0,0,0,1,1,1,2};\n int[] y = {1,1,1,2,2,3,2,2,3,3};\n int[] z = {2,3,4,3,4,4,3,4,4,4};\n long allCount = 0;\n for(int i=0;i<10;i++){\n allCount += d[x[i]] * d[y[i]] * d[z[i]];\n }\n System.out.println(allCount);\n }\n\n}\n", "import java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tint N = scn.nextInt();\n\t\tlong[] num = new long[5];\n\t\tscn.nextLine();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tchar[] buf = scn.nextLine().toCharArray();\n\t\t\tswitch (buf[0]) {\n\t\t\tcase 'M':\n\t\t\t\tnum[0]++;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tnum[1]++;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tnum[2]++;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tnum[3]++;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tnum[4]++;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tlong ans = 0;\n\t\tfor(int i = 0;i < 3;i++) {\n\t\t\tfor(int j = i+1;j < 4;j++) {\n\t\t\t\tfor(int k = j+1;k < 5;k++) {\n\t\t\t\t\tans += num[i] * num[j] * num[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "from itertools import combinations\nn = int(input())\ns = [input()[0] for _ in range(n)]\nc = [s.count(i) for i in 'MARCH']\nprint(sum(c[i]*c[j]*c[k] for i, j, k in combinations(range(5), 3)))", "from itertools import *\nN = int(input())\nS = [input() for n in range(N)]\nD = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nans = 0\n\nfor s in S:\n if s[0] in \"MARCH\":\n D[s[0]]+=1\n\nfor a,b,c in combinations(D.values(),3):\n ans+=a*b*c\n\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nsigned main() {\n int N;\n cin>>N;\n vector<string>v(N);\n int a=0;\n int b=0;\n int c=0;\n int d=0;\n int e=0;\n for(int i=0;i<N;i++){\n cin>>v[i];\n if(v[i][0]=='M')a++;\n if(v[i][0]=='A')b++;\n if(v[i][0]=='R')c++;\n if(v[i][0]=='C')d++;\n if(v[i][0]=='H')e++;\n }\n cout<<a*b*(c+d+e)+a*c*(d+e)+a*d*e+b*c*(d+e)+b*d*e+c*d*e<<endl;\n}\n", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] a= new long[5];\n char[] c;\n for(int i=0;i<N;i++)\n {\n c = sc.next().toCharArray();\n if(c[0]=='M') a[0]++;\n else if(c[0]=='A') a[1]++;\n else if(c[0]=='R') a[2]++;\n else if(c[0]=='C') a[3]++;\n else if(c[0]=='H') a[4]++;\n }\n\n long sum = 0;\n \n for(int i=0;i<3;i++)\n {\n for(int k=i+1;k<4;k++)\n {\n for(int j=k+1;j<5;j++)\n {\n sum+= a[i]*a[k]*a[j];\n }\n }\n }\n System.out.println(sum);\n }\n}", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\n\t/** 選ぶ人数 */\n\tprivate static final int N = 3;\n\t/** 対象となる頭文字 */\n\tprivate static final Set<Character> MARCHS = Set.of('M', 'A', 'R', 'C', 'H');\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint n = scanner.nextInt();\n\t\t\tMap<Character, Integer> map = new HashMap<>();\n\t\t\tIntStream.range(0, n).forEach(i -> {\n\t\t\t\tString s = scanner.next();\n\t\t\t\tchar c = s.charAt(0);\n\t\t\t\tif (MARCHS.contains(c)) {\n\t\t\t\t\tmap.put(c, map.getOrDefault(c, 0) + 1);\n\t\t\t\t}\n\t\t\t});\n\t\t\tint[] count = map.values().stream().mapToInt(Integer::intValue).toArray();\n\t\t\tSystem.out.println(IntStream.range((1 << N) - 1, (1 << count.length)).filter(i -> N == Integer.bitCount(i))\n\t\t\t\t\t.mapToLong(i -> IntStream.range(0, count.length).filter(j -> 0 != (i & (1 << j)))\n\t\t\t\t\t\t\t.mapToLong(j -> (long) count[j]).reduce(1L, (a, b) -> a * b))\n\t\t\t\t\t.sum());\n\t\t}\n\t}\n}\n", "N=int(input())\nS=[input()[0] for _ in range(N)]\nfrom collections import Counter\nS=Counter(S)\nM=S[\"M\"]\nA=S[\"A\"]\nR=S[\"R\"]\nC=S[\"C\"]\nH=S[\"H\"]\nprint(M*A*(R+C+H)+(M+A)*R*(C+H)+(M+A+R)*C*H)", "#pragma GCC optimize(\"Ofast\")\n#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n;\n\tlong long m=0,a=0,r=0,c=0,h=0;\n\tstring s;\n\tcin>>n;\n\twhile(cin>>s)\n\t\tswitch(s[0]){\n\t\tcase'M':\n\t\t\tm++;\n\t\t\tbreak;\n\t\tcase'A':\n\t\t\ta++;\n\t\t\tbreak;\n\t\tcase'R':\n\t\t\tr++;\n\t\t\tbreak;\n\t\tcase'C':\n\t\t\tc++;\n\t\t\tbreak;\n\t\tcase'H':\n\t\t\th++;\n\t\t}\n\tcout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h<<endl;\n}\n", "#include<cstring>\n#include<algorithm>\n#include<iostream>\n#include<cstdio>\nusing namespace std;\ntypedef long long ll;\nchar s[205];\nint main(){\n int n;\n ll m=0,a=0,r=0,c=0,h=0;\n scanf(\"%d\",&n);\n for(int i=0;i<n;i++){\n cin>>s;\n if(s[0]=='M') m++;\n if(s[0]=='A') a++;\n if(s[0]=='R') r++;\n if(s[0]=='C') c++;\n if(s[0]=='H') h++;\n }\n ll res=m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h;\n cout<<res;\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(){\n\tint n;\n\tlong long a=0, c=0, h=0, m=0, r=0, ans=0;\n\tcin >> n;\n\tstring s;\n\tfor(int i=0; i<n; i++){\n\t\tcin >> s;\n\t\tif(s[0]=='A') a++;\n\t\telse if(s[0]=='C') c++;\n\t\telse if(s[0]=='H') h++;\n\t\telse if(s[0]=='M') m++;\n\t\telse if(s[0]=='R') r++;\n\t}\n\tans += a*(c*h+c*m+c*r+h*m+h*r+m*r) + c*(h*m+h*r+m*r) + h*m*r;\n\tcout << ans << endl;\n}\n", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.HashSet;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Main main = new Main();\n main.solve();\n }\n public void solve() {\n Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n int N = scan.nextInt();\n long[] d = new long[6];\n for (int i = 0; i < N; i++) {\n String s = scan.next();\n char c = s.toCharArray()[0];\n int index = index(c);\n d[index] += 1;\n }\n long answer = 0;\n for (int i = 1; i <= 5; i++) {\n for (int j = i+1; j <= 5; j++) {\n for (int k = j+1; k <= 5; k++) {\n answer += d[i]*d[j]*d[k];\n }\n }\n }\n System.out.println(answer);\n }\n\n public int index(char c) {\n if (c == 'M') {\n return 1;\n }\n if (c == 'A') {\n return 2;\n }\n if (c == 'R') {\n return 3;\n }\n if (c == 'C') {\n return 4;\n }\n if (c == 'H') {\n return 5;\n }\n return 0;\n }\n}\n", "from itertools import*;d={};g=d.get\nfor t in open(0).read().split():d[t[0]]=g(t[0],0)+1\nprint(sum(g(p,0)*g(q,0)*g(r,0)for p,q,r in combinations('MARCH',3)))", "from itertools import *\nN = int(input())\nS = [input() for n in range(N)]\nD = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\n\nfor s in S:\n if s[0] in \"MARCH\":\n D[s[0]]+=1\n\nprint(sum(a*b*c for a,b,c in combinations(D.values(),3)))", "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nlong long ans;\nlong long s[10];\nchar str[50];\nint main()\n{\n\tscanf(\"%d\",&n);\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\"%s\",&str);\n\t\tif(str[0]=='M') s[1]++;\n\t\tif(str[0]=='A') s[2]++;\n\t\tif(str[0]=='R') s[3]++;\n\t\tif(str[0]=='C') s[4]++;\n\t\tif(str[0]=='H') s[5]++;\n\t}\n\tfor(int i=1;i<=5;i++)\n\tfor(int j=i+1;j<=5;j++)\n\tfor(int k=j+1;k<=5;k++)\n\tans+=(long long)s[i]*s[j]*s[k];\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "#include<bits/stdc++.h>\ntypedef long long ll;\nusing namespace std;\nint INF = 1LL << 30;\nint MOD = 1e9+7;\nint main(){\n int N;\n ll cnt[5] = {};\n cin >> N;\n for(int i = 0;i < N;i++){\n string s,str = \"MARCH\"; \n cin >> s;\n for(int j = 0;j < 5;j++)if(s[0] == str[j])cnt[j]++;\n }\n ll sum = 0;\n for(int i = 0;i < 5;i++)for(int j = i+1;j < 5;j++)for(int k = j+1;k < 5;k++){\n sum += cnt[i] * cnt[j] * cnt[k];\n }\n cout << sum << endl;\n}", "import itertools\nN = int(input())\nX = [input()[0] for _ in range(N)]\nM = X.count(\"M\")\nA = X.count(\"A\")\nR = X.count(\"R\")\nC = X.count(\"C\")\nS = 0\nH = X.count(\"H\")\nfor s in itertools.combinations([M, A, R, C, H], 3):\n S += s[0]*s[1]*s[2]\nprint(S)", "#include<bits/stdc++.h>\nusing namespace std;\nlong long m,a,r,c,h;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(s[0]=='M')\n\t\tm++;\n\t\tif(s[0]=='A')\n\t\ta++;\n\t\tif(s[0]=='R')\n\t\tr++;\n\t\tif(s[0]=='C')\n\t\tc++;\n\t\tif(s[0]=='H')\n\t\th++;\n\t}\n\tcout<<m*a*h+m*a*c+m*a*r+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;\n } ", "import java.util.*;\nimport java.util.HashSet;\nimport java.util.Set;\npublic class Main{\n public static void main(String[]args){\n Scanner sc=new Scanner(System.in);\n int N=sc.nextInt();\n long m=0;\n long a=0;\n long r=0;\n long c=0;\n long h=0;\n String[]namae=new String[N];\n for(int i=0;i<N;i++){\n namae[i]=sc.next();\n char[]aa=namae[i].toCharArray();\n if(aa[0]=='M'){\n m++;\n }\n if(aa[0]=='A'){\n a++;\n }\n if(aa[0]=='R'){\n r++;\n }\n if(aa[0]=='C'){\n c++;\n }\n if(aa[0]=='H'){\n h++;\n }\n }\n long sum=0;\n sum+=m*a*r;\n sum+=m*a*c;\n sum+=m*a*h;\n sum+=m*r*c;\n sum+=m*r*h;\n sum+=m*c*h;\n sum+=a*r*c;\n sum+=a*r*h;\n sum+=a*c*h;\n sum+=r*c*h;\n System.out.println(sum);\n \n \n \n\n }\n \n \n }", "#include <iostream>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\nlong long N,m = 0,a = 0,r = 0,c = 0,h = 0;\nstring S;\n\nint main(){\n\tcin >> N;\n\tlong long ans = 0;\n\tfor(int i=0;i<N;i++){\n\t\tcin >> S;\n\t\tif(S[0] == 'M') m++;\n\t\tif(S[0] == 'A') a++;\n\t\tif(S[0] == 'R') r++;\n\t\tif(S[0] == 'C') c++;\n\t\tif(S[0] == 'H') h++;\n\t}\n\tans = m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;\n\tcout << ans << endl;\n}", "import java.util.*;\nimport java.awt.*;\nimport static java.lang.System.*;\nimport static java.lang.Math.*;\npublic class Main {\n static int mod=1000000007;\n public static void main(String[]$) {\n Scanner sc = new Scanner(in);\n int n=sc.nextInt();\n long[] c=new long[5];\n for (int i = 0; i < n; i++) {\n char p=sc.next().charAt(0);\n switch (p){\n case 'M':c[0]++;break;\n case 'A':c[1]++;break;\n case 'R':c[2]++;break;\n case 'C':c[3]++;break;\n case 'H':c[4]++;break;\n default:break;\n }\n }\n long ans=0;\n for (int i = 0; i < 3; i++) {\n for (int j = i+1; j < 4; j++) {\n for (int k = j+1; k < 5; k++) {\n ans+=c[i]*c[j]*c[k];\n }\n }\n }\n out.println(ans);\n }\n}", "N = int(input())\nS = \"MARCH\"\ndic = {s:0 for s in S}\nfor _ in range(N):\n s = input()[0]\n if s in S:\n dic[s] += 1\n \nprint(sum([dic[a] * dic[b] * dic[c] for a in S for b in S for c in S if a < b < c]))\n", "#include<bits/stdc++.h>\n#define MOD (long long)(1e9+7)\nusing namespace std;\nlong long n,dp[6][5];\nchar s[20],*k=\"MARCH\";\nint main()\n{\n\tcin >> n;\n\tlong long cnt[5]={0};\n\tfor(int i=0; i<n; i++)\n\t{\n\t\tcin >> s;\n\t\tchar *v=strchr(k,s[0]);\n\t\tif(v) cnt[v-k]++;\n\t}\n\tfor(int i=0; i<=5; i++) dp[i][0]=1;\n\tfor(int i=1; i<=5; i++)\n\t\tfor(int j=1; j<=3; j++)\n\t\t\tif(i>=j)\n\t\t\t{\n\t\t\t\tdp[i][j]=dp[i-1][j]+dp[i-1][j-1]*cnt[i-1];\n\t\t\t\t//cout << dp[i][j]<< ' ';\n\t\t\t}\n\tcout << dp[5][3];\n\treturn 0;\n}\n", "N=int(input())\nS=[input()[0] for _ in range(N)]\nA=[S.count(c) for c in \"MARCH\"]\nans=0\nfor i in range(5):\n for j in range(i+1,5):\n for k in range(j+1,5):\n ans+=A[i]*A[j]*A[k]\nprint(ans)\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n\n// \tFile file = new File(\"test.txt\");\n// \tScanner sc = new Scanner(file);\n \tScanner sc = new Scanner(System.in);\n \tint N = sc.nextInt();\n \tlong[] MARCH = new long[5];\n \tlong ans = 0;\n \tfor(int i = 0; i < N; i++){\n \t\tchar ch = sc.next().charAt(0);\n \t\tswitch(ch){\n \t\tcase 'M' : MARCH[0]++; break;\n \t\tcase 'A' : MARCH[1]++; break;\n \t\tcase 'R' : MARCH[2]++; break;\n \t\tcase 'C' : MARCH[3]++; break;\n \t\tcase 'H' : MARCH[4]++; break;\n \t\tdefault : break;\n \t\t}\n \t}\n \tsc.close();\n \tfor(int i = 0; i < 3; i++){\n \t\tfor(int j = i+1; j < 4; j++){\n \t\t\tfor(int k = j+1; k < 5; k++){\n \t\t\t\tans += MARCH[i] * MARCH[j] * MARCH[k];\n \t\t\t}\n \t\t}\n \t}\n \tSystem.out.println(ans);\n }\n\n}\n", "#include <iostream>\nusing namespace std;\nint main() \n{\n\tlong i,j,n,ans=0,m=0,a=0,r=0,c=0,h=0;\n\tstring s[100001];\n \tcin >> n;\n\n\tfor(i=0;i<n;i++){\n\t\tcin >> s[i];\n\t} \n\tfor(i=0;i<n;i++){\n\t\tif(s[i][0]=='M'){\n\t\t\tm++;\n\t\t}\n\t\tif(s[i][0]=='A'){\n\t\t\ta++;\n\t\t}\n\t\tif(s[i][0]=='R'){\n\t\t\tr++;\n\t\t}\n\t\tif(s[i][0]=='C'){\n\t\t\tc++;\n\t\t}\n\t\tif(s[i][0]=='H'){\n\t\t\th++;\n\t\t}\n\t} \n\tans=(m*a*r)+(m*a*c)+(m*a*h)+(m*r*c)+(m*r*h)+(m*c*h)+(a*r*c)+(a*r*h)+(a*c*h)+(r*c*h);\n\tcout << ans << endl;\n\treturn 0;\n}", "from itertools import combinations as c\nn=int(input());l=[input() for _ in range(n)];m=\"MARCH\";p=[0]*5;r=0\nfor s in l:\n for i in range(5):\n if s[0]==m[i]:p[i]+=1\nfor d in c(p,3):r+=d[0]*d[1]*d[2]\nprint(r)", "N,S=int(input()),\"\"\nfor _ in range(N):S+=input()[0]\nM,A,R,C,H=S.count(\"M\"),S.count(\"A\"),S.count(\"R\"),S.count(\"C\"),S.count(\"H\")\nprint(M*A*R+M*A*C+M*A*H+M*R*C+M*R*H+M*C*H+A*R*C+A*R*H+A*C*H+R*C*H)", "import collections, itertools\nn = int(input())\ns = collections.Counter([input()[0] for _ in range(n)])\nls = list(\"MARCH\")\nt = 0\nfor i in itertools.combinations(ls, 3):\n t += s[i[0]] * s[i[1]] * s[i[2]]\nprint(t)\n", "from collections import Counter\nfrom itertools import combinations\nS = [input()for _ in range(int(input()))]\nC = Counter(s[0] for s in S)\nmarch = [s for s in \"MARCH\" if s in C]\nans = 0\nfor p in combinations(march, 3):\n ans += C[p[0]]*C[p[1]]*C[p[2]]\nprint(ans)", "from itertools import combinations\nfrom collections import Counter\nN=int(input())\nS=Counter()\nfor i in range(N):\n s=input()\n S[s[0]]+=1\nprint(sum([S[a]*S[b]*S[c] for a,b,c in combinations(\"MARCH\",3)]))", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] cnt = new long[5];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tchar ch = sc.next().charAt(0);\n\t\t\tif (ch == 'M') cnt[0]++;\n\t\t\tif (ch == 'A') cnt[1]++;\n\t\t\tif (ch == 'R') cnt[2]++;\n\t\t\tif (ch == 'C') cnt[3]++;\n\t\t\tif (ch == 'H') cnt[4]++;\n\t\t}\n\t\tsc.close();\n\n\t\tlong ans = 0L;\n\t\tfor (int i = 0; i < cnt.length; i++) {\n\t\t\tfor (int j = i + 1; j < cnt.length; j++) {\n\t\t\t\tfor (int k = j + 1; k < cnt.length; k++) {\n\t\t\t\t\tans += cnt[i] * cnt[j] * cnt[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "#include <cstdio>\nint n,a,b;\nlong long odp, tb[50];\nchar s[20];\nint main()\n{\n\tscanf(\"%d\", &n);\n\tfor(int i=0; i<n; i++)\n\t{\n\t\tscanf(\"%s\", &s);\n\t\tif(s[0]=='M')tb[1]++;\n\t\tif(s[0]=='A')tb[2]++;\n\t\tif(s[0]=='R')tb[3]++;\n\t\tif(s[0]=='C')tb[4]++;\n\t\tif(s[0]=='H')tb[5]++;\n\t}\n\tfor(int i=1; i<=5; i++)\n\t\tfor(int j=i+1; j<=5; j++)\n\t\t\tfor(int g=j+1; g<=5; g++)\n\t\t\t\todp+=tb[i]*tb[j]*tb[g];\n\tprintf(\"%lld\", odp);\n}", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long cnt[] = new long[5];\n for(int i=0; i<n; i++){\n String s = sc.next();\n if(s.charAt(0)=='M'){\n cnt[0] += 1;\n }else if(s.charAt(0)=='A'){\n cnt[1] += 1;\n }else if(s.charAt(0)=='R'){\n cnt[2] += 1;\n }else if(s.charAt(0)=='C'){\n cnt[3] +=1;\n }else if(s.charAt(0)=='H'){\n cnt[4] +=1;\n }else{\n\n }\n }\n long ans = 0;\n for(int i=0; i<3; i++){\n for(int j=i+1; j<4; j++){\n for(int k=j+1; k<5; k++){\n\n ans += cnt[i]*cnt[j]*cnt[k];\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "#include<cstdio>\nlong long n,a[11],ans;\nchar s[100001];\nint main()\n{\n\tscanf(\"%lld\",&n);\n\tfor (int i=1;i<=n;i++)\n\t{\n\t\tscanf(\"%s\",s);\n\t\tif (s[0]=='M')a[0]++;\n\t\tif (s[0]=='A')a[1]++;\n\t\tif (s[0]=='R')a[2]++;\n\t\tif (s[0]=='C')a[3]++;\n\t\tif (s[0]=='H')a[4]++;\n\t}\n\tfor (int i=0;i<5;i++)\n\t\tfor (int j=i+1;j<5;j++)\n\t\t\tfor (int k=j+1;k<5;k++)ans+=a[i]*a[j]*a[k];\n\tprintf(\"%lld\",ans);\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong[] name = new long[5];\n\t\tlong N = sc.nextInt();\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tswitch(sc.next().charAt(0)) {\n\t\t\tcase 'M':\n\t\t\t\tname[0] += 1;\n\t\t\t\tbreak;\n\t\t\tcase 'A':\n\t\t\t\tname[1] += 1;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tname[2] += 1;\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tname[3] += 1;\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\tname[4] += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tlong result = 0;\n\t\tfor(int i = 0; i < 3; i++) {\n\t\t\tfor(int j = i + 1; j < 4; j++) {\n\t\t\t\tfor(int k = j + 1; k < 5; k++) {\n\t\t\t\t\tresult += name[i] * name[j] * name[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(result);\n\t\tsc.close();\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(void) {\n int n;\n cin >> n;\n map<char,long long> dic;\n for (int i = 0; i < n; i++) {\n string s;\n cin >> s;\n dic[s[0]]++;\n }\n\n string s = \"MARCH\";\n long long ret = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i + 1; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n ret += dic[s[i]] * dic[s[j]] * dic[s[k]];\n }\n }\n }\n cout << ret << endl;\n return 0;\n}", "from itertools import combinations\nfrom collections import Counter\nn = int(input())\nS = Counter()\nfor i in range(n):\n S[input()[0]]+=1\nprint(sum(S[a]*S[b]*S[c] for a,b,c in combinations(\"MARCH\",3)))", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint main(){\n ll n,m,a,r,c,h;\n string s;\n cin>>n;\n map<char,ll> mp;\n for(int i=0;i<n;i++){\n cin>>s;\n mp[s[0]]++;\n }\n m=mp['M'],a=mp['A'],r=mp['R'],c=mp['C'],h=mp['H'];\n cout<<m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h;\n}", "from collections import Counter\nimport itertools\nN = int(input())\nS = [input()[0] for _ in range(N)]\n\ncounter = Counter(S)\nanswer = 0\nfor x,y,z in itertools.combinations('MARCH',3):\n answer += counter[x] * counter[y] * counter[z]\n\nprint(answer)\n", "n=int(input())\nm=0\na=0\nr=0\nc=0\nh=0\nfor i in range(n):\n\ts=input()[0]\n\tif s=='M':\n\t\tm+=1\n\telif s=='A':\n\t\ta+=1\n\telif s=='R':\n\t\tr+=1\n\telif s=='C':\n\t\tc+=1\n\telif s=='H':\n\t\th+=1\nprint(m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h)", "from itertools import combinations\nfrom collections import Counter\nN = int(input())\ncounter = Counter(input()[0] for _ in range(N))\nans = 0\nfor a, b, c in combinations('MARCH', 3):\n ans += counter[a] * counter[b] * counter[c]\nprint(ans)", "import itertools\nn = int(input())\nls = [input()[:1] for _ in range(n)]\nans = 0\ncmb = list(itertools.combinations(list(\"MARCH\"), 3))\n\nfor c in cmb:\n ans += ls.count(c[0]) * ls.count(c[1]) * ls.count(c[2])\n\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long \nint main()\n{\nstring s;char x;\n vector<char>v;\n map<char,ll>m;\n ll a,b,c,d,i,j,k,l=0;\n cin>>a;\nfor(i=1;i<=a;i++)\n{\n cin>>s;x=s[0]; \nif(x=='C'||x=='R'||x=='A'||x=='M'||x=='H'){\n if(m[x]==0)\n {\n v.push_back(x);\n }\n m[x]++;\n }\n}\n for(i=0;i<v.size();i++)\n{\nfor(j=i+1;j<v.size();j++)\n {\nfor(k=j+1;k<v.size();k++)\n{\nl+=(m[v[i]]*m[v[j]]*m[v[k]]);\n}\n}\n }\ncout<<l<<endl;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] D = new long[5]; // なぜかintだと正しく実行できない\n for (int i = 0; i < N; i++) {\n String name = sc.next();\n if (name.charAt(0) == 'M') D[0]++;\n if (name.charAt(0) == 'A') D[1]++;\n if (name.charAt(0) == 'R') D[2]++;\n if (name.charAt(0) == 'C') D[3]++;\n if (name.charAt(0) == 'H') D[4]++;\n }\n long res = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i+1; j < 5; j++) {\n for (int k = j+1; k < 5; k++) {\n res += D[i] * D[j] * D[k];\n }\n }\n }\n System.out.println(res);\n }\n}\n", "N= int(input())\nS = [input() for _ in range(N)]\n\ncnt = {}\n\nfor s in S:\n cnt[s[0]] = cnt.get(s[0], 0) +1\n\nn = [cnt.get(x,0) for x in ['M','A','R','C','H']]\n\na = sum(n) **3 - 3*sum([v**2 for v in n])*sum(n) + 2*sum([v**3 for v in n])\nprint(a//6)\n ", "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\n\t\tString s[] = new String[N];\n\t\tMap<Character, Long> map = new HashMap<>();\n\t\tmap.put('M', 0L);\n\t\tmap.put('A', 0L);\n\t\tmap.put('R', 0L);\n\t\tmap.put('C', 0L);\n\t\tmap.put('H', 0L);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tchar c = sc.next().charAt(0);\n\t\t\tif (map.containsKey(c)) {\n\t\t\t\tmap.put(c, map.get(c)+1);\n\t\t\t}\n\t\t}\n\t\tint cnt = 0;\n\t\tint idx = 0;\n\t\tArrayList<Long> w = new ArrayList<>();\n\t\tfor (Entry<Character, Long> e : map.entrySet()) {\n\t\t\tif (e.getValue()!=0) {\n\t\t\t\tw.add(e.getValue());\n\t\t\t\tcnt++;\n\t\t\t\tidx++;\n\t\t\t}\n\t\t}\n\t\tif (cnt<=2) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tlong ans = 0;\n\t\tif (cnt == 3) {\n\t\t\tans = 1;\n\t\t\tfor (int i = 0; i < w.size(); i++) {\n\t\t\t\tans *= w.get(i);\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t\treturn;\n\t\t}\n\n\t\tif (cnt == 4) {\n\t\t\tlong tmp = 1;\n\t\t\tfor (int i = 0; i < w.size(); i++) {\n\t\t\t\ttmp *= w.get(i);\n\t\t\t}\n\t\t\tfor (int i = 0; i < w.size(); i++) {\n\t\t\t\tans += tmp/w.get(i);\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\n\t\tint P []={0 ,0 ,0 ,0 ,0 ,0 ,1 ,1 ,1 ,2};\n\t\tint Q []={1 ,1 ,1 ,2 ,2 ,3 ,2 ,2 ,3 ,3};\n\t\tint R []={2 ,3 ,4 ,3 ,4 ,4 ,3 ,4 ,4 ,4};\n\n\t\tif (cnt == 5) {\n\t\t\tans = 0;\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tans += w.get(P[i])*w.get(Q[i])*w.get(R[i]);\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "#define rep(i, n) for(ll i = 0; i < n; i++)\n#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tstring march = \"MARCH\";\n\tvector<ll> cnt (5,0);\n\trep(i,n) {\n\t\tstring s;\n\t\tcin >> s;\n\t\trep(j,5) if (s[0] == march[j]) cnt[j]++;\n\t}\n\tll ans = 0;\n\tfor (int i=0;i<5;i++)\n\t\tfor (int j=i+1;j<5;j++)\n\t\t\tfor (int k=j+1;k<5;k++)\n\t\t\t\tans += cnt[i]*cnt[j]*cnt[k];\n\tcout << ans << endl;\n\n\treturn 0;\n}\n", "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong n;\n\t\tlong m = 0, a = 0, r = 0, c = 0, h = 0, count = 0;\n\t\tlong d[];\n\t\td = new long[5];\n\t\tint p[] = { 0, 0, 0, 0, 0, 0, 1, 1, 1, 2 };\n\t\tint q[] = { 1, 1, 1, 2, 2, 3, 2, 2, 3, 3 };\n\t\tint s[] = { 2, 3, 4, 3, 4, 4, 3, 4, 4, 4 };\n\t\tString tmp;\n\n\t\tn = sc.nextLong();\n\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\ttmp = sc.next();\n\t\t\tif (tmp.charAt(0) == 'M')\n\t\t\t\t++m;\n\t\t\tif (tmp.charAt(0) == 'A')\n\t\t\t\t++a;\n\t\t\tif (tmp.charAt(0) == 'R')\n\t\t\t\t++r;\n\t\t\tif (tmp.charAt(0) == 'C')\n\t\t\t\t++c;\n\t\t\tif (tmp.charAt(0) == 'H')\n\t\t\t\t++h;\n\t\t}\n\n\t\td[0] = m;\n\t\td[1] = a;\n\t\td[2] = r;\n\t\td[3] = c;\n\t\td[4] = h;\n\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\tcount += d[p[i]] * d[q[i]] * d[s[i]];\n\t\t}\n\t\tSystem.out.println(count);\n\n\t\tsc.close();\n\t}\n\n}\n", "D={'M':0,'A':0,'R':0,'C':0,'H':0}\nfor k in range(int(input())):\n s=input()\n if s[0] in D.keys():\n D[s[0]]+=1\n\nt,v=0,list(D.values())\nfor i in range(5):\n for j in range(i+1,5):\n for k in range(j+1,5):\n t+=v[i]*v[j]*v[k]\n\nprint(t)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tlong int n,ma=0,aa=0,ra=0,ca=0,ha=0;\n \tcin >> n;\n \tfor (int i=0;i<n;i++){\n \tstring t;\n \tcin >> t;\n \tif (t[0]=='M' ) ma++;\n if (t[0]=='A' ) aa++;\n \tif (t[0]=='R' ) ra++;\n \tif (t[0]=='C' ) ca++;\n \tif (t[0]=='H' )\tha++;\n }\n \tcout << ma*aa*ra+ma*aa*ca+ma*aa*ha+ma*ra*ca+ma*ra*ha+ma*ca*ha+aa*ra*ca+aa*ra*ha+aa*ca*ha+ra*ca*ha << endl;\n}", "import java.util.*;\nimport java.util.stream.Collectors;\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t\tins.calc();\n\t\tins.showResult();\n\t}\n\n\tint N;\n\tMap<Character, List<String>> map;\n\tlong result = 0;\n\n\tMain(BufferedReader in) throws IOException {\n\t\tN = Integer.parseInt(in.readLine());\n\t\tmap = new HashMap<>();\n\t\tmap.put('M', new ArrayList<>());\n\t\tmap.put('A', new ArrayList<>());\n\t\tmap.put('R', new ArrayList<>());\n\t\tmap.put('C', new ArrayList<>());\n\t\tmap.put('H', new ArrayList<>());\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tString S = in.readLine();\n\t\t\tif (map.containsKey(S.charAt(0))) {\n\t\t\t\tmap.get(S.charAt(0)).add(S);\n\t\t\t}\n\t\t}\n\t}\n\n\tlong get(char key0, char key1, char key2) {\n\t\treturn (long) map.get(key0).size() * (long) map.get(key1).size() * (long) map.get(key2).size();\n\t}\n\n\tvoid calc() {\n\t\tresult += get('M', 'A', 'R');\n\t\tresult += get('M', 'A', 'C');\n\t\tresult += get('M', 'A', 'H');\n\t\tresult += get('M', 'R', 'C');\n\t\tresult += get('M', 'R', 'H');\n\t\tresult += get('M', 'C', 'H');\n\t\tresult += get('A', 'R', 'C');\n\t\tresult += get('A', 'R', 'H');\n\t\tresult += get('A', 'C', 'H');\n\t\tresult += get('R', 'C', 'H');\n\t\tSystem.out.println(result);\n\t}\n\n\tvoid showResult() {\n\t}\n}\n", "import itertools\nfrom collections import Counter\nN = int(input())\nsrc = [input() for i in range(N)]\nctr = Counter([s[0] for s in src])\n\nans = 0\nfor ptn in itertools.combinations('MARCH',3):\n ans += ctr[ptn[0]]*ctr[ptn[1]]*ctr[ptn[2]]\nprint(ans)\n", "import itertools\nn=int(input())\ns=[]\nfor _ in range(n):\n s.append(input())\nm=[0]*5\np=['M','A','R','C','H']\nfor x in s:\n for i in range(5):\n if x[0]==p[i]:\n m[i] += 1\nans=0\nfor v in itertools.combinations(m,3):\n ans += v[0]*v[1]*v[2]\nprint(ans)", "from itertools import combinations\n\nN=int(input())\nP={\"M\",\"A\",\"R\",\"C\",\"H\"}\nX={x:0 for x in P}\n\nfor _ in range(N):\n S=input()\n if S[0] in P:\n X[S[0]]+=1\n\nK=0\nfor (a,b,c) in combinations(P,3):\n K+=X[a]*X[b]*X[c]\nprint(K)\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nchar start[5]={'M','A','R','C','H'};\nll counter[5];\nint main(){\n\tint n;\n\tcin>>n;\n\twhile(n--){\n\t\tstring s;\n\t\tcin>>s;\n\t\tfor(int i=0; i<5; i++){\n\t\t\tif(s[0]==start[i]){\n\t\t\t\tcounter[i]++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tll ret = 0;\n\tfor(int i=0; i<5; i++){\n\t\tfor(int j=i+1; j<5; j++){\n\t\t\tfor(int k=j+1; k<5; k++) ret+=counter[i]*counter[j]*counter[k];\n\t\t}\n\t}\n\tcout<<ret;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n string s=\"MARCH\";\n long long c[5]={0};\n long long n;\n cin >> n;\n for (long long i=0;i<n;++i){\n string t;\n cin >> t;\n for (int j=0;j<5;++j){\n if (t[0]==s[j]){\n c[j]++;\n }\n }\n }\n long long ans=0;\n for (int i=0;i<5;++i){\n for (int j=i+1;j<5;++j){\n for (int k=j+1;k<5;++k){\n ans+=c[i]*c[j]*c[k];\n }\n }\n }\n cout << ans << endl;\n return 0;\n}\n \n", "import java.io.File;\nimport java.io.IOException;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.Map.Entry;\n \npublic class Main{\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\t//File file = new File(\"input.txt\");\n\t\t//Scanner in = new Scanner(file);\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t\tint N = in.nextInt();\n\t\tlong[] march = new long[5];\n\t\tString marchS = \"MARCH\";\n\t\t\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tString S = in.next().substring(0, 1);\n\t\t\tfor(int j = 0; j < 5; j++){\n\t\t\t\tif(S.equals(String.valueOf(marchS.charAt(j)))){\n\t\t\t\t\tmarch[j]++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < 5 - 2; i++){\n\t\t\tfor(int j = i + 1; j < 5 - 1; j++){\n\t\t\t\tfor(int k = j + 1; k < 5; k++){\n\t\t\t\t\tans += march[i] * march[j] * march[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}", "import itertools\nimport operator\n\ndef product(iterable):\n return reduce(operator.mul, iterable, 1)\n\ndef main():\n n = int(raw_input())\n table = dict((c, 0) for c in 'MARCH')\n\n for _ in xrange(n):\n s = raw_input()\n if s[0] in table:\n table[s[0]] += 1\n\n m = 0\n for comb in itertools.combinations('MARCH', 3):\n m += product(table[c] for c in comb)\n print m\n\nmain()", "#include<iostream>\n#include<cstdio>\nusing namespace std;\nint n;\nchar s[15];\nlong long an[10];\nlong long ans;\nint main()\n{\n\tscanf(\"%d\",&n);\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\"%s\",s);\n\t\tif(s[0]=='M')an[1]++;\n\t\tif(s[0]=='A')an[2]++;\n\t\tif(s[0]=='R')an[3]++;\n\t\tif(s[0]=='C')an[4]++;\n\t\tif(s[0]=='H')an[5]++;\n\t}\n\tfor(int i=1;i<=3;i++)\n\t\tfor(int j=i+1;j<=4;j++)\n\t\t\tfor(int k=j+1;k<=5;k++)\n\t\t\t\tans+=an[i]*an[j]*an[k];\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N= sc.nextInt();\n\t\tlong a[]= new long[5];\n\t\tchar c[] = {'M','A','R','C','H'};\n\t\tlong sum =0;\n\t\tfor (int i =0;i<N;i++) {\n\t\t\tString str = sc.next();\n\t\t\tfor (int j=0;j<c.length;j++) {\n\t\t\t\tif (str.charAt(0)==c[j]) {\n\t\t\t\t\ta[j] ++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsum +=Main.count(a[0], a[1], a[2]);\n\t\tsum +=Main.count(a[0], a[1], a[3]);\n\t\tsum +=Main.count(a[0], a[1], a[4]);\n\t\tsum +=Main.count(a[0], a[2], a[3]);\n\t\tsum +=Main.count(a[0], a[2], a[4]);\n\t\tsum +=Main.count(a[0], a[3], a[4]);\n\t\tsum +=Main.count(a[1], a[2], a[3]);\n\t\tsum +=Main.count(a[1], a[2], a[4]);\n\t\tsum +=Main.count(a[1], a[3], a[4]);\n\t\tsum +=Main.count(a[2], a[3], a[4]);\n\t\tSystem.out.println(sum);\n\t}\n\tprivate static long count(long a,long b,long c) {\n\t\treturn a*b*c;\n\t}\n}", "import itertools\n\nA = \"MARCH\"\nc = {a: 0 for a in A}\nN = int(input())\nfor _ in range(N):\n S = input()\n if S[0] in A:\n c[S[0]] += 1\n\nprint(sum([c[cb[0]] * c[cb[1]] * c[cb[2]]\n for cb in itertools.combinations(A, 3)]))\n", "from collections import *\nd=Counter()\nfor _ in range(int(input())): d[input()[0]]+=1\nimport itertools as it\nprint(sum(d[s]*d[t]*d[r] for s,t,r in it.combinations('MARCH',3)))", "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n\tlong n,ans=0;\n\tstring temp;\n\tchar target[5]={'M','A','R','C','H'};\n\tlong count[5]={0,0,0,0,0};\n\n\tcin >>n;\n\tfor(int i=0;i<n;i++){\n\t\tcin >>temp;\n\t\tfor(int j=0;j<5;j++){\n\t\t\tif(temp[0]==target[j])count[j]++;\n\t\t}\n\t}\n\tfor(int i=0;i<3;i++){\n\t\tfor(int j=i+1;j<4;j++){\n\t\t\tfor(int k=j+1;k<5;k++){\n\t\t\t\tans+=count[i]*count[j]*count[k];\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>//atcoder.089.C\nusing namespace std;\nint main(){\n\tlong n,m,i,j,b=0;\n\tcin>>n;\n\tlong a[6]={0};\n\tstring s[n+1];\n\tfor(i=1;i<=n;i++){\n\t\tcin>>s[i];\n\t\tif(s[i][0]=='M')a[1]++;\n\t\tif(s[i][0]=='A')a[2]++;\n\t\tif(s[i][0]=='R')a[3]++;\n\t\tif(s[i][0]=='C')a[4]++;\n\t\tif(s[i][0]=='H')a[5]++;\n\t}\n\tfor(i=1;i<=3;i++){\n\t\tif(a[i]!=0)\n\t\t\tfor(j=i+1;j<=4;j++){\n\t\t\t\tif(a[j]!=0)\n\t\t\t\t\tfor(m=j+1;m<=5;m++){\n\t\t\t\t\t\tif(a[m]!=0)b=b+a[i]*a[j]*a[m];\n\t\t\t\t\t}\n\t\t\t}\n\t}\n\tcout<<b;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main () {\n int N;\n cin >> N;\n map<char, long long> m;\n for (int i = 0; i < N; i++) {\n string S;\n cin >> S;\n m[S[0]]++;\n }\n string S = \"MARCH\";\n long long ans = 0;\n for (int i = 0; i < 5; i++) {\n for (int j = i+1; j < 5; j++) {\n for (int k = j+1; k < 5; k++) {\n ans += m[S[i]]*m[S[j]]*m[S[k]];\n }\n }\n }\n cout << ans << endl;\n}", "N=int(input())\nKEY = 'MARCH'\n\nd={}\nfor i in KEY:\n\td[i]=0\n\nfor i in range(N):\n\tt = input()[0]\n\tif t in KEY:\n\t\td[t]+=1\n\nans=0\nfor i in range(3):\n\tfor j in range(i+1,4):\n\t\tfor k in range(j+1,5):\n\t\t\tans+=d[KEY[i]]*d[KEY[j]]*d[KEY[k]]\n\nprint(ans)", "import collections\nimport itertools\n\nn = int(input())\ns = [input()[0] for _ in range(n)]\ncounter = collections.Counter(s)\nans = 0\nfor a, b, c in itertools.combinations('MARCH', 3):\n ans += counter[a] * counter[b] * counter[c]\nprint(ans)", "from collections import Counter\nfrom itertools import combinations\nN = int(input())\nS = Counter(input()[0] for _ in range(N))\n\nans = 0\nfor i, j, k in combinations(\"MARCH\", 3):\n ans += S[i]*S[j]*S[k]\nprint(ans)\n", "from itertools import combinations\nimport collections\n\nN = int(input()) \n\nA = []\nfor i in range(N):\n A.append(input()[0])\n\nC = collections.Counter(A)\nprint(sum(C[a]*C[b]*C[c] for a, b, c in combinations(\"MARCH\", 3)))", "from itertools import*;d=[0]*91\nfor _ in[0]*int(input()):d[ord(input()[0])]+=1\nprint(sum(d[p]*d[q]*d[r]for p,q,r in combinations(map(ord,'MARCH'),3)))", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfinal int N = sc.nextInt();\n\t\tlong ary[] = {0L, 0L, 0L, 0L, 0L}; //M, A, R, C, H\n\t\tfor(int i=0; i<N; i++) {\n\t\t\tchar c = sc.next().charAt(0);\n\t\t\tswitch(c) {\n\t\t\tcase 'M': ary[0]++; break;\n\t\t\tcase 'A': ary[1]++; break;\n\t\t\tcase 'R': ary[2]++; break;\n\t\t\tcase 'C': ary[3]++; break;\n\t\t\tcase 'H': ary[4]++;\n\t\t\t}\n\t\t}\n\t\tsc.close();\n\t\tlong x = 0L;\n\t\t\n\t\tfor(int i=0; i<=2; i++) {\n\t\t\tfor(int j=i+1; j<=3; j++) {\n\t\t\t\tfor(int k=j+1; k<=4; k++) {\n\t\t\t\t\tx += ary[i] * ary[j] * ary[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(x);\n\t}\n\n}", "from itertools import*;s,*_=zip(*open(0).readlines());c=s.count;print(sum(c(p)*c(q)*c(r)for p,q,r in combinations('MARCH',3)))", "n = int(input())\ns = [input()[0] for _ in range(n)]\n\ncnt = [s.count(v) for v in (\"M\", \"A\", \"R\", \"C\", \"H\")]\nans = 0\nfor i in range(5):\n for j in range(i):\n for k in range(j):\n ans += cnt[i] * cnt[j] * cnt[k]\n \nprint(ans)", "import java.util.Scanner;\n\nclass Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint ninzu=sc.nextInt();\n\t\tint[] march_count=new int[5];\n\t\tString moji=\"\";\n\t\tfor(int i=0; i<ninzu; i++) {\n\t\t\tmoji=sc.next();\n\t\t\tif(moji.charAt(0)=='M') {\n\t\t\t\tmarch_count[0]++;\n\t\t\t}\n\t\t\telse if(moji.charAt(0)=='A') {\n\t\t\t\tmarch_count[1]++;\n\t\t\t}\n\t\t\telse if(moji.charAt(0)=='R') {\n\t\t\t\tmarch_count[2]++;\n\t\t\t}\n\t\t\telse if(moji.charAt(0)=='C') {\n\t\t\t\tmarch_count[3]++;\n\t\t\t}\n\t\t\telse if(moji.charAt(0)=='H') {\n\t\t\t\tmarch_count[4]++;\n\t\t\t}\n\t\t}\n\t\t//MARCHから選ぶとおりは5C3\n\t\tint[] sets=new int[10];\n\t\tint ks=0;\n\t\tfor(int i=0; i<32; i++) {\n\t\t\tint counter=0;\n\t\t\tint tmp=i;\n\t\t\twhile(tmp>0) {\n\t\t\t\tif(tmp%2==1) {\n\t\t\t\t\tcounter++;\n\t\t\t\t}\n\t\t\t\ttmp=tmp/2;\n\t\t\t}\n\t\t\tif(counter==3) {\n\t\t\t\tsets[ks]=i;\n\t\t\t\tks++;\n\t\t\t}\n\t\t}\n\n\t\tlong toori=0l;\n\t\tlong toori_tmp=0l;\n\t\tlong[] aa=new long[5];\n\t\tlong[] waru= {16,8,4,2,1};\n\n\t\tfor(int i=0; i<10; i++) {\n\t\t\ttoori_tmp=1l;\n\t\t\tfor(int j=0; j<5; j++) {\n\t\t\t\taa[j]=((sets[i]/waru[j])%2)*march_count[j];\n\t\t\t\tif((sets[i]/waru[j])%2==1) {\n\t\t\t\t\ttoori_tmp*=aa[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\ttoori+=toori_tmp;\n\t\t}\n\t\tSystem.out.println(toori);\n\t}\n}", "from itertools import*;d=[0]*128\nfor _ in[0]*int(input()):d[ord(input()[0])]+=1\nprint(sum(p*q*r for p,q,r in combinations([d[ord(t)]for t in'MARCH'],3)))", "from itertools import combinations\nn=int(input())\nname=[0]*5\nmarch=['M','A','R','C','H']\nfor i in range(n):\n s=input()\n if s[0] in march:\n name[march.index(s[0])]+=1\nsm=0\nfor i,j,k in list(combinations(name,3)):\n sm+=i*j*k\nprint(sm)", "#include <stdio.h>\nint ch[15];\nint main(){\n\tint n,i,k,j;\n\tchar a[100];\n\tscanf(\"%d\",&n);\nlong long int b,sum=0;\n\tfor(i=0;i<n;i++){\n\t\tscanf(\"%s\",a);\n\t\tif(a[0]=='M') ch[1]++;\n\t\telse if(a[0]=='A') ch[2]++;\n\t\telse if(a[0]=='R') ch[3]++;\n\t\telse if(a[0]=='C') ch[4]++;\n\t\telse if(a[0]=='H') ch[5]++;\n\t}\n\tfor(i=1;i<=5;i++){\n\t\tfor(j=i+1;j<=5;j++){\n\t\t\tfor(k=j+1;k<=5;k++){\n\t\t\t\tb=ch[i];\n\t\t\t\tb*=ch[k]; b*=ch[j];\n\t\t\t\tsum+=b;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\",sum);\n\t\n}", "# solution\n\nimport io\nimport sys\nfrom itertools import combinations as comb\n\nn, *S = open(0).read().split()\n\ns = [i[0] for i in S]\n\narray = [s.count(i) for i in 'MARCH']\n\nret = sum(x * y * z for x, y, z in comb(array, 3))\n\nprint(ret)", "import itertools\nfrom collections import Counter\nN = int(input())\nsrc = [input() for i in range(N)]\nctr = Counter()\nfor s in src:\n ctr[s[0]] += 1\n\nans = 0\nfor ptn in itertools.combinations('MARCH',3):\n a,b,c = ptn\n ans += ctr[a]*ctr[b]*ctr[c]\nprint(ans)", "N = int(input())\nS = [input() for i in range(N)]\nfrom collections import Counter\nctr = Counter([s[0] for s in S])\n\nans = 0\nimport itertools\nfor ptn in itertools.combinations('MARCH',3):\n a,b,c = ptn\n ans += ctr[a] * ctr[b] * ctr[c]\nprint(ans)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int N = scanner.nextInt();\n\n HashMap<Character, ArrayList<String>> hashMap = new HashMap<>();\n\n char[] prefixs = new char[5];\n prefixs[0] = 'M';\n prefixs[1] = 'A';\n prefixs[2] = 'R';\n prefixs[3] = 'C';\n prefixs[4] = 'H';\n\n long[] cnts = new long[5];\n\n for(int i=0; i<N; i++){\n char c = scanner.next().charAt(0);\n\n if(c == 'M'){\n cnts[0]++;\n }else if(c == 'A'){\n cnts[1]++;\n }else if(c == 'R'){\n cnts[2]++;\n }else if(c == 'C'){\n cnts[3]++;\n }else if(c == 'H'){\n cnts[4]++;\n }\n }\n\n long ans = 0;\n for(int i=0; i<3; i++){\n for(int j=i+1; j<4; j++){\n for(int k=j+1; k<5; k++){\n ans += (cnts[i] * cnts[j] * cnts[k]);\n }\n }\n }\n\n System.out.println(ans);\n }\n}\n", "import java.util.*;\nclass Main\n{\n public static void main (String[] args)\n {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] y = new long[5];\n Arrays.fill(y, 0);\n for(int i = 0; i < n; i++){\n char x = sc.next().charAt(0);\n switch(x){\n case 'M': y[0]++; break;\n case 'A': y[1]++; break;\n case 'R': y[2]++; break;\n case 'C': y[3]++; break;\n case 'H': y[4]++; break;\n default: break;\n }\n }\n long ans = 0;\n for(int i = 0; i < 3; i++)\n for(int j = i+1; j < 4; j++)\n for(int k = j+1; k < 5; k++)\n ans += y[i] * y[j] * y[k];\n System.out.println(ans);\n }\n}", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nstring s;\nlong long m, a, r, c, h;\n\nint main()\n{\n\tlong long n;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> s;\n\t\tif (s[0] == 'M')\n\t\t\tm++;\n\t\tif (s[0] == 'A')\n\t\t\ta++;\n\t\tif (s[0] == 'R')\n\t\t\tr++;\n\t\tif (s[0] == 'C')\n\t\t\tc++;\n\t\tif (s[0] == 'H')\n\t\t\th++;\n\t}\n\tcout << m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h;\n\treturn 0;\n}", "from itertools import combinations\nN = int(input())\ns = [input()[0] for _ in range(N)]\ns.sort()\nx = [s.count('M'), s.count('A'), s.count('R'), s.count('C'), s.count('H')]\nans = 0\nfor v in combinations(x, 3):\n ans += v[0] * v[1] * v[2]\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n\tint n;\n\tcin >> n;\n\tmap<char, long long> s;\n\tfor(int i = 0; i < n; ++i){\n\t\tstring tmp;\n\t\tcin >> tmp;\n\t\ts[tmp[0]]++;\n\t}\n\tlong long ans = 0;\n\tstring ma = \"MARCH\";\n\tfor(int i = 0; i < 5; ++i){\n\t\tfor(int j = i+1; j < 5; ++j){\n\t\t\tfor(int k = j+1; k < 5; ++k){\n\t\t\t\tans += s[ma[i]]*s[ma[j]]*s[ma[k]];\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}\n", "import java.util.Scanner;\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint m = 0;\n\t\tint a = 0; \n\t\tint r = 0;\n\t\tint c = 0;\n\t\tint h = 0;\n\t\t\n\t\tfor(int i = 0 ; i < n ;i++) {\n\t\t\tString s = sc.next();\n\t\t\tchar x = s.charAt(0);\n\t\t\tif(x == 'M') m++;\n\t\t\tif(x == 'A') a++;\n\t\t\tif(x == 'R') r++;\n\t\t\tif(x == 'C') c++;\n\t\t\tif(x == 'H') h++;\n\t\t\t\n\t\t\t}\n\t\tlong sum = 0;\n\t\t\n\t\tsum += (long)m * a * r;\n\t\tsum += (long)m * a * c;\n\t\tsum += (long)m * a * h;\n\t\tsum += (long)m * r * c;\n\t\tsum += (long)m * r * h;\n\t\tsum += (long)m * c * h;\n\t\tsum += (long)a * r * c;\n\t\tsum += (long)a * r * h;\n\t\tsum += (long)a * c * h;\n\t\tsum += (long)r * c * h;\n\t\t\n\t\tSystem.out.println(sum);\n\t\t\n\t\n\t}\n}\n", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tString[] S = new String[N];\n\t\tchar[] initial = new char[N];\n\t\tlong m = 0; long a = 0; long r = 0; long c = 0; long h = 0;\n\n\t\tfor(int i=0; i<N; i++) {\n\t\t\tS[i] = sc.next();\n\t\t\tinitial[i] = S[i].charAt(0);\n\t\t\tif(initial[i] == 'M') m++;\n\t\t\telse if(initial[i] == 'A') a++;\n\t\t\telse if(initial[i] == 'R') r++;\n\t\t\telse if(initial[i] == 'C') c++;\n\t\t\telse if(initial[i] == 'H') h++;\n\t\t}\n\t\t\tlong ans = m*a*r+m*a*c+m*a*h\n\t\t\t\t\t+m*r*c+m*r*h+m*c*h\n\t\t\t\t\t+a*r*c+a*r*h+a*c*h\n\t\t\t\t\t+r*c*h;\n\n\t\t\tSystem.out.println(ans);\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long N;\n cin>>N;\n map<char,long long> A;\n for(long long i=0;i<N;i++){\n string S;\n cin>>S;\n A[S[0]]++;\n }\n vector<string> B={\"MAR\",\"MAC\",\"MAH\",\"MRC\",\"MRH\",\"MCH\",\"ARC\",\"ARH\",\"ACH\",\"RCH\"};\n long long j=0;\n for(string s:B)\n j+=A[s[0]]*A[s[1]]*A[s[2]];\n cout<<j<<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n long long int N,X=0;string S,T=\"MARCH\";\n cin>>N;vector<long long int>A(5,0);\n for(int i=0;i<N;i++){\n cin>>S;\n for(int j=0;j<5;j++)if(S[0]==T[j])A.at(j)++;\n }\n for(int i=2;i<5;i++)for(int j=1;j<i;j++)for(int k=0;k<j;k++)X+=A.at(i)*A.at(j)*A.at(k);\n cout<<X<<endl;\n}", "from itertools import combinations\n\nN = int(input())\ns = [input() for _ in range(N)]\n\ncnt = [sum(v[0] == c for v in s) for c in 'MARCH']\nans = sum(cnt[i] * cnt[j] * cnt[k] for i, j, k in combinations(range(5), 3))\nprint(ans)", "#include <stdio.h>\nlong long ans, arr[10];\n \nint main() {\n\tint n; scanf(\"%d\",&n);\n\tfor(int i = 1; i<=n;i++){\n\t\tchar name[20]; scanf(\"%s\",name);\n\t\tif(name[0]=='M') arr[0]++;\n\t\telse if(name[0]=='A') arr[1]++;\n\t\telse if(name[0]=='R') arr[2]++;\n\t\telse if(name[0]=='C') arr[3]++;\n\t\telse if(name[0]=='H') arr[4]++;\n\t}\n\t\n\tfor(int i=0; i <5; i++){\n\t\tfor(int j=i+1; j<5;j++){\n\t\t\tfor(int k=j+1; k<5; k++){\n\t\t\t\tans += arr[i]*arr[j]*arr[k];\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "n = int(raw_input())\n\nd = [0]*5\n\nfor a in range(n):\n s = raw_input()\n if s[0] == \"M\":\n d[0] += 1\n elif s[0] == \"A\":\n d[1] += 1\n elif s[0] == \"R\":\n d[2] += 1\n elif s[0] == \"C\":\n d[3] += 1\n elif s[0] == \"H\":\n d[4] += 1\n\nans = 0\nfor a in range(0,3):\n for b in range(a+1,4):\n for c in range(b+1,5):\n ans += d[a]*d[b]*d[c]\nprint ans\n", "n = int(input())\n\nnames = [input()[0] for i in range(n)]\nprefix = 'MARCH'\ncnt = [names.count(c) for c in prefix]\n\nans = 0\nfor i in range(5):\n for j in range(i + 1, 5):\n for k in range(j + 1, 5):\n ans += cnt[i] * cnt[j] * cnt[k]\n \nprint(ans)", "N = int(input())\nc, MARCH = [0] * 5, [\"M\", \"A\", \"R\", \"C\", \"H\"]\nfor _ in range(N):\n ini = input()[0]\n if ini in MARCH:\n c[MARCH.index(ini)] += 1\nprint(c[0]*c[1]*(c[2]+c[3]+c[4]) + (c[0]+c[1])*c[2]*(c[3]+c[4]) + (c[0]+c[1]+c[2])*c[3]*c[4])", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString[] s = new String[n];\n\t\tfor(int i = 0 ; i < n ; i++) s[i] = sc.next();\n\t\tlong[] cnt = new long[5];\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tif(s[i].charAt(0) == 'M') cnt[0]++;\n\t\t\tif(s[i].charAt(0) == 'A') cnt[1]++;\n\t\t\tif(s[i].charAt(0) == 'R') cnt[2]++;\n\t\t\tif(s[i].charAt(0) == 'C') cnt[3]++;\n\t\t\tif(s[i].charAt(0) == 'H') cnt[4]++;\n\t\t}\n\t\tlong ans = 0;\n\t\tfor(int i = 0 ; i < 5 ; i++) {\n\t\t\tfor(int j = i + 1 ; j < 5 ; j++) {\n\t\t\t\tfor(int k = j + 1 ; k < 5 ; k++) {\n\t\t\t\t\tans += cnt[i] * cnt[j] * cnt[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "#include <iostream>\n#include <cstdio>\n#include <map>\nusing namespace std;\n\ntypedef long long LL;\n\nint main ()\n{\n int n;\n cin >> n;\n map<char,LL> mp;\n while (n--)\n {\n string s;\n cin >> s;\n mp[ s[0] ]++;\n }\n LL _=mp['M'],__=mp['A'],___=mp['R'],____=mp['C'],_____=mp['H'];\n cout << _*__*___ + _*__*____+_*__*_____ + _*___*____ + _*___*_____+_*____*_____+__*___*____+__*___*_____+__*____*_____+___*____*_____<<endl;\n}\n", "N = int(input())\nS = [input()[0] for i in range(N)]\nm = S.count(\"M\")\na = S.count(\"A\")\nr = S.count(\"R\")\nc = S.count(\"C\")\nh = S.count(\"H\")\nprint(m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h)", "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Map<String, Long> map = new HashMap<>();\n String[] strings = {\"M\", \"A\", \"R\", \"C\", \"H\"};\n for(String s : strings) {\n map.put(s, 0L);\n }\n for(int i = 0; i < n; i++) {\n String key = sc.next().substring(0, 1);\n for(String s : strings) {\n if(s.equals(key)) {\n map.put(key, map.get(key) + 1L);\n break;\n }\n }\n }\n long count = 0;\n for(int i = 0; i < strings.length; i++) {\n for(int j = i + 1; j < strings.length; j++) {\n for(int k = j + 1; k < strings.length; k++) {\n count += map.get(strings[i]) * map.get(strings[j]) * map.get(strings[k]);\n }\n }\n }\n System.out.println(count);\n }\n}", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tfinal int n = Integer.parseInt(sc.nextLine());\n\t\tlong cntM=0;\n\t\tlong cntA=0;\n\t\tlong cntR=0;\n\t\tlong cntC=0;\n\t\tlong cntH=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tString[] name = sc.nextLine().split(\"\");\n\t\t\tif(name[0].equals(\"M\")){\n\t\t\t\tcntM=cntM+1;\n\t\t\t}else if(name[0].equals(\"A\")){\n\t\t\t\tcntA=cntA+1;\n\t\t\t}else if(name[0].equals(\"R\")){\n\t\t\t\tcntR=cntR+1;\n\t\t\t}else if(name[0].equals(\"C\")){\n\t\t\t\tcntC=cntC+1;\n\t\t\t}else if(name[0].equals(\"H\")){\n\t\t\t\tcntH=cntH+1;\n\t\t\t}\n\t\t}\n\t\tlong answer=cntM*cntA*cntR+cntM*cntA*cntC+cntM*cntA*cntH+\n\t\t\t\t\tcntM*cntR*cntC+cntM*cntR*cntH+\n\t\t\t\t\tcntM*cntC*cntH+\n\t\t\t\t\tcntA*cntR*cntC+cntA*cntR*cntH+\n\t\t\t\t\tcntA*cntC*cntH+\n\t\t\t\t\tcntR*cntC*cntH;\n\t\tSystem.out.println(answer);\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n long long n,m=0,a=0,r=0,c=0,h=0;\n cin >> n;\n vector<string> s(n);\n for(int i=0;i<n;i++){\n cin >> s[i];\n if(s[i][0]=='M'){\n m++;\n }\n if(s[i][0]=='A'){\n a++;\n }\n if(s[i][0]=='R'){\n r++;\n }\n if(s[i][0]=='C'){\n c++;\n }\n if(s[i][0]=='H'){\n h++;\n }\n }\n cout << m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+a*c*h+r*c*h << endl;\n}", "from itertools import combinations as cmbs\nc = {\"M\":0,\"A\":0,\"R\":0,\"C\":0,\"H\":0}\nfor i in range(int(input())):\n si = input()\n if si[0] in c:\n c[si[0]] += 1\nans = 0\nfor i,j,k in cmbs(c.values(),r=3):\n t = i*j*k\n ans += t\nprint(ans)", "N = int(input())\nName = [input()[0] for _ in range(N)]\nMarch = {x:Name.count(x) for x in 'MARCH' if Name.count(x) > 0}\n\nimport itertools\nans = 0\nfor x,y,z in itertools.combinations(March.values(), 3):\n ans += x*y*z\nprint(ans)", "import java.util.*;\n\npublic class Main{\n public static void main(String[]args){\n Scanner sc = new Scanner(System.in);\n int N = Integer.parseInt(sc.nextLine());\n long m, a, r, c, h;\n m = a = r = c = h = 0;\n Set<Character> set = new HashSet<>();\n for(int i = 0; i < N; i++){\n String str = sc.nextLine();\n if(str.charAt(0) == 'M'){\n set.add('M');\n m++;\n }else if(str.charAt(0) == 'A'){\n set.add('A');\n a++;\n }else if(str.charAt(0) == 'R'){\n set.add('R');\n r++;\n }else if(str.charAt(0) == 'C'){\n set.add('C');\n c++;\n }else if(str.charAt(0) == 'H'){\n set.add('H');\n h++;\n }\n }\n \n long ans = 0;\n if(set.size() > 2){\n ans += m * a * r;\n ans += m * a * c;\n ans += m * a * h;\n ans += m * r * c;\n ans += m * r * h;\n ans += m * c * h;\n ans += a * r * c;\n ans += a * r * h;\n ans += a * c * h;\n ans += r * c * h;\n }\n System.out.println(ans);\n }\n}", "import itertools as i;d=[0]*91\nfor _ in[0]*int(input()):d[ord(input()[0])]+=1\nprint(sum(d[p]*d[q]*d[r]for p,q,r in i.combinations(map(ord,'MARCH'),3)))", "#include<iostream>\n#include<cstdio>\nusing namespace std;\nint n;\nlong long ans,a[10];\nchar s[101010];\nint main()\n{\n\tscanf(\"%d\",&n);\n\tfor(int i=1;i<=n;i++)\n\t{\n\t scanf(\"%s\",s);\n\t if(s[0]=='M') a[1]++;\n\t if(s[0]=='A') a[2]++;\n\t if(s[0]=='R') a[3]++;\n\t if(s[0]=='C') a[4]++;\n\t if(s[0]=='H') a[5]++;\n\t}\n\tfor(int i=1;i<=3;i++)\n\tfor(int j=i+1;j<=4;j++)\n\tfor(int k=j+1;k<=5;k++)\n\tans+=a[i]*a[j]*a[k];\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong m, a, r, c, h;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tchar s[12];\n\tfor (int i = 0; i < n; i++) {\n\t\tscanf(\"%s\", s);\n\t\tswitch (s[0])\n\t\t{\n\t\tcase 'M': m++; break;\n\t\tcase 'A': a++; break;\n\t\tcase 'R': r++; break;\n\t\tcase 'C': c++; break;\n\t\tcase 'H': h++;\n\t\t}\n\t}\n\tcout << m * (a*(r + c + h) + r * (c + h) + c * h) + a * (r*(c + h) + c * h) + r * c*h << endl;\n\treturn 0;\n}\n", "import java.io.BufferedReader;\nimport java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong N = sc.nextInt();\n\t\tlong M = 0;\n\t\tlong A = 0;\n\t\tlong R = 0;\n\t\tlong C = 0;\n\t\tlong H = 0;\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tString Si = sc.next();\n\t\t\tswitch(Si.substring(0, 1)) {\n\t\t\tcase \"M\":\n\t\t\t\tM++;\n\t\t\t\tbreak;\n\t\t\tcase \"A\":\n\t\t\t\tA++;\n\t\t\t\tbreak;\n\t\t\tcase \"R\":\n\t\t\t\tR++;\n\t\t\t\tbreak;\n\t\t\tcase \"C\":\n\t\t\t\tC++;\n\t\t\t\tbreak;\n\t\t\tcase \"H\":\n\t\t\t\tH++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tlong x = 0;\n\t\tx = M * A * R;\n\t\tx += M * A * C;\n\t\tx += M * A * H;\n\t\tx += M * R * C;\n\t\tx += M * R * H;\n\t\tx += M * C * H;\n\t\tx += A * R * C;\n\t\tx += A * R * H;\n\t\tx += A * C * H;\n\t\tx += R * C * H;\n\t\tSystem.out.println(x);\n\t}\n}", "from itertools import*;print(sum(p*q*r for p,q,r in list(combinations([len(list(v))for k,v in groupby(sorted(s[0]for s in open(0).readlines()[1:]))if k in\"MARCH\"],3))))", "import java.util.*;\nclass Main{\n public static void main(String[] args){\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n long[] name = new long[5];\n for(int i = 0; i < n; i++){\n String str = scanner.next();\n char f = str.charAt(0);\n if(f == 'M'){name[0]++;}\n else if(f == 'A'){name[1]++;}\n else if(f == 'R'){name[2]++;}\n else if(f == 'C'){name[3]++;}\n else if(f == 'H'){name[4]++;}\n }\n long count = 0;\n for(int i = 0; i < 5; i++){\n if(name[i] != 0){count++;}\n }\n if(count < 2){System.out.println(0);return;}\n long sum = 0;\n for(int i = 0; i < 3; i++){\n for(int j = i+1; j < 4; j++){\n for(int k = j+1; k < 5; k++){\n if(name[i] != 0 && name[j] != 0 && name[k] != 0){\n sum += name[i] * name[j] * name[k];\n } \n }\n }\n }\n System.out.println(sum);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint[] array = new int[5];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tchar[] temp = sc.next().toCharArray();\n\t\t\tchar top = temp[0];\n\t\t\tif(top=='M') array[0]++;\n\t\t\tif(top=='A') array[1]++;\n\t\t\tif(top=='R') array[2]++;\n\t\t\tif(top=='C') array[3]++;\n\t\t\tif(top=='H') array[4]++;\n\t\t}\n\t\tsc.close();\n\t\tlong ans=0;\n\t\tfor(int i=0;i<3;i++) {\n\t\t\tfor(int j=i+1;j<4;j++) {\n\t\t\t\tfor(int k=j+1;k<5;k++) ans += (long)array[i]*array[j]*array[k];\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "from itertools import combinations as C\n\nd = {}\nfor _ in range(int(input())):\n s = input()[0]\n d[s] = d.get(s, 0) + 1\n\ndk = set(d.keys()) & set(\"MARCH\")\nans = 0\nfor p, q, r in C(dk, 3):\n ans += d[p] * d[q] * d[r]\nelse:\n print(ans)", "import itertools\nfrom collections import Counter\nn=int(input())\nS=[input()[0] for i in range(n)]\nls=[\"M\",\"A\",\"R\",\"C\",\"H\"]\nS=Counter([i for i in S if i in ls])\nans=0\nfor i,j,k in itertools.combinations(ls,3):\n ans+=S[i]*S[j]*S[k]\nprint(ans)", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main(void) {\n\tint num, i = 0, p;\n\tlong long ans = 0, a[5] = { 0 };\n\tcin >> num;\n\tstring s, march = \"MARCH\";\n\tfor (; i < num; i++) {\n\t\tcin >> s;\n\t\tp = march.find(s[0]);\n\t\ta[p]++;\n\t}\n\tans += a[0] * a[1] * (a[2] + a[3] + a[4]);\n\tans += a[2] * a[3] * (a[0] + a[1] + a[4]);\n\tans += (a[0] + a[1]) * (a[2] + a[3]) * a[4];\n\tcout << ans << \"\\n\";\n\treturn 0;\n}", "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n int n;\n unsigned long m,a,r,c,h,sum;\n m=a=r=c=h=0;\n string s;\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>s;\n if(s[0]=='M')m++;\n else if(s[0]=='A')a++;\n else if(s[0]=='R')r++;\n else if(s[0]=='C')c++;\n else if(s[0]=='H')h++;\n }\n sum=m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h;\n cout<<sum<<endl;\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long N = sc.nextInt();\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n for (int i = 0 ; i < N ; i++) {\n String s = sc.next();\n char ch = s.charAt(0);\n switch (ch) {\n case 'M':\n m++;\n break;\n case 'A' :\n a++;\n break;\n case 'R' :\n r++;\n break;\n case 'C' :\n c++;\n break;\n case 'H' :\n h++;\n break;\n default:\n }\n }\n long ans = m * a * r + m * a * c + m * a * h + m * r * c +\n m * r * h + m * c * h + a * r * c + a * r * h + a * c * h + r * c * h;\n System.out.println(ans);\n }\n\n}", "import java.util.Scanner;\nimport java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Map<Character,Set<String>> map = new HashMap<>();\n for(int i = 0;i < n;i++){\n String str = sc.next();\n char x = str.charAt(0);\n if(!(x == 'M'||x == 'A'||x == 'R'||x == 'C'||x == 'H')){\n continue;\n }\n if(!map.containsKey(x)){\n map.put(x,new HashSet<String>());\n }\n map.get(x).add(str);\n }\n if(map.size() < 3){\n System.out.println(0);\n return;\n }\n List<Set<String>> list = new ArrayList<>(map.values());\n long ans = 0;\n for(int i = 0;i < list.size();i++){\n for(int j = i+1;j < list.size();j++){\n for(int k = j+1;k < list.size();k++){\n long x = (long) list.get(i).size() * (long) list.get(j).size() * (long) list.get(k).size() ;\n ans += x;\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint n;\nlong long ans = 0;\nmap<char, long long> m;\nchar c[5] = {'M', 'A', 'R', 'C', 'H'};\n\nint main(){\n cin >> n;\n for (int i = 1; i <= n; i++){\n string s; \n cin >> s;\n m[s[0]]++;\n }\n for (int i = 0; i < 3; i++)\n for (int j = i + 1; j < 4; j++)\n for (int k = j + 1; k < 5; k++){\n ans += m[c[i]]*m[c[j]]*m[c[k]];\n }\n cout << ans;\n}", "from itertools import*;s,*_=zip(*open(0).readlines());print(sum(p*q*r for p,q,r in combinations([s.count(t)for t in\"MARCH\"],3)))", "#include<cstdio>\n#include<iostream>\n#include<string>\nusing namespace std;\nstring s;\nlong long int n,M=0,A=0,R=0,C=0,H=0;\nlong long int ans=0;\nint main()\n{\n\tios::sync_with_stdio(false);\n\tcin>>n;\n\tfor(int i=1;i<=n;++i)\n\t{\n\t\tcin>>s;\n\t\tif(s[0]=='M') ++M;\n\t\tif(s[0]=='A') ++A;\n\t\tif(s[0]=='R') ++R;\n\t\tif(s[0]=='C') ++C;\n\t\tif(s[0]=='H') ++H;\n\t}\n\tans+=(M*A*R+M*A*C+M*A*H);\n\tans+=(M*R*C+M*R*H+M*C*H);\n\tans+=(A*R*C+A*R*H+A*C*H);\n\tans+=(R*C*H);\n\tprintf(\"%lld\",ans);\n\treturn 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <algorithm>\nusing namespace std;\nlong long h[5],num;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tstring s[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>s[i];\n\t\tif(s[i][0]=='M') h[0]++;\n\t\tif(s[i][0]=='A') h[1]++;\n\t\tif(s[i][0]=='R') h[2]++;\n\t\tif(s[i][0]=='C') h[3]++;\n\t\tif(s[i][0]=='H') h[4]++;\n }\n\t\n\tfor(int i=0;i<3;i++)\n\t\tfor(int j=i+1;j<4;j++)\n\t\t\tfor(int k=j+1;k<5;k++)\n\t\t\t\tnum+=h[i]*h[j]*h[k];\n\tcout<<num<<endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tString s=\"\";\n\t\tlong[] a=new long [5];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ts=sc.next();\n\t\t\tif(s.charAt(0)=='M'){\n\t\t\t\ta[0]++;\n\t\t\t}\n\t\t\telse if(s.charAt(0)=='A'){\n\t\t\t\ta[1]++;\n\t\t\t}\n\t\t\telse if(s.charAt(0)=='R'){\n\t\t\t\ta[2]++;\n\t\t\t}\n\t\t\telse if(s.charAt(0)=='C'){\n\t\t\t\ta[3]++;\n\t\t\t}\n\t\t\telse if(s.charAt(0)=='H'){\n\t\t\t\ta[4]++;\n\t\t\t}\n\n\t\t}\n\t\tlong ans=0;\n\t\tfor(int i=0;i<3;i++) {\n\t\t\tfor(int j=i+1;j<4;j++) {\n\t\t\t\tfor(int k=j+1;k<5;k++) {\n\t\t\t\t\tans+=a[i]*a[j]*a[k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\t\n\t\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n\n\nint main(){\n int N;\n cin>>N;\n \n int64_t m=0;\n int64_t a=0;\n int64_t r=0;\n int64_t c=0;\n int64_t h=0;\n for(int i=0;i<N;i++){\n string S;\n cin>>S;\n if(S.at(0)=='M') m++;\n if(S.at(0)=='A') a++;\n if(S.at(0)=='R') r++;\n if(S.at(0)=='C') c++;\n if(S.at(0)=='H') h++;\n }\n int64_t T=m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h;\n int64_t Q=a*r*c+a*r*h+a*c*h+r*c*h;\n cout<<T+Q<<endl;\n \n \n \n}", "from collections import Counter\nfrom itertools import combinations\n\nn = int(input())\nl = Counter(input()[0] for _ in range(n))\ncon = [l[c] for c in 'MARCH' if c in l]\nprint(sum(a * b * c for a, b, c in combinations(con, 3)))\n", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint count = sc.nextInt();\n\t\tHashMap<String, Long> map = new HashMap<String, Long>();\n\t\tmap.put(\"M\", (long) 0);\n\t\tmap.put(\"A\", (long) 0);\n\t\tmap.put(\"R\", (long) 0);\n\t\tmap.put(\"C\", (long) 0);\n\t\tmap.put(\"H\", (long) 0);\n\t\tfor (int i = 0; i < count; i++) {\n\t\t\tString initial = sc.next().split(\"\")[0];\n\n\t\t\tif (initial.equals(\"M\") || initial.equals(\"A\") || initial.equals(\"R\") || initial.equals(\"C\") || initial.equals(\"H\")) {\n\t\t\t\tlong value = map.get(initial);\n\t\t\t\tmap.put(initial, value + 1);\n\t\t\t}\n\t\t}\n\n\t\tlong result = 0;\n\t\tresult += map.get(\"M\") * map.get(\"A\") * map.get(\"R\");\n\t\tresult += map.get(\"M\") * map.get(\"A\") * map.get(\"C\");\n\t\tresult += map.get(\"M\") * map.get(\"A\") * map.get(\"H\");\n\t\tresult += map.get(\"M\") * map.get(\"R\") * map.get(\"C\");\n\t\tresult += map.get(\"M\") * map.get(\"R\") * map.get(\"H\");\n\t\tresult += map.get(\"M\") * map.get(\"C\") * map.get(\"H\");\n\t\tresult += map.get(\"A\") * map.get(\"R\") * map.get(\"C\");\n\t\tresult += map.get(\"A\") * map.get(\"R\") * map.get(\"H\");\n\t\tresult += map.get(\"A\") * map.get(\"C\") * map.get(\"H\");\n\t\tresult += map.get(\"R\") * map.get(\"C\") * map.get(\"H\");\n\t\t\n\t\tSystem.out.println(result);\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n char[] s = new char[n];\n long[] count = new long[5];\n for (int i = 0; i < n; i++) {\n s[i] = sc.next().charAt(0);\n if (s[i] == 'M') count[0]++;\n if (s[i] == 'A') count[1]++;\n if (s[i] == 'R') count[2]++;\n if (s[i] == 'C') count[3]++;\n if (s[i] == 'H') count[4]++;\n }\n long ans = 0l;\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 4; j++) {\n for (int k = j + 1; k < 5; k++) {\n ans += count[i] * count[j] * count[k];\n }\n }\n }\n System.out.println(ans);\n }\n}", "#include<stdio.h>\n\nint main(void)\n{\n long a=0, m=0, r=0, c=0, h=0;\n int i,num;\n long answer;\n scanf(\"%d\", &num);\n char array[10];\n for(i=1; i<=num; i++)\n {\n scanf(\"%s\", array);\n if(array[0]=='M')m++;\n if(array[0]=='A')a++;\n if(array[0]=='R')r++;\n if(array[0]=='C')c++;\n if(array[0]=='H')h++;\n }\n \n answer=m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*c*h+r*c*h+a*r*h;\n printf(\"%ld\", answer);\n \n return 0;\n}\n", "#include<iostream>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint main()\n{\n long long n,i,j,k,res=0;\n long long c[5];\n string s,m=\"MARCH\";\n cin >> n;\n fill(c,c+5,0);\n for(i=0;i<n;i++){\n cin >> s;\n for(j=0;j<5;j++)\n if(s[0]==m[j])\n c[j]++;\n }\n for(i=0;i<=2;i++)\n for(j=i+1;j<=3;j++)\n for(k=j+1;k<=4;k++)\n res+=c[i]*c[j]*c[k];\n cout << res << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n unsigned long long N,m=0,a=0,r=0,c=0,h=0;\n cin >> N;\n vector<string> S(N);\n for(int i = 0;i < N;i ++){\n cin >> S[i];\n if(S[i][0]=='M') m++;\n if(S[i][0]=='A') a++;\n if(S[i][0]=='R') r++;\n if(S[i][0]=='C') c++;\n if(S[i][0]=='H') h++;\n }\n cout << m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+\n m*c*h+a*r*c+a*r*h+a*c*h+r*c*h << endl;\n \n return 0;\n}", "from itertools import combinations as C\n\nd = {}\nfor _ in range(int(input())):\n s = input()[0]\n if s in \"MARCH\":\n d[s] = d.get(s, 0) + 1\nelse:\n print(sum([p * q * r for p, q, r in C(d.values(), 3)]))", "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int N;\n cin>>N;\n long long M=0,A=0,R=0,C=0,H=0;\n for(int i=0;i<N;i++){\n string S;\n cin>>S;\n \n if(S.at(0)=='M')\n M++;\n if(S.at(0)=='A')\n A++;\n if(S.at(0)=='R')\n R++;\n if(S.at(0)=='C')\n C++;\n if(S.at(0)=='H')\n H++;\n \n }\n \n cout<<M*A*R + M*A*C + M*A*H + M*R*C + M*R*H + M*C*H + A*R*C + A*R*H + A*C*H + R*C*H ;\n}\n", "#abc089c\n\nn=int(raw_input())\nm=a=r=c=h=0\nfor i in xrange(n):\n temp=raw_input()\n if temp[0]=='M':\n m+=1\n elif temp[0]=='A':\n a+=1\n elif temp[0]=='R':\n r+=1\n elif temp[0]=='C':\n c+=1\n elif temp[0]=='H':\n h+=1\ns=[m,a,r,c,h]\nres=0\nfor i in xrange(5):\n for j in xrange(i):\n for k in xrange(j):\n res+=s[i]*s[j]*s[k]\nprint res\n", "import java.util.*;\n\nclass Main{\n\n\tpublic static ArrayList<String> nameM = new ArrayList<>();\n\tpublic static ArrayList<String> nameA = new ArrayList<>();\n\tpublic static ArrayList<String> nameR = new ArrayList<>();\n\tpublic static ArrayList<String> nameC = new ArrayList<>();\n\tpublic static ArrayList<String> nameH = new ArrayList<>();\n\t\n\tpublic static void main(String args[]){\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\n\n\n\t\tfor(int n=0;n<N;n++){\n\t\t\tString st = sc.next();\n\t\t\tswitch(st.charAt(0)){\n\t\t\t\tcase 'M':\n\t\t\t\t nameM.add(st);\n\t\t\t\tbreak;\n\t\t\t\tcase 'A':\n\t\t\t\t nameA.add(st);\n\t\t\t\tbreak;\n\t\t\t\tcase 'R':\n\t\t\t\t nameR.add(st);\n\t\t\t\tbreak;\n\t\t\t\tcase 'C':\n\t\t\t\t nameC.add(st);\n\t\t\t\tbreak;\n\t\t\t\tcase 'H':\n\t\t\t\t nameH.add(st);\n\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tlong ns[] = new long[5];\n\t\tns[0] = nameM.size();\n\t\tns[1] = nameA.size();\n\t\tns[2] = nameR.size();\n\t\tns[3] = nameC.size();\n\t\tns[4] = nameH.size();\n\n\t\tlong count = 0;\n\t\tcount += ns[0]*ns[1]*ns[2];\n\t\tcount += ns[0]*ns[1]*ns[3];\n\t\tcount += ns[0]*ns[1]*ns[4];\n\t\tcount += ns[0]*ns[2]*ns[3];\n\t\tcount += ns[0]*ns[2]*ns[4];\n\t\tcount += ns[0]*ns[3]*ns[4];\n\t\tcount += ns[1]*ns[2]*ns[3];\n\t\tcount += ns[1]*ns[2]*ns[4];\n\t\tcount += ns[1]*ns[3]*ns[4];\n\t\tcount += ns[2]*ns[3]*ns[4];\n\n\t\tSystem.out.println(count);\n\n\t}\n}", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main(){\n\tint n;\n\tlong long march[5] = {0};\n\tconst char pat[] = \"MARCH\";\n\n\tcin >> n;\n\tfor(int i=0; i<n ;i++){\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor(int t=0; t<5; t++){\n\t\t\tif(pat[t] == s[0])\n\t\t\t\tmarch[t] += 1;\n\t\t}\n\t}\n\n\tlong long ans = 0;\n\n\tfor(int a=0; a<5; a++)\n\t\tfor(int b=a+1; b<5; b++)\n\t\t\tfor(int c=b+1; c<5; c++){\n\t\t\t\tans += march[a] * march[b] * march[c];\n\t\t\t}\n\n\tcout << ans << endl;\n\n\treturn 0;\n}\n", "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong m = 0;\n\t\tlong a = 0;\n\t\tlong r = 0;\n\t\tlong c = 0;\n\t\tlong h = 0;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tchar fc = sc.next().charAt(0);\n\t\t\tswitch (fc) {\n\t\t\t\tcase 'M':\n\t\t\t\t\tm++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'A':\n\t\t\t\t\ta++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'R':\n\t\t\t\t\tr++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'C':\n\t\t\t\t\tc++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'H':\n\t\t\t\t\th++;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(r*c*h + a*c*h + a*r*h + a*r*c + m*c*h + m*r*h + m*r*c + m*a*h + m*a*c + m*a*r);\n\t}\n}", "#include <stdio.h>\n#include <string.h>\nint main()\n{\n\tlong long n,m=0,h=0,a=0,r=0,c=0,sum=0;\n\tchar s[105];\n\tscanf(\"%lld\",&n);\n\twhile(n--)\n {\n getchar();\n scanf(\"%s\",s);\n if(s[0]=='M') m++;\n if(s[0]=='A') a++;\n if(s[0]=='R') r++;\n if(s[0]=='C') c++;\n if(s[0]=='H') h++;\n }\n //printf(\"%lld %lld %lld %lld %lld\\n\",m,a,r,c,h);\n sum+=m*a*r+m*a*c+m*a*h+m*r*c+m*r*h+m*c*h+a*r*c+a*r*h+r*c*h+a*c*h;\n\tprintf(\"%lld\\n\",sum);\n }\n", "from collections import Counter\nfrom itertools import combinations\nN = int(input())\nS = [input()[0] for _ in range(N)]\ncnt = Counter(S)\nans = 0\nfor a, b, c in combinations('MARCH', 3):\n ans += cnt[a] * cnt[b] * cnt[c]\n\nprint(ans)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n String[] s = new String[n];\n long m = 0;\n long a = 0;\n long r = 0;\n long c = 0;\n long h = 0;\n for (int i = 0; i < n; i++) {\n s[i] = sc.next();\n }\n for (int i = 0; i < n; i++) {\n if (s[i].charAt(0) == 'M')\n m++;\n if (s[i].charAt(0) == 'A')\n a++;\n if (s[i].charAt(0) == 'R')\n r++;\n if (s[i].charAt(0) == 'C')\n c++;\n if (s[i].charAt(0) == 'H')\n h++;\n }\n System.out.println(m * a * r + m * a * c + m * a * h + m * r * c + m * r * h + m * c * h + a * r * c + a * r * h\n + a * c * h + r * c * h);\n }\n}\n", "#include <iostream>\nusing namespace std;\n\nint main(void){\n int n;\n cin >> n;\n string name;\n long m,a,r,c,h;\n m=0;\n a=0;\n r=0;\n c=0;\n h=0; \n for (int i = 0; i < n; i++)\n {\n cin >> name;\n if (name[0] == 'M') m++;\n if (name[0] == 'A') a++;\n if (name[0] == 'R') r++;\n if (name[0] == 'C') c++;\n if (name[0] == 'H') h++;\n }\n cout << m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h +r*c*h << endl;\n return 0;\n}\n", "import itertools\nn = int(input())\nS = \"MARCH\"\nd = {s:0 for s in S}\nans = 0\nfor i in range(n):\n f = input()[0]\n if f in S:\n d[f] += 1\nfor x,y,z in itertools.combinations(d.keys(),3):\n ans += d[x] * d[y] * d[z]\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nll ans;\nint n;\nll a[5];\n\nint main(){\n\n cin>>n;\n\n for(int i=0;i<n;i++){\n char s[100];\n cin>>s;\n if(s[0]=='M') a[0]++;\n if(s[0]=='A') a[1]++;\n if(s[0]=='R') a[2]++;\n if(s[0]=='C') a[3]++;\n if(s[0]=='H') a[4]++;\n }\n \n for(int i=0;i<5;i++)\n for(int j=i+1;j<5;j++)\n for(int k=j+1;k<5;k++)\n ans+=a[i]*a[j]*a[k];\n\n\n cout<<ans<<endl;\n\n return 0;\n}\n", "from itertools import*;d,o=[0]*91,ord\nfor _ in[0]*int(input()):d[o(input()[0])]+=1\nprint(sum(d[p]*d[q]*d[r]for p,q,r in combinations(map(o,'MARCH'),3)))", "from collections import Counter\nfrom itertools import combinations\n\nn = int(input())\ns = [input()[0] for _ in range(n)]\n\nC = Counter(s)\nans = 0\nfor x, y, z in combinations(\"MARCH\", 3):\n ans += C[x] * C[y] * C[z]\n\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int(i)=0;i<(n);i++)\n\nint main(){\n long long n,ans=0;cin>>n;\n vector<long long> x(5,0);\n REP(i,n){\n string s,m=\"MARCH\";cin>>s;\n REP(j,5) if(s.at(0)==m.at(j)) x.at(j)++;\n }\n for(int i=0;i<3;i++){\n for(int j=i+1;j<4;j++){\n for(int k=j+1;k<5;k++){\n ans+=x.at(i)*x.at(j)*x.at(k);\n }\n }\n }\n cout<<ans;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\nchar c[5] = {'M', 'A', 'R', 'C', 'H'};\nint cnt[30];\nint n, ans;\n\nint32_t main() {\n cin >> n;\n for (int i = 0; i < n; i++) {\n\tstring s;\n\tcin >> s;\n\tcnt[s[0] - 'A']++;\n }\n for (auto i : c)\n\tfor (auto j : c)\n\t for (auto k : c)\n\t\tif (i != j && j != k && k != i)\n\t\t ans += cnt[i - 'A'] * cnt[j - 'A'] * cnt[k - 'A'];\n return cout << ans / 6, 0;\n}", "import re\nimport sys\nimport itertools\n\nif __name__ == '__main__':\n N = input()\n S = list()\n c = 0\n d = {'M':0,'A':0,'R':0,'C':0,'H':0}\n for i in xrange(N):\n a = raw_input()[0]\n if a in d.keys():\n d[a] += 1\n if d['M'] > 0 and d['A'] > 0 and d['R'] > 0:\n c += d['M']*d['A']*d['R']\n if d['M'] > 0 and d['A'] > 0 and d['C'] > 0:\n c += d['M']*d['A']*d['C']\n if d['M'] > 0 and d['A'] > 0 and d['H'] > 0:\n c += d['M']*d['A']*d['H']\n if d['M'] > 0 and d['R'] > 0 and d['C'] > 0:\n c += d['M']*d['R']*d['C']\n if d['M'] > 0 and d['R'] > 0 and d['H'] > 0:\n c += d['M']*d['R']*d['H']\n if d['M'] > 0 and d['C'] > 0 and d['H'] > 0:\n c += d['M']*d['C']*d['H']\n if d['A'] > 0 and d['R'] > 0 and d['C'] > 0:\n c += d['A']*d['R']*d['C']\n if d['A'] > 0 and d['R'] > 0 and d['H'] > 0:\n c += d['A']*d['R']*d['H']\n if d['A'] > 0 and d['C'] > 0 and d['H'] > 0:\n c += d['A']*d['C']*d['H']\n if d['R'] > 0 and d['C'] > 0 and d['H'] > 0:\n c += d['R']*d['C']*d['H']\n print c\n", "n = int(raw_input())\na = [0 for _ in range(5)]\nfor _ in range(n):\n s = raw_input()\n if s[0] == 'M':\n a[0] += 1\n elif s[0] == 'A':\n a[1] += 1\n elif s[0] == 'R':\n a[2] += 1\n elif s[0] == 'C':\n a[3] += 1\n elif s[0] == 'H':\n a[4] += 1\nct = 0\nfor i in range(5):\n for j in range(i+1,5):\n for k in range(j+1,5):\n ct += a[i] * a[j] * a[k]\nprint ct\n", "N = int(input())\nS = [input() for i in range(N)]\nfrom collections import Counter\nctr = Counter([s[0] for s in S])\n\nans = 0\nimport itertools\nfor ptn in itertools.combinations('MARCH', 3):\n t = 1\n for c in ptn:\n t *= ctr[c]\n ans += t\nprint(ans)", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n\tint N;\n\tcin >> N;\n\tmap<char, ll> m;\n\tfor (int i = 0; i < N; i++) {\n\t\tstring S;\n\t\tcin >> S;\n\t\tm[S[0]]++;\n\t}\n\tstring s = \"MARCH\";\n\tll ans = 0;\n\tfor (int i = 0; i < 5; i++) {\n\t\tfor (int j = i + 1; j < 5; j++) {\n\t\t\tfor (int k = j + 1; k < 5; k++) {\n\t\t\t\tans += m[s[i]] * m[s[j]] * m[s[k]];\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n}" ]
For a string S, let f(S) be the lexicographically smallest cyclic shift of S. For example, if S = `babca`, f(S) = `ababc` because this is the smallest among all cyclic shifts (`babca`, `abcab`, `bcaba`, `cabab`, `ababc`). You are given three integers X, Y, and Z. You want to construct a string T that consists of exactly X `a`s, exactly Y `b`s, and exactly Z `c`s. If there are multiple such strings, you want to choose one that maximizes f(T) lexicographically. Compute the lexicographically largest possible value of f(T). Constraints * 1 \leq X + Y + Z \leq 50 * X, Y, Z are non-negative integers. Input Input is given from Standard Input in the following format: X Y Z Output Print the answer. Examples Input 2 2 0 Output abab Input 1 1 1 Output acb
[ "#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<cstdlib>\n#include<algorithm>\n#include<set>\nusing namespace std;\n#define REP(i,st,ed) for(int i=st,i##end=ed;i<=i##end;++i)\n#define DREP(i,st,ed) for(int i=st,i##end=ed;i>=i##end;--i)\nmultiset<string>s;\nmultiset<string>::iterator it1,it2;\nint a,b,c;\nint main(){\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tREP(i,1,a)s.insert(\"a\");\n\tREP(i,1,b)s.insert(\"b\");\n\tREP(i,1,c)s.insert(\"c\");\n\tREP(i,1,a+b+c-1){\n\t\tit1=s.begin();\n\t\tit2=s.end(),--it2;\n\t\ts.insert(*it1+*it2);\n\t\ts.erase(it1);\n\t\ts.erase(it2);\n\t}\n\tcout<<*s.begin()<<endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\n#define reg register\n#define ll long long\nusing namespace std;\nmultiset<string>s;\nll a,b,c;\nint main()\n{\n\tscanf(\"%lld%lld%lld\",&a,&b,&c);\n\tfor(reg int i=1;i<=a;i++)s.insert(\"a\");\n for(reg int i=1;i<=b;i++)s.insert(\"b\");\n for(reg int i=1;i<=c;i++)s.insert(\"c\");\n while(s.size()>1)\n\t{\n string a=*s.begin(),b=*s.rbegin();\n s.erase(s.lower_bound(a));\n s.erase(s.lower_bound(b));\n s.insert(a+b);\n }\n cout<<(*s.begin()).c_str()<<endl;\n return 0;\n}", "#include<cstdio>\n#include<algorithm>\n#include<iostream>\n#include<cstring>\n#include<vector>\nusing namespace std;\ntypedef long long LL;\nstring solve (int x,int y,int z)\n{\n//\tprintf(\"%d %d %d\\n\",x,y,z);\n\tif (y==0&&z==0)\n\t{\n\t\tstring ans;\n\t\tfor (int u=1;u<=x;u++) ans+='a';\n\t\treturn ans;\n\t}\n\tif (x==0)\n\t{\n\t\tstring ans=solve(y,z,0);\n\t\tfor (int u=0;u<ans.size();u++)\tans[u]++;\n\t\treturn ans;\n\t}\n\tif (z==0)\n\t{\n\t\tstring ans=solve(x,0,y);\n\t\tfor (int u=0;u<ans.size();u++)\tif (ans[u]=='c') ans[u]='b';\n\t\treturn ans;\n\t}\n\tif (z>=x)\n\t{\n\t\tstring str=solve(x,y,z-x),ans;\n\t\tfor (int u=0;u<str.size();u++)\n\t\t{\n\t\t\tans+=str[u];\n\t\t\tif (str[u]=='a') ans+='c';\n\t\t}\n\t\treturn ans;\n\t}\n\telse\n\t{\n\t\tstring str=solve(x-z,z,y),ans;\n\t\tfor (int u=0;u<str.size();u++)\n\t\t{\n\t\t\tif (str[u]=='a') ans+='a';\n\t\t\telse if (str[u]=='b')\t{ans+='a';ans+='c';}\n\t\t\telse ans+='b';\n\t\t}\n\t\treturn ans;\n\t}\n}\nint main()\n{\n\tint x,y,z;\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tcout<<solve(x,y,z);\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nmultiset< string > S; \nmultiset< string > :: iterator it; \n\nint A, B, C; \nstring ns; \n\nint main() {\n\n\tcin >> A >> B >> C; \n\n\tfor(int i=1; i<=A; ++i) S.insert(\"a\"); \n\tfor(int i=1; i<=B; ++i) S.insert(\"b\"); \n\tfor(int i=1; i<=C; ++i) S.insert(\"c\"); \n\n\twhile(1) {\n\t\tif(S.size() == 1) break; \n\t\tit = S.begin(); \n\t\tns = (*it);\n\t\tS.erase(it); \n\t\tit = S.end(); \n\t\t--it; \n\t\tns = ns + (*it); \n\t\tS.erase(it); \n\t\tS.insert(ns); \n\t}\n\n\tit = S.begin();\n\tns = (*it); \n\tcout << ns << endl; \n\n\treturn 0; \n\n}", "// includes {{{\n#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <deque>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <tuple>\n#include <vector>\n// }}}\n// #include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstring operator*(string a, int t) {\n string r;\n while(t) {\n if(t&1) r += a;\n a += a;\n t >>= 1;\n }\n return r;\n}\n\nstring sol(int x, int y, int z, string a, string b, string c) {\n if(y + z == 0) return a * x;\n if(x == 0) return sol(y, z, 0, b, c, \"\");\n int p = x / (y + z);\n int q = x % (y + z);\n string t = a * p;\n if(q < z) {\n // aa...ac, aa...b, aa...c\n return sol(q, y, z - q, t + a + c, t + b, t + c);\n } else {\n // aa...ac, aa...ab, aa...b\n return sol(q - z, z, y - (q - z), t + a + b, t + a + c, t + b);\n }\n}\n\nint main() {\n std::ios::sync_with_stdio(false), std::cin.tie(0);\n int x, y, z;\n cin >> x >> y >> z;\n cout << sol(x, y, z, \"a\", \"b\", \"c\") << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\n#define fr(a,b,c) for(int a=b,__=c;a<__;a++)\nusing namespace std;\ntypedef long long ll;\nll n,m;\nstring dp[51][51][51];\n\nstring go(int x,int y,int z){\n\tif(x==1&&y==0&&z==0)return \"a\";\n\tif(x==0&&y==1&&z==0)return \"b\";\n\tif(x==0&&y==0&&z==1)return \"c\";\n\tif(dp[x][y][z]!=\"\")return dp[x][y][z];\n\tfr(i,0,x+1)fr(j,0,y+1)fr(k,0,z+1){\n\t\tif(i+j+k&&(i!=x||j!=y||k!=z)){\n\t\t\tstring a=go(i,j,k);\n\t\t\tstring b=go(x-i,y-j,z-k);\n\t\t\tif(a<b)a=a+b;\n\t\t\telse a=b+a;\n\t\t\tif(dp[x][y][z]<a)dp[x][y][z]=a;\n\t\t}\n\t}\n\treturn dp[x][y][z]; \n}\n\nint main(){\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<go(x,y,z)<<endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nchar str[201];\nstring s[201];\n\n\nint main()\n{\n int x, y, z;\n scanf(\"%d%d%d\", &x, &y, &z);\n int r = 0;\n while(x--) str[r++] = 'a';\n while(y--) str[r++] = 'b';\n while(z--) str[r++] = 'c';\n\n for(int i = 0; i < r; i++) s[i] += str[i];\n while(r > 1)\n {\n sort(s, s+r);\n s[0] += s[r-1];\n r--;\n }\n cout << s[0] << endl;\n return 0;\n\n}\n", "#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <cassert>\nusing namespace std;\n#define rep(i,a,n) for (int i=a;i<n;i++)\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\n#define pb push_back\n#define mp make_pair\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define SZ(x) ((int)(x).size())\ntypedef vector<int> VI;\ntypedef long long ll;\ntypedef pair<int,int> PII;\nconst ll mod=1000000007;\nll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}\n// head\n\nint rem[55][55][55][55],nxt[55][10],fail[55],T;\nbool val[55][55][55][55];\nchar s[55];\nint x,y,z;\nbool dfs2(int u,int v,int w,int p) {\n\tif (rem[u][v][w][p]==T) return val[u][v][w][p];\n//\tprintf(\"%d %d %d %d\\n\",u,v,w,p);\n\trem[u][v][w][p]=T;\n\tbool &r=val[u][v][w][p]; r=0;\n\tif (u==0&&v==0&&w==0) {\n\t\trep(i,0,x+y+z) {\n\t\t\tif (s[i]==0) break;\n\t\t\tif (s[p]>s[i]) return r=0;\n\t\t\telse p=nxt[p][s[i]-'a'];\n\t\t}\n\t\treturn r=1;\n\t}\n\tif (u>0&&s[p]<='a') r|=dfs2(u-1,v,w,nxt[p][0]); if (r) return 1;\n\tif (v>0&&s[p]<='b') r|=dfs2(u,v-1,w,nxt[p][1]); if (r) return 1;\n\tif (w>0&&s[p]<='c') r|=dfs2(u,v,w-1,nxt[p][2]); if (r) return 1;\n\treturn r=0;\n}\nbool checkp(int u,int v,int w,int d) {\n//\tputs(\"checking\");\n\ts[d]=0;\n\trep(i,0,d) {\n\t\tbool cmp=0;\n\t\trep(j,0,d-i) if (s[j]!=s[i+j]) {\n\t\t\tif (s[j]>s[i+j]) cmp=1;\n\t\t\tbreak;\n\t\t}\n\t\tif (cmp) return 0;\n\t}\n//\tputs(s);\n\tif (d==0) return 1;\n\trep(i,0,3) nxt[0][i]=0;\n\tif (d>1) nxt[0][s[0]-'a']=1;\n\trep(i,1,d) {\n\t\tif (i==1) fail[i]=0; else fail[i]=nxt[fail[i-1]][s[i-1]-'a'];\n\t\trep(j,0,3) nxt[i][j]=nxt[fail[i]][j];\n\t\tif (i+1!=d) nxt[i][s[i]-'a']=i+1;\n\t}\n\tfail[d]=nxt[d-1][s[d-1]-'a'];\n\tT++;\n\treturn dfs2(u,v,w,fail[d]);\n}\nbool check(int d) {\n\trep(i,0,d) {\n\t\tbool cmp=0;\n\t\trep(j,0,d) if (s[j]!=s[(i+j)%d]) {\n\t\t\tif (s[j]>s[(i+j)%d]) cmp=1;\n\t\t\tbreak;\n\t\t}\n\t\tif (cmp) return 0;\n\t}\n\treturn 1;\n}\nvoid dfs(int u,int v,int w,int d) {\n\tif (!checkp(u,v,w,d)) return;\n\tif (u==0&&v==0&&w==0) {\n\t\tif (check(d)) {\n\t\t\tputs(s);\n\t\t\texit(0);\n\t\t}\n\t} else {\n\t\tif (w>0) s[d]='c',dfs(u,v,w-1,d+1);\n\t\tif (v>0) s[d]='b',dfs(u,v-1,w,d+1);\n\t\tif (u>0) s[d]='a',dfs(u-1,v,w,d+1);\n\t}\n}\nint main() {\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tdfs(x,y,z,0);\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n//INSERT ABOVE HERE\nsigned main(){\n int x,y,z;\n cin>>x>>y>>z;\n vector<string> vs;\n for(int i=0;i<x;i++) vs.emplace_back(\"a\");\n for(int i=0;i<y;i++) vs.emplace_back(\"b\");\n for(int i=0;i<z;i++) vs.emplace_back(\"c\");\n while(vs.size()>1u){\n sort(vs.begin(),vs.end());\n vs.front()+=vs.back();\n vs.pop_back();\n }\n cout<<vs.front()<<endl;\n return 0;\n}\n", "//2017-10-10\n//miaomiao\n//\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <iostream>\n#include <algorithm>\n#include <set>\n\nusing namespace std;\n\n#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)\n\nmultiset<string> s;\n\nint main(){\n\tint A, B, C;\n\tscanf(\"%d%d%d\", &A, &B, &C);\n\n\tFor(i, 1, A) s.insert(\"a\");\n\tFor(i, 1, B) s.insert(\"b\");\n\tFor(i, 1, C) s.insert(\"c\");\n\n\tstring tmp;\n\twhile(s.size() > 1){\n\t\ttmp = (*s.begin()) + (*s.rbegin());\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(tmp);\n\t}\n\n\tprintf(\"%s\\n\", (*s.begin()).c_str());\n\n\treturn 0;\n}", "// Copyright (C) 2017 Sayutin Dmitry.\n//\n// This program is free software; you can redistribute it and/or\n// modify it under the terms of the GNU General Public License as\n// published by the Free Software Foundation; version 3\n\n// This program is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU General Public License for more details.\n\n// You should have received a copy of the GNU General Public License\n// along with this program; If not, see <http://www.gnu.org/licenses/>.\n\n#include <iostream>\n#include <vector>\n#include <stdint.h>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <array>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <utility>\n#include <string>\n#include <assert.h>\n#include <iterator>\n#include <cstdint>\n#include <cinttypes>\n#include <string.h>\n#include <random>\n#include <numeric>\n#include <tuple>\n\n\nusing std::cin;\nusing std::cout;\nusing std::cerr;\n\nusing std::vector;\nusing std::map;\nusing std::array;\nusing std::set;\nusing std::string;\n\nusing std::pair;\nusing std::make_pair;\n\nusing std::min;\nusing std::abs;\nusing std::max;\n\nusing std::unique;\nusing std::sort;\nusing std::generate;\nusing std::reverse;\nusing std::min_element;\nusing std::max_element;\n\n#ifdef LOCAL\n#define LASSERT(X) assert(X)\n#else\n#define LASSERT(X) {}\n#endif\n\ntemplate <typename T>\nT input() {\n T res;\n cin >> res;\n LASSERT(cin);\n return res;\n}\n\ntemplate <typename IT>\nvoid input_seq(IT b, IT e) {\n std::generate(b, e, input<typename std::remove_reference<decltype(*b)>::type>);\n}\n\n#define SZ(vec) int((vec).size())\n#define ALL(data) data.begin(),data.end()\n#define RALL(data) data.rbegin(),data.rend()\n#define TYPEMAX(type) std::numeric_limits<type>::max()\n#define TYPEMIN(type) std::numeric_limits<type>::min()\n\n#define pb push_back\n#define eb emplace_back\n\n// solve problem when a != 0.\nstring solve(int a, int b, int c) {\n string base = \"a\";\n \n // while (c >= a)\n // base += 'c', c -= a;\n // while (b >= a)\n // base += 'b', b -= a;\n\n if (b == 0 and c == 0) {\n string res = \"\";\n for (int t = 0; t != a; ++t)\n res += base;\n return res;\n }\n \n int num = (a + (b + c - 1)) / (b + c);\n int free = num * (b + c) - a;\n\n string tmp = \"\";\n for (int i = 0; i != num - 1; ++i)\n tmp += base;\n \n vector<string> parts;\n for (int i = 0; i != (b + c - free); ++i)\n parts.push_back(tmp + base);\n\n for (int i = 0; i != free; ++i)\n parts.push_back(tmp);\n \n for (int i = 0; i != c; ++i)\n parts[i] += 'c';\n for (int i = 0; i != b; ++i)\n parts[c + i] += 'b';\n\n std::sort(ALL(parts));\n vector<string> cparts = parts;\n cparts.resize(std::unique(ALL(cparts)) - cparts.begin());\n\n while (cparts.size() < 3)\n cparts.push_back(\"\");\n\n assert(SZ(cparts) == 3);\n string zzans = solve(std::count(ALL(parts), cparts[0]),\n std::count(ALL(parts), cparts[1]),\n std::count(ALL(parts), cparts[2]));\n\n string ans = \"\";\n for (char ch: zzans)\n ans += cparts[ch - 'a'];\n\n return ans;\n}\n\nint main() {\n std::iostream::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n \n // code here.\n int a = input<int>();\n int b = input<int>();\n int c = input<int>();\n\n std::map<char, char> back;\n if (a == 0 and b == 0) {\n back['a'] = 'c';\n a = c;\n b = 0;\n c = 0;\n } else if (a == 0) {\n back['a'] = 'b';\n back['b'] = 'c';\n a = b;\n b = c;\n c = 0;\n } else {\n back['a'] = 'a';\n back['b'] = 'b';\n back['c'] = 'c';\n }\n\n // solve problem when a != 0.\n string ans = solve(a, b, c);\n for (int i = 0; i != SZ(ans); ++i)\n cout << back[ans[i]];\n cout << \"\\n\";\n \n return 0;\n}\n", "#include<iostream>\n#include<cstdio>\n#include<set> \nusing namespace std;\nint a,b,c;\nmultiset<string> s;\nint main(){\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\twhile (a--) s.insert(\"a\");\n\twhile (b--) s.insert(\"b\");\n\twhile (c--) s.insert(\"c\");\n\twhile (s.size()>1){\n\t\tstring ns=*s.begin()+*s.rbegin();\n\t\ts.erase(s.begin());\n\t\ts.erase(s.find(*s.rbegin()));\n\t\ts.insert(ns);\n\t}\n\tcout<<*s.begin();\n\treturn 0;\n}\n/*\n\tÊ×ÏÈ,Èç¹ûÓÐn¸ö´®,ÎÒÃDZØÐë°Ñ×îСµÄ´®·ÅÔÚ×îÇ°Ãæ.\n\tÈ»ºó,ΪÁËÈÃ×îСֵ×î´ó,ÎÒÃÇ°Ñ×î´óµÄ´®·ÅÔÚ×îСµÄ´®µÄºóÃæ. \n\t\n*/", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define INF (1LL << 55)\n#define MOD (1000 * 1000 * 1000 + 7)\n#define maxn 1000111\n\ntypedef long long ll;\ntypedef long double ld;\n\nvector<string> v;\n\nint main(){\n\tint a, b, c;\n\tcin >> a >> b >> c;\n\t\n\tfor(int i = 0; i < a; i++)\n\t\tv.pb(\"a\");\n\tfor(int i = 0; i < b; i++)\n\t\tv.pb(\"b\");\n\tfor(int i = 0; i < c; i++)\n\t\tv.pb(\"c\");\n\n\twhile(v.size() > 1){\n\t\tsort(v.begin(), v.end());\n\t\tv[0] += v.back();\n\t\tv.pop_back();\n\t}\n\n\tcout << v[0] << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ninline int read()\n{\n\tint x=0,f=1,c=getchar();\n\twhile(c<48) c=='-'&&(f=-1),c=getchar();\n\twhile(c>47) x=x*10+c-'0',c=getchar();\n\treturn x*f;\n}\n\nconst int MAXN = 300005;\nstd::multiset<string> s;\n\nint main(int argc, char const *argv[])\n{\n\tauto init=[](string t) {for(int i=read(); i; --i) s.insert(t);};\n\tinit(\"a\"); init(\"b\"); init(\"c\");\n\twhile(s.size()>1)\n\t{\n\t\tauto st=*s.begin(),ed=*s.rbegin();\n\t\ts.erase(s.lower_bound(st));\n\t\ts.erase(s.lower_bound(ed)); s.insert(st+ed);\n\t}\n\tprintf(\"%s\\n\", (*s.begin()).c_str());\n\treturn 0;\n}", "#include <bits/stdc++.h>\n// iostream is too mainstream\n#include <cstdio>\n// bitch please\n#include <iostream>\n#include <algorithm>\n#include <cstdlib>\n#include <vector>\n#include <set>\n#include <map>\n#include <queue>\n#include <stack>\n#include <list>\n#include <cmath>\n#include <iomanip>\n#include <time.h>\n#define dibs reserve\n#define OVER9000 1234567890123456789LL\n#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)\n#define tisic 47\n#define soclose 1e-8\n#define chocolate win\n// so much chocolate\n#define patkan 9\n#define ff first\n#define ss second\n#define abs(x) ((x < 0)?-(x):x)\n#define uint unsigned int\n#define dbl long double\n#define pi 3.14159265358979323846\nusing namespace std;\n// mylittledoge\n\ntypedef long long cat;\n\n#ifdef DONLINE_JUDGE\n\t// palindromic tree is better than splay tree!\n\t#define lld I64d\n#endif\n\nstring solve(string* s, int* cnt) {\n\twhile(cnt[0] == 0) {\n\t\tcnt[0] =cnt[1], s[0] =s[1];\n\t\tcnt[1] =cnt[2], s[1] =s[2];\n\t\tcnt[2] =0;\n\t}\n\tif(cnt[1]+cnt[2] == 0) {\n\t\tstring ret;\n\t\tfor(int i =0; i < cnt[0]; i++) ret +=s[0];\n\t\treturn ret;\n\t}\n\n\tif(cnt[1] == 0) {\n\t\tcnt[1] =cnt[2], s[1] =s[2];\n\t\tcnt[2] =0;\n\t}\n\tif(cnt[2] == 0) {\n\t\tstring s_nw[] ={\"\", \"\", \"\"};\n\t\tint cnt_nw[] ={0, 0, 0};\n\t\ts_nw[0] =s_nw[1] =s[0];\n\t\twhile(cnt[1] >= cnt[0]) {\n\t\t\tcnt[1] -=cnt[0];\n\t\t\ts_nw[0] +=s[1];\n\t\t\ts_nw[1] +=s[1];\n\t\t}\n\t\ts_nw[1] +=s[1];\n\t\tcnt_nw[1] =cnt[1];\n\t\tcnt_nw[0] =cnt[0]-cnt[1];\n\t\treturn solve(s_nw, cnt_nw);\n\t}\n\n\tstring s_nw[] ={\"\", \"\", \"\"};\n\tint cnt_nw[] ={0, 0, 0};\n\tfor(int i =0; i < 3; i++) s_nw[i] =s[0];\n\twhile(cnt[2] >= cnt[0]) {\n\t\tcnt[2] -=cnt[0];\n\t\tfor(int i =0; i < 3; i++) s_nw[i] +=s[2];\n\t}\n\ts_nw[2] +=s[2];\n\tcnt_nw[2] =cnt[2];\n\tcnt[0] -=cnt[2];\n\twhile(cnt[1] >= cnt[0]) {\n\t\tcnt[1] -=cnt[0];\n\t\ts_nw[0] +=s[1];\n\t\ts_nw[1] +=s[1];\n\t}\n\ts_nw[1] +=s[1];\n\tcnt_nw[1] =cnt[1];\n\tcnt_nw[0] =cnt[0]-cnt[1];\n\treturn solve(s_nw, cnt_nw);\n}\n\nint main() {\n\tcin.sync_with_stdio(0);\n\tcin.tie(0);\n\tcout << fixed << setprecision(10);\n\tstring s[] ={\"a\", \"b\", \"c\"};\n\tint cnt[3];\n\tfor(int i =0; i < 3; i++) cin >> cnt[i];\n\tcout << solve(s, cnt) << \"\\n\";\n\treturn 0;}\n\n// look at my code\n// my code is amazing\n", "#include<cstdio>\n#include<set>\n#include<cstring>\n#include<string>\n#include<iostream>\nusing namespace std;\nmultiset<string> sak;\nmultiset<string>::iterator it;\nint main(){\n//\tfreopen(\"F.in\",\"r\",stdin);\n\tint x,y,z;\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tfor(int i=1;i<=x;i++) sak.insert(\"a\");\n\tfor(int i=1;i<=y;i++) sak.insert(\"b\");\n\tfor(int i=1;i<=z;i++) sak.insert(\"c\");\n\tstring s1,s2;\n\twhile(sak.size()>1){\n\t\tit=sak.begin();\n\t\ts1=*it;\n\t\tsak.erase(it);\n\t\tit=sak.end();\n\t\tit--;\n\t\ts2=*it;\n\t\tsak.erase(it);\n\t\ts1=s1+s2;\n\t\tsak.insert(s1);\n\t}\n\ts1=*sak.begin();\n\tcout<<s1<<endl;\n\treturn 0;\n}\n", "#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acos(-1.0);\n\nll mod_pow(ll x, ll n) {\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % mod;\n\t\tx = x * x % mod; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, int n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nconst int max_n = 1 << 20;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\nvector<int> calc(vector<int> c) {\n\tif (c.size() == 1) {\n\t\tvector<int> res(c[0], 0);\n\t\treturn res;\n\t}\n\tint d = c[0];\n\tint sum = 0;\n\tfor (int i = 1; i < c.size(); i++) {\n\t\tsum += c[i];\n\t}\n\td = min(d, sum);\n\tint num = c[0] / d;\n\tint r = c[0] % d;\n\tvector<vector<int>> anss(d);\n\trep(i, d) {\n\t\tanss[i].resize(num, 0);\n\t\tif (i < r)anss[i].push_back(0);\n\t}\n\tint loc = 1;\n\tif (r > 0) {\n\t\tRep(i, r, d) {\n\t\t\tif (c[loc] == 0)loc++;\n\t\t\tanss[i].push_back(loc); c[loc]--;\n\t\t}\n\t}\n\tint las = r; if (r == 0)las = d;\n\tqueue<int> q;\n\tfor (int i = (int)c.size() - 1; i >= loc;i--) {\n\t\trep(j, c[i])q.push(i);\n\t}\n\twhile (!q.empty()) {\n\t\tper(i, las) {\n\t\t\tif (q.size()) {\n\t\t\t\tanss[i].push_back(q.front()); q.pop();\n\t\t\t}\n\t\t}\n\t\tint cnt = 1;\n\t\twhile (cnt < las && anss[cnt] == anss[cnt - 1])cnt++;\n\t\t\n\t\tlas = cnt;\n\t}\n\tsort(all(anss));\n\tvector<vector<int>> rec;\n\tvector<int> nc;\n\trep(i, anss.size()) {\n\t\tint le = i;\n\t\twhile (i + 1 < anss.size() && anss[i] == anss[i + 1]) {\n\t\t\ti++;\n\t\t}\n\t\tnc.push_back(i - le + 1);\n\t\trec.push_back(anss[i]);\n\t}\n\tvector<int> ord = calc(nc);\n\n\tvector<int> res;\n\tfor (int id : ord)for (int x : rec[id])res.push_back(x);\n\treturn res;\n}\nvoid solve() {\n\tint c[3];\n\trep(i, 3)cin >> c[i];\n\n\tvector<char> ts;\n\tvector<int> cs;\n\trep(i, 3)if (c[i] > 0) {\n\t\tts.push_back('a' + i);\n\t\tcs.push_back(c[i]);\n\t}\n\tvector<int> nums = calc(cs);\n\tstring ans;\n\tfor (int id : nums)ans.push_back(ts[id]);\n\tcout << ans << \"\\n\";\n}\n\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint x, y, z;\npair<int, int> ans;\nstring a, b, c;\n\nvoid calc(int x, int y, int z) {\n\tif (x == 0 && z == 0) {\n\t\tans.first = 2, ans.second = y;\n\t\treturn ;\n\t}\n\tif (x == 0 && y == 0) {\n\t\tans.first = 3, ans.second = z;\n\t\treturn ;\n\t}\n\tif (y == 0 && z == 0) {\n\t\tans.first = 1, ans.second = x;\n\t\treturn ;\n\t}\n\tif (x <= z) {\n\t\tfor (auto it : c) a.push_back(it);\n\t\tcalc(x, y, z - x);\n\t}\n\telse {\n\t\tstring tmp = c;\n\t\tc = b;\n\t\tb.clear();\n\t\tfor (auto it : a) b.push_back(it);\n\t\tfor (auto it : tmp) b.push_back(it);\n\t\tcalc(x - z, z, y);\n\t}\n}\n\nint main() {\n//\tfreopen(\"in.txt\", \"r\", stdin);\n//\tfreopen(\"out.txt\", \"w\", stdout);\n\tios::sync_with_stdio(0);\n\tcin.tie(0), cout.tie(0);\n\tcin >> x >> y >> z;\n\t\tif (x == 0) {\n\t\t\tx = y, y = z, z = 0;\n\t\t\ta.push_back('b'); b.push_back('c'); c.push_back('a');\n\t\t}\n\t\telse a.push_back('a'), b.push_back('b'), c.push_back('c');\n\t\tcalc(x, y, z);\n\t\tfor (int i = 0; i < ans.second; i++) {\n\t\t\tif (ans.first == 1) cout << a;\n\t\t\telse if (ans.first == 2) cout << b;\n\t\t\telse cout << c;\n\t\t}\n\t\tcout << '\\n';\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n\nstring solve(int x, int y, int z){\n //cout << x << \" \" << y << \" \" << z << endl;\n if(y == 0 && z == 0){\n string ans;\n for(int i = 0; i < x; i++) ans += 'a';\n return ans;\n }\n if(x == 0){\n string str = solve(y,z,0);\n for(int i = 0; i < str.size(); i++) str[i]++;\n return str;\n }\n if(z == 0){\n string str = solve(x, 0, y);\n for(int i = 0; i < str.size(); i++){\n if(str[i] == 'c') str[i] = 'b';\n }\n return str;\n }\n if(z >= x){\n string str = solve(x, y, z-x);\n string ans;\n for(int i = 0; i < str.size(); i++){\n if(str[i] == 'a'){\n ans += 'a';\n ans += 'c';\n } else {\n ans += str[i];\n }\n }\n return ans;\n }\n if(x > z){\n string str = solve(x-z, z, y);\n string ans;\n for(int i = 0; i < str.size(); i++){\n if(str[i] == 'a'){\n ans += 'a';\n } else if(str[i] == 'b'){\n ans += 'a';\n ans += 'c';\n } else if(str[i] == 'c'){\n ans += 'b';\n }\n }\n return ans;\n }\n}\nint main(){\n int x, y, z;\n cin >> x >> y >> z;\n cout << solve(x,y,z);\n /*for(int i = 0; i < 5; i++){\n for(int j = 0; j < 5; j++){\n for(int k = 0; k < 5; k++){\n cout << i << \" \" << j << \" \" << k << \" \" << solve(i,j,k) << endl;\n }\n }\n }*/\n}\n", "#include <bits/stdc++.h>\n#define rep(i, x, y) for (int i = x; i <= y; i++)\nusing namespace std;\n\nint x, y, z;\nmultiset<string> s;\n\nint main() {\n cin >> x >> y >> z;\n rep(i, 1, x) s.insert(\"a\");\n rep(i, 1, y) s.insert(\"b\");\n rep(i, 1, z) s.insert(\"c\");\n while (s.size() > 1) {\n string ss = *s.begin() + *--s.end();\n s.erase(s.begin());\n s.erase(--s.end());\n s.insert(ss);\n }\n cout << *s.begin() << endl;\n return 0;\n}\n", "#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <string>\n#include <set>\nusing namespace std;\n\nmultiset<string> S;\nmultiset<string>::iterator itL, itR;\nint X, Y, Z;\n\nint main() {\n\tscanf(\"%d%d%d\", &X, &Y, &Z);\n\twhile(X--) S.insert(\"a\");\n\twhile(Y--) S.insert(\"b\");\n\twhile(Z--) S.insert(\"c\");\n\twhile(S.size() > 1) {\n\t\titL = S.begin();\n\t\titR = S.end(); itR--;\n\t\tS.insert((*itL) + (*itR));\n\t\tS.erase(itL); S.erase(itR);\n\t}\n\tprintf(\"%s\", S.begin()->c_str());\n}", "#include <set>\n#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nmultiset <string> s;\n\nint main()\n{\n\tint X,Y,Z;\n\tscanf(\"%d%d%d\",&X,&Y,&Z);\n\tfor(int i = 1;i <= X; ++ i)\n\t\ts.insert(\"a\");\n\tfor(int i = 1;i <= Y; ++ i)\n\t\ts.insert(\"b\");\n\tfor(int i = 1;i <= Z; ++ i)\n\t\ts.insert(\"c\");\n\tmultiset <string>::iterator it;\n\tit = s.end();\n\tit--;\n\twhile(s.size() > 1)\n\t{\n\t\tit = s.begin();\n\t\tstring a = *it;\n\t\ts.erase(it);\n\t\tit = s.end();\n\t\tit--;\n\t\tstring b = *it;\n\t\ts.erase(it);\n\t\tstring c = a + b;\n\t\ts.insert(c);\n\t}\n\tcout<<*s.begin()<<endl;\n } ", "#include <stdio.h> \n#include <algorithm> \n#include <assert.h>\n#include <bitset>\n#include <cmath> \n#include <complex> \n#include <deque> \n#include <functional> \n#include <iostream> \n#include <limits.h> \n#include <map> \n#include <math.h> \n#include <queue> \n#include <set> \n#include <stdlib.h> \n#include <string.h> \n#include <string> \n#include <time.h> \n#include <unordered_map> \n#include <unordered_set> \n#include <vector>\n\nusing namespace std;\n\ntypedef tuple<int, int, int> t3;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef double db;\ntypedef long double ldb;\ntypedef pair <int, int> pii;\ntypedef pair <ll, ll> pll;\ntypedef pair <ll, int> pli;\ntypedef pair <db, db> pdd;\n\nconst db PI = acos(-1);\nconst db ERR = 1e-12;\n\nconst int MX = 2005;\nconst int MM = 1000000007;\n\nint main()\n{\n\tint A, B, C;\n\tmultiset<string> L;\n\tscanf(\"%d%d%d\", &A, &B, &C);\n\tfor(int i = 1; i <= A; i++) L.insert((string)\"a\");\n\tfor(int i = 1; i <= B; i++) L.insert((string)\"b\");\n\tfor(int i = 1; i <= C; i++) L.insert((string)\"c\");\n\n\twhile(L.size() > 1){\n\t\tstring P = *L.begin();\n\t\twhile(*L.begin() == P){\n\t\t\tL.erase(L.begin());\n\t\t\tauto it = L.end(); --it;\n\t\t\tstring tmp = P + *it;\n\t\t\tL.erase(it);\n\t\t\tL.insert(tmp);\n\t\t}\n\t}\n\tcout << *L.begin() << \"\\n\";\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nmultiset<string > s;\nint a,b,c;\nint main()\n{\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\twhile (a--)s.insert(\"a\");\n\twhile (b--)s.insert(\"b\");\n\twhile (c--)s.insert(\"c\");\n\twhile (s.size()>1)\n\t {\n\t \tstring t=*s.begin()+ *--s.end();\n\t \ts.erase(s.begin());\n\t \ts.erase(--s.end());\n\t \ts.insert(t);\n\t }\n\tcout<<*s.begin();\n\treturn 0; \n}", "#include <cstdio>\n#include <set>\n#include <iostream>\n\nusing std::string;\n\nstd::multiset<string> s;\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n for(int i = 1; i <= n; i++) {\n s.insert(\"a\");\n }\n scanf(\"%d\", &n);\n for(int i = 1; i <= n; i++) {\n s.insert(\"b\");\n }\n scanf(\"%d\", &n);\n for(int i = 1; i <= n; i++) {\n s.insert(\"c\");\n }\n while(s.size() > 1) {\n string a = *s.begin();\n string b = *(--s.end());\n s.erase(s.begin());\n s.erase(--s.end());\n s.insert((string)(a + b));\n }\n std::cout << *s.begin();\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nmultiset <string> s;\nint x,y,z;\nint main(){\n\tcin>>x>>y>>z;\n\twhile(x--)s.insert(\"a\");\n\twhile(y--)s.insert(\"b\");\n\twhile(z--)s.insert(\"c\");\n\twhile(s.size()>1){\n\t\tstring a=*s.begin();\n\t\tstring b=*s.rbegin();\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(a+b);\n\t}\n\tcout<<*s.begin()<<endl;\n}", "#include<iostream>\n#include<algorithm>\nusing namespace std;\nconst int maxn=200+2;\nint tmp,cnt;\nstring str[maxn];\nint main(){\n\tfor (char ch='a';ch<='c';ch++){\n\t\tcin>>tmp;\n\t\twhile (tmp--) str[cnt++]+=ch;\n\t}\n\twhile (cnt>1){\n\t\tsort(str,str+cnt);\n\t\tstr[0]+=str[--cnt];\n\t}\n\tcout<<str[0];\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nmultiset<string> s;\nint x,y,z;\nint main()\n{\n cin>>x>>y>>z;\n for(int i=1;i<=x;i++) s.insert(\"a\");\n for(int i=1;i<=y;i++) s.insert(\"b\");\n for(int i=1;i<=z;i++) s.insert(\"c\");\n while(s.size()>1)\n {\n string t=*s.begin()+*--s.end();\n s.erase(s.begin());\n s.erase(--s.end());\n s.insert(t);\n }\n cout<<*s.begin();\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint r,b,g;\nmultiset<string> st;\nint main() \n{\n//\tfreopen(\"beargguy.in\",\"r\",stdin);\n//\tfreopen(\"beargguy.out\",\"w\",stdout);\n\tscanf(\"%d%d%d\",&r,&b,&g); \n for(int i=1;i<=r;i++) st.insert(\"a\");\n for(int i=1;i<=b;i++) st.insert(\"b\");\n for(int i=1;i<=g;i++) st.insert(\"c\");\n while(st.size()>1) \n\t{\n string s=*st.begin(),t=*st.rbegin();\n st.erase(st.lower_bound(s));\n st.erase(st.lower_bound(t));\n st.insert(s+t);\n }\n puts((*st.begin()).c_str());\n return 0;\n} ", "#include<set>\n#include<cstdio>\n#include<cctype>\n#include<string>\ninline int getint() {\n register char ch;\n while(!isdigit(ch=getchar()));\n register int x=ch^'0';\n while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');\n return x;\n}\nint main() {\n std::multiset<std::string> set;\n for(register int i=getint();i;i--) set.insert(\"a\");\n for(register int i=getint();i;i--) set.insert(\"b\");\n for(register int i=getint();i;i--) set.insert(\"c\");\n while(set.size()>1) {\n std::string s=*set.begin(),t=*set.rbegin();\n set.erase(set.lower_bound(s));\n set.erase(set.lower_bound(t));\n set.insert(s+t);\n }\n printf(\"%s\\n\",(*set.begin()).c_str());\n return 0;\n} ", "#include<bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chkmax(T& a,T b){return a<b?a=b,1:0;}\ntemplate<class T> inline bool chkmin(T& a,T b){return a>b?a=b,1:0;}\ntemplate<typename T> inline T& read(T& x){\n static char c; bool flag=0;\n while(!isdigit(c=getchar())) if(c=='-') flag=1;\n for(x=c-'0';isdigit(c=getchar());(x*=10)+=c-'0');\n if(flag) x=-x;\n return x;\n}\nint x,y,z;\nmultiset<string> s;\nint main(){\n#ifdef xffyjq\n freopen(\"exec.in\",\"r\",stdin);\n freopen(\"exec.out\",\"w\",stdout);\n#endif\n read(x); read(y); read(z);\n for(int i=1;i<=x;i++) s.insert(\"a\");\n for(int i=1;i<=y;i++) s.insert(\"b\");\n for(int i=1;i<=z;i++) s.insert(\"c\");\n for(int i=1;i<x+y+z;i++){\n auto it1=s.begin(),it2=s.end(); --it2;\n s.insert(*it1+*it2);\n s.erase(it1); s.erase(it2);\n }\n cout<<*s.begin()<<endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nmultiset<string>s;\nint main(){\n scanf(\"%d%d%d\",&a,&b,&c);\n for(int i=1;i<=a;++i)s.insert(\"a\");\n for(int i=1;i<=b;++i)s.insert(\"b\");\n for(int i=1;i<=c;++i)s.insert(\"c\");\n while(s.size()>1){\n string ss=*s.begin()+*--s.end();\n s.erase(s.begin());\n s.erase(--s.end());\n s.insert(ss);\n }\n cout<<*s.begin();\n return 0;\n}", "#include <bits/stdc++.h>\n\n#define up(i,j,k) for (int i = (j); i <= (k); i++)\n#define down(i,j,k) for (int i = (j); i >= (k); i--)\n#define DEBUG printf(\"Passing [%s] in LINE %d\\n\", __FUNCTION__, __LINE__)\n\n#define lb long double\n#define ll long long\n#define ull unsigned long long\n\n#define mp std::make_pair\n#define pb push_back\n\n#define all(x) (x).begin(), (x).end()\n#define mem(a) memset((a), 0, sizeof(a))\n#define File(x) \\\n freopen(\"\" #x \".in\", \"r\", stdin); \\\n freopen(\"\" #x \".out\", \"w\", stdout);\n\n#define int long long\n\ninline int read() {\n int data = 0, w = 1; char ch = 0;\n while (ch != '-' && (ch > '9' || ch < '0')) ch = getchar();\n if (ch == '-') w = -1, ch = getchar();\n while (ch >= '0' && ch <= '9') { data = data * 10 + ch - '0'; ch = getchar(); }\n return data * w;\n}\n\ninline void print (int v) {\n if (v < 0) { putchar('-'); v = -v; }\n if (v > 9) print(v / 10);\n putchar(v % 10 + '0');\n}\n\nstd::multiset <std::string> s;\n\nsigned main () {\n int x, y, z;\n x = read(); y = read(); z = read();\n up (i, 1, x) s.insert(\"a\");\n up (i, 1, y) s.insert(\"b\");\n up (i, 1, z) s.insert(\"c\");\n while (s.size() ^ 1) {\n auto l = *s.begin(), r = *s.rbegin();\n s.erase(s.lower_bound(l));\n s.erase(s.lower_bound(r));\n s.insert(l + r);\n }\n std::cout << *s.begin();\n return 0;\n}", "a,b,c = map(int,input().split())\n\nL = [[0] for _ in range(a)] + [[1] for _ in range(b)] + [[2] for _ in range(c)]\nwhile len(L) > 1:\n L[0] += L.pop()\n L.sort()\nprint(''.join(('a','b','c')[i] for i in L[0]))", "#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint X, Y, Z, n;\nint D[51][51][51][51], LCP[51], oto[51];\nchar p[60], q[110];\nbool Pos(int pv){\n int i, j, k, l;\n for(i=1;i<=pv;i++){\n for(j=0;j<=pv-i;j++){\n if(p[j]!=p[i+j]){\n if(p[j] > p[i+j])return false;\n else break;\n }\n }\n }\n oto[0] = -1;\n for(i=0;i<=pv;i++){\n int t = oto[i];\n while(t!=-1 && p[i]!=p[t])t=oto[t];\n oto[i+1] = t+1;\n }\n int tt = oto[pv+1];\n for(i=pv+1;i<n;i++){\n p[i] = p[tt];\n tt++;\n oto[i+1]=oto[i]+1;\n }\n LCP[0] = 0;\n for(i=1;i<=pv;i++){\n if(p[LCP[i-1]] > p[i])return false;\n int t = LCP[i-1];\n while(t!=-1 && p[t]!=p[i])t = oto[t];\n LCP[i] = t+1;\n }\n int c1 = 0, c2 = 0, c3 = 0;\n for(i=0;i<=pv;i++){\n if(p[i]=='a')c1++;\n if(p[i]=='b')c2++;\n if(p[i]=='c')c3++;\n }\n for(i=0;i<=X;i++)for(j=0;j<=Y;j++)for(k=0;k<=Z;k++)for(l=0;l<=n;l++)D[i][j][k][l]=0;\n D[c1][c2][c3][pv+1] = 1;\n //printf(\"%s\\n\",p);\n for(i=c1;i<=X;i++){\n for(j=c2;j<=Y;j++){\n for(k=c3;k<=Z;k++){\n for(l=0;l<=n;l++){\n if(!D[i][j][k][l])continue;\n //printf(\"%d %d %d %d\\n\",i,j,k,l);\n int tp = l;\n if(i!=X && p[tp] <= 'a'){\n int t = tp;\n while(t!=-1 && p[t]!='a')t = oto[t];\n D[i+1][j][k][t+1] = 1;\n }\n if(j!=Y && p[tp] <= 'b'){\n int t = tp;\n while(t!=-1 && p[t]!='b')t = oto[t];\n D[i][j+1][k][t+1] = 1;\n }\n if(k!=Z && p[tp] <= 'c'){\n int t = tp;\n while(t!=-1 && p[t]!='c')t = oto[t];\n D[i][j][k+1][t+1] = 1;\n }\n }\n }\n }\n }\n for(i=0;i<=n;i++){\n if(!D[X][Y][Z][i])continue;\n //printf(\"%d\\n\",i);\n for(j=0;j<i;j++)q[j] = p[j];\n for(j=0;j<n;j++)q[i+j] = p[j];\n int ck = 0;\n for(j=0;j<=i;j++){\n for(k=0;k<n;k++){\n if(p[k]!=q[j+k]){\n if(p[k] > q[j+k])ck = 1;\n else break;\n }\n }\n }\n if(!ck){\n return true;\n }\n }\n return false;\n}\nint main(){\n int i, j, c1 = 0, c2 = 0, c3 = 0;\n scanf(\"%d%d%d\",&X,&Y,&Z);\n n = X+Y+Z;\n for(i=0;i<n;i++){\n p[i] = 'c';\n c3++;\n if(c3 <= Z && Pos(i)){\n if(i!=0 || (!X&&!Y))continue;\n }\n c3--,c2++;\n p[i] = 'b';\n if(c2 <= Y && Pos(i)){\n if(i!=0 || !X)continue;\n }\n c2--,c1++;\n p[i] = 'a';\n }\n printf(\"%s\\n\",p);\n}", "#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx\")\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\n\n#define forn(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)\n#define ford(i, a, n) for (int i = (int)(n - 1); i >= (int)(a); --i)\n#define fore(i, a, n) for (int i = (int)(a); i <= (int)(n); ++i)\n#define all(a) (a).begin(), (a).end()\n#define fs first\n#define sn second\n#define trace(a)\\\n for (auto i : a) cerr << i << ' ';\\\n cerr << '\\n'\n#define eb emplace_back\n\n#ifndef M_PI\nconst ld M_PI = acos(-1.0);\n#endif\n\ntemplate<typename T>\ninline void setmax(T& a, T b) {\n if (a < b) a = b;\n}\n\ntemplate<typename T>\ninline void setmin(T& a, T b) {\n if (a > b) a = b;\n}\n\nconst ld eps = 1e-9;\nconst int INF = 2000000000;\nconst ll LINF = 1ll * INF * INF;\nconst ll MOD = 1000000007;\nstring min_cyclic_shift (string s) {\n s += s;\n int n = (int) s.length();\n int i=0, ans=0;\n while (i < n/2) {\n ans = i;\n int j=i+1, k=i;\n while (j < n && s[k] <= s[j]) {\n if (s[k] < s[j])\n k = i;\n else\n ++k;\n ++j;\n }\n while (i <= k) i += j - k;\n }\n return s.substr (ans, n/2);\n}\n\nvector<string> gen(int x, int y, int z) {\n if (x == 0 && y == 0 && z == 0) {\n return {\"\"};\n }\n vector<string> ans;\n if (x) for (string s : gen(x - 1, y, z))\n ans.eb(s + \"a\");\n if (y) for (string s : gen(x, y - 1, z))\n ans.eb(s + \"b\");\n if (z) for (string s : gen(x, y, z - 1))\n ans.eb(s + \"c\");\n return ans;\n}\n\nstring brute(int x, int y, int z) {\n vector<string> ss = gen(x, y, z);\n string ans = min_cyclic_shift(ss[0]);\n for (string s : ss)\n setmax(ans, min_cyclic_shift(s));\n return ans;\n}\n\nconst int N = 52;\n//string glob[N][N][N];\n\nstring solve(int x, int y, int z) {\n if (x + y + z <= 4) return brute(x, y, z);\n //cerr << \"SOLVE: \" << x << ' ' << y << ' ' << z << '\\n';\n //if (!glob[x][y][z].empty()) return glob[x][y][z];\n if (y == 0 && z == 0) {\n string ans;\n forn(i, 0, x) ans += \"a\";\n return ans;\n //forn(i, 0, x) glob[x][y][z] += \"a\";\n //return glob[x][y][z];\n }\n if (x == 0) {\n string s = solve(y, z, 0);\n for (char& c : s) ++c;\n //glob[x][y][z] = s;\n return s;\n }\n if (y == 0) {\n string s = solve(x, z, 0);\n for (char& c : s) if (c == 'b') c = 'c';\n //glob[x][y][z] = s;\n return s;\n }\n vector<string> lets(3);\n lets[0] = \"a\";\n while (z >= x) {\n lets[0] += \"c\";\n z -= x;\n }\n string ans, s;\n if (z + y >= x) {\n lets[1] = lets[0];\n lets[0] += \"b\";\n lets[1] += \"c\";\n lets[2] = \"b\";\n x -= z;\n y -= x;\n s = solve(x, z, y);\n } else {\n lets[1] = lets[0];\n lets[2] = lets[0];\n lets[1] += \"b\";\n lets[2] += \"c\";\n s = solve(x - y - z, y, z);\n }\n for (char c : s) ans += lets[c - 'a'];\n //glob[x][y][z] = ans;\n return ans;\n}\n\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0); \n srand((unsigned)chrono::high_resolution_clock::now().time_since_epoch().count());\n int x, y, z;\n cin >> x >> y >> z;\n cout << solve(x, y, z) << '\\n';\n /*\n forn(x, 0, 6) forn(y, 0, 6) forn(z, 0, 6) {\n string s1 = solve(x, y, z), s2 = brute(x, y, z);\n if (s1 != s2) {\n cout << \"ERROR!: \" << x << ' ' << y << ' ' << z << '\\n';\n cout << s1 << ' ' << s2 << '\\n';\n return 0;\n }\n }*/\n //int x = 4, y = 2, z = 3;\n //cout << solve(x, y, z) << '\\n';\n}\n", "/* Stay hungry, stay foolish. */\n/* Copyright by HenryLi */\n#include<iostream>\n#include<algorithm>\n#include<queue>\n#include<string>\n#include<map>\n#include<vector>\n#include<set>\n#include<sstream>\n#include<stack>\n#include<ctime>\n#include<cmath>\n#include<cctype>\n#include<climits>\n#include<cstring>\n#include<cstdio>\n#include<cstdlib>\n#include<iomanip>\n#include<bitset>\n#include<complex>\nusing namespace std;\ntemplate <class _T> inline void read(_T &_x) {\n\tint _t; bool _flag=false;\n\twhile((_t=getchar())!='-'&&(_t<'0'||_t>'9')) ;\n\tif(_t=='-') _flag=true,_t=getchar(); _x=_t-'0';\n\twhile((_t=getchar())>='0'&&_t<='9') _x=_x*10+_t-'0';\n\tif(_flag) _x=-_x;\n}\ntypedef long long LL;\nint main() {\n\t//freopen(\"fuck.in\",\"r\",stdin);\n\t//freopen(\"fuck.out\",\"w\",stdout);\n\tmultiset<string> s;\n\tint a, b, c;\n\tread(a), read(b), read(c);\n\tfor (int i = 1; i <= a; ++i) s.insert(\"a\");\n\tfor (int i = 1; i <= b; ++i) s.insert(\"b\");\n\tfor (int i = 1; i <= c; ++i) s.insert(\"c\");\n\twhile (s.size() > 1) {\n\t\tstring t = *s.begin() + *--s.end();\n\t\ts.erase(s.begin()), s.erase(--s.end());\n\t\ts.insert(t);\n\t}\n\tcout << *s.begin() << endl;\n\treturn 0;\n}\n", "// package other2017.codefestival2017.qualb;\n\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int x = in.nextInt();\n int y = in.nextInt();\n int z = in.nextInt();\n int n = x + y + z;\n\n String ans = \"\";\n for (int i = 0; i < n ; i++) {\n if (z >= 1 && isOK(ans + \"c\", x, y, z-1)) {\n z--;\n ans += \"c\";\n } else if (y >= 1 && isOK(ans + \"b\", x, y-1, z)) {\n y--;\n ans += \"b\";\n } else {\n x--;\n ans += \"a\";\n }\n }\n out.println(ans);\n out.flush();\n }\n\n static boolean isOK(String prefix, int x, int y, int z) {\n int prefixState = 0;\n for (int i = 1 ; i< prefix.length() ; i++) {\n String l = prefix.substring(i, prefix.length());\n if (prefix.startsWith(l)) {\n prefixState = Math.max(prefixState, l.length());\n } else {\n if (l.compareTo(prefix) < 0) {\n // muri\n return false;\n }\n }\n }\n\n int n = prefix.length();\n int[][] stateTable = new int[n][3];\n for (int i = 0; i < n ; i++) {\n for (int j = 0; j < 3 ; j++) {\n String s = prefix.substring(0, i) + (char)('a' + j);\n if (prefix.startsWith(s)) {\n stateTable[i][j] = (s.length() == n) ? 0 : s.length();\n } else if (s.compareTo(prefix) < 0) {\n stateTable[i][j] = -1;\n } else {\n stateTable[i][j] = 0;\n }\n }\n }\n\n int L = x+y+z;\n int[][][][] dp = new int[L+1][y+1][z+1][n+1];\n dp[L][y][z][prefixState] = 1;\n for (int i = L ; i >= 1 ; i--) {\n for (int b = 0 ; b <= y ; b++) {\n for (int c = 0 ; c <= z ; c++) {\n int a = i-b-c;\n int[] left = {a, b, c};\n for (int s = 0 ; s <= n ; s++) {\n if (dp[i][b][c][s] == 0) {\n continue;\n }\n for (int u = 0 ; u <= 2 ; u++) {\n if (stateTable[s][u] == -1 || left[u] == 0) {\n continue;\n }\n dp[i-1][b-((u==1)?1:0)][c-((u==2)?1:0)][stateTable[s][u]] = 1;\n }\n }\n }\n }\n }\n\n for (int i = 0 ; i <= n ; i++) {\n String pref = prefix.substring(0, i) + prefix;\n if ((i == 0 || pref.compareTo(prefix) > 0) && dp[0][0][0][i] == 1) {\n return true;\n }\n }\n return false;\n }\n\n public static void debug(Object... o) {\n System.err.println(Arrays.deepToString(o));\n }\n\n public static class InputReader {\n private static final int BUFFER_LENGTH = 1 << 12;\n private InputStream stream;\n private byte[] buf = new byte[BUFFER_LENGTH];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n private int next() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public char nextChar() {\n return (char) skipWhileSpace();\n }\n\n public String nextToken() {\n int c = skipWhileSpace();\n StringBuilder res = new StringBuilder();\n do {\n res.append((char) c);\n c = next();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public long nextLong() {\n int c = skipWhileSpace();\n long sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = next();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = next();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n return Double.valueOf(nextToken());\n }\n\n int skipWhileSpace() {\n int c = next();\n while (isSpaceChar(c)) {\n c = next();\n }\n return c;\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n }\n}", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <set>\ntemplate<typename T> inline void read(T &x) { \n x = 0; char c = getchar(); bool flag = false;\n while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }\n while (isdigit(c)) { x = (x << 1 ) + (x << 3) + (c ^ 48); c = getchar(); }\n if (flag) x = -x; \n}\nusing namespace std;\nmultiset<string> st; \nint main() {\n int A, B, C; read(A), read(B), read(C);\n while (A) st.insert(\"a\"), --A;\n while (B) st.insert(\"b\"), --B;\n while (C) st.insert(\"c\"), --C;\n while (st.size() != 1) {\n string smal = *(st.begin()), larg = *(--st.end());\n st.erase(st.find(smal)); st.erase(st.find(larg));\n st.insert(smal + larg);\n }\n cout << *st.begin() << endl;\n return 0;\n}\n", "#include<cstdio>\n#include<iostream>\n#include<algorithm>\n#include<cstring>\n#include<set>\nusing namespace std;\nint x,y,z;\nmultiset<string> s;\nint main(){\n\tscanf(\"%d %d %d\",&x,&y,&z);\n\tfor(int i=1;i<=x;i++) s.insert(\"a\");\n\tfor(int i=1;i<=y;i++) s.insert(\"b\");\n\tfor(int i=1;i<=z;i++) s.insert(\"c\");\n\tmultiset<string>::iterator it;\n\twhile(s.size()>1){\n\t\tit=s.begin(); string s1=*it;\n\t\ts.erase(it);\n\t\tit=s.end(); it--; string s2=*it;\n\t\ts.erase(it);\n\t\ts.insert(s1+s2);\n\t}\n\tit=s.begin();\n\tcout<<*it<<endl;\n\treturn 0;\n}", "#include<stdio.h>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<iostream>\nusing namespace std;\nstring get(int a, int b, int c)\n{\n\tstring s;\n\tif (b == 0 && c == 0)\n\t{\n\t\tfor (int i = 0; i < a; i++)s.push_back('a');\n\t\treturn s;\n\t}\n\tif (a == 0)\n\t{\n\t\ts = get(b, c, 0);\n\t\tfor (int i = 0; i < s.size(); i++)s[i]++;\n\t\treturn s;\n\t}\n\tstring sa, sb, sc;\n\tif (c%a == 0)\n\t{\n\t\ts = get(0, a - b%a, b%a);\n\t\tsb.push_back('a');\n\t\tfor (int i = 0; i < c / a; i++)sb.push_back('c');\n\t\tfor (int i = 0; i < b / a; i++)sb.push_back('b');\n\t\tsc = sb;\n\t\tsc.push_back('b');\n\t}\n\telse\n\t{\n\t\ts = get(a - c%a - b % (a - c%a), b % (a - c%a), c%a);\n\t\tsa.push_back('a');\n\t\tfor (int i = 0; i < c / a; i++)sa.push_back('c');\n\t\tsc = sa;\n\t\tsc.push_back('c');\n\t\tfor (int i = 0; i < b / (a - c%a); i++)sa.push_back('b');\n\t\tsb = sa;\n\t\tsb.push_back('b');\n\t}\n\tstring r;\n\tfor (int i = 0; i < s.size(); i++)\n\t{\n\t\tif (s[i] == 'a')r += sa;\n\t\tif (s[i] == 'b')r += sb;\n\t\tif (s[i] == 'c')r += sc;\n\t}\n\treturn r;\n}\nint main()\n{\n\tint a, b, c;\n\tscanf(\"%d%d%d\", &a, &b, &c);\n\tcout << get(a, b, c) << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nstring s[233];\nint t,n;\nint main(){\n\tfor (char c='a';c<='c';c++)\n\t\tfor (cin>>t;t--;) s[n++]+=c;\n\tfor (;n>1;){\n\t\tsort(s,s+n);\n\t\ts[0]+=s[--n];\n\t}\n\tcout<<s[0];\n}", "#include <set>\n#include <string>\n#include <iostream>\n\nint X,Y,Z;\nstd::multiset<std::string> s;\n\nint main()\n{\n std::ios::sync_with_stdio(false);\n std::cin.tie(0),std::cout.tie(0);\n std::cin>>X>>Y>>Z;\n while(X--)s.insert(std::string(\"a\"));\n while(Y--)s.insert(std::string(\"b\"));\n while(Z--)s.insert(std::string(\"c\"));\n while((int)s.size()>1)\n {\n std::string s1=*s.begin(),s2=*--s.end();\n s.erase(s.begin()),s.erase(--s.end());\n s.insert(s1+s2);\n }\n std::cout<<*s.begin()<<std::endl;\n return 0;\n}", "#include<cstdio>\n#include<cstring>\n#include<set>\nusing namespace std;\nint a,b,c;\nchar s[155][155];\nstruct str\n{\n\tint ID;\n\tbool friend operator < (str a,str b)\n\t{\n\t\treturn strcmp(s[a.ID],s[b.ID])<0;\n\t}\n}t1,t2;\nmultiset<str> m;\nmultiset<str>::iterator it;\nint main()\n{\n scanf(\"%d%d%d\",&a,&b,&c);\n int cnt=0;\n\twhile(a--) s[++cnt][0]='a',m.insert((str){cnt});\n\twhile(b--) s[++cnt][0]='b',m.insert((str){cnt});\n\twhile(c--) s[++cnt][0]='c',m.insert((str){cnt});\n\twhile(m.size()>1)\n\t{\n\t\tit=m.begin();t1=*it;m.erase(it);\n\t\tit=m.end();it--;t2=*it;m.erase(it);\n\t\tstrcat(s[t1.ID],s[t2.ID]);\n\t\tm.insert((str){t1.ID});\n\t}\n\tit=m.begin();\n\tt1=*it;\n\tprintf(\"%s\\n\",s[t1.ID]);\n return 0;\n}\n", "//Wrong answer on test inf.\n#include<bits/stdc++.h>\n#define rep(i,x,y) for (int i=(x);i<=(y);i++)\n#define ll long long\n#define inf 1000000001\n#define y1 y1___\nusing namespace std;\nll read(){\n\tchar ch=getchar();ll x=0;int op=1;\n\tfor (;!isdigit(ch);ch=getchar()) if (ch=='-') op=-1;\n\tfor (;isdigit(ch);ch=getchar()) x=(x<<1)+(x<<3)+ch-'0';\n\treturn x*op;\n}\n#define N 55\nint x,y,z;\nmultiset<string> s;\nint main(){\n\tcin>>x>>y>>z;\n\trep (i,1,x) s.insert(\"a\");\n\trep (i,1,y) s.insert(\"b\");\n\trep (i,1,z) s.insert(\"c\");\n\twhile ((int)s.size()>1){\n\t\tstring tmp=*s.begin()+*--s.end();\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(tmp);\n\t}\n\tcout<<*s.begin()<<'\\n';\n\treturn 0;\n}", "#include <algorithm> \n#include <iostream> \n#include <sstream> \n#include <string> \n#include <cstring>\n#include <vector> \n#include <queue> \n#include <set> \n#include <map> \n#include <cstdio> \n#include <cstdlib> \n#include <cctype> \n#include <cmath> \n#include <list> \n#include <cassert>\n#include <ctime>\n#include <climits>\nusing namespace std; \n\n#define PB push_back \n#define MP make_pair \n#define SZ(v) ((int)(v).size()) \n#define FOR(i,a,b) for(int i=(a);i<(b);++i) \n#define REP(i,n) FOR(i,0,n) \n#define FORE(i,a,b) for(int i=(a);i<=(b);++i) \n#define REPE(i,n) FORE(i,0,n) \n#define FORSZ(i,a,v) FOR(i,a,SZ(v)) \n#define REPSZ(i,v) REP(i,SZ(v)) \ntypedef long long ll;\ntypedef unsigned long long ull;\nll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b); }\n\nstring solve(int na, int nb, int nc) {\n\tif (na == 0 && nb == 0 && nc == 0) return \"\";\n\tif (na == 0) { string ret = solve(nb, nc, 0); REPSZ(i, ret) ++ret[i]; return ret; }\n\tvector<string> parts;\n\tstring cur = \"a\"; int curcnt = na; na = 0;\n\twhile (na+nb+nc>0) {\n\t\tif (nc >= curcnt) { cur += \"c\"; nc -= curcnt; continue; }\n\t\twhile (nc > 0) parts.PB(cur + \"c\"), --curcnt, --nc;\n\t\tif (nb >= curcnt) { cur += \"b\"; nb -= curcnt; continue; }\n\t\twhile (nb > 0) parts.PB(cur + \"b\"), --curcnt, --nb;\n\t}\n\twhile (SZ(parts) > 0) {\n\t\tint rep = curcnt / SZ(parts), rem = curcnt%SZ(parts); if (rem == 0) --rep, rem = SZ(parts);\n\t\tstring pref; REP(i, rep) pref += cur; string nxt = pref + cur + parts[rem - 1];\n\t\tint nxtcnt = 1; while (nxtcnt < rem&&parts[rem - 1] == parts[rem - 1 - nxtcnt]) ++nxtcnt;\n\t\tvector<string> nparts; FORSZ(i, rem, parts) nparts.PB(pref + parts[i]); REP(i, rem - nxtcnt) nparts.PB(pref + cur + parts[i]);\n\t\tparts = nparts; cur = nxt; curcnt = nxtcnt;\n\t}\n\tstring ret; REP(i, curcnt) ret += cur; return ret;\n}\n\nvoid run() {\n\tint na, nb, nc;\n\tscanf(\"%d%d%d\", &na, &nb, &nc);\n\tstring s = solve(na, nb, nc);\n\tprintf(\"%s\\n\", s.c_str());\n}\n\nstring other(int a,int b,int c) {\n\tmultiset<string> s;\n\twhile (a--) s.insert(\"a\");\n\twhile (b--) s.insert(\"b\");\n\twhile (c--) s.insert(\"c\");\n\twhile ((int)s.size() > 1) {\n\t\tstring t = *s.begin() + *--s.end();\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(t);\n\t}\n\treturn *s.begin();\n}\n\nint main() {\n\trun();\n\treturn 0;\n}\n", "// Copyright (C) 2017 Sayutin Dmitry.\n//\n// This program is free software; you can redistribute it and/or\n// modify it under the terms of the GNU General Public License as\n// published by the Free Software Foundation; version 3\n\n// This program is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU General Public License for more details.\n\n// You should have received a copy of the GNU General Public License\n// along with this program; If not, see <http://www.gnu.org/licenses/>.\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n// solve problem when a != 0.\nstring solve(int a, int b, int c) {\n if (b == 0 and c == 0) {\n // it is clear, that answer is 'aaa...'.\n string res = \"\";\n for (int t = 0; t != a; ++t)\n res += 'a';\n return res;\n }\n\n // lets build our cyclical string.\n // we have (a) parts equal to 'a', and b + c other parts.\n // clearly, resulting cyclical string has substring of num=ceil(a/(b+c)) symbols 'a'.\n // \n // if we want to minimize answer, than we shouldn't make it any larger (since it will be start of the minimal cyclical shift)\n // so we will have parts of length num and num-1.\n int num = (a + (b + c - 1)) / (b + c);\n int cnt_short = num * (b + c) - a; // how much parts of \"num - 1\"\n\n string tmp = \"\";\n for (int i = 0; i != num - 1; ++i)\n tmp += 'a';\n \n vector<string> parts;\n for (int i = 0; i != (b + c - cnt_short); ++i)\n parts.push_back(tmp + 'a'); // put long parts of num \"a\"\n\n for (int i = 0; i != cnt_short; ++i)\n parts.push_back(tmp); // put short parts of (num - 1) \"a\".\n\n // let's distribute B's and C's.\n //\n // We can notice, that minimal cyclical shift will start with num \"a\"s.\n // So it is always better to put C's to \"long\" parts, they are conveniently at the beginning of parts\n // array.\n \n for (int i = 0; i != c; ++i)\n parts[i] += 'c';\n for (int i = 0; i != b; ++i)\n parts[c + i] += 'b';\n\n // Now we want to put all parts together to minimize answer, and we are sure,\n // that the answer will be smaller than possible, if we try to split parts.\n\n // funny thing: there are no more, than 3 different types of parts, because\n // part uniquely defined by whether it has (num) or (num - 1) A's, and whether it has B or C at the end.\n // but it is not possible for types (num, B) and (num - 1, C) to exist together.\n\n // so count number of each and call recursion.\n sort(parts.begin(), parts.end());\n vector<string> cparts = parts;\n cparts.resize(std::unique(cparts.begin(), cparts.end()) - cparts.begin());\n\n while (cparts.size() < 3)\n cparts.push_back(\"\");\n\n assert(cparts.size() == 3);\n string zzans = solve(std::count(parts.begin(), parts.end(), cparts[0]),\n std::count(parts.begin(), parts.end(), cparts[1]),\n std::count(parts.begin(), parts.end(), cparts[2]));\n\n string ans = \"\";\n for (char ch: zzans)\n ans += cparts[ch - 'a'];\n\n return ans;\n}\n\n// Time: T(x, y, z) = (x + y + z) + T(a, b, c), where a + b + c = x.\n// since X in T(x, y, z) is decreasing in recursion, there are O(N) levels and each is O(N) => O(N^2)\n\n// (actually implementation above is O(N^2 log) due to sort, but one can write without it).\n\nint main() {\n int a, b, c;\n cin >> a >> b >> c;\n \n // remap 'a', 'b', 'c' in such way, that\n // num of 'a' is not zeros.\n map<char, char> back;\n if (a == 0 and b == 0) {\n back['a'] = 'c';\n a = c;\n b = 0;\n c = 0;\n } else if (a == 0) {\n back['a'] = 'b';\n back['b'] = 'c';\n a = b;\n b = c;\n c = 0;\n } else {\n back['a'] = 'a';\n back['b'] = 'b';\n back['c'] = 'c';\n }\n\n // solve problem when a != 0.\n string ans = solve(a, b, c);\n for (int i = 0; i != int(ans.size()); ++i)\n cout << back[ans[i]];\n cout << \"\\n\";\n \n return 0;\n}\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint A, B, C;\n\nstring getans(string S) {\n\tint ca = 0, cb = 0, cc = 0;\n\tfor (int i = 0; i < S.size(); i++) {\n\t\tif (S[i] == 'a') ca++;\n\t\tif (S[i] == 'b') cb++;\n\t\tif (S[i] == 'c') cc++;\n\t}\n\tif (cb == 0) return S;\n\n\tvector<string>vec;\n\tfor (int i = 0; i < ca; i++) vec.push_back(\"a\");\n\tfor (int i = 0; i < cc; i++) vec[i%ca] += \"c\";\n\tsort(vec.begin(), vec.end());\n\tint Z = 1;\n\tfor (int i = 1; i < vec.size(); i++) { if (vec[i] == vec[i - 1])Z = i + 1; else break; }\n\tfor (int i = 0; i < cb; i++) vec[i%Z] += \"b\";\n\tsort(vec.begin(), vec.end());\n\t\n\tstring G = \"a\"; int I = 0;\n\tfor (int i = 1; i < vec.size(); i++) {\n\t\tif (vec[i] != vec[i - 1]) I++;\n\t\tG += ('a' + I);\n\t}\n\tvector<string>A = vec; A.erase(unique(A.begin(), A.end()), A.end());\n\tstring V = getans(G), U = \"\";\n\tfor (int i = 0; i < V.size(); i++) { U += A[V[i] - 'a']; }\n\treturn U;\n}\n\nstring F;\n\nint main() {\n\tcin >> A >> B >> C;\n\tif (A >= 1) F += \"a\"; if (B >= 1) F += \"b\"; if (C >= 1) F += \"c\";\n\tint P = 0;\n\twhile (A == 0) { A = B; B = C; C = 0; }\n\twhile (B == 0 && C >= 1) { B = C; C = 0; }\n\n\tstring G = \"\";\n\tfor (int i = 0; i < A; i++) G += \"a\";\n\tfor (int i = 0; i < B; i++) G += \"b\";\n\tfor (int i = 0; i < C; i++) G += \"c\";\n\n\tstring ret = getans(G);\n\tfor (int i = 0; i < ret.size(); i++) ret[i] = F[ret[i] - 'a'];\n\tcout << ret << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nmultiset<string>s;\nint main()\n{\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tfor(int i = 1;i<=a;i++)s.insert(\"a\");\n\tfor(int i = 1;i<=b;i++)s.insert(\"b\");\n\tfor(int i = 1;i<=c;i++)s.insert(\"c\");\n\tfor(int i = 1;i<a+b+c;i++)\n\t{\n\t\tstring x = *s.begin(),y = *(--s.end());\n\t\ts.erase(s.lower_bound(x)),s.erase(s.lower_bound(y));\n\t\ts.insert(x+y);\n\t}cout<<*s.begin();\n\treturn 0;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\nconst int maxn = 55;\nstring res;\nbool vis[maxn][maxn][maxn][maxn];\nint failure[maxn], link[maxn][3], final_ok[maxn];\nvoid push(){\n memset(failure, 0, sizeof(failure));\n for(int s = 2; s <= res.size(); s++){\n failure[s] = failure[s-1];\n while(failure[s] > 0 && res[failure[s]] != res[s-1])\n failure[s] = failure[failure[s]];\n if(res[failure[s]] == res[s-1]) ++failure[s];\n }\n for(int s = 0; s < res.size(); s++){\n for(int e = 0; e < 3; e++){\n int pos = s;\n if(res[s] > 'a' + e) link[s][e] = -1;\n else{\n while(pos > 0 && res[pos] != 'a' + e) pos = failure[pos];\n if(res[pos] == 'a' + e) pos++;\n link[s][e] = pos;\n }\n }\n }\n for(int s = 0; s < res.size(); s++){\n int pos = s;\n final_ok[pos] = 1;\n for(int e = 0; e < res.size(); e++){\n pos = link[pos][res[e] - 'a'];\n if(pos == -1){\n final_ok[s] = 0;\n break;\n }\n }\n }\n}\nbool solve(int x, int y, int z, int px){\n if(px == res.size()) px = failure[px];\n if(x + y + z == 0) return final_ok[px];\n if(vis[x][y][z][px]) return false;\n vis[x][y][z][px] = true;\n if(link[px][0] != -1 && x && solve(x - 1, y, z, link[px][0])) return true;\n if(link[px][1] != -1 && y && solve(x, y - 1, z, link[px][1])) return true;\n if(link[px][2] != -1 && z && solve(x, y, z - 1, link[px][2])) return true;\n return false;\n}\nint M(){\n int x, y, z;\n if(!(cin >> x >> y >> z)) return 0;\n int len = x + y + z;\n res.clear();\n for(int e = 0; e < len; e++){\n res.push_back('c');\n push();\n memset(vis, 0, sizeof(vis));\n if(solve(x, y, z, 0)) continue;\n res.back() = 'b';\n push();\n memset(vis, 0, sizeof(vis));\n if(solve(x, y, z, 0)) continue;\n res.back() = 'a';\n }\n cout << res << endl;\n return 1;\n}\nint main(){\n while(M());\n return 0;\n}\n", "#include <cstdio>\n#include <set>\n#include <cstring>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <iostream>\n#include <ctime>\n#include <unistd.h>\n\nusing namespace std;\n\n#define TRACE(x) cerr << #x << \" = \" << x << endl\n#define _ << \" \" <<\n#define FOR(i, a, b) for (int i=(a); i<(b); i++)\n#define REP(i, n) FOR(i, 0, n)\n\n#define X first\n#define Y second\n\ntypedef pair<int, int> P;\ntypedef long long ll;\n\nint cnt[3];\n\nstring rek(vector <pair<string, int> > V) {\n // TRACE(V.size());\n \n if (V.size() == 1) {\n string ret = \"\";\n REP(i, V[0].Y)\n ret += V[0].X;\n\n return ret;\n } \n \n multiset <string> S;\n REP(i, V[0].Y)\n S.insert(V[0].X);\n\n for (int i=(int) V.size()-1; i; i--) {\n REP(j, V[i].Y) {\n auto it = S.begin();\n string tmp = *it;\n S.erase(it);\n tmp += V[i].X;\n S.insert(tmp);\n }\n }\n\n // TRACE(S.size());\n\n vector <pair<string, int> > T;\n for (multiset <string> :: iterator it = S.begin(); it != S.end(); ) {\n int kol = 0;\n multiset <string> :: iterator it2 = it;\n for (; it2 != S.end() && *it2 == *it; it2++, kol++);\n T.push_back({*it, kol});\n it = it2;\n }\n\n return rek(T);\n}\n\nint main()\n{\n int n=0;\n REP(i, 3) {\n scanf(\"%d\", &cnt[i]);\n n += cnt[i];\n }\n\n vector <pair<string, int> > V;\n REP(i, 3) {\n if (cnt[i]) {\n string tmp = \"\";\n tmp.push_back((char) ('a' + i));\n V.push_back({tmp, cnt[i]});\n }\n }\n\n cout << rek(V) << endl;\n \n return 0;\n}\n", "#include<set>\n#include<cstdio>\n#include<cctype>\n#include<string>\ninline int Read(){\n\tchar a;\n\tint b;\n\twhile(!isdigit(a=getchar()));\n\tb=a^'0';\n\twhile(isdigit(a=getchar()))b=(((b<<2)+b)<<1)+(a^'0');\n\treturn b;\n}\nint main()\n{\n\tstd::multiset<std::string> set;\n\tfor(int i=Read();i;i--)set.insert(\"a\");\n\tfor(int i=Read();i;i--)set.insert(\"b\");\n\tfor(int i=Read();i;i--)set.insert(\"c\");\n\twhile(set.size()>1){\n\t\tstd::string s=*set.begin(),t=*set.rbegin();\n\t\tset.erase(set.lower_bound(s));\n\t\tset.erase(set.lower_bound(t));\n\t\tset.insert(s+t);\n\t}\n\tprintf(\"%s\\n\",(*set.begin()).c_str());\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tmultiset <string> s;\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tfor(int i=1;i<=a;i++) s.insert(\"a\");\n\tfor(int i=1;i<=b;i++) s.insert(\"b\");\n\tfor(int i=1;i<=c;i++) s.insert(\"c\");\n\twhile(s.size()>1)\n\t{\n\t\tstring x=*s.begin();\n\t\tstring y=*s.rbegin();\n\t\ts.erase(s.lower_bound(x));\n\t\ts.erase(s.lower_bound(y));\n\t\ts.insert(x+y); \n\t}\n\tcout<<*s.begin();\n\treturn 0;\n}", "#include <iostream>\n#include <string>\n#include <set>\n\nusing namespace std;\n\nint a_num, b_num, c_num;\n\nmultiset<string> st;\n\nint main()\n{\n\tcin >> a_num >> b_num >> c_num;\n\tfor (int i = 1; i <= a_num; i++) st.insert(\"a\");\n\tfor (int i = 1; i <= b_num; i++) st.insert(\"b\");\n\tfor (int i = 1; i <= c_num; i++) st.insert(\"c\");\n\t\n\twhile (st.size() > 1)\n\t{\n\t\tstring s = *st.begin(), t = *st.rbegin();\n\t\tst.erase(st.lower_bound(s)), st.erase(st.lower_bound(t));\n\t\tst.insert(s + t);\n\t}\n\t\n\tcout << *st.begin();\n\t\n\treturn 0;\n}", "#include<bits/stdc++.h>\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef double lf;\ntypedef long double llf;\ntypedef std::pair<int,int> pii;\n\n#define xx first\n#define yy second\n\ntemplate<typename T> inline T max(T a,T b){return a>b?a:b;}\ntemplate<typename T> inline T min(T a,T b){return a<b?a:b;}\ntemplate<typename T> inline T abs(T a){return a>0?a:-a;}\ntemplate<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}\ntemplate<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}\ntemplate<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}\ntemplate<typename T> inline T sqr(T x){return x*x;}\n#define mp(a,b) std::make_pair(a,b)\n#define pb push_back\n#define I inline\n#define mset(a,b) memset(a,b,sizeof(a))\n#define mcpy(a,b) memcpy(a,b,sizeof(a))\n\n#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)\n#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)\n#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)\n#define fd0(i,n) for(int i=(n)-1;~i;i--)\n#define fd1(i,n) for(int i=n;i;i--)\n#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)\n#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)\n\nstruct Cg{I char operator()(){return getchar();}};\nstruct Cp{I void operator()(char x){putchar(x);}};\n#define OP operator\n#define RT return *this;\n#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\\\nif(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'\n#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x\n#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'\n#define TR *this,x;return x;\nI bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int &x)\n{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char &x)\n{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char *x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS\n(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf &x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf &x){RX;RL;RT}I OP llf()\n{llf x;TR}I Fr&OP,(uint &x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull &x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;\n#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')\n#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\\\nx=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);\n#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')\ntemplate<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}\nI Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()\n(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char *x){while(*x)P(*x++);RT}\nI Fw&OP()(const char *x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;\n\nconst int N=53;\n\nchar s[N],f[N][N][N][N];\nint p[N],n,nxt[N][3];\n\ninline bool dfs2(int a,int b,int c,int i)\n{\n\tif(!a&&!b&&!c)\n\t{\n\t\tfo0(j,n)\n\t\t{\n\t\t\tif(s[i]>s[j])return 0;\n\t\t\ti=nxt[i][s[j]-97];\n\t\t}\n\t\treturn 1;\n\t}\n\tif(~f[a][b][c][i])return f[a][b][c][i];\n\tbool res=0;\n\tif(a&&s[i]<='a')res|=dfs2(a-1,b,c,nxt[i][0]);\n\tif(b&&s[i]<='b')res|=dfs2(a,b-1,c,nxt[i][1]);\n\tif(c&&s[i]<='c')res|=dfs2(a,b,c-1,nxt[i][2]);\n\treturn f[a][b][c][i]=res;\n}\n\ninline bool chk(int n,int a,int b,int c)\n{\n\t//out,\"chk:\",n,' ',a,' ',b,' ',c,'\\n';\n\t::n=n;\n\tp[0]=-1;\n\tfo1(i,n-1)\n\t{\n\t\tint t=p[i-1];\n\t\tfor(;t!=-1&&s[t+1]!=s[i];t=p[t]);\n\t\tif(s[t+1]==s[i])p[i]=t+1;\n\t\telse p[i]=-1;\n\t}\n\tfo(i,0,n)fo0(j,3)\n\t{\n\t\tint t=i==n?p[i-1]:i-1;\n\t\tfor(;t!=-1&&s[t+1]!=j+97;t=p[t]);\n\t\tif(t+2==n)t=p[t+1]-1;\n\t\tif(s[t+1]==j+97)nxt[i][j]=t+2;\n\t\telse nxt[i][j]=0;\n\t}\n\t//fo(i,0,n)fo0(j,3)out,'/',i,' ',j,' ',nxt[i][j],'\\n';\n\tfo(i,0,a)fo(j,0,b)fo(k,0,c)fo0(d,n)f[i][j][k][d]=-1;\n\treturn dfs2(a,b,c,0);\n}\n\ninline void dfs(int a,int b,int c,int i)\n{\n\t//out,a,' ',b,' ',c,' ',i,'\\n';\n\tif(!a&&!b&&!c)return;\n\tif(c){s[i]='c';if(chk(i+1,a,b,c-1))return dfs(a,b,c-1,i+1);}\n\tif(b){s[i]='b';if(chk(i+1,a,b-1,c))return dfs(a,b-1,c,i+1);}\n\tif(a){s[i]='a';if(chk(i+1,a-1,b,c))return dfs(a-1,b,c,i+1);}\n}\n\nint main()\n{\n\tint a,b,c;\n\tin,a,b,c;\n\tdfs(a,b,c,0);\n\tout,s,'\\n';\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define si(x) scanf(\"%d\",&x)\n#define sl(x) scanf(\"%lld\",&x)\n#define pi(x) printf(\"%d\",x)\n#define pl(x) printf(\"%lld\",x)\n#define pb push_back\n#define mkp make_pair\n#define fi first\n#define se second\n#define re register\n#define rep(i,m,n) for(int i=m;i<=n;i++)\n#define per(i,n,m) for(int i=m;i>=n;i--)\n#define rrep(i,m,n) for(register int i=m;i<=n;i++)\n#define rper(i,n,m) for(register int i=m;i>=n;i--)\nconst int N = 5e6 + 10;\nconst ll mod = 1e9 + 7;\nmultiset<string> s;\nsigned main(){\n int a,b,c;\n cin>>a>>b>>c;\n rep(i,1,a)s.insert(\"a\");\n rep(i,1,b)s.insert(\"b\");\n rep(i,1,c)s.insert(\"c\");\n while (s.size()>1){\n auto i=s.begin(),j=s.end();\n j--;\n string tmp=(*i)+(*j);\n s.erase(i);s.erase(j);\n s.insert(tmp);\n }\n cout<<(*s.begin());\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) do{print_vars(cout<<\"# \"<<#__VA_ARGS__<<'=',__VA_ARGS__);cout<<endl;}while(0)\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define peri(i,a,b) for(int i=int(b);i-->int(a);)\n#define rep(i,n) repi(i,0,n)\n#define per(i,n) peri(i,0,n)\n#define all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\nusing uint=unsigned;\nusing ll=long long;\nusing ull=unsigned long long;\nusing vi=vector<int>;\nusing vvi=vector<vi>;\nusing vl=vector<ll>;\nusing vvl=vector<vl>;\nusing vd=vector<double>;\nusing vvd=vector<vd>;\nusing vs=vector<string>;\n\nvoid print_vars(ostream&){}\ntemplate<typename Car,typename... Cdr>\nvoid print_vars(ostream& os,const Car& car,const Cdr&... cdr){\n\tprint_vars(os<<car<<(sizeof...(cdr)?\",\":\"\"),cdr...);\n}\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<int I,typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<int I,typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tos<<get<I>(t)<<(sizeof...(Cdr)?\",\":\"\");\n\tprint_tuple<I+1,Cdr...>(os,t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<0,Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nint main()\n{\n\t#ifndef _GLIBCXX_DEBUG\n\tios_base::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tconstexpr char endl='\\n';\n\t#endif\n\n\tfor(int x,y,z;cin>>x>>y>>z&&x|y|z;){\n\t\tmultiset<string> s;\n\t\trep(_,x) s.insert(\"a\");\n\t\trep(_,y) s.insert(\"b\");\n\t\trep(_,z) s.insert(\"c\");\n\t\twhile(s.size()>1){\n\t\t\tauto i=begin(s),j=--end(s);\n\t\t\ts.insert(*i+*j);\n\t\t\ts.erase(i);\n\t\t\ts.erase(j);\n\t\t}\n\t\tcout<<*begin(s)<<endl;\n\t}\n}\n", "#include <bits/stdc++.h>\n#define maxn 100086\n\nusing namespace std;\n\nint x, y, z;\nmultiset<string> st;\n\nint main(){\n\tscanf(\"%d%d%d\", &x, &y, &z);\n\tfor(int i = 1;i <= x;i++) st.insert(\"a\");\n\tfor(int i = 1;i <= y;i++) st.insert(\"b\");\n\tfor(int i = 1;i <= z;i++) st.insert(\"c\");\n\twhile(st.size() > 1){\n\t\tstring s = *st.begin(), t = *st.rbegin();\n\t\tst.erase(st.find(s)), st.erase(st.find(t));\n\t\tst.insert(s + t);\n\t}\n\tprintf(\"%s\", st.begin()->c_str());\n}", "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nstring f(vector<pair<string,int> >A)\n{\n\tif(A.size()==1)\n\t{\n\t\tstring ret=\"\";\n\t\tfor(int i=0;i<A[0].second;i++)ret+=A[0].first;\n\t\treturn ret;\n\t}\n\tsort(A.begin(),A.end());\n\tint sum=0;\n\tfor(pair<string,int>p:A)\n\t{\n\t\tsum+=p.second;\n\t}\n\tvector<string>ret;\n\tif(A[0].second*2<=sum)\n\t{\n\t\tfor(int i=0;i<A[0].second;i++)ret.push_back(A[0].first);\n\t\tint cnt=A[0].second;\n\t\tA[0].second=0;\n\t\tint id=A.size()-1;\n\t\twhile(0<id)\n\t\t{\n\t\t\tfor(int i=0;i<cnt;i++)\n\t\t\t{\n\t\t\t\twhile(0<id&&A[id].second==0)id--;\n\t\t\t\tif(id==0)break;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tA[id].second--;\n\t\t\t\t\tret[i]+=A[id].first;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsort(ret.begin(),ret.end());\n\t\t\tint ncnt=0;\n\t\t\tfor(int i=0;i<cnt;i++)if(ret[0]==ret[i])ncnt++;\n\t\t\tcnt=ncnt;\n\t\t}\n\t}\n\telse\n\t{\n\t\tint cnt=sum-A[0].second;\n\t\tfor(int i=0;i<cnt;i++)\n\t\t{\n\t\t\tret.push_back(\"\");\n\t\t\tfor(int j=0;j<A[0].second/cnt+(i<A[0].second%cnt);j++)\n\t\t\t{\n\t\t\t\tret.back()+=A[0].first;\n\t\t\t}\n\t\t}\n\t\tint id=A.size()-1;\n\t\tfor(string&s:ret)\n\t\t{\n\t\t\twhile(A[id].second==0)id--;\n\t\t\tA[id].second--;\n\t\t\ts+=A[id].first;\n\t\t}\n\t}\n\tsort(ret.begin(),ret.end());\n\tvector<pair<string,int> >nxt;\n\tnxt.push_back(make_pair(ret[0],1));\n\tfor(int i=1;i<ret.size();i++)\n\t{\n\t\tif(nxt.back().first==ret[i])nxt.back().second+=1;\n\t\telse nxt.push_back(make_pair(ret[i],1));\n\t}\n\treturn f(nxt);\n}\nint main()\n{\n\tint X,Y,Z;\n\tcin>>X>>Y>>Z;\n\tvector<pair<string,int> >A;\n\tif(X>0)A.push_back(make_pair(\"a\",X));\n\tif(Y>0)A.push_back(make_pair(\"b\",Y));\n\tif(Z>0)A.push_back(make_pair(\"c\",Z));\n\tcout<<f(A)<<endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) (container).begin(), (container).end()\n#define RALL(container) (container).rbegin(), (container).rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define pb push_back\n#define eb emplace_back\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define __builtin_popcount __builtin_popcountll\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\n os<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\n os<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\n\nconst int INF = 1<<28;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\n\nint T, n, m;\n\nstring solve(int x, const string a) {\n string ans = \"\";\n REP(i, x) ans += a;\n return ans;\n}\n\nstring solve(int x, int y, const string a, const string b) {\n if (x == 0) return solve(y, b);\n if (y == 0) return solve(x, a);\n if (x <= y) return solve(x, y - x, a + b, b);\n return solve(x - y, y, a, a + b);\n}\n\nstring solve(int x, int y, int z, const string a, const string b, const string c) {\n if(x == 0) return solve(y, z, b, c);\n if(y == 0) return solve(x, z, a, c);\n if(z == 0) return solve(x, y, a, b);\n if(x <= z) return solve(x, y, z - x, a + c, b, c);\n if(x <= z + y) return solve(x - z, z, y - (x - z), a + b, a + c, b);\n return solve(x - y - z, y, z, a, a + b, a + c);\n}\n\nint main(int argc, char *argv[]){\n ios::sync_with_stdio(false);\n int x, y, z;\n cin >> x >> y >> z;\n cout << solve(x, y, z, \"a\", \"b\", \"c\") << endl;\n return 0;\n}\n", "#include<cstdio>\n#include<algorithm>\n#include<iostream>\n#include<cstring>\n#include<vector>\n#include<set>\nusing namespace std;\ntypedef long long LL;\nmultiset<string> s;\nmultiset<string> :: iterator it,it1;\nint main()\n{\n\tint x,y,z;\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tfor (int u=1;u<=x;u++) s.insert(\"a\");\n\tfor (int u=1;u<=y;u++) s.insert(\"b\");\n\tfor (int u=1;u<=z;u++) s.insert(\"c\");\n\twhile (s.size()>1)\n\t{\n\t\tit=s.begin();\n\t\tit1=(--s.end());\n\t\ts.insert((*it)+(*it1));\n\t\ts.erase(it);s.erase(it1);\n\t}\n\tcout<<(*s.begin());\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nmultiset<string>s;\nint main()\n{\n cin>>a>>b>>c;\n for(int i=1;i<=a;i++)s.insert(\"a\");\n for(int i=1;i<=b;i++)s.insert(\"b\");\n for(int i=1;i<=c;i++)s.insert(\"c\");\n while(s.size()>1)\n {\n string ss=(*s.begin())+(*s.rbegin());\n s.erase(s.begin());\n s.erase(--s.end());\n s.insert(ss);\n }\n cout<<(*s.begin());\n return 0;\n}\n", "x, y, z = map(int, raw_input().split())\na = ['a'] * x + ['b'] * y + ['c'] * z\n\nwhile len(a) > 1:\n a = sorted(a[1:-1] + [a[0] + a[-1]])\n\nprint a[0]\n\n", "#include <bits/stdc++.h>\n#define che\n#define debug(...) fprintf(stderr,__VA_ARGS__)\nusing namespace std;\n\ntypedef long long LL;\n\n\nmultiset<string> S;\nint main(){\n\n\tint n;\n\tscanf(\"%d\", &n);for (int i=0; i<n; i++) S.insert(\"a\");\n\tscanf(\"%d\", &n);for (int i=0; i<n; i++) S.insert(\"b\");\n\tscanf(\"%d\", &n);for (int i=0; i<n; i++) S.insert(\"c\");\n\twhile ( S.size() >1){\n\t\tstring s1= *S.begin(), s2= *(--S.end());\n\t\tstring t= s1+s2;\n\t\tS.erase(S.begin());S.erase(--S.end());\n\t\tS.insert(t);\n\t}\n\tprintf(\"%s\\n\", S.begin()->c_str());\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,a,b) for(int i = (a); i < (b); i++)\n#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); i--)\n#define ITER(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int) a.size()\n#define ALL(a) a.begin(),a.end()\n#define PB push_back\n#define MP make_pair\n\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\nconst int INF = 1000 * 1000 * 1000 + 7;\nconst LL LINF = INF * (LL)INF;\n\nstring minShift(string s)\n{\n\tstring res = s;\n\tFOR (it, 0, SZ(s))\n\t{\n\t\ts += s[0];\n\t\ts.erase(s.begin());\n\t\tres = min(res, s);\n\t}\n\treturn res;\n}\n\nstring getString(vector<string> v)\n{\n\tstring res;\n\tFOR (i, 0, SZ(v))\n\t{\n\t\tres += v[i];\n\t}\n\treturn res;\n}\n\nstring solveSmall(int a, int b, int c, string A, string B, string C)\n{\n\tvector<string> v;\n\tFOR (i, 0, a)\n\t{\n\t\tv.PB(A);\n\t}\n\n\tFOR (i, 0, b)\n\t{\n\t\tv.PB(B);\n\t}\n\n\tFOR (i, 0, c)\n\t{\n\t\tv.PB(C);\n\t}\n\tsort(ALL(v));\n\n\tstring res = getString(v);\n\n\tdo\n\t{\n\t\tres = max(res, minShift(getString(v)));\n\t}while(next_permutation(ALL(v)));\n\n\treturn res;\n\n}\n\nstring getString(int cnt, string s)\n{\n\tstring res;\n\tFOR (i, 0, cnt)\n\t{\n\t\tres += s;\n\t}\n\treturn res;\n}\n\nstring solveLarge(int a, int b, int c, string A, string B, string C)\n{\n\tif (a + b + c <= 3) return solveSmall(a, b, c, A, B, C);\n\n\tif (a == 0)\n\t{\n\t\ta = b;\n\t\tA = B;\n\t\tb = c;\n\t\tB = C;\n\t\tc = 0;\n\t\tC = \"\";\n\t}\n\n\tif (b == 0)\n\t{\n\t\tb = c;\n\t\tB = C;\n\t\tc = 0;\n\t\tC = \"\";\n\t}\n\n\tif (b == 0 && c == 0)\n\t{\n\t\treturn getString(a, A);\n\t}\n\n\tif (c >= a)\n\t{\n\t\tc -= a;\n\t\tA += C;\n\t\treturn solveLarge(a, b, c, A, B, C);\n\t}\n\n\tC = A + C;\n\ta -= c;\n\n\tif (b >= a)\n\t{\n\t\tA += B;\n\t\tb -= a;\n\t\tswap(b, c);\n\t\tswap(B, C);\n\t}\n\telse\n\t{\n\t\ta -= b;\n\t\tB = A + B;\n\t}\n\n\treturn solveLarge(a, b, c, A, B, C);\n\n\n\n}\n\nint main()\n{\n\t//freopen(\"in.txt\", \"r\", stdin);\n\t//ios::sync_with_stdio(false); cin.tie(0);\n\n\tint x, y, z;\n\n\tcin>>x>>y>>z;\n\tstring res = solveLarge(x, y, z, \"a\", \"b\", \"c\");\n\tcout<<res<<endl;\n\n//\tFOR (a, 0, 5)\n//\t{\n//\t\tFOR (b, 0, 5)\n//\t\t{\n//\t\t\tFOR (c, 0, 5)\n//\t\t\t{\n//\t\t\t\tstring r = solveSmall(a, b, c, \"a\", \"b\", \"c\");\n//\t\t\t\tstring s = solveLarge(a, b, c, \"a\", \"b\", \"c\");\n//\t\t\t\tcout<<r<<endl<<s<<endl;\n//\t\t\t\tif (r != s)\n//\t\t\t\t{\n//\t\t\t\t\tcout<<\"!! \"<<endl;\n//\t\t\t\t\tcout<<a<<' '<<b<<' '<<c<<endl;\n//\t\t\t\t\tthrow -1;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t}\n//\t}\n//\n//\tcout<<\"Done\"<<endl;\n\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nmultiset< string > S;\nint main() {\n\tint x,y,z;\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\twhile(x--) S.insert(\"a\");\n\twhile(y--) S.insert(\"b\");\n\twhile(z--) S.insert(\"c\");\n\twhile(S.size()>1) {\n\t\tstring a=*S.begin(),b=*S.rbegin();\n\t\tS.erase(S.begin());\n\t\tS.erase(--S.end());\n\t\tS.insert(a+b);\n\t}\n\tcout << *S.begin() <<endl;\n\treturn 0;\n}", "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n private FastScanner in;\n private PrintWriter out;\n\n int cnt = 0;\n\n class T implements Comparable<T> {\n String s;\n int id = cnt++;\n\n public T(String s) {\n this.s = s;\n }\n\n @Override\n public int compareTo(T o) {\n int c = s.compareTo(o.s);\n if (c != 0) {\n return c;\n }\n return Integer.compare(id, o.id);\n }\n }\n\n String getMin(String s) {\n String res = s;\n for (int i = 1; i < s.length(); i++) {\n String t = s.substring(i) + s.substring(0, i);\n if (t.compareTo(res) < 0) {\n res = t;\n }\n }\n return res;\n }\n\n void check(String s) {\n ArrayList<Character> a = new ArrayList<>();\n for (char c : s.toCharArray()) {\n a.add(c);\n }\n char[] tmp = new char[s.length()];\n for (int it = 0; it < 1231; it++) {\n Collections.shuffle(a);\n int z = 0;\n for (char c : a) {\n tmp[z++] = c;\n }\n String xx = new String(tmp);\n if (getMin(xx).compareTo(s) > 0) {\n throw new AssertionError();\n }\n }\n }\n\n String solve(int x, int y, int z) {\n if (x + y + z == 0) {\n return \"\";\n }\n TreeSet<T> ts = new TreeSet<>();\n for (int i = 0; i < x; i++) {\n ts.add(new T(\"a\"));\n }\n for (int i = 0; i < y; i++) {\n ts.add(new T(\"b\"));\n }\n for (int i = 0; i < z; i++) {\n ts.add(new T(\"c\"));\n }\n while (ts.size() > 1) {\n T first = ts.pollFirst();\n T last = ts.pollLast();\n ts.add(new T(first.s + last.s));\n }\n String res = (ts.first().s);\n check(res);\n return res;\n }\n\n void solve123() {\n final int M = 10;\n for (int x = 0; x < M; x++) {\n for (int y = 0; y < M; y++) {\n for (int z = 0; z < M; z++) {\n solve(x, y, z);\n System.err.println(x + \" \" + y + \" \"+ z);\n }\n }\n }\n }\n\n void solve() {\n int x = in.nextInt();\n int y = in.nextInt();\n int z = in.nextInt();\n out.println(solve(x, y, z));\n }\n\n private void run() {\n try {\n in = new FastScanner(new File(\"Main.in\"));\n out = new PrintWriter(new File(\"Main.out\"));\n\n solve();\n\n out.close();\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n private void runIO() {\n in = new FastScanner(System.in);\n out = new PrintWriter(System.out);\n\n solve();\n\n out.close();\n }\n\n private class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n FastScanner(File f) {\n try {\n br = new BufferedReader(new FileReader(f));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n FastScanner(InputStream f) {\n br = new BufferedReader(new InputStreamReader(f));\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n public static void main(String[] args) {\n new Main().runIO();\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair<int, int> pii;\n\n#define fst first\n#define snd second\n#define pb push_back\n#define REP(i, a, b) for(int i = (a), i##end = (b); i < i##end; ++i)\n#define DREP(i, a, b) for(int i=(a-1), i##end = (b); i >=i##end; --i)\n\ntemplate <typename T> bool chkmax(T& a, T b) { return a < b ? a = b, 1 : 0; }\ntemplate <typename T> bool chkmin(T& a, T b) { return a > b ? a = b, 1 : 0; }\n\nconst int N = 100000;\nconst int oo = 0x3f3f3f3f;\n\ntemplate<typename T> T read() {\n T n(0), f(1);\n char ch = getchar();\n for( ;!isdigit(ch); ch = getchar()) if(ch == '-') f = -1;\n for( ; isdigit(ch); ch = getchar()) n = n * 10 + ch - 48; \n return n * f;\n}\nstring solve(int a, int b, int c) {\n bool flag = false;\n\n if(!a) {\n flag = true;\n a = b;\n b = c;\n c = 0;\n }\n\n string res;\n if(!a) {\n res = string(b, 'b');\n }else {\n if(!b && !c) {\n res = string(a, 'a');\n }else {\n vector<string> ans(a, \"a\");\n for(int i = 0; i < c; ++i) ans[i % a] += 'c';\n\n int pos = c % a;\n for(int i = 0; i < b; ++i) {\n ans[pos] += 'b';\n if(++ pos == a) pos = c % a; \n }\n\n map<string, int> mp;\n vector< pair<string, int> > sub;\n\n for(const auto& x : ans) { ++ mp[x]; }\n for(const auto& x : mp) { sub.pb(x); }\n while(sub.size() < 3) sub.pb(make_pair(\"\", 0));\n\n string tmp = solve(sub[0].snd, sub[1].snd, sub[2].snd);\n\n for(const auto& x : tmp) {\n res += sub[x - 'a'].fst;\n }\n }\n }\n\n if(flag) {\n for(auto& ch : res) ++ ch;\n }\n return res;\n}\n\nint a, b, c;\nint main() {\n#ifdef Wearry\n freopen(\"data.txt\", \"r\", stdin);\n freopen(\"ans.txt\", \"w\", stdout);\n#endif\n \n cin >> a >> b >> c;\n cout << solve(a, b, c) << endl;\n\n return 0;\n}\n", "\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\n\npublic class Main {\n\n private static void solve() {\n int[] a = na(3);\n List<String> list = new ArrayList<>();\n for (int j = 0; j < 3; j ++) {\n for (int i = 0; i < a[j]; i ++)\n list.add(\"\" + (char)('a' + j));\n }\n\n while (list.size() > 1) {\n Collections.sort(list);\n int last = list.size() - 1;\n String s = list.get(0) + list.get(last);\n list.set(0, s);\n list.remove(last);\n }\n System.out.println(list.get(0));\n }\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = System.getProperty(\"debug\");\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n", "def work(a,b,c,A,B,C):\n if A==0:\n return work(b,c,'',B,C,0)\n if B==0:\n if C==0:\n return a*A\n else:\n return work(a,c,'',A,C,0)\n if C==0:\n return work(a+b*(B/A),a+b*(B/A+1),'',A-B%A,B%A,0)\n cmod = C%A\n if B <= A-cmod:\n return work(a+c*(C/A),a+c*(C/A)+b,a+c*(C/A+1),A-cmod-B,B,cmod)\n else:\n bmod = B%(A-cmod)\n return work(a+c*(C/A)+b*(B/(A-cmod)),a+c*(C/A)+b*(B/(A-cmod)+1),a+c*(C/A+1),A-bmod-cmod,bmod,cmod)\n\nif __name__ == '__main__':\n s = raw_input()\n a,b,c = [int(i) for i in s.split()]\n print(work('a','b','c',a,b,c))\n", "#include <bits/stdc++.h>\nusing ll = int64_t;\nusing ld = long double;\nusing namespace std;\n\nconst int MAXN = 51;\n\nusing val = vector<int>;\n\nstring ans[MAXN];\n\nstring solve(int x, int y, int z) {\n int n = x + y + z;\n if (!x) {\n string ans = solve(y, z, 0);\n for (char& c : ans) {\n c++;\n }\n return ans;\n }\n\n if (y + z == 0) {\n string ans = \"\";\n for (int i = 0; i < n; i++)\n ans += 'a';\n return ans;\n }\n\n string vala;\n string valb;\n string valc;\n\n int nx, ny, nz;\n\n if (x <= z) {\n nx = x;\n ny = y;\n nz = z - x;\n vala = \"ac\";\n valb = \"b\";\n valc = \"c\";\n } else {\n if (x - z < y) {\n vala = \"ab\";\n valb = \"ac\";\n valc = \"b\";\n nx = x - z;\n ny = z;\n nz = y - (x - z);\n } else {\n vala = \"a\";\n valb = \"ab\";\n valc = \"ac\";\n nx = x - y - z;\n ny = y;\n nz = z;\n }\n }\n\n string ans = solve(nx, ny, nz);\n string vl = \"\";\n for (char c : ans) {\n if (c == 'a')\n vl += vala;\n else if (c == 'b')\n vl += valb;\n else vl += valc;\n }\n return vl;\n}\n\nint main() {\n#ifdef PAUNSVOKNO\n freopen(\"input.txt\", \"r\", stdin); freopen(\"output.txt\", \"w\", stdout);\n#endif\n ios_base::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(20);\n int x, y, z;\n cin >> x >> y >> z;\n string ans = solve(x, y, z);\n cout << ans << \"\\n\";\n}", "#include <bits/stdc++.h>\nusing namespace std;\nconst int maxn = 101;\nint x, y, z;\nstring a, b, c;\nint main() {\n\tscanf(\"%d%d%d\", &x, &y, &z);\n\ta = \"a\";\n\tb = \"b\";\n\tc = \"c\";\n\twhile(1) {\n\t\tif(!x) {\n\t\t\tx = y;\n\t\t\ta = b;\n\t\t\ty = z;\n\t\t\tb = c;\n\t\t\tz = 0;\n\t\t}\n\t\tif(!x) {\n\t\t\tx = y;\n\t\t\ta = b;\n\t\t\ty = 0;\n\t\t}\n\t\tif(z) {\n\t\t\tif(x <= z) {\n\t\t\t\tfor( ; z >= x; z -= x)\n\t\t\t\t\ta = a + c;\n\t\t\t} else {\n\t\t\t\tfor( ; x >= y + z; x -= y + z) {\n\t\t\t\t\tb = a + b;\n\t\t\t\t\tc = a + c;\n\t\t\t\t}\n\t\t\t\tif(x >= z) {\n\t\t\t\t\tswap(y, z);\n\t\t\t\t\tswap(b, c);\n\t\t\t\t\tb = a + b;\n\t\t\t\t\tx -= y;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if(y) {\n\t\t\tif(x <= y) {\n\t\t\t\tfor( ; y >= x; y -= x)\n\t\t\t\t\ta = a + b;\n\t\t\t} else {\n\t\t\t\tfor( ; x >= y; x -= y)\n\t\t\t\t\tb = a + b;\n\t\t\t}\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\tb = a;\n\tfor(int i = 1; i < x; ++i)\n\t\ta = a + b;\n\tputs(a.c_str());\n\treturn 0;\n} ", "#include \"bits/stdc++.h\"\nusing namespace std;\n#define fi first\n#define se second\n#define ll long long\n#define dbg(v) cerr<<#v<<\" = \"<<v<<'\\n'\n#define vi vector<int>\n#define vl vector <ll>\n#define pii pair<int,int>\n#define mp make_pair\n#define db long double\n#define pb push_back\n#define all(s) s.begin(),s.end()\nint main(void)\n{\n int a,b,c;\n cin>>a>>b>>c;\n multiset < string > s;\n for (int i = 0;i < a;++i)\n s.insert(\"a\");\n for (int i = 0;i < b;++i)\n s.insert(\"b\");\n for (int i = 0;i < c;++i)\n s.insert(\"c\");\n while (s.size() > 1)\n {\n string str = *s.begin();\n str += *s.rbegin();\n s.erase(s.begin());\n auto it = s.end();--it;\n s.erase(it);\n s.insert(str);\n }\n cout << (*s.begin()) << '\\n';\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef signed long long ll;\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define FOR(x,to) for(x=0;x<(to);x++)\n#define FORR(x,arr) for(auto& x:arr)\n#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)\n#define ALL(a) (a.begin()),(a.end())\n#define ZERO(a) memset(a,0,sizeof(a))\n#define MINUS(a) memset(a,0xff,sizeof(a))\n//-------------------------------------------------------\n\nint A,B,C;\n/*\n\nstring hoge(map<string,int> M) {\n\tif(M.size()==1) {\n\t\tstring s=\"\";\n\t\twhile(M.begin()->second--) s+=M.begin()->first;\n\t\treturn s;\n\t}\n\tstring s=M.begin()->first;\n\tstring t=M.rbegin()->first;\n\tint a=M.begin()->second;\n\tint b=rM.begin()->second;\n\t\n\tif(a<=b) {\n\t}\n\t\n\t\n}\n*/\n\nvoid solve() {\n\tint i,j,k,l,r,x,y; string s;\n\t\n\tcin>>A>>B>>C;\n\tvector<string> V;\n\tFOR(i,A) V.push_back(\"a\");\n\tFOR(i,B) V.push_back(\"b\");\n\tFOR(i,C) V.push_back(\"c\");\n\t\n\twhile(V.size()>1) {\n\t\tsort(ALL(V));\n\t\tV[0]+=V.back();\n\t\tV.pop_back();\n\t}\n\t\n\tcout<<V[0]<<endl;\n\t/*\n\tmap<string,int> M;\n\tif(A) M[\"a\"]=A;\n\tif(B) M[\"b\"]=B;\n\tif(C) M[\"c\"]=C;\n\t\n\tcout<<hoge(M)<<endl;\n\t*/\n}\n\n\nint main(int argc,char** argv){\n\tstring s;int i;\n\tif(argc==1) ios::sync_with_stdio(false), cin.tie(0);\n\tFOR(i,argc-1) s+=argv[i+1],s+='\\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);\n\tcout.tie(0); solve(); return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long int X, Y, Z, S, K;\n\nstatic inline void exap(string &src, string s, long long int t){\n for(int i = 0; i < t; ++i)src += s;\n}\n\nvoid twoletter(long long X, long long Y, string xc, string yc){\n while(X && Y){\n if(X > Y){\n X -= Y;\n yc = xc + yc;\n }else{\n K = Y / X;\n Y %= X;\n X -= Y;\n exap(xc, yc, K);\n yc = xc + yc;\n }\n }\n for(int i = 0; i < X; ++i)cout << xc;\n for(int i = 0; i < Y; ++i)cout << yc;\n cout << endl;\n return;\n}\n\nint main(){\n scanf(\"%lld%lld%lld\", &X, &Y, &Z);\n S = X + Y + Z;\n if(S == X || S == Y || S == Z){\n for(int i = 0; i < X; ++i)cout << \"a\";\n for(int i = 0; i < Y; ++i)cout << \"b\";\n for(int i = 0; i < Z; ++i)cout << \"c\";\n cout << endl;\n return 0;\n }\n string A = \"a\", B = \"b\", C = \"c\";\n while(1){\n //cout << A << X << \" \" << B << Y << \" \" << C << Z << endl;\n if(X == 0){\n twoletter(Y, Z, B, C);\n return 0;\n }\n if(Y == 0){\n twoletter(X, Z, A, C);\n return 0;\n }\n if(Z == 0){\n twoletter(X, Y, A, B);\n return 0;\n }\n if(X > Z){\n X -= Z;\n C = A + C;\n }else{\n K = Z / X;\n Z %= X;\n X -= Z;\n exap(A, C, K);\n C = A + C;\n }\n swap(B, C);\n swap(Y, Z);\n }\n return 0;\n}\n", "// Copyright (C) 2017 Sayutin Dmitry.\n//\n// This program is free software; you can redistribute it and/or\n// modify it under the terms of the GNU General Public License as\n// published by the Free Software Foundation; version 3\n\n// This program is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU General Public License for more details.\n\n// You should have received a copy of the GNU General Public License\n// along with this program; If not, see <http://www.gnu.org/licenses/>.\n\n#include <iostream>\n#include <vector>\n#include <stdint.h>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <array>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <utility>\n#include <string>\n#include <assert.h>\n#include <iterator>\n#include <cstdint>\n#include <cinttypes>\n#include <string.h>\n#include <random>\n#include <numeric>\n#include <tuple>\n\n\nusing std::cin;\nusing std::cout;\nusing std::cerr;\n\nusing std::vector;\nusing std::map;\nusing std::array;\nusing std::set;\nusing std::string;\n\nusing std::pair;\nusing std::make_pair;\n\nusing std::min;\nusing std::abs;\nusing std::max;\n\nusing std::unique;\nusing std::sort;\nusing std::generate;\nusing std::reverse;\nusing std::min_element;\nusing std::max_element;\n\n#ifdef LOCAL\n#define LASSERT(X) assert(X)\n#else\n#define LASSERT(X) {}\n#endif\n\ntemplate <typename T>\nT input() {\n T res;\n cin >> res;\n LASSERT(cin);\n return res;\n}\n\ntemplate <typename IT>\nvoid input_seq(IT b, IT e) {\n std::generate(b, e, input<typename std::remove_reference<decltype(*b)>::type>);\n}\n\n#define SZ(vec) int((vec).size())\n#define ALL(data) data.begin(),data.end()\n#define RALL(data) data.rbegin(),data.rend()\n#define TYPEMAX(type) std::numeric_limits<type>::max()\n#define TYPEMIN(type) std::numeric_limits<type>::min()\n\n#define pb push_back\n#define eb emplace_back\n\n// solve problem when a != 0.\nstring solve(int a, int b, int c) {\n if (b == 0 and c == 0) {\n // it is clear, that answer is 'aaa...'.\n string res = \"\";\n for (int t = 0; t != a; ++t)\n res += 'a';\n return res;\n }\n\n // lets build our cyclical string.\n // we have a parts equal to 'a', and b + c other parts.\n // clearly, resulting cyclical string has substring of num=ceil(a/(b+c)) symbols 'a'.\n // \n // if we want to minimize answer, than we shouldn't make it any larger (since it will be the minimal cyclical shift)\n // so we will have parts of length num and num-1.\n int num = (a + (b + c - 1)) / (b + c);\n int cnt_short = num * (b + c) - a; // how much parts of \"num - 1\"\n\n string tmp = \"\";\n for (int i = 0; i != num - 1; ++i)\n tmp += 'a';\n \n vector<string> parts;\n for (int i = 0; i != (b + c - cnt_short); ++i)\n parts.push_back(tmp + 'a'); // put long parts of num \"a\"\n\n for (int i = 0; i != cnt_short; ++i)\n parts.push_back(tmp); // put short parts of (num - 1) \"a\".\n\n // let's distribute B's and C's.\n //\n // We can notice, that minimal cyclical shift will start with num \"a\"s.\n // So it is always better to put C's to \"long\" parts, they are conveniently at the beginning of parts\n // array.\n \n for (int i = 0; i != c; ++i)\n parts[i] += 'c';\n for (int i = 0; i != b; ++i)\n parts[c + i] += 'b';\n\n // Now we want to put all parts together to minimize answer, and we are sure,\n // that the answer will be smaller than possible, if we try to split parts.\n\n // funny thing: there are no more, than 3 different types of parts, because\n // part uniquely defined by whether it has (num) or (num - 1) A's, and whether it has B or C at the end.\n // but it is not possible for types (num, B) and (num - 1, C) to exist together.\n\n // so count number of each and call recursion.\n std::sort(ALL(parts));\n vector<string> cparts = parts;\n cparts.resize(std::unique(ALL(cparts)) - cparts.begin());\n\n while (cparts.size() < 3)\n cparts.push_back(\"\");\n\n assert(SZ(cparts) == 3);\n string zzans = solve(std::count(ALL(parts), cparts[0]),\n std::count(ALL(parts), cparts[1]),\n std::count(ALL(parts), cparts[2]));\n\n string ans = \"\";\n for (char ch: zzans)\n ans += cparts[ch - 'a'];\n\n return ans;\n}\n\n// Time: T(x, y, z) = (x + y + z) + T(a, b, c), where a + b + c = x.\n// since X in T(x, y, z) is decreasing in recursion, there are O(N) levels and each is O(N) => O(N^2)\n\n// (actually implementation above is O(N^2 log) due to sort, but one can write without it).\n\nint main() {\n std::iostream::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n \n int a = input<int>();\n int b = input<int>();\n int c = input<int>();\n\n // remap 'a', 'b', 'c' in such way, that\n // num of 'a' is not zeros.\n std::map<char, char> back;\n if (a == 0 and b == 0) {\n back['a'] = 'c';\n a = c;\n b = 0;\n c = 0;\n } else if (a == 0) {\n back['a'] = 'b';\n back['b'] = 'c';\n a = b;\n b = c;\n c = 0;\n } else {\n back['a'] = 'a';\n back['b'] = 'b';\n back['c'] = 'c';\n }\n\n // solve problem when a != 0.\n string ans = solve(a, b, c);\n for (int i = 0; i != SZ(ans); ++i)\n cout << back[ans[i]];\n cout << \"\\n\";\n \n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint X,Y,Z;\nmultiset<string>S; \nint main(){\n\tscanf(\"%d%d%d\",&X,&Y,&Z);\n\twhile (X--) S.insert(\"a\");\n\twhile (Y--) S.insert(\"b\");\n\twhile (Z--) S.insert(\"c\");\n\twhile (S.size()>1){\n\t\tstring t=*S.begin()+*(--S.end());\n\t\tS.erase(S.begin());S.erase(--S.end());\n\t\tS.insert(t);\n\t}\n\tcout<<*S.begin();\n\treturn 0;\n}", "#include <stdio.h> \n#include <algorithm> \n#include <assert.h>\n#include <bitset>\n#include <cmath> \n#include <complex> \n#include <deque> \n#include <functional> \n#include <iostream> \n#include <limits.h> \n#include <map> \n#include <math.h> \n#include <queue> \n#include <set> \n#include <stdlib.h> \n#include <string.h> \n#include <string> \n#include <time.h> \n#include <unordered_map> \n#include <unordered_set> \n#include <vector>\n\n#pragma warning(disable:4996) \n#pragma comment(linker, \"/STACK:336777216\") \nusing namespace std;\n\n#define mp make_pair \n#define Fi first \n#define Se second \n#define pb(x) push_back(x) \n#define szz(x) ((int)(x).size()) \n#define all(x) (x).begin(), (x).end() \n#define ldb ldouble \n\ntypedef tuple<int, int, int> t3;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef double db;\ntypedef long double ldb;\ntypedef pair <int, int> pii;\ntypedef pair <ll, ll> pll;\ntypedef pair <ll, int> pli;\ntypedef pair <db, db> pdd;\n#define rep(i, n) for(int i=0;i<n;i++)\n\nint IT_MAX = 1 << 17;\nconst ll MOD = 1000000007;\nconst int INF = 0x3f3f3f3f;\nconst ll LL_INF = 0x1f3f3f3f3f3f3f3f;\nconst db PI = acos(-1);\nconst db ERR = 1e-12;\n\nstring getstr(string sa, string sb, int A, int B) {\n\tif (A == 0 || B == 0) {\n\t\tstring rv;\n\t\tfor (int i = 1; i <= A; i++) rv += sa;\n\t\tfor (int i = 1; i <= B; i++) rv += sb;\n\t\treturn rv;\n\t}\n\n\tint c = B / A;\n\tstring s1 = sa;\n\tstring s2 = sa;\n\tfor (int i = 1; i <= c; i++) s1 += sb;\n\tfor (int i = 1; i <= c + 1; i++) s2 += sb;\n\treturn getstr(s1, s2, A - B%A, B%A);\n}\nstring getstr(string sa, string sb, string sc, int A, int B, int C) {\n\tif (A == 0) return getstr(sb, sc, B, C);\n\tif (B == 0) return getstr(sa, sc, A, C);\n\tif (C == 0) return getstr(sa, sb, A, B);\n\n\tstring s1 = sa;\n\tstring s2 = sa;\n\tstring s3 = sa;\n\tint c1 = C / A, c2 = c1 + 1;\n\tif (A*c1 == C) {\n\t\tfor (int i = 1; i <= c1; i++) {\n\t\t\ts1 += sc;\n\t\t\ts2 += sc;\n\t\t}\n\t\tint b1 = B / A, b2 = b1 + 1;\n\t\tfor (int i = 1; i <= b1; i++) s1 += sb;\n\t\tfor (int i = 1; i <= b2; i++) s2 += sb;\n\t\treturn getstr(s1, s2, A - B%A, B%A);\n\t}\n\telse {\n\t\tfor (int i = 1; i <= c1; i++) {\n\t\t\ts1 += sc;\n\t\t\ts2 += sc;\n\t\t}\n\t\tfor (int i = 1; i <= c2; i++) s3 += sc;\n\n\t\tint x = A - C%A, y = C%A;\n\t\tint b1 = B / x, b2 = b1 + 1;\n\t\tfor (int i = 1; i <= b1; i++) s1 += sb;\n\t\tfor (int i = 1; i <= b2; i++) s2 += sb;\n\t\treturn getstr(s1, s2, s3, x - B%x, B%x, y);\n\t}\n}\n\nint main() {\n\tint A, B, C;\n\tscanf(\"%d %d %d\", &A, &B, &C);\n\tstring ans = getstr(string(\"a\"), string(\"b\"), string(\"c\"), A, B, C);\n\treturn !printf(\"%s\\n\", ans.c_str());\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nstring solve(string a, string b, string c, int x, int y, int z) {\n\tif (y + z == 0) {\n\t\tstring res = \"\";\n\t\tfor (int i = 0; i < x; ++i) res += a;\n\t\treturn res;\n\t}\n\tif (x == 0) return solve(b, c, \"\", y, z, 0);\n\tint p = x / (y + z);\n\tint r = x % (y + z);\n\tstring A = \"\";\n\tfor (int i = 0; i < p; ++i) A += a;\n\tif (z >= r) return solve(A + a + c, A + b, A + c, r, y, z - r);\n\telse return solve(A + a + b, A + a + c, A + b, r - z, z, y + z - r);\n}\n\nint main() {\n\tint x, y, z;\n\twhile (cin >> x >> y >> z) {\n\t\tcout << solve(\"a\", \"b\", \"c\", x, y, z) << endl;\n\t}\n}\n", "#include <string>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nstring eval(string s) {\n\tint n = s.size();\n\ts += s;\n\tstring ans = \"~\";\n\tfor (int i = 0; i < n; ++i) {\n\t\tans = min(ans, s.substr(i, n));\n\t}\n\treturn ans;\n}\nint main() {\n\tint X, Y, Z;\n\tcin >> X >> Y >> Z;\n\tint N = X + Y + Z;\n\tstring ans = string(X, 'a') + string(Y, 'b') + string(Z, 'c');\n\tstring cur_ev = eval(ans);\n\twhile (true) {\n\t\t// 2-opt\n\t\tbool found = false;\n\t\tfor (int i = 0; i < N && !found; ++i) {\n\t\t\tfor (int j = 1; j < N && !found; ++j) {\n\t\t\t\tfor (int k = 0; k <= N - j; ++k) {\n\t\t\t\t\tstring cyclic = ans.substr(i) + ans.substr(0, i);\n\t\t\t\t\tstring nxt = cyclic.substr(j, k) + cyclic.substr(0, j) + cyclic.substr(j + k);\n\t\t\t\t\tstring ev = eval(nxt);\n\t\t\t\t\tif (ev > cur_ev) {\n\t\t\t\t\t\tcur_ev = ev;\n\t\t\t\t\t\tans = nxt;\n\t\t\t\t\t\tfound = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!found) break;\n\t}\n\tcout << cur_ev << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef pair<int,P> P1;\ntypedef pair<P,P> P2;\ntypedef pair<double,int>Q;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define eps 1e-7\n#define INF 1000000000\n#define mod 1000000007\n#define fi first\n#define sc second\n#define rep(i,x) for(int i=0;i<x;i++)\n#define repn(i,x) for(int i=1;i<=x;i++)\n#define SORT(x) sort(x.begin(),x.end())\n#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())\nint a,b,c;\nstring rec(int x,int y,int z,string X,string Y,string Z){\n\tif(x==0&&y==0&&z==0) return \"\";\n\tif(x==0&&y==0) return rec(z,0,0,Z,\"\",\"\");\n\tif(x==0) return rec(y,z,0,Y,Z,\"\");\n\tif(y==0&&z==0){\n\t\tstring ret=\"\";\n\t\trep(i,x) ret += X;\n\t\treturn ret;\n\t}\n\tif(z==0) return rec(x,z,y,X,Z,Y);\n\tif(x >= z){\n\t\treturn rec(x-z,z,y,X,X+Z,Y);\n\t}\n\telse{\n\t\treturn rec(x,y,z-x,X+Z,Y,Z);\n\t}\n}\nint main(){\n\tcin >> a >> b >> c;\n\tcout << rec(a,b,c,\"a\",\"b\",\"c\") << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nstring s[55];\nint n,a,b,c;\n\nint main(){\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\twhile(a--)s[++n]=\"a\";\n\twhile(b--)s[++n]=\"b\";\n\twhile(c--)s[++n]=\"c\";\n\ts[51]=\"cgz ak ioi\";\n\ts[52]=\"ABS ak ioi\";\n\twhile(n>1){\n\t\tint mi=51,mx=52;\n\t\tfor(int i=1;i<=n;++i){\n\t\t\tif(s[i]<s[mi])mi=i;\n\t\t\tif(s[i]>=s[mx])mx=i;\n\t\t}\n\t\ts[mi]+=s[mx];\n\t\tswap(s[mx],s[n--]);\n\t}\n\tcout << s[1] << endl;\n\treturn 0;\n}", "#include <cstdio>\n#include <vector>\n#include <stack>\n#include <iostream>\n#include <string>\n#include <tuple>\n#include <random>\n#include <map>\n#include <queue>\n#include <set>\n#include <complex>\n#include <algorithm>\n#include <cassert>\n#include <tuple> \n#include <iterator>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef tuple<ll, ll, ll> T;\n\nint main(){\n\tll X, Y, Z;\n\tcin >> X >> Y >> Z;\n\tvector<string> v;\n\tfor(int i=0;i<X;i++)\n\t\tv.push_back(\"a\");\n\tfor(int i=0;i<Y;i++)\n\t\tv.push_back(\"b\");\n\tfor(int i=0;i<Z;i++)\n\t\tv.push_back(\"c\");\n\twhile(v.size()>1){\n\t\tv[0] = v[0] + v.back();\n\t\tv.pop_back();\n\t\tsort(v.begin(), v.end());\n\t}\n\tcout << v[0] << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\ninline int getint() {\n register char ch;\n while(!isdigit(ch=getchar()));\n register int x=ch^'0';\n while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');\n return x;\n}\nint main() {\n std::multiset<std::string> set;\n for(register int i=getint();i;i--) set.insert(\"a\");\n for(register int i=getint();i;i--) set.insert(\"b\");\n for(register int i=getint();i;i--) set.insert(\"c\");\n while(set.size()>1){\n std::string s=*set.begin(),t=*set.rbegin();\n set.erase(set.lower_bound(s));\n set.erase(set.lower_bound(t));\n set.insert(s+t);\n }\n std::cout<<*set.begin();\n} ", "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <queue>\n#include <math.h>\n#include <algorithm>\n#include <map>\n#include <set>\nusing namespace std;\n// std::ios::sync_with_stdio(false);\ntypedef long long LL;\nconst LL N = 107;\nconst int M = 2000005;\nconst int INF = 0x3f3f3f3f;\nconst double Pi = acos(-1);\nint n,m;\nint t[5];\nmultiset <string> st;\nstring ch(int x)\n{\n if (x==0)\n return \"a\";\n if (x==1)\n return \"b\";\n return \"c\";\n}\nint main()\n{\n cin.tie(0);\n std::ios::sync_with_stdio(false);\n while (cin>>t[0]>>t[1]>>t[2])\n {\n st.clear();\n for (int i=0;i<3;i++)\n for (int j=0;j<t[i];j++)\n st.insert(ch(i));\n while (st.size()>1)\n {\n multiset <string>::iterator l = st.begin();\n multiset <string>::iterator r = --st.end();\n st.insert(*l+*r);\n st.erase(l);\n st.erase(r);\n }\n cout<<*st.begin()<<endl;\n }\n return 0;\n}\n\n/*\n\n\n*/\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nmultiset<string> s;\n\nint main()\n{\n\tint a, b, c, all = 0;\n\tscanf(\"%d %d %d\", &a, &b, &c);\n\tall = a + b + c;\n\twhile(a--) s.insert(\"a\");\n\twhile(b--) s.insert(\"b\");\n\twhile(c--) s.insert(\"c\");\n\twhile(1)\n\t{\n\t\tif(s.size() == 1) break;\n\t\tstring str = (*s.begin()) + *(--s.end());\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(str);\n\t}\n\tcout << *s.begin() << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h> \n\nusing namespace std;\n#define forn(i, n) for (int i = 0; i < int(n); i++)\n#define re return\n#define fi first\n#define mp make_pair\n#define se second\n#define sz(a) (int)a.size()\n#define prev previ\n#define tm tmmm\n#define div divv\ntypedef long long ll;\ntypedef pair<ll, ll> pll;\ntypedef pair<int, int> pii;\n\nconst int ma = 1024 * 1024;\nconst ll mod = int(1e9) + 7;\nint x = 4, y = 5, z = 8;\nstring s;\n\nint main() {\n\tiostream::sync_with_stdio(0), cin.tie(0);\n\tcin >> x >> y >> z;\n\ts = \"\";\n\tvector<string> ss;\n\tforn (i, x) {\n\t\tstring t = \"a\";\n\t\tss.push_back(t);\n\t}\n\tforn (i, y) {\n\t\tstring t = \"b\";\n\t\tss.push_back(t);\n\t}\n\tforn (i, z) {\n\t\tstring t = \"c\";\n\t\tss.push_back(t);\n\t}\n\twhile (sz(ss) > 1) {\n\t\tint k = 0;\n\t\tforn (i, sz(ss))\n\t\t\tif (ss[i] == ss[0]) k++;\n\t\tif (k == sz(ss)) break;\n\t\tfor (int i = 0; i < k && sz(ss) > k; i++) {\n\t\t\tss[i] += ss[sz(ss) - 1];\n\t\t\tss.pop_back();\n\t\t}\n\n\t\tsort(ss.begin(), ss.end());\n\t}\n\tforn (i, sz(ss)) cout << ss[i];\n}", "#include<cstdio>\n#include<cstring>\n#include<set>\n#include<algorithm>\nusing namespace std;\nchar s[100][100];\nstruct shion\n{\n\tint x;\n\tshion(){}\n\tshion(int x):x(x){}\n\tbool operator < (const shion &a)const{return strcmp(s[x],s[a.x])<0;}\n}s1,s2;\nint pa;\nmultiset<shion>se;\nmultiset<shion>::iterator it;\nint xi;\nint main()\n{\n\tscanf(\"%d\",&xi);while(xi--)s[++pa][0]='a',se.insert(shion(pa));\n\tscanf(\"%d\",&xi);while(xi--)s[++pa][0]='b',se.insert(shion(pa));\n\tscanf(\"%d\",&xi);while(xi--)s[++pa][0]='c',se.insert(shion(pa));\n\twhile(se.size()>1)\n\t{\n\t\tit=se.begin(),s1=*it,se.erase(it);\n\t\tit=se.end(),it--,s2=*it,se.erase(it);\n\t\tint x=s1.x,y=s2.x;\n\t\tstrcat(s[x],s[y]);\n\t\tse.insert(shion(x));\n\t}\n\tit=se.begin();\n\ts1=*it;\n\tint x=s1.x;\n\tprintf(\"%s\\n\",s[x]);\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nchar a[55],b[55];\nint A,B,C,n,m;\nbool f;\nvoid dfs(int x,int y,int z){\n\tmemset(b,0,sizeof(b));\n\tint k=0;\n\tif(!y&&!z){\n\t\tk=x;for(int i=0;i<x;i++)b[i]='a';\n\t}else if(!x){\n\t\tdfs(y,z,0);\n\t\tk=m;\n\t\tfor(int i=0;i<m;i++)if(a[i]=='a')b[i]='b';else if(a[i]=='b')b[i]='c';\n\t}else if(x<=z){\n\t\tdfs(x,y,z-x);\n\t\tfor(int i=0;i<m;i++)if(a[i]=='a')b[k++]='a',b[k++]='c';else b[k++]=a[i];\n\t}else if(x<=y+z){\n\t\tdfs(x-z,z,y-x+z);\n\t\tfor(int i=0;i<m;i++)if(a[i]=='a')b[k++]='a',b[k++]='b';else if(a[i]=='b')b[k++]='a',b[k++]='c';else b[k++]='b';\n\t}else{\n\t\tdfs(x-y-z,y,z);\n\t\tfor(int i=0;i<m;i++)if(a[i]=='a')b[k++]='a';else if(a[i]=='b')b[k++]='a',b[k++]='b';else b[k++]='a',b[k++]='c';\n\t}\n\tmemcpy(a,b,sizeof(a));m=k;\n}\nint main(){\n\tscanf(\"%d%d%d\",&A,&B,&C);n=A+B+C;\n\tdfs(A,B,C);\n\tprintf(\"%s\\n\",a);\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define SZ(v) ((int)(v).size())\n#define ALL(v) (v).begin(),(v).end()\n#define one first\n#define two second\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<double, double> pd;\ntypedef pair<int, int> pi; typedef pair<ll, int> pli;\ntypedef pair<ll, ll> pll; typedef pair<ll, pi> plp;\ntypedef pair<int, pi> pip; typedef tuple<int, int, int> ti;\nconst int INF = 0x3f2f1f0f;\nconst ll LINF = 1ll * INF * INF;\n\nint A, B, C;\n\nint main() {\n\tcin >> A >> B >> C;\n\tmultiset<string> S;\n\tfor(int i=0; i<A; i++) S.insert(\"a\");\n\tfor(int i=0; i<B; i++) S.insert(\"b\");\n\tfor(int i=0; i<C; i++) S.insert(\"c\");\n\n\tfor(int k=0; k<A+B+C-1; k++) {\n\t\tstring l = *S.begin();\n\t\tauto it = S.end(); it--;\n\t\tstring r = *it;\n\t\tS.erase(S.begin());\n\t\tS.erase(it);\n\t\tS.insert(l+r);\n\t}\n\tcout << *S.begin() << endl;\n\treturn 0;\n}\n", "// start fold\n#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<algorithm>\n#include<vector>\n#include<cstring>\n#include<set>\n#include<map>\n#include<cmath>\n#include<queue>\n#include<bitset>\nusing namespace std;\n#define ri register int\n#define il inline\n#define LL long long\n#define ull unsigned long long\n#define pb push_back\n#define mp make_pair\n#define pii pair<int,int>\n#define fi first\n#define se second\n#define enter putchar('\\n')\n#define size(x) ((int)x.size())\n#define mem0(x) memset(x,0,sizeof(x))\ntemplate<class T>il void in(T &x)\n{\n\tx=0; short f=1; char c=getchar();\n\twhile(c<'0'||c>'9')\n\t{\n\t\tif(c=='-') f=-1;\n\t\tc=getchar();\n\t}\n\twhile(c>='0'&&c<='9') x=x*10+(c^'0'),c=getchar();\n\tx*=f;\n}\ntemplate <typename T,typename ...Args>il void in(T &x, Args &...args)\n{\n\tin(x); in(args...);\n}\ntemplate<class T>il void out(T x,const char c='\\n')\n{\n\tstatic short st[30];\n\tshort m=0;\n\tif(x<0) putchar('-'),x=-x;\n\tdo st[++m]=x%10,x/=10; while(x);\n\twhile(m) putchar(st[m--]|'0');\n\tputchar(c);\n}\ntemplate <typename T,typename ...Args>il void out(const T &x,const Args &...args)\n{\n\tout(x,' '); out(args...);\n}\ntemplate<class T>il void print(T a[],int n)\n{\n\tif(n<=0) return;\n\tfor(ri i=0; i<n; ++i) out(a[i],' ');\n\tenter;\n}\nnamespace i207M\n{\n// end fold\nint a,b,c;\nmultiset<string>s;\nsigned main()\n{\n#ifdef M207\n\tfreopen(\"in.in\",\"r\",stdin);\n\t// freopen(\"out.out\",\"w\",stdout);\n#endif\n\tin(a,b,c);\n\tfor(ri i=1; i<=a; ++i) s.insert(\"a\");\n\tfor(ri i=1; i<=b; ++i) s.insert(\"b\");\n\tfor(ri i=1; i<=c; ++i) s.insert(\"c\");\n\twhile(size(s)>1)\n\t{\n\t\tstring t=*s.begin()+*s.rbegin();\n\t\ts.erase(s.begin()),s.erase(--s.end());\n\t\ts.insert(t);\n\t}\n\tcout<<*s.begin();\n\treturn 0;\n}\n// start fold\n}\nsigned main()\n{\n\ti207M::main();\n\treturn 0;\n}\n// end fold", "#pragma GCC optimize(3,\"Ofast\",\"inline\")\n#define R register\n#include<iostream>\n#include<set>\n#include<cstring>\nstd::multiset <std::string> M;\nstd::multiset <std::string> :: iterator del;\nint X,Y,Z;\nint main(void){\n\tstd::cin>>X>>Y>>Z;\n\tfor(R int i=X;i>0;i--)\n\t\tM.insert(\"a\");\n\tfor(R int i=Y;i>0;i--)\n\t\tM.insert(\"b\");\n\tfor(R int i=Z;i>0;i--)\n\t\tM.insert(\"c\");\n\twhile(M.size()>=2){\n\t\tstd::string start=*M.begin(),ending=*M.rbegin();\n\t\tdel=M.lower_bound(start);\n\t\tM.erase(del);\n\t\tdel=M.lower_bound(ending);\n\t\tM.erase(del);\n\t\tM.insert(start+ending);\n\t}\n\tstd::cout<<*M.begin()<<std::endl;\n\treturn 0;\n}", " #include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n#include <map>\n#include <string>\n#include <cstring>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <ctime>\n#include <bitset>\n#include <utility>\n#include <assert.h>\nusing namespace std;\n#define rank rankk\n#define mp make_pair\n#define pb push_back\n#define xo(a,b) ((b)&1?(a):0)\n#define tm tmp\n//#pragma comment(linker, \"/STACK:1024000000,1024000000\") \n//#define LL ll\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef long long ll;\ntypedef pair<ll,int> pli;\ntypedef pair<ll,ll> pll;\nconst int INF=0x3f3f3f3f;\nconst ll INFF=0x3f3f3f3f3f3f3f3fll;\nconst int MAX=5e5+10;\n//const ll MAXN=2e8;\n//const int MAX_N=MAX;\nconst ll MOD=1e9+7;\n//const long double pi=acos(-1.0);\n//const double eps=0.00000001;\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\ntemplate<typename T>inline T abs(T a) {return a>0?a:-a;}\ntemplate<class T> inline\nvoid read(T& num) {\n bool start=false,neg=false;\n char c;\n num=0;\n while((c=getchar())!=EOF) {\n if(c=='-') start=neg=true;\n else if(c>='0' && c<='9') {\n start=true;\n num=num*10+c-'0';\n } else if(start) break;\n }\n if(neg) num=-num;\n}\ninline ll powMM(ll a,ll b,ll M){\n ll ret=1;\n a%=M;\n// b%=M;\n while (b){\n if (b&1) ret=ret*a%M;\n b>>=1;\n a=a*a%M;\n }\n return ret;\n}\nvoid open()\n{\n// freopen(\"1009.in\",\"r\",stdin);\n freopen(\"out.txt\",\"w\",stdout);\n}\nint x,y,z;\nvector<string>s;\nint main()\n{\n scanf(\"%d%d%d\",&x,&y,&z);\n for(int i=0;i<x;i++)s.pb(\"a\");\n for(int i=0;i<y;i++)s.pb(\"b\");\n for(int j=0;j<z;j++)s.pb(\"c\");\n while(s.size()>1)\n {\n sort(s.begin(),s.end());\n s[0]+=s[s.size()-1];\n s.pop_back();\n }\n cout<<s[0]<<\"\\n\";\n}\n/*\n8\n11011011\n*/\n", "#include<iostream>\n#include<algorithm>\n#include<iomanip>\n#include<cstring>\n#include<cstdio>\n#include<cmath> \n#include<set>\n#include<cctype>\n\nusing namespace std;\n\nconst int N=1e3+50;\n\nmultiset <string> v;\n\nint a,b,c;\n\nint main()\n{\n\t\n\n\tcin>>a>>b>>c;\n\tfor(int i=1;i<=a;i++)\n\t v.insert(\"a\");\n\tfor(int i=1;i<=b;i++)\n\t v.insert(\"b\");\n\tfor(int i=1;i<=c;i++)\n\t v.insert(\"c\");\n\twhile(v.size()>1)\n\t{\n\t\tstring x=*v.begin();\n\t\tstring y=*v.rbegin();\n\t\tv.erase(v.lower_bound(x));\n\t\tv.erase(v.lower_bound(y));\n\t\tv.insert(x+y); \n\t}\n\tcout<<*v.begin();\n}", "#include<iostream>\n#include<cmath>\n#include<cstring>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\nstring A[3],B[10];\nint x[3],y[10];\nstring solve(){\n\tif (x[1]==0&&x[2]==0){\n\t\tstring ans=\"\";\n\t\tfor (int i=1;i<=x[0];i++) ans=ans+A[0];\n\t\treturn ans;\n\t}\n\tmemset(y,0x00,sizeof y);\n\tint num=x[2]/x[0];\n\tfor (int i=1;i<=num;i++) A[0]=A[0]+A[2];\n\tA[2]=A[0]+A[2];\n\tint ne=x[2]%x[0]; x[0]-=ne; x[2]=ne;\n\tnum=x[1]/x[0];\n\tfor (int i=1;i<=num;i++) A[0]=A[0]+A[1];\n\tA[1]=A[0]+A[1];\n\tne=x[1]%x[0]; x[0]-=ne; x[1]=ne;\n\treturn solve();\n}\nint main(){\n\tfor (int i=0;i<3;i++) scanf(\"%d\",&x[i]); \n\tA[0]='a'; A[1]='b'; A[2]='c';\n\tif (x[0]==0){\n\t\tx[0]=x[1]; x[1]=x[2];\n\t\tA[0]=A[1]; A[1]=A[2];\n\t\tx[2]=0;\n\t}\n\tif (x[0]==0){\n\t\tx[0]=x[1]; x[1]=x[2];\n\t\tA[0]=A[1]; A[1]=A[2];\n\t\tx[2]=0;\n\t}\n\tcout<<solve()<<endl;\n}", "#ifndef BZ\n#pragma GCC optimize \"-O3\"\n#endif\n#include <bits/stdc++.h>\n\n#define FASTIO\n\n#ifdef FASTIO\n#define scanf abacaba\n#define printf abacaba\n#endif\n\ntypedef long long ll;\ntypedef long long llong;\ntypedef long double ld;\ntypedef unsigned long long ull;\n\nusing namespace std;\n\n\n/*\nll pw(ll a, ll b) {\n\tll ans = 1; while (b) {\n\t\twhile (!(b & 1)) b >>= 1, a = (a * a) % MOD;\n\t\tans = (ans * a) % MOD, --b;\n\t} return ans;\n}\n*/\n\nstring solve(string sa, int a, string sb, int b, string sc, int c) {\n\tif (a == 0) {\n\t\treturn solve(sb, b, sc, c, \"\", 0);\n\t}\n\tif (a <= b + c) {\n\t\tvector<string> vv(a, sa);\n\t\tint g = c / a;\n\t\tfor (int i = 0; i < vv.size(); ++i)\n\t\t\tfor (int j = 0; j < g; ++j)\n\t\t\t\tvv[i] += sc;\n\t\tg = a - c % a;\n\t\tfor (int i = g; i < a; ++i)\n\t\t\tvv[i] += sc;\n\t\tfor (int i = 0; i < b; ++i)\n\t\t\tvv[i % g] += sb;\n\t\tsort(vv.begin(), vv.end());\n\t\tvector<pair<string, int> > go;\n\t\tint cur = 0;\n\t\tfor (int i = 0; i < vv.size(); ++i) {\n\t\t\t++cur;\n\t\t\tif (i == vv.size() - 1 || vv[i + 1] != vv[i]) {\n\t\t\t\tgo.push_back(make_pair(vv[i], cur));\n\t\t\t\tcur = 0;\n\t\t\t}\n\t\t}\n\t\twhile (go.size() < 3)\n\t\t\tgo.push_back(make_pair(\"\", 0));\n\t\treturn solve(go[0].first, go[0].second, go[1].first, go[1].second, go[2].first, go[2].second);\n\t}\n\telse {\n\t\tif (b + c == 0) {\n\t\t\tstring ans;\n\t\t\tfor (int i = 0; i < a; ++i)\n\t\t\t\tans += sa;\n\t\t\treturn ans;\n\t\t}\n\t\tvector<string> vv(b + c);\n\t\tfor (int i = 0; i < a; ++i)\n\t\t\tvv[i % (b + c)] += sa;\n\t\tfor (int i = 0; i < c; ++i)\n\t\t\tvv[i] += sc;\n\t\tfor (int i = 0; i < b; ++i)\n\t\t\tvv[c + i] += sb;\n\t\tsort(vv.begin(), vv.end());\n\t\tvector<pair<string, int> > go;\n\t\tint cur = 0;\n\t\tfor (int i = 0; i < vv.size(); ++i) {\n\t\t\t++cur;\n\t\t\tif (i == vv.size() - 1 || vv[i + 1] != vv[i]) {\n\t\t\t\tgo.push_back(make_pair(vv[i], cur));\n\t\t\t\tcur = 0;\n\t\t\t}\n\t\t}\n\t\twhile (go.size() < 3)\n\t\t\tgo.push_back(make_pair(\"\", 0));\n\t\treturn solve(go[0].first, go[0].second, go[1].first, go[1].second, go[2].first, go[2].second);\n\t}\n}\n\nint main() {\n#ifdef FASTIO\n\tios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n#endif\n\tint a, b, c;\n\tcin >> a >> b >> c;\n\tcout << solve(\"a\", a, \"b\", b, \"c\", c) << \"\\n\";\n\treturn 0;\n}\n\n\n", "#include <cstdio>\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#include <map>\nusing namespace std;\n\nint a, b, c, xa, xb, xc;\nstring AA, BB, CC, ss[110];\n\nvoid iter() {\n\tfor (int i = 0; i < a; i++)\n\t\tss[i] = AA;\n\t// int now = 0;\n\tfor (int i = 0; i < c; i++) {\n\t\tss[i % a] += CC;\n\t}\n\tint ll = 0;\n\tif (c % a == 0)\n\t\tll = 0;\n\telse\n\t\tll = (c - 1) % a + 1;\n\tint now = ll;\n\tfor (int i = 0; i < b; i++) {\n\t\tss[now] += BB;\n\t\tnow += 1;\n\t\tif (now >= a)\n\t\t\tnow = ll;\n\t}\n\tsort(ss, ss + a);\n\t// for ()\n\tint cnt = 0;\n\txa = xb = xc = 0;\n\tfor (int i = 0; i < a; i++) {\n\t\tif (i == 0 || ss[i] != ss[i - 1]) {\n\t\t\tcnt += 1;\n\t\t\tif (cnt == 1)\n\t\t\t\tAA = ss[i];\n\t\t\telse if (cnt == 2)\n\t\t\t\tBB = ss[i];\n\t\t\telse CC = ss[i];\n\t\t}\n\t\tif (cnt == 1)\n\t\t\txa += 1;\n\t\telse if (cnt == 2)\n\t\t\txb += 1;\n\t\telse xc += 1;\n\t}\n\ta = xa;\n\tb = xb;\n\tc = xc;\n}\n\nstring solve() {\n\tAA = \"a\";\n\tBB = \"b\";\n\tCC = \"c\";\n\tif (a == 0) {\n\t\ta = b; b = c; c = 0;\n\t\tAA = BB; BB = CC;\n\t}\n\tstring ans = \"\";\n\tif (a == 0) {\n\t\tfor (int i = 0; i < c; i++)\n\t\t\tans += \"c\";\n\t\t// printf(\"\\n\");\n\t\t// return 0;\n\t\treturn ans;\n\t}\n\twhile (b + c > 0) {\n\t\titer();\n\t}\n\twhile (a--) {\n\t\t// cout << AA;\n\t\tans += AA; \n\t\t// return\n\t}\n\treturn ans;\n\t// cout << endl;\n}\n\nint main() {\n\tscanf(\"%d%d%d\", &a, &b, &c);\n\t// for (int aa = 0; aa <= 50; aa++)\n\t// \tfor (int bb = 0; bb <= 50; bb++)\n\t// \t\tfor (int cc = 0; cc <= 50; cc++)\n\t// \t\t\tif (aa + bb + cc > 0 && aa + bb + cc <= 50) {\n\t// \t\t\t\t// int aa = a, bb = b, cc = c;\n\t// \t\t\t\ta = aa;\n\t// \t\t\t\tb = bb;\n\t// \t\t\t\tc = cc;\n\t// \t\t\t\tcout << aa << ' ' << bb << ' ' << cc << ' '<< solve() << endl;;\n\t// \t\t\t}\n\tstring ans = solve();\n\tcout << ans << endl;\n}\n", "#include <iostream>\n#include <stdio.h>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <limits.h>\n#include <math.h>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n\n#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))\n#define debug(x) cerr << #x << \": \" << x << '\\n'\n#define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << \"[\" << i << \"]: \" << x[i] << '\\n'\n#define debugArrayP(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << \"[\" << i << \"]: \" << x[i].first<< \" \" << x[i].second << '\\n'\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> Pii;\ntypedef vector<int> vint;\ntypedef vector<ll> vll;\nconst ll INF = INT_MAX;\nconst ll MOD = 1e9+7;\n\n\nint main(){\n int X,Y,Z;cin>>X>>Y>>Z;\n vector<string> v(X+Y+Z);\n repeat(i,X)v[i]=\"a\";\n repeat(i,Y)v[X+i]=\"b\";\n repeat(i,Z)v[X+Y+i]=\"c\";\n while(v.size()>1){\n sort(v.begin(),v.end());\n v[0]+=v.back();\n v.pop_back();\n }\n cout<<v[0]<<endl;\n return 0;\n}\n", "#include<cstdio>\n#include<set>\n#include<string>\nusing namespace std;\nmultiset<string>s;\nint main(){\n\tint aa,bb,cc,p=0;\n\tscanf(\"%d%d%d\",&aa,&bb,&cc);\n\tp=aa+bb+cc;\n\tfor(;aa--;)s.insert(\"a\");\n\tfor(;bb--;)s.insert(\"b\");\n\twhile(cc--)s.insert(\"c\");\n\twhile(--p){\n\t\tauto st=(*s.begin())+*(--s.end());\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(st);\n\t}\n\tputs((*s.begin()).c_str());\n\treturn 0;\n}", "#include<deque>\n#include<queue>\n#include<vector>\n#include<algorithm>\n#include<iostream>\n#include<set>\n#include<cmath>\n#include<tuple>\n#include<string>\n#include<chrono>\n#include<functional>\n#include<iterator>\n#include<random>\n#include<unordered_set>\n#include<array>\n#include<map>\n#include<iomanip>\n#include<assert.h>\n#include<bitset>\n#include<stack>\n#include<memory>\nusing namespace std;\ntypedef long long int llint;\ntypedef long double lldo;\n#define mp make_pair\n#define mt make_tuple\n#define pub push_back\n#define puf push_front\n#define pob pop_back\n#define pof pop_front\n#define fir first\n#define sec second\n#define res resize\n#define ins insert\n#define era erase\n/*\ncout<<setprecision(20);\ncin.tie(0);\nios::sync_with_stdio(false);\n*/\nconst llint mod=1000000007;\nconst llint big=2.19e15+1;\nconst long double pai=3.141592653589793238462643383279502884197;\nconst long double eps=1e-15;\ntemplate <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}\ntemplate <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\ntemplate<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\ntemplate<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\nint main(void){\n\t//最小に最大をつなげる\n\tvector<string>sts;\n\tint a,b,c,i;cin>>a>>b>>c;\n\twhile(a--){sts.pub(\"a\");}\n\twhile(b--){sts.pub(\"b\");}\n\twhile(c--){sts.pub(\"c\");}\n\twhile(sts.size()>1){\n\t\tint syox=0;\n\t\tint daix=0;\n\t\tfor(i=1;i<sts.size();i++){\n\t\t\tif(sts[syox]>sts[i]){syox=i;}\n\t\t\telse if(sts[daix]<sts[i]){daix=i;}\n\t\t\telse if(syox==daix&&sts[daix]==sts[i]){daix=i;}\n\t\t}\n\t\tsts[syox]+=sts[daix];\n\t\tsts[daix]=sts.back();\n\t\tsts.pob();\n\t\t//for(auto it:sts){cout<<it<<\" \";}cout<<endl;\n\t}\n\tcout<<sts[0]<<endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint a,b,c;\nmultiset<string> S;\nstring s1,s2,t;\n\nint main()\n{\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tfor (int i=1;i<=a;i++) S.insert(\"a\");\n\tfor (int i=1;i<=b;i++) S.insert(\"b\");\n\tfor (int i=1;i<=c;i++) S.insert(\"c\");\n\tfor (int i=1;i<a+b+c;i++) {\n\t\tt=*S.begin()+*(--S.end());\n\t\tS.erase(S.begin()); S.erase(--S.end());\n\t\tS.insert(t);\n\t}\n\tcout << *S.begin();\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint a,b,c;\nmultiset<string> s;\nint main() {\n scanf(\"%d%d%d\",&a,&b,&c);\n for (int i=1;i<=a;++i) s.insert(\"a\");\n for (int i=1;i<=b;++i) s.insert(\"b\");\n for (int i=1;i<=c;++i) s.insert(\"c\");\n for (int i=1;i<a+b+c;++i) {\n auto l=s.begin(),r=s.end();r--;\n s.insert(*l+*r);\n s.erase(l);s.erase(r);\n }\n printf(\"%s\\n\",s.begin()->c_str());\n return 0;\n}", "#define _USE_MATH_DEFINES\n#include <cassert>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <list>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <algorithm>\n#include <complex>\n#include <cmath>\n#include <numeric>\n#include <bitset>\n\nusing namespace std;\n\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\n cerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\n const char* comma = strchr(names + 1, ',');\n cerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n __f(comma + 1, args...);\n}\n\ntypedef long long int64;\ntypedef pair<int, int> ii;\nconst int INF = 1 << 30;\nconst int MOD = 1e9 + 7;\n\nint main() {\n int x, y, z;\n cin >> x >> y >> z;\n multiset<string> A;\n for (int i = 0; i < x; ++i) A.insert(\"a\");\n for (int i = 0; i < y; ++i) A.insert(\"b\");\n for (int i = 0; i < z; ++i) A.insert(\"c\");\n for (int k = 1; k < x + y + z; ++k) {\n auto it1 = A.begin();\n auto it2 = prev(A.end());\n auto s = *it1 + *it2;\n A.erase(it1);\n A.erase(it2);\n A.insert(s);\n }\n cout << *A.begin() << endl;\n return 0;\n}\n", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <algorithm>\n#include <set>\n\nusing namespace std;\n\n#define rint register int\n#define gc() getchar()\ninline int read(rint ans = 0, rint sgn = ' ', rint ch = gc())\n{\n\tfor(; ch < '0' || ch > '9'; sgn = ch, ch = gc());\n\tfor(; ch >='0' && ch <='9';(ans*=10)+=ch-'0', ch = gc());\n\treturn sgn-'-'?ans:-ans;\n}\nmultiset<string> s; int X, Y, Z; string L, T = \"\\0\";\nint main()\n{\n\tX = read(), Y = read(), Z = read();\n\tfor(rint i = 1; i <= X; s.insert(\"a\"), i++);\n\tfor(rint i = 1; i <= Y; s.insert(\"b\"), i++);\n\tfor(rint i = 1; i <= Z; s.insert(\"c\"), i++);\n\tfor(; s.size() >= 2; L = *s.begin()+*--s.end(), s.erase(s.begin()), s.erase(--s.end()), s.insert(L));\n\tif(s.size()) T = *s.begin(); cout << T << endl; return 0;\n}", "#include<set>\n#include<map>\n#include<list>\n#include<queue>\n#include<stack>\n#include<string>\n#include<math.h>\n#include<time.h>\n#include<vector>\n#include<bitset>\n#include<memory>\n#include<utility>\n#include<fstream>\n#include<stdio.h>\n#include<sstream>\n#include<iostream>\n#include<stdlib.h>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\nstring ans;\nvoid dfs(int a,int b,int c,string aa,string bb,string cc)\n{\n string nowa,nowb,nowc;\n if (a==0)\n {\n dfs(b,c,0,bb,cc,\"\");\n return;\n }\n if ((b==0)&&(c==0))\n {\n int i;\n for (i=0;i<a;i++)\n {\n ans+=aa;\n }\n return;\n }\n nowa=aa;\n int j;\n for (j=0;j<c/a;j++)\n {\n nowa+=cc;\n }\n int newc=c%a;\n nowc=nowa+cc;\n a-=newc;\n for (j=0;j<b/a;j++)\n {\n nowa+=bb;\n }\n int newb=b%a;\n nowb=nowa+bb;\n a-=newb;\n dfs(a,newb,newc,nowa,nowb,nowc);\n}\nint main()\n{\n #ifdef absi2011\n freopen(\"input.txt\",\"r\",stdin);\n freopen(\"output.txt\",\"w\",stdout);\n #endif\n int a,b,c;\n scanf(\"%d%d%d\",&a,&b,&c);\n dfs(a,b,c,\"a\",\"b\",\"c\");\n cout<<ans<<endl;\n return 0;\n}\n", "#include<cmath>\n#include<math.h>\n#include<ctype.h>\n#include<algorithm>\n#include<bitset>\n#include<cassert>\n#include<cctype>\n#include<cerrno>\n#include<cfloat>\n#include<ciso646>\n#include<climits>\n#include<clocale>\n#include<complex>\n#include<csetjmp>\n#include<csignal>\n#include<cstdarg>\n#include<cstddef>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<ctime>\n#include<cwchar>\n#include<cwctype>\n#include<deque>\n#include<exception>\n#include<fstream>\n#include<functional>\n#include<iomanip>\n#include<ios>\n#include<iosfwd>\n#include<iostream>\n#include<istream>\n#include<iterator>\n#include<limits>\n#include<list>\n#include<locale>\n#include<map>\n#include<memory>\n#include<new>\n#include<numeric>\n#include<ostream>\n#include<queue>\n#include<set>\n#include<sstream>\n#include<stack>\n#include<stdexcept>\n#include<streambuf>\n#include<string>\n#include<typeinfo>\n#include<utility>\n#include<valarray>\n#include<vector>\n#include<string.h>\n#include<stdlib.h>\n#include<stdio.h>\nusing namespace std;\nint a,b,c;\nmultiset<string> s;\nint main()\n{\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tfor (int i=0;i<a;i++)\n\t{\n\t\ts.insert(\"a\");\n\t}\n\tfor (int i=0;i<b;i++)\n\t{\n\t\ts.insert(\"b\");\n\t}\n\tfor (int i=0;i<c;i++)\n\t{\n\t\ts.insert(\"c\");\n\t}\n\tmultiset<string>::iterator it;\n\twhile (s.size()!=1)\n\t{\n\t\tstring x=*s.begin();\n\t\tstring y=*s.rbegin();\n\t\tit=s.find(x);\n\t\ts.erase(it);\n\t\tit=s.find(y);\n\t\ts.erase(it);\n\t\ts.insert(x+y);\n\t}\n\tcout<<*s.begin()<<endl;\n return 0;\n}\n//直道相思了无益，未妨惆怅是清狂。\n//——李商隐《无题》", "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define int ll\n\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,b) rng(i,0,b)\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\n#define per(i,b) gnr(i,0,b)\n#define pb push_back\n#define eb emplace_back\n#define a first\n#define b second\n#define bg begin()\n#define ed end()\n#define all(x) x.bg,x.ed\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\n\ntemplate<class t> using vc=vector<t>;\ntemplate<class t> using vvc=vc<vc<t>>;\n\nusing pi=pair<int,int>;\nusing vi=vc<int>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.a<<\",\"<<p.b<<\"}\";\n}\n\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\n#define mp make_pair\n#define mt make_tuple\n#define one(x) memset(x,-1,sizeof(x))\n#define zero(x) memset(x,0,sizeof(x))\n#ifdef LOCAL\nvoid dmpr(ostream&os){os<<endl;}\ntemplate<class T,class... Args>\nvoid dmpr(ostream&os,const T&t,const Args&... args){\n\tos<<t<<\" \";\n\tdmpr(os,args...);\n}\n#define dmp2(...) dmpr(cerr,\"Line:\",__LINE__,##__VA_ARGS__)\n#else\n#define dmp2(...) void(0)\n#endif\n\nusing uint=unsigned;\nusing ull=unsigned long long;\n\ntemplate<int i,class T>\nvoid print_tuple(ostream&,const T&){\n}\n\ntemplate<int i,class T,class H,class ...Args>\nvoid print_tuple(ostream&os,const T&t){\n\tif(i)os<<\",\";\n\tos<<get<i>(t);\n\tprint_tuple<i+1,T,Args...>(os,t);\n}\n\ntemplate<class ...Args>\nostream& operator<<(ostream&os,const tuple<Args...>&t){\n\tos<<\"{\";\n\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\n\treturn os<<\"}\";\n}\n\nvoid print(ll x,int suc=1){\n\tcout<<x;\n\tif(suc==1)\n\t\tcout<<\"\\n\";\n\tif(suc==2)\n\t\tcout<<\" \";\n}\n\nll read(){\n\tll i;\n\tcin>>i;\n\treturn i;\n}\n\nvi readvi(int n,int off=0){\n\tvi v(n);\n\trep(i,n)v[i]=read()+off;\n\treturn v;\n}\n\ntemplate<class T>\nvoid print(const vector<T>&v,int suc=1){\n\trep(i,v.size())\n\t\tprint(v[i],i==int(v.size())-1?suc:2);\n}\n\nstring readString(){\n\tstring s;\n\tcin>>s;\n\treturn s;\n}\n\ntemplate<class T>\nT sq(const T& t){\n\treturn t*t;\n}\n\n//#define CAPITAL\nvoid yes(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"YES\"<<endl;\n\t#else\n\tcout<<\"Yes\"<<endl;\n\t#endif\n\tif(ex)exit(0);\n}\nvoid no(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"NO\"<<endl;\n\t#else\n\tcout<<\"No\"<<endl;\n\t#endif\n\tif(ex)exit(0);\n}\n\nconstexpr ll ten(int n){\n\treturn n==0?1:ten(n-1)*10;\n}\n\nconst ll infLL=LLONG_MAX/3;\n\n#ifdef int\nconst int inf=infLL;\n#else\nconst int inf=INT_MAX/2-100;\n#endif\n\nint topbit(signed t){\n\treturn t==0?-1:31-__builtin_clz(t);\n}\nint topbit(ll t){\n\treturn t==0?-1:63-__builtin_clzll(t);\n}\nint botbit(signed a){\n\treturn a==0?32:__builtin_ctz(a);\n}\nint botbit(ll a){\n\treturn a==0?64:__builtin_ctzll(a);\n}\nint popcount(signed t){\n\treturn __builtin_popcount(t);\n}\nint popcount(ll t){\n\treturn __builtin_popcountll(t);\n}\nbool ispow2(int i){\n\treturn i&&(i&-i)==i;\n}\nint mask(int i){\n\treturn (int(1)<<i)-1;\n}\n\nbool inc(int a,int b,int c){\n\treturn a<=b&&b<=c;\n}\n\ntemplate<class t> void mkuni(vc<t>&v){\n\tsort(all(v));\n\tv.erase(unique(all(v)),v.ed);\n}\n\nll rand_int(ll l, ll r) { //[l, r]\n\t#ifdef LOCAL\n\tstatic mt19937_64 gen;\n\t#else\n static random_device rd;\n static mt19937_64 gen(rd());\n #endif\n return uniform_int_distribution<ll>(l, r)(gen);\n}\n\ntemplate<class t>\nint lwb(const vc<t>&v,const t&a){\n\treturn lower_bound(all(v),a)-v.bg;\n}\n\nsigned main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tcout<<fixed<<setprecision(20);\n\t\n\tint x,y,z;cin>>x>>y>>z;\n\t\n\tmultiset<string> s;\n\trep(i,x)s.insert(\"a\");\n\trep(i,y)s.insert(\"b\");\n\trep(i,z)s.insert(\"c\");\n\twhile(s.size()>1){\n\t\tauto itr=s.bg;\n\t\tstring a=*itr;\n\t\ts.erase(itr);\n\t\titr=prev(s.ed);\n\t\ta+=*itr;\n\t\ts.erase(itr);\n\t\ts.insert(a);\n\t}\n\tcout<<*s.bg<<endl;\n}\n", "// This amazing code is by Eric Sunli Chen.\n#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntemplate<typename T> void get_int(T &x)\n{\n\tchar t=getchar();\n\tbool neg=false;\n\tx=0;\n\tfor(; (t>'9'||t<'0')&&t!='-'; t=getchar());\n\tif(t=='-')neg=true,t=getchar();\n\tfor(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';\n\tif(neg)x=-x;\n}\ntemplate<typename T> void print_int(T x)\n{\n\tif(x<0)putchar('-'),x=-x;\n\tshort a[20]= {},sz=0;\n\twhile(x>0)a[sz++]=x%10,x/=10;\n\tif(sz==0)putchar('0');\n\tfor(int i=sz-1; i>=0; i--)putchar('0'+a[i]);\n}\n#define ff first\n#define ss second\n#define pb push_back\n#define mp make_pair\n#define get1(a) get_int(a)\n#define get2(a,b) get1(a),get1(b)\n#define get3(a,b,c) get1(a),get2(b,c)\n#define printendl(a) print_int(a),puts(\"\")\ntypedef long long LL;\ntypedef unsigned long long uLL;\ntypedef pair<int,int> pii;\nconst int inf=0x3f3f3f3f;\nconst LL Linf=1ll<<61;\nconst double pi=acos(-1.0);\n\nint a,b,c;\nstring now,dp[55][55][55];\nbool ok[55][55][55];\nvoid update(int i,int j,int k,const string&s)\n{\n\tif(s+now>=now+now.substr(0,s.size()))\n\t{\n\t\tif(!ok[i][j][k])\n\t\t{\n\t\t\tok[i][j][k]=1;\n\t\t\tdp[i][j][k]=s;\n\t\t}\n\t\telse if(dp[i][j][k]<s)dp[i][j][k]=s;\n\t}\n}\nbool check()\n{\n\tmemset(ok,0,sizeof(ok));\n\tok[0][0][0]=1;dp[0][0][0]=\"\";\n\tfor(int i=0;i<=a;i++)for(int j=0;j<=b;j++)for(int k=0;k<=c;k++)\n\t{\n\t\tif(!ok[i][j][k])continue;\n\t\tif(i<a)update(i+1,j,k,'a'+dp[i][j][k]);\n\t\tif(j<b)update(i,j+1,k,'b'+dp[i][j][k]);\n\t\tif(k<c)update(i,j,k+1,'c'+dp[i][j][k]);\n\t}\n\treturn ok[a][b][c];\n}\nint main()\n{\n\tcin>>a>>b>>c;\n\tfor(int i=0;i<a+b+c;i++)now+='a';\n\tfor(int i=0,j;i<a+b+c;i++)\n\t{\n\t\tfor(j='b';j<='c';j++)\n\t\t{\n\t\t\tnow[i]=j;\n\t\t\tif(!check())break;\n\t\t}\n\t\tnow[i]=j-1;\n\t}\n\tcout<<now<<endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\ninline int getint() {\n register char ch;\n while(!isdigit(ch=getchar()));\n register int x=ch^'0';\n while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');\n return x;\n}\nint main() {\n std::multiset<std::string> set;\n for(register int i=getint();i;i--) set.insert(\"a\");\n for(register int i=getint();i;i--) set.insert(\"b\");\n for(register int i=getint();i;i--) set.insert(\"c\");\n while(set.size()>1) {\n std::string s=*set.begin(),t=*set.rbegin();\n set.erase(set.lower_bound(s));\n set.erase(set.lower_bound(t));\n set.insert(s+t);\n }\n printf(\"%s\\n\",(*set.begin()).c_str());\n return 0;\n} ", "#include \"bits/stdc++.h\"\nusing namespace std;\nmultiset < string > s;\nint a , b , c;\nint main(){\n\tcin >> a >> b >> c;\n\tfor(int i = 0 ; i < a ; ++i){\n\t\ts.insert(\"a\");\n\t}\n\tfor(int i = 0 ; i < b ; ++i){\n\t\ts.insert(\"b\");\n\t}\n\tfor(int i = 0 ; i < c ; ++i){\n\t\ts.insert(\"c\");\n\t}\n\twhile(s.size() > 1){\n\t\tstring str = (*s.begin()) + (*prev(s.end()));\n\t\ts.erase(s.begin());\n\t\ts.erase(prev(s.end()));\n\t\ts.insert(str);\n\t}\n\tcout << *(s.begin()) << endl;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\nconst int maxn = 55;\nstring res;\nint M(){\n int x, y, z;\n if(!(cin >> x >> y >> z)) return 0;\n multiset<string> v;\n for(int e = 0; e < x; e++) v.insert(\"a\");\n for(int e = 0; e < y; e++) v.insert(\"b\");\n for(int e = 0; e < z; e++) v.insert(\"c\");\n while(v.size() > 1){\n string fi = *(v.begin());\n string se = *(--v.end());\n v.erase(v.begin());\n v.erase(--v.end());\n v.insert(fi + se);\n }\n cout << *(v.begin()) << endl;\n return 1;\n}\nint main(){\n while(M());\n return 0;\n}\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**15\nmod = 10**9+7\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n\ndef main():\n x,y,z = LI()\n a = ['a' for _ in range(x)] + ['b' for _ in range(y)] + ['c' for _ in range(z)]\n while len(a) > 1:\n a.sort()\n a[0] += a[-1]\n a = a[:-1]\n\n return a[0]\n\n\nprint(main())\n\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nconst int maxn = 101;\nmultiset<string> sp;\nint main() {\n\tint x, y, z;\n\tscanf(\"%d%d%d\", &x, &y, &z);\n\twhile(x--)\n\t\tsp.insert(\"a\");\n\twhile(y--)\n\t\tsp.insert(\"b\");\n\twhile(z--)\n\t\tsp.insert(\"c\");\n\twhile(sp.size() > 1) {\n\t\tstring fir = *sp.begin();\n\t\tsp.erase(sp.begin());\n\t\tstring las = *sp.rbegin();\n\t\tsp.erase(sp.find(las));\n\t\tsp.insert(fir + las);\n\t}\n\tputs(sp.begin() -> c_str());\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb push_back\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nstring solve(int x,int y,int z){\n if(x==0){\n string s=solve(y,z,0);\n rep(i,s.size()){\n if(s[i]=='a')s[i]='b';\n else if(s[i]=='b')s[i]='c';\n }\n return s;\n }\n if(y==0&&z){\n string s=solve(x,z,0);\n rep(i,s.size()){\n if(s[i]=='b')s[i]='c';\n }\n return s;\n }\n\n if(y==0)return string(x,'a');\n\n if(z==0){\n if(x<=y){\n string s=solve(x,y%x,0);\n string t;\n rep(i,s.size()){\n if(s[i]=='a'){\n t+=\"a\";\n t+=string(y/x,'b');\n }\n else{\n t+=\"b\";\n }\n }\n return t;\n }\n string s=solve(x-y,y,0);\n string t;\n rep(i,s.size()){\n if(s[i]=='a'){\n t+=\"a\";\n }\n else{\n t+=\"ab\";\n }\n }\n return t;\n }\n\n if(x<=z){\n string s=solve(x,y,z%x);\n string t;\n rep(i,s.size()){\n if(s[i]=='a'){\n t+=\"a\";\n t+=string(z/x,'c');\n }\n else if(s[i]=='b'){\n t+=\"b\";\n }\n else{\n t+=\"c\";\n }\n }\n return t;\n }\n\n\n int q=y%(x-z);\n int p=x-z-q;\n int r=z;\n\n string s=solve(p,q,r);\n string t;\n rep(i,s.size()){\n if(s[i]=='a'){\n t+=\"a\";\n t+=string(y/(x-z),'b');\n }\n else if(s[i]=='b'){\n t+=\"a\";\n t+=string(y/(x-z)+1,'b');\n }\n else{\n t+=\"ac\";\n }\n }\n return t;\n}\n\nsigned main(){\n int X,Y,Z;\n cin>>X>>Y>>Z;\n cout<<solve(X,Y,Z)<<endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nstring a;\nmultiset <string> se;\nint main()\n{\n//\tcin >> a;\n//\tfor(int i=0;i<a.length();i++)\n//\t\tse.insert(a.substr(i,1));\n\tint x,y,z;\n\tcin >> x >> y >> z;\n\tfor(int i=1;i<=x;i++)\n\t\tse.insert(\"a\");\n\tfor(int i=1;i<=y;i++)\n\t\tse.insert(\"b\");\n\tfor(int i=1;i<=z;i++)\n\t\tse.insert(\"c\");\n\twhile(se.size()>1)\n\t{\n\t\tstring tem=*se.begin()+*--se.end();\n\t\tse.erase(se.begin());\n\t\tse.erase(--se.end());\n\t\tse.insert(tem);\n\t}\n\tcout << *se.begin() << endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n\tmultiset<std::string> set;\n\tint i;\n\tfor(cin>>i; i; i--) set.insert(\"a\");\n\tfor(cin>>i; i; i--) set.insert(\"b\");\n\tfor(cin>>i; i; i--) set.insert(\"c\");\n\twhile(set.size()>1) {\n\t\tstd::string s=*set.begin(),t=*set.rbegin();\n\t\tset.erase(set.lower_bound(s));\n\t\tset.erase(set.lower_bound(t));\n\t\tset.insert(s+t);\n\t}\n\tprintf(\"%s\\n\",(*set.begin()).c_str());\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nusing namespace std;\ntemplate<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<\"(\"<<p.fs<<\",\"<<p.sc<<\")\";}\ntemplate<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<\"sz = \"<<vc.size()<<endl<<\"[\";for(const T& v:vc) o<<v<<\",\";o<<\"]\";return o;}\nstring operator*(string a,int k){\n\tstring s;\n\trep(i,k) s += a;\n\treturn s;\n}\nstring solve(int A,int B,int C,string a,string b,string c){\n\t// puts(\"-------------\");\n\t// printf(\"A,B,C = %d,%d,%d\\n\",A,B,C);\n\t// show(a);\n\t// show(b);\n\t// show(c);\n\t// puts(\"-------------\");\n\tif(B+C==0){\n\t\treturn a*A;\n\t}\n\tif(A+C==0){\n\t\treturn b*B;\n\t}\n\tif(B+A==0){\n\t\treturn c*C;\n\t}\n\tif(A==0){\n\t\treturn solve(B,C,0,b,c,\"\");\n\t}\n\t//aaa.aaa.aaa.aa.aa.\n\tint q = A/(B+C);\n\tint r = A%(B+C);\n\tstring o = a*q;\n\tif(r<=C){\n\t\treturn solve(r,B,C-r,o+a+c,o+b,o+c);\n\t}else{\n\t\treturn solve(r-C,C,B-(r-C),o+a+b,o+a+c,o+b);\n\t}\n}\nint main(){\n\tint A,B,C;\n\tcin>>A>>B>>C;\n\tcout<<solve(A,B,C,\"a\",\"b\",\"c\")<<endl;\n}\n", "// ※※※ 解答不能 ※※※\n// snuke氏.\n// https://atcoder.jp/contests/code-festival-2017-qualb/submissions/1636517\n#include <bits/stdc++.h>\nusing namespace std;\n#define repex(i, a, b, c) for(int i = a; i < b; i += c)\n#define repx(i, a, b) repex(i, a, b, 1)\n#define rep(i, n) repx(i, 0, n)\n#define repr(i, a, b) for(int i = a; i >= b; i--)\n\nint main(){\n multiset<string> s;\n rep(i, 3){\n int n;\n scanf(\"%d\", &n);\n rep(j, n) s.insert(string(1, 'a' + i));\n }\n while(s.size() > 1){\n auto it = s.end();\n --it;\n string x = *(s.begin()) + *it;\n s.erase(it);\n s.erase(s.begin());\n s.insert(x);\n }\n string ans = *(s.begin());\n printf(\"%s\\n\", ans.c_str());\n return 0;\n}", "#include <cstdio>\n#include <iostream>\n#include <set>\nusing namespace std;\ninline char nc() {\n\tstatic char buf[100000], *l = buf, *r = buf;\n\treturn l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;\n}\ntemplate<class T> void read(T &x) {\n\tx = 0; int f = 1, ch = nc();\n\twhile(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=nc();}\n\twhile(ch>='0'&&ch<='9'){x=x*10-'0'+ch;ch=nc();}\n\tx *= f;\n}\nint X, Y, Z;\nmultiset<string> s; \nint main() {\n//\tfreopen(\"testdata.in\", \"r\", stdin);\n\tread(X), read(Y), read(Z);\n\tfor(int i = 1; i <= X; ++i) {\n\t\ts.insert(\"a\");\n\t}\n\tfor(int i = 1; i <= Y; ++i) {\n\t\ts.insert(\"b\");\n\t}\n\tfor(int i = 1; i <= Z; ++i) {\n\t\ts.insert(\"c\");\n\t}\n\tset<string> :: iterator it;\n\twhile(s.size() > 1) {\n\t\tstring a, b;\n\t\tit = s.begin(); a = *it; s.erase(it);\n\t\tit = s.end(); b = *(--it); s.erase(it);\n\t\ts.insert(a + b);\n\t}\n\tcout << *s.begin() << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)\ntemplate<class T>bool chmin(T&a,const T&b){return a>b?(a=b,true):false;}\ntemplate<class T>bool chmax(T&a,const T&b){return a<b?(a=b,true):false;}\n\nint nextInt() { int x; scanf(\"%d\", &x); return x;}\n\nint main2() {\n int X = nextInt();\n int Y = nextInt();\n int Z = nextInt();\n vector<string> v;\n REP(i, X) v.push_back(\"a\");\n REP(i, Y) v.push_back(\"b\");\n REP(i, Z) v.push_back(\"c\");\n while (v.size() > 1) {\n sort(v.begin(), v.end());\n v.front() += v.back();\n v.erase(v.begin() + v.size() - 1);\n }\n cout << v.front() << endl;\n return 0;\n}\n\nint main() {\n for (;!cin.eof();cin>>ws) main2();\n return 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long lint;\ntypedef pair<int, int> pi;\nconst int mod = 1e9 + 7;\nconst int MAXN = 4005;\n#define rend fuck\n\nint x, y, z;\nstring s;\n\nint dp[51][51][51][51];\nint link[51][3]; // -1 if failure, otherwise follow it's next\nint fail[51];\n\nbool rend[MAXN];\n\nbool f(int x, int y, int z, int m){\n\tif(m == s.size()) m = fail[m];\n\tif(x + y + z == 0) return rend[m];\n\tif(~dp[x][y][z][m]) return dp[x][y][z][m];\n\tint ret = 0;\n\tif(link[m][0] != -1 && x && f(x-1, y, z, link[m][0])) ret = 1;\n\tif(link[m][1] != -1 && y && f(x, y-1, z, link[m][1])) ret = 1;\n\tif(link[m][2] != -1 && z && f(x, y, z-1, link[m][2])) ret = 1;\n\treturn dp[x][y][z][m] = ret;\n}\n\nbool trial(){\n\tint p = 0;\n\tfor(int i=1; i<s.size(); i++){\n\t\twhile(p && s[i] != s[p]) p = fail[p];\n\t\tif(s[i] == s[p]) p++;\n\t\tfail[i+1] = p;\n\t}\n\tfor(int i=0; i<s.size(); i++){\n\t\tfor(int j=0; j<3; j++){\n\t\t\tint pos = i;\n\t\t\tif(s[i] > j + 'a'){\n\t\t\t\tlink[i][j] = -1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\twhile(pos && s[pos] != j + 'a') pos = fail[pos];\n\t\t\tif(s[pos] == j + 'a') pos++;\n\t\t\tlink[i][j] = pos;\n\t\t}\n\t}\n\tfor(int i=0; i<s.size(); i++){\n\t\tint pos = i;\n\t\trend[i] = 1;\n\t\tfor(int j=0; j<s.size(); j++){\n\t\t\tpos = link[pos][s[j] - 'a'];\n\t\t\tif(pos == -1){\n\t\t\t\trend[i] = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tmemset(dp, -1, sizeof(dp));\n\treturn f(x, y, z, 0);\n}\n\nint main(){\n\tcin >> x >> y >> z;\n\twhile(s.size() < x + y + z){\n\t\ts.push_back('c');\n\t\tif(trial()) continue;\n\t\ts.back() = 'b';\n\t\tif(trial()) continue;\n\t\ts.back() = 'a';\n\t}\n\tcout << s << endl;\n}\n", "#include<stdio.h>\n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<string.h>\n\n#ifdef LOCAL\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\n#else\n#define NDEBUG\n#define eprintf(...) do {} while (0)\n#endif\n#include<cassert>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef vector<int> VI;\n\n#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)\n\ntemplate<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }\ntemplate<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }\ntemplate<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {\n for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }\n putchar('\\n');\n}\n\n\nstring dp[51][51][51];\n\nint X, Y, Z;\nint N;\n\nstring S;\n\n// qUUUU >= UUUUU\nbool ok() {\n REP (x, X+1) REP (y, Y+1) REP (z, Z+1) dp[x][y][z].clear();\n REP (x, X+1) REP (y, Y+1) REP (z, Z+1) if (x+y+z == (int)dp[x][y][z].size()) {\n\tfor (char c='c'; c>='a'; c--) {\n\t string g = string(1, c) + dp[x][y][z];\n\t string &t = (c=='c'? dp[x][y][z+1]:\n\t\t (c=='b'? dp[x][y+1][z]: dp[x+1][y][z]));\n\t if (t.empty() || t < g) if (g + S + S > S + S) {\n\t\tt = g;\n\t }\n\t}\n }\n return !dp[X][Y][Z].empty();\n}\n\nvoid MAIN() {\n scanf(\"%d%d%d\", &X, &Y, &Z);\n N = X + Y + Z;\n\n S = string(N, 'a');\n REP (i, N) {\n\tS[i] = 'c';\n\tif (!ok()) {\n\t S[i] = 'b';\n\t if (!ok()) S[i] = 'a';\n\t}\n }\n\n puts(S.c_str());\n}\n\nint main() {\n int TC = 1;\n// scanf(\"%d\", &TC);\n REP (tc, TC) MAIN();\n return 0;\n}\n\n", "#include <iostream>\n#include <string>\n#include <utility>\n#define llint long long\n\nusing namespace std;\ntypedef pair<llint, llint> P;\n\nint n;\nint x, y, z;\nstring dp[55][55][55];\nstring ans;\n\nbool check(string s)\n{\n\twhile(s.size() < n) s += 'a';\n\t\n\tfor(int i = 0; i <= x; i++){\n\t\tfor(int j = 0; j <= y; j++){\n\t\t\tfor(int k = 0; k <= z; k++){\n\t\t\t\tdp[i][j][k] = \"\";\n\t\t\t}\n\t\t}\n\t}\n\tdp[0][0][0] = s;\n\t\n\tfor(int i = 0; i <= x; i++){\n\t\tfor(int j = 0; j <= y; j++){\n\t\t\tfor(int k = 0; k <= z; k++){\n\t\t\t\tif(dp[i][j][k] < s) continue;\n\t\t\t\tif(i+1 <= x) dp[i+1][j][k] = max(dp[i+1][j][k], ('a' + dp[i][j][k]).substr(0, n));\n\t\t\t\tif(j+1 <= y) dp[i][j+1][k] = max(dp[i][j+1][k], ('b' + dp[i][j][k]).substr(0, n));\n\t\t\t\tif(k+1 <= z) dp[i][j][k+1] = max(dp[i][j][k+1], ('c' + dp[i][j][k]).substr(0, n));\n\t\t\t}\n\t\t}\n\t}\n\treturn (dp[x][y][z] >= s);\n}\n\nint main(void)\n{\n\tcin >> x >> y >> z;\n\tn = x + y + z;\n\t\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = 2; j >= 0; j--){\n\t\t\tstring s = ans + ((char)('a'+j));\n\t\t\tif(check(s)){\n\t\t\t\tans = s;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\t\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,a,b) for(int i = (a); i < (b); i++)\n#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); i--)\n#define ITER(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)\n#define FILL(a, value) memset(a, value, sizeof(a))\n\n#define SZ(a) (int) a.size()\n#define ALL(a) a.begin(),a.end()\n#define PB push_back\n#define MP make_pair\n\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef pair<int, int> PII;\n\nconst double PI = acos(-1.0);\nconst int INF = 1000 * 1000 * 1000 + 7;\nconst LL LINF = INF * (LL)INF;\n\nstring minShift(string s)\n{\n\tstring res = s;\n\tFOR (it, 0, SZ(s))\n\t{\n\t\ts += s[0];\n\t\ts.erase(s.begin());\n\t\tres = min(res, s);\n\t}\n\treturn res;\n}\n\nstring getString(vector<string> v)\n{\n\tstring res;\n\tFOR (i, 0, SZ(v))\n\t{\n\t\tres += v[i];\n\t}\n\treturn res;\n}\n\nstring solveSmall(int a, int b, int c, string A, string B, string C)\n{\n\tvector<string> v;\n\tFOR (i, 0, a)\n\t{\n\t\tv.PB(A);\n\t}\n\n\tFOR (i, 0, b)\n\t{\n\t\tv.PB(B);\n\t}\n\n\tFOR (i, 0, c)\n\t{\n\t\tv.PB(C);\n\t}\n\tsort(ALL(v));\n\n\tstring res = getString(v);\n\n\tdo\n\t{\n\t\tres = max(res, minShift(getString(v)));\n\t}while(next_permutation(ALL(v)));\n\n\treturn res;\n\n}\n\nstring getString(int cnt, string s)\n{\n\tstring res;\n\tFOR (i, 0, cnt)\n\t{\n\t\tres += s;\n\t}\n\treturn res;\n}\n\nstring solveLarge(int a, int b, int c, string A, string B, string C)\n{\n\t//if (a + b + c <= 3) return solveSmall(a, b, c, A, B, C);\n\n\tif (a == 0)\n\t{\n\t\ta = b;\n\t\tA = B;\n\t\tb = c;\n\t\tB = C;\n\t\tc = 0;\n\t\tC = \"\";\n\t}\n\n\tif (b == 0)\n\t{\n\t\tb = c;\n\t\tB = C;\n\t\tc = 0;\n\t\tC = \"\";\n\t}\n\n\tif (b == 0 && c == 0)\n\t{\n\t\treturn getString(a, A);\n\t}\n\n\tif (c >= a)\n\t{\n\t\tc -= a;\n\t\tA += C;\n\t\treturn solveLarge(a, b, c, A, B, C);\n\t}\n\n\tC = A + C;\n\ta -= c;\n\n\tif (b >= a)\n\t{\n\t\tA += B;\n\t\tb -= a;\n\t\tswap(b, c);\n\t\tswap(B, C);\n\t}\n\telse\n\t{\n\t\ta -= b;\n\t\tB = A + B;\n\t}\n\n\treturn solveLarge(a, b, c, A, B, C);\n\n\n\n}\n\nint main()\n{\n\t//freopen(\"in.txt\", \"r\", stdin);\n\t//ios::sync_with_stdio(false); cin.tie(0);\n\n\tint x, y, z;\n\n\tcin>>x>>y>>z;\n\tstring res = solveLarge(x, y, z, \"a\", \"b\", \"c\");\n\tcout<<res<<endl;\n\n//\tFOR (a, 0, 5)\n//\t{\n//\t\tFOR (b, 0, 5)\n//\t\t{\n//\t\t\tFOR (c, 0, 5)\n//\t\t\t{\n//\t\t\t\tstring r = solveSmall(a, b, c, \"a\", \"b\", \"c\");\n//\t\t\t\tstring s = solveLarge(a, b, c, \"a\", \"b\", \"c\");\n//\t\t\t\tcout<<r<<endl<<s<<endl;\n//\t\t\t\tif (r != s)\n//\t\t\t\t{\n//\t\t\t\t\tcout<<\"!! \"<<endl;\n//\t\t\t\t\tcout<<a<<' '<<b<<' '<<c<<endl;\n//\t\t\t\t\tthrow -1;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t}\n//\t}\n//\n//\tcout<<\"Done\"<<endl;\n\n}", "#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=(a);i<=(b);i++)\n#define per(i,a,b) for(int i=(a);i>=(b);i--)\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define fi first\n#define se second\n#define pb push_back\n#define mp make_pair\nusing namespace std;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef long long ll;\n\ntemplate<class T> inline void read(T &x){\n\tint f=0;x=0;char ch=getchar();\n\tfor(;!isdigit(ch);ch=getchar())f|=(ch=='-');\n\tfor(;isdigit(ch);ch=getchar())x=x*10+ch-'0';\n\tif(f)x=-x;\n}\n\nstring solve(string a,string b,int x,int y){\n//\tassert(a.size()+b.size()<=20);\n//\tcerr<<a<<\" \"<<b<<\" \"<<x<<\" \"<<y<<endl;\n\tif(b+a<a+b) swap(a,b),swap(x,y);\n\tif(!x||!y){\n\t\tstring res;\n\t\trep(i,1,x) res+=a;\n\t\trep(i,1,y) res+=b;\n\t\treturn res;\n\t}\n\tif(x<y){\n\t\tint u=y/x,v=y%x;\n\t\tstring A=a,B;\n\t\twhile(u--) A+=b; B=A+b;\n\t\treturn solve(A,B,x-v,v);\n\t}\n\tint u=x/y,v=x%y;\n\tstring A,B;\n\twhile(u--) A+=a; A+=b; B=a+A;\n\treturn solve(A,B,y-v,v);\n}\n\nstring solve(string a,string b,string c,int x,int y,int z){\n\tif(b+a<a+b) swap(a,b),swap(x,y);\n\tif(c+a<a+c) swap(a,c),swap(x,z);\n\tif(c+b<b+c) swap(b,c),swap(y,z);\n\tif(!x) return solve(b,c,y,z);\n\tif(!y) return solve(a,c,x,z);\n\tif(!z) return solve(a,b,x,y);\n\tvector<string> s(x,a);\n\tREP(i,z) s[i%x]+=c;\n\tint cur=z%x;\n\tREP(i,y){\n\t\ts[cur++]+=b;\n\t\tif(cur==x) cur=z%x;\n\t}\n\tmap<string,int> t;\n\tREP(i,x) t[s[i]]++;\n\tstring S[3]; int C[3]={0,0,0},k=0;\n\tfor(auto x:t) S[k]=x.fi,C[k++]=x.se;\n\treturn solve(S[0],S[1],S[2],C[0],C[1],C[2]);\n}\n\nint main(){\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<solve(\"a\",\"b\",\"c\",x,y,z)<<endl;\t\n\treturn 0;\n}\n", "#include<stdio.h>\n#include<math.h>\n#include<algorithm>\n#include<queue>\n#include<deque>\n#include<string>\n#include<string.h>\n#include<vector>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<cassert>\nusing namespace std;\nconst long long mod=1000000007;\nconst long long inf=mod*mod;\nconst long long d2=500000004;\nconst double EPS=1e-6;\nconst double PI=acos(-1.0);\nint ABS(int a){return max(a,-a);}\nlong long ABS(long long a){return max(a,-a);}\nint C[1100];\nint B[1100];\nint ad=0;\nvector<string> str;\nvoid f(string aa,string bb,string cc,int a,int b,int c){\n\t//printf(\"%s %s %s %d %d %d\\n\",aa.c_str(),bb.c_str(),cc.c_str(),a,b,c);\n\tif(a==0){\n\t\tf(bb,cc,\"\",b,c,0);\n\t\treturn;\n\t}\n\tif(b+c==0){\n\t\tfor(int i=0;i<a;i++)printf(\"%s\",aa.c_str());printf(\"\\n\");return;\n\t}\n\tad=0;\n\tfor(int i=0;i<1100;i++)B[i]=C[i]=0;\n\twhile(a==0){\n\t\ta=b;b=c;c=0;ad++;\n\t}\n\tfor(int i=0;i<c;i++){\n\t\tC[i%a]++;\n\t}\n\tif(C[0]!=C[a-1]){\n\t\tint f=0;\n\t\tfor(int i=0;i<a;i++)if(C[a-1]==C[i])f++;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tB[a-f+i%f]++;\n\t\t}\n\t}else{\n\t\tfor(int i=0;i<b;i++){\n\t\t\tB[i%a]++;\n\t\t}\n\t}\n\tstr.clear();\n\tfor(int i=a-1;i>=0;i--){\n\t\tstring tmp=\"\";\n\t\ttmp+=aa;\n\t\tfor(int j=0;j<C[i];j++)tmp+=cc;//printf(\"%c\",'c'+ad);\n\t\tfor(int j=0;j<B[i];j++)tmp+=bb;//printf(\"%c\",'b'+ad);\n\t\tstr.push_back(tmp);\n\t}\n\tstd::sort(str.begin(),str.end());\n//\tfor(int i=0;i<str.size();i++)printf(\"%s\\n\",str[i].c_str());\n\tstring ta=\"\",tb=\"\",tc=\"\";\n\tint va=0;\n\tint vb=0;\n\tint vc=0;\n\tint fi=0;\n\tint ph=0;\n\tfor(int i=0;i<a;i++){\n\t\tif(str[i]==str[fi]){\n\t\t\tif(ph==0){va++;ta=str[i];}\n\t\t\tif(ph==1){vb++;tb=str[i];}\n\t\t\tif(ph==2){vc++;tc=str[i];}\n\t\t}else{\n\t\t//\tprintf(\"%s %s\\n\",str[i].c_str(),str[fi].c_str());\n\t\t\tif(ph==0){ph++;vb++;tb=str[i];fi=i;}\n\t\t\telse if(ph==1){ph++;vc++;tc=str[i];fi=i;}\n\t\t\t\n\t\t}\n\t}\n\tf(ta,tb,tc,va,vb,vc);\n}\nint main(){\n\t\n\tint a,b,c;scanf(\"%d%d%d\",&a,&b,&c);\n\tf(\"a\",\"b\",\"c\",a,b,c);\n\t\n\t\n\t/*for(int i=0;i<100;i++){\n\t\tint a=rand()%10;\n\t\tint b=rand()%10;\n\t\tint c=rand()%10;\n\t\tif(a+b+c==0)continue;\n\t\tprintf(\"%d %d %d: \",a,b,c);\n\t\tf(\"a\",\"b\",\"c\",a,b,c);\n\t}*/\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint a,b,c;\nmultiset<string> se;\n\nint main(){\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tfor (int i=1;i<=a;++i) se.insert(\"a\");\n\tfor (int i=1;i<=b;++i) se.insert(\"b\");\n\tfor (int i=1;i<=c;++i) se.insert(\"c\");\n\twhile (se.size()>1){\n\t\tstring x=*se.begin(),y=*se.rbegin();\n\t\tse.erase(se.begin()); se.erase(--se.end());\n\t\tse.insert(x+y);\n\t}\n\tputs(se.begin()->c_str());\n\t\n\treturn 0;\n}\n\t\t\t", "#include <bits/stdc++.h>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint x,y,z;\nvector<string> ss;\n\nint main(void){\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tfor(int i=0;i<x;i++){\n\t\tss.push_back(\"a\");\n\t}\n\tfor(int i=0;i<y;i++){\n\t\tss.push_back(\"b\");\n\t}\n\tfor(int i=0;i<z;i++){\n\t\tss.push_back(\"c\");\n\t}\n\twhile(ss.size()>1){\n\t\tsort(ss.begin(),ss.end());\n\t\tss[0]+=ss[ss.size()-1];\n\t\tss.pop_back();\n\t}\n\tcout << ss[0] << endl;\n\treturn 0;\n}", "#include<iostream>\n#include<set>\nusing namespace std;\nmultiset<string> s;\nint main()\n{\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\twhile(x--)s.insert(\"a\");\n\twhile(y--)s.insert(\"b\");\n\twhile(z--)s.insert(\"c\");\n\twhile(s.size()>1)\n\t{\n\t\tstring x=*s.begin()+*--s.end();\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(x);\n\t}\n\tcout<<*s.begin()<<endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n multiset<string> chars;\n for (int i = 0; i < x; i++) chars.insert(\"a\");\n for (int i = 0; i < y; i++) chars.insert(\"b\");\n for (int i = 0; i < z; i++) chars.insert(\"c\");\n while (chars.size() > 1) {\n string first = *chars.begin();\n chars.erase(chars.begin());\n string last = *prev(chars.end());\n chars.erase(prev(chars.end()));\n chars.insert(first + last);\n }\n printf(\"%s\\n\", chars.begin()->c_str());\n return 0;\n}\n", "#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <iostream>\n\nusing namespace std;\nint _w;\n\nvector<string> v;\n\nint main() {\n\tint a, b, c;\n\t_w = scanf( \"%d%d%d\", &a, &b, &c );\n\tfor( int i = 0; i < a; ++i ) v.push_back(\"a\");\n\tfor( int i = 0; i < b; ++i ) v.push_back(\"b\");\n\tfor( int i = 0; i < c; ++i ) v.push_back(\"c\");\n\twhile( v.size() > 1 ) {\n\t\tsort(v.begin(), v.end());\n\t\tstring s1 = v.front(), s2 = v.back();\n\t\tv.pop_back();\n\t\treverse(v.begin(), v.end());\n\t\tv.pop_back();\n\t\tv.push_back(s1+s2);\n\t}\n\tcout << v.front() << endl;\n\treturn 0;\n}\n", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <queue>\n#include <ctime>\n#include <cassert>\n#include <complex>\n#include <string>\n#include <cstring>\nusing namespace std;\n\n#ifdef LOCAL\n\t#define eprintf(...) fprintf(stderr, __VA_ARGS__)\n#else\n\t#define eprintf(...) 42\n#endif\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\n#define mp make_pair\n\nstring solve(string A, int x, string B, int y, string C, int z) {\n\tif (x == 0)\n\t\treturn solve(B, y, C, z, \"\", 0);\n\tif (y == 0 && z == 0) {\n\t\tstring res = \"\";\n\t\twhile(x--) res += A;\n\t\treturn res;\n\t}\n\tif (y == 0)\n\t\treturn solve(A, x, C, z, \"\", 0);\n\tint sum = y + z;\n\tint p = x / sum;\n\tint q = x % sum;\n\t\n\tstring As = \"\";\n\tfor (int i = 0; i < p; i++)\n\t\tAs += A;\n\tstring Ab = As + A;\n\n\tif (q == 0) {\n\t\treturn solve(As + B, y, As + C, z, \"\", 0);\n\t}\n\n\tp = sum - q;\n\n\tif (z < q) {\n\t\treturn solve(Ab + B, q - z, Ab + C, z, As + B, p);\n\t}\n\tif (z == q) {\n\t\treturn solve(Ab + C, q, As + B, p, \"\", 0);\n\t}\n\treturn solve(Ab + C, q, As + B, y, As + C, z - q);\n}\n\nint main()\n{\n//\tfreopen(\"input.txt\", \"r\", stdin);\n//\tfreopen(\"output.txt\", \"w\", stdout);\n\n\tint x, y, z;\n\tcin >> x >> y >> z;\n\tcout << solve(\"a\", x, \"b\", y, \"c\", z) << endl;\n\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\n#define gc getchar()\n#define ll long long\n#define pb push_back\n#define mk make_pair\n#define rint register int\nusing namespace std;\ninline int read(){char ch=gc;int w=1,s=0;while(!isdigit(ch)){if(ch=='-') w=-1;ch=gc;};while(isdigit(ch)){s=s*10+ch-'0';ch=gc;} return w*s;}\nmultiset<string> q; \nint main()\n{\n\tint a=read(),b=read(),c=read();\n\tfor(rint i=1;i<=a;++i) q.insert(\"a\");\n\tfor(rint i=1;i<=b;++i) q.insert(\"b\");\n\tfor(rint i=1;i<=c;++i) q.insert(\"c\");\n\twhile(q.size()>=2)\n\t{\n\t\tstring s=(*q.begin())+(*q.rbegin());\n\t\tq.erase(q.begin());\n\t\tq.erase(--q.end());\n\t\tq.insert(s);\n\t}\n\tcout<<(*q.begin());\n\treturn 0;\n}\n\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nmultiset <string> s;\nint x,y,z;\nint main(){\n\tcin>>x>>y>>z;\n\twhile(x--)s.insert(\"a\");\n\twhile(y--)s.insert(\"b\");\n\twhile(z--)s.insert(\"c\");\n\twhile(s.size()>1){\n\t\tstring a=*s.begin();\n\t\tstring b=*s.rbegin();\n\t\ts.erase(s.lower_bound(a));\n\t\ts.erase(s.lower_bound(b));\n\t\ts.insert(a+b);\n\t}\n\tcout<<*s.begin()<<endl;\n}", "// #include {{{\n#include <iostream>\n#include <cassert>\n#include <cstring>\n#include <cstdlib>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <ctime>\n#include <queue>\n#include <set>\n#include <map>\n#include <stack>\n#include <string>\n#include <bitset>\n#include <vector>\n#include <complex>\n#include <algorithm>\nusing namespace std;\n// }}}\n// #define {{{\ntypedef long long ll;\ntypedef double db;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\n#define de(x) cout << #x << \"=\" << x << endl\n#define rep(i,a,b) for(int i=a;i<(b);++i)\n#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)\n#define all(x) (x).begin(),(x).end()\n#define sz(x) (int)(x).size()\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n// }}}\n\nint main(){\n multiset<string> S;\n rep(i,0,3){\n int x;\n cin >> x;\n rep(j,0,x) S.insert(string(1 , i + 'a'));\n }\n while(sz(S) > 1){\n auto it = S.end();\n --it;\n string a = *S.begin() + *it;\n S.erase(it);\n S.erase(S.begin());\n S.insert(a);\n }\n cout << *S.begin() << endl;\n return 0;\n}\n", "#include <stdio.h>\n#include <set>\n#include <string>\n\nint main()\n{\n std::multiset<std::string> set;\n for (int i = 0; i < 3; ++ i) {\n int x;\n scanf(\"%d\", &x);\n for (int j = 0; j < x; ++ j)\n set.emplace(1, 'a' + i);\n }\n while (set.size() > 1) {\n auto it = -- set.end();\n std::string s = *set.begin() + *it;\n set.erase(set.begin());\n set.erase(it);\n set.emplace(s);\n }\n printf(\"%s\\n\", set.begin()->c_str());\n}\n", "//by yjz\n#include<bits/stdc++.h>\nusing namespace std;\n#define FF first\n#define SS second\n#define PB push_back\n#define MP make_pair\n#define bged(v) (v).begin(),(v).end()\n#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)\ntypedef long long ll;\nconst int Imx=2147483647;\nconst ll Lbig=2e18;\nconst int mod=1e9+7;\n//My i/o stream\nstruct fastio\n{\n\tchar s[100000];\n\tint it,len;\n\tfastio(){it=len=0;}\n\tinline char get()\n\t{\n\t\tif(it<len)return s[it++];it=0;\n\t\tlen=fread(s,1,100000,stdin);\n\t\tif(len==0)return EOF;else return s[it++];\n\t}\n\tbool notend()\n\t{\n\t\tchar c=get();\n\t\twhile(c==' '||c=='\\n')c=get();\n\t\tif(it>0)it--;\n\t\treturn c!=EOF;\n\t}\n}_buff;\n#define geti(x) x=getnum()\n#define getii(x,y) geti(x),geti(y)\n#define getiii(x,y,z) getii(x,y),geti(z)\n#define puti(x) putnum(x),putchar(' ')\n#define putii(x,y) puti(x),puti(y)\n#define putiii(x,y,z) putii(x,y),puti(z)\n#define putsi(x) putnum(x),putchar('\\n')\n#define putsii(x,y) puti(x),putsi(y)\n#define putsiii(x,y,z) putii(x,y),putsi(z)\ninline ll getnum()\n{\n\tll r=0;bool ng=0;char c;c=_buff.get();\n\twhile(c!='-'&&(c<'0'||c>'9'))c=_buff.get();\n\tif(c=='-')ng=1,c=_buff.get();\n\twhile(c>='0'&&c<='9')r=r*10+c-'0',c=_buff.get();\n\treturn ng?-r:r;\n}\ntemplate<class T> inline void putnum(T x)\n{\n\tif(x<0)putchar('-'),x=-x;\n\tregister short a[20]={},sz=0;\n\twhile(x)a[sz++]=x%10,x/=10;\n\tif(sz==0)putchar('0');\n\tfor(int i=sz-1;i>=0;i--)putchar('0'+a[i]);\n}\ninline char getreal(){char c=_buff.get();while(c==' '||c=='\\n')c=_buff.get();return c;}\nstring sA=\"a\";\nstring sB=\"b\";\nstring sC=\"c\";\nint n,A,B,C;\nstring S;\nstring dp[52][52][52];\nvoid upd(string &cur,string s,int tlen)\n{\n\tif(s.size()==tlen&&s+S+S.substr(0,n-s.size())>=S+S)cur=max(cur,s);\n}\nbool check()\n{\n//\tcerr<<\"check:\"<<S<<endl;\n\tfor(int i=0;i<=A;i++)\n\t{\n\t\tfor(int j=0;j<=B;j++)\n\t\t{\n\t\t\tfor(int k=0;k<=C;k++)\n\t\t\t{\n\t\t\t\tstring &cur=dp[i][j][k];\n\t\t\t\tcur=\"\";\n\t\t\t\tif(i>0)upd(cur,sA+dp[i-1][j][k],i+j+k);\n\t\t\t\tif(j>0)upd(cur,sB+dp[i][j-1][k],i+j+k);\n\t\t\t\tif(k>0)upd(cur,sC+dp[i][j][k-1],i+j+k);\n//\t\t\t\tcerr<<i<<\" \"<<j<<\" \"<<k<<\":\"<<cur<<endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn dp[A][B][C].size()==n;\n}\nint main()\n{\n\tcin>>A>>B>>C;\n\tn=A+B+C;\n\tS.resize(n);\n\tfor(int i=0;i<n;i++)S[i]='a';\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tfor(int j=1;j<3;j++)\n\t\t{\n\t\t\tS[i]='a'+j;\n\t\t\tif(!check())\n\t\t\t{\n\t\t\t\tS[i]='a'+j-1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<S<<endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n \nusing namespace std;\n \nstring solve(int a, int b, int c) {\n bool flag = false;\n if (a == 0) {\n flag = true;\n a = b;\n b = c;\n c = 0;\n }\n string res = \"\";\n if (a == 0) {\n res = string(b, 'b');\n } else {\n if (b == 0 && c == 0) {\n res = string(a, 'a');\n } else {\n vector<string> put(a, \"a\");\n for (int i = 0; i < c; i++) {\n put[i % a] += 'c';\n }\n int ptr = c % a;\n for (int i = 0; i < b; i++) {\n put[ptr] += 'b';\n ptr++;\n if (ptr == a) {\n ptr = c % a;\n }\n }\n map<string, int> mp;\n for (auto &s : put) {\n mp[s]++;\n }\n vector< pair<string, int> > v;\n for (auto &p : mp) {\n v.push_back(p);\n }\n assert(v.size() <= 3);\n while (v.size() < 3) {\n v.emplace_back(\"\", 0);\n }\n string aux = solve(v[0].second, v[1].second, v[2].second);\n res = \"\";\n for (int i = 0; i < (int) aux.size(); i++) {\n res += v[aux[i] - 'a'].first;\n }\n }\n }\n if (flag) {\n for (char &c : res) {\n c++;\n }\n }\n return res;\n}\n \nint main() {\n int a, b, c;\n scanf(\"%d %d %d\", &a, &b, &c);\n cout << solve(a, b, c) << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef signed long long ll;\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define FOR(x,to) for(x=0;x<(to);x++)\n#define FORR(x,arr) for(auto& x:arr)\n#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)\n#define ALL(a) (a.begin()),(a.end())\n#define ZERO(a) memset(a,0,sizeof(a))\n#define MINUS(a) memset(a,0xff,sizeof(a))\n//-------------------------------------------------------\n\nvoid solve() {\n\tint i,j,k,l,r,x,y; string s;\n\t\n\tint A,B,C;\n\tcin>>A>>B>>C;\n\tvector<string> V;\n\twhile(A--) V.push_back(\"a\");\n\twhile(B--) V.push_back(\"b\");\n\twhile(C--) V.push_back(\"c\");\n\t\n\twhile(V.size()>1) {\n\t\tsort(ALL(V));\n\t\tV[0]+=V.back();\n\t\tV.pop_back();\n\t}\n\t\n\tcout<<V[0]<<endl;\n}\n\n\nint main(int argc,char** argv){\n\tstring s;int i;\n\tif(argc==1) ios::sync_with_stdio(false), cin.tie(0);\n\tFOR(i,argc-1) s+=argv[i+1],s+='\\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);\n\tcout.tie(0); solve(); return 0;\n}\n", "// start fold\n#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<algorithm>\n#include<vector>\n#include<cstring>\n#include<set>\n#include<map>\n#include<cmath>\n#include<queue>\n#include<bitset>\nusing namespace std;\n#define ri register int\n#define il inline\n#define LL long long\n#define ull unsigned long long\n#define pb push_back\n#define mp make_pair\n#define pii pair<int,int>\n#define fi first\n#define se second\n#define enter putchar('\\n')\n#define size(x) ((int)x.size())\n#define mem0(x) memset(x,0,sizeof(x))\ntemplate<class T>il void in(T &x)\n{\n\tx=0; short f=1; char c=getchar();\n\twhile(c<'0'||c>'9')\n\t{\n\t\tif(c=='-') f=-1;\n\t\tc=getchar();\n\t}\n\twhile(c>='0'&&c<='9') x=x*10+(c^'0'),c=getchar();\n\tx*=f;\n}\ntemplate <typename T,typename ...Args>il void in(T &x, Args &...args)\n{\n\tin(x); in(args...);\n}\ntemplate<class T>il void out(T x,const char c='\\n')\n{\n\tstatic short st[30];\n\tshort m=0;\n\tif(x<0) putchar('-'),x=-x;\n\tdo st[++m]=x%10,x/=10; while(x);\n\twhile(m) putchar(st[m--]|'0');\n\tputchar(c);\n}\ntemplate <typename T,typename ...Args>il void out(const T &x,const Args &...args)\n{\n\tout(x,' '); out(args...);\n}\ntemplate<class T>il void print(T a[],int n)\n{\n\tif(n<=0) return;\n\tfor(ri i=0; i<n; ++i) out(a[i],' ');\n\tenter;\n}\nnamespace i207M\n{\n// end fold\nmultiset<string>s;\nsigned main()\n{\n#ifdef M207\n\tfreopen(\"in.in\",\"r\",stdin);\n\t// freopen(\"out.out\",\"w\",stdout);\n#endif\n int a,b,c;\n\tin(a,b,c);\n\tfor(ri i=1; i<=a; ++i) s.insert(\"a\");\n\tfor(ri i=1; i<=b; ++i) s.insert(\"b\");\n\tfor(ri i=1; i<=c; ++i) s.insert(\"c\");\n\twhile(size(s)>1)\n\t{\n\t\tstring t=*s.begin()+*s.rbegin();\n\t\ts.erase(s.begin()),s.erase(--s.end());\n\t\ts.insert(t);\n\t}\n\tcout<<*s.begin();\n\treturn 0;\n}\n// start fold\n}\nsigned main()\n{\n\ti207M::main();\n\treturn 0;\n}\n// end fold", "#include<bits/stdc++.h>\n#define mem(a,b) memset(a,b,sizeof(a))\n#define For(i,a,b) for(int i=a,i##E=b;i<=i##E;++i)\n#define rFor(i,a,b) for(int i=a,i##E=b;i>=i##E;--i)\ntypedef long long LL;\nusing namespace std;\ntemplate<typename T>inline bool chkmin(T &a,const T &b){return a>b?a=b,1:0;}\ntemplate<typename T>inline bool chkmax(T &a,const T &b){return a<b?a=b,1:0;}\ntemplate<typename T>inline void read(T &x)\n{\n\tx=0;int _f(0);char ch=getchar();\n\twhile(!isdigit(ch))_f|=(ch=='-'),ch=getchar();\n\twhile( isdigit(ch))x=x*10+ch-'0',ch=getchar();\n\tx=_f?-x:x;\n}\ninline void file()\n{\n#ifdef ztzshiwo\n\tfreopen(\"in.txt\",\"r\",stdin);\n\tfreopen(\"out.txt\",\"w\",stdout);\n#endif\n}\nint X,Y,Z;\nmultiset<string>S;\nmultiset<string>::iterator it;\nstring x,y;\nint main()\n{\n\tfile();\n\tread(X),read(Y),read(Z);\n\tFor(i,1,X)S.insert(\"a\");\n\tFor(i,1,Y)S.insert(\"b\");\n\tFor(i,1,Z)S.insert(\"c\");\n\twhile(S.size()>1)\n\t{\n\t\tit=S.begin();\n\t\tx=*it;S.erase(it);\n\t\tit=S.end();--it;\n\t\ty=*it;S.erase(it);\n\t\tS.insert(x+y);\n\t}\n\tcout<<*S.begin()<<endl;\n\treturn 0;\n}\n", "//minamoto\n#include<bits/stdc++.h>\n#define R register\n#define fp(i,a,b) for(R int i=(a),I=(b)+1;i<I;++i)\n#define fd(i,a,b) for(R int i=(a),I=(b)-1;i>I;--i)\n#define go(u) for(int i=head[u],v=e[i].v;i;i=e[i].nx,v=e[i].v)\ntemplate<class T>inline bool cmax(T&a,const T&b){return a<b?a=b,1:0;}\ntemplate<class T>inline bool cmin(T&a,const T&b){return a>b?a=b,1:0;}\nusing namespace std;\nstruct node{\n\tstring s;int c;\n\tinline node(R string ss,R int cc):s(ss),c(cc){}\n\tinline bool operator <(const node &b)const{return s<b.s;}\n};set<node>s;\nint x,y,z;\nint main(){\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tif(x)s.insert(node(\"a\",x));\n\tif(y)s.insert(node(\"b\",y));\n\tif(z)s.insert(node(\"c\",z));\n\twhile(2333){\n\t\tif(s.size()==1){\n\t\t\tnode p=*s.begin();\n\t\t\tfp(i,1,p.c)cout<<p.s;\n\t\t\tputs(\"\");\n\t\t\treturn 0;\n\t\t}\n\t\tR node p=*s.begin(),q=*--s.end();\n\t\ts.erase(s.begin()),s.erase(--s.end());\n\t\tR int k=min(p.c,q.c);s.insert(node(p.s+q.s,k));\n\t\tif(p.c-k)s.insert(node(p.s,p.c-k));\n\t\tif(q.c-k)s.insert(node(q.s,q.c-k));\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n\tint a, b, c;\n\tscanf(\"%d%d%d\", &a, &b, &c);\n\tmultiset<string> s;\n\twhile (a --) s.insert(\"a\");\n\twhile (b --) s.insert(\"b\");\n\twhile (c --) s.insert(\"c\");\n\twhile ((int) s.size() > 1) {\n\t\tstring t = *s.begin() + *--s.end();\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(t);\n\t}\n\tprintf(\"%s\\n\", s.begin() -> c_str());\n}\n", "#include<bits/stdc++.h>\n\nusing namespace std;\ntypedef long long LL;\ntypedef pair<LL,LL> PII;\n\nstring solve(vector<string> data, vector<int> cnt) {\n\tif(data.size() == 1) {\n\t\tstring s;\n\t\tfor(int i=0; i<cnt[0]; i++)\n\t\t\ts += data[0];\n\t\treturn s;\n\t}\n\tvector<string> base;\n\tfor(int i=0; i<cnt[0]; i++) {\n\t\tbase.push_back(data[0]);\n\t}\n\tint pos = 0;\n\tif(data.size() == 3) {\n\t\tfor(int i=0; i<cnt[2]; i++)\t{\n\t\t\tbase[i%cnt[0]] += data[2];\n\t\t}\n\t\tpos = cnt[2] % cnt[0];\n\t\t\t\n\t}\n\tfor(int i=0; i<cnt[1]; i++) {\n\t\tbase[pos + i % (cnt[0] - pos)] += data[1];\n\t}\n\t\n\tvector<string> nextd;\n\tvector<int> nextc;\n\tfor(int i=base.size()-1; i>=0; i--) {\n\t\tif(nextd.size() == 0) {\n\t\t\tnextd.push_back(base[i]);\n\t\t\tnextc.push_back(1);\n\t\t\tcontinue;\n\t\t}\n\t\tif(nextd.back() == base[i]) {\n\t\t\tnextc[nextc.size()-1]++;\n\t\t}\n\t\telse {\n\t\t\tnextd.push_back(base[i]);\n\t\t\tnextc.push_back(1);\n\t\t}\n\t}\n\t\n\treturn solve(nextd, nextc);\n\t\n\t\n}\n\n\n\nint main() {\n\tint a,b,c;\n\tcin >> a >> b >> c;\n\t\n\tvector<string> data;\n\tvector<int> val;\n\tif(a!=0) {\n\t\tdata.push_back(\"a\");\n\t\tval.push_back(a);\n\t}\n\tif(b!=0) {\n\t\tdata.push_back(\"b\");\n\t\tval.push_back(b);\n\t}\n\tif(c!=0) {\n\t\tdata.push_back(\"c\");\n\t\tval.push_back(c);\n\t}\n\tstring ans = solve(data, val);\n\tcout << ans << endl;\n\treturn 0;\t\n}", "#include<set>\n#include<map>\n#include<deque>\n#include<queue>\n#include<stack>\n#include<cmath>\n#include<ctime>\n#include<bitset>\n#include<string>\n#include<vector>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<climits>\n#include<complex>\n#include<iostream>\n#include<algorithm>\n#define ll long long\nusing namespace std;\n\nint x,y,z;\nmultiset<string>S;\nmultiset<string>::iterator it;\n\nint main()\n{\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tfor(int i=1;i<=x;i++) S.insert(\"a\");\n\tfor(int i=1;i<=y;i++) S.insert(\"b\");\n\tfor(int i=1;i<=z;i++) S.insert(\"c\");\n\twhile(S.size()>1)\n\t{\n\t\tit=S.end(); it--;\n\t\tstring ss=(*S.begin())+(*it);\n\t\tS.erase(S.begin());\n\t\tS.erase(it);\n\t\tS.insert(ss);\n\t}\n\tcout<<(*S.begin())<<endl;\n\t\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nmultiset<string> s;\nint main(){\n //freopen(\"beargguy.in\",\"r\",stdin);\n //freopen(\"beargguy.out\",\"w\",stdout);\n int r,b,g;\n scanf(\"%d%d%d\",&r,&b,&g);\n for(int i=1;i<=r;i++){\n string a=\"a\";\n s.insert(a);\n }\n for(int i=1;i<=b;i++){\n string a=\"b\";\n s.insert(a);\n }\n for(int i=1;i<=g;i++){\n string a=\"c\";\n s.insert(a);\n }\n string ans;\n while(!s.empty()){\n string fir=*s.begin();\n s.erase(s.begin());\n if(s.empty()){\n ans=fir;\n break;\n }\n string las=*(--s.end());\n s.erase(--s.end());\n if(s.empty()){\n ans=fir+las;\n break;\n }\n s.insert(fir+las);\n }\n cout<<ans<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\n#define fi first\n#define se second\n#define pii pair<int,int>\n#define mp make_pair\n#define pb push_back\n#define space putchar(' ')\n#define enter putchar('\\n')\n#define MAXN 4005\n#define eps 1e-10\n//#define ivorysi\nusing namespace std;\ntypedef long long int64;\ntypedef unsigned int u32;\ntypedef double db;\ntemplate<class T>\nvoid read(T &res) {\n\tres = 0;T f = 1;char c = getchar();\n\twhile(c < '0' || c > '9') {\n\t\tif(c == '-') f = -1;\n\t\tc = getchar();\n\t}\n\twhile(c >= '0' && c <= '9') {\n\t\tres = res * 10 + c - '0';\n\t\tc = getchar();\n\t}\n\tres *= f;\n}\ntemplate<class T>\nvoid out(T x) {\n\tif(x < 0) {x = -x;putchar('-');}\n\tif(x >= 10) {\n\t\tout(x / 10);\n\t}\n\tputchar('0' + x % 10);\n}\nstruct node {\n\tstring s;int num;\n\tfriend bool operator < (const node &a,const node &b) {\n\t\treturn a.s < b.s;\n\t}\n};\nset<node> S;\nint x,y,z;\nvoid Solve() {\n\tread(x);read(y);read(z);\n\tif(x) S.insert((node){\"a\",x});\n\tif(y) S.insert((node){\"b\",y});\n\tif(z) S.insert((node){\"c\",z});\n\twhile(1) {\n\t\tif(S.size() == 1) {\n\t\t\tnode p = *S.begin();\n\t\t\tfor(int i = 1 ; i <= p.num ; ++i) {\n\t\t\t\tcout << p.s;\n\t\t\t}\n\t\t\tenter;\n\t\t\tbreak;\n\t\t}\n\t\tnode s0 = *S.begin(),t0 = *(--S.end());\n\t\tS.erase(S.begin());S.erase(--S.end());\n\t\tint k = min(s0.num,t0.num);\n\t\tS.insert((node){s0.s + t0.s,k});\n\t\tif(s0.num > k) S.insert((node){s0.s,s0.num - k});\n\t\tif(t0.num > k) S.insert((node){t0.s,t0.num - k});\n\t}\n}\nint main() {\n#ifdef ivorysi\n\tfreopen(\"f1.in\",\"r\",stdin);\n#endif\n\tSolve();\n}\n", "#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <numeric>\n#include <utility>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\n#include <unordered_map>\nusing namespace std;\n\n#define REP(i, s) for (int i = 0; i < s; ++i)\n#define ALL(v) (v.begin(), v.end())\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ EACH(it, P) { s << \"<\" << *it << \"> \"; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s << endl; }\n\nstring solve(string a, string b, string c, int x, int y, int z) {\n\tif (y + z == 0) {\n\t\tstring res = \"\";\n\t\tfor (int i = 0; i < x; ++i) res += a;\n\t\treturn res;\n\t}\n\tif (x == 0) return solve(b, c, \"\", y, z, 0);\n\tint p = x / (y + z);\n\tint r = x % (y + z);\n\tstring A = \"\";\n\tfor (int i = 0; i < p; ++i) A += a;\n\tif (z >= r) {\n\t\tstring na = A + a + c;\n\t\tstring nb = A + b;\n\t\tstring nc = A + c;\n\t\treturn solve(na, nb, nc, r, y, z - r);\n\t}\n\telse {\n\t\tstring na = A + a + b;\n\t\tstring nb = A + a + c;\n\t\tstring nc = A + b;\n\t\treturn solve(na, nb, nc, r - z, z, y + z - r);\n\t}\n}\n\nint main() {\n\tint x, y, z;\n\twhile (cin >> x >> y >> z) {\n\t\tcout << solve(\"a\", \"b\", \"c\", x, y, z) << endl;\n\t}\n}\n", "/**\n * author: tourist\n * created: 08.10.2017 15:50:42 \n**/\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nstring solve(int a, int b, int c) {\n bool flag = false;\n if (a == 0) {\n flag = true;\n a = b;\n b = c;\n c = 0;\n }\n string res = \"\";\n if (a == 0) {\n res = string(b, 'b');\n } else {\n if (b == 0 && c == 0) {\n res = string(a, 'a');\n } else {\n vector<string> put(a, \"a\");\n for (int i = 0; i < c; i++) {\n put[i % a] += 'c';\n }\n int ptr = c % a;\n for (int i = 0; i < b; i++) {\n put[ptr] += 'b';\n ptr++;\n if (ptr == a) {\n ptr = c % a;\n }\n }\n map<string, int> mp;\n for (auto &s : put) {\n mp[s]++;\n }\n vector< pair<string, int> > v;\n for (auto &p : mp) {\n v.push_back(p);\n }\n assert(v.size() <= 3);\n while (v.size() < 3) {\n v.emplace_back(\"\", 0);\n }\n string aux = solve(v[0].second, v[1].second, v[2].second);\n res = \"\";\n for (int i = 0; i < (int) aux.size(); i++) {\n res += v[aux[i] - 'a'].first;\n }\n }\n }\n if (flag) {\n for (char &c : res) {\n c++;\n }\n }\n return res;\n}\n\nint main() {\n int a, b, c;\n scanf(\"%d %d %d\", &a, &b, &c);\n cout << solve(a, b, c) << endl;\n return 0;\n}\n", "#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include <vector>\n#include <cstring>\n#include <queue>\n#include <map>\n#include <set>\n#include <string>\n#include <cmath>\n\nusing namespace std;\ntypedef long long int ll;\ntypedef pair <int,int> P;\n\nstring solve(int X,int Y,int Z)\n{\n\t//printf(\"%d %d %d\\n\",X,Y,Z);\n\tif(Y==0&&Z==0)\n\t{\n\t\tstring ret=\"\";\n\t\tfor(int i=0;i<X;i++) ret+=\"A\";\n\t\treturn ret;\n\t}\n\tif(X==0)\n\t{\n\t\tstring ret=solve(Y,Z,0);\n\t\tfor(int i=0;i<ret.size();i++)\n\t\t{\n\t\t\tif(ret[i]=='A') ret[i]='B';\n\t\t\telse ret[i]='C';\n\t\t}\n\t\treturn ret;\n\t}\n\telse if(Y==0)\n\t{\n\t\tstring ret=solve(X,Z,0);\n\t\tfor(int i=0;i<ret.size();i++) if(ret[i]=='B') ret[i]='C';\n\t\treturn ret;\n\t}\n\tif(Z==0)\n\t{\n\t\tif(X%Y==0)\n\t\t{\n\t\t\tstring ret=\"\";\n\t\t\tfor(int i=0;i<Y;i++)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<X/Y;j++) ret+=\"A\";\n\t\t\t\tret+=\"B\";\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\tstring ret=solve(X%Y,Y-(X%Y),0);\n\t\tstring ans=\"\";\n\t\tfor(int i=0;i<ret.size();i++)\n\t\t{\n\t\t\tif(ret[i]=='A')\n\t\t\t{\n\t\t\t\tfor(int j=0;j<=X/Y;j++) ans+=\"A\";\n\t\t\t\tans+=\"B\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor(int j=0;j<X/Y;j++) ans+=\"A\";\n\t\t\t\tans+=\"B\";\n\t\t\t}\n\t\t}\n\t\t//printf(\"%d %d %d : %s\\n\",X,Y,Z,ans.c_str());\n\t\treturn ans;\n\t}\n\tint z=X%(Y+Z),k=(X+Y+Z-1)/(Y+Z);\n\tif(z==0) z=Y+Z;\n\tif(z<=Z)\n\t{\n\t\tstring ret=solve(z,Y,Z-z);\n\t\tstring ans=\"\";\n\t\tfor(int i=0;i<ret.size();i++)\n\t\t{\n\t\t\tif(ret[i]=='A')\n\t\t\t{\n\t\t\t\tfor(int j=0;j<k;j++) ans+=\"A\";\n\t\t\t\tans+=\"C\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor(int j=0;j<k-1;j++) ans+=\"A\";\n\t\t\t\tans+=ret[i];\n\t\t\t}\n\t\t}\n\t\t//printf(\"%d %d %d : %s\\n\",X,Y,Z,ans.c_str());\n\t\treturn ans;\n\t}\n\telse\n\t{\n\t\tstring ret=solve(z-Z,Z,Y-(z-Z));\n\t\tstring ans=\"\";\n\t\tfor(int i=0;i<ret.size();i++)\n\t\t{\n\t\t\tif(ret[i]=='C')\n\t\t\t{\n\t\t\t\tfor(int j=0;j<k-1;j++) ans+=\"A\";\n\t\t\t\tans+=\"B\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor(int j=0;j<k;j++) ans+=\"A\";\n\t\t\t\tif(ret[i]=='A') ans+=\"B\";\n\t\t\t\telse ans+=\"C\";\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\treturn \"\";\n}\nint main()\n{\n\tint X,Y,Z;\n\tscanf(\"%d %d %d\",&X,&Y,&Z);\n\tstring ret=solve(X,Y,Z);\n\tfor(int i=0;i<ret.size();i++)\n\t{\n\t\tif(ret[i]=='A') ret[i]='a';\n\t\tif(ret[i]=='B') ret[i]='b';\n\t\tif(ret[i]=='C') ret[i]='c';\n\t}\n\tprintf(\"%s\\n\",ret.c_str());\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nstring ans;\nint x,y,z;\nvoid dfs(int a,int b,int c,string x,string y,string z)\n{\n\tif (a==0) dfs(b,c,0,y,z,\"\");\n\telse if (c==0&&b==0)\n\t{\n\t\tfor (int i=1;i<=a;i++)\n\t\t\tans+=x;\n\t} else\n\t{\n\t\tstring ra=x,rb,rc;\n\t\tfor (int i=0;i<c/a;i++) ra+=z;\n\t\trc=ra+z;\n\t\tint rrc=c%a;\n\t\ta-=(c%a);\n\t\tfor (int i=0;i<b/a;i++) ra+=y;\n\t\trb=ra+y;\n\t\tint rrb=b%a;\n\t\ta-=rrb;\n\t\tdfs(a,rrb,rrc,ra,rb,rc);\n\t}\n}\nint main()\n{\n\tscanf(\"%d%d%d\",&x,&y,&z);\n\tans.clear();\n\tdfs(x,y,z,\"a\",\"b\",\"c\");\n\tcout << ans << endl;\n\treturn 0;\n}\n", "#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<set>\nusing namespace std;\nmultiset<string> s;\nint main()\n{\n\tint A,B,C;\n\tscanf(\"%d %d %d\",&A,&B,&C);\n\tfor(int i=1;i<=A;i++) s.insert(\"a\");\n\tfor(int i=1;i<=B;i++) s.insert(\"b\");\n\tfor(int i=1;i<=C;i++) s.insert(\"c\");\n\tfor(int i=1;i<=A+B+C-1;i++)\n\t{\n\t\tstring s1,s2;\n\t\ts1=*s.begin(); s.erase(s.begin());\n\t\ts2=*(--s.end()); s.erase(--s.end());\n\t\ts.insert(s1+s2);\n\t}\n\tcout<<*s.begin();\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint x, y, z;\n\nstring doit(int d, int e, int f, string x, string y, string z) {\n\t//you have d a's, e b's, and f c's\n\t// cout << d << ' ' << e << ' ' << f << endl;\n\tif (d == 0) {\n\t\tif (e == 0) {\n\t\t\tstring t;\n\t\t\tfor (int i = 0; i < f; ++i)\n\t\t\t\tt += 'c';\n\t\t\treturn t;\n\t\t}\n\n\t\tstring s[e+5];\n\t\tfor (int i = 0; i < e+5; ++i)\n\t\t\ts[i] = \"\";\n\n\t\tfor (int i = 0; i < e; ++i)\n\t\t\ts[i] += 'b';\n\t\tint ct = 0;\n\t\tfor (int i = 0; i < f; ++i) {\n\t\t\ts[ct] += 'c';\n\t\t\tct++;\n\t\t\tct %= e;\n\t\t}\n\n\t\tint c1 = e;\n\t\tfor (int i = 1; i < e; ++i)\n\t\t\tif (s[i] != s[i-1])\n\t\t\t\tc1 = i;\n\n\t\tstring t;\n\t\tt = doit(0, e-c1, c1, \"\", s[c1], s[0]);\n\n\t\tstring ans = \"\";\n\t\tfor (int i = 0; i < t.length(); ++i) {\n\t\t\tif (t[i] == 'b')\n\t\t\t\tans += s[c1];\n\t\t\telse\n\t\t\t\tans += s[0];\n\t\t}\n\n\t\treturn ans;\n\t} else {\n\t\tstring s[d+5];\n\t\tfor (int i = 0; i < d+5; ++i)\n\t\t\ts[i] = \"\";\n\n\t\tfor (int i = 0; i < d; ++i)\n\t\t\ts[i] += 'a';\n\t\tint ct = 0;\n\t\tfor (int i = 0; i < f; ++i) {\n\t\t\ts[ct] += 'c';\n\t\t\tct++;\n\t\t\tct %= d;\n\t\t} \n\n\t\tint ct1 = ct;\n\t\tfor (int i = 0; i < e; ++i) {\n\t\t\ts[ct1] += 'b';\n\t\t\tct1++;\n\t\t\tif (ct1 >= d)\n\t\t\t\tct1 = ct;\n\t\t}\n\n\t\tint c1 = d, c2 = d;\n\t\tfor (int i = 1; i < d; ++i) {\n\t\t\tif (s[i] != s[i-1]) {\n\t\t\t\tif (c1 == d)\n\t\t\t\t\tc1 = i;\n\t\t\t\telse\n\t\t\t\t\tc2 = i;\n\t\t\t}\n\t\t}\n\n\t\tstring t = doit(d-c2, c2-c1, c1, s[c2], s[c1], s[0]);\n\t\tstring ans = \"\";\n\t\tfor (int i = 0; i < t.length(); ++i) {\n\t\t\tif (t[i] == 'a')\n\t\t\t\tans += s[c2];\n\t\t\tif (t[i] == 'b')\n\t\t\t\tans += s[c1];\n\t\t\tif (t[i] == 'c')\n\t\t\t\tans += s[0];\n\t\t}\n\n\t\treturn ans;\n\t}\n}\n\nint main() {\n\tcin >> x >> y >> z;\n\tcout << doit(x, y, z, \"a\", \"b\", \"c\") << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nmultiset<string> s;\nint a, b, c;\nint main() {\n\tscanf(\"%d%d%d\", &a, &b, &c);\n\tfor (int i = 0; i < a; i++) {\n\t\ts.insert(\"a\");\n\t}\n\tfor (int i = 0; i < b; i++) {\n\t\ts.insert(\"b\");\n\t}\n\tfor (int i = 0; i < c; i++) {\n\t\ts.insert(\"c\");\n\t}\n\twhile (s.size() > 1) {\n\t\tstring t = *s.begin() + *--s.end();\n\t\ts.erase(s.begin());\n\t\ts.erase(--s.end());\n\t\ts.insert(t);\n\t}\n\tcout << *s.begin() << endl;\n}", "#include <cstring>\n#include <cstdio>\n#include <iostream>\n#include <set>\nusing namespace std;\nint main() {\n\tint x, y, z; cin >> x >> y >> z;\n\tmultiset<string> st;\n\tfor (int i = 1;i <= x; i++) st.insert(\"a\");\n\tfor (int i = 1;i <= y; i++) st.insert(\"b\");\n\tfor (int i = 1;i <= z; i++) st.insert(\"c\");\n\twhile (st.size() != 1) {\n\t\tauto be = st.begin(), ed = st.end(); ed--;\n\t\tst.insert(*be + *ed);\n\t\tst.erase(be), st.erase(ed);\n\t}\n\tcout << *st.begin() << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n std::multiset <std::string> M;\n int kase;\n for (scanf(\"%d\", &kase); kase; --kase) M.insert(\"a\");\n for (scanf(\"%d\", &kase); kase; --kase) M.insert(\"b\");\n for (scanf(\"%d\", &kase); kase; --kase) M.insert(\"c\");\n while (M.size()>1) {\n std::string s = *M.begin(), t = *M.rbegin();\n M.erase(M.lower_bound(s));\n M.erase(M.lower_bound(t));\n M.insert(s + t);\n }\n printf(\"%s\\n\", (*M.begin()).c_str());\n return 0;\n} ", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\n#define pb push_back\n#define rep(i, a, n) for(int i = (a); i < (n); i++)\n#define dep(i, a, n) for(int i = (a); i >= (n); i--)\n#define mod 1e9+7\n\n__attribute__((constructor))\nvoid initial() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n}\nint x, y, z;\nmultiset<string> ms;\n\n\nint main() {\n cin >> x >> y >> z;\n rep(i, 0, x) ms.insert(\"a\");\n rep(i, 0, y) ms.insert(\"b\");\n rep(i, 0, z) ms.insert(\"c\");\n\n while(ms.size() > 1) {\n auto itr1 = ms.begin();\n auto itr2 = ms.end();\n itr2--;\n ms.insert(*itr1 + *itr2);\n ms.erase(itr1);\n ms.erase(itr2);\n }\n\n cout << *ms.begin() << endl;\n}\n", "#include <iostream>\n#include <string>\n#include <cmath>\n#include<algorithm>\n#include<stack>\n#include<queue>\n#include<map>\n#include<set>\n#include<iomanip>\n#define _USE_MATH_DEFINES\n#include <math.h>\n#include <functional>\n#include<complex>\n#include<cassert>\nusing namespace std;\n\n#define rep(i,x) for(ll i=0;i<x;i++)\n#define repn(i,x) for(ll i=1;i<=x;i++)\n\ntypedef long long ll;\nconst ll INF = 1e17;\nconst ll MOD = 1000000007;\nconst ll MAX = 4000001;\nconst long double eps = 1E-14;\n\nll max(ll a, ll b) {\n\tif (a > b) { return a; }\n\treturn b;\n}\n\nll min(ll a, ll b) {\n\tif (a > b) { return b; }\n\treturn a;\n}\n\nll gcd(ll a, ll b) {\n\tif (b == 0) { return a; }\n\tif (a < b) { return gcd(b, a); }\n\treturn gcd(b, a % b);\n}\n\nll lcm(ll a, ll b) {\n\treturn a / gcd(a, b) * b;\n}\n\nstruct edge {\n\tll ind;\n\tll fr;\n\tll to;\n\tll d;\n};\n\nclass mint {\n\tlong long x;\npublic:\n\tmint(long long x = 0) : x((x% MOD + MOD) % MOD) {}\n\tmint operator-() const {\n\t\treturn mint(-x);\n\t}\n\tmint& operator+=(const mint& a) {\n\t\tif ((x += a.x) >= MOD) x -= MOD;\n\t\treturn *this;\n\t}\n\tmint& operator-=(const mint& a) {\n\t\tif ((x += MOD - a.x) >= MOD) x -= MOD;\n\t\treturn *this;\n\t}\n\tmint& operator*=(const mint& a) {\n\t\t(x *= a.x) %= MOD;\n\t\treturn *this;\n\t}\n\tmint operator+(const mint& a) const {\n\t\tmint res(*this);\n\t\treturn res += a;\n\t}\n\tmint operator-(const mint& a) const {\n\t\tmint res(*this);\n\t\treturn res -= a;\n\t}\n\tmint operator*(const mint& a) const {\n\t\tmint res(*this);\n\t\treturn res *= a;\n\t}\n\n\tmint pow(ll t) const {\n\t\tif (!t) return 1;\n\t\tmint a = pow(t >> 1);\n\t\ta *= a;\n\t\tif (t & 1) a *= *this;\n\t\treturn a;\n\t}\n\n\t// for prime MOD\n\tmint inv() const {\n\t\treturn pow(MOD - 2);\n\t}\n\tmint& operator/=(const mint& a) {\n\t\treturn (*this) *= a.inv();\n\t}\n\tmint operator/(const mint& a) const {\n\t\tmint res(*this);\n\t\treturn res /= a;\n\t}\n\n\tfriend ostream& operator<<(ostream& os, const mint& m) {\n\t\tos << m.x;\n\t\treturn os;\n\t}\n};\n\nmint pw(mint a, ll b) {\n\tif (b == 0) { return 1; }\n\tmint ret = pw(a, b >> 1);\n\tret *= ret;\n\tif (b & 1) { ret *= a; }\n\treturn ret;\n}\n\ntypedef vector<ll> vll;\ntypedef vector<vector<ll>> vvll;\ntypedef vector<vector<vector<ll>>> vvvll;\n\ntypedef vector<mint> vmint;\ntypedef vector<vector<mint>> vvmint;\ntypedef vector<vector<vector<mint>>> vvvmint;\n\n/////////////////////////////////////\nll X, Y, Z;\nll M;\n\n\nbool ch(string s) {\n\t//cout << s << endl;\n\n\tll N = s.size();\n\n\tvvll lis(N+1);\n\trep(i, N+1) {\n\t\t//cout << i << endl;\n\t\tfor (ll j = i; j <= N; j++) {\n\t\t\tif (s.substr(0, i) > s.substr(j - i, i)) { return false; }\n\t\t\tif (s.substr(0, i) == s.substr(j - i, i)) {\n\t\t\t\tlis[j].push_back(i);\n\t\t\t\t//cout << j << \" \";\n\t\t\t}\n\t\t}\n\t\t//cout << endl;\n\t}\n\n\tvector<vvvll> dp(M + 1, vvvll(N + 1, vvll(X + 1, vll(Y + 1, 0))));\n\t\n\tll xx = X; ll yy = Y;\n\t\n\trep(i, N) {\n\t\tif (s[i] == 'a') { xx--; }\n\t\tif (s[i] == 'b') { yy--; }\n\t}\n\tif (xx < 0 || yy < 0||xx+yy>M-N) { return false; }\n\tdp[N][N][xx][yy] = 1;\n\n\tfor (ll i = N; i < M; i++)rep(j, N + 1)rep(x, X + 1)rep(y, Y + 1) {\n\t\tif (dp[i][j][x][y] == 0) { continue; }\n\n\t\tvll d(3,0);\n\t\tfor (ll w : lis[j]) {\n\t\t\tif (w == N) { continue; }\n\t\t\trep(k, 3) {\n\t\t\t\tif (s[w] - 'a' > k) { d[k] = -1; }\n\t\t\t\telse if (s[w] - 'a' == k) { d[k] = w + 1; }\n\t\t\t}\n\t\t}\n\n\t\tif (d[0] != -1 && x > 0)dp[i + 1][d[0]][x - 1][y] = 1;\n\t\tif (d[1] != -1 && y > 0) { dp[i + 1][d[1]][x][y - 1] = 1; }\n\t\tif (d[2] != -1 && i + x + y < M) { dp[i + 1][d[2]][x][y] = 1; }\n\t}\n\n\t//rep(i, M + 1)rep(j, N + 1)rep(x, X + 1)rep(y, Y + 1) {\n\t//\tif (dp[i][j][x][y] == 1) { cout << i << j << x << y << endl; }\n\t//}\n\n\trep(j, N + 1) {\n\t\tif (dp[M][j][0][0] == 0) { continue; }\n\n\t\tbool b = 1;\n\t\trep(k, j + 1) {\n\t\t\tstring t = s.substr(j - k, k) + s.substr(0, N - k);\n\t\t\tif (t < s) { b = 0; }\n\t\t}\n\n\t\tif (b) { return true; }\n\t}\n\n\treturn false;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\n\t\n\tcin >> X >> Y >> Z;\n\tM = X + Y + Z;\n\n\n\tstring s = \"\";\n\n\trep(i, M) {\n\t\tif (ch(s + 'c')) { s += 'c'; }\n\t\telse if (ch(s + 'b')) { s += 'b'; }\n\t\telse if (ch(s + 'a')) { s += 'a'; }\n\t}\n\tcout << s << endl;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nstring solve(int x, int y, int z) {\n if (y + z == 0) return string(x, 'a');\n if (z + x == 0) return string(y, 'b');\n if (x + y == 0) return string(z, 'c');\n if (x == 0) {\n string nans = solve(y, z, 0);\n for (char &c : nans) c += 1;\n return nans;\n }\n if (z == 0) {\n string nans = solve(x, 0, y);\n for (char &c : nans) if (c == 'c') c = 'b';\n return nans;\n }\n if (x >= z) {\n string nans = solve(x - z, z, y);\n string ans;\n for (char c : nans) {\n if (c == 'a') {\n ans += 'a';\n } else if (c == 'b') {\n ans += \"ac\";\n } else {\n ans += 'b';\n }\n }\n return ans;\n } else {\n string nans = solve(x, y, z - x);\n string ans;\n for (char c : nans) {\n if (c == 'a') {\n ans += \"ac\";\n } else {\n ans += c;\n }\n }\n return ans;\n }\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n int x, y, z;\n cin >> x >> y >> z;\n cout << solve(x, y, z) << \"\\n\";\n return 0;\n}\n", "#include <vector> \n#include <list> \n#include <map> \n#include <set> \n#include <deque> \n#include <queue> \n#include <stack> \n#include <bitset> \n#include <algorithm> \n#include <functional> \n#include <numeric> \n#include <utility> \n#include <sstream> \n#include <iostream> \n#include <iomanip> \n#include <cstdio> \n#include <cmath> \n#include <cstdlib> \n#include <cctype> \n#include <string> \n#include <cstring> \n#include <ctime> \n\nusing namespace std;\n\n#define _int64 long long\n\nint main()\n{\n int i,j,k,lim,x,y,z,now;\n string s,ans;\n vector<string> a[2];\n scanf(\"%d%d%d\",&x,&y,&z);\n a[0].clear();\n for (i=0;i<x;i++)\n {\n s=\"\";\n s.push_back('a');\n a[0].push_back(s);\n }\n for (i=0;i<y;i++)\n {\n s=\"\";\n s.push_back('b');\n a[0].push_back(s);\n }\n for (i=0;i<z;i++)\n {\n s=\"\";\n s.push_back('c');\n a[0].push_back(s);\n }\n now=0;\n while (a[now].size()>1)\n {\n sort(a[now].begin(),a[now].end());\n s=a[now][0];\n\n //for (i=0;i<a[now].size();i++)\n // cout<<a[now][i]<<\" \";\n //cout<<endl;\n for (i=0;i<a[now].size();i++)\n if (a[now][i]!=s) break;\n if (i==a[now].size()) break;\n lim=i;\n j=a[now].size()-1;\n a[1-now].clear();\n for (i=0;i<=j;i++)\n {\n if ((j>=lim)&&(i<lim))\n {\n a[1-now].push_back(a[now][i]+a[now][j]);\n j--;\n }\n else\n {\n a[1-now].push_back(a[now][i]);\n }\n }\n now=1-now;\n }\n ans=\"\";\n for (i=0;i<a[now].size();i++)\n ans=ans+a[now][i];\n printf(\"%s\\n\",ans.c_str());\n return 0;\n}", "#include<bits/stdc++.h>\n#define inf 0x7fffffff\n#define maxn 10005\n#define maxm 120005\ntypedef long long ll;\nusing namespace std; \n\nint x, y, z;\nmultiset<string> Q;\n\ninline int read(){\n\tint x = 0, f = 1;char ch = getchar();\n\twhile(ch > '9' || ch < '0'){if(ch == '-') f = -1;ch = getchar();}\n\twhile(ch >= '0' && ch <= '9'){x = x * 10 + ch -'0';ch = getchar();}\n\treturn x * f;\n}\n\nint main(){\n\tint i,j,u,v,f;\n\tx = read(), y = read(), z = read();\n\tfor(i = 1;i <= x;i++) Q.insert(\"a\");\n\tfor(i = 1;i <= y;i++) Q.insert(\"b\");\n\tfor(i = 1;i <= z;i++) Q.insert(\"c\");\n\twhile(Q.size() > 1){\n\t\tstring a = *Q.begin(), b = *Q.rbegin();\n\t\tQ.erase(Q.begin()), Q.erase(Q.find(b));\n\t\tQ.insert(a + b);\n\t}\n\tcout<<*Q.begin();\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define ms(s, n) memset(s, n, sizeof(s))\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)\n#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)\n#define sz(a) int((a).size())\n#define present(t, x) (t.find(x) != t.end())\n#define all(a) (a).begin(), (a).end()\n#define uni(a) (a).erase(unique(all(a)), (a).end())\n#define pb push_back\n#define pf push_front\n#define mp make_pair\n#define fi first\n#define se second\n#define prec(n) fixed<<setprecision(n)\n#define bit(n, i) (((n) >> (i)) & 1)\n#define bitcount(n) __builtin_popcountll(n)\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef pair<int, int> pi;\ntypedef vector<int> vi;\ntypedef vector<pi> vii;\nconst int MOD = (int) 1e9 + 7;\nconst int FFTMOD = 1007681537;\nconst int INF = (int) 1e9;\nconst ll LINF = (ll) 1e18;\nconst ld PI = acos((ld) -1);\nconst ld EPS = 1e-12;\ninline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}\ninline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}\ninline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}\ntemplate<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}\ntemplate<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}\ninline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}\ninline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}\ninline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}\ninline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}\ninline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}\ninline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}\ninline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}\ninline int sign(ld x, ld y) {return sign(x - y);}\n#define db(x) cerr << #x << \" = \" << (x) << \" \";\n#define endln cerr << \"\\n\";\n\nvoid solve() {\n multiset<string> st;\n FOR(i, 0, 3) {\n int x; cin >> x;\n while (x--) {\n string s = \"\";\n s += char('a' + i);\n st.insert(s);\n }\n }\n while (sz(st) > 1) {\n string s = *st.begin();\n string t = *st.rbegin();\n st.erase(st.find(s));\n st.erase(st.find(t));\n st.insert(s + t);\n }\n cout << *st.begin() << \"\\n\";\n}\n\nint main() {\n ios_base::sync_with_stdio(0), cin.tie(0);\n int JUDGE_ONLINE = 1;\n if (fopen(\"in.txt\", \"r\")) {\n JUDGE_ONLINE = 0;\n assert(freopen(\"in.txt\", \"r\", stdin));\n //assert(freopen(\"out.txt\", \"w\", stdout));\n }\n solve();\n if (!JUDGE_ONLINE) {\n cout << \"\\nTime elapsed: \" << 1000 * clock() / CLOCKS_PER_SEC << \"ms\\n\";\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MX = 1000;\n\nchar ans[MX][MX];\n\nvoid solve2(int x, int y, int p) {\n\tif (x == 0) {\n\t\tfor (int i = 0; i < y; i++) ans[p][i] = 'b';\n\t}\n\telse if (y == 0) {\n\t\tfor (int i = 0; i < x; i++) ans[p][i] = 'a';\n\t}\n\telse if (x >= y) {\n\t\tint g = (x + y - 1) / y;\n\t\tint f = x % y;\n\t\tif (f == 0) f = y;\n\t\t\n\t\tsolve2(f, y - f, p + 1);\n\t\t\n\t\tfor (int i = 0, j = 0; i < y; i++) {\n\t\t\tfor (int k = 0; k < g - 1; k++, j++) ans[p][j] = 'a';\n\t\t\t\n\t\t\tif (ans[p + 1][i] == 'a') ans[p][j++] = 'a';\n\t\t\tans[p][j++] = 'b';\n\t\t}\n\t}\n\telse {\n\t\tint g = (x + y - 1) / x;\n\t\tint f = y % x;\n\t\tif (f == 0) f = x;\n\t\t\n\t\tsolve2(x - f, f, p + 1);\n\t\t\n\t\tfor (int i = 0, j = 0; i < x; i++) {\n\t\t\tans[p][j++] = 'a';\n\t\t\tfor (int k = 0; k < g - 1; k++, j++) ans[p][j] = 'b';\n\t\t\t\n\t\t\tif (ans[p + 1][i] == 'b') ans[p][j++] = 'b';\n\t\t}\n\t}\n}\n\nvoid solve(int x, int y, int z, int p = 0) {\n\tif (x == 0) {\n\t\tsolve2(y, z, p);\n\t\tfor (int i = 0; i < y + z; i++) ans[p][i]++;\n\t}\n\telse if (y == 0) {\n\t\tsolve2(x, z, p);\n\t\tfor (int i = 0; i < x + z; i++)\n\t\t\tif (ans[p][i] == 'b')\n\t\t\t\tans[p][i] = 'c';\n\t}\n\telse if (z == 0) {\n\t\tsolve2(x, y, p);\n\t}\n\telse if (x >= y + z) {\n\t\tint g = (x + y + z - 1) / (y + z);\n\t\tint f = x % (y + z);\n\t\tif (f == 0) f = y + z;\n\t\t\n\t\tif (z >= f) {\n\t\t\tsolve(f, y, z - f, p + 1);\n\t\t\t\n\t\t\tfor (int i = 0, j = 0; i < y + z; i++) {\n\t\t\t\tfor (int k = 0; k < g - 1; k++, j++) ans[p][j] = 'a';\n\t\t\t\t\n\t\t\t\tif (ans[p + 1][i] == 'a') {\n\t\t\t\t\tans[p][j++] = 'a';\n\t\t\t\t\tans[p][j++] = 'c';\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans[p][j++] = ans[p + 1][i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tsolve(f - z, z, y + z - f, p + 1);\n\t\t\t\n\t\t\tfor (int i = 0, j = 0; i < y + z; i++) {\n\t\t\t\tfor (int k = 0; k < g - 1; k++, j++) ans[p][j] = 'a';\n\t\t\t\t\n\t\t\t\tif (ans[p + 1][i] == 'c') {\n\t\t\t\t\tans[p][j++] = 'b';\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans[p][j++] = 'a';\n\t\t\t\t\tans[p][j++] = ans[p + 1][i] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tstatic string S[MX];\n\t\tfor (int i = 0; i < x; i++) S[i] = \"a\";\n\t\tfor (int i = 0; i < z; i++) S[i % x] += \"c\";\n\t\tfor (int i = 0; i < y; i++) S[z % x + i % (x - z % x)] += \"b\";\n\t\t\n\t\tset<string> strs;\n\t\tfor (int i = 0; i < x; i++) strs.insert(S[i]);\n\t\t\n\t\tstring SS[3];\n\t\tint cnt[3] = {0, 0, 0}, iter = 0;\n\t\tfor (auto& s : strs) {\n\t\t\tSS[iter] = s;\n\t\t\tcnt[iter] = 0;\n\t\t\tfor (int i = 0; i < x; i++) if (S[i] == s) cnt[iter]++;\n\t\t\titer++;\n\t\t}\n\t\t\n\t\tsolve(cnt[0], cnt[1], cnt[2], p + 1);\n\t\t\n\t\tfor (int i = 0, j = 0; i < x; i++)\n\t\t\tfor (char c : SS[ans[p + 1][i] - 'a'])\n\t\t\t\tans[p][j++] = c;\n\t}\n}\n\nint main() {\n\tint x, y, z;\n\tignore = scanf(\"%d %d %d\", &x, &y, &z);\n\tsolve(x, y, z);\n\tans[0][x + y + z] = 0;\n\tprintf(\"%s\\n\", ans[0]);\n\t\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n#define fi first\n#define se second\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define rrep(i,n) for(int i = 1; i <= (n); ++i)\n#define drep(i,n) for(int i = (n)-1; i >= 0; --i)\n#define srep(i,s,t) for (int i = s; i < t; ++i)\n#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)\n#define rng(a) a.begin(),a.end()\n#define maxs(x,y) x = max(x,y)\n#define mins(x,y) x = min(x,y)\n#define pb push_back\n#define sz(x) (int)(x).size()\n#define pcnt __builtin_popcount\n#define uni(x) x.erase(unique(rng(x)),x.end())\n#define snuke srand((unsigned)clock()+(unsigned)time(NULL));\n#define df(x) int x = in()\n#define dame { puts(\"-1\"); return 0;}\n#define show(x) cout<<#x<<\" = \"<<x<<endl;\n#define PQ(T) priority_queue<T,vector<T>,greater<T> >\n#define bn(x) ((1<<x)-1)\n#define newline puts(\"\")\n#define v(T) vector<T>\n#define vv(T) vector<vector<T>>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned uint;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<P> vp;\ninline int in() { int x; scanf(\"%d\",&x); return x;}\ninline void priv(vi a) { rep(i,sz(a)) printf(\"%d%c\",a[i],i==sz(a)-1?'\\n':' ');}\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v)\n{rep(j,sz(v))i>>v[j];return i;}\ntemplate<typename T>string join(const vector<T>&v)\n{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T>ostream& operator<<(ostream&o,const vector<T>&v)\n{if(sz(v))o<<join(v);return o;}\ntemplate<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)\n{return i>>v.fi>>v.se;}\ntemplate<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v)\n{return o<<v.fi<<\",\"<<v.se;}\nconst int MX = 200005, INF = 1001001001;\nconst ll LINF = 1e18;\nconst double eps = 1e-10;\ntypedef v(string) vs;\n\n\nint main() {\n multiset<string> s;\n rep(i,3) {\n int n;\n scanf(\"%d\",&n);\n rep(j,n) s.insert(string(1,'a'+i));\n }\n while (sz(s) > 1) {\n auto it = s.end(); --it;\n string x = *(s.begin()) + *it;\n s.erase(it); s.erase(s.begin());\n s.insert(x);\n }\n cout<<*(s.begin())<<endl;\n return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.List;\n\npublic class Main {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tint x = ni(), y = ni(), z = ni();\n\t\tList<String> list = new ArrayList<>();\n\t\tfor(int i = 0;i < x;i++)list.add(\"a\");\n\t\tfor(int i = 0;i < y;i++)list.add(\"b\");\n\t\tfor(int i = 0;i < z;i++)list.add(\"c\");\n\t\twhile(list.size() > 1){\n\t\t\tint argmin = 0;\n\t\t\tfor(int i = 0;i < list.size();i++){\n\t\t\t\tif(list.get(i).compareTo(list.get(argmin)) < 0){\n\t\t\t\t\targmin = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tString min = list.remove(argmin);\n\t\t\tint argmax = 0;\n\t\t\tfor(int i = 0;i < list.size();i++){\n\t\t\t\tif(list.get(i).compareTo(list.get(argmax)) > 0){\n\t\t\t\t\targmax = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tString max = list.remove(argmax);\n\t\t\tlist.add(min+max);\n\t\t}\n\t\tout.println(list.get(0));\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tlong S = System.currentTimeMillis();\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\ttr(G-S+\"ms\");\n\t}\n\t\n\tprivate static boolean eof()\n\t{\n\t\tif(lenbuf == -1)return true;\n\t\tint lptr = ptrbuf;\n\t\twhile(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\t\t\n\t\ttry {\n\t\t\tis.mark(1000);\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b == -1){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn true;\n\t\t\t\t}else if(!isSpaceChar(b)){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate static int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n//\tprivate static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\t\n\tprivate static String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate static char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate static char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate static int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate static int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nstring f(int x, int y, int z, string a, string b, string c) {\n //cout << x << ' ' << y << ' ' << z << ' ' << a << ' ' << b << ' ' << c << endl;\n if(y == 0 && z == 0) {\n string ret;\n for(int i = 0; i < x; i++) ret += a;\n return ret;\n }\n if(x == 0) return f(y, z, 0, b, c, a);\n if(y == 0 && z) return f(x, z, y, a, c, b);\n\n if(z == 0) {\n if(x <= y) {\n string na = a;\n for(int i = 0; i < y / x; i++) na += b;\n return f(x, y % x, 0, na, b, c);\n }\n else {\n string na = a, nb = a + b;\n return f(x - y, y, 0, na, nb, c);\n }\n }\n else if(x <= z) {\n string na = a + c;\n return f(x, y, z - x, na, b, c);\n }\n else if(x <= y + z) {\n string nb = a + c;\n return f(x - z, z, y, a, nb, b);\n }\n else {\n string na = a, nb = a + b, nc = a + c;\n return f(x - y - z, y, z, na, nb, nc);\n }\n}\n\nint X, Y, Z;\n\nint main() {\n cin >> X >> Y >> Z;\n cout << f(X, Y, Z, \"a\", \"b\", \"c\");\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define times(n, i) uptil(0, n, i)\n#define rtimes(n, i) downto((n) - 1, 0, i)\n#define upto(f, t, i) for(int i##_to_ = (t), i = (f); i <= i##_to_; i++)\n#define uptil(f, t, i) for(int i##_to_ = (t), i = (f); i < i##_to_; i++)\n#define downto(f, t, i) for(int i##_to_ = (t), i = (f); i >= i##_to_; i--)\n#define downtil(f, t, i) for(int i##_to_ = (t), i = (f); i > i##_to_; i--)\ntypedef long double LD;\n#define long long long\n\n#if defined(EBUG) && !defined(ONLINE_JUDGE)\n#define debug true\n#define _GLIBCXX_DEBUG\n#define _LIBCPP_DEBUG 2\n#define _LIBCPP_DEBUG2 2\n#define ln << endl\n#else\n#define debug false\n#define ln << '\\n'\n#endif\n#define tb << '\\t'\n#define sp << ' '\n\nvector<char> pyon(int x, int y, int z) {\n vector<char> ans;\n if(!y && !z) {\n ans = vector<char>(x, 'a');\n } else if(!z && !x) {\n ans = vector<char>(y, 'b');\n } else if(!x && !y) {\n ans = vector<char>(z, 'c');\n } else {\n bool zoi = !x;\n if(zoi) swap(x, y);\n\n ans.reserve(x + y + z);\n int p = z / x, s = z % x, q = y / (x - s), t = y % (x - s), u = x - s - t;\n for(char c: pyon(u, t, s)) {\n ans.push_back(zoi ? 'b' : 'a');\n if(c == 'a') {\n times(p, o) ans.push_back('c');\n times(q, o) ans.push_back('b');\n } else if(c == 'b') {\n times(p, o) ans.push_back('c');\n times(q+1, o) ans.push_back('b');\n } else {\n times(p+1, o) ans.push_back('c');\n }\n }\n }\n if(debug) { cout << x sp << y sp << z tb; for(char c: ans) cout << c; cout ln; }\n return ans;\n}\n\nsigned main() { // long: 64bit\n if(!debug) {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n\n int X, Y, Z; scanf(\"%d%d%d\", &X, &Y, &Z);\n\n for(char c: pyon(X, Y, Z)) cout << c;\n cout ln;\n\n return 0;\n}\n", "#include<cstdio>\n#include<string>\nint X,Y,Z;\nchar t[510],s[510];\nvoid dfs(int x,int y,int z,int n){\n\tif(!x&&!y&&!z){\n\t\tt[n]=0;\n\t\tbool fl=1;\n\t\tfor(int i=1;i<n&&fl;i++){\n\t\t\tint j=0;while(j<n&&t[(i+j)%n]==t[j])j++;\n\t\t\tif(j<n&&t[(i+j)%n]<t[j])fl=0;\n\t\t}\n\t\tif(fl)for(int i=0;i<=n;i++)s[i]=t[i];\n\t}\n\telse{\n\t\tif(x)t[n]='a',dfs(x-1,y,z,n+1);\n\t\tif(y)t[n]='b',dfs(x,y-1,z,n+1);\n\t\tif(z)t[n]='c',dfs(x,y,z-1,n+1);\n\t}\n}\nstd::string con(int X,int Y,int Z){\n\tstd::string S;\n\tif(!X){\n\t\tif(!Y&&!Z)return S;\n\t\tS=con(Y,Z,0);\n\t\tfor(int i=0;i<S.length();i++)S[i]++;\n\t\treturn S;\n\t}\n\tif(!Y){\n\t\tif(!Z){\n\t\t\tfor(int i=0;i<X;i++)S.push_back('a');\n\t\t\treturn S;\n\t\t}\n\t\tS=con(X,Z,0);\n\t\tfor(int i=0;i<S.length();i++)S[i]=='b'?S[i]='c':1;\n\t\treturn S;\n\t}\n\tif(!Z){\n\t\tfor(int i=1;i<=X;i++){\n\t\t\tS.push_back('a');\n\t\t\tfor(int j=Y*(i-1)/X;j<Y*i/X;j++)S.push_back('b');\n\t\t}\n\t\treturn S;\n\t}\n\tint t=X-Z%X;\n\tstd::string T=con(t-Y%t,Y%t,Z%X);\n\tfor(int i=0;i<T.length();i++){\n\t\tS.push_back('a');\n\t\tif(T[i]=='a'){\n\t\t\tfor(int j=0;j<Z/X;j++)S.push_back('c');\n\t\t\tfor(int j=0;j<Y/t;j++)S.push_back('b');\n\t\t}\n\t\tif(T[i]=='b'){\n\t\t\tfor(int j=0;j<Z/X;j++)S.push_back('c');\n\t\t\tfor(int j=0;j<Y/t+1;j++)S.push_back('b');\n\t\t}\n\t\tif(T[i]=='c'){\n\t\t\tfor(int j=0;j<Z/X+1;j++)S.push_back('c');\n\t\t}\n\t}\n\treturn S;\n}\nint main(){\n\t/*\n\tfor(X=0;X<=5;X++)\n\t\tfor(Y=0;Y<=8;Y++)\n\t\t\tfor(Z=0;Z<=8;Z++){\n\t\t\t\tprintf(\"%d,%d,%d: \",X,Y,Z);\n\t\t\t\tdfs(X,Y,Z,0);\n\t\t\t\tfor(int i=0,p=0;i<X;i++){\n\t\t\t\t\tint cs=0;\n\t\t\t\t\tfor(++p;s[p]&&s[p]!='a';p++)if(s[p]=='c')cs++;\n\t\t\t\t\tprintf(\"%d,\",cs);\n\t\t\t\t}\n\t\t\t\tputs(s);\n\t\t\t\tprintf(\"(%d,%d,%d)\",X,Y,Z);\n\t\t\t\tputs(con(X,Y,Z).c_str());\n\t\t\t\t\n\t\t\t\tif(!X){\n\t\t\t\t\tprintf(\"(%d,%d,%d)\",X,Y,Z);\n\t\t\t\t\tfor(int i=1;i<=Y;i++){\n\t\t\t\t\t\tputchar('b');\n\t\t\t\t\t\tfor(int j=Z*(i-1)/Y;j<Z*i/Y;j++)putchar('c');\n\t\t\t\t\t}\n\t\t\t\t\tif(!Y)for(int i=0;i<Z;i++)putchar('c');\n\t\t\t\t\tputs(\"\");\n\t\t\t\t}\n\t\t\t}*/\n\tint X,Y,Z;scanf(\"%d%d%d\",&X,&Y,&Z);\n\tputs(con(X,Y,Z).c_str());\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nstring slow(int ca, int cb, int cc) {\n int n = ca + cb + cc;\n\n string s = \"\";\n for (int i = 0; i < ca; i++) s += 'a';\n for (int i = 0; i < cb; i++) s += 'b';\n for (int i = 0; i < cc; i++) s += 'c';\n\n string ans = s;\n do {\n string mn = s;\n for (int i = 0; i < n; i++) {\n string t = s;\n rotate(t.begin(), t.begin() + i, t.end());\n mn = min(mn, t);\n }\n ans = max(ans, mn);\n } while (next_permutation(s.begin(), s.end()));\n return ans;\n}\n\nstring lexmin(string s) {\n string mn = s;\n for (int i = 0; i < (int)s.length(); i++) {\n string t = s;\n rotate(t.begin(), t.begin() + i, t.end());\n mn = min(mn, t);\n }\n return mn;\n}\n\nstring solve(vector<string> v) {\n sort(v.begin(), v.end());\n int n = v.size();\n if (v[0] == v[n - 1]) {\n string s = \"\";\n for (auto t : v) s += t;\n return lexmin(s);\n }\n map<string, int> mp;\n for (auto s : v) mp[s]++;\n\n vector<pair<string, int> > b;\n for (auto it : mp) {\n b.push_back(it);\n }\n\n vector<string> nv;\n vector<string> cur(b[0].second, b[0].first);\n for (int i = (int)b.size() - 1; i >= 1; i--) {\n for (int j = 0; j < b[i].second; j++) {\n cur[j % (int)cur.size()] += b[i].first;\n }\n if (b[i].second % cur.size()) {\n int rem = b[i].second % cur.size();\n //while (cur.size() > rem) {\n for (int l = 0; l < rem; l++) {\n nv.push_back(*cur.begin());\n //cur.pop_back();\n cur.erase(cur.begin());\n }\n }\n }\n for (auto s : cur) nv.push_back(s);\n return solve(nv);\n}\n\nstring fast(int ca, int cb, int cc) {\n bool f = 0;\n if (ca == 0) {\n f = 1;\n ca = cb;\n cb = cc;\n cc = 0;\n }\n if (ca == 0) {\n return string(cb, 'c');\n }\n int n = ca + cb + cc;\n\n vector<string> a(ca, \"a\");\n for (int i = 0; i < cc; i++) {\n a[i % ca] += \"c\";\n }\n for (int i = 0; i < cb; i++) {\n a[(i + cc) % (ca - cc % ca) + cc % ca] += \"b\";\n }\n sort(a.begin(), a.end());\n\n string ans = solve(a);\n //do {\n /*while (1) {\n string s = \"\";\n random_shuffle(a.begin(), a.end());\n for (string ss : a) s += ss;\n string mn = s;\n for (int i = 0; i < n; i++) {\n string t = s;\n rotate(t.begin(), t.begin() + i, t.end());\n mn = min(mn, t);\n }\n ans = max(ans, mn);\n if (clock() / (double)CLOCKS_PER_SEC > 1.9) break;\n }*/\n\n if (f) {\n for (char &c : ans) {\n if (c == 'a') c = 'b';\n else c = 'c';\n }\n }\n return ans;\n}\n\nint main() {\n#ifdef HOME\n freopen(\"in\", \"r\", stdin);\n#endif\n\n /*int n = 10;\n for (int ca = 0; ca <= n; ca++) {\n for (int cb = 0; ca + cb <= n; cb++) {\n //for (int cc = 0; ca + cb + cc <= n; cc++) {\n int cc = n - ca - cb;\n string ans1 = fast(ca, cb, cc);\n string ans2 = slow(ca, cb, cc);\n //string ans2 = ans1;\n cout << ca << \" \" << cb << \" \" << cc << \" \" << ans1 << \" \" << ans2 << endl;\n if (ans1 != ans2) {\n cout << \"FAIL\" << endl;\n fast(ca, cb, cc);\n return 0;\n }\n }\n }\n cout << \"OK\" << endl;*/\n\n int ca, cb, cc;\n while (cin >> ca >> cb >> cc) {\n cout << fast(ca, cb, cc) << endl;\n }\n\n#ifdef HOME\n cerr << clock() / (double)CLOCKS_PER_SEC << endl;\n#endif\n return 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\ntypedef long long ll ;\n#define rep(i, a, b) for (int i = a; i <= b; ++ i) \nusing namespace std ;\n \nstring trans(string x, string a, string b, string c) {\n\tstring ret ;\n\trep(i, 0, (int) x.length() - 1) {\n\t\tif (x[i] == 'a') ret += a ;\n\t\tif (x[i] == 'b') ret += b ;\n\t\tif (x[i] == 'c') ret += c ;\n\t}\n\treturn ret ;\n}\n \nvoid dfs(string a, string b, string c, int x, int y, int z) {\n\tif (!y && !z) {\n\t\trep(i, 1, x) cout << a ;\n\t\treturn ;\n\t}\n\tstring s[55] ;\n\trep(i, 1, x) s[i] = 'a' ;\n\tfor ( ; z; ) {\n\t\tfor (int i = x; i; -- i) if (z) {\n\t\t\ts[i] = s[i] + 'c' ;\n\t\t\t-- z ;\n\t\t}\n\t}\n\tint k = x ;\n\trep(i, 1, x - 1) if (s[i].length() != s[i + 1].length()) {\n\t\tk = i ; \n\t\tbreak ;\n\t}\n\tfor ( ; y; ) {\n\t\tfor (int i = k; i; -- i) if (y) {\n\t\t\ts[i] = s[i] + 'b' ;\n\t\t\t-- y ;\n\t\t}\n\t}\n\tint X = 0, Y = 0, Z = 0, d[5] = {0} ;\n\trep(i, 1, x - 1) if (s[i] != s[i + 1]) {\n\t\td[++ d[0]] = i ;\n\t} \n\td[++ d[0]] = x ;\n\tif (d[0]) X = d[1] ;\n\tif (d[0] > 1) Y = d[2] - d[1] ;\n\tif (d[0] > 2) Z = d[3] - d[2] ;\n\tdfs(trans(s[d[1]], a, b, c), trans(s[d[2]], a, b, c), trans(s[d[3]], a, b, c), X, Y, Z) ;\n}\n \nint main() {\n\tint x, y, z ;\n\tstring s[55] ;\n\tscanf(\"%d%d%d\", &x, &y, &z) ;\n\tif (!x && !y) {\n\t\trep(i, 1, z) printf(\"%c\", 'c') ;\n\t} else\n\tif (!x) {\n\t\tdfs(\"b\", \"c\", \"a\", y, z, x) ;\n\t} else {\n\t\tdfs(\"a\", \"b\", \"c\", x, y, z) ;\n\t}\n\treturn 0 ; \n}" ]
You are given an integer sequence of length N. The i-th term in the sequence is a_i. In one operation, you can select a term and either increment or decrement it by one. At least how many operations are necessary to satisfy the following conditions? * For every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero. * For every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term. Constraints * 2 ≤ n ≤ 10^5 * |a_i| ≤ 10^9 * Each a_i is an integer. Input Input is given from Standard Input in the following format: n a_1 a_2 ... a_n Output Print the minimum necessary count of operations. Examples Input 4 1 -3 1 0 Output 4 Input 5 3 -6 4 -5 7 Output 0 Input 6 -1 4 3 2 -5 4 Output 8
[ "n=int(input())\na=list(map(int,input().split()))\nu=0\ns=1\nx=0\ny=0\nfor i in a:\n u+=i\n if s*u<=0:\n x+=1-s*u\n u=s\n s=s*(-1)\ns=-1\nu=0\nfor i in a:\n u+=i\n if s*u<=0:\n y+=1-s*u\n u=s\n s=-1*s\nprint(min(x,y))", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n vector<long> a(n);\n for(int i=0;i<n;i++) cin >> a[i];\n \n \n long odd=0,even=0,sum=0;\n \n for(int i=0;i<n;i++){ //+-\n sum+=a[i];\n if(i%2==0&&sum<=0){ \n odd+=abs(sum)+1;\n sum=+1; \n }\n else if(i%2==1&&sum>=0){\n odd+=abs(sum)+1;\n sum=-1; \n }\n }\n \n sum=0;\n for(int i=0;i<n;i++){ //-+\n sum+=a[i];\n if(i%2==1&&sum<=0){\n even+=abs(sum)+1;\n sum=+1; \n }\n else if(i%2==0&&sum>=0){\n even+=abs(sum)+1;\n sum=-1; \n }\n }\n \n cout << min(odd,even) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n int n;cin>>n;\n int a[n];\n for (int i=0;i<n;i++)\n cin>>a[i];\n ll mn=1e18;\n for (int i=0;i<2;i++) {\n ll sm=0;\n ll cnt=0;\n for (int j=0;j<n;j++) {\n sm+=a[j];\n if ((i+j)%2==0) {\n if (sm<=0) {\n cnt+=-sm+1;\n sm=1;\n }\n } else {\n if (sm>=0) {\n cnt+=sm+1;\n sm=-1;\n }\n }\n }\n mn=min(mn,cnt);\n }\n cout<<mn<<endl;\n return 0;\n}", "n=int(input())\nA=list(map(int,input().split()))\ndef chk(A,t):\n ans=0\n s=0\n for i in A:\n s+=i\n if t==True and s<1:\n ans+=1-s\n s=1\n elif t==False and s>-1:\n ans+=1+s\n s=-1\n t=not t\n return ans\nprint(min(chk(A,True),chk(A,False)))", "n = int(input())\na = list(map(int, input().split()))\n\nans = 10 ** 18\nfor z in range(2):\n if z == 0:\n sign = 1\n else:\n sign = -1\n c = 0\n cost = 0\n for x in a:\n c += x\n if c * sign <= 0:\n cost += 1 - c * sign\n c = sign\n sign *= -1\n ans = min(ans, cost)\nprint(ans)", "N = int(input())\nA = list(map(int, input().split()))\n\ns = max(A[0], +1)\nans_p = abs(A[0]-s)\nfor a in A[1:]:\n if s>0: b=min(a, -s-1)\n if s<0: b=max(a, -s+1)\n s += b\n ans_p += abs(a-b)\n\ns = min(A[0], -1)\nans_n = abs(A[0]-s)\nfor a in A[1:]:\n if s>0: b=min(a, -s-1)\n if s<0: b=max(a, -s+1)\n s += b\n ans_n += abs(a-b)\n\nprint(min(ans_p, ans_n))", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\nint main(){\n ll n,ce=0,cf=0;\n cin>>n;\n ll a[n],e[n],f[n];\n cin>>a[0];\n e[0]=a[0];\n f[0]=a[0];\n if(e[0]<1){\n e[0]=1;\n ce+=1-a[0];\n }\n if(f[0]>-1){\n f[0]=-1;\n cf+=a[0]+1;\n }\n for(int i=1;i<n;i++){\n cin>>a[i];\n e[i]=e[i-1]+a[i];\n f[i]=f[i-1]+a[i];\n if(i%2==1){\n if(e[i]>-1){\n ce+=e[i]+1;\n e[i]=-1;\n }\n if(f[i]<1){\n cf+=1-f[i];\n f[i]=1;\n }\n }else{\n if(f[i]>-1){\n cf+=f[i]+1;\n f[i]=-1;\n }\n if(e[i]<1){\n ce+=1-e[i];\n e[i]=1;\n }\n }\n }\n cout<<min(ce,cf);\n}", "import java.nio.charset.IllegalCharsetNameException;\nimport java.util.*;\nimport java.lang.*;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\t\tlong oddsum = 0;\n\t\tlong oddcount = 0;\n\t\tfor (int i = 0; i < n / 2; i++) {\n\t\t\toddsum += a[2 * i];\n\t\t\tif (oddsum <= 0) {\n\t\t\t\toddcount += Math.abs(1 - oddsum);\n\t\t\t\toddsum = 1;\n\t\t\t}\n\t\t\toddsum += a[2 * i + 1];\n\t\t\tif (oddsum >= 0) {\n\t\t\t\toddcount += Math.abs(-1 - oddsum);\n\t\t\t\toddsum = -1;\n\t\t\t}\n\t\t}\n\t\tlong evensum = 0;\n\t\tlong evencount = 0;\n\t\tfor (int i = 0; i < n / 2; i++) {\n\t\t\tevensum += a[2 * i];\n\t\t\tif (evensum >= 0) {\n\t\t\t\tevencount += Math.abs(-1 - evensum);\n\t\t\t\tevensum = -1;\n\t\t\t}\n\t\t\tevensum += a[2 * i + 1];\n\t\t\tif (evensum <= 0) {\n\t\t\t\tevencount += Math.abs(1 - evensum);\n\t\t\t\tevensum = 1;\n\t\t\t}\n\t\t}\n\t\tif (n % 2 != 0) {\n\t\t\toddsum += a[n - 1];\n\t\t\tif (oddsum <= 0) {\n\t\t\t\toddcount += Math.abs(1 - oddsum);\n\t\t\t\toddsum = 1;\n\t\t\t}\n\t\t\tevensum += a[n - 1];\n\t\t\tif (evensum >= 0) {\n\t\t\t\tevencount += Math.abs(-1 - evensum);\n\t\t\t\tevensum = -1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(oddcount, evencount));\n\t}\n}", "import sys\ninput = sys.stdin.readline\nn=int(input())\na=list(map(int,input().split()))\n\nv=[]\nfor s in (1,-1):\n x=a[::]\n hugou=[s*(-1)**i for i in range(n)]\n total=0\n for i in range(n):\n if (total+x[i])*hugou[i]<=0:\n x[i]=hugou[i]-total\n total+=x[i]\n v.append(sum(abs(a[i]-x[i]) for i in range(n)))\nprint(min(v))\n", "n=int(input())\nA=list(map(int,input().split()))\n\ndef solve(a,t):\n ans,x=0,0\n for i in a:\n x+=i\n if t==True and x<1:\n ans+=1-x\n x=1\n elif t==False and x>-1:\n ans+=x+1\n x=-1\n t=not t\n return ans\nprint(min(solve(A,True),solve(A,False)))", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n int temp = Integer.parseInt(sc.next());\n a[i] = temp;\n }\n long ans1 = 0;\n long ans2 = 0;\n long temp = 0;\n for (int i = 0; i < n; i++) {\n long num = a[i];\n if (i % 2 == 0 && temp + num >= 0) {\n ans1 += temp + num + 1;\n num -= temp + num + 1;\n }\n if (i % 2 != 0 && temp + num <= 0) {\n ans1 += Math.abs(temp + num - 1);\n num += Math.abs(temp + num - 1);\n }\n temp += num;\n }\n temp = 0;\n for (int i = 0; i < n; i++) {\n long num = a[i];\n if (i % 2 == 0 && temp + num <= 0) {\n ans2 += Math.abs(temp + num - 1);\n num += Math.abs(temp + num - 1);\n }\n if (i % 2 != 0 && temp + num >= 0) {\n ans2 += temp + num + 1;\n num -= temp + num + 1;\n }\n temp += num;\n }\n System.out.println(Math.min(ans1, ans2));\n }\n}", "// C - Sequence\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rp(i,n) for(int i=0;i<(n);i++)\n\nll counter(vector<ll> &A, int N, int sign){//sign: (+)start -> 1, (-)start -> -1\n\tll c = 0, s = 0;\n\trp(i,N){\n\t\ts += A[i];\n\t\tif(sign*s<=0){\n\t\t\tc += abs(s) + 1;\n\t\t\ts = sign;\n\t\t}\n\t\tsign *= -1;\n\t}\n\treturn c;\n}\n\nint main(){\n\tint N; cin>>N;\n\tvector<ll> A(N);\n\trp(i,N) cin>>A[i];\n\tll a = counter(A,N, 1);\n\tll b = counter(A,N,-1);\n\tcout<< (a<b?a:b) <<endl;\n}", "// C - Sequence\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define up(i,s,e,d) for(int i=(s);i<(e);i+=(d))\n\nint main(){\n\tint N; cin>>N;\n\tvector<ll> A(N);\n\n\tll csum = 0;\n\tll a = 0;\n\tup(i,0,N,1){\n\t\tcin>>A[i];\n\t\tcsum += A[i];\n\t\tif(i%2==0 && csum<=0){//even +\n\t\t\ta += abs(csum) + 1;\n\t\t\tcsum = 1;\n\t\t}\n\t\tif(i%2==1 && csum>=0){//odd -\n\t\t\ta += abs(csum) + 1;\n\t\t\tcsum = -1;\n\t\t}\n\t}\n\n\tcsum = 0;\n\tll b = 0;\n\tup(i,0,N,1){\n\t\tcsum += A[i];\n\t\tif(i%2==1 && csum<=0){//odd +\n\t\t\tb += abs(csum) + 1;\n\t\t\tcsum = 1;\n\t\t}\n\t\tif(i%2==0 && csum>=0){//even -\n\t\t\tb += abs(csum) + 1;\n\t\t\tcsum = -1;\n\t\t}\n\t}\n\n\tcout<< (a<b?a:b) <<endl;\n}", "def F(list_A, sign):\n total = 0\n cnt = 0\n for a in list_A:\n total += a\n if sign==True and total < 1:\n cnt += 1- total\n total = 1\n elif sign==False and total > -1:\n cnt += total + 1\n total = -1\n \n sign = not sign\n return cnt\n\nN = int(input())\nA = list(map(int, input().split()))\n\nans = min(F(A, True), F(A, False))\nprint(ans)", "import java.util.*;\n\npublic class Main{\n \n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n \n int n = sc.nextInt();\n long[] a = new long[n];\n long[] s = new long[n];\n for(int i = 0; i < n; i++){\n a[i] = sc.nextLong();\n if(i == 0){\n s[0] = a[0];\n } else {\n s[i] = s[i-1]+a[i];\n }\n }\n sc.close();\n\n long cnt1 = 0;\n long cnt2 = 0;\n long diff1 = 0;\n long diff2 = 0;\n for(int i = 0; i < n; i++){\n if(i%2 == 0){\n if(s[i]+diff1 <= 0){\n cnt1 += 1-s[i]-diff1;\n diff1 += 1-s[i]-diff1;\n }\n } else {\n if(s[i]+diff1 >= 0){\n cnt1 += s[i] + diff1 + 1;\n diff1 += -1-s[i]-diff1;\n }\n }\n }\n\n for(int i = 0; i < n; i++){\n if(i%2 == 0){\n if(s[i]+diff2 >= 0){\n cnt2 += s[i] + diff2 + 1;\n diff2 += -1-s[i]-diff2;\n } \n } else {\n if(s[i]+diff2 <= 0){\n cnt2 += 1-s[i]-diff2;\n diff2 += 1-s[i]-diff2;\n }\n }\n }\n\n System.out.println(Math.min(cnt1, cnt2));\n }\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] nums = new long[n];\n for(int i = 0; i < n; i++) {\n nums[i] = sc.nextLong();\n }\n\n long[] prefixSum = new long[n];\n\n long minCost = 0;\n if(nums[0] == 0) {\n nums[0] = 1;\n minCost = 1 + count(nums);\n\n nums[0] = -1;\n minCost = Math.min(minCost, 1 + count(nums));\n } else {\n minCost = count(nums);\n long org = nums[0];\n if(org > 0) {\n nums[0] = -1;\n minCost = Math.min(minCost,count(nums) + org + 1);\n } else {\n nums[0] = 1;\n minCost = Math.min(minCost,count(nums) + 1 - org);\n }\n \n }\n System.out.println(minCost);\n }\n\n private static long count(long[] nums) {\n long cnt = 0;\n long prev = nums[0];\n long cur = 0;\n for(int i = 1; i < nums.length; i++) {\n cur = nums[i] + prev;\n if(cur * prev < 0) {\n prev = cur;\n continue;\n }\n\n if(prev > 0) {\n cnt += cur + 1;\n prev = -1; \n } else {\n cnt += 1 - cur;\n prev = 1;\n }\n }\n return cnt;\n }\n}\n", "import copy\nn = int(input())\n*A, = map(int, input().split())\n\n\ndef solve(p):\n r = 0\n t = 0\n for a in A:\n t += a\n if t * p <= 0:\n r += abs(p - t)\n t = p\n p *= -1\n return r\n\n\nprint(min(solve(1), solve(-1)))\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#if __has_include(\"print.hpp\")\n #include \"print.hpp\"\n#endif\n\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntypedef long long ll;\ntypedef pair<int, int> p;\n\nint n;\nvector<int> v;\n\nll calc(ll s) {\n ll sum = 0, res = 0;\n for (int i = 0; i < n; ++i, s *= -1) {\n sum += v[i];\n if (sum * s > 0) continue;\n res += abs(sum - s);\n sum += s * abs(sum - s);\n }\n return res;\n}\n\nint main(){\n cin >> n;\n for (int i = 0; i < n; i++)\n {\n int tmp;\n cin >> tmp;\n v.push_back(tmp);\n }\n cout << min(calc(1), calc(-1)) << endl;\n}\n", "#include <iostream>\n#include <algorithm>\nusing namespace std;\nint main(void){\n int n,i,a[100010];\n long s=0,h1=0,h2=0;\n cin >> n;\n for (i=0;i<n;i++) cin >> a[i];\n for (i=0;i<n;i++){\n s+=a[i];\n if (i%2 && s>=0){\n h1+=s+1;\n s=-1;\n }\n if (i%2==0 && s<=0){\n h1+=1-s;\n s=1;\n }\n }\n s=0;\n for (i=0;i<n;i++){\n s+=a[i];\n if (i%2==0 && s>=0){\n h2+=s+1;\n s=-1;\n }\n if (i%2 && s<=0){\n h2+=1-s;\n s=1;\n }\n }\n cout << min(h1,h2) << endl;\n return 0;\n}", "n=int(input())\na=[int(x) for x in input().split()]\ndef arrange(a0_is_plus):\n r=0 if a0_is_plus==True else 1\n sumNum=0\n ans=0\n for i,an in enumerate(a):\n sumNum+=an\n if i%2==r and sumNum<=0:\n ans+=1-sumNum\n sumNum=1\n elif i%2!=r and sumNum>=0:\n ans+=sumNum+1\n sumNum=-1\n return ans\nprint(min(arrange(True),arrange(False)))", "N = int(input())\nA = list(map(int,input().split()))\nans = 10**15\n\nfor s in [1,-1]:\n cos = 0\n tot = 0\n \n for a in A:\n tot+=a\n if s*tot<=0:\n cos+=abs(tot-s)\n tot=s\n s*=-1\n \n ans=min(ans,cos)\n\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nll a[100010],n;\n\nll ans(int hugo){\n\tll sum=0,ANS=0;\n\tfor(int i=0;i<n;i++){\n\t\tsum+=a[i];\n\t\tif(hugo==-1){\n\t\t\thugo=1;\n\t\t\tif(sum>=0){\n\t\t\t\tANS+=abs(sum)+1;\n\t\t\t\tsum=-1;\n\t\t\t}\n\t\t}\n\t\telse if(hugo==1){\n\t\t\thugo=-1;\n\t\t\tif(sum<=0){\n\t\t\t\tANS+=abs(sum)+1;\n\t\t\t\tsum=1;\n\t\t\t}\n\t\t}\n\t}\n\treturn ANS;\n}\n\nint main() {\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tint z;\n\t\tcin>>z;\n\t\ta[i]=z;\n\t}\n\tcout << min(ans(-1),ans(1));\n}", "import java.util.*;\n\nclass Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint[] ar = new int[n];\n\t\tfor (int i=0; i<n; i++) ar[i] = sc.nextInt();\n\t\t\n\t\t//偶数項を正としたときの操作回数minA\n\t\tlong minA = 0;\n\t\tlong sumA = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tsumA += ar[i];\n\t\t\tif (i%2 == 0) {\n\t\t\t\tif (sumA <= 0) {\n\t\t\t\t\tminA += Math.abs(sumA) + 1;\n\t\t\t\t\tsumA += Math.abs(sumA) + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse { //sumA -\n\t\t\t\tif (sumA >= 0) {\n\t\t\t\t\tminA += Math.abs(sumA) + 1;\n\t\t\t\t\tsumA -= Math.abs(sumA) + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t//奇数項を正としたときの操作回数minB\n\t\tlong minB = 0;\n\t\tlong sumB = 0;\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tsumB += ar[i];\n\t\t\tif (i%2 != 0) {\n\t\t\t\tif (sumB <= 0) {\n\t\t\t\t\tminB += Math.abs(sumB) + 1;\n\t\t\t\t\tsumB += Math.abs(sumB) + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (sumB >= 0) {\n\t\t\t\t\tminB += Math.abs(sumB) + 1;\n\t\t\t\t\tsumB -= Math.abs(sumB) + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(Math.min(minA, minB));\n\t\t\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint N;\nvector<int>a(100010); // 終了コード136が出る場合は配列を余分に取る。制約最大+αが望ましい\n\nlong calc(long s){\n long sum=0, res=0;\n for(int i=0; i<N; i++, s*=-1){\n sum+=a[i];\n if(sum*s>0){continue;} // 初項が＋か―かで結果が出る問題である。sの変化を基準にしている。\n res+=abs(sum-s); // abs(sum-s)を算出すると符号を変えるのに必要な操作回数の値がresに入る\n sum+=s*abs(sum-s); // sum*sが成り立たないという事は、\n } // sumに新しく入れる数値がsの基準に合致していないためであり、sを掛ける必要がある\n return res; // 操作回数の最小値\n}\n\nint main() {\n cin>>N;\n for(int i=0; i<N; i++){\n cin>>a[i]; }\n \n cout<<min(calc(1), calc(-1));\n return 0;\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Pradyumn Agrawal coderbond007\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, FastReader in, PrintWriter out) {\n int n = in.nextInt();\n int[] a = in.nextIntArray(n);\n long ret = Long.MAX_VALUE;\n for (int x = -1; x <= 1; x += 2) {\n long s = 0;\n long sg = x;\n long cost = 0;\n for (int i = 0; i < n; i++, sg = -sg) {\n s += a[i];\n if (Long.signum(s) == sg) {\n\n } else if (sg == 1) {\n cost += 1 - s;\n s = 1;\n } else {\n cost += s - (-1);\n s = -1;\n }\n }\n ret = Math.min(ret, cost);\n }\n out.println(ret);\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int pnumChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (pnumChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= pnumChars) {\n curChar = 0;\n try {\n pnumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (pnumChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c == ',') {\n c = read();\n }\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "n = int(input())\na = list(map(int, input().split()))\n\ndef pm(a, t):\n ans = 0\n s = 0\n for i in a:\n s += i\n if t == 1 and s<1:\n ans += -s+1\n s = 1\n elif t==-1 and s>-1:\n ans += s+1\n s = -1\n t *= -1\n return ans\n \nprint(min(pm(a, 1), pm(a, -1)))", "import java.io.*;\nimport java.math.BigInteger;\n\npublic class Main implements Runnable {\n static ContestScanner in;\n static Writer out;\n public static void main(String[] args) {\n new Thread(null, new Main(), \"\", 16 * 1024 * 1024).start();\n }\n\n public void run() {\n Main main = new Main();\n try {\n in = new ContestScanner();\n out = new Writer();\n main.solve();\n out.close();\n in.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n\n void solve() throws IOException {\n n = in.nextInt();\n s = new long[n];\n for (int i = 0; i < n; i++) {\n s[i] = in.nextLong();\n }\n\n System.out.println(Math.min(apply(-1), apply(1)));\n }\n\n int n;\n long[] s;\n long apply(long st) {\n long ans = 0;\n long sum = 0;\n long target = st;\n\n for (int i = 0; i < n; i++) {\n long a = s[i];\n if ((a + sum) * target > 0) sum += a;\n else {\n ans += Math.abs(a + sum - target);\n sum = target;\n }\n target = -Long.signum(sum);\n }\n return ans;\n }\n}\n\nclass Writer extends PrintWriter{\n public Writer(String filename)throws IOException\n {super(new BufferedWriter(new FileWriter(filename)));}\n public Writer()throws IOException {super(System.out);}\n}\nclass ContestScanner implements Closeable {\n private BufferedReader in;private int c=-2;\n public ContestScanner()throws IOException\n {in=new BufferedReader(new InputStreamReader(System.in));}\n public ContestScanner(String filename)throws IOException\n {in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}\n public String nextToken()throws IOException {\n StringBuilder sb=new StringBuilder();\n while((c=in.read())!=-1&&Character.isWhitespace(c));\n while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}\n return sb.toString();\n }\n public String readLine()throws IOException{\n StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();\n while(c!=-1&&c!='\\n'&&c!='\\r'){sb.append((char)c);c=in.read();}\n return sb.toString();\n }\n public long nextLong()throws IOException,NumberFormatException\n {return Long.parseLong(nextToken());}\n public int nextInt()throws NumberFormatException,IOException\n {return(int)nextLong();}\n public double nextDouble()throws NumberFormatException,IOException\n {return Double.parseDouble(nextToken());}\n public void close() throws IOException {in.close();}\n}", "import java.util.Scanner;\n\npublic class Main {\n private static long[] add(long[] a, long add) {\n long[] res = new long[a.length];\n for (int i = 0; i < a.length; i++) {\n res[i] = a[i];\n }\n res[0] += add;\n return res;\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n while (sc.hasNextInt()) {\n int n = sc.nextInt();\n long[] a = new long[n];\n\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextLong();\n }\n\n boolean isZero = (a[0] == 0);\n long ans = Long.MAX_VALUE;\n\n if ( isZero ) {\n long[] ta = add(a, 1);\n ans = Math.min(ans, solve(ta) + 1);\n\n ta = add(a, -1);\n ans = Math.min(ans, solve(ta) + 1);\n } else {\n ans = Math.min(ans, solve(a));\n\n long[] ta = add(a, -a[0] + (a[0] < 0 ? 1 : -1));\n ans = Math.min(ans, solve(ta) + Math.abs(a[0]) + 1);\n }\n\n System.out.println(ans);\n }\n }\n\n private static long solve(long[] a) {\n long res = 0;\n long sum = a[0];\n boolean isPositive = sum > 0;\n\n for (int i = 1; i < a.length; i++) {\n isPositive = !isPositive;\n sum += a[i];\n if ( isPositive && sum <= 0 ) {\n res += Math.abs(sum) + 1;\n sum = 1;\n } else if ( !isPositive && sum >= 0 ) {\n res += Math.abs(sum) + 1;\n sum = -1;\n }\n }\n\n return res;\n }\n}\n", "#ABC059C\nN=int(input())\nA=list(map(int,input().split()))\nans=[0,0]\ni=[1,0]\nfor c in range(2):\n\tsumm=0\n\tfor a in A:\n\t\tsumm+=a\n\t\tif summ==0:\n\t\t\tans[c]+=abs(summ-(-1)**i[c])\n\t\t\tsumm=(-1)**i[c]\n\t\telif (summ>0)==i[c]:\n\t\t\tans[c]+=abs(summ-(-1)**i[c])\n\t\t\tsumm=(-1)**i[c]\n\t\ti[c]=(i[c]+1)%2\nprint(min(ans))", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.net.ConnectException;\nimport java.rmi.dgc.Lease;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.NoSuchElementException;\nimport java.util.Objects;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}\n\n\t// ======================================================================\n\tlong[] R;\n\tpublic void solve() {\n\t\tint N = ni();\n\t\tR = new long[N+1];\n\t\tlong a;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\ta = nl();\n\t\t\tR[i+1] = R[i] + a;\n\t\t}\n\t\tboolean f = true;\n\t\tlong ans1 = 0, sv = 0;\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\tif(f) {\n\t\t\t\tif(R[i]+sv <= 0) {\n\t\t\t\t\tans1 += (1-(R[i]+sv));\n\t\t\t\t\tsv += (1-(R[i]+sv));\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(R[i]+sv >= 0) {\n\t\t\t\t\tans1 += (1+(R[i]+sv));\n\t\t\t\t\tsv -= (1+(R[i]+sv));\n\t\t\t\t}\n\t\t\t}\n\t\t\tf = !f;\n\t\t}\n\t\tf = false;\n\t\tlong ans2 = 0;\n\t\tsv = 0;\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\tif(f) {\n\t\t\t\tif(R[i]+sv <= 0) {\n\t\t\t\t\tans2 += (1-(R[i]+sv));\n\t\t\t\t\tsv += (1-(R[i]+sv));\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(R[i]+sv >= 0) {\n\t\t\t\t\tans2 += (1+(R[i]+sv));\n\t\t\t\t\tsv -= (1+(R[i]+sv));\n\t\t\t\t}\n\t\t\t}\n\t\t\tf = !f;\n\t\t}\n\t\tout.println(Math.min(ans1, ans2));\n\t}\n\n\t// ------------------------------------------\n\t// ライブラリ\n\t// ------------------------------------------\n\t// Print\n\tprivate PrintWriter out = new PrintWriter(System.out);\n\n\t// Scanner\n\tprivate FastScanner scan = new FastScanner();\n\n\tint ni() {\n\t\treturn scan.nextInt();\n\t}\n\n\tint[] ni(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = ni();\n\t\t}\n\t\treturn a;\n\t}\n\n\tint[][] ni(int y, int x) {\n\t\tint[][] a = new int[y][x];\n\t\tfor (int i = 0; i < y; i++) {\n\t\t\tfor (int j = 0; j < x; j++) {\n\t\t\t\ta[i][j] = ni();\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n\n\tlong nl() {\n\t\treturn scan.nextLong();\n\t}\n\n\tlong[] nl(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = nl();\n\t\t}\n\t\treturn a;\n\t}\n\n\tlong[][] nl(int y, int x) {\n\t\tlong[][] a = new long[y][x];\n\t\tfor (int i = 0; i < y; i++) {\n\t\t\tfor (int j = 0; j < x; j++) {\n\t\t\t\ta[i][j] = nl();\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n\n\tString ns() {\n\t\treturn scan.next();\n\t}\n\n\tString[] ns(int n) {\n\t\tString[] a = new String[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = ns();\n\t\t}\n\t\treturn a;\n\t}\n\n\tString[][] ns(int y, int x) {\n\t\tString[][] a = new String[y][x];\n\t\tfor (int i = 0; i < y; i++) {\n\t\t\tfor (int j = 0; j < x; j++) {\n\t\t\t\ta[i][j] = ns();\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n for(int i = 0 ; i < n ; i++) a[i] = sc.nextInt();\n long sum = 0, count1 = 0;\n for(int i = 0 ; i < n ; i++) {\n sum += a[i];\n if(i % 2 == 0 && sum <= 0) {\n count1 += Math.abs(sum) + 1;\n sum = 1;\n } else if(i % 2 == 1 && sum >= 0) {\n count1 += sum + 1;\n sum = -1;\n }\n }\n \n sum = 0;\n long count2 = 0;\n for(int i = 0 ; i < n ; i++) {\n sum += a[i];\n if(i % 2 == 0 && sum >= 0) {\n count2+= sum + 1;\n sum = -1;\n } else if(i % 2 == 1 && sum <= 0) {\n count2 += Math.abs(sum) + 1;\n sum = 1;\n }\n }\n System.out.println(Math.min(count1, count2));\n }\n}\n", "n = int(input())\nA = list(map(int, input().split()))\n\nanswer = 1e15\nfor s in range(2): # start from + or -\n prev_cumsum=0\n num_man = 0\n for i, a in enumerate(A):\n if (prev_cumsum + a)*(-1)**(i+s) > 0:\n prev_cumsum += a\n #print(prev_cumsum)\n else:\n num_man += abs((-1)**(i+s) - prev_cumsum -a)\n prev_cumsum = (-1)**(i+s)\n #print(prev_cumsum)\n answer = min(answer, num_man)\n #print(num_man)\nprint(answer)\n \n ", "n=input()\na=list(map(int,input().split()))\nans=10**18\nfor s in -1,1:\n c=0\n if a[0]*s<0:c=abs(s-a[0])\n elif a[0]*s>0:s=a[0]\n else:c=1\n for i in a[1:]:\n if s<0:\n b=-s+1\n c+=max(0,b-i)\n s+=max(i,b)\n else:\n b=-s-1\n c+=max(0,i-b)\n s+=min(i,b)\n ans=min(ans,c)\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long[] A = new long[N];\n for (int i = 0; i < N; i++) {\n A[i] = sc.nextInt();\n }\n System.out.println( solve(N, A) );\n }\n\n private static long solve(int N, long[] A) {\n long a0 = A[0];\n if( a0 > 0 ) {\n long p = solve1(N, A, a0, 0);\n long m = solve1(N, A, -1, a0 + 1);\n return Math.min(p, m);\n \n } else if( a0 < 0 ) {\n long p = solve1(N, A, 1, Math.abs(a0) + 1);\n long m = solve1(N, A, a0, 0);\n return Math.min(p, m);\n\n } else {\n long p = solve1(N, A, 1, 1);\n long m = solve1(N, A, -1, 1);\n return Math.min(p, m);\n }\n }\n\n private static long solve1(int N, long[] A, long sum, long ans) {\n for (int i = 1; i < N; i++) {\n long a = A[i];\n\n if( sum > 0 ) {\n // 次はminusになるのを期待\n if( a + sum >= 0 ) {\n // sumが-1になるような値にまで変更する\n // a + sum が 5 の場合、6 だけ操作すると -1 にできる\n long diff = a + sum + 1L;\n ans += diff;\n sum = -1;\n\n } else {\n sum += a;\n }\n\n } else {\n if( a + sum <= 0 ) {\n long diff = Math.abs(a + sum) + 1L;\n ans += diff;\n sum = 1;\n\n } else {\n sum += a;\n }\n }\n }\n return ans;\n }\n}\n", "n=int(input())\na=list(map(int,input().split()))\nans=0\ntmp=0\nfor i in range(n):\n tmp+=a[i]\n if i%2==0:\n if tmp<=0:\n ans+=abs(tmp)+1\n tmp=1\n else:\n if tmp>=0:\n ans+=abs(tmp)+1\n tmp=-1\n\ntmp=0\ntmp2=0\nfor i in range(n):\n tmp+=a[i]\n if i %2==0:\n if tmp>=0:\n tmp2+=abs(tmp)+1\n tmp=-1\n else:\n if tmp<=0:\n tmp2+=abs(tmp)+1\n tmp=1\nprint(min(ans,tmp2))\n ", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextLong();\n\t\tlong a[] = new long[(int)n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\t\t\n\t\tlong sum = a[0];\n\t\tlong ans1 = 0;\n\t\tif(sum == 0) {\n\t\t\tsum = 1;\n\t\t\tans1++;\n\t\t}\n\t\t\n\t\tfor(int i = 1; i < n; i++) {\n\t\t\tif(sum > 0) {\n\t\t\t\tif(sum + a[i] >= 0) {\n\t\t\t\t\tans1 += sum + a[i] + 1;\n\t\t\t\t\tsum = -1;\n\t\t\t\t} else {\n\t\t\t\t\tsum = sum + a[i];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(sum + a[i] <= 0) {\n\t\t\t\t\tans1 += Math.abs(a[i] + sum) + 1;\n\t\t\t\t\tsum = 1;\n\t\t\t\t} else {\n\t\t\t\t\tsum = sum + a[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans2 = Math.abs(a[0]) + 1;\n\t\tif(a[0] >= 0) {\n\t\t\tsum = -1;\n\t\t} else if(a[0] < 0){\n\t\t\tsum = 1;\n\t\t}\n\t\tfor(int i = 1; i < n; i++) {\n\t\t\tif(sum > 0) {\n\t\t\t\tif(sum + a[i] >= 0) {\n\t\t\t\t\tans2 += sum + a[i] + 1;\n\t\t\t\t\tsum = -1;\n\t\t\t\t} else {\n\t\t\t\t\tsum = sum + a[i];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(sum + a[i] <= 0) {\n\t\t\t\t\tans2 += Math.abs(a[i] + sum) + 1;\n\t\t\t\t\tsum = 1;\n\t\t\t\t} else {\n\t\t\t\t\tsum = sum + a[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n}\n", "N = int(input())\nA = [int(i) for i in input().split()]\n\nmi = 1e20\nfor sign in [-1, 1]:\n res, acc = 0, 0\n for a in A:\n acc += a\n if sign * acc <= 0:\n res += abs(acc - sign)\n acc = sign\n sign *= -1\n mi = min(mi, res)\n\nprint(mi)", "#include <iostream>\n#include <algorithm>\n#include <cstdlib>\n\n\nusing namespace std;\n\n\nlong long solver(bool pre_is_posi, long long a[], long long n)\n{\n long long total=0, ans=0;\n\n for (int i=0; i<n; i++){\n total += a[i];\n if (pre_is_posi && total >= 0){\n ans += abs(total)+1;\n total = -1;\n } else if (!(pre_is_posi) && total <= 0){\n ans += abs(total)+1;\n total = 1;\n }\n pre_is_posi = (total > 0);\n }\n return ans;\n}\n\n\nint main()\n{\n long long n, a[100000];\n\n cin >> n;\n for (int i=0; i<n; i++) cin >> a[i];\n cout << min(solver(true, a, n), solver(false, a, n)) << endl;\n \n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long n;\n cin >> n;\n long a[n],sum = 0;\n for(long i = 0;i < n;i++){\n cin >> a[i];\n }\n long kekka = 0;\n for(long i = 0;i < n;i++){\n sum += a[i];\n if(i % 2 == 0 && sum >= 0){\n kekka += sum + 1;\n sum = -1;\n }\n if(i % 2 == 1 && sum <= 0){\n kekka += -sum + 1;\n sum = 1;\n }\n }\n long result = 0;\n sum = 0;\n for(long i = 0;i < n;i++){\n sum += a[i];\n if(i % 2 == 0 && sum <= 0){\n result += -sum + 1;\n sum = 1;\n }\n if(i % 2 == 1 && sum >= 0){\n result += sum + 1;\n sum = -1;\n }\n }\n cout << min(kekka,result) << endl;\n}", "import java.util.Scanner;\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint []a = new int [n];\n\t\t\n\t\tfor(int i = 0; i < n ;i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tsc.close();\n\t\t\n\t\tlong ans = Math.min(count(n,a,0),count(n,a,1));\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t}\n\tprivate static long count(int n, int []a, int pat) {\n\t\t\n\t\tlong count = 0;\n\t\tlong sum = 0;\n\t\t\t\n\t\tint temp = (int)Math.pow(-1, 1+pat);\n\t\t\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tsum += a[i];\n\t\t\ttemp *= -1;\n\t\t\tif((long)temp * sum <= 0) {\n\t\t\t\tcount += Math.abs(sum) + 1 ;\n\t\t\t\tsum = temp;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\treturn count;\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#ifdef PAPITAS\n\t#define DEBUG 1\n#else\n\t#define DEBUG 0\n#endif\n#define _DO_(x) if(DEBUG) x\n\nint main()\n{\n\tios::sync_with_stdio(false);cin.tie(NULL);\n\tint n;\n\tcin >> n;\n\tint arr[n];\n\tll a = 0, b = 0, sa = 0, sb = 0;\n\tfor(int i = 0; i< n; i++){\n\t\tcin >> arr[i];\n\t}\n\tfor(int i = 0; i < n; i++){\n\t\tsa += arr[i];\n\t\tsb += arr[i];\n\t\tif(i%2 == 0){\n\t\t\tif(sa <= 0){\n\t\t\t\ta += 1 - sa;\n\t\t\t\tsa = 1;\n\t\t\t}\n\t\t\tif(sb >= 0){\n\t\t\t\tb += sb + 1;\n\t\t\t\tsb = -1;\n\t\t\t}\n\t\t}else{\n\t\t\tif(sa >= 0){\n\t\t\t\ta += sa + 1;\n\t\t\t\tsa = -1;\n\t\t\t}\n\t\t\tif(sb <= 0){\n\t\t\t\tb += 1 - sb;\n\t\t\t\tsb = 1;\n\t\t\t}\n\t\t}\n\t}\n\tcout << min(a, b);\n\treturn 0;\n}\n\n", "n = int(input())\na = [int(i) for i in input().split()]\ns1 = s2 = su = 0\nfor i in range(n):\n su += a[i]\n if (i % 2 == 0 and su <= 0):\n s1 += abs(su) + 1\n su = 1\n elif(i % 2 == 1 and su >= 0):\n s1 += abs(su) + 1\n su = -1\nsu = 0\nfor i in range(n):\n su += a[i]\n if (i % 2 == 0 and su >= 0):\n s2 += abs(su) + 1\n su = -1\n elif (i % 2 == 1 and su <= 0):\n s2 += abs(su) + 1\n su = 1\nprint(min(s1,s2))", "# solution\nimport math\nimport io\n\ndata=int(input())\nqwe = (list(map(int,input().split())))\nscore1=score2=0\ncnt1=cnt2=0\nfor i ,num in enumerate(qwe):\n\tscore1+=num\n\tif score1<=0 and i%2==0:\n\t\tcnt1+=1-score1\n\t\tscore1=1\n\telif score1>=0 and i%2!=0:\n\t\tcnt1+=1+score1\n\t\tscore1=-1\n\t\t\n\tscore2+=num\n\tif score2<=0 and i%2!=0:\n\t\tcnt2+=1-score2\n\t\tscore2=1\n\telif score2>=0 and i%2==0:\n\t\tcnt2+=1+score2\n\t\tscore2=-1\nprint(min(cnt1,cnt2))", "n = int(input())\na = list(map(int, input().split()))\nt = 1\ncand1 = 0\ntmp = 0\nfor ai in a:\n if (tmp + ai) * t <= 0:\n cand1 += abs(tmp + ai - t)\n tmp = t\n else:\n tmp += ai\n t *= -1\nt = -1\ncand2 = 0\ntmp = 0\nfor ai in a:\n if (tmp + ai) * t <= 0:\n cand2 += abs(tmp + ai - t)\n tmp = t\n else:\n tmp += ai\n t *= -1\n\nprint(min(cand1, cand2))", "n = int(input())\nA = [int(i) for i in input().split()]\n\ndef f(A, op, acc = 0, cnt = 0):\n for i in range(n):\n acc += A[i]\n \n if i % 2 == 0 and op * acc <= 0:\n cnt += - op * acc + 1\n acc = op\n \n if i % 2 == 1and op * acc >= 0:\n cnt += op * acc + 1\n acc = -op\n \n if acc == 0:\n cnt += 1\n \n return cnt\n\nprint(min(f(A, 1), f(A, -1)))", "n=input()\na = list(map(int,input().split()))\n\ndef chk(a,t):\n ans=0\n x=0\n for i in a:\n x+=i\n if t and x<1:\n ans+=1-x\n x=1\n elif not t and x>-1:\n ans+=x+1\n x=-1\n t= not t\n return ans\n\nprint(min(chk(a,True),chk(a,False)))\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.stream.LongStream;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CSequence solver = new CSequence();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CSequence {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n long[] a = in.readLongArray(n);\n\n long ans1 = calc(a);\n long ans2 = calc(LongStream.of(a).map(x -> -x).toArray());\n out.printLine(Math.min(ans1, ans2));\n }\n\n long calc(long[] a) {\n int n = a.length;\n long ret = 0;\n long sum = 0;\n for (int i = 0; i < n; i++) {\n if (i % 2 == 0) {\n long need = Math.max(1 - (sum + a[i]), 0);\n ret += need;\n sum = Math.max(sum + a[i], 1);\n } else {\n long need = Math.max(sum + a[i] - (-1), 0);\n ret += need;\n sum = Math.min(sum + a[i], -1);\n }\n }\n return ret;\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public long[] readLongArray(int size) {\n long[] array = new long[size];\n for (int i = 0; i < size; i++) {\n array[i] = readLong();\n }\n return array;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long readLong() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n }\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nusing lli = int64_t;\nusing vi = vector<lli>;\n\nlli f(vi& v, int n, int fl)\n{\n lli ans = 0;\n\n for(lli i = 0, s = 0; i < n; i++, fl = !fl)\n {\n s += v[i];\n\n if(!fl && s >= 0) ans += s - (-1), s = -1;\n else\n if(fl && s <= 0) ans += 1 - s, s = 1;\n }\n\n return ans;\n}\n\nint main()\n{\n ios_base::sync_with_stdio(0);\n\n int n; cin >> n;\n\n vi v(n);\n\n for(int i = 0; i < n; i++) cin >> v[i];\n\n lli ans = min(f(v, n, 0), f(v, n, 1));\n\n cout << ans << endl;\n return 0;\n}", "n=int(input())\na=list(map(int,input().split()))\n\ndef solve(parity):\n wa=0\n ans=0\n for i in range(n):\n wa+=a[i]\n if i%2==parity:\n if wa>=0:\n ans+=wa+1\n wa-=wa+1\n else:\n if wa<=0:\n ans+=-wa+1\n wa+=-wa+1\n return ans\n\nprint(min(solve(0),solve(1)))", "import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static double sequence(int a[], double start) {\n\t\tdouble count = 0.0, presum = start, sum = start;\n\t\t\n\t\tfor(int i = 1; i < a.length; ++i) {\n\t\t\tsum += (double)a[i];\n\t\t\tif(sum * presum > 0) {\n\t\t\t\tdouble min = Math.abs(sum) + 1;\n\t\t\t\tif(presum > 0)sum -= min;\n\t\t\t\telse sum += min;\n\t\t\t\tcount += min;\n\t\t\t}\n\t\t\t\n\t\t\tif(sum == 0) {\n\t\t\t\tif(presum > 0)sum--;\n\t\t\t\telse sum++;\n\t\t\t\t++count;\n\t\t\t}\n\t\t\t\n\t\t\tpresum = sum;\n\t\t}\n\t\t\n\t\treturn count;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n, a[];\n\t\tdouble count = 0.0, tmp2 = 0.0, tmp3 = 0.0;\n\t\t\n\t\tn = sc.nextInt();\n\t\ta = new int[n];\n\t\t\n\t\tfor(int i = 0; i < n; ++i) a[i] = sc.nextInt();\n\t\t\n\t\tsc.close();\n\t\t\n\t\t\n\t\tif(a[0] == 0) {\n\t\t\ta[0]++;\n\t\t\t++tmp3;\n\t\t}\n\t\t\n\t\tint tmp = Math.abs(a[0]) + 1;\n\t\t\n\t\tif(a[0] > 0) {\n\t\t\ttmp2 = tmp - tmp3;\n\t\t\ttmp = a[0] - tmp;\n\t\t}\n\t\telse { \n\t\t\ttmp2 = tmp + tmp3;\n\t\t\ttmp = a[0] + tmp;\n\t\t}\n\t\t\n\t\tcount = Math.min((tmp3 + sequence(a, (double)a[0])),(tmp2 + sequence(a, (double)tmp)));\n\t\t\n\t\tSystem.out.printf(\"%.0f\\n\", count);\n\t}\n\n}\n", "N = int(input())\nA = list(map(int,input().split()))\n\ndef f(x):\n cnt = 0\n tmp = 0\n for a in A:\n tmp += a\n #print(tmp, x)\n if(tmp*x >= 0):\n cnt += abs(tmp)+1\n tmp = -x\n x *= -1\n #print(tmp, x)\n return cnt\n\nprint(min(f(1), f(-1))) ", "#include<bits/stdc++.h>\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define ALL(v) (v).begin(),(v).end()\n#define int long long\nusing namespace std;\ntypedef vector<int> vint;\ntypedef pair<int,int> pint;\n\nsigned main()\n{\n int N; cin>>N;\n vint a(N);\n REP(i,N) cin>>a[i];\n\n int cost1=0,S=0;\n REP(i,N){\n S+=a[i];\n if(i%2==0 and S<=0) cost1+=1-S,S=1;\n if(i%2==1 and S>=0) cost1+=S+1,S=-1;\n }\n\n int cost2=0; S=0;\n REP(i,N){\n S+=a[i];\n if(i%2==0 and S>=0) cost2+=S+1,S=-1;\n if(i%2==1 and S<=0) cost2+=1-S,S=1;\n }\n \n cout<<min(cost1,cost2)<<endl;\n\n}\n", "n=int(input())\na=list(map(int,input().split()))\n\ndef cnt(p):\n s=d=0\n for i in range(n):\n c=(s+a[i])*p\n if c<=0:\n d+=(1-c)\n s=p\n else:\n s+=a[i]\n p*=(-1)\n return d\n\nda=cnt(1)\ndb=cnt(-1)\nprint(min(da,db))", "import java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException{\n\t\tSequence solver = new Sequence();\n\t\tsolver.readInput();\n\t\tsolver.solve();\n\t\tsolver.writeOutput();\n\t}\n\n\n\tstatic class Sequence {\n\t\tprivate int n;\n\t\tprivate long a[];\n\n\t\tprivate long output;\n\t\tprivate Scanner scanner;\n\n\t\tpublic Sequence() {\n\t\t\tthis.scanner = new Scanner(System.in);\n\t\t}\n\n\t\tpublic void readInput() {\n\t\t\tn = Integer.parseInt(scanner.next());\n\t\t\ta = new long[n];\n\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t\ta[i] = Integer.parseInt(scanner.next());\n\t\t\t}\n\t\t}\n\n\t\tprivate int count(int sign) {\n\t\t\tint count=0;\n\t\t\tlong sum=0;\n\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t\tsum += a[i];\n\t\t\t\tif(i%2==sign) {\n\t\t\t\t\t// a[i]までの合計を正にするとき\n\t\t\t\t\tif(sum<=0) {\n\t\t\t\t\t\tcount += 1-sum;\n\t\t\t\t\t\tsum = 1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// a[i]までの合計を負にするとき\n\t\t\t\t\tif(0<=sum) {\n\t\t\t\t\t\tcount += 1+sum;\n\t\t\t\t\t\tsum = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn count;\n\t\t}\n\n\t\tpublic void solve() {\n\n\t\t\t/* https://atcoder.jp/contests/abc059/submissions/8183898 */\n\t\t\tlong sum1 = 0;\n\t\t\tlong count1 = 0;\n\t\t\tlong sum2 = 0;\n\t\t\tlong count2 = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t sum1 += a[i];\n\t\t\t sum2 += a[i];\n\t\t\t if (i % 2 == 0) {\n\t\t\t if (sum1 <= 0) {\n\t\t\t count1 += 1 - sum1;\n\t\t\t sum1 = 1;\n\t\t\t }\n\t\t\t if (sum2 >= 0) {\n\t\t\t count2 += sum2 + 1;\n\t\t\t sum2 = -1;\n\t\t\t }\n\t\t\t } else {\n\t\t\t if (sum2 <= 0) {\n\t\t\t count2 += 1 - sum2;\n\t\t\t sum2 = 1;\n\t\t\t }\n\t\t\t if (sum1 >= 0) {\n\t\t\t count1 += sum1 + 1;\n\t\t\t sum1 = -1;\n\t\t\t }\n\t\t\t }\n\t\t\t}\n\t\t\toutput = Math.min(count1,count2);\n\t\t}\n\n\t\tpublic void writeOutput() {\n\t\t\tSystem.out.println(output);\n\t\t}\n\t}\n\n}", "n = int(input())\na = list(map(int, input().split()))\n\ndef f(isPosi):\n total = 0\n cnt = 0\n for i in a:\n total += i\n if isPosi:\n if total >= 0:\n cnt += 1 + total\n total = -1\n isPosi = False\n else:\n if total <= 0:\n cnt += 1 - total\n total = 1\n isPosi = True\n return cnt\n\nprint(min(f(True), f(False)))", "import java.io.*;\nimport java.util.*;\n\nclass Solver {\n final int n;\n final int[] as;\n long[] bs;\n \n Solver(int n, int[] as) {\n this.n = n;\n this.as = as;\n }\n \n private long makePositive(int index, long sum) {\n if (index >= n) {\n return 0;\n }\n long v = 0;\n if (as[index] + sum <= 0) {\n v = 1 - (as[index] + sum);\n }\n return v + makeNegative(index + 1, sum + as[index] + v);\n }\n \n private long makeNegative(int index, long sum) {\n if (index >= n) {\n return 0;\n }\n long v = 0;\n if (as[index] + sum >= 0) {\n v = as[index] + sum - (-1);\n }\n return v + makePositive(index + 1, sum + as[index] - v);\n }\n \n public long solve() {\n return Math.min(makePositive(0, 0), makeNegative(0, 0));\n }\n}\n\npublic class Main {\n private static void execute(ContestReader reader, PrintWriter out) {\n int n = reader.nextInt();\n int[] as = reader.nextInt(n);\n out.println(new Solver(n, as).solve());\n }\n \n public static void main(String[] args) {\n ContestReader reader = new ContestReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n execute(reader, out);\n out.flush();\n }\n}\n\nclass ContestReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n \n ContestReader(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n \n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public long nextLong() {\n return Long.parseLong(next());\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public String[] next(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = next();\n }\n return array;\n }\n \n public int[] nextInt(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n \n public long[] nextLong(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n \n public double[] nextDouble(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n \n public char[] nextCharArray() {\n return next().toCharArray();\n }\n \n public int[][] nextInt(int n, int m) {\n int[][] matrix = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextInt();\n }\n }\n return matrix;\n }\n \n public long[][] nextLong(int n, int m) {\n long[][] matrix = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextLong();\n }\n }\n return matrix;\n }\n \n public double[][] nextDouble(int n, int m) {\n double[][] matrix = new double[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextDouble();\n }\n }\n return matrix;\n }\n \n public char[][] nextCharArray(int n) {\n char[][] matrix = new char[n][];\n for (int i = 0; i < n; i++) {\n matrix[i] = next().toCharArray();\n }\n return matrix;\n }\n}\n", "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n\n vector<int> a(n);\n for (int i = 0; i < n; ++i) cin >> a[i];\n\n long long cnt1 = 0, sum = 0;\n for (int i = 0; i < n; ++i) {\n long long _sum = sum + a[i], su = (i & 1 ? _sum : -_sum);\n if (su >= 0) {\n cnt1 += su + 1;\n sum = (i & 1 ? -1 : 1);\n } else sum = _sum;\n }\n\n long long cnt2 = 0;\n sum = 0;\n for (int i = 0; i < n; ++i) {\n long long _sum = sum + a[i], su = (i & 1 ? -_sum : _sum);\n if (su >= 0) {\n cnt2 += su + 1;\n sum = (i & 1 ? 1 : -1);\n } else sum = _sum;\n }\n\n cout << min(cnt1, cnt2) << endl;\n}\n", "input()\n*A,=map(int,input().split())\nf=True\ns1=0;r1=0\ns2=0;r2=0\nfor a in A:\n s1+=a;s2+=a\n if f and s1<=0:r1+=1-s1;s1=1\n elif not(f) and s1>=0:r1+=s1+1;s1=-1\n if not(f) and s2<=0:r2+=1-s2;s2=1\n elif f and s2>=0:r2+=s2+1;s2=-1\n f=not(f)\nprint(min(r1,r2))", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] a = new long[n];\n long[] b = new long[n];\n for(int i = 0; i < n; i++) {\n long t = sc.nextLong();\n a[i] = t;\n b[i] = t; \n }\n long min1 = 0;\n long min2 = 0;\n long[] s1 = new long[n];\n s1[0] = a[0];\n long[] s2 = new long[n];\n s2[0] = b[0];\n // 部分和を+-+-にする場合\n for(int i = 0; i < n; i++) {\n if(i > 0) s1[i] = s1[i - 1] + a[i];\n if(i % 2 == 0) {\n if(s1[i] <= 0) {\n min1 += (1 - s1[i]);\n s1[i] = 1;\n }\n } else {\n if(s1[i] >= 0) {\n min1 += (1 + s1[i]);\n s1[i] = -1;\n }\n }\n }\n\n // 部分和を-+-+にする場合\n for(int i = 0; i < n; i++) {\n if(i > 0) s2[i] = s2[i - 1] + b[i];\n if(i % 2 == 0) {\n if(s2[i] >= 0) {\n min2 += (1 + s2[i]);\n s2[i] = -1;\n }\n } else {\n if(s2[i] <= 0) {\n min2 += (1 - s2[i]);\n s2[i] = 1;\n }\n }\n }\n \n long ans = Math.min(min1, min2);\n System.out.println(ans);\n }\n}\n", "import java.io.*;\nimport java.util.*;\n\nclass Main{\n\n void solve(){\n int N = ni();\n long[] a = new long[N];\n long[] s = new long[N + 1];\n for(int i = 0; i < N; i++){ \n a[i] = ni();\n }\n for(int i = 1; i <= N ; i++){\n s[i] = s[i - 1] + a[i - 1];\n }\n \n long pattern1 = 0;\n long control = 0;\n for(int i = 1; i <= N; i++){\n if(i % 2 == 1){ // 正\n if(s[i] + control <= 0){\n pattern1 += Math.abs(s[i] + control) + 1;\n control += Math.abs(s[i] + control) + 1;\n }\n } else { // 負\n if(s[i] + control >= 0){\n pattern1 += Math.abs(s[i] + control) + 1;\n //control = -1 * (Math.abs(s[i] + control) + 1);\n control -= Math.abs(s[i] + control) + 1;\n }\n }\n }\n long pattern2 = 0;\n control = 0;\n for(int i = 1; i <= N; i++){\n if(i % 2 == 0){ // 正\n if(s[i] + control <= 0){\n pattern2 += Math.abs(s[i] + control) + 1;\n control += Math.abs(s[i] + control) + 1;\n }\n } else { // 負\n if(s[i] + control >= 0){\n pattern2 += Math.abs(s[i] + control) + 1;\n control -= Math.abs(s[i] + control) + 1;\n }\n }\n }\n\n out.println(min(pattern1, pattern2));\n\n\n out.flush();\n } \n\n\n public static void main(String[] args){\n Main m = new Main();\n m.solve();\n }\n\n Main(){\n this.scan = new FastScanner();\n this.out = new PrintWriter(System.out);\n }\n\n private FastScanner scan;\n private PrintWriter out;\n private final int MOD = 1_000_000_007;\n private final int INF = 2_147_483_647;\n private final long LINF = 9223372036854775807L;\n private long[] fac;\n private long[] finv;\n private long[] inv;\n\n // Scanner\n int ni(){ return scan.nextInt();}\n int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n int[][] ni(int y, int x){int[][] a = new int[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n long nl(){return scan.nextLong();}\n long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n long[][] nl(int y, int x){long[][] a = new long[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n String ns(){return scan.next();}\n String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n String[][] ns(int y, int x){String[][] a = new String[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n\n // Mathematics\n int max(int a, int b){return Math.max(a, b);}\n long max(long a, long b){return Math.max(a, b);}\n double max(double a, double b){return Math.max(a, b);}\n int max(int[] a){int max = a[0]; for(int value:a){max = max(max,value);} return max;}\n long max(long[] a){long max = a[0]; for(long value:a){max = max(max,value);} return max;}\n double max(double[] a){double max = a[0]; for(double value:a){max = max(max,value);} return max;}\n int min(int a, int b){return Math.min(a, b);}\n long min(long a, long b){return Math.min(a, b);}\n double min(double a, double b){return Math.min(a, b);}\n int min(int[] a){int min = a[0]; for(int value:a){min = min(min,value);} return min;}\n long min(long[] a){long min = a[0]; for(long value:a){min = min(min,value);} return min;}\n double min(double[] a){double min = a[0]; for(double value:a){min = min(min,value);} return min;}\n long sum(int[] a){long sum = 0; for(int value:a){sum += value;} return sum;}\n long sum(long[] a){long sum = 0; for(long value:a){sum += value;} return sum;}\n double sum(double[] a){double sum = 0; for(double value:a){sum += value;} return sum;}\n long mod(long n) { n %= MOD; return n + (n < 0 ? MOD : 0); }\n int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}\n long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}\n int lcm(int a, int b){return a / gcd(a, b) * b;}\n long lcm(long a, long b){return a / gcd(a, b) * b;}\n long fact(int n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n long fact(long n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n // nPr(int)\n long npr(int n, int r){\n long a = 1;\n for(int i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // nPr(long)\n long npr(long n, long r){\n long a = 1;\n for(long i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // 素数判定(int)\n boolean checkPrime(int n){\n for(int i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // 素数判定(long)\n boolean checkPrime(long n){\n for(long i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // エラトステネスの篩\n long[] erathos(int n){\n boolean[] flag = new boolean[n + 1];\n TreeSet<Integer> nums = new TreeSet<>();\n for(int i = 2; i <= n; i++){\n if(flag[i]) continue;\n nums.add(i);\n for(int j = i * 2; j <= n; j += i){\n flag[j] = true;\n }\n }\n long[] primes = new long[nums.size()];\n int index = 0;\n for(int num : nums){\n primes[index] = num;\n index++;\n }\n\n return primes;\n }\n\n // mod pにおける累乗 a^n\n long modpow(long a, long n, long p){\n long res = 1;\n while(n > 0){\n if((n & 1) == 1){\n res = res * a % p;\n }\n a = a * a % p;\n n = n >> 1;\n }\n return res;\n }\n // mod pにおけるaの逆元a^-1\n long modinv(long a, long p){\n return modpow(a, p - 2, p);\n }\n // fac,finv,invの初期化\n void comInit(int max){\n fac = new long[max];\n finv = new long[max];\n inv = new long[max];\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(int i = 2; i < max; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n // 二項係数nCr\n long com(int n, int r){\n if(n < r || (n < 0 || r < 0)){\n return 0;\n }\n return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;\n }\n // 二項係数nCr（nが10^9など巨大なとき用）\n long ncr(long n, long k){\n long a = 1;\n long b = 1;\n for(int i = 1; i <= k; i++){\n a = a * (n + 1 - i) % MOD;\n b = b * i % MOD;\n }\n \n return modinv(b, MOD) * a % MOD;\n }\n // 二次元上の二点間の距離\n double distance(double x1, double y1, double x2, double y2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n return dist;\n }\n // 三次元上の二点間の距離\n double distance(double x1, double y1, double z1, double x2, double y2, double z2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2));\n return dist;\n }\n\n\n // Array\n void sort(int[] a){ Arrays.sort(a);}\n void sort(long[] a){ Arrays.sort(a);}\n void sort(double[] a){ Arrays.sort(a);}\n void sort(String[] a){ Arrays.sort(a);}\n int[] reverse(int[] a){\n int[] reversed = new int[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n long[] reverse(long[] a){\n long[] reversed = new long[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n double[] reverse(double[] a){\n double[] reversed = new double[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n char[] reverse(char[] a){\n char[] reversed = new char[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n String[] reverse(String[] a){\n String[] reversed = new String[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n boolean[] reverse(boolean[] a){\n boolean[] reversed = new boolean[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n void fill(int[] array, int x) { Arrays.fill(array, x); }\n void fill(long[] array, long x) { Arrays.fill(array, x); }\n void fill(double[] array, double x) { Arrays.fill(array, x); }\n void fill(boolean[] array, boolean x) { Arrays.fill(array, x); }\n void fill(int[][] array, int x) { for(int a[] : array) { fill(a, x); } }\n void fill(long[][] array, long x) { for(long a[] : array) { fill(a, x); } }\n void fill(double[][] array, double x) { for(double a[] : array) { fill(a, x); } }\n void fill(boolean[][] array, boolean x) { for(boolean a[] : array) { fill(a, x); } }\n void fill(int[][][] array, int x) { for(int[][] ary : array) { for(int[] a : ary){ fill(a, x); } } }\n void fill(long[][][] array, long x) { for(long[][] ary : array) { for(long[] a : ary){ fill(a, x); } } }\n\n // Algorithm\n // 深さ優先探索\n /* void dfs(Node[] nodes, int v, boolean[] seen){\n seen[v] = true;\n \n for(Edge edge : nodes[v].edges){\n if(seen[edge.to]) continue;\n dfs(nodes, edge.to, seen);\n }\n\n } */\n // 幅優先探索\n long[] bfs(Node[] nodes, int start){\n Queue<Integer> queue = new ArrayDeque<>();\n queue.add(start);\n long[] dist = new long[nodes.length];\n fill(dist, -1);\n dist[start] = 0;\n\n while(!queue.isEmpty()){\n int now = queue.poll();\n for(Edge edge : nodes[now].edges){\n if(dist[edge.to] != -1) continue;\n dist[edge.to] = dist[now] + 1;\n queue.add(edge.to);\n }\n }\n\n return dist;\n }\n \n // ダイクストラ法\n long[] dijkstra(Node[] nodes, int start){\n Queue<Edge> queue = new PriorityQueue<>();\n long[] dist = new long[nodes.length];\n fill(dist, LINF / 2);\n dist[start] = 0;\n queue.add(new Edge(start, start, dist[start]));\n\n while(!queue.isEmpty()){\n Edge now = queue.poll(); \n if(dist[now.to] < now.cost) continue;\n for(Edge edge : nodes[now.to].edges){\n if(dist[edge.to] > dist[edge.from] + edge.cost){\n dist[edge.to] = dist[edge.from] + edge.cost;\n queue.add(new Edge(edge.from, edge.to, dist[edge.to]));\n nodes[edge.to].past = edge.from;\n }\n }\n }\n\n return dist;\n }\n \n // ソート済みint型配列でkey以上の値の最小indexを返す\n int lowerBound(int[] a, int key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // ソート済みlong型配列でkey以上の値の最小indexを返す\n int lowerBound(long[] a, long key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // 文字列sとtの最長共通部分列の長さを返す\n int lcs(String s , String t){\n int[][] dp = new int[s.length() + 1][t.length() + 1];\n\n for(int i = 0; i < s.length(); i++){\n for(int j = 0; j < t.length(); j++){\n if(s.charAt(i) == t.charAt(j)){\n dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);\n }\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i + 1][j]);\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j + 1]);\n }\n }\n\n return dp[s.length()][t.length()];\n }\n\n}\n\n// ノード\nclass Node{\n int id; // ノード番号\n int past; // 直前の頂点\n List<Edge> edges; // 辺のリスト\n\n Node(int id, int past){\n this.id = id;\n this.past = past;\n this.edges = new ArrayList<>();\n }\n void addEdge(Edge edge){\n edges.add(edge);\n }\n\n public boolean equals(Object obj){\n if(obj instanceof Node){\n Node node = (Node)obj;\n return this.id == node.id;\n } \n return false;\n }\n public int hashCode(){\n return id;\n }\n public String toString(){\n return \"[id:\" + id + \" past: \" + past + \"]\";\n }\n}\n\n// 辺の情報を持つクラス\nclass Edge implements Comparable<Edge>{\n int from; // どの頂点から\n int to; // どの頂点へ\n long cost; // 辺の重み\n\n Edge(int from, int to, long cost){\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n public int compareTo(Edge edge){\n return Long.compare(this.cost, edge.cost);\n }\n\n public String toString(){\n return \"[\" + from + \" to \" + to + \" cost:\" + cost + \"]\";\n }\n}\n// 辺の重み比較のComparator\nclass EdgeComparator implements Comparator<Edge>{\n @Override\n public int compare(Edge e1, Edge e2){\n long cost1 = e1.cost;\n long cost2 = e2.cost;\n if(cost1 < cost2){\n return -1;\n } else if(cost1 > cost2){\n return 1;\n } else {\n return 0;\n }\n }\n}\n// Union-Find\nclass UnionFind{\n int[] par;\n int[] size;\n UnionFind(int N){\n par = new int[N];\n size = new int[N];\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n void init(int N){\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n int root(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = root(par[x]);\n }\n }\n\n boolean same(int x, int y){\n return root(x) == root(y);\n }\n\n void unite(int x, int y){\n x = root(x);\n y = root(y);\n if(x == y) return;\n if(size[x] < size[y]){\n int tmp = x;\n x = y;\n y = tmp;\n }\n size[x] += size[y];\n par[y] = x;\n }\n\n int size(int x){\n return size[root(x)];\n }\n\n}\n\n// 順列を管理する\nclass Permutation {\n private int number;\n private int listSize;\n private int searched;\n private int nextIndex;\n private int[][] permList;\n\n Permutation(int num) {\n this.number = num;\n this.listSize = this.fact(this.number);\n this.searched = 0;\n this.nextIndex = 0;\n this.permList = new int[this.listSize][this.number];\n\n this.create(0, new int[this.number], new boolean[this.number]);\n }\n\n int[] nextPerm() {\n return permList[this.nextIndex++];\n }\n\n boolean isNext() {\n if(this.nextIndex < this.listSize) {\n return true;\n } else {\n this.nextIndex = 0;\n return false;\n }\n }\n\n int fact(int n){\n return n == 0 ? 1 : n * fact(n-1);\n }\n\n void create(int num, int[] list, boolean[] flag) {\n if(num == this.number) {\n copyArray(list, permList[this.searched]);\n this.searched++;\n }\n for(int i = 0; i < this.number; i++){\n if(flag[i]) continue;\n list[num] = i;\n flag[i] = true;\n this.create(num+1, list, flag);\n flag[i] = false;\n\n }\n }\n\n void copyArray(int[] from, int[] to) {\n for(int i=0; i<from.length; i++) to[i] = from[i];\n }\n\n void printNum(int[] nums) {\n for(int n : nums) System.out.print(n);\n System.out.println();\n }\n}\n\n// 一点更新区間取得Segment Tree\n/* class SegTree{\n int[] dat;\n int size;\n \n SegTree(int N){\n this.dat = new int[N * 4];\n this.size = N;\n }\n\n // [a, b]の最小値を返す\n // l,rにはノードkに対応する区間を与える\n int query(int a, int b, int k, int l, int r){\n if(r < a || b < l) return Integer.MAX_VALUE;\n if(a <= l && r <= b) return dat[k];\n int vl = query(a, b, k << 1, l, (l + r) / 2);\n int vr = query(a, b, (k << 1) + 1, (l + r) / 2 + 1, r);\n return Math.min(vl, vr);\n }\n\n // インデックスiの値をxに更新\n void update(int i, int x){\n i += this.size - 1;\n dat[i] = x;\n while(i > 0){\n i = i >> 1; // 1ビットぶん右シフト\n dat[i] = Math.min(dat[i << 1], dat[(i << 1) + 1]);\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = size; i < 2 * size; i++){\n sb.append(dat[i]).append(\",\");\n }\n sb.delete(sb.length() - 1, sb.length());\n String output = sb.append(\"]\").toString();\n return output;\n }\n} */\n\n// Range Sum Queryを実現するBinary Indexed Tree\nclass BIT{\n int[] tree;\n\n BIT(int N){\n this.tree = new int[N + 1];\n }\n\n int sum(int i){\n int sum = 0;\n while(i > 0){\n sum += this.tree[i];\n i -= i & -i;\n }\n return sum;\n }\n\n void add(int i, int x){\n while(i <= tree.length){\n this.tree[i] += x;\n i += i & -i;\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = 0; i < tree.length; i++){\n sb.append(tree[i] + \",\");\n }\n sb.append(\"]\");\n String output = sb.toString();\n return output;\n }\n \n}\n\n// 標準のScannerより高速に標準入力する\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}", "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] w = new long[n];\n\t\tlong sum1=0;\n\t\tlong sum2=0;\n\t\tlong ans1=0;\n\t\tlong ans2=0;\n for(int i = 0; i < n; i++){\n\t\t\tw[i] = sc.nextLong();\n\t\t}\n\t\tfor(int i = 0; i<n; i++){\n\t\t\tsum1+=w[i];\n\t\t\tsum2+=w[i];\n\t\t\tif(sum1>0 && i%2==1){\n\t\t\t\tans1+=Math.abs(sum1)+1;\n\t\t\t\tsum1=-1;\n\t\t\t}else if(sum1<0 && i%2==0){\n\t\t\t\tans1+=Math.abs(sum1)+1;\n\t\t\t\tsum1=1;\n\t\t\t}else if(sum1==0){\n\t\t\t\tans1+=1;\n\t\t\t\tif(i%2==1){\n\t\t\t\t\tsum1=-1;\n\t\t\t\t}else{\n\t\t\t\t\tsum1=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(sum2>0 && i%2==0){\n\t\t\t\tans2+=Math.abs(sum2)+1;\n\t\t\t\tsum2=-1;\n\t\t\t}else if(sum2<0 && i%2==1){\n\t\t\t\tans2+=Math.abs(sum2)+1;\n\t\t\t\tsum2=1;\n\t\t\t}else if(sum2==0){\n\t\t\t\tans2+=1;\n\t\t\t\tif(i%2==1){\n\t\t\t\t\tsum2=1;\n\t\t\t\t}else{\n\t\t\t\t\tsum2=-1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(ans1,ans2));\n\t}\n}", "n = input()\nl = map(int, raw_input().split())\n\nlastPos, lastNeg = l[0], l[0]\ncountPos, countNeg = 0, 0\n\nif(lastPos<=0):\n countPos = 1 - lastPos\n lastPos = 1\nif(lastNeg>=0):\n countNeg = lastNeg+1\n lastNeg = -1\n\nfor i in xrange(1,n):\n if(lastPos>0):\n #now it has to be negative\n if(lastPos+l[i] >= 0):\n diff = lastPos+l[i] + 1\n countPos+=diff\n lastPos = -1\n else:\n lastPos = lastPos + l[i]\n else:\n #now it has to be positive\n if(lastPos+l[i] <= 0):\n diff = 1 - (lastPos+l[i])\n countPos+=diff\n lastPos = 1\n else:\n lastPos = lastPos+l[i]\n \n if(lastNeg<0):\n #now it has to be positive\n if(lastNeg+l[i] <= 0):\n diff = 1 - (lastNeg+l[i])\n countNeg+= diff\n lastNeg = 1\n else:\n lastNeg = lastNeg + l[i]\n else:\n #now it has to be negative\n if(lastNeg+l[i] >= 0):\n diff = lastNeg+l[i]+1\n countNeg+= diff\n lastNeg = -1\n else:\n lastNeg = lastNeg + l[i]\n\nprint min(countPos, countNeg)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0 ; i < n ; i++) a[i] = sc.nextInt();\n\t\tlong sum = 0, cnt = 0;\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 0 && sum <= 0) {\n\t\t\t\t// 正に変える\n\t\t\t\tcnt += Math.abs(sum) + 1;\n\t\t\t\tsum = 1;\n\t\t\t} else if(i % 2 == 1 && sum >= 0) {\n\t\t\t\t// 負に変える\n\t\t\t\tcnt += sum + 1;\n\t\t\t\tsum = -1;\n\t\t\t}\n\t\t}\n\t\tlong sum1 = 0, cnt1 = 0;\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tsum1 += a[i];\n\t\t\tif(i % 2 == 0 && sum1 >= 0) {\n\t\t\t\t// 負に変える\n\t\t\t\tcnt1 += sum1 + 1;\n\t\t\t\tsum1 = -1;\n\t\t\t} else if(i % 2 == 1 && sum1 <= 0) {\n\t\t\t\t// 正に変える\n\t\t\t\tcnt1 += Math.abs(sum1) + 1;\n\t\t\t\tsum1 = 1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(cnt, cnt1));\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n\tint n;\n\tint[] a;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tMain m = new Main(sc);\n\t\tm.solve();\n\t\tsc.close();\n\t}\n\n\tMain(Scanner sc) {\n\t\tn = sc.nextInt();\n\t\ta = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t}\n\n\tvoid solve() {\n\t\tlong cnt1 = (a[0]>0)?0:(Math.abs(a[0])+1);\n\t\tint sign = 1;\n\t\tlong sum = (a[0]>0)?a[0]:1;\n\t\tfor(int i=1;i<n;i++){\n\t\t\tsum += a[i];\n\t\t\tif(sum*sign>=0){\n\t\t\t\tcnt1 += Math.abs(sum) + 1;\n\t\t\t\tsum = -sign;\n\t\t\t}\n\t\t\tsign *= -1;\n\t\t}\n\t\t\n\t\tlong cnt2 = (a[0]<0)?0:(Math.abs(a[0])+1);\n\t\tsign = -1;\n\t\tsum = (a[0]<0)?a[0]:-1;\n\t\tfor(int i=1;i<n;i++){\n\t\t\tsum += a[i];\n\t\t\tif(sum*sign>=0){\n\t\t\t\tcnt2 += Math.abs(sum) + 1;\n\t\t\t\tsum = -sign;\n\t\t\t}\n\t\t\tsign *= -1;\n\t\t}\n\n\t\tSystem.out.println(Math.min(cnt1, cnt2));\n\t}\n}", "#include <iostream>\n#include <algorithm>\nusing namespace std;\ntypedef long long int ll;\nint main(){\nint n;\ncin >> n;\nll a[n],sum=0,cnt1=0,cnt2=0;\nfor(int i=0;i<n;i++) cin >> a[i];\nfor(int i=0;i<n;i++){//奇数番目が正\n sum+=a[i];\n if(i%2==0){\n if(sum>=0) cnt1+=1+sum,sum=-1;//1にするまでの距離?を足す\n }\n else{\n if(sum<=0) cnt1+=1-sum,sum=1;//sumは1か-1になってる\n }\n}\nsum=0;\nfor(int i=0;i<n;i++){//奇数番目が負\n sum+=a[i];\n if(i%2==0){\n if(sum<=0) cnt2+=1-sum,sum=1;\n }\n else{\n if(sum>=0) cnt2+=1+sum,sum=-1;\n }\n}\ncout << min(cnt1,cnt2)<<endl;\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Hamza Hasbi\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n C_Sequence solver = new C_Sequence();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class C_Sequence {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n\n long[] a = new long[n + 1];\n long[] pre = new long[n + 1];\n Arrays.fill(a, 0);\n Arrays.fill(pre, 0);\n long[] pro = new long[n + 1];\n Arrays.fill(pro, 0);\n long res = 0;\n long ans = 0;\n\n\n for (int i = 1; i <= n; i++) {\n a[i] = in.nextLong();\n pre[i] = pre[i - 1] + a[i];\n if ((i & 1) == 1 && pre[i] <= 0) {\n ans += Math.abs(1 - pre[i]);\n pre[i] = 1;\n continue;\n }\n if ((i & 1) == 0 && pre[i] >= 0) {\n ans += Math.abs(1 + pre[i]);\n pre[i] = -1;\n continue;\n }\n }\n\n\n for (int i = 1; i <= n; i++) {\n\n pro[i] = pro[i - 1] + a[i];\n if ((i & 1) == 0 && pro[i] <= 0) {\n res += Math.abs(1 - pro[i]);\n pro[i] = 1;\n continue;\n }\n if ((i & 1) == 1 && pro[i] >= 0) {\n res += Math.abs(1 + pro[i]);\n pro[i] = -1;\n continue;\n }\n }\n\n out.printLine(Math.min(res, ans));\n }\n\n }\n\n static class InputReader {\n BufferedReader reader;\n StringTokenizer st;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream));\n st = null;\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String line = reader.readLine();\n if (line == null) {\n return null;\n }\n st = new StringTokenizer(line);\n } catch (Exception e) {\n throw new RuntimeException();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n public void close() {\n writer.close();\n }\n\n }\n}\n\n", "#include<bits/stdc++.h>\n#define rep(i,s,t) for(int i=s;i<=t;i++)\n\nusing namespace std;\n\ntypedef long long LL;\nLL ans1,ans2,sum;\nint n;\nint a[100010];\n\nint main(){\n\tscanf(\"%d\",&n);\n\trep(i,1,n) scanf(\"%d\",&a[i]);\n\tsum=0;\n\tfor(int i=1,s=1;i<=n;i++,s*=-1){\n\t\tsum+=a[i];\n\t\tif(sum*s<=0) ans1+=abs(sum-s),sum=s;\n\t}\n\tsum=0;\n\tfor(int i=1,s=-1;i<=n;i++,s*=-1){\n\t\tsum+=a[i];\n\t\tif(sum*s<=0) ans2+=abs(sum-s),sum=s;\n\t}\n\tprintf(\"%lld\\n\",min(ans1,ans2));\n\treturn 0;\n} ", "import java.util.Scanner;\n\npublic class Main {\n\n\tstatic String[] alphabet = { \"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\",\n\t\t\t\"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\" };\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tlong[] ary = new long[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tary[i] = sc.nextLong();\n\t\t}\n\t\tlong cstKisu = 0;\n\t\tlong[] aryKisu = new long[N];\n\t\tSystem.arraycopy(ary, 0, aryKisu, 0, ary.length);\n\t\tlong sumKisu = 0;\n\t\tfor (int i = 0; i < aryKisu.length; i++) {\n\t\t\tsumKisu += aryKisu[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tif (sumKisu <= 0) {\n\t\t\t\t\taryKisu[i] += 1 - sumKisu;\n\t\t\t\t\tcstKisu += 1 - sumKisu;\n\t\t\t\t\tsumKisu = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sumKisu >= 0) {\n\t\t\t\t\taryKisu[i] -= sumKisu + 1;\n\t\t\t\t\tcstKisu += sumKisu + 1;\n\t\t\t\t\tsumKisu = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlong cstGusu = 0;\n\t\tlong[] aryGusu = new long[N];\n\t\tSystem.arraycopy(ary, 0, aryGusu, 0, ary.length);\n\t\tlong sumGusu = 0;\n\t\tfor (int i = 0; i < aryGusu.length; i++) {\n\t\t\tsumGusu += aryGusu[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tif (sumGusu >= 0) {\n\t\t\t\t\taryGusu[i] -= sumGusu + 1;\n\t\t\t\t\tcstGusu += sumGusu + 1;\n\t\t\t\t\tsumGusu = -1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sumGusu <= 0) {\n\t\t\t\t\taryGusu[i] += 1 - sumGusu;\n\t\t\t\t\tcstGusu += 1 - sumGusu;\n\t\t\t\t\tsumGusu = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(cstGusu, cstKisu));\n\n\t}\n\n}", "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main() {\n\tint n; cin >> n;\n\tvector<int>a(n); for (auto&& x : a)cin >> x;\n\n\tlong long ans1 = 0, ans2 = 0, sum = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tsum += a[i];\n\t\tif (i % 2 == 0 && sum >= 0) {\t\t\t\n\t\t\tans1 += sum + 1;\n\t\t\tsum = -1;\n\t\t}\n\t\telse if (i % 2 == 1 && sum <= 0) {\n\t\t\tans1 += -sum + 1;\n\t\t\tsum = 1;\n\t\t}\n\t}\n\n\tsum = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tsum += a[i];\n\t\tif (i % 2 == 1 && sum >= 0) {\n\t\t\tans2 += sum + 1;\n\t\t\tsum = -1;\n\t\t}\n\t\telse if (i % 2 == 0 && sum <= 0) {\n\t\t\tans2 += -sum + 1;\n\t\t\tsum = 1;\n\t\t}\n\t}\n\tcout << min(ans1, ans2) << endl;\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int MAXN = 1e5+10;\n\nint n;\nll arr[ MAXN ];\n\nint g( ll x ) {\n\tif( x < 0 ) return -1;\n\tif( x == 0 ) return 0;\n\treturn 1;\n}\n\nll f( ll sgn ) {\n\tll r = 0, acc = 0;\n\tfor( int i = 0; i < n; ++i ) {\n\t\tacc += arr[i];\n\t\tif( g(acc) != sgn ) {\n\t\t\tr += abs(sgn-acc);\n\t\t\tacc = sgn;\n\t\t}\n\t\tsgn *= -1;\n\t}\n\treturn r;\n}\n\nint main( ) {\n\n\tios_base::sync_with_stdio( 0 );\n\tcin.tie( 0 );\n\n#ifdef LOCAL\n\tfreopen( \"input\", \"r\", stdin );\n#endif\n\n\twhile( cin >> n ) {\n\t\tll ans = 0;\n\t\tfor( int i = 0; i < n; ++i ) {\n\t\t\tcin >> arr[i];\n\t\t}\n\t\tans = min( f(1), f(-1) );\n\t\tcout << ans << '\\n';\n\t}\n\n\n\treturn 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0 ; i < n ; i++) a[i] = sc.nextInt();\n\t\tlong sum = 0, ans = 0, ans2 = 0;\n\t\t// 偶数位置までの和：正、奇数位置までの和：負\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tif(i % 2 == 0) {\n\t\t\t\tif(sum + a[i] >= 0) {\n\t\t\t\t\tans += sum + a[i] + 1;\n\t\t\t\t\tsum = -1;\n\t\t\t\t} else {\n\t\t\t\t\tsum += a[i];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(sum + a[i] <= 0) {\n\t\t\t\t\tans += 1 - (sum + a[i]);\n\t\t\t\t\tsum = 1;\n\t\t\t\t} else {\n\t\t\t\t\tsum += a[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsum = 0;\n\t\t// 偶数位置までの和：正、奇数位置までの和：負\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tif(i % 2 == 1) {\n\t\t\t\tif(sum + a[i] >= 0) {\n\t\t\t\t\tans2 += sum + a[i] + 1;\n\t\t\t\t\tsum = -1;\n\t\t\t\t} else {\n\t\t\t\t\tsum += a[i];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(sum + a[i] <= 0) {\n\t\t\t\t\tans2 += 1 - (sum + a[i]);\n\t\t\t\t\tsum = 1;\n\t\t\t\t} else {\n\t\t\t\t\tsum += a[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(ans, ans2));\n\t}\n}\n", "import java.io.File;\nimport java.io.IOException;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\t//ABC059\n\tpublic static void main(String[] args) throws IOException {\n\t\t//File file = new File(\"input.txt\");\n\t\t//Scanner in = new Scanner(file);\n\t\t\n\t\tScanner in = new Scanner(System.in);\n\n\t\tint n = in.nextInt();\n\t\tint[] a = new int[n];\n\t\tlong ans1 = 0;\n\t\tlong ans2 = 0;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\ta[i] = in.nextInt();\n\t\t}\n\t\t\n\t\t//+-+-\n\t\tlong sum = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 0 && sum <= 0){\n\t\t\t\tlong diff = Math.abs(sum) + 1;\n\t\t\t\tsum += diff;\n\t\t\t\tans1 += diff;\n\t\t\t}else if(i % 2 == 1 && sum >= 0){\n\t\t\t\tlong diff = - Math.abs(sum) - 1;\n\t\t\t\tsum += diff;\n\t\t\t\tans1 += Math.abs(diff);\n\t\t\t}\n\t\t}\n\t\t\n\t\t//System.out.println(ans1);\n\t\t\n\t\t//-+-+\n\t\tsum = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 1 && sum <= 0){\n\t\t\t\tlong diff = Math.abs(sum) + 1;\n\t\t\t\tsum += diff;\n\t\t\t\tans2 += diff;\n\t\t\t}else if(i % 2 == 0 && sum >= 0){\n\t\t\t\tlong diff = - Math.abs(sum) - 1;\n\t\t\t\tsum += diff;\n\t\t\t\tans2 += Math.abs(diff);\n\t\t\t}\n\t\t}\n\t\t\n\t\t//System.out.println(ans2);\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n}", "#include<iostream>\n#include<algorithm>\n#include<functional>\n#include<cmath>\n#include<string>\n#include<vector>\n#include<queue>\nusing namespace std;\nconst int mod = 1000000007;\n#define ll long long\n\nll A[100010];\nint main()\n{\n\tint N; cin >> N;\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n\tll sum = 0;\n\tll ans1 = 0, ans2 = 0;\n\tint x = 1;\n\tfor (int i = 0; i < N; i++) {\n\t\tsum += A[i];\n\t\tif (sum * x >= 0) {\n\t\t\tans1 += abs(sum + x);\n\t\t\tsum = -x;\n\t\t}\n\t\tx *= -1;\n\t}\n\tsum = 0; x = -1;\n\tfor (int i = 0; i < N; i++) {\n\t\tsum += A[i];\n\t\tif (sum * x >= 0) {\n\t\t\tans2 += abs(sum + x);\n\t\t\tsum = -x;\n\t\t}\n\t\tx *= -1;\n\t}\n\tcout << min(ans1, ans2) << endl;\n}\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n int n;\n std::cin >> n;\n std::array<int64_t, 2> rets{};\n std::array<int64_t, 2> sums{};\n for (int i = 0; i < n; i++) {\n int a;\n std::cin >> a;\n std::array<int64_t, 2> moves{};\n for (int j = 0; j < 2; j++) {\n sums[j] += a;\n if (i % 2 == j) {\n if (sums[j] >= 0) {\n moves[j] = -sums[j] - 1;\n }\n } else {\n if (sums[j] <= 0) {\n moves[j] = -sums[j] + 1;\n }\n }\n sums[j] += moves[j];\n rets[j] += abs(moves[j]);\n }\n }\n std::cout << std::min(rets[0], rets[1]) << std::endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\n#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)\nusing namespace std;\n \nsigned main(){\n int N;cin>>N;\n vector<long long> A(N);\n REP(i, N) cin >> A[i];\n long long ans=LLONG_MAX;\n int sig[2]={1,-1};\n REP(j,2){ \n long long sum=0;\n long long count=0;\n REP(i,N){\n sum+=A[i];\n if(sig[(i^j)&1]*sum>=0){\n count+=llabs(sum)+1;\n sum=-sig[(i^j)&1];\n }\n }\n ans=min(ans,count);\n }\n cout<<ans<<endl;\n}\n", "#include <iostream>\n\nusing namespace std;\n\nlong long a[100001], res;\nint n;\n\nlong long llabs(long long x) {\n\treturn x < 0 ? -x : x;\n}\n\nvoid solve() {\n\tlong long sum = 0; res = 0;\n\tfor(int i = 0; i < n; ++i) {\n\t\tif((i%2)) {\n\t\t\tif(sum + a[i] <= 0) {\n\t\t\t\tres += llabs(sum + a[i]) + 1;\n\t\t\t\tsum = 1;\n\t\t\t}else {\n\t\t\t\tsum += a[i];\n\t\t\t}\n\t\t}else {\n\t\t\tif(sum + a[i] >= 0) {\n\t\t\t\tres += llabs(sum + a[i]) + 1;\n\t\t\t\tsum = -1;\n\t\t\t}else {\n\t\t\t\tsum += a[i];\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\tcin >> n;\n\tfor(int i = 0; i < n; ++i) {\n\t\tcin >> a[i];\n\t}\n\tsolve();\n\tlong long ress = res;\n\tfor(int i = 0; i < n ; ++i) {\n\t\ta[i] = -a[i];\n\t}\n\tsolve();\n\tcout << (ress < res ? ress : res) << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int64_t i;\n int64_t n;cin >> n;\n vector<int64_t> a(n);for(int i=0;i<n;i++) cin >> a[i];\n int64_t sum=0,ans0=0,ans1=0;\n \n for(i=0;i<n;i++){\n sum += a[i];\n if(i%2==0 && sum<=0){\n ans0 += abs(sum) +1;\n sum = 1;\n } else if(i%2==1 && sum>=0){\n ans0 += abs(sum) +1;\n sum = -1;\n }\n }\n \n sum=0;\n\n for(i=0;i<n;i++){\n sum += a[i];\n if(i%2==0 && sum>=0){\n ans1 += abs(sum) +1;\n sum = -1;\n } else if(i%2==1 && sum<=0){\n ans1 += abs(sum) +1;\n sum = 1;\n }\n }\n \n cout << min(ans0,ans1) << endl;\n return 0;\n}", "N = int(input())\nA = list(map(int, input().split()))\n\ns = 0\ntmp1 = 0\nfor i in range(N):\n s += A[i]\n if i % 2 == 0:\n if s >= 0:\n tmp1 += s + 1\n s = -1\n else:\n if s <= 0:\n tmp1 += -s + 1\n s = 1\n#print(tmp1)\n\ns = 0\ntmp2 = 0\nfor i in range(N):\n s += A[i]\n if i % 2 == 0:\n if s <= 0:\n tmp2 += -s + 1\n s = 1\n else:\n if s >= 0:\n tmp2 += s + 1\n s = -1\n#print(tmp2)\n\nprint(min(tmp1, tmp2))", "#include<iostream>\n\nusing namespace std;\n\nint N;\nint a[112345];\nlong long int ans[2];\nint main () {\n cin >> N;\n for(int i=0; i<N; i++) cin >> a[i];\n for(int i=0; i<2; i++) {\n long long int sum = 0;\n for(int j=0; j<N; j++) {\n sum += a[j];\n if(j % 2 == i ) {\n if(sum <= 0) {\n ans[i] += 1 - sum;\n sum = 1;\n }\n } else {\n if(sum >= 0) {\n ans[i] += sum + 1;\n sum = -1;\n }\n }\n }\n }\n cout << min(ans[0],ans[1]) << endl;\n return 0;\n}", "import java.util.Scanner;\n\nclass Main {\n\tint n;\n\tint[] a;\n\tlong cnt1;\n\tlong cnt2;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tMain m = new Main(sc);\n\t\tm.solve();\n\t\tsc.close();\n\t}\n\n\tMain(Scanner sc) {\n\t\tn = sc.nextInt();\n\t\ta = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t}\n\n\tvoid solve() {\n\t\tThread t1 = new Thread(()->{calc_run1((a[0]>0)?0:(Math.abs(a[0])+1),1,(a[0]>0)?a[0]:1);});\n\t\tt1.start();\n\t\tThread t2 = new Thread(()->{calc_run2((a[0]<0)?0:(Math.abs(a[0])+1),-1,(a[0]<0)?a[0]:-1);});\n\t\tt2.start();\n\t\ttry {\n\t\t\tt1.join();\n\t\t\tt2.join();\n\t\t} catch (InterruptedException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\tSystem.out.println(Math.min(cnt1, cnt2));\n\t}\n\t\n\tvoid calc_run1(long cnt,int sign,long sum){\n\t\tfor(int i=1;i<n;i++){\n\t\t\tsum += a[i];\n\t\t\tif(sum*sign>=0){\n\t\t\t\tcnt += Math.abs(sum) + 1;\n\t\t\t\tsum = -sign;\n\t\t\t}\n\t\t\tsign *= -1;\n\t\t}\n\t\tcnt1 = cnt;\n\t}\n\t\n\tvoid calc_run2(long cnt,int sign,long sum){\n\t\tfor(int i=1;i<n;i++){\n\t\t\tsum += a[i];\n\t\t\tif(sum*sign>=0){\n\t\t\t\tcnt += Math.abs(sum) + 1;\n\t\t\t\tsum = -sign;\n\t\t\t}\n\t\t\tsign *= -1;\n\t\t}\n\t\tcnt2 = cnt;\n\t}\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\t\n\tint n;\n\t\n\tcin >> n;\n\t\n\tvector<long long int> a(n);\n\n\tlong long int sum1=0, sum2=0, cost1=0, cost2=0;\n\n\tfor(int i=0; i<n; i++){\n\t\tcin >> a[i];\n\t\tsum1 += a[i];\n\t\tsum2 += a[i];\n\t\tif(i%2 == 0 && sum1 <= 0){\n\t\t\tcost1 += 1-sum1;\n\t\t\tsum1 = 1;\n\t\t}\n\t\telse if(i%2 == 1 && sum1 >= 0){\n\t\t\tcost1 += sum1+1;\n\t\t\tsum1 = -1;\n\t\t}\n\t\tif(i%2 == 0 && sum2 >= 0){\n\t\t\tcost2 += 1+sum2;\n\t\t\tsum2 = -1;\n\t\t}\n\t\telse if(i%2 == 1 && sum2 <= 0){\n\t\t\tcost2 += 1-sum2;\n\t\t\tsum2 = 1;\n\t\t}\n\t}\n\tcout << min(cost1, cost2) << endl;\n\t\n\treturn 0;\n}", "n = int(input())\nA = list(map(int,input().split()))\ns = max(A[0],1)\ncnt1 = abs(A[0]-s) #sを正にするまで\nfor a in A[1:]:\n if s>0:\n b=min(a, -s-1) #aを何の値にするかがb\n if s<0:\n b=max(a,-s+1)\n s += b #bを足してs更新\n cnt1 += abs(a-b)\n\ns = min(A[0],-1)\ncnt2 = abs(A[0]-s)\nfor a in A[1:]:\n if s>0:\n b=min(a, -s-1) #aを何の値にするかがb\n if s<0:\n b=max(a,-s+1)\n s += b #bを足してs更新\n cnt2 += abs(a-b)\nprint(min(cnt1,cnt2))", "#include <iostream>\n#include <string>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nll s1, s2, c1, c2;\nint main() {\n\tll n, a;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++) {\n\t\tcin >> a;\n\t\ts1 += a;\n\t\ts2 += a;\n\t\tif (i % 2) {\n\t\t\tif (s1 <= 0) c1 += 1 - s1,s1 = 1;\n\t\t\tif (s2 >= 0) c2 += 1 + s2,s2 = -1;\n\t\t}\n\t\telse {\n\t\t\tif (s1 >= 0) c1 += 1 + s1,s1 = -1;\n\t\t\tif (s2 <= 0) c2 += 1 - s2,s2 = 1;\n\t\t}\n\t}\n\tcout << min(c1, c2) << endl;\n\treturn 0;\n}", "import java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.util.*;\nimport java.util.stream.Collectors;\n\npublic class Main {\n public static void main(String[] args) {\n PrintWriter out = new PrintWriter(System.out);\n Scanner sc = new Scanner(System.in);\n Task task = new Task();\n task.solve(sc, out);\n out.flush();\n sc.close();\n }\n\n static class Task {\n public void solve(Scanner sc, PrintWriter out) {\n int n = nint(sc);\n List<Long> aList = getLongList(sc, n);\n\n long sum = 0;\n long result1 = 0;\n long result2 = 0;\n\n long margin = 0;\n // even +1\n for (int i = 0; i < n; i++) {\n sum += aList.get(i);\n if (i%2 == 0){\n if (sum>0){\n continue;\n }else {\n margin = Math.abs(sum)+1;\n result1 += margin;\n sum = 1;\n }\n }else {\n if (sum<0){\n continue;\n }else {\n margin = Math.abs(sum)+1;\n result1 += margin;\n sum = -1;\n }\n }\n }\n sum = 0;\n // even -1\n for (int i = 0; i < n; i++) {\n sum += aList.get(i);\n if (i%2 == 0){\n if (sum<0){\n continue;\n }else {\n margin = Math.abs(sum)+1;\n result2 += margin;\n sum = -1;\n }\n }else {\n if (sum>0){\n continue;\n }else {\n margin = Math.abs(sum)+1;\n result2 += margin;\n sum = 1;\n }\n }\n }\n out.println(Math.min(result1, result2));\n\n\n }\n }\n\n\n static int nint(Scanner sc) {\n return Integer.parseInt(sc.next());\n }\n\n static long nlong(Scanner sc) {\n return Long.parseLong(sc.next());\n }\n\n static double ndouble(Scanner sc) {\n return Double.parseDouble(sc.next());\n }\n\n static float nfloat(Scanner sc) {\n return Float.parseFloat(sc.next());\n }\n\n static String nstr(Scanner sc) {\n return sc.next();\n }\n\n static long[] longLine(Scanner sc, int size) {\n long[] lLine = new long[size];\n for (int i = 0; i < size; i++) {\n lLine[i] = nlong(sc);\n }\n return lLine;\n }\n\n static int[] intLine(Scanner sc, int size) {\n int[] iLine = new int[size];\n for (int i = 0; i < size; i++) {\n iLine[i] = nint(sc);\n }\n return iLine;\n }\n\n static String[] strLine(Scanner sc, int size) {\n String[] strLine = new String[size];\n for (int i = 0; i < size; i++) {\n strLine[i] = nstr(sc);\n }\n return strLine;\n }\n\n static long maxFromList(List<Long> longList) {\n return longList.stream().max(Comparator.naturalOrder()).get();\n }\n\n static long minFromList(List<Long> longList) {\n return longList.stream().min(Comparator.naturalOrder()).get();\n }\n\n public static int sumDigits(int n) {\n int sum = 0;\n while (n != 0) {\n sum += n % 10;\n n /= 10;\n }\n return sum;\n }\n\n public static long sumDigits(long n) {\n long sum = 0;\n while (n != 0) {\n sum += n % 10;\n n /= 10;\n }\n return sum;\n }\n\n static List<Integer> getIntegerList(Scanner sc, int size) {\n List<Integer> list = new ArrayList<>();\n for (int i = 0; i < size; i++) {\n list.add(nint(sc));\n }\n return list;\n }\n\n static List<Long> getLongList(Scanner sc, int size) {\n List<Long> list = new ArrayList<>();\n for (int i = 0; i < size; i++) {\n list.add(nlong(sc));\n }\n return list;\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0 ; i < n ; i++) a[i] = sc.nextInt();\n\t\tlong sum = 0, ans = 0, ans2 = 0;\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 0 && sum <= 0) {\n\t\t\t\tans += 1 - sum;\n\t\t\t\tsum = 1;\n\t\t\t} else if(i % 2 == 1 && sum >= 0) {\n\t\t\t\tans += sum + 1;\n\t\t\t\tsum = -1;\n\t\t\t}\n\t\t}\n\t\tsum = 0;\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 0 && sum >= 0) {\n\t\t\t\tans2 += sum + 1;\n\t\t\t\tsum = -1;\n\t\t\t} else if(i % 2 == 1 && sum <= 0) {\n\t\t\t\tans2 += 1 - sum;\n\t\t\t\tsum = 1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(ans, ans2));\n\t}\n}\n", "n=int(input())\na=list(map(int,input().split()))\n\ns1=c1=s2=c2=0\nfor i in range(n):\n if i%2:\n c1+=max(0,a[i]+s1+1); s1+=min(-s1-1,a[i])\n c2+=max(0,-s2+1-a[i]); s2+=max(-s2+1,a[i])\n else:\n c1+=max(0,-s1+1-a[i]); s1+=max(-s1+1,a[i])\n c2+=max(0,a[i]+s2+1); s2+=min(-s2-1,a[i])\nprint(min(c1,c2))", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint N; cin >> N;\n\tint a[100010]; \n\tfor(int i=0; i<N; ++i) cin >> a[i];\n\tlong plus=0, minus=0;\n\tlong psum=0, msum=0;\n\tfor(int i=0; i<N; ++i){\n\t psum += a[i];\n\t msum += a[i];\n\t if(i%2){\n\t if(psum>=0){\n\t plus += psum+1;\n\t psum=-1;\n\t }\n\t if(msum<=0){\n\t minus += 1-msum;\n\t msum=1;\n\t }\n\n\t }else{\n\t if(psum<=0){\n\t plus += 1-psum;\n\t psum=1;\n\t }\n\t if(msum>=0){\n\t minus += msum+1;\n\t msum=-1;\n\t }\n\t }\n\t}\n\tcout << min(plus, minus) << endl;\n\treturn 0;\n}\n", "import java.util.Scanner;\nimport java.util.Arrays;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int [n];\n for(int i = 0;i < n;i++){\n a[i] = sc.nextInt();\n }\n int[] sum1 = new int[n];\n int[] sum2 = new int[n];\n sum1[0] = a[0];\n sum2[0] = a[0];\n long count = 0;\n //System.out.println(solve1(sum1,a,count));\n //System.out.println(solve2(sum2,a,count));\n count = Math.min(solve1(sum1,a,count),solve2(sum2,a,count));\n System.out.println(count);\n }\n public static long solve1(int[] sum,int[] a,long count){\n if(sum[0] <= 0){\n count += 1 - sum[0];\n sum[0] = 1;\n }\n for(int i = 0;i < sum.length-1;i++){\n sum[i+1] = sum[i] + a[i+1];\n if((i+1) % 2 == 1){\n if(sum[i+1] >= 0){\n count += 1 + sum[i+1];\n sum[i+1] = -1;\n }\n }\n if((i+1) % 2 == 0){\n if(sum[i+1] <= 0){\n count += 1 - sum[i+1];\n sum[i+1] = 1;\n }\n }\n }\n return count;\n }\n public static long solve2(int[] sum,int[] a,long count){\n if(sum[0] >= 0){\n count += 1 + sum[0];\n sum[0] = -1;\n }\n for(int i = 0;i < sum.length-1;i++){\n sum[i+1] = sum[i] + a[i+1];\n if((i+1) % 2 == 1){\n if(sum[i+1] <= 0){\n count += 1 - sum[i+1];\n sum[i+1] = 1;\n }\n }\n if((i+1) % 2 == 0){\n if(sum[i+1] >= 0){\n count += 1 + sum[i+1];\n sum[i+1] = -1;\n }\n }\n }\n return count;\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\ntypedef long long ll;\n\nint main() {\n\tint n,t=0;\n\tll r1=0,r2=0;\n\tcin >> n;\n\n\tvector<int> a(n);\n\trep(i,n)\n\t\tcin >> a.at(i);\n\n\trep(i,n) {\n\t\tt += a.at(i);\n\n\t\tif(i%2==0 && t<=0) {\n\t\t\tr1 += abs(-t)+1;\n\t\t\tt = 1;\n\t\t} else if(i%2 && t>=0) {\n\t\t\tr1 += t+1;\n\t\t\tt = -1;\n\t\t}\n\t}\n\n\tt = 0;\n\trep(i,n) {\n\t\tt += a.at(i);\n\n\t\tif(i%2 && t<=0) {\n\t\t\tr2 += abs(-t)+1;\n\t\t\tt = 1;\n\t\t} else if(i%2==0 && t>=0) {\n\t\t\tr2 += t+1;\n\t\t\tt = -1;\n\t\t}\n\t}\n\n\tcout << min(r1,r2) << endl;\n}", "#include\t<bits/stdc++.h>\nusing namespace std;\n\nint\tmain() {\n\tint N;\n\tcin >>N;\n\tlong S0=0;\n\tlong S1=0;\n\tlong T0=0;\n\tlong T1=0;\n\tfor (int i=0; i<N; i++) {\n\t\tlong a;\n\t\tcin >>a;\n\t\tS0 +=a;\n\t\tS1 +=a;\n\t\tif (0==i%2) {\n\t\t\tif (0>=S0) {\n\t\t\t\tS0=1-S0;\n\t\t\t\tT0 +=S0;\n\t\t\t\tS0=1;\n\t\t\t}\n\t\t\tif (0<=S1) {\n\t\t\t\tS1=S1+1;\n\t\t\t\tT1 +=S1;\n\t\t\t\tS1=-1;\n\t\t\t}\n\t\t} else {\n\t\t\tif (0<=S0) {\n\t\t\t\tS0=S0+1;\n\t\t\t\tT0 +=S0;\n\t\t\t\tS0=-1;\n\t\t\t}\n\t\t\tif (0>=S1) {\n\t\t\t\tS1=1-S1;\n\t\t\t\tT1 +=S1;\n\t\t\t\tS1=1;\n\t\t\t}\n\t\t}\n\t}\n\tcout <<min(T0, T1) <<endl;\n\treturn 0;\n};\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nint solvePlus(vector<int> v) {\n int cnt = 0, sum = 0;\n\n for (int i = 0; i < v.size(); i++) {\n sum += v[i];\n if (i % 2 == 1) {\n cnt = (sum < 0) ? cnt : (cnt + abs(sum) + 1);\n sum = (sum < 0) ? sum : -1;\n } else if (i % 2 == 0) {\n cnt = (sum > 0) ? cnt : (cnt + abs(sum) + 1);\n sum = (sum > 0) ? sum : 1;\n }\n }\n return cnt;\n}\n\nsigned main() {\n int n;\n cin >> n;\n vector<int> a(n), b(n);\n for (auto&& w : a) cin >> w;\n copy(begin(a), end(a), begin(b));\n for (auto&& w : b) w *= -1;\n\n int ans = min(solvePlus(a), solvePlus(b));\n\n cout << ans << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint n, a[100000], s = 0;\nll x = 0, y = 0;\nbool b = 0;\n\nint main() {\n\tcin >> n;\n\tfor (int i = 0; i < n; ++i)\n\t\tcin >> a[i];\n\n\tfor (int i = 0; i < n; ++i, b = !b) {\n\t\ts += a[i];\n\t\tif (b) {\n\t\t\tif (s <= 0) {\n\t\t\t\tx += 1 - s;\n\t\t\t\ts = 1;\n\t\t\t}\n\t\t} else if (s >= 0) {\n\t\t\tx += s + 1;\n\t\t\ts = -1;\n\t\t}\n\t}\n\n\tb = 1;\n\ts = 0;\n\tswap(x, y);\n\tfor (int i = 0; i < n; ++i, b = !b) {\n\t\ts += a[i];\n\t\tif (b) {\n\t\t\tif (s <= 0) {\n\t\t\t\tx += 1 - s;\n\t\t\t\ts = 1;\n\t\t\t}\n\t\t} else if (s >= 0) {\n\t\t\tx += s + 1;\n\t\t\ts = -1;\n\t\t}\n\t}\n\tcout << min(x, y) << endl;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n long a[] = new long[n];\n\n for (int i = 0; i < n; i++) {\n a[i] = in.nextInt();\n }\n\n long odd = f(a, n, 1);\n long even = f(a, n, -1);\n\n System.out.println(Math.min(odd, even));\n }\n\n static long f(long a[], int n, int sign) {\n long total = 0;\n long man = 0;\n for (int i = 0; i < n; i++) {\n total += a[i];\n if (total * sign <= 0) {\n long x = Math.abs(total) + 1;\n total += sign * x;\n man += x;\n }\n sign = -sign;\n }\n return man;\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint posi(long long x){\n\tif(x>0)return 1;\n\tif(x<0)return -1;\n\treturn 0;\n}\n\nint main(){\n\tint N;\n\tcin >> N;\n\tvector<long long> a(N);\n\tfor(auto &i:a)cin >> i;\n\tlong long ans=0,tmp=0;\n\tlong long sum=a[0];\n\tif(a[0]==0){\n\t\ttmp=1;\n\t\tsum=-1;\n\t}\n\tfor(int i=1;i<N;i++){\n\t\tif(posi(sum+a[i])*posi(sum)!=-1 || sum+a[i]==0){\n\t\t\ttmp+=abs(sum+a[i])+1;\n\t\t\tsum=(sum>0)?-1:1;\n\t\t}\n\t\telse sum+=a[i];\n\t}\n\tans=tmp;\n\t\n\ttmp=abs(a[0])+1;\n\tsum=(a[0]>0)?-1:1;\n\tfor(int i=1;i<N;i++){\n\t\tif(posi(sum+a[i])*posi(sum)!=-1 || sum+a[i]==0){\n\t\t\ttmp+=abs(sum+a[i])+1;\n\t\t\tsum=(sum>0)?-1:1;\n\t\t}\n\t\telse sum+=a[i];\n\t}\n\tans=min(ans,tmp);\n\tcout << ans << endl;\n\treturn 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.Character.Subset;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.temporal.ValueRange;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Objects;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\nimport java.util.concurrent.ForkJoinPool;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Solver solver = new Solver(in, out);\n solver.solve();\n\n out.close();\n }\n\n // ======================================================================\n static class Solver {\n \tMyInput in;\n \tPrintWriter out;\n public Solver(MyInput in, PrintWriter out) {\n \tthis.in = in;\n \tthis.out = out;\n }\n\n // -----------------------------------------\n public void solve() {\n \tint N = ni();\n \tlong[] A = ndl(N);\n \tlong cnt = 0;\n \tlong total = 0;\n \tboolean f = true;\n \tfor (int i = 0; i < N; i++) {\n \t\ttotal += A[i];\n\t\t\t\tif(f && total <= 0) {\n\t\t\t\t\tcnt += (Math.abs(total) + 1);\n\t\t\t\t\ttotal = 1;\n\t\t\t\t} else if(!f && total >= 0){\n\t\t\t\t\tcnt += (Math.abs(total) + 1);\n\t\t\t\t\ttotal = -1;\n\t\t\t\t}\n\t\t\t\tf = !f;\n\t\t\t}\n \tlong ans = cnt;\n \tcnt = 0;\n \ttotal = 0;\n \tf = false;\n \tfor (int i = 0; i < N; i++) {\n \t\ttotal += A[i];\n\t\t\t\tif(f && total <= 0) {\n\t\t\t\t\tcnt += (Math.abs(total) + 1);\n\t\t\t\t\ttotal = 1;\n\t\t\t\t} else if(!f && total >= 0){\n\t\t\t\t\tcnt += (Math.abs(total) + 1);\n\t\t\t\t\ttotal = -1;\n\t\t\t\t}\n\t\t\t\tf = !f;\n\t\t\t}\n \tans = Math.min(ans, cnt);\n \tprn(ans);\n }\n\n // -----------------------------------------\n // Integer のキーに対して、カウントを管理する（カウントを足したり、引いたりする）\n static class MapCounter {\n \tprivate Map<Long, Long> map = new TreeMap<>();\n \tpublic MapCounter() {}\n \t// キーのカウントに値を足す\n \tpublic void add(long key) {\n \t\tadd(key, 1);\n \t}\n \tpublic void add(long key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)cnt);\n \t\t} else {\n \t\t\tmap.put(key, val + cnt);\n \t\t}\n \t}\n \t// キーのカウントから値を引く\n \tpublic void sub(long key) {\n \t\tsub(key, 1);\n \t}\n \tpublic void sub(long key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)-cnt);\n \t\t} else {\n \t\t\tmap.put(key, val - cnt);\n \t\t}\n \t}\n \t// キーのカウントを取得する（なければ　ＮＵＬＬを返す）\n \tpublic Long getCountwithNull(long key) {\n \t\treturn map.get(key);\n \t}\n \t// キーのカウントを取得する（なければ　０　を返す）\n \tpublic Long getCount(long key) {\n \t\tLong val = map.get(key);\n \t\tif(val == null)\t\treturn 0L;\n \t\telse \t\t\t\treturn val;\n \t}\n \tpublic Set<Long> getKey() {\n \t\treturn map.keySet();\n \t}\n \t// 登録されているキーの数を返す\n \tpublic int getKeyCount() {\n \t\treturn map.keySet().size();\n \t}\n }\n // -----------------------------------------\n // 配列のバイナリーサーチ　１\n boolean isRightMin(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] >= key)\t\treturn true;\t\t// 以上\n \t else if (!f && a[index] > key)\treturn true;\t\t// より大きい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以上（f=true)または、より大きく（f=false)、一番小さい値を返す\n \tint binarySearchRightMin(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isRightMin(a, f, mid, key))\tok = mid;\t// 下半分を対象とする\n \t else \t\t\t\t\t\t\tng = mid;\t// 上半分を対象とする\n \t }\t\n \t return ok;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n // -----------------------------------------\n // 配列のバイナリーサーチ　２\n boolean isLeftMax(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] <= key)\t\treturn true;\t\t// 以下\n \t else if (!f && a[index] < key)\treturn true;\t\t// より小さい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以下（f=true)または、より小さい（f=false)、一番大きい値を返す\n \tint binarySearchLeftMax(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isLeftMax(a, f, mid, key))\tng = mid;\t// 上半分を対象とする\n \t else \t\t\t\t\t\t\tok = mid;\t// 下半分を対象とする\n \t }\t\n \t return ng;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n \t\n // -----------------------------------------\n \t// オイラーツアー（部分木対応）\n \tstatic class EulerTour {\n \t\tGraph g;\n \t\tList<Integer> euler_tour = new ArrayList<>();\n \t\tint[] begin, end;\n \t\tint k = 0, root = 0;\n \t\t\n \t\tvoid dfs(int v,int p, PrintWriter out) {\n \t\t\tout.println(\"v = \" + v + \" p = \" + p);\n \t\t\tbegin[v] = k;\n \t\t\teuler_tour.add(v);\n \t\t\tk++;\n \t\t\tif(!g.contains(v)) {\n \t\t\t\treturn;\n \t\t\t}\n \t\t\tfor(int i : g.get(v)) {\n \t\t\t\tif(i != p) {\n \t\t\t\t\tdfs(i, v, out);\n \t\t\t\t\teuler_tour.add(v);\n \t\t\t\t\tk++;\n \t\t\t\t}\n \t\t\t}\n \t\t\tend[v]=k;\n \t\t}\n \t\t// 初期化\n \t\tpublic void init(int p_cnt, int root, Graph g, PrintWriter out) {\n \t\t\tbegin = new int[p_cnt + 1];\n \t\t\tend = new int[p_cnt + 1];\n \t\t\tthis.root = root;\n \t\t\tthis.g = g;\n \t\t\tdfs(root, -1, out);\n \t\t}\n \t\t// 部分木の頂点を渡すと、オイラーツアーの部分木を返す\n \t\tpublic List getPartTour(int v) {\n \t\t\treturn euler_tour.subList(begin[v], end[v]);\n \t\t}\n \t\t// 部分木の頂点を渡すと、頂点のリストを返す\n \t\tpublic List<Integer> getPartList(int v) {\n \t\t\tSet<Integer> set = new TreeSet<>();\n\t\t\t\tset.addAll(getPartTour(v));\n\t\t\t\tList<Integer> ans = new ArrayList<>();\n\t\t\t\tfor(Integer p : set) {\n\t\t\t\t\tans.add(p);\n\t\t\t\t}\n\t\t\t\treturn ans;\n \t\t}\n \t}\n \t\n // -----------------------------------------\n // グラフのリンクリスト\n static class Graph {\n \t// 頂点に紐づく頂点のリスト\n private Map<Integer, List<Integer>> data = new HashMap<Integer, List<Integer>>();\n// // 全ての頂点のセット\n// private Set<Integer> point = new TreeSet<>();\n // 頂点と頂点の繋がりを追加する\n void add(int from, int to) {\n \tList<Integer> list = data.get(from);\n \tif(list == null) {\n \t\tlist = new ArrayList<Integer>();\n \t\tdata.put(from, list);\n \t}\n \tlist.add(to);\n// \tpoint.add(key);\n// \tpoint.add(value);\n }\n // 指定された頂点に紐づく、頂点のリストを返す\n List<Integer> get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set<Integer> keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList<Integer> list = data.get(key_1);\n \tif(list == null)\treturn false;\n \telse \t\t\t\treturn list.contains(key_2);\n }\n // 指定された頂点から、すべての頂点への距離を返す\n List<PP> distList(int key) {\n \tList<PP> dist = new ArrayList<>();\t\t// 頂点と距離のペアのリスト\n \tSet<Integer> mark = new HashSet<>();\t// 処理したら入れる\n \t\t\tStack<PP> stack = new Stack<>();\t\t// スタックの宣言\n \t\t\tstack.push(new PP(key, 0));\t\t\t\t// スタートをスタックに保存\n \t\t\twhile(!stack.isEmpty()) {\n \t\t\t\tPP wk = stack.pop();\t\t\t\t// スタックから次の頂点を取得\n \t\t\t\tint pp = wk.getKey();\n \t\t\t\tint dd = wk.getVal();\n \t\t\t\tmark.add(pp);\t\t\t\t\t\t// 通過マーク\n \t\t\tdist.add(new PP(pp, dd));\t\t\t// 距離を登録\n \t\t\t\tList<Integer> list = get(pp);\t\t// つながっている頂点のリストを取得\n \t\t\t\tfor(int next : list) {\n \t\t\t\t\tif(mark.contains(next))\tcontinue;\n \t\t\t\t\tstack.push(new PP(next, dd + 1));\n \t\t\t\t}\n \t\t\t}\n \t\t\treturn dist;\n }\n // ダンプ\n void dump(PrintWriter out) {\n \tfor(int key : data.keySet()) {\n \t\tout.print(key + \" : \");\n \t\tfor(int val : data.get(key)) {\n \t\t\tout.print(val + \" \");\n \t\t}\n \t\tout.println(\"\");\n \t}\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト\n static class GraphWith {\n \t// キーに紐づくリストに、頂点番号と重さのペアを持つ\n private Map<Integer, List<PP>> data = new HashMap<Integer, List<PP>>();\n // 指定された頂点に紐づく、頂点と重さのペアを追加する\n void add(int key, PP p) {\n \tList<PP> list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList<PP>();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(p);\n }\n // 頂点に紐づく、頂点と重さのペアのリストを返す\n List<PP> get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set<Integer> keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList<PP> list = data.get(key_1);\n \tif(list == null)\treturn false;\n \tboolean ans = false;\n \tfor(PP p : list) {\n \t\tif(p.getKey() == key_2) {\n \t\t\tans = true;\n \t\t\tbreak;\n \t\t}\n \t}\n \treturn ans;\n }\n }\n // -----------------------------------------\n // グラフのリンクリスト(Long)\n static class GraphLong {\n private Map<Long, List<Long>> G = new HashMap<Long, List<Long>>();\n void add(long key, long value) {\n \tList<Long> list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList<Long>();\n \t\tG.put(key, list);\n \t}\n \tlist.add(value);\n }\n List<Long> get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト(Long)\n static class GraphLongWith {\n private Map<Long, List<PPL>> G = new HashMap<Long, List<PPL>>();\n void add(long key, PPL p) {\n \tList<PPL> list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList<PPL>();\n \t\tG.put(key, list);\n \t}\n \tlist.add(p);\n }\n List<PPL> get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n\n void prn(String s) {\n \tout.println(s);\n }\n void prn(int i) {\n \tout.println(i);\n }\n void prn(long i) {\n \tout.println(i);\n }\n void prr(String s) {\n \tout.print(s);\n }\n int ni() {\n \treturn in.nextInt();\n }\n long nl() {\n \treturn in.nextLong();\n }\n double nd() {\n \treturn in.nextDouble();\n }\n String ns() {\n \treturn in.nextString();\n }\n int[] ndi(int n) {\n \tint[] ans = new int[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ni();\n \t}\n \treturn ans;\n }\n long[] ndl(int n) {\n \tlong[] ans = new long[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nl();\n \t}\n \treturn ans;\n }\n double[] ndd(int n) {\n \tdouble[] ans = new double[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nd();\n \t}\n \treturn ans;\n }\n String[] nds(int n) {\n \tString[] ans = new String[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ns();\n \t}\n \treturn ans;\n }\n int[][] nddi(int n, int m) {\n \tint[][] ans = new int[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = ni();\n \t}\n \t}\n \treturn ans;\n }\n long[][] nddl(int n, int m) {\n \tlong[][] ans = new long[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = nl();\n \t}\n \t}\n \treturn ans;\n }\n }\n // Set に入れるなら　PPKEY　を使う！\n static class PP{\n \tpublic int key, val;\n \tpublic PP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPL {\n \tpublic long key, val;\n \tpublic PPL(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPDL {\n \tpublic long key;\n \tpublic long[] val;\n \tpublic PPDL(long key, long[] val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long[] getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long[] val) {\n\t\t\tthis.val = val;\n\t\t}\n\t\tpublic void dump(PrintWriter out) {\n\t\t\tout.print(\"key = \" + key + \" val \");\n\t\t\tfor(int i=0; i < val.length; i++) {\n\t\t\t\tout.print(\"[\" + val[i] + \"] \");\n\t\t\t}\n\t\t\tout.println(\"\");\n\t\t}\n }\n // HashMap のキーに使う　→　Set に入れるのもこれ（PPでは値での比較が行われない）\n static final class PPKEY{\n \tprivate final int key, val;\n \tpublic PPKEY(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // HashMap のキーに使う　→　Set に入れるのもこれ（PPでは値での比較が行われない）\n static final class PPLKEY{\n \tprivate final long key, val;\n \tpublic PPLKEY(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // ======================================================================\n static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n }\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public double nextDouble() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n double ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n int cnt = 0;\n for (; i < len; i++) {\n \tif(str[i] == '.') {\n \t\tcnt = 10;\n \t\tcontinue;\n \t}\n \tif(cnt == 0) {\n \t\tret = ret * 10 + str[i] - '0';\n \t} else {\n \t\tret = ret + ((double)(str[i] - '0') / cnt);\n \t\tcnt *= 10;\n \t}\n }\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n\n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "N = int(input())\nA = list(map(int,input().split()))\n\ntotal = [0,0]\ncount = [0,0]\n\nfor i in range(2):\n for j in range(N):\n total[i] += A[j]\n if (i+j)%2 == 0:\n if total[i] >= 0:\n count[i] += abs(total[i]+1)\n total[i] = -1\n else:\n if total[i] <= 0:\n count[i] += abs(total[i]-1)\n total[i] = 1\n\nprint(min(count))", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.*;\n \npublic class Main {\n \n void solve() throws IOException {\n int N = ni();\n int[] a = new int[N];\n for (int i = 0; i < N; i++) {\n a[i] = ni();\n }\n long csum = 0;\n long ans = 0;\n for (int i = 0; i < N; i++) {\n csum += a[i];\n if(i%2==0 && csum>=0) {\n ans+= Math.abs(csum - (-1));\n csum = -1;\n }\n else if (i%2==1 && csum<=0) {\n ans += Math.abs(csum - 1);\n csum = 1;\n }\n\n }\n csum = 0;\n long ans2 = 0;\n for (int i = 0; i < N; i++) {\n csum += a[i];\n if(i%2==0 && csum<=0) {\n ans2 += Math.abs(csum - (1));\n csum = 1;\n }\n else if (i%2==1 && csum>=0) {\n ans2 += Math.abs(csum - (-1));\n csum = -1;\n }\n\n }\n out.println(Math.min(ans,ans2));\n }\n\n final int mod = 1000000007;\n final BigInteger MOD = BigInteger.valueOf(mod);\n int upperBound(ArrayList<Long> list, Long target){\n int i = Collections.binarySearch(list, target, new UpperBoundComparator<Long>());\n return ~i;\n }\n class UpperBoundComparator<T extends Comparable<? super T>> implements Comparator<T>{\n public int compare(T x, T y){\n return (x.compareTo(y) > 0) ? 1 : -1;\n }\n }\n int lowerBound(ArrayList<Long> list, Long target){\n int i = Collections.binarySearch(list, target, new LowerBoundComparator<Long>());\n return ~i;\n }\n class LowerBoundComparator<T extends Comparable<? super T>> implements Comparator<T>{\n public int compare(T x, T y){\n return (x.compareTo(y) >= 0) ? 1 : -1;\n }\n }\n int mul(int x, int y){\n int val = (int)((x * 1L * y) % mod);\n return val>=0 ? val : val+mod;\n }\n int add(int x, int y) {\n x += y;\n if(x < 0) x += mod;\n if(x>=mod) x -= mod;\n return x;\n }\n int sub(int x, int y){\n x = add(x,mod-y);\n if(x < 0) x += mod;\n if(x>=mod) x -= mod;\n return x;\n }\n String ns() throws IOException {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine(), \" \");\n }\n return tok.nextToken();\n }\n \n int ni() throws IOException {\n return Integer.parseInt(ns());\n }\n \n long nl() throws IOException {\n return Long.parseLong(ns());\n }\n \n double nd() throws IOException {\n return Double.parseDouble(ns());\n }\n \n String[] nsa(int n) throws IOException {\n String[] res = new String[n];\n for (int i = 0; i < n; i++) {\n res[i] = ns();\n }\n return res;\n }\n \n int[] nia(int n) throws IOException {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = ni();\n }\n return res;\n }\n \n long[] nla(int n) throws IOException {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nl();\n }\n return res;\n }\n \n static BufferedReader in;\n static PrintWriter out;\n static StringTokenizer tok;\n \n public static void main(String[] args) throws IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n tok = new StringTokenizer(\"\");\n Main main = new Main();\n main.solve();\n out.close();\n }\n}", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n \n \npublic class Main {\n public static void main(String[] args) {\n try {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n String[] inputString = br.readLine().split(\" \");\n long[] input = new long[n];\n for(int i = 0 ; i < n ; i++) {\n input[i] = Integer.parseInt(inputString[i]);\n }\n long result = -1, keyValue = result;\n while(keyValue == -1){\n \tkeyValue = result;\n \tresult = 0;\n \tlong count = 0;\n \tfor(int i = 0 ; i < n ; i++){\n \t\tif(i % 2 == 0 && (count + input[i]) * Math.signum(keyValue) >= 0){\n \t\t\tresult += Math.abs(count + input[i]) + 1;\n \t\t\tcount = (int)Math.signum(keyValue) * -1;\n \t\t}else if(i % 2 != 0 && (count + input[i]) * Math.signum(keyValue) <= 0){\n \t\t\tresult += Math.abs(count + input[i]) + 1;\n \t\t\tcount = (int)Math.signum(keyValue);\n \t\t}else{\n \t\t\tcount += input[i];\n \t\t}\n \t}\n \tresult = (keyValue != -1)? Math.min(result, keyValue): result;\n }\n System.out.println(result);\n } catch (Exception e) {\n \te.printStackTrace();\n }\n }\n \n}", "#include<iostream>\n \nusing namespace std;\n \nint n;\nlong long a[100005];\nlong long ans1, ans2, sum;\n \nvoid solver(){\n sum = 0;\n for(int i = 1, s = 1; i <= n; ++i, s *= -1){\n sum += a[i];\n if(sum * s <= 0)ans1+=abs(sum-s),sum=s;\n }\n sum = 0;\n for(int i = 1, s = -1; i <= n; ++i, s *= -1){\n sum += a[i];\n if(sum * s <= 0)ans2+=abs(sum-s),sum=s;\n }\n cout << min(ans1, ans2) << endl;\n}\n \nint main(){\n cin >> n;\n for(int i = 1; i <= n; ++i){\n cin >> a[i];\n }\n solver();\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n long cnt1 = 0;\n long add1 = 0;\n //一番目を奇数スタートにする。\n for (int i = 0; i < n; i++) {\n add1 += a[i];\n if (i % 2 == 0 && add1 <= 0) {\n cnt1 += (long) 1 - add1;\n add1 = 1;\n } else if (i % 2 == 1 && add1 >= 0) {\n cnt1 += (long) add1 + 1;\n add1 = -1;\n }\n }\n\n long cnt2 = 0;\n long add2 = 0;\n for (int i = 0; i < n; i++) {\n add2 += a[i];\n if (i % 2 == 1 && add2 <= 0) {\n cnt2 += (long) 1 - add2;\n add2 = 1;\n } else if (i % 2 == 0 && add2 >= 0) {\n cnt2 += (long) add2 + 1;\n add2 = -1;\n }\n }\n\n System.out.println(Math.min(cnt1, cnt2));\n\n }\n\n}", "#include <iostream>\nusing namespace std;\n\ntypedef long long ll;\nconst int MAX = 1e5;\n\nint n;\nint a[MAX];\n\nll solve(bool flag, ll sum) {\n ll res = 0;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (flag) {\n if (sum >= 0) {\n res += sum + 1;\n sum = -1;\n }\n } else {\n if (sum <= 0) {\n res += -sum + 1;\n sum = 1;\n }\n }\n flag = !flag;\n }\n\n return res;\n}\n\nint main() {\n cin >> n;\n for (int i = 0; i < n; i++) cin >> a[i];\n\n // 貪欲法で操作回数の最小値を求める\n // プラスから始まるパターンとマイナスから始まるパターンの2パターン試して、その小さい方が答え\n cout << min(solve(true, 0), solve(false, 0)) << endl;\n return 0;\n}\n", "import copy\n\nn=int(input())\na=[int(x) for x in input().rstrip().split()]\n\nnow=0\nans1=0\nfor i in range(n):\n now+=a[i]\n if i%2==0:\n if now<=0:\n ans1+=abs(now)+1\n now=1\n else:\n if 0<=now:\n ans1+=abs(now)+1\n now=-1\n\nnow=0\nans2=0\nfor i in range(n):\n now+=a[i]\n if i%2==0:\n if 0<=now:\n ans2+=abs(now)+1\n now=-1\n else:\n if now<=0:\n ans2+=abs(now)+1\n now=1\nprint(min(ans1,ans2))", "import java.util.*;\n\n// ABC 6-C\n// http://abc006.contest.atcoder.jp/tasks/abc006_3\n \npublic class Main {\n\t\n\tpublic static void main (String[] args) throws java.lang.Exception {\n\t\tScanner in = new Scanner(System.in);\n\n\t\tint n = in.nextInt();\n\t\t\n\t\tint[] nums = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnums[i] = in.nextInt();\n\t\t}\n\t\t\n\t\tlong answer = solve(nums, 0, 0);\n\t\tif (nums[0] > 0) {\n\t\t\tanswer = Math.min(solve(nums, nums[0], 1), nums[0] + 1 + solve(nums, -1, 1));\n\t\t} else if (nums[0] < 0) {\n\t\t\tanswer = Math.min(solve(nums, nums[0], 1), Math.abs(nums[0]) + 1 + solve(nums, 1, 1));\n\t\t} else {\n\t\t\tanswer = Math.min(1 + solve(nums, 1, 1), 1 + solve(nums, -1, 1));\n\t\t}\n\t\t\n\t\tSystem.out.println(answer);\n\t\t\n//\t\t\n//\t\tlong sum = 0;\n//\t\tlong answer = 0;\n//\t\t\n//\t\tfor (int i = 0; i < n; i++) {\n//\t\t\tint a = in.nextInt();\n//\t\t\t\n//\t\t\tif (sum < 0 && sum + a < 0) {\n//\t\t\t\tanswer += 1 + Math.abs(sum + a);\n//\t\t\t\tsum = 1;\n//\t\t\t} else if (sum > 0 && sum + a > 0) {\n//\t\t\t\tanswer += 1 + sum + a;\n//\t\t\t\tsum = -1;\n//\t\t\t} else if (sum + a == 0) {\n//\t\t\t\tanswer++;\n//\t\t\t\tif (sum < 0) {\n//\t\t\t\t\tsum = 1;\n//\t\t\t\t} else {\n//\t\t\t\t\tsum = -1;\n//\t\t\t\t}\n//\t\t\t} else { \n//\t\t\t\tsum += a;\n//\t\t\t}\n//\t\t}\n\t\t\n//\t\tSystem.out.println(answer);\n\t}\n\t\n\tpublic static long solve(int[] nums, long sum, int index) {\n\t\tif (index == nums.length) {\n\t\t\treturn 0;\n\t\t}\n\t\tif (sum < 0 && sum + nums[index] < 0) {\n\t\t\treturn 1 + Math.abs(sum + nums[index]) + solve(nums, 1, index + 1);\n\t\t} else if (sum > 0 && sum + nums[index] > 0) {\n\t\t\treturn 1 + sum + nums[index] + solve(nums, -1, index + 1);\n\t\t} else if (sum + nums[index] == 0) {\n\t\t\tif (sum > 0) {\n\t\t\t\treturn 1 + solve(nums, -1, index + 1);\n\t\t\t} else {\n\t\t\t\treturn 1 + solve(nums, 1, index + 1);\n\t\t\t}\n\t\t} else {\n\t\t\treturn solve(nums, sum + nums[index], index + 1);\n\t\t}\n\t\t\n//\t\telse if (sum < 0 && sum + nums[index] > 0) {\n//\t\t\treturn solve(nums, sum + nums[index], index + 1);\n//\t\t} else if (sum > 0 && sum + nums[index] < 0) {\n//\t\t\treturn solve(nums, sum + nums[index], index + 1);\n//\t\t} else {\n//\t\t\t// sum == 0 or sum + nums[index] == 0\n//\t\t\tif (sum == 0) {\n//\t\t\t\treturn 1 + Math.min(solve(nums, 1, index + 1), solve(nums, -1, index + 1));\n//\t\t\t}\n//\t\t\t// sum + nums[index] == 0\n//\t\t\telse {\n//\t\t\t\tif (sum < 0) {\n//\t\t\t\t\treturn Math.abs(sum) + 1 + solve(nums, 1, index + 1);\n//\t\t\t\t} else {\n//\t\t\t\t\treturn Math.abs(sum) + 1 + solve(nums, -1, index + 1);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t} \n//\t\telse if (sum + nums[index] == 0) {\n//\t\t\tif (sum < 0) {\n//\t\t\t\treturn Math.abs(sum) + 1 + solve(nums, 1, index + 1);\n//\t\t\t} else if (sum > 0) {\n//\t\t\t\treturn Math.abs(sum) + 1 + solve(nums, -1, index + 1);\n//\t\t\t} else {\n//\t\t\t\treturn 1 + Math.min(solve(nums, 1, index + 1), solve(nums, -1, index + 1));\n//\t\t\t}\n//\t\t} else if (sum == 0) {\n//\t\t\treturn 1 + Math.min(solve(nums, 1, index + 1), solve(nums, -1, index + 1));\n//\t\t} else {\n//\t\t\treturn solve(nums, sum + nums[index], index + 1);\n//\t\t}\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n vector<long long> a(n);\n for(int i=0;i<n;i++)cin>>a[i];\n \n long long res1=0, res2=0, sum=0;\n \n for(int i=0;i<n;i++){\n sum+=a[i];\n if(i%2==0 && sum>=0){//奇数番目までの和を負に\n res1+= sum+1;\n sum=-1;\n }\n if(i%2==1 && sum<=0){//偶数番目までの和を正に\n res1+= 1-sum;\n sum=1;\n }\n }\n \n sum=0;\n for(int i=0;i<n;i++){\n sum+=a[i];\n if(i%2==0 && sum<=0){//奇数番目までの和を正に\n res2+= 1-sum;\n sum=1;\n }\n if(i%2==1 && sum>=0){//偶数番目までの和を負に\n res2+= sum+1;\n sum=-1;\n }\n }\n \n cout<<min(res1, res2)<<endl;\n return 0;\n}", "#include<bits/stdc++.h>\ntypedef long long ll;\n\nint a[100010],n;\nll s,cnt,ans=1e9;\n\nint main()\n{\n scanf(\"%d\",&n);\n for(int i=1;i<=n;++i)\n\tscanf(\"%d\",&a[i]);\n\n if(a[1]>0)s=a[1];\n else cnt=1-a[1],s=1;\n for(int i=2;i<=n;++i)\n\tif(s*(s+a[i])<0)s+=a[i];\n\telse\n\t{\n\t cnt+=abs(s+a[i])+1;\n\t s=((s<0)<<1)-1;\n\t}\n ans=cnt;\n \n if(a[1]<0)cnt=0,s=a[1];\n else cnt=a[1]+1,s=-1;\n for(int i=2;i<=n;++i)\n\tif(s*(s+a[i])<0)s+=a[i];\n\telse\n\t{\n\t cnt+=abs(s+a[i])+1;\n\t s=((s<0)<<1)-1;\n\t}\n printf(\"%lld\\n\",std::min(ans,cnt));\n \n return 0;\n}\n", "#include <bits/stdc++.h>\n#define REP(i,n,N) for(int i=(n);i<(int)N;i++)\n#define p(s) cout<<(s)<<endl\n#define ck(n,a,b) (a)<=(n)&&(n)<(b)\ntypedef long long ll;\nusing namespace std;\nconst int inf=1e9;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tint a[100010];\n\tREP(i,0,n){\n\t\tcin>>a[i];\n\t}\n\tll ans[2];\n\n\tREP(hugou,0,2){\n\t\tans[hugou]=0;\n\t\tll sum=0;\n\t\tREP(i,0,n){\n\t\t\tsum+=a[i];\n\t\t\tif(i%2==hugou&&sum>=0){\n\t\t\t\tans[hugou]+=sum+1;\n\t\t\t\tsum=-1;\n\t\t\t}else if(i%2!=hugou&&sum<=0){\n\t\t\t\tans[hugou]+=-sum+1;\n\t\t\t\tsum=1;\n\t\t\t}\n\t\t}\n\t}\n\tp(min(ans[0],ans[1]));\n\treturn 0;\n}\n", "import copy\nn=int(input())\nA=list(map(int,input().split()))\ndef solve(a,f):\n # print(f,a)\n ans=0\n for i in range(n):\n if i!=0: a[i]+=a[i-1]\n if not f:\n if a[i]>=0:\n ans+=a[i]+1\n a[i]=-1\n else:\n if a[i]<=0:\n ans+=a[i]*-1+1\n a[i]=1\n # print(a,ans,f)\n f^=True\n return ans\nx=A.copy()\nprint(min(solve(A,True),solve(x,False)))", "import java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n\t\npublic class Main {\n \n static class Graph0n {\n private ArrayList<Node0n> dt = new ArrayList<>();\n Graph0n(int sz){\n\t \t for(int i=0; i<sz; i++){\n\t \t Node0n node1 = new Node0n();\n\t \t dt.add(node1);\n\t \t }\n }\n public void add(int vn, int val){ dt.get(vn).add(val); }\n public int get(int vn, int index){ return dt.get(vn).get(index); }\n public ArrayList<Integer> get(int vn){ return dt.get(vn).getAll(); }\n public int sizeOf(int vn){ return dt.get(vn).size(); }\n public void clear(){ for(int i=0; i<dt.size(); i++){ dt.get(i).clear(); } }\n }\n \n static class Node0n { //重みなし無向・有向グラフの頂点\n private ArrayList<Integer> next_vs = new ArrayList<>();\n \n public void add(int val){ next_vs.add(val); }\n public int get(int ad){ return next_vs.get(ad); }\n public ArrayList<Integer> getAll(){ return next_vs; }\n public int size(){ return next_vs.size(); }\n public void clear(){ next_vs.clear(); }\n }\n\n static class Edge {\n int from=-1, v2=-1; long weight;\n public Edge(int vn, long w){\n this.v2 = vn;\n this.weight = w;\n }\n public Edge(int cm, int vn, long w){\n this.from = cm;\n this.v2 = vn;\n this.weight = w;\n }\n }\n static class Edge2 {\n int v2; long cost1,cost2;\n public Edge2(int vn, long w1, long w2){\n this.v2 = vn;\n this.cost1 = w1;\n this.cost2 = w2;\n }\n }\n\n static class Comparator_Edge implements Comparator<Edge>{\n public int compare(Edge a, Edge b){\n if(a.weight>b.weight) return -1;\n else if(a.weight<b.weight) return 1;\n else return a.v2-b.v2;\n }\n }\n \n static class Vector {\n int x,y;\n public Vector(int sx, int sy){\n this.x=sx;\n this.y=sy;\n }\n }\n \n //私が好きなアルゴリズム：：累積和・UF木\n \n\tpublic static void main(String[] args) throws Exception {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t \n\t int n=sc.nexI();\n\t long[] as = new long[n];\n\t sc.ni(as);\n\t \n\t //+スタート\n\t boolean sum_plus = true;\n\t long sum_former = 0;\n\t long nhandle = 0;\n\t for(int i=0; i<n; i++){\n\t sum_former += as[i];\n\t if(sum_plus){\n\t if(sum_former<=0){\n\t nhandle += (1-sum_former);\n\t sum_former = 1;\n\t }\n\t }else{\n\t if(sum_former>=0){\n\t nhandle += sum_former+1;\n\t sum_former=-1;\n\t }\n\t }\n\t sum_plus = !sum_plus;\n\t }\n\t \n\t long ans =nhandle;\n\t \n\t sum_plus = false;\n\t sum_former = 0;\n\t nhandle = 0;\n\t for(int i=0; i<n; i++){\n\t sum_former += as[i];\n\t if(sum_plus){\n\t if(sum_former<=0){\n\t nhandle += (1-sum_former);\n\t sum_former = 1;\n\t }\n\t }else{\n\t if(sum_former>=0){\n\t nhandle += sum_former+1;\n\t sum_former=-1;\n\t }\n\t }\n\t sum_plus = !sum_plus;\n\t }\n\t \n\t ans = min(ans,nhandle);\n\t out.println(ans);\n\t \n\t\tout.flush();\n\t}\n\t\n\tprivate static boolean triangle_inequality(int a, int b, int c){\n\t if((a+b)<c) return false;\n\t if((b+c)<a) return false;\n\t if((c+a)<b) return false;\n\t return true;\n\t}\n\t\n\tprivate static int INF = (int)1e8;\n\tprivate static long INFL = (long)1e17;\n\tprivate static long e97 = (long)1e9 + 7;\n\t\n\t\n\tprivate static int abs(int a){ return (a>=0) ? a: -a; }\n\tprivate static long abs(long a){ return (a>=0) ? a: -a; }\n\tprivate static double abs(double a){ return (a>=0) ? a: -a; }\n\t\n\tprivate static int min(int a, int b){ return (a>b) ? b : a; }\n\tprivate static long min(long a, long b){ return (a>b) ? b : a; }\n\tprivate static double min(double a, double b){ return (a>b) ? b : a; }\n\t\n\tprivate static int max(int a, int b){ return (a>b) ? a : b; }\n\tprivate static long max(long a, long b){ return (a>b) ? a : b; }\n\tprivate static double max(double a, double b){ return (a>b) ? a : b; }\n\t\n\tprivate static int minN(int... ins){\n\t\tint min = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; }\n\t\treturn min;\n\t}\n\tprivate static int maxN(int... ins){\n\t\tint max = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; }\n\t\treturn max;\n\t}\n\tprivate static long minN(long... ins){\n\t\tlong min = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] < min) min = ins[i]; }\n\t\treturn min;\n\t}\n\tprivate static long maxN(long... ins){\n\t\tlong max = ins[0];\n\t\tfor(int i=1; i<ins.length; i++){ if(ins[i] > max) max = ins[i]; }\n\t\treturn max;\n\t}\n\t\n\tprivate static int minExAd(int[] dt, int ad){\n\t int min=INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static long minExAd(long[] dt, int ad){\n\t long min=INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static int minExVal(int[] dt, int ex_val){\n\t int min=INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static long minExVal(long[] dt, long ex_val){\n\t long min=INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] < min)) min = dt[i]; }\n\t\treturn min;\n\t}\n\tprivate static int maxExAd(int[] dt, int ad){\n\t int max=-INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static long maxExAd(long[] dt, int ad){\n\t long max=-INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((i != ad) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static int maxExVal(int[] dt, int ex_val){\n\t int max=-INF;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\tprivate static long maxExVal(long[] dt, long ex_val){\n\t long max=-INFL;\n\t\tfor(int i=0; i<dt.length; i++){ if((dt[i] != ex_val) && (dt[i] > max)) max = dt[i]; }\n\t\treturn max;\n\t}\n\t\n\tprivate static boolean same3(long a, long b, long c){\n \tif(a!=b) return false;\n \tif(b!=c) return false;\n \tif(c!=a) return false;\n \treturn true;\n\t}\n\tprivate static boolean dif3(long a, long b, long c){\n \tif(a==b) return false;\n \tif(b==c) return false;\n \tif(c==a) return false;\n \treturn true;\n\t}\n\t\n\tprivate static double hypod(double a, double b){\n\t return Math.sqrt(a*a+b*b);\n\t}\n\t\n\tprivate static long factorial(int n) {\n\t\tlong ans=1;\n\t\tfor(long i=n; i>0; i--){ ans*=i; }\n\t\treturn ans;\n\t}\n\t\n\tprivate static long facP(int n, long p) {\n\t\tlong ans=1;\n\t\tfor(long i=n; i>0; i--){\n\t\t ans*=i;\n\t\t ans %= p;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tprivate static long lcm(long m, long n){\n\t long ans = m/gcd(m,n);\n\t ans *= n;\n\t return ans;\n\t}\n\t\n\tprivate static long gcd(long m, long n) {\n\t\tif(m < n) return gcd(n, m);\n\t\tif(n == 0) return m;\n\t\treturn gcd(n, m % n);\n\t}\n\t\n\tprivate static boolean is_prime(long a){\n\t if(a==1) return false;\n\t for(int i=2; i<=Math.sqrt(a); i++){ if(a%i == 0) return false; }\n\t return true;\n\t}\n\t\n private static long modinv(long a, long p) { //a|p, >1に注意\n long b = p, u = 1, v = 0;\n while (b>0) {\n long t = a / b;\n long pe = a%b;\n a=b; b=pe;\n pe= u-t*v;\n u=v; v=pe;\n }\n u %= p; \n if (u < 0) u += p;\n return u;\n }\n \n private static long[] fac10E97 = null;\n private static long[] finv10E97 = null;\n private static void Cinit(int max_sz, long p){\n fac10E97 = new long[max_sz+1];\n finv10E97 = new long[max_sz+1];\n fac10E97[0]=1;\n finv10E97[0]=1;\n for(int i=1; i<=max_sz; i++){\n fac10E97[i] = (fac10E97[i-1]*i) % p;\n }\n finv10E97[max_sz] = modinv(fac10E97[max_sz], p);\n\t\tfor(int i=max_sz; i>1; i--){\n\t\t finv10E97[i-1] = (finv10E97[i]*i) % p;\n\t\t}\n }\n \n private static long C10e97(int n, int k, long p){\n long ans = fac10E97[n];\n ans *= finv10E97[k];\n ans %= p;\n ans *= finv10E97[n-k];\n ans %=p;\n if(ans<0) return ans+p;\n else return ans;\n }\n private static long C10e97LS(long n, int k, long p){\n long ans =1;\n for(long i=n; i>(n-(long)k); i--){\n ans *= i;\n ans %= e97;\n }\n ans *= modinv(facP(k,e97),e97);\n return ans%e97;\n }\n\t\n\tprivate static int pow(int n, int k){\n\t int ans=1;\n\t for(int i=0; i<k; i++) ans *= n;\n\t return ans;\n\t}\n\t\n\tprivate static int pow2(int in){ return in*in; }\n\tprivate static long pow2(long in){ return in*in; }\n\tprivate static double pow2(double in){ return in*in; }\n\t\n\tprivate static int getDigit2(long num){\n\t\tlong cf = 1; int d=0;\n\t\twhile(num >= cf){ d++; cf = 1<<d; }\n\t\treturn d; //numはd桁の数で、2^dより小さい\n\t}\n\t\n\tprivate static int getDigit10(long num){\n\t\tlong cf = 1; int d=0;\n\t\twhile(num >= cf){ d++; cf*=10; }\n\t\treturn d; //numはd桁の数で、10^dより小さい\n\t}\n\t\n\tprivate static boolean isINF(int in){\n \tif(((long)in*20)>INF) return true;\n \telse return false;\n\t}\n\tprivate static boolean isINFL(long in){\n \tif((in*10000)>INFL) return true;\n \telse return false;\n\t}\n\t\n\tprivate static long pow10E97(long ob, long soeji, long p){\n\t if(ob==0) return 0;\n\t if(soeji==0) return 1;\n\t\tif(soeji==2) return (ob*ob)%p;\n\t\t\n\t\tint d = getDigit2(soeji);\n\t\tlong[] ob_pow_2pow = new long[d];\n\t\t\n\t\tob_pow_2pow[0] = ob;\n\t\tfor(int i=1; i<d; i++){ ob_pow_2pow[i] = (ob_pow_2pow[i-1]*ob_pow_2pow[i-1])%p; }\n\t\t\n\t\tlong ans=1;\n\t\tfor(int i=d-1; i>=0; i--){\n\t\t\tif(soeji >= (long)(1<<i)){\n\t\t\t\tsoeji -= (long)(1<<i);\n\t\t\t\tans = (ans*ob_pow_2pow[i])%p;\n\t\t\t}\n \t\t}\n\t\treturn ans;\n\t}\n\t\n\t\n\tprivate static int flag(int pos){ return (1<<pos); }\n\tprivate static boolean isFlaged(int bit, int pos){\n \tif((bit&(1<<pos)) > 0) return true;\n \telse return false;\n\t}\n\tprivate static boolean isFlaged(long bit, int pos){\n \tif((bit&(1<<pos)) > 0) return true;\n \telse return false;\n\t}\n\tprivate static int deflag(int bit, int pos){ return bit&~(1<<pos); }\n\tprivate static int countFlaged(int bit){\n\t int ans=0; \n\t for(int i=0; i<getDigit2(bit); i++){\n\t if((bit&(1<<i)) > 0) ans++;\n\t }\n\t return ans;\n\t}\n\t\n\tprivate static void showflag(int bit){\n \tfor(int i=0; i<getDigit2(bit); i++){\n \tif(isFlaged(bit,i)) System.out.print(\"O\");\n \telse System.out.print(\".\");\n \t}\n \tSystem.out.println();\n\t}\n\t\n\tpublic static int biSearch(int[] dt, int target){\n\t\tint left=0, right=dt.length-1;\n\t\tint mid=-1;\n\t\twhile(left<=right){\n\t\t\tmid = (right+left)/2;\n\t\t\tif(dt[mid] == target) return mid;\n\t\t\tif(dt[mid] < target) left=mid+1;\n\t\t\telse right=mid-1;\n\t\t}\n\t\treturn -1;\n\t}\n\tpublic static int biSearchMax(long[] dt, long target){\n\t\tint left=-1, right=dt.length;\n\t\tint mid=-1;\n\t\t\n\t\twhile((right-left)>1){\n\t\t\tmid = left + (right-left)/2;\n\t\t\tif(dt[mid] <= target) left=mid;\n\t\t\telse right=mid;\n\t\t}\n\t\treturn left;//target以下の最大のaddress\n\t}\n\tpublic static int biSearchMaxAL(ArrayList<Integer> dt, long target){\n\t\tint left=-1, right=dt.size();\n\t\tint mid=-1;\n\t\t\n\t\twhile((right-left)>1){\n\t\t\tmid = left + (right-left)/2;\n\t\t\tif(dt.get(mid) <= target) left=mid;\n\t\t\telse right=mid;\n\t\t}\n\t\treturn left;//target以下の最大のaddress\n\t}\n\t\n private static int get_root_uf(int[] parent, int index){\n if(parent[index] == index) return index;\n int root = get_root_uf(parent, parent[index]);\n parent[index] = root;\n return root;\n }\n \n private static boolean is_same_uf(int[] parent, int x, int y){\n if(get_root_uf(parent,x) == get_root_uf(parent,y)) return true;\n else return false;\n }\n \n private static void unite_uf(int[] parent, int receiver, int attacker){\n parent[get_root_uf(parent,attacker)] = get_root_uf(parent, receiver);\n }\n\t\n private static int[] Xdir4 = {1,0,0,-1};\n private static int[] Ydir4 = {0,1,-1,0};\n\t \n\tprivate\tstatic int[] Xdir8 = {1,1,1,0,0,-1,-1,-1};\n\tprivate\tstatic int[] Ydir8 = {1,0,-1,1,-1,1,0,-1};\n\t\n\tprivate static boolean is_in_area(int y, int x, int h, int w){\n\t if(y<0) return false;\n\t if(x<0) return false;\n\t if(y>=h) return false;\n\t if(x>=w) return false;\n\t return true;\n\t}\n\t\n\t\n\tstatic void show2(boolean[][] dt, int lit_x, int lit_y){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int j=0; j<dt.length; j++){\n\t\t for(int i=0; i<dt[j].length; i++){\n\t\t\t\tif((i==lit_y) && (j==lit_x)) out.print(\"X\");\n\t\t\t\telse if(dt[j][i]) out.print(\"O\");\n\t\t\t\telse out.print(\".\");\n\t\t\t}\n\t\t\tout.println();\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void show2(int[][] dt, String cmnt){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int i=0; i<dt.length; i++){\n\t\t\tfor(int j=0; j<dt[i].length; j++){\n\t\t\t\tout.print(dt[i][j]+\",\");\n\t\t\t}\n\t\t\tout.println(\"<-\"+cmnt+\":\"+i);\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void show2(long[][] dt, String cmnt){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tfor(int i=0; i<dt.length; i++){\n\t\t\tfor(int j=0; j<dt[i].length; j++){\n\t\t\t\tout.print(dt[i][j]+\",\");\n\t\t\t}\n\t\t\tout.println(\"<-\"+cmnt+\":\"+i);\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic void disp_que(ArrayDeque<Long> dt){\t\t//上手くいかなかった時用\n\t\tlong a=0;\n\t\twhile(dt.size()>0){\n\t\t\ta=dt.removeFirst();\n\t\t\tSystem.out.print(a);\n\t\t}\n\t\tSystem.out.println(\"\\n\");\n\t}\n\tstatic void disp_list(List dt){\t\t//上手くいかなかった時用\n\t \tfor(int i=0; i<dt.size(); i++){\n\t\t\tSystem.out.print(dt.get(i)+\",\");\n\t\t}\n\t\tSystem.out.println(\"\\n\");\n\t}\n\t\n\t\n\tprivate static void prtlnas(int[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t for(int i=0; i<as.length; i++){\n\t out.println(as[i]);\n\t }\n\t out.flush();\n\t}\n\tprivate static void prtlnas(long[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t for(int i=0; i<as.length; i++){\n\t out.println(as[i]);\n\t }\n\t out.flush();\n\t}\n\tprivate static void prtspas(int[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tout.print(as[0]);\n\t for(int i=1; i<as.length; i++){\n\t out.print(\" \"+as[i]);\n\t }\n\t out.flush();\n\t}\n\tprivate static void prtspas(long[] as){\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tout.print(as[0]);\n\t for(int i=1; i<as.length; i++){\n\t out.print(\" \"+as[i]);\n\t }\n\t out.flush();\n\t}\n\t\n\t\n private static void fill(boolean[] ob, boolean res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n private static void fill(int[] ob, int res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(long[] ob, long res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(char[] ob, char res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(double[] ob, double res){ for(int i=0; i<ob.length; i++){ ob[i] = res; }}\n\tprivate static void fill(boolean[][] ob,boolean res){for(int i=0;i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(int[][] ob, int res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(long[][] ob, long res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(char[][] ob, char res){ for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(double[][] ob, double res){for(int i=0; i<ob.length; i++){ for(int j=0; j<ob[0].length; j++){ ob[i][j] = res; }}}\n\tprivate static void fill(int[][][] ob,int res){for(int i=0;i<ob.length;i++){for(int j=0;j<ob[0].length;j++){for(int k=0;k<ob[0][0].length;k++){ob[i][j][k]=res;}}}}\n\t\n\tprivate static void fill_parent(int[] ob){\n\t for(int i=0; i<ob.length; i++) ob[i]=i;\n\t}\n\t\n \n static class FastScanner {\n \tprivate final InputStream in = System.in;\n \tprivate final byte[] buffer = new byte[1024];\n \tprivate int ptr = 0;\n \tprivate int buflen = 0;\n \tprivate boolean hasNextByte() {\n \t\tif (ptr < buflen) {\n \t\t\treturn true;\n \t\t}else{\n \t\t\tptr = 0;\n \t\t\ttry {\n \t\t\t\tbuflen = in.read(buffer);\n \t\t\t} catch (IOException e) {\n \t\t\t\te.printStackTrace();\n \t\t\t}\n \t\t\tif (buflen <= 0) {\n \t\t\t\treturn false;\n \t\t\t}\n \t\t}\n \t\treturn true;\n \t}\n \t\n \tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n \tprivate static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n \tpublic boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n \tpublic String next() {\n \t\tif (!hasNext()) throw new NoSuchElementException();\n \t\tStringBuilder sb = new StringBuilder();\n \t\tint b = readByte();\n \t\twhile(isPrintableChar(b)) {\n \t\t\tsb.appendCodePoint(b);\n \t\t\tb = readByte();\n \t\t}\n \t\treturn sb.toString();\n \t}\n \tpublic long nexL() {\n \t\tif (!hasNext()) throw new NoSuchElementException();\n \t\tlong n = 0;\n \t\tboolean minus = false;\n \t\tint b = readByte();\n \t\tif (b == '-') {\n \t\t\tminus = true;\n \t\t\tb = readByte();\n \t\t}\n \t\tif (b < '0' || '9' < b) {\n \t\t\tthrow new NumberFormatException();\n \t\t}\n \t\twhile(true){\n \t\t\tif ('0' <= b && b <= '9') {\n \t\t\t\tn *= 10;\n \t\t\t\tn += b - '0';\n \t\t\t}else if(b == -1 || !isPrintableChar(b) || b == ':'){\n \t\t\t\treturn minus ? -n : n;\n \t\t\t}else{\n \t\t\t\tthrow new NumberFormatException();\n \t\t\t}\n \t\t\tb = readByte();\n \t\t}\n \t}\n \tpublic int nexI() {\n \t\tlong nl = nexL();\n \t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n \t\treturn (int) nl;\n \t}\n \tpublic double nexD() { return Double.parseDouble(next());}\n \t\n \tpublic void ni(long[] array2){\n \t \tfor(int i=0; i<array2.length; i++){\n \t \t array2[i] = nexL();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ni(int[] array2){\n \t \tfor(int i=0; i<array2.length; i++){\n \t \t array2[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ni(int[] as, int[] bs){\n \t \tfor(int i=0; i<as.length; i++){\n \t \t as[i] = nexI();\n \t \t bs[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n \tpublic void ni(int[] as, int[] bs, int[] cs){\n \t \tfor(int i=0; i<as.length; i++){\n \t \t as[i] = nexI();\n \t \t bs[i] = nexI();\n \t \t cs[i] = nexI();\n \t \t}\n \t \treturn;\n \t}\n }\n}\n", "def z(s,l):\n\tfor i in range(n-1):\n\t\tr=l+a[i+1]\n\t\tif r*l>=0:\n\t\t\tif l<=0:\n\t\t\t\ts+=1-r\n\t\t\t\tr=1\n\t\t\telse:\n\t\t\t\ts+=1+r\n\t\t\t\tr=-1\n\t\tl=r\n\treturn s\nn=int(input())\na=list(map(int,input().split()))\ns1=0\nl1=a[0]\nif a[0]<=0:\n\ts1=1-a[0]\n\tl1=1\ns2=0\nl2=a[0]\nif a[0]>=0:\n\ts2=a[0]+1\n\tl2=-1\nprint(min(z(s1,l1),z(s2,l2)))", "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main(void) {\n\tint num, i = 0, a;\n\tlong long sumT = 0, sumF = 0, ansT = 0, ansF = 0;\n\tbool sig = true;\n\tcin >> num;\n\tfor (; i < num; i++) {\n\t\tscanf(\"%d\", &a);\n\t\tsumT += a;\n\t\tsumF += a;\n\t\tif (sig && sumT >= 0) {\n\t\t\tansT += sumT + 1;\n\t\t\tsumT = -1;\n\t\t}\n\t\telse if (!sig && sumT <= 0) {\n\t\t\tansT += 1 - sumT;\n\t\t\tsumT = 1;\n\t\t}\n\t\tif (!sig && sumF >= 0) {\n\t\t\tansF += sumF + 1;\n\t\t\tsumF = -1;\n\t\t}\n\t\telse if (sig && sumF <= 0) {\n\t\t\tansF += 1 - sumF;\n\t\t\tsumF = 1;\n\t\t}\n\t\tsig = !sig;\n\t}\n\tcout << min(ansT, ansF) << \"\\n\";\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <map>\n#include <set>\n\nusing namespace std;\n\n#define lli long long int\n#define REP(i,n) for(int i=0;i<n;i++)\n#define DEBUG 1\n\nlli n,a[100100];\n\nlli calc(lli s){\n\tlli sum=0,res = 0;\n\tfor(lli i=0;i<n;i++,s *= -1){\n\t\tsum += a[i];\n\t\tif(sum * s > 0)continue;\n\t\tres += abs(sum-s);\n\t\tsum += s*abs(sum-s);\n\t}\n\treturn res;\n}\n\n\nint main(){\n\tcin>>n;\n\tREP(i,n)cin>>a[i];\n\tcout<<min(calc(1),calc(-1))<<endl;\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n int n;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; ++i) {\n cin >> a[i];\n }\n\n int64_t min_ans = INT64_MAX;\n for (int s = -1; s < 2; s += 2) {\n int64_t ans = 0LLU;\n int64_t sum = 0LLU;\n int sign;\n for (int i = 0, sign = s; i < n; ++i, sign *= -1) {\n sum += a[i];\n // cout << i << \"| sign: \" << sign << \" sum: \" << sum << \"\\n\";\n if (sum * sign <= 0) {\n ans += abs(sign - sum);\n sum = sign;\n }\n }\n min_ans = min(min_ans, ans);\n }\n cout << min_ans << \"\\n\";\n}\n", "n = int(input())\na = list(map(int, input().split()))\n\ndef chk(a,first):\n count = 0\n x = 0 # sum\n t = first # True : plus, False : minus\n for item in a:\n x += item\n if t == True and x<1:\n count += 1-x\n x = 1\n elif t == False and x>-1:\n count += x+1\n x = -1\n t = not t\n return count\n\nprint(min(chk(a,True),chk(a,False)))", "#include<bits/stdc++.h>\nusing namespace std;\n#define all(a) (a).begin(),(a).end()\ntypedef long long ll;\nll mod=1000000007;\n\nint main() {\n int n;cin >>n;\n ll cnt_a=0;\n ll cnt_b=0;\n ll sum_a =0;\n ll sum_b =0;\n ll sign_a = 1;\n ll sign_b = -1;\n for(int i=0;i<n;++i){\n ll t;cin >> t;\n sum_a +=t;\n sum_b +=t;\n if (sum_a * sign_a <= 0){\n cnt_a += abs(sum_a) + 1;\n sum_a = sign_a;\n }\n if (sum_b * sign_b <= 0){\n cnt_b += abs(sum_b) + 1;\n sum_b = sign_b;\n }\n sign_a *=-1;\n sign_b *=-1;\n }\n cout << min(cnt_a,cnt_b) << endl;\n return 0;\n}\n", "n = int(input())\nA = map(int, input().split())\nsum_b = 0\ncnt_b = 0\nsum_c = 0\ncnt_c = 0\nfor i,a in enumerate(A):\n sum_b += a\n if not sum_b or ((sum_b > 0) != ((i % 2) > 0)):\n cnt_b += abs(sum_b) + 1\n sum_b = 1 if ((i % 2) > 0) else -1\n sum_c += a\n if not sum_c or ((sum_c > 0) == ((i % 2) > 0)):\n cnt_c += abs(sum_c) + 1\n sum_c = -1 if ((i % 2) > 0) else 1\nprint(min(cnt_b, cnt_c))\n", "N = int(input())\nA = list(map(int, input().split()))\n\ndef sol(S):\n ret = 0\n for a in A[1:]:\n b = a\n if S * (S + b) > 0:\n b = (abs(S) + 1) * (1 if S < 0 else -1)\n if S + b == 0:\n b = b - 1 if S > 0 else b + 1\n ret += abs(b - a)\n S += b\n return ret\n\nif A[0] == 0:\n ans = min(sol(1), sol(-1)) + 1\nelse:\n ans = min(sol(A[0]), sol(-A[0] // abs(A[0])) + abs(A[0]) + 1)\nprint(ans)\n", "import java.util.*;\nclass Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor(int i=0;i<n;i++) a[i] = sc.nextInt();\n\t\tsc.close();\n\t\tlong ans = Long.MAX_VALUE / 2;\n\t\t// + - + - + - \n\t\tlong res = 0;\n\t\tlong t = 0;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tt += a[i];\n\t\t\tif(i % 2 == 0) {\n\t\t\t\tif(t > 0) continue;\n\t\t\t\tres += 1 - t;\n\t\t\t\tt = 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif(t < 0) continue;\n\t\t\t\tres += t + 1;\n\t\t\t\tt = -1;\n\t\t\t}\n\t\t}\n\t\tans = Math.min(ans, res);\n\t\tres = 0;\n\t\tt = 0;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tt += a[i];\n\t\t\tif(i % 2 == 1) {\n\t\t\t\tif(t > 0) continue;\n\t\t\t\tres += 1 - t;\n\t\t\t\tt = 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif(t < 0) continue;\n\t\t\t\tres += t + 1;\n\t\t\t\tt = -1;\n\t\t\t}\n\t\t}\t\t\n\t\tans = Math.min(ans, res);\n\t\tSystem.out.println(ans);\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nlong long int a[100005]={0};\n\nlong long int solve(long long int n, long long int sum){\n long long int ans = 0;\n for(int i=1;i<n;++i){\n long long int s = sum + a[i];\n if((s^sum) >= 0 || s == 0){\n ans += abs(s) + 1;\n s = (sum < 0 ? 1 : -1);\n }\n sum = s;\n }\n return ans;\n}\n\nint main(){\n int n;\n cin >> n;\n for(int i=0;i<n;++i)cin >> a[i];\n long long int ans = solve(n, 1) + abs(1-a[0]);\n ans = min(solve(n, -1) + abs(-1-a[0]), ans);\n if(a[0] != 0)ans = min(solve(n, a[0]), ans);\n\n cout << ans << endl;\n\n return 0;\n}\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <functional>\nusing namespace std;\nusing Int = long long;\n#define REP(i, n) for (int i = 0; i < n; i++)\nint main()\n{\n int n; cin >> n;\n Int c1 = 0, c2 = 0, s1 = 0, s2 = 0;\n REP(i, n) {\n int a; cin >> a;\n s1 += a;\n s2 += a;\n if (i % 2 == 0) {\n if (s1 <= 0) c1 += 1 - s1, s1 = 1;\n if (s2 >= 0) c2 += s2 - (-1), s2 = -1;\n } else {\n if (s1 >= 0) c1 += s1 - (-1), s1 = -1;\n if (s2 <= 0) c2 += 1 - s2, s2 = 1;\n }\n }\n cout << min(c1, c2) << endl;\n return 0;\n}", "#include <iostream>\n#include <string>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nll s1, s2, c1, c2;\nint main() {\n\tll n, a[100010];\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)cin >> a[i];\n\tfor (int i = 1; i <= n; i++) {\n\t\ts1 += a[i];\n\t\ts2 += a[i];\n\t\tif (i % 2) {\n\t\t\tif (s1 <= 0) {\n\t\t\t\tc1 += 1 - s1;\n\t\t\t\ts1 = 1;\n\t\t\t}\n\t\t\tif (s2 >= 0) {\n\t\t\t\tc2 += 1 + s2;\n\t\t\t\ts2 = -1;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif (s1 >= 0) {\n\t\t\t\tc1 += 1 + s1;\n\t\t\t\ts1 = -1;\n\t\t\t}\n\t\t\tif (s2 <= 0) {\n\t\t\t\tc2 += 1 - s2;\n\t\t\t\ts2 = 1;\n\t\t\t}\n\t\t}\n\t}\n\tcout << min(c1, c2) << endl;\n\treturn 0;\n}", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.net.ConnectException;\nimport java.rmi.dgc.Lease;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.NoSuchElementException;\nimport java.util.Objects;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\nimport java.util.function.Function;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t\tmain.out.close();\n\t}\n\n\t// ======================================================================\n\tlong[] R;\n\tint N;\n\tlong calc(boolean f) {\n\t\tlong ans = 0, sv = 0, wk;\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\twk = R[i] + sv;\n\t\t\tif(f && wk <= 0) {\n\t\t\t\tans += (1 - wk);\n\t\t\t\tsv += (1 - wk);\n\t\t\t} else if(!f && wk >= 0) {\n\t\t\t\tans += (1 + wk);\n\t\t\t\tsv -= (1 + wk);\n\t\t\t}\n\t\t\tf = !f;\n\t\t}\n\t\treturn ans;\n\t}\n\tpublic void solve() {\n\t\tN = ni();\n\t\tR = new long[N+1];\n\t\tlong a;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\ta = nl();\n\t\t\tR[i+1] = R[i] + a;\n\t\t}\n\t\tlong ans1 = calc(true);\n\t\tlong ans2 = calc(false);\n\t\tout.println(Math.min(ans1, ans2));\n\t}\n\n\t// ------------------------------------------\n\t// ライブラリ\n\t// ------------------------------------------\n\t// Print\n\tprivate PrintWriter out = new PrintWriter(System.out);\n\n\t// Scanner\n\tprivate FastScanner scan = new FastScanner();\n\n\tint ni() {\n\t\treturn scan.nextInt();\n\t}\n\n\tint[] ni(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = ni();\n\t\t}\n\t\treturn a;\n\t}\n\n\tint[][] ni(int y, int x) {\n\t\tint[][] a = new int[y][x];\n\t\tfor (int i = 0; i < y; i++) {\n\t\t\tfor (int j = 0; j < x; j++) {\n\t\t\t\ta[i][j] = ni();\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n\n\tlong nl() {\n\t\treturn scan.nextLong();\n\t}\n\n\tlong[] nl(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = nl();\n\t\t}\n\t\treturn a;\n\t}\n\n\tlong[][] nl(int y, int x) {\n\t\tlong[][] a = new long[y][x];\n\t\tfor (int i = 0; i < y; i++) {\n\t\t\tfor (int j = 0; j < x; j++) {\n\t\t\t\ta[i][j] = nl();\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n\n\tString ns() {\n\t\treturn scan.next();\n\t}\n\n\tString[] ns(int n) {\n\t\tString[] a = new String[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = ns();\n\t\t}\n\t\treturn a;\n\t}\n\n\tString[][] ns(int y, int x) {\n\t\tString[][] a = new String[y][x];\n\t\tfor (int i = 0; i < y; i++) {\n\t\t\tfor (int j = 0; j < x; j++) {\n\t\t\t\ta[i][j] = ns();\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n long temp = Long.parseLong(sc.next());\n a[i] = temp;\n }\n long ans1 = 0;\n long ans2 = 0;\n long temp = 0;\n for (int i = 0; i < n; i++) {\n long num = a[i];\n if (i % 2 == 0 && temp + num >= 0) {\n ans1 += temp + num + 1;\n num -= temp + num + 1;\n }\n if (i % 2 != 0 && temp + num <= 0) {\n ans1 += Math.abs(temp + num - 1);\n num += Math.abs(temp + num - 1);\n }\n temp += num;\n }\n temp = 0;\n for (int i = 0; i < n; i++) {\n long num = a[i];\n if (i % 2 == 0 && temp + num <= 0) {\n ans2 += Math.abs(temp + num - 1);\n num += Math.abs(temp + num - 1);\n }\n if (i % 2 != 0 && temp + num >= 0) {\n ans2 += temp + num + 1;\n num -= temp + num + 1;\n }\n temp += num;\n }\n System.out.println(Math.min(ans1, ans2));\n }\n}", "from itertools import accumulate\nn, *A = map(int, open(0).read().split())\nB = list(accumulate(A))\np0 = n0 = p1 = n1 = 0\nfor i, b in enumerate(B):\n if i % 2 == 0:\n if b+p0-n0 <= 0:\n p0 += abs(b+p0-n0)+1\n if b+p1-n1 >= 0:\n n1 += abs(b+p1-n1)+1\n else:\n if b+p0-n0 >= 0:\n n0 += abs(b+p0-n0)+1\n if b+p1-n1 <= 0:\n p1 += abs(b+p1-n1)+1\nprint(min(p0+n0, p1+n1))\n", "#include<iostream>\nusing namespace std;\n\ntypedef long long ll;\n\nint n;\nll a[100000] = {};\n\nll solve(bool judge){\n ll sum = 0, score = 0;\n for(int i = 0; i < n; i++){\n sum += a[i];\n if(judge){\n if(sum <= 0){\n score += 1-sum;\n sum = 1;\n }\n }else{\n if(sum >= 0){\n score += sum+1;\n sum = -1;\n }\n }\n judge = !judge;\n }\n return score;\n}\n\nint main(){\n cin >> n;\n\n for(int i = 0; i < n; i++) cin >> a[i];\n\n ll first = solve(true);\n ll second = solve(false);\n\n cout << min(first, second) << endl;\n\n return 0;\n}", "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\tprivate static final int MOD = (int)Math.pow(10, 9);\n\tpublic static void main(String[] args) {\n\t\tFastReader sc = new FastReader();\n\t\tint n = sc.nextInt();\n\t\tint[] nums = new int[n];\n\t\t\n\t\tfor (int i = 0; i < nums.length; i++) {\n\t\t\tnums[i] = sc.nextInt();\n\t\t}\n\t\tlong firstDigitPostive = 0;\n\n\t\tlong prefixSum = 0;\n\t\tfor (int i = 0; i < nums.length; i++) {\n\t\t\tprefixSum += nums[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\t// odd is postive\n\t\t\t\tif (prefixSum == 0) {\n\t\t\t\t\tprefixSum++;\n\t\t\t\t\tfirstDigitPostive++;\n\t\t\t\t} else if (prefixSum < 0) {\n\t\t\t\t\tfirstDigitPostive += (1 - prefixSum);\n\t\t\t\t\tprefixSum += 1 - prefixSum;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// even is negative\n\t\t\t\tif (prefixSum == 0) {\n\t\t\t\t\tprefixSum--;\n\t\t\t\t\tfirstDigitPostive++;\n\t\t\t\t} else if (prefixSum > 0) {\n\t\t\t\t\tfirstDigitPostive += (1 + prefixSum);\n\t\t\t\t\tprefixSum -= (prefixSum + 1) ;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tprefixSum = 0;\n\t\tlong firstDigitNegative = 0;\n\t\tfor (int i = 0; i < nums.length; i++) {\n\t\t\tprefixSum += nums[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\t// odd is negative\n\t\t\t\tif (prefixSum == 0) {\n\t\t\t\t\tprefixSum--;\n\t\t\t\t\tfirstDigitNegative++;\n\t\t\t\t} else if (prefixSum > 0) {\n\t\t\t\t\tfirstDigitNegative += (1 + prefixSum);\n\t\t\t\t\tprefixSum -= (prefixSum + 1) ;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// even is postive\n\t\t\t\tif (prefixSum == 0) {\n\t\t\t\t\tprefixSum++;\n\t\t\t\t\tfirstDigitNegative++;\n\t\t\t\t} else if (prefixSum < 0) {\n\t\t\t\t\tfirstDigitNegative += (1 - prefixSum);\n\t\t\t\t\tprefixSum += 1 - prefixSum;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(Math.min(firstDigitPostive, firstDigitNegative));\n\t}\n\n static class FastReader {\n\t BufferedReader br;\n\t StringTokenizer st;\n\t\n\t public FastReader() {\n\t br = new BufferedReader(new InputStreamReader(System.in));\n\t }\n\t \n\t String next() { \n\t while (st == null || !st.hasMoreElements()) {\n\t try {\n\t st = new StringTokenizer(br.readLine());\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t }\n\t return st.nextToken();\n\t }\n\t\n\t int nextInt() {\n\t return Integer.parseInt(next());\n\t }\n\t\n\t long nextLong() {\n\t return Long.parseLong(next());\n\t }\n\t\n\t double nextDouble() { \n\t return Double.parseDouble(next());\n\t }\n\t\n\t String nextLine() {\n\t String str = \"\";\n\t try{\n\t str = br.readLine();\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t return str;\n\t }\n\t }\n}\n", "#include <iostream>\nusing namespace std;\nusing ll = long long;\nll n, a, c[2], s[2];\nint main() {\n cin >> n;\n for (int i = 0; i != n; ++i) {\n cin >> a;\n for (int j : {0, 1}) {\n s[j] += a;\n auto p = 1 - (i + j) % 2 * 2;\n if (s[j] * p <= 0) {\n c[j] += abs(p - s[j]);\n s[j] = p;\n }\n }\n }\n cout << min(c[0], c[1]) << endl;\n}\n", "\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main implements Runnable { // クラス名はMain1\n\n\tPrintWriter out = new PrintWriter(System.out);\n\tInputReader sc = new InputReader(System.in);\n\n\tpublic static void main(String[] args) {\n\t\tThread.setDefaultUncaughtExceptionHandler((t, e) -> System.exit(1));\n\t\tnew Thread(null, new Main(), \"\", 1024 * 1024 * 1024).start(); // 16MBスタックを確保して実行\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tint N = sc.nextInt();\n\t\t\tlong[] A = new long[N];\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tA[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tlong[] wa = new long[N + 1];\n\t\t\tlong[] wa2 = new long[N + 1];\n\t\t\tfor (int i = 1; i <= N; i++) {\n\t\t\t\twa[i] += wa[i - 1] + A[i - 1];\n\t\t\t\twa2[i] += wa2[i - 1] + A[i - 1];\n\t\t\t}\n\t\t\t//out.println(\"A:\" + Arrays.toString(A));\n\t\t\t//out.println(\"W:\" + Arrays.toString(wa));\n\n\t\t\tboolean plus = wa[1] >= 0 ? true : false;\n\t\t\tlong cntp = 0;\n\t\t\tlong cntm = 0;\n\n\t\t\tfor (int i = 1; i <= N; i++) {\n\t\t\t\twa[i] += cntp - cntm;\n\t\t\t\tif (!plus && wa[i] >= 0) {\n\t\t\t\t\tlong p = Math.abs(wa[i]) + 1;\n\t\t\t\t\tcntm += p;\n\t\t\t\t\twa[i] -= p;\n\t\t\t\t\tA[i - 1] -= p;\n\t\t\t\t} else if (plus && wa[i] <= 0) {\n\t\t\t\t\tlong m = Math.abs(wa[i]) + 1;\n\t\t\t\t\tcntp += m;\n\t\t\t\t\twa[i] += m;\n\t\t\t\t\tA[i - 1] += m;\n\t\t\t\t}\n\t\t\t\tplus = !plus;\n\t\t\t}\n\n\t\t\tlong ans = cntp + cntm;\n\t\t\t//out.println(\"W:\" + Arrays.toString(wa));\n\n\t\t\tfor (int i = 1; i <= N; i++) {\n\t\t\t\twa[i] = wa2[i];\n\t\t\t}\n\n\t\t\tplus = wa[1] >= 0 ? false : true;\n\t\t\tcntp = 0;\n\t\t\tcntm = 0;\n\n\t\t\tfor (int i = 1; i <= N; i++) {\n\t\t\t\twa[i] += cntp - cntm;\n\t\t\t\tif (!plus && wa[i] >= 0) {\n\t\t\t\t\tlong p = Math.abs(wa[i]) + 1;\n\t\t\t\t\tcntm += p;\n\t\t\t\t\twa[i] -= p;\n\t\t\t\t} else if (plus && wa[i] <= 0) {\n\t\t\t\t\tlong m = Math.abs(wa[i]) + 1;\n\t\t\t\t\tcntp += m;\n\t\t\t\t\twa[i] += m;\n\t\t\t\t}\n\t\t\t\tplus = !plus;\n\t\t\t}\n\n\t\t\tans = Math.min(ans, cntp + cntm);\n\n\t\t\t//out.println(\"A:\" + Arrays.toString(A));\n\t\t\t//out.println(\"WM:\" + Arrays.toString(wa2));\n\n\t\t\tout.println(ans);\n\n\t\t} catch (ArithmeticException ae) {\n\t\t\t//ae.printStackTrace();\n\t\t\tthrow new RuntimeException();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tthrow new RuntimeException();\n\t\t} finally {\n\t\t\tout.flush();\n\t\t\tout.close();\n\t\t}\n\n\t}\n\n\t// 高速なScanner\n\tstatic class InputReader {\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n\nusing namespace std;\ntypedef long long LL;\nconst LL INF=1e15;\n\nint main(){\n\tint n;\n\tcin >> n;\n\tvector<LL> a(n);\n\trep(i,n) cin >> a[i];\n\tLL sum=0, sign=1;\n\tLL res1=0, res2=0;\n\trep(i,n){\n\t\tsum+=a[i];\n\t\tif(sum*sign<=0){\n\t\t\tres1+=abs(sum)+1;\n\t\t\tsum=sign;\n\t\t}\n\t\tsign*=-1;\n\t}\n\tsum=0, sign=-1;\n\trep(i,n){\n\t\tsum+=a[i];\n\t\tif(sum*sign<=0){\n\t\t\tres2+=abs(sum)+1;\n\t\t\tsum=sign;\n\t\t}\n\t\tsign*=-1;\n\t}\n\tcout << min(res1,res2) << endl;\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n long long n, sum1 = 0, sum2 = 0, b = 0, c = 0, a;\n cin >> n;\n for (int i = 0; i < n; i++) {\n cin >> a;\n if (i%2) {\n if (sum1+a < 0) {\n sum1 += a;\n } else {\n b += 1+(sum1+a);\n sum1 = -1;\n }\n if (sum2+a > 0) {\n sum2 += a;\n } else {\n c += 1-(sum2+a);\n sum2 = 1;\n }\n } else {\n if (sum1+a > 0) {\n sum1 += a;\n } else {\n b += 1-(sum1+a);\n sum1 = 1;\n }\n if (sum2+a < 0) {\n sum2 += a;\n } else {\n c += 1+(sum2+a);\n sum2 = -1;\n }\n }\n }\n cout << min(b,c);\n}", "// C - Sequence\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n\tint N; cin>>N;\n\tvector<ll> A(N);\n\tfor(int i=0; i<N; ++i) cin>>A[i];\n\n\tvector<ll> C(2);\n\tfor(int c=0; c<2; ++c){\n\t\tint sign = c?1:-1;\n\t\tfor(ll s=0, a=0; a<N; ++a, sign*=-1){\n\t\t\ts += A[a];\n\t\t\tif(sign*s<=0){ C[c]+=abs(s)+1; s=sign; }\n\t\t}\n\t}\n\tcout<< (C[0]<C[1]?C[0]:C[1]) <<endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t\tsc.close();\n\n\t\tlong ans1 = 0;\n\t\tlong sum = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tsum += a[i];\n\t\t\tif (i % 2 == 1) {\n\t\t\t\tif (sum <= 0) {\n\t\t\t\t\tans1 += 1 - sum;\n\t\t\t\t\tsum = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sum >= 0) {\n\t\t\t\t\tans1 += 1 + sum;\n\t\t\t\t\tsum = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlong ans2 = 0;\n\t\tsum = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tsum += a[i];\n\t\t\tif (i % 2 == 1) {\n\t\t\t\tif (sum >= 0) {\n\t\t\t\t\tans2 += 1 + sum;\n\t\t\t\t\tsum = -1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sum <= 0) {\n\t\t\t\t\tans2 += 1 - sum;\n\t\t\t\t\tsum = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long N;cin>>N;\n vector<long>A(N),SP(N),SN(N);\n long ansp=0,ansn=0;\n for(int i=0;i<N;i++)cin>>A[i];\n for(int i=0;i<N;i++){\n SP[i]=(i==0?0:SP[i-1])+A[i];\n if(i%2==0&&SP[i]<=0){ansp+=1-SP[i];SP[i]=1;}\n if(i%2==1&&SP[i]>=0){ansp+=SP[i]+1;SP[i]=-1;}\n }\n \n for(int i=0;i<N;i++){\n SN[i]=(i==0?0:SN[i-1])+A[i];\n if(i%2==0&&SN[i]>=0){ansn+=SN[i]+1;SN[i]=-1;}\n if(i%2==1&&SN[i]<=0){ansn+=1-SN[i];SN[i]=1;}\n }\n cout<<min(ansp,ansn);\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long N,sum,ans,ans2;\n cin>>N;\n sum=0;\n ans=0;\n ans2=0;\n vector<long long>x(N);\n for(int i=0;i<N;i++){\n cin>>x[i];\n }\n for(int i=0;i<N;i++){\n sum+=x[i];\n if(i%2==0&&sum<=0){\n ans+=1-sum;\n sum=1;\n }\n if(i%2==1&&sum>=0){\n ans+=1+sum;\n sum=-1;\n }\n ans2=ans;\n }\n ans=0;\n sum=0;\n for(int i=0;i<N;i++){\n sum+=x[i];\n if(i%2==1&&sum<=0){\n ans+=1-sum;\n sum=1;\n }\n if(i%2==0&&sum>=0){\n ans+=1+sum;\n sum=-1;\n }\n }\n \n cout<<min(ans,ans2)<<endl;\n}\n", "n = int(input())\na = list(map(int, input().split()))\n\n\ndef f(p):\n sa = 0\n ans = 0\n for ai in a:\n if p:\n sa += ai\n if sa >= 0:\n ans += sa + 1\n sa = -1\n p = False\n else:\n sa += ai\n if 0 >= sa:\n ans += 1 - sa\n sa = 1\n p = True\n return ans\n\n\ndef main():\n print(min(f(True), f(False)))\n\n\nmain()\n", "#include<iostream>\n#include<stdlib.h>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tlong sum;\n\tlong input;\n\tcin>>sum;\n\tlong ans1,ans2,sum1,sum2;\n\tif(sum>0){\n\t\tsum1=sum;\n\t\tsum2=-1;\n\t\tans1=0;\n\t\tans2=abs(sum)+1;\n\t}\n\telse if(sum<0){\n\t\tsum1=1;\n\t\tsum2=sum;\n\t\tans1=abs(sum)+1;\n\t\tans2=0;\n\t}\n\telse{\n\t\tsum1=1;\n\t\tsum2=-1;\n\t\tans1=1;\n\t\tans2=1;\n\t}\n\tfor(long i=1;i<n;++i){\n\t\tcin>>input;\n\t\tif(sum1*(sum1+input)>=0){\n\t\t\tans1+=abs(sum1+input)+1;\n\t\t\tif(sum1<0) sum1=1;\n\t\t\telse sum1=-1;\n\t\t}\n\t\telse sum1+=input;\n\t\tif(sum2*(sum2+input)>=0){\n\t\t\tans2+=abs(sum2+input)+1;\n\t\t\tif(sum2<0) sum2=1;\n\t\t\telse sum2=-1;\n\t\t}\n\t\telse sum2+=input;\n\t}\n\tcout<<min(ans1,ans2)<<endl;\n}\n", "n = int(input())\na_list = list(map(int,input().split()))\nans = float('inf')\n\nfor i in [1,-1]:\n ans_i = 0\n sums = 0\n for a in a_list:\n sums += a\n if sums*i <= 0:\n ans_i += abs(sums-i)\n sums = i\n i *= -1\n ans = min(ans,ans_i)\n\nprint(ans)", "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<cstdlib>\n#include<map>\n#include<iomanip>\n#include<sstream>\nusing namespace std;\nint main(void){\n const long long int mod=1000000007;\n long long int n,m,a[200005],plsum=0,misum=0,pl=0,mi=0;\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>a[i];\n plsum+=a[i];\n misum+=a[i];\n if(plsum<=0&&i%2==0){pl+=1-plsum;plsum=1;}\n if(plsum>=0&&i%2==1){pl+=plsum+1;plsum=-1;}\n if(misum>=0&&i%2==0){mi+=1+misum;misum=-1;}\n if(misum<=0&&i%2==1){mi+=1-misum;misum=1;}\n }\n \n \n cout<<min(mi,pl);\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n cin>>N;\n vector<int> a(N);\n for(int j=0;j<N;j++){\n cin>>a[j];\n }\n long c1=0, c2=0;\n long sum=0;\n // a[0]>0\n for(int i=0;i<N;i++){\n sum += a[i];\n if(i%2==1 && sum>=0){\n c1 += sum+1;\n sum =-1;\n }\n if(i%2==0 && sum<=0){\n c1 += -sum+1;\n sum = 1;\n }\n }\n\n // a[0]<0\n sum=0;\n for(int i=0;i<N;i++){\n sum += a[i];\n if(i%2==1 && sum<=0){\n c2 += -sum+1;\n sum =1;\n }\n if(i%2==0 && sum>=0){\n c2 += sum+1;\n sum = -1;\n }\n // cout<<sum<<endl;\n }\n\n\n // cout<<c1<<\" \"<<c2<<endl;\n cout<<min(c1,c2)<<endl;\n\n}\n", "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\nimport static java.lang.Math.*;\nimport static java.lang.String.format;\n\npublic class Main {\n public static void main(String[] args) {\n solve();\n }\n final static int INF = Integer.MAX_VALUE>>1;\n final static int MOD = 1_000_000_007;\n final static int[] dx4 = { 0, 1, 0, -1 };\n final static int[] dy4 = { 1, 0, -1, 0 };\n final static int[] dx8 = {0, 1, 1, 1, 0, -1, -1, -1};\n final static int[] dy8 = {1, 1, 0, -1, -1, -1, 0, 1};\n final static Runnable me=()->{};\n public static void solve(){\n //TODO:Solve problem like ***\n Scanner sc=new Scanner();\n int n = sc.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n put(min(func(a, true), func(a, false)));\n }\n private static long func(int[] a,boolean firstIsPlus){\n long ans=0;\n long sum=a[0];\n if(firstIsPlus){\n if(a[0]<=0){\n ans+=abs(a[0])+1;\n sum=1;\n }\n }else{\n if(a[0]>=0){\n ans+=abs(a[0])+1;\n sum=-1;\n }\n }\n for (int i = 1; i < a.length; i++) {\n long nextAns=sum+a[i];\n if(firstIsPlus){\n if(i%2==0){\n if(nextAns<=0){\n //だめ\n sum=1;\n ans+=abs(nextAns)+1;\n continue;\n }else{\n sum=nextAns;\n continue;\n }\n }else{\n if(nextAns>=0){\n //だめ\n sum=-1;\n ans+=abs(nextAns)+1;\n continue;\n }else{\n sum=nextAns;\n continue;\n }\n }\n }else{\n if(i%2==0){\n if(nextAns>=0){\n //だめ\n sum=-1;\n ans+=abs(nextAns)+1;\n continue;\n }else{\n sum=nextAns;\n continue;\n }\n }else{\n if(nextAns<=0){\n //だめ\n sum=1;\n ans+=abs(nextAns)+1;\n continue;\n }else{\n sum=nextAns;\n continue;\n }\n }\n }\n }\n return ans;\n }\n private static Runnable func(Object... objects){\n try{\n assert false;\n return me;\n }catch(AssertionError e){\n return ()->{put(objects);};\n }\n }\n private static void print(Object... objects){\n if(objects.length==1){\n System.out.print(objects[0]);\n }else{\n System.out.print(Arrays.toString(objects));\n }\n }\n private static void put(Object... objects) {\n print(objects);\n put();\n }\n private static void put(){\n System.out.println();\n }\n\n\n private static void runWhenEA(Runnable runnable){\n try{\n assert false;\n }catch(AssertionError e){\n PrintStream ps=System.out;\n PrintStream pse=System.err;\n System.setOut(pse);\n runnable.run();\n System.setOut(ps);\n }\n }\n private static void putM(String name,char[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,int[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,long[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,boolean[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n final static private class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n final static private class FixedIntPair {\n final public int x, y;\n final static public FixedIntPair ZEROS=new FixedIntPair(0,0);\n FixedIntPair(int x, int y) {\n this.x = x;\n this.y = y;\n }\n public static double distance(FixedIntPair fip1,FixedIntPair fip2){\n double x = (double) fip1.x - fip2.x;\n double y = (double) fip1.y - fip2.y;\n return Math.sqrt(x*x+y*y);\n }\n\n @Override\n public int hashCode() {\n return x*100000+y;\n }\n\n @Override\n public boolean equals(Object obj) {\n if(obj==null)return false;\n if(!(obj instanceof FixedIntPair)) return false;\n FixedIntPair pair=(FixedIntPair) obj;\n return this.x==pair.x&&this.y==pair.y;\n }\n\n @Override\n public String toString() {\n return format(FixedIntPair.class.getSimpleName()+\":(%d,%d)\", x, y);\n }\n }\n final static private class FixedLongPair {\n final public long x, y;\n final static public FixedLongPair ZEROS=new FixedLongPair(0,0);\n FixedLongPair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n public static double distance(FixedLongPair flp1,FixedLongPair flp2){\n double x = (double) flp1.x - flp2.x;\n double y = (double) flp1.y - flp2.y;\n return Math.sqrt(x*x+y*y);\n }\n\n @Override\n public int hashCode() {\n return (int)x+(int)y;\n }\n\n @Override\n public boolean equals(Object obj) {\n if(obj==null)return false;\n if(!(obj instanceof FixedLongPair)) return false;\n FixedLongPair pair=(FixedLongPair)obj;\n return this.x==pair.x&&this.y==pair.y;\n }\n\n @Override\n public String toString() {\n return format(FixedLongPair.class.getSimpleName()+\":(%d,%d)\", x, y);\n }\n }\n final static private class Binary{\n public static String toZeroPadding(int i){\n return format(\"%\"+Integer.toBinaryString(-1).length()+\"s\",Integer.toBinaryString(i)).replace(' ','0');\n }\n public static String toZeroPadding(long i){\n return format(\"%\"+Long.toBinaryString(-1).length()+\"s\",Long.toBinaryString(i)).replace(' ','0');\n }\n }\n\n final static private class Util {\n static long gcd(long a,long b){\n a= abs(a);\n b= abs(b);\n if(a<b){\n long tmp=a;\n a=b;\n b=tmp;\n }\n while(b!=0){\n long r=a%b;\n a=b;\n b=r;\n }\n return a;\n }\n static int gcd(int a,int b){\n a= abs(a);\n b= abs(b);\n if(a<b){\n int tmp=a;\n a=b;\n b=tmp;\n }\n while(b!=0){\n int r=a%b;\n a=b;\n b=r;\n }\n return a;\n }\n static long lcm(long a,long b){\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }\n static boolean isValidCell(int i,int j,int h,int w){\n return i>=0&&i<h&&j>=0&&j<w;\n }\n }\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n/*\n......................................................................................................................................\n..................................... ________ ____ __________________________________________ .....................................\n..................................... / _____/| | \\ \\__ ___/\\_ _____/\\______ \\.....................................\n...................................../ \\ ___| | / | \\| | | __)_ | _/.....................................\n.....................................\\ \\_\\ \\ | / | \\ | | \\ | | \\.....................................\n..................................... \\______ /______/\\____|__ /____| /_______ / |____|_ /.....................................\n..................................... \\/ \\/ \\/ \\/ .....................................\n......................................................................................................................................\n.............................................................,;'';:...................................................................\n........................................................+@@@@@@@@@@@@@@'..............................................................\n.....................................................#@@@##############@@@:...........................................................\n...................................................@@@####################@@,.........................................................\n.................................................@@#########################@@........................................................\n...............................................:@############################@@.......................................................\n..............................................@@######@@@#';;'#@@@############@@:.....................................................\n.............................................@#####@@,````````````,@@###########@:....................................................\n............................................@####@;``````````````````+@##########@....................................................\n...........................................@###@:``````````````````````#@########@@...................................................\n..........................................@####``````````````````````````@########@@..................................................\n.........................................###@.````````````````````````````@########@+.................................................\n.........................................@#@```````````````````````````````#########@.................................................\n........................................@#@`````````````````````````````````########@@................................................\n.......................................,@@```````````````````````````````````@#######@:...............................................\n.......................................@@`````````````````````````````````````@#######@...............................................\n.......................................@:````````````````````#@@'``````````````@######@+..............................................\n......................................#@```````````````````@@@@@@@#````````````########@..............................................\n......................................@```````````````````@@@@@@@@@@````````````@######@+.............................................\n......................................@``````````````````@@@@@@@+ +```````````+#######@.............................................\n.....................................;:``````````````````@@@@@@@ @````````````@######@'............................................\n.....................................@``````````````````:@@@@@@@ @````````````@#######@............................................\n.....................................@```,@@@#``````````;@@@@@@@ @````````````:#######@:...........................................\n.....................................@``@@@@@@@@````````.@@@@@@@# ,#`````````````@#######@...........................................\n.....................................@`@@@@@@@+'@````````@@@@@@@@@@@``````````````@#######@...........................................\n.....................................@,@@@@@@ ,```:+:``:@@@@@@@@@.``````````````@########@..........................................\n.....................................#@@@@@@@ ;@@#;,,,@``:@@@@@@@````````````````#########@..........................................\n.....................................+@@@@@@@@',,,,,,,,;,```.'+;``````````````````'########@;.........................................\n.....................................'@@@@',,,,,,,,,,,,,@`````````````````````````:#########@.........................................\n....................................:@#,,,,,:;;;;;:,,,,,@`````````````````````````.#########@.........................................\n.................................:@#@@@@#++';;;;;;;;;;;;@``````````````````````````##########+........................................\n...............................#@#+;;;;;;;;;;;;;;;;;;;;':``````````````````````````##########@........................................\n....................................,@#@@@@@#+'';;;;;+@#```````````````````````````##########@........................................\n.....................................@``````````.,,,.``````````````````````````````############.......................................\n.....................................@`````````````````````````````````````````````#######+'+#@.......................................\n.....................................@`````````````````````````````````````````````##########'@.......................................\n.....................................#`````````````````````````````````````````````############@#.....................................\n.....................................:.````````````````````````````````````````````##############@,...................................\n......................................+```````````````````````````````````````````.###############@#..................................\n......................................@```````````````````````````````````````````.################@@.................................\n......................................@```````````````````````````````````````````.###+##############@................................\n......................................@```````````````````````````````````````````.###+###############@...............................\n......................................',``````````````````````````````````````````.####'##############@@..............................\n.......................................@```````````````````````````````````````````#####+##############@:.............................\n.......................................@```````````````````````````````````````````#####'###############@.............................\n.......................................@```````````````````````````````````````````######'################............................\n.......................................#,``````````````````````````````````````````#######'##############@............................\n........................................@``````````````````````````````````````````@######++##############+...........................\n........................................@``````````````````````````````````````````@#######'##############@...........................\n........................................@``````````````````````````````````````````@########'#############@...........................\n.......................................@#'`````````````````````````````````````````@#########'##############..........................\n.......................................@#@`````````````````````````````````````````+#########+'############@..........................\n......................................@##@`````````````````````````````````````````.##########+'###########@..........................\n......................................@##@:`````````````````````````````````````````###########+'###########..........................\n.....................................:@###@`````````````````````````````````````````@###########+'+#########,.........................\n.....................................@####@`````````````````````````````````````````@#############''########..........................\n.....................................@####@.````````````````````````````````````````;##############+'######@..........................\n.....................................@#####@`````````````````````````````````````````################@@@###+..........................\n.....................................@#####@`````````````````````````````````````````@###############@..;;............................\n....................................,@#####@.````````````````````````````````````````+################'...............................\n....................................:#######@`````````````````````````````````````````################@...............................\n....................................:#######@`````````````````````````````````````````@###############@...............................\n....................................,@#######,````````````````````````````````````````:###############@...............................\n.....................................@######@@`````````````````````````````````````````@##############@...............................\n.....................................@######@@`````````````````````````````````````````+##############@...............................\n.....................................@#####@,;;`````````````````````````````````````````@#############@...............................\n.....................................@####@@..@`````````````````````````````````````````+#############@...............................\n.....................................,####@...@``````````````````````````````````````````@############+...............................\n......................................@##@.....@`````````````````````````````````````````:###########@,...............................\n.......................................@+......@``````````````````````````````````````````@##########@................................\n...............................................:#``````````````````````````````````````````##########@................................\n................................................@``````````````````````````````````````````+########@,................................\n................................................'+``````````````````````````````````````````@#######@.................................\n.................................................@```````````````````````````````````````````@#####@:.................................\n.................................................'#``````````````````````````````````````````.#####@..................................\n..................................................@```````````````````````````````````````````;###@...................................\n...................................................@```````````````````````````````````````````+#@'...................................\n...................................................'#```````````````````````````````````````````@#....................................\n....................................................##`````````````````````````````````````````@#.....................................\n.....................................................#@```````````````````````````````````````@+......................................\n......................................................:@;```````````````````````````````````;@,.......................................\n.......................................................;@@'```````````````````````````````:@@+;.......................................\n.......................................................@,,'@@'``````````````````````````@@@,,,@.......................................\n......................................................@,,,,,,'@@@@;````````````````.+@@@;,,,,,@.......................................\n......................................................#@+@,,,,,,,,+@@@@@@@@@@@@@@@@@;,,,,,'@@@........................................\n.........................................................+,,,#',,@@..............@,,,,,,,,@...........................................\n..........................................................@@@,#@@,...............:+,,,'@,,@...........................................\n..................................................................................@,,,@.##............................................\n...................................................................................@;@................................................\n....................................................................................:.................................................\n......................................................................................................................................\n......................................................................................................................................\n */", "n=int(input())\na=list(map(int,input().split()))\n\n#正/負いずれかから始める\ncost1=0\ncost2=0\nsum1=0\nsum2=0\nfor i in range(n):\n sum1=sum1+a[i]\n sum2=sum2+a[i]\n if i%2==0:\n if sum1<1:\n cost1+=1-sum1\n sum1=1\n \n if sum2>-1:\n cost2+=1+sum2\n sum2=-1\n else:\n if sum1>-1:\n cost1+=1+sum1\n sum1=-1\n \n if sum2<1:\n cost2+=1-sum2\n sum2=1\nprint(min(cost1,cost2))", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tlong[] a = new long[n];\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\t\t\n\t\tlong x = 0;\n\t\tlong sum = a[0];\n\t\tif(sum <= 0) {\n\t\t\tx = 1 - sum;\n\t\t\tsum = 1;\n\t\t}\n\t\t\n\t\tlong x1 = seq(sum, x, a);\n\t\t\n\t\tx = 0;\n\t\tlong sum2 = a[0];\n\t\tif(sum2 >= 0) {\n\t\t\tx = sum2 + 1;\n\t\t\tsum2 = -1;\n\t\t}\n\t\t\n\t\tlong x2 = seq(sum2, x, a);\n\t\t\n\t\tSystem.out.println(Math.min(x1, x2));\n\t}\n\t\n\tpublic static long seq(long sum, long x, long[] a) {\n\t\tlong count = 0;\n\t\t\n\t\tfor(int i = 1; i < a.length; i++) {\n\t\t\tif(sum * (sum + a[i]) >= 0) {\n\t\t\t\tif(sum < 0) {\n\t\t\t\t\tcount = -sum - a[i] + 1;\n\t\t\t\t} else {\n\t\t\t\t\tcount = -sum - a[i] - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsum += a[i] + count;\n\t\t\tx += Math.abs(count);\n\t\t\tcount = 0;\n\t\t}\n\t\treturn x;\n\t}\n\t\n}\n", "n=int(input())\na= (list(map(int,input().split())))\nsm1=sm2=0\ncnt1=cnt2=0\nfor i ,num in enumerate(a):\n\tsm1+=num\n\tif sm1<=0 and i%2==0:\n\t\tcnt1+=1-sm1\n\t\tsm1=1\n\telif sm1>=0 and i%2!=0:\n\t\tcnt1+=1+sm1\n\t\tsm1=-1\n\t\t\n\tsm2+=num\n\tif sm2<=0 and i%2!=0:\n\t\tcnt2+=1-sm2\n\t\tsm2=1\n\telif sm2>=0 and i%2==0:\n\t\tcnt2+=1+sm2\n\t\tsm2=-1\nprint(min(cnt1,cnt2))", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nint solvePlus(vector<int> v) {\n int cnt = 0, sum = 0;\n\n for (int i = 0; i < v.size(); i++) {\n sum += v[i];\n if (i % 2 == 1) {\n cnt = (sum < 0) ? cnt : (cnt + abs(sum) + 1);\n sum = (sum < 0) ? sum : -1;\n } else if (i % 2 == 0) {\n cnt = (sum > 0) ? cnt : (cnt + abs(sum) + 1);\n sum = (sum > 0) ? sum : 1;\n }\n }\n return cnt;\n}\n\nsigned main() {\n int n;\n cin >> n;\n vector<int> a(n);\n for (auto&& w : a) cin >> w;\n int ans1, ans2;\n ans1 = solvePlus(a);\n for (auto&& w : a) w *= -1;\n ans2 = solvePlus(a);\n\n cout << min(ans1, ans2) << endl;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\npublic class Main {\n public static void main(String[] args) {\n// Scanner sc = new Scanner(System.in);\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n int n=sc.nextInt();\n int a[]=sc.readArray(n);\n long sum = 0, pm = 0, mp = 0;\n for(int i=0; i<n; ++i){\n sum += a[i];\n if(i%2 == 0 && sum <= 0){\n pm += 1-sum;\n sum = 1;\n }\n if(i%2 != 0 && sum >= 0){\n pm += 1+sum;\n sum = -1;\n }\n }\n sum = 0;\n for(int i=0; i<n; ++i){\n sum += a[i];\n if(i%2 == 0 && sum >= 0){\n mp += 1+sum; sum = -1;\n }\n if(i%2 != 0 && sum <= 0){\n mp += 1-sum; sum = 1;\n }\n }\n System.out.println(Math.min(pm,mp));\n out.flush();\n }\n\n static void sort(int[] a) {\n ArrayList<Integer> l=new ArrayList<>();\n for (int i:a) l.add(i);\n Collections.sort(l);\n for (int i=0; i<a.length; i++) a[i]=l.get(i);\n }\n static void sortReverse(long[] a) {\n ArrayList<Long> l=new ArrayList<>();\n for (long i:a) l.add(i);\n// Collections.sort.(l);\n Collections.sort(l,Collections.reverseOrder());\n for (int i=0; i<a.length; i++) a[i]=l.get(i);\n }\n\n static class FastScanner {\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st=new StringTokenizer(\"\");\n String next() {\n while (!st.hasMoreTokens())\n try {\n st=new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n int[] readArray(int n) {\n int[] a=new int[n];\n for (int i=0; i<n; i++) a[i]=nextInt();\n return a;\n }\n long[] readArrayLong(long n) {\n long[] a=new long[(int)n];\n for (int i=0; i<n; i++) a[i]=nextLong();\n return a;\n }\n long nextLong() {\n return Long.parseLong(next());\n }\n }\n\n\n}", "input()\nl=list(map(int,input().split()))\ndef f(b):\n c=s=0\n for i in l:\n if b:\n if s+i>0: s+=i\n else: c-=s+i-1; s=1\n else:\n if s+i<0: s+=i\n else: c+=s+i+1; s=-1\n b=1-b\n return c\nprint(min(f(0),f(1)))", "#include <bits/stdc++.h>\nusing namespace std;\n\nint a[100005];\nint n;\n\nlong long calc(int MOD) {\n\tlong long sum = 0, res = 0;\n\tfor (int i = 1; i <= n; ++i) {\n\t\tsum += a[i];\n\t\tif (i%2 == MOD && sum <= 0) {\n\t\t\tres += (1-sum);\n\t\t\tsum = 1;\n\t\t}\n\t\telse if (i%2 != MOD && sum >= 0) {\n\t\t\tres += (sum+1);\n\t\t\tsum = -1;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main() {\n\tscanf(\"%d\", &n);\n\tfor (int i = 1; i <= n; ++i) \n\t\tscanf(\"%d\", &a[i]);\n\tcout << min(calc(0), calc(1));\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = scan.nextLong();\n\t\t}\n\n\t\tlong sum1 = 0;\n\t\tlong sum2 = 0;\n\t\tlong ans1 = 0;\n\t\tlong ans2 = 0;\n\n\n\t\tfor (int i = 0; i < n; i++) {//偶数添字が正\n\t\t\tsum1 += a[i];\n\t\t\tif (i%2 == 0) {\n\t\t\t\tif (sum1 > 0) continue;\n\t\t\t\telse {\n\t\t\t\t\tans1 += (1 + Math.abs(sum1));\n\t\t\t\t\tsum1 = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (i%2 == 1) {\n\t\t\t\tif (sum1 < 0) continue;\n\t\t\t\telse {\n\t\t\t\t\tans1 += (sum1 + 1);\n\t\t\t\t\tsum1 = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {//奇数添字が正\n\t\t\tsum2 += a[i];\n\t\t\tif (i%2 == 1) {\n\t\t\t\tif (sum2 > 0) continue;\n\t\t\t\telse {\n\t\t\t\t\tans2 += (1 + Math.abs(sum2));\n\t\t\t\t\tsum2 = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (i%2 == 0) {\n\t\t\t\tif (sum2 < 0) continue;\n\t\t\t\telse {\n\t\t\t\t\tans2 += (sum2 + 1);\n\t\t\t\t\tsum2 = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (sum1 == 0) {\n\t\t\tans1++;\n\t\t}\n\t\tif (sum2 == 0) {\n\t\t\tans2++;\n\t\t}\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n}\n", "N = int( input())\nA = list( map( int, input().split()))\nans = 10**15\nfor i in [1, -1]:\n ansi, sums = 0, 0\n for a in A:\n sums += a\n if sums*i <= 0:\n ansi += abs(sums-i)\n sums = i\n i *= -1\n ans = min( ans, ansi)\nprint(ans)", "import java.util.Scanner;\n\n/**\n * https://abc059.contest.atcoder.jp/tasks/arc072_a\n */\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = Integer.parseInt(sc.next());\n\t\tlong[] a = new long[N];\n\t\tfor(int i=0; i<N; i++) a[i] = sc.nextLong();\n\t\tsc.close();\n\t\t\n\t\tlong ans = 0;\n\t\tlong ans2 = 0;\n\t\tlong sum = 0;\n\t\tfor(int i=0; i<N; i++){\n\t\t\tif(i%2==0 && sum+a[i]>=0){\n\t\t\t\tans = ans + (a[i]+sum) +1;\n\t\t\t\tsum = -1;\n\t\t\t}else if(i%2==1 && sum+a[i]<=0){\n\t\t\t\tans = ans - (a[i]+sum) +1;\n\t\t\t\tsum = 1;\n\t\t\t}else{\n\t\t\t\tsum = sum + a[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\tsum = 0;\n\t\tfor(int i=0; i<N; i++){\n\t\t\tif(i%2==1 && sum+a[i]>=0){\n\t\t\t\tans2 = ans2 + (a[i]+sum) +1;\n\t\t\t\tsum = -1;\n\t\t\t}else if(i%2==0 && sum+a[i]<=0){\n\t\t\t\tans2 = ans2 - (a[i]+sum) +1;\n\t\t\t\tsum = 1;\n\t\t\t}else{\n\t\t\t\tsum = sum + a[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(Math.min(ans, ans2));\n\n\t}\n\n}", "import java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\t//入力\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0; i < n; i++){\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\t\tsc.close();\n\n\t\t//処理\n\t\tlong ans = -1;\n\t\tfor(int pat = 0; pat < 2; pat++){\n\t\t\tlong sum = 0;\n\t\t\tlong temp = 0;\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tsum += a[i];\n\t\t\t\tif(i % 2 == pat){\n\t\t\t\t\tif(sum <= 0){\n\t\t\t\t\t\ttemp += Math.abs(sum) + 1;\n\t\t\t\t\t\tsum = 1;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tif(sum >= 0){\n\t\t\t\t\t\ttemp += Math.abs(sum) + 1;\n\t\t\t\t\t\tsum = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(ans == -1){\n\t\t\t\tans = temp;\n\t\t\t}else{\n\t\t\t\tans = Math.min(ans, temp);\n\t\t\t}\n\t\t}\n\n\t\t//出力\t\n\t\tout.println(ans);\n\t\tout.flush();\n\t}\n\n\tstatic class Pair{\n\t\tint w,v;\n\t\tpublic Pair(int a, int b){\n\t\t\tthis.w = a;\n\t\t\tthis.v = b;\n\t\t}\n\t}\n}", "N = int(input())\na = list(map(int,input().split()))\nS = [0]*N\nS[0] = a[0]\n\nfor i in range(1,N):\n S[i] = S[i-1] + a[i]\n\ncount = [0]*N\nnum = [0]*2\nfor i in range(2):\n value = 0\n for j in range(N):\n if (S[j]+value)*((-1)**(i+j)) <= 0:\n num[i] += abs(S[j] + value - (-1)**(i+j))\n value += (-1)**(i+j) - (S[j]+value)\n #print(i,num,value)\n\n#print(S)\nprint(min(num))", "#include <iostream>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n int a[n];\n for (int i = 0; i < n; i++) cin >> a[i];\n\n auto f = [&](int sign) {\n long long ans = 0;\n int sum = 0;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (sign * sum <= 0) {\n ans += -1 * sign * sum + 1;\n sum = sign;\n }\n sign = sum < 0 ? 1 : -1;\n }\n return ans;\n };\n\n cout << min(f(1), f(-1)) << endl;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nconst long long int inf = 1e18;\n\nint main(){\n int n;\n cin >> n;\n vector<int> a(n);\n for(int i=0; i<n; i++){\n cin >> a[i];\n }\n\n long long int ans = inf;\n for(int r=0; r<2; r++){\n long long int sum=0, t=0;\n for(int i=0; i<n; i++){\n sum += a[i];\n if(i%2==r && sum<=0){\n t += -sum+1;\n sum = 1;\n }else if(i%2!=r && sum>=0){\n t += sum+1;\n sum = -1;\n }\n }\n ans = min(ans, t);\n }\n cout << ans << endl;\n return 0;\n}\n", "# -*- coding: utf-8 -*-\n\n\nN = int(input())\nAn = list(map(int, input().split()))\nans = [0,0]\n\nasum = 0\nfor i in range(N):\n asum += An[i]\n if asum*(-1)**i < 1:\n ans[0] += 1 - asum*(-1)**i\n asum = (-1)**i\n\nasum = 0\nfor i in range(N):\n asum += An[i]\n if asum*(-1)**(i+1) < 1:\n ans[1] += 1 - asum*(-1)**(i+1)\n asum = (-1)**(i+1)\n\nprint(min(ans))", "#include<iostream>\nusing namespace std;\n\nint main(){\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n long long s1=0,s2=0,r1=0,r2=0,ans;\n for(int i=0;i<n;i++){\n s1+=a[i];\n if((i&1)&&s1<=0){\n r1=r1+1-s1;\n s1=1;\n }else if(!(i&1)&&s1>=0){\n r1=r1+s1+1;\n s1=-1;\n }\n\n s2+=a[i];\n if(!(i&1)&&s2<=0){\n r2=r2+1-s2;\n s2=1;\n }else if((i&1)&&s2>=0){\n r2=r2+s2+1;\n s2=-1;\n }\n }\n ans=min(r1,r2);\n cout<<ans<<endl;\n return 0;\n}", "n, *A = map(int, open(0).read().split())\ndef sgn(n):\n return 0 if n==0 else 1 if n>0 else -1\n\na = A[0]\nC = [0 if a>0 else -a+1, 0 if a<0 else a+1]\nS = [max(1, a), min(-1, a)]\n\nfor a in A[1:]:\n for i, s in enumerate(S):\n sgn_sum = sgn(s)\n if sgn(s+a) == -sgn_sum:\n S[i] += a\n else:\n C[i] += abs(s+a+sgn_sum)\n S[i] = -sgn_sum\n\nprint(min(C))", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;\n cin >> n;\n vector<long long> a(n);\n long long sum1=0,sum2=0,cost1=0,cost2=0;\n for(int i=0;i<n;i++){\n cin >> a[i];\n sum1+=a[i];\n sum2+=a[i];\n if(i%2==0&&sum1<=0){\n cost1+=1-sum1;\n sum1=1;\n }\n else if(i%2==1&&sum1>=0){\n cost1+=sum1+1;\n sum1=-1;\n }\n if(i%2==0&&sum2>=0){\n cost2+=1+sum2;\n sum2=-1;\n }\n else if(i%2==1&&sum2<=0){\n cost2+=1-sum2;\n sum2=1;\n }\n }\n cout << min(cost1,cost2) << endl;\n}", "N = int(input())\n\nA = [int(_) for _ in input().split()]\n\n\ndef f(sign):\n ans = 0\n s = 0\n for i in range(N):\n a = A[i]\n s += a\n if s == 0:\n ans += 1\n s = sign\n else:\n a_sign = s // abs(s)\n if a_sign != sign:\n ans += abs(s) + 1\n s = sign\n sign *= -1\n return ans\n\n\nprint(min(f(1), f(-1)))\n", "#include<iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint main()\n{int N;\n int C[200000];\n cin >> N;\n for(int i=0; i<N; i++){\n cin >> C[i];}\n long long cnt_a=0;\n long long cnt_b=0;\n int sum_a=0;\n int sum_b=0;\n for(int i=0; i<N; i++){\n sum_a += C[i];\n if((i%2==0)&&(sum_a<=0)){\n cnt_a += 1 - sum_a;\n sum_a = 1;}\n if((i%2==1)&&(sum_a>=0)){\n cnt_a += sum_a + 1;\n sum_a = -1;}\n }\n for(int i=0; i<N; i++){\n sum_b += C[i];\n if((i%2==0)&&(sum_b>=0)){\n cnt_b += 1 + sum_b;\n sum_b = -1;}\n if((i%2==1)&&(sum_b<=0)){\n cnt_b += 1 - sum_b;\n sum_b = 1;}\n }\ncout << min(cnt_a, cnt_b) << endl;\n}\n\n ", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int m,i;\n int64_t ans0=0,ans1=0,t=0;\n cin>>m;\n vector<int64_t> x(m);\n for(i=0;i<m;i++) cin>>x.at(i);\n for(i=0;i<m;i++){\n t+=x.at(i);\n if(i%2==0&&t<=0){\n ans0+=abs(t)+1;\n t=1;\n }\n else if(i%2==1&&t>=0){\n ans0+=abs(t)+1;\n t=-1;\n }\n }\n t=0;\n for(i=0;i<m;i++){\n t+=x.at(i);\n if(i%2==0&&t>=0){\n ans1+=abs(t)+1;\n t=-1;\n }\n else if(i%2==1&&t<=0){\n ans1+=abs(t)+1;\n t=1;\n }\n }\n cout<<min(ans0,ans1)<<endl;\n}", "n = int(input())\na = list(map(int, input().split()))\n\ny = [0, 0]\nfor k in range(2):\n s = 0\n x = (-1) ** k\n for ai in a:\n si = s + ai\n if si * x > 0:\n s = si\n x *= -1\n else:\n y[k] += abs(si) + 1\n s = x\n x *= -1\nprint(min(y))\n", "N = int(input())\nA = [int(_n) for _n in input().split()]\nres0 = 0\ns = 0\nfor i, a in enumerate(A):\n s += a\n if i % 2 == 0 and s >= 0:\n res0 += s + 1\n s = -1\n elif i % 2 == 1 and s <= 0:\n res0 += -s + 1\n s = 1\nres1 = 0\ns = 0\nfor i, a in enumerate(A):\n s += a\n if i % 2 == 1 and s >= 0:\n res1 += s + 1\n s = -1\n elif i % 2 == 0 and s <= 0:\n res1 += -s + 1\n s = 1\nprint(min(res0,res1))", "#abc059c\n\nn=int(raw_input())\na=map(int,raw_input().split())\ndef f(a,s):\n ac=0\n cnt=0\n for i in xrange(n):\n ac+=a[i]\n if i%2:\n if s*ac>=0:\n cnt+=1+s*ac\n ac=-s\n else:\n if s*ac<=0:\n cnt+=1-s*ac\n ac=s\n return cnt\nprint min(f(a,1),f(a,-1))\n", "n = int(input())\nA = list(map(int, input().split()))\n\ncnt = [0,0]\n\nfor i in [0,1]:\n tmp_sum = 0\n for j, a in enumerate(A):\n tmp_sum += a\n if (i + j) % 2 == 0 and tmp_sum <= 0:\n cnt[i] += abs(tmp_sum) + 1\n tmp_sum += abs(tmp_sum) + 1\n elif (i + j) % 2 == 1 and tmp_sum >= 0:\n cnt[i] += tmp_sum + 1\n tmp_sum -= tmp_sum + 1\n\nprint(min(cnt))\n ", "N = int(input())\nA = list(map(int, input().split()))\n\ndef sol(S):\n ret = 0\n for a in A[1:]:\n b = a\n if S * (S + b) > 0:\n b = (abs(S) + 1) * (1 if S < 0 else -1)\n if S + b == 0:\n b = b - 1 if S < 0 else b + 1\n ret += abs(b - a)\n S += b\n return ret\n\nif A[0] == 0:\n ans = min(sol(1), sol(-1)) + 1\nelse:\n ans = min(sol(A[0]), sol(-1 if A[0] > 0 else 1) + abs(A[0]) + 1)\nprint(ans)\n", "import java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException{\n\t\tSequence solver = new Sequence();\n\t\tsolver.readInput();\n\t\tsolver.solve();\n\t\tsolver.writeOutput();\n\t}\n\n\n\tstatic class Sequence {\n\t\tprivate int n;\n\t\tprivate long a[];\n\n\t\tprivate long output;\n\t\tprivate Scanner scanner;\n\n\t\tpublic Sequence() {\n\t\t\tthis.scanner = new Scanner(System.in);\n\t\t}\n\n\t\tpublic void readInput() {\n\t\t\tn = Integer.parseInt(scanner.next());\n\t\t\ta = new long[n];\n\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t\ta[i] = Integer.parseInt(scanner.next());\n\t\t\t}\n\t\t}\n\n\t\tprivate int count(int sign) {\n\t\t\tint count=0;\n\t\t\tlong sum=0;\n\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t\tsum += a[i];\n\t\t\t\tif(i%2==sign) {\n\t\t\t\t\t// a[i]までの合計を正にするとき\n\t\t\t\t\tif(sum<=0) {\n\t\t\t\t\t\tcount += 1-sum;\n\t\t\t\t\t\tsum = 1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// a[i]までの合計を負にするとき\n\t\t\t\t\tif(0<=sum) {\n\t\t\t\t\t\tcount += 1+sum;\n\t\t\t\t\t\tsum = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn count;\n\t\t}\n\n\t\tpublic void solve() {\n\t\t\tlong sum1 = 0;\n\t\t\tlong count1 = 0;\n\t\t\tlong sum2 = 0;\n\t\t\tlong count2 = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t sum1 += a[i];\n\t\t\t sum2 += a[i];\n\t\t\t if (i % 2 == 1) {\n\t\t\t if (sum1 <= 0) {\n\t\t\t count1 += 1 - sum1;\n\t\t\t sum1 = 1;\n\t\t\t }\n\t\t\t if (sum2 >= 0) {\n\t\t\t count2 += sum2 + 1;\n\t\t\t sum2 = -1;\n\t\t\t }\n\t\t\t } else {\n\t\t\t if (sum2 <= 0) {\n\t\t\t count2 += 1 - sum2;\n\t\t\t sum2 = 1;\n\t\t\t }\n\t\t\t if (sum1 >= 0) {\n\t\t\t count1 += sum1 + 1;\n\t\t\t sum1 = -1;\n\t\t\t }\n\t\t\t }\n\t\t\t}\n\t\t\toutput = Math.min(count1,count2);\n\t\t}\n\n\n\t\tpublic void writeOutput() {\n\t\t\tSystem.out.println(output);\n\t\t}\n\t}\n\n}", "#include <iostream>\nusing namespace std;\n\nint N, a, i, x, y;\nlong long X, Y;\n\nint main() {\n cin >> N;\n while (cin >> a && ++i) {\n x += a, y += a;\n if (i % 2) {\n if (x > -1) X += x + 1, x = -1;\n if (y < 1) Y += 1 - y, y = 1;\n } else {\n if (y > -1) Y += y + 1, y = -1;\n if (x < 1) X += 1 - x, x = 1;\n }\n }\n cout << min(X, Y) << \"\\n\";\n}", "n=int(input())\na=list(map(int,input().split()))\na1,a2,s=0,0,0\ndef cal(a,t):\n ans,x=0,0\n for i in a:\n x+=i\n if t and x<1:\n ans+=1-x\n x=1\n elif t==False and x>-1:\n ans+=x+1\n x=-1\n t=not t\n return ans\nprint(min(cal(a,True),cal(a,False)))", "n = int(raw_input())\ndata = map(int, raw_input().split())\nresult = []\nfor i in range(2):\n sum = 0\n count = 0\n for j in range(n):\n sum += data[j]\n if (i+j) % 2 == 0:\n if sum <= 0:\n count += abs(1-sum)\n sum = 1\n else:\n if sum >= 0:\n count += abs(-1-sum)\n sum = -1\n result.append(count)\nprint min(result) ", "N = int(input())\na = list(map(int, input().split()))\n\nans1 = 0\ns = 0\nflg = 1\nfor ai in a:\n s += ai\n if s * flg <= 0:\n ans1 += abs(s) + 1\n s = flg\n flg *= -1\n\nans2 = 0\ns = 0\nflg = -1\nfor ai in a:\n s += ai\n if s * flg <= 0:\n ans2 += abs(s) + 1\n s = flg\n flg *= -1\n\nprint(min(ans1, ans2))\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<n;i++)\nint main() {\n int n;\n cin >> n;\n vector<ll> A(n);\n ll a,now1=0,cnt1=0,now2=0,cnt2=0;\n rep(i,n) cin >> A[i];\n rep(i,n) {\n now1 += A[i];\n now2 += A[i];\n if (now1<=0) {\n cnt1+=abs(now1)+1;now1=1;\n }\n if (now2>=0) {\n cnt2+=abs(now2)+1;now2=-1;\n }\n swap(now1,now2);swap(cnt1,cnt2);\n }\n cout << min(cnt1,cnt2) << endl;\n}", "#include <iostream>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\nll s1, s2, c1, c2;\nint main() {\n\tll n, a;\n\tscanf(\"%lld\", &n);\n\tfor (int i = 1; i <= n; i++) {\n\t\tscanf(\"%lld\", &a);\n\t\ts1 += a;\n\t\ts2 += a;\n\t\tif (i % 2) {\n\t\t\tif (s1 <= 0) c1 += 1 - s1,s1 = 1;\n\t\t\tif (s2 >= 0) c2 += 1 + s2,s2 = -1;\n\t\t}\n\t\telse {\n\t\t\tif (s1 >= 0) c1 += 1 + s1,s1 = -1;\n\t\t\tif (s2 <= 0) c2 += 1 - s2,s2 = 1;\n\t\t}\n\t}\n\tcout << min(c1, c2) << endl;\n\treturn 0;\n}", "n=int(input())\na=[int(i) for i in input().split()]\n\nif a[0]>=0:\n f=1\nelse:\n f=-1\n\ns=0\nans=0\nfor i in range(n):\n s+=a[i]\n if s*f<0:\n ans+=abs(s)+1\n s=f\n elif s==0:\n ans+=1\n s=f\n f*=-1\n\n\nif a[0]>=0:\n f=-1\nelse:\n f=1\ns=0\nans2=0\nfor i in range(n):\n s+=a[i]\n if s*f<0:\n ans2+=abs(s)+1\n s=f\n elif s==0:\n ans2+=1\n s=f\n f*=-1\n \nprint(min(ans,ans2))\n \n\n\n\n\n", "n = int(input())\na = list(map(int, input().split()))\nans1, ans2 = 0, 0\ncnt1, cnt2 = 0, 0\ncur = 1\nfor i in a:\n cnt1 += i\n if cnt1 * cur <= 0:\n ans1 += abs(cnt1 - cur)\n cnt1 = cur\n cur *= -1\ncur = -1\nfor i in a:\n cnt2 += i\n if cnt2 * cur <= 0:\n ans2 += abs(cnt2 - cur)\n cnt2 = cur\n cur *= -1\nprint(min(ans1, ans2))", "N = int(input())\nA = [int(x) for x in input().split()]\n\ndef F(A, sgn):\n cnt_operation = 0\n cum = 0\n for a in A:\n sgn *= (-1)\n cum += a\n if cum * sgn > 0:\n continue\n if sgn > 0:\n cnt_operation += (1 - cum)\n cum = 1\n else:\n cnt_operation += (cum + 1)\n cum = -1\n return cnt_operation\n\nanswer = min(F(A,1), F(A,-1))\nprint(answer)", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tString[] sa = br.readLine().split(\" \");\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = Integer.parseInt(sa[i]);\n\t\t}\n\t\tbr.close();\n\n\t\tlong val = 0;\n\t\tlong now = a[0];\n\t\tif (a[0] <= 0) {\n\t\t\tval += 1 - a[0];\n\t\t\tnow = 1;\n\t\t}\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tnow += a[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tif (now <= 0) {\n\t\t\t\t\tval += 1 - now;\n\t\t\t\t\tnow = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (now >= 0) {\n\t\t\t\t\tval += now + 1;\n\t\t\t\t\tnow = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans = val;\n\n\t\tval = 0;\n\t\tnow = a[0];\n\t\tif (a[0] >= 0) {\n\t\t\tval += a[0] + 1;\n\t\t\tnow = -1;\n\t\t}\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tnow += a[i];\n\t\t\tif (i % 2 != 0) {\n\t\t\t\tif (now <= 0) {\n\t\t\t\t\tval += 1 - now;\n\t\t\t\t\tnow = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (now >= 0) {\n\t\t\t\t\tval += now + 1;\n\t\t\t\t\tnow = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans = Math.min(ans, val);\n\t\tSystem.out.println(ans);\n\t}\n}\n", "N = int(input())\nA = [int(_) for _ in input().split()]\n\n#positive\npos_count = 0\nsign = 1\ncumsum = 0\nfor a in A:\n cumsum += a\n if cumsum * sign <= 0:\n pos_count += abs(sign - cumsum)\n cumsum = sign\n sign *= -1\n\n#negative\nneg_count = 0\nsign = -1\ncumsum = 0\nfor a in A:\n cumsum += a\n if cumsum * sign <= 0:\n neg_count += abs(sign - cumsum)\n cumsum = sign\n sign *= -1\n\nprint(min(pos_count, neg_count))\n", "n = int(input())\nA = [int(i) for i in input().split()]\n\n\ndef judge(A,t):\n a_sum = 0\n cnt = 0\n for i in range(len(A)):\n a_sum += A[i]\n if i % 2 == 0:\n if t*a_sum <= 0:\n cnt += 1-t*a_sum\n a_sum = t\n \n else:\n if t*a_sum >= 0:\n cnt += 1 + t*a_sum\n a_sum = -t\n \n return cnt\n \nprint(min(judge(A,1),judge(A,-1)))", "\nimport java.util.Scanner;\n\npublic class Main {\n\n private static Scanner scan = new Scanner(System.in);\n\n public static void main(String[] args) {\n\tint N = Integer.parseInt(scan.next());\n\tlong a[] = new long[N];\n\n\tfor (int i = 0; i < N; i++) {\n\t a[i] = Long.parseLong(scan.next());\n\t}\n\n\tlong s1 = 0;\n\tlong s2 = 0;\n\tlong count1 = 0;\n\tlong count2 = 0;\n\tfor (int i = 0; i < N; i++) {\n\t s1 += a[i];\n\t s2 += a[i];\n\t if(i%2 == 0) {\n\t\tif(s1 <= 0) {\n\t\t count1 += (1-s1);\n\t\t s1 = 1;\n\t\t}\n\t\tif(s2 >= 0) {\n\t\t count2 += (s2+1);\n\t\t s2 = -1;\n\t\t}\n\t } else {\n\t\tif(s1 >= 0) {\n\t\t count1 += (s1+1);\n\t\t s1 = -1;\n\t\t}\n\t\tif(s2 <= 0) {\n\t\t count2 += (1-s2);\n\t\t s2 = 1;\n\t\t}\n\t }\n\t}\n\n\tSystem.out.println(count1 < count2 ? count1 : count2);\n\tscan.close();\n }\n}\n", "#include <bits/stdc++.h>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\nusing lint=long long;\n\nconst lint INF=1LL<<61;\n\nint main(){\n\tint n; cin>>n;\n\tvector<int> a(n);\n\trep(i,n) cin>>a[i];\n\n\tlint ans=INF;\n\tfor(int a0:{1,-1,a[0]}) if(a0!=0) {\n\t\tlint tmp=abs(a0-a[0]),sum=a0;\n\t\tfor(int i=1;i<n;i++){\n\t\t\tsum+=a[i];\n\t\t\tif(sum-a[i]>0){\n\t\t\t\tif(sum>=0){\n\t\t\t\t\ttmp+=sum+1;\n\t\t\t\t\tsum=-1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(sum-a[i]<0){\n\t\t\t\tif(sum<=0){\n\t\t\t\t\ttmp+=1-sum;\n\t\t\t\t\tsum=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=min(ans,tmp);\n\t}\n\tcout<<ans<<endl;\n\n\treturn 0;\n}\n", "import java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n static void solve() {\n int n = nextInt();\n long[] a = nextLongArray(n);\n\n long ans;\n long sum;\n boolean expectPlus;\n\n // a1 > 0 の場合\n ans = 0;\n sum = 0;\n expectPlus = true;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (expectPlus && sum <= 0) {\n ans += -sum + 1;\n sum = 1;\n } else if (!expectPlus && sum >= 0) {\n ans += sum + 1;\n sum = -1;\n }\n expectPlus = !expectPlus;\n }\n long ans1 = ans;\n\n // a1 < 0 の場合\n ans = 0;\n sum = 0;\n expectPlus = false;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (expectPlus && sum <= 0) {\n ans += -sum + 1;\n sum = 1;\n } else if (!expectPlus && sum >= 0) {\n ans += sum + 1;\n sum = -1;\n }\n expectPlus = !expectPlus;\n }\n long ans2 = ans;\n\n ans = Math.min(ans1, ans2);\n out.println(ans);\n }\n\n static final int MOD = 1_000_000_007;\n static long[] fac, finv, inv;\n\n // 階乗(n!)\n static long factorial(long n) {\n long ans = 1;\n for (long i = n; i > 0; i--) {\n ans = ans * i % MOD;\n }\n return ans;\n }\n\n // nCkの初期化\n static void comInit(int max) {\n fac = new long[max];\n finv = new long[max];\n inv = new long[max];\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n\n for (int i = 2; i < max; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n\n // nCkの計算\n static long com(int n, int k) {\n if (n < k)\n return 0;\n if (n < 0 || k < 0)\n return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n }\n\n static PrintWriter out;\n static Scanner sc;\n\n static int[][] newIntArray(int h, int w, int value) {\n int[][] ret = new int[h][w];\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n ret[i][j] = value;\n }\n }\n return ret;\n }\n\n static int nextInt() {\n return Integer.parseInt(sc.next());\n }\n\n static long nextLong() {\n return Long.parseLong(sc.next());\n }\n\n static String nextString() {\n return sc.next();\n }\n\n static int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n static long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n static List<Integer> nextIntList(int n) {\n List<Integer> list = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n list.add(nextInt());\n }\n return list;\n }\n\n static List<Double> nextDoubleList(int n) {\n List<Double> list = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n list.add((double) nextInt());\n }\n return list;\n }\n\n static List<Long> nextLongList(int n) {\n List<Long> list = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n list.add(nextLong());\n }\n return list;\n }\n\n static char[][] nextCharArray(int h, int w) {\n char[][] c = new char[h][w];\n for (int i = 0; i < h; i++) {\n String str = nextString();\n for (int j = 0; j < w; j++) {\n c[i][j] = str.charAt(j);\n }\n }\n return c;\n }\n\n static <T extends Comparable<? super T>> void sort(List<T> list) {\n Collections.sort(list);\n }\n\n // greatest common divisor\n // 最大公約数\n static long gcd(long a, long b) {\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n }\n\n // least common multiple\n // 最小公倍数\n static long lcm(long a, long b) {\n if (a >= b && a % b == 0)\n return a;\n if (b > a && b % a == 0)\n return b;\n\n if (a > b) {\n return (a / gcd(a, b)) * b;\n } else {\n return (b / gcd(a, b)) * a;\n }\n // return a * b / gcd(a, b);\n }\n\n // baseのn乗を計算を返す\n static int pow(int base, int n) {\n int ret = 1;\n for (int i = 0; i < n; i++) {\n ret *= base;\n }\n return ret;\n }\n\n // return n^k mod m\n static long powMod(long n, long k, long m) {\n if (k == 0) {\n return 1;\n } else if (k % 2 == 1) {\n return powMod(n, k - 1, m) * n % m;\n } else {\n long tmp = powMod(n, k / 2, m);\n return tmp * tmp % m;\n }\n }\n\n // intをlength桁のbit文字列に変換\n static String toBitString(int length, int n) {\n StringBuilder sb = new StringBuilder();\n for (int i = length - 1; i >= 0; i--) {\n if ((n >> i) % 2 == 1) {\n sb.append(\"1\");\n } else {\n sb.append(\"0\");\n }\n }\n return sb.toString();\n }\n\n public static void main(String[] args) {\n out = new PrintWriter(System.out);\n sc = new Scanner(System.in);\n\n solve();\n\n out.flush();\n sc.close();\n }\n\n}\n", "n = int(input())\na = list(map(int, input().split()))\n\nansl = [0, 0]\ns = [0, 0]\n\nfor i in range(2):\n\tfor j in range(n):\n\t\ts[i] += a[j]\n\t\tif (i+j) % 2 == 0:\n\t\t\tif s[i] >=0:\n\t\t\t\tansl[i] += abs(s[i]) + 1\n\t\t\t\ts[i] = -1\n\t\telse:\n\t\t\tif s[i] <=0:\n\t\t\t\tansl[i] += abs(s[i]) + 1\n\t\t\t\ts[i] = 1\n\nprint(min(ansl))\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin >> n;\n\tlong long int sum1=0,prev1=0;\n\tlong long int sum2=0,prev2=0;\n\tlong long int ans1=0, ans2=0;\n\tfor(int i=0;i<n;i++){\n\t\tlong long int a;\n\t\tcin >> a;\n\t\tsum1 += a;\n\t\tsum2 += a;\n\t\tif(i%2==0){\n\t\t\tif(sum1 >= 0){\n\t\t\t\tans1 += abs(sum1)+1;\n\t\t\t\tsum1 = -1;\n\t\t\t}\n\t\t\tif(sum2 <= 0){\n\t\t\t\tans2 += abs(sum2)+1;\n\t\t\t\tsum2 = 1;\n\t\t\t}\n\t\t} else {\n\t\t\tif(sum1 <= 0){\n\t\t\t\tans1 += abs(sum1)+1;\n\t\t\t\tsum1 = 1;\n\t\t\t}\n\t\t\tif(sum2 >= 0){\n\t\t\t\tans2 += abs(sum2)+1;\n\t\t\t\tsum2 = -1;\n\t\t\t}\n\t\t}\n\t\tprev1 = sum1;\n\t\tprev2 = sum2;\n\t}\n\tcout << min(ans1, ans2) << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<int>a(n);\n\tfor (int i = 0; i < n; i++)cin >> a.at(i);\n\tll ans = 1e18;\n\tbool x = true;\n\tfor (int i = 0; i < 2; i++) {\n\t\tll res = 0;\n\t\tll sig = 0;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tif (x) {\n\t\t\t\tsig += a.at(j);\n\t\t\t\tx = false;\n\t\t\t\tif (sig > 0)continue;\n\t\t\t\telse {\n\t\t\t\t\tres += abs(1 - sig);\n\t\t\t\t\tsig = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tsig += a.at(j); \n\t\t\t\tx = true;\n\t\t\t\tif (sig < 0)continue;\n\t\t\t\telse {\n\t\t\t\t\tres += abs(-1 - sig);\n\t\t\t\t\tsig = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tx = false;\n\t\tans = min(ans, res);\n\t}\n\tcout << ans << endl;\n}", "#include <iostream>\n#include<sstream>\n#include<vector>\n#include<iterator>\n#include<cmath>\nusing namespace std;\n\nlong long f(int sign, const vector<long long>& a)\n{\n\tlong long cnt = 0;\n\tlong long sum = 0;\n\n\tfor(int i=0; i<a.size(); i++)\n\t{\n\t\tsum += a[i];\n\t\tif(sign*sum <= 0)\n\t\t{\n\t\t\tlong long d = sign - sum;\n\t\t\tsum += d;\n\t\t\tcnt += abs(d);\n\t\t}\n\t\t\n\t\tsign *= -1;\n\t}\n\n\treturn cnt;\n}\n\nint main(void)\n{\n\tint n;\n\tcin >> n;\n\n\tvector<long long> a(n);\n\tfor(int i=0; i<n; i++)\n\t\tcin >> a[i];\n\n\tlong long sum[2];\n\tsum[0] = f(1, a);\n\tsum[1] = f(-1, a);\n\t\n\tcout << min(sum[0], sum[1]) << endl;\n\n\treturn 0;\n}\n", "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <math.h>\n#define MOD 1000000007\ntypedef long long ll;\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n ll a[n];\n\n for(int i=0;i<n;i++){\n cin>>a[i];\n }\n ll ans1=0,ans2=0;\n ll s=0;\n for(int i=0;i<n;i++){\n s+=a[i];\n if(i%2==0&&s<=0){\n ans1+=1-s;\n s=1ll;\n }else if(i%2==1&&s>=0){\n ans1+=s+1;\n s=-1ll;\n }\n }\n s=0;\n for(int i=0;i<n;i++){\n s+=a[i];\n if(i%2==1&&s<=0){\n ans2+=1-s;\n s=1ll;\n }else if(i%2==0&&s>=0){\n ans2+=s+1;\n s=-1ll;\n }\n }\n cout<<min(ans1,ans2)<<endl;\n return 0;\n}\n", "n=int(input())\nl=list(map(int,input().split()))\ncount1=0\ncount2=0\nsum1,sum2=0,0\nnow=1#一致させたい符号\nfor i in range(n):#第一項は正の時\n sum1+=l[i]\n if sum1*now>0:\n pass\n else:\n count1+=abs(now-sum1)\n sum1=now\n now*=-1\nnow=-1\nfor i in range(n):#第一項はhuの時\n sum2+=l[i]\n if sum2*now>0:\n pass\n else:\n count2+=abs(now-sum2)\n sum2=now\n now*=-1\nprint(min(count1,count2))", "n = int(input())\na = list(map(int,input().split()))\ndef calc(t):\n\tglobal a\n\tans = 0\n\ts = 0\n\tfor i in a:\n\t\ts += i\n\t\tif s * t <= 0:\n\t\t\tans += abs(s-t)\n\t\t\ts = t\n\t\tt *= -1\n\treturn ans\nprint(min(calc(1),calc(-1)))\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1e9;\nconst int MOD = 1e9 + 7;\n\nint main()\n{\n int n;\n cin >> n;\n vector<ll> a(n);\n for (auto &e : a)\n cin >> e;\n\n ll ans = 1e16;\n\n for (int i = 0; i < 2; ++i)\n {\n ll cnt = 0, sum = 0;\n for (int j = 0; j < n; ++j)\n {\n sum += a[j];\n if (j % 2 == i)\n {\n if (sum <= 0)\n {\n cnt += abs(sum) + 1;\n sum = 1;\n }\n }\n else\n {\n if (sum >= 0)\n {\n cnt += abs(sum) + 1;\n sum = -1;\n }\n }\n }\n ans = min(cnt, ans);\n }\n\n cout << ans << endl;\n\n return 0;\n}\n", "n=int(input())\nA=list(map(int,input().split()))\nans=10**15\nfor i in[-1,1]:\n ansi,sum=0,0\n for a in A:\n sum+=a\n if sum*i<=0:ansi+=abs(sum-i);sum=i\n i*=-1\n ans=min(ans,ansi)\nprint(ans)", "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\n\n static void solve() {\n int n = ni();\n int[] a = na(n);\n int[] b = a.clone();\n for (int i = 0; i < n; i++) {\n b[i] = -b[i];\n }\n\n System.out.println(Math.min(f(a), f(b)));\n }\n\n public static long f(int[] a) {\n int n = a.length;\n\n long sum = 0;\n long ret = 0;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (i % 2 == 0) {\n // +\n long d = Math.max(0, 1 - sum);\n sum += d;\n ret += d;\n } else {\n // -\n long d = Math.max(0, sum + 1);\n sum -= d;\n ret += d;\n }\n }\n return ret;\n }\n\n public static void main(String[] args) throws Exception {\n long S = System.currentTimeMillis();\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n solve();\n out.flush();\n long G = System.currentTimeMillis();\n tr(G-S+\"ms\");\n }\n\n private static boolean eof() {\n if(lenbuf == -1)return true;\n int lptr = ptrbuf;\n while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\n try {\n is.mark(1000);\n while(true){\n int b = is.read();\n if(b == -1){\n is.reset();\n return true;\n }else if(!isSpaceChar(b)){\n is.reset();\n return false;\n }\n }\n } catch (IOException e) {\n return true;\n }\n }\n\n private static byte[] inbuf = new byte[1024];\n static int lenbuf = 0, ptrbuf = 0;\n\n private static int readByte() {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\n private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private static double nd() { return Double.parseDouble(ns()); }\n private static char nc() { return (char)skip(); }\n\n private static String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private static char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private static char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private static int ni() {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "N=int(input())\nA=list(map(int,input().split()))\nans=10**15\nfor t in [1,-1]:\n r=0\n cnt=0\n T=t\n for i in range(N):\n r+=A[i]\n if(T>0 and r<=0):\n cnt+=1-r\n r+=1-r\n if(T<0 and r>=0):\n cnt+=r+1\n r-=r+1\n T*=-1\n ans=min(cnt,ans)\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[]a = new int[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t\tsc.close();\n\t\tlong c1 = 0;\n\t\tlong c2 = 0;\n\t\tlong sign = 1;\n\t\tlong sum = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(sum * sign <= 0) {\n\t\t\t\tc1 += Math.abs(sum) + 1;\n\t\t\t\tsum = sign;\n\t\t\t}\n\t\t\tsign *= -1;\n\t\t}\n\t\tsign = -1;\n\t\tsum = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(sum * sign <= 0) {\n\t\t\t\tc2 += Math.abs(sum) + 1;\n\t\t\t\tsum = sign;\n\t\t\t}\n\t\t\tsign *= -1;\n\t\t}\n\t\tSystem.out.println(Math.min(c1, c2));\n\t}\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n;\n\tlong sum1 = 0;\n\tlong sum2 = 0;\n\tlong op1 = 0;\n\tlong op2 = 0;\n\tcin >> n;\n\tfor(int i = 0; i <n; i++){\n\t\tint tmp;\n\t\tcin >> tmp;\n\t\tsum1 += tmp;\n\t\tsum2 += tmp;\n\t\tif(i%2){\n\t\t\tif(sum1 >= 0) {\n\t\t\t\top1 += sum1 + 1;\n\t\t\t\tsum1 = -1;\n\t\t\t}\n\t\t\tif(sum2 <= 0) {\n\t\t\t\top2 += -sum2 + 1;\n\t\t\t\tsum2 = 1;\n\t\t\t}\n\t\t} else {\n\t\t\tif(sum1 <= 0) {\n\t\t\t\top1 += -sum1 + 1;\n\t\t\t\tsum1 = 1;\n\t\t\t}\n\t\t\tif(sum2 >= 0) {\n\t\t\t\top2 += sum2 + 1;\n\t\t\t\tsum2 = -1;\n\t\t\t}\n\t\t}\n\t}\n\tif(op1 < op2) cout << op1;\n\telse cout << op2;\n\treturn 0;\n}\n\n", "N = int(input())\nA = tuple(map(int, input().split()))\n\n\ndef f(pm):\n ans, s = 0, 0\n for a in A:\n s += a\n if s * pm <= 0:\n d = abs(s - pm)\n ans += d\n s += d * pm\n pm *= -1\n return ans\n\n\nprint(min(f(1), f(-1)))\n", "#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\n\nint main(void) {\n long n;\n cin >> n;\n long a[n];\n for(int i=0;i<n;++i) {\n cin >> a[i];\n }\n long tmp1=0, tmp2=0;\n long ans1=0, ans2=0;\n\n for(int i=1;i<=n;++i){\n tmp1 += a[i-1];\n tmp2 += a[i-1];\n if(i%2){\n if(tmp1 <= 0){\n ans1 += 1 - tmp1;\n tmp1 = 1;\n }\n if(tmp2 >= 0){\n ans2 += 1 + tmp2;\n tmp2 = -1;\n }\n }\n else{\n if(tmp1 >= 0){\n ans1 += 1 + tmp1;\n tmp1 = -1;\n }\n if(tmp2 <= 0){\n ans2 += 1 - tmp2;\n tmp2 = 1;\n }\n }\n }\n cout << min(ans1, ans2) << endl;\n}\n", "import java.util.*;\nimport java.awt.*;\nimport static java.lang.System.*;\nimport static java.lang.Math.*;\npublic class Main {\n public static void main(String[]$) {\n Scanner sc = new Scanner(in);\n int n=sc.nextInt();\n long[] a=new long[n];\n long ans1=0,ans2=0;\n for (int i = 0; i < n; i++) {\n a[i]=sc.nextLong();\n }\n long temp1=0,temp2=0;\n for (int i = 0; i <n; i++) {\n //ans1:a[0]を負とする場合\n temp1+=a[i];\n temp2+=a[i];\n if(i%2==0){\n //負にする\n if(temp1>=0) {\n ans1 += temp1 + 1;\n temp1 = -1;\n }\n //正にする\n if(temp2<=0) {\n ans2 +=1-temp2;\n temp2 = 1;\n }\n }else{\n //正にする\n if(temp1<=0){\n ans1+=1-temp1;\n temp1=1;\n }\n //負にする\n if(temp2>=0){\n ans2+=1+temp2;\n temp2=-1;\n }\n }\n }\n out.println(min(ans1,ans2));\n }\n}", "n=int(input())\na_list=[int(i) for i in input().split()]\n\nans=10**20\nfor flg in (-1,1):\n c=0\n s=0\n for a in a_list:\n s+=a\n if s==0:\n c+=1\n s=flg\n if s//abs(s)!=flg:\n c+=abs(s)+1\n s=flg\n flg*=-1\n ans=min(ans,c)\nprint(ans)", "n=int(input())\nnum = list(map(int, input().split()))\n\ndef culc(pattern):\n sum=0\n cost=0\n for i in range(n):\n sum+=num[i]\n if i%2==pattern:\n if sum>=0:\n cost+=sum+1\n sum=-1\n else:\n if sum<=0:\n cost+=-sum+1\n sum=1\n #print(\"sum is \", sum, \"cost is \", cost)\n #print(\"\")\n return cost\n\n\nprint(min(culc(0), culc(1)))", "def sign(X):\n return [-1,0,1][(X>=0)+(X>0)]\n\nN = int(input())\nA = [int(T) for T in input().split()]\n\nAFPCnt = 0\nAFPNow = 0\nfor TFP in range(0,N):\n AFPNow += A[TFP]\n if sign(AFPNow)!=(-1)**TFP:\n AFPCnt += abs(AFPNow)+1\n AFPNow = (-1)**TFP\n\nAFFCnt = 0\nAFFNow = 0\nfor TFF in range(0,N):\n AFFNow += A[TFF]\n if sign(AFFNow)!=(-1)**(TFF+1):\n AFFCnt += abs(AFFNow)+1\n AFFNow = (-1)**(TFF+1)\nprint(min(AFPCnt,AFFCnt))", "_,*l=map(int,open(0).read().split())\ndef f(s):\n c=t=0\n for i in l:\n t+=i\n if s*t<=0: c+=abs(t-s); t=s\n s*=-1\n return c\nprint(min(f(1),f(-1)))", "#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n#include <cstdint>\n \nint main() {\n\tint n;\n\tstd::cin >> n;\n \n\tstd::vector<int> vec(n);\n \n\tfor (auto&& e : vec)\n\t\tstd::cin >> e;\n \n\tauto solve = [&](bool positive) {\n\t\tint64_t ret = 0;\n \n\t\tint sum = 0;\n\t\tfor (int i = 0; i < vec.size(); ++i) {\n\t\t\tsum += vec[i];\n \n\t\t\tif (sum == 0 || positive != sum > 0) {\n\t\t\t\tret += std::abs(sum) + 1;\n\t\t\t\tsum = (positive ? 1 : -1);\n\t\t\t}\n\t\t\t\n\t\t\tpositive = !positive;\n\t\t}\n \n\t\treturn ret;\n\t};\n \n\tstd::cout << std::min(solve(true), solve(false)) << std::endl;\n}", "n=int(input())\na=list(map(int,input().split()))\nm=0\ncurr=1\nans=0\nfor i in range(n):\n m+=a[i]\n if curr*m<=0:\n ans+=1-curr*m\n m=curr\n curr=-1*curr\nans2=0\nm=0\ncurr=-1\nfor i in range(n):\n m+=a[i]\n if curr*m<=0:\n ans2+=1-curr*m\n m=curr\n curr=-1*curr\nprint(min(ans,ans2))", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n \npublic class Main {\n\tstatic final long MOD1=1000000007;\n\tstatic final long MOD2=998244353;\n\tpublic static void main(String[] args) {\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tInputReader sc=new InputReader(System.in);\n\t\tint N=sc.nextInt();\n\t\tlong[] a=sc.nextLongArray(N);\n\t\tlong sum=0;\n\t\tlong ans=0;\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tif (i%2==0) {\n\t\t\t\tif (sum+a[i]>0) {\n\t\t\t\t\tsum+=a[i];\n\t\t\t\t}else {\n\t\t\t\t\tans+=-(sum+a[i])+1;\n\t\t\t\t\tsum=1;\n\t\t\t\t}\n\t\t\t}else {\n\t\t\t\tif (sum+a[i]<0) {\n\t\t\t\t\tsum+=a[i];\n\t\t\t\t}else {\n\t\t\t\t\tans+=(sum+a[i])+1;\n\t\t\t\t\tsum=-1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans1=0;\n\t\tsum=0;\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tif (i%2==1) {\n\t\t\t\tif (sum+a[i]>0) {\n\t\t\t\t\tsum+=a[i];\n\t\t\t\t}else {\n\t\t\t\t\tans1+=-(sum+a[i])+1;\n\t\t\t\t\tsum=1;\n\t\t\t\t}\n\t\t\t}else {\n\t\t\t\tif (sum+a[i]<0) {\n\t\t\t\t\tsum+=a[i];\n\t\t\t\t}else {\n\t\t\t\t\tans1+=(sum+a[i])+1;\n\t\t\t\t\tsum=-1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(ans, ans1));\n\t}\n\t\tstatic class InputReader { \n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n \n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n \n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n \n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n \n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n \n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n \n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "\nn = int(input())\na = list(map(int, input().split(\" \")))\n\n\ndef solve(s1, s2):\n \"if start == true, assume the first of the sum is positive.\"\n res = 0\n sum = 0\n for i in range(n):\n sum += a[i]\n if sum <= 0 and i % 2 == s1:\n res += abs(sum) + 1\n sum = 1\n elif sum >= 0 and i % 2 == s2:\n res += abs(sum) + 1\n sum = -1\n return res\n\n\nprint(min(solve(0, 1), solve(1, 0)))\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.run();\n\t}\n\tpublic void run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n= sc.nextInt();\n\t\tlong sum1=0;\n\t\tlong sum2=0;\n\t\tlong ans1=0;\n\t\tlong ans2=0;\n\t\tfor(long i=0; i<n; i++) {\n\t\t\tlong a = sc.nextLong();\n\t\t\tsum1 += a;\n\t\t\tsum2 += a;\n\t\t\tif(i%2==0) {\n\t\t\t\tif(sum1 <= 0) {\n\t\t\t\t\tans1 += (1-sum1);\n\t\t\t\t\tsum1=1;\n\t\t\t\t}\n\t\t\t\tif(sum2 >= 0) {\n\t\t\t\t\tans2 += sum2+1;\n\t\t\t\t\tsum2=-1;\n\t\t\t\t}\n\t\t\t}else {\n\t\t\t\tif(sum1 >= 0) {\n\t\t\t\t\tans1 += sum1+1;\n\t\t\t\t\tsum1 = -1;\n\t\t\t\t}\n\t\t\t\tif(sum2 <= 0) {\n\t\t\t\t\tans2 += (1-sum2);\n\t\t\t\t\tsum2 = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t\tsc.close();\n\t}\n\n}\n\n\n", "n = int(input())\na = list(map(int, input().split()))\n\ndef f(a, sgn):\n cnt = 0\n s = 0\n for i in range(n):\n s += a[i]\n sgn *= (-1) #判定する符号は交互に変わる\n if s * sgn <= 0: #sgn一致しなければその積は負\n x = s + sgn*(-1)\n s -= x\n cnt += abs(x)\n \n return cnt\nans = min(f(a, 1), f(a, -1))\nprint(ans)", "#include <iostream>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\nll s1, s2, c1, c2;\nint main() {\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\tll n, a;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++) {\n\t\tcin >> a;\n\t\ts1 += a;\n\t\ts2 += a;\n\t\tif (i % 2) {\n\t\t\tif (s1 <= 0) c1 += 1 - s1,s1 = 1;\n\t\t\tif (s2 >= 0) c2 += 1 + s2,s2 = -1;\n\t\t}\n\t\telse {\n\t\t\tif (s1 >= 0) c1 += 1 + s1,s1 = -1;\n\t\t\tif (s2 <= 0) c2 += 1 - s2,s2 = 1;\n\t\t}\n\t}\n\tcout << min(c1, c2) << endl;\n\treturn 0;\n}", "\nimport java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint num_count = sc.nextInt();\n\n\t\tlong[] array = new long[num_count];\n\n\t\tfor(int i = 0;i < num_count;i++){\n\t\t\tarray[i] = sc.nextInt();\n\t\t}\n\n\t\tlong ans1 = 0,sum = 0;\n\n\t\tfor(int i = 0;i < num_count;i++){\n\t\t\tif(i % 2 == 0 && (sum + array[i]) <= 0){\n\t\t\t\tlong cost = 1 - (sum + array[i]);\n\t\t\t\tans1 += cost;\n\t\t\t\tsum = 1;\n\t\t\t}else if(i % 2 == 1 && (sum + array[i]) >= 0){\n\t\t\t\tlong cost = 1 + (sum + array[i]);\n\t\t\t\tans1 += cost;\n\t\t\t\tsum = -1;\n\t\t\t}else{\n\t\t\t\tsum += array[i];\n\t\t\t}\n\t\t}\n\n\t\tlong ans2 = 0;\n\t\tsum = 0;\n\n\n\t\tfor(int i = 0;i < num_count;i++){\n\t\t\tif(i % 2 == 1 && (sum + array[i]) <= 0){\n\t\t\t\tlong cost = 1 - (sum + array[i]);\n\t\t\t\tans2 += cost;\n\t\t\t\tsum = 1;\n\t\t\t}else if(i % 2 == 0 && (sum + array[i]) >= 0){\n\t\t\t\tlong cost = 1 + (sum + array[i]);\n\t\t\t\tans2 += cost;\n\t\t\t\tsum = -1;\n\t\t\t}else{\n\t\t\t\tsum += array[i];\n\t\t\t}\n\t\t}\n\n\t\tlong min_ans = ans1 < ans2 ? ans1 : ans2;\n\t\tSystem.out.println(min_ans);\n\t}\n}\n", "n = int(input())\narray = list(map(int, input().split()))\n\ntotal = 0\nflag = -1\nminus = 0\nfor tmp in range(len(array)):\n total += array[tmp]\n if total * flag <= 0:\n minus += abs(total*flag)+1\n total = flag\n flag *= -1\n\ntotal = 0\nflag = 1\nplus = 0\nfor tmp in range(len(array)):\n total += array[tmp]\n if total * flag <= 0:\n plus += abs(total*flag)+1\n total = flag\n flag *= -1\n\nprint(min(minus, plus))", "#include <iostream>\n#include <cmath>\nusing namespace std;\nint main(){\n int n;cin>>n;\n int a[n];\n for(int i = 0; n > i; i++)cin>>a[i];\n long long sh = 0;\n long long nw = 0;\n for(int i = 0; n > i; i++){\n nw = (long long)nw+a[i];\n if(i % 2 == 0)if(nw<=0)sh = (long long)sh+1-nw,nw=1;\n if(i % 2 == 1)if(nw>=0)sh = (long long)sh+nw+1,nw=-1;\n }\n long long hs = 0;\n nw = 0;\n for(int i = 0; n > i; i++){\n nw = (long long)nw+a[i];\n if(i % 2 == 1)if(nw<=0)hs = (long long)hs+1-nw,nw=1;\n if(i % 2 == 0)if(nw>=0)hs = (long long)hs+nw+1,nw=-1;\n }\n cout << min(hs,sh) << endl;\n}", "import java.util.Scanner;\n\nclass Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\n\t\tint[] a = new int[n];\n\n\t\tfor(int i=0; i<n; i++){\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\n\t\tint[] a_sum = new int[n];\n\n\t\ta_sum[0] = a[0];\n\t\tfor(int i=1; i<n; i++){\n\t\t\ta_sum[i] = a_sum[i-1] + a[i];\n\t\t}\n\t\t\n\t\tint[] a_sum_copy = new int[n];\n\t\tfor(int i=0; i<n; i++){\n\t\t\ta_sum_copy[i] = a_sum[i];\n\t\t}\n\n\t\t//奇数番目までの和を正に、偶数番目までの和を負にする\n\t\tlong cnt1 = 0;\n\t\tlong cnt2 = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\ta_sum[i] += cnt1 + cnt2;\n\t\t\tif(i%2==0){\n\t\t\t\tif(a_sum[i]<0){\n\t\t\t\t\tcnt1 += (-a_sum[i]) + 1;\n\t\t\t\t\ta_sum[i] = 1;\n\t\t\t\t}else if(a_sum[i]==0){\n\t\t\t\t\tcnt1 += 1;\n\t\t\t\t\ta_sum[i] = 1;\n\t\t\t\t}\n\t\t\t}else if(i%2==1){\n\t\t\t\tif(a_sum[i]>0){\n\t\t\t\t\tcnt2 -= a_sum[i] + 1;\n\t\t\t\t\ta_sum[i] = -1;\n\t\t\t\t}else if(a_sum[i]==0){\n\t\t\t\t\tcnt2 -= 1;\n\t\t\t\t\ta_sum[i] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//奇数番目までの和を負に、偶数番目までの和を正にする\n\t\tlong cnt3 = 0;\n\t\tlong cnt4 = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\ta_sum_copy[i] += cnt3 + cnt4;\n\t\t\tif(i%2==1){\n\t\t\t\tif(a_sum_copy[i]<0){\n\t\t\t\t\tcnt3 += (-a_sum_copy[i]) + 1;\n\t\t\t\t\ta_sum_copy[i] = 1;\n\t\t\t\t}else if(a_sum_copy[i]==0){\n\t\t\t\t\tcnt3 += 1;\n\t\t\t\t\ta_sum_copy[i] = 1;\n\t\t\t\t}\n\t\t\t}else if(i%2==0){\n\t\t\t\tif(a_sum_copy[i]>0){\n\t\t\t\t\tcnt4 -= a_sum_copy[i] + 1;\n\t\t\t\t\ta_sum_copy[i] = -1;\n\t\t\t\t}else if(a_sum_copy[i]==0){\t\t\t\t\t\n\t\t\t\t\tcnt4 -= 1;\n\t\t\t\t\ta_sum_copy[i] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(cnt1-cnt2>cnt3-cnt4){\n\t\t\tSystem.out.print(cnt3-cnt4);\n\t\t}else{\n\t\t\tSystem.out.print(cnt1-cnt2);\n\t\t}\n\n\t}\n\n}\n", "#include <iostream>\n#include <algorithm>\nusing namespace std;\nlong long n,no,ans,notw,anstw;\n\nint main(){\n\tcin>>n;\n\tint a;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a;\n\t\tif(no>0){\n\t\t\tno+=a;\n\t\t\tif(no>=0){\n\t\t\t\tans+=no+1;\n\t\t\t\tno=-1;\n\t\t\t}\n\t\t}else{\n\t\t\tno+=a;\n\t\t\tif(no<=0){\n\t\t\t\tans+=no*-1+1;\n\t\t\t\tno=1;\n\t\t\t}\n\t\t}\n\t\tif(notw>=0){\n\t\t\tnotw+=a;\n\t\t\tif(notw>=0){\n\t\t\t\tanstw+=notw+1;\n\t\t\t\tnotw=-1;\n\t\t\t}\n\t\t}else{\n\t\t\tnotw+=a;\n\t\t\tif(notw<=0){\n\t\t\t\tanstw+=notw*-1+1;\n\t\t\t\tnotw=1;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<min(ans,anstw)<<endl;\n\treturn 0;\n}", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n static final Scanner sc = new Scanner(System.in);\n static final int MOD = (int) 1E9 + 7;\n static final long INF_L = (long) 4E18;\n\n public static void main(String[] args) {\n int n = nint();\n int[] a = nints(n);\n \n long ans = min(solve(a, false), solve(a, true));\n System.out.println(ans);\n }\n \n static long solve(int[] a, boolean posSum_) {\n boolean posSum = posSum_; // trueなら偶数項目(0-indexed)までの和が正であるべき\n long sum = 0;\n long count = 0;\n \n for (int i = 0; i < a.length; i++) {\n long sumBuff = sum;\n sum += a[i];\n if (posSum && sum > 0 || !posSum && sum < 0) {\n // do nothing\n } else {\n sum = posSum ? 1 : -1;\n count += abs(-a[i] + sum - sumBuff);\n }\n posSum = !posSum;\n }\n return count;\n }\n\n @Deprecated\n static int nint() {\n return sc.nextInt();\n }\n\n @Deprecated\n static int[] nints(int N) {\n return nints(N, 0, 0);\n }\n\n @Deprecated\n private static int[] nints(int N, int padL, int padR) {\n int[] a = new int[padL + N + padR];\n for (int i = 0; i < N; i++)\n a[padL + i] = nint();\n return a;\n }\n\n static long nlong() {\n return sc.nextLong();\n }\n\n static long[] nlongs(int N) {\n return nlongs(N, 0, 0);\n }\n\n static long[] nlongs(int N, int padL, int padR) {\n long[] a = new long[padL + N + padR];\n for (int i = 0; i < N; i++)\n a[padL + i] = nlong();\n return a;\n }\n\n static double ndouble() {\n return sc.nextDouble();\n }\n\n static double[] ndoubles(int N) {\n return ndoubles(N, 0, 0);\n }\n\n static double[] ndoubles(int N, int padL, int padR) {\n double[] d = new double[N + padL + padR];\n for (int i = 0; i < N; i++) {\n d[padL + i] = ndouble();\n }\n return d;\n }\n\n static String nstr() {\n return sc.next();\n }\n\n static char[] nchars() {\n return sc.next().toCharArray();\n }\n\n static char[] nchars(int padL, int padR) {\n char[] temp = sc.next().toCharArray();\n char[] ret = new char[temp.length + padL + padR];\n System.arraycopy(temp, 0, ret, padL, temp.length);\n return ret;\n }\n\n static char[][] nchars2(int H, int W) {\n return nchars2(H, W, 0, 0);\n }\n\n static char[][] nchars2(int H, int W, int padLU, int padRD) {\n char[][] a2 = new char[H + padLU + padRD][W + padLU + padRD];\n for (int i = 0; i < H; i++)\n System.arraycopy(nchars(), 0, a2[padLU + i], padLU, W);\n return a2;\n }\n\n static long min(long... ls) {\n return Arrays.stream(ls).min().getAsLong();\n }\n\n static long max(long... ls) {\n return Arrays.stream(ls).max().getAsLong();\n }\n\n static long abs(long a) {\n return Math.abs(a);\n }\n}\n", "n = int(input())\na = [int(n) for n in input().split()]\n\n\ndef calcSteps(sign):\n res = 0\n s = 0\n for i in range(n):\n if (s+a[i])*sign < 0:\n s += a[i]\n else:\n step = -s -sign -a[i]\n res += abs(step)\n s = -sign\n sign *= -1\n return res\n\n\n\nprint(min(calcSteps(-1),calcSteps(1)))\n\n\n", "#include<iostream>\n#include<vector>\nusing namespace std;\nint main(){\n int n,i;\n cin>>n;\n vector<long long>a(n+1);\n for(i=1;i<=n;i++)cin>>a[i];\n for(i=1;i<n;i++)a[i+1]+=a[i];\n long o=0,oc=0,e=0,ec=0;\n for(i=1;i<=n;i++){\n if(i%2){\n if(a[i]+o<1)oc+=1-a[i]-o,o+=1-a[i]-o;\n if(a[i]+e>-1)ec+=1+a[i]+e,e-=1+a[i]+e; \n }\n else{\n if(a[i]+o>-1)oc+=1+a[i]+o,o-=1+a[i]+o;\n if(a[i]+e<1)ec+=1-a[i]-e,e+=1-a[i]-e; \n }\n }\n cout<<min(oc,ec)<<endl;\n return 0;\n}", "n = int(input())\na = list(map(int, input().split()))\nnum1, num2 = 0, 0\ns = 0\nfor i in range(n):\n s += a[i]\n if i % 2 == 0 and s <= 0:\n num1 += 1 - s\n s = 1\n elif i % 2 == 1 and s >= 0:\n num1 += s + 1\n s = -1\n\ns = 0\nfor i in range(n):\n s += a[i]\n if i % 2 == 1 and s <= 0:\n num2 += 1 - s\n s = 1\n elif i % 2 == 0 and s >= 0:\n num2 += s + 1\n s = -1\n\nprint(min(num1, num2))", "n = int(input())\na = list(map(int, input().split()))\n\ndef solve(a, n, bool): # bool = True: 偶数項を足した時に正\n change = 0\n sum = 0\n for i in range(n):\n sum+=a[i]\n if sum <= 0 and bool: # 和が正を仮定しているのに0以下なら\n change += abs(1-sum)\n sum=1\n if sum >=0 and not bool:\n change += abs(-1-sum)\n sum=-1 \n bool = not bool\n return change\n\nprint(min(solve(a,n,True),solve(a,n,False)))", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\n#define rep(i, n) for(ll i = 0;i < n;i++)\n\nint main() {\n cin.tie(0); ios::sync_with_stdio(false);\n\n int n;\n cin >> n;\n int a[100000];\n rep(i, n) cin >> a[i];\n\n ll ans = 1LL<<62;\n ll sum[100001] = {};\n\n // parity\n rep(p, 2) {\n ll cnt = 0;\n rep(i, n) {\n int border = 1+(p+i)%2*-2;\n sum[i+1] = sum[i] + a[i];\n if (border == 1 && sum[i+1] >= border) continue;\n if (border == -1 && sum[i+1] <= border) continue;\n cnt += abs(border-sum[i+1]);\n sum[i+1] = border;\n }\n ans = min(ans, cnt);\n }\n\n cout << ans << endl;\n}\n", "n = int(input())\nA = list(map(int,input().split()))\nans = 10**15\n\nfor i in [-1,1]:\n ansi,sum=0,0\n for a in A:\n sum+=a\n if sum*i<=0:\n ansi+=abs(sum-i)\n sum=i\n i*=-1\n ans=min(ans,ansi)\nprint(ans)", "N = int(input())\nA = [int(x) for x in input().split()]\n\ndef F(A, sgn):\n cnt = 0\n cum = 0\n for a in A:\n sgn *= -1\n cum += a\n if cum * sgn > 0:\n continue\n if sgn > 0:\n cnt += 1 - cum\n cum = 1\n else:\n cnt += cum + 1\n cum = -1\n return cnt\n\nanswer = min(F(A,1), F(A,-1))\nprint(answer)", "n=int(input())\na=list(map(int,input().split()))\nc=0\nd=0\ne=0\nf=0\nfor i in range(n):\n k=a[i]\n e+=k\n f+=k\n if i%2==0:\n if e<=0:\n c+=1-e\n e=1\n if f>=0:\n d+=f+1\n f=-1\n else:\n if e>=0:\n c+=1+e\n e=-1\n if f<=0:\n d+=1-f\n f=1\nprint(min(c,d))", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tlong sumi = 0;\n\t\tlong sumi1 = 0;\n\t\tlong countPlus = 0;\n\t\tlong countMinus = 0;\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ta[i] = Long.valueOf(scan.next());\n\t\t}\n\t\t\n\t\t// 奇数がプラス\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tsumi1 = sumi + a[i];\n\t\t\tif((i + 1) % 2 == 1) {\n\t\t\t\tif(sumi1 <= 0) {\n\t\t\t\t\tcountPlus += Math.abs(sumi1) + 1;\n\t\t\t\t\tsumi1 += Math.abs(sumi1) + 1;\n\t\t\t\t}\n\t\t\t} else if((i + 1) % 2 == 0) {\n\t\t\t\tif(sumi1 >= 0) {\n\t\t\t\t\tcountPlus += Math.abs(sumi1) + 1;\n\t\t\t\t\tsumi1 -= Math.abs(sumi1) + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsumi = sumi1;\n\t\t}\n\t\tsumi = 0;\n\t\tsumi1 = 0;\n\t\t\n\t\t// 奇数がマイナス\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tsumi1 = sumi + a[i];\n\t\t\tif((i + 1) % 2 == 1) {\n\t\t\t\tif(sumi1 >= 0) {\n\t\t\t\t\tcountMinus += Math.abs(sumi1) + 1;\n\t\t\t\t\tsumi1 -= Math.abs(sumi1) + 1;\n\t\t\t\t}\n\t\t\t} else if((i + 1) % 2 == 0) {\n\t\t\t\tif(sumi1 <= 0) {\n\t\t\t\t\tcountMinus += Math.abs(sumi1) + 1;\n\t\t\t\t\tsumi1 += Math.abs(sumi1) + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsumi = sumi1;\n\t\t}\n\t\t\n\t\tif(countPlus < countMinus) {\n\t\t\tSystem.out.println(countPlus);\n\t\t} else {\n\t\t\tSystem.out.println(countMinus);\n\t\t}\n\t\t\n\t\tscan.close();\n\n\t}\n\n}\n", "#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<climits>\n#include<iostream>\n#include<sstream>\n#include<utility>\n#include<map>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<set>\n#include<stack>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int>P;\nint A[100005],N;\n\nll ch(int p)\n{\n\tll t=0,r=0;\n\tfor(int i=0;i<N;i++,p*=-1)\n\t{\n\t\tt+=A[i];\n\t\tif(t*p<=0)\n\t\t{\n\t\t\tif(p==-1){r+=abs(-1-t);t=-1;}\n\t\t\telse {r+=abs(1-t);t=1;}\n\t\t}\n\t}\n\treturn r;\n}\n\nint main()\n{\n\tscanf(\"%d\",&N);\n\tfor(int i=0;i<N;i++)scanf(\"%d\",&A[i]);\n\tprintf(\"%lld\\n\",min(ch(1),ch(-1)));\n\treturn 0;\n}", "n=int(input())\nA=list(map(int,input().split()))\nans=10**30\nfor t in range(2):\n a=0\n s=0\n for i in range(n):\n a+=A[i]\n if t and a<=0:\n s+=-a+1\n a=1\n t=0\n elif not(t) and a>=0:\n s+=a+1\n a=-1\n t=1\n else:\n t=1-t\n ans=min(s,ans)\nprint(ans)\n", "n = int(input())\na = list(map(int, input().split()))\n\ndef solve(a, t):\n ans = 0\n x = 0\n for i in a:\n x += i\n if t==True and x<1:\n ans += 1-x\n x = 1\n elif t==False and x>-1:\n ans += x+1\n x = -1\n t = not t\n return ans\n\nprint(min(solve(a,True), solve(a,False)))", "N = int(input())\nnums = list(map(int, input().split()))\nans = 10**14\nfor start in [-1, 1]:\n before = start\n cnt = 0\n sum_n = 0\n for num in nums:\n sum_n += num\n if before*sum_n >= 0:\n if before < 0:\n cnt += abs(1-sum_n)\n sum_n = 1\n else:\n cnt += abs(-1-sum_n)\n sum_n = -1\n before = sum_n\n ans = min(ans, cnt)\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] a = new long[n];\n for(int i =0; i<n; i++) {\n a[i] = sc.nextLong();\n }\n long num1 = 0;\n long tmp1 = 0;\n //+-+-\n for(int i=0; i<n; i++) {\n tmp1 += a[i];\n if(i % 2 == 0) {\n if(tmp1 <= 0) {\n num1 += Math.abs(tmp1) + 1;\n tmp1 += Math.abs(tmp1) + 1;\n }\n } else {\n if(tmp1 >= 0) {\n num1 += Math.abs(tmp1) + 1;\n tmp1 -= Math.abs(tmp1) + 1;\n }\n }\n }\n\n long num2 = 0;\n long tmp2 = 0;\n //-+-+\n for(int i=0; i<n; i++) {\n tmp2 += a[i];\n if(i % 2 == 0) {\n if(tmp2 >= 0) {\n num2 += Math.abs(tmp2) + 1;\n tmp2 -= Math.abs(tmp2) + 1;\n }\n } else {\n if(tmp2 <= 0) {\n num2 += Math.abs(tmp2) + 1;\n tmp2 += Math.abs(tmp2) + 1;\n }\n }\n }\n System.out.println(Math.min(num1,num2));\n }\n}\n", "#include <iostream>\n#include <vector>\n\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll n, ans1{}, ans2{}, s1{}, s2{}, t[2] = {1,-1};;\n cin >> n;\n vector<ll> a(n);\n for (ll &x: a) cin >> x;\n for (int i = 0; i != n; ++i) {\n s1 += a[i];\n s2 += a[i];\n auto p = t[i%2];\n if (s1 * p <= 0) {\n ans1 += abs(p - s1);\n s1 = p;\n }\n if (s2 * -p <= 0) {\n ans2 += abs(p + s2);\n s2 = -p;\n }\n }\n cout << min(ans1,ans2) << endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long lint;\n\nconst int MAX_N = 1e5;\nlint N, a[MAX_N+5];\n\nlint solve(lint next){\n lint s = 0, cnt = 0;\n for(int i=0;i<N;i++){\n s += a[i];\n if(next==1 && s<=0){\n cnt += next - s; s = 1;\n }else if(next==-1 && s>=0){\n cnt += s - next; s = -1;\n }\n next *= -1;\n }\n \n return cnt;\n}\n\nint main(){\n cin >> N;\n for(int i=0;i<N;i++) cin >> a[i];\n \n cout << min(solve(1), solve(-1)) << endl;\n return 0;\n}", "def k(n, a, p):\n x = 0\n c = 0\n for i in range(n):\n s = x + a[i]\n if p and s > 0 or not p and s < 0: x = s\n else:\n c += abs(s) + 1\n if p: x = 1\n else: x = -1\n p = not p\n return c\n\nn = int(input())\na = [int(x) for x in input().split()]\nprint(min(k(n, a, True), k(n, a, False)))", "import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint n = scanner.nextInt();\n\t\t\tlong[] a = new long[n];\n\t\t\tIntStream.range(0, n).forEach(i -> a[i] = scanner.nextLong());\n\t\t\t// sum1=[1,-1,...], sum2=[-1,1,...]\n\t\t\tint[] sum1 = new int[n], sum2 = new int[n];\n\t\t\tArrays.fill(sum1, 1);\n\t\t\tArrays.fill(sum2, -1);\n\t\t\tIntStream.range(0, n / 2).forEach(i -> {\n\t\t\t\tsum1[2 * i + 1] = -1;\n\t\t\t\tsum2[2 * i + 1] = 1;\n\t\t\t});\n\t\t\tSystem.out.println(Math.min(getResult(a, sum1), getResult(a, sum2)));\n\t\t}\n\t}\n\n\t/**\n\t * @param a 数値配列\n\t * @param sum 変更したい合計値の配列\n\t * @return 変更すべきステップ数\n\t */\n\tprivate static long getResult(final long[] a, final int[] sum) {\n\t\tint n = a.length;\n\t\tlong now = 0, result = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnow += a[i];\n\t\t\tif (sum[i] * now <= 0) {\n\t\t\t\tresult += Math.abs(sum[i] - now);\n\t\t\t\tnow = sum[i];\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n}\n", "n = int(input())\na = [int(i) for i in input().split()]\nb = a[::]\nans1 = ans2 = 0\nsign = 1\ntotal = 0\nfor i in range(n):\n total += a[i]\n if total * sign <= 0:\n k = abs(total - sign)\n ans1 += k\n total = sign\n sign *= -1\n\nsign = -1\ntotal = 0\nfor i in range(n):\n total += b[i]\n if total * sign <= 0:\n k = abs(total - sign)\n ans2 += k\n total = sign\n sign *= -1\nprint(min(ans1, ans2)) ", "n = int(input())\nA = list(map(int, input().split()))\nans1 = 0\nacc = 0\nd = 1\nfor a in A:\n if (acc + a) * d > 0:\n acc += a\n else:\n ans1 += abs(1 - (acc + a) * d)\n acc = d\n d *= -1\nans2 = 0\nacc = 0\nd = -1\nfor a in A:\n if (acc + a) * d > 0:\n acc += a\n else:\n ans2 += abs(1 - (acc + a) * d)\n acc = d\n d *= -1\nprint(min(ans1, ans2))", "import java.util.Scanner;\n\npublic class Main {\n public static void main (String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n long[] a = new long[n+1];\n long[] b = new long[n+1];\n long ans1 =0, ans2 =0,total =0;\n \n //a[1]を+とするケース\n for (int i =1; i<=n; i++) {\n a[i] = Long.parseLong(sc.next());\n b[i] = a[i];\n total += a[i];\n if (i % 2 == 1 && total <=0) {\n long p = 1 - total;\n ans1 += p; \n total -= a[i]; \n a[i] += p; \n total += a[i]; \n }\n if (i % 2 == 0 && total >=0) {\n long p = 1 + total;\n ans1 += p; \n total -= a[i]; \n a[i] -= p; \n total += a[i]; \n }\n }\n \n total =0;\n \n //a[1]を-とするケース\n for (int i =1; i<=n; i++) {\n total += b[i];\n if (i % 2 == 0 && total <=0) {\n long p = 1 - total;\n ans2 += p;\n total -= b[i];\n b[i] += p;\n total += b[i];\n }\n if (i % 2 == 1 && total >=0) {\n long p = 1 + total;\n ans2 += p;\n total -= b[i];\n b[i] -= p;\n total += b[i];\n }\n \n } \n System.out.print(Math.min(ans1,ans2));\n }\n}", "\nimport java.io.*;\nimport java.util.*;\nimport java.lang.*;\n\npublic class Main {\n static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n public static void main(String[] args) {\n FastScanner fs = new FastScanner();\n int n = fs.nextInt();\n long[] a = new long[n];\n for (int i = 0; i < n; ++i) {\n a[i] = fs.nextLong();\n }\n// a[0] = fs.nextLong();\n// a[1] = fs.nextLong();\n// long ans = 0L;\n// long sum = 0L;\n// if (a[0] == 0 && a[1] > a[0]) {\n// sum = -1L;\n// ans += 1;\n// } else if (a[0] == 0 && a[1] < a[0]) {\n// sum = 1L;\n// ans += 1;\n// } else {\n// sum = a[0];\n// }\n// if (check(sum, sum + a[1])) {\n// sum += a[1];\n// } else {\n// if (sum > 0) {\n// ans += (sum + a[1] + 1L);\n// sum = -1L;\n// } else {\n// ans += (1L - sum - a[1]);\n// sum = 1L;\n// }\n// }\n// for (int i = 2; i < n; ++i) {\n// a[i] = fs.nextLong();\n// if (check(sum, sum + a[i])) {\n// sum += a[i];\n// } else {\n// if (sum > 0) {\n// ans += (sum + a[i] + 1L);\n// sum = -1L;\n// } else {\n// ans += (1L - sum - a[i]);\n// sum = 1L;\n// }\n// }\n// }\n long ans = Math.min(helper(n, a, true), helper(n, a, false));\n System.out.println(ans);\n }\n\n private static long helper(int n, long[] a, boolean positive) {\n long sum = 0L;\n long ans = 0L;\n for (int i = 0; i < n; ++i) {\n if (positive) {\n if (sum + a[i] <= 0) {\n ans += (1L - sum - a[i]);\n sum = 1L;\n } else {\n sum += a[i];\n }\n } else {\n if (sum + a[i] >= 0) {\n ans += (sum + a[i] + 1L);\n sum = -1L;\n } else {\n sum += a[i];\n }\n }\n positive = !positive;\n }\n return ans;\n }\n\n private static boolean check(long prev, long sum) {\n if (prev > 0 && sum < 0) {\n return true;\n } else if (prev < 0 && sum > 0) {\n return true;\n }\n return false;\n }\n}\n", "#include <iostream>\n#include <cstdio>\nusing namespace std;\n\ntypedef long long ll;\nconst int MAX = 1e5;\n\nint n;\nint a[MAX];\n\nll solve(bool flag, ll sum) {\n ll res = 0;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (flag) {\n if (sum >= 0) {\n res += sum + 1;\n sum = -1;\n }\n } else {\n if (sum <= 0) {\n res += -sum + 1;\n sum = 1;\n }\n }\n flag = !flag;\n }\n\n return res;\n}\n\nint main() {\n cin >> n;\n for (int i = 0; i < n; i++) scanf(\"%d\", a + i);\n\n // 貪欲法で操作回数の最小値を求める\n // プラスから始まるパターンとマイナスから始まるパターンの2パターン試して、その小さい方が答え\n cout << min(solve(true, 0), solve(false, 0)) << endl;\n return 0;\n}\n", "n = int(input())\na = list(map(int,input().split()))\nsum1 = sum2 = cost1 = cost2 = 0\nfor i in range(n):\n cur = a[i]\n sum1 += cur\n if (sum1<=0, sum1>=0)[i%2]:\n cost1 += 1+sum1*[-1,1][i%2]\n sum1 = [1,-1][i%2]\n sum2 += cur\n if (sum2>=0, sum2<=0)[i%2]:\n cost2 += 1+sum2*[1,-1][i%2]\n sum2 = [-1,1][i%2]\nprint(min(cost1, cost2))", "#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nlong long a[100007];\n\nlong long solve()\n{\n long long res = 0;\n long long sum = 0;\n\n for(int i=0;i<n;i++)\n {\n if(i%2 == 0)\n {\n if(sum+a[i] <= 0)\n {\n res += llabs(sum+a[i]-1);\n sum = 1;\n }\n else sum += a[i];\n }\n else\n {\n if(sum+a[i] >= 0)\n {\n res += llabs(sum+a[i]+1);\n sum = -1;\n }\n else sum += a[i];\n }\n }\n return res;\n}\n\nint main()\n{\n cin >> n;\n for(int i=0;i<n;i++) cin >> a[i];\n long long ans = solve();\n for(int i=0;i<n;i++) a[i] *= -1;\n ans = min(ans,solve());\n cout << ans << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n; cin>>n;\n vector<int> a(n);\n for(int i=0; i<n; ++i)cin>>a[i];\n\n long long ans1=0LL, ans2=0LL, sum=0LL;\n for(int i=0; i<n; ++i){\n sum+=a[i];\n if(i%2==0 && sum<=0){ans1+=1-sum; sum=1;}\n else if(i%2==1 && sum>=0){ans1+=1+sum; sum=-1;}\n }\n\n sum=0;\n for(int i=0; i<n; ++i){\n sum+=a[i];\n if(i%2==1 && sum<=0){ans2+=1-sum; sum=1;}\n else if(i%2==0 && sum>=0){ans2+=1+sum; sum=-1;}\n }\n\n cout<<min(ans1, ans2)<<endl;\n}\n", "# -*- coding: utf-8 -*-\ndef calc(flag):\n s = res = 0\n for i in range(N):\n flag = flag * -1\n s += a[i]\n if flag == 1:\n if s <= 0:\n res += abs(s) + 1\n s = 1\n elif flag == -1:\n if s >= 0:\n res += abs(s) + 1\n s = -1\n return res\n\nN = int(input())\na = list(map(int, input().split()))\n\nans = min(calc(1), calc(-1))\nprint(ans)\n", "n = int(input())\na = list(map(int,input().split()))\n\ndef chk(a,t):\n ans = 0\n x = 0\n for i in a:\n x += i\n if t==True and x<1:\n ans += 1-x\n x = 1\n elif t==False and x>-1:\n ans += x+1\n x = -1\n t=not t\n return ans\nprint(min(chk(a,True),chk(a,False)))\n \n \n \n", "n=input()\na=map(int,raw_input().split())\n#print n\n#print a\n\na1_sum=0\na1=[]\nfor i in a:\n\ta1_sum+=i\n\ta1.append(a1_sum)\n\n#print a1\n\n\n#+,-\nb=[]\nchn_val=0\nfor i,val in enumerate(a1):\n\tval+=chn_val\n\tif i%2==0:\n\t\tif val>0:\n\t\t\tpass\n\t\telse:\n\t\t\tt_val=1-val\n\t\t\tchn_val+=t_val\n\t\t\tb.append(t_val)\n\telse:\n\t\tif val<0:\n\t\t\tpass\n\t\telse:\n\t\t\tt_val=-1-val\n\t\t\tchn_val+=t_val\n\t\t\tb.append(t_val)\nans1=0\nif len(b)==0:\n\tans1=0\nelse:\n\tfor i in b:\n\t\tans1+=abs(i)\n\n#-,+\nb=[]\nchn_val=0\nfor i,val in enumerate(a1):\n\tval+=chn_val\n\tif i%2==0:\n\t\tif val<0:\n\t\t\tpass\n\t\telse:\n\t\t\tt_val=-1-val\n\t\t\tchn_val+=t_val\n\t\t\tb.append(t_val)\n\telse:\n\t\tif val>0:\n\t\t\tpass\n\t\telse:\n\t\t\tt_val=1-val\n\t\t\tchn_val+=t_val\n\t\t\tb.append(t_val)\n\nans2=0\nif len(b)==0:\n\tans2=0\nelse:\n\tfor i in b:\n\t\tans2+=abs(i)\n\n\nprint min(ans1,ans2)\n\t\t\t\n\t\t\t\n\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n\n\tint n;\n\tcin >> n;\n\tvector<ll> a(n);\n\tfor(int i=0; i<n; i++) cin >> a[i];\n\n\tll sum = 0, ans1 = 0;\n\tfor(int i=0; i<n; i++) {\n\t\tsum += a[i];\n\t\tif(i%2 == 0 && sum <= 0) {\n\t\t\tans1 += 1 - sum;\n\t\t\tsum = 1;\n\t\t}\n\t\tif(i%2 == 1 && sum >= 0) {\n\t\t\tans1 += 1 + sum;\n\t\t\tsum = -1;\n\t\t}\n\t}\n\tsum = 0;\n\tll ans2 = 0;\n\tfor(int i=0; i<n; i++) {\n\t\tsum += a[i];\n\t\tif(i%2 == 1 && sum <= 0) {\n\t\t\tans2 += 1 - sum;\n\t\t\tsum = 1;\n\t\t}\n\t\tif(i%2 == 0 && sum >= 0) {\n\t\t\tans2 += 1 + sum;\n\t\t\tsum = -1;\n\t\t}\n\t}\n\n\tcout << min(ans1, ans2) << endl;\n\n}", "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n ArrayList<Integer> a = new ArrayList<>();\n\n for(int i=0; i<n; i++){\n \ta.add(Integer.parseInt(sc.next()));\n }\n\n long ans1 = 0;\n long sum1 = 0;\n long sign1 = 1;\n for(int i=0; i<n; i++){\n \tsum1 += a.get(i);\n \tif (sum1 * sign1 <= 0){\n \t\tans1 += Math.abs(sum1) + 1;\n \t\tsum1 = sign1;\n \t}\n \tsign1 *= -1;\n }\n\n long ans2 = 0;\n long sum2 = 0;\n long sign2 = -1;\n for(int i=0; i<n; i++){\n \tsum2 += a.get(i);\n \tif (sum2 * sign2 <= 0){\n \t\tans2 += Math.abs(sum2) + 1;\n \t\tsum2 = sign2;\n \t}\n \tsign2 *= -1;\n }\n\n System.out.println(Math.min(ans1, ans2));\n }\n}", "n=int(input())\nan=list(map(int, input().split()))\n\ndef check(sign):\n a_cnt=0\n a_sum=0\n for a in an:\n a_sum+=a\n if a_sum*sign<=0:\n a_cnt+=abs(a_sum-sign)\n a_sum=sign\n sign*=-1\n\n # print(a_sum, a_cnt)\n\n return a_cnt\n\nprint(min(check(1),check(-1)))\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[]){\n\n\t\tScanner cin = new Scanner(System.in);\n\n\t\tint target = cin.nextInt();\n\n\t\tlong list[] = new long[target];\n\n\t\tfor(int i=0;i<target;i++){\n\t\t\tlist[i] = cin.nextLong();\n\t\t}\n\n\t\tlong sum_tmp_minus=0L;\n\t\tlong sum_tmp_plus=0L;\n\t\tlong count_minus=0;\n\t\tlong count_plus=0;\n\n\t\tfor(int k=0;k<target;k++){\n\t\t\tsum_tmp_minus += list[k];\n\t\t\tif(k%2==0){\n\t\t\t\tif(sum_tmp_minus>=0){\n\t\t\t\t\tcount_minus += sum_tmp_minus+1;\n\t\t\t\t\tsum_tmp_minus = -1;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(sum_tmp_minus<=0){\n\t\t\t\t\tcount_minus += 1-sum_tmp_minus;\n\t\t\t\t\tsum_tmp_minus=1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int l=0;l<target;l++){\n\t\t\tsum_tmp_plus += list[l];\n\t\t\tif(l%2==0){\n\t\t\t\tif(sum_tmp_plus<=0){\n\t\t\t\t\tcount_plus += 1-sum_tmp_plus;\n\t\t\t\t\tsum_tmp_plus = 1;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(sum_tmp_plus>=0){\n\t\t\t\t\tcount_plus += sum_tmp_plus+1;\n\t\t\t\t\tsum_tmp_plus=-1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(Math.min(count_minus, count_plus));\n\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long sum1 = 0;\n long ans1 = 0;\n long sum2 = 0;\n long ans2 = 0;\n for (int i = 0; i < n; i++) {\n int a = sc.nextInt();\n sum1 += a;\n sum2 += a;\n if(i % 2 == 0){\n if(sum1 >= 0){\n ans1 += sum1 + 1;\n sum1 = -1;\n }\n if(sum2 <= 0){\n ans2 += Math.abs(sum2) + 1;\n sum2 = 1;\n }\n }else{\n if(sum1 <= 0){\n ans1 += Math.abs(sum1) + 1;\n sum1 = 1;\n }\n if(sum2 >= 0){\n ans2 += sum2 + 1;\n sum2 = -1;\n }\n }\n }\n\n System.out.println(Math.min(ans1, ans2));\n sc.close();\n }\n\n}\n", "n = int(input())\na = list(map(int, input().split()))\ndef tat(t,a,n):\n ans = 0\n ssu = 0\n for x in a:\n ssu += x\n if ssu*t <= 0:\n ans += abs(ssu-t)\n ssu = t\n t *= -1\n return ans\nprint(min(tat(1,a,n),tat(-1,a,n)))", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = s; i <= t; i++)\n\nll ans1, ans2, sum;\nint n;\nint a[100010];\n\nint main() {\n cin >> n;\n rep(i, 0, n - 1) cin >> a[i];\n sum = 0;\n for (int i = 0, s = 1; i < n; i++, s *= -1) {\n sum += a[i];\n if (sum * s <= 0) {\n ans1 += abs(sum - s);\n sum = s;\n }\n }\n sum = 0;\n for (int i = 0, s = -1; i < n; i++, s *= -1) {\n sum += a[i];\n if (sum * s <= 0) {\n ans2 += abs(sum - s);\n sum = s;\n }\n }\n cout << min(ans1, ans2) << endl;\n}\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1e9 + 7;\nconst ll INF = 1LL << 60;\nconst double PI = 3.141592653589793238;\nconst double EPS = 1e-10;\nint a[100000];\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tll ans = INF;\n\tfor (int b = 0; b < 2; b++) {\n\t\tbool plus = b;\n\t\tll cost = 0;\n\t\tll sum = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tsum += a[i];\n\t\t\tif (plus) {\n\t\t\t\tif (sum <= 0) cost += 1 - sum, sum = 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (sum >= 0) cost += sum + 1, sum = -1;\n\t\t\t}\n\t\t\tplus ^= 1;\n\t\t}\n\t\tans = min(ans, cost);\n\t}\n\tcout << ans << endl;\n}\n", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\n int N = scan.nextInt();\n int[] a = new int[N];\n for (int i = 0; i < N; i++) {\n a[i] = scan.nextInt();\n }\n long[] s = new long[N+1];\n s[0] = 0;\n for (int i = 0; i< N; i++) {\n s[i+1] = s[i] + a[i];\n }\n // 正、負、正\n long answer1 = solve(N, s, 1);\n // 負、正、負\n long answer2 = solve(N, s, 0);\n System.out.println(Math.min(answer1, answer2));\n }\n public static long solve(int N, long[] s, int pattern) {\n long answer = 0;\n long diff = 0;\n for (int i = 1; i <= N; i++) {\n if (i % 2 == pattern) {\n if (0 < s[i]+diff) {\n continue;\n } else {\n answer += Math.abs(1-(s[i]+diff));\n diff += (1 - (s[i]+diff));\n }\n } else {\n if (s[i]+diff < 0) {\n continue;\n } else {\n answer += Math.abs(s[i]+diff+1);\n diff -= (s[i]+diff+1);\n }\n }\n }\n return answer;\n }\n}\n", "n=int(input())\na=list(map(int,input().split()))\nb=a\nans1=ans2=0\nsign=1\ntotal=0\nfor i in range(n):\n total+=a[i]\n if total*sign<=0:\n k=abs(total-sign)\n ans1+=k\n total=sign\n sign*=-1\nsign=-1\ntotal=0\nfor i in range(n):\n total+=b[i]\n if total*sign<=0:\n k=abs(total-sign)\n ans2+=k\n total=sign\n sign*=-1\nprint(min(ans1,ans2))\n", "import java.util.*;\npublic class Main {\n\t\n\tpublic static void main(String... args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint N = sc.nextInt();\n\t\t\n\t\tlong[] map = new long[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tmap[i] = sc.nextLong();\n\t\t}\n\t\t\n\t\tlong ans1 = calcAns(map, 1);\n\t\tlong ans2 = calcAns(map, -1);\n\n\t\t\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n\t\n\tstatic long calcAns(long[] map, int type) {\n\t\tlong ans = 0;\n\t\tlong sum = 0;\n\t\tfor (int i = 0; i < map.length; i++) {\n\t\t\tlong a = map[i];\n\t\t\tsum += a;\n\t\t\tif (type == -1) {\n\t\t\t\tif (sum <= type) {\n\t\t\t\t\ttype = 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tans += sum + 1;\n\t\t\t\t\ttype = 1;\n\t\t\t\t\tsum = -1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sum >= type) {\n\t\t\t\t\ttype = -1;\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tans += Math.abs(sum) + 1;\n\t\t\t\t\ttype = -1;\n\t\t\t\t\tsum = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\treturn ans;\n\t}\n}\n", "\nimport java.util.*;\nimport java.io.*;\nimport java.math.BigInteger;\npublic class Main {\n\n\tprivate static final int mod =(int)1e9+7;\n\tpublic static void main(String[] args) throws Exception {\n\t Scanner sc=new Scanner(System.in);\n\t PrintWriter out=new PrintWriter(System.out);\n\t int n=sc.nextInt();\n\t long a[]=new long[n];\n\t for(int i=0;i<n;i++) {\n\t a[i]=sc.nextLong();\n\t }\n\t long sum=a[0];\n\t long operations=0;\n\t if(a.length==1) {\n\t if(a[0]!=0) {\n\t System.out.println(0);\n\t }else {\n\t System.out.println(1);\n\t }\n\t }else {\n\t if(sum<=0) {\n\t sum=1;\n\t operations=Math.abs(a[0]-1);\n\t }\n\t for(int i=1;i<n;i++) {\n\t if(sum>0) {\n\t if(sum+a[i]<0) {\n\t sum+=a[i];\n\t }else {\n\t if(sum+a[i]==0) {\n\t sum=-1;\n\t operations++;\n\t }else {\n\t long req=(long)-1-1l*sum;\n\t sum=-1;\n\t operations+=(-1l*req+a[i]); \n\t }\n\t }\n\t }else {\n\t if(sum+a[i]>0) {\n\t sum+=a[i];\n\t }else {\n\t if(sum+a[i]==0) {\n\t sum=1;\n\t operations++;\n\t }else {\n\t long req=(long)1+-1l*sum;\n\t sum=1;\n\t operations+=(req-a[i]);\n\t }\n\t }\n\t }\n\n\t }\n\t sum=a[0];\n\t long op1=0;\n\t if(sum>=0) {\n\t sum=-1;\n\t op1=Math.abs(a[0]+1);\n\t }\n\t for(int i=1;i<n;i++) {\n if(sum>0) {\n if(sum+a[i]<0) {\n sum+=a[i];\n }else {\n if(sum+a[i]==0) {\n sum=-1;\n op1++;\n }else {\n long req=(long)-1-1l*sum;\n sum=-1;\n op1+=(-1l*req+a[i]); \n }\n }\n }else {\n if(sum+a[i]>0) {\n sum+=a[i];\n }else {\n if(sum+a[i]==0) {\n sum=1;\n op1++;\n }else {\n long req=(long)1+-1l*sum;\n sum=1;\n op1+=(req-a[i]);\n }\n }\n }\n\n }\n\t System.out.println(Math.min(operations,op1));\n\t }\n\t}\n\t\n\tstatic boolean vis[]=new boolean[10001];\n\t static int gcd(int a, int b) \n\t { \n\t if (a == 0) \n\t return b; \n\t return gcd(b % a, a); \n\t } \n\t \n\t // Function to find gcd of array of \n\t // numbers \n\t static int f(int arr[], int n) \n\t { \n\t int result = n; \n\t int max=-1;\n\t int ans=0;\n\t for (int element: arr){ \n\t if(vis[element]==false)\n\t \n\t result = gcd(n, element); \n\t if(result>max) { \n\t max=result;\n\t ans=element;\n\t \n\t }\n\t \n\t \n\t } \n\t \n\t \n\t return ans; \n\t } \n\t \n\t \n}", "N = int(input())\nA = list(map(int,input().split()))\nret = 0\ndef count(nega):\n ret = 0\n s = 0\n for e in A:\n nega = not nega\n #print(e,ret,s,s+e)\n if nega and 0 <= s + e:\n ret += abs(s + e) + 1\n s = -1\n elif not nega and s + e <= 0:\n ret += abs(s + e) + 1\n s = 1\n else:\n s += e\n return ret\nprint(min(count(True),count(False)))\n", "def sign(p):\n if p<0:\n return -1\n elif p>0:\n return 1\n else:\n return 0\nN=int(input())\na=[int(i) for i in input().split()]\nm=[0,0]\nfor sgn in [-1,1]:\n x=0\n S=0\n for i in range(N):\n S+=a[i]\n if sign(S)==sgn*(-1)**(i%2) or sign(S)==0:\n x+=abs(S)+1\n S=sgn*(-1)**((i+1)%2)\n m[(sgn+1)//2]=x\nprint(min(m))\n", "n=int(input())\nl=[int(i) for i in input().split()]\nchk1=ans1=chk2=ans2=0\n\nfor a,i in enumerate(l):\n chk1+=i\n chk2+=i\n if a%2:\n if chk1<=0:\n ans1+=1-chk1\n chk1=1\n if chk2>=0:\n ans2+=chk2+1\n chk2=-1\n else:\n if chk1>=0:\n ans1+=1+chk1\n chk1=-1\n if chk2<=0:\n ans2+=1-chk2\n chk2=1\nprint(min(ans1,ans2))\n", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); ++i)\ntypedef long long ll;\nusing namespace std;\nint n, a[100010];\nll calc(ll s) {\n ll sum = 0, res = 0;\n for (int i = 0; i < n; ++i, s *= -1) {\n sum += a[i];\n if (sum * s > 0) continue;\n if (s > 0)\n res += (-sum + s), sum += (-sum + s);\n else\n res += (sum - s), sum += -(sum - s);\n }\n return res;\n}\nint main() {\n cin >> n;\n rep(i, n) cin >> a[i];\n cout << min(calc(1), calc(-1)) << endl;\n return 0;\n}", "#include <iostream>\nusing namespace std;\nint main(void){\n int n;\n long long a,b=0,c=0,d=0,e=0;\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>a;\n b+=a;\n c+=a;\n if(i%2==0){\n if(b>=0){\n d+=b+1;\n b=-1;\n }\n if(c<=0){\n e+=-c+1;\n c=1;\n }\n }else{\n if(b<=0){\n d+=-b+1;\n b=1;\n }\n if(c>=0){\n e+=c+1;\n c=-1;\n }\n }\n }\n cout<<min(d,e)<<endl;\n}\n", "n = int(input())\na = list(map(int, input().split()))\n\ndef calcOperation(base):\n sum = 0\n ans = 0\n sign = base\n for i in range(n):\n sum += a[i]\n if sum * sign >= 0:\n ans += abs(sum) + 1\n sum = -sign\n sign *= -1\n return ans\n\nposi = calcOperation(1)\nnega = calcOperation(-1)\nprint(min(posi, nega))", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n int n;\n int[] as;\n\n public static void main(String args[]) {\n new Main().run();\n }\n\n void run() {\n FastReader sc = new FastReader();\n n = sc.nextInt();\n as = new int[n];\n for (int i = 0; i < n; i++) {\n as[i] = sc.nextInt();\n }\n solve();\n }\n\n void solve() {\n long[] sums = new long[n];\n sums[0] = as[0];\n for (int i = 1; i < n; i++) {\n sums[i] = sums[i - 1] + as[i];\n }\n long evenCount = 0;\n long evenChange = 0;\n long[] sumsForEven = sums.clone();\n for (int i = 0; i < n; i++) {\n sumsForEven[i] += evenChange;\n if (i % 2 == 0 && sumsForEven[i] <= 0) {\n evenCount += -sumsForEven[i] + 1;\n evenChange += -sumsForEven[i] + 1;\n sumsForEven[i] = 1;\n } else if (i % 2 == 1 && sumsForEven[i] >= 0) {\n evenCount += sumsForEven[i] + 1;\n evenChange -= sumsForEven[i] + 1;\n sumsForEven[i] = -1;\n }\n }\n long oddCount = 0;\n long oddChange = 0;\n for (int i = 0; i < n; i++) {\n sums[i] += oddChange;\n if (i % 2 == 1 && sums[i] <= 0) {\n oddCount += -sums[i] + 1;\n oddChange += -sums[i] + 1;\n sums[i] = 1;\n } else if (i % 2 == 0 && sums[i] >= 0) {\n oddCount += sums[i] + 1;\n oddChange -= sums[i] + 1;\n sums[i] = -1;\n }\n }\n System.out.println(Math.min(evenCount, oddCount));\n }\n\n static class FastReader {\n BufferedReader br;\n StringTokenizer st;\n\n public FastReader() {\n br = new BufferedReader(new\n InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements())\n {\n try\n {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n long nextLong()\n {\n return Long.parseLong(next());\n }\n\n double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n }\n}\n", "# -*- coding: utf-8 -*-\n\nn = input()\na = map(int, raw_input().split())\nb = a\nasum = [0]*len(a)\nbsum = [0]*len(a)\n\nasum[0] = a[0]\nbsum[0] = b[0]\ncnt_a = 0\ncnt_b = 0\nif(a[0]==0):\n asum[0] = 1\n cnt_a = 1\n bsum[0] = -1\n cnt_b = 1\n\nif(a[0]<0):\n cnt_a += (-1)*a[0]+1\n asum[0] = 1\nfor i in range(len(a)-1):\n asum[i+1] = a[i+1] + asum[i]\n if(i%2==0 and asum[i+1]>=0):\n cnt_a += asum[i+1]+1\n asum[i+1] = -1\n elif(i%2==1 and asum[i+1]<=0):\n cnt_a += (-1)*asum[i+1]+1\n asum[i+1] = 1\nif(b[0]>0):\n cnt_b += b[0]+1\n bsum[0] = -1\nfor i in range(len(b)-1):\n bsum[i+1] = b[i+1] + bsum[i]\n if(i%2==0 and bsum[i+1]<=0):\n cnt_b += (-1)*bsum[i+1]+1\n bsum[i+1] = 1\n elif(i%2==1 and bsum[i+1]>=0):\n cnt_b += bsum[i+1]+1\n bsum[i+1] = -1\nprint(min(cnt_a,cnt_b))", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n\n long long c1 = 0, c2 = 0, s1 = 0, s2 = 0;\n for (int i = 0; i < n; i++) {\n s1 += a[i];\n s2 += a[i];\n if (i & 1) {\n if (s1 >= 0) {c1 += s1 + 1; s1 = -1;}\n if (s2 <= 0) {c2 += 1 - s2; s2 = 1;}\n } else {\n if (s1 <= 0) {c1 += 1 - s1; s1 = 1;}\n if (s2 >= 0) {c2 += s2 + 1; s2 = -1;}\n }\n }\n cout << min(c1, c2) << endl;\n}\n", "#include<iostream>\n#define rep(i,n) for(int i=0;i<n;++i)\nusing namespace std;\n\nint n, a[100000];\n\nint64_t solve(bool plus) {\n int64_t ret = 0, sum = 0;\n rep(i, n) {\n sum += a[i];\n if (plus && sum <= 0 || !plus && sum >= 0) {\n ret += abs(sum) + 1;\n sum = plus ? 1 : -1;\n }\n plus ^= true;\n }\n return ret;\n}\n\nint main() {\n cin >> n;\n rep(i, n) cin >> a[i];\n cout << min(solve(true), solve(false)) << endl;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define ll long long\nconstexpr ll inf = 1e9+7;\n\nll solve(vector<ll> As, bool flag) {\n ll ans = 0;\n ll sum = 0;\n for (auto A : As) {\n sum += A;\n if (flag && sum <= 0) { ans += 1 - sum; sum = 1; }\n else if (!flag && sum >= 0) { ans += 1 + sum; sum = -1; }\n flag = !flag;\n }\n return ans;\n}\n\nint main () {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll N;\n cin>>N;\n vector<ll> A(N);\n for (ll n = 0; n < N; n++) cin>>A[n];\n\n cout<<min(solve(A, false), solve(A, true))<<endl;\n return 0;\n}", "/* \"It's okay if you hate me. I hate me too.\" */\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint a[100005];\nint n;\n\nlong long calc(int MOD) {\n\tlong long sum = 0, res = 0;\n\tfor (int i = 1; i <= n; ++i) {\n\t\tsum += a[i];\n\t\tif (i%2 == MOD && sum <= 0) {\n\t\t\tres += (1-sum);\n\t\t\tsum = 1;\n\t\t}\n\t\telse if (i%2 != MOD && sum >= 0) {\n\t\t\tres += (sum+1);\n\t\t\tsum = -1;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main() {\n\tscanf(\"%d\", &n);\n\tfor (int i = 1; i <= n; ++i) \n\t\tscanf(\"%d\", &a[i]);\n\tcout << min(calc(0), calc(1));\n\treturn 0;\n}", "def smaller(x, y):\n\tif x < y: return x\n\telse: return y\n\ndef judge(a, posneg):\n\tcnt = 0\n\tcur = posneg\n\tsum = 0\n\tfor i in range(0, len(a)):\n\t\tsum = sum + a[i]\n\t\tsumt = sum * cur\n\t\tif sumt < 1:\n\t\t\tcnt = cnt + abs(cur - sum)\n\t\t\tsum = cur\n\t\tcur = -1 * cur\n\treturn cnt\n\nn = int(raw_input())\na = map(int, raw_input().split())\nprint smaller(judge(a, 1), judge(a, -1))", "import java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.function.*;\nimport java.util.stream.Collectors.*;\npublic class Main {\n public static void main(String[] args) {\n new Main().solve();\n }\n IO io = new IO();\n\n /// ********** 本体 ********** ///\n\n void solve() {\n int n = io.Int();\n int[] a = new int[n];\n REP(n,integer -> a[integer]=io.Int());\n long cost1=0,cost2=0;\n long sum1=0,sum2=0;\n //sum is +-+...\n for(int i=0;i<n;++i){\n if(i%2==0){\n //sum is +\n sum1+=a[i];\n long addVal =\n sum1<0?(-sum1)+1:\n sum1==0?1:0;\n sum1+=addVal;\n cost1+=Math.abs(addVal);\n }else{\n //sum is -\n sum1+=a[i];\n long addVal =\n sum1>0?(-sum1)-1:\n sum1==0?-1:0;\n sum1+=addVal;\n cost1+=Math.abs(addVal);\n }\n }\n //sum is -+-...\n for(int i=0;i<n;++i){\n if(i%2!=0){\n //sum is +\n sum2+=a[i];\n long addVal =\n sum2<0?(-sum2)+1:\n sum2==0?1:0;\n sum2+=addVal;\n cost2+=Math.abs(addVal);\n }else{\n //sum is -\n sum2+=a[i];\n long addVal =\n sum2>0?(-sum2)-1:\n sum2==0?-1:0;\n sum2+=addVal;\n cost2+=Math.abs(addVal);\n }\n }\n //result\n long ans = Math.min(cost1,cost2);\n System.out.println(ans);\n }\n\n void FOR(int a, int b, Consumer<Integer>act) { for(int i = a; i < b; ++i) act.accept(i); }\n void REP(int a, Consumer<Integer>act) { FOR(0, a, act); }\n}\nclass IO{\n String[] nextBuff;\n int buffCnt;\n Scanner sc = new Scanner(System.in);\n public IO(){\n nextBuff = new String[0];\n buffCnt = 0;\n }\n String next() {\n if (buffCnt < nextBuff.length) return nextBuff[buffCnt++];\n String line = sc.nextLine();\n while (line == \"\") line = sc.nextLine();\n nextBuff = line.split(\" \");\n buffCnt = 0;\n return nextBuff[buffCnt++];\n }\n public String String() { return next(); }\n public char Char() { return next().charAt(0);}\n public int Int() { return Integer.parseInt(next());}\n public long Long() { return Long.parseLong(next());}\n public double Double() { return Double.parseDouble(next());}\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[n];\n\t\tlong[] ac = new long[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\n\t\tlong answer = Long.MAX_VALUE;\n\t\tfor (int i = 0; i < 2; i++) {\n\t\t\tlong t = 0;\n\t\t\tac[0] = a[0];\n\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif ((i + j) % 2 == 0) {\n\t\t\t\t\tif (ac[j] >= 0) {\n\t\t\t\t\t\tt += ac[j] + 1;\n\t\t\t\t\t\tac[j] = -1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (ac[j] <= 0) {\n\t\t\t\t\t\tt += Math.abs(ac[j]) + 1;\n\t\t\t\t\t\tac[j] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (j < n - 1) ac[j + 1] = ac[j] + a[j + 1];\n\t\t\t}\n\n\t\t\tanswer = Math.min(answer, t);\n\t\t}\n\n\t\tSystem.out.println(answer);\n\t}\n}\n", "n=int(input())\na=list(map(int, input().split()))\n\ndef f(presum, x, fugo):\n if (presum+x)*fugo<=0:\n sa=fugo-presum-x\n prosum=fugo\n else:\n sa=0\n prosum=presum+x\n return sa, prosum\n\nout1=0\ny=0\nfor i in range(n):\n x, y=f(y, a[i], (-1)**i)\n out1+=abs(x)\n \nout2=0\ny=0\nfor i in range(n):\n x, y=f(y, a[i], -(-1)**i)\n out2+=abs(x)\n \nprint(min(out1, out2))", "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <string>\n#include <math.h>\ntypedef long long ll;\n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n ll a[100001]={0};\n for (int i=0;i<n;i++) cin >> a[i];\n\n bool sign=true;\n ll res=0,res2=0,sum=0;\n for (int x=0;x<2;x++){\n\tres=0;\n\tsum=0;\n for (int i=0;i<n;i++){\n\t sum+=a[i];\n\t if (sign){\n\t\tif (sum <= 0){\n\t\t res+=1-sum;\n\t\t sum=1;\n\t\t}\n\t\tsign=false;\n\t } else {\n\t\tif (sum >= 0){\n\t\t res+=1+sum;\n\t\t sum=-1;\n\t\t}\n\t\tsign=true;\n\t }\n\t}\n\tsign=false;\n\tif (x == 0) res2=res;\n }\n\n cout << min(res,res2) << endl;\n\n return 0;\n}", "n = int(input())\nA = list(map(int, input().split()))\n\nINF = float('inf')\n\nans = INF\n\nfor sign in (1, -1):\n res, total_a = 0, 0\n for a in A:\n total_a += a\n if total_a * sign <= 0:\n res += abs(total_a - sign)\n total_a = sign\n sign *= -1\n ans = min(ans, res)\n\nprint(ans)", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.AbstractMap;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Set;\nimport java.util.Stack;\nimport static java.util.Comparator.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n \n Solver solver = new Solver();\n solver.solve(1, in, out);\n \n out.close();\n }\n \n // ======================================================================\n static class Solver \n {\n \tlong[] A = null;\n \tlong[] S = null;\n\n \tlong calc(boolean mflag, PrintWriter out) {\n \t\tlong ans = 0;\n\t\t\tArrays.fill(S, 0);\n \t\tfor(int i=0; i < A.length; i++) {\n\t\t\t\tif(i == 0)\tS[0] = A[0];\n\t\t\t\telse \t\tS[i] = S[i-1] + A[i];\n//\t\t\t\tout.println(\"A[\" + i + \"] = \" + A[i] + \" S[\" + i + \"] = \" + S[i]);\n\t\t\t\tif(mflag) {\n\t\t\t\t\tif(S[i] >= 0) {\n\t\t\t\t\t\tans += Math.abs(S[i]) +1;\n\t\t\t\t\t\tS[i] = -1;\n//\t\t\t\t\t\tout.println(\"mflag = \" + mflag + \" ans = \" + ans);\n\t\t\t\t\t}\n\t\t\t\t\tmflag = false;\n\t\t\t\t} else {\n\t\t\t\t\tif(S[i] <= 0) {\n\t\t\t\t\t\tans += Math.abs(S[i]) + 1;\n\t\t\t\t\t\tS[i] = 1;\n//\t\t\t\t\t\tout.println(\"mflag = \" + mflag + \" ans = \" + ans);\n\t\t\t\t\t}\n\t\t\t\t\tmflag = true;\n\t\t\t\t}\n\t\t\t}\n \t\treturn ans;\n \t}\n \tpublic void solve(int testNumber, MyInput in, PrintWriter out) {\n\t\t\tint N = in.nextInt();\n\t\t\tA = new long[N];\n\t\t\tS = new long[N];\n\t\t\tfor(int i=0; i < N; i++) {\n\t\t\t\tA[i] = in.nextLong();\n\t\t\t}\n\t\t\tlong ans = Math.min(calc(true, out), calc(false, out));\n\t\t\tout.println(ans);\n }\n }\n // ======================================================================\n static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n public String getString() {\n return \"[\" + getKey() + \"] [\" + getValue() + \"]\";\n }\n } \n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n \n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n \n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n \n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n \n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n \n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n \n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n \n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n \n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n \n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n \n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main {\n\n public static void main(String[] args) {\n new Main().solve();\n }\n\n void solve() {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] a = new long[n];\n long A = 0;\n long ANS = 0;\n long ans = 0;\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n for (int i = 0; i < n; i++) {\n A += a[i];\n if (i % 2 == 0 && A <= 0) {\n ans += Math.abs(A - 1);\n A = 1;\n }\n if (i % 2 == 1 && A >= 0) {\n ans += Math.abs(A + 1);\n A = -1;\n }\n }\n ANS = ans;\n A = 0;\n ans = 0;\n for (int i = 0; i < n; i++) {\n A += a[i];\n if (i % 2 == 0 && A >= 0) {\n ans += Math.abs(A + 1);\n A = -1;\n }\n if (i % 2 == 1 && A <= 0) {\n ans += Math.abs(A - 1);\n A = 1;\n }\n }\n ANS = Math.min(ANS, ans);\n System.out.println(ANS);\n }\n}\n", "#include<bits/stdc++.h>\n#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)\nusing namespace std;\n \nsigned main(){\n int N;cin>>N;\n vector<long long> A(N);\n REP(i, N) cin >> A[i];\n long long ans=LLONG_MAX;\n int sig[2]={1,-1};\n REP(j,2){ \n long long sum=0;\n long long count=0;\n REP(i,N){\n sum+=A[i];\n if(i%2==0&&sig[j]*sum<=0){\n count+=llabs(sum-sig[j]*1);\n sum=sig[j]*1;\n }\n if(i%2==1&&sig[j]*sum>=0){\n count+=llabs(sum+sig[j]*1);\n sum=-1*sig[j];\n }\n }\n ans=min(ans,count);\n }\n cout<<ans<<endl;\n}", "from itertools import accumulate\n\nn = int(input())\na = [int(i) for i in input().split()]\n\n\ndef n_op(a, p):\n s = accumulate(a)\n x = 0\n n = 0\n\n for si in s:\n if p and si + x <= 0:\n n += 1 - (si + x)\n x += 1 - (si + x)\n if (not p) and si + x >= 0:\n n += 1 + (si + x)\n x -= 1 + (si + x)\n p = not p\n\n return n\n\n\nanswer = min([n_op(a, True), n_op(a, False)])\nprint(answer)\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\nusing ll = long long;\n\nconst ll INF = 1LL << 61;\n\nint main(){\n\tint n;\n \tcin >> n;\n\tvector<int> a(n);\n\trep(i,n) cin >> a[i];\n\n\tll ans = INF;\n\tfor(int a0 : {1,-1,a[0]} ) if(a0 != 0) {\n\t\tll tmp = abs(a0 - a[0]), sum = a0;\n\t\tfor(int i = 1; i < n; i++){\n\t\t\tsum += a[i];\n\t\t\tif(sum - a[i] > 0){\n\t\t\t\tif(sum >= 0){\n\t\t\t\t\ttmp += sum + 1;\n\t\t\t\t\tsum = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(sum - a[i] < 0){\n\t\t\t\tif(sum <= 0){\n\t\t\t\t\ttmp += 1 - sum;\n\t\t\t\t\tsum = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans = min(ans, tmp);\n\t}\n\tcout << ans << endl;\n}\n", "n = int(input())\nA = list(map(int, input().split()))\n\nB1 = [(-1)**i for i in range(n)]\nB2 = [(-1)**(i+1) for i in range(n)]\n\ndef func(A, B):\n cum = 0\n res = 0\n for i in range(n):\n cum += A[i]\n if B[i] > 0 and cum <= 0:\n res += 1-cum\n cum = 1\n elif B[i] < 0 and cum >= 0:\n res += cum+1\n cum = -1\n return res\n \nprint(min(func(A, B1), func(A, B2)))\n", "n = int(input())\nA = list(map(int, input().split()))\n\ndef chk(A, first):\n sum = 0\n count = 0\n t = first\n for a in A:\n sum += a\n if t == True and sum < 1:\n count += 1-sum\n sum = 1\n elif t == False and sum > -1:\n count += sum + 1\n sum = -1\n t = not t\n return count\nprint(min(chk(A, True), chk(A, False)))", "_ = int(input())\nA = list(map(int, input().split()))\n\ndef chk(a_list, sgn):\n \n cum_n = 0\n count = 0\n \n for a in a_list:\n cum_n += a\n \n if sgn>0 and cum_n<=0:\n count += abs(cum_n-1)\n cum_n = 1\n elif sgn<0 and cum_n>=0:\n count += abs(cum_n-(-1))\n cum_n = -1\n \n sgn = sgn*(-1)\n \n return(count)\n\nprint(min(chk(A, 1), chk(A, -1)))", "N = int(input())\nA = list(map(int, input().split()))\n\ndef sol(S):\n ret = 0\n for a in A[1:]:\n b = a\n if S * (S + b) > 0:\n b = (abs(S) + 1) * (1 if S < 0 else -1)\n if S + b == 0:\n b = b - 1 if S > 0 else b + 1\n ret += abs(b - a)\n S += b\n return ret\n\nif A[0] == 0:\n ans = min(sol(1), sol(-1)) + 1\nelse:\n ans = min(sol(A[0]), sol(-1 if A[0] > 0 else 1) + abs(A[0]) + 1)\nprint(ans)\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define mp make_pair\n#define pb push_back\nll n,a[100005],sum,cnt1,cnt2;\nint main(){\n cin>>n;\n for(int i=1;i<=n;i++) cin>>a[i];\n for(int i=1;i<=n;i++){\n sum+=a[i];\n if(i%2 && sum<=0){\n cnt1+=1-sum;\n sum=1;\n }\n if(i%2==0 && sum>=0){\n cnt1+=sum+1;\n sum=-1;\n }\n }\n sum=0;\n for(int i=1;i<=n;i++){\n sum+=a[i];\n if(i%2==0 && sum<=0){\n cnt2+=1-sum;\n sum=1;\n }\n if(i%2 && sum>=0){\n cnt2+=sum+1;\n sum=-1;\n }\n }\n cout<<min(cnt1,cnt2);\n return 0;\n}", "def solve(f, A):\n r, s = 0, 0\n for a in A:\n s += a\n if s == 0:\n r += 1\n s = f\n elif s * f < 0:\n r += -(s * f) + 1\n s = f\n f = -f\n return r\n\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n return min(solve(1, A), solve(-1, A))\n\nprint(main())\n", "n = int(input())\nls = list(map(int, input().split()))\n\n\ndef calc(ls, sign):\n count = 0\n acc = 0\n for x in ls:\n y = acc + x\n if y == 0 or y // abs(y) != sign:\n z = sign - y\n count += abs(z)\n acc = sign\n else:\n acc = y\n sign *= -1\n return count\n\n\ncount = min(calc(ls, 1), calc(ls, -1))\nprint(count)", "#include <bits/stdc++.h>\n#define rep(i, n) REP(i, 0, n)\n#define REP(i, l, r) for (int i = l; i < r; ++i)\n#define int long long\nusing namespace std;\ntypedef pair<int, int> P;\nsigned main() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) {\n cin >> a[i];\n if (i)\n a[i] += a[i - 1];\n }\n int out = LLONG_MAX;\n rep(i, 2) {\n int cnt = 0, ans = 0;\n rep(j, n) {\n if (j % 2 == i) {\n ans += max(1 - (a[j] + cnt), 0ll);\n cnt += max(1 - (a[j] + cnt), 0ll);\n } else {\n ans += max((a[j] + cnt) + 1, 0ll);\n cnt += min(-(a[j] + cnt) - 1, 0ll);\n }\n }\n out = min(out, ans);\n }\n cout << out << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n vector<int64_t> a(n);\n for(int i=0;i<n;++i){\n cin>>a.at(i);\n }\n\n int64_t S1=0,S2=0,count1=0,count2=0;\n //odd>0,even<0\n for(int i=0;i<n;++i){\n S1 += a.at(i);\n if(i%2!=0 && S1<=0){\n count1 += (1-S1);\n S1=1;\n }\n else if(i%2==0 && S1>=0){\n count1 += (1+S1);\n S1=-1;\n }\n }\n //odd<0,even>0\n for(int i=0;i<n;++i){\n S2 += a.at(i);\n if(i%2!=0 && S2>=0){\n count2 += (1+S2);\n S2=-1;\n }\n else if(i%2==0 && S2<=0){\n count2 += (1-S2);\n S2=1;\n }\n }\n\n cout<<min(count1,count2)<<endl;\n}\n\n", "#include <bits/stdc++.h>\n#define ll long long\n\nusing namespace std;\n\nint main() {\n int n;\n ll c = 0, d = 0, pm = 0, mp = 0;\n scanf(\"%d\", &n);\n for(int i = 0; i < n; i++) {\n int a;\n scanf(\"%d\", &a);\n pm += a;\n mp += a;\n if(pm * (i % 2 ? -1 : 1) <= 0) {\n c += abs(pm) + 1;\n pm = i % 2 ? -1 : 1;\n }\n if(mp * (i % 2 ? -1 : 1) >= 0) {\n d += abs(mp) + 1;\n mp = i % 2 ? 1 : -1;\n }\n }\n printf(\"%lld\\n\", min(c, d));\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < (int)n; i++)\nusing ll = long long;\n\nint main(){\n int n;\n cin >> n;\n ll a[n];\n rep(i,n) cin >> a[i];\n ll c = 0, d = 0, s = 0, t = 0;\n rep(i,n) {\n s += a[i]; t += a[i];\n if(i % 2 == 0) {\n if(s <= 0) {\n c += 1 - s;\n s = 1;\n } \n if(t >= 0) {\n d += t + 1;\n t = -1;\n }\n } else {\n if(s >= 0) {\n c += s + 1;\n s = -1;\n }\n if(t <= 0) {\n d += 1 - t;\n t = 1;\n }\n }\n }\n cout << min(c,d) << endl;\n return 0;\n}", "# coding: utf-8\n# hello worldと表示する\nN=int(input())\ns=list(map(int,input().split()))\ndef f(N,s,t):\n ss=0\n w=0\n for i in range(N):\n ss+=s[i]\n if t==1:\n if ss<=0:\n w+=1-ss\n ss=1\n t=-1 \n elif t==-1:\n if ss>=0:\n w+=1+ss\n ss=-1\n t=1\n return w\nt=1\na=f(N,s,t)\nt=-1\nb=f(N,s,t)\nprint(min(a,b))\n \n \n ", "def count(seq, is_positive):\n operation = 0\n sum = 0\n for i in range(n):\n sum += seq[i]\n if sum == 0:\n operation += 1\n if is_positive:\n sum -= 1\n else:\n sum += 1\n elif sum > 0 and is_positive:\n operation += abs(sum) + 1\n sum = -1\n elif sum < 0 and not is_positive:\n operation += abs(sum) + 1\n sum = 1\n\n if sum > 0:\n is_positive = True\n else:\n is_positive = False\n\n return operation\n\nif __name__ == \"__main__\":\n n = input()\n seq = map(int, raw_input().split(\" \"))\n\n print min(count(seq, False), count(seq, True))\n", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nlong long ope_cnt(vector<long long> a, int n, bool plus) {\n\tlong long sum = 0, ret = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tsum += a[i];\n\t\tif (plus && sum <= 0) {\n\t\t\tret += 1 - sum;\n\t\t\tsum = 1;\n\t\t}\n\t\telse if (!plus && sum >= 0) {\n\t\t\tret += 1 + sum;\n\t\t\tsum = -1;\n\t\t}\n\t\tplus = !plus;\n\t}\n\treturn ret;\n}\n\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<long long> a(n);\n\tfor (int i = 0; i < n; i++) cin >> a[i];\n\n\tlong long ans_p = ope_cnt(a, n, true);\n\tlong long ans_m = ope_cnt(a, n, false);\n\tcout << min(ans_p, ans_m) << endl;\n}\n", "// Sequence\n#include <iostream>\n#include <stdlib.h>\n#include <algorithm>\nusing namespace std;\nint n;\nint a[100000];\nlong long c[2];\n\nint main(){\n cin>>n;\n for(int i=0;i<n;i++)cin>>a[i];\n for(int C=0;C<2;C++){\n int sign=C*2-1;\n int sum=0;\n for(int i=0;i<n;i++){\n if((sum+a[i])*sign<1){\n c[C]+=abs(sum+a[i]-sign);\n sum=sign;\n }else sum+=a[i];\n sign*=-1;\n }\n }\n cout<<min(c[0],c[1]);\n\n}", "N = int(input())\nA = list(map(int, input().split()))\n\ndef solve(A, mode=0):\n # mode = 0 : +-+-+-...\n # mode = 1 : -+-+-+...\n res = 0\n pre_a = 0\n for i, a in enumerate(A):\n a += pre_a\n if a * (-1)**(i+mode) > 0: # 符号がmatchしている\n pre_a = a\n continue\n # 符号がmatchしていない\n res += abs(a) + 1\n pre_a = (-1) ** (i + mode)\n return res\n \nans = solve(A, mode=0)\nans = min(ans, solve(A, mode=1))\nprint(ans)", "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n\tfinal static long MOD = 1000000007;\n\tpublic static String[] Ws = null;\n\tpublic static int wsIndx = 0;\n\tpublic static BufferedReader in = null;\n\tpublic static void main(String[] args) throws Exception {\n\n\t\tint n = nextInt();\n\t\tlong[] b = nextLongs();\n\t\tlong[] a = Arrays.copyOf(b, b.length);\n\n\t\tlong ansN = 0;\n\t\tlong sum=0;\n\t\t//-から始まる場合\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i%2==0){\n\t\t\t\tif(a[i]+sum>=0){\n\t\t\t\t\tansN+=a[i]+sum+1;\n\t\t\t\t\ta[i]+=(a[i]+sum+1)*-1;\n\t\t\t\t}\n\t\t\t\tsum+=a[i];\n\t\t\t}else{\n\t\t\t\tif(a[i]+sum<=0){\n\t\t\t\t\tansN+=Math.abs(a[i]+sum)+1;\n\t\t\t\t\ta[i]+=Math.abs(a[i]+sum)+1;\n\t\t\t\t}\n\t\t\t\tsum+=a[i];\n\t\t\t}\n\t\t}\n\n\t\ta = Arrays.copyOf(b, b.length);\n\t\tlong ansP = 0;\n\t\tsum=0;\n\t\t//+から始まる場合\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i%2==0){\n\t\t\t\tif(a[i]+sum<=0){\n\t\t\t\t\tansP+=Math.abs(a[i]+sum)+1;\n\t\t\t\t\ta[i]+=Math.abs(a[i]+sum)+1;\n\t\t\t\t}\n\t\t\t\tsum+=a[i];\n\t\t\t}else{\n\t\t\t\tif(a[i]+sum>=0){\n\t\t\t\t\tansP+=Math.abs(a[i]+sum)+1;\n\t\t\t\t\ta[i]+=(Math.abs(a[i]+sum)+1)*-1;\n\t\t\t\t}\n\t\t\t\tsum+=a[i];\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(Math.min(ansN, ansP));\n\n\t}\n\n\tpublic static String[] toStringArray(String s) {\n\t\tString[] tmp = new String[s.length()];\n\t\tchar[] c = s.toCharArray();\n\t\tfor (int i = 0; i < tmp.length; i++) {\n\t\t\ttmp[i] = String.valueOf(c[i]);\n\t\t}\n\t\treturn tmp;\n\t}\n\n\tpublic static void check() throws Exception{\n\t\tif(in == null){\n\t\t\tin = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\tif(Ws==null || Ws.length<=wsIndx){\n\t\t\tWs = in.readLine().split(\" \");\n\t\t\twsIndx=0;\n\t\t}\n\t}\n\tpublic static int nextInt()throws Exception{\n\t\tcheck();\n\t\treturn Integer.parseInt(Ws[wsIndx++]);\n\t}\n\n\tpublic static long nextLong()throws Exception{\n\t\tcheck();\n\t\treturn Long.parseLong(Ws[wsIndx++]);\n\t}\n\n\tpublic static String nextString()throws Exception{\n\t\tcheck();\n\t\treturn Ws[wsIndx++];\n\t}\n\n\tpublic static int[] nextInts()throws Exception{\n\t\tcheck();\n\t\tint[] tmp = new int[Ws.length];\n\t\tfor(int i=0;i<tmp.length;i++){\n\t\t\ttmp[i]=Integer.parseInt(Ws[i]);\n\t\t}\n\t\twsIndx=Ws.length;\n\t\treturn tmp;\n\t}\n\n\tpublic static long[] nextLongs()throws Exception{\n\t\tcheck();\n\t\tlong[] tmp = new long[Ws.length];\n\t\tfor(int i=0;i<tmp.length;i++){\n\t\t\ttmp[i]=Long.parseLong(Ws[i]);\n\t\t}\n\t\twsIndx=Ws.length;\n\t\treturn tmp;\n\t}\n\n\tpublic static String[] nextStrings()throws Exception{\n\t\tcheck();\n\t\twsIndx=Ws.length;\n\t\treturn Ws;\n\t}\n\n\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;\n long re,ro,se,so;\n re=ro=se=so=0;\n cin>>n;\n vector<int> a(n);\n for(int i=0;i<n;i++)cin>>a[i];\n for(int i=0;i<n;i++){\n se+=a[i],so+=a[i];\n if(i%2){\n if(se<0 && so>0)continue;\n else{\n if(se>=0)re+=1+se,se-=1+se;\n if(so<=0)ro+=1-so,so+=1-so;\n }\n }else{\n if(se>0 && so<0)continue;\n else{\n if(se<=0)re+=1-se,se+=1-se;\n if(so>=0)ro+=1+so,so-=1+so;\n }\n }\n }\n cout<<min(re,ro)<<endl;\n}", "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define rep(i,n) REP(i,0,n)\n#define REP(i,a,n) for(int i = a ; i < (int)n ; i++)\ntypedef long long int ll;\n \nint sign(int a){\n return a/abs(a);\n}\n \nint main(){\ncin.tie(0);\nios::sync_with_stdio(false);\nll a[100001];\nint n;\ncin>>n;\n \nrep(i,n) cin >> a[i];\n \nll sum=0;\nll c=1;\nll c1=0,c2=0;\n//奇数番目を正とする\nrep(i,n){\n sum+=a[i];\n if(sum*c<=0){\n c1+=abs(sum)+1;\n sum=c;\n }\n c*=-1;\n}\n//奇数番目を偶数とする\nc=-1;\nsum=0;\nrep(i,n){\n sum+=a[i];\n if(sum*c<=0){\n c2+=abs(sum)+1;\n sum=c;\n }\n c*=-1;\n}\ncout<<min(c1,c2)<<endl;\n//system(\"pause\");\nreturn 0;\n}", "N=int(input())\nA=list(map(int,input().split()))\n\ndef dfs(sign):\n cnt=0\n tmp=0\n for a in A:\n tmp+=a\n if tmp*sign>=0:\n cnt+=abs(tmp)+1\n tmp=-sign\n sign*=-1\n return cnt\n\nprint(min(dfs(1),dfs(-1)))\n\n# copy", "n=int(input())\na=list(map(int,input().split()))\ndef ma():\n fg=[1,-1]\n ret = [0]*2\n tot = [0]*2\n il = range(n)\n jl = range(2)\n for i in il:\n for j in jl:\n tot[j]+=a[i]\n if tot[j]*fg[j]<=0:\n ret[j] += abs(fg[j] - tot[j])\n tot[j] += fg[j] - tot[j]\n fg[j]*=-1\n return min(ret)\nprint(ma())", "n = int(input())\nf,*A,= map(int,input().split())\npcnt = 0 if f>0 else 1-f\nncnt = 0 if f<0 else f+1\npcur = max(1,f)\nncur = min(-1,f)\nfor i,a in enumerate(A):\n\tif pcur*(pcur+a)<0:\n\t\tpcur += a\n\telse:\n\t\tpcnt += abs((-1)**(i+1)-(pcur+a))\n\t\tpcur = (-1)**(i+1)\n\tif ncur*(ncur+a)<0:\n\t\tncur += a\n\telse:\n\t\tncnt += abs((-1)**i-(ncur+a))\n\t\tncur = (-1)**i\nprint(min(pcnt,ncnt))", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\nimport java.util.StringJoiner;\n\nclass Main {\n\n static PrintWriter out;\n static InputReader sc;\n\n static final int MOD = (int) 1e9 + 7;\n\n public static void main(String[] args) {\n sc = new InputReader(System.in);\n out = new PrintWriter(System.out);\n solve();\n out.flush();\n }\n\n static void solve() {\n int N = sc.nextInt();\n long[] a = sc.nextLongArray(N);\n long c1 = 0;\n long c2 = 0;\n long sum = 0;\n long c = 1;\n\n for (int i = 0; i < N; i++) {\n sum += a[i];\n if (sum * c <= 0) {\n c1 += Math.abs(sum) + 1;\n sum = c;\n }\n c *= -1;\n }\n\n sum = 0;\n c = -1;\n for (int i = 0; i < N; i++) {\n sum += a[i];\n if (sum * c <= 0) {\n c2 += Math.abs(sum) + 1;\n sum = c;\n }\n c *= -1;\n }\n\n out.println(Math.min(c1, c2));\n }\n\n static void debug(Object... args) {\n StringJoiner j = new StringJoiner(\" \");\n for (Object arg : args) {\n Class<?> type = arg.getClass();\n if (!type.isArray()) {\n j.add(arg.toString());\n } else if (type.getComponentType().isArray()) {\n for (Object o : (Object[]) arg) {\n debug(o);\n }\n } else if (arg instanceof int[]) {\n j.add(Arrays.toString((int[]) arg));\n } else if (arg instanceof long[]) {\n j.add(Arrays.toString((long[]) arg));\n } else if (arg instanceof double[]) {\n j.add(Arrays.toString((double[]) arg));\n } else if (arg instanceof char[]) {\n j.add(Arrays.toString((char[]) arg));\n } else if (arg instanceof boolean[]) {\n j.add(Arrays.toString((boolean[]) arg));\n } else if (arg instanceof Object[]) {\n j.add(Arrays.toString((Object[]) arg));\n } else {\n j.add(arg.toString());\n }\n }\n System.err.println(j.toString());\n }\n\n static class InputReader {\n\n private InputStream in;\n private byte[] buffer = new byte[1024];\n private int curbuf;\n private int lenbuf;\n\n public InputReader(InputStream in) {\n this.in = in;\n this.curbuf = this.lenbuf = 0;\n }\n\n public boolean hasNextByte() {\n if (this.curbuf >= this.lenbuf) {\n this.curbuf = 0;\n try {\n this.lenbuf = this.in.read(this.buffer);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (this.lenbuf <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (this.hasNextByte()) {\n return this.buffer[this.curbuf++];\n } else {\n return -1;\n }\n }\n\n private boolean isSpaceChar(int c) {\n return !(c >= 33 && c <= 126);\n }\n\n private void skip() {\n while (this.hasNextByte() && this.isSpaceChar(this.buffer[this.curbuf])) {\n this.curbuf++;\n }\n }\n\n public boolean hasNext() {\n this.skip();\n return this.hasNextByte();\n }\n\n public String next() {\n if (!this.hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = this.readByte();\n while (!this.isSpaceChar(b)) {\n sb.appendCodePoint(b);\n b = this.readByte();\n }\n return sb.toString();\n }\n\n public int nextInt() {\n if (!this.hasNext()) {\n throw new NoSuchElementException();\n }\n int c = this.readByte();\n while (this.isSpaceChar(c)) {\n c = this.readByte();\n }\n boolean minus = false;\n if (c == '-') {\n minus = true;\n c = this.readByte();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res = res * 10 + c - '0';\n c = this.readByte();\n } while (!this.isSpaceChar(c));\n return minus ? -res : res;\n }\n\n public long nextLong() {\n if (!this.hasNext()) {\n throw new NoSuchElementException();\n }\n int c = this.readByte();\n while (this.isSpaceChar(c)) {\n c = this.readByte();\n }\n boolean minus = false;\n if (c == '-') {\n minus = true;\n c = this.readByte();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res = res * 10 + c - '0';\n c = this.readByte();\n } while (!this.isSpaceChar(c));\n return minus ? -res : res;\n }\n\n public double nextDouble() {\n return Double.parseDouble(this.next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = this.nextInt();\n }\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = this.nextLong();\n }\n return a;\n }\n\n public char[][] nextCharMap(int n, int m) {\n char[][] map = new char[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = this.next().toCharArray();\n }\n return map;\n }\n }\n}", "#include <iostream>\n#include <vector>\n#include <set>\n#include <utility>\n#include <string>\n#include <algorithm>\n#include <cmath>\n\ntypedef long long ll;\nusing namespace std;\n\nint a[100005];\nint n;\n\nll calc(int mod)\n{\n ll sum = 0, res = 0;\n for (int i = 1; i <= n; i++){\n sum += a[i];\n if (i % 2 == mod && sum <= 0){\n res += (1 - sum);\n sum = 1;\n }\n else if(i % 2 != mod && sum >= 0){\n res += (sum + 1);\n sum = -1;\n }\n }\n return res;\n}\n\nint main()\n{\n cin >> n;\n for (int i = 1; i <= n; i++){\n cin >> a[i];\n }\n cout << min(calc(0), calc(1)) << endl;\n return 0;\n}", "import java.util.*; import java.io.*; import java.math.*;\npublic class Main{\n\t//Don't have to see. start------------------------------------------\n\tstatic class InputIterator{\n\t\tArrayList<String> inputLine = new ArrayList<String>(1024);\n\t\tint index = 0; int max; String read;\n\t\tInputIterator(){\n\t\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\ttry{\n\t\t\t\twhile((read = br.readLine()) != null){\n\t\t\t\t\tinputLine.add(read);\n\t\t\t\t}\n\t\t\t}catch(IOException e){}\n\t\t\tmax = inputLine.size();\n\t\t}\n\t\tboolean hasNext(){return (index < max);}\n\t\tString next(){\n\t\t\tif(hasNext()){\n\t\t\t\treturn inputLine.get(index++);\n\t\t\t}else{\n\t\t\t\tthrow new IndexOutOfBoundsException(\"There is no more input\");\n\t\t\t}\n\t\t}\n\t}\n\tstatic HashMap<Integer, String> CONVSTR = new HashMap<Integer, String>();\n\tstatic InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic void flush(){out.flush();}\n\tstatic void myout(Object t){out.println(t);}\n\tstatic void myerr(Object t){System.err.print(\"debug:\");System.err.println(t);}\n\tstatic String next(){return ii.next();}\n\tstatic boolean hasNext(){return ii.hasNext();}\n\tstatic int nextInt(){return Integer.parseInt(next());}\n\tstatic long nextLong(){return Long.parseLong(next());}\n\tstatic double nextDouble(){return Double.parseDouble(next());}\n\tstatic ArrayList<String> nextStrArray(){return myconv(next(), 8);}\n\tstatic ArrayList<String> nextCharArray(){return myconv(next(), 0);}\n\tstatic ArrayList<Integer> nextIntArray(){\n\t\tArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<Integer>(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Integer.parseInt(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\tstatic ArrayList<Long> nextLongArray(){\n\t\tArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<Long>(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Long.parseLong(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\tstatic String myconv(Object list, int no){//only join\n\t\tString joinString = CONVSTR.get(no);\n\t\tif(list instanceof String[]){\n\t\t\treturn String.join(joinString, (String[])list);\n\t\t}else if(list instanceof ArrayList){\n\t\t\treturn String.join(joinString, (ArrayList)list);\n\t\t}else{\n\t\t\tthrow new ClassCastException(\"Don't join\");\n\t\t}\n\t}\n\tstatic ArrayList<String> myconv(String str, int no){//only split\n\t\tString splitString = CONVSTR.get(no);\n\t\treturn new ArrayList<String>(Arrays.asList(str.split(splitString)));\n\t}\n\tpublic static void main(String[] args){\n\t\tCONVSTR.put(8, \" \"); CONVSTR.put(9, \"\\n\"); CONVSTR.put(0, \"\");\n\t\tsolve();flush();\n\t}\n\t//Don't have to see. end------------------------------------------\n\tstatic void solve(){//Here is the main function\n\t\tint N = nextInt();\n\t\tArrayList<Integer> tmp = nextIntArray();\n\t\tint[] list = new int[N];\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tlist[i] = tmp.get(i);\n\t\t}\n\t\tlong oddCount = 0;\n\t\tlong evenCount = 0;\n\t\tlong[] oddSum = new long[N];//1, -1, 1, -1\n\t\tlong[] evenSum = new long[N];//-1, 1 ,-1 ,1\n\t\tif(list[0] == 0){\n\t\t\toddSum[0] = 1;\n\t\t\tevenSum[0] = -1;\n\t\t\toddCount++;\n\t\t\tevenCount++;\n\t\t}else{\n\t\t\tif(list[0] < 0){\n\t\t\t\toddCount += Math.abs(list[0]) + 1;\n\t\t\t\toddSum[0] = 1;\n\t\t\t\tevenSum[0] = list[0];\n\t\t\t}else{\n\t\t\t\tevenCount += Math.abs(list[0]) + 1;\n\t\t\t\tevenSum[0] = -1;\n\t\t\t\toddSum[0] = list[0];\n\t\t\t}\n\t\t}\n\t\tfor(int i = 1; i < N; i++){\n\t\t\toddSum[i] = oddSum[i - 1] + list[i];\n\t\t\tevenSum[i] = evenSum[i - 1] + list[i];\n\t\t\tif((oddSum[i - 1] < 0 && oddSum[i] > 0) || (oddSum[i - 1] > 0 && oddSum[i] < 0)){\n\t\t\t\t\n\t\t\t}else{\n\t\t\t\tif((oddSum[i - 1] > 0)){\n\t\t\t\t\toddCount += oddSum[i] + 1;\n\t\t\t\t\toddSum[i] = -1;\n\t\t\t\t}else{\n\t\t\t\t\toddCount += Math.abs(oddSum[i]) + 1;\n\t\t\t\t\toddSum[i] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif((evenSum[i - 1] < 0 && evenSum[i] > 0) || (evenSum[i - 1] > 0 && evenSum[i] < 0)){\n\t\t\t\t\n\t\t\t}else{\n\t\t\t\tif((evenSum[i - 1] > 0)){\n\t\t\t\t\tevenCount += evenSum[i] + 1;\n\t\t\t\t\tevenSum[i] = -1;\n\t\t\t\t}else{\n\t\t\t\t\tevenCount += Math.abs(evenSum[i]) + 1;\n\t\t\t\t\tevenSum[i] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmyout(Math.min(evenCount, oddCount));\n\t}\n\t//Method addition frame start\n\n\n\n\t//Method addition frame end\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, n) for(int i = 0; i < n; i++)\nusing ll = long long;\n\nint n;\nint a[100000];\n\nll solve(ll t){\n ll res = 0, sum = 0;\n for (ll i = 0; i < n; i++, t = -t){\n sum += a[i];\n if (sum * t > 0) continue;\n res += abs(sum - t);\n sum += t * abs(sum - t);\n }\n return res;\n}\n\nint main(){\n cin >> n;\n REP(i,n) cin >> a[i];\n ll res = solve(1);\n res = min(res, solve(-1));\n cout << res << endl;\n return 0;\n}", "N=int(input())\nA=list(map(int,input().split()))\nres=10**15\nfor isplus in (True,False):\n cur=0\n ans=0\n for i in range(N):\n cur+=A[i]\n if isplus:\n if cur<=0:\n ans+=abs(cur-1)\n cur=1\n isplus=False\n else:\n if cur>=0:\n ans+=abs(cur-(-1))\n cur=-1\n isplus=True\n if res>ans:\n res=ans\n\nprint(res)", "n = int(input())\na = list(map(int,input().split()))\n\ns = [0,0]\nans = [0,0]\n# [0]:+ - + - ... [1]:- + - + - ...\n\nfor i in range(n):\n s[0] += a[i]\n s[1] += a[i]\n if s[0]*pow(-1,i) <= 0:\n ans[0] += 1 - s[0]*pow(-1,i)\n s[0] = pow(-1,i)\n if s[1]*pow(-1,i) >= 0:\n ans[1] += s[1]*pow(-1,i) + 1\n s[1] = -pow(-1,i)\nprint(min(ans))\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint\tmain()\n{\n\tint\tn;\n\tcin >> n;\n\tvector<int64_t>\ta_vec(n);\n\tfor (int i = 0; i < n; ++i)\n\t\tcin >> a_vec.at(i);\n\tint64_t\tmin_step;\n\tfor (int j = 0; j < 2; ++j) {\n\t\tint\tsign = 2 * j - 1;\n\t\tint64_t\tsum = 0;\n\t\tint64_t\tstep = 0;\n\t\tfor (int i = 0; i < n; ++i, sign *= -1) {\n\t\t\tsum += a_vec.at(i);\n\t\t\tif (sign * sum > 0)\n\t\t\t\tcontinue;\n\t\t\tstep += - sign * sum + 1;\n\t\t\tsum = sign;\n\t\t}\n\t\tif (j == 0 || min_step > step)\n\t\t\tmin_step = step;\n\t}\n\tcout << min_step << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int(i)=0;i<(n);i++)\ntypedef long long ll;\n\nint main(){\n int n;cin>>n;ll p=0,m=0;\n vector<int> a(n,0);\n REP(i,n) cin>>a.at(i);\n //プラスで始める場合\n int sm=0;\n REP(i,n){\n sm+=a.at(i); \n if(!(i%2)){\n while(sm<=0){\n p++;\n sm++;\n }\n }else{\n while(sm>=0){\n p++;\n sm--;\n } \n }\n }\n \n //マイナスで始める場合\n sm=0;\n REP(i,n){\n sm+=a.at(i); \n if(!(i%2)){\n while(sm>=0){\n m++;\n sm--;\n }\n }else{\n while(sm<=0){\n m++;\n sm++;\n } \n }\n }\n\n cout<<min(m,p)<<endl;\n}", "N = int(input())\nA = [int(_) for _ in input().split()]\nnow = 0\ncnt = 0\nfor i, a in enumerate(A):\n b = (-1)**i\n now += a\n if now * b <= 0:\n cnt += abs(now - b)\n now = b\nans = cnt\nnow = 0\ncnt = 0\nfor i, a in enumerate(A):\n b = (-1)**(i + 1)\n now += a\n if now * b <= 0:\n cnt += abs(now - b)\n now = b\nans = min(ans, cnt)\nprint(ans)\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\ta[i] = Integer.parseInt(sc.next());\n\t\t}\n\t\tsc.close();\n\n\t\tlong sum = 0;\n\t\tlong cnt1 = 0;\n\t\tlong cnt2 = 0;\n\t\tlong flg = 1;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tsum += a[i];\n\t\t\tif(sum * flg <= 0) {\n\t\t\t\tcnt1 += Math.abs(sum) + 1;\n\t\t\t\tsum = flg;\n\t\t\t}\n\t\t\tflg *= -1;\n\t\t}\n\t\tflg = -1;\n\t\tsum = 0;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tsum += a[i];\n\t\t\tif(sum * flg <= 0) {\n\t\t\t\tcnt2 += Math.abs(sum) + 1;\n\t\t\t\tsum = flg;\n\t\t\t}\n\t\t\tflg *= -1;\n\t\t}\n\t\tSystem.out.println(Math.min(cnt1,cnt2));\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0 ; i < n ; i++) a[i] = sc.nextInt();\n\t\tlong sum = 0, ans = 0, ans2 = 0;\n\t\t// + - + - + ...\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 0 && sum <= 0) {\n\t\t\t\tans += 1 - sum;\n\t\t\t\tsum = 1;\n\t\t\t} else if(i % 2 == 1 && sum >= 0) {\n\t\t\t\tans += sum + 1;\n\t\t\t\tsum = -1;\n\t\t\t}\n\t\t}\n\t\tsum = 0;\n\t\t// - + - + - ...\n\t\tfor(int i = 0 ; i < n ; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 0 && sum >= 0) {\n\t\t\t\tans2 += sum + 1;\n\t\t\t\tsum = -1;\n\t\t\t} else if(i % 2 == 1 && sum <= 0) {\n\t\t\t\tans2 += 1 - sum;\n\t\t\t\tsum = 1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(ans, ans2));\n\t}\n}\n", "n = int(input())\na = list(map(int, input().split()))\nac = 0\nans1 = 0\nfor i in range(n):\n ac += a[i]\n if ac * (-1) ** i > 0:\n continue\n else:\n ans1 += abs(ac) + 1\n ac = (-1) ** i\n\nac = 0\nans2 = 0\nfor i in range(n):\n ac += a[i]\n if ac * (-1) ** i < 0:\n continue\n else:\n ans2 += abs(ac) + 1\n ac = (-1) ** (i + 1)\n\nprint(min(ans1, ans2))\n", "N = int(input())\na = list(map(int, input().split()))\nnum = float('inf')\nfor k in [0, 1]:\n s = 0\n tmp = 0\n for i in range(N):\n s += a[i]\n if i % 2 == k:\n if s <= 0:\n tmp += abs(s) + 1\n s = 1\n else:\n if s >= 0:\n tmp += abs(s) + 1\n s = -1\n num = min(tmp, num)\n\nprint(num)", "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().solve();\n\t}\n\t@SuppressWarnings(\"unchecked\")\n\tvoid solve() throws Exception {\n\t\tFastScanner in = new FastScanner(System.in);\n\n\t\tint n = in.nextInt();\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = in.nextLong();\n\t\t}\n\t\tlong[] b = a.clone();\n\t\tfor (int i = 0; i < b.length; i++) {\n\t\t\tb[i] = -b[i];\n\t\t}\n\n\t\tSystem.out.println(Math.min(f(a), f(b)));\n\n\t}\n\tlong f(long[] a) {\n\t\tint n = a.length;\n\n\t\tlong sum = 0;\n\t\tlong ret = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tsum += a[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\t// +\n\t\t\t\tlong d = Math.max(0, 1 - sum);\n\t\t\t\tsum += d;\n\t\t\t\tret += d;\n\n\t\t\t} else {\n\t\t\t\t// -\n\t\t\t\tlong d = Math.max(0, sum + 1);\n\t\t\t\tsum -= d;\n\t\t\t\tret += d;\n\t\t\t}\n\t\t}\n\n\t\treturn ret;\n\t}\n\t//\n\t//\n\t//\n\t//\n\t//\n\t//\n\t//\n\t//\n\t//\n\t//\n\t//\n\t//\n\tclass FastScanner {\n\n\t\tprivate InputStream _stream;\n\t\tprivate byte[] _buf = new byte[1024];\n\t\tprivate int _curChar;\n\t\tprivate int _numChars;\n\t\tprivate StringBuilder _sb = new StringBuilder();\n\n\t\tFastScanner(InputStream stream) {\n\t\t\tthis._stream = stream;\n\t\t}\n\n\t\tpublic int read() {\n\t\t\tif (_numChars == -1) throw new InputMismatchException();\n\t\t\tif (_curChar >= _numChars) {\n\t\t\t\t_curChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\t_numChars = _stream.read(_buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (_numChars <= 0) return -1;\n\t\t\t}\n\t\t\treturn _buf[_curChar++];\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tint c = read();\n\t\t\twhile (isWhitespace(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\t_sb.setLength(0);\n\t\t\tdo {\n\t\t\t\t_sb.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isWhitespace(c));\n\t\t\treturn _sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn (int) nextLong();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tint c = read();\n\t\t\twhile (isWhitespace(c)) {\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tint sgn = 1;\n\t\t\tif (c == '-') {\n\t\t\t\tsgn = -1;\n\t\t\t\tc = read();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9') throw new InputMismatchException();\n\t\t\t\tres *= 10;\n\t\t\t\tres += c - '0';\n\t\t\t\tc = read();\n\t\t\t} while (!isWhitespace(c));\n\t\t\treturn res * sgn;\n\t\t}\n\n\t\tpublic boolean isWhitespace(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\t}\n}\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll cnt = 1e15;\nint main(){\n int n;\n cin >> n;\n int a[n];\n for(int i=0;i<n;i++) cin >> a[i];\n for(int j=0;j<2;j++){\n ll cnt1 = 0,s = 0;\n \tfor(int i=0;i<n;i++){\n \ts += a[i];\n \tint k = (1-2*(i%2))*(1-2*j);\n \tif(s*k<=0){\n cnt1 += 1-k*s;\n s = k;\n }\n }\n cnt = min(cnt1,cnt);\n }\n cout << cnt << endl;\n}\n", "#include<iostream>\n#include<vector>\nusing namespace std;\ntypedef long long li;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define df 0\ntemplate<class T> void print(const T& t){ cout << t << \"\\n\"; }\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << \" \"; print(ts...); }\n\nint main(){\n int n; cin >>n;\n vector<li> s(2,0),c(2,0);\n rep(i,n){\n li a; cin >>a;\n rep(j,2){\n s[j]+=a;\n if((i+j)%2){\n if(s[j]>=0){\n c[j]+=s[j]+1;\n s[j]=-1;\n }\n }else{\n if(s[j]<=0){\n c[j]+=-s[j]+1;\n s[j]=1;\n }\n }\n }\n }\n print(min(c[0],c[1]));\n}\n", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tList<Long> alist = new ArrayList<>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\talist.add(sc.nextLong());\n\t\t}\n\n\t\tlong cntOdd = 0;\n\t\tlong cntEvn = 0;\n\t\tlong sum = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\n\t\t\tsum += alist.get(i);\n\n\t\t\t//iが偶数のとき正\n\t\t\tif(i%2 == 0) {\n\t\t\t\tif(sum > 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tlong diff = 1-sum;\n\t\t\t\t\tcntEvn += 1-sum;\n\t\t\t\t\tsum += diff;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(sum < 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tlong diff = 1+sum;\n\t\t\t\t\tcntEvn += 1+sum;\n\t\t\t\t\tsum -= diff;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tsum =0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\n\t\t\tsum += alist.get(i);\n\n\t\t\t//iが偶数のとき負\n\t\t\tif (i%2 == 0) {\n\t\t\t\tif(sum < 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tlong diff = 1+sum;\n\t\t\t\t\tcntOdd += 1+sum;\n\t\t\t\t\tsum -= diff;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(sum > 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tlong diff = 1-sum;\n\t\t\t\t\tcntOdd += 1-sum;\n\t\t\t\t\tsum += diff;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(cntOdd <= cntEvn) {\n\t\t\tSystem.out.println(cntOdd);\n\t\t} else {\n\t\t\tSystem.out.println(cntEvn);\n\t\t}\n\t}\n}\n", "n = int(raw_input())\nA = map(int, raw_input().split())\nif A[0] > 0:\n psep = A[0]\n psop = -1\n opop = abs(-1 - A[0])\n opep = 0\nelif A[0] < 0:\n psep = 1\n psop = A[0]\n opep = abs(1-A[0])\n opop = 0\nelse:\n psep = 1\n psop = -1\n opep = 1\n opop = 1\nfor i in range(1, n):\n if i % 2 == 0:\n if psep + A[i] <= 0:\n opep += abs(1 - (psep + A[i]))\n psep = 1\n else:\n psep = psep + A[i]\n if psop + A[i] >= 0:\n opop += abs(-1 - (psop + A[i]))\n psop = -1\n else:\n psop += A[i]\n else:\n if psep + A[i] >= 0:\n opep += abs(-1 - (psep+A[i]))\n psep = -1\n else:\n psep += A[i]\n if psop + A[i] <= 0:\n opop += abs(1-(psop+A[i]))\n psop = 1\n else:\n psop = psop + A[i]\nprint min(opop, opep)", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\n\npublic class Main {\n public static void main(String[] args) {\n try {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n StringTokenizer str = new StringTokenizer(br.readLine(), \" \");\n long[] A = new long[n];\n for(int i = 0; i < n ; i++) {\n A[i] = Integer.parseInt(str.nextToken());\n }\n long c = func(A,n);\n System.out.println(c);\n } catch (IOException e) {\n System.out.println(\"error\");\n }\n }\n static long func(long[] A,int n){\n long sum = 0;\n long c1 = 0,c2 = 0;\n for(int i = 0; i < n; i++){\n if(i%2==0 && sum+A[i]>=0){ //次は負\n c1 += (sum+A[i] + 1);\n sum = -1;\n }\n else if(i%2!=0 && sum+A[i]<=0){\n c1 += 1+(-sum-A[i]);\n sum = 1;\n }\n else{\n sum+=A[i];\n }\n }\n sum = 0;\n for(int i = 0; i < n; i++){\n if(i%2==0 && sum+A[i]<=0){ //次は負\n c2 += (-sum-A[i] + 1);\n sum = 1;\n }\n else if(i%2!=0 && sum+A[i]>=0){\n c2 += 1+sum+A[i];\n sum = -1;\n }\n else{\n sum+=A[i];\n }\n }\n\n return Math.min(c1,c2);\n }\n}", "n=int(input())\nl=list(map(int,input().split()))\ns=0\na=0\nfor i in range(n):\n s+=l[i]\n\n if i%2:\n if s<=0:\n a+=1-s\n s=1\n else:\n if s>=0:\n a+=s+1\n s=-1\n\nb=0;s=0\nfor i in range(n):\n s+=l[i]\n if i%2==0:\n if s<=0:\n b+=1-s\n s=1\n else:\n if s>=0:\n b+=s+1\n s=-1\nprint(min(a,b))", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n\tlong long n;\n\tcin >> n;\n\tvector<long long> a(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tlong long ans = 1e18;\n\tfor (int b = 0; b < 2; b++) {\n\t\tlong long s = 0, now = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlong long c = i%2==b ? 1 : -1;\n\t\t\ts += a[i];\n\t\t\tif (s <= 0 && c == 1) {\n\t\t\t\tnow += c - s;\n\t\t\t\ts = 1;\n\t\t\t} else if (s >= 0 && c == -1) {\n\t\t\t\tnow += s - c;\n\t\t\t\ts = -1;\n\t\t\t}\n\t\t}\n\t\tans = min(ans, now);\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "n = int(input())\nA = list(map(int,input().split()))\n\nS,cnt,res1 = 0,0,0\nfor a in A:\n\tS += a\n\tcnt += 1\n\tif cnt%2 == 1 and S <= 0:\n\t\tres1 += abs(S-1)\n\t\tS = 1\n\telif cnt%2 == 0 and S >= 0:\n\t\tres1 += S+1\n\t\tS = -1\n\nS,cnt,res2 = 0,0,0\nfor a in A:\n\tS += a\n\tcnt += 1\n\tif cnt%2 == 1 and S >= 0:\n\t\tres2 += S+1\n\t\tS = -1\n\telif cnt%2 == 0 and S <= 0:\n\t\tres2 += abs(S-1)\n\t\tS = 1\n\nprint(min(res1,res2))", "def inpl(): return input().split()\nn = int(input())\na = list(map(int, inpl()))\n\nans = float('inf')\nfor sgn in [1, -1]:\n s = 0\n cnt = 0\n for i in range(n):\n s += a[i]\n if s * sgn > 0:\n pass\n else:\n #s <= 0 and sgn = 1\n #s >= 0 and sgn = -1\n cnt += abs(sgn - s)\n s = sgn\n sgn *= (-1)\n ans = min(ans, cnt)\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\n\t\tint n = in.nextInt();\n\t\tlong[] a = new long[n];\n\n\t\tlong sum1 = 0,sum2 = 0, ans1 = 0, ans2 = 0;\n\n\t\tfor (int j = 0; j < a.length; j++) {\n\t\t\ta[j] = in.nextLong();\n\t\t}\n\t\tin.close();\n\n\t\tfor(int i = 0; i < n; i++) {//偶数がプラス\n\t\t\tif(sum1 + a[i] > 0) {\n\t\t\t\tsum1 += a[i];\n\t\t\t} else {\n\t\t\t\tans1 += 1 - (sum1 + a[i]);\n\t\t\t\tsum1 = 1;\n\t\t\t}\n//\t\t\tSystem.out.println(sum1 + \" \" + ans1);\n\t\t\ti++;\n\t\t\tif(i >= n) break;\n\t\t\tif(sum1 + a[i] < 0) {\n\t\t\t\tsum1 += a[i];\n\t\t\t} else {\n\t\t\t\tans1 += sum1 + a[i] + 1;\n\t\t\t\tsum1 = -1;\n\t\t\t}\n//\t\t\tSystem.out.println(sum1 + \" \" + ans1);\n\t\t}\n\t\tSystem.out.println();\n\n\t\tfor(int i = 0; i < n; i++) {//奇数がプラス\n\t\t\tif(sum2 + a[i] < 0) {\n\t\t\t\tsum2 += a[i];\n\t\t\t} else {\n\t\t\t\tans2 += sum2 + a[i] + 1;\n\t\t\t\tsum2 = -1;\n\t\t\t}\n//\t\t\tSystem.out.println(sum2 + \" \" + ans2);\n\t\t\ti++;\n\t\t\tif(i >= n) break;\n\t\t\tif(sum2 + a[i] > 0) {\n\t\t\t\tsum2 += a[i];\n\t\t\t} else {\n\t\t\t\tans2 += 1 - (sum2 + a[i]);\n\t\t\t\tsum2 = 1;\n\t\t\t}\n//\t\t\tSystem.out.println(sum2 + \" \" + ans2);\n\t\t}\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n}\n", "n=int(input())\na=list(map(int,input().split()))\nfg=[1,-1]\nret = [0]*2\ntot = [0]*2\nil = range(n)\njl = range(2)\nfor i in il:\n for j in jl:\n tot[j]+=a[i]\n if tot[j]*fg[j]<=0:\n ret[j] += abs(fg[j] - tot[j])\n tot[j] += fg[j] - tot[j]\n fg[j]*=-1\nprint(min(ret))", "n = int(input())\na = [int(i) for i in input().split()]\nans = [0, 0]\n\nfor i in range(2):\n S = 0\n for j in range(n):\n S += a[j]\n if j % 2 == i:\n if S <= 0:\n ans[i] += 1 - S\n S = 1\n else:\n if S >= 0:\n ans[i] += 1 + S\n S = -1\n \nprint(min(ans))", "\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.util.NoSuchElementException;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Main().solve();\n\t}\n\n\tprivate void solve() throws IOException {\n\t\ttry {\n\t\t\t//\t\t\tsolveA();\n\t\t\t//\t\t\tsolveB();\n\t\t\t//\t\t\tsolveB2();\n\t\t\tsolveC();\n\t\t\t// solveD();\n\t\t\t// solveE();\n\t\t\t// solveF();\n\t\t} finally {\n\t\t\tif (in != null) {\n\t\t\t\tin.close();\n\t\t\t}\n\t\t\tif (out != null) {\n\t\t\t\tout.flush();\n\t\t\t\tout.close();\n\t\t\t}\n\t\t}\n\n\t}\n\n\tprivate void solveA() {\n\t\tStringBuilder builder = new StringBuilder();\n\t\tIntStream.range(0, 3).forEach(i -> builder.append(next().charAt(0)));\n\t\tout.println(builder.toString().toUpperCase());\n\t}\n\n\tprivate void solveB() {\n\t\tBigDecimal v1 = new BigDecimal(next());\n\t\tBigDecimal v2 = new BigDecimal(next());\n\n\t\tswitch (v1.compareTo(v2)) {\n\t\tcase -1:\n\t\t\tout.println(\"LESS\");\n\t\t\tbreak;\n\t\tcase 0:\n\t\t\tout.println(\"EQUAL\");\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tout.println(\"GREATER\");\n\t\t\tbreak;\n\t\t}\n\n\t}\n\n\tprivate void solveB2() {\n\t\tString v1 = next();\n\t\tString v2 = next();\n\n\t\tint res = -9;\n\t\tif (v1.length() > v2.length()) {\n\t\t\tres = 1;\n\t\t} else if (v1.length() < v2.length()) {\n\t\t\tres = -1;\n\t\t} else {\n\t\t\tfor (int i = 0; i < v1.length(); i++) {\n\t\t\t\tif (v1.charAt(i) > v2.charAt(i)) {\n\t\t\t\t\tres = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t} else if (v1.charAt(i) < v2.charAt(i)) {\n\t\t\t\t\tres = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (res == -9) {\n\t\t\tres = 0;\n\t\t}\n\n\t\tswitch (res) {\n\t\tcase -1:\n\t\t\tout.println(\"LESS\");\n\t\t\tbreak;\n\t\tcase 0:\n\t\t\tout.println(\"EQUAL\");\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tout.println(\"GREATER\");\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tprivate void solveC() {\n\t\tfinal int numN = nextInt();\n\t\tint[] wkB = IntStream.range(0, numN).map(i -> nextInt()).toArray();\n\n\t\tlong sum1 = 0;\n\t\tlong cnt1 = 0;\n\t\t// a[0]を+にした場合の判定\n\t\tfor (int i = 0; i < numN; i++) {\n\t\t\tsum1 += wkB[i]; //1--iの合計\n\t\t\tif (i % 2 == 0 && sum1 <= 0) { //偶数番で-の時は反転\n\t\t\t\tcnt1 += (1 - sum1);//+-を反転させる最小手数(-になっているのでこれで+1までの手数になる)\n\t\t\t\tsum1 = 1; //sum1を1にすることで、次の判定は+となる\n\t\t\t} else if (i % 2 == 1 && sum1 >= 0) {\n\t\t\t\tcnt1 += (1 + sum1);//+-を反転させる最小手数(+になっているのでこれで-1になる手数になる)\n\t\t\t\tsum1 = -1;//sum1を-1にすることで、次の判定は-となる\n\t\t\t}\n\t\t\t/*\n\t\t\t * 偶数の時マイナス・奇数の時プラスだったら次合致するときにすべての整合性を取ればよい\n\t\t\t *\n\t\t\t */\n\n\t\t}\n\n\t\tlong sum2 = 0;\n\t\tlong cnt2 = 0;\n\t\t// a[0]を-にした場合の判定\n\t\tfor (int i = 0; i < numN; i++) {\n\t\t\tsum2 += wkB[i]; //1--iの合計()\n\t\t\tif (i % 2 == 1 && sum2 <= 0) { //偶数番で+の時は反転\n\t\t\t\tcnt2 += (1 - sum2);//+-を反転させる最小手数(-になっているのでこれで-1までの手数になる)\n\t\t\t\tsum2 = 1; //sum2を-1にすることで、次の判定は-となる\n\t\t\t} else if (i % 2 == 0 && sum2 >= 0) {\n\t\t\t\tcnt2 += (1 + sum2);//+-を反転させる最小手数(+になっているのでこれで-1になる手数になる)\n\t\t\t\tsum2 = -1;//sum2を-1にすることで、次の判定は+となる\n\t\t\t}\n\t\t\t/*\n\t\t\t * 偶数の時プラス・奇数の時マイナスだったら次合致するときにすべての整合性を取ればよい\n\t\t\t *\n\t\t\t */\n\n\t\t}\n\n\t\tout.println(Math.min(cnt1, cnt2));\n\t}\n\n\tprivate void solveC2() {\n\t\tfinal int numN = nextInt();\n\t\tint[] wkB = IntStream.range(0, numN).map(i -> nextInt()).toArray();\n\n\t\tlong sum1 = 0;\n\t\tlong cnt1 = 0;\n\t\t// a[0]を+にした場合の判定\n\t\tfor (int i = 0; i < numN; i++) {\n\t\t\tsum1 += wkB[i]; //1--iの合計\n\t\t\tif (i % 2 == 0 && sum1 <= 0) { //偶数番で-の時は反転\n\t\t\t\tcnt1 += (1 - sum1);//+-を反転させる最小手数(-になっているのでこれで+1までの手数になる)\n\t\t\t\tsum1 = 1; //sum1を1にすることで、次の判定は+となる\n\t\t\t} else if (i % 2 == 1 && sum1 >= 0) {\n\t\t\t\tcnt1 += (1 + sum1);//+-を反転させる最小手数(+になっているのでこれで-1になる手数になる)\n\t\t\t\tsum1 = -1;//sum1を-1にすることで、次の判定は-となる\n\t\t\t}\n\t\t\t/*\n\t\t\t * 偶数の時マイナス・奇数の時プラスだったらsum1の手数が足されるだけなので最小手数にならない\n\t\t\t *\n\t\t\t */\n\n\t\t}\n\n\t\tlong sum2 = 0;\n\t\tlong cnt2 = 0;\n\t\t// a[0]を-にした場合の判定\n\t\tfor (int i = 0; i < numN; i++) {\n\t\t\tsum2 += wkB[i]; //1--iの合計()\n\t\t\tif (i % 2 == 1 && sum2 <= 0) { //偶数番で+の時は反転\n\t\t\t\tcnt2 += (1 - sum2);//+-を反転させる最小手数(-になっているのでこれで-1までの手数になる)\n\t\t\t\tsum2 = 1; //sum2を-1にすることで、次の判定は-となる\n\t\t\t} else if (i % 2 == 0 && sum2 >= 0) {\n\t\t\t\tcnt2 += (1 + sum2);//+-を反転させる最小手数(+になっているのでこれで-1になる手数になる)\n\t\t\t\tsum2 = -1;//sum2を-1にすることで、次の判定は+となる\n\t\t\t}\n\t\t\t/*\n\t\t\t * 偶数の時プラス・奇数の時マイナスだったらsum2の手数が足されるだけなので最小手数にならない\n\t\t\t *\n\t\t\t */\n\n\t\t}\n\n\t\tout.println(Math.min(cnt1, cnt2));\n\t}\n\n\tprivate void solveD() {\n\t\tint numN = nextInt();\n\n\t\tout.println(\"\");\n\t}\n\n\tprivate void solveE() {\n\t\tint numN = nextInt();\n\n\t\tout.println(\"\");\n\t}\n\n\tprivate void solveF() {\n\t\tint numN = nextInt();\n\n\t\tout.println(\"\");\n\t}\n\n\tprivate final PrintWriter out = new PrintWriter(System.out);\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tprivate void skipUnprintable() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t}\n\n\tpublic boolean hasNext() {\n\t\tskipUnprintable();\n\t\treturn hasNextByte();\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n}", "#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\n#define rep(i,n) REP(i,0,n)\n#define REP(i,a,n) for(int i = a ; i < (int)n ; i++)\n\n\n\nsigned main(){\n long long a[100001];\n long long n;\n\n cin >> n;\n rep(i,n){\n cin >> a[i];\n }\n \n long long c1 = 0, c2 = 0;\n long long sum = 0;\n long long c = 1;\n\n // 奇数番目を正\n REP(i,0,n){\n sum += a[i];\n if(sum * c <= 0){\n c1 += (abs(sum)+1);\n sum = c;\n }\n c*=(-1);\n }\n \n // 偶数番目が正\n c = -1;\n sum = 0;\n REP(i,0,n){\n sum += a[i];\n if(sum * c <= 0){\n c2 += abs(sum)+1;\n sum = c;\n }\n c*=(-1);\n }\n\n cout << min(c1, c2) << endl;\n}\n", "n = int(input())\na = list(map(int,input().split()))\nA = 10 ** 15\n\nfor i in [1,-1]:\n B = 0\n C = 0\n for j in a:\n B += j\n if B * i <= 0:\n C += abs(B - i)\n B = i\n i *= -1\n A = min(A,C)\nprint(A)", "def f(a):\n mode=1\n s=0\n ans=0\n for i in range(n):\n s+=a[i]\n if mode*s<=0: ans+=abs(s)+1;s=mode\n mode*=-1\n return ans\n\n\nn=int(input())\na=list(map(int,input().split()))\nb=[-a[i] for i in range(n)]\n\nmode=1\ns=0\nprint(min(f(a),f(b)))", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint N;\nconst int MAX_N = 1e5 + 10;\nint A[MAX_N];\n\nll cnt(bool flg) {\n ll sm = (ll)A[0], res = 0;\n if(flg && sm <= 0) res += -sm + 1, sm = 1;\n if(!flg && sm >= 0) res += sm + 1, sm = -1;\n for(int i = 1; i < N; ++i) {\n flg = sm > 0;\n sm += (ll)A[i];\n if(flg && sm >= 0) res += sm + 1, sm = -1;\n if(!flg && sm <= 0) res += -sm + 1, sm = 1;\n }\n return res;\n}\n\nint main()\n{\n scanf(\"%d\", &N);\n for(int i = 0; i < N; ++i) scanf(\"%d\", &A[i]);\n ll res = min(cnt(true), cnt(false));\n printf(\"%lld\\n\", res);\n return 0;\n}\n\n", "n=int(input())\na=list(map(int,input().split()))\nfg=[1,-1]\nret=[0]*2\ntot=[0]*2\nfor i in range(n):\n for j in range(2):\n tot[j]+=a[i]\n if tot[j]*fg[j]<=0:\n ret[j]+=abs(fg[j]-tot[j])\n tot[j]+=fg[j]-tot[j]\n fg[j]*=-1\nprint(min(ret))", "#include <cstdio>\n#include <algorithm>\n#define maxn 100010\nusing namespace std;\nint n;\nlong long a[maxn];\nlong long ans1,ans2;\nlong long sum;\nint main() {\n\tscanf(\"%d\",&n);\n\tfor (int i=1;i<=n;i++) {\n\t\tscanf(\"%lld\",&a[i]);\n\t}\n\tsum=0LL; ans1=0LL;\n\tfor (int i=1;i<=n;i++) {\n\t\tsum+=a[i];\n\t\tif (i%2==1) {\n\t\t\tif (sum<=0) {\n\t\t\t\tans1+=1-sum;\n\t\t\t\tsum=1;\n\t\t\t}\n\t\t}\n\t\telse if (sum>=0) {\n\t\t\tans1+=sum+1;\n\t\t\tsum=-1;\n\t\t}\n\t}\n\tsum=0LL; ans2=0LL;\n\tfor (int i=1;i<=n;i++) {\n\t\tsum+=a[i];\n\t\tif (i%2==0) {\n\t\t\tif (sum<=0) {\n\t\t\t\tans2+=1-sum;\n\t\t\t\tsum=1;\n\t\t\t}\n\t\t}\n\t\telse if (sum>=0) {\n\t\t\tans2+=sum+1;\n\t\t\tsum=-1;\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",min(ans1,ans2));\n\treturn 0;\n}", "n=int(input())\na=[int(i) for i in input().split()]\n\ndef f(a,t):\n ans=0\n cur=0\n for i in a:\n cur+=i\n if t==True and cur<1:\n ans+=(1-cur)\n cur=1\n elif t==False and cur>-1:\n ans+=(1+cur)\n cur=-1\n t=not t\n return ans\nprint(min(f(a,True),f(a,False)))", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().execute();\n\t}\n\n\tpublic void execute() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfinal int N = sc.nextInt();\n\n\t\tlong[] A = new long[N];\n\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tlong ai = sc.nextLong();\n\t\t\tA[i] = ai;\n\t\t}\n\t\tlong cntA, cntB;\n\t\tlong sumA, sumB;\n\t\tsumA = sumB = 0;\n\t\tcntA = cntB = 0;\n\n\t\t//\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tsumA += A[i];\n\t\t\tsumB += A[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tif (sumA <= 0) {\n\t\t\t\t\tcntA += (Math.abs(sumA) + 1);\n\t\t\t\t\tsumA = 1;\n\t\t\t\t}\n\t\t\t\tif (sumB >= 0) {\n\t\t\t\t\tcntB += (Math.abs(sumB) + 1);\n\t\t\t\t\tsumB = -1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sumA >= 0) {\n\t\t\t\t\tcntA += (Math.abs(sumA) + 1);\n\t\t\t\t\tsumA = -1;\n\t\t\t\t}\n\t\t\t\tif (sumB <= 0) {\n\t\t\t\t\tcntB += (Math.abs(sumB) + 1);\n\t\t\t\t\tsumB = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(cntA, cntB));\n\t\tsc.close();\n\t}\n\n}\n", "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\n#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)\nconstexpr int sign(int n) { return n < 0 ? -1 : n > 0; }\n\nint main() {\n int N; cin >> N;\n\n vi A(N);\n rep(i, N)\n cin >> A[i];\n\n ll ans = 1e18;\n rep(k, 2) {\n ll sum = 0, tmp = 0;\n int SIGN = k*2-1;\n rep(i, N) {\n SIGN *= -1;\n if (sign(sum+A[i]) != SIGN) {\n tmp += abs(SIGN - (sum + A[i]));\n sum = SIGN;\n } else\n sum += A[i];\n }\n if (sum == 0)\n ++tmp;\n ans = min(ans, tmp);\n }\n cout << ans << endl;\n\n return 0;\n}\n", "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main() {\n\tint n; cin >> n;\n\tvector<int>a(n); for (auto&& x : a)cin >> x;\n\tlong long ans1 = 0, ans2 = 0, sum = 0;\n\t\n\tfor (int i = 0; i < n; i++) {\n\t\tsum += a[i];\n\t\tif (i % 2 == 0 && sum <= 0) {\n\t\t\tans1 += -sum + 1;\n\t\t\tsum = 1;\n\t\t}\n\t\telse if (i % 2 == 1 && sum >= 0) {\n\t\t\tans1 += sum + 1;\n\t\t\tsum = -1;\n\t\t}\n\t}\n\n\tsum = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tsum += a[i];\n\t\tif (i % 2 == 1 && sum <= 0) {\n\t\t\tans2 += -sum + 1;\n\t\t\tsum = 1;\n\t\t}\n\t\telse if (i % 2 == 0 && sum >= 0) {\n\t\t\tans2 += sum + 1;\n\t\t\tsum = -1;\n\t\t}\n\t}\n\tcout << min(ans1, ans2) << endl;\n\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main{\n Scanner in = new Scanner(System.in);\n\n void solve(){\n int n = in.nextInt();\n int[] a = new int [n];\n for(int i = 0; i < n; i++){\n a[i] = in.nextInt();\n }\n\n long ans1 = 0, ans2 = 0, sum = 0;\n for(int i = 0; i < n; i++){\n sum += a[i];\n if(i%2 == 1 && sum <= 0){\n ans1 += Math.abs(sum) + 1;\n sum = 1;\n }\n if(i%2 == 0 & sum >= 0){\n ans1 += Math.abs(sum) + 1;\n sum = -1;\n }\n }\n sum = 0;\n for(int i = 0; i < n; i++){\n sum += a[i];\n if(i%2 == 0 && sum <= 0){\n ans2 += Math.abs(sum) + 1;\n sum = 1;\n }\n if(i%2 == 1 & sum >= 0){\n ans2 += Math.abs(sum) + 1;\n sum = -1;\n }\n }\n\n System.out.println(Math.min(ans1, ans2));\n }\n\n public static void main(String[] args){\n new Main().solve(); \n }\n}", "n = int(input())\na = list(map(int, input().split()))\n\ntotal = [0, 0]\ncnt = [0, 0]\nfor i in range(2):\n for j in range(n):\n total[i] += a[j]\n if (i+j)%2 == 0:\n if total[i] >= 0:\n cnt[i] += abs(total[i]+1)\n total[i] = -1\n else:\n if total[i] <= 0:\n cnt[i] += abs(total[i]-1)\n total[i] = 1\nprint(min(cnt))\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint[] a = new int[n];\n\t\tint[] s = new int[n];\n\t\tlong sum = 0;\n\t\tlong count1 = 0,count2 = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i % 2 == 0 && sum + a[i] <= 0){\n\t\t\t\tcount1 += Math.abs(sum + a[i] - 1);\n\t\t\t\tsum = 1;\n\t\t\t}else if(i % 2 == 1 && sum + a[i] >= 0){\n\t\t\t\tcount1 += sum + a[i] + 1;\n\t\t\t\tsum = -1;\n\t\t\t}else{\n\t\t\t\tsum += a[i];\n\t\t\t}\n\t\t}\n\t\tsum = 0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i % 2 == 1 && sum + a[i] <= 0){\n\t\t\t\tcount2 += Math.abs(sum + a[i] -1);\n\t\t\t\tsum = 1;\n\t\t\t}else if(i % 2 == 0 && sum + a[i] >= 0){\n\t\t\t\tcount2 += sum + a[i] + 1;\n\t\t\t\tsum = -1;\n\t\t\t}else{\n\t\t\t\tsum += a[i];\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(Math.min(count1,count2));\n\n\t}\n\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N;\n cin >> N;\n vector<long> a(N);\n for(int i=0; i<N; i++){\n cin >> a.at(i);\n }\n \n long sump=0,sumn=0,p=0,n=0;\n \n for(int i=0; i<N; i++){\n sump+=a.at(i);\n if(i%2==0&&sump<=0){\n p+=1-sump;\n sump=1;\n }\n if(i%2==1&&sump>=0){\n p+=1+sump;\n sump=-1;\n }\n }\n for(int i=0; i<N; i++){\n sumn+=a.at(i);\n if(i%2==0&&sumn>=0){\n n+=1+sumn;\n sumn=-1;\n }\n if(i%2==1&&sumn<=0){\n n+=1-sumn;\n sumn=1;\n }\n }\n \n cout << min(p,n) << endl;\n}", "n = int(input())\na = list(map(int, input().split()))\n\nanswers = []\nfor l in range(2):\n sum = 0\n answer = 0\n for i in range(n):\n sum += a[i]\n if (i + l) % 2 == 0:\n if sum >= 0:\n answer += abs(sum) + 1\n sum = -1\n else:\n if sum <= 0:\n answer += abs(sum) + 1\n sum = 1\n answers.append(answer)\n\nprint(min(answers))", "import java.io.*;\nimport java.util.*;\nimport static java.lang.System.out;\n\npublic class Main{\n static MyReader in = new MyReader();\n\n public static void main(String[] args){\n int n = in.i();\n int[] a = in.ii();\n out.println(Math.min(solve(a, 1), solve(a, -1)));\n }\n\n static long solve(int[] a, int b) {\n long s = 0;\n long r = 0;\n for (int i = 0; i < a.length; i++) {\n long x = s + a[i];\n if (b * x > 0) {\n s = x;\n } else {\n s = b;\n r += Math.abs(x) + 1;\n }\n b = -b;\n }\n return r;\n }\n\n static class MyReader extends BufferedReader{\n MyReader(){\n super(new InputStreamReader(System.in));\n }\n\n String s(){\n try{return readLine();}catch(IOException e){return \"\";}\n }\n\n String[] ss(){\n return s().split(\" \");\n }\n\n int i(){\n return Integer.parseInt(s());\n }\n\n int[] ii(){\n String[] ss = ss();\n int[] ii = new int[ss.length];\n for(int j = 0; j < ss.length; j++) ii[j] = Integer.parseInt(ss[j]);\n return ii;\n }\n }\n}\n", "n = int(input())\na = list(map(int,input().split()))\n\nans = [0,0]\ncum = [0,0]\nsn = [1,-1]\n\nfor i, aa in enumerate(a):\n for j in range(2):\n if (-1)**i * sn[j] * aa > 0 and abs(aa) > abs(cum[j]):\n cum[j] += aa\n continue\n if cum[j]*aa < 0:\n ans[j] += abs(cum[j]) - abs(aa) + 1\n else:\n ans[j] += abs(cum[j]) + abs(aa) + 1\n cum[j] = (-1)**i * sn[j]\n \nprint(min(ans))", "import java.util.*;\nimport static java.lang.Math.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tint n = sc.nextInt();\n\t\tlong[] sum = new long[n+1];\n\t\tfor(int i = 0; i < n; i++){\n\t\t long a = sc.nextLong();\n\t\t if(i == 0){\n\t\t sum[i+1] = a;\n\t\t }else{\n\t\t sum[i+1] = sum[i] + a;\n\t\t }\n\t\t}\n\t\t\n\t\t// 計算\n\t\tlong result = 0;\n\t\tlong cnt = 0;\n\t\tlong plus = 0;\n\t\tsum[0] = -1;\n\t\tfor(int i = 0; i < n; i++){\n\t\t long prev = sum[i] + plus;\n\t\t long now = sum[i+1] + plus;\n\t\t if(Long.signum(prev)*Long.signum(now) == -1) continue;\n\t\t cnt += abs(now) + 1;\n\t\t plus += (abs(now) + 1)*Long.signum(prev)*(-1);\n\t\t}\n\t\tresult = cnt;\n\t\tcnt = 0;\n\t\tplus = 0;\n\t\tsum[0] = 1;\n\t\tfor(int i = 0; i < n; i++){\n\t\t long prev = sum[i] + plus;\n\t\t long now = sum[i+1] + plus;\n\t\t if(Long.signum(prev)*Long.signum(now) == -1) continue;\n\t\t cnt += abs(now) + 1;\n\t\t plus += (abs(now) + 1)*Long.signum(prev)*(-1);\n\t\t}\n\t\tresult = min(result, cnt);\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n}\n\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.stream.IntStream;\nimport java.util.stream.LongStream;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.UncheckedIOException;\nimport java.nio.charset.Charset;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n LightWriter out = new LightWriter(outputStream);\n CSequence solver = new CSequence();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CSequence {\n public void solve(int testNumber, LightScanner in, LightWriter out) {\n // out.setBoolLabel(LightWriter.BoolLabel.YES_NO_FIRST_UP);\n int n = in.ints();\n long[] a = in.longs(n);\n long ans = Long.MAX_VALUE;\n\n {\n long sum = 0;\n long t = 0;\n for (int i = 0; i < n; i++) {\n if (sum < 0) {\n sum += a[i];\n if (sum <= 0) {\n t += 1 - sum;\n sum = 1;\n }\n } else {\n sum += a[i];\n if (sum >= 0) {\n t += 1 + sum;\n sum = -1;\n }\n }\n }\n ans = Math.min(ans, t);\n }\n {\n long sum = 0;\n long t = 0;\n for (int i = 0; i < n; i++) {\n if (sum <= 0) {\n sum += a[i];\n if (sum <= 0) {\n t += 1 - sum;\n sum = 1;\n }\n } else {\n sum += a[i];\n if (sum >= 0) {\n t += 1 + sum;\n sum = -1;\n }\n }\n }\n ans = Math.min(ans, t);\n }\n out.ansln(ans);\n }\n\n }\n\n static class LightScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n public long longs() {\n return Long.parseLong(string());\n }\n\n public long[] longs(int length) {\n return IntStream.range(0, length).mapToLong(x -> longs()).toArray();\n }\n\n }\n\n static class LightWriter implements AutoCloseable {\n private final Writer out;\n private boolean autoflush = false;\n private boolean breaked = true;\n\n public LightWriter(Writer out) {\n this.out = out;\n }\n\n public LightWriter(OutputStream out) {\n this(new BufferedWriter(new OutputStreamWriter(out, Charset.defaultCharset())));\n }\n\n public LightWriter print(char c) {\n try {\n out.write(c);\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter print(String s) {\n try {\n out.write(s, 0, s.length());\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter ans(String s) {\n if (!breaked) {\n print(' ');\n }\n return print(s);\n }\n\n public LightWriter ans(long l) {\n return ans(Long.toString(l));\n }\n\n public LightWriter ansln(long... n) {\n for (long n1 : n) {\n ans(n1).ln();\n }\n return this;\n }\n\n public LightWriter ln() {\n print(System.lineSeparator());\n breaked = true;\n if (autoflush) {\n try {\n out.flush();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n return this;\n }\n\n public void close() {\n try {\n out.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n}\n\n", "n=int(input())\na=list(map(int,input().split()))\nans=10**19\n\nfor i in [-1,1]:\n b=0\n c=0\n for j in a:\n b+=j\n if b*i<=0:\n c+=abs(b-i)\n b=i\n i*=-1\n ans=min(ans,c)\n\nprint(ans) ", "import java.util.*;\nimport java.io.*;\n\nclass Main{\n public static void main(String[] args){\n FastScanner fsc=new FastScanner();\n int n=fsc.nextInt();\n long[] a=new long[n];\n for(int i=0;i<n;i++){\n if(i==0) a[i]=fsc.nextLong();\n else a[i]=a[i-1]+fsc.nextLong();\n }\n fsc.close();\n long min=Long.MAX_VALUE;\n long pm=0;\n long count=0;\n for(int i=0;i<n;i++){\n if(i%2==0){\n if(a[i]+pm>=0){\n count+=a[i]+pm+1;\n pm-=a[i]+pm+1;\n }\n } else {\n if(a[i]+pm<=0){\n count+=-(a[i]+pm)+1;\n pm+=-(a[i]+pm)+1;\n }\n }\n }\n min=Math.min(min, count);\n\n pm=0;\n count=0;\n for(int i=0;i<n;i++){\n if(i%2==1){\n if(a[i]+pm>=0){\n count+=a[i]+pm+1;\n pm-=a[i]+pm+1;\n }\n } else {\n if(a[i]+pm<=0){\n count+=-(a[i]+pm)+1;\n pm+=-(a[i]+pm)+1;\n }\n }\n }\n min=Math.min(min, count);\n System.out.println(min);\n }\n static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte(){\n if(ptr<buflen) return true;\n else{\n ptr = 0;\n try{\n buflen = in.read(buffer);\n }\n catch(IOException e){\n e.printStackTrace();\n }\n if(buflen<=0) return false;\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) throw new NumberFormatException();\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }\n else if(b == -1 || !isPrintableChar(b)) return minus ? -n : n;\n else throw new NumberFormatException();\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n public void close(){\n try{in.close();}\n catch(IOException e){e.printStackTrace();}\n }\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0; i < n; i++)\n\t\t\ta[i] = sc.nextLong();\n\t\t\n\t\tlong sum1 = 0; //start with neg\n\t\tlong pay1 = 0;\n\t\tlong last1 = 0;\n\t\tint sign1;\n\t\tlong sum2 = 0; //start with neg\n\t\tlong pay2 = 0;\n\t\tlong last2 = 0;\n\t\tint sign2;\n\t\t\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\tsign1=i%2==0?-1:1;\n\t\t\tsign2=i%2==0?1:-1;\n\t\t\tlong cur = a[i];\n\t\t\t//1\n\t\t\t{\n\t\t\t\tif(sign1 == -1 && sum1+cur >= 0)\n\t\t\t\t{\n\t\t\t\t\tpay1 += (sum1+cur) + 1;\n\t\t\t\t\tlast1 = 1;\n\t\t\t\t\tsum1 = -1;\n\t\t\t\t}\n\t\t\t\telse if(sign1 == 1 && sum1+cur <= 0)\n\t\t\t\t{\n\t\t\t\t\tpay1 += 1 - (sum1+cur);\n\t\t\t\t\tsum1 = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsum1 += cur;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//2\n\t\t\t{\n\t\t\t\tif(sign2 == -1 && sum2+cur >= 0)\n\t\t\t\t{\n\t\t\t\t\tpay2 += (sum2+cur) + 1;\n\t\t\t\t\tlast2 = 1;\n\t\t\t\t\tsum2 = -1;\n\t\t\t\t}\n\t\t\t\telse if(sign2 == 1 && sum2+cur <= 0)\n\t\t\t\t{\n\t\t\t\t\tpay2 += 1 - (sum2+cur);\n\t\t\t\t\tsum2 = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsum2 += cur;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(Math.min(pay1, pay2));\n\t}\n\n}\n", "n = int(input())\na_list = list(map(int,input().split()))\n\ndef count(sign):\n \n count = 0\n a_sum = 0\n for a in a_list:\n a_sum +=a\n if a_sum*sign <= 0: \n ope = sign - a_sum\n a_sum += ope\n count += abs(ope)\n sign *= -1\n return count\nprint(min(count(1),count(-1)))\n", "N = input()\na = list(map(int, input().split()))\n \ndef f(x):\n cnt = 0\n cur = 0\n for ai in a:\n cur += ai\n cur *= x\n if cur <= 0:\n cnt += 1 - cur\n cur = 1\n cur *= x\n x *= -1\n return cnt\n \nprint(min(f(1), f(-1)))", "// C - Sequence\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define up(i,s,e,d) for(int i=(s);i<(e);i+=(d))\n\nll counting(vector<ll> &A, int N, bool OddEven){//OddEven: odd true, even false\n\tll c = 0, csum = 0;\n\tup(i,0,N,1){\n\t\tcsum += A[i];\n\t\tif(i%2==OddEven && csum<=0){// -0 NG\n\t\t\tc += abs(csum) + 1;\n\t\t\tcsum = 1;\n\t\t}\n\t\tif(i%2==!OddEven && csum>=0){// +0 NG\n\t\t\tc += abs(csum) + 1;\n\t\t\tcsum = -1;\n\t\t}\n\t}\n\treturn c;\n}\n\nint main(){\n\tint N; cin>>N;\n\tvector<ll> A(N);\n\tup(i,0,N,1) cin>>A[i];\n\tll a = counting(A,N,true);\n\tll b = counting(A,N,false);\n\tcout<< (a<b?a:b) <<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define MAX 100000\n\nint n;\nlong long a[MAX];\n\nint main()\n{\n\tcin >> n;\n\tfor( int i = 0; i < n; i++ ) {\n\t\tcin >> a[i];\n\t}\n\n\tlong long esum = 0;\n\tlong long osum = 0;\n\tlong long eans = 0;\n\tlong long oans = 0;\n\tfor( int i = 0; i < n; i++ ) {\n\t\tesum += a[i];\n\t\tosum += a[i];\n\t\tif( i % 2 ) {\n\t\t\tif( osum <= 0 ) {\n\t\t\t\toans += 1 - osum;\n\t\t\t\tosum = 1;\n\t\t\t}\n\t\t\tif( esum >= 0 ) {\n\t\t\t\teans += 1 + esum;\n\t\t\t\tesum = -1;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif( osum >= 0 ) {\n\t\t\t\toans += 1 + osum;\n\t\t\t\tosum = -1;\n\t\t\t}\n\t\t\tif( esum <= 0 ) {\n\t\t\t\teans += 1 - esum;\n\t\t\t\tesum = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << min( eans, oans ) << endl;\n\n\treturn 0;\n}\n", "\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(final String[] args) {\n final Scanner scanner = new Scanner(System.in);\n final int n = scanner.nextInt();\n\n long sum1 = 0, sum2 = 0;\n long cost1 = 0, cost2 = 0;\n long sign1 = 1, sign2 = -1;\n for (int i = 0; i < n; i++) {\n final long a = scanner.nextLong();\n sum1 += a;\n sum2 += a;\n\n if (sign1 == 1 && sum1 < 1) {\n cost1 += 1 - sum1;\n sum1 = 1;\n } else if (sign1 == -1 && sum1 > -1) {\n cost1 += sum1 + 1;\n sum1 = -1;\n }\n\n if (sign2 == 1 && sum2 < 1) {\n cost2 += 1 - sum2;\n sum2 = 1;\n } else if (sign2 == -1 && sum2 > -1) {\n cost2 += sum2 + 1;\n sum2 = -1;\n }\n\n sign1 *= -1;\n sign2 *= -1;\n }\n\n System.out.println(Math.min(cost1, cost2));\n }\n}\n", "n = int(input())\na = [int(i) for i in input().split()]\n\ncnt = 0\nsgn = 1\ns = 0\nfor _a in a:\n if (s + _a) * sgn <= 0:\n cnt += abs(_a + s - sgn)\n s = sgn\n else:\n s += _a\n sgn = -sgn\n\nans = cnt\n\ncnt = 0\nsgn = -1\ns = 0\nfor _a in a:\n if (s + _a) * sgn <= 0:\n cnt += abs(_a + s - sgn)\n s = sgn\n else:\n s += _a\n sgn = -sgn\n\nans = min(ans, cnt)\n\nprint(ans)", "#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tint a[n];\n\tfor (int i = 0;i < n;++i)cin >> a[i];\n\tlong long sum = 0, ans[2] = {};\n\tfor (int j = 0;j < 2;++j) {\n\t\tsum = 0;\n\t\tfor (int i = 0;i < n;++i) {\n\t\t\tif (i % 2 == j) {//+\n\t\t\t\tsum += a[i];\n\t\t\t\tif (sum <= 0) {\n\t\t\t\t\tans[j] += 1 - sum;\n\t\t\t\t\tsum = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {//-\n\t\t\t\tsum += a[i];\n\t\t\t\tif (sum >= 0) {\n\t\t\t\t\tans[j] += 1 + sum;\n\t\t\t\t\tsum = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << min(ans[0],ans[1]) << endl;\n}", "n = int(input())\na = list(map(int, input().split()))\nans = [0, 0]\ns = [0, 0]\nfor k in range(2):\n for i in range(n):\n t = (i + k) % 2 * 2 - 1\n s[k] += a[i]\n d = max(0, t * s[k] + 1)\n ans[k] += d\n s[k] += -t * d\nprint(min(ans))\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = sc.nextInt();\n }\n \n long countA = 0;\n long sum = 0;\n for (int i = 0; i < n; i++) {\n sum += array[i];\n if (i % 2 == 0) {\n if (sum <= 0) {\n countA += sum * (-1) + 1;\n sum = 1;\n }\n } else {\n if (sum >= 0) {\n countA += sum + 1;\n sum = -1;\n }\n }\n }\n \n long countB = 0;\n sum = 0;\n for (int i = 0; i < n; i++) {\n sum += array[i];\n if (i % 2 == 1) {\n if (sum <= 0) {\n countB += sum * (-1) + 1;\n sum = 1;\n }\n } else {\n if (sum >= 0) {\n countB += sum + 1;\n sum = -1;\n }\n }\n }\n \n System.out.println(Math.min(countA, countB));\n }\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint[]a =new int[n];\n\t\tlong[]sig = new long[n];\n\t\tint[]acopy = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\ta[i]=scan.nextInt();\n\t\t\tacopy[i]=a[i];\n/*\t\t\tif(i==0){\n\t\t\t\tsiga[i]=a[i];\n\t\t\t}else{\n\t\t\t\tsiga[i]=siga[i-1]+a[i];\n\t\t\t}*/\n\t\t}\n\n\n\n\n\t\t//第一項目が正の場合と負の場合\n\n\n\t\t//a[0]が0の場合を考える\n\t\tlong cnt=0;\n\n\t\tif(a[0]==0){\n\t\t\ta[0]++;\n\t\t\tcnt++;\n\t\t}\n\t\tsig[0]=a[0];\n\t\tfor(int i=1;i<n;i++){\n\t\t\tsig[i]=sig[i-1]+a[i];\n\n\t\t\t//積が0なら符号が異なるように+-1\n\t\t\tif(sig[i]*sig[i-1]==0){\n\t\t\t\tif(sig[i-1]>0){\n\t\t\t\t\ta[i]--;\n\t\t\t\t\tcnt++;\n\t\t\t\t}else{\n\t\t\t\t\ta[i]++;\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tsig[i]=sig[i-1]+a[i];\n\t\t\t}\n\n\t\t\t//積が負なら条件を満たしているのでok\n\t\t\telse if(sig[i]*sig[i-1]<0){\n\t\t\t}\n\n\t\t\t//積が正なら負になるまで変える\n\t\t\telse{\n\t\t\t\tif(sig[i-1]>0){\n\t\t\t\t\ta[i]-=(sig[i]+1);\n\t\t\t\t\tcnt+=sig[i]+1;\n\t\t\t\t}else{\n\t\t\t\t\ta[i]+=-sig[i]+1;\n\t\t\t\t\tcnt+=-sig[i]+1;\n\t\t\t\t}\n\t\t\t\tsig[i]=sig[i-1]+a[i];\n\t\t\t}\n\n\t\t}\n\n\n\t\tlong cnt2=0;\n\t\tif(acopy[0]==0){\n\t\t\tacopy[0]--;\n\t\t\tcnt2++;\n\t\t}else if(acopy[0]>0){\n\t\t\tcnt2 +=acopy[0]+1;\n\t\t\tacopy[0]=-1;\n\t\t}else{\n\t\t\tcnt2+=-acopy[0]+1;\n\t\t\tacopy[0]=1;\n\t\t}\n\t\tsig[0]=acopy[0];\n\t\tfor(int i=1;i<n;i++){\n\t\t\tsig[i]=sig[i-1]+acopy[i];\n\n\t\t\t//積が0なら符号が異なるように+-1\n\t\t\tif(sig[i]*sig[i-1]==0){\n\t\t\t\tif(sig[i-1]>0){\n\t\t\t\t\tacopy[i]--;\n\t\t\t\t\tcnt2++;\n\t\t\t\t}else{\n\t\t\t\t\tacopy[i]++;\n\t\t\t\t\tcnt2++;\n\t\t\t\t}\n\t\t\t\tsig[i]=sig[i-1]+acopy[i];\n\t\t\t}\n\n\t\t\t//積が負なら条件を満たしているのでok\n\t\t\telse if(sig[i]*sig[i-1]<0){\n\t\t\t}\n\n\t\t\t//積が正なら負になるまで変える\n\t\t\telse{\n\t\t\t\tif(sig[i-1]>0){\n\t\t\t\t\tacopy[i]-=(sig[i]+1);\n\t\t\t\t\tcnt2+=sig[i]+1;\n\t\t\t\t}else{\n\t\t\t\t\tacopy[i]+=-sig[i]+1;\n\t\t\t\t\tcnt2+=-sig[i]+1;\n\t\t\t\t}\n\t\t\t\tsig[i]=sig[i-1]+acopy[i];\n\t\t\t}\n\n\t\t}\n\n\n\t\tSystem.out.println(Math.min(cnt, cnt2));\n\n\t}\n\n}\n", "#include <iostream>\n#include <algorithm>\nusing namespace std;\ntypedef long long ll;\nint main(void) {\n int n;\n cin >> n;\n ll sum1 = 0, sum2 = 0, ans1 = 0, ans2 = 0;\n for (int i = 0; i < n; i++) {\n int a;\n cin >> a;\n sum1 += a;\n sum2 += a;\n if (i % 2 == 0) {\n if (sum1 <= 0) {\n ans1 += (1 - sum1);\n sum1 = 1;\n }\n if (sum2 >= 0) {\n ans2 += (sum2 + 1);\n sum2 = -1;\n }\n } else {\n if (sum2 <= 0) {\n ans2 += (1 - sum2);\n sum2 = 1;\n }\n if (sum1 >= 0) {\n ans1 += (sum1 + 1);\n sum1 = -1;\n }\n }\n }\n cout << min(ans1, ans2) << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n \n vector<long> a(n);\n for (int i=0; i<n; i++) cin >> a[i];\n \n long odd = 0, even = 0, sum = 0;\n \n for (int i=0; i<n; i++){\n sum += a[i];\n if(i%2==0&&sum<=0){\n odd += abs(sum)+1;\n sum = +1;\n }\n else if(i%2==1&&sum>=0){\n odd += abs(sum)+1;\n sum = -1;\n }\n }\n \n sum = 0;\n for (int i=0; i<n; i++){\n sum += a[i];\n if (i%2==1&&sum<=0){\n even += abs(sum)+1;\n sum = +1;\n }\n else if(i%2==0&&sum>=0){\n even+=abs(sum)+1;\n sum=-1;\n }\n }\n \n cout << min(odd,even) << endl;\n \n}", "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.awt.Point;\n \npublic class Main {\n\t//static final long MOD = 998244353L;\n\t//static final long INF = 1000000000000000007L;\n\tstatic final long MOD = 1000000007L;\n\tstatic final int INF = 1000000007;\n \n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\t\n\t\tint N = sc.ni();\n\t\tlong[] nums = new long[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tnums[i] = sc.nl();\n\t\t\n\t\tlong ans1 = 0;\n\t\tlong cur1 = 0;\n\t\t//first term is pos\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcur1 += nums[i];\n\t\t\tif (i%2 == 0) {\n\t\t\t\tif (cur1 <= 0) {\n\t\t\t\t\tans1 += (1-cur1);\n\t\t\t\t\tcur1 = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (cur1 >= 0) {\n\t\t\t\t\tans1 += (cur1+1);\n\t\t\t\t\tcur1 = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans2 = 0;\n\t\tlong cur2 = 0;\n\t\t//first term is neg\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcur2 += nums[i];\n\t\t\tif (i%2 == 1) {\n\t\t\t\tif (cur2 <= 0) {\n\t\t\t\t\tans2 += (1-cur2);\n\t\t\t\t\tcur2 = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (cur2 >= 0) {\n\t\t\t\t\tans2 += (cur2+1);\n\t\t\t\t\tcur2 = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpw.println(Math.min(ans1,ans2));\n\t\tpw.close();\n\t}\n\t\n\tstatic class Edge {\n\t\tpublic int from;\n\t\tpublic int to;\n\t\tpublic long weight;\n\t\tpublic Edge (int f, int t, long w) {\n\t\t\tfrom = f;\n\t\t\tto = t;\n\t\t\tweight = w;\n\t\t}\n\t}\n \n\tpublic static long dist(long[] p1, long[] p2) {\n\t\treturn (Math.abs(p2[0]-p1[0])+Math.abs(p2[1]-p1[1]));\n\t}\n\t\n\t//Find the GCD of two numbers\n\tpublic static long gcd(long a, long b) {\n\t\tif (a < b) return gcd(b,a);\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn gcd(b,a%b);\n\t}\n\t\n\t//Fast exponentiation (x^y mod m)\n\tpublic static long power(long x, long y, long m) { \n\t\tif (y < 0) return 0L;\n\t\tlong ans = 1;\n\t\tx %= m;\n\t\twhile (y > 0) { \n\t\t\tif(y % 2 == 1) \n\t\t\t\tans = (ans * x) % m; \n\t\t\ty /= 2; \n\t\t\tx = (x * x) % m;\n\t\t} \n\t\treturn ans; \n\t}\n\t\n\tpublic static int[] shuffle(int[] array) {\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t int temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\treturn array;\n\t}\n\t\n\tpublic static long[] shuffle(long[] array) {\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t long temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\treturn array;\n\t}\n\t\n\tpublic static int[][] shuffle(int[][] array) {\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t int[] temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\treturn array;\n\t}\n\t\n public static int[][] sort(int[][] array) {\n \t//Sort an array (immune to quicksort TLE)\n \n\t\tArrays.sort(array, new Comparator<int[]>() {\n\t\t\t @Override\n \t public int compare(int[] a, int[] b) {\n\t\t\t\t return a[0]-b[0]; //ascending order\n\t }\n\t\t});\n\t\treturn array;\n\t}\n \n public static long[][] sort(long[][] array) {\n \t//Sort an array (immune to quicksort TLE)\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t long[] temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\tArrays.sort(array, new Comparator<long[]>() {\n\t\t\t @Override\n \t public int compare(long[] a, long[] b) {\n\t\t\t\t if (a[0] < b[0])\n\t\t\t\t\t return -1;\n\t\t\t\t else if (a[0] > b[0])\n\t\t\t\t\t return 1;\n\t\t\t\t else\n\t\t\t\t\t return 0;\n\t }\n\t\t});\n\t\treturn array;\n\t}\n \n static class FastScanner { \n BufferedReader br; \n StringTokenizer st; \n \n public FastScanner() { \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next() { \n while (st == null || !st.hasMoreElements()) { \n try { \n st = new StringTokenizer(br.readLine());\n } catch (IOException e) { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n }\n \n int ni() { \n return Integer.parseInt(next()); \n }\n \n long nl() { \n return Long.parseLong(next()); \n } \n \n double nd() { \n return Double.parseDouble(next()); \n } \n \n String nextLine() {\n String str = \"\"; \n try { \n str = br.readLine(); \n } catch (IOException e) {\n e.printStackTrace(); \n } \n return str;\n }\n }\n}", "#include<bits/stdc++.h>\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define ALL(v) (v).begin(),(v).end()\n#define int long long\nusing namespace std;\ntypedef vector<int> vint;\ntypedef pair<int,int> pint;\n\nint N,a[100005];\n\nint solve(){\n int res=0,sum=0;\n REP(i,N){\n sum+=a[i];\n if(i%2==0 and sum<=0){\n res+=1-sum;\n sum=1;\n }\n if(i%2==1 and sum>=0){\n res+=sum+1;\n sum=-1;\n }\n }\n return res;\n}\n\nsigned main()\n{\n cin>>N;\n REP(i,N) cin>>a[i];\n \n int ans=solve();\n REP(i,N) a[i]*=-1;\n ans=min(ans,solve());\n cout<<ans<<endl;\n}\n", "#include <iostream>\n#include <algorithm>\n\nint n;\nlong long a[100005];\nint main(){\n std::cin>>n;\n for(int i=0;i<n;++i)\n std::cin>>a[i];\n \n long long ans1=0;\n long long sum=0;\n for(int i=0;i<n;++i){\n sum+=a[i];\n if(i%2==0){\n if(sum>=0){\n ans1+=sum+1;\n sum=-1;\n }\n }\n else\n if(sum<=0){\n ans1+=1-sum;\n sum=1;\n }\n }\n \n long long ans2=0;\n sum=0;\n for(int i=0;i<n;++i){\n sum+=a[i];\n if(i%2==0){\n if(sum<=0){\n ans2+=1-sum;\n sum=1;\n }\n }\n else\n if(sum>=0){\n ans2+=sum+1;\n sum=-1;\n }\n }\n \n std::cout<<std::min(ans1,ans2)<<std::endl;\n \n return 0;\n}", "import java.util.Scanner;\n \npublic class Main{\n\t\n\t\n\t\n\tpublic static void main(String args[])throws Exception{\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint N = sc.nextInt();\n\t\tlong[] a = new long[N];\n\t\tfor(int i=0;i<N;i++){\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\t\t\n\t\tlong ans1 = 0;\n\t\tlong ans2 = 0;\n\t\tlong s = 0;\n\t\tfor(int i=0;i<N;i++){\n\t\t\t\n\t\t\tif(i%2==0){\n\t\t\t\tif(s+a[i]<=0){\n\t\t\t\t\t\n\t\t\t\t\tans1 += 1-(s+a[i]);\n\t\n\t\t\t\t\ts=1;\n\t\t\t\t}else{\n\t\t\t\t\ts=s+a[i];\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(s+a[i]>=0){\n\t\t\t\t\t\n\t\t\t\t\tans1 += 1+(s+a[i]);\n\t\t\t\t\ts=-1;\n\t\t\t\t}else{\n\n\t\t\t\t\ts=s+a[i];\n\t\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\n\t\t}\n\t\t\n\t\ts = 0;\n\t\tfor(int i=0;i<N;i++){\n\t\t\t\n\t\t\tif(i%2==1){\n\t\t\t\tif(s+a[i]<=0){\n\t\t\t\t\t\n\t\t\t\t\tans2 += 1-(s+a[i]);\n\t\t\t\t\ts=1;\n\t\t\t\t}else{\n\t\t\t\t\ts=s+a[i];\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(s+a[i]>=0){\n\t\t\t\t\t\n\t\t\t\t\tans2 += 1+(s+a[i]);\n\t\t\t\t\ts=-1;\n\t\t\t\t}else{\n\t\t\t\t\ts=s+a[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n}\n\n", "n = int(input())\na = [int(i) for i in input().split()]\ncnt = [0,0]\ns = [0,0]\n\ndef is_pos(x,i):\n if not x >= 1:\n cnt[i] += 1-x\n s[i] = 1\n return\n\ndef is_neg(x,i):\n if not x <= -1:\n cnt[i] += 1+x\n s[i] = -1\n return\n \nfor i in range(n):\n s[0] += a[i]\n s[1] += a[i]\n x = i%2\n y = (i+1)%2\n is_pos(s[x],x)\n is_neg(s[y],y)\n\nans = min(cnt)\nprint(ans)", "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tint total1 = 0, total2 = 0;\n\t\tlong ans1 = 0, ans2 = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t\ttotal1 += a[i];\n\t\t\ttotal2 += a[i];\n\t\t\tif(i % 2 == 0) {\n\t\t\t\tif(total1 >= 0) {\n\t\t\t\t\tans1 += total1 + 1;\n\t\t\t\t\ttotal1 = -1;\n\t\t\t\t}\n\t\t\t\tif(total2 <= 0) {\n\t\t\t\t\tans2 -= total2-1;\n\t\t\t\t\ttotal2 = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif(total2 >= 0) {\n\t\t\t\t\tans2 += total2 +1;\n\t\t\t\t\ttotal2 = -1;\n\t\t\t\t}\n\t\t\t\tif(total1 <= 0) {\n\t\t\t\t\tans1 -= total1-1;\n\t\t\t\t\ttotal1 = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n\n}", "#include <iostream>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n long long int a[n];\n long long int ans[2] = {0};\n for (int i=0; i<n; ++i) cin >> a[i];\n for (int i=0; i<2; ++i) {\n int sign;\n long long int suma = 0;\n if (i==0) sign = 1;\n else sign = -1;\n for (int j=0; j<n; ++j) {\n suma += a[j];\n if (suma * sign <= 0) {\n ans[i] += abs(suma - sign);\n suma = sign;\n }\n sign *= -1;\n }\n }\n\n cout << min(ans[0], ans[1]) << endl;\n\n return 0;\n}", "//Sequence.cpp (C)\n#include <iostream>\nusing namespace std;\n\nlong long ans(int n, int*, int change);\n\nint main(){\n int n;\n int a[110000];\n cin >> n;\n for(int i = 0; i < n; i++) cin >> a[i];\n long long pAns,nAns;\n pAns = ans(n,a,1);\n nAns = ans(n,a,-1);\n printf(\"%lld\\n\",min(pAns,nAns));\n}\n\nlong long ans(int n, int *a, int change){\n long long Ans = 0;\n long long sum = 0;\n for(int i = 0; i < n; i++){\n sum += a[i];\n switch (change) {\n case -1:\n if(sum > -1) Ans += 1 + sum, sum = -1;\n change *= -1;\n break;\n\n case 1:\n if(sum < 1) Ans += 1 - sum, sum = 1;\n change *= -1;\n break;\n }\n }\n\n return Ans;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nll N;\nvector<ll> a;\n\nll calc(bool sig){\n ll ans = 0LL;\n ll sum = 0LL;\n\n for(ll i = 0; i < N; i++){\n if(sig ^ (i%2)){\n if(sum + a[i] <= 0){\n ans += 1 - (sum + a[i]); sum = 1;\n }else{\n sum += a[i];\n }\n }else{\n if(sum + a[i] >= 0){\n ans += 1 + (sum + a[i]); sum = -1;\n }else{\n sum += a[i];\n }\n }\n }\n return ans;\n}\n\nint main(){\n cin >> N;\n a.resize(N);\n for(ll i = 0; i < N; i++){\n cin >> a[i];\n }\n cout << min(calc(1), calc(0));\n}", "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\nsigned main() {\n\tios::sync_with_stdio(false); cin.tie(0);\n\tint n;\n\tcin >> n;\n\tlong long ans[2] = {};\n\tlong long sum[2] = {};\n\tfor (int i = 0; i < n; i++) {\n\t\tint x;\n\t\tcin >> x;\n\t\tfor (int j = 0; j < 2; j++) {\n\t\t\tsum[j] += x;\n\t\t\tif (j % 2 == i % 2) {\n\t\t\t\tif (sum[j] <= 0) {\n\t\t\t\t\tans[j] += 1 + abs(sum[j]);\n\t\t\t\t\tsum[j] = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (sum[j] >= 0) {\n\t\t\t\t\tans[j] += 1 + abs(sum[j]);\n\t\t\t\t\tsum[j] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << min(ans[0], ans[1]) << endl;\n\treturn 0;\t\n}", "import java.io.IOException;\nimport java.util.NoSuchElementException;\n\nimport java.io.InputStream;\n\nimport java.io.PrintWriter;\n\n@SuppressWarnings(\"unchecked\")\npublic class Main {\n static int n;\n static int[] a;\n\n static long f(long x) {\n long ope = 0;\n long cur = 0;\n\n for (int i = 0; i < n; i++) {\n // 同符号\n long aim = (long)a[i];\n\n // 異符号\n if (x * a[i] < 0)\n aim = x * (Math.abs(cur) + 1);\n // 同符号\n else if (Math.abs(a[i]) <= Math.abs(cur) + 1)\n aim = x * (Math.abs(cur) + 1);\n\n ope += Math.max(a[i], aim) - Math.min(a[i], aim);\n\n cur += aim;\n\n // 符号反転\n x *= -1;\n }\n\n return ope;\n }\n\n\n public static void main(String[] args) throws IOException {\n PrintWriter out = new PrintWriter(System.out);\n\n n = nextInt();\n\n a = new int[n];\n\n for (int i = 0; i < n; i++) a[i] = nextInt();\n\n long plus = f(1L);\n long minus = f(-1L);\n\n out.println(Math.min(plus, minus));\n\n out.flush();\n }\n\n // FastScanner start\n static final InputStream in = System.in;\n static final byte[] buffer = new byte[1024];\n static int ptr = 0;\n static int buflen = 0;\n static boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n static int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n static boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n return hasNextByte();\n }\n static String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n static long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if(b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n static int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n static double nextDouble() {\n return Double.parseDouble(next());\n }\n // FastScanner end\n}\n", "import math\nimport itertools\n\nINF = 10**9+7\n\nn = int(input())\ns = list(map(int,input().split()))\nfor i in range(1,n):\n\ts[i] = s[i] + s[i-1]\n\ndef solve(x):\n\tglobal s\n\tcost = 0\n\tdebt = 0\n\ty = [1,-1]\n\tfor i in range(len(s)):\n\t\tc = s[i]*x + debt\n\t\tif(y[i%2]!=sgn(c)):\n\t\t\tcost += abs(y[i%2]-c)\n\t\t\tdebt += y[i%2]-c\n\treturn cost\n\ndef sgn(n):\n\tif(n>0): return 1\n\tif(n<0): return -1\n\treturn 0\n\nprint(min(solve(-1),solve(1)))", "import java.util.ArrayList;\nimport java.util.Scanner;\n\n\n\n\nclass Main{\n\n\n\tstatic\tArrayList<Integer> one ;\n\tstatic\tArrayList<Integer> two ;\n\tstatic\tArrayList<Integer> three ;\n\tstatic\tArrayList<Integer> four ;\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\t\t\t//文字の入力\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\t\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\n\t\tlong sumx = 0;\n\t\tlong sumy = 0;\n\n\t\tlong ansx = 0;\n\t\tlong ansy = 0;\n\n\n\n\t\tfor(int i = 0;i < n;i++){\t\t\t\t\t//偶数番目で正\n\t\t\tif(i % 2 == 0){\n\t\t\t\tif(sumx + a[i] > 0){\n\t\t\t\t\tsumx += a[i];\n\t\t\t\t}else{\n\t\t\t\t\tansx += 1 + Math.abs(sumx + a[i]);\t\t\t//カウントを増やす\n\t\t\t\t\tsumx = 1;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(sumx + a[i] < 0){\n\t\t\t\t\tsumx += a[i];\n\t\t\t\t}else{\n\t\t\t\t\tansx += 1 + Math.abs(sumx + a[i]);\t\t\t//カウントを増やす\n\t\t\t\t\tsumx = -1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\tfor(int i = 0;i < n;i++){\t\t\t\t\t//偶数番目で負\n\t\t\tif(i % 2 == 0){\n\t\t\t\tif(sumy + a[i] < 0){\n\t\t\t\t\tsumy += a[i];\n\t\t\t\t}else{\n\t\t\t\t\tansy += 1 + Math.abs(sumy + a[i]);\t\t\t//カウントを増やす\n\t\t\t\t\tsumy = -1;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(sumy + a[i] > 0){\n\t\t\t\t\tsumy += a[i];\n\t\t\t\t}else{\n\t\t\t\t\tansy += 1 + Math.abs(sumy + a[i]);\t\t\t//カウントを増やす\n\t\t\t\t\tsumy = 1;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\n\t\t\tSystem.out.println(Math.min(ansx, ansy));\n\n\n\n\n\t\t}\n\n\t}\n\n\tclass Pair implements Comparable{\n\t\tCharacter from;\n\t\tint end;\n\t\t@Override\n\t\tpublic int compareTo(Object other) {\n\t\t\tPair otherpair = (Pair)other;\n\n\t\t\treturn end - otherpair.end;\n\t\t}\n\t}\n\n\n", "n=int(input())\na=list(map(int,input().split()))\np=0\nans_1=ans_2=0\nfor i in range(n):\n\tp+=a[i]\n\tif p>=0 and i%2==0:\n\t\tans_1+=p+1\n\t\tp=-1\n\telif p<=0 and i%2!=0:\n\t\tans_1+=-p+1\n\t\tp=1\np=0\nfor i in range(n):\n\tp+=a[i]\n\tif p>=0 and i%2!=0:\n\t\tans_2+=p+1\n\t\tp=-1\n\telif p<=0 and i%2==0:\n\t\tans_2+=-p+1\n\t\tp=1\nprint(min(ans_1,ans_2))\n\n\n\n\n", "n = int(input())\nA = list(map(int, input().split()))\ndef test(L, sgn):\n count = 0\n s = 0\n for i in L:\n sgn *= -1\n s += i\n if s*sgn > 0:\n continue\n if sgn > 0:\n count += (1 - s)\n s = 1\n else:\n count += (s + 1)\n s = -1\n return count\n\nans = min(test(A, 1), test(A, -1))\nprint(ans)", "# -*- coding: utf-8 -*-\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nans = 1e16\nfor s in (1, -1):\n res, cumsum = 0, 0\n for j in range(n):\n cumsum += a[j]\n if cumsum * s <= 0:\n res += abs(cumsum-s)\n cumsum = s\n s *= -1\n ans = min(ans, res)\n\nprint(ans)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < a.length; ++i) {\n a[i] = sc.nextInt();\n }\n\n System.out.println(solve(a));\n\n sc.close();\n }\n\n static long solve(int[] a) {\n return Math.min(computeOperationNum(a, false), computeOperationNum(a, true));\n }\n\n static long computeOperationNum(int[] a, boolean posOrNeg) {\n long result = 0;\n int sum = 0;\n for (int ai : a) {\n sum += ai;\n if (posOrNeg) {\n if (sum <= 0) {\n result += 1 - sum;\n sum = 1;\n }\n } else {\n if (sum >= 0) {\n result += sum + 1;\n sum = -1;\n }\n }\n\n posOrNeg = !posOrNeg;\n }\n\n return result;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n int64_t A=0,B=0;\n cin>>N;\n vector<int> p(N);\n for(int i=0;i<N;i++){\n cin>>p.at(i);\n }\n int Z=0;\n for(int i=0;i<N;i++){\n Z+=p.at(i);\n if(i%2==0){\n if(Z>=0){\n A+=1+Z;\n Z=-1;\n }\n }\n else{\n if(Z<=0){\n A+=1-Z;\n Z=1;\n }\n }\n }\n Z=0;\n for(int i=0;i<N;i++){\n Z+=p.at(i);\n if(i%2==1){\n if(Z>=0){\n B+=1+Z;\n Z=-1;\n }\n }\n else{\n if(Z<=0){\n B+=1-Z;\n Z=1;\n }\n }\n }\n cout<<min(A,B)<<endl;\n \n}", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint main(){\n int n;\n cin>>n;\n ll a[100005];\n rep(i,n) cin>>a[i];\n ll sum=0;\n ll a1=0,a2=0;\n rep(i,n){\n sum+=a[i];\n if(i&1){\n if(sum>=0){\n\ta1+=sum+1;\n\tsum=-1;\n }\n }\n else{\n if(sum<=0){\n\ta1+=1-sum;\n\tsum=1;\n }\n }\n }\n sum=0;\n rep(i,n){\n sum+=a[i];\n if(!(i&1)){\n if(sum>=0){\n\ta2+=sum+1;\n\tsum=-1;\n }\n }\n else{\n if(sum<=0){\n\ta2+=1-sum;\n\tsum=1;\n }\n }\n }\n cout<<min(a1,a2)<<endl;\n return 0;\n}", "import java.io.InputStream;\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Optional;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solveC(System.in);\n\t}\n\n\tprivate void solveC(InputStream is) {\n\t\tScanner sc = new Scanner(is);\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\t\tlong minSum = 0L;\n\t\tlong pluSum = 0L;\n\t\tlong minAns = 0L;\n\t\tlong pluAns = 0L;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tminSum += a[i];\n\t\t\tpluSum += a[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tif (minSum >= 0) {\n\t\t\t\t\tminAns += minSum + 1;\n\t\t\t\t\tminSum = -1;\n\t\t\t\t}\n\t\t\t\tif (pluSum <= 0) {\n\t\t\t\t\tpluAns += 1 - pluSum;\n\t\t\t\t\tpluSum = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (pluSum >= 0) {\n\t\t\t\t\tpluAns += pluSum + 1;\n\t\t\t\t\tpluSum = -1;\n\t\t\t\t}\n\t\t\t\tif (minSum <= 0) {\n\t\t\t\t\tminAns += 1 - minSum;\n\t\t\t\t\tminSum = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(minAns < pluAns ? minAns : pluAns);\n\t}\n\n\tprivate void solveB(InputStream is) {\n\t\tScanner sc = new Scanner(is);\n\t\tString s1 = sc.next();\n\t\tString s2 = sc.next();\n\t\tif (s1.length() > s2.length()) {\n\t\t\tString zero = \"\";\n\t\t\tfor (int i = 0; i < s1.length() - s2.length(); i++) {\n\t\t\t\tzero = zero + '0';\n\t\t\t}\n\t\t\ts2 = zero + s2;\n\t\t}\n\t\tif (s1.length() < s2.length()) {\n\t\t\tString zero = \"\";\n\t\t\tfor (int i = 0; i < s2.length() - s1.length(); i++) {\n\t\t\t\tzero = zero + '0';\n\t\t\t}\n\t\t\ts1 = zero + s1;\n\t\t}\n\t\tif (s1.compareTo(s2) > 0) {\n\t\t\tSystem.out.println(\"GREATER\");\n\t\t} else if (s1.compareTo(s2) < 0) {\n\t\t\tSystem.out.println(\"LESS\");\n\t\t} else {\n\t\t\tSystem.out.println(\"EQUAL\");\n\t\t}\n\t}\n\n\n\tprivate void solveA(InputStream is) {\n\t\tScanner sc = new Scanner(is);\n\t\tString s1 = sc.next();\n\t\tString s2 = sc.next();\n\t\tString s3 = sc.next();\n\t\tString ans = s1.substring(0, 1) + s2.substring(0, 1) + s3.substring(0, 1);\n\t\tSystem.out.println(ans.toUpperCase());\n\t}\n\n\tinterface CombCalculator {\n\t\tlong comb(int n, int m);\n\t}\n\n\tinterface MobiusFunction {\n\t\tint get(int n);\n\t}\n\n\t/**\n\t * メビウス関数をエラトステネスの篩っぽく前計算するクラスです。\n\t * 計算量はO(1)で、前計算でO(N logN)です。\n\t */\n\tclass SieveMobiusFunction implements MobiusFunction {\n\t\tint size;\n\t\tint[] mobiusFunctionValues;\n\n\t\tpublic SieveMobiusFunction(int size) {\n\t\t\tthis.size = size;\n\t\t\tmobiusFunctionValues = new int[size];\n\n\t\t\tmobiusFunctionValues[0] = 0;\n\t\t\tmobiusFunctionValues[1] = 1;\n\t\t\tfor (int i = 2; i < size; i++) {\n\t\t\t\tmobiusFunctionValues[i] = 1;\n\t\t\t}\n\t\t\tfor (int i = 2; i * i < size; i++) {\n\t\t\t\tfor (int k = 1; i * i * k < size; k++) {\n\t\t\t\t\tmobiusFunctionValues[i * i * k] *= 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int i = 2; i < size; i++) {\n\t\t\t\tif (mobiusFunctionValues[i] == 1) {\n\t\t\t\t\tfor (int k = 1; i * k < size; k++) {\n\t\t\t\t\t\tmobiusFunctionValues[i * k] *= -2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (mobiusFunctionValues[i] > 1) {\n\t\t\t\t\tmobiusFunctionValues[i] = 1;\n\t\t\t\t}\n\t\t\t\tif (mobiusFunctionValues[i] < -1) {\n\t\t\t\t\tmobiusFunctionValues[i] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic int get(int n) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\treturn mobiusFunctionValues[n];\n\t\t}\n\t}\n\n\t/**\n\t * メビウス関数を定義通り計算するクラスです。\n\t * 計算量はO(logN)です。\n\t */\n\tclass PrimeFactorizationMobiusFunction implements MobiusFunction {\n\t\t@Override\n\t\tpublic int get(int n) {\n\t\t\tif (n <= 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (n == 1) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tint num = 0;\n\t\t\tfor (int i = 2; i < n; i++) {\n\t\t\t\tif (n % i == 0) {\n\t\t\t\t\tn /= i;\n\t\t\t\t\tnum++;\n\t\t\t\t\tif (n % i == 0) {\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn num % 2 == 0 ? -1 : 1;\n\t\t}\n\t}\n\n\t/**\n\t * 組み合わせ計算を階乗の値で行うクラスです(MOD対応)\n\t * 階乗とその逆元は前計算してテーブルに格納します。\n\t * C(N, N) % M の計算量は O(1)、 前計算でO(max(N, logM))です。\n\t * sizeを1e8より大きい値で実行するとMLEの危険性があります。\n\t * また素数以外のMODには対応していません(逆元の計算に素数の剰余環の性質を利用しているため)。\n\t */\n\tclass FactorialTableCombCalculator implements CombCalculator {\n\t\tint size;\n\t\tlong[] factorialTable;\n\t\tlong[] inverseFactorialTable;\n\t\tlong mod;\n\n\t\tpublic FactorialTableCombCalculator(int size, long mod) {\n\t\t\tthis.size = size;\n\t\t\tfactorialTable = new long[size + 1];\n\t\t\tinverseFactorialTable = new long[size + 1];\n\t\t\tthis.mod = mod;\n\n\t\t\tfactorialTable[0] = 1L;\n\t\t\tfor (int i = 1; i <= size; i++) {\n\t\t\t\tfactorialTable[i] = (factorialTable[i - 1] * i) % mod;\n\t\t\t}\n\t\t\tinverseFactorialTable[size] = inverse(factorialTable[size], mod);\n\t\t\tfor (int i = size - 1; i >= 0; i--) {\n\t\t\t\tinverseFactorialTable[i] = (inverseFactorialTable[i + 1] * (i + 1)) % mod;\n\t\t\t}\n\t\t}\n\n\t\tprivate long inverse(long n, long mod) {\n\t\t\treturn pow(n, mod - 2, mod);\n\t\t}\n\n\t\tprivate long pow(long n, long p, long mod) {\n\t\t\tif (p == 0) {\n\t\t\t\treturn 1L;\n\t\t\t}\n\t\t\tlong half = pow(n, p / 2, mod);\n\t\t\tlong ret = (half * half) % mod;\n\t\t\tif (p % 2 == 1) {\n\t\t\t\tret = (ret * n) % mod;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic long comb(int n, int m) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0 || m < 0 || n < m) {\n\t\t\t\treturn 0L;\n\t\t\t}\n\t\t\treturn (((factorialTable[n] * inverseFactorialTable[m]) % mod) * inverseFactorialTable[n - m]) % mod;\n\t\t}\n\t}\n\n\t/**\n\t * 組み合わせ計算をテーブルで実装したクラスです(MOD対応)\n\t * 前計算でO(N^2), combはO(1)で実行できます\n\t * sizeを2 * 1e4より大きい値で実行するとMLEの危険性があります\n\t */\n\tclass TableCombCalculator implements CombCalculator {\n\t\tlong[][] table;\n\t\tint size;\n\n\t\tpublic TableCombCalculator(int size, long mod) {\n\t\t\tthis.size = size;\n\t\t\ttable = new long[size + 1][];\n\n\t\t\ttable[0] = new long[1];\n\t\t\ttable[0][0] = 1L;\n\t\t\tfor (int n = 1; n <= size; n++) {\n\t\t\t\ttable[n] = new long[n + 1];\n\t\t\t\ttable[n][0] = 1L;\n\t\t\t\tfor (int m = 1; m < n; m++) {\n\t\t\t\t\ttable[n][m] = (table[n - 1][m - 1] + table[n - 1][m]) % mod;\n\t\t\t\t}\n\t\t\t\ttable[n][n] = 1L;\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic long comb(int n, int m) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0 || m < 0 || n < m) {\n\t\t\t\treturn 0L;\n\t\t\t}\n\t\t\treturn table[n][m];\n\t\t}\n\t}\n\n\tinterface Graph {\n\t\tvoid link(int from, int to, long cost);\n\t\tOptional<Long> getCost(int from, int to);\n\t\tint getVertexNum();\n\t}\n\n\tinterface FlowResolver {\n\t\tlong maxFlow(int from, int to);\n\t}\n\n\t/**\n\t * グラフの行列による実装\n\t * 接点数の大きいグラフで使うとMLEで死にそう\n\t */\n\tclass ArrayGraph implements Graph {\n\t\tprivate Long[][] costArray;\n\t\tprivate int vertexNum;\n\n\t\tpublic ArrayGraph(int n) {\n\t\t\tcostArray = new Long[n][];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tcostArray[i] = new Long[n];\n\t\t\t}\n\t\t\tvertexNum = n;\n\t\t}\n\n\t\t@Override\n\t\tpublic void link(int from, int to, long cost) {\n\t\t\tcostArray[from][to] = new Long(cost);\n\t\t}\n\n\t\t@Override\n\t\tpublic Optional<Long> getCost(int from, int to) {\n\t\t\treturn Optional.ofNullable(costArray[from][to]);\n\t\t}\n\n\t\t@Override\n\t\tpublic int getVertexNum() {\n\t\t\treturn vertexNum;\n\t\t}\n\t}\n\n\t/**\n\t * DFS(深さ優先探索)による実装\n\t * 計算量はO(E*MaxFlow)のはず (E:辺の数, MaxFlow:最大フロー)\n\t */\n\tclass DfsFlowResolver implements FlowResolver {\n\t\tprivate Graph graph;\n\t\tpublic DfsFlowResolver(Graph graph) {\n\t\t\tthis.graph = graph;\n\t\t}\n\n\t\t/**\n\t\t * 最大フロー(最小カット)を求める\n\t\t * @param from 始点(source)のID\n\t\t * @param to 終点(target)のID\n\t\t * @return 最大フロー(最小カット)\n\t\t */\n\t\tpublic long maxFlow(int from, int to) {\n\t\t\tlong sum = 0L;\n\t\t\tlong currentFlow;\n\t\t\tdo {\n\t\t\t\tcurrentFlow = flow(from, to, Long.MAX_VALUE / 3, new boolean[graph.getVertexNum()]);\n\t\t\t\tsum += currentFlow;\n\t\t\t} while (currentFlow > 0);\n\t\t\treturn sum;\n\t\t}\n\n\t\t/**\n\t\t * フローの実行 グラフの更新も行う\n\t\t * @param from 現在いる節点のID\n\t\t * @param to 終点(target)のID\n\t\t * @param current_flow ここまでの流量\n\t\t * @param passed 既に通った節点か否かを格納した配列\n\t\t * @return 終点(target)に流した流量/戻りのグラフの流量\n\t\t */\n\t\tprivate long flow(int from, int to, long current_flow, boolean[] passed) {\n\t\t\tpassed[from] = true;\n\t\t\tif (from == to) {\n\t\t\t\treturn current_flow;\n\t\t\t}\n\t\t\tfor (int id = 0; id < graph.getVertexNum(); id++) {\n\t\t\t\tif (passed[id]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tOptional<Long> cost = graph.getCost(from, id);\n\t\t\t\tif (cost.orElse(0L) > 0) {\n\t\t\t\t\tlong nextFlow = current_flow < cost.get() ? current_flow : cost.get();\n\t\t\t\t\tlong returnFlow = flow(id, to, nextFlow, passed);\n\t\t\t\t\tif (returnFlow > 0) {\n\t\t\t\t\t\tgraph.link(from, id, cost.get() - returnFlow);\n\t\t\t\t\t\tgraph.link(id, from, graph.getCost(id, from).orElse(0L) + returnFlow);\n\t\t\t\t\t\treturn returnFlow;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn 0L;\n\t\t}\n\t}\n\n\t/**\n\t * 1-indexedのBIT配列\n\t */\n\tclass BinaryIndexedTree {\n\t\tprivate long[] array;\n\n\t\tpublic BinaryIndexedTree(int size) {\n\t\t\tthis.array = new long[size + 1];\n\t\t}\n\n\t\t/**\n\t\t * 指定した要素に値を加算する\n\t\t * 計算量はO(logN)\n\t\t * @param index 加算する要素の添字\n\t\t * @param value 加算する量\n\t\t */\n\t\tpublic void add(int index, long value) {\n\t\t\tfor (int i = index; i < array.length; i += (i & -i)) {\n\t\t\t\tarray[i] += value;\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * 1〜指定した要素までの和を取得する\n\t\t * 計算量はO(logN)\n\t\t * @param index 和の終端となる要素の添字\n\t\t * @return 1〜indexまでの和\n\t\t */\n\t\tpublic long getSum(int index) {\n\t\t\tlong sum = 0L;\n\t\t\tfor (int i = index; i > 0; i -= (i & -i)) {\n\t\t\t\tsum += array[i];\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t}\n\n\t/**\n\t * 1-indexedの2次元BIT配列\n\t */\n\tclass BinaryIndexedTree2D {\n\t\tprivate long[][] array;\n\n\t\tpublic BinaryIndexedTree2D(int size1, int size2) {\n\t\t\tthis.array = new long[size1 + 1][];\n\t\t\tfor (int i = 1; i <= size1; i++) {\n\t\t\t\tthis.array[i] = new long[size2 + 1];\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * 指定した要素に値を加算する\n\t\t * 計算量はO(logN * logN)\n\t\t * @param index1 加算する要素の1次元目の添字\n\t\t * @param index2 加算する要素の2次元目の添字\n\t\t * @param value 加算する量\n\t\t */\n\t\tpublic void add(int index1, int index2, long value) {\n\t\t\tfor (int i1 = index1; i1 < array.length; i1 += (i1 & -i1)) {\n\t\t\t\tfor (int i2 = index2; i2 < array.length; i2 += (i2 & -i2)) {\n\t\t\t\t\tarray[i1][i2] += value;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * (1,1)〜指定した要素までの矩形和を取得する\n\t\t * 計算量はO(logN * logN)\n\t\t * @param index1 和の終端となる要素の1次元目の添字\n\t\t * @param index2 和の終端となる要素の2次元目の添字\n\t\t * @return (1,1)〜(index1,index2)までの矩形和\n\t\t */\n\t\tpublic long getSum(int index1, int index2) {\n\t\t\tlong sum = 0L;\n\t\t\tfor (int i1 = index1; i1 > 0; i1 -= (i1 & -i1)) {\n\t\t\t\tfor (int i2 = index2; i2 > 0; i2 -= (i2 & -i2)) {\n\t\t\t\t\tsum += array[i1][i2];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t}\n\n\tinterface UnionFind {\n\t\tvoid union(int A, int B);\n\t\tboolean judge(int A, int B);\n\t\tSet<Integer> getSet(int id);\n\t}\n\n\t/**\n\t * ArrayUnionFindの拡張\n\t * MapSetで根の添字から根にぶら下がる頂点の集合が取得できるようにした\n\t * getSetメソッドをO(logN * logN)に落とせているはず\n\t * ただしunionメソッドは2倍の計算量になっているので注意(オーダーは変わらないはず)\n\t */\n\tclass SetUnionFind extends ArrayUnionFind {\n\t\tMap<Integer, Set<Integer>> map;\n\t\tpublic SetUnionFind(int size) {\n\t\t\tsuper(size);\n\t\t\tmap = new HashMap<>();\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tmap.put(i, new HashSet<>());\n\t\t\t\tmap.get(i).add(i);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tprotected void unionTo(int source, int dest) {\n\t\t\tsuper.unionTo(source, dest);\n\t\t\tmap.get(dest).addAll(map.get(source));\n\t\t}\n\n\t\t@Override\n\t\tpublic Set<Integer> getSet(int id) {\n\t\t\treturn map.get(root(id));\n\t\t}\n\t}\n\n\t/**\n\t * 配列によるUnionFindの実装\n\t * getSetメソッドはO(NlogN)なのでTLEに注意\n\t */\n\tclass ArrayUnionFind implements UnionFind {\n\t\tint[] parent;\n\t\tint[] rank;\n\t\tint size;\n\t\tpublic ArrayUnionFind(int size) {\n\t\t\tparent = new int[size];\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tparent[i] = i;\n\t\t\t}\n\t\t\trank = new int[size];\n\t\t\tthis.size = size;\n\t\t}\n\n\t\t@Override\n\t\tpublic void union(int A, int B) {\n\t\t\tint rootA = root(A);\n\t\t\tint rootB = root(B);\n\t\t\tif (rootA != rootB) {\n\t\t\t\tif (rank[rootA] < rank[rootB]) {\n\t\t\t\t\tunionTo(rootA, rootB);\n\t\t\t\t} else {\n\t\t\t\t\tunionTo(rootB, rootA);\n\t\t\t\t\tif (rank[rootA] == rank[rootB]) {\n\t\t\t\t\t\trank[rootA]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprotected void unionTo(int source, int dest) {\n\t\t\tparent[source] = dest;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean judge(int A, int B) {\n\t\t\treturn root(A) == root(B);\n\t\t}\n\n\t\t@Override\n\t\tpublic Set<Integer> getSet(int id) {\n\t\t\tSet<Integer> set = new HashSet<>();\n\t\t\tIntStream.range(0, size).filter(i -> judge(i, id)).forEach(set::add);\n\t\t\treturn set;\n\t\t}\n\n\t\tprotected int root(int id) {\n\t\t\tif (parent[id] == id) {\n\t\t\t\treturn id;\n\t\t\t}\n\t\t\tparent[id] = root(parent[id]);\n\t\t\treturn parent[id];\n\t\t}\n\t}\n\n\t/**\n\t * 素数のユーティリティ\n\t */\n\tclass PrimeNumberUtils {\n\t\tboolean[] isPrimeArray;\n\t\tList<Integer> primes;\n\n\t\t/**\n\t\t * 素数判定の上限となる値を指定してユーティリティを初期化\n\t\t * @param limit 素数判定の上限(この値以上が素数であるか判定しない)\n\t\t */\n\t\tpublic PrimeNumberUtils(int limit) {\n\t\t\tif (limit > 10000000) {\n\t\t\t\tSystem.err.println(\"上限の値が高すぎるため素数ユーティリティの初期化でTLEする可能性が大変高いです\");\n\t\t\t}\n\t\t\tprimes = new ArrayList<>();\n\t\t\tisPrimeArray = new boolean[limit];\n\t\t\tif (limit > 2) {\n\t\t\t\tprimes.add(2);\n\t\t\t\tisPrimeArray[2] = true;\n\t\t\t}\n\n\t\t\tfor (int i = 3; i < limit; i += 2) {\n\t\t\t\tif (isPrime(i, primes)) {\n\t\t\t\t\tprimes.add(i);\n\t\t\t\t\tisPrimeArray[i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic List<Integer> getPrimeNumberList() {\n\t\t\treturn primes;\n\t\t}\n\n\t\tpublic boolean isPrime(int n) {\n\t\t\treturn isPrimeArray[n];\n\t\t}\n\n\t\tprivate boolean isPrime(int n, List<Integer> primes) {\n\t\t\tfor (int prime : primes) {\n\t\t\t\tif (n % prime == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tif (prime > Math.sqrt(n)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tinterface BitSet {\n\t\tvoid set(int index, boolean bit);\n\t\tboolean get(int index);\n\t\tvoid shiftRight(int num);\n\t\tvoid shiftLeft(int num);\n\t\tvoid or(BitSet bitset);\n\t\tvoid and(BitSet bitset);\n\t}\n\n\t/**\n\t * Longの配列によるBitSetの実装\n\t * get/setはO(1)\n\t * shift/or/andはO(size / 64)\n\t */\n\tclass LongBit implements BitSet {\n\t\tlong[] bitArray;\n\n\t\tpublic LongBit(int size) {\n\t\t\tbitArray = new long[((size + 63) / 64)];\n\t\t}\n\n\t\tpublic long getOne() {\n\t\t\tlong sum = 0L;\n\t\t\tfor (long bit : bitArray) {\n\t\t\t\tsum += Long.bitCount(bit);\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\n\t\t@Override\n\t\tpublic void set(int index, boolean bit) {\n\t\t\tint segment = index / 64;\n\t\t\tint inIndex = index % 64;\n\t\t\tif (bit) {\n\t\t\t\tbitArray[segment] |= 1L << inIndex;\n\t\t\t} else {\n\t\t\t\tbitArray[segment] &= ~(1L << inIndex);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean get(int index) {\n\t\t\tint segment = index / 64;\n\t\t\tint inIndex = index % 64;\n\t\t\treturn (bitArray[segment] & (1L << inIndex)) != 0L;\n\t\t}\n\n\t\t@Override\n\t\tpublic void shiftRight(int num) {\n\t\t\tint shiftSeg = num / 64;\n\t\t\tint shiftInI = num % 64;\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tint sourceSeg = segment + shiftSeg;\n\t\t\t\tif (sourceSeg < bitArray.length) {\n\t\t\t\t\tbitArray[segment] = bitArray[sourceSeg] >>> shiftInI;\n\t\t\t\t\tif (shiftInI > 0 && sourceSeg + 1 < bitArray.length) {\n\t\t\t\t\t\tbitArray[segment] |= bitArray[sourceSeg + 1] << (64 - shiftInI);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tbitArray[segment] = 0L;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic void shiftLeft(int num) {\n\t\t\tint shiftSeg = num / 64;\n\t\t\tint shiftInI = num % 64;\n\t\t\tfor (int segment = bitArray.length - 1; segment >= 0; segment--) {\n\t\t\t\tint sourceSeg = segment - shiftSeg;\n\t\t\t\tif (sourceSeg >= 0) {\n\t\t\t\t\tbitArray[segment] = bitArray[sourceSeg] << shiftInI;\n\t\t\t\t\tif (shiftInI > 0 && sourceSeg > 0) {\n\t\t\t\t\t\tbitArray[segment] |= bitArray[sourceSeg - 1] >>> (64 - shiftInI);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tbitArray[segment] = 0L;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic long getLong(int segment) {\n\t\t\treturn bitArray[segment];\n\t\t}\n\n\t\t@Override\n\t\tpublic void or(BitSet bitset) {\n\t\t\tif (!(bitset instanceof LongBit)) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tbitArray[segment] |= ((LongBit)bitset).getLong(segment);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic void and(BitSet bitset) {\n\t\t\tif (!(bitset instanceof LongBit)) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tbitArray[segment] &= ((LongBit)bitset).getLong(segment);\n\t\t\t}\n\t\t}\n\t}\n\n}", "n = int(input())\nA = list(map(int,input().split()))\nacm1 = 0\nacm2 = 0\nans1 = 0\nans2 = 0\nfor i, a in enumerate(A):\n acm1 += a\n acm2 += a\n if(i%2==1):\n if(acm1>=0):\n ans1 += acm1 + 1\n acm1 = -1\n if(acm2<=0):\n ans2 += -acm2 + 1\n acm2 = 1\n else:\n if(acm1<=0):\n ans1 += -acm1 + 1\n acm1 = 1\n if(acm2>=0):\n ans2 += acm2 + 1\n acm2 = -1\nprint(min(ans1, ans2))", "n = int(input())\na = list(map(int, input().split()))\n\ndef chk(x,t):\n ans=0\n s=0\n for i in x:\n s += i\n if t == True and s < 1:\n ans += 1 - s\n s = 1\n elif t == False and s > -1:\n ans += 1 + s\n s = -1\n t = not t\n \n return ans\n\nprint(min(chk(a,True),chk(a,False)))", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n ll ans=0,vec[n];\n for(int i=0;i<n;i++){\n cin>>vec[i];\n }\n ll sum=0,sumb=0;\n for(int i=0;i<n;i++){\n sum+=vec[i];\n if(i%2==0){\n if(sum<1){\n sumb+=1-sum;\n sum=1;\n }\n }\n if(i%2==1){\n if(sum>-1){\n sumb+=sum+1;\n sum=-1;\n }\n }\n }\n ans=sumb;\n sumb=0;\n sum=0;\n for(int i=0;i<n;i++){\n sum+=vec[i];\n if(i%2==0){\n if(sum>-1){\n sumb+=sum+1;\n sum=-1;\n }\n }\n if(i%2==1){\n if(sum<1){\n sumb+=1-sum;\n sum=1;\n }\n }\n }\n cout<<min(ans,sumb)<<endl;\n}", "n = int(input())\nL = list(map(int,input().split()))\nS = 0\nans1 = 0\nfor i in range(n):\n S += L[i]\n if i%2 == 0:\n if S <= 0:\n ans1 += abs(S)+1\n S = 1\n else:\n if S >= 0:\n ans1 += S+1\n S = -1\nT = 0\nans2 = 0\nfor i in range(n):\n T += L[i]\n if i%2 == 0:\n if T >= 0:\n ans2 += T+1\n T = -1\n else:\n if T <= 0:\n ans2 += abs(T)+1\n T = 1\nprint(min(ans1,ans2))", "n = int(input())\na = list(map(int, input().split()))\n\n\ndef chk(a, t):\n ans = 0\n x = 0\n for i in a:\n x += i\n if t == True and x < 1:\n ans += 1 - x\n x = 1\n if t == False and x > -1:\n ans += x + 1\n x = -1\n t = not t\n return ans\n\n\nprint(min(chk(a, True), chk(a, False)))\n", "n = int(input())\nA = list(map(int, input().split()))\ndef solve(A, p):\n act = 0\n total = 0\n for a in A:\n total += a\n if total * p < 1:\n act += abs(p - total)\n total = p\n p *= -1\n return act\nans = min(solve(A, 1), solve(A, -1))\nprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n;\n cin >> n;\n vector<int> a;\n for (int i = 0; i < n; i++) {\n\tint t;\n\tcin >> t;\n\ta.push_back(t);\n }\n long long s1 = 0, s2 = 0, c1 = 0, c2 = 0;\n for (int i = 0; i < n; i++) {\n\ts1 += a[i];\n\ts2 += a[i];\n\tif (i % 2 == 0 && s1 <= 0) {\n\t c1 += abs(1 - s1);\n\t s1 = 1;\n\t}\n\telse if (i % 2 == 1 && s1 >= 0) {\n\t c1 += abs(-1 - s1);\n\t s1 = -1;\n\t}\n\tif(i % 2 == 0 && s2 >= 0){\n\t c2 += abs(-1 - s2);\n\t s2 = -1;\n\t}\n\telse if (i % 2 == 1 && s2 <= 0) {\n\t c2 += abs(1 - s2);\n\t s2 = 1;\n\t}\n }\n cout << min(c1, c2) << endl;\n\n return 0;\n}\n\n", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.FileReader;\nimport java.io.FileWriter;\n\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.HashSet;\nimport java.util.Comparator;\nimport java.util.Set;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Main {\n // 標準入力\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n // 標準入力数値配列用 int\n static int[] inputval() throws Exception {\n String[] strarray = br.readLine().trim().split(\" \");\n int[] intarray = new int[strarray.length];\n for (int i = 0; i < intarray.length; i++) {\n intarray[i] = Integer.parseInt(strarray[i]);\n }\n return intarray;\n }\n\n /* 標準入力数値配列用 long */\n static long[] inputLongArr() throws Exception {\n String[] strarray = br.readLine().trim().split(\" \");\n long[] longarray = new long[strarray.length];\n for (int i = 0; i < longarray.length; i++) {\n longarray[i] = Long.parseLong(strarray[i]);\n }\n return longarray;\n }\n\n // 標準入力数値リスト用 int\n static List<Integer> inputIntList() throws Exception {\n List<String> strList = Arrays.asList(br.readLine().trim().split(\" \"));\n List<Integer> intList = new ArrayList<Integer>();\n for (String elem : strList){\n intList.add(Integer.parseInt(elem));\n }\n return intList;\n }\n\n // 標準入力数値配列用 integer 降順ソート用\n static Integer[] inputvalInteger() throws Exception {\n String[] strarray = br.readLine().trim().split(\" \");\n Integer[] intarray = new Integer[strarray.length];\n for (int i = 0; i < intarray.length; i++) {\n intarray[i] = Integer.parseInt(strarray[i]);\n }\n return intarray;\n }\n\n /*標準入力long*/\n static long inputLong() throws Exception {\n return Long.parseLong(br.readLine());\n }\n\n /*標準入力long*/\n static int inputInt() throws Exception {\n return Integer.parseInt(br.readLine());\n }\n\n\n\n\n public static void main(String[] args) throws Exception {\n // write your code here\n int n = inputInt();\n long [] al = inputLongArr();\n\n boolean nextPlusF = al[0] < 0;\n long sum2;\n long ans2;\n long ans = 0;\n long sum = al[0];\n if (al[0] == 0){\n sum = 1;\n ans += 1;\n }\n if (nextPlusF){\n sum2 = 1;\n ans2 = 1 - (al[0]);\n }else{\n sum2 = -1;\n ans2 = al[0] + 1;\n }\n\n\n\n\n for(int i=1;i<n;i++){\n sum += al[i];\n if(nextPlusF && sum <=0){\n ans += 1-sum;\n sum += 1-sum;\n }else if ((! nextPlusF) && sum >= 0){\n ans += sum +1;\n sum -= sum +1;\n }\n nextPlusF = !nextPlusF;\n }\n\n nextPlusF = !(al[0] < 0);\n for(int i=1;i<n;i++){\n sum2 += al[i];\n if(nextPlusF && sum2 <=0){\n ans2 += 1-sum2;\n sum2 += 1-sum2;\n }else if ((! nextPlusF) && sum2 >= 0){\n ans2 += sum2 +1;\n sum2 -= sum2 +1;\n }\n nextPlusF = !nextPlusF;\n }\n\n\n System.out.println(Math.min(ans,ans2));\n\n }\n\n}\n\n", "import java.util.Scanner;\n\npublic class Main {\n\n static long ANS_POSI;\n static long ANS_NEGA;\n static int N;\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n N = Integer.parseInt(sc.nextLine());\n\n long[] a = new long[N];\n for (int i = 0; i < N; i++) {\n long elm = Long.parseLong(sc.next());\n a[i] = elm;\n }\n\n solve(a);\n\n System.out.println(Math.min(ANS_POSI, ANS_NEGA));\n }\n\n\n private static void solve(long[] a) {\n long posi = 0;\n long nega = 0;\n for (int i = 0; i < N; i++) {\n // 前回のループで変更があった場合は、1か-1になっている値に配列値を合算して合計値としている。\n posi += a[i];\n nega += a[i];\n if (i % 2 == 0) {\n if (posi >= 0) {\n ANS_POSI += posi + 1;\n posi = -1;\n }\n if (nega <= 0) {\n ANS_NEGA -= nega - 1;\n nega = 1;\n }\n } else {\n if (posi <= 0) {\n ANS_POSI -= posi - 1;\n posi = 1;\n }\n if (nega >= 0) {\n ANS_NEGA += nega + 1;\n nega = -1;\n }\n }\n }\n }\n}\n", "\n#include <iostream>\n#include <string.h>\n#include <algorithm>\n#include <vector>\n#include <queue>\n\nusing namespace std;\ntypedef long long ll;\nconst ll INF=100000000000000LL;\nll a[100001];\n\nll r[2]={};\nint main() {\n\tint n;\n\tcin>>n;\n\tll t1=0;\n\tll t2=0;\n\tll s1=0;\n\tll s2=0;\n\tll a1;\n\tfor(int i=0;i<n;++i){\n\t\tcin>>a1;\n\t\tt1+=a1;\n\t\tt2+=a1;\n\t\tif(i%2==0){\n\t\t\tif(t1<=0){\n\t\t\t\ts1+=-t1+1;\n\t\t\t\tt1=1;\n\t\t\t}\n\t\t\tif(t2>=0){\n\t\t\t\ts2+=t2+1;\n\t\t\t\tt2=-1;\n\t\t\t}\n\t\t}else{\n\t\t\tif(t1>=0){\n\t\t\t\ts1+=t1+1;\n\t\t\t\tt1=-1;\n\t\t\t}\n\t\t\tif(t2<=0){\n\t\t\t\ts2+=-t2+1;\n\t\t\t\tt2=1;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<min(s1,s2)<<endl;\n\treturn 0;\n}\n", "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\nusing ll = long long;\nusing namespace std;\n\nll n;\nvector<ll> a;\nll solve(int x);\nint main(){\n cin >> n;\n for(ll i=0;i<n;i++){\n int x;\n cin >> x;\n a.push_back(x);\n }\n\n cout << min(solve(0),solve(1)) << endl;\n\n return 0;\n}\n\nll solve(int x){\n ll ans = 0; ll now = 0;\n\n for(ll i=0;i<n;i++){\n now += a[i];\n if((i%2^x)&&(now>=0)){\n ans += now + 1;\n now = -1;\n } \n\n if(!(i%2^x)&&(now<=0)){\n ans -= now - 1;\n now = 1;\n }\n }\n return ans;\n}\n", "n=int(input())\na=list(map(int,input().split()))\nb=a[:]\n\nx=0#pmpm\ny=0\nsum1=0\nsum2=0\n\nfor i in range(n):\n sum1+=a[i]\n sum2+=b[i]\n if(i%2==0):\n if(sum1<=0):\n x+=1-sum1\n a[i]+=1-sum1\n sum1+=1-sum1\n if(sum2>=0):\n y+=sum2+1\n b[i]-=sum2+1\n sum2-=sum2+1\n else:\n if(sum1>=0):\n x+=sum1+1\n a[i]-=1+sum1\n sum1-=1+sum1\n if(sum2<=0):\n y+=1-sum2\n b[i]+=1-sum2\n sum2+=1-sum2\nprint(min(x,y))", "N = int(input())\nA = [int(x) for x in input().split()]\nc = [0, 0]\n\nfor f in [0, 1]:\n sumA = 0\n for i, a in enumerate(A):\n sumA += a\n if i % 2 == f:\n if sumA < 1:\n d = 1 - sumA\n c[f] += d\n sumA += d\n else:\n if sumA > -1:\n d = 1 + sumA\n c[f] += d\n sumA -= d\n \nprint(min(c))", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int N;\n cin >> N;\n vector<int> a(N);\n for (int i = 0; i < N; ++i) cin >> a[i];\n ll cnt = 0;\n ll sum = 0;\n for (int i = 0; i < N; ++i) {\n ll t = sum + a[i];\n if (i % 2 == 0 && t <= 0) cnt += 1 - t, t = 1;\n if (i % 2 == 1 && t >= 0) cnt += t + 1, t = -1;\n sum = t;\n }\n ll ans = cnt;\n cnt = sum = 0;\n for (int i = 0; i < N; ++i) {\n ll t = sum + a[i];\n if (i % 2 == 1 && t <= 0) cnt += 1 - t, t = 1;\n if (i % 2 == 0 && t >= 0) cnt += t + 1, t = -1;\n sum = t;\n }\n ans = min(ans, cnt);\n cout << ans << endl;\n}\n", "n = int(input())\nA = list(map(int,input().split()))\n\ndef seq(a,t):\n ans = 0\n x = 0\n for i in a:\n x+=i\n if t==True and x<1:\n ans+=1-x\n x=1\n elif t==False and x>-1:\n ans+=x+1\n x=-1\n t = not t\n return ans\nprint(min(seq(A,True),seq(A,False)))", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n long[] a1 = new long[n];\n long[] a2 = new long[n];\n for (int i = 0; i < n; i++) {\n long temp = Long.parseLong(sc.next());\n a1[i] = temp;\n a2[i] = temp;\n }\n long ans1 = 0;\n long ans2 = 0;\n long temp = 0;\n for (int i = 0; i < n; i++) {\n if (i % 2 == 0 && temp + a1[i] >= 0) {\n ans1 += temp + a1[i] + 1;\n a1[i] -= temp + a1[i] + 1;\n }\n if (i % 2 != 0 && temp + a1[i] <= 0) {\n ans1 += Math.abs(temp + a1[i] - 1);\n a1[i] += Math.abs(temp + a1[i] - 1);\n }\n temp += a1[i];\n }\n if (Arrays.stream(a1).sum() == 0) {\n ans1++;\n }\n temp = 0;\n for (int i = 0; i < n; i++) {\n if (i % 2 == 0 && temp + a2[i] <= 0) {\n ans2 += Math.abs(temp + a2[i] - 1);\n a2[i] += Math.abs(temp + a2[i] - 1);\n }\n if (i % 2 != 0 && temp + a2[i] >= 0) {\n ans2 += temp + a2[i] + 1;\n a2[i] -= temp + a2[i] + 1;\n }\n temp += a2[i];\n }\n if (Arrays.stream(a2).sum() == 0) {\n ans2++;\n }\n System.out.println(Math.min(ans1, ans2));\n }\n}", "n = input()\nA = list(map(int, input().split()))\n\ndef Chk(a, pos):\n cnt = 0\n tmp = 0\n\n for a in A:\n tmp += a\n\n if pos and tmp < 1:\n cnt += 1 - tmp\n tmp = 1\n elif not pos and tmp > -1:\n cnt += 1 + tmp\n tmp = -1\n\n pos = not pos\n return cnt\n\nprint(min(Chk(A, True), Chk(A, False)))", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n\tint n; cin>>n;\n\tvector<ll> a(n);\n\tfor (int i=0; i<n; i++) cin>>a[i];\n\tvector<ll> ret(2);\n\tfor (int c=0; c<2; ++c){\n\t\tint sgn=c?1:-1;\n\t\tfor (ll s=0, t=0; t<n; t++, sgn*=-1) {\n\t\t\ts+=a[t];\n\t\t\tif(sgn*s<=0) ret[c]+=abs(s)+1, s=sgn;\n\t\t}\n\t}\n\tcout<<min(ret[0],ret[1])<<\"\\n\";\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n\n long long c1 = 0, c2 = 0, s1 = 0, s2 = 0;\n for (int i = 0; i < n; i++) {\n s1 += a[i];\n s2 += a[i];\n if (i & 1) {\n if (s1 >= 0) {c1 += s1 + 1; s1 = -1;}\n if (s2 <= 0) {c2 += 1 - s2; s2 = 1;}\n } else {\n if (s1 <= 0) {c1 += 1 - s1; s1 = 1;}\n if (s2 >= 0) {c2 += s2 + 1; s2 = -1;}\n }\n }\n cout << min(c1, c2) << '\\n';\n return 0;\n}", "\nimport java.io.*;\n\nimport static java.lang.Math.*;\nimport static java.lang.Math.min;\n\nimport java.util.*;\nimport java.util.stream.*;\n\n/**\n * @author baito\n */\nclass P implements Comparable<P> {\n int x, y;\n\n P(int a, int b) {\n x = a;\n y = b;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (!(o instanceof P)) return false;\n P p = (P) o;\n return x == p.x && y == p.y;\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(x, y);\n }\n\n @Override\n public int compareTo(P p) {\n return x == p.x ? y - p.y : x - p.x; //xで昇順にソート\n //return (x == p.x ? y - p.y : x - p.x) * -1; //xで降順にソート\n //return y == p.y ? x - p.x : y - p.y;//yで昇順にソート\n //return (y == p.y ? x - p.x : y - p.y)*-1;//yで降順にソート\n }\n}\n\n@SuppressWarnings(\"unchecked\")\npublic class Main {\n static StringBuilder sb = new StringBuilder();\n static int INF = 1234567890;\n static int MINF = -1234567890;\n static long LINF = 123456789123456789L;\n static long MLINF = -123456789123456789L;\n static long MOD = 1000000007;\n static double EPS = 1e-10;\n static int[] y4 = {0, 1, 0, -1};\n static int[] x4 = {1, 0, -1, 0};\n static int[] y8 = {0, 1, 0, -1, -1, 1, 1, -1};\n static int[] x8 = {1, 0, -1, 0, 1, -1, 1, -1};\n static ArrayList<Long> Fa;\n static boolean[] isPrime;\n static int[] primes;\n static char[][] ban;\n static long maxRes = MLINF;\n static long minRes = LINF;\n static boolean DEBUG = true;\n\n static int N;\n static long[] B;\n\n public static void solve() throws Exception {\n //longを忘れるなオーバーフローするぞ\n N = ni();\n B = nla(N);\n for (int _ = 0; _ < 2; _++) {\n long[] A = B.clone();\n boolean plus = _ == 0 ? true : false;\n long cou = 0;\n if (plus) {\n if (A[0] == 0) {\n cou++;\n A[0]++;\n } else if (A[0] < 0) {\n cou += (-A[0]) + 1;\n A[0] += (-A[0]) + 1;\n }\n } else {\n if (A[0] == 0) {\n cou++;\n A[0]--;\n } else if (A[0] > 0) {\n cou += (A[0]) + 1;\n A[0] -= (A[0]) + 1;\n }\n }\n plus ^= true;\n long sum = A[0];\n\n for (int i = 1; i < N; i++) {\n if (plus) {\n long now = sum + A[i];\n if (now < 0) {\n cou += (-now) + 1;\n A[i] += (-now) + 1;\n } else if (now == 0) {\n cou++;\n A[i]++;\n }\n sum += A[i];\n plus = false;\n } else {\n long now = sum + A[i];\n if (now > 0) {\n cou += (now) + 1;\n A[i] -= (now) + 1;\n } else if (now == 0) {\n cou++;\n A[i]--;\n }\n sum += A[i];\n plus = true;\n }\n }\n chMin(cou);\n }\n System.out.println(minRes);\n\n }\n\n public static boolean calc(long va) {\n //貪欲にギリギリセーフを選んでいく。\n int v = (int) va;\n return true;\n }\n\n //条件を満たす最大値、あるいは最小値を求める\n static int mgr(long ok, long ng, long w) {\n //int ok = 0; //解が存在する\n //int ng = N; //解が存在しない\n while (Math.abs(ok - ng) > 1) {\n long mid;\n if (ok < 0 && ng > 0 || ok > 0 && ng < 0) mid = (ok + ng) / 2;\n else mid = ok + (ng - ok) / 2;\n\n if (calc(mid)) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n if (calc(ok)) return (int) ok;\n else return -1;\n }\n\n boolean equal(double a, double b) {\n return a == 0 ? abs(b) < EPS : abs((a - b) / a) < EPS;\n }\n\n public static void matPrint(long[][] a) {\n for (int hi = 0; hi < a.length; hi++) {\n for (int wi = 0; wi < a[0].length; wi++) {\n System.out.print(a[hi][wi] + \" \");\n }\n System.out.println(\"\");\n }\n }\n\n //rにlを掛ける l * r\n public static long[][] matMul(long[][] l, long[][] r) throws IOException {\n int lh = l.length;\n int lw = l[0].length;\n int rh = r.length;\n int rw = r[0].length;\n //lwとrhが,同じである必要がある\n if (lw != rh) throw new IOException();\n long[][] res = new long[lh][rw];\n for (int i = 0; i < lh; i++) {\n for (int j = 0; j < rw; j++) {\n for (int k = 0; k < lw; k++) {\n res[i][j] = modSum(res[i][j], modMul(l[i][k], r[k][j]));\n }\n }\n }\n return res;\n }\n\n public static long[][] matPow(long[][] a, int n) throws IOException {\n int h = a.length;\n int w = a[0].length;\n if (h != w) throw new IOException();\n long[][] res = new long[h][h];\n for (int i = 0; i < h; i++) {\n res[i][i] = 1;\n }\n long[][] pow = a.clone();\n while (n > 0) {\n if (bitGet(n, 0)) res = matMul(pow, res);\n pow = matMul(pow, pow);\n n >>= 1;\n }\n return res;\n }\n\n public static void chMax(long v) {\n maxRes = Math.max(maxRes, v);\n }\n\n public static void chMin(long v) {\n minRes = Math.min(minRes, v);\n }\n\n\n //2点間の行き先を配列に持たせる\n static int[][] packE(int n, int[] from, int[] to) {\n int[][] g = new int[n][];\n int[] p = new int[n];\n for (int f : from)\n p[f]++;\n for (int t : to)\n p[t]++;\n for (int i = 0; i < n; i++)\n g[i] = new int[p[i]];\n for (int i = 0; i < from.length; i++) {\n g[from[i]][--p[from[i]]] = to[i];\n g[to[i]][--p[to[i]]] = from[i];\n }\n return g;\n }\n\n\n public static boolean bitGet(BitSet bit, int keta) {\n return bit.nextSetBit(keta) == keta;\n }\n\n public static boolean bitGet(long bit, int keta) {\n return ((bit >> keta) & 1) == 1;\n }\n\n public static int restoreHashA(long key) {\n return (int) (key >> 32);\n }\n\n public static int restoreHashB(long key) {\n return (int) (key & -1);\n }\n\n //正の数のみ\n public static long getHashKey(int a, int b) {\n return (long) a << 32 | b;\n }\n\n public static long sqrt(long v) {\n long res = (long) Math.sqrt(v);\n while (res * res > v) res--;\n return res;\n }\n\n public static int u0(int a) {\n if (a < 0) return 0;\n return a;\n }\n\n public static long u0(long a) {\n if (a < 0) return 0;\n return a;\n }\n\n public static int[] toIntArray(int a) {\n int[] res = new int[keta(a)];\n for (int i = res.length - 1; i >= 0; i--) {\n res[i] = a % 10;\n a /= 10;\n }\n return res;\n }\n\n public static Integer[] toIntegerArray(int[] ar) {\n Integer[] res = new Integer[ar.length];\n for (int i = 0; i < ar.length; i++) {\n res[i] = ar[i];\n }\n return res;\n }\n\n public static long bitGetCombSizeK(int k) {\n return (1 << k) - 1;\n }\n\n //k個の次の組み合わせをビットで返す 大きさに上限はない 110110 -> 111001\n public static long bitNextComb(long comb) {\n long x = comb & -comb; //最下位の1\n long y = comb + x; //連続した下の1を繰り上がらせる\n return ((comb & ~y) / x >> 1) | y;\n }\n\n public static int keta(long num) {\n int res = 0;\n while (num > 0) {\n num /= 10;\n res++;\n }\n return res;\n }\n\n public static boolean isOutofIndex(int x, int y, int w, int h) {\n if (x < 0 || y < 0) return true;\n if (w <= x || h <= y) return true;\n return false;\n }\n\n public static boolean isOutofIndex(int x, int y, char[][] ban) {\n if (x < 0 || y < 0) return true;\n if (ban[0].length <= x || ban.length <= y) return true;\n return false;\n }\n\n public static int arrayCount(int[] a, int v) {\n int res = 0;\n for (int i = 0; i < a.length; i++) {\n if (a[i] == v) res++;\n }\n return res;\n }\n\n public static int arrayCount(long[] a, int v) {\n int res = 0;\n for (int i = 0; i < a.length; i++) {\n if (a[i] == v) res++;\n }\n return res;\n }\n\n public static int arrayCount(int[][] a, int v) {\n int res = 0;\n for (int hi = 0; hi < a.length; hi++) {\n for (int wi = 0; wi < a[0].length; wi++) {\n if (a[hi][wi] == v) res++;\n }\n }\n return res;\n }\n\n public static int arrayCount(long[][] a, int v) {\n int res = 0;\n for (int hi = 0; hi < a.length; hi++) {\n for (int wi = 0; wi < a[0].length; wi++) {\n if (a[hi][wi] == v) res++;\n }\n }\n return res;\n }\n\n public static int arrayCount(char[][] a, char v) {\n int res = 0;\n for (int hi = 0; hi < a.length; hi++) {\n for (int wi = 0; wi < a[0].length; wi++) {\n if (a[hi][wi] == v) res++;\n }\n }\n return res;\n }\n\n public static void setPrimes() {\n int n = 100001;\n isPrime = new boolean[n];\n List<Integer> prs = new ArrayList<>();\n Arrays.fill(isPrime, true);\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i * i <= n; i++) {\n if (!isPrime[i]) continue;\n prs.add(i);\n for (int j = i * 2; j < n; j += i) {\n isPrime[j] = false;\n }\n }\n primes = new int[prs.size()];\n for (int i = 0; i < prs.size(); i++)\n primes[i] = prs.get(i);\n }\n\n public static void revSort(int[] a) {\n Arrays.sort(a);\n reverse(a);\n }\n\n public static void revSort(long[] a) {\n Arrays.sort(a);\n reverse(a);\n }\n\n public static int[][] copy(int[][] ar) {\n int[][] nr = new int[ar.length][ar[0].length];\n for (int i = 0; i < ar.length; i++)\n for (int j = 0; j < ar[0].length; j++)\n nr[i][j] = ar[i][j];\n return nr;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static <T extends Number> int lowerBound(final List<T> lis, final T value) {\n int low = 0;\n int high = lis.size();\n int mid;\n\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (lis.get(mid).doubleValue() < value.doubleValue()) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static <T extends Number> int upperBound(final List<T> lis, final T value) {\n int low = 0;\n int high = lis.size();\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (lis.get(mid).doubleValue() < value.doubleValue()) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static int lowerBound(final int[] arr, final int value) {\n int low = 0;\n int high = arr.length;\n int mid;\n\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] < value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static int upperBound(final int[] arr, final int value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] <= value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値がなければ挿入できる最小のインデックス\n */\n public static long lowerBound(final long[] arr, final long value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] < value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値がなければ挿入できる最小のインデックス\n */\n public static long upperBound(final long[] arr, final long value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] <= value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n //次の順列に書き換える、最大値ならfalseを返す\n public static boolean nextPermutation(int A[]) {\n int len = A.length;\n int pos = len - 2;\n for (; pos >= 0; pos--) {\n if (A[pos] < A[pos + 1]) break;\n }\n if (pos == -1) return false;\n\n //posより大きい最小の数を二分探索\n int ok = pos + 1;\n int ng = len;\n while (Math.abs(ng - ok) > 1) {\n int mid = (ok + ng) / 2;\n if (A[mid] > A[pos]) ok = mid;\n else ng = mid;\n\n }\n\n swap(A, pos, ok);\n reverse(A, pos + 1, len - 1);\n\n\n return true;\n }\n\n //次の順列に書き換える、最小値ならfalseを返す\n public static boolean prevPermutation(int A[]) {\n int len = A.length;\n int pos = len - 2;\n for (; pos >= 0; pos--) {\n if (A[pos] > A[pos + 1]) break;\n }\n if (pos == -1) return false;\n\n //posより小さい最大の数を二分探索\n int ok = pos + 1;\n int ng = len;\n while (Math.abs(ng - ok) > 1) {\n int mid = (ok + ng) / 2;\n if (A[mid] < A[pos]) ok = mid;\n else ng = mid;\n\n }\n\n swap(A, pos, ok);\n reverse(A, pos + 1, len - 1);\n\n\n return true;\n }\n\n\n static long ncr2(int a, int b) {\n if (b == 0) return 1;\n else if (a < b) return 0;\n long res = 1;\n for (int i = 0; i < b; i++) {\n res *= a - i;\n res /= i + 1;\n }\n return res;\n }\n\n static long ncrdp(int n, int r) {\n if (n < r) return 0;\n long[][] dp = new long[n + 1][r + 1];\n for (int ni = 0; ni < n + 1; ni++) {\n dp[ni][0] = dp[ni][ni] = 1;\n for (int ri = 1; ri < ni; ri++) {\n dp[ni][ri] = dp[ni - 1][ri - 1] + dp[ni - 1][ri];\n }\n }\n return dp[n][r];\n }\n\n public static int mod(int a, int m) {\n return a >= 0 ? a % m : (int) (a + ceil(-a * 1.0 / m) * m) % m;\n }\n\n static long modNcr(int n, int r) {\n if (n < 0 || r < 0 || n < r) return 0;\n if (Fa == null || Fa.size() <= n) factorial(n);\n long result = Fa.get(n);\n result = modMul(result, modInv(Fa.get(n - r)));\n result = modMul(result, modInv(Fa.get(r)));\n return result;\n }\n\n public static long modSum(long... lar) {\n long res = 0;\n for (long l : lar)\n res = (res + l % MOD) % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modDiff(long a, long b) {\n long res = a % MOD - b % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modMul(long... lar) {\n long res = 1;\n for (long l : lar)\n res = (res * l % MOD) % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modDiv(long a, long b) {\n long x = a % MOD;\n long y = b % MOD;\n long res = (x * modInv(y)) % MOD;\n return res;\n }\n\n static long modInv(long n) {\n return modPow(n, MOD - 2);\n }\n\n static void factorial(int n) {\n if (Fa == null) {\n Fa = new ArrayList<>();\n Fa.add(1L);\n Fa.add(1L);\n }\n for (int i = Fa.size(); i <= n; i++) {\n Fa.add((Fa.get(i - 1) * i) % MOD);\n }\n }\n\n static long modPow(long x, long n) {\n long res = 1L;\n while (n > 0) {\n if ((n & 1) == 1) {\n res = res * x % MOD;\n }\n x = x * x % MOD;\n n >>= 1;\n }\n return res;\n }\n\n //↑nCrをmod計算するために必要\n static long lcm(long n, long r) {\n return n / gcd(n, r) * r;\n }\n\n static int gcd(int n, int r) {\n return r == 0 ? n : gcd(r, n % r);\n }\n\n static long gcd(long n, long r) {\n return r == 0 ? n : gcd(r, n % r);\n }\n\n static <T> void swap(T[] x, int i, int j) {\n T t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n static void swap(int[] x, int i, int j) {\n int t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n public static void reverse(int[] x) {\n int l = 0;\n int r = x.length - 1;\n while (l < r) {\n int temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(long[] x) {\n int l = 0;\n int r = x.length - 1;\n while (l < r) {\n long temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(char[] x) {\n int l = 0;\n int r = x.length - 1;\n while (l < r) {\n char temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(int[] x, int s, int e) {\n int l = s;\n int r = e;\n while (l < r) {\n int temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n static int length(int a) {\n int cou = 0;\n while (a != 0) {\n a /= 10;\n cou++;\n }\n return cou;\n }\n\n static int length(long a) {\n int cou = 0;\n while (a != 0) {\n a /= 10;\n cou++;\n }\n return cou;\n }\n\n static int cou(boolean[] a) {\n int res = 0;\n for (boolean b : a) {\n if (b) res++;\n }\n return res;\n }\n\n static int cou(String s, char c) {\n int res = 0;\n for (char ci : s.toCharArray()) {\n if (ci == c) res++;\n }\n return res;\n }\n\n static int countC2(char[][] a, char c) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n if (a[i][j] == c) co++;\n return co;\n }\n\n static int countI(int[] a, int key) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n if (a[i] == key) co++;\n return co;\n }\n\n static int countI(int[][] a, int key) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n if (a[i][j] == key) co++;\n return co;\n }\n\n static void fill(int[][] a, int v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = v;\n }\n\n static void fill(char[][] a, char c) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = c;\n }\n\n static void fill(long[][] a, long v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = v;\n }\n\n static void fill(int[][][] a, int v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n for (int k = 0; k < a[0][0].length; k++)\n a[i][j][k] = v;\n }\n\n static int max(int... a) {\n int res = Integer.MIN_VALUE;\n for (int i : a) {\n res = Math.max(res, i);\n }\n return res;\n }\n\n static long max(long... a) {\n long res = Integer.MIN_VALUE;\n for (long i : a) {\n res = Math.max(res, i);\n }\n return res;\n }\n\n static long min(long... a) {\n long res = Long.MAX_VALUE;\n for (long i : a) {\n res = Math.min(res, i);\n }\n return res;\n }\n\n static int max(int[][] ar) {\n int res = Integer.MIN_VALUE;\n for (int i[] : ar)\n res = Math.max(res, max(i));\n return res;\n }\n\n static long max(long[][] ar) {\n long res = Integer.MIN_VALUE;\n for (long i[] : ar)\n res = Math.max(res, max(i));\n return res;\n }\n\n static int min(int... a) {\n int res = Integer.MAX_VALUE;\n for (int i : a) {\n res = Math.min(res, i);\n }\n return res;\n }\n\n\n static int min(int[][] ar) {\n int res = Integer.MAX_VALUE;\n for (int i[] : ar)\n res = Math.min(res, min(i));\n return res;\n }\n\n static int sum(int[] a) {\n int cou = 0;\n for (int i : a)\n cou += i;\n return cou;\n }\n\n static long sum(long[] a) {\n long cou = 0;\n for (long i : a)\n cou += i;\n return cou;\n }\n\n\n //FastScanner\n\n static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n static StringTokenizer tokenizer = null;\n\n public static String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n /*public String nextChar(){\n return (char)next()[0];\n }*/\n public static String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public static long nl() {\n return Long.parseLong(next());\n }\n\n public static String n() {\n return next();\n }\n\n public static int ni() {\n return Integer.parseInt(next());\n }\n\n public static double nd() {\n return Double.parseDouble(next());\n }\n\n public static int[] nia(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni();\n }\n return a;\n }\n\n //1-index\n public static int[] niao(int n) {\n int[] a = new int[n + 1];\n for (int i = 1; i < n + 1; i++) {\n a[i] = ni();\n }\n return a;\n }\n\n public static int[] niad(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = ni() - 1;\n }\n return a;\n }\n\n public static P[] npa(int n) {\n P[] p = new P[n];\n for (int i = 0; i < n; i++) {\n p[i] = new P(ni(), ni());\n }\n return p;\n }\n\n public static P[] npad(int n) {\n P[] p = new P[n];\n for (int i = 0; i < n; i++) {\n p[i] = new P(ni() - 1, ni() - 1);\n }\n return p;\n }\n\n public static int[][] nit(int h, int w) {\n int[][] a = new int[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = ni();\n }\n }\n return a;\n }\n\n public static int[][] nitd(int h, int w) {\n int[][] a = new int[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = ni() - 1;\n }\n }\n return a;\n }\n\n static int[][] S_ARRAY;\n static long[][] S_LARRAY;\n static int S_INDEX;\n static int S_LINDEX;\n\n //複数の配列を受け取る\n public static int[] niah(int n, int w) {\n if (S_ARRAY == null) {\n S_ARRAY = new int[w][n];\n for (int i = 0; i < n; i++) {\n for (int ty = 0; ty < w; ty++) {\n S_ARRAY[ty][i] = ni();\n }\n }\n }\n return S_ARRAY[S_INDEX++];\n }\n\n public static long[] nlah(int n, int w) {\n if (S_LARRAY == null) {\n S_LARRAY = new long[w][n];\n for (int i = 0; i < n; i++) {\n for (int ty = 0; ty < w; ty++) {\n S_LARRAY[ty][i] = ni();\n }\n }\n }\n return S_LARRAY[S_LINDEX++];\n }\n\n public static char[] nca() {\n char[] a = next().toCharArray();\n return a;\n }\n\n public static char[][] nct(int h, int w) {\n char[][] a = new char[h][w];\n for (int i = 0; i < h; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n //スペースが入っている場合\n public static char[][] ncts(int h, int w) {\n char[][] a = new char[h][w];\n for (int i = 0; i < h; i++) {\n a[i] = nextLine().replace(\" \", \"\").toCharArray();\n }\n return a;\n }\n\n public static char[][] nctp(int h, int w, char c) {\n char[][] a = new char[h + 2][w + 2];\n //char c = '*';\n int i;\n for (i = 0; i < w + 2; i++)\n a[0][i] = c;\n for (i = 1; i < h + 1; i++) {\n a[i] = (c + next() + c).toCharArray();\n }\n for (i = 0; i < w + 2; i++)\n a[h + 1][i] = c;\n return a;\n }\n\n //スペースが入ってる時用\n public static char[][] nctsp(int h, int w, char c) {\n char[][] a = new char[h + 2][w + 2];\n //char c = '*';\n int i;\n for (i = 0; i < w + 2; i++)\n a[0][i] = c;\n for (i = 1; i < h + 1; i++) {\n a[i] = (c + nextLine().replace(\" \", \"\") + c).toCharArray();\n }\n for (i = 0; i < w + 2; i++)\n a[h + 1][i] = c;\n return a;\n }\n\n public static long[] nla(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nl();\n }\n return a;\n }\n\n public static long[][] nlt(int h, int w) {\n long[][] a = new long[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = nl();\n }\n }\n return a;\n }\n\n public static void main(String[] args) throws Exception {\n long startTime = System.currentTimeMillis();\n solve();\n System.out.flush();\n long endTime = System.currentTimeMillis();\n if (DEBUG) System.err.println(endTime - startTime);\n }\n\n}\n", "#coding:utf-8\n\ndef count(seq, is_positive):\n operation = 0\n sum = 0\n for i in range(n):\n sum += seq[i]\n if sum == 0:\n operation += 1\n if is_positive:\n sum -= 1\n else:\n sum += 1\n elif sum > 0 and is_positive:\n operation += abs(sum) + 1\n sum = -1\n elif sum < 0 and not is_positive:\n operation += abs(sum) + 1\n sum = 1\n\n if sum > 0:\n is_positive = True\n else:\n is_positive = False\n\n return operation\n\n\nif __name__ == \"__main__\":\n n = int(raw_input())\n seq = map(int, raw_input().split(\" \"))\n\n print min(count(seq, False), count(seq, True))\n", "n = int(input())\nA = list(map(int, input().split()))\nans = {True:0, False:0}\nfor s in [True, False]:\n sign = s\n total = 0\n for i in range(len(A)):\n if total + A[i] == 0 or sign == (total + A[i] > 0):\n ans[s] += abs(total + A[i]) + 1\n total = -1 if sign else 1\n else:\n total += A[i]\n sign = total > 0\nprint(min(ans.values()))\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int n = scanner.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = scanner.nextInt();\n\n long c1 = 0;\n long sum = 0;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (i % 2 == 0 && sum <= 0) {\n long d = 1 - sum;\n c1 += d;\n sum += d;\n } else if (i % 2 == 1 && sum >= 0){\n long d = sum + 1;\n c1 += d;\n sum -= d;\n }\n }\n\n long c2 = 0;\n sum = 0;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (i % 2 == 0 && sum >= 0) {\n long d = sum + 1;\n c2 += d;\n sum -= d;\n } else if (i % 2 == 1 && sum <= 0){\n long d = 1 - sum;\n c2 += d;\n sum += d;\n }\n }\n\n System.out.println(Math.min(c1, c2));\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long n,ansa=0,ansb=0,x=0,y=0;\n cin >> n;\n vector<long> a(n),wa(n);\n for(long i=0;i<n;i++) cin >> a[i];\n wa[0]=a[0];\n for(long i=1;i<n;i++) wa[i]=wa[i-1]+a[i];\n for(long i=0;i<n;i++) {\n if(i%2==0) {\n if(wa[i]+x<=0) {\n ansa+=1-wa[i]-x;\n x+=1-wa[i]-x;\n }\n if(wa[i]+y>=0) {\n ansb+=1+wa[i]+y;\n y+=-1-wa[i]-y;\n }\n } else {\n if(wa[i]+x>=0) {\n ansa+=1+wa[i]+x;\n x+=-1-wa[i]-x;\n }\n if(wa[i]+y<=0) {\n ansb+=1-wa[i]-y;\n y+=1-wa[i]-y;\n }\n }\n }\n cout << min(ansa,ansb) << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int n;\n cin>>n;\n vector<int> v(n);\n for(auto &i:v) cin>>i;\n long long ansq=1e17;\n for(int x=0;x<2;x++)\n {\n int h=x;\n long long int sum=0,ans=0;\n for(int i=0;i<n;i++)\n {\n sum+=v[i];\n if(h)\n {\n if(sum<=0)\n { ans+= abs(1-sum); sum=1;}\n \n }\n else\n {\n if(sum>=0)\n {\n ans+=abs(sum+1);\n sum=-1;\n }\n }\n h = h^1;\n }\n ansq=min(ansq,ans);\n }\n cout<<ansq<<\"\\n\";\n \n return 0;\n}\n", "n=int(input())\na=list(map(int,input().split()))\nans=999999999999999\ntemp=True\nfor i in range(2):\n count=0\n temp=0\n if i==0:\n t=True\n else:\n t=False\n for j in a:\n temp=temp+j\n if t==True and temp<1:\n count=count+1-temp\n temp=1\n elif t==False and temp>-1:\n count=count+1+temp\n temp=-1\n if t==True:\n t=False\n else:\n t=True\n ans=min(ans,count)\nprint(ans)", "n, *a = map(int, open(0).read().split())\nresults = []\nfor sign in [1, -1]:\n ans = 0\n acc = 0\n for v in a:\n acc += v\n if acc * sign <= 0:\n ans += abs(acc - sign)\n acc = sign\n sign *= -1\n results.append(ans)\n\nprint(min(results))", "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong sum1 = 0;\n\t\tlong count1 = 0;\n\t\tlong sum2 = 0;\n\t\tlong count2 = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t int a = sc.nextInt();\n\t\t sum1 += a;\n\t\t sum2 += a;\n\t\t if (i % 2 == 0) {\n\t\t if (sum1 <= 0) {\n\t\t count1 += 1 - sum1;\n\t\t sum1 = 1;\n\t\t }\n\t\t if (sum2 >= 0) {\n\t\t count2 += sum2 + 1;\n\t\t sum2 = -1;\n\t\t }\n\t\t } else {\n\t\t if (sum2 <= 0) {\n\t\t count2 += 1 - sum2;\n\t\t sum2 = 1;\n\t\t }\n\t\t if (sum1 >= 0) {\n\t\t count1 += sum1 + 1;\n\t\t sum1 = -1;\n\t\t }\n\t\t }\n\t\t}\n\t\tSystem.out.println(Math.min(count1, count2));\n\t}\n}\n", "n = int(input())\na = list(map(int,input().split(\" \")))\n\no = []\n\nfor b in [-1,1]:\n c = 0\n s = [0]*n\n for i in range(0,n):\n s[i] = a[i] + (i and s[i-1])\n if s[i] == 0 or s[i] < 0 < b or b < 0 < s[i]:\n c += abs(s[i] - b)\n s[i] = b\n b *= -1\n o.append(c)\n\nprint(min(o))", "#include <bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\n\nll s1, s2, c1, c2;\nint main() {\n ll n;\n cin>>n;\n rep(i,n){\n int a;\n cin>>a;\n s1 += a;\n s2 += a;\n if (i % 2) {\n if (s1 <= 0) c1 += 1 - s1,s1 = 1;\n if (s2 >= 0) c2 += 1 + s2,s2 = -1;\n }\n else {\n if (s1 >= 0) c1 += 1 + s1,s1 = -1;\n if (s2 <= 0) c2 += 1 - s2,s2 = 1;\n }\n }\n cout << min(c1, c2) << endl;\n return 0;\n}\n", "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong valueA = 0;\n\t\tlong countA = 0;\n\t\tlong valueB = 0;\n\t\tlong countB = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlong a = sc.nextLong();\n\t\t\tvalueA += a;\n\t\t\tvalueB += a;\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tif (valueA >= 0) {\n\t\t\t\t\tcountA += valueA + 1;\n\t\t\t\t\tvalueA = -1;\n\t\t\t\t}\n\t\t\t\tif (valueB <= 0) {\n\t\t\t\t\tcountB += -valueB + 1;\n\t\t\t\t\tvalueB = 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (valueA <= 0) {\n\t\t\t\t\tcountA += -valueA + 1;\n\t\t\t\t\tvalueA = 1;\n\t\t\t\t}\n\t\t\t\tif (valueB >= 0) {\n\t\t\t\t\tcountB += valueB + 1;\n\t\t\t\t\tvalueB = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (countA < countB) {\n\t\t\tSystem.out.println(countA);\n\t\t} else {\n\t\t\tSystem.out.println(countB);\n\t\t}\n\t}\n}\n", "n=int(input())\na=list(map(int,input().split()))\n#+-+-\nans=0\ns=0\nfor i in range(n):\n f=i%2\n s+=a[i]\n if f==0:\n if s<=0:\n ans+=-s+1\n s=1\n else:\n if s>=0:\n ans+=1+s\n s=-1\n#-+-+\nanss=0\ns=0\nfor i in range(n):\n f=i%2\n s+=a[i]\n if f==1:\n if s<=0:\n anss+=-s+1\n s=1\n else:\n if s>=0:\n anss+=1+s\n s=-1\nprint(min(ans,anss))\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tvector<long long> a(n);\n\tfor (auto&& ai : a) cin >> ai;\n\tlong long r1 = 0, r2 = 0;\n\tlong long sum = 0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tsum += a[i];\n\t\tif (i%2 == 0 && sum <= 0)\n\t\t{\n\t\t\tr1 += 1 - sum;\n\t\t\tsum = 1;\n\t\t}\n\t\telse if (i%2 == 1 && sum >= 0)\n\t\t{\n\t\t\tr1 += sum + 1;\n\t\t\tsum = -1;\n\t\t}\n\t}\n\tsum = 0;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tsum += a[i];\n\t\tif (i%2 == 0 && sum >= 0)\n\t\t{\n\t\t\tr2 += sum + 1;\n\t\t\tsum = -1;\n\t\t}\n\t\telse if (i%2 == 1 && sum <= 0)\n\t\t{\n\t\t\tr2 += 1 - sum;\n\t\t\tsum = 1;\n\t\t}\n\t}\n\tcout << min(r1, r2) << endl;\n\treturn 0;\n}\n", "n = int(input())\nlst = [int(x) for x in input().split()]\n\ntotal = [0, 0]\nret = [0, 0]\nfor i in range(2):\n for j in range(n):\n total[i] += lst[j]\n if (i + j) % 2 == 0:\n if total[i] >= 0:\n ret[i] += abs(total[i] + 1)\n total[i] = -1\n else:\n if total[i] <= 0:\n ret[i] += abs(total[i] - 1)\n total[i] = 1\n\nprint(min(ret))\n", "import java.util.*;\nimport java.io.*;\n \npublic class Main{\n static final Reader sc = new Reader();\n static final PrintWriter out = new PrintWriter(System.out,false);\n \n public static void main(String[] args) throws Exception {\n \tint n = sc.nextInt();\n \tlong[] a = new long[n];\n \tfor(int i=0;i<n;i++){\n \t\ta[i] = sc.nextLong();\n \t}\n \tlong counter = 0;\n \tlong total = a[0];\n \tif(a[0]==0){\n \t\ttotal++;\n \t\tcounter++;\n \t}\n \tfor(int i=1;i<n;i++){\n \t\tif(total>0 && total+a[i]<0){\n \t\t\ttotal += a[i];\n \t\t}\n \t\telse if(total<0 && total+a[i]>0){\n \t\t\ttotal += a[i];\n \t\t}\n \t\telse{\n \t\t\tlong x = 0;\n \t\t\tif(total>0){\n \t\t\t\tx = -1 - total - a[i];\n \t\t\t\ttotal = -1;\n \t\t\t}\n \t\t\telse{\n \t\t\t\tx = 1 - total - a[i];\n \t\t\t\ttotal = 1;\n \t\t\t}\n \t\t\tcounter += (long)Math.abs(x);\n \t\t}\n \t\t//out.println(total+\" \"+counter);\n \t}\n\n \tlong total1 = 0;\n \tlong counter1 = 0;\n \tif(a[0]<0){\n \t\ttotal1 = 1;\n \t\tcounter1 = 1 - a[0];\n \t}\n \telse if(a[0]>0){\n \t\ttotal1 = -1;\n \t\tcounter1 = 1 + a[0];\n \t}\n \telse{\n \t\ttotal1 = -1;\n \t\tcounter1 = 1;\n \t}\n \tfor(int i=1;i<n;i++){\n \t\tif(total1>0 && total1+a[i]<0){\n \t\t\ttotal1 += a[i];\n \t\t}\n \t\telse if(total1<0 && total1+a[i]>0){\n \t\t\ttotal1 += a[i];\n \t\t}\n \t\telse{\n \t\t\tlong x = 0;\n \t\t\tif(total1>0){\n \t\t\t\tx = -1 - total1 - a[i];\n \t\t\t\ttotal1 = -1;\n \t\t\t}\n \t\t\telse{\n \t\t\t\tx = 1 - total1 - a[i];\n \t\t\t\ttotal1 = 1;\n \t\t\t}\n \t\t\tcounter1 += (long)Math.abs(x);\n \t\t}\n \t\t//out.println(total+\" \"+counter);\n \t}\n\n \tif(counter>counter1){\n \t\tout.println(counter1);\n \t}\n \telse{\n \t\tout.println(counter);\n \t}\n \tout.flush();\n sc.close();\n out.close();\n }\n\n static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}\n}\n \nclass Reader {\n \n private final InputStream in;\n private final byte[] buf = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n \n public Reader() { this(System.in);}\n public Reader(InputStream source) { this.in = source;}\n \n private boolean hasNextByte() {\n if (ptr < buflen) return true;\n ptr = 0;\n try{\n buflen = in.read(buf);\n }catch (IOException e) {e.printStackTrace();}\n if (buflen <= 0) return false;\n return true;\n }\n \n private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}\n \n private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n \n private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}\n \n public boolean hasNext() {skip(); return hasNextByte();}\n \n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n boolean minus = false;\n long num = readByte();\n \n if(num == '-'){\n num = 0;\n minus = true;\n }else if (num < '0' || '9' < num){\n throw new NumberFormatException();\n }else{\n num -= '0';\n }\n \n while(true){\n int b = readByte();\n if('0' <= b && b <= '9')\n num = num * 10 + (b - '0');\n else if(b == -1 || !isPrintableChar(b))\n return minus ? -num : num;\n else\n throw new NoSuchElementException();\n }\n }\n \n public int nextInt() {\n long num = nextLong();\n if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)\n throw new NumberFormatException();\n return (int)num;\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public char nextChar() {\n if (!hasNext()) throw new NoSuchElementException();\n return (char)readByte();\n }\n \n public String nextLine() {\n while (hasNextByte() && (buf[ptr] == '\\n' || buf[ptr] == '\\r')) ptr++;\n if (!hasNextByte()) throw new NoSuchElementException();\n \n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (b != '\\n' && b != '\\r') {\n sb.appendCodePoint(b);\n b = readByte();\n }\n \n return sb.toString();\n }\n \n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i=0; i<n; i++) res[i] = nextInt();\n return res;\n }\n \n public char[] nextCharArray(int n) {\n char[] res = new char[n];\n for (int i=0; i<n; i++) res[i] = nextChar();\n return res;\n }\n \n public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}};\n}", "// C - Sequence\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint N;\nvector<ll> A(100000);\n\nll counter(int sign){//sign: (+)start -> 1, (-)start -> -1\n\tll c = 0;\n\tfor(ll s=0, i=0; i<N; ++i, sign*=-1){\n\t\ts += A[i];\n\t\tif(sign*s<=0){ c += abs(s) + 1; s = sign; }\n\t}\n\treturn c;\n}\n\nint main(){\n\tcin>>N;\n\tfor(int i=0; i<N; ++i) cin>>A[i];\n\tll a = counter(1), b = counter(-1);\n\tcout<< (a<b?a:b) <<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n\tll n;\n\tcin>>n;\n\tll a[n];\n\tfor(int i=0;i<n;i++)\n\t cin>>a[i];\n\tll c1=0,c2=0,sum=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(i%2==0){\n\t\t\tsum=sum+a[i];\n\t\t\tif(sum<0)\n\t\t\t continue;\n\t\t\tc1+=abs(-1-sum);\n\t\t\tsum=-1;\n\t\t}\n\t\telse{\n\t\t\tsum=sum+a[i];\n\t\t\tif(sum>0)\n\t\t\t continue;\n\t\t\tc1+=abs(1-sum);\n\t\t\tsum=1;\n\t\t}\n\t}\n\tsum=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(i%2==1){\n\t\t\tsum=sum+a[i];\n\t\t\tif(sum<0)\n\t\t\t continue;\n\t\t\tc2+=abs(-1-sum);\n\t\t\tsum=-1;\n\t\t}\n\t\telse{\n\t\t\tsum=sum+a[i];\n\t\t\tif(sum>0)\n\t\t\t continue;\n\t\t\tc2+=abs(1-sum);\n\t\t\tsum=1;\n\t\t}\n\t}\n\tcout<<min(c1,c2)<<endl;\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nint main(){\n int N;\n cin>>N;\n vector<long long> a(N);\n for(int i=0;i<N;i++) cin>>a[i];\n int initial_sign[2]={-1,1};\n vector<long long> res(2);\n for(int i=0;i<2;i++){\n long long cumsum=0;\n long long current_sign=initial_sign[i];\n for(int j=0;j<N;j++){\n cumsum+=a[j];\n if(cumsum*current_sign<=0){\n res[i]+=abs(cumsum-current_sign);\n cumsum=current_sign;\n }\n current_sign=-1*current_sign;\n }\n }\n cout << min(res[0],res[1]);\n return 0;\n}", "#include<iostream>\n#include<vector>\nusing namespace std;\nint main(){\n\tint n;\n\tcin >> n;\n\tvector<long long> a(n+1,0);\n\tfor(int i=1;i<=n;i++){\n\t\tcin >> a[i];\n\t\ta[i]+=a[i-1];\n\t}\n\tlong long ans=1LL<<50;\n\tfor(int k=-1;k<=1;k+=2){\n\t\tint sign=k;\n\t\tlong long plus=0,minus=0;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tif(a[i]+plus-minus>0){\n\t\t\t\tif(sign==-1) minus+=a[i]+plus-minus+1;\n\t\t\t}else if(a[i]+plus-minus<0){\n\t\t\t\tif(sign==1)\tplus+=-(a[i]+plus-minus)+1;\n\t\t\t}else{\n\t\t\t\tif(sign==-1) minus+=1;\n\t\t\t\telse if(sign==1) plus+=1;\n\t\t\t}\n\t\t\tsign*=-1;\n\t\t}\n\t\tif(ans>plus+minus) ans=plus+minus;\n\t}\n\tcout << ans << endl;\n}\n", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n long count1 = 0;\n long sum1 = 0;\n // 最初の和が正\n for (int i = 0; i < n; i++) {\n sum1 += a[i];\n if (i % 2 == 0 && sum1 <= 0) {\n count1 += (-sum1) + 1;\n sum1 = 1;\n // while (sum1 <= 0) {\n // sum1++;\n // count1++;\n // }\n } else if (i % 2 == 1 && sum1 >= 0) {\n count1 += sum1 + 1;\n sum1 = -1;\n // while (sum1 >= 0) {\n // sum1--;\n // count1++;\n // }\n }\n }\n long count2 = 0;\n long sum2 = 0;\n // 最初の和が負\n for (int i = 0; i < n; i++) {\n sum2 += a[i];\n if (i % 2 == 0 && sum2 >= 0) {\n count2 += sum2 + 1;\n sum2 = -1;\n // while (sum2 >= 0) {\n // sum2--;\n // count2++;\n // }\n } else if (i % 2 == 1 && sum2 <= 0) {\n count2 += (-sum2) + 1;\n sum2 = 1;\n // while (sum2 <= 0) {\n // sum2++;\n // count2++;\n // }\n }\n }\n long ans = Long.min(count1, count2);\n System.out.println(ans);\n }\n}", "/* package whatever; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\nclass Main\n{\n\tstatic long result1 = Long.MAX_VALUE;\n\t\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\t\n\t\tlong[] input = new long[n];\n\t\tlong[] result = new long[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tinput[i] = sc.nextLong();\n\t\t}\n\t\t\n\t\tcounting(input, result, 0, 0, true);\n\t\tcounting(input, result, 0, 0, false);\n\t\tSystem.out.println(result1);\n\t}\n\t\n\tpublic static void counting(long[] input, long[] result, long count, int index, boolean sign) {\n\t\tif(index > 0) {\n\t\t\tresult[index] = result[index-1] + input[index];\n\t\t} else {\n\t\t\tresult[index] = input[index];\n\t\t}\n\t\t\n\t\tif(sign) {\n\t\t\tif(result[index] <= 0) {\n\t\t\t\tcount += Math.abs(result[index]) + 1;\n\t\t\t\tresult[index] = result[index] + Math.abs(result[index]) + 1;\n\t\t\t} \n\t\t\tsign = false;\n\t\t} else {\n\t\t\tif(result[index] >= 0) {\n\t\t\t\tcount += Math.abs(result[index]) + 1;\n\t\t\t\tresult[index] = result[index] - Math.abs(result[index]) - 1;\n\t\t\t}\n\t\t\tsign = true;\n\t\t}\n\t\t\n\t\tif(index < result.length-1) {\n\t\t\tcounting(input, result, count, index+1, sign);\n\t\t} else {\n\t\t\tif(result1 > count) {\n\t\t\t\tresult1 = count;\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n}", "n = int(raw_input())\na = map(int, raw_input().split())\nans = []\nfor k in range(2):\n s, cur = 0, 0\n for j in range(n):\n s += a[j]\n if (k+j) % 2 == 0:\n if s <= 0:\n cur += abs(1 - s)\n s = 1\n else:\n if s >= 0:\n cur += abs(-1 - s)\n s = -1\n ans.append(cur)\nprint min(ans)", "n=input()\na=[int(i) for i in input().split()]\ndef chk(a,t):\n ans=0\n x=0\n for i in a:\n x+=i\n if t==True and x<1:\n ans+=1-x\n x=1\n elif t==False and x>-1:\n ans+=x+1\n x=-1\n t=not t\n return ans\nprint(min(chk(a,True),chk(a,False)))", "import copy\n\nn=int(input())\na=[int(x) for x in input().rstrip().split()]\nac=copy.deepcopy(a)\n\nnow=0\nans1=0\nfor i in range(n):\n now+=a[i]\n if i%2==0:\n if now<=0:\n ans1+=abs(now)+1\n now=1\n else:\n if 0<=now:\n ans1+=abs(now)+1\n now=-1\n\nnow=0\nans2=0\nfor i in range(n):\n now+=a[i]\n if i%2==0:\n if 0<=now:\n ans2+=abs(now)+1\n now=-1\n else:\n if now<=0:\n ans2+=abs(now)+1\n now=1\nprint(min(ans1,ans2))", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n\tint n; cin >> n;\n\tvector<ll> a(n);\n\tfor (int i = 0; i < n; i++) cin >> a[i];\n\n\tll ans1 = 0, ans2 = 0;\n\tll S = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tS += a[i];\n\t\tif (i % 2 == 0 && S <= 0) {\n\t\t\tans1 += 1 - S;\n\t\t\tS = 1ll;\n\n\t\t}\n\t\telse if (i % 2 == 1 && S >= 0) {\n\t\t\tans1 += S + 1;\n\t\t\tS = -1ll;\n\t\t}\n\t}\n\tS = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tS += a[i];\n\t\tif (i % 2 == 1 && S <= 0) {\n\t\t\tans2 += 1 - S;\n\t\t\tS = 1ll;\n\n\t\t}\n\t\telse if (i % 2 == 0 && S >= 0) {\n\t\t\tans2 += S + 1;\n\t\t\tS = -1ll;\n\t\t}\n\t}\n\tcout << min(ans1, ans2) << endl;\n}", "from copy import copy\nn = int(input())\na = [int(x) for x in input().split()]\nans1=[(-1)**i for i in range(n)]\n\nb=copy(a)\nres_b=0\nsb=0\nc=copy(a)\nres_c=0\nsc=0\nfor i in range(n):\n sb+=a[i]\n if ans1[i]*sb>0:\n pass\n else:\n b[i]=ans1[i]-(sb-b[i])\n sb=sb-a[i]+b[i]\n res_b+=abs(b[i]-a[i])\n\n sc+=a[i]\n if -1*ans1[i]*sc>0:\n pass\n else:\n c[i]=-1*ans1[i]-(sc-c[i])\n sc=sc-a[i]+c[i]\n res_c+=abs(c[i]-a[i])\n \nprint(min(res_b,res_c))", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n long[] a1 = new long[n];\n long[] a2 = new long[n];\n for (int i = 0; i < n; i++) {\n long temp = Long.parseLong(sc.next());\n a1[i] = temp;\n a2[i] = temp;\n }\n long ans1 = 0;\n long ans2 = 0;\n long temp = 0;\n for (int i = 0; i < n; i++) {\n if (i % 2 == 0 && temp + a1[i] >= 0) {\n ans1 += temp + a1[i] + 1;\n a1[i] -= temp + a1[i] + 1;\n }\n if (i % 2 != 0 && temp + a1[i] <= 0) {\n ans1 += Math.abs(temp + a1[i] - 1);\n a1[i] += Math.abs(temp + a1[i] - 1);\n }\n temp += a1[i];\n }\n temp = 0;\n for (int i = 0; i < n; i++) {\n if (i % 2 == 0 && temp + a2[i] <= 0) {\n ans2 += Math.abs(temp + a2[i] - 1);\n a2[i] += Math.abs(temp + a2[i] - 1);\n }\n if (i % 2 != 0 && temp + a2[i] >= 0) {\n ans2 += temp + a2[i] + 1;\n a2[i] -= temp + a2[i] + 1;\n }\n temp += a2[i];\n }\n System.out.println(Math.min(ans1, ans2));\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tvector<int> a(n);\n\tfor(int i=0; n>i; i++)\n\t\tcin>>a.at(i);\n\tlong long sum=0,cntp=0;\n\tfor(int i=0; i<n; i++){\n \tsum = sum+a.at(i);\n \tif(i%2==0)\n\t\t\tif(sum<=0){\n\t\t\t\tcntp = cntp+1-sum;\n\t\t\t\tsum=1;\n\t\t\t}\n \tif(i%2==1)\n\t\t\tif(sum>=0){\n\t\t\t\tcntp = cntp+sum+1;\n\t\t\t\tsum=-1;\n\t\t\t}\n\t}\n\tlong long cntm = 0;\n\tsum = 0;\n\tfor(int i=0; i<n; i++){\n \tsum = sum+a.at(i);\n \tif(i%2==1)\n\t\t\tif(sum<=0){\n\t\t\t\tcntm = cntm+1-sum;\n\t\t\t\tsum=1;\n\t\t\t}\n \tif(i%2==0)\n\t\t\tif(sum>=0){\n\t\t\t\tcntm = cntm+sum+1;\n\t\t\t\tsum=-1;\n\t\t\t}\n\t}\n\tcout << min(cntm,cntp) << endl;\n }", "#include <cstdio>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n int n;\n cin >> n;\n\n int a[n+1]; \n for(int i=0;i<n;i++)\n cin >> a[i];\n\n int64_t sum = 0;\n int c = 1;\n int64_t ans0 = 0, ans1 = 0;\n \n for(int i=0;i<n;i++) {\n sum += a[i];\n if(sum * c < 1) {\n ans0 += 1 - sum * c;\n sum = c;\n }\n c *= -1;\n }\n\n c = -1;\n sum = 0;\n for(int i=0;i<n;i++) {\n sum += a[i];\n if(sum * c < 1) {\n ans1 += 1 - sum * c;\n sum = c;\n }\n c *= -1;\n }\n\n if(ans0 < ans1)\n cout << ans0 << endl;\n else\n cout << ans1 << endl;\n \n return 0;\n}\n", "from sys import stdin\nN = int(stdin.readline().rstrip())\nA = [int(_) for _ in stdin.readline().rstrip().split()]\n\ndef solve(s):\n ans, tmp = 0, 0\n for i in range(N):\n tmp += A[i]\n if tmp * s <= 0:\n ans += abs(tmp - s)\n tmp = s\n s *= -1\n return ans\nprint(min(solve(1), solve(-1)))", "N = int(input())\nA = [int(x) for x in input().split()]\n\ndef f(sgn):\n cum = 0\n cnt_operation = 0\n for a in A:\n sgn *= -1\n cum += a\n if cum * sgn > 0:\n continue\n else:\n cnt_operation += abs(cum) + 1\n cum = sgn\n return cnt_operation\nprint(min(f(-1), f(1)))\n\n", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t\tlong plus_op = 0, minus_op = 0; // start with +, -\n\t\tlong sum = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 0 && sum > 0 || i % 2 == 1 && sum < 0) continue;\n\t\t\tif(i % 2 == 0) {\n\t\t\t\t// + なのに - になってる -> sumを+1にもっていく\n\t\t\t\tplus_op += (long)Math.abs(1 - sum);\n\t\t\t\tsum = 1;\n\t\t\t}else {\n\t\t\t\t// - なのに + になってる -> sumを-1にもっていく\n\t\t\t\tplus_op += (long)Math.abs(sum + 1);\n\t\t\t\tsum = -1;\n\t\t\t}\n\t\t}\n\n\t\tsum = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tsum += a[i];\n\t\t\tif(i % 2 == 0 && sum < 0 || i % 2 == 1 && sum > 0) continue;\n\t\t\tif(i % 2 == 0) {\n\t\t\t\t// - なのに + になってる -> sumを-1にもっていく\n\t\t\t\tminus_op += (long)Math.abs(sum + 1);\n\t\t\t\tsum = -1;\n\t\t\t}else {\n\t\t\t\t// + なのに - になってる -> sumを+1にもっていく\n\t\t\t\tminus_op += (long)Math.abs(1 - sum);\n\t\t\t\tsum = 1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(plus_op, minus_op));\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner io = new Scanner(System.in);\n\t\tint n = io.nextInt();\n\t\tint[] a = new int[n+1];\n\t\tfor(int i=1;i<=n;i++){\n\t\t\ta[i] = io.nextInt();\n\t\t}\n\t\n\t\t// + - \n\t\tlong sum = 0;\n\t\tlong now=0;\n\t\tlong border = 1;\n\t\tlong end = 0;\n\t\tlong ans_p=0;\n\t\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tsum += a[i];\n\t\t\tend = border-sum;\n\t\t\tif(border>0){\n\t\t\t\tif(now<end){\n\t\t\t\t\tans_p += Math.abs(now-end);\n\t\t\t\t\tnow = end;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(now>end){\n\t\t\t\t\tans_p += Math.abs(now-end);\n\t\t\t\t\tnow = end;\n\t\t\t\t}\n\t\t\t}\n\t\t\tborder = -border;\n\t\t}\n\t\t\n\t\t//- +\n\t\tsum=0;\n\t\tnow=0;\n\t\tborder = -1;\n\t\tend = 0;\n\t\tlong ans_m=0;\n\t\t\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tsum += a[i];\n\t\t\tend = border-sum;\n\t\t\tif(border>0){\n\t\t\t\tif(now<end){\n\t\t\t\t\tans_m += Math.abs(now-end);\n\t\t\t\t\tnow = end;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(now>end){\n\t\t\t\t\tans_m += Math.abs(now-end);\n\t\t\t\t\tnow = end;\n\t\t\t\t}\n\t\t\t}\n\t\t\tborder = -border;\n\t\t}\n\t\tSystem.out.println(Math.min(ans_p,ans_m));\n\t}\n}", "n = int(input())\na = list(map(int, input().split()))\n\nresult = []\n\nfor i in range(2):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n\n else:\n if num >= 0:\n r += num + 1\n num = -1\n\n result.append(r)\n\nprint(min(result))\n", "n = int(input())\na = list(map(int,input().split()))\n\ndef calc(t):\n ans = su = 0\n for i in range(n):\n su += a[i]\n if i % 2 == t:\n if su > 0:\n pass\n else:\n x = 1 - su\n ans += abs(x)\n su = 1\n else:\n if su < 0:\n pass\n else:\n x = - 1 - su\n ans += abs(x)\n su = -1\n return ans\nprint(min(calc(1), calc(0)))", "import java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException{\n\t\tSequence solver = new Sequence();\n\t\tsolver.readInput();\n\t\tsolver.solve();\n\t\tsolver.writeOutput();\n\t}\n\n\n\tstatic class Sequence {\n\t\tprivate int n;\n\t\tprivate long a[];\n\n\t\tprivate long output;\n\t\tprivate Scanner scanner;\n\n\t\tpublic Sequence() {\n\t\t\tthis.scanner = new Scanner(System.in);\n\t\t}\n\n\t\tpublic void readInput() {\n\t\t\tn = Integer.parseInt(scanner.next());\n\t\t\ta = new long[n];\n\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t\ta[i] = Integer.parseInt(scanner.next());\n\t\t\t}\n\t\t}\n\n\t\tprivate long count(int sign) {\n\t\t\tlong count=0;\n\t\t\tlong sum=0;\n\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t\tsum += a[i];\n\t\t\t\tif(i%2==sign) {\n\t\t\t\t\t// a[i]までの合計を正にするとき\n\t\t\t\t\tif(sum<=0) {\n\t\t\t\t\t\tcount += 1-sum;\n\t\t\t\t\t\tsum = 1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// a[i]までの合計を負にするとき\n\t\t\t\t\tif(0<=sum) {\n\t\t\t\t\t\tcount += 1+sum;\n\t\t\t\t\t\tsum = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn count;\n\t\t}\n\n\t\tpublic void solve() {\n\t\t\tlong count1 = \tcount(0);\n\t\t\tlong count2 = count(1);\n\t\t\toutput = Math.min(count1,count2);\n\t\t}\n\n\n\n\n\t\tpublic void writeOutput() {\n\t\t\tSystem.out.println(output);\n\t\t}\n\t}\n\n}", "#include<stdio.h>\n#include<iostream>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\n\nint n;\nlong long sum = 0;\nlong long ans1 = 0;\nlong long ans2 = 0;\nint i, j;\nint t = 1;\n\nint main() {\n\n\tcin >> n ;\n\n\tint a[100010];\n\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t\tsum += a[i];\n\n\t\tif (sum*t <= 0) {\n\t\t\tans1 += abs(sum-t);\n\t\t\tsum = t;\n\t\t}\n\t\tt *= -1;\n\t}\n\n\tt = -1;\n\tsum = 0;\n\n\tfor (i = 0; i < n; i++) {\n\t\tsum += a[i];\n\t\tif (sum*t <= 0) {\n\t\t\tans2 += abs(sum - t);\n\t\t\tsum = t;\n\t\t}\n\n\t\tt *= -1;\n\t}\n\tprintf(\"%lld\\n\", min(ans1, ans2));\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n long long n,a,s1=0,s2=0,c1=0,c2=0;\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>a;\n s1+=a;\n s2+=a;\n if(i%2){\n if(s1<=0){\n c1+=1-s1;\n s1=1;\n }\n if(s2>=0){\n c2+=1+s2;\n s2=-1;\n }\n }\n else{\n if(s1>=0){\n c1+=1+s1;\n s1=-1;\n }\n if(s2<=0){\n c2+=1-s2;\n s2=1;\n }\n }\n }\n cout<<min(c1,c2)<<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\n\nvoid solve() {\n int n; cin >> n;\n ll a;\n vector<ll> sum(2), cnt(2);\n for(int i=0; i<n; ++i) {\n cin >> a;\n for(int j : {0,1}) {\n sum[j] += a;\n int d = 1 - (i+j) % 2 * 2;\n if(sum[j]*d <= 0) {\n cnt[j] += abs(d-sum[j]);\n sum[j] = d;\n }\n }\n }\n cout << min(cnt[0],cnt[1]) << '\\n';\n \n return;\n}\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int T=1;\n //cin >> T;\n while(T--) solve();\n\n return 0;\n}\n", "import java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint n = scanner.nextInt();\n\t\t\tlong[] a = IntStream.range(0, n).mapToLong(i -> scanner.nextLong()).toArray();\n\t\t\t// sum1=[1,-1,...], sum2=[-1,1,...]\n\t\t\tint[] sum1 = new int[n], sum2 = new int[n];\n\t\t\tArrays.fill(sum1, 1);\n\t\t\tArrays.fill(sum2, -1);\n\t\t\tIntStream.range(0, n / 2).forEach(i -> {\n\t\t\t\tsum1[2 * i + 1] = -1;\n\t\t\t\tsum2[2 * i + 1] = 1;\n\t\t\t});\n\t\t\tSystem.out.println(Math.min(getResult(a, sum1), getResult(a, sum2)));\n\t\t}\n\t}\n\n\t/**\n\t * @param a 数値配列\n\t * @param sum 変更したい合計値の配列\n\t * @return 変更が必要なステップ数\n\t */\n\tprivate static long getResult(final long[] a, final int[] sum) {\n\t\tint n = a.length;\n\t\tlong now = 0, result = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnow += a[i];\n\t\t\tif (sum[i] * now <= 0) {\n\t\t\t\tresult += Math.abs(sum[i] - now);\n\t\t\t\tnow = sum[i];\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n}\n", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int n = in.nextInt();\n\n long ans1 = 0;\n long a1n = 0;\n long ans2 = 0;\n long a2n = 0;\n for (int i = 0; i < n; i++) {\n long cn = in.nextLong();\n a1n += cn;\n a2n += cn;\n if (i % 2 == 0) {\n ans1 += Math.max(0, -a1n + 1);\n a1n = Math.max(1, a1n);\n ans2 += Math.max(0, a2n + 1);\n a2n = Math.min(-1, a2n);\n } else {\n ans2 += Math.max(0, -a2n + 1);\n a2n = Math.max(1, a2n);\n ans1 += Math.max(0, a1n + 1);\n a1n = Math.min(-1, a1n);\n }\n\n }\n\n out.println(Math.min(ans1, ans2));\n\n\n }\n\n }\n\n static class FastScanner {\n private InputStream in;\n private byte[] buffer = new byte[1024];\n private int bufPointer;\n private int bufLength;\n\n public FastScanner(InputStream in) {\n this.in = in;\n }\n\n private int readByte() {\n if (bufPointer >= bufLength) {\n if (bufLength == -1)\n throw new InputMismatchException();\n\n bufPointer = 0;\n try {\n bufLength = in.read(buffer);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (bufLength <= 0)\n return -1;\n }\n return buffer[bufPointer++];\n }\n\n private static boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public long nextLong() {\n long n = 0;\n\n int b = readByte();\n while (isSpaceChar(b))\n b = readByte();\n\n boolean minus = (b == '-');\n if (minus)\n b = readByte();\n\n while (b >= '0' && b <= '9') {\n n *= 10;\n n += b - '0';\n b = readByte();\n }\n\n if (!isSpaceChar(b))\n throw new NumberFormatException();\n\n return minus ? -n : n;\n }\n\n public int nextInt() {\n long n = nextLong();\n\n if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE)\n throw new NumberFormatException();\n\n return (int) n;\n }\n\n }\n}\n\n", "n = int(input())\nA = list(map(int,input().split()))\n\nans = float(\"inf\")\n\nfor ii in [1, -1]:\n i = ii\n s = 0\n ans0 = 0\n for j in range(n):\n s += A[j]\n if s * i <= 0:\n ans0 += abs(s - i)\n s = i\n i = -i\n\n ans = min(ans, ans0)\n\nprint(ans)", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = Integer.parseInt(sc.next());\n\t\tArrayList<Integer> a = new ArrayList<>();\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta.add(Integer.parseInt(sc.next()));\n\t\t}\n\t\tsc.close();\n\n\t\tlong ans1 = 0;\n\t\tlong sum1 = 0;\n\t\tlong sign1 = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tsum1 += a.get(i);\n\t\t\tif (sum1 * sign1 <= 0) {\n\t\t\t\tans1 += Math.abs(sum1) + 1;\n\t\t\t\tsum1 = sign1;\n\t\t\t}\n\t\t\tsign1 *= -1;\n\t\t}\n\n\t\tlong ans2 = 0;\n\t\tlong sum2 = 0;\n\t\tlong sign2 = -1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tsum2 += a.get(i);\n\t\t\tif (sum2 * sign2 <= 0) {\n\t\t\t\tans2 += Math.abs(sum2) + 1;\n\t\t\t\tsum2 = sign2;\n\t\t\t}\n\t\t\tsign2 *= -1;\n\t\t}\n\n\t\tSystem.out.println(Math.min(ans1, ans2));\n\t}\n\n\tpublic static int[] arrayInt(Scanner sc, int n) {\n\t\tint[] array = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarray[i] = sc.nextInt();\n\t\t}\n\t\treturn array;\n\t}\n\n\tpublic static long[] arrayLong(Scanner sc, int n) {\n\t\tlong[] array = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarray[i] = sc.nextLong();\n\t\t}\n\t\treturn array;\n\t}\n\n\tpublic static double[] arrayDouble(Scanner sc, int n) {\n\t\tdouble[] array = new double[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarray[i] = sc.nextDouble();\n\t\t}\n\t\treturn array;\n\t}\n}\n", "def c_sequence():\n N = int(input())\n A = [int(i) for i in input().split()]\n\n def solver(sign):\n ret, total = 0, 0\n for a in A:\n total += a\n if sign * total <= 0:\n ret += abs(sign - total) # 総和がsignになるまでaを変化させる\n total = sign\n sign *= -1\n return ret\n # 1: 奇数番目を正、偶数番目を負にする場合。 -1: その逆\n return min(solver(1), solver(-1))\n\nprint(c_sequence())", "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(10 ** 7)\n\nn, *a = map(int, read().split())\nans = float('inf')\nfor i in (-1, 1):\n cnt, now = 0, 0\n for aa in a:\n now += aa\n if now * i <= 0:\n cnt += abs(now - i)\n now = i\n i *= -1\n ans = min(ans, cnt)\nprint(ans)\n", "n=int(input())\na=map(int,input().split())\nans1,ans2=0,0\nm1,m2=0,0\nk=1\nfor i in a:\n m1+=i\n m2+=i\n if k:\n k=0\n if m1>=0:\n ans1+=m1+1\n m1=-1\n if m2<=0:\n ans2+=1-m2\n m2=1\n else:\n k=1\n if m1<=0:\n ans1+=1-m1\n m1=1\n if m2>=0:\n ans2+=m2+1\n m2=-1\nprint(min(ans1,ans2))", "N = int(input())\nA = list(map(int,input().split()))\n\ndef dfs(sign):\n cnt = 0\n tmp = 0\n for a in A:\n tmp += a\n if(tmp*sign >= 0):\n cnt += abs(tmp) + 1\n tmp = -sign\n sign *= -1\n return cnt\n\nprint(min(dfs(1), dfs(-1)))", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n cin>>n;\n vector<long long> a(n);\n for(long long &x: a) cin>>x;\n long long ans_1=0,ans=0;\n long long sum_1=a[0],sum=a[0];\n while(sum_1<=0) {sum_1++; ans_1++;}\n while(sum>=0) {sum--; ans++;}\n for(int i=1;i<n;i++){\n sum_1+=a[i];\n if(i%2==1){\n while(sum_1>=0) {sum_1--; ans_1++;}\n }\n if(i%2==0){\n while(sum_1<=0) {sum_1++; ans_1++;}\n }\n }\n for(int i=1;i<n;i++){\n sum+=a[i];\n if(i%2==1){\n while(sum<=0) {sum++; ans++;}\n }\n if(i%2==0){\n while(sum>=0) {sum--; ans++;}\n }\n }\n cout<<min(ans_1,ans)<<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nint main(){\n int n;\n cin >> n;\n ll A[n];\n for(int i=0; i<n; ++i) cin >> A[i];\n ll sum = 0, pm = 0, mp = 0;\n for(int i=0; i<n; ++i){\n sum += A[i];\n if(i%2 == 0 && sum <= 0){ pm += 1-sum; sum = 1; }\n if(i%2 != 0 && sum >= 0){ pm += 1+sum; sum = -1; }\n }\n sum = 0;\n for(int i=0; i<n; ++i){\n sum += A[i];\n if(i%2 == 0 && sum >= 0){ mp += 1+sum; sum = -1; }\n if(i%2 != 0 && sum <= 0){ mp += 1-sum; sum = 1; }\n }\n cout << min(pm, mp) << endl;\n}", "#include<iostream>\n#define rep(i,n) for(int i=0;i<n;++i)\nusing namespace std;\n\nint n, a[100000];\n\nint64_t calc(int sign) {\n int64_t ret = 0, sum = 0;\n rep(i, n) {\n sum += a[i];\n if (sum * sign <= 0) {\n ret += abs(sum) + 1;\n sum = sign;\n }\n sign *= -1;\n }\n return ret;\n}\n\nint main() {\n cin >> n;\n rep(i, n) cin >> a[i];\n cout << min(calc(1), calc(-1)) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (int i = 0; i < (int)N; i++)\n\nint main () {\n int n;\n cin >> n;\n\n vector<int> a(n);\n rep(i,n)cin >> a[i];\n\n ll c1 = 0, c2 = 0;\n ll s1 = 0, s2 = 0;\n for(int i = 0; i < n; i++) {\n s1 += a[i];\n if(i % 2 == 0 && s1 <= 0) {\n c1 += -s1 + 1;\n s1 = 1;\n } else if(i % 2 == 1 && s1 >= 0) {\n c1 += s1 + 1;\n s1 = -1;\n }\n\n s2 += a[i];\n if(i % 2 == 1 && s2 <= 0) {\n c2 += -s2 + 1;\n s2 = 1;\n } else if(i % 2 == 0 && s2 >= 0) {\n c2 += s2 + 1;\n s2 = -1;\n }\n }\n\n cout << min(c1, c2) << endl;\n return 0;\n}\n", "n=int(input())\nA=list(map(int,input().split()))\nif A[0]>0:\n S=A[0]\n ans_1=0\nelse:\n S=1\n ans_1=1-A[0]\nfor i in A[1:]:\n if S*(S+i)<0:\n S+=i\n else:\n ans_1+=abs(S+i)+1\n if S<0:\n S=1\n else:\n S=-1\nif A[0]<0:\n S=A[0]\n ans_2=0\nelse:\n S=-1\n ans_2=A[0]+1\nfor i in A[1:]:\n if S*(S+i)<0:\n S+=i\n else:\n ans_2+=abs(S+i)+1\n if S<0:\n S=1\n else:\n S=-1\nprint(min(ans_1,ans_2))", "#include<cstdio>\n#include<cmath>\n#include<algorithm>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint n;\nll a[100000];\n\nll solve(ll t){\n\tll res = 0, sum = 0;\n\tfor(int i = 0; i < n; i++, t = -t){\n\t\tsum += a[i];\n\t\tif(sum * t > 0) continue;\n\t\tres += abs(sum - t);\n\t\tsum += t * abs(sum - t);\n\t}\n\treturn res;\n}\n\nint main(){\n\tscanf(\"%d\", &n);\n\tfor(int i = 0; i < n; i++) scanf(\"%lld\", &a[i]);\n\tll res = solve(1);\n\tres = min(res, solve(-1));\n\tprintf(\"%lld\\n\", res);\n\treturn 0;\n}", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n String[] str_a = br.readLine().split(\" \");\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = Integer.parseInt(str_a[i]);\n }\n \n long sum = 0;\n long count = 0;\n \n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (i % 2 == 1) {\n if (sum >= 0) {\n count += sum + 1;\n sum = -1;\n }\n }\n else {\n if (sum <= 0) {\n count += 1 - sum;\n sum = 1;\n }\n }\n }\n \n long count2 = 0;\n sum = 0;\n for (int i = 0; i < n; i++) {\n sum += a[i];\n if (i % 2 == 0) {\n if (sum >= 0) {\n count2 += sum + 1;\n sum = -1;\n }\n }\n else {\n if (sum <= 0) {\n count2 += 1 - sum;\n sum = 1;\n }\n }\n }\n System.out.println(count>=count2?count2:count);\n }\n}\n", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] nums = new long[n];\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tnums[i] = sc.nextLong();\n\t\t}\n\t\tlong result = 0;\n\t\tlong sum = 0;\n\t\t// + - + -\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tif(i % 2 == 0 && sum + nums[i] <= 0){\n\t\t\t\tresult += Math.abs(1 - (sum + nums[i]));\n\t\t\t\tsum = 1;\n\t\t\t}\n\t\t\telse if(i % 2 == 1 && sum + nums[i] >= 0){\n\t\t\t\tresult += Math.abs(-1 - (sum + nums[i]));\n\t\t\t\tsum = -1;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tsum += nums[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong result2 = 0;\n\t\tsum = 0;\n\t\t// - + - +\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tif(i % 2 == 1 && sum + nums[i] <= 0){\n\t\t\t\tresult2 += Math.abs(1 - (sum + nums[i]));\n\t\t\t\tsum = 1;\n\t\t\t}\n\t\t\telse if(i % 2 == 0 && sum + nums[i] >= 0){\n\t\t\t\tresult2 += Math.abs(-1 - (sum + nums[i]));\n\t\t\t\tsum = -1;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tsum += nums[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(Math.min(result, result2));\n\t\t\n\t\tsc.close();\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tlong[] a=new long[n];\n\t\tfor(int i=0;i<n;i++)a[i]=sc.nextLong();\n\t\tlong sum=0;\n\t\tlong cost1=0;\n\t\tlong cost2=0;\n\t\t//+-+-の順番のコスト\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i%2==0 && sum+a[i]<=0){\n\t\t\t\tcost1+=-(sum+a[i]-1);\n\t\t\t\tsum=1;\n\t\t\t}else if(i%2!=0 && sum+a[i]>=0){\n\t\t\t\tcost1+=sum+a[i]+1;\n\t\t\t\tsum=-1;\n\t\t\t}else{\n\t\t\t\tsum+=a[i];\n\t\t\t}\n\t\t}\n\t\tsum=0;\n\t\t//-+-+の順番のコスト\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i%2==0 && sum+a[i]>=0){\n\t\t\t\tcost2+=sum+a[i]+1;\n\t\t\t\tsum=-1;\n\t\t\t}else if(i%2!=0 && sum+a[i]<=0){\n\t\t\t\tcost2+=-(sum+a[i]-1);\n\t\t\t\tsum=1;\n\t\t\t}else{\n\t\t\t\tsum+=a[i];\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(cost1, cost2));\n\t}\n}", "n = int(input())\na = list(map(int, input().split()))\n\ndef check(flag):\n acc = 0\n cnt = 0\n\n flag = flag\n for i in a:\n acc += i\n if (flag == 1 and flag > acc) or (flag == -1 and flag < acc) or i == 0:\n cnt += abs(flag - acc)\n acc = flag\n flag *= -1\n return cnt\n\nprint(min(check(1), check(-1)))\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main()\n{\n\tll n;\n cin >> n;\n ll ans = 1e18;\n vector<ll> a(n);\n for(int i = 0;i<n;i++)cin >> a[i];\n for(int aaa = 0;aaa<2;aaa++)\n {\n if(aaa)for(auto &i:a)i = -i;\n ll sum = 0;\n ll now = 0;\n for(int i = 0;i<n;i++)\n {\n sum += a[i];\n if(i%2)//負になるようにする\n {\n now += max(0LL,sum-(-1));\n sum = min<ll>(-1,sum);\n }\n else//正になるようにする\n { \n now += max(0LL,(1)-sum);\n sum = max<ll>(1,sum);\n }\n }\n ans = min<ll>(now,ans);\n }\n cout<<ans<<endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define LL long long\nLL ans1,ans2,sum;\nint n;\nint a[100010];\n\nint main(){\n\tscanf(\"%d\",&n);\n\tfor(int i=1;i<=n;i++) scanf(\"%d\",&a[i]);\n\tsum=0;\n\tfor(int i=1,s=1;i<=n;i++,s*=-1){\n\t\tsum+=a[i];\n\t\tif(sum*s<=0) ans1+=abs(sum-s),sum=s;\n\t}\n\tsum=0;\n\tfor(int i=1,s=-1;i<=n;i++,s*=-1){\n\t\tsum+=a[i];\n\t\tif(sum*s<=0) ans2+=abs(sum-s),sum=s;\n\t}\n\tprintf(\"%lld\\n\",min(ans1,ans2));\n\treturn 0;\n} \n", "#include <bits/stdc++.h>\n#define ll long long\n#define vl vector<ll>\n#define pl pair<ll,ll>\n#define FOR(i,a,b) for(ll i=a;i<b;i++)\n#define rep(i,b) for(ll i=0;i<b;i++)\n#define RFOR(i,a,b) for(ll i=b-1;i>=a;i--)\n#define rsort(v) sort((v).rbegin(), (v).rend())\n#define all(v) (v).begin(),(v).end()\nusing namespace std;\nll mod=1000000007;\n\nsigned main(){\n ll n,s,sum,ans=0,ans2=0;\n cin>>n;\n vl a(n);\n rep(i,n)cin>>a[i];\n\n sum = 0,s=1;\n rep(i,n){\n s*=-1;\n sum += a[i];\n if(sum * s <= 0)ans+=abs(sum-s),sum=s;\n }\n sum = 0,s=-1;\n rep(i,n){\n s*=-1;\n sum += a[i];\n if(sum * s <= 0)ans2+=abs(sum-s),sum=s;\n }\n cout << min(ans, ans2) << endl;\n}", "import java.util.*;\nimport java.io.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tSolver solver = new Solver();\n\t\tsolver.solve();\n\t\tsolver.exit();\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate final InputStream in = System.in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int ptr = 0;\n\t\tprivate int buflen = 0;\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (ptr < buflen) {\n\t\t\t\treturn true;\n\t\t\t}else{\n\t\t\t\tptr = 0;\n\t\t\t\ttry {\n\t\t\t\t\tbuflen = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\tif (buflen <= 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tprivate int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n\t\tprivate boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n\t\tprivate void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n\t\tpublic boolean hasNext() { skipUnprintable(); return hasNextByte();}\n\t\tpublic String next() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile(isPrintableChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif (b < '0' || '9' < b) {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\twhile(true){\n\t\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\t\tn *= 10;\n\t\t\t\t\tn += b - '0';\n\t\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\t\treturn minus ? -n : n;\n\t\t\t\t}else{\n\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Solver {\n\t\tFastScanner sc = new FastScanner();\n\t\tpublic Solver() { }\n\n\t\tString ns() { return sc.next(); }\n\t\tString[] ns(int n) {\n\t\t\tString a[] = new String[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ns(); }\n\t\t\treturn a;\n\t\t}\n\t\tString[][] ns(int n, int m) {\n\t\t\tString a[][] = new String[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ns(m); }\n\t\t\treturn a;\n\t\t}\n\t\tchar[] nc(int n) {\n\t\t\tString str = ns();\n\t\t\tchar a[] = new char[str.length()];\n\t\t\tfor(int i = 0; i < str.length(); i ++) { a[i] = str.charAt(i); }\n\t\t\treturn a;\n\t\t}\n\t\tchar[][] nc(int n, int m) {\n\t\t\tchar a[][] = new char[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nc(m); }\n\t\t\treturn a;\n\t\t}\n\t\tboolean[] nb(int n, char t) {\n\t\t\tboolean a[] = new boolean[n];\n\t\t\tchar c[] = nc(n);\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = c[i] == t; }\n\t\t\treturn a;\n\t\t}\n\t\tboolean[][] nb(int n, int m, char t) {\n\t\t\tboolean a[][] = new boolean[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nb(m, t); }\n\t\t\treturn a;\n\t\t}\n\t\tint ni() { return (int)sc.nextLong(); }\n\t\tint[] ni(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ni(); }\n\t\t\treturn a;\n\t\t}\n\t\tint[][] ni(int n, int m) {\n\t\t\tint a[][] = new int[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = ni(m); }\n\t\t\treturn a;\n\t\t}\n\t\tlong nl() { return sc.nextLong(); }\n\t\tlong[] nl(int n) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nl(); }\n\t\t\treturn a;\n\t\t}\n\t\tlong[][] nl(int n, int m) {\n\t\t\tlong a[][] = new long[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) { a[i] = nl(m); }\n\t\t\treturn a;\n\t\t}\n\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tPrintWriter err = new PrintWriter(System.err);\n\t\tvoid prt() { out.print(\"\"); }\n\t\t<T> void prt(T a) { out.print(a); }\n\t\tvoid prtln() { out.println(\"\"); }\n\t\t<T> void prtln(T a) { out.println(a); }\n\t\tvoid prtln(int... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(int element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(long... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(long element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(double... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(double element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(String... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(String element : a){ sb.append(element+\" \"); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(char... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(char element : a){ sb.append(element); }\n\t\t\tprtln(sb.toString().trim());\n\t\t}\n\t\tvoid prtln(int[][] a) { for(int[] element : a){ prtln(element); } }\n\t\tvoid prtln(long[][] a) { for(long[] element : a){ prtln(element); } }\n\t\tvoid prtln(double[][] a) { for(double[] element : a){ prtln(element); } }\n\t\tvoid prtln(String[][] a) { for(String[] element : a){ prtln(element); } }\n\t\tvoid prtln(char[][] a) { for(char[] element : a){ prtln(element); } }\n\t\tvoid errprt() { err.print(\"\"); }\n\t\t<T> void errprt(T a) { err.print(a); }\n\t\tvoid errprt(boolean a) { errprt(a ? \"#\" : \".\"); }\n\t\tvoid errprtln() { err.println(\"\"); }\n\t\t<T> void errprtln(T a) { err.println(a); }\n\t\tvoid errprtln(boolean a) { errprtln(a ? \"#\" : \".\"); }\n\t\tvoid errprtln(int... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(int element : a){ sb.append(element+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(long... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(long element : a){ sb.append(element+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(double... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(double element : a){ sb.append(element+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(String... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(String element : a){ sb.append(element+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(char... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(char element : a){ sb.append(element); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(boolean... a) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(boolean element : a){ sb.append((element ? \"#\" : \".\")+\" \"); }\n\t\t\terrprtln(sb.toString().trim());\n\t\t}\n\t\tvoid errprtln(int[][] a) { for(int[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(long[][] a) { for(long[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(double[][] a) { for(double[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(String[][] a) { for(String[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(char[][] a) { for(char[] element : a){ errprtln(element); } }\n\t\tvoid errprtln(boolean[][] a) { for(boolean[] element : a){ errprtln(element); } }\n\n\t\tvoid reply(boolean b) { prtln(b ? \"Yes\" : \"No\"); }\n\t\tvoid REPLY(boolean b) { prtln(b ? \"YES\" : \"NO\"); }\n\n\t\tvoid flush() { out.flush(); err.flush(); }\n\t\tvoid exit() { flush(); System.exit(0); }\n\n\t\tint min(int a, int b) { return Math.min(a, b); }\n\t\tlong min(long a, long b) { return Math.min(a, b); }\n\t\tdouble min(double a, double b) { return Math.min(a, b); }\n\t\tint min(int... x) {\n\t\t\tint min = x[0];\n\t\t\tfor(int val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tlong min(long... x) {\n\t\t\tlong min = x[0];\n\t\t\tfor(long val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tdouble min(double... x) {\n\t\t\tdouble min = x[0];\n\t\t\tfor(double val : x) { min = min(min, val); }\n\t\t\treturn min;\n\t\t}\n\t\tint max(int a, int b) { return Math.max(a, b); }\n\t\tlong max(long a, long b) { return Math.max(a, b); }\n\t\tdouble max(double a, double b) { return Math.max(a, b); }\n\t\tint max(int... x) {\n\t\t\tint max = x[0];\n\t\t\tfor(int val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tlong max(long... x) {\n\t\t\tlong max = x[0];\n\t\t\tfor(long val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tdouble max(double... x) {\n\t\t\tdouble max = x[0];\n\t\t\tfor(double val : x) { max = max(max, val); }\n\t\t\treturn max;\n\t\t}\n\t\tlong sum(int... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(int element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(long... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(long element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\t\tdouble sum(double... a) {\n\t\t\tdouble sum = 0;\n\t\t\tfor(double element : a) { sum += element; }\n\t\t\treturn sum;\n\t\t}\n\n\t\tlong abs(double x) { return (long)Math.abs(x); }\n\t\tlong round(double x) { return Math.round(x); }\n\t\tlong floor(double x) { return (long)Math.floor(x); }\n\t\tlong ceil(double x) { return (long)Math.ceil(x); }\n\t\tdouble sqrt(double x) { return Math.sqrt(x); }\n\t\tdouble pow(double x, double y) { return Math.pow(x, y); }\n\t\tlong pow(long x, long y) { return (long)Math.pow(x, y); }\n\t\tint gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }\n\t\tlong gcd(long a, long b) { return b == 0 ? a : gcd(b, a % b); }\n\t\tlong lcm(long a, long b) { return a * b / gcd(a, b); }\n\n\t\tint upperToInt(char a) { return a - 'A'; }\n\t\tint lowerToInt(char a) { return a - 'a'; }\n\t\tint charToInt(char a) { return a >= 'a' ? lowerToInt(a) : upperToInt(a); }\n\t\tchar intToUpper(int a) { return (char)(a + 'A'); }\n\t\tchar intToLower(int a) { return (char)(a + 'a'); }\n\n\t\tlong[] div(long a) {\n\t\t\tList<Long> divList = new ArrayList<Long>();\n\t\t\tfor(long i = 1; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tdivList.add(i);\n\t\t\t\t\tif(i * i != a) { divList.add(a / i); };\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlong div[] = new long[divList.size()];\n\t\t\tfor(int i = 0; i < divList.size(); i ++) { div[i] = divList.get(i); }\n\t\t\treturn div;\n\t\t}\n\n\t\tlong[][] factor(long a) {\n\t\t\tList<Long> factorList = new ArrayList<Long>();\n\t\t\tList<Long> degreeList = new ArrayList<Long>();\n\t\t\tfor(long i = 2; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tlong count = 0;\n\t\t\t\t\twhile(a % i == 0) {\n\t\t\t\t\t\ta /= i;\n\t\t\t\t\t\tcount ++;\n\t\t\t\t\t}\n\t\t\t\t\tfactorList.add(i);\n\t\t\t\t\tdegreeList.add(count);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(a > 1) {\n\t\t\t\tfactorList.add(a);\n\t\t\t\tdegreeList.add(1L);\n\t\t\t}\n\t\t\tlong factor[][] = new long[factorList.size()][2];\n\t\t\tfor(int i = 0; i < factorList.size(); i ++) {\n\t\t\t\tfactor[i][0] = factorList.get(i);\n\t\t\t\tfactor[i][1] = degreeList.get(i);\n\t\t\t}\n\t\t\treturn factor;\n\t\t}\n\n\t\tlong[][] countElements(long[] a, boolean sort) {\n\t\t\tint len = a.length;\n\t\t\tlong array[] = new long[len];\n\t\t\tfor(int i = 0; i < len; i ++) {\n\t\t\t\tarray[i] = a[i];\n\t\t\t}\n\t\t\tif(sort) { Arrays.sort(array); }\n\t\t\tList<Long> elem = new ArrayList<Long>();\n\t\t\tList<Long> cnt = new ArrayList<Long>();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add(array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else {\n\t\t\t\t\ttmp ++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\t\tlong[][] countElements(String str, boolean sort) {\n\t\t\tint len = str.length();\n\t\t\tchar array[] = str.toCharArray();\n\t\t\tif(sort) { Arrays.sort(array); }\n\t\t\tList<Long> elem = new ArrayList<Long>();\n\t\t\tList<Long> cnt = new ArrayList<Long>();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add((long)array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else {\n\t\t\t\t\ttmp ++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\n\t\tint numDigits(long a) { return Long.toString(a).length(); }\n\t\tlong bitFlag(int a) { return 1L << (long)a; }\n\t\tboolean isFlagged(long x, int a) { return (x & bitFlag(a)) != 0; }\n\n\t\tlong countString(String str, String a) { return (str.length() - str.replace(a, \"\").length()) / a.length(); }\n\t\tlong countStringAll(String str, String a) { return str.length() - str.replaceAll(a, \"\").length(); }\n\n\t\tvoid reverse(String array[]) {\n\t\t\tString reversed[] = new String[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(int array[]) {\n\t\t\tint reversed[] = new int[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(long array[]) {\n\t\t\tlong reversed[] = new long[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(double array[]) {\n\t\t\tdouble reversed[] = new double[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid reverse(boolean array[]) {\n\t\t\tboolean reversed[] = new boolean[array.length];\n\t\t\tfor(int i = 0; i < array.length; i ++) { reversed[array.length - i - 1] = array[i]; }\n\t\t\tfor(int i = 0; i < array.length; i ++) { array[i] = reversed[i]; }\n\t\t}\n\t\tvoid fill(int array[], int x) { Arrays.fill(array, x); }\n\t\tvoid fill(long array[], long x) { Arrays.fill(array, x); }\n\t\tvoid fill(double array[], double x) { Arrays.fill(array, x); }\n\t\tvoid fill(boolean array[], boolean x) { Arrays.fill(array, x); }\n\t\tvoid fill(int array[][], int x) { for(int a[] : array) { fill(a, x); } }\n\t\tvoid fill(long array[][], long x) { for(long a[] : array) { fill(a, x); } }\n\t\tvoid fill(double array[][], double x) { for(double a[] : array) { fill(a, x); } }\n\t\tvoid fill(boolean array[][], boolean x) { for(boolean a[] : array) { fill(a, x); } }\n\t\tvoid fill(int array[][][], int x) { for(int a[][] : array) { fill(a, x); } }\n\t\tvoid fill(long array[][][], long x) { for(long a[][] : array) { fill(a, x); } }\n\t\tvoid fill(double array[][][], double x) { for(double a[][] : array) { fill(a, x); } }\n\t\tvoid fill(boolean array[][][], boolean x) { for(boolean a[][] : array) { fill(a, x); } }\n\n\t\tlong INF = (long)1e15;\n\t\tboolean isINF(long a) { return abs(a) > INF / 1000; }\n\t\tboolean isPlusINF(long a) { return a > 0 && isINF(a); }\n\t\tboolean isMinusINF(long a) { return isPlusINF(- a); }\n\n\n\t\t// mods\n\t\tlong MOD = (long)1e9 + 7; // 998244353;\n\t\tpublic long mod(long i) { return i % MOD + ((i % MOD) < 0 ? MOD : 0); }\n\n\t\tlong pow_m(long x, long y) {\n\t\t\tif (y == 0) { return 1;\n\t\t\t}else {\n\t\t\t\tlong tmp = pow_m(x, y / 2);\n\t\t\t\treturn mod(mod(tmp * tmp) * (y % 2 == 0 ? 1 : x));\n\t\t\t}\n\t\t}\n\n\t\tlong inv(long x) { return pow_m(x, MOD - 2); }\n\n\t\tint MAX_FACT = 5_000_100;\n\t\tlong fact[];\n\t\tlong invFact[];\n\t\tvoid prepareFact() {\n\t\t\tfact = new long[MAX_FACT];\n\t\t\tArrays.fill(fact, 0);\n\t\t\tinvFact = new long[MAX_FACT];\n\t\t\tArrays.fill(invFact, 0);\n\t\t\tfact[0] = 1;\n\t\t\tint maxIndex = min(MAX_FACT, (int)MOD);\n\t\t\tfor(int i = 1; i < maxIndex; i ++) { fact[i] = mod(fact[i - 1] * i); }\n\t\t\tinvFact[maxIndex - 1] = inv(fact[maxIndex - 1]);\n\t\t\tfor(int i = maxIndex - 1; i > 0; i --) { invFact[i - 1] = mod(invFact[i] * i); }\n\t\t}\n\n\t\tlong P(int n, int r) {\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\treturn mod(fact[n] * invFact[n - r]);\n\t\t}\n\t\tlong C(int n, int r) {\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\treturn mod(P(n, r) * invFact[r]);\n\t\t}\n\t\tlong H(int n, int r) { return C((n - 1) + r, r); }\n\n\n\t\t// grid\n\t\tclass Grid implements Comparable<Grid> {\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tlong val;\n\n\t\t\tGrid() { }\n\t\t\tGrid(int h, int w) {\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t}\n\t\t\tGrid(int h, int w, long val) {\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tthis.val = val;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic int compareTo(Grid g) {\n\t\t\t\treturn Long.compare(this.val, g.val);\n\t\t\t}\n\t\t}\n\n\n\t\t// graph\n\t\tclass Graph {\n\t\t\tint numNode;\n\t\t\tint numEdge;\n\t\t\tboolean directed;\n\t\t\tEdge edges[];\n\t\t\tNode nodes[];\n\t\t\tNode reversedNodes[];\n\n\t\t\tGraph(int numNode, int numEdge, Edge edges[], boolean directed) {\n\t\t\t\tthis.numNode = numNode;\n\t\t\t\tthis.numEdge = numEdge;\n\t\t\t\tthis.directed = directed;\n\t\t\t\tthis.edges = edges;\n\t\t\t\tnodes = new Node[numNode];\n\t\t\t\treversedNodes = new Node[numNode];\n\t\t\t\tfor(int i = 0; i < numNode; i ++) {\n\t\t\t\t\tnodes[i] = new Node(i);\n\t\t\t\t\treversedNodes[i] = new Node(i);\n\t\t\t\t}\n\n\t\t\t\tfor(Edge edge : edges) {\n\t\t\t\t\tnodes[edge.source].add(edge.target, edge.cost);\n\t\t\t\t\tif(directed) {\n\t\t\t\t\t\treversedNodes[edge.target].add(edge.source, edge.cost);\n\t\t\t\t\t}else {\n\t\t\t\t\t\tnodes[edge.target].add(edge.source, edge.cost);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid clearNodes() {\n\t\t\t\tfor(Node n : nodes) { n.clear(); }\n\t\t\t\tfor(Node n : reversedNodes) { n.clear(); }\n\t\t\t}\n\t\t}\n\n\t\tclass Node {\n\t\t\tint id;\n\t\t\tArrayList<Edge> edges = new ArrayList<Edge>();\n\n\t\t\tNode(int id) {\n\t\t\t\tthis.id = id;\n\t\t\t}\n\t\t\tvoid add(int target, long cost) {\n\t\t\t\tedges.add(new Edge(id, target, cost));\n\t\t\t}\n\t\t\tvoid clear() {\n\t\t\t\tedges.clear();\n\t\t\t}\n\t\t}\n\n\t\tclass Edge implements Comparable<Edge> {\n\t\t\tint source;\n\t\t\tint target;\n\t\t\tlong cost;\n\t\t\tEdge(int source, int target, long cost) {\n\t\t\t\tthis.source = source;\n\t\t\t\tthis.target = target;\n\t\t\t\tthis.cost = cost;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic int compareTo(Edge e) {\n\t\t\t\treturn Long.compare(this.cost, e.cost);\n\t\t\t}\n\t\t}\n\npublic void solve() {\n\tint num = ni();\n\tlong a[] = nl(num);\n\tlong ans = INF;\n\tfor(int x = 0; x < 2; x ++) {\n\t\tlong cnt = 0;\n\t\tlong sum = 0;\n\t\tboolean plus = x == 0;\n\t\tfor(int i = 0; i < num; i ++) {\n\t\t\tsum += a[i];\n\t\t\tif(plus) {\n\t\t\t\tif(sum <= 0) { cnt += 1 - sum; sum = 1; }\n\t\t\t}else {\n\t\t\t\tif(sum >= 0) { cnt += sum + 1; sum = -1; }\n\t\t\t}\n\t\t\tplus = !plus;\n\t\t}\n\t\tans = min(ans, cnt);\n\t}\n\tprtln(ans);\n}\n\n\n\n\t}\n}", "\n\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n static StringBuilder sb = new StringBuilder();\n static FastScanner sc = new FastScanner(System.in);\n static int INF = 12345678;\n static long MOD = 1000000007;\n static int[] y4 = {0, 1, 0, -1};\n static int[] x4 = {1, 0, -1, 0};\n static int[] y8 = {0, 1, 0, -1, -1, 1, 1, -1};\n static int[] x8 = {1, 0, -1, 0, 1, -1, 1, -1};\n static long[] F;//factorial\n static boolean[] isPrime;\n static int[] primes;\n static char[][] map;\n\n static int N, M;\n static long T;\n static int[] A;\n\n\n public static void main(String[] args) {\n int n = sc.nextInt();\n\n long[] a = sc.nextLongArray(n);\n\n long ans_1 = 0;//初期値正\n long ans_2 = 0;\n long sum_1 = 0;\n long sum_2 = 0;\n\n for (int i = 0; i < n; i++) {\n\n if(i%2==1){\n if(sum_1 + a[i] >= 0){\n ans_1 += abs(sum_1 + a[i]) + 1;\n sum_1 = -1;\n }else{\n sum_1 += a[i];\n }\n\n\n if(sum_2 + a[i] <= 0){\n ans_2 += abs(sum_2 + a[i]) + 1;\n sum_2 = 1;\n }else{\n sum_2 += a[i];\n }\n\n }else{\n\n if(sum_2 + a[i] >= 0){\n ans_2 += abs(sum_2 + a[i]) + 1;\n sum_2 = -1;\n }else{\n sum_2 += a[i];\n }\n\n\n if(sum_1 + a[i] <= 0){\n ans_1 += abs(sum_1 + a[i]) + 1;\n sum_1 = 1;\n }else{\n sum_1 += a[i];\n }\n\n }\n\n }\n System.out.println(min(ans_1,ans_2));\n\n\n }\n\n static class Dijkstra {\n long initValue = -1;\n Node[] nodes;\n int n;\n long[] d;\n\n Dijkstra(int n) {\n this.n = n;\n nodes = new Node[n];\n for (int i = 0; i < n; i++)\n nodes[i] = new Node(i);\n d = new long[n];\n Arrays.fill(d, initValue);\n }\n\n Dijkstra(int n, int edge, boolean isDirectedGraph) {\n this.n = n;\n\n nodes = new Node[n];\n for (int i = 0; i < n; i++)\n nodes[i] = new Node(i);\n\n d = new long[n];\n Arrays.fill(d, initValue);\n if (isDirectedGraph) {\n for (int ei = 0; ei < edge; ei++) {\n int f = sc.nextInt() - 1;\n int t = sc.nextInt() - 1;\n long c = sc.nextLong();\n addEdge(f, t, c);\n }\n } else {\n for (int ei = 0; ei < edge; ei++) {\n int f = sc.nextInt() - 1;\n int t = sc.nextInt() - 1;\n long c = sc.nextLong();\n addEdge(f, t, c);\n addEdge(t, f, c);\n }\n }\n }\n\n void addEdge(int f, int t, long c) {\n nodes[f].edges.add(new Edge(t, c));\n }\n\n long[] solve(int s) {\n d[s] = 0;\n //最短距離と頂点を持つ\n PriorityQueue<Dis> q = new PriorityQueue<>();\n q.add(new Dis(s, 0));\n while (!q.isEmpty()) {\n Dis now = q.poll();\n int nowId = now.p;\n long nowC = now.cos;\n for (Edge edge : nodes[nowId].edges) {\n int to = edge.toId;\n long needsCost = edge.toCost + nowC;\n if (d[to] == initValue || needsCost < d[to]) {\n d[to] = needsCost;\n q.add(new Dis(to, needsCost));\n }\n }\n }\n return d;\n }\n\n //O( E ^ 2) 辺が密の時用\n long[] solve2(int s) {\n boolean[] used = new boolean[n];\n long[][] cost = new long[n][n];\n Main.fill(cost, initValue);\n Arrays.fill(d, initValue);\n d[s] = 0;\n\n for (Node node : nodes) {\n for (Edge edge : node.edges) {\n int fromId = node.id;\n int toId = edge.toId;\n long toCost = edge.toCost;\n cost[fromId][toId] = toCost;\n }\n }\n while (true) {\n int v = -1;\n //まだ使われていない頂点のうち、距離が最小のものを探す。\n for (int u = 0; u < n; u++)\n if (!used[u] && (v == -1 || d[u] < d[v])) v = u;\n if (v == -1) break;\n used[v] = true;\n for (int u = 0; u < n; u++)\n d[u] = Math.min(d[u], d[v] + cost[v][u]);\n }\n return d;\n }\n\n static class Dis implements Comparable<Dis> {\n //現在地点 最短距離\n int p;\n long cos;\n\n Dis(int p, long cost) {\n this.p = p;\n cos = cost;\n }\n\n public int compareTo(Dis d) {\n if (cos != d.cos) {\n if (cos > d.cos) return 1;\n else if (cos == d.cos) return 0;\n else return -1;\n } else {\n return p - d.p;\n }\n }\n }\n\n static class Node {\n int id;\n List<Edge> edges;\n\n Node(int id) {\n edges = new ArrayList<>();\n this.id = id;\n }\n }\n\n static class Edge {\n int toId;\n long toCost;\n\n Edge(int id, long cost) {\n toId = id;\n toCost = cost;\n }\n\n }\n }\n\n public static long toLong(int[] ar) {\n long res = 0;\n for (int i : ar) {\n res *= 10;\n res += i;\n }\n return res;\n }\n\n public static int toInt(int[] ar) {\n int res = 0;\n for (int i : ar) {\n res *= 10;\n res += i;\n }\n return res;\n }\n\n //k個の次の組み合わせをビットで返す 大きさに上限はない 110110 -> 111001\n public static int nextCombSizeK(int comb, int k) {\n int x = comb & -comb; //最下位の1\n int y = comb + x; //連続した下の1を繰り上がらせる\n return ((comb & ~y) / x >> 1) | y;\n }\n\n public static int keta(long num) {\n int res = 0;\n while (num > 0) {\n num /= 10;\n res++;\n }\n return res;\n }\n\n public static long getHashKey(int a, int b) {\n return (long) a << 32 | b;\n }\n\n public static boolean isOutofIndex(int x, int y) {\n if (x < 0 || y < 0) return true;\n if (map[0].length <= x || map.length <= y) return true;\n return false;\n }\n\n public static void setPrimes() {\n int n = 100001;\n isPrime = new boolean[n];\n List<Integer> prs = new ArrayList<>();\n Arrays.fill(isPrime, true);\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i * i <= n; i++) {\n if (!isPrime[i]) continue;\n prs.add(i);\n for (int j = i * 2; j < n; j += i) {\n isPrime[j] = false;\n }\n }\n primes = new int[prs.size()];\n for (int i = 0; i < prs.size(); i++)\n primes[i] = prs.get(i);\n }\n\n public static void revSort(int[] a) {\n Arrays.sort(a);\n reverse(a);\n }\n\n public static void revSort(long[] a) {\n Arrays.sort(a);\n reverse(a);\n }\n\n public static int[][] copy(int[][] ar) {\n int[][] nr = new int[ar.length][ar[0].length];\n for (int i = 0; i < ar.length; i++)\n for (int j = 0; j < ar[0].length; j++)\n nr[i][j] = ar[i][j];\n return nr;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static int lowerBound(final int[] arr, final int value) {\n int low = 0;\n int high = arr.length;\n int mid;\n\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] < value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static int upperBound(final int[] arr, final int value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] <= value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値がなければ挿入できる最小のインデックス\n */\n public static long lowerBound(final long[] arr, final long value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] < value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値がなければ挿入できる最小のインデックス\n */\n public static long upperBound(final long[] arr, final long value) {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high) {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] <= value) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return low;\n }\n\n //次の順列に書き換える、最大値ならfalseを返す\n public static boolean nextPermutation(int A[]) {\n int len = A.length;\n int pos = len - 2;\n for (; pos >= 0; pos--) {\n if (A[pos] < A[pos + 1]) break;\n }\n if (pos == -1) return false;\n\n //posより大きい最小の数を二分探索\n int ok = pos + 1;\n int ng = len;\n while (Math.abs(ng - ok) > 1) {\n int mid = (ok + ng) / 2;\n if (A[mid] > A[pos]) ok = mid;\n else ng = mid;\n\n }\n\n swap(A, pos, ok);\n reverse(A, pos + 1, len - 1);\n\n\n return true;\n }\n\n //次の順列に書き換える、最小値ならfalseを返す\n public static boolean prevPermutation(int A[]) {\n int len = A.length;\n int pos = len - 2;\n for (; pos >= 0; pos--) {\n if (A[pos] > A[pos + 1]) break;\n }\n if (pos == -1) return false;\n\n //posより小さい最大の数を二分探索\n int ok = pos + 1;\n int ng = len;\n while (Math.abs(ng - ok) > 1) {\n int mid = (ok + ng) / 2;\n if (A[mid] < A[pos]) ok = mid;\n else ng = mid;\n\n }\n\n swap(A, pos, ok);\n reverse(A, pos + 1, len - 1);\n\n\n return true;\n }\n\n //↓nCrをmod計算するために必要。　***factorial(N)を呼ぶ必要がある***\n static long ncr(int n, int r) {\n if (n < r) return 0;\n else if (r == 0) return 1;\n\n factorial(n);\n return F[n] / (F[n - r] * F[r]);\n }\n\n static long ncr2(int a, int b) {\n if (b == 0) return 1;\n else if (a < b) return 0;\n long res = 1;\n for (int i = 0; i < b; i++) {\n res *= a - i;\n res /= i + 1;\n }\n return res;\n }\n\n static long ncrdp(int n, int r) {\n if (n < r) return 0;\n long[][] dp = new long[n + 1][r + 1];\n for (int ni = 0; ni < n + 1; ni++) {\n dp[ni][0] = dp[ni][ni] = 1;\n for (int ri = 1; ri < ni; ri++) {\n dp[ni][ri] = dp[ni - 1][ri - 1] + dp[ni - 1][ri];\n }\n }\n return dp[n][r];\n }\n\n static long modNcr(int n, int r) {\n if (n < r) return 0;\n long result = F[n];\n result = result * modInv(F[n - r]) % MOD;\n result = result * modInv(F[r]) % MOD;\n return result;\n }\n\n public static long modSum(long... lar) {\n long res = 0;\n for (long l : lar)\n res = (res + l % MOD) % MOD;\n return res;\n }\n\n public static long modDiff(long a, long b) {\n long res = a - b;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modMul(long... lar) {\n long res = 1;\n for (long l : lar)\n res = (res * l) % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modDiv(long a, long b) {\n long x = a % MOD;\n long y = b % MOD;\n long res = (x * modInv(y)) % MOD;\n return res;\n }\n\n static long modInv(long n) {\n return modPow(n, MOD - 2);\n }\n\n static void factorial(int n) {\n F = new long[n + 1];\n F[0] = F[1] = 1;\n// for (int i = 2; i <= n; i++)\n// {\n// F[i] = (F[i - 1] * i) % MOD;\n// }\n //\n for (int i = 2; i <= 100000; i++) {\n F[i] = (F[i - 1] * i) % MOD;\n }\n for (int i = 100001; i <= n; i++) {\n F[i] = (F[i - 1] * i) % MOD;\n }\n }\n\n static long modPow(long x, long n) {\n long res = 1L;\n while (n > 0) {\n if ((n & 1) == 1) {\n res = res * x % MOD;\n }\n x = x * x % MOD;\n n >>= 1;\n }\n return res;\n }\n\n //↑nCrをmod計算するために必要\n\n static int gcd(int n, int r) {\n return r == 0 ? n : gcd(r, n % r);\n }\n\n static long gcd(long n, long r) {\n return r == 0 ? n : gcd(r, n % r);\n }\n\n static <T> void swap(T[] x, int i, int j) {\n T t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n static void swap(int[] x, int i, int j) {\n int t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n public static void reverse(int[] x) {\n int l = 0;\n int r = x.length - 1;\n while (l < r) {\n int temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(long[] x) {\n int l = 0;\n int r = x.length - 1;\n while (l < r) {\n long temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(int[] x, int s, int e) {\n int l = s;\n int r = e;\n while (l < r) {\n int temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n static int length(int a) {\n int cou = 0;\n while (a != 0) {\n a /= 10;\n cou++;\n }\n return cou;\n }\n\n static int length(long a) {\n int cou = 0;\n while (a != 0) {\n a /= 10;\n cou++;\n }\n return cou;\n }\n\n static int cou(boolean[] a) {\n int res = 0;\n for (boolean b : a) {\n if (b) res++;\n }\n return res;\n }\n\n static int cou(String s, char c) {\n int res = 0;\n for (char ci : s.toCharArray()) {\n if (ci == c) res++;\n }\n return res;\n }\n\n static int countC2(char[][] a, char c) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n if (a[i][j] == c) co++;\n return co;\n }\n\n static int countI(int[] a, int key) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n if (a[i] == key) co++;\n return co;\n }\n\n static int countI(int[][] a, int key) {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n if (a[i][j] == key) co++;\n return co;\n }\n\n static void fill(int[][] a, int v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = v;\n }\n\n\n static void fill(long[][] a, long v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = v;\n }\n\n static void fill(int[][][] a, int v) {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n for (int k = 0; k < a[0][0].length; k++)\n a[i][j][k] = v;\n }\n\n static int max(int... a) {\n int res = Integer.MIN_VALUE;\n for (int i : a) {\n res = Math.max(res, i);\n }\n return res;\n }\n\n static long max(long... a) {\n long res = Long.MIN_VALUE;\n for (long i : a) {\n res = Math.max(res, i);\n }\n return res;\n }\n\n\n static int max(int[][] ar) {\n int res = Integer.MIN_VALUE;\n for (int i[] : ar)\n res = Math.max(res, max(i));\n return res;\n }\n\n static int min(int... a) {\n int res = Integer.MAX_VALUE;\n for (int i : a) {\n res = Math.min(res, i);\n }\n return res;\n }\n\n static long min(long... a) {\n long res = Long.MAX_VALUE;\n for (long i : a) {\n res = Math.min(res, i);\n }\n return res;\n }\n\n static int min(int[][] ar) {\n int res = Integer.MAX_VALUE;\n for (int i[] : ar)\n res = Math.min(res, min(i));\n return res;\n }\n\n static int sum(int[] a) {\n int cou = 0;\n for (int i : a)\n cou += i;\n return cou;\n }\n\n static int abs(int a) {\n return Math.abs(a);\n }\n\n\n static long abs(long a) {\n return Math.abs(a);\n }\n\n static class FastScanner {\n\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n /*public String nextChar(){\n return (char)next()[0];\n }*/\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n public int[] nextIntArrayDec(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt() - 1;\n }\n return a;\n }\n\n public int[][] nextIntArray2(int h, int w) {\n int[][] a = new int[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = nextInt();\n }\n }\n return a;\n }\n\n public int[][] nextIntArray2Dec(int h, int w) {\n int[][] a = new int[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = nextInt() - 1;\n }\n }\n return a;\n }\n\n //複数の配列を受け取る\n public void nextIntArrays2ar(int[] a, int[] b) {\n for (int i = 0; i < a.length; i++) {\n a[i] = sc.nextInt();\n b[i] = sc.nextInt();\n }\n }\n\n public void nextIntArrays2arDec(int[] a, int[] b) {\n for (int i = 0; i < a.length; i++) {\n a[i] = sc.nextInt() - 1;\n b[i] = sc.nextInt() - 1;\n }\n }\n\n //複数の配列を受け取る\n public void nextIntArrays3ar(int[] a, int[] b, int[] c) {\n for (int i = 0; i < a.length; i++) {\n a[i] = sc.nextInt();\n b[i] = sc.nextInt();\n c[i] = sc.nextInt();\n }\n }\n\n //複数の配列を受け取る\n public void nextIntArrays3arDecLeft2(int[] a, int[] b, int[] c) {\n for (int i = 0; i < a.length; i++) {\n a[i] = sc.nextInt() - 1;\n b[i] = sc.nextInt() - 1;\n c[i] = sc.nextInt();\n }\n }\n\n public Integer[] nextIntegerArray(int n) {\n Integer[] a = new Integer[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n public char[] nextCharArray(int n) {\n char[] a = next().toCharArray();\n\n return a;\n }\n\n public char[][] nextCharArray2(int h, int w) {\n char[][] a = new char[h][w];\n for (int i = 0; i < h; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n //スペースが入っている場合\n public char[][] nextCharArray2s(int h, int w) {\n char[][] a = new char[h][w];\n for (int i = 0; i < h; i++) {\n a[i] = nextLine().replace(\" \", \"\").toCharArray();\n }\n return a;\n }\n\n public char[][] nextWrapCharArray2(int h, int w, char c) {\n char[][] a = new char[h + 2][w + 2];\n //char c = '*';\n int i;\n for (i = 0; i < w + 2; i++)\n a[0][i] = c;\n for (i = 1; i < h + 1; i++) {\n a[i] = (c + next() + c).toCharArray();\n }\n for (i = 0; i < w + 2; i++)\n a[h + 1][i] = c;\n return a;\n }\n\n //スペースが入ってる時用\n public char[][] nextWrapCharArray2s(int h, int w, char c) {\n char[][] a = new char[h + 2][w + 2];\n //char c = '*';\n int i;\n for (i = 0; i < w + 2; i++)\n a[0][i] = c;\n for (i = 1; i < h + 1; i++) {\n a[i] = (c + nextLine().replace(\" \", \"\") + c).toCharArray();\n }\n for (i = 0; i < w + 2; i++)\n a[h + 1][i] = c;\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n public long[][] nextLongArray2(int h, int w) {\n long[][] a = new long[h][w];\n for (int hi = 0; hi < h; hi++) {\n for (int wi = 0; wi < w; wi++) {\n a[hi][wi] = nextLong();\n }\n }\n return a;\n }\n }\n}\n", "def re(k1,l,s):\n r=0\n for i in range(0,n):\n if s==1:\n s=0\n k1+=l[i]\n if k1>=0:\n r+=k1+1\n k1=-1\n continue\n if s==0:\n s=1\n k1+=l[i]\n if k1<=0:\n r+=abs(k1)+1\n k1=1\n return r\n\nn=int(input())\nl=list(map(int,input().split()))\nans=0\n\nk1=0\n\nans=min(re(k1,l,1),re(k1,l,0))\n\n\n\nprint(ans)", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int[] A = new int[N + 1];\n A[0] = 0;\n for (int i= 1; i <= N; ++i) {\n A[i] = sc.nextInt();\n }\n sc.close();\n\n long sum1 = 0;\n long sum2 = 0;\n long ans1 = 0;\n long ans2 = 0;\n for (int i= 1; i <= N; ++i) {\n sum1 += A[i]; \n if (i % 2 == 0 && sum1 >= 0) {\n ans1 += Math.abs(sum1) +1;\n sum1 = -1;\n } else if (i % 2 != 0 && sum1 <= 0) {\n ans1 += Math.abs(sum1) + 1;\n sum1 = 1;\n }\n }\n for (int i= 1; i <= N; ++i) {\n sum2 += A[i]; \n if (i % 2 == 0 && sum2 <= 0) {\n ans2 += Math.abs(sum2) +1;\n sum2 = 1;\n } else if (i % 2 != 0 && sum2 >= 0) {\n ans2 += Math.abs(sum2) + 1;\n sum2 = -1;\n }\n }\n System.out.println(Math.min(ans1, ans2));\n }\n}\n", "import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n static int n;\n static long[] a;\n\n static final boolean DEBUG = false;\n\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n n = sc.nextInt();\n a = new long[n];\n for(int i = 0; i < n; i++){\n a[i] = sc.nextInt();\n }\n\n long count = 0, count2 = 0;\n long sum = a[0];\n long sum2 = a[0] < 0 ? 1 : -1;\n count2 = Math.abs(sum2 - a[0]);\n\n if(a[0] == 0){\n sum = 1;\n count = count2 = 1;\n sum2 = -1;\n }\n\n for(int i = 1; i < n; i++){\n long val = a[i], val2 = a[i];\n if(!((sum > 0 && sum + a[i] < 0) || \n (sum < 0 && sum + a[i] > 0))){\n val = -sum + ((sum < 0) ? 1 : -1);\n count += Math.abs(val - a[i]);\n }\n if(!((sum2 > 0 && sum2 + a[i] < 0) || \n (sum2 < 0 && sum2 + a[i] > 0))){\n val2 = -sum2 + ((sum2 < 0) ? 1 : -1);\n count2 += Math.abs(val2 - a[i]);\n }\n sum += val;\n sum2 += val2;\n }\n\n if(DEBUG){\n System.out.println(Arrays.toString(a));\n }\n\n System.out.println(Math.min(count, count2));\n }\n}\n", "//package AtCoder.Indeed10;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringTokenizer;\n\npublic class Main {\n public static void main(String[] args) {\n int n = in.NI();\n List<Long> q = new ArrayList<>(n);\n for (int i=0;i<n;i++) q.add(in.NL());\n\n long fans = Long.MAX_VALUE;\n\n long sign = 1; long presum = 0;\n long ans = func(n, q, sign, presum);\n\n fans = Long.min(fans, ans);\n\n sign = -1; presum = 0;\n ans = func(n, q, sign, presum);\n\n fans = Long.min(fans, ans);\n\n out.println(fans);\n out.close();\n }\n\n private static long func(final int n, final List<Long> q, long sign, long presum) {\n long ans =0;\n for (int i=0;i<n;i++) {\n presum+=q.get(i);\n if (presum*sign > 0) { sign = sign*-1L; continue; }\n if (presum==0) {\n if (sign==1) {ans++; presum++;}\n else {ans++; presum--;}\n } else if (presum>0) {\n ans += (1+presum);\n presum = -1;\n } else {\n ans += (1-presum);\n presum = 1;\n }\n sign = sign * -1L;\n }\n return ans;\n }\n\n static InputStream inputStream = System.in;\n static OutputStream outputStream = System.out;\n static InputReader in = new InputReader(inputStream);\n static PrintWriter out = new PrintWriter(outputStream);\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int NI() {\n return Integer.parseInt(next());\n }\n\n public long NL() {\n return Long.parseLong(next());\n }\n\n }\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.Character.Subset;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.temporal.ValueRange;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Objects;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Solver solver = new Solver(in, out);\n solver.solve();\n\n out.close();\n }\n\n // ======================================================================\n static class Solver {\n \tMyInput in;\n \tPrintWriter out;\n public Solver(MyInput in, PrintWriter out) {\n \tthis.in = in;\n \tthis.out = out;\n }\n \n // ======================================================================\n public void solve() {\n \tint N = ni();\n \tlong a, sum_P = 0, sum_M=0, cnt_P = 0, cnt_M = 0;;\n \tfor (int i = 0; i < N; i++) {\n\t\t\t\ta = nl();\n\t\t\t\tif(i % 2 == 0) {\n\t\t\t\t\tsum_P += a;\n\t\t\t\t\tif(sum_P <= 0) {\n\t\t\t\t\t\tcnt_P += (-sum_P + 1);\n\t\t\t\t\t\tsum_P = 1;\n\t\t\t\t\t}\n\t\t\t\t\tsum_M += a;\n\t\t\t\t\tif(sum_M >= 0) {\n\t\t\t\t\t\tcnt_M += (sum_M + 1);\n\t\t\t\t\t\tsum_M = -1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tsum_P += a;\n\t\t\t\t\tif(sum_P >= 0) {\n\t\t\t\t\t\tcnt_P += (sum_P + 1);\n\t\t\t\t\t\tsum_P = -1;\n\t\t\t\t\t}\n\t\t\t\t\tsum_M += a;\n\t\t\t\t\tif(sum_M <= 0) {\n\t\t\t\t\t\tcnt_M += (-sum_M + 1);\n\t\t\t\t\t\tsum_M = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n \tcnt_P += (sum_P == 0 ? 1 : 0);\n \tcnt_M += (sum_M == 0 ? 1 : 0);\n \tprn(Math.min(cnt_P, cnt_M));\n }\n // -----------------------------------------\n // Integer のキーに対して、カウントを管理する（カウントを足したり、引いたりする）\n static class MapCounter {\n \tprivate Map<Integer, Long> map = new HashMap<>();\n \tpublic MapCounter() {}\n \t// キーのカウントに値を足す\n \tpublic void add(int key) {\n \t\tadd(key, 1);\n \t}\n \tpublic void add(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)cnt);\n \t\t} else {\n \t\t\tmap.put(key, val + cnt);\n \t\t}\n \t}\n \t// キーのカウントから値を引く\n \tpublic void sub(int key) {\n \t\tsub(key, 1);\n \t}\n \tpublic void sub(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)-cnt);\n \t\t} else {\n \t\t\tmap.put(key, val - cnt);\n \t\t}\n \t}\n \t// キーのカウントを取得する（なければ　ＮＵＬＬを返す）\n \tpublic Long getCountwithNull(int key) {\n \t\treturn map.get(key);\n \t}\n \t// キーのカウントを取得する（なければ　０　を返す）\n \tpublic Long getCount(int key) {\n \t\tLong val = map.get(key);\n \t\tif(val == null)\t\treturn 0L;\n \t\telse \t\t\t\treturn val;\n \t}\n \tpublic Set<Integer> getKey() {\n \t\treturn map.keySet();\n \t}\n \t// 登録されているキーの数を返す\n \tpublic int getKeyCount() {\n \t\treturn map.keySet().size();\n \t}\n }\n // -----------------------------------------\n // 配列のバイナリーサーチ　１\n boolean isRightMin(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] >= key)\t\treturn true;\t\t// 以上\n \t else if (!f && a[index] > key)\treturn true;\t\t// より大きい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以上（f=true)または、より大きく（f=false)、一番小さい値を返す\n \tint binarySearchRightMin(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isRightMin(a, f, mid, key))\tok = mid;\t// 下半分を対象とする\n \t else \t\t\t\t\t\t\tng = mid;\t// 上半分を対象とする\n \t }\t\n \t return ok;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n // -----------------------------------------\n // 配列のバイナリーサーチ　２\n boolean isLeftMax(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] <= key)\t\treturn true;\t\t// 以下\n \t else if (!f && a[index] < key)\treturn true;\t\t// より小さい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以下（f=true)または、より小さい（f=false)、一番大きい値を返す\n \tint binarySearchLeftMax(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isLeftMax(a, f, mid, key))\tng = mid;\t// 上半分を対象とする\n \t else \t\t\t\t\t\t\tok = mid;\t// 下半分を対象とする\n \t }\t\n \t return ng;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n \t\n // -----------------------------------------\n \t// オイラーツアー（部分木対応）\n \tstatic class EulerTour {\n \t\tGraph g;\n \t\tList<Integer> euler_tour = new ArrayList<>();\n \t\tint[] begin, end;\n \t\tint k = 0, root = 0;\n \t\t\n \t\tvoid dfs(int v,int p, PrintWriter out) {\n \t\t\tout.println(\"v = \" + v + \" p = \" + p);\n \t\t\tbegin[v] = k;\n \t\t\teuler_tour.add(v);\n \t\t\tk++;\n \t\t\tif(!g.contains(v)) {\n \t\t\t\treturn;\n \t\t\t}\n \t\t\tfor(int i : g.get(v)) {\n \t\t\t\tif(i != p) {\n \t\t\t\t\tdfs(i, v, out);\n \t\t\t\t\teuler_tour.add(v);\n \t\t\t\t\tk++;\n \t\t\t\t}\n \t\t\t}\n \t\t\tend[v]=k;\n \t\t}\n \t\t// 初期化\n \t\tpublic void init(int p_cnt, int root, Graph g, PrintWriter out) {\n \t\t\tbegin = new int[p_cnt + 1];\n \t\t\tend = new int[p_cnt + 1];\n \t\t\tthis.root = root;\n \t\t\tthis.g = g;\n \t\t\tdfs(root, -1, out);\n \t\t}\n \t\t// 部分木の頂点を渡すと、オイラーツアーの部分木を返す\n \t\tpublic List getPartTour(int v) {\n \t\t\treturn euler_tour.subList(begin[v], end[v]);\n \t\t}\n \t\t// 部分木の頂点を渡すと、頂点のリストを返す\n \t\tpublic List<Integer> getPartList(int v) {\n \t\t\tSet<Integer> set = new TreeSet<>();\n\t\t\t\tset.addAll(getPartTour(v));\n\t\t\t\tList<Integer> ans = new ArrayList<>();\n\t\t\t\tfor(Integer p : set) {\n\t\t\t\t\tans.add(p);\n\t\t\t\t}\n\t\t\t\treturn ans;\n \t\t}\n \t}\n \t\n // -----------------------------------------\n // グラフのリンクリスト\n static class Graph {\n \t// 頂点に紐づく頂点のリスト\n private Map<Integer, List<Integer>> data = new HashMap<Integer, List<Integer>>();\n// // 全ての頂点のセット\n// private Set<Integer> point = new TreeSet<>();\n // 頂点と頂点の繋がりを追加する\n void add(int key, int value) {\n \tList<Integer> list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList<Integer>();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(value);\n// \tpoint.add(key);\n// \tpoint.add(value);\n }\n // 指定された頂点に紐づく、頂点のリストを返す\n List<Integer> get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set<Integer> keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList<Integer> list = data.get(key_1);\n \tif(list == null)\treturn false;\n \telse \t\t\t\treturn list.contains(key_2);\n }\n // 指定された頂点から、すべての頂点への距離を返す\n List<PP> distList(int key) {\n \tList<PP> dist = new ArrayList<>();\t\t// 頂点と距離のペアのリスト\n \tSet<Integer> mark = new HashSet<>();\t// 処理したら入れる\n \t\t\tStack<PP> stack = new Stack<>();\t\t// スタックの宣言\n \t\t\tstack.push(new PP(key, 0));\t\t\t\t// スタートをスタックに保存\n \t\t\twhile(!stack.isEmpty()) {\n \t\t\t\tPP wk = stack.pop();\t\t\t\t// スタックから次の頂点を取得\n \t\t\t\tint pp = wk.getKey();\n \t\t\t\tint dd = wk.getVal();\n \t\t\t\tmark.add(pp);\t\t\t\t\t\t// 通過マーク\n \t\t\tdist.add(new PP(pp, dd));\t\t\t// 距離を登録\n \t\t\t\tList<Integer> list = get(pp);\t\t// つながっている頂点のリストを取得\n \t\t\t\tfor(int next : list) {\n \t\t\t\t\tif(mark.contains(next))\tcontinue;\n \t\t\t\t\tstack.push(new PP(next, dd + 1));\n \t\t\t\t}\n \t\t\t}\n \t\t\treturn dist;\n }\n // ダンプ\n void dump(PrintWriter out) {\n \tfor(int key : data.keySet()) {\n \t\tout.print(key + \" : \");\n \t\tfor(int val : data.get(key)) {\n \t\t\tout.print(val + \" \");\n \t\t}\n \t\tout.println(\"\");\n \t}\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト\n static class GraphWith {\n \t// キーに紐づくリストに、頂点番号と重さのペアを持つ\n private Map<Integer, List<PP>> data = new HashMap<Integer, List<PP>>();\n // 指定された頂点に紐づく、頂点と重さのペアを追加する\n void add(int key, PP p) {\n \tList<PP> list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList<PP>();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(p);\n }\n // 頂点に紐づく、頂点と重さのペアのリストを返す\n List<PP> get(int key) {\n \treturn data.get(key);\n }\n // グラフの存在チェック（重さは関係しない）\n // 頂点　key と 頂点　value がつながっていれば　true を返す\n boolean contains(int key, int value) {\n \tList<PP> list = data.get(key);\n \tif(list == null)\treturn false;\n \tboolean ans = false;\n \tfor(PP p : list) {\n \t\tif(p.getKey() == value) {\n \t\t\tans = true;\n \t\t\tbreak;\n \t\t}\n \t}\n \treturn ans;\n }\n }\n // -----------------------------------------\n // グラフのリンクリスト(Long)\n static class GraphLong {\n private Map<Long, List<Long>> G = new HashMap<Long, List<Long>>();\n void add(long key, long value) {\n \tList<Long> list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList<Long>();\n \t\tG.put(key, list);\n \t}\n \tlist.add(value);\n }\n List<Long> get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト(Long)\n static class GraphLongWith {\n private Map<Long, List<PPL>> G = new HashMap<Long, List<PPL>>();\n void add(long key, PPL p) {\n \tList<PPL> list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList<PPL>();\n \t\tG.put(key, list);\n \t}\n \tlist.add(p);\n }\n List<PPL> get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n\n void prn(String s) {\n \tout.println(s);\n }\n void prn(int i) {\n \tout.println(i);\n }\n void prn(long i) {\n \tout.println(i);\n }\n void prr(String s) {\n \tout.print(s);\n }\n int ni() {\n \treturn in.nextInt();\n }\n long nl() {\n \treturn in.nextLong();\n }\n double nd() {\n \treturn in.nextDouble();\n }\n String ns() {\n \treturn in.nextString();\n }\n int[] ndi(int n) {\n \tint[] ans = new int[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ni();\n \t}\n \treturn ans;\n }\n long[] ndl(int n) {\n \tlong[] ans = new long[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nl();\n \t}\n \treturn ans;\n }\n double[] ndd(int n) {\n \tdouble[] ans = new double[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nd();\n \t}\n \treturn ans;\n }\n String[] nds(int n) {\n \tString[] ans = new String[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ns();\n \t}\n \treturn ans;\n }\n int[][] nddi(int n, int m) {\n \tint[][] ans = new int[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = ni();\n \t}\n \t}\n \treturn ans;\n }\n long[][] nddl(int n, int m) {\n \tlong[][] ans = new long[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = nl();\n \t}\n \t}\n \treturn ans;\n }\n }\n static class PP{\n \tpublic int key, val;\n \tpublic PP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPL {\n \tpublic long key, val;\n \tpublic PPL(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPDL {\n \tpublic long key;\n \tpublic long[] val;\n \tpublic PPDL(long key, long[] val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long[] getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long[] val) {\n\t\t\tthis.val = val;\n\t\t}\n\t\tpublic void dump(PrintWriter out) {\n\t\t\tout.print(\"key = \" + key + \" val \");\n\t\t\tfor(int i=0; i < val.length; i++) {\n\t\t\t\tout.print(\"[\" + val[i] + \"] \");\n\t\t\t}\n\t\t\tout.println(\"\");\n\t\t}\n }\n // HashMap のキーに使う\n static final class PPKEY{\n \tprivate final int key, val;\n \tpublic PPKEY(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // HashMap のキーに使う\n static final class PPLKEY{\n \tprivate final long key, val;\n \tpublic PPLKEY(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // ======================================================================\n static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n }\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public double nextDouble() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n double ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n int cnt = 0;\n for (; i < len; i++) {\n \tif(str[i] == '.') {\n \t\tcnt = 10;\n \t\tcontinue;\n \t}\n \tif(cnt == 0) {\n \t\tret = ret * 10 + str[i] - '0';\n \t} else {\n \t\tret = ret + ((double)(str[i] - '0') / cnt);\n \t\tcnt *= 10;\n \t}\n }\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n\n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n int n; cin >> n;\n int a[n+1];\n for(int i=1; i<=n; i++) cin >> a[i];\n\n ll p1=0, p2=0, sum1=0, sum2=0;\n for(int i=1; i<=n; i++){\n sum1 += a[i]; sum2 += a[i];\n if(i%2){\n p1 += max(-sum1+1, 1LL*0); sum1 = max(1LL, sum1);\n p2 += max(sum2+1, 1LL*0); sum2 = min(-1LL, sum2);\n }\n else{\n p1 += max(sum1+1, 1LL*0); sum1 = min(-1LL, sum1);\n p2 += max(-sum2+1, 1LL*0); sum2 = max(1LL, sum2);\n }\n }\n\n cout << min(p1, p2) << endl;\n\n return 0;\n}\n", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n ll a[n], sum, res1 = 0, res2 = 0;\n for(int i = 0; i < n; i++) cin >> a[i];\n // odd is -\n sum = 0;\n for(int i = 0; i < n; i++){\n sum += a[i];\n if(i % 2){\n if(sum >= 0) res1 += 1 + sum, sum = -1; \n }else{\n if(sum <= 0) res1 += 1 - sum, sum = 1;\n }\n }\n // odd is +\n sum = 0;\n for(int i = 0; i < n; i++){\n sum += a[i];\n if(i % 2){\n if(sum <= 0) res2 += 1 - sum, sum = 1; \n }else{\n if(sum >= 0) res2 += 1 + sum, sum = -1;\n }\n }\n cout << min(res1, res2) << endl;\n return 0;\n}\n", "n = int(input())\narr = list(map(int , input().split()))\ncur = 0\na = 0\nb = 0\nprea=0\npreb=0\nresa = 0\nresb =0\nfor i in range(0 , n):\n\tprea = prea+arr[i]\n\tif (i% 2 ==0 and prea<=0):\n\t\tresa = resa-prea+1\n\t\tprea=1\n\tif i%2 ==1 and prea>=0:\n\t\tresa = resa+prea+1\n\t\tprea=-1\nfor i in range(0 , n):\n\tpreb = preb+arr[i]\n\tif (i%2==1 and preb<=0):\n\t\tresb = resb+(-preb+1)\n\t\tpreb=1\n\tif i%2 ==0 and preb>=0:\n\t\tresb =resb+ preb+1\n\t\tpreb=-1\nprint(min(resa , resb))", "import java.util.Scanner;\n\npublic class Main {\n\n\tvoid run() {\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\t\tint n = sc.nextInt();\n\t\t\tint[] a = new int[n];\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\ta[i] = sc.nextInt();\n\t\t\t}\n\t\t\t\n\t\t\tlong sum1 = 0;\n\t\t\tlong cnt1 = 0;\n\t\t\t// a[0] > 0\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\tsum1 += a[i];\n\t\t\t\tif(i%2==0 && sum1 <= 0) {\n\t\t\t\t\tcnt1 += (1-sum1);\n\t\t\t\t\tsum1 = 1;\n\t\t\t\t}else if(i%2==1 && sum1 >= 0) {\n\t\t\t\t\tcnt1 += (1+sum1);\n\t\t\t\t\tsum1 = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tlong sum2 = 0;\n\t\t\tlong cnt2 = 0;\n\t\t\t// a[0] < 0\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\tsum2 += a[i];\n\t\t\t\tif(i%2==1 && sum2 <= 0) {\n\t\t\t\t\tcnt2 += (1-sum2);\n\t\t\t\t\tsum2 = 1;\n\t\t\t\t}else if(i%2==0 && sum2 >= 0) {\n\t\t\t\t\tcnt2 += (1+sum2);\n\t\t\t\t\tsum2 = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tSystem.out.println(Math.min(cnt1, cnt2));\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\t\n}\n", "n = int(input())\nA = list(map(int, input().split()))\n\nans = 1e16\nfor s in (1, -1):\n res, acc = 0, 0\n for a in A:\n acc += a\n if acc * s <= 0:\n res += abs(acc-s)\n acc = s\n s *= -1\n ans = min(ans, res)\n\nprint(ans)\n", "#include<bits/stdc++.h>\n#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)\n#define rep(i,a,b) for(int i=int(a);i<int(b);++i)\nusing namespace std;\n \nsigned main(){\n int N;cin>>N;\n vector<long long> A(N);\n REP(i, N) cin >> A[i];\n long long ans=LLONG_MAX;\n int sig[2]={1,-1};\n REP(j,2){ \n long long sum=0;\n long long count=0;\n REP(i,N){\n sum+=A[i];\n if(sig[(i^j)&1]*sum>=0){\n count+=llabs(sum)+1;\n sum=-sig[(i^j)&1];\n }\n }\n ans=min(ans,count);\n }\n cout<<ans<<endl;\n}", "n = int(input())\na = list(map(int,input().split()))\nans=10**15\nfor i in [1,-1]:\n b=0\n c=0\n for j in a:\n b+=j\n if b*i<=0:\n c+=abs(b-i)\n b=i\n i*=-1\n ans=min(ans,c)\nprint(ans)", "import java.util.*;\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n for(int i = 0; i<n; i++) {\n a[i] = sc.nextInt();\n }\n long min = Long.MAX_VALUE;\n long tmp = 0;\n long cnt = 0;\n for(int i = 0; i<n; i++) {\n tmp+=a[i];\n System.err.println(i+\" \"+tmp);\n if(i%2==0) {\n if(tmp<=0) {\n cnt += 1 - tmp;\n tmp = 1;\n }\n }else {\n if(tmp>=0) {\n cnt += tmp + 1;\n tmp = -1;\n }\n }\n }\n min = cnt;\n cnt = 0;\n tmp = 0;\n System.err.println(min);\n for(int i = 0; i<n; i++) {\n tmp+=a[i];\n if(i%2==1) {\n if(tmp<=0) {\n cnt += 1 - tmp;\n tmp = 1;\n }\n }else {\n if(tmp>=0) {\n cnt += tmp + 1;\n tmp = -1;\n }\n }\n }\n min = Math.min(min, cnt);\n System.out.println(min);\n }\n}\n", "N = int(input())\na = list(map(int, input().split()))\ntotal = 0\n\nvalues = []\nfor s in (1, -1):\n xs = a[::]\n signs = [s * (-1) ** i for i in range(N)]\n total = 0\n for i in range(N):\n if (total + xs[i]) * signs[i] <= 0:\n xs[i] = signs[i] - total\n total += xs[i]\n values.append(sum(abs(a[i] - xs[i]) for i in range(N)))\nprint(min(values))", "N = int(input())\nA = tuple(map(int,input().split()))\n\ndef solve(f):\n acc = 0\n cnt = 0\n for a in A:\n acc += a\n if f and acc <= 0:\n cnt += 1 - acc\n acc = 1\n elif not f and acc >= 0:\n cnt += acc + 1\n acc = -1\n f = not f\n return cnt\n\nprint(min(solve(True),solve(False)))", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main(){\n int n;\n cin>>n;\n vector<int> A(n);\n for(int &i:A)\n cin>>i;\n int j,k,l=100000000000000000;\n for(int a=0;a<2;a++){\n k=0,j=0;\n for(int i=0;i<n;i++){\n k+=A[i];\n if(((i+a)%2*2-1)*k<=0){\n j+=1+abs(k);\n k=(i+a)%2*2-1;\n }\n }\n l=min(l,j);\n }\n cout<<l<<endl;\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main (String[] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n int[] a = new int[n];\n\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n\n sc.close();\n\n // +-+-+...の場合\n long sum1 = 0;\n long count1 = 0;\n\n for (int i = 0; i < n; i++) {\n \n sum1 += a[i];\n\n if (i % 2 == 0) {\n if (sum1 <= 0) {\n count1 += (1 - sum1);\n sum1 = 1;\n }\n } else {\n if (0 <= sum1) {\n count1 += (sum1 + 1);\n sum1 = -1;\n }\n }\n\n }\n\n // -+-+_...の場合\n long sum2 = 0;\n long count2 = 0;\n\n for (int i = 0; i < n; i++) {\n \n sum2 += a[i];\n\n if (i % 2 == 0) {\n if (0 <= sum2) {\n count2 += (sum2 + 1);\n sum2 = -1;\n }\n } else {\n if (sum2 <= 0) {\n count2 += (1 - sum2);\n sum2 = 1;\n }\n }\n\n }\n\n System.out.println(Math.min(count1, count2));\n\n }\n\n}", "#include <iostream>\n#define REP(i, n) for (int i = 0; i < n; ++i)\nusing namespace std;\nusing ll = long long;\n\nll sum1,sum2,cost1,cost2;\nint main() {\n\tint n; cin >> n;\n\tREP(i,n) {\n int cur; cin >> cur;\n\t\tsum1 += cur, sum2 += cur;\n\t\tif (i&1) {\n\t\t\tif (sum1<=0) cost1 += 1-sum1, sum1 = 1;\n\t\t\tif (sum2>=0) cost2 += sum2+1, sum2 = -1;\n\t\t} else {\n\t\t\tif (sum1>=0) cost1 += sum1+1, sum1 = -1;\n\t\t\tif (sum2<=0) cost2 += 1-sum2, sum2 = 1;\n\t\t}\n\t}\n\tcout << min(cost1, cost2) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n cin>>n;\n long long int a[n],sum1=0,sum2=0,cost1=0,cost2=0;\n for(int i=0;i<n;i++){\n cin>>a[i];\n sum1+=a[i];\n sum2+=a[i];\n if(i%2==0 && sum1>=0){\n cost1+=1+sum1;\n sum1=-1;\n }\n else if(i%2==1 && sum1<=0){\n cost1+=1-sum1;\n sum1=1;\n }\n if(i%2==0 && sum2<=0){\n cost2+=1-sum2;\n sum2=1;\n }\n else if(i%2==1 && sum2>=0){\n cost2+=1+sum2;\n sum2=-1;\n }\n }\n cout<<min(cost1,cost2);\n \n \n \n \n \n \n}", "n = int(input())\na = [int(x) for x in input().split()]\n\n\ndef check(a, t):\n ans = 0\n x = 0\n for i in a:\n x += i\n if t == True and x < 1:\n ans += 1 - x\n x = 1\n elif t == False and x > -1:\n ans += x + 1\n x = -1\n t = not t\n return ans\n\n\nprint(min(check(a, True), check(a, False)))\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector<int> V(N);\n for (int i = 0, a, sum = 0; i < N && cin >> a; i++)\n V.at(i) = sum += a;\n\n long long cnt1 = 0;\n for (int i = 0, j = 0; i < N; i++) {\n int tmp = V.at(i) + j;\n if (!(i % 2) && tmp >= 0) cnt1 += abs(-1 - tmp), j += -1 - tmp;\n if (i % 2 && tmp <= 0) cnt1 += 1 - tmp, j += 1 - tmp;\n }\n\n long long cnt2 = 0;\n for (int i = 0, j = 0; i < N; i++) {\n int tmp = V.at(i) + j;\n if (i % 2 && tmp >= 0) cnt2 += abs(-1 - tmp), j += -1 - tmp;\n if (!(i % 2) && tmp <= 0) cnt2 += 1 - tmp, j += 1 - tmp;\n }\n\n cout << min(cnt1, cnt2) << \"\\n\";\n}", "n = int(input())\na = list(map(int,input().split()))\ntrueans = float('inf')\nfor k in [-1,1]:\n sign = k\n ans = 0\n s = 0\n for i in range(n):\n s += a[i]\n if s == 0:\n s = sign\n ans += 1\n elif s//abs(s) == sign:\n pass\n else:\n ans += abs(sign-s)\n s = sign\n sign *= -1\n trueans = min(ans,trueans)\nprint(trueans)\n", "#include <cstdio>\n#include <algorithm>\n\n#define maxn 100000\n#define ll long long\n\nint a[maxn];\n\nll det(int n, int a[], int l) {\n int sum = 0;\n ll rez = 0;\n for (int i = 1; i <= n; i++, l = 1 - l) {\n sum += a[i];\n if (l == 0 && sum <= 0) {\n rez += 1 - sum;\n sum = 1;\n }\n else if (l == 1 && sum >= 0) {\n rez += 1 + sum;\n sum = -1;\n }\n }\n return rez;\n}\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n for (int i = 1; i <= n; i++)\n scanf(\"%d\", &a[i]);\n ll c1 = det(n, a, 0);\n ll c2 = det(n, a, 1);\n ll rez = std::min(c1, c2);\n printf(\"%lld\", rez);\n return 0;\n}\n", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); ++i)\ntypedef long long ll;\nusing namespace std;\nint n, a[100010];\nll calc(ll s) {\n ll sum = 0, res = 0;\n for (int i = 0; i < n; ++i, s *= -1) {\n sum += a[i];\n if (sum * s > 0) continue;\n res += abs(sum - s);\n sum += s * abs(sum - s);\n }\n return res;\n}\nint main() {\n cin >> n;\n rep(i, n) cin >> a[i];\n cout << min(calc(1), calc(-1)) << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int>pa;\n\nconst int N=2e5+100;\nconst int mod=1e9+7;\nll a[N];\nint n;\nll slove(ll f)\n{\n ll sum=0,ans=0;\n for(int i=1;i<=n;i++){\n sum+=a[i];\n if(sum*f<=0) {\n ans+=abs(f-sum);\n sum=f;\n }\n f=-f;\n }\n return ans;\n}\nint main()\n{\n ios::sync_with_stdio(0);cin.tie(0);\n cin>>n;\n for(int i=1;i<=n;i++){\n cin>>a[i];\n }\n ll ans=min(slove(1),slove(-1));\n cout<<ans<<endl;\n return 0;\n}\n\n", "#include <iostream>\n\nint a[1000005];\nint n;\n\nlong long calc(int mod){\n long long sum = 0, res = 0;\n for (int i = 0; i < n; i++){\n sum += a[i];\n if (i%2 == mod && sum <= 0) {\n res += 1-sum;\n sum = 1;\n }\n else if (i%2 != mod && sum >= 0){\n res += sum+1;\n sum=-1;\n }\n }\n return res;\n}\n\nint main(){\n\n std::cin.tie(0);\n std::cin >> n;\n for(int i=0; i<n; i++) std::cin >> a[i];\n\n std::cout << std::min(calc(0), calc(1)) <<'\\n';\n return 0;\n}\n", "n = int(input())\nAs = list(map(int, input().split()))\nrs = []\nfor m in {0, 1}:\n r = 0\n s = 0\n for i in range(n):\n A = As[i]\n if i%2 == m:\n if s+A >= 0:\n r += s+A+1\n s = -1\n else:\n s += A\n else:\n if s+A <= 0:\n r += -(s+A)+1\n s = +1\n else:\n s += A\n #print(m, r)\n rs.append(r)\nr = min(rs)\nprint(r)\n", "n = int(input())\nan = list(map(int,input().split()))\n\ndef f(x):\n ans = 0\n count = 0\n for a in an:\n count += a\n if count * x >= 0:\n ans += abs(count)+1\n count = -x\n x *= -1\n return ans\n\n\nprint(min(f(1),f(-1)))\n", "#include<iostream>\n#include<string>\n#include<typeinfo>\n#include<vector>\n#include<algorithm>\n#include<map>\n#include<iomanip>\nusing namespace std;\ntypedef long long int ll;\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a;\n\tll mp=0, pm=0;\n\tll mp_tmp=0, pm_tmp=0;\n\tfor(int i=0; i<n; i++){\n\t\tcin >> a;\n\t\tmp_tmp += a;\n\t\tpm_tmp += a;\n\t\tif(i%2==0){\n\t\t\tif(mp_tmp>=0){\n\t\t\t\tmp += (mp_tmp+1);\n\t\t\t\tmp_tmp=-1;\n\t\t\t}\n\t\t\tif(pm_tmp<=0){\n\t\t\t\tpm += (1-pm_tmp);\n\t\t\t\tpm_tmp=1;\n\t\t\t}\n\t\t}else{\n\t\t\tif(mp_tmp<=0){\n\t\t\t\tmp += (1-mp_tmp);\n\t\t\t\tmp_tmp=1;\n\t\t\t}\n\t\t\tif(pm_tmp>=0){\n\t\t\t\tpm += (pm_tmp+1);\n\t\t\t\tpm_tmp=-1;\n\t\t\t}\n\t\t}\n\t}\n\tcout << min(mp, pm) << endl;\n\treturn 0;\n}", "N=int(input())\nA=list(map(int,input().split()))\n\ndef chk(a,t):\n ans=0\n x=0\n for i in a:\n x+=i\n if t==True and x<1:\n ans+=1-x\n x=1\n elif t==False and x>-1:\n ans+=x+1\n x=-1\n t=not t\n return ans \nprint(min(chk(A,True),chk(A,False)))", "n = int(input())\na = list(map(int, input().split()))\n\ndef func(x):\n\tglobal a\n\n\ts = 0\n\tk = 0\n\n\tfor i in a:\n\t\ts += i\n\t\tif s*x <= 0:\n\t\t\tk += abs(x-s)\n\t\t\ts = x\n\t\tx *= -1\n\n\treturn k\n\n\nprint(min(func(1), func(-1)))", "N=int(input())\nA=list(map(int,input().split()))\nans=[0]*2\nfor pat in range(2):\n cur=0\n isplus=pat\n for i in range(N):\n cur+=A[i]\n if isplus:\n if cur<=0:\n ans[pat]+=abs(cur-1)\n cur=1\n else:\n if cur>=0:\n ans[pat]+=abs(cur-(-1))\n cur=-1\n isplus^=1\n\nprint(min(ans))\n", "n = int(input())\nA = list(map(int,input().split()))\ndef func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\nans = min(func(A,1),func(A,-1))\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = [0, 0]\nfor i in [0, 1]:\n total = 0\n for idx, val in enumerate(a):\n total += val\n if (i + idx) % 2 == 0:\n if total >= 0:\n ans[i] += total + 1\n total = -1\n else:\n if total <= 0:\n ans[i] += 1-total\n total = 1\nprint(min(ans))", "#include <bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nint main(){\n cin.tie(0); ios::sync_with_stdio(false);\n\n int n; cin>>n; int a[n]; Int a1=0,s1=0,a2=0,s2=0;\n for (int i = 0; i < n; i++){\n cin>>a[i]; \n s1+=a[i]; s2+=a[i];\n if(i%2){\n if(s1>=0){a1+=1+s1; s1=-1;}\n if(s2<=0){a2+=1-s2; s2=1;}\n }else{\n if(s1<=0){a1+=1-s1; s1=1;}\n if(s2>=0){a2+=1+s2; s2=-1;}\n }\n }\n cout<<min(a1,a2)<<'\\n';\n}", "n = int(input())\na = list(map(int, input().split()))\n\ndef f(toggle):\n\tglobal a, n\n\ts = 0\n\tres = 0\n\tfor i in range(n):\n\t\ts += a[i]\n\t\tif toggle == 1 and s < 1:\n\t\t\tres += -s + 1\n\t\t\ts = 1\n\t\telif toggle == 0 and s > -1:\n\t\t\tres += s + 1\n\t\t\ts = -1\n\n\t\ttoggle = not toggle\n\n\treturn res\n\nprint(min(f(1), f(0)))", "import sys\nfrom collections import deque\nimport copy\nimport math\ndef get_read_func(fileobject):\n if fileobject == None :\n return raw_input\n else:\n return fileobject.readline\n\ndef calc(A, N):\n s = 0L\n count = 0\n pre_sign = 0\n for i in range(N):\n s += A[i]\n if s == 0:\n if pre_sign == 1:\n s -= 1L\n elif pre_sign == -1:\n s += 1L\n count += 1\n elif pre_sign == s/abs(s):\n if s < 0L:\n ope = 1L - s\n else:\n ope = -1L - s\n s += ope\n count += abs(ope)\n pre_sign = s/abs(s)\n return count\n\n\ndef main():\n if len(sys.argv) > 1:\n f = open(sys.argv[1])\n else:\n f = None\n read_func = get_read_func(f);\n input_raw = read_func().strip().split()\n [N] = [int(input_raw[0])]\n input_raw = read_func().strip().split()\n A_minus = [int(input_raw[i]) for i in range(N)]\n A_plus = [int(input_raw[i]) for i in range(N)]\n firstA = A_minus[0]\n first = 0\n if firstA >= 0:\n first = A_minus[0] + 1\n A_minus[0] = -1\n\n count_minus =calc(A_minus, N) + first\n\n first = 0\n if firstA <= 0:\n first = 1 - A_plus[0]\n A_plus[0] = 1\n\n count_plus =calc(A_plus, N) + first\n count = min(count_minus, count_plus)\n\n\n print count\n\n\n\n\nif __name__ == '__main__':\n main()\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nvector<int> v(1e5+7);\n\nll solve(int n)\n{\n ll sum = 0;\n ll ans = 0;\n\n for (int i = 0; i < n; i++) {\n if (i % 2) {\n if (sum + v[i] <= 0) ans += abs(sum + v[i]) + 1, sum = 1;\n else sum += v[i];\n }\n\n else {\n if (sum + v[i] >= 0) ans += abs(sum + v[i]) + 1, sum = -1;\n else sum += v[i];\n }\n }\n\n return ans;\n}\n\nint main()\n{\n int n;\n cin >> n;\n for (int i = 0; i < n; i++) cin >> v[i];\n\n ll ans = solve(n);\n\n for (int i = 0; i < n; i++) v[i] *= -1;\n ans = min(ans, solve(n));\n\n cout << ans;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int, int> PII;\n\nconst int N = 100010, mod = 1e9 + 7;\n\nint n, a[N];\nLL sum, res, ans;\n\nint main()\n{\n scanf(\"%d\", &n);\n for(int i = 1; i <= n; i++) scanf(\"%d\", a + i);\n\n sum = 0;\n for(int i = 1, s = 1; i <= n; i++, s *= -1)\n {\n sum += a[i];\n if(sum * s <= 0) res += abs(sum - s), sum = s;\n }\n\n sum = 0;\n for(int i = 1, s = -1; i <= n; i++, s *= -1)\n {\n sum += a[i];\n if(sum * s <= 0) ans += abs(sum - s), sum = s;\n }\n\n printf(\"%lld\\n\", min(res, ans));\n return 0;\n}\n", "N=int(input())\nA=list(map(int,input().split()))\nA2=[0]*N\nfor i in range(N):\n A2[i]=A2[i-1]+A[i]\nr,f,s=0,1,0\nfor a in A2:\n if (a+s)*-f>=0:\n x=a+s-f\n s-=x\n r+=abs(x)\n f*=-1\nr2,f,s=0,-1,0\nfor a in A2:\n if (a+s)*-f>=0:\n x=a+s-f\n s-=x\n r2+=abs(x)\n f*=-1\nprint(min(r,r2))", "#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main() {\n\t\n\tint N;\n\tcin >> N;\n\tvector<int> a(N);\n\tfor(auto &i:a)cin >> i;\n\tint64_t sum1=0, sum2=0;\n\tint64_t cnt1=0, cnt2=0;\n\tint sign1=1,sign2=-1;\n\t\t\n\tfor(int i=0; i<N; i++){\n\t\tsum1 += a.at(i);\n\t\tif(sign1 * sum1 <= 0){\n\t\t\tcnt1 += abs(sum1) + 1;\n\t\t\tsum1 = sign1;\n\t\t}\n\t\tsign1 *= -1;\n\t}\n\t\n\tfor(int i=0; i<N; i++){\n\t\tsum2 += a.at(i);\n\t\tif(sign2 * sum2 <= 0){\n\t\t\tcnt2 += abs(sum2) + 1;\n\t\t\tsum2 = sign2;\n\t\t}\n\t\tsign2 *= -1;\n\t}\n\tcout << min(cnt1, cnt2) << endl;\n\t\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tfinal Scanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextLong();\n\t\tlong[] arr = new long[(int) n];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tarr[i] = sc.nextLong();\n\t\t}\n\t\t//一項目を負にするか正にするか\n\t\tlong seiT = 0L;\n\t\tlong ruisekiWA = 0L;\n\t\tfor(int i = 0; i < n; i++) {//正のとき\n\t\t\truisekiWA += arr[i];\n\t\t\tif(i%2==0) {//正にする\n\t\t\t\tif(ruisekiWA > 0) {\n\n\t\t\t\t} else {\n\t\t\t\t\tseiT += 1 - ruisekiWA;\n\t\t\t\t\truisekiWA = 1;\n\t\t\t\t}\n\t\t\t} else {//負にする\n\t\t\t\tif(ruisekiWA < 0) {\n\n\t\t\t\t} else {\n\t\t\t\t\tseiT += ruisekiWA + 1;\n\t\t\t\t\truisekiWA = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong fuT = 0L;\n\t\truisekiWA = 0L;\n\t\tfor(int i = 0; i < n; i++) {//負のとき\n\t\t\truisekiWA += arr[i];\n\t\t\tif(i%2==0) {//負にする\n\t\t\t\tif(ruisekiWA < 0) {\n\n\t\t\t\t} else {\n\t\t\t\t\tfuT += ruisekiWA + 1;\n\t\t\t\t\truisekiWA = -1;\n\t\t\t\t}\n\t\t\t} else {//正にする\n\t\t\t\tif(ruisekiWA > 0) {\n\n\t\t\t\t} else {\n\t\t\t\t\tfuT += 1 - ruisekiWA;\n\t\t\t\t\truisekiWA = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(seiT, fuT));\n\t}\n}", "n = input()\na = list(map(int, input().split()))\n\n\ndef chk(a, positive):\n ans = tmp = 0\n for x in a:\n tmp += x\n if positive and tmp < 1:\n ans += 1-tmp\n tmp = 1\n elif not positive and tmp > -1:\n ans += abs(-1-tmp)\n tmp = -1\n\n positive = not positive\n return ans\n\nprint(min((chk(a, True), chk(a, False))))", "N=int(input())\nA=list(map(int,input().split()))\n\nsa=[0]*N\nsa[0]=A[0]\nfor i in range(1,N):\n sa[i]=sa[i-1]+A[i]\n \npm=1\nans=0\nd=0\nfor i in range(N):\n if sa[i]+d!=pm*abs(sa[i]+d) or sa[i]+d==0:\n ans+=abs(pm-sa[i]-d)\n d+=pm-sa[i]-d\n pm*=-1\n \npm=-1\nans2=0\nd=0\nfor i in range(N):\n if sa[i]+d!=pm*abs(sa[i]+d) or sa[i]+d==0:\n ans2+=abs(pm-sa[i]-d)\n d+=pm-sa[i]-d\n pm*=-1\n\nprint(min(ans,ans2))", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n inputClass in = new inputClass(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CSequence solver = new CSequence();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CSequence {\n public void solve(int testNumber, inputClass sc, PrintWriter out) {\n int n = sc.nextInt();\n int[] tab = new int[n];\n for (int i = 0; i < n; i++) {\n tab[i] = sc.nextInt();\n }\n long ans = Long.MAX_VALUE;\n long sum = 0;\n long act = 0;\n if (tab[0] <= 0) {\n act += -tab[0] + 1;\n sum = 1;\n } else {\n sum = tab[0];\n }\n for (int i = 1; i < n; i++) {\n if (i % 2 == 0) {\n if (sum + tab[i] > 0) {\n sum += tab[i];\n continue;\n }\n act += 1 - (sum + tab[i]);\n sum = 1;\n } else {\n if (sum + tab[i] < 0) {\n sum += tab[i];\n continue;\n }\n act += 1 + (sum + tab[i]);\n sum = -1;\n }\n }\n ans = Math.min(ans, act);\n\n sum = 0;\n act = 0;\n if (tab[0] >= 0) {\n act += tab[0] + 1;\n sum = -1;\n } else {\n sum = tab[0];\n }\n for (int i = 1; i < n; i++) {\n if (i % 2 == 1) {\n if (sum + tab[i] > 0) {\n sum += tab[i];\n continue;\n }\n act += 1 - (sum + tab[i]);\n sum = 1;\n } else {\n if (sum + tab[i] < 0) {\n sum += tab[i];\n continue;\n }\n act += 1 + (sum + tab[i]);\n sum = -1;\n }\n }\n ans = Math.min(ans, act);\n out.println(ans);\n }\n\n }\n\n static class inputClass {\n BufferedReader br;\n StringTokenizer st;\n\n public inputClass(InputStream in) {\n\n br = new BufferedReader(new InputStreamReader(in));\n }\n\n public String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}\n\n", "n = int(input())\ns = list(map(int, input().split()))\n\n\ndef cost(t):\n res = 0\n sum = 0\n for y in s:\n sum += y\n if sum * t <= 0:\n res += abs(sum - t)\n sum = t\n t *= -1\n return res\n\n\nprint(min(cost(1), cost(-1)))\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\n\tstatic long countEvenPlus(int[] a) {\n\t\tlong count = 0;\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < a.length; i += 1) {\n\t\t\tsum += a[i];\n\t\t\tif (i % 2 == 0 && sum <= 0) {\n\t\t\t\tcount += Math.abs(sum) + 1;\n\t\t\t\tsum = 1;\n\t\t\t} else if (i % 2 == 1 && sum >= 0) {\n\t\t\t\tcount += Math.abs(sum) + 1;\n\t\t\t\tsum = -1;\n\t\t\t}\n\t\t}\n\t\treturn count;\n\t}\n\n\tstatic long countEvenMinus(int[] a) {\n\t\tlong count = 0;\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < a.length; i += 1) {\n\t\t\tsum += a[i];\n\t\t\tif (i % 2 == 0 && sum >= 0) {\n\t\t\t\tcount += Math.abs(sum) + 1;\n\t\t\t\tsum = -1;\n\t\t\t} else if (i % 2 == 1 && sum <= 0) {\n\t\t\t\tcount += Math.abs(sum) + 1;\n\t\t\t\tsum = 1;\n\t\t\t}\n\t\t}\n\t\treturn count;\n\t}\n\n\tstatic void exec(MyScanner in, PrintWriter out) {\n\t\tint N = in.nextInt();\n\t\tint[] a = IntStream.range(0, N).map(i -> in.nextInt()).toArray();\n\t\tout.println(Math.min(countEvenPlus(a), countEvenMinus(a)));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tPrintWriter w = new PrintWriter(System.out);\n\t\texec(new MyScanner(System.in), w);\n\t\tw.flush();\n\t}\n\n\tstatic class MyScanner {\n\t\tstatic final int BUFFER_SIZE = 1024;\n\t\tprivate final InputStream in;\n\t\tprivate final byte[] buffer = new byte[BUFFER_SIZE];\n\t\tprivate int point;\n\t\tprivate int readLength;\n\t\tMyScanner(InputStream in) {\n\t\t\tthis.in = in;\n\t\t}\n\t\tprivate int readByte() {\n\t\t\tif (point < readLength) {\n\t\t\t\tint result = buffer[point];\n\t\t\t\tpoint += 1;\n\t\t\t\treturn result;\n\t\t\t}\n\t\t\ttry {\n\t\t\t\treadLength = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (readLength == -1) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tpoint = 1;\n\t\t\treturn buffer[0];\n\t\t}\n\t\tstatic boolean isPrintableCharExceptSpace(int c) {\n\t\t\treturn 33 <= c && c <= 126;\n\t\t}\n\t\tString next() {\n\t\t\tStringBuilder b = new StringBuilder();\n\t\t\tint c = readByte();\n\t\t\twhile (!(c == -1 || isPrintableCharExceptSpace(c))) {\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tif (c == -1) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t\tdo {\n\t\t\t\tb.appendCodePoint(c);\n\t\t\t\tc = readByte();\n\t\t\t} while (c != -1 && isPrintableCharExceptSpace(c));\n\t\t\treturn b.toString();\n\t\t}\n\t\tlong nextLong() {\n\t\t\tint c = readByte();\n\t\t\twhile (!(c == -1 || isPrintableCharExceptSpace(c))) {\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tif (c == -1) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong result = 0L;\n\t\t\tdo {\n\t\t\t\tif (!('0' <= c && c <= '9')) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tresult = result * 10L + (c - '0');\n\t\t\t\tc = readByte();\n\t\t\t} while (c != -1 && isPrintableCharExceptSpace(c));\n\t\t\treturn minus ? -result : result;\n\t\t}\n\t\tint nextInt() {\n\t\t\tlong n = nextLong();\n\t\t\tif (Integer.MIN_VALUE <= n && n <= Integer.MAX_VALUE) {\n\t\t\t\treturn (int) n;\n\t\t\t}\n\t\t\tthrow new InputMismatchException();\n\t\t}\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n\n}\n", "#include <iostream>\n#include <bits/stdc++.h>\n#include <vector>\n#include <algorithm>\n#include <cctype>\n#include <string>\n#define ll long long\n\nusing namespace std;\n\nint main(){\n\n ll n, a;\n cin >> n;\n int ans = 0;\n vector<ll> vec(n);\n\n for (int i = 0; i < n; i++){\n cin >> a;\n vec.at(i) = a;\n }\n\n ll now1 = 0, now2 = 0, cnt1 = 0, cnt2 = 0;\n for (int i = 0; i < n; i++) {\n now1 += vec[i];\n now2 += vec[i];\n if(now1 <= 0){\n cnt1 += abs(now1)+1;\n now1 = 1;\n }\n if(now2 >= 0){\n cnt2 += abs(now2)+1;\n now2 = -1;\n }\n swap(now1, now2);\n swap(cnt1, cnt2);\n }\n\n cout << min(cnt1,cnt2) << endl;\n\n return 0;\n}", "input()\nl=list(map(int,input().split()))\ndef f(s):\n c=t=0\n for i in l:\n t+=i\n if s*t<=0: c+=abs(t-s); t=s\n s*=-1\n return c\nprint(min(f(1),f(-1)))", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\nimport java.util.function.IntFunction;\nimport java.util.function.Supplier;\nimport java.util.stream.IntStream;\nimport java.util.stream.Stream;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner();\n int n=scanner.nextInt();\n long[] a=new long[n];\n for(int i=0;i<n;i++){\n a[i]=scanner.nextInt();\n }\n long[] ruiseki=new long[n+1];\n for(int i=1;i<=n;i++){\n ruiseki[i]=a[i-1]+ruiseki[i-1];\n }\n long xSum1=0;\n long ans1=0;\n for(int i=1;i<=n;i++){\n long val1=ruiseki[i]+xSum1;\n if(i%2==0){\n //+\n if(val1>0)continue;\n long x=Math.abs(val1)+1;\n xSum1+=x;\n ans1+=x;\n }else{\n //-\n if(val1<0) continue;\n long x=val1+1;\n xSum1-=x;\n ans1+=x;\n }\n }\n long xSum2=0;\n long ans2=0;\n for(int i=1;i<=n;i++){\n long val2=ruiseki[i]+xSum2;\n if(i%2==1){\n //+\n if(val2>0)continue;\n long x=Math.abs(val2)+1;\n xSum2+=x;\n ans2+=x;\n }else{\n //-\n if(val2<0) continue;\n long x=val2+1;\n xSum2-=x;\n ans2+=x;\n }\n }\n put(Math.min(ans1,ans2));\n\n\n\n\n\n }\n\n\n public static void print(Object object){\n System.out.print(object);\n }\n public static void put(Object object) {\n System.out.println(object);\n }\n public static void put(){\n System.out.println();\n }\n public static String format(String string, Object... args) {\n return String.format(string, args);\n }\n}\n\nfinal class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\nfinal class Pair {\n final public int x, y;\n\n Pair(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public int hashCode() {\n return x+y;\n }\n\n @Override\n public boolean equals(Object obj) {\n boolean result=super.equals(obj);\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Pair pair=(Pair)obj;\n if(this.x==pair.x&&this.y==pair.y) return true;\n return false;\n }\n\n @Override\n public String toString() {\n return String.format(\"(%d,%d)\", x, y);\n }\n}\nfinal class Tuple<T,V>{\n //immutabl1でないことに注意(T,Vがmutableの場合変更可能)\n final public T t;\n final public V v;\n Tuple(T t,V v){\n this.t=t;\n this.v=v;\n }\n\n @Override\n public int hashCode() {\n return (t.hashCode()+v.hashCode());\n }\n\n @Override\n public boolean equals(Object obj) {\n if(obj.getClass()!=this.getClass()){\n return false;\n }\n Tuple<T,V> tuple=(Tuple)obj;\n return tuple.t.equals(this.t)&&tuple.v.equals(this.v);\n }\n\n @Override\n public String toString() {\n return String.format(\"<Tuple>=<%s,%s>\",t,v);\n }\n}\nfinal class LowerBoundComparator<T extends Comparable<? super T>>\n implements Comparator<T>\n{\n public int compare(T x, T y)\n {\n return (x.compareTo(y) >= 0) ? 1 : -1;\n }\n}\n\nfinal class UpperBoundComparator<T extends Comparable<? super T>>\n implements Comparator<T>\n{\n public int compare(T x, T y)\n {\n return (x.compareTo(y) > 0) ? 1 : -1;\n }\n}\nfinal class Util {\n static long gcd(long a,long b){\n if(a%b==0)return b;\n return gcd(b,a%b);\n }\n static long lcm(long a,long b){\n long gcd=gcd(a,b);\n long result=b/gcd;\n return a*result;\n }\n static long kaijoMod(int n,int mod){\n if(n<1) return -1;\n long result=1;\n for(int i=n;i>1;i--){\n result*=i;\n result%=mod;\n }\n return result;\n }\n static <T extends Comparable> Map<T,Integer> count(List<T> list){\n //副作用\n Collections.sort(list);\n Map<T,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<list.size()){\n while(r<list.size()-1&&list.get(r).equals(r+1)){\n r++;\n }\n result.put(list.get(r),r-l+1);\n r++;\n l=r;\n }\n return result;\n\n }\n static Map<Integer,Integer> count(int[] array){\n //副作用\n Arrays.sort(array);\n Map<Integer,Integer> result=new HashMap<>();\n int l=0,r=0;\n while(l<array.length){\n while(r<array.length-1&&array[r]==array[r+1]){\n r++;\n }\n result.put(array[l],r-l+1);\n r++;\n l=r;\n }\n return result;\n }\n static String toStringBWS(Iterable iterable){\n Iterator ite=iterable.iterator();\n return toStringBWS(ite);\n }\n static String toStringBWS(Iterator ite){\n StringBuilder sb=new StringBuilder();\n sb.append(ite.next());\n while(ite.hasNext()){\n sb.append(\" \");\n sb.append(ite.next());\n }\n return sb.toString();\n }\n static String toStringBWS(int[] array){\n StringBuilder sb=new StringBuilder();\n for(int i=0;i<array.length-1;i++){\n sb.append(array[i]);\n sb.append(\" \");\n }\n sb.append(array[array.length-1]);\n return sb.toString();\n }\n static String toStringBWS(long[] array){\n StringBuilder sb=new StringBuilder();\n for(int i=0;i<array.length-1;i++){\n sb.append(array[i]);\n sb.append(\" \");\n }\n sb.append(array[array.length-1]);\n return sb.toString();\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\nint n;\n cin >> n;\n int d[n];\n \n for(int i=0;i<n;i++) cin >> d[i];\nint64_t sume=0;\nint64_t counte=0; \nfor(int i=0;i<n;i++){\n sume+=d[i];\n if(i%2==0){\n if(sume<=0){\n counte+=1-sume;\n sume=1; \n }\n }\n else{\n if(sume>=0){\n counte+=sume+1;\n sume=-1;\n }\n }\n}\nint64_t sumo=0;\nint64_t counto=0; \nfor(int i=0;i<n;i++){\n sumo+=d[i];\n if(i%2==1){\n if(sumo<=0){\n counto+=1-sumo;\n sumo=1; \n }\n }\n else{\n if(sumo>=0){\n counto+=sumo+1;\n sumo=-1;\n }\n }\n}\ncout << min(counte,counto) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long n;\nvector<long long> a;\n\nlong long solve(int x);\n\nint main() {\n cin >> n;\n for(int i = 0; i < n; ++i) {\n int x;\n cin >> x;\n a.push_back(x);\n }\n cout << min(solve(0), solve(1)) << endl;\n return 0;\n}\n\nlong long solve(int x) {\n long long ans = 0, now = 0;\n for(long long i = 0; i < n; ++i) {\n now += a[i];\n if((i % 2 ^ x) && (now >= 0)) {\n ans += now + 1;\n now = -1;\n }\n if(!(i % 2 ^ x) && (now <= 0)) {\n ans -= now - 1;\n now = 1;\n }\n }\n return ans;\n}", "n = int(input())\n*l, = map(int,input().split())\ndef calc(l,even):\n ans = 0\n l1 = l[:]\n s = 0\n for i in range(n):\n s += l1[i] \n if i%2 == even and s<=0: \n ans += -s+1 \n s = 1\n elif i%2 != even and s>=0: \n ans += s+1\n s = -1\n return ans\nprint(min([calc(l,0),calc(l,1)]))", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n int a[100100];\n for (int i = 0; i < n; i++) cin >> a[i];\n\n long long cnt[2] = {};\n for (int i = 0; i < 2; i++) {\n long long sum = 0;\n for (int j = 0; j < n; j++) {\n sum += a[j];\n if (sum == 0) {\n if ((i + j) % 2 == 0) sum++;\n else sum--;\n cnt[i]++;\n } else if (sum > 0 && (i + j) % 2 == 1) {\n long long x = sum + 1;\n sum -= x;\n cnt[i] += x;\n } else if (sum < 0 && (i + j) % 2 == 0) {\n long long y = abs(sum) + 1;\n sum += y;\n cnt[i] += y;\n }\n }\n }\n\n cout << min(cnt[0], cnt[1]) << endl;\n}", "n = int(input())\na = list(map(int,input().split()))\n\ndef find(a,flag):\n\tc = 0\n\ts = 0\n\tfor i in range(n):\n\t\tif flag and s + a[i] > 0:\n\t\t\tflag = False\n\t\t\ts = s + a[i]\n\t\telif flag:\n\t\t\tc = c + abs(s + a[i])+1\n\t\t\tflag = False\n\t\t\ts = 1\n\t\telif not flag and s + a[i] < 0:\n\t\t\tflag = True\n\t\t\ts = s + a[i]\n\t#\t\tprint((s,f,c))\n\t\telse:\n\t\t\tc = c + abs(s+a[i])+1\n\t\t\tflag = True\n\t\t\ts = -1\n\treturn c\n\ncplus = find(a,True)\ncmin = find(a,False)\nprint(min(cplus,cmin))\n", "n = int(input())\narr = [0] + [int(x) for x in input().split()]\n\ndef exec(sign):\n a = [x for x in arr]\n res = 0\n\n x = 0\n for i in range(n):\n x += a[i]\n tmp = sign - (x + a[i+1])\n if sign < 0:\n tmp = min(tmp, 0)\n else:\n tmp = max(tmp, 0)\n res += abs(tmp)\n a[i+1] += tmp\n sign *= (-1)\n return res\n\nprint(min(exec(1), exec(-1)))\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n;\n cin >> n;\n vector<int> an(n);\n for(int i=0; i<n; ++i) cin >> an[i];\n ll plusans = 0, cnt = 0;\n for(int i=0; i<n; ++i){\n cnt += an[i];\n if(cnt *(i%2 ? 1:-1) >= 0){\n plusans += abs(cnt) +1;\n cnt = (i%2 ? -1:1);\n }\n }\n ll minusans = 0;\n cnt = 0;\n for(int i=0; i<n; ++i){\n cnt += an[i];\n if(cnt *(i%2 ? -1:1) >= 0){\n minusans += abs(cnt) +1;\n cnt = (i%2 ? 1:-1);\n }\n }\n cout << min(plusans, minusans) << endl;\n}", "#include <iostream>\n#include <algorithm>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n ll n;\n cin >> n;\n ll a[n];\n for(ll i=0;i<n;i++) cin >> a[i];\n ll x=0,y=0,xc=0,yc=0;\n for(ll i=0;i<n;i++){\n xc+=a[i];\n if(i%2==0&&xc<=0){\n x+=1-xc;\n xc=1;\n }\n else if(i%2==1&&xc>=0){\n x+=1+xc;\n xc=-1;\n }\n }\n for(ll i=0;i<n;i++){\n yc+=a[i];\n if(i%2==0&&yc>=0){\n y+=1+yc;\n yc=-1;\n }\n else if(i%2==1&&yc<=0){\n y+=1-yc;\n yc=1;\n }\n }\n cout << min(x,y) << endl;\n}", "n = int(input())\nlst = [int(x) for x in input().split()]\n\ntotal = [0, 0]\nret = [0, 0]\nfor i in range(2):\n for j in range(n):\n total[i] += lst[j]\n if (i + j) % 2 == 0:\n if total[i] >= 0:\n ret[i] += total[i] + 1\n total[i] = -1\n else:\n if total[i] <= 0:\n ret[i] += abs(total[i] - 1)\n total[i] = 1\n\nprint(min(ret))", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = Integer.parseInt(sc.next());\n\t\tint diff = 0;\n\t\tlong c = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdiff += a[i];\n\t\t\tif (i % 2 == 0) {\n\t\t\t\tif (diff <= 0) {\n\t\t\t\t\tc += -diff + 1;\n\t\t\t\t\tdiff = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (diff >= 0) {\n\t\t\t\t\tc += diff + 1;\n\t\t\t\t\tdiff = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong ans = c;\n\t\tc = 0;\n\t\tdiff = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdiff += a[i];\n\t\t\tif (i % 2 != 0) {\n\t\t\t\tif (diff <= 0) {\n\t\t\t\t\tc += -diff + 1;\n\t\t\t\t\tdiff = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (diff >= 0) {\n\t\t\t\t\tc += diff + 1;\n\t\t\t\t\tdiff = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans = Math.min(ans, c);\n\t\tSystem.out.println(ans);\n\t}\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main {\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tSolver solver = new Solver();\n\t\tsolver.init();\n\t\tsolver.readHead(in.readLine());\n\t\tfor (; solver.hasNext();) {\n\t\t\tsolver.readBody(in.readLine());\n\t\t}\n\t}\n}\n\nclass Solver {\n\tint N;\n\tint cnt;\n\n\tpublic void init() {\n\t\tN = 0;\n\t\tcnt = 0;\n\t}\n\n\tpublic void readHead(String str) {\n\t\tString[] strArr = str.split(\" \");\n\t\tN = Integer.parseInt(strArr[0]);\n\t\t// System.out.println(N);\n\t}\n\n\tpublic boolean hasNext() {\n\t\treturn cnt < 1;\n\t}\n\n\tint[] A;\n\n\tpublic void readBody(String str) {\n\t\t// System.out.println(str);]\n\t\tString[] strArr = str.split(\" \");\n\t\tA = new int[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tA[i] = Integer.parseInt(strArr[i]);\n\t\tif (A[0] != 0) {\n\t\t\tlong cnt1 = cnt();\n\t\t\tlong cnt2;\n\t\t\tif (A[0] > 0) {\n\t\t\t\tcnt2 = A[0] + 1;\n\t\t\t\tA[0] = -1;\n\t\t\t} else {\n\t\t\t\tcnt2 = -1 * A[0] + 1;\n\t\t\t\tA[0] = 1;\n\t\t\t}\n\t\t\tcnt2 += cnt();\n\t\t\tif (cnt1 < cnt2)\n\t\t\t\tSystem.out.println(cnt1);\n\t\t\telse\n\t\t\t\tSystem.out.println(cnt2);\n\t\t} else {\n\t\t\tA[0] = 1;\n\t\t\tlong cnt1 = cnt() + 1;\n\t\t\tA[0] = -1;\n\t\t\tlong cnt2 = cnt() + 1;\n\t\t\tif (cnt1 < cnt2)\n\t\t\t\tSystem.out.println(cnt1);\n\t\t\telse\n\t\t\t\tSystem.out.println(cnt2);\n\t\t}\n\t\tcnt++;\n\t}\n\n\tprivate long cnt() {\n\t\tint s = 1;\n\t\tif (A[0] < 0)\n\t\t\ts = -1;\n\t\tlong ans = 0;\n\t\tint sum = A[0];\n\t\tfor (int i = 1; i < N; i++) {\n\t\t\ts = s * -1;\n\t\t\tsum = sum + A[i];\n\t\t\tif (s == -1 && sum >= 0) {\n\t\t\t\tans += (sum + 1);\n\t\t\t\tsum = -1;\n\t\t\t} else if (s == 1 && sum <= 0) {\n\t\t\t\tans += (-sum + 1);\n\t\t\t\tsum = 1;\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\t@SuppressWarnings(\"resource\")\n\tpublic static void main(String args[]) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint a[]=new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i]=scanner.nextInt();\n\t\t}\n\t\tlong r[]=new long[n];\n\t\tr[0]=a[0];\n\t\tlong cnt1=0;\n\t\tif(r[0]>=0) {\n\t\t\tcnt1+=Math.abs(-1-r[0]);\n\t\t\tr[0]=-1;\n\t\t}\n\t\tfor(int i=1;i<n;i++) {\n\t\t\tr[i]=r[i-1]+a[i];\n\t\t\tif(i%2==1&&r[i]<=0) {\n\t\t\t\tcnt1+=Math.abs(1-r[i]);\n\t\t\t\tr[i]=1;\n\t\t\t}\n\t\t\tif(i%2==0&&r[i]>=0) {\n\t\t\t\tcnt1+=Math.abs(-1-r[i]);\n\t\t\t\tr[i]=-1;\n\t\t\t}\n\t\t}\n\t\tr=new long[n];\n\t\tr[0]=a[0];\n\t\tlong cnt2=0;\n\t\tif(r[0]<=0) {\n\t\t\tcnt2+=Math.abs(1-r[0]);\n\t\t\tr[0]=1;\n\t\t}\n\t\tfor(int i=1;i<n;i++) {\n\t\t\tr[i]=r[i-1]+a[i];\n\t\t\tif(i%2==1&&r[i]>=0) {\n\t\t\t\tcnt2+=Math.abs(-1-r[i]);\n\t\t\t\tr[i]=-1;\n\t\t\t}\n\t\t\tif(i%2==0&&r[i]<=0) {\n\t\t\t\tcnt2+=Math.abs(1-r[i]);\n\t\t\t\tr[i]=1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.min(cnt1, cnt2));\n\t}\n}", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n List<Long> a = new ArrayList<>();\n IntStream.range(0, n).forEach(i -> a.add(sc.nextLong()));\n\n\n Long plusMinusStep = 0L;\n Long minusPlusStep = 0L;\n Long plusMinusSum = 0L;\n Long minusPlusSum = 0L;\n for (int i = 0; i < n; i++) {\n Long target = a.get(i);\n if (i % 2 == 1) {\n if (plusMinusSum + target >= 0) {\n plusMinusStep += Math.abs(plusMinusSum + target) + 1;\n plusMinusSum = -1L;\n } else {\n plusMinusSum += target;\n }\n if (minusPlusSum + target <= 0) {\n minusPlusStep += Math.abs(minusPlusSum + target) + 1;\n minusPlusSum = 1L;\n } else {\n minusPlusSum += target;\n }\n continue;\n }\n if (plusMinusSum + target <= 0) {\n plusMinusStep += Math.abs(plusMinusSum + target) + 1;\n plusMinusSum = 1L;\n } else {\n plusMinusSum += target;\n }\n if (minusPlusSum + target >= 0) {\n minusPlusStep += Math.abs(minusPlusSum + target) + 1;\n minusPlusSum = -1L;\n } else {\n minusPlusSum += target;\n }\n }\n System.out.println(Math.min(plusMinusStep, minusPlusStep));\n }\n\n}\n", "n = int(input())\nA = list(map(int,input().split()))\nans = 10**20\n\nfor i in[-1,1]:\n ansi,sum = 0,0\n for a in A:\n sum += a\n if sum*i <= 0:\n ansi +=abs(sum-i)\n sum = i\n i *= -1\n ans = min(ans,ansi)\nprint(ans)\n", "#include<cstdio>\nusing namespace std;\n \nint main(){\n int n;\n long long d, a = 0, b = 0, cnta = 0, cntb = 0, i, ans;\n scanf(\"%d\", &n);\n for(i = 0; i < n; i++){\n scanf(\"%lld\", &d);\n a += d; b += d;\n if(i%2){\n if(a > -1){cnta += a + 1; a = -1;}\n if(b < 1){cntb += 1 - b; b = 1;}\n }else{\n if(b > -1){cntb += b + 1; b = -1;}\n if(a < 1){cnta += 1 - a; a = 1;}\n }\n }\n printf(\"%lld\\n\", (cnta < cntb) ? cnta : cntb);\n}", "#include <iostream>\n#include <string>\n\nusing namespace::std;\n\nlong int N, a[100000],A,ans[2];\n\nint min(int x, int y) {\n\tif (x > y)return y;\n\treturn x;\n}\n\nint main() {\n\tcin >> N;\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> a[i];\n\t}\n\tA = 0;\n\t//偶数番目が+\n\tfor (int i = 0; i < N; i++) {\n\t\tA += a[i];\n\t\tif (A >= 0&&i%2==0) {\n\t\t\tans[0] += A + 1;\n\t\t\tA = -1;\n\t\t}\n\t\tif (A <= 0 && i % 2 == 1) {\n\t\t\tans[0] += -A + 1;\n\t\t\tA = 1;\n\t\t}\n\t}\n\tA = 0;\n\t//紀数番目が+\n\tfor (int i = 0; i < N; i++) {\n\t\tA += a[i];\n\t\tif (A >= 0 && i % 2 == 1) {\n\t\t\tans[1] += A + 1;\n\t\t\tA = -1;\n\t\t}\n\t\tif (A <= 0 && i % 2 == 0) {\n\t\t\tans[1] += -A + 1;\n\t\t\tA = 1;\n\t\t}\n\t}\n\n\tcout << min(ans[0],ans[1]);\n\treturn 0;\n\t\t}\n\n\n\t\n", "n=int(input())\nl=list(map(int,input().split()))\na1=0\na2=0\ns1=0\ns2=0\nfor i,j in enumerate(l):\n s1+=j\n s2+=j\n if i%2:\n if s1>=0:\n a1+=s1+1\n s1=-1\n if s2<=0:\n a2+=-s2+1\n s2=1\n else:\n if s2>=0:\n a2+=s2+1\n s2=-1\n if s1<=0:\n a1+=-s1+1\n s1=1\nprint(min(a1,a2))", "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n \npublic class Main {\n private static boolean debug = false;\n private static boolean elapsed = false;\n \n private static PrintWriter _out = new PrintWriter(System.out);\n private static PrintWriter _err = new PrintWriter(System.err);\n \n private void solve(Scanner sc) {\n int n = sc.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; ++i) {\n a[i] = sc.nextInt();\n }\n \n long sum1 = 0;\n long ans1 = 0;\n for (int i = 0; i < n; ++i) {\n sum1 += a[i];\n if (i % 2 == 0 && sum1 <= 0) {\n ans1 += 1 - sum1;\n sum1 = 1;\n } else if (i % 2 == 1 && sum1 >= 0) {\n ans1 += 1 + sum1;\n sum1 = -1;\n }\n }\n \n long sum2 = 0;\n long ans2 = 0;\n for (int i = 0; i < n; ++i) {\n sum2 += a[i];\n if (i % 2 == 0 && sum2 >= 0) {\n ans2 += 1 + sum2;\n sum2 = -1;\n } else if (i % 2 == 1 && sum2 <= 0) {\n ans2 += 1 - sum2;\n sum2 = 1;\n }\n }\n \n _out.println(Math.min(ans1, ans2));\n }\n private static BigInteger C(long n, long r) {\n BigInteger res = BigInteger.ONE;\n for (long i = n; i > n - r; --i) {\n res = res.multiply(BigInteger.valueOf(i));\n }\n for (long i = r; i > 1; --i) {\n res = res.divide(BigInteger.valueOf(i));\n }\n return res;\n }\n private static BigInteger P(long n, long r) {\n BigInteger res = BigInteger.ONE;\n for (long i = n; i > n - r; --i) {\n res = res.multiply(BigInteger.valueOf(i));\n }\n return res;\n }\n /*\n * 10^10 > Integer.MAX_VALUE = 2147483647 > 10^9\n * 10^19 > Long.MAX_VALUE = 9223372036854775807L > 10^18\n */\n public static void main(String[] args) {\n long S = System.currentTimeMillis();\n \n Scanner sc = new Scanner(System.in);\n new Main().solve(sc);\n _out.flush();\n \n long G = System.currentTimeMillis();\n if (elapsed) {\n _err.println((G - S) + \"ms\");\n }\n _err.flush();\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long n;\nvector<long long> a;\n\nlong long solve(int x);\n\nint main() {\n cin >> n;\n for(int i = 0; i < n; ++i) {\n int x;\n cin >> x; //項の一つ一つ\n a.push_back(x);\n }\n cout << min(solve(0), solve(1)) << endl;\n return 0;\n}\n\nlong long solve(int x) { //引数は0か1\n long long ans = 0, now = 0;\n\n for(long long i = 0; i < n; ++i) {\n now += a[i]; //累積和\n\n if((i % 2 == x) && (now >= 0)) {\n ans += now + 1;\n now = -1;\n }\n if(!(i % 2 == x) && (now <= 0)) {\n ans -= now - 1;\n now = 1;\n }\n }\n return ans;\n}\n", " #include <iostream>\n #include <cmath>\n using namespace std;\n int main(){\n int nw;\n int n;cin>>n;\n int a[n];for(int i = 0; n > i; i++)cin>>a[i];\n \n //+-+-+-....\n long long sh = 0;\n nw = 0;\n for(int i = 0; n > i; i++){\n nw = (long long)nw+a[i];\n if(i % 2 == 0)if(nw<=0)sh = (long long)sh+1-nw,nw=1;\n if(i % 2 == 1)if(nw>=0)sh = (long long)sh+nw+1,nw=-1;\n }\n \n //-+-+-+...\n long long hs = 0;\n nw = 0;\n for(int i = 0; n > i; i++){\n nw = (long long)nw+a[i];\n if(i % 2 == 1)if(nw<=0)hs = (long long)hs+1-nw,nw=1;\n if(i % 2 == 0)if(nw>=0)hs = (long long)hs+nw+1,nw=-1;\n }\n \n cout << min(hs,sh) << endl;\n \n }", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tlong[] s1 = new long[n];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\n\t\tlong sum1 = 0;\n\t\ts1[0] = a[0];\n\t\t// - + - + となる場合\n\t\tif (s1[0] >= 0) {\n\t\t\tsum1 = sum1 + 1 + s1[0];\n\t\t\ts1[0] = -1;\n\t\t}\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\ts1[i] = s1[i-1] + a[i];\n\t\t\t// iが奇数の場合は正にする\n\t\t\tif (i % 2 != 0) {\n\t\t\t\tif (s1[i-1]*s1[i] >= 0) {\n\t\t\t\t\tsum1 = sum1 + 1 - s1[i];\n\t\t\t\t\ts1[i] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// iが偶数の場合は負にする\n\t\t\telse {\n\t\t\t\tif (s1[i-1]*s1[i] >= 0) {\n\t\t\t\t\tsum1 = sum1 + 1 + s1[i];\n\t\t\t\t\ts1[i] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tArrays.fill(s1, 0);\n\t\tlong sum2 = 0;\n\t\ts1[0] = a[0];\n\t\t// + - + - となる場合\n\t\tif (s1[0] <= 0) {\n\t\t\tsum2 = sum2 + 1 - s1[0];\n\t\t\ts1[0] = 1;\n\t\t}\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\ts1[i] = s1[i-1] + a[i];\n\t\t\t// iが奇数の場合は負にする\n\t\t\tif (i % 2 != 0) {\n\t\t\t\tif (s1[i-1]*s1[i] >= 0) {\n\t\t\t\t\tsum2 = sum2 + 1 + s1[i];\n\t\t\t\t\ts1[i] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// iが偶数の場合は正にする\n\t\t\telse {\n\t\t\t\tif (s1[i-1]*s1[i] >= 0) {\n\t\t\t\t\tsum2 = sum2 + 1 - s1[i];\n\t\t\t\t\ts1[i] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(Math.min(sum1, sum2));\n\t}\n\n}", "n = int(input())\na = list(map(int, input().split()))\n\ndef calc_sum(a, flag):\n ret = 0\n sum = 0\n for i in range(n):\n if (flag == 1 and sum + a[i] >= 0) or (flag == -1 and sum + a[i] <= 0):\n ret += abs(sum) + a[i] * flag + 1\n sum = -flag\n else:\n sum += a[i]\n flag = -flag\n return ret\n\nprint(min(calc_sum(a, 1), calc_sum(a, -1)))", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define INF 1LL<<62\n#define inf 1000000007 \n\nll a[100010];\nint main() {\n\tll n;\n\tcin>>n;\n\tfor(ll i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tll ans1=0,now1=0;\n\tfor(ll i=0;i<n;i++){\n\t\tnow1+=a[i];\n\t\tif(i%2==0){\n\t\t\tif(now1<=0){\n\t\t\t\tans1+=abs(now1)+1;\n\t\t\t\tnow1=1;\n\t\t\t}\n\t\t}\n\t\telse{\n\t\t\tif(now1>=0){\n\t\t\t\tans1+=abs(now1)+1;\n\t\t\t\tnow1=-1;\n\t\t\t}\n\t\t}\n\t}\n\tll ans2=0,now2=0;\n\tfor(ll i=0;i<n;i++){\n\t\tnow2+=a[i];\n\t\tif(i%2==0){\n\t\t\tif(now2>=0){\n\t\t\t\tans2+=abs(now2)+1;\n\t\t\t\tnow2=-1;\n\t\t\t}\n\t\t}\n\t\telse{\n\t\t\tif(now2<=0){\n\t\t\t\tans2+=abs(now2)+1;\n\t\t\t\tnow2=1;\n\t\t\t}\n\t\t}\n\t}\t\n\tcout << min(ans1,ans2);\n\t// your code goes here\n\treturn 0;\n}", "public class Main {\n private static java.util.Scanner scanner = new java.util.Scanner(System.in);\n\n public static void main(String[] args) {\n int n = scanner.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = scanner.nextInt();\n\n long m1 = 0, m2 = 0, s1 = 0, s2 = 0;\n for (int i = 0; i < n; i++) {\n s1 += a[i];\n s2 += a[i];\n if ((i & 1) == 0) {\n if (s1 <= 0) {\n m1 += Math.abs(s1) + 1;\n s1 = 1;\n } if (s2 >= 0) {\n m2 += Math.abs(s2) + 1;\n s2 = -1;\n }\n } else {\n if (s1 >= 0) {\n m1 += Math.abs(s1) + 1;\n s1 = -1;\n } if (s2 <= 0) {\n m2 += Math.abs(s2) + 1;\n s2 = 1;\n }\n }\n }\n System.out.println(Math.min(m1, m2));\n }\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] a = new long[n];\n for (int i=0;i<n;i++) {\n a[i] = sc.nextInt();\n }\n\n long cost_1 = 0L;\n long cost_2 = 0L;\n long sum_1 = 0L;\n long sum_2 = 0L;\n for (int i=0;i<n;i++) {\n sum_1 += a[i];\n sum_2 += a[i];\n if (i%2==0) {\n if (sum_1<=0) {\n cost_1 += 1-sum_1;\n sum_1 += 1-sum_1;\n }\n if (sum_2>=0) {\n cost_2 += sum_2-(-1);\n sum_2 -= sum_2-(-1);\n }\n } else { // i%2==1\n if (sum_1>=0) {\n cost_1 += sum_1-(-1);\n sum_1 -= sum_1-(-1);\n }\n if (sum_2<=0) {\n cost_2 += 1-sum_2;\n sum_2 += 1-sum_2;\n }\n }\n }\n System.out.println(Math.min(cost_1, cost_2));\n }\n}", "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nvoid count(ll& cnt, ll& sum, ll a, int& sign) {\n ll tmp = sum + a;\n if (sign > 0 && tmp <= 0)\n sum += 1 - sum;\n else if (sign < 0 && tmp >= 0)\n sum -= 1 + sum;\n else\n sum = tmp;\n sign *= -1;\n cnt += abs(sum - tmp);\n}\n\nint main() {\n int n;\n cin >> n;\n\n ll sum_e = 0, sum_o = 0;\n ll cnt_e = 0, cnt_o = 0;\n int sign_e = 1, sign_o = -1;\n rep(i, n) {\n ll a;\n cin >> a;\n count(cnt_e, sum_e, a, sign_e);\n count(cnt_o, sum_o, a, sign_o);\n }\n\n cout << min(cnt_e, cnt_o) << endl;\n}", "n = int(input())\nA = [int(i) for i in input().split()]\n\nans = 10**15\nfor i in range(2):\n c = 0\n S = 0\n for j in range(n):\n S += A[j]\n if i % 2 == j % 2 and S <= 0:\n c += abs(S)+1\n S = 1\n elif i % 2 != j % 2 and S >= 0:\n c += S+1\n S = -1\n ans = min(ans, c)\nprint(ans)\n", "#include<bits/stdc++.h>\n#define rep(i,a,n) for (int i = a;i < n;i++)\n#define per(i,n,a) for (int i = n-1;i >= a;i--)\nusing namespace std;\n\nlong long n,a[100010];\nlong long c1=0,c2=0,sum=0,c=1;\n\nint main() {\n cin >> n;\n rep(i, 0, n) {\n cin >> a[i];\n }\n // 奇数番目を正\n rep(i, 0, n) {\n sum += a[i];\n if (sum * c <= 0) {\n c1 += (abs(sum) + 1);\n sum = c;\n }\n c *= -1;\n }\n // 偶数番目が正\n c = -1;\n sum = 0;\n rep(i, 0, n) {\n sum += a[i];\n if (sum * c <= 0) {\n c2 += abs(sum) + 1;\n sum = c;\n }\n c *= (-1);\n }\n cout << min(c1, c2) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i,n) for(int i=0;i<(n);i++)\nint main(){\n int N;\n cin>>N;\n vector<ll> A(N);\n rep(i,N) cin>>A[i];\n ll ans1=0,ans2=0,sum=0;\n rep(i,N){\n sum+=A[i];\n if(i%2==0&&sum<=0){\n ans1+=1-sum;\n sum=1;\n }\n else if(i%2!=0&&sum>=0){\n ans1+=sum+1;\n sum=-1;\n }\n }\n sum=0;\n rep(i,N){\n sum+=A[i];\n if(i%2==0&&sum>=0){\n ans2+=sum+1;\n sum=-1;\n }\n else if(i%2!=0&&sum<=0){\n ans2+=1-sum;\n sum=1;\n }\n }\n cout<<min(ans1,ans2)<<endl;\n}", "#059_C\nn=int(input())\na=list(map(int,input().split()))\n\ndef search(x):#x=0,1\n tmp=0\n cnt=0\n for i in range(n):\n tmp+=a[i]\n if i%2==x:\n if tmp<=0:\n cnt+=1-tmp\n tmp=1 \n else:\n if tmp>=0:\n cnt+=tmp+1\n tmp=-1\n return cnt\n\nprint(min(search(0),search(1)))", "N = int(input())\nA = tuple(map(int, input().split(\" \")))\n\nm = 0\nc = 0\nfor i in range(N):\n\tm += A[i]\n\t# print(m)\n\tif i%2 == 0:\n\t\tif m <= 0:\n\t\t\tc += abs(m)+1\n\t\t\tm += abs(m)+1\n\telse:\n\t\tif m >= 0:\n\t\t\tc += m+1\n\t\t\tm -= m+1\n\t# print(m, c)\n# print(c)\n\nm = 0\nd = 0\nfor i in range(N):\n\tm += A[i]\n\t# print(m)\n\tif i%2 == 1:\n\t\tif m <= 0:\n\t\t\td += abs(m)+1\n\t\t\tm += abs(m)+1\n\telse:\n\t\tif m >= 0:\n\t\t\td += m+1\n\t\t\tm -= m+1\n\t# print(m, d)\n\nprint(min(c, d))", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc=new Scanner(System.in);\n\n\t\tint n=sc.nextInt();\n\t\t\n\t\tint[] a=new int[n];\n\t\t\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i]=sc.nextInt();\n\t\t}\n\t\t\n\t\t//偶数を正とする\n\t\tlong counter=0;\n\t\t\n\t\tlong sum=0;\n\t\t\n\t\tfor(int i=0;i<n;i++) {\n\t\t\t\n\t\t\tsum+=a[i];\n\t\t\t\n\t\t\tif(i%2==0 && sum<=0) {\n\t\t\t\t\n\t\t\t\t//-aだったら+1の操作をa回で0になり\n\t\t\t\t//正にするならそこからさらに+1\n\t\t\t\t\n\t\t\t\tcounter+=Math.abs(sum)+1;\n\t\t\t\tsum=1;\n\t\t\t\t\n\t\t\t}else if(i%2==1 && sum>=0){\n\t\t\t\t\n\t\t\t\t//+aだったらa回の-1と1回の-1でマイナス\n\t\t\t\tcounter+=sum+1;\n\t\t\t\tsum=-1;\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t}\n\t\t\n\t\tlong counter1=0;\n\t\tlong sum1=0;\n\t\t\n\t\t\n\t\t\n\t\t//奇数を正\n\t\tfor(int i=0;i<n;i++) {\n\t\t\t\n\t\t\tsum1+=a[i];\n\t\t\t\n\t\t\tif(i%2==0 && sum1>=0) {\n\t\t\t\t\n\t\t\t\t//+aだったらa回の-1と1回の-1でマイナス\n\t\t\t\tcounter1+=sum1+1;\n\t\t\t\tsum1=-1;\n\t\t\t\t\n\t\t\t}else if(i%2==1 && sum1<=0){\n\t\t\t\t//-aだったら+1の操作をa回で0になり\n\t\t\t\t//正にするならそこからさらに+1\n\t\t\t\t\n\t\t\t\tcounter1+=Math.abs(sum1)+1;\n\t\t\t\tsum1=1;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(Math.min(counter,counter1));\n\n\n\t}\n\t\n\t\n}\n", "n = int(raw_input())\nl = map(int, raw_input().split())\nsp = 0\np = 0\nsm = 0\nm = 0\npflg = True\nfor i in l:\n sp += i\n if pflg and sp <= 0:\n p += abs(sp) + 1\n sp = 1\n elif not pflg and sp >= 0:\n p += abs(sp) + 1\n sp = -1\n sm += i\n if pflg and sm >= 0:\n m += abs(sm) + 1\n sm = -1\n elif not pflg and sm <= 0:\n m += abs(sm) + 1\n sm = 1\n pflg = not pflg\nprint min(p,m)\n", "N = int(input())\n*A, = map(int,input().split())\nans1 = 0\nS = A[0]\nif S <= 0:\n ans1 = abs(S)+1\n S = 1\nfor a in A[1:]:\n S1 = S+a\n if S1*S >= 0:\n ans1 += abs(S1)+1\n S1 = -S//abs(S)\n S = S1\nans2 = 0\nS = A[0]\nif S >= 0:\n ans2 = abs(S)+1\n S = -1\nfor a in A[1:]:\n S1 = S+a\n if S1*S >= 0:\n ans2 += abs(S1)+1\n S1 = -S//abs(S)\n S = S1\nprint(min(ans1,ans2))", "#include <bits/stdc++.h>\nusing namespace std;\n\nlong f(vector<int>& A, int s) {\n long acc = 0, ans = 0;\n for (int i = 0; i < A.size(); i++) {\n acc += A[i];\n if (acc == 0 || s != ((acc < 0) ? -1 : 1)) {\n int d = abs(acc) + 1;\n acc += s * d;\n ans += d;\n }\n s *= (-1);\n }\n return ans;\n}\n\nint main() {\n int n;\n cin >> n;\n vector<int> A(n);\n for (int i = 0; i < n; i++) {\n cin >> A[i];\n }\n\n long ans1 = f(A, 1);\n long ans2 = f(A, -1);\n cout << min(ans1, ans2) << endl;\n}", "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n \n long a1 = solve(true, a);\n long a2 = solve(false, a);\n \n System.out.println(Math.min(a1, a2));\n }\n \n private static long solve(boolean evenPlus, int[] a) {\n \n long ans = 0;\n long sum = 0;\n for (int i = 0; i < a.length; i++) {\n sum += a[i];\n if (((evenPlus && i%2 == 0)\n || (!evenPlus && i%2 == 1))\n && sum <= 0) {\n long diff = 1 - sum;\n sum += diff;\n ans += diff;\n } else if (((evenPlus && i%2 == 1)\n || (!evenPlus && i%2 == 0))\n && sum >= 0) {\n long diff = sum + 1;\n sum -= diff;\n ans += diff;\n }\n }\n return ans;\n }\n}", "#include <iostream>\n#include <string>\n#include <vector>\n#include <stdio.h>\n#include <algorithm>\n#include <functional>\n#include <math.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll chk(ll a[], int N, bool t)\n{\n ll total = 0;\n ll ops = 0;\n for (int i = 0; i < N; i++) {\n total += a[i];\n if (t == true && (total < 1)) {\n ops += (1-total);\n total = 1;\n } else if (t == false && (total > -1)) {\n ops += (total+1);\n total = -1;\n }\n t = !t;\n }\n return ops;\n}\n\nint main ()\n{\n ll N;\n cin >> N;\n ll a[1000001];\n\n for (ll i = 0; i < N; i++) {\n cin >> a[i];\n }\n\n printf(\"%ld\\n\", min(chk(a, N, true), chk(a, N, false)));\n\n}\n\n\n", "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\ntypedef long long ll;\nusing namespace std;\n\nll n, a, s1, s2, c1, c2;\n\nint main() {\n cin >> n;\n for (int i = 0; i < n; i++) {\n cin >> a;\n s1 += a;\n s2 += a;\n if (i % 2) {\n if (s1 <= 0) c1 += 1 - s1, s1 = 1;\n if (s2 >= 0) c2 += 1 + s2, s2 = -1;\n }\n else {\n if (s1 >= 0) c1 += 1 + s1, s1 = -1;\n if (s2 <= 0) c2 += 1 - s2, s2 = 1;\n }\n }\n\n cout << min(c1, c2) << endl;\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main(void){\n\tint n;\n\tcin >> n;\n\tint a[n+1];\n\tint i;\n\tlong long ans=0,ans2=0;\n\ta[0] = 0;\n\tfor(i=1;i<=n;i++)cin >> a[i];\n\t//1 3 5 7 9を+にする場合\n\tlong long b = 0;//bはそれまでの合計値\n\tfor(i=1;i<=n;i++){\n\t\tb += a[i];\n\t\tif(i%2==1){\n\t\t\tif(b>0){\n\t\t\t}else{\n\t\t\t\tans += abs(1-b);\n\t\t\t\tb = 1;\n\t\t\t}\n\t\t}else{\n\t\t\tif(b<0){\n\t\t\t}else{\n\t\t\t\tans += abs(-1-b);\n\t\t\t\tb = -1;\n\t\t\t}\n\t\t}\n\t}\n\t//1 3 5 7を-にする場合\n\tb = 0;\n\tfor(i=1;i<=n;i++){\n\t\tb += a[i];\n\t\tif(i%2==0){\n\t\t\tif(b>0){\n\t\t\t}else{\n\t\t\t\tans2 += abs(1-b);\n\t\t\t\tb = 1;\n\t\t\t}\n\t\t}else{\n\t\t\tif(b<0){\n\t\t\t}else{\n\t\t\t\tans2 += abs(-1-b);\n\t\t\t\tb = -1;\n\t\t\t}\n\t\t}\n\t}\n\tcout << min(ans,ans2);\n\treturn 0;\n}", "n = int(input())\na = list(map(int,input().split()))\n\ncnt = 0\ns = 0\nfor i in range(n):\n #偶数インデックスをプラスにする\n s+=a[i]\n if i%2 and s>=0:\n cnt+=s+1\n s = -1\n elif i%2==0 and s<=0:\n cnt+=1-s\n s = 1\nans = cnt\ncnt = 0\ns = 0\nfor i in range(n):\n #偶数インデックスをマイナスにする\n s+=a[i]\n if i%2==0 and s>=0:\n cnt+=s+1\n s = -1\n elif i%2 and s<=0:\n cnt+=1-s\n s = 1\nans = min(ans,cnt)\nprint(ans)", "def main():\n n = input()\n\n a_s = list(map(int, input().split()))\n\n ans = 10 ** 20\n for i in [-1, 1]:\n total = 0\n op_num = 0\n\n for a_i in a_s:\n total += a_i\n\n if total * i <= 0:\n op_num += abs(total - i)\n total = i\n \n i *= -1\n\n ans = min(ans, op_num)\n print(ans)\n \n\nmain() \n \n\n\n", "N=int(input())\nA=[int(x) for x in input().split()]\n\nans=0\ns=0\nfor i in range(N):\n s+=A[i]\n if i % 2 ==0:\n if s<=0:\n ans+=(abs(s)+1)\n s=1\n else:\n if s>=0:\n ans+=(abs(s)+1)\n s=-1\n\nans2=0\ns2=0\nfor i in range(N):\n s2+=A[i]\n if i % 2 ==0:\n if s2>=0:\n ans2+=(abs(s2)+1)\n s2=-1\n else:\n if s2<=0:\n ans2+=(abs(s2)+1)\n s2=1\nprint(min(ans,ans2))", "#include <bits/stdc++.h>\n#include<iostream>\n#include<vector>\n#include <cmath>\n#include <map>\n#include <algorithm>\n#include <string>\n#define rep(i, n) for (int i = 0; i < n; ++i)\nusing ll = long long;\nusing namespace std;\n#define P pair<int, int>\nint main () {\n ll n ;\n cin >> n ;\n ll A[n] ;\n ll a,now1=0,cnt1=0,now2=0,cnt2=0;\n for(int i = 0 ; i < n ; i++){\n cin >> A[i] ;\n }\n rep(i,n) {\n now1 += A[i];\n now2 += A[i];\n if (now1<=0) {\n cnt1+=abs(now1)+1;now1=1;\n }\n if (now2>=0) {\n cnt2+=abs(now2)+1;now2=-1;\n }\n swap(now1,now2);swap(cnt1,cnt2);\n }\n cout << min(cnt1,cnt2) << endl;\n return 0 ;\n}\n\n \n", "n = int(input())\na = list(map(int, input().split()))\n\ndef calc(sgn):\n ans = 0\n sum = 0\n for ai in a:\n sum += ai\n sgn *= -1\n if sum == 0:\n ans += 1\n sum = sgn\n elif sum * sgn < 0:\n ans += abs(sum) + 1\n sum = sgn\n return ans\n\nprint(min(calc(1), calc(-1)))\n" ]
Aoki is in search of Takahashi, who is missing in a one-dimentional world. Initially, the coordinate of Aoki is 0, and the coordinate of Takahashi is known to be x, but his coordinate afterwards cannot be known to Aoki. Time is divided into turns. In each turn, Aoki and Takahashi take the following actions simultaneously: * Let the current coordinate of Aoki be a, then Aoki moves to a coordinate he selects from a-1, a and a+1. * Let the current coordinate of Takahashi be b, then Takahashi moves to the coordinate b-1 with probability of p percent, and moves to the coordinate b+1 with probability of 100-p percent. When the coordinates of Aoki and Takahashi coincide, Aoki can find Takahashi. When they pass by each other, Aoki cannot find Takahashi. Aoki wants to minimize the expected number of turns taken until he finds Takahashi. Find the minimum possible expected number of turns. Constraints * 1 ≦ x ≦ 1,000,000,000 * 1 ≦ p ≦ 100 * x and p are integers. Input The input is given from Standard Input in the following format: x p Output Print the minimum possible expected number of turns. The output is considered correct if the absolute or relative error is at most 10^{-6}. Examples Input 3 100 Output 2.0000000 Input 6 40 Output 7.5000000 Input 101 80 Output 63.7500000
[ "import java.io.IOException; \nimport java.io.InputStream; \nimport java.io.PrintWriter; \nimport java.util.*; \n \n\nclass Main{ \n\n\tstatic void solve(){\n\t\tint x = ni();\n\t\tdouble p = ni()/100.0;\n\t\tdouble ans = 0;\n\t\tif(x%2==0)ans=(double)x/(2*p);\n\t\telse{\n\t\t\tans=1;\n\t\t\tans += (x-1)/2;\n\t\t\tans += ((1-p)*((double)x+1))/(p*2);\n\t\t}\n\t\tout.println(ans);\n \n\t} \n \n \n \n \n\t public static void main(String[] args){ \n\t\t solve(); \n\t\t out.flush(); \n\t } \n\t private static InputStream in = System.in; \n\t private static PrintWriter out = new PrintWriter(System.out); \n \n\t static boolean inrange(int y, int x, int h, int w){ \n\t\t return y>=0 && y<h && x>=0 && x<w; \n\t } \n\t @SuppressWarnings(\"unchecked\") \n\t static<T extends Comparable> int lower_bound(List<T> list, T key){ \n\t\t int lower=-1;int upper=list.size(); \n\t\t while(upper - lower>1){ \n\t\t int center =(upper+lower)/2; \n\t\t if(list.get(center).compareTo(key)>=0)upper=center; \n\t\t else lower=center; \n\t\t } \n\t\t return upper; \n\t } \n\t @SuppressWarnings(\"unchecked\") \n\t static <T extends Comparable> int upper_bound(List<T> list, T key){ \n\t\t int lower=-1;int upper=list.size(); \n\t\t while(upper-lower >1){ \n\t\t int center=(upper+lower)/2; \n\t\t if(list.get(center).compareTo(key)>0)upper=center; \n\t\t else lower=center; \n\t\t } \n\t\t return upper; \n\t } \n\t @SuppressWarnings(\"unchecked\") \n\t static <T extends Comparable> boolean next_permutation(List<T> list){ \n\t\t int lastIndex = list.size()-2; \n\t\t while(lastIndex>=0 && list.get(lastIndex).compareTo(list.get(lastIndex+1))>=0)--lastIndex; \n\t\t if(lastIndex<0)return false; \n\t\t int swapIndex = list.size()-1; \n\t\t while(list.get(lastIndex).compareTo(list.get(swapIndex))>=0)swapIndex--; \n\t\t T tmp = list.get(lastIndex); \n\t\t list.set(lastIndex++, list.get(swapIndex)); \n\t\t list.set(swapIndex, tmp); \n\t\t swapIndex = list.size()-1; \n\t\t while(lastIndex<swapIndex){ \n\t\t tmp = list.get(lastIndex); \n\t\t list.set(lastIndex, list.get(swapIndex)); \n\t\t list.set(swapIndex, tmp); \n\t\t ++lastIndex;--swapIndex; \n\t\t } \n\t\t return true; \n\t } \n\t private static final byte[] buffer = new byte[1<<15]; \n\t private static int ptr = 0; \n\t private static int buflen = 0; \n\t private static boolean hasNextByte(){ \n\t\t if(ptr<buflen)return true; \n\t\t ptr = 0; \n\t\t try{ \n\t\t\t buflen = in.read(buffer); \n\t\t } catch (IOException e){ \n\t\t\t e.printStackTrace(); \n\t\t } \n\t\t return buflen>0; \n\t } \n\t private static int readByte(){ if(hasNextByte()) return buffer[ptr++]; else return -1;} \n\t private static boolean isSpaceChar(int c){ return !(33<=c && c<=126);} \n\t private static int skip(){int res; while((res=readByte())!=-1 && isSpaceChar(res)); return res;} \n \n\t private static double nd(){ return Double.parseDouble(ns()); } \n\t private static char nc(){ return (char)skip(); } \n\t private static String ns(){ \n\t\t StringBuilder sb = new StringBuilder(); \n\t\t for(int b=skip();!isSpaceChar(b);b=readByte())sb.append((char)b); \n\t\t return sb.toString(); \n\t } \n\t private static int[] nia(int n){ \n\t\t int[] res = new int[n]; \n\t\t for(int i=0;i<n;++i)res[i]=ni(); \n\t\t return res; \n\t } \n\t private static long[] nla(int n){ \n\t\t long[] res = new long[n]; \n\t\t for(int i=0;i<n;++i)res[i]=nl(); \n\t\t return res; \n\t } \n\t private static int ni(){ \n\t\t int res=0,b; \n\t\t boolean minus=false; \n\t\t while((b=readByte())!=-1 && !((b>='0'&&b<='9') || b=='-')); \n\t\t if(b=='-'){ \n\t\t\t minus=true; \n\t\t\t b=readByte(); \n\t\t } \n\t\t for(;'0'<=b&&b<='9';b=readByte())res=res*10+(b-'0'); \n\t\t return minus ? -res:res; \n\t } \n\t private static long nl(){ \n\t\t long res=0,b; \n\t\t boolean minus=false; \n\t\t while((b=readByte())!=-1 && !((b>='0'&&b<='9') || b=='-')); \n\t\t if(b=='-'){ \n\t\t\t minus=true; \n\t\t\t b=readByte(); \n\t\t } \n\t\t for(;'0'<=b&&b<='9';b=readByte())res=res*10+(b-'0'); \n\t\t return minus ? -res:res; \n\t} \n} \n\n", "#include <bits/stdc++.h>\n#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))\n#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<int, lint> pil;\ntypedef pair<lint, lint> pll;\ntemplate<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}\ntemplate<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}\ntemplate<class T> T div_floor(T a, T b){\n if(b < 0) a *= -1, b *= -1;\n return a>=0 ? a/b : (a+1)/b-1;\n}\ntemplate<class T> T div_ceil(T a, T b){\n if(b < 0) a *= -1, b *= -1;\n return a>0 ? (a-1)/b+1 : a/b;\n}\n\nconstexpr lint mod = 1e9+7;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 100010;\n\ndouble p;\n\ndouble E(int d){\n if(d % 2 == 1) return 1 + p*E(d-1) + (1-p)*E(d+1);\n else return 1/p * d/2;\n}\n\nint main(){\n int x, t;\n scanf(\"%d%d\", &x, &t);\n p = 1.0*t / 100;\n printf(\"%.20lf\\n\", E(x));\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define all(x) (x).begin(), (x).end()\n\ntypedef long long ll;\n\nvoid solve() {\n int n; double p; cin >> n >> p;\n p = p / 100.0;\n n = (n + 1) / 2;\n cout << double(n) / p;\n}\n\n// CHECK LIMITS (n <= 10^5)\n// CHECK CORNER CASES (n == 1)\n\nint main() {\n ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);\n cout.setf(ios::fixed), cout.precision(20);\n //cout << 1.0 * clock() / CLOCKS_PER_SEC << endl;\n solve();\n}\n", "#!/usr/bin/env python3\nimport math\nx = int(input())\np = int(input())/100\nprint(math.ceil(x / 2) / p)\n", "\npublic class Main {\n private static void solve() {\n long x = nl();\n double p = nd() / 100;\n \n double ret = 0;\n if (x % 2 == 0) {\n ret = f(x, p);\n } else {\n ret = (f(x - 1, p) * p + f(x + 1, p) * (1.0 - p)) + 1;\n }\n System.out.println(ret);\n }\n \n private static double f(long x, double p) {\n return x / p / 2;\n }\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = args.length > 0 ? args[0] : null;\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n", "#include<bits/stdc++.h>\n#define FOR(i, n, m) for(int i = n; i < (int)m; i++)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define pb push_back\nusing namespace std;\nusing ll = std::int_fast64_t;\nusing ld = long double;\nusing P = pair<ll, ll>;\nconstexpr ll inf = 1000000000;\nconstexpr ll mod = 1000000007;\nconstexpr long double eps = 1e-15;\ntemplate<typename T1, typename T2>\nostream& operator<<(ostream& os, pair<T1, T2> p) {\n\tos << to_string(p.first) << \" \" << to_string(p.second);\n\treturn os;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, vector<T>& v) {\n\tREP(i, v.size()) {\n\t\tif(i) os << \" \";\n\t\tos << to_string(v[i]);\n\t}\n\treturn os;\n}\n\n/*\ntemplate<typename T>\nstruct Treap {\n\tdouble drand() { // random number in [0, 1]\n\t\tstatic random_device rd;\n\t\tstatic mt19937 mt(rd());\n\t\treturn (unsigned)mt() / (double)numeric_limits<unsigned>::max();\n\t}\n\tT v;\n\tdouble p;\n\tint cnt;\n\tTreap* lch;\n\tTreap* rch;\n\tTreap(T v) : v(v), p(drand()), cnt(1), lch(NULL), rch(NULL) { }\n\tTreap* update() {\n\t\tthis->size = size(this->lch) + size(this->rch) + 1;\n\t\treturn this;\n\t}\n\tstatic int size(Treap* t) {\n\t\tif(!t) return 0;\n\t\telse return t->cnt;\n\t}\n\tstatic Treap* merge(Treap* l, Treap* r) {\n\t\tif(!l || !r) {\n\t\t\tif(!l) return r;\n\t\t\telse return l;\n\t\t}\n\t\tif(l->p >= r->p) {\n\t\t\tl->rch = merge(l->rch, r);\n\t\t\treturn l->update();\n\t\t} else {\n\t\t\tr->lch = merge(r->lch, l);\n\t\t\treturn r->update();\n\t\t}\n\t}\n\tstatic pair<Treap*, Treap*> split(Treap* t, int k) {\n\t\t// split [0, k) and [k, n)\n\t\tif(k == 0) return {NULL, t};\n\t\tif(!(t->l)) {\n\t\t\tauto tmp = split(t->r, k - 1);\n\t\t\tt->r = tmp.first;\n\t\t\treturn {t->update(), tmp.second};\n\t\t} else if(!(t->r)) {\n\t\t\tauto tmp = split(t->r, k - 1);\n\t\t\tt->r = tmp.first;\n\t\t\treturn {t->update(), tmp.second};\n\t\t} else {\n\n\t\t}\n\t}\n\tTreap* insert() {\n\t}\n\tTreap* erase() {\n\t}\n\tT operator[](int k) {\n\t}\n};\n*/\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint x, p;\n\tcin >> x >> p;\n\tld ans = 0;\n\tif(x % 2) {\n\t\tans += 1;\n\t\tans += p / (ld)100 * (100 / (ld)p * ((x - 1) / 2))\n\t\t + (100 - p) / (ld)100 * (100 / (ld)p * ((x + 1) / 2));\n\t} else {\n\t\tans = 100 / (ld)p * (x / 2);\n\t}\n\tcout << fixed << setprecision(39) << ans << endl;\n\treturn 0;\n}\n// ---------------------------------------\n", "//todo 文字数を少なくする\n\n//#pragma GCC optimize (\"-O3\")\n#include <bits/stdc++.h>\nusing namespace std;\n//@起動時\nstruct initon {\n initon() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(16);\n srand((unsigned) clock() + (unsigned) time(NULL));\n };\n} __initon;\n//衝突対策\n#define ws ___ws\n\n//@必須構造\nstruct T {\n int f, s, t;\n T() { f = -1, s = -1, t = -1; }\n T(int f, int s, int t) : f(f), s(s), t(t) {}\n bool operator<(const T &r) const {\n return f != r.f ? f < r.f : s != r.s ? s < r.s : t < r.t;\n //return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 大きい順\n }\n bool operator>(const T &r) const {\n return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t;\n //return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 小さい順\n }\n bool operator==(const T &r) const {\n return f == r.f && s == r.s && t == r.t;\n }\n bool operator!=(const T &r) const {\n return f != r.f || s != r.s || t != r.t;\n }\n int operator[](int i) {\n assert(i < 3);\n return i == 0 ? f : i == 1 ? s : t;\n }\n};\nstruct F {\n int a, b, c, d;\n F() { a = -1, b = -1, c = -1, d = -1; }\n F(int a, int b, int c, int d) : a(a), b(b), c(c), d(d) {}\n bool operator<(const F &r) const {\n return a != r.a ? a < r.a : b != r.b ? b < r.b : c != r.c ? c < r.c : d < r.d;\n// return a != r.a ? a > r.a : b != r.b ? b > r.b : c != r.c ? c > r.c : d > r.d;\n }\n bool operator>(const F &r) const {\n return a != r.a ? a > r.a : b != r.b ? b > r.b : c != r.c ? c > r.c : d > r.d;\n// return a != r.a ? a < r.a : b != r.b ? b < r.b : c != r.c ? c < r.c : d < r.d;\n }\n bool operator==(const F &r) const {\n return a == r.a && b == r.b && c == r.c && d == r.d;\n }\n bool operator!=(const F &r) const {\n return a != r.a || b != r.b || c != r.c || d != r.d;\n }\n int operator[](int i) {\n assert(i < 4);\n return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;\n }\n};\n\nT mt(int a, int b, int c) {\n return T(a, b, c);\n}\n//@マクロ省略系 型,構造\n\n#define int long long\n#define ll long long\n#define double long double\n#define ull unsigned long long\nusing dou = double;\nusing itn = int;\nusing str = string;\nusing bo= bool;\n#define au auto\nusing P = pair<ll, ll>;\n\n#define fi first\n#define se second\n#define vec vector\n#define beg begin\n#define rbeg rbegin\n#define con continue\n#define bre break\n#define brk break\n#define is ==\n\n\n//マクロ省略系 コンテナ\n\nusing vi = vector<int>;\n#define _overloadvvi(_1, _2, _3, _4, name, ...) name\n#define vvi0() vec<vi>\n#define vvi1(a) vec<vi> a\n#define vvi2(a, b) vec<vi> a(b)\n#define vvi3(a, b, c) vec<vi> a(b,vi(c))\n#define vvi4(a, b, c, d) vec<vi> a(b,vi(c,d))\n#define vvi(...) _overloadvvi(__VA_ARGS__,vvi4,vvi3,vvi2 ,vvi1,vvi0)(__VA_ARGS__)\n\n\nusing vl = vector<ll>;\n#define _overloadvvl(_1, _2, _3, _4, name, ...) name\n#define vvl1(a) vec<vl> a\n#define vvl2(a, b) vec<vl> a(b)\n#define vvl3(a, b, c) vec<vl> a(b,vl(c))\n#define vvl4(a, b, c, d) vec<vl> a(b,vl(c,d))\n#define vvl(...) _overloadvvl(__VA_ARGS__,vvl4,vvl3,vvl2 ,vvl1)(__VA_ARGS__)\n\nusing vb = vector<bool>;\n#define _overloadvvb(_1, _2, _3, _4, name, ...) name\n#define vvb1(a) vec<vb> a\n#define vvb2(a, b) vec<vb> a(b)\n#define vvb3(a, b, c) vec<vb> a(b,vb(c))\n#define vvb4(a, b, c, d) vec<vb> a(b,vb(c,d))\n#define vvb(...) _overloadvvb(__VA_ARGS__,vvb4,vvb3,vvb2 ,vvb1)(__VA_ARGS__)\n\nusing vs = vector<string>;\n#define _overloadvvs(_1, _2, _3, _4, name, ...) name\n#define vvs1(a) vec<vs> a\n#define vvs2(a, b) vec<vs> a(b)\n#define vvs3(a, b, c) vec<vs> a(b,vs(c))\n#define vvs4(a, b, c, d) vec<vs> a(b,vs(c,d))\n#define vvs(...) _overloadvvs(__VA_ARGS__,vvs4,vvs3,vvs2 ,vvs1)(__VA_ARGS__)\n\nusing vd = vector<double>;\n#define _overloadvvd(_1, _2, _3, _4, name, ...) name\n#define vvd1(a) vec<vd> a\n#define vvd2(a, b) vec<vd> a(b)\n#define vvd3(a, b, c) vec<vd> a(b,vd(c))\n#define vvd4(a, b, c, d) vec<vd> a(b,vd(c,d))\n#define vvd(...) _overloadvvd(__VA_ARGS__,vvd4,vvd3,vvd2 ,vvd1)(__VA_ARGS__)\n\nusing vc=vector<char>;\n#define _overloadvvc(_1, _2, _3, _4, name, ...) name\n#define vvc1(a) vec<vc> a\n#define vvc2(a, b) vec<vc> a(b)\n#define vvc3(a, b, c) vec<vc> a(b,vc(c))\n#define vvc4(a, b, c, d) vec<vc> a(b,vc(c,d))\n#define vvc(...) _overloadvvc(__VA_ARGS__,vvc4,vvc3,vvc2 ,vvc1)(__VA_ARGS__)\n\nusing vp = vector<P>;\n#define _overloadvvp(_1, _2, _3, _4, name, ...) name\n#define vvp1(a) vec<vp> a\n#define vvp2(a, b) vec<vp> a(b)\n#define vvp3(a, b, c) vec<vp> a(b,vp(c))\n#define vvp4(a, b, c, d) vec<vp> a(b,vp(c,d))\n\nusing vt = vector<T>;\n#define _overloadvvt(_1, _2, _3, _4, name, ...) name\n#define vvt1(a) vec<vt> a\n#define vvt2(a, b) vec<vt> a(b)\n#define vvt3(a, b, c) vec<vt> a(b,vt(c))\n#define vvt4(a, b, c, d) vec<vt> a(b,vt(c,d))\n\n#define v3i(a, b, c, d) vector<vector<vi>> a(b, vector<vi>(c, vi(d)))\n#define v3d(a, b, c, d) vector<vector<vd>> a(b, vector<vd>(c, vd(d)))\n#define v3m(a, b, c, d) vector<vector<vm>> a(b, vector<vm>(c, vm(d)))\n\n#define _vvi vector<vi>\n#define _vvl vector<vl>\n#define _vvb vector<vb>\n#define _vvs vector<vs>\n#define _vvd vector<vd>\n#define _vvc vector<vc>\n#define _vvp vector<vp>\n\n#define PQ priority_queue<ll, vector<ll>, greater<ll> >\n#define tos to_string\nusing mapi = map<int, int>;\nusing mapd = map<dou, int>;\nusing mapc = map<char, int>;\nusing maps = map<str, int>;\nusing seti = set<int>;\nusing setd = set<dou>;\nusing setc = set<char>;\nusing sets = set<str>;\nusing qui = queue<int>;\n#define bset bitset\n#define uset unordered_set\n#define mset multiset\n#define umap unordered_map\n#define umapi unordered_map<int,int>\n#define umapp unordered_map<P,int>\n#define mmap multimap\n\n//マクロ 繰り返し\n#define _overloadrep(_1, _2, _3, _4, name, ...) name\n# define _rep(i, n) for(int i = 0,_lim=n; i < _lim ; i++)\n#define repi(i, m, n) for(int i = m,_lim=n; i < _lim ; i++)\n#define repadd(i, m, n, ad) for(int i = m,_lim=n; i < _lim ; i+= ad)\n#define rep(...) _overloadrep(__VA_ARGS__,repadd,repi,_rep,)(__VA_ARGS__)\n#define _rer(i, n) for(int i = n; i >= 0 ; i--)\n#define reri(i, m, n) for(int i = m,_lim=n; i >= _lim ; i--)\n#define rerdec(i, m, n, dec) for(int i = m,_lim=n; i >= _lim ; i-=dec)\n#define rer(...) _overloadrep(__VA_ARGS__,rerdec,reri,_rer,)(__VA_ARGS__)\n#define fora(a, b) for(auto&& a : b)\n#define forg(gi, ve) for (int gi = 0, f, t, c; gi < ve.size() && (f = ve[gi].f, t = ve[gi].t, c = ve[gi].c, true); gi++)\n#define fort(gi, ve) for (int gi = 0, f, t, c; gi < ve.size() && (f = ve[gi].f, t = ve[gi].t, c = ve[gi].c, true); gi++)if(t!=p)\n//#define fort(gi, ve) for (int gi = 0, f, t, c;gi<ve.size()&& (gi+= (ve[gi].t==p))< ve.size() && (f = ve[gi].f,t=ve[gi].t, c = ve[gi].c,true); gi++)\n\n//マクロ 定数\n#define k3 1010\n#define k4 10101\n#define k5 101010\n#define k6 1010101\n#define k7 10101010\nconst int inf = (int) 1e9 + 100;\nconst ll linf = (ll) 1e18 + 100;\nconst double eps = 1e-9;\nconst double PI = 3.1415926535897932384626433832795029L;\nll ma = numeric_limits<ll>::min();\nll mi = numeric_limits<ll>::max();\nconst int y4[] = {-1, 1, 0, 0};\nconst int x4[] = {0, 0, -1, 1};\nconst int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};\nconst int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};\n\n//マクロ省略形 関数等\n#define arsz(a) (sizeof(a)/sizeof(a[0]))\n#define sz(a) ((int)(a).size())\n#define rs resize\n#define mp make_pair\n#define pb push_back\n#define pf push_front\n#define eb emplace_back\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n\n//@拡張系 こう出来るべきというもの\n\n//埋め込み 存在を意識せずに機能を増やされているもの\nnamespace std {\n template<> class hash<std::pair<signed, signed>> {\n public:\n size_t operator()(const std::pair<signed, signed> &x) const {\n return hash<ll>()(((ll) x.first << 32) + x.second);\n }\n };\n template<> class hash<std::pair<ll, ll>> {\n public:\n //大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断\n size_t operator()(const std::pair<ll, ll> &x) const {\n return hash<ll>()(((ll) x.first << 32) + x.second);\n }\n };\n}\nistream &operator>>(istream &iss, P &a) {\n iss >> a.first >> a.second;\n return iss;\n}\ntemplate<typename T> istream &operator>>(istream &iss, vector<T> &vec) {\n for (T &x: vec) iss >> x;\n return iss;\n}\nostream &operator<<(ostream &os, P p) {\n os << p.fi << \" \" << p.se << endl;\n return os;\n}\nostream &operator<<(ostream &os, T p) {\n os << p.f << \" \" << p.s << \" \" << p.t;\n return os;\n}\nostream &operator<<(ostream &os, F p) {\n os << p.a << \" \" << p.b << \" \" << p.c << \" \" << p.d;\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, vector <T> &vec) {\n for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\ntemplate<typename T> ostream &operator<<(ostream &os, vector <vector<T>> &vec) {\n for (int i = 0; i < vec.size(); i++) {\n for (int j = 0; j < vec[0].size(); j++) {\n os << vec[i][j];\n }\n os << endl;\n }\n return os;\n}\ntemplate<typename V, typename H> void resize(vector<V> &vec, const H head) { vec.resize(head); }\ntemplate<typename V, typename H, typename ... T> void resize(vector<V> &vec, const H &head, const T ... tail) {\n vec.resize(head);\n for (auto &v: vec) resize(v, tail...);\n}\ntemplate<typename T, typename _Pr> bool all_of(const vector<T> &vec, _Pr pred) { return std::all_of(vec.begin(), vec.end(), pred); }\ntemplate<typename T, typename _Pr> bool any_of(const vector<T> &vec, _Pr pred) { return std::any_of(vec.begin(), vec.end(), pred); }\ntemplate<typename T, typename _Pr> bool none_of(const vector<T> &vec, _Pr pred) { return std::none_of(vec.begin(), vec.end(), pred); }\ntemplate<typename T, typename _Pr> const typename vector<T>::const_iterator find_if(const vector<T> &vec, _Pr pred) { return std::find_if(vec.begin(), vec.end(), pred); }\ntemplate<typename T> bool contains(const vector<T> &vec, const T &val) { return std::find(vec.begin(), vec.end(), val) != vec.end(); }\ntemplate<typename T, typename _Pr> bool contains_if(const vector<T> &vec, _Pr pred) { return std::find_if(vec.begin(), vec.end(), pred) != vec.end(); }\ntemplate<class T> void replace(vector<T> &a, T key, T v) { replace(a.begin(), a.end(), key, v); }\ntemplate<class T> bool includes(vector<T> &a, vector<T> &b) {\n vi c = a;\n vi d = b;\n sort(all(c));\n sort(all(d));\n return includes(all(c), all(d));\n}\ntemplate<class T> bool is_permutation(vector<T> &a, vector<T> &b) { return is_permutation(all(a), all(b)); }\ntemplate<class T> bool next_permutation(vector<T> &a) { return next_permutation(all(a)); }\n\ntemplate<class T> T pop(set<T> &set) {\n T res = *set.begin();\n set.erase(set.find(res));\n return res;\n}\ntemplate<class T> T pop(mset<T> &set) {\n T res = *set.begin();\n set.erase(set.find(res));\n return res;\n}\ntemplate<class T> T popBack(set<T> &set) {\n T res = *set.rbegin();\n set.erase(set.find(res));\n return res;\n}\ntemplate<class T> T popBack(mset<T> &set) {\n T res = *set.rbegin();\n set.erase(set.find(res));\n return res;\n}\ninline void sort(string &a) { sort(a.begin(), a.end()); }\ntemplate<class T> inline void sort(vector<T> &a) { sort(a.begin(), a.end()); };\ntemplate<class T> inline void sort(vector<T> &a, int len) { sort(a.begin(), a.begin() + len); };\ntemplate<class T, class F> inline void sort(vector<T> &a, F f) { sort(a.begin(), a.end(), [&](T l, T r) { return f(l) < f(r); }); };\nenum ___pcomparator {\n fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd\n};\ninline void sort(vector<P> &a, ___pcomparator type) {\n switch (type) {\n case fisi:\n sort(all(a), [&](P l, P r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });\n break;\n case fisd:\n sort(all(a), [&](P l, P r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });\n break;\n case fdsi:\n sort(all(a), [&](P l, P r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });\n break;\n case fdsd:\n sort(all(a), [&](P l, P r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });\n break;\n case sifi:\n sort(all(a), [&](P l, P r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });\n break;\n case sifd:\n sort(all(a), [&](P l, P r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });\n break;\n case sdfi:\n sort(all(a), [&](P l, P r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });\n break;\n case sdfd:\n sort(all(a), [&](P l, P r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });\n break;\n }\n};\ninline void sort(vector<T> &a, ___pcomparator type) {\n switch (type) {\n case fisi:\n sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });\n break;\n case\n fisd:\n sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });\n break;\n case\n fdsi:\n sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });\n break;\n case\n fdsd:\n sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });\n break;\n case\n sifi:\n sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });\n break;\n case\n sifd:\n sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });\n break;\n case\n sdfi:\n sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });\n break;\n case\n sdfd:\n sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });\n break;\n }\n};\ntemplate<class T> inline void rsort(vector<T> &a) { sort(a.begin(), a.end(), greater<T>()); };\ntemplate<class T> inline void rsort(vector<T> &a, int len) { sort(a.begin(), a.begin() + len, greater<T>()); };\ntemplate<class U, class F> inline void rsort(vector<U> &a, F f) { sort(a.begin(), a.end(), [&](U l, U r) { return f(l) > f(r); }); };\ntemplate<class U> inline void sortp(vector<U> &a, vector<U> &b) {\n vp c;\n int n = sz(a);\n assert(n == sz(b));\n rep(i, n)c.eb(a[i], b[i]);\n sort(c);\n rep(i, n) {\n a[i] = c[i].first;\n b[i] = c[i].second;;\n }\n};\n//F = T<T>\n//例えばreturn p.fi + p.se;\ntemplate<class U, class F> inline void sortp(vector<U> &a, vector<U> &b, F f) {\n vp c;\n int n = sz(a);\n assert(n == sz(b));\n rep(i, n)c.eb(a[i], b[i]);\n sort(c, f);\n rep(i, n) {\n a[i] = c[i].first;\n b[i] = c[i].second;\n }\n};\ntemplate<class U, class F> inline void sortp(vector<U> &a, vector<U> &b, char type) {\n vp c;\n int n = sz(a);\n assert(n == sz(b));\n rep(i, n)c.eb(a[i], b[i]);\n sort(c, type);\n rep(i, n) {\n a[i] = c[i].first;\n b[i] = c[i].second;\n }\n};\ntemplate<class U> inline void rsortp(vector<U> &a, vector<U> &b) {\n vp c;\n int n = sz(a);\n assert(n == sz(b));\n rep(i, n)c.eb(a[i], b[i]);\n rsort(c);\n rep(i, n) {\n a[i] = c[i].first;\n b[i] = c[i].second;\n }\n};\ntemplate<class U, class F> inline void rsortp(vector<U> &a, vector<U> &b, F f) {\n vp c;\n int n = sz(a);\n assert(n == sz(b));\n rep(i, n)c.eb(a[i], b[i]);\n rsort(c, f);\n rep(i, n) {\n a[i] = c[i].first;\n b[i] = c[i].second;\n }\n};\ntemplate<class U> inline void sortt(vector<U> &a, vector<U> &b, vector<U> &c) {\n vt r;\n int n = sz(a);\n assert(n == sz(b));\n assert(n == sz(c));\n rep(i, n)r.eb(a[i], b[i], c[i]);\n sort(r);\n rep(i, n) {\n a[i] = r[i].f;\n b[i] = r[i].s;\n c[i] = r[i].t;\n }\n};\ntemplate<class U, class F> inline void sortt(vector<U> &a, vector<U> &b, vector<U> &c, F f) {\n vt r;\n int n = sz(a);\n assert(n == sz(b));\n assert(n == sz(c));\n rep(i, n)r.eb(a[i], b[i], c[i]);\n sort(r, f);\n rep(i, n) {\n a[i] = r[i].f;\n b[i] = r[i].s;\n c[i] = r[i].t;\n }\n};\ntemplate<class U, class F> inline void rsortt(vector<U> &a, vector<U> &b, vector<U> &c, F f) {\n vt r;\n int n = sz(a);\n assert(n == sz(b));\n assert(n == sz(c));\n rep(i, n)r.eb(a[i], b[i], c[i]);\n rsort(r, f);\n rep(i, n) {\n a[i] = r[i].f;\n b[i] = r[i].s;\n c[i] = r[i].t;\n }\n};\ntemplate<class T> inline void sort2(vector<vector<T>> &a) { for (int i = 0, n = a.size(); i < n; i++)sort(a[i]); }\ntemplate<class T> inline void rsort2(vector<vector<T>> &a) { for (int i = 0, n = a.size(); i < n; i++)rsort(a[i]); }\ntemplate<typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) { rep(i, N)a[i] = v; }\ntemplate<typename A, size_t N, size_t O, typename T> void fill(A (&a)[N][O], const T &v) { rep(i, N)rep(j, O)a[i][j] = v; }\ntemplate<typename A, size_t N, size_t O, size_t P, typename T> void fill(A (&a)[N][O][P], const T &v) { rep(i, N)rep(j, O)rep(k, P)a[i][j][k] = v; }\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, typename T> void fill(A (&a)[N][O][P][Q], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)a[i][j][k][l] = v; }\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, typename T> void fill(A (&a)[N][O][P][Q][R], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)a[i][j][k][l][m] = v; }\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S, typename T> void fill(A (&a)[N][O][P][Q][R][S], const T &v) { rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)rep(n, S)a[i][j][k][l][m][n] = v; }\n\ntemplate<typename V, typename T>\nvoid fill(V &xx, const T vall) {\n xx = vall;\n}\ntemplate<typename V, typename T>\nvoid fill(vector<V> &vecc, const T vall) {\n for (auto &&vx: vecc) fill(vx, vall);\n}\n\n//@汎用便利関数 入力\ntemplate<typename T = int> T _in() {\n T x;\n cin >> x;\n return (x);\n}\n#define _overloadin(_1, _2, _3, _4, name, ...) name\n#define in0() _in()\n#define in1(a) cin>>a\n#define in2(a, b) cin>>a>>b\n#define in3(a, b, c) cin>>a>>b>>c\n#define in4(a, b, c, d) cin>>a>>b>>c>>d\n#define in(...) _overloadin(__VA_ARGS__,in4,in3,in2 ,in1,in0)(__VA_ARGS__)\n\n#define _overloaddin(_1, _2, _3, _4, name, ...) name\n#define din1(a) int a;cin>>a\n#define din2(a, b) int a,b;cin>>a>>b\n#define din3(a, b, c) int a,b,c;cin>>a>>b>>c\n#define din4(a, b, c, d) int a,b,c,d;cin>>a>>b>>c>>d\n#define din(...) _overloadin(__VA_ARGS__,din4,din3,din2 ,din1)(__VA_ARGS__)\n\n#define _overloaddind(_1, _2, _3, _4, name, ...) name\n#define din1d(a) int a;cin>>a;a--\n#define din2d(a, b) int a,b;cin>>a>>b;a--,b--\n#define din3d(a, b, c) int a,b,c;cin>>a>>b>>c;a--,b--,c--\n#define din4d(a, b, c, d) int a,b,c,d;cin>>a>>b>>c>>d;;a--,b--,c--,d--\n#define dind(...) _overloaddind(__VA_ARGS__,din4d,din3d,din2d ,din1d)(__VA_ARGS__)\n\n\n#define _overloadout(_1, _2, _3, _4, name, ...) name\n#define out1(a) cout<<a<<endl\n#define out2(a, b) cout<<a<<\" \"<< b<<endl\n#define out3(a, b, c) cout<<a<<\" \"<<b<<\" \"<<c<<endl\n#define out4(a, b, c, d) cout<<a<<\" \"<<b<<\" \"<<c<<\" \"<<d<<endl\n#define out(...) _overloadout(__VA_ARGS__,out4,out3,out2,out1)(__VA_ARGS__)\n\n\nstring sin() { return _in<string>(); }\nll lin() { return _in<ll>(); }\n#define na(a, n) a.resize(n); rep(i,n) cin >> a[i];\n#define nao(a, n) a.resize(n+1); rep(i,n) cin >> a[i+1];\n#define nad(a, n) a.resize(n); rep(i,n){ cin >> a[i]; a[i]--;}\n#define na2(a, b, n) a.resize(n),b.resize(n);rep(i, n)cin >> a[i] >> b[i];\n#define na2d(a, b, n) a.resize(n),b.resize(n);rep(i, n){cin >> a[i] >> b[i];a[i]--,b[i]--;}\n#define na3(a, b, c, n) a.resize(n),b.resize(n),c.resize(n); rep(i, n)cin >> a[i] >> b[i] >> c[i];\n#define na3d(a, b, c, n) a.resize(n),b.resize(n),c.resize(n); rep(i, n){cin >> a[i] >> b[i] >> c[i];a[i]--,b[i]--,c[i]--;}\n#define nt(a, h, w) resize(a,h,w);rep(hi,h)rep(wi,w) cin >> a[hi][wi];\n#define ntd(a, h, w) rs(a,h,w);rep(hi,h)rep(wi,w) cin >> a[hi][wi], a[hi][wi]--;\n#define ntp(a, h, w) fill(a,'#');rep(hi,1,h+1)rep(wi,1,w+1) cin >> a[hi][wi];\n\n//デバッグ\n#define sp << \" \" <<\n\n#define debugName(VariableName) # VariableName\n\n#define _deb1(x) cerr << debugName(x)<<\" = \"<<x << endl\n#define _deb2(x, y) cerr << debugName(x)<<\" = \"<<x<<\", \"<< debugName(y)<<\" = \"<<y<< endl\n#define _deb3(x, y, z) cerr << debugName(x)<<\" = \"<<x << \", \" << debugName(y)<<\" = \"<<y <<\", \" debugName(z)<<\" = \"<<z <<endl\n#define _deb4(x, y, z, a) cerr << debugName(x)<<\" = \"<<x <<\", \" << debugName(y)<<\" = \"<<y <<\", \" << debugName(z)<<\" = \"<<z <<\", \" << debugName(a)<<\" = \"<<a<<endl\n#define _deb5(x, y, z, a, b) cerr << debugName(x)<<\" = \"<<x <<\", \" << debugName(y)<<\" = \"<<y <<\", \" << debugName(z)<<\" = \"<<z <<\", \" << debugName(a)<<\" = \"<<a<<\", \" << debugName(b)<<\" = \"<<b<<endl\n\n\n#define _overloadebug(_1, _2, _3, _4, _5, name, ...) name\n#define debug(...) _overloadebug(__VA_ARGS__,_deb5,_deb4,_deb3,_deb2,_deb1)(__VA_ARGS__)\n#define deb(...) _overloadebug(__VA_ARGS__,_deb5,_deb4,_deb3,_deb2,_deb1)(__VA_ARGS__)\n\n\n#define debugline(x) cerr << x << \" \" << \"(L:\" << __LINE__ << \")\" << '\\n'\n\n//よく使うクラス、構造体\nclass UnionFind {\npublic:\n vi par, rank, sizes;\n int n, trees;\n UnionFind(int n) : n(n), trees(n) {\n par.resize(n), rank.resize(n), sizes.resize(n);\n rep(i, n)par[i] = i, sizes[i] = 1;\n }\n int root(int x) {\n if (par[x] == x)return x;\n else return par[x] = root(par[x]);\n }\n int find(int x) { return root(x); }\n void unite(int x, int y) {\n x = root(x);\n y = root(y);\n if (x == y)return;\n if (rank[x] < rank[y])swap(x, y);\n trees--;\n par[y] = x;\n sizes[x] += sizes[y];\n if (rank[x] == rank[y])rank[x]++;\n }\n bool same(int x, int y) { return root(x) == root(y); }\n int size(int x) { return sizes[root(x)]; }\n //順不同 umapなので\n vec<vi> sets() {\n vec<vi> res(trees);\n umap<int, vi> map;\n rep(i, n) map[root(i)].push_back(i);\n int i = 0;\n for (auto &&p:map) {\n int r = p.fi;\n res[i].push_back(r);\n for (auto &&v:p.se) {\n if (r == v)continue;\n res[i].push_back(v);\n }\n i++;\n }\n return res;\n }\n};\n\nusing bint =__int128;\nstd::ostream &operator<<(std::ostream &dest, __int128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char *d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n\n__int128 toi128(string &s) {\n __int128 ret = 0;\n for (int i = 0; i < s.length(); i++)\n if ('0' <= s[i] && s[i] <= '9')\n ret = 10 * ret + s[i] - '0';\n return ret;\n}\n\n\ntemplate<typename T> T minv(T a, T m);\n\ntemplate<typename T>\nclass Modular {\npublic:\n using Type = typename decay<decltype(T::value)>::type;\n\n constexpr Modular() : value() {}\n template<typename U>\n Modular(const U &x) {\n value = normalize(x);\n }\n\n template<typename U>\n static Type normalize(const U &x) {\n Type v;\n if (-mod() <= x && x < mod()) v = static_cast<Type>(x);\n else v = static_cast<Type>(x % mod());\n if (v < 0) v += mod();\n return v;\n }\n\n const Type &operator()() const { return value; }\n template<typename U>\n explicit operator U() const { return static_cast<U>(value); }\n constexpr static Type mod() { return T::value; }\n\n Modular &operator+=(const Modular &other) {\n if ((value += other.value) >= mod()) value -= mod();\n return *this;\n }\n Modular &operator-=(const Modular &other) {\n if ((value -= other.value) < 0) value += mod();\n return *this;\n }\n template<typename U> Modular &operator+=(const U &other) { return *this += Modular(other); }\n template<typename U> Modular &operator-=(const U &other) { return *this -= Modular(other); }\n Modular &operator++() { return *this += 1; }\n Modular &operator--() { return *this -= 1; }\n Modular operator++(signed) {\n Modular result(*this);\n *this += 1;\n return result;\n }\n Modular operator--(signed) {\n Modular result(*this);\n *this -= 1;\n return result;\n }\n Modular operator-() const { return Modular(-value); }\n\n template<typename U = T>\n typename enable_if<is_same<typename Modular<U>::Type, signed>::value, Modular>::type &operator*=(const Modular &rhs) {\n#ifdef _WIN32\n uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);\n uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;\n asm(\n \"divl %4; \\n\\t\"\n : \"=a\" (d), \"=d\" (m)\n : \"d\" (xh), \"a\" (xl), \"r\" (mod())\n );\n value = m;\n#else\n value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));\n#endif\n return *this;\n }\n template<typename U = T>\n typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type &operator*=(const Modular &rhs) {\n int64_t q = static_cast<int64_t>(static_cast<double>(value) * rhs.value / mod());\n value = normalize(value * rhs.value - q * mod());\n return *this;\n }\n template<typename U = T>\n typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type &operator*=(const Modular &rhs) {\n value = normalize(value * rhs.value);\n return *this;\n }\n\n Modular &operator/=(const Modular &other) { return *this *= Modular(minv(other.value, mod())); }\n\n template<typename U>\n friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);\n\n template<typename U>\n friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);\n\n template<typename U>\n friend std::istream &operator>>(std::istream &stream, Modular<U> &number);\n\nprivate:\n Type value;\n};\n\ntemplate<typename T> bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) { return lhs.value == rhs.value; }\ntemplate<typename T, typename U> bool operator==(const Modular<T> &lhs, U rhs) { return lhs == Modular<T>(rhs); }\ntemplate<typename T, typename U> bool operator==(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) == rhs; }\n\ntemplate<typename T> bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) { return !(lhs == rhs); }\ntemplate<typename T, typename U> bool operator!=(const Modular<T> &lhs, U rhs) { return !(lhs == rhs); }\ntemplate<typename T, typename U> bool operator!=(U lhs, const Modular<T> &rhs) { return !(lhs == rhs); }\n\ntemplate<typename T> bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) { return lhs.value < rhs.value; }\n\ntemplate<typename T> Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) += rhs; }\ntemplate<typename T, typename U> Modular<T> operator+(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) += rhs; }\ntemplate<typename T, typename U> Modular<T> operator+(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) += rhs; }\n\ntemplate<typename T> Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) -= rhs; }\ntemplate<typename T, typename U> Modular<T> operator-(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) -= rhs; }\ntemplate<typename T, typename U> Modular<T> operator-(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) -= rhs; }\n\ntemplate<typename T> Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) *= rhs; }\ntemplate<typename T, typename U> Modular<T> operator*(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) *= rhs; }\ntemplate<typename T, typename U> Modular<T> operator*(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) *= rhs; }\n\ntemplate<typename T> Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) /= rhs; }\ntemplate<typename T, typename U> Modular<T> operator/(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) /= rhs; }\ntemplate<typename T, typename U> Modular<T> operator/(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) /= rhs; }\n\nconstexpr signed MOD = 1000000007;\nusing mint = Modular<std::integral_constant<decay<decltype(MOD)>::type, MOD>>;\n\nmint com(int n, int r) {\n const int NUM_ = 1400001;\n static ll fac[NUM_ + 1], finv[NUM_ + 1], inv[NUM_ + 1];\n if (fac[0] == 0) {\n inv[1] = fac[0] = finv[0] = 1;\n for (int i = 2; i <= NUM_; ++i) inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;\n for (int i = 1; i <= NUM_; ++i) fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n if (r < 0 || r > n) return 0;\n return mint(finv[r] * fac[n] % MOD * finv[n - r]);\n}\nmint ncr(int n, int r) { return com(n, r); }\nmint nhr(int n, int r) { return com(n + r - 1, r); }\n\n\ntemplate<typename T> T minv(T a, T m) {\n T u = 0, v = 1;\n while (a != 0) {\n T t = m / a;\n m -= t * a;\n swap(a, m);\n u -= t * v;\n swap(u, v);\n }\n assert(m == 1);\n return u;\n}\n\ntemplate<typename T, typename U> Modular<T> mpow(const Modular<T> &a, const U &b) {\n assert(b >= 0);\n int x = a(), res = 1;\n U p = b;\n while (p > 0) {\n if (p & 1) (res *= x) %= MOD;\n (x *= x) %= MOD;\n p >>= 1;\n }\n return res;\n}\ntemplate<typename T, typename U> Modular<T> mpow(const T &a, const U &b) {\n assert(b >= 0);\n int x = a, res = 1;\n U p = b;\n while (p > 0) {\n if (p & 1) (res *= x) %= MOD;\n (x *= x) %= MOD;\n p >>= 1;\n }\n return res;\n}\ntemplate<typename T> string to_string(const Modular<T> &number) {\n return to_string(number());\n}\n\ntemplate<typename T> std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {\n return stream << number();\n}\n\ntemplate<typename T> std::istream &operator>>(std::istream &stream, Modular<T> &number) {\n typename common_type<typename Modular<T>::Type, int64_t>::type x;\n stream >> x;\n number.value = Modular<T>::normalize(x);\n return stream;\n}\n\nusing PM = pair<mint, mint>;\nusing vm = vector<mint>;\n#define _overloadvvm(_1, _2, _3, _4, name, ...) name\n\n\n#define vvm1(a) vec<vm> a\n#define vvm2(a, b) vec<vm> a(b)\n#define vvm3(a, b, c) vec<vm> a(b,vm(c))\n#define vvm4(a, b, c, d) vec<vm> a(b,vm(c,d))\n#define vvm(...) _overloadvvm(__VA_ARGS__,vvm4,vvm3,vvm2 ,vvm1)(__VA_ARGS__)\n\nvb isPrime;\nvi primes;\n\nvoid setPrime() {\n int len = 4010101;\n isPrime.resize(4010101);\n fill(isPrime, true);\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i <= sqrt(len) + 5; ++i) {\n if (!isPrime[i])continue;\n for (int j = 2; i * j < len; ++j) {\n isPrime[i * j] = false;\n }\n }\n rep(i, len)if (isPrime[i])primes.pb(i);\n}\n//幾何 Pをcomplexとして扱う\nbool eq(double a, double b) { return fabs(a - b) < eps; }\nusing C =complex<double>;\nC rot(C &a, dou th) { return a * C(cos(th), sin(th)); }\ndou inpro(C &a, C &b) { return real(a * conj(b)); }\n\n//90度回転させて内積が0なら平行\nbool line(C a, C b, C c) {\n C ab = b - a;\n C ac = c - a;\n //複素数の掛け算は回転\n ab *= C(0, 1);\n return eq(inpro(ab, ac), 0);\n}\nbool line(P a, P b, P c) { return line(C(a.fi, a.se), C(b.fi, b.se), C(c.fi, c.se)); }\n\nbool line(int xa, int ya, int xb, int yb, int xc, int yc) {\n C a = C(xa, ya);\n C b = C(xb, yb);\n C c = C(xc, yc);\n return line(a, b, c);\n}\n//便利関数\n\n//テスト用\nchar ranc() {\n return (char) ('a' + rand() % 26);\n}\nint rand(int min, int max) {\n assert(min <= max);\n if (min >= 0 && max >= 0) {\n return rand() % (max + 1 - min) + min;\n } else if (max < 0) {\n return -rand(-max, -min);\n } else {\n //+\n if (rand() % 2) {\n return rand(0, max);\n //-\n } else {\n return -rand(0, -min);\n }\n }\n}\nvi ranv(int n, int min, int max) {\n vi v(n);\n rep(i, n)v[i] = rand(min, max);\n return v;\n}\n//単調増加\nvi ranvi(int n, int min, int max) {\n vi v(n);\n bool bad = 1;\n while (bad) {\n bad = 0;\n v.resize(n);\n rep(i, n) {\n if (i && min > max - v[i - 1]) {\n bad = 1;\n break;\n }\n if (i)v[i] = v[i - 1] + rand(min, max - v[i - 1]);\n else v[i] = rand(min, max);\n }\n }\n return v;\n}\nvoid ranvlr(int n, int min, int max, vi &l, vi &r) {\n l.resize(n);\n r.resize(n);\n rep(i, n) {\n l[i] = rand(min, max);\n r[i] = l[i] + rand(0, max - l[i]);\n }\n}\n//便利 汎用\n//strを整数として比較\nstring smax(str &a, str b) {\n if (sz(a) < sz(b)) {\n return b;\n } else if (sz(a) > sz(b)) {\n return a;\n } else {\n rep(i, sz(a)) {\n if (a[i] < b[i]) {\n return b;\n } else if (a[i] > b[i])return a;\n }\n }\n return a;\n}\n//strを整数として比較\nstring smin(str &a, str b) {\n if (sz(a) < sz(b)) {\n return a;\n } else if (sz(a) > sz(b)) {\n return b;\n } else {\n rep(i, sz(a)) {\n if (a[i] < b[i]) {\n return a;\n } else if (a[i] > b[i])return b;\n }\n }\n return a;\n}\ntemplate<typename V, typename T> int find(vector<V> &a, const T key) {\n rep(i, sz(a))if (a[i] == key)return i;\n return -1;\n}\ntemplate<typename V, typename T> P find(vector<vector<V>> &a, const T key) {\n rep(i, sz(a)) rep(j, sz(a[0]))if (a[i][j] == key)return mp(i, j);\n return mp(-1, -1);\n}\ntemplate<typename V, typename U> T find(vector<vector<vector<V>>> &a, const U key) {\n rep(i, sz(a))rep(j, sz(a[0]))rep(k, sz(a[0][0]))if (a[i][j][k] == key)return mt(i, j, k);\n return mt(-1, -1, -1);\n}\n\ntemplate<typename V, typename T> int count(V &a, const T k) { return a == k; }\ntemplate<typename V, typename T> int count(vector<V> &a, const T k) {\n int ret = 0;\n fora(v, a)ret += count(v, k);\n return ret;\n}\ntemplate<typename V> int count_odd(V &a) { return a % 2; }\ntemplate<typename V> int count_odd(vector<V> &a) {\n int ret = 0;\n fora(v, a)ret += count_odd(v);\n return ret;\n}\ntemplate<typename V> int count_even(V &a) { return a % 2 == 0; }\ntemplate<typename V> int count_even(vector<V> &a) {\n int ret = 0;\n fora(v, a)ret += count_even(v);\n return ret;\n}\n//algorythm\nvoid iota(vector<int> &ve, int s, int n) {\n ve.resize(n);\n iota(all(ve), s);\n}\nvi iota(int s, int n) {\n vi ve(n);\n iota(all(ve), s);\n return ve;\n}\n//便利 数学\nint mod(int a, int m) { return (a % m + m) % m; }\nint pow(int a) { return a * a; };\nll fact(int v) { return v <= 1 ? 1 : v * fact(v - 1); }\nll comi(int n, int r) {\n assert(n < 100);\n static vvi(pas, 100, 100);\n if (pas[0][0])return pas[n][r];\n pas[0][0] = 1;\n rep(i, 1, 100) {\n pas[i][0] = 1;\n rep(j, 1, i + 1)pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];\n }\n return pas[n][r];\n}\nvoid ole() {\n#ifdef _DEBUG\n debugline(\"ole\");\n exit(0);\n#endif\n string a = \"a\";\n rep(i, 30)a += a;\n rep(i, 1 << 17)cout << a << endl;\n cout << \"OLE 出力長制限超過\" << endl;\n exit(0);\n}\nvoid tle() { while (inf)cout << inf << endl; }\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\nll gcd(vi b) {\n ll res = b[0];\n for (auto &&v :b)res = gcd(v, res);\n return res;\n}\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\nll rev(ll a) {\n ll res = 0;\n while (a) {\n res *= 10;\n res += a % 10;\n a /= 10;\n }\n return res;\n}\ntemplate<class T> vector<T> rev(vector<T> &a) {\n vector<T> ret = a;\n reverse(all(ret));\n return ret;\n}\nll ceil(ll a, ll b) {\n if (b == 0) {\n debugline(\"ceil\");\n deb(a, b);\n ole();\n return -1;\n } else return (a + b - 1) / b;\n}\nll sqrt(ll a) {\n if (a < 0) {\n debugline(\"sqrt\");\n deb(a);\n ole();\n }\n ll res = (ll) std::sqrt(a);\n while (res * res < a)res++;\n return res;\n}\ndouble log(double e, double x) { return log(x) / log(e); }\nll sig(ll t) { return (1 + t) * t / 2; }\nll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }\n\nvi divisors(int v) {\n vi res;\n double lim = std::sqrt(v);\n for (int i = 1; i <= lim; ++i) {\n if (v % i == 0) {\n res.pb(i);\n if (i != v / i)res.pb(v / i);\n }\n }\n return res;\n}\n\nvi factorization(int v) {\n int tv = v;\n vi res;\n if (isPrime.size() == 0)setPrime();\n for (auto &&p :primes) {\n if (v % p == 0)res.push_back(p);\n while (v % p == 0) {\n v /= p;\n }\n if (v == 1 || p * p > tv)break;\n }\n if (v > 1)res.pb(v);\n return res;\n}\n\nunordered_map<int, int> factorizationMap(int v) {\n int tv = v;\n unordered_map<int, int> res;\n if (isPrime.size() == 0)setPrime();\n for (auto &&p :primes) {\n while (v % p == 0) {\n res[p]++;\n v /= p;\n }\n if (v == 1 || p * p > tv)break;\n }\n if (v > 1)res[v]++;\n return res;\n}\nint get(int a, int keta) { return (a / (int) pow(10, keta)) % 10; }\nint keta(int v) {\n int cou = 0;\n while (v) { cou++, v %= 10; }\n return cou;\n}\nint dsum(int v) {\n int ret = 0;\n for (; v; v /= 10)ret += v % 10;\n return ret;\n}\nint sumd(int v) { return dsum(v); }\n//変換系\ntemplate<class T, class U> vector<T> keys(vector<pair<T, U>> a) {\n vector<T> res;\n for (auto &&k :a)res.pb(k.fi);\n return res;\n}\ntemplate<class T, class U> vector<U> keys(map<T, U> a) {\n vector<U> res;\n for (auto &&k :a)res.pb(k.fi);\n return res;\n}\n\ntemplate<class T, class U> vector<U> keys(umap<T, U> a) {\n vector<U> res;\n for (auto &&k :a)res.pb(k.fi);\n return res;\n}\n\ntemplate<class T, class U> vector<U> values(vector<pair<T, U>> a) {\n vector<U> res;\n for (auto &&k :a)res.pb(k.se);\n return res;\n}\n\ntemplate<class T, class U> vector<T> values(map<T, U> a) {\n vector<T> res;\n for (auto &&k :a)res.pb(k.se);\n return res;\n}\n\ntemplate<class T, class U> vector<T> values(umap<T, U> a) {\n vector<T> res;\n for (auto &&k :a)res.pb(k.se);\n return res;\n}\n\nvi list(int a) {\n vi res;\n while (a) {\n res.insert(res.begin(), a % 10);\n a /= 10;\n }\n return res;\n}\n\ntemplate<class T, class U> bool chmax(T &a, const U &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class U> bool chmax(const U &b) { return chmax(ma, b); }\ntemplate<class T, class U> bool chmin(T &a, const U &b) {\n if (b < a) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class U> bool chmin(const U &b) { return chmin(mi, b); }\n#define chmi chmin\n#define chma chmax\ntemplate<class T> T min(T a, signed b) { return a < b ? a : b; }\ntemplate<class T> T max(T a, signed b) { return a < b ? b : a; }\ntemplate<class T> T min(T a, T b, T c) { return a >= b ? b >= c ? c : b : a >= c ? c : a; }\ntemplate<class T> T max(T a, T b, T c) { return a <= b ? b <= c ? c : b : a <= c ? c : a; }\ntemplate<class T> T min(vector<T> a) { return *min_element(all(a)); }\ntemplate<class T> T min(vector<T> a, int n) { return *min_element(a.begin(), a.begin() + min(n, sz(a))); }\ntemplate<class T> T min(vector<T> a, int s, int n) { return *min_element(a.begin() + s, a.begin() + min(n, sz(a))); }\ntemplate<class T> T max(vector<T> a) { return *max_element(all(a)); }\ntemplate<class T> T max(vector<T> a, int n) { return *max_element(a.begin(), a.begin() + min(n, sz(a))); }\ntemplate<class T> T max(vector<T> a, int s, int n) { return *max_element(a.begin() + s, a.begin() + min(n, sz(a))); }\ntemplate<typename A, size_t N> A max(A (&a)[N]) {\n A res = a[0];\n rep(i, N)res = max(res, a[i]);\n return res;\n}\ntemplate<typename A, size_t N, size_t O> A max(A (&a)[N][O]) {\n A res = max(a[0]);\n rep(i, N)res = max(res, max(a[i]));\n return res;\n}\ntemplate<typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {\n A res = max(a[0]);\n rep(i, N)res = max(res, max(a[i]));\n return res;\n}\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q> A max(A (&a)[N][O][P][Q], const T &v) {\n A res = max(a[0]);\n rep(i, N)res = max(res, max(a[i]));\n return res;\n}\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R> A max(A (&a)[N][O][P][Q][R]) {\n A res = max(a[0]);\n rep(i, N)res = max(res, max(a[i]));\n return res;\n}\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S> A max(A (&a)[N][O][P][Q][R][S]) {\n A res = max(a[0]);\n rep(i, N)res = max(res, max(a[i]));\n return res;\n}\ntemplate<typename A, size_t N> A min(A (&a)[N]) {\n A res = a[0];\n rep(i, N)res = min(res, a[i]);\n return res;\n}\ntemplate<typename A, size_t N, size_t O> A min(A (&a)[N][O]) {\n A res = min(a[0]);\n rep(i, N)res = min(res, max(a[i]));\n return res;\n}\ntemplate<typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {\n A res = min(a[0]);\n rep(i, N)res = min(res, min(a[i]));\n return res;\n}\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q> A min(A (&a)[N][O][P][Q], const T &v) {\n A res = min(a[0]);\n rep(i, N)res = min(res, min(a[i]));\n return res;\n}\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R> A min(A (&a)[N][O][P][Q][R]) {\n A res = min(a[0]);\n rep(i, N)res = min(res, min(a[i]));\n return res;\n}\ntemplate<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S> A min(A (&a)[N][O][P][Q][R][S]) {\n A res = min(a[0]);\n rep(i, N)res = min(res, min(a[i]));\n return res;\n}\n\n\ntemplate<class T> T sum(vector<T> v, int len = -1) {\n if (len == -1)len = v.size();\n T res = 0;\n chmin(len, v.size());\n rep(i, len)res += v[i];\n return res;\n}\ntemplate<class T> T sum(vector<vector<T>> &v, int h = -1, int w = -1) {\n if (h == -1)h = v.size();\n if (w == -1)w = v[0].size();\n T res = 0;\n chmin(h, v.size());\n chmin(w, v[0].size());\n rep(i, h)rep(j, w)res += v[i][j];\n return res;\n}\n\nP sump(vp &v, int len = -1) {\n if (len == -1)len = v.size();\n P res = {0, 0};\n chmin(len, v.size());\n rep(i, len) {\n res.fi += v[i].fi;\n res.se += v[i].se;\n }\n return res;\n}\n\n///要素が0の時、返り値は0か1か\ntemplate<class T> T mul(vector<T> &v, int len = -1) {\n if (len == -1)len = v.size();\n T res = 1;\n chmin(len, v.size());\n rep(i, len)res *= v[i];\n return res;\n}\nvoid clear(PQ &q) { while (q.size())q.pop(); }\ntemplate<class T> void clear(queue<T> &q) { while (q.size())q.pop(); }\ntemplate<class T> T *negarr(int size) {\n T *body = (T *) malloc((size * 2 + 1) * sizeof(T));\n return body + size;\n}\ntemplate<class T> T *negarr2(int h, int w) {\n double **dummy1 = new double *[2 * h + 1];\n double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];\n dummy1[0] = dummy2 + w;\n for (int i = 1; i <= 2 * h + 1; i++) {\n dummy1[i] = dummy1[i - 1] + 2 * w + 1;\n }\n double **a = dummy1 + h;\n}\n//imoは0-indexed\n//ruiは1-indexed\ntemplate<class T> vector<T> imo(vector<T> &v) {\n vector<T> ret = v;\n rep(i, sz(ret) - 1)ret[i + 1] += ret[i];\n return ret;\n}\ntemplate<class T> vector<T> imomi(vector<T> &v) {\n vector<T> ret = v;\n rep(i, sz(ret) - 1)chmin(ret[i + 1], ret[i]);\n return ret;\n}\ntemplate<class T> struct ruiC {\n const vector<T> rui;\n ruiC(vector<T> &ru) : rui(ru) {}\n T operator()(int l, int r) {\n assert(l <= r);\n return rui[r] - rui[l];\n }\n T operator[](int i) {\n return rui[i];\n }\n};\n\ntemplate<class T> struct rruic {\n const T *rrui;\n rruic(T *ru) : rrui(ru) {}\n //n-1から-1へ\n T operator()(int l, int r) {\n assert(l >= r);\n return rrui[r] - rrui[l];\n }\n T operator[](int i) {\n return rrui[i];\n }\n};\ntemplate<class T> vector<T> ruiv(vector<T> &a) {\n vector<T> ret(a.size() + 1);\n rep(i, a.size())ret[i + 1] = ret[i] + a[i];\n return ret;\n}\ntemplate<class T> ruiC<T> ruic(vector<T> &a) {\n vector<T> ret = ruiv(a);\n return ruiC<T>(ret);\n}\ntemplate<class T> vector<T> ruim(vector<T> &a) {\n vector<T> res(a.size() + 1, 1);\n rep(i, a.size())res[i + 1] = res[i] * a[i];\n return res;\n}\n//template<class T> T *rrui(vector<T> &a) {\n//右から左にかけての半開区間 (-1 n-1]\ntemplate<class T> rruic<T> rrui(vector<T> &a) {\n int len = a.size();\n T *body = (T *) malloc((len + 1) * sizeof(T));\n T *res = body + 1;\n rer(i, len - 1)res[i - 1] = res[i] + a[i];\n return rruic<T>(res);\n}\n//掛け算\ntemplate<class T> T *rruim(vector<T> &a) {\n int len = a.size();\n T *body = (T *) malloc((len + 1) * sizeof(T));\n T *res = body + 1;\n res[len - 1] = 1;\n rer(i, len - 1)res[i - 1] = res[i] * a[i];\n return res;\n}\ntemplate<class T, class U> void inc(T &a, U v = 1) { a += v; }\ntemplate<class T, class U> void inc(vector<T> &a, U v = 1) { for (auto &u :a)inc(u, v); }\ntemplate<class T> void inc(vector<T> &a) { for (auto &u :a)inc(u, 1); }\ntemplate<class T, class U> void plus(T &a, U v = 1) { a += v; }\ntemplate<class T, class U> void plus(vector<T> &a, U v = 1) { for (auto &u :a)inc(u, v); }\ntemplate<class T> void plus(vector<T> &a) { for (auto &u :a)inc(u, 1); }\ntemplate<class T, class U> void dec(T &a, U v = 1) { a -= v; }\ntemplate<class T, class U> void dec(vector<T> &a, U v = 1) { for (auto &u :a)dec(u, v); }\ntemplate<class T> void dec(vector<T> &a) { for (auto &u :a)dec(u, 1); }\ntemplate<class T, class U> void minu(T &a, U v = 1) { a -= v; }\ntemplate<class T, class U> void minu(vector<T> &a, U v = 1) { for (auto &u :a)dec(u, v); }\ntemplate<class T> void minu(vector<T> &a) { for (auto &u :a)dec(u, 1); }\ninline bool inside(int h, int w, int H, int W) { return h >= 0 && w >= 0 && h < H && w < W; }\ninline bool inside(int v, int l, int r) { return l <= v && v < r; }\n#define ins inside\nll u(ll a) { return a < 0 ? 0 : a; }\ntemplate<class T> vector<T> u(const vector<T> &a) {\n vector<T> ret = a;\n fora(v, ret)v = u(v);\n return ret;\n}\n#define MIN(a) numeric_limits<a>::min()\n#define MAX(a) numeric_limits<a>::max()\nll goldd(ll left, ll right, function<ll(ll)> calc) {\n double GRATIO = 1.6180339887498948482045868343656;\n ll lm = left + (ll) ((right - left) / (GRATIO + 1.0));\n ll rm = lm + (ll) ((right - lm) / (GRATIO + 1.0));\n ll fl = calc(lm);\n ll fr = calc(rm);\n while (right - left > 10) {\n if (fl < fr) {\n right = rm;\n rm = lm;\n fr = fl;\n lm = left + (ll) ((right - left) / (GRATIO + 1.0));\n fl = calc(lm);\n } else {\n left = lm;\n lm = rm;\n fl = fr;\n rm = lm + (ll) ((right - lm) / (GRATIO + 1.0));\n fr = calc(rm);\n }\n }\n ll minScore = MAX(ll);\n ll resIndex = left;\n for (ll i = left; i < right + 1; i++) {\n ll score = calc(i);\n if (minScore > score) {\n minScore = score;\n resIndex = i;\n }\n }\n return resIndex;\n}\nll goldt(ll left, ll right, function<ll(ll)> calc) {\n double GRATIO = 1.6180339887498948482045868343656;\n ll lm = left + (ll) ((right - left) / (GRATIO + 1.0));\n ll rm = lm + (ll) ((right - lm) / (GRATIO + 1.0));\n ll fl = calc(lm);\n ll fr = calc(rm);\n while (right - left > 10) {\n if (fl > fr) {\n right = rm;\n rm = lm;\n fr = fl;\n lm = left + (ll) ((right - left) / (GRATIO + 1.0));\n fl = calc(lm);\n } else {\n left = lm;\n lm = rm;\n fl = fr;\n rm = lm + (ll) ((right - lm) / (GRATIO + 1.0));\n fr = calc(rm);\n }\n }\n if (left > right) {\n ll l = left;\n left = right;\n right = l;\n }\n ll maxScore = MIN(ll);\n ll resIndex = left;\n for (ll i = left; i < right + 1; i++) {\n ll score = calc(i);\n if (maxScore < score) {\n maxScore = score;\n resIndex = i;\n }\n }\n return resIndex;\n}\ntemplate<class T> T min(vector<vector<T>> &a) {\n T res = MAX(T);\n rep(i, a.size())chmin(res, *min_element(all(a[i])));\n return res;\n}\ntemplate<class T> T max(vector<vector<T>> &a) {\n T res = MIN(T);\n rep(i, a.size())chmax(res, *max_element(all(a[i])));\n return res;\n}\n\nbool bget(ll m, int keta) { return (m >> keta) & 1; }\nint bget(ll m, int keta, int sinsuu) {\n m /= (ll) pow(sinsuu, keta);\n return m % sinsuu;\n}\ninline ll bit(int n) { return (1LL << (n)); }\ninline ll bit(int n, int sinsuu) { return (ll) pow(sinsuu, n); }\n//int bcou(ll m) { return __builtin_popcount(m & 0xFFFFFFFF) + __builtin_popcount(m >> 32); }\n#define bcou __builtin_popcountll\n//最下位ビット\nint lbit(int n) {\n return n & -n;\n}\n//最上位ビット\nint hbit(int n) {\n n |= (n >> 1);\n n |= (n >> 2);\n n |= (n >> 4);\n n |= (n >> 8);\n n |= (n >> 16);\n n |= (n >> 32);\n return n - (n >> 1);\n}\n//初期化は0を渡す\nll nextComb(ll &mask, int n, int r) {\n if (!mask)return mask = (1LL << r) - 1;\n ll x = mask & -mask; //最下位の1\n ll y = mask + x; //連続した下の1を繰り上がらせる\n ll res = ((mask & ~y) / x >> 1) | y;\n if (bget(res, n))return mask = 0;\n else return mask = res;\n}\n\n//n桁以下でビットがr個立っているもののvectorを返す\nvl bitCombList(int n, int r) {\n vl res;\n int m = 0;\n while (nextComb(m, n, r)) {\n res.pb(m);\n }\n return res;\n}\n//大文字小文字を区別する\nint altoiaZ(char c) {\n if ('A' <= c && c <= 'Z')return c - 'A';\n return c - 'a' + 26;\n}\nchar itoalaZ(int i) {\n if (i < 26)return 'A' + i;\n return 'a' + i - 26;\n}\n//aもAも0を返す 基本小文字\nint altoi(char c) {\n if ('A' <= c && c <= 'Z')return c - 'A';\n return c - 'a';\n}\nchar itoal(int i) {\n return 'a' + i;\n}\nint ctoi(char c) { return c - '0'; }\nchar itoc(int i) { return i + '0'; }\nint vtoi(vi &v) {\n int res = 0;\n if (sz(v) > 18) {\n debugline(\"vtoi\");\n deb(sz(v));\n ole();\n }\n rep(i, sz(v)) {\n res *= 10;\n res += v[i];\n }\n return res;\n}\nvi itov(int i) {\n vi res;\n while (i) {\n res.pb(i % 10);\n i /= 10;\n }\n rev(res);\n return res;\n}\nvector<vector<int>> ctoi(vector<vector<char>> s, char c) {\n int n = sz(s), m = sz(s[0]);\n vector<vector<int>> res(n, vector<int>(m));\n rep(i, n)rep(j, m)res[i][j] = s[i][j] == c;\n return res;\n}\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\nvoid compress(vi &a) {\n vi b;\n int len = a.size();\n for (int i = 0; i < len; ++i) {\n b.push_back(a[i]);\n }\n sort(b);\n UNIQUE(b);\n for (int i = 0; i < len; ++i) {\n a[i] = lower_bound(all(b), a[i]) - b.begin();\n }\n}\n\nvoid compress(int a[], int len) {\n vi b;\n for (int i = 0; i < len; ++i) {\n b.push_back(a[i]);\n }\n sort(b);\n UNIQUE(b);\n for (int i = 0; i < len; ++i) {\n a[i] = lower_bound(all(b), a[i]) - b.begin();\n }\n}\n//要素が見つからなかったときに困る\n#define binarySearch(a, v) (binary_search(all(a),v))\n#define lowerIndex(a, v) (lower_bound(all(a),v)-a.begin())\n#define lowerBound(a, v) (*lower_bound(all(a),v))\n#define upperIndex(a, v) (upper_bound(all(a),v)-a.begin())\n#define upperBound(a, v) (*upper_bound(all(a),v))\n#define ans(a) cout<<a<<endl;continue;\n#define poll(a) q.front();q.pop()\n#define dpoll(a) q.front();q.pop_front()\n#define pollLast(a) q.back();q.pop_back()\n#define pollBack(a) q.back();q.pop_back()\ntemplate<class T> inline void fin(T s) { cout << s << endl, exit(0); }\n\ntemplate<class T> struct edge {\n int f, t;\n T c;\n int id;\n int type;\n edge(int f, int t, T c = 1, int id = -1, int ty = -1) : f(f), t(t), c(c), id(id), type(ty) {}\n bool operator<(const edge &b) const { return c < b.c; }\n bool operator>(const edge &b) const { return c > b.c; }\n};\n\ntemplate<typename T> class graph {\nprotected:\n vector<bool> _used;\npublic :\n vector<vector<edge<T>>> g;\n vector<edge<T>> edges;\n int n;\n graph(int n) : n(n) { g.resize(n), _used.resize(n); }\n void clear() { g.clear(), edges.clear(); }\n void resize(int n) {\n this->n = n;\n g.resize(n);\n _used.resize(n);\n }\n int size() { return g.size(); }\n vector<edge<T> > &operator[](int i) { return g[i]; }\n virtual void add(int f, int t, T c, int id, int ty) = 0;\n virtual bool used(edge<T> &e) = 0;\n virtual bool used(int id) = 0;\n virtual void del(edge<T> &e) = 0;\n virtual void del(int id) = 0;\n};\ntemplate<typename T =ll> class digraph : public graph<T> {\npublic:\n using graph<T>::g;\n using graph<T>::n;\n using graph<T>::edges;\n using graph<T>::_used;\n\n digraph(int n) : graph<T>(n) {}\n void add(int f, int t, T c = 1, int id = -1, int ty = -1) {\n if (!(0 <= f && f < n && 0 <= t && t < n)) {\n debugline(\"digraph add\");\n deb(f, t, c, id, ty);\n ole();\n }\n if (id == -1)id = edges.size();\n g[f].emplace_back(f, t, c, id, ty);\n edges.emplace_back(f, t, c, id, ty);\n }\n bool used(edge<T> &e) { return _used[e.id]; }\n bool used(int id) { return _used[id]; }\n void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }\n void del(int id) { _used[id] = _used[id ^ 1] = 1; }\n};\ntemplate<class T=int> class undigraph : public graph<T> {\npublic:\n using graph<T>::g;\n using graph<T>::n;\n using graph<T>::edges;\n using graph<T>::_used;\n undigraph(int n) : graph<T>(n) {\n }\n void add(int f, int t, T c = 1, int id = -1, int ty = -1) {\n if (!(0 <= f && f < n && 0 <= t && t < n)) {\n debugline(\"undigraph add\");\n deb(f, t, c, id, ty);\n ole();\n }\n if (id == -1)id = edges.size();\n g[f].emplace_back(f, t, c, id, ty);\n g[t].emplace_back(t, f, c, id + 1, ty);\n edges.emplace_back(f, t, c, id, ty);\n edges.emplace_back(t, f, c, id + 1, ty);\n }\n void add(edge<T> &e) {\n int f = e.f, t = e.t, ty = e.type;\n T c = e.c;\n add(f, t, c, ty);\n }\n bool used(edge<T> &e) { return _used[e.id]; }\n bool used(int id) { return _used[id]; }\n void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }\n void del(int id) { _used[id] = _used[id ^ 1] = 1; }\n};\ntemplate<class T> vector<T> dijkstra(const graph<T> &g, int s, int cant_arrive = -1) {\n if (!(0 <= s && s < g.n)) {\n debugline(\"dijkstra\");\n deb(s, g.n);\n ole();\n }\n T initValue = MAX(T);\n vector<T> dis(g.n, initValue);\n priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;\n dis[s] = 0;\n q.emplace(0, s);\n while (q.size()) {\n T nowc = q.top().fi;\n int i = q.top().se;\n q.pop();\n if (dis[i] != nowc)continue;\n for (auto &&e : g.g[i]) {\n int to = e.t;\n T c = nowc + e.c;\n if (dis[to] > c) {\n dis[to] = c;\n q.emplace(dis[to], to);\n }\n }\n }\n //基本、たどり着かないなら-1\n if (cant_arrive == -1)for (auto &&d :dis) if (d == initValue)d = -1;\n return dis;\n}\ntemplate<class T> vector<vector<T>> warshall(const graph<T> &g, int cant_arrive = -1) {\n int n = g.n;\n vector<vector<T> > dis(n, vector<T>(n, linf));\n fora(e, g.edges) chmin(dis[e.f][e.t], e.c);\n rep(i, n)dis[i][i] = 0;\n rep(k, n)rep(i, n)rep(j, n)chmin(dis[i][j], dis[i][k] + dis[k][j]);\n //基本、たどり着かないなら-1\n if (cant_arrive == -1)rep(i, n)rep(j, n) if (dis[i][j] == linf)dis[i][j] = -1;\n return dis;\n}\n\ntemplate<class T=int> class tree : public undigraph<T> {\npublic:\n using undigraph<T>::g;\n using undigraph<T>::n;\n using undigraph<T>::edges;\n using undigraph<T>::_used;\n vi dep;\n vi disv;\nprivate:\n bool never = 1;\n int root = -1;\n vector<vector<int>> par;\n bool costallone;\n void dfs(int v, int p, int d) {\n dep[v] = d;\n par[0][v] = p;\n int lim = (*this)[v].size();\n for (int i = 0; i < lim; i++) {\n int t = g[v][i].t;\n if (t == p)con;\n dfs(t, v, d + 1);\n }\n }\n void built() {\n never = 0;\n n = g.size();\n par.assign(30, vi(n));\n dep.resize(n);\n costallone = 1;\n fora(e, edges)if (e.c != 1)costallone = 0;\n dfs(root, -1, 0);\n rep(k, par.size() - 1) {\n rep(i, n) {\n if (par[k][i] == -1)par[k + 1][i] = -1;\n else par[k + 1][i] = par[k][par[k][i]];\n }\n }\n if (costallone)disv = dep;\n else disv = dijkstra(*this, root);\n }\n int _lca(int u, int v) {\n if (dep[u] > dep[v])swap(u, v);\n rep(k, par.size()) {\n if ((dep[u] - dep[v]) >> k & 1) {\n v = par[k][v];\n }\n }\n if (u == v)return u;\n rer(k, par.size() - 1) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int _dis(int u, int v) {\n int p = _lca(u, v);\n return disv[u] + disv[v] - disv[p] * 2;\n }\npublic:\n tree(int n, int root = 0) : undigraph<T>(n), root(root) {}\n bool leaf(int v) {\n return sz(g[v]) == 1 && v != root;\n }\n int dis(int u, int v) {\n if (never) {\n built();\n }\n return _dis(u, v);\n }\n int lca(int u, int v) {\n if (never) {\n built();\n }\n return _lca(u, v);\n }\n};\n//辺によりメモリを大量消費\n// よってedgesを消している\n//頂点10^6でメモリを190MB(制限の8割)使う\n\n//軽量化のため、辺を持たないbig gridクラスがあってもいいかもしれない\n//\ntemplate<class T=int> class grid_k6 : public undigraph<T> {\npublic:\n using undigraph<T>::g;\n using undigraph<T>::n;\n using undigraph<T>::edges;\n using undigraph<T>::_used;\n int H, W;\n int eid = 0;\n void add(int f, int t, T c = 1, int id = -1, int ty = -1) {\n if (!(0 <= f && f < n && 0 <= t && t < n)) {\n debugline(\"grid_k6 add\");\n deb(f, t, c, id, ty);\n ole();\n }\n g[f].emplace_back(f, t, c, eid++, ty);\n g[t].emplace_back(t, f, c, eid++, ty);\n }\n int getid(int h, int w) {\n if (!inside(h, w, H, W))return -1;\n return W * h + w;\n }\n P get2(int id) {\n return mp(id / W, id % W);\n }\n P operator()(int id) {\n return get2(id);\n }\n int operator()(int h, int w) {\n return getid(h, w);\n }\n grid_k6(int H, int W) : H(H), W(W), undigraph<T>(H * W) {\n rep(h, H) {\n rep(w, W) {\n int f = getid(h, w);\n if (w + 1 < W) add(f, getid(h, w + 1));\n if (h + 1 < H)add(f, getid(h + 1, w));\n }\n }\n }\n grid_k6(_vvc ba, char wall = '#') : H(sz(ba)), W(sz(ba[0])), undigraph<T>(sz(ba) * sz(ba[0])) {\n rep(h, H) {\n rep(w, W) {\n if (ba[h][w] == wall)con;\n int f = getid(h, w);\n if (w + 1 < W && ba[h][w + 1] != wall) {\n add(f, getid(h, w + 1));\n }\n if (h + 1 < H && ba[h + 1][w] != wall) {\n add(f, getid(h + 1, w));\n }\n }\n }\n }\n void add(int fh, int fw, int th, int tw) {\n add(getid(fh, fw), getid(th, tw));\n }\n};\n//左上から右下に移動できる\ntemplate<class T=int> class digrid_k6 : public digraph<T> {\npublic:\n using digraph<T>::g;\n using digraph<T>::n;\n using digraph<T>::edges;\n using digraph<T>::_used;\n int H, W;\n int eid = 0;\n void add(int f, int t, T c = 1, int id = -1, int ty = -1) {\n if (!(0 <= f && f < n && 0 <= t && t < n)) {\n debugline(\"digrid_k6 add\");\n deb(f, t, c, id, ty);\n ole();\n }\n g[f].emplace_back(f, t, c, eid++, ty);\n }\n int getid(int h, int w) {\n if (!inside(h, w, H, W))return -1;\n return W * h + w;\n }\n P get2(int id) {\n return mp(id / W, id % W);\n }\n P operator()(int id) {\n return get2(id);\n }\n int operator()(int h, int w) {\n return getid(h, w);\n }\n digrid_k6(int H, int W) : H(H), W(W), digraph<T>(H * W) {\n rep(h, H) {\n rep(w, W) {\n int f = getid(h, w);\n if (w + 1 < W) add(f, getid(h, w + 1));\n if (h + 1 < H)add(f, getid(h + 1, w));\n }\n }\n }\n digrid_k6(_vvc ba, char wall = '#') : H(sz(ba)), W(sz(ba[0])), digraph<T>(sz(ba) * sz(ba[0])) {\n rep(h, H) {\n rep(w, W) {\n if (ba[h][w] == wall)con;\n int f = getid(h, w);\n if (w + 1 < W && ba[h][w + 1] != wall) {\n add(f, getid(h, w + 1));\n }\n if (h + 1 < H && ba[h + 1][w] != wall) {\n add(f, getid(h + 1, w));\n }\n }\n }\n }\n void add(int fh, int fw, int th, int tw) {\n add(getid(fh, fw), getid(th, tw));\n }\n};\ntemplate<class T> bool nibu(const graph<T> &g) {\n if (g.edges.size() == 0)return true;\n UnionFind uf(g.n * 2);\n for (auto &&e :g.edges)uf.unite(e.f, e.t + g.n), uf.unite(e.f + g.n, e.t);\n rep(i, g.n)if (uf.same(i, i + g.n))return 0;\n return 1;\n}\n//二部グラフを色分けした際の頂点数を返す\ntemplate<class T> vp nibug(graph<T> &g) {\n vp cg;\n if (!nibu(g)) {\n debugline(\"nibu\");\n ole();\n }\n int _n = g.size();\n vb _was(_n);\n queue<P> q;\n rep(i, _n) {\n if (_was[i])continue;\n q.push(mp(i, 1));\n _was[i] = 1;\n int red = 0;\n int coun = 0;\n while (q.size()) {\n int now = q.front().fi;\n int col = q.front().se;\n red += col;\n coun++;\n q.pop();\n forg(gi, g[now]) {\n if (_was[t])continue;\n q.push(mp(t, col ^ 1));\n _was[t] = 1;\n }\n }\n cg.push_back(mp(red, coun - red));\n }\n return cg;\n\n}\n\n\n//機能拡張\nvp vtop(vi &a, vi &b) {\n vp res(sz(a));\n rep(i, sz(a))res[i] = mp(a[i], b[i]);\n return res;\n}\nvoid ptov(vp &p, vi &a, vi &b) {\n a.resize(sz(p));\n b.resize(sz(p));\n rep(i, sz(p))a[i] = p[i].fi, b[i] = p[i].se;\n}\ntemplate<typename _CharT, typename _Traits, typename _Alloc>\nbasic_string<_CharT, _Traits, _Alloc>\noperator+(const basic_string<_CharT, _Traits, _Alloc> &__lhs, const int __rv) {\n basic_string<_CharT, _Traits, _Alloc> __str(__lhs);\n __str.append(to_string(__rv));\n return __str;\n}\ntemplate<typename _CharT, typename _Traits, typename _Alloc>\nvoid operator+=(basic_string<_CharT, _Traits, _Alloc> &__lhs, const int __rv) {\n __lhs += to_string(__rv);\n}\ntemplate<typename _CharT, typename _Traits, typename _Alloc>\nbasic_string<_CharT, _Traits, _Alloc>\noperator+(const basic_string<_CharT, _Traits, _Alloc> &__lhs, const signed __rv) {\n basic_string<_CharT, _Traits, _Alloc> __str(__lhs);\n __str.append(to_string(__rv));\n return __str;\n}\ntemplate<typename _CharT, typename _Traits, typename _Alloc>\nvoid operator+=(basic_string<_CharT, _Traits, _Alloc> &__lhs, const signed __rv) {\n __lhs += to_string(__rv);\n}\ntemplate<class T, class U> void operator+=(queue<T> &a, U v) {\n a.push(v);\n}\ntemplate<class T, class U>\npriority_queue<T, vector<T>, greater<T> > &operator+=(priority_queue<T, vector<T>, greater<T> > &a, U v) {\n a.push(v);\n return a;\n}\ntemplate<class T, class U> priority_queue<T> &operator+=(priority_queue<T> &a, U v) {\n a.push(v);\n return a;\n}\ntemplate<class T, class U> set<T> &operator+=(set<T> &a, U v) {\n a.insert(v);\n return a;\n}\ntemplate<class T, class U> set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {\n a.insert(v);\n return a;\n}\ntemplate<class T, class U> vector<T> &operator+=(vector<T> &a, U v) {\n a.pb(v);\n return a;\n}\ntemplate<class T, class U> vector<T> operator+(const vector <T> &a, U v) {\n vector<T> ret = a;\n ret += v;\n return ret;\n}\ntemplate<class T, class U> vector<T> operator+(U v, const vector <T> &a) {\n vector<T> ret = a;\n ret.insert(ret.begin(), v);\n return ret;\n}\ntemplate<class T> vector<T> &operator+=(vector<T> &a, vector <T> &b) {\n fora(v, b)a += v;\n return a;\n}\ntemplate<class T, class U> vector<T> &operator+=(vector<T> &a, initializer_list<U> v) {\n for (auto &&va :v)a.pb(va);\n return a;\n}\ntemplate<class T> vector<T> &operator-=(vector<T> &a, vector <T> &b) {\n if (sz(a) != sz(b)) {\n debugline(\"vector<T> operator-=\");\n deb(a);\n deb(b);\n ole();\n }\n rep(i, sz(a))a[i] -= b[i];\n return a;\n}\ntemplate<class T> vector<T> operator-(vector<T> &a, vector <T> &b) {\n if (sz(a) != sz(b)) {\n debugline(\"vector<T> operator-\");\n deb(a);\n deb(b);\n ole();\n }\n vector<T> res(sz(a));\n rep(i, sz(a))res[i] = a[i] - b[i];\n return res;\n}\n\n\ntemplate<typename T> void remove(vector<T> &v, unsigned int i) { v.erase(v.begin() + i); }\ntemplate<typename T> void remove(vector<T> &v, unsigned int s, unsigned int e) {\n v.erase(v.begin() + s, v.begin() + e);\n}\ntemplate<typename T> void removen(vector<T> &v, unsigned int s, unsigned int n) {\n v.erase(v.begin() + s, v.begin() + s + n);\n}\ntemplate<typename T> void erase(vector<T> &v, unsigned int i) { v.erase(v.begin() + i); }\ntemplate<typename T> void erase(vector<T> &v, unsigned int s, unsigned int e) {\n v.erase(v.begin() + s, v.begin() + e);\n}\ntemplate<typename T> void erasen(vector<T> &v, unsigned int s, unsigned int n) {\n v.erase(v.begin() + s, v.begin() + s + n);\n}\ntemplate<typename T, typename U> void insert(vector<T> &v, unsigned int i, U t) { v.insert(v.begin() + i, t); }\ntemplate<typename T, typename U> void push_front(vector<T> &v, U t) { v.insert(v.begin(), t); }\ntemplate<typename T, typename U> void insert(vector<T> &v, unsigned int i, vector<T> list) {\n for (auto &&va :list)v.insert(v.begin() + i++, va);\n}\ntemplate<typename T, typename U> void insert(vector<T> &v, initializer_list<U> list) {\n for (auto &&va :list)v.pb(va);\n}\ntemplate<typename T, typename U> void insert(vector<T> &v, unsigned int i, initializer_list<U> list) {\n for (auto &&va :list)v.insert(v.begin() + i++, va);\n}\ntemplate<typename T> void insert(set<T> &v, vector<T> list) {\n for (auto &&va :list)v.insert(va);\n}\ntemplate<typename T> void insert(set<T> &v, initializer_list<T> list) {\n for (auto &&va :list)v.insert(va);\n}\n\n\n//閉路がなければtrue\nbool topo(vi &res, digraph<int> &g) {\n int n = g.g.size();\n vi nyu(n);\n rep(i, n)for (auto &&e :g[i])nyu[e.t]++;\n queue<int> st;\n rep(i, n)if (nyu[i] == 0)st.push(i);\n while (st.size()) {\n int v = st.front();\n st.pop();\n res.pb(v);\n fora(e, g[v]) if (--nyu[e.t] == 0)st.push(e.t);\n }\n return res.size() == n;\n}\n//辞書順最小トポロジカルソート\nbool topos(vi &res, digraph<int> &g) {\n int n = g.g.size();\n vi nyu(n);\n rep(i, n)for (auto &&e :g[i])nyu[e.t]++;\n //小さい順\n priority_queue<int, vector<int>, greater<int> > q;\n rep(i, n)if (nyu[i] == 0)q.push(i);\n while (q.size()) {\n int i = q.top();\n q.pop();\n res.pb(i);\n fora(e, g[i])if (--nyu[e.t] == 0)q.push(e.t);\n }\n return res.size() == n;\n}\nvector<string> split(const string a, const char deli) {\n string b = a + deli;\n int l = 0, r = 0, n = b.size();\n vector<string> res;\n rep(i, n) {\n if (b[i] == deli) {\n r = i;\n if (l < r)res.push_back(b.substr(l, r - l));\n l = i + 1;\n }\n }\n return res;\n}\nvector<string> split(const string a, const string deli) {\n string b = a + deli;\n int l = 0, r = 0, n = b.size(), dn = deli.size();\n vector<string> res;\n rep(i, n) {\n if (i + dn <= n && b.substr(i, i + dn) == deli) {\n r = i;\n if (l < r)res.push_back(b.substr(l, r - l));\n i += dn - 1;\n l = i + 1;\n }\n }\n return res;\n}\nvoid yn(bool a) {\n if (a)cout << \"yes\" << endl;\n else cout << \"no\" << endl;\n}\nvoid Yn(bool a) {\n if (a)cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n}\nvoid YN(bool a) {\n if (a)cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n}\nvoid fyn(bool a) {\n if (a)cout << \"yes\" << endl;\n else cout << \"no\" << endl;\n exit(0);\n}\nvoid fYn(bool a) {\n if (a)cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n exit(0);\n}\nvoid fYN(bool a) {\n if (a)cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n exit(0);\n}\nvoid Possible(bool a) {\n if (a)cout << \"Possible\" << endl;\n else cout << \"Impossible\" << endl;\n exit(0);\n}\n\nint n, m, k, d, H, W, x, y, z, q;\nint cou;\nvi a, b, c;\nvvi (s, 0, 0);\nvvc (ba, 0, 0);\nvp p;\n\nvoid solve() {\n din(x, pp);\n dou p = pp * 1.0 / 100;\n dou e1 = 1 / p;\n dou e2 = 1 / p;\n if (x % 2 == 1) {\n cout << e1 + (1 / p) * (x / 2) << endl;\n } else {\n cout << e2 + (1 / p) * ((x / 2) - 1) << endl;\n }\n\n}\nint my(int n, vi a) {\n return 0;\n}\nint sister(int n, vi a) {\n return 0;\n}\n\nsigned main() {\n solve();\n\n#define _arg n,a\n //cin>>n;\n //na(a,n);\n //my(_arg);\n //cout << my(_arg) << endl;\n#ifdef _DEBUG\n bool bad = 0;\n for (int i = 0, ok = 1; i < k5 && ok; i++) {\n int n = rand(1, 3);\n vi a = ranv(m, 1, 10);\n int myres = my(_arg);\n int res = sister(_arg);\n ok = myres == res;\n if (!ok) {\n cout << n << endl;\n cout << a << endl;\n cout << \"正解 : \" << res << endl;\n cout << \"出力 : \" << myres << endl;\n bad = 1;\n break;\n }\n }\n\n#endif\n return 0;\n};\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef signed long long ll;\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define FOR(x,to) for(x=0;x<(to);x++)\n#define FORR(x,arr) for(auto& x:arr)\n#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)\n#define ALL(a) (a.begin()),(a.end())\n#define ZERO(a) memset(a,0,sizeof(a))\n#define MINUS(a) memset(a,0xff,sizeof(a))\n//-------------------------------------------------------\n\nll X;\ndouble P;\n\ndouble F(int N) {\n\treturn 1.0/P*N;\n}\n\nvoid solve() {\n\tint i,j,k,l,r,x,y; string s;\n\t\n\tcin>>X>>P;\n\t\n\tP/=100;\n\t\n\tif(X%2==1) {\n\t\t_P(\"%.12lf\\n\",1+P*F((X-1)/2)+(1-P)*F((X+1)/2));\n\t}\n\telse {\n\t\t_P(\"%.12lf\\n\",F(X/2));\n\t}\n\t\n\t\n}\n\n\nint main(int argc,char** argv){\n\tstring s;int i;\n\tif(argc==1) ios::sync_with_stdio(false), cin.tie(0);\n\tFOR(i,argc-1) s+=argv[i+1],s+='\\n';\n\tFOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);\n\tsolve(); return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long int;\ntemplate<class T = int> using V = vector<T>;\ntemplate<class T = int> using VV = V< V<T> >;\ntemplate<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }\ntemplate<class T, class... U> void assign(V<T>& v, int n, const U&... u) { v.resize(n); for (auto&& i : v) assign(i, u...); }\n\nint main() {\n cin.tie(NULL); ios::sync_with_stdio(false);\n int x, p; cin >> x >> p;\n cout << fixed << setprecision(15) << 50.0 * (x + (x & 1)) / p << '\\n';\n}", "/**\n * code generated by JHelper\n * More info: https://github.com/AlexeyDmitriev/JHelper\n * @author aajisaka\n */\n\n#include<bits/stdc++.h>\n\nusing namespace std;\n\nvoid debug_out() { cerr << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\n#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n#define all(v) v.begin(), v.end()\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\n\nusing ll = long long;\nusing P = pair<ll, ll>;\n\nconstexpr double PI = 3.14159265358979323846;\nmt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());\n\nclass ATakahashiIsMissing {\npublic:\n void solve(istream& cin, ostream& cout) {\n SPEED;\n int x; cin >> x;\n double p; cin >> p;\n ll r = (x+1)/2;\n cout << setprecision(8) << fixed << r*100/p << endl;\n }\n};\n\nsigned main() {\n ATakahashiIsMissing solver;\n std::istream& in(std::cin);\n std::ostream& out(std::cout);\n solver.solve(in, out);\n return 0;\n}", "#include <bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nint main(){\n\tint x;double p;cin>>x>>p;p/=100;\n\tif(x%2)printf(\"%.12lf\\n\",(x/2)*(1/p)*p+(x/2+1)*(1/p)*(1-p)+1);\n\telse printf(\"%.12lf\\n\",(x/2)*(1/p));\n}", "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.Closeable;\nimport java.io.FileInputStream;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.BitSet;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.TreeMap;\n\npublic class Main implements Runnable{\n\tstatic ContestScanner in;static Writer out;\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \"\", 16 * 1024 * 1024).start();\n\t}\n\tpublic void run() {\n\t\ttry {\n//\t\t\tin = new ContestScanner(\"in.txt\");\n//\t\t\tout = new Writer(\"out.txt\");\n\t\t\tin = new ContestScanner();\n\t\t\tout = new Writer();\n\t\t\tMain solve = new Main();\n\t\t\tsolve.solve();\n\t\t\tin.close();\n\t\t\tout.flush();\n\t\t\tout.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\tstatic void dump(int[]a){StringBuilder s=new StringBuilder();for(int i=0;i<a.length;i++)\n\ts.append(a[i]).append(\" \");out.println(s.toString().trim());}\n\tstatic void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf(\"%\"+n+\"d \",a[i]);out.println();}\n\tstatic void dump(long[]a){StringBuilder s=new StringBuilder();for(int i=0;i<a.length;i++)\n\ts.append(a[i]).append(\" \");out.println(s.toString().trim());}\n\tstatic void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}\n\tstatic long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}\n\tstatic String itob(int a,int l){return String.format(\"%\"+l+\"s\",Integer.toBinaryString(a)).replace(' ','0');}\n\tstatic void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}\n\tstatic void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}\n\tstatic void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}\n\tstatic void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}\n\tstatic void m_sort(int[]a,int s,int sz,int[]b)\n\t{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];\n\t} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */\n\tstatic void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}\n\tstatic void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}\n\tstatic void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}\n\tstatic void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}\n\tstatic void m_sort(long[]a,int s,int sz,long[]b)\n\t{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}\n\tstatic void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}\n\tstatic void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}\n\tstatic int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v\n\t{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}\n\tstatic int binarySearchSmallerMax(int[]a,int v,int l,int r)\n\t{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}\n\t@SuppressWarnings(\"unchecked\")\n\tstatic List<Integer>[]createGraph(int n)\n {List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}\n\tvoid solve() throws IOException{\n\t\tlong x = in.nextLong();\n\t\tint p = in.nextInt();\n\t\tSystem.out.println(100.0*((x+1)/2)/p);\n\t}\n}\n\n\n@SuppressWarnings(\"serial\")\nclass MultiSet<T> extends HashMap<T, Integer>{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic MultiSet<T> merge(MultiSet<T> set)\n\t{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}\n\tfor(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}\n}\n@SuppressWarnings(\"serial\")\nclass OrderedMultiSet<T> extends TreeMap<T, Integer>{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic OrderedMultiSet<T> merge(OrderedMultiSet<T> set)\n\t{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}\n\twhile(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}\n}\nclass Pair implements Comparable<Pair>{\n\tint a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}\n\tpublic boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}\n\tpublic int hashCode(){return hash;}\n\tpublic int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}\n}\nclass Timer{\n\tlong time;public void set(){time=System.currentTimeMillis();}\n\tpublic long stop(){return time=System.currentTimeMillis()-time;}\n\tpublic void print(){System.out.println(\"Time: \"+(System.currentTimeMillis()-time)+\"ms\");}\n\t@Override public String toString(){return\"Time: \"+time+\"ms\";}\n}\nclass Writer extends PrintWriter{\n\tpublic Writer(String filename)throws IOException\n\t{super(new BufferedWriter(new FileWriter(filename)));}\n\tpublic Writer()throws IOException{super(System.out);}\n}\nclass ContestScanner implements Closeable{\n\tprivate BufferedReader in;private int c=-2;\n\tpublic ContestScanner()throws IOException \n\t{in=new BufferedReader(new InputStreamReader(System.in));}\n\tpublic ContestScanner(String filename)throws IOException\n\t{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}\n\tpublic String nextToken()throws IOException {\n\t\tStringBuilder sb=new StringBuilder();\n\t\twhile((c=in.read())!=-1&&Character.isWhitespace(c));\n\t\twhile(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}\n\t\treturn sb.toString();\n\t}\n\tpublic String readLine()throws IOException{\n\t\tStringBuilder sb=new StringBuilder();if(c==-2)c=in.read();\n\t\twhile(c!=-1&&c!='\\n'&&c!='\\r'){sb.append((char)c);c=in.read();}\n\t\treturn sb.toString();\n\t}\n\tpublic long nextLong()throws IOException,NumberFormatException\n\t{return Long.parseLong(nextToken());}\n\tpublic int nextInt()throws NumberFormatException,IOException\n\t{return(int)nextLong();}\n\tpublic double nextDouble()throws NumberFormatException,IOException \n\t{return Double.parseDouble(nextToken());}\n\tpublic void close() throws IOException {in.close();}\n}", "#include <stdio.h>\n\nint main(void) {\n int x, p;\n scanf(\"%d%d\", &x, &p);\n printf(\"%.12f\", (double)((x + 1) / 2) * 100.0 / (double)p);\n return 0;\n}\n", "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> PI;\nconst ll mod = 1e9 + 7;\n\n\ndouble solve(ll x, double p) {\n return (x + 1) / 2 / p;\n}\n\nint main(void){\n ll x;\n int p;\n cin >> x >> p;\n if (p == 100) {\n cout << (x + 1) / 2 << endl;\n return 0;\n }\n printf(\"%.15f\\n\", solve(x, p / 100.0));\n}\n", "// #pragma GCC target(\"avx2\") // CPU 処理並列化\n// #pragma GCC optimize(\"O3\") // CPU 処理並列化\n// #pragma GCC optimize(\"unroll-loops\") // 条件処理の呼び出しを減らす\n#include<stdio.h>\n#include<math.h>\n#include<algorithm>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<string>\n#include<string.h>\n#include<vector>\n#include<set>\n#include<map>\n#include<bitset>\n#include<stdlib.h>\n#include<cassert>\n#include<time.h>\n#include<bitset>\n#include<numeric>\nusing namespace std;\nconst long long mod=1000000007;\nconst long long inf=mod*mod;\nconst long long d2=(mod+1)/2;\nconst double EPS=1e-10;\nconst double INF=1e+10;\nconst double PI=acos(-1.0);\nconst int C_SIZE = 3121000;\nlong long fact[C_SIZE];\nlong long finv[C_SIZE];\nlong long inv[C_SIZE];\nlong long Comb(int a,int b){\n \tif(a<b||b<0)return 0;\n \treturn fact[a]*finv[b]%mod*finv[a-b]%mod;\n}\nvoid init_C(int n){\n\tfact[0]=finv[0]=inv[1]=1;\n\tfor(int i=2;i<n;i++){\n\t\tinv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;\n\t}\n\tfor(int i=1;i<n;i++){\n\t\tfact[i]=fact[i-1]*i%mod;\n\t\tfinv[i]=finv[i-1]*inv[i]%mod;\n\t}\n}\nlong long pw(long long a,long long b){\n\tif(a<0LL)return 0;\n\tif(b<0LL)return 0;\n\tlong long ret=1;\n\twhile(b){\n\t\tif(b%2)ret=ret*a%mod;\n\t\ta=a*a%mod;\n\t\tb/=2;\n\t}\n\treturn ret;\n}\nint ABS(int a){return max(a,-a);}\nlong long ABS(long long a){return max(a,-a);}\ndouble ABS(double a){return max(a,-a);}\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\n// ここから編集しろ\n\nint main(){\n\tint a,b;scanf(\"%d%d\",&a,&b);\n\tdouble p=0.01*b;\n\tdouble ret=0;\n\tif(a%2){\n\t\tret=p*(1+(a-1)/2/p)+(1-p)*(1+(a+1)/2/p);\n\t}else{\n\t\tret=a/2/p;\n\t}\n\tprintf(\"%.12f\\n\",ret);\n}", "/* ▄▄▄▄▄▄▄▄▄▄▄ ▄▄▄▄▄▄▄▄▄▄▄▄ ▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄ ▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄▄▄▄▄▄▄▄▄▄\n▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░▌ ▐░▌ ▐░░░░░░░░░░░▌▐░▌ ▐░▌ ▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░░░░░░░░░░▌\n▐░█▀▀▀▀▀▀▀▀▀ ▐░█▀▀▀▀▀▀▀█░▌▐░▌ ▐░▌ ▐░█▀▀▀▀▀▀▀█░▌▐░▌ ▐░▌ ▐░█▀▀▀▀▀▀▀▀▀ ▐░█▀▀▀▀▀▀▀█░▌▐░█▀▀▀▀▀▀▀█░▌\n▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌\n▐░█▄▄▄▄▄▄▄▄▄ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░▌▐░▌ ▄ ▐░▌ ▐░▌ ▄▄▄▄▄▄▄▄ ▐░▌ ▐░▌▐░▌ ▐░▌\n▐░░░░░░░░░░░▌▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░▌▐░░░░░░░░▌▐░▌ ▐░▌▐░▌ ▐░▌\n▐░█▀▀▀▀▀▀▀▀▀ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌░▌ ▐░▌ ▐░▌ ▀▀▀▀▀▀█░▌▐░▌ ▐░▌▐░▌ ▐░▌\n▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░▌▐░▌▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌▐░▌ ▐░▌\n▐░▌ ▐░█▄▄▄▄▄▄▄█░▌▐░█▄▄▄▄▄▄▄▄▄ ▐░█▄▄▄▄▄▄▄▄▄ ▐░█▄▄▄▄▄▄▄█░▌▐░▌░▌ ▐░▐░▌ ▐░█▄▄▄▄▄▄▄█░▌▐░█▄▄▄▄▄▄▄█░▌▐░█▄▄▄▄▄▄▄█░▌\n▐░▌ ▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░░▌ ▐░░▌ ▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░░░░░░░░░░▌\n ▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀ */\n\n//#pragma optimization_level 3\n\n//#pragma comment(linker, \"/stack:200000000\")\n//#pragma GCC optimize(\"Ofast\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n#include <map>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <chrono>\n#include <ctime>\n#include <queue>\n#include <math.h>\n#include <deque>\n#include <stack>\n#include <iomanip>\n#include <assert.h>\n#include <stdio.h>\n#include <cstring>\n#include <random>\n\nusing namespace std;\n\n//#define int long long\n#define ll long long\n#define ull unsigned long long\n#define ld long double\n#define pii pair<int, int>\n#define pld pair<ld, ld>\n#define ti tuple<int, int, int>\n#define vi vector <int>\n#define vpi vector <pii>\n#define vld vector <ld>\n#define try tr\n#define left left11\n#define right right11\n#define lb lower_bound\n#define ub upper_bound\n#define sz(c) (int)(c).size()\n#define all(c) (c).begin(), (c).end()\n#define pb push_back\n#define pf push_front\n#define sqr(a) ((a) * (a))\n#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);\n\n#define x first\n#define y second\n\nmt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n\nclock_t START;\n\ninline ld TIME() {\n return (ld) (clock() - START) / CLOCKS_PER_SEC;\n}\n\nvoid SHOW() {\n cout << fixed << setprecision(10);\n cout << TIME() << \" SECONDS FROM START\\n\";\n}\n\nld TL = 2.0; \nint calls = 0;\n\ninline bool IS() {\n if(++calls == 1000) {\n calls = 0;\n if(TL - TIME() < 0.1)\n return true;\n }\n return false;\n}\n\ntemplate<typename T1, typename T2>\ninline bool amin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }\n\ntemplate<typename T1, typename T2>\ninline bool amax(T1 &a, T2 b) { if (a < b) {a = b; return true;} return false; }\n\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, pair<T1, T2> &p) {\n os << p.first << ' ' << p.second;\n return os;\n}\n\ntemplate<typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate<typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (auto &u : v) is >> u;\n return is;\n}\n\ntemplate<typename T>\nostream &operator<<(ostream &os, vector<T> &v) {\n for (auto &u : v) os << u << ' ';\n return os;\n}\n\nint hash_mod[4] = {1000000007, 998244353, 1000000009, 999999937}, mod = hash_mod[rnd() % 4];\nint hash_pows[4] = {179, 239, 1007, 2003}, P = hash_pows[rnd() % 4];\n\nint binpow(int x, int p) {\n int res = 1;\n while(p) {\n if(p % 2)\n res = (res * x) % mod;\n x = (x * x) % mod;\n p /= 2;\n }\n return res;\n}\n\nconst int N = 5e5 + 7, NS = 2e3 + 7, lg = 20, sq = 550, inf = 2e9 + 7, SM = 1e2 + 7;\nconst ld eps = 1e-9;\nvoid solve() {\n ld x, p;\n cin >> x >> p;\n p /= 100;\n if((int) (x) % 2 == 0) \n cout << fixed << setprecision(10) << x / (2 * p);\n else {\n cout << fixed << setprecision(10) << 1 + p * (x - 1) / (2 * p) + (1 - p) * (x + 1) / (2 * p);\n }\n} \n\nsigned main() {\n fast\n solve();\n}", "#include <iostream>\n#include <fstream>\n#include <cassert>\n#include <typeinfo>\n#include <vector>\n#include <stack>\n#include <cmath>\n#include <set>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <cstdio>\n#include <queue>\n#include <iomanip>\n#include <cctype>\n#include <random>\n#include <complex>\n#define syosu(x) fixed<<setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\ntypedef pair<double,double> pdd;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<P,int> pip;\ntypedef vector<pip> vip;\nconst int inf=1<<29;\nconst ll INF=1ll<<58;\nconst double pi=acos(-1);\nconst double eps=1e-7;\nconst ll mod=1e9+7;\nconst int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};\n\nint x;\ndouble p;\n\nint main(){\n\tcin>>x>>p;\n\tp/=100;\n\tif(x%2==1) x++;\n\tcout<<syosu(9)<<(double)x/2/p<<endl;\n}", "#include <algorithm>\n#include <cstdio>\n#include <functional>\n#include <iostream>\n#include <cfloat>\n#include <climits>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <time.h>\n#include <vector>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> i_i;\ntypedef pair<ll, int> ll_i;\ntypedef pair<double, int> d_i;\ntypedef pair<ll, ll> ll_ll;\ntypedef pair<double, double> d_d;\nstruct edge { int u, v; ll w; };\n\n#define rep(i, N) for (int i = 0; i < N; i++)\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\n\ndouble solve(int x, double P) {\n\treturn (double)x / 2 / P;\n}\n\nint main() {\n\tint x, p; cin >> x >> p;\n\tdouble P = p / 100.0;\n\tdouble ans;\n\tif (x % 2 == 0) ans = solve(x, P);\n\telse ans = 1 + P * solve(x - 1, P) + (1 - P) * solve(x + 1, P);\n\tprintf(\"%.15f\\n\", ans);\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define ii pair <int, int>\n#define app push_back\n#define all(a) a.begin(), a.end()\n#define bp __builtin_popcountll\n#define ll long long\n#define mp make_pair\n#define f first\n#define s second\n#define Time (double)clock()/CLOCKS_PER_SEC\n#define debug(x) std::cout << #x << \": \" << x << '\\n';\nsigned main() {\n #ifdef HOME\n freopen(\"input.txt\", \"r\", stdin);\n #else\n #define endl '\\n'\n ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);\n cout.setf(ios::fixed); cout.precision(20); \n #endif\n int x;\n int per;\n cin >> x >> per;\n\n double p = per/100.0;\n\n if (x % 2 == 0) {\n cout << (1/p) * (x/2) << endl;\n } \n else {\n\n double l = (1/p) * ((x - 1)/2) + 1;\n double r = (1/p) * ((x + 1)/2) + 1;\n cout << (per * l + (100 - per) * r) / 100.0 << endl;\n } \n \n}\n", "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#define MOD 1000000007\ntypedef long long ll;\nusing namespace std;\n\ndouble calc(int x,int p){\n return x*100.0/p;\n}\n\nint main(){\n int x,p;\n cin>>x>>p;\n\n double ans=0.0;\n if(x%2==0) ans=calc(x/2,p);\n else{\n ans=calc((x-1)/2,p)*p/100+calc((x+1)/2,p)*(100-p)/100+1;\n }\n cout<<fixed<<setprecision(10)<<ans<<endl;\n\n\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef complex<double> point;\n#define mapii map<int, int>\n#define debug(a) cout << #a << \": \" << a << endl\n#define debuga1(a, l, r) fto(i, l, r) cout << a[i] << \" \"; cout << endl\n#define fdto(i, r, l) for(int i = (r); i >= (l); --i)\n#define fto(i, l, r) for(int i = (l); i <= (r); ++i)\n#define forit(it, var) for(__typeof(var.begin()) it = var.begin(); it != var.end(); it++)\n#define forrit(rit, var) for(__typeof(var.rbegin()) rit = var.rbegin(); rit != var.rend(); rit++)\n#define ii pair<int, int>\n#define iii pair<int, ii>\n#define ff first\n#define ss second\n#define mp make_pair\n#define pb push_back\n#define maxN 100005\n#define MOD 1000\n#define oo 1000000000000000007LL\n#define sz(a) (int)a.size()\n\nconst double PI = acos(-1.0);\n\ndouble fRand(double fMin, double fMax)\n{\n double f = (double)rand() / RAND_MAX;\n return fMin + f * (fMax - fMin);\n}\n\ntemplate <class T>\nT min(T a, T b, T c) {\n return min(a, min(b, c));\n}\n\ntemplate <class T>\nT max(T a, T b, T c) {\n return max(a, max(b, c));\n}\n\nint x, p;\n\nint main () {\n scanf(\"%d%d\", &x, &p);\n\n double ans = (x+1)/2 * 100.0/p;\n printf(\"%.9g\", ans);\n\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long lli;\ntypedef double lld;\ntypedef vector<lli> vll;\ntypedef vector<bool> vbl;\ntypedef vector<double> vdl;\ntypedef vector<vector<lli>> mat;\ntypedef vector<vdl> mad;\ntypedef unordered_map<lli,unordered_map<lli,lli>> graph;\ntypedef complex<double> cmp;\ntypedef vector<cmp> vcl;\n\nlli x,p;\n\nint main(){\n cin >> x >> p;\n cout << setprecision(17);\n if(x%2 == 0) cout << 100.0/p*(x/2)<< endl;\n else cout << 100.0/p*((x+1)/2)*(100-p)/100+100.0/p*((x-1)/2)*p/100+1 << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define int ll\n\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,b) rng(i,0,b)\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\n#define per(i,b) gnr(i,0,b)\n#define pb push_back\n#define eb emplace_back\n#define a first\n#define b second\n#define bg begin()\n#define ed end()\n#define all(x) x.bg,x.ed\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\n\ntemplate<class t> using vc=vector<t>;\ntemplate<class t> using vvc=vc<vc<t>>;\n\nusing pi=pair<int,int>;\nusing vi=vc<int>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.a<<\",\"<<p.b<<\"}\";\n}\n\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\n#define mp make_pair\n#define mt make_tuple\n#define one(x) memset(x,-1,sizeof(x))\n#define zero(x) memset(x,0,sizeof(x))\n#ifdef LOCAL\nvoid dmpr(ostream&os){os<<endl;}\ntemplate<class T,class... Args>\nvoid dmpr(ostream&os,const T&t,const Args&... args){\n\tos<<t<<\" \";\n\tdmpr(os,args...);\n}\n#define dmp2(...) dmpr(cerr,\"Line:\",__LINE__,##__VA_ARGS__)\n#else\n#define dmp2(...) void(0)\n#endif\n\nusing uint=unsigned;\nusing ull=unsigned long long;\n\ntemplate<class t,size_t n>\nostream& operator<<(ostream&os,const array<t,n>&a){\n\treturn os<<vc<t>(all(a));\n}\n\ntemplate<int i,class T>\nvoid print_tuple(ostream&,const T&){\n}\n\ntemplate<int i,class T,class H,class ...Args>\nvoid print_tuple(ostream&os,const T&t){\n\tif(i)os<<\",\";\n\tos<<get<i>(t);\n\tprint_tuple<i+1,T,Args...>(os,t);\n}\n\ntemplate<class ...Args>\nostream& operator<<(ostream&os,const tuple<Args...>&t){\n\tos<<\"{\";\n\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\n\treturn os<<\"}\";\n}\n\nvoid print(ll x,int suc=1){\n\tcout<<x;\n\tif(suc==1)\n\t\tcout<<\"\\n\";\n\tif(suc==2)\n\t\tcout<<\" \";\n}\n\nll read(){\n\tll i;\n\tcin>>i;\n\treturn i;\n}\n\nvi readvi(int n,int off=0){\n\tvi v(n);\n\trep(i,n)v[i]=read()+off;\n\treturn v;\n}\n\ntemplate<class T>\nvoid print(const vector<T>&v,int suc=1){\n\trep(i,v.size())\n\t\tprint(v[i],i==int(v.size())-1?suc:2);\n}\n\nstring readString(){\n\tstring s;\n\tcin>>s;\n\treturn s;\n}\n\ntemplate<class T>\nT sq(const T& t){\n\treturn t*t;\n}\n\n//#define CAPITAL\nvoid yes(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"YES\"<<endl;\n\t#else\n\tcout<<\"Yes\"<<endl;\n\t#endif\n\tif(ex)exit(0);\n}\nvoid no(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"NO\"<<endl;\n\t#else\n\tcout<<\"No\"<<endl;\n\t#endif\n\tif(ex)exit(0);\n}\nvoid possible(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"POSSIBLE\"<<endl;\n\t#else\n\tcout<<\"Possible\"<<endl;\n\t#endif\n\tif(ex)exit(0);\n}\nvoid impossible(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"IMPOSSIBLE\"<<endl;\n\t#else\n\tcout<<\"Impossible\"<<endl;\n\t#endif\n\tif(ex)exit(0);\n}\n\nconstexpr ll ten(int n){\n\treturn n==0?1:ten(n-1)*10;\n}\n\nconst ll infLL=LLONG_MAX/3;\n\n#ifdef int\nconst int inf=infLL;\n#else\nconst int inf=INT_MAX/2-100;\n#endif\n\nint topbit(signed t){\n\treturn t==0?-1:31-__builtin_clz(t);\n}\nint topbit(ll t){\n\treturn t==0?-1:63-__builtin_clzll(t);\n}\nint botbit(signed a){\n\treturn a==0?32:__builtin_ctz(a);\n}\nint botbit(ll a){\n\treturn a==0?64:__builtin_ctzll(a);\n}\nint popcount(signed t){\n\treturn __builtin_popcount(t);\n}\nint popcount(ll t){\n\treturn __builtin_popcountll(t);\n}\nbool ispow2(int i){\n\treturn i&&(i&-i)==i;\n}\nint mask(int i){\n\treturn (int(1)<<i)-1;\n}\n\nbool inc(int a,int b,int c){\n\treturn a<=b&&b<=c;\n}\n\ntemplate<class t> void mkuni(vc<t>&v){\n\tsort(all(v));\n\tv.erase(unique(all(v)),v.ed);\n}\n\nll rand_int(ll l, ll r) { //[l, r]\n\t#ifdef LOCAL\n\tstatic mt19937_64 gen;\n\t#else\n static random_device rd;\n static mt19937_64 gen(rd());\n #endif\n return uniform_int_distribution<ll>(l, r)(gen);\n}\n\ntemplate<class t>\nint lwb(const vc<t>&v,const t&a){\n\treturn lower_bound(all(v),a)-v.bg;\n}\n\nsigned main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tcout<<fixed<<setprecision(20);\n\t\n\tint x;cin>>x;\n\tusing ld=long double;\n\tld p;cin>>p;\n\tp/=100;\n\t\n\tld ans=0;\n\tif(x%2==0){\n\t\tans=x/2/p;\n\t}else{\n\t\tans=1;\n\t\tans+=(x-1)/2/p*p;\n\t\tans+=(x+1)/2/p*(1-p);\n\t}\n\t\n\tcout<<ans<<endl;\n}\n", "import java.io.*;\nimport java.math.BigDecimal;\nimport java.util.Arrays;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.Function;\n\npublic class Main {\n\n static int X, P;\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n X = sc.nextInt();\n P = sc.nextInt();\n\n System.out.println(BigDecimal.valueOf(solve()).toPlainString());\n }\n\n static double solve() {\n if( X % 2 == 1 ) {\n double p = (double)P/100;\n return 1 + f(X-1) * p + f(X+1) * (1-p);\n\n } else {\n return f(X);\n }\n }\n\n // xは偶数\n static double f(int x) {\n // f(x) = 1 + p*f(x-2) + q*f(x)\n // => f(x) = f(x-2) + 1/p\n // => f(x) = 1/p * 1/2 * x\n double p = (double)P/100;\n return (double)x / 2 / p;\n }\n\n @SuppressWarnings(\"unused\")\n static class FastScanner {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n int[] nextIntArray(int n, int delta) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt() + delta;\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n static <A> void writeLines(A[] as, Function<A, String> f) {\n PrintWriter pw = new PrintWriter(System.out);\n for (A a : as) {\n pw.println(f.apply(a));\n }\n pw.flush();\n }\n\n static void writeLines(int[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (int a : as) pw.println(a);\n pw.flush();\n }\n\n static void writeLines(long[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (long a : as) pw.println(a);\n pw.flush();\n }\n\n static int max(int... as) {\n int max = Integer.MIN_VALUE;\n for (int a : as) max = Math.max(a, max);\n return max;\n }\n\n static int min(int... as) {\n int min = Integer.MAX_VALUE;\n for (int a : as) min = Math.min(a, min);\n return min;\n }\n\n static void debug(Object... args) {\n StringJoiner j = new StringJoiner(\" \");\n for (Object arg : args) {\n if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));\n else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));\n else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));\n else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));\n else j.add(arg.toString());\n }\n System.err.println(j.toString());\n }\n}\n", "#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <queue>\n#include <set>\n#include <map>\n#include <cmath>\n#include <iomanip>\n#include <cassert>\n#include <bitset>\nusing namespace std;\n\n//typedef pair<int, int> P;\n#define rep(i, n) for (int i=0; i<(n); i++)\n#define all(c) (c).begin(), (c).end()\n#define uniq(c) c.erase(unique(all(c)), (c).end())\n#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())\n#define _1 first\n#define _2 second\n#define pb push_back\n#define INF 1145141919\n#define MOD 1000000007\n\nint X, P, Q;\nsigned main() {\n ios::sync_with_stdio(false); cin.tie(0);\n cin >> X >> P;\n Q = 100-P;\n double np = 1+(double)Q/(double)P;\n double ans = 0;\n if (X%2) {\n ans += (P/100.0)*(1+((X-1)/2)*np);\n ans += (1-(P/100.0))*(1+((X+1)/2)*np);\n }\n else {\n ans += (X/2)*np;\n }\n cout << fixed << setprecision(20) << ans << \"\\n\";\n return 0;\n}\n", "print((int(input())+1)//2/int(input())*100)", "#include \"iostream\"\n#include \"iomanip\"\nusing namespace std;\n\nlong double X;\nlong double rad;\nlong double ans;\n\nint main() {\n\tcin >> X >> rad;\n\tif ((long long int)X % 2 == 0) {\n\t\tfor (int i = 0; i < 10000000; i++) {\n\t\t\tans = (ans + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;\n\t\t}\n\t}\n\telse {\n\t\tfor (int i = 0; i < 10000000; i++) {\n\t\t\tans = (ans+1 + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;\n\t\t}\n\t}\n\tcout << setprecision(15) << ans<<\"\\n\";\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing ll = long long;\nint main()\n{\n ll x, p;\n std::cin >> x >> p;\n if (x == 0) { return std::cout << 0 << std::endl, 0; }\n std::cout << std::fixed << std::setprecision(15) << (x % 2 == 0 ? 50.0 * x / p : 50.0 * (1 + x) / p) << std::endl;\n return 0;\n}\n", "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <vector>\n#include <deque>\n#include <queue>\n#include <array>\n#include <set>\n#include <map>\n#include <cmath>\n#include <algorithm>\n#include <numeric>\n#include <utility>\n#include <tuple>\n#include <functional>\n#include <bitset>\n#include <cstdint>\n#include <cassert>\n#include <random>\n\nusing namespace std;\nusing i64 = int64_t;\nusing i32 = int32_t;\ntemplate<class T, class U> void init_n(vector<T>& v, size_t n, U x) \n{ v = vector<T>(n, x); }\ntemplate<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }\ntemplate<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) \n{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }\ntemplate<class T> void read_n(T a[], size_t n, size_t o = 0)\n{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }\ntemplate<class T> T gabs(const T& x) { return max(x, -x); }\n#define abs gabs\n\nint main() {\n i64 x;\n double p;\n cin >> x >> p;\n p /= 100;\n double ans;\n if (x % 2 == 0) {\n ans = x / (2 * p);\n } else {\n ans = 1.0 + (p * (x - 1) + (1.0 - p) * (x + 1)) / (2 * p);\n }\n printf(\"%.10f\\n\", ans);\n return 0;\n}\n\n", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <queue>\n#include <ctime>\n#include <cassert>\n#include <complex>\n#include <string>\n#include <cstring>\n#include <chrono>\n#include <random>\n#include <bitset>\n#include <iomanip>\n\n#pragma GCC optimize(\"Ofast\")\n//#pragma GCC optimization(\"unroll-loops, no-stack-protector\")\n//#pragma GCC target(\"avx,avx2,fma\")\n \nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\ntemplate<typename T>\nusing pair2 = pair<T, T>;\nusing pii = pair<int, int>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\n\n#define pb push_back\n#define mp make_pair\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define endl '\\n';\n \nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n \ntemplate <class T> inline T gcd(T a, T b) { while (b) { a %= b; swap(a, b); } return a; }\ntemplate <class T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }\n\n#ifdef LOCAL\n #define eprintf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);\n#else\n #define eprintf(...) 42\n#endif\n\nclock_t startTime;\ndouble getCurrentTime() {\n return (double)(clock() - startTime) / CLOCKS_PER_SEC;\n}\n\nconst ll INF = (ll)1e18;\nll MOD;\n\nll add(ll x, ll y) {\n x += y;\n if (x >= MOD) return x - MOD;\n return x;\n}\nll sub(ll x, ll y) {\n x -= y;\n if (x < 0) return x + MOD;\n return x;\n}\nll mul(ll x, ll y) {\n return (x * y) % MOD;\n}\nll bin_pow(ll x, ll p) {\n if (p == 0) return 1;\n if (p & 1) return mul(x, bin_pow(x, p - 1));\n return bin_pow(mul(x, x), p / 2);\n}\n\nconst int N = 2000100;\n\n\nint main()\n{\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n \n startTime = clock();\n// freopen(\"input.txt\", \"r\", stdin);\n// freopen(\"output.txt\", \"w\", stdout);\n \n ld p, ans = 0;\n ll x;\n cin >> x >> p;\n \n p /= 100;\n if (x % 2 == 0) {\n ans = x / 2 / p;\n }\n else {\n ans = 1 + (x + 1) * (1 - p) / 2 / p + (x - 1) / 2;\n }\n cout << setprecision(10) << ans << endl;\n \n return 0;\n}\n", "// need\n#include <iostream>\n#include <algorithm>\n\n// data structure\n#include <bitset>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <complex>\n//#include <deque>\n#include <valarray>\n\n// stream\n//#include <istream>\n//#include <sstream>\n//#include <ostream>\n#include <fstream>\n\n// etc\n#include <cassert>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;\n\n// output\n#define OUT(d) std::cout<<(d);\n#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<(d);\n#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<(d);\n#define SP std::cout<<\" \";\n#define TAB std::cout<<\"\\t\";\n#define BR std::cout<<\"\\n\";\n#define SPBR(i, n) std::cout<<(i + 1 == n ? '\\n' : ' ');\n#define ENDL std::cout<<std::endl;\n#define FLUSH std::cout<<std::flush;\n#define SHOW(d) {std::cerr << #d << \"\\t:\" << (d) << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\n\";}\n\n// utility\n#define ALL(a) (a).begin(),(a).end()\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)\n#define REP(i, n) for(int i=0;i<int(n);++i)\n#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)\n#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)\n#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)\n#define REPLL(i, n) for(ll i=0;i<ll(n);++i)\n#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)\n#define IN(a, x, b) (a<=x && x<b)\ntemplate<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }\ntemplate<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\nvoid CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << \"[Time:\" << res << \"ns (\" << res / (1.0e9) << \"s)]\\n\"; }\n\n// test\ntemplate<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {\n\treturn std::vector<std::vector<T>>(n, std::vector<T>(m, init));\n}\ntemplate<typename S, typename T>\nstd::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\n\tos << \"(\" << p.first << \", \" << p.second << \")\"; return os;\n}\n\n// type/const\n#define int ll\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing PAIR = std::pair<int, int>;\nusing PAIRLL = std::pair<ll, ll>;\nconstexpr int INFINT = 1 << 30; // 1.07x10^ 9\nconstexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9\nconstexpr ll INFLL = 1LL << 60; // 1.15x10^18\nconstexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18\nconstexpr double EPS = 1e-9;\nconstexpr int MOD = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\n\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\n\n// ------------>8------------------------------------->8------------\n\n\nsigned main() {\n\tINIT;\n\n\tVAR(int, x, p);\n\tFOUT(12, (x + 1) / 2 * 100. / p)BR;\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<int, int> pii;\ntypedef long long ll;\ntypedef vector<int> vi;\n\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define fi first\n#define se second\n#define rep(i,n) rep2(i,0,n)\n#define rep2(i,m,n) for(int i=m;i<(n);i++)\n#define ALL(c) (c).begin(),(c).end()\n\nint x, pp;\nbool f;\n\nint main() {\n\tcin >> x >> pp;\n\tdouble p = (double)pp / 100;\n\n\tf = x & 1;\n\tint zan = x / 2;\n\n\tdouble ret;\n\tif (f) {\n\t\tret = (1/p) * (p * zan + (1-p) * (zan + 1)) + 1;\n\t} else {\n\t\tret = (1/p) * zan;\n\t}\n\n\tprintf(\"%.8f\\n\", ret);\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing cd = complex<ld>;\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int x, p;\n cin >> x >> p;\n cout.precision(10);\n x += x % 2;\n cout << fixed << x * 100.0 / (2 * p);\n return 0;\n}", "// includes\n#include <bits/stdc++.h>\nusing namespace std;\n\n// macros\n#define pb emplace_back\n#define mk make_pair\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define rep(i, n) FOR(i, 0, n)\n#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)\n#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)\n#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define sz(x) ((int)(x).size())\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())\n#define bit(n) (1LL<<(n))\n// functions\ntemplate <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}\ntemplate <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << \" \" << p.second; return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << \":\" << itr->second; auto titr = itr; if(++titr != mp.end())os << \" \"; } return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << \":\" << itr->second; auto titr = itr; if(++titr != mp.end())os << \" \"; } return os;}\n// types\nusing ll = long long int;\nusing P = pair<int, int>;\n// constants\nconst int inf = 1e9;\nconst ll linf = 1LL << 50;\nconst double EPS = 1e-10;\nconst int mod = 1000000007;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, -1, 0, 1};\n// io\nstruct fast_io{\n fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}\n} fast_io_;\n\n\nint main(int argc, char const* argv[])\n{\n ll x;\n double p; cin >> x >> p;\n p *= 0.01;\n double res = (x / 2) / p;\n if(x & 1)res += 1 / p;\n cout << res << endl;\n return 0;\n}\n", "x = int(input())\np = int(input()) / 100\nprint(((x + 1) // 2) / p)\n", "#include <bits/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\n#define EPS 1e-10\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)\n#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)\n#define each(a,b) for(auto& (a): (b))\n#define all(v) (v).begin(),(v).end()\n#define len(v) (int)(v).size()\n#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())\n#define cmx(x,y) x=max(x,y)\n#define cmn(x,y) x=min(x,y)\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout<<#x<<\" = \"<<(x)<<endl\n#define spair(p) cout<<#p<<\": \"<<p.fi<<\" \"<<p.se<<endl\n#define sar(a,n) cout<<#a<<\":\";rep(pachico,n)cout<<\" \"<<a[pachico];cout<<endl\n#define svec(v) cout<<#v<<\":\";rep(pachico,v.size())cout<<\" \"<<v[pachico];cout<<endl\n#define svecp(v) cout<<#v<<\":\";each(pachico,v)cout<<\" {\"<<pachico.first<<\":\"<<pachico.second<<\"}\";cout<<endl\n#define sset(s) cout<<#s<<\":\";each(pachico,s)cout<<\" \"<<pachico;cout<<endl\n#define smap(m) cout<<#m<<\":\";each(pachico,m)cout<<\" {\"<<pachico.first<<\":\"<<pachico.second<<\"}\";cout<<endl\n\nusing namespace std;\n\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<P> vp;\ntypedef vector<string> vs;\n\nconst int MAX_N = 100005;\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n int x, p;\n cin >> x >> p;\n if(p == 100){\n printf(\"%.12lf\\n\",(double)((x+1)/2));\n return 0;\n }\n printf(\"%.12lf\\n\",100.0*((x+1)/2)/p);\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define se second\n#define fi first\n#define mp make_pair\n#define pb push_back\n#define all(_v) _v.begin(), _v.end()\nconst int mod = (int)1e9 + 7;\nconst int INF = (int)1e9;\nconst ll LINF = (ll)1e18;\nconst int N = (int)1e5 + 100;\nconst int MAXA = (int)3e6;\nint main(){\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\tcout.tie(0);\n //ifstream cin(\"input.txt\");\n //ofstream cout(\"output.txt\");\n long double x,p;\n cin >> x >> p;\n p /= 100;\n cout << fixed << setprecision(7);\n if(!(int(x) & 1))cout << x / (2 * p); else cout << (x + 1) / (2 * p);\n return 0;\n}\n", "#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#include <cassert>\n#include <functional>\n\ntypedef long long ll;\nusing namespace std;\n\n#ifndef LOCAL\n#define debug(...) ;\n#else\n#define debug(...) cerr << __LINE__ << \" : \" << #__VA_ARGS__ << \" = \" << _tostr(__VA_ARGS__) << endl;\n\ntemplate<typename T>\nostream &operator<<(ostream &out, const vector<T> &v);\n\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &out, const pair<T1, T2> &p) {\n out << \"{\" << p.first << \", \" << p.second << \"}\";\n return out;\n}\n\ntemplate<typename T>\nostream &operator<<(ostream &out, const vector<T> &v) {\n out << '{';\n for (const T &item : v) out << item << \", \";\n out << \"\\b\\b}\";\n return out;\n}\n\nvoid _tostr_rec(ostringstream &oss) {\n oss << \"\\b\\b \\b\";\n}\n\ntemplate<typename Head, typename... Tail>\nvoid _tostr_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << head << \", \";\n _tostr_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate<typename... T>\nstring _tostr(T &&... args) {\n ostringstream oss;\n int size = sizeof...(args);\n if (size > 1) oss << \"{\";\n _tostr_rec(oss, forward<T>(args)...);\n if (size > 1) oss << \"}\";\n return oss.str();\n}\n#endif\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 200010\n\ndouble calc(int X, int P) {\n debug(X, X / 2 * 100.0 / P);\n X /= 2;\n\n return X * 100.0 / P;\n}\n\nint main() {\n int X, P;\n\n cin >> X >> P;\n\n double ans = 0;\n\n if (X % 2) {\n ans = (calc(X - 1, P) * P + calc(X + 1, P) * (100 - P)) / 100.0 + 1;\n } else {\n ans = calc(X, P);\n }\n\n printf(\"%.10lf\\n\", ans);\n\n return 0;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))\n#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))\nstatic const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;\ntypedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;\ntemplate<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }\ntemplate<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }\n\nint main() {\n\tint x; int p;\n\twhile(~scanf(\"%d%d\", &x, &p)) {\n\t\tdouble t = p * 1e-2;\n\t\tdouble ans = (x / 2) * (1. / t);\n\t\tif(x % 2 != 0) ans = 1 + t * ans + (ans + (1 / t)) * (1 - t);\n\t\tprintf(\"%.10f\\n\", ans);\n\t}\n\treturn 0;\n}\n", "import java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Scanner;\n\npublic class Main implements Runnable {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tpublic void run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong x = sc.nextLong();\n\t\tdouble p = sc.nextDouble();\n\t\tp /= 100;\n\t\tif (x % 2 == 1) {\n\t\t\t++x;\n\t\t}\n\t\tx /= 2;\n\t\tSystem.out.println(x / p);\n\t}\n\n\tvoid tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n}\n", "\nx = int(input())\n\np = int(input())\n\nif x % 2 == 0:\n print (100 * (x//2) / p)\nelse:\n print ((100 * (x//2+1) / p))\n", "#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<algorithm>\n#include<cmath>\n#include<set>\n#include<iomanip>\nusing namespace std;\ndouble memo[2000]={};\n\nint main(){\n int p;\n int64_t x;\n cin>>x>>p;\n double res=0.0;\n if(p==100){\n int64_t res=0;\n if(x%2==1){\n res=x/2+1;\n }else{\n res=x/2;\n }\n cout<<res<<endl;\n }else{\n if(x%2==1){\n x=(x+1)/2;\n res=100.0*x/(1.0*p);\n }else{\n x=x/2;\n res=100.0*x/(1.0*p);\n }\n cout<<setprecision(13)<<res<<endl;\n }\n \n \n \n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconst lint mod = 1e9 + 7;\n#define all(x) (x).begin(), (x).end()\n#define bitcount(n) __builtin_popcountl((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzl(x))\n#define rep(i, n) for(int i = 0; i < n; i++)\nconst int inf9 = 1e9; const lint inf18 = 1e18;\ntemplate<class T> inline void YES(T condition){ if(condition) cout << \"YES\" << endl; else cout << \"NO\" << endl; }\ntemplate<class T> inline void Yes(T condition){ if(condition) cout << \"Yes\" << endl; else cout << \"No\" << endl; }\ntemplate<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }\nlint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}\nstruct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }\ntemplate<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + \",\" + to_string(x.second); } string to_string(string x){ return x; }\ntemplate<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + \" \"; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }\ntemplate<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }\ntemplate<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }\nstruct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint P(int n, int r){ if(r < 0 || n < r) return 0; return (fact[n] * inv[n - r] % mod); } lint C(int p, int q){ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };\ntemplate<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }\ntemplate<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }\n\ndouble solve(lint dist, double p){\n return dist / p;\n}\n\nint main(){\n lint x;\n int p_100;\n cin >> x >> p_100;\n double p = p_100 / 100.0;\n if(x % 2){\n fcout << 1 + p * solve(x / 2, p) + (1 - p) * solve(x / 2 + 1, p) << endl;\n }else{\n fcout << solve(x / 2, p) << endl;\n }\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing uint=unsigned int;\nusing pcc=pair<char,char>;\nusing pii=pair<int,int>;\nusing pll=pair<ll,ll>;\nusing pdd=pair<double,double>;\nusing tuplis=pair<ll,pll>;\ntemplate<class T> using pq=priority_queue<T,vector<T>,greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MOD=1000000007;\nconst ll MODD=0x3b800001;\nconst int INF=0x3fffffff;\nconst double DINF=numeric_limits<double>::infinity();\nconst vector<pii> four={{-1,0},{0,1},{1,0},{0,-1}};\n#define _overload4(_1,_2,_3,_4,name,...) name\n#define _overload3(_1,_2,_3,name,...) name\n#define _rep1(n) _rep2(i,n)\n#define _rep2(i,n) _rep3(i,0,n)\n#define _rep3(i,a,b) for(ll i=a;i<b;++i)\n#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)\n#define _rrep1(n) _rrep2(i,n)\n#define _rrep2(i,n) _rrep3(i,0,n)\n#define _rrep3(i,a,b) for(ll i=b-1;i>=a;i--)\n#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)\n#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)\n#define each(i,a) for(auto&& i:a)\n#define sum(...) accumulate(range(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(range(__VA_ARGS__),double(0))\n#define _range(i) (i).begin(),(i).end()\n#define _range2(i,k) (i).begin(),(i).begin()+k\n#define _range3(i,a,b) (i).begin()+a,(i).begin()+b\n#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)\n#define _rrange(i) (i).rbegin(),(i).rend()\n#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k\n#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)\n#define yes(i) out(i?\"yes\":\"no\")\n#define Yes(i) out(i?\"Yes\":\"No\")\n#define YES(i) out(i?\"YES\":\"NO\")\n#define Possible(i) out(i?\"Possible\":\"Impossible\")\n#define elif else if\n#define unless(a) if(!(a))\n#define mp make_pair\n#define mt make_tuple\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type> name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type> name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n__attribute__((constructor)) void SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);};\ntemplate<class T>\ninline constexpr T gcd (T a,T b) {if(!a||!b)return 0;return a%b?gcd(b,a%b):b;}\ntemplate<class T>\ninline constexpr T lcm (T a,T b) {return a*b/gcd(a,b);}\ntemplate<class T>\ninline constexpr T min(vector<T>& v){return *min_element(range(v));}\ninline char min(string& v){return *min_element(range(v));}\ntemplate<class T>\ninline constexpr T max(vector<T>& v){return *max_element(range(v));}\ninline char max(string& v){return *max_element(range(v));}\ninline ll pow(ll a,ll b){if(b==0)return 1;ll ans=pow(a,b/2);return ans*ans*(b&1?a:1);}\ninline ll modpow(ll a,ll b,ll mod){if(b==0)return 1;ll ans=pow(a,b/2);return ans*ans*(b&1?a:1)%mod;}\ntemplate<typename T>\ninline bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}\ntemplate<typename T>\ninline bool update_max(T& mx,const T& cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}\ninline void in() {}\ntemplate<class T>\nistream& operator >> (istream& is, vector<T>& vec);\ntemplate<class T,size_t size>\nistream& operator >> (istream& is, array<T,size>& vec);\ntemplate<class T,class L>\nistream& operator >> (istream& is, pair<T,L>& p);\ntemplate<class T>\nostream& operator << (ostream& os, vector<T>& vec);\ntemplate<class T,class L>\nostream& operator << (ostream& os, pair<T,L>& p);\ntemplate<class T>\nistream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}\ntemplate<class T,class L>\nistream& operator >> (istream& is, pair<T,L>& p){is >> p.first;is >> p.second;return is;}\ntemplate<class T>\nostream& operator << (ostream& os, vector<T>& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;}\ntemplate<class T>\nostream& operator << (ostream& os, deque<T>& deq){os << deq[0];rep(i,1,deq.size()){os << ' ' << deq[i];}return os;}\ntemplate<class T,class L>\nostream& operator << (ostream& os, pair<T,L>& p){os << p.first << \" \" << p.second;return os;}\ntemplate<class T,class L>\npair<T,L> operator + (pair<T,L> a, pair<T,L> b){return {a.first + b.first, a.second + b.second};}\ntemplate<class T,class L>\npair<T,L> operator +=(pair<T,L> a, pair<T,L> b){a.first += b.first; a.second += b.second; return a;}\ntemplate <class Head, class... Tail>\ninline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);}\ntemplate <class T>\ninline bool out(T t){cout<<t<<'\\n';return 0;}\ninline bool out(){cout<<'\\n';return 0;}\ntemplate <class Head, class... Tail>\ninline bool out(Head head,Tail... tail){cout<<head<<' ';out(move(tail)...);return 0;}\ntemplate <class T>\ninline void err(T t){cerr<<t<<'\\n';}\ninline void err(){cerr<<'\\n';}\ntemplate <class Head, class... Tail>\ninline void err(Head head,Tail... tail){cerr<<head<<' ';out(move(tail)...);}\n\n\n\n\nsigned main(){\n LL(x,p1);\n double p=p1/100.0;\n if(x&1){\n out((x+1)/2/p);\n }else{\n out(x/2/p);\n }\n}\n\n\n\n\n\n\n", "// g++ -std=c++11 a.cpp\n#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<unordered_map>\n#include<utility>\n#include<cmath>\n#include<random>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<bitset>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#include<assert.h>\n#include<typeinfo>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\n#define FOR(i,a) for(auto i:a)\n#define pb push_back\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n#define show1d(v) {rep(_,v.size())cout<<\" \"<<v[_];puts(\"\");}\n#define show2d(v) {rep(__,v.size())show1d(v[__]);}\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\n#define int ll\ntypedef int Def;\ntypedef pair<Def,Def> pii;\ntypedef vector<Def> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<Def,pii> pip;\ntypedef vector<pip>vip;\n#define mt make_tuple\ntypedef tuple<int,int,int,int> tp;\ntypedef vector<tp> vt;\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\n//template<class C>constexpr int size(const C &c){return (int)c.size();}\n//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}\nconst double PI=acos(-1);\nconst double EPS=1e-9;\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;\n// int dx[]={0,1,0,-1};\n// int dy[]={1,0,-1,0};//RDLU\n#define yes puts(\"YES\")\n#define no puts(\"NO\")\n\nsigned main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tint x,p;\n\tcin>>x>>p;\n\tcout<<shosu(9)<<(x+1)/2*100./p<<endl;\n}\n", "#include <iomanip>\n#include <iostream>\nusing namespace std;\n\nint main () {\n int n, p; cin >> n >> p;\n cout << setprecision(12) << (n%2 ? 100.0 / p * (n/2 + 1) : 100.0 / p * (n/2)) << endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nconst int inf = numeric_limits<int>::max() / 2;\n\n\nint main(void){\n int x,p;\n cin >> x >> p;\n cout << setprecision(15) << ceil(x/2.0) * (100.0/p) << endl;\n}\n", "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll x,p;cin>>x>>p;\n if(p==100){\n if(x%2) cout<<1+(x-1)/2<<endl;\n else cout<<x/2<<endl;\n }\n else{\n bool f=false;\n if(x%2){\n x++;\n f=true;\n }\n ld a= x/2*(100.0/p), b=(x-2)/2*(100.0/p);\n if(!f){\n cout<<fixed<<setprecision(10)<<a<<endl;\n }\n else{\n ld res=a*(100.0-p)/100 + b*p/100.0;\n cout<<fixed<<setprecision(10)<<1+res<<endl;\n }\n }\n}\n", "x = int(input())\np = int(input())\nl = p / 100\n\ndef f(d):\n return (d / 2) * 100 / p\n\nif x % 2 == 0:\n res = f(x)\nelse:\n res = 1 + l * f(x - 1) + (1 - l) * f(x + 1)\n\nprint(res)", "#include <iostream>\n\nusing namespace std;\nint main(){\n\tcout.precision(20);\n\tlong long x;\n\tlong double p,ans;\n\tcin >> x >> p;\n\tans = (x/2)*100/p;\n\tif(x%2){\n\t\tans += 100/p;\n\t}\n\tcout << ans << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tios_base::sync_with_stdio(false); cin.tie(0);\n\t\n\tint x, percent;\n\tdouble p;\n\n\tcin >> x >> percent;\n\tp = percent / 100.0;\n\n\tdouble e = ((x + 1) / 2) / p;\n\n\tcout << setprecision(6) << fixed << e << endl;\n}", "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <algorithm>\n#include <string>\n#include <utility>\n#include <set>\n#include <stack>\n#include <deque>\n#include <ctime>\n#include <random>\n#include <cassert>\n#include <cmath>\n#include <climits>\n#include <queue>\n#include <cstring>\n#include <bitset>\n#include <iomanip>\n#include <chrono>\n\n/*\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"popcnt\")\n#pragma GCC target(\"avx2\")\n*/\n\n\n#ifdef LOCAL\n #define dbg(x) cout << #x << \" : \" << x << endl;\n#else \n #define dbg(x)\n#endif\n\n#define int long long\n#define pb push_back\n#define ppb pop_back()\n#define mp make_pair\n#define fi(a,b) for (int i=a;i<b;i++)\n#define fj(a,b) for (int j=a;j<b;j++)\n#define fk(a,b) for (int k=a;k<b;k++)\n#define fi1(a,b) for (int i=a-1;i>=b;i--)\n#define fj1(a,b) for (int j=a-1;j>=b;j--)\n#define fk1(a,b) for (int k=a-1;k>=b;k--)\n#define fx(x,a) for (auto& x : a)\n#define rep(i, a, b) for (int i = a; i < b; ++i)\n#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)\n#define siz(x) (int)x.size()\n#define lb lower_bound\n#define ub upper_bound\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n\nusing namespace std;\n\ntemplate<typename T1, typename T2>inline void mine(T1 &x, T2 y) { if (x > y) x = y; }\ntemplate<typename T1, typename T2>inline void maxe(T1 &x, T2 y) { if (x < y) x = y; }\n\nostream& operator << (ostream &a, const vector<int> &b) {\n for (auto k : b) cout << k << ' ';\n return a;\n}\n\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef char ch;\ntypedef string str;\ntypedef pair<int, int> pii;\ntypedef map<int, int> mii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vpii;\ntypedef vector<vpii> vvpii;\ntypedef vector<ch> vch;\ntypedef vector<vch> vvch;\ntypedef vector<str> vs;\n\n\n\nconst int MOD = 1000000007;\nconst int INF = 1000000050;\nconst long long BIG = (long long)2e18 + 50;\nconst int MX = 200010;\nconst double EPS = 1e-9;\n\n\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\ndouble p;\n\ndouble M(int x) {\n return x / (2 * p);\n}\n\nint32_t main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n \n int x;\n cin >> x >> p;\n p /= 100;\n double ans;\n if (x % 2)\n ans = M(x - 1) * p + M(x + 1) * (1 - p) + 1;\n else\n ans = M(x);\n cout << setprecision(15) << fixed;\n cout << ans << '\\n'; \n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing pii = pair<int, int>;\n\nint main() {\n int x;\n double p;\n cin >> x >> p;\n p /= 100;\n double res = 0;\n if(x & 1) {\n res = 1 + (x - 1.0) / 2 + (1 - p) * (x + 1.0) / 2 / p;\n } else {\n res = x / 2.0 / p;\n }\n cout << fixed << setprecision(10) << res << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef long long LL;\ntypedef pair<LL, LL> PLL;\n\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort((c).begin(),(c).end())\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\n\ndouble C[1010][1010];\ndouble ps[1010], qs[1010];\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n LL x, p; cin >> x >> p;\n cout << fixed << setprecision(9) << ((x+1)/2) * 100. / p << endl;\n return 0;\n /*\n if(p == 100){\n\tcout << (x+1)/2 << endl;\n\treturn 0;\n }\n if(x > 10) return 1;\n\n ps[0] = qs[0] = 1.;\n REP(i,1000){\n\tps[i+1] = ps[i] * p / 100.;\n\tqs[i+1] = qs[i] * (100-p) / 100.;\n }\n for(int i=1;i<1000;++i){\n\tC[i][0] = ps[i];\n\tC[i][i] = qs[i];\n\tfor(int j=1;j<i;++j)\n\t C[i][j] = C[i-1][j] * qs[1] + C[i-1][j-1] * ps[1];\n }\n\n const int MAX = 10020;\n vector<vector<double>> xs(2, vector<double>(MAX));\n int crt = 0, nxt = 1;\n xs[crt][MAX/2+x] = 1.;\n\n int px = MAX/2;\n double ans = 0.;\n REP(t,MAX/2-20){\n\tfill(ALL(xs[nxt]), 0);\n\tREP(a,MAX){\n\t if(a-1 >= 0)\n\t\txs[nxt][a-1] += xs[crt][a] * p / 100.;\n\t if(a+1<MAX)\n\t\txs[nxt][a+1] += xs[crt][a] * (100.-p) / 100.;\n\t}\n\tswap(crt, nxt);\n\n\tif(xs[crt][px] < EPS && xs[crt][px-1] < EPS && xs[crt][px+1] < EPS)\n\t ++px;\n\telse if(xs[crt][px] > xs[crt][px-1] && xs[crt][px] > xs[crt][px+1])\n\t ;\n\telse if(xs[crt][px-1] > xs[crt][px] && xs[crt][px-1] > xs[crt][px+1])\n\t --px;\n\telse if(xs[crt][px+1] > xs[crt][px-1] && xs[crt][px+1] > xs[crt][px])\n\t ++px;\n\tans += (t+1) * xs[crt][px];\n\txs[crt][px] = 0.;\n }\n\n cout << fixed << setprecision(9) << ans << endl;\n */ \n return 0;\n}\n", "/*\n\nThis Submission is to determine how many 120/240 min const. delivery point there are.\n\n//info\n120 req. steps <= 5\n*/\n#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <cstring>\n#include <queue>\n#include <stack>\n#include <math.h>\n#include <iterator>\n#include <vector>\n#include <string>\n#include <set>\n#include <math.h>\n#include <iostream>\n#include <random>\n#include<map>\n#include <iomanip>\n#include <time.h>\n#include <stdlib.h>\n#include <list>\n#include <typeinfo>\n#include <list>\n#include <set>\n#include <cassert>\n#include<fstream>\n#include <unordered_map>\n#include <cstdlib>\n#include <complex>\n#include <cctype>\n#include <bitset>\nusing namespace std;\ntypedef string::const_iterator State;\n#define Ma_PI 3.141592653589793\n#define eps 1e-5\n#define LONG_INF 1e18\n#define GOLD 1.61803398874989484820458\n#define MAX_MOD 1000000007\n#define MOD 998244353\n#define seg_size 262144\n#define REP(a,b) for(long long a = 0;a < b;++a)\n\nunsigned long xor128() {\n\tstatic unsigned long x = time(NULL), y = 362436069, z = 521288629, w = 88675123;\n\tunsigned long t = (x ^ (x << 11));\n\tx = y; y = z; z = w;\n\treturn (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\n}\ndouble dot(complex<double> a, complex<double> b) {\n\treturn a.real() * b.real() + a.imag() * b.imag();\n}\ndouble gyaku_dot(complex<double> a, complex<double> b) {\n\treturn a.real() * b.imag() - a.imag() * b.real();\n}\ndouble leng(complex<double> a) {\n\treturn sqrt(a.real() * a.real() + a.imag() * a.imag());\n}\ndouble angles(complex<double> a, complex<double> b) {\n\tdouble cosine = dot(a, b) / (leng(a) * leng(b));\n\tdouble sine = gyaku_dot(a, b) / (leng(a) * leng(b));\n\tdouble kaku = acos(min((double)1.0, max((double)-1.0, cosine)));\n\tif (sine <= 0) {\n\t\tkaku = 2 * Ma_PI - kaku;\n\t}\n\treturn kaku;\n}\nvector<int> convex_hull(vector<complex<double>> a) {\n\tvector<int> ans;\n\tdouble now_minnest = a[0].real();\n\tint now_itr = 0;\n\tREP(i, a.size()) {\n\t\tif (now_minnest > a[i].real()) {\n\t\t\tnow_minnest = a[i].real();\n\t\t\tnow_itr = i;\n\t\t}\n\t}\n\tans.push_back(now_itr);\n\tcomplex<double> ba(0, 1);\n\twhile (true) {\n\t\tint now_go = 0;\n\t\tdouble now_min = 0;\n\t\tdouble now_length = 0;\n\t\tint starter = ans[ans.size() - 1];\n\t\tfor (int i = 0; i < a.size(); ++i) {\n\t\t\tif (i != starter) {\n\t\t\t\tdouble goa = angles(ba, a[i] - a[starter]);\n\t\t\t\tif (goa - now_min >= eps || (abs(goa - now_min) <= eps && (abs(a[i] - a[starter]) - now_length) >= eps)) {\n\t\t\t\t\tnow_min = goa;\n\t\t\t\t\tnow_go = i;\n\t\t\t\t\tnow_length = abs(a[i] - a[starter]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (now_go == ans[0]) break;\n\t\tans.push_back(now_go);\n\t\tba = complex<double>(a[now_go] - a[starter]);\n\t}\n\treturn ans;\n}\nint main() {\n\tdouble x, p;\n\tcin >> x >> p;\n\tp /= 100.0;\n\tcout << fixed << setprecision(100);\n\tcout << ceil(x / 2) / p << endl;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\ndouble calc(int n, int p) {\n return 100.0 * n / p;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int x, p;\n cin >> x >> p;\n double ans = 0;\n if (x % 2 == 0) {\n ans = calc(x / 2, p);\n } else {\n ans = calc((x-1)/2, p) * p / 100 + calc((x+1)/2,p) * (100-p)/100 + 1;\n }\n cout << fixed << setprecision(15) << ans << endl;\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nint main()\n{\n int X;\n double P;\n cin >> X >> P;\n if(P == 100) cout << (X + 1) / 2 << endl;\n else cout << fixed << setprecision(10) << (X + 1) / 2 / P * 100.0 << endl;\n}", "#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nint main(){\n\tint x, p;\n\twhile(cin >> x >> p){\n\t\tint first = (x+1)/2;\n\t\tdouble prob = 0.01 * p;\n\t\tprintf(\"%.8lf\\n\", first/prob);\n\t}\n}\n", "#include<iostream>\nusing namespace std;\nlong double p; int n;\nint main() {\n\tcin >> n >> p; if (n % 2 == 1)n++; p = 100.0l - p; p /= 100.0l;\n\tlong double ans = 1.0l*n / (2 - p * 2);\n\tprintf(\"%.14Lf\\n\", ans);\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int x;\n cin>>x;\n if(x%2==1) x++;\n double p;\n cin>>p;\n p/=100;\n cout<<fixed<<setprecision(10);\n cout<<x/2/p<<endl;\n}", "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define REVERSE(x) reverse( (x).begin(),(x).end() )\n#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )\n#define PW(x) (1LL<<(x))\n#define SZ(x) ((ll)(x).size())\n#define SHOW(x) cout << #x << \" = \" << x << endl\n \n#define pb emplace_back\n#define fi first\n#define se second\n \nusing namespace std;\n \ntypedef long double ld;\ntypedef long long int ll;\ntypedef pair<int,int> pi;\ntypedef pair<ll,ll> pl;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<bool> vb;\ntypedef vector<ld> vd;\ntypedef vector<pi> vpi;\ntypedef vector<pl> vpl;\ntypedef vector<vpl> gr;\ntypedef vector<vl> ml;\ntypedef vector<vd> md;\ntypedef vector<vi> mi;\n \nconst ll INF = (ll)1e9 + 10;\nconst ll INFLL = (ll)1e18 + 10;\nconst ld EPS = 1e-12;\nconst ll MOD = 1e9+7;\n \ntemplate<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }\ntemplate<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }\ntemplate<class T> inline T sq( T a ){ return a * a; }\n\nll in(){ ll x; scanf( \"%lld\" , &x ); return x; }\nchar yuyushiki[1000010]; string stin(){ scanf( \"%s\" , yuyushiki ); return yuyushiki; }\n\n// head\n\nint x, ip;\n\nint main(){\n\n x = in();\n ip = in();\n\n double p = ip / 100.0;\n\n printf( \"%.18lf\\n\" , ( x + 1 ) / 2 / p );\n\n return 0;\n}\n", "#include<bits/stdc++.h>\n#define fr first\n#define sc second\n#define pb push_back\n#define ll long long\n#define maxheap priority_queue<int>\n#define minheap priority_queue<int,vector<int>,greater<int>>\nconst double pi = acos(-1.0);\nconst double eps = 1e-6;\nusing namespace std;\n\n\n\n\nvoid solve(){ \n ll x, p;\n cin >> x >> p;\n if (x % 2 == 0){\n cout << (x / 2) * (100. / p) << endl;\n }else{\n cout << ((x + 1) / 2) * (100. / p) << endl;\n \n }\n} \nint main(){\n ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);\n cout.setf(ios::fixed), cout.precision(5);\n //freopen(\"input.txt\", \"r\", stdin);//freopen(\"output1.txt\", \"w\", stdout);\n //freopen(\"icecream.in\",\"r\",stdin);// freopen(\"exam.out\", \"w\", stdout);\n int step;\n step = 1;\n //cin >> step;\n for (int i = 1; i <= step; i++){\n solve();\n }\n}", "#include <bits/stdc++.h>\n#define FOR(i,a,b) for(int i=(a);i<(ut)(b);i++)\n#define REP(i,b) FOR(i,0,b)\n#define ALL(c) c.begin(),c.end()\n#define PB push_back\n#define cat //cout << __LINE__ << endl;\nusing namespace std;\ntypedef long long LL;\ntypedef double ld;\ntypedef int ut;\ntypedef vector<ut> VI;\ntypedef pair<ut,ut> pr;\ntypedef pair<ut,pr> ppr;\ntypedef vector<pr> Vpr;\ntypedef vector<ppr> Vppr;\ntypedef priority_queue<pr,Vpr,greater<pr> > PQ;\nusing namespace std;\nconst int SIZE=1e6;\nconst LL INF=1LL<<58;\nconst LL p=1e9+7;\nvector<string> nums;\nint K;\nstring s;\ndouble per;\ndouble solve(LL x,LL p){\n\tif(x&1){return 1+solve(x-1,p)*per+solve(x+1,p)*(1-per);}\n\tdouble need=x/2;\n\treturn need/per;\n}\nint main(){\n\tLL x,p;\n\tcin >> x >> p;\n\tper=p/100.0;\n\tprintf(\"%12.12f\\n\",solve(x,p));\n\treturn 0;\n}", "#include \"iostream\"\n#include \"iomanip\"\nusing namespace std;\n\nlong double X;\nlong double rad;\nlong double ans;\n\nint main() {\n\tcin >> X >> rad;\n\tif ((long long int)X % 2 == 0) {\n\t\tfor (int i = 0; i < 10000000; i++) {\n\t\t\tans = (ans + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;\n\t\t}\n\t}\n\telse {\n\t\tfor (int i = 0; i < 10000000; i++) {\n\t\t\tans = (ans+1 + X - rad / 100 * ans + (100.0 - rad) / 100 * ans) / 2;\n\t\t}\n\t}\n\tcout << setprecision(15) << ans;\n\treturn 0;\n}", "#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\nusing namespace std;\n\n#define rep(i,a,n) for(int i=a; i<n; i++)\n#define repq(i,a,n) for(int i=a; i<=n; i++)\n#define repr(i,a,n) for(int i=a; i>=n; i--)\n#define pb(a) push_back(a)\n#define fr first\n#define sc second\n#define INF 2000000000\n#define int long long int\n\n#define X real()\n#define Y imag()\n#define EPS (1e-10)\n#define EQ(a,b) (abs((a) - (b)) < EPS)\n#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )\n#define LE(n, m) ((n) < (m) + EPS)\n#define LEQ(n, m) ((n) <= (m) + EPS)\n#define GE(n, m) ((n) + EPS > (m))\n#define GEQ(n, m) ((n) + EPS >= (m))\n\ntypedef vector<int> VI;\ntypedef vector<VI> MAT;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n\ntypedef complex<double> P;\ntypedef pair<P, P> L;\ntypedef pair<P, double> C;\n\nint dy[]={0, 0, 1, -1};\nint dx[]={1, -1, 0, 0};\nint const MOD = 1000000007;\n\nnamespace std {\n bool operator<(const P& a, const P& b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n}\n\nsigned main() {\n int x, p; cin >> x >> p;\n cout << fixed << setprecision(10) << ((x - 1) / 2 + 1) / (double)p * 100.0 << endl;\n return 0;\n}", "x = int(input())\np = int(input())\np *= 0.01\nprint((x+1)//2/p)", "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\n# 偶奇をあわせて寄せていくだけ\n\nX,P = map(int,read().split())\n\ndef f(x):\n y = x // 2\n return y * 100 / P\n\nif X % 2 == 0:\n answer = f(X)\nelse:\n answer = 1 + (P * f(X-1) + (100-P) * f(X+1))/100\n\nprint(answer)\n\n", "#include <bits/stdc++.h>\n#define ADD(a, b) a = (a + ll(b)) % mod\n#define MUL(a, b) a = (a * ll(b)) % mod\n#define MAX(a, b) a = max(a, b)\n#define MIN(a, b) a = min(a, b)\n#define rep(i, a, b) for(int i = int(a); i < int(b); i++)\n#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)\n#define all(a) (a).begin(), (a).end()\n#define sz(v) (int)(v).size()\n#define pb push_back\n#define sec second\n#define fst first\n#define debug(fmt, ...) Debug(__LINE__, \":\", fmt, ##__VA_ARGS__)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pi;\ntypedef pair<ll, ll> pl;\ntypedef pair<int, pi> ppi;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vl> mat;\ntypedef complex<double> comp;\nvoid Debug() {cout << '\\n'; }\ntemplate<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){\n\tcout<<arg<<\" \";Debug(rest...);}\ntemplate<class T>ostream& operator<<(ostream& out,const vector<T>& v) {\n\tout<<\"[\";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<\", \";out<<v.back();}out<<\"]\";return out;}\ntemplate<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){\n\tout<<\"(\"<<v.first<<\", \"<<v.second<<\")\";return out;}\nconst int MAX_N = 200010;\nconst int MAX_V = 100010;\nconst double eps = 1e-6;\nconst ll mod = 1000000007;\nconst int inf = 1 << 29;\nconst ll linf = 1LL << 60;\nconst double PI = 3.14159265358979323846;\n///////////////////////////////////////////////////////////////////////////////////////////////////\n\nint N, P;\n\nvoid solve() {\n\tcin >> N >> P;\n\tif(N % 2 == 0) {\n\t\tcout << (N / 2) * (100.0 / P);\n\t}\n\telse {\n\t\tcout << (N - 1) / 2 + (100.0 - P) / P * (N + 1) / 2 + 1.0;\n\t}\n}\n\nint main() {\n#ifndef LOCAL\n\tios::sync_with_stdio(false);\n cin.tie(0);\n#endif\n cout << fixed;\n\tcout.precision(20);\n\tsrand((unsigned int)time(NULL));\n#ifdef LOCAL\n\t//freopen(\"in.txt\", \"wt\", stdout); //for tester\n freopen(\"in.txt\", \"rt\", stdin);\n#endif\t\n\tsolve();\n#ifdef LOCAL\n cerr << \"Time elapsed: \" << 1.0 * clock() / CLOCKS_PER_SEC << \" s.\\n\";\n#endif\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n\n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}\n\nusing ll = long long;\nusing R = long double;\nconst R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R& r) {return (r > EPS) - (r < -EPS);}\ninline R sq(R x) {return sqrt(max(x, 0.0L));}\n\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\n// Problem Specific Parameter:\n\nint main(void) {\n\tll x, t;\n\tcin >> x >> t;\n\n\tconst R p = 1.0 * t / 100.0;\n\tconst R q = 1.0 - p;\n\n\tR ans = 1.0 * (x / 2) / p;\n\tif (x % 2 == 1) ans += q / p + 1.0;\n\n\tcout.precision(20);\n\tcout << fixed << ans << endl;\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n#define EPS (1e-7)\n#define INF (1e9)\n#define PI (acos(-1))\n//const ll mod = 1000000007;\n\nlong double f(int x, long double p)\n{\n if(x % 2 == 1){\n return p * f(x - 1, p) + (1 - p) * f(x + 1, p) + 1;\n }\n return (x / 2) * (1 / p);\n}\n\nint main() {\n cout.precision(10);\n int x;\n long double p;\n cin >> x >> p;\n p = p / 100;\n cout << f(x, p) << endl; \n return 0;\n}", "from sys import exit, setrecursionlimit\nfrom functools import reduce\nfrom itertools import *\nfrom collections import defaultdict\nfrom bisect import bisect\n\ndef read():\n return int(input())\n\ndef reads():\n return [int(x) for x in input().split()]\n\nsetrecursionlimit(1000000)\n\nx = read()\np = read()\n\np *= 0.01\n\n\nif x % 2 == 0:\n print((x // 2) / p)\nelse:\n y = x // 2\n print(1 + p * y / p + (1 - p) * (y + 1) / p)\n", "/**\n * author: tourist\n * created: 26.11.2019 09:30:33 \n**/\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int x;\n cin >> x;\n double p;\n cin >> p;\n p *= 0.01;\n if (x % 2 == 1) {\n cout << fixed << setprecision(17) << (x + 1) / 2 / p << '\\n';\n } else {\n cout << fixed << setprecision(17) << x / 2 / p << '\\n';\n }\n return 0;\n}\n", "#include <cstdio>\n\nint main()\n{\n long long x;\n int p;\n scanf(\"%lld%d\",&x,&p);\n printf(\"%lf\\n\",(x+1)/2*(double)100./p);\n return 0;\n}\n", "#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll MOD = 998244353;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-11;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\ntypedef pair<ld, ld> LDP;\nint main() {\n\tll x; int p; cin >> x >> p;\n\tcout << fixed << setprecision(7);\n\tif (x % 2) {\n\t\tcout << (ld)50 * (x + 1) / p << endl;\n\t}\n\telse {\n\t\tcout << (ld)50 * x / p << endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<fstream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<set>\n#include<string>\n#include<cmath>\nusing namespace std;\n\n#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)\n#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)\n#define rep(i,n) REP(i,0,n)\n#define rrep(i,n) RREP(i,0,n)\n#define fi first\n#define se second\n\n#ifdef _DEBUG\nifstream ifs(\"input\");\n#define input ifs\n#else\n#define input cin\n#endif\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n\nusing ll = long long;\nusing pii = pair<int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\n\nconst double PI = (1*acos(0.0)); \nconst double INF = 1e9;\nconst double EPS = 1e-9;\nconst double mod = 1e9 + 7;\n\n\nint main(){\n int x,p;\n input >> x >> p;\n printf(\"%.7lf\", ceil(x/2.0) * (100.0/p));\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(), (x).end()\n\ntypedef long long ll;\ntypedef long double ld;\n\nconst int INF = 1e9;\nconst ld EPS = 1e-8;\n\nint main(){\n int x, p;\n cin >> x >> p;\n long double res = ((x + 1) / 2) / (p / 100.0);\n cout << fixed << setprecision(10) << res << endl;\n return 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ios::sync_with_stdio(false), cin.tie(0);\n int x, pp; cin >> x >> pp;\n double p = pp / 100.0;\n double ans;\n if(x % 2) {\n ans = 1 + (1 / p) * (x / 2) + (1 / p) * (1 - p);\n } else {\n ans = (1 / p) * (x / 2);\n }\n cout << fixed << setprecision(7) << ans << endl;\n}\n", "#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cstdlib>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n#include <utility>\n\n#define reps(i,f,n) for(int i=f; i<int(n); ++i)\n#define rep(i,n) reps(i,0,n)\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n\nconst int INF = 1001001001;\n\nsigned main()\n{\n int x, p;\n cin >> x >> p;\n cout << setprecision(15) << (x+1)/2 * 100.0 / p << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define DEBUG_MODE\n#define endl '\\n'\n#ifdef DEBUG_MODE\n#define DEBUG(...) debug_func_mult(split_names(#__VA_ARGS__), __VA_ARGS__)\n#define DEBUG_ENDL endl << flush\n#define DEBUG_SEPARATOR_LINE cout<<\"=================\\n\"\n#else\n#define DEBUG(...) 0\n#define DEBUG_ENDL 0\n#define DEBUG_SEPARATOR_LINE 0\n#endif\n#define ALL(V) (V).begin(), (V).end()\n#define ALLR(V) (V).rbegin(), (V).rend()\n#define DEBUG_ENDL_S(S) ((S).size() ? \"\\n\" : \"\") << flush;\n\ntemplate <typename T> using V = vector<T>;\ntemplate <typename T> using VV = V<V<T>>;\ntemplate <typename T, typename U> using P = pair<T, U>;\nusing ll = int64_t;\nusing PLL = P<ll, ll>;\n\ntemplate <typename T> const T& var_min(const T &t) { return t; }\ntemplate <typename T> const T& var_max(const T &t) { return t; }\ntemplate <typename Head, typename... Tail> const Head& var_min(const Head &head, const Tail&... tail) { return min(head, var_min(tail...)); }\ntemplate <typename Head, typename... Tail> const Head& var_max(const Head &head, const Tail&... tail) { return max(head, var_max(tail...)); }\ntemplate <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }\ntemplate <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }\n\nstring to_string(const string &s) { return s; }\n\ntemplate <typename T, typename U>\nstring to_string(const P<T, U> &p) {\n string ret = \"(\";\n ret += to_string(p.first);\n ret += \", \";\n ret += to_string(p.second);\n ret += \")\";\n return move(ret);\n}\n\ntemplate <typename T>\nstring to_string(const V<T> &v) {\n string ret = \"{\";\n for(const T &t : v) {\n ret += to_string(t);\n ret += \", \";\n }\n ret += \"}\";\n return move(ret);\n}\n\ntemplate <typename T>\nvoid debug_func(const T &t, const string &s = \"\") {\n if(s.size()) cout << s << \" = \";\n cout << to_string(t) << DEBUG_ENDL_S(s);\n}\n\ntemplate <typename T>\nvoid debug_func_mult(int idx, const V<string> &names, const T &t) {\n debug_func(t, names[idx]);\n}\n\ntemplate <typename T>\nvoid debug_func_mult(const V<string> &names, const T &t) {\n debug_func(t, names[0]);\n}\n\ntemplate <typename Head, typename... Tail>\nvoid debug_func_mult(int idx, const V<string> &names, const Head &head, const Tail&... args) {\n debug_func(head, names[idx]);\n debug_func_mult(idx + 1, names, args...);\n}\n\ntemplate <typename Head, typename... Tail>\nvoid debug_func_mult(const V<string> &names, const Head &head, const Tail&... args) {\n debug_func(head, names[0]);\n debug_func_mult(1, names, args...);\n}\n\nV<string> split_names(string &&s) {\n replace(ALL(s), ' ', ',');\n V<string> ret;\n istringstream ss(s);\n string t;\n while(getline(ss, t, ',')) if(t.size()) ret.push_back(move(t));\n return move(ret);\n}\n\nvoid init_io() {\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(30);\n}\n\ndouble calc(double P, ll cnt) {\n if(cnt == 0) return 0;\n return (cnt / 2) / P;\n}\n\nint main() {\n init_io();\n ll X;\n double P;\n cin >> X >> P;\n P /= 100;\n if(X & 1) cout << P * (calc(P, X - 1) + 1) + (1 - P) * (calc(P, X + 1) + 1);\n else cout << calc(P, X);\n cout << endl;\n return 0;\n}\n", "#pragma region include\n#include <iostream>\n#include <iomanip>\n#include <stdio.h>\n\n#include <sstream>\n#include <algorithm>\n#include <iterator>\n#include <cmath>\n#include <complex>\n\n#include <string>\n#include <cstring>\n#include <vector>\n#include <tuple>\n#include <bitset>\n\n#include <queue>\n#include <complex>\n#include <set>\n#include <map>\n#include <stack>\n#include <list>\n\n#include <fstream>\n#include <random>\n//#include <time.h>\n#include <ctime>\n#pragma endregion //#include\n/////////\n#define REP(i, x, n) for(int i = x; i < n; ++i)\n#define rep(i,n) REP(i,0,n)\n#define ALL(X) X.begin(), X.end()\n/////////\n#pragma region typedef\ntypedef long long LL;\ntypedef long double LD;\ntypedef unsigned long long ULL;\ntypedef std::pair<LL,LL> PLL;//\ntypedef std::pair<int,int> PII;//\n#pragma endregion //typedef\n////定数\nconst int INF = (int)1e9;\nconst LL MOD = (LL)1e9+7;\nconst LL LINF = (LL)1e18+20;\nconst LD PI = acos(-1.0);\nconst double EPS = 1e-9;\n/////////\nusing namespace::std;\n\nvoid solve(){\n\tint X;\n\tdouble P;\n\tcin >> X >> P;\n\tif( P == 100 ){\n\t\tdouble ans = (X+1)/2;\n\t\tcout << ans << endl;\n\t\treturn;\n\t}\n\tif( X <= 10 ){\n\t\tdouble p = P/100;\n\t\tdouble q = 1-p;\n\t\tif( X%2 == 0 ){//Xが偶数\n\t\t\tvector<double> dp(X+10,0);\n\t\t\tdp[0] = 0.0;//距離が0の時の期待値\n\t\t\tint now = 0;\n\t\t\tfor(;now<X;now += 2 ){\n\t\t\t\tdp[now+2] = dp[now] + 1.0/p;\n\t\t\t}\n\t\t\tdouble ans = dp[X];\n\t\t\tcout << ans << endl;\n\t\t\treturn;\n\t\t}else{//距離Xが奇数\n\t\t\tvector<double> dp(X+20,0);\n\t\t\tdp[0] = 0.0;\n\t\t\tint now = 0;\n\t\t\tfor(;now<X+4; now += 2 ){\n\t\t\t\tdp[now+2] = dp[now] + 1.0/p;\n\t\t\t}\n\t\t\tdouble ans = dp[X-1]*p + dp[X+1]*q + 1.0;/////\n\t\t\tcout << ans << endl;\n\t\t\treturn;\n\t\t}\n\t\treturn;\n\t}\n\tif( X&1 ){//奇数\n\t\tdouble p = P/100;\n\t\tdouble q = 1-p;\n\t\tdouble cnt1 = (X-1)/2;\n\t\tdouble cnt2 = (X+1)/2;\n\t\tdouble res1 = (1.0/p) * cnt1;\n\t\tdouble res2 = (1.0/p) * cnt2; \n\t\tdouble ans = res1 * p + res2 * q + 1.0;\n\t\tcout << ans << endl;\n\t}else{//偶数\n\t\tdouble p = P/100;\n\t\tdouble q = 1-p;\n\t\tdouble cnt = X/2;//cnt回pを引き当てる。\n\t\t//pを1回引くまでの、試行回数の期待値は1/p\n\t\tdouble ans = (1.0/p) * cnt;\n\t\tcout << ans << endl;\n\t}\n}\n\n#pragma region main\nsigned main(void){\n\tstd::cin.tie(0);\n\tstd::ios::sync_with_stdio(false);\n\tstd::cout << std::fixed;//小数を10進数表示\n\tcout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別\t\n\n\tsolve();\n}\n#pragma endregion //main()", "#include <bits/stdc++.h>\nusing namespace std;\ndouble f(int p, int n)\n{\n\tdouble P = p/100.0;\n\tdouble Q = 1.0 - P;\n\tdouble ans = (-n)/(2*(Q-1));\n\treturn ans;\n}\nint main()\n{\n\tint x,p;\n\tcin>>x>>p;\n\tcout.precision(10);\n\tdouble ans;\n\tif(x%2)\n\t\tans = 1.0 + (p/100.0)*f(p,x-1) + ((100 - p)/100.0)*f(p,x+1);\n\telse\n\t\tans = f(p,x);\n\tcout<<fixed<<ans<<\"\\n\";\n\treturn 0;\n}", "#ifndef KOMAKI_LOCAL\n#define NDEBUG\n#endif\n\n#include <bits/stdc++.h>\n#include <sys/time.h>\n#include <unistd.h>\nusing namespace std;\n#define i64 int64_t\n#define rep(i, n) for(i64 i = 0; i < ((i64)(n)); ++i)\n#define sz(v) ((i64)((v).size()))\n#define bit(n) (((i64)1)<<((i64)(n)))\n#define all(v) (v).begin(), (v).end()\n\nstd::string dbgDelim(int &i){ return (i++ == 0 ? \"\" : \", \"); }\n#define dbgEmbrace(exp) { int i = 0; os << \"{\"; { exp; } os << \"}\"; return os; }\ntemplate <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> v);\ntemplate <class T> std::ostream& operator<<(std::ostream &os, std::set<T> v);\ntemplate <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> q);\ntemplate <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> q);\ntemplate <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> p);\ntemplate <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> mp);\ntemplate <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> mp);\ntemplate <int INDEX, class TUPLE> void dbgDeploy(std::ostream &os, TUPLE tuple){}\ntemplate <int INDEX, class TUPLE, class H, class ...Ts> void dbgDeploy(std::ostream &os, TUPLE t)\n{ os << (INDEX == 0 ? \"\" : \", \") << get<INDEX>(t); dbgDeploy<INDEX + 1, TUPLE, Ts...>(os, t); }\ntemplate <class T, class K> void dbgDeploy(std::ostream &os, std::pair<T, K> p, std::string delim)\n{ os << \"(\" << p.first << delim << p.second << \")\"; }\ntemplate <class ...Ts> std::ostream& operator<<(std::ostream &os, std::tuple<Ts...> t)\n{ os << \"(\"; dbgDeploy<0, std::tuple<Ts...>, Ts...>(os, t); os << \")\"; return os; }\ntemplate <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> p)\n{ dbgDeploy(os, p, \", \"); return os; }\ntemplate <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> v)\n{ dbgEmbrace( for(T t: v){ os << dbgDelim(i) << t; }); }\ntemplate <class T> std::ostream& operator<<(std::ostream &os, std::set<T> s)\n{ dbgEmbrace( for(T t: s){ os << dbgDelim(i) << t; }); }\ntemplate <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> q)\n{ dbgEmbrace( for(; q.size(); q.pop()){ os << dbgDelim(i) << q.front(); }); }\ntemplate <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> q)\n{ dbgEmbrace( for(; q.size(); q.pop()){ os << dbgDelim(i) << q.top(); }); }\ntemplate <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> mp)\n{ dbgEmbrace( for(auto p: mp){ os << dbgDelim(i); dbgDeploy(os, p, \"->\"); }); }\ntemplate <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> mp)\n{ dbgEmbrace( for(auto p: mp){ os << dbgDelim(i); dbgDeploy(os, p, \"->\"); }); }\n#define DBG_OUT std::cerr\n#define DBG_OVERLOAD(_1, _2, _3, _4, _5, _6, macro_name, ...) macro_name\n#define DBG_LINE() { char s[99]; sprintf(s, \"line:%3d | \", __LINE__); DBG_OUT << s; }\n#define DBG_OUTPUT(v) { DBG_OUT << (#v) << \"=\" << (v); }\n#define DBG1(v, ...) { DBG_OUTPUT(v); }\n#define DBG2(v, ...) { DBG_OUTPUT(v); DBG_OUT << \", \"; DBG1(__VA_ARGS__); }\n#define DBG3(v, ...) { DBG_OUTPUT(v); DBG_OUT << \", \"; DBG2(__VA_ARGS__); }\n#define DBG4(v, ...) { DBG_OUTPUT(v); DBG_OUT << \", \"; DBG3(__VA_ARGS__); }\n#define DBG5(v, ...) { DBG_OUTPUT(v); DBG_OUT << \", \"; DBG4(__VA_ARGS__); }\n#define DBG6(v, ...) { DBG_OUTPUT(v); DBG_OUT << \", \"; DBG5(__VA_ARGS__); }\n\n#define DEBUG0() { DBG_LINE(); DBG_OUT << std::endl; }\n#define DEBUG(...) \\\n { \\\n DBG_LINE(); \\\n DBG_OVERLOAD(__VA_ARGS__, DBG6, DBG5, DBG4, DBG3, DBG2, DBG1)(__VA_ARGS__); \\\n DBG_OUT << std::endl; \\\n }\n\n\nint main()\n{\n i64 x;\n double p;\n cin >> x >> p;\n p /= 100;\n printf(\"%0.20lf\\n\", (x + 1) / 2 * (1.0 / p));\n}\n\n\n\n", "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <deque>\n#include <map>\n#include <set>\n#include <cassert>\nusing namespace std;\n#define rep(i,a,n) for (int i=a;i<n;i++)\n#define per(i,a,n) for (int i=n-1;i>=a;i--)\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define sz(x) ((int)(x).size())\n#define It iterator\ntypedef vector<int> VI;\ntypedef long long ll;\ntypedef pair<int,int> PII;\n\n\nint main() {\n //freopen(\"test.in\",\"r\",stdin);\n ll x,p;\n cin>>x>>p;\n double xx=x/2+x%2;\n printf(\"%.6f\",xx/p*100);\n return 0;\n}\n", "#include <stdio.h> \n#include <algorithm> \n#include <assert.h>\n#include <bitset>\n#include <cmath> \n#include <complex> \n#include <deque> \n#include <functional> \n#include <iostream> \n#include <limits.h> \n#include <map> \n#include <math.h> \n#include <queue> \n#include <set> \n#include <stdlib.h> \n#include <string.h> \n#include <string> \n#include <time.h> \n#include <unordered_map> \n#include <unordered_set> \n#include <vector> \n#define ll long long\n#define rep2(i,a,b) for(ll i=a;i<=b;++i)\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define rep3(i,a,b) for(ll i=a;i>=b;i--)\n#define REP(e,v) for(auto e:v)\n#define pii pair<int,int>\n#define pll pair<ll,ll>\n#define tii tuple<int,int,int>\n#define pq priority_queue<int>\n#define pqg priority_queue<int,vector<int>,greater<int>>\n#define pb push_back\n#define edge(v,a,b) v[a].pb(b);v[b].pb(a);\n#define MAX_V 400010\n#define vec vector<int>\n#define vecll vector<ll>\n#define vecpii vector<pii>\n#define endl \"\\n\"\n#define ALL(c) (c).begin(),(c).end()\nusing namespace std;\nint in() {int x;scanf(\"%d\",&x);return x;}\nll lin() {ll x;scanf(\"%lld\",&x);return x;}\n\n#define INF 1e9+7\n#define LLINF 1e18+7\nll MOD=1e9+7;\n#define N 1055050\n\nint main(){\n ll x=in();\n double p=in();\n ll ans=0;\n if(x%2)x++;\n double xx=x;\n xx/=2.0;\n printf(\"%.10f\\n\",xx/p*100.0);\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ndouble x, p;\n\nint main() {\n\tcin >> x >> p;\n\tdouble res = floor((x + 1) / 2) / (p / 100);\n\tprintf(\"%.8f\", res);\t\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef pair<int,int> P;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\n\n// #define int long long\n#define pb push_back\n#define mp make_pair\n#define eps 1e-9\n#define INF 2000000000\n#define LLINF 10000000000000ll\n#define fi first\n#define sec second\n#define all(x) (x).begin(),(x).end()\n#define sq(x) ((x)*(x))\n#define dmp(x) cerr << #x << \": \" << x << endl;\n\ntemplate<class T> void chmin(T& a,const T& b){if(a>b)a=b;}\ntemplate<class T> void chmax(T& a,const T& b){if(a<b)a=b;}\ntemplate<class T>\nusing MaxHeap = priority_queue<T>;\ntemplate<class T>\nusing MinHeap = priority_queue<T,vector<T>,greater<T> >;\ntemplate<class T,class U>\nostream& operator << (ostream& os,const pair<T,U>& p){\n os << p.fi << ',' << p.sec; return os;\n}\ntemplate<class T,class U>\nistream& operator >> (istream& is,pair<T,U>& p){\n is >> p.fi >> p.sec; return is;\n}\ntemplate<class T>\nostream& operator << (ostream &os,const vector<T> &vec){\n for(int i=0;i<vec.size();i++){\n os << vec[i];\n if(i+1<vec.size())os << ' ';\n }\n return os;\n}\ntemplate<class T>\nistream& operator >> (istream &is,vector<T>& vec){\n for(int i=0;i<vec.size();i++)is >> vec[i];\n return is;\n}\nvoid fastio(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout<<fixed<<setprecision(20);\n}\n\nnamespace Math{\n template<int MOD> // if inv is needed, this shold be prime.\n struct ModInt{\n ll val;\n ModInt():val(0ll){}\n ModInt(const ll& v):val(((v%MOD)+MOD)%MOD){}\n ModInt pow(ModInt a,ll x){\n ModInt res = ModInt(1ll);\n while(x){\n if(x&1)res *= a;\n x >>= 1;\n a = a*a;\n }\n return res;\n }\n bool operator==(const ModInt& x)const{return val==x.val;}\n bool operator!=(const ModInt& x)const{return !(*this==x);}\n bool operator<(const ModInt& x)const{return val<x.val;}\n bool operator>(const ModInt& x)const{return val>x.val;}\n bool operator>=(const ModInt& x)const{return !(*this<x);}\n bool operator<=(const ModInt& x)const{return !(*this>x);}\n ModInt& operator+=(const ModInt& x){if((val+=x.val)>=MOD)val-=MOD;return *this;}\n ModInt& operator-=(const ModInt& x){if((val+=MOD-x.val)>=MOD)val-=MOD;return *this;}\n ModInt& operator*=(const ModInt& x){(val*=x.val)%=MOD;return *this;}\n ModInt operator+(const ModInt& x)const{return ModInt(*this)+=x;}\n ModInt operator-(const ModInt& x)const{return ModInt(*this)-=x;}\n ModInt operator*(const ModInt& x)const{return ModInt(*this)*=x;}\n friend istream& operator>>(istream&i,ModInt& x){ll v;i>>v;x=v;return i;}\n friend ostream& operator<<(ostream&o,const ModInt& x){o<<x.val;return o;}\n };\n constexpr int MOD = 1e9+7;\n using mint = ModInt<MOD>;\n vector<mint> inv,fac,facinv;\n // notice: 0C0 = 1 \n ModInt<MOD> nCr(int n,int r){\n assert(!(n<r));\n assert(!(n<0||r<0));\n return fac[n]*facinv[r]*facinv[n-r];\n }\n void init(int SIZE){\n fac.resize(SIZE+1);\n inv.resize(SIZE+1);\n facinv.resize(SIZE+1);\n fac[0] = inv[1] = facinv[0] = mint(1ll);\n for(int i=1;i<=SIZE;i++)fac[i]=fac[i-1]*mint(i);\n for(int i=2;i<=SIZE;i++)inv[i]=mint(0ll)-mint(MOD/i)*inv[MOD%i];\n for(int i=1;i<=SIZE;i++)facinv[i]=facinv[i-1]*inv[i];\n return;\n }\n}\n\nnamespace DS{\n template<class T>\n struct RangeSum{\n vector<T> vec;\n RangeSum(){}\n RangeSum(vector<T> elems):vec(elems){\n for(int i=1;i<vec.size();i++){\n vec[i] += vec[i-1];\n }\n }\n T sum(int l,int r){\n if(l>r)return T(0);\n if(l==0)return vec[r];\n else return vec[r]-vec[l-1];\n }\n };\n template<class T,int N>\n struct BIT{\n vector<T> bit;\n BIT(){\n bit = vector<T>(N+1,T(0));\n }\n void add(int i,T x){\n i++;\n while(i<=N){\n bit[i]+=x;\n i+=i&-i;\n }\n return;\n }\n T sum(int i){\n i++;\n T res = T(0);\n while(i>0){\n res+=bit[i];\n i-=i&-i;\n }\n return res;\n }\n T sum(int l,int r){// [l,r]\n assert(l<=r);\n if(l==0)return sum(r);\n else return sum(r)-sum(l-1);\n }\n };\n}\nsigned main(){\n fastio();\n int x,p;\n cin >> x >> p;\n if(x&1)x++;\n cout << x/2.0*100.0/(double)p << endl;\n return 0;\n}\n", "#include <iostream>\n#include <iomanip>\nusing namespace std;\ndouble p;\nint x;\n\nint main(){\n cin >> x >> p;\n p /= 100;\n if(x%2==1) x++;\n cout << setprecision(8) << x/(2*p) << endl;\n}", "#include <bits/stdc++.h>\ntypedef long long i64;\nusing std::cout;\nusing std::endl;\nusing std::cin;\n\nint main() {\n\tint x, p; cin >> x >> p;\n\t\n\tcout << std::fixed << std::setprecision(10);\n\tcout << (double)((x + 1) / 2) / (p / 100.) << endl;\n\treturn 0;\n}\n", "#include <iostream>\n#include <iomanip> // << fixed << setprecision(xxx)\n#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)\n#include <complex>\n#include <tuple> // get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> // if (M.find(key) != M.end()) { }\n#include <set> // S.insert(M);\n// if (S.find(key) != S.end()) { }\n// for (auto it=S.begin(); it != S.end(); it++) { }\n// auto it = S.lower_bound(M);\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> // atoi(xxx)\nusing namespace std;\n\ntypedef long long ll;\n\n//const int dx[4] = {1, 0, -1, 0};\n//const int dy[4] = {0, 1, 0, -1};\n\n// const int C ;\n// const int M = 1000000007;\n\nint main () {\n ll x;\n int p;\n cin >> x >> p;\n if (x%2 == 1) {\n x++;\n }\n double pp = p/(double)100;\n double vec = -1 * pp + (1-pp);\n vec -= 1;\n cout << fixed << setprecision(12) << x/(-1 * vec) << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n\nint main(){\n\tLL x, p1;\n\tcin >> x >> p1;\n\tdouble p = ((double)p1) / 100.0;\n\tif(x % 2) x++;\n\tx /= 2;\n\tdouble r = ((double)x)/p;\n\tprintf(\"%.9lf\\n\", r);\n}\n", "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<queue>\n#include<cassert>\n#include<iomanip>\n#define PB push_back\n#define MP make_pair\n#define sz(v) (in((v).size()))\n#define forn(i,n) for(in i=0;i<(n);++i)\n#define forv(i,v) forn(i,sz(v))\n#define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i)\n#define all(v) (v).begin(),(v).end()\nusing namespace std;\ntypedef long long in;\ntypedef vector<in> VI;\ntypedef vector<VI> VVI;\ndouble t(in x, double p){\n in tt=x/2;\n double tpt=1/p;\n return tt*tpt;\n}\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n in x;\n double p;\n cin>>x>>p;\n p/=100;\n cout<<setprecision(15);\n if(x%2!=0)\n cout<<1+p*t(x-1,p)+(1-p)*t(x+1,p)<<endl;\n else\n cout<<t(x,p)<<endl;\n return 0;\n}\n", "#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <sstream>\n#include <map>\n#include <set>\n#include <queue>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <typeinfo>\n#include <numeric>\n#include <functional>\n#include <unordered_map>\n#include <bitset>\n#include <stack>\n#include <assert.h>\n#include <unordered_set>\n\n\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\nconst ll INF = 1e16;\nconst ll MOD = 1e9 + 7;\n\n#define REP(i, n) for(ll i = 0; i < n; i++)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nint main(){\n int x;\n double p;\n cin >> x >> p;\n p /= 100.0;\n double xx = (x + 1) / 2;\n printf(\"%.11lf\\n\", xx / p);\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\nconst int mod=1000000007,MAX=4003,INF=1<<30;\n\nint main(){\n \n long double X,P;cin>>X>>P;\n \n if(int(X)%2==0){\n cout<<setprecision(25)<<100.0/P*(X/2.0)<<endl;\n }else{\n cout<<setprecision(25)<<(P/100.0)*(100.0/P)*((X-1.0)/2.0)+((100.0-P)/100.0)*(100.0/P)*((X+1.0)/2.0)+1.0<<endl;\n }\n}\n\n", "#include <cstdio>\nint x, p;\nint main() {\n\tscanf(\"%d %d\", &x, &p);\n\tprintf(\"%.12lf\\n\", 50.0 * (x + x % 2) / p);\n\treturn 0;\n}", "#include <iostream>\n#include <iomanip>\n\nusing namespace std;\n\nint main(){\n int x, p;\n cin >> x >> p;\n double ans;\n if(x%2 == 0){\n ans = ((double)(x/2))*((double)(100)/(double)(p));\n }else{\n ans = ((double)((x+1)/2))*((double)(100)/(double)(p));\n }\n cout << fixed;\n cout << setprecision(9) << ans << endl;\n}", "#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#include <utility>\n#define llint long long\n#define inf 1e18\n#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)\n#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n#define chmin(x, y) (x) = min((x), (y))\n#define chmax(x, y) (x) = max((x), (y))\n#define mod 998244353\nusing namespace std;\ntypedef pair<llint, llint> P;\ntypedef pair<llint, P> E;\n\nllint x;\ndouble p;\n\ndouble calc(llint x)\n{\n\treturn 1/p*x;\n}\n\nint main(void)\n{\n\tcin >> x;\n\tcin >> p;\n\tp /= 100;\n\t\n\tdouble ans;\n\tif(x % 2 == 0) ans = calc(x/2);\n\telse ans = 1 + p*calc((x-1)/2) + (1-p)*calc((x+1)/2);\n\t\n\tprintf(\"%.11f\\n\", ans);\n\t\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<vvd> vvvd;\ntypedef pair<int, int> pii;\ntypedef vector<pii> vpii;\n\n#define pb push_back\n#define mp make_pair\n#define snd second\n#define fst first\n#define debug printf(\"--%d--\\n\",__LINE__)\n#define ll long long int\n\nint x, p;\nint main(void){\n\tcin >> x >> p;\n\tint n = (abs(x)+1)/2;\n\tint q = ((x>0) ? p : 100-p);\n\tdouble pr = 0.01 * q;\n\tprintf(\"%.8f\\n\", n / pr);\n\t\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\n\n\n\ndouble rec(int x, double p) {\n\tif (x % 2)\n\t\treturn p * rec(x - 1, p) + (1 - p) * rec(x + 1, p) + 1;\n\t\n\treturn x / p / 2;\n}\n//-----------------------------------------------------------------\nint main() {\n\tint x, p;\n\tcin >> x >> p;\n\tdouble ans = rec(x, p / 100.0);\n\tprintf(\"%.10f\\n\", ans);\n}", "#include <cstdio>\n#include <cstring>\n#include <string>\n#include <iostream>\n#include <cmath>\n#include <bitset>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <unordered_map>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<int, int> P;\n\nint main()\n{\n\tll x; double p;\n cin>>x>>p;\n if(x%2) printf(\"%.7lf\\n\", ((double)x+1)/2/p*100);\n else printf(\"%.7lf\\n\", ((double)x)/2/p*100);\n\treturn 0;\n}", "#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <iomanip>\n#include <stdio.h>\n#include <algorithm>\n#include <math.h>\n#include <numeric>\n#include <iterator>\n#include <fstream>\n#include <math.h>\n\n#include <random>\n#include <vector>\n#include <string>\n#include <stack>\n#include <set>\n#include <map>\n#include <deque>\n#include <queue>\n#include <list>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n\n#include <random>\n#include <ctime>\n\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n\n#define FOR(i, from, to) for (int i = from; i < to; i++)\n#define ROF(i, from, to) for (int i = from; i > to; i--)\n\nconst long double PI = 3.141592653589793238463;\nconst int INF = 0x3f3f3f3f;\nconst int INFS = 1000000000;\nconst ll M = 1000000007;\nconst ll LLINF = 1000000000000000000;\nconst double EPS = 1e-8;\n\n#define int long long\n\nsigned main() {\n ios_base::sync_with_stdio(0);\n cin.tie(NULL);\n cout.tie(NULL);\n\n int x, p;\n cin >> x >> p;\n ld ans;\n int tmp = (x + 1) / 2;\n ans = (ld(100) / ld(p)) * ld(tmp);\n cout << fixed << setprecision(20) << ans << \"\\n\";\n\n return 0;\n}\n", "#include <iostream>\n#include <stdio.h>\n\nusing namespace std;\n\nint x;\ndouble p;\n\nint main(void)\n{\n\tcin >> x >> p;\n\tp /= 100;\n\t\n\tdouble ans;\n\tif(x % 2 == 0){\n\t\tans = x/2/p;\n\t}\n\telse{\n\t\tans = p*(x-1)/2/p + (1-p)*(x+1)/2/p + 1;\n\t}\n\tprintf(\"%.11f\\n\", ans);\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct Precision{\n Precision(){\n cout<<fixed<<setprecision(12);\n }\n}precision_beet;\n\n//INSERT ABOVE HERE\nsigned main(){\n int x;\n double p;\n cin>>x>>p;\n p/=100;\n double ans=(x&1);\n if(x&1){\n ans+=p*(1/p)*(x-1)/2;\n ans+=(1.-p)*(1/p)*(x+1)/2; \n }else{\n ans+=(1/p)*x/2;\n }\n cout<<ans<<endl;\n return 0;\n}\n", "#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <utility>\n#include <set>\n#include <map>\n#include <cmath>\n#include <iomanip>\n\nusing namespace std;\n\ntemplate<typename T, typename S>\nistream& operator >> (istream& is, pair<T, S>& p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate<typename T>\nistream& operator >> (istream& is, vector<T>& v) {\n for (auto& x : v) {\n is >> x;\n }\n return is;\n}\n\ntemplate<typename T>\nostream& operator << (ostream& os, const vector<T>& v) {\n for (auto& x : v) {\n os << x << \" \";\n }\n os << \"\\n\";\n return os;\n}\n\nlong double ans(uint64_t x, long double p) {\n return (x / 2) / p;\n}\n\nint main() {\n ios_base::sync_with_stdio(false); \n cin.tie(NULL);\n\n#ifdef _DEBUG\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n uint64_t x, P;\n cin >> x >> P;\n long double p = P / 100.0;\n cout << setprecision(9);\n\n if (x % 2 == 1) {\n cout << fixed << 1.0 + p * ans(x - 1, p) + (1.0 - p) * ans(x + 1, p);\n } else {\n cout << fixed << ans(x, p);\n }\n}\n", "//xが偶数のとき, 移動方法が定まる(右に移動すればいい)ので簡単.\n//xが奇数のとき, 1ターン止まったあと, xが偶数のパターンになる。\n//x-1, x+1どちらになっても(最適な)動き方は同じ・不完全情報ゲームより(?)、止まるタイミングは最初にして良いので簡単。\n\n#include <iostream>\n#include <cstdio>\nusing namespace std;\n\nint main() {\n\tint x, p;\n\tcin >> x >> p;\n\tdouble P = p * 0.01;\n\t\n\tif (x % 2 == 0) {\n\t\tprintf(\"%.14f\\n\", x / (2 * P));\n\t}\n\telse {\n\t\tdouble e1 = (x - 1) / (2 * P);\n\t\tdouble e2 = (x + 1) / (2 * P);\n\t\tprintf(\"%.14f\\n\", P * e1 + (1 - P) * e2 + 1);\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#include <sys/time.h>\nusing namespace std;\n\n#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)\n#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)\n#define pb push_back\n#define all(x) (x).begin(), (x).end()\n#define fi first\n#define se second\n#define mt make_tuple\n#define mp make_pair\ntemplate<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }\ntemplate<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\nusing ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;\nll ugauss(ll a, ll b) { if (!a) return 0; if (a>0^b>0) return a/b; else return (a+(a>0?-1:1))/b+1; }\nll lgauss(ll a, ll b) { if (!a) return 0; if (a>0^b>0) return (a+(a>0?-1:1))/b-1; else return a/b; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << \"(\" << v.first << \", \" << v.second << \")\"; return o; }\ntemplate<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};\ntemplate<class Ch, class Tr, class Tuple, size_t... Is>\nvoid print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? \"\" : \", \") << get<Is>(t)), 0)...}; }\ntemplate<class Ch, class Tr, class... Args> \nauto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << \"(\"; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << \")\"; }\nostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << \" \"; o << endl; } return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << \"]\"; return o; }\nvector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }\ntemplate <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}\ntemplate <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << \" \";} return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << \" \";} return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << \" \";} return o; }\ntemplate <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};\nvoid vizGraph(vvll& g, int mode = 0, string filename = \"out.png\") { ofstream ofs(\"./out.dot\"); ofs << \"digraph graph_name {\" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << \" \" << i << \" -> \" << g[i][j] << (mode ? \" [arrowhead = none]\" : \"\")<< endl; } ofs << \"}\" << endl; ofs.close(); system(((string)\"dot -T png out.dot >\" + filename).c_str()); }\nstruct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }\nsize_t random_seed; struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;\n#define ldout fixed << setprecision(40) \n\n#define EPS (double)1e-14\n#define INF (ll)1e18\n#define mo (ll)(1e9+7)\n\nint main(void) {\n double x, p; cin >> x >> p; p /= 100;\n double ret = 0;\n if ((ll)(x) % 2 == 0) {\n ret = x / 2. / p;\n } else {\n ret = (x-1.)/2.+(1.-p)*(x+1.)/2./p+1;\n }\n\n cout << ldout << ret << endl;\n\n return 0;\n}\n", "#include<iostream>\n#include<iomanip>\nusing namespace std;\nint X;\ndouble p;\ndouble calc(int x)\n{\n\treturn x/2/p;\n}\nint main()\n{\n\tcin>>X>>p;p/=100;\n\tdouble ans;\n\tif(X%2==0)ans=calc(X);\n\telse ans=p*calc(X-1)+(1-p)*calc(X+1)+1;\n\tcout<<fixed<<setprecision(16)<<ans<<endl;\n}\n", "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n#include <cassert>\n#include <utility>\n#include <memory>\n#include <functional>\n#include <deque>\n#include <cctype>\n#include <ctime>\n#include <numeric>\n#include <list>\n#include <iomanip>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <tuple>\n#include <initializer_list>\n#include <forward_list>\n\n#define cauto const auto&\n#else\n\n#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll;\ntypedef vector<vector<long long> > vvll;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _rep(i,n) _rep2((i),0,(n))\n#define _rep2(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define fi first\n#define se second\n#define mkp make_pair\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n\n#define MOD 1000000007LL\n#define EPS 1e-8\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\n#define maxs(x,y) x=max(x,y)\n#define mins(x,y) x=min(x,y)\n\nvoid mainmain(){\n\tll _x;\n\tcin>>_x;\n\tdouble x=_x;\n\tdouble p;\n\tcin>>p;\n\tp = p/100;\n\tdouble ans;\n\tif(_x%2==0){\n\t\tans = 1/p*x/2;\n\t}\n\telse{\n\t\tans = p*(1/p*(x-1)/2) + (1-p)*(1/p*(x+1)/2);\n\t\tans+=1;\n\t}\n\tcout<<ans<<endl;\n}\n\n\nsigned main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout<<fixed<<setprecision(20);\n mainmain();\n}", "#include <bits/stdc++.h>\n#include <assert.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n#define PB push_back\n#define MP make_pair\n#define MOD 1000000007LL\n#define endl \"\\n\"\nconst ll UNDEF = -1;\nconst ll INF=1e18;\ntemplate<typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; }\ntemplate<typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; }\ntypedef pair<ll,ll> pll;\n\n#ifdef DEBUG\n #define debug(args...) {dbg,args; cerr<<endl;}\n#else\n #define debug(args...) // Just strip off all debug tokens\n#endif\n\nstruct debugger\n{\n template<typename T> debugger& operator , (const T& v)\n { \n cerr<<v<<\" \"; \n return *this; \n }\n} dbg;\nld solve(ll b, ld p) {\n\tld ans;\n\tif (b==0) ans=0;\n\telse ans=b/p;\n\treturn ans;\n}\nint main()\n{\n\tios_base::sync_with_stdio(false); cin.tie(0);\n\tcout<<fixed<<setprecision(10);\n\tll x,pp; cin>>x>>pp;\n\tld p=(ld)pp/100.0;\n\tll b=x/2;\n\tif (x&1) {\n\t\tld ans=solve(1,p)+(solve(b,p));\n\t\tcout<<ans<<endl;\n\t}\n\telse {\n\t\tcout<<solve(b,p)<<endl;\n\t}\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tlong long X, P; \n\tcin >> X >> P; \n\tdouble ans; \n\tif(X % 2 == 0) ans = 50.0 * X / P; \n\telse ans = 50.0 * (X + 1.0) / P; \n\tcout.precision(15); \n\tcout << ans << endl; \n}", "#include<map>\n#include<set>\n#include<bitset>\n#include<cstdio>\n#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<string>\n#include<chrono>\n#include<stack>\n#include<fstream>\n#include<list>\n#define REP(i,x,y) for(ll i=x;i<=y;i++)\n#define SIZE(a) ll(a.size())\n#define vll vector<ll> \n#define MEMSET(a, n, m) for(ll i=0;i<=n;i++) a[i] = m\n#define BIT(n) (ll(1)<<n)\n#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end()) \n#define UNIQUE_ARRAY(a,n) n = unique(a + 1, a + x + 1) - a - 1\n#define SORT(a,n) sort(a+1,a+n+1)\n#define SORT_O(a,n,order) sort(a+1,a+n+1,order)\n#define PER(i,y,x) for(ll i=y;i>=x;i--)\ntypedef long long ll;\nusing namespace std;\n\n/*\nstruct point\n{\nlong long dist; long long name;\nbool operator<(const point& rhs) const {\nreturn dist > rhs.dist;\n}\n};\n*/\n\ndouble f(ll x, double p) {\n\treturn double(x) / p;\n}\n\nint main() {\n\tcout.precision(13);\n\n\tll x; double p;\n\tcin >> x >> p;\tp /= 100;\n\n\tif (x % 2 == 0) {\n\t\tx /= 2;\n\t\tcout << f(x, p) << endl;\n\t}\n\telse {\n\t\tll y = x / 2;\n\t\tx = y + 1;\n\t\tcout << 1+ (f(x, p)* (1-p) + f(y, p)*p) << endl;\n\t}\n}", "#include<iostream>\n#include<string>\n#include<queue>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<vector>\n#include<math.h>\n#include<time.h>\n\nusing namespace std;\n\n#define INF 1000000007\n#define LINF (1LL << 62)\n\ntypedef long long i64;\ntypedef pair<i64,i64> P;\n\n\ni64 n, m;\n\nint main(){\n\tcin >> n >> m;\n\t\n\tprintf(\"%.10f\\n\", (n+n%2)*50.0/m);\n\t\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long x,p;cin>>x>>p;x=(x+1)/2*100;\n cout<<fixed<<setprecision(6)<<x/(double)p<<endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ndouble solve(int x, double p)\n{\n if(x%2==1)\n return p*solve(x-1, p)+(1.0-p)*solve(x+1, p)+1.0;\n x/=2;\n return x/p;\n}\n\nint main()\n{\n int x, p;\n scanf(\"%d%d\", &x, &p);\n printf(\"%.9f\\n\", solve(x, p/100.0));\n return 0;\n}\n", "#include <cmath>\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <stack>\n#include <tuple>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <utility>\n#include <iomanip>\n\n#define int long long int\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\nconst int INF = 1e15;\nconst int MOD = 1e9+7;\n\nsigned main(){\n int x;\n double p;\n cin >> x >> p;\n cout << fixed << setprecision(7) << (x + 1) / 2 / p * 100.0 << endl;\n\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\ndouble X;\ndouble P;\n\nint main()\n{\n cin >> X >> P;\n printf(\"%lf\\n\" ,50.0 * (X + ((int)X % 2)) / P);\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tlong long x; \n double p;\n cin>>x>>p;\n if(x%2){cout<<setprecision(20)<<(((double)x+1)/2)/p*100<<endl;}\n else{ cout<<setprecision(20)<<(((double)x)/2)/p*100<<endl;}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define print(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define print(x)\n#endif\n\nconst int inf=1e9;\nconst int64_t inf64=1e18;\nconst double eps=1e-9;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int x;\n double p;\n cin >> x >> p;\n p/=100;\n cout << (x+1)/2/p << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}\n", "#include <bits/stdc++.h>\n\n#define mp make_pair\n#define eb emplace_back\n#define ff first\n#define ss second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\n\n#ifdef ONPC\nmt19937 rnd(228);\n#else\nmt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n\n\nconst int MAXN = 100;\n//#define int long long\nconst int INF = 1e9;\n\n/*\ntask from atcoder: https://atcoder.jp/contests/cf16-tournament-round2-open/tasks/asaporo_e\n*/\n\nvoid solve(){\n int x, p;\n cin >> x >> p;\n cout << fixed << setprecision(30) <<((ld)(x + x % 2) * 100.0) / ((ld)p * 2.0) << '\\n';\n}\n\nsigned main()\n{\n #ifdef FILEIO\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n #endif\n\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n\n solve();\n\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n\nstruct cww{cww(){\n ios::sync_with_stdio(false);cin.tie(0);\n cout<<fixed;\n cout<<setprecision(10);\n}}star;\n#define fin \"\\n\"\n#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)\n#define REP(i,n) FOR(i,0,n)\n#define fi first\n#define se second\n#define pb push_back\n#define DEBUG if(0)\ntemplate <typename T>inline void chmin(T &l,T r){l=min(l,r);}\ntemplate <typename T>inline void chmax(T &l,T r){l=max(l,r);}\ntemplate <typename T>\nistream& operator>>(istream &is,vector<T> &v){\n for(auto &it:v)is>>it;\n return is;\n}\ndouble p;\ndouble f(LL x){\n x/=2;\n return x/p;\n}\nint main(){\n LL x;\n cin>>x>>p;\n p/=100;\n if(x%2)cout<<1+p*f(x-1)+(1-p)*f(x+1)<<endl;\n else cout<<f(x)<<endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb push_back\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nsigned main(){\n int x;\n double p;\n cin>>x>>p;\n p/=100;\n double ans;\n if(x&1){\n ans=(1-p)*(x+1)/2/p+p*1.0*(x-1)/2/p+1;\n }\n else{\n ans=x/2/p;\n }\n printf(\"%.20f\\n\",ans);\n return 0;\n}\n", "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<iomanip>\n#define lol(i,n) for(int i=0;i<n;i++)\n#define mod 1000000007\ntypedef long long ll;\nusing namespace std;\n\nint main(){\n ll x,p;cin>>x>>p;\n cout<<fixed<<setprecision(10)<<(x+1)/2*100/(double)p<<endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint x;\n\tdouble p;\n\tcin >> x >> p;\n\tp /= 100.0;\n\tif(x % 2) {\n\t\tx /= 2;\n\t\tprintf(\"%.9lf\\n\",x + (x + 1) / p * (1 - p) + 1);\n\t}\n\telse printf(\"%.9lf\\n\",x / 2 / p);\n\treturn 0;\n}", "// package atcoder.other2016.codefestival2016.round2;\n\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int x = in.nextInt();\n int p = in.nextInt();\n if (p == 100) {\n out.println((x + 1) / 2);\n } else {\n double rate = p / 100.0;\n if (x % 2 == 0) {\n out.println(String.format(\"%.9f\", solve(rate, x)));\n } else {\n out.println(String.format(\"%.9f\", 1 + rate * solve(rate, x-1) + (1.0 - rate) * solve(rate, x+1)));\n }\n }\n out.flush();\n }\n\n private static double solve(double rate, int x) {\n return (1.0d / rate) * (x / 2);\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n private int[] nextInts(int n) {\n int[] ret = new int[n];\n for (int i = 0; i < n; i++) {\n ret[i] = nextInt();\n }\n return ret;\n }\n\n private int[][] nextIntTable(int n, int m) {\n int[][] ret = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n ret[i][j] = nextInt();\n }\n }\n return ret;\n }\n\n private long[] nextLongs(int n) {\n long[] ret = new long[n];\n for (int i = 0; i < n; i++) {\n ret[i] = nextLong();\n }\n return ret;\n }\n\n private long[][] nextLongTable(int n, int m) {\n long[][] ret = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n ret[i][j] = nextLong();\n }\n }\n return ret;\n }\n\n private double[] nextDoubles(int n) {\n double[] ret = new double[n];\n for (int i = 0; i < n; i++) {\n ret[i] = nextDouble();\n }\n return ret;\n }\n\n private int next() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public char nextChar() {\n int c = next();\n while (isSpaceChar(c))\n c = next();\n if ('a' <= c && c <= 'z') {\n return (char) c;\n }\n if ('A' <= c && c <= 'Z') {\n return (char) c;\n }\n throw new InputMismatchException();\n }\n\n public String nextToken() {\n int c = next();\n while (isSpaceChar(c))\n c = next();\n StringBuilder res = new StringBuilder();\n do {\n res.append((char) c);\n c = next();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public int nextInt() {\n int c = next();\n while (isSpaceChar(c))\n c = next();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = next();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c-'0';\n c = next();\n } while (!isSpaceChar(c));\n return res*sgn;\n }\n\n public long nextLong() {\n int c = next();\n while (isSpaceChar(c))\n c = next();\n long sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = next();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c-'0';\n c = next();\n } while (!isSpaceChar(c));\n return res*sgn;\n }\n\n public double nextDouble() {\n return Double.valueOf(nextToken());\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n\n static void debug(Object... o) {\n System.err.println(Arrays.deepToString(o));\n }\n}\n", "#include <bits/stdc++.h>\n#define all(vec) vec.begin(),vec.end()\n#define mp make_pair\nusing namespace std;\nusing ll=long long;\nusing P=pair<ll,ll>;\nconst ll INF=1LL<<30;\nconst ll LINF=1LL<<62;\nconst double eps=1e-9;\nconst ll MOD=1000000007LL;\ntemplate<typename T>void chmin(T &a,T b){a=min(a,b);};\ntemplate<typename T>void chmax(T &a,T b){a=max(a,b);};\nint dx[4]={0,1,0,-1};\nint dy[4]={1,0,-1,0};\nint main(){\n\tll x;double p;cin>>x>>p;\n\tdouble ans;\n\tif(x%2==0){\n\t\tans=(100.0/p)*(double)(x/2.0);\n\t}else{\n\t\tans=(p/100.0)*((100.0/p)*(double)((x-1.0)/2.0)+1)+((100.0-p)/100.0)*((100.0/p)*(double)(x+1.0)/2.0+1);\n\t}\n\tprintf(\"%.10f\\n\",ans);\n}", "#include <bits/stdc++.h> \n#define pb push_back \n#define mp make_pair \n#define all(x) (x).begin(), (x).end()\n#define sz(x) (int)((x).size())\n#define jonathan ios_base::sync_with_stdio(0)\n#define livingston cin.tie(0)\nusing namespace std; \n \nvoid yes() {cout << \"Yes\" << endl;} \nvoid no() {cout << \"No\" << endl;} \n \nint dx[] = {1, 0, -1, 0, -1, -1, 1, 1}; \nint dy[] = {0, 1, 0, -1, -1, 1, -1, 1}; \n\nconst int INF = 1e9 + 9;\nconst long long LINF = 1e18 + 8;\nconst double EPS = 1e-9;\nconst long long MOD = 1e9 + 7; //998244353\nconst double PI = acos(-1);\n\nvoid solve() {\n long long x, p; cin >> x >> p;\n cout << fixed << setprecision(6) << (double)((x + 1) / 2 * 100.0 / p) << endl;\n} \n\nint main() {\n jonathan; \n livingston;\n solve();\n return 0;\n}", "#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <bitset>\n#include <set>\n#include <unordered_set>\n#include <map>\n#include <unordered_map>\n#include <cmath>\n#include <time.h>\n#include <random>\n#include <string>\n#include <cassert>\n#include <vector>\n#include <ostream>\n#include <istream>\n#include <stack>\n#include <deque>\n#include <queue>\n#include <functional>\n#include <chrono>\n#include <stack>\n\nusing namespace std;\n\n#define int long long\n#define pb push_back\n#define all(a) (a).begin(), (a).end()\n#define pii pair<int, int>\n#define ld long double\n\nostream& operator<< (ostream &out, const vector<int> &b) {\n for (auto k : b) out << k << \" \";\n return out;\n}\n\nistream& operator>> (istream& in, pii& b) {\n in >> b.first >> b.second;\n return in;\n}\n\nostream& operator<< (ostream& out, const pii& b) {\n out << \"{\" << b.first << \", \" << b.second << \"}\";\n return out;\n}\n\ntemplate <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}\ntemplate <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}\n\n\n#ifdef LOCAL\n #define dbg(x) cout << #x << \" : \" << (x) << \"\\n\";\n const int INF = 1e18;\n // const int mod = 2600000069;\n // const int p = 10;\n#else\n #define dbg(x) 57\n const int INF = 1e18;\n // const int mod = 2600000069;\n // const int p = 179;\n#endif\n\nconst ld PI = acos(-1);\n\n#define time clock() / (double) CLOCKS_PER_SEC\n\n// #pragma GCC optimize(\"Ofast,no-stack-protector\")\n// #pragma GCC target(\"sse,sse2,sse3,sse3,sse4\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC optimize(\"fast-math\")\n// #pragma GCC target(\"avx2\") \n// #pragma GCC optimize(\"section-anchors\")\n// #pragma GCC optimize(\"profile-values,profile-reorder-functions,tracer\")\n// #pragma GCC optimize(\"vpt\")\n// #pragma GCC optimize(\"rename-registers\")\n// #pragma GCC optimize(\"move-loop-invariants\")\n// #pragma GCC optimize(\"unswitch-loops\")\n// #pragma GCC optimize(\"function-sections\")\n// #pragma GCC optimize(\"data-sections\")\n\nmt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());\n\nsigned main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int x, p;\n cin >> x >> p;\n cout << fixed << setprecision(8);\n if (x & 1) {\n cout << ((100.0 - p) / 100.0 * (ld)(x + 1) / (ld)p * 100.0 + (ld)p / 100.0 * (ld)(x - 1) / (ld)p * 100.0) / 2.0 + 1.0 << \"\\n\";\n } else {\n cout << ((ld)x / (ld)p * 100.0) / 2.0 << \"\\n\";\n }\n}\n/*\n\n*/", "\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n\nimport static java.util.Arrays.*;\n\npublic class Main {\n\tprivate static final int mod = (int)1e9+7;\n\n\tfinal Random random = new Random(0);\n\tfinal IOFast io = new IOFast();\n\n\t/// MAIN CODE\n\tpublic void run() throws IOException {\n//\t\tint TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());\n\t\tint TEST_CASE = 1;\n\t\twhile(TEST_CASE-- != 0) {\n\t\t\tint x = io.nextInt();\n\t\t\tdouble p = io.nextDouble() / 100;\n\t\t\t\n\t\t\t// E(x) = 1 + p*E(x-1) + (1-p)*E(x)\n\t\t\t// E(x) = (p*E(x-1) + 1) / p\n\t\t\t// E(x) = E(x-1) + 1 / p\n\n\t\t\tif (x % 2 == 1) {\n\t\t\t\tio.out.printf(\"%.10f\\n\", (x + x + 3) / 4 / p);\n\t\t\t} else {\n\t\t\t\tio.out.printf(\"%.10f\\n\", (x + x + 3) / 4 / p);\n\t\t\t}\n\t\t}\n\t}\n\tstatic double pow(double n, long r) {\n\t\tdouble res = 1;\n\t\tfor(; r != 0; r >>>= 1, n = n * n) {\n\t\t\tif((r&1) == 1) {\n\t\t\t\tres = res * n;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\t\n\t/// TEMPLATE\n\tstatic int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }\n\tstatic long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }\n\t\n\tstatic <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }\n\tstatic void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }\n\n\tvoid printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?\"\\n\":\" \")); }\n\tvoid printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?\"\\n\":\" \")); }\n\t\n\tstatic void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } \n\t\n\tvoid main() throws IOException {\n\t\t//\t\tIOFast.setFileIO(\"rle-size.in\", \"rle-size.out\");\n\t\ttry { run(); }\n\t\tcatch (EndOfFileRuntimeException e) { }\n\t\tio.out.flush();\n\t}\n\tpublic static void main(String[] args) throws IOException { new Main().main(); }\n\t\n\tstatic class EndOfFileRuntimeException extends RuntimeException {\n\t\tprivate static final long serialVersionUID = -8565341110209207657L; }\n\n\tstatic\n\tpublic class IOFast {\n\t\tprivate BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tprivate PrintWriter out = new PrintWriter(System.out);\n\n\t\tvoid setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }\n\t\tvoid setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }\n\t\tvoid setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }\n\n\t\tprivate static int pos, readLen;\n\t\tprivate static final char[] buffer = new char[1024 * 8];\n\t\tprivate static char[] str = new char[500*8*2];\n\t\tprivate static boolean[] isDigit = new boolean[256];\n\t\tprivate static boolean[] isSpace = new boolean[256];\n\t\tprivate static boolean[] isLineSep = new boolean[256];\n\n\t\tstatic { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true; isLineSep['\\r'] = isLineSep['\\n'] = true; }\n\t\tpublic int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }\n\t\tpublic int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }\n\t\tpublic long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }\n\t\tpublic char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }\n\t\tint reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }\n\t\tint reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }\n\t\tpublic char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }\n\t\tpublic String nextString() throws IOException { return new String(next()); }\n\t\tpublic char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }\n//\t\tpublic int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(nextString()); }\n\t\tpublic long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }\n\t\tpublic int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }\n\t\tpublic int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }\n\t\tpublic int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }\n\t\tpublic double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }\n\t}\n}\n", "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tint x = ni(), p = ni();\n\t\t/*\n\t\t * 1/p*(x/2)\n\t\t */\n\t\tout.printf(\"%.14f\\n\", (double)((x+1)/2)/(p/100.));\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tlong S = System.currentTimeMillis();\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\ttr(G-S+\"ms\");\n\t}\n\t\n\tprivate static boolean eof()\n\t{\n\t\tif(lenbuf == -1)return true;\n\t\tint lptr = ptrbuf;\n\t\twhile(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\t\t\n\t\ttry {\n\t\t\tis.mark(1000);\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b == -1){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn true;\n\t\t\t\t}else if(!isSpaceChar(b)){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate static int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n//\tprivate static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\t\n\tprivate static String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate static char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate static char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate static int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate static int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <vector>\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define show(x) cout << #x << \" = \" << x << endl;\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nint main(){\n int x;\n double p;\n cin >> x >> p;\n p/=100.0;\n if(1){\n cout << fixed << setprecision(10) << (x+1)/2/p << endl;\n }\n}", "#include<cstdio>\n#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<queue>\n#include<stack>\n#include<map>\n#include<set>\n#include<iomanip>\n\n#define rep0(i,N) for(int i=0;i<N;i++)\n#define rep1(i,a,N) for(int i=0+a;i<N;i++)\n#define lint long long int\n#define SIZE 100005\n\nusing namespace std;\n\nint main(){\n\tdouble p;\n\tlint x;\n\tcin>>x>>p;\n\tdouble ans;\n\tdouble c;\n\tif(p==100){\n\tif(x%2==0)\n\tcout<<x/2;\n\telse\n\tcout<<(x+1)/2;\n\treturn 0;\n\t}\n\tif(x%2==1)\n\t\tx++;\n\tc=-1*p/100+1*(100-p)/100;\n\tans=x/(1-c);\n\tcout<< fixed << setprecision(8) << ans;\nreturn 0;\n}", "// #include {{{\n#include <iostream>\n#include <cassert>\n#include <cstring>\n#include <cstdlib>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <ctime>\n#include <queue>\n#include <set>\n#include <map>\n#include <stack>\n#include <string>\n#include <bitset>\n#include <vector>\n#include <complex>\n#include <algorithm>\nusing namespace std;\n// }}}\n// #define {{{\ntypedef long long ll;\ntypedef double db;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\n#define de(x) cout << #x << \"=\" << x << endl\n#define rep(i,a,b) for(int i=a;i<(b);++i)\n#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)\n#define all(x) (x).begin(),(x).end()\n#define sz(x) (int)(x).size()\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n// }}}\n\nint x , p;\n\nint main(){\n scanf(\"%d%d\",&x,&p);\n db ans = 0.;\n if(x & 1) ans = 1 + ((x - 1) / 2 + (100. - p) / p * (x + 1) / 2);\n else ans = 100. / p * x / 2;\n printf(\"%.12f\\n\",ans);\n return 0;\n}\n", "#include <iostream>\n#include <vector>\n#include <string>\n#include <cmath>\n#include <algorithm>\n#include <utility>\n#include <queue>\n#include <set>\n#include <map>\n#include <deque>\n#include <iomanip>\n#include <cstdio>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> PII;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\n#define MP make_pair\n#define PB push_back\n#define inf 1000000007\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n\ndouble calc(int x,double pp){\n return ((double)x/2.0)/pp;\n}\n\nint main(){\n int x;\n int p;\n cin >> x >> p;\n double pp = (double)p/100.0;\n if(x%2==0){\n cout << fixed << setprecision(10) << calc(x,pp) << endl;\n }else{\n cout << fixed << setprecision(10) << 1.0+pp*calc(x-1,pp)+(1.0-pp)*calc(x+1,pp) << endl; \n }\n\n return 0;\n}", "x = int(input())\np = int(input())\nprint(\"%.016f\\n\" % ((((x+(x%2))/2)*100/p)))", "# include \"bits/stdc++.h\"\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\nconst double PI = acos(-1);\ntemplate<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }\ntemplate<class T>constexpr T HINF() { return INF<T>() / 2; }\ntemplate <typename T_char>T_char TL(T_char cX) { return tolower(cX); };\ntemplate <typename T_char>T_char TU(T_char cX) { return toupper(cX); };\nconst int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };\nconst int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };\nint popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }\nint d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }\nint d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }\nLL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };\nLL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };\n# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()\n# define UNIQUE(wpwpw) (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())\n# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)\n# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)\n# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)\n# define REP(i,upupu) FOR(i,0,upupu)\n# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)\n# pragma warning(disable:4996)\n\n\ndouble n;\ndouble p;\n\nint main() {\n\tcin >> n >> p;\n\tp /= 100.0;\n\tcout << fixed << setprecision(13) << ceil(n / 2) / p << endl;\n}", "#include <bits/stdc++.h>\n#include <random>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef long double ld;\n#define int ll\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\ntypedef vector<vvc> vvvc;\ntypedef pair<int, int> pii;\ntypedef pair<pii, pii> piii;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<pii> vpi;\ntypedef vector< vi > vvi;\ntypedef vector< vvi > vvvi;\ntypedef vector<short> vs;\ntypedef vector<vs> vvs;\ntypedef vector<vvs> vvvs;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<vvl> vvvl;\ntypedef vector<ld> vld;\ntypedef vector<vld> vvld;\ntypedef vector<vvld> vvvld;\ntypedef vector<string> vst;\ntypedef vector<vst> vvst;\ntypedef pair<ld, ld> pld;\n\n#define inmin(a, b) a = min(a, (b))\n#define inmax(a, b) a = max(a, (b))\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n#define sqr(x) ((x) * (x))\n#define fori(i, n) for(int i = 0; i < int(n); ++i)\n#define SZ(a) ((int)((a).size()))\n#define triple(T) tuple<T, T, T>\n#define quad(T) tuple<T, T, T, T>\n#define watch(x) cerr << (#x) << \" = \" << (x) << endl;\n\n#ifdef RUS_HOME\n#define cerr cout\n#else\n#define cerr if (false) cerr\n#endif\n\nconst double PI = 2 * acos(0.0);\n#define rand shittttty_shit\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\nmt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());\n\nconst string DIGITS = \"0123456789\";\nconst string ALPH = \"abcdefghijklmnopqrstuvwxyz\";\n\n\ntemplate <class T0, class T1>\ninline ostream & operator << (ostream &out, pair<T0, T1> &a) {\n return out << \"{\" << a.first << \", \" << a.second << \"}\";\n}\n\ntemplate <class T0, class T1>\ninline istream & operator >> (istream &in, pair<T0, T1> &a) {\n return in >> a.first >> a.second;\n}\n\ntemplate <class T0, class T1, class T2>\ninline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {\n return out << \"{\" << get<0>(a) << \", \" << get<1>(a) << \", \" << get<2>(a) << \"}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\ninline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {\n return out << \"{\" << get<0>(a) << \", \" << get<1>(a) << \", \" << get<2>(a) << \", \" << get<3>(a) << \"}\";\n}\n\ntemplate<class T>\ninline ostream & operator << (ostream &out, vector<T> &a) {\n out << \"[\";\n fori (i, a.size())\n out << a[i] << vector<string>{\", \", \"] \"}[i + 1 == a.size()];\n return out;\n}\n\n\nvoid smain();\n\n\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0); cout.tie(0);\n#ifdef RUS_HOME\n freopen(\"input\", \"r\", stdin);\n //freopen(\"output.txt\", \"w\", stdout);\n clock_t start = clock();\n#endif\n cout << setprecision(12) << fixed;\n smain();\n#ifdef RUS_HOME\n cout << \"\\n\\n\\n\\nTOTAL EXECUTION TIME: \" << float( clock () - start ) / CLOCKS_PER_SEC << endl;\n#endif\n return 0;\n}\n\nconst int MOD=1e9+7,N=1e5+1,M=4e5+100,oo=1e9;\n\n\nvoid smain() {\n\n\n int x,p;\n cin>>x>>p;\n cout<<(ld)((x/2+x%2)*100)/p;\n\n\n\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long x,p;cin>>x>>p;\n cout<<fixed<<setprecision(10)<<50.0*(x+x%2)/p;\n}", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <iomanip>\n#include <map>\n#include <queue>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing namespace std;\n\ntemplate<class T>\nconstexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\nint main() {\n ll x, p;\n cin >> x >> p;\n ll k = (x+1)/2;\n printf(\"%.15Lf\", (100/(long double)p)*k);\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int X, P; cin >> X >> P;\n int a = (X + 1) / 2;\n double p = P / 100.0;\n cout << fixed << setprecision(9) << 1 / p * a << endl;\n return 0;\n}", "x=int(input())\np=int(input())/100\nprint((x+1)//2 * 1 / p)", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,a) for(int i=0;i<(a);i++)\nconst ll MOD=1000000007;\n\n// 1ターン分プラスして，\n// dp_x=1+dp_(x-2)*P/100+dp_x*(100-p)/100\n// dp_x=dp_(x-2)+100/p\n\nint main(){\n ll x; cin>>x;\n double p; cin>>p;\n if(x%2) x++;\n cout<<setprecision(15);\n cout<<x/2*100/p<<endl;\n return 0;\n}\n", "#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <vector>\n#include <map>\n#include <set>\n\nusing namespace std;\n\ntypedef pair<int , int> P2;\ntypedef pair<pair<int , int> , int> P3;\ntypedef pair<pair<int , int> , pair<int , int> > P4;\n#define Fst first\n#define Snd second\n#define PB(a) push_back(a)\n#define MP(a , b) make_pair((a) , (b))\n#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))\n#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))\n#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)\n#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)\n#define repv(t,it,v) for(vector<t>::iterator it = v.begin() ; it != v.end() ; ++it)\n\nint x,p;\n\ndouble solve(int n){\n\treturn 100.0 * n / p;\n}\n\nint main(){\n\tscanf(\"%d%d\" , &x , &p);\n\tif(p == 100){\n\t\tprintf(\"%d\\n\" , (x+1) / 2);\n\t} else if(x%2==0){\n\t\tprintf(\"%.9f\\n\" , solve(x/2));\n\t} else {\n\t\tprintf(\"%.9f\\n\" , 1.0 + solve(x/2)*0.01*p + solve(x/2+1)*0.01*(100-p));\n\t}\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n\n\nsigned main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n \n ll x;\n cin>>x;\n double p;\n cin>>p;\n if(abs(p-100)<0.01){\n x++;\n cout << x/2 << endl;\n return 0;\n }\n p/=100.0;\n if(x%2==0){\n cout << (double)x/2.0/p << \"\\n\";\n }\n else{\n x++;\n cout << (double)x/2.0/p << \"\\n\";\n } \n\n \n}", "#include<stdio.h>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n\tint num,pr;\n\tscanf(\"%d%d\",&num,&pr);\n\tif(num%2==1)num++;\n\tprintf(\"%lf\\n\",(double)num/(1.0-double(100-pr)/double(100)+double(pr)/double(100)));\n}", "#include \"bits/stdc++.h\"\n#include <unordered_set>\n\n#define _CRT_SECURE_NO_WARNINGS\n\n#define FOR(i, x, n) for(decltype(x) i = (x); i < (n); i++)\n#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)\n#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)\n\n#define ALL(a) (a).begin(),(a).end()\n#define SORT(c) sort((c).begin(),(c).end())\n#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())\n\nusing namespace std;\n\nconst int dy[] = { 0, 1, 0, -1 };\nconst int dx[] = { 1, 0, -1, 0 };\n\nusing LL = long long int;\nusing LD = long double;\n\nconst int INF = (1 << 30) - 1;\nconst LL INF64 = ((LL)1 << 62) - 1;\nconst double PI = 3.1415926535897932384626433832795;\n\nusing pii = pair<int, int>;\nusing pll = pair<LL, LL>;\nusing pdd = pair<double, double>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vl = vector<LL>;\nusing vvl = vector<vl>;\nusing vvvl = vector<vvl>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vs = vector<string>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n\nint main() {\n//\tios::sync_with_stdio(false);\n//\tcin.tie(0);\n\tint x, p;\n\tcin >> x >> p;\n\tdouble ans = (x + 1) / 2 * 100.0 / p;\n\tprintf(\"%.7lf\\n\", ans);\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#include <random>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef double ld;\n//#define ll __int128\n//#define int ll\n//#define char ll\n//#define double ld\ntypedef vector<char> vc;\ntypedef vector <vc> vvc;\ntypedef vector <vvc> vvvc;\ntypedef pair<int, int> pii;\ntypedef pair<pii, pii> piii;\ntypedef pair<ll, ll> pll;\ntypedef vector <int> vi;\ntypedef vector <pii> vpi;\ntypedef vector <vi> vvi;\ntypedef vector <vvi> vvvi;\ntypedef vector<short> vs;\ntypedef vector <vs> vvs;\ntypedef vector <vvs> vvvs;\ntypedef vector <ll> vl;\ntypedef vector <vl> vvl;\ntypedef vector <vvl> vvvl;\ntypedef vector <ld> vld;\ntypedef vector <vld> vvld;\ntypedef vector <vvld> vvvld;\ntypedef vector <string> vst;\ntypedef vector <vst> vvst;\ntypedef pair<ld, ld> pld;\n\n#define inmin(a, b) a = min(a, (b))\n#define inmax(a, b) a = max(a, (b))\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n#define sqr(x) ((x) * (x))\n#define fori(i, n) for(int i = 0; i < int(n); ++i)\n#define SZ(a) ((int)((a).size()))\n#define triple(T) tuple<T, T, T>\n#define quad(T) tuple<T, T, T, T>\n#define watch(x) cerr << (#x) << \" = \" << (x) << endl;\n\n#ifdef MAX_HOME\n#define cerr cout\n#else\n#define cerr if (false) cerr\n#endif\n\nconst double PI = 2 * acos(0.0);\n#define rand shittttty_shit\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\nmt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());\n\nconst string DIGITS = \"0123456789\";\nconst string ALPH = \"abcdefghijklmnopqrstuvwxyz\";\n\n\ntemplate<class T0, class T1>\ninline ostream &operator<<(ostream &out, pair<T0, T1> &a) {\n return out << \"{\" << a.first << \", \" << a.second << \"}\";\n}\n\ntemplate<class T0, class T1>\ninline istream &operator>>(istream &in, pair<T0, T1> &a) {\n return in >> a.first >> a.second;\n}\n\ntemplate<class T0, class T1, class T2>\ninline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {\n return out << \"{\" << get<0>(a) << \", \" << get<1>(a) << \", \" << get<2>(a) << \"}\";\n}\n\ntemplate<class T0, class T1, class T2, class T3>\ninline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {\n return out << \"{\" << get<0>(a) << \", \" << get<1>(a) << \", \" << get<2>(a) << \", \" << get<3>(a) << \"}\";\n}\n\ntemplate<class T>\ninline ostream &operator<<(ostream &out, vector <T> &a) {\n out << \"[\";\n fori (i, a.size())out << a[i] << vector < string > {\", \", \"] \"}[i + 1 == a.size()];\n return out;\n}\n\n\nvoid smain();\n\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n#ifdef MAX_HOME\n freopen(\"input.txt\", \"r\", stdin);\n clock_t start = clock();\n#endif\n#ifdef HK_CUP\n freopen(\"finput.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n\n cout << setprecision(12) << fixed;\n smain();\n#ifdef MAX_HOME\n#ifndef HK_CUP\n cout << \"\\n\\nTOTAL EXECUTION TIME: \" << float(clock() - start) / CLOCKS_PER_SEC << endl;\n#endif\n#endif\n return 0;\n}\n\nld f(ll x, ld p) {\n return x / p;\n}\n\nvoid smain() {\n ll x;\n ld p;\n cin >> x >> p;\n p /= 100;\n ld ans = 0;\n if (x & 1) {\n ans = 1 + p * f((x - 1) / 2, p) + (1 - p) * f((x + 1) / 2, p);\n } else {\n ans = f(x / 2, p);\n }\n cout << ans;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int x, p; cin >> x >> p;\n x = (x + 1) / 2;\n cout << fixed << setprecision(12) << 100. / p * x << endl;\n return 0;\n}", "#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n \n#define REP(i,n) for(int i=0; i<n; ++i)\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\n#define pi M_PI\n \ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef vector<VI> VVI;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nint main() {\n int x;\n double p;\n cin >> x >> p;\n x = (x+1)/2;\n printf(\"%.10f\\n\", x/(p/100));\n return 0;\n}", "#include <string>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <sstream>\n#include <algorithm>\n#include <deque>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <list>\n#include <cstdio>\n#include <iostream>\n#include <cmath>\n#include <climits>\n#include <bitset>\n#include <functional>\n#include <numeric>\n#include <ctime>\n#include <cassert>\n#include <cstring>\n#include <fstream>\n\n#define FOR(i, a, b) for(int (i)=(a); (i)<(b); (i)++)\n#define IFOR(i, a, b) for(int (i)=(a);(i)<=(b);(i)++)\n#define RFOR(i, a, b) for(int (i)=(a);(i)>=(b);(i)--)\n\nusing namespace std;\n\nint main() {\n\tint x, p;\n\tcin >> x >> p;\n\tif (p == 100) {\n\t\tint tim = (x+1) / 2;\n\t\tcout << tim << endl;\n\t\treturn 0;\n\t}\n\n\tdouble pp = p / 100.0;\n\t// 奇数\n\tif (x % 2) {\n\t\tprintf(\"%.14f\\n\", (double)(1 - pp) / pp + 1 + (double)(x/2) / pp);\n\t}\n\telse\n\t\tprintf(\"%.14f\\n\", (double)(x/2) / pp);\n\n\treturn 0;\n}", " #include <bits/stdc++.h>\n #include<iostream>\n #include<cstdio>\n #include<vector>\n #include<queue>\n #include<map>\n #include<cstring>\n #include<string>\n #include <math.h>\n #include<algorithm>\n // #include <boost/multiprecision/cpp_int.hpp>\n #include<functional>\n #define int long long\n #define inf 1000000007\n #define pa pair<int,int>\n #define ll long long\n #define pal pair<double,pa>\n #define ppa pair<pa,int>\n #define ppap pair<int,pa>\n #define ssa pair<string,int>\n #define mp make_pair\n #define pb push_back\n #define EPS (1e-10)\n #define equals(a,b) (fabs((a)-(b))<EPS)\n \n using namespace std;\n \n class Point{\n \tpublic:\n \tdouble x,y;\n \tPoint(double x=0,double y=0):x(x),y(y) {}\n \tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\n \tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\n \tPoint operator * (double a) {return Point(x*a,y*a);}\n \tPoint operator / (double a) {return Point(x/a,y/a);}\n \tdouble absv() {return sqrt(norm());}\n \tdouble norm() {return x*x+y*y;}\n \tbool operator < (const Point &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const Point &p) const{\n \t\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n \t}\n };\n typedef Point Vector;\n \n struct Segment{\n Point p1,p2;\n };\n double dot(Vector a,Vector b){\n \treturn a.x*b.x+a.y*b.y;\n }\n double cross(Vector a,Vector b){\n \treturn a.x*b.y-a.y*b.x;\n }\n class pa3{\n \tpublic:\n \tint x,y,z;\n \tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\n \tbool operator < (const pa3 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\t return z<p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \t\t\t\tbool operator > (const pa3 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\t return z>p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa3 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z;\n \t}\n \t\tbool operator != (const pa3 &p) const{\n \t\t\treturn !( x==p.x && y==p.y && z==p.z);\n \t}\n \n };\n \n \n bool parareru(Point a,Point b,Point c,Point d){\n //\tif(abs(cross(a-b,d-c))<EPS)cout<<\"dd \"<<cross(a-b,d-c)<<endl;\n \treturn abs(cross(a-b,d-c))<EPS;\n }\n double distance_ls_p(Point a, Point b, Point c) {\n if ( dot(b-a, c-a) < EPS ) return (c-a).absv();\n if ( dot(a-b, c-b) < EPS ) return (c-b).absv();\n return abs(cross(b-a, c-a)) / (b-a).absv();\n }\n bool is_intersected_ls(Segment a,Segment b) {\n \tif(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;\n \tif(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){\n //\t\tcout<<\"sss\"<<endl;\n \t\tif(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;\n \t\tif(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;\n \t\tif(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;\n \t\tif(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;\n \t\treturn false;\n \t}\n else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );\n }\n \n double segment_dis(Segment a,Segment b){\n \tif(is_intersected_ls(a,b))return 0;\n \tdouble r=distance_ls_p(a.p1, a.p2, b.p1);\n \tr=min(r,distance_ls_p(a.p1, a.p2, b.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p1));\n \treturn r;\n }\n Point intersection_ls(Segment a, Segment b) {\n Point ba = b.p2-b.p1;\n double d1 = abs(cross(ba, a.p1-b.p1));\n double d2 = abs(cross(ba, a.p2-b.p1));\n double t = d1 / (d1 + d2);\n \n return a.p1 + (a.p2-a.p1) * t;\n }\n \n string itos( int i ) {\n ostringstream s ;\n s << i ;\n return s.str() ;\n }\n \n int gcd(int v,int b){\n \tif(v>b) return gcd(b,v);\n \tif(v==b) return b;\n \tif(b%v==0) return v;\n \treturn gcd(v,b%v);\n }\n \n double distans(double x1,double y1,double x2,double y2){\n \tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\n \treturn sqrt(rr);\n \t\n }\n /*\n int pr[100010];\n //int inv[100010];\n */ \n int beki(int wa,int rr,int warukazu){\n \tif(rr==0) return 1ll;\n \tif(rr==1) return wa%warukazu;\n \tif(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;\n \tint zx=beki(wa,rr/2,warukazu);\n \treturn (zx*zx)%warukazu;\n }\n // cin.tie(0);\n//ios::sync_with_stdio(false);\n /*\n void gya(){\n \tpr[0]=1;\n \tfor(int i=1;i<100010;i++){\n \t\tpr[i]=(pr[i-1]*i)%inf;\n \t}\n \tfor(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);\n \t\n }\n \n */\n //sort(ve.begin(),ve.end(),greater<int>());\n //----------------kokomade tenpure------------\n //vector<double> ans(100000000),ans2(100000000);\n \n int par[200100],ranks[200100],kosuu[200100]; \n \n void shoki(int n){\n \tfor(int i=0;i<n;i++){\n \t\tpar[i]=i;\n \t\tranks[i]=0;\n \t\tkosuu[i]=1;\n \t}\n }\n \n int root(int x){\n \treturn par[x]==x ? x : par[x]=root(par[x]);\n }\n \n bool same(int x,int y){\n return root(x)==root(y);\n }\n \n void unite(int x,int y){\n x=root(x);\n y=root(y);\n \tint xx=kosuu[x],yy=kosuu[y];\n if(x==y) return;\n \tif(ranks[x]<ranks[y]){\n \t\tpar[x]=y;\n \t\tkosuu[y]=yy+xx;\n \t}\n else {\n \tpar[y]=x;\n \tif(ranks[x]==ranks[y]) ranks[x]=ranks[x]+1;\n \tkosuu[x]=yy+xx;\n }\n \treturn;\n }\n\nvector<int> ve;\nint ans[100020];\nint w[100020];\nint x[100020];\n int n,l,t;\nint f(int r){\n\t\n\tif(r>=0){\n\t\treturn r%n;\n\t\n\t}\n\tint rr=-r;\n\tint g=rr/n+1;\n\trr-=g*n;\n\treturn f(-rr);\n}\n signed main(){\n \t cin.tie(0);\nios::sync_with_stdio(false);\n\nint x;\n \tdouble p;\n \tcin>>x>>p;\n \tp/=100.0;\n \t\n \tx=(x+1)/2;\n \tprintf(\"%.10lf\\n\",x/p);\n }\n \n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main () {\n long long x,p;\n double ans;\n cin >> x >> p;\n if (x % 2 == 0) {\n x /= 2;\n ans = x;\n ans *= 100;\n ans /= p;\n }\n else {\n x /= 2;\n ans = x*p + (x+1)*(100-p);\n ans /= p;\n ans += 1;\n }\n \n cout << fixed << setprecision(10) << ans << endl;\n \n \n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n double x,p;cin>>x>>p;\n int y=x;\n double iti=(100-2*p)/(double)100;\n if((int)y%2==1)x+=iti;\n double ans=x/(1-iti);\n if((int)y%2==1){\n ans+=1.0;\n }\n cout<<fixed<<setprecision(12)<<ans<<endl;\n}\n ", "#define _USE_MATH_DEFINES\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))\n#define rep(i,j) FOR(i,0,j)\n#define each(x,y) for(auto &(x):(y))\n#define mp make_pair\n#define MT make_tuple\n#define all(x) (x).begin(),(x).end()\n#define debug(x) cout<<#x<<\": \"<<(x)<<endl\n#define smax(x,y) (x)=max((x),(y))\n#define smin(x,y) (x)=min((x),(y))\n#define MEM(x,y) memset((x),(y),sizeof (x))\n#define sz(x) (int)(x).size()\n#define RT return\nusing ll = long long;\nusing pii = pair<int, int>;\nusing vi = vector<int>;\nusing vll = vector<ll>;\n\nvoid solve() {\n int X, P;\n cin >> X >> P;\n double p = P / 100.0;\n\n auto f = [&](int x) {\n return x / (2 * p);\n };\n\n if (X % 2 == 0) {\n cout << f(X) << endl;\n } else {\n cout << 1 + f(X - 1)*p + f(X + 1)*(1 - p) << endl;\n }\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(15);\n\tsolve();\n\treturn 0;\n}", "N = int(input())\nM = int(input())\nif N%2:\n print(1 + (N-1) / 2 + (100 - M) * (N+1) /2 / M)\nelse:\n print(N * 50 / M)", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define INF_LL (int64)1e18\n#define INF (int32)1e9\n#define REP(i, n) for(int i = 0;i < (n);i++)\n#define FOR(i, a, b) for(int i = (a);i < (b);i++)\n#define all(x) x.begin(),x.end()\n#define fs first\n#define sc second\n\nusing int32 = int_fast32_t;\nusing uint32 = uint_fast32_t;\nusing int64 = int_fast64_t;\nusing uint64 = uint_fast64_t;\nusing PII = pair<int32, int32>;\nusing PLL = pair<int64, int64>;\n\nconst double eps = 1e-6;\n\ntemplate<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}\ntemplate<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}\n\nconst int64 mod = 1e9+7;\n\ndouble res = 0;\ndouble P;\n\ndouble E(int64 x){\n\tdouble num = 1/P;\n\treturn num*x/2;\n}\n\nint main(void){\n\tint64 x;\n\tcin >> x >> P;\n\tP /= 100;\n\tif(x%2){\n\t\tres = 1;\n\t\tres += E(x-1)*P;\n\t\tres += E(x+1)*(1-P);\n\t}else{\n\t\tres += E(x);\n\t}\n\tcout << fixed << setprecision(10) << res << endl;\n}" ]
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week. Write a program which computes the amount of the debt in n weeks. Input An integer n (0 ≤ n ≤ 100) is given in a line. Output Print the amout of the debt in a line. Example Input 5 Output 130000
[ "#encoding=utf-8\n\ninp = input()\nx = 100000\nfor i in xrange(inp):\n\tx = x * 1.05\n\tif int(x % 1000) != 0:\n\t\tx += 1000 - int(x % 1000)\n\nprint int(x)", "import math\nn = int(input())\na = 100000\nfor _ in range(n):\n a *= 1.05\n a = 1000 * math.ceil(a / 1000)\nprint(a)\n\n", "n=int(raw_input())\ng,r=100000,1.05\nfor i in range(n):\n g*=r\n if int(g)%1000>0:\n g=(int(g)/1000)*1000+1000\nprint g", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tdouble ans=100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tans=ans*1.05;\n\t\t\tif(ans%1000!=0){\n\t\t\t\tans=ans+1000-ans%1000;\n\t\t\t}\n\t\t}\n\t\tint a=(int)ans;\n\t\tSystem.out.println(a);\n\t}\n}", "#include <stdio.h>\n#include <string.h>\n\nint main(){\n\tint n;\n\tscanf(\"%d\", &n);\n\tint m = 100000;\n\tfor(int i=0;i<n;i++){\n\t\tm *= 1.05;\n\t\tif(m%1000 != 0) m = (m/1000+1)*1000;\n\t}\n\tprintf(\"%d\\n\", m);\n}", "a = input()\nret = 100000\n\nwhile 0<a:\n\tret *= 1.05\n\tif(ret%1000):\n\t\tret = int((ret//1000+1)*1000)\n\ta -= 1\n\t\nprint ret", "#include <iostream>\nusing namespace std;\n\nint main(){\n\n\tint i,n=100000,m;\n\n\tcin >> i;\n\twhile(i--){\n\t\tn+=n*0.05;\n\t\tm=n%1000;\n\t\tif(m){\n\t\t\tn+=1000-m;\n\t\t}\n\t}\n\tcout << n << endl;\n\n\treturn 0;\n}", "import sys\nimport math\n\nn = int(input())\ndebt = 100000\nfor i in range(1,n+1):\n\tdebt = math.ceil((debt*1.05)/1000)*1000\nprint(debt)", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tdouble debt = 100000;\n\t\tint N = in.nextInt();\n\t\tfor(int i=0;i<N;i++){\n\t\t\tdebt = Math.ceil(debt*1.05/1000)*1000;\n\t\t}\n\t\tSystem.out.printf(\"%.0f\\n\",debt);\n\t}\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tfloat b=100000;\n\n\tcin>>n;\n\n\tfor(int i=0;i<n;i++){\n\t\tb*=1.05;\n\t\tb=(int)((b+999)*0.001);\n\t\tb*=1000;\n\t}\n\tcout<<(int)b<<endl;\n}", "#include <iostream>\n#include <string>\nusing namespace std;\nint main() {\n\tint m = 100000, n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tm *= 1.05;\n\t\tif(m%1000)\n\t\t\tm += 1000 - m % 1000;\n\t}\n\tcout << m << endl;\n\treturn 0;\n}\n", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(){\nint n;\ncin >> n;\nint a;\na=100000;\nint b;\nb=0;\nwhile(b<n){\na=a/20*21;\nif((a%1000)!=0){a=a/1000*1000+1000;}\nb=b+1;}\ncout << a<<endl;\n}", "import java.io.PrintWriter;\nimport java.util.*;\n\nimport static java.lang.Math.*;\n\npublic class Main{\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in); \n\t\tPrintWriter out=new PrintWriter(System.out);\n\t\tdouble money = 100000;\n\t\tfinal double tax = 1.05;\n\t\tint n= sc.nextInt();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tmoney*=tax;\n\t\t\tmoney/=1000;\n\t\t\tmoney=ceil(money);\n\t\t\tmoney*=1000;\n\t\t}\n\t\tout.println((int)money);\n\t\tout.flush();\n\t}\n\n}\n\n\n\t", "#include<stdio.h>\nint main()\n{\n\tint n;\n\tlong long int s=100000;\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++){\n\t\ts*=1.05;\n\t\ts+=999;\n\t\ts/=1000;\n\t\ts*=1000;\n\t}\n\tprintf(\"%d\\n\",s);\n\treturn 0;\n}", "import math\ndebt = 100000\nrate = 1.05\nweek = int(input())\nfor i in range(week):\n debt = math.ceil(debt*1.05/1000)*1000\nprint(debt)\n", "#include <iostream>\nusing namespace std;\nint main(){\n\tint n,i;\n\tdouble m=100.0;\n\tcin>>n;\n\tfor(i=0;i<n;i++){\n\t\tm*=1.05;\n\t\tif(m-(int)m>0.0){\n\t\t\tm+=1.0;\n\t\t\tm=(int)m;\n\t\t}\n\t}\n\tcout<<m<<\"000\"<<endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main()\n{\n\tll n, res = 100000;\n\tcin >> n;\n\twhile (n--) {\n\t\tres = (res + res / 20 + 999) / 1000 * 1000;\n\t}\n\tcout << res << endl;\n\treturn 0;\n}", "from math import ceil\nn=int(input())\nd=int(1e5)\nfor x in range(n):\n\td=(1.05*d)\n\td=int(int(ceil(d/1e3))*1e3)\nprint(d)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tdouble p = 100000;\n\t\tint n = s.nextInt();\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tp *= 1.05;\n\t\t\tp = Math.ceil(p / 1000) * 1000;\n\t\t}\n\t\tSystem.out.println((int)p);\n\t}\n}", "import java.io.*;\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\t\n\t\tBufferedReader br = \n\t\t\tnew BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tint sum = 100000;\n\t\tdouble debt = sum * 0.05;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tsum += debt;\n\t\t\tif (sum % 1000 != 0) {\n\t\t\t\tsum -= sum % 1000;\n\t\t\t\tsum += 1000;\n\t\t\t}\n\t\t\tdebt = sum * 0.05;\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n\n}", "import java.io.*;\n\npublic class Main{\n\tpublic static void main(String argv[]) throws IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = br.readLine();\n\t\tint weeks = Integer.parseInt(line);\n\t\tfloat debt = 100000;\n\t\tfor(int i=0; i<weeks; i++){\n\t\t\tdebt *= 1.05f;\n\t\t\tif((debt % 1000) > 0.0){\n\t\t\t\tdebt = debt+1000-debt%1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(Integer.toString((int)debt)+\"\\n\");\n\t}\n}", "x=int(input())\ni=0\na=100000\nwhile x>i :\n a=a+a*0.05\n if a%1000!=0 : a=a+1000\n a=int(a/1000)\n a=a*1000\n i=i+1\nprint(a)\n", "import math\n\ndebt = 100000\nn = int(input())\nfor w in range(n):\n debt *= 1.05\n debt = math.ceil(debt / 1000) * 1000\nprint(debt)", "import math\nn = int(input())\nmoney = 100000\nfor i in range(n):\n money = money*1.05\n money = math.ceil(money/1000)*1000\nprint(money)\n", "x = 100000\nn = int(input())\nfor _ in range(n):\n x = x*1.05\n if x%1000>0:\n x = x-x%1000+1000\nprint(int(x))\n", "#include<iostream>\n\nusing namespace std;\n\ndouble money = 100000;\n\nint i;\n\nint main()\n{\n\tcin>>i;\n\tfor(i;i>0;--i)\n\t{\n\t\tmoney *= 1.05;\n\t\tmoney = (long)(money/1000+0.99)*1000;\n\t}\n\tprintf(\"%.0lf\\n\",money);\n}", "public class Main {\n\tstatic java.util.Scanner scan = new java.util.Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tint input = scan.nextInt();\n\t\tdouble total = 100;\n\t\twhile (0 < input--) {\n\t\t\ttotal = Math.ceil(total * 1.05);\n\t\t}\n\t\ttotal *= 1000;\n\t\tprint((int) total);\n\t}\n\t\n\tpublic static void print(Object out) {\n\t\tSystem.out.println(out);\n\t}\n}", "#include<stdio.h>\n\nint main(void){\n\tint n,i,x=100000,z;\n\t\n\tscanf(\"%d\",&n);\n\n\tfor(i=0;i<n;i++)\n\t{\n\t\tx = x * 1.05;\n\t\t\n\t\tif(x % 1000 != 0.0)\n\t\t{\n\t\t\tz = (x / 1000)+1;\n\t\t\tx = z * 1000;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",x);\n\n\treturn 0;\n}", "n = int(input())\nd = 100000\nfor i in range(n):\n d *= 1.05\n d = d - (d - 1) % 1000 + 999\nprint(int(d))", "#include <stdio.h>\n\nint main(){\n\tint i,n,debt = 100000;\n\tscanf(\"%d\",&n);\n\tfor(i = 0;i < n;i++){\n\t\tdebt = (((int)(debt * 1.05) - 1) / 1000 + 1) * 1000;\n\t}\n\tprintf(\"%d\\n\",debt);\n}", "import java.util.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\n\tScanner sc = new Scanner(in);\n\t\n\tvoid run() {\n\t\tint n = sc.nextInt();\n\t\tint m = 100000;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tm += (int)Math.ceil(m*0.05/1000)*1000;\n\t\t}\n\t\tout.println(m);\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n}", "import math\ndebt = 100000\nfor n in range(int(input())):\n debt = math.ceil(debt*1.05/1000)*1000\nprint(str(debt))\n\n", "n=int(input())\nx=100000\nfor i in range(n):\n x*=1.05\n if x%1000>0:\n x=x-(x%1000)+1000\n else:\n pass\nprint(int(x))\n", "def f(a,b):\n if (b == 0): return a\n a = a * 1.05\n if (a%1000 != 0): a = a - a%1000 + 1000\n return f(a,b-1)\nprint int(f(100000,input()))", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args)\n\t throws IOException {\n\t\tBufferedReader br = new BufferedReader(\n\t\t new InputStreamReader(System.in));\n\t\tint v = Integer.parseInt(br.readLine());\n\t\tint m = 100000;\n\t\tfor (int i = 0; i < v; i++) {\n\t\t\tm *= 1.05;\n\t\t\tif ((m % 1000) > 0) {\n\t\t\t\tm += 1000 - m % 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(m);\n\t}\n}", "import java.util.*;\nimport java.math.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tdouble money = 100.00;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tmoney = money*1.05;\n\t\t\tBigDecimal tmp = new BigDecimal(money);\n\t\t\tmoney = tmp.setScale(0,BigDecimal.ROUND_UP).doubleValue();\n\t\t}\n\t\tSystem.out.println((int)money*1000);\n\t}\n}", "#include <stdio.h>\n\nint main(void)\n{\n\tint n;\n\tint ans = 100000;\n\t\n\tscanf(\"%d\", &n);\n\t\n\tfor (int i = 0; i < n; i++){\n\t\tans += ans * 0.05;\n\t\tans = (ans + 999) / 1000 * 1000;\n\t}\n\t\n\tprintf(\"%d\\n\", ans);\n\t\n\treturn (0);\n}", "import math as k\nn=input()\nm=105\nfor i in range(n-1):\n\tm=k.ceil(m*1.05)\nprint int(m*1000)", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int money = 100;\n for (int i = 0; i < n; i++){\n double x = (double)money * 1.05;\n money = (int)(Math.ceil(x));\n }\n System.out.println(money * 1000);\n }\n}", "n = int(input())\namount = 100000\nfor i in range(n):\n amount = int(-(-amount * 1.05 // 1000) * 1000)\nprint(amount)\n", "import math\ndebt = 100000\nn = int(input())\n\nfor i in range(n):\n debt *= 1.05\n debt = math.ceil(debt * 0.001)*1000\nprint(debt)\n\n", "#include <iostream>\n#include <cmath>\nusing namespace std;\nint main() {\n\tint n;\n\tcin >> n;\n\tint ans = 100000;\n\tfor (int i = 0; i < n; i++)\n\t\tans = ceil(ans * 1.05 / 1000) * 1000;\n\tcout << ans << endl;\n}\n", "s=100000\nn=int(input())\nfor i in range (n):\n s*=1.05\n if s%1000!=0:\n s=s-(s%1000)+1000\nprint(int(s))\n", "import java.util.Scanner;\n\npublic class Main{\n\tstatic int debt(int n){\n\t\tint x = 100000;\n\t\twhile( n > 0 ){\n\t\t\tx *= (1 + 0.05);\n\t\t\tif( x%1000 != 0 ){\n\t\t\t\tx = x - x%1000 + 1000;\n\t\t\t}\n\t\t\tn--;\n\t\t}\n\t\treturn x;\n\t}\n\n\tpublic static void main(String[] args){\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\n\t\tSystem.out.println(debt(n));\n\t}\n}", "n=int(input())\ns=100000\nfor i in range(n):\n s*=1.05\n p=s%1000\n if p!=0:\n s+=1000-p\nprint(int(s))\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint debt=100000;\n\t\tint n=sc.nextInt();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tdebt=(int)Math.ceil((debt*1.05)/1000)*1000;\n\t\t}\n\t\tSystem.out.println(debt);\n\t\tsc.close();\n\t}\n}", "n=int(input())\na=100000\nfor i in range(n):\n a=a*1.05\n if a%1000 != 0:\n a=int(a//1000*1000+1000)\nprint(a)\n\n\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint lend=100000;\n\tfor(int i=1;i<=n;i++){\n\t\tlend=(lend*1.05-1)/1000;\n\t\tlend=(lend+1)*1000;\n\t}\n\tcout<<lend<<endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint week = scan.nextInt();\n\t\tdouble debt = 100000;\n\t\t\n\t\tfor(int i = 0; i < week; i++){\n\t\t\tdebt = debt * 1.05 / 1000;\n\t\t\tdebt = Math.ceil(debt);\n\t\t\tdebt = debt * 1000;\n\t\t}\n\t\t\n\t\tint ans = (int)debt;\n\t\tSystem.out.println(ans);\n\n\t}\n\n}", "import math\n\nn = int(raw_input())\ndebt = 100000\n\nfor i in range(n):\n debt = int(math.ceil(debt * 1.05 / 1000)) * 1000 \nprint debt", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\tlong long int N; cin >> N;\n\tlong long int num = 100;\n\twhile (N--) {\n\t\tnum =num* 1.0499999999+1;\n\t}\n\tcout << num * 1000 << endl;\n\treturn 0;\n}\n\n", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n\tfinal Scanner sc=new Scanner(System.in);\n\tint syakkin=100000;\n\tint n=sc.nextInt();\n\tfor(int i=0;i<n;i++){\n\t syakkin*=1.05;\n\t if(syakkin%1000!=0){\n\t\tsyakkin=((syakkin/1000)+1)*1000;\n\t }\n\t}\n\tSystem.out.println(syakkin);\n }\n}", "#!/usr/bin/python\n# -*- coding: utf-8 -*-\n\nimport math\n\nresult = 100000\nnum = int(raw_input())\n\nfor i in range(num):\n\tresult *= 1.05\n\tresult /= 1000\n\tresult = math.ceil(result)\n\tresult *= 1000\n\nprint int(result)", "import math\n\nn = eval(input())\nyen = 100000\nfor i in range(n):\n\tyen += yen * 0.05\n\tyen = int(math.ceil(yen / 1000.0) * 1000)\nprint(yen)", "import math\n\nv = int(input())\n\ncal = 100000\nfor w in range(v):\n cal = math.ceil(cal * 1.05 * 0.001) * 1000\n\nprint(\"%d\" % cal)", "#include<iostream>\n#include<stdio.h>\n\nint main(){\n\tint n,i,a,b,c;\n std::cin>>a;\n for(n=0,i=100000;a>n;++n){\n\t i=i+i/20;\n\t if(i%1000!=0){\n\t\t b=i%1000;\n\t\t i=i+1000-b;\n\t\t}\n\t}\n std::cout<<i<<std::endl;\n\treturn 0;\n\t}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint a=sc.nextInt();\n\t\tint money=100000;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tmoney*=1.05;\n\t\t\tint amari=money%1000;\n\t\t\tmoney-=amari;\n\t\t\tmoney+=amari==0 ? 0 : 1000;\n\t\t}\n\t\tSystem.out.println(money);\n\t}\n}", "import math\n\ndebt = 100\nn = int(input())\n\nfor _ in range(n):\n\tdebt = math.ceil(debt * 1.05)\n\nprint(debt * 1000)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin >> n;\n\tint y = 100000;\n\tfor(int i = 0 ; i < n ; i++){\n\t\ty = y * 105 / 100;\n\t\tif( y % 1000 ) y += 1000 - y % 1000;\n\t}\n\tcout << y << endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tprivate static final int origin = 100000;\n\tprivate static final double interest = 1.05;\n\n\tstatic Scanner sc = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\t\tint num = sc.nextInt();\n\t\tdouble ans = origin;\n\n\t\tfor(int count = 0; count < num; count++) {\n\t\t\tans = ans * interest / 1000;\n\t\t\tans = Math.ceil(ans) * 1000;\n\t\t}\n\n\t\tSystem.out.println((int)ans);\n\t}\n\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint money = 100;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmoney = (int) Math.ceil(money * 1.05);\n\t\t}\n\t\tSystem.out.println(money * 1000);\n\t}\n}", "import math\ndebt = 100000\nfor i in range(int(raw_input())):\n debt = int(math.ceil((debt * 1.05) / 1000)) * 1000\nprint debt", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint m = 100000;\n\tint n;\n\tcin >> n;\n\n\tfor(int i=0; i<n; i++)\n\t{\n\t\tm += m / 20;\n\t\tif(m % 1000 != 0) m = (m / 1000 + 1) * 1000;\t\n\t}\n\tprintf(\"%d\\n\", m);\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin >> n;\n\tint s=0;\n\tint a=100000;\n\twhile (s<n){\n\t\ts++;\n\t\ta=a+a*0.05;\n\t\ta=((a+999)/1000)*1000;\n\t}\n\tprintf(\"%d\\n\",a);\n}\n\n\n\n", "import math\nN = int(input())\nA = 100000\nfor _ in range(N):\n A = A * 1.05\n A = (int(math.ceil(A / 1000))) * 1000\nprint(A)\n\n", "import java.util.Scanner;\n \nclass Main {\n public static void main(String[] args) {\n int weeks = new Scanner(System.in).nextInt();\n double debt = 100000;\n for(int i = 0; i < weeks;i++) {\n debt *= 1.05;\n double fraction = debt % 1000;\n if (fraction != 0)debt += 1000 - fraction;\n }\n System.out.println((long)debt);\n}\n}", "a = 100000;\nn = int(input())\nwhile n > 0:\n n -= 1\n a = a + (a * 5) // 100\n a = ((a - 1) // 1000 + 1) * 1000 # 1000未満の切り上げ\nprint(a)\n", "#include <stdio.h>\nint main() {int kane=100000,N;scanf(\"%d\",&N);while (N--) {kane=kane+kane/20;int rest=kane%1000;if (rest) kane+=(1000-rest);}printf(\"%d\\n\",kane);return 0;}", "import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n, debt = 100000;\n\t\t\n\t\tn = sc.nextInt();\n\t\tfor(int i = 0; i < n; i++){\n\t\t\t debt *= 1.05;\n\t\t\t if(debt % 1000 != 0){\n\t\t\t\t debt += 1000 - debt % 1000;\n\t\t\t }\n\t\t}\n\t\t\n\t\tSystem.out.println(debt);\n\t}\n}", "n = int(raw_input())\n\ndebt=100000\nfor i in range(n):\n debt*=1.05\n if debt % 1000 != 0:\n debt = (int(debt / 1000)+1) * 1000\n else:\n debt = int(debt)\n \nprint debt", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int n;\n int m = 100000;\n cin >> n;\n for(int i = 0; i < n; i++){\n m += m / 20;\n if(m % 1000){\n m += 1000 - m % 1000;\n }\n }\n cout << m << endl;\n}", "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main()\n{\t\n\tint n;\n\tdouble s = 100000;\n\t\t\n\tcin >> n;\n\t\n\twhile(n--)\n\t\ts = ceil(s * 1.05 * 0.001) * 1000;\n\tcout << (int)s << endl;\n\t\t\n\treturn 0;\n}", "#include<iostream>\n#include<cmath>\nusing namespace std;\n\nint main(){\n\tfloat base = 100;\n\tint n;\n\tcin >> n;\n\tfor(int i = 0; i < n; i++){\n\t\tbase *= 1.05;\n\t\tbase = ceil(base);\n\t}\n\tcout << (int)(base*1000) << endl;\n}\n", "a=100000\nfor _ in range(int(input())):\n\ta=((a*1.05)//1000+1)*1000 if (a*1.05)%1000 else a*1.05\nprint(int(a))", "x=100000\nfor i in range(int(input())):\n x*=1.05\n if x%1000!=0:\n x+=1000-x%1000\nprint(int(x))\n", "import java.util.Scanner;\n\n\npublic class Main {\n\n\t\n\tpublic static void main(String[] args) {\n\t\tdouble debt = 100000;\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = Integer.parseInt(stdIn.next());\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tdebt += (debt * 0.05);\n\t\t\tint tmp = (int)(debt / 1000);\n\t\t\tif((debt/1000) != tmp) debt = ((tmp*1000) + 1000);\n\t\t}\n\t\tSystem.out.println((long)debt);\n\t}\n\n}", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint n, k = 100000;\n\n\tcin >> n;\n\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tk = static_cast<int>(k * 1.05 + 999) / 1000 * 1000;\n\t}\n\n\tcout << k << endl;\n\n\treturn 0;\n}", "import math\nn = int(input())\na = 100\nfor i in range(n):\n a = math.ceil(a*1.05)\nprint(a*1000)\n", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n int n;\n int debt = 100000;\n\n cin >> n;\n\n for(int i=0; i<n;i++){\n\tdebt *= 1.05;\n\tif(debt % 1000) debt += (1000-(debt % 1000));\n }\n\n cout << debt << endl;\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint cnt=100000;\n\tfor(int i=0;i<n;i++){\n\t\tcnt=cnt*1.05;\n\t\tif((cnt%1000)>0){\n\t\t\tcnt+=1000;\n\t\t\tcnt-=(cnt%1000);\n\t\t}\n\t}\n\tcout<<cnt<<endl;\nreturn 0;\n}", "import java.util.*;\n\npublic class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tlong mon = 100_000;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tmon = (long) Math.ceil(mon * 1.05 / 1000.0) * 1000;\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", mon);\n\t}\n}", "import math\nimport itertools\nx = 100\nfor _ in itertools.repeat(None,int(input())):\n x = math.ceil(x*1.05)\nprint(x*1000)", "import math\nn = input()\na = 100000\nfor val in range(1,n+1):\n\ta *= 1.05\n\tA = math.ceil(a/1000) * 1000\n\ta = A \nprint int(a)", "import math\nn=int(input())\nz=100000\nfor i in range(1,n+1):\n z+=z*5/100\n z=(math.ceil(z/1000))*1000\nprint(z)\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]){\n long ratio = 100000/1000;\n int n = new Scanner(System.in).nextInt();\n for(int i=0;i<n;i++){\n ratio = (long) Math.ceil(ratio*1.05);\n }\n System.out.println(\"\" + (ratio*1000));\n }\n}", "n=int(input())\ns=100000\nfor i in range(n):\n s*=1.05\n m = s % 1000\n if m!=0:\n s=s-m+1000\nprint(int(s))\n", "import java.util.*;\npublic class Main {\n\n public static void main(String[] args) {\n\t Scanner sc = new Scanner(System.in);\n int Debt = sc.nextInt();\n double a =100;\n for (int i =0;i<Debt;i++){\n a = Math.ceil(a*1.05);\n }\n System.out.println((int)a*1000);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO ?????????????????????????????????????????????\n\t\n\t\tint n = new Scanner(System.in).nextInt();\n\t\tint money = 100000;\n\t\tfor(int i = 0;i<n;i++){\n\t\t\tmoney *= 1.05;\n\t\t\tmoney = (money + 999) /1000 * 1000; \n\t\t}\n\t\tSystem.out.println(money);\n\t}\n\n}", "from math import ceil\nn=int(input())\ns=100000\nfor i in range(n):\n\ts +=(s*0.05)\n\ts=int(int(ceil(s/1000)*1000))\nprint(s)", "\nimport java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tdouble debt=100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tdebt=1.05*debt;\n\t\t\tif(debt%1000!=0){\n\t\t\t\tdebt=debt-debt%1000+1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println((int)debt);\n\t\tsc.close();\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tdouble n,i,tmp;\n\tdouble ans=100000;\n\tcin>>n;\n\twhile(n--){\n\t\tans *= 1.05;\n\t\tans = ceil(ans/1000.0)*1000.0;\n\n\t}\n\tprintf(\"%.f\\n\", ans);\n\treturn 0;\n}", "#include<iostream>\n\nint main(){\n\tint a,b,i,n;\n\tstd::cin>>n;\n\ta=100000;\n\tfor(i=0;i<n;i++){\n\t\ta=a*1.05;\n\tif(a%1000!=0){\n\ta=a-a%1000;\n\ta=a+1000;\n\t}\n}\n\tstd::cout<<a<<std::endl;\n\treturn 0;\n}", "import math\n\nn=int(input())\na=100\ni=1\nwhile i<=n:\n a+=a*0.05\n a=math.ceil(a)\n i+=1\n\nprint(a*1000)\n", "n = input();\n\nans = 100000;\nfor i in range(n):\n ans = int(float(ans) * 1.05);\n ans += 999;\n ans /= 1000;\n ans *= 1000;\n\nprint ans ", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n;\n long ans = 100000;\n \n n = sc.nextInt();\n for(int i=0;i<n;i++){\n\t \tans = ans+(ans/20);\n\t\t if(ans%1000>1){\n\t\t \tans /= 1000;\n\t\t \tans *= 1000;\n\t\t \tans += 1000;\n\t\t }\n } \n System.out.println(ans);\n }\n}", "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args){\n int debt = 100000;\n double interest = 0.05;\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n for (int i = 0; i < n; i++) {\n debt += debt * interest;\n debt = (int)Math.ceil((double)debt / 1000) * 1000;\n } \n System.out.println(debt);\n }\n}", "import java.util.*;\n\npublic class Main {\n private static final Scanner scn = new Scanner(System.in);\n \n public static void main(String[] args) {\n int n = scn.nextInt();\n double d = 100;\n for(int i = 0; i < n; i++) {\n d = Math.ceil(d * 1.05);\n }\n System.out.println((int)d * 1000);\n }\n}", "debt = 100000\nn = int(input())\n\nfor i in range(n):\n debt *= 1.05\n if debt % 1000 != 0:\n debt = int(((debt // 1000) + 1) * 1000)\n\nprint(debt)\n", "import java.util.Scanner;\npublic class Main {\n public static void main (String[] args) {\n\tScanner scan = new Scanner(System.in);\n\tint n = scan.nextInt();\n\tdouble money = 100;\n\tfor (int i = 0; i < n; i++) {\n\t money *= 1.05;\n\t money = Math.ceil(money);\n\t}\n\tSystem.out.println((int)money * 1000);\n }\n}", "#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n int n, m = 100;\n cin >> n;\n while (n--) {\n m = ceil(m * 1.05);\n }\n cout << m * 1000 << endl;\n\n return 0;\n}", "import java.util.Scanner;\n\nclass Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n;\n\t\tint money = 100000;\n\t\t\n\t\tn = stdIn.nextInt();\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tmoney *= 1.05;\n\t\t\tif (money % 1000 != 0){\n\t\t\t\tmoney /= 1000;\n\t\t\t\tmoney *= 1000;\n\t\t\t\tmoney += 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(money);\n\t}\n}", "#! /usr/bin/python3\n\nm=100\nfor _ in range(int(input())):\n m = int(m*1.05+0.999)\nprint(m*1000)", "import java.util.Scanner;\nimport java.math.*;\n\nclass Main{\npublic static void main(String[] args){\nScanner sc=new Scanner(System.in);\nint w=sc.nextInt();\nint a=100000;\nfor(int i=0;i<w;i++){\na+=a/20;\nBigDecimal x=new BigDecimal(a);\nx=x.setScale(-3,RoundingMode.CEILING);\na=x.intValue();\n}\nSystem.out.println(a);\n}\n}", "import math\nn=int(input())\nS=100\nfor i in range(n):\n S=S+0.05*S\n S=math.ceil(S)\nprint(S*1000)\n\n", "import math\nn=int( input())\na=100000\nfor i in range(n):\n \n a+=a*0.05\n a=math.ceil(a/1000)*1000\n \nprint(math.floor(a))\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tdouble money = 100000; //貸付額\n\t\tint n = sc.nextInt(); //n週間\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmoney = money * 1.05;\n\t\t\tmoney =((Math.ceil(money/1000))*1000);\n\t\t}\n\t\tSystem.out.println((int)money);\n\n\t}\n}\n\n", "import math\nn=int(input())\nr=100000\nfor i in range(n):\n\tr=math.ceil(r*1.05/1000)*1000\nprint(r)", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint week = scan.nextInt();\n\t\tdouble num = 100000;\n\t\tdouble n=1000.0;\n\t\tint i;\n\t\t\n\t\tfor(i=0;i<week;i++){\n\t\t\tnum *= 1.05;\n\t\t\tnum = Math.ceil(num / n) * n;\n\t\t}\n\t\tSystem.out.println((int)num);\n\t\tscan.close();\n\t}\n}", "import java.util.Scanner;\n\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint debt=100000;\n\t\tint temp;\n\t\tdouble interest = 0.05;\n\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tdebt+=debt*interest;\n\t\t\ttemp=debt%1000;\n\t\t\tif(temp>0){\n\t\t\t\tdebt=debt-temp+1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n\n}", "debt = 100000\nn=int(raw_input())\nfor i in range(1,n+1):\n debt = debt*1.05\n if(debt % 1000) != 0:\n debt = (debt - (debt%1000)) + 1000\nprint int(debt)", "#include <stdio.h>\n\nint main(void) {\n\tint i,n,mon = 100000;\n\tscanf(\"%d\",&n);\n\tfor(i = 0; n > i; i++){\n\t\tmon *= 1.05;\n\t\tmon += 999;\n\t\tmon = (int)(mon/1000)*1000;\n\t}\n\tprintf(\"%d\\n\",mon);\n\treturn 0;\n}", "import math\nn = int(input())\nx = 100000\nfor i in range(n):\n x = math.ceil(x * 1.05 / 1000) * 1000\nprint(x)\n", "import java.util.Scanner;\n\npublic class Main {\n\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tdouble debt = 100000/1000;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tdebt = Math.ceil(debt * 1.05);\n\t\t}\n\t\t\n\t\tint result = (int) (debt * 1000);\n\t\tSystem.out.println(result);\n\t}\n\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n int n;\n int m=100000;\n cin>>n;\n for(int i=0;i<n;i++){\n m *=1.05;\n if(m%1000>0) m = (m/1000+1)*1000;\n }\n cout<<m<<endl;\n return 0;\n}", "n = int(input())\nd = 100000\nfor i in range(n):\n d = d *105 //100\n d = -(-d//1000)*1000\nprint(d)\n\n", "n = 100000\nfor i in range(int(input())):\n n *= 1.05;\n if n % 1000:\n n += 1000\n n = int(n / 1000) * 1000\nprint(n)", "import java.util.Scanner;\nimport java.math.*;\nimport java.text.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner input = new Scanner(System.in);\n\t\tint n = input.nextInt();\n\t\tint cur = 100;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tcur = (int)Math.ceil(cur*1.05);\n\t\t}\n\t\tSystem.out.println(cur*1000);\n\t}\n\n}", "import math\nn = input()\nmoney = 100\nfor i in xrange(n):\n money *= 1.05\n money = math.ceil(money)\nprint \"%i\"%(money*1000)", "#include <iostream>\nint main (void)\n{\n\tint w;\n\tstd::cin >> w;\n\tint m = 100000;\n\twhile(0 < w)\n\t{\n\t\tm *= 1.05;\n\t\tif (m % 1000 != 0)\n\t\t{\n\t\t\tm -= m % 1000;\n\t\t\tm += 1000;\n\t\t}\n\t\tw--;\n\t}\n\tstd::cout << m << std::endl;\n}", "import math\n\np = 100\nfor i in range(int(input())):\n p = math.ceil(p * 1.05)\nprint(p * 1000)", "n=int(input())\ns=100000\nfor i in range(n):\n s=int(s*1.05)\n if s % 1000>0:\n s=s//1000*1000+1000\nprint(s)\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t@SuppressWarnings(\"resource\")\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint weekNum = sc.nextInt();\n\n\t\tint debt = 100000;\n\t\tint roundUpNum = 1000;\n\n\t\tfor (int i = 0; i < weekNum; i++) {\n\t\t\tdebt *= 1.05;\n\n\t\t\tdebt = (int) Math.ceil((double) debt / roundUpNum) * roundUpNum;\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n}", "import math\n\nn,dbt = int(input()),100\nfor i in range(n):\n dbt = math.ceil(dbt*1.05)\nprint(dbt*1000)", "import java.util.*;\n\nclass Main {\n public static void main (String [] args) {\n\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n long debt = 100;\n\n for (int x = 0; x < n; x++) {\n int residue = 0;\n if(debt % 20 != 0) residue = 1;\n debt += debt / 20 + residue;\n }\n\n System.out.print(debt);\n System.out.println(\"000\");\n }\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int n,ans = 100000;\n cin >>n;\n while(n--){\n ans = (int)(ans*1.05);\n if(ans%1000){ans = (ans/1000+1)*1000;}\n }\n cout <<ans<<endl;\n return 0;\n}", "import math\na=100\nfor _ in[0]*int(input()):a=math.ceil(a*1.05)\nprint(a*1000)\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String args[] ) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n double sum = 100000;\n\n for (int i = 0;i < n; i++) {\n sum = (1000 * Math.ceil((sum * 1.05) * 0.001));\n }\n\n System.out.println((int)sum);\n }\n}", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n \tScanner scan = new Scanner(System.in);\n \t\n \tdouble money = 100;\n \tint week;\n \twhile (scan.hasNextInt()){\n \t\tweek = scan.nextInt();\n \t\tfor(int i = 0; i < week; i++){\n \t\t\tmoney = Math.ceil(money*1.05);\n \t\t}\n \t\tSystem.out.println((int)money*1000);\n \t}\n }\n}", "import java.util.*;\nimport java.io.*;\nclass Main{\n public static void main(String[] args){\n\ttry{\n\t BufferedReader s = new BufferedReader(new InputStreamReader(System.in));\n\t int x = 100000, n = Integer.valueOf(s.readLine());\n\t for(int i=0; i<n; i++){\n\t\tx+=0.05*x;\n\t\tif(x%1000!=0)\n\t\t x=1000*(x/1000+1);\n\t }\n\t System.out.println(x);\n\t}catch(Exception e){\n\t System.out.println(\"Error\");\n\t}\n }\n}", "n = int(input())\nMo = 100000\nfor i in range(n):\n Mo = Mo * 1.05\n if Mo%1000 != 0:\n Mo = (int(Mo/1000) + 1)*1000\nprint(int(Mo))", "t = int(input())\na = 100000\nfor i in range(t):\n a = a * 1.05\n if a % 1000:\n a = a - (a % 1000) + 1000\nprint(int(a))\n", "n = input()\na = 100000\nfor i in range(1,int(n)+1):\n a = int(a*1.05)\n if(a%1000 > 0):\n a = 1000*int(a/1000) + 1000\n\nprint(a)", "#include<iostream>\nusing namespace std;\n#define N 100000\nint main(){\n\tint n,a;\n\ta=N;\n\tcin >> n;\n\twhile(n--){\n\t\ta+=a/20;\n\t\tif(a%1000)a=a-a%1000+1000;\n\t}\n\tcout << a <<endl;\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint src=100000;\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tsrc=src*105/100;\n\t\tif(src%1000)\n\t\t\tsrc= src-src%1000+1000;\n\t}\n\tcout << src << endl;\n}", "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n double debt = 100000;\n for(int i=0; i<n; i++) {\n debt *= 1.05;\n if(debt % 1000 != 0) {\n debt = (Math.floor(debt/1000)+1)*1000;\n }\n else {\n debt = Math.floor(debt); \n } \n } \n System.out.println((int)debt);\n }\n}", "ans = 100000\nfor _ in range(int(input())):\n ans *= 1.05\n if ans % 1000:\n ans += 1000 - ans % 1000\nprint(int(ans))", "import math\na = 100\nfor i in range (int(input())):\n a = math.ceil(a*1.05)\nprint(a*1000)\n\n", "import java.util.Scanner;\n\n\nclass Main {\n\n\tpublic static void main(String[] args){\n\t\tdouble debt = 100000;\n\t\tdouble rate = 1.05;\n\n\t\tScanner in = new Scanner(System.in);\n\t\tint numWeeks = in.nextInt();\n\t\t\n\t\tfor (int i=1; i<=numWeeks; i++){\n\t\t\tdebt = debt * rate;\n\t\t\tif(debt%1000 == 0){\n\t\t\t\t//do nothing\n\t\t\t} else {\n\t\t\t\tdebt = (debt - (debt%1000)) + 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println((int) debt);\n\t}\n}", "import math\n\nx = 100\nn = int(input())\nfor i in range(n):\n x = x*1.05\n x = math.ceil(x)\n\nprint(x*1000)\n", "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main(void) {\n int a=100 , n;\n cin >> n;\n for (int i=0; i<n; i++){\n a = ceil(a*1.05);\n }\n cout << 1000*a << endl;\n return 0;\n}", "import math\n\nr = 100\nn = int(input())\nfor i in range(n):\n r = math.ceil(r * 1.05)\nprint(r * 1000)\n\n", "n=int(input())\ng=100\nfor i in range(n):\n k=-(-(g*1.05)//1)\n g=k\nprint(int(1000*k))\n", "import math\nn = int(input())\ndebt = 100000\n\nfor i in range(n):\n debt = math.ceil(debt*1.05/1000)*1000\nprint(debt)\n\n", "a=raw_input()\ndebt = 100000\nfor i in range(int(a)):\n debt += debt/20\n b=debt%1000\n if b > 0:\n\tdebt += 1000-b\nprint debt", "import math\n\nn=int(input())\n\na=100\n\nfor i in range(n):\n a=a*1.05\n a=math.ceil(a)\n \nprint(a*1000)\n\n", "import java.util.*;\nimport java.math.*;\n class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tdouble sum = 100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tsum=sum+sum*0.05;\n\t\t\tBigDecimal bi = new BigDecimal(String.valueOf(sum));\n\t\t\tsum = bi.setScale(-3,BigDecimal.ROUND_UP).doubleValue();\n\t\t}\n\t\tSystem.out.printf(\"%.0f\\n\",sum);\n\t}\n}", "# -*- coding: utf-8 -*-\n\nweek = int(raw_input())\ndebt = 100000\nfor i in range(week):\n debt = debt*1.05\n if debt%1000 != 0:\n debt -= debt%1000\n debt += 1000\nprint(int(debt))", "debt = 100000\nfor i in range(int(raw_input())):\n debt *= 1.05\n if debt % 1000: debt = int(debt) / 1000 * 1000 + 1000\nprint debt", "#include<cstdio>\n#include<cstring>\nint main(void){\n\tint a=100000;\n\tint n;\n\tscanf(\"%d\",&n);\n\tfor (int i = 0; i < n; i++){\n\ta = (((a+19999) / 20000)*1000) + a;\n\t}\n\tprintf(\"%d\\n\", a);\n\treturn 0;\n}", "import math\n\nx,y = int(input()),100\nfor i in range(x):\n y = math.ceil(y*1.05)\n\nprint(y*1000)", "N = int(raw_input())\n\nres = 100000\nfor i in range(N):\n res *= 1.05\n if res % 1000 > 0:\n res -= res % 1000\n res += 1000\nprint int(res)", "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint debt = 100000;\n\t\tint n = scanner.nextInt();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdebt = (int)(debt * 1.05);\n\t\t\tif (debt % 1000 != 0) {\n\t\t\t\tdebt = debt - (debt % 1000) + 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n}", "import sys\nimport math\n\nn = (int)(input())\nmoney = 100000.0\n\nfor i in range(n):\n money = math.ceil(money * 1.05 / 1000) * 1000\nprint((int)(money))", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main{\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tint period = Integer.parseInt(new BufferedReader(new InputStreamReader(System.in), 128).readLine());\n\t\tshort val = 100;//壱百千円\n\t\tfor (; 0 < period; period--) {\n\t\t\tval = (short) Math.ceil(val * 1.05);\n\t\t}\n\t\tSystem.out.println(val * 1000);\n\t}\n}", "import math\nn = int(input())\nd = 100000\nfor i in range(n):\n d = d * 1.05\n d = math.ceil(d / 1000) * 1000\nprint(d)\n\n", "import math as m\nyen = 100000\nfor i in range(int(input())):\n yen = m.ceil((yen*1.05)/1000)*1000\nprint(yen)", "import java.util.*;\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner stdIn = new Scanner(System.in);\n\t\t\n\t\tint n = stdIn.nextInt();\n\t\tlong money = 100000;\n\t\t\n\t\tfor(int i=1; i<=n; i++){\n\t\t\tmoney = (long) (money*1.05);\n\t\t\tif(money % 1000 != 0)\n\t\t\t\tmoney = money - money%1000 +1000 ; \n\t\t\t\t\n\t\t}\n\t\t\n\t\tSystem.out.println(money);\n\n\t}\n\n}", "import java.util.*;\npublic class Main{\n public static void main(String [] args){\n Scanner sc = new Scanner(System.in);\n int gankin = 100000, week = sc.nextInt();\n double risoku = 0.05;\n for(int i = 0;i < week;i++){\n gankin *= (1 + risoku);\n if(gankin % 1000 != 0){\n gankin = gankin - (gankin % 1000) + 1000;\n }\n }\n System.out.println(gankin);\n }\n}", "import math\n\nn = int(input())\ndebt = 100000\n\nfor i in range(n):\n debt = 1000 * math.ceil(debt * 1.05 / 1000.0)\n\nprint(debt)\n", "import math\nf=100000\nfor i in range ( int ( input ( ) ) ):\n f=f*1.05\n f=int(math.ceil(f/1000)*1000)\n \nprint( f )\n", "import math\nn=int(input())\nx=100000\nfor i in range(n):\n x=x+0.05*x\n x=(math.ceil(x/1000))*1000\n \nprint(x)\n", "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint kei = 100000;\n\t\tfor(int i=1; i<=n; i++){\n\t\t\tkei *= 1.05;\n\t\t\tif(kei%1000 > 0){\n\t\t\t\tkei = ((kei - kei%1000)+ 1000);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(kei);\n\t}\n}", "#include<iostream>\n#include<cmath>\nusing namespace std;\n\nint main(){\n\tint num = 100;\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tnum=(int)ceil((double)num*1.05);\n\t}\n\tcout << num*1000 << endl;\n\n\treturn 0;\n}", "n = int(raw_input())\ndebt = 100000\nfor i in range(0, n):\n\tdebt = 105*debt/100\n\tif debt % 1000 != 0:\n\t\tdebt = (debt / 1000 + 1) * 1000\nprint debt\n", "import math\nres = 100\nfor i in range(int(input())):\n res = math.ceil(res*1.05)\nprint(res*1000)", "import math\nloan = 100000\nfor i in range(int(input())):\n loan += math.ceil(loan * 0.05 / 1000) * 1000\nprint(loan)", "#include<iostream>\nusing namespace std;\nint main() {\ndouble n=100000;\nint i,b;\ncin>>b;\nfor(i=0;i<b;i++){\nn*=1.05;\nn=(int)(n+999)/1000*1000;\n}\ncout<<(int)n<<endl;\n return 0;\n}", "import java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n=sc.nextInt();\n double b=100;\n for (int i=0;i<n;i++){\n \tb=Math.ceil(b*1.05);\n }\n \n System.out.println((int)b*1000);\n \n }\n}", "n = int(input())\nx = 100000\nfor i in range(n):\n x *= 1.05\n if x % 1000 != 0:\n x = x - x % 1000 + 1000\nprint(int(x))", "#include<cstdio>\nint main(){\n int n;\n int sum=100000;\n scanf(\"%d\",&n);\n for(int i=0;i<n;i++){\n sum+=sum*0.05;\n if(sum%1000) sum=(sum/1000+1)*1000;\n }\n printf(\"%d\\n\",sum);\n}", "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tdouble det = 100;\n\t\tint i;\n\t\tdouble sum = det;\n\t\tfor(i = 0; i < n; i++) {\n\t\t\tsum = Math.ceil(sum * 1.05);\n\t\t}\n\t\tSystem.out.println((int)sum * 1000);\n\n\t\tscanner.close();\n\t}\n\n}\n\n", "import math\nm=100\nfor i in range(input()):m=math.ceil(m*1.05)\nprint int(m)*1000", "#include<cstdio>\n\nint main(){\n\tint n,k=100000;\n\tscanf(\"%d\",&n);\n\tfor(;n>0;n--){\n\t\tk+=k/20;\n\t\tif(k%1000){\n\t\t\tk+=1000;\n\t\t}\n\t\tk-=k%1000;\n\t}\n\tprintf(\"%d\\n\",k);\n\treturn 0;\n}", "x=int(100000)\nn=int(input())\nfor i in range(n):\n x*=1.05\n if x%1000!=0:\n x+=1000-x%1000\nprint(int(x))\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint a = 100000;\n\t\tint n = stdIn.nextInt();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta *= 1.05;\n\t\t\tif(a%1000!=0){a+=1000-a%1000;}\n\t\t}\n\t\tSystem.out.println(a);\n\t}\n}", "#include <iostream>\nusing namespace std;\nint main(){\n\tlong d = 100000;\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\td *= 1.05;\n\t\tif(d%1000 > 0){\n\t\t\td += 1000;\n\t\t}\n\n\t\td /= 1000;\n\t\td *= 1000;\n\t}\n\tcout<<d<<endl;\n\t\n\treturn 0;\n}", "from math import ceil\n\ndebt = 100000\nn = int(input())\nfor i in range(n):\n\tdebt *= 1.05\n\tdebt = ceil(debt / 1000) * 1000\nprint(debt)", "import java.util.Scanner;\n\nclass Main\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint money = 100000;\n\t\tint n = sc.nextInt();\n\t\t\n\t\tfor (int i = 0; i < n ; i++)\n\t\t{\n\t\t\tmoney += money * 5 / 100;\n\t\t\tint a;\n\t\t\tif ((a = money % 1000) != 0) money = money - a + 1000; \n\t\t}\n\t\tSystem.out.println(Integer.toString(money));\n\t}\n}", "inp = int(input())\ndebt = 100000\nfor i in range(inp):\n debt*=1.05\n if debt%1000 !=0:\n debt += 1000-(int(debt%1000))\nprint(int(debt))", "n=input()\nm = 100000\n\nfor _ in xrange(n):\n m = m + m*0.05\n if m % 1000:\n m = m + 1000 - m % 1000\nprint int(m)", "n = input()\nans = 100000\nfor i in range(n):\n\tans *= 1.05\n\tif (ans % 1000) != 0:\n\t\tans = int(ans)\n\t\tans /= 1000\n\t\tans *= 1000\n\n\t\tans += 1000\n\n\nprint int(ans)", "m = 100000\nfor i in range(int(raw_input())):\n m*=1.05\n m=(int((m+999)/1000))*1000\n\nprint m", "import java.io.*;\n\nclass Main{\n public static void main(String[]args)throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n double result = 100000;\n\n for(int i=0; i<n; i++){\n result *= 1.05;\n result = Math.ceil(result/1000)*1000;\n }\n System.out.println((int)result);\n\n }\n}", "import math\ndebt = 100000\nn = int(raw_input())\nfor i in range(n):\n debt = int(math.ceil(debt*1.05/1000)*1000)\nprint debt", "import java.util.*;\npublic class Main {\n\n\tpublic void doIt(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint debt = 100000;\n\t\tfor(int i=0; i < n; i++){\n\t\t\tdebt = debt + (debt * 5 / 100);\n\t\t\tif(debt % 1000 == 0){\n\t\t\t\tdebt = (debt / 1000) * 1000;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tdebt = (debt / 1000 + 1) * 1000;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(debt);\n\n\t}\n\tpublic static void main(String[] args) {\n\t\tMain obj = new Main();\n\t\tobj.doIt();\n\t}\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint n, money = 100000;\n\tcin >> n;\n\twhile (n--){\n\t\tmoney *= 1.05;\n\t\tif (money % 1000){ money = money / 1000 * 1000 + 1000; }\n\t}\n\tcout << money << endl;\n\treturn 0;\n}", "import math\n\nS=100000\nn=int(input())\n\nfor i in range(n):\n S*=1.05\n s=S/1000\n ceilnum = math.ceil(s)\n S=ceilnum*1000 \n\nprint(S)\n", "import math\na = 100000\nfor n in range(int(input())):\n\ta = math.ceil(a*105/100000)*1000\nprint(int(a))", "#include <iostream>\nusing namespace std;\nint main(){\n\tint n;\n\tcin >> n;\n\tlong a = 100000;\n\tfor(int i=0;i<n;i++){\n\t\ta = (a+a/20);\n\t\tif(a%1000!=0) a = (a/1000+1)*1000;\n\t}\n\tcout << a << endl;\n}", "import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint sum = 100000;\t//100,000yen\n\t\tfor(int i=0; i<n; i++){\n\t\t\tsum += Main.DeptMaker(sum);\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n\tprivate static int DeptMaker(int sum){\n\t\tint dept = (int) Math.ceil((sum * 0.05)/1000)*1000;\n\t\treturn dept;\n\t}\n}", "a = 100000\nfor i in range(int(input())):\n a += (int(a * 0.05) + 999) // 1000 * 1000\nprint(a)", "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main() {\n int n, d = 100000;\n cin >> n;\n while (n--) {\n d = (int)ceil(d * 1.05 / 1000) * 1000;\n }\n cout << d << endl;\n return 0;\n}\n", "import math\nprint reduce(lambda a, b: int(math.ceil(a * 1.05 / 1000)) * 1000, range(input()), 100000)", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint n;\n\tint\n\t\ta=100000;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++){\n\t\ta = a*1.05;\n\t\tif (a % 1000!=0){\n\t\t\ta = a + 1000 - a % 1000;\n\t\t}\n\t}\n\tcout << a << endl;\n\n}\n", "import math\n\nn = input()\nrent = 100000\n\nfor i in range(0, n):\n rent = math.ceil(rent*1.05/1000)*1000\n\nprint \"%d\"%rent", "n=int(input())\ndept=100000\nfor i in range(n):\n dept*=1.05\n if dept%1000!=0:\n dept=dept-dept%1000+1000\nprint(int(dept))", "\nimport java.util.Scanner;\n\npublic class Main {\n \n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int week = scan.nextInt();\n int debt = 100000;\n for(int i = 0; i < week; i++) {\n debt *= 1.05;\n debt = (int)(debt * 0.001 + 0.999) * 1000;\n }\n System.out.println(debt);\n }\n}", "#include<iostream>\n\nusing namespace std;\n\nint main(void){\n\tint money = 100000;\n\tint n;\n\tcin>>n;\n\tfor(int i = 0; i < n ; i++){\n\tmoney = money + ((int)(money * 0.05)+999)/1000*1000;\n\t}\n\tcout<<money<<endl; \n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n\tint n, m = 100000;\n\tcin >> n;\n\n\tfor (int i = 0; i < n; ++i) {\n\t\tm *= 1.05;\n\t\tif (m % 1000) {\n\t\t\tm += 1000 - m % 1000;\n\t\t}\n\t}\n\tcout << m << endl;\n}", "#include <iostream>\n#include<cmath>\nusing namespace std;\n\nint main() {\n\tint n;cin>>n;\n\tint a=100;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\ta=(int)ceil(a*1.05);\n\t}\n\tcout<<a*1000<<endl;\n\treturn 0;\n}", "import math\nj = 100\nfor _ in range(int(input())):\n j = math.ceil(j * 1.05)\nprint(j * 1000)\n", "n = int(input())\nm = 100000\nfor i in range(n):\n m = m * 1.05\n if m % 1000 > 0:\n m = m - (m%1000) + 1000\n\nprint(int(m))\n\n", "import math\nx=100\nfor i in range(int(input())):\n x=math.ceil(x*1.05)\nprint(str(x)+\"000\")\n", "#include<stdio.h>\nint main()\n{\nint n,x;\n\ndouble r,y;\nx=100000;\nr=1.05;\nscanf(\"%d\",&n);\nfor(int i=0;i<n;i++){\nx=r*x;\nif(x%1000>0)x=x+1000-(x%1000);\n}\nprintf(\"%d\\n\",x);\nreturn 0;\n}", "import math\nn=input()\nS=100000\n\nfor i in range(n):\n\tS*=1.05\n\tS=int( math.ceil(S/1000)*1000 )\nprint S\n", "n = int(input())\ns = 100000\n\nfor i in range(n):\n s = int((s*1.05)/1000+0.9999)*1000\n\nprint(s)\n\n\n", "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int answer = 100000;\n int n = sc.nextInt();\n\n for(int i = 0; i < n; i++){\n answer *= 1.05;\n if(answer % 1000 == 0){continue;}\n answer += 1000 - (answer % 1000);\n }\n\n System.out.println(answer);\n\n\n }\n}", "import math\nn = int(input())\ndebt = 100000\nfor i in range(n):\n\tdebt = int(math.ceil(debt * 1.05 / 1000)) * 1000\nprint(debt)", "import java.util.Scanner;\n\nclass Main{\t\n\t\n\tpublic static void main (String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\tint n = sc.nextInt();\n\t\t\tint syakkin = 100000;\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tsyakkin *= 1.05;\n\t\t\t\tsyakkin += 999;\n\t\t\t\tsyakkin /= 1000;\n\t\t\t\tsyakkin *= 1000;\n\t\t\t\t\n\t\t\t}\n\t\t\tSystem.out.println(syakkin);\n\t\t}\n\t}\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n\t\n\tint n;\n\tcin>>n;\n\tint mny=100000;\n\t\n\tfor(int i=0;i<n;i++){\n\t\tmny*=1.05;\n\t\tmny+=999;\n\t\tmny/=1000;\n\t\tmny*=1000;\n\t}\n\t\n\tcout<<mny<<endl;\n\t\n\treturn 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tdouble n = sc.nextInt();\n\t\tdouble gp = 100000.0;\n\n\t\tfor (int i = 0; i < (int) n; i++) {\n\t\t\tgp += gp * 0.05;\n\t\t\tgp = (Math.ceil(gp / 1000)) * 1000;\n\t\t}\n\n\n\t\tSystem.out.println((int) gp);\n\n\t}\n\n}", "a = 100000;\nn = int(input())\nwhile n > 0:\n\tn -= 1\n\ta = a + (a * 5) // 100\n\ta = ((a - 1) // 1000 + 1) * 1000 \nprint(a)\n", "n = int(input())\nS = 100000\nfor i in range(n) :\n S *= 1.05\n if S % 1000!= 0 :\n S = (int(S/1000)+1)*1000\nprint(S)\n", "#include<stdio.h>\nint main(void){\n\tint i;\n\t\n\t\n\tint n;\n\tscanf(\"%d\",&n);\n\t\n\tint d=100000;\n\t\n\tfor(i=0;i<n;i++){\n\t\td+=d/20;\n\t\t\n\t\tif(d%1000!=0){\n\t\t\td=d/1000*1000+1000;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\\n\",d);\n\t\n\treturn 0;\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\t\n\t\tint ans = 100000;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tans += ans / 20;\n\t\t\tif(ans % 1000 != 0){\n\t\t\t\tans = ans / 1000 * 1000 + 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tint m = 100000;\n\t\t\n\t\tfor(int i=0;i<n;i++){\n\t\t\tm = (int)(m * 1.05);\n\t\t\tif(m%1000!=0){\n\t\t\t\tm = (m/1000)*1000+1000;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(m);\n\t}\n}", "# coding: utf-8\n\nimport math\n\nn = int(raw_input())\n\nans = 100000\nfor i in range(n):\n\tans = ans * 1.05\n\tq = math.ceil(ans / 1000)\n\tans = q * 1000\nprint int(ans)", "import math\nn = int(input())\ndebt = 100000\nfor i in range(n):\n debt *= 1.05\n debt = math.ceil(debt/1000)*1000\nprint(debt)", "#include<cstdio>\nusing namespace std;\nint main(void)\n{\n\tint n,risi,gou,i,x;\n\tscanf(\"%d\",&n);\n\tx=100000;\n\tfor(i=0;i<n;i++){\n\t\tx=x*1.05;\n\t\tif(x%1000!=0){\n\t\t\tx=x+1000-(x%1000);\n\t\t}\n\t}\n\tprintf(\"%d\\n\",x);\n\treturn 0;\n}", "import math\nprice = 100000.0\nn = int(raw_input())\nfor i in range(n):\n price = math.ceil((price * 1.05) / 1000) * 1000\nprint int(price)\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] a){\n\t\tlong debt = 100000;\n\t\tScanner scn = new Scanner(System.in);\n\t\tint n = scn.nextInt();\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tdebt *= 1.05f;\n\t\t\tif(debt % 1000 != 0){\n\t\t\t\tdebt = (debt/1000 + 1) * 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n}", "#include <stdio.h>\n#include <math.h>\n\nint n,i;\ndouble debt=100;\nint main(){\n\tscanf(\"%d\",&n);\n\tfor(i=0;i<n;i++){\n\tdebt*=1.05;\n\tdebt=ceil(debt);\n\t}\n\tprintf(\"%.0f\\n\",debt*1000);\n}", "import java.util.Scanner;\n\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\t\n\tvoid run(){\n\t\tint w = sc.nextInt();\n\t\tint p = 100000;\n\t\tfor(int i = 0; i < w; i++){\n\t\t\tif((p*1.05)%1000 > 0){\n\t\t\t\tp = ((int)(p * 1.05)/1000+1)*1000;\n\t\t\t}else{\n\t\t\t\tp = (int)(p * 1.05);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(p);\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tint yen = 100000;\n\t\tint m;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tsc.close();\n\t\t\n\t\tfor(int i=0; i<n; i++){\n\t\t\t//利子計算\n\t\t\tyen *= 1.05;\n\t\t\t//金額を文字列に変換\n\t\t\tString s = Integer.toString(yen);\n\t\t\t//後ろ三桁を抜き出してint型に変換\n\t\t\tm\t=\tInteger.parseInt(s.substring(s.length()-3));\n\t\t\t//ゼロでなかったら切り上げ\n\t\t\tif(m!=0){\n\t\t\t\tyen += 1000-m;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(yen);\n\t}\n}", "import java.util.Scanner;\n\n//Debt Hell\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = 100000;\n\t\twhile(n--!=0){\n\t\t\ta+=a/20;\n\t\t\tint r=a%1000;\n\t\t\tif(r!=0)a+=1000-r;\n\t\t}\n\t\tSystem.out.println(a);\n\t}\n}", "#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\nint main(){\nint n;\nlong long int x=100000;\ncin>>n;\n\nfor (int i=0;i<n;i++){\n\tx*=1.05;\n\tx=ceil((double)x/1000)*(1000);\n}\ncout<<x<<endl;\n}", "#include<iostream>\n\nint main(){\n long int n,M;\n\n M = 100000;\n\n std::cin >> n;\n\n for(int i=0;i<n;i++){\n M = M * 1.05;\n if(M%1000!=0){\n M = M - (M%1000) + 1000;\n }\n }\n std::cout << M << std::endl;\n}", "from math import ceil\n\nn = int(input())\ndebt = 100\nfor i in range(n):\n debt = ceil(debt * 1.05)\n\nprint(debt * 1000)", "#include\"iostream\"\nusing namespace std;\n\n\nint main(){\n\tint a=100000;\n\tint b;\n\tcin>>b;\n\tfor(int i=0;i<b;i++){\n\ta+=int(a*0.05);\n\tif(!(a%1000==0)){\n\ta/=1000;\n\ta++;\n\ta*=1000;\n\t}\n\t}\n\tcout << a<< endl;\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int weeks = s.nextInt();\n double debt = 100;\n while(weeks>0){\n debt = debt*1.05;\n debt = (int)Math.ceil(debt);\n weeks--;\n }\n System.out.println((int)debt*1000);\n }\n}", "#include <iostream>\n\nusing namespace std;\n\nint main() {\n\tint n, money = 100000;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tmoney += int((double)money * 0.05 / 1000 + 0.999) * 1000;\n\t}\n\tcout << money << endl;\n\treturn 0;\n}", "import math\nn = input()\nm = 100\nfor i in xrange(n):\n m = m * 1.05\n m = math.ceil(m)\nprint \"%i\"%(m*1000)", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n\tint sum=100000,add,k;\n\tScanner s = new Scanner(System.in);\n\n\tk=s.nextInt();\n\tfor(int i=0;i<k;i++){\n\t sum*=1.05;\n\t if( (add=sum%1000)>0 ){\n\t\tsum=sum-add+1000;\n\t }\n\t}\n\n\tSystem.out.println( sum );\n\n }\n}", "import math\nn=int(input())\nx=100000\nfor i in range(n):\n x*=1.05\n x=math.ceil(x)\n if x%1000:\n x=x-(x%1000)+1000\nprint(x)\n \n", "import java.util.*;class Main{public static void main(String[]a){System.out.println(f(new Scanner(System.in).nextInt())*1000);}static int f(int n){return n<1?100:(int)Math.ceil(f(n-1)*1.05);}}", "#include<iostream>\n\nusing namespace std;\n\nlong long HELL(int n){\n\tif(n==0){return 100000;}\n\treturn ((HELL(n-1)*21/20+999)/1000)*1000;\n}\n\nint main(){\n\tint n;\n\tcin>>n;\n\tcout<<HELL(n)<<endl;\n\n\treturn 0;\n}", "#include <cstdio>\n#include <cmath>\n\nint main(){\n int a=100000,n;\n scanf(\"%d\",&n);\n \n while(n--){\n int b=a/20;\n a+=b-b%1000;\n if(b%1000!=0)\n a+=1000;\n }\n\n printf(\"%d\\n\",a);\n}", "def debt(x):\n\tnx = x * 105 / 100\n\tha = nx % 1000\n\tnx -= ha\n\tif ha != 0:\n\t\tnx += 1000\n\t\n\treturn nx\n\nn = int(raw_input())\nx = 100000\n\nfor i in range(0, n):\n\tx = debt(x)\n\nprint x", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n,a=100000;\n\twhile(cin>>n){\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tint b=a*0.05;\n\t\t\tif(b%1000)\n\t\t\t\tb=(b/1000+1)*1000;\n\t\t\ta+=b;\n\t\t}\n\t\tcout<<a<<endl;\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\t\tpublic static void main(String args[]) {\n\t\t\tScanner in = new Scanner(System.in);\n\t\t\tint inputNum = in.nextInt();\n\t\t\tSystem.out.println(getNowShakkin(inputNum));\n\t\t}\n\n\t\tpublic static int getNowShakkin(int weekInterval) {\n\t\t\tdouble result = 100;\n\n\t\t\tfor (int i = 0; i < weekInterval; i++) {\n\t\t\t\tresult = result + result * 0.05;\n\t\t\t\tresult = (Math.ceil((double) result));\n\t\t\t}\n\n\t\t\treturn (int)result * 1000;\n\t\t}\n\t}", "rishi=0.05\ndebt= 100000\nweek = int(raw_input())\nkiriage = 1000\n\ndef ceil(src, range):\n return((int)(src / range) + 1) * range\n\nfor i in range(0,week):\n if debt * 1.05 % kiriage !=0:\n debt = ceil(debt * (1+rishi), kiriage)\n #print debt\n else:\n debt = debt * (1+rishi)\n #print debt\n\nprint debt", "price = 100000\nn = input()\nfor i in range(n):\n\tprice = price * 105 / 100\n\tif price % 1000 != 0:\n\t\tprice -= (price % 1000)\n\t\tprice += 1000\nprint price", "import math\n\nn=int(input())\ndebt=100000\nfor i in range(n):\n debt=math.ceil((debt*1.05)/1000)*1000\nprint(int(debt))", "a = 100000;\nn = int(input())\nwhile n > 0:\n\tn -= 1\n\ta = 105*a//100\n\ta = ((a - 1) // 1000 + 1) * 1000\nprint(a)\n", "import java.math.BigDecimal;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tdouble money = 100000;\n\t\tint moneyNew = 0;\n\t\tint n = new java.util.Scanner(System.in).nextInt();\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmoney = money + money * 0.05;\n\t\t\tBigDecimal bd = new BigDecimal(money);\n\t\t\tBigDecimal bd2 = bd.setScale(-3, BigDecimal.ROUND_UP);\n\t\t\tmoney = +bd2.intValue();\n\t\t}\n\n\t\tSystem.out.println((int) money);\n\n\t}\n\n}", "#include <iostream>\n#include <math.h>\n\nusing namespace std;\n\n\nint main()\n{\n\tint i,n;\n\tcin >> n;\n\t\n\tint gaku = 100;\n\n\tfor( i = 0; i < n; i++ ) {\n\t\tgaku = ceil(gaku * 1.05);\n\t}\n\t\n\tcout << gaku * 1000 << endl;\n\treturn 0;\n}", "#include <iostream>\n\nint main() {\n int debt = 100000;\n int weeks; std::cin >> weeks;\n for(int i=0; i<weeks; i++) {\n debt = debt*1.05; \n debt = (debt+999)/1000*1000;\n } \n std::cout << debt << std::endl; \n}", "n=int(input())\na=100000\ni=0\nwhile i<n:\n a=(a/100)*105\n if a%1000!=0:\n a+=(1000-a%1000)\n i+=1\nprint(int(a))\n", "debt = 100000\nfor i in range(int(input())):\n debt *= 1.05\n if debt % 1000 > 0:\n debt = int(debt/1000)*1000+1000\nprint(debt)", "from math import ceil\nn = int(input())\nd = 100000\nc = 1000\nfor i in range(n):\n d *= 1.05\n d =int(ceil(d/c))*c\nprint(d)", "n=int(input())\na=100000\nfor i in range(n):\n a*=1.05\n if a%1000 !=0:\n a=(a//1000)*1000+1000\nprint(int(a))\n", "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\n\n\npublic class Main {\n\t\n\tScanner sc = new Scanner(System.in);\n\t\n\tvoid run() {\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint b = 100;\n\t\t\n\t\tfor (int i=0;i<n;i++) {\n\t\t\t\n\t\t\tif ( (double)(b*0.05) - (int)(b*0.05) > 0 )\n\t\t\t\tb = (int)( b * 1.05 ) + 1;\n\t\t\telse \n\t\t\t\tb = (int)( b * 1.05 );\n\t\t\t\n\t\t}\n\t\t\n\t\tSystem.out.println(b*1000);\n\t\t\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\t\n\t\tnew Main().run();\n\t\t\n\t}\n\t\n}", "import math\nn = input()\nm = 100000\nfor i in range(n):\n m *= 1.05\n m = math.ceil(m/1000)*1000\nprint int(m)", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile (sc.hasNext()) {\n\t\t\tint n = sc.nextInt();\n\t\t\tdouble debt = 100000;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tdebt *= 1.05;\n\t\t\t\tdebt = Math.ceil(debt/1000) * 1000;\n\t\t\t}\n\t\t\tSystem.out.println((int)debt);\n\t\t}\n\t}\n}", "#include<iostream>\n#include<math.h>\n\nusing namespace std;\n\nint main(void) {\n\tint src = 100;\n\tint a;\n\tcin >> a;\n\t\n\tfor(int i=0; i<a; i++) {\n\t\tsrc = ceil(src*1.05);\n\t}\n\t\n\tcout << src * 1000 << endl;\n\t\n\treturn 0;\n}", "import math\nn = int(input())\ns = 100000\nr = 0.05\nwhile n > 0:\n s += math.ceil((s * r) / 1000) * 1000\n n -= 1\nprint(s)", "import java.util.Scanner;\n\nclass Main {\n\n public static void main(String[] args) {\n new Main().compute();\n }\n\n void compute() {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 100000;\n for (int i = 0; i < n; i++) {\n ans *= 1.05;\n if (ans % 1000 != 0) {\n ans = ans - ans % 1000 + 1000;\n }\n }\n System.out.println(ans);\n }\n}\n", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tdouble money = 100000;\n\t\tfinal int c = 1000;\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\t\n\t\tfor(int i = 1; i <= n; i++) {\n\t\t\tmoney = money + money * 0.05;\n\t\t\tmoney = Math.ceil(money / c) * c; \n\t\t}\n\t\tSystem.out.println((int)money);\n\t\t\n\t}\t\n}", "import math\na=int(input())\nx=100\nfor _ in range(a):\n x*=1.05\n x=math.ceil(x)\n\nprint(x*1000)\n", "#include <stdio.h>\n\nint main(void)\n{\n\tint n,m;\n\t\n\tm=100000;\n\tscanf(\"%d\",&n);\n\t\n\twhile(n>0)\n\t{\n\t\tm=(m*105)/100;\n\t\tif(m%1000>0)\n\t\t{\n\t\t\tm=((m/1000)+1)*1000;\n\t\t}\n\t\tn--;\n\t}\n\t\n\tprintf(\"%d\\n\",m);\n\treturn 0;\n}", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint week = sc.nextInt();\n\t\tdouble debt = 100000;\n\t\tfor(int i = 0 ; i < week ; i++){\n\t\t\tdebt = debt * 1.05;\n\t\t\tdouble a = debt/1000;\n\t\t\ta = Math.ceil(a);\n\t\t\tdebt = a * 1000;\n\t\t}\n\n\t\tSystem.out.printf(\"%.0f\",debt);\nSystem.out.println();\n\t\tsc.close();\n\t}\n\n}", "#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n\tint n, debt=100000;\n\n\tcin >> n;\n\tfor(int i=0; i<n; i++) {\n\t\tdebt*=1.05;\n\t\tif(debt%1000!=0)\n\t\t\tdebt+=1000-(debt%1000);\n\t}\n\tcout << debt << endl;\n\n\treturn 0;\n\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint years;\n\t\tint money=100000;\n\t\tScanner scanner = new Scanner(System.in);\n\t\tyears = scanner.nextInt();\n\t\t\n\t\tfor(int i=0; i<years; i++){\n\t\t\tmoney *= 1.05;\n\t\t\tif(money % 1000 != 0){\n\t\t\t\tmoney = money / 1000;\n\t\t\t\tmoney = money * 1000;\n\t\t\t\tmoney += 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(money);\n\t}\n\n}", "import math\nn = int(input())\nmoney = 100000\nfor i in range(n):\n money = math.ceil((money * 1.05) / 1000)*1000\nprint(money)\n", "n=int(input())\na=100000\nfor i in range(n):\n a*=1.05\n if a%1000>0:\n a=a//1000*1000+1000\nprint(int(a))\n", "#include<iostream>\nusing namespace std;\n\nint main(){\nint n,M,m;\nM=100;\ncin>>n;\nfor(int i=0;i<n;i++){\nm=(M+19)/20;\nM+=m;\n}\ncout<<M*1000<<endl;\n}", "import java.util.Scanner;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tdouble n = sc.nextInt();\n\t\tdouble x = 100;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tx = Math.ceil(x + (x * 0.05));\n\t\t}\n\t\tSystem.out.println((int)x * 1000);\n\t}\n}", "N = int(input())\na = 100000\nfor _ in range(N):\n a *= 1.05\n if a%1000:\n a -= a%1000\n a += 1000\nprint(int(a))\n", "import math\n\nn = int(input())\nans = 100000\nfor i in range(n):\n ans += ans * 0.05\n ans = int(math.ceil(ans / 1000) * 1000)\nprint(ans)", "#include <iostream>\nusing namespace std;\nint main(){\n int n,m=1e5;\n for(cin>>n;n>0;n--)\n m = (m*105/100+999)/1000*1000;\n cout << m << endl;\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main \n{\n\tpublic static void main(String arg[])\n\t{\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint de = 100000;\n\n\t\tfor(int i=0; i<n; i++)\n\t\t{\n\t\t\tde = de / 100;\n\t\t\tde = de * 105;\n\t\t\tif(de%1000 != 0)\n\t\t\t\tde += 1000;\n\t\t\tde = de/1000;\n\t\t\tde = de*1000; \n\t\t}\n\t\tSystem.out.println(de);\n\t}\n\n}", "import java.text.DecimalFormat;\nimport java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tDecimalFormat df = new DecimalFormat(\"0\");\n\t\tdouble debt = 100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tdebt = debt + (debt * 0.05);\n\t\t\tif(debt % 1000 != 0){\n\t\t\t\tdebt = (debt / 1000 + 1) * 1000;\n\t\t\t\tdebt = debt - debt % 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(df.format(debt));\n\t}\n\n}", "#include <iostream>\nusing namespace std;\nint main(){\n int n;\n cin >> n;\n long long m = 100000;\n while(n--){\n m *= 1.05;\n m = ((long long)m/1000+(m%1000?1:0))*1000;\n }\n cout << m << endl;\n return 0;\n}", "import math\nn=int(input())\nans=100000\nfor i in range(n):\n\tans*=1.05\n\tans=int(math.ceil(ans/1000)*1000)\nprint(ans)\n\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n int n,ans=100000;\n cin>>n;\n while(n--){\n ans*=1.05;\n if(ans%1000>0){\n ans/=1000;\n ans*=1000;\n ans+=1000;\n }\n }\n cout<<ans<<endl;\n}", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int debt = 100000;\n\n for(int i=0;i<n;i++){\n debt += debt*0.05;\n if(debt%1000!=0){ debt = debt/1000*1000+1000; }\n }\n System.out.println(debt);\n }\n}\n", "#include <iostream>\nusing namespace std;\nint main()\n{\n\tint n;\n\tint i;\n\tint a=100000;\n\tcin >> n;\n\tfor (i = 0; i < n; i++)\n\t{\n\t\ta = a*1.05;\n\t\tif (a % 1000 != 0)\n\t\t{\n\t\t\ta = a + 1000 - a % 1000;\n\t\t}\n\t}\n\n\tcout << a << endl;\n}\n", "a=10**5;b=1000\nfor i in range(input()):\n a*=1.05\n if a%b>0: a=a-a%b+b\nprint int(a)", "import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n double base = 100;\n double now = base;\n for(int i=0; i<n; i++){\n now = now*0.05+now;\n now=Math.ceil(now);\n }\n System.out.println((int)now*1000);\n }\n}\n", "import java.util.Scanner;\nimport java.math.BigDecimal;\nimport java.math.RoundingMode;\n\npublic class Main {\n public static void main(String args[]) {\n int debt = 100000;\n int nWeeks = Integer.parseInt(new Scanner(System.in).next());\n for(int i = 0; i < nWeeks; i++) {\n debt = new BigDecimal(debt * 1.05).setScale(-3, RoundingMode.CEILING).intValue();\n }\n System.out.println(debt);\n\n }\n} ", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint n;\n\tint ans=100000;\n\tcin>>n;\n\tfor(int i=0;i<n;++i){\n\t\tans=ans*1.05;\n\t\tif(ans%1000>0) ans=ans-ans%1000+1000;\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args) { \n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint money = 100;\n\t\tfor(int i=0;i<n;i++)\n\t\t\tmoney=(int) Math.ceil(money*1.05);\t\n\t\tSystem.out.println(money*1000);\n\t}\n}", "#include <iostream>\nusing namespace std;\n\nint main() {\n\t// your code goes here\n\tint n=100000,money;\n\tcin >> money;\n\tfor(int i=0;i<money;i++){\n\t\tn*=1.05;\n\t\tn+=999;\n\t\tn-=n%1000;\n\t}\n\tcout << n << endl;\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint n,debt = 100000;\n\tcin >>n;\n\tfor(int i=0; i<n; i++){\n\t\tdebt *=1.05;\n\t\tint k = debt/1000*1000;\n\t\tif(debt != k){debt = k+1000;}\n\t}\n\tcout <<debt<<endl;\n\treturn 0;\n}", "import math\nn=input()\nm=10**2\nfor i in range(n):\n m=m*1.05\n m=math.ceil(m)\nprint int(m*(10**3))", "import math\nr = 100000\nfor i in range(int(input())): r = math.ceil(r*1.05/1000)*1000\nprint(r)\n", "#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(void){\n\tint n;\n\tint debt = 100;\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tdebt = ceil(debt*1.05);\n\t}\n\tcout << debt*1000 << endl;\n\treturn 0;\n}", "D = 100000\nN = int(raw_input())\nfor i in xrange(N):\n D += D/20\n if D % 1000 > 0:\n D += 1000-D%1000\nprint D", "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n\n System.out.println(calcDebt(n));\n }\n\n static int calcDebt(int a) {\n int debt = 100000;\n\n for (int i = 0; i < a; i++) {\n debt *= 1.05;\n debt = (int)Math.ceil((debt / 1000.0)) * 1000;\n }\n\n return debt;\n }\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\nint n,ans,a;\ncin>>n;\nans=100000;\nfor(int i=0;i<n;i++){\nans*=1.05;\na=ans%1000;\nif(a!=0){\nans=ans-a+1000;}}\ncout<<ans<<endl;}", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tdouble debt=100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tdebt=debt+debt*0.05;\n\t\t\tdebt=Math.ceil(debt/1000)*1000;\n\t\t}\n\t\tSystem.out.println((int)debt);\n\t}\n}", "import java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint N = scanner.nextInt();\n\t\tint Debt = 100000;\n\t\tDebt= ratecal(N,Debt);\n\t\tSystem.out.println(Debt);\n\t}\n\n\tpublic static int ratecal(int N, int Debt ){\n\t\t\n\t\twhile(N > 0){\n\t\t\tDebt = (int)(Debt * 1.05);\n\t\t\tif(Debt % 1000 > 0 ){\n\t\t\t\tDebt = ((Debt/1000) + 1) * 1000;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tDebt = (Debt/1000) * 1000;\n\t\t\t}\n\t\t\tN--;\n\t\t}\n\t\t\n\t\treturn Debt;\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n double debt = 100000;\n for (int i = 1; i <= n; i++) {\n debt = (debt * 1.05) / 1000;\n debt = Math.ceil(debt) * 1000;\n }\n System.out.println((int)debt);\n }\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int n,ans=100000;\n cin >> n;\n for(int i=0;i<n;i++){\n ans *= 1.05;\n if(ans%1000!=0) ans += (1000-ans%1000);\n }\n cout << ans << endl;\n return 0;\n}", "import java.util.Scanner;\nimport java.util.Date;\n\nclass Main{\n public static void main(String[] args){\n\tScanner sc = new Scanner(System.in);\n\n\tint debt=100000;\n\tdouble temp;\n\n\tint n=sc.nextInt();\n\t\n \tfor(int i=0;i<n;i++){\n\t temp=debt*1.05;\n\t if(temp%1000>0){\n\t\ttemp=temp-temp%1000+1000;\n\t }\n\t debt=(int)temp;\n \t}\n\tSystem.out.println(debt);\n }\n}", "n = int(input())\nx = 100000\n\nfor i in range(n):\n x = int(x * 1.05)\n if(x % 1000 != 0):\n x = x/1000 + 1\n x = x * 1000\n\nprint x", "import math\nn = input()\np = 0\nmoney = 100\nwhile p != n:\n money = math.ceil(money * 1.05)\n p += 1\nprint int(money * 1000)", "from math import ceil\nn = int(input())\n\na = 100\nfor i in range(n):\n a=ceil(1.05 * a)\nprint (a*1000)", "import math\nn=int(input())\n\nm=100000\nk=100000\nfor i in range(n):\n m=1.05*k\n m=m/1000\n k=math.ceil(m)*1000\nprint(k)\n \n\n", "n=int(input())\nA=100000\nfor i in range(n):\n A=A*1.05\n if (A%1000!=0):\n A=(A-A%1000)+1000\nprint(int(A))\n\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint money;\n\t\tint n;\n\n\t\tn = sc.nextInt();\n\t\tmoney = 100000;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmoney *= 1.05;\n\t\t\tmoney = (money % 1000 == 0) ? money : money - money % 1000 + 1000;\n\t\t}\n\t\tSystem.out.println(money);\n\t}\n}", "import math\nn = int(raw_input())\nmoney = 100000\nfor i in range(n):\n\tmoney *= 1.05\n\tmoney = math.ceil(money/1000) * 1000\nprint int(money)", "#include <iostream>\n\nint main(){\n\tint n,debt=100000;\n\tstd::cin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tdebt*=1.05;\n\t\tdebt=debt%1000 ? debt/1000*1000+1000 : debt;\n\t}\n\tstd::cout<<debt<<'\\n';\n\treturn 0;\n}", "#include<iostream>\nint main(){\n\tint a,b,i,n;\n\ta=100000;\n\tstd::cin>>n;\n\tfor(i=0;i<n;i++){\n\t\ta=a*1.05;\n\t\tb=a;\n\t\tif(a%1000!=0){\n\t\t\tb=a-a%1000;\n\t\t\ta=b+1000;\n\t\t\t}\n\t\t}\n\tstd::cout<<a<<std::endl;\n\n return 0;\n}", "import math\n\nPAR = 0.05\n\nsum = 100000\nfor i in range(int(input())):\n sum += math.ceil(sum * PAR / 1000) * 1000\nprint(sum)\n\n", "import math\nres = 100\nN = int(input())\nfor i in range(N):\n res = math.ceil(res * 1.05)\nprint(\"%d000\" % res)\n\n", "n = int(input())\nm = 100000\n\nfor i in range(n):\n m = 1.05 * m\n r = m % 1000\n if r > 0:\n m = (m // 1000 + 1) * 1000\n\nprint(int(m))", "import math\nn = int(input())\ndebt = 100000\nfor i in range(n):\n debt += debt/20\n debt = math.ceil(debt/1000)*1000\nprint(debt)\n", "N = input()\nmoney = 100000\nfor i in range(N):\n money = int(money *1.05)\n if money % 1000 != 0:\n money = (money // 1000 + 1) * 1000\nprint money", " import java.util.Scanner; \n \n \n public class Main { \n \tpublic static void main(String[] args) { \n \t\tScanner scn = new Scanner(System.in); \n \tint n = scn.nextInt(); \n\t\tint debt = 100; \n \t\tfor (int i = 0; i < n; i++) { \n \t\t\tdebt = (int)Math.ceil(debt * 1.05); \n\t\t} \n\t\tSystem.out.println(debt * 1000); \n \t} \n} ", "money=100000\nn=int(input())\nfor day in range(n):\n money+=money*0.05\n money=-(-money//1000)*1000\nprint(int(money))\n", "#include<iostream>\n#include<cmath>\nint main()\n{\n int n;\n std::cin>>n;\n int i;\n int sum=100;\n for(i=0;i<n;i++)\n {\n sum+=std::ceil(sum*0.05);\n }\n std::cout<<sum*1000<<std::endl;\n\n return 0;\n}", "n=int(input())\nS=100000\nfor i in range(n):\n S = S*1.05\n R = S%1000\n if R:\n S = S-R+1000\nprint(int(S))\n", "import math\na=100\nn=int(input())\nfor i in range(n):\n a*=1.05\n a=math.ceil(a)\nprint(a*1000)\n", "n = input()\nmoney = 100000\nfor i in range(n):\n money = int(money * 1.05)\n if money != money / 1000 * 1000:\n money = money / 1000 * 1000 + 1000\nprint money", "# -*-coding:utf-8\n#???????¨????\n\nimport math\n\ndef main():\n\n debtTime = int(input())\n\n ans = int(culcDebt(debtTime))\n\n print(ans)\n\ndef culcDebt(t):\n debt = 100000\n for i in range(t):\n debt = debt * 1.05\n debt = 1000 * math.ceil(debt/1000)\n\n return debt\n\n\nif __name__ == '__main__':\n main()", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin >> n;\n\tint c = 100;\n\tfor(int i=0; i<n; i++){\n\t\tc = (c*105+99)/100;\n\t}\n\tcout << c*1000 << endl;\n\treturn 0;\n}", "import math\n\nn = int(raw_input())\nr = 100000\nfor i in range(n):\n r *= 1.05\n r = math.ceil(r/1000) * 1000\nprint int(r)", "import math\n\ns=int(input())\nt=100\n\nfor i in range(0,s):\n t=math.ceil(t*1.05)\nprint(1000*t)\n", "#include <iostream>\n\nint main()\n{\n\tint debt = 100000;\n\tint n;\n\tstd::cin >> n;\n\tfor (int i = 0; i < n; ++i) {\n\t\tdebt = int((debt * 1.05 + 999) / 1000) * 1000;\n\t}\n\tstd::cout << debt << std::endl;\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint result = 100000;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tresult+=result * 0.05;\n\t\t\tresult = (int)Math.ceil((double)result / 1000) * 1000;\n\t\t}\n\t\t\n\t\tSystem.out.println(result);\n\t}\n}", "import math\nloan = 100000\nn = int(input())\nfor i in range(n):\n interest = math.ceil(loan * 0.05 / 1000) * 1000\n loan += interest\nprint(loan)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\t\tint n = sc.nextInt();\n\t\t\tlong amount = 100000;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tamount *= 1.05;\n\t\t\t\tamount += 999;\n\t\t\t\tamount /= 1000;\n\t\t\t\tamount *= 1000;\n\t\t\t}\n\t\t\tSystem.out.println(amount);\n\t\t}\n\t}\n}", "import java.io.*;\nclass Main{\n public static void main(String[] args)throws IOException{\n\tBufferedReader br=\n\t new BufferedReader(new InputStreamReader(System.in));\n\tString buf;\n\tbuf=br.readLine();\n\tint n=Integer.parseInt(buf);\n\tint money=100000;\n\tfor(int i=1;i<=n;i++){\n\t money*=1.05;\n\t if(money%1000>0){\n\t\tmoney/=1000;\n\t\tmoney++;\n\t }else{\n\t\tmoney/=1000;\n\t }\n\t money*=1000;\n\t}\n\tSystem.out.println(money);\n }\n}", "import math\n\nn = int(input())\nresult = 100\nfor i in range(n):\n result = math.ceil(result*1.05)\nprint(result*1000)\n\n", "import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\t@SuppressWarnings({\"resource\" })\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i = sc.nextInt();\n\t\tint debt = 100000;\n\t\tfor(int j=0;j<i;j++){\n\t\t\tdebt = f_debt(debt);\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n\n\tprivate static int f_debt(int n){\n\t\tn = (int)(n * 1.05);\n\t\tif(n % 1000 != 0){\n\t\t\tn = n - (n%1000) + 1000;\n\t\t}\n\t\treturn n;\n\t}\n}", "#include<iostream>\n\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tint ans=100000;\n\tfor(int i=0;i<n;i++){\n\tans+=ans*5/100;\n\tif(ans%1000)ans+=(1000-ans%1000);\n\t}\n\t\n\t\n\tcout<<ans<<endl;\n}", "import java.util.Scanner;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner cin = new Scanner(System.in);\n\t\t\n\t\tint m = 100000;\n\t\tint n = cin.nextInt();\n\t\tfor(int i=0; i<n; i++)\n\t\t{\n\t\t\tm *= 1.05;\n\t\t\tm = (m+999)/1000*1000;\n\t\t}\n\t\t\n\t\tSystem.out.println(m);\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n public static void main (String args[]) {\n\tScanner scan = new Scanner(System.in);\n\tint n = scan.nextInt();\n\tdouble debt = 100; //100,000 / 1,000\n\tdouble interest = 0;\n\n\tfor (int i=0; i<n; i++) {\n\t interest = debt * 0.05;\n\t debt += interest;\n\t debt = Math.ceil(debt);\n\t}\n\n\tSystem.out.printf(\"%.0f\\n\", (debt*1000));\n }\n}", "import math\nwhile True:\n try:\n n=input()\n x=100000\n for i in xrange(n):\n x=math.ceil(x*1.05/1000)*1000\n print(int(x))\n except EOFError: break", "import java.util.Scanner;\nimport java.math.BigDecimal;\n\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tnew Main().run();\n\t}\n\t\n\tvoid run(){\n\t\tdouble loan = 100000;\n\t\tBigDecimal bd;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tfor(int i=0; i < a; i++){\n\t\t\tbd = new BigDecimal(loan * 1.05);\n\t\t\tBigDecimal bdup = bd.setScale(-3, BigDecimal.ROUND_UP);\n\t\t\tloan = bdup.doubleValue();\n\t\t}\n\t\tSystem.out.println((int)loan);\n\t}\n}", "print(lambda f,n:f(f,n))(lambda f,n:n==0 and 100000 or(lambda x:x%1000>0 and x-x%1000+1000 or x)(f(f,n-1)*105/100),int(raw_input()))", "#include <stdio.h>\nint main()\n{\n int i,w;\n long long debt=100000;\n scanf(\"%d\",&w);\n for(i=0;i<w;i++){\n debt*=1.05;\n if(debt%1000!=0)debt=debt+1000-debt%1000;\n }\n printf(\"%lld\\n\",debt);\n return 0;\n}", "#include <iostream>\n#include <cmath>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n long c = 100000;\n for (int i = n; i > 0; i--) {\n c = ceil(c * 1.05 / 1000) * 1000;\n }\n cout << c << endl;\n}", "import java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic long calcBalance(long first, int weeks) {\n\t\tif (weeks == 0) { return first;\n\t\t} else {\n\t\t\treturn calcBalance((long)(1000*Math.ceil((first*1.05)/1000.0)), weeks-1);\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tSystem.out.println((new Main()).calcBalance(100000, sc.nextInt()));\n\n\t}\n}", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint n, d=100000;\n\tcin >> n;\n\tfor(int i=0; i<n; i++){\n\t\td *= 1.05;\n\t\tint a = d % 1000;\n\t\tif(a != 0){\n\t\t\td -= a;\n\t\t\td += 1000;\n\t\t}\n\t}\n\tcout << d << endl;\n\treturn 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) {\n double debt = 100000.0;\n int nWeeks = new Scanner(System.in).nextInt();\n for(int i = 0; i < nWeeks; i++) {\n debt = ((int)(debt * 0.00105 + 0.99)) * 1000.0;\n }\n System.out.println((int)debt);\n\n }\n} ", "import math\na=100\nfor _ in range(int(input())):a=math.ceil(a*1.05)\nprint(a*1000)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int amount=100000;\n for(int i=0;i<n;i++) {\n amount*=1.05;\n amount=amount%1000>0?(amount/1000+1)*1000:amount;\n }\n System.out.println(amount);\n sc.close();\n }\n}\n", "import java.io.*;\n\nclass Main{\n\tpublic static void main(String[] args) throws IOException{\n\t\tBufferedReader r = new BufferedReader(new InputStreamReader(System.in));\n\t\tString s=r.readLine();\n\t\tint n = Integer.parseInt(s);\n\t\tint money=100000;\n\t\ttry {\n\t\t\tfor(;n>0;n--){\n\t\t\t\tmoney*=1.05;\n\t\t\t\tif (money%1000>0){\n\t\t\t\t\tmoney = ((money/1000)+1)*1000;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(money);\n\t\t} catch (Exception err) {\n\t\t\tSystem.exit(0);\n\t\t}\n\t}\n}", "v = 100000\nfor i in range(int(input())):\n v *= 1.05\n if v % 1000 != 0:\n v = v - (v % 1000) + 1000\nprint(int(v))", "#include<iostream>\nint main(){int w,m=100000;for(std::cin>>w;w--;m=(m+999)/1000*1000)m+=m*5/100;std::cout<<m<<'\\n';}\n", "# -*- coding: utf-8 -*-\n\nimport math\n\nPRINCIPAL = 100000\nRATE = 0.05\nABOVE = 1000\n\nn = int(raw_input())\ndebt = PRINCIPAL\nfor i in range(n):\n debt = int(math.ceil(float(debt)*(1+RATE)/ABOVE))*ABOVE\nprint debt", "#include <iostream>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n long long d = 100000;\n for (int i = 0; i < n; ++i) {\n d *= 1.05;\n if (d % 1000) { d += 1000 - d % 1000; }\n }\n cout << d << endl;\n}", "#include <stdio.h>\n\nint main(){\n long debt = 100;\n int n;\n int i;\n scanf(\"%d\",&n);\n for(i=0;i<n;i++){\n debt = (long)(debt*1.05+0.99);\n }\n printf(\"%ld\\n\",debt*1000);\n}", "import math\n\nN=int(input())\na=100000\n\nfor i in range(N):\n b=a/1000\n a=math.ceil(b*1.05)\n a=a*1000\n \nprint(a)\n", "import math\na = 100\nb = int(input())\n\nfor _ in range(b):\n a = math.ceil(a * 1.05)\n\na *= 1000\n\nprint(a)\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n int a,sum=100000,b;\n cin >>a;\n\n for(int i=0;i<a;i++){\n b=sum/20;\n if(b%1000==0)sum+=b;\n else sum+=(b/1000+1)*1000;\n }\n cout <<sum<<endl;\n return 0;\n}", "import java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\nclass Main {\n public static void main (String[] args) throws IOException {\n Scanner sc = new Scanner(System.in);\n\n int weeks = sc.nextInt();\n\n int debt = 100000;\n\n for (int i = 0; i < weeks; i++) {\n debt = (int) Math.ceil((debt * 1.05) / 1000) * 1000;\n }\n\n System.out.println(debt);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println( calc_debt( sc.nextInt() ) );\n\t\tsc.close();\n\t}\n\n\tprivate static long calc_debt(int nextInt) {\n\t\tint n = nextInt;\n\t\tlong d = 100;\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\td = (long)Math.ceil( d * 1.05);\n\t\t\t}\n\t\t\t\n\t\tlong debt = d * 1000;\n\t\treturn debt;\n\t}\n\n}\n", "n=int(input())\na=100000\nwhile n!=0:\n a=a*1.05\n if a%1000!=0:\n a=a-(a%1000)+1000\n \n \n n=n-1\nprint(int (a))\n\n", "#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n,x,e = 100000;\n\tcin >> n;\n\n\tfor(int i=0;i<n;++i){\n\t\te *= 1.05;\n\t\tx = e % 1000;\n\n\t\tif(x != 0){\n\t\t\te += (1000-x);\n\t\t}\n\t}\n\n\tcout << e << endl;\n\n\treturn 0;\n}", "#include<iostream>\n\nusing namespace std;\n\nint main(void){\n int n,a=100000;\n\n cin >> n;\n while(n--){\n a=a*5/100+a;\n if(a%1000){\n a/=1000;\n a=a*1000+1000;\n }\n }\n cout << a << endl;\n\n return 0;\n}", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint x=100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tx=(int) (1.05*x);\n\t\t\tif(x%1000!=0){\n\t\t\t\tx=((x/1000)+1)*1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(x);\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n long debt = 100000;\n for (int i = 0; i < n; i++) {\n debt = (long) (debt * 1.05);\n if (debt % 1000 > 0) {\n debt = (debt / 1000 + 1) * 1000;\n }\n }\n System.out.println(debt);\n }\n}\n\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint a,b,rone=100000;\n\tcin>>a;\n\tfor(int i=0;i<a;i++){\n\t\trone *=1.05;\n\t\tb = rone % 1000;\n\t\trone -= b;\n\t\tif(b>0){b=1000;\n\t\trone += b;\n\t\t}\n\t}\n\tcout<<rone<<endl;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String... args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n\n int money = 100000;\n for (int i = 0; i < n; i++) {\n money *= 1.05;\n if (money % 1000 != 0) {\n money += 1000 - money % 1000;\n }\n }\n\n System.out.println(money);\n }\n}\n", "from math import ceil\n\nyen = 100000\nfor i in range(int(input())):\n yen = ceil((yen*1.05)/1000)*1000\nprint(yen)", "import math\ns=int(input())\nm=100000\nfor i in range(s):\n m=math.ceil((m*1.05)/1000)*1000\n\nprint(m)\n ", "debt=100000\nweek=input()\n\nfor i in range(week):\n debt=debt*1.05\n if debt%1000!=0:\n debt=int(debt/1000)*1000+1000\n\nprint debt", "#include<iostream>\nusing namespace std;\nint main(){\n\tlong long int N,x=100000,y;\n\tcin >> N;\n\tfor(int i=0;i<N;i++){\n\t\tx = x * 105 / 100;\n\t\ty = x/1000;\n\t\tif((x%1000)!=0)\tx = (y+1)*1000;\n\t}\n\tcout << x << endl;\n}", "#include <iostream>\nusing namespace std;\nint main(){\n\tint n,s=100000;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\ts*=1.05;\n\t\tif(s%1000!=0){\n\t\t\ts/=1000;\n\t\t\ts*=1000;\n\t\t\ts+=1000;\n\t\t}\n\t}\n\tcout<<s<<endl;\n\tcin>>n;\n\treturn 0;\n}", "#include <cstdio>\n#include <cmath>\nusing namespace std;\n\nint main(){\n\nint n;\nscanf(\"%d\",&n);\n\nlong debt=100000;\n\nfor(int i=0;i<n;i++)\n\tdebt=(long)(ceil(debt*1.05/1000.0))*1000;\n\nprintf(\"%ld\\n\",debt);\n\nreturn 0;\t\t\n}", "#include<stdio.h>\n\nint main(void){\n\tunsigned int ans=100000,n;\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++){\n\t\tans=(ans*105)/100;\n\t\tans=ans/1000+(ans%1000>0?1:0);\n\t\tans*=1000;\n\t}\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint n,b=100000;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\tb*=1.05;\n\tif(b%1000!=0)b=(b/1000+1)*1000;\n\t}\n\tcout<<b<<endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n\nint main(){\n\tint m=100000,n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tm=m/20*21;\n\t\tm+=(1000-(m-1)%1000)-1;\n\t}\n\tcout<<m<<endl;\n\treturn 0;\n}\n\n", "import math\nn = input()\n\na = 100000\nfor i in range(n):\n a = 1.05 * a\n a /= 1000\n a = int(math.ceil(a) * 1000)\nprint (a)", "import math\nn=int(input())\ni=0\nE=100\nwhile(i<n):\n E=E*1.05\n E=math.ceil(E)\n i=i+1\n\nprint(E*1000)\n", "import java.util.Scanner;\nimport java.math.BigDecimal;\n\npublic class Main {\n public static void main(String args[]) {\n int debt = 100000;\n int nWeeks = Integer.parseInt(new Scanner(System.in).next());\n for(int i = 0; i < nWeeks; i++) {\n debt = new BigDecimal(debt * 1.05).setScale(-3, BigDecimal.ROUND_CEILING).intValue();\n }\n System.out.println(debt);\n\n }\n} ", "import java.util.*;\n\nclass Main {\n public static void main (String[] args) {\n Scanner scanner = new Scanner(System.in);\n double s = 100;\n\n while (scanner.hasNext()) {\n int w = scanner.nextInt();\n for (int ii = 0; ii < w; ii++) {\n s = Math.ceil(s * 1.05);\n }\n System.out.println((int)(s * 1000));\n }\n }\n}", "import math\n\nn = int(input())\ndebt = 100\nfor i in range(n):\n debt = math.ceil(debt * 1.05)\nprint(str(debt * 1000))\n ", "import java.util.*;\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner s=new Scanner(System.in);\n\t\tint N=s.nextInt();\n\t\tint Debt=100000;\n\t\tfor(int i=0;i<N;i++){\n\t\t\tDebt=Debt*105/100;\n\t\t\tif(Debt%1000!=0)Debt=Debt+1000-Debt%1000;\n\t\t}\n\t\tSystem.out.println(Debt);\n\t}\n}", "#include<stdio.h>\n#include<math.h>\nint main(){\nint a,i;\ndouble b=100,d=0,c=0;\nscanf(\"%d\",&a);\nfor(i=0;i<a;i++){\nb*=1.05;\nb+=0.9999;\ndouble c=floor(b);\nb=c;\n}\nprintf(\"%d\\n\",(int)b*1000);\n}", "import math\n\nn = int(input())\nd = 100000\n\nfor i in range(n):\n\td *= 1.05\n\td = math.ceil((d/1000))*1000\nprint(d)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n double tmp = 100000.0;\n\n for (int i = 0; i < n; i++) {\n tmp *= 1.05;\n tmp /= 1000;\n tmp = Math.ceil(tmp);\n tmp *= 1000;\n }\n\n System.out.println((int)tmp);\n }\n}", "a = 100000\nb = 1000\nfor i in range(input()):\n a *= 1.05\n if a % b > 0:\n a = a - a % b + b\nprint int(a)", "#include <cstdio>\nint main() {\n\tint n,debt=100000;\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++) {\n\t\tdebt=debt*1.05;\n\t\tif(debt%1000>0) {\n\t\t\tdebt-=debt%1000;\n\t\t\tdebt+=1000;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",debt);\n}", "import java.util.Scanner;\npublic class Main {\n\n\t//??????????????????????????°\n\tpublic static void main(String[] args) {\n\n\t\tint debt = 100000;\n\t\tint temp = 0;\n\t\tScanner stdin = new Scanner(System.in);\n\t\tint week = stdin.nextInt();\n\n\t\tfor(int i = 0; i < week; i++) {\n\n\t\t\tdebt *= 1.05;\n\n\t\t\tif(debt % 1000 != 0) {\n\n\t\t\t\ttemp = ((debt / 1000) * 1000 + 1000);\n\t\t\t\tdebt = temp;\n\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(debt);\n\n\t}\n\n}", "import java.util.Scanner;\n\npublic class Main {\n\t\tpublic static void main(String args[]) {\n\t\t\tScanner in = new Scanner(System.in);\n\t\t\tint inputNum = in.nextInt();\n\t\t\tSystem.out.println(getNowShakkin(inputNum));\n\t\t}\n\n\t\tpublic static int getNowShakkin(int weekInterval) {\n\t\t\tdouble result = 100;\n\n\t\t\tfor (int i = 0; i < weekInterval; i++) {\n\t\t\t\tresult = result + (result * 0.05);\n\t\t\t\tresult = (Math.ceil((double) result));\n\t\t\t}\n\n\t\t\treturn (int)result * 1000;\n\t\t}\n\t}", "import java.util.Scanner;\n\nclass Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n\n int debt = 100000;\n int weeks = sc.nextInt();\n for (int i = 0; i < weeks; i++) {\n debt = (int)(Math.ceil(debt*1.05 / 1000) * 1000);\n }\n\n System.out.println(debt);\n }\n}", "#include<iostream>\nint main(){\n\tint n,m=100000;\n\tstd::cin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tm+=m/100*5;\n\t\tif(m%1000!=0)m+=1000-m%1000;\n\t}\n\tstd::cout<<m<<std::endl;\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n;\n\tint m = 100000;\n\tcin >> n;\n\n\tfor(int i = 0; i < n; ++i){\n\t\tm = (m*1.05+999)/1000;\n\t\tm = m*1000;\n\t}\n\tcout << m << '\\n';\n\treturn 0;\n}", "n=int(input())\ni=1\ns=100000//1000\nimport math\nwhile i <= n:\n i+=1\n s = s*1.05\n s = math.ceil(s)\n \nprint(s*1000)\n\n", "import java.io.*;\nclass Main\n{\n public static void main(String args[])throws IOException\n {\n\tBufferedReader input=new BufferedReader(new InputStreamReader(System.in));\n\tdouble dept=100000;\n\tint n=Integer.parseInt(input.readLine());\n\tfor(int i=0;i<n;i++)\n\t {\n\t\tdept=dept*1.05;\t\t\t\t\n\t\tif((int)(dept%1000)>0)\n\t {\n\t\tdept=(int)(dept+1000-dept%1000);\n\t }\n\t }\n\t\n\tdept=(int)(dept-dept%1000);\n\tSystem.out.println((int)dept);\n }\n}", "import math\nresult = 100000\nfor i in range(int(input())):\n result *= 1.05\n result = math.ceil(result/1000)*1000\nprint(result)", "#include <cmath>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n int p = 100;\n for(int i=0; i<n; i++){\n p=ceil(p*1.05);\n }\n cout << p*1000 << endl;\n}", "rishi=0.05\ndebt= 100000\nweek = int(raw_input())\nkiriage = 1000\n\ndef ceil(src, range):\n if int(src * (1 + rishi) % range) == 0:\n return src * (1+rishi)\n else:\n return((int)(src*(1+rishi) / range) + 1) * range\n\nfor i in range(0,week):\n debt = ceil(debt, kiriage)\nprint debt", "n = int(input())\ns = 100000\nfor i in range(n):\n s = s * 1.05\n if s % 1000:\n s = int((s // 1000) * 1000 + 1000)\nprint(s)\n", "#include <cstdio>\nint main() {\n\tint n,debt=100000;\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++) {\n\t\tdebt*=1.05;\n\t\tif(debt%1000)debt-=debt%1000,debt+=1000;\n\t}\n\tprintf(\"%d\\n\",debt);\n}", "import java.util.Scanner;\nclass Main{\n\tpublic static void main(String[] a){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint debt = 100000;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tdebt += debt / 20;\n\t\t\tdebt = up(debt);\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n\tstatic int up(int money){\n\t\tmoney += 999;\n\t\tmoney -= money % 1000;\n\t\treturn money;\n\t}\n}", "#include <iostream>\nusing namespace std;\nint main() {\n int n,s=100000;\n cin >> n;\n for ( n;n>0;n--) s=1000*((int)((s*1.05+999)/1000));\n cout << s << endl;\n return 0;\n}", "import math\na=int(input())\nb=100000\nfor i in range(a):\n b=b*1.05\n b=b/1000\n b=math.ceil(b)\n b=b*1000\nprint(b)\n", "debt = 100000\nn = int(input())\nfor i in range(n):\n debt *= 1.05\n if debt%1000 != 0:\n debt = (debt//1000+1)*1000 \n\nprint(int(debt))", "N=1000;print(lambda f,n:f(f,n))(lambda f,n:n==0 and 100*N or(lambda x:x%N>0 and x-x%N+N or x)(f(f,n-1)*105/100),input())", "import math\n\nn = int(input())\ndebt = 100000\nfor _ in range(n):\n debt = debt * 1.05\n debt = math.ceil(debt / 1000) * 1000\nprint(debt)\n\n", "#include<cstdio>\n\nint main(){\n\tint n;\n\tint a = 100;\n\tscanf(\"%d\", &n);\n\tfor(int i = 0; i < n; i++){\n\t\tif(a % 20){\n\t\t\ta = a * 1.05 + 1;\n\t\t}else{\n\t\t\ta *= 1.05;\n\t\t}\n\t}\n\tprintf(\"%d000\\n\", a);\n\treturn 0;\n}", "n = int(input())\nx = 100000\nfor i in range(n):\n x += (x * 0.05 + 999) // 1000 * 1000\nprint(int(x))", "#include <iostream>\nusing namespace std;\nint main(){\n\tint n;cin>>n;\n\tint debt = 100000;\n\tfor(int i=0;i<n;i++){\n\t\tdebt = (int)((debt*1.05+999)/1000)*1000;\n\t}\n\tcout << debt << endl;\n}", "import math\nn=int(input())\na=100000\nfor i in range(n):\n a=math.ceil(1.05*a/1000)*1000\nprint(a)", "import math\nnum = 100\nn = int(input())\nfor i in range(n):\n num = math.ceil(num*1.05)\nprint(num*1000)\n", "n = int(input())\nd = 100000\n\nfor i in range(n):\n d *= 1.05\n if d % 1000:\n d = d - d%1000 + 1000\nprint(int(d))\n", "import java.util.Scanner;\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tint n=scan.nextInt();\n\t\tlong m=100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tm=(long)(1.05*m);\n\t\t\tif(m%1000>0){\n\t\t\t\tm+=1000;\n\t\t\t\tm-=m%1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(m);\n\t}\n\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint n = s.nextInt();\n\t\tint m = 100000;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tm = Double.valueOf(Math.ceil((double) m * 1.05)).intValue();\n\t\t\tint r = m % 1000;\n\t\t\tif (r > 0) {\n\t\t\t\tm += 1000 - r;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(m);\n\t}\n}", "#include <iostream>\nint main(void){\n int n,ans=100000,t;\n std::cin>>n;\n for(int i=0;i<n;i++){\n ans*=1.05;\n t=ans%1000;\n if(t)ans=ans-t+1000;\n }\n std::cout<<ans<<std::endl;\n return 0;\n}", "n = int(input())\nx = 100000\nfor i in range(n):\n x = x * 1.05\n if x % 1000 != 0:\n x=x+1000-(x%1000)\nprint(int(x))\n\n", "import math\n\nn = int(input())\nb = 100\nfor i in range(n):\n b += b * 0.05\n b = math.ceil(b)\nb *= 1000\nprint(\"%d\" % b)", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint debt = 100000;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tdebt += debt / 20;\n\t\t\tint up = 1000 - debt % 1000;\n\t\t\tif (up != 1000) debt += up;\n\t\t}\n\t\tSystem.out.println(debt);\n\t\tsc.close();\n\t}\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tfinal int principal = 100000;\n\t\tfinal float interest = 0.05f;\n\t\tint debtBal = principal;\n\t\t\n\t\tScanner scan = new Scanner(System.in);\n\t\tint week = scan.nextInt();\n\t\t\n\t\tfor(int i = 1; i <= week; i++) {\n\t\t\tdebtBal += debtBal * interest;\n\t\t\tdebtBal = (int)Math.ceil((double)debtBal / 1000);\n\t\t\tdebtBal *= 1000;\n\t\t}\n\t\t\n\t\tSystem.out.println(debtBal);\n\t}\n}", "n=int(input())\nx=100000\nfor i in range(n):\n x=x*1.05\n if x%1000:\n x=x-(x%1000)+1000\nprint(int(x))\n", "#include <iostream>\n#include <cmath>\nusing namespace std;\nint main(){\n int n;\n int ans = 100000;\n cin >> n;\n for(int i = 0; i < n; ++i){\n ans = ceil((ans * 1.05) / 1000.0) * 1000;\n }\n cout << ans << endl;\n}", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int m = 100000;\n int w;\n\n cin >> w;\n\n for(int i=0; i<w; i++){\n m *= 1.05;\n m += 999;\n m /= 1000;\n m *= 1000;\n }\n\n cout << m << '\\n';\n\n return 0;\n}", "#include <stdio.h>\nint main(){\n int n;\n int debt=100000;\n scanf(\"%d\",&n);\n while(n--){\n debt += debt*0.05;\n if(debt%1000!=0){\n debt -= debt%1000;\n debt += 1000;\n }\n }\n printf(\"%d\\n\",debt);\n return 0;\n}", "#!/usr/bin/python\n\nnum = int(raw_input())\nmoney = 100000\n\nfor i in range(num):\n money = int(money * 1.05)\n if money % 1000 == 0:\n continue\n else:\n money = int(money) / 1000 * 1000 + 1000\nprint money", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint debt = 100000;\n\tint n;\n\tcin >> n;\n\n\tfor(int i=0; i<n; ++i)\n\t{\n\t\tint x = debt * 1.05 + 999;\n\t\tdebt = x - x%1000;\n\t}\n\n\tcout << debt << '\\n';\n}", "import math\nn=input()\nn=int(n)\na=100000\nfor i in range(n):\n a=a*1.05\n a=math.ceil(a/1000)*1000\nprint(a) \n", "# -*- coding: utf-8 -*-\nimport math\n\na=100\nb=int(input())\n\nfor i in range(b):\n a=math.ceil(a*1.05)\n\nprint(a*1000)\n", "def kiriage(price):\n i = int(price) / 1000\n r = price % 1000\n if r != 0:\n return 1000 * (i + 1)\n else:\n return 1000 * i\n\nif __name__ == '__main__':\n n = int(raw_input())\n price = 100000\n for i in range(0, n):\n price = kiriage(price * 1.05)\n print price", "a=100\nfor _ in[0]*int(input()):a=int(a*1.05)+(a%20>0)\nprint(a*1000)\n", "#include<iostream>\n\nusing namespace std;\n\nint main(){\nint inNum,i;\nint debt = 100000;\n\ncin>>inNum;\nfor(i = 0; i < inNum; i++){\nif((debt=debt+debt*0.05)%1000==0);\n else{\ndebt/=1000;\ndebt+=1;\ndebt*=1000;\n}\n}\ncout<<debt<<endl;\n}", "import math\n\ndef Interest(money,n):\n for i in range(n):\n money *= 1.05\n money = math.ceil(money)\n return money\n\nm = 100\nn = int(input())\n\nprint int(Interest(m,n)*1000)", "import java.util.*;\npublic class Main{\n static Scanner kbd = new Scanner(System.in);\n public static void main(String[] args){\n\tint n = kbd.nextInt();\n\tint d = 100000;\n\n\twhile(n>0) {\n\t d = (int)(d*1.05);\n\t if(d%1000 != 0){\n\t\td = d/1000;\n\t\td++;\n\t\td = d*1000;\n\t }\n\t n--;\n\t}\n\n\tSystem.out.println(d);\n } \n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n int n = (new Scanner(System.in)).nextInt();\n int sum = 100;\n for(int i = 0; i < n; ++i) {\n sum = (int)Math.ceil(sum * 1.05);\n }\n System.out.println(sum * 1000);\n }\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint a,n,x;\n\ta=100000;\n\tcin >> n;\n\tfor(x=0;x<n;x++){\n\t\ta+=a/20;\n\t\ta+=999;\n\t\ta/=1000;\n\t\ta*=1000;\n\t}\n\tcout << a << endl;\n\treturn 0;\n}", "import math;print([(x.append(y), x) for x in [[100000]] for _ in range(int(input())) for y in [math.ceil(x[-1] * 1.05 / 1000)*1000]][-1][-1][-1])\n", "v = 100000\nfor _ in [0]*int(input()):\n v *= 1.05\n v += 1000 * (v%1000 > 0)\n v -= v%1000\nprint(int(v))", "#include<iostream>\n\nint main(){\n\tint n, ans = 100000;\n\tstd::cin >> n;\n\tfor (int i = 0; i < n; ++i){\n\t\tans *= 1.05;\n\t\t--ans;\n\t\tans += 1000 - (ans % 1000);\n\t}\n\tstd::cout << ans << std::endl;\n\treturn 0;\n}", "class Main\n{\n\tpublic static void main( String[] args )\n\t{\n\t\tjava.util.Scanner sc = new java.util.Scanner( System.in );\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tdouble money = 100000;\n\t\t\n\t\tfor( int i = 0 ; i < n ; i++ ){\n\t\t\tmoney *= ( 1.05 );\n\t\t\tmoney += 999;\n\t\t\tmoney = (int)(money/1000)*1000;\n\t\t}\n\t\tSystem.out.println( (int)money );\n\t}\n}", "n=int(input())\n\nm=100000\n\nfor i in range(n):\n m=m*1.05\n if m%1000==0:\n pass\n else:\n m=m-m%1000+1000\nprint(int(m))\n", "import java.util.*;\n\npublic class Main \n{\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tlong debt = 100000;\n\t\tfor(int i = 0; i < n; ++i)\n\t\t{\n\t\t\tdebt *= 1.05;\n\t\t\tlong lessThanThousand = debt % 1000;\n\t\t\tif(lessThanThousand > 0)\n\t\t\t{\n\t\t\t\tdebt += 1000 - lessThanThousand;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tint period = Integer.parseInt(new BufferedReader(new InputStreamReader(System.in), 128).readLine());\n\t\tint val = 100;//壱百千円\n\t\tfor (; 0 < period; period--) {\n\t\t\tval = (int) Math.ceil(val * 1.05);\n\t\t}\n\t\tSystem.out.println(val * 1000);\n\t}\n}", "import math\n\nn=input()\nmoney = 100000\nfor i in range(n):\n money = math.ceil(money * 1.05/1000)*1000\nprint \"%d\" %(money)", "#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tint money=100;\n\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tmoney=money*1.05+0.999;\n\t}\n\tcout<<money*1000<<endl;\n}", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n\tint n,full=100000;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tfull*=1.05;\n\t\tif(full%1000!=0){\n\t\t\tfull +=1000-(full%1000);\n\t\t}\n\t}\n\tcout<<full<<endl;\n}\n", "'''\nCreated on Mar 11, 2013\n\n@author: wukc\n'''\nimport math\nn=int(raw_input())\n\np=100000\nfor i in range(n): p=int(math.ceil(p*1.05/1000)*1000)\nprint p", "import math\nn=int(input())\nX=100000\nfor i in range(n):\n X=math.ceil(X*1.05/1000)*1000\nprint(X) \n", "import java.util.Scanner;\nimport java.math.BigDecimal;\nimport java.math.RoundingMode;\n\npublic class Main {\n public static void main(String args[]) {\n int debt = 100000;\n int nWeeks = new Scanner(System.in).nextInt();\n for(int i = 0; i < nWeeks; i++) {\n debt = new BigDecimal(debt * 1.05).setScale(-3, RoundingMode.CEILING).intValue();\n }\n System.out.println(debt);\n\n }\n} ", "import java.util.*;\n\npublic class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tlong mon = 100_000;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tmon *= 1.05;\n\t\t\tif(mon % 1000 > 0){\n\t\t\t\tmon += 1000;\n\t\t\t\tmon -= mon % 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", mon);\n\t}\n}", "n = int(input())\ndebt = 100000\nfor i in range(n):\n debt *= 1.05\n if debt%1000 != 0:\n debt += 1000 - debt%1000\nprint(int(debt))", "import java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n, ans;\n\t\twhile(sc.hasNext()){\n\t\t\tn = sc.nextInt();\n\t\t\tans = 100000;\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tans += ans / 20;\n\t\t\t\tif(ans != (ans = ans / 1000 * 1000)){\n\t\t\t\t\tans += 1000;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}", "#include <iostream>\nusing namespace std;\nint main(){\n\tint a=100000,n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tif((a*21/20)%1000==0)a=a*21/20;\n\t\telse a=((a*21/20)/1000)*1000+1000;\n\t}\n\tcout<<a<<endl;\n\treturn 0;\n\t}\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n,cur = 100000;\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tcur *= 1.05;\n\t\tif(cur%1000){\n\t\t\tcur += 1000-cur%1000;\n\t\t}\n\t}\n\tcout << cur << endl;\n\t\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int n,a = 100000;\n cin >>n;\n while(n--){\n a = (int)((double)a*1.05);\n if(a%1000) a = (a/1000+1)*1000;\n }\n cout <<a<<endl;\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint ans = 100000;\n\t\tint n = sc.nextInt();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tans = (int)((double)ans * 1.05);\n\t\t\tans = ans % 1000 != 0 ? ans - (ans % 1000) + 1000 : ans;\n\t\t}\n\t\tSystem.out.println(ans);\n\n\t}\n\n}", "import java.util.Scanner;\npublic class Main\n{\n\tpublic static void main(String arg[])\n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tdouble d=100000;\n\t\tfor(int i=0; i<n; i++)\n\t\t{\n\t\t\td=d*1.05;\n\t\t\tif(d%1000!=0)\n\t\t\t\td+=1000;\n\t\t\td=(int)d/1000;\n\t\t\td=(int)d*1000; \n\t\t}\n\t\tSystem.out.println((int)d);\n\t}\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint a=100000,n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\ta=a*21/20;\n\t\tif(a%1000>0){\n\t\t\ta=a/1000;\n\t\t\ta=a+1;\n\t\t\ta=a*1000;\n\t\t}\n\t}\n\tcout<<a<<endl;\n}", "n=input()\nloan=10**5\nfor i in xrange(n):\n loan+=loan*0.05\n if loan%1000!=0:\n loan-=loan%1000\n loan+=10**3\n else:\n loan-=loan%1000\nprint(int(loan))", "import java.util.*;\n\npublic class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tlong mon = 100_000;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tmon = (long) Math.ceil(mon * 1.05 / 1000) * 1000;\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", mon);\n\t}\n}", "import java.io.*;\npublic class Main {\n\n\tpublic static void main (String[] args) throws IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tdouble interest = 1.05; \n\t\tdouble debt = 100;\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdebt = Math.ceil(debt * interest);\n\t\t}\n\t\t\n\t\tSystem.out.println((int)(debt * 1000));\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int base = 100000;\n int n = sc.nextInt();\n for (int i = 0; i < n; i++) {\n int next = (int) ((base * 1.05) / 1000) * 1000;\n if ((base * 1.05) % 1000 > 0){\n next += 1000;\n }\n base = next;\n }\n System.out.println(base);\n }\n}", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n\tint debt = 100000, n;\n\tcin >> n;\n\tfor(int i = 0; i < n; ++i){\n\t\tdebt = ((int)(debt * 1.05) + 999) / 1000 * 1000;\n\t}\n\tcout << debt << endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\tint n = sc.nextInt();\n\t\t\tdouble result = 100000;\n\t\t\t\tfor(int i = 0; n > i; i++)\n\t\t\t\t{\n\t\t\t\t\tresult = result * 1.05;\n\t\t\t\t\tresult = ((int)((result + 999)/1000))*1000;\n\t\t\t\t}\n\t\t\tSystem.out.println((int)result);\n\t}\n}", "T=100000\nn=int(input())\n\nfor x in range(n):\n T*=1.05\n if T%1000==0:\n pass\n else:\n T=T-(T%1000)+1000\nprint(int(T))\n", "#include <iostream>\nusing namespace std;\nint main(){int n,x;x = 100000;cin >> n;for (int i=0;i<n;i++) \n{x = 1.05*x;if (x%1000!=0) \n{x = x +(1000-x%1000);}}cout << x << endl;return 0;}", "#include<iostream>\nusing namespace std;\nint main(){\n int money = 100000,n;\n cin >>n;\n while(n--){\n money = (int)(money*1.05);\n if(money%1000){money = (money/1000+1)*1000;}\n }\n cout <<money<<endl;\n return 0;\n}", "import sys, math\n\nfor line in sys.stdin.readlines():\n line = line.strip()\n n = int(line)\n value = 100000.0\n for week in xrange(n):\n value = value * 1.05\n value = math.ceil(value / 1000) * 1000\n print int(value)", "n=int(input())\ns=100000\nfor i in range(n):\n s*=1.05\n if s%1000!=0:\n s = (int(s / 1000) + 1) * 1000\nprint(s)\n", "import math\nd=100\nfor _ in[0]*int(input()):\n d=math.ceil(d*1.05)\nprint(int(d*1e3))\n", "import java.util.*;\n\npublic class Main{\n \n public static void main(String[] args){\n\tScanner sc =new Scanner(System.in);\n\tint w = sc.nextInt();\n\tint det=100000;\n\tfor(;w>0;w--){\n\t det*=1.05;\n\t if(det%1000!=0){\n\t\tdet=((det/1000)+1)*1000;\n\t }\n\t}\n\tSystem.out.println(det);\n }\n}", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tsc.close();\n\t\tint m = 100000;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tm = m * 105 / 100;\n\t\t\tint res = m - (m / 1000) * 1000;\n\t\t\tif(res != 0) {\n\t\t\t\tm = (m / 1000) * 1000 + 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(m);\n\t}\n}\n", "a=100000\nj=int(input())\nfor i in range(j):\n\ta*=1.05\n\tif a%1000==0:\n\t\tpass\n\telse:\n\t\ta=(a+1000)-a%1000\nprint(int(a))", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nimport math\nn = input()\ndebt = 1e5\nfor i in range(0, n):\n debt *= 1.05\n debt = math.ceil(debt/1000) * 1000\nprint int(debt)", "#include<iostream>\n\nusing namespace std;\n\nint main(){\n int n;\n cin >>n;\n int a = 100000;\n for (int i= 0; i<n; i++){\n a = a*1.05;\n if(a%1000 >0) a= a-a%1000+ 1000;\n }\n cout << a <<endl;\n}\n ", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) {\n double debt = 100000.0;\n int nWeeks = new Scanner(System.in).nextInt();\n for(int i = 0; i < nWeeks; i++) {\n debt = Math.ceil(debt * 0.00105) * 1000.0;\n }\n System.out.println((int)debt);\n\n }\n} ", "#include <iostream>\nusing namespace std;\nint main() {\n int n, a = 100000;\n cin >> n;\n while(n--) {\n\ta *= 1.05;\n\tif(a % 1000 > 0) {\n\t a += 1000;\n\t a -= (a % 1000);\n\t}\n }\n cout << a << endl;\n return 0;\n}", "import math\n\nans = 100000\n\nn = int(raw_input())\n\nfor i in range(n):\n ans = math.ceil(ans * 1.05 / 1000) * 1000\n\nprint int(ans)", "n=int(input())\nm=100000\nfor i in range(n):\n m=m*1.05\n if m % 1000 != 0 : \n m=m-(m%1000)+1000\nprint(int(m))\n", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner in = new Scanner(System.in);\n int debt = 100000;\n int day = in.nextInt();\n for(int i = 0; i < day; i++){\n debt = (debt * 105 / 100 + 999) / 1000 * 1000;\n }\n System.out.println(debt);\n }\n}", "from math import ceil\n\nn = int(raw_input())\n\ndebt = 100000\n\nfor i in range(n):\n debt = ceil(debt * 1.05 / 1000) * 1000\n\nprint int(debt)", "import math\nN=int(input())\na=100000\nfor i in range(N):\n a=a*1.05\n a=math.ceil(a/1000)*1000\nprint(a)\n", "import java.util.Scanner;\n\npublic class Main\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = 100;\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tm = (int)Math.ceil(m*1.05);\n\t\t}\n\t\tSystem.out.println(m*1000);\n\t}\n}", "n=int(input())\ns=100000\nfor i in range(n):\n s=s*1.05\n if s%1000==0:\n s=s\n else:\n s=(s//1000)*1000+1000\nprint(int(s))\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint a,b,rone=100000;\n\tcin>>a;\n\tfor(int i=0;i<a;i++){\n\t\trone *=1.05;\n\t\tb = rone % 1000;\n\t\trone -= b;\n\t\tif(b>0)\trone += 1000;\t\t\n\t}\n\tcout<<rone<<endl;\n}", "n = int(input())\na = 100000\nfor i in range(n):\n a = a * 1.05\n b = 0\n if a % 1000:\n b = 1000\n a = int(a // 1000 * 1000 + b)\nprint(a)\n", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile (sc.hasNext()) {\n\t\t\tint i;\n\t\t\tint cnt = sc.nextInt();\n\t\t\tdouble ret = 100;\n\t\t\tfor (i = 0; i < cnt; i++) {\n\t\t\t\tret = ret + ret * 0.05;\n\t\t\t\tret = Math.ceil(ret);\n\t\t\t}\n\t\t\tSystem.out.println((int) ret * 1000);\n\t\t}\n\t}\n}", "#include<iostream>\n\nint main(){\n\tint n,a=100000,b;\n\tstd::cin>>n;\n\tfor(b=0;b<n;b++){\n\t\ta*=1.05;\n\t\tif(a%1000!=0){\n\t\t\ta=a-(a%1000)+1000;\n\t\t}\n\t}\n\tstd::cout<< a <<std::endl;\n\treturn 0;\n}", "import math\nnum=100\nfor i in range(int(input())):\n\tnum = math.ceil(num*1.05)\nprint(num*1000)\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) {\n System.out.println(\n calcDebt(100000.0, new Scanner(System.in).nextInt())\n );\n\n }\n\n private static int calcDebt(double firstDebt, int nWeeks) {\n double debt = firstDebt;\n for(int i = 0; i< nWeeks; i++) {\n debt = Math.ceil(debt * (1 + 0.05) / 1000.0) * 1000.0;\n }\n return (int)debt;\n }\n} ", "import math\ndebt = 100000\nn = int(raw_input())\nfor i in range(n):\n debt = math.ceil(debt*1.05/1000)*1000\nprint int(debt)", "n = int(input())\nimport math\nyen = 100000\nfor i in range(n):\n yen = math.ceil((yen*1.05)/1000)*1000\nprint(yen)\n", "x = int(input())\n\nn = 100000\nwhile x > 0:\n n *= 1.05\n mod = n % 1000\n if mod:\n n += 1000 - mod\n x -= 1\n\nprint(int(n))", "import java.util.*;\n\npublic class Main{\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tint n = scan.nextInt();\n\t\tlong mon = 100_000;\n\t\twhile(n != 0){\n\t\t\tmon *= 1.05;\n\t\t\tn--;\n\t\t\tif(mon % 1000 != 0){\n\t\t\t\tmon += 1000;\n\t\t\t\tmon -= mon % 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\"%d\\n\", mon);\n\t}\n}", "#include<stdio.h>\nint main(void)\n{\n\tint n,i,w=100000;\n\tscanf(\"%d\",&n);\n\tfor(i=0;i<n;i++){\n\t\tw=w*1.05;\n\t\tif(w%1000>0){\n\t\t\tw=w-(w%1000)+1000;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",w);\n\treturn 0;\n}\t", "import math\nn = int(input())\nmoney = 100\nfor i in range(n):\n money = math.ceil(money*1.05)\nprint(money*1000)", "import java.util.*;\n\nclass Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n double hensai = 100000;\n for(int i=0;i<n;i++){\n hensai *= 105;\n hensai = (long)Math.ceil((double)hensai/100000);\n hensai *=1000;\n } \n System.out.println((long)hensai);\n }\n}", "import math\nN = int(input())\no = 100.000\nfor i in range(N):\n o += math.ceil(o*0.05)\n i += 1\nprint(int(o*1000))\n", "a = 100000\nn = int(input())\nwhile n > 0:\n n -= 1\n a = a+(a*5)//100\n a = ((a - 1) // 1000 + 1) * 1000 \nprint(a)\n", "import math\n\nn = input()\nmoney = 100000\n\nfor i in range(0, n):\n money = money*1.05\n money /= 1000\n money = int(math.ceil(money)*1000)\n\nprint money", "from math import ceil\ns = 100000\nn = int(input())\nfor i in range(n):\n s = s + s*0.05\n s = ceil(s/1000)*1000\n\nprint(s)\n", "from math import ceil\ndef roundint(num):\n fnum = float(num)\n inum = int(ceil(fnum * 0.001) * 1000)\n return inum\n\ndebt = 100000.0\nn = input()\nfor x in xrange(n):\n debt += roundint(debt*0.05)\nprint int(debt)", "#include<iostream>\n#include<cmath>\n\nint main(){\n\tint n,sum=100000;\n\tstd::cin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tsum*=1.05;\n\t\tif(sum%1000!=0){\n\t\t\tsum+=1000-(sum%1000);\n\t\t}\n\t}\n\tstd::cout<<sum<<std::endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint debt = 100000;\n\t\twhile(n-- != 0) {\n\t\t\tdebt += debt*0.05;\n\t\t\tint a = debt%1000;\n\t\t\tif(a != 0) debt += 1000-a;\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n}\n\n", "import java.io.*;\nimport java.util.*;\npublic class Main{\n\tpublic static void main(String[] args)throws IOException{\n\t\tBufferedReader reader=new BufferedReader(new InputStreamReader(System.in));\n\t\tString s=reader.readLine();\n\t\tint in=Integer.parseInt(s);\n\t\tint out=100000;\n\t\tfor(int i=0;i<in;i++){\n\t\t\tout*=1.05;\n\t\t\tif(out%1000!=0){\n\t\t\t\tout-=out%1000;\n\t\t\t\tout+=1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(out);\n\t}\n}", "n = input()\ns = 100000\nfor i in range(n):\n s = s * 1.05\n if s % 1000 != 0:\n s = ((s // 1000) + 1) * 1000\nprint \"%d\" % s", "#include<iostream>\nusing namespace std;\nint main(){\n int n,d=100000;\n cin>>n;\n for(int i=0;i<n;i++){\n d*=1.05;\n if(d%1000!=0)d=(d/1000)*1000+1000;\n }\n cout <<d<<endl;\n}", "n=int(input())\ns=100000\nfor _ in range(n):\n s*=1.05\n if s%1000!=0:\n s+=1000-s%1000\nprint(int(s))", "import java.io.*;\nimport java.util.*;\n \npublic class Main {\n \n public static void main(String[] args)\n throws java.io.IOException{\n Scanner scan = new Scanner(System.in);\n int sum=100000;\n \n for(int n=scan.nextInt();n>0;n--){\nsum *=1.05;\nint m= up3(sum);\nif(m!=0)\nsum+=1000-m;\n}\nSystem.out.println(sum);\n}\npublic static int up3(int n){\nreturn n%1000;\n \n }\n}", "from math import ceil\ndebt = 100000\nn = int(input())\nfor _ in range(n):\n tmp = ceil(debt*1.05)\n debt = ceil((tmp/1000))*1000\nprint(debt)", "n=int(input())\ns=100000\nfor i in range(n):\n s=s*(1+5/100)\n s=-(-s//1000)\n s=s*1000\nprint(int(s))\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Here your code !\n Scanner scan = new Scanner(System.in);\n double sum = 100000.0;\n int a = scan.nextInt();\n for(int i =1 ;i<=a ;i++){\n sum = sum *0.05+sum;\n sum = (Math.ceil(sum /1000)) *1000;\n }\n System.out.printf(\"%.0f\\n\",sum);\n }\n}", "import java.util.Scanner;\nimport java.math.BigDecimal;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint n = s.nextInt();\n\t double sum = 100000;\n\t double dept=0;\n\t for(int i=0;i<n;i++){\n\t\t sum*=1.05;\n\t\t dept =sum%1000;\n\t\t if(dept!=0){\n\t\t\t sum+=(1000-dept);\n\t\t }\n\t }\n\t System.out.println((int)sum);\n\t}\n}", "n=int(input())\nx=100000\nfor i in range(n):\n x=x+x*0.05\n x=((x-1)//1000+1)*1000\nprint(int(x))\n", "n = input()\nans = 100000\nfor i in xrange(n):\n ans *= 1.05\n if ans % 1000 > 0:\n ans += 1000 - (ans % 1000)\nprint int(ans)", "#include<iostream>\n\nusing namespace std;\n\nint main(){\n\t\n\tint n,s=100000;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\ts+=s*0.05;\n\tif(s%1000!=0)\n\t\ts=s-s%1000+1000;\n\t}\n\tcout<<s<<endl;\n}", "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n double debt = 100000;\n debt *= 0.001;\n while(sc.hasNext()) {\n int n = sc.nextInt();\n for (int i = 0; i < n; i++) {\n debt *= 1.05;\n debt = Math.ceil(debt);\n }\n System.out.println((int)debt*1000);\n }\n }\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint n, ans = 100000;\n\tcin >> n;\n\tfor(int i = 0; i < n; i++){\n\t\tans *= 1.05;\n\t\tif(ans % 1000 != 0) ans += (1000 - (ans % 1000));\n\t}\n\tcout << ans << endl;\n\n}", "import java.util.Scanner;\nimport java.math.BigDecimal;\npublic class Main{\n\tstatic int calculate(int yen){\n\t\tBigDecimal bd = new BigDecimal(yen*1.05);\n\t\tBigDecimal bd1 = bd.setScale(-3, BigDecimal.ROUND_UP);\n\t\treturn bd1.intValue();\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint yen = 100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tyen =calculate(yen);\n\t\t}\n\t\tSystem.out.println(yen);\n\t\tscan.close();\n\t}\n}", "from math import ceil as c\na=int(input())\nb = 100\nfor i in range(a):\n b = c(b*1.05) \nprint(b*1000)\n", "import java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\tprivate static final int debt = 100000;\n\n\tpublic static void main(String[] a) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint len = sc.nextInt();\n\t\tint debtSum = debt;\n\t\tfor (int i = 0; i < len; i++) {\n\t\t\tdebtSum = (int) (Math.ceil((debtSum * 1.05) / 1000) * 1000);\n\t\t}\n\t\tSystem.out.println(debtSum);\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\n\t\tdouble debt = 100000;\n\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tdebt *= 1.05;\n\t\t\t// ?????????????????§????????´??????????????????\n\t\t\tif((long)debt % 1000 != 0) {\n\t\t\t\tdebt /= 1000;\n\t\t\t\tdebt = Math.ceil(debt);\n\t\t\t\tdebt *= 1000;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println((long)debt);\n\t}\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tint m = 100000;\n\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tm += m * 5 / 100;\n\n\t\t\tint r = m % 1000;\n\t\t\tif(r != 0) {\n\t\t\t\tm += 1000 - r;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(m);\n\n\t\tsc.close();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String a[]){\n\t\tdouble INTEREST = 0.05;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint debt = 100000;\n\t\tfor(int i = 0; i<n;i++){\n\t\t\tdebt *= (1+INTEREST);\n\t\t\tdebt = normalization(debt);\n\t\t}\n\t\tSystem.out.println(debt);\n\t\tsc.close();\n\t}\n\n\tstatic int normalization(int num){\n\t\tif(num % 1000 != 0)\n\t\t\tnum = num - num%1000 + 1000;\n\t\treturn num;\n\t}\n\n}\n\n", "#include<iostream>\n#include<cmath>\nusing namespace std;\nint main(){\n int n;\n cin >> n;\n double debt = 100;\n for(int i = 0; i < n; i++){\n debt = ceil(debt*1.05);\n }\n cout << (long long)debt * 1000 << endl;\n}", "#include<stdio.h>\n#include<math.h>\n \nint main(){\n int a;\n scanf(\"%d\",&a);\n int b=100000;\n for(int i=0;i<a;i++){\n b*=1.05;\n if(b%1000!=0)b=(b/1000+1)*1000;\n }\n printf(\"%d\\n\",b);\n}\n", "import math\nn = int(input())\nsum=100000\ni=0\nfor i in range(n):\n sum = math.ceil(sum*1.05/1000)*1000\nprint(sum)\n", "import math\nn = int(raw_input())\na = 100000\nfor i in range(n):\n a = int(math.ceil(a * 0.00105)) * 1000\nprint a", "n = input()\nmoney = 100000\ni = 0\n\nwhile i<n:\n\tmoney = money * 105 / 100\n\tif money % 1000 != 0:\n\t\tmoney = (money / 1000 + 1) * 1000\n\ti += 1\n\nprint money\n", "import math\n\nweeks = int(input())\nmoney = 100\n\nfor i in range(0, weeks):\n money = math.ceil(money * 1.05)\n\nprint(money * 1000)", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint i,n,Debt=100000;\n\tcin>>n;\n\tfor(;n>0;--n){\n\t\ti=Debt*0.05;\n\t\tif(i%1000!=0) i=1000+(i/1000)*1000;\n\t\tDebt+=i;\n\t}\n\tcout<<Debt<<endl;\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n, a = 100000;\n\tcin >> n;\n\tfor(int i = 0;i < n;i++){\n\t\ta *= 1.05;\n\t\tif(a%1000 != 0)a += 1000 - a%1000;\n\t}\n\tcout << a << endl;\n\treturn 0;\n}", "import math\nn = int(input())\ndept=100\nfor i in range(n):\n dept=dept*1.05\n #print dept\n dept=math.ceil(dept)\n #print dept\nprint \"%i\"%(dept*1000)", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint d = 100000; int n; cin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\td *= 1.05; if (d % 1000 != 0) d += (1000 - (d % 1000));\n\t}\n\tcout << d << endl;\n\treturn 0;\n}\n", "a=100000\nn=int(input())\nfor i in range(n):\n a*=1.05\n if a%1000:\n a=int(a//1000*1000+1000)\nprint(a)\n", "#include<iostream>\nusing namespace std;\nint main(){\n int n,ans = 100000;\n cin >>n;\n while(n--){\n ans = (int)((double)ans*1.05);\n if(ans%1000>0) ans = (ans/1000+1)*1000;\n }\n cout <<ans<<endl;\n return 0;\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String args[]) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\tint ans = 100000;\n\t\tint temp;\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tans *= 1.05;\n\t\t\ttemp = ans / 1000 * 1000;\n\t\t\tif(ans != temp)ans = temp + 1000;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n\n int debt = 100000;\n int nWeeks = sc.nextInt();\n for (int i = 0; i < nWeeks; i++) {\n debt = (int)(Math.ceil(debt*1.05 / 1000) * 1000);\n }\n\n System.out.println(debt);\n }\n}", "n=int(input())\nx=100000\nfor i in range(n):\n x=x*1.05\n if x%1000==0:\n x=x\n else:\n x=((x//1000)+1)*1000\nprint(int(x))\n\n\n", "n = int(raw_input())\nres = 100000\nfor i in range(0,n):\n res = res * 1.05\n if res % 1000:\n res += 1000\n res = int(res/1000)*1000\nprint res", "x = 100000\nfor i in range(int(input())):\n x*=1.05\n x+=999\n x=x//1000*1000\nprint(int(x))", "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tvoid run(){\n\t\tint x = sc.nextInt();\n\t\tint debt = 100000;\n\t\tfor(int i = 0; i < x; i++){\n\t\t\tdebt *= 1.05;\n\t\t\tdebt += 999;\n\t\t\tdebt /= 1000;\n\t\t\tdebt *= 1000;\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n\tpublic static void main(String[] args){\n\t\tMain m = new Main();\n\t\tm.run();\n\t\t\n\t}\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint a,b,c;\n\tint i,n;\n\tcin>>n;\n\ta=100000;\n\tfor(i=0;i<n;i++){\n\t\tb=a/20+a;\n\t\tif(b%1000!=0)b+=1000;\n\t\tb/=1000;\n\t\tb*=1000;\n\t\ta=b;\n\t}\n\tcout<<a<<endl;\n\treturn 0;\n}", "#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n\nint main() {\n\tint a, b = 100000;\n\tscanf(\"%d\", &a);\n\tfor (int i = 0; i<a; i++) {\n\t\tb *= 1.05;\n\t\tif (b % 1000 != 0)b = (b/1000+1)*1000;\n\t}\n\tprintf(\"%d\\n\", b);\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint inputNum = in.nextInt();\n\t\tSystem.out.println(getNowShakkin(inputNum));\n\t}\n\n\tpublic static int getNowShakkin(int weekInterval) {\n\t\tdouble result = 100;\n\n\t\tfor (int i = 0; i < weekInterval; i++) {\n\t\t\tresult = result*1.05;\n\t\t\tresult = (Math.ceil((double) result));\n\t\t}\n\n\t\treturn (int)result * 1000;\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tin.close();\n\t\tSystem.out.println(debtHell(n));\n\t}\n\n\tstatic int debtHell(int n) {\n\t\tdouble debt = 100000;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdebt *= 1.05;\n\t\t\t//System.out.print(debt);\n\t\t\tdebt = Math.ceil(debt / 1000.0) * 1000;\n\t\t\t//System.out.println(\"\\t\" + debt);\n\t\t}\n\t\treturn (int) debt;\n\t}\n}", "#include <iostream>\n\nint main (void){\n\tint week,res=100,i;\n\n\tstd::cin >> week;\n\n\tfor(i=0; i < week; i++){\n\t\tres += (int)(0.05 * res + 0.99 );\n\t}\n\tstd::cout << res*1000 << std::endl;\n\treturn 0;\n}", "n = int(input())\na = 100000\nwhile n>0:\n a *= 1.05\n if a % 1000 != 0:\n a = int(a + 1000 - (a%1000))\n n -= 1\nprint(a)", "#include<iostream>\nusing namespace std;\nint main(){\n\tint moto=100,syuu;\n\tcin>>syuu;\n\tfor(int abc=0;abc<syuu;abc++){\n\t\tif(moto%20!=0){\n\t\t\tmoto=moto*1.05+1;\n\t\t}else{\n\t\t\tmoto*=1.05;\n\t\t}\n\t}\n\tcout<<moto*1000<<endl;\n\treturn 0;\n}", "#include<stdio.h>\nint main(void)\n{\n\tint n,s,ss,i;\n\tscanf(\"%d\",&n);\n\ts=100000;\n\tfor(i=0;i<n;i++){\n\t\tss=s*0.05;\n\t\ts+=ss;\n\t\tif(s%1000!=0){\t\n\t\ts=s/1000;\n\t\ts=(s+1)*1000;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\\n\",s);\n\treturn 0;\n}", "import java.io.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tString str = \"\";\n\t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n\t\tif((str=bf.readLine())==null)return;\n\t\tbf.close();\n\t\tint n=Integer.parseInt(str);\n\t\tint c=100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tc*=1.05;\n\t\t\tif(c%1000!=0)c+=1000;\n\t\t\tc=(c/1000)*1000;\n\t\t}\n\t\tSystem.out.println(c);\n\t}\n}", "import math\nkane=100000\nn=int(input())\nfor i in range (1,n+1):\n syaku=kane*1.05/1000\n kane=math.ceil(syaku)*1000\nprint(kane)\n\n", "n = input()\nd = 100000\nfor x in range(n):\n d += int(d*0.05)\n d = str(d)\n if d[-3:] != \"000\":\n d = d[:-3] + \"000\"\n d = int(d) +1000\n else:\n d = int(d)\nprint d", "#include<iostream>\n#include<cmath>\nusing namespace std;\nint main(){\nlong i,n,t=100;\ncin>>n;\nfor(i=0;i<n;i++)t=ceil(t*1.05);\ncout<<t*1000<<endl;\nreturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n long a = 100000;\n cin >> n;\n \n for(int i = 0; i < n; i++){\n a *= 1.05;\n if(a % 1000 > 0) a = a + 1000 - a % 1000;\n }\n cout << a << endl;\n}\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint N;\n\tcin>>N;\n\tint res=100000;\n\tfor(int i=1;i<=N;i++){\n\t\tres=res*105/100;\n\t\tres=(res+999)/1000*1000;\n\t}\n\tcout<<res<<endl;\n\treturn 0;\n}", "n = int(input())\nyen = 100000\n\nfor i in range(n):\n yen *= 1.05\n yen = int(yen)\n\n rest = int(yen % 1000)\n if (rest != 0):\n yen /= 1000\n yen = int(yen)\n yen *= 1000\n yen += 1000\n\nprint yen", "import math\nn=int(input())\ni=1\nsum=100\nwhile i<=n:\n sum=math.ceil(sum*1.05)\n i=i+1\nprint(sum*1000)\n", "s=100000\nn=int(input())\nfor i in range (n):\n s=s*1.05\n if s%1000!=0:\n s=(s//1000)*1000+1000\nprint(int(s))\n", "from math import ceil\na = 100\nfor i in range(input()):\n a *= 1.05\n a = ceil(a)\nprint int(a*1000)", "# coding:utf-8\nimport math\ndebt = 100000\n\nfor _ in range(int(input())):\n debt *= 1.05\n debt = math.ceil(debt / 1000) * 1000\n\nprint(debt)\n\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) {\n System.out.println(\n calcDebt(100000.0, new Scanner(System.in).nextInt())\n );\n\n }\n\n private static int calcDebt(double firstDebt, int nWeeks) {\n double debt = firstDebt;\n for(int i = 0; i< nWeeks; i++) {\n debt = Math.ceil(debt * 0.00105) * 1000.0;\n }\n return (int)debt;\n }\n} ", "#include<iostream>\nusing namespace std;\n\nint main(){\n \n int n,mon=100000;\n cin>>n;\n for(int i=0;i<n;i++){\n mon=mon*1.05;\n mon=(mon+999)-(int(mon+999)%1000);\n }\n cout<<mon<<endl; \n return 0;\n}", "#include <iostream>\nusing namespace std;\nint main(){\n int a=100000,b=0,t;\n cin>>t;\n for(int k=0;k<t;k++){\n b=a*1.05;\n b=(b+999)/1000*1000;\n a=b;\n }\n cout<<a<<endl;\n}", "import math\n\nn = int(input())\nm = 100000.0\nfor i in range(n):\n m = math.ceil((m * 1.05)/1000)*1000\n\nprint(int(m))\n", "#include <stdio.h>\n\nint main(void){\nint n;\nscanf(\"%d\",&n);\nint coin=100000;\nfor(int m=0;m<n;m++){\ncoin*=1.05;\ncoin=(coin/1000)*1000+((coin%1000)>0? 1000:0);\n}\nprintf(\"%d\\n\",coin);\nreturn 0;\n}", "debt=100000\nn=int(input())\nfor i in range(n):\n\tdebt*=1.05\n\tif(debt%1000!=0):\n\t\tdebt=debt+1000-debt%1000\nprint(int(debt))", "#include<iostream>\nusing namespace std;\n\nint main(){\n int n,i,a=100000;\n\n cin>> n;\n for(i=0;i<n;i++){\n a=a+(a*0.05);\n if(a%1000 != 0){\n a=a-(a%1000)+1000;\n }\n }\n cout << a << endl;\n\n\n\n}", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint week;\n\tcin >> week;\n\tint debt = 100;\n\twhile (week--)\n\t{\n\t\tdebt = ((debt * 105) / 100) + ((debt % 20) > 0 ? 1 : 0);\n\t}\n\tcout << debt * 1000 << endl;\n\n\treturn 0;\n}", "# Debt Hell\n\nn = int(input())\n\nvalue = 100000\n\nfor i in xrange(n):\n\tvalue *= 1.05\n\tif value % 1000 != 0:\n\t\tvalue = int(value / 1000 + 1) * 1000\n\nprint value", "import java.util.*;\n \npublic class Main {\n\t\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tint ans = 100000;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tans *= 1.05;\n\t\t\tif(ans%1000>0){\n\t\t\t\tans = ((ans/1000)+1) * 1000;\n\t\t\t}\n\t\t}\n\t\tcout(ans);\n\t}\n\t\n\t\n\t\n\tpublic static void cout(int n){\n\t\tSystem.out.println(n);\n\t}\n}", "import java.io.*;\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\tint data = Integer.parseInt(br.readLine());\n\t\t\n\t\tint debt = 100000;\n\t\tfor(int i=0;i<data;i++) {\n\t\t\tdebt = (int)Math.ceil(debt*1.05/1000)*1000;\n\t\t}\n\t\t\n\t\tSystem.out.println(debt); \n\t}\n}", "import java.util.*;\n\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanf =new Scanner (System.in);\n\t\t\n\t\tint n=scanf.nextInt() , i,S=100000;\n\t\t\n\t\tfor (i=0;i<n;i++)\n\t\t{S*=1.05; \n\t\tif(S%1000!=0) S=S+1000-S%1000; }\n\t\tSystem.out.println(S);\n\n\t}\n}", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint i, n;\n\tint money=100000;\n\t\n\tcin >> n;\n\t\n\tfor(i=1; i<=n; i++){\n\t\tmoney *= 1.05;\n\t\tmoney = (money+999) / 1000 * 1000;\n\t}\n\tcout << money << endl;\n\t\t\n\treturn 0;\n}", "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n int value = 100000;\n int n = new Scanner(System.in).nextInt();\n for(int i = 0;i < n;i++){\n value *= 1.05;\n if(value % 1000 != 0) value = value / 1000 * 1000 + 1000;\n }\n System.out.println(value);\n }\n}", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n double debt = 100000;\n\n for(int i = 0; i < n; i++){\n debt *= 1.05;\n double s = debt / 1000;\n s = Math.ceil(s);\n debt = s * 1000;\n }\n\n System.out.println((int)debt);\n }\n}", "import math\nweek = int(input())\ndebt = 100000\nfor i in range(week):\n debt = math.ceil(debt*1.05/1000)*1000\nprint(int(debt))\n", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin>>n;\n\t\n\tint dept=100000;\n\t\n\tfor(int i=0;i<n;i++){\n\t\tdept+=dept/20;\n\t\tif(dept%1000)\n\t\t\tdept+=1000-dept%1000;\n\t}\n\tcout<<dept<<endl;\n\t\n\treturn 0;\n}", "import math\nbase = 100000\nr = 0.05\nn = int(raw_input())\nif n <= 100:\n for i in range(1, n+1):\n base = base + (base * r)\n now = int(math.ceil(base / 1000))\n base = now * 1000\n print \"{}\".format(base)", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tlong m,n=100000;\n\tcin>>m;\n\tfor(int i=0;i<m;i++){\n\t\tn*=21;\n\t\tn/=20;\n\t\t\n\t\tif(n%1000!=0){\n\t\t\tn+=(1000-n%1000);\n\t\t}\n\t}\n\tcout<<n<<endl;\n\treturn 0;\n}\n", "#include <iostream>\n\nint main(void)\n{\n\tint n;\n\tint m = 100000;\n\n\tstd::cin >> n;\n\n\twhile (n--) {\n\t\tm *= 1.05;\n\t\tm = (m + 999) / 1000 * 1000;\n\t}\n\n\tstd::cout << m << std::endl;\n\n\treturn 0;\n}\n", "import math\nN = int(input())\nA = 100\nfor i in range(N):\n A =math.ceil(A*1.05)\nprint (A*1000)\n", "m = 100000\nn = int(input())\nwhile n > 0:\n n -= 1\n m = m + (m * 5 // 100)\n m = ((m-1) // 1000 + 1) * 1000\nprint(m)\n", "#include<iostream>\nusing namespace std;\nint main(){\n int n,solve = 100000;\n cin >>n;\n while(n--){\n solve = solve*1.05;\n if(solve%1000 > 0) solve = solve/1000*1000+1000;\n }\n cout <<solve<<endl;\n return 0;\n}", "#include <iostream>\n#include <cmath>\nusing namespace std;\nint main() {\n\tint money=100, week;\n\tcin>>week;\n\tfor(int i=0; i<week; i++) {\n\t\tmoney = ceil(money*1.05);\n\t}\n\tcout<<(money*1000)<<endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tdouble cap = 100000.0;\n\tint n;\n\tcin >> n;\n\tfor (int i=0;i<n;i++){\n\t\tcap *= 1.05;\n\t\tcap /= 1000;\n\t\tcap = ceil(cap);\n\t\tcap *= 1000;\n\t}\n\tcout << int(cap) << endl;\n}\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint n;cin>>n;int C=100;\n\tfor(int i=0;i<n;i++){\n\t\tlong double E=C;E*=1.05l;\n\t\tE+=0.999;C=(int)E;\n\t}\n\tcout<<C*1000<<endl;\n}", "#include<iostream>\nusing namespace std;\n\nint main(void){\n\tint debt=100000;\n\tint n;\n\tcin >> n;\n\tfor(int i=0; i<n; i++){\n\t\tdebt *= 1.05;\n\t\tif(debt%1000!=0) debt=(debt/1000)*1000+1000;\n\t}\n\tcout << debt << endl;\n}", "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int ans = 100000;\n for(int i = 0; i < n; i++){\n ans = (int)Math.ceil(ans * 1.05 / 1000) * 1000;\n }\n System.out.println(ans);\n }\n}", "import math\n\nn=int(input())\na=100000\n\nfor _ in range(n):\n a+=a*0.05\n a=math.ceil(a/1000)*1000\n\nprint(math.floor(a))\n", "import math\nm=10**2\nfor i in range(input()):\n m*=1.05\n m=math.ceil(m)\nprint int(m*(10**3))", "i = int(input())\n\nx = 100000\nfor _ in range(i):\n x *= 1.05\n x = int((x+999) / 1000) * 1000\n\nprint(x)", "#include <stdio.h>\n#include <math.h>\n\nint main(void){\n\tint l = 100000;\n\tfloat tl = 0.0;\n\tint n = 0;\n\tscanf(\"%d\", &n);\n\tfor(int i=0;i<n;i++){\n\t\tl = (int)(ceilf(l * 1.05f / 1000) * 1000);\n\t}\n\tprintf(\"%d\\n\", l);\n\treturn 0;\n}", "import math\na=int(input())\nA=100\nfor i in range(a):\n A=math.ceil(A*1.05)\nprint(A*1000)\n", "#include<stdio.h>\nint main(){\n\tint n;\n\tint sum=100000;\n\tscanf(\"%d\",&n);\n\twhile(n){\n\t\tsum*=1.05;\n\t\tif(sum%1000!=0)sum=(sum/1000+1)*1000;\n\t\tn--;}\n\tprintf(\"%d\\n\",sum);\n\treturn 0;}\n\n", "import math\nmoney=100.000\nfor i in range(int(input())):\n money*=1.05\n money=math.ceil(money)\nprint(money*1000)\n", "while True:\n\ttry:\n\t\tn = int(input())\n\texcept EOFError:\n\t\tbreak\n\tret=100000.0\n\tfor i in range(n):\n\t\tret=round(ret*1.05+499, -3)\n\tprint(int(ret))\n", "n = int(raw_input())\n\nm = 100000\n\nfor x in range(n) :\n m = int(m*1.05)\n \n if m % 1000 :\n m = (m/1000)*1000+1000\nprint m", "# -*- coding: utf-8 -*-\n\nimport sys\nfrom math import ceil\n\nfor line in sys.stdin.readlines():\n List = map(int, line.strip().split())\n \n n = List[0]\n yen = 100000\n for i in xrange(n):\n yen *= 1.05\n yen = int(ceil(yen/1000)) * 1000\n print yen", "import math\n\nn = int(input())\ndebt = 100\nfor i in range(n):\n debt = math.ceil(debt*1.05)\nprint(debt*1000)", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]) {\n double debt = 100000.0;\n int nWeeks = new Scanner(System.in).nextInt();\n for(int i = 0; i < nWeeks; i++) {\n debt = ((int)(debt * 0.00105 + 0.99999)) * 1000.0;\n }\n System.out.println((int)debt);\n\n }\n} ", "n=int(input())\ns=100000\n\nfor i in range(n):\n s+=s*0.05\n if s%1000==0 :\n pass\n else:\n s=(s//1000+1)*1000\nprint(int(s))\n", "n=int(input())\nx=100000\nfor i in range(n):\n x*=1.05\n if x%1000!=0:\n x=x-(x%1000)+1000\nx=int(x)\nprint(x)\n", "import java.io.InputStreamReader;\nimport java.io.BufferedReader;\nimport java.io.IOException;\n\npublic class Main {\n public static void main(String args[] ) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n double sum = 100000;\n\n for (int i = 0;i < n; i++) {\n sum = (1000 * Math.ceil((sum * 1.05) * 0.001));\n }\n\n System.out.println((int)sum);\n }\n}", "import math\ndebt = 100\nfor i in range(int(input())):\n debt = math.ceil(debt * 1.05)\nprint(int(debt) * 1000)", "import math\nloan = 100000\nn = int(input())\nfor i in range(n):\n loan += math.ceil(loan * 0.05 / 1000) * 1000\nprint(loan)", "class Main{public static void main(String[]_)throws Exception{double y=1e5;int n=0,i;for(;(i=System.in.read())>32;n=n*10+i-48);for(i=1000;n-->0;y+=y%i>0?i-y%i:0)y*=1.05;System.out.println((int)y);}}", "from __future__ import (division, absolute_import, print_function,\n unicode_literals)\ndebt = 100000.0\nfor i in xrange(int(raw_input())):\n debt += debt * 0.05\n debt = debt - (debt % 1000.0) + (1000.0 if debt % 1000.0 else 0.0)\nprint(int(debt))", "import math\nn=int(input())\na=100000\nfor i in range(n):\n a*=1.05\n a=math.ceil(a/1000)*1000\nprint(a)", "#include <iostream>\nusing namespace std;\nint b=100000;\nint a;\n\nint main(){\n\tcin>>a;\n\tfor(int i=0;i<a;i++){\n\t\tb*=1.05;\n\t\tint d=b/1000;\n if(d*1000<b){\n\t\tb=d*1000+1000;\n\t\t} \n\n\t}\n\n\tcout<<b<<endl;\n\treturn 0;\n\t}", "import java.util.*;\nimport java.lang.*;\n\nclass Main\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n \tScanner in = new Scanner(System.in);\n\t\tint week = in.nextInt();\n\t\tint dept = 100000;\n\t\t\n\t\tfor (int i = 0; i < week; i++) {\n\t\t\t// 利子の計算\n\t\t\tdept = (int)(dept * 1.05);\n\t\t\t// 1,000円未満は切り上げ\n\t\t\tif (dept % 1000 != 0) {\n\t\t\t\tdept = (dept / 1000) * 1000;\n\t\t\t\tdept += 1000;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(dept);\n\t\t\n\t}\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args){\n\t\tScanner cin = new Scanner(System.in);\n\t\t\n\t\tint n;\n\t\tint ans = 100000;\n\t\t\n\t\tn = cin.nextInt();\n\t\t\n\t\twhile (n > 0){\n\t\t\tans += ans / 100 * 5;\n\t\t\tif (ans % 1000 != 0){\n\t\t\t\tans /= 1000;\n\t\t\t\tans *= 1000;\n\t\t\t\tans += 1000;\n\t\t\t}\n\t\t\tn--;\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint debt = 100000;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tdebt += debt/20;\n\t\t\tdebt = ((debt-1)/1000+1)*1000;\n\t\t}\n\t\tSystem.out.println(debt);\n\t}\n\n}", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\n\tint ans = 100000;\n\twhile(n--){\n\t\tans*=1.05;\n\t\tif(ans%1000)\n\t\t\tans=(ans/1000+1) * 1000;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}\n\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint n,a;\n\ta = 100000;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\ta=a*1.05;\n\t\ta = ((a + 999) / 1000) * 1000;\n\t}\n\tcout << a << endl;\n\treturn 0;\n}", "# coding: utf-8\n#Problem Name: Debt Hell\n#ID: tabris\n#Mail: [email protected]\n\nn = float(raw_input())\ndept = 100000\nfor i in range(int(n)):\n dept *= 1.05\n if not (dept/1000).is_integer():\n dept /= 1000\n dept = __import__('math',fromlist=['floor']).floor(dept)*1000+1000\nprint int(dept)", "from decimal import Decimal\n\ndef check(index):\n if index > len(debt_lis)-1:\n for i in range(len(debt_lis)):\n debt_lis[i] = '0'\n debt_lis.append('1')\n return\n if int(debt_lis[index]) + 1 == 10:\n return check(index+1)\n else:\n for i in range(index):\n debt_lis[i] = '0'\n num = int(debt_lis[index]) + 1\n debt_lis[index] = str(num)\n return\n\ninput_line = raw_input()\nn = int(input_line)\n\ndebt = 100000\nfor i in range(n):\n debt = int((debt * Decimal(1.05))) \n debt_lis = list(str(debt))\n debt_lis.reverse()\n for char_num in debt_lis[:3]:\n if not int(char_num) == 0:\n check(3)\n break\n debt_lis.reverse()\n debt = int(''.join(debt_lis))\nprint(debt)", "import java.io.*;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) throws IOException {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n double money = 100000;\n for(int i=0;i<n;i++) {\n money = money + money * 0.05;\n money = Math.ceil(money/1000.0) * 1000;\n }\n System.out.printf(\"%.0f\\n\", money);\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = (int) Math.pow(10, 5);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tm *= 1.05;\n\t\t\tint range = 1000;\n\t\t\tif (m % range != 0)\n\t\t\t\tm = (m / range + 1) * range;\n\t\t}\n\t\tSystem.out.println(m);\n\t\tsc.close();\n\n\t}\n}", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nimport sys\n\nmoney = 100000\n\nd = int(sys.stdin.read())\nfor i in range(d):\n money *= 1.05\n if money%1000 != 0:\n money -= money%1000\n money += 1000\nprint int(money)", "from math import ceil\n\nn = int(input())\nx = 100\nfor i in range(n): x = ceil(x * 1.05)\nprint(x * 1000)", "import java.util.Scanner;\n\nclass Main {\n\n public static void main(String[] args){\n\tScanner stdin = new Scanner(System.in);\n\tint money = 100000;\n\tint n = stdin.nextInt();\n\tfor(int i = 0; i < n; i++){\n\t money = (int)(money * 1.05);\n\t if(money % 1000 > 0){\n\t\tmoney /= 1000;\n\t\tmoney++;\n\t\tmoney *= 1000;\n\t }\n\t}\n\tSystem.out.println(money);\n }\n}", "a=100000\nn=int(input())\nfor i in range(n):\n a=a*1.05\n if a%1000 !=0:\n a=a-(a%1000)+1000\nprint(int(a))\n\n", "s=100000\nn=int(raw_input())\n\nfor i in range(0,n):\n s*=1.05\n if(s%1000>0):\n s=int(s/1000)*1000+1000\nif(s%1000>0):\n s=int(s/1000)*1000+1000 \nprint s\n ", "#include<iostream>\nusing namespace std;\n\nint main()\n{\nint n;\ncin>>n;\nint res=100000;\nfor(int i=0;i<n;i++){\nres=res*1.05;\nif(res%1000>0)\nres+=1000;\nres-=res%1000;\n}\ncout<<res<<endl;\n}", "import math\nm=100\nfor i in range(input()):m=math.ceil(m*1.05)\nprint \"%d\" %(m*1000)", "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n\tScanner sc = new Scanner(System.in);\n\n\tint week = sc.nextInt();\n\n\tdouble money = 100000;\n\tfor(int i=0; i<week; i++){\n\t money = money + money*0.05;\n\t if(money%1000!=0){\n\t\tmoney = money + (1000 - (money%1000));\n\t }\n\t}\n\n\tSystem.out.println((int)money);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n; cin >> n;\n int ans = 100000;\n while (n--) {\n ans = ans + ceil(ans * 0.05 / 1000) * 1000;\n }\n cout << ans << endl;\n return 0;\n}\n\n", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint n = s.nextInt();\n\t\tdouble c = 100000;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tc += c*0.05;\n\t\t\tif(c % 1000 != 0) {\n\t\t\t\tc -= c % 1000;\n\t\t\t\tc += 1000;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.printf(\"%.0f\\n\",c);\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin>>n;\n\t\n\tint ans = 100000;\n\tfor(int i=0; i<n; i++){\n\t\tans = (int(ans + ans*0.05 + 999)/1000)*1000;\n\t}\n\tcout << ans << endl;\n}\n", "#include<iostream>\nusing namespace std;\n#define L long long int\nint main(){\nint n,ans=100000;\ncin>>n;\nwhile(n--){\n\tans*=1.05;\n\tans+=ans%1000==0 ? -ans%1000:1000-ans%1000;\n\n}\ncout<<ans<<endl;\nreturn 0;\n}", "# -*- coding: utf-8 -*-\nfrom math import ceil\nn=int(input())\nd=int(1e5)\nfor x in range(n):\n d=(1.05*d)\n d=int(int(ceil(d/1e3))*1e3)\nprint(d)", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tdouble k = 100000;\n\t\tint T = 0;\n\t\tfor(int a = 0;a < n;a++){\n\t\t\tk = Math.ceil((k*1.05)/1000);\n\t\t\tk = k*1000;\n\t\t\tT = (int)k;\n\t\t}\n\t\tSystem.out.println(T);\n\t}\n}", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n\tint n=0;\n\tcin>>n;\n\tlong long c = 100000;\n\tfor ( int i=0; i<n; i++ )\n\t{\n\t\tc += c/20;\n\t\tc = (c+999)/1000*1000;\n\t}\n\tcout << c << endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tint sum = 100000;\n\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tsum *= 1.05;\n\t\t\tif(sum % 1000 != 0){\n\t\t\t\tsum += 1000 - sum % 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int n,ans=100000;\n cin >>n;\n while(n--){\n ans = (int)(ans*1.05);\n if(ans>(ans/1000)*1000) ans = (ans/1000)*1000+1000;\n }\n cout <<ans<<endl;\n return 0;\n}", "#include <stdio.h>\nint main(void){\n int n,m=100000;\n scanf(\"%d\",&n);\n while(n--)m+=m*.05,m+=(m%1000?1000-m%1000:0);\n printf(\"%d\\n\",m);\n return 0;\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint a=100000,b,n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\ta=a*1.05;\n\t\tb=a%1000;\n\t\tif(b!=0)a=a-b+1000;\n\t}\n\tcout<<a<<endl;\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\n\nint main() {\n\tint money = 100;\n\tint n;\n\tcin >> n;\n\n\twhile(n--) { money += money % 20 ? money / 20 + 1 : money / 20; }\n\n\tcout << money << \"000\" << endl;\n\treturn 0;\n}", "a = int(input())\ns = 100000\nfor i in range(a):\n s = s * 1.05\n if s % 1000:\n s = s - (s % 1000) + 1000\nprint(int(s))\n", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tdouble dept = 100000;\n\t\tint keta = 1000;\n\t\t\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint k = scan.nextInt();\n\t\t\n\t\tfor(int i=0;i<k;i++){\n\t\t\tdept = dept * 1.05;\n\t\t\tdept = dept / keta;\n\t\t\tdept = keta* (Math.ceil(dept));\n\t\t}\n\t\tSystem.out.println((int)dept);\n\t}\n\t\n}", "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n=sc.nextInt();\n int debt=100;\n \n \n \n for(int i=1; i<=n; i++){\n \n debt=(int)Math.ceil(debt*1.05);\n \n }\n \n System.out.println(debt*1000);\n \n }\n }\n ", "#include<iostream>\nint main(){\n\tint n;\n\tstd::cin>>n;\n\tint s=100000;\n\tfor(int i=0;i<n;i++){\n\t\ts*=1.05;\n\t\tif(s%1000!=0)s/=1000,s+=1;\n\t\telse s/=1000;\n\t\ts*=1000;\n\t}\n\tstd::cout<<s<<std::endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\tint a=100000;\n\tint b;\n\tcin >> b;\n\tint c=0;\n\twhile (c<b){\n\t\ta=a+a*0.05;\n\t\tc=c+1;\n\t\ta=((a+999)/1000)*1000;\n\t}\n\tprintf(\"%d\\n\",a);\n}\n", "#include <bits/stdc++.h>\n//#include <iostream>\n//#include <Windows.h>\nusing namespace std;\n\nint main(){\nint n;\nint a=100000;\ncin>>n;\nwhile (n--){\n\ta*=1.05;\n\tint l=a%1000;\n\tif(l>0)a+=1000-l;\n\t\n}\ncout<<a<<endl;\nreturn 0;\n}", "n=int(input())\ndebt=100\nadds=1.05\nfor i in range(n):\n debt*=adds\n if debt%1!=0:\n debt=int(debt)+1\nprint(debt*1000)", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\t\n\tprivate void run() {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint debt = 100000;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdebt *= 1.05;\n\t\t\tif (debt % 1000 > 0) {\n\t\t\t\tdebt = (int)(debt / 1000) * 1000 + 1000;\n\t\t\t\t//System.out.println(debt);\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(debt);\n\t}\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt(), det = 100000;\n\t\tint rishi;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\trishi = (det/100) * 5;\n\t\t\tif(rishi%1000 == 0){\n\t\t\t\trishi /= 1000;\n\t\t\t} else {\n\t\t\t\trishi = (rishi/1000) +1;\n\t\t\t}\n\t\t\trishi *= 1000;\n\t\t\tdet += rishi;\n\t\t}\n\t\tSystem.out.println(det);\t\n\t}\n}", "import math\nn=int(input())\na=100000\nfor i in range(n):\n a=math.ceil(a*1.05/1000)*1000\nprint(a)\n", "ans = 100000\nn = int(raw_input())\nfor i in xrange(n):\n\tans *= 1.05\n\tans = int((ans+999)/1000)*1000;\nprint ans", "import sys\n\nfor line in sys.stdin:\n n = int(line)\n debt = 100000\n for k in range(n):\n debt *= 1.05\n if debt / 1000 - int(debt) / 1000 > 0:\n debt = (int(debt) / 1000 + 1) * 1000\n else:\n debt = int(debt)\n print debt", "#include <iostream>\nusing namespace std;\n\nint n, m = 100000;\n\nint main()\n{\n\tcin >> n;\n\n\tfor (int i = 0; i < n; i++)\n\t\tm += (m / 20 + 999) / 1000 * 1000;\n\n\tcout << m << endl;\n\n\treturn 0;\n}\n", "#include <iostream>\nusing namespace std;\nint main(void){\n int a;\n\tcin>>a;\n\tint i;\n\tint b=100000;\n\tfor(i = 0; i < a; i++){\n\tb=(b*1.05);\n\tb=(((b+999)/1000)*1000);\n\t}\n\tcout<<b<<endl;\n}\n\n", "import math\nmoney = int(100)\nfor i in range(int(input())):\n money *= 1.05\n money = math.ceil(money)\nprint(int(money) * 1000)\n", "n = int(raw_input())\ntotal = 100000\nfor i in range(1,n+1):\n total = total*1.05\n if total%1000!=0:\n total = int(total-total%1000 + 1000)\n else:\n total = int(total)\nprint total", "#include <iostream>\n#include <math.h>\nusing namespace std;\n\n\nint main(){\n\nint money=100000;\nint i,n;\n\ncin >> n;\n\nfor(i=0;i<n;i++){\nmoney*=1.05;\n\nif(money%1000!=0){\nmoney+=1000-(money%1000);\n}\n}\n\n\ncout << money << endl;\n\n}", "import java.util.*;\n\npublic class Main {\n static int fun(int n){\n int ans=100000;\n for(int i=0;i<n;i++){\n int x=(int)(ans*0.05),y=0;\n if (x%1000>0)y=1000;\n ans=ans+x+y-x%1000;\n }\n return ans;\n }\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n System.out.println(fun(sc.nextInt()));\n }\n}\n", "debt = 100000\nn = int(input())\nfor _ in range(n):\n\tdebt *= 1.05\n\tif debt % 1000 > 0:\n\t\tdebt += 1000 - debt % 1000\nprint(int(debt))\n", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n\t Scanner sc =new Scanner(System.in);\nint n=sc.nextInt();\n int money =100000;\n for(int i=0; i<n; i++){\n\t money*=1.05;\n if(money%1000!=0){money+=1000-money%1000;\n }\n }\n System.out.println(money);\n }\n }", "#include<bits/stdc++.h>\nusing namespace std;\nint main(void){\n\tint n;\n\tint sum;\n\tint i;\n\tcin>>n;\n\tsum=100000;\n\tfor(i=1;i<=n;i++){\n\t\tsum*=1.05;\n\t\tif(sum%1000)\tsum=sum-sum%1000+1000;\n\t}\n\tcout<<sum<<endl;\n\treturn 0;\n\t\n}\n", "#include <stdio.h>\nint main() {\n int i,n,m=100000;\n scanf(\"%d\",&n);\n for(i=0;i<n;i++) {\n m *= 1.05; if(m%1000) m+=1000;\n m/=1000; m*=1000;\n }\n printf(\"%d\\n\",m);\n}", "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n\tint m;\n\tint s=100000;\n\tcin>>m;\n\tfor(int i=0;i<m;i++){\n s = s*1.05;\n\t\tif(s%1000!=0)\n\t s = ((s/1000)+1)*1000;\n\t}\n\tcout<<s<<endl;\n return 0;\n}", "#include<iostream>\n\nusing namespace std;\n\nint main(void)\n{\n\tint n,ans;\n\tcin>>n;\n\tans=10*10000;\n\tfor(int i=1;i<=n;i++){\n\t\tans=ans*1.05;\n\t\tif(ans%1000!=0){\n\t\t\tans=ans-(ans%1000)+1000;\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "# -*- coding: utf-8 -*-\n\nimport math\n\nr = 100\nn = int ( input ( ) )\nfor i in range ( n ):\n r = math.ceil ( r * 1.05 )\nprint ( r * 1000 )", "import java.util.*;\npublic class Main \n{\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint n = stdIn.nextInt();\n\t\tint sum = 100000;\n\t\tfor(int i = 0; i < n; ++i)\n\t\t{\n\t\t\tsum *= 1.05;\n\t\t\tint remainder = sum % 1000;\n\t\t\tif(remainder > 0)\n\t\t\t{\n\t\t\t\tsum = sum - remainder + 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n}", "import java.util.Scanner;\n\n\nclass Main{\n public static void main(String[] args){\n\n double debt = 100000;\n double mo = 0.05;\n int turm = new Scanner(System.in).nextInt();\n while(turm>0){\n debt = debt*1.05;\n debt = Math.ceil(debt/1000)*1000;\n turm--;\n }\n System.out.println((int)debt);\n\n }\n}", "\nimport math\nimport sys\n\n\ndef debt(debt_s, week):\n if week == 0:\n return debt_s\n debt_s = int(math.ceil((debt_s * 1.05)/1000) * 1000)\n return debt(debt_s, week - 1)\n\n\nn = int(sys.stdin.readline())\n\ndebt_s = 100000\nprint debt(debt_s, n)", "import math\n\ndebt = 100\nfor i in range(int(input())):\n debt = math.ceil(debt*1.05)\n\nprint(debt*1000)", "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main()\n{\n int n, debt = 100;\n cin >> n;\n while(n-- > 0) debt = ceil(debt * 1.05);\n cout << debt * 1000 << endl;\n}", "import java.util.Scanner;\nimport java.math.BigDecimal;\n\nclass Main{\npublic static void main(String[] args){\nScanner sc=new Scanner(System.in);\nint w=sc.nextInt();\nint a=100000;\nfor(int i=0;i<w;i++){\na+=a/20;\nBigDecimal x=new BigDecimal(a);\nx=x.setScale(-3,BigDecimal.ROUND_UP);\na=x.intValue();\n}\nSystem.out.println(a);\n}\n}", "n = int(input())\na = 100000\nfor i in range(n):\n a = a + (a*0.05)\n if a%1000 != 0:\n a = a - (a%1000) + 1000\nprint(int(a))\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint n, ans;\n\tcin >> n;\n\n\tans = 100000;\n\tfor(int i=0; i<n; i++) {\n\t\tans *= 1.05;\n\t\tif(ans%1000 != 0) ans = (ans/1000+1)*1000;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}\n", "import math\na=100\nn=int(input())\nfor i in range(n):\n a=a*1.05\n a=math.ceil(a)\nprint(a*1000)\n", "import java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\tprivate static final int debt = 100000;\n\n\tpublic static void main(String[] a) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint len = sc.nextInt();\n\t\tsc.close();\n\t\tint debtSum = debt;\n\t\tfor (int i = 0; i < len; i++) {\n\t\t\tint no = 1000;\n\t\t\tdebtSum = (int) (Math.ceil((debtSum * 1.05) / no) * no);\n\t\t}\n\t\tSystem.out.println(debtSum);\n\t}\n}", "//0007: Debt Hell\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\n\t\t int week = Integer.parseInt(in.readLine());\n\n\t\t int debt = 100000;\n\t\t \n\t\t for(int i=0;i<week;i++){\n\t\t\t debt =(int)Math.ceil(debt*1.05/1000)*1000;\n\t\t }\n\n\t\t\tSystem.out.println(debt);\n\n\t}\n}", "from math import ceil\nn=int(input())\nmoney=100000\nfor i in range(n):\n money=ceil(money*1.05/1000)*1000\nprint(money)\n", "n= int(input())\ns= 100000\nfor i in range(n):\n s = s * 1.05\n if s % 1000:\n s = s - (s % 1000) + 1000\nprint(int(s))\n", "#include <stdio.h>\n\n\n\n\nint main(){\n\n int b=100000,n;\n scanf(\"%d\",&n);\n \n for(int i = 0;i<n;i++){\n b*=1.05;\n if(b%1000!=0)b=(b/1000+1)*1000;\n }\n\n printf(\"%d\\n\",b);\n\n return 0;\n}", "import java.util.Scanner;\n\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scn = new Scanner(System.in);\n\t\tint n = scn.nextInt();\n\t\tint debt = 100;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdebt = (int)Math.ceil(debt * 1.05);\n\t\t}\n\t\tSystem.out.println(debt * 1000);\n\t}\n\n}", "n , d = input() , 100000\nfor x in range(n):\n d += int(d*0.05)\n if d % 1000 != 0:\n d -= d % 1000\n d += 1000\nprint d", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n, t = 100000;\n\tcin >> n;\n\tfor( int i = 0; i < n; ++i){\n\t\tt = 1.05 * t;\n\t\tt = (t/1000)*1000 + ((t % 1000 != 0) ? 1000 : 0);\n\t}\n\tcout << t << \"\\n\";\n\treturn 0;\n}", "class Main{public static void main(String[]g)throws Exception{double y=1e5;int n=0,i;for(;(i=System.in.read())>32;n=n*10+i-48);for(i=1000;n-->0;y+=y%i>0?i-y%i:0)y*=1.05;System.out.println((int)y);}}\n", "a=100000\n\nfor i in range(int(input())):\n a *=1.05\n if a%1000 !=0:\n a=a-(a%1000)+1000\n \nprint(int(a))\n \n\n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint n = s.nextInt();\n\t\tdouble debt = 100000;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdebt += debt / 20;\n\t\t\tdouble r = debt % 1000;\n\t\t\tint v = (int)debt / 1000;\n\t\t\tdebt = 1000 * v ;\n\t\t\tdebt = r>0?debt+1000:debt;\n\t\t}\n\t\tSystem.out.println((int)debt);\n\t}\n}\n\n", "import sys\nw=int(input())\nbase=100000\nfor i in range(w):\n base=base*1.05\n if base%1000!=0:\n base=base-base%1000+1000\n \nprint(int(base))\n\n\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n // System.out.println(n);\n int k = 100000;\n for (int i = 0; i < n; i++) {\n k = 1000 * (int)Math.ceil(((double) k) * 1.05 / 1000);\n }\n System.out.println(k);\n }\n}", "n = int(input())\ns = 100000\nfor i in range(n):\n\ts*=1.05\n\tif s%1000 != 0:\n\t\ts += 1000-(s%1000)\nprint(int(s))", "#include<iostream>\n\nusing namespace std;\n\nint main(){\n\tint n,debt=100000;\n\tcin>>n;\n\twhile(n--){\n\t\tdebt=debt*1.05;\n\t\tdebt+=999;\n\t\tdebt/=1000;\n\t\tdebt*=1000;\n\t}\n\tcout<<debt<<endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\n\npublic class Main \n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner scanner = new Scanner(System.in);\n\t\t\n\t\tint n = scanner.nextInt();\n\t\t\n\t\tint money = 100000;\n\t\tfor(int i=0; i<n; i++)\n\t\t{\n\t\t\tmoney *= 1.05;\n\t\t\tint x = money%1000;\n\t\t\tif(x > 0)\n\t\t\t{\n\t\t\t\tmoney = money - x + 1000;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(money);\n\t}\n}", "#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nint main(){\n\tint a=100000,n;\n\tcin>>n;\n\tfor(int i=1;i<=n;++i){\n\t\ta*=1.05;\n\t\tif(a%1000>0){\n\t\t\ta/=1000;\n\t\t\ta++;\n\t\t\ta*=1000;\n\t\t}\n\t}\n\tcout<<a<<endl;\n\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n double l = 100000;\n for (int i = 1; i <= n; i++) {\n l *= 1.05;\n if (l%1000 != 0) {\n l += (1000 - (l%1000));\n }\n }\n System.out.println((long)l);\n }\n}", "debt = 100000\nfor i in range(0, input()):\n\tdebt *= 1.05\n\tdebt /= 1000\n\tif (debt - int(debt) != 0.0):\n\t\tdebt += 1\n\tdebt = int(debt) * 1000\nprint debt", "#include <cstdio>\n#include <cmath>\nusing namespace std;\n\nint main() {\n int n, a = 100000;\n scanf(\"%d\", &n);\n while (n--) {\n a += a * 5 / 100;\n a = (int)ceil(a / 1000.0) * 1000;\n }\n printf(\"%d\\n\", a);\n}\n", "import java.util.*;\n \npublic class Main {\n public static void main(String[] args) {\n \n //input\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int sum = 100000;\n for(int i=0;i<N;i++){\n sum *= 1.05;\n if(sum%1000 != 0){sum += 1000 - sum % 1000;}\n }\n \n //output\n System.out.println(sum);\n }\n}", "#include<stdio.h>\nint main(void)\n{\n int n,i,j,x;\n\tscanf(\"%d\",&n);\n i=100000;\n\tfor(j=0;j<n;j++){\n\t i=i*5/100+i;\n\t\tx=i%1000;\n\t\tif(x!=0){\n\t\t x=1000-x;\n\t\t\ti=i+x;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",i);\n\treturn 0;\n}", "n=int(input())\nz=100000\nfor i in range(n):\n z*=1.05\n if z%1000!=0:\n z-=z%1000\n z+=1000\nprint(int(z))\n", "#include<stdio.h>\n\nint main(){\n\tint C = 100000,n;\n\tscanf(\"%d\",&n);\n\tfor(int i = 0;i < n;i++){\n\t\tC = (C*21)/20;\n\t\tif(C%1000 > 0)\n\t\t\tC += 1000-C%1000;\n\t}\n\tprintf(\"%d\\n\",C);\n\treturn 0;\n}", "#include<iostream>\nint main(){int n,s=100000,i;std::cin>>n;for(i=0;i<n;i++)s*=1.05,s+=(1000-(s%1000==0?1000:s%1000));std::cout<<s<<\"\\n\";}", "#include<iostream>\nusing namespace std;\nint main(){\n int n,sum = 100000;\n cin >>n;\n while(n--){\n sum = (int)(sum*1.05);\n if(sum%1000){sum = (sum/1000)*1000+1000;}\n }\n cout <<sum<<endl;\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint week, yen=100000, hasuu;\n\tcin>>week;\n\twhile(week--){\n\t\tyen = yen*1.05;\n\t\tif(hasuu=yen%1000){\n\t\t\tyen += 1000-hasuu;\n\t\t}\n\t}\n\tcout << yen <<endl;\n\treturn 0;\n}", "s = 100000\nfor i in range(int(input())):\n s *= 1.05\n if s % 1000:\n s = s - (s % 1000) + 1000\nprint(int(s))\n\n", "n = input()\ndebt = 100000\nfor i in range(n):\n debt *= 1.05\n if(debt % 1000):\n debt -= debt % 1000\n debt += 1000\nprint(int(debt))", "import java.util.Scanner;\n \npublic class Main {\npublic static void main(String[] args) {\nScanner scn = new Scanner(System.in);\nint n = scn.nextInt();\nint a = 100;\nfor (int i = 0; i < n; i++) {\na = (int)Math.ceil(a * 1.05);\n}\nSystem.out.println(a * 1000);\n}\n}", "#include<iostream>\n#include<stdio.h>\n\nint main(){\n\tint n,i,a=100000,b;\n\tstd::cin>>n;\n\tfor(i=0;i<n;i++){\n\t\ta=a*1.05;\n\t\tif(a%1000!=0){\n\t\t\tb=a%1000;\n\t\t\tb=1000-b;\n\t\t\ta=a+b;\n\t\t\t}\n\t\t}\n\tstd::cout<<a<<std::endl;\n\n\t\n\t\n\treturn 0;\n\t}" ]
In a world, a mysterious snake made of only letters lives. Two types of snakes are currently identified, type A and type B, but there may be other types as well. For class A, after ">'" is followed by one or more "=", "#" comes, and after the same number of "=" as before, "~" (half-width tilde) finish. Class B ends with "~~" after "> ^" followed by one or more "Q =". Example of type A:>'==== # ==== ~>'== # == ~ Example of B type:> ^ Q = Q = Q = Q = ~~> ^ Q = Q = ~~ Receives a snake as character string data, determines what kind it is, and outputs "A" for type A, "B" for type B, and "NA" for other types. Please create a program to do. Input The input is given in the following format: n S1 S2 :: Sn The number of snakes identified on the first line n (1 ≤ n ≤ 10000), and the following n lines contain the i-th snake string Si (200 characters or less, without spaces) on each line. Is given to. Output Print the i-th snake type A, B or NA on line i. Example Input 3 >'======#======~ >^Q=Q=Q=Q=Q=Q=Q=Q=Q=~~ >'===#====~ Output A B NA
[ "#include<iostream>\n#include<regex>\n#include<string>\n\nint main()\n{\n\tint n;\n\tstd::cin >> n;\n\tstd::cin.ignore();\n\n\twhile( n-- )\n\t{\n\t\tstd::string s;\n\t\tstd::getline( std::cin, s );\n\n\t\tstd::smatch m;\n\t\tif( std::regex_match( s, m, std::regex( \">\\'(=+)#(=+)~\" ) ) && m[1].length() == m[2].length() )\n\t\t\tstd::cout << 'A' << std::endl;\n\t\telse if( std::regex_match( s, std::regex( \">^(Q=)+~~\" ) ) )\n\t\t\tstd::cout << 'B' << std::endl;\n\t\telse\n\t\t\tstd::cout << \"NA\" << std::endl;\n\t}\n\n\treturn 0;\n}", "import re\n\nSNAKE_A = re.compile(r\">'(=+)#\\1~\")\nSNAKE_B = re.compile(r\">\\^(Q=)+~~\")\n\n\ndef answer(regex, string, output):\n result = regex.fullmatch(string)\n\n if result is not None:\n print(output)\n else:\n print(\"NA\")\n\n\nfor _ in range(int(input())):\n\n snake = input()\n\n if snake[1] == \"'\":\n answer(SNAKE_A, snake, \"A\")\n else:\n answer(SNAKE_B, snake, \"B\")\n\n", "#include <bits/stdc++.h>\n#define rep(i,l,n) for(int i=l;i<n;i++)\n#define all(a) a.begin(),a.end()\n#define o(a) cout<<a<<endl\n#define int long long\nusing namespace std;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\n\nsigned main(){\n\tint n;\n\tcin>>n;\n\trep(i,0,n){\n\t\tstring s;\n\t\tcin>>s;\n\t\tint ans=0;\n\t\tint sz=s.size();\n\t\tif(sz<6){\n\t\t\tans=-1;\n\t\t}else if(s[0]=='>'&&s[1]=='\\''&&s[sz-1]=='~'&&sz%2==0&&s[sz/2]=='#'){\n\t\t\trep(i,2,sz-1){\n\t\t\t\tif(i!=sz/2&&s[i]!='='){\n\t\t\t\t\tans=-1; break;\n\t\t\t\t}\n\t\t\t\tif(i==sz-2) ans=1;\n\t\t\t}\n\t\t}else if(s[0]=='>'&&s[1]=='^'&&s[sz-2]=='~'&&s[sz-1]=='~'&&sz%2==0){\n\t\t\trep(i,2,sz-2){\n\t\t\t\tif(i%2==0&&s[i]!='Q'){\n\t\t\t\t\tans=-1; break;\n\t\t\t\t}if(i%2&&s[i]!='='){\n\t\t\t\t\tans=-1; break;\n\t\t\t\t}\n\t\t\t\tif(i==sz-3) ans=2;\n\t\t\t}\n\t\t}else{\n\t\t\tans=-1;\n\t\t}\n\t\tif(ans==-1) o(\"NA\");\n\t\telse if(ans==1) o(\"A\");\n\t\telse if(ans==2) o(\"B\");\n\t}\t\n}", "#include<iostream>\n\nusing namespace std;\n\nstring in;\n\nint isA(){\n if(in.length() < 5) return 0;\n if(in[0] != '>') return 0;\n if(in[1] != '\\'') return 0;\n if(!(in[in.length()-1] == '~' && in[in.length()-2] == '=')) return 0;\n int data[2] = {0,0};\n int status = 0;\n for(int i = 2; i < in.length()-1; i++){\n if(in[i] == '#') status = 1;\n if(in[i] == '=') data[status]++;\n if(in[i] != '#' && in[i] != '=') return 0;\n }\n if(data[0] && data[0] == data[1]) return 1;\n return 0;\n}\n\nint isB(){\n if(in.length() < 5) return 0;\n if(in[0] != '>') return 0;\n if(in[1] != '^') return 0;\n if(!(in[in.length()-1] == '~' && in[in.length()-2] == '~')) return 0;\n for(int i = 2; i < in.length()-2; i+=2){\n if(!(in[i] == 'Q' && in[i+1] == '=')) return 0;\n }\n return 1;\n}\n\n\nint main(){\n int num;\n cin >> num;\n for(int i = 0; i < num; i++){\n cin >> in;\n if(isA()) cout << \"A\" << endl;\n else if(isB()) cout << \"B\" << endl;\n else cout << \"NA\" << endl;\n }\n return 0;\n}", "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nint a;\nbool check(const string st,const int isa) {\n\ta = 0;\n\tif (isa) {\n\t\tif (st[a] != '>')return false;\n\t\ta++;\n\t\tif (st[a] != '\\'')return false;\n\t\ta++;\n\t\tint num = 0;\n\t\twhile (st[a] == '=') {\n\t\t\tnum++;\n\t\t\ta++;\n\t\t}\n\t\tif (!num)return false;\n\t\tif (st[a] != '#')return false;\n\t\ta++;\n\t\tint num2 = 0;\n\t\twhile (st[a] == '=') {\n\t\t\tnum2++;\n\t\t\ta++;\n\t\t}\n\t\tif (num != num2)return false;\n\t\tif (st[a] != '~')return false;\n\t\ta++;\n\t\tif (st[a] != ' ')return false;\n\t\treturn true;\n\t}\n\telse {\n\t\tif (st[a] != '>')return false;\n\t\ta++;\n\t\tif (st[a] != '^')return false;\n\t\ta++;\n\t\tint num = 0;\n\t\twhile (1) {\n\t\t\tif (st[a] == 'Q') {\n\t\t\t\tnum++;\n\t\t\t\ta++;\n\t\t\t\tif (st[a] != '=') {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ta++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!num)return false;\n\t\t\n\t\t\n\t\tif (st[a] != '~')return false;\n\t\ta++;\n\t\tif (st[a] != '~')return false;\n\t\ta++;\n\t\tif (st[a] != ' ')return false;\n\t\treturn true;\n\t}\n}\n\nint main() {\n\tint N; cin >> N;\n\twhile (N--) {\n\t\tstring st; cin >> st;\n\t\tfor (int i = 0; i < 100; ++i) {\n\n\t\t\tst.push_back(' ');\n\t\t}\n\t\tif (check(st, true)) {\n\t\t\tcout << \"A\" << endl;\n\t\t}\n\t\telse if (check(st, false)) {\n\t\t\tcout << \"B\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n;\n\n\t\tn = sc.nextInt();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString snake = sc.next();\n\t\t\tString answer = \"NA\";\n\t\t\tint index = 0;\n\t\t\tif (6 <= snake.length()) {\n\t\t\t\tif (snake.charAt(0) == '>' && snake.charAt(snake.length() - 1) == '~') {\n\t\t\t\t\tsnake = snake.substring(1, snake.length() - 1);\n\t\t\t\t\tif (snake.charAt(0) == '\\'') {\n\t\t\t\t\t\tsnake = snake.substring(1);\n\t\t\t\t\t\tif (snake.length() % 2 == 1) {\n\t\t\t\t\t\t\tanswer = \"A\";\n\t\t\t\t\t\t\tfor (int j = 0; j < snake.length(); j++) {\n\t\t\t\t\t\t\t\tif (j == snake.length() / 2 && snake.charAt(j) != '#') {\n\t\t\t\t\t\t\t\t\tanswer = \"NA\";\n\t\t\t\t\t\t\t\t} else if (j != snake.length() / 2 && snake.charAt(j) != '=') {\n\t\t\t\t\t\t\t\t\tanswer = \"NA\";\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (snake.charAt(0) == '^' && snake.charAt(snake.length() - 1) == '~') {\n\t\t\t\t\t\tsnake = snake.substring(1, snake.length() - 1);\n\t\t\t\t\t\tif (snake.length() % 2 == 0) {\n\t\t\t\t\t\t\tanswer = \"B\";\n\t\t\t\t\t\t\tfor (int j = 0; j < snake.length(); j++) {\n\t\t\t\t\t\t\t\tif (j % 2 == 0 && snake.charAt(j) != 'Q') {\n\t\t\t\t\t\t\t\t\tanswer = \"NA\";\n\t\t\t\t\t\t\t\t} else if (j % 2 == 1 && snake.charAt(j) != '=') {\n\t\t\t\t\t\t\t\t\tanswer = \"NA\";\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(answer);\n\t\t}\n\t}\n}", "#include <iostream>\n#include <string>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\t\n\trep(i,n)\n\t{\n\t\tstring s;\n\t\tcin >> s;\n\n\t\tif(s[0] == '>' && s[1] == '\\'' && s[2] == '=')\n\t\t{\n\t\t\tint i = 2;\n\t\t\tint cnt = 0;\n\t\t\twhile(s[i] == '=')\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\tcnt++;\n\t\t\t}\n\n\t\t\tif(s[i] == '#' && i < s.size())\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\twhile(s[i] == '=')\n\t\t\t\t{\n\t\t\t\t\tif(i == s.size()-1) break;\n\t\t\t\t\ti++;\n\t\t\t\t\tcnt--;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(cnt == 0 && s[i] == '~') cout << \"A\" << endl;\n\t\t\telse cout << \"NA\" << endl;\n\t\t}\n\t\telse if(s[0] == '>' && s[1] == '^' && s[2] == 'Q')\n\t\t{\n\t\t\tint i = 2;\n\t\t\tint cnt = 0;\n\t\t\tbool end = false;\n\t\t\twhile(i+1 < s.size())\n\t\t\t{\n\t\t\t\tif(s[i] == 'Q' && s[i+1] == '=')\n\t\t\t\t{\n\t\t\t\t\ti += 2;\n\t\t\t\t}\n\t\t\t\telse if(s[i] == '~' && s[i+1] == '~')\n\t\t\t\t{\n\t\t\t\t\tend = true;\n\t\t\t\t\tcout << \"B\" << endl;\n\t\t\t\t\ti += 2;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!end) cout << \"NA\" << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n\nstring solve(string s){\n if(s.substr(0,2)==\">'\"){\n int eq=0;\n for(int i=2;i<s.size();i++){\n if(s[i]!='=')break;\n else{\n eq++;\n }\n }\n \n if(eq==0)return \"NA\";\n \n if( s[ (2 + eq -1) +1 ] != '#')return \"NA\";\n \n if( s.substr( ((2+eq-1)+1) +1 ,eq ) != s.substr( 2,eq ) )return \"NA\";\n\n if( 2+eq+1+eq+1 == s.size() && s[ (2+eq+1+eq+1) -1 ]=='~')return \"A\";\n \n }else if(s.substr(0,2)==\">^\"){\n int c=2;\n while( s[c]=='Q' && s[c+1]=='=' ){\n c+=2;\n }\n if(c==2)return \"NA\";\n \n \n if( c+1==s.size()-1 && s[c]=='~' && s[c+1]=='~')return \"B\";\n else return \"NA\";\n \n \n }else return \"NA\";\n\n return \"NA\";\n}\n\n\nint main(){\n int n;\n cin>>n;\n rep(i,n){\n string s;\n cin>>s;\n \n cout<<solve(s)<<endl;\n }\n\n return 0;\n}", "\n//include\n//------------------------------------------\n#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <deque>\n#include <queue>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <tuple>\n\nusing namespace std;\n\n//conversion\n//------------------------------------------\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\n\n//math\n//-------------------------------------------\ntemplate<class T> inline T sqr(T x) {return x*x;}\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef long long LL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define MT make_tuple\n#define SZ(a) int((a).size())\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n//constant\n//--------------------------------------------\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst int DX[] = {0, 1, 0, -1};\nconst int DY[] = {-1, 0, 1, 0};\n\n//other\n//--------------------------------------------\n#define RANGE(a, c, b) ((a <= b) && (b < c))\n\n//clear memory\n#define CLR(a) memset((a), 0 ,sizeof(a))\n\n//debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\nint solve(string snake){\n\tif(snake[0] != '>') return 0;\n\tif(snake[1] == '\\''){\n\t\tint i = 2;\n\t\twhile(snake[i] == '='){\n\t\t\ti++;\n\t\t}\n\t\tif(snake[i] != '#') return 0;\n\t\tint length = i - 2;\n\t\ti++;\n\t\twhile(snake[i] == '='){\n\t\t\ti++;\n\t\t}\n\t\tint length2 = i -3 - length;\n\t\tif(length2 != length) return 0;\n\t\tif(length > 0 &&\n\t\t\tsnake[i] == '~' && \n\t\t\ti == snake.length() - 1){\n\t\t\treturn 1;\n\t\t}\n\t}else if(snake[1] == '^'){\n\t\tint i = 2;\n\t\tint length = 0;\n\t\twhile(snake[i] =='Q' &&\n\t\t\tsnake[i + 1] == '='){\n\t\t\ti += 2;\n\t\t\tlength++;\n\t\t}\n\t\tif(length > 0 &&\n\t\t\tsnake[i] == '~' &&\n\t\t\tsnake[i + 1] == '~' &&\n\t\t\ti + 1 == snake.length() - 1){\n\t\t\treturn 2;\n\t\t}\n\t}\n\treturn 0;\n}\n\nint main(int argc, char const *argv[])\n{\n\tint n;\n\tcin >> n;\n\tREP(i, n){\n\t\tstring snake;\n\t\tcin >> snake;\n\t\tstring ans;\n\t\tswitch(solve(snake)){\n\t\t\tcase 0:\n\t\t\tans = \"NA\";\n\t\t\tbreak;\n\n\t\t\tcase 1:\n\t\t\tans = \"A\";\n\t\t\tbreak;\n\n\t\t\tcase 2:\n\t\t\tans = \"B\";\n\t\t\tbreak;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}", "import re\n\nA = \">'(=+)#\\\\1~$\"\nB = \">\\^(Q=)+~~$\" \n\nfor i in range(int(input())):\n s = input()\n r = re.match(A, s)\n if re.match(A, s): print('A')\n elif re.match(B, s): print('B')\n else: print('NA')\n\n\n", "import re\nsnakeA = re.compile('>\\'(=+)#\\\\1~$')\nsnakeB = re.compile('>\\^(Q=)+~~$')\nfor i in xrange(input()):\n s = raw_input()\n if snakeA.match(s) is not None:\n print \"A\"\n elif snakeB.match(s) is not None:\n print \"B\"\n else:\n print \"NA\"", "import re\n\nptn_A = r'>\\'(=+)#(=+)~'\nptn_B = r'>\\^(Q=)+~~'\n\nfor i in range(int(raw_input())):\n snake = raw_input()\n matchA = re.search(ptn_A, snake)\n matchB = re.search(ptn_B, snake)\n if matchA and matchA.group(1) == matchA.group(2):\n print 'A'\n elif matchB:\n print 'B'\n else:\n print 'NA'", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint stateA,stateB;\nint anum;\n\nvoid inA(char arg){\n\t//cout << stateA << endl;\n\tif(stateA == 0){\n\t\tif(arg == '>'){\n\t\t\tstateA = 1;\n\t\t}\n\t}else if(stateA == 1){\n\t\tif(arg == '\\''){\n\t\t\tstateA = 2;\n\t\t}else{\n\t\t\tstateA = -1;\n\t\t}\n\t}else if(stateA == 2){\n\t\tif(arg == '='){\n\t\t\tstateA = 3;\n\t\t\tanum++;\n\t\t}else{\n\t\t\tstateA = -1;\n\t\t}\n\t}else if(stateA == 3){\n\t\tif(arg == '='){\n\t\t\tanum++;\n\t\t}else if(arg == '#'){\n\t\t\tstateA = 4;\n\t\t}else{\n\t\t\tstateA = -1;\n\t\t}\n\t}else if(stateA == 4){\n\t\tif(arg == '='){\n\t\t\tanum--;\n\t\t}else{\n\t\t\tstateA = -1;\n\t\t}\n\t\tif(anum==0){\n\t\t\tstateA = 5;\n\t\t}\n\t}else if(stateA == 5){\n\t\tif(arg == '~'){\n\t\t\tstateA = 6;\n\t\t}else{\n\t\t\tstateA = -1;\n\t\t}\n\t}else if(stateA == 6){\n\t\tstateA = -1;\n\t}\n}\n\nvoid inB(char arg){\n\tif(stateB == 0){\n\t\tif(arg == '>'){\n\t\t\tstateB = 1;\n\t\t}else{\n\t\t\tstateB = -1;\n\t\t}\n\t}else if(stateB == 1){\n\t\tif(arg == '^'){\n\t\t\tstateB = 2;\n\t\t}else{\n\t\t\tstateB = -1;\n\t\t}\n\t}else if(stateB == 2){\n\t\tif(arg == 'Q'){\n\t\t\tstateB = 3;\n\t\t}else{\n\t\t\tstateB = -1;\n\t\t}\n\t}else if(stateB == 3){\n\t\tif(arg == '='){\n\t\t\tstateB = 4;\n\t\t}else{\n\t\t\tstateB = -1;\n\t\t}\n\t}else if(stateB == 4){\n\t\tif(arg == 'Q'){\n\t\t\tstateB = 5;\n\t\t}else if(arg == '~'){\n\t\t\tstateB = 6;\n\t\t}else{\n\t\t\tstateB = -1;\n\t\t}\n\t}else if(stateB == 5){\n\t\tif(arg == '='){\n\t\t\tstateB = 4;\n\t\t}else{\n\t\t\tstateB = -1;\n\t\t}\n\t}else if(stateB == 6){\n\t\tif(arg == '~'){\n\t\t\tstateB = 7;\n\t\t}else{\n\t\t\tstateB = -1;\n\t\t}\n\t}else if(stateB == 7){\n\t\tstateB = -1;\n\t}\n}\n\nint main(){\n\tint n;\n\tstring str;\n\t\n\tcin >> n;\n\tcin.ignore();\n\twhile(n && getline(cin,str)){\n\t\tstateA=0;\n\t\tstateB=0;\n\t\tanum=0;\n\t\tbool A=false, B=false;\n\t\t\n\t\tint l = str.size();\n\t\tfor(int i=0;i<l;i++){\n\t\t\tinA(str[i]);\n\t\t\tinB(str[i]);\n\t\t}\n\t\tif(stateA == 6){\n\t\t\tcout << \"A\" << endl;\n\t\t}else if(stateB == 7){\n\t\t\tcout << \"B\" << endl;\n\t\t}else{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\t\n\t\tn--;\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n; cin >> n;\n \n for (int i=0; i<n; i++) {\n string S; cin >> S;\n \n if (S.size()<4) {\n cout << \"NA\" << endl;\n continue;\n }\n \n if (S.substr(0, 2)==\">'\" && S[S.size()-1]=='~') {\n int mark = -1;\n for (int j=2; j<S.size()-1; j++) {\n if (S[j]=='#') mark = j;\n }\n bool flag = true;\n for (int j=2; j<S.size()-1; j++) {\n if (j==mark) continue;\n if (S[j]!='=') flag = false;\n }\n if (flag && mark!=-1 && mark-2==S.size()-2-mark && mark-2>0) cout << 'A' << endl;\n else cout << \"NA\" << endl;\n }\n else if (S[0]=='>' && S[1]=='^' && S[S.size()-2]=='~' && S[S.size()-1]=='~') {\n int idx = 2, cnt = 0;\n while (true) {\n if (S[idx]=='Q' && S[idx+1]=='=') {\n cnt++;\n idx += 2;\n }\n else break;\n }\n if (cnt>0 && idx==S.size()-2) cout << 'B' << endl;\n else cout << \"NA\" << endl;\n }\n else cout << \"NA\" << endl;\n }\n}\n", "import re\nfor i in range(int(input())):\n s=input()\n if re.match(\">'(=+)#(=+)~\",s):print('A')\n elif re.match(\">\\^(Q=)+~~\",s):print('B')\n else:print('NA')\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0; i<(n); i++)\n#define REP2(i,x,n) for(int i=x; i<(n); i++) \n#define ALL(n) begin(n),end(n)\nstruct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;\nint check( string S )\n{\n //A\n if( S[ 0 ] == '>' && S[ 1 ] == '\\'' && S[ S.size() - 1 ] == '~' && S.size() >= 6 )\n {\n S = S.substr( 2, S.size() - 3 );\n if( S.find_first_not_of( \"#=\", 0 ) != string::npos ) return 0;\n string tmpB = S.substr( 0, S.find('#') );\n string tmpA = S.substr( S.find( '#' ) + 1, S.size() - 1 );\n return tmpB.size() == tmpA.size() ? 1 : 0;\n }\n //B\n if( S[ 0 ] == '>' && S[ 1 ] == '^' && S[ S.size() - 1 ] == '~' && S[ S.size() - 2 ] == '~' && S.size() >= 6 )\n {\n S = S.substr( 2, S.size() - 4 );\n if( S.find_first_not_of( \"Q=\", 0 ) != string::npos ) return 0;\n if( S.size() % 2 != 0 ) return 0;\n for( int i = 0; i < S.size(); i += 2 )\n {\n if( S[ i ] != 'Q' && S[ i + 1 ] != '=' ) return 0;\n }\n return 2;\n }\n return 0;\n}\nint main()\n{\n int N;\n cin >> N;\n \n vector<string> res{ \"NA\", \"A\", \"B\" };\n string S;\n while( cin >> S )\n {\n cout << res[ check( S ) ] << endl;\n }\n return 0;\n}", "#define _USE_MATH_DEFINES\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<double,int> P;\n\nstatic const double eps = 10e-9;\n\nbool isA(string str){\n\tif(str.size() >= 1 && str[0] != '>') return false;\n\tif(str.size() >= 2 && str[1] != '\\'') return false;\n\n\tint hist[] = {0,0};\n\tfor(int i=2,j=0;i<str.size()-1;i++){\n\t\tif(str[i] == '='){\n\t\t\thist[j]++;\n\t\t}\n\t\telse if(str[i] == '#') j++;\n\t\telse return false;\n\t}\n\n\tif(hist[0] != hist[1]) return false;\n\tif(hist[0] == 0 || hist[1] == 0) return false;\n\tif(str[str.size()-1] != '~') return false;\n\n\treturn true;\n\n}\n\nbool isB(string str){\n\tif(str.size() >= 1 && str[0] != '>') return false;\n\tif(str.size() >= 2 && str[1] != '^') return false;\n\n\tif(str.size() <= 3) return false;\n\n\tstring rear = str.substr(2,str.size()-2);\n\n\tbool isok=false;\n\tint i;\n\tfor(i=0;i+1<rear.size();){\n\t\tif(rear.substr(i,2) == \"Q=\"){\n\t\t\tisok=true;\n\t\t\ti+=2;\n\t\t}\n\t\telse break;\n\t}\n\n\treturn (i+2 == rear.size() && isok && rear.substr(i,2) == \"~~\");\n}\n\nint main(){\n\tint n;\n\twhile(~scanf(\"%d\",&n)){\n\t\tfor(int i=0;i<n;i++){\n\t\t\tstring str;\n\t\t\tcin >> str;\n\n\t\t\tif(isA(str)) cout << \"A\" << endl;\n\t\t\telse if(isB(str)) cout << \"B\" << endl;\n\t\t\telse cout << \"NA\" << endl;\n\t\t}\n\t}\n\t\n}", "#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#include <stdio.h>\n#include <ctype.h>\n#include <string>\n#include <iostream>\n#include <vector>\n#include <stack>\n#include <fstream>\n#include <sstream>\n#include <queue>\n#include <exception>\n#include <cmath>\n#include <numeric>\n#include <map>\n#include <algorithm>\n#include <bitset>\n#include <set>\n#include <functional>\n\n#define FOR(i,a,b) for (int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define RREP(i,n) for (int i=(n)-1;i>=0;i--)\n\nusing namespace std;\ntypedef long long int lint;\n\nvoid AOJ0139()\n{\n\tstring snake;\n\tcin >> snake;\n\tif (snake[0] != '>') {\n\t\tcout << \"NA\" << endl;\n\t\treturn;\n\t}\n\t//A\n\tif (snake[1] == '\\'') {\n\t\tif (snake[2] != '=') {\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t\tint eq_count = 0;\n\t\tint pos = 2;\n\t\twhile (snake[pos] == '=') {\n\t\t\teq_count++;\n\t\t\tpos++;\n\t\t}\n\t\tif (snake[pos] != '#') {\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t\tpos++;\n\t\tFOR(i, pos, pos + eq_count) {\n\t\t\tif (snake[i] != '=') {\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tpos += eq_count;\n\t\tif (snake.substr(pos) != \"~\") {\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t\tcout << \"A\" << endl;\n\t\treturn;\n\t}\n\t//B\n\tif (snake[1] == '^') {\n\t\tint Q_count = 0;\n\t\tint pos = 2;\n\t\tif (snake.substr(pos, 2) != \"Q=\") {\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t\twhile (snake.substr(pos, 2) == \"Q=\") {\n\t\t\tpos += 2;\n\t\t}\n\t\tif (snake.substr(pos) != \"~~\") {\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t\tcout << \"B\" << endl;\n\t\treturn;\n\t}\n\tcout << \"NA\" << endl;\n\treturn;\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tREP(i, n) AOJ0139();\n\n\treturn 0;\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nstring repeat(int n, string s) {\n string res = \"\";\n for (int i=0; i<n; ++i)\n res += s;\n return res;\n}\n\nint main() {\n int N; cin >> N;\n for (int i=0; i<N; ++i) {\n string snake; cin >> snake;\n\n int len = snake.size();\n if (len <= 4) {\n cout << \"NA\" << endl;\n continue;\n }\n\n string A = \">'\" + repeat((len - 4)/2, \"=\") \n + \"#\" + repeat((len - 4)/2, \"=\") + \"~\";\n string B = \">^\" + repeat((len - 4)/2, \"Q=\") + \"~~\";\n\n if (snake == A) {\n cout << \"A\" << endl;\n } else if (snake == B) {\n cout << \"B\" << endl;\n } else {\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}", "import java.util.Scanner;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\twhile (n != 0) {\n\t\t\tn--;\n\t\t\tchar[] snake = sc.next().toCharArray();\n\t\t\tString ans = isSnakeA(snake) ? \"A\" : isSnakeB(snake) ? \"B\" : \"NA\";\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\tprivate static boolean isSnakeA(char[] snake) {\n\t\tString sa = \"^>'(=+)#\\\\1~$\";\n\t\tPattern pa = Pattern.compile(sa);\n\t\tMatcher ma = pa.matcher(String.valueOf(snake));\n\t\treturn ma.find();\n\t}\n\n\tprivate static boolean isSnakeB(char[] snake) {\n\t\tString sb = \"^>\\\\^(Q=)+~~$\";\n\t\tPattern pb = Pattern.compile(sb);\n\t\tMatcher mb = pb.matcher(String.valueOf(snake));\n\t\treturn mb.find();\n\t}\n}", "\nimport java.util.*;\nimport java.util.regex.Pattern;\npublic class Main {\n\n\tpublic void doIt(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tfor(int i=0; i < n; i++){\n\t\t\tString str = sc.next();\n\t\t\tboolean result = Pattern.matches(\">'(=+)#(=)+\\\\~\", str);\n\t\t\tif(result){\n\t\t\t\tString str1 = str.replaceAll(\">'(=+)#=+\\\\~\", \"$1\");\n\t\t\t\tString str2 = str.replaceAll(\">'=+#(=+)\\\\~\", \"$1\");\n\t\t\t\tif(str1.length() == str2.length()){\n\t\t\t\t\tSystem.out.println(\"A\");\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tresult = Pattern.matches(\">\\\\^(Q=)+\\\\~\\\\~\", str);\n\t\t\t\tif(result)\n\t\t\t\t\tSystem.out.println(\"B\");\n\t\t\t\telse\n\t\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t}\n\t\t}\n\n\t}\n\tpublic static void main(String[] args) {\n\t\tMain obj = new Main();\n\t\tobj.doIt();\n\n\t}\n\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint n;\tcin >> n;\n\twhile(n--){\n\t\tint i,eq1,eq2;\n\t\tstring ret = \"NA\";\n\t\t\n\t\tstring s; cin >> s;\n\t\tif(s.substr(0,3) == \">'=\"){\n\t\t\ti = 2;\n\t\t\t\n\t\t\teq1 = 0;\n\t\t\twhile(s[i] == '=' && i < s.length() )i++,eq1++;\n\t\t\tif(s[i] != '#')goto label;\n\t\t\t\n\t\t\ti++; eq2 = 0;\n\t\t\twhile(s[i] == '=' && i < s.length() )i++,eq2++;\n\t\t\t\n\t\t\tif(i == s.length()-1 && s[i] == '~' && eq1 == eq2)\n\t\t\t\tret = \"A\"; \n\t\t}else if(s.substr(0,4) == \">^Q=\"){\n\t\t\tfor(i=2;i+1<s.length()-2;i+=2){\n\t\t\t\tif(s[i] == 'Q' && s[i+1] == '='){}\n\t\t\t\telse goto label;\n\t\t\t}\n\t\t\tif(s[s.length()-1] == '~' && s[s.length()-2] == '~' && s[s.length()-3] == '=' && s[s.length()-4] == 'Q')\n\t\t\t\tret = \"B\";\n\t\t\t\n\t\t}\n\t\tlabel:;\n\t\tcout << ret << endl;\n\t\t\n\t\t\n\t}\n}", "#include <iostream>\n//#include <fstream>\n\n#define NA cout << \"NA\" << endl; goto LABEL\n\nusing namespace std;\n\nint main() {\n\t//ifstream fin(\"in.txt\");\n\n\tint snakeCount;\n\tcin >> snakeCount;\n\n\tfor(int loopCount = 0; loopCount < snakeCount; loopCount++) {\n\t\tchar arr[202];\n\t\tcin >> arr;\n\t\tint i = 0;\n\n\t\tif(arr[i]!='>') {\n\t\t\tNA;\n\t\t}\n\t\ti++;\n\n\t\tif(arr[i]=='\\'') {\n\t\t\tint equalCount = 0;\n\t\t\tbool mode = false;\n\t\t\tfor(int j = i+1; j < 202; j++) {\n\t\t\t\tif(arr[j]=='=') {\n\t\t\t\t\tif(!mode) {\n\t\t\t\t\t\tequalCount++;\n\t\t\t\t\t}else {\n\t\t\t\t\t\tequalCount--;\n\t\t\t\t\t}\n\t\t\t\t}else if(arr[j]=='#') {\n\t\t\t\t\tif(!mode && equalCount>0) {\n\t\t\t\t\t\tmode = !mode;\n\t\t\t\t\t}else {\n\t\t\t\t\t\tNA;\n\t\t\t\t\t}\n\t\t\t\t}else if(arr[j]=='~') {\n\t\t\t\t\tif(arr[j+1]=='\\0'&&equalCount==0&&mode) {\n\t\t\t\t\t\tcout << \"A\" << endl;\n\t\t\t\t\t\tgoto LABEL;\n\t\t\t\t\t}else {\n\t\t\t\t\t\tNA;\n\t\t\t\t\t}\n\t\t\t\t}else {\n\t\t\t\t\tNA;\n\t\t\t\t}\n\t\t\t}\n\t\t}else if(arr[i]=='^') {\n\t\t\tint count = 0;\n\t\t\tfor(int j = i+1; j < 202; j++) {\n\t\t\t\tif(arr[j]=='Q'&&arr[j+1]=='=') {\n\t\t\t\t\tj++;\n\t\t\t\t\tcount++;\n\t\t\t\t\tcontinue;\n\t\t\t\t}else if(arr[j]=='~'&&arr[j+1]=='~'&&arr[j+2]=='\\0'&&count>0) {\n\t\t\t\t\tcout<< \"B\" << endl;\n\t\t\t\t\tgoto LABEL;\n\t\t\t\t}else {\n\t\t\t\t\tNA;\n\t\t\t\t}\n\t\t\t}\n\t\t}else {\n\t\t\tNA;\n\t\t}\n\t\tLABEL:;\n\t}\n\n\treturn 0;\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nbool isA( string& s )\n{\n\tint ptr = 0;\n\tif( s.size() < 6 || s[ 0 ] != '>' || s[ 1 ] != '\\'' || s[ s.size() - 1 ] != '~' ){\n\t\treturn false;\n\t}\n\tptr = 2;\n\twhile( ptr < s.size() - 1 && s[ ptr ] == '=' ){\n\t\t++ptr;\n\t}\n\tif( s[ ptr ] != '#' ){\n\t\treturn false;\n\t}\n\tint halfLength = ptr - 2;\n\tif( s.size() != 4 + halfLength * 2 ){\n\t\treturn false;\n\t}\n\t++ptr;\n\tfor( int i = 0; i < halfLength; ++i, ++ptr ){\n\t\tif( s[ ptr ] != '=' ){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isB( string& s )\n{\n\tint ptr = 0;\n\tif( s.size() < 6 || s[ 0 ] != '>' || s[ 1 ] != '^' || s[ s.size() - 1 ] != '~' || s[ s.size() - 2 ] != '~' ){\n\t\treturn false;\n\t}\n\tint restLength = s.size() - 4;\n\tif( restLength % 2 > 0 ){\n\t\treturn false;\n\t}\n\tptr = 2;\n\twhile( ptr < restLength + 2 ){\n\t\tif( s[ ptr ] != 'Q' || s[ ptr + 1 ] != '=' ){\n\t\t\treturn false;\n\t\t}\n\t\tptr += 2;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint n;\n\n\twhile( cin >> n ){\n\t\tfor( int i = 0; i < n; ++i ){\n\t\t\tstring snake;\n\t\t\tcin >> snake;\n\n\t\t\tstring result;\n\t\t\tif( isA( snake ) ) result = \"A\";\n\t\t\telse if( isB( snake ) ) result = \"B\";\n\t\t\telse result = \"NA\";\n\n\t\t\tcout << result << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n \n int Tc; cin >> Tc;\n \n while(Tc--) {\n string S; cin >> S;\n \n LA:\n {\n string s = S;\n \n if(s.size() < 6) goto BAD;\n if(s.substr(0, 3) != \">'=\") goto LB;\n if(s[s.size()-1] != '~') goto BAD;\n \n s = s.substr(2);\n s = s.substr(0,s.size()-1);\n \n int pos = -1;\n int const size = s.size();\n int cnt = 0;\n for(int i=0; i<size; i++) {\n\tif(s[i] == '=') cnt++;\n\telse if(s[i] == '#') { pos = i; break; }\n\telse goto BAD;\n }\n if(pos == -1) goto BAD;\n if(2*cnt+1 != s.size()) goto BAD;\n \n for(int i=cnt+1; i<2*cnt+1; i++) {\n\tif(s[i] != '=') goto BAD;\n }\n \n cout << \"A\" << endl; goto EXIT;\n }\n \n LB:\n {\n string s = S;\n \n if(s.substr(0, 2) != \">^\") goto BAD;\n if(s.substr(s.size()-2) != \"~~\") goto BAD;\n \n s = s.substr(2);\n s = s.substr(0, s.size()-2);\n \n if(s.size() % 2 || s.empty()) goto BAD;\n \n int const size = s.size();\n for(int i=0; i<size; i+=2) {\n\tif(!(s[i] == 'Q' && s[i+1] == '=')) goto BAD;\n }\n \n cout << \"B\" << endl; goto EXIT;\n }\n \n BAD:;\n cout << \"NA\" << endl;\n \n EXIT:;\n }\n \n return 0;\n}", "def snakeA(s):\n if s.startswith(\">'\") and s.endswith(\"~\"):\n if s.count(\"#\")==1:\n t=s[2:-1].split(\"#\")\n if len(t)==2 and t[0]==t[1]:\n if set(list(t[0]))==set(list(t[1]))==set([\"=\"]):\n return True\n return False\n\ndef snakeB(s):\n if s.startswith(\">^\") and s.endswith(\"~~\"):\n t=s[2:-2].split(\"Q=\")\n if len(t)>1 and set(t)==set([\"\"]):\n return True\n return False\n\nfor i in range(input()):\n s=raw_input()\n if snakeA(s):\n print \"A\"\n elif snakeB(s):\n print \"B\"\n else:\n print \"NA\"", "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int n;\n cin>>n;\n for (int i=0;i<n;i++) {\n string s;\n cin>>s;\n if (s.size()<6||s.size()%2!=0){\n cout<<\"NA\"<<endl;\n } else {\n if (s.at(0)=='>'&&s.at(1)=='\\''&&s.at(s.size()-1)=='~') {\n string tmp=s.substr(2,s.size()-3);\n string front=tmp.substr(0,(tmp.size()-1)/2);\n string back=tmp.substr((tmp.size()+2)/2,(tmp.size()-1)/2);\n if (front==back) {\n cout<<\"A\"<<endl;\n } else {\n cout<<\"NA\"<<endl;\n }\n } else if (s.at(0)=='>'&&s.at(1)=='^'&&s.at(s.size()-1)=='~'&&s.at(s.size()-2)=='~') {\n string center=s.substr(2,s.size()-4);\n for (int j=0;j<center.size();j+=2) {\n if (center.at(j)!='Q'||center.at(j+1)!='=') {\n cout<<\"NA\"<<endl;\n break;\n }\n if (j==center.size()-2) {\n cout<<\"B\"<<endl;\n }\n }\n } else {\n cout<<\"NA\"<<endl;\n }\n }\n }\n}\n", "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstring>\n#include <sstream>\n#include <cassert>\nusing namespace std;\nstatic const double EPS = 1e-5;\ntypedef long long ll;\ntypedef pair<int,int> PI;\ntypedef vector<int> vi;\n#define rep(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n#define mp make_pair\n#define pb push_back\n#define f first\n#define s second\n\nint main(){\n string hebi;\n int n;\n cin>>n;\n while(n--){\n cin>>hebi;\n bool a=true,b=true;\n if(hebi.size()<6 || hebi.size()%2){\n a=false;\n b=false;\n }\n rep(i,hebi.size()){\n if(i==0 && hebi[i]=='>')continue;\n if(i==1 && hebi[i]=='\\'')continue;\n if(i==hebi.size()-1 && hebi[i]=='~')continue;\n else if(i>=2 && i<hebi.size()-1 && i!=hebi.size()/2 && hebi[i]=='=')continue;\n else if(i==hebi.size()/2 && hebi[i]=='#')continue;\n a=false;\n }\n\n rep(i,hebi.size()){\n if(i==0 && hebi[i]=='>')continue;\n if(i==1 && hebi[i]=='^')continue;\n if(i==hebi.size()-1 && hebi[i]=='~')continue;\n if(i==hebi.size()-2 && hebi[i]=='~')continue;\n else if(i%2==0 && hebi[i]=='Q')continue;\n else if(i%2==1 && hebi[i]=='=')continue;\n b=false;\n }\n\n if(a)puts(\"A\");\n else if(b)puts(\"B\");\n else puts(\"NA\");\n }\n}", "#include<iostream>\n#include<string>\nusing namespace std;\nbool check(string s,int n) {\n\tif (s.size() <= n)return true;\n\treturn false;\n}\nvoid solve() {\n\tstring s; cin >> s;\n\tint n = 0;\n\tif (s[n] == '>') {\n\t\tn++;\n\t\tif (check(s, n));\n\t\telse if (s[n] == '\\'') {\n\t\t\tn++;\n\t\t\tint cnt = 0;\n\t\t\twhile (s[n] == '=' && !check(s, n)) { cnt++; n++; }\n\t\t\tif (s[n] == '#') {\n\t\t\t\tn++;\n\t\t\t\tif (check(s, n))goto exit;\n\t\t\t\telse if (s[n] != '=')goto exit;\n\t\t\t\twhile (s[n] == '=' && !check(s, n)) { cnt--; n++; }\n\t\t\t\tif (cnt == 0) {\n\t\t\t\t\tif (s[n] == '~') {\n\t\t\t\t\t\tn++;\n\t\t\t\t\t\tif (n == s.size()) {\n\t\t\t\t\t\t\tcout << \"A\\n\";\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if (s[n] == '^') {\n\t\t\tn++;\n\t\t\tif (check(s, n))goto exit;\n\t\t\tbool b = false;\n\t\t\twhile (true) {\n\t\t\t\tif (check(s, n + 1))goto exit;\n\t\t\t\telse {\n\t\t\t\t\tif (s[n] == 'Q'&&s[n + 1] == '=') { n += 2; b = true; }\n\t\t\t\t\telse if (s[n] == '~'&&s[n + 1] == '~') {\n\t\t\t\t\t\tif (b) {\n\t\t\t\t\t\t\tcout << \"B\\n\";\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse goto exit;\n\t\t\t\t\t}\n\t\t\t\t\telse goto exit;\n\t\t\t\t}\n\t\t\t}\n\t\t\tn++;\n\t\t\tif (check(s, n))goto exit;\n\t\t\tif (s[n] == '~') {\n\t\t\t\tn++;\n\t\t\t\tif (check(s, n))goto exit;\n\t\t\t\tif (s[n] == '~') {\n\t\t\t\t\tn++;\n\t\t\t\t\tif (n == s.size()) {\n\t\t\t\t\t\tcout << \"B\\n\";\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\nexit:;\n\tcout << \"NA\\n\";\n\treturn;\n}\nint main() {\n\tint n; cin >> n;\n\tfor (int i = 0; i < n; i++)solve();\n}", "#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\nusing namespace std;\n\ntypedef istringstream ISS;\ntypedef ostringstream OSS;\ntypedef vector<string> VS;\ntypedef int INT;\ntypedef vector<INT> VI;\ntypedef vector<VI> VVI;\ntypedef pair <INT, INT> II;\ntypedef vector <II> VII;\n\ntemplate<class T> ostream& operator << ( ostream& os, vector<T> v ) {\n for ( typename vector<T>::iterator it_i = v.begin(); it_i != v.end(); ++it_i ) {\n os << *it_i << \", \";\n }\n return os;\n}\n\n\ntypedef set <string> SS;\nSS SA;\nSS SB;\n\nbool checkA( string s ) {\n return SA.count( s ) > 0;\n}\n\nbool checkB( string s ) {\n return SB.count( s ) > 0;\n}\n\nstring solve( string s ) {\n if ( checkA( s ) ) return \"A\";\n if ( checkB( s ) ) return \"B\";\n return \"NA\";\n}\n\nint main() {\n for ( int i = 1; i <= 100; ++ i ) {\n SA.insert( \">'\" + string( i, '=' ) + \"#\" + string( i, '=' ) + \"~\" );\n }\n for ( int i = 1; i <= 100; ++ i ) {\n VS con( i, \"Q=\" );\n SB.insert( \">^\" + accumulate( con.begin(), con.end(), string() ) + \"~~\" );\n }\n int n;\n cin >> n;\n for ( int i = 0; i < n; ++ i ) {\n string s;\n cin >> s;\n cout << solve( s ) << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nbool kind_a(string str){\n\t\n\tif(str[0] != '>' || str[1] != '\\'' || str[str.size()-1] != '~'){\n\t\treturn false;\n\t}\n\t\n\tstring su = str.substr(2, str.size()-3);\n\t\n\tif(su.size()<3)\n\t\treturn false;\n\t\n\tfor(int i=0; i<su.size(); ++i){\n\t\t\n\t\tint j = su.size()-1-i;\n\t\t\n\t\tif(i>=j)\n\t\t\tbreak;\n\t\t\t\n\t\tif(su[i]!='=' || su[i]!=su[j]){\n\t\t\treturn false;\n\t\t}\t\n\t}\n\t\n\treturn su[(su.size()-1)/2]=='#';\n}\n\nbool kind_b(string str){\n\t\t\n\tif(str[0] != '>' || str[1] != '^' || \n\t\tstr[str.size()-2] != '~' || str[str.size()-1] != '~'){\n\t\treturn false;\n\t}\n\t\n\tstring su = str.substr(2, str.size()-4);\n\t\n\tif(su.size()<2)\n\t\treturn false;\n\t\n\tfor(int i=0; i<su.size(); ++i){\n\t\t\n\t\tint j = su.size()-1-i;\n\t\t\n\t\tif(i>=j)\n\t\t\tbreak;\n\t\t\t\n\t\tif( !(su[i]=='Q' && su[j]=='=' || su[j]=='Q' && su[i]=='=') ){\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\treturn true;\n}\n\nstring solve(string str){\n\t\n\tif(kind_a(str)){\n\t\treturn \"A\";\n\t}\n\telse if(kind_b(str)){\n\t\treturn \"B\";\n\t}\n\telse{\n\t\treturn \"NA\";\n\t}\n}\n\n\nint main(){\n\n\tint n;\n\tcin>>n;\n\t\n\twhile(n--){\n\t\t\n\t\tstring str;\n\t\tcin>>str;\n\t\tcout << solve(str) << endl;\n\t}\n\t\n\treturn 0;\n}", "// 2011/10/02 Tazoe\n\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\n\tfor(int i=0; i<n; i++){\n\t\tstring str;\n\t\tcin >> str;\n\n\t\tif(str[0]!='>'){\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(str[1]=='\\''){\n\t\t\tint N = 0;\n\t\t\tint I = 2;\n\t\t\twhile(str[I]=='='){\n\t\t\t\tN++;\n\t\t\t\tI++;\n\t\t\t}\n\t\t\tif(N==0){\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(str[I]!='#'){\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tI++;\n\n\t\t\tint M = 0;\n\t\t\twhile(str[I]=='='){\n\t\t\t\tM++;\n\t\t\t\tI++;\n\t\t\t}\n\t\t\tif(N!=M){\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(!(str[I]=='~'&&I+1==str.size())){\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tcout << \"A\" << endl;\n\t\t}\n\t\telse if(str[1]=='^'){\n\t\t\tint N = 0;\n\t\t\tint I = 2;\n\t\t\twhile(str[I]=='Q'&&str[I+1]=='='){\n\t\t\t\tN++;\n\t\t\t\tI += 2;\n\t\t\t}\n\t\t\tif(N==0){\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(!(str[I]=='~'&&str[I+1]=='~'&&I+2==str.size())){\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tcout << \"B\" << endl;\n\t\t}\n\t\telse\n\t\t\tcout << \"NA\" << endl;\n\t}\n\n\treturn 0;\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n int n,f,i,m;\n string s;\n cin>>n;\n while(n-->0){\n cin>>s;\n f=0;\n if(s[0]=='>' && s[1]=='\\''){\n m=s.find('#');\n if(m!=string::npos){\n\tfor(i=1;s[m-i]==s[m+i];)i++;\n\tif(i>1 && m-i==1 && m+i==s.size()-1 && s[m+i]=='~')f=1;\n }\n }else if(s[0]=='>' && s[1]=='^'){\n for(i=2;s[i]=='Q'&&s[i+1]=='=';)i+=2;\n if(i>2 && i==s.size()-2 && s[i]=='~' && s[i+1]=='~')f=2;\n }\n if(f)puts(f==1?\"A\":\"B\");\n else puts(\"NA\");\n }\n}", "\n\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <algorithm>\n#define int long long\n#define rep(i, n) for (int i=0; i<n; i++)\n#define REP(n) rep(i, n)\nusing namespace std;\n\nint n;\nstring snake, head, tail, body;\n\nsigned main()\n{\n cin >> n;\n\n REP(n)\n { \n cin >> snake;\n\n if (snake.length() < 6)\n { \n cout << \"NA\" << endl;\n continue;\n } \n\n head = snake.substr(0, 2); \n if (head == \">'\")\n { \n tail = snake.substr(snake.length() - 1, 1); \n if (tail != \"~\")\n { \n cout << \"NA\" << endl;\n continue;\n } \n body = string((snake.length() - 4) / 2, '=') + \"#\" + string((snake.length() - 4) / 2, '=');\n if (snake.substr(2, snake.length() - 3) == body)\n { \n cout << \"A\" << endl;\n continue;\n } else {\n cout << \"NA\" << endl;\n continue;\n } \n } else if (head == \">^\") {\n tail = snake.substr(snake.length() - 2, 2); \n if (tail != \"~~\")\n { \n cout << \"NA\" << endl;\n continue;\n } \n body = \"\"; \n int cnt = (snake.length() - 4) / 2;\n while (cnt--) body += \"Q=\";\n if (snake.substr(2, snake.length() - 4) == body)\n {\n cout << \"B\" << endl;\n continue;\n } else {\n cout << \"NA\" << endl;\n continue;\n }\n } else {\n cout << \"NA\" << endl;\n continue;\n }\n }\n\n return 0;\n}", "#include <iostream>\n#include <string>\n#include <cstdio>\nusing namespace std;\n\nenum { A, B, NA };\nint f(string s){\n if(s.size() < 6) return NA;\n if(s.substr(0,2)==\">'\"){\n size_t i=2;\n while(i<s.size() && s[i]=='=') i++;\n if(i==2 || i==s.size() || s[i]!='#') return NA;\n size_t j=i+1;\n while(j<s.size() && s[j]=='=') j++;\n if(i-2 != j-i-1 || j==s.size() || s[j]!='~') return NA;\n return (j+1==s.size() && s[j]=='~') ? A : NA;\n } else if(s.substr(0,2)==\">^\"){\n size_t i=2;\n while(i<s.size() && s[i]==\"Q=\"[i&1]) i++;\n if((i&1)==1 || i==2 || i==s.size() || s[i]!='~') return NA;\n return (i+2==s.size() && s.substr(i)==\"~~\") ? B : NA;\n } else {\n return NA;\n }\n}\n\nint main(){\n int n;\n cin >> n;\n for(int i=0;i<n;i++){\n string s;\n cin >> s;\n char res[3][3] = {\"A\",\"B\",\"NA\"};\n puts(res[f(s)]);\n }\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tbool a=false,b=false;\n\t\tstring str;\n\t\tcin >> str;\n\t\tif(str[0] == '>' && str[1] == '\\'' && str.size()%2==0 && str.size() >= 6){a = true;}\n\t\tif(str[0] == '>' && str[1] == '^' && str.size()%2==0 && str.size() >= 6){b = true;}\n\t\tif(a){\n\t\t\tfor(unsigned j=2;j<str.size()-1;j++){\n\t\t\t\tif(j != (str.size()/2) && str[j] != '='){\n\t\t\t\t\ta = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(str[str.size()/2] != '#' || str[str.size()-1] != '~')\n\t\t\t\ta=false;\n\t\t}\t\t\n\t\tif(b){\n\t\t\tfor(unsigned j=2;j<str.size()-3;j+=2){\n\t\t\t\tif(str[j] != 'Q' || str[j+1] != '='){\n\t\t\t\t\tb = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(str[str.size()-2] != '~' || str[str.size()-1] != '~')\n\t\t\t\tb=false;\n\t\t}\n\t\tif(a)\n\t\t\tcout << \"A\" << endl;\n\t\telse if(b)\n\t\t\tcout << \"B\" << endl;\n\t\telse\n\t\t\tcout << \"NA\" << endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<string>\n\nusing namespace std;\n\nint checkA(string);\nint checkB(string);\n\nint main(){\n int i, n;\n string snake;\n\n cin >> n;\n\n for(i=0; i<n; ++i){\n cin >> snake;\n\n if(checkA(snake) == 1)\n cout << \"A\" << endl;\n else if(checkB(snake) == 1)\n cout << \"B\" << endl;\n else\n cout << \"NA\" << endl;\n }\n\n return 0;\n}\n\nint checkA(string snake){\n int i, j, count1=0, count2=0;\n\n if(snake[0] != '>' || snake[1] != '\\'' || snake[2] != '=') return 0;\n\n for(i=2; snake[i] == '='; ++i) ++count1;\n if(snake[count1 + 2] != '#') return 0;\n\n for(j=count1+3; snake[j] == '='; ++j) ++count2;\n if(count1 != count2 || j != snake.size()-1 || snake[snake.size()-1] != '~') return 0;\n\n return 1;\n}\n\nint checkB(string snake){\n int i;\n\n if(snake[0] != '>' || snake[1] != '^' || snake[2] != 'Q' || snake[3] != '=') return 0;\n\n for(i=2; i < snake.size()-2; i+=2){\n if(snake[i] != 'Q' || snake[i+1] != '=') return 0;\n }\n\n if(snake[snake.size()-2] != '~' || snake[snake.size()-1] != '~') return 0;\n\n return 1;\n}", "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <sstream>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <climits>\n#include <cassert>\nusing namespace std;\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n#define EACH(t,i,c) for(t::iterator i=(c).begin(); i!=(c).end(); ++i)\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint main(){\n\tint n;\n\tcin>>n;\n\tREP(t,n){\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(s[0]!='>')goto na;\n\t\tif(s[1]=='\\''){\n\t\t\tint state=0;\n\t\t\tint cnt1=0;\n\t\t\tint cnt2=0;\n\t\t\tFOR(i,2,s.size()){\n\t\t\t\tif(s[i]=='='&&state==0){\n\t\t\t\t\tcnt1++;\n\t\t\t\t}else if(s[i]=='#'&&state==0){\n\t\t\t\t\tstate=1;\n\t\t\t\t}else if(s[i]=='='&&state==1){\n\t\t\t\t\tstate=2;\n\t\t\t\t\tcnt2++;\n\t\t\t\t}else if(s[i]=='='&&state==2){\n\t\t\t\t\tcnt2++;\n\t\t\t\t}else if(s[i]=='~'&&state==2){\n\t\t\t\t\tstate=3;\n\t\t\t\t}else{\n\t\t\t\t\tstate=-1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(state==3&&cnt1==cnt2){\n\t\t\t\tgoto a;\n\t\t\t}else{\n\t\t\t\tgoto na;\n\t\t\t}\n\t\t}else if(s[1]=='^'){\n\t\t\tint state=0;\n\t\t\tint flag=0;\n\t\t\tFOR(i,2,s.size()){\n\t\t\t\tif(s[i]=='Q'&&state==0){\n\t\t\t\t\tstate=1;\n\t\t\t\t}else if(s[i]=='='&&state==1){\n\t\t\t\t\tstate=0;\n\t\t\t\t\tflag=1;\n\t\t\t\t}else if(s[i]=='~'&&state==0){\n\t\t\t\t\tstate=2;\n\t\t\t\t}else if(s[i]=='~'&&state==2){\n\t\t\t\t\tstate=3;\n\t\t\t\t}else{\n\t\t\t\t\tstate=-1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(state==3&&flag){\n\t\t\t\tgoto b;\n\t\t\t}else{\n\t\t\t\tgoto na;\n\t\t\t}\n\t\t}else{\n\t\t\tgoto na;\n\t\t}\na:\n\t\tcout<<\"A\"<<endl;\n\t\tcontinue;\nb:\n\t\tcout<<\"B\"<<endl;\n\t\tcontinue;\nna:\n\t\tcout<<\"NA\"<<endl;\n\t\tcontinue;\n\t}\n\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n string str;\n int n; cin >> n;\n while(n--){\n cin >> str;\n int idx = 2;\n int cnt = 0;\n bool flg = true;\n if(str[0] == '>' && str[1] == 39){\n bool used = false;\n while(idx < str.size() && str[idx] == '=') {\n\tused = true;\n\tcnt++;\n\tidx++;\n }\n if(str[idx] == '#'){\n\tidx++;\n\twhile(idx < str.size() && str[idx] == '=') {\n\t cnt--;\n\t idx++;\n\t}\n }\n if(str[idx] == '~' && cnt == 0 && used) {\n\tcout << \"A\" << endl;\n\tflg = false;\n }\n } else if(str[0] == '>' && str[1] == '^'){\n while(idx+1 < str.size() && str[idx] == 'Q' && str[idx+1] == '='){\n\tidx += 2;\n\tcnt++;\n }\n if(cnt > 0 && str[idx] == '~' && str[idx+1] == '~') {\n\tcout << \"B\" << endl;\n\tflg = false;\n }\n }\n if(flg) cout << \"NA\" << endl;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint n;\nstring s;\nint main(void) {\n\tcin >> n;\n\tfor (int k = 0; k < n; k++) {\n\t\tcin >> s;\n\t\tbool f = true;\n\t\tif (s[0] == '>' && s[1] == '\\'') {\n\t\t\tint c = 0;\n\t\t\tint i;\n\t\t\tfor (i = 2; s[i] == '='; i++)\n\t\t\t\tc++;\n\t\t\tif (c && s[i] == '#') {\n\t\t\t\tfor (i += 1; s[i] == '='; i++)\n\t\t\t\t\tc--;\n\t\t\t\tif (!c && (int) s.size() == i + 1 && s[i] == '~') {\n\t\t\t\t\tcout << 'A' << endl;\n\t\t\t\t\tf = false;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (s[0] == '>' && s[1] == '^' && s[2] == 'Q' && s[3] == '=') {\n\t\t\tint i;\n\t\t\tfor (i = 4; s[i] == 'Q' && s[i + 1] == '='; i += 2)\n\t\t\t\t;\n\t\t\tif ((int) s.size() == i + 2 && s[i] == '~' && s[i + 1] == '~') {\n\t\t\t\tcout << 'B' << endl;\n\t\t\t\tf = false;\n\t\t\t}\n\t\t}\n\t\tif (f) {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n}", "#include<stdio.h>\n#include<string.h>\n \nint n,len;\nchar t[300];\n \nint checkA(){\n if(t[len-1]!='~')return 0;\n int i=2,j=len-2; \n while(i<j){\n if(t[i]!='=')return 0;\n if(t[j]!='=')return 0;\n i++;\n j--;\n }\n if(t[i]=='#')return 1;\n else return 0;\n}\n \nint checkB(){\n if(t[len-2]!='~')return 0;\n if(t[len-1]!='~')return 0;\n int i;\n for(i=2;i<len-2;i+=2){\n if(t[i]!='Q')return 0;\n if(t[i+1]!='=')return 0;\n }\n return 2;\n}\n \nint solve(){\n if(len<6 || len%2==1)return 0;\n if(t[0]=='>'&&t[1]=='\\'')return checkA();\n if(t[0]=='>'&&t[1]=='^')return checkB();\n return 0;\n}\n \nint main(){\n scanf(\"%d\",&n);\n while(n>0){\n n--;\n scanf(\"%s\",t);\n len=strlen(t);\n int ans=solve();\n if(ans==0)printf(\"NA\\n\");\n if(ans==1)printf(\"A\\n\");\n if(ans==2)printf(\"B\\n\");\n }\n return 0;\n}", "\nimport java.io.*;\nimport java.util.*;\n\n\n// 2011/10/23\n\n// 0139 Snakes\npublic class Main {\n\n\t// ƒƒCƒ“ return false‚Å‚¨‚µ‚Ü‚¢\n\tboolean main() throws IOException {\n\n\t\tString s = reader.readLine();\n\t\t\n\t\tString type = \"NA\";\n\t\t\n\t\tString regA = \">'(=+)#(=+)\\\\~\";\n\t\t\n\t\tif (s.matches(regA)) {\n\t\t\tif (s.replaceAll(regA, \"$1\").equals(s.replaceAll(regA, \"$2\")))\n\t\t\t\ttype = \"A\";\n\t\t}\n\t\telse if (s.matches(\">\\\\^(Q=)+\\\\~\\\\~\")) {\n\t\t\ttype = \"B\";\n\t\t}\n\t\t\n\t\tSystem.out.printf(\"%s\\n\", type);\n\t\t\n\t\treturn true; // ³íI—¹ ŽŸ‚Ö\n\t}\n\t\n\n//\tprivate final static boolean DEBUG = true; // debug\n\tprivate final static boolean DEBUG = false; // release\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tif (DEBUG) {\n\t\t\tlog = System.out;\n\t\t\t\n\t\t\tString inputStr = \"1:>'======#======~:\";\n\n\t\t\tinputStr = inputStr.replace(\":\", \"\\n\");\n\n\t\t\treader = new BufferedReader(new StringReader(inputStr)); \n\n\t\t}\n\t\telse {\n\t\t\tlog = new PrintStream(new OutputStream() { public void write(int b) {} } ); // ‘‚«ŽÌ‚Ä\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in)); // ƒRƒ“ƒ\\[ƒ‹‚©‚ç\n\t\t}\n\t\t\n\t\tint N = readIntArray()[0];\n\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tboolean b = new Main().main();\n\t\t\tif (!b)\n\t\t\t\tbreak;\n\t\t}\t\t\n\t\t\n\t\treader.close();\n\t}\n\n\t\n\tstatic PrintStream log;\n\tstatic BufferedReader reader;\n\t\n\n\t// •W€“ü—Í‚æ‚è1s•ª‚Ì‹æØ‚蕶Žš‹æØ‚è‚ł̐®”’l‚ð“Ç‚Þ\n\t// EOF‚̏ꍇ‚Ínull‚ð•Ô‚·\n\tprivate static int[] readIntArray() throws IOException {\n\n\t\tString s = null;\n\t\tfor(;;) {\n\t\t\ts = reader.readLine();\n//\t\t\tlog.printf(\"%s\\n\", s);\n\t\t\tif (s == null)\n\t\t\t\treturn null;\n\t\t\ts = s.trim();\n\t\t\tif (s.length() != 0) // ¦¦¦@‚Ç‚¤‚à“Ë‘R‹ós‚ð“Ç‚Þ‚±‚Æ‚ª‚ ‚éB“Ç‚Ý”ò‚΂·‚Æ‚¤‚Ü‚­‚¢‚­‚炵‚¢BBBB\n\t\t\t\tbreak;\n\t\t}\n\t\t\n\t\tString[] sp = s.split(\"[ ,]\"); // ‹æØ‚蕶Žš‚̓Xƒy[ƒX‚©ƒJƒ“ƒ}\n\t\tint[] a = new int[sp.length];\n\t\tfor(int i = 0; i < sp.length; i++) {\n\t\t\ta[i] = Integer.parseInt(sp[i]);\n\t\t}\n\t\treturn a;\n\t}\n\t\t\n}", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n\t\tString snake;\n\t\tbf.readLine();\n\t\twhile ((snake = bf.readLine()) != null) {\n\t\t\tString ans = isSnakeA(snake) ? \"A\" : isSnakeB(snake) ? \"B\" : \"NA\";\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\tprivate static boolean isSnakeA(String snake) {\n\t\tString sa = \"^>'(=+)#\\\\1~$\";\n\t\tPattern pa = Pattern.compile(sa);\n\t\tMatcher ma = pa.matcher(snake);\n\t\treturn ma.matches();\n\t}\n\n\tprivate static boolean isSnakeB(String snake) {\n\t\tString sb = \"^>\\\\^(Q=)+~~$\";\n\t\tPattern pb = Pattern.compile(sb);\n\t\tMatcher mb = pb.matcher(snake);\n\t\treturn mb.matches();\n\t}\n}", "#include <string>\n#include <iostream>\nusing namespace std;\nint n; string s;\nint check() {\n\tif(s.size() < 6) return 0;\n\tif(s[0] != '>') return 0;\n\tif(s[1] == '\\'') {\n\t\tint cnt = 0, cntp = 0;\n\t\tfor(int i = 2; i < s.size() - 1; i++) {\n\t\t\tif(s[i] != '=') break;\n\t\t\tcnt++; cntp++;\n\t\t}\n\t\tif(s[2 + cnt] != '#') return 0;\n\t\tfor(int i = cnt + 3; i < s.size(); i++) {\n\t\t\tif(s[i] != '=') break;\n\t\t\tcnt--; cntp++;\n\t\t}\n\t\tif(cnt) return 0;\n\t\tif(2 + cntp + 2 != s.size()) return 0;\n\t\treturn (s[2 + cntp + 1] == '~' ? 1 : 0);\n\t}\n\tif(s[1] == '^') {\n\t\tint cnt = 0;\n\t\tfor(int i = 2; i < s.size() - 2; i += 2) {\n\t\t\tif(s[i] != 'Q' || s[i + 1] != '=') break;\n\t\t\tcnt += 2;\n\t\t}\n\t\tif(cnt + 4 != s.size()) return 0;\n\t\treturn ((s[cnt + 2] == '~' && s[cnt + 3] == '~') ? 2 : 0);\n\t}\n\treturn 0;\n}\nint main() {\n\tscanf(\"%d\", &n);\n\tfor(int i = 0; i < n; i++) {\n\t\tcin >> s;\n\t\tint r = check();\n\t\tif(r == 0) cout << \"NA\" << endl;\n\t\tif(r == 1) cout << \"A\" << endl;\n\t\tif(r == 2) cout << \"B\" << endl;\n\t}\n\treturn 0;\n}", "#include <stdio.h>\n\nbool checkA(char *p){\n int eqCnt=0;\n \n if (*p++!='>') return false;\n if (*p++!='\\'') return false;\n if (*p!='=') return false;\n while (*p++=='=') eqCnt++;\n p--;\n if (*p++!='#') return false;\n while (*p++=='=') eqCnt--;\n p--;\n if (eqCnt!=0) return false;\n if (*p++!='~') return false;\n if (*p!='\\0') return false;\n \n return true;\n}\n\nbool checkB(char *p){\n if (*p++!='>') return false;\n if (*p++!='^') return false;\n if (*p!='Q') return false;\n while (*p++=='Q'){\n if (*p++!='=') return false;\n }\n p--;\n if (*p++!='~' || *p++!='~') return false;\n if (*p!='\\0') return false;\n \n return true;\n}\n\nint main(void){\n int n;\n char str[256];\n \n scanf(\"%d\", &n);\n for (int i=0; i<n; i++){\n scanf(\"%s\", str);\n if (checkA(str)){\n puts(\"A\");\n } else if (checkB(str)){\n puts(\"B\");\n } else {\n puts(\"NA\");\n }\n }\n \n return 0;\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(){\n\tint n;\n\tstring s;\n\tcin >> n;\n\tfor(int i = 0;i < n;i++){\n\t\tcin >> s;\n\t\tif(s.substr(0,2) == \">\\'\"){\n\t\t\tif(s[s.length() - 1] != '~') cout << \"NA\" << endl;\n\t\t\telse {\n\t\t\t\tint cnt = 0,pos = 2;\n\t\t\t\tbool flag = true;\n\t\t\t\tfor(;;pos++){\n\t\t\t\t\tif(s[pos] == '#') break;\n\t\t\t\t\tif(s[pos] == '=') cnt++;\n\t\t\t\t\telse {\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!flag || !cnt) cout << \"NA\" << endl;\n\t\t\t\telse{\n\t\t\t\t\tpos++;\n\t\t\t\t\tfor(int j = 0;j < cnt;j++){\n\t\t\t\t\t\tif(s[pos + j] != '='){\n\t\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(s[pos + cnt] != '~') flag = false;\n\t\t\t\t\tif(!flag) cout << \"NA\" << endl;\n\t\t\t\t\telse cout << \"A\" << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}else if(s.substr(0,2) == \">^\"){\n\t\t\tif(s.length() % 2 || s.length() <= 4) cout << \"NA\" << endl;\n\t\t\telse {\n\t\t\t\tbool flag = true;\n\t\t\t\tfor(int i = 1;i < s.length() / 2;i++){\n\t\t\t\t\tif(i != s.length() / 2 - 1 && s.substr(i * 2,2) != \"Q=\") flag = false;\n\t\t\t\t\tif(i == s.length() / 2 - 1 && s.substr(i * 2,2) != \"~~\") flag = false;\n\t\t\t\t}\n\t\t\t\tif(flag) cout << \"B\" << endl;\n\t\t\t\telse cout << \"NA\" << endl;\n\t\t\t}\n\t\t}else cout << \"NA\" << endl;\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nbool isA(string s) {\n int cnt1 = 0;\n for (int i = 2; i < s.size(); ++i) {\n if (s[i] == '=') {\n ++cnt1;\n } else if (s[i] == '#') {\n if (cnt1 == 0) return false;\n break;\n } else {\n return false;\n }\n if (i == s.size() - 1) return false;\n }\n int cnt2 = 0;\n for (int i = cnt1 + 3; i < s.size(); ++i) {\n if (s[i] == '=') {\n ++cnt2;\n } else if (s[i] == '~') {\n return (cnt1 == cnt2 && i == s.size() - 1);\n } else {\n return false;\n }\n }\n return false;\n}\n\nbool isB(string s) {\n if (s.size() % 2) return false;\n int cnt = 0;\n for (int i = 2; i < s.size(); i += 2) {\n if (s[i] == 'Q' && s[i + 1] == '=') {\n ++cnt;\n } else if (s[i] == '~' && s[i + 1] == '~') {\n return (i + 1 == s.size() - 1) && cnt;\n } else {\n return false;\n }\n }\n return false;\n}\n\nint main() {\n int n; cin >> n;\n vector<string> s(n); for (int i = 0; i < n; ++i) cin >> s[i];\n for (int i = 0; i < n; ++i) {\n if (s[i][0] != '>' || s[i].size() == 3) {\n cout << \"NA\" << endl;\n continue;\n }\n if (s[i][1] == '\\'') {\n cout << ( (isA(s[i])) ? \"A\" : \"NA\") << endl;\n } else if (s[i][1] == '^') {\n cout << ( (isB(s[i])) ? \"B\" : \"NA\") << endl;\n } else {\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}\n\n", "for i in range(input()):\n s = raw_input()\n l = (len(s) - 4) / 2\n if l > 0 and s == \">'%s#%s~\" % (('=' * l,) * 2):\n print('A')\n elif l > 0 and s == '>^%s~~' % ('Q=' * l):\n print('B')\n else:\n print('NA')", "import java.util.Scanner;\npublic class Main\n{\n\tpublic static void main(String arg[])\n\t{\n\t\tScanner in=new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\twhile(n-->0)\n\t\t{\n\t\t\tchar ch[] = in.next().toCharArray();\n\t\t\tint counta =0;\n\t\t\tint countb =0;\n\t\t\tboolean flag=false;\n\t\t\t\tif(ch[0]=='>'&&ch[1]=='\\'' &&ch[ch.length-1]=='~'&&ch[ch.length-2]=='=')\n\t\t\t\t{\n\t\t\t\t\tint co=2;\n\t\t\t\t\twhile(ch[co]!='#')\n\t\t\t\t\t{\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(ch[co]=='=')\n\t\t\t\t\t\t\tcounta++;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcounta=0;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tco++;\n\t\t\t\t\t\tif(co==ch.length-1)\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tco++;\n\t\t\t\t\twhile(ch[co]!='~')\n\t\t\t\t\t{\n\t\t\t\t\t\tif(ch[co]=='=')\n\t\t\t\t\t\t\tcountb++;\n\t\t\t\t\t\telse \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcounta=0;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tco++;\n\t\t\t\t\t}\n\t\t\t\t\tif(counta==countb&&counta>0)\n\t\t\t\t\t\tSystem.out.println(\"A\");\n\t\t\t\t\telse \n\t\t\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tif(ch[0]=='>'&&ch[1]=='^' &&ch[ch.length-1]=='~'&&ch[ch.length-2]=='~')\n\t\t\t\t\t{\n\t\t\t\t\t\t\n\t\t\t\t\t\tfor(int co=2;co<ch.length-2;co+=2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(ch[co]=='Q'&&ch[co+1]=='=')\n\t\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\telse \n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tSystem.out.println(flag==true ? \"B\":\"NA\");\n\t\t\t}\n\t\t}\n\t}", "\nimport java.awt.geom.Point2D;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.NoSuchElementException;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Stack;\nimport java.util.TreeMap;\n\n\n\npublic class Main {\n\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic FastScanner sc = new FastScanner();\n\tstatic Scanner stdIn = new Scanner(System.in);\n\tstatic TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();\n\t\n\tpublic static void main(String[] args) {\n\t\tint n = sc.nextInt();\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tchar[] in = sc.next().toCharArray();\n\t\t\tint res = solv(in);\n\t\t\tif(res == 0) {\n\t\t\t\tout.println(\"A\");\n\t\t\t}\n\t\t\telse if(res == 1) {\n\t\t\t\tout.println(\"B\");\n\t\t\t}\n\t\t\telse {\n\t\t\t\tout.println(\"NA\");\n\t\t\t}\n\t\t}\n\t\tout.flush();\n\t}\n\t\n\tstatic int solv(char[] a) {\n\t\tif(a.length < 6) return -1;\n\t\tboolean isA = false;\n\t\tboolean isB = false;\n\t\tif(a[0] == '>' && a[1] == '\\'') {\n\t\t\tisA = true;\n\t\t}\n\t\tif(a[0] == '>' && a[1] == '^') {\n\t\t\tisB = true;\n\t\t}\n\t\tif(!isA && !isB) return -1;\n\t\t\n\t\tif(isA) {\n\t\t\tint ac = 0;\n\t\t\tint bc = 0;\n\t\t\tboolean nowb = true;\n\t\t\tfor(int i = 2; i < a.length-1; i++) {\n\t\t\t\tif(a[i] == '=' && nowb) {\n\t\t\t\t\tac++;\n\t\t\t\t}\n\t\t\t\telse if(a[i] == '=' && !nowb) {\n\t\t\t\t\tbc++;\n\t\t\t\t}\n\t\t\t\telse if(a[i] == '#' && nowb) {\n\t\t\t\t\tnowb = false;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ac != bc || nowb) return -1;\n\t\t\t\n\t\t\tif(a[a.length-1] == '~') return 0;\n\t\t\t\n\t\t\t\n\t\t}\n\t\tif(isB) {\n\t\t\tfor(int i = 2; i < a.length-2; i+=2) {\n\t\t\t\tif(a[i] != 'Q' || a[i+1] != '=' ) return -1;\n\t\t\t}\n\t\t\tif(a[a.length-1] == '~' && a[a.length-2] == '~') return 1;\n\t\t\t\n\t\t}\n\t\treturn -1;\n \t\t\t\t\n\t}\n}\n//------------------------------//\n//-----------//\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n public boolean hasNext() { skipUnprintable(); return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n \n public int nextInt() {\n \t if (!hasNext()) throw new NoSuchElementException();\n int n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n \n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n \n\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tenum State{\n\t\tSTART, MOUTH, EYE_A, EYE_B, BODY_A1, BODY_A2, BODY_B1, BODY_B2, MID_A, TAIL_A, TAIL_B1, TAIL_B2, NA;\n\t}\n\t\n\tString snake(String s){\n\t\tState state=State.START;\n\t\tint length=0;\n\t\t\n\t\tLOOP:\n\t\tfor(int i=0;i<s.length();++i){\n\t\t\tchar next=s.charAt(i);\n\t\t\t\n\t\t\tswitch(state){\n\t\t\tcase START:\n\t\t\t\tif(next=='>') state=State.MOUTH;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase MOUTH:\n\t\t\t\tif(next=='\\'') state=State.EYE_A;\n\t\t\t\telse if(next=='^') state=State.EYE_B;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase EYE_A:\n\t\t\t\tif(next=='='){\n\t\t\t\t\tstate=State.BODY_A1;\n\t\t\t\t\tlength=0;\n\t\t\t\t}\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase BODY_A1:\n\t\t\t\t++length;\n\t\t\t\tif(next=='=') state=State.BODY_A1;\n\t\t\t\telse if(next=='#') state=State.MID_A;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase MID_A:\n\t\t\t\tif(next=='=') state=State.BODY_A2;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase BODY_A2:\n\t\t\t\t--length;\n\t\t\t\tif(next=='=') state=State.BODY_A2;\n\t\t\t\telse if(next=='~'&&length==0) state=State.TAIL_A;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase EYE_B:\n\t\t\t\tif(next=='Q') state=State.BODY_B1;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase BODY_B1:\n\t\t\t\tif(next=='=') state=State.BODY_B2;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase BODY_B2:\n\t\t\t\tif(next=='Q') state=State.BODY_B1;\n\t\t\t\telse if(next=='~') state=State.TAIL_B1;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase TAIL_B1:\n\t\t\t\tif(next=='~') state=State.TAIL_B2;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak LOOP;\n\t\t\t}\n\t\t}\n\t\t\n\t\tswitch(state){\n\t\tcase TAIL_A:\n\t\t\treturn \"A\";\n\t\tcase TAIL_B2:\n\t\t\treturn \"B\";\n\t\tdefault:\n\t\t\treturn \"NA\";\n\t\t}\n\n\t}\n\t\n\tBufferedReader input;\n\t\n\tint ni() throws NumberFormatException, IOException{\n\t\treturn Integer.parseInt(input.readLine());\n\t}\n\t\n\tString ns() throws IOException{\n\t\treturn input.readLine();\n\t}\n\t\n\tvoid io(){\n\t\tinput=new BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\ttry {\n\t\t\tint n=ni();\n\t\t\tfor(int i=0;i<n;++i){\n\t\t\t\tSystem.out.println(snake(ns()));\n\t\t\t}\n\t\t\tinput.close();\n\t\t} catch (IOException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tnew Main().io();\n\t}\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0; i<(n); i++)\nstruct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;\nbool check_A( string &S )\n{\n auto sz = S.size();\n //size ??? 6 ??\\?????????????????? false\n if( sz < 6 )\n {\n return 0;\n }\n //?????????[>'=], ????°????[~]?????????????????´?????? false\n if( S[ 0 ] != '>' || S[ 1 ] != '\\'' || S[ 2 ] != '=' || S[ sz - 1 ] != '~' )\n {\n return 0;\n }\n //??????[>']??¨????°?[~]???????????????\n string R = S.substr( 2, sz - 3 );\n sz = R.size();\n //R ???[#,=]??\\???????????????????????????????????? false\n if( R.find_first_not_of( \"#=\", 0 ) != string::npos )\n {\n return 0;\n }\n if( sz % 2 == 0 )\n {\n return 0;\n }\n //R ?????????????????????????????£???[#]???????????\\??????[#]????????£?????? false\n auto pos = R.find( \"#\" );\n if( R.find( \"#\", pos + 1 ) != string::npos )\n {\n return 0;\n }\n // S ???????????????[#]???????????£?????? false\n if( R[ sz / 2 ] != '#' )\n {\n return 0;\n }\n return 1;\n}\nbool check_B( string &S )\n{\n auto sz = S.size();\n //size ??? 6 ??\\?????????????????? false\n if( sz < 6 )\n {\n return 0;\n }\n //?????????[>^], ????°????[~~]?????????????????´?????? false\n if( S[ 0 ] != '>' || S[ 1 ] != '^' || S[ sz - 1 ] != '~' || S[ sz - 2 ] != '~' )\n {\n return 0;\n }\n string R = S.substr( 2, sz - 4 );\n sz = R.size();\n // S ???size????\\???°?????£?????? false\n if( sz % 2 != 0 )\n {\n return 0;\n }\n for( int i = 0; i < sz; i += 2 )\n {\n //[Q=]?????£?¶???§????????£?????? false\n if( R[ i ] != 'Q' || R[ i + 1 ] != '=' )\n {\n return 0;\n }\n }\n return 1;\n}\nint main()\n{\n int N;\n cin >> N;\n \n REP( i, N )\n {\n string S;\n cin >> S;\n \n string res{ \"NA\" };\n if( check_A( S ) )\n {\n res = \"A\";\n }\n else if( check_B( S ) )\n {\n res = \"B\";\n }\n cout << res << endl;\n }\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\n/*s[i]ツつゥツづァツ督ッツつカツ閉カツ篠堋つェツ連ツ堕アツつオツづつ「ツづゥツ青板づーツ陛板つキ*/\nint seqlen(string &s,int i){\n\tchar c = s[i];\n\tint ret=0;\n\twhile(s[i++]==c)ret++;\n\treturn ret;\n}\n\nint main(){\n\tint n;\n\tint flag = 0;\n\tstring s;\n\tcin >> n;\n\twhile(n--){\n\t\tflag = 0;\n\t\tcin >> s;\n\t\t/*A*/\n\t\tif(s[0]=='>' && s[1]==39){\n\t\t\tint x=2;\n\t\t\tx += seqlen(s,x);\n\t\t\tif(s[x]!='#')flag = 1;\n\t\t\tx ++ ;\n\t\t\tif(seqlen(s,2) != seqlen(s,x))flag = 1;\n\t\t\tx += seqlen(s,x);\n\t\t\tif(s[x]!='~')flag = 1;\n\t\t\tif(!flag)flag='A';\n\t\t}\n\t\telse if(s[0]=='>' && s[1]=='^'){\n\t\t\tint pointa = 0;\n\t\t\tfor(int i=2;i<s.length()-2;i++){\n\t\t\t\tif(i%2){\n\t\t\t\t\tif(s[i] != '=')flag = 1;\n\t\t\t\t\telse pointa++;\n\t\t\t\t}else{\n\t\t\t\t\tif(s[i] != 'Q')flag = 1;\n\t\t\t\t\telse pointa++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(s[s.length()-2] != '~' || s[s.length()-1] != '~')flag = 1;\n\t\t\tif(!flag && pointa>=2)flag='B';\n\t\t\telse flag = 1;\n\t\t}\n\t\telse {flag = 1;}\n\t\t\n\t\tif(flag != 1)cout << (char)flag << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n}", "import re\n\nn=int(input())\n\ndef A(snake):\n r=re.match(\"^>\\'(\\=+)\\#(\\=+)\\~$\",snake)\n if r:\n if len(r.group(1))==len(r.group(2)):\n return True\n return False\ndef B(snake):\n r=re.match(\"^\\>\\^(Q=)+\\~\\~$\",snake)\n if r:\n return True\n return False\n\nfor i in range(n):\n S=input()\n if A(S):\n print(\"A\")\n elif B(S):\n print(\"B\")\n else:\n print(\"NA\")\n\n", "#include <iostream>\n\n#define VARIABLE(x) cerr << #x << \"=\" << x << endl\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define REP(i,m,n) for (int i=m;i<(int)(n);i++)\n\nconst int INF = 10000000;\nusing namespace std;\ntypedef long long ll;\n\n/** Problem0139 : Snakes **/\nint main()\n{\n\tint n;\n\tstring s;\n\tcin >> n;\n\trep(k, n) {\n\t\tcin >> s;\n\t\tREP(i, 1, 100) {\n\t\t\tstring a=\">'\", b=\">^\";\n\n\t\t\trep(j, i) {\n\t\t\t\ta+='=';\n\t\t\t\tb+=\"Q=\";\n\t\t\t}\n\t\t\ta+='#';\n\t\t\trep(j, i)\n\t\t\t\ta+='=';\n\t\t\ta+='~';\n\t\t\tb+=\"~~\";\n\t\t\tif (s == a) {\n\t\t\t\tcout << \"A\" << endl;\n\t\t\t\tgoto end;\n\t\t\t} else if (s == b) {\n\t\t\t\tcout << \"B\" << endl;\n\t\t\t\tgoto end;\n\t\t\t}\n\t\t}\n\t\tcout << \"NA\" << endl;\n\tend:;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n string s;\n for (int i=0; i<n; ++i) {\n cin >> s;\n int m = s.size();\n string res = \"NA\";\n if (s.size() < 6 || s.size() % 2 == 1) {\n // pass\n } else if (s.substr(0,2) == \">'\" && s[m-1] == '~') {\n res = \"A\";\n if (s[m/2] != '#') {\n res = \"NA\";\n }\n for (int j=2; j<=m-2; ++j) {\n if (j == m/2) continue;\n if (s[j] != '=') {\n res = \"NA\";\n break;\n }\n }\n } else if (s.substr(0,2) == \">^\" && s.substr(m-2,2) == \"~~\") {\n res = \"B\";\n for (int j=2; j<=m-4; j+=2) {\n if (s[j] != 'Q' || s[j+1] != '=') {\n res = \"NA\";\n break;\n }\n }\n }\n cout << res << endl;\n }\n return 0;\n}", "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<stack>\n#include<map>\n#include<set>\n#include<queue>\n#include<cstdio>\n#include<climits>\n#include<cmath>\n#include<cstring>\n#include<string>\n#include<sstream>\n#include<complex>\n\n#define f first\n#define s second\n#define mp make_pair\n\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)\n#define ALL(c) (c).begin(), (c).end()\n\nusing namespace std;\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef complex<double> P;\n\nbool isA(const string &str){\n int n = str.size();\n int m = 0;\n int pos = 2;\n if(n == 0 || n==1) return false;\n if(str[0] != '>') return false;\n if(str[1] != '\\'') return false;\n while(pos < n && str[pos] == '=') {m++; pos++;}\n if(pos == n || m == 0) return false;\n if(str[pos++] != '#') return false;\n while(pos < n && str[pos] == '=') {m--; pos++;}\n if(pos == n) return false;\n if(str[pos++] != '~') return false;\n if(m == 0 && pos == n) return true;\n return false;\n}\n\nbool isB(const string &str){\n int n = str.size();\n int pos = 2;\n int m = 0;\n if(n == 0 || n == 1) return false;\n if(str[0] != '>') return false;\n if(str[1] != '^') return false;\n while(pos+1 < n && str[pos] == 'Q' && str[pos+1] == '=') {m++; pos+=2;}\n if(m == 0) return false;\n if(pos+2 != n) return false;\n if(str[pos] == '~' && str[pos+1] == '~') return true;\n return false;\n}\n\nint main(){\n int n;\n string str;\n getline(cin,str); sscanf(str.c_str(),\"%d\",&n);\n while(n --> 0){\n getline(cin,str);\n if(isA(str)) puts(\"A\");\n else if(isB(str)) puts(\"B\");\n else puts(\"NA\");\n }\n return 0;\n}", "n=int(input())\nfor times in range(n):\n\ts=input()\n\tans=\"NA\"\n\n\t#A???????????§\n\tif s[:2]==\">'\" and s[-1]==\"~\":\n\t\tt=s[2:-1].split(\"#\")\n\n\t\tif len(t)==2 and len(t[0])>0:\n\t\t\tvalid=True\n\t\t\tfor v in t[0]:\n\t\t\t\tif v!=\"=\":\n\t\t\t\t\tvalid=False\n\t\t\t\t\tbreak\n\t\t\tif valid and t[0]==t[1]:\n\t\t\t\tans=\"A\"\n\n\t#B???????????§\n\telif s[:2]==\">^\" and s[-2:]==\"~~\":\n\t\tt=s[2:-2]\n\n\t\tif len(t)>0 and len(t)%2==0:\n\t\t\tvalid=True\n\t\t\tfor i in range(0,len(t),2):\n\t\t\t\tif t[i:i+2]!=\"Q=\":\n\t\t\t\t\tvalid=False\n\t\t\t\t\tbreak\n\t\t\tif valid:\n\t\t\t\tans=\"B\"\n\n\tprint(ans)", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define pb push_back\n#define fr first\n#define sc second\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef pair<int,pii> pip; \nconst int INF = (1<<25);\nconst int dx[]={1,0,-1,0},dy[]={0,-1,0,1};\n\nint n, len;\nstring s;\n\nint checkA() {\n int i=2, j=len-2;\n while(i<j) {\n if(s[i] != '=' || s[j] != '=') return 0;\n i++; j--;\n }\n\n if(s[i] == '#' && s[len-1] == '~') return 1;\n return 0;\n}\n\nint checkB() {\n if(s[len-1]!='~' || s[len-2]!='~') return 0;\n for(int i=2; i<len-2; i+=2) {\n if(s[i] != 'Q' || s[i+1] != '=') return 0;\n }\n\n return 2;\n}\n\nint solve() {\n if(len<6 || len%2 == 1) return 0;\n if(s[0] == '>' && s[1] == '\\'') return checkA();\n if(s[0] == '>' && s[1] == '^') return checkB();\n return 0;\n}\n\nint main() {\n\n cin>> n;\n while(n--) {\n cin>> s;\n len = s.size();\n int ans = solve();\n if(ans == 0) cout<< \"NA\";\n if(ans == 1) cout<< 'A';\n if(ans == 2) cout<< 'B';\n cout<< endl;\n }\n}", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nvoid jagdeA( const string& str )\n{\n\tint count = 0;\n\tint i;\n\n\n\tfor( i = 2;i < str.size();i++ ){\n\t\tif( str[i] == '=' ) count++;\n\t\telse if( count && str[i] == '#' ) break;\n\t\telse{\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t}\n\tif( i == str.size() ){\n\t\tcout << \"NA\" << endl;\n\t\treturn;\n\t}\n\n\ti++;\n\tfor(; i < str.size(); i++ ){\n\t\tif( str[i] == '=' ) count--;\n\t\telse if( str[i] == '~' ) break;\n\t\telse{\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t}\n\n\tif( count || i == str.size() ) {\n\t\tcout << \"NA\" << endl;\n\t\treturn;\n\t}\n\n\tcout << \"A\" << endl;\n\treturn;\n}\n\nvoid jagdeB( const string& str )\n{\n\tint count = 0;\n\tint i;\n\n\tfor( i = 2;i < str.size();i += 2 ){\n\t\tif( i + 1 >= str.size() ){\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t\tif( str[i] == 'Q' && str[i + 1] == '=' ){\n\t\t\tcount++;\n\t\t} else if( str[i] == '~' && str[i + 1] == '~' && count ){\n\t\t\tcout << \"B\" << endl;\n\t\t\treturn;\n\t\t} else {\n\t\t\tcout << \"NA\" << endl;\n\t\t\treturn;\n\t\t}\n\t}\n\n\tcout << \"NA\" << endl;\n\treturn;\n}\n\n\n\nint main(int argc, char const* argv[])\n{\n\tint n;\n\tstring str;\n\n\tcin >> n;\n\n\tfor( int i = 0;i < n;i++ ){\n\t\tcin >> str;\n\t\tif( str.size() < 6 || str[0] != '>' ){\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\n\t\tswitch( str[1] ){\n\t\t\tcase '\\'':\n\t\t\t\tjagdeA( str );\n\t\t\t\tbreak;\n\t\t\tcase '^':\n\t\t\t\tjagdeB( str );\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<string>\nusing namespace std ;\n\nstring S ;\n\nint funcA(){\n\tint cnt = 0 , i ;\n\tfor( i=2 ; i<S.size() ; i++ ){\n\t\tif( S[i] == '=' ) cnt++ ;\n\t\telse if( S[i] == '#' ) break ;\n\t\telse return -1 ;\n\t}\n\tif( cnt == 0 ) return -1 ;\n\tfor( i++ ; i<S.size() ; i++ ){\n\t\tif( S[i] == '=' ) cnt-- ;\n\t\telse if( S[i] == '~' ) break ;\n\t\telse return -1 ;\n\t}\n\tif( cnt == 0 ) return 1 ;\n\treturn -1 ;\n}\n\nint funcB(){\n\tint cnt = 0 ;\n\tfor( int i=2 ; i<S.size() ; i+=2 ){\n\t\tif( S[i] == 'Q' && S[i+1] == '=' ) cnt++ ;\n\t\telse if( S[i] == '~' && S[i+1] == '~' && cnt ) return 2 ;\n\t\telse return -1 ;\n\t}\n\treturn -1 ;\n}\n\nint main(){\n\t\n\tint N ;\n\t\n\tcin >> N ;\n\twhile( N-- ){\n\t\tcin >> S ;\n\t\tint ans = -1 ;\n\t\tif( S.size() < 6 || S.size()%2 == 1 ){}\n\t\telse if( S[0] == '>' && S[1] == '\\'' ){ ans = funcA() ; }\n\t\telse if( S[0] == '>' && S[1] == '^' ){ ans = funcB() ; }\n\t\t\n\t\tif( ans == -1 ) cout << \"NA\" << endl ;\n\t\tif( ans == 1 ) cout << \"A\" << endl ;\n\t\tif( ans == 2 ) cout << \"B\" << endl ;\n\t}\n\t\nreturn 0 ;\n}", "import java.io.*;\nimport java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\ttry{\n\t\t\tnew Main();\n\t\t}catch(IOException e){\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\t\n\tpublic Main() throws IOException{\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tList<String> Ans = new ArrayList<String>();\n\t\tString line = in.readLine();\n\t\t\n\t\tint size = Integer.parseInt(line);\n\t\tfor(int n=0; n<size; n++){\n\t\t\tline = in.readLine();\n\t\t\tint type = 0;\n\t\t\t\n\t\t\tString c = line.substring(0, 2);\n\t\t\tif(c.equals(\">'\")){\n\t\t\t\tint count = 0;\n\t\t\t\tint sharp = 0;\n\t\t\t\tfor(int i=2; i<line.length(); i++){\n\t\t\t\t\tc = line.substring(i, i+1);\n\t\t\t\t\tif(c.equals(\"=\")){\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\telse if(c.equals(\"#\")){\n\t\t\t\t\t\tif(count > 0){\n\t\t\t\t\t\t\tcount = -count;\n\t\t\t\t\t\t\tsharp = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if(c.equals(\"~\")){\n\t\t\t\t\t\tif(i != line.length()-1){\n\t\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(count==0 && sharp==1){\n\t\t\t\t\t\t\ttype = 1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(c.equals(\">^\")){\n\t\t\t\tint count = 0;\n\t\t\t\tfor(int i=2; i<line.length(); i++){\n\t\t\t\t\tc = line.substring(i, i+1);\n\t\t\t\t\tif(count%2==0 && count>=2 && c.equals(\"~\")){\n\t\t\t\t\t\tif(i==line.length()-1){\n\t\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tc = line.substring(i+1, i+2);\n\t\t\t\t\t\tif(c.equals(\"~\")){\n\t\t\t\t\t\t\ttype = 2;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(i%2==0){\n\t\t\t\t\t\tif(!c.equals(\"Q\")){\n\t\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\tif(i%2==1){\n\t\t\t\t\t\tif(!c.equals(\"=\")){\n\t\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif(!c.equals(\"Q\") && !c.equals(\"=\") && !c.equals(\"~\")){\n\t\t\t\t\t\ttype = -1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttype = -1;\n\t\t\t}\n\t\t\t\n\t\t\tswitch(type){\n\t\t\t\tcase 1:\n\t\t\t\t\tAns.add(\"A\");\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase 2:\n\t\t\t\t\tAns.add(\"B\");\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\tAns.add(\"NA\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int n=0; n<Ans.size(); n++){\n\t\t\tSystem.out.println(Ans.get(n));\n\t\t}\n\t}\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nbool isA(const string& s){\n\tif( s.size() >= 1 && s[0] != '>' ) return false;\n\tif( s.size() >= 2 && s[1] != '\\'' ) return false;\n\t\n\tint cnt1 = 0, cnt2 = 0;\n\tfor(int i=2, j=0 ; i < s.size()-1 ; i++ ){\n\t\tif( s[i] == '=' ){\n\t\t\tj? cnt1++ : cnt2++;\n\t\t}else if( s[i] == '#' ){\n\t\t\tj++;\n\t\t}else{\n\t\t\treturn false;\n\t\t}\n\t}\n\tif( cnt1 == 0 || cnt2 == 0 || cnt1 != cnt2 || s[s.size()-1] != '~' ){\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nbool isB(const string& s){\n\tif( s.size() >= 1 && s[0] != '>' ) return false;\n\tif( s.size() >= 1 && s[1] != '^' ) return false;\n\tif( s.size() < 6 || s.size() % 2 == 1 ) return false;\n\t\n\tbool flag = false;\n\tfor(int i=3 ; i < s.size() - 2 ; i += 2 ){\n\t\tif( s[i-1] != 'Q' || s[i] != '=' ){\n\t\t\treturn false;\n\t\t}\n\t}\n\t\n\tif( s[s.size()-2] != '~' || s[s.size()-1] != '~' ){\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nint main(){\n\tint n;\n\tcin >> n;\n\tfor( ; n-- ; ){\n\t\tstring s;\n\t\tcin >> s;\n\t\t\n\t\tif( isA( s ) ){\n\t\t\tcout << \"A\" << endl;\n\t\t}else if( isB( s ) ){\n\t\t\tcout << \"B\" << endl;\n\t\t}else{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n}", "#include <cstdio>\n#include <regex.h>\n#include <cstring>\n\nint main() {\n int n;\n regex_t regst[2];\n regmatch_t match[3];\n const char *pattern[] = {\"^>'(=+)#(=+)~$\", \"^>\\\\^(Q=)+~~$\"};\n const char *type_label[] = {\"A\", \"B\", \"NA\"};\n int type;\n char snake[201];\n \n scanf(\"%d\", &n);\n for (int x=0; x<n; x++) {\n scanf(\"%s\", snake);\n type = 2;\n for (int i=0; i<2; i++) {\n regcomp(&regst[i], pattern[i], REG_EXTENDED);\n }\n if (!regexec(&regst[0], snake, 3, match, 0)) {\n if (match[1].rm_eo - match[1].rm_so == match[2].rm_eo - match[2].rm_so) {\n type = 0;\n }\n } else if (!regexec(&regst[1], snake, 0, NULL, 0)) {\n type = 1;\n }\n printf(\"%s\\n\", type_label[type]);\n }\n return 0;\n}", "#include<stdio.h>\n#include<string.h>\n\nbool checkA(char st[1001]){\n\tint len = strlen(st);\n\tif(len<4)return false;\n\tif(st[len-1]!='~')return false;\n\tif(len%2 == 1)return false;\n\tst[len/2-1] = '=';\n\tfor(int i = 0; i < len-1; i++){\n\t\tif(st[i] !='=')return false;\n\t}\n\treturn true;\n\t\n}\nbool checkB(char st[1001]){\n\tif(strlen(st)<4)return false;\n\tif(st[strlen(st)-1] != '~' || st[strlen(st)-2] != '~')return false;\n\tfor(int i = 0 ; i < strlen(st)-2; i+=2){\n\t\tif(!(st[i]=='Q' && st[i+1] =='='))return false;\n\t}\n\treturn true;\n}\n\n\nint main(void){\n\tint n;\n\tscanf(\"%d\",&n);\n\tfor(int i = 0; i < n ;i++){\n\t\tchar str[1001];\n\t\tscanf(\"%s\",str);\n\t\t\n\t\tbool Af = false;\n\t\tbool Bf = false;\n\t\t\n\t\tif(str[1] == '\\''){\n\t\t\tAf = checkA(str+2);\n\t\t}else {\n\t\t\tBf = checkB(str+2);\n\t\t}\n\t\tif(str[0] != '>'){\n\t\t\tputs(\"NA\");\n\t\t}else if(Af == Bf){\n\t\t\tputs(\"NA\");\n\t\t}else if(Af == true){\n\t\t\tputs(\"A\");\n\t\t}else{\n\t\t\tputs(\"B\");\n\t\t}\n\t}\n\treturn 0;\n}", "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\nclass Main{\n\n private static boolean snake_A(String snake)\n {\n\tif(snake.charAt(snake.length()-1) != '~')\n\t return false;\n\n\tif(snake.charAt(snake.length()-2) != '=')\n\t return false;\n\n\tif(!snake.substring(0,2).equals(\">'\"))\t\t\n\t return false;\n\n\tif(snake.indexOf(\"#\") == -1)\n\t return false;\n\n\n\tif(snake.indexOf(\"#\") > snake.indexOf(\"~\"))\n\t return false;\n\n\tif(snake.indexOf(\"#\")-snake.indexOf(\"'\") != snake.indexOf(\"~\")-snake.indexOf(\"#\"))\n\t return false;\n\n\tint left,right;\n\tleft = right = 0;\n\tfor(int i=2;i<snake.indexOf(\"#\");i++)\n\t {\n\t\n\t\tif(snake.charAt(i) == '=')\n\t\t left++;\n\t\telse \n\t\t {\n\t\t\treturn false;\n\t\t }\n\t }\n\n\tfor(int i=snake.indexOf(\"#\")+1;i<snake.indexOf(\"~\");i++)\n\t {\n\t\n\t\tif(snake.charAt(i) == '=')\n\t\t right++;\n\t\telse \n\t\t return false;\n\t }\t\n\n\t\n\tif(left != right)\n\t return false;\n\n\treturn true;\n }\n\n private static boolean snake_B(String snake)\n {\n\n\tif(!snake.substring(snake.length()-2,snake.length()).equals(\"~~\"))\n\t return false;\n\n\tif(snake.charAt(snake.length()-3) != '=')\n\t return false;\n \n\tif(!snake.substring(0,2).equals(\">^\"))\n\t return false;\n\n\tint cnt = 0;\n\tfor(int i=2;i<snake.indexOf(\"~\");i+=2)\n\t {\n\t\tif(snake.substring(i,i+2).equals(\"Q=\"))\n\t\t cnt++;\n\t\telse \n\t\t return false;\n\t }\n\n\tif(cnt < 1)\n\t return false;\n\t\n\treturn true;\n }\n\n\n public static void main(String args[])throws IOException{\n\t BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t \n\t int n;\n\t n = Integer.parseInt(in.readLine());\n\n\t while(n-- > 0)\n\t {\n\t\t String snake = in.readLine();\n\t\t \n\t\t if(snake_A(snake))\n\t\t {\n\t\t\t System.out.println(\"A\");\n\t\t }\n\t\t else if(snake_B(snake))\n\t\t {\n\t\t\t System.out.println(\"B\");\n\t\t }\n\t\t else\n\t\t {\n\t\t\t System.out.println(\"NA\");\n\t\t }\n\n\n\t }\n }\n\n}", "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <cstring>\n\n#define ll long long\n#define ull unsigned long long\n#define pii pair<int,int>\n#define vi vector<int>\n#define VS vector<string>\n#define all(x) x.begin(),x.end()\n#define mp make_pair\n#define pb push_back\n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n for(int i=0; i < n; i++){\n string input;\n cin >> input;\n string check = input.substr(0, 2) + input.substr(input.size()-2, 2);\n\n bool isCorrect = true;\n if(check == \">'=~\"){\n if(input.size() == 4) isCorrect = false;\n\n int count = 0;\n for(int j=2; input.substr(j,1) == \"=\"; j++) count++;\n if(input.substr(count+2, 1) != \"#\") isCorrect = false;\n for(int j=2+count+1; j < 2+count*2+1; j++) if(input.substr(j, 1) != \"=\") isCorrect = false;\n if(input.size() != count*2+2+1*2) isCorrect = false;\n\n if(isCorrect) cout << \"A\" << endl;\n }else if(check == \">^~~\"){\n if(input.size() == 4) isCorrect = false;\n for(int j=2; j < input.size()-2; j+=2) if(input.substr(j, 2) != \"Q=\") isCorrect = false;\n\n if(isCorrect) cout << \"B\" << endl;\n }else {\n cout << \"NA\" << endl;\n }\n if(!isCorrect) cout << \"NA\" << endl;\n }\n}", "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\nlong n,f,i,j,k,m;\nstring s;\ncin>>n;\nfor(i=0;i<n;i++){\ncin>>s;\nif(s.substr(0,2)==\">'\"){\nif(s.substr(2,1)!=\"=\"){f=2;goto E;}\nj=s.find_first_not_of('=',3);\nm=j-2;\nif(s.substr(j,1)!=\"#\"){f=2;goto E;}\nk=s.find_first_not_of('=',j+1);\nif(k-j-1!=m){f=2;goto E;}\nif(s.substr(k,1)!=\"~\"){f=2;goto E;}\nif(k+1!=s.size()){f=2;goto E;}\nf=0;\n}else if(s.substr(0,2)==\">^\"){\nif(s.substr(2,2)!=\"Q=\"){f=2;goto E;}\nfor(j=4;;j+=2){\nif(s.substr(j,2)!=\"Q=\")break;\n}\nif(s.substr(j,2)!=\"~~\")f=2;else f=1;\n}else{\nf=2;\n}\nE:\nif(f==0)cout<<\"A\"<<endl;\nelse if(f==1)cout<<\"B\"<<endl;\nelse cout<<\"NA\"<<endl;\n}\nreturn 0;\n}", "#include <iostream>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define repc(i,s,e) for(int i=(s); i<(e); i++)\n#define pb(n) push_back((n))\n#define mp(n,m) make_pair((n),(m))\n#define all(r) r.begin(),r.end()\n#define fi first\n#define se second\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vii;\ntypedef vector<ll> vl;\ntypedef vector<vl> vll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\n\nint main() {\n\tint n;\n\tstring s;\n\tcin >> n;\n\trep(i, n) {\n\t\tcin >> s;\n\t\tstring ans;\n\t\t//cout << s.size() << endl;\n\t\tif (s.size() % 2 == 1||s.size()==4) {\n\t\t\tans = \"NA\";\n\t\t}\n\t\telse if (s[0] == '>'&&s[s.size() - 1] == '~') {\n\t\t\tif (s[1] == '\\'') {\n\t\t\t\tans = \"A\";\n\t\t\t\tfor (int i = 2; i < s.size() - 1; i++) {\n\t\t\t\t\tif (i == s.size() / 2) {\n\t\t\t\t\t\tif (s[i] != '#') {\n\t\t\t\t\t\t\tans = \"NA\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tif (s[i] != '=') {\n\t\t\t\t\t\t\tans = \"NA\";\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (s[1] == '^'&&s[s.size()-2]=='~') {\n\t\t\t\tans = \"B\";\n\t\t\t\tfor (int i = 2; i < s.size() - 2; i += 2) {\n\t\t\t\t\tif (s[i] != 'Q' || s[i + 1] != '=') {\n\t\t\t\t\t\tans = \"NA\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse ans = \"NA\";\n\t\t}\n\t\telse {\n\t\t\tans = \"NA\";\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\n\twhile(n--)\n\t{\n\t\tstring str;\n\t\tstring kp;\n\t\tstring set;\n\t\tint flag=0;\n\t\tint count=0;\n\t\tint count_b=0;\n\t\tint i=0;\n\n\t\tcin >> str;\n\t\tfor(i=0;i<2;i++)kp+=str[i]++;\n\t\t\n\t\tif(kp==\">'\")\n\t\t{\n\t\t\twhile(str[i]!='#')\n\t\t\t{\n\t\t\t\tif(str[i]=='=')count++;\n\t\t\t\telse flag=-1;\n\n\t\t\t\tif(flag==-1)break;\n\t\t\t\ti++;\t\n\t\t\t}\n\t\t\ti++;\n\t\t\twhile(str[i]!='~')\n\t\t\t{\n\t\t\t\tif(str[i]=='=')count_b++;\n\t\t\t\telse flag=-1;\n\n\t\t\t\tif(flag==-1)break;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tif(flag!=-1 && count==count_b && count>=1)flag=1;\n\n\t\t\tcount=0;\n\t\t\tfor(int j=i;j<str.length();j++)\n\t\t\t{\n\t\t\t\tif(str[i]!='~')flag=-1;\n\t\t\t\telse count++;\n\n\t\t\t\tif(flag==-1)break;\n\t\t\t}\n\t\t\tif(count!=1)flag=-1;\n\t\t}\n\t\telse if(kp==\">^\")\n\t\t{\n\t\t\twhile(i<str.length()-2)\n\t\t\t{\n\t\t\t\tcount=2;\n\t\t\t\twhile(count--)\n\t\t\t\t{\n\t\t\t\t\tset+=str[i];\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\tif(set==\"Q=\")flag=2;\n\t\t\t\telse flag=-1;\n\n\t\t\t\tset.erase(set.begin(),set.end());\n\t\t\t\tif(flag==-1)break;\n\t\t\t}\n\t\t\tfor(i=str.length()-2;i<str.length();i++)set+=str[i];\n\t\t\tif(set==\"~~\" && flag==2)flag=2;\n\t\t\telse flag=-1;\n\t\t}\n\n\t\tif(flag==1) cout << \"A\" << endl;\n\t\telse if(flag==2)cout << \"B\" << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\t\n\treturn 0;\n}", "\n#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n int n,f,i,m;\n string s;\n cin>>n;\n while(n-->0){\n cin>>s;\n f=0;\n if(s[0]+s[1]=='>'+'\\''){\n m=s.find('#');\n if(m!=string::npos){\n\tfor(i=1;s[m-i]==s[m+i];)i++;\n\tif(i>1 && m-i==1 && m+i==s.size()-1 && s[m+i]=='~')f=1;\n }\n }else if(s[0]+s[1]=='>'+'^'){\n for(i=2;s[i]=='Q'&&s[i+1]=='=';)i+=2;\n if(i>2 && i==s.size()-2 && s[i]=='~' && s[i+1]=='~')f=2;\n }\n if(f)puts(f==1?\"A\":\"B\");\n else puts(\"NA\");\n }\n}", "#ifdef LOCAL\n #define _GLIBCXX_DEBUG\n #define __clock__\n#else\n #pragma GCC optimize(\"Ofast\")\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing VI = vector<ll>;\nusing VV = vector<VI>;\nusing VS = vector<string>;\nusing PII = pair<ll, ll>;\n\n// tourist set\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p);\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p);\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p);\n\nstring to_string(const string& s) {\n return '\"' + s + '\"';\n}\n\nstring to_string(const char* s) {\n return to_string((string) s);\n}\n\nstring to_string(bool b) {\n return (b ? \"true\" : \"false\");\n}\n\nstring to_string(vector<bool> v) {\n bool first = true;\n string res = \"{\";\n for (int i = 0; i < static_cast<int>(v.size()); i++) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(v[i]);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <size_t N>\nstring to_string(bitset<N> v) {\n string res = \"\";\n for (size_t i = 0; i < N; i++) {\n res += static_cast<char>('0' + v[i]);\n }\n return res;\n}\n\ntemplate <typename A>\nstring to_string(A v) {\n bool first = true;\n string res = \"{\";\n for (const auto &x : v) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p) {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \")\";\n}\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";\n}\n\nvoid debug_out() { cerr << '\\n'; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n// tourist set end\n\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\n#define rep(i,b) FOR(i, 0, b)\n#define ALL(v) (v).begin(), (v).end()\n#define p(s) cout<<(s)<<'\\n'\n#define p2(s, t) cout << (s) << \" \" << (t) << '\\n'\n#define br() p(\"\")\n#define pn(s) cout << (#s) << \" \" << (s) << '\\n'\n#define p_yes() p(\"YES\")\n#define p_no() p(\"NO\")\n#define SZ(x) ((int)(x).size())\n#define SORT(A) sort(ALL(A))\n#define RSORT(A) sort(ALL(A), greater<ll>())\n#define MP make_pair\n\nvoid no(){p_no(); exit(0);}\nvoid yes(){p_yes(); exit(0);}\n\nconst ll mod = 1e9 + 7;\nconst ll inf = 1e18;\nconst double PI = acos(-1);\n\n// >'======#======~\nbool is_pattern_A(string s){\n ll L = s.size();\n // check tail\n if(s.back()!='~') return false;\n string body = s.substr(2, L-3);\n if(body.size()%2==0) return false;\n ll c = body.size()/2;\n if(body[c]!='#') return false;\n map<char, ll> mp;\n for(char c : body){\n mp[c]++;\n }\n if(mp['=']>0 && mp['=']==body.size()-1 && mp['#']==1){\n return true;\n }else{\n return false;\n }\n}\n\nbool is_pattern_B(string s){\n ll L = s.size();\n string tail = s.substr(L-2);\n if(tail!=\"~~\") return false;\n string body = s.substr(2, L-4);\n if(body.size()==0) return false;\n if(body.size()%2==1) return false;\n for(int i=0; i<body.size(); i+=2){\n if(body[i]=='Q' && body[i+1]=='='){\n // ok\n }else{\n return false;\n }\n }\n return true;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n // input\n ll N; \n cin >> N;\n\n rep(i, N){\n string s;cin>>s;\n if(s.size()==1){\n p(\"NA\");\n continue;\n }\n string head = s.substr(0, 2);\n if(head==\">'\"){\n if(is_pattern_A(s)){\n p(\"A\");\n }else{\n p(\"NA\");\n }\n }\n else if(head==\">^\"){\n if(is_pattern_B(s)){\n p(\"B\");\n }else{\n p(\"NA\");\n }\n }\n else{\n p(\"NA\");\n }\n }\n\n \n return 0;\n}\n", "#!/usr/bin/env python3\nimport re\n\nans = ['A', 'B', 'NA']\nfor _ in range(int(input())):\n s = input()\n l = max([1, (len(s) - 4) // 2])\n p = [r\">'\"+(\"=\"*l)+\"#\"+(\"=\"*l)+\"~\", r'>\\^(Q=)+~~', r'\\S']\n for i in range(3):\n if re.match(p[i], s):\n print(ans[i])\n break\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int T;\n cin >> T;\n while(T--) {\n string s;\n cin >> s;\n if(s[0]!='>'||s.size()<=3) cout << \"NA\" << endl;\n else if(s[1]=='\\'') {\n if(s[s.size()-1]!='~'||s.size()%2) {\n cout << \"NA\" << endl;\n goto next;\n }\n s=s.substr(2,s.size()-3);\n for(int i=0; i<s.size()/2; i++) {\n if(s[i]!='='||s[i+s.size()/2+1]!='=') {\n cout << \"NA\" << endl;\n goto next;\n }\n }\n if(s.size()<3||s[s.size()/2]!='#') cout << \"NA\" << endl;\n else cout << \"A\" << endl;\n } else {\n if(s[s.size()-2]!='~'||s[s.size()-1]!='~'||s.size()%2) {\n cout << \"NA\" << endl;\n goto next;\n }\n s=s.substr(2,s.size()-4);\n for(int i=0; i<s.size(); i+=2) {\n if(s[i]!='Q'||s[i+1]!='=') {\n cout << \"NA\" << endl;\n goto next;\n }\n }\n if(s.size()>=2) cout << \"B\" << endl;\n else cout << \"NA\" << endl;\n }\n next:;\n }\n return 0;\n}\n", "#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tstring s, r;\n\tint n,i;\n\tbool b;\n\tcin>>n;\n\twhile(n--)\n\t{\n\t\tcin>>s;\n\t\tr = \"NA\";\n\t\tif(s.size() > 5 && (s.size()&1)==0 && s[0]=='>')\n\t\t{\n\t\t\tif(s[1]=='\\'')\n\t\t\t{\n\t\t\t\tif(s[s.size()-1]=='~' && s[s.size()/2]=='#')\n\t\t\t\t{\n\t\t\t\t\tb=true;\n\t\t\t\t\tfor(i=2;i<s.size()/2;++i)\n\t\t\t\t\t\tif(s[i]!= '=') b=false;\n\t\t\t\t\tfor(i=s.size()/2+1;i<s.size()-1;++i)\n\t\t\t\t\t\tif(s[i]!= '=') b=false;\n\t\t\t\t\tif(b) r = 'A';\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(s[1]=='^')\n\t\t\t{\n\t\t\t\tif(s[s.size()-1]=='~' && s[s.size()-2]=='~')\n\t\t\t\t{\n\t\t\t\t\tb=true;\n\t\t\t\t\tfor(i=2;i<s.size()-2;i+=2)\n\t\t\t\t\t\tif( !(s[i]=='Q' && s[i+1]=='=') )b=false;\n\t\t\t\t\tif(b) r='B';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << r << endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<string>\n#include<sstream>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;++i){\n\t\tstring line;\n\t\tcin>>line;\n\t\tstring sol = \"NA\";\n\t\tif(line.find('#')!=string::npos){\n\t\t\tbool flag = false;\n\t\t\tstring a = \"\";\n\t\t\tstring b = \"\";\n\t\t\tfor(int x=2;x<line.size()-1;++x){\n\t\t\t\tif(line[x] == '#'){\n\t\t\t\t\tflag = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(!flag){\n\t\t\t\t\ta += line[x];\n\t\t\t\t}else{\n\t\t\t\t\tb += line[x];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(line.size()> 3 && line[0]=='>' && line[1]=='\\'' && line[line.size()-1]=='~' && a==b && a!=\"\")sol = \"A\";\n\t\t}else{\n\t\t\tbool flag = true;\n\t\t\tfor(int x=2;line.size()>4 && x<(line.size()-3);x+=2){\n\t\t\t\tif(line[x] !='Q' || line[x+1] != '=')flag = false;\n\t\t\t}\n\t\t\tif(line.size()>4 && line[0]=='>' && line[1]=='^' && line[line.size()-1]=='~' && line[line.size()-2]=='~' && flag)sol=\"B\";\t}\n\t\tcout<<sol<<endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint main() {\n int Tc; string s;\n while(cin>>Tc) {\n while(Tc--) {\n cin >> s;\n int const N = s.size();\n bool NA = 0;\n bool isA;\n if(s[0] != '>') NA = 1;\n if(s[1] == '\\'') {\n\tif(s[2] != '=') NA = 1;\n\tfor(int i=2; i<(N-3)/2+2; i++) if(s[i]!='=') NA=1;\n\tif(s.substr(2, (N-3)/2) + \"~\" != s.substr(3+(N-3)/2)) NA = 1;\n\tif(s[(N-3)/2+2] != '#') NA = 1;\n\tisA = 1;\n }\n else if(s[1] == '^') {\n\tint cnt;\n\tif( !(s[2] == 'Q' && s[3] == '=') ) NA = 1;\n\tfor(cnt=2; cnt<N-2; cnt+=2) {\n\t if(!(s[cnt] == 'Q' && s[cnt+1] == '=')) NA = 1;\n\t}\n\tif(!(s[cnt] == '~' && s[cnt+1] == '~')) NA = 1;\n\tif(cnt+2 != N) NA = 1;\n\tisA = 0;\n }\n else {\n\tNA = 1;\n }\n \n if(NA) cout << \"NA\" << endl;\n else if(isA) cout << \"A\" << endl;\n else cout << \"B\" << endl;\n }\n }\n \n return 0;\n}", "#include<iostream>\n#include<cstring>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<cstdio>\n#include<cmath>\n#define pb(in,tmp) in.push_back(tmp)\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,b) loop(i,0,b)\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n rep(i,n){\n string ans;\n string s;\n\tcin>>s;\n\tif(s[0]!='>'){cout<<\"NA\"<<endl;continue;}\n\tif(s[1]=='^'){\n\t ans='B';\n\t int j=2;\n\t if(s[j]!='Q'||s[j+1]!='=')ans=\"NA\";\n\t while(s[j]=='Q'&&s[j+1]=='=')j+=2;\n if(s[j]!='~'||s[j+1]!='~')ans=\"NA\";\n\t j+=2;\n\t if(j!=s.size())ans=\"NA\";\n\t}else if(s[1]=='\\''){\n\t ans='A';\n\t int h1=0,h2=0;\n\t int j=1;\n\t while(s[++j]=='=')h1++;\n\t if(s[j]!='#')ans=\"NA\";\n\t while(s[++j]=='=')h2++;\n\t if(s[j]!='~')ans=\"NA\";\n\t if(++j!=s.size())ans=\"NA\";\n\t if(h1!=h2||!h1)ans=\"NA\";\n\t}else ans=\"NA\";\n\tcout<<ans<<endl;\n }\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define FR first\n#define SC second\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\n#define each(a, b) for(auto& a : b)\n\ntypedef pair<int, int> P;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n int n; cin >> n;\n while(n--) {\n string s; cin >> s;\n int kind = 0;\n int sz = s.size();\n if(s[0] == '>' && s[1] == '\\'' && s[sz-1] == '~' && s.size() > 5) kind = 1;\n else if(s[0] == '>' && s[1] == '^' && s[sz-1] == '~' && s[sz-2] == '~' && sz%2 == 0 && s.size() > 4) kind = 2;\n else kind = 3;\n if(kind == 1) {\n int cnt = 0, cmp = 0;\n for(int i = 2; i < sz-1 && kind != 3; i++) {\n\tif(s[i] != '=' && s[i] != '#') kind = 3;\n\telse {\n\t if(s[i] == '=') cnt++;\n\t else if(s[i] == '#' && !cmp) cmp = cnt, cnt = 0;\n\t else kind = 3;\n\t}\n }\n if(cnt != cmp) kind = 3;\n } else if(kind == 2) {\n for(int i = 2; i < sz-2 && kind != 3; i+=2) {\n\tif(s.substr(i, 2) != \"Q=\") kind = 3;\n }\n }\n if(kind == 1) puts(\"A\");\n else if(kind == 2) puts(\"B\");\n else if(kind == 3) puts(\"NA\");\n }\n \n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n#define loop(i,a,b) for(int i=(a);i<ull(b);++i)\n#define rep(i,n) loop(i,0,n)\n#define all(a) (a).begin(), (a).end()\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst double inf = (int)1e8;\n\nint main(){\n\tint n; cin >> n;\n\trep(q, n){\n\t\tstring s; cin >> s;\n\t\tif(s.substr(0, 2) == \">'\"){\n\t\t\ts = s.substr(2);\n\t\t\tint c = 0;\n\t\t\tbool p = true;\n\t\t\tfor(int i=0; i < s.size(); i++) if(s[i] == '='){c++;} else break;\n\t\t\tif(s[c] != '#' || c == 0)p = false;\n\t\t\ts = s.substr(c+1);\n\t\t\tif(c+1 != s.size() || s[s.size()-1] != '~')p = false;\n\t\t\trep(i, c) if(s[i] != '=')p = false;\n\t\t\tcout << (p ? \"A\" : \"NA\") << endl;\n\t\t}else if(s.substr(0, 2) == \">^\"){\n\t\t\tbool p = true;\n\t\t\ts = s.substr(2);\n\t\t\tif(s.substr(0, 2) != \"Q=\") p = false;\n\t\t\twhile(s.substr(0, 2) == \"Q=\") s = s.substr(2);\n\t\t\tcout << (s == \"~~\" && p ? \"B\" : \"NA\") << endl;\n\t\t}else {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n}", "import java.util.Scanner;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\n\tpublic static final int BIG_NUM = 2000000000;\n\tpublic static final int MOD = 1000000007;\n\tpublic static final long HUGE_NUM = 99999999999999999L;\n\tpublic static final double EPS = 0.000000001;\n\n\t@SuppressWarnings(\"unchecked\")\n\tpublic static void main(String[] args) {\n\n\t\t//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tScanner scanner = new Scanner(System.in);\n\n\t\tint N = scanner.nextInt();\n\t\tStringBuilder ans = new StringBuilder();\n\n\t\tfor(int loop = 0; loop < N; loop++){\n\n\t\t\tString input_str = scanner.next();\n\n\t\t\tif(input_str.matches(\"\\\\A>'(=+)#\\\\1~\\\\z\")){\n\n\t\t\t\tans.append(\"A\\n\");\n\n\t\t\t}else if(input_str.matches(\"\\\\A>\\\\^(Q=)+~~\\\\z\")){\n\n\t\t\t\tans.append(\"B\\n\");\n\n\t\t\t}else{\n\n\t\t\t\tans.append(\"NA\\n\");\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(ans.toString());\n\t}\n}\n\nclass UTIL{\n\n\t//最大公約数\n\tpublic static long gcd(long x,long y){\n\n\t\tx = Math.abs(x);\n\t\ty = Math.abs(y);\n\n\t\tif(x < y){\n\n\t\t\tlong tmp = y;\n\t\t\ty = x;\n\t\t\tx = tmp;\n\t\t}\n\n\t\tif(y == 0){\n\n\t\t\treturn x;\n\t\t}else{\n\n\t\t\treturn gcd(y,x%y);\n\t\t}\n\t}\n\n\t//最小公倍数\n\tpublic static long lcm(long x,long y){\n\n\t\treturn (x*y)/gcd(x,y);\n\t}\n\n\t//String→intへ変換\n public static int getNUM(String tmp_str){\n\n return Integer.parseInt(tmp_str);\n }\n\n //文字が半角数字か判定する関数\n public static boolean isNumber(String tmp_str){\n\n if(tmp_str == null || tmp_str.length() == 0){\n\n return false;\n }\n\n Pattern pattern = Pattern.compile(\"\\\\A[0-9]+\\\\z\");\n Matcher matcher = pattern.matcher(tmp_str);\n return matcher.matches();\n }\n}\n", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n\n for(int q=0;q<n;q++) {\n string str;\n cin >> str;\n if(str[0] != '>') {\n cout <<\"NA\"<<endl; \n continue;\n } else if(str[1] != '\\''&& str[1] != '^') {\n cout << \"NA\" << endl;\n continue;\n }\n int flg = 0,sum;\n if(str[1] == '\\'') {\n int t = 0;\n sum=0;\n for(int i=2;i<str.size();i++) {\n\tif(str[i] == '=') t++;\n\telse if(str[i] == '#' && sum==0 && i!=2) sum = t , t = 0;\n\telse break;\n\tif(str[str.size()-1] == '~' && i == str.size() -2 && sum==t ) flg = 1;\n\t\n }\n }\n\n if(str[1] == '^' && flg == 0) {\n\tflg = 0;\n\tfor(int i=2;i<str.size() ;i++) {\n\t if(i%2 == 0 && str[i] != 'Q') break;\n\t if(i%2 == 1 && str[i] !='=') break;\n\n\t if(str[str.size()-2] == '~' && str[str.size()-1] =='~' && i == str.size()-3&& i%2==1 ){\n\t flg = 2;\n\t break;\n\t }\n\t}\n }\n\n if(flg == 0) cout << \"NA\" << endl;\n else if(flg == 1)cout <<\"A\" << endl;\n else if(flg == 2) cout << \"B\"<<endl;\n } \n\n\n return 0;\n}", "#include<iostream>\n#include<string>\n \nusing namespace std;\n \nint check(string str)\n{\n if(str[0] != '>'){ return -1; }\n if(str[1] != '\\'' && str[1] != '^'){ return -1; }\n if(str[2] == '='){\n if(str[str.size()-1] != '~' || str[str.size()-2] != '='){ return -1; }\n int i=3,cnt1=1,cnt2=0;\n while(str[i] != '#'){\n if(i >= str.size()){ return -1; }\n if(str[i] != '=') { return -1; }\n i++;\n cnt1++;\n }\n i++;\n while(str[i] == '='){\n if(i >= str.size()){ return -1; }\n i++;\n cnt2++;\n }\n if(cnt1 == cnt2){ return 0; }\n else{ return -1; }\n }\n else if(str[2] == 'Q'){\n if(str[str.size()-1] != '~' ||\n str[str.size()-2] != '~' ||\n str[str.size()-3] != '='){ return -1; }\n int i = 3;\n while(1){\n if(i >= str.size()-2){ return 1; }\n if(i&1){\n if(str[i] != '='){ return -1; }\n }\n else{\n if(str[i] != 'Q'){ return -1; }\n }\n i++;\n }\n return 1;\n }\n else{ return -1; }\n \n}\n \nint main(void)\n{\n \n int n;\n string str;\n \n cin >> n;\n \n while(n-->0){\n cin >> str;\n int ans = check(str);\n if(ans < 0){ cout << \"NA\" << endl; }\n if(ans == 0){ cout << \"A\" << endl; }\n if(ans == 1){ cout << \"B\" << endl; }\n }\n \n return 0;\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\nint isfa(string);\nint isfb(string);\n\nint main(){\n int n,fa,fb;\n string str;\n cin >> n;\n\n for(int i = 0;i < n;i++){\n cin >> str;\n if(str.size()>5){\n fa = isfa(str);\n fb = isfb(str);\n }else fa=fb=0;\n\n if(fa == 1)\n cout << \"A\" << endl;\n else if(fb == 1)\n cout << \"B\" << endl;\n else \n cout << \"NA\" << endl;\n }\n return 0;\n}\n\nint isfa(string n){\n int pos,c1,c2;\n c1=c2=0;\n pos=n.size()-1;\n if(n[0]!='>')return 0;\n if(n[1]!='\\'')return 0;\n if(n[pos]!='~')return 0;\n pos--;\n while(n[pos]=='='){\n c1++;\n pos--;\n }\n if(n[pos]!='#')return 0;\n pos--;\n while(n[pos]=='='){\n c2++;\n pos--;\n }\n if(c1!=c2)return 0;\n if(pos!=1)return 0;\n\n return 1;\n}\n\nint isfb(string n){\n int pos;\n pos = n.size()-1;\n if(n[pos]!='~'||n[pos-1]!='~')\n return 0;\n if(n[0]!='>'||n[1]!='^')return 0;\n pos -= 2;\n while(n[pos]=='='&&n[pos-1]=='Q')pos-=2;\n if(pos!=1)return 0;\n return 1;\n}\n\n\n\n ", "import java.util.*;\nimport java.util.regex.*;\n\nimport static java.lang.Math.*;\nimport static java.lang.System.out;\n\n// AOJ\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tnew Main().AOJ0139();\n\t}\n\tvoid AOJ0145(){\n\t\tint n=sc.nextInt();\n\t\t\n\t}\n\t\n\tvoid AOJ0141(){\n\t\tint N=sc.nextInt();\n\t\tfor(int I=1; I<=N; I++){\n\t\t\tint n=sc.nextInt();\n\t\t\tchar[][] c=new char[n+4][n+4];\n\t\t\tint[] vx={0, 1, 0, -1};\n\t\t\tint[] vy={-1, 0, 1, 0};\n\t\t\tc=solve141(2, n+1, n, c, vx, vy);\n\t\t\tfor(int j=2; j<=n+1; j++){\n\t\t\t\tfor(int i=2; i<=n+1; i++)\tout.print(c[i][j]);\n\t\t\t\tout.println();\n\t\t\t}\n\t\t\tout.println();\n\t\t}\n\t}\n\tchar[][] solve141(int x, int y, int n, char[][] c, int[] vx, int[] vy){\n\t\t//範囲を超えていないか\n\t\tif(x<2&&x>n+1 && y<2&&y>n+1)\treturn c;\n\t\t//周りが#\n\t\t//return c;\n\t\t\n\t\tc[x][y]='#';\n\t\t\n\t\t// 1周目\n\t\tif(x==2){\n\t\t\tif(y!=2)\tsolve141(x, y-1, n, c, vx, vy);\n\t\t\telse\tsolve141(x+1, y, n, c, vx, vy);\n\t\t}\n\t\tif(y==2){\n\t\t\tif(x!=n+1)\tsolve141(x+1, y, n, c, vx, vy);\n\t\t\telse\tsolve141(x, y+1, n, c, vx, vy);\n\t\t}\n\t\tif(x==n+1){\n\t\t\tif(y!=2)\tsolve141(x, y+1,n,c,vx,vy);\n\t\t\telse\tsolve141(x-1, y,n,c,vx,vy);\n\t\t}\n\t\tif(y==n+1){\n\t\t\tif(x!=3)\tsolve141(x-1,y,n,c,vx,vy);\n\t\t\telse\tsolve141(x,y-1,n,c,vx,vy);\n\t\t}\n\t\t\n\t\t// それ以降\n\t\tfor(int i=0; i<4; i++){\n\t\t\tif(c[x+vx[i]][y+vy[i]]!='#'){\n\t\t\t\tsolve141(x+vx[i], y+vy[i],n,c,vx,vy);\n\t\t\t}\n\t\t}\n\n\t\treturn c;\n\t}\n\t\n\t\n\tvoid AOJ0139(){\n\t\tint N=sc.nextInt();\n\t\tfor(int i=1; i<=N; i++){\n\t\t\tString s=sc.next();\n\t\t\tMatcher m=Pattern.compile(\"^>'(=+)#(=+)~$\").matcher(s);\n\t\t\tif(m.matches()){\n\t\t\t\tif(m.group(1).length()==m.group(2).length()){\n\t\t\t\t\tout.println(\"A\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}else if(Pattern.compile(\"^>\\\\^(Q=)+~~$\").matcher(s).matches()){\n\t\t\t\tout.println(\"B\");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tout.println(\"NA\");\n\t\t}\n\t}\n\t\n\tvoid AOJ0137(){\n\t\tint N=sc.nextInt();\n\t\tfor(int i=1; i<=N; i++){\n\t\t\tlong s=sc.nextLong();\n\t\t\tout.println(\"Case \"+i+\":\");\n\t\t\tfor(int j=0; j<10; j++){\n\t\t\t\ts*=s;\ts/=100;\ts%=10000;\n\t\t\t\tout.println(s);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tArrayList<Integer> Sieve2(int N){\n\t ArrayList<Integer> prime = new ArrayList<Integer>();\n\t boolean[] list = new boolean[N+1];\n\t Arrays.fill(list, true);\n\t list[1]=false;\n\t for (int i=2; i<=N; i++) {\n\t if(list[i]) {\n\t prime.add(i);\n\t for (int j=i+i; j<=N; j+=i) list[j] = false;\n\t }\n\t }\n\t return prime;\n\t}\n\n\tboolean[] Sieve(int N){\n\t boolean[] list = new boolean[N+1];\n\t Arrays.fill(list, true);\n\t list[1]=false;\n\t for(int i=2; i<=N; i++) {\n\t if(list[i]) {\n\t for (int j=i+i; j<=N; j+=i) list[j] = false;\n\t }\n\t }\n\t return list;\n\t}\n\t\n\t//素数判定\n\tboolean isPrime(int n){\n\t for(int i=2; i*i<=n; i++){\n\t if(n%i==0) return false;\n\t }\n\t return true;\n\t}\n\t\n\tint gcd(int x, int y){\n\t\tif(y==0)\treturn x;\n\t\telse\treturn gcd(y, x%y);\n\t}\n}", "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nbool check_A(string str){\n\tif(str.size() < 6 || str.size() % 2 == 1){\n\t\treturn false;\n\t}\n\tif(str.substr(0, 2) != \">'\"){\n\t\treturn false;\n\t}\n\tint count = 0;\n\tfor(int i = 2; i < (str.size() - 4) / 2 + 2; i++){\n\t\tif(str[i] != '='){\n\t\t\treturn false;\n\t\t}\n\t}\n\tif(str[str.size() / 2] != '#'){\n\t\treturn false;\n\t}\n\tfor(int i = str.size() / 2 + 1; i <= str.size() - 2; i++){\n\t\tif(str[i] != '='){\n\t\t\treturn false;\n\t\t}\n\t}\n\tif(str[str.size() - 1] != '~'){\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nbool check_B(string str){\n\tif(str.size() < 6 || str.size() % 2 == 1){\n\t\treturn false;\n\t}\n\tif(str.substr(0, 2) != \">^\"){\n\t\treturn false;\n\t}\n\tfor(int i = 2; i < str.size() - 2; i += 2){\n\t\tif(str.substr(i, 2) != \"Q=\"){\n\t\t\treturn false;\n\t\t}\n\t}\n\tif(str.substr(str.size() - 2, 2) != \"~~\"){\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nint main(){\n\t\n\tint n;\n\t\n\tstring str;\n\t\n\tcin >> n;\n\t\n\tfor(int loop = 0; loop < n; loop++){\n\t\tcin >> str;\n\t\tif(check_A(str)){\n\t\t\tprintf(\"A\\n\");\n\t\t}else if(check_B(str)){\n\t\t\tprintf(\"B\\n\");\n\t\t}else{\n\t\t\tprintf(\"NA\\n\");\n\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}", "for _ in [0]*int(input()):\n s=input()\n if s[:2]==\">'\" and s[-1]=='~' and '#' in s:\n s=s[2:-1].split('#')\n print(['NA','A'][set(s[0])==set(s[1])=={'='} and len(set(s))==1])\n elif s[:2]=='>^' and s[-2:]=='~~':\n s=s[2:-2]\n print(['NA','B'][len(s)==2*s.count('Q=') and len(s)>0])\n else:print('NA')", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tSnake s;\n\t\t\n\t\tfor(int i=0;i<n;i++){\n\t\t\ts = new Snake(scan.next());\n\t\t\tSystem.out.println(s.getType());\n\t\t}\n\t}\n}\n\nclass Snake{\n\tString snake;\n\t\n\tSnake(String str){\n\t\tsnake = str;\n\t}\n\t\n\tpublic String getType(){\n\t\tswitch(checkHead()){\n\t\tcase 1:\n\t\t\treturn \"A\";\n\t\tcase 2:\n\t\t\treturn \"B\";\n\t\tdefault:\n\t\t\treturn \"NA\";\n\t\t}\n\t}\n\t\n\tpublic int checkHead(){\n\t\tif(snake.charAt(0) == 62){\n\t\t\tif(snake.charAt(1) == 39){\n\t\t\t\treturn checkBodyA();\n\t\t\t}else if(snake.charAt(1) == 94){\n\t\t\t\treturn checkBodyB();\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\t\n\tpublic int checkBodyA(){\n\t\tint count = 0;\n\t\tboolean flag = true;\n\t\t\n\t\tif(snake.charAt(2) == 61){\n\t\t\tcount++;\n\t\t}else{\n\t\t\treturn -1;\n\t\t}\n\t\t\n\t\tfor(int i=3;i<snake.length()-1;i++){\n\t\t\tif(flag){\n\t\t\t\tif(snake.charAt(i) == 61){\n\t\t\t\t\tcount++;\n\t\t\t\t}else if(snake.charAt(i) == 35){\n\t\t\t\t\tflag = false;\n\t\t\t\t}else{\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(snake.charAt(i) == 61){\n\t\t\t\t\tcount--;\n\t\t\t\t}else{\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(count == 0){\n\t\t\tif(snake.charAt(snake.length()-1) == 126){\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn -1;\n\t}\n\t\n\tpublic int checkBodyB(){\n\t\tboolean flag = false;\n\t\t\n\t\tfor(int i=3;i<snake.length();i+=2){\n\t\t\tif(snake.charAt(i-1)==81){\n\t\t\t\tif(snake.charAt(i) == 61){\n\t\t\t\t\tflag = true;\n\t\t\t\t}else{\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}else if(snake.charAt(i-1) == 126){\n\t\t\t\tif(snake.charAt(i) == 126){\n\t\t\t\t\tif(flag){\n\t\t\t\t\t\treturn 2;\n\t\t\t\t\t}else{\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn -1;\n\t}\n}", "#include <iostream>\nusing namespace std;\n\ntypedef string::iterator S;\nstring ss;\n\nstring snakeA(S it){\n int count = 0;\n for(;it!=ss.end()&&*it=='=';it++,count++);\n if(!count) return \"NA\";\n if(it==ss.end()||*it!='#') return \"NA\";\n it++;\n for(;it!=ss.end()&&*it=='=';it++,count--);\n if(it==ss.end()||*it!='~') return \"NA\";\n it++;\n if(*it||count) return \"NA\";\n return \"A\";\n}\n\nstring snakeB(S it){\n while(true){\n if(it==ss.end()||*it++!='Q') return \"NA\";\n if(it==ss.end()||*it++!='=') return \"NA\";\n if(it==ss.end()) return \"NA\";\n if(*it=='~') break;\n }\n if(*++it=='~'&&!*++it) return \"B\";\n return \"NA\";\n}\n\nstring snake(string ss){\n S it = ss.begin();\n if( *it++ != '>' ) return \"NA\";\n if( *it == '\\'' ) return snakeA(++it);\n else if( *it == '^' ) return snakeB(++it);\n else return \"NA\";\n}\n\nint main(){\n int n;\n for(cin>>n,cin.ignore();n--;){\n getline(cin, ss);\n cout<<snake(ss)<<endl;\n }\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <string.h>\nusing namespace std;\nint checksnake(string, int);\n\nint main(void) {\n int n, len;\n char snake[200];\n int type;\n cin >> n;\n for(int i = 0 ; i < n ; i++) {\n scanf(\"%s\", snake);\n len = strlen(snake);\n type = checksnake(snake, len);\n if(type == 1) cout << 'A' << endl;\n else if(type == 2) cout << 'B' << endl;\n else if(type == 3) cout << \"NA\" << endl;\n for(int a = 0 ; a < 200 ; a++) {\n snake[a] = 0;\n }\n len = 0;\n }\n return 0;\n}\n\nint checksnake(string snake, int len) {\n int flag1=0, flag2=0, flag3=0;\n int true_flag=0, true_flag2=0, true_flag3=0;\n int cnt1=0, cnt2=0;\n \n if(true_flag == 0) {\n for(int i = 0 ; i < len - 1 ; i++) {\n if(snake[i] != '>' && snake[i] != '#' && snake[i] != '=' && snake[i] != '\\'') { true_flag2 = 1; break; }\n if(snake[i] == '>' && snake[i+1] == '\\'') flag2 = 1;\n if(snake[i] == '=' && flag1 == 0 && flag2 == 1) {cnt1++; flag3 = 1; }\n if(snake[i] == '=' && flag1 == 1 && flag2 == 1) {cnt2++; flag3 = 1; }\n if(snake[i] == '#' && flag2 == 1 && flag3 == 1) flag1 = 1;\n //cout << cnt1 << ' ' << cnt2 << endl;\n }\n if(snake[len-1] == '~' && cnt1 == cnt2 && flag2 == 1 && flag3 == 1 && true_flag2 == 0) {\n return 1;\n true_flag = 1;\n }\n }\n \n if(true_flag == 0) {\n for(int i = 0 ; i < len - 2 ; i++) {\n if(snake[i] != '>' && snake[i] != '^' && snake[i] != '=' && snake[i] != 'Q') { true_flag3 = 1; break; }\n if(snake[i] == '>' && snake[i+1] == '^') flag3 = 1;\n if(snake[i] == 'Q' && snake[i+1] == '=' && flag3 == 1) flag1 = 1;\n }\n if(snake[len-2] == '~' && snake[len-1] == '~' && flag1 == 1 && flag3 == 1 && true_flag3 == 0) {\n return 2;\n true_flag = 1;\n }\n }\n\n if(true_flag == 0 || true_flag2 == 1 || true_flag3 == 1) {\n return 3;\n }\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nbool isa(string s) {\n int pos = 2,cnt = 0;\n if(s[pos] != '=') return false;\n while(s[pos] == '=') pos++,cnt++;\n if(s[pos] != '#') return false;\n pos++;\n\n for(int i=0; i<cnt; ++i) {\n if(s[pos+i] != '=') return false;\n }\n pos += cnt;\n if(pos == s.length()-1 && s[pos] == '~') return true;\n return false;\n}\n\nbool isb(string s) {\n int pos = 2;\n if(s[2] != 'Q' || s[3] != '=') return false;\n for(; pos < s.length()-2; pos += 2)\n if(s[pos] != 'Q' || s[pos+1] != '=') return false;\n\n if(s[s.length()-1] == s[s.length()-2] && s[s.length()-1] == '~') return true;\n return false;\n}\n\nint main() {\n int n;\n cin>>n;\n\n string s;\n for(int i=0; i<n; ++i) {\n cin>>s;\n\n if(s.length() <= 2 || s[0] != '>') {\n cout<<\"NA\"<<endl;\n } else if(s[1] == '\\'') {\n if(isa(s)) {\n cout<<\"A\"<<endl;\n }else{\n cout<<\"NA\"<<endl;\n }\n } else {\n if(isb(s)) {\n cout<<\"B\"<<endl;\n }else{\n cout<<\"NA\"<<endl;\n }\n }\n }\n}", "import java.util.*;\nclass Main{\n\tpublic static void main(String args[]){\n\t\tScanner s=new Scanner(System.in);\n\t\tint a=s.nextInt();\n\t\tfor(int i=0;i<a;i++){\n\t\t\tString str=s.next();\n\t\t\tboolean A=true;\n\t\t\tboolean B=true;\n\t\t\tif(str.charAt(0)!='>')A=B=false;\n\t\t\tif(str.length()<6||str.length()%2==1)A=B=false;\n\t\t\tif(str.length()>=6&&str.length()%2==0){\n\t\t\t\tif(str.charAt(1)!='\\'')A=false;\n\t\t\t\tif(str.charAt(1)!='^')B=false;\n\t\t\t\tif(str.charAt(str.length()-1)!='~')A=B=false;\n\t\t\t\tif(str.charAt(str.length()-2)!='~')B=false;\n\t\t\t\tif(A){\n\t\t\t\t\tString [] dat=str.split(\"#\");\n\t\t\t\t\tif(dat.length!=2)A=false;\n\t\t\t\t\tif(A){\n\t\t\t\t\t\tif(dat[0].length()==dat[1].length()+1||dat[0].length()>2){\n\t\t\t\t\t\t\tfor(int j=0;j<dat[1].length()-1;j++){\n\t\t\t\t\t\t\t\tif(dat[0].charAt(2+j)!='='||dat[1].charAt(j)!='=')A=false;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}else A=false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(B){\n\t\t\t\t\tfor(int j=2;j<str.length()-2;j+=2){\n\t\t\t\t\t\tif(str.charAt(j)!='Q'||str.charAt(j+1)!='=')B=false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(A)System.out.println(\"A\");\n\t\t\telse if(B)System.out.println(\"B\");\n\t\t\telse System.out.println(\"NA\");\n\t\t}\n\t}\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n int n;\n for(cin>>n;n--;)\n {\n string s;\n cin>>s;\n string ans=\"NA\";\n\n\tif(s.substr(0,2)==\">'\" &&s[s.size()-1]=='~')\n\t {\n\t string tmp=s.substr(2,s.size()-3);\n\t //\t cout<<tmp<<endl;\n\t if(tmp.size()%2!=0\n\t && tmp.size()>1\n\t && tmp[tmp.size()/2]=='#'\n\t && tmp.substr(0,tmp.size()/2)==tmp.substr(tmp.size()/2+1,tmp.size()/2)\n\t && tmp.substr(0,tmp.size()/2)==*(new string(tmp.size()/2,'=')))\n\t\tans=\"A\";\n\t }\n\telse if(s.substr(0,2)==\">^\" && s.substr(s.size()-2,2)==\"~~\")\n\t {\n\t string tmp=s.substr(2,s.size()-4);\n\t //\t cout<<tmp<<endl;\n\t bool flag=false;\n\t while(tmp.size()>0)\n\t {\n\t\tif(tmp.substr(0,2)==\"Q=\")\n\t\t {\n\t\t tmp=tmp.substr(2,tmp.size()-2);\n\t\t flag=true;\n\t\t }\n\t\telse\n\t\t break;\n\t }\n\t if(tmp.size()==0&&flag)\n\t ans=\"B\";\t \n\t }\n\t cout<<ans<<endl;\n }\n}", "#include<iostream>\n#include<string>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\nusing namespace std;\n\nbool asnake(string s){\n\tint n=s.size();\n\tif(n%2 || n<6)return false;\n\tstring com=\">\\'\";\n\trep(i,(n-4)/2)com+='=';\n\tcom+='#';\n\trep(i,(n-4)/2)com+='=';\n\tcom+='~';\n\tif(s==com)return true;\n\telse return false;\n}\n\nbool bsnake(string s){\n\tint n=s.size();\n\tif(n%2 || n<6)return false;\n\tstring com=\">^\";\n\trep(i,(n-4)/2)com+=\"Q=\";\n\tcom+=\"~~\";\n\tif(s==com)return true;\n\telse return false;\n}\n\nint main(){\n\tint n;\n\tcin>>n;\n\trep(p,n){\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(asnake(s))cout<<\"A\"<<endl;\n\t\telse if(bsnake(s))cout<<\"B\"<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t}\n\treturn 0;\n}", "import static java.util.Arrays.deepToString;\n\nimport java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\tvoid tr(Object... os) {\n\t\tSystem.err.println(deepToString(os));\n\t}\n\n\tScanner sc = new Scanner(System.in);\n\tvoid run() {\n \t\tfor (int testcase = sc.nextInt(); testcase-->0;) {\n \t\t\tString s = sc.next();\n \t\t\tif (isA(s)) System.out.println(\"A\");\n \t\t\telse if (isB(s)) System.out.println(\"B\");\n \t\t\telse System.out.println(\"NA\");\n\t\t}\n\t}\n\t\n\tboolean isA(String s) {\n\t\tPattern p = Pattern.compile(\">'(=+)#(=+)~\");\n\t\tMatcher matcher = p.matcher(s);\n\t\tif (matcher.matches()) {\n\t\t\tif (matcher.group(1).equals(matcher.group(2))) return true;\n\t\t}\n\t\treturn false;\n\t}\n\tboolean isB(String s) {\n\t\treturn s.matches(\">\\\\^(Q=)+~~\");\n\t}\n}", "#include <iostream>\n#include <string>\n\nusing namespace std;\n \nint main(void){\n \n int i,j,n,a;\n string s,ans;\n cin >> n;\n \n for(i = 0 ; i < n ; i++ ){ \n \n cin >> s;\n ans = \"NA\";\n \n if( s[0] == '>'){\n if( s[1] == '\\''){\n\ta = 2;\n\tint cnt1 = 0,cnt2 = 0;\n\tif( s[a] == '='){\n\t while( s[a] == '='){\n\t a++;\n\t cnt1++;\n\t }\n\t if( s[a] == '#' ){\n\t a++;\n\t if( s[a] == '='){\n\t while( s[a] == '='){\n\t\tcnt2++;\n\t\ta++;\n\t }\n\t if( s[a] == '~' && a + 1 == s.size() && cnt1 == cnt2) ans = \"A\";\n\t }\n\t }\n\t}\n }\n else if( s[1] == '^'){\n\ta = 2;\n\tif( s[a] == 'Q' && s[a + 1] == '='){\n\t while( s[a] == 'Q' && s[a + 1] == '=') a += 2;\n\t if( s[a] == '~' && s[a + 1] == '~' && a + 2 == s.size()) ans = \"B\";\n\t}\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "\nimport java.util.Scanner;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tPattern a = Pattern.compile(\">'(=+)#\\\\1~\");\n\t\tPattern b = Pattern.compile(\">\\\\^(Q=)+~~\");\n\t\twhile (n-- > 0) {\n\t\t\tString line = scanner.next();\n\t\t\tMatcher ma = a.matcher(line);\n\t\t\tMatcher mb = b.matcher(line);\n\t\t\tif (ma.matches())\n\t\t\t\tSystem.out.println(\"A\");\n\t\t\telse if (mb.matches())\n\t\t\t\tSystem.out.println(\"B\");\n\t\t\telse\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t}\n\t}\n}", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <cstring>\n#include <cmath>\n#include <complex>\n#include <map>\n#include <climits>\n#include <sstream>\nusing namespace std;\n\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define EPS 1e-8\n#define F first\n#define S second\n#define mkp make_pair\n\nstatic const double PI=6*asin(0.5);\ntypedef long long ll;\ntypedef complex<double> CP;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vint;\nstatic const int INF=1<<24;\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v,int a,int b, const T &t = T()){\n\tv.assign(a,vector<T>(b,t));\n}\n\n//v.erase(unique(v.begin(),v.end()),v.end());\nint main(){\n\tint n;\n\tcin>>n;\n\trep(i,n){\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(s.substr(0,2)==\">'\"&&s.substr(s.size()-1,1)==\"~\"){\n\t\t\ts=s.substr(2);\n\t\t\ts=s.substr(0,s.size()-1);\n\t\t\tbool f=true;\n\t\t\tif(s.size()==0) f=false;\n\t\t\tif(s.size()&&s[0]!='='){\n\t\t\t\tf=false;\n\t\t\t}\n\t\t\twhile(s.size()>1){\n\t\t\t\tif(s[0]==s[s.size()-1]&&s[0]=='='){\n\t\t\t\t\ts=s.substr(1,s.size()-2);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t\tif(s[0]=='#'){\n\t\t\t\t\tcout<<\"A\\n\";\n\t\t\t\t}\n\t\t\t\telse cout<<\"NA\\n\";\n\t\t\t}\n\t\t\telse{\n\t\t\t\tcout<<\"NA\\n\";\n\t\t\t}\n\t\t}\n\t\telse if(s.substr(0,2)==\">^\"&&s.substr(s.size()-2,2)==\"~~\"){\n\t\t\ts=s.substr(2);\n\t\t\ts=s.substr(0,s.size()-2);\n\t\t\tbool f=true;\n\t\t\tif(s.size()<2) f=false;\n\t\t\tif(s.size()>=2&&s.substr(0,2)!=\"Q=\") f=false;\n\t\t\twhile(s.size()>=2){\n\t\t\t\tif(s.substr(0,2)==\"Q=\"){\n\t\t\t\t\ts=s.substr(2);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t\tcout<<\"B\\n\";\n\t\t\t}\n\t\t\telse cout<<\"NA\\n\";\n\t\t}\n\t\telse{\n\t\t\tcout<<\"NA\\n\";\n\t\t}\n\t}\n}", "#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<cassert>\n#include<iostream>\n#include<sstream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<set>\n#include<map>\n#include<utility>\n#include<numeric>\n#include<algorithm>\n#include<bitset>\n#include<complex>\n\nusing namespace std;\n\ntypedef long long Int;\ntypedef vector<int> vint;\ntypedef pair<int,int> pint;\n#define mp make_pair\n\ntemplate<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << \" \"; cout << endl; }\ntemplate<class T> void chmin(T &t, T f) { if (t > f) t = f; }\ntemplate<class T> void chmax(T &t, T f) { if (t < f) t = f; }\nint in() { int x; scanf(\"%d\", &x); return x; }\n\nint main() {\n\tint n=in();\n\tstring snake;\n\twhile(n--){\n\t\tcin>>snake;\n\t\tint i;\n\t\tbool a=true,b=true;\n\t\tif(snake.size()<6||snake.size()%2!=0){\n\t\t\ta=false;\n\t\t\tb=false;\n\t\t}\n\t\tfor(i=0;i<snake.size();i++){\n\t\t\tif(i==0){\n\t\t\t\tif(snake[i]!='>'){\n\t\t\t\t\ta=false;\n\t\t\t\t\tb=false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(i==1){\n\t\t\t\tif(snake[i]!='\\'')a=false;\n\t\t\t\tif(snake[i]!='^')b=false;\n\t\t\t}\n\t\t\tif(i*2==snake.size()){\n\t\t\t\tif(snake[i]!='#')a=false;\n\t\t\t}\n\t\t\tif(i==snake.size()-1){\n\t\t\t\tif(snake[i]!='~'){\n\t\t\t\t\ta=false;\n\t\t\t\t\tb=false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(i==snake.size()-2){\n\t\t\t\tif(snake[i]!='~')b=false;\n\t\t\t}\n\t\t\tif(i!=0&&i!=1&&i*2!=snake.size()&&i!=snake.size()-1){\n\t\t\t\tif(snake[i]!='=')a=false;\n\t\t\t}\n\t\t\tif(i%2==0&&i!=0&&i!=snake.size()-2){\n\t\t\t\tif(snake[i]!='Q')b=false;\n\t\t\t}\n\t\t\tif(i%2==1&&i!=1&&i!=snake.size()-1){\n\t\t\t\tif(snake[i]!='=')b=false;\n\t\t\t}\n\t\t}\n\t\tif(a){\n\t\t\tcout<<\"A\\n\";\n\t\t}else if(b){\n\t\t\tcout<<\"B\\n\";\n\t\t}else{\n\t\t\tcout<<\"NA\\n\";\n\t\t}\n\t}\n\treturn 0;\n}", "def checkA(s):\n if s[:2] == \">'\" and s[-1] == \"~\":\n body = s[2:-1]\n if len(body) >= 3 and body.count(\"#\") == 1 and body.index(\"#\") == len(body) // 2 and body.count(\"=\") == len(body) - 1:\n return True\n else:\n return False\n else:\n return False\n\ndef checkB(s):\n if s[:2] == \">^\" and s[-2:] == \"~~\":\n body = s[2:-2]\n if len(body) > 0 and len(body) % 2 == 0:\n for i in range(0, len(body), 2):\n if body[i:i + 2] != \"Q=\":\n return False\n else:\n return True\n else:\n return False\n else:\n return False\n\nn = int(input())\nfor _ in range(n):\n s = input()\n if len(s) <= 5:\n print(\"NA\")\n else:\n if checkA(s):\n print(\"A\")\n elif checkB(s):\n print(\"B\")\n else:\n print(\"NA\")\n", "import java.util.Scanner;\n\n//Snakes\npublic class Main{\n\n\tstatic boolean isA(char[] s){\n\t\tif(s.length<6)return false;\n\t\tif(!(s[0]=='>'&&s[1]=='\\''))return false;\n\t\tint con = 0;\n\t\twhile(2+con<s.length && s[2+con]=='=')con++;\n\t\tif(con==0)return false;\n\t\tif(2+con==s.length||s[2+con]!='#')return false;\n\t\tint b = 3+con;\n\t\tint sec = 0;\n\t\twhile(b+sec<s.length && s[b+sec]=='=')sec++;\n\t\tif(sec!=con||b+sec==s.length)return false;\n\t\treturn s[b+sec]=='~'&&b+sec==s.length-1;\n\t}\n\t\n\tstatic boolean isB(char[] s){\n\t\tif(s.length<6)return false;\n\t\tif(!(s[0]=='>'&&s[1]=='^'))return false;\n\t\tint i = 2;\n\t\tint c = 0;\n\t\twhile(i+1<s.length && s[i]=='Q' && s[i+1]=='='){\n\t\t\ti+=2;c++;\n\t\t}\n\t\tif(i+1>=s.length||c==0)return false;\n\t\treturn i+1==s.length-1 && s[i]=='~' && s[i+1]=='~';\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint t = sc.nextInt();\n\t\twhile(t--!=0){\n\t\t\tchar[] s = sc.next().toCharArray();\n\t\t\tSystem.out.println(isA(s)?\"A\":isB(s)?\"B\":\"NA\");\n\t\t}\n\t}\n}", "#include <iostream>\n\nusing namespace std;\n\nbool chk_a(const string s)\n{\n bool c = true;\n int f, b;\n\n f = b = 0;\n for (int i = 0; i < s.size(); i++) {\n if (s[i] != '=' && s[i] != '#') \n return false;\n if (c && s[i] == '#') \n c = false;\n else if (s[i] == '=' && c)\n f++;\n else\n b++;\n }\n\n return (f == b) ? true : false;\n}\n\nbool chk_b(const string s)\n{\n for (int i = 0; i < s.size(); i += 2) \n if (s[i] != 'Q' || s[i + 1] != '=')\n return false;\n\n return true;\n}\n\nint main()\n{\n int n;\n\n cin >> n;\n while (n--) {\n string inp;\n bool flag = false;\n\n cin >> inp;\n if (inp.size() >= 5 && inp[0] == '>' && inp[inp.size() - 1] == '~') {\n if (inp[1] == '\\'') { // Aの判定\n if (chk_a(inp.substr(2, inp.size() - 3))) {\n cout << \"A\" << endl;\n flag = true;\n }\n }\n else if (inp.size() >= 6 && inp[1] == '^' \n && inp[inp.size() - 2] == '~') { // Bの判定\n if (chk_b(inp.substr(2, inp.size() - 4))) {\n cout << \"B\" << endl;\n flag = true;\n }\n }\n }\n\n if (!flag)\n cout << \"NA\" << endl;\n }\n\n return 0;\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main()\n{\n const string Type[] = {\"A\", \"B\", \"NA\"};\n\n int n;\n while (cin >> n) {\n for (int i = 0; i < n; ++i) {\n string snake;\n cin >> snake;\n\n int ans = 2;\n int length = static_cast<int>(snake.size());\n if (snake[0] == '>' && snake[length-1] == '~') {\n\tif (length >= 5 && snake[1] == '\\'' && snake.find_first_of(\"#\") != string::npos) {\n\t int sharp = snake.find_first_of(\"#\");\n\t bool valid = true;\n\t for (int j = 2; j < sharp && valid; ++j) {\n\t if (snake[j] != '=')\n\t valid = false;\n\t }\n\t for (int j = sharp+1; j < length-1 && valid; ++j) {\n\t if (snake[j] != '=')\n\t valid = false;\n\t }\n\n\t if (valid && sharp-2 == length-2-sharp)\n\t ans = 0;\n\t} else if (length >= 6 && snake[1] == '^' && snake[length-2] == '~') {\n\t bool valid = true;\n\t for (int j = 2; j < length-2 && valid; j += 2) {\n\t if (snake[j] != 'Q' || snake[j+1] != '=')\n\t valid = false;\n\t }\n\n\t if (valid)\n\t ans = 1;\n\t}\n }\n cout << Type[ans] << endl;\n }\n }\n return 0;\n}", "//package _0139;\n\n\n\nimport java.util.*;\n\nimport java.lang.*;\n\nimport java.math.*;\n\n\n\npublic class Main {\n\n\tScanner sc = new Scanner(System.in);\n\n\n\n\tboolean isA(String snake) throws Exception {\n\n\t\tif (snake.startsWith(\">'\")) {\n\n\t\t\tif (snake.endsWith(\"~\")) {\n\n\t\t\t\tString mid = snake.substring(2, snake.length() - 1);\n\n\t\t\t\tif (mid.length() >= 3) {\n\n\t\t\t\t\tString[] spl = mid.split(\"#\", 2);\n\n\t\t\t\t\tif (spl[0].equals(spl[1])) {\n\n\t\t\t\t\t\tfor (int i = 0; i < spl[0].length(); i++) {\n\n\t\t\t\t\t\t\tif ('=' != spl[0].charAt(i)) {\n\n\t\t\t\t\t\t\t\treturn false;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn false;\n\n\t}\n\n\n\n\tboolean isB(String snake) throws Exception {\n\n\t\tif (snake.startsWith(\">^\")) {\n\n\t\t\tif (snake.endsWith(\"~~\")) {\n\n\t\t\t\tString mid = snake.substring(2, snake.length() - 2);\n\n\t\t\t\tif (mid.length() >= 2) {\n\n\t\t\t\t\twhile (mid.startsWith(\"Q=\")) {\n\n\t\t\t\t\t\tmid = mid.substring(2);\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif (mid.equals(\"\")) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn false;\n\n\t}\n\n\n\n\t/*\n\n\t * >'======#======~ >^Q=Q=Q=Q=Q=Q=Q=Q=Q=~~\n\n\t */\n\n\tString getAns(String snake) {\n\n\t\tString ret = \"NA\";\n\n\t\tif (snake.startsWith(\">'\")) {\n\n\t\t\ttry {\n\n\t\t\t\tif (isA(snake))\n\n\t\t\t\t\tret = \"A\";\n\n\t\t\t} catch (Exception e) {\n\n\n\n\t\t\t}\n\n\t\t} else if (snake.startsWith(\">^\")) {\n\n\t\t\ttry {\n\n\t\t\t\tif (isB(snake))\n\n\t\t\t\t\tret = \"B\";\n\n\t\t\t} catch (Exception e) {\n\n\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn ret;\n\n\t}\n\n\n\n\tvoid run() {\n\n\t\tint n = sc.nextInt();\n\n\t\tfor (int i = 0; i < n; i++) {\n\n\t\t\tSystem.out.println(getAns(sc.next()));\n\n\t\t}\n\n\t}\n\n\n\n\tpublic static void main(String[] args) {\n\n\t\tMain m = new Main();\n\n\t\tm.run();\n\n\t}\n\n}", "n = int(input())\nfor i in range(n):\n s = input()\n if s[:2] == \">'\" and s[-1] == '~' and len(s) % 2 == 0 and '=#=' in s:\n temp = \">'\" + '=' * (s.count('=')//2) + '#' + '=' * (s.count('=')//2) + '~'\n if s == temp:\n print('A')\n continue\n elif s[:2] == \">^\" and s[-2:] == '~~' and len(s) % 2 == 0 and 'Q=' in s:\n temp = \">^\" + 'Q=' * ((len(s)-4)//2) + '~~'\n if s == temp:\n print('B')\n continue\n print('NA')\n\n\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tenum State{\n\t\tSTART, MOUTH, EYE_A, EYE_B, BODY_A1, BODY_A2, BODY_B1, BODY_B2, MID_A, TAIL_A, TAIL_B1, TAIL_B2, NA;\n\t}\n\t\n\tString snake(String s){\n\t\tState state=State.START;\n\t\tint length=0;\n\t\t\n\t\tLOOP:\n\t\tfor(int i=0;i<s.length();++i){\n\t\t\tchar next=s.charAt(i);\n\t\t\t\n\t\t\tswitch(state){\n\t\t\tcase START:\n\t\t\t\tif(next=='>') state=State.MOUTH;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase MOUTH:\n\t\t\t\tif(next=='\\'') state=State.EYE_A;\n\t\t\t\telse if(next=='^') state=State.EYE_B;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase EYE_A:\n\t\t\t\tif(next=='='){\n\t\t\t\t\tstate=State.BODY_A1;\n\t\t\t\t\tlength=0;\n\t\t\t\t}\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase BODY_A1:\n\t\t\t\t++length;\n\t\t\t\tif(next=='=') state=State.BODY_A1;\n\t\t\t\telse if(next=='#') state=State.MID_A;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase MID_A:\n\t\t\t\tif(next=='=') state=State.BODY_A2;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase BODY_A2:\n\t\t\t\t--length;\n\t\t\t\tif(next=='=') state=State.BODY_A2;\n\t\t\t\telse if(next=='~'&&length==0) state=State.TAIL_A;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase EYE_B:\n\t\t\t\tif(next=='Q') state=State.BODY_B1;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase BODY_B1:\n\t\t\t\tif(next=='=') state=State.BODY_B2;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase BODY_B2:\n\t\t\t\tif(next=='Q') state=State.BODY_B1;\n\t\t\t\telse if(next=='~') state=State.TAIL_B1;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tcase TAIL_B1:\n\t\t\t\tif(next=='~') state=State.TAIL_B2;\n\t\t\t\telse state=State.NA;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak LOOP;\n\t\t\t}\n\t\t}\n\t\t\n\t\tswitch(state){\n\t\tcase TAIL_A:\n\t\t\treturn \"A\";\n\t\tcase TAIL_B2:\n\t\t\treturn \"B\";\n\t\tdefault:\n\t\t\treturn \"NA\";\n\t\t}\n\n\t}\n\t\n\tBufferedReader input;\n\t\n\tint ni() throws NumberFormatException, IOException{\n\t\treturn Integer.parseInt(input.readLine());\n\t}\n\t\n\tString ns() throws IOException{\n\t\treturn input.readLine();\n\t}\n\t\n\tvoid io(){\n\t\tinput=new BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\ttry {\n\t\t\tint n=ni();\n\t\t\tfor(int i=0;i<n;++i){\n\t\t\t\tSystem.out.println(snake(ns()));\n\t\t\t}\n\t\t\tinput.close();\n\t\t} catch (Exception e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tnew Main().io();\n\t}\n\n}", "def A():\n p = s[2:]\n count = 0\n index = 0\n for i, c in enumerate(p):\n if c == '=':\n count += 1\n elif c == '#':\n index = i\n break\n else:\n print 'NA'\n return\n else:\n if not index:\n print 'NA'\n return\n p = p[index+1:-1]\n for c in p:\n if c == '=':\n count -= 1\n else:\n print 'NA'\n return\n if count == 0 and s[-1] == '~':\n print 'A'\n else:\n print 'NA'\n \ndef B():\n p = s[2:-2]\n for i in range(0, len(p), 2):\n if not (p[i]+p[i+1] == 'Q='):\n print 'NA'\n return\n if s[-2:] == '~~':\n print 'B'\n else:\n print 'NA'\n\nfor i in range(input()):\n s = raw_input()\n if s[:3] == \">'=\":\n A()\n elif s[:4] == \">^Q=\":\n B()\n else:\n print 'NA'", "#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nstring kaga(string s,int num){\n\tstring san;\n\tfor(int i=0;i<num;i++)san+=s;\n\treturn san;\n}\n\nvoid check(string s){\n\tfor(int i=1;i<99;i++){\n\t\tstring a,b;\n\t\ta=\">'\"+kaga(\"=\",i)+'#'+kaga(\"=\",i)+'~';\n\t\tb=\">^\"+kaga(\"Q=\",i)+\"~~\";\n\t\tif(a==s){\n\t\t\tcout<<\"A\"<<endl;\n\t\t\tgoto end;\n\t\t}\n\t\tif(b==s){\n\t\t\tcout<<\"B\"<<endl;\n\t\t\tgoto end;\n\t\t}\n\t}\n\tcout<<\"NA\"<<endl;\n\tend:;\n}\n\nint main(){\n\tint n;\n\tstring s;\n\tfor(cin>>n;n>0;n--){\n\t\tcin>>s;\n\t\tcheck(s);\n\t}\n\treturn 0;\n}\n", "#include <iostream>\n\n//”CˆÓ•¶Žš‚ðÁ‚·ŠÖ”\nint clear(std::string s, std::string f){\n\tint pos;\n\twhile(pos = s.find(f), pos != std::string::npos)\n\t\ts.replace(pos,f.size(),\"\");\n\tif(s == \"\")return 1;\n\treturn 0;\n}\n\nint main(){\n\tint n;\n\tstd::cin >> n;\n\twhile(n--){\n\t\tstd::string sn, res = \"\";\n\t\tstd::cin >> sn;\n\n\t\t//Type A\n\t\t//“ª‚ª>'CK”ö‚ª~C‚©‚‚¨• ‚Ì•”•ª‚ªŠï”‚Å‚ ‚é\n\t\tif(sn.substr(0,2) == \">'\" &&\n\t\t\t sn[sn.size()-1] == '~' && (sn.size()-3) % 2 == 1){\n\t\t\tstd::string st = sn.substr(2,sn.size()-3);\n\t\t\t//‚¨• ‚̐^‚ñ’†‚ª#\n\t\t\tif(st[st.size()/2] == '#'){\n\t\t\t\tst.replace(st.size()/2,1,\"\");\n\t\t\t\t\n\t\t\t\t//#ˆÈŠO‚ª‚·‚ׂÄ=\n\t\t\t\t// int eq = 1;\n\t\t\t\t// for(int i=0;i<st.size();i++){\n\t\t\t\t// \tif(st[i] != '='){eq = 0;break;}\n\t\t\t\t// }\n\t\t\t\t// if(eq)std::cout << \"A\" << std::endl;\n\t\t\t\tif(st != \"\")\n\t\t\t\t\tif(clear(st,\"=\"))res = \"A\\n\";\n\t\t\t}\n\t\t}\n\n\t\t//Type B\n\t\tif(sn.substr(0,2) == \">^\" &&\n\t\t\t sn.substr(sn.size()-2,2) == \"~~\" &&\n\t\t\t (sn.size()-4) % 2 == 0){\n\t\t\tstd::string st = sn.substr(2,sn.size()-4);\n\t\t\tif(st != \"\")\n\t\t\t\tif(clear(st,\"Q=\"))res = \"B\\n\";\n\t\t}\n\n\t\tif(res == \"\")res = \"NA\\n\";\n\t\tstd::cout << res;\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0; i<(n); i++)\n#define REP2(i,x,n) for(int i=x; i<(n); i++) \n#define ALL(n) begin(n),end(n)\nstruct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;\nint check( string S )\n{\n //A\n if( S[ 0 ] == '>' && S[ 1 ] == '\\'' && S[ S.size() - 1 ] == '~' && S.size() >= 6 )\n {\n S = S.substr( 2, S.size() - 3 );\n if( S.find_first_not_of( \"#=\", 0 ) != string::npos ) return 0;\n return S.substr( 0, S.find('#') ).size() == S.substr( S.find( '#' ) + 1, S.size() - 1 ).size() ? 1 : 0;\n }\n //B\n if( S[ 0 ] == '>' && S[ 1 ] == '^' && S[ S.size() - 1 ] == '~' && S[ S.size() - 2 ] == '~' && S.size() >= 6 )\n {\n S = S.substr( 2, S.size() - 4 );\n if( S.find_first_not_of( \"Q=\", 0 ) != string::npos || S.size() % 2 != 0 ) return 0;\n for( int i = 0; i < S.size(); i += 2 )\n {\n if( S[ i ] != 'Q' && S[ i + 1 ] != '=' ) return 0;\n }\n return 2;\n }\n return 0;\n}\nint main()\n{\n int N;\n cin >> N;\n \n vector<string> res{ \"NA\", \"A\", \"B\" };\n string S;\n \n while( cin >> S )\n {\n cout << res[ check( S ) ] << endl;\n }\n return 0;\n}", "#include<iostream>\n#include<string>\n\nusing namespace std;\n\nint main()\n{\n\tint n,i,j;\n\tstring str;\n\t\n\tcin >> n;\n\t\n\tfor(i=0;i<n;i++)\n\t{\n\t\tcin >> str;\n\t\t\n\t\tif(str[0]=='>')\n\t\t{\n\t\t\tif(str[1]=='\\'')\n\t\t\t{\n\t\t\t\tint num=0;\n\t\t\t\tfor(j=2;j<str.size();j++)\n\t\t\t\t{\n\t\t\t\t\tif(str[j]=='=')\n\t\t\t\t\t\tnum++;\n\t\t\t\t\telse if(num>0 && str[j]=='#')\n\t\t\t\t\t{\n\t\t\t\t\t\tfor(j+=1;j<str.size();j++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(j==str.size()-1 && str[j]=='~' && num==0)\n\t\t\t\t\t\t\t\tcout << \"A\" << endl;\n\t\t\t\t\t\t\telse if(j!=str.size()-1 && str[j]=='=')\n\t\t\t\t\t\t\t\tnum--;\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(str[1]=='^')\n\t\t\t{\n\t\t\t\tif(str.size()<6)\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tfor(j=2;j<str.size();j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(j==str.size()-2 && str[j]=='~' && str[j+1]=='~')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcout << \"B\" << endl;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(j==str.size()-2 && (str[j]!='~' || str[j+1]!='~'))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if((j%2==0 && str[j]!='Q') || (j%2==1 && str[j]!='='))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse\n\t\t\tcout << \"NA\" << endl;\n\t}\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main(){\n int n,j,fa,fb,acount,acount2,i;\n string data;\n \n cin >> n;\n \n getline(cin,data);\n for(j = 0; j < n; j++){\n fa = 0;\n fb = 0;\n acount = acount2 = 0;\n getline(cin,data);\n if(data.length() < 6)\n data = \"OOHAZURE\";\n if(data[0] == '>' && data[1] == '\\''){\n fa = 1;\n i = 2;\n while(data[i] == '='){\n\tacount++;\n\ti++;\n }\n if(data[i] != '#')\n\tfa = 0;\n i++;\n while(data[i] == '='){\n\tacount2++;\n\ti++;\n }\n if(i != data.length()-1)\n\tfa = 0; \n if(acount != acount2)\n\tfa = 0;\n if(data[data.length()-1] != '~'){\n\tfa = 0;\n }\n }\n if(data[0] == '>' && data[1] == '^'){\n fb = 1;\n for(i = 2; i < data.length()-3; i = i+2){\n\tif(data[i] != 'Q' || data[i+1] != '=')\n\t fb = 0;\n }\n if(i != data.length()-2)\n\tfb = 0;\n if(data[data.length()-1] != '~' || data[data.length()-2] != '~')\n\tfb = 0;\n }\n if(fa == 1)\n cout << \"A\" << endl; \n else if(fb == 1)\n cout << \"B\" << endl;\n else \n cout << \"NA\" << endl;\n }\n return 0;\n}", "//11\n#include<string>\n#include<iostream>\n\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n while(n--){\n string s;\n cin>>s;\n if(s.size()>=6&&s==\">'\"+string((s.size()-4)/2,'=')+'#'+string((s.size()-4)/2,'=')+'~'){\n cout<<'A'<<endl;\n }else{\n int r=(s.size()-4)/2;\n string b;\n while(r--){\n\tb+=\"Q=\";\n }\n if(s.size()>=6&&s==\">^\"+b+\"~~\"){\n\tcout<<'B'<<endl;\n }else{\n\tcout<<\"NA\"<<endl;\n }\n }\n }\n return 0;\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\nbool isA(string s){\n\n if(s.size() < 6 || s.size() % 2 == 1) return false;\n if(s.substr(0,2) != \">\\'\") return false;\n if(s[s.size() - 1] != '~') return false;\n\n int a, b;\n for( a = 2, b = s.size() - 2 ; a != b ; a++, b--){\n if(s[a] != '=' || s[b] != '=') return false;\n }\n\n return s[a] == '#';\n}\nbool isB(string s){\n\n if(s.size() < 6 || s.size() % 2 == 1) return false;\n if(s.substr(0,2) != \">^\") return false;\n\n if(s.substr(s.size() - 2) != \"~~\") return false;\n\n for(int i = 2 ; i < s.size() - 2 ; i += 2){\n if(s.substr( i, 2) != \"Q=\") return false;\n }\n return true;\n}\n\nint main(){\n int n;\n cin >> n;\n while(n--){\n string s;\n cin >> s;\n if(isA(s)) cout << \"A\\n\";\n else if(isB(s)) cout << \"B\\n\";\n else cout << \"NA\\n\";\n }\n}", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\t\n\tpublic String species(String snake){\n\t\tif( snake.length() < 5 || snake.charAt(0) != '>' || snake.charAt(snake.length()-1) != '~' ){\n\t\t\treturn \"NA\";\n\t\t}\n\t\tif( snake.charAt(1) == '\\'' ){\n\t\t\tint count = 0;\n\t\t\tboolean flag = true;\n\t\t\tfor(int i = 2; i < snake.length()-1; i++){\n\t\t\t\tif( flag ){\n\t\t\t\t\tif( snake.charAt(i) == '=' ){\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t} else if( snake.charAt(i) == '#' ){\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn \"NA\";\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif( snake.charAt(i) == '=' ){\n\t\t\t\t\t\tcount--;\t\t\t\t\t\t\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn \"NA\";\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif( count != 0 ){\n\t\t\t\treturn \"NA\";\n\t\t\t}\n\t\t\treturn \"A\";\n\t\t} else if( snake.charAt(1) == '^' ){\n\t\t\tfor(int i = 2; i < snake.length()-2; i += 2){\n\t\t\t\tif( snake.charAt(i) == 'Q' && snake.charAt(i+1) == '=' ){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\treturn \"NA\";\n\t\t\t}\n\t\t\tif( snake.charAt(snake.length()-2) != '~' ){\n\t\t\t\treturn \"NA\";\n\t\t\t}\n\t\t\treturn \"B\";\n\t\t}\n\t\treturn \"NA\";\n\t}\n\tpublic void solve() throws IOException{\n\t\tint n = nextInt();\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tString snake = nextToken();\n\t\t\twriter.println(species(snake));\n\t\t}\n\t\twriter.flush();\n\t}\t\t\t\n\tpublic static void main (String args[]) throws IOException{\n\t\tnew Main().run();\n\t}\n\t\n\tBufferedReader reader;\n\tStringTokenizer tokenizer;\n\tPrintWriter writer;\n\t\n\tpublic void run() throws IOException{\n\t\ttry{\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t\ttokenizer = null;\n\t\t\twriter = new PrintWriter(System.out);\n\t\t\tsolve();\n\t\t\treader.close();\n\t\t\twriter.close();\n\t\t} catch (Exception e){\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t}\n\tpublic int nextInt() throws IOException{\n\t\treturn Integer.parseInt(nextToken());\n\t}\t\t\n\tpublic String nextToken() throws IOException{\n\t\twhile( tokenizer == null || !tokenizer.hasMoreTokens() ){\n\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n}", "#include <stdio.h>\n#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <fstream>\n#include <sstream>\n#include <math.h>\n#include <queue>\n#include <stack>\n#include <math.h>\n#include <string.h>\n\n\n\nusing namespace std;\n\nbool hebi_a(string hebi){\n if(!(hebi[0]=='>' && hebi[1]=='\\''))return false;\n if(hebi[2]!='=')return false;\n \n int now=3;\n int count=1;\n \n while(1){\n if(hebi[now]=='#'){\n now++;\n break;\n }else if(hebi[now]=='='){\n now++;\n count++;\n }else{\n return false;\n }\n }\n \n while(now!=hebi.length()){\n if(hebi[now]=='='){\n now++;\n count--;\n }else if(hebi[now]=='~'){\n now++;\n break;\n }else{\n return false;\n }\n }\n if(now==hebi.length()&& count==0)return true;\n else return false;\n}\n\n\nbool hebi_b(string hebi){\n if(!(hebi[0]=='>' && hebi[1]=='^'))return false;\n if(hebi[2]!='Q')return false;\n if(hebi[3]!='=')return false;\n int now=4;\n while(1){\n if(hebi[now]!='Q'){\n break;\n }else{\n now++;\n }\n \n if(now==hebi.length())return false;\n \n if(hebi[now]!='='){\n return false;\n }else{\n now++;\n }\n \n if(now==hebi.length())return false;\n }\n if(now==hebi.length())return false;\n \n if(hebi[now]!='~')return false;\n now++;\n if(now==hebi.length())return false;\n if(hebi[now]!='~')return false;\n now++;\n if(now==hebi.length())return true;\n else return false;\n\n}\n\n\nint main(){\n int n;\n cin>>n;\n for(int roop=0; roop<n; roop++){\n string hebi;\n cin>>hebi;\n if(hebi_a(hebi))cout<<\"A\"<<endl;\n else if(hebi_b(hebi))cout<<\"B\"<<endl;\n else cout<<\"NA\"<<endl;\n \n }\n}", "# define _CRT_SECURE_NO_WARNINGS 1\n# include <iostream>\n# include <numeric>\n# include <string>\n# include <bitset>\n# include <vector>\n# include <algorithm>\n# include <cstdlib>\n# include <cstdio>\n# include <cstring>\n# include <cstdlib>\n# include <iomanip>\n# include <queue>\n# include <sstream>\n# include <climits>\n# include <cmath>\n# include <list>\n# include <functional>\n# include <string>\n# include <ctime>\n# include <set>\n# include <forward_list>\n# include <map>\n# include <stack>\nusing namespace std;\n\n# define INF ((int)(1<<30))\n# define REP(i,n) for(int i=0;i<(int)n;i++)\n# define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n# define TORAD 2.0*M_PI/360.0\n# define INT(x) int x;cin>>x;\n# define ALL(x) (x).begin(),(x).end()\n# define RALL(x) (x).rbegin(),(x).rend()\n# define DEBUG(x) cout<<#x<<\" :\"<<x<<endl;\n# define EPS 1e-12\n\ntemplate<class T> void debug(T a) { for (auto i : a)cout << i << endl; }\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef pair<int, pii> piii;\nint dx[4] = { 0,-1,1,0 }, dy[4] = { 1,0,0,-1 };\n\nint main()\n{\n\tvector<string> a, b;\n\tfor (int i = 1; i <= 100; i++)\n\t{\n\t\tstring s = \">\\'\";\n\t\tfor (int j = 0; j < i; j++)s += \"=\";\n\t\ts += \"#\";\n\t\tfor (int j = 0; j < i; j++)s += \"=\";\n\t\ts += \"~\";\n\t\ta.push_back(s);\n\t}\n\tfor (int i = 1; i <= 100; i++)\n\t{\n\t\tstring s = \">^\";\n\t\tfor (int j = 0; j < i; j++)s += \"Q=\";\n\t\ts += \"~~\";\n\t\tb.push_back(s);\n\t}\n\t\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tstring s;\n\t\tcin >> s;\n\t\tif (find(ALL(a), s)!=a.end())cout << \"A\" << endl;\n\t\telse if (find(ALL(b), s) != b.end())cout << \"B\" << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <set>\n#include <map>\n#include <string>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <cstdio>\n#include <istream>\n#include <sstream>\n#include <iomanip>\n#include <iterator>\n#include <climits>\nusing namespace std;\n\ntypedef ostringstream OSS;\ntypedef istringstream ISS;\n\ntypedef vector<int> VI;\ntypedef vector< VI > VVI;\n\ntypedef long long LL;\n\ntypedef pair<int, int> PII;\ntypedef vector<PII> VPII;\n\n#define X first\n#define Y second\n\nbool check1(string s) {\n\tint n = s.size();\n\n\tif (n < 6 || s[0] != '>' || s[1] != '\\'' || s[n - 1] != '~') {\n\t\treturn false;\n\t}\n\n\tstring sub = s.substr(2, n - 3);\n\tn = sub.size();\n\n\tif (!(n % 2) || sub[n / 2] != '#') {\n\t\treturn false;\n\t}\n\n\tfor (int i = 0; i < n / 2; i++) {\n\t\tif (sub[i] != '=' || sub[n - i - 1] != '=') {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool check2(string s) {\n\tint n = s.size();\n\n\tif (n < 6 || s[0] != '>' || s[1] != '^' || s[n - 1] != '~' || s[n - 2] != '~') {\n\t\treturn false;\n\t}\n\n\tstring sub = s.substr(2, n - 4);\n\tn = sub.size();\n\n\tfor (int i = 0; i < n / 2; i++) {\n\t\tif (sub[i * 2] != 'Q' || sub[i * 2 + 1] != '=') {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nint main(void) {\n\tint n;\n\tcin >> n;\n\n\tfor (int i = 0; i < n; i++) {\n\t\tstring s;\n\t\tcin >> s;\n\n\t\tif (check1(s)) {\n\t\t\tcout << \"A\" << endl;\n\t\t}else if (check2(s)) {\n\t\t\tcout << \"B\" << endl;\n\t\t}else {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}", "\n#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n int f,i,m;\n string s;\n for(cin>>f;cin>>s;f?puts(f-2?\"A\":\"B\"):puts(\"NA\")){\n f=0;\n for(i=1;s[0]+s[1]==101 & (m=s.find(35))!=string::npos & s[m-i]==s[m+i];)\n m-++i-1 | m+i-s.size()+1 | s[m+i]-'~'||(f=1);\n for(i=2;s[0]+s[1]==156 & s[i]==81 & s[i+1]==61;)\n ++++i-s.size()+2 | s[i]+s[i+1]-252 || (f=2);\n }\n}", "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n\nint main() {\n int n;\n cin >> n;\n while(n--) {\n string s;\n cin >> s;\n int f=0;\n if (s.substr(0,2) == \">'\") {\n int i=2, j1=0,j2=0;\n for (;i<s.length() && s[i]=='='; i++) j1++;\n if (i<s.length() && s[i++] == '#') {\n for (;i<s.length() && s[i]=='='; i++) j2++;\n if (j1>0 && j1==j2 && i<s.length() && s[i] == '~') {\n cout << \"A\";\n f++;\n } \n }\n } else if (s.substr(0,2) == \">^\") {\n int i = 2;\n for (;i<s.length()-1 && s.substr(i,2) == \"Q=\"; i+=2) ;\n if (i>2 && s.substr(i,2) == \"~~\") {\n cout << \"B\";\n f++;\n }\n }\n if (f==0)\n cout << \"NA\";\n cout << endl;\n }\n}", "#include <regex>\n#include <iostream>\n#include <string>\nusing namespace std;\nint main(){\n\tint n;\n\tstring s;\n\tsmatch m;\n\tfor(cin>>n,getline(cin,s);n;n--){\n\t\tgetline(cin,s);\n\t\tif(regex_match(s,m,regex(\">'(=+)#(=+)~\"))&&m[1].length()==m[2].length())cout<<'A'<<endl;\n\t\telse if(regex_match(s,regex(\">^(Q=)+~~\")))cout<<'B'<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t}\n}", "import java.util.*;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class Main{\n\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tvoid run(){\n\t\tfor(int n=sc.nextInt(); n>0; n--){\n\t\t\tString s=sc.next();\n\t\t\t// debug(s);\n\t\t\tMatcher m=Pattern.compile(\"^>'(=+)#(=+)~$\").matcher(s);\n\t\t\tif(m.find()){\n\t\t\t\t// debug(m.group(1), m.group(2));\n\t\t\t\tif(m.group(1).length()==m.group(2).length()){\n\t\t\t\t\t// debug(\"A\");\n\t\t\t\t\tprintln(\"A\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tm=Pattern.compile(\"^>\\\\^(Q=)+~~$\").matcher(s);\n\t\t\tif(m.find()){\n\t\t\t\t// debug(\"B\");\n\t\t\t\tprintln(\"B\");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// debug(\"NA\");\n\t\t\tprintln(\"NA\");\n\t\t}\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tpublic static void main(String[] args){\n\t\t// System.setOut(new PrintStream(new BufferedOutputStream(System.out)));\n\t\tnew Main().run();\n\t}\n}", "\n#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <memory>\n#include <string>\n\n#include <algorithm>\n#include <complex>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n#include <bitset>\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\n#define strtok_r strtok_s\n#endif\n\n#define ITER(c) __typeof__((c).begin())\n#define FOREACH(it, c) for (ITER(c) it=(c).begin(); it != (c).end(); ++it)\n#define RITER(c) __typeof__((c).rbegin())\n#define RFOREACH(it, c) for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)\n#define REP(i, n) REPEAT(i, 0, n)\n#define RREP(i, n) RREPEAT(i, 0, n)\n#define REPEAT(i, k, n) for(int i = (k); i < (k+n); ++i)\n#define RREPEAT(i, k, n) for(int i = (k)+(n)-1; i >= (k); --i)\n#define FROMTO(i,f,t) for(int i = f; i < t; i++)\n#define ALL(c) (c).begin(), (c).end()\n#define LLPOW(p1,p2) ((ll)pow((double)(p1), (int)p2))\n#define ESIZEOF(A) (sizeof(A)/sizeof((A)[0]))\n#define CIN_NO_SYNC do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)\n#define GETSTR(p) fgets((p), sizeof(p), stdin)\n#define CHOMP(p) do{ char *_q = (p) + strlen(p)-1; if(*_q == '\\n' || *_q == '\\r') *_q = 0; } while(0)\n#define FILL(m,v) memset(m, v, sizeof(m))\n#define mp make_pair\n#define pb push_back\ntemplate<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} \ntemplate<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} \ntemplate <class _Tv> inline string join(_Tv &v,string sep=\" \"){\n ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();\n}\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef double D;\ntypedef complex<D> P;\n#define X real()\n#define Y imag()\n#define EPS (1e-9)\n#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)\n\n#ifdef _DEBUG\ntemplate<class _Tv> inline void _prfe(const char *_n,_Tv _c,bool _p=false){\n ITER(_c) _it=_c.begin();\n if(_p){cout<<_n<<\" = [\"<<endl;for(;_it!=_c.end();++_it)cout<<\" \"<<*_it<<endl;cout<<\"]\"<<endl; }\n else{cout<<_n<<\" = [ \"<<*_it++;for(;_it!=_c.end();++_it)cout<<\", \"<<*_it;cout<<\" ]\"<<endl; }\n}\n#define pf printf\n#define pr(n) do{cout<<#n\" = \"<<(n)<<endl;}while(0)\n#define prfe(n) _prfe(#n, n)\n#define prfep(n) _prfe(#n, n, true)\n#define dbgchk(n) do{if(n)throw;}while(0)\n#else\n#define pf(...) /* */\n#define pr(...) /* */\n#define prfe(...) /* */\n#define prfep(...) /* */\n#define dbgchk(...) /* */\n#endif\n\nstring solve(string &s){\n int i = 2;\n if(s[0] == '>' && s[1] == '\\''){\n int c = 0;\n while(s[i] == '=') c++, i++;\n if(c == 0 || s[i] != '#') return \"NA\";\n i++;\n while(s[i] == '=') c--, i++;\n if(c != 0 || s[i] != '~' || s[i+1] != '\\0') return \"NA\";\n return \"A\";\n }\n else if(s[0] == '>' && s[1] == '^'){\n int c = 0;\n while(s[i] == 'Q' && s[i+1] == '=') c++, i+=2;\n if(c == 0 || s[i] != '~' || s[i+1] != '~' || s[i+2] != '\\0') return \"NA\";\n return \"B\";\n } else {\n return \"NA\";\n }\n}\n\nint main(){\n int n;\n cin >> n;\n REP(j,n){\n string s;\n cin >> s;\n cout << solve(s) << endl;\n }\n\n return 0;\n}", "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\n\nint main() {\n\tint n; scanf(\"%d\", &n);\n\trep(i, n) {\n\t\tstring s; cin >> s;\n\t\tif (s.size() < 4 || s.size() % 2 == 1) {\n\t\t\tputs(\"NA\");\n\t\t\tcontinue;\n\t\t}\n\t\tif (s[0] == '>'&&s[1] == '\\''&&s[s.size() - 1] == '~') {\n\t\t\tint cnt = 0;\n\t\t\tbool flag = false;\n\t\t\tbool ok = false;\n\t\t\tfor (int i = 2; i < s.size() - 1; i++) {\n\t\t\t\tif (s[i] != '='&&s[i] != '#') { puts(\"NA\"); goto g; }\n\t\t\t\tif (flag&&s[i] == '#') { puts(\"NA\"); goto g; }\n\t\t\t\tif (s[i] == '#')flag = true;\n\t\t\t\telse {\n\t\t\t\t\tok = true;\n\t\t\t\t\tif (flag)cnt--;\n\t\t\t\t\telse cnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!ok) { puts(\"NA\"); goto g; }\n\t\t\tputs(cnt ? \"NA\" : \"A\");\n\t\t}\n\t\telse if (s[0] == '>'&&s[1] == '^'&&s[s.size() - 2] == '~'&&s[s.size() - 1] == '~') {\n\t\t\tif (s.size() == 4) { puts(\"NA\"); goto g; }\n\t\t\tfor (int i = 2; i < s.size() - 2; i += 2) {\n\t\t\t\tif (s[i] != 'Q' || s[i + 1] != '=') {\n\t\t\t\t\tputs(\"NA\"); goto g;\n\t\t\t\t}\n\t\t\t}\n\t\t\tputs(\"B\");\n\t\t}\n\t\telse puts(\"NA\");\n\tg:;\n\t}\n}", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.lang.Integer;\nimport java.lang.System;\nimport java.lang.Exception;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader r = new BufferedReader(new InputStreamReader(System.in));\n\n Pattern a = Pattern.compile(\">'(=+)#\\\\1~\");\n Pattern b = Pattern.compile(\">\\\\^(Q=)+~~\");\n\n int n = Integer.parseInt(r.readLine());\n for (int i = 0; i < n; i++) {\n String s = r.readLine();\n Matcher ma = a.matcher(s);\n Matcher mb = b.matcher(s);\n if (ma.matches()) {\n System.out.println(\"A\");\n } else if (mb.matches()) {\n System.out.println(\"B\");\n } else {\n System.out.println(\"NA\");\n }\n }\n }\n}", "#include <bits/stdc++.h>\n \nusing namespace std;\n \nint main()\n{\n int n;\n cin >> n;\n while (n--) {\n\tstring snake;\n\tcin >> snake;\n \n\tstring s = snake.substr(0, 2);\n \n\tif (s != \">^\" && s != \">\\'\") {\n\t puts(\"NA\");\n\t continue;\n\t}\n \n\tif (s == \">\\'\") {\n\t int a = 0;\n\t int p = 2;\n\t bool flg = true;\n\t int len = (int)snake.size();\n\t for (int i = 2; i < len; i++, p++) {\n\t\tif (snake[i] == '#') break;\n\t\telse if (snake[i] == '=') a++;\n\t\telse {\n\t\t flg = false;\n\t\t break;\n\t\t}\n\t }\n \n\t if (!flg) {\n\t\tputs(\"NA\");\n\t\tcontinue;\n\t } \n \n\t int b = 0, q = p + 1;\n\t for (int i = q; i < len; i++, p++) {\n\t\tif (snake[i] == '~') break;\n\t\telse if (snake[i] == '=') b++;\n\t\telse {\n\t\t flg = false;\n\t\t break;\n\t\t}\n\t }\n \n\t if (!flg || a == 0 || b == 0 || a != b) {\n\t\tputs(\"NA\");\n\t\tcontinue;\n\t } \n \n\t if (a == b && snake[len-1] == '~') {\n\t\tputs(\"A\");\n\t } else {\n\t\tputs(\"NA\");\n\t }\n\t} else {\n\t bool ok = true;\n\t int p = 0;\n\t string ss = \"\";\n\t int len = (int)snake.size();\n \n\t if (len < 6 || len % 2) {\n\t\tputs(\"NA\");\n\t\tcontinue;\n\t } \n \n\t for (int i = 2; i < len-2; i++, p++) {\n\t\tss += snake[i];\n\t\tif (p == 1) {\n\t\t p = -1;\n\t\t if (ss != \"Q=\") {\n\t\t\tok = false;\n\t\t\tbreak;\n\t\t }\n\t\t ss = \"\";\n\t\t}\n\t }\n \n\t if (snake[len-2] == '~' && snake[len-1] == '~' && ok) {\n\t\tputs(\"B\");\n\t } else {\n\t\tputs(\"NA\");\n\t }\n\t}\n }\n return 0;\n}", "import java.util.*;\nimport java.util.regex.*;\n\nclass Main {\n public static void main (String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n scanner.nextLine();\n for (int ii = 0; ii < n; ii++) {\n String str = scanner.nextLine();\n Pattern pa = Pattern.compile(\"^>'(=+)#\\\\1~$\");\n Pattern pb = Pattern.compile(\"^>\\\\^(?:Q=)+~~$\");\n Matcher ma = pa.matcher(str);\n Matcher mb = pb.matcher(str);\n if (ma.find()) {\n System.out.println(\"A\");\n } else if (mb.find()) {\n System.out.println(\"B\");\n } else {\n System.out.println(\"NA\");\n }\n }\n }\n}", "#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <set>\n#include <unordered_set>\n#include <map>\n#include <unordered_map>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <functional>\n#include <iterator>\n#include <limits>\n#include <numeric>\n#include <utility>\n#include <type_traits>\n#include <cmath>\n#include <cassert>\n#include <cstdio>\n\nusing namespace std;\nusing namespace placeholders;\n\nusing LL = long long;\nusing ULL = unsigned long long;\nusing VI = vector< int >;\nusing VVI = vector< vector< int > >;\nusing VS = vector< string >;\nusing ISS = istringstream;\nusing OSS = ostringstream;\nusing PII = pair< int, int >;\nusing VPII = vector< pair< int, int > >;\ntemplate < typename T = int > using VT = vector< T >;\ntemplate < typename T = int > using VVT = vector< vector< T > >;\ntemplate < typename T = int > using LIM = numeric_limits< T >;\n\ntemplate < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }\ntemplate < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( \" \" + !i ) << v[i]; } return s; }\n\ntemplate < typename T > struct getv_fmt;\ntemplate <> struct getv_fmt< int >{ static constexpr const char *fmt = \"%d\"; };\ntemplate <> struct getv_fmt< long long >{ static constexpr const char *fmt = \"%lld\"; };\ntemplate < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };\n\ntemplate < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }\ntemplate < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }\n\n#define NUMBERED( name, number ) NUMBERED2( name, number )\n#define NUMBERED2( name, number ) name ## _ ## number\n#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )\n#define REP2( i, n ) REP3( i, 0, n )\n#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )\n#define GET_REP( a, b, c, F, ... ) F\n#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )\n#define FOR( e, c ) for ( auto &&e : c )\n#define ALL( c ) begin( c ), end( c )\n#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )\n#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )\n\n#define SZ( v ) ( (int)( v ).size() )\n#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )\n\ntemplate < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }\ntemplate < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }\n\n#define PB push_back\n#define EM emplace\n#define EB emplace_back\n#define BI back_inserter\n\n#define MP make_pair\n#define fst first\n#define snd second\n\n#define DUMP( x ) cerr << #x << \" = \" << ( x ) << endl\n\nbool is_a( const string &S )\n{\n\tconst int Ls = SZ( S );\n\n\tif ( S.find( \">'\" ) != 0 || S.find( \"~\" ) != Ls - 1 )\n\t{\n\t\treturn false;\n\t}\n\n\tstring T = S.substr( 2, Ls - 3 );\n\tconst int Lt = SZ( T );\n\tif ( Lt % 2 == 0 || Lt < 3 || T[ Lt / 2 ] != '#' )\n\t{\n\t\treturn false;\n\t}\n\tT[ Lt / 2 ] = '=';\n\n\treturn all_of( ALL( T ), bind( equal_to< char >(), _1, '=' ) );\n}\n\nbool is_b( const string &S )\n{\n\tconst int Ls = SZ( S );\n\n\tif ( S.find( \">^\" ) != 0 || S.find( \"~~\" ) != Ls - 2 )\n\t{\n\t\treturn false;\n\t}\n\t\n\tconst string T = S.substr( 2, Ls - 4 );\n\tconst int Lt = SZ( T );\n\n\tif ( Lt == 0 || Lt % 2 )\n\t{\n\t\treturn false;\n\t}\n\n\tfor ( int i = 0; i < Lt; i += 2 )\n\t{\n\t\tif ( T[i] != 'Q' || T[ i + 1 ] != '=' )\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tcin.tie( 0 );\n\tios::sync_with_stdio( false );\n\tcout << setprecision( 12 ) << fixed;\n\n\tint N;\n\tcin >> N;\n\n\tREP( N )\n\t{\n\t\tstring S;\n\t\tcin >> S;\n\n\t\tstring res = \"NA\";\n\t\tif ( is_a( S ) )\n\t\t{\n\t\t\tres = \"A\";\n\t\t}\n\t\tif ( is_b( S ) )\n\t\t{\n\t\t\tres = \"B\";\n\t\t}\n\t\tcout << res << endl;\n\t}\n\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n int n;\n cin>>n;\n while(n--){\n string s;\n cin>>s;\n bool f=s[0]=='>';\n int l=s.size();\n f&=l>5;\n if(s[1]=='\\''){\n int x=0;\n int i;\n for(i=2;i<l;i++){\n\tif(s[i]=='=') x++;\n\telse{\n\t f&=s[i]=='#';\n\t break;\n\t}\n }\n for(i++;i<l;i++){\n\tif(s[i]=='=') x--;\n\telse{\n\t f&=s[i]=='~';\n\t break;\n\t}\n }\n f&=i==l-1&&x==0;\n }else if(s[1]=='^'){\n int i;\n for(i=2;i<l;i+=2){\n\tif(!(i+1<l)){\n\t f=0;\n\t break;\n\t}\n\tif(s[i]=='Q'&&s[i+1]=='=') continue;\n\tif(i+2==l&&s[i]=='~'&&s[i+1]=='~') continue;\n\tbreak;\n }\n f&=i==l;\n }else f=0;\n cout<<(f?(s[1]=='^'?\"B\":\"A\"):\"NA\")<<endl;\n }\n return 0;\n}", "#include<iostream>\n#include<string>\nint main(){int f,i,m;std::string s;for(std::cin>>f;std::cin>>s;f?puts(f-2?\"A\":\"B\"):puts(\"NA\")){f=0;for(i=1;s[0]+s[1]==101&(m=s.find(35))!=-1&s[m-i]==s[m+i];)m-++i-1|m+i-s.size()+1|s[m+i]-'~'||(f=1);for(i=2;s[0]+s[1]==156&s[i]==81&s[i+1]==61;)++++i-s.size()+2|s[i]+s[i+1]-252||(f=2);}}", "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n int n;\n string s;\n cin>>n;\n for(int u=0;u<n;u++){\n cin>>s;\n bool a=true,b=true;\n if(s[0]!='>'||s.size()%2!=0||s.size()<6)a=false,b=false;\n if(s[1]!='\\''||s[s.size()-1]!='~')a=false;\n if(s[1]!='^'||s[s.size()-1]!='~'||s[s.size()-2]!='~')b=false;\n if(a){\n if(s[s.size()/2]!='#')a=false;\n int count=0;\n for(int i=2;i<s.size()-1;i++)if(s[i]!='=')count++;\n if(count!=1)a=false;\n if(a)cout<<\"A\"<<endl;\n }\n if(b){\n for(int i=2;i<s.size()-2;i++){\n if(i%2==0&&s[i]!='Q')b=false;\n if(i%2==1&&s[i]!='=')b=false;\n }\n if(b)cout<<\"B\"<<endl;\n }\n if(!a&&!b)cout<<\"NA\"<<endl;\n }\n return 0;\n}", "from re import match\nA = r\"^>'(=+)#\\1~$\"\nB = r\"^>\\^(Q=)+~~$\"\nfor _ in xrange(input()):\n s = raw_input()\n if match(A,s) != None:\n print \"A\"\n elif match(B,s) != None:\n print \"B\"\n else:\n print \"NA\"", "#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n\tint max,data;\n\tint num;\n\tint cut_i;\n\t\n\tchar hebi[201];\n\tscanf(\"%d\",&max);\n\t\n\tfor(data=0;data<max;data++) {\n\t\tscanf(\"%s\",hebi);\n\t\n\t\tif(strlen(hebi)<2 || hebi[0]!='>') {\n\t\t\tputs(\"NA\");\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tif(hebi[1]=='\\'') {\n\t\t\tnum=0;\n\t\t\tcut_i=2;\n\t\t\n\t\t\twhile(hebi[cut_i]=='=') {\n\t\t\t\tcut_i++;\n\t\t\t\tnum++;\n\t\t\t}\n\t\t\t\n\t\t\tif(hebi[cut_i]!='#' || num<=0){\n\t\t\t\tputs(\"NA\");\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcut_i++;\n\t\t\t\t\n\t\t\t\twhile(hebi[cut_i]=='=') {\n\t\t\t\t\tcut_i++;\n\t\t\t\t\tnum--;\n\t\t\t\t}\n\n\t\t\t\tif(num!=0){\n\t\t\t\t\tputs(\"NA\");\n\t\t\t\t}\n\t\t\t\telse if(hebi[cut_i]!='~' || hebi[cut_i+1]!=0){\n\t\t\t\t\tputs(\"NA\");\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tputs(\"A\");\n\t\t\t\t}\n\t\t\t}\n\t\t} \n\t\t\n\t\telse if(hebi[1]=='^') {\n\t\t\tcut_i=2;\n\t\t\twhile(hebi[cut_i]=='Q' && hebi[cut_i+1]=='='){\n\t\t\t\tcut_i+=2;\n\t\t\t}\n\n\t\t\tif(cut_i==2){\n\t\t\t\tputs(\"NA\");\n\t\t\t}\n\n\t\t\telse if(hebi[cut_i]!='~' || hebi[cut_i+1]!='~' || hebi[cut_i+2]!=0){\n\t\t\t\tputs(\"NA\");\n\t\t\t}\n\t\t\telse {\n\t\t\t\tputs(\"B\");\n\t\t\t}\n\t\t} else {\n\t\t\tputs(\"NA\");\n\t\t}\n\t}\n\treturn 0;\n}", "# -*- coding: utf-8 -*-\n\nimport sys\nimport os\n\nN = int(input())\n\ndef is_A(s):\n if s[0:2] != \">'\":\n return False\n\n if s[-1] != '~':\n return False\n\n body = s[2:-1]\n\n if len(body) % 2 == 0:\n return False\n\n # body = '==#=='\n center_index = len(body) // 2\n if body[center_index] != '#':\n return False\n\n if body.count('#') != 1:\n return False\n\n lst = body.split('#')\n if len(lst) != 2:\n return False\n\n if len(lst[0]) > 0 and lst[0] == lst[1] and len(lst[0]) == lst[0].count('='):\n return True\n else:\n return False\n\ndef is_B(s):\n if s[0:2] != \">^\":\n return False\n\n if s[-2:] != '~~':\n return False\n\n body = s[2:-2]\n\n if len(body) % 2 != 0:\n return False\n elif body.count('Q=') > 0 and body.count('Q=') == len(body) // 2:\n return True\n else:\n return False\n\nfor s in sys.stdin:\n s = s.strip()\n\n if is_A(s):\n print('A')\n elif is_B(s):\n print('B')\n else:\n print('NA')", "import re\n\na = \">'(=+)#(=+)~$\"\nb = \">\\^(Q=)+~~$\"\nn = int(input())\n\nfor _ in range(n):\n s = input()\n r = re.match(a, s)\n if r and r.group(1) == r.group(2):\n print('A')\n elif re.match(b, s):\n print('B')\n else:\n print('NA')\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nbool checkA(char* s){\n\tif(s[0] != '>' || s[1] != '\\'' || s[2] != '='){\n\t\treturn false;\n\t}\n\tint slen = 0;\n\twhile(s[slen+2] == '='){\n\t\tslen++;\n\t}\n\tif(s[slen+2] != '#'){\n\t\treturn false;\n\t}\n\tfor(int i = slen+3; i < slen*2+3;i++){\n\t\tif(s[i] != '='){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn (s[slen*2+3] == '~' && s[slen*2+4] == '\\0');\n}\n\nbool checkB(char* s){\n\tif(s[0] != '>' || s[1] != '^' || s[2] != 'Q' || s[3] != '='){\n\t\treturn false;\n\t}\n\tint slen = 0;\n\twhile(s[slen*2+2] == 'Q' && s[slen*2+3] == '='){\n\t\tslen++;\n\t}\n\treturn (s[slen*2+2] == '~' && s[slen*2+3] == '~' && s[slen*2+4] == '\\0');\n}\n\nint main(){\n\tint n;\n\tchar S[1024];\n\n\tscanf(\"%d\",&n);\n\tfor(int step = 0; step < n; step++){\n\t\tscanf(\"%s\",S);\n\t\tif(checkA(S)){\n\t\t\tprintf(\"A\\n\");\n\t\t}\n\t\telse if(checkB(S)){\n\t\t\tprintf(\"B\\n\");\n\t\t}\n\t\telse{\n\t\t\tprintf(\"NA\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n\n", "#include<cstdio>\n#include<iostream>\n#include<algorithm>\n#include<cstring>\n#include<vector>\n#define INF 999999\nusing namespace std;\nint main(){\n int N,j;\n cin>>N;\n while(N--){\n int runcnt=0,j;\n char S[128000]={0};\n cin>>S;\n if(S[0]=='>'&&S[1]==39){\n int K=0;\n for(j=2;;j++){\n if(S[j]=='='){\n runcnt++;\n K=1;\n }\n else if(S[j]=='#'){\n break;\n }\n else {\n cout<<\"NA\"<<endl;\n goto end;\n }\n }\n for(int i = j + 1;;i++){\n if(S[i] == '='){\n runcnt--;\n }\n else if(runcnt == 0 && S[i] == '~' && K == 1){\n cout<<\"A\"<<endl;\n goto end;\n }\n else{\n cout<<\"NA\"<<endl;\n goto end;\n }\n }\n }\n else if(S[0] == '>' && S[1] == '^'){\n int F = 0;\n for(j = 2;;){\n if(S[j] == 'Q' && S[j + 1] == '='){\n j += 2;\n F = 1;\n }\n else if(S[j] == '~' && S[j+1] == '~' && F == 1){\n cout<<\"B\"<<endl;\n goto end;\n }\n else{\n cout<<\"NA\"<<endl;\n goto end;\n }\n }\n }\n else cout<<\"NA\"<<endl;\n end:;\n }\n return 0;\n}", "#include <vector>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <sstream>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <climits>\nusing namespace std;\ninline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}\ntemplate<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define FOR(i,a,b) for(int i=(a);i<=(b);++i)\n#define REP(i,n) FOR(i,0,(n)-1)\nconst double EPS = 1e-12;\nconst double PI = acos(-1.0);\n\nint main() {\n\tint n;\n\tcin >> n;\n\tREP(i, n) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tstring h = s.substr(0, 2);\n\t\tif(h == \">'\") {\n\t\t\ts += \"!\";\n\t\t\tif(s.find('#') != string::npos && s.find('=') != string::npos) {\n\t\t\t\tint pos = s.find('#');\n\t\t\t\tint size = pos-2;\n\t\t\t\tREP(i, pos-2) {\n\t\t\t\t\tif(s[i+2] == s[i+pos+1] && s[i+2] == '=') {\n\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\t\tgoto next;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(s[pos+size+1] == '~' && s[pos+size+2] == '!') {\n\t\t\t\t\tcout << \"A\" << endl;\n\t\t\t\t\tgoto next;\n\t\t\t\t} else {\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\t\t\t\t \n\t\t\t} else {\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tgoto next;\n\t\t\t}\t\t\t\n\t\t} else if(h == \">^\") {\n\t\t\ts += \"!!\";\n\t\t\tint b = 2;\n\t\t\tbool flag = false;\n\t\t\twhile(s.substr(b, 2) == \"Q=\") {\n\t\t\t\tb += 2;\n\t\t\t\tflag = true;\n\t\t\t}\n\n\t\t\tif(s.substr(b, 2) == \"~~\" && s.substr(b+2, 2) == \"!!\" && flag) {\n\t\t\t\tcout << \"B\" << endl;\n\t\t\t\tgoto next;\n\t\t\t} else {\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tgoto next;\n\t\t\t}\n\t\t} else {\n\t\t\tcout << \"NA\" << endl;\n\t\t\tgoto next;\n\t\t}\n\t\tnext:;\n\t}\n\n\treturn 0;\n}", "#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\ntypedef complex<double> P;\n\nint solve(string &s){\n if(s.length() >= 6 && s.substr(0, 2) == \">'\" && s[(int)s.length() - 1] == '~'){\n int c1 = 0, c2 = 0, t = 0, f = 0;\n for(int i = 2; i + 1 < (int)s.length(); ++i){\n if(s[i] != '=' && s[i] != '#') f = 1;\n if(s[i] == '#' && t >= 1) f = 1;\n if(f) break;\n if(s[i] == '#') ++t;\n else if(t) ++c2;\n else ++c1;\n }\n if(!f && c1 == c2) return 0;\n }\n if(s.length() >= 6 && s.substr(0, 2) == \">^\" && s.substr((int)s.length() - 2) == \"~~\"){\n int f = 0;\n for(int i = 2; i + 2 < s.length(); i += 2) if(s.substr(i, 2) != \"Q=\") f = 1;\n if(!f) return 1;\n }\n return -1;\n}\n\nint main() {\n int T; cin >>T;\n REP(t, T){\n string s; cin >>s;\n int ans = solve(s);\n cout <<(ans == 0 ? \"A\" : (ans == 1 ? \"B\" : \"NA\")) <<endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int, int>;\n\nbool f(string s) {\n int l = 0, r = 0, sz = s.size();\n while (r < sz && s[r] == '=') r++;\n if (r - l == 0) return false;\n if (r < sz && s[r] != '#') return false;\n if (s.substr(r + 1, r - l) != string(r - l, '=')) return false;\n r += 1 + r - l;\n if (r + 1 != sz || s[r] != '~') return false;\n return true;\n}\n\nbool g(string s) {\n int sz = s.size();\n if (sz % 2 == 1 || sz == 2) return false;\n for (int i = 0; i < sz; i += 2) {\n if (s.substr(i, 2) == \"Q=\") continue;\n if (s.substr(i, 2) == \"~~\" && i + 2 == sz) break;\n return false;\n }\n return true;\n}\n\nint main() {\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n \n int n;\n cin >> n;\n for (int i = 0; i < n; i++) {\n string S;\n cin >> S;\n if (S.substr(0, 2) == \">'\") {\n cout << (f(S.substr(2)) ? \"A\" : \"NA\") << endl;\n } else if (S.substr(0, 2) == \">^\") {\n cout << (g(S.substr(2)) ? \"B\" : \"NA\") << endl;\n } else {\n cout << \"NA\" << endl;\n }\n }\n\n return 0;\n}\n", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n getchar();\n for(int i = 0; i < n; i++) {\n string snake;\n getline(cin, snake);\n\n string ans = \"NA\";\n if(snake[0] == '>' && snake[1] == '\\'' && snake.length() >= 6) {\n int shape = 0;\n for(int i = 2; i < snake.length(); i++) {\n\tif(i+1 >= snake.length()) {\n\t if(snake[i] == '~') ans = \"A\";\n\t} else {\n\t if(snake[i] != '=' && snake[i] != '#') break;\n\t if(snake[i] == '#') {\n\t if(shape == 1) break;\n\t else {\n\t shape++;\n\t if(i-2 != (double)(snake.length()-4)/2) break;\n\t }\n\t }\n\t}\n }\n } else if(snake[0] == '>' && snake[1] == '^' && snake.length()%2 == 0 && snake.length() >= 6) {\n for(int i = 3; i < snake.length(); i+=2) {\n\tif(i+2 >= snake.length()) {\n\t if(snake[i-1] == '~' && snake[i] == '~') ans = \"B\";\n\t} else {\n\t if(snake[i-1] != 'Q' || snake[i] != '=') break;\n\t}\n }\n }\n\n cout << ans << endl;\n }\n return 0;\n}", "//Name: Snakes\n//Level: 2\n//Category: 文字列,オートマトン\n//Note: \n\n/**\n * AとBは別々に判定する。\n */\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nbool snakeA(const string &s) {\n auto it = begin(s);\n int cnt = 0;\n if(*it++ != '>') return false;\n if(*it++ != '\\'') return false;\n while(true) {\n const char c = *it++;\n if(c == '#') break;\n else if(c == '=') ++cnt;\n else return false;\n }\n if(cnt == 0) return false;\n while(cnt--) {\n if(*it++ != '=') return false;\n }\n if(*it++ != '~') return false;\n return it == end(s);\n}\n\nbool snakeB(const string &s) {\n auto it = begin(s);\n if(*it++ != '>') return false;\n if(*it++ != '^') return false;\n bool ok = false;\n while(true) {\n const char c = *it++;\n if(c == '~') break;\n else if(c != 'Q') return false;\n\n if(*it++ != '=') return false;\n ok = true;\n }\n if(!ok) return false;\n if(*it++ != '~') return false;\n return it == end(s);\n}\n\nbool solve(bool first) {\n string s;\n cin >> s;\n if(snakeA(s)) cout << \"A\" << endl;\n else if(snakeB(s)) cout << \"B\" << endl;\n else cout << \"NA\" << endl;\n return true;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout.setf(ios::fixed);\n cout.precision(2);\n\n bool first = true;\n int N;\n cin >> N;\n while(N-- && solve(first)) {\n first = false;\n }\n return 0;\n}", "#include<iostream>\n#include<string>\n\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int D = 0; D < n; ++D){\n\t\tstring s;\n\t\tcin>>s;\n\t\t\n\t\tif(s.compare(0,2,\">'\")== 0){\n\t\t\tint bef_eq = 0;\n\t\t\tint aft_eq = 0;\n\t\t\tint shp = 0;\n\t\t\tint pos_shp = 0;\n\t\t\tint pos_tld = 0;\n\n\t\t\tfor(unsigned int i = 2; i < s.length(); ++i ){\n\t\t\t\tif( s[i] == '=' )\n\t\t\t\t\tif( shp == 0 )\n\t\t\t\t\t\t++bef_eq;\n\t\t\t\t\telse\n\t\t\t\t\t\t++aft_eq;\n\t\t\t\telse if( s[i] == '#' ){\n\t\t\t\t\tshp++;\n\t\t\t\t}else if( s[i] == '~' ){\n\t\t\t\t\tpos_tld = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\tshp = 2;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif( bef_eq && aft_eq && pos_tld && bef_eq == aft_eq &&\n\t\t\t\tshp == 1 && pos_tld == s.length() - 1 )\n\t\t\t\tcout << \"A\\n\";\n\t\t\telse\n\t\t\t\tcout << \"NA\\n\";\n\t\t}else if(s.compare(0,2,\">^\")==0){\n\t\t\tint cnt_qeq = 0;\n\t\t\tint pos_tltl = 0;\n\t\t\tbool invalid = false;\n\t\t\t\n\t\t\tif( s.length() <= 2 || s.length() % 2 == 1 )\n\t\t\t\tinvalid = true;\n\t\t\t\n\t\t\tfor(unsigned int i = 2; i < s.length() && !invalid; i+=2){\n\t\t\t\tif( s.compare(i,2,\"Q=\") == 0 )\n\t\t\t\t\t++cnt_qeq;\n\t\t\t\telse if( s.compare(i,2,\"~~\") == 0 ){\n\t\t\t\t\tpos_tltl = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}else\n\t\t\t\t\tinvalid = true;\n\t\t\t}\n\t\t\tif( cnt_qeq == 0 || pos_tltl != s.length() - 2 ){\n\t\t\t\tinvalid = true;\n\t\t\t}\n\t\t\tif( invalid )\n\t\t\t\tcout << \"NA\\n\";\n\t\t\telse\n\t\t\t\tcout << \"B\\n\";\n\t\t}else{\n\t\t\tcout <<\"NA\\n\";\n\t\t}\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <string>\n#define REP(i, a, b) for (int i = (a); i < (b); ++i)\nusing namespace std;\nint main()\n{\n int n; cin >> n;\n while (n--) {\n string s; cin >> s;\n string head = s.substr(0, 2);\n bool ok = true;\n if (head == \">'\") {\n int c = 0;\n REP(i, 2, s.size()) { if (s[i] != '=') break; c++; }\n if (c < 1) ok = false;\n else if (s[c+2] != '#') ok = false;\n else if (s.substr(c+3, c) != string(c, '=')) ok = false;\n else if (s.size() != c*2 + 4) ok = false;\n else if (s[s.size()-1] != '~') ok = false;\n puts(ok ? \"A\" : \"NA\");\n }\n else if (head == \">^\") {\n if (s.substr(2, 2) != \"Q=\") ok = false;\n else {\n for (int i = 4; i < s.size()-2; i+=2)\n if (s.substr(i, 2) != \"Q=\") { ok = false; break; }\n if (ok && s.substr(s.size()-2) != \"~~\") ok = false;\n }\n puts(ok ? \"B\" : \"NA\");\n }\n else puts(\"NA\");\n }\n return 0;\n}", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nstring afunc(string str)\n{\n\tstring res = \"NA\";\n\tif(str[0] == '#'){\n\t\treturn res;\n\t}\n\t\n\tfor(int i = 0, j = str.size()-1; i <= j; i++, j--){\n\t\tif(i == j){\n\t\t\tif(str[i] == '#'){\n\t\t\t\tres = \"A\";\n\t\t\t}\n\t\t} else if(str[i] != '=' || str[j] != '='){\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\treturn res;\n}\n\nstring bfunc(string str)\n{\n\tstring res = \"B\";\n\tif(str.size() == 0){\n\t\treturn \"NA\";\n\t}\n\tfor(int i = 0; i < str.size(); i+=2){\n\t\tif(str[i] != 'Q' || str[i+1] != '='){\n\t\t\tres = \"NA\";\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\treturn res;\n}\n\nint main()\n{\n\tint n;\n\tstring str, res;\n\t\n\twhile(cin >> n && n){\n\t\twhile(n--){\n\t\t\tcin >> str;\n\t\t\tres = \"NA\";\n\t\t\tif('>' == str[0]){\n\t\t\t\tstr.erase(str.begin());\n\t\t\t\tint l = str.size();\n\t\t\t\tif(str[0] == '\\'' && str[l-1] == '~'){\n\t\t\t\t\tstr.erase(str.end()-1);\n\t\t\t\t\tstr.erase(str.begin());\n\t\t\t\t\tif(str.size()%2 == 1){\n\t\t\t\t\t\tres = afunc(str);\n\t\t\t\t\t}\n\t\t\t\t} else if(str[0] == '^' && str[l-1] == str[l-2] && str[l-1] == '~'){\n\t\t\t\t\tstr.erase(str.end()-1);\n\t\t\t\t\tstr.erase(str.end()-1);\n\t\t\t\t\tstr.erase(str.begin());\n\t\t\t\t\t\n\t\t\t\t\tif(str.size()%2 == 0){\n\t\t\t\t\t\tres = bfunc(str);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tcout << res << endl;\n\t\t}\n\t}\n\t\n\treturn 0;\n}", "import re\nptA = re.compile(r\"^>'(=+)#\\1~$\")\nptB = re.compile(r\"^>\\^(?:Q=)+~~$\")\nfor i in xrange(input()):\n\ts = raw_input()\n\tif ptA.match(s):\n\t\tprint \"A\"\n\telif ptB.match(s):\n\t\tprint \"B\"\n\telse:\n\t\tprint \"NA\"", "#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cstring>\n#include<cctype>\n#include<complex>\n#include<iostream>\n#include<sstream>\n#include<algorithm>\n#include<functional>\n#include<vector>\n#include<string>\n#include<stack>\n#include<queue>\n#include<map>\n\nusing namespace std;\nconst int dx[] = {1,0,-1,0},dy[] = {0,1,0,-1};\n#define INF 10000000\n#define rep(i,j) for(int i=0;i<(j);++i)\n#define reps(i,j,k) for(int i=j;i<k;++i)\ntypedef long long ll;\ntypedef unsigned long long ull;\nchar snake[256]={0};\nint check(int len){\n\tif(len % 2 == 1)return INF;\n\tif(snake[0] == '>'){\n\t\tif(snake[1] == 39){\n\t\t\tif(snake[len-1] != '~')return INF;\n\t\t\tint cnt = 0;\n\t\t\tint x = 0;\n\t\t\trep(i,len){\n\t\t\t\tif(snake[i] == '#'){\n\t\t\t\t\tcnt++;\n\t\t\t\t\tx = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cnt != 1)return INF;\n\t\t\tif(snake[2] != '=')return INF;\n\t\t\treps(i,3,x){\n\t\t\t\tif(snake[i] != '=')return INF;\n\t\t\t}\n\t\t\treps(i,x+1,len-1){\n\t\t\t\tif(snake[i] != '=')return INF; \n\t\t\t}\n\t\t\treturn (x-2 == len-x-2) ? 1 : INF; \n\t\t}\n\t\telse if(snake[1] == '^'){\n\t\t\tif(snake[len-1] != '~' || snake[len-2] != '~')return INF;\n\t\t\tif(snake[2] != 'Q' || snake[3] != '=')return INF;\n\t\t\tfor(int i = 4; i < len-2; i += 2){\n\t\t\t\tif(snake[i] != 'Q' || snake[i+1] != '=')return INF;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn INF;\n}\nint main(){\n\tint n;\n\tscanf(\"%d\",&n);\n\trep(q,n){\n\t\tmemset(snake,0,sizeof(snake));\n\t\tscanf(\"%s\",snake);\n\t\tint len = strlen(snake);\n\t\tint res = check(len);\n\t\t(res == 1) ? puts(\"A\") : (res == 0) ? puts(\"B\") : puts(\"NA\");\n\t}\n\treturn 0;\n}", "#include <iostream>\n\nint main(){\n\tint n;\n\tstd::cin >> n;\n\twhile(n--){\n\t\tstd::string sn, res = \"\";\n\t\tstd::cin >> sn;\n\n\t\t//Type A\n\t\t//“ª‚ª>'CK”ö‚ª~C‚©‚‚¨• ‚Ì•”•ª‚ªŠï”‚Å‚ ‚é\n\t\tif(sn.substr(0,2) == \">'\" &&\n\t\t\t sn[sn.size()-1] == '~' && (sn.size()-3) % 2 == 1){\n\t\t\tstd::string st = sn.substr(2,sn.size()-3);\n\t\t\t//‚¨• ‚̐^‚ñ’†‚ª#\n\t\t\tif(st[st.size()/2] == '#'){\n\t\t\t\tst.replace(st.size()/2,1,\"\");\n\t\t\t\t\n\t\t\t\t//#ˆÈŠO‚ª‚·‚ׂÄ=\n\t\t\t\t// int eq = 1;\n\t\t\t\t// for(int i=0;i<st.size();i++){\n\t\t\t\t// \tif(st[i] != '='){eq = 0;break;}\n\t\t\t\t// }\n\t\t\t\t// if(eq)std::cout << \"A\" << std::endl;\n\t\t\t\tif(st != \"\"){\n\t\t\t\t\tint pos;\n\t\t\t\t\twhile(pos = st.find(\"=\"), pos != std::string::npos){\n\t\t\t\t\t\tst.replace(pos,1,\"\");\n\t\t\t\t\t}\n\t\t\t\t\tif(st == \"\")res = \"A\\n\";\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//Type B\n\t\tif(sn.substr(0,2) == \">^\" &&\n\t\t\t sn.substr(sn.size()-2,2) == \"~~\" &&\n\t\t\t (sn.size()-4) % 2 == 0){\n\t\t\tstd::string st = sn.substr(2,sn.size()-4);\n\t\t\tif(st != \"\"){\n\t\t\t\tint pos;\n\t\t\t\twhile(pos = st.find(\"Q=\"), pos != std::string::npos){\n\t\t\t\t\tst.replace(pos,2,\"\");\n\t\t\t\t}\n\t\t\t\tif(st == \"\")res = \"B\\n\";\n\t\t\t}\n\t\t}\n\n\t\tif(res == \"\")res = \"NA\\n\";\n\t\tstd::cout << res;\n\t}\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nbool is_A(string s){\n\tint size = s.size();\n\tif(size < 6) return false;\n\tif(s[0] != '>' || s[1] != '\\'') return false;\n\tif(s[size - 1] != '~') return false;\n\tif(s[2] != '=') return false;\n\tint count = 0;\n\tint i = 2;\n\twhile(s[i] == '='){ count++; i++; }\n\tif(s[i++] != '#') return false;\n\tfor(int j = 0; j < count; j++, i++){\n\t\tif(s[i] != '=') return false;\n\t}\n\tif(i == size - 1) return true;\n\telse return false;\n}\n\nbool is_B(string s){\n\tint size = s.size();\n\tif(size < 6) return false;\n\tif(s[0] != '>' || s[1] != '^') return false;\n\tif(s[size - 1] != '~' || s[size - 2] != '~') return false;\n\tint i = 2;\n\twhile(i < size - 2){\n\t\tif(s[i] != 'Q' || s[i+1] != '=') return false;\n\t\ti += 2;\n\t}\n\treturn true;\n}\n\nint main(){\n\tstring s;\n\tint n;\n\tcin >> n;\n\tgetline(cin, s);\n\tfor(int i = 0; i < n; i++){\n\t\tgetline(cin, s);\n\t\tif(is_A(s)) cout << \"A\";\n\t\telse if(is_B(s)) cout << \"B\";\n\t\telse cout << \"NA\";\n\t\tcout << endl;\n\t}\n\treturn 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n \n \npublic class Main {\n\tprivate static BufferedReader br = null;\n\n\tstatic {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t}\n\n\t/**\n\t* @param args\n\t*/\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tint cnt = parseNum();\n\t\twhile (cnt-- > 0) {\n\t\t\tparseSnake();\n\t\t}\n\t}\n\n\tprivate static void parseSnake() {\n\t\tint typ = 0;\n\t\tString str = null;\n\n\t\tif ((str = parseStdin()) != null) {\n\t\t\tint\tlen = str.length();\n\t\t\tif (len >= 6 && len%2 == 0) {\n\t\t\t\tif (str.charAt(0) == '>') {\n\t\t\t\t\tif (str.charAt(1) == '\\'') {\n\t\t\t\t\t\tif (str.charAt(len-1) == '~' && str.charAt(len-2) == '=') {\n\t\t\t\t\t\t\tif (str.charAt(2) == '=') {\n\t\t\t\t\t\t\t\tchar\tstc = 0;\n\t\t\t\t\t\t\t\tint\t\tmid = 2+(len-4)/2;\n\t\t\t\t\t\t\t\tfor (int i = 2; i < len-1; i++) {\n\t\t\t\t\t\t\t\t\tstc = str.charAt(i);\n\t\t\t\t\t\t\t\t\ttyp = (i == 2) ? 1 : typ;\n\t\t\t\t\t\t\t\t\tif ((stc != '=' && stc != '#') || (stc == '#' && i != mid) || (stc != '#' && i == mid)) {\n\t\t\t\t\t\t\t\t\t\ttyp = 0;\n\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (str.charAt(1) == '^') {\n\t\t\t\t\t\tif (str.charAt(len-1) == '~' && str.charAt(len-2) == '~' && str.charAt(len-3) == '=') {\n\t\t\t\t\t\t\tchar\tsc1 = 0;\n\t\t\t\t\t\t\tchar\tsc2 = 0;\n\t\t\t\t\t\t\tfor (int i = 2; i+1 < len-2; i += 2) {\n\t\t\t\t\t\t\t\ttyp = (i == 2) ? 2 : typ;\n\t\t\t\t\t\t\t\tsc1 = str.charAt(i);\n\t\t\t\t\t\t\t\tsc2 = str.charAt(i+1);\n\t\t\t\t\t\t\t\tif (sc1 != 'Q' || sc2 != '=') {\n\t\t\t\t\t\t\t\t\ttyp = 0;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tswitch (typ) {\n\t\tcase\t1:\n\t\t\tSystem.out.println(\"A\");\n\t\t\tbreak;\n\t\tcase\t2:\n\t\t\tSystem.out.println(\"B\");\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tSystem.out.println(\"NA\");\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tprivate static int parseNum() {\n\t\tint num = 0;\n\t\tString str = null;\n\n\t\tif ((str = parseStdin()) != null) {\n\t\t\tnum = Integer.parseInt(str);\n\t\t}\n\n\t\treturn num;\n\t}\n\n\tprivate static String parseStdin() {\n\t\tString stdin = null;\n\n\t\ttry {\n\t\t\tString tmp = br.readLine();\n\t\t\tif (tmp != null) {\n\t\t\t\tif (!tmp.isEmpty()) stdin = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\tcatch (IOException e) {}\n\n\t\treturn stdin;\n\t}\n}", "#include<iostream>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\n\n#define rep(i, n)for((i) = 0;(i) < (n);++(i))\n\nstring solve(string s){\n\tint i = 0, j;\n\tstring tmp;\n\trep(i, 100){\n\t\ttmp += \"=\";\n\t\tif(s == \">'\" + tmp + \"#\" + tmp + \"~\")return \"A\";\n\t}\n\ttmp.clear();\n\trep(i, 100){\n\t\ttmp += \"Q=\";\n\t\tif(s == \">^\" + tmp + \"~~\")return \"B\";\n\t}\n\treturn \"NA\";\n}\n\nint main(void){\n\tint i, j, n;\n\tstring s;\n\tscanf(\"%d\", &n);\n\tfor(;n--;){\n\t\tcin >> s;\n\t\tcout << solve(s) << endl;\n\t}\n\t\n\treturn 0;\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main(){\n string snake;\n int n,len;\n\n cin >> n;\n for(int i=0;i<n;i++){\n cin >> snake;\n len = snake.size();\n int ans = -1;\n if(snake[0] == '>' && snake[1] == '\\''){\n int pos = 2;\n int turn = 0;\n int flag = 0;\n int count = 0;\n do{\n\tif(turn && snake[pos] == '=')count--;\n\telse if(snake[pos] == '=') count++;\n\telse if(snake[pos] == '#')turn = 1;\n\telse flag = 0;\n\tif(pos == 2 && count > 0)flag = 1;\n\tpos++;\n }while(pos < len-1);\n if(count == 0 && flag && snake[pos] == '~')ans = 0;\n }else if(snake[0] == '>' && snake[1] == '^'){\n int pos = 2;\n int flag = 1;\n do{\n\tif(snake[pos] != 'Q' || snake[pos+1] != '='){\n\t flag = 0;\n\t break;\n\t}\n\tpos += 2;\n }while(pos < len-2);\n if(flag && snake[pos] == '~' && snake[pos+1] == '~')ans = 1;\n }\n if(ans == 0)cout << 'A' << endl;\n else if(ans == 1)cout << 'B' << endl;\n else cout << \"NA\" << endl;\n }\n\n return 0;\n}", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nvoid solve()\n{\n\tint n;\n\tcin >> n;\n\twhile(n--)\n\t{\n\t\tstring snake;\n\t\tcin >> snake;\n\t\tif(snake.size() < 4)\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse if(snake[0] == '>' && snake[1] == '\\'' && snake[snake.size() - 1] == '~')\n\t\t{\n\t\t\tbool first = true;\n\t\t\tint count1 = 0;\n\t\t\tint count2 = 0;\n\t\t\tfor(int i = 2; i < snake.size() - 1; ++i)\n\t\t\t{\n\t\t\t\tif(snake[i] == '=')\n\t\t\t\t{\n\t\t\t\t\tif(first)\n\t\t\t\t\t{\n\t\t\t\t\t\t++count1;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t++count2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if(snake[i] == '#')\n\t\t\t\t{\n\t\t\t\t\tfirst = false;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\tgoto END;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count1 == count2 && count1 >= 1)\n\t\t\t{\n\t\t\t\tcout << \"A\" << endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t}\n\t\t}\n\t\telse if(snake[0] == '>' && snake[1] == '^' && snake[snake.size() - 2] == '~' && snake[snake.size() - 1] == '~')\n\t\t{\n\t\t\tbool flag = true;\n\t\t\tint count = 0;\n\t\t\tfor(int i = 2; i < snake.size() - 2; i += 2)\n\t\t\t{\n\t\t\t\tif(snake[i] != 'Q' || snake[i + 1] != '=')\n\t\t\t\t{\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(snake[i] == 'Q' && snake[i + 1] == '=')\n\t\t\t\t{\n\t\t\t\t\t++count;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag && count)\n\t\t\t{\n\t\t\t\tcout << \"B\" << endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\nEND:\n\t\t;\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}", "import java.util.*; \nimport java.util.regex.Matcher; \nimport java.util.regex.Pattern; \nimport java.lang.*; \nimport java.math.*; \nimport java.io.*; \n \nimport static java.lang.Math.*; \nimport static java.util.Arrays.*; \n \npublic class Main{ \n \n Scanner sc=new Scanner(System.in); \n \n int INF=1<<28; \n double EPS=1e-9; \n \n void run(){ \n for(int n=sc.nextInt(); n>0; n--){ \n String s=sc.next(); \n Matcher m=Pattern.compile(\"^>'(=+)#(=+)~$\").matcher(s); \n if(m.find()){ \n if(m.group(1).length()==m.group(2).length()){ \n println(\"A\"); \n continue; \n } \n } \n m=Pattern.compile(\"^>\\\\^(Q=)+~~$\").matcher(s); \n if(m.find()){ \n println(\"B\"); \n continue; \n } \n println(\"NA\"); \n } \n } \n \n void debug(Object... os){ \n System.err.println(Arrays.deepToString(os)); \n } \n \n void print(String s){ \n System.out.print(s); \n } \n \n void println(String s){ \n System.out.println(s); \n } \n \n public static void main(String[] args){ \n // System.setOut(new PrintStream(new BufferedOutputStream(System.out))); \n new Main().run(); \n } \n} ", "# -*- coding: utf-8 -*-\n\"\"\"\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0139\n\n\"\"\"\nimport sys\nfrom sys import stdin\nimport re\ninput = stdin.readline\n\n\ndef identify_snake(snake):\n # ????????????>`???????¶???????1?????\\?????????=]??????#??????????????§1?????\\?????????=??????????????????~??????????????¨?????????=?????°?????????\n patternA = re.compile(\"^>'(=+)#(=+)~\")\n resultA = patternA.search(snake)\n if resultA:\n pre, post = resultA.groups()\n if pre == post:\n return 'A'\n\n # ????????????>^???????¶???????1?????\\?????????Q=]???????????????????????????~~???\n patternB = re.compile(\"^>\\^(Q=)+~~\")\n resultB = patternB.search(snake)\n if resultB:\n return 'B'\n\n return 'NA'\n\n\ndef main(args):\n n = int(input())\n for _ in range(n):\n snake = input()\n result = identify_snake(snake)\n print(result)\n\n\nif __name__ == '__main__':\n main(sys.argv[1:])", "#include <iostream>\n#include <string>\nusing namespace std;\n#define rep2(x,from,to) for(int x=(from);x<(to);++(x))\n#define rep(x,to) rep2(x,0,to)\n\nint main() {\n\tstring s;\n\tint n;\n\tcin >> n;\n\trep(i,n) {\n\t\tcin >> s;\n\t\tint len = s.length();\n\t\tbool fa = 0, fb = 0;\n\t\tif(len > 5 && len % 2 == 0) {\n\t\t\tfa = 1;\n\t\t\tstring ns;\n\t\t\tns += s.substr(2,len/2-2);\n\t\t\tns += s.substr(len/2+1,len/2-2);\n\t\t\trep(i,ns.length()) {\n\t\t\t\tif(ns[i] != '=') fa = 0;\n\t\t\t}\n\t\t\tif(s[0] != '>' || s[1] != '\\'' || s[len/2] != '#' || s[len-1] != '~') {\n\t\t\t\tfa = 0;\n\t\t\t}\n\t\t\tfb = 1;\n\t\t\trep2(i,1,(len-2)/2) {\n\t\t\t\tif(s[2*i] != 'Q' || s[2*i+1] != '=') fb = 0;\n\t\t\t}\n\t\t\tif(s[0] != '>' || s[1] != '^' || s[len-2] != '~' || s[len-1] != '~') {\n\t\t\t\tfb = 0;\n\t\t\t}\n\t\t}\n\t\tif(fa) cout << \"A\" << endl;\n\t\telse if(fb) cout << \"B\" << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint n;\nstring s;\nint main()\n{\n cin>>n;\n for(;n--;)\n {\n cin>>s;\n string t=\"NA\";\n if(s.substr(0,2)==\">'\")\n {\n int cnt=0;\n int i=2;\n while(i<s.size()&&s[i]=='=')i++,cnt++;\n if(cnt>0&&s[i]=='#')\n {\n int j=i+1;\n while(j<s.size()&&s[j]=='=')j++,cnt--;\n if(cnt==0&&j+1==s.size()&&s.substr(j,1)==\"~\")t=\"A\";\n }\n }\n else if(s.substr(0,2)==\">^\")\n {\n int i=2;\n while(i+2<s.size()&&s.substr(i,2)==\"Q=\")i+=2;\n if(i>2&&i+2==s.size()&&s.substr(i,2)==\"~~\")\n {\n t=\"B\";\n }\n }\n cout<<t<<endl;\n }\n}\n", "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tBufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n\t\tString snake;\n\t\tbf.readLine();\n\t\twhile ((snake = bf.readLine()) != null) {\n\t\t\tString ans = isSnakeA(snake) ? \"A\" : isSnakeB(snake) ? \"B\" : \"NA\";\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\tprivate static boolean isSnakeA(String snake) {\n\t\tString sa = \"^>'(=+)#\\\\1~$\";\n\t\tPattern pa = Pattern.compile(sa);\n\t\tMatcher ma = pa.matcher(snake);\n\t\treturn ma.find();\n\t}\n\n\tprivate static boolean isSnakeB(String snake) {\n\t\tString sb = \"^>\\\\^(Q=)+~~$\";\n\t\tPattern pb = Pattern.compile(sb);\n\t\tMatcher mb = pb.matcher(snake);\n\t\treturn mb.find();\n\t}\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nvoid printNA() {\n cout << \"NA\" << endl;\n}\n\nvoid judgeB(string s) {\n if (s.substr(s.size() - 2, 2) != \"~~\") {\n printNA();\n return;\n }\n if (s.size() <= 4) {\n printNA();\n return;\n }\n for (int i = 2; i < s.size() - 2; i += 2) {\n if (s.substr(i, 2) != \"Q=\") {\n printNA();\n return;\n }\n }\n cout << \"B\" << endl;\n}\n\nvoid judgeA(string s) {\n int len = 0;\n int i;\n for (i = 2; s[i] == '='; i++) {\n len++;\n }\n if (len == 0 || s.size() < i || s[i] != '#') {\n printNA();\n return;\n }\n if (s.size() < 2 + 2 * len) {\n printNA();\n return;\n }\n for (i++ ; i <= 2 + 2 * len; i++) {\n if (s[i] != '=') {\n printNA();\n return;\n }\n }\n if (s.size() == i || s[i] != '~') {\n printNA();\n } else {\n cout << \"A\" << endl;\n }\n}\n\nint main() {\n int n;\n cin >> n;\n for (int c = 0; c < n; c++) {\n string s;\n cin >> s;\n if (s.substr(0, 2) == \">'\") {\n judgeA(s);\n } else if (s.substr(0, 2) == \">^\") {\n judgeB(s);\n } else {\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}", "#include<iostream>\n#include<cstdio>\n#include<string>\nusing namespace std;\n\nint main(void){\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tstring str;\n\t\tcin >> str;\n\t\tif(str.size()<2)cout << \"NA\" << endl;\n\t\telse if(str[0]=='>' && str[1]=='\\''){\n\t\t\tint j=2;\n\t\t\tint l[2]={0,0};\n\t\t\tint ck=0;\n\t\t\tbool ch[2]={false,true};\n\t\t\twhile(j<str.size()){\n\t\t\t\tif(str[j]=='=')l[ck]++;\n\t\t\t\telse if(str[j]=='#' && l[0]>0)ch[0]=true,ck=1;\n\t\t\t\telse if(str[j]=='~')break;\n\t\t\t\telse ch[1]=false;\n\t\t\t\tj++;\n\t\t\t}\n\t\t\tif(ch[0]==true && ch[1]==true && l[0]==l[1])cout << \"A\" << endl;\n\t\t\telse cout << \"NA\" << endl;\n\t\t}else if(str[0]=='>' && str[1]=='^'){\n\t\t\tif(str.size()%2==1 || str.size()<6)cout << \"NA\" << endl;\n\t\t\telse{\n\t\t\t\tbool ch=true;\n\t\t\t\tfor(int j=2;j<str.size()-2;j+=2){\n\t\t\t\t\tif(str[j]!='Q' || str[j+1]!='=')ch=false;\n\t\t\t\t}\n\t\t\t\tif(str[str.size()-2]!='~' || str[str.size()-1]!='~')ch=false;\n\t\t\t\tif(ch==true)cout << \"B\" << endl;\n\t\t\t\telse cout << \"NA\" << endl;\n\t\t\t}\n\t\t}else cout << \"NA\" << endl;\n\t}\n return 0;\n}", "import java.lang.*;\nimport java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tString s=sc.next();\n\t\t\tif(s.matches(\"^>'(=+)#\\\\1~$\"))\n\t\t\t\tSystem.out.println(\"A\");\n\t\t\telse if(s.matches(\"^>\\\\^(Q=)+~~$\"))\n\t\t\t\tSystem.out.println(\"B\");\n\t\t\telse\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t}\n\t}\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint n;\nstring s;\n\nbool checkA(string s) {\n\tif (s.length() < 6) return false;\n\tif (s[0] != '>') return false;\n\tif (s[1] != '\\'') return false;\n\t\n\tint i;\n\tfor (i = 2; i < s.length() && s[i] == '='; i++);\n\tif (i == s.length() || s[i] != '#') return false;\n\tint cnt = i - 2;\n\tfor (i = i + 1; i < s.length() && s[i] == '='; i++, cnt--);\n\tif (cnt != 0) return false;\n\tif (s.length() != i + 1) return false;\n\tif (s[i] != '~') return false;\n\treturn true;\n}\n\nbool checkB(string s) {\n\tif (s.length() < 6) return false;\n\tif (s[0] != '>') return false;\n\tif (s[1] != '^') return false;\n\tint i;\n\tfor (i = 2; i < s.length(); i += 2) {\n\t\tif (i + 1 >= s.length()) return false;\n\t\tif (s[i] != 'Q') break;\n\t\tif (s[i + 1] != '=') return false;\n\t}\n\tif (s.length() != i + 2) return false;\n\tif (s[i] != '~' || s[i + 1] != '~') return false;\n\treturn true;\n}\n\nint main() {\n\tcin >> n;\n\twhile (n--) {\n\t\tcin >> s;\n\t\tif (checkA(s)) cout << \"A\" << endl;\n\t\telse if (checkB(s)) cout << \"B\" << endl;\n\t\telse cout << \"NA\" << endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nvoid a(){\n\tcout << \"NA\" << endl;\n\treturn;\n}\n\nint main(){\n\tint n;\n\tvector<string> sample;\n\tstring aaa;\n\n\tcin >> n;\n\tfor(int i=0;i<n;i++){\n\t\tcin >> aaa;\n\t\tsample.push_back(aaa);\n\t}\n\n\tfor(unsigned int i=0;i<sample.size();i++){\n\t\tstring snake = sample[i];\n\t\tstring::size_type aruyon;\n\n\t\tif((aruyon = snake.find(\">'\"))==0){\n\t\t\tint equal=0;\n\t\t\tint j;\n\t\t\tfor(j=2;snake.at(j)=='=';j++) equal++;\n\t\t\tif(equal > 0)\n\t\t\t\tif(snake.at(j) == '#'){\n\t\t\t\t\tj++;\n\t\t\t\t\tfor(;snake.at(j)=='=';j++) equal--;\n\t\t\t\t\tif(equal == 0){\n\t\t\t\t\t\tif(snake.at(j)=='~' && j+1 == snake.size()) cout << 'A' << endl;\n\t\t\t\t\t\telse a();\n\t\t\t\t\t}\n\t\t\t\t\telse a();\n\t\t\t\t}\n\t\t\t\telse a();\n\t\t\telse a();\n\t\t}\n\t\telse if((aruyon = snake.find(\">^\"))==0){\n\t\t\tint j;\n\t\t\tbool dou = false;\n\t\t\taruyon = snake.find(\"~~\");\n\t\t\tif(aruyon == snake.size() -2){\n\t\t\t\tif(aruyon%2==0){\n\t\t\t\t\tfor(j=2;j<aruyon;j++){\n\t\t\t\t\t\tdou = false;\n\t\t\t\t\t\tif(snake.at(j) == 'Q') j++;\n\t\t\t\t\t\telse break;\t\n\t\t\t\t\t\tif(snake.at(j) == '=') dou = true;\n\t\t\t\t\t\telse break;\n\t\t\t\t\t}\n\t\t\t\t\tif(dou) cout << 'B' << endl;\n\t\t\t\t\telse a();\n\t\t\t\t}\n\t\t\t\telse a();\n\t\t\t}\n\t\t\telse a();\n\t\t\t\t\n\t\t}\n\t\telse\n\t\t\ta();\n\t}\n\n return 0;\n}", "import java.util.*;\nimport java.util.regex.*;\n\nclass Main {\n public static void main (String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n scanner.nextLine();\n for (int ii = 0; ii < n; ii++) {\n String str = scanner.nextLine();\n Pattern pa = Pattern.compile(\"^>'(=+)#\\\\1~$\");\n Pattern pb = Pattern.compile(\"^>\\\\^(?:Q=)+(?:~~)$\");\n Matcher ma = pa.matcher(str);\n Matcher mb = pb.matcher(str);\n if (ma.find()) {\n System.out.println(\"A\");\n } else if (mb.find()) {\n System.out.println(\"B\");\n } else {\n System.out.println(\"NA\");\n }\n }\n }\n}", "#include<iostream>\n#include<string>\n\nusing namespace std;\n\nint count( string str, string t, int &curr ){\n int cnt = 0;\n for( ; curr + t.size() - 1 < str.size(); cnt++, curr += t.size() ){\n if( str.substr(curr, t.size()) != t ) break;\n }\n return cnt;\n}\n\nbool isA( string str, int curr ){\n if ( str.substr(0, curr) != \">'\" ) return false;\n int cnt = count(str, \"=\", curr);\n if ( cnt < 1 || str[curr++] != '#' ) return false;\n if ( cnt != count(str, \"=\", curr) ) return false;\n return ( curr == str.size()-1 && str[curr] == '~');\n}\n\nbool isB( string str, int curr ){\n if ( str.substr(0, curr) != \">^\" ) return false;\n int cnt = count(str, \"Q=\", curr);\n return ( cnt && curr == str.size()-2 && str.substr(str.size()-2, 2) == \"~~\");\n}\n\nint main(){\n int tcase; cin >> tcase;\n for ( int i = 0; i < tcase; i++ ) {\n string snake; cin >> snake;\n if ( isA(snake, 2) ) cout << \"A\" << endl;\n else if ( isB(snake, 2) ) cout << \"B\" << endl;\n else cout << \"NA\" << endl;\n }\n return 0;\n}\n\n", "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n int n,size;\n string s,a,b;\n for(cin>>n,getline(cin,s,'\\n');n>0;n--){\n getline(cin,s,'\\n');\n //cin>>s;\n size = s.size();\n if(size<6||size%2){cout<<\"NA\"<<endl;continue;}\n a=\">'\"; b=\">^\";\n for(int i=0;i<size/2-2;i++){a=a+\"=\";b=b+\"Q=\";}\n a+=\"#\";\n for(int i=0;i<size/2-2;i++){a=a+\"=\";}\n a+=\"~\"; b+=\"~~\";\n if (s==a)cout<<\"A\"<<endl;\n else if (s==b)cout<<\"B\"<<endl;\n else cout<<\"NA\"<<endl;\n }\n return 0;\n}", "#include<iostream>\n#include<iomanip>\n#include<algorithm>\n#include<array>\n#include<bitset>\n#include<cassert>\n#include<cctype>\n#include<cmath>\n#include<cstdio>\n#include<cstring>\n#include<functional>\n#include<limits>\n#include<list>\n#include<map>\n#include<numeric>\n#include<set>\n#include<stack>\n#include<string>\n#include<sstream>\n#include<unordered_map>\n#include<queue>\n#include<regex>\n#include<vector>\nusing namespace std;\n\n//#define int long long\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int, int>;\n\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define all(a) (a).begin(),(a).end()\n#define dump(o) {cerr<<#o<<\" \"<<o<<endl;}\n#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<\" \"<<e;cerr<<endl;}\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\nconst int MOD = 1e9 + 7;\n\nsigned main() {\n\tint n; cin >> n;\n\tregex b(R\"(>\\^(Q=)+~~)\");\n\trep(i, 0, n) {\n\t\tstring s; cin >> s;\n\t\tint m = 0;\n\t\trep(j, 0, s.size())if (s[j] == '=')m++;\n\t\tregex a(\">'={\" + to_string(m / 2) + \"}#={\" + to_string(m / 2) + \"}~\");\n\t\tif (regex_match(s, a) && m) { cout << \"A\" << endl; }\n\t\telse if (regex_match(s, b)) { cout << \"B\" << endl; }\n\t\telse cout << \"NA\" << endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <string>\n#include <cstdio>\nusing namespace std;\n \nstring vbString(int Number,string Character){\n string res=\"\";\n for(int i=0;i<Number;i++) res+=Character;\n return res;\n}\nstring checksnake(string s){\n string t;\n for(int i=1;i<100;i++){\n t=\">'\"+vbString(i,\"=\")+\"#\"+vbString(i,\"=\")+\"~\";\n if(t==s) return \"A\";\n }\n \n for(int i=1;i<100;i++){\n t=\">^\"+vbString(i,\"Q=\")+\"~~\";\n if(t==s) return \"B\";\n }\n return \"NA\";\n \n}\nint main(){\n int n;\n cin >> n;\n while(n--){\n\t\tstring s;\n cin >> s;\n cout << checksnake(s) << endl;\n }\n}", "import java.util.Scanner;\npublic class Main {\n\tScanner sc;\n\tprivate void run () {\n\t\tsc = new Scanner( System.in );\n\t\tint n = sc.nextInt();\n\t\tfor( int i = 0; i < n; i++ ) {\n\t\t\tString line = sc.next();\n\t\t\tif( line.matches( \"^\\\\>\\\\'(\\\\=+)\\\\#\\\\1~$\" ) ) {\n\t\t\t\tSystem.out.println( \"A\" );\n\t\t\t} else if( line.matches( \"^\\\\>\\\\^(Q=)+(~~)$\" ) ) {\n\t\t\t\tSystem.out.println( \"B\" );\n\t\t\t} else {\n\t\t\t\tSystem.out.println( \"NA\" );\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void main( String[] args ) {\n\t\tnew Main().run();\n\t}\n}", "for i in [0]*input():\n s=raw_input()\n n=(len(s)-4)/2\n if s==\">'\"+\"=\"*n+\"#\"+\"=\"*n+\"~\": t=\"A\"\n elif s==\">^\"+\"Q=\"*n+\"~~\": t=\"B\"\n else: t=\"NA\"\n if n<1: t=\"NA\"\n print t", "#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\nint n;\nstring s;\nint main(void){\n cin >> n;\n for(int k = 0; k < n; k++){\n cin >> s;\n bool f = true;\n if(s[0]== '>' && s[1]=='\\''){\n int c=0;\n int i;\n for(i = 2; s[i]=='='; i++) c++;\n if(c && s[i]=='#'){\n\tfor(i += 1; s[i]=='='; i++) c--;\n\tif(!c && (int)s.size() == i+1 && s[i]=='~'){\n\t cout << 'A' << endl;\n\t f = false;\n\t}\n }\n }\n else if(s[0]== '>' && s[1]=='^' && s[2]=='Q' && s[3]=='='){\n int i;\n for(i = 4; s[i]=='Q' && s[i+1]=='='; i+=2);\n if((int)s.size() == i+2 && s[i]=='~' && s[i+1]=='~'){\n\t cout << 'B' << endl;\n\t f = false;\n }\n }\n if(f){\n cout << \"NA\" << endl;\n }\n }\n}", "#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <string>\n#include <cmath>\n#include <stack>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <list>\n#include <iostream>\n#include <sstream>\n#include <climits>\n#include <cfloat>\n#include <complex>\n\n\ntypedef long long ll;\nconst double Eps = 1e-6;\n\nusing namespace std;\n\nint main()\n{\n\tchar buf[256];\n\tint n;\n\tscanf(\"%d\\n\", &n);\n\twhile (n--)\n\t{\n\t\tcin.getline(buf, sizeof(buf));\n\t\tstring s(buf);\n\t\tbool ok = false;\n\t\tfor (int i = 1; i < 100; ++i)\n\t\t{\n\t\t\tstring a = \">'\";\n\t\t\tfor (int j = 0; j < i; ++j)\n\t\t\t\ta += \"=\";\n\t\t\ta += \"#\";\n\t\t\tfor (int j = 0; j < i; ++j)\n\t\t\t\ta += \"=\";\n\t\t\ta += \"~\";\n\t\t\tif (s == a)\n\t\t\t{\n\t\t\t\tputs(\"A\");\n\t\t\t\tok = true;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tstring b = \">^\";\n\t\t\tfor (int j = 0; j < i; ++j)\n\t\t\t\tb += \"Q=\";\n\t\t\tb += \"~~\";\n\t\t\tif (s == b)\n\t\t\t{\n\t\t\t\tputs(\"B\");\n\t\t\t\tok = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!ok)\n\t\t\tputs(\"NA\");\n\t}\n\n\treturn 0;\n}", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint main(){\n int N;\n cin>>N;\n while(N--){\n string str;\n cin>>str;\n int len=str.size();\n int ans=-1;\n if(str[0]=='>'&&str[1]=='\\''){\n int pos=2;\n int cnt=0;\n int turn=0;\n int flag=0;\n do{\n if(str[pos]=='=')\n cnt+=(turn)?(-1):(1);\n else if(str[pos]=='#')turn=1;\n else flag=0;\n if(pos==2&&cnt>0)flag=1;\n pos++;\n }while(pos<len-1);\n if(cnt==0&&flag&&str[pos]=='~')ans=0;\n }\n else if(str[0]=='>'&&str[1]=='^'){\n int pos=2;\n int flag=1;\n do{\n if(str[pos]!='Q'||str[pos+1]!='='){\n flag=0;\n break;\n }\n pos+=2;\n }while(pos<len-2);\n if(flag&&str[pos]=='~'&&str[pos+1]=='~')ans=1;\n }\n if(ans==0)cout<<\"A\"<<endl;\n else if(ans==1)cout<<\"B\"<<endl;\n else cout<<\"NA\"<<endl;\n }\n return 0;\n}", "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <unordered_set>\n#include <unordered_map>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <queue>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <fstream>\n#include <cstdio>\n#include <climits>\n#include <complex>\n#include <cstdint>\n#include <tuple>\n\n#define M_PI 3.14159265358979323846\n\nusing namespace std;\n\n//conversion\n//------------------------------------------\ninline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }\ntemplate<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }\ninline int readInt() { int x; scanf(\"%d\", &x); return x; }\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\n\nstruct Edge {\n int to, cost, nm;\n Edge(int to, int cost, int nm): to(to), cost(cost), nm(nm) {}\n};\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<vector<Edge>> AdjList;\nAdjList graph;\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nconst int INF = 100000000;\n\nll GCD(ll a, ll b){\n if(a < b) swap(a, b);\n if(b == 0) return a;\n return GCD(b, a%b);\n}\n\nbool cmp(const pii& a, const pii& b){\n if(a.first == b.first){\n return a.second < b.second;\n }\n return a.first < b.first;\n}\n\nint main() {\n\n //cout << fixed << setprecision(2);\n\n int n;\n cin >> n;\n for(int i=0; i<n; ++i){\n string s; cin >> s;\n int n = s.size();\n\n if(n>2 && s[0] == '>' && s[1] =='\\''){\n\n if(s[n-1] != '~'){\n cout << \"NA\" << endl;\n }else{\n int l = 2, r = n-2;\n bool ok = true;\n int stmt = 0;\n int cnt1=0, cnt2=0;\n for(int j=l; j<=r; ++j){\n if(s[j] == '#') stmt++;\n else if(s[j]=='='){\n if(stmt == 0) cnt1++;\n else if(stmt == 1) cnt2++;\n else ok = false;\n }else ok = false;\n }\n if(ok){\n if(cnt1 >= 1 && (cnt1 == cnt2)){\n cout << \"A\" << endl;\n }else{\n cout << \"NA\" << endl;\n }\n }else{\n cout << \"NA\" << endl;\n }\n }\n }else if(n > 2 && s[0] == '>' && s[1] == '^'){\n if(s[n-2] == '~' && s[n-1] == '~'){\n if(n%2 == 1){\n cout << \"NA\" << endl;\n }else {\n bool ok = true;\n int cnt = 0;\n for (int j = 2; j <= n - 3; j+=2) {\n if(s[j] == 'Q' && s[j+1] == '='){\n cnt++;\n }else{\n ok = false;\n }\n }\n if(cnt>=1 && ok){\n cout << \"B\" << endl;\n }else{\n cout << \"NA\" << endl;\n }\n }\n }else{\n cout << \"NA\" << endl;\n }\n }else{\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}\n", "#include<string>\n#include<iostream>\n\nusing namespace std;\n\nbool isA(string s)\n{\n\tint len=s.length();\n\tif(len<6)\t\t\t\t\treturn false;\n\tif(s.substr(0,2)!=\">'\")\t\treturn false;\n\tif(s.substr(len-1)!=\"~\")\treturn false;\n\n\ts=s.substr(2,len-3);\n\tlen=s.length();\n\tif(len%2==0)\t\treturn false;\n\tif(s[len/2]!='#')\treturn false;\n\tif(s.substr(0,len/2)!=string(len/2,'='))\treturn false;\n\tif(s.substr(len/2+1)!=string(len/2,'='))\treturn false;\n\treturn true;\n}\n\nbool isB(string s)\n{\n\tint len=s.length();\n\tif(len<6)\t\t\t\t\treturn false;\n\tif(s.substr(0,2)!=\">^\")\t\treturn false;\n\tif(s.substr(len-2)!=\"~~\")\treturn false;\n\n\ts=s.substr(2,len-4);\n\tlen=s.length();\n\tif(len%2==1)\treturn false;\n\tbool b=true;\n\tfor(int i=0;i<len;i+=2){\n\t\tif(s[i+0]!='Q')\tb=false;\n\t\tif(s[i+1]!='=')\tb=false;\n\t}\n\treturn b;\n}\n\nint main()\n{\n\tint n;\tcin>>n;\n\tstring snake;\n\twhile(n--){\n\t\tcin>>snake;\n\t\tif (isA(snake))\tcout<<'A'<<endl;\n\t\telse if(isB(snake))\tcout<<'B'<<endl;\n\t\telse\t\t\t\tcout<<\"NA\"<<endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nbool isA(const string &s) {\n if(s.size() < 6) return false;\n if(s.substr(0,2) != \">'\") return false;\n if(*(s.rbegin()) != '~') return false;\n string t = s.substr(2, (int)s.size()-3);\n int m = t.find(\"#\");\n if(m == string::npos) return false;\n if(t.substr(0,m) != string(m, '=')) return false;\n if(t.substr(m+1) != string(m, '=')) return false;\n return true;\n}\n\nbool isB(const string &s) {\n if(s.size() < 6) return false;\n if(s.substr(0,2) != \">^\") return false;\n if(s.substr((int)s.size()-2) != \"~~\") return false;\n string t = s.substr(2, (int)s.size()-4);\n if(t.size()&1) return false;\n for(int i = 0; i < t.size(); i += 2) {\n if(t[i] != 'Q' || t[i+1] != '=') return false;\n }\n return true;\n}\n\nint main() {\n int n;\n cin >> n;\n while(n--) {\n string s;\n cin >> s;\n if(isA(s)) cout << \"A\" << endl;\n else if(isB(s)) cout << \"B\" << endl;\n else cout << \"NA\" << endl;\n }\n return 0;\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\nstring makeSnakeA( int a )\n{\n string s = \">\\'\";\n for( int i = 0; i < a; i++ )\n s += \"=\";\n s += \"#\";\n for( int i = 0; i < a; i++ )\n s += \"=\";\n s += \"~\";\n return s;\n}\n\nstring makeSnakeB( int a )\n{\n string s = \">^\";\n for( int i = 0; i < a; i++ )\n s += \"Q=\";\n s += \"~~\";\n return s;\n}\n\nint main()\n{\n int n;\n string str, s[200], t[200];\n for( int i = 0; i < 200; i++ )\n {\n s[i] = makeSnakeA( i + 1 );\n t[i] = makeSnakeB( i + 1 );\n }\n\n cin >> n;\n\n for( int i = 0; i < n; i++ )\n {\n cin >> str;\n\n int size = str.size();\n\n if( size >= 6 && s[(size-6)/2] == str )\n cout << \"A\" << endl;\n else if( size >= 6 && t[(size-6)/2] == str )\n cout << \"B\" << endl;\n else\n cout << \"NA\" << endl; \n }\n\n return 0;\n}\n", "#include <map>\n#include <set>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <cctype>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <cstdlib>\n#include <cstring>\n#include <sstream>\n#include <iostream>\n#include <algorithm>\n#include <functional>\n\nusing namespace std;\n\n#define fr first\n#define sc second\n#define mp make_pair\n#define foreach(c, it) for(typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)\n\ntypedef pair< int, int > iP;\ntypedef pair< iP, int > iiP;\n\nint main(){\n \n int N;\n cin >> N;\n while(N--) {\n string s; cin >> s;\n if(s[0] != '>') {\n cout << \"NA\" << endl;\n continue;\n }\n int select = 0;\n if(s[1] == '\\'') {\n int cnt = 0;\n if(!(s.size() % 2)) {\n for(int i = 2; i < s.size() / 2; i++) {\n if(s[i] != '=') {\n select = -1;\n break;\n }\n cnt++;\n }\n if(~select && !cnt) {\n cout << \"NA\" << endl;\n continue;\n }\n for(int i = s.size() / 2 + 1; i < s.size() - 1; i++) {\n if(s[i] != '=') {\n select = -1;\n break;\n }\n cnt--;\n }\n } else select = -1;\n if(!cnt && ~select && s[s.size() / 2] == '#' && s[s.size() - 1] == '~')\n cout << \"A\" << endl;\n else cout << \"NA\" << endl; \n } else if(s[1] == '^') {\n if(!(s.size() % 2)) {\n for(int i = 2; i < s.size() - 2; i++) {\n if((!(i % 2) && s[i] != 'Q') || (i % 2 && s[i] != '=')) {\n select = -1;\n break;\n }\n }\n if(s.size() >= 6 && ~select && s[s.size() - 1] == s[s.size() - 2] && s[s.size() - 1] == '~') cout << \"B\" << endl;\n else cout << \"NA\" << endl;\n } else cout << \"NA\" << endl;\n } else {\n cout << \"NA\" << endl;\n }\n }\n}", "#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <sstream>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <numeric>\n#include <cmath>\n#include <climits>\n#include <limits>\n#include <cfloat>\n#include <fstream>\nusing namespace std;\n\nint main()\n{\n//\tcut here before submit \n//\tfreopen (\"testcase.snack\", \"r\", stdin );\n\tconst string species[] = { \"A\", \"B\", \"NA\" };\n\tstring str = \"\";\n\tint n;\n\n\twhile (getline (cin, str ) ){\n\t\tstringstream ssn(str);\n\t\tssn >> n;\n//\t\tcout << \"n: \" << n << endl;\n\t\tif (n == 0 ){\n\t\t\tbreak;\n\t\t} // end if\n\n\t\tint i,j;\n\n\t\tfor (i = 0; i < n; ++i){\n\t\t\tstring res = species[2];\n\t\t\tgetline (cin, str );\n\t\t\t\n\t\t\tif (str.empty() ){\n\t\t\t\tbreak;\n\t\t\t} // end if\n\t\t\tint len = str.length();\n\n\t\t\tif (str[0] == '>'){\n\t\t\t\tif (str[1] == '\\''){\t\t// A species? \n\t\t\t\t\tres = species[0];\n\t\t\t\t}else if (str[1] == '^'){\t// B species?\n\t\t\t\t\tres = species[1];\n\t\t\t\t}else{\t\t\t\t// new species.\n\t\t\t\t\tres = species[2];\n\t\t\t\t} // end if\n\t\t\t} // end if\n\t\t\t\n\t\t\tif (res == species[0] || res == species[1]){\n\t\t\t\tif (res == species[0]){\t// A species?\n\t\t\t\t\tint prev = 0;\n\t\t\t\t\tint after = 0;\n\t\t\t\t\tint mid = 0;\n\t\t\t\t\tbool flag = false;\n\t\t\t\t\tfor (j = 2; j < len - 1; ++j){\n\t\t\t\t\t\tif (str[j] == '='){\n\t\t\t\t\t\t\tif (!flag){\n\t\t\t\t\t\t\t\t++prev;\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t++after;\n\t\t\t\t\t\t\t} // end if\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}else if (str[j] == '#'){\n\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\t++mid;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} // end if\n\t\t\t\t\t} // end for\n\n\t\t\t\t\tif (j == len - 1){\n\t\t\t\t\t\tif (str[j] == '~' && flag && mid == 1\n\t\t\t\t\t\t&& prev != 0 && after != 0 && prev == after ){\n\t\t\t\t\t\t\tres = species[0];\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tres = species[2];\n\t\t\t\t\t\t} // end if\n\t\t\t\t\t}else{\n\t\t\t\t\t\tres = species[2];\n\t\t\t\t\t} // end if\n\t\t\t\t}else{\t// if (res == species[1]) // B species?\n\t\t\t\t\tbool flag = false;\n\t\t\t\t\tfor (j = 2; j < len - 2; j += 2){\n\t\t\t\t\t\tif (str[j] == 'Q' && str[j+1] == '='){\n\t\t\t\t\t\t\tif (!flag ){\n\t\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\t} // end if\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} // end if\n\t\t\t\t\t} // end for\n\t\t\t\t\tif (j == len - 2 && flag && str[j] == '~' && str[j+1] == '~'){\n\t\t\t\t\t\tres = species[1];\n\t\t\t\t\t}else{\n\t\t\t\t\t\tres = species[2];\n\t\t\t\t\t} // end if\n\t\t\t\t} // end if\n\t\t\t} // end if\n\t\t\tcout << res << endl;\n\t\t} // end for\n\t} // end loop\n\t\t\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\nusing namespace std;\nstring judgeSnakeType(string s){\n if(s.find( \">'\") == 0 && s.find(\"~\") == s.size()-1)\n {\n s.erase(s.size()-1,1); s.erase(0,2);\n int cnt = 0;\n if( s.size() == 0 ) return \"NA\";\n while( s.size() > 0 && s[0] == '=' ){\n\tif(s[0] == '='){\n\t s.erase(0,1);\n\t cnt++;\n\t}\n }\n if( s[0] != '#' || cnt == 0)return \"NA\";\n s.erase(0,1);\n while( s.size() > 0 && s[0] == '=' ){\n\tif(s[0] == '='){\n\t s.erase(0,1);\n\t cnt--;\n\t}\n }\n if(s.size() == 0 && cnt == 0) return \"A\";\n else return \"NA\";\n }\n else if( s.find( \">^\") == 0 && s.find(\"~~\") == s.size()-2)\n {\n s.erase(s.size()-2,2); s.erase(0,2);\n if( s.size() == 0 ) return \"NA\";\n while( s.size() > 0 && s.size() % 2 == 0){\n\tif(s[0] == 'Q' && s[1] == '='){\n\t s.erase(0,2);\n\t}\n\telse {\n\t return \"NA\";\n\t}\n }\n return s == \"\" ? \"B\" : \"NA\";\n }\n else\n {\n return \"NA\";\n }\n return \"NA\";\n}\nvoid solve(string snake){\n cout << judgeSnakeType( snake ) << endl;\n}\nint main(){\n int d;\n cin >> d;\n string snake;\n for(int i = 0 ; i < d; i++ )\n {\n cin >> snake;\n solve(snake);\n }\n return 0;\n}", "#include <bits/stdc++.h>\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define RREP(i,n) for(int i=n-1;i>=0;i--)\n\n#define PB push_back\n#define INF INT_MAX/3\n#define ALL(a) (a).begin(),(a).end()\n#define CLR(a) memset(a,0,sizeof(a))\n\ntypedef long long int ll;\n\nusing namespace std;\n\nbool isa(string s){\n if(s.substr(0,2) != \">'\") return false;\n int x = 2;\n int c = 0;\n while(s[x+c] == '='){\n\tc++;\n }\n if(s[x+c] != '#') return false;\n x = x + c + 1;\n for(int i=0;i<c;i++){\n\tif(s[x+i] != '=') return false;\n }\n x += c;\n if(s[x] != '~') return false;\n return true;\n}\n\nbool isb(string s){\n if(s[0] != '>') return false;\n if(s[1] != '^') return false;\n int x = 2;\n int c = 0;\n while(s[x+c] == 'Q' && s[x+1+c] == '='){\n\tc += 2;\n }\n x += c;\n if(s[x] != '~') return false;\n if(s[x+1] != '~') return false;\n return true;\n}\n\nint main(){\n string s = \"\";\n int n;\n cin >> n;\n REP(i,n){\n\tcin >> s;\n\tif(s.size() < 6){\n\t cout << \"NA\" << endl;\n\t continue;\n\t}\n\tif(isa(s)) cout << \"A\"<<endl;\n\telse if(isb(s)) cout << \"B\" << endl;\n\telse cout << \"NA\" << endl;\n }\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n char buf[210];\n int bi,n,eqc,ti;\n\n cin >> n;\n\n for (int i=0;i<n;i++){\n bi=0;\n cin >> buf;\n if (buf[bi++]!='>') {\n cout << \"NA\" << endl;\n continue;\n }\n if (buf[bi]=='\\''){\n bi++;\n eqc=0;\n if (buf[bi]!='='){\n\tcout << \"NA\" << endl;\n\tcontinue;\n }\n while (buf[bi+eqc]=='=')eqc++;\n if (buf[bi+eqc]!='#'){\n\tcout << \"NA\" << endl;\n\tcontinue;\n }\n bi += eqc+1;\n for (ti=0;ti<eqc;ti++)\n\tif (buf[bi+ti]!='=')break;\n if (ti <eqc){\n\tcout << \"NA\" << endl;\n\tcontinue;\n }\n bi+=ti;\n if (buf[bi]=='~'&&buf[bi+1]=='\\0')cout << \"A\" << endl;\n else cout << \"NA\" << endl;\n }else if(buf[bi]=='^'){\n bi++;\n //cout <<\"dbg \"<< buf[bi] << buf[bi+1] << endl;\n if(buf[bi]!='Q'||buf[bi+1]!='='){\n\tcout << \"NA\" << endl;\n\tcontinue;\n }\n bi+=2;\n while (buf[bi]=='Q'&&buf[bi+1]=='=')bi +=2;\n //cout <<\"dbg \"<< buf[bi] << buf[bi+1] << endl;\n if (buf[bi]=='~'&&buf[bi+1]=='~'){\n\tif (buf[bi+2]=='\\0')cout << \"B\" << endl;\n\telse cout << \"NA\" << endl;\n }else cout << \"NA\" << endl;\n }else{\n cout << \"NA\" << endl;\n continue;\n }\n }\n return 0;\n}", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(long long i=(a);i<(b);i++)\n#define REP(i,N) for(long long i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define fi first\n#define se second\n\n#define PI acos(-1.0)\n#define INF 1000000007\n#define MOD 1000000007\n#define EPS 1e-10\n#define MAX_N 100100\n#define MAX_M 100100\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<double, double> PD;\ntypedef pair<string, ll> PS;\ntypedef vector<ll> V;\ntypedef pair<P, char> PC;\ntypedef pair<int, string> PSI;\n\nint n;\nstring s;\nbool F;\n\nint main(){\n\tcin >> n;\n\tREP(i, n){\n\t\tF = 0;\n\t\tcin >> s;\n\t\tif (s[0] == '>'&&s[s.size() - 1] == '~'){\n\t\t\tif (s[1] == '\\''){\n\t\t\t\tint icnt = 0;\n\t\t\t\tbool f = 1;\n\t\t\t\tFOR(j, 2, s.size() - 1){\n\t\t\t\t\tif (s[j] == '='){\n\t\t\t\t\t\tif (f){\n\t\t\t\t\t\t\ticnt++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ticnt--;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (s[j] == '#'){\n\t\t\t\t\t\tif (f)f = 0;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tF = 1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tF = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (F == 0 && icnt == 0 && s.size() >= 6){\n\t\t\t\t\tcout << \"A\" << endl;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (s[1] == '^'&&s.size() % 2 == 0 && s.size() >= 6\n\t\t\t\t&& s[s.size() - 1] == '~'&&s[s.size() - 2] == '~'){\n\t\t\t\tFOR(j, 2, s.size() - 2){\n\t\t\t\t\tif (j % 2 == 0){\n\t\t\t\t\t\tif (s[j] != 'Q'){\n\t\t\t\t\t\t\tF = 1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tif (s[j] != '='){\n\t\t\t\t\t\t\tF = 1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (F){\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tcout << \"B\" << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t}\n\t\t}\n\t\telse{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n}", "#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tstring a;\n\t\tcin >> a;\n\t\tif (a.substr(0, 2) == \">'\") {\n\t\t\tint counter = 0;\n\t\t\tbool hantei = false;\n\t\t\tint i;\n\t\t\tfor (i = 2; i < a.size(); i++) {\n\t\t\t\tif (a[i] == '=') {\n\t\t\t\t\tcounter++;\n\t\t\t\t} else if (a[i] == '#' && counter > 0) {\n\t\t\t\t\thantei = true;\n\t\t\t\t\tbreak;\n\t\t\t\t} else {\n\t\t\t\t\thantei = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hantei) {\n\t\t\t\tint j;\n\t\t\t\tfor (j = i+1; j < a.size(); j++) {\n\t\t\t\t\tif (a[j] == '=') {\n\t\t\t\t\t\tcounter--;\n\t\t\t\t\t} else if (a[j] == '~') {\n\t\t\t\t\t\thantei = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else {\n\t\t\t\t\t\thantei = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (hantei) {\n\t\t\t\t\tif (counter == 0 && j == a.size()-1) {\n\t\t\t\t\t\tcout << 'A' << endl;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t}\n\t\t} else if (a.substr(0, 2) == \">^\") {\n\t\t\tint i;\n\t\t\tbool hantei = false;\n\t\t\tfor (i = 2; i < a.size()-1; i += 2) {\n\t\t\t\tif (a.substr(i, 2) == \"Q=\") {\n\t\t\t\t\thantei = true;\n\t\t\t\t} else if (a.substr(i, 2) == \"~~\" && i == a.size()-2 && hantei) {\n\t\t\t\t\thantei = true;\n\t\t\t\t\tbreak;\n\t\t\t\t} else {\n\t\t\t\t\thantei = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hantei) {\n\t\t\t\tcout << 'B' << endl;\n\t\t\t} else {\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t}\n\t\t}else {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "import re\n\nn = int(input())\nfor i in range(n):\n s = input()\n if re.match(r\">'(=+)#\\1~\", s):\n print('A')\n elif re.match(r\">\\^(Q=)+~~\", s):\n print('B')\n else:\n print('NA')\n\n", "#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\nint main()\n{\n\tbool b;\n\tint n, i, j, t, c[2];\n\tchar s[201];\n\tcin >> n;\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tb = true;\n\t\tcin >> s;\n\t\tif (s[0] == '>')\n\t\t{\n\t\t\tif (s[1] == '\\'')\n\t\t\t{\n\t\t\t\tfor (j = 2, t = c[0] = c[1] = 0; j < strlen(s)-1; j++)\n\t\t\t\t{\n\t\t\t\t\tif (s[j] == '=')\n\t\t\t\t\t\tc[t]++;\n\t\t\t\t\telse if (t == 0 && s[j] == '#')\n\t\t\t\t\t\tt++;\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tb = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (b && c[0] > 0 && c[0] == c[1] && s[strlen(s)-1] == '~')\n\t\t\t\t\tcout << \"A\" << endl;\n\t\t\t\telse\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if (s[1] == '^')\n\t\t\t{\n\t\t\t\tfor (j = 2, c[0] = 0; j < strlen(s)-2; j+=2)\n\t\t\t\t{\n\t\t\t\t\tif (s[j] != 'Q' || s[j+1] != '=')\n\t\t\t\t\t{\n\t\t\t\t\t\tb = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tc[0]++;\n\t\t\t\t}\n\t\t\t\tif (b && c[0] > 0 && s[strlen(s)-2] == '~' && s[strlen(s)-1] == '~')\n\t\t\t\t\tcout << \"B\" << endl;\n\t\t\t\telse\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\t\tb = false;\n\t\t}\n\t\telse\n\t\t\tb = false;\n\t\tif (!b)\n\t\t\tcout << \"NA\" << endl;\n\t}\n}", "for r in range(input()):\n\tsnake=raw_input()\n\tm=(len(snake)-4)/2\n\tif m>0 and snake == \">'\" + \"=\"*m + \"#\" + \"=\"*m + \"~\":\n\t\tprint \"A\"\n\telif m>0 and snake == \">^\" + \"Q=\"*m + \"~~\":\n\t\tprint \"B\"\n\telse:\n\t\tprint \"NA\"", "#include <iostream>\n#include <stdio.h>\n#include <string>\n\nusing namespace std;\n\nint main() {\n\tint n,i,j,s;\n\tstring c1,c2,c3;\n\tcin >> n;\n\tfor (i=0;i<n;i++) {\n\t\tcin >> c1;\n\t\tc2=c3=c1;\n\t\ts=c1.size();\n\t\tif (s<6 || s % 2==1) { cout << \"NA\" << endl; continue; }\n\t\tfor (j=0;j<s;j++) c2[j]=c3[j]='=';\n c2[0]=c3[0]='>'; c2[s-1]=c3[s-1]=c3[s-2]='~';\n\t\tc2[1]='\\''; c2[s/2]='#'; c3[1]='^';\n for (j=2;j<s-2;j+=2) c3[j]='Q';\n\t\tif (c1==c2) cout << 'A'; else if (c1==c3) cout << 'B'; else cout << \"NA\";\n\t\tcout << endl;\n\t}\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nchar buf[1024];\nint M;\nbool checkA(){\n if( buf[0] != '>' ) return false;\n if( buf[1] != '\\'') return false;\n int cnt1=0,cnt2=0;\n bool f = false;\n int i;\n for(i=2;i<M;i++){\n if(!f){\n if( buf[i] == '=' ) cnt1++;\n else if( buf[i] == '#' ) f = true;\n else return false;\n } else {\n if( buf[i] == '=' ) cnt2++;\n else break;\n }\n }\n if( buf[i] != '~' ) return false;\n i++;\n if( i == M && cnt1 == cnt2 && cnt1>0 && f ) return true;\n return false;\n}\n\nbool checkB(){\n if( buf[0] != '>' ) return false;\n if( buf[1] != '^' ) return false;\n int i;\n bool f = false;\n for(i=2;i<M-2;i+=2){\n if( buf[i] != 'Q' ) return false;\n if( buf[i+1] != '=' ) return false;\n f = true;\n }\n if( f && buf[i] == '~' && buf[i+1] == '~' && i + 2 == M ) return true;\n return false;\n}\n\nint main(){\n int n; cin >> n;\n for(int i=0;i<n;i++){\n cin >> buf; M = strlen(buf);\n if( checkA() ) cout << \"A\" << endl;\n else if( checkB() ) cout << \"B\" << endl;\n else cout << \"NA\" << endl;\n }\n}", "#include<iostream>\n#include<string>\nusing namespace std;\nstring S;\nint n;\n\nstring solve(string T) {\n\tint chain = 0, ok = 0;\n\tif (T.size() >= 3) {\n\t\tif (T[T.size() - 1] == '~') {\n\t\t\tif (T.substr(0, 2) == \">'\" && T.size() >= 6) {\n\t\t\t\tfor (int i = 2; i < T.size() - 1; i++) {\n\t\t\t\t\tif (T[i] == '#') {\n\t\t\t\t\t\tok++;\n\t\t\t\t\t}\n\t\t\t\t\telse if (T[i] == '=') {\n\t\t\t\t\t\tif (ok == 0) { chain++; }\n\t\t\t\t\t\telse { chain--; }\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tgoto NA;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (ok == 1 && chain == 0) { return \"A\"; }\n\t\t\t}\n\n\t\t\tif (T.substr(0, 2) == \">^\" && T[T.size() - 2] == '~' && T.size() >= 6) {\n\t\t\t\tfor (int i = 2; i < T.size() - 2; i += 2) {\n\t\t\t\t\tif (T.substr(i, 2) != \"Q=\") {\n\t\t\t\t\t\tgoto E;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn \"B\";\n\t\t\tE:;\n\t\t\t}\n\t\t}\n\t}\nNA:;\n\treturn \"NA\";\n}\n\nint main() {\n\tcin >> n;\n\tfor (int h = 0; h < n; h++) {\n\t\tcin >> S;\n\t\tcout << solve(S) << endl;\n\t}\n}", "for i in [0]*input():\n s=raw_input()\n n=(len(s)-4)/2\n if n>0 and s==\">'\"+\"=\"*n+\"#\"+\"=\"*n+\"~\": t=\"A\"\n elif n>0 and s==\">^\"+\"Q=\"*n+\"~~\": t=\"B\"\n else: t=\"NA\"\n print t", "#include <bits/stdc++.h>\nusing namespace std;\n\nbool isOutOfStr(int ind, string str){\n return ind >= str.length();\n}\n\nint main(void){\n int n;\n cin >> n;\n while(n--){\n string str; cin >> str;\n if(!isOutOfStr(1, str) &&str[0] == '>' && str[1] == '\\''){\n int sharp_cnt = 0;\n int ind;\n ind = 2;\n\n if(isOutOfStr(ind, str) || str[ind] != '='){\n cout << \"NA\" << endl;\n continue;\n }\n\n for(;;ind++){\n if(isOutOfStr(ind, str) || str[ind] != '='){\n break;\n }\n sharp_cnt++;\n }\n\n if(isOutOfStr(ind, str) || str[ind] != '#'){\n cout << \"NA\" << endl;\n continue;\n }\n ind++;\n\n bool flg = true;\n for(int i=0; i < sharp_cnt; i++, ind++){\n if(isOutOfStr(ind, str) || str[ind] != '='){\n cout << \"NA\" << endl;\n flg = false;\n break;\n }\n }\n if(!flg) continue;\n\n if(!isOutOfStr(ind, str) && str[ind] == '~' && ind == str.length() - 1)\n cout << \"A\" << endl;\n else{\n cout << \"NA\" << endl;\n }\n\n\n\n }else if(str[0] == '>' && str[1] == '^'){\n int ind;\n ind=2;\n\n if(isOutOfStr(ind, str) || !(str[ind] == 'Q' && str[ind+1] == '=')){\n cout << \"NA\" << endl;\n }else{\n int flg = true;\n for(;;ind+=2){\n if(isOutOfStr(ind, str) || !(str[ind] == 'Q' && str[ind+1] == '=')){\n break;\n }\n }\n\n if(!isOutOfStr(ind, str) && !isOutOfStr(ind+1, str) && str[ind] == '~' && str[ind+1] == '~' && ind+1 == str.length() - 1){\n cout << \"B\" << endl;\n }else{\n cout << \"NA\" << endl;\n }\n }\n }else{\n cout << \"NA\" << endl;\n }\n }\n return 0;\n}", "class Ex(Exception):\n pass\nn=int(input())\nfor i in range(n):\n try:\n snk=input()\n l=len(snk)\n head=snk[:2]\n body=snk[2:l-1]\n tail=snk[l-1]\n if tail!='~' or snk[0]!='>':\n print(\"NA\")\n continue\n spl_a=body.split('#')\n if len(spl_a)==2 and spl_a[0]==spl_a[1] and len(spl_a[0])!=0:\n for char in spl_a[0]:\n if char!='=':\n print(\"NA\")\n raise Ex()\n if head[1]=='\\'':\n print('A')\n raise Ex()\n else:\n print(\"NA\")\n raise Ex()\n bars=body.split('=')\n if len(bars)==1:\n print(\"NA\")\n continue\n for j in range(len(bars)-1):\n if bars[j]!='Q':\n print(\"NA\")\n raise Ex()\n if head[1]=='^'and bars[len(bars)-1]=='~':print('B')\n else:print(\"NA\")\n except Ex:pass ", "\n#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n int f,i,m;\n string s;\n for(cin>>f;cin>>s;f?puts(f-2?\"A\":\"B\"):puts(\"NA\")){\n f=0;\n if(s[0]+s[1]==101){\n if((m=s.find(35))!=string::npos)\n\tfor(i=1;s[m-i]==s[m+i];)\n\t if(m-++i==1 && m+i==s.size()-1 && s[m+i]=='~')f=1;\n }else if(s[0]+s[1]==156){\n for(i=2;s[i]=='Q'&&s[i+1]=='=';)\n\tif(++++i==s.size()-2 && s[i]+s[i+1]==252)f=2;\n }\n }\n}", "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args){\n new Main().run();\n }\n\tpublic void run(){\n\t\tScanner scan = new Scanner(System.in);\n\t\twhile(scan.hasNext()){\n\t\t\tint n = scan.nextInt();\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tString snake = scan.next();\n\t\t\t\tif(snake.substring(0,2).equals(\">'\") && snake.indexOf(\"#\") >= 2 && snake.charAt(snake.length()-1) == '~'\n\t\t\t\t\t\t&& snake.indexOf('=') >= 2){\n\t\t\t\t\tint eqC = 0;\n\t\t\t\t\tint sh = 0;\n\t\t\t\t\tboolean fl = true;\n\t\t\t\t\tfor(int j = 2;j < snake.length()-1;j++){\n\t\t\t\t\t\tif(snake.charAt(j) == '=' && sh == 0){\n\t\t\t\t\t\t\teqC++;\n\t\t\t\t\t\t}else if(snake.charAt(j) == '='){\n\t\t\t\t\t\t\teqC--;\n\t\t\t\t\t\t}else if(snake.charAt(j) == '#' && sh == 0){\n\t\t\t\t\t\t\tsh = 1;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tfl = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(fl && eqC == 0){\n\t\t\t\t\t\tSystem.out.println(\"A\");\n\t\t\t\t\t}else{\n\t\t\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t\t\t}\n\t\t\t\t}else if(snake.substring(0,2).equals(\">^\") && snake.indexOf(\"Q=\") > 1){\n\t\t\t\t\tsnake = snake.replaceAll(\"Q=\",\"\");\n\t\t\t\t\tif(snake.equals(\">^~~\")){\n\t\t\t\t\t\tSystem.out.println(\"B\");\n\t\t\t\t\t}else{\n\t\t\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}", "#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <complex>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define eps 1e-9\n#define INF 2000000000\n#define sz(x) ((int)(x).size())\n#define fi first\n#define sec second\n#define SORT(x) sort((x).begin(),(x).end())\n#define all(x) (x).begin(),(x).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tstring s;\n\t\tcin >> s;\n\t\tint sz=s.size();\n\t\tif(s[0]!='>'||sz<6)\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tif(s[1]=='\\'')\n\t\t{\n\t\t\tint t=sz-3;\n\t\t\tif(t%2==0)\n\t\t\t{\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j=2;j<2+t;j++)\n\t\t\t{\n\t\t\t\tif(j==2+t/2&&s[j]!='#')\n\t\t\t\t{\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\tgoto end;\n\t\t\t\t}\n\t\t\t\telse if(j!=2+t/2&&s[j]!='=')\n\t\t\t\t{\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\tgoto end;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(s[sz-1]!='~')\n\t\t\t{\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tcout << \"A\" << endl;\n\t\t\tend:;\n\t\t}\n\t\telse if(s[1]=='^')\n\t\t{\n\t\t\tint t=sz-4;\n\t\t\tif(t%2==1)\n\t\t\t{\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(int j=0;j<t;j++)\n\t\t\t{\n\t\t\t\tif(j%2==0&&s[j+2]!='Q')\n\t\t\t\t{\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\tgoto end2;\n\t\t\t\t}\n\t\t\t\telse if(j%2==1&&s[j+2]!='=')\n\t\t\t\t{\n\t\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\t\tgoto end2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(s[sz-1]!='~'||s[sz-2]!='~')\n\t\t\t{\n \n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tcout << \"B\" << endl;\n\t\t\tend2:;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<queue>\n#include<set>\n#include<functional>\n#include<map>\nusing namespace std;\n\nint main() {\n\tint a;\n\tcin >> a;\n\tfor (int b = 0; b < a; b++) {\n\t\tstring c; cin >> c;\n\t\tif ((c.length() & 1)==0&&c.length()>=6) {\n\t\t\tif (c[0] == '>'&&c[1] == '^'&&c[c.length() - 1] == '~'&&c[c.length() - 2] == '~') {\n\t\t\t\tbool e = true;\n\t\t\t\tfor (int d = 2; d < c.length() - 2; d += 2) {\n\t\t\t\t\tif (c[d] != 'Q' || c[d + 1] != '=')e = false;\n\t\t\t\t}\n\t\t\t\tif (e) {\n\t\t\t\t\tputs(\"B\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (c[0] == '>'&&c[1] == '\\''&&c[c.length() - 1] == '~') {\n\t\t\t\tbool k = true;\n\t\t\t\tfor (int j = 2; j < c.length() - 1; j++) {\n\t\t\t\t\tif (j == c.length() / 2) {\n\t\t\t\t\t\tif (c[j] != '#')k = false;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tif (c[j] != '=')k = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (k) { puts(\"A\"); continue; }\n\t\t\t}\n\t\t}\n\t\tputs(\"NA\");\n\t}\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,n) FOR(i,0,n)\n\nint main() {\n\tint N;\n\tcin >> N;\n\tREP(n, N) {\n\t\tstring str;\n\t\tint type = 0, pos = 0;\n\t\tcin >> str;\n\t\t\n\t\tif (str[pos] == '>') {\n\t\t\tpos++;\n\t\t\tif (str[pos] == '\\'') {\n\t\t\t\tpos++;\n\t\t\t\tint cnt = 0;\n\t\t\t\twhile (pos < str.size() && str[pos] == '=') { cnt++; pos++; }\n\t\t\t\t\n\t\t\t\tif (cnt != 0 && str[pos] == '#') {\n\t\t\t\t\tpos++;\n\t\t\t\t\twhile (pos < str.size() && str[pos] == '=') { cnt--; pos++; }\n\t\t\t\t\tif (cnt == 0 && str[pos] == '~') type = 1;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse if (str[pos] == '^') {\n\t\t\t\tbool f = false;\n\t\t\t\tpos++;\n\t\t\t\twhile (pos + 1 < str.size()) {\n\t\t\t\t\tif (str[pos] == 'Q' && str[pos + 1] == '=') { pos += 2; f = true; }\n\t\t\t\t\telse break;\n\t\t\t\t}\n\t\t\t\tif (f && pos + 2 == str.size() && str[pos] == '~' && str[pos + 1] == '~')\n\t\t\t\t\ttype = 2;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tswitch (type) {\n\t\tcase 0: cout << \"NA\" << endl; break;\n\t\tcase 1: cout << \"A\" << endl; break;\n\t\tcase 2: cout << \"B\" << endl; break;\n\t\t}\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#include <regex>\n\nusing namespace std;\n\nstring Sample;\n\n//const regex REA(\"^>'(=+)#\\1~$\"), REB(\"^>\\\\^(Q=)+~~$\");\nconst regex REA(\"^>'(=+)#(=+)~$\"), REB(\"^>\\\\^(Q=)+~~$\");\n\nint main() {\n\tint n;\n\tsmatch smStr;\n\n\tcin >> n;\n\twhile (n--) {\n\t\tcin >> Sample;\n\t\t//cout << Sample << endl;\n\t\tif (regex_match(Sample, smStr, REA)) {\n\t\t\tif (smStr[1].length() == smStr[2].length()) {\n\t\t\t\tcout << \"A\" << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t}\n\t\t}\n\t\telse if (regex_match(Sample, REB)) {\n\t\t\tcout << \"B\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n", "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n\nusing namespace std;\ntypedef long long LL;\ntypedef pair<int, int> PII;\ntypedef complex<double> P;\nstatic const double EPS = 1e-8;\n\n#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n\nint main(void){\n int n;\n cin>>n;\n while(n--){\n string snake;\n cin>>snake;\n if(snake[0]=='>'&&snake[1]=='\\''&&snake[snake.size()-1]=='~'){\n int count=0;\n int end;\n for(int i=2;i<snake.size()&&snake[i]=='='; i++){\n count++;\n end = i;\n }\n end++;\n if(count&&snake[end]=='#'&&end+count+2==snake.size()){\n bool yes = true;\n for(int i=end+1;i<snake.size()-1;i++){\n if(snake[i]!='=')yes = false;\n }\n if(yes){\n cout<<\"A\"<<endl;\n }else{\n cout<<\"NA\"<<endl;\n }\n }else{\n cout<<\"NA\"<<endl;\n }\n }else if(snake[0]=='>'&&snake[1]=='^'&&snake[snake.size()-1]=='~'&&snake[snake.size()-2]=='~'\n &&snake[snake.size()-3]=='='){\n bool yes = true;\n for(int i=2;i<snake.size()-2;i++){\n if(i%2==0&&snake[i]!='Q') yes = false;\n if(i%2==1&&snake[i]!='=') yes = false;\n }\n if(yes){\n cout<<\"B\"<<endl;\n }else{\n cout<<\"NA\"<<endl;\n }\n }else{\n cout<<\"NA\"<<endl;\n }\n }\n return 0;\n}", "#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nint main()\n{\n int n;\n cin >> n;\n\n while(--n >= 0){\n string s;\n cin >> s;\n int n = s.size();\n if(n < 6 || n % 2 == 1){\n cout << \"NA\" << endl;\n continue;\n }\n\n string sa(n, '=');\n sa[0] = '>';\n sa[1] = '\\'';\n sa[n/2] = '#';\n sa[n-1] = '~';\n if(s == sa){\n cout << 'A' << endl;\n continue;\n }\n\n string sb(n, '=');\n sb[0] = '>';\n sb[1] = '^';\n for(int i=2; i<n-2; i+=2)\n sb[i] = 'Q';\n sb[n-2] = '~';\n sb[n-1] = '~';\n if(s == sb)\n cout << 'B' << endl;\n else\n cout << \"NA\" << endl;\n }\n\n return 0;\n}", "for _ in [0]*int(input()):\n s=input()\n a='NA'\n if s[:2]==\">'\" and s[-1]=='~' and '#' in s:\n s=s[2:-1].split('#')\n a=[a,'A'][set(s[0])==set(s[1])=={'='} and len(set(s))==1]\n elif s[:2]=='>^' and s[-2:]=='~~':\n s=s[2:-2]\n a=['NA','B'][len(s)==2*s.count('Q=') and len(s)>0]\n print(a)", "#include <iostream>\n\nint main()\n{\n\tstd::string sn;\tgetline(std::cin, sn);\n\tint n = std::stoi(sn);\n\tfor (int i=0; i<n; i++) {\n\t\tstd::string snake; \n\t\tgetline(std::cin, snake);\n\t\tint state = 0;\n\t\tint equal_count = 0;\n\t\tfor (int k=0; k<snake.length(); k++) {\n\t\t\tchar c = snake[k];\n\t\t\tswitch (state) {\n\t\t\tcase 0:\n\t\t\t\tif (c == '>') state = 1;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tif (c == '\\'') state = 10;\n\t\t\t\telse if (c == '^') state = 11;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tif (c == '=') equal_count++;\n\t\t\t\telse if (c == '#') state = 3;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tif (c == '=') {\n\t\t\t\t\tequal_count--;\n\t\t\t\t\tif (equal_count < 0) state = 9;\n\t\t\t\t}\n\t\t\t\telse if (equal_count == 0 && c == '~') state = 4;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tstate = 9;\n\t\t\t\tbreak;\n\t\t\tcase 5:\n\t\t\t\tif (c == 'Q') state = 6;\n\t\t\t\telse if (c == '~') state = 7;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 6:\n\t\t\t\tif (c == '=') state = 5;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 7:\n\t\t\t\tif (c == '~') state = 8;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 8:\n\t\t\t\tstate = 9;\n\t\t\t\tbreak;\n\t\t\tcase 10:\n\t\t\t\tif (c == '=') {\n\t\t\t\t\tequal_count++; state = 2;\n\t\t\t\t}\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 11:\n\t\t\t\tif (c == 'Q') state = 12;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\tcase 12:\n\t\t\t\tif (c == '=') state = 5;\n\t\t\t\telse state = 9;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (state == 4) std::cout << \"A\" << std::endl;\n\t\telse if (state == 8) std::cout << \"B\" << std::endl;\n\t\telse std::cout << \"NA\" << std::endl;\n\t}\n\t\n\treturn 0;\n}\n\n\n", "#include <iostream>\n#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <complex>\n#include <cstdio>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint n;\nstring s;\n\nint main(){\n\tcin>>n;\n\twhile(cin>>s){\n\t\tif(s.size()<6||s[0]!='>'){cout<<\"NA\"<<endl;continue;}\n\t\tint cur=2,l=0,l2=0,f=0,f2=0;\n\t\tif(s[1]=='\\''){\n\t\t\twhile(cur<s.size()){\n\t\t\t\tif(f2){f2=0;break;}\n\t\t\t\telse if(s[cur]=='='){\n\t\t\t\t\tif(!f)l++;\n\t\t\t\t\telse l2++;\n\t\t\t\t}\n\t\t\t\telse if(s[cur]=='#'){\n\t\t\t\t\tif(!l||f)break;\n\t\t\t\t\telse f=1;\n\t\t\t\t}\n\t\t\t\telse if(s[cur]=='~'){\n\t\t\t\t\tif(l&&l==l2){f2=1;}\n\t\t\t\t\telse break;\n\t\t\t\t}\n\t\t\t\telse break;\n\t\t\t\tcur++;\n\t\t\t}\n\t\t}\n\t\telse if(s[1]=='^'){\n\t\t\twhile(cur<s.size()){\n\t\t\t\tif(f2){f2=0;break;}\n\t\t\t\tif(s[cur]=='Q'){\n\t\t\t\t\tif(!f)f=1;\n\t\t\t\t\telse break;\n\t\t\t\t}\n\t\t\t\telse if(s[cur]=='='){\n\t\t\t\t\tif(f==1)f=0;\n\t\t\t\t\telse break;\n\t\t\t\t}\n\t\t\t\telse if(s[cur]=='~'){\n\t\t\t\t\tif(!f)f=2;\n\t\t\t\t\telse if(f==2)f2=2;\n\t\t\t\t\telse break;\n\t\t\t\t}\n\t\t\t\telse break;\n\t\t\t\tcur++;\n\t\t\t}\n\t\t}\n\t\tif(f2==1)cout<<\"A\"<<endl;\n\t\telse if(f2==2)cout<<\"B\"<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t}\n}", "#include<cstdio>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\n int N;\n cin>>N;\n for(int i=0;i<N;i++){\n string sn;\n cin>>sn;\n int type=0;\n if(sn[0]=='>'&&sn[1]==39)type=1;\n if(sn[0]=='>'&&sn[1]=='^')type=2;\n int flg=1;\n if(type==1){\n int cou=0;\n int aftercou=0;\n int p;\n for(int j=2;j<sn.size();j++){\n if(sn[j]=='=')cou++;\n else if(sn[j]=='#'){\n p=j;\n break;\n }\n else{\n flg=0;\n goto syutu;\n }\n }\n for(int k=p+1;k<sn.size();k++){\n if(sn[k]=='=')aftercou++;\n else if(sn[k]=='~'&&k==sn.size()-1){\n if(cou!=aftercou)flg=0;\n goto syutu;\n }\n else{\n flg=0;\n goto syutu;\n }\n }\n if(sn[sn.size()-1]!='~')flg=0;\nsyutu:\n if(flg&&cou)puts(\"A\");\n else puts(\"NA\");\n }\n else if(type==2){\n for(int j=2;j<sn.size()-1;j+=2){\n if(sn[j]=='~'&&sn[j+1]=='~'&&j!=2)break;\n if(!(sn[j]=='Q'&&sn[j+1]=='='))flg=0;\n }\n if(sn[sn.size()-2]!='~'||sn[sn.size()-1]!='~')flg=0;\n if(flg)puts(\"B\");\n else puts(\"NA\");\n }\n else puts(\"NA\");\n }\n return 0;\n}", "import re\nA = \">'=+#=+~$\"\nB = \">\\^(Q=)+~~$\"\nn = int(input())\nfor i in range(n):\n s = input()\n if re.match(A,s):\n a, b = re.match(A,s).group().split(\"#\")\n print(\"A\" if a.count(\"=\") == b.count(\"=\") else \"NA\")\n elif re.match(B,s):\n print(\"B\") \n else:\n print(\"NA\")\n", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\n\nint main(){\n\n\tint n,length,second_length;\n\tchar snake[201];\n\n\tscanf(\"%d\",&n);\n\n\tfor(int i=0; i < n; i++){\n\t\tscanf(\"%s\",snake);\n\n\t\tif(snake[1] == '\\0'){\n\t\t\tprintf(\"NA\\n\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(snake[0] == '>' && snake[1] == '\\''){\n\t\t\tif(snake[2] != '='){\n\t\t\t\tprintf(\"NA\\n\");\n\t\t\t}else{\n\t\t\t\tfor(length = 0;snake[length+2] != '\\0' && snake[length+2] == '='; length++);\n\n\t\t\t\tif(snake[length+2] != '#'){\n\t\t\t\t\tprintf(\"NA\\n\");\n\t\t\t\t}else{\n\t\t\t\t\tfor(second_length = 0; snake[length+3+second_length] != '\\0' &&\n\t\t\t\t\t\t\t\tsnake[length+3+second_length] == '=';second_length++);\n\n\t\t\t\t\tif(length != second_length || snake[length+3+second_length] != '~'){\n\t\t\t\t\t\tprintf(\"NA\\n\");\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif(snake[length+4+second_length] == '\\0'){\n\t\t\t\t\t\t\tprintf(\"A\\n\");\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tprintf(\"NA\\n\");\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}else if(snake[0] == '>' && snake[1] == '^'){\n\t\t\tif(snake[2] != 'Q' || snake[3] != '='){\n\t\t\t\tprintf(\"NA\\n\");\n\t\t\t}else{\n\t\t\t\tbool breakFLG = false;\n\t\t\t\tfor(length=0;snake[length+2] != '\\0' && (snake[length+2] == 'Q' || snake[length+2] == '=');length++){\n\t\t\t\t\tif(length > 1){\n\t\t\t\t\t\tif(snake[length+2] == 'Q' && snake[length+2-1] != '='){\n\t\t\t\t\t\t\tbreakFLG = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(snake[length+2] == '=' && snake[length+2-1] != 'Q'){\n\t\t\t\t\t\t\tbreakFLG = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(breakFLG)printf(\"NA\\n\");\n\t\t\t\telse{\n\t\t\t\t\tif(snake[length+2-1] == 'Q'|| snake[length+2] != '~'){\n\t\t\t\t\t\tprintf(\"NA\\n\");\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif(snake[length+3] != '~'){\n\t\t\t\t\t\t\tprintf(\"NA\\n\");\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tif(snake[length+4] == '\\0'){\n\t\t\t\t\t\t\t\tprintf(\"B\\n\");\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tprintf(\"NA\\n\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tprintf(\"NA\\n\");\n\t\t}\n\n\n\t}\n\n return 0;\n}", "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint main(){\n int n;\n cin>>n;\n while(n--){\n string s;\n cin>>s;\n if(s[0]=='>'){\n if(s[1]=='\\''){\n int sum=0;\n if(s.size()<6)goto L;\n r(i,s.size())if(s[i]=='=')sum++;\n if(s.size()%2==0&&s[s.size()/2]=='#'&&sum==s.size()-4&&s[s.size()-1]=='~')\n cout<<'A'<<endl;\n else goto L;\n }\n else if(s[1]=='^'){\n int c=2;\n if(s.size()%2||s.size()<6)goto L;\n while(c<s.size()-3){\n if(s[c]!='Q')goto L;\n c++;\n if(s[c]!='=')goto L;\n c++;\n }\n if(s[c]=='~'&&s[c+1]=='~')cout<<'B'<<endl;\n else goto L;\n }\n else goto L;\n }\n else goto L;\n if(0)L:cout<<\"NA\"<<endl;\n }\n}", "class Main{\n public static void main(String[]z){\n Scanner x=new Scanner(System.in);\n String s=x.nextLine();\n while(x.hasNext()){\n s=x.nextLine();\n if(s.matches(\">'(=+)#\\\\1~\"))System.out.println(\"A\");\n else if(s.matches(\">\\\\^(Q=)+~~\"))System.out.println(\"B\");\n else System.out.println(\"NA\");\n }\n }\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nstatic inline int in(){ int x; scanf(\"%d\", &x); return x; }\n\nint main()\n{\n int n = in();\n int am[12][256] = {};\n am[1]['>'] = 2;\n am[2]['\\''] = 3;\n am[3]['='] = 4;\n am[4]['='] = 4;\n am[4]['#'] = 5;\n am[5]['='] = 5;\n am[5]['~'] = 6;\n am[2]['^'] = 7;\n am[7]['Q'] = 8;\n am[8]['='] = 9;\n am[9]['Q'] = 8;\n am[9]['~'] = 10;\n am[10]['~'] = 11;\n const int typeA = 6;\n const int typeB = 11;\n\n for (int i = 0; i < n; i++){\n string snake;\n cin >> snake;\n int aid = 1;\n int c4, c5;\n c4 = c5 = 0;\n for (int j = 0; j < snake.size(); j++){\n aid = am[aid][snake[j]];\n if (aid == 4) c4++;\n if (aid == 5) c5++;\n }\n if (aid == typeA && c4 == c5 - 1){\n puts(\"A\");\n }\n else if (aid == typeB){\n puts(\"B\");\n }\n else {\n puts(\"NA\");\n }\n }\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n while (n-- > 0) {\n String snake = sc.next();\n if (snake.indexOf('#') > 0 && snake.length() > 4 && snake.charAt(0) == '>' && snake.charAt(1) == '\\'' && snake.charAt(snake.length() - 1) == '~') {\n int count = 0;\n for (int i = 2, j = snake.length() / 2 + 1; i < snake.length() / 2; i++, j++) {\n if (snake.charAt(i) == '=' && snake.charAt(j) == '=') {\n count += 2;\n }\n }\n if (count == snake.length() - 4) {\n System.out.println(\"A\");\n } else {\n System.out.println(\"NA\");\n }\n } else if (snake.charAt(0) == '>' && snake.length() > 4 && snake.charAt(1) == '^' && snake.charAt(snake.length() - 2) == '~' && snake.charAt(snake.length() - 1) == '~' && snake.replaceAll(\"Q=\", \"\").equals(\">^~~\")) {\n System.out.println(\"B\");\n } else {\n System.out.println(\"NA\");\n }\n }\n }\n}\n\n", "#include <cstdio>\n#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(){\n int i,j,n,a;\n string str,ans;\n cin >> n;\n for(i=0;i<n;i++){ \n cin >> str;\n ans = \"NA\";\n\n if(str[0] == '>'){\n if(str[1] == '\\''){\n\ta = 2;\n\tint c=0,c2=0;\n\tif(str[a] == '='){\n\t while(str[a] == '='){\n\t a++;\n\t c++;\n\t }\n\t if(str[a] == '#'){\n\t a++;\n\t if(str[a] == '='){\n\t while(str[a] == '='){\n\t\tc2++;\n\t\ta++;\n\t }\n\t if(str[a] == '~' && a + 1 == str.size() && c == c2) ans = \"A\";\n\t }\n\t }\n\t}\n }\n else if(str[1] == '^'){\n\ta = 2;\n\tif(str[a] == 'Q' && str[a+1] == '='){\n\t while(str[a] == 'Q' && str[a+1] == '=') a += 2;\n\t if(str[a] == '~' && str[a+1] == '~' && a + 2 == str.size()) ans = \"B\";\n\t}\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nint n;\n\nint main()\n{\n cin >> n;\n\n for (int i = 0; i < n; i++) {\n string s, t, w;\n\n cin >> s;\n t = \"NA\";\n\n int m = s.size();\n\n if (m > 4 && m % 2 == 0) {\n string u(m - 4, '=');\n u.insert(u.begin() + m / 2 - 2, '#');\n if (s == \">'\" + u + '~')\n t = \"A\";\n\n for (int j = 0; j < (m / 2 - 2); j++)\n w += \"Q=\";\n\n if (s == \">^\" + w + \"~~\")\n t = \"B\"; \n }\n\n cout << t << endl;\n }\n\n return 0;\n}\n\n", "#include <vector>\n#include <algorithm>\n#include <string>\n#include <map>\n#include <set>\n#include <queue>\n#include <cstring>\n#include <deque>\n#include <cstdio>\n#include <cmath>\n\nusing namespace std;\n\n#define reep(i,f,t) for(int i=f ; i<int(t) ; ++i)\n#define rep(i,n) reep(i, 0, n) \n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\n\nbool isA(const char* str)\n{\n\tint n = strlen(str);\n\tif(n<6) return false;\n\tif(str[0]!='>' || str[1]!='\\'') return false;\n\t\n\tint cnt, i;\n\tfor(cnt=0, i=2; i<n && str[i]=='='; ++cnt, ++i);\n\tif(cnt==0 || i>=n || str[i] != '#') return false;\n\t++i;\n\t\n\tint s;\n\tfor(s=0; i<n && str[i]=='='; ++s, ++i);\n\tif(cnt!=s || i+1!=n) return false;\n\t\n\treturn str[i] == '~';\n}\n\nbool isB(const char* str)\n{\n\tint n = strlen(str);\n\tif(n<6) return false;\n\tif(str[0]!='>' || str[1]!='^') return false;\n\t\n\tint i;\n\tfor(i=2; i+1<n && str[i]=='Q' && str[i+1]=='='; i+=2);\n\tif(i==2 || i+2!=n) return false;\n\t\n\treturn str[i]=='~' && str[i+1] == '~';\n}\n\nint main()\n{\n\tint n;\n\tscanf(\"%d\", &n);\n\trep(i, n){\n\t\tchar str[256];\n\t\tscanf(\"%s\", str);\n\t\tif(isA(str))\n\t\t\tputs(\"A\");\n\t\telse if(isB(str))\n\t\t\tputs(\"B\");\n\t\telse\n\t\t\tputs(\"NA\");\n\t}\n\t\n\treturn 0;\n}", "import java.util.*;\nimport java.util.regex.*;\n\nimport static java.lang.Math.*;\nimport static java.lang.System.out;\n\n// AOJ\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tnew Main().AOJ0139();\n\t}\n\t\n\tvoid AOJ0139(){\n\t\tint N=sc.nextInt();\n\t\tsc.nextLine();\n\t\tfor(int i=1; i<=N; i++){\n\t\t\tString s=sc.nextLine();\n\t\t\tMatcher m=Pattern.compile(\"^>'=+#=+~$\").matcher(s);\n\t\t\tMatcher m2=Pattern.compile(\"^>\\\\^[Q=]+~~$\").matcher(s);\n\t\t\tif(m.matches()){\n\t\t\t\tm=Pattern.compile(\"=+\").matcher(s);\n\t\t\t\tif(m.find()){\n\t\t\t\t\tString a1=m.group();\n\t\t\t\t\tif(m.find()){\n\t\t\t\t\t\tif(a1.equals(m.group())){\n\t\t\t\t\t\t\tout.println(\"A\");\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(m2.matches()){\n\t\t\t\tif(s.replaceAll(\"Q=\", \"\").length()==4){\n\t\t\t\t\tout.println(\"B\");\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.println(\"NA\");\n\t\t}\n\t}\n\t\n\tvoid AOJ0137(){\n\t\tint N=sc.nextInt();\n\t\tfor(int i=1; i<=N; i++){\n\t\t\tlong s=sc.nextLong();\n\t\t\tout.println(\"Case \"+i+\":\");\n\t\t\tfor(int j=0; j<10; j++){\n\t\t\t\ts*=s;\ts/=100;\ts%=10000;\n\t\t\t\tout.println(s);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid AOJ0133(){\n\t\tchar[][] a=new char[9][9];\n\t\tfor(int i=1; i<=8; i++){\n\t\t\tchar[] s=sc.next().toCharArray();\n\t\t\tfor(int j=1; j<=8; j++)\ta[j][i]=s[j-1];\n\t\t}\n\t\t\n\t\tout.println(\"90\");\n\t\tfor(int j=1; j<=8; j++){\n\t\t\tfor(int i=1; i<=8; i++)\tout.print(a[j][9-i]);\n\t\t\tout.println();\n\t\t}\n\t\tout.println(\"180\");\n\t\tfor(int j=1; j<=8; j++){\n\t\t\tfor(int i=1; i<=8; i++)\t\tout.print(a[9-i][9-j]);\n\t\t\tout.println();\n\t\t}\n\t\tout.println(\"270\");\n\t\tfor(int j=1; j<=8; j++){\n\t\t\tfor(int i=1; i<=8; i++)\t\tout.print(a[9-j][i]);\n\t\t\tout.println();\n\t\t}\n\t}\n\t\n\t// 途中\n\tvoid AOJ0230(){\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tint[] a=new int[n+1], b=new int[n+1];\n\t\t\tfor(int i=1; i<=n; i++)\ta[i]=sc.nextInt();\n\t\t\tfor(int i=1; i<=n; i++)\tb[i]=sc.nextInt();\n\t\t\tout.println(min(solve230(n,a,b),solve230(n,b,a)));\n\t\t}\n\t}\n\tint solve230(int n, int[] a, int[] b){\n\t\tint ans=0;\n\t\tArrayList<Integer> dp=new ArrayList<Integer>();\n\t\tdp.add(0);\n\t\tfor(int i=1; dp.get(dp.size()-1)<n; i++){\n\t\t\tint temp=min(dp.get(i-1),min(dp.get(i-2),dp.get(i-3)));\n\t\t}\n\t\t\n\t\treturn ans;\n\t}\n\t\n\t// TLE -> OK\n\tvoid AOJ0070(){\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt(), s=sc.nextInt(), ans=0;\n\t\t\tfor(int i=0; i<=9; i++){\n\t\t\t\tboolean[] b=new boolean[10];\n\t\t\t\tb[i]=true;\n\t\t\t\tans+=solve70(1,0,i,n,s,b);\n\t\t\t}\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\tint solve70(int nn, int ss, int x, int n, int s, boolean[] b){\t// nn番目 合計ss 次x\n\t\tint ans=0;\n\t\tif(ss>s)\treturn 0;\n\t\tif(nn>n)\treturn 0;\n\t\tif(nn==n)\tans+=ss+nn*x==s?1:0;\n\t\telse if(nn<n){\n\t\t\tfor(int i=0; i<=9; i++){\n\t\t\t\tif(!b[i]){\n\t\t\t\t\t// コピーしない\n\t\t\t\t\t//boolean[] bb=b.clone();\n\t\t\t\t\t//bb[i]=true;\n\t\t\t\t\tb[i]=true;\n\t\t\t\t\tans+=solve70(nn+1, ss+nn*x, i, n,s,b);\n\t\t\t\t\tb[i]=false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tint p31, q31, a31, n31;\n\tvoid AOJ1131(){\n\t\twhile(sc.hasNext()){\n\t\t\tp31=sc.nextInt(); q31=sc.nextInt(); a31=sc.nextInt(); n31=sc.nextInt();\n\t\t\tint ans=0;\n\t\t\tif(p31==0)\tbreak;\n\t\t\tint G=gcd(max(p31,q31),min(p31,q31));\n\t\t\tp31/=G;\tq31/=G;\n\t\t\tfor(int i=1; i<=a31; i++)\tans+=solve1131(1, i, 1, i);\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\tint solve1131(int nn, int aa, int pp, int Q){\n\t\tif(aa>a31)\treturn 0;\n\t\t// 2秒近く縮まる\n\t\tdouble D=(double)aa/q31;\n\t\tif((double)pp/p31>D)\treturn 0;\n\t\tint ans=0;\n\t\tif(nn<=n31){\n\t\t\tif((double)pp/p31==(double)aa/q31)\tans++;\n\t\t\telse if(nn<n31 && aa<=a31){\n\t\t\t\tfor(int i=Q; i*aa<=a31; i++)\tans+=solve1131(nn+1, aa*i, pp*i+1*aa, i);\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\tvoid AOJ0089(){\t// The Shortest Path on A Rhombic Path\n\t\tint[][] dp=new int[200][200];\n\t\tdp[1][1]=sc.nextInt();\n\t\tint idx=2, lastLen=1;\n\t\twhile(sc.hasNext()){\n\t\t\tString[] s=sc.next().split(\",\");\n\t\t\tfor(int i=1; i<=s.length; i++){\n\t\t\t\tif(s.length>lastLen)\tdp[i][idx]=Integer.parseInt(s[i-1])+max(dp[i][idx-1], dp[i-1][idx-1]);\n\t\t\t\telse\tdp[i][idx]=Integer.parseInt(s[i-1])+max(dp[i][idx-1], dp[i+1][idx-1]);\n\t\t\t}\n\t\t\t\n\t\t\t/*\n\t\t\tString s=sc.nextLine();\n\t\t\tScanner sc2=new Scanner(s).useDelimiter(\",\"); <-【こいつがRE】\n\t\t\tint len=(int)round(s.length()/2.0);\n\t\t\tfor(int i=1; i<=len; i++){\n\t\t\t\tif(len>lastLen)\tdp[i][idx]=sc2.nextInt()+max(dp[i][idx-1], dp[i-1][idx-1]);\n\t\t\t\telse\tdp[i][idx]=sc2.nextInt()+max(dp[i][idx-1], dp[i+1][idx-1]);\n\t\t\t}\n\t\t\tlastLen=len;\n\t\t\t*/\n\t\t\tlastLen=s.length;\n\t\t\tidx++;\n\t\t}\n\t\t//debug\n\t\t/*\n\t\tfor(int i=0; i<=idx; i++){\n\t\t\tfor(int j=0; j<=(int)round(idx/2.0); j++)\tout.printf(\"%4d\",dp[j][i]);\n\t\t\tout.println();\n\t\t}\n\t\t*/\n\t\tout.println(dp[1][idx-1]);\n\t\t\n\t}\n\t\n\tvoid AOJ0191(){\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt(), m=sc.nextInt(), last=0;\t// m回\n\t\t\tif(n==0)\tbreak;\n\t\t\tdouble[][] h=new double[n+1][n+1];\n\t\t\tdouble[][] dp=new double[n+1][m+1];\n\t\t\tfor(int i=1; i<=n; i++){\n\t\t\t\tfor(int j=1; j<=n; j++)\th[j][i]=sc.nextDouble();\n\t\t\t}\n\t\t\tfor(int i=1; i<=n; i++)\tdp[i][1]=1;\n\t\t\tfor(int j=2; j<=m; j++){\n\t\t\t\tfor(int i=1; i<=n; i++){\n\t\t\t\t\tfor(int k=1; k<=n; k++){\n\t\t\t\t\t\tdp[i][j]=max(dp[i][j], dp[k][j-1]*h[i][k]);\n\t\t\t\t\t\t//debug\n\t\t\t\t\t\t//out.print(dp[k][j-1]*h[i][k]+\" \");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t//out.println();\n\t\t\t}\n\t\t\t//debug\n\t\t\t/*\n\t\t\tfor(int j=1; j<=m; j++){\n\t\t\t\tfor(int i=1; i<=n; i++)\tout.print(dp[i][j]+\" \");\n\t\t\t\tout.println();\n\t\t\t}\n\t\t\t*/\n\t\t\tdouble ans=0;\n\t\t\tfor(int i=1; i<=n; i++)\tans=max(ans,dp[i][m]);\n\t\t\tout.printf(\"%.2f\\n\",ans);\n\t\t}\n\t}\n\t\n\tvoid AOJ0203(){\t// A New Plan of Aizu Ski Resort\n\t\twhile(sc.hasNext()){\n\t\t\tint x=sc.nextInt(), y=sc.nextInt();\n\t\t\tif(x==0)\tbreak;\n\t\t\tint[][] dp=new int[x+3][y+3],b=new int[x+2][y+2];\n\t\t\tfor(int j=1; j<=y; j++){\n\t\t\t\tfor(int i=1; i<=x; i++)\tb[i][j]=sc.nextInt();\n\t\t\t}\n\t\t\tfor(int i=1; i<=x; i++)\tdp[i][1]= b[i][1]==1?0:1;\n\t\t\tfor(int j=1; j<=y; j++){\n\t\t\t\tfor(int i=1; i<=x; i++){\n\t\t\t\t\t// jump2連続を見落としてた\n\t\t\t\t\t// if(b[i][j]==2)\tdp[i][j]= dp[i][j-1];\n\t\t\t\t\tif(b[i][j]==2)\tdp[i][j]= b[i][j-1]!=2?dp[i][j-1]:0;\n\t\t\t\t\telse if(b[i][j]==0){\n\t\t\t\t\t\tfor(int k=i-1; k<=i+1; k++)\tdp[i][j]+= b[k][j-1]==0?dp[k][j-1]:0;\t\n\t\t\t\t\t}\n\t\t\t\t\tif(j>2 && b[i][j]!=1)\tdp[i][j]+= b[i][j-2]==2?dp[i][j-2]:0;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t// debug\n\t\t\t/*\n\t\t\tfor(int j=1; j<=y; j++){\n\t\t\t\tfor(int i=1; i<=x; i++)\tout.print(dp[i][j]+\" \");\n\t\t\t\tout.println();\n\t\t\t}\n\t\t\t*/\n\t\t\tint ans=0;\n\t\t\tfor(int i=1; i<=x; i++)\tans+= dp[i][y]+(b[i][y-1]==2?dp[i][y-1]:0);\n\t\t\tout.println(ans);\n\t\t}\n\t\t\n\t}\n\t\n\tvoid AOJ0042(){\t// A Thief\n\t\tint num=1;\n\t\twhile(sc.hasNext()){\n\t\t\tint w=sc.nextInt();\n\t\t\tif(w==0)\tbreak;\n\t\t\tint n=sc.nextInt();\n\t\t\tint[][] dp=new int[n+1][w+1];\n\t\t\tint[] ww=new int[n+1], pp=new int[n+1];\n\t\t\tfor(int i=1; i<=n; i++){\n\t\t\t\tScanner sc2=new Scanner(sc.next()).useDelimiter(\",\");\n\t\t\t\tpp[i]=sc2.nextInt();\n\t\t\t\tww[i]=sc2.nextInt();\n\t\t\t}\n\t\t\tint ans=0, wei=Integer.MAX_VALUE;\n\t\t\tfor(int i=1; i<=n; i++){\n\t\t\t\tfor(int j=1; j<=w; j++){\n\t\t\t\t\tdp[i][j]=max(dp[i-1][j], j>=ww[i]?dp[i-1][j-ww[i]]+pp[i]:dp[i-1][j]);\n\t\t\t\t\tif(dp[i][j]>ans){\n\t\t\t\t\t\twei=j;\n\t\t\t\t\t\tans=dp[i][j];\n\t\t\t\t\t}else if(dp[i][j]==ans){\n\t\t\t\t\t\twei=min(wei,j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t//debug\n\t\t\t/*\n\t\t\tfor(int i=0; i<=w; i++){\n\t\t\t\tfor(int j=0; j<=n; j++)\tout.printf(\"%4d\",dp[j][i]);\n\t\t\t\tout.println();\n\t\t\t}\n\t\t\t*/\n\t\t\t\n\t\t\tout.println(\"Case \"+(num++)+\":\");\n\t\t\tout.println(ans);\n\t\t\tout.println(wei);\n\t\t}\n\t}\n\n\tvoid AOJ0003(){\n\t\tint n=sc.nextInt();\n\t\twhile(n-->0){\n\t\t\tint[] a=new int[3];\n\t\t\tfor(int i=0; i<3; i++)\ta[i]=sc.nextInt();\n\t\t\tArrays.sort(a);\n\t\t\tif(a[2]*a[2]==(a[1]*a[1])+(a[0]*a[0]))\tout.println(\"YES\");\n\t\t\telse\tout.println(\"NO\");\n\t\t}\n\t}\n\t\n\tvoid AOJ0002(){\n\t\twhile(sc.hasNext())\tout.println(new String(\"\"+(sc.nextInt()+sc.nextInt())).length());\n\t}\n\t\n\tvoid AOJ0516(){\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt(), k=sc.nextInt(), ans=0;\n\t\t\tif(n==0)\tbreak;\n\t\t\tint[] sum=new int[n+1];\n\t\t\tfor(int i=1; i<=n; i++)\tsum[i]=sum[i-1]+sc.nextInt();\n\t\t\tfor(int i=k; i<=n; i++)\tans=max(ans, sum[i]-sum[i-k]);\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\t\n\tc547[][] r;\n\tfinal int MOD547=100000;\n\tvoid AOJ0547(){\t// Commute routes\n\t\twhile(sc.hasNext()){\n\t\t\tint w=sc.nextInt(), h=sc.nextInt();\n\t\t\tif(w<2)\tbreak;\n\t\t\tr=new c547[w+1][h+1];\n\t\t\tr[2][1]=new c547(0,0,0,1);\tr[1][2]=new c547(0,1,0,0);\n\t\t\tfor(int x=1; x<=w; x++){\n\t\t\t\tfor(int y=1; y<=h; y++)\tr[x][y] = r[x][y]==null?solve547(x,y): r[x][y];\n\t\t\t}\n\t\t\t//r[w][h].list();\n\t\t\tout.println(r[w][h].sum());\n\t\t}\n\t}\n\tc547 solve547(int x, int y){\n\t\tint s1=y-1>0? r[x][y-1].w2:0;\n\t\tint s2=y-1>0? (r[x][y-1].s1+r[x][y-1].s2)%MOD547:0;\n\t\tint w1=x-1>0? r[x-1][y].s2:0;\n\t\tint w2=x-1>0? (r[x-1][y].w1+r[x-1][y].w2)%MOD547:0;\n\t\treturn new c547(s1, s2, w1, w2);\n\t}\n\tclass c547{\n\t\tint s1, s2, w1, w2;\n\t\tc547(int s1, int s2, int w1, int w2){\n\t\t\tthis.s1=s1; this.s2=s2; this.w1=w1; this.w2=w2;\n\t\t}\n\t\tint sum(){\n\t\t\treturn (this.s1 + this.s2 + this.w1 + this.w2)%MOD547;\n\t\t}\n\t\tvoid list(){\n\t\t\tout.println(\"(\"+this.s1+\" \"+this.s2+\" \"+this.w1+\" \"+this.w2+\")\");\n\t\t}\n\t}\n\t\n\tint[][] a1209;\n\tvoid AOJ1209(){\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tif(n<=0)\tbreak;\n\t\t\ta1209=new int[18][n+1];\n\t\t\tfor(int i=0; i<=n; i++)\ta1209[1][i]=1;\n\t\t\tfor(int x=2; x<=17; x++){\n\t\t\t\tfor(int y=1; y<=n; y++)\ta1209[x][y]=solve1209(x,y);\n\t\t\t}\n\t\t\tint ans=0;\n\t\t\tfor(int i=1; i<=17; i++)\tans+=a1209[i][n];\n\t\t\tout.println(ans);\n\t\t\t\n\t\t\t// debug\n\t\t\t/*\n\t\t\tfor(int i=0; i<=n; i++){\n\t\t\t\tfor(int j=0; j<=17; j++)\tout.print(a1209[j][i]+\" \");\n\t\t\t\tout.println();\n\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n\tint solve1209(int x, int y){\n\t\tint ans=0;\n\t\tfor(int i=x;i>0; i--)\tans+= y-(x*x)>=0?a1209[i][y-(x*x)]:0;\n\t\treturn ans;\n\t}\n\t\n\tint[][] r515;\n\tboolean[][] b515;\n\tvoid AOJ0515(){\t// School Road\n\t\twhile(sc.hasNext()){\n\t\t\tint xn=sc.nextInt(), yn=sc.nextInt();\n\t\t\tif(xn<=0)\tbreak;\n\t\t\tint n=sc.nextInt();\n\t\t\tb515 = new boolean[xn+1][yn+1];\n\t\t\tfor(int i=0; i<n; i++)\tb515[sc.nextInt()][sc.nextInt()]=true;\n\t\t\tr515=new int[xn+1][yn+1];\n\t\t\tr515[1][1]=1;\n\t\t\tfor(int x=1; x<=xn; x++){\n\t\t\t\tfor(int y=1; y<=yn; y++){\n\t\t\t\t\tif(x==1&&y==1)\tcontinue;\n\t\t\t\t\tr515[x][y]=solve515(x,y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.println(r515[xn][yn]);\n\t\t}\n\t}\n\tint solve515(int x, int y){\n\t\tint ans=0;\n\t\tif(!b515[x][y]){\n\t\t\tans+= y-1>0? r515[x][y-1]:0;\n\t\t\tans+= x-1>0? r515[x-1][y]:0;\n\t\t}\n\t\treturn ans;\n\t}\n\t\n\t\n\tint[] a168;\n\tvoid AOJ0168(){\t// Kannondou\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tif(n<=0)\tbreak;\n\t\t\ta168=new int[n+1];\n\t\t\ta168[0]=1;\n\t\t\tfor(int i=1; i<=n; i++)\ta168[i]=solve168(i);\n\t\t\tint day=(a168[n]/10) + (a168[n]%10==0? 0: 1);\n\t\t\t// out.println(\"n\"+a168[n]+\" day\"+day);\n\t\t\tout.println(((day/365) + (day%365==0?0 :1)));\n\t\t}\n\t}\n\tint solve168(int a){\n\t\tint ans=0;\n\t\tfor(int i=a-1; i>=a-3; i--)\tans+= i>=0? a168[i]: 0;\n\t\treturn ans;\n\t}\n\t\n\tvoid AOJ0176(){\t// What Color?\n\t\tint[] R = {0,0,0,0,255,255,255,255};\n\t\tint[] G = {0,0,255,255,0,0,255,255};\n\t\tint[] B = {0,255,0,255,0,255,0,255};\n\t\tHashMap<Integer,String> dic = new HashMap<Integer,String>();\n\t\tdic.put(0, \"black\");\tdic.put(1, \"blue\");\tdic.put(2, \"lime\");\tdic.put(3, \"aqua\");\n\t\tdic.put(4, \"red\");\tdic.put(5, \"fuchsia\");\tdic.put(6, \"yellow\");\tdic.put(7, \"white\");\n\t\twhile(sc.hasNext()){\n\t\t\tString s=sc.next();\n\t\t\tif(s.equals(\"0\"))\tbreak;\n\t\t\tint r=Integer.parseInt(\"\"+s.charAt(1)+s.charAt(2),16), g=Integer.parseInt(\"\"+s.charAt(3)+s.charAt(4),16), b=Integer.parseInt(\"\"+s.charAt(5)+s.charAt(6),16);\n\t\t\tint index=0;\n\t\t\tdouble last=Double.MAX_VALUE;\n\t\t\tfor(int i=0; i<8; i++){\n\t\t\t\tdouble d=sqrt((abs(r-R[i])<<1)+(abs(g-G[i])<<1)+(abs(b-B[i])<<1));\n\t\t\t\tindex = last>d? i : index;\n\t\t\t\tlast = last>d? d : last;\n\t\t\t}\n\t\t\tout.println(dic.get(index));\n\t\t}\n\t}\n\t\n\tvoid AOJ0175(){\t// A King in Hawaii\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tif(n<0)\tbreak;\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile(n!=0){\n\t\t\t\t//out.println(n&3);\n\t\t\t\tsb.append(n&3);\n\t\t\t\tn=n>>2;\n\t\t\t}\n\t\t\tout.println(sb.length()>0? sb.reverse(): 0);\n\t\t}\n\t}\n\t\n\tvoid AOJ0031(){\t// Weight\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tint temp=Integer.lowestOneBit(n);\n\t\t\tout.print(temp);\n\t\t\tn=(n^temp);\n\t\t\twhile(n!=0){\n\t\t\t\ttemp=Integer.lowestOneBit(n);\n\t\t\t\tout.print(\" \"+temp);\n\t\t\t\tn=(n^temp);\n\t\t\t}\n\t\t\tout.println();\n\t\t}\n\t}\n\t\n\tvoid AOJ0051(){\t// Differential II\n\t\tint n=sc.nextInt();\n\t\tfor(int i=0; i<n; i++){\n\t\t\tchar[] c = sc.next().toCharArray();\n\t\t\tint[] a = new int[8];\n\t\t\tfor(int j=0; j<8; j++)\ta[j]=Character.digit(c[j], 10);\n\t\t\tArrays.sort(a);\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(int j=0; j<8; j++)\tsb.append(a[j]);\n\t\t\tint min=Integer.parseInt(sb.toString());\n\t\t\tsb=new StringBuilder();\n\t\t\tfor(int j=7; j>=0; j--)\tsb.append(a[j]);\n\t\t\tint max=Integer.parseInt(sb.toString());\n\t\t\tout.println(max-min);\n\t\t}\n\t}\n\t\n\tvoid AOJ0196(){\t// Baseball Championship\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tif(n==0)\tbreak;\n\t\t\tTeam196[] teams = new Team196[n];\n\t\t\tfor(int i=0; i<n; i++){\n\t\t\t\tString s=sc.next();\n\t\t\t\tint win=0, lose=0;\n\t\t\t\tfor(int j=0; j<n-1; j++){\n\t\t\t\t\tint temp=sc.nextInt();\n\t\t\t\t\tif(temp==0)\twin++;\n\t\t\t\t\tif(temp==1)\tlose++;\n\t\t\t\t}\n\t\t\t\tteams[i] = new Team196(s,win,lose,i);\n\t\t\t}\n\t\t\tArrays.sort(teams);\n\t\t\tfor(int i=0; i<n; i++)\tout.println(teams[i].name);\n\t\t}\n\t}\n\tclass Team196 implements Comparable<Team196>{\n\t\tString name;\n\t\tint win,lose,index;\n\t\tTeam196(String name, int win, int lose, int index){\n\t\t\tthis.name=name;\tthis.win=win;\tthis.lose=lose;\tthis.index=index;\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(Team196 o) {\n\t\t\tif(this.win<o.win)\treturn 1;\n\t\t\tif(this.win>o.win)\treturn -1;\n\t\t\tif(this.lose<o.lose)\treturn -1;\n\t\t\tif(this.lose>o.lose)\treturn 1;\n\t\t\tif(this.index<o.index)\treturn -1;\n\t\t\tif(this.index>o.index)\treturn 1;\n\t\t\treturn 0;\n\t\t}\n\t}\n\t\n\tint gcd(int x, int y){\n\t\tif(y==0)\treturn x;\n\t\telse\treturn gcd(y, x%y);\n\t}\n}", "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<climits>\n#include<string>\n#include<vector>\n#include<list>\n#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cstring>\n#include<stack>\n#include<functional>\nusing namespace std;\n\nbool isA(string s){\n\tint n = 0;\n\tif(s.at(n)!='>' || s.at(++n)!='\\'' ||s.at(++n)!='=') return false;\n\tint cnt = 1;\n\tfor(;s.at(++n)=='='; cnt++);\n\tif(s.at(n)!='#') return false;\n\tfor(int i=0; i<cnt; i++){\n\t\tif(s.at(++n)!='=') return false;\n\t}\n\tif(s.at(++n)!='~' || s.size()>n+1) return false;\n\treturn true;\n}\n\nbool isB(string s){\n\tint n = 0;\n\tif(s.at(n)!='>' || s.at(++n)!='^' || s.at(++n)!='Q' || s.at(++n)!='=') return false;\n\twhile(true){\n\t\tif(s.at(++n)=='Q'){\n\t\t\tif(s.at(++n)!='=') return false;\n\t\t}\n\t\telse break;\n\t}\n\tif(s.at(n)!='~' || s.at(++n)!='~' || s.size()>n+1) return false;\n\treturn true;\n}\n\nint main(){\n\tstring S;\n\tint N;\n\tcin>>N;\n\tfor(int i=0;i<N;i++){\n\t\tcin>>S;\n\t\tif(isA(S)) puts(\"A\");\n\t\telse if(isB(S)) puts(\"B\");\n\t\telse puts(\"NA\");\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = Integer.parseInt(sc.nextLine());\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tString str = sc.nextLine();\n\t\t\t\n\t\t\tif(str.matches(\">\\'(=+)#\\\\1~\")){\n\t\t\t\tSystem.out.println(\"A\");\n\t\t\t}else if(str.matches(\">\\\\^(Q=)+~~\")){\n\t\t\t\tSystem.out.println(\"B\");\n\t\t\t}else{\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t}\n\t\n}", "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tscan.nextLine();\n\t\twhile(n-- > 0){\n\t\t\tString s = scan.nextLine();\n\t\t\tif(s.matches(\"^>'(=+)#\\\\1~$\")) System.out.println(\"A\");\n\t\t\telse if(s.matches(\"^>\\\\^(Q=)+~~$\")) System.out.println(\"B\");\n\t\t\telse System.out.println(\"NA\");\n\t\t}\n\t}\n}", "#include<iostream>\n#include<string>\nusing namespace std;\n\n\nbool isA(string &s){\n\tif(s.size()<6)return false;\n\tif(s[0]!='>'||s[1]!='\\'')return false;\n\tint i=2;\n\twhile(s[i]=='=')i++;\n\tint cnt=i-2;\n\tif(cnt==0||s[i]!='#')return false;\n\tfor(i++;i<s.size()&&s[i]=='=';i++)cnt--;\n\tif(cnt||i==s.size()||s[i]!='~')return false;\n\treturn i+1==s.size();\n}\nbool isB(string &s){\n\tif(s.size()<6)return false;\n\tif(s[0]!='>'||s[1]!='^')return false;\n\tint i=2;\n\tfor(;i<s.size()&&s[i]=='Q';){\n\t\tif(i+1<s.size()&&s[i+1]=='=')i+=2;\n\t\telse break;\n\t}\n\tif(i==2)return false;\n\tif(i+2==s.size()&&s[i]=='~'&&s[i+1]=='~')return true;\n\treturn false;\n}\n\n\nint main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tstring s;\n\t\tcin>>s;\n\t\tif(isA(s))cout<<\"A\\n\";\n\t\telse if(isB(s))cout<<\"B\\n\";\n\t\telse cout<<\"NA\\n\";\n\t}\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tString s = sc.next();\n\t\t\tStringBuffer t = new StringBuffer();\n\t\t\tif(s.length()<=5 || s.length()%2==1){\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t}else if(s.substring(0,2).compareTo(\">'\")==0 && s.substring(s.length()-1,s.length()).compareTo(\"~\")==0){\n\t\t\t\tfor(int k=0;k<(s.length()-4)/2;k++) t.append(\"=\");\n\t\t\t\tt.append(\"#\");\n\t\t\t\tfor(int k=0;k<(s.length()-4)/2;k++) t.append(\"=\");\n\t\t\t\tif(s.substring(2,s.length()-1).compareTo(t.toString())==0) System.out.println(\"A\");\n\t\t\t\telse System.out.println(\"NA\");\n\t\t\t}else if(s.substring(0,2).compareTo(\">^\")==0 && s.substring(s.length()-2,s.length()).compareTo(\"~~\")==0){\n\t\t\t\tfor(int k=0;k<(s.length()-4)/2;k++) t.append(\"Q=\");\n\t\t\t\tif(s.substring(2,s.length()-2).compareTo(t.toString())==0) System.out.println(\"B\");\n\t\t\t\telse System.out.println(\"NA\");\n\t\t\t}else{\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t}\n\t\t}\n\t}\t\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\n int n;\n cin>>n;\n while(n--){\n\n string str;\n cin>>str;\n if(str[0]!='>')cout<<\"NA\"<<endl;\n else{\n if(str[1]=='\\''&&str[2]=='='){\n int e=2;\n for(;str[e]=='=';e++);\n if(str[e]=='#'){\n int f=e+1;\n for(;str[f]=='=';f++);\n if(e==f-e+1&&str[f]=='~'&&str[f+1]=='\\0')cout<<\"A\"<<endl;\n else cout<<\"NA\"<<endl;\n }\n else cout<<\"NA\"<<endl;\n }\n else if(str[1]=='^'&&str[2]=='Q'){\n int e,flg=0;\n for(e=2;str[e]=='Q';e+=2){\n if(str[e+1]!='='){\n cout<<\"NA\"<<endl;\n flg=1;\n break;\n }\n }\n if(!flg){\n if(str[e]=='~'&&str[e+1]=='~'&&str[e+2]=='\\0')cout<<\"B\"<<endl;\n else cout<<\"NA\"<<endl;\n }\n }\n else cout<<\"NA\"<<endl;\n }\n\n }\n\n return 0;\n}", "#define _USE_MATH_DEFINES\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <cassert>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n#include <iomanip>\n#include <iterator>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair<int,int> Pii;\ntypedef pair<ll,ll> Pll;\n \n#define FOR(i,n) for(int i = 0; i < (n); i++)\n#define sz(c) ((int)c.size())\n\ntypedef unsigned long long ull;\n\nint Judge(string &s){\n\tif(s[0] != '>') return -1;\n\tif(s.size() < 2) return -1;\n\tif(s[1] == '\\''){\n\t\tif(s[s.size()-1] != '~') return -1;\n\t\tint len = sz(s) - 3;\n\t\tif(len < 3 || len % 2 == 0) return -1;\n\t\tFOR(i,(len-1)/2){\n\t\t\tif(s[2+i] != '=' || s[2+len/2+1+i] != '=') return -1;\n\t\t}\n\t\tif(s[2+len/2] != '#') return -1;\n\t\treturn 0;\n\t} else if(s[1] == '^'){\n\t\tif(s[s.size()-1] != '~' || s[s.size()-2] != '~')return -1;\n\t\tint len = sz(s) - 4;\n\t\tif(len < 2 || len % 2 != 0) return -1;\n\t\tFOR(i,len/2){\n\t\t\tif(s[2+2*i] != 'Q' || s[2+2*i+1] != '=') return -1;\n\t\t}\n\t\t\treturn 1;\n\t} else {\n\t\treturn -1;\n\t}\n}\n\nint main(){\n\tint n; cin>>n;\n\tstring out[] = {\"NA\",\"A\",\"B\"};\n\tFOR(i,n){\n\t\tstring s; cin>>s;\n\t\tint a = Judge(s);\n\t\tcout << out[a+1] << endl;\n\t}\n\treturn 0;\n}", "for r in range(input()):\n\tsnake=raw_input()\n\tL=len(snake)\n\tif L>5 and snake == \">'\" + \"=\"*((L-4)/2) + \"#\" + \"=\"*((L-4)/2) + \"~\":\n\t\tprint \"A\"\n\telif L>5 and snake == \">^\" + \"Q=\"*((L-4)/2) + \"~~\":\n\t\tprint \"B\"\n\telse:\n\t\tprint \"NA\"", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nint main(){\n\n\tint n;\n\tcin>>n;\n\tfor(int i = 0; i < n; i++){\n\t\tstring str;\n\t\tcin>>str;\n\t\tif(str.size()<=4)\n\t\t\tcout<<\"NA\"<<endl;\n\t\telse if(str.substr(0,2)==\">'\"&&str[str.size()-1]=='~'&&str.size()%2==0){\n\t\t\tstring ss=str.substr(2,str.size()-3);\n\t\t\tif(ss.size()>=3){\n\t\t\t\tbool f=true;\n\t\t\t\tfor(int j = 0; j < ss.size(); j++){\n\t\t\t\t\tif(j==0){\n\t\t\t\t\t\tif(ss[j]!='='){\n\t\t\t\t\t\t\tf=false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if(j==(ss.size()/2)){\n\t\t\t\t\t\tif(ss[j]!='#'){\n\t\t\t\t\t\t\tf=false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tif(ss[j]!='='){\n\t\t\t\t\t\t\tf=false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(f)\n\t\t\t\t\tcout<<\"A\"<<endl;\n\t\t\t\telse\n\t\t\t\t\tcout<<\"NA\"<<endl;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tcout<<\"NA\"<<endl;\n\t\t\t}\n\t\t}\n\t\telse if(str.substr(0,2)==\">^\"&&str.substr(str.size()-2,2)==\"~~\"&&str.size()%2==0){\n\t\t\tstring ss=str.substr(2,str.size()-4);\n\t\t\tbool f=true;\n\t\t\tif(ss.size()>=2){\n\t\t\t\tfor(int j = 0; j < ss.size(); j+=2){\n\t\t\t\t\tif(ss.substr(j,2)!=\"Q=\"){\n\t\t\t\t\t\tf=false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(f)\n\t\t\t\t\tcout<<\"B\"<<endl;\n\t\t\t\telse\n\t\t\t\t\tcout<<\"NA\"<<endl;\n\t\t\t}\n\t\t\telse\n\t\t\t\tcout<<\"NA\"<<endl;\n\t\t}\n\t\telse\n\t\t\tcout<<\"NA\"<<endl;\n\t}\n\n\treturn 0;\n}", "import java.util.*;\nimport java.util.regex.*;\n\nclass Main {\n public static void main (String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n scanner.nextLine();\n for (int ii = 0; ii < n; ii++) {\n String str = scanner.nextLine();\n Pattern pa = Pattern.compile(\"^>'(=+)#\\\\1~$\");\n Pattern pb = Pattern.compile(\"^>\\\\^(?:Q=)+~~$\");\n Matcher ma = pa.matcher(str);\n Matcher mb = pb.matcher(str);\n if (ma.matches()) {\n System.out.println(\"A\");\n } else if (mb.matches()) {\n System.out.println(\"B\");\n } else {\n System.out.println(\"NA\");\n }\n }\n }\n}", "#include<vector>\n#include<list>\n#include<algorithm>\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint main(){\n int i,j;\n int n;\n vector<string> s;\n cin>>n;\n for(i=0;i<n;i++){\n string str;\n cin>>str;\n s.push_back(str);\n }\n for(i=0;i<n;i++){\n if(s[i].find(\">'\")==0){\n if(s[i].find(\"~\")==s[i].length()-1){\n\tif(s[i].find(\"#\")!=-1){\n\t if(s[i].find(\"#\")-2==s[i].length()-s[i].find(\"#\")-2){\n\t int len;\n\t string str;\n\t str=s[i].substr(2,s[i].find(\"#\")-2); \n\t len=str.length();\n\t if(len>0){\n\t for(j=0;j<len;j++){\n\t\tif(str[j]!='=')\n\t\t break;\n\t }\n\t if(j==len){\n\t\tstr=s[i].substr(s[i].find(\"#\")+1,s[i].find(\"#\")-2);\n\t\tlen=str.length();\n\t\tfor(j=0;j<len;j++){\n\t\t if(str[j]!='=')\n\t\t break;\n\t\t}\n\t\tif(j==len){\n\t\t cout<<\"A\"<<endl;\n\t\t continue;\n\t\t}\n\t }\n\t }\n\t }\n\t}\n }\n }else if(s[i].find(\">^\")==0){\n if(s[i].find(\"~~\")==s[i].length()-2){\n\tint len;\n\tstring str;\n\tstr=s[i].substr(2,s[i].length()-4);\n\tlen=str.length();\n\tif(len>1&&len%2==0){\n\t for(j=0;j<len;j+=2){\n\t if(str[j]!='Q')\n\t break;\n\t }\n\t if(j==len){\n\t for(j=1;j<len;j+=2){\n\t if(str[j]!='=')\n\t\tbreak;\n\t }\n\t if(j==len+1){\n\t cout<<\"B\"<<endl;\n\t continue;\n\t }\n\t }\n\t}\n }\n }\n cout<<\"NA\"<<endl;\n }\n return 0;\n}", "#include<stdio.h>\n#include<iostream>\n#include<string>\n#include<math.h>\n#include<algorithm>\nusing namespace std;\n\n\nint main(){\n\tstring str;\n\t\n\tint N;\n\tcin>>N;\n\tfor(int i=0;i<N;i++){\n\tcin>>str;\n\t\tstring x=\" \";\n\t\nif(str[0]=='>'){\n\tfor(int j=0;j<2;j++)\n\t\tx[j]=str[j];\n\t\n\tif(str[1]=='\\''&&str[str.size()-1]=='~'){\n\t\tbool f=true;int C=0;\n\t\tint mid=(2+str.size()-2)/2;\n\t\tfor(int j=2;j<=str.size()-2;j++)\n\t\t{if(j!=mid&&str[j]!='='){f=false;}\n\t\telse if(j==mid&&str[j]!='#')f=false;\n\t\tif(str[j]=='=')C++;\n\t\t}\n\t\tif(C%2!=0||C==0)f=false;\n\t\t\n\t\tif(f==true)cout<<\"A\"<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t}\n\n\telse if(str[1]=='^'&&str[str.size()-1]=='~'&&str[str.size()-2]=='~'){\n\t\tbool f=true;int C=0;\n\t\t\n\t\tfor(int j=2;j<str.size()-2;j++)\n\t\t{\n\t\t\tC++;\n\t\t\tif(C%2==0&&str[j]!='=')f=false;\n\t\t\tif(C%2==1&&str[j]!='Q')f=false;\n\n\t\t}\n\t\n\t\tif(C%2!=0||C==0)f=false;\n\t\t\n\t\tif(f==true)cout<<\"B\"<<endl;\n\t\telse cout<<\"NA\"<<endl;\n\t\n\t\n\t}\n\telse cout<<\"NA\"<<endl;\n\n\t}\n\telse cout<<\"NA\"<<endl;\n\n\n\t}\n\treturn 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n \n \npublic class Main {\n\tprivate static BufferedReader br = null;\n\n\tstatic {\n\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t}\n\n\t/**\n\t* @param args\n\t*/\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tint cnt = parseNum();\n\t\twhile (cnt-- > 0) {\n\t\t\tparseSnake();\n\t\t}\n\t}\n\n\tprivate static void parseSnake() {\n\t\tint typ = 0;\n\t\tString str = null;\n\n\t\tif ((str = parseStdin()) != null) {\n\t\t\tint\tlen = str.length();\n\t\t\tif (len > 2 && len%2 == 0) {\n\t\t\t\tif (str.charAt(0) == '>') {\n\t\t\t\t\tif (str.charAt(1) == '\\'' && len > 3) {\n\t\t\t\t\t\tif (str.charAt(len-1) == '~' && str.charAt(len-2) == '=') {\n\t\t\t\t\t\t\tif (str.charAt(2) == '=') {\n\t\t\t\t\t\t\t\tchar\tstc = 0;\n\t\t\t\t\t\t\t\tint\t\tmid = 2+(len-4)/2;\n\t\t\t\t\t\t\t\tfor (int i = 2; i < len-1; i++) {\n\t\t\t\t\t\t\t\t\tstc = str.charAt(i);\n\t\t\t\t\t\t\t\t\ttyp = (i == 2) ? 1 : typ;\n\t\t\t\t\t\t\t\t\tif ((stc != '=' && stc != '#') || (stc == '#' && i != mid) || (stc != '#' && i == mid)) {\n\t\t\t\t\t\t\t\t\t\ttyp = 0;\n\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (str.charAt(1) == '^' && len > 4) {\n\t\t\t\t\t\tif (str.charAt(len-1) == '~' && str.charAt(len-2) == '~' && str.charAt(len-3) == '=') {\n\t\t\t\t\t\t\tchar\tsc1 = 0;\n\t\t\t\t\t\t\tchar\tsc2 = 0;\n\t\t\t\t\t\t\tfor (int i = 2; i+1 < len-2; i += 2) {\n\t\t\t\t\t\t\t\ttyp = (i == 2) ? 2 : typ;\n\t\t\t\t\t\t\t\tsc1 = str.charAt(i);\n\t\t\t\t\t\t\t\tsc2 = str.charAt(i+1);\n\t\t\t\t\t\t\t\tif (sc1 != 'Q' || sc2 != '=') {\n\t\t\t\t\t\t\t\t\ttyp = 0;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tswitch (typ) {\n\t\tcase\t1:\n\t\t\tSystem.out.println(\"A\");\n\t\t\tbreak;\n\t\tcase\t2:\n\t\t\tSystem.out.println(\"B\");\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tSystem.out.println(\"NA\");\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tprivate static int parseNum() {\n\t\tint num = 0;\n\t\tString str = null;\n\n\t\tif ((str = parseStdin()) != null) {\n\t\t\tnum = Integer.parseInt(str);\n\t\t}\n\n\t\treturn num;\n\t}\n\n\tprivate static String parseStdin() {\n\t\tString stdin = null;\n\n\t\ttry {\n\t\t\tString tmp = br.readLine();\n\t\t\tif (tmp != null) {\n\t\t\t\tif (!tmp.isEmpty()) stdin = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\tcatch (IOException e) {}\n\n\t\treturn stdin;\n\t}\n}", "n = int(input())\nans_list = []\nfor i in range(n):\n s = input()\n if s[0] == \"~\" and s[-1] == \">\":\n s = s[::-1]\n if s[0] == \">\" and s[1] == \"'\" and s[-2] == \"=\" and s[-1] == \"~\":\n check_s = s[2:-1].split(\"#\")\n if len(check_s) == 2:\n front = check_s[0]\n back = check_s[1]\n if front == back and set(front) == {\"=\"}:\n ans = \"A\"\n else:\n ans = \"NA\"\n else:\n ans = \"NA\"\n elif s[0] == \">\" and s[1] == \"^\" and s[-2] == \"~\" and s[-1] == \"~\":\n check_s = s[2:-2]\n check_list = set(check_s.split(\"Q=\"))\n if check_list == {\"\"} and \"Q=\" in check_s:\n ans = \"B\"\n else:\n ans = \"NA\"\n else:\n ans = \"NA\"\n ans_list.append(ans)\nfor a in ans_list:\n print(a)\n\n", "# AOJ 0139 Snakes\n# Python3 2018.6.19 bal4u\n\nimport re\n\npa = \">'(=+)#(=+)~$\"\t# A >'======#======~\npb = \">\\^(Q=)+~~$\"\t\t# B >^Q=Q=Q=Q=Q=Q=Q=Q=Q=~~\n\nfor i in range(int(input())):\n\ts = input()\n\tr = re.match(pa, s)\n\n\tif r and r.group(1) == r.group(2): print('A')\n\telif re.match(pb, s): print('B')\n\telse: print('NA')\n", "#include<iostream>\nusing namespace std;\nint n;\nstring str;\nbool check_A(string t){\n int cnt=0,i=0,cnt2=0;\n\n while(t[i]=='='){cnt++;i++;}\n\n if(t[i]!='#')return false;\n if(cnt==0)return false;\n if((int)t.size()==i)return false;\n\n i++;\n while(t[i]=='='){cnt2++;i++;}\n\n if(cnt!=cnt2)return false;\n if((int)t.size()!=i+1)return false;\n\n if(t[i]!='~')return false;\n return true;\n}\n\nbool check_B(string t){\n int i=0,cnt=0;\n while(i+1<(int)t.size()&&t[i]=='Q'&&t[i+1]=='='){\n i+=2;\n cnt++;\n }\n if(cnt==0)return false;\n if(i+2!=(int)t.size())return false;\n if(t[i]=='~'&&t[i+1]=='~')return true;\n return false;\n}\n\n\nint main(){\n cin>>n;\n while(n--){\n cin>>str;\n if(str[0]=='>'&&str[1]=='\\''){\n if(check_A(str.substr(2))){\n\tcout<<'A'<<endl;\n }else{\n\tcout<<\"NA\"<<endl;\n }\n }else if(str[0]=='>'&&str[1]=='^'){\n if(check_B(str.substr(2))){\n\tcout<<'B'<<endl;\n }else{\n\tcout<<\"NA\"<<endl;\n }\n \n }else{\n cout<<\"NA\"<<endl;\n }\n }\n return 0;\n}", "\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <ctime>\n#include <cassert>\n#include <iostream>\n#include <cctype>\n#include <sstream>\n#include <string>\n#include <list>\n#include <vector>\n#include <queue>\n#include <set>\n#include <stack>\n#include <map>\n#include <utility>\n#include <numeric>\n#include <algorithm>\n#include <iterator>\n#include <bitset>\n#include <complex>\n#include <fstream>\nusing namespace std;\ntypedef long long ll;\nconst double EPS = 1e-9;\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\n#define rep(i, n) REP(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define MSG(a) cout << #a << \" \" << a << endl;\n#define REP(i, x, n) for(int i = x; i < n; i++)\ntemplate<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }\ntemplate<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }\ntemplate<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }\ntemplate<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }\n\nint main()\n{\n int n;\n\tcin >> n;\n\t\n\twhile(n--)\n\t{\n\t\tstring snk;\n\t\tcin >> snk;\n\t\t\n\t\tif(snk.size() < 6 || snk.size() % 2 != 0 || (snk.substr(0, 2) != \">'\" && snk.substr(0, 2) != \">^\"))\n\t\t{\n\t\t\tcout << \"NA\" << endl;\n\t\t}\n\t\telse if(snk.substr(0, 2) == \">^\")\n\t\t{\n\t\t\tif(snk.substr(2, 2) == \"Q=\" && snk.substr(snk.size() - 2, 2) == \"~~\")\n\t\t\t{\n\t\t\t\tfor(int i = 4; i < snk.size() - 2; i += 2)\n\t\t\t\t{\n\t\t\t\t\tif(snk.substr(i, 2) != \"Q=\")\n\t\t\t\t\t{\n\t\t\t\t\t\tgoto ng;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tcout << \"B\" << endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\tng:;\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t}\t\t\t\t\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(snk[(snk.size() - 3) / 2 + 2] == '#' && snk[snk.size() - 1] == '~')\n\t\t\t{\n\t\t\t\trep(i, (snk.size() - 3) / 2)\n\t\t\t\t{\n\t\t\t\t\tif(snk[i + 2] != '=' || snk[i + 3 + (snk.size() - 3) / 2] != '=')\n\t\t\t\t\t{\n\t\t\t\t\t\tgoto ng;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tcout << \"A\" << endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t}\n\t\t}\n\t}\n}", "import java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\nclass Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int n = Integer.parseInt(br.readLine());\n\n for (int i = 0; i < n; i++) {\n String res = \"NA\";\n String sna = br.readLine();\n\n if (sna.length() < 6) {\n System.out.println(res);\n continue;\n }\n\n if (sna.startsWith(\">\\'\")) {\n sna = sna.substring(2);\n if (sna.startsWith(\"=\")) {\n int eq1 = 0;\n for (char c : sna.toCharArray()) {\n if (c == '=')\n eq1++;\n else\n break;\n }\n sna = sna.substring(eq1);\n if (sna.startsWith(\"#\")) {\n sna = sna.substring(1);\n int eq2 = 0;\n for (char c : sna.toCharArray()) {\n if (c == '=')\n eq2++;\n else\n break;\n }\n\n if (eq1 == eq2) {\n sna = sna.substring(eq2);\n if (sna.equals(\"~\")) {\n res = \"A\";\n }\n }\n }\n }\n } else if (sna.startsWith(\">^\")) {\n sna = sna.substring(2);\n int q = 0;\n while (sna.startsWith(\"Q=\")) {\n sna = sna.substring(2);\n q++;\n }\n if (q > 0) {\n if (sna.equals(\"~~\")) {\n res = \"B\";\n }\n }\n }\n\n System.out.println(res);\n }\n }\n}\n", "#include <iostream>\n#include <string>\nusing namespace std;\n\nbool isA(const string& str, int indx) {\n\tif(str[indx++] != '>')\n\t\treturn false;\n\tif(str[indx++] != '\\'')\n\t\treturn false;\n\n\tint count0 = 0;\n\tfor(; indx < str.size(); indx++) {\n\t\tif(str[indx] == '=')\n\t\t\tcount0++;\n\t\telse\n\t\t\tbreak;\n\t}\n\tif(indx >= str.size())\n\t\treturn false;\n\tif(str[indx++] != '#' || count0 == 0)\n\t\treturn false;\n\tint count1 = 0;\n\tfor(; indx < str.size(); indx++) {\n\t\tif(str[indx] == '=')\n\t\t\tcount1++;\n\t\telse\n\t\t\tbreak;\n\t}\n\n\tif(count0 == count1 && indx + 1 == str.size() && str[indx] == '~')\n\t\treturn true;\n\treturn false;\n}\n\nbool isB(const string & str, int indx) {\n\tif(str[indx++] != '>')\n\t\treturn false;\n\tif(str[indx++] != '^')\n\t\treturn false;\n\n\tint count = 0;\n\tfor(; indx + 1 < str.size(); indx += 2) {\n\t\tif(string(str.begin() + indx, str.begin() + indx + 2) == \"Q=\")\n\t\t\tcount++;\n\t\telse\n\t\t\tbreak;\n\t}\n\tif(count > 0 && string(str.begin() + indx, str.begin() + indx + 2) == \"~~\" && indx + 2 == str.size())\n\t\treturn true;\n\treturn false;\n}\n\nint main() {\n\tstring str;\n\tint n;\n\n\tcin >> n;\n\tfor(int t = 0; t < n; t++) {\n\t\tint type = 0;\n\t\tcin >> str;\n\t\tfor(int i = 0; i < str.size(); i++) {\n\t\t\tif(str[i] == '>') {\n\t\t\t\tif(isA(str, i)) {\n\t\t\t\t\ttype = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(isB(str, i)) {\n\t\t\t\t\ttype = 2;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tswitch(type) {\n\t\t\tcase 0:\n\t\t\t\tcout << \"NA\" << endl;\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tcout << \"A\" << endl;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tcout << \"B\" << endl;\n\t\t\t\tbreak;\n\t\t}\n\t}\n}", "def checkA(s):\n\n l = len(s)\n if l % 2 == 0:\n return False\n\n ll = (l-1)//2\n\n for i in range(ll):\n if s[i] != \"=\" or s[l-1-i] != \"=\":\n return False\n\n if s[ll] != \"#\":\n return False\n\n return True\n\ndef checkB(s):\n l = len(s)\n\n if l % 2 == 1:\n return False\n\n ll = l // 2\n for i in range(ll):\n if s[2*i] != \"Q\" or s[2*i+1] != \"=\":\n return False\n\n return True\n\ndef check(s):\n if len(s) < 6:\n return \"NA\"\n\n if s[0:2] == \">'\" and s[-1:] == \"~\":\n if checkA(s[2:-1]):\n return \"A\"\n else:\n return \"NA\"\n\n if s[0:2] == \">^\" and s[-2:] == \"~~\":\n if checkB(s[2:-2]):\n return \"B\"\n else:\n return \"NA\"\n\n return \"NA\"\n\nN = int(input())\n\nfor i in range(N):\n s = input()\n print(check(s))\n", "import java.io.*;\nimport java.util.regex.*;\n\nclass Main {\n public static void main(String[] args) {\n try {\n BufferedReader reader = new BufferedReader(\n new InputStreamReader(System.in));\n String l;\n\n // 入力行数を読み飛ばす\n l = reader.readLine(); \n Pattern a = Pattern.compile(\">'(=+)#\\\\1~\");\n Pattern b = Pattern.compile(\">\\\\^(Q=)+~~\");\n while ((l = reader.readLine()) != null) {\n Matcher ma = a.matcher(l);\n Matcher mb = b.matcher(l);\n if (ma.matches()) {\n System.out.println(\"A\");\n } else if (mb.matches()) {\n System.out.println(\"B\");\n } else {\n System.out.println(\"NA\");\n }\n }\n } catch (IOException e) {}\n }\n}", "#include <iostream>\n#include <string>\nusing namespace std;\n\nstring repeat(int n, string s) {\n string res = \"\";\n for (int i=0; i<n; ++i)\n res += s;\n return res;\n}\n\nint main() {\n int N; cin >> N;\n for (int i=0; i<N; ++i) {\n string snake; cin >> snake;\n\n int len = snake.size();\n if (len <= 4) {\n cout << \"NA\" << endl; continue;\n }\n\n string body = repeat(len/2 - 2, \"=\");\n string A = \">'\" + body + \"#\" + body + \"~\";\n if (snake == A) {\n cout << \"A\" << endl; continue;\n }\n\n body = repeat(len/2 - 2, \"Q=\");\n string B = \">^\" + body + \"~~\";\n if (snake == B) {\n cout << \"B\" << endl; continue;\n }\n\n cout << \"NA\" << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <string>\n#include <cstdio>\n\nusing namespace std;\n\nint main(){\n int n;\n\n cin >> n;\n while(n--){\n string snake;\n cin >> snake;\n\n string s = snake.substr(0,2);\n \n\n if(s != \">^\" && s != \">\\'\"){\n puts(\"NA\");\n continue;\n }\n\n if(s == \">\\'\"){\n int a = 0;\n int p = 2;\n bool flg = true;\n int len = (int)snake.size();\n for(int i = 2 ; i < len ; i++,p++){\n\tif(snake[i] == '#') break;\n\telse if(snake[i] == '=') a++;\n\telse{\n\t flg = false;\n\t break;\n\t}\n }\n\n if(!flg){\n\tputs(\"NA\");\n\tcontinue;\n } \n\n int b = 0,q = p + 1;\n for(int i = q ; i < len ; i++,p++){\n\tif(snake[i] == '~') break;\n\telse if(snake[i] == '=') b++;\n\telse{\n\t flg = false;\n\t break;\n\t}\n }\n\n if(!flg || a == 0 || b == 0 || a != b){\n\tputs(\"NA\");\n\tcontinue;\n } \n\n if(a == b && snake[len-1] == '~'){\n\tputs(\"A\");\n }else{\n\tputs(\"NA\");\n }\n }else{\n bool ok = true;\n int p = 0;\n string ss = \"\";\n int len = (int)snake.size();\n\n if(len < 6 || len % 2){\n\tputs(\"NA\");\n\tcontinue;\n } \n\n for(int i = 2 ; i < len-2 ; i++,p++){\n\tss += snake[i];\n\tif(p == 1){\n\t p = -1;\n\t if(ss != \"Q=\"){\n\t ok = false;\n\t break;\n\t }\n\t ss = \"\";\n\t}\n }\n\n if(snake[len-2] == '~' && snake[len-1] == '~' && ok){\n\tputs(\"B\");\n }else{\n\tputs(\"NA\");\n }\n }\n }\n\n return 0;\n}" ]
Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets: S seat 6000 yen A seat 4000 yen B seat 3000 yen C seat 2000 yen You, the sales manager, are excitedly waiting for the launch. Finally on sale. It's selling very well! Shortly after the launch, I received a table summarizing the orders up to that point. Each row of the table shows the type and number of tickets sold so far. However, the ticket types do not always appear in the order of S, A, B, C. Create a program to find the sales amount for each row in this table. input Input data is given in the following format. t1 n1 t2 n2 t3 n3 t4 n4 The input consists of 4 lines. Line i is given the integer ti (1 ≤ ti ≤ 4) for the ticket type and the integer ni (0 ≤ ni ≤ 10000) for the number of tickets. The integers 1, 2, 3, and 4 representing the ticket types represent S seats, A seats, B seats, and C seats, respectively. Numbers from 1 to 4 always appear once as values ​​for t1, t2, t3, and t4, but they are not always given in the order of 1, 2, 3, 4. output Output the sales amount for each line. Example Input 3 10 1 4 4 1 2 5 Output 30000 24000 2000 20000
[ "for i in range(4):\n t,n=map(int,input().split())\n if t==1:\n print(f'{6000*n}')\n elif t==2:\n print(f'{4000*n}')\n elif t==3:\n print(f'{3000*n}')\n elif t==4:\n print(f'{2000*n}')\n", "#include <stdio.h>\nint main(void){\n\tint t,n;\n\tint i;\n\t\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d %d\",&t,&n);\n\t\t\n\t\tif(t==1){\n\t\t\tprintf(\"%d\\n\",6000*n);\n\t\t}\n\t\tif(t==2){\n\t\t\tprintf(\"%d\\n\",4000*n);\n\t\t}\n\t\tif(t==3){\n\t\t\tprintf(\"%d\\n\",3000*n);\n\t\t}\n\t\tif(t==4){\n\t\t\tprintf(\"%d\\n\",2000*n);\n\t\t}\n\t}\n\t\t\n\t\n\t\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint t[]={0,6000,4000,3000,2000},a,b;\nint main(){\n while(cin>>a>>b){\n cout<<t[a]*b<<endl;\n }\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main(void){\n\tfor (int h = 1; h <= 4;h++){\n\t\tint t, n, p;\n\t\tcin >> t >> n;\n\t\tswitch (t){\n\t\tcase 1: p = 6000; break;\n\t\tcase 2: p = 4000; break;\n\t\tcase 3: p = 3000; break;\n\t\tcase 4: p = 2000; break;\n\t\t}\n\t\tcout << p*n << endl;\n\t}\n}", "tn=[map(int,input().split()) for _ in range(4)]\nt,n=[list(i) for i in zip(*tn)]\n\nl=[]\nfor x in range(4):\n if t[x]==1:\n l.append(6000*n[x])\n elif t[x]==2:\n l.append(4000*n[x])\n elif t[x]==3:\n l.append(3000*n[x])\n else:\n l.append(2000*n[x])\nprint(l[0])\nprint(l[1])\nprint(l[2])\nprint(l[3])\n", "# coding: utf-8\n# Your code here!\n\nfor l in range(4):\n t,n = [int(i) for i in input().split()]\n if t == 1:\n print(6000*n)\n elif t == 2:\n print(4000*n)\n elif t == 3:\n print(3000*n)\n elif t == 4:\n print(2000*n)\n \n", "#include<iostream>\n\nusing namespace std;\n\nint main(){\n\tint kingaku[] = {6000, 4000, 3000, 2000};\n\t//????????????\n\tfor (int i = 0; i < 4; i++) {\n\t\tint t,n;\n\t\tcin >> t >> n;\n\t\tcout << kingaku[t-1] * n << endl;\n\t}\n\t\t\n\treturn 0;\n}", "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[]args){\n\t\tint ban;\n\t\tint su;\n\t\tint kin;\n\t\tint s=6000,a=4000,b=3000,c=2000;\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tfor(int i=0;i<4;i++){\n\t\t\tban = sc.nextInt();\n\t\t su = sc.nextInt();\n\t\t\tswitch(ban){\n\t\t\t\tcase 1:\n\t\t\t\tkin = s*su;\n\t\t\t\tSystem.out.println(kin);\n\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\tkin = a*su;\n\t\t\t\tSystem.out.println(kin);\n\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\tkin = b*su;\n\t\t\t\tSystem.out.println(kin);\n\t\t\t\tbreak;\n\t\t\t\tcase 4:\n\t\t\t\tkin = c*su;\n\t\t\t\tSystem.out.println(kin);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}", "#include <cstdio>\nint main() {\n int t,n;\n for(int i=0;i<4;i++) {\n scanf(\"%d %d\",&t,&n);\n int sale;\n if(t==1) sale=6000*n;\n if(t==2) sale=4000*n;\n if(t==3) sale=3000*n;\n if(t==4) sale=2000*n;\n printf(\"%d\\n\",sale);\n }\n}", "#include<cstdio>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\n#include<queue>\nusing namespace std;\nint main(){\n int lis[5]={0,6000,4000,3000,2000};\n for(int i=0;i<4;i++){\n int a,b;\n scanf(\"%d %d\",&a,&b);\n printf(\"%d\\n\",lis[a]*b);\n }\n return 0;\n}", "#include <stdio.h>\n\nint main(void){\n\t\n\tint a;\n\tint t,n;\n\tint i;\n\t\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d %d\",&t,&n);\n\t\tif(t==1)t=6000;\n\t\tif(t==2)t=4000;\n\t\tif(t==3)t=3000;\n\t\tif(t==4)t=2000;\n\t\ta=t*n;\n\t\tprintf(\"%d\\n\",a);\n\t}\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n\tfor(int i=0 ; i<4 ; ++i){\n\t\tint t,n;\n\t\tcin >> t >> n;\n\t\tif(t==1){\n\t\t\tcout << 6000*n << endl;\n\t\t}else if(t==2){\n\t\t\tcout << 4000*n << endl;\n\t\t}else if(t==3){\n\t\t\tcout << 3000*n << endl;\n\t\t}else{\n\t\t\tcout << 2000*n << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "for i in range(4):\n ti,ni=map(int,input().split())\n if ti==1:\n print(ni*6000)\n if ti==2:\n print(ni*4000)\n if ti==3:\n print(ni*3000)\n if ti==4:\n print(ni*2000)\n \n", "#include<cstdio>\n\nint p[4]={6000,4000,3000,2000};\n\nint main(void){\n\tint t,n;\n\tfor(int i=0;i<4;i++){\n\t\tscanf(\"%d%d\",&t,&n);\n\t\tprintf(\"%d\\n\",p[t-1]*n);\n\t}\n\treturn 0;\n}", "#include<cstdio>\n\nint main(){\n int t,n,data[4] = {6000,4000,3000,2000};\n\n for(int i=0;i<4;i++){\n scanf(\"%d %d\",&t,&n);\n\n printf(\"%d\\n\",data[t-1]*n);\n }\n\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int t[5] = {0, 6000, 4000, 3000, 2000};\n for (int i = 0; i < 4; i++){\n int n, a;\n cin >> a >> n;\n cout << t[a] * n << endl;\n }\n\n return 0;\n}", "# coding: utf-8\n# Your code here!\n\nfor i in range(4):\n t,n=map(int,input().split())\n K = int()\n if t==1:\n K = 6000*n\n elif t==2:\n K = 4000*n\n elif t==3:\n K = 3000*n\n else:\n K = 2000*n\n print(K)\n", "for i in range(4):\n t,n = map(int,input().split())\n if t==1:\n kingaku=6000\n elif t==2:\n kingaku=4000\n elif t==3:\n kingaku=3000\n elif t==4:\n kingaku=2000\n print(n*kingaku)\n", "ticket_price = [0, 6000, 4000, 3000, 2000]\n\nif __name__ == \"__main__\":\n for i in range(4):\n sales = list(map(int, input().split()))\n print(\"{0}\".format(ticket_price[sales[0]] * sales[1]))\n\n ", "p = (0, 6000, 4000, 3000, 2000)\nfor i in range (4):\n a, n = map(int, input().split())\n print(p[a] * n)\n\n", "for i in range(4):\n t,n=map(int,input().split())\n if t==1:\n x=6000\n elif t==2:\n x=4000\n elif t==3:\n x=3000\n elif t==4:\n x=2000\n print(str(x*n))\n\n", "#include<stdio.h>\n\nint main() {\n int i;\n int n;\n int prices[] = {6000, 4000, 3000, 2000};\n\n for (i=0; i<4; i++) {\n int ind;\n unsigned long long int times;\n\n scanf(\"%d %llu\", &ind, &times);\n printf(\"%llu\\n\", prices[ind-1] * times);\n }\n}", "#include<iostream>\n#include<cstdio>\nusing namespace std;\nint main(){\n\tint a,b;\n\tfor(int i=0;i<4;i++){\n\t\tcin>>a>>b;\n\t\tif(a==1)cout<<b*6000<<endl;\n\t\tif(a==2)cout<<b*4000<<endl;\n\t\tif(a==3)cout<<b*3000<<endl;\n\t\tif(a==4)cout<<b*2000<<endl;\n\t}return 0;\n}", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(int i=0; i<4; i++){\n\t\t\tint a = sc.nextInt();\n\t\t\tint b = sc.nextInt();\n\t\t\tswitch(a){\n\t\t\tcase 1:\n\t\t\t\tSystem.out.println(b*6000);\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tSystem.out.println(b*4000);\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tSystem.out.println(b*3000);\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tSystem.out.println(b*2000);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n int t, n;\n int p[4] = {6000, 4000, 3000, 2000};\n for(int i = 0; i < 4; i++){\n cin >> t >> n;\n cout << p[t-1]*n << endl;\n }\n return 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int table[] = { 0, 6000, 4000, 3000, 2000 };\n for ( int i = 0; i < 4; i++ ) {\n int t, n;\n cin >> t >> n;\n cout << table[t] * n << endl;\n }\n return ( 0 );\n}\n\n", "import java.util.Scanner;\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tScanner sc = new Scanner(System.in);\n\tint kin=0;\n\n\tpublic void syori(){\n\t\tint ku = sc.nextInt();\n\t\tint su = sc.nextInt();\n\n\t\tswitch(ku){\n\t\tcase 1:\n\t\t\tkin = 6000 * su;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tkin = 4000 * su;\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tkin = 3000 * su;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tkin = 2000 * su;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\n\tpublic void out(){\n\t\tSystem.out.println(kin);\n\t}\n\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\n\t\tMain m = new Main();\n\n\t\tfor(int r=0;r<4;r++){\n\t\t\tm.syori();\n\t\t\tm.out();\n\t\t}\n\n\t}\n}", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n int t, n;\n int sales;\n int price[] = { 6000, 4000, 3000, 2000 };\n \n for (int i = 0; i < 4; i++) {\n cin >> t >> n;\n sales = price[t - 1] * n;\n cout << sales << endl;\n }\n}\n\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tfor(int i=0;i<4;i++){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\tif(a==1){\n\t\t\tcout<<b*6000<<endl;\n\t\t}\n\t\tif(a==2){\n\t\t\tcout<<b*4000<<endl;\n\t\t}\n\t\tif(a==3){\n\t\t\tcout<<b*3000<<endl;\n\t\t}\n\t\tif(a==4){\n\t\t\tcout<<b*2000<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\t\t\n\n", "import java.util.Scanner;\npublic class Main {\nScanner sc = new Scanner(System.in);\n int go;\n public void solve(){\n int shu=sc.nextInt();\n int kaz=sc.nextInt();\n switch(shu) {\n case 1:\n go=6000*kaz;\n break;\n case 2:\n go=4000*kaz;\n break;\n case 3:\n go=3000*kaz;\n break;\n case 4:\n go=2000*kaz;\n break;\n }\n }\n public void out(){\n System.out.println(go);\n }\n public static void main(String[] args){\n Main obj=new Main();\n for(int a=1;a<=4;a++){\n obj.solve();\n obj.out();\n }\n}\n}\n ", "c = [6000, 4000, 3000, 2000]\nfor i in range(0,4):\n a, b = map(int, raw_input().split())\n print c[a-1] * b", "#include <iostream>\nusing namespace std;\nint main(void){\n int p[4] = {6000,4000,3000,2000};\n int t,n;\n for(int i = 0 ; i < 4 ; i++){\n cin >> t >> n;\n cout << p[t-1]*n <<endl;\n }\n return 0;\n }\n", "#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nint main(){\n\tint a[4] = {6000, 4000, 3000, 2000}, b, c;\n\tfor (int i = 0; i < 4; i++){\n\t\tscanf(\"%d%d\", &b, &c);\n\t\tprintf(\"%d\\n\", a[b-1]*c);\n\t}\nreturn 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int price[] = {6000, 4000, 3000, 2000};\n\n for (int i=0; i<4; i++)\n {\n int t, n;\n cin>>t>>n;\n cout<<price[t-1]*n<<endl;\n }\n}", "//2706 石井夏鈴 問5\nimport java.util.Scanner;\npublic class Main{\n\tint n,t;\n\tint a=0;\n\tint ti[]={0,6000,4000,3000,2000};\n\t\n public void solve(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(int i=1;i<=4;i++){\n\t\t\tt=sc.nextInt();\n\t\t\tn=sc.nextInt();\n\t\t\ta=ti[t]*n;\n System.out.println(a);\n\t\t}\n\t}\n public static void main(String[] args){\n \tMain obj=new Main();\n\tobj.solve();\n }\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\n\tint a, b;\n\tfor(int i=0;i<4;i++){\n\tcin>>a>>b;\n\tif(a == 1) cout<<6000 * b<<endl;\n\tif(a == 2) cout<<4000 * b<<endl;\n\tif(a == 3) cout<<3000 * b<<endl;\n\tif(a == 4) cout<<2000 * b<<endl;\n\t}\n\treturn 0;\n}\n\n", "a1,b1=map(int,input().split())\na2,b2=map(int,input().split())\na3,b3=map(int,input().split())\na4,b4=map(int,input().split())\n\nif a1==1:\n d1=6000\nif a1==2:\n d1=4000\nif a1==3:\n d1=3000\nif a1==4:\n d1=2000\n \nc1=d1*b1\n\nif a2==1:\n d2=6000\nif a2==2:\n d2=4000\nif a2==3:\n d2=3000\nif a2==4:\n d2=2000\n \nc2=d2*b2\n\nif a3==1:\n d3=6000\nif a3==2:\n d3=4000\nif a3==3:\n d3=3000\nif a3==4:\n d3=2000\n \nc3=d3*b3\n\nif a4==1:\n d4=6000\nif a4==2:\n d4=4000\nif a4==3:\n d4=3000\nif a4==4:\n d4=2000\n \nc4=d4*b4\n\nprint(c1)\nprint(c2)\nprint(c3)\nprint(c4)\n\n\n", "import java.util.Scanner;\nclass Main\n{\npublic static void main(String args[])\n{\nScanner scan=new Scanner(System.in);\nint s[]=new int[4];\nfor(int i=0;i<4;i++)\n{\nint t=scan.nextInt();\nint n=scan.nextInt();\nif(t==1)s[i]+=6000*n;\nif(t==2)s[i]+=4000*n;\nif(t==3)s[i]+=3000*n;\nif(t==4)s[i]+=2000*n;\n}\nfor(int i=0;i<4;i++)\n{\nSystem.out.println(s[i]);\n}\n}\n}", "#include <iostream>\n\nusing namespace std;\n\nint price[4] = {6000, 4000, 3000, 2000};\n\nint main()\n{\n int t, n;\n for (int i = 0; i < 4; i++) {\n cin >> t >> n;\n cout << price[t - 1] * n << endl;\n }\n\n return 0;\n}", "S=6000\nA=4000\nB=3000\nC=2000\n\nfor k in range(4):\n i,z=map(int,input().split())\n if i==1:\n print(f\"{S*z}\")\n elif i==2:\n print(f\"{A*z}\")\n elif i==3:\n print(f\"{B*z}\")\n elif i==4:\n print(f\"{C*z}\")\n", "#include <iostream>\nusing namespace std;\n\nint ticket[4] = {6000, 4000, 3000, 2000};\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tfor(int i = 0; i < 4; ++i){\n\t\tint t, n;\n\t\tcin >> t >> n;\n\t\t--t;\n\t\tcout << ticket[t] * n << endl;\n\t}\n\n\treturn 0;\n}", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint P[4] = { 6000, 4000, 3000, 2000 };\n\n\tint t[4], n[4];\n\n\tfor (int i = 0; i < 4; i++)\n\t{\n\t\tcin >> t[i] >> n[i];\n\t}\n\n\tfor (int i = 0; i < 4; i++)\n\t{\n\t\tcout << P[t[i] - 1] * n[i] << endl;\n\t}\n\n\treturn 0;\n}", "import java.util.Scanner;\npublic class Main{\n\tint kin[]={6000,4000,3000,2000};\n\tint syu;\n\tint mai;\n\tint gokei;\n\t\n\tpublic void solve(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(int i=0;i<=3;i++){\n\t\t\tsyu = sc.nextInt();\n\t\t\tmai = sc.nextInt();\n\t\t\tsyu = syu-1;\n\t\t\tgokei = mai*kin[syu];\n\t\t\tSystem.out.println(gokei);\n\t\t}\n\t}\n\t\n public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "#include <iostream>\nusing namespace std;\n\nint v[] = {6000, 4000, 3000, 2000};\n\nint main() {\n\tfor (int i = 0; i < 4; i++) {\n\t\tint t, n;\n\t\tcin >> t >> n;\n\t\tcout << n * v[t - 1] << endl;\n\t}\n\treturn 0;\n}", "i=1\nwhile i<5:\n t_i,n_i=map(int,input().split())\n if t_i==1:a=n_i*6000\n if t_i==2:a=n_i*4000\n if t_i==3:a=n_i*3000\n if t_i==4:a=n_i*2000\n print(a)\n i=i+1\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int T[] = {-1, 6000, 4000, 3000, 2000};\n\nint main()\n{\n\tfor (int i = 0; i < 4; i++){\n\t\tint t, n;\n\t\tcin >> t >> n;\n\t\tcout << T[t] * n << endl;\n\t}\n\t\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint[][] a = new int[4][4];\n\t\tfor(int i = 0; i < 4; i++) {\n\t\t\ta[i][0] = stdIn.nextInt();\n\t\t\ta[i][1] = stdIn.nextInt();\n\t\t}\n\t\tfor(int i = 0; i< 4; i++) {\n\t\t\tswitch(a[i][0]) {\n\t\t\tcase 1: System.out.println(a[i][1] * 6000);break;\n\t\t\tcase 2: System.out.println(a[i][1] * 4000);break;\n\t\t\tcase 3: System.out.println(a[i][1] * 3000);break;\n\t\t\tcase 4: System.out.println(a[i][1] * 2000);break;\n\t\t\t}\n\t\t}\n\t}\n\t\t\n}", "import java.util.*;\nclass Main{\n int t;\n int n;\n \n Main(){\n\tScanner sc=new Scanner(System.in);\n\tfor(int i=1; i<5; i++){\n\t t=sc.nextInt();\n\t n=sc.nextInt();\n\t if(t==1){\n\t\tSystem.out.println(6000*n);\n\t }else if(t==2){\n\t\tSystem.out.println(4000*n);\n\t }else if(t==3){\n\t\tSystem.out.println(3000*n);\n\t }else if(t==4){\n\t\tSystem.out.println(2000*n);\n\t }\n\t\t\t \n\t}\n\n }\n\n public static void main(String[] args){\n\tnew Main();\n }\n}", "# Aizu Problem 0277: Ticket Sale\n\nimport sys, math, os, datetime\n\n# read input:\nPYDEV = os.environ.get('PYDEV')\nif PYDEV==\"True\":\n sys.stdin = open(\"sample-input.txt\", \"rt\")\n\n\nprice = {1: 6000, 2: 4000, 3: 3000, 4: 2000}\nfor k in range(4):\n t, n = [int(_) for _ in input().split()]\n print(n * price[t])", "for i in range(4):\n a,b=map(int,input().split())\n \n if a==1:\n print(b*6000)\n elif a==2:\n print(b*4000)\n elif a==3:\n print(b*3000)\n elif a==4:\n print(b*2000)\n \n", "data=[list(map(int,input().split())) for _ in range(4)]\nn=0\nwhile n<4:\n a=data[n][0]\n b=data[n][1]\n if a==1:\n print(6000*b)\n n+=1\n if a==2:\n print(4000*b)\n n+=1\n if a==3:\n print(3000*b)\n n+=1\n if a==4:\n print(2000*b)\n n+=1\n", "t1,n1 = map(int,input().split())\nt2,n2 = map(int,input().split())\nt3,n3 = map(int,input().split())\nt4,n4 = map(int,input().split())\nif t1 == 1:\n print(n1*6000)\nelif t1 ==2:\n print(n1*4000)\nelif t1 ==3:\n print(n1*3000)\nelif t1 ==4:\n print(n1*2000)\nelse:\n pass\nif t2 == 1:\n print(n2*6000)\nelif t2 ==2:\n print(n2*4000)\nelif t2 ==3:\n print(n2*3000)\nelif t2 ==4:\n print(n2*2000)\nelse:\n pass\nif t3 == 1:\n print(n3*6000)\nelif t3 ==2:\n print(n3*4000)\nelif t3 ==3:\n print(n3*3000)\nelif t3 ==4:\n print(n3*2000)\nelse:\n pass\nif t4 == 1:\n print(n4*6000)\nelif t4 ==2:\n print(n4*4000)\nelif t4 ==3:\n print(n4*3000)\nelif t4 ==4:\n print(n4*2000)\nelse:\n pass\n", "for i in range(4):\n a,b=map(int,input().split())\n if a==1:\n print(6000*b)\n if a==2:\n print(4000*b)\n if a==3:\n print(3000*b)\n if a==4:\n print(2000*b)\n\n", "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tnew Main().run();\n\t}\n\n\tprivate void run() {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tint a = scanner.nextInt() - 1;\n\t\t\tint b = scanner.nextInt();\n\t\t\tSystem.out.println(ticket[a] * b);\n\t\t}\n\t}\n\n\tint[] ticket = { 6000, 4000, 3000, 2000, };\n}", "import sys\nf = sys.stdin\n\nvalues = [None,6000,4000,3000,2000]\nfor line in f:\n t, n = map(int, line.split())\n print(values[t] * n)", "#include<iostream>\nusing namespace std;\n\nint main(){\n\n int d[] = {6000,4000,3000,2000};\n int m,n;\n\n for(int i=0;i<4;i++){\n cin >> m >> n;\n cout << d[m-1]*n << endl;\n }\n\n}", "price=[6000,4000,3000,2000]\nfor _ in range(4):\n t,n=map(int,input().split())\n print(price[t-1]*n)\n", "import java.util.Scanner;\n class Main{\n\t\tpublic static void main(String[] args) {\n\t\t\tScanner sc = new Scanner(System.in);\n\t\t\tint nban,nsyu;\n\t\t\tfor(int i = 0; i<4; i++){\n\t\t\t\tnsyu = sc.nextInt();\n\t\t\t\tnban = sc.nextInt();\n\t\t\t\tswitch (nsyu){\n\t\t\t\tcase 1: System.out.println(nban*6000);break;\n\t\t\t\tcase 2: System.out.println(nban*4000);break;\n\t\t\t\tcase 3: System.out.println(nban*3000);break;\n\t\t\t\tcase 4: System.out.println(nban*2000);break;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t}", "r={1:6,2:4,3:3,4:2}\nfor i in [1]*4:\n\tt,n=map(int,raw_input().split())\n\tprint r[t]*n*1000", "#include<iostream>\nusing namespace std;\nint s[5] = { 0,6000,4000,3000,2000 };\nint a, b;\nint main() {\n\tfor (int i = 0; i < 4; i++) {\n\t\tcin >> a >> b;\n\t\tcout << s[a] * b << endl;\n\t}\n}", "//2701 青木沙采 問２\nimport java.util.Scanner;\npublic class Main{\n\t\n\tpublic void solve(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ninzu,k;\n\t\tint ban;\n\t\tfor(int i=0;i<4;i++){\n\t\t\tban = sc.nextInt();\n\t\t\tif(ban == 1){\n\t\t\t\tk = 6000;\n\t\t\t}else if(ban == 2){\n\t\t\t\tk = 4000;\n\t\t\t}else if(ban == 3){\n\t\t\t\tk = 3000;\n\t\t\t}else{\n\t\t\t\tk = 2000;\n\t\t\t}\n\t\t\tninzu = sc.nextInt();\n\t\t\tint uriage = k * ninzu;\n\t\t\tSystem.out.println(uriage);\n\t\t}\n\t}\n\tpublic static void main(String[] args){\n\t\tMain obj = new Main();\n\t\tobj.solve();\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(void){\n\tint a,b;\n\tint sum;\n\tint i;\n\tfor(i=0;i<4;i++){\n\t\tcin>>a>>b;\n\t\tif(a==1){\n\t\t\tcout<<b*6000<<endl;\n\t\t}\n\t\telse if(a==2){\n\t\t\tcout<<b*4000<<endl;\n\t\t}\n\t\telse if(a==3){\n\t\t\tcout<<b*3000<<endl;\n\t\t}\n\t\telse{\n\t\t\tcout<<b*2000<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\t\t\t\n", "# coding: utf-8\n# Your code here!\n\nticket = {1:6000, 2:4000, 3:3000, 4:2000}\nfor i in range(4):\n\tt, n = map(int, input().split())\n\tprint(ticket[t]*n)\n", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nconst int MoneyTable[] = { 0,6000,4000,3000,2000 };\n\nint main() {\n\tint t, n;\n\n\tfor (int i = 0; i < 4; ++i) {\n\t\tcin >> t >> n;\n\t\tcout << (n*MoneyTable[t]) << endl;\n\t}\n\t\n\treturn 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;\n for(int i=0;i<4;i++){\n cin >> a >> b;\n if(a == 1) cout << 6000*b << endl;\n if(a == 2) cout << 4000*b << endl;\n if(a == 3) cout << 3000*b << endl;\n if(a == 4) cout << 2000*b << endl;\n }\n return (0);\n}\n\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint kane[] = {0,6000,4000,3000,2000};\n\tfor(int i = 0; i < 4; i++){\n\t\tint t,n,sum = 0;\n\t\tcin >> t >> n;\n\t\tsum += kane[t] * n;\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}", "#include<stdio.h>\nint main(void){\n\tint t,n,a[]={6000,4000,3000,2000},i,x[10];\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d%d\",&t,&n);\n\t\tx[i]=a[t-1]*n;\n\t}\n\tfor(i=0;i<4;i++) printf(\"%d\\n\",x[i]);\n\treturn 0;\n}", "#include<cstdio>\nusing namespace std;\nint main(void)\n{\n\tint nedan[5]={0,6000,4000,3000,2000};\n\tint t,n;\n\tint kin,i;\n\n\tfor(i=0;i<4;i++)\t{\n\t\tscanf(\"%d %d\",&t,&n);\n\t\tkin=nedan[t]*n;\n\t\tprintf(\"%d\\n\",kin);\n\t}\n\treturn 0;\n}\n", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\n\t\tint a[] = { 6000, 4000, 3000, 2000 };\n\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile (sc.hasNext()) {\n\t\t\tint t = sc.nextInt();\n\t\t\tint n = sc.nextInt();\n\t\t\tSystem.out.println(a[t - 1] * n);\n\t\t}\n\t}\n}", "//2714　加藤聖弥 問2\nimport java.util.Scanner;\npublic class Main{\n int [] seki={0,6000,4000,3000,2000};\n int t;\n int n;\n int k;\n int kin;\n \n public void solve(){\n Scanner sc=new Scanner(System.in);\n k=0;\n while(k<4){\n t=sc.nextInt();\n n=sc.nextInt();\n kin =seki[t]*n;\n System.out.println(kin);\n k+=1;\n }\n }\n \n public static void main(String[] args){\n Main obj=new Main();\n obj.solve();\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\t\n\tScanner sc = new Scanner(System.in);\n\tint kane;\n\tint[] kingaku = new int [4];\n\tint n;\n\t\n\tpublic void syurui(){\n\t\t\n\t\tfor(n = 0;n <= 3;n++){\n\t\tint syurui = sc.nextInt();\n\t\tint maisu = sc.nextInt();\n\n\t\tswitch(syurui){\n\t\t\tcase 1:\n\t\t\t\tkane = 6000;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tkane = 4000;\n\t\t\t\tbreak;\n\t\t\tcase 3 :\n\t\t\t\tkane = 3000;\n\t\t\t\tbreak;\n\t\t\tcase 4 :\n\t\t\t\tkane = 2000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tkingaku[n] = kane * maisu;\n\t\t}\n\t}\n\tpublic void hyouji(){\n\t\tfor(n = 0;n <= 3;n++){\n\t\t\tSystem.out.println(kingaku[n]);\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tMain toi = new Main();\n\t\ttoi.syurui();\n\t\ttoi.hyouji();\n\t\t\n\t}\n\n}", "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int a[4], b, c, n = 4;\n a[0] = 6000;\n a[1] = 4000;\n a[2] = 3000;\n a[3] = 2000;\n\n while( n-- )\n {\n cin >> b >> c;\n cout << a[b-1] * c << endl;\n }\n\n return 0;\n}\n", "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int>P;\n\nint main() {\n\tint k[] = { 6000,4000,3000,2000 };\n\trep(i, 4) {\n\t\tint a, b; cin >> a >> b;\n\t\tcout << k[--a] * b << endl;\n\t}\n}", "x, a=map(int,input().split())\ny, b=map(int,input().split())\nz, c=map(int,input().split())\nr, d=map(int,input().split())\n\nif x==2 or x==4:\n t=8000//x*a\n print(t)\nelif x==1:\n t=6000*a\n print(t)\n\nelse:\n t=3000*a\n print(t)\n \nif y==2 or y==4:\n t=8000//y*b\n print(t)\nelif y==1:\n t=6000*b\n print(t)\n\nelse:\n t=3000*b\n print(t)\n \nif z==2 or z==4:\n t=8000//z*c\n print(t)\nelif z==1:\n t=6000*c\n print(t)\n\nelse:\n t=3000*c\n print(t)\n \n\nif r==2 or r==4:\n t=8000//r*d\n print(t)\nelif r==1:\n t=6000*d\n print(t)\n\nelse:\n t=3000*d\n print(t)\n\n", "import java.util.Scanner;\npublic class Main{\n\t\n public void solve(){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint hito,i,ban,uriage;\n\t\tfor(int a=0; a<4;a++){\n\t\t\tban=sc.nextInt();\n\t\t\tif(ban==1){\n\t\t\t\ti=6000;\n\t\t\t\t}else if(ban ==2){\n\t\t\t\t\ti=4000;\n\t\t\t\t}else if(ban ==3){\n\t\t\t\t\ti=3000;\n\t\t\t\t}else{\n\t\t\t\t\ti=2000;\n\t\t\t\t}\n\t\t\t\thito=sc.nextInt();\n\t\t\t\turiage=i*hito;\n\t\t\t\tSystem.out.println(uriage);\n\t\t\n\t\t\t }\n }\n public static void main(String[] args){\n Main obj = new Main(); \n obj.solve(); \n }\n}", "import java.util.Scanner;\n\nclass Main{\n int tiket[]={0,6000,4000,3000,2000};\n\t\tint t,n,uriage;\n \n public void solve(){\n Scanner sc=new Scanner(System.in);\n\t\t\n for(int i=1;i<=4;i++){\n\t\tt=sc.nextInt();\n\t\tn=sc.nextInt();\n\t uriage=tiket[t]*n;\n\t\tSystem.out.println(uriage);\n }\n }\n\tpublic static void main(String[]args){\n\t\tMain obj=new Main();\n\t\tobj.solve();\n\t}\n}", "\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int t1 = scanner.nextInt();\n int n1 = scanner.nextInt();\n int c1 = 0;\n int t2 = scanner.nextInt();\n int n2 = scanner.nextInt();\n int c2 = 0;\n int t3 = scanner.nextInt();\n int n3 = scanner.nextInt();\n int c3 = 0;\n int t4 = scanner.nextInt();\n int n4 = scanner.nextInt();\n int c4 = 0;\n if (t1 == 1) {\n c1 = 6000 * n1;\n } else if (t1 == 2) {\n c1 = 4000 * n1;\n } else if (t1 == 3) {\n c1 = 3000 * n1;\n } else {\n c1 = 2000 * n1;\n }\n if (t2 == 1) {\n c2 = 6000 * n2;\n } else if (t2 == 2) {\n c2 = 4000 * n2;\n } else if (t2 == 3) {\n c2 = 3000 * n2;\n } else {\n c2 = 2000 * n2;\n }\n if (t3 == 1) {\n c3 = 6000 * n3;\n } else if (t3 == 2) {\n c3 = 4000 * n3;\n } else if (t3 == 3) {\n c3 = 3000 * n3;\n } else {\n c3 = 2000 * n3;\n }\n if (t4 == 1) {\n c4 = 6000 * n4;\n } else if (t4 == 2) {\n c4 = 4000 * n4;\n } else if (t4 == 3) {\n c4 = 3000 * n4;\n } else {\n c4 = 2000 * n4;\n }\n System.out.println(c1);\n System.out.println(c2);\n System.out.println(c3);\n System.out.println(c4);\n }\n}\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint cla,yen;\n\tfor(int i=0;i<4;i++){\n\tcin>>cla>>yen;\n\tif(cla==1){\n\tcout<<6000*yen<<endl;\n\t}else if(cla==2){\n\tcout<<4000*yen<<endl;\n\t}else if(cla==3){\n\tcout<<3000*yen<<endl;\n\t}else if(cla==4){\n\tcout<<2000*yen<<endl;\n\t}\n\t}\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\nint tt[]={0,6000,4000,3000,2000};\nint main(){\n\tint t,n;\n\twhile(cin >> t >> n){\n\t\tcout << tt[t]*n << endl;\n\t}\n}", "#include<stdio.h>\nint main(void)\n{\n\tint a,b,n,i;\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d %d2\",&a,&b);\n\t\tif(a==1) n=b*6000;\n\t\tif(a==2) n=b*4000;\n\t\tif(a==3) n=b*3000;\n\t\tif(a==4) n=b*2000;\n\t\tprintf(\"%d\\n\",n);\n\t}\n\treturn 0;\n}", "P = [0,6000,4000,3000,2000]\nfor i in range(4):\n t,n = map(int,input().split())\n print(n*P[t])\n", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[] t= {6000,4000,3000,2000};\n for(int i=0;i<4;i++) {\n System.out.println(t[sc.nextInt()-1]*sc.nextInt());\n }\n }\n}\n", "dic = {1:6000, 2:4000, 3:3000, 4:2000}\nfor _ in range(4):\n t, n = map(int, input().split())\n print(dic[t] * n)\n", "while True:\n try:\n a=list(map(int,input().split()))\n #listA<-[1,2,2,3,1]\n #ここに逐次処理を書けばいいと思う。\n if a[0]==1:\n print(a[-1]*6000)\n elif a[0]==2:\n print(a[-1]*4000)\n elif a[0]==3:\n print(a[-1]*3000)\n else:\n print(a[-1]*2000)\n \n except:\n break;\n", "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\t\n\tint d[4]={0};\n\tint r[4]={6000,4000,3000,2000};\n\t\n\tfor(int i=0;i<4;i++){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\td[a-1]=b;\n\t\tcout<<d[a-1]*r[a-1]<<endl;\n\t}\n\t\n\t\n\treturn 0;\n}\n", "import java.util.Scanner;\n class Main{\n \t\n\t\n\tpublic void solve(){\n\t\tScanner sc =new Scanner(System.in);\n\t int ban,hito,uriage,i;\n\t\tfor(int b=0;b<4;b++){\n\t\t\tban=sc.nextInt();\n\t\t\tif(ban==1){\n\t\t\t\ti=6000;\n\t\t\t}else if(ban==2){\n\t\t\t\ti=4000;\n\t\t\t}else if(ban==3){\n\t\t\t\ti=3000;\n\t\t\t}else{\n\t\t\t\ti=2000;\n\t\t\t}\n\t\t\thito=sc.nextInt();\n\t\t\turiage=i*hito;\n\t\t\tSystem.out.println(uriage);\n\t\t}\n\t}\n\tpublic static void main(String[] args){\n\t\tMain obj = new Main();\n\t\tobj.solve();\n\t}\n }\n\t", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint[] value = {0,6000,4000,3000,2000};\n\t\twhile(stdIn.hasNext())\n\t\t\tSystem.out.println(value[stdIn.nextInt()]*stdIn.nextInt());\n\t}\n}", "#include <stdio.h>\n\nint main(void) {\n int type, num;\n int price[4] = {6000, 4000, 3000, 2000};\n while(scanf(\"%d %d\\n\", &type, &num) == 2) {\n printf(\"%d\\n\", price[type-1]*num);\n };\n}", "#include<stdio.h>\nint main()\n{\nint S=6000,A=4000,B=3000,C=2000,a,b,i;\nfor(i=0;i<4;i++){\nscanf(\"%d %d\",&a,&b);\nif(a==1){\nS=S*b;\nprintf(\"%d\\n\",S);\n}else if(a==2){\nA=A*b;\nprintf(\"%d\\n\",A);\n}else if(a==3){\nB=B*b;\nprintf(\"%d\\n\",B);\n}else if(a==4){\nC=C*b;\nprintf(\"%d\\n\",C);\n}\n}\nreturn(0);\n}\n", "#include <cstdio>\n\nint a[4] = {6000, 4000, 3000, 2000};\n\nint main(){\n\tfor(int i = 0; i < 4; i++){\n\t\tint t, n; scanf(\"%d%d\", &t, &n);\n\t\tt--;\n\t\tprintf(\"%d\\n\", a[t]*n);\n\t}\n}", "price=[6000,4000,3000,2000]\nfor i in range(4):\n a,b=map(int,input().split())\n print(price[a-1]*b)\n", "#include <iostream>\nusing namespace std;\nint main(void){\n // Your code here!\n int e,y;\n for(int a=1;a<=4;a++){\n cin>>e>>y;\n if(e==1){cout<<6000*y<<endl;}\n else if(e==2){cout<<4000*y<<endl;}\n else if(e==3){cout<<3000*y<<endl;}\n else if(e==4){cout<<2000*y<<endl;}\n}\n}\n\n", "#include <cstdio>\nusing namespace std;\nint main(void){\n int c[] = {0, 6000, 4000, 3000, 2000};\n int t, p;\n for (int i = 0; i < 4; i++) {\n scanf(\"%d %d\", &t, &p);\n printf(\"%d\\n\", c[t]*p);\n }\n return 0;\n}\n\n", "a,A=map(int,input().split())\nb,B=map(int,input().split())\nc,C=map(int,input().split())\nd,D=map(int,input().split())\n\n\nif (a == 1):\n print(A*6000)\nelif (a == 2):\n print(A*4000)\nelif (a == 3):\n print(A*3000)\nelif (a == 4):\n print(A*2000)\n\n\nif (b == 1):\n print(B*6000)\nelif (b == 2):\n print(B*4000)\nelif (b == 3):\n print(B*3000)\nelif (b == 4):\n print(B*2000)\n\n\nif (c == 1):\n print(C*6000)\nelif (c == 2):\n print(C*4000)\nelif (c == 3):\n print(C*3000)\nelif (c == 4):\n print(C*2000)\n\n\nif (d == 1):\n print(D*6000)\nelif (d == 2):\n print(D*4000)\nelif (d == 3):\n print(D*3000)\nelif (d == 4):\n print(D*2000)\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int ans[10]={0},mm[5]={0,6000,4000,3000,2000};\n for(int i=0;i<4;i++){\n int t,n;\n cin>>t>>n;\n ans[i]=mm[t]*n;\n }\n for(int i=0;i<4;i++){\n cout<<ans[i]<<endl;\n }\n return 0;\n }", "# coding: utf-8\n# Your code here!\nt1,n1=map(int,input().split())\nt2,n2=map(int,input().split()) \nt3,n3=map(int,input().split())\nt4,n4=map(int,input().split())\nif t1==1:\n print(6000*n1)\nif t1==2:\n print(4000*n1)\nif t1==3:\n print(3000*n1)\nif t1==4:\n print(2000*n2)\n\nif t2==1:\n print(6000*n2)\nif t2==2:\n print(4000*n2)\nif t2==3:\n print(3000*n2)\nif t2==4:\n print(2000*n2)\n \nif t3==1:\n print(6000*n3)\nif t3==2:\n print(4000*n3)\nif t3==3:\n print(3000*n3)\nif t3==4:\n print(2000*n3)\n \nif t4==1:\n print(6000*n4)\nif t4==2:\n print(4000*n4)\nif t4==3:\n print(3000*n4)\nif t4==4:\n print(2000*n4)\n", "import java.util.Scanner;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\t\n\tint kingaku;\n\tint[] goukei = new int[4];\n\tint n;\n\t\n\tpublic void syurui(){\n\t\t\n\t\tfor(n=0;n<=3;n++){\n\t\tint syurui = sc.nextInt();\n\t\tint maisuu = sc.nextInt();\n\t\t\n\t\t\tswitch (syurui){\n\t\t\t\tcase 1: kingaku = 6000;break;\n\t\t\t\tcase 2: kingaku = 4000;break;\n\t\t\t\tcase 3: kingaku = 3000;break;\n\t\t\t\tcase 4: kingaku = 2000;break;\n\t\t\t}\t\n\t\t\t\n\t\tgoukei[n] = kingaku * maisuu;\n\t\t}\n\t}\n\t\n\tpublic void hyouji(){\n\t\tfor(n=0;n<=3;n++){\n\t\t\tSystem.out.println(goukei[n]);\n\t\t}\n\t\t\n\t}\n\t\n\tpublic static void main(String[] args) {\n Main uriage= new Main();\n uriage.syurui();\n uriage.hyouji();\n \n \n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main (){\n int i,a,b,x;\n for( i = 1; i <= 4; i++ ){\n cin >> a >> b;\n if( a==1 ) x=b*6000;\n else if( a==2 ) x=b*4000;\n else if( a==3 ) x=b*3000;\n else if( a==4 ) x=b*2000;\n cout << x <<endl;\n }\n return 0;\n}\n\n", "#include <cstdio>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint main(){\n\tint p[]={6000,4000,3000,2000};\n\trep(_,4){\n\t\tint a,b; scanf(\"%d%d\",&a,&b);\n\t\tprintf(\"%d\\n\",p[a-1]*b);\n\t}\n\treturn 0;\n}", "for i in range(1,5):\n \n t_i,n_i=map(int,input().split())\n\n if t_i==1:\n print(n_i*6000)\n if t_i==2:\n print(n_i*4000)\n if t_i==3:\n print(n_i*3000)\n if t_i==4:\n print(n_i*2000)\n", "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main(){\n\tint a,b;\n\tint ticket[4] = {6000,4000,3000,2000};\n\tfor(int i=0;i<4;i++){\n\t\tcin >> a >> b;\n\t\tcout << ticket[a-1]*b << endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\nint main(){\n\tint a,b;\n\tfor(int i=0;i<4;++i){\n\t\tstd::cin>>a>>b;\n\t\tint m=0;\n\t\tif(a==1)m=6000;\n\t\telse if(a==2)m=4000;\n\t\telse if(a==3)m=3000;\n\t\telse m=2000;\n\t\tstd::cout<<b*m<<std::endl;\n\t}\n}", "import java.util.Scanner;\npublic class Main{\n \n public void solve(){\n Scanner sc = new Scanner(System.in);\n int t;\n int n;\n for(int i=0;i<4;i++){\n t=sc.nextInt();\n n=sc.nextInt();\n if(t==1){\n System.out.println(6000*n);\n }else if(t==2){\n System.out.println(4000*n);\n }else if(t==3){\n System.out.println(3000*n);\n }else if(t==4){\n System.out.println(2000*n);\n }\n }\n }\n \n \n public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "x=[0,6000,4000,3000,2000]\nfor i in range(1,5):\n t,n=map(int,input().split())\n print(n*x[t])\n", "P = [ 6000, 4000, 3000, 2000]\n\nwhile True:\n try:\n t, num = [int(x) for x in input().split()]\n except:\n break\n \n print(P[t-1]*num)\n", "for i in range(4):\n t1,n1=map(int,input().split())\n if t1==1:\n print(n1*6000)\n elif t1==2:\n print(n1*4000)\n elif t1==3:\n print(n1*3000)\n elif t1==4:\n print(n1*2000)\n \n", "for i in range(4):\n t,n=map(int,input().split())\n if t == 1:\n print(n*6000)\n if t == 2:\n print(n*4000)\n if t == 3:\n print(n*3000)\n if t == 4:\n print(n*2000)\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n int t, n;\n int V[5] = {0, 6000, 4000, 3000, 2000};\n int F[5] = {0, 0, 0, 0, 0};\n\n for ( int i = 0; i < 4; i++ ){\n cin >> t >> n;\n cout << V[t]*n << endl;\n }\n}", "\nimport java.util.Scanner;\n\npublic class Main\n{\n\n public static void main(String[] args)\n {\n Scanner scan = new Scanner(System.in);\n for (int i = 0; i != 4; i++) {\n int t = scan.nextInt();\n int n = scan.nextInt();\n switch (t) {\n case 1:\n System.out.println(n * 6000);\n break;\n case 2:\n System.out.println(n * 4000);\n\n break;\n\n case 3:\n System.out.println(n * 3000);\n\n break;\n\n case 4:\n System.out.println(n * 2000);\n\n break;\n\n }\n }\n }\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint t[4] = {6000, 4000, 3000, 2000};\n\nint main(){\n for(int x = 0; x < 4; x++){\n int a, b;\n scanf(\"%d%d\", &a, &b);\n printf(\"%d\\n\", t[--a]*b);\n }\n return 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tint t = sc.nextInt();\n\t\t\tint n = sc.nextInt();\n\t\t\tif (t == 1) {\n\t\t\t\tSystem.out.println(n * 6000);\n\t\t\t} else if (t == 2) {\n\t\t\t\tSystem.out.println(n * 4000);\n\t\t\t} else if (t == 3) {\n\t\t\t\tSystem.out.println(n * 3000);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(n * 2000);\n\t\t\t}\n\t\t}\n\t\tsc.close();\n\t}\n}", "#include<cstdio>\n\nconst int p[] = { 6000, 4000, 3000, 2000 };\n\nint main()\n{\n\tfor( int i = 0; i != 4; ++i )\n\t{\n\t\tint t, n;\n\t\tscanf( \"%d%d\", &t, &n );\n\t\tprintf( \"%d\\n\", p[t-1]*n );\n\t}\n\n\treturn 0;\n}", "L = [6000,4000,3000,2000]\nfor i in range(4):\n t,n = map(int,input().split())\n print(L[t-1]*n)\n", "\nt1,n1=map(int,input().split())\nt2,n2=map(int,input().split())\nt3,n3=map(int,input().split())\nt4,n4=map(int,input().split())\n\nI=[t1,n1,t2,n2,t3,n3,t4,n4]\ni=0\nwhile i<8:\n if I[i]==1:\n print(6000*I[i+1])\n elif I[i]==2:\n print(4000*I[i+1])\n elif I[i]==3:\n print(3000*I[i+1])\n else:\n print(2000*I[i+1])\n i=i+2\n", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int ll;\n\nint main(){\n\tint x[]={6,4,3,2};\n\tfor(int i=0;i<4;i++){\n\t\tint a,b; cin >> a >> b;\n\t\tcout << x[a-1]*1000*b << endl;\n\t}\n}\n", "#include<stdio.h>\nint main(void)\n{\n\t\tint t,n,x[4],i,j;\n\t\tfor(i=0;i<4;i++){\n\t\t\tscanf(\"%d %d\",&t,&n);\n\t\tif(t==1){\n\t\t\tx[i]=n*6000;\n\t\t\t}\n\t\tif(t==2){\n\t\t\tx[i]=n*4000;\n\t\t\t}\n\t\tif(t==3){\n\t\t\tx[i]=n*3000;\n\t\t\t}\n\t\tif(t==4){\n\t\t\tx[i]=n*2000;\n\t\t\t}\n\t\t}\t\n\t\tfor(j=0;j<4;j++){\n\t\t\tprintf(\"%d\\n\",x[j]);\n\t\t\t}\n\t\treturn 0;\n}\t", "#include <cstdio>\n\nconst int seat[4]{ 6000, 4000, 3000, 2000 };\n\nint t, n;\n\nint main()\n{\n\tfor (int i = 0; i < 4; i++)\n\t{\n\t\tscanf(\"%d\", &t);\n\t\tscanf(\"%d\", &n);\n\n\t\tprintf(\"%d\\n\", seat[t - 1] * n);\n\t}\n\n\treturn 0;\n}", "for i in range (4):\n t,n=map(int,input().split())\n if t==1:\n print(6000*n)\n if t==2:\n print(4000*n)\n if t==3:\n print(3000*n)\n if t==4:\n print(2000*n)\n", "\n#include <iostream>\n#include<string>\n#include<cstdio>\n#include<cmath>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint main(){\n int t,n,i;\n int a[4]={6000,4000,3000,2000};\n for(i=0;i<4;i++){\n cin>>t>>n;\n cout<<a[t-1]*n<<endl;\n }\n return 0;\n}", "#include <iostream>\nusing namespace std;\nint main(void){\n int t,n,tmp[]={6000,4000,3000,2000};\n for (int i = 0; i<4; i++){\n cin >> t >> n;\n cout << tmp[t-1] * n << endl;\n }\n}\n", "import java.util.Scanner;\npublic class Main{\n public void solve(){\n Scanner sc=new Scanner(System.in);\n for(int r=0;r<4;r++){\n int num=sc.nextInt();\n int su=sc.nextInt();\n switch(num){\n case 1:\n System.out.println(su*6000);\n break;\n case 2:\n System.out.println(su*4000);\n break;\n case 3:\n System.out.println(su*3000);\n break;\n case 4:\n System.out.println(su*2000);\n break;\n }\n }\n }\n public static void main(String[]args){\n Main obj=new Main();\n obj.solve();\n }\n}", "#include <iostream>\nusing namespace std;\nint main(){\n for(int i = 0; 4 > i; i++){\n int a,b;\n cin>>a>>b;\n if(a==1)cout << 6000*b << endl;\n else if(a==2)cout << 4000*b << endl;\n else if(a==3)cout << 3000*b << endl;\n else cout << 2000*b << endl;\n }\n}\n", "import java.util.Scanner;\n\n class Main{\n int ninzu,k;\n\tint ban;\n\t\n public void solve(){\n Scanner sc = new Scanner(System.in);\n \n\t for(int i=0;i<4;i++){\n\t\t \tban= sc.nextInt();\n\t\t\tif(ban==1){\n\t\t\t\tk = 6000;\n\t\t\t\t}else if(ban==2){\n\t\t\t\t\tk = 4000;\n\t\t\t\t\t}else if(ban==3){\n\t\t\t\t\t\tk = 3000;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tk = 2000;\n\t\t\t\t\t}\n\t\t\t\t\tninzu = sc.nextInt();\n\t\t\t\t\tint uriage = k*ninzu;\n\t\t\t\t\tSystem.out.println(uriage);\n\t }\n }\n public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i,t,m,k;\n\t\tfor(i=0; i<4; i++) {\n\t\t\tt = sc.nextInt();\n\t\t\tm = sc.nextInt();\n\t\t\tswitch(t) {\n\t\t\tcase 1:\n\t\t\t\tk = 6000 * m;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tk = 4000 * m;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tk = 3000 * m;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tk = 2000 * m;\n\t\t\t}\n\t\t\tSystem.out.println(k);\n\t\t}\n\t}\n}", "import java.util.*;\nclass Main{\n Main(){\n\tScanner sc =new Scanner(System.in);\n\tint a ,c;\n\tfor(int i=0;i<4;i++){\n\t a=sc.nextInt();\n\t c=sc.nextInt();\n\t int b=0;\n\t switch(a){\n\t case 1:\n\t\tb+=6000*c;\n\t\tbreak;\n\t case 2:\n\t\tb+=4000*c;\n\t\tbreak;\n\t case 3:\n\t\tb+=3000*c;\n\t\tbreak;\n\t case 4:\n\t\tb+=2000*c;\n\t\tbreak;\n\t }\n\t System.out.println(b);\t\n\t}\n }\n public static void main (String[]arg){\n\tnew Main();\n }\n}", "import java.util.*;\n\nclass Main{\n public static void main(String args[]){\n Scanner sc=new Scanner(System.in);\n for(int i=0;i<4;i++){\n int t,n;\n t=sc.nextInt();\n n=sc.nextInt();\n if(t==1){\n System.out.println(6000*n);\n }else if(t==2){\n System.out.println(4000*n);\n }else if(t==3){\n System.out.println(3000*n);\n }else{\n System.out.println(2000*n);\n }\n }\n }\n}\n", "list=[]\nfor i in range(4):\n t,n=map(int,input().split())\n if t==1:\n print(6000*n)\n elif t==2:\n print(4000*n)\n elif t==3:\n print(3000*n)\n elif t==4:\n print(2000*n)\n", "for _ in range(4):\n t,n = map(int,input().split())\n if t == 1:\n print(6000*n)\n elif t == 2:\n print(4000*n)\n elif t == 3:\n print(3000*n)\n elif t == 4:\n print(2000*n)\n \n", "import java.util.Scanner;\npublic class Main{\n\tScanner sc=new Scanner(System.in);\n\tint n,m;\n\t\n\tvoid a(){\n\t\tfor(int i=0; i<4; i++){\n\t\t\tn=sc.nextInt();\n\t\t\tm=sc.nextInt();\n\t\t\n\t\t\n\t\t\tif(n==1){\n\t\t\t\tSystem.out.println(6000*m);\n\t\t\t}else if(n==2){\n\t\t\t\tSystem.out.println(4000*m);\n\t\t\t}else if(n==3){\n\t\t\t\tSystem.out.println(3000*m);\n\t\t\t}else if(n==4){\n\t\t\t\tSystem.out.println(2000*m);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic static void main(String[]agrs){\n\t\tnew Main().a();\n\t}\n}\n\t\t", "for _ in range(4):\n a,b = map(int,input().split()) #標準入力\n if a == 1:print(b * 6000) #s席なら6000をかける\n if a == 2:print(b * 4000) #A席なら4000をかける\n if a == 3:print(b * 3000) #B席なら3000をかける\n if a == 4:print(b * 2000) #C席なら2000をかける\n", "#include<iostream>\nint main()\n{\n int value[] = {0, 6000, 4000, 3000, 2000};\n for(int i = 0; i < 4; i++)\n {\n int a, b;\n std::cin >> a >> b;\n std::cout << value[a] * b << std::endl;\n }\n}", "#include<stdio.h>\nint main(void)\n{\n\tint a,b,c,d,t,i;\n\tfor(i=1;i<=4;i++){\n\t\tscanf(\"%d %d\",&a,&b);\n\t\tif(a==1){\n\t\t\ta=6000;\n\t\t}\n\t\telse if(a==2){\n\t\t\ta=4000;\n\t\t}\n\t\telse if(a==3){\n\t\t\ta=3000;\n\t\t}\n\t\telse if(a==4){\n\t\t\ta=2000;\n\t\t}\n\t\tc=a*b;\n\t\tprintf(\"%d\\n\",c);\n\t}\n\t\n\t\t\n\treturn 0;\n}", "t1,n1 = map(int,input().split())\nt2,n2 = map(int,input().split())\nt3,n3 = map(int,input().split())\nt4,n4 = map(int,input().split())\n\nif t1==1:\n print(n1*6000)\n if t2==2:\n print(n2*4000)\n if t3==3:\n print(n3*3000)\n print(n4*2000)\n if t3==4:\n print(n3*2000)\n print(n4*3000)\n \n if t2==3:\n print(n2*3000)\n if t3==2:\n print(n3*4000)\n print(n4*2000)\n if t3==4:\n print(n3*2000)\n print(n4*4000)\n if t2==4:\n print(n2*2000)\n if t3==2:\n print(n3*4000)\n print(n4*3000)\n if t3==3:\n print(n3*3000)\n print(n4*4000)\n \nif t1==2:\n print(n1*4000)\n if t2==1:\n print(n2*6000)\n if t3==3:\n print(n3*3000)\n print(n4*2000)\n if t3==4:\n print(n3*2000)\n print(n4*3000) \n if t2==3:\n print(n2*3000)\n if t3==1:\n print(n3*6000)\n print(n4*2000)\n if t3==4:\n print(n3*2000)\n print(n4*6000) \n if t2==4:\n print(n2*2000)\n if t3==1:\n print(n3*6000)\n print(n4*3000)\n if t3==3:\n print(n3*3000)\n print(n4*6000) \nif t1==3:\n print(n1*3000)\n if t2==1:\n print(n2*6000)\n if t3==2:\n print(n3*4000)\n print(n4*2000)\n if t3==4:\n print(n3*2000)\n print(n4*4000) \n if t2==2:\n print(n2*4000)\n if t3==1:\n print(n3*6000)\n print(n4*2000)\n if t3==4:\n print(n3*2000)\n print(n4*6000) \n if t2==4:\n print(n2*2000)\n if t3==1:\n print(n3*6000)\n print(n4*3000)\n if t3==3:\n print(n3*3000)\n print(n4*6000) \nif t1==4:\n print(n1*2000)\n if t2==1:\n print(n2*6000)\n if t3==2:\n print(n3*4000)\n print(n4*3000)\n if t3==3:\n print(n3*3000)\n print(n4*4000) \n if t2==2:\n print(n2*4000)\n if t3==1:\n print(n3*6000)\n print(n4*3000)\n if t3==3:\n print(n3*3000)\n print(n4*6000) \n if t2==3:\n print(n2*3000)\n if t3==1:\n print(n3*6000)\n print(n4*4000)\n if t3==2:\n print(n3*4000)\n print(n4*6000) \n\n", "# AOJ 0277: Ticket Sales\n# Python3 2018.6.23 bal4u\n\nticket = {1:6000, 2:4000, 3:3000, 4:2000}\nfor i in range(4):\n\tt, n = map(int, input().split())\n\tprint(n*ticket[t])\n", "i = 1\nwhile i <= 4:\n t,n =map(int,input().split())\n if t ==1:\n n1 = n * 6000\n print(n1)\n elif t == 2:\n n2 = n * 4000\n print(n2)\n elif t == 3:\n n3 = n*3000\n print(n3)\n else:\n n4 = n*2000\n print(n4)\n \n i += 1\n", "i=1\nwhile i<=4:\n t,n = map(int,input().split())\n i += 1\n if t == 1: print(6000*n)\n elif t == 2: print(4000*n)\n elif t == 3: print(3000*n)\n else: print(2000*n)\n", "#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main(){\n int p[5] = {0,6000,4000,3000,2000};\n int a,b,ans=0;\n for(int i=0;i<4;i++){\n scanf(\"%d%d\",&a,&b);\n cout << b * p[a] << endl;\n }\n\n return 0;\n}", "t1, n1= map(int, input(). split())\nt2, n2= map(int, input(). split())\nt3, n3= map(int, input(). split())\nt4, n4= map(int, input(). split())\n\ni = 1\nwhile i <= 4:\n if t1== 1:\n t1 = 6000\n elif t1 == 2:\n t1 = 4000\n elif t1 == 3:\n t1 = 3000\n elif t1 == 4:\n t1 = 2000\n\n elif t2 == 1:\n t2 = 6000\n elif t2 == 2:\n t2 = 4000\n elif t2 == 3:\n t2 = 3000\n elif t2 == 4:\n t2 = 2000\n\n elif t3 == 1:\n t3 = 6000\n elif t3 == 2:\n t3 = 4000\n elif t3 == 3:\n t3 = 3000\n elif t3 == 4:\n t3 = 2000\n\n elif t4 == 1:\n t4 = 6000\n elif t4 == 2:\n t4 = 4000\n elif t4 == 3:\n t4 = 3000\n elif t4 == 4:\n t4 = 2000\n \n i += 1\n \nprint(t1*n1)\nprint(t2*n2)\nprint(t3*n3)\nprint(t4*n4)\n", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in =new Scanner(System.in);\n\t\tint P[]={6000,4000,3000,2000};\n\t\tfor(int i=0;i<4;i++){\n\t\t\tint j=in.nextInt(),k=in.nextInt();\n\t\t\tSystem.out.println(P[j-1]*k);\n\t\t}\n\t}\n\n}\n\n", "#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint a[4]={6000,4000,3000,2000};\n\nint main(void){\n\n int t,n;\n while(cin >> t >> n){\n cout << a[t-1]*n << endl;\n }\n return 0;\n}", "d = {1:6000, 2:4000, 3:3000, 4:2000}\n\nfor i in range(4) :\n t,n = map(int,input().split())\n print(d[t]*n)\n\n", "costs = []\nfor _ in range(0, 4):\n i, v = map(int, input().split())\n if i == 1:\n costs.append(6000*v)\n elif i == 2:\n costs.append(4000*v)\n elif i == 3:\n costs.append(3000*v)\n elif i == 4:\n costs.append(2000*v)\n\nfor cost in costs:\n print(cost)\n", "#include <stdio.h>\nint main(){\n int a,b,c,i;\n for(i=1;i<=4;i++){\n scanf(\"%d %d\",&a,&b);\n if(a==1){\n c=6000*b;\n }else if(a==2){\n c=4000*b;\n }else if(a==3){\n c=3000*b;\n }else if(a==4){\n c=2000*b;\n }\n printf(\"%d\\n\",c);\n }\n return 0;\n}", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n\tint dat[4] = {6, 4, 3, 2}, a, b;\n\twhile(cin >> a >> b) cout << dat[a-1] * b * 1000 << endl;\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int t,n;\n int[] p = {0,6,4,3,2};\n for(int i=0;i<4;i++){\n t=sc.nextInt();\n n=sc.nextInt();\n System.out.println(p[t]*n*1000);\n }\n }\n}", "#include <iostream>\nusing namespace std;\nint main(void){\n for(int i = 0;i < 4; i++){\n int t,n;\n cin>>t>>n;\n \n if(t == 1)cout<<6000*n<<endl;\n if(t == 2)cout<<4000*n<<endl;\n if(t == 3)cout<<3000*n<<endl;\n if(t == 4)cout<<2000*n<<endl;\n }\n}\n\n", "#include <iostream>\nusing namespace std;\n\nint main() {\nint t, n;\nfor(int i = 0; i < 4; i++) {\ncin >> t >> n;\nif(t == 1) {\ncout << 6000 * n << std::endl;\n}\nif(t == 2) {\ncout << 4000 * n << std::endl;\n}\nif(t == 3) {\ncout << 3000 * n << std::endl;\n}\nif(t == 4) {\ncout << 2000 * n << std::endl;\n}\n}\n}", "#include <cstdio>\n\nint a, t, b[] = {6000, 4000, 3000, 2000};\n\nint main(){\n for(int i = 0; i < 4; i++){\n scanf(\"%d %d\", &a, &t);\n printf(\"%d\\n\", b[a - 1] * t);\n }\n\n return 0;\n}", "#include<stdio.h>\nint main(void)\n{\n\tint a,b,x[5],i;\n\tfor(i=0;i<4;i++){\n\t\ta=0; b=0;\n\t\tscanf(\"%d %d\",&a,&b);\n\t\tif(a==1) x[i]=b*6000;\n\t\tif(a==2) x[i]=b*4000;\n\t\tif(a==3) x[i]=b*3000;\n\t\tif(a==4) x[i]=b*2000;\n\t}\n\tfor(i=0;i<4;i++) printf(\"%d\\n\",x[i]);\n}", "a,n1=map(int,input().split())\nb,n2=map(int,input().split())\nc,n3=map(int,input().split())\nd,n4=map(int,input().split())\n\nt1=6000\nt2=4000\nt3=3000\nt4=2000\n\nif a==1:\n if b==2:\n if c==3:\n print(t1*n1)\n print(t2*n2)\n print(t3*n3)\n print(t4*n4)\n else:\n print(t1*n1)\n print(t2*n2)\n print(t4*n3)\n print(t3*n4)\n elif b==3:\n if c==2:\n print(t1*n1)\n print(t3*n2)\n print(t2*n3)\n print(t4*n4)\n else:\n print(t1*n1)\n print(t3*n2)\n print(t4*n3)\n print(t2*n4)\n else:\n if c==2:\n print(t1*n1)\n print(t4*n2)\n print(t2*n3)\n print(t3*n4)\n else:\n print(t1*n1)\n print(t4*n2)\n print(t3*n3)\n print(t2*n4)\n\n\nelif a==2:\n if b==1:\n if c==3:\n print(t2*n1)\n print(t1*n2)\n print(t3*n3)\n print(t4*n4)\n else:\n print(t2*n1)\n print(t1*n2)\n print(t4*n3)\n print(t3*n4)\n elif b==3:\n if c==1:\n print(t2*n1)\n print(t3*n2)\n print(t1*n3)\n print(t4*n4)\n else:\n print(t2*n1)\n print(t3*n2)\n print(t4*n3)\n print(t1*n4)\n else:\n if c==1:\n print(t2*n1)\n print(t4*n2)\n print(t1*n3)\n print(t3*n4)\n else:\n print(t2*n1)\n print(t4*n2)\n print(t3*n3)\n print(t*n4)\n\nelif a==3:\n if b==1:\n if c==2:\n print(t3*n1)\n print(t1*n2)\n print(t2*n3)\n print(t4*n4)\n else:\n print(t3*n1)\n print(t1*n2)\n print(t4*n3)\n print(t2*n4)\n elif b==2:\n if c==1:\n print(t3*n1)\n print(t2*n2)\n print(t1*n3)\n print(t4*n4)\n else:\n print(t3*n1)\n print(t2*n2)\n print(t4*n3)\n print(t1*n4)\n else:\n if c==1:\n print(t3*n1)\n print(t4*n2)\n print(t1*n3)\n print(t2*n4)\n else:\n print(t3*n1)\n print(t4*n2)\n print(t2*n3)\n print(t1*n4)\n\nelse:\n if b==1:\n if c==2:\n print(t4*n1)\n print(t1*n2)\n print(t2*n3)\n print(t3*n4)\n else:\n print(t4*n1)\n print(t1*n2)\n print(t3*n3)\n print(t2*n4)\n elif b==2:\n if c==1:\n print(t4*n1)\n print(t2*n2)\n print(t1*n3)\n print(t3*n4)\n else:\n print(t4*n1)\n print(t2*n2)\n print(t3*n3)\n print(t1*n4)\n else:\n if c==1:\n print(t4*n1)\n print(t3*n2)\n print(t1*n3)\n print(t2*n4)\n else:\n print(t3*n1)\n print(t3*n2)\n print(t2*n3)\n print(t1*n4)\n\n", "//PCK2015予選4\n#include<iostream>\nusing namespace std;\n\nint main(){\n int t[4] = {6,4,3,2};\n for(int i=0;i<4;++i){\n int n,m;\n cin>>n>>m;\n cout<<t[n-1]*m*1000<<endl;\n }\n}\n\n", "#include <iostream>\nusing namespace std;\n\nint my[] = {6000, 4000, 3000, 2000};\n\nint main()\n{\n int n, m;\n for (int i = 0; i < 4; i++){\n cin >> n >> m;\n cout << my[n - 1] * m << endl;\n }\n return (0);\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int table[] = {-1, 6000, 4000, 3000, 2000};\n\nint main()\n{\n\tfor (int i = 0; i < 4; i++){\n\t\tint t, n;\n\t\tscanf(\"%d %d\", &t, &n);\n\t\tprintf(\"%d\\n\", table[t] * n);\n\t}\n}", "#include <iostream>\nusing namespace std;\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0277\n\nint main() {\n\tint arr[4];\n\tint prices[] = { 6000, 4000, 3000, 2000 };\n\tfor (int i = 0; i < 4; i++) {\n\t\tint t, n;\n\t\tcin >> t >> n;\n\t\tcout << (prices[t - 1] * n) << endl;\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\t\n\tint kingaku;\n\tint[] goukei = new int[4];\n\tint n;\n\t\n\tpublic void syurui(){\n\t\tfor (n = 0; n <= 3;n++){\n\t\t\tint syurui = sc.nextInt();\n\t\t\tint maisuu = sc.nextInt();\n\t\t\tswitch(syurui){\n\t\t\tcase 1: kingaku = 6000;break;\n\t\t\tcase 2: kingaku = 4000;break;\n\t\t\tcase 3: kingaku = 3000;break;\n\t\t\tcase 4: kingaku = 2000;break;\n\t\t\t}\n\t\tgoukei[n] = kingaku * maisuu;}\n\t}\n\n\tpublic void hyouji(){\n\t\tfor(n = 0; n <= 3; n++){\n\t\t\tSystem.out.println(goukei[n]);\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tMain m = new Main();\n\t\tm.syurui();\n\t\tm.hyouji();\n\t\t}\n\t}", "#include <iostream>\nusing namespace std;\nusing ll = long long;\n\nll table[] = {0, 6000, 4000, 3000, 2000};\n\nint main()\n{\n ll t, n;\n\n for (int i = 0; i < 4; i++) {\n cin >> t >> n;\n cout << table[t] * n << endl;\n }\n\n return 0;\n}\n\n", "#include <iostream>\nusing namespace std;\nint main(void){\n int t,n;\n for(int i = 0; i < 4; i++){\n cin >> t >> n;\n if(t == 1)cout << n*6000 << endl;\n if(t == 2)cout << n*4000 << endl;\n if(t == 3)cout << n*3000 << endl;\n if(t == 4)cout << n*2000 << endl;\n }\n}\n", "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n\tint b[4], c[4];\n\tfor (int i = 0; i < 4; i++){\n\t\tcin >> b[i] >> c[i];\n\t}\n\tfor (int i = 0; i < 4; i++){\n\t\tif (b[i] == 1){ cout << 6000 * c[i] << endl; }\n\t\telse\n\t\t{cout << (6-b[i])*1000 * c[i] << endl;}\n\t}\n\treturn 0;\n}\n", "t=[6000,4000,3000,2000]\nfor i in xrange(4):\n l=map(int,raw_input().split())\n print l[1]*t[l[0]-1]", "import java.util.Scanner;\nclass Main{\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc=new Scanner(System.in);\n\t\twhile(sc.hasNextInt()){\n\t\t\tint t=sc.nextInt();\n\t\t\tint n=sc.nextInt();\n\t\t\tint S=1;\n\t\t\tint A=2;\n\t\t\tint B=3;\n\t\t\tint C=4;\n\t\t\tint ans=0;\n\t\t\tif(t==S){\n\t\t\t\t ans=6000*n;\n\t\t\t} if(t==A){\n\t\t\t\tans=4000*n;\n\t\t\t} if(t==B){\n\t\t\t\tans=3000*n;\n\t\t\t} if(t==C){\n\t\t\t\tans=n*2000;\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\n\t}\n}", "import java.util.*;\n\npublic class Main {\n\t public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\t int []value ={6000,4000,3000,2000};\n\t int []ans;\n\t for(int i=0; i<4; i++){\n\t\t int t=sc.nextInt()-1;\n\t\t int n=sc.nextInt();\n\t\t System.out.println(value[t]*n);\n\t }\n\t }\n\t }", "def change(t) :\n if t == 1 :\n return 6000\n elif t == 2 :\n return 4000\n elif t == 3 :\n return 3000\n elif t == 4 :\n return 2000\n\n\nt1, n1 = map(int, input().split())\nt2, n2 = map(int, input().split())\nt3, n3 = map(int, input().split())\nt4, n4 = map(int, input().split())\n\nprint(change(t1) * n1)\nprint(change(t2) * n2)\nprint(change(t3) * n3)\nprint(change(t4) * n4)\n", "a={1:6000,2:4000,3:3000,4:2000}\nfor i in range(4):\n t, n=map(int,input().split())\n print(n*a[t])\n\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint i, y;\n\tint a[4] = {6000, 4000, 3000, 2000};\n\twhile(cin >> i >> y){\n\t\tcout << a[i - 1] * y << endl;\n\t}\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int t,n,tmp[]={6000,4000,3000,2000};\n for(int i = 0 ; i < 4 ; i++){\n cin >> t >> n;\n cout << tmp[t-1] * n << endl;\n }\n}", "#include <bits/stdc++.h>\n#define int long long\n#define double long double\nusing namespace std;\nsigned main() {\n int prices[] = { 6000, 4000, 3000, 2000 };\n for (int i = 0; i < 4; i++) {\n int t, n;\n cin >> t >> n;\n cout << prices[t-1]*n << endl;\n }\n}\n\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint m,n;\n\tint price[4]={6000,4000,3000,2000};\n\tfor(int i=0;i<4;i++){\n\t\tcin >> m >> n;\n\t\tcout << price[m-1]*n << endl;\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\nclass Main{\n\tint t;\n\tint n;\n\tint cnt=0;\n\t\n\tpublic void solve(){\n Scanner sc=new Scanner(System.in);\n\t\t\n\t\twhile(cnt<4){\n\t\t\tt=sc.nextInt();\n\t\t\tn=sc.nextInt();\n if(t==1){\n\t\t\tSystem.out.println(6000*n);\n\t\t\tcnt++;\n }else if(t==2){\n\t\t\tSystem.out.println(4000*n);\n\t\t\tcnt++;\n }else if(t==3){\n\t\t\tSystem.out.println(3000*n);\n\t\t\tcnt++;\n\t\t}else{\n\t\t\tSystem.out.println(2000*n);\n\t\t\tcnt++;\n }\n\t\t}\n\t}\n\tpublic static void main(String[] args){\n Main obj =new Main();\n obj.solve();\n }\n}", "a=[0,6000,4000,3000,2000]\nfor x in range(4):\n t,n=list(map(int,input().split()))\n print(a[t]*n)\n", "\na,m=map(int, input().split())\nb,n=map(int, input().split())\nc,l=map(int, input().split())\nd,o=map(int, input().split())\n \ndef cal(e,p):\n if e==1:\n x=p*6000 \n return x\n \n elif e==2:\n x=p*4000\n return x\n \n elif e==3:\n x=p*3000\n return x\n \n else:\n x=p*2000\n return x\n\nx1=cal(a,m)\nx2=cal(b,n)\nx3=cal(c,l)\nx4=cal(d,o)\n\nprint(x1)\nprint(x2)\nprint(x3)\nprint(x4)\n", "#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\nint main()\n{\n\tint in[2],varue[4] = {6000,4000,3000,2000};\n\n\tfor(int i = 0; i < 4; i++){\n\t\tscanf(\"%d %d\",&in[0],&in[1]);\n\t\tprintf(\"%d\\n\",in[1] * varue[in[0]-1]);\n\t}\n\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint yen[]={6000,4000,3000,2000},n,t;\n\tfor(int i=0;i<4;i++){\n\t\tint sum=0;\n\t\tcin>>t>>n;\n\t\tsum=yen[t-1]*n;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}", "for i in range(4):\n a,b=map(int,input().split())\n if a==1:\n a=b*6000\n if a==2:\n a=b*4000\n if a==3:\n a=b*3000\n if a==4:\n a=b*2000\n print(a)\n", "for x in range(4):\n t,n=map(int,input().split())\n \n if t==1:\n print(6000*n)\n \n if t==2:\n print(4000*n)\n \n if t==3:\n print(3000*n)\n \n if t==4:\n print(2000*n)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint a[4];\n\ta[0] = \t6000;\n\ta[1] = 4000;\n\ta[2] = 3000;\n\ta[3] = 2000;\n\tfor(int i = 0; i < 4; i++){\n\t\tint m,n;\n\t\tcin >> m>>n;\n\t\tcout << a[m-1] *n <<endl;\n\t}\n\treturn 0;\n}\n", "#include <cstdio>\nint v[]={6000,4000,3000,2000};\nint main() {\n\tfor(int i=0;i<4;i++) {\n\t\tint t,n;\n\t\tscanf(\"%d %d\",&t,&n);\n\t\tprintf(\"%d\\n\",v[t-1]*n);\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int t[4]={6000,4000,3000,2000};\n int a,b;\n int c[4];\n\n for(int i=0;i<4;i++){\n cin>> a>> b;\n c[i]=b*t[a-1];\n }\n\n for(int i=0;i<4;i++){\n cout<< c[i]<< endl;\n }\n}", "import java.util.*;\npublic class Main{ \n\tpublic static void main(String args[]){\n\t\tScanner sc = new Scanner(System.in); \n\t\twhile(sc.hasNext()){\n\t\tlong a = sc.nextLong();\n\t\tlong b = sc.nextLong();\n\t\tlong cost = 0;\n\t\tif(a == 1){ cost = 6000 * b;}\n\t\tif(a == 2){ cost = 4000 * b;}\n\t\tif(a == 3){ cost = 3000 * b;}\n\t\tif(a == 4){ cost = 2000 * b;}\n\t\tSystem.out.println(cost);\n\t\t}\n\t\t\n\t}\n\t}\t", "a=[0,6000,4000,3000,2000]\nfor i in range(4):\n t,n=map(int,input().split())\n print(n*a[t])\n", "t1,n1=map(int,input().split())\nt2,n2=map(int,input().split())\nt3,n3=map(int,input().split())\nt4,n4=map(int,input().split())\n\nif t1==1:\n t1=6000\nelif t1==2:\n t1=4000\nelif t1==3:\n t1=3000\nelse:\n t1=2000\n \nif t2==1:\n t2=6000\nelif t2==2:\n t2=4000\nelif t2==3:\n t2=3000\nelse:\n t2=2000\n \nif t3==1:\n t3=6000\nelif t3==2:\n t3=4000\nelif t3==3:\n t3=3000\nelse:\n t3=2000\n \nif t4==1:\n t4=6000\nelif t4==2:\n t4=4000\nelif t4==3:\n t4=3000\nelse:\n t4=2000\n \nprint(t1*n1)\nprint(t2*n2)\nprint(t3*n3)\nprint(t4*n4)\n", "#include <iostream>\n\nusing namespace std;\n\nint main(void) {\n\tint kingaku[] = {6000, 4000, 3000, 2000} ;\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint t,n;\n\t\tcin >> t >> n;\n\t\tcout << kingaku[t-1] * n << endl;\n\t}\n\t\n\treturn 0;\n}", "v = [0,6000,4000,3000,2000]\nfor i in range(4):\n t,n = map(int,input().split())\n print(n*v[t])\n", "import java.util.Scanner;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tint cnt;\n\tint seki;\n\tint kingaku;\n\tint maisuu;\n\tint[] uriage = new int [4];\n\t\n\tpublic void syurui(){\n\t\tfor (cnt=0;cnt<=3;cnt++){\n\t\t\tseki = sc.nextInt();\n\t\t\tmaisuu = sc.nextInt();\n\t\t\tswitch(seki) {\n\t\t\tcase 1: kingaku=6000; break;\n\t\t\tcase 2: kingaku=4000; break;\n\t\t\tcase 3: kingaku=3000; break;\n\t\t\tcase 4: kingaku=2000; break;\n\t\t\t}\n\t\t\turiage[cnt] = kingaku*maisuu;\t\t\t\n\t\t}\n\t}\n\t\n\tpublic void keisan(){\n\t\tfor (cnt=0;cnt<=3;cnt++){\n\t\t\tSystem.out.println(uriage[cnt]);\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tMain yo = new Main();\n\t\tyo.syurui();\n\t\tyo.keisan();\n\t\t\n\t}\n\n}", "#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tfor (int a = 0; a < 4; a++)\n\t{\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\tswitch (c)\n\t\t{\n\t\tcase 1:cout<< d * 6000<<endl; break;\n\t\tcase 2:cout << d * 4000 << endl; break;\n\t\tcase 3:cout << d * 3000 << endl; break;\n\t\tdefault:cout << d * 2000 << endl;\n\t\t}\n\t}\n}", "#include<bits/stdc++.h> \nusing namespace std;\ntypedef long long int64;\n\nint main(){\n int ticket[] = { 6000, 4000, 3000, 2000};\n \n for(int i = 0; i < 4; i++){\n int t, n;\n cin >> t >> n;\n cout << ticket[t - 1] * n << endl;\n }\n}", "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[]args){\n\t\tScanner sc =new Scanner(System.in);\n\t\tint Su[] ={0,6000,4000,3000,2000};\n\t\tint Ke[] ={0,0,0,0};\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tint a = sc.nextInt();\n\t\t\tint b = sc.nextInt();\n\t\t\tKe[i] = Su[a] * b;\n\t\t}\n\t\tfor(int n = 0; n < 4; n++){\n\t\t\tSystem.out.println(Ke[n]);\n\t\t}\n\t}\n}", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n\tint com[] = {0, 6000, 4000, 3000, 2000};\n\tint t, n;\n\n\tfor (int i = 0; i < 4; i++){\n\t\tcin >> t >> n;\n\n\t\tcout << com[t] * n << endl;\n\t}\n\n}", "//2718 佐々木 稜平 問2\nimport java.util.Scanner;\npublic class Main{\n \n public void solve(){\n Scanner sc = new Scanner(System.in);\n for(int a =0;a<4;a++){\n int t = sc.nextInt();\n int n = sc.nextInt();\n switch (t){\n case 1:\n System.out.println(n*6000);\n break;\n case 2:\n System.out.println(n*4000);\n break;\n case 3:\n System.out.println(n*3000);\n break;\n case 4:\n System.out.println(n*2000);\n break;\n } \n }\n }\n public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "while True:\n try:\n t,n=map(int,input().split())\n if t==1:\n k=6000\n elif t==2:\n k=4000\n elif t==3:\n k=3000\n else:\n k=2000\n print(k*n)\n except:\n break\n", "#include <iostream>\nusing namespace std;\nint cost[5]={0,6000,4000,3000,2000};\nint main() {\n\tint t,n;\n\tfor(int i=0;i<4;i++)\n\t{\n\t\tcin >> t >> n;\n\t\tcout << cost[t]*n << endl;\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) for (int i = 0; i < (n); i++)\n\nint seat[] = {0, 6000, 4000, 3000, 2000};\nint main()\n{\n int t, n;\n FOR(i, 1, 5){\n cin >> t >> n;\n cout << seat[t] * n << endl;\n }\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tint a[]=new int[8];\n\t\tint b[]=new int[4];\n\t\tfor(int i=0;i<4;i++){\n\t\t\tint se =stdIn.nextInt();\n\t\t\tint mai=stdIn.nextInt();\n\t\t\tswitch(se){\n\t\t\tcase 1:\n\t\t\t\ta[i]=mai*6000;\n\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\ta[i]=mai*4000;\n\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\ta[i]=mai*3000;\n\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\ta[i]=mai*2000;\n\t\t\tbreak;\n\t\t\t}\n\t\t}for(int i=0;i<4;i++){\n\t\t\tSystem.out.println(a[i]);\n\t\t}\n\t}\n}", "//2734　吉原直樹　問0277\nimport java.util.Scanner;\npublic class Main{\n int kind;\n int su;\n int kei;\n int []seki = {6000,4000,3000,2000};\n public void solve(){\n Scanner sc = new Scanner(System.in);\n for(int k=0;k<4;k++){\n kind=sc.nextInt();\n switch(kind){\n case 1:\n kind=6000;\n break;\n case 2:\n kind=4000;\n break;\n case 3:\n kind=3000;\n break;\n case 4:\n kind=2000;\n break;\n }\n su=sc.nextInt();\n kei=kind*su;\n System.out.println(kei);\n }\n }\n \n public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "import java.util.Scanner;\npublic class Main{\n int seki[]={0,6000,4000,3000,2000};\n int b; \n int a;\n int kin=0;\n public void solve(){\n Scanner sc=new Scanner(System.in);\n for(int i=1;i<5;i++){\n a = sc.nextInt();\n b = sc.nextInt();\n kin =seki[a]*b;\n \n \n \n System.out.println(kin);\n }\n }\n public static void main(String[] args){\n Main obj=new Main();\n obj.solve();\n }\n}", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n for(int i=0;i<4;i++){\n int t,n;cin>>t>>n;\n if(t%4==1){\n cout<<n*6000<<endl;\n }else if(t%4==2){\n cout<<n*4000<<endl;\n }else if(t%4==3){\n cout<<n*3000<<endl;\n }else{\n cout<<n*2000<<endl;\n }\n }\n}\n", "i=0\nm=0\nfor i in range(4):\n a,b=map(int,input().split())\n if a==1:\n print(6000*b)\n elif a==2:\n print(4000*b)\n elif a==3:\n print(3000*b)\n else:\n print(2000*b)\n i+=1\n", "#include<iostream>\nusing namespace std;\n\nint main(void){\n\tint t, n;\n\tfor(int i = 0; i < 4; i++){\n\t\tcin >> t >> n;\n\t\tif(t == 1) cout << n*6000 << endl;\n\t\telse if(t == 2) cout << n*4000 << endl;\n\t\telse if(t == 3) cout << n* 3000 << endl;\n\t\telse cout << n*2000 << endl;\n\t}\n\treturn 0;\n}\n", "#include <iostream>\n\nusing namespace std;\n\nint main(){\n int A[5]={0,6000,4000,3000,2000};\n for(int i=0;i<4;++i){\n int t,n,sum;\n cin>>t>>n;\n sum=A[t]*n;\n cout<<sum<<endl;\n }\n return 0;\n}", "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tBufferedReader bfr=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer stk;\n\t\tString str=\"\";\n\t\tint S_ndn,A_ndn,B_ndn,C_ndn;\n\t\tint sum=0;\n\t\tS_ndn=6000; A_ndn=4000; B_ndn=3000; C_ndn=2000;\n\t\tint tmp1,tmp2;\n\n\t\ttry {\n\t\t\tfor(int i=0; i<4; i++) {\n\t\t\t\tstr=bfr.readLine();\n\t\t\t\tstk=new StringTokenizer(str,\" \");\n\t\t\t\ttmp1=Integer.parseInt(stk.nextToken());\n\t\t\t\ttmp2=Integer.parseInt(stk.nextToken());\n\t\t\t\tif(tmp1==1) {\n\t\t\t\t\tsum+=tmp2*S_ndn;\n\t\t\t\t}\n\n\t\t\t\telse if(tmp1==2) {\n\t\t\t\t\tsum+=tmp2*A_ndn;\n\t\t\t\t}\n\n\t\t\t\telse if(tmp1==3) {\n\t\t\t\t\tsum+=tmp2*B_ndn;\n\t\t\t\t}\n\n\t\t\t\telse if(tmp1==4) {\n\t\t\t\t\tsum+=tmp2*C_ndn;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(sum);\n\t\t\t\tsum=0;\n\t\t\t}\n\n\n\t\t}catch(IOException e) {\n\n\t\t}\n\t}\n}\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n int t, n;\n int price[4] = {6000, 4000, 3000, 2000};\n int i;\n for (i = 0; i < 4; i++) {\n cin >> t >> n;\n cout << price[t - 1] * n << endl;;\n }\n return 0;\n}\n\n", "import java.util.Scanner;\npublic class Main{\n \n public void solve(){\n Scanner sc = new Scanner(System.in);\n int syu,mai,b,uri;\n for(int t=0; t<4; t++){\n syu = sc.nextInt();\n if(syu==1){\n b=6000;\n }else if(syu==2){\n b=4000;\n }else if(syu==3){\n b=3000;\n }else{\n b=2000;\n }\n mai = sc.nextInt();\n uri = b*mai;\n System.out.println(uri);\n }\n }\n public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "for i in range(4):\n a,b = map(int,input().split())\n if a == 1:\n print(6000*b)\n elif a == 2:\n print(4000*b)\n elif a == 3:\n print(3000*b)\n elif a == 4:\n print(2000*b)\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint i,a,b,t[4]={6000,4000,3000,2000};\n\tfor(i=0;i<4;i++) {\n\t\tcin>>a>>b;\n\t\tcout<<t[a-1]*b<<endl;\n\t}\n}", "#include <iostream>\n\nusing namespace std;\n\nconst int money[] = {0, 6000, 4000, 3000, 2000};\n\nint main()\n{\n int t, n;\n\n for (int i = 0; i < 4; i++) {\n cin >> t >> n;\n cout << money[t] * n << endl;\n }\n\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n int pr[4]={6000,4000,3000,2000};\n int a,b;\n for(int i=0;i<4;i++){\n cin >> a >> b;\n cout << pr[a-1] * b << endl;\n }\n}", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner in = new Scanner(System.in);\n\t\tint[]n = new int [5];\n\t\tfor(int i = 1;i < 5;i++){\n\t\t\tint t = in.nextInt();\n\t\t\tn[t] = in.nextInt();\n\t\t\tif(t == 1){\n\t\t\t\tSystem.out.println(6000*n[1]);\n\t\t\t}else if(t == 2){\n\t\t\t\tSystem.out.println(4000*n[2]);\n\t\t\t}else if(t == 3){\n\t\t\t\tSystem.out.println(3000*n[3]);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(2000*n[4]);\n\t\t\t}\n\t\t}\n\t}\n}", "#include<stdio.h>\nint main(void)\n{\n\tint t,n,a[4],i,j;\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d %d\",&t,&n);\n\t\tif(t==1){\n\t\t\ta[i]=n*6000;\n\t\t}\n\t\tif(t==2){\n\t\t\ta[i]=n*4000;\n\t\t}\n\t\tif(t==3){\n\t\t\ta[i]=n*3000;\n\t\t}\n\t\tif(t==4){\n\t\t\ta[i]=n*2000;\n\t\t}\n\t}\n\tfor(j=0;j<4;j++){\n\t\tprintf(\"%d\\n\",a[j]);\n\t}\n\treturn 0;\n}", "#include <cstdio>\nint p[]={6000,4000,3000,2000};\nint main() {\n\tint ans=0;\n\tfor(int i=0;i<4;i++) {\n\t\tint t,n;\n\t\tscanf(\"%d %d\",&t,&n);\n\t\tprintf(\"%d\\n\",p[t-1]*n);\n\t}\n}", "#include<stdio.h>\nint main(void)\n{\n int a[5]={1,2,3,4};\n\tint t[10],n[10001],c[90000],i;\n\ta[1]=6000;\n\ta[2]=4000;\n\ta[3]=3000;\n\ta[4]=2000;\n\tfor(i=0;i<4;i++){\n\t scanf(\"%d %d\",&t[i],&n[i]);\n\t\tc[i]=a[t[i]]*n[i];\n\t}\n\tfor(i=0;i<4;i++){\n\t printf(\"%d\\n\",c[i]);\n\t}\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int a[4]={6000,4000,3000,2000},b,c;\n for(int i=0;i<4;i++){\n cin>>b>>c;\n cout<<c*a[b-1]<<endl;\n }\n return 0;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n\tint a[] = { 6000, 4000, 3000, 2000 };\n\tfor (int i = 0; i < 4; i++){\n\t\tint x, y;\n\t\tcin >> x >> y;\n\t\tcout << a[x - 1] * y << endl;\n\t}\n}", "import java.util.Scanner;\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\tint[] nedan = {6000,4000,3000,2000};\n\t\tint i, s, mai;\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor ( i = 0; i <= 3; i++) {\n\t\t\ts = sc.nextInt();\n\t\t\tmai = sc.nextInt();\n\t\t\tSystem.out.println(nedan[s-1] * mai);\n\n\t\t}\n\n\t\t// TODO 自動生成されたメソッド・スタブ\n\n\t}\n\n}", "#include<iostream>\n\nusing namespace std;\n\nint tic[] = {6000,4000,3000,2000};\n\nint main(){\n for(int i = 0; i < 4; i++){\n int t,n;\n cin >> t >> n;\n cout << tic[t-1]*n << endl;\n }\n return 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tstatic int[] prices = { 0, 6000, 4000, 3000, 2000 };\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = \"\";\n\n\t\twhile ((line = br.readLine()) != null && !line.isEmpty()) {\n\t\t\tStringTokenizer st = new StringTokenizer(line);\n\t\t\tint t = Integer.parseInt(st.nextToken());\n\t\t\tint n = Integer.parseInt(st.nextToken());\n\t\t\tSystem.out.println(prices[t] * n);\n\t\t}\n\t}\n}", "#include<cstdio>\n\nusing namespace std;\n\nint main(){\n\tint data[] = {0,6000,4000,3000,2000};\n\n\tfor(int i=0;i<4;i++){\n\t\tint t,n;\n\t\tscanf(\"%d %d\",&t,&n);\n\n\t\tprintf(\"%d\\n\",data[t]*n);\n\t}\n\treturn 0;\n}", "t1,n1=map(int,input().split())\nt2,n2=map(int,input().split())\nt3,n3=map(int,input().split())\nt4,n4=map(int,input().split())\n\ndef keisan(t,n):\n if t==1:\n return(n*6000)\n elif t==2:\n return(n*4000)\n elif t==3:\n return(n*3000)\n else:\n return(n*2000)\n\nprint(keisan(t1,n1))\nprint(keisan(t2,n2))\nprint(keisan(t3,n3))\nprint(keisan(t4,n4))\n", "#include<iostream>\nusing namespace std;\nint main()\n{\n\tint nedan[] = {6000,4000,3000,2000};\n\tfor(int i=0 ; i<4 ; ++i){\n\t\tint t,n;\n\t\tcin >> t >> n;\n\t\tcout << nedan[t-1]*n << endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint r[5]={0,6000,4000,3000,2000};\n\tfor(int i=0;i<4;i++){\n\t\tint t,n;\n\t\tcin>>t>>n;\n\n\t\tcout<<r[t]*n<<endl;\n\t}\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int t,n;\n int tt[4]={6000,4000,3000,2000};\n for(int i=0;i<4;i++){\n cin >> t >> n;\n cout << tt[t-1] * n << endl;\n }\n return 0;\n}\n ", "p=[0,6000,4000,3000,2000]\nfor i in range(4):\n t,n=map(int,input().split())\n print(p[t]*n)\n", "import java.util.Scanner;\n\nclass Main {\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int t;\n int n;\n int i;\n \n for(i = 0;i<4;i++){\n t = scan.nextInt();\n n = scan.nextInt();\n if(t == 1){\n System.out.println(6000*n);\n }else if (t == 2){\n System.out.println(4000*n);\n }else if (t == 3){\n System.out.println(3000*n);\n }else if (t == 4){\n System.out.println(2000*n);\n }\n \n }\n }\n \n }\n\n\n", "#include<iostream>\n#include<algorithm>\n\nusing namespace std;\nint t, n;\nint cost[] = {0, 6000, 4000, 3000, 2000};\nint main(){\n for(int i = 0;i < 4;i++){\n cin >> t >> n;\n cout << cost[t] * n << endl;\n }\n return 0;\n}", "#include<stdio.h>\n\nint main(){\n\nint x,y;\n\n//while(scanf(\"%d %d\",&x,&y)!=EOF){\n\nfor(int i=0;i<4;i++){\nscanf(\"%d %d\",&x,&y);\n\nint t=0;\nswitch(x){\ncase 1:\nt=6000;break;\n\ncase 2:\nt=4000;break;\n\ncase 3:\nt=3000;break;\n\ncase 4:\nt=2000;break;\n}\n\nprintf(\"%d\\n\",t*y);\n}\nreturn 0;\n}", "V = [0, 6000, 4000, 3000, 2000]\nfor i in range(4):\n t, n = map(int,input().split())\n print(n*V[t])\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint a,b;\n\tfor (int i=0;i<4;++i){\n\t\tcin >>a>>b;\n\t\tif(a==1)b=b*6000;\n\t\tif(a==2)b=b*4000;\n\t\tif(a==3)b=b*3000;\n\t\tif(a==4)b=b*2000;\n\n\t\tcout<<b<<endl;\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int c[] = {6000,4000,3000,2000}, t, n;\n while(cin >> t >> n){\n cout << c[t-1]*n << endl;\n }\n return 0;\n}\n", "#include<iostream>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\nint main() {\n\tint val[] = {6000, 4000, 3000, 2000};\n\trep (i, 4) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\t--a;\n\t\tcout << val[a] * b << endl;\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main{\n public void solve(){\n Scanner sc = new Scanner(System.in);\n int syu,mai;\n \n for(int i=0;i<4;i++){\n syu = sc.nextInt();\n mai =sc. nextInt();\n \n switch(syu){\n case 1:\n System.out.println(6000*mai);\n break;\n \n case 2:\n System.out.println(4000*mai);\n break;\n \n case 3:\n System.out.println(3000*mai);\n break;\n \n case 4:\n System.out.println(2000*mai);\n break;\n }\n }\n }\n \n public static void main(String[]args){\n Main obj = new Main();\n obj.solve();\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < (int)(n); i++)\n\nint main(){\n int m[] = {\n 0,\n 6000,\n 4000,\n 3000,\n 2000\n };\n rep(i,4){\n int a,b;\n cin >> a >> b;\n cout << m[a] * b << endl;\n }\n}", "import java.util.Scanner;\nclass Main{\n \n public void solve(){\n Scanner sc = new Scanner(System.in);\n\t\tint ninzu, k;\n\t\tint ban;\n for(int i = 0; i < 4; i++){\n\t \tban = sc.nextInt();\n\t\tif(ban == 1){\n\t\t\tk = 6000;\n\t\t}else if(ban == 2){\n\t\t\tk = 4000;\n\t\t}else if(ban == 3){\n\t\t\tk = 3000;\n\t\t}else{\n\t\t\tk = 2000;\n\t\t}\n\t\t\n\t\tninzu = sc.nextInt();\n\t\tint uriage = k * ninzu;\n\t\tSystem.out.println(uriage);\n }\n\t \t\n }\n \n public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "\nimport java.util.Scanner;\n\nclass Main {\n\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int t;\n int n;\n int i;\n\n for (i = 0; i < 4; i++) {\n t = sc.nextInt();\n n = sc.nextInt();\n if(t == 1){\n System.out.println(6000 * n);\n }\n else if (t == 2) {\n System.out.println(4000 * n);\n }\n else if (t == 3) {\n System.out.println(3000 * n);\n }\n else if (t == 4) {\n System.out.println(2000 * n);\n }\n }\n\n }\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nint d[]={0,6000,4000,3000,2000};\n\nint main(){\n for(int i=0;i<4;i++){\n int t,n;\n cin>>t>>n;\n cout<<d[t]*n<<endl;\n }\n return(0);\n}\n\n", "X = [[int(_) for _ in input().split()] for _ in range(4)]\n\nprice = [0, 6000, 4000, 3000, 2000]\n\nfor t, n in X:\n print(price[t] * n)\n\n", "#include<cstdio>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\n int pri[5]={0,6000,4000,3000,2000};\n for(int i=0;i<4;i++){\n int a,b;\n scanf(\"%d %d\",&a,&b);\n printf(\"%d\\n\",pri[a]*b);\n }\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n constexpr int a[] = {6000, 4000, 3000, 2000};\n int t, n;\n while (cin >> t >> n) {\n cout << a[t - 1] * n << \"\\n\";\n }\n}\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n int n;\n int t;\n \n for(int i = 0;i < 4;i++)\n {\n cin >> t >> n;\n\n if(t==1)cout << 6000*n << endl;\n if(t==2)cout << 4000*n << endl;\n if(t==3)cout << 3000*n << endl;\n if(t==4)cout << 2000*n << endl;\n\n }\n}\n\n", "t1,n1=map(int,input().split())\nt2,n2=map(int,input().split())\nt3,n3=map(int,input().split())\nt4,n4=map(int,input().split())\n\nif t1==1:\n A=6000*n1\nelif t1==2:\n A=4000*n1\nelif t1==3:\n A=3000*n1\nelse:\n A=2000*n1\n \nif t2==1:\n B=6000*n2\nelif t2==2:\n B=4000*n2\nelif t2==3:\n B=3000*n2\nelse:\n B=2000*n2\n \nif t3==1:\n C=6000*n3\nelif t3==2:\n C=4000*n3\nelif t3==3:\n C=3000*n3\nelse:\n C=2000*n3\n \nif t4==1:\n D=6000*n4\nelif t4==2:\n D=4000*n4\nelif t4==3:\n D=3000*n4\nelse:\n D=2000*n4\n \nprint(A)\nprint(B)\nprint(C)\nprint(D)\n \n \n \n", "#include <iostream>\nusing namespace std;\n\nconst int p[4] = {6000, 4000, 3000, 2000};\n\nint main()\n{\n int t, n;\n\n for (int i = 0; i < 4; i++) {\n cin >> t >> n;\n cout << p[t - 1] * n << endl;\n }\n\n return (0);\n}", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tint[] chicket = new int[]{6000, 4000, 3000, 2000};\n\t\tScanner stdIn = new Scanner(System.in);\n\t\twhile(stdIn.hasNext()) {\n\t\t\tint t = stdIn.nextInt();\n\t\t\tint n = stdIn.nextInt();\n\t\t\tSystem.out.println(chicket[t - 1] * n);\n\t\t}\n\t}\n}", "list=[0,6000,4000,3000,2000]\nfor i in range(4):\n a, b = map(int, input().split())\n print(b*list[a])\n \n\n\n", "a=[0,6000,4000,3000,2000]\nfor _ in range(4):\n (t,n)=map(int,input().split())\n print(a[t]*n)\n", "import sys\n\nfor s in sys.stdin:\n t,n = map(int,s.split())\n if t == 1:\n print 6000 * n\n elif t == 2:\n print 4000 * n\n elif t == 3:\n print 3000 * n\n else:\n print 2000 * n", "#include<iostream>\nusing namespace std ;\n\nint main(){\n\t\n\tint t , n ;\n\tint k[5] = { 0,6000,4000,3000,2000 } ;\n\t\n\tfor( int i=0 ; i<4 ; i++ ){\n\t\tcin >> t >> n ;\n\t\tcout << k[t] * n << endl ;\n\t}\n\t\nreturn 0; \n}", "for i in range(4):\n t,n = map(int,input().split())\n x = 0\n if t == 1:\n x = 6000*n\n elif t == 2:\n x = 4000*n\n elif t == 3:\n x = 3000*n\n else:\n x = 2000*n\n print(x)\n", "#include<stdio.h>\nint main(void)\n{\n\tint t,n,i,gk=0;\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d %d\",&t,&n);\n\t\tif(t==1){\n\t\t\tgk=6000*n;\n\t\t}\n\t\telse if(t==2){\n\t\t\tgk=4000*n;\n\t\t}\n\t\telse if(t==3){\n\t\t\tgk=3000*n;\n\t\t}\n\t\telse if(t==4){\n\t\t\tgk=2000*n;\n\t\t}\n\t\tprintf(\"%d\\n\",gk);\n\t}\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tHashMap<Integer,Integer> ticket = new HashMap<Integer,Integer>();\n\t\tticket.put(1,6000);\n\t\tticket.put(2,4000);\n\t\tticket.put(3,3000);\n\t\tticket.put(4,2000);\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(int i=0;i<4;i++){\n\t\t\tSystem.out.println(ticket.get(sc.nextInt())*sc.nextInt());\n\t\t}\n\t}\n}", "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n\tint a,b;\n\twhile(cin>>a>>b){\n\t\tif(a==1)\n\t\t\tcout<<6000*b<<endl;\n\t\tif(a==2)\n\t\t\tcout<<4000*b<<endl;\n\t\tif(a==3)\n\t\t\tcout<<3000*b<<endl;\n\t\tif(a==4)\n\t\t\tcout<<2000*b<<endl;\n\t}\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint v[5];\n\tv[1]=6000;\n\tv[2]=4000;\n\tv[3]=3000;\n\tv[4]=2000;\n\tfor(int i=0;i<4;i++){\n\t\tint t,n;\n\t\tcin>>t>>n;\n\t\tcout<<v[t]*n<<endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n\n\tfor(int i=0;i<4;i++){\n\t\tint t,ts[]={6000,4000,3000,2000},n;\n\t\t\n\t\tcin >> t >> n ;\n\t\t\n\n\t\tcout << ts[t-1]*n <<endl;\n\t}\n\treturn 0;\n}", "for i in range(4):\n t,n=map(int,input().split())\n if t==1:print(n*6000)\n elif t==2:print(n*4000)\n elif t==3:print(n*3000)\n elif t==4:print(n*2000)\n", "for i in range(4):\n _in=[int(num)for num in input().split(' ')]\n n=_in[0]\n if n==1:\n print(6000*_in[1])\n elif n==2:\n print(4000*_in[1])\n elif n==3:\n print(3000*_in[1])\n else:\n print(2000*_in[1])", "import java.util.Scanner;\n\npublic class Main {\n\tpublic static final int[] PRICE = {6000,4000,3000,2000};\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(int i=0;i<4;i++) {\n\t\t\tint t = sc.nextInt();\n\t\t\tint n = sc.nextInt();\n\t\t\tSystem.out.println(PRICE[t-1] * n);\n\t\t}\n\t}\n\n}", "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n for(int i = 0; i < 4; i++){\n switch(scan.nextInt()){\n case 1:\n System.out.println(scan.nextInt() * 6000);\n break;\n case 2:\n System.out.println(scan.nextInt() * 4000);\n break;\n case 3:\n System.out.println(scan.nextInt() * 3000);\n break;\n default:\n System.out.println(scan.nextInt() * 2000);\n break;\n }\n }\n scan.close();\n }\n}\n", "import java.util.Scanner;\npublic class Main{\n public void solve(){\n Scanner sc = new Scanner(System.in);\n int t,n;\n for(int i=0;i<=3;i++){\n t = sc.nextInt();\n n = sc.nextInt();\n if(t==1){\n int kei = 6000*n;\n System.out.println(kei);\n }else{\n if(t==2){\n int kei = 4000*n;\n System.out.println(kei);\n }else{\n if(t==3){\n int kei = 3000*n;\n System.out.println(kei);\n }else{\n int kei = 2000*n;\n System.out.println(kei);\n }\n }\n }\n }\n }\n public static void main(String[]args){\n Main obj = new Main();\n obj.solve();\n }\n}", "#include<cstdio>\nusing namespace std;\nint main() {\n int dd[] = {0,6000,4000,3000,2000};\n for(int i = 0; i < 4; i++) {\n int t,n;\n scanf(\"%d %d\",&t,&n);\n printf(\"%d\\n\",dd[t] * n);\n }\n return 0;\n}", "// AOJ 0277\n#include <iostream>\n\nusing namespace std;\n\nint main(void)\n{\n\tint data[] = {6000, 4000, 3000, 2000};\n\tint t, n;\n\tfor (int i = 0; i < 4; i++){\n\t\tcin >> t >> n;\n\t\tcout << (data[t - 1] * n) << endl;\n\t}\n\n\treturn 0;\n}", "i = 1\nwhile i <= 4:\n s_i,n_i = map(int,input().split())\n if s_i == 1:\n x = n_i * 6000\n elif s_i == 2:\n x = n_i * 4000\n elif s_i == 3:\n x = n_i * 3000\n else:\n x = n_i * 2000\n print(x)\n i += 1\n\n\n", "ticket={1:6000,2:4000,3:3000,4:2000}\n\nfor i in range(4):\n t,n=map(int,input().split())\n print(ticket[t]*n)\n", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint ticket[5] = {0, 6000, 4000, 3000, 2000};\n\tint t, n;\n\n\twhile(cin >> t >> n){\n\t\tcout << ticket[t]*n << endl;\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a[5] = {0, 6000, 4000, 3000, 2000};\n for (int i = 0; i < 4; ++i) {\n int t, n;\n cin >> t >> n;\n\n cout << n * a[t] << endl;\n }\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint much[]={6000,4000,3000,2000};\n\tint num;\n\tint kind;\n\tint monny=0;\n\tfor(int i=0;i<4;++i){\n\t\tcin>>kind>>num;\n\t\tcout<<much[kind-1]*num<<endl;\n\t}\n\treturn 0;\n}", "import java.util.*;\n\nclass Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int[] x = new int[5];\n x[1] = 6000;\n x[2] = 4000;\n x[3] = 3000;\n x[4] = 2000;\n for (int i = 0; i < 4; i++) {\n System.out.println(x[sc.nextInt()] * sc.nextInt());\n }\n\n }\n}", "#include<iostream>\n#define N 4\n\nusing namespace std;\n\nint main(){\n int t, n;\n for(int i=0; i<N; ++i){\n cin >> t >> n;\n if(t == 1) cout << 6000*n << endl;\n if(t == 2) cout << 4000*n << endl;\n if(t == 3) cout << 3000*n << endl;\n if(t == 4) cout << 2000*n << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n\nint a[4] = {6000,4000,3000,2000};\nint main(void){\n int aa,b;\n while(cin>>aa>>b){\n cout<<a[--aa] * b <<endl;\n }\n //*/\n}", "x = [0,6000,4000,3000,2000]\n\nfor i in range(4):\n t,n = map(int,input().split())\n print(x[t] * n)\n", "import java.util.Scanner;\npublic class Main{\n \n public void solve(){\n Scanner sc = new Scanner(System.in);\n for(int cnt=0;cnt<4;cnt++){\n int t=sc.nextInt();\n int n=sc.nextInt();\n switch(t){\n case 1:\n System.out.println(n*6000);\n break;\n case 2:\n System.out.println(n*4000);\n break;\n case 3:\n System.out.println(n*3000);\n break;\n case 4:\n System.out.println(n*2000);\n break;\n }\n }\n }\n \n public static void main(String[]args){\n Main obj = new Main();\n obj.solve();\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint data[4],money[4]={6000,4000,3000,2000};\n\tmemset(data,0,sizeof(data));\n\tfor(int i=0;i<4;i++){\n\t\tint a,b;\n\t\tcin>>a>>b;a--;\n\t\tcout<<b*money[a]<<endl;\n\t}\n}", "import java.util.*;\n\nclass Main{\n void solve(){\n Scanner sc = new Scanner(System.in);\n int t, n;\n int[] V = {0, 6000, 4000, 3000, 2000};\n\n for ( int i = 0; i < 4; i++ ){\n t = sc.nextInt();\n n = sc.nextInt();\n System.out.println(V[t]*n);\n }\n }\n public static void main(String[] args){ new Main().solve(); }\n}\n\n\n", "for i in range(4):\n a,b = map(int,input().split())\n if a == 1:\n print(6000*b)\n elif a == 2:\n print(4000*b)\n elif a == 3:\n print(3000*b)\n elif a == 4:\n print(2000*b)\n else:\n pass\n \n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint t,n;\n\tfor(int i=0;i<4;i++){\n\t\tcin >> t >> n;\n\t\tif(t == 1) t = 6000;\n\t\tif(t == 2) t = 4000;\n\t\tif(t == 3) t = 3000;\n\t\tif(t == 4) t = 2000;\n \t\tcout << t*n << endl;\n\t}\n\treturn 0;\n}", "val = ( \\\n 0,\n 6000,\n 4000,\n 3000,\n 2000)\n\nfor v in [(lambda s: val[s[0]] * s[1])(list(map(int,input().split()))) for i in range(4)]:\n print(v)", "import java.util.Scanner;\npublic class Main{\n \n public void solve(){\n Scanner sc = new Scanner(System.in);\n\t int ninzu,k;\n\t int ban;\n\t for(int i=0;i<4;i++){\n\t \tban = sc.nextInt();\n\t\tif(ban == 1){\n\t\t\tk = 6000;\n\t\t}else if(ban == 2){\n\t\t\tk = 4000;\n\t\t}else if(ban == 3){\n\t\t\tk = 3000;\n\t\t}else{\n\t\t\tk = 2000;\n\t\t}\n\t\tninzu = sc.nextInt();\n\t\tint uriage = k*ninzu;\n\t\tSystem.out.println(uriage);\n\t }\n }\n public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "#include<iostream>\nusing namespace std;\nint main() {\n\tint a[4] = { 6000,4000,3000,2000 };\n\tint b, c;\n\tfor (int i = 0; i < 4; i++) {\n\t\tcin >> b >> c;\n\t\tcout << a[b - 1] * c << endl;\n\t}\n}", "t1,n1=(int(x) for x in input().split())\nt2,n2=(int(x) for x in input().split())\nt3,n3=(int(x) for x in input().split())\nt4,n4=(int(x) for x in input().split())\n\nif t1==1:\n print(n1*6000)\nelif t1==2:\n print(n1*4000)\nelif t1==3:\n print(n1*3000)\nelse:\n print(n1*2000)\n \nif t2==1:\n print(n2*6000)\nelif t2==2:\n print(n2*4000)\nelif t2==3:\n print(n2*3000)\nelse:\n print(n2*2000)\n\nif t3==1:\n print(n3*6000)\nelif t3==2:\n print(n3*4000)\nelif t3==3:\n print(n3*3000)\nelse:\n print(n3*2000)\n\nif t4==1:\n print(n4*6000)\nelif t4==2:\n print(n4*4000)\nelif t4==3:\n print(n4*3000)\nelse:\n print(n4*2000)\n", "a,b=(int(x) for x in input().split())\nc,d=(int(x) for x in input().split())\ne,f=(int(z) for z in input().split())\ng,h=(int(s) for s in input().split())\n\nif a==1:\n x=6000*b\n print(x)\n if c==2:\n y=4000*d\n print(y)\n if e==3:\n z=3000*f\n print(z)\n if e==4:\n z=2000*f\n print(z)\n if g==4:\n s=2000*h\n print(s)\n if g==3:\n s=3000*h\n print(s)\n \n if c==3:\n y=3000*d\n print(y)\n if e==2:\n z=4000*f\n print(z)\n if e==4:\n z=2000*f\n print(z)\n if g==4:\n s=2000*h\n print(s)\n if g==2:\n s=4000*h\n print(s)\n \n if c==4:\n y=2000*d\n print(y)\n if e==3:\n z=3000*f\n print(z)\n if e==2:\n z=4000*f\n print(z)\n if g==2:\n s=4000*h\n print(s)\n if g==3:\n s=3000*h\n print(s)\n\nelif a==2:\n x=4000*b\n print(x)\n if c==1:\n y=6000*d\n print(y)\n if e==3:\n z=3000*f\n print(z)\n if e==4:\n z=2000*f\n print(z)\n if g==4:\n s=2000*h\n print(s)\n if g==3:\n s=3000*h\n print(s)\n \n if c==3:\n y=3000*d\n print(y)\n if e==1:\n z=6000*f\n print(z)\n if e==4:\n z=2000*nf\n print(z)\n if g==4:\n s=2000*h\n print(s)\n if g==1:\n s=6000*h\n print(s)\n \n if c==4:\n y=2000*d\n print(y)\n if e==3:\n z=3000*f\n print(z)\n if e==1:\n z=6000*f\n print(z)\n if g==1:\n s=6000*h\n print(s)\n if g==3:\n s=3000*h\n print(s)\n \nelif a==3:\n x=3000*b\n print(x)\n if c==2:\n y=4000*d\n print(y)\n if e==1:\n z=6000*f\n print(z)\n if e==4:\n z=2000*f\n print(z)\n if g==4:\n s=2000*h\n print(s)\n if g==1:\n s=6000*h\n print(s)\n \n if c==1:\n y=6000*d\n print(y)\n if e==2:\n z=4000*f\n print(z)\n if e==4:\n z=2000*f\n print(z)\n if g==4:\n s=2000*h\n print(s)\n if g==2:\n s=4000*h\n print(s)\n \n if c==4:\n y=2000*d\n print(y)\n if e==1:\n z=6000*f\n print(z)\n if e==2:\n z=4000*f\n print(z)\n if g==2:\n s=4000*h\n print(s)\n if g==1:\n s=6000*h\n print(s)\n \nelse:\n x=2000*b\n print(x)\n if c==2:\n y=4000*d\n print(y)\n if e==3:\n z=3000*f\n print(z)\n if e==1:\n z=5000*f\n print(z)\n if g==1:\n s=6000*h\n print(s)\n if g==3:\n s=3000*h\n print(s)\n \n if c==3:\n y=3000*d\n print(y)\n if e==2:\n z=4000*f\n print(z)\n if e==1:\n z=6000*f\n print(z)\n if g==1:\n s=6000*h\n print(s)\n if g==2:\n s=4000*h\n print(s)\n \n if c==1:\n y=6000*d\n print(y)\n if e==3:\n z=3000*f\n print(z)\n if e==2:\n z=4000*f\n print(z)\n if g==2:\n s=6000*h\n print(s)\n if g==3:\n s=3000*h\n print(s)\n", "import java.util.Scanner;\nclass Main{\n\t\n public void solve(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint ninzu, k;\n\t\tint ban;\n for(int i=0; i<4; i++){\n\t \tban=sc.nextInt();\n\t\tif(ban ==1){\n\t\t\tk=6000;\n\t\t}else if(ban ==2){\n\t\t\tk=4000;\n\t\t}else if(ban ==3){\n\t\t\tk=3000;\n\t\t}else{\n\t\t\tk=2000;\n\t\t}\n\t\t\n\t\tninzu=sc.nextInt();\n\t\tint uriage = k * ninzu;;\n\t\tSystem.out.println(uriage);\n }\n }\n\t public static void main(String[] args){\n Main obj = new Main();\n obj.solve();\n }\n}", "t1,n1 = map(int,input().split())\nt2,n2 = map(int,input().split())\nt3,n3 = map(int,input().split())\nt4,n4 = map(int,input().split())\nti = [t1,t2,t3,t4,0]\nni = [n1,n2,n3,n4,0]\ni = 0\nwhile ti[i] != 0:\n if ti[i] == 1:\n print(ni[i]*6000)\n elif ti[i] == 2:\n print(ni[i]*4000)\n elif ti[i] == 3:\n print(ni[i]*3000)\n else:\n print(ni[i]*2000)\n i += 1\n\n", "import java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tSolve s = new Solve();\n\t\ts.solve();\n\t}\t\n}\n\nclass Solve{\n\tSolve(){}\n\t\n\tScanner in = new Scanner(System.in);\n\n\tvoid solve(){\n\t\tint[] dat ={0, 6000, 4000, 3000, 2000};\n\t\tfor(int i = 0; i < 4; i++) {\n\t\t\tint n = in.nextInt(), m = in.nextInt();\n\t\t\tSystem.out.println(dat[n] * m);\n\t\t}\n\t}\n\n}", "#include <stdio.h>\n\nint main(void) {\n int i, j, k, a, b, p[5] = {0, 6000, 4000, 3000, 2000};\n for(i = 0; i < 4; ++i) {\n scanf(\"%d%d\", &a, &b);\n printf(\"%d\\n\", p[a] * b);\n }\n return 0;\n}\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint ticket[5]={0,6000,4000,3000,2000},t,n;\n\twhile(0);\n\twhile(cin>>t>>n){\n\t\tcout<<ticket[t]*n<<endl;\n\t}\n}", "t1,n1 = map(int,input().split())\nt2,n2 = map(int,input().split())\nt3,n3 = map(int,input().split())\nt4,n4 = map(int,input().split())\n\nif t1 == 1:\n print(6000 * n1)\nelif t1 == 2:\n print(4000 * n1)\nelif t1 == 3:\n print(3000 * n1)\nelif t1 == 4:\n print(2000 * n1)\n\nif t2 == 1:\n print(6000 * n2)\nelif t2 == 2:\n print(4000 * n2)\nelif t2 == 3:\n print(3000 * n2)\nelif t2 == 4:\n print(2000 * n2)\n\nif t3 == 1:\n print(6000 * n3)\nelif t3 == 2:\n print(4000 * n3)\nelif t3 == 3:\n print(3000 * n3)\nelif t3 == 4:\n print(2000 * n3)\n\nif t4 == 1:\n print(6000 * n4)\nelif t4 == 2:\n print(4000 * n4)\nelif t4 == 3:\n print(3000 * n4)\nelif t4 == 4:\n print(2000 * n4)\n", "price = [0, 6000, 4000, 3000, 2000]\n\nfor i in range(4):\n p, n = map(int, input().split())\n print(price[p] * n)\n", "for i in range(4):\n t1,n1=(int(x) for x in input().split())\n if t1==1:print(n1*6000)\n if t1==2:print(n1*4000)\n if t1==3:print(n1*3000)\n if t1==4:print(n1*2000)\n\n", "#include <iostream>\nusing namespace std;\nint v[]={6000,4000,3000,2000};\nint main(void){\n for(int i=0;i<4;i++){\n int a,b;\n cin >> a >> b;\n cout << v[--a]*b << endl;\n }\n}\n", "f1, n1 = (int(x) for x in input().split())\nf2, n2 = (int(x) for x in input().split())\nf3, n3 = (int(x) for x in input().split())\nf4, n4 = (int(x) for x in input().split())\n\nif f1 == 1:\n print(6000*n1)\nif f1 == 2:\n print(4000*n1)\nif f1 == 3:\n print(3000*n1)\nif f1 == 4:\n print(2000*n1)\n \nif f2 == 1:\n print(6000*n2)\nif f2 == 2:\n print(4000*n2)\nif f2 == 3:\n print(3000*n2)\nif f2 == 4:\n print(2000*n2)\n\nif f3 == 1:\n print(6000*n3)\nif f3 == 2:\n print(4000*n3)\nif f3 == 3:\n print(3000*n3)\nif f3 == 4:\n print(2000*n3)\n \nif f4 == 1:\n print(6000*n4)\nif f4 == 2:\n print(4000*n4)\nif f4 == 3:\n print(3000*n4)\nif f4 == 4:\n print(2000*n4)\n", "for i in range(4):\n t,n=map(int,input().split())\n if t==1:\n print(6000*n)\n elif t==2:\n print(4000*n)\n elif t==3:\n print(3000*n)\n else:\n print(2000*n)\n \n", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint ticket[4] = {6000,4000,3000,2000};\n\tint t,n;\n\tfor(int i=0;i<4;++i){\n\t\tcin>>t>>n;\n\t\tcout<<ticket[t-1]*n<<endl;\n\t}\n\treturn 0;\n}", "u = {1:6000 , 2:4000 , 3:3000, 4:2000}\nfor _ in xrange(4):\n a, b = [ int(_) for _ in raw_input().split() ]\n print u[a] * b", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint cost[] = {-1, 6000, 4000, 3000, 2000};\n\t\n\tfor(int i=0; i<4; ++i){\n\t\tint t , n;\n\t\tcin >> t >> n;\n\t\tcout << (cost[t]*n) << endl;\n\t}\n}\n", "import java.util.Scanner;\nclass Main{\n int maisu;\n int seki;\n int cnt=0;\n \n public void solve(){\n Scanner sc = new Scanner(System.in);\n \n while(cnt<4){\n seki = sc.nextInt();\n maisu = sc.nextInt();\n switch(seki){\n case 1:\n seki = 6000;\n break;\n case 2:\n seki = 4000;\n break;\n case 3:\n seki = 3000;\n break;\n case 4:\n seki = 2000;\n break;\n }\n cnt++;\n System.out.println(seki*maisu);\n }\n }\n public static void main(String[]args){\n Main obj = new Main();\n obj.solve();\n }\n }\n ", "#include<iostream>\nusing namespace std;\n\nint main(void){\n int a,b;\n while(cin>>a>>b){\n switch(a){\n case 1:a=b*6000;break;\n case 2:a=b*4000;break;\n case 3:a=b*3000;break;\n case 4:a=b*2000;break;\n }\n cout<<a<<endl;\n }\n \n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n//INSERT ABOVE HERE\nsigned main(){\n Int v[]={0,6000,4000,3000,2000};\n for(Int i=0;i<4;i++){\n Int t,x;\n cin>>t>>x;\n cout<<v[t]*x<<endl;\n }\n return 0;\n}\n\n", "dic={1:6000,2:4000,3:3000,4:2000}\n\nfor i in range(4):\n t,n=map(int,input().split())\n print(dic[t]*n)\n", "import java.util.Scanner;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] a = new int[4];\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tint x = sc.nextInt();\n\t\t\tswitch(x){\n\t\t\tcase 1: a[i] = sc.nextInt() * 6000;\n\t\t\tbreak;\n\t\t\tcase 2: a[i] = sc.nextInt() * 4000;\n\t\t\tbreak;\n\t\t\tcase 3: a[i] = sc.nextInt() * 3000;\n\t\t\tbreak;\n\t\t\tcase 4: a[i] = sc.nextInt() * 2000;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < 4; i++)\n\t\t\tSystem.out.println(a[i]);\n\t\t\n\t\t}\n\t}", "r={1:6,2:4,3:3,4:2}\nfor i in r:\n\tt,n=map(int,raw_input().split())\n\tprint r[t]*n*1000", "t1,n1=map(int,input().split())\nt2,n2=map(int,input().split())\nt3,n3=map(int,input().split())\nt4,n4=map(int,input().split())\n\nif t1==1:\n print(6000*n1)\nelif t1==2:\n print(4000*n1)\nelif t1==3:\n print(3000*n1)\nelse:\n print(2000*n1)\n \nif t2==1:\n print(6000*n2)\nelif t2==2:\n print(4000*n2)\nelif t2==3:\n print(3000*n2)\nelse:\n print(2000*n2)\n \nif t3==1:\n print(6000*n3)\nelif t3==2:\n print(4000*n3)\nelif t3==3:\n print(3000*n3)\nelse:\n print(2000*n3)\n \nif t4==1:\n print(6000*n4)\nelif t4==2:\n print(4000*n4)\nelif t4==3:\n print(3000*n4)\nelse:\n print(2000*n4)\n", "list=[None,6000,4000,3000,2000]\nfor i in range(4):\n t,n=map(int,input().split())\n print(list[t]*n)\n", "cost={1:6000,2:4000,3:3000,4:2000}\nfor i in range(4):\n t,n=map(int,raw_input().split())\n print cost[t]*n", "#include <iostream>\nusing namespace std;\nint main(void){\n int t,n;\n for(int i=0; i<4; i++){\n cin>>t>>n;\n if(t==1)cout<<n*6000<<endl;\n else if(t==2)cout<<n*4000<<endl;\n else if(t==3)cout<<n*3000<<endl;\n else if(t==4)cout<<n*2000<<endl;\n \n }\n \n}\n\n", "i=0\nwhile i<4:\n t,n=map(int,input().split())\n if t==1:\n ans=n*6000\n elif t==2:\n ans=n*4000\n elif t==3:\n ans=n*3000\n elif t==4:\n ans=n*2000\n \n print(ans)\n i+=1\n", "#include<bits/stdc++.h>\nusing namespace std;\nint v[]={6000,4000,3000,2000};\nint main(){\n for(int i=0;i<4;i++){\n int a,b;cin>>a>>b;\n cout<<v[--a]*b<<endl;\n }\n return 0;\n}", "xy=[map(int,input().split()) for a in range(4)]\nx,y=[list(i) for i in zip(*xy)]\n\nfor i in range(4):\n if x[i]==1:\n print(y[i]*6000)\n elif x[i]==2:\n print(y[i]*4000)\n elif x[i]==3:\n print(y[i]*3000)\n else:\n print(y[i]*2000)\n", "public class Main{\n public void run(java.io.InputStream in, java.io.PrintStream out){\n java.util.Scanner sc = new java.util.Scanner(in);\n/*answer*/\n int t, s, i;\n\n for(i = 0;i < 4;i++){\n t = sc.nextInt(); s = sc.nextInt();\n if(t == 1)out.println(6000 * s);\n else if(t == 2)out.println(4000 * s);\n else if(t == 3)out.println(3000 * s);\n else out.println(2000 * s);\n }\n\n sc.close();\n }\n public static void main(String[] args){\n (new Main()).run(System.in, System.out);\n }\n}", "tic={1:6000,2:4000,3:3000,4:2000}\nfor i in range(4):\n t,n=map(int,input().split())\n print(n*tic[t])\n", "p = (0, 6000, 4000, 3000, 2000)\nfor _ in range(4):\n a, n = map(int, input().split())\n print(p[a] * n)\n", "#include <iostream>\nint main(){\nint nType, nNum;\nint aPrice[4] = {6000, 4000, 3000, 2000};\nfor ( int i = 0; i < 4; i++ ){\nstd::cin >> nType >> nNum;\nstd::cout << aPrice[nType-1]*nNum << std::endl;\n}\n}", "#include<stdio.h>\nint main(){\nint i,a,b;\n\tfor(i=0;i<4;i++){\n\tscanf(\"%d %d\",&a,&b);\n\tif(a==1){\n\tb=b*6000;\n\t}if(a==2){\n\tb=b*4000;\n\t}if(a==3){\n\tb=b*3000;\n\t}if(a==4){\n\tb=b*2000;\n\t}\n\tprintf(\"%d\\n\",b);\n\t}\n\treturn 0;\n}", "import java.io.IOException;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Scanner;\n\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint[] prize = new int[]{6000, 4000, 3000, 2000};\n\t\t\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tfinal int t = sc.nextInt() - 1;\n\t\t\tfinal int n = sc.nextInt();\n\t\t\t\n\t\t\tSystem.out.println(prize[t] * n);\n\t\t}\n\t\t\n\t}\n\n}", "#include <iostream>\nusing namespace std;\nint main(void){\n int i;\n for(i=1;i<=4;i++){\n int t,n;\n cin>>t>>n;\n if(t==1) cout<<6000*n;\n if(t==2) cout<<4000*n;\n if(t==3) cout<<3000*n;\n if(t==4) cout<<2000*n;\n cout<<endl;\n }\n}\n\n", "t1,n1 = map(int, input().split())\nt2,n2 = map(int, input().split())\nt3,n3 = map(int, input().split())\nt4,n4 = map(int, input().split())\n\nif t1==1:\n print(n1*6000)\nelif t1==2:\n print(n1*4000)\nelif t1==3:\n print(n1*3000)\nelse:\n print(n1*2000)\n\nif t2==1:\n print(n2*6000)\nelif t2==2:\n print(n2*4000)\nelif t2==3:\n print(n2*3000)\nelse:\n print(n2*2000)\n\nif t3==1:\n print(n3*6000)\nelif t3==2:\n print(n3*4000)\nelif t3==3:\n print(n3*3000)\nelse:\n print(n3*2000)\n\nif t4==1:\n print(n4*6000)\nelif t4==2:\n print(n4*4000)\nelif t4==3:\n print(n4*3000)\nelse:\n print(n4*2000) \n", "# coding: utf-8\n# Your code here!\n\nfor i in range(4) :\n t, n = map(int, input().split())\n if t == 1:\n print(n * 6000)\n elif t == 2:\n print(n * 4000)\n elif t == 3:\n print(n * 3000)\n else:\n print(n * 2000)\n", "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n\tnew Main().run();\n }\n Scanner sc = new Scanner(System.in);\n\n int[] price = {0, 6000, 4000, 3000, 2000};\n int t, n;\n\n void run(){\n\twhile(sc.hasNext()){\n\t t = sc.nextInt();\n\t n = sc.nextInt();\n\t System.out.println(price[t] * n);\n\t}\n }\n}", "#include \"bits/stdc++.h\"\n#define rep(i,a,n) for(int (i) = (a);(i) < (n);(i)++)\nusing namespace std;\n\nint main(){\n int a[4] = {6000,4000,3000,2000},n,m;\n \n \n rep(i,0,4){\n cin >> n >> m;\n a[n-1] *= m;\n cout << a[n-1] << endl;\n }\n return 0;\n}\n", "#include <iostream>\nusing namespace std;\nint main(){\n\tint n;\n\tint t;\n\tfor(int i=0;i<4;i++){\n\t\tcin>>t>>n;\n\t\tif(t==1){\n\t\t\tcout<<6000*n<<endl;\n\t\t}else if(t==2){\n\t\t\tcout<<4000*n<<endl;\n\t\t}else if(t==3){\n\t\t\tcout<<3000*n<<endl;\n\t\t}else if(t==4){\n\t\t\tcout<<2000*n<<endl;\n\t\t}\n\t}\n}", "p=[6,4,3,2]\nfor _ in range(4):\n t,n=map(int,input().split())\n print(p[t-1]*n*1000)", "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint main(){\n int v[]={6000,4000,3000,2000};\n for(int i=0;i<4;i++){\n int n,m;\n cin>>n>>m;\n cout<<v[n-1]*m<<endl;\n }\n}", "prices=[0,6000,4000,3000,2000]\nfor _ in range(4):\n (t,n)=map(int,input().split())\n print(prices[t]*n)", "ticket={1:6000, 2:4000, 3:3000, 4:2000}\nfor i in range(4):\n t, n =map(int,input().split())\n print(n*ticket[t])\n", "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\tconst int cost[4] = {6000,4000,3000,2000};\n\tint t,n;\n\tfor(int i = 0;i < 4;i++){\n\t\tcin >> t >> n;\n\t\tcout << cost[t - 1] * n << endl;\n\t}\n\treturn 0;\n}", "#include<stdio.h>\nint main(void)\n{\n\tint i,a,s,d;\n\tfor(i=1;i<=4;i++){\n\tscanf(\"%d %d\",&s,&d);\n\tif(s==1){\n\t\ts=6000;\n\t\t}\n\tif(s==2){\n\t\ts=4000;\n\t\t}\n\tif(s==3){\n\t\ts=3000;\n\t\t}\n\tif(s==4){\n\t\ts=2000;\n\t\t}\n\ta=s*d;\n\tprintf(\"%d\\n\",a);\n\t}\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int a,b,ans;\n for(int i=0;i<4;i++){\n cin >> a >> b;\n if(a==1)ans=6000*b;\n else if(a==2)ans=4000*b;\n else if(a==3)ans=3000*b;\n else if(a==4)ans=2000*b;\n cout << ans << endl;\n }\n}", "t1,n1=map(int,input().split())\nt2,n2=map(int,input().split())\nt3,n3=map(int,input().split())\nt4,n4=map(int,input().split())\n\nP=0\nfor i in range(1,n1+1):\n if t1==1:\n P+=6000\n if t1==2:\n P+=4000\n if t1==3:\n P+=3000\n if t1==4:\n P+=2000\n\nQ=0\nfor j in range(1,n2+1):\n if t2==1:\n Q+=6000\n if t2==2:\n Q+=4000\n if t2==3:\n Q+=3000\n if t2==4:\n Q+=2000\n \nR=0 \nfor k in range(1,n3+1):\n if t3==1:\n R+=6000\n if t3==2:\n R+=4000\n if t3==3:\n R+=3000\n if t3==4:\n R+=2000\n \nS=0\nfor l in range(1,n4+1):\n if t4==1:\n S+=6000\n if t4==2:\n S+=4000\n if t4==3:\n S+=3000\n if t4==4:\n S+=2000\n \nprint(P)\nprint(Q)\nprint(R)\nprint(S)\n", "#include <iostream>\nusing namespace std;\nint main(){\n int t,n;\n for(int i=0;i<4;i++){\n cin>>t>>n;\n if(t==1)cout<<6000*n<<endl;\n else if(t==2)cout<<4000*n<<endl;\n else if(t==3)cout<<3000*n<<endl;\n else cout<<2000*n<<endl;\n }\n}\n\n", "for i in range(4):\n t,s = map(int,input().split(\" \"))\n \n if t == 1:\n print(s*6000)\n elif t == 2:\n print(s*4000)\n elif t == 3:\n print(s*3000)\n else:\n print(s*2000)\n", "n=[0,6000,4000,3000,2000]\n\nfor i in range(4):\n a,b=map(int,input().split())\n print(n[a]*b)\n", "#include <iostream>\nusing namespace std;\nint main(){\n\tint a,b;\n\tfor (int A=0;A<4;A++){\n\t\tcin>>a>>b;\n\t\tif (a==1)cout<<6000*b<<endl;\n\t\tif (a==2)cout<<4000*b<<endl;\n\t\tif (a==3)cout<<3000*b<<endl;\n\t\tif (a==4)cout<<2000*b<<endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint t,n;\n\tfor(int i=0;i<4;i++){\n\tcin >> t >> n;\n\tint re;\n\tif(t==1){\n\tre=6000*n;\n\t}else if(t==2){\n\tre=4000*n;\n\t}else if(t==3){\n\tre=3000*n;\n\t}else if(t==4){\n\tre=2000*n;\n\t}\n\tcout<< re << \"\\n\";\n\t}\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\n\nint price[4] = { 6000, 4000, 3000, 2000 };\n\nint main() {\n int t, n;\n for (int i=0; i<4; ++i) {\n cin >> t >> n;\n cout << price[t-1] * n << endl;\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint a,b;\n\tfor(int i=0;i<4;i++){\n\t\tcin >> a >> b;\n\t\tif(a==1){\n\t\t\tcout << b*6000 << endl;\n\t\t}else if(a==2){\n\t\t\tcout << b*4000 << endl;\n\t\t}else if(a==3){\n\t\t\tcout << b*3000 << endl;\n\t\t}else{\n\t\t\tcout << b*2000 << endl;\n\t\t}\n\t}\n}\t\n\t\t\t\n", "for i in range(4) :\n t, n = map(int, input().split())\n if t == 1:\n print(n * 6000)\n elif t == 2:\n print(n * 4000)\n elif t == 3:\n print(n * 3000)\n else:\n print(n * 2000)\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int t, n, a[] = {6000, 4000, 3000, 2000};\n for (int i = 0; i < 4; i++) {\n cin >> t >> n;\n cout << a[t-1] * n << endl;\n }\n\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main() {\n int m[] = {6000,4000,3000,2000};\n int a, b;\n \n for(int i=0; i<4; i++) {\n cin >> a >> b;\n cout << b*m[a-1] << endl;\n }\n \n return 0;\n}", "list=[]\nfor i in range(4):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if a==1:\n m=6000*b\n elif a==2:\n m=4000*b\n elif a==3:\n m=3000*b\n else:\n m=2000*b\n print(m)\n", "//問２　2736 渡辺彩子\nimport java.util.Scanner;\npublic class Main{\n \n public void solve(){\n Scanner sc=new Scanner(System.in);\n for(int a=0;a<4;a++){\n int ban=sc.nextInt();\n int suu=sc.nextInt();\n switch(ban){\n case 1:\n System.out.println(suu*6000);\n break;\n case 2:\n System.out.println(suu*4000);\n break;\n case 3:\n System.out.println(suu*3000);\n break;\n case 4:\n System.out.println(suu*2000);\n break;\n }\n }\n\n }\n \n \npublic static void main(String[]args){ \n Main obj=new Main();\n obj.solve();\n}\n}", "#include <iostream>\n\nusing namespace std;\nint price[4] = {6000, 4000, 3000, 2000};\n\nvoid solve()\n{\n\tfor(int i = 0; i < 4; ++i)\n\t{\n\t\tint t, n;\n\t\tcin >> t >> n;\n\t\tcout << price[t - 1] * n << endl;\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}", "\nimport java.util.Scanner;\n\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tint kin = 0;\n\t\tint a,b;\n\t\tfor(int i=0;i<4;i++){\n\t\t\ta = sc.nextInt();\n\t\t\tb = sc.nextInt();\n\t\t\tswitch (a) {\n\t\t\tcase 1:\n\t\t\t\tkin =6000*b;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tkin =4000*b;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tkin =3000*b;\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tkin =2000*b;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tSystem.out.println(kin);\n\t\t}\n\t}\n\n}", "# coding: utf-8\n# Your code here!\nfor i in range(4):\n ti,ni=map(int,input().split())\n \n if ti==1:\n print(ni*6000)\n elif ti==2:\n print(ni*4000)\n elif ti==3:\n print(ni*3000)\n else:\n print(ni*2000)\n", "c = 0\n\nwhile c <= 3:\n t, n = map(int,input().split())\n c = c + 1\n\n if t == 1:\n n = n*6000\n elif t == 2:\n n = n*4000\n elif t == 3:\n n = n*3000\n elif t == 4:\n n = n*2000\n\n print(n)\n", "#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<string>\n#include<vector>\n#include<map>\n\nusing namespace std;\n\nint main(){\n\tint p[5]={0,6000,4000,3000,2000};\n\tint t,n;\n\tfor(int i=0;i<4;i++){\n\t\tscanf(\"%d %d\",&t,&n);\n\t\tprintf(\"%d\\n\",p[t]*n);\n\t}\n}\n", "for i in range(4):\n t,n = map(int, input().split())\n if t==1:\n print(6000*n)\n if t==2:\n print(4000*n)\n if t==3:\n print(3000*n)\n if t==4:\n print(2000*n)\n else:\n pass\n", "for i in range(4):\n ti,ni=map(int,input().split())\n if ti==1:\n print(6000*ni)\n if ti==2:\n print(4000*ni)\n if ti==3:\n print(3000*ni)\n if ti==4:\n print(2000*ni)\n", "for i in range(4):\n t,n=map(int,input().split())\n if t==1:\n print(6000*n)\n elif t==2:\n print(4000*n)\n elif t==3:\n print(3000*n)\n elif t==4:\n print(2000*n)\n else:\n break\n", "#include <iostream>\n\nusing namespace std;\n\nint main() {\n int money[] = { 0, 6000, 4000, 3000, 2000 };\n int s, n;\n for (int i = 0; i < 4; i++) {\n cin >> s >> n;\n cout << money[s] * n << endl;\n }\n\n return 0;\n}", "#include <iostream>\nusing namespace std;\nint main(void){\nint t,n,i;\nfor(i=0; i<4; i++){\ncin>>t>>n;\nif(t==1)cout<<6000*n<<endl;\nelse if(t==2)cout<<4000*n<<endl;\nelse if(t==3)cout<<3000*n<<endl;\nelse if(t==4)cout<<2000*n<<endl;\n}\nreturn 0;\n}\n", "#include <iostream>\nint main(){\n int cost[] = {0, 6000, 4000, 3000, 2000};\n int t,n;\n for(int i=0; i<4; i++){\n std::cin >> t >> n;\n std::cout << cost[t]*n << std::endl;\n }\n return 0;\n}", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint t, n;\n\t\tint ans = 0;\n\t\t\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tt = scan.nextInt();\n\t\t\tn = scan.nextInt();\n\t\t\t\n\t\t\tif(t == 1)ans = n * 6000;\n\t\t\telse if(t == 2)ans = n * 4000;\n\t\t\telse if(t == 3)ans = n * 3000;\n\t\t\telse if(t == 4)ans = n * 2000;\n\t\t\t\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}", "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\n\tstatic void solve (FastScanner in, PrintWriter out, Methods ms) {\n\t\t\n\t\tfor (int i=0; i<4; i++) {\n\t\t\tint ticket = in.nextInt();\n\t\t\tif (ticket == 1) {\n\t\t\t\tout.println(in.nextInt() * 6000);\n\t\t\t}\n\t\t\telse if (ticket == 2) {\n\t\t\t\tout.println(in.nextInt() * 4000);\n\t\t\t}\n\t\t\telse if (ticket == 3) {\n\t\t\t\tout.println(in.nextInt() * 3000);\n\t\t\t}\n\t\t\telse if (ticket == 4) {\n\t\t\t\tout.println(in.nextInt() * 2000);\n\t\t\t}\n\t\t}\n\t}\n\n\n\n\tpublic static void main(String[] args) {\n\t\tFastScanner in = new FastScanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tMethods ms = new Methods();\n\t\tsolve(in, out, ms);\n\t\tin.close();\n\t\tout.close();\n\t}\n\n\tstatic class Methods {\n\n\t\tpublic void print (Object... ar) {System.out.println(Arrays.deepToString(ar));}\n\n\t\tpublic int max (int... ar) {Arrays.sort(ar); return ar[ar.length-1];}\n\n\t\tpublic int min (int... ar) {Arrays.sort(ar); return ar[0];}\n\n\t\tpublic long gcd (long a, long b) {return b>0?gcd(b,a%b):a;}\n\n\t\tpublic long lcm (long a, long b) {return a/gcd(a,b)*b;}\n\n\t\tpublic long factorial (int i) {\n\t\t\tif (i==1) return 1;\n\t\t\telse return i*factorial(i-1);\n\t\t}\n\n\t\tpublic int manhat (int x1, int y1, int x2, int y2) {\n\t\t\treturn Math.abs(x1-x2)+Math.abs(y1-y2);\n\t\t}\n\n\t\tpublic double euclid (double x1, double y1, double x2, double y2) {\n\t\t\treturn Math.sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\t\t}\n\n\t\tpublic boolean isPrime (int n) {\n\t\t\tif (n==2) return true;\n\t\t\tif (n<2 || n%2==0) return false;\n\t\t\tfor (int i=3; i<=Math.sqrt(n); i+=2) if(n%i==0) return false;\n\t\t\treturn true;\n\t\t}\n\n\t}\n\n\tstatic class FastScanner {\n\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int length = 0, p = 0;\n\n\t\tpublic FastScanner (InputStream stream) {\n\t\t\tin = stream;\n\t\t}\n\n\t\tpublic boolean hasNextByte () {\n\t\t\tif (p < length) return true;\n\t\t\telse {\n\t\t\t\tp = 0;\n\t\t\t\ttry {length = in.read(buffer);}\n\t\t\t\tcatch (Exception e) {e.printStackTrace();}\n\t\t\t\tif (length <= 0) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic int readByte () {\n\t\t\tif (hasNextByte() == true) return buffer[p++];\n\t\t\treturn -1;\n\t\t}\n\n\t\tpublic boolean isPrintable (int n) {return 33<=n&&n<=126;}\n\n\t\tpublic void skip () {\n\t\t\twhile (hasNextByte() && !isPrintable(buffer[p])) p++;\n\t\t}\n\n\t\tpublic boolean hasNext () {skip(); return hasNextByte();}\n\n\t\tpublic String next () {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint t = readByte();\n\t\t\twhile (isPrintable(t)) {\n\t\t\t\tsb.appendCodePoint(t);\n\t\t\t\tt = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic String[] nextArray (int n) {\n\t\t\tString[] ar = new String[n];\n\t\t\tfor (int i=0; i<n; i++) ar[i] = next();\n\t\t\treturn ar;\n\t\t}\n\n\t\tpublic int nextInt () {return Math.toIntExact(nextLong());}\n\n\t\tpublic int[] nextIntArray (int n) {\n\t\t\tint[] ar = new int[n];\n\t\t\tfor (int i=0; i<n; i++) ar[i] = nextInt();\n\t\t\treturn ar;\n\t\t}\n\n\t\tpublic long nextLong () {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tboolean minus = false;\n\t\t\tint temp = readByte();\n\t\t\tif (temp == '-') {\n\t\t\t\tminus = true;\n\t\t\t\ttemp = readByte();\n\t\t\t}\n\t\t\tif (temp<'0' || '9'<temp) throw new NumberFormatException();\n\t\t\tlong n = 0;\n\t\t\twhile (isPrintable(temp)) {\n\t\t\t\tif ('0'<=temp && temp<='9') {\n\t\t\t\t\tn *= 10;\n\t\t\t\t\tn += temp - '0';\n\t\t\t\t}\n\t\t\t\telse throw new NumberFormatException();\n\t\t\t\ttemp = readByte();\n\t\t\t}\n\t\t\treturn minus? -n : n;\n\t\t}\n\n\t\tpublic long[] nextLongArray (int n) {\n\t\t\tlong[] ar = new long[n];\n\t\t\tfor (int i=0; i<n; i++) ar[i] = nextLong();\n\t\t\treturn ar;\n\t\t}\n\n\t\tpublic double nextDouble () {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic double[] nextDoubleArray (int n) {\n\t\t\tdouble[] ar = new double[n];\n\t\t\tfor (int i=0; i<n; i++) ar[i] = nextDouble();\n\t\t\treturn ar;\n\t\t}\n\n\t\tpublic void close () {\n\t\t\ttry {in.close();}\n\t\t\tcatch(Exception e){}\n\t\t}\n\n\t}\n\n}\n", "S=6000\nA=4000\nB=3000\nC=2000\n\nfor k in range(4):\n i,n1=map(int,input().split())\n if i==1:\n print(f\"{S*n1}\")\n elif i==2:\n print(f\"{A*n1}\")\n elif i==3:\n print(f\"{B*n1}\")\n elif i==4:\n print(f\"{C*n1}\")\n\n", "#include<iostream>\n\nusing namespace std;\n\nint main(){\n\n\tint kingaku[] ={6000, 4000, 3000, 2000};\n\n\tfor (int i =0; i < 4; i++){\n\t\tint t,n;\n\t\tcin >> t >> n;\n\t\tcout << kingaku[t-1] * n << endl;\n\t}\n\n\t\n\treturn 0;\n}", "i=0\nwhile i <4:\n a,b=map(int,input().split())\n if a==1:\n print(b*6000)\n elif a==2:\n print(b*4000)\n elif a==3:\n print(b*3000)\n else:\n print(b*2000)\n i += 1\n", "import java.util.Scanner;\n\npublic class Main{\n\tScanner sc =new Scanner(System.in);\n\t\n\tint kingaku;\n\tint[] goukei = new int[4];\n\tint x;\n\n\tpublic void syurui(){\n\t\tfor(x=0;x<=3;x++){\n\t\t\tint syurui = sc.nextInt();\n\t\t\tint maisuu = sc.nextInt();\n\t\t\n\t\t\n\t\t\tswitch(syurui){\n\t\t\t\tcase 1: kingaku = 6000; break;\n\t\t\t\tcase 2: kingaku = 4000; break;\n\t\t\t\tcase 3: kingaku = 3000; break;\n\t\t\t\tcase 4: kingaku = 2000; break;\n\t\t\t}\n\t\t\tgoukei[x] = kingaku * maisuu;\n\t\t}\n\t}\n\tpublic void hyouji(){\n\t\tfor(x=0;x<=3;x++){\n\t\t\tSystem.out.println(goukei[x]);\n\t\t}\n\t}\n\n\n\tpublic static void main(String[] args) {\n\t\tMain hai = new Main();\n\t\thai.syurui();\n\t\thai.hyouji();\n\n\t}\n\n}", "list=[]\nfor i in range(4):\n a,b=map(int,input().split())\n if a==1:\n a=6000\n elif a==2:\n a=4000\n elif a==3:\n a=3000\n else:\n a=2000\n list.append((a,b))\n print(a*b)\n \n", "#include <iostream>\nusing namespace std;\nint main () {\n\tint a[4]={6,4,3,2},b,c,i;\n\tfor (i=0;i<4;i++) {\n\t\tcin >> b >> c;\n\t\tcout << a[b-1]*c*1000 << endl;\n\t\t}\n return 0;\n }\n\t\n", "#include<stdio.h>\nint main(void)\n{\n\tint a,b,i,s;\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d %d\",&a,&b);\n\t\tif(a==1){\n\t\t\ts=b*6000;\n\t\t}\n\t\tif(a==2){\n\t\t\ts=b*4000;\n\t\t}\n\t\tif(a==3){\n\t\t\ts=b*3000;\n\t\t}\n\t\tif(a==4){\n\t\t\ts=b*2000;\n\t\t}\n\t\tprintf(\"%d\\n\",s);\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint t[] = new int[4];\n\t\tint m[] = new int[4];\n\t\tfor(int i = 0; i<4 ; i++){\n\t\t\tt[i] = scan.nextInt();\n\t\t\tm[i] = scan.nextInt();\n\t\t}\n\t\tfor(int i = 0; i<4 ; i++){\n\t\t\tif(t[i] == 1){\n\t\t\t\tSystem.out.println(6000*m[i]);\n\t\t\t}else if(t[i] == 2){\n\t\t\t\tSystem.out.println(4000*m[i]);\n\t\t\t}else if(t[i] == 3){\n\t\t\t\tSystem.out.println(3000*m[i]);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(2000*m[i]);\n\t\t\t}\n\t\t}\n\t}\n}", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tlong long t,n,sum=0;\n\twhile(cin>>t>>n){\n\t\tsum=0;\n\t\tif(t==1)sum+=6000*n;\n\t\telse if(t==2)sum+=4000*n;\n\t\telse if(t==3)sum+=3000*n;\n\t\telse if(t==4)sum+=2000*n;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\tScanner in = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tnew Main();\n\t}\n\tpublic Main() {\n\t\tnew AOJ0277();\n\t}\n\t\n\tclass AOJ0277{\n\t\tpublic AOJ0277() {\n\t\t\tint[] tickets = new int[4];\n\t\t\tint[] kane = {6000,4000,3000,2000};\n\t\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tlist.add(in.nextInt()-1);\n\t\t\t\ttickets[list.get(list.size()-1)] = in.nextInt();\n\t\t\t}\n\t\t\tfor(int i=0;i<list.size();i++)System.out.println(kane[list.get(i)]*tickets[list.get(i)]);\n\t\t}\n\t}\n}", "i = 0\nwhile True:\n if i == 4: break\n t, n = map(int, input().split())\n if t == 1:\n print(n*6000)\n elif t == 2:\n print(n*4000)\n elif t == 3:\n print(n*3000)\n elif t == 4:\n print(n*2000)\n i += 1\n", "#include<iostream>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n\nint main(){\n\tint val[5] = {0, 6000,4000,3000,2000};\n\trep(i,4){\n\t\tint t, n;\n\t\tcin >> t >> n;\n\t\tcout << val[t]*n << endl;\n\t}\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] k = new int[]{0,6,4,3,2};\n\t\t\n\t\tfor(int i=0;i<4;i++){\n\t\t\tint t = sc.nextInt();\n\t\t\tint n = sc.nextInt();\n\t\t\tSystem.out.println(k[t]*n*1000);\n\t\t}\n\t}\n}", "#include<iostream>\nusing namespace std;\n\nconst int p[] = {6000,4000,3000,2000};\n\nint main(){\n int t,n;\n for(int i=0;i<4;i++){\n cin >> t >> n;\n cout << p[t-1] * n << endl;\n }\n}", "#include <iostream>\nusing namespace std;\n\nint main() {\n for (int i = 0; i < 4; i++) {\n int t, n; cin >> t >> n;\n if (t == 1) cout << 6000 * n << endl;\n if (t == 2) cout << 4000 * n << endl;\n if (t == 3) cout << 3000 * n << endl;\n if (t == 4) cout << 2000 * n << endl;\n }\n return 0;\n}\n", "t1, n1 = map(int,input().split())\nt2, n2 = map(int,input().split())\nt3, n3 = map(int,input().split())\nt4, n4 = map(int,input().split())\ndef f(x,y):\n if x == 1 :\n print(int(6000*y))\n if x == 2 :\n print(int(4000*y))\n if x == 3 :\n print(int(3000*y))\n if x == 4 :\n print(int(2000*y))\nf(t1,n1)\nf(t2,n2)\nf(t3,n3)\nf(t4,n4)\n", "i=0\nfor i in range(4):\n a,b=map(int,input().split())\n if a==1:\n print(6000*b)\n elif a==2:\n print(4000*b)\n elif a==3:\n print(3000*b)\n elif a==4:\n print(2000*b)\n", "data=[list(map(int,input().split())) for _ in range(4)]\nn=0\nwhile n<4:\n t=data[n][0]\n s=data[n][1]\n if t==1:\n print(6000*s)\n n+=1\n if t==2:\n print(4000*s)\n n+=1\n if t==3:\n print(3000*s)\n n+=1\n if t==4:\n print(2000*s)\n n+=1\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int t,n,price[4]={6000,4000,3000,2000};\n for(int i=1;i<=4;++i){\n cin>>t>>n;\n cout<<price[t-1]*n<<endl;\n }\n return 0;\n}\n\n", "#include <iostream>\nusing namespace std;\nint main(void){\nint s[5] = { 0,6000,4000,3000,2000 };\nint a, b;\n for (int i = 0; i < 4; i++) {\n cin >> a >> b;\n cout << s[a] * b << endl;\n }\n}\n", "price = [0, 6000, 4000, 3000, 2000]\n \nfor _ in range(4):\n t, n = map(int, input().split())\n print(price[t] * n)\n", "import java.util.Scanner;\n\npublic class Main {\n\n\t\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x,y,z;\n\t\tint uriage[] = new int[4];\n\t\tfor(z=0;z<=3;z++){\n\t\t\tx=sc.nextInt();\n\t\t\ty=sc.nextInt();\n\t\t\tif(x==1){\n\t\t\t\tx=6000;\n\t\t\t}else if(x==2){\n\t\t\t\tx=4000;\n\t\t\t}else if(x==3){\n\t\t\t\tx=3000;\n\t\t\t}else x=2000;\n\t\t\t\n\t\t\turiage[z]=x*y;\n\t\t\t\n\t\t\t\n\t\t}\n\t\tfor(z=0;z<=3;z++){\n\t\t\tSystem.out.println(uriage[z]);\n\t\t}\n\t\n\t\n\t}\n\n}", "a,b=map(int,input().split())\nc,d=map(int,input().split())\ne,f=map(int,input().split())\ng,h=map(int,input().split())\n\nif a==1:\n print(b*6000)\nelif a==2:\n print(b*4000)\nelif a==3:\n print(b*3000)\nelif a==4:\n print(b*2000)\nif c==1:\n print(d*6000)\nelif c==2:\n print(d*4000)\nelif c==3:\n print(d*3000)\nelif c==4:\n print(d*2000)\nif e==1:\n print(f*6000)\nelif e==2:\n print(f*4000)\nelif e==3:\n print(f*3000)\nelif e==4:\n print(f*2000)\nif g==1:\n print(h*6000)\nelif g==2:\n print(h*4000)\nelif g==3:\n print(h*3000)\nelif g==4:\n print(h*2000)\n", "a,A=input().split()\nb,B=input().split()\nc,C=input().split()\nd,D=input().split()\ne=a,A,b,B,c,C,d,D\ni=0\nw=0\nx=[0,0,0,0]\nwhile i<8 : \n if int(e[i])==1 : w=6000*int(e[i+1]) \n elif int(e[i])==2 : w=4000*int(e[i+1])\n elif int(e[i])==3 : w=3000*int(e[i+1])\n else : w=2000*int(e[i+1])\n x[int(i/2)]=w\n i=i+2\nW=x[0]\nX=x[1]\nY=x[2]\nZ=x[3]\n \nprint(W)\nprint(X)\nprint(Y)\nprint(Z)\n", "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint t;\n\t\tint n;\n\t\t\n\t\tfor(int i=1; i<=4; i++){\n\t\t\tt = scan.nextInt();\n\t\t\tn = scan.nextInt();\n\t\t\t\n\t\t\tif(t==1){\n\t\t\t\tSystem.out.println(6000*n);\n\t\t\t}else if(t==2){\n\t\t\t\tSystem.out.println(4000*n);\n\t\t\t}else if(t==3){\n\t\t\t\tSystem.out.println(3000*n);\n\t\t\t}else if(t==4){\n\t\t\t\tSystem.out.println(2000*n);\n\t\t\t}\n\t\t}\n\t}\n}", "#include <iostream>\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,j) FOR(i,0,j)\n\nint main(){\n int price[] = {0, 6000, 4000, 3000, 2000};\n REP(i, 4){\n int t, n;\n std::cin >> t >> n;\n std::cout << price[t] * n << std::endl;\n }\n return 0;\n}", "#include<iostream>\nusing namespace std;\nint main(){\n\tint a,b;\n\tfor(int i=0;i<4;i++){\n\t\tcin>>a>>b;\n\t\tif(a==1)\n\t\tcout<<b*6000<<endl;\n\t\tif(a==2)\n\t\tcout<<b*4000<<endl;;\n\t\tif(a==3)\n\t\tcout<<b*3000<<endl;\n\t\tif(a==4)\n\t\tcout<<b*2000<<endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint main()\n{\n int t,n;\n for(int i=0;i<4;i++){\n cin>>t>>n;\n if(t==1){\n cout<<n*6000<<'\\n';\n }else if(t==2){\n cout<<n*4000<<'\\n';\n }else if(t==3){\n cout<<n*3000<<'\\n';\n }else{\n cout<<n*2000<<'\\n';\n }\n }\n return(0);\n}\n\n", "tickets= {1: 6000, 2: 4000, 3: 3000, 4: 2000}\nfor _ in range(4):\n t, n= map(int, input().split())\n print(tickets[t]*n)", "#include<iostream>\nusing namespace std;\nint main(){\n \n int tick, n;\n int temp[5] = {0, 6000, 4000, 3000, 2000};\n for(int i=0;i<4;i++){\n cin >> tick >> n;\n cout << temp[tick] * n << endl;\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nvector<int> v = {6000,4000,3000,2000};\nint main(){\n for(int i=0;i<4;i++){\n int t,n;\n cin>>t>>n;\n cout<<v[t-1]*n<<endl;\n }\n}", "#include<stdio.h>\nint main(void){\n\tint t,n,i;\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d %d\",&t,&n);\n\t\tif(t==1) printf(\"%d\\n\",n*6000);\n\t\telse if(t==2) printf(\"%d\\n\",n*4000);\n\t\telse if(t==3) printf(\"%d\\n\",n*3000);\n\t\telse printf(\"%d\\n\",n*2000);\n\t}\n\treturn 0;\n}", "for i in range(4):\n t,n=map(int,input().split())\n \n if t == 1:\n print(6000*n)\n elif t == 2:\n print(4000*n)\n elif t == 3:\n print(3000*n)\n elif t == 4:\n print(2000*n)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint tmp[] = {6000,4000,3000,2000};\n\nint main(){\n int a,b;\n for(int i = 0;i < 4;i++){\n cin >> a >> b;\n cout << tmp[a-1] * b << endl;\n }\n\n return 0;\n}\n\n\n\n", "count = 0\nwhile count < 4:\n count += 1\n a,b=map(int,input().split())\n if(a==1):\n print(b*6000)\n elif(a==2):\n print(b*4000)\n elif(a==3):\n print(b*3000)\n elif(a==4):\n print(b*2000)\n\n", "for i in range(4):\n ti,ni=map(int,input().split())\n\n if ti==1:\n X=6000*ni\n if ti==2:\n X=4000*ni\n if ti==3:\n X=3000*ni\n if ti==4:\n X=2000*ni\n print(X)\n", "for _ in range(4):\n\ta,b=map(int,input().split())\n\tif a==1:\n\t\tp=6000\n\telif a==2:\n\t\tp=4000\n\telif a==3:\n\t\tp=3000\n\telse:\n\t\tp=2000\n\tprint(p*b)\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint ticket[]={0,6000,4000,3000,2000};\n\tint t,n;\n\twhile(cin>>t>>n)cout<<ticket[t]*n<<endl;\n\treturn 0;\n}", "prices = [None, 6000, 4000, 3000, 2000]\nsales = [0] * 5\n\nfor i in range(4):\n t, n = map(int, raw_input().split())\n print prices[t]*n", "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint t,n;\n\t\tint gokei = 0;\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tfor(int i = 0; i <= 3; i++){\n\t\t\n\t\t\tt = scan.nextInt();\n\t\t\tn = scan.nextInt();\n\t\t\t\n\t\t\tif(t == 1) {\n\t\t\t\tgokei = 6000 * n;\n\t\t\t\tSystem.out.println(gokei);\n\t\t\t} else if(t == 2) {\n\t\t\t\tgokei = 4000 * n;\n\t\t\t\tSystem.out.println(gokei);\n\t\t\t} else if(t == 3) {\n\t\t\t\tgokei = 3000 * n;\n\t\t\t\tSystem.out.println(gokei);\n\t\t\t} else if(t == 4) {\n\t\t\t\tgokei = 2000 * n;\n\t\t\t\tSystem.out.println(gokei);\n\t\t\t}\n\t\t}\n\t}\n}", "#include<stdio.h>\nint c[]={0,6000,4000,3000,2000};\nint main(){for(int i=0;i<4;i++){int a,b;scanf(\"%d%d\",&a,&b);printf(\"%d\\n\",c[a]*b);}}", "#define scanf_s scanf\n#include<stdio.h>\nint main(void) {\n\tint a, b, i, mo[4] = { 6000,4000,3000,2000 };\n\tfor (i = 0; i < 4; i++) {\n\t\tscanf_s(\"%d %d\", &a, &b);\n\t\tprintf(\"%d\\n\", mo[a - 1] * b);\n\t}\t\n\treturn(0);\n}", "a,l=map(int, input().split())\nb,m=map(int, input().split())\nc,n=map(int, input().split())\nd,o=map(int, input().split())\nif a == 1 and b == 2 and c == 3 and d == 4 :\n print(l*6000)\n print(m*4000)\n print(n*3000)\n print(o*2000)\nelif a == 1 and b == 2 and c == 4 and d == 3 :\n print(l*6000)\n print(m*4000)\n print(n*2000)\n print(o*3000)\nelif a == 1 and b == 3 and c == 2 and d == 4 :\n print(l*6000)\n print(m*3000)\n print(n*4000)\n print(o*2000)\nelif a == 1 and b == 3 and c == 4 and d == 2 :\n print(l*6000)\n print(m*3000)\n print(n*2000)\n print(o*4000)\nelif a == 1 and b == 4 and c == 3 and d == 2 :\n print(l*6000)\n print(m*2000)\n print(n*3000)\n print(o*4000)\nelif a == 1 and b == 4 and c == 2 and d == 3 :\n print(l*6000)\n print(m*2000)\n print(n*4000)\n print(o*3000)\nelif a == 2 and b == 1 and c == 3 and d == 4 :\n print(l*4000)\n print(m*6000)\n print(n*3000)\n print(o*2000)\nelif a == 2 and b == 1 and c == 4 and d == 3 :\n print(l*4000)\n print(m*6000)\n print(n*2000)\n print(o*3000) \nelif a == 2 and b == 3 and c == 1 and d == 4 :\n print(l*4000)\n print(m*3000)\n print(n*6000)\n print(o*2000)\nelif a == 2 and b == 3 and c == 4 and d == 1 :\n print(l*4000)\n print(m*3000)\n print(n*2000)\n print(o*6000)\nelif a == 2 and b == 4 and c == 1 and d == 3 :\n print(l*4000)\n print(m*2000)\n print(n*6000)\n print(o*3000)\nelif a == 2 and b == 4 and c == 3 and d == 1 :\n print(l*4000)\n print(m*2000)\n print(n*3000)\n print(o*6000)\nelif a == 3 and b == 1 and c == 2 and d == 4 :\n print(l*3000)\n print(m*6000)\n print(n*4000)\n print(o*2000)\nelif a == 3 and b == 1 and c == 4 and d == 2 :\n print(l*3000)\n print(m*6000)\n print(n*2000)\n print(o*4000)\nelif a == 3 and b == 2 and c == 1 and d == 4 :\n print(l*3000)\n print(m*4000)\n print(n*6000)\n print(o*2000)\nelif a == 3 and b == 2 and c == 4 and d == 1 :\n print(l*3000)\n print(m*4000)\n print(n*2000)\n print(o*6000)\nelif a == 3 and b == 4 and c == 1 and d == 2 :\n print(l*3000)\n print(m*2000)\n print(n*6000)\n print(o*4000)\nelif a == 3 and b == 4 and c == 2 and d == 1 :\n print(l*3000)\n print(m*2000)\n print(n*4000)\n print(o*6000) \n print(o*4000)\nelif a == 4 and b == 1 and c == 2 and d == 3 :\n print(l*2000)\n print(m*6000)\n print(n*4000)\n print(o*3000)\nelif a == 4 and b == 1 and c == 3 and d == 2 :\n print(l*2000)\n print(m*6000)\n print(n*3000)\n print(o*4000)\nelif a == 4 and b == 2 and c == 1 and d == 3 :\n print(l*2000)\n print(m*4000)\n print(n*6000)\n print(o*3000)\nelif a == 4 and b == 2 and c == 3 and d == 1 :\n print(l*2000)\n print(m*4000)\n print(n*3000)\n print(o*6000) \nelif a == 4 and b == 3 and c == 1 and d == 2 :\n print(l*2000)\n print(m*3000)\n print(n*6000) \n print(o*4000)\nelif a == 4 and b == 3 and c == 2 and d == 1 :\n print(l*2000)\n print(m*3000)\n print(n*4000) \n print(o*6000)\nelse :\n pass\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n int t,n,s=4;\n while(s--) {\n cin >> t >>n;\n int sum=0;\n if(t==1) cout << 6000*n << endl;\n else if(t==2) cout << 4000*n << endl;\n else if(t==3) cout << 3000*n << endl;\n else cout << 2000*n << endl;\n } \n return 0;\n} \n", "i=0\nwhile i<4:\n t,n=map(int,input().split())\n if t==1:\n money=n*6000\n print(money)\n elif t==2:\n money=n*4000\n print(money)\n elif t==3:\n money=n*3000\n print(money)\n elif t==4:\n money=n*2000\n print(money)\n i+=1\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n int t, n;\n for (int i = 0; i < 4; i++) {\n cin >> t >> n;\n if (t == 1) cout << 6000 * n << endl;\n if (t == 2) cout << 4000 * n << endl;\n if (t == 3) cout << 3000 * n << endl;\n if (t == 4) cout << 2000 * n << endl;\n }\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n for(int i=0;i<4;i++){\n int a,b;\n cin>>a>>b;\n if(a==1){\n b*=6000;\n }\n if(a==2) b*=4000;\n if(a==3) b*=3000;\n if(a==4) b*=2000;\n cout<<b<<endl;\n }\n return 0;\n}\n\n", "#include<bits/stdc++.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\nusing namespace std;\ntypedef long long ll;\nint x[4]={6000,4000,3000,2000};\nint main(){\n\tint t,n,d[4];\n\tfor(int i=0;i<4;i++){ scanf(\"%d%d\",&t,&n); printf(\"%d\\n\",n*x[t-1]);}\n}", "#include <iostream>\nusing namespace std;;\nint main(){\nint t,n;\nfor(int i=0;i<4;i++){\ncin>>t>>n;\nif(t==1) cout<<6000*n<<endl;\nif(t==2) cout<<4000*n<<endl;\nif(t==3) cout<<3000*n<<endl;\nif(t==4) cout<<2000*n<<endl;\n}\nreturn 0;\n}\n\n", "/*\n\t0277:Ticket Sales\n*/\n#include\t<iostream>\n#include\t<cstdio>\n\nusing namespace std;\n\nint main(void) {\n\tconst int saleTic[4] = { 6000, 4000, 3000, 2000 };\n\t\n\tfor(int i = 0; i < 4; i++) {\n\t\tint a, b;\n\t\t\n\t\tcin >> a >> b;\n\t\t\n\t\tcout << saleTic[a - 1] * b << endl;\n\t}\n\t\n\treturn 0;\n}", "チケット = {1:6000, 2:4000, 3:3000, 4:2000}\nfor _ in range(4):\n t, n = map(int, input().split())\n print(チケット[t] * n)\n\n", "#include<iostream>\nusing namespace std;\nint main(void)\n{\n int t,n;\n for(int i=0;i<4;i++){\n cin>>t>>n;\n if(t==1)cout<<n*6000<<\"\\n\";\n else if(t==2)cout<<n*4000<<\"\\n\";\n else if(t==3)cout<<n*3000<<\"\\n\";\n else cout<<n*2000<<\"\\n\";\n }\n}", "pay = [6000,4000,3000,2000]\nfor i in range(4):\n a,b = map(int,input().split())\n print(pay[a-1]*b)\n", "#include<stdio.h>\nint main(void)\n{\n\tint i,a,b,c;\n\tfor(i=1;i<=4;i++){\n\t\tscanf(\"%d %d\",&a,&b);\n\t\tif(a==1){\n\t\t\tc=6000*b;\n\t\t}\n\t\tif(a==2){\n\t\t\tc=4000*b;\n\t\t}\n\t\tif(a==3){\n\t\t\tc=3000*b;\n\t\t}\n\t\tif(a==4){\n\t\t\tc=2000*b;\n\t\t}\n\t\tprintf(\"%d\\n\",c);\n\t}\n\treturn 0;\n}\n\t\t", "import java.util.Scanner;\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tint kode,mai,a;\n\tint[] kin ={6000,4000,3000,2000};\n\tint[] gou = new int[4];\n\t\n\tpublic void keisan(){\n\t\tfor(a=0;a<=3;a++){\n\t\t\tkode = sc.nextInt();\n\t\t\tmai = sc.nextInt();\n\t\t\tswitch(kode){\n\t\t\tcase 1:\n\t\t\t\tgou[a] += kin[kode - 1] * mai; break;\n\t\t\tcase 2:\t\n\t\t\t\tgou[a] += kin[kode - 1] * mai; break;\n\t\t\tcase 3:\n\t\t\t\tgou[a] += kin[kode - 1] * mai; break;\n\t\t\tcase 4:\t\n\t\t\t\tgou[a] += kin[kode - 1] * mai; break;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic void hyouji(){\n\t\tfor(a=0;a<=3;a++){\n\t\t\tSystem.out.println(gou[a]);\n\t\t}\t\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tMain go = new Main();\n\t\tgo.keisan();\n\t\tgo.hyouji();\n\t\t\n\t}\n\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = \"\";\n\n\t\twhile ((line = br.readLine()) != null && !line.isEmpty()) {\n\t\t\tint[] prices = { 0, 6000, 4000, 3000, 2000 };\n\t\t\tStringTokenizer st = new StringTokenizer(line);\n\t\t\tint t = Integer.parseInt(st.nextToken());\n\t\t\tint n = Integer.parseInt(st.nextToken());\n\t\t\tSystem.out.println(prices[t] * n);\n\t\t}\n\t}\n}", "#coding:utf-8\n\ntable = [6000,4000,3000,2000]\nfor i in range(4):\n\tdata = [int(x) for x in input().split()]\n\tprint(table[data[0]-1]*data[1])", "\nimport java.util.Scanner;\n\nclass Main {\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n\n for (int i = 0; i != 4; i++) {\n int t = scan.nextInt();\n int n = scan.nextInt();\n switch (t) {\n case 1:\n System.out.println(n * 6000);\n break;\n case 2:\n System.out.println(n * 4000);\n break;\n case 3:\n System.out.println(n * 3000);\n break;\n case 4:\n System.out.println(n * 2000);\n break;\n\n }\n\n }\n }\n}\n\n", "#include<iostream>\nusing namespace std;\nint main(){\n\tint i=0;\n\tint a=0;\n\tint b=0;\n\tint s[5];\n\tint n[4]={6000,4000,3000,2000};\n\tfor(i=0;i<4;i++){\n\t\tcin>>a>>b;\n\t\ta--;\n\t\ts[i]=n[a]*b;\n\t}\n\tfor(i=0;i<4;i++){\n\t\tcout<<s[i]<<endl;\n\t}\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = \"\";\n\n\t\twhile ((line = br.readLine()) != null && !line.isEmpty()) {\n\t\t\tint t, n, s = 0;\n\t\t\tStringTokenizer st = new StringTokenizer(line);\n\t\t\tt = Integer.parseInt(st.nextToken());\n\t\t\tn = Integer.parseInt(st.nextToken());\n\n\t\t\tif (t > 1) {\n\t\t\t\ts = n * (6000 - t * 1000);\n\t\t\t} else {\n\t\t\t\ts = n * 6000;\n\t\t\t}\n\t\t\tSystem.out.println(s);\n\t\t}\n\t}\n}", "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] a = new int[4];\n\t\tfor(int i = 0 ; i < 4 ; i++){\n\t\t\tint t = sc.nextInt();\n\t\t\tint n = sc.nextInt();\n\t\t\tswitch (t) {\n\t\t\tcase 1:\n\t\t\t\ta[i] = n * 6000;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\ta[i] = n * 4000;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\ta[i] = n * 3000;\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\ta[i] = n * 2000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tfor(int j : a){\n\t\t\tSystem.out.println(j);\n\t\t}\n\t\tsc.close();\n\t}\n\n}", "#include<iostream>\nusing namespace std;\nint main(void)\n{\n int t, n, ans = 0;\n for(int i = 0;i < 4; i++){\n cin >> t >> n;\n if(t == 1) cout << 6000 * n << endl;\n if(t == 2) cout << 4000 * n << endl;\n if(t == 3) cout << 3000 * n << endl;\n if(t == 4) cout << 2000 * n << endl;\n }\n}\n", "A = [0, 6000, 4000, 3000, 2000]\nfor i in range(4):\n a, b = map(int, input().split())\n print(A[a] * b)\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n int ticket[]={6000,4000,3000,2000};\n int a,b;\n int ans[4]={0};\n for(int i=0;i<4;i++){\n cin >> a >> b;\n ans[i] = b * ticket[a-1];\n }\n for(int i=0;i<4;i++){\n cout << ans[i] << endl;\n }\n}", "#include <iostream>\nusing namespace std;\nint main()\n{\n\tint a[4]={6000,4000,3000,2000},b,c;\n\tfor(int i=0;i<4;i++){\n\t\tcin>>b>>c;\n\t\tcout<<c*a[b-1]<<endl;\n\t}\n\treturn 0;\n}", "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint t = 0;\n\t\tint n = 0;\n\t\tint y = 0;\n\t\tfor(int i=1;i<=4;i++){\n\t\t\t t = scan.nextInt();\n\t\t\t n = scan.nextInt();\n\t\t\t if(t == 1){\n\t\t\t \ty = n * 6000;\n\t\t\t }else\n\t\t\t if(t == 2){\n\t\t\t \ty = n * 4000;\n\t\t\t }else\n\t\t\t if(t == 3){\n\t\t\t \ty = n * 3000;\n\t\t\t }else\n\t\t\t if(t == 4){\n\t\t\t \ty = n * 2000;\n\t\t\t }\n\t\t\t System.out.println(y);\n\t\t}\n\t}\n}", "#include<stdio.h>\nint main (void)\n{\n\tint n,s,m;\n\tint i;\n\n\tfor(i=0;i<4;i++){\n\t\tscanf(\"%d %d\",&n,&s);\n\t\tif(n==1){\n\t\t\tm=6000*s;\n\t\t}\n\t\telse if(n==2){\n\t\t\tm=4000*s;\n\t\t}\n\t\telse if(n==3){\n\t\t\tm=3000*s;\n\t\t}\n\t\telse if(n==4){\n\t\t\tm=2000*s;\n\t\t}\n\t\tprintf(\"%d\\n\",m);\n\t}\n\treturn 0;\n}", "#include <stdio.h>\n\nint main(void){\n int price[]={0,6,4,3,2};\n int t, n;\n \n for (int i=0; i<4; i++){\n scanf(\"%d %d\", &t, &n);\n printf(\"%d\\n\", price[t]*n*1000);\n }\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint nedan[5] = {0,6,4,3,2};\n\tfor(int i=0; i<4; i++){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\tcout<<nedan[a]*b*1000<<endl;\n\t}\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\n int t;\n int n;\n\n for(int i=0;i<4;++i){\n\tcin>>t>>n;\n\n\tif(t==1)\n\t cout<<6000*n<<endl;\n\telse if(t==2)\n\t cout<<4000*n<<endl;\n\telse if(t==3)\n\t cout<<3000*n<<endl;\n\telse if(t==4)\n\t cout<<2000*n<<endl;\n }\n \n}\n\n" ]
problem In one programming contest, it is customary to play a bingo game at a social gathering after the competition. However, the bingo card used in this bingo game is a little special and is created according to the following conditions. * The Bingo card is divided into squares of N rows and N columns, and one positive integer is written in each square. All those integers are different. * The integer written in the square is 1 or more and M or less. * The sum of N × N integers written on the Bingo card is S. * When looking at any column, the integers are arranged in ascending order from top to bottom. * The integer in every square is larger than any integer in the column to the left of that square. The following is an example of a Bingo card when N = 5, M = 50, S = 685. <image> I want to make as many bingo cards as possible that meet the above conditions for the social gathering. However, you must not make more than one same card. Create a program that outputs the remainder of the maximum number of Bingo cards that can be created divided by 100000. input The input consists of multiple datasets. Each dataset is given in the following format. The input consists of one line, which contains the size of the bingo card N (1 ≤ N ≤ 7), the upper limit of the integers written in the square M (1 ≤ M ≤ 2000), and the bingo card. Three positive integers representing the sum of integers S (1 ≤ S ≤ 3000) are written separated by blanks. However, you can make one or more bingo cards that meet the conditions for any given input data. When N, M, S is 0, it indicates the end of input. The number of data sets does not exceed 5. output For each dataset, divide the maximum number of Bingo cards that can be created by 100000 and output the remainder on one line. Examples Input 3 9 45 3 100 50 5 50 685 0 0 0 Output 1 7 74501 Input None Output None
[ "#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint N,M,S;\nint dp[2][50][3001];\n#define AMA (100000)\nint solve(){\n memset(dp,0,sizeof(dp));\n int now;\n int next;\n int ret = 0;\n dp[1][0][0]=1;\n for(int m=1;m<=M;m++){\n now = m&1;\n next = now^1;\n memset(dp[next],0,sizeof(dp[next]));\n for(int id = 0;id<N*N;id++){\n for(int j=0;j<S;j++){\n\tif(!dp[now][id][j]) continue;\n\tif(j+m>S) break;\n\t//\tprintf(\"dp[%d][%d][%d] = %d , %d\\n\",m,id,j,dp[now][id][j],j+m);\n\tif(id==N*N-1 && j+m==S) ret+=dp[now][id][j]%AMA;\n\telse {\n\t // printf(\"%d %d %d next = %d\\n\",m+1,id,j,dp[next][id][j]);\n\t dp[next][id+1][j+m] += dp[now][id][j]%AMA;\n\t dp[next][id][j] += dp[now][id][j]%AMA;\n\t}\n }\n }\n }\n return ret%AMA;\n}\nint main(){\n while(1){\n scanf(\"%d %d %d\",&N,&M,&S);\n if(!N && !M && !S) break;\n printf(\"%d\\n\",solve());\n }\n}", "import itertools\nwhile 1:\n n,m,s=map(int,input().split())\n if n==0:break\n dp=[[0 for _ in range(s+1)] for _ in range(n*n+1)]\n dp[0][0]=1\n for i,j in itertools.product(range(1,n*n+1),range(s+1)):\n if j>=i:dp[i][j]+=dp[i-1][j-i]+dp[i][j-i]\n if j-m>=1:dp[i][j]+=100000-dp[i-1][j-m-1]\n dp[i][j]%=100000\n print(dp[n*n][s])", "#include<iostream>\n#include<iomanip>\n#include<algorithm>\n#include<array>\n#include<bitset>\n#include<cassert>\n#include<cctype>\n#include<cmath>\n#include<cstdio>\n#include<cstring>\n#include<functional>\n#include<limits>\n#include<list>\n#include<map>\n#include<numeric>\n#include<set>\n#include<stack>\n#include<string>\n#include<sstream>\n#include<unordered_map>\n#include<queue>\n#include<vector>\nusing namespace std;\n\n//#define int long long\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int, int>;\n\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define all(a) (a).begin(),(a).end()\n#define dump(o) {cerr<<#o<<\" \"<<o<<endl;}\n#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<\" \"<<e;cerr<<endl;}\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\nconst int MOD = 100000;\n\nsigned main() {\n\tint dp[55][3010] = {};\n\tfor (int N, M, S; cin >> N >> M >> S&&N;) {\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\trep(m, 1, M + 1) {\n\t\t\trrep(i, 1, N*N + 1) {\n\t\t\t\trep(j, 0, S + 1) {\n\t\t\t\t\tif (j + m > S)break;\n\t\t\t\t\t(dp[i][j + m] += dp[i - 1][j]) %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[N*N][S] << endl;\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\n\ntemplate <class T>\nint __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }\n#endif\n\n#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define popcount __builtin_popcount\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntemplate <class T> void max_swap(T& a, const T b) { a = max(a, b); }\ntemplate <class T> void min_swap(T& a, const T b) { a = min(a, b); }\n\nconst double EPS = 1e-10;\ntypedef long long ll;\ntypedef pair<int, int> pint;\n\n\nint main()\n{\n\tint n, m, s;\n\twhile (scanf(\"%d%d%d\", &n, &m, &s), n | m | s)\n\t{\n\t\tint nn = n * n;\n\n\t\t// dp[iˆÈ‰º‚ðŽg‚Á‚½][j(a_j‚Ü‚Å)][s] = sum|k=[1..i-1](dp[k][j-1][s-k])\n\t\tstatic int dp[2][50][3001];\n\t\tconst int mod = 100000;\n\n\t\trep (i, nn + 1)\n\t\t\trep (j, s + 1)\n\t\t\t\tdp[0][i][j] = dp[1][i][j] = 0;\n\n\t\tdp[0][0][0] = 1;\n\t\tfor (int i = 1; i <= m; ++i)\n\t\t{\n\t\t\tint (*prev)[3001] = dp[(i + 1) & 1];\n\t\t\tint (*cur)[3001] = dp[i & 1];\n\n\t\t\trep (j, nn + 1)\n\t\t\t\trep (k, s + 1)\n\t\t\t\t\tcur[j][k] = prev[j][k];\n\n\t\t\tfor (int j = nn; j > 0; --j)\n\t\t\t\tfor (int k = s; k >= i; --k)\n\t\t\t\t\t(cur[j][k] += prev[j - 1][k - i]) %= mod;\n\t\t}\n\n\t\tprintf(\"%d\\n\", dp[m & 1][nn][s]);\n\t}\n}", "#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <deque>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i,j) REP((i), 0, (j))\n#define REP(i,j,k) for(int i=(j);(i)<(k);++i)\n#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))\n#define ALL(v) (v).begin(), (v).end()\n#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))\n#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)\n#define SQ(x) ((x)*(x))\n#define Mod(x, mod) (((x)+(mod)%(mod))\n#define MP make_pair\n#define PB push_back\n#define Fi first\n#define Se second\n#define INF (1<<29)\n#define EPS 1e-10\n#define MOD 1000000007\n\ntypedef pair<int, int> pi;\ntypedef pair<int, pi> pii;\ntypedef vector<int> vi;\ntypedef queue<int> qi;\ntypedef long long ll;\n\nint N,M,S;\nint dp[64][3005];\n\nint main(){\n while(scanf(\"%d%d%d\", &N,&M,&S) && N||M||S){\n memset(dp, 0, sizeof dp);\n dp[0][0] = 1;\n for(int i=1;i<=M;i++){\n for(int j=SQ(N);j>=0;j--){\n\tfor(int s=0;s+i<=S;s++){\n\t dp[j+1][s+i] = (dp[j+1][s+i] + dp[j][s])%100000;\n\t}\n }\n }\n printf(\"%d\\n\", dp[SQ(N)][S]);\n }\n return 0;\n}", "#include <bits/stdc++.h>\n#define int long long\n#define endl '\\n'\n#define FOR(i, a, n) for (int i = (a); i < (n); ++i)\n#define REP(i, n) FOR(i, 0, n)\nusing namespace std;\n\nconst int MOD = 100000;\nint N, M, S;\nint dp[50][3010];\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (cin >> N >> M >> S, N) {\n const int K = N * N;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n REP(i, M) {\n for (int j = K - 1; j >= 0; --j) {\n for (int k = S; k >= 0; --k) {\n if (!dp[j][k]) continue;\n if (k + i + 1 <= S) (dp[j + 1][k + i + 1] += dp[j][k]) %= MOD;\n }\n }\n }\n cout << dp[K][S] << endl;\n }\n}\n", "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst int MOD = 100000;\n\nint main() {\n while (true) {\n int n, numLimit, sum;\n cin >> n >> numLimit >> sum;\n if (n == 0)break;\n n *= n;\n\n vector<vector<int>> dp(n + 1, vector<int>(sum + 1));\n dp[0][0] = 1;\n\n for (int nowNum = 1; nowNum <= numLimit; nowNum++) {\n for (int backCount = n - 1; backCount >= 0; backCount--) {\n for (int backSum = sum - nowNum; backSum >= 0; backSum--) {\n dp[backCount + 1][backSum + nowNum] += dp[backCount][backSum];\n dp[backCount + 1][backSum + nowNum] %= MOD;\n }\n }\n\n }\n\n cout << dp[n][sum] << endl;\n }\n return 0;\n}\n", "#include<iostream>\n#include<algorithm>\nusing namespace std;\n#define reps(i,b,n) for(int i = b ; i < n ; ++i )\n#define rep(i,n) reps(i,0,n)\n#define INF (1 << 30)\n#define MOD 100000\nint dp[51][3001],N,M,S;\nint main(){\n while(cin >> N >> M >> S , N){\n fill_n(dp[0],51*3001,0);\n dp[0][0] = 1;\n for(int i = 1 ; i <= M ; i++ ){\n for(int j = N * N ; j > 0 ; j-- ){\n for(int k = i ; k <= S ; k++ ){\n dp[j][k] = (dp[j][k] + dp[j-1][k-i]);\n if(dp[j][k] >= MOD) dp[j][k] -= 100000;\n }\n }\n }\n cout << dp[N*N][S] << endl;\n }\n}", "#include <iostream>\n#include <string>\n#include <vector>\n#include <cstdlib>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <map>\n#include <stack>\n#include <queue>\n#include <set>\n#include <cstring>\n\nusing namespace std;\n// ascending order\n#define vsort(v) sort(v.begin(), v.end())\n// descending order\n#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())\n#define vunique(v) unique(v.begin(), v.end())\n#define mp make_pair\n#define ts(x) to_string(x)\n#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)\n#define repm(i, a, b) for(int i = (int)a; i > (int)b; i--)\n#define bit(a) bitset<8>(a)\n#define des_priority_queue priority_queue<int, vector<int>, greater<int> >\n#define all(v) (v).begin(), (v).end()\ntypedef long long ll;\ntypedef pair<int, int> P;\nconst ll INF = 1e18;\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tvector<ll> rsl;\n\tint mod = 100000;\n\twhile(true) {\n\t\tint N, M, S;\n\t\tcin >> N >> M >> S;\n\t\tif(N == 0 and M == 0 and S == 0) break;\n\n\t\tint k = N * N;\n\t\tint n = S - k * (k + 1) / 2;\n\t\tint m = M - k;\n\n\t\tll dp[k + 1][n + 1];\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0] = 1;\n\n\t\trep(i, 1, k + 1) rep(j, 0, n + 1) {\n\t\t\tif(j - i >= 0) {\n\t\t\t\tdp[i][j] = (dp[i - 1][j] + dp[i][j - i]) % mod;\n\t\t\t\tif(j - i - m >= 0) (dp[i][j] -= dp[i - 1][j - i - m]) %= mod;\n\t\t\t} else dp[i][j] = dp[i - 1][j];\n\t\t}\n\n\t\trsl.push_back(dp[k][n]);\n\t}\n\n\trep(i, 0, rsl.size()) cout << rsl[i] << endl;\n\n}\n\n", "/* 剰余取り忘れてしもたwガハハw　*/\n#include <stdio.h>\n#include <string.h>\n\nint dp[50][3001];\n\nint main() {\n while (1) {\n int i;\n int n, m, s;\n int square;\n \n scanf(\"%d %d %d\", &n, &m, &s);\n if (n == 0 && m == 0 && s == 0) {\n return 0;\n }\n \n memset(dp, 0, sizeof(dp));\n \n square = n*n;\n dp[0][0] = 1;\n \n for (i=1; i<m+1; i++) {\n int j;\n\n for (j=s; j>=i; j--) {\n int k;\n\n for (k=0; k<square; k++) {\n dp[k+1][j] += dp[k][j-i];\n dp[k+1][j] %= 100000;\n }\n }\n }\n \n printf(\"%d\\n\", dp[square][s]);\n }\n}", "#include <cstdio>\n#include <algorithm>\n \nint N, M, S;\n \nint dp[2][2001][3001];\n \nint main()\n{\n while (true)\n {\n scanf(\"%d\", &N);\n scanf(\"%d\", &M);\n scanf(\"%d\", &S);\n \n if (N == 0 && M == 0 && S == 0) { break; }\n \n for (int i = 0; i < M; i++)\n {\n for (int j = 0; j < S; j++)\n {\n if (i == j && i != 0 && j != 0)\n {\n dp[1][i][j] = 1;\n }\n else\n {\n dp[1][i][j] = 0;\n }\n }\n }\n \n int A = N * N;\n \n for (int n = 2; n <= A; n++)\n {\n for (int i = 1; i <= M; i++)\n {\n for (int j = 1; j <= S; j++)\n {\n if (j >= i)\n {\n dp[n % 2][i][j] = (dp[n % 2][i - 1][j - 1] + dp[(n + 1) % 2][i - 1][j - i]) % 100000;\n }\n }\n }\n }\n \n int sum = 0;\n \n for (int i = 1; i <= M; i++)\n {\n sum += dp[A % 2][i][S];\n \n sum %= 100000;\n }\n \n printf(\"%d\\n\", sum);\n }\n \n return 0;\n}", "#include<stdio.h>\nint main()\n{\n\tint N,M,S,i,j,k,MOD=100000;\n\twhile(scanf(\"%d%d%d\",&N,&M,&S),N)\n\t{\n\t\tint dp[50][3001]={1};\n\t\tfor(i=M;i>0;--i)\n\t\t\tfor(j=N*N;j>0;--j)\n\t\t\t\tfor(k=S-i;k>=0;--k)\n\t\t\t\t{\n\t\t\t\t\tint &r=dp[j][i+k];\n\t\t\t\t\tr=(r+dp[j-1][k])%MOD;\n\t\t\t\t}\n\t\tprintf(\"%d\\n\",dp[N*N][S]);\n\t}\n\treturn 0;\n}", "while True:\n n, m, s = map(int, input().split())\n if not n:\n break\n n2 = n ** 2\n dpp = [0] * (s + 1)\n dpp[0] = 1\n\n for i in range(1, n2 + 1):\n dpn = [0] * (s + 1)\n for j in range(i * (i + 1) // 2, s + 1):\n dpn[j] += dpp[j - i] + dpn[j - i]\n if j - m - 1 >= 0:\n dpn[j] -= dpp[j - m - 1]\n dpn[j] %= 100000\n dpp = dpn\n\n print(dpp[s])", "#include <cstdio>\n#include <algorithm>\n\n#pragma warning(disable: 4996)\n\n#define MOD 100000\n\n#define MAX_M 2000\n#define MAX_S 3000\n\nint N, M, S;\n\nint dp[2][MAX_M + 1][MAX_S + 1];\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tscanf(\"%d\", &N);\n\t\tscanf(\"%d\", &M);\n\t\tscanf(\"%d\", &S);\n\n\t\tif (N == 0 && M == 0 && S == 0) { break; }\n\n\t\tfor (int i = 0; i < M; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < S; j++)\n\t\t\t{\n\t\t\t\tif (i == j && i != 0 && j != 0)\n\t\t\t\t{\n\t\t\t\t\tdp[1][i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tdp[1][i][j] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint A = N * N;\n\n\t\tfor (int n = 2; n <= A; n++)\n\t\t{\n\t\t\tfor (int i = 0; i < M; i++)\n\t\t\t{\n\t\t\t\tdp[n % 2][i][0] = 0;\n\t\t\t}\n\n\t\t\tfor (int j = 0; j < S; j++)\n\t\t\t{\n\t\t\t\tdp[n % 2][0][j] = 0;\n\t\t\t}\n\n\t\t\tfor (int i = 1; i <= M; i++)\n\t\t\t{\n\t\t\t\tfor (int j = 1; j <= S; j++)\n\t\t\t\t{\n\t\t\t\t\tif (n % 2 == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tdp[0][i][j] = (dp[0][i - 1][j - 1] + (j >= i ? dp[1][i - 1][j - i] : 0)) % MOD;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tdp[1][i][j] = (dp[1][i - 1][j - 1] + (j >= i ? dp[0][i - 1][j - i] : 0)) % MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint sum = 0;\n\n\t\tfor (int i = 1; i <= M; i++)\n\t\t{\n\t\t\tsum += dp[A % 2][i][S];\n\n\t\t\tsum %= MOD;\n\t\t}\n\n\t\tprintf(\"%d\\n\", sum);\n\t}\n\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;int d[51][3210],n,m,s,i,j,k;int main(){while(cin>>n>>m>>s&&n){n*=n;memset(d,0,sizeof(d));d[0][0]=1;for(k=1;k<=m;k++)for(i=n;i;i--)for(j=k;j<=s;j++)d[i][j]=(d[i][j]+d[i-1][j-k])%100000;cout<<d[n][s]<<endl;}return 0;}", "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst int inf=1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\nint main(){\n\tint n,m,s;\n\twhile(cin>>n>>m>>s,n){\n\t\tint N=n*n;\n\t\tvvi dp(N+1,vi(s+1));\n\t\tdp[0][0]=1;\n\t\tloop(k,1,m+1)for(int i=N-1;i>=0;i--)rep(j,s){\n\t\t\tif(j+k>s)continue;\n\t\t\tdp[i+1][j+k]+=dp[i][j];\n\t\t\tdp[i+1][j+k]%=100000;\n\t\t}\n\t\tcout<<dp[N][s]<<endl;\n\t}\n}", "#include <cstdlib>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tconst int mod = 100000;\n\tfor(int n, m, s; cin >> n >> m >> s, n;) {\n\t\tvector<vector<int> > dp(s + 1, vector<int>(n * n + 1, 0));\n\t\tdp[0][0] = 1;\n\t\tfor(int i = 1; i <= m; ++i) {\n\t\t\tfor(int j = s - i; j >= 0; --j) {\n\t\t\t\tfor(int k = 0; k < n * n; ++k) {\n\t\t\t\t\tif(dp[j][k] == 0)\n\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\tdp[j + i][k + 1] += dp[j][k];\n\t\t\t\t\tdp[j + i][k + 1] %= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << dp[s][n * n] << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}", "#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <complex>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define eps 1e-9\n#define INF 2000000000\n#define sz(x) ((int)(x).size())\n#define fi first\n#define sec second\n#define SORT(x) sort((x).begin(),(x).end())\n#define all(x) (x).begin(),(x).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define MOD 100000\nint main()\n{\n\twhile(1)\n\t{\n\t\tint dp[50][3010];\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0]=1;\n\t\tint n,m,s;\n\t\tcin >> n >> m >> s;\n\t\tif(n==0&&m==0&&s==0)break;\n\t\tfor(int i=1;i<=m;i++)\n\t\t{\n\t\t\tfor(int j=n*n-1;j>=0;j--)\n\t\t\t{\n\t\t\t\tfor(int k=i;k<=s;k++)\n\t\t\t\t{\n\t\t\t\t\tdp[j+1][k]+=dp[j][k-i];\n\t\t\t\t\tdp[j+1][k]%=MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n*n][s] << endl;\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <cstring>\nusing namespace std;\nint d[50][3001];\nint main() {\nint n,m,s;\nwhile(scanf(\"%d%d%d\",&n,&m,&s),n) {memset(d,0,sizeof(d));\nd[0][0]=1;for (int i=1;i<=m;++i)for (int j=n*n;j;--j)for (int k=s;k>=i;--k)\nd[j][k]=(d[j][k]+d[j-1][k-i])%100000;\nprintf(\"%d\\n\",d[n*n][s]);\n}\n}", "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <set>\n#include <bitset>\n#include <queue>\n#include <stack>\n#include <bitset>\n#include <utility>\n#include <cstring>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cctype>\nusing namespace std;\n \n#define rep(i,n) for(int i=0; i<n; i++)\n#define repa(i,s,e) for(int i=s; i<=e; i++)\n#define repd(i,s,e) for(int i=s; i>=e; i--)\n \ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef long long ll;\n\nconst int MAX_N = 7;\nconst int CSIZE = 50;\nconst int MAX_S = 3001;\nint N, M, S;\nint dp[CSIZE][MAX_S];\n\nvoid solve() {\n\tmemset(dp, 0, sizeof(dp));\n\tint n2 = N * N;\n\tdp[0][0] = 1;\n\trepa(k,1,M) {\n\t\trepd(i,n2,1) {\n\t\t\trepa(j,0,S) {\n\t\t\t\tif(j - k >= 0) {\n\t\t\t\t\tdp[i][j] += dp[i-1][j-k];\n\t\t\t\t\tif(dp[i][j] > 100000) {\n\t\t\t\t\t\tdp[i][j] -= 100000;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\", dp[n2][S]);\n}\n\nint main() {\n\twhile(scanf(\"%d%d%d\", &N, &M, &S), N | M | S) {\n\t\tsolve();\n\t}\n}", "#include<cstdio>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\n int N,M,S;\n while(1){\n int fie[51][3002]={0};\n cin>>N>>M>>S;\n if(N==0&&M==0&&S==0)break;\n fie[0][0]=1;\n for(int i=1;i<=M;i++){\n for(int j=N*N;0<=j;j--){\n for(int k=S;0<=k;k--){\n if(k+i<=3000)fie[j+1][k+i]+=fie[j][k];\n fie[j][k]%=100000;\n }\n }\n }\n\n cout<<fie[N*N][S]%100000<<endl;\n }\n return 0;\n}", "#include <stdio.h>\n\nint dp[50][3333];\nint dpw[50][3333];\n\nint main()\n{\n\twhile(1)\n\t{\n\t\tint n,m,s;\n\t\tscanf(\"%d %d %d\",&n,&m,&s);\n\t\tif(n == 0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tn *= n;\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\tfor(int ii = 0; ii <= s; ii++)\n\t\t\t{\n\t\t\t\tdp[i][ii] = 0;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 1; i <= m; i++)\n\t\t{\n\t\t\tfor(int ii = 0; ii < n; ii++)\n\t\t\t{\n\t\t\t\tfor(int iii = 0; iii <= s; iii++)\n\t\t\t\t{\n\t\t\t\t\tdpw[ii][iii] = dp[ii][iii];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int ii = 0; ii < n - 1; ii++)\n\t\t\t{\n\t\t\t\tfor(int iii = 0; iii < s; iii++)\n\t\t\t\t{\n\t\t\t\t\tif(i + iii <= s)\n\t\t\t\t\t{\n\t\t\t\t\t\tdpw[ii + 1][i + iii] += dp[ii][iii];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdpw[0][i] += 1;\n\t\t\tfor(int ii = 0; ii < n; ii++)\n\t\t\t{\n\t\t\t\tfor(int iii = 0; iii <= s; iii++)\n\t\t\t\t{\n\t\t\t\t\tdp[ii][iii] = dpw[ii][iii] % 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp[n - 1][s]);\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint n,m,s;\nint dp[55][3003];\n\nint main(void){\n while(cin >> n >> m >> s && n){\n memset(dp,0,sizeof(dp));\n dp[n*n][s] = 1;\n for(int i = 1; i <= m; i++){\n for(int j = 0; j < n*n; j++){\n\tfor(int k = 0; k+i <= s; k++){\n\t dp[j][k] += dp[j + 1][k + i];\n\t dp[j][k] %= 100000;\n\t}\n }\n }\n cout << dp[0][0] << endl;\n }\n}", "#include <iostream>\n#include <vector>\n\ntemplate <class T>\nstd::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }\n\nconstexpr int MOD = 100000;\n\nbool solve() {\n int n, m, s;\n std::cin >> n >> m >> s;\n if (n == 0) return false;\n n *= n;\n\n auto dp = vec(n + 1, vec(s + 1, 0));\n dp[0][0] = 1;\n for (int x = 1; x <= m; ++x) {\n for (int i = n - 1; i >= 0; --i) {\n for (int y = 0; y + x <= s; ++y) {\n dp[i + 1][y + x] += dp[i][y];\n if (dp[i + 1][y + x] >= MOD) dp[i + 1][y + x] -= MOD;\n }\n }\n }\n\n std::cout << dp[n][s] << \"\\n\";\n\n return true;\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n while (solve()) {}\n\n return 0;\n}\n\n", "#include<iostream>\n#include<cstdio>\nusing namespace std;\n#define LATTE 100000\n\nint dp[2][2001][3001];\n\nint main(){\n int N,M,S;\n while(cin>>N>>M>>S, N||M||S){\n for(int i=1;i<=M;i++)for(int j=1;j<=S;j++) dp[0][i][j]=dp[1][i][j]=0;\n for(int i=1;i<=M;i++){\n dp[1][i][i]=1;\n }\n for(int i=1;i<N*N;i++){\n for(int j=1;j<=M;j++){\n for(int k=1;k<=S;k++){\n //printf(\"%d,%d,%d\\n\",i,j,k);\n if(k+j+1<=S && j+1<=M){\n dp[(i+1)&1][j+1][k+j+1] +=\n dp[i&1][j][k]+dp[(i+1)&1][j][k+j];\n dp[(i+1)&1][j+1][k+j+1]%=LATTE;\n }\n dp[i&1][j][k]=0;\n /*for(int l=j+1;l<=50;l++){\n dp[i+1][l][k+l] += dp[i][j][k];\n dp[i+1][l][k+l]%=LATTE;\n }*/\n }\n }\n }\n int ans=0;\n for(int i=1;i<=M;i++){\n ans += dp[(N*N)&1][i][S];\n }\n printf(\"%d\\n\",ans%LATTE);\n }\n return 0;\n}", "#include <iostream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <utility>\n#include <cmath>\n#include <map>\n#include <set>\n#include <stack>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\n#define INF_LL 1e18\n#define INF 1e9\n\n#define REP(i, n) for(int i = 0;i < (n);i++)\n#define FOR(i, a, b) for(int i = (a);i < (b);i++)\n#define all(x) x.begin(),x.end()\n\n#define fst first\n#define snd second\n\nusing namespace std;\n\nusing ll = long long;\nusing PII = pair<int, int>;\n\nclass Union_find{\nprivate:\n\tvector<int> par;\n\tvector<int> rank;\n\tint n;\n\npublic:\n\tUnion_find(int a){\n\t\tn = a;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tpar.push_back(i);\n\t\t\trank.push_back(0);\n\t\t}\n\t}\n\n\tint find(int x){\n\t\tif(par[x] == x){\n\t\t\treturn x;\n\t\t}else{\n\t\t\treturn par[x] = find(par[x]);\n\t\t}\n\t}\n\n\tvoid unite(int x, int y){\n\t\tx = find(x);\n\t\ty = find(y);\n\t\tif(x == y) return;\n\n\t\tif(rank[x] < rank[y]){\n\t\t\tpar[x] = y;\n\t\t}else{\n\t\t\tpar[y] = x;\n\t\t\tif(rank[x] == rank[y]) rank[x]++;\n\t\t}\n\t}\n\n\tbool same(int x, int y){\n\t\treturn find(x) == find(y);\n\t}\n};\n\nint dp[2][2020][3030] = {};\nint main(void){\n\tint N, M, S;\n\twhile(cin >> N >> M >> S && N && M && S){\n\t\tmemset(dp, 0, sizeof dp);\n\t\tFOR(i, 1, M+1){\n\t\t\tdp[1][i][i] = dp[1][i-1][i] + 1;\n\t\t}\n\t\tFOR(i, 2, N*N+1){\n\t\t\tmemset(dp[i%2], 0, sizeof dp[i%2]);\n\t\t\tFOR(j, i, M+1){\n\t\t\t\tFOR(k, 1, S+1){\n\t\t\t\t\tdp[(i+1)%2][j-1][k] += dp[(i+1)%2][j-2][k];\n\t\t\t\t\tif(k >= j){\n\t\t\t\t\t\tdp[i%2][j][k] += dp[(i+1)%2][min(k, j-1)][k-j];\n\t\t\t\t\t\tdp[i%2][j][k] = dp[i%2][j][k] % 100000;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tll res = 0;\n\t\tREP(i, M+1){\n\t\t\tres += dp[(N*N)%2][i][S];\n\t\t\tres = res % 100000;\n\t\t}\n\t\tcout << res << endl;\n\t}\n}", "#include<iostream>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nint N, M, S;\ntypedef long long int ll;\nint DP[2001][3001];\nint MOD = 100000;\nint main()\n{\n\twhile (true){\n\t\tscanf(\"%d%d%d\", &N, &M, &S);\n\t\tif (N == 0 && M == 0 && S == 0)break;\n\t\tfor (int i = 0; i <= N*N; i++)for (int j = 0; j <=S; j++)DP[i][j] = 0;\n\t\tDP[0][0] = 1;\n\t\tfor (int i = 1; i <= M; i++){\n\t\t\tfor (int j = S; j >= 0; j--){\n\t\t\t\tif (j + i <= S){\n\t\t\t\t\tfor (int k = 1; k <= N*N; k++){\n\t\t\t\t\t\tDP[k][j + i] = (DP[k][j + i] + DP[k - 1][j]) % MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tprintf(\"%d\\n\", DP[N*N][S]%MOD);\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int mod = 1e5;\n\nint main() {\n int N, M, S;\n while (true) {\n cin >> N >> M >> S;\n if (N == 0) break;\n long long dp[N * N + 1][S + 1];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n for (int i = 1; i <= N * N; ++i) {\n for (int j = 0; j <= S; ++j) {\n if (j >= i) (dp[i][j] += dp[i][j - i] + dp[i - 1][j - i]) %= mod;\n if (j >= M + 1) (dp[i][j] += mod - dp[i - 1][j - (M + 1)]) %= mod;\n }\n }\n cout << dp[N * N][S] << endl;\n }\n\n return 0;\n}\n", "# include <iostream>\n# include <algorithm>\n# include <vector>\n# include <string>\n# include <set>\n# include <map>\n# include <cmath>\n# include <iomanip>\n# include <functional>\n# include <utility>\n# include <stack>\n# include <queue>\n# include <list>\n# include <tuple>\n# include <unordered_map>\n# include <numeric>\n# include <complex>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\nconstexpr int INF = 2000000000;\nconstexpr int HINF = INF / 2;\nconstexpr double DINF = 100000000000000000.0;\nconstexpr long long LINF = 9223372036854775807;\nconstexpr long long HLINF = 4500000000000000000;\nconst double PI = acos(-1);\nint dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };\n# define ALL(x) (x).begin(),(x).end()\n# define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\n# define mp make_pair\n# define eb emplace_back\n# define FOR(i,a,b) for(int i=(a);i<(b);++i)\n# define REP(i,n) FOR(i,0,n)\n# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n\nconst int MOD = 100000;\n\nLL n, m, s;\nLL dp[50][4005];\n\nint main() {\n\twhile ((cin >> n >> m >> s) && (n || m || s)){\n\tn *= n;\n\tfor (int i = 0; i < 50; i++)for (int j = 0; j < 4005; j++)dp[i][j] = 0;\n\tdp[0][0] = 1;\n\tfor (int i = 1; i <= m; i++) {\n\t\tfor (LL j = n; j >= 1; j--) {\n\t\t\tfor (int k = i; k <= s; k++) {\n\t\t\t\t(dp[j][k] += dp[j - 1][k - i]) %= MOD;\n\t\t\t}\n\t\t}\n\t}\n\tcout << dp[n][s] << endl;\n}\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n\nint main(){\n\tint n,m,s;\n\twhile(cin>>n>>m>>s&&(n||m||s)){\n\t\tll dp[51][3001] = {};\n\t\tdp[0][0]=1;\n\t\t\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tfor(int j=n*n;j>=1;j--){\n\t\t\t\tfor(int k=1;k<=s;k++){\n\t\t\t\t\tif(k-i>=0)dp[j][k] = ( dp[j][k] + dp[j-1][k-i] )%100000 ;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<dp[n*n][s]<<endl;\n\t}\n}", "import static java.util.Arrays.*;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tstatic void tr(Object... os) {\n\t\tSystem.err.println(deepToString(os));\n\t}\n\n\tstatic final int MOD = 100000;\n\tvoid solve() {\n\t\tint N = sc.nextInt();\n\t\tN = N * N;\n\t\tint M = sc.nextInt();\n\t\tint S = sc.nextInt();\n\t\tif ((N | M | S) == 0) return;\n\t\tint[][] dp = new int[N+1][S+1];\n\t\tdp[0][0] = 1;\n\t\tfor (int m = 1; m <= M; m++) {\n\t\t\tfor (int n = N-1; n >= 0; n--) {\n\t\t\t\tfor (int j = m; j <= S; j++) {\n\t\t\t\t\tdp[n+1][j] += dp[n][j-m];\n\t\t\t\t\tif (dp[n+1][j] >= MOD) dp[n+1][j] -= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(dp[N][S]);\n\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().run();\n\t}\n\n\tMyScanner sc = null;\n\tPrintWriter out = null;\n\tpublic void run() throws Exception {\n\t\tsc = new MyScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tfor (;sc.hasNext();) {\n\t\t\tsolve();\n\t\t\tout.flush();\n\t\t}\n\t\tout.close();\n\t}\n\n\tclass MyScanner {\n\t\tString line;\n\t\tBufferedReader reader;\n\t\tStringTokenizer tokenizer;\n\n\t\tpublic MyScanner(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t\t\ttokenizer = null;\n\t\t}\n\t\tpublic void eat() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tline = reader.readLine();\n\t\t\t\t\tif (line == null) {\n\t\t\t\t\t\ttokenizer = null;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\ttokenizer = new StringTokenizer(line);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpublic String next() {\n\t\t\teat();\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\tpublic boolean hasNext() {\n\t\t\teat();\n\t\t\treturn (tokenizer != null && tokenizer.hasMoreElements());\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint mod=100000;\nint N,M,S;\nint dp[2001][3001];\nint dpsum[2001][3001];\n//int dp1[2009][3009];\nint main()\n{\nwhile(true){\n\tscanf(\"%d%d%d\",&N,&M,&S);\n\tif(N==0&&M==0&&S==0)break;\n\tfor(int i=0;i<=M;i++){\n\t\tfor(int j=0;j<=S;j++){\n\t\t\tdp[i][j]=0;dpsum[i][j]=0;\n\t\t}\n\t}\n\tdp[0][0]=1;\n\tfor(int i=1;i<=N*N;i++){\n\t\tfor(int j=i-1;j<=M;j++){\n\t\t\tint xx=S;\n\t\t\tfor(int k=i+1;k<=N*N;k++){\n\t\t\t\txx-=(j+k-i-1);\n\t\t\t}\n\t\t\tfor(int k=i*(i-1)/2;k<=xx;k++){\n\t\t\t\tif(j!=0){\n\t\t\t\t\tdpsum[j][k]=dpsum[j-1][k]+dp[j][k];\n\t\t\t\t\tif(dpsum[j][k]>=mod)dpsum[j][k]-=mod;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tdpsum[j][k]=dp[j][k];\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\tif(j+k+1<=S){\n\t\t\t\t\tdp1[j+1][j+k+1]=dpsum[j][k];\n\t\t\t\t}*/\n\t\t\t\t//dp1[l][k+l]\n\t\t\t\t/*\n\t\t\t\tif(dp[j][k]==0)continue;\n\t\t\t\tfor(int l=j+1;l<=M;l++){\n\t\t\t\t\n\t\t\t\t\tif(k+l<=S){\n\t\t\t\t\t\tdp1[l][k+l]+=dp[j][k];\n\t\t\t\t\t\tif(dp1[l][k+l]>=mod)dp1[l][k+l]-=mod;\n\t\t\t\t\t}\n\t\t\t\t}*/\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=M;j++){\n\t\t\tfor(int k=j;k<=S;k++){\n\t\t\t\tdp[j][k]=0;\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=M;j++){\n\t\t\tfor(int k=0;k<=S-j-1;k++){\n\t\t\t\tdp[j+1][j+k+1]=dpsum[j][k];dpsum[j][k]=0;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t/*\n\t\tfor(int j=0;j<=M;j++){\n\t\t\tfor(int k=0;k<=S;k++){\n\t\t\t\tif(dp[j][k]!=0)printf(\"%d %d %d:%d\\n\",i,j,k,dp[j][k]);\n\t\t\t}\n\t\t}*/\n\t}\n\tint ans=0;\n\tfor(int j=1;j<=M;j++){\n\t\t//printf(\"\")\n\t\tans+=dp[j][S];ans%=mod;\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i = (a); i < (b); i++)\n#define REP(i,n) FOR(i,0,n)\n\nint dp[50][3001];\nint n, m, s;\nconst int mod = 100000;\n\nint main() {\n\twhile (cin >> n >> m >> s, n || m || s) {\n\t\tn *= n;\n\t\t\n\t\tfill(dp[0], dp[n + 1], 0);\n\t\t\n\t\tdp[0][0] = 1;\n\t\tFOR(i, 1, m + 1) for (int j = n - 1; j >= 0; j--) REP(k, s + 1) {\n\t\t\tif (k + i > s) break;\n\t\t\tdp[j + 1][k + i] += dp[j][k];\n\t\t\tdp[j + 1][k + i] %= mod;\n\t\t}\n\t\t\n\t\t\n\t\tcout << dp[n][s] << endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\n#define UNDEF -1\n\nint N,M,S,dp[2001][3001];\n\nint ths(int begin,int end,int count)\n{\n\treturn ((begin + end) * count) / 2;\n}\n\nint main(void)\n{\n\twhile(true)\n\t{\n\t\tcin >> N >> M >> S;\n\t\tif(N == 0 && M == 0 && S == 0)\n\t\t\texit(0);\n\t\tfor(int i = 0;i < 2001;i++)\n\t\t{\n\t\t\tfor(int ii = 0;ii < 3001;ii++)\n\t\t\t\tdp[i][ii] = 0;\n\t\t}\n\t\tdp[0][0] = 1;\n\t\tint t = ths(1,N*N,N*N);\n\t\tfor(int i = 1;i <= N * N;i++)\n\t\t{\n\t\t\tfor(int j = 0;j < M-(N*N);j++)\n\t\t\t{\n\t\t\t\tfor(int k = 0;k < S - t;k++)\n\t\t\t\t{\n\t\t\t\t\tif(j < 2000 && k+i < 3001)\n\t\t\t\t\t\tdp[j+1][k+i] = (dp[j+1][k+i] + dp[j][k]) % 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint result = 0;\n\t\tfor(int i = 0;i <= M - (N*N);i++)\n\t\t{\n\t\t\tresult = (result + dp[i][S - t]) % 100000;\n\t\t}\n\t\tcout << result << endl;\n\t}\n}", "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint MOD=100000;\nint dp[2001][3001];\nint sum[2001][3001];\nint main(){\n\tint a,b,c;\n\twhile(scanf(\"%d%d%d\",&a,&b,&c),a+b+c){\n\t\tfor(int i=0;i<2001;i++)\n\t\t\tfor(int j=0;j<3001;j++)\n\t\t\t\tdp[i][j]=dp[i][j]=sum[i][j]=0;\n\t\tdp[0][0]=1;\n\t\tfor(int i=0;i<=b;i++){\n\t\t\tsum[i][0]=1;\n\t\t}\n\t\tfor(int i=1;i<=a*a;i++){\n\t\t//\tprintf(\"%d %d\\n\",i,min(b,(a*a-i)?(c/(a*a-i)):b));\n\t\t\tfor(int j=i;j<=min(b,(a*a-i)?(c/(a*a-i)):b);j++){\n\t\t\t\tfor(int k=i*(i+1)/2;k+(a*a-i)*j<=c;k++){\n\t\t\t\t\tdp[j][k]=sum[j-1][k-j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=i-1;j<=min(b,(a*a-i)?(c/(a*a-i)):b);j++)\n\t\t\t\tfor(int k=0;k+(a*a-i)*j<=c;k++)\n\t\t\t\t\tsum[j][k]=0;\n\t\t\tfor(int j=i;j<=min(b,(a*a-i)?(c/(a*a-i)):b);j++){\n\t\t\t\tfor(int k=i*(i+1)/2;k+(a*a-i)*j<=c;k++)\n\t\t\t\t\tsum[j][k]=(sum[j-1][k]+dp[j][k])%MOD;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",sum[b][c]);\n\t}\n}", "#include <bits/stdc++.h> \nusing namespace std;\n\n#define INF 1.1e9\n#define LINF 1.1e18\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)\n#define ALL(v) (v).begin(), (v).end()\n#define pb push_back\n#define pf push_front\n#define fi first\n#define se second\n#define BIT(x, n) bitset<n>(x)\n#define PI 3.14159265358979323846\n\ntypedef long long ll;\ntypedef pair< int, int > P;\ntypedef pair< int, P > PP;\n\n//-------------------------------------------------\n\nint n, m, s;\nconst int MOD = 100000;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(true) {\n\t\tcin >> n >> m >> s;\n\t\tif (n == 0) break;\n\t\tint dp[50][3010] = {};\n\t\tdp[0][0] = 1;\n\t\tfor (int j = 1; j <= m; j++) {\n\t\t\tfor (int i = n * n - 1; i >= 0; i--) {\n\t\t\t\tfor (int k = s - j; k >= 0; k--) {\n\t\t\t\t\tif (dp[i][k] > 0) {\n\t\t\t\t\t\tdp[i + 1][k + j] += dp[i][k];\n\t\t\t\t\t\tdp[i + 1][k + j] %= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t \t}\n\t\tcout << dp[n * n][s] << endl;\n\t}\n\n return 0;\n}\n\n\n", "#include <cstdio>\n#include <cstring>\n\nusing namespace std;\n\n#define MAX_N 7\n#define MAX_S 3000\n#define MOD 100000\n\nint dp[MAX_N * MAX_N + 1][MAX_S + 1];\n\nint main()\n{\n\tint N, M, S;\n\twhile (scanf(\"%d %d %d\", &N, &M, &S), N || M || S) {\n\t\tmemset(dp, 0, sizeof(dp));\n\n\t\tdp[0][0] = 1;\n\n\t\tfor (int k = 1; k <= M; ++k) {\n\t\t\tfor (int i = N * N; i >= 1; --i) {\n\t\t\t\tfor (int j = k; j <= S; ++j) {\n\t\t\t\t\tdp[i][j] += dp[i - 1][j - k];\n\t\t\t\t\tdp[i][j] %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\", dp[N * N][S]);\n\t}\n}", "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define REP(n) rep(i,n)\n#define all(n) n.begin(),n.end()\n\nconst int MAXN = 7, MAXS = 3000 ;\nint n, m, s;\nunsigned int dp[MAXN * MAXN + 2][MAXS + 10], UB = 100000;\n\nint main()\n{\n\n while(cin >> n >> m >> s && n)\n {\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n\n for(int i_m = 1; i_m <= m; i_m++)\n for(int i_n = n * n + 1; i_n > 0; i_n--)\n for(int i_s = s; i_s > 0; i_s--)\n if(i_s - i_m >= 0) \n dp[i_n][i_s] = \n (dp[i_n][i_s] + dp[i_n - 1][i_s - i_m]) % UB;\n \n //rep(i,n*n){rep(j,s) cout << dp[i][j] << \",\"; cout << endl;}\n\n cout << dp[n * n][s] << endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int mod = 1e5;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint N, M, S;\n\twhile (cin >> N >> M >> S, N | M | S) {\n\t\tN *= N;\n\t\tvector<vector<int>> dp(S + 1, vector<int>(N + 1));\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 1; i <= M; i++) {\n\t\t\tfor (int j = S; j >= i; j--) {\n\t\t\t\tfor (int k = N; k > 0; k--) {\n\t\t\t\t\t(dp[j][k] += dp[j - i][k - 1]) %= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", dp[S][N]);\n\t}\n\treturn 0;\n}\n\n", "#include <iostream>\n#include <algorithm>\n\nusing namespace std ;\n\nconst int M = 100000;\n\nint main(){\n int n, m, s, dp[50][3001];\n while(cin >> n >> m >> s && (n|m|s)){\n fill(dp[0], dp[50], 0);\n dp[0][0] = 1;\n for(int k=1;k<=m;k++){\n for(int i=n*n;i>0;i--){\n for(int j=k;j<=s;j++){\n dp[i][j] = (dp[i][j] + dp[i-1][j-k]) % M;\n }\n }\n }\n cout << dp[n*n][s] << endl;\n }\n}", "\n//y09-6 ビンゴ(2回目)\n#include <iostream>\n#include <fstream>\n#include <stdio.h>\n#include <math.h>\n#include <time.h>\n#include <string>\n#include <vector>\n#include <map>\n#include <list>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cstdlib>\n#include <algorithm>\n#include <random>\n#include <cassert>\nusing namespace std;\n#define LL long long\n#undef INT_MIN\n#undef INT_MAX\n#define INT_MIN -2147483648\n#define INT_MAX 2147483647\n#define LL_MIN -9223372036854775808\n#define LL_MAX 9223372036854775807\n#define segment_size 65536\n#define ROOP() while (true)\n\nint main(){\n ROOP(){\n int N,M,S;\n cin >> N >> M >> S;\n if(N==0) return 0;\n\n int dp[50][3001];\n for(int i=0; i<50; i++){\n for(int j=0; j<3001; j++){\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n\n for(int i=1; i<=M; i++){\n for(int j=N*N; j>=1; j--){\n for(int k=i; k<=S; k++){\n dp[j][k] += dp[j-1][k-i];\n dp[j][k] %= 100000;\n }\n }\n }\n cout << dp[N*N][S] << endl;\n\n }\n return 0;\n}\n\n\n", "#include<iostream>\n#include<sstream>\n#include<vector>\n#include<set>\n#include<map>\n#include<queue>\n#include<algorithm>\n#include<numeric>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<cassert>\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define all(c) (c).begin(),(c).end()\n#define mp make_pair\n#define pb push_back\n#define rp(i,c) rep(i,(c).size())\n#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)\n#define dbg(x) cerr<<#x<<\" = \"<<(x)<<endl\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pi;\nconst int inf=1<<28;\nconst double INF=1e12,EPS=1e-9;\n\nint n,m,s;\nint dp[50][3001];\n\nint main()\n{\n\twhile(scanf(\"%d%d%d\",&n,&m,&s),n){\n\t\trep(i,n*n+1)rep(j,s+1)dp[i][j]=0;\n\t\tdp[0][0]=1;\n\t\tm=min(m,s);\n\t\t\n\t\trep(i,m){\n\t\t\tfor(int j=n*n;j>0;j--)for(int k=s;k>n*n-j;k--){\n\t\t\t\tdp[j][k]=dp[j-1][k-(n*n-j+1)]+dp[j][k-(n*n-j+1)];\n\t\t\t\tif(dp[j][k]>100000)dp[j][k]-=100000;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp[n*n][s]);\n\t}\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\ntypedef long long ll;\nll mod=100000;\nint N,M,S;\n\nll dp[50][3001];\n\nvoid init(){\n for(int i=0;i<50;i++)\n for(int j=0;j<3001;j++)\n dp[i][j]=0;\n dp[0][0]=1;\n}\n\nint main(){\n while(1){\n cin>>N>>M>>S;\n if(N==0&&M==0&&S==0)break;\n init();\n for(int i=1;i<=N*N;i++){\n for(int j=0;j<=S;j++){\n\tif(j-i>=0)dp[i][j]+=dp[i-1][j-i];\n\tif(j-i>=0)dp[i][j]+=dp[i][j-i];\n\tif(j-M-1>=0)dp[i][j]+=(mod-dp[i-1][j-M-1]);\n\tdp[i][j]%=mod;\n }\n }\n cout<<dp[N*N][S]<<endl;\n }\n return 0;\n}", "#include \"bits/stdc++.h\"\n \nusing namespace std;\n \ntypedef long long ll;\n \n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n \nint main(){\n int n,m,s;\n while(cin>>n>>m>>s){\n if(n==0&&m==0&&s==0)break;\n \n static int dp[2][2300][3300];\n \n rep(i,2)rep(j,2300)rep(k,3300)dp[i][j][k]=0;\n dp[0][0][0] = 1;\n \n for(int i=1;i<=n*n;i++){\n for(int j=0;j<2300;j++)\n for(int k=0;k<3300;k++)\n dp[i%2][j][k] = 0;\n for(int j=1;j<=m;j++){\n for(int k=1;k<=s;k++){\n if(k-j>=0){\n dp[i%2][j][k] += dp[i%2][j-1][k-1] + dp[(i-1)%2][j-1][k-j];\n dp[i%2][j][k] %= 100000;\n }\n }\n }\n }\n \n \n ll ans = 0;\n for(int i=0;i<=m;i++){\n ans+=dp[(n*n)%2][i][s];\n ans%=100000;\n }\n cout<<ans<<endl; \n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint dp[2][2000][3000];\nsigned main() {\n\tint a, b, c;\n\twhile (cin >> a >> b >> c, a || b || c) {\n\t\ta *= a;\n\t\tc -= a*(a + 1) / 2;\n\t\tb -= a;\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0][0] = 1;\n\t\tfor (int d = 1; d <= a; d++) {\n\t\t\tmemset(dp[d & 1], 0, sizeof(dp[d & 1]));\n\t\t\tfor (int e = 0; e <= b; e++) {\n\t\t\t\tfor (int f = 0; f <= c; f++) {\n\t\t\t\t\tdp[d & 1][e][f] = dp[(d + 1) & 1][e][f];\n\t\t\t\t\tif (e >= 1 && f >= (a - d + 1)) {\n\t\t\t\t\t\tdp[d & 1][e][f] = (dp[d & 1][e][f] + dp[d & 1][e - 1][f - (a - d + 1)])%100000;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint sum = 0;\n\t\tfor (int i = 0; i <= b; i++) {\n\t\t\tsum = (sum+dp[a & 1][i][c])%100000;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n}", "#include \"bits/stdc++.h\"\n \nusing namespace std;\n \ntypedef long long ll;\n \n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n\nint dp[2][2300][3300];\n\n \nint main(){\n int n,m,s;\n while(cin>>n>>m>>s){\n if(n==0&&m==0&&s==0)break;\n \n \n rep(i,2)rep(j,2300)rep(k,3300)dp[i][j][k]=0;\n dp[0][0][0] = 1;\n \n for(int i=1;i<=n*n;i++){\n for(int j=0;j<2300;j++)\n for(int k=0;k<3300;k++)\n dp[i%2][j][k] = 0;\n for(int j=1;j<=m;j++){\n for(int k=1;k<=s;k++){\n if(k-j>=0){\n dp[i%2][j][k] += dp[i%2][j-1][k-1] + dp[(i-1)%2][j-1][k-j];\n dp[i%2][j][k] %= 100000;\n }\n }\n }\n }\n \n \n ll ans = 0;\n for(int i=0;i<=m;i++){\n ans+=dp[(n*n)%2][i][s];\n ans%=100000;\n }\n cout<<ans<<endl; \n }\n}", "#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint n,m,s;\nint dp[50][3001];\nint main(){\n\twhile(cin >> n >> m >> s && n){\n\t\tn *= n;\n\t\tm = min(m,s);\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\tfor(int j = 1 ; j <= m ; j++){\n\t\t\tfor(int k = s-j ; k >= 0 ; k--){\n\t\t\t\tfor(int i = 1 ; i <= n ; i++){\n\t\t\t\t\t(dp[i][k+j] += dp[i-1][k])%=100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n][s] << endl;\n\t}\n}", "#include<iostream>\nusing namespace std;\n \nint dp[2][2001][3001];\nconst int mod = 100000;\nint main(){\n int n,m,s;\n while(cin>>n>>m>>s){\n if(n==0)break;\n n *= n;\n\n for(int j=0;j<=m;j++)\n for(int k=0;k<=s;k++)\n\tdp[0][j][k]=0;\n\n dp[0][0][0]=1; \n for(int i=0;i<=n;i++){\n int now=i&1;\n int next=now^1;\n\n for(int j=0;j<=m;j++)\n\tfor(int k=0;k<=s;k++)\n\t dp[next][j][k]=0;\n \n for(int j=0;j<m;j++){\n\tfor(int k=0;k<=s;k++){\n\t if(dp[now][j][k]==0)continue;\n\t (dp[now][j+1][k]+=dp[now][j][k]) %= mod;\n\t if(k+j+1<= s)(dp[next][j+1][k+j+1]+=dp[now][j][k]) %= mod;\n\t //cout << dp[now][j+1][k] << \" \" ;\n\t}\n\t//cout << endl;\n }\n //cout << endl;\n }\n cout << dp[n&1][m][s] << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <queue>\n#include <cmath>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define rep1(i,n) for(int i=1;i<=(n);++i)\n#define all(c) (c).begin(),(c).end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl;\nint mod=100000;\nint dp[2][50][3001];\nvoid add(int& x,int y){\n\tx+=y;\n\tif(x>=mod) x-=mod;\n}\nint main(){\n\twhile(true){\n\t\tint n,m,s;\n\t\tscanf(\"%d%d%d\",&n,&m,&s);\n\t\tif(n==0) break;\n\t\tn=n*n;\n\t\trep(j,n+1) rep(k,s+1) dp[0][j][k]=0;\n\t\tdp[0][0][0]=1;\n\t\trep(i,m){\n\t\t\trep(j,n+1) rep(k,s+1) dp[1-i%2][j][k]=0;\n\t\t\trep(j,n+1){\n\t\t\t\trep(k,s+1){\n\t\t\t\t\tif((i*2+1+n-j)*(n-j)/2>s) break;\n\t\t\t\t\tadd(dp[1-i%2][j][k],dp[i%2][j][k]);\n\t\t\t\t\tif(j+1<=n&&k+i+1<=s) add(dp[1-i%2][j+1][k+i+1],dp[i%2][j][k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<dp[m%2][n][s]<<endl;\n\t}\n}", "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define MOD 100000\nint N, M, S;\nint dp[2][2001][2001];\nint T[2001][2001];\n\nint main() {\n while (cin >> N >> M >> S) {\n if (N == 0 && M == 0 && S == 0) break;\n for (int j=1; j<=M; j++) {\n for (int k=1; k<=S; k++) {\n dp[0][j][k] = 0;\n }\n }\n\n N *= N;\n S -= N*(N+1) / 2;\n M = min(M - N, S);\n for (int i=0; i<=M; i++) dp[0][i][i] = 1;\n\n for (int i=0; i<N-1; i++) {\n int _ = i%2;\n for (int j=0; j<=M; j++) {\n for (int k=0; k<=S; k++) {\n dp[_^1][j][k] = 0;\n T[j][k] = 0;\n }\n }\n for (int j=0; j<=M; j++) {\n for (int k=0; k<=S; k++) {\n if (j + k <= S) {\n T[j][j+k] = (T[j][j+k] + dp[_][j][k]) % MOD;\n }\n }\n }\n for (int j=0; j<=M; j++) {\n for (int k=0; k<=S; k++) {\n if (j > 0 && k > 0) T[j][k] = (T[j][k] + T[j-1][k-1]) % MOD;\n dp[_^1][j][k] = (dp[_^1][j][k] + T[j][k]) % MOD;\n }\n }\n }\n int m = 0;\n for (int i=0; i<=M; i++) m = (m + dp[(N-1)%2][i][S]) % MOD;\n cout << m << \"\\n\";\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nusing pii = pair<int, int>;\nusing vi = vector<int>;\nusing ll = long long;\n\nconstexpr int mod = 100000;\n\nint main() {\n int N, M, S;\n while(cin >> N >> M >> S, N) {\n vector<vector<int>> dp(N * N + 1, vector<int>(S + 1));\n dp[0][0] = 1;\n for(int i = 1; i <= N * N; ++i) {\n for(int j = 0; j <= S; ++j) {\n if(i <= j) {\n dp[i][j] += dp[i][j - i] + dp[i - 1][j - i];\n }\n if(j - M - 1 >= 0) {\n dp[i][j] -= dp[i - 1][j - M - 1];\n }\n dp[i][j] = (dp[i][j] + mod) % mod;\n }\n }\n cout << dp[N * N][S] << endl;\n }\n}\n", "#include<cstdio>\n#include<algorithm>\nusing namespace std;\nstatic const int MAX_N = 7;\nstatic const int MAX_M = 2000;\nstatic const int MAX_S = 3000;\nstatic const int MOD = 100000;\n \nint N, M, S;\nint memo[2][MAX_M + 1][MAX_S + 1];\n \nint main(){\n for(;;){\n scanf(\"%d %d %d\", &N, &M, &S);\n if(N == 0 && M == 0 && S == 0) break;\n N *= N;\n fill(memo[0][0], memo[2][0], 0);\n memo[0][0][0]++;\n for(int i = 1; i <= N; i++){\n for(int j = 1; j <= M; j++){\n for(int k = 0; k <= S; k++){\n int diff = N - i + 1;\n if(k - diff < 0) continue;\n memo[1][j][k] = memo[1][j - 1][k - diff]; // b_iの値を1つ増やす場合\n memo[1][j][k] += memo[0][j - 1][k - diff]; // b_(i-1)からb_iに切り替える場合\n memo[1][j][k] %= MOD;\n }\n }\n for(int j = 0; j <= M; j++){\n for(int k = 0; k <= S; k++){\n memo[0][j][k] = memo[1][j][k];\n }\n }\n }\n int res = 0;\n for(int i = 0; i <= M; i++){\n res += memo[0][i][S];\n res %= MOD;\n }\n printf(\"%d\\n\", res);\n }\n return 0;\n}\n", "#include<iostream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\n#define MAX_N 2000\n#define MAX_M 3000\n\nint x[MAX_N + 1][MAX_M + 1];\nint y[MAX_N + 1][MAX_M + 1];\n\nint z[50][MAX_M];\nint sum = 0;\n\nint main() {\n\tint n, m, s, d, e, f, g;\n\twhile (true) {\n\t\tcin >> n >> m >> s;\n\t\tif ((n == 0 && m == 0) && s == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tmemset(x, 0, sizeof(x));\n\t\tmemset(y, 0, sizeof(y));\n\t\tmemset(z,0,sizeof(z));\n\n\t\tif(m<s-((n*n)-2)*((n*n)-1)/2){\n\t\t\tmemset(y, 0, sizeof(y));\n\t\t\tfor (int i = 1; i <= m; i++) {\n\t\t\t\tx[i][i] = 1;\n\t\t\t}\n\t\t\tfor (int i = 2; i <= n*n; i++) {\n\t\t\t\td = s / (n*n - i + 1);\n\t\t\t\te = min(m, d);\n\t\t\t\tf = s*i / (n*n) + i - n * n;\n\t\t\t\tg = (i - 2)*(i - 1) / 2;\n\t\t\t\tfor (int j = i - 1; j <= e; j++) {\n\t\t\t\t\tfor (int k = j + g; k <= f; k++) {\n\t\t\t\t\t\tfor (int l = j + 1; l <= e; l++) {\n\t\t\t\t\t\t\ty[l][k + l] += x[j][k];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ty[2000][3000] = 0;\n\t\t\t\tfor (int j = i; j <= e; j++) {\n\t\t\t\t\tfor (int k = j; k <= s; k++) {\n\t\t\t\t\t\tx[j][k] = y[j][k] % 100000;\n\t\t\t\t\t\ty[j][k] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ty[0][0] = 0;\n\t\t\t}\n\t\t\tsum=0;\n\t\t\tfor (int i = 0; i <= m; i++) {\n\t\t\t\tsum += x[i][s];\n\t\t\t\tsum %= 100000;\n\t\t\t}\n\t\t}\n\n\t\telse{\n\t\t\tz[0][0]=1;\n\t\t\tfor(int i=1;i<=n*n;i++){\n\t\t\t\td=n*n-i+1;\n\t\t\t\tfor(int j=0;j<=s;j++){\n\t\t\t\t\te=0;\n\t\t\t\t\twhile(j+e*d<=s){\n\t\t\t\t\t\tz[i][j+e*d] += z[i-1][j];\n\t\t\t\t\t\tz[i][j+e*d] %= 100000;\n\t\t\t\t\t\te++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tsum=z[n*n][s-((n*n)+1)*(n*n)/2]%100000;\n\t\t}\n\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nconst int mod=100000;\nint dp[2][2001][3001];\nint main(){\n int n,m,s;\n while(cin>>n>>m>>s,n){\n fill(dp[0][0],dp[0][0]+2*2001*3001,0);\n n*=n;\n\n for(int i=1;i<=n;i++){\n for(int j=1;j<=m;j++){\n for(int k=1;k<=s;k++){\n if(i==1){\n if(k<=j)dp[i&1][j][k]=1;\n }\n else{\n dp[i&1][j][k]=dp[i&1][j-1][k];\n if(k-j>=0)dp[i&1][j][k]+=dp[(i-1)&1][j-1][k-j];\n }\n dp[i&1][j][k]%=mod;\n }\n }\n }\n\n cout<<dp[n&1][m][s]<<endl;\n }\n return 0;\n}", "#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint main(){\nwhile(1){\n\tint n,m,s;\n\tstatic int dp[2][2002][3002];\n\tfor(int i=0;i<2;i++)for(int j=0;j<2002;j++)for(int k=0;k<3002;k++)dp[i][j][k]=0;\n\tscanf(\"%d%d%d\",&n,&m,&s);\n\tif(n==0&&m==0&&s==0)break;\n\tfor(int j=0;j<=m;j++)dp[0][j][0]=1;\n\tfor(int i=1;i<=n*n;i++){\n\t\tfor(int j=i;j<=m;j++){\n\t\t\tfor(int k=1;k<=s;k++){\n\t\t\t\tif(k-j>=0){\n\t\t\t\t\tdp[1][j][k]=dp[0][j-1][k-j];\n\t\t\t\t}\n\t\t\t\tdp[1][j][k]+=dp[1][j-1][k];\n\t\t\t\tdp[1][j][k]%=100000;\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=m;j++)for(int k=0;k<=s;k++){dp[0][j][k]=dp[1][j][k]; dp[1][j][k]=0;}\n\t}\n\tprintf(\"%d\\n\",dp[0][m][s]);\n}\n}", "#include<iostream>\n#include<sstream>\n#include<cstdio>\n#include<cstdlib>\n#include<vector>\n#include<string>\n#include<stack>\n#include<queue>\n#include<deque>\n#include<set>\n#include<map>\n#include<algorithm>\n#include<functional>\n#include<utility>\n#include<cmath>\n#include<ctime>\n#include<complex>\n\nusing namespace std;\n\n#define REP(i,s,e) for(int i=int(s);i<=int(e);i++)\n#define rep(i,n) for(int i=0;i<int(n);i++)\n\nint B[50][3001];\n\nint main(){\n\n\tint N,M,S;\n\twhile(1){\n\n\t\tcin >> N >> M >> S;\n\t\tif(N==0 && M==0 && S==0) break;\n\n\n int mod=100000;\n\n B[0][0]=1;\n\n\t\tfor(int k=1;k<=M;k++){\n\t\t\tfor(int n=N*N;n>=1;n--){\n\t\t\t\tfor(int s=S;s>=1;s--){\n\n\t\t\t\tif(s-k>=0 && n-1>=0)\n\t\t\t\t\tB[n][s]=B[n-1][s-k]%mod+B[n][s]%mod;\n\t\t\t\telse\n\t\t\t\t\tB[n][s]=B[n][s]%mod;\n\n\t\t }\n\t\t }\n\t\t}\n\n\t\tcout << B[N*N][S]%mod << endl;\n\n\t\tREP(n,0,N*N) REP(s,0,S) B[n][s]=0;\n\n\t}\n\n\treturn 0;\n}", "#include<bits/stdc++.h>\n\nint d[50][3001];\nint main() {\n\tint n, m, s;\n\twhile (scanf(\"%d%d%d\", &n, &m, &s), n *= n) {\n\t\tmemset(d, 0, sizeof(d));\n\t\td[0][0] = 1;\n\t\tfor (int i = 1; i <= m; i++)\n\t\t\tfor (int j = n; j > 0; j--)\n\t\t\t\tfor (int k = i; k <= s; k++)\n\t\t\t\t\t(d[j][k] += d[j - 1][k - i]) %= 100000;\n\t\tprintf(\"%d\\n\", d[n][s]);\n\t}\n}", "#include <cstdio>\n#include <cstring>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nconst int mod = 100000;\n\nint main()\n{\n\twhile(true) {\n\t\n\t\tint n, m, s;\n\t\n\t\tscanf(\"%d%d%d\", &n, &m, &s);\n\t\t\n\t\tif(n == 0 && m == 0 && s == 0)\n\t\t\tbreak;\n\t\n\t\tn = n * n;\n\t\ts -= (0 + (n - 1)) * n / 2;\n\t\tm = min(m, s);\n\t\n\t\tstatic int dp[3001][2001] = {0};\n\t\t\n\t\tmemset(dp[0], 0, 3001 * 2001 * sizeof(int));\n\t\n\t\tfor(int i = 1; i <= m; ++i)\n\t\t\tdp[i][i] = 1;\n\t\n\t\tfor(int i = 1; i < n; ++i) {\n\t\t\n\t\t\tfor(int x = 1; x <= m - i; ++x) {\n\t\n\t\t\t\tfor(int sum = s; sum > x; --sum)\n\t\t\t\t\tdp[sum][x] = (dp[sum - 1][x - 1] + dp[sum - x][x]) % mod;\n\n\t\t\t\tfor(int sum = x; sum > 0; --sum)\n\t\t\t\t\tdp[sum][x] = (dp[sum - 1][x - 1]) % mod;\n\t\t\t}\t\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tfor(int i = 1; i <= m - (n - 1); ++i) {\n\t\t\tans += dp[s][i];\n\t\t\tans %= mod;\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\t\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, m, s;\nint dp[2][2001][3001];\n\nint main() {\n while(cin >> n >> m >> s, n){\n for(int i=0;i<2;i++){\n for(int j=0;j<=m;j++){\n fill(dp[i][j], dp[i][j]+s+1, 0);\n }\n }\n dp[0][0][0] = 1;\n for(int i=0;i<n*n;i++){\n for(int j=0;j<m;j++){\n for(int k=0;k<=s;k++){\n dp[i%2][j+1][k] += dp[i%2][j][k];\n dp[i%2][j+1][k] %= 100000;\n if(k+j+1 <= s){\n dp[(i+1)%2][j+1][k+j+1] += dp[i%2][j][k];\n dp[(i+1)%2][j+1][k+j+1] %= 100000;\n }\n }\n }\n for(int j=0;j<=m;j++){\n fill(dp[i%2][j], dp[i%2][j]+s+1, 0);\n }\n }\n int ans = 0;\n for(int i=0;i<=m;i++){\n ans += dp[(n*n)%2][i][s];\n ans %= 100000;\n }\n cout << ans << endl;\n }\n \n\n return 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint dp[50][3010];\nconst int mod=100000;\nint main(){\n\twhile(true){\n\t\tint n,m,s;\tcin>>n>>m>>s;\n\t\tif(n==0)\treturn 0;\n\t\tint a=n*n;\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0]=1;\n\t\tfor(int i=1;i<=a;i++){\n\t\t\tfor(int j=0;j<=s;j++){\n\t\t\t\tif(j-(a-i+1)>=0){\n\t\t\t\t\t(dp[i][j]+=dp[i-1][j-(a-i+1)])%=mod;\n\t\t\t\t\t(dp[i][j]+=dp[i][j-(a-i+1)])%=mod;\n\t\t\t\t}\n\t\t\t\tif(j>m)\t(dp[i][j]+=mod-dp[i-1][j-m-1])%=mod;\n\t\t\t}\t\n\t\t}\n\t\tcout<<dp[a][s]<<endl;\n\t}\n}", "#include <iostream>\n\nusing namespace std;\nconst int mod = 100000;\n\nint dp[2][2001][3001];\n\nint main(int argc, char const* argv[])\n{\n\tint n, m, s;\n\tdo{\n\t\t\tcin >> n >> m >> s;\n\t\t\tif(n == 0)break;\n\t\t\tfor(int i = 0; i < n * n; i++){\n\t\t\t\t\tfor(int j = 1; j <= m; j++){\n\t\t\t\t\t\t\tfor(int k = 1; k <= s; k++){\n\t\t\t\t\t\t\t\t\tif(i == 1){\n\t\t\t\t\t\t\t\t\t\t\tif(j < k)dp[1][j][k] = 0;\n\t\t\t\t\t\t\t\t\t\t\telse dp[1][j][k] = 1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tdp[(i + 1) & 1][j][k] = dp[(i + 1) & 1][j-1][k];\n\t\t\t\t\t\t\t\t\tif(k -j >= 0)dp[(i + 1) & 1][j][k] += dp[i & 1][j-1][k-j];\n\t\t\t\t\t\t\t\t\tdp[(i + 1) & 1][j][k] %= mod;\n\t\t\t\t\t\t\t\t\t// cout << i << \" \" << j << \" \" << k << \" \" << dp[(i + 1) & 1][j][k] << endl;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t}\n\t\t\tcout << dp[(n*n) & 1][m][s] << endl;\n\t}while(true);\n\treturn 0;\n}\n\n", "import java.util.Scanner;\n\n//Bingo\npublic class Main{\n\n\tvoid run(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint MOD = 100000;\n\t\tfor(;;){\n\t\t\tint N = sc.nextInt(), M = sc.nextInt(), S = sc.nextInt();\n\t\t\tif((N|M|S)==0)break;\n\t\t\tN*=N;\n\t\t\tint[][] dp = new int[N+1][S+1];\n\t\t\tdp[0][0] = 1;\n\t\t\tfor(int m=1;m<=M;m++)for(int k=N;k>0;k--)for(int s=m;s<=S;s++){\n\t\t\t\tdp[k][s]+=dp[k-1][s-m];\n\t\t\t\tif(MOD<=dp[k][s])dp[k][s]-=MOD;\n\t\t\t}\n\t\t\tSystem.out.println(dp[N][S]);\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "def main():\n while True:\n N, M, S = map(int, input().split())\n if max(N, M, S) == 0:\n break\n ans = solve(N, M, S)\n print(ans)\n\n\ndef solve(N, M, S):\n MOD = 10 ** 5\n p = N * N\n q = M - p\n T = S - (p * (p + 1)) // 2\n\n dp = [[0 for i in range(T + 1)] for j in range(p + 1)]\n dp[0][0] = 1\n for i in range(1, p + 1):\n for j in range(T + 1):\n dp[i][j] = dp[i - 1][j]\n if j - i >= 0:\n dp[i][j] += dp[i][j - i]\n if j - i - q >= 0:\n dp[i][j] -= dp[i - 1][j - i - q]\n\n dp[i][j] %= MOD\n\n ans = dp[p][T]\n # for r in dp:\n # print(\", \".join(map(str, r)))\n return ans\n\n\nmain()\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nint n,m,s;\n\nint main(){\n while(true){\n cin >> n >> m >> s;\n if(n==0){\n break;\n }\n int mod=pow(10,5);\n n=pow(n,2);\n m-=n;\n s-=(n*(n+1))/2;\n int m3=min(max((s+1)/n+1,1),m);\n vector<vector<int>> dp(s+1,vector<int>(m3+1,0));\n dp[0][0]=1;\n for(int i=0;i<n;i++){\n int m2=min(max((s+1)/(n-i)+1,1),m);\n vector<vector<int>> dp2(s+1,vector<int>(m2+1,0));\n for(int j=0;j<s+1;j++){\n for(int k=0;k<m3+1;k++){\n if(j+k<=s){\n dp2[j+k][k]+=dp[j][k];\n }\n }\n }\n for(int l=-(m2+1);l<s+2;l++){\n for(int j=max(0,l)+1;j<min(s,m2+l)+1;j++){\n dp2[j][j-l]=(dp2[j][j-l]+dp2[j-1][j-l-1])%mod;\n }\n }\n dp=dp2;\n m3=m2;\n }\n cout << accumulate(dp[s].begin(),dp[s].end(),0)%mod << endl;\n }\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nint dp[2200][3200],_prev[2200][3200],n,m,s;\nint main(){\n\twhile(true){\n\t\tcin>>n>>s>>m;if(n==0)return 0;n*=n;\n\t\tfor(int i=0;i<2200;i++){fill(dp[i],dp[i]+3180,0);fill(_prev[i],_prev[i]+3180,0);}\n\t\tfor(int i=0;i<=s;i++)_prev[i][0]=1;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=1;j<=s;j++){\n\t\t\t\tfor(int k=j;k<=m;k++){\n\t\t\t\t\tdp[j][k]+=_prev[j-1][k-j];dp[j][k]%=100000;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=0;j<=s;j++){\n\t\t\t\tfor(int k=0;k<=m;k++){\n\t\t\t\t\t_prev[j][k]=dp[j][k];dp[j][k]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=1;j<=s;j++){\n\t\t\t\tfor(int k=1;k<=m;k++){\n\t\t\t\t\t_prev[j][k]+=_prev[j-1][k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<_prev[s][m]%100000<<endl;\n\t}\n}", "\n//y09-6 ビンゴ(2回目)\n#include <iostream>\n#include <fstream>\n#include <stdio.h>\n#include <math.h>\n#include <time.h>\n#include <string>\n#include <vector>\n#include <map>\n#include <list>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cstdlib>\n#include <algorithm>\n#include <random>\n#include <cassert>\nusing namespace std;\n#define LL long long\n#undef INT_MIN\n#undef INT_MAX\n#define INT_MIN -2147483648\n#define INT_MAX 2147483647\n#define LL_MIN -9223372036854775808\n#define LL_MAX 9223372036854775807\n#define segment_size 65536\n#define ROOP() while (true)\n\nint main(){\n ROOP(){\n int N,M,S;\n cin >> N >> M >> S;\n if(N==0) return 0;\n\n int dp[50][3001];\n for(int i=0; i<50; i++){\n for(int j=0; j<3001; j++){\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n\n for(int i=1; i<=N*N; i++){\n for(int j=1; j<=S; j++){\n if(j>=i) dp[i][j] = dp[i-1][j-i] + dp[i][j-i];\n if(j>M) dp[i][j] -= dp[i-1][j-M-1];\n dp[i][j] %= 100000;\n if(dp[i][j]<0) dp[i][j]+=100000;\n }\n }\n cout << dp[N*N][S] << endl;\n\n }\n return 0;\n}\n\n\n", "#include<bits/stdc++.h> \nusing namespace std;\n\nint main(){\n int N, M, S;\n while(cin >> N >> M >> S, N){\n // dp[i][j]: 場所iで今の合計がjのときの組み合わせ数\n vector < vector< int > > dp( N * N + 1, vector< int >( S + 1, 0));\n dp[0][0] = 1;\n for(int i = 1; i <= M; i++){ // 選ぶ数字\n for(int j = N * N; j >= 1; j--){ // idx\n for(int k = i; k <= S; k++){ // 合計\n (dp[j][k] += dp[j - 1][k - i]) %= 100000;\n }\n }\n }\n cout << dp[N * N][S] << endl;\n }\n}", "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nint n, m, s;\nconst int MOD = 100000;\nint dp[2010][3010];\n\nint main() {\n while (scanf(\"%d %d %d\", &n, &m, &s), n|m|s) {\n MEMSET(dp, 0);\n FOREQ(i, 0, m) {\n dp[i][0] = 1;\n }\n REP(iter, n * n) {\n dp[m][s] = 0;\n for (int i = m; i >= 1; i--) {\n FOREQ(j, 0, s - i) {\n if (i > (s - j) / (n * n - iter)) {\n break;\n }\n dp[i][j + i] = dp[i - 1][j];\n }\n REP(j, i) { dp[i][j] = 0; }\n }\n FOREQ(i, 1, m) {\n FOREQ(j, 0, s) {\n if (i > (s - j + i) / (n * n - iter)) { break; }\n dp[i][j] += dp[i - 1][j];\n dp[i][j] %= MOD;\n }\n }\n if (iter == 0) {\n FOREQ(i, 0, m) {\n dp[i][0] = 0;\n }\n }\n }\n printf(\"%d\\n\", dp[m][s]);\n }\n}", "#include<bits/stdc++.h>\n#define LL long long\n#define rep(i,n) for(int i=0;i<n;++i)\n#define per(i,n) for(int i=n;i>0;i--)\n#define FOR(i,a,b) for(int i=a;i<=b;++i)\n#define ROF(i,a,b) for(int i=a;i>=b;i--);\n#define push_back PB;\n#define pop_back PPB;\nusing namespace std;\nstatic const LL INF = 1LL<<61LL;\nstatic const double EPS = 1e-8;\nstatic const int mod = 100000;\ntypedef pair<int,int> PII;\n\nLL dp[51][3001];\n\nint main(){\n while(1){\n LL N,M,S;\n cin>>N>>M>>S;\n if(N==0&&M==0&&S==0)break;\n N*=N;\n memset(dp,0,sizeof(dp));\n dp[0][0]=1;\n FOR(i,1,M){\n per(j,N){\n FOR(k,i,S){\n dp[j][k]+=(mod+dp[j-1][k-i])%mod;\n }\n }\n }\n cout<<dp[N][S]%mod<<endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int mod = 1e5;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint N, M, S;\n\twhile (cin >> N >> M >> S, N | M | S) {\n\t\tN *= N;\n\t\tvector<vector<int>> dp(S + 1, vector<int>(N + 1));\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 1; i <= M; i++) {\n\t\t\tauto tmp = dp;\n\t\t\tfor (int j = 0; j + i <= S; j++) {\n\t\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\t\t(dp[j + i][k + 1] += tmp[j][k]) %= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", dp[S][N]);\n\t}\n\treturn 0;\n}\n\n", "#include <vector>\n#include <iostream>\nusing namespace std;\nconst int mod = 100000;\nint N, M, S;\nint main() {\n\twhile (cin >> N >> M >> S, N) {\n\t\tN *= N;\n\t\tM -= N;\n\t\tS -= N * (N + 1) / 2;\n\t\tvector<vector<int> > dp(M + 1, vector<int>(S + 1, 0));\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 1; j <= M; j++) {\n\t\t\t\tfor (int k = S; k >= j; k--) {\n\t\t\t\t\tdp[j][k] = dp[j][k - j];\n\t\t\t\t\tif (j >= 1) {\n\t\t\t\t\t\tdp[j][k] += dp[j - 1][k - 1];\n\t\t\t\t\t\tif (dp[j][k] >= mod) dp[j][k] -= mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ret = 0;\n\t\tfor (int i = 0; i <= M; i++) {\n\t\t\tret += dp[i][S];\n\t\t\tif (ret >= mod) ret -= mod;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include <cstring>\n#include <queue>\n#include <vector>\n#include <functional>\n#include <map>\n#include <set>\n#include <cmath>\n#include <string>\n#define SIZE 200005\n#define INF 1000000005LL\n#define MOD 100000\n\nusing namespace std;\ntypedef long long int ll;\ntypedef pair <int,int> P;\n\nint dp[3005][50];\n\nint main()\n{\n\tint N,M,S;\n\twhile(1){\n\t\tscanf(\"%d%d%d\",&N,&M,&S);\n\t\tif(N==0 && M == 0)break;\n\t\tN = N*N;\n\t\tS -= N*(N+1)/2;\n\t\tM -= N;\n\t\tif(S < 0 || M < 0){\n\t\t\tputs(\"0\");\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int i=0;i<=S;i++){\n\t\t\tfor(int j=0;j<=N;j++){\n\t\t\t\tdp[i][j]=0;\n\t\t\t}\n\t\t}\n\t\tdp[0][0]=1;\n\t\tfor(int i=0;i<=S;i++){\n\t\t\tfor(int j=1;j<=N;j++){\n\t\t\t\tdp[i][j] = dp[i][j-1];\n\t\t\t\tif(i-j>=0)(dp[i][j] += dp[i-j][j])%=MOD;\n\t\t\t\tif(i-j-M >= 0)(dp[i][j] += MOD-dp[i-j-M][j-1])%=MOD;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp[S][N]);\n\t}\n\n\treturn 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint dp[2][2001][3001];\nconst int mod = 100000;\n\nint main(){\n int n,m,s;\n while(cin >> n >> m >> s){\n if(n==0)break;\n n = n*n;\n \n for(int i=0;i<=m;i++){\n for(int j=0;j<=s;j++)dp[0][i][j] = 0;\n }\n dp[0][0][0] = 1;\n \n for(int i=0;i<n;i++){\n int cur = i&1, nxt = 1-cur;\n for(int j=0;j<=m;j++){\n\tfor(int k=0;k<=s;k++)dp[nxt][j][k] = 0;\n }\n\n for(int j=0;j<=m;j++){\n\tfor(int k=0;k<=s;k++){\n\t if(dp[cur][j][k]==0)continue;\n\t if(j<m){\n\t (dp[cur][j+1][k] += dp[cur][j][k]) %= mod;\n\t if(k+j+1<=s)(dp[nxt][j+1][k+j+1] += dp[cur][j][k]) %= mod;\n\t }\n\t}\n }\n }\n \n for(int i=0;i<m;i++)(dp[n&1][i+1][s] += dp[n&1][i][s]) %= mod;\n cout << dp[n&1][m][s] << endl;\n }\n}", "#include <cmath>\n#include <algorithm>\n#include <cstring>\n#include <cstdio>\n\nusing namespace std;\n\nint dp[100][5000];\nint const mod=100000;\n\nint main(){\n int N,M,S;\n while(scanf(\"%d%d%d\",&N,&M,&S)!=EOF && N|M|S){\n memset(dp,0,sizeof(dp));\n dp[0][0]=1;\n for(int i=1; i<=M; ++i){\n for(int j=N*N; j>0; --j){\n for(int k=i; k<=S; ++k){\n dp[j][k]+=dp[j-1][k-i];\n dp[j][k]%=mod;\n }\n }\n }\n\n printf(\"%d\\n\",dp[N*N][S]%mod);\n }\n}", "#include <cstdio>\n#include <cstring>\nusing namespace std;\n\nint dp[50][3001];\nint main(){\n\tint n, m, s;\n\twhile(scanf(\"%d %d %d\", &n, &m, &s), n){\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\tfor(int i=1; i<=m; ++i){\n\t\t\tfor(int j=n*n; j>0; --j){\n\t\t\t\tfor(int l=i; l<=s; ++l){\n\t\t\t\t\tdp[j][l] = (dp[j][l] + dp[j-1][l-i]) % 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", dp[n*n][s]);\n/*\t\tfor(int i=0; i<n*n; i++){\n\t\t\tfor(int j=0; j<s; j++){\n\t\t\t\tprintf(\"%d\\t\", dp[i+1][j+1]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n*/\t}\n}", "#include<bits/stdc++.h>\n#define LL long long\n#define rep(i,n) for(int i=0;i<n;++i)\n#define per(i,n) for(int i=n;i>0;i--)\n#define FOR(i,a,b) for(int i=a;i<=b;++i)\n#define ROF(i,a,b) for(int i=a;i>=b;i--);\n#define push_back PB;\n#define pop_back PPB;\nusing namespace std;\nstatic const LL INF = 1LL<<61LL;\nstatic const double EPS = 1e-8;\nstatic const int mod = 100000;\ntypedef pair<int,int> PII;\n\nLL dp[51][3001];\n\nint main(){\n while(1){\n LL N,M,S;\n cin>>N>>M>>S;\n if(N==0&&M==0&&S==0)break;\n N*=N;\n memset(dp,0,sizeof(dp));\n dp[0][0]=1;\n FOR(i,1,M){\n per(j,N){\n FOR(k,i,S){\n dp[j][k]+=dp[j-1][k-i]%mod;\n }\n }\n }\n cout<<dp[N][S]%mod<<endl;\n }\n return 0;\n}", "#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n#define MOD 100000\nint dp[50][3001];\nint main(){\n\tint n,m,s;\n while(scanf(\"%d%d%d\",&n,&m,&s),(n|m|s)){\n \tfor(int i = 0; i < n*n+1; i++){\n \t\tfor(int j = 0; j < s+1; j++){\n \t\t\tdp[i][j] = 0;\n \t\t}\n \t}\n dp[0][0] = 1;\n \n for(int i = 1; i < m+1; i++){\n \tfor(int j = n*n;j > 0; j--){\n \tfor(int k = i; k < s+1; k++){\n \tdp[j][k] += dp[j-1][k-i];\n dp[j][k] %= MOD;\n \t}\n }\n }\n \tprintf(\"%d\\n\",dp[n*n][s]);\n }\n return 0;\n}", "#include<iostream>\n#include<vector>\nusing namespace std;\n\nconst int MOD = 100000;\n\nint main() {\n int N, M, S;\n while(cin >> N >> M >> S, N | M | S) {\n vector<vector<int>> dp(N * N + 1, vector<int>(S + 1, 0));\n dp[0][0] = 1;\n for(int i = 1; i <= M; ++i) for(int j = N * N; j >= 1; --j) for(int k = i; k <= S; ++k)\n dp[j][k] = (dp[j][k] + dp[j - 1][k - i]) % MOD;\n cout << dp[N * N][S] << endl;\n }\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <iostream>\ntypedef long long int ll;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nint dp[50][3001];\n\nvoid func(int N,int M,int S,int limit){\n\n\tfor(int i = 0; i <= 49; i++){\n\t\tfor(int k = 0; k <= 3000; k++)dp[i][k] = 0;\n\t}\n\n\tdp[0][0] = 1;\n\n\tfor(int number = 1; number <= M; number++){\n\t\tfor(int loc = limit; loc >= 1; loc--){\n\t\t\tfor(int sum = number; sum <= S; sum++){\n\t\t\t\tdp[loc][sum] = (dp[loc][sum] + dp[loc-1][sum-number])%100000;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",dp[limit][S]);\n\n}\n\nint main(){\n\n\tint N,M,S,limit;\n\n\twhile(true){\n\t\tscanf(\"%d %d %d\",&N,&M,&S);\n\t\tif(N == 0 && M == 0 && S == 0)break;\n\n\t\tlimit = N*N;\n\n\t\tfunc(N,M,S,limit);\n\t}\n\n\treturn 0;\n}", "def listrep(n,m,s):\n tab = [[0]*(s+1) for j in range(n+1)]\n tab[0][0] = 1\n for i in range(1,n+1):\n for k in range(s+1):\n if i <= k:\n tab[i][k] += tab[i][k-i] + tab[i-1][k-i]\n if k-1 >= m:\n tab[i][k] -= tab[i-1][k-1-m]\n tab[i][k] %= 100000\n return tab[n][s]\n\nwhile True:\n n,m,s = map(int,input().split())\n if n == 0 : break\n n *= n\n print(listrep(n,m,s))", "#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\n#define mod 100000\ntypedef pair<int, int> P;\nint n, m, s, ans;\nint dp[2][2001][3001];\nint main()\n{\n\twhile(cin >> n >> m >> s && n)\n\t{\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0][0] = 1;\n\t\tfor(int i = 0; i < n * n; ++i)\n\t\t{\n\t\t\tfor(int j = 0; j < m; ++j)\n\t\t\t\tfor(int k = j; k < s; ++k)\n\t\t\t\t\tdp[1][j + 1][k + 1] = (dp[1][j][k] + dp[0][j][k - j]) % mod;\n\t\t\tfor(int j = 0; j <= m; ++j)\n\t\t\t{\n\t\t\t\tfor(int k = 0; k <= s; ++k)\n\t\t\t\t{\n\t\t\t\t\tdp[0][j][k] = dp[1][j][k];\n\t\t\t\t\tdp[1][j][k] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans = 0;\n\t\tfor(int i = 0; i <= m; ++i)\n\t\t{\n\t\t\tans += dp[0][i][s];\n\t\t\tans %= mod;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\n#define mod 100000\ntypedef pair<int, int> P;\nint n, m, s, ans;\nint dp[2][2010][3010];\nint main()\n{\n\twhile(cin >> n >> m >> s && n)\n\t{\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0][0] = 1;\n\t\tfor(int i = 0; i < n * n; ++i)\n\t\t{\n\t\t\tfor(int j = 0; j < m; ++j)\n\t\t\t\tfor(int k = j; k < s; ++k)\n\t\t\t\t\tdp[1][j + 1][k + 1] = (dp[1][j][k] + dp[0][j][k - j]) % mod;\n\t\t\tfor(int j = 0; j <= m; ++j)\n\t\t\t{\n\t\t\t\tfor(int k = 0; k <= s; ++k)\n\t\t\t\t{\n\t\t\t\t\tdp[0][j][k] = dp[1][j][k];\n\t\t\t\t\tdp[1][j][k] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans = 0;\n\t\tfor(int i = 0; i <= m; ++i)\n\t\t{\n\t\t\tans += dp[0][i][s];\n\t\t\tans %= mod;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "DIV = 100000\nwhile 1:\n n, m, s = map(int, raw_input().split())\n if n == 0: break\n dp = [[0]*(s+1) for i in range(n*n+1)]\n dp[0][0] = 1\n for i in range(1, n*n+1):\n for j in range(s+1):\n if j - i >= 0: dp[i][j] = (dp[i][j] + dp[i-1][j-i] + dp[i][j-i]) % DIV\n if j - m - 1 >= 0: dp[i][j] = (dp[i][j] - dp[i-1][j-m-1] + DIV) % DIV\n print dp[n*n][s]", "#include <bits/stdc++.h>\nusing namespace std;\nconst int mod = 100000;\nint main()\n{\n int N, M, S;\n while(cin >> N >> M >> S, N || M || S) {\n int dp[55][3005] = {};\n dp[0][0] = 1;\n for(int p = 1; p <= M; p++) {\n for(int i = N * N; i >= 0; i--) {\n for(int j = S; j >= 0; j--) {\n if(j + p <= 3000) (dp[i + 1][j + p] += dp[i][j]) %= mod;\n }\n }\n }\n cout << dp[N * N][S] << endl;\n }\n return (0);\n}\n\n", "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tint n,m,s;\n\twhile(cin>>n>>m>>s,n){\n\t\tint N=n*n;\n\t\tint MOD=100000;\n\t\tvvi dp(N+1,vi(s+1));\n\t\tdp[0][0]=1;\n\t\tloop(x,1,m+1)for(int i=N-1;i>=0;i--)rep(j,s)if(j+x<=s){\n\t\t\t(dp[i+1][j+x]+=dp[i][j])%=MOD;\n\t\t}\n\t\tcout<<dp[N][s]<<endl;\n\t}\n}\n \n ", "\n#include <iostream>\nusing namespace std;\n \nint D = 100000;\nint dp[2][50][3001];\nint n, m, s;\n \nvoid set(){\n int x, y, z;\n for(x = 0; x < 2; x++){\n for(y = 0; y <= n*n; y++){\n for(z = 0; z <= s; z++){\n dp[x][y][z] = 0;\n }\n }\n }\n dp[0][0][0] = 1;\n for(y = 1; y <= m; y++){\n for(x = 0; x <= n*n; x++){\n for(z = 0; z <= s; z++){\n if(x && z >= y){\n dp[y%2][x][z]\n = (dp[(y-1)%2][x][z]+dp[(y-1)%2][x-1][z-y]);\n }else{\n dp[y%2][x][z] = dp[(y-1)%2][x][z];\n }\n dp[y%2][x][z] %= D;\n }\n }\n }\n}\n \nint main(){\n while( cin >> n >> m >> s, n|m|s ){\n set();\n cout << dp[m%2][n*n][s] << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\n#define FOR(i,a,b) for(int i = (a); i < (b); i++)\n#define REP(i,n) FOR(i,0,n)\n\nint dp[50][3001];\nint n, m, s;\nconst int mod = 100000;\n\nint main() {\n\twhile (cin >> n >> m >> s, n || m || s) {\n\t\tn *= n;\n\t\t\n\t\tfill(dp[0], dp[n + 1], 0);\n\t\t\n\t\tdp[0][0] = 1;\n\t\tFOR(i, 1, m + 1) for (int j = n - 1; j >= 0; j--) REP(k, s + 1) {\n\t\t\tif (k + i > s) break;\n\t\t\tdp[j + 1][k + i] += dp[j][k];\n\t\t\tdp[j + 1][k + i] %= mod;\n\t\t}\n\t\t\n\t\t\n\t\tcout << dp[n][s] << endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define REP(i,j) FOR(i,0,j)\n\nint main(){\n int N, M, S, dp[60][3010];\n while(std::cin >> N >> M >> S, N){\n REP(i, 60){\n REP(j, 3010){\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n \n for(int i=1;i<=M;i++){// 1つずつ入れてるdp\n for(int j=N*N;j>=1;j--){\n for(int s=i;s<=S;s++){\n dp[j][s] = (dp[j][s] + dp[j-1][s-i]) % 100000;\n }\n }\n }\n\n std::cout << dp[N*N][S] << std::endl;\n }\n}", "#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cctype>\n#include <cmath>\n#include <memory.h>\n#include <cassert>\n#include <iomanip>\n\nusing namespace std;\n\n\n#define all(c) ((c).begin()), ((c).end())\n#define debug(c) cerr << \"> \" << #c << \" = \" << (c) << endl;\n#define iter(c) __typeof((c).begin())\n#define present(c, e) ((c).find((e)) != (c).end())\n#define cpresent(c, e) (find(all(c), (e)) != (c).end())\n#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)\n\n#define mp make_pair\n#define fst first\n#define snd second\n#define pb push_back\n\n\nconst double EPS = 1e-10;\n\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int, int> pii;\ntypedef complex<double> P;\n\n#define MOD (100000)\n#define NOR(x) ((x) % MOD)\n\n\n\nint main() {\n\tfor (int N, M, S; cin >> N >> M >> S, (N | M | S) != 0; ) {\n\t\tint N2 = N * N;\n\t\tint dp[3010][55];\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\tREP(i, 1, M) {\n\t\t\tfor (int j = S; j >= i; j--) for (int k = N2; k >= 1; k--) {\n\t\t\t\tdp[j][k] = NOR(dp[j][k] + dp[j - i][k - 1]);\n\t\t\t}\n\t\t}\n\t\tcout << dp[S][N2] << endl;\n\t}\n\treturn 0;\n}", "#include<bits/stdc++.h>\n \nusing namespace std;\nconstexpr int mod = 100000;\nconstexpr int MAX_N = 50;\nconstexpr int MAX_S = 3010;\nconstexpr int MAX_M = 2010;\ntypedef long long LL;\nint main(){\nint N[5],M[5],S[5];\nint ret[5];\nLL dp[MAX_S][MAX_N];\nvector<int> query[MAX_M];\nint q=0;\nfor(q=0;;q++){\nscanf(\"%d%d%d\",N+q,M+q,S+q);if(N[q]+M[q]+S[q]==0)break;\nquery[M[q]].push_back(q);\n}\nfor(int i=0;i<MAX_S;i++)for(int j=0;j<MAX_N;j++)dp[i][j]=0;\ndp[0][0]=1;\nfor(int i=1;i<MAX_M;i++){\nfor(int j=MAX_S-1;j>=i;j--)for(int k=1;k<MAX_N;k++){\n dp[j][k]+=dp[j-i][k-1];\n if(dp[j][k]>=mod)dp[j][k]-=mod;\n}\nfor(auto &id:query[i])ret[id] = (int)dp[S[id]][N[id]*N[id]];\n}\nfor(int i=0;i<q;i++)printf(\"%d\\n\",ret[i]);\nreturn 0;\n}\n", "// aoj - - 0537 / 2016-03-04\n#include<iostream>\n#include<vector>\n#include<cassert>\n#include<string>\n#include<algorithm>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<tuple>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll,ll> pll;\ntypedef ll int__;\n#define rep(i,j) for(int__ i=0;i<(int__)(j);i++)\n#define repeat(i,j,k) for(int__ i=(j);i<(int__)(k);i++)\n#define all(v) v.begin(),v.end()\n\ntemplate<typename T>ostream& operator << (ostream &os , const vector<T> &v){\n rep(i,v.size()) os << v[i] << (i!=v.size()-1 ? \" \" : \"\\n\"); return os;\n}\ntemplate<typename T>istream& operator >> (istream &is , vector<T> &v){\n rep(i,v.size()) is >> v[i]; return is;\n}\n\n#ifdef DEBUG\nvoid debug(){ cerr << endl; }\n#endif\ntemplate<class F,class...R> void debug(const F &car,const R&... cdr){\n#ifdef DEBUG\n cerr << car << \" \"; debug(cdr...);\n#endif\n}\n\nconst int MOD = 100000;\n\nbool solve(){\n int N, M, S; cin >> N >> M >> S;\n if(N == 0) return false;\n vector<vector<int>> dp(N*N+1, vector<int>(S+1));\n // dp[i][j] := i???????????§?????????j????????????????????°\n dp[0][0] = 1;\n repeat(i, 1, M+1){\n for(int j = N*N-1; j >= 0; j--){\n rep(k, S+1-i){\n dp[j+1][k+i] += dp[j][k];\n dp[j+1][k+i] %= MOD;\n }\n }\n }\n cout << dp[N*N][S] << endl;\n \n return true;\n}\n\nint main()\n{\n ios::sync_with_stdio(false);\n while(solve());\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nint dp[2][59][3010];\nint main(){\n\tint N,M,S,n2,ii,io;\n\twhile(1){\n\t\tcin>>N>>M>>S;\n\t\tif(N==0&&M==0&&S==0)break;\n\t\tn2=N*N;\n\t\tfor(int j=0;j<=n2;j++){\n\t\t\tfor(int k=0;k<=S;k++){\n\t\t\t\tdp[0][j][k]=0;\n\t\t\t}\n\t\t}\n\t\tdp[0][0][0]=1;\n\t\tfor(int i=1;i<=M;i++){\n\t\t\t//for(int k=0;k<=n2;k++){//\n\t\t\t//\tfor(int j=0;j<=S;j++){//\n\t\t\t//\t\tcout<<dp[i-1][k][j]<<\" \";//\n\t\t\t//\t}//\n\t\t\t//\tcout<<endl;//\n\t\t\t//}//\n\t\t\t//cout<<endl;//\n\t\t\tif(i%2){\n\t\t\t\tii=0;\n\t\t\t\tio=1;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tii=1;\n\t\t\t\tio=0;\n\t\t\t}\n\n\t\t\tfor(int j=0;j<=n2;j++){\n\t\t\t\tfor(int k=0;k<=S;k++){\n\t\t\t\t\tdp[io][j][k]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=0;j<=n2;j++){\n\t\t\t\tfor(int k=0;k<=S;k++){\n\t\t\t\t\tif(dp[ii][j][k]!=0){\n\t\t\t\t\t\tif(k<=S-i&&j!=n2){\n\t\t\t\t\t\t\tdp[io][j+1][k+i]+=dp[ii][j][k];\n\t\t\t\t\t\t\tdp[io][j+1][k+i]%=100000;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[io][j][k]+=dp[ii][j][k];\n\t\t\t\t\t\tdp[io][j][k]%=100000;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//for(int i=0;i<=n2;i++){//\n\t\t//\tfor(int j=0;j<=S;j++){//\n\t\t//\t\tcout<<dp[M][i][j]<<\" \";//\n\t\t//\t}//\n\t\t//\tcout<<endl;//\n\t\t//}//\n\n\t\tcout<<dp[M%2][n2][S]<<endl;\n\t}\n\treturn 0;\n\n}", "#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<int,P> P1;\ntypedef pair<P,P> P2;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define eps 1e-7\nlong long dp[3001][50];\nint n,m,s;\nint main(){\n\twhile(1){\n\t\tmemset(dp,0,sizeof(dp));\n\t\tscanf(\"%d %d %d\",&n,&m,&s);\n\t\tif(!n) break;\n\t\tdp[0][0]=1;\n\tfor (int i=1;i<=m;i++){\n\t\tfor (int j=n*n;j>=0;j--){\n\t\t\tfor (int k=i;k<=s;k++){\n\t\t\t\t\tdp[k][j]+=dp[k-i][j-1];\n\t\t\t\t\tdp[k][j]%=100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp[s][n*n]);\n\t}\n}", "#include<cstdio>\n\nusing namespace std;\n\nconst int M=100000;\n\nint main(){\n\tfor(int n,m,sum;scanf(\"%d%d%d\",&n,&m,&sum),n;){\n\t\tn*=n;\n\t\tint dp[50][3001]={};\tdp[0][0]=1;\n\t\tfor(int d=1;d<=m;d++){\n\t\t\tfor(int i=n;i>0;i--)for(int s=d;s<=sum;s++){\n\t\t\t\tdp[i][s]+=dp[i-1][s-d];\n\t\t\t\tif(dp[i][s]>=M)\tdp[i][s]-=M;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp[n][sum]);\n\t}\n\n\treturn 0;\n}", "#include <cstdio>\n#include <cstring>\n#define mod 100000\nint n, m, s;\nint dp[3001][50];\nint main() {\n while (scanf(\"%d%d%d\",&n,&m,&s)) {\n if (!n&&!m&&!s) break;\n memset(dp,0,sizeof(dp));\n dp[0][0]=1;\n for (int i=1; i<=m; i++) {\n for (int j=n*n; j>0; j--) {\n for (int k=s; k>=i; k--) {\n dp[k][j]=(dp[k][j]+dp[k-i][j-1])%mod;\n }\n }\n }\n printf(\"%d\\n\",dp[s][n*n]);\n }\n}", "#include<iostream>\n\nusing namespace std;\n\nint N, M, S;\nint dp[50][3001];//dp[i][j][k] i????????°??§ j??????????????????????????°\nconst int MOD = 100000;\n\nint main() {\n\twhile (cin >> N >> M >> S, N * M) {\n\t\tdp[0][0] = 1;\n\t\tfor (int m = 1; m <= M ; m++) {\n\t\t\tfor (int n = N * N; n > 0; n--) {\n\t\t\t\tfor (int s = m; s <= S; s++) {\n\t\t\t\t\tdp[n][s] += dp[n - 1][s - m];\n\t\t\t\t\tdp[n][s] %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[N * N][S] % MOD << endl;\n\t\tfor (int i = 0; i <= N * N; i++)for (int j = 1; j <= S; j++)dp[i][j] = 0;\n\t}\n\treturn 0;\n}\n\n//I have a little question about this problem.", "#include <iostream>\n#include <vector>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <algorithm>\t// require sort next_permutation count __gcd reverse etc.\n#include <cstdlib>\t// require abs exit\n#include <cstdio>\t// require scanf printf\n#include <functional>\n#include <numeric>\t// require accumulate\n#include <cmath>\n#include <climits>\n#include <limits>\n#include <cfloat>\n#include <iomanip>\t// require setw\n#include <sstream>\t// require stringstream \n#include <cstring>\t// require memset\n#include <cctype>\t// require tolower, toupper\n#include <fstream>\t// require freopen\n#include <ctime>\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define ALL(A) A.begin(), A.end()\n#define DEBUG 0\n\nusing namespace std;\nconst int mod = 100000;\n\nint dp[55][3005];\n \nint main(void)\n{\n//\tfreopen (\"testcase.bingo\", \"r\", stdin );\n\tint n, m, s;\t// n: ˆê•Ó‚Ì’·‚³ m: Žg‚¦‚鐔Žš‚̏ãŒÀ s: ”’l‚̘a\n\n\twhile (cin >> n >> m >> s && n && m && s ){ \n\t\tmemset (dp, 0, sizeof (dp ) );\n\t\tdp[0][0] = 1;\n\t\tm = min (m, s );\n\t\trep (i, m ){\n//\t\t\tfor (int i = 1; i <= n*n; i++ ){\n\t\t\tfor (int j = n*n; j > 0; j-- ){\n\t\t\t\tfor (int k = s; k >= n*n - j + 1; k-- ){\n\t\t\t\t\tdp[j][k] = dp[j-1][k - (n*n-j+1)]+dp[j][k - (n*n-j+1)];\n\t\t\t\t\tif (dp[j][k] >= mod ) dp[j][k] -= mod;\n\t\t\t\t} // end for\n\t\t\t} // end for\n\t\t} // end rep\n\t\tcout << dp[n*n][s] << endl;\n//\t\tcout << (dp[n*n][s] - dp[n*n-1][s] + mod) % mod << endl;\n//\t\tcout << dp[n*n][s] << endl;\n#if DEBUG\n\t\trep (i, n*n+1 ){\n\t\t\trep (j, s+1 ){\n\t\t\t\tcout << setw(3) << dp[i][j];\n\t\t\t} // end rep\n\t\t\tcout << endl;\n\t\t} // end rep\n#endif\n\t} // end while\n \n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\n#define watch(a) { cout << #a << \" = \" << a << endl; }\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nint dp[55][3030];\n\nint main() {\n\n int const MOD = 100000;\n\n for(int N, M, S; cin >> N >> M >> S && (N|M|S);) {\n rep(i, 55) rep(j, 3030)\n dp[i][j] = 0;\n\n dp[0][0] = 1;\n\n REP(add, 1, M + 1) {\n for(int currIndex = N * N; currIndex >= 1; currIndex--) {\n for(int currSum = add; currSum <= S; currSum++) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n\n cout << dp[N*N][S] << endl;\n }\n \n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <string>\n#include <map>\n\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rrep(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define all(co) co.begin(), co.end()\nconst int INF = 1 << 29;\n\nint dp[51][3001];\nsigned main()\n{\n\tint n, m, s;\n\twhile (cin >> n >> m >> s && n)\n\t{\n\t\tn = n * n;\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tconst int MOD = 100000;\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 1; i <= m; i++)\n\t\t{\n\t\t\tfor (int j = n; j > 0; j--)\n\t\t\t{\n\t\t\t\tfor (int k = i; k <= s; k++)\n\t\t\t\t{\n\t\t\t\t\tdp[j][k] += dp[j - 1][k - i];\n\t\t\t\t\tdp[j][k] %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n][s] << endl;\n\t}\n\treturn 0;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define int long long\n#define PB push_back\n#define PPB pop_back\ntypedef pair<int, int> pii;\ntypedef pair<double, double> pdd;\n\nstatic const int INF = 1LL << 61;\nstatic const int MOD = 100000;\n\nint dp[55][3005];\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int n, m, s;\n while (cin >> n >> m >> s, n) {\n fill(dp[0], dp[55], 0);\n dp[0][0] = 1;\n\n for (int i = 1; i <= m; ++i) {\n for (int j = n * n; 0 < j; --j) {\n for (int k = i; k <= s; ++k) {\n dp[j][k] += dp[j - 1][k - i];\n dp[j][k] %= MOD;\n }\n }\n }\n\n cout << dp[n * n][s] << endl;\n }\n}", "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<math.h>\n#include<queue>\n#include<set>\n#include<map>\n#include<random>\n#include<functional>\n#include<utility>\n\ntypedef long long ll;\n\n#define rep(i,n) for(int i=0; i<n; i++)\n#define pb push_back\n#define P pair<int, int>\n#define PLI pair<ll, int>\n\nusing namespace std;\n\n\nconst int MOD = 100000;\n\nint N, M, S;\nint dp[50][3005];\nint main() {\n\twhile (cin >> N >> M >> S, N) {\n\t\tfor (int n = 0; n <= N*N; n++) {\n\t\t\tfor (int s = 0; s <= S; s++) {\n\t\t\t\tdp[n][s] = 0;\n\t\t\t}\n\t\t}\n\n\t\tdp[0][0] = 1;\n\t\tfor (int m = 1; m <= M; m++) {\n\t\t\tfor (int n = N*N; n >= 1; n--) {\n\t\t\t\tfor (int s = m; s <= S; s++) {\n\t\t\t\t\tdp[n][s] += dp[n - 1][s - m] % MOD;\n\t\t\t\t\tdp[n][s] %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << dp[N*N][S] << endl;\n\n\t}\n\n\treturn 0;\n}\n\n", "#include<cstdio>\n#include<iostream>\nusing namespace std;\n\nint num[60][3010];\n\nint main(){\n int n,m,s;\n\n while(scanf(\"%d %d %d\",&n,&m,&s) && (n||m||s)){\n n = n*n;\n\n for(int i=0;i<=n;i++)\n for(int j=0;j<=s;j++)num[i][j] = 0;\n num[0][0] = 1;\n\n\n for(int i=1;i<=m;i++){\n for(int j=n-1;j>=0;j--){\n\tfor(int k=s;k>=0;k--){\n\t if(num[j][k]>0){\n\t if(k+i<=s){\n\t num[j+1][k+i] += num[j][k];\n\t num[j+1][k+i] %= 100000;\n\t }\n\t }\n\t}\n }\n }\n\n printf(\"%d\\n\",num[n][s]);\n }\n}\n ", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\n#define watch(a) { cout << #a << \" = \" << a << endl; }\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nint dp[55][3030];\n\nint main() {\n\n for(int N, M, S; cin >> N >> M >> S && (N|M|S);) {\n rep(i, 55) rep(j, 3030)\n dp[i][j] = 0;\n\n dp[0][0] = 1;\n \n REP(add, 1, M + 1) {\n for(int index = N*N; index>=1; index--) {\n for(int curr=0; curr<=S-add; curr++) {\n (dp[index][curr + add] += dp[index - 1][curr]) %= 100000;\n }\n }\n }\n\n cout << dp[N*N][S] << endl;\n }\n \n return 0;\n}", "#define _USE_MATH_DEFINES\n#include <iostream>\n#include <memory>\n#include <memory.h>\n#include <fstream>\n#include <cmath>\n#include <math.h>\n#include <numeric>\n#include <vector>\n#include <stack>\n#include <string>\n#include <queue>\n#include <sstream>\n#include <cstdlib>\n#include <cassert>\n#include <cstdio>\n#include <map>\n#include <iomanip>\n#include <list>\n#include <cctype>\n#include <algorithm>\n#include <complex>\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n#define rep2(i, m, n) for(int i = m; i < n; i++)\nusing namespace std;\n\ntypedef complex<double> xy_t;\ntypedef pair<xy_t, xy_t> line;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<double, double> Pd;\ntypedef pair<int, P> PP;\ntypedef pair<int, PP> PPP;\nconst int INF = 1 << 29;\nconst double EPS = 1E-10;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n#define rep2(i, m, n) for(int i = m; i < n; i++)\n\nint dp[51][4000];\nconst int mod = 100000;\n\nint main(){\n\tint N, M, S;\n\twhile(cin >> N >> M >> S && (N || M || S)){\n\t\tN = N * N;\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[N][0] = 1;\n\t\tfor(int i = 1; i <= M; i++){\n\t\t\tfor(int j = 0; j <= N; j++){\n\t\t\t\tfor(int s = S; s >= 0; s--){\n\t\t\t\t\tint c = dp[j][s];\n\t\t\t\t\tif(s - i >= 0) c += dp[j+1][s-i];\n\t\t\t\t\tdp[j][s] = c % mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[0][S] << endl;\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <stack>\n#include <cstring>\n#include <algorithm>\n\nusing namespace std;\n\n#define reep(i,f,t) for(int i=f ; i<int(t) ; ++i)\n#define rep(i,n) reep(i, 0, n) \n\nconst int WIDTH = 3001;\nconst int HEIGHT = 51;\n\nint main()\n{\n\tint* dp = new int[HEIGHT * WIDTH];\n\t\n\tint n, m, s;\n\twhile(scanf(\"%d%d%d\", &n, &m, &s), n){\n\t\tn *= n;\n\t\tfill_n(dp, HEIGHT*WIDTH, 0);\n\t\tdp[0] = 1;\n\n\t\treep(i, 1, m+1){\n\t\t\tfor(int j=n; j>=0; --j){\n\t\t\t\tfor(int k=s; k>=0; --k){\n\t\t\t\t\tif(j && i <= k){\n\t\t\t\t\t\tdp[j*WIDTH + k] = (dp[j*WIDTH + k] + dp[(j-1)*WIDTH + k-i]) % 100000;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//\trep(i, n+1){\n\t\t//\t\trep(j, s+1)\n\t\t//\t\t\tprintf(\"%d\\t\", dp[i][j]);\n\t\t//\t\tputs(\"\");\n\t\t//\t}\n\n\t\tprintf(\"%d\\n\", dp[n*WIDTH + s]);\n\t}\n\n\tdelete dp;\n\n\treturn 0;\n}", "#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint main(){\n\tint n,m,s;\n\tint dp[50][3001];\n\twhile(1){\n\t\tcin >> n >> m >> s;\n\t\tif(n == 0 && m == 0 && s == 0) break;\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tfor(int j=n*n;j>0;j--){\n\t\t\t\tfor(int l=i;l<=s;l++){\n\t\t\t\t\tdp[j][l] = (dp[j][l] + dp[j-1][l-i])%100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n*n][s] << endl;\n\t}\n}", "#include <cstdio>\n#include <algorithm>\n\n#pragma warning(disable: 4996)\n\n#define MOD 100000\n\n#define MAX_M 2000\n#define MAX_S 3000\n\nint N, M, S;\n\nint dp[2][MAX_M + 1][MAX_S + 1];\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tscanf(\"%d\", &N);\n\t\tscanf(\"%d\", &M);\n\t\tscanf(\"%d\", &S);\n\n\t\tif (N == 0 && M == 0 && S == 0) { break; }\n\n\t\tfor (int i = 0; i < M; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < S; j++)\n\t\t\t{\n\t\t\t\tif (i == j && i != 0 && j != 0)\n\t\t\t\t{\n\t\t\t\t\tdp[1][i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tdp[1][i][j] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint A = N * N;\n\n\t\tfor (int n = 2; n <= A; n++)\n\t\t{\n\t\t\tfor (int i = 0; i < M; i++)\n\t\t\t{\n\t\t\t\tdp[n % 2][i][0] = 0;\n\t\t\t}\n\n\t\t\tfor (int j = 0; j < S; j++)\n\t\t\t{\n\t\t\t\tdp[n % 2][0][j] = 0;\n\t\t\t}\n\n\t\t\tfor (int i = 1; i <= M; i++)\n\t\t\t{\n\t\t\t\tfor (int j = 1; j <= S; j++)\n\t\t\t\t{\n\t\t\t\t\tif (n % 2 == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tdp[0][i][j] = (dp[0][i - 1][j - 1] + (j >= i ? dp[1][i - 1][j - i] : 0)) % MOD;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tdp[1][i][j] = (dp[1][i - 1][j - 1] + (j >= i ? dp[0][i - 1][j - i] : 0)) % MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint sum = 0;\n\n\t\tfor (int i = 1; i <= M; i++)\n\t\t{\n\t\t\tif (A % 2 == 0)\n\t\t\t{\n\t\t\t\tsum += dp[0][i][S];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsum += dp[1][i][S];\n\t\t\t}\n\n\t\t\tsum %= MOD;\n\t\t}\n\n\t\tprintf(\"%d\\n\", sum);\n\t}\n\n\treturn 0;\n}", "#include<cstdio>\nusing namespace std;\n\nint n, m, s, dp[50][3001];\n\nint main() {\n while (scanf(\"%d%d%d\", &n, &m, &s), n) {\n for (int i = 0; i <= n*n; i++) for (int j = 0; j <= s; j++) dp[i][j] = 0;\n dp[0][0] = 1;\n for (int k = 1; k <= m; k++) {\n for (int i = n*n-1; i >= 0; i--) {\n for (int j = k; j <= s; j++) dp[i+1][j] = (dp[i+1][j] + dp[i][j-k]) % 100000;\n }\n }\n printf(\"%d\\n\", dp[n*n][s]);\n }\n}\n\n", "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<cstdlib>\n#include<cstring>\n\n#define mod 100000\n\nusing namespace std;\n\nint dp[50][3001];\n\nint main(){\n\tint n,m,s;\n\twhile(scanf(\"%d %d %d\",&n,&m,&s)){\n\t\tif(n==0&&m==0&&s==0)\n\t\tbreak;\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0]=1;\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tfor(int j=n*n;j>0;j--){\n\t\t\t\tfor(int k=i;k<=s;k++){\n\t\t\t\t\tdp[j][k]=(dp[j][k]+dp[j-1][k-i])%mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp[n*n][s]);\n\t}\n}", "#include<iostream>\n#include<cstdio>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define MOD 100000\n\nusing namespace std;\n\nint N,M,S;\nint dp[50][3001];\n\nint main()\n{\n while(scanf(\"%d %d %d\",&N,&M,&S),N|M|S)\n {\n\n rep(i,N*N+1)rep(j,S+1)dp[i][j] = 0;\n dp[0][0] = 1;\n\n for(int v=1;v<=M;v++)\n\t{\n\t for(int cnt=N*N-1;cnt>=0;cnt--)\n\t {\n\t for(int def=0;def<=S;def++)\n\t\t{\n\t\t if(dp[cnt][def] == 0)continue;\n\t\t if(def+v <= S)\n\t\t {\n\t\t dp[cnt+1][def+v] = (dp[cnt+1][def+v] + dp[cnt][def]) % MOD;\n\t\t }\n\t\t}\n\t }\n\t}\n printf(\"%d\\n\",dp[N*N][S]);\n }\n return 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\n\ntemplate <class T>\nint __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }\n#endif\n\n#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define popcount __builtin_popcount\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntemplate <class T> void max_swap(T& a, const T b) { a = max(a, b); }\ntemplate <class T> void min_swap(T& a, const T b) { a = min(a, b); }\n\nconst double EPS = 1e-10;\ntypedef long long ll;\ntypedef pair<int, int> pint;\n\n\nint main()\n{\n\tint n, m, s;\n\twhile (scanf(\"%d%d%d\", &n, &m, &s), n | m | s)\n\t{\n\t\tint nn = n * n;\n\n\t\t// dp[iˆÈ‰º‚ðŽg‚Á‚½][j(a_j‚Ü‚Å)][s] = sum|k=[1..i-1](dp[k][j-1][s-k])\n\t\tstatic int dp[50][3001];\n\t\tconst int mod = 100000;\n\n\t\trep (i, nn + 1)\n\t\t\trep (j, s + 1)\n\t\t\t\tdp[i][j] = 0;\n\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 1; i <= m; ++i)\n\t\t\tfor (int j = nn; j > 0; --j)\n\t\t\t\tfor (int k = i; k <= s; ++k)\n\t\t\t\t\t(dp[j][k] += dp[j - 1][k - i]) %= mod;\n\n\t\tprintf(\"%d\\n\", dp[nn][s]);\n\t}\n}", "#include<bits/stdc++.h>\n\n#define int long long int\n#define rep(a,b,c) for(int a=b;a<c;a++)\n#define repm(a,b,c) for(int a=(b-1);a>=c;a--)\n#define pb push_back\n#define str string\n#define sf(a) scanfs(\"%d\",&a)\n#define pb push_back\n#define mp make_pair\n#define Fi first\n#define Se second\n#define ALL(v) (v).begin(), (v).end()\n\nusing namespace std;\n\nconst int INF = 1e18 + 9;\nconst int Mod = 1e9 + 7;\ninline int replac(str s){double ans=0;rep(i,0,s.length()){ans+=(s[i]-'0')*pow(10,s.length()-i-1);}return (int)ans;}\ninline string numstr(int m){str s=\"\";while(m>0){char c;int a=m/10;if(a>0)a=m%(a*10);else a=m;c=(char)('0'+a);s+=c;m/=10;}str st=\"\";for(int i=s.size()-1;i>=0;i--){st+=s[i];}return st;}\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vii;\nint dp[50][3003];\n///?£????????£???????????§???????????????????£??????§???????????£???(???????°????????????¨???????¶?...)(?????????????????§???.)\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n,m,s;\n int mod=100000;\n while(1){\n cin >> n >> m >> s;\n if(n==0&&m==0&&s==0)break;\n rep(i,0,50){\n rep(j,0,3003){\n dp[i][j]=0;\n }\n }\n dp[0][0]=1;\n rep(i,1,m+1){\n for(int j=n*n;j>0;j--){\n rep(k,i,s+1){\n (dp[j][k]+=dp[j-1][k-i])%=mod;\n }\n }\n }\n cout << dp[n*n][s]%mod << endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(true){\n\t\tint n,m,s;\n\t\tcin >> n >> m >> s;\n\t\tif(n == 0) break;\n\t\tint ans = 0;\n\t\tint dp[2][50][3005];\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0][0] = 1;\n\t\tfor (int i = 1;i <= m ;i++){\n\t\t\tfor (int j = 0;j <= n*n;j++){\n\t\t\t\tfor (int k = 0;k <= s;k++){\n\t\t\t\t\tif(k-i>= 0) dp[i%2][j][k] = dp[(i-1)%2][j][k] + dp[(i-1)%2][j-1][k-i];\n\t\t\t\t\telse dp[i%2][j][k] = dp[(i-1)%2][j][k];\n\t\t\t\t\tdp[i%2][j][k] %= 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[m%2][n*n][s] << endl;\n\t}\n\n\treturn 0;\n\n}\n", "#include<iostream>\n#include<algorithm>\nusing namespace std;\n#define reps(i,b,n) for(int i = b ; i < n ; ++i )\n#define rep(i,n) reps(i,0,n)\n#define INF (1 << 30)\n#define MOD 100000\nint dp[51][3001],N,M,S;\nint main(){\n while(cin >> N >> M >> S , N){\n fill_n(dp[0],51*3001,0);\n dp[0][0] = 1;\n for(int i = 1 ; i <= M ; i++ ){\n for(int j = N * N ; j > 0 ; j-- ){\n for(int k = i ; k <= S ; k++ ){\n dp[j][k] = (dp[j][k] + dp[j-1][k-i]) % MOD;\n }\n }\n }\n cout << dp[N*N][S] << endl;\n }\n}", "#include <iostream>\n#include <stack>\n#include <map>\n#include <algorithm>\n#include <sstream>\n#include <queue>\n#include <string>\n#include <cstring>\n#include <cmath>\nusing namespace std;\n#define F first\n#define S second\nconst int INF=100000000;\n\nint dp[50][3001];\nconst int mod=100000;\n\nint main(){\n\tint n,m,s;\n\twhile(cin >> n >> m >> s){\n\t\tif(n==0&&m==0&&s==0) break;\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0]=1;\n\t\tfor(int i=1; i<=m; ++i){\n\t\t\tfor(int j=n*n; j>0; --j){\n\t\t\t\tfor(int k=i; k<=s; ++k){\n\t\t\t\t\tdp[j][k]+=dp[j-1][k-i]%mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n*n][s]%mod << endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <queue>\n#include <map>\n#include <stack>\n#include <cstring>\n \n#define FOR(i, a, b) for(int i = (a); i < (b); i++)\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define MP make_pair\n#define X first\n#define Y second\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int, int> P;\n\nconst int INF = 1<<29;\nconst int MOD = 100000;\n\nll dp[50][3001];\n\nint main(){\n\tint n, m, s;\n\twhile(cin >> n >> m >> s, n|m|s){\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\tfor(int i = 1; i <= m; i++){\n\t\t\tfor(int j = n*n; j >= 1; j--){\n\t\t\t\tfor(int k = i; k <= s; k++){\n\t\t\t\t\tdp[j][k] += dp[j-1][k-i];\n\t\t\t\t\tdp[j][k] %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n*n][s] << endl;\n\t}\n\n return 0;\n}", "#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint main(){\n int N,M,S;\n while(cin>>N>>M>>S,N){\n vector<vector<int> > dp(N*N+1,vector<int>(S+1));\n dp[0][0]=1;\n for(int i=0;i<M;i++){\n for(int j=N*N-1;j>=0;j--){\n\tfor(int k=0;k<S-i;k++){\n\t dp[j+1][k+(i+1)]+=dp[j][k];\n\t dp[j+1][k+(i+1)]%=100000;\n\t}\n }\n }\n cout<<dp[N*N][S]<<endl;\n }\n}", "#include <iostream>\n#include <cstring>\n\nusing namespace std;\n\nconst int MAX_N = 7;\nconst int MAX_S = 3000;\n\nint dp[MAX_N * MAX_N + 1][MAX_S + 1];\n\nint main()\n{\n\tint N, M, S;\n\t\n\twhile (cin >> N >> M >> S, N) {\n\t\tmemset(dp, 0, sizeof dp);\n\n\t\tN *= N;\n\n\t\tdp[0][0] = 1;\n\n\t\tfor (int i = 1; i <= M; ++i) {\n\t\t\tfor (int j = N; j >= 1; --j) {\n\t\t\t\tfor (int k = S; k >= i; --k) {\n\t\t\t\t\tdp[j][k] += dp[j - 1][k - i];\n\t\t\t\t\tdp[j][k] %= 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << dp[N][S] << endl;\n\t}\n}", "#include <iostream>\n#include <string>\n#include <queue>\n#include <vector>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <utility>\n#include <iomanip>\n\n#define ll long long int\n#define pb push_back\n#define mk make_pair\n#define pq priority_queue\n\nusing namespace std;\ntypedef pair<int, int> P;\ntypedef pair<ll, int> Pl;\nconst int inf = 1e9;\nconst ll linf = 1LL << 50;\nint n, m, s;\nconst int mod = 1e5;\nll dp[2][2001][3001];\n\nint main(int argc, char const* argv[])\n{\n\twhile(true){\n\t\t\tscanf(\"%d %d %d\", &n, &m, &s);\n\t\t\tif(n == 0)break;\n\t\t\tint target = s - n * n * (n * n + 1) / 2;\n\t\t\tint sup = m - n * n;\n\t\t\tfor(int i = 0; i < 2; i++){\n\t\t\t\t\tfor(int j = 0; j <= sup; j++){\n\t\t\t\t\t\t\tfor(int k = 0; k <= target; k++){\n\t\t\t\t\t\t\t\t\tif(j == 0 && k == 0)dp[i][j][k] = 1;\n\t\t\t\t\t\t\t\t\telse dp[i][j][k] = 0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t}\n\t\t\tdp[0][0][0] = 1;\n\t\t\tfor(int i = 0; i < n * n; i++){\n\t\t\t\t\tfor(int j = 1; j <= sup; j++){\n\t\t\t\t\t\t\tfor(int k = 1; k <= target; k++){\n\t\t\t\t\t\t\t\t\tdp[(i+1) & 1][j][k] = dp[i & 1][j][k];\n\t\t\t\t\t\t\t\t\tif(k - (n * n - i) >= 0)dp[(i+1) & 1][j][k] += dp[(i+1) & 1][j-1][k-(n * n - i)];\n\t\t\t\t\t\t\t\t\tdp[(i+1) & 1][j][k] %= mod;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tfor(int i = 0; i <= sup; i++)res = (res + dp[(n*n) & 1][i][target]) % mod;\n\t\t\tcout << res << endl;\n\t}\n\treturn 0;\n}\n\n", "#include <iostream>\n#include <algorithm>\n#include <cstring>\n\nusing namespace std;\n\nint main ()\n{\n int n, m, s, dp[50][3001];\n while (1)\n {\n cin>>n>>m>>s;\n if (!n) break;\n n*=n;\n m=min(m, s);\n memset(dp, 0, sizeof(dp));\n dp[0][0]=1;\n for (int i=1; i<=n; i++)\n {\n for (int j=1; j<=s; j++)\n {\n if (j>=i) dp[i][j]=dp[i-1][j-i]+dp[i][j-i];\n if (j>m) dp[i][j]-=dp[i-1][j-m-1];\n dp[i][j]%=100000;\n if (dp[i][j]<0) dp[i][j]+=100000;\n }\n }\n cout<<dp[n][s]<<'\\n';\n }\n return 0;\n}\n\n", "#include <vector>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <queue>\n#include <stack>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef double db;\nconst ll mod=100000;\nll dp[50][3001];\nll N,M,S;\nint main()\n{while(1){\n\tscanf(\"%lld%lld%lld\",&N,&M,&S);\n\tif(!N) return 0;\n\tN*=N;\n\tmemset(dp,0,sizeof(dp));\n\tdp[0][0]=1;\n\tfor(ll i=1;i<=M;i++){\n\t\tfor(ll j=N;j>=1;j--){\n\t\t\tfor(ll k=i;k<=S;k++){\n\t\t\t\tdp[j][k]=(dp[j][k]+dp[j-1][k-i])%mod;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",dp[N][S]);\n}}", "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\nint DP[2][2002][3001];\n\nint main(){\n\t\n\t\n\tint n, m, s;\n\twhile(true){\n\t\tcin >> n >> m >> s;\n\t\tif(n == 0){\n\t\t\tbreak;\n\t\t}\n\t\tn *= n;\n\t\t\n\t\tfor(int i = 0; i <= m; i++){\n\t\t\tfor(int j = 0; j <= s; j++){\n\t\t\t\tDP[0][i][j] = 0;\n\t\t\t\tDP[1][i][j] = 0;\n\t\t\t}\n\t\t\tDP[1][i][i] = 1;\n\t\t}\n\t\tDP[1][0][0] = 0;\n\t\t\n\t\tfor(int i = 2; i <= n; i++){\n\t\t\tfor(int j = 1; j <= m; j++){\n\t\t\t\tfor(int k = j; k <= s; k++){\n\t\t\t\t\tDP[i % 2][j][k] = DP[i % 2][j - 1][k - 1] + DP[(i + 1) % 2][j - 1][k - j];\n\t\t\t\t\tDP[i % 2][j][k] %= 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tfor(int i = 0; i <= m; i++){\n\t\t\tans += DP[n % 2][i][s];\n\t\t\tans %= 100000;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "#include<cstdio>\n#include<algorithm>\n\nusing namespace std;\n\n#define rep(i,n) for(i=0;i<n;i++)\n#define reps(i,n) for(i=1;i<=n;i++)\n\nint dp[50][2][3001];\n\nint main(){\n\t\n\tint n,m,s,nn,st,i,j,k;\n\tint t1=0,t2=1;\n\twhile(1){\n\t\tscanf(\"%d%d%d\",&n,&m,&s);\n\t\tif(n==0)break;\n\t\t\n\t\tt1=0;\n\t\tt2=1;\n\t\tn*=n;\n\t\trep(i,50)rep(j,2)rep(k,s+1)dp[i][j][k]=0;\n\t\tdp[0][0][0]=1;\n\t\treps(j,m){\n\t\t\t\n\t\t\tdp[0][t2][0]=1;\n\t\t\t\n\t\t\treps(i,n){\n\t\t\t\tnn=i;\n\t\t\t\tst=(nn*(nn+1))/2;\n\t\t\t\tint mm,pp,end;\n\t\t\t\tmm=(j-1)/2;\n\t\t\t\tif(j%2==0)pp=j/2;\n\t\t\t\telse pp=0;\n\t\t\t\t\n\t\t\t\tend= min(mm*(mm+1) + pp + st,s+1);\n\t\t\t\t\n\t\t\t\tfor(k=st-1;k<=end;k++){\n\t\t\t\t\tdp[i][t2][k]=0;\n\t\t\t\t\tif(k-j>=0){\n\t\t\t\t\t\tdp[i][t2][k]+=dp[i-1][t1][k-j];\n\t\t\t\t\t}\n\t\t\t\t\tdp[i][t2][k]+=dp[i][t1][k];\n\t\t\t\t\tif(dp[i][t2][k]<0)puts(\"AAAAAAA\");\n\t\t\t\t\tdp[i][t2][k]%=100000;\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\tif(i<9&&j<12){\n\t\t\t\t\tprintf(\"%d %d\\n\",i,j);\n\t\t\t\t\tfor(int k=0;k<50;k++){\n\t\t\t\t\t\tprintf(\"%d \",dp[i][t2][k]);\n\t\t\t\t\t}puts(\"\");\n\t\t\t\t}*/\n\t\t\t}\n\t\t\tswap(t1,t2);\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\",dp[n][t1][s]);\n\t}\n}", "\n#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint N,M,S;\nint inf = 1e5;\nint dp[2][2010][3010] = {};\nint main(){\n while(cin >> N >> M >> S && N>0){\n for(int i=0;i<=M;i++){\n for(int j=0;j<=S;j++){\n dp[0][i][j] = 0;\n dp[1][i][j] = 0;\n }\n }\n dp[0][0][0] = 1;\n for(int i=1;i<=N*N;i++){\n for(int j=1;j<=M;j++){\n for(int k=1;k<=S;k++){\n if(k-(N*N-i+1)>=0) dp[i%2][j][k] = (dp[i%2][j-1][k-(N*N-i+1)]+dp[(i+1)%2][j-1][k-(N*N-i+1)])%inf;\n }\n }\n for(int j=0;j<=M;j++) for(int k=0;k<=S;k++) dp[(i+1)%2][j][k] = 0;\n }\n int ans = 0;\n for(int j=1;j<=M;j++){\n (ans += dp[(N*N)%2][j][S])%=inf;\n }\n cout << ans << endl;\n }\n}\n", "#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint main(){\nwhile(1){\n\tint n,m,s;\n\tstatic int dp[2][2002][3002];\n\tfor(int i=0;i<2;i++)for(int j=0;j<2002;j++)for(int k=0;k<3002;k++)dp[i][j][k]=0;\n\tscanf(\"%d%d%d\",&n,&m,&s);\n\tif(n==0&&m==0&&s==0)break;\n\tfor(int j=0;j<=m;j++)dp[0][j][0]=1;\n\tfor(int i=1;i<=n*n;i++){\n\t\tfor(int j=1;j<=m;j++){\n\t\t\tfor(int k=1;k<=s;k++){\n\t\t\t\tif(k-j>=0){\n\t\t\t\t\tdp[1][j][k]=dp[0][j-1][k-j];\n\t\t\t\t}\n\t\t\t\tdp[1][j][k]+=dp[1][j-1][k];\n\t\t\t\tdp[1][j][k]%=100000;\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=m;j++)for(int k=0;k<=s;k++){dp[0][j][k]=dp[1][j][k]; dp[1][j][k]=0;}\n\t}\n\tprintf(\"%d\\n\",dp[0][m][s]);\n}\n}", "#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n#define mod 100000\nint dp[50][3001];\nint main(){\n int n,m,s;\n while(scanf(\"%d%d%d\",&n,&m,&s),(n|m|s)){\n\n for(int i = 0; i < n*n+1; i++){\n for(int j = 0; j < s+1; j++){\n dp[i][j] = 0;\n }\n }\n\n dp[0][0] = 1;\n\n for(int i = 1; i < m+1; i++){\n for(int j = n*n;j > 0; j--){\n for(int k = i; k < s+1; k++){\n dp[j][k] += dp[j-1][k-i];\n dp[j][k] %= mod;\n }\n }\n }\n\n /*for(int i = 0; i < n*n+1; i++){\n for(int j = 0; j < s+1;j++){\n printf(\"%3d\",dp[i][j]);\n }\n puts(\"\");\n }*/\n\n printf(\"%d\\n\",dp[n*n][s]);\n }\n return 0;\n}", "#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nint main()\n{\n const int MOD = 100000;\n\n for(;;){\n int n, m, s;\n cin >> n >> m >> s;\n if(n == 0)\n return 0;\n m = min(m, s);\n\n vector<vector<int> > num(n*n+1, vector<int>(s+1, 0));\n num[0][0] = 1;\n\n for(int i=1; i<=m; ++i){\n for(int j=n*n; j>0; --j){\n for(int k=i; k<=s; ++k){\n num[j][k] += num[j-1][k-i];\n num[j][k] %= MOD;\n }\n }\n }\n cout << num[n*n][s] << endl;\n }\n}", "\n#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define MOD 100000\n#define rep(i,n) for(i=0;i<(n);i++)\n#define loop(i,a,n) for(i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\n\nint dp[2][55][3005]; \n\nint main(void) {\n int i,j,k;\n int n,m,s;\n while(1){\n cin>>n>>m>>s;\n if(n==0)break;\n rep(i,2)rep(j,55)rep(k,3005)\n dp[i][j][k]=0;\n dp[0][0][0]=1;\n\n bool c=false;\n rep(i,m){\n int cnt=0;\n rep(j,n*n+1)rep(k,s+1)if(dp[i%2][j][k]>0){\n\t//\tcout<<i<<\" \"<<j<<\" \"<<k<<\" \"<<dp[i%2][j][k]<<endl;\n\t(dp[(i+1)%2][j][k]+=dp[i%2][j][k])%=MOD;\n\tif(k+i+1<=s)\n\t (dp[(i+1)%2][j+1][k+i+1]+=dp[i%2][j][k])%=MOD,cnt++;\n\tdp[i%2][j][k]=0;\n }\n if(c&&cnt==0)break;\n if(cnt==0)c=true;\n }\n cout<<dp[m%2][n*n][s]<<endl;\n }\n}\n\n\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MOD 100000\n#define MAX_N 50\n#define MAX_S 3001\ntypedef long long ll;\n\nint main(){\n int N,M,S;\n while(cin >> N >> M >> S, N){\n ll dp[MAX_N][MAX_S] = {{}};\n dp[0][0] = 1;\n for(int i = 1 ; i <= M ; i++){\n for(int j = N*N ; j > 0 ; j--){\n for(int k = 0 ; k <= S-i ; k++){\n dp[j][k+i] += dp[j-1][k];\n dp[j][k+i] %= MOD;\n }\n }\n }\n cout << dp[N*N][S] << endl;\n }\n return 0;\n}", "import itertools\nwhile 1:\n n,m,s=map(int,input().split())\n if n==0:break\n dp=[[0 for _ in range(s+1)] for _ in range(n*n+1)]\n dp[0][0]=1\n for i,j in itertools.product(range(1,n*n+1),range(s+1)):\n if j>=i:dp[i][j]+=dp[i-1][j-i]+dp[i][j-i]\n if j-m>=1:dp[i][j]-=dp[i-1][j-m-1]\n dp[i][j]%=100000\n print(dp[n*n][s])", "#include <cstdio>\n#include <cstring>\nint dp[50][3001];\nint main() {\n\tint N,M,S;\n\twhile(scanf(\"%d %d %d\",&N,&M,&S),N|M|S) {\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0]=1;\n\t\tfor(int m=1;m<=M;m++) {\n\t\t\tfor(int n=N*N;n>=1;n--) {\n\t\t\t\tfor(int s=m;s<=S;s++) {\n\t\t\t\t\tdp[n][s]+=dp[n-1][s-m];\n\t\t\t\t\tif(dp[n][s]>=100000) dp[n][s]-=100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp[N*N][S]);\n\t}\n}", "#include <iostream>\n#include <cstring>\nusing namespace std;\nint dp[50][3001];\nint main() {\n int n,m,s;\n while(cin >>n>>m>>s,n) {\n memset(dp,0,sizeof(dp));\n dp[0][0] = 1;\n for (int i=1; i<=m; ++i)\n for (int j=n*n; j>0; --j)\n for (int k=s; k>=i; --k)\n dp[j][k] = (dp[j][k] + dp[j-1][k-i])%100000;\n cout << dp[n*n][s] << endl;\n }\n}", "#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint dp[59][3001];\n \nint main(void)\n{\n\twhile(1)\n\t{\n\t\tint num,max,sum;\n\t\tcin >> num >> max >> sum;\n\t\tif(num+max+sum == 0)\n\t\t\treturn 0;\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0] = 1;\n\n\t\tfor(int m=1;m<=max;++m)//その数を使ッた時のあれ\n\t\t{\n\t\t\tfor(int n=num*num;n>=1;--n)//どの数が使う？(num\n\t\t\t{\n\t\t\t\tfor(int i=m;i<=sum;++i){//どの数が使う？(sum\n\t\t\t\t\tdp[n][i] += dp[n-1][i-m];//mを使った時の通り数を足す\n\t\t\t\t\tdp[n][i] %= 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << dp[num*num][sum] << endl;\n\t}\n\t\treturn 0;\n}", "//31\n#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n for(int n,m,s;cin>>n>>m>>s,n|m|s;){\n int dp[2][51][3001]={{{1}}};\n for(int i=1;i<=m;i++){\n copy(dp[i+1&1][0],dp[(i+1&1)+1][0],dp[i&1][0]);\n for(int j=0;j<n*n;j++){\n\tfor(int k=0;k+i<=s;k++){\n\t dp[i&1][j+1][k+i]=(dp[i&1][j+1][k+i]+dp[i+1&1][j][k])%100000;\n\t}\n }\n }\n cout<<dp[m&1][n*n][s]<<endl;\n }\n return 0;\n}\n ", "#include <cstdio>\n#include <cstring>\nusing namespace std;\n\nint main()\n{\n\tint dp[50][3001];\n\t\n\tint N, M, S;\n\twhile (scanf(\"%d %d %d\", &N, &M, &S), N + M + S){\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\t\n\t\tfor (int i = 1; i <= M; i++){\n\t\t\tfor (int j = N * N; j >= 1; j--){\n\t\t\t\tfor (int k = S; k >= i; k--){\n\t\t\t\t\tdp[j][k] = (dp[j][k] + dp[j - 1][k - i]) % 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\", dp[N * N][S]);\n\t}\n\t\n\treturn 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i,j) REP((i), 0, (j))\n#define REP(i,j,k) for(int i=(j);(i)<(k);++i)\n#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))\n#define ALL(v) (v).begin(), (v).end()\n#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))\n#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)\n#define SQ(x) ((x)*(x))\n#define Mod(x, mod) (((x)+(mod)%(mod))\n#define MP make_pair\n#define PB push_back\n#define F first\n#define S second\n#define INF 1 << 30\n#define EPS 1e-10\n#define MOD 100000\n\ntypedef pair<int, int> pi;\ntypedef pair<int, pi> pii;\ntypedef vector<int> vi;\ntypedef queue<int> qi;\ntypedef long long ll;\n\nint dp[2][64][4096];\nint N, M, S;\n\nint main(){\n while(cin >> N >> M >> S){;\n if(!N && !M && !S) break;\n memset(dp, 0, sizeof(dp));\n int res = 0;\n int cur, tar;\n dp[0][0][0]=1;\n REP(i, 1, M+1){\n cur = (i+1)%2;\n tar = (cur+1)%2;\n memset(dp[tar], 0, sizeof(dp[tar]));\n rep(j,SQ(N)){\n\trep(k, S){\n\t if(k+i <= S) dp[tar][j+1][k+i] = (dp[tar][j+1][k+i] + dp[cur][j][k])%MOD;\n\t dp[tar][j][k] = (dp[tar][j][k] + dp[cur][j][k])%MOD;\n\t}\n }\n /* rep(i, SQ(N)+1){\n\trep(j, S+1) cout << dp[tar][i][j] << \" \";\n\tcout << endl;\n\t}cout<<endl;*/\n res = (res+dp[tar][SQ(N)][S])%MOD;\n }\n // int res = 0;\n \n // REP(i,1, M+1) res = (res+dp[tar][i][S])%MOD;\n // cout << res << endl;\n cout << res << endl;\n }\n return 0;\n}", "#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"math.h\"\n#include \"utility\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"iomanip\"\n#include \"random\"\n\nusing namespace std;\nconst long long int MOD = 1000000007;\n\nint N, M, S;\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin >> N >> M >> S;\n\twhile (N) {\n\t\tint dp[50][3001] = {};\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 1; i <= M; i++) {\n\t\t\tfor (int j = N*N; j >= 1; j--) {\n\t\t\t\tfor (int k = S; k >= i; k--) {\n\t\t\t\t\tdp[j][k] += dp[j - 1][k - i];\n\t\t\t\t\tdp[j][k] %= 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[N*N][S] << endl;\n\t\tcin >> N >> M >> S;\n\t}\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic int MOD = 100000;\n\n\tpublic static void main(String[] args) {\n\t\twhile (true) {\n\t\t\tint N = sc.nextInt();\n\t\t\tN *= N;\n\t\t\tint M = sc.nextInt();\n\t\t\tint S = sc.nextInt();\n\t\t\tif (N == 0) break;\n\t\t\tint[][] dp = new int[S + 1][N + 1];\n\t\t\tdp[0][0] = 1;\n\t\t\tfor (int i = 1; i <= M; ++i) {\n\t\t\t\tfor (int j = S - i; j >= 0; --j) {\n\t\t\t\t\tfor (int k = N - 1; k >= 0; --k) {\n\t\t\t\t\t\tdp[j + i][k + 1] += dp[j][k];\n\t\t\t\t\t\tif (dp[j + i][k + 1] >= MOD) dp[j + i][k + 1] -= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(dp[S][N]);\n\t\t}\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int dp[55][3010];\n int n,m,s;\n while(1){\n for(int i=0;i<55;i++)\n for(int j=0;j<3010;j++)dp[i][j]=0;\n cin >> n >> m >> s;\n if(n==0&&m==0&&s==0)break;\n int bin = n*n;\n dp[0][0]=1;\n for(int k=1;k<=m;k++)\n for(int i=bin;i>0;i--){\n for(int j=k;j<=s;j++){\n dp[i][j] = (dp[i-1][j-k]+dp[i][j])%100000;\n }\n }\n cout << dp[bin][s] << endl;\n }\n return 0;\n}", "#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n\tint dp1[50][3001];\n\tint dp2[50][3001];\n\t// x?????????, ?????¨???????¨???????y\n\tint mod=100000;\n\tint n,m,s;\n\twhile(scanf(\"%d%d%d\",&n,&m,&s)){\n\t\tif(n==0&&m==0&&s==0)\n\t\tbreak;\n\t\t\n\t\tmemset(dp1,0,sizeof(dp1));\n\t\tdp1[0][0]=1;\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tmemset(dp2,0,sizeof(dp2));\n\t\t\tfor(int j=0;j<n*n+1;j++){\n\t\t\t\tfor(int k=0;k<s+1;k++){\n\t\t\t\t\t//i???????????´???\n\t\t\t\t\tif(j<n*n&&k+i<=s){\n\t\t\t\t\t\tdp2[j+1][k+i]+=dp1[j][k];\n\t\t\t\t\t\tdp2[j+1][k+i]%=mod;\n\t\t\t\t\t}\n\t\t\t\t\t//??????????????´???\n\t\t\t\t\tdp2[j][k]+=dp1[j][k];\n\t\t\t\t\tdp2[j][k]%=mod;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//dp2???dp1????????????\n\t\t\tfor(int j=0;j<n*n+1;j++){\n\t\t\t\tfor(int k=0;k<s+1;k++){\n\t\t\t\t\tdp1[j][k]=dp2[j][k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp1[n*n][s]);\n\t}\n}", "//TLEしなかったらAOJが神になった証\n\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define int long long\nint mod=1e9+7;\n\nsigned main(){\n while(true){\n int n,m,s;\n cin>>n>>m>>s;\n if(n==0&&m==0&&s==0)break;\n vector<vector<int> > dp(n*n+1,vector<int>(s+1,0));\n dp[0][0]=1;\n for(int i=1;i<=m;i++){\n for(int j=n*n-1;j>=0;j--){\n for(int k=0;k<s;k++){\n if(k+i<=s)(dp[j+1][k+i]+=dp[j][k])%=100000;\n }\n }\n }\n cout<<dp[n*n][s]<<endl;\n /*\n vector<vector<vector<int> > > dp(n*n+1,vector<vector<int> >(s+1,vector<int>(m+1,0)));\n dp[0][0][0]=1;\n for(int i=0;i<n*n;i++){\n for(int j=0;j<s;j++){\n for(int k=0;k<m;k++){\n for(int l=k+1;l<=m;l++){\n if(j+l<=s)(dp[i+1][j+l][l]+=dp[i][j][k])%=100000;\n }\n }\n }\n }\n int ans=0;\n for(int i=1;i<=m;i++)(ans+=dp[n*n][s][i])%=100000;\n cout<<ans<<endl;\n */\n }\n}\n\n", "#include <cstdio>\n#include <cstring>\nusing namespace std;\n\nint n, m, s;\nint dp[100][3010];\n\nvoid solve(){\n\tn *= n;\n\tmemset(dp,0,sizeof(dp));\n\tdp[0][0] = 1;\n\tfor(int i = 1; i <= m; i++){\n\t\tfor(int j = n; j > 0; j--){\n\t\t\tfor(int k = i; k <= s; k++){\n\t\t\t\tdp[j][k] = (dp[j][k]+dp[j-1][k-i])%100000;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\", dp[n][s]);\n}\n\nint main(){\n\twhile(scanf(\"%d%d%d\",&n,&m,&s),n||m||s) solve();\n}", "\n//y09-6 ビンゴ(2回目)\n#include <iostream>\n#include <fstream>\n#include <stdio.h>\n#include <math.h>\n#include <time.h>\n#include <string>\n#include <vector>\n#include <map>\n#include <list>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cstdlib>\n#include <algorithm>\n#include <random>\n#include <cassert>\nusing namespace std;\n#define LL long long\n#undef INT_MIN\n#undef INT_MAX\n#define INT_MIN -2147483648\n#define INT_MAX 2147483647\n#define LL_MIN -9223372036854775808\n#define LL_MAX 9223372036854775807\n#define segment_size 65536\n#define ROOP() while (true)\n\nint main(){\n ROOP(){\n int N,M,S;\n cin >> N >> M >> S;\n if(N==0) return 0;\n M = min(M,S);\n\n int dp[50][3001];\n for(int i=0; i<50; i++){\n for(int j=0; j<3001; j++){\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n\n for(int i=1; i<=N*N; i++){\n for(int j=1; j<=S; j++){\n if(j>=i) dp[i][j] = dp[i-1][j-i] + dp[i][j-i];\n if(j>M) dp[i][j] -= dp[i-1][j-M-1];\n dp[i][j] %= 100000;\n if(dp[i][j]<0) dp[i][j]+=100000;\n }\n }\n cout << dp[N*N][S] << endl;\n\n }\n return 0;\n}\n\n\n", "#include<cstdio>\n#include<algorithm>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define reps(i,n) for(int i=1;i<=n;i++)\n\nint dp[50][2][3001];\n\nint main(){\n\t\n\twhile(1){\n\t\tint n,m,s;\n\t\tscanf(\"%d%d%d\",&n,&m,&s);\n\t\tif(n==0)break;\n\t\tint t1=0,t2=1;\n\t\tn*=n;\n\t\trep(i,50)rep(j,2)rep(k,s+1)dp[i][j][k]=0;\n\t\tdp[0][0][0]=1;\n\t\treps(j,m){\n\t\t\t\n\t\t\tdp[0][t2][0]=1;\n\t\t\t\n\t\t\treps(i,n){\n\t\t\t\tint nn=i;\n\t\t\t\tint st=(nn*(nn+1))/2;\n\t\t\t\tfor(int k=st-1;k<s+1;k++){\n\t\t\t\t\tdp[i][t2][k]=0;\n\t\t\t\t\tif(k-j>=0){\n\t\t\t\t\t\tdp[i][t2][k]+=dp[i-1][t1][k-j];\n\t\t\t\t\t}\n\t\t\t\t\tdp[i][t2][k]+=dp[i][t1][k];\n\t\t\t\t\tif(dp[i][t2][k]<0)puts(\"AAAAAAA\");\n\t\t\t\t\tdp[i][t2][k]%=100000;\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\tif(i<9&&j<9){\n\t\t\t\t\tprintf(\"%d %d\\n\",i,j);\n\t\t\t\t\tfor(int k=0;k<50;k++){\n\t\t\t\t\t\tprintf(\"%d \",dp[i][t2][k]);\n\t\t\t\t\t}puts(\"\");\n\t\t\t\t}*/\n\t\t\t}\n\t\t\tswap(t1,t2);\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\",dp[n][t1][s]);\n\t}\n}", "//Bokann ga bokka--nn!!\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<int,P> P1;\ntypedef pair<P,P> P2;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define eps 1e-7\n#define INF 2000000000\n#define mod 100000\nint main(){\n\tint n,m,s;\n\twhile(1)\n\t{\n\t\tint dp[50][3005]={};\n\t\tcin >> n >> m >> s;\n\t\tif(!n) return 0;\n\t\tdp[0][0]=1;\n\t\tfor(int i=1;i<=m;i++)\n\t\t{\n\t\t\tfor(int j=n*n;j>=1;j--)\n\t\t\t{\n\t\t\t\tfor(int k=s;k>=i;k--)\n\t\t\t\t{\n\t\t\t\t\tdp[j][k]+=dp[j-1][k-i];\n\t\t\t\t\tdp[j][k]%=mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n*n][s] << endl;\n\t}\n}", "#include \"bits/stdc++.h\"\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\ntypedef pair<ll, ll> P;\ntypedef pair<ll, P> PP;\ntypedef pair<P, P> PPP;\n\nconst ll MOD = 1e9 + 7;\nconst ll INF = 9e18;\nconst double DINF = 5e14;\nconst double eps = 1e-10;\nconst int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };\n\n#define ALL(x) (x).begin(),(x).end()\n#define ALLR(x) (x).rbegin(),(x).rend()\n#define pb push_back\n#define eb emplace_back\n#define fr first\n#define sc second\n\n\nint n, m, s, mod = 100000;\n\nint main() {\n\twhile (true) {\n\t\tcin >> n >> m >> s;\n\t\tif (n==0 && m==0 && s==0)break;\n\t\tvector<vector<int>>dp(n*n + 1, vector<int>(s+1));\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 1;i <= m;i++) {\n\t\t\tfor (int j = n * n - 1;j >= 0;j--) {\n\t\t\t\tfor (int k = 0;k <= s - i;k++) {\n\t\t\t\t\tdp[j + 1][k + i] += dp[j][k];\n\t\t\t\t\tdp[j + 1][k + i] %= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[n*n][s] << endl;\n\t}\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll mod = 1e5;\n\nll partnum[50][3100];\n\nvoid partition(ll a){\n \n for(ll i = 0; i < 50; i++){\n for(ll j = 0; j < 3100; j++){\n partnum[i][j] = 0LL;}\n }\n \n partnum[0][0] = 1LL;\n\n for(ll i = 0; i <= a; i++){ partnum[1][i] = 1LL;}\n \n for(ll i = 2; i < 50; i++){\n for(ll j = 0; j < 3100; j++){\n ll res = 0LL;\n res += partnum[i-1][j];\n \n if( j-i >= 0){\n res += partnum[i][j-i];\n if( j-a-i >= 0){\n res -= partnum[i-1][j-a-i];\n }\n }\n res = (mod*mod+res)%mod;\n \n partnum[i][j] = res;\n }\n }\n}\n \n \n \nint main(){\n ll N,M,S;\n while( cin >> N >> M >> S){\n if( !N && !M && !S){ break;}\n \n ll res = N*N;\n M = M-res;\n S = S -(res*(res+1))/2;\n N = res;\n \n partition(M);\n \n cout << partnum[N][S] << endl;\n }\n \n return 0;\n}\n", "#include <bits/stdc++.h>\n#define be(v) (v).begin(),(v).end()\n#define pb(q) push_back(q)\ntypedef long long ll;\nusing namespace std;\nconst ll mod=1000000007, INF=mod*mod*3LL;\n#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\n\nint main() {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(false);\n ll n, m, s, N = 100000;\n while(cin >> n >> m >> s, n && m && s){\n \tn *= n;\n \tvector<vector<ll> > dp(n+1, vector<ll> (s+1, 0));\n \tdp[0][0] = 1;\n \tfor(int i=1;i<=n;i++){\n \t\tfor(int j=0;j<=s;j++){\n \t\t\tif(i<=j) dp[i][j] += dp[i][j-i] + dp[i-1][j-i];\n \t\t\tif(j - m - 1 >= 0) dp[i][j] -= dp[i-1][j-m-1];\n \t\t\tdp[i][j] %= N;\n \t\t}\n \t}\n \tcout << (dp[n][s]+N)%N << endl; \n }\n return 0;\n}\n\n", "#include<cstdio>\n#include<iostream>\nusing namespace std;\n\nint num[60][3010];\n\nint main(){\n int n,m,s;\n\n while(scanf(\"%d %d %d\",&n,&m,&s) && (n||m||s)){\n n = n*n;\n\n for(int i=0;i<=n;i++)\n for(int j=0;j<=s;j++)num[i][j] = 0;\n num[0][0] = 1;\n\n for(int i=1;i<=m;i++){\n for(int j=n-1;j>=0;j--){\n\tfor(int k=s-i;k>=0;k--){\n\t if(num[j][k]>0){\n\t num[j+1][k+i] += num[j][k];\n\t num[j+1][k+i] %= 100000;\n\t }\n\t}\n }\n }\n\n printf(\"%d\\n\",num[n][s]);\n }\n}", "#include <cstdio>\n#include <cstring>\n#include <algorithm>\n\nusing namespace std;\n\nint dp[64][4096];\nint N,M,S;\n\nint main(){\n while(scanf(\"%d%d%d\",&N,&M,&S) && N||M||S){\n memset(dp, 0, sizeof dp);\n dp[0][0] = 1;\n for(int i=1;i<=M;i++){\n for(int j=N*N;j>=0;j--){\n\tfor(int s=1;s<=S;s++){\n\t if(s-i>=0) dp[j+1][s] = (dp[j+1][s]+dp[j][s-i])%100000;\n\t}\n }\n }\n printf(\"%d\\n\", dp[N*N][S]);\n }\n return 0;\n}", "for e in iter(input,'0 0 0'):\n N,M,S=map(int,e.split());N*=N\n d=[[0]*-~S for _ in[0]*-~N];d[0][0]=1\n for i in range(1,N+1):\n for j in range(i,S+1):\n d[i][j]+=d[i][j-i]+d[i-1][j-i]-(M+1<=j and d[i-1][j-M-1])\n print(d[N][S]%10**5)\n", "#include <vector>\n#include <iostream>\nusing namespace std;\nconst int mod = 100000;\nint N, M, S;\nint main() {\n\twhile (cin >> N >> M >> S, N) {\n\t\tN *= N;\n\t\tM -= N;\n\t\tS -= N * (N + 1) / 2;\n\t\tvector<vector<int> > dp(M + 1, vector<int>(S + 1, 0));\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\tvector<vector<int> > dp2(M + 1, vector<int>(S + 1, 0));\n\t\t\tfor (int j = 0; j <= M; j++) {\n\t\t\t\tfor (int k = j; k <= S; k++) {\n\t\t\t\t\tdp2[j][k] = dp[j][k - j];\n\t\t\t\t\tif (j >= 1) {\n\t\t\t\t\t\tdp2[j][k] += dp2[j - 1][k - 1];\n\t\t\t\t\t\tif (dp2[j][k] >= mod) dp2[j][k] -= mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp = dp2;\n\t\t}\n\t\tint ret = 0;\n\t\tfor (int i = 0; i <= M; i++) {\n\t\t\tret += dp[i][S];\n\t\t\tif (ret >= mod) ret -= mod;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}", "# coding:utf-8\n\nimport sys\n\n\ninput = sys.stdin.readline\nMOD = 100000\n\n\ndef inpl(): return list(map(int, input().split()))\n\n\nwhile 1:\n N, M, S = inpl()\n if N == 0:\n break\n N *= N\n dp = [[0] * (S + 1) for _ in range(N + 1)]\n dp[0][0] = 1\n for i in range(1, N + 1):\n for j in range(S + 1):\n if i <= j:\n dp[i][j] += dp[i][j - i] + dp[i - 1][j - i]\n if j - 1 >= M:\n dp[i][j] -= dp[i - 1][j - 1 - M]\n dp[i][j] %= MOD\n\n # TLE!!!\n # for i in range(1, M + 1):\n # for j in range(1, N + 1)[::-1]: # j - 1の値が更新されるのを防ぐために降順\n # for k in range(i, S + 1): # 合計値は必ずi以上になる\n # dp[j][k] += dp[j - 1][k - i]\n # dp[j][k] %= MOD\n\n print(dp[N][S])\n\n", "/*#include<stdio.h>\n#include<string.h>\nint dp[50][2001][3001];\nint main(){\n memset(dp,0,sizeof(dp));\n for(int i=0;i<=2000;i++)dp[0][i][0]=1;\n for(int i=1;i<=2000;i++){\n for(int j=1;j<=49;j++){\n for(int k=0;k<=3000;k++){\n dp[j][i][k]+=dp[j][i-1][k];\n if(k-i>=0) dp[j][i][k]+=dp[j-1][i-1][k-i];\n dp[j][i][k]%=100000;\n }\n }\n }\n while(1){\n int n,m,s;\n scanf(\"%d %d %d\",&n,&m,&s);\n if(n==0&&m==0&&s==0) return 0;\n printf(\"%d\\n\",dp[n*n][m][s]);\n }\n}*/\n#include<stdio.h>\n#include<string.h>\nint dp[50][3001];\nint main(){\n memset(dp,0,sizeof(dp));\n while(1){\n int n,m,s;\n scanf(\"%d %d %d\",&n,&m,&s);\n memset(dp,0,sizeof(dp));\n dp[0][0]=1;\n for(int i=1;i<=m;i++){\n for(int j=49;j>=1;j--){\n for(int k=3000;k>=0;k--){\n if(k-i>=0) dp[j][k]+=dp[j-1][k-i];\n dp[j][k]%=100000;\n }\n }\n }\n if(n==0&&m==0&&s==0) return 0;\n printf(\"%d\\n\",dp[n*n][s]);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n\nint dp[50][3001];\nint newdp[50][3001];\n\nint main()\n{\n const int mod=100000;\n int n,m,s;\n while(cin >>n >>m >>s,n)\n {\n memset(dp,0,sizeof(dp));\n dp[0][0]=1;\n\n //i?????????????????????\n for(int i=1; i<=m; ++i)\n {\n memset(newdp,0,sizeof(newdp));\n\n rep(j,n*n+1)rep(k,s+1)\n {\n //??????\n if(j<n*n && k+i<=s)\n {\n newdp[j+1][k+i]+=dp[j][k];\n newdp[j+1][k+i]%=mod;\n }\n\n //????????????\n newdp[j][k]+=dp[j][k];\n newdp[j][k]%=mod;\n }\n\n //copy\n rep(j,n*n+1)rep(k,s+1) dp[j][k]=newdp[j][k];\n }\n\n cout << dp[n*n][s] << endl;\n }\n return 0;\n}", "#include<iostream>\n#include<vector>\nusing namespace std;\n\nconst int mod = 100000;\n\nint main(){\n int n, m, s;\n while(cin >> n >> m >> s, n+m+s){\n vector<vector<int>> dp(n*n+1, vector<int>(s+1,0));\n dp[0][0] = 1;\n for(int i = 1; i <= m; i++){ // 今採用することを検討している数\n vector<vector<int>> dp2 = dp;\n for(int j = n*n; j >= 1; j--){ // iを含めて、選択した要素数\n for(int k = s; k >= 0; k--){ // 今iを採用した時の選択した要素数の総和\n if(k >= i) dp2[j][k] = (dp2[j][k] + dp[j-1][k-i])%mod; // iを使う\n }\n }\n dp = dp2;\n }\n cout << dp[n*n][s] << endl;\n }\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\n#define watch(a) { cout << #a << \" = \" << a << endl; }\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nint dp[55][3030];\n\nint main() {\n\n int const MOD = 100000;\n\n for(int N, M, S; cin >> N >> M >> S && (N|M|S);) {\n rep(i, 55) rep(j, 3030)\n dp[i][j] = 0;\n\n dp[0][0] = 1;\n\n REP(i, 1, N * N + 1) {\n REP(j, i, S + 1) {\n dp[i][j] = (dp[i - 1][j - i] + dp[i][j - i]) % MOD;\n if(j >= M+1) {\n dp[i][j] -= dp[i - 1][j - M - 1];\n (dp[i][j] += MOD) %= MOD;\n }\n }\n }\n\n cout << dp[N*N][S] << endl;\n\n }\n \n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate<typename T>\nvector<T> make_v(size_t a){return vector<T>(a);}\ntemplate<typename T>\nvector<vector<T> > make_v(size_t a,size_t b){\n return vector<vector<T> >(a,make_v<T>(b));\n}\ntemplate<typename T>\nvector<vector<vector<T> > > make_v(size_t a,size_t b,size_t c){\n return vector<vector<vector<T> > > (a,make_v<T>(b,c));\n}\n\ntemplate<typename T,typename V>\ntypename enable_if<is_class<T>::value==0>::type\nfill_v(T &t,const V &v){t=v;}\n\ntemplate<typename T,typename V>\ntypename enable_if<is_class<T>::value!=0>::type\nfill_v(T &t,const V &v){\n for(auto &e:t) fill_v(e,v);\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n,m,s;\n while(cin>>n>>m>>s,n){\n const Int MOD=100000;\n int v=n*n;\n m-=v;\n s-=v*(v+1)/2;\n \n auto dp=make_v<int>(s+1,m+1);\n fill_v(dp,0);\n dp[0][0]=1;\n \n for(int i=0;i<v;i++){\n int c=v-i;\n auto nx=make_v<int>(s+1,m+1);\n fill_v(nx,0);\n for(int j=0;j<=s;j++){\n\tfor(int k=0;k<=m;k++){\n\t nx[j][k]+=dp[j][k];\n\t nx[j][k]%=MOD;\n\t if(j+c<=s&&k+1<=m){\n\t dp[j+c][k+1]+=dp[j][k];\n\t dp[j+c][k+1]%=MOD;\n\t }\n\t}\n }\n swap(dp,nx);\n }\n \n int ans=0;\n for(int i=0;i<=m;i++){\n ans+=dp[s][i];\n ans%=MOD;\n }\n cout<<ans<<endl;\n }\n return 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define reps(i,j,n) for(int i = (j) ; i < (int)(n) ; ++i) \n#define rep(i,n) reps(i,0,n) \n#define each(it,c) for(__typeof (c).begin() it = (c).begin(); it != (c).end(); it++) \n \n#define all(v) (v).begin(), (v).end() \n#define pb(x) push_back(x) \n#define sz(x) (int)((x).size()) \n#define UNQ(s) {sort(ALL(s));(s).erase(unique(ALL(s)),(s).end());} \n#define fr first \n#define sc second \n \ntypedef pair< int , int > Pi; \ntypedef pair< int , Pi > Pii;\n\n \ntypedef long long int64; \nconst int INF = 1 << 30; \n \ntemplate<typename T1, typename T2> istream& operator>>(istream& is, pair<T1,T2>& a){ return is>>a.first>>a.second; } \ntemplate<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1,T2>& a){ return os<<a.first<<\" \"<<a.second; } \ntemplate<typename T> istream& operator>>(istream& is, vector< T >& vc){ rep(i,sz(vc)) is >> vc[i]; return is;} \ntemplate<typename T> ostream& operator<<(ostream& os, vector< T >& vc){ rep(i,sz(vc)) os << vc[i] << endl; return os; } \n\nint main(){\n int N, M, S, dp[50][3001];\n\n\n while(cin >> N >> M >> S, N){\n\n fill_n( *dp, 50 * 3001, 0);\n\n dp[0][0] = 1;\n\n for(int i = 1; i <= M; i++){\n for(int j = N * N; j > 0; j--){\n for(int k = S; k >= i; k--){ // マスまでの総和\n (dp[j][k] += dp[j - 1][k - i]) %= 100000;\n }\n }\n }\n\n cout << dp[N * N][S] << endl;\n }\n return(0);\n}", "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint MOD=100000;\nint dp[2001][3001];\nint sum[2001][3001];\nint main(){\n\tint a,b,c;\n\twhile(scanf(\"%d%d%d\",&a,&b,&c),a+b+c){\n\t\tfor(int i=0;i<2001;i++)\n\t\t\tfor(int j=0;j<3001;j++)\n\t\t\t\tdp[i][j]=dp[i][j]=sum[i][j]=0;\n\t\tdp[0][0]=1;\n\t\tfor(int i=0;i<=b;i++){\n\t\t\tsum[i][0]=1;\n\t\t}\n\t\tfor(int i=1;i<=a*a;i++){\n\t\t//\tprintf(\"%d %d\\n\",i,min(b,(a*a-i)?(c/(a*a-i)):b));\n\t\t\tfor(int j=i;j<=min(b,(a*a-i)?(c/(a*a-i)):b);j++){\n\t\t\t\tfor(int k=i*(i+1)/2;k+(a*a-i)*j<=c;k++){\n\t\t\t\t\tdp[j][k]=sum[j-1][k-j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=i-1;j<=min(b,(a*a-i)?(c/(a*a-i)):b);j++)\n\t\t\t\tfor(int k=0;k+(a*a-i)*j<=c;k++)\n\t\t\t\t\tsum[j][k]=0;\n\t\t\tfor(int j=i;j<=min(b,(a*a-i)?(c/(a*a-i)):b);j++){\n\t\t\t\tfor(int k=i*(i+1)/2;k+(a*a-i)*j<=c;k++){\n\t\t\t\t\tsum[j][k]=(sum[j-1][k]+dp[j][k]);\n\t\t\t\t\tif(sum[j][k]>=MOD)sum[j][k]-=MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",sum[b][c]);\n\t}\n}", "#include\"bits/stdc++.h\"\nint main(){for(int n,m,s,i,j,d[50][3500],M=1e5;std::cin>>n>>m>>s,n*=n;){std::fill(d[0],d[50],M);d[0][0]=1;for(i=1;i<=n;++i)for(j=0;j<=s;++j){if(j>=i)d[i][j]+=d[i-1][j-i]+d[i][j-i];if(j>m)d[i][j]-=d[i-1][j-m-1];d[i][j]%=M;}printf(\"%d\\n\",d[n][s]);}}", "\n//y09-6 ビンゴ(3回目・自分で)\n#include <iostream>\n#include <fstream>\n#include <stdio.h>\n#include <math.h>\n#include <time.h>\n#include <string>\n#include <vector>\n#include <map>\n#include <list>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cstdlib>\n#include <algorithm>\n#include <random>\n#include <cassert>\nusing namespace std;\n#define LL long long\n#undef INT_MIN\n#undef INT_MAX\n#define INT_MIN -2147483648\n#define INT_MAX 2147483647\n#define LL_MIN -9223372036854775808\n#define LL_MAX 9223372036854775807\n#define segment_size 65536\n#define ROOP() while (true)\n\n//i回目までの合計値がjとなる組み合わせは\n//(i) i-1回目に合計値がj-iだった場合の組み合わせ(ピッタリ)\n//(ii) i回目に合計値がj-iだった場合の組み合わせ(ここまでに取ってきたすべての値(i個)を1ずつ加算させればjとなる)\n//(i),(ii)を合わせたもの\n//ただし、合計値jが数字の個数Mを超える場合、(i)でMより大きい数を取ることはできず、\n//i-1回目に合計値がj-M-1であったものを引く\n\nint main(){\n ROOP(){\n int N,M,S;\n cin >> N >> M >> S;\n if(N==0) return 0;\n\n int dp[50][3001];\n for(int i=0; i<50; i++){\n for(int j=0; j<3001; j++){\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n\n for(int i=1; i<=N*N; i++){\n for(int j=1; j<=S; j++){\n if(j>=i){\n dp[i][j] = dp[i-1][j-i] + dp[i][j-i];\n if(j>M) dp[i][j] -= dp[i-1][j-M-1];\n dp[i][j] %= 100000;\n if(dp[i][j] < 0) dp[i][j] += 100000;\n }\n }\n }\n\n cout << dp[N*N][S] << endl;\n }\n return 0;\n}\n\n\n", "//Solution for aoj:0537 Bingo\n#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<set>\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\nusing namespace std;\nconst int surplus = 100000;\nint N, ans;\nint b[2][2001][3001];\nint main(){\n\tint n, m, s;\n\twhile (cin >> n >> m >> s){\n\t\tif (!n&&!m&&!s)\n\t\t\treturn 0;\n\t\tans = 0;\n\t\tN = n*n;\n\t\tFOR(i, 1, m + 1)\n\t\t\tb[0][i][i] = 1;\n\t\tfor (int i = 2; i < N + 1; i++){\n\t\t\tfor (int j = 1; j < m; j++){\n\t\t\t\tfor (int k = j; k < s; k++){\n\t\t\t\t\tb[1][j + 1][k + 1] = b[1][j][k] + b[0][j][k - j];\n\t\t\t\t\tb[1][j + 1][k + 1] %= surplus;\n\t\t\t\t\tif (i == N&&k + 1 == s){\n\t\t\t\t\t\tans += b[1][j + 1][k + 1];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tFOR(j, 1, m){\n\t\t\t\tFOR(k, 1, s){\n\t\t\t\t\tb[0][j][k] = b[1][j][k];\n\t\t\t\t\tif (i == N)\n\t\t\t\t\t\tb[0][j][k] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans%surplus << endl;\n\t}\n}", "#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <string>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n\nusing namespace std;\n\nvoid solve(int n,int m,int s){\n int dp[50][3010]={0};\n \n dp[0][0]=1;\n \n for(int i=1;i<=m;i++){\n for(int j=n*n-1;j>=0;j--){\n for(int k=0;k<=s-i;k++){\n dp[j+1][k+i]=(dp[j+1][k+i]+dp[j][k])%100000;\n }\n }\n }\n \n printf(\"%d\\n\",dp[n*n][s]%100000);\n \n return;\n}\n\n\nint main(){\n int n,m,s;\n \n while(1){\n scanf(\"%d%d%d\",&n,&m,&s);\n if(n+m+s==0) break;\n solve(n,m,s);\n }\n \n return 0;\n}", "#include <iostream>\n#include <string.h>\n\nusing namespace std;\nint dp[50][3001];\n\nvoid solve()\n{\n\tint N, M, S;\n\twhile(cin >> N >> M >> S, N || M || S)\n\t{\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 1; i <= M; ++i)\n\t\t{\n\t\t\tfor (int j = N * N; j > 0; --j)\n\t\t\t{\n\t\t\t\tfor (int k = S; k >= i; --k)\n\t\t\t\t{\n\t\t\t\t\tdp[j][k] = (dp[j][k] + dp[j-1][k-i]) % 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[N * N][S] << endl;\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}", "#include <iostream>\n#include <cstring>\nusing namespace std;\n\nconst int mod = 100000;\nint main(){\n int n,m,s;\n int dp[50][3001];\n while(cin>>n>>m>>s,n){\n memset(dp,0,sizeof(dp));\n dp[0][0]=1;\n for(int i=1;i<=m;++i){\n for(int j=n*n-1;j>=0;--j){\n for(int k=0;k<=s-i;++k){\n dp[j+1][k+i] +=dp[j][k];\n dp[j+1][k+i] %= mod;\n }\n }\n }\n cout<<dp[n*n][s]<<endl;\n }\n return 0;\n}", "#include <iostream>\n#include <vector>\n#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))\n#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))\nusing namespace std;\nconst int mod = 100000;\nint main() {\n while (true) {\n int n, m, s; cin >> n >> m >> s;\n if (n == 0 and m == 0 and s == 0) break;\n vector<vector<int> > dp(n*n+1, vector<int>(s+1));\n dp[0][0] = 1;\n repeat (i,m) {\n repeat_reverse (j,n*n) {\n repeat (k,s-i) {\n dp[j+1][k+(i+1)] += dp[j][k];\n dp[j+1][k+(i+1)] %= mod;\n }\n }\n }\n cout << dp[n*n][s] << endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair((a),(b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(),(x).end()\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\n#define INF 2147483600\n#define MOD 100000\n\nint solve(int n, int m, int s){\n\n vector<vector<int>> dp(n*n+1, vector<int>(s+1, 0));\n dp[0][0] = 1;\n repl(i,1,m+1){\n vector<vector<int>> nxt(n*n+1, vector<int>(s+1, 0));\n rep(j,n*n+1) rep(k,s+1) if(dp[j][k]>0){\n (nxt[j][k] += dp[j][k])%=MOD;\n if(j+1<=n*n && k+i<=s) (nxt[j+1][k+i] += dp[j][k]) %= MOD;\n }\n swap(dp, nxt);\n }\n return dp[n*n][s];\n}\n\nint main(){\n int n,m,s;\n while(cin>>n>>m>>s, n){\n cout << solve(n,m,s) << endl;\n }\n\n return 0;\n}", "#include <iostream>\n#include <queue>\n#include <algorithm>\nusing namespace std;\nint dp[2][55][3005];\nint n,m,s;\nint main(void){\n while(1){\n cin>>n>>m>>s;\n if(!n&&!m&&!s)break;\n n*=n;\n for(int i=0;i<=n;i++){\n for(int j=0;j<=s;j++){\n dp[0][i][j]=0;\n dp[1][i][j]=0;\n }\n }\n dp[0][0][0]=1;\n for(int i=1;i<=m;i++){\n for(int j=0;j<=n;j++){\n for(int k=0;k<=s;k++){\n dp[i%2][j][k]=dp[(i+1)%2][j][k];\n if(k-i>=0&&j>0)dp[i%2][j][k]=(dp[(i+1)%2][j-1][k-i]+dp[i%2][j][k])%100000;\n \n }\n }\n }\n cout<<dp[m%2][n][s]<<endl;\n }\n}", "#include <cstdio>\n#include <cstring>\nint dp[50][3001];\nint main() {\n\tint N,M,S;\n\twhile(scanf(\"%d %d %d\",&N,&M,&S),N) {\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0]=1;\n\t\tfor(int m=1;m<=M;m++)for(int k=N*N;k>=1;k--)for(int s=m;s<=S;s++) {\n\t\t\tdp[k][s]+=dp[k-1][s-m];\n\t\t\tif(dp[k][s]>100000)dp[k][s]-=100000;\n\t\t}\n\t\tprintf(\"%d\\n\",dp[N*N][S]);\n\t}\n}", "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <bitset>\n#include <algorithm>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <string>\n#include <cstring>\n#include <complex>\n\n#define FOR(i,b,n) for(int i=b;i<n;i++)\n#define RFOR(i,b,n) for(int i=n-1;i>=b;i--)\n#define CLR(mat) memset(mat, 0, sizeof(mat))\n#define NCLR(mat) memset(mat, -1, sizeof(mat))\n\nusing namespace std;\n\ntypedef pair<int,int> paii;\ntypedef long long ll;\n\nint n, m, s;\nint dp[100][5000];\n\nint solve()\n{\n\tCLR(dp);\n\tdp[0][0] = 1;\n\t\n\tFOR(i, 1, m+1)\n\t\tRFOR(j, 1, n*n+1)\n\t\t\tFOR(k, i, s+1)\n\t\t\t{\n\t\t\t\tdp[j][k] += dp[j-1][k-i];\n\t\t\t\t\n\t\t\t\tif(dp[j][k] >= 100000)\n\t\t\t\t\tdp[j][k] = dp[j][k]%100000;\n\t\t\t}\n\t\n\treturn dp[n*n][s];\n}\n\nint main()\n{\n\twhile(cin >> n >> m >> s, (n||m||s))\n\t{\n\t\tcout << solve() << endl;\n\t}\n\t\t\n\treturn 0;\n}", "#include<cstdio>\n#include<algorithm>\n\nusing namespace std;\n\n#define rep(i,n) for(i=0;i<n;i++)\n#define reps(i,n) for(i=1;i<=n;i++)\n\nint dp[50][2][3001];\n\nint main(){\n\t\n\tint n,m,s,nn,st,i,j,k;\n\tint t1=0,t2=1;\n\twhile(1){\n\t\tscanf(\"%d%d%d\",&n,&m,&s);\n\t\tif(n==0)break;\n\t\t\n\t\tt1=0;\n\t\tt2=1;\n\t\tn*=n;\n\t\trep(i,50)rep(j,2)rep(k,s+1)dp[i][j][k]=0;\n\t\tdp[0][0][0]=1;\n\t\treps(j,m){\n\t\t\t\n\t\t\tdp[0][t2][0]=1;\n\t\t\t\n\t\t\treps(i,n){\n\t\t\t\tnn=i;\n\t\t\t\tst=(nn*(nn+1))/2;\n\t\t\t\tfor(k=st-1;k<s+1;k++){\n\t\t\t\t\tdp[i][t2][k]=0;\n\t\t\t\t\tif(k-j>=0){\n\t\t\t\t\t\tdp[i][t2][k]+=dp[i-1][t1][k-j];\n\t\t\t\t\t}\n\t\t\t\t\tdp[i][t2][k]+=dp[i][t1][k];\n\t\t\t\t\tif(dp[i][t2][k]<0)puts(\"AAAAAAA\");\n\t\t\t\t\tdp[i][t2][k]%=100000;\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\tif(i<9&&j<9){\n\t\t\t\t\tprintf(\"%d %d\\n\",i,j);\n\t\t\t\t\tfor(int k=0;k<50;k++){\n\t\t\t\t\t\tprintf(\"%d \",dp[i][t2][k]);\n\t\t\t\t\t}puts(\"\");\n\t\t\t\t}*/\n\t\t\t}\n\t\t\tswap(t1,t2);\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\",dp[n][t1][s]);\n\t}\n}", "#include <iostream>\nusing namespace std;\nint dp[55][3005];\nint n,m,s,i,j,k;\nint main(void){\n while(1){\n cin>>n>>m>>s;\n if(!n)break;\n n*=n;\n for(i=0;i<=n;i++)for(j=0;j<=s;j++)dp[i][j]=0;\n dp[0][0]=1;\n for(i=1;i<=m;i++)for(j=n;j>0;j--)for(k=i;k<=s;k++)dp[j][k]=(dp[j-1][k-i]+dp[j][k])%100000;\n cout<<dp[n][s]<<endl;\n }\n}", "#include <bits/stdc++.h>\n#define PB push_back\n#define MP make_pair\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define ALL(a) (a).begin(),(a).end()\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef long long ll;\nconst int INF=1e9;\nconst int mod=100000;\nint dp[2][3010][50];\nint n,m,s;\nint main(){\n while(1){\n cin>>n>>m>>s;\n if(n==0&&m==0&&s==0)break;\n memset(dp,0,sizeof(dp));\n dp[0][0][0]=1;\n for(int i=1;i<=m;i++){\n REP(j,3010)REP(k,50)dp[i&1][j][k]=dp[(i-1)&1][j][k];\n for(int j=0;j+i<=s;j++){\n for(int k=0;k<n*n;k++){\n if(dp[(i-1)&1][j][k]>=1){\n }\n dp[i&1][j+i][k+1]+=dp[(i-1)&1][j][k];\n dp[i&1][j+i][k+1]%=mod;\n }\n }\n }\n cout<<dp[m&1][s][n*n]%mod<<endl;\n }\n}", "#include <cstdio>\n#include <string.h>\nusing namespace std;\n\nint n, m, s, ans;\nint dp[2][2001][3001];\n\nint main(){\n while(scanf(\"%d%d%d\", &n, &m, &s) && n && m && s){\n for(int i = 1; i <= m; i++)\n dp[0][i][i] = 1;\n\n for(int i = 2; i <= n * n; i++){\n for(int j = 1; j < m; j++){\n for(int k = j; k < s; k++){\n dp[1][j + 1][k + 1] += dp[1][j][k];\n dp[1][j + 1][k + 1] += dp[0][j][k - j];\n dp[1][j + 1][k + 1] %= 100000;\n }\n }\n for(int j = 1; j <= m; j++){\n for(int k = 1; k <= s; k++){\n dp[0][j][k] = dp[1][j][k];\n dp[1][j][k] = 0;\n }\n }\n }\n\n for(int i = 1; i <= m; i++){\n ans += dp[0][i][s];\n ans %= 100000;\n }\n\n printf(\"%d\\n\", ans);\n memset(dp, 0, sizeof dp);\n ans = 0;\n }\n\n return 0;\n}", "#include<iostream>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\nint dp[50][3001];\nconst int MOD = 100000;\n\nint main() {\n while (true) {\n int n, m, s;\n cin >> n >> m >> s;\n if (n == 0) break;\n n = n * n;\n rep (i, 50) rep (j, 3001) dp[i][j] = 0;\n dp[0][0] = 1;\n rep (i, m + 1) if (i > 0) for (int j = n; j > 0; --j) for (int k = i; k <= s; ++k) {\n\t dp[j][k] += dp[j - 1][k - i];\n\t dp[j][k] %= MOD;\n }\n cout << dp[n][s] << endl;\n }\n}", "#include<stdio.h>\nint main(){\nint n,m,s,i,j,w=1e5;\nwhile(scanf(\"%d%d%d\",&n,&m,&s),n){\nint d[51][3001]={};d[0][0]=1;\nfor(i=1;i<=n*n;i++)for(j=i;j<=s;j++){\nint &x=d[i][j];x+=d[i-1][j-i]+d[i][j-i];\nif(j-1-m>=0)x+=w-d[i-1][j-1-m];x%=w;\n}printf(\"%d\\n\",d[n*n][s]);\n}\nreturn 0;\n}\n", "#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <algorithm>\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define FORE(i,a,b) for(int i=(a);i<=(b);i++)\n#define REP(i,b) FOR(i,0,b)\nusing namespace std;\ntypedef long long ll;\nint DP[2][2001][3001];\nint main() {\n\tint N,M,S;\n\twhile(cin >> N >> M >> S && N){\n\t\tint sum=0;\n\t\tREP(i,2)\n\t\t\tREP(j,2001)\n\t\t\t\tREP(k,3001)\n\t\t\t\t\tDP[i][j][k]=0;\n\t\tDP[0][0][0]=1;\n\t\tN*=N;\n\t\tFORE(i,1,N)\n\t\t\tFORE(j,0,M)\n\t\t\t\tFORE(k,0,S)\n\t\t\t\t\tif(j<=k && j)\n\t\t\t\t\tDP[i%2][j][k]=(DP[i%2][j-1][k-1]+DP[(i+1)%2][j-1][k-j])%100000;\n\t\t\t\t\telse\n\t\t\t\t\tDP[i%2][j][k]=0;\n\t\tFORE(i,1,M)\n\t\t\tsum=(sum+DP[N%2][i][S])%100000;\n\t\tcout << sum%100000 << endl;\n\t\t\n\t}\n\t// your code goes here\n\treturn 0;\n}", "#include <vector>\n#include <iostream>\nusing namespace std;\nconst int mod = 100000;\nint N, M, S;\nint main() {\n\twhile (cin >> N >> M >> S, N) {\n\t\tN *= N;\n\t\tM -= N;\n\t\tS -= N * (N + 1) / 2;\n\t\tvector<vector<int> > dp(M + 1, vector<int>(S + 1, 0));\n\t\tdp[0][0] = 1;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tvector<vector<int> > dp2(M + 1, vector<int>(S + 1, 0));\n\t\t\tdp2[0][0] = 1;\n\t\t\tfor (int j = 1; j <= M; j++) {\n\t\t\t\tfor (int k = j; k <= S; k++) {\n\t\t\t\t\tdp2[j][k] = dp[j][k - j];\n\t\t\t\t\tif (j >= 1) {\n\t\t\t\t\t\tdp2[j][k] += dp2[j - 1][k - 1];\n\t\t\t\t\t\tif (dp2[j][k] >= mod) dp2[j][k] -= mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp = dp2;\n\t\t}\n\t\tint ret = 0;\n\t\tfor (int i = 0; i <= M; i++) {\n\t\t\tret += dp[i][S];\n\t\t\tif (ret >= mod) ret -= mod;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <ctime>\n#include <cassert>\n#include <iostream>\n#include <cctype>\n#include <sstream>\n#include <string>\n#include <list>\n#include <vector>\n#include <queue>\n#include <set>\n#include <stack>\n#include <map>\n#include <utility>\n#include <numeric>\n#include <algorithm>\n#include <iterator>\n#include <bitset>\n#include <complex>\n#include <fstream>\nusing namespace std;\ntypedef long long ll;\nconst double EPS = 1e-9;\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\n#define rep(i, n) REP(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define MSG(a) cout << #a << \" \" << a << endl;\n#define REP(i, x, n) for(int i = x; i < n; i++)\ntemplate<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }\ntemplate<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }\ntemplate<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }\ntemplate<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }\n\nconst int MOD = 100000;\n\nint n, m, s;\nint dp[50][3005]; // dp[‘I‘ð‚µ‚½ŒÂ”][—ÝŒv”]‚ð–ž‚½‚·‘g‚ݍ‡‚킹‚̐”\n\nint main()\n{\n\twhile(cin >> n >> m >> s && n)\n\t{\n\t\tmemset(dp,0,sizeof(dp));\n\t\t\n dp[0][0]=1;\n\t\t\n for(int i = 1; i <= m; i++)\n\t\t{\n for (int j = n * n; 0 < j; j--)\n\t\t\t{\n for(int k = s; i <= k; k--)\n\t\t\t\t{\n (dp[j][k] += dp[j - 1][k - i]) %= MOD;\n }\n }\n\t\t}\n\t\t\n\t\tcout << dp[n * n][s] << endl;\n\t}\n}", "#include<map>\n#include<set>\n#include<list>\n#include<cmath>\n#include<queue>\n#include<stack>\n#include<cstdio>\n#include<string>\n#include<vector>\n#include<complex>\n#include<cstdlib>\n#include<cstring>\n#include<numeric>\n#include<sstream>\n#include<iostream>\n#include<algorithm>\n#include<functional>\n\n#define mp make_pair\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define REP(i,b,n) for(int i=b;i<n;i++)\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\n\nconst int INF=1<<29;\nconst double EPS=1e-9;\n\nconst int dx[]={1,0,-1,0},dy[]={0,-1,0,1};\nint N,M,S;\nconst int MOD =100000;\nll dp[3010][51];\nint main(){\n\twhile(cin>>N>>M>>S,N||M||S){\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\tfor(int i =1;i <=M;i++){\n\t\t\tfor(int j =N*N;j >=1;j--){\n\t\t\t\tfor(int k = 1;k <=S;k++){\n\t\t\t\t\tif(k-i>=0){\n\t\t\t\t\t\tdp[k][j]=(dp[k][j]+dp[k-i][j-1])%MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout <<dp[S][N*N]<<endl;\n\t}\n\treturn 0;\n}", "#include<map>\n#include<set>\n#include<list>\n#include<cmath>\n#include<queue>\n#include<stack>\n#include<cstdio>\n#include<string>\n#include<vector>\n#include<complex>\n#include<cstdlib>\n#include<cstring>\n#include<numeric>\n#include<sstream>\n#include<iostream>\n#include<algorithm>\n#include<functional>\n\n#define mp make_pair\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define REP(i,b,n) for(int i=b;i<n;i++)\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\n\nconst int INF=1<<29;\nconst double EPS=1e-9;\n\nconst int dx[]={1,0,-1,0},dy[]={0,-1,0,1};\nint N,M,S;\nconst int MOD =100000;\nll dp[3010][51];\nint main(){\n\twhile(cin>>N>>M>>S,N||M||S){\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0] = 1;\n\t\tfor(int i =1;i <=M;i++){\n\t\t\tfor(int j =N*N;j >=1;j--){\n\t\t\t\tfor(int k = i;k <=S;k++){\n\t\t\t\t\tif(k-i>=0){\n\t\t\t\t\t\tdp[k][j]=(dp[k][j]+dp[k-i][j-1])%MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout <<dp[S][N*N]<<endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 100000;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\nint main(){\n int N, M, S;\n while(cin >> N >> M >> S && N){\n N *= N;\n static int dp[2][3001][2001] = {};\n dp[0][0][0] = 1;\n for(int i = 0; i < N; i++){\n for(int sum = 1; sum <= S; sum++){\n for(int last = 1; last <= min(M, sum); last++){\n dp[(i + 1) & 1][sum][last] = (dp[(i + 1) & 1][sum - 1][last - 1] + dp[i & 1][sum - last][last - 1]) % MOD;\n }\n }\n memset(dp[i & 1], 0, sizeof(dp[i & 1]));\n }\n int ans = 0;\n for(int last = 1; last <= M; last++) ans = (ans + dp[N & 1][S][last]) % MOD;\n cout << ans << endl;\n }\n return 0;\n}", "#include<iostream>\nusing namespace std;\nint d[51][3210],n,m,s,i,j,k;\nint main(){\n\twhile(cin>>n>>m>>s&&n){\n\t\tn*=n;\n\t\tfor(i=0;i<=n;i++)for(j=0;j<=s;j++)d[i][j]=0;d[0][0]=1;\n\t\tfor(k=1;k<=m;k++){\n\t\t\tfor(i=n;i;i--){\n\t\t\t\tfor(j=k;j<=s;j++){\n\t\t\t\t\td[i][j]=(d[i][j]+d[i-1][j-k])%100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<d[n][s]<<endl;\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <cstring>\nint dp[50][3001];\nint main() {\n\tint n,m,s;\n\twhile(scanf(\"%d %d %d\",&n,&m,&s),n) {\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0]=1;\n\t\tfor(int i=1;i<=m;i++)\n\t\t\tfor(int j=n*n;j>=1;j--)\n\t\t\t\tfor(int k=i;k<=s;k++) {\n\t\t\t\t\tdp[j][k]+=dp[j-1][k-i];\n\t\t\t\t\tif(dp[j][k]>=100000)dp[j][k]-=100000;\n\t\t\t\t}\n\t\tprintf(\"%d\\n\",dp[n*n][s]);\n\t}\n}", "#include <iostream>\n#include <algorithm>\n#include <cstring>\n\nusing namespace std;\n\nint dp[2][3001][50];\nconst int mod=100000;\nint n,m,s;\n\nint main(){\n while(cin>>n>>m>>s&&(n|m|s)){\n memset(dp,0,sizeof(dp));\n for(int i=0;i<2;i++)dp[i][0][n*n]=1;\n for(int i=m;i>=0;i--){\n for(int j=0;j<=s;j++){\n for(int k=n*n;k>=0;k--){\n int cur=(i+1)%2;\n int nxt=i%2;\n int res=0;\n if(k==n*n){\n if(j==0)res=1;\n else res=0;\n }\n else{\n res+=dp[cur][j][k];\n if(j-i>=0)res+=dp[cur][j-i][k+1];\n }\n dp[nxt][j][k]=res%mod;\n }\n }\n }\n cout<<dp[1][s][0]%mod<<endl;\n }\n return 0;\n}", "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nint dp[3001][50];\nconst static int MOD = 100000;\n\nint main(){\n int bingo_card_size;\n int upper_number;\n int bingo_card_sum;\n while(~scanf(\"%d %d %d\",\n\t &bingo_card_size,\n\t &upper_number,\n\t &bingo_card_sum)){\n if(bingo_card_size == 0\n && upper_number == 0\n && bingo_card_sum== 0) break;\n\n memset(dp,0,sizeof(dp));\n dp[0][0] = 1;\n for(int num=1;num<=upper_number;num++){\n for(int sum=bingo_card_sum;sum-num>=0;sum--){\n\tfor(int filled_count=bingo_card_size*bingo_card_size;filled_count-1>=0;filled_count--){\n\t dp[sum][filled_count] += dp[sum-num][filled_count-1];\n\t dp[sum][filled_count] %= MOD;\n\t}\n }\n }\n\n printf(\"%d\\n\",dp[bingo_card_sum][bingo_card_size*bingo_card_size]);\n }\n}", "#include <bits/stdc++.h>\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define RREP(i,n) for(int i=n-1;i>=0;i--)\n\n#define PB push_back\n#define INF (1<<29)\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define CLR(a) memset(a,0,sizeof(a))\nconst int dx[] = {-1,0,0,1},dy[] = {0,1,-1,0};\n\ntypedef long long int ll;\n\nusing namespace std;\n\nint dp[50][5001];\n\nint main(){\n while(true){\n\tint n,m,s;\n\tcin >> n >> m >> s;\n\tif(n == 0 && m == 0 && s == 0) break;\n\tmemset(dp,0,sizeof(dp));\n\tdp[0][0] = 1;\n\tFOR(j,1,m+1){\n\t RREP(k,s){\n\t\tRREP(i,n*n){\n\t\t dp[i+1][k+j] = (dp[i+1][k+j] + dp[i][k])%100000 ;\n\t\t}\n\t }\n\t}\n\tint ans =0 ;\n\tans += dp[n*n][s];\n\tcout << ans << endl;\n }\n return 0;\n}", "//AOJ0537 bingo\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#define MOD 100000\nusing namespace std;\n\nint main(){\n\tint n,m,s;\n\t/*int dp[2001][50][3001] = {};\n\tdp[1][1][1] = 1;\n\tdp[1][0][0] = 1;\n\tfor(int i = 2;i <= 2000;i++){\n\t\tfor(int j = 0;j <= 49;j++){\n\t\t\tfor(int k = 0;k <= 3000;k++){\n\t\t\t\tif(j == 0) dp[i][j][0] = 1;\n\t\t\t\telse if(k - i >= 0) dp[i][j][k] = (dp[i - 1][j][k] + dp[i - 1][j - 1][k - i]) % MOD;\n\t\t\t\telse dp[i][j][k] = dp[i - 1][j][k];\n\t\t\t}\n\t\t}\n\t}*/\n\twhile(1){\n\t\tcin >> n >> m >> s;\n\t\tif(!n) break;\n\t\tint dp[2][50][3001] = {};\n\t\tdp[1][1][1] = 1;\n\t\tdp[1][0][0] = 1;\n\t\tfor(int i = 2;i <= m;i++){\n\t\t\tfor(int j = 0;j <= n * n;j++){\n\t\t\t\tfor(int k = 0;k <= s;k++){\n\t\t\t\t\tif(j == 0) dp[i % 2][j][0] = 1;\n\t\t\t\t\telse if(k - i >= 0) dp[i % 2][j][k] = (dp[(i + 1) % 2][j][k] + dp[(i + 1) % 2][j - 1][k - i]) % MOD;\n\t\t\t\t\telse dp[i % 2][j][k] = dp[(i + 1) % 2][j][k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[m % 2][n * n][s] << endl;\n\t}\n\treturn 0;\n}", "#include<bits/stdc++.h>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) for(int i = 0; i < (b); i++)\n#define all(a) (a).begin(), (a).end()\n#define show(x) cerr << #x << \" = \" << (x) << endl;\nusing namespace std;\n\nconst int M = 100000;\n\nint main(){\n int n, m, s;\n while(cin >> n >> m >> s,n){\n\t\tvector<vector<int>> cur(n * n + 1, vector<int>(s + 1,0));\n\t\tcur[0][0] = 1;\n\t\trange(i,1,m + 1){\n\t\t\tfor (int j = n * n; j > 0; j--) {\n\t\t\t\trange(k,i,s + 1){\n\t\t\t\t\t(cur[j][k] += cur[j - 1][k - i]) %= M;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n cout << cur[n * n][s] << endl;\n }\n}\n\n", "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nint n, m, s;\nconst int MOD = 100000;\nint dp[2010][3010];\n\nint main() {\n while (scanf(\"%d %d %d\", &n, &m, &s), n|m|s) {\n MEMSET(dp, 0);\n FOREQ(i, 0, m) {\n dp[i][0] = 1;\n }\n REP(iter, n * n) {\n dp[m][s] = 0;\n for (int i = m; i >= 1; i--) {\n int upper = s - i * (n * n - iter);\n FOREQ(j, 0, upper) {\n dp[i][j + i] = dp[i - 1][j];\n }\n memset(dp[i], 0, sizeof(int) * i);\n }\n FOREQ(i, 1, m) {\n int upper = s + i - i * (n * n - iter);\n FOREQ(j, 0, upper) {\n dp[i][j] += dp[i - 1][j];\n dp[i][j] %= MOD;\n }\n }\n if (iter == 0) {\n FOREQ(i, 0, m) {\n dp[i][0] = 0;\n }\n }\n }\n printf(\"%d\\n\", dp[m][s]);\n }\n}", "#include<iostream>\n#include<cstring>\n\nusing namespace std;\n\nint n,m,s;\nint map[50][3001];\n\nint main(void){\n\twhile(1){\n\t\tcin >> n >> m >> s;\n\t\tif(n==0 && m==0 && s==0)break;\n\t\tmemset(map,0,sizeof(map));\n\t\tmap[0][0]=1;\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tfor(int j=n*n;j>=1;j--){\n\t\t\t\tfor(int k=i;k<=s;k++){\n\t\t\t\t\tmap[j][k]=(map[j][k]+map[j-1][k-i])%100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << map[n*n][s] << endl;\n\t}\n return 0;\n}", "/* package whatever; // don't place package name! */\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n/* Name of the class has to be \"Main\" only if the class is public. */\nclass Main\n{\n\tpublic static void main (String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tfor(;;) {\n\t\t\tint n = sc.nextInt(), m = sc.nextInt(), s = sc.nextInt();\n\t\t\tif((n|m|s) == 0) break;\n\t\t\tint[][] dp = new int[n*n+1][s+1];\n\t\t\tdp[0][0] = 1;\n\t\t\tfor(int j=1;j<=m;j++) for(int i=n*n;i>=1;i--) for(int k=s;k>=j;k--) {\n\t\t\t\tdp[i][k] = ( dp[i][k] + dp[i-1][k-j] ) % 100000;\n\t\t\t}\n\t\t\tSystem.out.println(dp[n*n][s]);\n\t\t}\n\t\t// your code goes here\n\t}\n}", "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define REP(n) rep(i,n)\n#define all(n) n.begin(),n.end()\n\nconst int MAXN = 7, MAXS = 3000 ;\nint n, m, s;\nunsigned int dp[MAXN * MAXN + 2][MAXS + 10], UB = 100000;\n\nint main()\n{\n while(cin >> n >> m >> s && n)\n {\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n\n for(int i_m = 1; i_m <= m; i_m++)\n for(int i_n = n * n; i_n > 0; i_n--)\n for(int i_s = i_m; i_s <= s; i_s++)\n dp[i_n][i_s] = (dp[i_n][i_s] + dp[i_n - 1][i_s - i_m]) % UB;\n\n cout << dp[n * n][s] << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <cstring>\n\nconstexpr int MOD=(int)1e5;\n\nconstexpr int MAX_S=3000;\n\nint n,m,s;\n\nint dp[50][MAX_S+1];\n\nint main() {\n\n while(std::cin>>n>>m>>s, n+m+s){\n\n std::memset(dp,0,sizeof(dp));\n\n dp[0][0]=1;\n\n for(int i=1;i<=std::min(m,s);++i){\n for(int j=n*n;j>0;--j){\n for(int k=i;k<=s;++k)\n dp[j][k]=(dp[j][k]+dp[j-1][k-i])%MOD;\n }\n }\n \n std::cout<<dp[n*n][s]<<std::endl;\n }\n\n return 0;\n}", "#include<cstdio>\n#include<cstring>\n#define mod 100000\nusing namespace std;\n\nint dp[50][3001];\nint main()\n{\n\tint n,m,s;\n\twhile(scanf(\"%d%d%d\",&n,&m,&s),n){\n\t\tn*=n;\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0][0]=1;\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tfor(int j=n;j>0;j--){\n\t\t\t\tfor(int l=i;l<=s;l++){\n\t\t\t\t\tdp[j][l]=(dp[j][l]+dp[j-1][l-i])%mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",dp[n][s]);\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <algorithm>\n\n#pragma warning(disable: 4996)\n\n#define MOD 100000\n\n#define MAX_M 2000\n#define MAX_S 3000\n\nint N, M, S;\n\nint dp[2][MAX_M + 1][MAX_S + 1];\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tscanf(\"%d\", &N);\n\t\tscanf(\"%d\", &M);\n\t\tscanf(\"%d\", &S);\n\n\t\tif (N == 0 && M == 0 && S == 0) { break; }\n\n\t\tfor (int i = 0; i < M; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < S; j++)\n\t\t\t{\n\t\t\t\tif (i == j && i != 0 && j != 0)\n\t\t\t\t{\n\t\t\t\t\tdp[1][i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tdp[1][i][j] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int n = 2; n <= N * N; n++)\n\t\t{\n\t\t\tfor (int i = 0; i < M; i++)\n\t\t\t{\n\t\t\t\tdp[n % 2][i][0] = 0;\n\t\t\t}\n\n\t\t\tfor (int j = 0; j < S; j++)\n\t\t\t{\n\t\t\t\tdp[n % 2][0][j] = 0;\n\t\t\t}\n\n\t\t\tfor (int i = 1; i <= M; i++)\n\t\t\t{\n\t\t\t\tfor (int j = 1; j <= S; j++)\n\t\t\t\t{\n\t\t\t\t\tif (n % 2 == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tdp[0][i][j] = (dp[0][i - 1][j - 1] + (j >= i ? dp[1][i - 1][j - i] : 0)) % MOD;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tdp[1][i][j] = (dp[1][i - 1][j - 1] + (j >= i ? dp[0][i - 1][j - i] : 0)) % MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint sum = 0;\n\n\t\tfor (int i = 1; i <= M; i++)\n\t\t{\n\t\t\tif (N % 2 == 0)\n\t\t\t{\n\t\t\t\tsum += dp[0][i][S];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsum += dp[1][i][S];\n\t\t\t}\n\n\t\t\tsum %= MOD;\n\t\t}\n\n\t\tprintf(\"%d\\n\", sum);\n\t}\n\n\treturn 0;\n}", "//#define __USE_MINGW_ANSI_STDIO 0\n#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<ll> VL;\ntypedef vector<VL> VVL;\ntypedef pair<int, int> PII;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define IN(a, b, x) (a<=x&&x<b)\n#define MP make_pair\n#define PB push_back\nconst int INF = (1LL<<30);\nconst ll LLINF = (1LL<<60);\nconst double PI = 3.14159265359;\nconst double EPS = 1e-12;\nconst int MOD = 100000;\n//#define int ll\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nint dp[50][3010];\nsigned main(void)\n{\n while(true) {\n int n, m, s;\n cin >> n >> m >> s;\n if(!n) break;\n n *= n;\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n // ??°??????????????§???????´????i\n FOR(i, 1, m+1) {\n // j???????????§??§????¨????k?????¨???????????????\n for(int j=n; j>=1; --j) FOR(k, i, s+1) {\n (dp[j][k] += dp[j-1][k-i]) %= MOD;\n }\n }\n cout << dp[n][s] << endl;\n }\n\n return 0;\n}", "#include <iostream>\n#include <algorithm>\nusing namespace std;\n/*\n1からmまでの数をn*n個重複しないように選び、合計がsになるパターンの数を求める。\nナップサック\n*/\nint n,m,s;\nint dp[50][3001];\n\n\n\nint main(){\n\t\n\twhile(cin>>n>>m>>s,n){\n\t\t\n\t\t//初期化?\n\t\tfor(int i=0;i<50;i++)for(int j=0;j<=3000;j++)dp[i][j]=0;\n\t\tdp[0][0]=1;\n\t\t\n\t\t\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tfor(int j=n*n;j>=1;j--){\n\t\t\t\tfor(int k=i;k<=s;k++){\n\t\t\t\t\tdp[j][k]=(dp[j][k]+dp[j-1][k-i])%100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t//出力\n\t\tcout<<dp[n*n][s]<<endl;\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\treturn 0;\n}\n", "#include <iostream>\n\nusing namespace std;\n\nvoid solve(int N, int M, int S) {\n int dp[2][M+1][S+1];\n\n dp[0][0][0]=0;\n dp[1][0][0]=0;\n for(int j=1; j<=M; ++j) {\n dp[0][j][0]=0;\n dp[1][j][0]=0;\n for(int k=1; k<=S; ++k) {\n dp[1][j][k]=(k<=j?1:0);\n dp[0][j][k]=0;\n }\n }\n for(int i=2; i<=N*N; ++i) {\n dp[i%2][0][0]=0;\n for(int j=1; j<=M; ++j) {\n for(int k=1; k<=S; ++k) {\n if(i>j) dp[i%2][j][k]=0;\n else if(k<i*(i+1)/2) dp[i%2][j][k]=0;\n else if(k-j<=0) dp[i%2][j][k]=dp[i%2][j-1][k];\n else dp[i%2][j][k]=dp[i%2][j-1][k]+dp[(i-1)%2][j-1][k-j];\n dp[i%2][j][k]%=100000;\n }\n }\n }\n\n cout << dp[(N*N)%2][M][S] << endl;\n\n return;\n}\n\nint main() {\n int N,M,S;\n while(true) {\n cin >> N >> M >> S;\n if(N==0 && M==0 && S==0) break;\n solve(N,M,S);\n }\n return 0;\n}\n", "//びぃあいえぬじぃおぉ＝BINGO!!\n\n#include <cstdio>\n\nint main(void)\n{\n\n \n while (1){\n\tint n, m, s;\n scanf(\"%d%d%d\", &n, &m, &s);\n \n int dp[50][3001]={0};\n if (n == 0) break;\n dp[0][0] = 1;\n \n for (int i = 1; i <= m; i++){\n for (int j = n * n; j >= 1; j--){\n for (int k = i; k <= s; k++){\n dp[j][k] += dp[j - 1][k - i];\n if (dp[j][k] >= 100000){\n dp[j][k] -= 100000;\n }\n }\n }\n }\n \n printf(\"%d\\n\", dp[n * n][s]);\n }\n \n return (0);\n}\n\t\n", "// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0537\n// status:\n// tag: [DP]\n\n#define SUBMIT\n//#define DEBUG\n\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing ui64 = unsigned long long;\nusing i64 = long long;\n\nconst int MOD = 100000;\n// dp[i][j] 場所iで今の合計がjになる組み合わせの数\nint dp[7 * 7 + 1][3000 + 1];\nint N, M, S;\n\n// 1以上M以下の自然数のみを用いてSのN分割を求める\nint solve(int N, int M, int S, int mod) {\n // init\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n\n for (int m = 1; m <= M; ++m) { // 使える自然数\n for (int n = N * N; n >= 1; --n) { // 今の位置\n for (int s = m; s <= S; ++s) { // 総和\n dp[n][s] = (dp[n][s] + dp[n - 1][s - m]) % mod;\n }\n }\n }\n\n return dp[N * N][S];\n}\n\nint main() {\n#ifdef SUBMIT\n auto& stream = cin;\n#else\n stringstream stream(R\"(3 9 45\n3 100 50\n5 50 685\n0 0 0\n)\");\n#endif\n while (true) {\n stream >> N >> M >> S;\n if (N == 0 && M == 0 && S == 0) break;\n\n auto ans = solve(N, M, S, MOD);\n cout << ans << endl;\n }\n return 0;\n}\n", "#include<iostream>\n#include<cstring>\nusing namespace std;\n \nconst int MOD = 100000;\nint n, m, s;\nint dp[2][2001][3001];\nint main()\n{\n while(cin >> n >> m >> s && n && m && s){\n memset(dp, 0, sizeof dp); \n int ans = 0;\n dp[0][0][0] = 1;\n \n for(int i = 1; i <= n * n; i++){\n for(int j = 1; j <= m; j++)\n\tfor(int k = j; k <= s; k++)\n\t dp[i % 2][j][k] = (dp[i % 2][j - 1][k - 1] + dp[(i + 1) % 2][j - 1][k - j]) % MOD; \n \n memset(dp[(i + 1) % 2], 0, sizeof dp[(i + 1) % 2]);\n \n \n }\n \n for(int i = 1; i <= m; i++)\n ans = (ans + dp[n * n % 2][i][s]) % MOD;\n cout << ans << endl;\n }\n return 0;\n}", "\n#include <stdio.h>\n#include <string.h>\n#include <array>\n\nusing namespace std;\n\nint n, m, s;\n\narray<array<array<int, 3001>, 2001>,2>memo;\n\n\nint main()\n{\n\tfor (;;)\n\t{\n\t\tscanf(\"%d %d %d\",&n,&m,&s);\n\t\tif (n == 0)break;\n\t\tfor (int i = 0; i <= n*n; ++i)\n\t\t{\n\t\t\tfor (int j = 0; j <= m; ++j)\n\t\t\t{\n\t\t\t\tfor (int k = 0; k <= s; ++k)\n\t\t\t\t{\n\t\t\t\t\tint ans = 0;\n\t\t\t\t\tif (i == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (j == 0 && k == 0)ans = 1;\n\t\t\t\t\t\telse ans = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif (j <= 0 || k < j)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tans = memo[(i - 1) % 2 ][j - 1][k - j] + memo[i % 2][j - 1][k - 1];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tmemo[i % 2][j][k] = ans % 100000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 0; i <= m; ++i)\n\t\t{\n\t\t\tans += memo[(n*n) % 2][i][s];\n\t\t\tans %= 100000;\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}", "#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\n\nint _now[50*3001];\nint _next[50*3001];\n\nint main(){\n\twhile(1){\n\t\tint n,m,s;\n\t\tscanf(\"%d%d%d\",&n,&m,&s);\n\t\tif(n==0&&m==0&&s==0)\n\t\t\tbreak;\n\t\tint* now = _now;\n\t\tfill(now,now+(n*n+1)*(s+1),0);\n\t\tint* next = _next;\n\t\tfill(next,next+(n*n+1)*(s+1),0);\n\t\tnow[0] = 1;\n\t\tfor(int i=1;i<=m;i++){\n\t\t\tfor(int j=0;j<=n*n;j++){\n\t\t\t\tfor(int k=0;k<=s;k++){\n\t\t\t\t\tif(k+i<=s && j < n*n){\n\t\t\t\t\t\tnext[(j+1)*(s+1)+k+i] += now[j*(s+1)+k];\n\t\t\t\t\t\tif(next[(j+1)*(s+1)+k+i] >= 100000)\n\t\t\t\t\t\t\tnext[(j+1)*(s+1)+k+i] -= 100000;\n\t\t\t\t\t}\n\t\t\t\t\tnext[j*(s+1)+k] += now[j*(s+1)+k];\n\t\t\t\t\tif(next[j*(s+1)+k] >= 100000)\n\t\t\t\t\t\tnext[j*(s+1)+k] -= 100000;\n\t\t\t\t\tnow[j*(s+1)+k] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tswap(now,next);\n\t\t}\n\t\tprintf(\"%d\\n\",now[(n*n)*(s+1)+s]);\n\t}\n}", "#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint n,m,s;\nint dp[50][3001];\n\nint main() {\n while(cin>>n>>m>>s, n|m|s) {\n memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n // ????????????\n for (int i=1; i<=m; ++i)\n for (int j=n*n; j>0; --j)\n for (int k=s; k>=i; --k)\n dp[j][k] = (dp[j][k] + dp[j-1][k-i])%100000;\n cout<<dp[n*n][s]<<endl;\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint dp[10][55][3010] = {0};\nint main()\n{\n int N,M,S;\n while(scanf(\"%d%d%d\",&N,&M,&S),N + M + S)\n {\n for(int i = 1; i < N * N + 1; i++)\n {\n for(int j = 1; j < S + 1; j++)\n {\n dp[0][i][j] = 0;\n }\n }\n for(int i = 1; i < M + 1; i++)\n {\n for(int j = 1; j < N * N + 1; j++)\n {\n for(int k = 1; k < S + 1; k++)\n {\n dp[1][j][k] = 0;\n if(j == 1)\n {\n dp[1][j][k] = dp[0][j][k];\n if(i == k)dp[1][j][k]++;\n }\n else\n {\n dp[1][j][k] = dp[0][j][k];\n if(k > i)dp[1][j][k] = (dp[1][j][k] + dp[0][j - 1][k - i]) % 100000;\n }\n }\n }\n for(int j = 1; j < N * N + 1; j++)\n {\n for(int k = 1; k < S + 1; k++)\n {\n dp[0][j][k] = dp[1][j][k];\n dp[1][j][k] = 0;\n }\n }\n }\n printf(\"%d\\n\",dp[0][N * N][S]);\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n,m,s;\n while(scanf(\"%d %d %d\",&n,&m,&s),n!=0&&m!=0&&s!=0){\n int sum[50][3001] = {};\n sum[0][0] = 1;\n for(int i=1;i<=m;i++){\n for(int j=min(i,n*n);j>0;j--){\n\tfor(int k=i;k<=s;k++){\n\t sum[j][k] = (sum[j][k] + sum[j-1][k-i])%100000;\n\t}\n }\n }\n printf(\"%d\\n\",sum[n*n][s]);\n }\n return (0);\n}" ]
Mr. Dango's family has an extremely huge number of members. Once it had about 100 members, and now it has as many as population of a city. It is jokingly guessed that the member might fill this planet in the near future. Mr. Dango's family, the huge family, is getting their new house. Scale of the house is as large as that of town. They all had warm and gracious personality and were close each other. However, in this year the two members of them became to hate each other. Since the two members had enormous influence in the family, they were split into two groups. They hope that the two groups don't meet each other in the new house. Though they are in the same building, they can avoid to meet each other by adjusting passageways. Now, you have a figure of room layout. Your task is written below. You have to decide the two groups each room should belong to. Besides you must make it impossible that they move from any rooms belonging to one group to any rooms belonging to the other group. All of the rooms need to belong to exactly one group. And any group has at least one room. To do the task, you can cancel building passageway. Because the house is under construction, to cancel causes some cost. You'll be given the number of rooms and information of passageway. You have to do the task by the lowest cost. Please answer the lowest cost. By characteristics of Mr. Dango's family, they move very slowly. So all passageways are escalators. Because of it, the passageways are one-way. Constraints * 2 ≤ n ≤ 100 * -10,000 ≤ Ci ≤ 10,000 * Y1 ... Ym can't be duplicated integer by each other. Input The input consists of multiple datasets. Each dataset is given in the following format. n m X1 Y1 C1 ... Xm Ym Cm All numbers in each datasets are integers. The integers in each line are separated by a space. The first line of each datasets contains two integers. n is the number of rooms in the house, m is the number of passageways in the house. Each room is indexed from 0 to n-1. Each of following m lines gives the details of the passageways in the house. Each line contains three integers. The first integer Xi is an index of the room, the starting point of the passageway. The second integer Yi is an index of the room, the end point of the passageway. The third integer Ci is the cost to cancel construction of the passageway. The passageways, they are escalators, are one-way. The last dataset is followed by a line containing two zeros (separated by a space). Output For each dataset, print the lowest cost in a line. You may assume that the all of integers of both the answers and the input can be represented by 32 bits signed integers. Example Input 3 2 0 1 2 1 2 1 2 1 0 1 100 2 1 0 1 0 2 1 0 1 -1 0 0 Output 1 100 0 -1
[ "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define peri(i,a,b) for(int i=int(b);i-->int(a);)\n#define rep(i,n) repi(i,0,n)\n#define per(i,n) peri(i,0,n)\n#define all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nstruct UnionFind{\n\tvi data;\n\tUnionFind(int n):data(n,-1){}\n\tint Find(int i){\n\t\treturn data[i]<0?i:(data[i]=Find(data[i]));\n\t}\n\tbool Unite(int a,int b){\n\t\ta=Find(a),b=Find(b);\n\t\tif(a==b) return false;\n\t\tif(-data[a]<-data[b]) swap(a,b);\n\t\tdata[a]+=data[b];\n\t\tdata[b]=a;\n\t\treturn true;\n\t}\n\tint Size(int i){\n\t\treturn -data[Find(i)];\n\t}\n};\n\nstruct Edge{\n\tint src,dst,weight;\n\tEdge(){}\n\tEdge(int s,int d,int w):src(s),dst(d),weight(w){}\n};\ntypedef vector<vector<Edge>> Graph;\n\nint main()\n{\n\tfor(int n,m;cin>>n>>m && n|m;){\n\t\tvector<Edge> es;\n\t\tint neg=0;\n\t\trep(i,m){\n\t\t\tint u,v,w; cin>>u>>v>>w;\n\t\t\tif(w<=0) neg+=w;\n\t\t\telse es.emplace_back(u,v,w);\n\t\t}\n\t\tm=es.size();\n\t\t\n\t\tint res=INF;\n\t\t{\n\t\t\tUnionFind uf(n);\n\t\t\tint cc=n;\n\t\t\trep(i,m)\n\t\t\t\tcc-=uf.Unite(es[i].src,es[i].dst);\n\t\t\tif(cc>=2) res=0;\n\t\t}\n\t\t{\n\t\t\trep(i,m){\n\t\t\t\tvi use(m,1); use[i]=0;\n\t\t\t\tUnionFind uf(n);\n\t\t\t\tint cc=n;\n\t\t\t\trep(j,m) if(use[j])\n\t\t\t\t\tcc-=uf.Unite(es[j].src,es[j].dst);\n\t\t\t\tif(cc>=2) res=min(res,es[i].weight);\n\t\t\t}\n\t\t}\n\t\t{\n\t\t\trep(i,m) repi(j,i+1,m){\n\t\t\t\tvi use(m,1); use[i]=use[j]=0;\n\t\t\t\tUnionFind uf(n);\n\t\t\t\tint cc=n;\n\t\t\t\trep(k,m) if(use[k])\n\t\t\t\t\tcc-=uf.Unite(es[k].src,es[k].dst);\n\t\t\t\tif(cc>=2) res=min(res,es[i].weight+es[j].weight);\n\t\t\t}\n\t\t}\n\t\tcout<<neg+res<<endl;\n\t}\n}", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n \nusing namespace std;\n \n \n#define INF (1<<29)\n \n// math\n#define Sq(x) ((x)*(x))\n \n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n \n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n \n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n \n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n \ntypedef long long ll;\n \n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n \n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n \n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n \n//////////////////////////////////////////////////////////////\n \n \nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n \n#define MAX_E (200)\n \nvector<Edge> es[MAX_E];\nint N, M;\n \nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n if(e->id != x && !used[e->to]) {\n used[e->to] = 1;\n NEXT.PB(e->to);\n }\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n \nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n es[s].PB(Edge(t, c, id));\n es[t].PB(Edge(s, c, id));\n cost.PB(c);\n id ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n ans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n \nusing namespace std;\n \n \n#define INF (1<<29)\n \n// math\n#define Sq(x) ((x)*(x))\n \n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n \n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n \n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n \n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n \ntypedef long long ll;\n \n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n \n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n \n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n \n//////////////////////////////////////////////////////////////\n \n \nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n \n#define MAX_E (99)\n \nvector<Edge> es[MAX_E];\nint N, M;\n \nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n if(e->id != x && !used[e->to]) {\n used[e->to] = 1;\n NEXT.PB(e->to);\n }\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n \nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n es[s].PB(Edge(t, c, id));\n es[t].PB(Edge(s, c, id));\n cost.PB(c);\n id ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n ans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <map>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\nstruct edge{\n\tint u, v, cost;\n\tedge(int u_, int v_, int cost_){\n\t\tu = u_; v = v_; cost = cost_;\n\t}\n};\nbool operator<(const edge &a, const edge &b){\n\treturn a.cost < b.cost;\n}\n\n\n// Union-Find\nstruct union_find{\n\tvector<int> par, rank;\n\t\n\t// テ」ツつウテ」ツδウテ」ツつケテ」ツδ暗」ツδゥテ」ツつッテ」ツつソテ」ツ?ァテ・ツ按敕ヲツ慊淌・ツ個?\n\tunion_find(int n){\n\t\tpar = vector<int>( n );\n\t\trank = vector<int>( n , 0 );\n\t\tfor(int i=0 ; i < n ; i++ ){\n\t\t\tpar[i] = i;\n\t\t}\n\t}\n\t// x テ」ツ?ョ root テ」ツつ津ィツソツ氾」ツ??\n\tint find(int x){\n\t\treturn ( par[x] == x )? x : (par[x] = find(par[x]) ) ;\n\t}\n\t// x テ」ツ?ィ y テ」ツ?ョテ・ツアツ榲」ツ?凖」ツつ凝ゥツ崢?・ツ青暗」ツつ津、ツスツオテ・ツ青暗」ツ?凖」ツつ?\n\tvoid unite(int x, int y){\n\t\tx = find(x);\n\t\ty = find(y);\n\t\tif( x == y ) return;\n\t\t\n\t\tif( rank[x] < rank[y] ){\n\t\t\tpar[x] = y;\n\t\t}else{\n\t\t\tpar[y] = x;\n\t\t\tif( rank[x] == rank[y] )\n\t\t\t\trank[x]++;\n\t\t}\n\t}\n\t// x テ」ツ?ィ y テ」ツ?古・ツ青古」ツ?佚ゥツ崢?・ツ青暗」ツ?ォテ・ツアツ榲」ツ?凖」ツつ凝」ツ?凝」ツ?ゥテ」ツ??」ツ??\n\tbool same(int x, int y){\n\t\treturn find(x) == find(y);\n\t}\n\t// テゥツ崢?・ツ青暗」ツ?ョテヲツ閉ーテ」ツつ津ィツソツ氾」ツ??\n\tint size(){\n\t\tset<int> s;\n\t\tfor(int i=0 ; i < par.size() ; i++ ){\n\t\t\ts.insert( this->find(i) );\n\t\t}\n\t\treturn s.size();\n\t}\n};\n\ntypedef pair<int,int> P;\nconst int INF = 1e+8;\nconst int MAX_V = 101;\nint N, M;\n\nint connect(const vector<set<int> > &G, vector<edge> e = vector<edge>() ){\n\tunion_find uf(N);\n\tfor(int u=0 ; u < N ; u++ ){\n\t\tset<int> s = G[u];\n\t\tfor(set<int>::iterator it = s.begin() ; it != s.end() ; ++it ){\n\t\t\tint v = *it;\n\t\t\tbool flag = true;\n\t\t\tfor(int k=0 ; k < e.size() ; k++ ){\n\t\t\t\tif( e[k].u == u && e[k].v == v ) flag = false;\n\t\t\t\tif( e[k].u == v && e[k].v == u ) flag = false;\n\t\t\t}\n\t\t\tif( flag ) uf.unite(u, v);\n\t\t}\n\t}\n\treturn uf.size();\n}\n\nint main(){\n\n\t// テ・ツ?・テ・ツ環?\n\twhile( cin >> N >> M , N || M ){\n\t\tvector<set<int> > G(MAX_V);\n\t\tvector<edge> e;\n\t\t\n\t\tint ans = 0;\n\t\tfor(int i=0 ; i < M ; i++ ){\n\t\t\tint x, y, c;\n\t\t\tcin >> x >> y >> c;\n\t\t\t\n\t\t\tif( c <= 0 ){ // テ」ツつウテ」ツつケテ」ツδ暗」ツ?古ィツイツ?」ツ?ョテ」ツつづ」ツ?ョテ」ツ?ッテ」ツ?凖」ツ?ケテ」ツ?ヲテ・ツ渉姪」ツつ甘ゥツ卍、テ」ツ??\n\t\t\t\tans += c;\n\t\t\t}else{\n\t\t\t\te.push_back( edge(x, y, c) );\n\t\t\t\tG[x].insert(y);\n\t\t\t\tG[y].insert(x);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif( 2 <= connect(G) ){ // テゥツ?」テァツオツ静ヲツ按静・ツ按?」ツ??テ・ツ?凝、ツサツ・テ、ツクツ甘」ツ?ョテ」ツ?ィテ」ツ??\n\t\t\tcout << ans << endl;\n\t\t}else{ // テゥツ?」テァツオツ静ヲツ按静・ツ按?」ツ??テ・ツ?凝」ツ?ョテ」ツ?ィテ」ツ??\n\t\t\tbool flag = false;\n\t\t\tint sum_cost = ans;\n\t\t\t// テ」ツつィテ」ツδε」ツつクテ」ツつ津ゥツォツ佚」ツ??テ・ツ?凝・ツ渉姪」ツつ甘ゥツ卍、テ」ツ??」ツ?淌」ツ?ィテ」ツ?催」ツつ津・ツ?ィテゥツδィティツゥツヲテ」ツ??\n\t\t\tfor(int i=0 ; i < e.size() ; i++ ){\n\t\t\t\tvector<edge> e_;\n\t\t\t\te_.push_back( e[i] );\n\t\t\t\t\n\t\t\t\tif( 2 <= connect(G, e_) ){\n\t\t\t\t\tif( !flag ){\n\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\tans = sum_cost + e[i].cost;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tans = min(ans, sum_cost + e[i].cost);\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tfor(int j=i+1 ; j < e.size() ; j++ ){\n\t\t\t\t\t\te_.push_back( e[j] );\n\t\t\t\t\t\tif( 2 <= connect(G, e_) ){\n\t\t\t\t\t\t\tif( !flag ){\n\t\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\t\tans = sum_cost + e[i].cost + e[j].cost;\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tans = min(ans, sum_cost + e[i].cost + e[j].cost);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n}", "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n\nstatic const double EPS = 1e-8;\n\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int d = dfs(e.to,min(flow,e.flow),sink);\n if(d <= 0) continue;\n\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n }\n\n int res = numeric_limits<int>::max();\n\n for(int house_i = 1; house_i< num_of_houses; house_i++){\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(0,house_i));\n }\n printf(\"%d\\n\",bonus + res);\n }\n}", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<climits>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX 200\n\nusing namespace std;\n\nstruct Data{\n int from,to,cost,index;\n Data(int from=-1,int to=-1,int cost=-1,int index=-1):from(from),to(to),cost(cost),index(index){}\n};\n\nint V,E;\nvector<Data> G[MAX];\nbool visited[MAX];\n\nvoid isconnect(int cur,int &counter,int *ban){\n if(visited[cur])return;\n visited[cur] = true;\n counter++;\n rep(i,G[cur].size()){\n if( ban[0] == G[cur][i].index || ban[1] == G[cur][i].index ) continue;\n isconnect(G[cur][i].to,counter,ban);\n }\n}\n\nint main(){\n while(cin >> V >> E,V|E){\n Data *input = new Data[E];\n int mincost = IINF,coef = 0;\n rep(i,V)G[i].clear();\n rep(i,E){\n cin >> input[i].from >> input[i].to >> input[i].cost;\n input[i].index = i;\n if( input[i].cost < 0 ) coef += input[i].cost;\n else {\n\tG[input[i].from].push_back(input[i]);\n\tG[input[i].to].push_back(Data(input[i].to,input[i].from,input[i].cost,input[i].index));\n }\n }\n\n int counter = 0;\n int ban[2] = {-1,-1};\n rep(i,V)visited[i] = false;\n isconnect(0,counter,ban);\n if(counter != V)mincost = min(mincost,coef);\n\n rep(i,E){\n if( input[i].cost < 0 ) continue;\n rep(j,E){\n\tif( input[j].cost < 0 ) continue;\n\trep(k,V)visited[k] = false;\n\tban[0] = i, ban[1] = j;\n\tcounter = 0;\n\tisconnect(0,counter,ban);\n\tif( counter != V )mincost = min(mincost,coef+input[i].cost+((i==j)?0:input[j].cost));\n }\n }\n cout << mincost << endl;\n\n delete [] input;\n }\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <cmath>\n#include <string>\n#include <cctype>\n#include <map>\n#include <iomanip>\n \nusing namespace std;\n \n#define eps 1e-8\n#define pi acos(-1.0)\n#define inf 1<<30\n#define linf 1LL<<60\n#define pb push_back\n#define lc(x) (x << 1)\n#define rc(x) (x << 1 | 1)\n#define lowbit(x) (x & (-x))\n#define ll long long\n#define maxn 110\n\nint maz[maxn][maxn];\nint n,m;\n\nint stoer_wagner(int n){\n bool vis[maxn];\n int node[maxn],dis[maxn];\n int maxj,prev;\n int ans=inf;\n memset(dis,0,sizeof(dis));\n for (int i=0; i<n; i++)node[i]=i;\n while (n>1) {\n prev=0;\n maxj=1;\n memset(vis,false,sizeof(vis));\n vis[node[0]]=true;\n for (int i=1; i<n; i++) { \n dis[node[i]]=maz[node[0]][node[i]];\n if (dis[node[i]]>dis[node[maxj]])\n maxj=i; \n } \n for (int i=1; i<n; i++) {\n if (i==n-1) { //蜿ェ蜑ゥ譛?錘荳?クェ轤ケ蟆ア蠑?ァ句粋蟷カ轤ケ\n ans=(dis[node[maxj]]<ans?dis[node[maxj]]:ans);\n for (int k=0; k<n; k++) {//蜷亥ケカ轤ケ?梧峩譁ー霎ケ譚??邉サ\n maz[node[k]][node[prev]]+=maz[node[k]][node[maxj]];\n maz[node[prev]][node[k]]=maz[node[k]][node[prev]];\n } \n node[maxj]=node[--n];//郛ゥ轤ケ\n } \n prev=maxj;\n vis[node[maxj]]=true;\n maxj=-1;\n for (int k=1; k<n; k++) {\n if(!vis[node[k]]) {\n dis[node[k]]+=maz[node[prev]][node[k]];\n if(maxj==-1 || dis[node[k]]>dis[node[maxj]])\n maxj=k; \n } \n }\n }\n }\n return ans;\n}\n\nint main(){\n while(~scanf(\"%d%d\",&n,&m)){\n\t\tif(n==0&&m==0)\tbreak;\n memset(maz,0,sizeof(maz));\n int a,b,c,res=0; \n for (int i=0; i<m; i++) {\n scanf(\"%d%d%d\",&a,&b,&c);\n\t\t\tif(c<0){\n\t\t\t\tres+=c;\n\t\t\tcontinue;\n\t\t\t}\n maz[a][b]+=c;\n maz[b][a]+=c;\n } \n printf(\"%d\\n\",stoer_wagner(n)+res);\n }\n return 0; \n}", "//58\n#include<iostream>\n#include<vector>\n#include<set>\n\nusing namespace std;\n\nstruct E{\n int x,y,c;\n};\n\nint n,m;\nint p[100];\n\nint find(int x){\n return p[x]==x?x:p[x]=find(p[x]);\n}\n\nvoid unite(int a,int b){\n p[find(a)]=find(b);\n}\n\nint ds(vector<E> v){\n for(int i=0;i<n;i++){\n p[i]=i;\n }\n for(int i=0;i<v.size();i++){\n unite(v[i].x,v[i].y);\n }\n set<int> r;\n for(int i=0;i<n;i++){\n r.insert(find(i));\n }\n return r.size();\n}\n\nint rec(vector<E> v,int d,int c){\n if(d>2){\n return 1<<30;\n }else{\n if(ds(v)>1){\n return c;\n }else{\n int m=1<<30;\n for(int i=0;i<v.size();i++){\n\tvector<E> nv=v;\n\tint nc=c+nv[i].c;\n\tnv.erase(nv.begin()+i);\n\tm=min(m,rec(nv,d+1,nc));\n }\n return m;\n }\n }\n}\n\t \nint main(){\n while(cin>>n>>m,n|m){\n int s=0;\n vector<E> v;\n while(m--){\n int x,y,c;\n cin>>x>>y>>c;\n if(c>0){\n\tE e={x,y,c};\n\tv.push_back(e);\n }else{\n\ts+=c;\n }\n }\n cout<<rec(v,0,s)<<endl;\n }\n return 0;\n}\n\n\n \n ", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n \nusing namespace std;\n \n \n#define INF (1<<29)\n \n// math\n#define Sq(x) ((x)*(x))\n \n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n \n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n \n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n \n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n \ntypedef long long ll;\n \n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n \n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n \n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n \n//////////////////////////////////////////////////////////////\n \n \nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n \n#define MAX_E (198)\n \nvector<Edge> es[MAX_E];\nint N, M;\n \nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n if(e->id != x && !used[e->to]) {\n used[e->to] = 1;\n NEXT.PB(e->to);\n }\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n \nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n es[s].PB(Edge(t, c, id));\n es[t].PB(Edge(s, c, id));\n cost.PB(c);\n id ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n ans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}", "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 110\n#define INF INT_MAX\ntypedef pair<int, int> pii;\n\nstruct Edge {\n int from, to, cost;\n Edge(int from, int to, int cost) :\n from(from), to(to), cost(cost) {}\n};\n\nint N, M;\nvector<Edge> G[MAX], cycle;\n\nint color[MAX];\n \nvoid dfs(int v, vector<Edge> u)\n{\n color[v] = 0;\n for(int i = 0; i < (int)G[v].size(); i++) {\n Edge e = G[v][i];\n int to = e.to;\n u.push_back(e);\n if (color[to] == -1) {\n dfs(to, u);\n } else if(color[to] == 0) {\n cycle = u;\n throw 0; \n }\n u.pop_back();\n }\n color[v] = 1;\n}\n\nbool is_cycle_detect()\n{\n vector<Edge> vec;\n memset(color, -1, sizeof(color));\n for (int i = 0; i < N; i++) {\n try {\n if (color[i] == -1) {\n dfs(i, vec);\n }\n } catch (...) {\n break;\n }\n vec.clear();\n }\n return (cycle.size() > 0);\n}\n\nvoid init()\n{\n cycle.clear();\n for (int i = 0; i < MAX; i++) {\n G[i].clear();\n }\n}\n\nclass Union_Find {\n public:\n int par[MAX], rank[MAX], size[MAX], gnum;\n \n Union_Find(int N) {\n gnum = N;\n for (int i = 0; i < N; i++) {\n par[i] = i;\n rank[i] = 0;\n size[i] = 1;\n }\n }\n\n int find(int x)\n {\n if (par[x] == x) {\n return x;\n }\n return par[x] = find(par[x]);\n }\n\n void unite(int x, int y)\n {\n x = find(x);\n y = find(y);\n if (x == y) return;\n \n if (rank[x] < rank[y]) {\n par[x] = y;\n size[y] += size[x];\n } else {\n par[y] = x;\n size[x] += size[y];\n if (rank[x] == rank[y]) {\n rank[x]++;\n }\n }\n gnum--;\n }\n\n bool same(int x, int y)\n {\n return (find(x) == find(y));\n }\n\n int getSize(int x)\n {\n return size[find(x)];\n }\n\n int groups()\n {\n return gnum;\n }\n};\n\nint main()\n{\n int s, t, cost;\n while (cin >> N >> M, N) {\n int res = 0, min_cost = INF;\n init();\n Union_Find uf(N);\n for (int i = 0; i < M; i++) {\n cin >> s >> t >> cost;\n if (cost > 0) {\n G[s].push_back(Edge(s, t, cost));\n uf.unite(s, t);\n min_cost = min(min_cost, cost);\n } else {\n res += cost;\n } \n }\n \n if (uf.gnum == 1) {\n if (is_cycle_detect()) {\n min_cost = INF;\n set<pii> st;\n vector<int> v;\n for (int i = 0; i < (int)cycle.size(); i++) {\n v.push_back(cycle[i].cost);\n st.insert(pii(cycle[i].from, cycle[i].to));\n }\n sort(v.begin(), v.end());\n min_cost = v[0] + v[1];\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < (int)G[i].size(); j++) {\n Edge &e = G[i][j]; \n if (st.count(pii(e.from, e.to)) == 0) {\n min_cost = min(min_cost, e.cost);\n }\n }\n }\n } \n } else {\n min_cost = 0;\n }\n cout << res + min_cost << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\nstruct Edge{\n int src, dst, cap, rev;\n Edge(int u, int v, int c, int r) : \n src(u), dst(v), cap(c), rev(r) {}\n};\ntypedef vector<Edge> Node;\ntypedef vector<Node> Graph;\nvoid add_edge(Graph& G, int a, int b, int c){\n G[a].push_back(Edge(a, b, c, G[b].size()));\n G[b].push_back(Edge(b, a, c, G[a].size() - 1));\n}\nint dfs(Graph& G, int u, int t, int f, vector<bool>& used){\n if(u == t) return f;\n used[u] = true;\n FORIT(e, G[u])if(e->cap > 0 && !used[e->dst]){\n int g = dfs(G, e->dst, t, min(f, e->cap), used);\n if(g > 0) {\n e->cap -= g;\n G[e->dst][e->rev].cap += g;\n return g;\n }\n }\n return 0;\n}\nint max_flow(Graph G, int s, int t){\n int N = G.size();\n int flow = 0;\n while(true){\n vector<bool> used(N, false);\n int f = dfs(G, s, t, INF, used);\n if(f == 0) return flow;\n flow += f;\n }\n}\n\nint main(){\n int N, M;\n while(cin >> N >> M && N){\n Graph G(N);\n int minus = 0;\n REP(i, M){\n int a, b, c;\n cin >> a >> b >> c;\n if(c <= 0){\n minus += c;\n continue;\n }\n add_edge(G, a, b, c);\n }\n int ans = INF;\n FOR(t, 1, N){\n ans = min(ans, max_flow(G, 0, t));\n }\n cout << ans + minus << endl;\n }\n return 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <set>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n#define min(a,b) ((a)<(b)?(a):(b))\n#define max(a,b) ((a)>(b)?(a):(b))\ntypedef long long LL;\n#define NN 120\n#define INF 1LL << 60\n\nLL vis[NN];\nLL wet[NN];\nLL combine[NN];\nLL map[NN][NN];\nLL S, T, minCut, N;\nvoid Search(){\n LL i, j, Max, tmp;\n memset(vis, 0, sizeof(vis));\n memset(wet, 0, sizeof(wet));\n S = T = -1;\n for (i = 0; i < N; i++){\n Max = -INF;\n for (j = 0; j < N; j++){\n if (!combine[j] && !vis[j] && wet[j] > Max){\n tmp = j;\n Max = wet[j];\n }\n }\n if (T == tmp) return;\n S = T; T = tmp;\n minCut = Max;\n vis[tmp] = 1;\n for (j = 0; j < N; j++){\n if (!combine[j] && !vis[j]){\n wet[j] += map[tmp][j];\n }\n }\n }\n}\nLL Stoer_Wagner(){\n LL i, j;\n memset(combine, 0, sizeof(combine));\n LL ans = INF;\n for (i = 0; i < N - 1; i++){\n Search();\n if (minCut < ans) ans = minCut;\n if (ans == 0) return 0;\n combine[T] = 1;\n for (j = 0; j < N; j++){\n if (!combine[j]){\n map[S][j] += map[T][j];\n map[j][S] += map[j][T];\n }\n }\n }\n return ans;\n}\nint main(){\n\tLL u, v, m, c;\n\twhile( scanf(\"%lld%lld\", &N, &m) && (N+m) ){\n\t\tmemset( map, 0, sizeof( map ) );\n\t\tLL ans = 0;\n\t\tfor(LL i=0 ; i < m ; ++i){\n\t\t\tscanf(\"%lld%lld%lld\", &u, &v, &c);\n\t\t\tif( c < 0 ) ans += c;\n\t\t\telse if( u != v ){\n\t\t\t\tmap[u][v] += c;\n\t\t\t\tmap[v][u] += c;\n\t\t\t}\n\t\t}\n\t\tans += Stoer_Wagner();\n\t\tprintf(\"%lld\\n\", ans);\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cmath>\n#include <cstdio>\nusing namespace std;\n#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\n\n#define INF (1ll<<60)\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n\ntypedef long long Weight;\nstruct Edge {\n int src, dst;\n Weight weight;\n Edge(int src, int dst, Weight weight) :\n src(src), dst(dst), weight(weight) { }\n};\nbool operator < (const Edge &e, const Edge &f) {\n return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\n e.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n\n\n\nWeight minimumCut(const Graph &g) {\n int n = g.size();\n vector< vector<Weight> > h(n, vector<Weight>(n)); // make adj. matrix\n REP(u,n) FOR(e,g[u]) h[e->src][e->dst] += e->weight;\n vector<int> V(n); REP(u, n) V[u] = u;\n\n Weight cut = INF;\n for(int m = n; m > 1; m--) {\n vector<Weight> ws(m, 0);\n int u, v;\n Weight w;\n REP(k, m) {\n u = v; v = max_element(ws.begin(), ws.end())-ws.begin();\n w = ws[v]; ws[v] = -1;\n REP(i, m) if (ws[i] >= 0) ws[i] += h[V[v]][V[i]];\n }\n REP(i, m) {\n h[V[i]][V[u]] += h[V[i]][V[v]];\n h[V[u]][V[i]] += h[V[v]][V[i]];\n }\n V.erase(V.begin()+v);\n cut = min(cut, w);\n }\n return cut;\n}\n\n\nint main(){\n\tint n,m;\n\twhile(cin >> n >> m && n){\n\t\tGraph g(n);\n\t\tlong long ans = 0;\n\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\tint a,b,c;\n\t\t\tcin >> a >> b >> c;\n\t\t\tif( c <= 0 ) ans += c;\n\t\t\telse g[a].push_back(Edge(a,b,c)),g[b].push_back(Edge(b,a,c));\n\t\t}\n\n\t\tcout << ans+minimumCut(g) << endl;\n\t}\n\t\n}", "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n\nstatic const double EPS = 1e-8;\n\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int d = dfs(e.to,min(flow,e.flow),sink);\n if(d <= 0) continue;\n\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n\n ~FordFulkerson(){\n delete[] _graph;\n delete[] _used;\n }\n\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n }\n\n int res = numeric_limits<int>::max();\n\n for(int house_i = 1; house_i< num_of_houses; house_i++){\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(0,house_i));\n }\n printf(\"%d\\n\",bonus + res);\n }\n}", "#include <vector>\n#include <numeric>\n#include <algorithm>\n\nclass unionfind {\nprivate:\n\tint size_;\n\tstd::vector<int> parent;\n\tstd::vector<int> rank;\npublic:\n\tunionfind() : size_(0), parent(std::vector<int>()), rank(std::vector<int>()) {};\n\tunionfind(int size__) : size_(size__), parent(std::vector<int>(size_)), rank(std::vector<int>(size_, 0)) {\n\t\tstd::iota(parent.begin(), parent.end(), 0);\n\t}\n\tint size() { return size_; }\n\tint root(int x) {\n\t\tif (parent[x] == x) return x;\n\t\treturn parent[x] = root(parent[x]);\n\t}\n\tbool same(int x, int y) {\n\t\treturn root(x) == root(y);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = root(x); y = root(y);\n\t\tif (x == y) return;\n\t\tif (rank[x] < rank[y]) parent[x] = y;\n\t\telse if (rank[x] > rank[y]) parent[y] = x;\n\t\telse parent[y] = x, rank[x]++;\n\t}\n};\n\n#include <iostream>\nusing namespace std;\nint n, m, x[109], y[109]; long long c[109]; bool used[109];\nbool solve() {\n\tunionfind uf(n);\n\tfor (int i = 0; i < m; i++) {\n\t\tif (used[i]) uf.unite(x[i], y[i]);\n\t}\n\tint s = uf.root(0);\n\tfor (int i = 1; i < n; i++) {\n\t\tif (s != uf.root(i)) return true;\n\t}\n\treturn false;\n}\nint main() {\n\twhile (cin >> n >> m, n) {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x[i] >> y[i] >> c[i];\n\t\t\tif (c[i] > 0) used[i] = true;\n\t\t\telse used[i] = false, sum += c[i];\n\t\t}\n\t\tlong long ret = 1LL << 60;\n\t\tif (solve()) ret = sum;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tif (!used[i]) continue;\n\t\t\tused[i] = false;\n\t\t\tif (solve()) ret = min(ret, sum + c[i]);\n\t\t\tused[i] = true;\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tif (!used[i]) continue;\n\t\t\tused[i] = false;\n\t\t\tfor (int j = i + 1; j < m; j++) {\n\t\t\t\tif (!used[j]) continue;\n\t\t\t\tused[j] = false;\n\t\t\t\tif (solve()) ret = min(ret, sum + c[i] + c[j]);\n\t\t\t\tused[j] = true;\n\t\t\t}\n\t\t\tused[i] = true;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define pb push_back \n#define pf push_front \n#define mp make_pair\n#define fr first\n#define sc second\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\n#define All(v) v.begin(), v.end()\n\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\nconst int INF = 1107110711071107;\n\nvector<Pii> G[101];\nint min_bridge = INF;\nint ord[101], low[101];\nbool vis[101];\n\nvoid dfs(int v, int p, int &k) {\n vis[v] = true;\n\n ord[v] = k++;\n low[v] = ord[v];\n\n Rep(i, G[v].size()) {\n if ( !vis[G[v][i].fr] ) {\n dfs(G[v][i].fr, v, k);\n low[v] = min(low[v], low[G[v][i].fr]); \n if ( ord[v] < low[G[v][i].fr] ) min_bridge = min(min_bridge, G[v][i].sc);\n } else if ( G[v][i].fr != p ) {\n low[v] = min(low[v], ord[G[v][i].fr]);\n } \n }\n \n}\n\nvoid dfs2(int v) {\n if ( vis[v] ) return;\n vis[v] = true;\n Rep(i, G[v].size()) {\n dfs2(G[v][i].fr);\n } \n}\n\nsigned main() {\n int n, m;\n while ( cin >> n >> m, n | m ) {\n int minus_cost = 0;\n min_bridge = INF;\n int min_1 = INF, min_2 = INF;\n Rep(i, 101) {\n G[i].clear();\n vis[i] = false;\n }\n \n Rep(i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n if ( c <= 0 ) minus_cost += c;\n else {\n\tif ( min_1 > c ) min_2 = min_1, min_1 = c;\n\telse if ( min_2 > c ) min_2 = c;\n\tG[a].pb(Pii(b, c));\n\tG[b].pb(Pii(a, c));\n }\n }\n\n dfs2(0);\n bool is_connected = true;\n Rep(i, n) {\n if ( !vis[i] ) {\n\tis_connected = false;\n\tbreak;\n }\n }\n\n if ( !is_connected ) {\n cout << minus_cost << endl;\n continue;\n }\n \n Rep(i, n) vis[i] = false;\n int k = 0;\n Rep(i, n) {\n if ( !vis[i] ) dfs(i, -1, k);\n }\n\n if ( min_bridge == INF ) cout << minus_cost << endl;\n else cout << min(min_bridge, min_1+min_2) + minus_cost << endl;\n }\n\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <string>\n#include <queue>\nusing namespace std;\n#define SZ(v) ((int)(v).size())\nconst int maxint = -1u>>1;\nconst int maxn = 100 + 30;\ntypedef long long ll;\n\nint n, m;\nll adj[maxn][maxn];\nint f[maxn], bestf[maxn];\nint find(int v) {\n if (v != bestf[v]) {\n return bestf[v] = find(bestf[v]);\n }\n return v;\n}\nint bestff;\nint v[maxn];\nll w[maxn];\nbool a[maxn];\nvector<pair<int, int> > res;\nll mincut() {\n ll ans = (-1ull) >> 1;\n //for (int i = 0; i < n; ++i) {\n //for (int j = 0; j < n; ++j) {\n //adj[i][j] = -adj[i][j];\n //}\n //}\n for (int i = 0; i < n; ++i) {\n f[i] = v[i] = i;\n }\n for (int t = n; t > 1; --t) {\n a[0] = true;\n for (int i = 1; i < t; ++i) {\n a[i] =false;\n w[i] = adj[v[0]][v[i]];\n }\n int prev = v[0];\n for (int i = 1; i < t; ++i) {\n int zj = -1;\n for (int j = 1; j < t; ++j) {\n if (a[j] == false && (zj == -1 || w[j] > w[zj])) {\n zj = j;\n }\n }\n a[zj] = true;\n if (i == t - 1) {\n if (w[zj] < ans) {\n ans = w[zj];\n copy(f, f + n, bestf);\n bestff = v[zj];\n }\n for (int k = 0; k < t; ++k) {\n adj[v[k]][prev] = adj[prev][v[k]] += adj[v[zj]][v[k]];\n }\n f[v[zj]] = prev;\n v[zj] = v[t - 1];\n break;\n }\n prev = v[zj];\n for (int j = 1; j < t; ++j) {\n if (a[j] == false) {\n w[j] += adj[v[zj]][v[j]];\n }\n }\n }\n }\n //bool flag[maxn] = {};\n //for (int i = 0; i < n; ++i) {\n //if (find(i) == bestff) {\n //flag[i] = true;\n //}\n //}\n //res.clear();\n //for (int i = 0; i < n; ++i) {\n //for (int j = i + 1; j < n; ++j) {\n //if (flag[i] == flag[j] && save[i][j]) {\n //res.push_back(make_pair(i, j));\n //}\n //}\n //}\n return ans;\n}\n\nvoid gao() {\n ll ans = 0;\n memset(adj, 0, sizeof(adj));\n for (int i = 0, a, b; i < m; ++i) {\n ll c;\n scanf (\"%d%d%lld\", &a, &b, &c);\n if (c < 0) {\n ans += c;\n } else {\n adj[a][b] = adj[b][a] = adj[a][b] + c;\n }\n }\n printf(\"%lld\\n\", ans + mincut());\n}\n\nint main() {\n while (scanf(\"%d%d\", &n, &m) == 2 && (n || m)) {\n gao();\n }\n return 0;\n}", "#include<iostream>\n#include<vector>\n#include<cassert>\n#include<queue>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0 ; i < int(n); ++i)\n\nint main() {\n while (true) {\n long long n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) break;\n assert(n >= m);\n long long sum = 0, mn = 1234567890123456789LL, mn1 = 1234567890321456789LL;\n vector<pair<long long, pair<int, long long> > > edge[n];\n rep (i, m) {\n long long x, y, c;\n cin >> x >> y >> c;\n if (c <= 0) sum += c;\n else {\n\tif (c <= mn) {\n\t mn1 = mn;\n\t mn = c;\n\t} else if (c < mn1) {\n\t mn1 = c;\n\t}\n\tedge[x].push_back(make_pair(y, make_pair(i, c)));\n\tedge[y].push_back(make_pair(x, make_pair(i, c)));\n }\n }\n long long res = mn + mn1;\n {\n bool can[111][111] = {};\n rep (i, n) {\n\tqueue<long long> pos;\n\tpos.push(i);\n\twhile (!pos.empty()) {\n\t long long now = pos.front();\n\t pos.pop();\n\t if (can[i][now]) continue;\n\t can[i][now] = true;\n\t rep (j, edge[now].size()) {\n\t pos.push(edge[now][j].first);\n\t }\n\t}\n }\n rep (i, n) rep (j, n) if (!can[i][j] && !can[j][i]) {\n\tcout << sum << endl;\n\tgoto next;\n }\n }\n rep (iii, n) rep (jjj, edge[iii].size()) {\n bool can[111][111] = {};\n int num = edge[iii][jjj].second.first;\n rep (i, n) {\n\tqueue<long long> pos;\n\tpos.push(i);\n\twhile (!pos.empty()) {\n\t long long now = pos.front();\n\t pos.pop();\n\t if (can[i][now]) continue;\n\t can[i][now] = true;\n\t rep (j, edge[now].size()) {\n\t if (edge[now][j].second.first == num) continue;\n\t pos.push(edge[now][j].first);\n\t }\n\t}\n }\n rep (i, n) rep (j, n) if (!can[i][j] && !can[j][i]) {\n\tres = min(res, edge[iii][jjj].second.second);\n }\n }\n cout << sum + res << endl;\n next:;\n }\n return 0;\n}", "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\n//max flow (dinic)\ntemplate<class V> class MaxFlow_dinic{\npublic:\n struct edge{int to,reve;V cap;};\n static const int MV = 1100;\n vector<edge> E[MV];\n int itr[MV],lev[MV];\n\n void add_edge(int x,int y,V cap,bool undir=false){\n E[x].push_back((edge){y,(int)E[y].size(),cap});\n E[y].push_back((edge){x,(int)E[x].size()-1,undir?cap:0});\n }\n\n void bfs(int cur){\n memset(lev,0xff,sizeof(lev));\n queue<int> q;\n lev[cur]=0;\n q.push(cur);\n while(q.size()){\n int v=q.front();\n q.pop();\n for(__typeof(E[v].begin()) e=E[v].begin();e!=E[v].end();e++) if(e->cap>0&&lev[e->to]<0) lev[e->to]=lev[v]+1,q.push(e->to);\n }\n }\n\n V dfs(int from,int to,V cf){\n if(from==to){\n return cf;\n }\n for(;itr[from]<E[from].size();itr[from]++){\n edge* e=&E[from][itr[from]];\n if(e->cap>0&&lev[from]<lev[e->to]){\n V f=dfs(e->to,to,min(cf,e->cap));\n if(f>0){\n e->cap-=f;\n E[e->to][e->reve].cap += f;\n return f;\n }\n }\n }\n return 0;\n }\n\n V maxflow(int from,int to){\n V fl=0,tf;\n while(1){\n bfs(from);\n if(lev[to]<0) return fl;\n memset(itr,0,sizeof(itr));\n while((tf=dfs(from,to,numeric_limits<V>::max()))>0) fl+=tf;\n }\n }\n};\nvoid mainmain(){\n\tint n,m;\n\twhile(cin>>n>>m,n||m){\n\t\tll ans=INT_MAX;\n\t\tvint a(m),b(m),c(m);\n\t\trep(i,m) cin>>a[i]>>b[i]>>c[i];\n\t\treep(i,1,n){\n\t\t\tMaxFlow_dinic<ll> mf;\n\t\t\tint tmp=0;\n\t\t\trep(j,m){\n\t\t\t\tif(c[j]<0) tmp+=c[j];\n\t\t\t\telse mf.add_edge(a[j],b[j],(ll)c[j],true);\n\t\t\t}\n\t\t\tans=min(ans,tmp+mf.maxflow(0,i));\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}\n\n\nsigned main() {\n\tios_base::sync_with_stdio(false);\n \tcout<<fixed<<setprecision(0);\n mainmain();\n}", "#include <iostream>\n#include <cstdio>\n#include <cassert>\n#include <cstring>\n#include <vector>\n#include <valarray>\n#include <array>\n#include <queue>\n#include <set>\n#include <unordered_set>\n#include <map>\n#include <unordered_map>\n#include <algorithm>\n#include <cmath>\n#include <complex>\n#include <random>\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nconstexpr ll TEN(int n) {return (n==0)?1:10*TEN(n-1);}\nint bsr(int x) { return 31 - __builtin_clz(x); }\n\ntemplate <class E>\nusing Graph = vector<vector<E>>;\n\n// NOT VERIFY\ntemplate<class D, D INF>\nstruct BidirectedCut {\n D sum = INF;\n template<class E>\n BidirectedCut(Graph<E> g) {\n int n = (int)g.size();\n int m_a = -1, m_b = -1;\n vector<D> dist_base(n, 0);\n for (int m = n; m > 1; m--) {\n int a, b;\n auto dist = dist_base;\n for (int i = 0; i < m; i++) {\n a = b; b = max_element(begin(dist), end(dist)) - begin(dist);\n if (i == m-1) sum = min(sum, dist[b]);\n dist[b] = -INF;\n for (E &e: g[b]) {\n if (e.to == m_b) e.to = m_a;\n if (dist[e.to] == -INF) continue;\n dist[e.to] += e.dist;\n }\n }\n //merge a, b\n m_a = a; m_b = b;\n g[a].insert(end(g[a]), begin(g[b]), end(g[b]));\n g[b].clear();\n dist_base[b] = -INF;\n }\n }\n};\n\n/**\n * Dinic?????????????????§???\n *\n * ?????¨???????????¬????????????\n * template?????°???int V???????????°\n * Edge??????rev?????????\n * ---\n * void add_edge(Graph<Edge> &g, int from, int to, int cap) {\n * g[from].push_back(Edge{to, cap, (int)g[to].size()});\n * g[to].push_back(Edge{from, 0, (int)g[from].size()-1});\n * }\n * ---\n */\ntemplate<class C, C INF> // Cap\nstruct MaxFlow {\n int V;\n vector<int> level, iter;\n //g?????´?£????????????§??¨???\n template<class E>\n C exec(Graph<E> &g, int s, int t) { \n V = (int)g.size();\n level.resize(V);\n iter.resize(V);\n C flow = 0;\n while (true) {\n bfs(g, s);\n if (level[t] < 0) return flow;\n fill_n(iter.begin(), V, 0);\n while (true) {\n C f = dfs(g, s, t, INF);\n if (!f) break;\n flow += f;\n }\n }\n }\n\n template<class E>\n void bfs(const Graph<E> &g, int s) {\n fill_n(level.begin(), V, -1);\n queue<int> que;\n level[s] = 0;\n que.push(s);\n while (!que.empty()) {\n int v = que.front(); que.pop();\n for (E e: g[v]) {\n if (e.cap <= 0) continue;\n if (level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n que.push(e.to);\n }\n }\n }\n }\n\n template<class E>\n C dfs(Graph<E> &g, int v, int t, C f) {\n if (v == t) return f;\n C res = 0;\n for (int &i = iter[v]; i < (int)g[v].size(); i++) {\n E &e = g[v][i];\n if (e.cap <= 0) continue;\n if (level[v] < level[e.to]) {\n C d = dfs(g, e.to, t, min(f, e.cap));\n if (d <= 0) continue;\n e.cap -= d;\n g[e.to][e.rev].cap += d;\n return d;\n }\n }\n return res;\n }\n};\n\nint rand_int(int l, int r) { //[l, r)\n using D = uniform_int_distribution<int>;\n static random_device rd;\n static mt19937 gen(rd());\n return D(l, r-1)(gen);\n}\nbool solve() {\n int n, m;\n cin >> n >> m;\n if (!n) return false;\n struct Edge {\n int to;\n ll dist;\n };\n Graph<Edge> g(n);\n auto addEdge = [&](int a, int b, ll c) {\n g[a].push_back(Edge{b, c});\n g[b].push_back(Edge{a, c});\n };\n ll s = 0;\n for (int i = 0; i < m; i++) {\n int a, b; ll c;\n cin >> a >> b >> c;\n if (c < 0) {\n s += c;\n continue;\n }\n addEdge(a, b, c);\n }\n cout << s+BidirectedCut<ll, TEN(15)>(g).sum << endl;\n return true;\n}\n \nint main() {\n while (solve()) {}\n return 0;\n}", "#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<climits>\n#include<map>\n#include<set>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX 200\n\nusing namespace std;\n\nstruct Data{\n int from,to,cost,index;\n Data(int from=-1,int to=-1,int cost=-1,int index=-1):from(from),to(to),cost(cost),index(index){}\n};\n\nint V,E;\nvector<Data> G[MAX];\nbool visited[MAX];\n\nvoid isconnect(int cur,int &counter,int *ban){\n if(visited[cur])return;\n visited[cur] = true;\n counter++;\n rep(i,G[cur].size()){\n if( ban[0] == G[cur][i].index || ban[1] == G[cur][i].index ) continue;\n isconnect(G[cur][i].to,counter,ban);\n }\n}\n\nint main(){\n while(cin >> V >> E,V|E){\n Data *input = new Data[E];\n int mincost = IINF,coef = 0;\n rep(i,V)G[i].clear();\n rep(i,E){\n cin >> input[i].from >> input[i].to >> input[i].cost;\n input[i].index = i;\n if( input[i].cost < 0 ) coef += input[i].cost;\n else {\n\tG[input[i].from].push_back(input[i]);\n\tG[input[i].to].push_back(Data(input[i].to,input[i].from,input[i].cost,input[i].index));\n }\n }\n\n int counter = 0;\n int ban[2] = {-1,-1};\n rep(i,V)visited[i] = false;\n isconnect(0,counter,ban);\n if(counter != V)mincost = min(mincost,coef);\n\n rep(i,E){\n if( input[i].cost < 0 ) continue;\n rep(j,E){\n\tif( input[j].cost < 0 ) continue;\n\trep(k,V)visited[k] = false;\n\tban[0] = i, ban[1] = j;\n\tcounter = 0;\n\tisconnect(0,counter,ban);\n\tif( counter != V )mincost = min(mincost,coef+input[i].cost+((i==j)?0:input[j].cost));\n }\n }\n cout << mincost << endl;\n\n delete [] input;\n }\n return 0;\n}", "#include <iostream>\n#include <string>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <list>\n#include <algorithm>\n\nusing namespace std;\n\n#define typec long long\n#define V 111\ntypec g[V][V], w[V];\ntypec a[V], v[V], na[V];\n\ntypec Stoer_Wagner(int n)\n{\n typec i, j, pv, zj,I=1;\n typec best = I<<32;\n for (i = 0; i < n; i++) v[i] = i; // vertex: 0 ~ n-1\n while (n > 1)\n {\n for (a[v[0]] = 1, i = 1; i < n; i++)\n {\n a[v[i]] = 0;\n na[i - 1] = i;\n w[i] = g[v[0]][v[i]];\n\n }\n for (pv = v[0], i = 1; i < n; i++ )\n {\n for (zj = -1, j = 1; j < n; j++ )\n if (!a[v[j]] && (zj < 0 || w[j] > w[zj]))\n\n zj = j;\n a[v[zj]] = 1;\n if (i == n - 1)\n {\n if (best > w[zj]) best = w[zj];\n for (i = 0; i < n; i++)\n g[v[i]][pv] = g[pv][v[i]] += g[v[zj]][v[i]];\n v[zj] = v[--n];\n break;\n }\n pv = v[zj];\n for (j = 1; j < n; j++)\n if(!a[v[j]])\n w[j] += g[v[zj]][v[j]];\n }\n }\n return best;\n}\nbool vis[111];\nvoid dfs(int u,int n)\n{\n for(int v=0;v<n;++v)\n if(g[u][v]!=0&&vis[v]==0)\n {\n vis[v]=1;\n dfs(v,n);\n }\n}\nbool ok(int n)\n{\n for(int i=0;i<n;++i)\n if(vis[i]==0)return 1;\n return 0;\n}\nint main()\n{\n //freopen(\"G:\\\\in.txt\",\"r\",stdin);\n int n, m, u, v, w;\n while(scanf(\"%d%d\", &n, &m),n+m)\n {\n memset(g, 0, sizeof(g));\n typec ans=0;\n while(m --)\n {\n scanf(\"%d%d%d\", &u, &v, &w);\n if(w<=0)ans+=w;\n else g[v][u]= g[u][v] = w;\n\n }\n // memset(vis,0,sizeof(vis));\n //dfs(0,n);\n //if(ok(n))puts(\"0\");\n printf(\"%lld\\n\", ans+Stoer_Wagner(n));\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nstruct SCC{\n int n;\n vector<vector<int> > G,rG,T,C;\n vector<int> vs,used,belong;\n SCC(){};\n SCC(int sz):n(sz),G(sz),rG(sz),used(sz),belong(sz){}\n \n void add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n }\n \n void dfs(int v){\n used[v] = 1;\n for(int i=0;i<(int)G[v].size();i++){\n if(!used[G[v][i]]) dfs(G[v][i]);\n }\n vs.push_back(v);\n }\n \n void rdfs(int v,int k){\n used[v] = 1;\n belong[v] = k;\n C[k].push_back(v);\n for(int i=0;i<(int)rG[v].size();i++) {\n if(!used[rG[v][i]]) rdfs(rG[v][i],k);\n }\n }\n \n int build(){\n fill(used.begin(),used.end(),0);\n vs.clear();\n for(int v=0;v<n;v++){\n if(!used[v]) dfs(v);\n }\n \n fill(used.begin(),used.end(),0);\n int k=0;\n for(int i=vs.size()-1;i>=0;i--){\n if(!used[vs[i]]){\n T.push_back(vector<int>());\n C.push_back(vector<int>());\n rdfs(vs[i],k++);\n }\n }\n return k;\n }\n \n};\n \nstruct UnionFind{\n int n;\n vector<int> r,p;\n UnionFind(int n):n(n),r(n,1),p(n){iota(p.begin(),p.end(),0);}\n int find(int x){\n if(x==p[x]) return x;\n return p[x]=find(p[x]);\n }\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y) return;\n if(r[x]<r[y]) swap(x,y);\n r[x]+=r[y];\n p[y]=x;\n }\n};\n \nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n int n,m;\n while(cin>>n>>m,n){\n vector<int> x(m),y(m),c(m);\n int ans=0;\n UnionFind uf(n);\n SCC scc(n);\n for(int i=0;i<m;i++){\n cin>>x[i]>>y[i]>>c[i];\n if(c[i]<=0) ans+=c[i];\n else{\n\tscc.add_edge(x[i],y[i]);\n\tuf.unite(x[i],y[i]);\n }\n }\n if(uf.r[uf.find(0)]!=n){\n cout<<ans<<endl;\n continue;\n }\n scc.build();\n //cout<<ans<<endl;\n auto b=scc.belong;\n vector<int> v;\n int t=-1;\n for(int i=0;i<m;i++){\n if(c[i]<=0) continue;\n if(b[x[i]]==b[y[i]]){\n\tv.emplace_back(c[i]);\n\tcontinue;\n }\n if(t<0||c[i]<t) t=c[i];\n }\n sort(v.begin(),v.end());\n if(!v.empty()&&(t<0||v[0]+v[1]<t)) t=v[0]+v[1];\n cout<<ans+t<<endl;\n }\n return 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <cassert>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n#include <iomanip>\n\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\ntemplate <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }\n#endif\n#ifdef __GNUC__\ntemplate <class T> int popcount(T n);\ntemplate <> int popcount(unsigned int n) { return n ? __builtin_popcount(n) : 0; }\ntemplate <> int popcount(int n) { return n ? __builtin_popcount(n) : 0; }\ntemplate <> int popcount(unsigned long long n) { return n ? __builtin_popcountll(n) : 0; }\ntemplate <> int popcount(long long n) { return n ? __builtin_popcountll(n) : 0; }\n#endif\n\n#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define CL(arr, val) memset(arr, val, sizeof(arr))\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntemplate <class T> void max_swap(T& a, const T& b) { a = max(a, b); }\ntemplate <class T> void min_swap(T& a, const T& b) { a = min(a, b); }\n\ntypedef long long ll;\ntypedef pair<int, int> pint;\n\nconst double EPS = 1e-8;\nconst double PI = acos(-1.0);\nconst int dx[] = { 0, 1, 0, -1 };\nconst int dy[] = { 1, 0, -1, 0 };\nbool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }\n\ntemplate <class T> void print(T a, int n, int br = 1, const string& deli = \", \") { cout << \"{ \"; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << \" }\"; while (br--) cout << endl; }\ntemplate <class T> void print(const vector<T>& v, int br = 1, const string& deli = \", \") { print(v, v.size(), br, deli); }\n\n\ntemplate <class T>\nclass UnionFind\n{\nprivate:\n\tT* parent;\n\tT* rank;\n\npublic:\n\tint groups;\n\t\n\tUnionFind(int n)\n\t\t: groups(n)\n\t{\n\t\tparent = new T[n];\n\t\trank = new T[n];\n\t\tfor (int i = 0; i < n; ++i)\n\t\t{\n\t\t\tparent[i] = i;\n\t\t\trank[i] = 0;\n\t\t}\n\t}\n\n\tvoid unite(T a, T b)\n\t{\n\t\tT root_a = find(a);\n\t\tT root_b = find(b);\n\t\tif (root_a == root_b)\n\t\t\treturn;\n\n\t\t--groups;\n\n\t\tif (rank[root_a] < rank[root_b])\n\t\t\tparent[root_a] = root_b;\n\t\telse if (rank[root_a] > rank[root_b])\n\t\t\tparent[root_b] = root_a;\n\t\telse\n\t\t{\n\t\t\tparent[root_a] = root_b;\n\t\t\t++rank[root_a];\n\t\t}\n\t}\n\n\tbool same(T a, T b)\n\t{\n\t\treturn find(a) == find(b);\n\t}\n\n\tT find(T e)\n\t{\n\t\tif (parent[e] == e)\n\t\t\treturn e;\n\t\telse\n\t\t\treturn parent[e] = find(parent[e]);\n\t}\n};\nclass SCC\n{\npublic:\n\tint V;\n\tvector<vector<int> > g;\n\tvector<vector<int> > rg;\n\tvector<int> vs;\t// 帰りの順番, 後ろのほう要素は始点側\n\tvector<bool> used;\n\tvector<int> component;\n\n\tSCC(int V)\n\t\t: V(V), g(V), rg(V), vs(V), used(V), component(V) { }\n\n\tvoid add_edge(int from, int to)\n\t{\n\t\tg[from].push_back(to);\n\t\trg[to].push_back(from);\n\t}\n\n\tvoid dfs(int v)\n\t{\n\t\tused[v] = true;\n\t\tfor (int i = 0; i < g[v].size(); ++i)\n\t\t\tif (!used[g[v][i]])\n\t\t\t\tdfs(g[v][i]);\n\t\tvs.push_back(v);\n\t}\n\n\tvoid rdfs(int v, int k)\n\t{\n\t\tused[v] = true;\n\t\tcomponent[v] = k;\n\t\tfor (int i = 0; i < rg[v].size(); ++i)\n\t\t\tif (!used[rg[v][i]])\n\t\t\t\trdfs(rg[v][i], k);\n\t}\n\n\t// 強連結成分の数を返す\n\t// O(V + E)\n\t// グラフの始点側の値(component[v])は小さい\n\t// 末端は大きい値, 最末端(component[v] == scc() - 1)\n\tint scc()\n\t{\n\t\tvs.clear();\n\t\tfill(used.begin(), used.end(), false);\n\t\tfor (int i = 0; i < V; ++i)\n\t\t\tif (!used[i])\n\t\t\t\tdfs(i);\n\n\t\tfill(used.begin(), used.end(), false);\n\t\tint k = 0;\n\t\tfor (int i = vs.size() - 1; i >= 0; --i)\n\t\t\tif (!used[vs[i]])\n\t\t\t\trdfs(vs[i], k++);\n\t\treturn k;\n\t}\n};\nint main()\n{\n\tios::sync_with_stdio(false);\n\n\tint n, m;\n\twhile (cin >> n >> m, n)\n\t{\n\t\tvector<pint> e[128];\t// (to, cost)\n\t\tUnionFind<int> uf(n);\n\n\t\tint res = 0;\n\t\twhile (m--)\n\t\t{\n\t\t\tint x, y, c;\n\t\t\tcin >> x >> y >> c;\n\t\t\tif (c <= 0)\n\t\t\t\tres += c;\n\t\t\telse\n\t\t\t{\n\t\t\t\te[x].push_back(pint(y, c));\n\t\t\t\tuf.unite(x, y);\n\t\t\t}\n\t\t}\n\n\t\tif (uf.groups == 1)\n\t\t{\n\t\t\tSCC scc(n);\n\t\t\tfor (int i = 0; i < n; ++i)\n\t\t\t\tfor (int j = 0; j < e[i].size(); ++j)\n\t\t\t\t\tscc.add_edge(i, e[i][j].first);\n\t\t\tscc.scc();\n\n\t\t\tint min_cost = INT_MAX;\n\t\t\tmap<int, vector<int> > cost_in_scc;\n\t\t\tfor (int i = 0; i < n; ++i)\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < e[i].size(); ++j)\n\t\t\t\t{\n\t\t\t\t\tint x = i, y = e[i][j].first, c = e[i][j].second;\n\t\t\t\t\tif (scc.component[x] != scc.component[y])\n\t\t\t\t\t\tmin_swap(min_cost, c);\n\t\t\t\t\telse\n\t\t\t\t\t\tcost_in_scc[scc.component[x]].push_back(c);\n\t\t\t\t}\n\t\t\t}\n\t\t\tforeach (it, cost_in_scc)\n\t\t\t{\n\t\t\t\tvector<int>& v = it->second;\n\t\t\t\tsort(all(v));\n\t\t\t\tmin_swap(min_cost, v[0] + v[1]);\n\t\t\t}\n\n\t\t\tres += min_cost;\n\t\t}\n\n\t\tcout << res << endl;\n\t}\n}", "#include<stdio.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\nusing namespace std;\nconst int D_MAX_V=210;\nconst int D_v_size=210;\nstruct D_wolf{\n\tint t,r;\n\tlong long c;\n\tD_wolf(){t=c=r=0;}\n\tD_wolf(int t1,long long c1,int r1){\n\t\tt=t1;c=c1;r=r1;\n\t}\n};\nvector<D_wolf>D_G[D_MAX_V];\nint D_level[D_MAX_V];\nint D_iter[D_MAX_V];\n\nvoid add_edge(int from,int to,long long cap){\n\tD_G[from].push_back(D_wolf(to,cap,D_G[to].size()));\n\tD_G[to].push_back(D_wolf(from,0,D_G[from].size()-1));\n}\nvoid D_bfs(int s){\n\tfor(int i=0;i<D_v_size;i++)D_level[i]=-1;\n\tqueue<int> Q;\n\tD_level[s]=0;\n\tQ.push(s);\n\twhile(Q.size()){\n\t\tint v=Q.front();\n\t\tQ.pop();\n\t\tfor(int i=0;i<D_G[v].size();i++){\n\t\t\tif(D_G[v][i].c>0&&D_level[D_G[v][i].t]<0){\n\t\t\t\tD_level[D_G[v][i].t]=D_level[v]+1;\n\t\t\t\tQ.push(D_G[v][i].t);\n\t\t\t}\n\t\t}\n\t}\n}\nlong long D_dfs(int v,int t,long long f){\n\tif(v==t)return f;\n\tfor(;D_iter[v]<D_G[v].size();D_iter[v]++){\n\t\tint i=D_iter[v];\n\t\tif(D_G[v][i].c>0&&D_level[v]<D_level[D_G[v][i].t]){\n\t\t\tlong long d=D_dfs(D_G[v][i].t,t,min(f,D_G[v][i].c));\n\t\t\tif(d>0){\n\t\t\t\tD_G[v][i].c-=d;\n\t\t\t\tD_G[D_G[v][i].t][D_G[v][i].r].c+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nlong long max_flow(int s,int t){\n\tlong long flow=0;\n\tfor(;;){\n\t\tD_bfs(s);\n\t\tif(D_level[t]<0)return flow;\n\t\tfor(int i=0;i<D_v_size;i++)D_iter[i]=0;\n\t\tlong long f;\n\t\twhile((f=D_dfs(s,t,9999999999999LL))>0){flow+=f;}\n\t}\n\treturn 0;\n}\nlong long INF=9999999999999LL;\nint p[30000];\nint q[30000];\nint r[30000];\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<b;i++){\n\t\t\tscanf(\"%d%d%d\",p+i,q+i,r+i);\n\t\t}\n\t\tlong long ret=999999999999999LL;\n\t\tfor(int i=1;i<a;i++){\n\t\t\tfor(int j=0;j<D_MAX_V;j++){\n\t\t\t\tD_G[j].clear();\n\t\t\t\tD_iter[j]=D_level[j]=0;\n\t\t\t}\n\t\t\tlong long tmp=0;\n\t\t/*\tfor(int j=0;j<a;j++){\n\t\t\t\tadd_edge(j,j+a,INF);\n\t\t\t\tif(j==0)add_edge(s,j,INF);\n\t\t\t\telse add_edge(s,j,0);\n\t\t\t\tif(j==i)add_edge(j+a,t,INF);\n\t\t\t\telse add_edge(j+a,t,0);\n\t\t\t}*/\n\t\t\tfor(int j=0;j<b;j++){\n\t\t\t\tif(r[j]<=0){\n\t\t\t\t\ttmp+=r[j];continue;\n\t\t\t\t}\n\t\t\t\tadd_edge(p[j],q[j],r[j]);\n\t\t\t\tadd_edge(q[j],p[j],r[j]);\n\t\t\t}\n\t\t\tret=min(ret,tmp+max_flow(0,i));\n\t\t}\n\t\tprintf(\"%lld\\n\",ret);\n\t}\n}", "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\n\nconst int inf = 0x3f3f3f3f ;\nconst int maxw = 1000 ;\nint g[105][105] , w[105] ;\nint a[105] , v[105] , na[105] ;\nint n , m ;\nint mincut( int n ) {\n\tint i , j, pv , zj ;\n\tint best = inf ;\n\tfor( i = 0 ; i < n; i ++ ) {\n\t\tv[i] = i ;\n\t}\n\twhile( n > 1 ) {\n\t\tfor( a[v[0]] = 1 , i = 1 ; i < n; i ++ ) {\n\t\t\ta[v[i]] = 0 ; na[i-1] = i ;\n\t\t\tw[i] = g[v[0]][v[i]] ;\n\t\t}\n\t\tfor( pv = v[0] ,i = 1 ; i < n ; i ++ ) {\n\t\t\tfor( zj = -1 , j = 1 ; j < n ; j ++ ) \n\t\t\t\tif( !a[v[j]] && (zj<0||w[j]>w[zj]))\n\t\t\t\t\tzj = j ;\n\t\t\t\ta[v[zj]] = 1 ;\n\t\t\t\tif( i == n - 1 ) {\n\t\t\t\t\tif( best > w[zj] ) best = w[zj] ;\n\t\t\t\t\tfor( i = 0 ; i < n; i++ ) {\n\t\t\t\t\t\tg[v[i]][pv] = g[pv][v[i]] +=g[v[zj]][v[i]] ;\n\t\t\t\t\t}\n\t\t\t\t\tv[zj] = v[--n] ;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tpv = v[zj] ;\n\t\t\t\tfor( j = 1 ; j < n; j ++ ) if( !a[v[j]])\n\t\t\t\t\tw[j] += g[v[zj]][v[j]] ;\n\t\t}\n\t}\n\treturn best ;\n}\n\nint main(){\n\twhile( scanf( \"%d%d\" , &n , &m ) != EOF ) {\n\t\tif( n == 0 && m == 0 ) break;\n\t\tmemset( g , 0 , sizeof(g) ) ;\n\t\tint ans = 0 ;\n\t\tint i ;\n\t\tfor( i = 1 ; i <= m ;i ++ ) {\n\t\t\tint from , to ,val ;\n\t\t\tscanf( \"%d%d%d\" , &from , &to , &val ) ;\n\t\t\tif( val < 0 ) {\n\t\t\t\tans += val ;\n\t\t\t\tcontinue ;\n\t\t\t}\n\t\t\tif( g[from][to] == inf ) {\n\t\t\t\tg[from][to] = val ;\n\t\t\t}else{\n\t\t\t\tg[from][to] += val ;\n\t\t\t}\n\t\t\tg[to][from] = g[from][to] ;\n\t\t}\n\t\tprintf( \"%d\\n\" , ans + mincut(n) ) ;\n\t}\n\treturn 0 ;\n}", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic int N, M, E;\n\tstatic int[] from;\n\tstatic long[] cost;\n\n\tstatic boolean disjoint() {\n\t\tUnionFind uf = new UnionFind(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (from[i] != -1) uf.union(i, from[i]);\n\t\t}\n\t\treturn uf.size(0) != N;\n\t}\n\n\tstatic long solve() {\n\t\tif (E <= N - 2) return 0;\n\t\tif (disjoint()) return 0;\n\t\tlong ret = Long.MAX_VALUE;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (from[i] == -1) continue;\n\t\t\tfor (int j = i + 1; j < N; ++j) {\n\t\t\t\tif (from[j] == -1) continue;\n\t\t\t\tret = Math.min(ret, cost[i] + cost[j]);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (from[i] == -1) continue;\n\t\t\tint tmp = from[i];\n\t\t\tfrom[i] = -1;\n\t\t\tif (disjoint()) ret = Math.min(ret, cost[i]);\n\t\t\tfrom[i] = tmp;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\twhile (true) {\n\t\t\tN = sc.nextInt();\n\t\t\tM = sc.nextInt();\n\t\t\tif (N == 0) break;\n\t\t\tfrom = new int[N];\n\t\t\tcost = new long[N];\n\t\t\tArrays.fill(from, -1);\n\t\t\tlong minus = 0;\n\t\t\tE = 0;\n\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\tint X = sc.nextInt();\n\t\t\t\tint Y = sc.nextInt();\n\t\t\t\tlong C = sc.nextLong();\n\t\t\t\tif (C <= 0) {\n\t\t\t\t\tminus += C;\n\t\t\t\t} else {\n\t\t\t\t\tfrom[Y] = X;\n\t\t\t\t\tcost[Y] = C;\n\t\t\t\t\t++E;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(solve() + minus);\n\t\t}\n\t}\n\n\tstatic class UnionFind {\n\t\tint[] set;\n\n\t\tUnionFind(int n) {\n\t\t\tset = new int[n];\n\t\t\tArrays.fill(set, -1);\n\t\t}\n\n\t\tvoid union(int a, int b) {\n\t\t\tint rtA = root(a);\n\t\t\tint rtb = root(b);\n\t\t\tif (rtA == rtb) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tset[rtA] += set[rtb];\n\t\t\tset[rtb] = rtA;\n\t\t}\n\n\t\tboolean find(int a, int b) {\n\t\t\treturn root(a) == root(b);\n\t\t}\n\n\t\tint root(int a) {\n\t\t\tif (set[a] < 0) {\n\t\t\t\treturn a;\n\t\t\t} else {\n\t\t\t\tset[a] = root(set[a]);\n\t\t\t\treturn set[a];\n\t\t\t}\n\t\t}\n\n\t\tint size(int a) {\n\t\t\treturn -set[root(a)];\n\t\t}\n\t}\n\n}", "# AOJ 1065 The House of Huge Family\n# Python3 2018.7.10 bal4u\n\n# UNION-FIND library\nclass UnionSet:\n\tdef __init__(self, nmax):\n\t\tself.size = [1]*nmax\n\t\tself.id = [i for i in range(nmax+1)]\n\tdef root(self, i):\n\t\twhile i != self.id[i]:\n\t\t\tself.id[i] = self.id[self.id[i]]\n\t\t\ti = self.id[i]\n\t\treturn i\n\tdef connected(self, p, q): return self.root(p) == self.root(q)\n\tdef unite(self, p, q):\n\t\ti, j = self.root(p), self.root(q)\n\t\tif i == j: return\n\t\tif self.size[i] < self.size[j]:\n\t\t\tself.id[i] = j\n\t\t\tself.size[j] += self.size[i]\n\t\telse:\n\t\t\tself.id[j] = i\n\t\t\tself.size[i] += self.size[j]\n# UNION-FIND library\n\nwhile True:\n\tn, m = map(int, input().split())\n\tif n == 0: break\n\tu = UnionSet(n)\n\tans, tbl = 0, []\n\tfor i in range(m):\n\t\tx, y, c = map(int, input().split())\n\t\tif c < 0: ans += c\n\t\telse: tbl.append((c, x, y))\n\ttbl.sort(reverse=True)\n\tfor c, x, y in tbl:\n\t\tif not u.connected(x, y):\n\t\t\tif n > 2:\n\t\t\t\tn -= 1\n\t\t\t\tu.unite(x, y)\n\t\t\telse: ans += c\n\tprint(ans)\n\n", "#include<stdio.h>\n#include<algorithm>\n#include<vector>\nstruct S{int f,t,c;}s;\nint C(S l,S r){return l.c>r.c;}\nint u[100],r[100];\nint F(int x)\n{\n\treturn (u[x]-x?u[x]=F(u[x]):x);\n}\nvoid U(int x,int y)\n{\n\tx=F(x),y=F(y);\n\tif(r[x]>r[y])u[y]=x;\n\telse if(r[x]<r[y])u[x]=y;\n\telse u[x]=y,++r[y];\n}\nint main()\n{\n\tint n,m,i,a;\n\twhile(scanf(\"%d%d\",&n,&m),n)\n\t{\n\t\tstd::vector<S>v;\n\t\tfor(a=i=0;i<n;++i)r[u[i]=i]=1;\n\t\twhile(m--)\n\t\t{\n\t\t\tscanf(\"%d%d%d\",&s.f,&s.t,&s.c);\n\t\t\tif(s.c>0)v.push_back(s);\n\t\t\telse a+=s.c;\n\t\t}\n\t\tstd::sort(v.begin(),v.end(),C);\n\t\tfor(i=0;i<v.size();++i)\n\t\t{\n\t\t\ts=v[i];\n\t\t\tif(F(s.f)!=F(s.t))\n\t\t\t{\n\t\t\t\tif(n>2)U(s.f,s.t),--n;\n\t\t\t\telse a+=s.c;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",a);\n\t}\n\treturn 0;\n}", "#include<queue>\n#include<cstdio>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int INF=1<<29;\n\ntemplate<class T>\nstruct AdjMatrix:public vector< vector<T> >{\n\tAdjMatrix(int n,const vector<T> &v=vector<T>()):vector< vector<T> >(n,v){}\n};\n\ntemplate<class T>\nT augment(const AdjMatrix<T> &capa,int src,int snk,AdjMatrix<T> &flow){\n\tint n=capa.size();\n\tvector<int> parent(n,-1); parent[src]=-2;\n\n\tT water=0;\n\tqueue< pair<T,int> > qu; qu.push(make_pair(INF,src));\n\twhile(!qu.empty()){\n\t\tpair<T,int> a=qu.front(); qu.pop();\n\t\tint u=a.second;\n\t\tT w=a.first;\n\t\tif(u==snk){ water=w; break; }\n\t\trep(v,n) if(parent[v]==-1 && capa[u][v]-flow[u][v]>0) {\n\t\t\tqu.push(make_pair(min(w,capa[u][v]-flow[u][v]),v));\n\t\t\tparent[v]=u;\n\t\t}\n\t}\n\n\tif(water==0) return 0;\n\n\tfor(int v=snk,u=parent[snk];v!=src;v=u,u=parent[u]){\n\t\tflow[u][v]+=water;\n\t\tflow[v][u]-=water;\n\t}\n\n\treturn water;\n}\n\ntemplate<class T>\nT FordFulkerson(const AdjMatrix<T> &capa,int src,int snk){\n\tint n=capa.size();\n\tAdjMatrix<T> flow(n,vector<T>(n));\n\n\tT ans=0;\n\twhile(1){\n\t\tT water=augment(capa,src,snk,flow);\n\t\tif(water==0) break;\n\t\tans+=water;\n\t}\n\treturn ans;\n}\n\nint main(){\n\tfor(int n,m;scanf(\"%d%d\",&n,&m),n;){\n\t\tint ans=0;\n\t\tAdjMatrix<int> adj(n,vector<int>(n));\n\t\trep(i,m){\n\t\t\tint u,v,w; scanf(\"%d%d%d\",&u,&v,&w);\n\t\t\tif(w<0) ans+=w;\n\t\t\tadj[u][v]=adj[v][u]=max(w,0);\n\t\t}\n\n\t\tint ans2=INF;\n\t\trep(v,n) if(v!=0) ans2=min(ans2,FordFulkerson(adj,0,v));\n\t\tprintf(\"%d\\n\",ans+ans2);\n\t}\n\n\treturn 0;\n}", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\n//The House of Huge Family\npublic class Main{\n\n\tclass E{\n\t\tint s, t, c, id;\n\t\tpublic E(int s, int t, int c, int id) {\n\t\t\tthis.s = s;\n\t\t\tthis.t = t;\n\t\t\tthis.c = c;\n\t\t\tthis.id = id;\n\t\t}\n\t}\n\t\n\tint n, m;\n\tList<E>[] adj;\n\t\n\tboolean isCon(int f1, int f2){\n\t\tboolean[] u = new boolean[n];\n\t\tList<Integer> l = new ArrayList<Integer>();\n\t\tl.add(0); u[0] = true;\n\t\tint N = 0;\n\t\twhile(!l.isEmpty()){\n\t\t\tList<Integer> next = new ArrayList<Integer>();\n\t\t\tfor(int i:l){\n\t\t\t\tN++;\n\t\t\t\tfor(E e:adj[i])if(!u[e.t]&&e.id!=f1&&e.id!=f2){\n\t\t\t\t\tu[e.t] = true; next.add(e.t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tl = next;\n\t\t}\n\t\treturn N==n;\n\t}\n\t\n\t@SuppressWarnings(\"unchecked\")\n\tvoid run(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(;;){\n\t\t\tn = sc.nextInt(); m = sc.nextInt();\n\t\t\tif((n|m)==0)break;\n\t\t\tadj = new List[n];\n\t\t\tfor(int i=0;i<n;i++)adj[i]=new ArrayList<E>();\n\t\t\tint N = 0, M = 0;\n\t\t\tList<Integer> cost = new ArrayList<Integer>();\n\t\t\twhile(m--!=0){\n\t\t\t\tint s = sc.nextInt(), t = sc.nextInt(), c = sc.nextInt();\n\t\t\t\tif(c<=0)M+=c;\n\t\t\t\telse{\n\t\t\t\t\tcost.add(c); adj[s].add(new E(s, t, c, N)); adj[t].add(new E(t, s, c, N)); N++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tif(!isCon(-1, -1))min = 0;\n\t\t\tfor(int i=0;i<N;i++)if(!isCon(i, -1))min = Math.min(min, cost.get(i));\n\t\t\tfor(int i=0;i<N;i++)for(int j=i+1;j<N;j++)min = Math.min(min, cost.get(i)+cost.get(j));\n\t\t\tSystem.out.println(M+min);\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\n//The House of Huge Family\npublic class Main{\n\n\tclass E{\n\t\tint s, t, c, id;\n\t\tpublic E(int s, int t, int c, int id) {\n\t\t\tthis.s = s;\n\t\t\tthis.t = t;\n\t\t\tthis.c = c;\n\t\t\tthis.id = id;\n\t\t}\n\t}\n\t\n\tint n, m;\n\tList<E>[] adj;\n\t\n\tboolean isCon(int f1, int f2){\n\t\tboolean[] u = new boolean[n];\n\t\tList<Integer> l = new ArrayList<Integer>();\n\t\tl.add(0); u[0] = true;\n\t\tint N = 0;\n\t\twhile(!l.isEmpty()){\n\t\t\tList<Integer> next = new ArrayList<Integer>();\n\t\t\tfor(int i:l){\n\t\t\t\tN++;\n\t\t\t\tfor(E e:adj[i])if(!u[e.t]&&e.id!=f1&&e.id!=f2){\n\t\t\t\t\tu[e.t] = true; next.add(e.t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tl = next;\n\t\t}\n\t\treturn N==n;\n\t}\n\t\n\t@SuppressWarnings(\"unchecked\")\n\tvoid run(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(;;){\n\t\t\tn = sc.nextInt(); m = sc.nextInt();\n\t\t\tif((n|m)==0)break;\n\t\t\tadj = new List[n];\n\t\t\tfor(int i=0;i<n;i++)adj[i]=new ArrayList<E>();\n\t\t\tint N = 0, M = 0;\n\t\t\tList<Integer> cost = new ArrayList<Integer>();\n\t\t\twhile(m--!=0){\n\t\t\t\tint s = sc.nextInt(), t = sc.nextInt(), c = sc.nextInt();\n\t\t\t\tif(c<=0)M+=c;\n\t\t\t\telse{\n\t\t\t\t\tcost.add(c); adj[s].add(new E(s, t, c, N)); adj[t].add(new E(t, s, c, N)); N++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tif(!isCon(-1, -1))min = 0;\n\t\t\tfor(int i=0;i<N;i++)if(!isCon(i, -1))min = Math.min(min, cost.get(i));\n\t\t\tfor(int i=0;i<N;i++)for(int j=i+1;j<N;j++)if(!isCon(i, j))min = Math.min(min, cost.get(i)+cost.get(j));\n\t\t\tSystem.out.println(M+min);\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n\nstatic const double EPS = 1e-8;\n\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int next_flow = min(flow,e.flow);\n int d = dfs(e.to,next_flow,sink);\n if(d <= 0) continue;\n\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nclass UnionFindTree {\nprivate:\n int* par;\n int* rank;\npublic:\n UnionFindTree(int n){\n par = new int[n]();\n rank = new int[n]();\n for(int i=0;i<n;i++){\n par[i] = i;\n rank[i] = 0;\n }\n }\n\n ~UnionFindTree(){\n delete[] rank;\n delete[] par;\n }\n\n int find(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = find(par[x]);\n }\n }\n\n void unite(int x,int y){\n x = find(x);\n y = find(y);\n if (x == y) return;\n par[x] = y;\n }\n\n bool same(int x,int y){\n return find(x) == find(y);\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n UnionFindTree uft(num_of_houses);\n\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n uft.unite(from,to);\n }\n\n int tree_count = 0;\n bool visited[101];\n memset(visited,false,sizeof(visited));\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n if(!visited[uft.find(house_i)]) tree_count++;\n visited[uft.find(house_i)] = true;\n }\n\n int res = numeric_limits<int>::max();\n\n if(tree_count >= 2){\n res = 0;\n }\n else{\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n int house_j = uft.find(house_i);\n if(house_i == house_j) continue;\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(house_i,house_j));\n }\n }\n printf(\"%d\\n\",bonus + res);\n }\n}", "// I'm the Topcoder\n//C\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <math.h>\n#include <time.h>\n//C++\n#include <iostream>\n#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n#include <cctype>\n#include <stack>\n#include <string>\n#include <list>\n#include <queue>\n#include <map>\n#include <vector>\n#include <deque>\n#include <set>\nusing namespace std;\n\n//*************************OUTPUT*************************\n#ifdef WIN32\n#define INT64 \"%I64d\"\n#define UINT64 \"%I64u\"\n#else\n#define INT64 \"%lld\"\n#define UINT64 \"%llu\"\n#endif\n\n//**************************CONSTANT***********************\n#define INF 0x7F7F7F7F\n#define eps 1e-8\n#define PI acos(-1.)\n#define PI2 asin (1.);\ntypedef long long LL;\n//typedef __int64 LL; //codeforces\ntypedef unsigned int ui;\ntypedef unsigned long long ui64;\n#define MP make_pair\ntypedef vector<int> VI;\ntypedef pair<int, int> PII;\n#define pb push_back\n#define mp make_pair\n\n//***************************SENTENCE************************\n#define CL(a,b) memset (a, b, sizeof (a))\n#define sqr(a,b) sqrt ((double)(a)*(a) + (double)(b)*(b))\n\n//****************************FUNCTION************************\ntemplate <typename T> double DIS(T va, T vb) { return sqr(va.x - vb.x, va.y - vb.y); }\ntemplate <class T> inline T INTEGER_LEN(T v) { int len = 1; while (v /= 10) ++len; return len; }\ntemplate <typename T> inline T square(T va, T vb) { return va * va + vb * vb; }\n\n// aply for the memory of the stack\n#pragma comment (linker, \"/STACK:1024000000,1024000000\")\n//end\n\n#define CY 105\ntypedef int typec;\n\nbool inset[CY], vis[CY];\ntypec wage[CY];\nint g[CY][CY];\nint N, M;\n\ntypec Search(int n, int &s, int &t) {\n\tmemset(vis, false, n * sizeof(vis[0]));\n\tmemset(wage, 0, n * sizeof(wage[0]));\n\ts = t = -1;\n\ttypec cf, mx;\n\tint u = 0;\n\tfor (int i = 0; i < n; ++i) {\n\t\tmx = -INF;\n\t\tfor (int j = 0; j < n; ++j) {\n\t\t\tif (!inset[j] && !vis[j] && mx < wage[j]) {\n\t\t\t\tmx = wage[u = j];\n\t\t\t}\n\t\t}\n\t\tif (u == t) return cf;\n\t\ts = t; t = u;\n\t\tcf = mx;\n\t\tvis[u] = true;\n\t\tfor (int v = 0; v < n; ++v) {\n\t\t\tif (!inset[v] && !vis[v]) {\n\t\t\t\twage[v] += g[u][v];\n\t\t\t}\n\t\t}\n\t}\n\treturn cf;\n}\n\ntypec Stoer_Wagner(int n) {\n\tint s, t;\n\ttypec ans = INF, cf;\n\tmemset(inset, false, n * sizeof(inset[0]));\n\tfor (int i = 1; i < n; ++i) {\n\t\tcf = Search(n, s, t);\n\t\tans = min(ans, cf);\n\t\tif (ans == 0) return ans;\n\t\tinset[t] = true;\n\t\tfor (int j = 0; j < n; ++j) {\n\t\t\tif (!inset[j] && j != s) {\n\t\t\t\tg[s][j] += g[t][j];\n\t\t\t\tg[j][s] += g[j][t];\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main(void) {\n\twhile (2 == scanf(\"%d%d\", &N, &M)) {\n\t\tif (N == 0 && M == 0) break;\n\t\tmemset(g, 0, sizeof(g));\n\t\tint ans = 0, u, v, c;\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tscanf(\"%d%d%d\", &u, &v, &c);\n\t\t\tif (c > 0) g[u][v] += c, g[v][u] += c;\n\t\t\telse ans += c;\n\t\t}\n\t\tprintf(\"%d\\n\", ans + Stoer_Wagner(N));\n\t}\n\treturn 0;\n}", "#include <stdio.h>\n#include <string.h>\n#define MaxN 110\n\nconst int oo = 0x7fffffff;\nint g[MaxN][MaxN], d[MaxN];\nbool used[MaxN], vst[MaxN];\n\nint main()\n{\n int min, n, m, max, tmp, pre, cur, a, b, w, cnt;\n\n while (scanf(\"%d%d\", &n, &m), n) {\n min = oo, cnt = 0;\n memset(g, 0, sizeof(g));\n memset(used, 0, sizeof(used));\n int Res = 0;\n for (int i = 0; i < m; ++i) {\n scanf(\"%d%d%d\", &a, &b, &w);\n if (w < 0){\n Res += w;\n continue;\n }\n g[a][b] += w;\n g[b][a] = g[a][b];\n }\n if (n < 2) {\n printf(\"%d\\n\",Res);\n continue;\n }\n for (int i = 1; i < n; ++i) {\n memset(vst, 0, sizeof(vst));\n vst[0] = 1;\n cur = pre = d[0] = 0;\n for (int k = 1; k < n; ++k) d[k] = g[0][k];\n for (int j = i; j < n; ++j) {\n max = 0;\n pre = cur;\n for (int k = 0; k < n; ++k) {\n if (vst[k] || used[k]) continue;\n if (d[k] > max) {\n max = d[k];\n cur = k;\n }\n }\n vst[cur] = 1;\n for (int k = 0; k < n; ++k) {\n if (vst[k] || used[k]) continue;\n d[k] += g[cur][k];\n }\n }\n used[cur] = 1;\n for (int j = 0; j < n; ++j) {\n if (j == pre || used[j]) continue;\n g[pre][j] += g[cur][j];\n g[j][pre] = g[pre][j];\n }\n tmp = 0;\n for (int j = 0; j < n; ++j) {\n if (used[j]) continue;\n tmp += g[cur][j];\n }\n if (tmp < min) min = tmp;\n else continue;\n }\n printf(\"%d\\n\", Res+min);\n }\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n \nusing namespace std;\n \n \n#define INF (1<<29)\n \n// math\n#define Sq(x) ((x)*(x))\n \n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n \n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n \n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n \n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n \ntypedef long long ll;\n \n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n \n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n \n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n \n//////////////////////////////////////////////////////////////\n \n \nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n \n#define MAX_E (100)\n \nvector<Edge> es[MAX_E];\nint N, M;\n \nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n if(e->id != x && !used[e->to]) {\n used[e->to] = 1;\n NEXT.PB(e->to);\n }\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n \nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n es[s].PB(Edge(t, c, id));\n es[t].PB(Edge(s, c, id));\n cost.PB(c);\n id ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n ans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}", "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\n//The House of Huge Family\npublic class Main{\n\n\tclass E{\n\t\tint s, t, id;\n\t\tlong c;\n\t\tpublic E(int s, int t, long c, int id) {\n\t\t\tthis.s = s;\n\t\t\tthis.t = t;\n\t\t\tthis.c = c;\n\t\t\tthis.id = id;\n\t\t}\n\t}\n\t\n\tint n, m;\n\tList<E>[] adj;\n\t\n\tboolean isCon(int f1, int f2){\n\t\tboolean[] u = new boolean[n];\n\t\tList<Integer> l = new ArrayList<Integer>();\n\t\tl.add(0); u[0] = true;\n\t\tint N = 0;\n\t\twhile(!l.isEmpty()){\n\t\t\tList<Integer> next = new ArrayList<Integer>();\n\t\t\tfor(int i:l){\n\t\t\t\tN++;\n\t\t\t\tfor(E e:adj[i])if(!u[e.t]&&e.id!=f1&&e.id!=f2){\n\t\t\t\t\tu[e.t] = true; next.add(e.t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tl = next;\n\t\t}\n\t\treturn N==n;\n\t}\n\t\n\t@SuppressWarnings(\"unchecked\")\n\tvoid run(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(;;){\n\t\t\tn = sc.nextInt(); m = sc.nextInt();\n\t\t\tif((n|m)==0)break;\n\t\t\tadj = new List[n];\n\t\t\tfor(int i=0;i<n;i++)adj[i]=new ArrayList<E>();\n\t\t\tint N = 0;\n\t\t\tlong M = 0;\n\t\t\tList<Long> cost = new ArrayList<Long>();\n\t\t\twhile(m--!=0){\n\t\t\t\tint s = sc.nextInt(), t = sc.nextInt();\n\t\t\t\tlong c = sc.nextInt();\n\t\t\t\tif(c<=0)M+=c;\n\t\t\t\telse{\n\t\t\t\t\tcost.add(c); adj[s].add(new E(s, t, c, N)); adj[t].add(new E(t, s, c, N)); N++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong min = 1L << 40;\n\t\t\tif(!isCon(-1, -1))min = 0;\n\t\t\tfor(int i=0;i<N;i++)if(!isCon(i, -1))min = Math.min(min, cost.get(i));\n\t\t\tfor(int i=0;i<N;i++)for(int j=i+1;j<N;j++)if(!isCon(i, j))min = Math.min(min, cost.get(i)+cost.get(j));\n\t\t\tSystem.out.println(M+min);\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n\nstatic const double EPS = 1e-8;\n\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int d = dfs(e.to,min(flow,e.flow),sink);\n if(d <= 0) continue;\n\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nclass UnionFindTree {\nprivate:\n int* par;\n int* rank;\npublic:\n UnionFindTree(int n){\n par = new int[n]();\n rank = new int[n]();\n for(int i=0;i<n;i++){\n par[i] = i;\n rank[i] = 0;\n }\n }\n\n ~UnionFindTree(){\n delete[] rank;\n delete[] par;\n }\n\n int find(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = find(par[x]);\n }\n }\n\n void unite(int x,int y){\n x = find(x);\n y = find(y);\n if (x == y) return;\n par[x] = y;\n }\n\n bool same(int x,int y){\n return find(x) == find(y);\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n UnionFindTree uft(num_of_houses);\n\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n uft.unite(from,to);\n }\n\n int tree_count = 0;\n bool visited[101];\n memset(visited,false,sizeof(visited));\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n if(!visited[uft.find(house_i)]) tree_count++;\n visited[uft.find(house_i)] = true;\n }\n\n int res = numeric_limits<int>::max();\n\n if(tree_count >= 2){\n res = 0;\n }\n else{\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n int house_j = uft.find(house_i);\n if(house_i == house_j) continue;\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(house_i,house_j));\n }\n }\n printf(\"%d\\n\",bonus + res);\n }\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100\n\nstruct Info{\n\tInfo(int arg_from,int arg_to,int arg_cost){\n\t\tfrom = arg_from;\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint from,to,cost;\n};\n\nint N,M;\n\nint boss[100],height[100];\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[x] > height[y]){\n\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[x] < height[y]){\n\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[x] == height[y]\n\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\nvoid init(){\n\tfor(int i = 0; i < N; i++){\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t}\n}\n\nvector<Info> V;\n\nvoid func(){\n\n\tinit();\n\tV.clear();\n\n\tint from,to,cost;\n\tint ans = 0;\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%d %d %d\",&from,&to,&cost);\n\t\tif(cost < 0){\n\t\t\tans += cost;\n\t\t}else{\n\t\t\tunite(from,to);\n\t\t\tV.push_back(Info(from,to,cost));\n\t\t}\n\t}\n\n\tint group_num = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tif(get_boss(i) == i)group_num++;\n\t}\n\tif(group_num >= 2){\n\t\tprintf(\"%d\\n\",ans);\n\t\treturn;\n\t}\n\n\tint ans_1 = BIG_NUM;\n\tfor(int i = 0; i < V.size(); i++){\n\t\tinit();\n\t\tfor(int k = 0; k < V.size(); k++){\n\t\t\tif(i == k)continue;\n\t\t\tunite(V[k].from,V[k].to);\n\t\t}\n\t\tgroup_num = 0;\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(get_boss(k) == k)group_num++;\n\t\t}\n\t\tif(group_num >= 2){\n\t\t\tans_1 = min(ans_1,ans+V[i].cost);\n\t\t}\n\t}\n\n\tint ans_2 = BIG_NUM;\n\n\tfor(int i = 0; i < V.size()-1; i++){\n\t\tfor(int k = i+1; k < V.size(); k++){\n\t\t\tinit();\n\t\t\tfor(int p = 0; p < V.size(); p++){\n\t\t\t\tif(p == i || p == k)continue;\n\t\t\t\tunite(V[p].from,V[p].to);\n\t\t\t}\n\t\t\tgroup_num = 0;\n\t\t\tfor(int p = 0; p < N; p++){\n\t\t\t\tif(get_boss(p) == p)group_num++;\n\t\t\t}\n\t\t\tif(group_num >= 2){\n\t\t\t\tans_2 = min(ans_2,ans+V[i].cost+V[k].cost);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\",min(ans_1,ans_2));\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&M);\n\t\tif(N == 0 && M == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}", "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n\nstatic const double EPS = 1e-8;\n\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n int res = 0;\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int d = dfs(e.to,min(flow,e.flow),sink);\n if(d > 0){\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nclass UnionFindTree {\nprivate:\n int* par;\n int* rank;\npublic:\n UnionFindTree(int n){\n par = new int[n]();\n rank = new int[n]();\n for(int i=0;i<n;i++){\n par[i] = i;\n rank[i] = 0;\n }\n }\n\n ~UnionFindTree(){\n delete[] rank;\n delete[] par;\n }\n\n int find(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = find(par[x]);\n }\n }\n\n void unite(int x,int y){\n x = find(x);\n y = find(y);\n if (x == y) return;\n par[x] = y;\n }\n\n bool same(int x,int y){\n return find(x) == find(y);\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n UnionFindTree uft(num_of_houses);\n\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n uft.unite(from,to);\n }\n\n int tree_count = 0;\n bool visited[101];\n memset(visited,false,sizeof(visited));\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n if(!visited[uft.find(house_i)]) tree_count++;\n visited[uft.find(house_i)] = true;\n }\n\n int res = numeric_limits<int>::max();\n\n if(tree_count >= 2){\n res = 0;\n }\n else{\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n int house_j = uft.find(house_i);\n if(house_i == house_j) continue;\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(house_i,house_j));\n }\n }\n printf(\"%d\\n\",bonus + res);\n }\n}", "#include<stdio.h>\n#include<string.h>\nlong m,n,a,b,c;\nlong val[105];\nlong v[105][105];\nint getans(){\n\tint ans,i,j,k,r,s1,s2;\n\tlong a[105];\n\tlong mark[105];\n\tlong w[105];\n\tmemset(w,0,sizeof(w));\n\tif (n==2){\n\t\treturn val[0];\n\t}\n\ta[0]=0;\n\tfor (i=0;i<n;i++)\n\t mark[i]=1;\n\tans=val[a[0]];\n\tfor (i=1;i<=n-1;i++){\n r=0;\n mark[a[0]]=2;\n\t for (j=0;j<n;j++){\n\t\t\tif (mark[j]==1)\n\t\t\t w[j]=v[a[0]][j];\n\t\t}\n\t\twhile (true){\n\t\t\tk=-1;\n\t\t\tfor (j=0;j<n;j++){\n\t\t\t\tif (mark[j]==1 &&(k==-1 || w[j]>w[k]))\n\t\t\t \tk=j;\n\t\t\t}\n\t\t\tif (k==-1)\n\t\t\t break;\n\t r++;\n\t a[r]=k;\n\t ans=ans<val[k]?ans:val[k];\n\t mark[k]=2;\n\t for (j=0;j<n;j++){\n \t\tif (mark[j]==1)\n \t\t w[j]+=v[j][k];\n \t}\n\t\t}\n\t\ts1=a[r-1];s2=a[r];\n\t\tval[s1]+=val[s2];\n\t\tval[s1]-=v[s1][s2]*2;\n\t\tmark[s2]=3;\n\t\tfor (j=0;j<n;j++){\n\t\t\tif (mark[j]!=3){\n\t\t\t\tv[s1][j]=v[j][s1]=v[s1][j]+v[j][s2];\n mark[j]=1;\n\t\t\t}\n\t }\n\t\tv[s1][s2]=v[s2][s1]=0;\n\t}\n\treturn ans;\n}\nint main(){\n while (scanf(\"%d %d\",&n,&m)==2){\n \tint nowans=0;\n\t\tif (n==0)\n \t return 0;\n \tmemset(val,0,sizeof(val));\n \tmemset(v,0,sizeof(v));\n\t\t for (int j=0;j<m;j++){\n \t\t\tscanf(\"%d %d %d\",&a,&b,&c);\n \t\t\tif (c<=0)\n \t\t\t nowans+=c;\n\t\t\t else{\n\t \t\t\tv[a][b]=v[b][a]=v[a][b]+c;\n \t\t\t\tval[a]+=c;\n \t\t\t\tval[b]+=c;\n\t\t\t }\n\t\t\t}\n\t\tprintf(\"%d\\n\",nowans+getans());\n\t}\n}", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n\nusing namespace std;\n\n\n#define INF (1<<29)\n\n// math\n#define Sq(x) ((x)*(x))\n\n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n\n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n\n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n\ntypedef long long ll;\n\n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n\n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n\n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n\n//////////////////////////////////////////////////////////////\n\n\nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n\n#define MAX_E (300)\n\nvector<Edge> es[MAX_E];\nint N, M;\n\nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n\tif(e->id != x && !used[e->to]) {\n\t used[e->to] = 1;\n\t NEXT.PB(e->to);\n\t}\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n\nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n\tes[s].PB(Edge(t, c, id));\n\tes[t].PB(Edge(s, c, id));\n\tcost.PB(c);\n\tid ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n\tans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}", "#include<bits/stdc++.h>\n#define N 105\nusing namespace std;\n\nstruct edge{\n int to, num;\n};\n\nint n, m;\nvector<edge> G[N];\nint A, B, minuscost;\n\nint used[N], cost[N];\n\nint dfs(int x){\n \n if(used[x]) return 0;\n used[x]=1;\n \n int res=0;\n \n for(int i=0;i<G[x].size();i++){\n if(A==G[x][i].num) continue;\n if(B==G[x][i].num) continue;\n res+=dfs(G[x][i].to);\n }\n \n return res+1;\n}\n\nvoid solve(){\n \n memset(used,0,sizeof(used));\n \n A=-1, B=-1;\n \n int nodesum=dfs(0);\n \n if(nodesum!=n){\n cout<<minuscost<<endl;\n return ;\n }\n \n int ans=(1e9);\n \n for(int i=0;i<m;i++){\n A=i;\n for(int j=i+1;j<m;j++){\n B=j;\n memset(used,0,sizeof(used));\n int r=dfs(0);\n if(r!=n) ans=min(ans, cost[A]+cost[B]+minuscost);\n }\n B=-1;\n memset(used,0,sizeof(used));\n int r=dfs(0);\n if(r!=n) ans=min(ans, cost[A]+minuscost);\n }\n \n cout<<ans<<endl;\n}\n\nint main(){\n\n while(1){\n \n cin>>n>>m;\n if(!n&&!m) break;\n \n minuscost=0;\n \n int cnt=0;\n \n for(int i=0;i<m;i++){\n int x, y, c;\n cin>>x>>y>>c;\n if(c<=0){\n\tminuscost+=c;\n\tcontinue;\n }\n cost[cnt]=c;\n G[x].push_back((edge){y,cnt});\n G[y].push_back((edge){x,cnt++});\n }\n\n m=cnt;\n \n solve();\n\n for(int i=0;i<n;i++) G[i].clear();\n }\n \n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct Fordfulerson{\n const int INF = 1<<28;\n struct edge{\n int to,cap,rev;\n edge(){};\n edge(int to,int cap,int rev):to(to),cap(cap),rev(rev){};\n };\n int n;\n vector<vector<edge> > G;\n vector<int> used;\n\n Fordfulerson(){};\n Fordfulerson(int sz):n(sz),G(n),used(n){}\n\n void add_edge(int from,int to,int cap){\n G[from].push_back(edge(to,cap,G[to].size()));\n G[to].push_back(edge(from,0,G[from].size()-1));\n }\n\n int dfs(int v,int t,int f){\n if(v == t) return f;\n used[v] = true;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(!used[e.to] && e.cap > 0){\n\tint d = dfs(e.to,t,min(f,e.cap));\n\tif(d > 0){\n\t e.cap -= d;\n\t G[e.to][e.rev].cap += d;\n\t return d;\n\t}\n }\n }\n return 0;\n }\n\n int max_flow(int s,int t){\n int flow = 0;\n for(;;){\n fill(used.begin(),used.end(),0);\n int f = dfs(s,t,INF);\n if(f == 0) return flow;\n flow += f;\n }\n }\n};\n\nstruct SCC{\n int n;\n vector<vector<int> > G,rG,T,C;\n vector<int> vs,used,belong;\n SCC(){};\n SCC(int sz):n(sz),G(sz),rG(sz),used(sz),belong(sz){}\n\n void add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n }\n\n void dfs(int v){\n used[v] = 1;\n for(int i=0;i<(int)G[v].size();i++){\n if(!used[G[v][i]]) dfs(G[v][i]);\n }\n vs.push_back(v);\n }\n\n void rdfs(int v,int k){\n used[v] = 1;\n belong[v] = k;\n C[k].push_back(v);\n for(int i=0;i<(int)rG[v].size();i++) {\n if(!used[rG[v][i]]) rdfs(rG[v][i],k);\n }\n }\n\n int build(){\n fill(used.begin(),used.end(),0);\n vs.clear();\n for(int v=0;v<n;v++){\n if(!used[v]) dfs(v);\n }\n\n fill(used.begin(),used.end(),0);\n int k=0;\n for(int i=vs.size()-1;i>=0;i--){\n if(!used[vs[i]]){\n\tT.push_back(vector<int>());\n\tC.push_back(vector<int>());\n\trdfs(vs[i],k++);\n }\n }\n return k;\n }\n\n};\n\nstruct UnionFind{\n int n;\n vector<int> r,p;\n UnionFind(int n):n(n),r(n,1),p(n){iota(p.begin(),p.end(),0);}\n int find(int x){\n if(x==p[x]) return x;\n return p[x]=find(p[x]);\n }\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y) return;\n if(r[x]<r[y]) swap(x,y);\n r[x]+=r[y];\n p[y]=x;\n }\n};\n\nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n int n,m;\n while(cin>>n>>m,n){\n vector<int> x(m),y(m),c(m);\n int ans=0;\n UnionFind uf(n);\n SCC scc(n);\n for(int i=0;i<m;i++){\n cin>>x[i]>>y[i]>>c[i];\n if(c[i]<=0) ans+=c[i];\n else{\n\tscc.add_edge(x[i],y[i]);\n\tuf.unite(x[i],y[i]);\n }\n }\n if(uf.r[uf.find(0)]!=n){\n cout<<ans<<endl;\n continue;\n }\n scc.build();\n //cout<<ans<<endl;\n auto b=scc.belong;\n vector<int> v;\n int t=-1;\n for(int i=0;i<m;i++){\n if(c[i]<=0) continue;\n if(b[x[i]]==b[y[i]]){\n\tv.emplace_back(c[i]);\n\tcontinue;\n }\n if(t<0||c[i]<t) t=c[i];\n }\n sort(v.begin(),v.end());\n if(!v.empty()&&(t<0||v[0]+v[1]<t)) t=v[0]+v[1];\n cout<<ans+t<<endl;\n }\n return 0;\n}", "#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<climits>\n#include<ctime>\n#include<cstdlib>\n#include<vector>\n#include<algorithm>\n#include<cassert>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n#define mp make_pair\n#define ALL(C) (C).begin(),(C).end()\n#define fi first\n#define se second\n\nconst int N = 10000;\nstruct Edge{\n int to,cost;\n};\n//solve connected graph\nvector<int> edgeOnCycle;//only cost is enough\nvector<int> edgeOnTree;//only cost is enough\nint minEdgeOnCycle[2];//[0] < [1]\nint minEdgeOnTree;\nvector<Edge> edge[N];//\nint dig[N];//for assertion\n\nint vis[N];\nbool dfs(int now,int color){\n if (vis[now])return vis[now] == color;\n vis[now]=color;\n bool oncycle=false;\n rep(i,(int)edge[now].size()){\n bool tmp=dfs(edge[now][i].to,color);\n if (tmp){\n oncycle=true;\n if (edge[now][i].cost < minEdgeOnCycle[0]){\n\tminEdgeOnCycle[1]=minEdgeOnCycle[0];\n\tminEdgeOnCycle[0]=edge[now][i].cost;\n }else if (edge[now][i].cost < minEdgeOnCycle[1]){\n\tminEdgeOnCycle[1]=edge[now][i].cost;\n }\n }else minEdgeOnTree=min(minEdgeOnTree,edge[now][i].cost);\n }\n return oncycle;\n}\n\n//find connect ?\nvector<int> udedge[N];//undirect\nvoid dfs2(int now){\n if (vis[now])return;\n vis[now]=true;\n rep(i,(int)udedge[now].size()){\n dfs2(udedge[now][i]);\n }\n}\n\nbool isconnected(int n){\n rep(i,n)vis[i]=0;\n dfs2(0);\n rep(i,n){\n if (vis[i]==0)return false;\n }\n return true;\n}\n\nint solve(int n){\n if (!isconnected(n))return 0;\n int color=1;\n rep(i,n)vis[i]=0;\n rep(i,n){\n if (vis[i] == 0)dfs(i,color),color++;\n }\n if (minEdgeOnCycle[0] == INT_MAX)return minEdgeOnTree;\n return min(minEdgeOnCycle[0]+minEdgeOnCycle[1],minEdgeOnTree);\n}\n\nint main(){\n int n,m;\n while(cin>>n>>m && n){\n rep(i,n){\n udedge[i].clear();\n edge[i].clear();\n dig[i]=0;\n }\n edgeOnCycle.clear();\n edgeOnTree.clear();\n minEdgeOnCycle[0]=INT_MAX;\n minEdgeOnCycle[1]=INT_MAX;\n minEdgeOnTree=INT_MAX;\n int ans=0;\n rep(i,m){\n int f,t,c;\n cin>>f>>t>>c;\n dig[t]++;\n if (c <= 0){//elminate negative edge (also negative seledge)\n\tans+=c;//c<0\n }else if (f == t){//ignore self edge of positive cost\n }else {\n\tedge[f].push_back((Edge){t,c});\n\tudedge[f].push_back(t);\n\tudedge[t].push_back(f);\n }\n }\n rep(i,n)if (dig[i] >1)assert(false);\n\n int sum=solve(n);\n cout << ans+sum << endl;\n }\n return false;\n}" ]
A huge amount of information is being heaped on WWW. Albeit it is not well-organized, users can browse WWW as an unbounded source of up-to-date information, instead of consulting established but a little out-of-date encyclopedia. However, you can further exploit WWW by learning more about keyword search algorithms. For example, if you want to get information on recent comparison between Windows and UNIX, you may expect to get relevant description out of a big bunch of Web texts, by extracting texts that contain both keywords "Windows" and "UNIX" close together. Here we have a simplified version of this co-occurrence keyword search problem, where the text and keywords are replaced by a string and key characters, respectively. A character string S of length n (1 ≤ n ≤ 1,000,000) and a set K of k distinct key characters a1, ..., ak (1 ≤ k ≤ 50) are given. Find every shortest substring of S that contains all of the key characters a1, ..., ak. Input The input is a text file which contains only printable characters (ASCII codes 21 to 7E in hexadecimal) and newlines. No white space such as space or tab appears in the input. The text is a sequence of the shortest string search problems described above. Each problem consists of character string Si and key character set Ki (i = 1, 2, ..., p). Every Si and Ki is followed by an empty line. However, any single newline between successive lines in a string should be ignored; that is, newlines are not part of the string. For various technical reasons, every line consists of at most 72 characters. Each key character set is given in a single line. The input is terminated by consecutive empty lines; p is not given explicitly. Output All of p problems should be solved and their answers should be output in order. However, it is not requested to print all of the shortest substrings if more than one substring is found in a problem, since found substrings may be too much to check them all. Only the number of the substrings together with their representative is requested instead. That is, for each problem i, the number of the shortest substrings should be output followed by the first (or the leftmost) shortest substring si1, obeying the following format: the number of the shortest substrings for the i-th problem empty line the first line of si1 the second line of si1 ... the last line of si1 empty line for the substring termination where each line of the shortest substring si1 except for the last line should consist of exactly 72 characters and the last line (or the single line if the substring is shorter than or equal to 72 characters, of course) should not exceed 72 characters. If there is no such substring for a problem, the output will be a 0 followed by an empty line; no more successive empty line should be output because there is no substring to be terminated. Examples Input Thefirstexampleistrivial. mfv AhugeamountofinformationisbeingheapedonWWW.Albeititisnot well-organized,userscanbrowseWWWasanunboundedsourceof up-to-dateinformation,insteadofconsultingestablishedbutalittle out-of-dateencyclopedia.However,youcanfurtherexploitWWWby learningmoreaboutkeywordsearchalgorithms.Forexample,ifyou wanttogetinformationonrecentcomparisonbetweenWindowsandUNIX, youmayexpecttogetrelevantdescriptionoutofabigbunchofWeb texts,byextractingtextsthatcontainbothkeywords"Windows"and"UNIX" closetogether. bWn 3.1415926535897932384626433832795028841971693993751058209749445923078164 pi Wagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky Weary ASCIIcharacterssuchas+,*,[,#, Output 1 firstexampleistriv 7 nWWW.Alb 0 1 Wagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky 1 CIIcharacterssuchas+,*,[,#, Input Thefirstexampleistrivial. mfv AhugeamountofinformationisbeingheapedonWWW.Albeititisnot well-organized,userscanbrowseWWWasanunboundedsourceof up-to-dateinformation,insteadofconsultingestablishedbutalittle out-of-dateencyclopedia.However,youcanfurtherexploitWWWby learningmoreaboutkeywordsearchalgorithms.Forexample,ifyou wanttogetinformationonrecentcomparisonbetweenWindowsandUNIX, youmayexpecttogetrelevantdescriptionoutofabigbunchofWeb texts,byextractingtextsthatcontainbothkeywords"Windows"and"UNIX" closetogether. bWn 3.1415926535897932384626433832795028841971693993751058209749445923078164 pi Wagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky Weary ASCIIcharacterssuchas+,*,[,#,<,},_arenotexcludedinagivenstringas thisexampleillustratesbyitself.Youshouldnotforgetthem.Onemorefact youshouldnoticeisthatuppercaselettersandlowercaselettersare distinguishedinthisproblem.Don'tidentify"g"and"G",forexmaple. However,weareafraidthatthisexamplegivesyoutoomuchhint! ![GsC_l ETAONRISHDLFCMUGYPWBVKXJQZ ABCDEFGHIJKLMNOPQRSTUVWXYZ Output 1 firstexampleistriv 7 nWWW.Alb 0 1 Wagner,Bach,Beethoven,Chopin,Brahms,Hindemith,Ives,Suk,Mozart,Stravinsky 1 CIIcharacterssuchas+,*,[,#,<,},_arenotexcludedinagivenstringasthisexampl eillustratesbyitself.Youshouldnotforgetthem.Onemorefactyoushouldnoticeis thatuppercaselettersandlowercaselettersaredistinguishedinthisproblem.Don 'tidentify"g"and"G",forexmaple.However,weareafraidthatthisexamplegivesyo utoomuchhint! 1 ETAONRISHDLFCMUGYPWBVKXJQZ
[ "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic int[] key = new int[256];\n\n\tpublic static void main(String[] args) {\n\t\twhile (true) {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\twhile (true) {\n\t\t\t\tString line = sc.nextLine();\n\t\t\t\tif (line.isEmpty()) break;\n\t\t\t\tsb.append(line);\n\t\t\t}\n\t\t\tchar[] input = sb.toString().toCharArray();\n\t\t\tint N = input.length;\n\t\t\tArrays.fill(key, -1);\n\t\t\tString keys = sc.nextLine();\n\t\t\tfor (int i = 0; i < keys.length(); ++i) {\n\t\t\t\tkey[keys.charAt(i)] = i;\n\t\t\t}\n\t\t\tint[] count = new int[keys.length()];\n\t\t\tint l = 0;\n\t\t\tint r = 0;\n\t\t\tint ans = Integer.MAX_VALUE;\n\t\t\tint ansC = 0;\n\t\t\tString repr = \"\";\n\t\t\tint found = 0;\n\t\t\twhile (r < N) {\n\t\t\t\twhile (r < N) {\n\t\t\t\t\tif (key[input[r]] >= 0) {\n\t\t\t\t\t\tif (count[key[input[r]]] == 0) ++found;\n\t\t\t\t\t\tcount[key[input[r]]]++;\n\t\t\t\t\t\tif (found == keys.length()) break;\n\t\t\t\t\t}\n\t\t\t\t\t++r;\n\t\t\t\t}\n\t\t\t\tif (r == N) break;\n\t\t\t\twhile (true) {\n\t\t\t\t\tif (key[input[l]] >= 0) {\n\t\t\t\t\t\t--count[key[input[l]]];\n\t\t\t\t\t\tif (count[key[input[l]]] == 0) {\n\t\t\t\t\t\t\t--found;\n\t\t\t\t\t\t\tif (r - l + 1 < ans) {\n\t\t\t\t\t\t\t\tans = r - l + 1;\n\t\t\t\t\t\t\t\tansC = 1;\n\t\t\t\t\t\t\t\trepr = String.valueOf(input, l, r - l + 1);\n\t\t\t\t\t\t\t} else if (r - l + 1 == ans) {\n\t\t\t\t\t\t\t\t++ansC;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t++l;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t++l;\n\t\t\t\t}\n\t\t\t\t++r;\n\t\t\t}\n\n\t\t\tif (ansC == 0) {\n\t\t\t\tSystem.out.println(0);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(ansC);\n\t\t\t\tStringBuilder result = new StringBuilder();\n\t\t\t\tfor (int i = 0; i < repr.length(); ++i) {\n\t\t\t\t\tif (i % 72 == 0) {\n\t\t\t\t\t\tresult.append('\\n');\n\t\t\t\t\t}\n\t\t\t\t\tresult.append(repr.charAt(i));\n\t\t\t\t}\n\t\t\t\tSystem.out.println(result);\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t\tif (!sc.hasNext()) break;\n\t\t\tsc.nextLine();\n\t\t}\n\t}\n\n}", "#include <iostream>\n#include <cstring>\n#include <climits>\nusing namespace std;\n\nvoid solve(string s,string key){\n int left = 0, right = 0;\n int n = s.length(), m = key.length();\n int minLen = INT_MAX, cnt = 0;\n string minStr = \"\";\n\n int level[256];\n bool flg[256];\n memset(flg,0,sizeof(flg));\n memset(level,0,sizeof(level));\n for(int i=0;i<m;i++) flg[key[i]] = true;\n\n int sum = 0;\n\n while(1){\n while(right < n && sum < m){\n level[s[right]]++;\n if(flg[s[right]] && level[s[right]] == 1){\n sum++;\n }\n right++;\n }\n\n if(sum < m) break;\n if(right - left < minLen){\n minLen = right - left;\n minStr = s.substr(left,right-left);\n cnt = 1;\n }\n else if(right - left == minLen){\n cnt++;\n }\n\n level[s[left]]--;\n if(flg[s[left]] && level[s[left]] == 0){\n sum--;\n }\n left++;\n }\n\n if(minLen == INT_MAX){\n cout<<\"0\\n\\n\";\n }\n else{\n cout<<cnt<<endl<<endl;\n int i;\n for(i=0;i<minStr.length();i++){\n if(i != 0 && i % 72 == 0) cout<<endl;\n cout<<minStr[i];\n }\n cout<<endl<<endl;\n }\n}\n\nint main(void){\n while(1){\n string s,key;\n\n while(1){\n string tmp;\n getline(cin,tmp);\n if(tmp.empty()) break;\n s += tmp;\n }\n\n if(s == \"\") break;\n getline(cin,key);\n solve(s,key);\n\n getline(cin,s);\n }\n\n return 0;\n}", "#include<list>\n#include<set>\n#include<algorithm>\n#include<iostream>\n#include<string>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint main(){\n int i;\n string s;\n while(getline(cin, s)){\n string t=s,u;\n while(getline(cin,s)){\n if(s.length()==0)\n\tbreak;\n t+=s;\n }\n if(t.length()==0)\n break;\n while(getline(cin,s)){\n if(s.length()==0)\n\tbreak;\n u+=s;\n }\n /*\n string s;\n while(getline(cin,s)){\n string t=s;\n while(getline(cin,s)&&s!=\"\")\n t+=s;\n string u;\n getline(cin,u);\n getline(cin,s);\n */\n char z[256];\n memset(z,0,sizeof(z));\n int uln=u.length();\n for(i=0;i<uln;i++)\n z[(int)u[i]]=u[i];\n list<pair<int,set<char> > > a;\n int tln=t.length();\n int imn;\n unsigned nmn=-1;\n int ct=0;\n for(i=0;i<tln;i++){\n if(z[(int)t[i]]){\n\tset<char> b;\n\tb.insert(t[i]);\n\ta.push_back(make_pair(i,b));\n\tlist<pair<int,set<char> > >::iterator it;\n\tfor(it=a.begin();it!=a.end();it++){\n\t (*it).second.insert(t[i]);\n\t if((int)(*it).second.size()==uln){\n\t if(nmn>(unsigned)(i-(*it).first+1)){\n\t imn=(*it).first;\n\t nmn=i-(*it).first+1;\n\t ct=1;\n\t }else if(nmn==(unsigned)(i-(*it).first+1)){\n\t ct++;\n\t }\n\t it=a.erase(it);\n\t it--;\n\t }\n\t}\n }\n }\n if(nmn==(unsigned)-1){\n cout<<0<<endl<<endl;\n }else{\n cout<<ct<<endl<<endl;\n string v=t.substr(imn,nmn);\n int vln=v.length();\n for(i=0;i<vln/72;i++)\n\tcout<<v.substr(i*72,72)<<endl;\n if(vln%72)\n\tcout<<v.substr(i*72)<<endl;\n cout<<endl;\n }\n }\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint valid[256];\nint cnt[256];\nint kind;\n\nvoid add(char c){\n\tif (!valid[c]) return;\n\tif (cnt[c]++) return;\n\t++kind;\n}\n\nvoid sub(char c){\n\tif (!valid[c]) return;\n\tif (--cnt[c]) return;\n\t--kind;\n}\n\nint main(){\n\tstring str, key;\n\twhile (1){\n\t\tstr.clear();\n\t\tkey.clear();\n\n\t\twhile (true){\n\t\t\tgetline(cin, key);\n\t\t\tif (key.empty() || !cin) break;\n\t\t\tstr += key;\n\t\t}\n\t\tif (str.empty() || !cin) break;\n\n\t\tgetline(cin, key);\n\t\tcin.ignore();\n\n\t\t//cout << str << endl;\n\t\t//cout << key << endl;\n\t\tMEMSET(cnt, 0);\n\t\tMEMSET(valid, 0);\n\t\tkind = 0;\n\t\tfor (auto &c : key) valid[c] = 1;\n\t\tint n = str.size(), m = key.size();\n\n\t\tint l = 0, r = 0;\n\t\tint ans = n + 1;\n\t\tint anscnt = 0;\n\t\tP p;\n\t\twhile (1){\n\t\t\twhile (kind < m && r < n){\n\t\t\t\tadd(str[r++]);\n\t\t\t}\n\t\t\tif (kind == m){\n\t\t\t\tif (r - l < ans){\n\t\t\t\t\tans = r - l;\n\t\t\t\t\tp = make_pair(l, r);\n\t\t\t\t\tanscnt = 1;\n\t\t\t\t}\n\t\t\t\telse if (r - l == ans){\n\t\t\t\t\t++anscnt;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (l >= r) break;\n\t\t\tsub(str[l++]);\n\t\t}\n\n\t\tcout << anscnt << endl;\n\t\tint chr = 0;\n\t\tif (anscnt){\n\t\t\tcout << endl;\n\t\t\tfor (int i = p.first; i < p.second; ++i){\n\t\t\t\tcout << str[i];\n\t\t\t\t++chr;\n\t\t\t\tif (chr % 72 == 0) cout << endl;\n\t\t\t}\n\t\t\tif (chr % 72) cout << endl;\n\t\t}\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}", "#include <set>\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <cstdio>\n#include <algorithm>\n\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)\n\nusing namespace std;\n\nint main(){\n while(true){\n stringstream ss;\n string tmp;\n\n if(!getline(cin, tmp)) break;\n ss << tmp;\n while(true){\n getline(cin, tmp);\n if(tmp == \"\") break;\n ss << tmp;\n }\n\n string str = ss.str();\n if(str.size() == 0) break;\n string key; getline(cin, key);\n\n vector<vector<int> > v(128);\n vector<bool> f(128, false);\n\n FOR(it, key) f[*it] = true;\n REP(i, str.size()){\n if(f[str[i]]){\n\tv[str[i]].push_back(i);\n }\n }\n\n int start = 0;\n int end = str.size();\n int cnt = 0;\n\n REP(i, str.size()){\n if(f[str[i]]){\n\tint e = i + 1;\n\tFOR(it, key) if(*it != str[i]){\n\t vector<int>::iterator it2 =\n\t lower_bound(v[*it].begin(), v[*it].end(), i + 1);\n\n\t if(it2 == v[*it].end()) goto next;\n\t e = max(e, *it2 + 1);\n\t}\n\n\tif(end - start > e - i){\n\t start = i;\n\t end = e;\n\t cnt = 1;\n\t}else if(end - start == e - i){\n\t cnt++;\n\t}\n next:;\n }\n }\n\n if(cnt){\n printf(\"%d\\n\\n\", cnt);\n\n for(int i = 0; i + start < end; i++){\n\tputchar(str[i + start]);\n\tif(i % 72 == 72 - 1) puts(\"\");\n\telse if(i + start + 1 == end) puts(\"\");\n }\n puts(\"\");\n \n }else{\n puts(\"0\"); puts(\"\");\n }\n }\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\nusing namespace std;\n\n#define FOUND 1\n#define NOT_FOUND -1\n\nbool compare(string s1, string s2){\n if(s1.size() == s2.size()) return s1 < s2;\n return s1.size() < s2.size();\n} \n\nint main(){\n string in, sub;\n string seq;\n bool flag = true;\n while(getline(cin, in)){\n if(!flag && (in.size() == 0 || cin.eof())){\n if(cin.eof()) sub += in; \n flag = true;\n \n map<char, int > mp;\n set<char> data;\n\n for(int i = 0 ; i < sub.size() ; i++) data.insert(sub[i]);\n for(int i = 0 ; i < sub.size() ; i++) mp[ sub[i] ] = NOT_FOUND;\n \n int ans = 0;\n int len = (1<<29);\n string ans2;\n \n for(int i = 0 ; i < seq.size() ; i++){\n\tif(data.find(seq[i]) == data.end()) continue;\n\tmp[ seq[i] ] = i;\n\t\n\tint left = (1<<29);\n\tbool ok = true;\n\tfor(int j = 0 ; j < sub.size() ; j++){\n\t if(mp[ sub[j] ] == NOT_FOUND){\n\t ok = false;\n\t break;\n\t }\n\t left = min(left, mp[ sub[j] ]);\n\t}\n\t\n\tif(!ok) continue;\n\t\n\tif(i - left == len) ans++;\n\tif(i - left < len){\n\t len = i - left;\n\t ans = 1;\n\t //cout << \"i = \" << i << \" left = \" << left << endl;\n\t //cout << i << endl;\n\t ans2 = seq.substr(left, i-left+1);\n\t //cout << seq.substr(left, i-left+1) << endl;\n\t}\n\t\n }\n \n cout << ans << endl << endl;\n if(ans != 0){\n\tfor(int i = 0 ; i < ans2.size() ; i += 72){\n\t cout << ans2.substr(i, 72) << endl;\n\t}\n\tif(!cin.eof()) cout << endl;\n }\n\n //cout << \"ans_len = \" << len << endl;\n //cout << \"ans_cnt = \" << ans << endl;\n //cout << \"seq = \" << seq << endl;\n //cout << \"sub = \" << sub << endl;\n //cout << endl;\n seq = \"\", sub = \"\";\n continue;\n }\n else if(flag && in.size() != 0){\n seq += in;\n continue;\n }\n else if(flag && in.size() == 0){\n flag = false;\n continue;\n }\n else if(!flag && in.size() != 0){\n sub += in;\n continue;\n }\n \n \n\n }\n \n return 0;\n}", "#include<iostream>\n#include<vector>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nint need[255];\nbool is_need[255];\n\n\nvoid solve(string &a,int num){\n pair<int,int> ans;\n int tlength=a.size()+1,cnt=0;\n int bef=0;\n \n rep(i,a.size()){\n if ( is_need[a[i]]==false)continue;\n \n\n if ( need[a[i]]==0){\n num--;\n }\n need[a[i]]++;\n if ( need[a[i]] ){ \n while(bef<i){\n\tif ( is_need[a[bef]]==0);\n\telse if (need[a[bef]]<=is_need[a[i]])break;\n\telse need[a[bef]]--;\n\tbef++;\n }\n }\n \n if ( num == 0 && 1+i-bef<=tlength){//update\n if ( 1+i-bef < tlength){\n\tcnt=0;\n\tans=make_pair(bef,i+1);\n }\n tlength=1+i-bef;\n cnt++;\n }\n }\n\n\n cout << cnt << endl;\n if (cnt==0){puts(\"\");return;}\n for(int i=ans.first,j=0;i<ans.second;j++,i++){\n if (j%72==0)puts(\"\");\n putchar(a[i]);\n }\n puts(\"\");\n puts(\"\");\n return;\n}\n\n\n\nint main(){\n string t,a,target;\n while(getline(cin,a) && a.size() !=0){\n while(getline(cin,t) && t.size() != 0)a+=t;\n getline(cin,target);\n getline(cin,t);\n rep(i,255)is_need[i]=0,need[i]=0;\n rep(i,target.size())is_need[target[i]]=true;\n \n solve(a,target.size());\n }\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nstring S,K;\nconst int n = 1<<8;\n\nint getlen(){\n int mx[n],res=1e9;\n memset(mx,-1,sizeof(mx));\n for(int i=0;i<S.size();i++){\n int ch = S[i];\n mx[ch] = max(mx[ch],i);\n int c=0,l=1e9;\n for(int j=0;j<K.size();j++)c+=mx[K[j]]>=0,l=min(l,mx[K[j]]);\n if(c<K.size()) continue;\n res=min(res,i-l);\n }\n return res;\n}\n\nint count(int len){\n int cnt[n]={},res=0;\n for(int i=0;i<S.size();i++){\n cnt[S[i]]++;\n int c=0;\n for(int j=0;j<K.size();j++)c+=cnt[K[j]]>0;\n if(c==K.size())res++;\n if(i-len>=0) cnt[S[i-len]]--;\n }\n return res;\n}\n\nstring getstr(int len){\n int cnt[n]={},res=0;\n for(int i=0;i<S.size();i++){\n cnt[S[i]]++;\n int c=0;\n for(int j=0;j<K.size();j++)c+=cnt[K[j]]>0;\n if(c==K.size()) return S.substr(i-len,len+1);\n if(i-len>=0) cnt[S[i-len]]--;\n }\n return \"\";\n}\n\nint main(){\n while(1){\n S.clear();\n while(1){\n string s; \n getline(cin,s);\n if(s.empty()) break;\n S+=s;\n }\n if(S.empty())break;\n getline(cin,K);\n \n int len = getlen();\n cout<<count(len)<<endl;\n string str = getstr(len);\n for(int i=0;i<str.size();i++){\n if(i!=str.size()-1&&i%72==0)cout<<endl;\n cout<<str[i];\n }\n cout<<endl;\n if(len<1e9)cout<<endl;\n getline(cin,K); \n }\n return 0;\n}", "#include<iostream>\n#include<cmath>\n#include<cstdio>\n \n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n \nusing namespace std;\n \nvoid compute(string text,string S)\n{\n int nt = text.size(),nS = S.size();\n int mlen = inf;\n string ans;\n bool found[nS];\n int CNT = 0;\n int fpos[nS];\n rep(i,nS)found[i] = false;\n \n rep(i,nt)\n {\n bool update = false;\n int cnt = 0,mn,mx;\n mn = inf,mx = -inf;\n rep(j,nS)\n\t{\n\t if(S[j] == text[i])\n\t {\n\t update = true;\n\t found[j] = true;\n\t fpos[j] = i;\n\t }\n\t if(found[j])\n\t {\n\t cnt++;\n\t mn = min(mn,fpos[j]);\n\t mx = max(mx,fpos[j]);\n\t }\n\t}\n if(cnt == nS)\n\t{\n\t int cost = mx - mn + 1;\n\t if(cost < mlen)\n\t {\n\t mlen = cost;\n\t ans = text.substr(mn,cost);\n\t CNT = 1;\n\t }\n\t else if(cost == mlen && update)CNT++;\t \n\t}\n }\n cout << CNT << endl << endl;\n if(!CNT)return;\n\n rep(i,ans.size())\n if((i+1)%72 == 0 && i != 0)\n printf(\"%c\\n\",ans[i]);\n else\n printf(\"%c\",ans[i]);\n if(ans.size()%72 != 0)puts(\"\\n\");\n else puts(\"\");\n}\n \nint main()\n{\n string blank;\n while(getline(cin,blank))\n {\n string text,S;\n text += blank;\n while(getline(cin,blank))\n\t{\n\t if(blank.empty())break;\n\t text += blank;\n\t}\n if(text.empty())goto Fin;\n while(getline(cin,blank))\n\tif(blank.empty())break;\n\telse S += blank;\n compute(text,S);\n }\n Fin:;\n return 0;\n}", "//47\n#include<iostream>\n#include<sstream>\n#include<string>\n#include<map>\n#include<algorithm>\n#include<set>\n\nusing namespace std;\n\nint main(){\n for(string si;getline(cin,si),si!=\"\";){\n string s;\n do{\n s+=si;\n getline(cin,si);\n }while(si!=\"\");\n string k;\n getline(cin,k);\n\n bool ap[128]={};\n for(int i=0;i<k.size();){\n if(ap[k[i]]++){\n\tk.erase(i,1);\n }else{\n\ti++;\n }\n }\n\n cin.ignore();\n map<char,int> m;\n int f=0,l=1<<30;\n int n=0;\n set<long long> st;\n for(int i=0;i<s.size();i++){\n for(int j=0;j<k.size();j++){\n\tif(k[j]==s[i]){\n\t m[s[i]]=i;\n\t}\n }\n if(m.size()!=k.size())continue;\n int cl=0,cf=1<<30;\n for(int j=0;j<k.size();j++){\n\tcl=max(cl,m[k[j]]);\n\tcf=min(cf,m[k[j]]);\n }\n if(!st.insert((long long)cl<<32|cf).second)continue;\n if(cl-cf<=l-f){\n\tif(cl-cf<l-f){\n\t f=cf;\n\t l=cl;\n\t n=0;\n\t}\n\tn++;\n }\n }\n cout<<n<<endl<<endl;\n if(n){\n string t=s.substr(f,l-f+1);\n for(int i=0;i<t.size();i+=72){\n\tcout<<t.substr(i,72)<<endl;\n }\n cout<<endl;\n }\n }\n return 0;\n}\n ", "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nint main(){\n bool begin = true;\n while(true){\n string s, text, query;\n while(getline(cin, s) && s != \"\"){\n text += s;\n }\n if(text == \"\") break;\n getline(cin, query);\n assert(query != \"\");\n getline(cin, s); // empty\n assert(s == \"\");\n\n /*\n if(begin) begin = false;\n else cout << endl;\n */\n\n int N = text.size();\n int L = query.size();\n\n map<char, int> to_idx;\n REP(i, L) to_idx[query[i]] = i;\n\n vector<int> idx_vec[100];\n REP(i, N) if(to_idx.count(text[i])) idx_vec[to_idx[text[i]]].push_back(i);\n\n bool ok = true;\n REP(i, L) if(idx_vec[i].empty()) ok = false;\n if(!ok){\n cout << 0 << endl;\n cout << endl;\n continue;\n }\n\n map<int, set<int> > cnt;\n int shortest_length = INF;\n vector<int> cur(L);\n while(true){\n int b = idx_vec[0][cur[0]], e = idx_vec[0][cur[0]];\n REP(i, L) {\n b = min(b, idx_vec[i][cur[i]]);\n e = max(e, idx_vec[i][cur[i]]);\n }\n int l = e - b + 1;\n shortest_length = min(shortest_length, l);\n if(shortest_length == l) cnt[l].insert(b);\n\n int idx = -1;\n REP(i, L)if(cur[i] + 1 < idx_vec[i].size()){\n if(idx == -1 || idx_vec[i][cur[i] + 1] < idx_vec[idx][cur[idx] + 1]){\n idx = i;\n }\n }\n if(idx == -1) break;\n cur[idx] += 1;\n }\n cout << cnt[shortest_length].size() << endl;\n cout << endl;\n string ans = text.substr(*cnt[shortest_length].begin(), shortest_length);\n for(int i = 0; i < ans.size(); i += 72){\n if(i + 72 < ans.size()) cout << ans.substr(i, 72) << endl;\n else cout << ans.substr(i) << endl;\n }\n cout << endl;\n }\n return 0;\n}", "#include<cstdio>\n#include<string>\n#include<iostream>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint main(){\n\twhile(1){\n\t\tstring s,tmp;\n\t\twhile(1){\n\t\t\tgetline(cin,tmp);\n\t\t\tif(tmp==\"\") break;\n\t\t\ts+=tmp;\n\t\t}\n\t\tstring a; getline(cin,a);\n\t\tgetline(cin,tmp);\n\t\tif(a==\"\") break;\n\n\t\tint m=a.length();\n\t\tbool b[128]={};\n\t\trep(i,m) b[a[i]]=true;\n\n\t\tint n=s.length();\n\t\tint j_ans,w_ans=2*n,c_ans=0;\n\t\tint cnt[128]={},cnt2=0;\n\t\tfor(int i=0,j=0;i<n;i++){\n\t\t\tif(cnt[s[i]]==0 && b[s[i]]) cnt2++;\n\t\t\tcnt[s[i]]++;\n\n// printf(\"i=%2d, j=%2d\\n\",i,j);\n\t\t\tif(cnt2==m){\n\t\t\t\twhile(j<i && cnt[s[j]]>1 || cnt[s[j]]==1 && !b[s[j]]){\n\t\t\t\t\tcnt[s[j]]--;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif(i-j+1<w_ans){\n\t\t\t\t\tj_ans=j;\n\t\t\t\t\tw_ans=i-j+1;\n\t\t\t\t\tc_ans=1;\n\t\t\t\t}\n\t\t\t\telse if(i-j+1==w_ans){\n\t\t\t\t\tc_ans++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout<<c_ans<<endl<<endl;\n\t\tif(c_ans>0){\n\t\t\tstring ans=s.substr(j_ans,w_ans);\n\t\t\tfor(int i=0;i<w_ans;i+=72){\n\t\t\t\tfor(int j=i;j<min(i+72,w_ans);j++) cout<<ans[j];\n\t\t\t\tcout<<endl;\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\n\treturn 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\nconst int INF = 1<<29;\n\nint main() {\n string s;\n while(getline(cin,s)) {\n if (s == \"\") break;\n string t;\n while(getline(cin,t), t!=\"\")\n s+=t;\n string key;\n while(getline(cin,t)) {\n if (t==\"\") break;\n key+=t;\n }\n // cout << \"hoge\" << endl;\n // cout << s << \" \" << key << endl;\n\n set<char> se;\n map<char, int> mp;\n FOR(it, key) {\n se.insert(*it);\n mp[*it] = -1;\n }\n\n int num = 0;\n string res;\n REP(i,s.size()) {\n if (se.count(s[i])) {\n mp[s[i]] = i;\n bool f = 1;\n int pos = INF;\n FOR(it, mp) {\n if (it->second < 0) f = 0;\n pos = min(pos, it->second);\n }\n if (f) {\n if (res == \"\" || i-pos+1 < res.size()) {\n num = 1;\n// cout << \";\"<<pos<<\" \"<<s.size() << endl;\n res = s.substr(pos, i-pos+1);\n } else if (i-pos+1 == res.size())\n num++;\n }\n }\n }\n cout << num << endl << endl;;\n if (num) {\n for (int i=0; i<res.size(); i+=72) {\n// cout << min((int)s.size()-i,72) << endl;\n cout << res.substr(i, min((int)res.size()-i,72)) << endl;;\n }\n cout << endl;\n }\n }\n}", "//47\n#include<iostream>\n#include<sstream>\n#include<string>\n#include<map>\n#include<algorithm>\n#include<set>\n\nusing namespace std;\n\nint main(){\n for(string si;getline(cin,si),si!=\"\";){\n string s;\n do{\n s+=si;\n getline(cin,si);\n }while(si!=\"\");\n string k;\n getline(cin,k);\n cin.ignore();\n map<char,int> m;\n int f=0,l=1<<30;\n int n=0;\n set<long long> st;\n for(int i=0;i<s.size();i++){\n for(int j=0;j<k.size();j++){\n\tif(k[j]==s[i]){\n\t m[s[i]]=i;\n\t}\n }\n if(m.size()!=k.size())continue;\n int cl=0,cf=1<<30;\n for(int j=0;j<k.size();j++){\n\tcl=max(cl,m[k[j]]);\n\tcf=min(cf,m[k[j]]);\n }\n if(!st.insert((long long)cl<<32|cf).second)continue;\n if(cl-cf<=l-f){\n\tif(cl-cf<l-f){\n\t f=cf;\n\t l=cl;\n\t n=0;\n\t}\n\tn++;\n }\n }\n cout<<n<<endl<<endl;\n if(n){\n string t=s.substr(f,l-f+1);\n for(int i=0;i<t.size();i+=72){\n\tcout<<t.substr(i,72)<<endl;\n }\n cout<<endl;\n }\n }\n return 0;\n}\n ", "#include <iostream>\n#include <string>\n#include <map>\n#include <algorithm>\nusing namespace std;\n\n#define MAX (1<<24)\n\nint main()\n{\n\tstring s;\n\twhile(getline(cin,s))\n\t{\n\t\tstring str(s), sb;\n\t\twhile(getline(cin, s))\n\t\t{\n\t\t\tif(s.size()==0) break;\n\t\t\tstr+=s;\n\t\t}\n\n\t\tif(str.size()==0) break;\n\n\t\twhile(getline(cin, s))\n\t\t{\n\t\t\tif(s.size()==0) break;\n\t\t\tsb+=s;\n\t\t}\n\n\n\t\tint ansl=MAX, ret=0;\n\t\tstring ans;\n\t\tmap<char, int> d;\n\t\tfor(int i=0; i<str.size(); i++)\n\t\t{\n\t\t\tstring::iterator it=find(sb.begin(), sb.end(), str[i]);\n\t\t\tif(it==sb.end()) continue;\n\n\t\t\td[*it]=i;\n\t\t\tint mi=MAX;\n\t\t\tbool f=true;\n\t\t\tfor(int j=0; j<sb.size(); j++)\n\t\t\t{\n\t\t\t\tif(!d.count(sb[j]))\n\t\t\t\t{\n\t\t\t\t\tf=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tmi=min(mi, d[sb[j]]);\n\t\t\t}\n\n\t\t\tif(!f) continue;\n\t\t\t\n\t\t\tif(i-mi < ansl)\n\t\t\t{\n\t\t\t\tret=1;\n\t\t\t\tansl=i-mi;\n\t\t\t\tans.assign(str,mi,ansl+1);\n\t\t\t}\n\t\t\telse if(i-mi == ansl)\n\t\t\t{\n\t\t\t\tret++;\n\t\t\t}\n\t\t\t\n\t\t}\n\n\t\tcout << ret << endl;\n\t\tif(ret!=0)\n\t\t{\n\t\t\tfor(int i=0; i<ans.size(); i++)\n\t\t\t{\n\t\t\t\tif(i%72==0) cout << endl;\n\t\t\t\tcout << ans[i];\n\t\t\t}\n\n\t\t\tcout << endl;\n\t\t}\n\n\t\tcout << endl;\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n string buf;\n while(getline(cin,buf),buf!=\"\"){\n string s=buf;\n while(getline(cin,buf),buf!=\"\") s+=buf;\n string a;\n getline(cin,a);\n //cout<<s<<endl<<a<<endl;\n \n int n=a.size();\n vector<int> pos[n];\n for(int i=0;i<(int)s.size();i++)\n for(int j=0;j<n;j++)\n\tif(s[i]==a[j]) pos[j].push_back(i);\n\n bool f=1;\n for(int i=0;i<n;i++) f&=!!(pos[i].size());\n if(!f){\n cout<<0<<endl<<endl;\n getline(cin,buf);\n continue;\n }\n \n int idx[n];\n memset(idx,0,sizeof(idx));\n \n int ans=0,len=s.size()+1,head=0;\n for(int i=0;i<(int)s.size();i++){\n int nxt=i;\n for(int j=0;j<n;j++)\n\tnxt=max(nxt,pos[j][idx[j]]);\n\n if(nxt-i+1<len) ans=0,len=nxt-i+1,head=i;\n if(nxt-i+1==len) ans++;\n\n for(int j=0;j<n;j++){\n\tif(s[i]==a[j]) idx[j]++;\n\tif(idx[j]>=(int)pos[j].size()) goto LAB;\n }\n }\n \n LAB:\n string str=s.substr(head,len);\n \n cout<<ans<<endl;\n for(int i=0;i<(int)str.size();i++){\n if(i%72==0) cout<<endl;\n cout<<str[i];\n }\n cout<<endl<<endl;;\n //ready for next;\n getline(cin,buf);\n }\n return 0;\n}", "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nvoid print_text(const string& text){\n int offset = 0;\n int text_i = 0;\n while(offset < text.size()){\n for(text_i = offset; text_i < text.size(); text_i++){\n if(text_i - offset >= 72) break;\n printf(\"%c\",text[text_i]);\n }\n printf(\"\\n\");\n offset += 72;\n }\n}\n\nvoid print_co_occurrence(const string& text,const string& query){\n\n int head = 0;\n int tail = 0;\n\n int include_keys = 0;\n int freq[256] = {};\n\n bool is_key[256];\n memset(is_key,false,sizeof(is_key));\n\n for(int query_i = 0; query_i < query.size(); query_i++){\n is_key[query[query_i]] = true;\n }\n\n int min_tail = INF;\n int min_len = INF;\n int ans_freq = 0;\n string ans = \"\";\n\n while(tail < text.size()){\n for(;head < text.size();head++){\n if(is_key[text[head]] && !freq[text[head]]++){\n include_keys++;\n if(include_keys == query.size()){\n head++;\n break;\n }\n }\n }\n\n for(;tail <= head;tail++){\n if(is_key[text[tail]] && !--freq[text[tail]]){\n\n if(include_keys == query.size()) {\n if((head -1) - tail + 1 < min_len){\n min_len = (head -1) - tail + 1;\n ans = text.substr(tail,(head -1) - tail + 1);\n ans_freq = 1;\n }\n else if((head -1) - tail + 1 == min_len){\n ans_freq++;\n }\n }\n include_keys--;\n tail++;\n break;\n }\n }\n }\n\n if(ans_freq == 0){\n printf(\"%d\\n\",ans_freq);\n printf(\"\\n\");\n }\n else{\n printf(\"%d\\n\",ans_freq);\n printf(\"\\n\");\n print_text(ans);\n printf(\"\\n\");\n }\n}\n\nint main(){\n string str;\n int phase = 0;\n string text = \"\";\n string query = \"\";\n while(getline(cin,str)){\n if(str.size() == 0){\n phase++;\n continue;\n }\n if(phase % 2 == 0){\n text += str;\n }\n else{\n query = str;\n\n print_co_occurrence(text,query);\n \n query = \"\";\n text = \"\";\n }\n }\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstring buf,line,pattern;\nvector<int> LOC[128];\n\n\nbool check(int start,int end){\n\n\tbool FLG;\n\n\tint left,right,m,tmp_start,tmp_end;\n\n\tfor(int i = 0; i < pattern.length(); i++){\n\t\tint ch = pattern[i];\n\n\t\tleft = 0,right = LOC[ch].size()-1,m = (left+right)/2;\n\t\ttmp_start = BIG_NUM;\n\n\t\twhile(left <= right){\n\t\t\tif(LOC[ch][m] >= start){\n\t\t\t\ttmp_start = m;\n\t\t\t\tright = m-1;\n\t\t\t}else{\n\t\t\t\tleft = m+1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(tmp_start == BIG_NUM)return false;\n\n\t\tleft = tmp_start,right = LOC[ch].size()-1,m = (left+right)/2;\n\t\ttmp_end = BIG_NUM;\n\n\t\twhile(left <= right){\n\t\t\tif(LOC[ch][m] <= end){\n\t\t\t\ttmp_end = m;\n\t\t\t\tleft = m+1;\n\t\t\t}else{\n\t\t\t\tright = m-1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(tmp_end == BIG_NUM)return false;\n\t}\n\treturn true;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < 128; i++)LOC[i].clear();\n\n\tline += buf;\n\twhile(true){\n\t\tgetline(cin,buf);\n\t\tif(buf == \"\")break;\n\t\tline += buf;\n\t}\n\tgetline(cin,pattern);\n\tgetline(cin,buf);\n\n\tfor(int i = 0; i < line.length(); i++){\n\t\tLOC[line[i]].push_back(i);\n\t}\n\n\tfor(int i = 0; i < pattern.length(); i++){\n\t\tif(LOC[pattern[i]].size() == 0){\n\t\t\tprintf(\"0\\n\\n\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\tbool FLG;\n\tint left,right,m,minimum = BIG_NUM,ans_count = 1,tmp_end;\n\tint ans_start,ans_end;\n\n\tfor(int start = 0; start < line.length(); start++){\n\n\t\tleft = start,right = line.length()-1,m = (left+right)/2;\n\t\ttmp_end = BIG_NUM;\n\n\t\twhile(left <= right){\n\t\t\tif(check(start,m)){\n\t\t\t\ttmp_end = m;\n\t\t\t\tright = m-1;\n\t\t\t}else{\n\t\t\t\tleft = m+1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(tmp_end == BIG_NUM)continue;\n\n\t\tif(tmp_end-start+1 < minimum){\n\n\t\t\tminimum = tmp_end-start+1;\n\t\t\tans_count = 1;\n\t\t\tans_start = start;\n\t\t\tans_end = tmp_end;\n\n\t\t}else if(tmp_end-start+1 == minimum){\n\t\t\tans_count++;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\\n\",ans_count);\n\tfor(int i = ans_start; i <= ans_end; i += 72){\n\t\tfor(int k = i; k <= min(ans_end,i+71); k++){\n\t\t\tprintf(\"%c\",line[k]);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\tprintf(\"\\n\");\n\n\tline.clear();\n\tpattern.clear();\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tgetline(cin,buf);\n\t\tif(buf == \"\")break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}\n\n", "#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define REP(i, a, b) for(int i = (a); i < int(b); ++i)\n#define rep(i, n) REP(i, 0, n)\n#define ALL(x) begin(x), end(x)\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tconstexpr int NUM = 128;\n\tconstexpr int WIDTH = 72;\n\n\tstring line;\n\twhile(getline(cin, line)) {\n\t\tstring text = \"\";\n\t\tdo {\n\t\t\ttext += line;\n\t\t} while(getline(cin, line) && !line.empty());\n\n\t\tif(text.empty()) break;\n\n\t\tstring keywords;\n\t\tgetline(cin, keywords);\n\t\tcin.ignore();\n\n\t\tconst int n = text.size();\n\t\tconst int m = keywords.size();\n\t\tvector<int> idx(NUM, -1);\n\n\t\trep(i, m) {\n\t\t\tidx[keywords[i]] = i;\n\t\t}\n\n\t\tint number_of_answer = 0;\n\t\tint shortest = n;\n\t\tpair<int, int> first_answer;\n\t\tvector<int> last(m, -1);\n\n\t\trep(i, n) {\n\t\t\tif(idx[text[i]] != -1) {\n\t\t\t\tlast[idx[text[i]]] = i;\n\t\t\t\tconst int start = *min_element(ALL(last));\n\n\t\t\t\tif(start != -1) {\n\t\t\t\t\tconst int len = i - start;\n\t\t\t\t\tif(len < shortest) {\n\t\t\t\t\t\tshortest = len;\n\t\t\t\t\t\tnumber_of_answer = 1;\n\t\t\t\t\t\tfirst_answer = make_pair(start, i + 1);\n\t\t\t\t\t}\n\t\t\t\t\telse if(len == shortest) {\n\t\t\t\t\t\t++number_of_answer;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << number_of_answer << endl << endl;\n\n\t\tif(number_of_answer == 0) continue;\n\n\t\tfor(int i = first_answer.first; i < first_answer.second; i += WIDTH) {\n\t\t\tcout << text.substr(i, min(first_answer.second - i, WIDTH)) << endl;\n\t\t}\n\t\tcout << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}", "#include <iostream>\n#include <vector>\n#include <string>\n#include <map>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n while ( true ) {\n string t;\n string line;\n while ( getline( cin, line ) && line.size() ) {\n t += line;\n }\n getline( cin, line );\n if ( !line.size() ) break;\n string s = line;\n getline( cin, line );\n\n map <char, int> need;\n for ( string ::iterator it = s.begin(); it != s.end(); it++ ) {\n need[*it]++;\n }\n\n map <char, int> cnt;\n int left = 0, right = 0;\n int occ, OCC;\n\n occ = 0;\n OCC = need.size();\n\n vector <string> v;\n\n while ( left < t.size() ) {\n while ( right < t.size() && occ < OCC ) {\n\tchar c = t[right++];\n\tif ( need[c] && need[c] == ++cnt[c] ) ++occ;\n }\n if ( occ != OCC ) break;\n while ( left < right ) {\n\tchar c = t[left];\n\tif ( need[c] && need[c] == cnt[c] ) break;\n\t--cnt[c];\n\tleft++;\n }\n if ( left == right ) break;\n v.push_back( t.substr( left, right - left ) );\n --cnt[t[left++]];\n --occ;\n }\n\n int mlen = 1<<24;\n for ( int i = 0; i < v.size(); i++ ) {\n mlen = min( mlen, (int)v[i].size() );\n }\n\n int answer1 = 0;\n string answer2 = \"\";\n for ( int i = 0; i < v.size(); i++ ) {\n if ( v[i].size() == mlen ) {\n\tif ( answer2.size() == 0 ) {\n\t answer2 = v[i];\n\t}\n\tanswer1++;\n }\n }\n\n cout << answer1 << endl;\n if ( answer1 > 0 ) cout << endl;\n for ( int i = 0; i < answer2.size(); i++ ) {\n cout << answer2[i];\n if ( (i + 1) % 72 == 0 ) cout << endl;\n }\n if ( answer2.size() > 0 && answer2.size() != 72 ) cout << endl;\n cout << endl;\n }\n return 0;\n}", "#include<iostream>\n#include<map>\n#include<cstring>\n\nusing namespace std;\n\nconst int MAX = 51;\n\nstring text, key;\nmap<char,int> M;\nint numKey[MAX];\n\ntypedef long long ll;\n\nbool input(){\n text = \"\";\n\n string s = \"\";\n if(!getline(cin,s)) return false;\n if(s == \"\") return false;\n text = s;\n while(getline(cin,s)&&s!=\"\") text += s;\n getline(cin,s);\n key = s;\n getline(cin,s); // for blank line\n return true;\n}\n\n\n\nvoid solve(){\n\n memset(numKey,0,sizeof(numKey));\n\n M.clear();\n for(int i = 0; i < (int)key.length(); i++)\n M[key[i]] = i;\n\n ll need = (1LL<<key.length())-1;\n\n string first = \"\";\n int num = 0;\n\n int s = 0, t = 0;\n\n while(s <= t && t <= (int)text.length()){\n if(need == 0){\n // if(text.size() > 400 && t-s < 50) cout << text.substr(s,t-s) << endl;\n if(first != \"\" && (int)first.length() == t-s){\n\tnum++;\n }\n if(first == \"\" || (int)first.length() > t-s){\n\tfirst = text.substr(s,t-s);\n\tnum = 1;\n }\n\n if(M.count(text[s]) != 0){\n\tnumKey[M[text[s]]]--;\n\tif(numKey[M[text[s]]] == 0) need |= (1LL<<M[text[s]]);\n }\n s++;\n }else{\n if(M.count(text[t]) != 0){\n\tif(need&(1LL<<M[text[t]])) need -= (1LL<<M[text[t]]);\n\tnumKey[M[text[t]]]++;\n }\n t++;\n }\n }\n // cout << \"min \" << minT << endl;\n if(num == 0) cout << num << endl;\n else{\n cout << num << endl << endl;\n\n for(int i = 0; i < (int)first.length(); i++){\n cout << first[i];\n if((i+1)%72 == 0) cout<<endl;\n }\n if((int)first.size()%72)cout << endl;\n }\n cout << endl;\n}\t \n\nint main(){\n\n // bool isFirst = true;\n while(input()){\n // if(isFirst) isFirst = false;\n // else cout << endl;\n solve();\n }\n return 0;\n}", "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\n//Co-occurrence Search\npublic class Main{\n\n\tvoid run(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tboolean head = true;\n\t\twhile(sc.hasNext()){\n\t\t\tif(!head)sc.nextLine();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor(;;){\n\t\t\t\tString s = sc.nextLine();\n\t\t\t\tif(\"\".equals(s))break;\n\t\t\t\tsb.append(s);\n\t\t\t}\n\t\t\tchar[] ch = sb.toString().toCharArray();\n\t\t\tint n = ch.length;\n\t\t\tString key = sc.nextLine();\n\t\t\tint k = key.length();\n\t\t\tMap<Character, Integer> ref = new HashMap<Character, Integer>();\n\t\t\tfor(int i=0;i<k;i++)ref.put(key.charAt(i), i);\n\t\t\tint[] c = new int[k];\n\t\t\tint kind = 0;\n\t\t\tint s = 0, t = -1;\n\t\t\tint res = 0, min = n+1;\n\t\t\tString ans = \"\";\n\t\t\tfor(;;){\n\t\t\t\tif(kind==k){\n\t\t\t\t\tint len = t-s+1;\n\t\t\t\t\tif(len<min){\n\t\t\t\t\t\tmin = len;\n\t\t\t\t\t\tres = 1;\n\t\t\t\t\t\tans = sb.substring(s, t+1);\n\t\t\t\t\t}\n\t\t\t\t\telse if(len==min)res++;\n\t\t\t\t\tif(ref.containsKey(ch[s])){\n\t\t\t\t\t\tint x = ref.get(ch[s]);\n\t\t\t\t\t\tc[x]--;\n\t\t\t\t\t\tif(c[x]==0)kind--;\n\t\t\t\t\t}\n\t\t\t\t\ts++;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tt++;\n\t\t\t\t\tif(t==n)break;\n\t\t\t\t\tif(ref.containsKey(ch[t])){\n\t\t\t\t\t\tint x = ref.get(ch[t]);\n\t\t\t\t\t\tif(c[x]==0)kind++;\n\t\t\t\t\t\tc[x]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(res);\n\t\t\tif(res!=0){\n\t\t\t\tSystem.out.println();\n\t\t\t\tfor(int i=0;i<ans.length();i+=72)System.out.println(ans.substring(i, Math.min(ans.length(), i+72)));\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t\thead = false;\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "#include<cstdio>\n#include<string>\n#include<iostream>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint main(){\n\twhile(1){\n\t\tstring s,tmp;\n\t\twhile(1){\n\t\t\tgetline(cin,tmp);\n\t\t\tif(tmp==\"\") break;\n\t\t\ts+=tmp;\n\t\t}\n\t\tstring a; getline(cin,a);\n\t\tgetline(cin,tmp);\n\t\tif(a==\"\") break;\n\n\t\tint m=a.length();\n\t\tbool b[128]={};\n\t\trep(i,m) b[a[i]]=true;\n\n\t\tint n=s.length();\n\t\tint j_ans,w_ans=2*n,c_ans=0;\n\t\tint cnt[128]={},cnt2=0;\n\t\tfor(int i=0,j=0;i<n;i++){\n\t\t\tif(cnt[s[i]]==0 && b[s[i]]) cnt2++;\n\t\t\tcnt[s[i]]++;\n\n\t\t\tif(cnt2==m){\n\t\t\t\twhile(j<i && cnt[s[j]]>1 || cnt[s[j]]==1 && !b[s[j]]){\n\t\t\t\t\tcnt[s[j]]--;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif(i-j+1<w_ans){\n\t\t\t\t\tj_ans=j;\n\t\t\t\t\tw_ans=i-j+1;\n\t\t\t\t\tc_ans=1;\n\t\t\t\t}\n\t\t\t\telse if(i-j+1==w_ans){\n\t\t\t\t\tc_ans++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout<<c_ans<<endl<<endl;\n\t\tif(c_ans>0){\n\t\t\tstring ans=s.substr(j_ans,w_ans);\n\t\t\tfor(int i=0;i<w_ans;i+=72){\n\t\t\t\tfor(int j=i;j<min(i+72,w_ans);j++) cout<<ans[j];\n\t\t\t\tcout<<endl;\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\n\treturn 0;\n}", "#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nstring S,K;\nconst int INF=1<<28;\n\nvoid solve(){\n\tstring ans;\n\tint len=INF, cnt=0;\n\tint left=INF;\n\tint idx[K.length()];\n//\tfill(begin(idx), end(idx), 0);\n\tfor(int i=0; i<K.length(); ++i)idx[i]=-1;\n\n\tfor(int p=0; p<S.length(); ++p){\n\t\tfor(int k=0; k<K.length(); ++k){\n\t\t\tif(S[p]==K[k]){\n\t\t\t\tidx[k]=p;\n\t\t\t\tleft=INF;\n\t\t\t\tfor(int i=0; i<K.length(); ++i)\tleft=min(left, idx[i]);\n\t\t\t\tif(left>=0){\n//\t\t\t\t\tcout << left << \" \" << p << endl;\n\t\t\t\t\tstring cand=S.substr(left, p-left+1);\n\t\t\t\t\tif(len>cand.length()){\n\t\t\t\t\t\tcnt=1;\n\t\t\t\t\t\tlen=cand.length();\n\t\t\t\t\t\tans=cand;\n\t\t\t\t\t}else if(len==cand.length()){\n\t\t\t\t\t\t++cnt;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif(len>=INF){\n\t\tcout << 0 << endl;\n\t}else{\n\t\tcout << cnt << endl;\n\t\tcout << endl;\n\n\t\tfor(int i=0; i<ans.size(); ++i){\n\t\t\tif(i>0 && i%72==0)\tcout<<endl;\n\t\t\tcout << ans[i];\n\t\t}\n\t\tcout<<endl;\n\t}\n\tcout<<endl;\n}\n\nint main(){\n\tfor(int cnt=0;;++cnt){\n\t\tstring tmp;\n\t\tif(getline(cin,tmp).eof())\tbreak;\n\t\tif(tmp==\"\")\tbreak;\n\t\tS=tmp;\n\t\twhile(true){\n\t\t\tgetline(cin,tmp);\n\t\t\tif(tmp==\"\")\tbreak;\n\t\t\tS+=tmp;\n\t\t}\n\t\tgetline(cin,K);\n\t\tgetline(cin,tmp);\n//\t\tcout<<S<<endl;\n//\t\tcout<<K<<endl;\n//\t\tif(cnt>0)\tcout<<endl;\n\t\tsolve();\n\t}\n\treturn 0;\n}", "//47\n#include<iostream>\n#include<sstream>\n#include<string>\n#include<map>\n#include<algorithm>\n#include<set>\n\nusing namespace std;\n\nint main(){\n for(string si;getline(cin,si),si!=\"\";){\n string s;\n do{\n s+=si;\n getline(cin,si);\n }while(si!=\"\");\n string k;\n getline(cin,k);\n cin.ignore();\n map<char,int> m;\n int f=0,l=1<<30;\n int n=0;\n set<long long> st;\n for(int i=0;i<s.size();i++){\n if(k.find(s[i])!=string::npos){\n\tm[s[i]]=i;\n }\n if(m.size()!=k.size())continue;\n int cl=0,cf=1<<30;\n for(int j=0;j<k.size();j++){\n\tcl=max(cl,m[k[j]]);\n\tcf=min(cf,m[k[j]]);\n }\n if(!st.insert((long long)cl<<32|cf).second)continue;\n if(cl-cf<=l-f){\n\tif(cl-cf<l-f){\n\t f=cf;\n\t l=cl;\n\t n=0;\n\t}\n\tn++;\n }\n }\n cout<<n<<endl<<endl;\n if(n){\n string t=s.substr(f,l-f+1);\n for(int i=0;i<t.size();i+=72){\n\tcout<<t.substr(i,72)<<endl;\n }\n cout<<endl;\n }\n }\n return 0;\n}\n ", "#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nint main()\n{\n for(;;){\n string s;\n for(;;){\n string tmp;\n getline(cin, tmp);\n if(tmp == \"\")\n break;\n s += tmp;\n }\n int n = s.size();\n if(n == 0)\n return 0;\n\n string key;\n getline(cin, key);\n int m = key.size();\n vector<bool> isKey(256, false);\n for(int i=0; i<m; ++i)\n isKey[key[i]] = true;\n\n vector<int> last(256, -1);\n set<int> pos;\n int num;\n int head;\n int len = INT_MAX;\n for(int i=0; i<n; ++i){\n if(isKey[s[i]]){\n if(last[s[i]] != -1)\n pos.erase(pos.find(last[s[i]]));\n last[s[i]] = i;\n pos.insert(i);\n\n if(pos.size() == m){\n int len2 = i - *(pos.begin()) + 1;\n if(len2 < len){\n len = len2;\n num = 1;\n head = *(pos.begin());\n }else if(len2 == len){\n ++ num;\n }\n }\n }\n }\n\n if(len == INT_MAX){\n cout << '0' << endl;\n }else{\n cout << num << endl << endl;\n while(len > 72){\n cout << s.substr(head, 72) << endl;\n head += 72;\n len -= 72;\n }\n cout << s.substr(head, len) << endl;\n }\n cout << endl;\n\n getline(cin, s);\n }\n}", "import java.util.*;\n\npublic class Main{\n\n\t//2116 start\n\tprivate void doit(){\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\tArrayList<Character> list = new ArrayList<Character>();\n\t\t\tString input = sc.nextLine();\n\t\t\twhile(! input.equals(\"\")){\n\t\t\t\tfor(int i = 0; i < input.length(); i++){\n\t\t\t\t\tlist.add(input.charAt(i));\n\t\t\t\t}\n\t\t\t\tinput = sc.nextLine();\n\t\t\t}\n\n\t\t\tString keystr = sc.nextLine();\n\n\t\t\tHashMap<Character, Integer> index = new HashMap<Character, Integer>();\n\t\t\tfor(int i = 0; i < keystr.length(); i++){\n\t\t\t\tindex.put(keystr.charAt(i), -1);\n\t\t\t}\n\n\t\t\tint s = -1, e = -1, anss = -1, anse = -1;\n\t\t\tboolean allcontain = false;\n\n\t\t\tint len = list.size();\n\t\t\tint anscount= 0;\n\t\t\tfor(int i = 0; i < len; i++){\n\t\t\t\tchar now = list.get(i);\n\t\t\t\tif(! index.containsKey(now)) continue;\n\n\t\t\t\tif(allcontain){\n\t\t\t\t\tint value = index.get(now);\n\t\t\t\t\tindex.put(now, i);\n\t\t\t\t\tif(s == value){\n\t\t\t\t\t\t//次の最小値をもとめる\n\t\t\t\t\t\ts = min(index);\n\t\t\t\t\t}\n\t\t\t\t\te = i;\n\n\t\t\t\t\t//判定\n\t\t\t\t\tif((e - s) < (anse - anss)){\n\t\t\t\t\t\tanse = e;\n\t\t\t\t\t\tanss = s;\n\t\t\t\t\t\tanscount=1;\n\t\t\t\t\t}\n\t\t\t\t\telse if((e - s) == (anse - anss)){\n\t\t\t\t\t\tanscount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\n\t\t\t\t\t//これで見つかったかもしれない\n\t\t\t\t\tindex.put(now, i);\n\t\t\t\t\tboolean isOK = true;\n\t\t\t\t\tint min = Integer.MAX_VALUE, max = 0;\n\t\t\t\t\tfor(char key: index.keySet()){\n\t\t\t\t\t\tint value = index.get(key);\n\t\t\t\t\t\tif(value == -1){\n\t\t\t\t\t\t\tisOK = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\tmax = Math.max(max, value);\n\t\t\t\t\t\t\tmin = Math.min(min, value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(isOK){\n\t\t\t\t\t\tallcontain = true;\n\t\t\t\t\t\ts = min;\n\t\t\t\t\t\te = max;\n\t\t\t\t\t\tanss = min;\n\t\t\t\t\t\tanse = max;\n\t\t\t\t\t\tanscount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(anscount);\n\n\t\t\tif(anscount > 0){\n\t\t\t\tSystem.out.println();\n\t\t\t\tprint(anss,anse,list);\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t\tif(sc.hasNext()){\n\t\t\t\tsc.nextLine();\n\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate void print(int s, int e, ArrayList<Character> list) {\n\t\tint count = 0;\n\t\tStringBuilder sb = new StringBuilder();\n\t\tfor(int i = s; i <= e; i++ ){\n\t\t\tcount++;\n\t\t\tsb.append(list.get(i));\n\t\t\tif(count == 72){\n\t\t\t\tcount = 0;\n\t\t\t\tSystem.out.println(sb.toString());\n\t\t\t\tsb = new StringBuilder();\n\t\t\t}\n\t\t}\n\t\tif(sb.length() != 0) System.out.println(sb.toString());\n\n\t}\n\n\tprivate int min(HashMap<Character, Integer> index) {\n\t\tint min = Integer.MAX_VALUE;\n\t\tfor(char key: index.keySet()){\n\t\t\tmin = Math.min(min, index.get(key));\n\t\t}\n\t\treturn min;\n\t}\n\n\tpublic static void main(String [] args){\n\t\tnew Main().doit();\n\t}\n}", "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nint main(){\n\tstring str, pat;\n\tvector<char> num;\n\t\n\tstr.reserve(1000001);\n\tnum.reserve(1000001);\n\tpat.reserve(73);\n\t\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t\n\twhile(true){\n\t\tstr.clear();\n\t\tpat.clear();\n\n\t\twhile(true){\n\t\t\tgetline(cin, pat);\n\t\t\tif( pat.empty() || !cin ) break;\n\t\t\tstr += pat;\n\t\t}\n\t\tif( str.empty() || !cin ) break;\n\n\t\tgetline(cin, pat);\n\t\tcin.ignore();\n\t\t\n\t\tsort(pat.begin(), pat.end());\n\t\tpat.erase( unique(pat.begin(), pat.end()), pat.end());\n\n\t\tnum.resize(str.size());\n\t\tint j;\n\t\tfor(j = 0; j < str.size(); ++j){\n\t\t\tint x = lower_bound(pat.begin(), pat.end(), str[j]) - pat.begin();\n\t\t\tif( x < pat.size() && str[j] == pat[x] ){ num[j] = x; }\n\t\t\telse{ num[j] = pat.size(); }\n\t\t}\n\t\t\n\t\tint cnt[73] = {};\n\t\tcnt[pat.size()] = 10000000;\n\t\tint d = 0;\n\t\tfor(j = 0; j < num.size() && d < pat.size(); ++j){\n\t\t\tif( ++cnt[num[j]] == 1 ){\n\t\t\t\t++d;\n\t\t\t}\n\t\t}\n\n\t\tif( d < pat.size() ){\n\t\t\tcout << \"0\\n\\n\";\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tint a = 0, b = j;\n\t\tint shortest = 1;\n\n\t\tfor(int i = 0; j <= num.size(); ){\n\t\t\tchar x = num[i++];\n\t\t\tif( --cnt[x] == 0 ){\n\t\t\t\tbool found = false;\n\t\t\t\twhile(j < num.size()){\n\t\t\t\t\t++cnt[num[j]];\n\t\t\t\t\tif( x == num[j++] ){\n\t\t\t\t\t\tfound = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif( !found ) break;\n\t\t\t}\n\t\t\t\n\t\t\tif( b - a > j - i ){\n\t\t\t\ta = i;\n\t\t\t\tb = j;\n\t\t\t\tshortest = 1;\n\t\t\t}\n\t\t\telse if( b - a == j - i ){\n\t\t\t\t++shortest;\n\t\t\t}\n\t\t}\n\n\t\tcout << shortest << \"\\n\\n\";\n\t\twhile( a < b ){\n\t\t\tint len = min(b - a, 72);\n\t\t\tcout << str.substr(a, len) << '\\n';\n\t\t\ta += len;\n\t\t}\n\n\t\tcout << '\\n';\n\t}\n}", "#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n\nusing namespace std;\n\nconst int INF=1000000000;\nchar chs[1001];\n\nint main(){\n bool fi=false;\n string str;\n while(getline(cin,str)&&str!=\"\"){\n memset(chs,0,sizeof(chs));\n string ss;\n string tmp;\n if(fi)cout<<endl;\n else fi=true;\n while(getline(cin,tmp)&&tmp!=\"\")str+=tmp;\n while(getline(cin,tmp)&&tmp!=\"\")ss+=tmp;\n int sz=INF;\n int optHead=0;\n int optTail=0;\n int head=0;\n int tail=-1;\n int cnt=0;\n while(tail<(int)str.size()){\n bool ok=true;\n for(int i=0;i<ss.size();i++)if(chs[ss[i]]<=0)ok=false;\n // ツ個サツ催敖づ個氾債暗債つェツ適ツ静伉づ按づァ\n if(ok){\n if(tail-head+1<sz){\n optHead=head;\n optTail=tail;\n sz=tail-head+1;\n cnt=1;\n }\n else if(tail-head+1==sz)cnt++;\n chs[str[head]]--;\n head++;\n }\n else{\n tail++;\n if(tail<(int)str.size())chs[str[tail]]++;\n }\n }\n cout<<cnt<<endl;\n if(cnt!=0){\n cout<<endl;\n for(int i=optHead;i<optHead+sz;i++){\n int cn=i-optHead+1;\n cout<<str[i];\n if(cn%72==0||i==optHead+sz-1)cout<<endl;\n }\n }\n }\n cout<<endl;\n return 0;\n}", "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n\nvoid print_text(const string& text){\n int offset = 0;\n int text_i = 0;\n while(offset < text.size()){\n for(text_i = offset; text_i < text.size(); text_i++){\n if(text_i - offset >= 72) break;\n printf(\"%c\",text[text_i]);\n }\n printf(\"\\n\");\n offset += 72;\n }\n}\n\nvoid print_co_occurrence(const string& text,const string& query){\n\n int head = 0;\n int tail = 0;\n\n int include_keys = 0;\n int freq[1024] = {};\n\n bool is_key[1024];\n memset(is_key,false,sizeof(is_key));\n\n for(int query_i = 0; query_i < query.size(); query_i++){\n is_key[query[query_i]] = true;\n }\n\n int min_tail = INF;\n int min_len = INF;\n int ans_freq = 0;\n string ans = \"\";\n\n while(tail < text.size()){\n for(;head < text.size();head++){\n if(is_key[text[head]] && !freq[text[head]]++){\n include_keys++;\n if(include_keys == query.size()){\n head++;\n break;\n }\n }\n }\n\n for(;tail <= head;tail++){\n if(is_key[text[tail]] && !--freq[text[tail]]){\n\n if(include_keys == query.size()) {\n if((head -1) - tail + 1 < min_len){\n min_len = (head -1) - tail + 1;\n ans = text.substr(tail,(head -1) - tail + 1);\n ans_freq = 1;\n }\n else if((head -1) - tail + 1 == min_len){\n ans_freq++;\n }\n }\n include_keys--;\n tail++;\n break;\n }\n }\n }\n\n if(ans_freq == 0){\n printf(\"%d\\n\",ans_freq);\n printf(\"\\n\");\n }\n else{\n printf(\"%d\\n\",ans_freq);\n printf(\"\\n\");\n print_text(ans);\n printf(\"\\n\");\n }\n}\n\nint main(){\n string str;\n int phase = 0;\n string text = \"\";\n string query = \"\";\n while(getline(cin,str)){\n if(str.size() == 0){\n phase++;\n continue;\n }\n if(phase % 2 == 0){\n text += str;\n }\n else{\n query = str;\n\n print_co_occurrence(text,query);\n \n query = \"\";\n text = \"\";\n }\n }\n}", "#include<iostream>\n#include<string>\n#include<vector>\n#include<cstdio>\n#include<algorithm>\n\nusing namespace std;\n\nbool check(int begin, int end, vector<vector<int> > &ind){\n if(begin>end)return false;\n for(int i = 0; i < (int)ind.size(); ++i){\n if(ind[i].size()==0)return false;\n vector<int>::iterator it_b = lower_bound(ind[i].begin(),ind[i].end(),begin);\n vector<int>::iterator it_e = lower_bound(ind[i].begin(),ind[i].end(),end);\n\n // cout << begin << ' ' << end << ' ' << i << ' ' << it_b-ind[i].begin() << ' ' << it_e-ind[i].begin() << endl;\n\n bool next_b = false;\n if(it_b==ind[i].end()){\n next_b=false;\n }else{\n if(begin<=*it_b&&*it_b<=end)next_b=true;\n }\n\n bool next_e = false;\n if(it_e==ind[i].end())--it_e;\n while(it_e!=ind[i].begin()){\n if(begin<=*it_e&&*it_e<=end){\n next_e = true;\n break;\n }\n --it_e;\n }\n if(it_e==ind[i].begin()){\n if(begin<=*it_e&&*it_e<=end){\n next_e=true;\n }\n }\n // cout << next_b << ' ' << next_e << endl;\n if(!next_b||!next_e)return false;\n }\n return true;\n}\n\nint main()\n{\n bool first = true;\n while(true){\n string text, dam;\n while(true){\n string tmp;\n // if(!getline(cin,tmp))return 0;\n getline(cin,tmp);\n text+=tmp;\n if(tmp.length()==0)break;\n }\n if(text.length()==0) break;\n string key;\n getline(cin,key);\n getline(cin,dam);\n\n // cout << text.length() <<endl;\n\n\n //if(first)first=false;\n //else puts(\"\");\n\n sort(key.begin(),key.end());\n key.erase( unique(key.begin(), key.end()), key.end() );\n vector< vector<int> > ind(key.length());\n \n // cout << key << endl;\n for(int i = 0; i < (int)text.length();++i){\n string::iterator it = lower_bound(key.begin(),key.end(),text[i]);\n if(it!=key.end()){\n if( *it == text[i] ){\n ind[it-key.begin()].push_back(i);\n }\n }\n }\n\n /*\n for(int i = 0; i < (int)ind.size(); ++i){\n for(int j = 0; j < (int)ind[i].size(); ++j){\n cout << ind[i][j] << ' ';\n }\n cout << endl;\n }\n cout << \"---\"<<endl;\n */\n\n int res_cnt = 0;\n int res_b = -1;\n int res_e = (int)text.length();\n for(int x = 0; x < (int)ind.size(); ++x){\n for(int i = 0; i < (int)ind[x].size(); ++i){\n int begin = ind[x][i];\n int left = begin;\n int right = text.length();\n int end;\n // int cnt = 0;\n while(left+1<right){\n end = (left+right)/2;\n if(check(begin,end,ind)){\n right = end;\n }else left = end;\n }\n for(int k = -2; k <= 2; ++k){\n int tend=end+k;\n // cout << begin << ' ' << tend << endl;\n if(check(begin,tend,ind)){\n if(res_e-res_b>tend-begin){\n res_e = tend;\n res_b = begin;\n res_cnt = 1;\n }else if( res_e-res_b==tend-begin){\n ++res_cnt;\n if( begin<res_b){\n res_e = tend;\n res_b = begin;\n }\n }\n // cout << begin<<' ' <<tend<<' '<<tend-begin<<endl;\n break;\n }\n }\n }\n }\n\n // cout << res_b << ' ' << res_e << endl;\n if(res_cnt==0){\n printf(\"0\\n\");\n }else{\n int cnt = 0;\n printf(\"%d\\n\\n\",res_cnt);\n for(int i = res_b; i <= res_e; ++i){\n putchar(text[i]);\n ++cnt;\n if(cnt==72){putchar('\\n');cnt=0;}\n }\n if(cnt>0){\n puts(\"\");\n }\n }\n puts(\"\");\n \n }\n return 0;\n}", "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class Main{\n\n\tScanner sc=new Scanner(System.in);\n\n\tint INF=1<<28;\n\tdouble EPS=1e-9;\n\n\tchar[] s, key;\n\n\tvoid run(){\n\t\tfor(;;){\n\t\t\tStringBuffer lines=new StringBuffer();\n\t\t\tfor(;;){\n\t\t\t\tString line=sc.nextLine();\n\t\t\t\tif(line.equals(\"\")){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlines.append(line);\n\t\t\t}\n\t\t\ts=lines.toString().toCharArray();\n\t\t\tkey=sc.nextLine().toCharArray();\n\t\t\tsolve();\n\t\t\tif(sc.hasNext()){\n\t\t\t\tsc.nextLine();\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tSystem.out.flush();\n\t}\n\n\tvoid solve(){\n\t\tint i=0, j=0;\n\t\tint num=0;\n\t\tint n=s.length;\n\n\t\tint min=INF;\n\t\tint cMin=0, iMin=0, jMin=0;\n\n\t\tint nKey=0;\n\t\tboolean[] isKey=new boolean[256];\n\t\tfor(char c : key){\n\t\t\tisKey[c]=true;\n\t\t}\n\t\tfor(boolean b : isKey){\n\t\t\tnKey+=b?1:0;\n\t\t}\n\t\tint[] count=new int[256];\n\n\t\tfor(;;){\n\t\t\tfor(; j<n&&num<nKey; j++){\n\t\t\t\tif(isKey[s[j]]&&count[s[j]]++==0){\n\t\t\t\t\tnum++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(num<nKey){\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif(j-i<min){\n\t\t\t\tiMin=i;\n\t\t\t\tjMin=j;\n\t\t\t\tmin=j-i;\n\t\t\t\tcMin=1;\n\t\t\t}else if(j-i==min){\n\t\t\t\tcMin++;\n\t\t\t}\n\n\t\t\tif(isKey[s[i]]&&--count[s[i]]==0){\n\t\t\t\tnum--;\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\n\t\tprintln(cMin+\"\\n\");\n\t\tif(cMin>0){\n\t\t\tString ans=new String(s, iMin, jMin-iMin);\n\t\t\tfor(int k=0; k<(ans.length()-1)/72+1; k++){\n\t\t\t\tprintln(ans.substring(k*72, min((k+1)*72, ans.length())));\n\t\t\t}\n\t\t\tprintln(\"\");\n\t\t}\n\t\t// debug(cmin, first);\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tpublic static void main(String[] args){\n\t\t// System.setOut(new PrintStream(new BufferedOutputStream(System.out)));\n\t\t/*\n\t\ttry{\n\t\t\tSystem.setIn(new FileInputStream(\"a.txt\"));\n\t\t}catch(FileNotFoundException e){\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t}*/\n\t\tnew Main().run();\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n while(1) {\n string s=\"\",t,r;\n getline(cin,s);\n if(s==\"\") break;\n while(1) {\n getline(cin,r);\n if(r==\"\") break;\n s+=r;\n }\n getline(cin,t);\n getline(cin,r);\n \n map<char,int> m,d;\n m.clear();\n d.clear();\n for(int i=0; i<t.size(); i++) d[t[i]]=1;\n vector<int> v;\n for(int i=0; i<s.size(); i++) {\n if(d[s[i]]==1) v.push_back(i);\n }\n int x=0,cnt=0;\n string ans=s;\n for(int i=0; i<v.size(); i++) {\n char c=s[v[i]];\n m[c]++;\n if(m.size()==t.size()) {\n\twhile(m[s[v[x]]]>1) {\n\t m[s[v[x]]]--;\n\t x++;\n\t}\n\tif(ans.size()==v[i]-v[x]+1) {\n\t cnt++;\n\t} else if(ans.size()>v[i]-v[x]+1) {\n\t cnt=1;\n\t ans=s.substr(v[x],v[i]-v[x]+1);\n\t}\n }\n }\n \n if(cnt==0) cout << cnt << endl;\n else {\n cout << cnt << endl << endl;\n for(int i=0; i<ans.size(); i++) {\n\tcout << ans[i];\n\tif((i+1)%72==0) cout << endl;\n }\n if(ans.size()%72) cout << endl;\n }\n cout << endl;\n }\n return 0;\n}\n", "#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tstring text,key,temp;\n\tfor(;;)\n\t{\n\t\ttext=key=\"\";\n\t\twhile(getline(cin,text)&&text.empty())\n\t\t\t;\n\t\tif(cin.eof())return 0;\n\t\twhile(getline(cin,temp)&&!temp.empty())\n\t\t\ttext+=temp;\n\t\tif(cin.eof())return 0;\n\t\twhile(getline(cin,key)&&key.empty())\n\t\t\t;\n\t\tif(cin.eof())return 0;\n\n\n\t\tint minLen=1e9,minIndex=1e9,minCount=0;\n\t\tint i,head,tail;\n\t\tint kind=0,curKind;\n\t\tbool f[256]={};\n\t\tint a[256]={};\n\t\tfor(i=0;i<key.size();++i)\n\t\t\tif(!f[key[i]]++)\n\t\t\t\t++kind;\n\t\ttext+=\"\\0\";\n\t\thead=tail=curKind=0;\n\t\tfor(;tail<text.size();)\n\t\t{\n\t\t\tfor(; head<text.size(); ++head)\n\t\t\t{\n\t\t\t\tchar c=text[head];\n\t\t\t\tif(f[c]&&!a[c]++)\n\t\t\t\t{\n\t\t\t\t\tif(++curKind==kind)\n\t\t\t\t\t{\n\t\t\t\t\t\t++head;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(; tail<text.size(); ++tail)\n\t\t\t{\n\t\t\t\tchar c=text[tail];\n\t\t\t\tif(f[c]&&!--a[c])\n\t\t\t\t{\n\t\t\t\t\tif(curKind--==kind)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(minLen>head-tail)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tminLen=head-tail;\n\t\t\t\t\t\t\tminIndex=tail;\n\t\t\t\t\t\t\tminCount=1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(minLen==head-tail)\n\t\t\t\t\t\t\t++minCount;\n\t\t\t\t\t\t++tail;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<minCount<<endl<<endl;\n\t\tif(minLen!=1e9)\n\t\t{\n\t\t\ttemp = text.substr(minIndex,minLen);\n\t\t\tfor(i=0;i<temp.size();++i)\n\t\t\t{\n\t\t\t\tcout<<temp[i];\n\t\t\t\tif(i!=temp.size()-1&&i%72==71)cout<<endl;\n\t\t\t}\n\t\t\tcout<<endl<<endl;\n\t\t}\n\t}\n}", "/*\n000000000011111111112222222222333333333344444444\n012345678901234567890123456789012345678901234567\nTfefirstemampleistrivivlTfefirstemampleistrifivl\n . . .\nlen = 18 sp = 3\nlen = 15 sp = 11\nlen = 12 sp = 22\nlen = 12 sp = 35\nmfv\n \n000000000011111111112222222222\n012345678901234567890123456789\naabbccbbccaabbaacceeddffccaabb\n . ..\n \nlen = 4 sp = 1\n \nabc\n \n*/\n \n#include<set>\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n \n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n \nusing namespace std;\n \nvoid compute(string text,string S)\n{\n int nt = text.size(),nS = S.size();\n int mlen = inf;\n string ans;\n set<string> all;\n bool found[nS];\n int CNT = 0;\n int fpos[nS];\n rep(i,nS)found[i] = false;\n \n rep(i,nt)\n {\n bool update = false;\n int cnt = 0,mn,mx;\n mn = inf,mx = -inf;\n rep(j,nS)\n {\n if(S[j] == text[i])\n {\n update = true;\n found[j] = true;\n fpos[j] = i;\n }\n if(found[j])\n {\n cnt++;\n mn = min(mn,fpos[j]);\n mx = max(mx,fpos[j]);\n }\n }\n if(cnt == nS)\n {\n int cost = mx - mn + 1;\n if(cost < mlen)\n {\n mlen = cost;\n ans = text.substr(mn,cost);\n all.clear();\n CNT = 1;\n all.insert(text.substr(mn,cost));\n }\n else if(cost == mlen)\n {\n if(update)CNT++;\n all.insert(text.substr(mn,cost));\n }\n }\n }\n cout << CNT << endl << endl;\n //printf(\"%d\\n\\n\",(int)all.size());\n \n if(all.empty())\n {\n return;\n }\n \n rep(i,ans.size())\n if((i+1)%72 == 0 && i != 0)\n printf(\"%c\\n\",ans[i]);\n else\n printf(\"%c\",ans[i]);\n if(ans.size()%72 != 0)puts(\"\\n\");\n else puts(\"\");\n}\n \nint main()\n{\n string blank;\n while(getline(cin,blank))\n {\n string text,S;\n text += blank;\n while(getline(cin,blank))\n {\n if(blank.empty())break;\n text += blank;\n }\n if(text.empty())goto Fin;\n while(getline(cin,blank))\n if(blank.empty())break;\n else S += blank;\n compute(text,S);\n }\n Fin:;\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) begin(v), end(v)\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\n#define min(...) min({__VA_ARGS__})\n#define max(...) max({__VA_ARGS__})\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\n\nusing pint = pair<int, int>;\nusing tint = tuple<int, int, int>;\nusing vint = vector<int>;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n string line;\n while(getline(cin, line), line != \"\") {\n string s = line, a;\n while(getline(cin, line), line != \"\") s += line;\n getline(cin, a);\n\n int n = s.size(), k = a.size();\n vint pos[55];\n rep(i, n) rep(j, k) {\n if(s[i] == a[j]) pos[j].push_back(i);\n }\n bool imp = false;\n rep(i, k) if(!pos[i].size()) imp = true;\n if(imp) {\n cout << 0 << endl << endl;\n getline(cin, line);\n continue;\n }\n\n int idx[55] = {};\n int ans = 0, head = 0, len = n;\n rep(i, n) {\n int tail = i;\n rep(j, k) chmax(tail, pos[j][idx[j]]);\n if(tail-i+1 < len) ans = 0, head = i, len = tail-i+1;\n if(tail-i+1 == len) ans++;\n int p = a.find(s[i]);\n if(p != -1) {\n\tidx[p]++;\n\tif(idx[p] >= pos[p].size()) break;\n }\n }\n\n string t = s.substr(head, len);\n cout << ans << endl;\n rep(i, t.size()) {\n if(i%72 == 0) cout << endl;\n cout << t[i];\n }\n cout << endl << endl;\n getline(cin, line);\n }\n\n return 0;\n}", "#include<iostream>\n#include<string>\n#include<vector>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < (int)n; i++)\n\nbool T[256];\nint P[256];\n\nvector<string> compute(string text, string key){\n\n vector<string> ans;\n int k = key.size();\n rep(i, 256) P[i] = -1;\n int l = text.size();\n int r = -1;\n\n rep(i, 256) T[i] = false;\n rep(i, k) T[key[i]] = true;\n\n rep(i, k){\n\trep(j, text.size()){\n\t if ( key[i] == text[j] ) { \n\t\tP[key[i]] = j; \n\t\tl = min(l, j);\n\t\tr = max(r, j);\n\t\tbreak; \n\t }\n\t}\n }\n rep(i, k) if ( P[key[i]] == -1 ) return ans;\n for ( int i = l; i <= r; i++ ){\n\tif ( T[text[i]] ){\n\t if ( P[text[i]] < i ) P[text[i]] = i;\n\t}\n }\n\n ans.push_back(text.substr(l, r-l+1));\n\n for ( int i = r+1; i < text.size(); i++ ){\n\tchar ch = text[i];\n\tif ( T[ch] ){\n\t r = i;\n\t P[ch] = i;\n\t l = r;\n\t rep(t, k){\n\t\tif ( T[key[t]] ){\n\t\t l = min(l, P[key[t]]);\n\t\t}\n\t }\n\t string c = text.substr(l, r-l+1);\n\t if ( ans[0].size() == c.size() ) ans.push_back(c);\n\t else if ( ans[0].size() > c.size() ){\n\t\tans.clear();\n\t\tans.push_back(c);\n\t }\n\t}\n }\n\n return ans;\n}\n\nvoid output(string line){\n rep(i, line.size()){\n\tif ( i % 72 == 0 && i != 0 ) cout << endl;\n\tcout << line[i];\n }\n cout << endl;\n\n}\n\nint main(){\n string text, line, key;\n while(1){\n\ttext = \"\";\n\twhile(1){\n\t getline(cin, line);\n\t if ( line.size() == 0 ) break;\n\t text += line;\n\t}\n\tif ( text == \"\" ) break;\n\tgetline(cin, key);\n\tgetline(cin, line);\n\tvector<string> ans = compute(text, key);\n\tcout << ans.size() << endl;\n\tif ( ans.size() > 0 ){\n\t cout << endl;\n\t output(ans[0]);\n\t}\n\tcout << endl;\n }\n}" ]
Example Input 10 3 3 7 8 9 2 5 Output 23
[ "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\tint n,m;\n\tcin >> n >> m;\n\tvector<int> after(n+2, 0);\n\tfor(int i=0; i<m; i++){\n\t\tint c,d;\n\t\tcin >> c >> d;\n\t\tafter[c] = max(after[c], d);\n\t}\n\tint ans = 0;\n\tint farthest = 0;\n\tfor(int i=0; i<=n; i++){\n\t\tfarthest = max(farthest, after[i]);\n\t\tif(farthest > i){\n\t\t\tans += 3;\n\t\t}else{\n\t\t\tans += 1;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}\n", "#include <cstdio>\n\nint N, M;\nint imos[1010];\nint main() {\n scanf(\"%d%d\", &N, &M);\n for(int i=0; i<M; i++) {\n int l, r; scanf(\"%d%d\", &l, &r);\n imos[l]++;\n imos[r]--;\n }\n for(int i=1; i<=N; i++) {\n imos[i] += imos[i-1];\n }\n\n int prev = -1, ans = N + 1;\n for(int i=1; i<=N+1; i++) {\n if( imos[i] && prev < 0) prev = i;\n if(!imos[i] && prev >= 0) {\n // printf(\"l = %d, r = %d\\n\", prev, i);\n ans += 2 * (i - prev);\n prev = -1;\n }\n }\n printf(\"%d\\n\", ans);\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <vector>\n\n#define phb push_back\n#define mkp make_pair\n#define frs first\n#define scn second\n#define sz(x) int((x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\n\ntypedef pair< int, int > Pr;\n\nint N, M;\nvector< Pr > C;\n\nvoid read();\nvoid solve();\n\nbool cmpf(const Pr &, const Pr &);\n\nint main() {\n read();\n solve();\n return 0;\n}\n\nvoid read() {\n int c, d;\n\n cin >> N >> M;\n for (int i = 0; i < M; ++i) {\n cin >> c >> d;\n C.phb(mkp(c, d));\n }\n}\n\nvoid solve() {\n vector< Pr > cp;\n\n for (int i = 0; i < M; ++i) {\n bool ign = false;\n\n for (int j = 0; j < M && !ign; ++j)\n if (i != j && ((C[i].frs >= C[j].frs) && (C[i].scn <= C[j].scn)))\n ign = true;\n\n if (!ign)\n cp.phb(C[i]);\n }\n\n stable_sort(all(cp), cmpf);\n\n int res = N + 1;\n\n for (int i = 0, j = 0, ed; i < sz(cp); i = j) {\n j = i + 1, ed = cp[i].scn;\n\n while (j < sz(cp) && (ed >= cp[j].frs))\n ed = cp[j].scn, ++j;\n\n res += 2 * (ed - cp[i].frs);\n }\n\n cout << res << \"\\n\";\n}\n\nbool cmpf(const Pr &ra, const Pr &rb) {\n return ra.frs < rb.frs;\n}", "#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <deque>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <algorithm>\n\nusing namespace std;\n\n#define rep(i,j) REP((i), 0, (j))\n#define REP(i,j,k) for(int i=(j);(i)<(k);++i)\n#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))\n#define ALL(v) (v).begin(), (v).end()\n#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))\n#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)\n#define SQ(x) ((x)*(x))\n#define Mod(x, mod) (((x)+(mod)%(mod))\n#define MP make_pair\n#define PB push_back\n#define Fi first\n#define Se second\n#define INF (1<<29)\n#define EPS 1e-10\n#define MOD 1000000007\n\ntypedef pair<int, int> pi;\ntypedef pair<int, pi> pii;\ntypedef vector<int> vi;\ntypedef queue<int> qi;\ntypedef long long ll;\n\nint st[1024];\n\nint main()\n{\n int N, m;\n\n cin >> N >> m;\n rep(i, m){\n int c, d; cin >> c >> d;\n st[c]++;\n st[d]--;\n }\n rep(i, N) st[i+1] += st[i];\n int res = 0;\n rep(i, N+1)\n if(st[i+1]) res += 3;\n else res += 1;\n cout << res << endl;\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\n\nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tint n,m; cin >> n >> m;\n\tvector<int> a(n+2);\n\twhile(m--){\n\t\tint x,y; cin >> x >> y;\n\t\ta[x]++;\n\t\ta[y]--;\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\ta[i]+=a[i-1];\n\t}\n\tint res=n+1;\n\tfor(int i=1;i<=n;i++){\n\t\tif(a[i]>=1)res+=2;\n\t}\n\tprintf(\"%d\\n\",res);\n}\n", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint dfs(int n, vector<vector<int> >& adj){\n\tif((int)adj[n].size() == 0) return n;\n\tint ret=0;\n\tfor(int i=0; i<(int)adj[n].size(); i++){\n\t\tret = max(ret, dfs(adj[n][i], adj));\n\t}\n\tadj[n].clear();\n\treturn ret;\n}\n\nint main(){\n\tint n,m;\n\tcin >> n >> m;\n\t\n\tvector<vector<int> > need(n+1);\n\tfor(int i=0; i<m; i++){\n\t\tint c,d;\n\t\tcin >> c >> d;\n\t\tneed[c].push_back(d);\n\t}\n\tvector<int> c,d;\n\tfor(int i=1; i<=n; i++){\n\t\tint top = dfs(i, need);\n\t\tif(top != i){\n\t\t\tc.push_back(i);\n\t\t\td.push_back(top);\n\t\t}\n\t}\n\tc.push_back(n+1);\n\td.push_back(n+1);\n\t\n\tint ans = 0;\n\tint s=c[0], e=d[0];\n\tfor(int i=1; i<(int)c.size(); i++){\n\t\tif(c[i] <= e){\n\t\t\te = max(e, d[i]);\n\t\t}else{\n\t\t\tans += e-s;\n\t\t\ts = c[i];\n\t\t\te = d[i];\n\t\t}\n\t}\n\tans = n +1 +ans*2;\n\tcout << ans << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> pii;\n\nint main(){\n int n,m;\n cin >> n >> m;\n vector<pii> r(m);\n for(int i=0;i<m;i++)cin >> r[i].first >> r[i].second;\n sort(r.begin(),r.end());\n\n int s=-1,t=-1,sum=0;\n for(int i=0;i<m;i++){\n if(r[i].first<=t){\n t = max(t, r[i].second);\n }else{\n sum += t-s;\n s = r[i].first, t = r[i].second;\n }\n }\n sum += t-s;\n\n cout << n+1 + 2*sum << endl;\n}", "#include<iostream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<map>\n#include<set>\n#include<algorithm>\n#include<functional>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cassert>\n#include<ctime>\nusing namespace std;\n\n#define mind(a,b) (a>b?b:a)\n#define maxd(a,b) (a>b?a:b)\n#define absd(x) (x<0?-(x):x)\n#define pow2(x) ((x)*(x))\n#define rep(i,n) for(int i=0; i<n; ++i)\n#define repr(i,n) for(int i=n-1; i>=0; --i)\n#define repl(i,s,n) for(int i=s; i<=n; ++i)\n#define replr(i,s,n) for(int i=n; i>=s; --i)\n#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)\n#define repe(e,obj) for(auto e : obj)\n\n#define SP << \" \" <<\n#define COL << \" : \" <<\n#define COM << \", \" <<\n#define ARR << \" -> \" <<\n#define PNT(STR) cout << STR << endl\n#define POS(X,Y) \"(\" << X << \", \" << Y << \")\"\n#define DEB(A) \" (\" << #A << \") \" << A\n#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << \" \"; cout << endl\n#define ALL(V) (V).begin(), (V).end()\n#define INF 1000000007\n#define INFLL 1000000000000000007LL\n#define EPS 1e-9\n\ntypedef unsigned int uint;\ntypedef unsigned long ulong;\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef long double ld;\n#define P_TYPE int\ntypedef pair<P_TYPE, P_TYPE> P;\ntypedef pair<P, P_TYPE> PI;\ntypedef pair<P_TYPE, P> IP;\ntypedef pair<P, P> PP;\ntypedef priority_queue<P, vector<P>, greater<P> > pvqueue;\n\n#define N 1003\n\nint n, m;\nint cnt[N];\nint main() {\n cin >> n >> m;\n rep(i, m) {\n int c, d;\n cin >> c >> d;\n cnt[c-1] += 1;\n cnt[d-1] -= 1;\n }\n int ans = n + 1;\n int cur = 0, fst = 0;\n rep(i, n) {\n if(cur == 0 && cnt[i] > 0) {\n fst = i;\n }\n cur += cnt[i];\n if(cnt[i] < 0 && cur == 0) {\n ans += (i - fst) * 2;\n }\n }\n cout << ans << endl;\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <map>\n#include <set>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <bitset>\n#include <algorithm>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\n#define Rep(b, e, i) for(int i = b; i <= e; i++)\n#define Repr(e, b, i) for(int i = e; i >= b; i--)\n#define rep(n, i) Rep(0, n-1, i)\n#define repr(n, i) Repr(n-1, 0, i)\n#define all(v) (v).begin(), (v).end()\n#define pb(x) push_back(x)\n#define uniq(x) (x).erase(unique(all(x)),(x).end())\n\ntypedef long long ll;\ntypedef pair<ll, ll> llP;\ntypedef pair<int, int> intP;\ntypedef std::priority_queue<int> IntPrioQueue; //Z->A\ntypedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z\n\nconst int MAX = 1024;\nconst double PI = 3.14159265358979323846;\nconst double EPS = 1e-12;\nconst int INF = 1<<29;\nconst int MOD = 1000000007;\n\nint step[MAX];\n\nvoid solve(void){\n int N, m;\n cin >> N >> m;\n //累積和を用いることでO(N)に計算量が落とせる\n //半開区間[a, b)で持つ\n rep(m, i) {\n int a, b;\n scanf(\"%d %d\\n\", &a, &b);\n a--; b--;\n step[a]++;\n step[b]--;\n }\n rep(N, i) step[i+1] += step[i];\n int dis = 0, ans = 0;\n rep(N+1, n) {\n if (step[n] > 0) dis++;\n else {\n ans += dis;\n dis = 0;\n }\n }\n ans = ans*2+1+N;\n cout << ans << '\\n';\n}\n\nint main(void){\n solve();\n return 0;\n}\n\n", "#include \"bits/stdc++.h\"\n\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define RREP(i,n) for(ll i=n-1;i>=0;--i)\n#define FOR(i,m,n) for(ll i=m;i<n;++i)\n#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)\n#define ALL(v) (v).begin(),(v).end()\n#define PB(a) push_back(a)\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());\n#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << \" \"; else cout << endl; }\n#define INF 1000000001ll\n#define MOD 1000000007ll\n#define EPS 1e-9\n\nconst int dx[8] = { 1,1,0,-1,-1,-1,0,1 };\nconst int dy[8] = { 0,1,1,1,0,-1,-1,-1 };\n\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vi> vvi;\ntypedef vector<vl> vvl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nll max(ll a, int b) { return max(a, ll(b)); }\nll max(int a, ll b) { return max(ll(a), b); }\nll min(ll a, int b) { return min(a, ll(b)); }\nll min(int a, ll b) { return min(ll(a), b); }\n///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint n, m;\n\tcin >> n >> m;\n\tvector<pii> v(m);\n\tREP(i, m)cin >> v[i].first >> v[i].second;\n\tsort(ALL(v));\n\tint ans = n + 1;\n\tint c = 0, d = 0;\n\tREP(i, m) {\n\t\tif (v[i].first > d) {\n\t\t\tans += 2 * (d - c);\n\t\t\tc = v[i].first;\n\t\t\td = v[i].second;\n\t\t}\n\t\telse d = max(d, v[i].second);\n\t}\n\tans += 2 * (d - c);\n\tcout << ans << endl;\n}", "#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n\tint N, m;\n\tcin >> N >> m;\n\tvector<bool> b(N);\n\tfor (int i = 0; i < m; ++ i) {\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\t-- c; -- d;\n\t\tfor (int j = c; j < d; ++ j) {\n\t\t\tb[j] = true;\n\t\t}\n\t}\n\tint r = N+1;\n\tfor (int i = 0; i < N; ++ i) if (b[i]) r += 2;\n\tcout << r << endl;\n}\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n int n,d,flg[1002]={};\n cin >> n >> d;\n for(int i=0;i<d;i++) {\n int a,b;\n cin >>a>>b;\n flg[a] = max(flg[a],b);\n }\n \n int sta=0,sum=0,L=0,R=0;\n for(int i=0;i<=n;i++) {\n if(flg[i] != 0 && sta==1) R=max(R,flg[i]);\n else if(flg[i] != 0) L=i,R=flg[i],sta=1;\n else if(i==R) sum += 3*(R-L)+1,sta=0;\n else if(sta==0) sum++;\n }\n cout << sum <<endl;\n return 0;\n}", "#include <cstdio>\n\n#include <cmath>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <algorithm>\n\n#include <queue>\n\n#include <vector>\n\n#include <map>\n\n\n\nusing namespace std;\n\n\n\ntypedef long long LL;\n\n\nint n,m,x,y;\nvector<int> v[1005];\nint a[1005];\nint ans,dq,len,nxt;\n\nint main()\n\n{\n\n\tscanf(\"%d%d\",&n,&m);\n\tfor (int i=1;i<=m;++i) \n\t{\t\n\t\tscanf(\"%d%d\",&x,&y);\n\t\tv[x].push_back(y);\t\t\n\t}\n\tfor (int i=1;i<=n;++i) a[i]=i;\n\tfor (int i=n;i>=1;--i)\n\t{\n\t\tfor (int j=0;j<v[i].size();++j)\n\t\t{\n\t\t\ta[i]=max(a[i],a[v[i][j]]);\n\t\t}\n\t}\n\tans=1;dq=1;\n\twhile (dq<=n)\n\t{\n\t\tnxt=a[dq];len=0;\n\t\tfor (int i=dq+1;i<=nxt;++i)\n\t\t{\n\t\t\tlen++;nxt=max(nxt,a[i]);\n\t\t}\n\t\tans+=3*len;\n\t\tans++;\n\t\tdq=nxt+1;\n\t}\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n\n}", "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nstruct ioi{\n\tint l,r;\t\n} seg[510];\n\nint n, m;\n\nbool intersect(ioi a,ioi b){\n\tif (a.l>b.l) swap(a,b);\n\tif (b.l<=a.r) return true;\n\telse return false;\n}\n\nioi combine(ioi a,ioi b){\n\ta.l = min(a.l, b.l);\n\ta.r = max(a.r, b.r);\n\treturn a;\n}\n\nint main(){\n\tcin >> n >> m;\n\tfor (int i=1;i<=m;i++)\n\t\tcin >> seg[i].l >> seg[i].r;\n\tlong long res = n+1;\n\tsort(seg+1, seg+m+1,[](ioi a,ioi b){\n\t\treturn (a.l<b.l or (a.l==b.l and a.r>b.r));\n\t});\n\tioi current_segment = seg[1];\n\tfor (int i=1;i<=m;i++){\n\t\tif (intersect(seg[i], current_segment)){\n\t\t\tcurrent_segment = combine(current_segment, seg[i]);\n\t\t}\n\t\telse{\n\t\t\tres += 2*(current_segment.r - current_segment.l);\n\t\t\tcurrent_segment = seg[i];\n\t\t}\n\t}\n\n\tres += 2*(current_segment.r - current_segment.l);\n\tcout << res << \"\\n\";\n}", "#define D(x) cout << #x \" = \" << x << endl\n#define DD(x, y) cout << \"(\" #x \", \" #y \") = (\" << x << \", \" << y << \")\" << endl\n#define DDD(x, y, z) cout << \"(\" #x \", \" #y \", \" #z \") = (\" << x << \", \" << y << \", \" << z << \")\" << endl\n#define DV(v) for (auto __macro_vi : v){ cout << __macro_vi << \" \";} cout << endl;\n#define DA(a, n) for (int __macro_i = 0; __macro_i < n; ++__macro_i) { cout << a[__macro_i] << \" \"; } cout << endl;\n#define REP(i, n) for (int i = 0; i < n; ++i)\n#define ALL(v) (v).begin(), (v).end()\n#include<iostream>\n#include<vector>\n#include<cassert>\n#include<cmath>\n#include<algorithm>\ntemplate<class T, class U> std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p){ os << \"(\" << p.first << \", \" << p.second << \")\"; return os; }\n\nusing namespace std;\nusing P = pair<int, int>;\nint n, m;\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> n >> m;\n \n vector<P> revs(0);\n REP(i, m) {\n int aft, pre;\n cin >> aft >> pre;\n revs.emplace_back(aft, pre);\n }\n sort(ALL(revs));\n\n int pos = 0;\n int ans = 0;\n int k = 0;\n while(k < revs.size()) {\n // DD(k, pos);\n int pre = revs[k].second;\n int aft = revs[k].first;\n // DD(pre, aft);\n while(k+1 < revs.size() && revs[k+1].first < pre) {\n k++;\n pre = max(pre, revs[k].second);\n // DD(\"contains\", k);\n }\n ans += pre - pos + (pre - aft) * 2;\n // D(pre - pos + (pre - aft) * 2);\n pos = pre;\n k++;\n }\n ans += n + 1 - pos;\n cout << ans << endl;\n}\n\n", "#include <cstdio>\nusing namespace std;\n\nint s[1010][2],n,m,ans;\nint f[1010];\nint min(int a,int b){\n\treturn a<b?a:b;\n}\nint main(){\n\tscanf(\"%d%d\",&n,&m);\n\tfor(int i=0;i<m;i++){\n\t\tscanf(\"%d%d\",&s[i][0],&s[i][1]);\n\t\t//s[i][0]--;]s[i][1]--;\n\t}\n\tfor(int i=0;i<m;i++){\n\t\tfor(int j=i+1;j<m;j++){\n\t\t\tif(s[j][1]<s[i][1]||(s[j][1]==s[i][1]&&s[j][0]<s[i][0])){\n\t\t\t\tfor(int k=0;k<2;k++){\n\t\t\t\t\tint c=s[i][k];\n\t\t\t\t\ts[i][k]=s[j][k];\n\t\t\t\t\ts[j][k]=c;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<m;i++){\n\t\tf[i]=100*n*n;\n\t\tint minc=s[i][0];\n\t\tfor(int j=i-1;j>=0;j--){\n\t\t\tf[i]=min(f[i],f[j]+(s[i][1]-s[j][1])+2*(s[i][1]-minc));\n\t\t\tminc=min(minc,s[j][0]);\n\t\t}\n\t\tf[i]=min(f[i],s[i][1]+2*(s[i][1]-minc));\n\t}\n\tprintf(\"%d\\n\",f[m-1]+(n+1-s[m-1][1]));\n}", "#include <cstdio>\n\nint main(){\n\tint n,m;\n\tint sum[1010] ={};\n\t\n\tscanf(\"%d%d\",&n,&m);\n\t\n\tfor(int i=0;i<m;i++){\n\t\tint a,b;\n\t\tscanf(\"%d%d\",&a,&b);\n\t\t\n\t\tsum[a-1]++;\n\t\tsum[b-1]--;\n\t}\n\t\n\tint ans=0;\n\t\n\tfor(int i=0;i<n;i++){\n \t\tsum[i+1] += sum[i];\n\t\tans += !!sum[i] * 2;\n\t}\n\t\n\tprintf(\"%d\\n\",ans+(n+1));\n\t\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\ntypedef pair<int,int> P;\n\nP t[1002];\n\nint main() {\n int n, m;\n\n while (cin >> n >> m) {\n for (int i = 0; i < m; i++) {\n cin >> t[i].first >> t[i].second;\n }\n sort(t, t + m);\n\n vector<P> v;\n\n for (int i = 0; i < m; i++) {\n int lft = t[i].first;\n int rht = t[i].second;\n int j = i + 1;\n\n while (j < m && lft <= t[j].first && t[j].first <= rht) {\n rht = max(rht, t[j].second);\n j++;\n }\n\n v.push_back(P(lft, rht));\n i = j - 1;\n }\n\n int ans = 0;\n int now = 0;\n\n for (int i = 0; i < v.size(); i++) {\n ans += abs(now - v[i].second);\n ans += v[i].second - v[i].first;\n now = v[i].first;\n }\n\n ans += (n + 1) - now;\n\n cout << ans << endl;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef vector<int> vec;\n\nint main () {\n int N, m; cin >> N >> m;\n vec c(m), d(m);\n for (int i = 0; i < m; i++) {\n cin >> c[i] >> d[i];\n }\n\n vec h(N + 1);\n for (int i = 0; i < m; i++) {\n if (c[i] < d[i]) {\n for (int j = c[i] + 1; j <= d[i]; j++) {\n h[j] = 1;\n }\n }\n }\n\n int res = N + 1;\n for (int i = 1; i <= N; i++) {\n if (h[i]) {\n res += 2;\n }\n }\n\n cout << res << endl;\n\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n int n,m;\n cin>>n>>m;\n vector<int> s(n+1,0);\n for(int i=0;i<m;i++){\n int a,b; cin>>a>>b;\n s[a]++; s[b]--;\n }\n partial_sum(s.begin(),s.end(),s.begin());\n cout<< n+1+ (n+1-count(s.begin(),s.end(),0))*2 <<endl;\n}\n\n", "// Author :\n// Date :\n// Problem:\n// Solution:\n// Comment:\n\n#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <cmath>\n#include <cstring>\n\n#define pp push\n#define pb push_back\n#define mp make_pair\n#define xx first\n#define yy second\n\nusing namespace std;\n\nvoid play(int n , int c){\n int mas[1005]={0};\n int lock[1005] = {0};\n int cur = 0;\n int left = 0;\n int maxx = -1;\n int minn = -1;\n int step = 0;\n \n int a,b;\n for(int i = 0 ; i < c ; i++){\n cin >> a >> b;\n if(lock[a] < b){\n lock[a] = b;\n }\n }\n \n //cout << cur << endl;\n \n while(cur < n+1){\n //cout << cur << endl;\n if(lock[cur] != 0 && lock[cur] > maxx) maxx = lock[cur];\n if(lock[cur] != 0 && minn == -1) minn = cur;\n \n if(cur == maxx){\n while(cur > minn){\n \n cur--;\n lock[cur] = 0;\n //cout << \"minn \" << minn << endl;\n //cout << cur << endl;\n step++;\n }\n maxx = -1;\n minn = -1;\n }\n cur++;\n step++;\n }\n\n cout << step << endl;\n}\nint main(){\n int a,b;\n \n cin >> a >> b;\n \n play(a,b);\n \n #ifdef GEREL\n for(;;);\n #endif\n\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int N,m; cin >> N >> m;\n vector<pair<int,int>> pos;\n for (int i=0;i<m;++i){\n int c,d; cin >> c >> d;\n pos.emplace_back(c,d);\n }\n pos.emplace_back(N+1,N+1);\n sort(pos.begin(),pos.end());\n int l=0,r=0,ans=N+1;\n for (int i=0;i<m+1;++i){\n if (r<pos[i].first) ans+=2*(r-l),l=pos[i].first;\n r=max(r,pos[i].second);\n }\n cout << ans << '\\n';\n}\n", "//\n// Created by 拓真 on 2018/06/24.\n//\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\n\n\nint x[11234];\nint main(){\n int n,m;\n cin>>n>>m;\n for(int i=0;i<n;i++)x[i]=1;\n for(int i=0;i<m;i++){\n int c,d;\n cin>>c>>d;\n for(int j=c;j<d;j++){\n x[j]=3;\n }\n }\n int ans=0;\n for(int i=0;i<n;i++){\n ans+=x[i];\n }\n cout<<ans+1<<endl;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> pos(n+1,1);\n for(int i=0;i<m;i++){\n int c,d;\n cin>>c>>d;\n for(int j=c;j<d;j++) pos[j]=3;\n }\n cout<<accumulate(pos.begin(),pos.end(),0)<<endl;\n \n return 0;\n}\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n\n long long int n, m;\n cin >> n >> m;\n\n long long int v[1001] = {};\n\n for ( long long int i = 0; i < m; i++ ) {\n\n long long int in_c, in_d;\n cin >> in_c >> in_d;\n\n v[ in_c ]++;\n v[ in_d ]--;\n\n }\n\n for ( long long int i = 1; i <= n; i++ ) {\n v[i] += v[i-1];\n }\n\n long long int ans = 0;\n\n for ( long long int i = 0; i <= n; i++ ) {\n\n if ( v[i] == 0 ) {\n ans += 1;\n }else {\n ans += 3;\n }\n\n }\n\n cout << ans << endl;\n\n return 0;\n\n}", "#include<bits/stdc++.h>\n#define pb emplace_back\n#define xx first\n#define yy second\nusing namespace std;\ntypedef pair<int, int>pi;\nvector<pi>vec;\nbool vis[1003];\nint main()\n{\n int n, m, x, y;\n while(scanf(\"%d %d\", &n, &m)==2)\n {\n vec.clear();\n for(int i=0; i<m; i++)\n {\n scanf(\"%d %d\", &x, &y);\n vec.pb(x, y);\n }sort(vec.begin(), vec.end());\n memset(vis, 0, sizeof vis);\n int ans= 0, c= 0, temp= 0;\n for(int i=0; i<m; i++)\n if(!vis[i])\n {\n int l= vec[i].xx;\n int r= vec[i].yy;\n while(i<m)\n {\n if(vec[i].xx>r)break;\n r= max(r, vec[i].yy);\n vis[i]= 1;\n i++;\n }i--;\n ans+= (r-l); temp+= (r-l+1);c++;\n }\n ans= ((n-temp)+c+1) +(ans*3);\n printf(\"%d\\n\", ans);\n }\n\n return 0;\n}\n\n", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n int n, m, answer = 0;\n cin >> n >> m;\n bool flag = 0;\n int start_point;\n vector<int> shop_gap(n + 1, 0);\n for (int i = 0; i < m; i++)\n {\n int c, d;\n cin >> c >> d;\n for (int j = c; j < d; j++)\n {\n shop_gap.at(j)++;\n }\n }\n for (int i = 0; i < n + 1; i++)\n {\n if (shop_gap.at(i) != 0 && flag == 0)\n {\n flag = 1;\n start_point = i;\n }\n else if (shop_gap.at(i) == 0 && flag == 1)\n {\n flag = 0;\n answer += 2 * (i - start_point);\n }\n }\n answer += n + 1;\n cout << answer << endl;\n return 0;\n}\n", "#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a*b/gcd(a,b);\n}\n\n\nint main(void) {\n int i,j;\n int n,m;\n cin >> n >> m;\n vi imos(n+1,0);\n rep(i,m){\n int a,b;\n cin >> a >> b;\n imos[a]++;\n imos[b]--;\n }\n rep(i,n)imos[i+1]+=imos[i];\n int ans = 0;\n rep(i,n+1){\n ans++;\n if(imos[i])ans+=2;\n }\n cout << ans << endl;\n}\n\n", "#include <algorithm>\n#include <bitset>\n#include <cstdio>\n#include <cassert>\n#include <cmath>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <tuple>\n#include <utility>\n#include <vector>\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair<int, int> P;\ntypedef pair<LL, LL> PLL;\n\nint main() {\n int N, M;\n int c[500], d[500];\n\n cin >> N >> M;\n for (int j = 0 ; j < M; ++j) {\n cin >> c[j] >> d[j];\n }\n\n int arr[1010];\n fill(arr, arr+1010, 0);\n\n for (int j = 0; j < M; ++j) {\n --arr[c[j]];\n ++arr[d[j]];\n }\n\n for (int j = 1; j < N+1; ++j) {\n arr[j] += arr[j-1];\n }\n\n int ret = 0;\n for (int j = 1; j <= N+1; ++j) {\n if (arr[j] == 0) {\n ++ret;\n } else {\n ret += 3;\n } \n }\n cout << ret << endl;\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <set>\n#include <map>\n#define f first\n#define s second \nusing namespace std;\nint n,m;\n\nint main(){\n cin >> n >> m;\n\n vector<int> vec(n+2,0);\n \n for(int i = 0;i < m;i++){\n\tint f,t;\n\tcin >> t >> f;\n\tvec[t]++;\n\tvec[f]--;\n }\n for(int i = 0;i < n+1;i++){\n\tvec[i+1] += vec[i];\n }\n int ans = 0;\n for(int i = 0;i < n+2;i++){\n\tif(vec[i])ans++;\n }\n cout << n+1+ans*2 << endl;\n \n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define each(itr,v) for(auto itr:v)\n#define pb(s) push_back(s)\n#define mp(a,b) make_pair(a,b)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define maxch(x,y) x=max(x,y)\n#define minch(x,y) x=min(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt(x) bitset<32>(x).count()\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<P, int> PPI;\ntypedef pair<ll, ll> PL;\ntypedef pair<P, ll> PPL;\n\n#define INF INT_MAX/3\n\n#define MAX_N 1000\n\nint n,m;\nbool used[1111];\n\nint main(){\n\tcin.sync_with_stdio(false);\n\tcin>>n>>m;\n\trep(i,m){\n\t\tint c,d;\n\t\tcin>>c>>d;\n\t\tc--; d--;\n\t\trepl(i,c,d){\n\t\t\tused[i]=true;\n\t\t}\n\t}\n\tint l=-1;\n\tint cnt=0;\n\trep(i,n+1){\n\t\tif(l==-1&&used[i]){\n\t\t\tl=i;\n\t\t}else if(l!=-1&&!used[i]){\n\t\t\tcnt+=(i-l);\n\t\t\tl=-1;\n\t\t}\n\t}\n\tcout<<n+1+cnt*2<<endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<bool> shop(n + 1, false);\n for (int i = 0; i < m; i++) {\n int c, d;\n cin >> c >> d;\n for (int j = c; j < d; j++) shop[j] = true;\n }\n int ans = 0;\n for (int i = 0; i < n + 1; i++) {\n if (shop[i]) ans += 2;\n }\n cout << ans + n + 1 << endl;\n return 0;\n}\n", "#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\ntypedef complex<double> P;\nconst int MAX_N = 1010;\n\nint N, M;\nint cnt[MAX_N];\n\nint main() {\n cin >>N >>M;\n memset(cnt, 0, sizeof(cnt));\n REP(i, M){\n int s, t; cin >>s >>t;\n ++cnt[s];\n --cnt[t];\n }\n FOR(i, 1, MAX_N) cnt[i] += cnt[i - 1];\n int ans = 0;\n FOR(i, 1, N + 2) ans += (cnt[i] > 0 ? 3 : 1);\n cout <<ans <<endl;\n return 0;\n}", "//#include<bits/stdc++.h>\n#include<iostream>\n#include<iomanip>\n#include<cmath>\n#include<cstdlib>\n#include<cstring>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<map>\n#include<numeric>\n#include<bitset>\n#include<limits>\n#include<unordered_map>\n#include<functional>\nusing namespace std;\n\n#define rep(i,s,n) for(int i=s;i<n;i++)\n#define dow(i,n,s) for(int i=n-1;i>=s;i--)\n#define all(a) a.begin(),a.end()\n#define Sort(a) sort(all(a))\n#define Qsort(a,size) qsort(a,size,sizeof(*a),compare_int)\n#define DEBUG\ntypedef pair<int,int> II;\ntypedef unsigned long ul;\ntypedef long long ll;\ntypedef unsigned long long ull;\nbool compare_int(const void *a,const void *b) { return *(int *)a-*(int *)b; }\nbool compare_by_second(II a,II b) { return a.second!=b.second?a.second<b.second:a.first<b.first; }\n\nconst int INF = 1e+9;\nconst int MAX_N = 1e+3;\nconst int MAX_M = 5e+2;\n\nint N,m;\nint c,d;\nint cd[MAX_N+1];\nint mn = INF,mx = 0,res = 0;\nint bmx = 0;\nbool flag;\n\nint main() {\n cin>>N>>m;\n memset(cd,-1,sizeof(cd));\n rep(i,0,m) {\n cin>>c>>d;\n cd[c] = max(cd[c],d);\n }\n\n rep(i,0,N+1) {\n if(cd[i] > mx) mx = cd[i];\n if(cd[i] != -1) {\n mn = min(i,mn);\n cd[i] = -1;\n }\n if(i != 0 && i == mx) {\n res += (3*mx-2*mn-bmx);\n bmx = mx;\n flag = true;\n rep(j,i+1,N+1) {\n if(cd[j] != -1) { flag = false; break; }\n }\n if(flag) break;\n mx = 0;\n mn = INF;\n }\n }\n res+=(N+1-mx);\n cout<<res<<endl;\n return 0;\n}\n\n", "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint n, m, i, f[1002] = {0};\n\tcin >> n >> m;\n\tfor (i = 0; i < m; i++) {\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\tf[c]++;\n\t\tf[d]--;\n\t}\n\tint ans = n + 1;\n\tfor (i = 1; i < n + 2; i++) {\n\t\tf[i] += f[i - 1];\n\t\tif (f[i]) ans += 2;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "N, m = map(int, raw_input().split())\n\nthree = [False]*N\nfor loop in xrange(m):\n c, d = map(int, raw_input().split())\n if c < d:\n three[c:d] = [True]*len(three[c:d])\n\nans = 0\nfor i in xrange(N):\n ans += 1\n if three[i]:\n ans += 2\nprint ans+1", "#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\nusing namespace std;\n\n//#define int int64_t\n\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,x,...) x\n#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)\n#define REP2(i, s, n) REP1(i, s, < signed(n), ++)\n#define REP3(i, n) REP2(i, 0, n)\n#define rep(...) CHOOSE((__VA_ARGS__,REP1,REP2,REP3))(__VA_ARGS__)\n#define rrep(i, s) rep(i, s, >= 0, --)\n\n#define all(c) begin(c), end(c)\n#define maxup(ans, x) (ans = (ans < x ? x : ans))\n#define minup(ans, x) (ans = (ans > x ? x : ans))\n\n#define breakif(cond) if(cond) break; else\n\nusing VV = vector<vector<int>>;\nusing V = vector<int>;\nusing P = pair<int, int>;\nusing IP = pair<int, P>;\n\ntemplate<typename T>\ninline void input(vector<T>& v) { for (auto& x : v) cin >> x; }\n\nsigned main() {\n\tint n, m; \n\twhile (cin >> n >> m) {\n\t\tV imos(n + 1);\n\t\trep(i, m) {\n\t\t\tint c, d;\n\t\t\tcin >> c >> d;\n\t\t\tint a = n - d, b = n - c;\n\t\t\timos[a]++;\n\t\t\timos[b]--;\n\t\t}\n\t\trep(i, 1, n + 1) imos[i] += imos[i - 1];\n\t\tint ans = n + 1;\n\t\trep(i, n) ans += !!imos[i] * 2;\n\t\tcout << ans << endl;\n\t}\n}", "#define _USE_MATH_DEFINES\n \n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n \nusing namespace std;\n \ntypedef pair<long long int, long long int> P;\nlong long int INF = 1e18;\n\nint DP[2000] = {};\n\nint main(){\n\t\n\tint N, M;\n\tcin >> N >> M;\n\t\n\tfor(int i = 0; i < M; i++){\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\tDP[c]++;\n\t\tDP[d]--;\n\t}\n\t\n\tint ans = N + 1;\n\t\n\tint cur = 0;\n\tfor(int i = 0; i <= N + 1; i++){\n\t\tcur += DP[i];\n\t\tif(cur > 0){\n\t\t\tans += 2;\n\t\t}\n\t}\n\t\n\tcout << ans << endl;\n\t\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n vector<pair<int, int>> cd;\n int N, m, c, d;\n cin >> N >> m;\n int ans = N + 1;\n for(int i = 0; i < m; ++i){\n cin >> c >> d;\n cd.push_back({c, d});\n }\n sort(cd.begin(), cd.end());\n int start = 0, end = 0;\n for(int i = 0; i < m; ++i){\n if(start == 0){\n start = cd[i].first;\n }\n if(cd[i].first <= end || end == 0){\n if(cd[i].second > end){\n end = cd[i].second;\n }\n }else{\n ans += 2 * (end - start);\n start = cd[i].first;\n end = cd[i].second;\n }\n }\n ans += 2 * (end - start);\n cout << ans << endl;\n}\n", "#include <bits/stdc++.h>\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<int> imos(n + 2, 0);\n REP(i, m) {\n int c, d;\n cin >> c >> d;\n imos[c]++;\n imos[d]--;\n }\n REP(i, n + 1) imos[i + 1] += imos[i];\n int ans = n + 1;\n REP(i, n + 2) {\n if (imos[i] > 0) ans += 2;\n }\n cout << ans << endl;\n}\n\n", "import java.io.*;\nimport java.math.BigDecimal;\nimport java.util.*;\n\npublic class Main {\n\tstatic int INF = 2 << 27;\n\tstatic int[] vx = {1,0,-1,0};\n\tstatic int[] vy = {0,1,0,-1};\n\tpublic static void main(String[] args) {\t\n\t\t//FastScanner sc = new FastScanner();\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint N = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint[] c = new int[m];\n\t\tint[] d = new int[m];\n\t\tboolean[] triple = new boolean[N+1];\n\t\tfor(int i = 0; i < m; i++) {\n\t\t\tc[i] = sc.nextInt();\n\t\t\td[i] = sc.nextInt();\n\t\t\tfor(int j = c[i]; j < d[i]; j++) {\n\t\t\t\ttriple[j] = true;\n\t\t\t}\n\t\t}\n\t\tint sum = 0;\n\t\tfor(int i = 0; i <= N; i++) {\n\t\t\tif(triple[i]) sum += 3;\n\t\t\telse sum += 1;\n\t\t}\n\t\tSystem.out.println(sum);\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t}\n}", "#include <cstdio>\n#include <cstring>\n#include <string>\n#include <cmath>\n#include <iostream>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <set>\n#include <map>\n#include <bitset>\nusing namespace std;\n\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<pii, int> ppi;\n\n#define INF 1000000000\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> shops(n,0);\n\n rep(i,m){\n int c,d;\n scanf(\"%d %d\", &c,&d);\n shops[c-1]++;\n shops[d-1]--;\n }\n\n repl(i,1,n){\n shops[i] += shops[i-1];\n }\n\n int res=n+1;\n bool flg=false;\n int start;\n rep(i,n){\n if((!flg) && shops[i]>0){\n flg=true;\n start=i;\n }\n else if(flg && shops[i]==0){\n flg=false;\n res += (i-start)*2;\n }\n }\n\n cout << res << endl;\n \n return 0;\n}", "import sys\nreader=(token for line in sys.stdin for token in line.split())\n\nwhile 1:\n try:\n n=int(next(reader))\n m=int(next(reader))\n except: break\n\n a=[1]*(n+1)\n for i in range(m):\n c=int(next(reader))-1\n d=int(next(reader))-1\n for i in range(c,d):\n a[i]=3\n print(sum(a))", "#include <stdio.h>\n#include <cctype>\n#include <limits.h>\n#include <math.h>\n#include <complex>\n#include <bitset>\n#include <vector>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <iomanip>\n#include <iostream>\n\n#define VARIABLE(x) cerr << #x << \"=\" << x << endl\n#define BINARY(x) static_cast<bitset<16> >(x)\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define REP(i,m,n) for (int i=m;i<(int)(n);i++)\n#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))\n#define ALL(a) (a).begin(),(a).end()\n#define X first\n#define Y second\n\nconst int INF = 1e9;\nconst double EPS = 1e-8;\nconst double PI = 3.14159;\nint dx[4]={0, 1, 0, -1}, dy[4]={-1, 0, 1, 0};\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n\n/* struct P {\n\tint x, y, n;\n\tP(int n, int x, int y):n(n), x(x), y(y){}\n\tP(){}\n}; */\n\n\n/** Problem1347 : Shopping **/\nint main()\n{\n\tint N, m;\n\tcin>>N>>m;\n\tvector<P> list(m);\n\trep(i, m) {\n\t\tcin>>list[i].first>>list[i].second;\n\t}\n\t\n\tbool repeat[1000] = {0};\n\trep(i, m) {\n\t\tfor (int j=list[i].first; j<list[i].second; j++) {\n\t\t\trepeat[j] = true;\n\t\t}\n\t}\n\t\n\tint ans=N+1;\n\trep(i, 1000) {\n\t\tif (repeat[i]) ans+=2;\n\t}\n\t\n\tcout << ans << endl;\n}", "#define __USE_MINGW_ANSI_STDIO 0\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define int ll\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define PB push_back\n\nconst ll LLINF = (1LL<<60);\nconst int INF = (1LL<<30);\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.first<<','<<a.second<<')';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\n out<<']';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nsigned main(void)\n{\n int n, m;\n cin >> n >> m;\n vector<PII> v;\n REP(i, m) {\n int c, d;\n cin >> c >> d;\n if(c < d) v.PB({d, c});\n }\n sort(ALL(v));\n\n if(v.size() == 0) {\n cout << n+1 << endl;\n return 0;\n }\n\n int ret = n+1;\n for(int i=0; i<m; ++i) {\n // cout << \"i:\" << i << endl;\n int l = v[i].second, r = v[i].first;\n int idx = i;\n for(int j=i+1; j<m; ++j) {\n if(v[j].second <= r) {\n r = v[j].first;\n chmin(l, v[j].second);\n idx = j;\n }\n // cout << l << \" \" << r << \" \" << idx << endl;\n }\n ret += (r-l)*2;\n i = idx;\n }\n\n cout << ret << endl;\n\n return 0;\n}\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define LOG(...) fprintf(stderr, __VA_ARGS__)\n//#define LOG(...)\n#define FOR(i, a, b) for(int i=(int)(a); i<(int)(b); ++i)\n#define REP(i, n) for(int i=0; i<(int)(n); ++i)\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define EXIST(s, e) ((s).find(e)!=(s).end())\n#define SORT(c) sort(ALL(c))\n#define RSORT(c) sort(RALL(c))\n#define SQ(n) (n) * (n)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\nint main() {\n int N, m;\n cin >> N >> m;\n vi shop(N+1);\n REP(i, m){\n int c, d;\n cin >> c >> d;\n shop[c-1]++;\n shop[d-1]--;\n }\n int res = N + 1;\n int cnt = 0;\n int start = -1;\n REP(i, N){\n if(shop[i] == 0) continue;\n cnt += shop[i];\n if(start == -1) start = i;\n if(cnt == 0) {\n res += (i - start) * 2;\n start = -1;\n }\n }\n cout << res << endl;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n\tlong long int N , M , ans = 0;\n\tcin >> N >> M;\n\tvector<int>data((N + 2)*2);\n\tfor(size_t i = 0; i < M; i++)\n\t{\n\t\tint a , b;\n\t\tcin >> a >> b;\n\t\tif(b > a)\n\t\t{\n\t\t\tdata[a*2]++;\n\t\t\tdata[b*2+1]--;\n\t\t}\n\t}\n\tfor(size_t i = 1; i < (N + 2)*2; i++)\n\t{\n\t\tdata[i] += data[i - 1];\n\t}\n\tans += N + 1;\n\tlong long int begin = 0 , end;\n\tbool flag = 0,flag2=0;\n\tfor(size_t i = 0; i < (N + 2)*2; i++)\n\t{\n\t\tif(data[i] > 0)\n\t\t{\n\t\t\tflag = 1;\n\t\t}\n\t\tif(data[i] == 0)\n\t\t{\n\t\t\tif(flag)\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tans += ( i - begin - 2 ) ;\n\t\t\t}\n\t\t\tbegin = i;\n\t\t}\n\t}/*\n\tfor(size_t i = 0; i < (N + 2)*2; i++)\n\t{\n\t\tcout << data[i] << \" \";\n\t}\n\tcout << endl;*/\n\tcout << ans << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define for_(i,a,b) for(int i=a;i<b;++i)\n#define allof(a) a.begin(),a.end()\n\ntypedef pair< int, int > pii;\n\nint N, m;\n\nint main() {\n\tcin >> N >> m;\n\tvector< pii > vp;\n\t\n\tfor_(i,0,m) {\n\t\tint c, d; cin >> c >> d;\n\t\tvp.push_back(pii(c,d));\n\t}\n\t\n\tsort(allof(vp));\n\t\n\tvector< pii > vvp;\n\tint ans = 0, s = 0, a = 0, b = 0;\n\tfor_(i,0,m) {\n\t\tif (a <= vp[i].first && vp[i].first <= b) {\n\t\t\ta = min(a, vp[i].first);\n\t\t\tb = max(b, vp[i].second);\n\t\t} else {\n\t\t\tans += (b - s) + 2 * (b - a);\n\t\t\ts = b;\n\t\t\ta = vp[i].first;\n\t\t\tb = vp[i].second;\n\t\t}\n\t}\n\t\n\tans += (b - s) + 2 * (b - a) + N + 1 - b;\n\t\n\tcout << ans << endl;\n\t\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tconstexpr int MAX_N = 1000;\n\n\tint n, m;\n\tcin >> n >> m;\n\n\tbitset<MAX_N> back;\n\n\tfor(int i = 0; i < m; ++i) {\n\t\tint c, d;\n\t\tcin >> c >> d;\n\n\t\tif(c > d) continue;\n\t\tfor(int j = c; j < d; ++j) {\n\t\t\tback[j] = true;\n\t\t}\n\t}\n\n\tcout << n + 1 + back.count() * 2 << endl;\n\n\treturn EXIT_SUCCESS;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\ntypedef pair<int, int> PII;\n\nint main() {\n for (int n, m; scanf(\"%d%d\", &n, &m) == 2; ) {\n vector<int> a(n + 1, 0);\n for (int i = 0; i < m; ++ i) {\n int u, v; scanf(\"%d%d\", &u, &v);\n a[u] ++; a[v] --;\n }\n int ret(0);\n for (int i = 1; i <= n; ++ i) {\n a[i] += a[i - 1];\n if (a[i]) ret ++;\n }\n ret = ret * 2 + n + 1;\n printf(\"%d\\n\", ret);\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nvector<int> G[1111];\nint N,M;\nint main(){\n cin >> N >> M;\n for(int i=0;i<M;i++){\n int c,d;\n cin >> c >> d;\n if( c < d ) G[c].push_back(d);\n }\n int res = 0;\n for(int i=1;i<=N+1;i++){\n int rmax = i;\n if( G[i].empty() ){\n res ++; continue;\n }\n\n for(int j=0;j<(int)G[i].size();j++) rmax = max( rmax, G[i][j] );\n \n for(int j=i+1;j<rmax;j++){\n for(int k=0;k<(int)G[j].size();k++)\n\trmax = max( rmax, G[j][k] ); \n }\n\n res += (rmax - i)*3;\n i = rmax-1;\n\n }\n cout << res << endl;\n}", "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\nconst double PI = 3.14159265358979323846;\nconst double EPS = 1e-12;\nconst int INF = numeric_limits<int>::max() / 2;\nconst int NEG_INF = numeric_limits<int>::min() / 2;\nconst int MOD = 1e9 + 7;\n\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint n, m;\n\tcin >> n >> m;\n\tvector<int> imos(n + 10, 0);\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\tif (c < d)\n\t\t{\n\t\t\timos[c]++;\n\t\t\timos[d]--;\n\t\t}\n\t}\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\timos[i + 1] += imos[i];\n\t}\n\tint res = n + 1;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif (imos[i])\n\t\t\tres += 2;\n\t}\n\tcout << res << endl;\n}\n\n", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <utility>\nusing namespace std;\n\nint main() {\n int N, M; cin >> N >> M;\n vector<pair<int,int>> V(M);\n for(int i = 0; i < M; ++i) {\n cin >> V[i].first >> V[i].second;\n }\n sort(V.begin(), V.end());\n int ans = N - 1 + 2;\n int index = 0;\n while(index < M) {\n // cerr << V[index].first << \" -> \";\n int l = V[index].first;\n int r = V[index].second;\n while(index + 1 < M && V[index + 1].first <= r) {\n index++;\n r = max(r, V[index].second);\n }\n ans += (r - l) * 2;\n // cerr << r << endl;\n index++;\n }\n cout << ans << endl;\n}", "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tInterval[] p = new Interval[m];\n\t\tfor(int i=0;i<m;i++) {\n\t\t\tp[i] = new Interval(sc.nextInt(),sc.nextInt());\n\t\t}\n\t\tUnionFind uf = new UnionFind(m);\n\t\tfor(int i=0;i<m;i++) {\n\t\t\tfor(int j=i+1;j<m;j++) {\n\t\t\t\tif (p[i].intersects(p[j])) {\n\t\t\t\t\tuf.union(i, j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tArrayList<ArrayList<Integer>> groups = uf.groups();\n\t\tint length = n + 1;\n\t\tfor(ArrayList<Integer> l:groups) {\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tint max = Integer.MIN_VALUE;\n\t\t\tfor(int i:l) {\n\t\t\t\tInterval in = p[i];\n\t\t\t\tmin = Math.min(min, in.a);\n\t\t\t\tmax = Math.max(max, in.b);\n\t\t\t}\n\t\t\tlength += (max - min) * 2;\n\t\t}\n\t\tSystem.out.println(length);\n\t}\n\n}\n//[a,b]\nclass Interval {\n\tint a,b;\n\tpublic Interval(int a,int b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\tpublic boolean intersects(Interval i) {\n\t\treturn intersects(this, i);\n\t}\n\tpublic static boolean intersects(Interval i,Interval j) {\n\t\tInterval temp;\n\t\tif (i.a > j.a) {\n\t\t\ttemp = i;\n\t\t\ti = j;\n\t\t\tj = temp;\n\t\t}\n\t\tif (i.b < j.a) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic Interval merge(Interval i) {\n\t\treturn merge(this, i);\n\t}\n\tpublic static Interval merge(Interval i,Interval j) {\n\t\tif (!intersects(i, j)) {\n\t\t\treturn null;\n\t\t}\n\t\treturn new Interval(Math.min(i.a,j.a), Math.max(i.b,j.b));\n\t}\n\tpublic String toString() {\n\t\treturn \"[\" + a + \",\" + b + \"]\";\n\t}\n}\nclass UnionFind {\n\tint[] root;\n\tInterval[] data;\n\tint n;\n\n\tpublic UnionFind(int size) {\n\t\tn = size;\n\t\troot = new int[size];\n\t\tArrays.fill(root, -1);\n\t}\n\tpublic void union(int x,int y) {\n\t\tx = root(x);\n\t\ty = root(y);\n\t\tif (x!=y) {\n\t\t\tif (root[y] < root[x]) {\n\t\t\t\tint tmp = y;\n\t\t\t\ty = x;\n\t\t\t\tx = tmp;\n\t\t\t}\n\t\t\troot[x] += root[y];\n\t\t\troot[y] = x;\n\t\t}\n\t}\n\tpublic boolean isConnected(int x,int y) {\n\t\treturn root(x)==root(y);\n\t}\n\tprivate int root(int x) {\n\t\treturn root[x] < 0 ? x : (root[x] = root(root[x]));\n\t}\n\tpublic int size(int x) {\n\t\treturn -root[root(x)];\n\t}\n\tpublic ArrayList<ArrayList<Integer>> groups() {\n\t\tArrayList<ArrayList<Integer>> g = new ArrayList<ArrayList<Integer>>();\n\t\tHashMap<Integer,Integer> hm = new HashMap<Integer, Integer>();\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tint r = root(i);\n\t\t\tif (!hm.containsKey(r)) {\n\t\t\t\thm.put(r, g.size());\n\t\t\t\tg.add(new ArrayList<Integer>());\n\n\t\t\t}\n\t\t\tg.get(hm.get(r)).add(i);\n\t\t}\n\t\treturn g;\n\t}\n\tpublic String toString() {\n\t\treturn Arrays.toString(root);\n\t}\n}", "#include<iostream>\nusing namespace std;\n\nint n, q, a, b;\nint x[100000], sum;\n\nint main() {\n\tcin >> n >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tcin >> a >> b;\n\t\tfor (int j = a; j < b; j++) {\n\t\t\tx[j] = 1;\n\t\t}\n\t}\n\tfor (int i = 0; i < n; i++) {\n\t\tsum += 1 + x[i] * 2;\n\t}\n\tcout << sum + 1 << endl;\n\treturn 0;\n}", "#include <algorithm>\n#include <iostream>\n#include <cstring>\n#include <cstdlib>\n#include <utility>\n#include <cstdio>\n#define C first\n#define D second\n#define MAXN 1100\nusing namespace std;\ntypedef pair<int,int> pii;\npii res[MAXN];\nint add[MAXN];\nbool cmp (const pii &a,const pii &b) { return a.C<b.C; }\nint main(void) {\n int n, m, c,d ;\n while ( scanf(\"%d%d\",&n,&m)==2 ) {\n for (int i=0;i<m;++i) {\n scanf (\"%d%d\",&c,&d);\n res[i] = make_pair(c,d);\n }\n sort (res,res+m,cmp); \n memset (add,0,sizeof(add));\n for (int i=0;i<m;++i) {\n add[res[i].C]++;\n add[res[i].D]--;\n } \n int ans = 0, tmp = 0;\n for (int i=0;i<=n;++i) {\n tmp += add[i];\n ans += (tmp > 0);\n }\n printf (\"%d\\n\",ans*2+n+1);\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define print(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define print(x)\n#endif\n\nconst int inf=1e9;\nconst int64_t inf64=1e18;\nconst double eps=1e-9;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int n,m;\n cin >> n >> m;\n vector<bool> f(n+1);\n rep(i,0,m){\n int c,d;\n cin >> c >> d;\n rep(j,c,d) f[j]=true;\n }\n int ans=n+1;\n rep(i,0,n+1) if(f[i]) ans+=2;\n cout << ans << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, m;\nint a[1000];\n\nint main()\n{\n\tscanf(\"%d %d\", &n, &m);\n\tfor (int i = 0; i < m; i++){\n\t\tint c, d;\n\t\tscanf(\"%d %d\", &c, &d);\n\t\t--c, --d;\n\t\tfor (int i = c; i < d; i++){\n\t\t\ta[i] = 1;\n\t\t}\n\t}\n\t\n\tint res = 0;\n\tfor (int i = 0; i < n; i++){\n\t\tif (a[i]) res += 3;\n\t\telse res++;\n\t}\n\t\n\tprintf(\"%d\\n\", ++res);\n\t\n\treturn 0;\n}", "public class Main{\n public void run(java.io.InputStream in, java.io.PrintStream out){\n java.util.Scanner sc = new java.util.Scanner(in);\n int n, m;\n int[] c, d, count;\n int i, j, ans;\n\n n = sc.nextInt(); m = sc.nextInt();\n c = new int[m]; d = new int[m]; count = new int[n];\n\n for(i = 0;i < m;i++){\n c[i] = sc.nextInt(); d[i] = sc.nextInt();\n for(j = c[i];j < d[i];j++)count[j]++;\n }\n\n ans = n + 1;\n for(i = 0;i < n;i++)if(count[i] > 0)ans+=2;\n\n out.println(ans);\n\n sc.close();\n }\n public static void main(String[] args){\n (new Main()).run(System.in, System.out);\n }\n}", "#include <algorithm>\n#include <functional>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <bitset>\n#include <climits>\n\n#define all(c) (c).begin(), (c).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb(e) push_back(e)\n#define mp(a, b) make_pair(a, b)\n#define fr first\n#define sc second\n\nconst int INF=100000000;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\ntypedef pair<int ,int > P;\ntypedef long long ll;\n\nvoid add(vector<P> &segs,int a,int b) {\n if(b<a) swap(a,b);\n bool f=true;\n rep(i,segs.size()) {\n if(!((b<segs[i].fr)||(segs[i].sc<a))) {\n segs[i].fr=min(segs[i].fr,a);\n segs[i].sc=max(segs[i].sc,b);\n f=false;\n }\n }\n if(f) segs.pb(P(a,b));\n}\nint N,m;\n\n\nint main() {\n vector<P> segs,in;\n cin>>N>>m;\n rep(i,m) {\n int c,d;\n cin>>c>>d;\n in.pb(P(c,d));\n }\n sort(all(in));\n ll ans=0;\n rep(i,m) {\n add(segs,in[i].fr,in[i].sc);\n }\n\n rep(i,segs.size()) {\n //printf(\"%d %d\\n\",segs[i].fr,segs[i].sc);\n ans+=(segs[i].sc-segs[i].fr)*2;\n }\n ans+=N+1;\n cout<<ans<<endl;\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <cmath>\n#include <cassert>\nusing namespace std;\ntypedef pair<int, int> P;\n\nconst int INF = 1 << 28;\nint dp[510][1010];\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint N, M;\n\twhile(cin >> N >> M) {\n\t\tvector<P> r(M);\n\t\tfor(int i = 0; i < M; i++) {\n\t\t\tcin >> r[i].second >> r[i].first;\n\t\t}\n\t\tsort(r.begin(), r.end());\n\n\t\tfill((int*)begin(dp), (int*)end(dp), INF);\n\t\tdp[0][N] = 0;\n\t\tfor(int i = 0; i < M; i++) {\n\t\t\tint pos = r[i].first;\n\t\t\tfor(int j = 1; j <= N; j++) {\n\t\t\t\tif(dp[i][j] == INF) continue;\n\t\t\t\tint d = d = (i == 0) ? pos : abs(pos - r[i - 1].first);\n\t\t\t\t// ??????\n\t\t\t\tint ret = abs(pos - min(r[i].second, j));\n\t\t\t\tdp[i + 1][N] = min(dp[i + 1][N], dp[i][j] + d + 2 * ret);\n\t\t\t\t// ????????????\n\t\t\t\tint nj = min(r[i].second, j);\n\t\t\t\tdp[i + 1][nj] = min(dp[i + 1][nj], dp[i][j] + d);\n\t\t\t}\n\t\t}\n\n\t\tint pos = (M == 0) ? 0 : r.back().first;\n\t\tcout << dp[M][N] + (N + 1 - pos) << endl;\n\t}\n}", "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,t[1010];\nint c[1010],d[1010];\nint main()\n{\n\tint m;\n\tcin>>n>>m;\n\tfor(int i=0;i<m;i++)\n\t{\n\t\tint l,r;cin>>l>>r;\n\t\tt[l]++;t[r]--;\n\t}\n\tfor(int i=1;i<=n;i++)t[i]+=t[i-1];\n\tint ans=n+1;\n\tfor(int i=1;i<=n;i++)ans+=!!t[i]*2;\n\tcout<<ans<<endl;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint N, m;\n\nint main() {\n\tcin >> N >> m;\n\t\n\ttypedef pair< int, int > pii;\n\tset< pii > interval;\n\t\n\tfor (int i=0; i<m; ++i) {\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\t\n\t\t// left side\n\t\tauto it = interval.lower_bound(pii(c, 0));\n\t\tif (it != interval.begin()) {\n\t\t\t--it;\n\t\t\tif (c <= (*it).second) {\n\t\t\t\tc = (*it).first;\n\t\t\t\td = max(d, (*it).second);\n\t\t\t\tinterval.erase(it);\n\t\t\t}\n\t\t}\n\t\t\n\t\t// right side\n\t\tit = interval.lower_bound(pii(c, 0));\n\t\tif (it != interval.end()) {\n\t\t\tif (c <= (*it).first && (*it).first <= d) {\n\t\t\t\td = max(d, (*it).second);\n\t\t\t\tinterval.erase(it);\n\t\t\t}\n\t\t}\n\t\t\n\t\tinterval.insert(pii(c, d));\n\t}\n\t\n\tint ans = N+1;\n\tfor (pii p : interval) {\n\t\tint len = p.second - p.first;\n\t\tans += 2 * len;\n\t}\n\tcout << ans << endl;\n}\n", "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <map>\n#include <set>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <bitset>\n#include <algorithm>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\n#define Rep(b, e, i) for(int i = b; i <= e; i++)\n#define Repr(e, b, i) for(int i = e; i >= b; i--)\n#define rep(n, i) Rep(0, n-1, i)\n#define repr(n, i) Repr(n-1, 0, i)\n#define all(v) (v).begin(), (v).end()\n#define pb(x) push_back(x)\n#define uniq(x) (x).erase(unique(all(x)),(x).end())\n\ntypedef long long ll;\ntypedef pair<ll, ll> llP;\ntypedef pair<int, int> intP;\ntypedef std::priority_queue<int> IntPrioQueue; //Z->A\ntypedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z\n\nconst int MAX = 1024;\nconst double PI = 3.14159265358979323846;\nconst double EPS = 1e-12;\nconst int INF = 1<<29;\nconst int MOD = 1000000007;\n\nint step[MAX];\n\nvoid solve(void){\n int N, m;\n cin >> N >> m;\n rep(m, i) {\n int a, b;\n scanf(\"%d %d\\n\", &a, &b);\n a--; b--;\n step[a]++;\n step[b]--;\n }\n rep(N, i) step[i+1] += step[i];\n int dis = 0, ans = 0;\n rep(N+1, n) {\n if (step[n] > 0) dis++;\n else {\n ans += dis;\n dis = 0;\n }\n }\n ans = ans*2+1+N;\n cout << ans << '\\n';\n}\n\nint main(void){\n solve();\n return 0;\n}\n\n", "#!usr/bin/env python3\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5)\nstdin = sys.stdin\nbisect_left = bisect.bisect_left\nbisect_right = bisect.bisect_right\ndef LI(): return list(map(int, stdin.readline().split()))\ndef LF(): return list(map(float, stdin.readline().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))\ndef II(): return int(stdin.readline())\ndef IF(): return float(stdin.readline())\ndef LS(): return list(map(list, stdin.readline().split()))\ndef S(): return list(stdin.readline().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = float('INF')\n\n#A\ndef A():\n s = S()\n m = II()\n ans = [\"I\", \"L\", \"M\", \"U\"]\n nu = 0\n stack = []\n bf = int(s[0])\n for num,si in enumerate(s):\n if si == \"+\":\n bf += int(s[num+1])\n elif si == \"*\":\n bf *= int(s[num + 1])\n if bf == m:\n nu += 1\n stack = []\n bf = 0\n for num, si in enumerate(s):\n if si == \"*\":\n s[num + 1] = int(s[num + 1]) * int(s[num - 1])\n s[num - 1] = 0\n for si in s:\n if si != \"*\" and si != \"+\":\n bf += int(si)\n if bf == m:\n nu += 2\n print(ans[nu]) \n\n return\n\n#B\ndef B():\n n, m = LI()\n cd = LIR(m)\n dp = [0 for i in range(n+1)]\n for c, d in cd:\n dp[c] += 1\n dp[d] -= 1\n for i in range(n):\n dp[i + 1] += dp[i]\n ans = 0\n flg = 0\n for i in range(n):\n \n if dp[i]:\n ans += 3\n\n elif flg:\n flg = 0\n ans += 3\n\n else:\n ans += 1\n \n print(ans+1)\n \n return\n\n#C\ndef C():\n return\n\n#D\ndef D():\n return\n\n#E\ndef E():\n return\n\n#F\ndef F():\n return\n\n#G\ndef G():\n return\n\n#H\ndef H():\n return\n\n#Solve\nif __name__ == '__main__':\n B()\n\n", "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main(void){\n int n, m;\n cin >> n >> m;\n vector<int> s(n+2, 0);\n for (int i = 0; i < m; i++) {\n int a, b;\n cin >> a >> b;\n s[a]++;\n s[b]--;\n }\n for (int i = 0; i < n+2; i++) s[i+1] += s[i];\n \n int l = 0, ans = 0;\n for (int i = 0; i < n+2; i++) {\n if (l == 0 && s[i]) l = i;\n if (l > 0 && !s[i]) {\n ans += (i-l)*2;\n l = 0;\n }\n }\n cout << ans+n+1 << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\ntypedef pair<int,int> P;\n\nint main() {\n int n,m;\n cin >> n >> m;\n map<int,int> ma;\n for(int i=0; i<m; i++) {\n int x,y;\n cin >> x >> y;\n if(ma.count(y)) ma[y]=min(ma[y],x);\n else ma[y]=x;\n }\n ma[0]=0;\n vector<P> a;\n for(map<int,int>::iterator it=ma.begin(); it!=ma.end(); it++) {\n a.push_back(P(it->F,it->S));\n }\n m=a.size();\n sort(a.begin(),a.end());\n int d[m+1];\n fill(d,d+m+1,100000);\n d[0]=0;\n for(int i=1; i<m; i++) {\n int M=a[i].S;\n for(int j=i-1; j>=0; j--) {\n d[i]=min(d[i],d[j]+(a[i].F-a[j].F)+(a[i].F-M)*2);\n M=min(M,a[j].S);\n }\n }\n int ans=n-a[m-1].F+d[m-1]+1;\n cout << ans << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define mp make_pair\n#define pb push_back\n#define F first\n#define S second\n#define endl '\\n'\n#define ALL(a) (a).begin(),(a).end()\n#define SZ(a) (int)((a).size())\ntypedef long long ll;\ntypedef pair<int,int> PI;\n\nint main(int argc, char *argv[])\n{\n int n,m;\n cin >> n >> m;\n vector<PI> in;\n rep(i,m){\n int c,d;\n cin >> c >> d;\n in.pb(mp(c,d));\n }\n sort(ALL(in));\n\n int ans = 0;\n int cur = 0;\n \n for(int i = 0; i < m; i){\n int la = in[i].S;\n int fi = in[i].F;\n \n while(i < m && in[i].F <= la){\n la = max(la,in[i].S);\n ++i;\n }\n \n ans += la - cur;\n ans += la - fi;\n cur = fi;\n }\n ans += n-cur+1;\n \n cout << ans << endl;\n}", "#include <algorithm>\n#include <cmath>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#include <cassert>\n#include <functional>\n\nusing namespace std;\n\n#define LOG(...) printf(__VA_ARGS__)\n//#define LOG(...)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n#define RSORT(c) sort((c).rbegin(),(c).rend())\n#define CLR(a) memset((a), 0 ,sizeof(a))\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\nconst int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };\n\nint main() {\n\tint n, m;\n\tcin >> n >> m;\n\tvector<pair<int, int>> vpii(m);\n\tREP(i, m){\n\t\tcin >> vpii[i].first >> vpii[i].second;\n\t}\n\tint ans = n+1;\n\tint count = 0;\n\tint beg=0;\n\tFOR(i, 1, n + 1){\n\t\tREP(j, m){\n\t\t\tif (vpii[j].first == i){\n\t\t\t\tcount++;\n\t\t\tif (count == 1)\n\t\t\t\tbeg = i;\n\t\t\t\t}\n\t\t\tif (vpii[j].second == i){\n\t\t\t\tcount--;\n\t\t\tif (count == 0)\n\t\t\t\tans += (i - beg) * 2;\n\t\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\ntypedef pair<int,int> ii;\n\nint N,m,par[1010];\n\nint find(int x) { \n if( x == par[x] ) return x;\n return par[x] = find(par[x]);\n}\n\nvoid unit(int x,int y) {\n x = find(x), y = find(y);\n if( x != y ) par[x] = y;\n}\n\nint main(){\n cin >> N >> m;\n int cost = N+1,c,d;\n rep(i,N+2) par[i] = i;\n rep(i,m){\n cin >> c >> d;\n REP(j,c,d) unit(j,j+1);\n }\n map<int,int> group;\n REP(i,1,N+1) ++group[find(i)];\n for(map<int,int>::iterator it = group.begin(); it != group.end(); it++ ){\n if( it->second <= 1 ) continue;\n cost += ( it->second - 1 ) * 2;\n }\n cout << cost << endl;\n return 0;\n}\n/********\n * 1000 *\n ********/\n/*********************\n * go on to the next *\n *********************/\n/**************\n * thank you! *\n **************/\n/**************\n * help me... *\n **************/", "#include <iostream>\n#include <vector>\n#include <cstring>\n\nusing namespace std;\n\nvoid solve()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tbool needToMoveThreeTimes[1001];\n\tmemset(needToMoveThreeTimes, 0, sizeof(needToMoveThreeTimes));\n\tint N, m;\n\tcin >> N >> m;\n\tfor (int i = 0; i < m; ++i)\n\t{\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\tfor (int j = c; j < d; ++j)\n\t\t{\n\t\t\tneedToMoveThreeTimes[j] = true;\n\t\t}\n\t}\n\tint ans = 0;\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tif (needToMoveThreeTimes[i])\n\t\t{\n\t\t\tans += 2;\n\t\t}\n\t}\n\tcout << ans + N + 1 << endl;\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, m; cin >> N >> m;\n vector<int> F(N+1, 1);\n for(int i = 0; i < m; ++i) {\n int c, d; cin >> c >> d;\n for(int j = c; j < d; ++j) F[j] = 3;\n }\n cout << accumulate(F.begin(), F.end(), 0) << endl;\n return 0;\n}", "// ACM-ICPCアジア地区予選2014 C. Shopping\n\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main(){\n\tint N, m;\n\twhile(cin >> N >> m){\n\t\tvector< pair<int,int> > p(m);\n\t\tfor(int i=0;i<m;i++) cin >> p[i].first >> p[i].second;\n\t\tsort(p.begin(), p.end());\n\t\tint idx = 0;\n\t\tint res = N+1;\n\t\twhile(idx < m){\n\t\t\tint b = p[idx].first, e = p[idx].second;\n\t\t\twhile(idx < m && p[idx].first < e){\n\t\t\t\te = max(e, p[idx].second);\n\t\t\t\t++idx;\n\t\t\t}\n\t\t\tres += 2*(e-b);\n\t\t}\n\t\tcout << res << endl;\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\nint n,m,a,b,ans=1;\nint c[1001];\n\nint main(){\n scanf(\"%d %d\",&n,&m);\n for(int i=0;i<m;i++){\n scanf(\"%d %d\",&a,&b);\n c[a]++;\n c[b]--;\n }\n for(int i=1;i<=n;i++){\n c[i]+=c[i-1];\n ans+=(c[i]?3:1);\n }\n printf(\"%d\\n\",ans);\n return 0;\n}", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#define f first\n#define s second\n#define inf 1000000001\nusing namespace std;\n\nint main()\n{\n int N,m,c,d;\n vector<pair<int,int> > V;\n cin>>N>>m;\n for(int i=0;i<m;i++){\n cin>>c>>d;\n V.push_back(make_pair(c,d));\n }\n\n sort(V.begin(),V.end());\n \n V.push_back(make_pair(inf,inf));\n for(int i=0;i<V.size()-1;i++){\n if(V[i+1].f<=V[i].s && V[i].s<=V[i+1].s){\n V[i].s=V[i+1].s;\n V.erase(V.begin()+i+1);\n i--;\n }\n if(V[i].f<=V[i+1].f && V[i+1].s <=V[i].s){\n V.erase(V.begin()+i+1);\n i--;\n }\n }\n /*\n cout<<endl;\n for(int i=0;i<V.size();i++)cout<<V[i].f<<\" \"<<V[i].s<<\" \"<<i<<endl;\n */\n int ans=N+1;\n for(int i=0;i<V.size();i++){\n ans+=2*(V[i].s-V[i].f);\n }\n cout<<ans<<endl;\n\n return 0;\n}", "#include <algorithm>\n#include <iostream>\n#include <vector>\n#define push push_back\n#define sz size()\n#define s second\n#define f first\nusing namespace std;\ntypedef pair<int,int> P;\n\nint main(){\n int N,m,c,d,ans=0;\n vector<int> v2;\n vector<P> v;\n cin>>N>>m;\n for(int i=0;i<m;i++) cin>>c>>d,v.push(make_pair(c,d));\n sort(v.begin(),v.end());\n if(v.sz!=0)\n for(int i=0;i<v.sz-1;i++)\n if(v[i+1].f<=v[i].s){\n\tv[i].s=max(v[i].s,v[i+1].s);\n\tv.erase(v.begin()+i+1);\n\ti--;\n }\n for(int i=0;i<v.sz;i++) v2.push(v[i].s-v[i].f+1),ans+=v2[i];\n ans=N+1-ans;\n for(int i=0;i<v2.sz;i++) ans+=v2[i]*3-2;\n cout<<ans<<endl;\n return 0;\n}", "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tMyScanner sc = new MyScanner();\n\tScanner sc2 = new Scanner(System.in);\n\tlong start = System.currentTimeMillis();\n\tlong fin = System.currentTimeMillis();\n\tfinal int MOD = 1000000007;\n\tint[] dx = { 1, 0, 0, -1 };\n\tint[] dy = { 0, 1, -1, 0 };\n\n\tvoid run() {\n\t\tint N = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint[] c = new int[N + 1];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tc[sc.nextInt()]++;\n\t\t\tc[sc.nextInt()]--;\n\t\t}\n\t\tint pos = 0;\n\t\tint cnt = 0;\n\t\tint lost = 0;\n\t\tint left = 0;\n\t\twhile (++pos != N + 1) {\n\t\t\tcnt++;\n\t\t\tif (c[pos] > 0) {\n\t\t\t\tlost += c[pos];\n\t\t\t\tif (left == 0) left = pos;\n\t\t\t} else if (c[pos] < 0) {\n\t\t\t\tlost += c[pos];\n\t\t\t\tif (lost == 0) {\n\t\t\t\t\tcnt += (pos - left) * 2;\n\t\t\t\t\tleft = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(++cnt);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tvoid debug2(char[][] array) {\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\tfor (int j = 0; j < array[i].length; j++) {\n\t\t\t\tSystem.out.print(array[i][j]);\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}\n\n\tboolean inner(int h, int w, int limH, int limW) {\n\t\treturn 0 <= h && h < limH && 0 <= w && w < limW;\n\t}\n\n\tvoid swap(int[] x, int a, int b) {\n\t\tint tmp = x[a];\n\t\tx[a] = x[b];\n\t\tx[b] = tmp;\n\t}\n\n\t// find minimum i (k <= a[i])\n\tint lower_bound(int a[], int k) {\n\t\tint l = -1;\n\t\tint r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint mid = (l + r) / 2;\n\t\t\tif (k <= a[mid])\n\t\t\t\tr = mid;\n\t\t\telse\n\t\t\t\tl = mid;\n\t\t}\n\t\t// r = l + 1\n\t\treturn r;\n\t}\n\n\t// find minimum i (k < a[i])\n\tint upper_bound(int a[], int k) {\n\t\tint l = -1;\n\t\tint r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint mid = (l + r) / 2;\n\t\t\tif (k < a[mid])\n\t\t\t\tr = mid;\n\t\t\telse\n\t\t\t\tl = mid;\n\t\t}\n\t\t// r = l + 1\n\t\treturn r;\n\t}\n\n\tlong gcd(long a, long b) {\n\t\treturn a % b == 0 ? b : gcd(b, a % b);\n\t}\n\n\tlong lcm(long a, long b) {\n\t\treturn a * b / gcd(a, b);\n\t}\n\n\tboolean palindrome(String s) {\n\t\tfor (int i = 0; i < s.length() / 2; i++) {\n\t\t\tif (s.charAt(i) != s.charAt(s.length() - 1 - i)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tclass MyScanner {\n\t\tint nextInt() {\n\t\t\ttry {\n\t\t\t\tint c = System.in.read();\n\t\t\t\twhile (c != '-' && (c < '0' || '9' < c))\n\t\t\t\t\tc = System.in.read();\n\t\t\t\tif (c == '-')\n\t\t\t\t\treturn -nextInt();\n\t\t\t\tint res = 0;\n\t\t\t\tdo {\n\t\t\t\t\tres *= 10;\n\t\t\t\t\tres += c - '0';\n\t\t\t\t\tc = System.in.read();\n\t\t\t\t} while ('0' <= c && c <= '9');\n\t\t\t\treturn res;\n\t\t\t} catch (Exception e) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tString next() {\n\t\t\ttry {\n\t\t\t\tStringBuilder res = new StringBuilder(\"\");\n\t\t\t\tint c = System.in.read();\n\t\t\t\twhile (Character.isWhitespace(c))\n\t\t\t\t\tc = System.in.read();\n\t\t\t\tdo {\n\t\t\t\t\tres.append((char) c);\n\t\t\t\t} while (!Character.isWhitespace(c = System.in.read()));\n\t\t\t\treturn res.toString();\n\t\t\t} catch (Exception e) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] in = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tin[i] = nextInt();\n\t\t\t}\n\t\t\treturn in;\n\t\t}\n\n\t\tint[][] nextInt2dArray(int n, int m) {\n\t\t\tint[][] in = new int[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tin[i] = nextIntArray(m);\n\t\t\t}\n\t\t\treturn in;\n\t\t}\n\n\t\tdouble[] nextDoubleArray(int n) {\n\t\t\tdouble[] in = new double[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tin[i] = nextDouble();\n\t\t\t}\n\t\t\treturn in;\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] in = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tin[i] = nextLong();\n\t\t\t}\n\t\t\treturn in;\n\t\t}\n\n\t\tchar[][] nextCharField(int n, int m) {\n\t\t\tchar[][] in = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tString s = sc.next();\n\t\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\t\tin[i][j] = s.charAt(j);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn in;\n\t\t}\n\t}\n}", "// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\n#define fprintf(...) void(0)\nint imos[1010];\n \nsigned main() {\n int N, M; cin >> N >> M;\n for(int i=0; i<M; i++) {\n int l, r; cin >> l >> r;\n imos[l]++;\n imos[r]--;\n }\n\n for(int i=0; i<N+3; i++) {\n imos[i+1] += imos[i];\n }\n\n int ans = N+1, last = -1;\n for(int i=0; i<N+3; i++) {\n if(imos[i+1] > 0 && imos[i] == 0) {\n last = i+1;\n }\n if(imos[i+1] == 0 && imos[i] > 0) {\n ans += (i+1 - last) * 2;\n fprintf(stderr, \"add: [%lld, %lld)\\n\", last, i+1);\n }\n }\n cout << ans << endl;\n return 0;\n}\n", "#include<iostream>\n#include<vector>\n#include<utility>\n#include<algorithm>\nusing namespace std;\nint main(int argc, char *argv[])\n{\n int n, m;\n cin >> n >> m;\n vector<pair<int,int>> cds;\n for(int i = 0; i < m; i++) {\n int c, d;\n cin >> c >> d;\n cds.push_back(make_pair(c,d)); // visits c after d (> c)\n }\n sort(cds.begin(), cds.end());\n // overlap -> rewind at onece\n int len = n + 1;\n int c = -1, d = -1;\n for(int i = 0; i < m; i++) {\n if(d < cds[i].first) { // do the previous overlap\n len += 2 * (d - c);\n c = cds[i].first;\n d = cds[i].second;\n } else { // overlapping\n d = max(d, cds[i].second);\n }\n }\n len += 2 * (d - c);\n cout << len << endl;\n return 0;\n}\n\n", "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint n, m; cin >> n >> m;\n\tvector<int> imos(n + 10,0);\n\tfor (int i = 0; i < m; i++) {\n\t\tint c, d; cin >> c >> d;\n\t\tif (c < d) {\n\t\t\timos[c]++;\n\t\t\timos[d]--;\n\t\t}\n\t}\n\tfor (int i = 0; i < n; i++) {\n\t\timos[i + 1] += imos[i];\n\t}\n\tint res = n + 1;\n\tfor (int i = 0; i < n; i++) {\n\t\tif (imos[i]) res += 2;\n\t}\n\tcout << res << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint N, m;\n\tcin >> N >> m;\n\tvector<int> st(N + 2);\n\tfor (int i = 0, c, d; i < m; i++) {\n\t\tcin >> c >> d;\n\t\tst[c]++;\n\t\tst[d]--;\n\t}\n\tint res = N + 1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tst[i] += st[i - 1];\n\t\tif (st[i]) {\n\t\t\tres += 2;\n\t\t}\n\t}\n\tcout << res << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\n#define ALL(a) (a).begin(), (a).end()\n#define llong long long\n\nusing namespace std;\n\nsigned main(){\n\tint n,m; cin >> n >> m;\n\tvector<pair<int, int> > b(m);\n\tfor(int i = 0; i < m; i++)cin >> b[i].first >> b[i].second;\n\tsort(ALL(b));\n\t\n\tvector<int> a(n+1,0);\n\tfor(auto e : b){\n\t\ta[e.first] += 1;\n\t\ta[e.second] += -1;\n\t}\n\tfor(int i = 1; i < n+1; i++){\n\t\ta[i] += a[i-1];\n\t}\n//\tfor(auto e : a)cerr << e << \" \";\n//\tcerr << endl;\n\t\n\tbool flag = false;\n\tint cnt = 0;\n\tint ans = n+1;\n\tfor(auto e : a){\n\t\tif(flag && !e){\n\t\t\tflag = false;\n\t\t\tans += 2*cnt;\n\t\t\tcnt = 0;\n//\t\t\tcerr << cnt << endl;\n\t\t}\n\t\telse if(e){\n\t\t\tcnt++;\n\t\t\tif(!flag)flag = true;\n\t\t}\n\t}\n\tcout << ans << endl;\n\n\treturn 0;\n}\n\n\n", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nusing lint = long long;\nusing ldouble = long double;\n\nint main() {\n int n, m;\n cin >> n >> m;\n\n vector<pair<int, int>> ps(m);\n for (auto& p : ps) cin >> p.first >> p.second;\n ps.emplace_back(n + 1, n + 1);\n sort(ps.begin(), ps.end());\n\n int ans = n + 1;\n int l = 0, r = 0;\n for (auto p : ps) {\n if (r <= p.first) {\n ans += (r - l) * 2;\n l = r = p.first;\n }\n r = max(r, p.second);\n }\n\n cout << ans << endl;\n return 0;\n}\n\n", "import java.util.BitSet;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\t\tint N = sc.nextInt();\n\t\tint M = sc.nextInt();\n\t\tBitSet bs = new BitSet(N + 1);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tint C = sc.nextInt();\n\t\t\tint D = sc.nextInt();\n\t\t\tbs.set(C, D);\n\t\t}\n\t\tSystem.out.println(N + 1 + bs.cardinality() * 2);\n\t}\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(long long i=0; i<(n); i++)\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\n\n\nint main(){\n ll n,m; cin>>n>>m;\n vector<ll> istwice(n+2, 0);\n rep(i,m){\n ll c,d; cin>>c>>d;\n istwice[c]++;\n istwice[d]--;\n }\n rep(i, n+1) istwice[i+1]+=istwice[i];\n ll res=n+1;\n rep(i, n+2){\n if(istwice[i]>0) res+=2;\n }\n cout<<res<<endl;\n return 0;\n}\n", "#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n\nusing namespace std;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\n//constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-12;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tcin >> N >> M;\n\tvector<int>v(N + 1);\n\twhile (M--) {\n\t\tcin >> L >> R;\n\t\tv[L]++;\n\t\tv[R]--;\n\t}\n\tfor (int i = 1; i <= N; i++) {\n\t\tv[i] += v[i - 1];\n\t}\n\tint ans = N + 1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (v[i])ans += 2;\n\t}\n\tcout << ans << endl;\n}\n", "#define _USE_MATH_DEFINES\n\n#define rep(i, n) for(int i = 0; i < n; i++)\n#define repx(i, a, n) for(int i = a; i < n; i++)\n#define loop while(1)\n#define lli long long int\n \n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <numeric>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <list>\n#include <map>\n#include <utility>\n#include <set>\n\nusing namespace std;\n\nint main() {\n\n int n, m;\n cin >> n >> m;\n\n vector<int> cnt(n + 1, 0);\n int l, r;\n rep (i, m) {\n cin >> l >> r;\n repx(j, l, r) cnt[j] += 1;\n }\n \n int ans = 0;\n rep (i, n + 1) {\n if (cnt[i] > 0) ans += 3;\n else ans += 1;\n }\n cout << ans << endl;\n\n return 0;\n}\n\n", "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tint L,n;\n\tcin>>L>>n;\n\tvi in(L);\n\trep(i,n){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\tin[a-1]++;\n\t\tin[b-1]--;\n\t}\n\trep(i,L-1)in[i+1]+=in[i];\n\tint out=L+1;\n\trep(i,L)if(in[i])out+=2;\n\tcout<<out<<endl;\n}", "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n int n, m;\n std::cin >> n >> m;\n vector<bool> visit(n + 1, false);\n for (int i = 0; i < m; i++) {\n int l, r;\n std::cin >> l >> r;\n for (int j = l; j < r; j++) {\n visit[j] = true;\n }\n }\n int ans = n + 1;\n for (int i = 0; i < visit.size(); i++) {\n ans += 2*visit[i];\n }\n std::cout << ans << std::endl;\n return 0;\n}\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int N, m;\n \n scanf(\"%d %d\", &N, &m);\n \n int s[1024] = {0};\n \n for (int i = 0; i < m; i++){\n int a, b;\n scanf(\"%d %d\", &a, &b);\n s[a]++;\n s[b]--;\n }\n \n int ans = 0;\n for (int i = 0; i <= N;){\n if (s[i] == 0){\n ans++;\n i++;\n }\n else {\n int rui = 0;\n int tmp = 0;\n while (rui + s[i] != 0){\n rui += s[i];\n tmp++;\n i++;\n }\n i++;\n ans += 3 * tmp + 1;\n }\n }\n \n printf(\"%d\\n\", ans);\n \n return (0);\n}", "#include<bits/stdc++.h>\n#include<string>\nusing namespace std;\n#define lp(i,n) for(int i=0;i<n;i++)\n#define lps(i,j,n) for(int i=j;i<n;i++)\n#define fordebug int hoge;cin>>hoge;\n#define DEKAI 1000000007;\n#define INF (1<<28)\n#define int long long\n#define double long double\n#define floot10 cout<<fixed<<setprecision(10)\n#define G 1\nint l[2000];\n\nsigned main(){\n int n,m;\n cin>>n>>m;\n lp(i,m){\n int a,b;\n cin>>a>>b;\n l[b]--;\n l[a]++;\n }\n int ans=0;\n lp(i,n+1){\n if(i!=0) l[i]+=l[i-1];\n ans++;\n if(l[i]!=0) ans+=2;\n }\n cout<<ans<<endl;\n return 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef pair<int,int>pint;\ntypedef vector<int>vint;\ntypedef vector<pint>vpint;\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\n\nint N,M;\nint lef[1111];\nint dp[1111];\n\nsigned main(){\n cin>>N>>M;\n N++;\n fill_n(lef,1111,1<<30);\n rep(i,M){\n int c,d;\n cin>>c>>d;\n c--;d--;\n chmin(lef[d],c);\n }\n\n fill_n(dp,1111,1<<30);\n dp[0]=0;\n reps(i,1,N+1){\n int most_lef=i;\n for(int j=i-1;j>=0;j--){\n chmin(most_lef,lef[j+1]);\n chmin(dp[i],dp[j]+(i-j)+(i-most_lef)*2);\n }\n }\n\n cout<<dp[N]<<endl;\n\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define pb push_back \n#define pf push_front \n#define mp make_pair\n#define fr first\n#define sc second\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\n#define All(v) v.begin(), v.end()\n\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\nconst int INF = 1107110711071107;\n\nint N, m;\nvector<Pii> d;\nunordered_map<int, int> dp[1001][1001];\n\nint dfs(int pre, int now, int n) {\n if ( n == m ) {\n return (now-pre + (N+1)-pre);\n }\n if ( dp[pre][now][n] > 0 ) return dp[pre][now][n];\n\n int ret = dfs(min(pre, d[n].sc), d[n].fr, n+1) + (d[n].fr-now);\n ret = min(ret, dfs(d[n].sc, d[n].fr, n+1) + (now-pre + d[n].fr-pre));\n\n return dp[pre][now][n] = ret;\n}\n\nsigned main() {\n cin >> N >> m;\n\n Rep(i, m) {\n int c, b;\n cin >> c >> b;\n d.pb(Pii(b, c)); \n }\n\n sort(All(d));\n\n if ( m == 0 ) cout << N+1 << endl;\n else cout << dfs(d[0].sc, d[0].fr, 1) + d[0].fr << endl;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\n\nint main(void) {\n cin.tie(0); ios::sync_with_stdio(false);\n int N,m; cin >> N >> m;\n vector<int> c(m),d(m);\n\n vector<int> flag(N+1);\n for(int i = 0; i < m;i++){\n cin >> c[i] >> d[i];\n \n for(int j = c[i]; j < d[i];j++){\n flag[j] = true;\n }\n }\n int cnt = accumulate(flag.begin(),flag.end(),0);\n \n ll ans = cnt*3 + (N+1-cnt);\n cout << ans << endl;\n return 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\n int N,m;\n cin >> N >> m;\n vector<int> is(N+1,1);\n\n for(int i=0; i<m; i++){ // 500\n int c,d;\n cin >> c >> d;\n if(c < d)\n for(int j=c; j<d; j++){ // 1000\n\tis[j] = 3;\n }\n }\n int ans = 0;\n for(int i=0; i<=N; i++){\n ans += is[i];\n }\n cout << ans << endl;\n\n}", "import java.io.*;\nimport java.util.*;\n \npublic class Main{\n\t\n\tint N;\n\tint M;\n\tpublic void solve(){\n\t\tN = nextInt();\n\t\tM = nextInt();\n\t\tint[] memo = new int[N + 1];\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tmemo[nextInt()]++;\n\t\t\tmemo[nextInt()]--;\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tint cnt = 0;\n\t\tfor(int i = 0; i <= N; i++){\n\t\t\tcnt += memo[i];\n\t\t\tans++;\n\t\t\tif(cnt > 0) ans+=2;\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tprivate static PrintWriter out;\n\tpublic static void main(String[] args){\n\t\tout = new PrintWriter(System.out);\n\t\tnew Main().solve();\n\t\tout.flush();\n\t}\n\t\n\t\n\t\n\tpublic static int nextInt(){\n\t\tint num = 0;\n\t\tString str = next();\n\t\tboolean minus = false;\n\t\tint i = 0;\n\t\tif(str.charAt(0) == '-'){\n\t\t\tminus = true;\n\t\t\ti++;\n\t\t}\n\t\tint len = str.length();\n\t\tfor(;i < len; i++){\n\t\t\tchar c = str.charAt(i);\n\t\t\tif(!('0' <= c && c <= '9')) throw new RuntimeException();\n\t\t\tnum = num * 10 + (c - '0');\n\t\t}\n\t\treturn minus ? -num : num;\n\t}\n\t\n\tpublic static long nextLong(){\n\t\tlong num = 0;\n\t\tString str = next();\n\t\tboolean minus = false;\n\t\tint i = 0;\n\t\tif(str.charAt(0) == '-'){\n\t\t\tminus = true;\n\t\t\ti++;\n\t\t}\n\t\tint len = str.length();\n\t\tfor(;i < len; i++){\n\t\t\tchar c = str.charAt(i);\n\t\t\tif(!('0' <= c && c <= '9')) throw new RuntimeException();\n\t\t\tnum = num * 10l + (c - '0');\n\t\t}\n\t\treturn minus ? -num : num;\n\t}\n\tpublic static String next(){\n\t\tint c;\n\t\twhile(!isAlNum(c = read())){}\n\t\tStringBuilder build = new StringBuilder();\n\t\tbuild.append((char)c);\n\t\twhile(isAlNum(c = read())){\n\t\t\tbuild.append((char)c);\n\t\t}\n\t\treturn build.toString();\n\t}\n\t\n\t\n\tprivate static byte[] inputBuffer = new byte[1024];\n\tprivate static int bufferLength = 0;\n\tprivate static int bufferIndex = 0;\n\tprivate static int read(){\n\t\tif(bufferLength < 0) throw new RuntimeException();\n\t\tif(bufferIndex >= bufferLength){\n\t\t\ttry{\n\t\t\t\tbufferLength = System.in.read(inputBuffer);\n\t\t\t\tbufferIndex = 0;\n\t\t\t}catch(IOException e){\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t\tif(bufferLength <= 0) return (bufferLength = -1);\n\t\t}\n\t\treturn inputBuffer[bufferIndex++];\n\t}\n\t\n\tprivate static boolean isAlNum(int c){\n\t\treturn '!' <= c && c <= '~';\n\t}\n}", "#include <iostream>\n#include <stdio.h>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <numeric>\n#include <string>\n#include <string.h>\n#include <map>\n#include <set>\n#include <functional>\n#include <complex>\n#include <stack>\n#include <tuple>\n#include <array>\nusing namespace std;\n\n#define FOR(i,a,b) for (int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define RREP(i,n) for (int i=(n)-1;i>=0;i--)\n#define ALL(u) begin(u),end(u)\n#define PB push_back\n#define LE(n,m) ((n) < (m) + EPS)\n#define GE(n,m) ((n) + EPS > (m))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\ntypedef long long int ll;\nconst int INF = (1<<30) - 1;\nconst double EPS = 1e-9;\nconst int MOD = 1000000007;\n\nint N, M;\n\n//g++ -std=c++0x -msse4.2 -O3\n//#include <bits/stdc++.h>\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n //cout.precision(16);\n //cout.setf(ios::fixed);\n \n cin >> N >> M;\n vector<pair<int, int>> v;\n REP(i, M){\n int c, d; cin >> c >> d;\n v.PB(make_pair(c, d));\n }\n sort(v.begin(), v.end());\n \n int ans = N + 1;\n int i = 0;\n while(i<M){\n int s = i;\n int m = v[i].second;\n while(i+1<M && v[i+1].first <= m){\n i++;\n m = max(m, v[i].second);\n }\n ans += (m - v[s].first) * 2;\n i++;\n }\n cout << ans << endl;\n \n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nnamespace {\n\n template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {\n if (vs.empty()) return os << \"[]\";\n os << \"[\" << vs[0];\n for (int i = 1; i < vs.size(); i++) os << \" \" << vs[i];\n return os << \"]\";\n }\n\n int N, M;\n vector< pair<int, int> > P;\n void input() {\n cin >> N >> M;\n P.resize(M);\n for (int i = 0; i < M; i++) {\n cin >> P[i].first >> P[i].second;\n }\n }\n\n void solve() {\n if (M == 0) {\n cout << N + 1 << endl;\n return;\n }\n sort(P.begin(), P.end());\n int ans = N + 1;\n int l = P[0].first, r = P[0].second;\n int k = 1;\n while (true) {\n int a = P[k].first, b = P[k].second;\n if (l <= b && a <= r) {\n l = min(l, a);\n r = max(r, b);\n k++;\n } else {\n ans += 2 * (r - l);\n l = a; \n r = b;\n k++;\n }\n if (k == M) {\n ans += 2 * (r - l);\n break;\n }\n }\n cout << ans << endl;\n }\n}\n\nint main() {\n input(); solve();\n return 0;\n}", "#include <algorithm>\n#include <cstdio>\n#include <functional>\n#include <iostream>\n#include <cstring>\n#include <climits>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <time.h>\n#include <vector>\nusing namespace std;\n \ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> i_i;\ntypedef pair<ll, int> ll_i;\ntypedef pair<double, int> d_i;\ntypedef pair<ll, ll> ll_ll;\ntypedef pair<double, double> d_d;\nstruct edge { int u, v; ll w; };\n \nint MOD = 1000000007;\n\nint main() {\n\tint N, m; cin >> N >> m;\n\tvector<int> c(m), d(m);\n\tfor (int j = 0; j < m; j++) cin >> c[j] >> d[j];\n\tvector<int> a(N + 2), b(N + 2);\n\tfor (int j = 0; j < m; j++) {\n\t\ta[c[j]]++;\n\t\tb[d[j]]++;\n\t}\n\tint l = -1, x = 0, ans = 0;\n\tfor (int i = 0; i <= N + 1; i++) {\n\t\tans++;\n\t\tif (a[i] > 0) {\n\t\t\tif (l == -1) l = i;\n\t\t\tx += a[i];\n\t\t}\n\t\tx -= b[i];\n\t\tif (x == 0 && l != -1) {\n\t\t\tans += (i - l) * 2;\n\t\t\tl = -1;\n\t\t}\n\t}\n\tcout << ans - 1 << endl;\n} ", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(0,-1),(1,0),(0,1),(-1,0)]\nddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\n\n\ndef main():\n rr = []\n\n while True:\n n,m = LI()\n if m == 0:\n rr.append(n+1)\n break\n a = [LI() for _ in range(m)]\n s = set()\n for c,d in a:\n s |= set(list(range(c,d)))\n\n rr.append(n+1+len(s)*2)\n break\n\n return '\\n'.join(map(str,rr))\n\n\nprint(main())\n\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\ntemplate<class T> inline T sqr(T x) {return x*x;}\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define pb push_back\n#define mp make_pair\n#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define exist(s,e) ((s).find(e)!=(s).end())\n#define range(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) range(i,0,n)\n#define clr(a,b) memset((a), (b) ,sizeof(a))\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst ll INF =1LL << 62;\nconst int inf =1 << 29;\n\nbool memo[1010];\n\nint main(void){\n\tint n,m;\n\tcin >> n >> m;\n\trep(i,m){\n\t\tint c,d;\n\t\tcin >> c >> d;\n\t\tif(c<d) range(j,c,d)memo[j]=true;\n\t}\n\tint ans=n+1;\n\trep(i,n) ans+=2*memo[i];\n\tcout << ans << endl;\n\treturn 0;\n}", "/**\n In the name of Allah, the Most Gracious, the Most Merciful.\n**/\n\n#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nconst int N = 3e5 + 5;\n\npair < int, int > ara[1005];\nvector < pair < int, int > > ve;\nint n, m, c, d, ans;\n\nint main() {\n#ifdef _OFFLINE_\n freopen(\"in.txt\", \"r\", stdin);\n#endif /// _OFFLINE_\n\n cin >> n >> m;\n for(int i=0; i<m; i++) {\n cin >> ara[i].first >> ara[i].second;\n }\n\n sort(ara, ara+m);\n\n// for(int i=0; i<m; i++) {\n// cerr << ara[i].first << \" \" << ara[i].second << \"\\n\";\n// }\n\n if( !m ) {\n cout << n + 1 << \"\\n\";\n exit(0);\n }\n\n int l = 0, r = 0;\n\n for(int i=0; i<m; i++) {\n if( r >= ara[i].first ) {\n r = max(r, ara[i].second);\n }\n else if( r < ara[i].first ) {\n if( l && r ) {\n ve.push_back({l, r});\n }\n l = ara[i].first;\n r = ara[i].second;\n }\n if( i == m-1 ) {\n if( l && r ) {\n ve.push_back({l, r});\n }\n }\n }\n\n// cerr << endl;\n//\n// for(int i=0; i<ve.size(); i++) {\n// cerr << ve[i].first << \" \" << ve[i].second << \"\\n\";\n// }\n\n int len = ve.size(), pre = 0;\n\n for(int i=0; i<len; i++) {\n ans += ve[i].first - pre;\n ans += (ve[i].second - ve[i].first) * 3;\n pre = ve[i].second;\n }\n ans += (n+1) - pre;\n\n cout << ans << \"\\n\";\n\n return 0;\n}\n\n", "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <iomanip>\n#include <assert.h>\n#include <array>\n#include <cstdio>\n#include <cstring>\n#include <random>\n#include <functional>\n#include <numeric>\n#include <bitset>\n\nusing namespace std;\n\nstruct before_main{before_main(){cin.tie(0); ios::sync_with_stdio(false);}} before_main;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nint main() {\n\n int N, m; cin >> N >> m;\n int v[1111] = {};\n rep(i, m) {\n int c, d; cin >> c >> d;\n REP(x, c, d) {\n v[x] ++;\n }\n }\n\n int ans = N+1;\n\n rep(i, 1111) {\n if(v[i]) {\n ans += 2;\n }\n }\n\n cout << ans << endl;\n \n return 0;\n}", "//hikaku site donnyoku ni otosu ippanntekina teku\n#include <iostream>\nusing namespace std;\n\nint n, m;\nint c[500], d[500];\nint imos[1002];\n\nint main() {\n\tcin >> n >> m;\n\tint i;\n\tfor (i = 0; i < n + 2; i++) imos[i] = 0;\n\tfor (i = 0; i < m; i++) {\n\t\tcin >> c[i] >> d[i];\n\t\timos[c[i]]++;\n\t\timos[d[i]]--;\n\t}\n\tfor (i = 1; i < n + 2; i++) imos[i] += imos[i - 1];\n\t\n\tint len = 0;\n\tint ans = n + 1;\n\tfor (i = 0; i < n + 2; i++) {\n\t\tif (imos[i]) {\n\t\t\tlen++;\n\t\t}\n\t\telse {\n\t\t\tans += 2 * len;\n\t\t\tlen = 0;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <string>\n#include <cstdlib>\n#include <stack>\nusing namespace std;\nint n,m;\nint a[1050];\nint main()\n{\n\tfor (int i = 0; i < 1050; i++)\n\t\ta[i]=-1;\n\tcin>>n>>m;\n\tfor (int i = 0; i < m; i++){\n\t\tint c,d;\n\t\tcin>>c>>d;\n\t\ta[c]=std::max(d,a[c]);\n\t}\n\tlong long dist=0;\n\tfor (int i = 0; i <= n; i++,dist++){\n\t\t//cout<<i<<' '<<dist<<endl;\n\t\tif(a[i]==-1)continue;\n\t\tint from=i;\n\t\tint to = a[i];\n\t\tfor (int j = i+1; j <= n; j++){\n\t\t\tif(a[j]>to) to = a[j];\n\t\t\telse if(j==to){\n\t\t\t\tdist+=(to-from)*3;\n\t\t\t\ti=to;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\n\t}\n\tcout<<dist<<endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n\nusing namespace std;\n\nint main() {\n int n,m;\n cin>>n>>m;\n vector<int> rev(n+2);\n REP(i,m) {\n int c,d;\n cin>>c>>d;\n for(int j=c;j<d;++j) rev[j]=1;\n }\n cout<<(n+1+count(begin(rev),end(rev),1)*2)<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nconst double eps = 1e-10;\nconst int MOD = 1000000007;\nconst int INF = 1000000000;\nconst ll LINF = 1ll<<50;\ntemplate<typename T>\nvoid printv(const vector<T>& s) {\n for(int i=0;i<(int)(s.size());++i) {\n cout << s[i];\n if(i == (int)(s.size())-1) cout << endl;\n else cout << \" \";\n }\n}\nint main() {\n cin.tie(0);\n cout << fixed << setprecision(10);\n int n, m; cin >> n >> m;\n if(m == 0) {\n cout << n + 1 << endl;\n return 0;\n }\n vector<pair<int, int>> p(m);\n for(int i=0;i<m;++i) {\n cin >> p[i].first >> p[i].second;\n }\n sort(p.begin(), p.end());\n vector<pair<int, int>> v;\n int l = p[0].first, r = p[0].second;\n for(int i=1;i<m;++i) {\n if(p[i].first <= r) {\n l = min(l, p[i].first);\n r = max(r, p[i].second);\n } else {\n v.push_back({l, r});\n l = p[i].first, r = p[i].second;\n }\n }\n v.push_back({l, r});\n int ans = n + 1;\n for(int i=0;i<(int)(v.size());++i) {\n ans += 2 * (v[i].second - v[i].first);\n }\n cout << ans << endl;\n}\n\n", "#include<cstdio>\n#include<vector>\n#include<iostream>\n#include<algorithm>\n#include<string>\n\nusing namespace std;\n\n#define reps(i,f,n) for(int i=f;i<int(n);i++)\n#define rep(i,n) reps(i,0,n)\n\nconst int N = 1111;\n\nint main(){\n\tint n,k;\n\tcin>>n>>k;\n\t\n\tint masu[N]={0};\n\t\n\trep(i,k){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\t\n\t\treps(j,a,b){\n\t\t\tmasu[j]=1;\n\t\t}\n\t}\n\t\n\tint sum = 0;\n\trep(i,N){\n\t\tsum += masu[i];\n\t}\n\t\n\tprintf(\"%d\\n\",n+sum*2+1);\n\t\n\t\n}", "#include<iostream>\n#include<cstdio>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\nconst double EPS = 1e-9;\ntypedef pair<int, int> P;\ntypedef unsigned int ui;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\nconst ld eps=1e-8;\nint main() {\n\tint n, m; cin >> n >> m;\n\tint chk[1001] = {};\n\trep(i, m) {\n\t\tint s, t; cin >> s >> t; chk[s]++; chk[t]--;\n\t}\n\tRep(i, 1, n + 1) {\n\t\tchk[i] += chk[i - 1];\n\t}\n\tint cnt = 0;\n\trep(i, n + 1) {\n\t\tif (chk[i]) {\n\t\t\tcnt += 3;\n\t\t}\n\t\telse {\n\t\t\tcnt++;\n\t\t}\n\t}\n\tcout << cnt << endl;\n\treturn 0;\n}\n", "N,m = map(int, input().split())\nagain = set()\nfor i in range(m):\n a,b = map(int, input().split())\n for k in range(a,b):\n again.add(k)\n \nr = N+1 + 2*(len(again))\nprint(r)\n", "#!usr/bin/env python3\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef I(): return int(sys.stdin.readline())\ndef LS():return list(map(list, sys.stdin.readline().split()))\ndef S(): return list(sys.stdin.readline())[:-1]\ndef IR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = I()\n return l\ndef LIR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = LI()\n return l\ndef SR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = S()\n return l\ndef LSR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = LS()\n return l\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n#A\ndef A():\n s = input()\n c = I()\n a = eval(s)\n b = int(s[0])\n n = len(s)\n if n == 1:\n if int(s[0]) == c:\n print(\"U\")\n else:\n print(\"I\")\n quit()\n key = 0 if s[1] == \"+\" else 1\n for i in range(2,n):\n if not i%2:\n if key:\n b *= int(s[i])\n else:\n b += int(s[i])\n else:\n key = 0 if s[i] == \"+\" else 1\n if a == b:\n if a == c:\n print(\"U\")\n else:\n print(\"I\")\n elif a == c:\n print(\"M\")\n elif b == c:\n print(\"L\")\n else:\n print(\"I\")\n return\n\n#B\ndef B():\n n,m = LI()\n t = [0 for i in range(2*n+3)]\n for i in range(m):\n a,b = LI()\n t[2*a] += 1\n t[2*b+1] -= 1\n for i in range(2*n+1):\n t[i+1] += t[i]\n ans = n+1\n s = 0\n key = 1\n for i in t:\n if i > 0:\n if key:\n key = 0\n s += 1\n ans += 1\n else:\n key = 1\n ans -= s\n print(ans)\n return\n\n#C\ndef C():\n return\n\n#D\ndef D():\n return\n\n#E\ndef E():\n return\n\n#F\ndef F():\n return\n\n#G\ndef G():\n return\n\n#H\ndef H():\n return\n\n#I\ndef I_():\n return\n\n#J\ndef J():\n return\n\n#Solve\nif __name__ == \"__main__\":\n B()\n\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nusing namespace std;\ntypedef pair<int,int> P;\nvector<P> vc;\nint main(){\n\tint N,M;\n\tcin>>N>>M;\n\trep(i,M){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\tvc.pb(P(a,b));\n\t}\n\tsort(all(vc));\n\tif(M==0){\n\t\tcout<<N+1<<endl;\n\t\treturn 0;\n\t}\n\tint l=vc[0].fs,r=vc[0].sc;\n\tint ans=N+1;\n\trep(i,M){\n\t\tif(r<vc[i].fs){\n\t\t\tans+=2*(r-l);\n\t\t\tl=vc[i].fs,r=vc[i].sc;\n\t\t}else{\n\t\t\tchmax(r,vc[i].sc);\n\t\t}\n\t}\n\tans+=2*(r-l);\n\tcout<<ans<<endl;\n}", "#include<bits/stdc++.h>\n#define long long long\nusing namespace std;\nconst int N=1e3;\nconst int inf=1e6;\nint rq[N+2],mn,vis[N+2];\nvector<int>adj[N+2];\nvoid dfs(int node)\n{\n mn=min(mn,node);\n if(vis[node])return ;\n vis[node]=1;\n for(auto x:adj[node])\n dfs(x);\n}\nint main()\n{\n ios_base::sync_with_stdio(0);cin.tie(0);\n int n,m;cin>>n>>m;\n for(int i=1;i<=m;i++)\n {\n int u,v;cin>>u>>v;\n adj[v].push_back(u);\n }\n for(int i=n;i>=1;i--)\n {\n mn=inf;\n dfs(i);rq[i]=mn;\n }\n int ans=n+1;\n for(int i=n;i>=1;i--)\n {\n mn=rq[i];\n for(int j=i;j>=max(mn,1);j--)\n {\n mn=min(mn,rq[j]);\n }\n ans+=(i-mn)*2;\n i=mn;\n }\n cout<<ans<<endl;\n return 0;\n}\n\n", "#include <iostream>\n#include <algorithm>\n#define N 1001\nusing namespace std;\nint main(){\n int n,m,c,d,l,r,flag,sum;\n int V[N]={0};\n cin >> n >> m;\n for(int i=0;i<m;i++) cin >> c >> d,V[c]=max(V[c],d);\n l=r=flag=sum=0;\n for(int i=0;i<=n;i++){\n if(flag&&V[i]!=0) r=max(r,V[i]);\n if(V[i]!=0&&!flag) l=i,r=V[i],flag=1;\n if(flag&&r==i) sum+=3*(r-l),flag=0;\n if(!flag) sum++;\n }\n cout << sum << endl;\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n#define rep(i,x,y) for(int i=(x);i<y;i++)\n\nstruct S {\n\tint c, d;\n};\n\nint main()\n{\n\tint N, m;\n\n\tcin >> N >> m;\n\n\tvector<S> data(m);\n\n\trep(i, 0, m) {\n\t\tcin >> data[i].c >> data[i].d;\n\t}\n\n\twhile (true) {\n\t\tbool flag = false;\n\n\t\trep(i, 0, m) {\n\t\t\tif (data[i].c == 0 && data[i].d == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\trep(j, i + 1, m) {\n\t\t\t\tif (data[j].c == 0 && data[j].d == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (data[i].d > data[j].c&&data[i].c < data[j].d) {\n\t\t\t\t\tdata[i].c = min(data[i].c, data[j].c);\n\t\t\t\t\tdata[i].d = max(data[i].d, data[j].d);\n\t\t\t\t\tdata[j].c = 0;\n\t\t\t\t\tdata[j].d = 0;\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (flag == false) {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tint ans = N + 1;\n\n\trep(i, 0, m) {\n\t\tans += (data[i].d - data[i].c) * 2;\n\t}\n\n\tcout << ans << endl;\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n int N, m;\n cin >> N >> m;\n vector<pair<int, int>> cd(m);\n\n int c, d;\n for(int i = 0; i < m; i++){\n cin >> c >> d;\n cd[i] = make_pair(c, d);\n }\n\n sort(cd.begin(), cd.end());\n\n int ans = N + 1;\n int start = 0;\n int end = 0;\n for(int i = 0; i < m; i++){\n auto temp = cd[i];\n if(temp.first < end){\n end = max(end, temp.second);\n }\n else{\n ans += (end - start) * 2;\n start = temp.first;\n end = temp.second;\n }\n }\n\n ans += (end - start) * 2;\n\n cout << ans << endl;\n}\n\n", "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nusing namespace std;\ntypedef long long LL;\n\nint main(){\n int L, n;\n while(cin >> L >> n) {\n vector<pair<int, int>> vp(n);\n REP(i, n) {\n int a, b;\n cin >> a >> b;\n vp[i] = make_pair(a, b);\n }\n sort(vp.begin(), vp.end());\n long long ans = L + 1;\n if(n == 0) {\n cout << ans << endl;\n continue;\n }\n int begin = vp[0].first, end = vp[0].second;\n for(int i = 1; i < n; i++) {\n if(vp[i].first <= end) {\n end = max(end, vp[i].second);\n } else {\n ans += 2 * (end - begin);\n begin = vp[i].first;\n end = vp[i].second;\n }\n }\n ans += 2 * (end - begin);\n cout << ans << endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\n#define syosu(x) fixed<<setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\ntypedef pair<double,double> pdd;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int,P> pip;\ntypedef vector<pip> vip;\nconst int inf=1<<29;\nconst ll INF=1ll<<60;\nconst double pi=acos(-1);\nconst double eps=1e-11;\nconst ll mod=1e9+7;\nconst int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};\n\nclass Union_Find_Tree{\n\tpublic:\n\tvi p,r,s;\n\tUnion_Find_Tree(int n){\n\t\tp=r=vi(n);\n\t\ts=vi(n,1);\n\t\tfor(int i=0;i<n;i++) p[i]=i;\n\t}\n\tint Par(int x){\n\t\tif(p[x]==x) return x;\n\t\treturn p[x]=Par(p[x]);\n\t}\n\tint Size(int x){return s[Par(x)];}\n\tbool Unite(int x,int y){\n\t\tx=Par(x);\n\t\ty=Par(y);\n\t\tif(x==y) return 0;\n\t\tif(r[x]<r[y]){\n\t\t\tp[x]=y;\n\t\t\ts[y]+=s[x];\n\t\t}\n\t\telse{\n\t\t\tp[y]=x;\n\t\t\ts[x]+=s[y];\n\t\t\tif(r[x]==r[y]) r[x]++;\n\t\t}\n\t\treturn 1;\n\t}\n\tbool Same(int x,int y){return Par(x)==Par(y);}\n};\n\nint main(){\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\tint n,m;\n\tcin>>n>>m;\n\tvp a(m);\n\tfor(int i=0;i<m;i++){\n\t\tcin>>a[i].first>>a[i].second;\n\t}\n\twhile(1){\n\t\tbool B=1;\n\t\tfor(int i=0;i<m&&B;i++) for(int j=i+1;j<m&&B;j++) {\n\t\t\tint l=a[i].first,r=a[i].second,L=a[j].first,R=a[j].second;\n\t\t\tif(max(l,L)<min(r,R)){\n\t\t\t\ta.erase(a.begin()+j);\n\t\t\t\ta.erase(a.begin()+i);\n\t\t\t\ta.push_back({min(l,L),max(r,R)});\n\t\t\t\tm--;\n\t\t\t\tB=0;\n\t\t\t}\n\t\t}\n\t\tif(B) break;\n\t}\n\tint res=n+1;\n\tfor(int i=0;i<m;i++){\n\t\tres+=2*(a[i].second-a[i].first);\n\t}\n\tcout<<res<<endl;\n}\n", "import java.util.Arrays;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.lang.Math.*;\n\npublic class Main {\n\n\tclass Pair implements Comparable<Pair> {\n\t\tint a;\n\t\tint b;\n\n\t\tpublic Pair(int a, int b) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t}\n\n\t\tpublic int compareTo(Pair p) {\n\t\t\treturn this.b - p.b;\n\t\t}\n\t}\n\n\tvoid run() {\n\t\t// input\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tif (m == 0) {\n\t\t\tSystem.out.println(n + 1);\n\t\t\treturn;\n\t\t}\n\t\tPair[] pair = new Pair[m];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tint b = sc.nextInt();\n\t\t\tpair[i] = new Pair(a, b);\n\t\t}\n\t\tArrays.sort(pair);\n\n\t\t// debug\n\t\t// for (int i = 0; i < m; i++) {\n\t\t// System.out.println(pair[i].a + \" \" + pair[i].b);\n\t\t// }\n\t\t// System.out.println();\n\n\t\tMap<Integer, Integer> res = new TreeMap<Integer, Integer>();\n\t\tint key = pair[m - 1].b;\n\t\tint val = pair[m - 1].a;\n\t\tfor (int i = m - 2; i >= 0; i--) {\n\t\t\tif (val <= pair[i].b) {\n\t\t\t\tval = min(val, pair[i].a);\n\t\t\t\tkey = max(key, pair[i].b);\n\t\t\t} else {\n\t\t\t\t// ??????????????????\n\t\t\t\tif (res.containsKey(key)) {\n\t\t\t\t\tval = min(val, res.get(key));\n\t\t\t\t}\n\t\t\t\tres.put(key, val);\n\t\t\t\tkey = pair[i].b;\n\t\t\t\tval = pair[i].a;\n\t\t\t}\n\t\t}\n\t\tres.put(key, val);\n\n\t\t// debug\n\t\t// for (Integer k : res.keySet()) {\n\t\t// System.out.println(k + \" \" + res.get(k));\n\t\t// }\n\n\t\tint count = 0;\n\t\tint pos = 0;\n\t\tfor (Integer k : res.keySet()) {\n\t\t\tint back = res.get(k);\n\t\t\tcount += ((k - pos) + (k - back) * 2);\n\t\t\tpos = k;\n\t\t}\n\t\tcount += (n - pos + 1);\n\t\tSystem.out.println(count);\n\t}\n\n\tvoid run1() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\n\t\tPair[] pair = new Pair[m];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tint b = sc.nextInt();\n\t\t\tpair[i] = new Pair(a, b);\n\t\t}\n\t\tArrays.sort(pair);\n\n\t\tint[] mark = new int[n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint s = pair[i].b - 1;\n\t\t\tint e = pair[i].a - 1;\n\t\t\tfor (int j = e; j <= s; j++) {\n\t\t\t\tmark[j] = 1;\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tint s = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (mark[i] == 0) {\n\t\t\t\tcount += s;\n\t\t\t} else {\n\t\t\t\ts++;\n\t\t\t}\n\t\t}\n\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(n) cout<<\"# \"<<#n<<'='<<(n)<<endl\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define peri(i,a,b) for(int i=int(b);i-->int(a);)\n#define rep(i,n) repi(i,0,n)\n#define per(i,n) peri(i,0,n)\n#define all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\nconst int INF=1e9;\nconst int MOD=1e9+7;\nconst double EPS=1e-9;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\ntemplate<typename T>\nostream& operator<<(ostream& os,const vector<T>& a){\n\tos<<'[';\n\trep(i,a.size()) os<<(i?\" \":\"\")<<a[i];\n\treturn os<<']';\n}\n\nint main()\n{\n\tfor(int n,m;cin>>n>>m && n|m;){\n\t\tvi sum(n+2);\n\t\trep(i,m){\n\t\t\tint a,b; cin>>a>>b;\n\t\t\tsum[a]++,sum[b]--;\n\t\t}\n\t\trep(i,n+1) sum[i+1]+=sum[i];\n\t\t\n\t\tint res=0;\n\t\trep(i,n+1) res+=(sum[i]?3:1);\n\t\tcout<<res<<endl;\n\t}\n}", "#include<iostream>\n#include<cstdio>\n#include<string>\n#include<cstring>\n#include<vector>\n#include<set>\n#include<list>\n#include<queue>\n#include<cmath>\n#include<functional>\n#include<algorithm>\n#define INF (1<<29)\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\n\n\nstruct Range{\n\tint s,e;\n\tRange(){}\n\tRange(int s,int e):s(s),e(e){}\n\tbool operator<(const Range &r)const{return e<r.e;}\n};\nvector<Range> merge_range(vector<Range> r){\n\tvector<Range> res;\n\tsort(r.begin(),r.end());\n\tfor(int i=0;i<(int)r.size();i++){\n\t\tint mi=r[i].s;\n\t\twhile(!res.empty()&&r[i].s<=res.back().e){\n\t\t\tmi=res.back().s;\n\t\t\tres.pop_back();\n\t\t}\n\t\tres.push_back(Range(min(mi,r[i].s),r[i].e));\n\t}\n\treturn res;\n}\n\n\nint main(){\n\tint n,m;\n\tRange r[500];\n\tcin>>n>>m;\n\trep(i,m)cin>>r[i].s>>r[i].e;\n\tint ans=n+1;\n\tvector<Range> vr(merge_range(vector<Range>(r,r+m)));\n\trep(i,vr.size()){\n\t\tans+=(vr[i].e-vr[i].s)*2;\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool arr[1010];\n\nint main(){\n int N,M,c,d;\n cin >> N >> M;\n for(int i = 0 ; i < M ; i++){\n cin >> c >> d;\n for(int j = c ; j < d ; j++){\n arr[j] = true;\n }\n }\n cout << N+2*count(arr,arr+N,1)+1 << endl;\n return 0;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint rui[1010];\nint main()\n{\n\tint n,m;\n\tint ans=0;\n\tcin>>n>>m;\n\tans+=n+1;\n\tfill(rui,rui+1010,0);\n\tfor(int i=0;i<m;i++)\n\t{\n\t\tint c,d;\n\t\tcin>>c>>d;\n\t\tif(c<d)\n\t\t{\n\t\t\trui[c]++;\n\t\t\trui[d]--;\n\t\t}\n\t}\n\tfor(int i=1;i<1010;i++)\n\t\trui[i]=rui[i]+rui[i-1];\n\t\n\t//累積和が1以上の区間を見る\n\tint i=0;\n\twhile(i<n+1)\n\t{\n\t\tif(rui[i]>0)\n\t\t{\n\t\t\tint l=i;\n\t\t\twhile(rui[i]>0)\n\t\t\t\ti++;\n\t\t\tint r=i;\n\t\t\tans+=(r-l)*2;\n\t\t}\n\t\ti++;\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 1001000100010001000\n#define MOD 1000000007\n#define EPS 1e-10\n#define int long long\n#define rep(i, N) for (int i = 0; i < N; i++)\n#define Rep(i, N) for (int i = 1; i < N; i++)\n#define For(i, a, b) for (int i = (a); i < (b); i++)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define i_i pair<int, int>\n#define vi vector<int>\n#define vvi vector<vi >\n#define vb vector<bool>\n#define vvb vector<vb >\n#define vp vector< i_i >\n#define all(a) (a).begin(), (a).end()\n#define Int(x) int x; cin >> x;\n#define int2(x, y) Int(x); Int(y);\n#define int3(x, y, z) Int(x); int2(y, z);\n#define fir first\n#define sec second\n#define ffir first.first\n#define fsec first.second\n#define sfir second.first\n#define ssec second.second\n#define Decimal fixed << setprecision(10)\n\n//int dxy[5] = {0, 1, 0, -1, 0};\n// cmd\n\nsigned main()\n{\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int2(n, m);\n vi yui(n+1, 0);\n\n rep(i, m) {\n int2(a, b);\n for (int j = a; j < b; j++) {\n yui[j] = 1;\n }\n }\n\n int ans = n+1;\n rep(i, yui.size()) {\n ans += 2 * yui[i];\n }\n\n cout << ans << endl;\n\n\n return 0;\n}\n\n", "#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<chrono>\n#include<unordered_set>\n#include<unordered_map>\n#include<fstream>\n#include<list>\n#include<functional>\n#include<bitset>\n#include<complex>\n#include<tuple>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef pair<int,int> pi;\ntypedef pair<double,double> pd;\ntypedef pair<double,ll> pdl;\n#define F first\n#define S second\nconst ll E=1e18+7;\nconst ll MOD=1000000007;\n\n\n\n\n\nint main(){\n ll n,m;\n cin>>n>>m;\n if(m==0){cout<<n+1<<endl; return 0;}\n vector<pll> a(m);\n for(auto &I:a){cin>>I.F>>I.S;}\n sort(a.begin(),a.end());\n vector<pll> A;\n A.push_back(a[0]);\n for(int i=1;i<m;i++){\n if(a[i].S>A.back().S){A.push_back(a[i]);}\n }\n vector<vector<ll>> dp(A.size()+1,vector<ll>(A.size()+1,E));\n dp[0][0]=0;\n for(int i=1;i<=A.size();i++){\n for(int t=0;t<i;t++){\n dp[i][t]=dp[i-1][t];\n }\n for(int t=0;t<i;t++){\n dp[i][i]=min(dp[i][i],dp[i-1][t]+(A[i-1].S-A[t].F)*2);\n }\n }\n cout<<dp[A.size()][A.size()]+n+1<<endl;\n \n \n return 0;\n}\n\n", "#include <iostream>\n#include <vector>\n#define PB push_back\nusing namespace std;\nint main(void)\n{\n int vis[1024];\n int n,m;\n cin >> n >> m;\n for(int i=0;i<n+5;++i) vis[i]=i;\n for(int i=0;i<m;++i){\n int left,right;\n cin >> left >> right;\n if(vis[left]<right)\n vis[left]=right;\n }\n for(int i=0;i<n+5;++i){\n if(vis[i+1]<vis[i]) vis[i+1]=vis[i];\n }\n int answer=n+1;\n for(int pos=0;pos<=n;++pos){\n while(vis[pos]>pos){\n answer+=(vis[pos]-pos)*2;\n pos=vis[pos];\n }\n }\n cout << answer << endl;\n return 0;\n}", "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n Shopping solver = new Shopping();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class Shopping {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int N = in.nextInt();\n int M = in.nextInt();\n Set<Integer> se = new HashSet<>();\n for (int i = 0; i < M; i++) {\n int c = in.nextInt() - 1;\n int d = in.nextInt() - 1;\n for (int j = c; j < d; j++) {\n se.add(j);\n }\n }\n int ans = 0;\n for (int i = 0; i <= N; i++) {\n if (se.contains(i)) {\n ans += 2;\n }\n ans++;\n }\n out.println(ans);\n }\n\n }\n}\n\n\n", "#include<cstdio>\n#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<string>\n#include<utility>\n//#include<>\nusing namespace std;\n\n#define rep(i,j) for(i=0;i<j;(i)++)\n\nint main()\n{\n int N,m;\n cin >>N>>m;\n int i;\n pair<int,int> restricts[500],restricts_d_c[500];//(ci,di)と(di,ci)\n rep(i,m){\n cin>>restricts[i].first>>restricts[i].second;\n restricts_d_c[i].first=restricts[i].second;\n restricts_d_c[i].second=restricts[i].first;\n }\n sort(restricts,restricts+m);\n sort(restricts_d_c,restricts_d_c+m);\n int line[1002]={};\n line[0]=1;\n i=0;\n int start,end,j;\n while(i<m){\n start=restricts[i].first;\n end=restricts[i].second;\n i++;\n for(;i<m;i++)\n if(restricts[i].first<=end && end<restricts[i].second)\n\tend=restricts[i].second;\n else if(end<restricts[i].first)\n\tbreak;\n line[start]+=1;\n line[start+1]+=1;\n line[end]-=1;\n line[end+1]-=1;\n }\n int ans=line[0];\n rep(i,N){\n line[i+1]+=line[i];\n ans+=line[i+1];\n //cout<<line[i+1]<<\" \";\n }\n \n cout<<ans<<endl;\n\n return 0;\n}", "#include <bits/stdc++.h>\n#define chmin(a, b) ((a)=min((a), (b)))\n#define chmax(a, b) ((a)=max((a), (b)))\n#define fs first\n#define sc second\n#define eb emplace_back\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef tuple<int, int, int> T;\n\nconst ll MOD=1e9+7;\nconst ll INF=1e18;\n\nint dx[]={1, -1, 0, 0};\nint dy[]={0, 0, 1, -1};\n\nint main(){\n int n, m; cin>>n>>m;\n vector<int> shops(n+10, 0);\n for(int i=0; i<m; i++){\n int c, d; cin>>c>>d;\n for(int j=c; j<d; j++){\n shops[j]++;\n }\n }\n\n int ans=n+1;\n for(int i=1; i<n; i++){\n int length=0;\n while(i<n && shops[i]>0){\n length++;\n i++;\n }\n ans+=length*2;\n }\n\n cout << ans << endl;\n}\n", "#include <iostream>\n#include <stdio.h>\n#include <math.h>\n#include <vector>\n\nusing namespace std;\n\nint n, m;\nint l[505], r[505];\nint dif[1005], sum[1005];\n\nint main(void)\n{\n cin >> n >> m;\n for(int i = 1; i <= m; i++) cin >> l[i] >> r[i];\n\n for(int i = 1; i <= m; i++){\n dif[l[i]]++, dif[r[i]]--;\n }\n for(int i = 1; i <= n+1; i++) sum[i] = sum[i-1] + dif[i];\n \n int ans = 0, cnt = 0;\n for(int i = 1; i <= n+1; i++){\n if(sum[i] > 0) cnt++;\n else{\n ans += cnt;\n cnt = 0;\n }\n }\n ans *= 2, ans += n+1;\n cout << ans << endl;\n\n return 0;\n}\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main()\n{\n int N, m;\n\n cin >> N >> m;\n vector<bool> select(m, true);\n vector<pair<int, int>> cd(m);\n\n for (int i = 0; i < m; ++i)\n cin >> cd[i].first >> cd[i].second;\n sort(cd.begin(), cd.end());\n\n for (int i = 0; i < m; ++i) {\n if (cd[i].second <= cd[i].first)\n select[i] = false;\n }\n\n for (int i = 0; i < m; ++i) {\n if (!select[i])\n continue;\n bool isIN = false;\n for (int j = 0; j < m; ++j) {\n if (i == j || !select[j])\n continue;\n if (cd[j].first <= cd[i].first && cd[i].second <= cd[j].second) {\n isIN = true;\n break;\n }\n }\n if (isIN)\n select[i] = false;\n }\n\n for (int i = 0; i < m; ++i) {\n if (!select[i])\n continue;\n for (int j = i + 1; j < m; ++j) {\n if (!select[j])\n continue;\n if (cd[i].first <= cd[j].first && cd[j].first < cd[i].second) {\n select[j] = false;\n cd[i].second = cd[j].second;\n }\n }\n }\n\n int ans = N + 1;\n for (int i = 0; i < m; ++i)\n if (select[i])\n ans += 2 * (cd[i].second - cd[i].first);\n\n cout << ans << endl;\n\n return 0;\n}", "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n // editorial解\n // 重なる区間を1発で済ませてしまえば良いことが自明なので\n // いもしてホイ\n int n, m;\n cin >> n >> m; \n int imos[1005] = {};\n for(int i = 0; i < m; i++){\n int c, d;\n cin >> c >> d;\n imos[c]++, imos[d]--;\n }\n int ans = n+1;\n for(int i = 1; i <= n; i++){\n imos[i] += imos[i-1];\n if(imos[i]) ans += 2;\n }\n cout << ans << endl;\n return 0;\n\n\n // 自分の回答(AC)\n // int n, m;\n // cin >> n >> m;\n // if(m == 0){\n // cout << n+1 << endl;\n // return 0;\n // }\n // vector<int> dp(m, 1<<30);\n // vector<pair<int,int>> vp;\n // for(int i = 0; i < m; i++){\n // int c, d;\n // cin >> c >> d;\n // vp.push_back({d, c});\n // }\n // sort(vp.begin(), vp.end());\n // for(int i = 0; i < m; i++){\n // int to = vp[i].first, from = vp[i].second;\n // for(int j = i; j >= 0; j--){\n // from = min(from, vp[j].second);\n // dp[i] = min(dp[i], (j==0 ? 0 : dp[j-1])+(to-from)*2);\n // }\n // }\n // cout << dp[m-1]+n+1 << endl;\n // return 0;\n}\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)\n#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)\n#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)\n#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)\nconst ll INF = 1145141919;\nconst ll MOD = 1000000007;\ntemplate<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}\ntemplate<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}\n\nll flg[1010];\n\nint main(){\n\n\tll N, M;\n\tcin >> N >> M;\n\t\n\trep(i, M){\n\t\tll a, b;\n\t\tcin >> a >> b;\n\t\tfor(ll i = a; i < b; i++)flg[i] = 1;\n\t}\n\tll ans = N + 1;\n\tfor(ll i = 1; i <= N; i++)ans += 2 * flg[i];\n\tcout << ans << endl;\n\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(int argc, char *argv[]){\n int n, m;\n cin >> n >> m;\n int c[m], d[m];\n int road[n + 1];\n memset(road, 0, sizeof(road));\n for (int i = 0; i < m; i++) {\n cin >> c[i] >> d[i];\n for (int j = c[i]; j < d[i]; j++) {\n road[j] = 1;\n }\n }\n int ans = 0;\n for (int i = 0; i <= n; i++) {\n if(road[i] == 1)ans++;\n // std::cout << road[i];\n // if(i == n)std::cout << std::endl;\n // else std::cout << \" \";\n }\n \n std::cout << ans*2 + n + 1 << std::endl;\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint dfs(int n, vector<vector<int> >& adj){\n\tif((int)adj[n].size() == 0) return n;\n\tint ret=0;\n\tfor(int i=0; i<(int)adj[n].size(); i++){\n\t\tret = max(ret, dfs(adj[n][i], adj));\n\t}\n\tadj[n].clear();\n\treturn ret;\n}\n\nint main(){\n\tint n,m;\n\tcin >> n >> m;\n\t\n\tvector<vector<int> > rest(n+1);\n\tfor(int i=0; i<m; i++){\n\t\tint c,d;\n\t\tcin >> c >> d;\n\t\trest[c].push_back(d);\n\t}\n\tvector<int> c,d;\n\tfor(int i=1; i<=n; i++){\n\t\tint top = dfs(i, rest);\n\t\tif(top != i){\n\t\t\tc.push_back(i);\n\t\t\td.push_back(top);\n\t\t}\n\t}\n\tc.push_back(n+1);\n\td.push_back(n+1);\n\t\n\tint ans = 0;\n\tint s=c[0], e=d[0];\n\tfor(int i=1; i<(int)c.size(); i++){\n\t\tif(c[i] <= e){\n\t\t\te = max(e, d[i]);\n\t\t}else{\n\t\t\tans += e-s;\n\t\t\ts = c[i];\n\t\t\te = d[i];\n\t\t}\n\t}\n\tans = n +1 +ans*2;\n\tcout << ans << endl;\n\treturn 0;\n}", "// 3.3 \"\"\n// https://onlinejudge.u-aizu.ac.jp/problems/2298\n// 所要時間:\n// 着席位置: 左前\n// 学んだこと:\n\n#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n\nint main(void){\n int n, m;\n cin >> n >> m;\n \n vector<pair<int, int>> make;\n for (int i = 0; i < m; i++) {\n int c, d;\n cin >> c >> d;\n make.emplace_back(c, 1);\n make.emplace_back(d, -1);\n }\n \n sort(make.begin(), make.end());\n \n int ans = n + 1, idx = 0, until;\n for (int i = 0; i < 2*m; i++) {\n if (make[i].second == 1) {\n if (idx == 0) until = make[i].first;\n idx++;\n }\n else idx--;\n \n if (idx == 0) {\n ans += 2 * (make[i].first - until);\n }\n }\n \n cout << ans << endl;\n}\n\n", "#include <stdio.h>\n\n#pragma warning(disable : 4996)\n\nint n, m, c, d, imos[1111];\n\nint main()\n{\n\tscanf(\"%d\", &n);\n\tscanf(\"%d\", &m);\n\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tscanf(\"%d\", &c);\n\t\tscanf(\"%d\", &d);\n\n\t\timos[c--]++;\n\t\timos[d--]--;\n\t}\n\n\tint ret = n + 1, sum = 0;\n\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tsum += imos[i];\n\n\t\tif (sum > 0) ret += 2;\n\t}\n\n\tprintf(\"%d\\n\", ret);\n\n\treturn 0;\n}", "// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1347\n// ICPC: アジア地区予選2014C\n// Shopping\n\n/*\nProblem.\nスタート地点:0, ゴール地点: N+1であるとして、\n地点1~Nに存在するN個あるノードを全て訪れるときの最短距離を求めよ、\nただし、M個の以下の内容の制約が与えられる。\n- 制約(C, D)：ノードCの前にノードDを訪れなければならない。\n\nPoint.\npreceder[i]:iの最も後ろの先行ノード\n- preceder[i]より前のiの先行ノードについては、\n preceder[i]を訪れる際にコスト0で訪れることが可能であるため、\n iの先行ノードはpreceder[i]のみ考慮すれば良い。\n\ndp[j][i]: 最大jまで経由した時の、0~iまでを巡る最短距離.\n- dp[i][i]は、0~iまでの全てかつ0~iのみのノードを巡る最短距離であり、\n dp[i][i] < INF なら、0~iまでのノードで完結させることが可能と言える。\n この時、i+1については、明らかにdp[i][i]の値を元に最短距離が求まる。\n以上より、値の更新は\nif(dp[i-1][i-1] < INF)dp[j][i] = dp[i-1][i-1] + j-(i-1) + j-i; //i-1 -> j -> i\nelse dp[j][i] = dp[j][i-1]+1; //素直に前のノードから１つ移動\n*/\n\n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n#include<ctime>\n#include<queue>\n\nusing namespace std;\nusing ll = long long;\nusing pint = pair<int, int>;\n\n#define INF 1e9\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int ti = clock();\n // start-----------------------------------------------\n int n, m; cin >> n >> m;\n vector<vector<int>> dp(n+2, vector<int>(n+2, INF));\n\n vector<int> preceder(n+2);\n for(int i = 0; i < n+2; i++) preceder[i] = i;\n for(int i = 0; i < m; i++){\n int a, b; cin >> a >> b;\n preceder[a] = max(preceder[a], b);\n }\n\n dp[0][0] = 0;\n for(int i = 1; i <= n+1; i++){\n for(int j = preceder[i]; j <= n+1; j++){\n if(dp[i-1][i-1] < INF) dp[j][i] = dp[i-1][i-1] + j-(i-1) + j-i;\n else dp[j][i] = dp[j][i-1] + 1;\n }\n }\n cout << dp[n+1][n+1] << endl;\n // end-----------------------------------------------\n // cerr << 1.0 * (clock() - ti) / CLOCKS_PER_SEC << endl;\n}\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int N, m;\n cin >> N >> m;\n bool th[1001] = {false};\n for(int i = 0; i < m; i++) {\n int c, d; cin >> c >> d;\n for(int j = c; j < d; j++) th[j] = true;\n }\n int ans = N + 1;\n for(int i = 0; i < N; i++) {\n if(th[i]) ans += 2;\n }\n cout << ans << endl;\n return 0;\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\ntypedef long long int ll;\n#define BIG_NUM 2000000000\nusing namespace std;\n\nint main(){\n\n\tint N,M,left,right,ans = 0;\n\tscanf(\"%d %d\",&N,&M);\n\n\tbool* table = new bool[N+1];\n\tfor(int i = 0; i <= N; i++)table[i] = false;\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%d %d\",&left,&right);\n\t\tfor(int k = left;k < right;k++)table[k] = true;\n\t}\n\n\tfor(int i = 0; i <= N; i++){\n\t\tif(table[i])ans += 3;\n\t\telse{\n\t\t\tans += 1;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Shopping\n */\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\tline = br.readLine();\n\n\t\tint N, m;\n\t\tN = parseInt(line.substring(0, line.indexOf(' ')));\n\t\tm = parseInt(line.substring(line.indexOf(' ') + 1));\n\n\t\tif (m == 0) {\n\t\t\tSystem.out.println(N + 1);\n\t\t\treturn;\n\t\t}\n\n\t\tint[] shops = new int[N + 1];\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tline = br.readLine();\n\t\t\tint c, d;\n\t\t\tc = parseInt(line.substring(0, line.indexOf(' ')));\n\t\t\td = parseInt(line.substring(line.indexOf(' ') + 1));\n\t\t\tshops[c]++;\n\t\t\tshops[d]--;\n\t\t}\n\n\t\tfor (int i = 1; i < shops.length; i++) {\n\t\t\tshops[i] += shops[i - 1];\n\t\t}\n\n\t\tint free = 0;\n\t\tfor (int i = 0; i < shops.length; i++) {\n\t\t\tif (shops[i] == 0) free++;\n\t\t}\n\n\t\tSystem.out.println(free + (N + 1 - free) * 3);\n\n\t}\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n#define im imag()\n#define re real()\n#define r(I, N) for(int I=0;I<N;I++)\n#define f(I, A, B) for(int I=A;I<B;I++)\n#define fd(I, A, B) for(int I=A;I>=B;I--)\n#define ite(x) for(__typeof((x).begin()) it=(x).begin();it!=(x).end();it++)\n#define sz(x) ((int)(x).size())\n#define clr(x) memset(x, 0, sizeof(x))\n\ntypedef pair<int, int> pii;\ntypedef long long ll;\ntypedef long double ld;\ntypedef complex<ld> Point;\ntypedef Point Vector;\n\nconst ld pi = acos(-1.0);\nconst ld eps = 1e-12;\n\nint n, m;\nint pos1[1234], pos2[1234];\nint f[567], t[567];\n\nint main()\n{\n cin >> n >> m;\n\n r(i, m)\n {\n int a, b;\n cin >> a >> b;\n pos1[a]++, pos2[b]++;\n f[i] = a, t[i] = b;\n }\n\n int ans = 0, cnt = 0;\n int mn = -1;\n\n f(i, 1, n + 1)\n {\n if(pos2[i])\n {\n cnt-=pos2[i];\n if(cnt == 0)\n {\n ans += 2 * (i - mn);\n mn = -1;\n }\n }\n if(pos1[i])\n {\n cnt+=pos1[i];\n if(mn == -1) mn = i;\n }\n ans++;\n }\n cout << ans + 1 << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n bool a[1001]={};\n int N,m,cnt=0;\n cin>>N>>m;\n while(m--){\n int c,d;\n cin>>c>>d;//d???c?????????????????????\n for(int i=c;i<d;++i)a[i]=true;//d??????c??????????????????\n }\n for(int i=0;i<=N;++i)if(a[i])cnt++;//?????£?????????????????°??????\n cout<<N+1+cnt*2<<endl;//N+1?????\\?????£???????????£?????§????????¢???count*2???????????????\n\n return 0;\n}", "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint main(){\n int n,m,x=0,q,w;\n cin>>n>>m;\n vector<int>a[n];\n r(i,m)cin>>q>>w,\n a[q-1].push_back(x),\n a[w-1].push_back(x++);\n set<int>s;int p=0,st,ans=0;\n r(i,n){\n if(a[i].size()){\n if(!p)p++,st=i;\n r(j,a[i].size())\n if(s.count(a[i][j]))s.erase(a[i][j]);\n else s.insert(a[i][j]);\n }\n ans++;\n if(s.size()==0&&p){\n p=0;\n ans+=(i-st)*2;\n }\n }\n cout<<ans+1<<endl;\n}", "#include<iostream>\n#include<string>\n#include<cstring>\n#include<vector>\n#include<set>\ntypedef long long ll;\nusing namespace std;\ntypedef vector<int> vi;\nint N,m;\nint c[505];\nint d[505];\nbool triple[1005];\nint main()\n{\n memset(triple,false,sizeof(triple));\n ll ans=0;\n cin >> N >> m;\n for(int i=0;i<m;i++)\n {\n cin >> c[i] >> d[i];\n if(d[i]>c[i])\n\t{\n\t for(int j=c[i];j<d[i];j++)\n\t {\n\t triple[j]=true;\n\t }\n\t}\n }\n for(int i=0;i<=N;i++)\n {\n ans+=1;\n if(triple[i]) ans+=2;\n }\n cout << ans << endl;\n}\n\n", "#include <cstdio>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <stack>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstdlib>\n#include <bitset>\n#include <tuple>\n#include <assert.h>\n#include <deque>\n#include <bitset>\n#include <iomanip>\n#include <limits>\n#include <chrono>\n#include <random>\n#include <array>\n#include <unordered_map>\n#include <functional>\n#include <complex>\n#include <numeric>\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nconstexpr long long MAX = 5100000;\nconstexpr long long INF = 1LL << 60;\nconstexpr int inf = 1 << 28;\n//constexpr long long mod = 1000000007LL;\n//constexpr long long mod = 998244353LL;\n\nusing namespace std;\ntypedef unsigned long long ull;\ntypedef long long ll;\n\nint main()\n{\n\t/*\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\t*/\n\n\tll N, M; scanf(\"%lld %lld\", &N, &M);\n\tll left = -1;\n\tset<int> s;\n\tvector<vector<int>> g(N);\n\tll last = 0;\n\tfor (int i = 0; i < M; i++) {\n\t\tll c, d; scanf(\"%lld %lld\", &c, &d);\n\t\tc--; d--;\n\t\tg[c].push_back(d);\n\t}\n\tll res = 0;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (g[i].size() > 0) {\n\t\t\tif (left == -1) left = i;\n\t\t\tfor (auto e : g[i]) s.insert(e);\n\t\t}\n\t\tif (s.find(i) != s.end()) {\n\t\t\ts.erase(s.find(i));\n\t\t\tif (s.size() == 0) {\n\t\t\t\tres += i - last + (i - left) * 2;\n\t\t\t\tlast = i;\n\t\t\t\tleft = -1;\n\t\t\t\t//cout << res << endl;\n\t\t\t}\n\t\t}\n\t}\n\t//cout << last << \" \" << res << endl;\n\tres += N + 1 - last;\n\tcout << res << endl;\n\treturn 0;\n\n}\n\n", "#define _CRT_SECURE_NO_WARNINGS\n#pragma comment (linker, \"/STACK:526000000\")\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef string::const_iterator State;\n#define eps 1e-11L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n\n#define MOD 998244353LL\n#define seg_size 262144*2LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\n#define ALL(x) (x).begin(),(x).end()\n\nunsigned long xor128() {\n\tstatic unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);\n\tunsigned long t = (x ^ (x << 11));\n\tx = y; y = z; z = w;\n\treturn (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\n}\n\nvoid init() {\n\tiostream::sync_with_stdio(false);\n\tcout << fixed << setprecision(20);\n}\n\n#define int ll\nvoid solve(){\n\twhile (true) {\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tif (n == 0) return;\n\t\tint dp[1002] = {};\n\t\tint left[1002] = {};\n\t\tleft[0] = 1e9;\n\t\tfor (int i = 1; i < 1002; ++i) {\n\t\t\tdp[i] = 1e9;\n\t\t\tleft[i] = 1e9;\n\t\t}\n\t\tdp[0] = 0;\n\t\tREP(i, m) {\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tleft[b] = min(left[b], a);\n\t\t}\n\t\tfor (int i = 0; i <= n; ++i) {\n\t\t\tint lefting = 1e9;\n\t\t\tfor (int q = i; q <= n; ++q) {\n\t\t\t\tlefting = min(lefting, left[q]);\n\t\t\t\tdp[q + 1] = min(dp[q + 1], dp[i] + (q - i + 1LL) + max(0LL, 2LL * (q - lefting)));\n\t\t\t}\n\t\t}\n\t\tcout << dp[n+1] << endl;\n\t\treturn;\n\t}\n}\n\n#undef int\nint main() {\n\tinit();\n\tsolve();\n}\n", "#include <iostream>\nusing namespace std;\nint main(){\n int N, m, c, d;\n cin >> N >> m;\n int imos[N+1];\n fill(imos, imos+N+1, 0);\n for(int i = 0; i < m; ++i){\n cin >> c >> d;\n ++imos[c];\n --imos[d];\n }\n int t = 0, ans = N+1;\n for(int i = 0; i <= N; ++i){\n t += imos[i];\n if(t > 0) ans += 2;\n }\n cout << ans << endl;\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <cmath>\n#include <cassert>\nusing namespace std;\ntypedef pair<int, int> P;\n\nconst int INF = 1 << 28;\nint dp[510][1010];\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint N, M;\n\twhile(cin >> N >> M) {\n\t\tvector<P> r(M);\n\t\tfor(int i = 0; i < M; i++) {\n\t\t\tcin >> r[i].second >> r[i].first;\n\t\t}\n\t\tsort(r.begin(), r.end());\n\n\t\tfill((int*)begin(dp), (int*)end(dp), INF);\n\t\tdp[0][N] = 0;\n\t\tfor(int i = 0; i < M; i++) {\n\t\t\tint pos = r[i].first;\n\t\t\tfor(int j = 1; j <= N; j++) {\n\t\t\t\tif(dp[i][j] == INF) continue;\n\t\t\t\tint d = (i == 0) ? pos : abs(pos - r[i - 1].first);\n\t\t\t\t// ??????\n\t\t\t\tint ret = abs(pos - min(r[i].second, j));\n\t\t\t\tdp[i + 1][N] = min(dp[i + 1][N], dp[i][j] + d + 2 * ret);\n\t\t\t\t// ????????????\n\t\t\t\tint nj = min(r[i].second, j);\n\t\t\t\tdp[i + 1][nj] = min(dp[i + 1][nj], dp[i][j] + d);\n\t\t\t}\n\t\t}\n\n\t\tint pos = (M == 0) ? 0 : r.back().first;\n\t\tcout << dp[M][N] + (N + 1 - pos) << endl;\n\t}\n}", "#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n \n#define REP(i,n) for(int i=0; i<n; ++i)\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\n#define pi acos(-1.0)\n \ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef vector<VI> VVI;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nint main(){\n\tint n, m;\n\tcin >> n >> m;\n\tVI s(n+2);\n\tREP(i,m){\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\ts[c]++;\n\t\ts[d]--;\n\t}\n\tREP(i,n+1) s[i+1] += s[i];\n\tint x = 0;\n\tREP(i,n+2) if (s[i] > 0) x++;\n\tcout << n + 1 + 2*x << endl;\n\n return 0;\n}", "\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tFastScanner in = new FastScanner(System.in);\n\tPrintWriter out = new PrintWriter(System.out);\n\n\tpublic void run() {\n\t\tint n = in.nextInt(), m = in.nextInt();\n\t\tint[] array = new int[n+1];\n\t\t\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint c = in.nextInt(), d = in.nextInt();\n\t\t\tfor (int j = c; j < d; j++) {\n\t\t\t\tarray[j] = 1;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (array[i] == 1) cnt++;\n\t\t\n\t\tSystem.out.println(cnt * 2 + n + 1);\n\t\t\n\t\tout.close();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tpublic void mapDebug(int[][] a) {\n\t\tSystem.out.println(\"--------map display---------\");\n\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = 0; j < a[i].length; j++) {\n\t\t\t\tSystem.out.printf(\"%3d \", a[i][j]);\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\n\t\tSystem.out.println(\"----------------------------\");\n\t\tSystem.out.println();\n\t}\n\n\tpublic void debug(Object... obj) {\n\t\tSystem.out.println(Arrays.deepToString(obj));\n\t}\n\n\tclass FastScanner {\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t\t//stream = new FileInputStream(new File(\"dec.in\"));\n\n\t\t}\n\n\t\tint read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tboolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tboolean isEndline(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] array = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextInt();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] array = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextLong();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tdouble[] nextDoubleArray(int n) {\n\t\t\tdouble[] array = new double[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextDouble();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tString next() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tString[] nextStringArray(int n) {\n\t\t\tString[] array = new String[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = next();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isEndline(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndline(c));\n\t\t\treturn res.toString();\n\t\t}\n\t}\n}", "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nint n, m;\nint cnt[1010];\n\nbool intersect(pair<int, int> lhs, pair<int, int> rhs) {\n if (lhs.first <= rhs.first && rhs.first <= lhs.second) { return true; }\n if (rhs.first <= lhs.first && lhs.first <= rhs.second) { return true; }\n return false;\n}\n\nint main() {\n while (scanf(\"%d %d\", &n, &m) > 0) {\n MEMSET(cnt, 0);\n REP(i, m) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n if (x > y) { continue; }\n x--; y--;\n cnt[x]++;\n cnt[y]--;\n }\n int prev = -1;\n int ans = n + 1;\n int sum = 0;\n REP(i, n) {\n if (sum == 0 && cnt[i] > 0) {\n prev = i;\n } else if (sum > 0 && sum + cnt[i] == 0) {\n ans += 2 * (i - prev);\n }\n sum += cnt[i];\n }\n assert(sum == 0);\n printf(\"%d\\n\", ans);\n }\n}", "//include\n//------------------------------------------\n#include <vector>\n#include <list>\n#include <map>\n#include <climits>\n#include <set>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <queue>\n#include <random>\n#include <complex>\n#include <regex>\n\nusing namespace std;\n\n#define SHOW_VECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << \" \" << xxx.second << \"\\n\";}}\n\n\nint main() {\n\n int N, M;\n cin >> N >> M;\n\n vector<bool> B(N + 2, false);\n for (int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n for (int i = a; i < b; i++) B[i] = true;\n }\n\n int ans = N + 1;\n for (int i = 0; i < B.size(); i++) if (B[i]) ans += 2;\n\n cout << ans << endl;\n\n return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n#include <bitset>\n#include <time.h>\n#include <tuple>\n#include <iomanip>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e12;\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n\nll sq(ll num) { return num*num; }\nll mod_pow(ll x, ll n) {\n\tif (n == 0)return 1;\n\tif (n == 1)return x%MOD;\n\tll res = sq(mod_pow(x, n / 2));\n\tres %= MOD;\n\tif (n % 2 == 1) {\n\t\tres *= x;\n\t\tres %= MOD;\n\t}\n\treturn res;\n}\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\nll mod_mul(ll a, ll b) { return a*b % MOD; }\n\n//int n, m;\n//vector<P> vp;\n//\n//int main() {\n//\tcin >> n >> m;\n//\trep(i, m) {\n//\n//\t}\n//}\n\nint n, m;\nvector<P> vp;\nint sum[100100];\n\nint main() {\n\tcin >> n >> m;\n\tvp.resize(m);\n\trep(i, m) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tsum[a]++;\n\t\tsum[b]--;\n\t}\n\trep(i, n + 2)sum[i + 1] += sum[i];\n\tll ans = 0;\n\trep(i, n + 1) {\n\t\tif (sum[i] > 0)ans += 3;\n\t\telse ans++;\n\t}\n\tcout << ans << endl;\n}\n", "#include <bits/stdc++.h>\n#define int long long\n#define rep(i,n) for(int i=0;i<n;i++)\n#define Rep(i,a,b) for(int i=a;i<b;i++)\n#define REP(i,a,b) for(int i=a;i<=b;i++)\n#define rev(i,n) for(int i=n-1;i>=0;i--)\n#define vi vector<int>\n#define pb push_back\n#define pi pair<int,int>\n#define vp vector<pair<int,int> >\n#define mp make_pair\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\n\nusing namespace std;\n\nsigned main(){\n int n,m;\n cin>>n>>m;\n vi v(1001);\n rep(i,m){\n int c,d;\n cin>>c>>d;\n Rep(j,c,d){\n v[j]=2;\n }\n }\n int ans=n+1;\n rep(i,1001){\n ans+=v[i];\n }\n cout<<ans<<endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,a,b) for(int i=a;i<b;i++)\n\nint main()\n{\n\tint N, M;\n\tcin >> N >> M;\n\n\tmap< int, vector<int> > memo;\n\trep(i, 0, M)\n\t{\n\t\tint c, d;\n\t\tcin >> c >> d;\n\t\tmemo[c].push_back(i);\n\t\tmemo[d].push_back(i);\n\t}\n\n\tll ans = 0;\n\tset<int> first, second;\n\tint memo_index = -1;\n\trep(i, 1, N + 1)\n\t{\n\t\tans++;\n\t\t\n\t\tif (memo[i].size() == 0) continue;\n\n\t\tif (memo_index < 0) memo_index = i;\n\n\t\tfor (int n : memo[i])\n\t\t{\n\t\t\tif (first.find(n) == first.end())\n\t\t\t\tfirst.insert(n);\n\t\t\telse\n\t\t\t\tsecond.insert(n);\n\t\t}\n\n\t\tif (first.size() == second.size())\n\t\t{\n\t\t\tans += (i - memo_index) * 2;\n\t\t\tmemo_index = -1;\n\t\t\tfirst.clear();\n\t\t\tsecond.clear();\n\t\t}\n\t}\n\tcout << ans + 1 << endl;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define LOG(...) fprintf(stderr, __VA_ARGS__)\n//#define LOG(...)\n#define FOR(i, a, b) for(int i=(int)(a); i<(int)(b); ++i)\n#define REP(i, n) for(int i=0; i<(int)(n); ++i)\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define EXIST(s, e) ((s).find(e)!=(s).end())\n#define SORT(c) sort(ALL(c))\n#define RSORT(c) sort(RALL(c))\n#define SQ(n) (n) * (n)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\nint main() {\n int N, m;\n cin >> N >> m;\n vi shop(N);\n REP(i, m){\n int c, d;\n cin >> c >> d;\n shop[c-1]++;\n shop[d-1]--;\n }\n int res = N + 1;\n int cnt = 0;\n int start = -1;\n REP(i, N){\n if(shop[i] == 0) continue;\n cnt += shop[i];\n if(start == -1) start = i;\n if(cnt == 0) {\n res += (i - start) * 2;\n start = -1;\n }\n }\n cout << res << endl;\n}", "\nimport java.util.*;\nimport java.io.*;\n\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\nimport static java.lang.Math.*;\n\npublic class Main {\n\n\tint INF = 1 << 28;\n\t//long INF = 1L << 62;\n\tdouble EPS = 1e-10;\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt(), m = sc.nextInt();\n\t\tif (m == 0) {\n\t\t\tSystem.out.println(n+1);\n\t\t\treturn;\n\t\t}\n\t\tP[] ps = new P[m];\n\t\tfor (int i=0;i<m;i++) {\n\t\t\tps[i] = new P(sc.nextInt(), sc.nextInt());\n\t\t}\n\t\tsort(ps);\n//\t\tfor (P p : ps) debug(p.f, p.t);\n\t\tint s = ps[0].f, e = ps[0].t;\n\t\tArrayList<P> l = new ArrayList<P>();\n\t\tfor (int i=1;;i++) {\n//\t\t\tdebug(s, e, ps[i].f, ps[i].t);\n\t\t\twhile (i < m && e >= ps[i].f) {\n\t\t\t\te = max(e, ps[i].t);\n//\t\t\t\tdebug(s, e, ps[i].f, ps[i].t);\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tl.add(new P(s, e));\n\t\t\tif (i == m) break;\n\t\t\ts = ps[i].f; e = ps[i].t;\n\t\t}\n\t\tint len = 0, c = 0;\n\t\tfor (P p: l) {\n\t\t\tlen += p.f - c;\n\t\t\tlen += 3 * (p.t - p.f);\n\t\t\tc = p.t;\n//\t\t\tdebug(p.f, p.t);\n\t\t}\n\t\tlen += n+1 - c;\n\t\tSystem.out.println(len);\n\t}\n\n\tclass P implements Comparable<P>{\n\t\tint f, t;\n\t\tP(int f, int t) {\n\t\t\tthis.f = f;\n\t\t\tthis.t = t;\n\t\t}\n\t\tpublic int compareTo(P o) {\n\t\t\t// TODO 自動生成されたメソッド・スタブ\n\t\t\tif (f == o.f) {\n\t\t\t\treturn o.t - t;\n\t\t\t}\n\t\t\treturn f - o.f;\n\t\t}\n\t}\n\n\tvoid debug(Object... os) {\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n#define FOR(i,bg,ed) for(int i=bg;i<ed;i++)\n#define REP(i,n) FOR(i,0,n)\ntemplate<typename T>\nbool chmax(T& l,T r){\n bool ret = l<r;\n if(l<r)l=r;\n return ret;\n}\ntemplate<typename T>\nbool chmin(T& l,T r){\n bool ret = l>r;\n if(l>r)l=r;\n return ret;\n}\ntypedef long long LL;\ntypedef vector<LL> V;\nstring s;\nconst LL inf = 1e14;\nconst int empty = 1e9;\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> p(n+2,-1);\n REP(i,m){\n int c,d;\n cin>>c>>d;\n chmax(p[c],d);\n }\n LL res= n+1;\n int bg = empty;\n int ed = -1;\n REP(i,n+1){\n if(p[i+1]>=i+1){\n chmin(bg,i+1);\n chmax(ed,p[i+1]);\n }\n if(bg!=empty&&ed<=i+1){\n res+=2*(i+1-bg);\n ed=-1;\n bg = empty;\n }\n }\n cout<<res<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n int N,M;\n bool arr[1010] = {false};\n cin >> N >> M;\n for(int i = 0 ; i < M ; i++){\n int c,d;\n cin >> c >> d;\n for(int j = c ; j < d ; j++){\n arr[j] = true;\n }\n }\n cout << N+2*count(arr,arr+N,true)+1 << endl;\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#define N 1001\nusing namespace std;\nint main(){\n int n,m,c,d,l,r,flag,sum;\n int V[N]={0};\n cin >> n >> m;\n for(int i=0;i<m;i++){\n cin >> c >> d;\n V[c]=max(V[c],d);\n }\n l=r=0;\n flag=sum=0;\n for(int i=0;i<=n;i++){\n if(flag&&V[i]!=0) r=max(r,V[i]);\n else if(flag&&r==i) sum+=3*(r-l),flag=0;\n else if(V[i]!=0&&!flag) l=i,r=V[i],flag=1,sum++;\n else if(!flag) sum++;\n }\n cout << sum << endl;\n return 0;\n}", "#include <bits/stdc++.h>\n\n#define sf scanf\n#define pf printf\n#define pb push_back\n#define mp make_pair\n#define PI ( acos(-1.0) )\n#define pmod 1000000007\n#define maxn 100005\n#define IN freopen(\"input.txt\",\"r\",stdin)\n#define OUT freopen(\"output.txt\",\"w\",stdout)\n#define FOR(i,a,b) for(int i=a ; i<=b ; i++)\n#define INF 1000000000\n#define ll long long int\n#define eps (1e-8)\n#define sq(x) ( (x)*(x) )\n\nusing namespace std;\n\ntypedef pair < int, int > pii;\ntypedef pair < ll, ll > pll;\npriority_queue<pii,vector<pii>, greater<pii> > q;\nll res=0;\nint a[1000],b[1000],c1[1051],d1[1051];\nint main()\n{int N,m;\ncin>>N>>m;\nFOR (i,1,m){int c,d;\n cin>> c>>d;\n q.push(mp(c,d));\n c1[i]=c;d1[i]=d;\n //if (c==3 && d==86) cout<<123<<endl;\n}\nint t=1;int k=0;\nwhile (!q.empty()){\n int c1=q.top().first;\n int d1=q.top().second;\n q.pop();\n if (!q.empty()){int c2=q.top().first;\n int d2=q.top().second;\n //if (c1==3 && d1==86) cout<<\"dm\"<<\" \"<<c2<<\" \"<<d2<<endl;\n //if (k<=10) {k++;cout<<c1<<\" \"<<d1<<\" \"<<c2<<\" \"<<d2<<endl;}\n\n if (d1>=c2){\n\n q.pop();\n q.push(mp(c1,max(d1,d2)));\n\n\n }\n else {res+=2*(d1-c1);}\n }\n else {res+=2*(d1-c1);}\n}\ncout<<res+N+1<<endl;\n/*FOR(i,1,m){ bool u=0;\n FOR(j,1,t-1){\n if (c1[i]>=a[j] && d1[i]<=b[j]) u=1;\n\n }\n if (u==0) cout<<i<<\" \"<<c1[i]<<\" \"<<d1[i]<<endl;\n}*/\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define all(c) (c).begin(), (c).end()\n\nint main() {\n int N, m; cin >> N >> m;\n vector<char> goback(N, 0);\n while (m--) {\n int c, d; cin >> c >> d;\n fill_n(goback.begin() + c, d - c, 1);\n }\n cout << count_if(all(goback), [&](char c) { return c == 1; }) * 2 + N + 1 << endl;\n}", "#include <iostream>\n#include <vector>\n#include <utility>\n#include <algorithm>\n\nusing namespace std;\n\nint main(void)\n{\n\tint N, M;\n\tcin >> N >> M;\n\tvector<pair<int, int>> R(M);\n\tfor (auto &i : R) cin >> i.first >> i.second;\n\tsort(R.begin(), R.end());\n\tint ans = 0, now = 0;\n\tint c, d;\n\tfor (auto i = R.begin(); i != R.end();)\n\t{\n\t\tc = i->first;\n\t\td = i->second;\n\t\tfor (i++; i != R.end(); i++)\n\t\t{\n\t\t\tif (i->first > d) break;\n\t\t\td = max(d, i->second);\n\t\t}\n\t\tans += (d - now);\n\t\tans += (d - c);\n\t\tnow = c;\n\t}\n\tans += (N + 1 - now);\n\tcout << ans << endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nint n,m;\nint rev[1024]={};\nint main(){\n\tcin >> n >> m;\n\tfor(int i=0;i<m;++i){\n\t\tint c,d;\n\t\tcin >> c >> d;\n\t\trev[c]++;\n\t\trev[d]--;\n\t}\n\tfor(int i=0;i<n;++i) rev[i+1]+=rev[i];\n\tint answer=n+1;\n\tfor(int i=0;i<=n;++i) if(rev[i]) answer+=2;\n\tcout << answer << endl;\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = uint32_t;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<int> v(n+2);\n for (int i = 0; i < m; ++i) {\n int c, d;\n cin >> c >> d;\n v[c]++; v[d]--;\n }\n int dep = 0, cur = 0;\n int ans = 0;\n for (int i = 1; i <= n+1; ++i) {\n ans++;\n if(dep != 0 && dep+v[i] == 0){\n ans += (i-cur-1)*2;\n }\n dep += v[i];\n if(dep == 0) cur = i;\n }\n\n cout << ans << \"\\n\";\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)\n\ntypedef long long ll;\n\nconst int N = 1000;\nconst int M = 500;\nint n, m;\nint l[M], r[M];\nint check[N+2];\nint il[M], ir[M];\n\nint main() {\n\tint i, j;\n\tscanf(\"%d%d \", &n, &m);\n\tfor (i=0; i<n; i++)\n\t\tscanf(\"%d%d \", l+i, r+i);\n\n\tmemset(check, 0, sizeof(check));\n\tfor (i=0; i<m; i++) {\n\t\tfor (j=l[i]; j<r[i]; j++)\n\t\t\tcheck[j] = 1;\n\t\tif (check[r[i]] != 1)\n\t\t\tcheck[r[i]] = 2;\n\t}\n\n\tm = 0;\n\tfor (i=1; i<=n; i++) {\n\t\tif (check[i-1] != 1 && check[i])\n\t\t\til[m] = i;\n\t\tif (check[i] == 2)\n\t\t\tir[m++] = i; \n\t}\n\n\tint res = 0;\n\tint prev = 0;\n\ti = 0;\n\twhile (i<m) {\n\t\tres += ir[i] - prev;\t\n\t\tres += ir[i] - il[i];\n\t\tprev = il[i++];\n\t}\t\n\n\tres += n+1 - prev;\n\tprintf(\"%d\\n\", res);\n\n\treturn 0;\n}", "#include<bits/stdc++.h>\n#define REP(x,y,z) for(int x=y;x<=z;x++)\n#define FORD(x,y,z) for(int x=y;x>=z;x--)\n#define MSET(x,y) memset(x,y,sizeof(x))\n#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)\n#define F first\n#define S second\n#define MP make_pair\n#define PB push_back\n#define SZ size()\n#define M 1005\nvoid RI(){}\ntemplate<typename... T>\nvoid RI( int& head, T&... tail ) {\n scanf(\"%d\",&head);\n RI(tail...);\n}\nusing namespace std;\ntypedef long long LL;\nint n,m,ans;\nbool vis[M];\nint main()\n{\n\tint x,y;\n\tRI(n,m);\n\tans = n+1;\n\tREP(i,1,m)\n\t{\n\t\tRI(x,y);\n\t\tREP(j,x,y-1) if(!vis[j])\n\t\t{\n\t\t\tvis[j] = true;\n\t\t\tans += 2;\n\t\t}\n\t}\n\tprintf(\"%d\\n\", ans);\n\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n, m; cin >> n >> m;\n vector<int> imos(n + 2, 0);\n for(int i = 0; i < m; i++){\n int c, d; cin >> c >> d;\n if(c < d){\n imos[c]++;\n imos[d]--;\n }\n }\n\n for(int i = 1; i <= n + 1; i++){\n imos[i] += imos[i - 1];\n }\n\n int counter = 0;\n for(int i = 0; i <= n + 1; i++){\n if(imos[i] > 0) counter++;\n }\n\n cout << n + 1 + counter * 2 << endl;\n return 0;\n}\n", "/*************************************************************************\n > File Name: 3.cpp\n > Author: cy\n > Mail: [email protected] \n > Created Time: 15/5/13 20:28:00\n ************************************************************************/\n\n#include<iostream>\n#include<cstring>\n#include <algorithm>\n#include<cstdlib>\n#include<vector>\n#include<cmath>\n#include<stdlib.h>\n#include<iomanip>\n#include<list>\n#include<deque>\n#include<map>\n#include <stdio.h>\n#include <queue>\n\nconst int maxn=1000+5;\n\n#define inf 0x3f3f3f3f\n #define INF 0x3FFFFFFFFFFFFFFFLL\n#define rep(i,n) for(i=0;i<n;i++)\n #define reP(i,n) for(i=1;i<=n;i++)\n\n#define ull unsigned long long\n #define ll long long\n\n#define cle(a) memset(a,0,sizeof(a))\n\nusing namespace std;\nint n,m;\nstruct node\n{\n\tint be,en;\n}tree[maxn];\nvector<node>V;\nvoid init(){\n\tV.clear();\n}\nbool cmp(node a,node b){\n\treturn a.be<b.be;\n}\nvoid doit(){\n\tnode a;\n\tV.push_back(tree[0]);\n for(int i=1;i<m;i++){\n\t\ta=V[V.size()-1];\n\t\tif(tree[i].en>a.en&&tree[i].be<=a.en){\n\t\t\ta.en=tree[i].en;\n\t\tV[V.size()-1]=a;\n\t\t}\n\t\telse if(tree[i].be>a.en){\n\t\t\tV.push_back(tree[i]);\n\t\t}\n\t}\n}\nll ans;\nll work(){\n\tint now=0;\n\tans=0;\n\tint len=V.size();\n\tfor(int i=0;i<len;i++)\n\t{\n\t\tans+=(V[i].en-now);\n\t\tans+=(2*(V[i].en-V[i].be));\n\t\tnow=V[i].en;\n\t}\n\tans+=(n+1-now);\n\treturn ans;\n}\nint main()\n{\n#ifndef ONLINE_JUDGE\n //freopen(\"in.txt\",\"r\",stdin);\n //freopen(\"out.txt\",\"w\",stdout);\n#endif\n while(cin>>n>>m){\n\t\tinit();\n\t for(int i=0;i<m;i++){\n\t\t\tcin>>tree[i].be>>tree[i].en;\n\t\t}\n\t\tsort(tree,tree+m,cmp);\n\t\tdoit();\n\t\twork();\n\t\tcout<<ans<<endl;\n\t}\t\n return 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <set>\n#include <map>\n#include <queue>\n#include <deque>\n#include <bitset>\n#include <numeric>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include <tuple>\n#include <stack>\n\nusing namespace std;\n\n#define rep(i,n) for(int i = 0; i<n ; i++)\n#define FOR(i,a,n) for(int i=a; i<n; i++)\n#define REPSTR(i,s) for(int i=0; (s)[i]; i++)\n#define REPITR(i,s) for(auto i=(s).begin(); i!=(s).end();i++)\n\n#define RANGE(a,i,b) ((a)<=(i)&&(i)<=(b))\n\n#define pb push_back\n#define mp make_pair\n\n#define ALL(a) (a).begin(), (a).end()\n\n#define EXIST(s,x) ((s).find(x)!=(s).end())\n\n#define SET(a,c) memset(a,c,sizeof(a))\n#define CLR(a) memset(a,0,sizeof(a))\n\n#ifdef _DEBUG\n#define DEBUG(x) cerr<<#x<<\":\"<<x<<endl\n#else\n#define DEBUG(x)\n#endif\n\n#define PRINTJOIN(x,n) rep(i,n){if(i)cout<<\" \";cout<<x[i];}cout<<endl \n\n#define INF 1001001001\n#define LLINF 1001001001001001001LL\n\ntypedef long long ll;\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef stringstream SS;\n\n#define PQ priority_queue\n\n#define FST first\n#define SEC second\n\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n\nbool revert[1123];\n\nint main(void) {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n int n, m;\n cin>>n>>m;\n rep(i, m){\n int c, d;\n cin>>c>>d;\n FOR(j, c, d) {\n revert[j]=true;\n }\n }\n int ans=0;\n rep(i, n){\n ans+=revert[i]*2+1;\n }\n cout<<ans+1<<endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconstexpr int IINF = INT_MAX;\n\nvoid chmin(int &a, int b){a=min(a,b);};\n\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<int> a(n+2, n+1);\n vector<vector<int> > dp(n+2, vector<int>(n+2, IINF/2));\n for(int i=0;i<m;i++){\n int c, d;\n cin >> c >> d;\n a[d] = min(a[d], c);\n }\n dp[0][n+1] = 0;\n for(int i=0;i<=n;i++){\n for(int j=1;j<=n+1;j++){\n chmin(dp[i+1][min(j, a[i+1])],dp[i][j]+1);\n if(j<n+1){\n chmin(dp[i+1][min(n+1, a[i+1])], dp[i][j] + abs(i-j)*2+1);\n }\n }\n }\n cout << dp[n+1][n+1] << endl;\n return 0;\n}\n\n", "#include<bits/stdc++.h> \nusing namespace std;\nint main(){\n int N, m;\n cin >> N >> m;\n vector< bool > shop(N + 1, 0);\n for(int i = 0; i < m; ++i){\n int c, d;\n cin >> c >> d;\n fill( shop.begin() + c, shop.begin() + d, true);\n }\n cout << N + 1 + count(shop.begin(), shop.end(), true) * 2 << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define mp make_pair\n#define pb push_back\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<int,int> P;\nconst LL mod=1000000007;\nconst LL LINF=1LL<<62;\nconst LL INF=1<<17;\n\n\nint main(){\n int N,m;cin >> N >> m;\n vector<P> v;\n for (int i = 0; i < m; i++) {\n int c,d;\n cin >> c >> d;\n v.pb({c,d});\n }\n v.pb({N+1,N+1});\n sort(ALL(v));\n int ans=0;\n int d=0,mx=v[0].fs,mi=v[0].sc;\n for (int i = 0; i < m+1; i++) {\n P p=v[i];\n if(p.fs>mx){\n ans+=mx-d+2*(mx-mi);\n mi=INF;\n d=mx;\n }\n mx=max(mx,p.sc);\n mi=min(mi,p.fs);\n }\n ans+=N+1-d;\n cout << ans << endl;\n return 0;\n}\n\n", "#include<iostream>\n#include<cstdio>\n#include<string>\n#include<cstring>\n#include<vector>\n#include<set>\n#include<list>\n#include<queue>\n#include<cmath>\n#include<functional>\n#include<algorithm>\n#define INF (1<<29)\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\n\n\nstruct Range{\n\tint s,e;\n\tRange(){}\n\tRange(int s,int e):s(s),e(e){}\n\tbool operator<(const Range &r)const{return e<r.e;}\n};\nvector<Range> merge_range(vector<Range> r){\n\tvector<Range> res;\n\tsort(r.begin(),r.end());\n\tfor(int i=0;i<(int)r.size();i++){\n\t\tint mi=r[i].s;\n\t\twhile(!res.empty()&&r[i].s<=res.back().e){\n\t\t\tmi=min(mi,res.back().s);\n\t\t\tres.pop_back();\n\t\t}\n\t\tres.push_back(Range(mi,r[i].e));\n\t}\n\treturn res;\n}\n\n\nint main(){\n\tint n,m;\n\tRange r[500];\n\tcin>>n>>m;\n\trep(i,m)cin>>r[i].s>>r[i].e;\n\tint ans=n+1;\n\tvector<Range> vr(merge_range(vector<Range>(r,r+m)));\n\trep(i,vr.size()){\n\t\tans+=(vr[i].e-vr[i].s)*2;\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define rep(i, a, n) for(int i = a; i < n; i++)\nusing namespace std;\ntypedef pair<int, int> P;\nconst int INF = 1e9;\n\nint dp[510], nxt[510];\n\nint main(){\n int n, m;\n cin >> n >> m;\n vector<P> d(m);\n rep(i, 0, m){\n cin >> d[i].first >> d[i].second;\n }\n sort(d.begin(), d.end());\n rep(i, 0, m + 1) dp[i] = INF;\n dp[0] = 0;\n rep(i, 0, n + 1){\n rep(j, 0, m + 1) nxt[j] = dp[j] + 1;\n rep(j, 0, m){\n if(dp[j] >= INF) continue;\n int MIN = i + 1;\n rep(k, j, m){\n if(d[k].second > i + 1) break;\n MIN = min(MIN, d[k].first);\n int cost = dp[j] + 1 + (i + 1 - MIN) * 2;\n // cout << i << ' ' << j << ' ' << k << ' ' << dp[j] << ' ' << cost << endl;\n nxt[k + 1] = min(nxt[k + 1], cost);\n }\n }\n swap(dp, nxt);\n }\n cout << dp[m] << endl;\n} \n", "#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <iomanip>\n#include <utility>\n\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<ll, ll> pll;\n\nint solve(void);\n\nint main(void)\n{\n\twhile (solve())\n\t{\n\t}\n\treturn 0;\n}\n\nint solve(void)\n{\n\tll N, m;\n\tcin >> N >> m;\n\n\t// 尺取り法\n\tvector<ll> v(N+2, 0);\n\tvector<pll> cd(N);\n\n\tfor(auto& p: cd) {\n\t\tcin >> p.first >> p.second;\n\t\tv[p.first] ++;\n\t\tv[p.second] --;\n\t}\n\t\n\tfor (int i = 0; i < v.size() - 1; i++)\n\t{\n\t\tv[i + 1] += v[i];\n\t}\n\n\tpll segment;\n\tvector<pll> seg;\n\tfor (int i = 1; i < v.size() - 1; i++)\n\t{\n\t\tif (v[i - 1] == 0 && v[i] > 0)\n\t\t{\n\t\t\tsegment.first = i;\n\t\t}\n\t\tif (v[i] > 0 && v[i + 1] == 0)\n\t\t{\n\t\t\tsegment.second = i + 1;\n\t\t\tseg.push_back(segment);\n\t\t}\n\t}\n\n\tll ans = N + 1;\n\tfor (const auto s : seg)\n\t{\n\t\tans += abs(s.first - s.second) * 2;\n\t}\n\n\tcout << ans << endl;\n\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int, int>;\n\nint N, m;\nint cum[1010];\n\nint main() {\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n \n cin >> N >> m;\n for (int i = 0; i < m; i++) {\n int c, d;\n cin >> c >> d;\n cum[c]++;\n cum[d]--;\n }\n int ans = 0;\n for (int i = 0; i <= N; i++) {\n cum[i + 1] += cum[i];\n ans += cum[i] > 0 ? 3 : 1;\n }\n cout << ans << endl;\n\n return 0;\n}\n", "#define _CRT_SECURE_NO_WARNINGS\n#include\"bits/stdc++.h\"\n#ifdef _DEBUG\n#define DBG(n) n\n#else\n#define DBG(n)\n#endif\n#define INF 1e9\n#define INFLL 1e18\n#define EPS 1e-9\n#define REP(i,n) for(ll i=0,i##_len=(n);i<i##_len;++i)\n#define REP1(i,n) for(ll i=1,i##_len=(n);i<=i##_len;++i)\n#define REPR(i,n) for(ll i=(n)-1;i>=0;--i)\n#define REPR1(i,n) for(ll i=(n);i>0;--i)\n#define REPC(i,obj) for(auto i:obj)\n#define ALL(obj) (obj).begin(),(obj).end()\n#define SETP(n) cout << fixed << setprecision(n)\nusing namespace std;\nusing ll = long long;\ntemplate<typename T = ll>inline T in() { T ret; cin >> ret; return ret; }\n\nsigned main() {\n\tint n = in(), m = in();\n\tvector<int>imos(n + 1);\n\tREP(i, m) {\n\t\tint c = in(), d = in();\n\t\t++imos[c];\n\t\t--imos[d];\n\t}\n\tREP(i, n)imos[i + 1] += imos[i];\n\tint len = 0;\n\tREP(i, n + 1)if (imos[i] != 0)++len;\n\tcout << n + len * 2 + 1 << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define repp(i, l, r) for(int i = (l); i < (r); i++)\n#define per(i, n) for(int i = ((n)-1); i >= 0; i--)\n#define perr(i, l, r) for(int i = ((r)-1); i >= (l); i--)\n#define all(x) (x).begin(),(x).end()\n#define MOD 1000000007\n#define IINF 1000000000\n#define LINF 1000000000000000000\n#define SP <<\" \"<<\n#define CYES cout<<\"Yes\"<<endl;\n#define CNO cout<<\"No\"<<endl;\n\ntypedef long long LL;\ntypedef long double LD;\n\nint main(){\n int n,m;\n cin >> n >> m;\n vector<int> p(n,0);\n int a,b;\n rep(i,m){\n cin >> a >> b;\n a--,b--;\n repp(i,a,b){\n p[i]++;\n }\n }\n int ans=n+1;\n rep(i,n) if(p[i]>0) ans+=2;\n cout << ans << endl;\n return 0;\n}\n\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Shopping\n */\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\tline = br.readLine();\n\n\t\tint N, m;\n\t\tN = parseInt(line.substring(0, line.indexOf(' ')));\n\t\tm = parseInt(line.substring(line.indexOf(' ') + 1));\n\n\t\tif (m == 0) {\n\t\t\tSystem.out.println(N + 1);\n\t\t\treturn;\n\t\t}\n\n\t\tint[] shops = new int[N + 1];\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tline = br.readLine();\n\t\t\tint c, d;\n\t\t\tc = parseInt(line.substring(0, line.indexOf(' ')));\n\t\t\td = parseInt(line.substring(line.indexOf(' ') + 1));\n\t\t\tshops[c]++;\n\t\t\tshops[d]--;\n\t\t}\n\n\t\tint zero = 0;\n\n\t\tfor (int i = 1; i < shops.length; i++) {\n\t\t\tshops[i] += shops[i - 1];\n\t\t\tif (shops[i] == 0) zero++;\n\t\t}\n\n\t\tSystem.out.println(zero + 1 + (N + 1 - (zero + 1)) * 3);\n\n\t}\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < n; i++)\nusing namespace std;\n\nint n, m;\nint table[2000];\nint ans;\n\nint main(){\n\tscanf(\"%d%d\",&n,&m);\n\tans = n+1;\n\trep(i,m){\t\n\t\tint c, d;\n\t\tscanf(\"%d%d\",&c,&d);\n\t\ttable[c]++;\n\t\ttable[d]--;\n\t}\n\tfor(int i = 1; i < 2000; i++) table[i] += table[i-1];\n\tfor(int i = 0; i < 2000; i++) if(table[i]) ans += 2;\n\tcout << ans << endl;\n}", "#define _CRT_SECURE_NO_WARNINGS\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i,a,b) for(ll i=a; i<ll(b); i++)\n#define rep(i,b) loop(i,0,b)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) (cerr<<#__VA_ARGS__<<\" = \"<<(DUMP(),__VA_ARGS__).str()<<\" [\"<<__LINE__<<\"]\"<<endl)\nstruct DUMP:ostringstream{template<class T>DUMP &operator,(const T&t){if(this->tellp())*this<<\", \";*this<<t;return *this;}};\n#else\n#define dump(...)\n#endif\ntemplate<class T> ostream& operator<<(ostream& os, vector<T> const& v){\n rep(i,v.size()) os << v[i] << (i+1==v.size()?\"\":\" \");\n return os;\n}\n\nint N,m;\nint c[1010];\nint d[1010];\nbool flg[1010];\n\nint main(){\n int N;\n while(cin>>N){\n cin >> m;\n memset(flg,0,sizeof(flg));\n rep(i,m){\n int a,b; cin >> a >> b;\n loop(i,a,b) flg[i] = true;\n }\n int ans = N+1;\n rep(i,N+1) ans += 2*flg[i];\n cout << ans << endl;\n }\n}", "#include <iostream>\nusing namespace std;\n\nint N,M;\nint r[1010] = {};\nint main(){\n cin >> N >> M;\n int c,d;\n for(int i=1;i<=M;i++){\n cin >> c >> d;\n r[c+1]++; r[d+1]--; \n }\n for(int i=1;i<=N;i++) r[i] += r[i-1];\n int ans = 0;\n for(int i=1;i<=N;i++){\n if(r[i]>=1) ans += 3;\n else ans++;\n }\n cout << ++ans << endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n\ntypedef pair<int,int> pi;\n\nint main()\n{\n int n,m;\n cin >>n >>m;\n\n vector<pi> s;\n //c?????????d?????????????????¨??????\n rep(i,m)\n {\n int c,d;\n scanf(\" %d %d\",&c,&d);\n if(c<d) s.pb(pi(c,d));\n }\n\n sort(all(s));\n\n int ans=n+1;\n int back=s[0].fi;\n int now=s[0].se;\n\n if(m>0)\n {\n rep(i,m-1)\n {\n if(now<s[i+1].fi)\n {\n ans+=2*(now-back);\n\n back=s[i+1].fi;\n now=s[i+1].se;\n }\n else now=max(now,s[i+1].se);\n }\n ans+=2*(now-back);\n }\n\n printf(\"%d\\n\", ans);\n return 0;\n}", "#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <complex>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\ntemplate<class T> inline T sqr(T x) {return x*x;}\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define pb push_back\n#define mp make_pair\n#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define exist(s,e) ((s).find(e)!=(s).end())\n#define range(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) range(i,0,n)\n#define clr(a,b) memset((a), (b) ,sizeof(a))\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst ll INF =1LL << 62;\nconst int inf =1 << 29;\n\nint main(void){\n for(int n, m, res; cin >> n >> m; cout << res << endl){\n res = 0;\n\n vi once(n + 1, true);\n rep(i, m){\n int c, d; cin >> c >> d;\n\n range(i, c, d){\n once[i] = false;\n }\n }\n\n res = n + 1 + 2 * count(all(once), false);\n }\n\n\treturn 0;\n}", "#include<cstdio>\nusing namespace std;\nbool rev[1010];\nint main(){\n\tint n,m,c,d,ans;\n\tscanf(\"%d%d\",&n,&m);\n\twhile(m--){\n\t\tscanf(\"%d%d\",&c,&d);\n\t\tfor(int i=c;i<d;i++) rev[i]=true;\n\t}\n\tans=n+1;\n\tfor(int i=1;i<n;i++) if(rev[i]) ans+=2;\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}", "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\n\t\tboolean[] triple = new boolean[n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint c = sc.nextInt();\n\t\t\tint d = sc.nextInt();\n\n\t\t\tfor (int j = c; j < d; j++) {\n\t\t\t\ttriple[j] = true;\n\t\t\t}\n\t\t}\n\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < triple.length; i++) {\n\t\t\tif (triple[i]) {\n\t\t\t\tans += 2;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans + n + 1);\n\t\tsc.close();\n\n\t}\n\n}", "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint p[1100];\n\nint main(){\n\tint a,b;scanf(\"%d%d\",&a,&b);\n\tfor(int i=0;i<a;i++){\n\t\tint c,d;\n\t\tscanf(\"%d%d\",&c,&d);\n\t\tfor(int i=c;i<d;i++)p[i]++;\n\t}\n\tint ret=a+1;\n\tfor(int i=1;i<=a;i++)if(p[i])ret+=2;\n\tprintf(\"%d\\n\",ret);\n}", "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <cstring>\n#include <cmath>\n#include <queue>\n#include <set>\n#include <map>\nusing namespace std;\n\n#define rep(i,n) for(int i=0; i<n; i++)\ntypedef long long ll;\ntypedef pair<int,int> pii;\n\nint main() {\n\tint n, m;\n\tcin >> n >> m;\n\tif(m==0) {\n\t\tcout << n+1 << endl;\n\t\treturn 0;\n\t}\n\tvector<pii> cd(m);\n\trep(i, m) {\n\t\tcin >> cd[i].first >> cd[i].second;\n\t}\n\tsort(cd.begin(), cd.end());\n\tvector<pii> v;\n\tint s=cd[0].first, t=cd[0].second;\n\tfor(int i=1; i<m; i++) {\n\t\tif(t <= cd[i].first) {\n\t\t\tv.push_back(pii(s,t));\n\t\t\ts = cd[i].first;\n\t\t\tt = cd[i].second;\n\t\t} else {\n\t\t\tt = max(t, cd[i].second);\n\t\t}\n\t}\n\tv.push_back(pii(s,t));\n\tint res = n+1;\n\trep(i, v.size()) {\n\t\tres += (v[i].second - v[i].first)*2;\n\t}\n\tcout << res << endl;\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rrep(i, n) for (int i = n - 1; i >= 0; i--)\n\nvoid printv(vector<ll> v) {\n for (ll i : v)\n cout << i << endl;\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<int> st(n + 1, 1);\n rep(i, m) {\n int c, d;\n cin >> c >> d;\n for (int j = c; j < d; j++)\n st[j] = 3;\n }\n cout << accumulate(st.begin(), st.end(), 0) << endl;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1000000000;\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);++i)\n#define rep(i,n) REP(i, 0, n)\ntypedef long long int i64;\ntypedef pair<int, int> pint;\nint a[1001];\nint main() {\n int N, M; scanf(\"%d%d\", &N, &M);\n int c, d;\n memset(a, 0, sizeof(a));\n rep(_, M) {\n scanf(\"%d%d\", &c, &d);\n --c; --d;\n a[c]++; a[d]--;\n }\n rep(i, N) a[i + 1] += a[i];\n int ans = N + 1;\n int start = 0; bool cnt = false;\n rep(i, N + 1) {\n if(cnt == false) {\n if(a[i]) {\n cnt = true;\n start = i;\n }\n }else {\n if(a[i] == 0) {\n ans += (i - start) * 2;\n cnt = false;\n }\n }\n }\n printf(\"%d\\n\", ans);\n return 0;\n}", "#include <algorithm>\n#include <array>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))\nusing namespace std;\n\nint main() {\n // input\n int n, m; scanf(\"%d%d\", &n, &m);\n vector<int> c(m), d(m);\n REP (i, m) scanf(\"%d%d\", &c[i], &d[i]);\n // solve\n vector<int> imos(n + 2);\n REP (i, m) {\n imos[c[i]] += 1;\n imos[d[i]] -= 1;\n }\n int result = n + 1;\n REP (i, n + 1) {\n imos[i + 1] += imos[i];\n result += 2 * bool(imos[i + 1]);\n }\n // output\n printf(\"%d\\n\", result);\n return 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.StringTokenizer;\n\npublic class Main{\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tfinal int N = sc.nextInt();\n\t\tfinal int M = sc.nextInt();\n\t\t\n\t\tfinal int size = N + 2;\n\t\tint[] sum = new int[size];\n\t\t\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tfinal int from = sc.nextInt();\n\t\t\tfinal int to = sc.nextInt();\n\t\t\t\n\t\t\tsum[from] += 1;\n\t\t\tsum[to] -= 1;\n\t\t}\n\t\tfor(int i = 1; i < size; i++){\n\t\t\tsum[i] += sum[i - 1];\n\t\t}\n\t\t\n\t\t//System.out.println(Arrays.toString(sum));\n\t\tint ans = N + 1;\n\t\tfor(int i = 0; i < size; i++){\n\t\t\tif(sum[i] > 0){\n\t\t\t\tans += 2;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t\tsc.close();\n\t}\n\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n\n\t\tpublic Scanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\n\t\tprivate void getLine() throws IOException {\n\t\t\twhile (!hasNext()) {\n\t\t\t\ttok = new StringTokenizer(br.readLine());\n\t\t\t}\n\t\t}\n\n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tgetLine();\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\t// 他のnextXXXもXXX.parseXXX()メソッドを使って作れるので省略\n\n\t\tpublic void close() throws IOException {\n\t\t\tbr.close();\n\t\t}\n\t}\n}", "import java.io.*;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.Function;\n\npublic class Main {\n\n static int N, M;\n static int[] C, D;\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n N = sc.nextInt();\n M = sc.nextInt();\n C = new int[M];\n D = new int[M];\n for (int i = 0; i < M; i++) {\n C[i] = sc.nextInt();\n D[i] = sc.nextInt();\n }\n\n System.out.println(solve());\n }\n\n static int solve() {\n int[][] ev = new int[M*2][2];\n for (int i = 0; i < M; i++) {\n ev[i*2][0] = C[i];\n ev[i*2][1] = 1;\n\n ev[i*2+1][0] = D[i];\n ev[i*2+1][1] = -1;\n }\n Arrays.sort(ev, Comparator.<int[]>comparingInt(e -> e[0]).thenComparingInt(e -> -e[1]));\n\n int ans = N+1;\n\n int curr = 0;\n int from = -1;\n for (int[] e : ev) {\n int next = curr + e[1];\n\n if( curr == 0 && next == 1 ) {\n from = e[0];\n } else if( curr == 1 && next == 0 ) {\n int to = e[0];\n ans += (to - from) * 2;\n from = -1;\n }\n\n curr = next;\n }\n return ans;\n }\n\n @SuppressWarnings(\"unused\")\n static class FastScanner {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n int[] nextIntArray(int n, int delta) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt() + delta;\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n static <A> void writeLines(A[] as, Function<A, String> f) {\n PrintWriter pw = new PrintWriter(System.out);\n for (A a : as) {\n pw.println(f.apply(a));\n }\n pw.flush();\n }\n\n static void writeLines(int[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (int a : as) pw.println(a);\n pw.flush();\n }\n\n static void writeLines(long[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (long a : as) pw.println(a);\n pw.flush();\n }\n\n static int max(int... as) {\n int max = Integer.MIN_VALUE;\n for (int a : as) max = Math.max(a, max);\n return max;\n }\n\n static int min(int... as) {\n int min = Integer.MAX_VALUE;\n for (int a : as) min = Math.min(a, min);\n return min;\n }\n\n static void debug(Object... args) {\n StringJoiner j = new StringJoiner(\" \");\n for (Object arg : args) {\n if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));\n else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));\n else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));\n else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));\n else j.add(arg.toString());\n }\n System.err.println(j.toString());\n }\n}\n\n", "#include <bits/stdc++.h>\n\nint main() {\n int N, m;\n int c[2048];\n int d[2048];\n int imos[2048] = {};\n\n std::cin >> N >> m;\n for(int i = 0; i < m; ++i) {\n std::cin >> c[i] >> d[i];\n }\n\n for(int i = 0; i < m; ++i) {\n imos[c[i]] += 1;\n imos[d[i]] -= 1;\n }\n\n int t = 0;\n for(int i = 0; i <= N; ++i) {\n t += imos[i];\n imos[i] = t;\n } \n\n int res = 0;\n for(int i = 0; i < N + 1; ++i) {\n if( imos[i] != 0 ) {\n res += 3;\n }\n else {\n res += 1;\n }\n }\n\n std::cout << res << std::endl;\n\n return 0;\n}", "#include <cstdio>\n#include <algorithm>\nusing std::sort;\nusing std::max;\n\nstruct shop{\n int l, r;\n}shops[1000];\nint S;\n\nbool comp(shop a, shop b){\n return a.l < b.l;\n}\n\nint main(){\n int N, M;\n scanf(\"%d %d\", &N, &M); N++;\n while(M--){\n int l, r;\n scanf(\"%d %d\", &l, &r);\n if(l < r){\n shops[S].l = l;\n shops[S].r = r;\n S++;\n }\n }\n sort(shops, shops+S, comp);\n int MinL = 0;\n int MaxR = 0;\n for(int i=0;i<S;i++){\n if(shops[i].l > MaxR){\n N += (MaxR - MinL) * 2;\n MinL = shops[i].l;\n MaxR = shops[i].r;\n }\n MaxR = max(MaxR, shops[i].r);\n }\n N += (MaxR - MinL) * 2;\n printf(\"%d\\n\", N);\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define LOG(...) fprintf(stderr, __VA_ARGS__)\n//#define LOG(...)\n#define FOR(i, a, b) for(int i=(int)(a); i<(int)(b); ++i)\n#define REP(i, n) for(int i=0; i<(int)(n); ++i)\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define EXIST(s, e) ((s).find(e)!=(s).end())\n#define SORT(c) sort(ALL(c))\n#define RSORT(c) sort(RALL(c))\n#define SQ(n) (n) * (n)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\nint main() {\n int N, m;\n cin >> N >> m;\n vi shop(N+10);\n REP(i, m){\n int c, d;\n cin >> c >> d;\n shop[c-1]++;\n shop[d-1]--;\n }\n int res = N + 1;\n int cnt = 0;\n int start = -1;\n REP(i, N){\n if(shop[i] == 0) continue;\n cnt += shop[i];\n if(start == -1) start = i;\n if(cnt == 0) {\n res += (i - start) * 2;\n start = -1;\n }\n }\n cout << res << endl;\n}", "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n int n, m; cin >> n >> m;\n vector<pair<int, int>> rng(m);\n for (auto &p: rng) cin >> p.first >> p.second, p.first--, p.second--;\n rng.emplace_back(0, 0); rng.emplace_back(n, n);\n sort(rng.begin(), rng.end());\n int left = 0, right = 0;\n int ans = 0;\n for (auto p: rng) {\n if (right <= p.first) {\n ans += (right - left) * 3;\n ans += p.first - right;\n left = p.first, right = p.second;\n } else {\n right = max(right, p.second);\n }\n }\n cout << ans + 1 << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\ntemplate<class T> inline T sqr(T x) {return x*x;}\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define pb push_back\n#define mp make_pair\n#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define exist(s,e) ((s).find(e)!=(s).end())\n#define range(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) range(i,0,n)\n#define clr(a,b) memset((a), (b) ,sizeof(a))\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst ll INF =1LL << 62;\nconst int inf =1 << 29;\n\nint c[510];\nint d[510];\n\nbool route[1010];\n\nint main(void){\n\tint n,m;\n\tcin >> n >> m;\n\trep(i,m){\n\t\tcin >> c[i];\n\t\tcin >> d[i];\n\t\tfor(int j=c[i];j<d[i];++j)\n\t\t\troute[j]=true;\n\t}\n\n\tint ans=n+1;\n\n\trep(i,n+1)\n\t\tif(route[i])\n\t\t\tans+=2;\n\t\t\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int N, m;\n cin >> N >> m;\n vector<int> c(m), d(m);\n for (int i = 0; i < m; i++){\n cin >> c[i] >> d[i];\n }\n vector<int> cnt(N + 1, 0);\n for (int i = 0; i < m; i++){\n for (int j = c[i]; j < d[i]; j++){\n cnt[j]++;\n }\n }\n int ans = N + 1;\n for (int i = 0; i <= N; i++){\n if (cnt[i] > 0){\n ans += 2;\n }\n }\n cout << ans << endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\nint n,m,a,b;\nvector<P> t,u;\n\n\nvector<P> func(vector<P> t){\n sort(t.begin(),t.end());\n t.push_back(P(1e9,0));\n int size=t.size();\n vector<P> res;\n for(int i=0;i+1<size;i++){\n if(t[i].second<t[i+1].first){\n res.push_back(t[i]);\n }else{\n t[i+1].first=t[i].first;\n t[i+1].second=max(t[i+1].second,t[i].second);\n }\n }\n return res;\n}\n\nint main(){\n cin>>n>>m;\n for(int i=0;i<m;i++){\n cin>>a>>b;\n t.push_back(P(a,b));\n }\n t=func(t);\n int ans=n+1;\n for(int i=0;i<(int)t.size();i++)\n ans+=(t[i].second-t[i].first)*2;\n cout<<ans<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\ntypedef long long LL;\n#define SORT(c) sort((c).begin(),(c).end())\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\nusing namespace std;\nint main(void)\n{\n int n,m;\n cin >> n >> m;\n int bac[1024]={};\n REP(i,m){\n int c,d;\n cin >> c >> d;\n bac[d-1]++;\n bac[c-1]--;\n }\n for(int i=n;i>0;--i)\n bac[i-1]+=bac[i];\n int answer=0;\n REP(i,n+1)\n if(bac[i]) answer+=3;\n else answer+=1;\n cout << answer << endl;\n \n return 0;\n}", "#include<iostream>\n#include<list>\n#include<string>\n#include<algorithm>\n#include <utility>\n#include<stdio.h>\n#include<climits>\n\nusing namespace std;\n\nint main(void){\n int n,m;\n int c,d;\n int f[1000] = {};\n cin >> n >> m;\n int i,j;\n for(i = 0;i < m;i++){\n cin >> c >> d;\n for(j = c;j < d;j++){\n f[j] = 1;\n }\n }\n for(i = 0,j = 0;i < n;i++){\n if(f[i]) j++;\n }\n cout << n+1+2*j << endl;\n}", "#include<iostream>\nusing namespace std;\nint main(){\n int n,m;\n cin >> n >> m;\n int p[1050]={};\n int i,j,k;\n for(i=0;i<m;i++){\n cin >> j >> k;\n p[j]=max(p[j],k);\n }\n int inf = 1<<15;\n int dp[1050][1050];\n fill(dp[0],dp[1049],inf);\n dp[0][0]=0;\n i=0;\n for(j=max(i+1,p[i+1]);j<=n+1;j++){\n dp[j][i+1]=min(dp[j][i+1],dp[i][i]+2*(j-i)-1);\n }\n for(i=1;i<=n+1;i++){\n if(i>=p[i])\n dp[i][i]=min(dp[i][i],dp[i-1][i-1]+1);\n \n for(j=p[i];j<=n+1;j++){\n dp[j][i]=min(dp[j][i],dp[j][i-1]+1);\n }\n \n for(j=max(i+1,p[i+1]);j<=n+1;j++){\n dp[j][i+1]=min(dp[j][i+1],dp[i][i]+2*(j-i)-1);\n }\n }\n\n //cout << dp[1000][2] << endl;\n\n /*\n for(i=0;i<=10;i++){\n for(j=0;j<=10;j++){\n //cout << dp[j][i] << \" \";\n printf(\"%3d \", dp[j][i]);\n }\n cout << endl;\n }\n */\n /*\n for(i=990;i<=1001;i++){\n for(j=990;j<=1001;j++){\n //cout << dp[j][i] << \" \";\n printf(\"%3d \", dp[j][i]);\n }\n cout << endl;\n }\n */\n \n \n int o=inf;\n o=min(o,dp[n+1][n+1]);\n cout << o << endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n\ntypedef pair<int,int> pi;\n\nint main()\n{\n int n,m;\n cin >>n >>m;\n\n vector<pi> s;\n //c?????????d?????????????????¨??????\n rep(i,m)\n {\n int c,d;\n scanf(\" %d %d\",&c,&d);\n if(c<d) s.pb(pi(c,d));\n }\n\n sort(all(s));\n\n int ans=n+1;\n int back=s[0].fi;\n int now=s[0].se;\n\n if(m>0)\n {\n rep(i,m-1)\n {\n if(now<s[i+1].fi)\n {\n ans+=2*(now-back);\n\n back=s[i+1].fi;\n now=s[i+1].se;\n }\n else\n {\n now=max(now,s[i+1].se);\n }\n }\n ans+=2*(now-back);\n }\n\n printf(\"%d\\n\", ans);\n return 0;\n}", "#include\"bits/stdc++.h\"\nusing namespace std;\nusing ll = int64_t;\n\nint main() {\n ll N, m;\n cin >> N >> m;\n vector<ll> restricts(N, -1);\n for (int i = 0; i < m; i++) {\n ll c, d;\n cin >> c >> d;\n c--; d--;\n restricts[c] = max(restricts[c], d);\n }\n\n ll ans = 0;\n ll left = INT_MAX;\n ll right = -1;\n for (ll curr_pos = 0; curr_pos < N; curr_pos++) {\n if (restricts[curr_pos] != -1) {\n right = max(right, restricts[curr_pos]);\n left = min(left, curr_pos);\n } else {\n if (curr_pos == right) {\n ans += 2 * (right - left);\n left = INT_MAX;\n }\n }\n ans++;\n }\n \n cout << ans + 1 << endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint n,m;\nbool b[3000]={};\n\nint main(){\n cin>>n>>m;\n while(m--){\n int l,r;\n cin>>l>>r;\n for(int i=l;i<r;i++){\n b[i]=true;\n }\n }\n\n int ans=0;\n for(int i=0;i<n+1;i++){\n if(b[i]) ans+=3;\n else ans++;\n }\n\n cout<<ans<<endl;\n}\n\n", "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\ntemplate<class T>\nusing Table = vector<vector<T>>;\n\n\nint main() {\n\tint N,m; cin >> N >> m;\n\tvector<int>backs(N, false);\n\tfor (int i = 0; i < m; ++i) {\n\t\tint t, f; cin >> t >> f;\n\t\tt--; f--;\n\t\tfor (int j = t; j < f; ++j) {\n\t\t\tbacks[j] = true;\n\t\t}\n\t}\n\tint ans = 1+N + 2*accumulate(backs.begin(), backs.end(), 0);\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n\nint main(){\n\tint N,M;\n\tcin >> N >> M;\n\tvector< pair<int,int> > e;\n\tint ans = N + 1 ;\n\tfor(int i = 0 ; i < M ; i++){\n\t\tint a,b;\n\t\tcin >> a >> b;\n\t\te.push_back(make_pair(a,b));\n\t}\n\tif( M == 0 ){\n\t\tcout << ans << endl;\n\t\treturn 0;\n\t}\n\tsort(e.begin(),e.end());\n\tint le = e[0].first;\n\tint ri = e[0].second;\n\tfor(int i = 1 ; i < M ; i++){\n\t\tif( ri < e[i].first ){\n\t\t\tans += 2 * (ri - le);\n\t\t\tle = e[i].first;\n\t\t\tri = e[i].second;\n\t\t}else ri = max(ri,e[i].second);\n\t}\n\tans += 2 * (ri-le);\n\tcout << ans << endl;\n\t\n}", "N, m = map(int, input().split())\nv = [0]*N\nfor i in range(m):\n c, d = map(int, input().split())\n v[c-1] += 1\n v[d-1] -= 1\ns = 0; fst = 0\nans = N+1\nfor i in range(N):\n if s == 0 and v[i] > 0:\n fst = i\n s += v[i]\n if s == 0 and v[i] < 0:\n ans += (i - fst)*2\nprint(ans)", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\n\n#define rep(i,n) for (int i=0;i<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define all(a) (a).begin(),(a).end()\n\ntypedef long long ll;\ntypedef pair<int, int> Pii;\ntypedef tuple<int, int, int> TUPLE;\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\ntypedef vector<vector<int>> Graph;\nconst int inf = 1e9;\nconst int mod = 1e9 + 7;\n\nsigned main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int N, m;\n cin >> N >> m;\n vector<Pii> v(m);\n rep(i, m) cin >> v[i].first >> v[i].second;\n\n sort(all(v));\n vector<Pii> u;\n rep(i, m) {\n if (!u.empty() && v[i].first <= u.back().second) {\n u.back().second = max(u.back().second, v[i].second);\n }\n else u.emplace_back(v[i]);\n }\n\n int ans = N + 1;\n for (auto p : u) {\n ans += 2 * (p.second - p.first);\n }\n cout << ans << endl;\n}", "#include <bits/stdc++.h>\n#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))\n#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntemplate<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}\ntemplate<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}\ntemplate<class T> T div_floor(T a, T b){\n if(b < 0) a *= -1, b *= -1;\n return a>=0 ? a/b : (a+1)/b-1;\n}\ntemplate<class T> T div_ceil(T a, T b){\n if(b < 0) a *= -1, b *= -1;\n return a>0 ? (a-1)/b+1 : a/b;\n}\n\nconstexpr lint mod = 1e9+7;\nconstexpr lint INF = mod * mod;\nconstexpr int MAX = 200010;\n\nint main(){\n int n, m;\n scanf(\"%d%d\", &n, &m);\n int a[n+2];\n memset(a, 0, sizeof(a));\n rep(i, m){\n int c, d;\n scanf(\"%d%d\", &c, &d);\n ++a[c]; --a[d];\n }\n partial_sum(a, a+n+2, a);\n int ans = n+1;\n int l = 0;\n while(l < n+1){\n if(a[l] == 0){\n ++l;\n continue;\n }\n int r = l;\n while(r < n+1 && a[r] > 0) ++r;\n ans += (r-l) * 2;\n l = r;\n }\n printf(\"%d\\n\", ans);\n}\n", "#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <algorithm>\n#include <sstream>\n#include <map>\n#include <set>\n\n#define REP(i,k,n) for(int i=k;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n#define INF 1<<30\n#define pb push_back\n#define mp make_pair\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint main() {\n\tint n, m;\n\tcin >> n >> m;\n\n\tvector<int> c(m), d(m);\n\trep(i, m) cin >> c[i] >> d[i];\n\n\tint cnt[1005];\n\tmemset(cnt, 0, sizeof(cnt));\n\n\trep(i, m) {\n\t\tREP(j, c[i], d[i]) {\n\t\t\tcnt[j]++;\n\t\t}\n\t}\n\n\tint ans = 3 * (n + 1);\n\trep(i, n + 1) {\n\t\tif(cnt[i] == 0) {\n\t\t\tans -= 2;\n\t\t}\n\t}\n\n\tcout << ans << endl;\n\n\treturn 0;\n}", "#include <cstdio>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n#define MAX 600\n\nstruct rest{\n int start, end;\n inline void set(int a, int b){ start = a; end = b; }\n bool operator < (const rest &a) const { return end < a.end; }\n} rests[MAX];\n\nint n, m, restlen;\nbool exist[MAX];\n\nint main(){\n int a, b;\n while(scanf(\"%d%d\", &n, &m) == 2){\n restlen = 0;\n memset(exist, true, sizeof(exist));\n \n for(int i = 0; i < m; i++){\n scanf(\"%d%d\", &a, &b);\n if(a < b){ rests[restlen].start = a; rests[restlen].end = b; restlen++; }\n }\n sort(rests, rests + restlen);\n \n for(int i = 0; i < m; i++){\n for(int j = i - 1; j >= 0; j--)\n if(exist[j] && rests[j].end >= rests[i].start){\n rests[i].start = min(rests[i].start, rests[j].start);\n exist[j] = false;\n }\n }\n \n int ans = n + 1;\n for(int i = 0; i < m; i++) \n if(exist[i]) ans += (rests[i].end - rests[i].start) << 1;\n printf(\"%d\\n\", ans);\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define MOD ((int)1e9+7)\n\n#define MAX 2000\n\nint N, m, ans;\nint c[MAX], d[MAX];\nint temp[MAX];\nsigned main(){\n \n cin>>N>>m;\n\n for(int i = 0; i < m; i++){\n cin>>c[i]>>d[i];\n temp[c[i]]++;\n temp[d[i]]--;\n }\n for(int i = 0; i <= N; i++){\n temp[i+1] += temp[i];\n }\n\n for(int i = 1; i < N; i++){\n if(temp[i]) ans += 2;\n }\n\t\n \n\n cout<<ans+N+1<<endl;\n\n return 0;\n}\n\n", "#include <cstdio>\n\nint n,m;\nint c[501],d[501];\nint cnt[1001];\nint main(void){\n\tscanf(\"%d %d\",&n,&m);\n\tfor(int i=0;i<m;i++){\n\t\tscanf(\"%d %d\",&c[i],&d[i]);\n\t\tfor(int j=c[i];j<d[i];j++){\n\t\t\tcnt[j]=1;\n\t\t}\n\t}\n\tint res=n+1;\n\tfor(int i=0;i<=n;i++){\n\t\tres+=cnt[i]*2;\n\t}\n\tprintf(\"%d\\n\",res);\n\treturn 0;\n}", "import java.util.*;\npublic class Main {\n\tScanner in = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tnew Main();\n\t}\n\n\tpublic Main(){\n\t\tnew C().doIt();\n\t}\n\t\n\tclass C{\n\t\tint n,c;\n\t\tArrayList<Pair> list;\n\t\tvoid doIt(){\n\t\t\tn = in.nextInt();\n\t\t\tc = in.nextInt();\n\t\t\tlist = new ArrayList<Pair>();\n\t\t\tfor(int i=0;i<c;i++)list.add(new Pair(in.nextInt(), in.nextInt()));\n\t\t\tCollections.sort(list);\n//\t\t\tSystem.out.println(list);\n\t\t\tint[] hyou = new int[n+1];\n\t\t\tfor(int i=1;i<=n;i++){\n\t\t\t\thyou[i] = hyou[i-1];\n\t\t\t\tfor(int s=0;s<c;s++){\n\t\t\t\t\tif(list.get(s).a==i)hyou[i]+=1;\n\t\t\t\t\telse if(list.get(s).b==i)hyou[i]-=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint memo = -1;\n\t\t\tfor(int i=1;i<=n;i++){\n\t\t\t\tif(hyou[i]>0){\n\t\t\t\t\tif(memo==-1)memo = i; \n\t\t\t\t\thyou[i] = -1;\n\t\t\t\t}else{\n\t\t\t\t\tif(hyou[i-1]==-1){\n\t\t\t\t\t\thyou[i] = memo;\n\t\t\t\t\t\tmemo = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint cnt = 0;\n\t\t\tfor(int i=0;i<=n;i++){\n\t\t\t\tif(hyou[i]>0){\n\t\t\t\t\tcnt += (i-hyou[i])*2;\n\t\t\t\t}\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\tSystem.out.println(cnt);\n\t\t}\n\t\t\n\t\tclass Pair implements Comparable<Pair>{\n\t\t\tint a,b;\n\t\t\tpublic Pair(int a,int b) {\n\t\t\t\tthis.a = a;\n\t\t\t\tthis.b = b;\n\t\t\t}\n\t\t\t\n\t\t\tpublic int compareTo(Pair o) {\n\t\t\t\treturn this.b-o.b;\n\t\t\t}\n\t\t\t\n\t\t\tpublic String toString(){\n\t\t\t\treturn \"[\"+a+\", \"+b+\"]\";\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\t\n}", "/*\n * c.cc: \n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n\nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 1000;\nconst int MAX_M = 500;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\n\n/* global variables */\n\npii rvs[MAX_M];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n cin >> n >> m;\n\n for (int i = 0; i < m; i++) cin >> rvs[i].first >> rvs[i].second;\n sort(rvs, rvs + m);\n\n int sum = 0, pci = -1, pdi = -1;\n for (int i = 0; i < m; i++) {\n int &ci = rvs[i].first, &di = rvs[i].second;\n if (pdi >= ci) {\n if (pdi < di) pdi = di;\n }\n else {\n sum += pdi - pci;\n pci = ci, pdi = di;\n }\n }\n sum += pdi - pci;\n\n printf(\"%d\\n\", n + 1 + sum * 2);\n return 0;\n}" ]
Problem N idols, numbered from 1 to n in order, are lined up in a row. Idle i can transmit information to idle i-1 and idle i + 1 in a unit time. However, idol 1 can transmit information only to idol 2, and idol n can transmit information only to idol n-1. At time 0, m idols with numbers a1, a2, ..., am have secret information. Find the minimum amount of time all idols can get confidential information. Constraints * 2 ≤ n ≤ 105 * 1 ≤ m ≤ n * 1 ≤ ai ≤ n * All ai values ​​are different * ai are given in ascending order Input The input is given in the following format. n m a1 a2 ... am Two integers n and m are given on the first line, separated by blanks. On the second line, m integers a1, a2, ..., am are given, separated by blanks. Output Outputs the minimum time that information is transmitted to all idles on one line. Examples Input 3 2 1 3 Output 1 Input 10 3 2 5 7 Output 3 Input 10 5 2 5 6 8 10 Output 1 Input 100000 1 1 Output 99999
[ "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst int inf=1e8;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\nint main(){\n\tint n,m;\n\tcin>>n>>m;\n\tvi in(m);\n\trep(i,m)cin>>in[i];\n\tint ma=in[0]-1;\n\trep(i,m-1){\n\t\tint q=in[i+1]-in[i];\n\t\tq/=2;\n\t\tma=max(ma,q);\n\t}\n\tma=max(ma,n-in[m-1]);\n\tcout<<ma<<endl;\n}", "n, m = map(int, input().split())\na =list(map(int, input().split()))\nt = max(a[0] - 1, n - a[-1])\nfor i in range(1, m):t = max(t, (a[i] - a[i - 1]) // 2)\nprint(t)\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint N, M;\n\tcin >> N >> M;\n\tlong long int ans = LLONG_MIN / 6;\n\tlong long int now;\n\tcin >> ans;\n\tnow = ans;\n\tans--;\n\tfor( size_t i = 1; i < M; i++ ) {\n\t\tlong long int a;\n\t\tcin >> a;\n\t\tans = max( (a - now) / 2, ans );\n\t\tnow = a;\n\t}\n\tans = max( N - now, ans );\n\tcout << ans << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\n\nint N, M, B[100000];\nint dp[100000][4];\n\nint rec(int idx, int dir)\n{\n if(idx < 0 || idx >= N) return(INF);\n if(~dp[idx][dir + 1]) return(dp[idx][dir + 1]);\n if(B[idx]) return(0);\n return(dp[idx][dir + 1] = rec(idx + dir, dir) + 1);\n}\n\nint main()\n{\n fill_n(*dp, 4 * 100000, -1);\n\n cin >> N >> M;\n for(int i = 0; i < M; i++) {\n int A;\n cin >> A;\n B[--A] = true;\n }\n int ret = 0;\n for(int i = 0; i < N; i++) {\n ret = max(ret, min(rec(i, -1), rec(i, +1)));\n }\n cout << ret << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp make_pair\n#define pb push_back\n#define all(x) begin(x),end(x)\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cerr<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> a(m);\n rep(i,m) cin>>a[i];\n\n int ans = max(a[0]-1, n - a.back());\n rep(i,m-1){\n ans = max(ans, (a[i+1] - a[i])/2);\n }\n cout << ans << endl;\n\n return 0;\n}\n\n", "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n int n, m;\n int a, last_a;\n int max_diff = 0;\n int diff;\n\n cin >> n >> m;\n\n cin >> a;\n last_a = a;\n max_diff = a -1;\n\n for (int i = 1; i < m; i++) {\n cin >> a;\n diff = a - last_a - 1;\n !(diff % 2) ? diff /= 2 : diff = diff / 2 + 1;\n if (diff > max_diff) max_diff = diff;\n last_a = a;\n }\n\n if (n - a > max_diff) max_diff = n - a;\n\n cout << max_diff << endl;\n}\n\n", "#include<bits/stdc++.h>\n\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define all(c) (c).begin(),(c).end()\n#define mp make_pair\n#define pb push_back\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)\n#define dbg(x) cerr<<__LINE__<<\": \"<<#x<<\" = \"<<(x)<<endl\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pi;\nconst int inf = (int)1e9;\nconst double INF = 1e12, EPS = 1e-9;\n\nint a[100000];\n\nint main(){\n\tint n, m; cin >> n >> m;\n\tint ans = 0;\n\trep(i, m) cin >> a[i];\n\trep(i, m - 1) ans = max(ans, (a[i + 1] - a[i]) / 2);\n\tans = max(ans, a[0] - 1);\n\tans = max(ans, n - a[m - 1]);\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(){\n int n,m;\n cin >> n >> m;\n if(m == 1){\n int a;\n cin >> a;\n cout << max(a-1,n-a) << endl;\n return 0;\n }\n vector<int> a(m);\n for(int i = 0; i < m; i++){\n cin >> a[i];\n }\n int ans = 0;\n for(int i = 0; i < m-1; i++){\n ans = max(ans,(a[i+1]-a[i])/2);\n }\n ans = max(ans,max(a[0]-1,n-a[m-1]));\n cout << ans << '\\n';\n return 0;\n}\n", "n, m = map(int, input().split())\nli = list(map(int, input().split()))\nprint(max(li[0]-1, n-li[-1], *[(li[i]-li[i-1])//2 for i in range(1,m)]))\n", "#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n\n int n, m, a[100000], ans=0;\n\n cin>>n>>m;\n for(int i=0;i<m;i++) cin>>a[i];\n\n for(int i=1;i<m;i++) ans=max(ans, (a[i]-a[i-1])/2);\n\n ans=max(ans, a[0]-1);\n ans=max(ans, n-a[m-1]);\n\n cout<<ans<<endl;\n\n return 0;\n}", "#define _USE_MATH_DEFINES\n#include <iostream>\n#include <fstream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nstruct init{\n\tinit(){\n\t\tcin.tie(0); ios::sync_with_stdio(false);\n\t}\n}________init;\nint main() {\n\n#ifdef INPUT_FROM_FILE\n\tifstream cin(\"sample.in\");\n\tofstream cout(\"sample.out\");\n#endif\n\tint n, m;\n\tcin >> n >> m;\n\tvector<int> a(m);\n\tfor (auto& it : a){\n\t\tcin >> it;\n\t}\n\tint res = 0;\n\tres = max(res, n - a[m - 1]);\n\tres = max(res, a[0] - 1);\n\tfor (int i = 1; i < m; i++){\n\t\tres = max(res, (a[i] - a[i - 1]) / 2);\n\t}\n\tcout << res << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <iomanip>\n#include <assert.h>\n#include <array>\n#include <cstdio>\n#include <cstring>\n#include <random>\n#include <functional>\n#include <numeric>\n#include <bitset>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nint main() {\n\n int N, M; cin >> N >> M;\n vector<int> v(N, inf);\n rep(i, M) {\n int x; cin >> x; x--;\n v[x] = 0;\n }\n\n REP(i, 1, N) {\n v[i] = min(v[i], v[i-1] + 1);\n }\n\n for(int i=N-2; i>=0; i--) {\n v[i] = min(v[i], v[i+1] + 1);\n }\n\n cout << *max_element(all(v)) << endl;\n\n return 0;\n}", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\n\npublic class Main{\n\tint N,M;\n\tint[] a;\n\tpublic void solve() {\n\t\tN = nextInt();\n\t\tM = nextInt();\n\t\ta = new int[M];\n\t\tfor(int i = 0;i < M;i++)a[i] = nextInt();\n\t\tint ans = 0;\n\t\tfor(int i = 0;i <= M;i++){\n\t\t\tif(i == 0)ans = Math.max(ans, a[i]-1);\n\t\t\telse if(i==M)ans = Math.max(ans,N-a[i-1]);\n\t\t\telse ans = Math.max(ans, (a[i]-a[i-1])/2);\n\t\t}\n\t\tout.println(ans);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tout.flush();\n\t\tnew Main().solve();\n\t\tout.close();\n\t}\n\n\t/* Input */\n\tprivate static final InputStream in = System.in;\n\tprivate static final PrintWriter out = new PrintWriter(System.out);\n\tprivate final byte[] buffer = new byte[2048];\n\tprivate int p = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (p < buflen)\n\t\t\treturn true;\n\t\tp = 0;\n\t\ttry {\n\t\t\tbuflen = in.read(buffer);\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\tif (buflen <= 0)\n\t\t\treturn false;\n\t\treturn true;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrint(buffer[p])) {\n\t\t\tp++;\n\t\t}\n\t\treturn hasNextByte();\n\t}\n\n\tprivate boolean isPrint(int ch) {\n\t\tif (ch >= '!' && ch <= '~')\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tprivate int nextByte() {\n\t\tif (!hasNextByte())\n\t\t\treturn -1;\n\t\treturn buffer[p++];\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = -1;\n\t\twhile (isPrint((b = nextByte()))) {\n\t\t\tsb.appendCodePoint(b);\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong() {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int n,m;\n cin >> n >> m;\n vector<int> a(m);\n cin >> a[0];\n int ma=0;\n for(int i=1;i<m;i++){\n cin >> a[i];\n int tmp = (a[i]-a[i-1])/2;\n ma = max(ma,tmp);\n }\n //cout << ma << endl;\n // cout << a[0]-1 << endl;\n ma = max(ma,n-a[m-1]);\n if(ma <= a[0]-1){\n cout << a[0]-1 << endl;\n }else{\n cout << ma << endl;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n,m;\n cin >> n >> m;\n int d[n],d2[n],ans=0;\n fill(d,d+n,1<<29);\n fill(d2,d2+n,1<<29);\n for(int i=0,x; i<m; i++) {\n cin >> x;\n d[x-1]=d2[x-1]=0;\n }\n for(int i=1; i<n; i++) d[i]=min(d[i],d[i-1]+1);\n for(int i=n-2; i>=0; i--) d2[i]=min(d2[i],d2[i+1]+1);\n for(int i=0; i<n; i++) ans=max(ans,min(d[i],d2[i]));\n cout << ans << endl;\n return 0;\n}\n", "/*\n * a.cc: \n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n\nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\n\n/* typedef */\n\n/* global variables */\n\nint as[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n cin >> n >> m;\n for (int i = 0; i < m; i++) (cin >> as[i]), as[i]--;\n\n int ans = max(as[0], n - 1 - as[m - 1]);\n\n for (int i = 0; i < m - 1; i++) {\n int c = (as[i + 1] - as[i]) / 2;\n if (ans < c) ans = c;\n }\n\n printf(\"%d\\n\", ans);\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint t[100000];\nint main(){\n\tint n,m;\tcin>>n>>m;\n\tvector<int> a(m);\n\tfor(int i=0;i<n;i++)\tt[i]=1e9;\n\tqueue<int> q;\n\tfor(int i=0;i<m;i++){\n\t\tcin>>a[i];\ta[i]--;\n\t\tt[a[i]]=0;\n\t\tq.push(a[i]);\n\t}\n\twhile(!q.empty()){\n\t\tint cur=q.front();\tq.pop();\n\t\tif(cur+1<n){\n\t\t\tif(t[cur+1]>t[cur]+1){\n\t\t\t\tt[cur+1]=t[cur]+1;\n\t\t\t\tq.push(cur+1);\n\t\t\t}\n\t\t}\n\t\tif(cur-1>=0){\n\t\t\tif(t[cur-1]>t[cur]+1){\n\t\t\t\tt[cur-1]=t[cur]+1;\n\t\t\t\tq.push(cur-1);\n\t\t\t}\n\t\t}\n\t}\n\tint ans=0;\n\tfor(int i=0;i<n;i++)\tans=max(ans,t[i]);\n\tcout<<ans<<endl;\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <stack>\n#include <queue>\n#include <utility>\n#define rep(i,l,n) for(lint i=l;i<n;i++)\n#define rer(i,l,n) for(lint i=l;i<=n;i++)\n#define all(a) a.begin(),a.end()\n#define o(a) cout<<a<<endl\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef vector<int> vi;\ntypedef vector<lint> vli;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\n\n\nint main(){\n\tint n,m;\n\tcin>>n>>m;\n\tvi know(m+1);\n\trep(i,0,m) cin>>know[i];\n\tknow[m]=1e8;\n\tint MAX=0,l=0,r=1;\n\trep(i,1,n+1){\n\t\tif(i==know[r]){\n\t\t\tl=r; r++;\n\t\t}\n\t\tint tmp=min(know[r]-i,abs(i-know[l]));\n\t\tMAX=max(tmp,MAX);\n\t}\n\to(MAX);\n}", "#define _USE_MATH_DEFINES\n\n#include<stdio.h>\n#include<stdlib.h>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<queue>\n#include<iostream>\n#include<fstream>\n#include<iomanip>\n\nusing namespace std;\n\nint n, m;\nint data[100000];\n\nint main(){\n\tscanf(\"%d%d\", &n, &m);\n\tfor (int i = 0; i < m; ++i){\n\t\tscanf(\"%d\", &data[i]);\n\t}\n\n\tint Max = data[0] - 1;\n\tfor (int i = 1; i < m; ++i) {\n\t\tif ((data[i] - data[i - 1])/2>Max){\n\t\t\tMax = (data[i] - data[i - 1])/2;\n\t\t}\n\t}\n\tif (n - data[m - 1] > Max) {\n\t\tMax = n - data[m - 1];\n\t}\n\tprintf(\"%d\\n\", Max);\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define pb push_back\n#define mp make_pair\n#define fr first\n#define sc second\n#define Rep(i, n) for( int i = 0; i < (n); i++ )\n#define Rrep(i, a, n) for( int i = (a); i < (n); i++ )\n#define All(v) v.begin(), v.end()\n\ntypedef pair<int, int> Pii;\ntypedef pair<int, Pii> Pip;\nconst int INF = 1107110711071107;\n\nsigned main() {\n int n, m;\n cin >> n >> m;\n\n int a[100010];\n Rep(i, m) cin >> a[i];\n\n int mx = 0;\n for ( int i = 0; i < m-1; i++ ) {\n mx = max(mx, (a[i+1]-a[i]) / 2);\n }\n\n cout << max(mx, max(a[0]-1, n - a[m-1])) << endl;\n}", "#include <iostream>\n#include <queue>\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n\n\nusing namespace std;\n\nint main() {\n\n int n; cin >> n;\n int m; cin >> m;\n\n vector<int> a;\n rep(i, m) {\n int x; cin >> x; x--;\n a.push_back(x);\n }\n\n int ans = 0;\n\n REP(i, 0, (int)a.size()-1) {\n ans = max(ans, (a[i+1]-a[i]) / 2);\n }\n\n if(a[0] != 0) {\n ans = max(ans, a[0]);\n }\n\n\n if(a[m-1] != n-1) {\n ans = max(ans, n - a[m-1] - 1);\n }\n\n cout << ans << endl;\n\n\n return 0;\n}", "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;++i)\n#define FOR(i,a,b) for(int i=a;i<=b;++i)\n#define LL long long\n#define Fi first\n#define Se second\nusing namespace std;\nstatic const LL INF = 1LL<<61LL;\ntypedef pair<int,int> PII;\n\nint N,M;\nint A[100010];\nint temp=1;\nint ans;\n\nint main(){\n cin>>N>>M;\n rep(i,M){\n int a;\n cin>>a;\n A[a]=1;\n }\n FOR(i,1,N){\n //cout<<temp<<endl;\n if(A[i]==1){\n if(temp==1&&A[1]!=1){\n int t=(i-temp);\n temp=i;\n ans=max(ans,t);\n continue;\n }\n int t=(i-temp-1)/2;\n if(i-temp-1<=0)t=0;\n else if((i-temp-1)%2!=0)t++;\n temp=i;\n ans=max(ans,t);\n }\n else if(i==N){\n ans=max(ans,N-temp);\n }\n }\n cout<<ans<<endl;\n}", "#include <iostream>\nusing namespace std;\nint main(){\n int n,m,a[100000],r=0;;\n cin>>n>>m;\n for(int i=0;i<m;i++) cin>>a[i];\n r=max(a[0]-1,n-a[m-1]);\n for(int i=1;i<m;i++) r=max(r,(a[i]-a[i-1])/2);\n cout<<r<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nusing namespace std;\nint N,M,a[100000];\nint main(){\n\tcin>>N>>M;\n\trep(i,M) cin>>a[i];\n\tint ans=0;\n\trep(i,M-1) chmax(ans,(a[i+1]-a[i])/2);\n\tchmax(ans,a[0]-1);\n\tchmax(ans,N-a[M-1]);\n\tcout<<ans<<endl;\n}", "n,m = map(int,input().split())\na = list(map(int,input().split()))\nc = [a[0]-1, n-a[m-1]]\nfor i in range(m-1):\n c.append((a[i+1]-a[i])//2)\nprint(max(c))\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef complex<double> P;\ntypedef pair<int,int> pii;\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define REPR(i,n) for(ll i=1;i<n;++i)\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define MOD (ll)(1e9+7)\n#define ADD(a,b) a=((a)+(b))%MOD\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\nint main(){\n int n,m;\n cin>>n>>m;\n vi a(m);\n REP(i,m)cin>>a[i];\n REP(i,m)--a[i];\n vi d(n,1145141919);\n queue<int> Q;\n REP(i,m){\n d[a[i]]=0;\n Q.push(a[i]);\n }\n while(!Q.empty()){\n int p = Q.front(); Q.pop();\n if(p>0){\n if(d[p-1]>d[p]+1){\n d[p-1] = d[p]+1;\n Q.push(p-1);\n }\n }\n if(p<n-1){\n if(d[p+1]>d[p]+1){\n d[p+1] = d[p]+1;\n Q.push(p+1);\n }\n }\n }\n int res = 0;\n REP(i,n)res=max(res,d[i]);\n cout<<res<<endl;\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\nint n,m;\nint a[200005];\nint b[200005];\n\nint main() {\n cin>>n>>m;\n rep(i,m) cin>>a[i];\n rep(i,m) a[i]--;\n rep(i,200005) b[i]=1e8;\n rep(i,m) b[a[i]]=0;\n rep(i,n) if(i) {\n b[i]=min(b[i],b[i-1]+1);\n }\n for(int i=n-1;i>=0;i--) if(i+1!=n) b[i]=min(b[i],b[i+1]+1);\n\n int ans=0;\n rep(i,n) ans=max(ans,b[i]);\n cout<<ans<<endl;\n return 0;\n}", "#include<iostream>\n#include<vector>\n#include<cassert>\n#include<string>\n#include<algorithm>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<tuple>\n#include<numeric>\nusing namespace std;\n\ntypedef pair<int,int> pii;\ntypedef long long ll;\ntypedef ll int__;\n#define rep(i,j) for(int__ i=0;i<(int__)(j);i++)\n#define repeat(i,j,k) for(int__ i=(j);i<(int__)(k);i++)\n#define all(v) v.begin(),v.end()\n\ntemplate<typename T>\nostream& operator << (ostream &os , const vector<T> &v){\n rep(i,v.size()) os << v[i] << (i!=v.size()-1 ? \" \" : \"\\n\"); return os;\n}\n\ntemplate<typename T>\nistream& operator >> (istream &is , vector<T> &v){\n rep(i,v.size()) is >> v[i]; return is;\n}\n\n\nbool solve(){\n int n, m; cin >> n >> m;\n vector<int> a(m); cin >> a;\n int ans = max(a[0] - 1, n - a.back());\n rep(i, m-1){\n ans = max(ans, (a[i+1] - a[i]) / 2);\n }\n cout << ans << endl;\n return false;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n while(solve());\n return 0;\n}", "#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#define pb push_back\n#define rep(i,n) for (int i = 0; i < n; ++i)\n#define rrep(i,n) for (int i = 1; i <= n; ++i)\n#define drep(i,n) for (int i = (n)-1; i >= 0; --i)\n#define mins(x,y) x = min(x,y)\n#define maxs(x,y) x = max(x,y)\nusing namespace std;\ntypedef vector<int> vi;\n\nconst int MX = 100005;\nconst int INF = 1001001001;\n\nint n, m;\nint a[MX];\n\nint main() {\n scanf(\"%d%d\",&n,&m);\n rrep(i,n) a[i] = INF;\n rep(i,m) {\n int x;\n scanf(\"%d\",&x);\n a[x] = 0;\n }\n rrep(i,n) mins(a[i+1],a[i]+1);\n drep(i,n) mins(a[i],a[i+1]+1);\n int ans = 0;\n rrep(i,n) maxs(ans, a[i]);\n cout<<ans<<endl;\n return 0;\n}", "n, m = map(int, input().split())\nlst = [100000 for _ in range(n)]\na_lst = list(map(int, input().split()))\nfor a in a_lst:\n lst[a - 1] = 0\nfor i in range(n - 1):\n lst[i + 1] = min(lst[i] + 1, lst[i + 1])\nfor i in range(n - 1, 0, -1):\n lst[i - 1] = min(lst[i - 1], lst[i] + 1)\nprint(max(lst))\n", "# AOJ 1574: Gossip\n# Python3 2018.7.13 bal4u\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\npre = a[0]; d = 0\nfor x in a[1:]:\n\td = max(d, x-pre)\n\tpre = x\nprint(max(n-pre, max(d>>1, a[0]-1)))\n", "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n\tint n,m;cin>>n>>m;\n\tint ans=0;\n\tint b;\n\tfor(int i=0;i<m;i++){\n\t\tint a;cin>>a;\n\t\tif(i==0)ans=max(ans,a-1);\n\t\telse ans=max(ans,(a-b)/2);\n\t\tb=a;\n\t}\n\tans=max(ans,n-b);\n\tcout<<ans<<endl;\n\treturn 0;\n}\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\n\ndef solve(n, received):\n not_relayed = received.copy()\n for t in range(n + 1):\n if len(received) >= n:\n return t\n new_not_relayed = set()\n for person in not_relayed:\n if person >= 1:\n if (person - 1) not in received:\n received.add(person - 1)\n new_not_relayed.add(person - 1)\n if person <= n - 2:\n if (person + 1) not in received:\n received.add(person + 1)\n new_not_relayed.add(person + 1)\n not_relayed = new_not_relayed\n\n\ndef main():\n n, m = map(int, input().split())\n received_people = set(map(lambda x: int(x) - 1, input().split()))\n print(solve(n, received_people.copy()))\n\n\nif __name__ == '__main__':\n main()", "import java.io.PrintWriter;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tPrintWriter pw=new PrintWriter(System.out);\n\t\tScanner sc=new Scanner(System.in);\n\t\t\n\t\t\n\t\tint n=sc.nextInt();\n\t\tint m=sc.nextInt();\n\t\t\n\t\tint[] L=new int[m];\n\t\t\n\t\tfor(int i=0;i<m;i++){\n\t\t\tL[i]=sc.nextInt();\n\t\t}\n\t\tint gap=0;\n\t\tfor(int i=0;i<m-1;i++){\n\t\t\tif(gap<Math.abs(L[i]-L[i+1])){\n\t\t\t\tgap=Math.abs(L[i]-L[i+1]);\n\t\t\t}\n\t\t}\n\n\t\tif(gap<Math.abs(L[0]-(1-L[0]))){\n\t\t\tgap=Math.abs(L[0]-(1-L[0]));\n\t\t}\n\t\tif(gap<Math.abs(L[m-1]-(n+1+n-L[m-1]))){\n\t\t\tgap=Math.abs(L[m-1]-(n+1+n-L[m-1]));\n\t\t}\n\t\tif((gap-1)%2==0){\n\t\t\tpw.println((gap-1)/2);\n\t\t}\n\t\tif((gap-1)%2==1){\n\t\t\tpw.println((gap-1-1)/2+1);\n\t\t}\n\t\t\n\t\tsc.close();\n\t\tpw.close();\n\t}\n\n}", "#include <iostream>\n#include <algorithm>\n\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n\nusing namespace std;\n\nint n, m;\nint a[100000];\n\nint main(){\n cin >> n >> m;\n rep(i, m){\n cin >> a[i];\n }\n int ans = max(a[0] - 1, n - a[m - 1]);\n rep(i, m - 1){\n ans = max((a[i + 1] - a[i]) / 2, ans);\n }\n cout << ans << endl;\n return 0;\n}", "#include <cstdio>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n\n int n, m, t, prev = 1, curr, ans = 0;\n scanf(\"%d %d\", &n, &m);\n\n scanf(\"%d\", &curr);\n if (curr > 1) {\n ans = curr - 1;\n prev = curr;\n }\n for (int i = 1; i < m; i++) {\n scanf(\"%d\", &curr);\n t = (curr - prev) / 2;\n ans = max(ans, t);\n prev = curr;\n }\n if (prev < n) {\n t = n - prev;\n ans = max(ans, t);\n }\n printf(\"%d\\n\", ans);\n return 0;\n}\n\n", "/* _/ _/ _/_/_/ _/\n _/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/\n _/ _/ _/ _/ _/ _/ _/_/_/ _/\n _/ _/ _/ _/ _/ _/ _/ _/ _/\n _/_/ _/_/ _/_/ _/_/ _/_/ _/ */\n#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<iomanip>\n#include<set>\n#include<map>\n#include<queue>\n#include<vector>\nusing namespace std;\nusing ll=long long;\nconst int MOD=1e9+7;\nconst double pi=3.14159265358979323846;\nconst int inf=2e9;\nconst ll INF=1e18;\nusing P=pair<int,int>;\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\nint main() {\n cin.tie(0),cout.tie(0);\n ios::sync_with_stdio(false);\n int n,m,a,x[100005]={},ans=0;\n cin >> n >> m;\n for(int i=1; i<=n; i++) {\n x[i]=inf;\n }\n for(int i=0; i<m; i++) {\n cin >> a;\n x[a]=0;\n }\n for(int i=2; i<=n; i++) {\n if(x[i-1]!=inf) {\n x[i]=min(x[i-1]+1,x[i]);\n }\n }\n for(int i=n-1; i>=1; i--) {\n if(x[i+1]!=inf) {\n x[i]=min(x[i+1]+1,x[i]);\n }\n }\n for(int i=1; i<=n; i++) {\n ans=max(ans,x[i]);\n }\n cout << ans << endl;\n}\n", "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint max = 0;\n int prev = 0;\t\t\n\t\tfor (int i = 0; i < m; i++) {\n\t\t int x = sc.nextInt();\n\t\t max = Math.max((x - prev) / 2, max);\n\t\t prev = x;\n\t\t if (i == 0) {\n\t\t max = Math.max(max, x - 1);\n\t\t } \n\t\t if(i == m - 1) {\n\t\t max = Math.max(max, n - x);\n\t\t }\n\t\t}\n\t System.out.println(max);\n\t}\n}\n\n", "#include <iostream>\n\nusing namespace std;\n\nint N,M;\nconst int MAX_N = 100010;\nconst int INF = 1 << 20;\nint A[MAX_N];\nint Left[MAX_N];\nint Right[MAX_N];\nint main(){\n cin >> N >> M;\n int result = 0;\n\n for (int i = 0; i < M; i++){\n int x;\n cin >> x;\n x--;\n A[x]++;\n }\n int tmp = INF;\n for (int i = 0; i < N; i++){\n\n if (A[i]){\n tmp = 0;\n }\n Left[i] = tmp; \n tmp++;\n }\n tmp = INF;\n for (int i = N - 1; i >= 0; i--){\n \n if (A[i]){\n tmp = 0;\n }\n Right[i] = tmp; \n tmp++;\n }\n int res = 0;\n for (int i = 0; i < N; i++){\n res = max(res, min(Left[i], Right[i]));\n }\n cout << res << endl;\n return 0;\n}", "#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main() {\n\n int n, m, i, in, def = 0, ans = 0, before = 0;\n\n cin >> n >> m;\n \n for(i = 0; i < m; i++) {\n cin >> in;\n \n if(i == 0 && in != 1) {\n def = in - 1;\n }\n\n else def = (in-before)/2 +0.5;\n\n ans = max(ans, def);\n\n before = in;\n }\n\n ans = max(ans, n - in);\n cout << ans << endl;\n\n return 0;\n}", "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int n, m, d;\n\n cin >> n >> m;\n\n bool a[n+2];\n for( int i = 0; i < n + 2; i++ )\n a[i] = 0;\n a[0] = a[n+1] = 1;\n\n int ma = 0;\n for( int i = 0; i < m; i++ )\n {\n cin >> d;\n if( i == 0 )\n ma = d - 1;\n if( i == m - 1 )\n ma = max( ma, n - d );\n a[d] = 1;\n }\n\n int sum = 0;\n for( int i = 0; i < n + 2; i++ )\n {\n if( a[i] )\n sum = 0;\n if( !a[i] )\n sum++;\n if( ma < ( sum + 1 ) / 2 )\n ma = ( sum + 1 ) / 2;\n }\n\n cout << ma << endl;\n\n return 0;\n}\n", "#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n#include <cassert>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n\n#define MOD 1000000007LL\n#define EPS 1e-8\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\n#define maxs(x,y) x=max(x,y)\n#define mins(x,y) x=min(x,y)\n\nvoid mainmain(){\n\tint ans=0;\n\tint n,m;\n\tcin>>n>>m;\n\tvint v(m);\n\trep(i,m){\n\t\tcin>>v[i];\n\t}\n\tsort(ALL(v));\n\trep(i,v.size()-1){\n\t\tmaxs(ans,v[i+1]-v[i]-1);\n\t}\n\tans=(ans+1)/2;\n\t// cout<<ans<<endl;\n\tmaxs(ans,v[0]-1);\n\tmaxs(ans,n-v.back());\n\tcout<<ans<<endl;\n}\n\n\nsigned main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout<<fixed<<setprecision(20);\n mainmain();\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\tint N, M; cin >> N >> M;\n\tvector<int>v;\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a; cin >> a;\n\t\tv.emplace_back(a);\n\t}\n\tint ans = 0;\n\tans = max(ans, v[0] - 1);\n\tans = max(ans, N - v.back());\n\tfor (int i = 0; i < M-1; ++i) {\n\t\tans = max(ans, (v[i + 1] - v[i]) / 2);\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "import java.util.BitSet;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n//\t\tint[] a = new int[n];\n\t\tBitSet bs = new BitSet(n);\n\t\tfor(int i=0; i<m; i++){\n//\t\t\ta[in.nextInt()] = 1;\n\t\t\tbs.set(in.nextInt()-1);\n\t\t}\n\t\tint bf = -1;\n\t\tint[] dist = new int[n];\n\t\tfor(int i=0; i<n; i++){\n\t\t\tif(bs.get(i)) bf = i;\n\t\t\tif(bf>=0){\n\t\t\t\tdist[i] = Math.abs(i-bf);\n\t\t\t}else{\n\t\t\t\tdist[i] = Integer.MAX_VALUE;\n\t\t\t}\n\t\t}\n\t\tbf = -1;\n\t\tfor(int i=n-1; i>=0; i--){\n\t\t\tif(bs.get(i)) bf = i;\n\t\t\tif(bf>=0){\n\t\t\t\tdist[i] = Math.min(dist[i], Math.abs(i-bf));\n\t\t\t}\n\t\t}\n\t\tint max = 0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\t\n\t\t}\n\t\tfor(int i=0; i<n; i++) max = Math.max(max, dist[i]);\n\t\tSystem.out.println(max);\n\t}\n}", "#include <fstream>\n#include <iostream>\n#include <vector>\n#include <iomanip>\n#include <algorithm>\n\nusing namespace std;\n#define ALL(c) (c).begin(), (c).end()\n#define REP(i,n) for(ll i=0; i < (n); ++i)\nusing ll = long long;\nusing vl = vector<ll>;\nint main(){\n#ifdef _WIN32\n\tifstream cin(\"sample.in\");\n\tofstream cout(\"sample.out\");\n#endif\n\tcout << fixed << setprecision(8);\n\tll n, m; cin >> n >> m;\n\tvl a(m); REP(i, m) cin >> a[i];\n\tREP(i, m) a[i]--;\n\n\tsort(ALL(a));\n\tll mi = 0;\n\tREP(i, n){\n\t\tauto it = lower_bound(ALL(a), i);\n\t\tll mii = 100000;\n\t\tif(it != a.end()) mii = min<ll>(mii, abs(*it - i));\n\t\tif (it != a.begin()) mii = min<ll>(mii, abs(*--it - i));\n\t\tmi = max(mi, mii);\n\t}\n\n\tcout << mi << endl;\n}", "# -*- coding: utf-8 -*-\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\nma = a[0] - 1\nfor i in range(m-1):\n ma = max(ma, (a[i + 1] - a[i]) // 2)\nma = max(ma, n - a[-1])\n\nprint(ma)", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint n,m;\nint a[100001];\n\nint main(void){\n\tscanf(\"%d%d\",&n,&m);\n\tfor(int i=0;i<m;i++){\n\t\tscanf(\"%d\",&a[i]);\n\t}\n\tint ans=max(a[0]-1,n-a[m-1]);\n\tfor(int i=0;i<m-1;i++){\n\t\tans=max(ans,(a[i+1]-a[i])/2);\n\t}\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}\n", "n,m=map(int,input().split(\" \"))\na=list(map(int,input().split(\" \")))\nprint(max(a[0]-1,n-a[-1],*[(a[i+1]-a[i])//2 for i in range(m-1)]))\n", "#include <stdio.h>\n\nint main(void) {\n int m, n, i, j, be = 1, ans = 0, t;\n scanf(\"%d%d\", &n, &m);\n for(i = 0; i < m; ++i) {\n scanf(\"%d\", &t);\n if(!i) ans = t - 1;\n else if((t - be) / 2 > ans) ans = (t - be) / 2;\n be = t;\n }\n if(n - be > ans) ans = n - be;\n printf(\"%d\\n\", ans);\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nint main(){\n int n,m;\n cin >>n >>m;\n\n const int INF = 10000000;\n vector<int> a;\n a.pb(-INF);\n rep(i,m){\n int v;\n cin >>v;\n a.pb(v);\n }\n a.pb(INF);\n\n int idx = 0;\n int ans = 0;\n for(int i=1; i<=n; ++i){\n ans = max(ans, min(i-a[idx], a[idx+1]-i));\n if(a[idx+1] == i) ++idx;\n }\n cout << ans << endl;\n return 0;\n}\n\n", "#include<iostream>\nusing namespace std;\n\nint main(){\n\tint sum;\n\twhile(cin >> sum){\n\t\tint number, info[100005], ans;\n\t\tcin >> number;\n\t\tfor(int i = 0; i < number; i++){\n\t\t\tcin >> info[i];\n\t\t}\n\t\n\t\t\tfor(int i = 0; i < number + 1; i++){\n\t\t\t\tif(!i){\n\t\t\t\t\tans = info[i] - 1;\n\t\t\t\t}else if(i == number){\n\t\t\t\t\tans = max(ans, sum - info[i - 1]);\n\t\t\t\t}else{\n\t\t\t\t\tint a = (info[i] - info[i - 1]) / 2;\n\t\t\t\t\tans = max(ans, a);\n\t\t\t\t}\t\n\t\t\t}\t\t\n\t\t\tcout << ans << endl;\n\t}\n}", "/*\n _ooOoo_\n o8888888o\n 88\" . \"88\n (| -_- |)\n O\\ = /O\n ____/`---'\\____\n .' \\\\| |// `.\n / \\\\||| : |||// \\\n / _||||| -:- |||||- \\\n | | \\\\\\ - /// | |\n | \\_| ''\\---/'' | |\n \\ .-\\__ `-` ___/-. /\n ___`. .' /--.--\\ `. . __\n .\"\" '< `.___\\_<|>_/___.' >'\"\".\n | | : `- \\`.;`\\ _ /`;.`/ - ` : | |\n \\ \\ `-. \\_ __\\ /__ _/ .-` / /\n======`-.____`-.___\\_____/___.-`____.-'======\n `=---='\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n pass System Test!\n*/\n#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& v) {\n if (!v.empty()) {\n out << '[';\n std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, \", \"));\n out << \"\\b\\b]\";\n }\n return out;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int N, M;\n cin >> N >> M;\n set<int> a;\n for (int i = 0; i < M; ++i) {\n int b;\n cin >> b;\n b--;\n a.insert(b);\n }\n\n int ma = 0;\n for (int i = 0; i < N; ++i) {\n if (i >= *(a.rbegin())) {\n ma = max(ma, i - *(a.rbegin()));\n continue;\n }\n\n auto it = a.lower_bound(i);\n int mi = N;\n mi = min(mi, *it - i);\n if (it != a.begin()) {\n it--;\n mi = min(mi, i - *it);\n }\n // cerr << mi << endl;\n ma = max(ma, mi);\n }\n cout << ma << endl;\n}", "#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define LINF (ll)INF*INF\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(int i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vp;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a/gcd(a,b)*b;\n}\n\n\nsigned main(void) {\n int n,m;\n cin >> n >> m;\n vi a(m);\n rep(i,m)cin >> a[i];\n int ans = max(a[0]-1, n-a[m-1]);\n rep(i,m-1){\n ans = max(ans, (a[i+1]-a[i])/2);\n }\n cout << ans << endl;\n}\n\n", "#include <iostream>\n#include <vector>\n\nint main()\n{\n int n, m;\n std::cin >> n >> m;\n \n std::vector<int> min_t(n, (1 << 29));\n for (int i = 0; i < m; i++) {\n int a;\n std::cin >> a;\n min_t[a - 1] = 0;\n }\n\n for (int i = 1; i < n; i++) {\n min_t[i] = std::min(min_t[i], min_t[i - 1] + 1);\n }\n\n for (int i = n - 2; i >= 0; i--) {\n min_t[i] = std::min(min_t[i], min_t[i + 1] + 1);\n }\n\n int ret = 0;\n for (int t : min_t) {\n ret = std::max(ret, t);\n }\n\n std::cout << ret << std::endl;\n \n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cmath>\n#define rep(i,a,b) for(int (i)=(a);i<(b);i++)\n#define INF 100000000\n#define MAX_N 1000000\nusing namespace std;\n\nint main(){\n int n,m,a=0,b=0;\n cin>>n>>m;\n int ans=0;\n cin>>a;\n int z=a;\n b=a;\n rep(i,1,m){\n cin>>a;\n ans=max(a-b,ans);\n //cout<<ans<<endl;\n b=a;\n }\n //cout<<ans<<endl;\n if(ans/2<n-a&&z-1<n-a){\n cout<<n-a<<endl;\n }else{\n cout<<max(ans/2,z-1)<<endl;\n }\n return 0;\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nint main(){\n\n\tint N,M;\n\tscanf(\"%d %d\",&N,&M);\n\n\tint left_len,maximum = 0,right_len,tmp,pre;\n\n\tscanf(\"%d\",&tmp);\n\n\tleft_len = tmp-1;\n\tpre = tmp;\n\n\tif(M == 1){\n\t\tright_len = N-tmp;\n\t\tprintf(\"%d\\n\",max(left_len,right_len));\n\t}else{\n\n\t\tfor(int i = 0; i < M-1; i++){\n\t\t\tscanf(\"%d\",&tmp);\n\t\t\tmaximum = max(maximum,tmp-pre);\n\t\t\tpre = tmp;\n\t\t}\n\t\tright_len = N-tmp;\n\n\t\tprintf(\"%d\\n\",max(max(left_len,right_len),maximum/2));\n\t}\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\ntypedef long long ll;\ntypedef pair<int,int>pint;\ntypedef vector<int>vint;\ntypedef vector<pint>vpint;\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\ntemplate<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}\ntemplate<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}\n\nint N,M;\nint dp[111111];\nsigned main(){\n cin>>N>>M;\n fill_n(dp,N,1<<25);\n rep(i,M){\n int a;\n cin>>a;\n dp[--a]=0;\n }\n\n reps(i,1,N)chmin(dp[i],dp[i-1]+1);\n for(int i=N-2;i>=0;i--)chmin(dp[i],dp[i+1]+1);\n\n cout<<*max_element(dp,dp+N)<<endl;\n return 0;\n}", "#include<iostream>\n#include<iomanip>\n#include<string>\n#include<cstdlib>\n#include<cmath>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n\n\nusing namespace std;\n\n\nint main() {\n\tint n,m;\n\tcin >> n >> m;\n\n\tint count = 0;\n\tint input;\n\tint ex;\n\tfor(int i=0; i<m; i++) {\n\t\tcin >> input;\n\t\tif(i == 0 && input-1 > count) count = input-1;\n\t\tif(i == m-1 && n-input > count) count = n-input;\n\t\tif(i != 0 && (input-ex)/2 > count) count = (input-ex)/2;\n\t\tex=input;\n\t}\n\n\tcout << count << endl;\n\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n\nint main()\n{\n\tint n ;\n\tint m;\n\tint a[100000];\n\tint b;\n\tint ans = 0;\n\tcin >> n >> m;\n\tfor (int i = 0; i < m; i++){\n\t\tcin >> a[i];\n\t}\n\n\tfor (int i = 0; i < m + 1; i++){\n\t\tif (i == 0){\n\t\t\tb = a[i] - 1;\n\t\t} else if (i == m){\n\t\t\tb = n - a[i - 1];\n\t\t}\n\t\telse{\n\t\t\tb = a[i] - a[i-1] - 1;\n\t\t\tif (b % 2 == 0){\n\t\t\t\tb /= 2;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tb++;\n\t\t\t\tb /= 2;\n\t\t\t}\n\t\t}\n\t\tans = max(b, ans);\n\t}\n\n\tcout << ans << endl;\n\t\t\n\treturn 0;\n}", "#include <bits/stdc++.h>\ntypedef long long LL;\n#define SORT(c) sort((c).begin(),(c).end())\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\nusing namespace std;\nint main(void)\n{\n int n,m;\n cin >> n >> m;\n vector<int> se;\n se.resize(m);\n REP(i,m) cin >> se[i];\n int answer=0;\n answer=max(answer,se[0]-1);\n REP(i,m-1) answer=max(answer,(se[i+1]-se[i])/2);\n answer=max(answer,n-se[m-1]);\n cout << answer << endl;\n return 0;\n}", "#include <string>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <set>\n#include <map>\n#include <queue>\n#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <cctype>\n#include <cassert>\n#include <limits>\n#include <functional>\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))\n#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))\n#if defined(_MSC_VER) || __cplusplus > 199711L\n#define aut(r,v) auto r = (v)\n#else\n#define aut(r,v) __typeof(v) r = (v)\n#endif\n#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)\n#define all(o) (o).begin(), (o).end()\n#define pb(x) push_back(x)\n#define mp(x,y) make_pair((x),(y))\n#define mset(m,v) memset(m,v,sizeof(m))\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3fLL\nusing namespace std;\ntypedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;\ntemplate<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }\ntemplate<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }\n\nint main() {\n\tint n; int m;\n\twhile(~scanf(\"%d%d\", &n, &m)) {\n\t\tvector<int> a(m);\n\t\tfor(int i = 0; i < m; ++ i)\n\t\t\tscanf(\"%d\", &a[i]), -- a[i];\n\t\tint ans = max(a[0], n - 1 - a[m-1]);\n\t\trep(i, m - 1)\n\t\t\tamax(ans, (a[i + 1] - a[i]) / 2);\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <iostream>\n#include <vector>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <utility>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <functional>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int, int> pii;\n\n#define fst first\n#define scd second\n#define PB push_back\n#define MP make_pair\n#define rep(i,x) for(int i=0;i<(x);++i)\n#define rep1(i,x) for(int i=1;i<=(x);++i)\n#define rrep(i,x) for(int i=(x)-1;i>=0;--i)\n#define rrep1(i,x) for(int i=(x);i>=1;--i)\n#define FOR(i,a,x) for(int i=(a);i<(x);++i)\n#define all(a) a.begin(),a.end()\n#define rall(a) a.rbegin(),a.rend()\n\n#define omajinai ios::sync_with_stdio(false);cin.tie(0)\n\ntemplate<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\ntemplate<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>T get(){T a;cin>>a;return a;}\ntemplate<typename T>T rev(T a){reverse(all(a));return a;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&vec){rep(i,vec.size())is>>vec[i];return is;}\ntemplate<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}\n\nconst int inf = 1e9;\nconst ll linf = 3e18;\nconst double eps = 1e-9;\n\nint dx[2] = {-1, 1};\n\nint a[100000];\n\nsigned main()\n{\n omajinai;\n\n int N, M; cin >> N >> M;\n\n memset(a, -1, sizeof(a));\n\n queue<int> q;\n\n rep(i, M) {\n int b; cin >> b; b--;\n a[b] = 0;\n q.push(b);\n }\n\n int ma = 0;\n\n while (q.size()) {\n int x = q.front(); q.pop();\n rep(i, 2) {\n int nx = x + dx[i];\n if (0 <= nx && nx < N) {\n if (~a[nx]) continue;\n a[nx] = a[x] + 1;\n q.push(nx);\n ma = max(ma, a[nx]);\n }\n }\n }\n\n cout << ma << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint n, m;\n\tcin >> n >> m;\n\n\tset<int> ok;\n\tfor(int i = 0; i < m; ++i) {\n\t\tint a;\n\t\tcin >> a;\n\t\tok.emplace(a);\n\t}\n\n\tint ans = 0;\n\tfor(int i = 1; i <= n; ++i) {\n\t\tauto it = ok.lower_bound(i);\n\t\tint mn = INT_MAX;\n\t\tif(it != ok.end()) {\n\t\t\tmn = min(mn, *it - i);\n\t\t}\n\n\t\tif(it != ok.begin()) {\n\t\t\t--it;\n\t\t\tmn = min(mn, i - *it);\n\t\t}\n\t\tans = max(ans, mn);\n\t}\n\tcout << ans << endl;\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n, m;\n\tcin >> n >> m;\n\tvector<int> A;\n\tA.push_back(1);\n\tint a;\n\tfor(int i = 1; i <= m; i++)\n\t{\n\t\tcin >> a;\n\t\tA.push_back(a);\n\t}\n\tA.push_back(n);\n\tint ans = 0;\n\tfor(int i = 1; i < A.size(); i++)\n\t{\n\t\tint tmp;\n\t\tif(i == 1 || i == A.size() - 1)\n\t\t\ttmp = A[i] - A[i - 1];\n\t\telse\n\t\t\ttmp = (A[i] - A[i - 1]) / 2;\n\t\tans = max(tmp, ans);\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}\n" ]
Grated radish (daikon-oroshi) is one of the essential spices in Japanese cuisine. As the name shows, it’s made by grating white radish. You are developing an automated robot for grating radish. You have finally finished developing mechan- ical modules that grates radish according to given instructions from the microcomputer. So you need to develop the software in the microcomputer that controls the mechanical modules. As the first step, you have decided to write a program that simulates the given instructions and predicts the resulting shape of the radish. Input The input consists of a number of test cases. The first line on each case contains two floating numbers R and L (in centimeters), representing the radius and the length of the cylinder-shaped radish, respectively. The white radish is placed in the xyz-coordinate system in such a way that cylinder’s axis of rotational symmetry lies on the z axis. <image> Figure 1: The placement of the white radish The next line contains a single integer N, the number of instructions. The following N lines specify instructions given to the grating robot. Each instruction consists of two floating numbers θ and V, where θ is the angle of grating plane in degrees, and V (in cubic centimeters) is the volume of the grated part of the radish. You may assume the following conditions: * the direction is measured from positive x axis (0 degree) to positive y axis (90 degrees), * 1 ≤ R ≤ 5 (in centimeters), * 1 ≤ L ≤ 40 (in centimeters), * 0 ≤ θ < 360, and * the sum of V’s is the smaller than the volume of the given white radish. <image> Figure 2: An example of grating Output For each test case, print out in one line two numbers that indicate the shape of the base side (the side parallel to xy-plane) of the remaining radish after the entire grating procedure is finished, where the first number of the total length is the linear (straight) part and the second is the total length of the curved part. You may output an arbitrary number of digits after the decimal points, provided that difference from the true answer is smaller than 10-6 centimeters. Example Input 2 1 2 1 42 3.141592653589793 5 20 3 0 307.09242465218927 180 307.09242465218927 90 728.30573874452591 Output 2.0 3.141592653589793 8.660254038 5.235987756
[ "#include <stdio.h>\n#include <math.h>\n#include <iostream>\n#include <complex>\n#include <vector>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define mp make_pair\nconst double EPS = 1e-12;\nconst double pi = atan2(0.0, -1.0);\ntypedef complex<double> P;\n\ndouble norma(double t) {\n while (t < -pi) t += 2*pi;\n while (t > pi) t -= 2*pi;\n return t;\n}\n\ndouble cross(const P& a, const P& b) { return imag(conj(a)*b); }\ndouble dot(const P& a, const P& b) { return real(conj(a)*b); }\nP unit(const P& p) { return 1/abs(p)*p; }\nP unit(double a) { return P(cos(a), sin(a)); }\nP rot90(const P& p) { return p * P(0, 1); }\n\nint ccw(const P& a, P b, P c) {\n b -= a, c -= a;\n if (cross(b, c) > 0) return 1;\n if (cross(b, c) < 0) return -1;\n if (dot(b, c) < 0) return 2;\n if (norm(b) < norm(c)) return -2;\n return 0;\n}\n\nbool intersectLL(const P& l0, const P& l1, const P& m0, const P& m1) {\n return abs(cross(l1-l0, m1-m0)) > EPS;\n}\n\nP crosspoint(const P& l0, const P& l1, const P& m0, const P& m1) {\n const double a = cross(l1-l0, m1-m0);\n const double b = cross(l1-l0, l1-m0);\n if (abs(a) < EPS && abs(b) < EPS) return m0;\n if (abs(a) < EPS) throw 0;\n return m0 + b/a * (m1-m0);\n}\n\nstruct C {\n double R;\n vector<pair<double, double> > as;\n vector<pair<P, P> > es;\n C(double R) : R(R) {}\n};\n\nC empty(double R) {\n C c(R);\n c.as.push_back(mp(-pi, pi));\n return c;\n}\n\ndouble size(const C& c) {\n double t = 0;\n rep (i, c.as.size()) t += c.as[i].second - c.as[i].first;\n double s = c.R*c.R*(2*pi-t);\n rep (i, c.es.size()) s += cross(c.es[i].first, c.es[i].second);\n return s / 2;\n}\n\nC cut(const C& c, double dt, double t) {\n if (fabs(dt-pi) < EPS) return empty(c.R);\n C nc(c);\n const P p0 = c.R*unit(t-dt);\n const P p1 = c.R*unit(t+dt);\n const double a0 = norma(t-dt), a1 = norma(t+dt);\n if (a0 <= a1) nc.as.push_back(mp(a0, a1));\n else {\n nc.as.push_back(mp(-pi, a1));\n nc.as.push_back(mp(a0, pi));\n }\n sort(nc.as.begin(), nc.as.end());\n int m = 0;\n rep (i, nc.as.size()) {\n if (!m || nc.as[m-1].second < nc.as[i].first) nc.as[m++] = nc.as[i];\n else nc.as[m-1].second = max(nc.as[m-1].second, nc.as[i].second);\n }\n nc.as.resize(m);\n P s0 = p0, s1 = p1;\n rep (i, nc.es.size()) {\n if (!intersectLL(nc.es[i].first, nc.es[i].second, p0, p1)) {\n const int cc = ccw(nc.es[i].first, nc.es[i].second, p0);\n if (cc == -1) s0 = s1 = P(0, 0);\n else if (abs(cc) != 1) {\n if (dot(p1-p0, nc.es[i].second-nc.es[i].first) < -EPS) {\n return empty(c.R);\n }\n }\n continue;\n }\n const P cp = crosspoint(nc.es[i].first, nc.es[i].second, p0, p1);\n if (ccw(nc.es[i].first, nc.es[i].second, s0) == -1) s0 = cp;\n if (ccw(nc.es[i].first, nc.es[i].second, s1) == -1) s1 = cp;\n }\n rep (i, nc.es.size()) {\n if (!intersectLL(nc.es[i].first, nc.es[i].second, p0, p1)) {\n const int cc = ccw(p0, p1, nc.es[i].first);\n if (cc == -1) nc.es[i].first = nc.es[i].second = P(0, 0);\n else if (abs(cc) != 1) {\n if (dot(p1-p0, nc.es[i].second-nc.es[i].first) < -EPS) {\n return empty(c.R);\n }\n }\n continue;\n }\n const P cp = crosspoint(nc.es[i].first, nc.es[i].second, p0, p1);\n if (ccw(p0, p1, nc.es[i].first) == -1) nc.es[i].first = cp;\n if (ccw(p0, p1, nc.es[i].second) == -1) nc.es[i].second = cp;\n }\n nc.es.push_back(mp(s0, s1));\n m = 0;\n rep (i, nc.es.size()) {\n if (abs(nc.es[i].first - nc.es[i].second) > EPS) nc.es[m++] = nc.es[i];\n }\n nc.es.resize(m);\n return nc;\n}\n\nint main() {\n int T;\n scanf(\"%d\", &T);\n while (T--) {\n double R, L;\n scanf(\"%lf%lf\", &R, &L);\n int n;\n scanf(\"%d\", &n);\n C c(R);\n rep (i, n) {\n double t, V;\n scanf(\"%lf%lf\", &t, &V);\n t = norma(t/180*pi);\n const double s = size(c) - V/L;\n double l = 0, r = pi;\n rep (_, 100) {\n const double mid = (l+r) / 2;\n if (size(cut(c, mid, t)) < s) r = mid;\n else l = mid;\n }\n c = cut(c, l, t);\n }\n double ansT = 0;\n rep (i, c.as.size()) ansT += c.as[i].second - c.as[i].first;\n double ansE = 0;\n rep (i, c.es.size()) ansE += abs(c.es[i].second - c.es[i].first);\n printf(\"%.9f %.9f\\n\", ansE, R*(2*pi-ansT));\n }\n return 0;\n}", "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\nstruct C{\n P p;\n double r;\n C(const P& p, const double& r) : p(p), r(r) {}\n C(){}\n};\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\nP unit(const P &p){\n return p/abs(p);\n}\nP rotate(const P &p, double rad){\n return p *P(cos(rad), sin(rad));\n}\n\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\n\nP projection(const L& l, const P& p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\ndouble distanceLP(const L &l, const P &p) {\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\n}\ndouble distanceSP(const L &s, const P &p) {\n if(dot(s[1]-s[0], p-s[0]) < EPS) return abs(p-s[0]);\n if(dot(s[0]-s[1], p-s[1]) < EPS) return abs(p-s[1]);\n return distanceLP(s, p);\n}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\nVP crosspointCL(const C &c, const L &l){\n VP ret;\n P mid = projection(l, c.p);\n double d = distanceLP(l, c.p);\n if(EQ(d, c.r)){\n ret.push_back(mid);\n }else if(d < c.r){\n double len = sqrt(c.r*c.r -d*d);\n ret.push_back(mid +len*unit(l[1]-l[0]));\n ret.push_back(mid -len*unit(l[1]-l[0]));\n }\n return ret;\n}\nVP crosspointCS(const C &c, const L &s){\n VP ret;\n VP cp = crosspointCL(c,s);\n for(int i=0; i<(int)cp.size(); i++){\n if(intersectSP(s, cp[i])){\n ret.push_back(cp[i]);\n }\n }\n return ret;\n}\n\nint in_poly(const P &p, const VP &poly){\n int n = poly.size();\n int ret = -1;\n for(int i=0; i<n; i++){\n P a = poly[i]-p;\n P b = poly[(i+1)%n]-p;\n if(a.Y > b.Y) swap(a,b);\n if(intersectSP(L(a,b), P(0,0))) return 0;\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\n }\n return ret;\n}\nVP convex_cut(const VP& p, const L& l){\n VP ret;\n int n = p.size();\n for(int i=0; i<n; i++){\n P curr = p[i];\n P next = p[(i+1)%n];\n if(ccw(l[0], l[1], curr) != -1) ret.push_back(curr);\n if(ccw(l[0], l[1], curr) *ccw(l[0], l[1], next) == -1){\n ret.push_back(crosspointLL(L(curr, next), l));\n }\n }\n return ret;\n}\n\nVP convex(VP v){\n VP ret;\n int n = v.size();\n sort(v.begin(), v.end());\n for(int i=0; i<n; i++){\n while((int)ret.size()>1 && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\n ret.pop_back();\n }\n ret.push_back(v[i]);\n }\n int t = ret.size();\n for(int i=n-2; i>=0; i--){\n while((int)ret.size()>t && cross(ret.back()-ret[ret.size()-2], v[i]-ret.back()) < EPS){\n ret.pop_back();\n }\n ret.push_back(v[i]);\n }\n if((int)ret.size() > 1) ret.pop_back();\n return ret;\n}\ndouble commonarea_circle_convex(C c, VP poly){\n int n = poly.size();\n for(int i=0; i<n; i++) poly[i] -= c.p;\n c.p = P(0, 0);\n\n double mindist = INF;\n VP cp;\n for(int i=0; i<n; i++){\n L edge(poly[i], poly[(i+1)%n]);\n VP ret = crosspointCS(c, edge);\n cp.insert(cp.begin(), ret.begin(), ret.end());\n if(abs(poly[i]) < c.r) cp.push_back(poly[i]);\n mindist = min(mindist, distanceSP(edge, c.p));\n }\n sort(cp.begin(), cp.end());\n cp.erase(unique(cp.begin(), cp.end()), cp.end());\n if(mindist +EPS > c.r && in_poly(c.p, poly) > 0){\n return PI *c.r *c.r;\n }\n\n double res = 0;\n VP v = convex(cp);\n int m = v.size();\n for(int i=0; i<m; i++){\n P curr = v[i];\n P next = v[(i+1)%m];\n if(EQ(abs(curr), c.r) && EQ(abs(next), c.r)\n && in_poly(c.r *unit(next -curr)*P(0,-1), poly) > 0){\n double theta = arg(next /curr);\n if(theta < 0) theta += 2*PI;\n res += c.r*c.r *theta /2;\n }else{\n res += cross(curr, next) /2;\n }\n }\n return res;\n}\n\nint main(){\n int dn;\n cin >> dn;\n for(int rep=0; rep<dn; rep++){\n double r,l;\n int n;\n cin >> r >> l >> n;\n VP poly{P(-r-1, -r-1), P(r+1, -r-1), P(r+1, r+1), P(-r-1, r+1)};\n C circle(P(0, 0), r);\n double rem = r*r*PI;\n for(int i=0; i<n; i++){\n double theta, v;\n cin >> theta >> v;\n theta *= PI/180;\n v /= l;\n P base = rotate(P(1, 0), theta);\n P dir = base *P(0, 1);\n double lb=-r, ub=r;\n for(int j=0; j<50; j++){\n double mid = (lb +ub)/2;\n L cut(mid*base, mid*base +dir);\n VP tmp = convex_cut(poly, cut);\n if(rem -commonarea_circle_convex(circle, tmp) > v){\n lb = mid;\n }else{\n ub = mid;\n }\n }\n L cut(lb*base, lb*base +dir);\n poly = convex_cut(poly, cut);\n rem = commonarea_circle_convex(circle, poly);\n }\n\n vector<double> angle;\n vector<VP> cp(poly.size());\n for(int i=0; i<(int)poly.size(); i++){\n L edge(poly[i], poly[(i+1)%poly.size()]);\n VP ret = crosspointCS(circle, edge);\n for(P p: ret){\n angle.push_back(arg(p));\n cp[i].push_back(p);\n }\n cp[i].push_back(poly[i]);\n cp[i].push_back(poly[(i+1)%poly.size()]);\n sort(cp[i].begin(), cp[i].end());\n }\n if(!angle.empty()){\n sort(angle.begin(), angle.end());\n angle.push_back(angle[0] +2*PI);\n }\n\n double lenstraight=0, lencurve=0;\n for(int i=0; i<(int)cp.size(); i++){\n for(int j=0; j<(int)cp[i].size()-1; j++){\n P mp = (cp[i][j] +cp[i][j+1])/2.0;\n if(abs(mp) < r){\n lenstraight += abs(cp[i][j+1] -cp[i][j]);\n }\n }\n }\n for(int i=0; i<(int)angle.size()-1; i++){\n double mid = (angle[i] +angle[i+1])/2;\n P mp = rotate(P(r, 0), mid);\n if(in_poly(mp, poly) == 1){\n lencurve += (angle[i+1] -angle[i]) *r;\n }\n }\n cout << fixed << setprecision(10);\n cout << lenstraight << \" \" << lencurve << endl;\n }\n return 0;\n}\n" ]
The jewel, a national treasure of the Kingdom of Pal, was stolen by bandits. As an adventurer, you heard the rumor and headed for the thief's hideout and managed to get the jewels back. However, when I went to return the jewel to the castle of the Kingdom of Pal, the guard of the castle said, "My king has not completely trusted you yet. I doubt that the jewel is genuine, and I got it back in the first place. It is a lie, and I suspect that he is a member of the thief who is aiming for the king's life. " You have been challenged by the guards to see if you really can be trusted. The content of the trial is, "Go to the castle's underground warehouse and place the jewel in the designated place. There is a magic circle that reacts when the jewel is genuine. However, do not cause suspicious behavior. Therefore, do not follow the movement pattern that the guards said from the entrance of the underground warehouse to the designated place. " For example, for the shape and prohibition pattern of the underground warehouse shown in the figure below, the movement pattern as shown in the figure must not be adopted. This is because part of the movement pattern (highlighted in red) is included in the prohibited pattern. (In addition, the second and third movements "↓↓" in this movement pattern are also included in the prohibited pattern) <image> On the other hand, a movement pattern as shown in the figure below is allowed because no part of the movement pattern is included in the prohibited pattern. <image> As input, the shape of the underground warehouse and the prohibition pattern are given. Find the minimum number of moves required to move from the entrance to the magic circle without taking the ban pattern. Notes on Test Cases Multiple datasets are given in the above input format. Create a program that outputs each data set in the above output format. When n, m is 0, it indicates the end of input. <!- Input The inputs include the shape of the underground warehouse and the prohibition pattern. The shape of the underground warehouse is represented as follows. First, two integers N and M are given. It means the number of rows and columns of the underground warehouse, respectively. (1 ≤ N, M ≤ 50) Subsequently, N lines of character strings consisting of M characters are given. The characters included and their meanings are as follows. Character | Meaning --- | --- S | The entrance to the underground warehouse. Only one is always included per underground warehouse. G | Magic circle. Only one is always included per underground warehouse. . | Aisle. You can pass (if you don't take the prohibition pattern). | Wall. You can't go through the wall. Next, a prohibition pattern is given. The prohibition pattern is expressed as follows. First, one integer P is given. Means the number of prohibited patterns. (0 ≤ P ≤ 10) Subsequently, a character string meaning a prohibition pattern is given over P lines. The characters included in the prohibited pattern and their meanings are as follows. Character | Meaning --- | --- U | ↑ move. Move R |->. D | ↓ movement. L | <-Move. The length of the prohibited pattern is 1 or more and 10 or less. One prohibition pattern may be a substring of another prohibition pattern. It may also include the same prohibition pattern. Output Output an integer that means the minimum number of moves required. If you can't reach the magic circle, output -1. Examples Input 7 6 ...... .####. .####. ...S#. ...##. ...##. .....G 3 LD DD LLL 7 8 S#...... .#.####. .#.#G.#. .#.##.#. .#....#. .######. ........ 8 DDDD DDDU UUUU UUUD RRRR RRRL LLLL LLLR 3 8 ######## S......G ######## 2 U D 6 10 .......... .S........ .......... .......... ........G. .......... 0 6 7 ....... ...#... ...#.S. ...###. .G..... ....... 2 LL DD 0 0 Output 13 60 7 10 -1 Input 7 6 ...... .####. .####. ...S#. ...##. ...##. .....G 3 LD DD LLL Output 13 Input 7 8 S#...... .#.####. .#.#G.#. .#.##.#. .#....#. .######. ........ 8 DDDD DDDU UUUU UUUD RRRR RRRL LLLL LLLR Output 60 Input 3 8 S......G 2 U D Output 7 Input 6 10 .......... .S........ .......... .......... ........G. .......... 0 Output 10 Input 6 7 ....... ...#... ...#.S. ...###. .G..... ....... 2 LL DD Output -1 Input 7 6 ...... .####. .####. ...S#. ...##. ...##. .....G 3 LD DD LLL 7 8 S#...... .#.####. .#.#G.#. .#.##.#. .#....#. .######. ........ 8 DDDD DDDU UUUU UUUD RRRR RRRL LLLL LLLR 3 8 S......G 2 U D 6 10 .......... .S........ .......... .......... ........G. .......... 0 6 7 ....... ...#... ...#.S. ...###. .G..... ....... 2 LL DD 0 0 Output 13 60 7 10 -1
[ "#include<iostream>\n#include<string>\n#include<queue>\n#include<algorithm>\n#include<set>\nusing namespace std;\n#define rep(i,n) for ( int i = 0; i < n; i++)\nstatic const int MAX = 50;\nstatic const int PMAX = 11;\nstatic const string DT = \"URDL\";\nstatic const int di[4] = {-1, 0, 1, 0};\nstatic const int dj[4] = {0, 1, 0, -1};\n\nint H, W, np;\nchar G[MAX][MAX];\nstring P[PMAX];\n\nclass State{\npublic:\n unsigned short pos;\n short M[PMAX], cost;\n string path;\n\n State(){\n rep(i, np) M[i] = -1;\n path = \"\";\n cost = 0;\n }\n\n bool shift(char ch){\n path += ch;\n rep(i, np){\n int p = -1;\n string s = P[i];\n for ( int k = 0; k < s.size(); k++ ){\n\tint st = path.size() -1 -k;\n\tif ( st < 0 ) continue;\n\tbool match = true;\n\tfor ( int j = 0; j <= k; j++ ){\n\t if ( path[st+j] != s[j] ) { match = false; break; }\n\t}\n\tif ( match ) p = k;\n }\n M[i] = p;\n if ( M[i] == P[i].size() -1 ) return false;\n }\n return true;\n }\n\n bool operator < ( const State &s ) const{\n if ( pos != s.pos ) return pos < s.pos;\n rep(i, np){\n if ( M[i] == s.M[i] ) continue;\n return M[i] < s.M[i];\n }\n return false;\n }\n};\n\nint bfs(int si, int sj, int gi, int gj){\n queue<State> Q;\n set<State> V;\n State s;\n s.pos = si*W + sj;\n V.insert(s);\n Q.push(s);\n State u, v;\n int ni, nj;\n while(!Q.empty()){\n u = Q.front(); Q.pop();\n if ( u.pos/W == gi && u.pos%W == gj ) return u.cost;\n\n rep(r, 4){\n ni = u.pos/W + di[r];\n nj = u.pos%W + dj[r];\n if ( ni < 0 || nj < 0 || ni >= H || nj >= W ) continue;\n if ( G[ni][nj] == '#' ) continue;\n v = u;\n\t v.pos = ni*W + nj;\n\t if (!v.shift(DT[r])) continue;\n\t v.cost++;\n if ( V.find(v) == V.end() ){\n\n\tV.insert(v);\n\tQ.push(v);\n }\n }\n }\n return -1;\n}\n\nint main(){\n int si, sj, gi, gj;\n while( cin >> H >> W && H){\n rep(i,H) rep(j, W){\n cin >> G[i][j];\n if ( G[i][j] == 'S' ){ si = i; sj = j; G[i][j] = '.'; }\n if ( G[i][j] == 'G' ){ gi = i; gj = j; G[i][j] = '.'; }\n }\n cin >> np;\n rep(i, np) cin >> P[i];\n cout << bfs(si, sj, gi, gj) << endl;\n }\n}", "#include <bits/stdc++.h>\n\ntemplate<class Converter, class SuffixInfo, int NODE_NUM = 1000000>\nclass AhoCorasick {\npublic:\n using value_structure = typename Converter::value_structure;\n using size_type = std::uint64_t;\n static constexpr size_type num_of_kinds = Converter::num_of_kinds;\n\n using value_type = typename SuffixInfo::value_type;\n using merged_value_type = typename SuffixInfo::merged_value_type;\n\n struct Node {\n size_type size, end, len, faillink;\n value_type val;\n merged_value_type suf_info;\n std::array<int, num_of_kinds> ch;\n Node () : size(0), end(0), len(0), val(SuffixInfo::identity()),\n suf_info(SuffixInfo::midentity()), faillink(0) { ch.fill(-1); }\n };\n\nprivate:\n std::vector<Node> node;\n\npublic:\n AhoCorasick() {\n node.reserve(NODE_NUM);\n node.push_back(Node());\n }\n\n void insert(const value_structure& v, size_type num = 1, value_type val = value_type(), size_type k = 0, size_type idx = 0) {\n node[idx].size += num;\n if (k == v.size()) {\n node[idx].end += num;\n node[idx].val = SuffixInfo::operation(node[idx].val, val);\n return;\n }\n size_type nxt = Converter::convert(v[k]);\n if (node[idx].ch[nxt] == -1) {\n node.push_back(Node());\n node[idx].ch[nxt] = node.size()-1;\n node.back().len = k+1;\n }\n insert(v, num, val, k+1, node[idx].ch[nxt]);\n }\n\n size_type count_prefix(const value_structure& v, size_type k = 0, size_type idx = 0) {\n if (v.size() == k) return node[idx].size;\n size_type nxt = Converter::convert(v[k]);\n if (node[idx].ch[nxt] == -1) return 0;\n return count_prefix(v, k+1, node[idx].ch[nxt]);\n }\n\n size_type count(const value_structure& v, size_type k = 0, size_type idx = 0) {\n if (v.size() == k) return node[idx].end;\n size_type nxt = Converter::convert(v[k]);\n if (node[idx].ch[nxt] == -1) return 0;\n return count(v, k+1, node[idx].ch[nxt]);\n }\n\n template<typename F>\n void query(const value_structure& v, const F& f, size_type k = 0, size_type idx = 0) {\n if (node[idx].size > 0) f(node[idx]);\n if (v.size() == k) return;\n size_type nxt = Converter::convert(v[k]);\n if (node[idx].ch[nxt] == -1) return;\n query(v, f, k+1, node[idx].ch[nxt]);\n }\n\n size_type proceed(size_type k, size_type c, bool need_convert = 1) {\n if (need_convert) c = Converter::convert(c);\n while (node[k].ch[c] == -1) k = node[k].faillink;\n return node[k].ch[c];\n }\n\n void build() {\n std::queue<size_type> que;\n for (int i = 0; i < num_of_kinds; i++) {\n if (node[0].ch[i] == -1) node[0].ch[i] = 0;\n else {\n que.push(node[0].ch[i]);\n SuffixInfo::merge(node[node[0].ch[i]].suf_info, node[node[0].ch[i]].val);\n }\n }\n while (que.size()) {\n int k = que.front();\n que.pop();\n for (int i = 0; i < num_of_kinds; i++) {\n if (node[k].ch[i] == -1) continue;\n size_type nx = node[k].ch[i];\n node[nx].faillink = proceed(node[k].faillink, i, false);\n\n SuffixInfo::merge(node[nx].suf_info, node[nx].val);\n SuffixInfo::merge(node[nx].suf_info, node[node[nx].faillink].suf_info);\n que.push(nx);\n }\n }\n }\n\n const Node& operator[](size_type k) {\n return node[k];\n }\n};\n\nint dy[4] = {-1, 1, 0, 0};\nint dx[4] = {0, 0, -1, 1};\n\nclass Converter {\npublic:\n using value_structure = std::string;\n using value_type = typename value_structure::value_type;\n static constexpr std::size_t num_of_kinds = 4;\n static std::size_t convert(const value_type& v) {\n switch (v) {\n case 'U': return 0;\n case 'D': return 1;\n case 'L': return 2;\n case 'R': return 3;\n }\n }\n};\n\nclass SuffixInfo {\npublic:\n using value_type = int;\n using merged_value_type = int;\n static value_type identity() { return 0; }\n static merged_value_type midentity() { return 0; }\n static value_type operation(const value_type& a, const value_type& b) {\n return a | b;\n }\n static void merge(merged_value_type& a, const merged_value_type& b) {\n a |= b;\n }\n// static void merge(merged_value_type& a, const value_type& b) {\n// a |= b;\n// }\n};\n\nvoid solve() {\n using namespace std;\n AhoCorasick<Converter, SuffixInfo> ah;\n int n, m;\n cin >> n >> m;\n if (n + m == 0) exit(0);\n vector<string> f(n);\n string dir=\"UDLR\";\n pair<int, int> st, goal;\n for (int i = 0; i < n; i++) {\n cin >> f[i];\n for (int j = 0; j < m; j++) {\n if (f[i][j] == 'S') st = {i, j};\n if (f[i][j] == 'G') goal = {i, j};\n }\n }\n auto in = [&](int y, int x) {\n return 0<=y&&y<n&&0<=x&&x<m&&f[y][x]!='#';\n };\n int P;\n cin >> P;\n for (int i = 0; i < P; i++) {\n string s;\n cin >> s;\n ah.insert(s, 1, 1);\n }\n ah.build();\n using T = tuple<int, int, int, int>; // d, y, x, v\n vector<vector<vector<int>>> d(n, vector<vector<int>>(m, vector<int>(110, (int)1e9)));\n queue<T> que;\n que.emplace(0, st.first, st.second, 0);\n d[st.first][st.second][0] = 0;\n while (que.size()) {\n int dd, ny, nx, v;\n tie(dd, ny, nx, v) = que.front(); que.pop();\n for (int i = 0; i < 4; i++) {\n int yy = ny+dy[i], xx = nx+dx[i], vv = ah.proceed(v, dir[i]);\n if (!in(yy, xx)) continue;\n if (ah[vv].suf_info) {\n continue;\n } else {\n if (d[yy][xx][vv] > dd + 1) {\n d[yy][xx][vv] = dd + 1;\n que.emplace(dd+1, yy, xx, vv);\n }\n }\n }\n }\n int res = 1e9;\n for (int i = 0; i < 110; i++) {\n res = min(res, d[goal.first][goal.second][i]);\n }\n if (res == 1e9) {\n cout << -1 << endl;\n } else {\n cout << res << endl;\n }\n}\n\nint main(void) {\n while(1) {\n solve();\n }\n}\n\n/*\nverify: https://tenka1-2016-final-open.contest.atcoder.jp/submissions/8400970\n\ntemplate<class Converter, class SuffixInfo>\nclass AhoCorasick\n\nConverter:\n\t- 要求\n\t\t- value_structure: std::string, std::vectorなどの列構造\n\t\t\t- size, operator[] が必要\n\n\t\t- static constexpr std::size_t num_of_kinds\n\t\t\t- 現れる値の種類数\n\n\t\t- static convert(value_type) -> size_t\n\t\t\t- 値を[0, num_of_kinds)に変換する\n\nSuffixInfo:\n - 要求\n - value_type: それぞれの文字列が持つ値の型\n\n - merged_value_type: suffixが一致する要素の情報をまとめたもの\n\n - identity -> value_type\n - value_typeの単位元（初期値）\n\n - midentity -> merged_value_type\n - merged_value_typeの初期値（単位元とは？？？）\n\n - operation(const value_type&, const value_type&)\n\n - merge(merged_value_type&, const value_type&)\n - merge(merged_value_type&, const merged_value_type&)\n\n\nAhoCorasick\n\t- 提供\n\t\t- Node\n\t\t\t- size\n\t\t\t\t- 部分木に単語がいくつあるか\n\n\t\t\t- end\n\t\t\t\t- その頂点で終わる単語がいくつあるか\n\n\t\t\t- len\n\t\t\t\t- その頂点までで何文字あるか\n\t\t\t\n\t\t\t- ch[num_of_kinds]\n\t\t\t\t- それぞれの子のpoolでのindex(存在しなければ-1)\n\n\t\t- insert(value_structure v, num, k)\n\t\t\t- O(|v|)\n\t\t\t- num個のv[k..)を挿入する\n\n\t\t- count_prefix(value_structure v, k)\n\t\t\t- O(|v|)\n\t\t\t- v[k..)をprefixとして含むものがいくつあるか返す\n\n\t\t- count(value_structure v, k)\n\t\t\t- O(|v|)\n\t\t\t- v[k..)がいくつあるか返す\n\n\t\t- query(value_structure v, F f, k)\n\t\t\t- O(|v|)\n\t\t\t- v[k..)のprefixそれぞれについてf(node)を呼び出す\n\n - build\n\n - proceed(k, c)\n - 今いる頂点がkのとき、次の文字がcのときに進む頂点を返す\n */\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1e8;\n\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\n\nstring D = \"DRUL\";\n\nconst int var = 4;\n\nint trans(char c) {\n\tswitch (c)\n\t{\n\tcase 'R': return 0;\n\tcase 'D': return 1;\n\tcase 'L': return 2;\n\tcase 'U': return 3;\n\tdefault: assert(false);\n\t}\n}\n\nstruct ac_node {\n\tac_node *fail;\n\tac_node *next[var];\n\tvector<int> ok;\n\tac_node() : fail(nullptr), next{} {}\n};\n\nac_node* new_ac_node() {\n\tstatic const int pmax = 1e5;\n\tstatic ac_node pool[pmax];\n\tstatic int it = 0;\n\tassert(it < pmax);\n\treturn &pool[it++];\n}\n\nac_node* getnext(ac_node* p, char c) {\n\twhile (p->next[trans(c)] == nullptr) p = p->fail;\n\treturn p->next[trans(c)];\n}\n\nclass aho_corasick {\n\tvector<int> unite(const vector<int>& a, const vector<int>& b) {\n\t\tvector<int> res;\n\t\tset_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res));\n\t\treturn res;\n\t}\n\tint K;\n\tac_node *root;\npublic:\n\taho_corasick(const vector<string>& Ts) : K(Ts.size()), root(new_ac_node()) {\n\t\tac_node *now;\n\t\troot->fail = root;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tauto &T = Ts[i];\n\t\t\tnow = root;\n\t\t\tfor (auto c : T) {\n\t\t\t\tif (now->next[trans(c)] == nullptr) {\n\t\t\t\t\tnow->next[trans(c)] = new_ac_node();\n\t\t\t\t}\n\t\t\t\tnow = now->next[trans(c)];\n\t\t\t}\n\t\t\tnow->ok.push_back(i);\n\t\t}\n\t\tqueue<ac_node*> q;\n\t\tfor (int i = 0; i < var; i++) {\n\t\t\tif (root->next[i] == nullptr) {\n\t\t\t\troot->next[i] = root;\n\t\t\t}\n\t\t\telse {\n\t\t\t\troot->next[i]->fail = root;\n\t\t\t\tq.push(root->next[i]);\n\t\t\t}\n\t\t}\n\t\twhile (!q.empty()) {\n\t\t\tnow = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < var; i++) {\n\t\t\t\tif (now->next[i] != nullptr) {\n\t\t\t\t\tac_node *nx = now->fail;\n\t\t\t\t\twhile (nx->next[i] == nullptr) {\n\t\t\t\t\t\tnx = nx->fail;\n\t\t\t\t\t}\n\t\t\t\t\tnow->next[i]->fail = nx->next[i];\n\t\t\t\t\tnow->next[i]->ok = unite(now->next[i]->ok, nx->next[i]->ok);\n\t\t\t\t\tq.push(now->next[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tac_node* getroot() const {\n\t\treturn root;\n\t}\n\tint get_node_id(ac_node* nd) const {\n\t\treturn (int)(nd - root);\n\t}\n\tvector<int> count(const string& S) const {\n\t\tvector<int> res(K);\n\t\tac_node *now = root;\n\t\tfor (auto c : S) {\n\t\t\tnow = getnext(now, c);\n\t\t\tfor (auto k : now->ok) res[k]++;\n\t\t}\n\t\treturn res;\n\t}\n};\n\nusing T = tuple<int, int, ac_node*>;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m) {\n\t\tvector<string> S(n);\n\t\tint sx = 0, sy = 0, gx = 0, gy = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> S[i];\n\t\t\tfor (int j = 0; j < (int)S[i].size(); j++) {\n\t\t\t\tif (S[i][j] == 'S') {\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t}\n\t\t\t\telse if (S[i][j] == 'G') {\n\t\t\t\t\tgx = i;\n\t\t\t\t\tgy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> p;\n\t\tvector<string> pts(p);\n\t\tfor (int i = 0; i < p; i++) {\n\t\t\tcin >> pts[i];\n\t\t}\n\t\taho_corasick aho(pts);\n\t\tvector<vector<vector<int>>> f(n, vector<vector<int>>(m, vector<int>(200, INF)));\n\t\tqueue<T> q;\n\t\tq.push(make_tuple(sx, sy, aho.getroot()));\n\t\tf[sx][sy][aho.get_node_id(aho.getroot())] = 0;\n\t\twhile (!q.empty()) {\n\t\t\tauto tup = q.front(); q.pop();\n\t\t\tint x = get<0>(tup), y = get<1>(tup);\n\t\t\tac_node *nd = get<2>(tup);\n\t\t\tint id = aho.get_node_id(nd);\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\t\t\tac_node *tnd = getnext(nd, D[i]);\n\t\t\t\tif (0 <= tx && tx < n && 0 <= ty && ty < m && S[tx][ty] != '#' && tnd->ok.empty() && f[tx][ty][aho.get_node_id(tnd)] == INF) {\n\t\t\t\t\tq.push(make_tuple(tx, ty, tnd));\n\t\t\t\t\tf[tx][ty][aho.get_node_id(tnd)] = f[x][y][id] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint res = INF;\n\t\tfor (auto val : f[gx][gy]) {\n\t\t\tres = min(res, val);\n\t\t}\n\t\tcout << (res != INF ? res : -1) << endl;\n\t}\n\treturn 0;\n}\n\n", "/*\n * AOJ 2212: Stolen Jewel\n * ?¢?????????°?????????????????°??°???????????¨?????¨???????????????????????¨???????????¶?????????????????¢?????????????????¨???????????????????????¢????¬????????????¶????±???°????????????????°???\\??°???\n * ?±???????DP+?????????\n * ??????????????¢?§???????????????????????????¶???????¢??????????????????¨??¶???i????????????????????????????¬???¬?§???°?????????????????¶???j???d[x][y][i]??¨??????(x,y)??¨?????????i???????°???\\??°?????¨Dijkstra?????°??°????????????????????????\n */\n\n#include <cstdio>\n#include <queue>\n#include <cstring>\n#include <algorithm>\n#include <iostream>\n#include <string>\n\n\nusing namespace std;\n\n\nint m, n, nr, ns;\nstring mat[53];\nstring rule[13];\n\nint d[53][53][113];\nint t[113][4];\nstring suf[113];\n\nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, 1, 0, -1};\nchar dc[] = {'U', 'R', 'D', 'L'};\n\n\nstruct Status {\n int x, y, s, d;\n\n Status() {}\n\n Status(int dd, int xx, int yy, int ss) : d(dd), x(xx), y(yy), s(ss) {}\n\n void Get(int &dd, int &xx, int &yy, int &ss) const {\n dd = d;\n xx = x;\n yy = y;\n ss = s;\n }\n\n bool operator<(const Status &ts) const {\n return d > ts.d;\n }\n};\n\npriority_queue<Status> pq;\n\nint Dijkstra() {\n while (!pq.empty()) pq.pop();\n memset(d, 0x3f, sizeof(d));\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < n; ++j) {\n if (mat[i][j] == 'S') {\n d[i][j][0] = 0;\n pq.emplace(0, i, j, 0);\n goto L;\n }\n }\n }\n L:\n int ans = -1;\n while (!pq.empty()) {\n int pre, x, y, s;\n pq.top().Get(pre, x, y, s);\n pq.pop();\n if (pre > d[x][y][s]) continue;\n for (int k = 0; k < 4; ++k) {\n int xx, yy, ss;\n ss = t[s][k];\n if (ss == -1) continue;\n xx = x + dx[k];\n yy = y + dy[k];\n\n if (xx >= 0 && xx < m && yy >= 0 && yy < n && mat[xx][yy] != '#' && pre + 1 < d[xx][yy][ss]) {\n if (mat[xx][yy] == 'G') {\n ans = pre + 1;\n return ans;\n }\n d[xx][yy][ss] = pre + 1;\n pq.emplace(pre + 1, xx, yy, ss);\n }\n }\n }\n return ans;\n}\n\n\nbool IsSuf(string a, string b) {\n if (a.length() < b.length()) return false;\n return a.substr(a.length() - b.length()) == b;\n}\n\nvoid GaoEdge() {\n sort(suf, suf + ns);\n ns = unique(suf, suf + ns) - suf;\n memset(t, 0, sizeof(t));\n for (int i = 0; i < ns; ++i) {\n for (int k = 0; k < 4; ++k) {\n string ts = suf[i] + dc[k];\n for (int j = 0; j < nr; ++j) {\n if (IsSuf(ts, rule[j])) {\n t[i][k] = -1;\n break;\n }\n }\n if (t[i][k] != -1) {\n for (int j = 0; j < ns; ++j) {\n if (IsSuf(ts, suf[j]) && suf[j].length() > suf[t[i][k]].length()) {\n t[i][k] = j;\n }\n }\n }\n }\n }\n}\n\n\nint main() {\n //freopen(\"/Users/yogy/acm-challenge-workbook/db.in\", \"r\", stdin);\n while (cin >> m >> n && m > 0 && n > 0) {\n for (int i = 0; i < m; ++i) {\n cin >> mat[i];\n }\n cin >> nr;\n ns = 0;\n suf[ns++] = \"\";\n for (int i = 0; i < nr; ++i) {\n cin >> rule[i];\n for (int j = 1; j < rule[i].length(); ++j) {\n suf[ns++] = rule[i].substr(0, j);\n }\n }\n GaoEdge();\n int ans = Dijkstra();\n cout << ans << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\n\n#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)\n#define rep(i,n) REP(i,0,n)\n#define DEB 0\n#define all(x) x.begin(), x.end()\n#define mp make_pair\n#define pb push_back\n\n\nclass state{\npublic:\n int x,y;\n vector<int> ma; // 1base\n state(int _x, int _y, vector<int> m){\n x=_x; y=_y;\n ma.swap(m);\n }\n bool operator<(const state& a)const{\n if( x!=a.x ) return x<a.x;\n if( y!=a.y ) return y<a.y;\n return ma < a.ma;\n }\n bool operator==(const state& a)const{\n return x==a.x && y==a.y && ma==a.ma;\n }\n};\n\nconst int dx[] = {0,1,0,-1}; //up, right, down, left\nconst int dy[] = {-1,0,1,0};\nint n,m,p;\nint sx,sy;\nmap<state,long long> msi;\nchar field[52][52];\nvector<string> ope;\n\nbool inside(int x, int y){\n return !(x<0 || x>=m || y>=n || y<0 || field[y][x]=='#');\n}\nint DIR(char c){\n if( c=='U' ) return 0;\n if( c=='R' ) return 1;\n if( c=='D' ) return 2;\n if( c=='L' ) return 3;\n}\nint main(){\t\n while(cin>>n>>m,n|m){\n ope.clear();\n msi.clear();\n rep(i,n){\n cin>>field[i];\n rep(j,m)if( field[i][j]=='S' ){\n\tsx = j;\n\tsy = i;\n }\n }\n cin>>p;\n rep(i,p){\n string tmp; cin>>tmp;\n ope.pb(tmp);\n }\n // •”•ª•¶Žš—ñ‚ŏo‚Ä‚­‚é‚à‚͍̂폜‚·‚é\n \n bool gao[16];\n memset(gao,true,sizeof(gao));\n rep(i,ope.size())if( gao[i] ){\n int j;\n for(j=0; j<ope.size(); j++)if( i!=j && gao[j] ){\n\tif( ope[i].find(ope[j]) != string::npos ){\n\t gao[i] = false;\n\t break;\n\t}\n }\n }\n vector<string> tmp;\n rep(i,ope.size())if( gao[i] )tmp.pb(ope[i]);\n ope.swap(tmp);\n\n#if DEB\n puts(\"aaa\");\n rep(i,ope.size()){\n cout << ope[i] << endl;\n }\n#endif\n\n queue<state> q;\n bool goal = false;\n long long ans = -1;\n q.push(state(sx,sy,vector<int>(ope.size(),0)));\n msi[state(sx,sy,vector<int>(ope.size(),0))] = 0;\n while( !q.empty() ){\n int x = q.front().x;\n int y = q.front().y;\n vector<int> ma = q.front().ma;\n long long cost = msi[q.front()];\n q.pop();\n#if DEB\n puts(\"init\");\n printf(\"(%d,%lld),cost:%d\\n\",x,y,cost);\n rep(l,ma.size()){\n\tprintf(\"%d,\",ma[l]);\n }\n puts(\"\");\n#endif\n rep(k,4){\n\tvector<int> hoge(ope.size(),0);\n\tint tx = x + dx[k];\n\tint ty = y + dy[k];\n\tif( !inside(tx,ty) )continue;\n\tbool ok = true;\n\trep(j,ma.size()){\n\t if( DIR(ope[j][ma[j]+1-1]) == k ){\n\t hoge[j] = ma[j]+1;\n\t if( hoge[j]==ope[j].length() ){ ok = false; break; }\n\t }else{\n\t string aaa = ope[j].substr(0,ma[j]) + string(1,k==0?'U':k==1?'R':k==2?'D':'L');\n\t int l;\n\t for(l=0; l<aaa.size(); l++){\n\t int u;\n\t for(u=0; u+l<aaa.size(); u++){\n\t\tif( aaa[l+u]!=ope[j][u] )break;\n\t }\n\t if( u+l==aaa.size() ){\n\t\tbreak;\n\t }\n\t }\n\t hoge[j] = aaa.size() - l;\n\t }\n\t}\n\tif( !ok ) continue;\n\n\tif( field[ty][tx]=='G' ){\n\t ans = cost + 1;\n\t goal = true;\n\t}\n\tstate ts(tx,ty,hoge);\n\tmap<state,long long>::iterator it = msi.lower_bound(ts);\n\tif( it!=msi.end() && it->first==ts ){\n\t if( it->second > cost+1 ){\n\t it->second = cost+1;\n\t q.push(ts);\n#if DEB\n\t puts(\" update\");\n\t printf(\" (%d,%d), dir:%d, cost:%lld\\n\",tx,ty,k,cost+1);\n\t rep(l,hoge.size()){\n\t printf(\" %d\",hoge[l]);\n\t }\n\t puts(\"\");\n#endif\n\t }\n\t}else{\n\t msi.insert(it,make_pair(ts,cost+1));\n\t q.push(ts);\n#if DEB\n\t puts(\" new\");\n\t printf(\" (%d,%d), dir:%d, cost:%lld\\n\",tx,ty,k,cost+1);\n\t rep(l,hoge.size()){\n\t printf(\" %d\",hoge[l]);\n\t }\n\t puts(\"\");\n#endif\n\t}\n }\n if( goal ) break;\n }\n printf(\"%lld\\n\",ans);\n }\n return 0;\n}", "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <set>\n#include <string>\n#include <queue>\n\nusing namespace std;\ntypedef long long ll;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nstruct Point {\n int x;\n int y;\n int cost;\n int str;\n Point(int x, int y, int cost, int str) : x(x), y(y), cost(cost), str(str) {;}\n};\n\nint w, h;\nchar field[60][60];\nchar str[100];\nconst int dx[4] = { 1, 0, -1, 0 };\nconst int dy[4] = { 0, 1, 0, -1 };\nconst char move[4] = { 'R', 'D', 'L', 'U' };\nchar temp[100];\n\nint main() {\n while (scanf(\"%d %d\", &h, &w), h|w) {\nint p = 0;\nchar revmove[300];\n revmove[(int)'R'] = 1;\n revmove[(int)'D'] = 2;\n revmove[(int)'L'] = 3;\n revmove[(int)'U'] = 4;\nset<int> prefix;\nset<int> ban;\nset<string> pattern;\nset<int> visit[60][60];\n int sx, sy;\n REP(y, h) {\n REP(x, w) {\n scanf(\" %c \", &field[y][x]);\n if (field[y][x] == 'S') { sx = x; sy = y; }\n }\n }\n scanf(\"%d\", &p);\n REP(i, p) {\n scanf(\"%s\", str);\n pattern.insert((string)str);\n }\n for (set<string>::iterator it1 = pattern.begin(); it1 != pattern.end();) {\n FORIT(it2, pattern) {\n if (it1 == it2) { continue; }\n if (it1->find(*it2) != string::npos) {\n pattern.erase(it1++);\n goto next;\n }\n }\n it1++;\nnext:;\n }\n FORIT(it, pattern) {\n int num = 0;\n REP(i, it->size()) {\n num = num * 5 + revmove[(int)(*it)[i]];\n prefix.insert(num);\n }\n ban.insert(num);\n }\n prefix.insert(2000000000);\n queue<Point> que;\n que.push(Point(sx, sy, 0, 0));\n visit[sy][sx].insert(0);\n while (!que.empty()) {\n Point p = que.front();\n que.pop();\n //cout << p.x << \" \" << p.y << \" \" << p.cost << \" \" << p.str << endl;\n if (field[p.y][p.x] == 'G') {\n printf(\"%d\\n\", p.cost);\ngoto next2;\n }\n REP(i, 4) {\n int nx = p.x + dx[i];\n int ny = p.y + dy[i];\n if (nx < 0 || nx >= w || ny < 0 || ny >= h || field[ny][nx] == '#') { continue; }\n int nstr = p.str * 5 + i + 1;\n int start = pow(5, 11);\n while (nstr != 0 && !prefix.count(nstr)) {\n nstr %= start;\n start /= 5;\n }\n if (ban.count(nstr)) { continue; }\n if (visit[ny][nx].count(nstr)) { continue; }\n visit[ny][nx].insert(nstr);\n que.push(Point(nx, ny, p.cost + 1, nstr));\n }\n }\n puts(\"-1\");\nnext2:;\n}\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint to[256];\n\nstruct TrieNode\n{\n int nxt[5];\n\n int exist; // ???????????\\???????????¨????????????????????°???????¨?\n vector< int > accept; // ???????????????id\n\n TrieNode() : exist(0)\n {\n memset(nxt, -1, sizeof(nxt));\n }\n};\n\nstruct Trie\n{\n vector< TrieNode > nodes;\n int root;\n\n Trie() : root(0)\n {\n nodes.push_back(TrieNode());\n }\n\n virtual void direct_action(int node, int id) {}\n\n virtual void child_action(int node, int child, int id) {}\n\n void update_direct(int node, int id)\n {\n nodes[node].accept.push_back(id);\n direct_action(node, id);\n }\n\n void update_child(int node, int child, int id)\n {\n ++nodes[node].exist;\n child_action(node, child, id);\n }\n\n void add(const string &str, int str_index, int node_index, int id)\n {\n if(str_index == str.size()) {\n update_direct(node_index, id);\n } else {\n const int c = to[str[str_index]];\n if(nodes[node_index].nxt[c] == -1) {\n nodes[node_index].nxt[c] = (int) nodes.size();\n nodes.push_back(TrieNode());\n }\n add(str, str_index + 1, nodes[node_index].nxt[c], id);\n update_child(node_index, nodes[node_index].nxt[c], id);\n }\n }\n\n void add(const string &str, int id)\n {\n add(str, 0, 0, id);\n }\n\n void add(const string &str)\n {\n add(str, nodes[0].exist);\n }\n\n int size()\n {\n return (nodes[0].exist);\n }\n\n int nodesize()\n {\n return ((int) nodes.size());\n }\n};\n\nstruct Aho_Corasick : Trie\n{\n static const int FAIL = 4;\n vector< int > correct;\n\n Aho_Corasick() : Trie() {}\n\n void build()\n {\n correct.resize(nodes.size());\n for(int i = 0; i < nodes.size(); i++) {\n correct[i] = (int) nodes[i].accept.size();\n }\n\n queue< int > que;\n for(int i = 0; i < 5; i++) {\n if(~nodes[0].nxt[i]) {\n nodes[nodes[0].nxt[i]].nxt[FAIL] = 0;\n que.emplace(nodes[0].nxt[i]);\n } else {\n nodes[0].nxt[i] = 0;\n }\n }\n while(!que.empty()) {\n TrieNode &now = nodes[que.front()];\n correct[que.front()] += correct[now.nxt[FAIL]];\n que.pop();\n for(int i = 0; i < 4; i++) {\n if(now.nxt[i] == -1) continue;\n int fail = now.nxt[FAIL];\n while(nodes[fail].nxt[i] == -1) {\n fail = nodes[fail].nxt[FAIL];\n }\n nodes[now.nxt[i]].nxt[FAIL] = nodes[fail].nxt[i];\n que.emplace(now.nxt[i]);\n }\n\n }\n }\n\n int move(const string &str, int now = 0)\n {\n for(auto &c : str) {\n while(nodes[now].nxt[to[c]] == -1) now = nodes[now].nxt[FAIL];\n now = nodes[now].nxt[to[c]];\n if(correct[now]) return (-1);\n }\n return (now);\n }\n};\n\nconst int vy[] = {-1, 0, 1, 0}, vx[] = {0, 1, 0, -1};\nconst string tt = \"URDL\";\n\nint H, W, P;\nstring S[50], pat[10];\n\nint bfs()\n{\n Aho_Corasick aho;\n queue< tuple< int, int, int > > que;\n vector< int > v[50][50];\n\n for(int i = 0; i < P; i++) aho.add(pat[i]);\n aho.build();\n\n for(int i = 0; i < H; i++) {\n for(int j = 0; j < W; j++) {\n v[i][j].resize(aho.nodesize(), -1);\n if(S[i][j] == 'S') {\n que.emplace(i, j, 0);\n v[i][j][0] = 0;\n }\n }\n }\n\n while(!que.empty()) {\n int y, x, now;\n tie(y, x, now) = que.front();\n que.pop();\n if(S[y][x] == 'G') return (v[y][x][now]);\n for(int i = 0; i < 4; i++) {\n int ny = y + vy[i], nx = x + vx[i];\n if(ny < 0 || nx < 0 || nx >= W || ny >= H || S[ny][nx] == '#') continue;\n int nt = aho.move(string(1, tt[i]), now);\n if(nt == -1 || ~v[ny][nx][nt]) continue;\n v[ny][nx][nt] = v[y][x][now] + 1;\n que.emplace(ny, nx, nt);\n }\n }\n return (-1);\n}\n\nint main()\n{\n to['U'] = 0, to['R'] = 1, to['D'] = 2, to['L'] = 3;\n\n while(cin >> H >> W, H) {\n for(int i = 0; i < H; i++) cin >> S[i];\n cin >> P;\n for(int i = 0; i < P; i++) cin >> pat[i];\n cout << bfs() << endl;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1e8;\n\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\n\nstring D = \"DRUL\";\n\nconst int var = 4;\n\nint trans(char c) {\n\tswitch (c)\n\t{\n\tcase 'R': return 0;\n\tcase 'D': return 1;\n\tcase 'L': return 2;\n\tcase 'U': return 3;\n\tdefault: break;\n\t}\n\texit(EXIT_FAILURE);\n}\nstruct node {\n\tnode *fail;\n\tvector<node*> next;\n\tvector<int> ok;\n\tnode() : fail(nullptr), next(var, nullptr) {}\n};\n\nnode* getnext(node* p, char c) {\n\twhile (p->next[trans(c)] == nullptr) p = p->fail;\n\treturn p->next[trans(c)];\n}\n\nclass Aho_Corasick {\n\tvector<int> unite(const vector<int>& a, const vector<int>& b) {\n\t\tvector<int> res;\n\t\tset_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res));\n\t\treturn res;\n\t}\n\tint K;\npublic:\n\tnode *root;\n\tAho_Corasick(const vector<string>& Ts) : K(Ts.size()), root(new node) {\n\t\tnode *now;\n\t\troot->fail = root;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tauto &T = Ts[i];\n\t\t\tnow = root;\n\t\t\tfor (auto c : T) {\n\t\t\t\tif (now->next[trans(c)] == nullptr) {\n\t\t\t\t\tnow->next[trans(c)] = new node;\n\t\t\t\t}\n\t\t\t\tnow = now->next[trans(c)];\n\t\t\t}\n\t\t\tnow->ok.push_back(i);\n\t\t}\n\t\tqueue<node*> q;\n\t\tfor (int i = 0; i < var; i++) {\n\t\t\tif (root->next[i] == nullptr) {\n\t\t\t\troot->next[i] = root;\n\t\t\t}\n\t\t\telse {\n\t\t\t\troot->next[i]->fail = root;\n\t\t\t\tq.push(root->next[i]);\n\t\t\t}\n\t\t}\n\t\twhile (!q.empty()) {\n\t\t\tnow = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < var; i++) {\n\t\t\t\tif (now->next[i] != nullptr) {\n\t\t\t\t\tnode *nx = now->fail;\n\t\t\t\t\twhile (nx->next[i] == nullptr) {\n\t\t\t\t\t\tnx = nx->fail;\n\t\t\t\t\t}\n\t\t\t\t\tnow->next[i]->fail = nx->next[i];\n\t\t\t\t\tnow->next[i]->ok = unite(now->next[i]->ok, nx->next[i]->ok);\n\t\t\t\t\tq.push(now->next[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nusing T = tuple<int, int, node*>;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m) {\n\t\tvector<string> S(n);\n\t\tint sx = 0, sy = 0, gx = 0, gy = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> S[i];\n\t\t\tfor (int j = 0; j < (int)S[i].size(); j++) {\n\t\t\t\tif (S[i][j] == 'S') {\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t}\n\t\t\t\telse if (S[i][j] == 'G') {\n\t\t\t\t\tgx = i;\n\t\t\t\t\tgy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> p;\n\t\tvector<string> pts(p);\n\t\tfor (int i = 0; i < p; i++) {\n\t\t\tcin >> pts[i];\n\t\t}\n\t\tAho_Corasick aho(pts);\n\t\tvector<vector<unordered_map<node*, int>>> f(n, vector<unordered_map<node*, int>>(m));\n\t\tqueue<T> q;\n\t\tq.push(make_tuple(sx, sy, aho.root));\n\t\tf[sx][sy][aho.root] = 0;\n\t\twhile (!q.empty()) {\n\t\t\tauto p = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint tx = get<0>(p) + dx[i], ty = get<1>(p) + dy[i];\n\t\t\t\tnode *t = getnext(get<2>(p), D[i]);\n\t\t\t\tif (0 <= tx && tx < n && 0 <= ty && ty < m && S[tx][ty] != '#' && t->ok.empty() && f[tx][ty].count(t) == 0) {\n\t\t\t\t\tq.push(make_tuple(tx, ty, t));\n\t\t\t\t\tf[tx][ty][t] = f[get<0>(p)][get<1>(p)][get<2>(p)] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint res = INF;\n\t\tfor (auto p : f[gx][gy]) {\n\t\t\tres = min(res, p.second);\n\t\t}\n\t\tcout << (res != INF ? res : -1) << endl;\n\t}\n\treturn 0;\n}\n\n", "#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <set>\n#include <queue>\n#include <map>\n#include <fstream>\n#include <cstring>\n#include <sstream>\n\nusing namespace std;\n\ntypedef long long ll;\n\n\nclass Sit{\npublic:\n\tint x,y;\n\tint cur;\n};\n\nclass AhoCorasick{\nprivate:\n // ノード数の最大サイズ\n static const int MAX_V=10001;\nprivate:\n map<string,int> _dict;\n string idToStr[MAX_V];\n int _vertex;\n // 現在の文字列から次はどの文字列へ遷移できるか\n map<int,set<int> > _stepPrv;\n // // 探索失敗した場合に戻るノード\n // map<int,int> _stepBack;\n int _stepBack[MAX_V];\n // // 辞書文字列の集合\n // set<int> _dictStr;\n bool _dictStr[MAX_V];\n // 点に情報を付加したい時のみ使用\n //T _vertexInfos[MAX_V];\npublic:\n //AhoCorasick();\n AhoCorasick(const vector<string> inStrings):_vertex(1){\n memset(_dictStr,0,sizeof(_dictStr));\n memset(_stepBack,0,sizeof(_stepBack));\n for(int i=0;i<(int)inStrings.size();i++){\n if(_dict.find(inStrings[i])==_dict.end()){\n\tidToStr[_vertex]=inStrings[i];\n\t_dict[inStrings[i]]=_vertex++;\n\t_dictStr[_vertex-1]=true;\n\t//_dictStr.insert(_vertex-1);\n }\n }\n makeTree(inStrings);\n }\n int getStrId(string s){\n if(_dict.find(s)==_dict.end())return -1;\n return _dict[s];\n }\n int getVetex(){\n return _vertex;\n }\n // 現在の文字列を外から与え、１文字ずつ探索(valid)\n bool isMatchOneByOne(char ch,int &cur){\n // 必要であれば、ここでcurがdict内に存在しないかチェック\n /*\n */\n while(1){\n int nxt=cur;\n string nstr=idToStr[nxt];\n nstr+=ch;\n bool isFound=false;\n if(_dict.count(nstr)>0){\n\tisFound=true;\n\tnxt=_dict[nstr];\n }\n // もし今の場所から次の場所へ遷移可能ならば\n if(isFound&& _stepPrv.find(cur)!=_stepPrv.end()\n\t &&_stepPrv[cur].find(nxt)!=_stepPrv[cur].end()){\n\t// 今回の場所から戻れる場所で、マッチするものがあるかをチェック\n\tint tmpStr=nxt;\n\twhile(tmpStr!=0){\n\t if(_dictStr[tmpStr]){\n\t //if(_dictStr.find(tmpStr)!=_dictStr.end()){\n\t cur=tmpStr;\n\t return true;\n\t }\n\t tmpStr=_stepBack[tmpStr];\n\t}\n\tcur=nxt;/*これをいれる必要あり？*/\n\tbreak;\n }\n // そうでなければ、戻って次のループで再び探索を行う\n else{\n\t// rootで見つからなければ、終了\n\tif(cur==0)return false;\n\t// 現在探索中の文字列はノードに存在しない\n\t//else if(_stepBack[cur]==-1)cur=0;\n\t//else if(_stepBack.find(cur)==_stepBack.end())cur=0;\n\telse{\n\t // rootでない場合は、戻って今回の文字をもう一度見る\n\t cur=_stepBack[cur];\n\t}\n }\n }\n // もし辞書内の文字列が見つかればtrue\n return (_dictStr[cur]);\n // if(_dictStr.find(cur)!=_dictStr.end())return true;\n // return false;\n }\nprivate:\n // コピーコンストラクタと、代入演算子は使用禁止にする\n AhoCorasick(const AhoCorasick&ah);\n AhoCorasick &operator=(const AhoCorasick&ah);\nprivate:\n // O(size(_dict)^2+size(_dict)*avg(strSize))\n void makeTree(const vector<string> &inStrings){\n // 0または空文字列がルートノード\n _dict[\"\"]=0;\n idToStr[0]=\"\";\n for(int i=0;i<(int)inStrings.size();i++){\n for(int j=0;j<(int)inStrings[i].size();j++){\n\tstring s=inStrings[i].substr(0,j+1);\n\t// まだ追加されていないのであれば、追加する\n\tif(_dict.find(s)==_dict.end()){\n\t idToStr[_vertex]=s;\n\t _dict[s]=_vertex++;\n\t}\n }\n }\n // 探索を前に進める方向へエッジを結ぶ\n for(map<string,int>::iterator it=_dict.begin();it!=_dict.end();it++){\n for(map<string,int>::iterator iit=_dict.begin();iit!=_dict.end();iit++){\n\tif(it==iit)continue;\n\t// もしiit->firstがsize(it->first)+1文字で構成されるならば、エッジを引く\n\tif(it->first.size()==iit->first.size()-1\n\t &&it->first==iit->first.substr(0,it->first.size())){\n\t _stepPrv[it->second].insert(iit->second);\n\t}\n }\n }\n // 探索を後ろへ進める方向へエッジを結ぶ\n for(map<string,int>::iterator it=_dict.begin();it!=_dict.end();it++){\n if(it->first==\"\")continue;\n // 現在の文字列から先頭i文字を取り除いたものへ戻れるか順番にチェック\n // 戻れなければルートへ戻る\n bool ok=false;\n for(int i=0;i<(int)it->first.size()-1;i++){\n\tstring s=it->first.substr(i+1);\n\tif(_dict.find(s)!=_dict.end()){\n\t _stepBack[it->second]=_dict[s];\n\t ok=true;\n\t break;\n\t}\n }\n // ルートへ戻る\n if(!ok)_stepBack[it->second]=0;\n }\n }\n};\n\n\nint h,w;\nint n;\nchar field[51][51];\nstring prohibits[20];\nint sy,sx,gx,gy;\nset<int> used[51][51];\n\nconst int dy[]={-1,0,1,0};\nconst int dx[]={0,1,0,-1};\n\nint bfs(){\n\tvector<string> vs;\n\tfor(int i=0;i<n;i++)vs.push_back(prohibits[i]);\n\tAhoCorasick ac(vs);\n\tSit init;\n\tinit.x=sx;\n\tinit.y=sy;\n\tinit.cur=0;\n\tqueue<Sit> q[2];\n\tint cur=0;\n\tint nxt=1;\n\tq[cur].push(init);\n\tused[init.y][init.x].insert(0);\n\tint cnt=0;\n\twhile(q[cur].size()){\n\t\twhile(q[cur].size()){\n\t\t\tSit s=q[cur].front();\n\t\t\tq[cur].pop();\n\t\t\tif(s.y==gy&&s.x==gx)return cnt;\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tint ny=s.y+dy[i];\n\t\t\t\tint nx=s.x+dx[i];\n\t\t\t\tif(ny>=0&&nx>=0&&ny<h&&nx<w&&field[ny][nx]=='.'){\n\t\t\t\t\tchar ch=i+'0';\n\t\t\t\t\tSit nsit;\n\t\t\t\t\tnsit.y=ny;nsit.x=nx;\n\t\t\t\t\tnsit.cur=s.cur;\n\t\t\t\t\tbool b=ac.isMatchOneByOne(ch,nsit.cur);\n\t\t\t\t\t// matchしたら、遷移しない\n\t\t\t\t\tif(b)continue;\n\t\t\t\t\t// nsit.curのノードへすでに達したかどうか\n\t\t\t\t\tif(used[ny][nx].find(nsit.cur)==used[ny][nx].end()){\n\t\t\t\t\t\tq[nxt].push(nsit);\n\t\t\t\t\t\tused[ny][nx].insert(nsit.cur);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt++;\n\t\tswap(cur,nxt);\n\t}\n\treturn -1;\n}\n\nint main(){\n\n\twhile(cin>>h>>w&&(h|w)){\n\t\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)used[i][j].clear();\n\t\tfor(int i=0;i<h;i++){\n\t\t\tfor(int j=0;j<w;j++){\n\t\t\t\tcin>>field[i][j];\n\t\t\t\tif(field[i][j]=='S'){\n\t\t\t\t\tsy=i;\n\t\t\t\t\tsx=j;\n\t\t\t\t\tfield[i][j]='.';\n\t\t\t\t}\n\t\t\t\telse if(field[i][j]=='G'){\n\t\t\t\t\tgy=i;\n\t\t\t\t\tgx=j;\n\t\t\t\t\tfield[i][j]='.';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin>>n;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>prohibits[i];\n\t\t\tfor(int j=0;j<(int)prohibits[i].size();j++){\n\t\t\t\tif(prohibits[i][j]=='U')prohibits[i][j]='0';\n\t\t\t\telse if(prohibits[i][j]=='R')prohibits[i][j]='1';\n\t\t\t\telse if(prohibits[i][j]=='D')prohibits[i][j]='2';\n\t\t\t\telse if(prohibits[i][j]=='L')prohibits[i][j]='3';\n\t\t\t}\n\t\t}\n\t\tint res=bfs();\n\t\tcout<<res<<endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<vector>\n#include<tuple>\n#include<queue>\n#include<set>\n\nusing namespace std;\n\nstruct S{\n int y,x,t;\n vector<int> v;\n};\n\nint main(){\n for(int N,M;cin>>N>>M,N;){\n char g[50][51];\n int y,x;\n for(int i=0;i<N;i++){\n cin>>g[i];\n for(int j=0;j<M;j++){\n\tif(g[i][j]=='S'){\n\t y=i;\n\t x=j;\n\t}\n }\n }\n int P;\n cin>>P;\n string p[10];\n for(int i=0;i<P;i++){\n cin>>p[i];\n }\n set<vector<int> > s[50][50];\n queue<S> que;\n que.push({y,x,0,vector<int>(P)});\n while(!que.empty()){\n auto cs=que.front();\n if(g[cs.y][cs.x]=='G')break;\n que.pop();\n if(!s[cs.y][cs.x].insert(cs.v).second)continue;\n for(int i=0;i<4;i++){\n\tstatic const int dy[]={-1,0,1,0};\n\tstatic const int dx[]={0,1,0,-1};\n\tint ny=cs.y+dy[i];\n\tint nx=cs.x+dx[i];\n\tif(0<=ny&&ny<N&&0<=nx&&nx<M&&g[ny][nx]!='#'){\n\t S ns{ny,nx,cs.t+1,cs.v};\n\t for(int j=0;j<P;j++){\n\t string c=p[j].substr(0,cs.v[j])+\"URDL\"[i];\n\t while(p[j].compare(0,c.size(),c)){\n\t c.erase(c.begin());\n\t }\n\t if(c==p[j])goto fail;\n\t ns.v[j]=c.size();\n\t }\n\t que.push(ns);\n\tfail:\n\t ;\n\t}\n }\n }\n cout<<(que.empty()?-1:que.front().t)<<endl;\n }\n}", "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <utility>\n#include <tuple>\n#define maxn 55\n#define maxV 105\n#define mt make_tuple\n\nusing namespace std;\ntypedef long long ll;\ntypedef tuple<int, int, int> T;\nstruct node{\n int chi[4], fail;\n bool forbid;\n node(){\n memset(chi, 0, sizeof(chi));\n fail = forbid = 0;\n }\n}a[maxV]; int V;\n// root: node 1.\nnamespace acAuto{\n void init(){\n for(int i = 1;i <= V;i++) a[i] = node();\n V = 1;\n }\n void ins(int* s, int n){ // |S| = n.\n int u = 1;\n for(int i = 1;i <= n;i++){\n if(!a[u].chi[s[i]]) a[u].chi[s[i]] = ++V;\n u = a[u].chi[s[i]];\n }\n a[u].forbid = true;\n }\n void build(){\n queue<int> que;\n que.push(1);\n while(!que.empty()){\n int u = que.front();\n que.pop();\n for(int i = 0;i < 4;i++){\n int v = a[u].chi[i], f = a[u].fail;\n if(v){\n if(f) a[v].fail = a[f].chi[i];\n else a[v].fail = 1;\n if(a[a[v].fail].forbid) a[v].forbid = true;\n que.push(v);\n }else{\n if(f) a[u].chi[i] = a[f].chi[i];\n else a[u].chi[i] = 1;\n }\n }\n }\n }\n}\nconst int dx[] = {-1, 0, 1, 0};\nconst int dy[] = {0, 1, 0, -1};\nint idx[135], n, m, p, sidx[15], rs, cs, rg, cg;\nchar grid[maxn][maxn], s[15];\nint f[maxn][maxn][maxV];\nvoid solve(){\n acAuto::init();\n for(int i = 1;i <= n;i++) scanf(\"%s\", grid[i] + 1);\n scanf(\"%d\", &p);\n for(int i = 1;i <= p;i++){\n scanf(\"%s\", s + 1);\n int l = strlen(s + 1);\n for(int j = 1;j <= l;j++) sidx[j] = idx[(int)s[j]];\n acAuto::ins(sidx, l);\n }\n acAuto::build();\n for(int i = 0;i <= n + 1;i++) grid[i][0] = grid[i][m + 1] = '#';\n for(int i = 1;i <= m;i++) grid[0][i] = grid[n + 1][i] = '#';\n for(int i = 1;i <= n;i++){\n for(int j = 1;j <= m;j++){\n if(grid[i][j] == 'S') rs = i, cs = j;\n else if(grid[i][j] == 'G') rg = i, cg = j;\n }\n }\n memset(f, 0x3f, sizeof(f));\n f[rs][cs][1] = 0;\n queue<T> que;\n que.push(mt(rs, cs, 1));\n while(!que.empty()){\n int x = get<0>(que.front()), y = get<1>(que.front()), u = get<2>(que.front());\n que.pop();\n if(x == rg && y == cg){\n printf(\"%d\\n\", f[x][y][u]);\n return;\n }\n for(int d = 0;d < 4;d++){\n int cx = x + dx[d], cy = y + dy[d], cu = a[u].chi[d];\n if(grid[cx][cy] != '#' && !a[cu].forbid && f[x][y][u] + 1 < f[cx][cy][cu]){\n f[cx][cy][cu] = f[x][y][u] + 1;\n que.push(mt(cx, cy, cu));\n }\n }\n }\n puts(\"-1\");\n}\nint main(){\n idx['U'] = 0, idx['R'] = 1, idx['D'] = 2, idx['L'] = 3;\n while(~scanf(\"%d%d\", &n, &m) && n) solve();\n return 0;\n}\n\n", "#include <iostream>\n#include <cstdlib>\n#include <map>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\nusing namespace std;\n\nstruct NODE{\n\tint x,y,a,b,cost;\n\tNODE(int A,int B,int C,int D,int E){\n\t\tx = A , \n\t\ty = B , \n\t\ta = C , \n\t\tb = D , \n\t\tcost = E ;\n\t}\n};\n\nint dx[] = {-1,0,1,0};\nint dy[] = {0,-1,0,1};\nchar dc[]= {'L','U','R','D'};\nint main(){\n\tint W,H;\n\twhile(cin >> H >> W , H ){\n\t\tchar field[52][52];\n\t\trep(i,52)rep(j,52)field[i][j] = '#';\n\t\trep(i,H)rep(j,W)cin >> field[i+1][j+1];\n\t\tint sx , sy;\n\t\trep(i,H+1)rep(j,W+1)\n\t\t\tif(field[i][j] == 'S') sx = j , sy = i;\n\t\tint p;\n\t\tcin >> p;\n\t\tvector<string> P(10);\n\t\trep(i,p) cin >> P[i];\n\t\t//rep(i,p)rep(j,p-1)if(P[j].length() < P[j+1].length() ) swap(P[j],P[j+1]);\n\t\t\n\t\t\n\t\tbool done[52][52][11][11]={0};\n\t\tqueue<NODE> Q;\n\t\tQ.push(NODE(sx,sy,0,0,0));\n\t\t//rep(i,p)cout << P[i] << endl;\n\t\twhile(Q.size()){\n\t\t\tNODE q = Q.front(); Q.pop();\n\t\t\tstring pt = P[q.a].substr(0,q.b);\n\t\t\tbool f = true;\n\t\t\trep(i,p) if(~pt.find(P[i]))f=0;\n\t\t\tif(!f)continue;\n\t\t\tif(field[q.y][q.x] == 'G'){\n\t\t\t\tcout << q.cost << endl;\n\t\t\t\tgoto end;\n\t\t\t}\n\t\t\t\n\t\t\tif(done[q.y][q.x][q.a][q.b]) continue;\n\t\t\telse done[q.y][q.x][q.a][q.b] = true;\n\t\t\t\n\t\t\tif(field[q.y][q.x] == '#') continue;\n\t\t\t\n\t\t\trep(d,4){\n\t\t\t\tstring st , t = pt + dc[d];\n\t\t\t\tint tx = q.x + dx[d] , ty = q.y + dy[d];\n\t\t\t\trep(i,t.size()){\n\t\t\t\t\tst = t.substr(i);\n\t\t\t\t\trep(j,p){\n\t\t\t\t\t\tif( P[j].find(st) == 0){\n\t\t\t\t\t\t\tQ.push(NODE(q.x+dx[d],q.y+dy[d],j,st.size(),q.cost+1));\n\t\t\t\t\t\t\tgoto ooo;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tQ.push(NODE(q.x+dx[d],q.y+dy[d],0,0,q.cost+1));\n\t\t\t\tooo:;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tcout << -1 << endl;\n\t\tend:;\n\t}\t\n}", "/*\n * AOJ 2212: Stolen Jewel\n * ???????????°?????????????????°??°???????????¨?????¨???????????????????????¨???????????¶?????????????????¢?????????????????¨???????????????????????¢????¬????????????¶????±???°????????????????°???\\??°???\n * ?±???????DP+?????????\n * ??????????????¢?§???????????????????????????¶???????¢??????????????????¨??¶???i????????????????????????????¬???¬?§???°?????????????????¶???j???d[x][y][i]??¨??????(x,y)??¨?????????i???????°???\\??°?????¨Dijkstra?????°??°????????????????????????\n */\n\n#include <cstdio>\n#include <queue>\n#include <cstring>\n#include <algorithm>\n#include <iostream>\n#include <string>\n\n\nusing namespace std;\n\n\nint m, n, nr, ns;\nstring mat[53];\nstring rule[13];\n\nint d[53][53][113];\nint t[113][4];\nstring suf[113];\n\nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, 1, 0, -1};\nchar dc[] = {'U', 'R', 'D', 'L'};\n\n\nstruct Status {\n int x, y, s, d;\n\n Status() {}\n\n Status(int dd, int xx, int yy, int ss) : d(dd), x(xx), y(yy), s(ss) {}\n\n void Get(int &dd, int &xx, int &yy, int &ss) const {\n dd = d;\n xx = x;\n yy = y;\n ss = s;\n }\n\n bool operator<(const Status &ts) const {\n return d > ts.d;\n }\n};\n\npriority_queue<Status> pq;\n\nint Dijkstra() {\n while (!pq.empty()) pq.pop();\n memset(d, 0x3f, sizeof(d));\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < n; ++j) {\n if (mat[i][j] == 'S') {\n d[i][j][0] = 0;\n pq.emplace(0, i, j, 0);\n goto L;\n }\n }\n }\n L:\n int ans = -1;\n while (!pq.empty()) {\n int pre, x, y, s;\n pq.top().Get(pre, x, y, s);\n pq.pop();\n if (pre > d[x][y][s]) continue;\n for (int k = 0; k < 4; ++k) {\n int xx, yy, ss;\n ss = t[s][k];\n if (ss == -1) continue;\n xx = x + dx[k];\n yy = y + dy[k];\n\n if (xx >= 0 && xx < m && yy >= 0 && yy < n && mat[xx][yy] != '#' && pre + 1 < d[xx][yy][ss]) {\n if (mat[xx][yy] == 'G') {\n ans = pre + 1;\n return ans;\n }\n d[xx][yy][ss] = pre + 1;\n pq.emplace(pre + 1, xx, yy, ss);\n }\n }\n }\n return ans;\n}\n\n\nbool IsSuf(string a, string b) {\n if (a.length() < b.length()) return false;\n return a.substr(a.length() - b.length()) == b;\n}\n\nvoid GaoEdge() {\n sort(suf, suf + ns);\n memset(t, 0, sizeof(t));\n for (int i = 0; i < ns; ++i) {\n for (int k = 0; k < 4; ++k) {\n string ts = suf[i] + dc[k];\n for (int j = 0; j < nr; ++j) {\n if (IsSuf(ts, rule[j])) {\n t[i][k] = -1;\n break;\n }\n }\n if (t[i][k] != -1) {\n for (int j = 0; j < ns; ++j) {\n if (IsSuf(ts, suf[j]) && suf[j].length() > suf[t[i][k]].length()) {\n t[i][k] = j;\n }\n }\n }\n }\n }\n}\n\n\nint main() {\n //freopen(\"/Users/yogy/acm-challenge-workbook/db.in\", \"r\", stdin);\n while (cin >> m >> n && m > 0 && n > 0) {\n for (int i = 0; i < m; ++i) {\n cin >> mat[i];\n }\n cin >> nr;\n ns = 0;\n suf[ns++] = \"\";\n for (int i = 0; i < nr; ++i) {\n cin >> rule[i];\n for (int j = 1; j < rule[i].length(); ++j) {\n suf[ns++] = rule[i].substr(0, j);\n }\n }\n GaoEdge();\n int ans = Dijkstra();\n cout << ans << endl;\n }\n return 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\ntemplate <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }\n#endif\n\n#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define popcount __builtin_popcount\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntemplate <class T> void max_swap(T& a, const T& b) { a = max(a, b); }\ntemplate <class T> void min_swap(T& a, const T& b) { a = min(a, b); }\n\ntypedef long long ll;\ntypedef pair<int, int> pint;\n\nconst double PI = acos(-1.0);\nconst int dx[] = { 0, 1, 0, -1 };\nconst int dy[] = { 1, 0, -1, 0 };\n\n\nvector<int> build_pma(const vector<int>& pat)\n{\n\tvector<int> res(pat.size() + 1);\n\tres[0] = -1;\n\tfor (int i = 0, j = -1; i < pat.size(); ++i)\n\t{\n\t\twhile (j >= 0 && pat[i] != pat[j])\n\t\t\tj = res[j];\n\t\tres[i + 1] = ++j;\n\t}\n\treturn res;\n}\nll encode(const vector<int>& states)\n{\n\tll res = 0;\n\tfor (int i = states.size() - 1; i >= 0; --i)\n\t\tres = res << 4 | states[i];\n\treturn res;\n}\nvoid decode(ll e, vector<int>& res)\n{\n\tfor (int i = 0; i < res.size(); ++i, e >>= 4)\n\t\tres[i] = e & 0xf;\n}\nll next_states(const vector<vector<int> >& pat, const vector<vector<int> >& pma, ll states, int dir)\n{\n\tll res = 0;\n\tvector<int> cur(pat.size()), next;\n\tdecode(states, cur);\n\tfor (int i = 0; i < cur.size(); ++i)\n\t{\n\t\twhile (cur[i] >= 0 && pat[i][cur[i]] != dir)\n\t\t\tcur[i] = pma[i][cur[i]];\n\t\tif (++cur[i] == pat[i].size())\n\t\t\treturn -1;\n\t\tnext.push_back(cur[i]);\n\t}\n\treturn encode(next);\n}\nstruct Node\n{\n\tchar x, y;\n\tll states;\n\tNode(char x, char y, ll s)\n\t\t: x(x), y(y), states(s) {}\n};\nint main()\n{\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m)\n\t{\n\t\tstring maze[64], pp[16];\n\t\trep (i, n)\n\t\t\tcin >> maze[i];\n\t\tcin >> p;\n\t\trep (i, p)\n\t\t\tcin >> pp[i];\n\n\t\tint sx, sy, gx, gy;\n\t\trep (y, n)\n\t\t{\n\t\t\trep (x, m)\n\t\t\t{\n\t\t\t\tif (maze[y][x] == 'S')\n\t\t\t\t\tsx = x, sy = y;\n\t\t\t\telse if (maze[y][x] == 'G')\n\t\t\t\t\tgx = x, gy = y;\n\t\t\t}\n\t\t}\n\n\t\tvector<vector<int> > pat(p);\n\t\trep (i, p)\n\t\t\trep (j, pp[i].size())\n\t\t\t\tpat[i].push_back(string(\"DRUL\").find(pp[i][j]));\n\n\t\tvector<vector<int> > pma(p);\n\t\trep (i, p)\n\t\t\tpma[i] = build_pma(pat[i]);\n\n\t\tint res = -1;\n\t\tmap<ll, int> visit[64][64];\n\t\tqueue<Node> q;\n\t\tq.push(Node(sx, sy, 0));\n\t\tvisit[sy][sx][0] = 0;\n\t\twhile (!q.empty())\n\t\t{\n\t\t\tNode cur = q.front(); q.pop();\n\t\t\tint cost = visit[cur.y][cur.x][cur.states] + 1;\n\t\t\tfor (int i = 0; i < 4; ++i)\n\t\t\t{\n\t\t\t\tint nx = cur.x + dx[i], ny = cur.y + dy[i];\n\t\t\t\tif (0 <= nx && nx < m && 0 <= ny && ny < n\n\t\t\t\t\t&& maze[ny][nx] != '#')\n\t\t\t\t{\n\t\t\t\t\tll ns = next_states(pat, pma, cur.states, i);\n\t\t\t\t\tif (ns != -1 && !visit[ny][nx].count(ns))\n\t\t\t\t\t{\n\t\t\t\t\t\tvector<int> s(p);\n\t\t\t\t\t\tdecode(ns, s);\n\t\t\t\t\t\tif (nx == gx && ny == gy)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tres = cost;\n\t\t\t\t\t\t\tgoto End;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tq.push(Node(nx, ny, ns));\n\t\t\t\t\t\t\tvisit[ny][nx][ns] = cost;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\nEnd:\n\t\tcout << res << endl;\n\t}\n}", "#include <cstdio>\n#include <cstring>\n#include <vector>\n#include <algorithm>\n#include <queue>\nusing namespace std;\n\nstruct node{\n\tint proh;\n\tint to[4];\n\tint fail;\n\tnode(){\n\t\tproh = 0;\n\t\tmemset(to, -1, sizeof to);\n\t\tfail = 0;\n\t}\n};\n\nint w, h;\nchar field[52][52];\nvector<node> ac;\n\nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, -1, 0, 1};\n\nvoid addptn(const char *ptn){\n\tint x = 1, f = 0;\n\tfor(; *ptn; ++ptn){\n\t\tint d = 0;\n\t\tswitch(*ptn){\n\t\tcase 'L':\n\t\t\td = 0;\n\t\t\tbreak;\n\t\tcase 'U':\n\t\t\td = 1;\n\t\t\tbreak;\n\t\tcase 'R':\n\t\t\td = 2;\n\t\t\tbreak;\n\t\tcase 'D':\n\t\t\td = 3;\n\t\t\tbreak;\n\t\t}\n\n\t\tint y = ac[x].to[d];\n\t\tif(y == -1){\n\t\t\ty = ac.size();\n\t\t\tac[x].to[d] = y;\n\t\t\tac.push_back(node());\n\t\t}\n\t\tx = y;\n\t}\n\tac[x].proh = 1;\n}\n\nint getproh(int p){\n\tif(!ac[p].proh){\n\t\tac[p].proh = getproh(ac[p].fail);\n\t}\n\treturn ac[p].proh;\n}\n\nint solve(){\n\tmemset(field, '#', sizeof field);\n\n\tac.assign(2, node());\n\tfill(ac[0].to, ac[0].to + 4, 1);\n\tac[0].proh = -1;\n\n\tfor(int i = 1; i <= h; ++i){\n\t\tscanf(\"%s\", field[i] + 1);\n\t\tfield[i][w + 1] = '#';\n\t}\n\n\tint n;\n\tchar ptn[16];\n\tscanf(\"%d\", &n);\n\tfor(int i = 0; i < n; ++i){\n\t\tscanf(\"%s\", ptn);\n\t\taddptn(ptn);\n\t}\n\n\tqueue<int> q;\n\tq.push(1);\n\twhile(!q.empty()){\n\t\tint p = q.front();\n\t\tq.pop();\n\t\t\n\t\tfor(int i = 0; i < 4; ++i){\n\t\t\tint t = ac[p].to[i];\n\t\t\tif(t != -1){\n\t\t\t\tq.push(t);\n\t\t\t\t\n\t\t\t\tint f = ac[p].fail;\n\t\t\t\twhile(ac[f].to[i] == -1){\n\t\t\t\t\tf = ac[f].fail;\n\t\t\t\t}\n\t\t\t\tac[t].fail = ac[f].to[i];\n\t\t\t}\n\t\t}\n\t}\n\n\tconst int yofs = 52;\n\tconst int pofs = yofs * yofs;\n\n\tint sy, sx;\n\tfor(int y = 1; y <= h; ++y)\n\tfor(int x = 1; x <= w; ++x){\n\t\tif(field[y][x] == 'S'){\n\t\t\tsy = y;\n\t\t\tsx = x;\n\t\t}\n\t}\n\n\tvector<char> vis(pofs * ac.size());\n\tq.push(sy * yofs + sx + pofs);\n\tvis[q.front()] = 1;\n\tq.push(-1);\n\tint ret = 1;\n\twhile(q.size() > 1){\n\t\tint st = q.front();\n\t\tq.pop();\n\t\tif(st == -1){\n\t\t\tq.push(-1);\n\t\t\t++ret;\n\t\t\tcontinue;\n\t\t}\n\n\t\tint y = st % pofs / yofs;\n\t\tint x = st % yofs;\n\t\tint p = st / pofs;\n\n\t\tfor(int i = 0; i < 4; ++i){\n\t\t\tint ny = y + dy[i], nx = x + dx[i];\n\t\t\tif(field[ny][nx] == '#'){ continue; }\n\t\t\tint np = p;\n\t\t\twhile(ac[np].to[i] == -1){\n\t\t\t\tnp = ac[np].fail;\n\t\t\t}\n\t\t\tnp = ac[np].to[i];\n\t\t\tif(getproh(np) == 1){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tint nst = np * pofs + ny * yofs + nx;\n\t\t\tif(vis[nst]){ continue; }\n\t\t\tvis[nst] = 1;\n\t\t\tif(field[ny][nx] == 'G'){\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tq.push(nst);\n\t\t}\n\t}\n\treturn -1;\n}\n\nint main(){\n\twhile(scanf(\"%d%d\", &h, &w), h){\n\t\tprintf(\"%d\\n\", solve());\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Ahocora{\n\n int idx;\n\n struct PMA {\n int state;\n PMA* next[256];\n vector<int> matched;\n PMA(int idx) { memset(next, 0, sizeof(next)); state = idx ; }\n ~PMA() { for(int i = 0; i < 256; i++) if(next[i]) delete next[i]; }\n };\n vector<int> set_uni(const vector<int> &a,const vector<int> &b) {\n vector<int> res;\n set_union(a.begin(),a.end(),b.begin(),b.end(), back_inserter(res));\n return res;\n };\n\n PMA *root;\n\n map<int,PMA*>M;\n\n Ahocora(vector<string> &pattern) { idx=0;\n root = new PMA(idx++);\n M[idx-1]=root;\n PMA *now;\n root->next[0] = root;\n for(int i = 0; i < pattern.size(); i++) {\n now = root;\n for(int j = 0; j < pattern[i].size(); j++) {\n if(now->next[(int)pattern[i][j]] == 0){\n now->next[(int)pattern[i][j]] = new PMA(idx++);\n M[idx-1] = now->next[(int)pattern[i][j]];\n }\n now = now->next[(int)pattern[i][j]];\n }\n now->matched.push_back(i);\n }\n\n queue<PMA*> que;\n\n for(int i=1;i<256;i++){\n if(!root->next[i]) root->next[i] = root;\n else{\n root->next[i]->next[0] = root;\n que.push(root->next[i]);\n }\n }\n\n while(!que.empty()) {\n now = que.front(); que.pop();//cout<<1;\n for(int i = 1; i < 256; i++) {\n if(now->next[i]){\n PMA *nxt = now->next[0];\n while(!nxt->next[i]) nxt = nxt->next[0];\n now->next[i]->next[0] = nxt->next[i];\n now->next[i]->matched = set_uni(now->next[i]->matched, nxt->next[i]->matched);\n que.push(now->next[i]);\n }\n }\n }\n\n }\n void match( const string s, vector<int> &res) {\n PMA *pma=root;\n for(int i = 0; i < s.size(); i++){\n int c = s[i];\n while(!pma->next[c])\n pma = pma->next[0];\n pma = pma->next[c];\n for(int j = 0; j < pma->matched.size(); j++)\n res[pma->matched[j]] = true;\n }\n }\n int NG( const string s,int S) {\n PMA *pm = M[S];\n //cout<<pm->state<<endl;\n for(int i = 0; i < s.size(); i++){\n int c = s[i];\n while(!pm->next[c])\n pm = pm->next[0];\n pm = pm->next[c];\n for(int j = 0; j < pm->matched.size(); j++) return -1;\n }\n //cout<<pm->state<<endl;\n return pm->state;\n }\n};\n\n#define r(i,n) for(int i=0;i<n;i++)\n\nint h,w,m,x,y;\nint dp[55][55][222];\nstring s[100];\nstring a;\nvector<string>v;\n\nint dx[]={0,1,0,-1};\nint dy[]={-1,0,1,0};\nstring dc[]={\"U\",\"R\",\"D\",\"L\"};\n\nstruct A{\n int x,y,s;\n A(int a,int b,int c){x=a,y=b,s=c;}\n};\n\nint main(){\n while(1){\n v.clear();\n memset(dp,-1,sizeof(dp));\n cin>>h>>w;\n if(!h)break;\n r(i,h)cin>>s[i];\n r(i,h)r(j,w)if(s[i][j]=='S')x=j,y=i;\n cin>>m;\n r(i,m){\n cin>>a;\n v.push_back(a);\n }\n Ahocora AHO(v);\n queue<A>q;\n q.push(A(x,y,0));\n dp[y][x][0]=0;\n while(!q.empty()){\n A p=q.front();q.pop();\n x=p.x;\n y=p.y;\n int S=p.s;\n r(i,4){\n int nx=x+dx[i];\n int ny=y+dy[i];\n int ns=AHO.NG(dc[i],S);\n\n if(ns==-1)continue;\n\n if(ny<0||nx<0||ny>=h||nx>=w)continue;\n if(s[ny][nx]=='#')continue;\n if(dp[ny][nx][ns]!=-1)continue;\n\n if(s[ny][nx]=='G'){\n cout<<dp[y][x][S]+1<<endl;\n goto L;\n }\n dp[ny][nx][ns]=dp[y][x][S]+1;\n\n q.push(A(nx,ny,ns));\n }\n }\n cout<<-1<<endl;\n L:;\n }\n}\n\n", "class _in{struct my_iterator{int it;const bool rev;explicit constexpr my_iterator(int it_, bool rev=false):it(it_),rev(rev){}constexpr int operator*(){return it;}constexpr bool operator!=(my_iterator& r){return it!=r.it;}void operator++(){rev?--it:++it;}};const my_iterator i,n;public:explicit constexpr _in(int n):i(0),n(n){}explicit constexpr _in(int i,int n):i(i,n<i),n(n){}constexpr const my_iterator& begin(){return i;}constexpr const my_iterator& end(){return n;}};\n\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<int Code>\nstruct Node_ {\n Node_* next[Code];\n Node_* fail;\n bool is_taboo;\n Node_() : fail(nullptr), is_taboo(false)\n { fill_n(next, Code, nullptr);}\n};\n\ntypedef Node_<4> node_t;\n\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};\nconst string urdl = \"URDL\"; map<char, int> encoder;\nvoid setEncoder() { for(int i : _in(4)) encoder[urdl[i]] = i;}\n\nvoid constructAC(vector<node_t>& nodes, const vector<string>& patterns) {\n node_t* root = &nodes[0];\n //Phase 1 (trie)\n int count = 0;\n for(const auto& s : patterns) {\n node_t* cur = root;\n for(const char& c : s) {\n int k = encoder[c];\n if(cur->next[k] == nullptr)\n cur->next[k] = &nodes[++count];\n cur = cur->next[k];\n }\n cur->is_taboo = true;\n }\n\n //Phase 2 (failue link)\n queue<node_t*> que;\n for(int i : _in(4)) {\n if(root->next[i] != nullptr) {\n root->next[i]->fail = root;\n que.emplace(root->next[i]);\n }\n else\n root->next[i] = root;\n }\n \n while(!que.empty()) {\n node_t* cur = que.front(); que.pop();\n for(int i : _in(4)) {\n if(cur->next[i] == nullptr) continue;\n que.emplace(cur->next[i]);\n node_t* f = cur->fail;\n while(f->next[i] == nullptr) f = f->fail;\n cur->next[i]->fail = f->next[i];\n }\n }\n}\n\nbool getTaboo(node_t* cur, node_t* root) {\n if(cur == root) return false;\n if(cur->is_taboo == false)\n return getTaboo(cur->fail, root);\n else\n return true;\n}\nusing bs = bitset<2500>;\nint main() {\n cin.tie(0); ios::sync_with_stdio(false);\n setEncoder();\n int N, M;\n while(cin >> N >> M && N) {\n vector<string> fld(N);\n for(auto& s : fld) cin >> s;\n int P; cin >> P;\n vector<string> patterns(P);\n for(auto& s : patterns) cin >> s;\n vector<node_t> nodes(P * 10 + 1);\n constructAC(nodes, patterns);\n node_t* root = &nodes[0];\n int sx = -1, sy = -1;\n for(int i : _in(N))\n for(int j : _in(M))\n if(fld[i][j] == 'S'){\n sx = j, sy = i;\n break;\n }\n vector<bs> used(nodes.size());\n queue<tuple<int, int, int, int>> que;\n que.emplace(0, sx, sy, 0); used[0][sy * 50 + sx] = true;\n bool ok = false;\n while(!que.empty()) {\n int cid, cx, cy, dist;\n tie(cid, cx, cy, dist) = que.front(); que.pop();\n if(fld[cy][cx] == 'G') {\n cout << dist << endl;\n ok = true;\n break;\n }\n for(int i : _in(4)) {\n int nx = cx + dx[i], ny = cy + dy[i];\n if(nx < 0 || ny < 0 || M <= nx || N <= ny) continue;\n if(fld[ny][nx] == '#') continue;\n node_t* cur = &nodes[cid];\n while(cur->next[i] == nullptr) cur = cur->fail;\n cur = cur->next[i];\n if(getTaboo(cur, root)) continue;\n int id = cur - root;\n if(used[id][ny * 50 + nx] == true) continue;\n que.emplace(id, nx, ny, dist + 1);\n used[id][ny * 50 + nx] = true;\n }\n }\n if(!ok) cout << -1 << endl;\n }\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nenum DIR{\n\tNorth,\n\tEast,\n\tSouth,\n\tWest,\n};\n\nenum Type{\n\tTRUE,\n\tFALSE,\n\tUNKNOWN,\n};\n\nstruct Node{\n\tint parent_id,children[4],suffix_link,depth;\n\tbool finish_FLG;\n};\n\nstruct SL{\n\tSL(int arg_node_id,DIR arg_tmp_dir){\n\t\tnode_id = arg_node_id;\n\t\ttmp_dir = arg_tmp_dir;\n\t}\n\tint node_id;\n\tDIR tmp_dir;\n};\n\nstruct Data{\n\tvoid set(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\nstruct Info{\n\tInfo(int arg_row,int arg_col,int arg_sum_cost,int arg_node_loc){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tsum_cost = arg_sum_cost;\n\t\tnode_loc = arg_node_loc;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\t\treturn sum_cost > arg.sum_cost;\n\t}\n\tint row,col,sum_cost,node_loc;\n};\n\n\nint H,W,POW[11];\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nint table[128],min_cost[50][50][200];\nDIR dir_table[4] = {North,East,South,West};\n\nchar base_map[50][51];\nNode nodes[200];\nType type[200];\nData start,goal;\n\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\n\nvoid debug(DIR dir){\n\n\tswitch(dir){\n\tcase North:\n\t\tprintf(\"U\");\n\t\tbreak;\n\tcase East:\n\t\tprintf(\"R\");\n\t\tbreak;\n\tcase South:\n\t\tprintf(\"D\");\n\t\tbreak;\n\tcase West:\n\t\tprintf(\"L\");\n\t\tbreak;\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < 200; i++){\n\t\tnodes[i].finish_FLG = false;\n\t\tnodes[i].suffix_link = 0;\n\t\tfor(int k = 0; k < 4; k++)nodes[i].children[k] = -1;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tscanf(\"%s\",base_map[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(base_map[row][col] == 'S'){\n\n\t\t\t\tstart.set(row,col);\n\n\t\t\t}else if(base_map[row][col] == 'G'){\n\n\t\t\t\tgoal.set(row,col);\n\n\t\t\t}\n\t\t}\n\t}\n\n\tint P;\n\tscanf(\"%d\",&P);\n\n\tint root = 0;\n\n\tnodes[root].parent_id = -1;\n\tnodes[root].depth = 0;\n\tint node_index = 1,tmp_ch,tmp_loc,parent_id,tmp_index;\n\tchar buf[11];\n\n\n\tfor(int loop = 0; loop < P; loop++){\n\n\t\tscanf(\"%s\",buf);\n\n\t\ttmp_index = 0;\n\t\ttmp_ch = table[buf[tmp_index]];\n\n\t\ttmp_loc = root;\n\t\ttmp_index = 0;\n\n\t\twhile(true){\n\n\t\t\tparent_id = tmp_loc;\n\n\t\t\tif(nodes[tmp_loc].children[tmp_ch] == -1){\n\n\t\t\t\tnodes[tmp_loc].children[tmp_ch] = node_index++;\n\t\t\t}\n\t\t\ttmp_loc = nodes[tmp_loc].children[tmp_ch];\n\n\t\t\tnodes[tmp_loc].parent_id = parent_id;\n\t\t\tnodes[tmp_loc].depth = nodes[parent_id].depth+1;\n\n\t\t\ttmp_index++;\n\n\t\t\tif(buf[tmp_index] == '\\0'){\n\t\t\t\tnodes[tmp_loc].finish_FLG = true;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\ttmp_ch = table[buf[tmp_index]];\n\t\t}\n\t}\n\n\tint tmp,start_pos;\n\tbool Found;\n\n\tqueue<SL> MAKE_SL;\n\tfor(int i = 0; i < 4; i++){\n\t\tif(nodes[root].children[i] != -1){\n\t\t\tMAKE_SL.push(SL(nodes[root].children[i],dir_table[i]));\n\t\t}\n\t}\n\n\tint node_id;\n\tDIR tmp_dir;\n\twhile(!MAKE_SL.empty()){\n\t\tnode_id = MAKE_SL.front().node_id;\n\t\ttmp_dir = MAKE_SL.front().tmp_dir;\n\t\tMAKE_SL.pop();\n\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tif(nodes[node_id].children[i] != -1){\n\t\t\t\tMAKE_SL.push(SL(nodes[node_id].children[i],dir_table[i]));\n\t\t\t}\n\t\t}\n\n\t\tfor(tmp_loc = nodes[nodes[node_id].parent_id].suffix_link; tmp_loc != root; tmp_loc = nodes[tmp_loc].suffix_link){\n\t\t\tif(nodes[tmp_loc].children[tmp_dir] != -1){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(tmp_loc == root){\n\t\t\tif(nodes[root].children[tmp_dir] != -1){\n\t\t\t\tif(node_id == nodes[root].children[tmp_dir]){\n\t\t\t\t\tnodes[node_id].suffix_link = root;\n\t\t\t\t}else{\n\t\t\t\t\tnodes[node_id].suffix_link = nodes[root].children[tmp_dir];\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tnodes[node_id].suffix_link = root;\n\t\t\t}\n\t\t}else{\n\t\t\tnodes[node_id].suffix_link = nodes[tmp_loc].children[tmp_dir];\n\t\t}\n\t}\n\n\tfor(int i = 0; i < node_index; i++){\n\t\ttype[i] = UNKNOWN;\n\t}\n\n\ttype[root] = FALSE;\n\n\tqueue<int> CHECK;\n\tfor(int i = 0; i < 4; i++){\n\t\tif(nodes[root].children[i] != -1){\n\t\t\tif(nodes[nodes[root].children[i]].finish_FLG){\n\t\t\t\ttype[nodes[root].children[i]] = TRUE;\n\t\t\t}else{\n\t\t\t\ttype[nodes[root].children[i]] = FALSE;\n\t\t\t}\n\t\t\tCHECK.push(nodes[root].children[i]);\n\t\t}\n\t}\n\n\twhile(!CHECK.empty()){\n\t\tnode_id = CHECK.front();\n\t\tCHECK.pop();\n\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tif(nodes[node_id].children[i] != -1){\n\t\t\t\tCHECK.push(nodes[node_id].children[i]);\n\t\t\t}\n\t\t}\n\n\t\tif(nodes[node_id].finish_FLG){\n\t\t\ttype[node_id] = TRUE;\n\t\t}else{\n\t\t\tfor(tmp_loc = nodes[node_id].suffix_link; tmp_loc != root; tmp_loc = nodes[tmp_loc].suffix_link){\n\t\t\t\tif(type[tmp_loc] != UNKNOWN)break;\n\t\t\t}\n\t\t\ttype[node_id] = type[tmp_loc];\n\t\t}\n\t}\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tfor(int node_loc = 0; node_loc < node_index; node_loc++)min_cost[row][col][node_loc] = BIG_NUM;\n\t\t}\n\t}\n\n\tmin_cost[start.row][start.col][0] = 0;\n\n\tpriority_queue<Info> Q;\n\tQ.push(Info(start.row,start.col,0,0));\n\n\tint next_node_pos,adj_row,adj_col;\n\tDIR next_dir;\n\n\tbool FLG;\n\n\tint calc;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().row == goal.row && Q.top().col == goal.col){\n\n\t\t\tprintf(\"%d\\n\",Q.top().sum_cost);\n\t\t\treturn;\n\n\t\t}else if(Q.top().sum_cost > min_cost[Q.top().row][Q.top().col][Q.top().node_loc]){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tadj_row = Q.top().row+diff_row[i];\n\t\t\t\tadj_col = Q.top().col+diff_col[i];\n\n\t\t\t\tif(rangeCheck(adj_row,adj_col) == false || base_map[adj_row][adj_col] == '#')continue;\n\n\t\t\t\tswitch(i){\n\t\t\t\tcase 0:\n\t\t\t\t\tnext_dir = North;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\tnext_dir = West;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tnext_dir = East;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tnext_dir = South;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif(nodes[Q.top().node_loc].children[next_dir] != -1){\n\n\t\t\t\t\tnext_node_pos = nodes[Q.top().node_loc].children[next_dir];\n\n\t\t\t\t}else{\n\n\t\t\t\t\tif(Q.top().node_loc == 0){\n\n\t\t\t\t\t\tnext_node_pos = 0;\n\n\t\t\t\t\t\tif(min_cost[adj_row][adj_col][next_node_pos] > Q.top().sum_cost+1){\n\t\t\t\t\t\t\tmin_cost[adj_row][adj_col][next_node_pos] = Q.top().sum_cost+1;\n\t\t\t\t\t\t\tQ.push(Info(adj_row,adj_col,Q.top().sum_cost+1,next_node_pos));\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\ttmp = nodes[Q.top().node_loc].suffix_link;\n\n\t\t\t\t\twhile(tmp != 0 && nodes[tmp].children[next_dir] == -1){\n\t\t\t\t\t\ttmp = nodes[tmp].suffix_link;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(tmp == 0){\n\t\t\t\t\t\tif(nodes[tmp].children[next_dir] == -1){\n\t\t\t\t\t\t\tnext_node_pos = 0;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tnext_node_pos = nodes[tmp].children[next_dir];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnext_node_pos = nodes[tmp].children[next_dir];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tFLG = true;\n\t\t\t\ttmp = next_node_pos;\n\n\t\t\t\tif(type[next_node_pos] == TRUE)continue;\n\n\t\t\t\tif(min_cost[adj_row][adj_col][next_node_pos] > Q.top().sum_cost+1){\n\t\t\t\t\tmin_cost[adj_row][adj_col][next_node_pos] = Q.top().sum_cost+1;\n\t\t\t\t\tQ.push(Info(adj_row,adj_col,Q.top().sum_cost+1,next_node_pos));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\tprintf(\"-1\\n\");\n}\n\n\nint main(){\n\n\tfor(int i = 0; i < 11; i++)POW[i] = pow(4,i);\n\n\ttable['U'] = North;\n\ttable['R'] = East;\n\ttable['D'] = South;\n\ttable['L'] = West;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&H,&W);\n\t\tif(H == 0 && W == 0)break;\n\n\t\tfunc();\n\t}\n\treturn 0;\n}\n\n", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nenum DIR{\n\tNorth,\n\tEast,\n\tSouth,\n\tWest,\n};\n\nstruct Node{\n\tint num,parent_id,children[4],suffix_link,depth;\n\tbool finish_FLG;\n\tDIR pattern[10];\n};\n\nstruct Data{\n\tvoid set(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\nstruct Info{\n\tInfo(int arg_row,int arg_col,int arg_sum_cost,int arg_node_loc){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tsum_cost = arg_sum_cost;\n\t\tnode_loc = arg_node_loc;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\t\treturn sum_cost > arg.sum_cost;\n\t}\n\tint row,col,sum_cost,node_loc;\n};\n\n\nint H,W,POW[11];\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nint table[128],min_cost[50][50][200];\nDIR dir_table[4] = {North,East,South,West};\n\nchar base_map[50][51];\nNode nodes[200];\nData start,goal;\nmap<int,int> MAP;\n\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\n\nvoid debug(DIR dir){\n\n\tswitch(dir){\n\tcase North:\n\t\tprintf(\"U\");\n\t\tbreak;\n\tcase East:\n\t\tprintf(\"R\");\n\t\tbreak;\n\tcase South:\n\t\tprintf(\"D\");\n\t\tbreak;\n\tcase West:\n\t\tprintf(\"L\");\n\t\tbreak;\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < 200; i++){\n\t\tnodes[i].finish_FLG = false;\n\t\tfor(int k = 0; k < 4; k++)nodes[i].children[k] = -1;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tscanf(\"%s\",base_map[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(base_map[row][col] == 'S'){\n\n\t\t\t\tstart.set(row,col);\n\n\t\t\t}else if(base_map[row][col] == 'G'){\n\n\t\t\t\tgoal.set(row,col);\n\n\t\t\t}\n\t\t}\n\t}\n\n\tint P;\n\tscanf(\"%d\",&P);\n\n\tnodes[0].parent_id = -1;\n\tnodes[0].num = 0;\n\tnodes[0].depth = 0;\n\tint node_index = 1,tmp_ch,tmp_loc,parent_id,tmp_index;\n\tchar buf[11];\n\tMAP.clear();\n\n\n\tfor(int loop = 0; loop < P; loop++){\n\n\t\tscanf(\"%s\",buf);\n\n\t\ttmp_index = 0;\n\t\ttmp_ch = table[buf[tmp_index]];\n\n\t\ttmp_loc = 0;\n\t\ttmp_index = 0;\n\n\t\twhile(true){\n\n\t\t\tparent_id = tmp_loc;\n\n\t\t\tif(nodes[tmp_loc].children[tmp_ch] == -1){\n\n\t\t\t\tnodes[tmp_loc].children[tmp_ch] = node_index++;\n\t\t\t}\n\n\t\t\ttmp_loc = nodes[tmp_loc].children[tmp_ch];\n\n\t\t\tnodes[tmp_loc].parent_id = parent_id;\n\n\t\t\tfor(int i = 0; i < nodes[parent_id].depth; i++){\n\t\t\t\tnodes[tmp_loc].pattern[i] = nodes[parent_id].pattern[i];\n\t\t\t}\n\t\t\tnodes[tmp_loc].pattern[nodes[parent_id].depth] = dir_table[tmp_ch];\n\t\t\tnodes[tmp_loc].depth = nodes[parent_id].depth+1;\n\n\t\t\ttmp_index++;\n\n\t\t\tnodes[tmp_loc].num = -1;\n\t\t\tfor(int i = 0; i < nodes[tmp_loc].depth; i++){\n\t\t\t\tnodes[tmp_loc].num += (nodes[tmp_loc].pattern[i]+1)*POW[i];\n\t\t\t}\n\n\t\t\tMAP[nodes[tmp_loc].num] = tmp_loc;\n\n\t\t\tif(buf[tmp_index] == '\\0'){\n\t\t\t\tnodes[tmp_loc].finish_FLG = true;\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\ttmp_ch = table[buf[tmp_index]];\n\t\t}\n\t}\n\n\tint tmp,start_pos;\n\tbool Found;\n\n\tfor(int i = 1; i < node_index; i++){\n\n\t\tFound = false;\n\t\tstart_pos = 1;\n\n\t\twhile(start_pos < nodes[i].depth){\n\n\t\t\ttmp = -1;\n\t\t\tfor(int k = start_pos; k < nodes[i].depth; k++){\n\t\t\t\ttmp += (nodes[i].pattern[k]+1)*POW[k-start_pos];\n\t\t\t}\n\n\t\t\tauto at = MAP.find(tmp);\n\t\t\tif(at != MAP.end()){\n\t\t\t\tFound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tstart_pos++;\n\t\t}\n\n\t\tif(!Found){\n\t\t\tnodes[i].suffix_link = 0;\n\t\t}else{\n\n\t\t\tnodes[i].suffix_link = MAP[tmp];\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tfor(int node_loc = 0; node_loc < node_index; node_loc++)min_cost[row][col][node_loc] = BIG_NUM;\n\t\t}\n\t}\n\n\tmin_cost[start.row][start.col][0] = 0;\n\n\tpriority_queue<Info> Q;\n\tQ.push(Info(start.row,start.col,0,0));\n\n\tint next_node_pos,adj_row,adj_col;\n\tDIR next_dir;\n\n\tbool FLG;\n\n\tint calc;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().row == goal.row && Q.top().col == goal.col){\n\n\t\t\tprintf(\"%d\\n\",Q.top().sum_cost);\n\t\t\treturn;\n\n\t\t}else if(Q.top().sum_cost > min_cost[Q.top().row][Q.top().col][Q.top().node_loc]){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tadj_row = Q.top().row+diff_row[i];\n\t\t\t\tadj_col = Q.top().col+diff_col[i];\n\n\t\t\t\tif(rangeCheck(adj_row,adj_col) == false || base_map[adj_row][adj_col] == '#')continue;\n\n\t\t\t\tswitch(i){\n\t\t\t\tcase 0:\n\t\t\t\t\tnext_dir = North;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\tnext_dir = West;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tnext_dir = East;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tnext_dir = South;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif(nodes[Q.top().node_loc].children[next_dir] != -1){\n\n\t\t\t\t\tnext_node_pos = nodes[Q.top().node_loc].children[next_dir];\n\n\t\t\t\t}else{\n\n\t\t\t\t\tif(Q.top().node_loc == 0){\n\n\t\t\t\t\t\tnext_node_pos = 0;\n\n\t\t\t\t\t\tif(min_cost[adj_row][adj_col][next_node_pos] > Q.top().sum_cost+1){\n\t\t\t\t\t\t\tmin_cost[adj_row][adj_col][next_node_pos] = Q.top().sum_cost+1;\n\t\t\t\t\t\t\tQ.push(Info(adj_row,adj_col,Q.top().sum_cost+1,next_node_pos));\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\ttmp = nodes[Q.top().node_loc].suffix_link;\n\n\t\t\t\t\twhile(tmp != 0 && nodes[tmp].children[next_dir] == -1){\n\t\t\t\t\t\ttmp = nodes[tmp].suffix_link;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(tmp == 0){\n\t\t\t\t\t\tif(nodes[tmp].children[next_dir] == -1){\n\t\t\t\t\t\t\tnext_node_pos = 0;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tnext_node_pos = nodes[tmp].children[next_dir];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnext_node_pos = nodes[tmp].children[next_dir];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tFLG = true;\n\n\t\t\t\ttmp = next_node_pos;\n\n\t\t\t\twhile(tmp != 0){\n\t\t\t\t\tif(nodes[tmp].finish_FLG){\n\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\ttmp = nodes[tmp].suffix_link;\n\t\t\t\t}\n\n\t\t\t\tif(!FLG)continue;\n\n\t\t\t\tif(min_cost[adj_row][adj_col][next_node_pos] > Q.top().sum_cost+1){\n\t\t\t\t\tmin_cost[adj_row][adj_col][next_node_pos] = Q.top().sum_cost+1;\n\t\t\t\t\tQ.push(Info(adj_row,adj_col,Q.top().sum_cost+1,next_node_pos));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\tprintf(\"-1\\n\");\n}\n\n\nint main(){\n\n\tfor(int i = 0; i < 11; i++)POW[i] = pow(4,i);\n\n\ttable['U'] = North;\n\ttable['R'] = East;\n\ttable['D'] = South;\n\ttable['L'] = West;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&H,&W);\n\t\tif(H == 0 && W == 0)break;\n\n\t\tfunc();\n\t}\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define print(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define print(x)\n#endif\n\n\n\nconst int inf=1e9;\nconst int64_t inf64=1e18;\nconst double eps=1e-9;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nusing i64=int64_t;\n\nconst int alphabet_size=4;\nclass pma{\npublic:\n pma* next[alphabet_size],*failure;\n vector<int> matches;\n string s;\n pma(){\n fill(next,next+alphabet_size,(pma*)0);\n failure=NULL;\n }\n void insert(const string &str,const int id){ insert(str,0,id); }\n void insert(const string &str,const int idx,const int id){\n s=str.substr(0,idx);\n if(idx==str.size()){\n matches.push_back(id);\n return;\n }\n if(next[str[idx]]==NULL) this->next[str[idx]]=new pma();\n next[str[idx]]->insert(str,idx+1,id);\n }\n};\n\nclass aho_corasick{\npublic:\n vector<string> dic;\n pma* root;\n aho_corasick(const vector<string>& dic_):dic(dic_),root(new pma()){\n for(int i=0; i<dic.size(); ++i) root->insert(dic[i],i);\n root->failure=root;\n queue<pma*> que;\n que.push(root);\n while(!que.empty()){\n pma* curr=que.front();\n que.pop();\n curr->matches.insert(curr->matches.end(),curr->failure->matches.begin(),curr->failure->matches.end());\n for(int i=0; i<alphabet_size; ++i){\n pma*& next=curr->next[i];\n if(next==NULL){\n if(curr==root) next=root;\n else next=curr->failure->next[i];\n continue;\n }\n if(curr==root) next->failure=root;\n else next->failure=curr->failure->next[i];\n next->matches.insert(next->matches.end(),curr->matches.begin(),curr->matches.end());\n que.push(next);\n }\n }\n }\n vector<bool> match(const string& s)const{\n vector<bool> res(dic.size());\n const pma* state=root;\n for(char c:s){\n state=state->next[c];\n for(int i:state->matches) res[i]=true;\n }\n return res;\n }\n};\n\nvoid solve(int N,int M){\n vector<string> vs(N);\n int sy,sx,gy,gx;\n rep(i,0,N){\n cin >> vs[i];\n rep(j,0,M){\n if(vs[i][j]=='S'){\n sy=i;\n sx=j;\n }\n if(vs[i][j]=='G'){\n gy=i;\n gx=j;\n }\n }\n }\n\n int P;\n cin >> P;\n vector<string> ban(P);\n rep(i,0,P){\n cin >> ban[i];\n for(char& c:ban[i]){\n if(c=='R') c=0;\n if(c=='U') c=1;\n if(c=='L') c=2;\n if(c=='D') c=3;\n }\n }\n\n aho_corasick ac(ban);\n vector<int> dx={1,0,-1,0},dy={0,-1,0,1};\n queue<tuple<int,int,pma*,int>> que;\n set<tuple<int,int,pma*>> visited;\n que.push(make_tuple(sy,sx,ac.root,0));\n visited.insert(make_tuple(sy,sx,ac.root));\n while(!que.empty()){\n int y,x,d;\n pma* curr;\n tie(y,x,curr,d)=que.front();\n que.pop();\n if(y==gy and x==gx){\n cout << d << endl;\n return;\n }\n rep(i,0,4){\n int ny=y+dy[i],nx=x+dx[i];\n if(ny<0 or N<=ny or nx<0 or M<=nx or vs[ny][nx]=='#') continue;\n pma* next=curr->next[i];\n if(!next->matches.empty()) continue;\n if(visited.find(make_tuple(ny,nx,next))!=visited.end()) continue;\n que.push(make_tuple(ny,nx,next,d+1));\n visited.insert(make_tuple(ny,nx,next));\n }\n }\n cout << -1 << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n for(;;){\n int N,M;\n cin >> N >> M;\n if(!N and !M) break;\n solve(N,M);\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1e8;\n\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\n\nstring D = \"DRUL\";\n\nconst int var = 4;\n\nint trans(char c) {\n\tswitch (c)\n\t{\n\tcase 'R': return 0;\n\tcase 'D': return 1;\n\tcase 'L': return 2;\n\tcase 'U': return 3;\n\tdefault: break;\n\t}\n\texit(EXIT_FAILURE);\n}\nstruct node {\n\tnode *fail;\n\tvector<node*> next;\n\tvector<int> ok;\n\tnode() : fail(nullptr), next(var, nullptr) {}\n};\n\nnode* getnext(node* p, char c) {\n\twhile (p->next[trans(c)] == nullptr) p = p->fail;\n\treturn p->next[trans(c)];\n}\n\nclass Aho_Corasick {\n\tvector<int> unite(const vector<int>& a, const vector<int>& b) {\n\t\tvector<int> res;\n\t\tset_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res));\n\t\treturn res;\n\t}\n\tint K;\npublic:\n\tnode *root;\n\tAho_Corasick(const vector<string>& Ts) : K(Ts.size()), root(new node) {\n\t\tnode *now;\n\t\troot->fail = root;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tauto &T = Ts[i];\n\t\t\tnow = root;\n\t\t\tfor (auto c : T) {\n\t\t\t\tif (now->next[trans(c)] == nullptr) {\n\t\t\t\t\tnow->next[trans(c)] = new node;\n\t\t\t\t}\n\t\t\t\tnow = now->next[trans(c)];\n\t\t\t}\n\t\t\tnow->ok.push_back(i);\n\t\t}\n\t\tqueue<node*> q;\n\t\tfor (int i = 0; i < var; i++) {\n\t\t\tif (root->next[i] == nullptr) {\n\t\t\t\troot->next[i] = root;\n\t\t\t}\n\t\t\telse {\n\t\t\t\troot->next[i]->fail = root;\n\t\t\t\tq.push(root->next[i]);\n\t\t\t}\n\t\t}\n\t\twhile (!q.empty()) {\n\t\t\tnow = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < var; i++) {\n\t\t\t\tif (now->next[i] != nullptr) {\n\t\t\t\t\tnode *nx = now->fail;\n\t\t\t\t\twhile (nx->next[i] == nullptr) {\n\t\t\t\t\t\tnx = nx->fail;\n\t\t\t\t\t}\n\t\t\t\t\tnow->next[i]->fail = nx->next[i];\n\t\t\t\t\tnow->next[i]->ok = unite(now->next[i]->ok, nx->next[i]->ok);\n\t\t\t\t\tq.push(now->next[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nusing T = tuple<int, int, node*>;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m) {\n\t\tvector<string> S(n);\n\t\tint sx = 0, sy = 0, gx = 0, gy = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> S[i];\n\t\t\tfor (int j = 0; j < (int)S[i].size(); j++) {\n\t\t\t\tif (S[i][j] == 'S') {\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t}\n\t\t\t\telse if (S[i][j] == 'G') {\n\t\t\t\t\tgx = i;\n\t\t\t\t\tgy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> p;\n\t\tvector<string> pts(p);\n\t\tfor (int i = 0; i < p; i++) {\n\t\t\tcin >> pts[i];\n\t\t}\n\t\tAho_Corasick aho(pts);\n\t\tvector<vector<map<node*, int>>> f(n, vector<map<node*, int>>(m));\n\t\tqueue<T> q;\n\t\tq.push(make_tuple(sx, sy, aho.root));\n\t\tf[sx][sy][aho.root] = 0;\n\t\twhile (!q.empty()) {\n\t\t\tauto p = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint tx = get<0>(p) + dx[i], ty = get<1>(p) + dy[i];\n\t\t\t\tnode *t = getnext(get<2>(p), D[i]);\n\t\t\t\tif (0 <= tx && tx < n && 0 <= ty && ty < m && S[tx][ty] != '#' && t->ok.empty() && f[tx][ty].count(t) == 0) {\n\t\t\t\t\tq.push(make_tuple(tx, ty, t));\n\t\t\t\t\tf[tx][ty][t] = f[get<0>(p)][get<1>(p)][get<2>(p)] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint res = INF;\n\t\tfor (auto p : f[gx][gy]) {\n\t\t\tres = min(res, p.second);\n\t\t}\n\t\tcout << (res != INF ? res : -1) << endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<map>\n#include<cassert>\n#include<cstdlib>\n#include<algorithm>\n#include<numeric>\n#include<vector>\n#include<queue>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nconst int N = 5;\nconst int NODE=120;\n\nstruct PMA{\n PMA *next[N];\n int ac;\n PMA(){fill(next,next+N,(PMA*)0);ac=0;}\n};\n\nmap<PMA*,int> M;\nPMA *buildPMA(string *in,int size){\n PMA *root=new PMA;\n M[root]=0;\n rep(i,size){\n PMA *t = root;\n rep(j,in[i].size()){\n char c=in[i][j];\n if (t->next[c] == NULL){\n\tint ind=M.size();\n\tt->next[c]=new PMA;\n\tM[t->next[c]]=ind;\n }\n t=t->next[c];\n }\n t->ac++;\n }\n\n queue<PMA*> Q;\n REP(i,1,N){\n char c=i;\n if (root->next[c]){\n root->next[c]->next[0]=root;\n Q.push(root->next[c]);\n }else root->next[c]=root;\n }\n\n while(!Q.empty()){\n PMA *t=Q.front();Q.pop();\n REP(c,1,N){\n if (t->next[c]){\n\tQ.push(t->next[c]);\n\tPMA *r=t->next[0];\n\twhile(!r->next[c])r=r->next[0];\n\tt->next[c]->next[0]=r->next[c];\n\tt->next[c]->ac+=r->next[c]->ac;\n }\n }\n }\n return root;\n}\n\nPMA* match(PMA *r,char in){\n while(!r->next[in])r=r->next[0];\n r=r->next[in];\n return r;\n}\n\nstruct Edge{int dir,node;};\nconst string dir=\"DURL\";\nconst int dx[]={0,0,1,-1};\nconst int dy[]={1,-1,0,0};\n\n\nvector<Edge> edge[NODE];\n\nvoid makegraph(PMA *now,PMA* root){\n //rep(i,4){\n REP(i,1,N){\n PMA* next=now;\n next=match(next,i);\n if (next->ac != 0)continue;\n edge[M[now]].push_back((Edge){i-1,M[next]});\n }\n}\n\nvoid travarse(PMA *t,PMA *root){\n makegraph(t,root);\n REP(i,1,N){\n if (t->next[i] != NULL && t->next[i] != root)travarse(t->next[i],root);\n }\n}\n\nchar m[50][50];\nstruct st{\n int y,x,node,cost;\n};\n\nint cost[50][50][NODE];\nint solve(int r,int c,int sy,int sx){\n rep(i,r)rep(j,c)rep(k,M.size())cost[i][j][k]=-1;\n queue<st> Q;\n Q.push((st){sy,sx,0,0});\n cost[sy][sx][0]=0;\n while(!Q.empty()){\n st now=Q.front();Q.pop();\n //cout << now.y <<\" \" << now.x <<\" \" << now.node <<\" \" << now.cost << endl;\n rep(i,edge[now.node].size()){\n int dir=edge[now.node][i].dir;\n int next=edge[now.node][i].node;\n int ney=now.y+dy[dir],nex=now.x+dx[dir];\n if (ney == -1 || nex == -1 || ney == r || nex == c||\n\t m[ney][nex] == '#' || cost[ney][nex][next] != -1)continue;\n cost[ney][nex][next]=now.cost+1;\n if (m[ney][nex] == 'G')return now.cost+1;\n Q.push((st){ney,nex,next,now.cost+1});\n }\n }\n return -1;\n}\n\nint main(){\n int r,c;\n int n;\n string in[10];\n while(cin>>r>>c && r){\n M.clear();\n rep(i,NODE)edge[i].clear();\n rep(i,r)cin>>m[i];\n cin>>n;\n rep(i,n){\n cin>>in[i];\n rep(j,in[i].size()){\n\trep(k,dir.size())if (in[i][j] == dir[k])in[i][j]=k+1;\n }\n }\n PMA* root=buildPMA(in,n);\n travarse(root,root);\n int sy,sx;\n rep(i,r)rep(j,c)if (m[i][j] == 'S')sy=i,sx=j;\n cout << solve(r,c,sy,sx) << endl;\n }\n return false;\n}", "#include <cstdio>\n#include <vector>\n#include <stack>\n#include <iostream>\n#include <string>\n#include <tuple>\n#include <random>\n#include <map>\n#include <queue>\n#include <set>\n#include <complex>\n#include <algorithm>\n#include <cassert>\n#include <iterator>\n#include <numeric>\n\nusing namespace std;\n\ntypedef long double ld;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\nconst ll INF = 1e15;\nconst double eps = 1e-6;\n\n// Aho-Corasick 法\n/*\n* 複数パターン検索を行う．\n* パターン文字列の長さの和&L&，検索文字列の長さ$M$のとき\n* PMA構築に$\\mathcal{O}(L)$，検索に$\\mathcal{O}(L+N)$かかる．\n* - verified by : UVa 10679\n*/\n\nstruct PMAnode {\n\tPMAnode * next[256];\n\tPMAnode * fail;\n\tvector<int> accept;\n\tint id;\n\tPMAnode(int id_) { fill(next, next + 256, nullptr); id = id_; }\n\tPMAnode() { fill(next, next + 256, nullptr); id = 0; }\n};\n// Aho Corasick\nstruct PMA {\n\tPMAnode root;\n\tint n_pat; // number of patterns\n\tvector<PMAnode*> idto;\n\tPMA(vector<string> &ps) { // パターン文字列を与える\n\t\tint id = 1;\n\t\tn_pat = ps.size();\n\t\tidto.push_back(&root);\n\t\t// construct Trie tree\n\t\tfor (int k = 0; k < ps.size(); k++) {\n\t\t\tstring p = ps[k];\n\t\t\tPMAnode * t = &root;\n\t\t\tfor (int i = 0; i < p.size(); i++) {\n\t\t\t\tif (t->next[p[i]] == nullptr) { t->next[p[i]] = new PMAnode(id); id++; idto.push_back(t->next[p[i]]); }\n\t\t\t\tt = t->next[p[i]];\n\t\t\t}\n\t\t\tt->accept.push_back(k);\n\t\t}\n\t\t// construct failure link\n\t\tqueue< PMAnode * > Q;\n\t\tfor (char c = ' '; c <= '~'; c++) {\n\t\t\tif (root.next[c] != nullptr) {\n\t\t\t\troot.next[c]->fail = &root;\n\t\t\t\tQ.push(root.next[c]); // add node which is adjacent to root\n\t\t\t}\n\t\t\telse {\n\t\t\t\troot.next[c] = &root;\n\t\t\t}\n\t\t}\n\t\twhile (!Q.empty()) {\n\t\t\tPMAnode *t = Q.front(); Q.pop();\n\t\t\tfor (char c = ' '; c <= '~'; c++) {\n\t\t\t\tif (t->next[c] != nullptr) {\n\t\t\t\t\tQ.push(t->next[c]);\n\t\t\t\t\tPMAnode * r = t->fail;\n\t\t\t\t\twhile (r->next[c] == nullptr) r = r->fail;\n\t\t\t\t\tt->next[c]->fail = r->next[c];\n\t\t\t\t\tvector<int> &tac = t->next[c]->accept;\n\t\t\t\t\tvector<int> &rac = r->next[c]->accept;\n\t\t\t\t\ttac.insert(tac.end(), rac.begin(), rac.end());\n\t\t\t\t\tsort(tac.begin(), tac.end());\n\t\t\t\t\tunique(tac.begin(), tac.end());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t// strを最後まで見たときの最終的なPMAnodeを返す\n\tPMAnode * match(string str) {\n\t\tPMAnode * t = &root;\n\t\tfor (char c : str) {\n\t\t\twhile (t->next[c] == nullptr) t = t->fail;\n\t\t\tt = t->next[c];\n\t\t}\n\t\treturn t;\n\t}\n\t// strでマッチしたパターンの種類と回数を返す\n\t// res[i] := パターン文字列ps[i]のstrにおける出現回数\n\tvector< int > match_n(string str) {\n\t\tvector<int> res(n_pat, 0);\n\t\tPMAnode * t = &root;\n\t\tfor (char c : str) {\n\t\t\twhile (t->next[c] == nullptr) t = t->fail;\n\t\t\tt = t->next[c];\n\t\t\tfor (int i = 0; i < t->accept.size(); i++) {\n\t\t\t\tres[t->accept[i]]++;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\n\ntypedef ll Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\nbool operator < (const Edge &e, const Edge &f) {\n\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\n\te.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid shortestPath(const Graph &g, int s,\n\tvector<Weight> &dist, vector<int> &prev) {\n\tint n = g.size();\n\tdist.assign(n, INF); dist[s] = 0;\n\tprev.assign(n, -1);\n\tpriority_queue<Edge> Q; // \"e < f\" <=> \"e.weight > f.weight\"\n\tfor (Q.push(Edge(-2, s, 0)); !Q.empty(); ) {\n\t\tEdge e = Q.top(); Q.pop();\n\t\tif (prev[e.dst] != -1) continue;\n\t\tprev[e.dst] = e.src;\n\t\tfor (auto f = g[e.dst].begin();f != g[e.dst].end();f++) {\n\t\t\tif (dist[f->dst] > e.weight + f->weight) {\n\t\t\t\tdist[f->dst] = e.weight + f->weight;\n\t\t\t\tQ.push(Edge(f->src, f->dst, e.weight + f->weight));\n\t\t\t}\n\t\t}\n\t}\n}\n\nvector<ll> dx{ -1, 0, 1, 0 };\nvector<ll> dy{ 0, 1, 0, -1 };\nvector<char> dc{ 'L', 'D', 'R', 'U' };\n\nll H, W;\n\nll f(ll id, ll y, ll x) {\n\treturn (H + 2)*(W + 2)*id + (W + 2)*y + x;\n}\n\nint main() {\n\twhile (cin >> H >> W, H != 0) {\n\t\tvector<string> area(H + 2, string(W + 2, '#'));\n\t\tfor (int i = 1;i <= H;i++) {\n\t\t\tcin >> area[i];\n\t\t\tarea[i] = \"#\" + area[i] + \"#\";\n\t\t}\n\t\tll sy, sx, gy, gx;\n\t\tfor (int y = 1;y <= H;y++)\n\t\t\tfor (int x = 1;x <= W;x++)\n\t\t\t\tif (area[y][x] == 'S') {\n\t\t\t\t\tsx = x;\n\t\t\t\t\tsy = y;\n\t\t\t\t}\n\t\t\t\telse if (area[y][x] == 'G') {\n\t\t\t\t\tgy = y;\n\t\t\t\t\tgx = x;\n\t\t\t\t}\n\t\tll P;\n\t\tcin >> P;\n\t\tvector<string> patt(P);\n\t\tfor (int i = 0;i < P;i++)\n\t\t\tcin >> patt[i];\n\t\tPMA aho(patt);\n\t\tGraph g((H+2)*(W+2) * 100);\n\t\tfor (int y = 1;y <= H;y++) {\n\t\t\tfor (int x = 1;x <= W;x++) {\n\t\t\t\tif (area[y][x] == '#')\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int node = 0;node < min(100, (int)aho.idto.size()); node++) {\n\t\t\t\t\tfor (int k = 0;k < 4;k++) {\n\t\t\t\t\t\tll nx = x + dx[k];\n\t\t\t\t\t\tll ny = y + dy[k];\n\t\t\t\t\t\tif (area[ny][nx] == '#')\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tPMAnode* now = aho.idto[node];\n\t\t\t\t\t\twhile (now->next[dc[k]] == nullptr) now = now->fail;\n\t\t\t\t\t\tnow = now->next[dc[k]];\n\t\t\t\t\t\tif(now->accept.empty())\n\t\t\t\t\t\t\tg[f(node, y, x)].push_back(Edge(f(node, y, x), f(now->id, ny, nx), 1));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<ll> dist;\n\t\tvector<int> prev;\n\t\tshortestPath(g, f(0, sy, sx), dist, prev);\n\t\tll ans = INF;\n\t\tfor (int i = 0;i < min(100, (int)aho.idto.size());i++)\n\t\t\tans = min(ans, dist[f(i, gy, gx)]);\n\t\tif (ans == INF)\n\t\t\tcout << -1 << endl;\n\t\telse\n\t\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define int ll\nusing PII = pair<int, int>;\ntemplate <typename T> using V = vector<T>;\ntemplate <typename T> using VV = vector<V<T>>;\ntemplate <typename T> using VVV = vector<VV<T>>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define PB push_back\n\nconst ll INF = (1LL<<60);\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.first<<','<<a.second<<')';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\n out<<']';\n return out;\n}\n\n// D, R, U, L\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\n// 文字の種類数をtemplate引数で渡す\ntemplate <int types = 26>\nstruct AhoCorasick {\n // trie木のnode\n struct node {\n node *fail;\n V<node*> next;\n V<int> matched;\n int idx;\n node() : fail(nullptr), next(types, nullptr) {}\n node(int idx) : fail(nullptr), next(types, nullptr), idx(idx) {}\n };\n\n // 辞書のサイズ, 頂点数\n int sz, nodesize;\n // trie木の根\n node *root;\n // vectorを結合\n V<int> unite(const V<int> &a, const V<int> &b) {\n V<int> ret;\n set_union(ALL(a), ALL(b), back_inserter(ret));\n return ret;\n }\n // 文字と数字の対応付けをする関数\n function<int(char)> trans;\n // 初期化\n AhoCorasick() {}\n AhoCorasick(V<string> pattern, function<int(char)> f = [](char c){return c-'a';}) {\n nodesize = 0;\n trans = f;\n build(pattern);\n }\n // 文字列集合patternからtrie木っぽいオートマトンを作成\n void build(V<string> pattern) {\n sz = pattern.size(), root = new node(nodesize++);\n node *now;\n root->fail = root;\n REP(i, sz) {\n now = root;\n for(const auto &c: pattern[i]) {\n if(now->next[trans(c)] == nullptr) {\n now->next[trans(c)] = new node(nodesize++);\n }\n now = now->next[trans(c)];\n }\n now->matched.PB(i);\n }\n\n queue<node*> que;\n REP(i, types) {\n if(root->next[i] == nullptr) {\n root->next[i] = root;\n } else {\n root->next[i]->fail = root;\n que.push(root->next[i]);\n }\n }\n while(que.size()) {\n now = que.front(); que.pop();\n REP(i, types) {\n if(now->next[i] != nullptr) {\n node *nxt = now->fail;\n while(!nxt->next[i]) nxt = nxt->fail;\n now->next[i]->fail = nxt->next[i];\n now->next[i]->matched = unite(now->next[i]->matched, nxt->next[i]->matched);\n que.push(now->next[i]);\n }\n }\n }\n }\n // 一文字ずつ照合していく\n node* next(node* p, const char c) {\n while(p->next[trans(c)] == nullptr) p = p->fail;\n return p->next[trans(c)];\n }\n // 文字列s中に辞書と一致する部分列がどれだけあるか\n V<int> match(const string s) {\n V<int> res(sz);\n node *now = root;\n for(auto c : s) {\n now = next(now, c);\n for(auto i : now->matched) res[i]++;\n }\n return res;\n }\n};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(1) {\n int h, w;\n cin >> h >> w;\n if(!h) break;\n V<string> board(h);\n REP(i, h) cin >> board[i];\n int n;\n cin >> n;\n V<string> v(n);\n REP(i, n) cin >> v[i];\n\n int sx = -1, sy = -1, gx = -1, gy = -1;\n REP(i, h) REP(j, w) {\n if(board[i][j] == 'S') {\n sx = j, sy = i;\n } else if(board[i][j] == 'G') {\n gx = j, gy = i;\n }\n }\n\n char dir[4] = {'D', 'R', 'U', 'L'};\n auto trans = [&](char c) {\n if(c == 'D') return 0;\n else if(c == 'R') return 1;\n else if(c == 'U') return 2;\n else if(c == 'L') return 3;\n };\n AhoCorasick<4> aho(v, trans);\n // cout << \"nodesize=\" << aho.nodesize << endl;\n AhoCorasick<4>::node *now = aho.root;\n\n struct nt {\n int y, x;\n AhoCorasick<4>::node *node;\n nt(int x, int y, AhoCorasick<4>::node *n) : y(y), x(x) { node = n; }\n };\n\n // d[y][x][あほこらのnode] = 最小距離\n VVV<int> d(h, VV<int>(w, V<int>(aho.nodesize, INF)));\n queue<nt> que;\n d[sy][sx][0] = 0;\n que.push(nt(sx, sy, now));\n while(que.size()) {\n nt vec = que.front(); que.pop();\n // cout << vec.x << \" \" << vec.y << \" \" << vec.node->idx << endl;\n REP(i, 4) {\n int nx = vec.x + dx[i], ny = vec.y + dy[i];\n // cout << \"nx=\" << nx << \" ny=\" << ny << endl;\n if(!IN(0LL,w,nx) || !IN(0LL,h,ny) || board[ny][nx]=='#') continue;\n AhoCorasick<4>::node *next = aho.next(vec.node, dir[i]);\n if(next == nullptr) {\n continue;\n }\n // cout << next->matched << endl;\n if(next->matched.size()) continue;\n if(d[ny][nx][next->idx] > d[vec.y][vec.x][vec.node->idx] + 1) {\n d[ny][nx][next->idx] = d[vec.y][vec.x][vec.node->idx] + 1;\n que.push(nt(nx, ny, next));\n }\n }\n }\n\n int ret = INF;\n REP(i, aho.nodesize) chmin(ret, d[gy][gx][i]);\n if(ret == INF) cout << -1 << endl;\n else cout << ret << endl;\n }\n \n return 0;\n}\n\n\n", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <set>\n#include <queue>\n#include <map>\n#include <fstream>\nusing namespace std;\n\nclass Sit{\npublic:\n\tint x,y;\n\tstring cur;\n};\n\nclass AhoCorasick{\nprivate:\n\tstatic const int MAX_V=1000001;\nprivate:\n\tmap<string,int> _dict;\n\tint _vertex;\n\t// Œ»Ý‚Ì•¶Žš—ñ‚©‚玟‚Í‚Ç‚Ì•¶Žš—ñ‚Ö‘JˆÚ‚Å‚«‚é‚©\n\tmap<string,set<string> > _stepPrv;\n\t// ’TõŽ¸”s‚µ‚½ê‡‚É–ß‚éƒm[ƒh\n\tmap<string,string> _stepBack;\n\t// Ž«‘•¶Žš—ñ‚̏W‡\n\tset<string> _dictStr;\n\t// “_‚ɏî•ñ‚ð•t‰Á‚µ‚½‚¢Žž‚Ì‚ÝŽg—p\n\t//T _vertexInfos[MAX_V];\npublic:\n\t//AhoCorasick();\n\tAhoCorasick(const vector<string> inStrings):_vertex(1){\n\t\tfor(int i=0;i<inStrings.size();i++)_dictStr.insert(inStrings[i]);\n\t\tmakeTree(inStrings);\n\t}\n\tint getVetex(){\n\t\treturn _vertex;\n\t}\n\t// Œ»Ý‚Ì•¶Žš—ñ‚ðŠO‚©‚ç—^‚¦A‚P•¶Žš‚¸‚Â’Tõ\n\tbool isMatchOneByOne(char ch,string &cur){\n\t\t// •K—v‚Å‚ ‚ê‚΁A‚±‚±‚Åcur‚ªdict“à‚É‘¶Ý‚µ‚È‚¢‚©ƒ`ƒFƒbƒN\n\t\t/*\n\t\t*/\n\t\twhile(1){\n\t\t\tstring nxt=cur;\n\t\t\tnxt+=ch;\n\t\t\t// ‚à‚µ¡‚̏ꏊ‚©‚玟‚̏ꏊ‚Ö‘JˆÚ‰Â”\\‚È‚ç‚Î\n\t\t\tif(_stepPrv.find(cur)!=_stepPrv.end()&&_stepPrv[cur].find(nxt)!=_stepPrv[cur].end()){\n\t\t\t\t// ¡‰ñ‚̏ꏊ‚©‚ç–ß‚ê‚éêŠ‚ŁAƒ}ƒbƒ`‚·‚é‚à‚Ì‚ª‚ ‚é‚©‚ðƒ`ƒFƒbƒN\n\t\t\t\tstring tmpStr=nxt;\n\t\t\t\twhile(tmpStr!=\"\"){\n\t\t\t\t\tif(_dictStr.find(tmpStr)!=_dictStr.end())return true;\n\t\t\t\t\ttmpStr=_stepBack[tmpStr];\n\t\t\t\t}\n\t\t\t\tcur=nxt;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t// ‚»‚¤‚Å‚È‚¯‚ê‚΁A–ß‚Á‚ÄŽŸ‚̃‹[ƒv‚ōĂђTõ‚ðs‚¤\n\t\t\telse{\n\t\t\t\t// root‚ÅŒ©‚‚©‚ç‚È‚¯‚ê‚΁AI—¹\n\t\t\t\tif(cur==\"\")return false;\n\t\t\t\t// Œ»Ý’Tõ’†‚Ì•¶Žš—ñ‚̓m[ƒh‚É‘¶Ý‚µ‚È‚¢\n\t\t\t\telse if(_stepBack.find(cur)==_stepBack.end())cur=\"\";\n\t\t\t\telse{\n\t\t\t\t\t// root‚Å‚È‚¢ê‡‚́A–ß‚Á‚č¡‰ñ‚Ì•¶Žš‚ð‚à‚¤ˆê“xŒ©‚é\n\t\t\t\t\tcur=_stepBack[cur];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// ‚à‚µŽ«‘“à‚Ì•¶Žš—ñ‚ªŒ©‚‚©‚ê‚Îtrue\n\t\tif(_dictStr.find(cur)!=_dictStr.end())return true;\n\t\treturn false;\n\t}\n\n\t// ­‚È‚­‚Æ‚àˆê‰ÓŠƒ}ƒbƒ`‚µ‚½‚çtrue\n\tbool isMatchLeastOne(const string &s){\n\t\tstring cur=\"\";\n\t\tfor(int i=0;i<s.size();i++){\n\t\t\tstring nxt=cur+s[i];\n\t\t\t// ‚à‚µ¡‚̏ꏊ‚©‚玟‚̏ꏊ‚Ö‘JˆÚ‰Â”\\‚È‚ç‚Î\n\t\t\tif(_stepPrv.find(cur)!=_stepPrv.end()&&_stepPrv[cur].find(nxt)!=_stepPrv[cur].end()){\n\t\t\t\tcur=nxt;\n\t\t\t\tstring tmpStr=nxt;\n\t\t\t\t// –ß‚Á‚Ä’Tõ\n\t\t\t\twhile(tmpStr!=\"\"){\n\t\t\t\t\tif(_dictStr.find(tmpStr)!=_dictStr.end())return true;\n\t\t\t\t\ttmpStr=_stepBack[tmpStr];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ‚»‚¤‚Å‚È‚¯‚ê‚΁A–ß‚Á‚ÄŽŸ‚̃‹[ƒv‚ōĂђTõ‚ðs‚¤\n\t\t\telse{\n\t\t\t\t// root‚ÅŒ©‚‚©‚ç‚È‚¯‚ê‚΁A¡‰ñ‚Ì•¶Žš‚Í”ò‚΂·\n\t\t\t\tif(cur==\"\")continue;\n\t\t\t\telse if(_stepBack.find(cur)==_stepBack.end())cur=\"\";\n\t\t\t\telse{\n\t\t\t\t\t// root‚Å‚È‚¢ê‡‚́A–ß‚Á‚č¡‰ñ‚Ì•¶Žš‚ð‚à‚¤ˆê“xŒ©‚é\n\t\t\t\t\ti--;\n\t\t\t\t\tcur=_stepBack[cur];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ‚à‚µŽ«‘“à‚Ì•¶Žš—ñ‚ªŒ©‚‚©‚ê‚Îtrue\n\t\t\tif(_dictStr.find(cur)!=_dictStr.end())return true;\n\t\t}\n\t\treturn false;\n\t}\nprivate:\n\t// ƒRƒs[ƒRƒ“ƒXƒgƒ‰ƒNƒ^‚ƁA‘ã“ü‰‰ŽZŽq‚ÍŽg—p‹ÖŽ~‚É‚·‚é\n\tAhoCorasick(const AhoCorasick&ah);\n\tAhoCorasick &operator=(const AhoCorasick&ah);\nprivate:\n\t// O(size(_dict)^2+size(_dict)*avg(strSize))\n\tvoid makeTree(const vector<string> &inStrings){\n\t\t// 0‚Ü‚½‚͋󕶎š—ñ‚ªƒ‹[ƒgƒm[ƒh\n\t\t_dict[\"\"]=0;\n\t\tfor(int i=0;i<(int)inStrings.size();i++){\n\t\t\tfor(int j=0;j<(int)inStrings[i].size();j++){\n\t\t\t\tstring s=inStrings[i].substr(0,j+1);\n\t\t\t\t// ‚Ü‚¾’ljÁ‚³‚ê‚Ä‚¢‚È‚¢‚Ì‚Å‚ ‚ê‚΁A’ljÁ‚·‚é\n\t\t\t\tif(_dict.find(s)==_dict.end())_dict[s]=_vertex++;\n\t\t\t}\n\t\t}\n\t\t// ’Tõ‚ð‘O‚ɐi‚ß‚é•ûŒü‚ÖƒGƒbƒW‚ðŒ‹‚Ô\n\t\tfor(map<string,int>::iterator it=_dict.begin();it!=_dict.end();it++){\n\t\t\tfor(map<string,int>::iterator iit=_dict.begin();iit!=_dict.end();iit++){\n\t\t\t\tif(it==iit)continue;\n\t\t\t\t// ‚à‚µiit->first‚ªsize(it->first)+1•¶Žš‚ō\\¬‚³‚ê‚é‚È‚ç‚΁AƒGƒbƒW‚ðˆø‚­\n\t\t\t\tif(it->first.size()==iit->first.size()-1\n\t\t\t\t\t\t&&it->first==iit->first.substr(0,it->first.size())){\n\t\t\t\t\t_stepPrv[it->first].insert(iit->first);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// ’Tõ‚ðŒã‚ë‚֐i‚ß‚é•ûŒü‚ÖƒGƒbƒW‚ðŒ‹‚Ô\n\t\tfor(map<string,int>::iterator it=_dict.begin();it!=_dict.end();it++){\n\t\t\tif(it->first==\"\")continue;\n\t\t\t// Œ»Ý‚Ì•¶Žš—ñ‚©‚çæ“ªi•¶Žš‚ðŽæ‚菜‚¢‚½‚à‚Ì‚Ö–ß‚ê‚é‚©‡”ԂɃ`ƒFƒbƒN\n\t\t\t// –ß‚ê‚È‚¯‚ê‚΃‹[ƒg‚Ö–ß‚é\n\t\t\tbool ok=false;\n\t\t\tfor(int i=0;i<it->first.size()-1;i++){\n\t\t\t\tstring s=it->first.substr(i+1);\n\t\t\t\tif(_dict.find(s)!=_dict.end()){\n\t\t\t\t\t_stepBack[it->first]=s;\n\t\t\t\t\tok=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ƒ‹[ƒg‚Ö–ß‚é\n\t\t\tif(!ok)_stepBack[it->first]=\"\";\n\t\t}\n\t}\n};\n\nint h,w;\nint n;\nchar field[51][51];\nstring prohibits[20];\nint sy,sx,gx,gy;\nset<string> used[51][51];\n\nconst int dy[]={-1,0,1,0};\nconst int dx[]={0,1,0,-1};\n\nint bfs(){\n\tvector<string> vs;\n\tfor(int i=0;i<n;i++)vs.push_back(prohibits[i]);\n\tAhoCorasick ac(vs);\n\tSit init;\n\tinit.x=sx;\n\tinit.y=sy;\n\tinit.cur=\"\";\n\tqueue<Sit> q[2];\n\tint cur=0;\n\tint nxt=1;\n\tq[cur].push(init);\n\tused[init.y][init.x].insert(\"\");\n\tint cnt=0;\n\twhile(q[cur].size()){\n\t\twhile(q[cur].size()){\n\t\t\tSit s=q[cur].front();\n\t\t\tq[cur].pop();\n\t\t\tif(s.y==gy&&s.x==gx)return cnt;\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tint ny=s.y+dy[i];\n\t\t\t\tint nx=s.x+dx[i];\n\t\t\t\tif(ny>=0&&nx>=0&&ny<h&&nx<w&&field[ny][nx]=='.'){\n\t\t\t\t\tchar ch=i+'0';\n\t\t\t\t\tSit nsit;\n\t\t\t\t\tnsit.y=ny;nsit.x=nx;\n\t\t\t\t\tnsit.cur=s.cur;\n\t\t\t\t\tbool b=ac.isMatchOneByOne(ch,nsit.cur);\n\t\t\t\t\t// match‚µ‚½‚çA‘JˆÚ‚µ‚È‚¢\n\t\t\t\t\tif(b)continue;\n\t\t\t\t\t// nsit.cur‚̃m[ƒh‚Ö‚·‚Å‚É’B‚µ‚½‚©‚Ç‚¤‚©\n\t\t\t\t\tif(used[ny][nx].find(nsit.cur)==used[ny][nx].end()){\n\t\t\t\t\t\tq[nxt].push(nsit);\n\t\t\t\t\t\tused[ny][nx].insert(nsit.cur);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt++;\n\t\tswap(cur,nxt);\n\t}\n\treturn -1;\n}\n\nint main(){\n\n\twhile(cin>>h>>w&&(h|w)){\n\t\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)used[i][j].clear();\n\t\tfor(int i=0;i<h;i++){\n\t\t\tfor(int j=0;j<w;j++){\n\t\t\t\tcin>>field[i][j];\n\t\t\t\tif(field[i][j]=='S'){\n\t\t\t\t\tsy=i;\n\t\t\t\t\tsx=j;\n\t\t\t\t\tfield[i][j]='.';\n\t\t\t\t}\n\t\t\t\telse if(field[i][j]=='G'){\n\t\t\t\t\tgy=i;\n\t\t\t\t\tgx=j;\n\t\t\t\t\tfield[i][j]='.';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin>>n;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>prohibits[i];\n\t\t\tfor(int j=0;j<(int)prohibits[i].size();j++){\n\t\t\t\tif(prohibits[i][j]=='U')prohibits[i][j]='0';\n\t\t\t\telse if(prohibits[i][j]=='R')prohibits[i][j]='1';\n\t\t\t\telse if(prohibits[i][j]=='D')prohibits[i][j]='2';\n\t\t\t\telse if(prohibits[i][j]=='L')prohibits[i][j]='3';\n\t\t\t}\n\t\t}\n\t\tint res=bfs();\n\t\tcout<<res<<endl;\n\t}\n\treturn 0;\n}", "//Name: Stolen Jewel\n//Level: 3\n//Category: グラフ,Graph,Aho-Corasick\n//Note: \n\n/**\n * Aho-Corasick法のオートマトンを作成し、(現在位置,Aho-Corasickのノード位置)で幅優先探索すればよい。\n *\n * オーダーはO(NMP|S|)。\n */\n#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <array>\n#include <tuple>\n\nusing namespace std;\n\ntemplate <typename T>\nstruct Maybe {/*{{{*/\n T val;\n bool valid;\n\n Maybe() : valid(false) {}\n Maybe(T &t) : val(t), valid(true) {}\n\n T& operator =(const T &rv) {\n val = rv;\n valid = true;\n return val;\n }\n\n operator T() {\n return valid ? val : T();\n }\n\n const T& fetch(const T &fallback) const {\n return valid ? val : fallback;\n }\n\n template<typename Cond>\n bool update(const T &v, Cond cond) {\n if(!valid || cond(v, val)) {\n val = v;\n valid = true;\n return true;\n }\n return false;\n }\n\n bool update(const T &v) {\n return update(v, less<T>());\n }\n};/*}}}*/\n\ntemplate<int CharNum>\nstruct AhoCorasick {\n struct Node {\n bool terminal;\n int failure;\n array<Maybe<int>,CharNum> edge;\n Node() : terminal(false), failure(0) {\n fill(begin(edge), end(edge), Maybe<int>());\n }\n };\n\n vector<Node> g_;\n int pos_;\n\n AhoCorasick(const vector<string> &dict) {\n g_.resize(1);\n\n // Build trie\n for(const auto &s : dict) {\n int cur = 0;\n for(const int c : s) {\n if(!g_[cur].edge[c].valid) {\n g_.push_back(Node());\n g_[cur].edge[c] = (int)g_.size() - 1;\n }\n cur = g_[cur].edge[c];\n }\n g_[cur].terminal = true;\n }\n\n // Build failure link\n queue<int> q;\n q.push(0);\n while(!q.empty()) {\n const int cur = q.front();\n q.pop();\n for(int ch = 0; ch < CharNum; ++ch) {\n if(g_[cur].edge[ch].valid) {\n const int n = g_[cur].edge[ch].val;\n q.push(n);\n int f = g_[cur].failure;\n while(f != 0 && !g_[f].edge[ch].valid) {\n f = g_[f].failure;\n }\n g_[n].failure = g_[f].edge[ch].fetch(0);\n if(g_[n].failure == n) g_[n].failure = 0;\n }\n }\n }\n\n // Update terminal state\n for(auto &n : g_) {\n int f = n.failure;\n while(f != 0) {\n if(g_[f].terminal) {\n n.terminal = true;\n break;\n }\n f = g_[f].failure;\n }\n }\n }\n\n void reset(int pos = 0) {\n pos_ = pos;\n }\n\n int advance(int ch) {\n while(pos_ != 0 && !g_[pos_].edge[ch].valid) {\n pos_ = g_[pos_].failure;\n }\n pos_ = g_[pos_].edge[ch].fetch(0);\n return pos_;\n }\n\n int size() const {\n return g_.size();\n }\n\n bool accepted() const {\n return g_[pos_].terminal;\n }\n};\n\nconst int DR[] = {0, -1, 0, 1};\nconst int DC[] = {1, 0, -1, 0};\n\nbool solve(bool first) {\n int R, C;\n if(!(cin >> R >> C)) return false;\n if(!R && !C) return false;\n\n vector<string> field(R+2);\n pair<int,int> start, goal;\n field[0] = field[R+1] = string(C+2, '#');\n for(int r = 1; r < R+1; ++r) {\n cin >> field[r];\n field[r] = string(\"#\") + field[r] + \"#\";\n for(int c = 1; c < C+2; ++c) {\n if(field[r][c] == 'S') {\n start = make_pair(r, c);\n } else if(field[r][c] == 'G') {\n goal = make_pair(r, c);\n }\n }\n }\n\n int P;\n cin >> P;\n vector<string> prohibited(P);\n for(int i = 0; i < P; ++i) {\n cin >> prohibited[i];\n for(char &c : prohibited[i]) {\n switch(c) {\n case 'R':\n c = 0;\n break;\n case 'U':\n c = 1;\n break;\n case 'L':\n c = 2;\n break;\n case 'D':\n c = 3;\n break;\n }\n }\n }\n AhoCorasick<4> am(prohibited); // Automaton\n vector<vector<vector<Maybe<int>>>> memo(R+2, vector<vector<Maybe<int>>>(C+2, vector<Maybe<int>>(am.size())));\n memo[start.first][start.second][0] = 0;\n queue<tuple<int,int,int>> q;\n q.push(make_tuple(start.first, start.second, 0));\n int ans = -1;\n while(!q.empty()) {\n int r, c, s;\n tie(r, c, s) = q.front();\n //cout << r << ' ' << c << ' ' << s << endl;\n q.pop();\n if(r == goal.first && c == goal.second) {\n ans = memo[r][c][s];\n break;\n }\n\n for(int i = 0; i < 4; ++i) {\n am.reset(s);\n const int nr = r + DR[i];\n const int nc = c + DC[i];\n const int ns = am.advance(i);\n if(field[nr][nc] == '#') continue;\n if(am.accepted()) continue;\n if(memo[nr][nc][ns].valid) continue;\n memo[nr][nc][ns] = memo[r][c][s] + 1;\n q.push(make_tuple(nr, nc, ns));\n }\n }\n cout << ans << endl;\n\n return true;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout.setf(ios::fixed);\n cout.precision(10);\n\n bool first = true;\n while(solve(first)) {\n first = false;\n }\n return 0;\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\nstruct TrieNode\n{\n int nxt[27];\n\n int exist; // ???????????\\???????????¨????????????????????°???????¨?\n vector< int > accept; // ???????????????id\n\n TrieNode() : exist(0)\n {\n memset(nxt, -1, sizeof(nxt));\n }\n};\n\nstruct Trie\n{\n vector< TrieNode > nodes;\n int root;\n\n Trie() : root(0)\n {\n nodes.push_back(TrieNode());\n }\n\n virtual void direct_action(int node, int id) {}\n\n virtual void child_action(int node, int child, int id) {}\n\n void update_direct(int node, int id)\n {\n nodes[node].accept.push_back(id);\n direct_action(node, id);\n }\n\n void update_child(int node, int child, int id)\n {\n ++nodes[node].exist;\n child_action(node, child, id);\n }\n\n void add(const string &str, int str_index, int node_index, int id)\n {\n if(str_index == str.size()) {\n update_direct(node_index, id);\n } else {\n const int c = str[str_index] - 'A';\n if(nodes[node_index].nxt[c] == -1) {\n nodes[node_index].nxt[c] = (int) nodes.size();\n nodes.push_back(TrieNode());\n }\n add(str, str_index + 1, nodes[node_index].nxt[c], id);\n update_child(node_index, nodes[node_index].nxt[c], id);\n }\n }\n\n void add(const string &str, int id)\n {\n add(str, 0, 0, id);\n }\n\n void add(const string &str)\n {\n add(str, nodes[0].exist);\n }\n\n int size()\n {\n return (nodes[0].exist);\n }\n\n int nodesize()\n {\n return ((int) nodes.size());\n }\n};\n\nstruct Aho_Corasick : Trie\n{\n static const int FAIL = 26;\n vector< int > correct;\n\n Aho_Corasick() : Trie() {}\n\n void build()\n {\n correct.resize(nodes.size());\n for(int i = 0; i < nodes.size(); i++) {\n correct[i] = (int) nodes[i].accept.size();\n }\n\n queue< int > que;\n for(int i = 0; i < 27; i++) {\n if(~nodes[0].nxt[i]) {\n nodes[nodes[0].nxt[i]].nxt[FAIL] = 0;\n que.emplace(nodes[0].nxt[i]);\n } else {\n nodes[0].nxt[i] = 0;\n }\n }\n while(!que.empty()) {\n TrieNode &now = nodes[que.front()];\n correct[que.front()] += correct[now.nxt[FAIL]];\n que.pop();\n for(int i = 0; i < 26; i++) {\n if(now.nxt[i] == -1) continue;\n int fail = now.nxt[FAIL];\n while(nodes[fail].nxt[i] == -1) {\n fail = nodes[fail].nxt[FAIL];\n }\n nodes[now.nxt[i]].nxt[FAIL] = nodes[fail].nxt[i];\n que.emplace(now.nxt[i]);\n }\n\n }\n }\n\n int move(const string &str, int now = 0)\n {\n for(auto &c : str) {\n while(nodes[now].nxt[c - 'A'] == -1) now = nodes[now].nxt[FAIL];\n now = nodes[now].nxt[c - 'A'];\n if(correct[now]) return (-1);\n }\n return (now);\n }\n};\n\nconst int vy[] = {-1, 0, 1, 0}, vx[] = {0, 1, 0, -1};\nconst string tt = \"URDL\";\n\nint H, W, P;\nstring S[50], pat[10];\n\nint bfs()\n{\n Aho_Corasick aho;\n queue< tuple< int, int, int > > que;\n vector< int > v[50][50];\n\n for(int i = 0; i < P; i++) aho.add(pat[i]);\n aho.build();\n\n for(int i = 0; i < H; i++) {\n for(int j = 0; j < W; j++) {\n v[i][j].resize(aho.nodesize(), -1);\n if(S[i][j] == 'S') {\n que.emplace(i, j, 0);\n v[i][j][0] = 0;\n }\n }\n }\n\n while(!que.empty()) {\n int y, x, now;\n tie(y, x, now) = que.front();\n que.pop();\n if(S[y][x] == 'G') return (v[y][x][now]);\n for(int i = 0; i < 4; i++) {\n int ny = y + vy[i], nx = x + vx[i];\n if(ny < 0 || nx < 0 || nx >= W || ny >= H || S[ny][nx] == '#') continue;\n int nt = aho.move(string(1, tt[i]), now);\n if(nt == -1 || ~v[ny][nx][nt]) continue;\n v[ny][nx][nt] = v[y][x][now] + 1;\n que.emplace(ny, nx, nt);\n }\n }\n return (-1);\n}\n\nint main()\n{\n while(cin >> H >> W, H) {\n for(int i = 0; i < H; i++) cin >> S[i];\n cin >> P;\n for(int i = 0; i < P; i++) cin >> pat[i];\n cout << bfs() << endl;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int var = 4;\nconst int pmax = 1e4;\n\nint trans(char c) {\n\tswitch (c)\n\t{\n\tcase 'R': return 0;\n\tcase 'D': return 1;\n\tcase 'L': return 2;\n\tcase 'U': return 3;\n\tdefault: assert(false);\n\t}\n}\n\nstruct ac_node {\n\tac_node *fail;\n\tac_node *next[var];\n\tvector<int> ok;\n\tac_node() : fail(nullptr), next{} {}\n};\n\nac_node* get_next(ac_node* p, char c) {\n\twhile (!p->next[trans(c)]) p = p->fail;\n\treturn p->next[trans(c)];\n}\n\nclass aho_corasick {\n\tac_node* new_ac_node() {\n\t\tstatic ac_node pool[pmax];\n\t\tstatic int it = 0;\n\t\tassert(it < pmax);\n\t\treturn &pool[it++];\n\t}\n\tvector<int> unite(const vector<int>& a, const vector<int>& b) {\n\t\tvector<int> res;\n\t\tset_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res));\n\t\treturn res;\n\t}\n\tint K;\n\tac_node *root;\npublic:\n\taho_corasick(const vector<string>& Ts) : K(Ts.size()), root(new_ac_node()) {\n\t\tac_node *now;\n\t\troot->fail = root;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tauto &T = Ts[i];\n\t\t\tnow = root;\n\t\t\tfor (auto c : T) {\n\t\t\t\tif (!now->next[trans(c)]) {\n\t\t\t\t\tnow->next[trans(c)] = new_ac_node();\n\t\t\t\t}\n\t\t\t\tnow = now->next[trans(c)];\n\t\t\t}\n\t\t\tnow->ok.push_back(i);\n\t\t}\n\t\tqueue<ac_node*> q;\n\t\tfor (int i = 0; i < var; i++) {\n\t\t\tif (!root->next[i]) {\n\t\t\t\troot->next[i] = root;\n\t\t\t}\n\t\t\telse {\n\t\t\t\troot->next[i]->fail = root;\n\t\t\t\tq.push(root->next[i]);\n\t\t\t}\n\t\t}\n\t\twhile (!q.empty()) {\n\t\t\tnow = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < var; i++) {\n\t\t\t\tif (now->next[i]) {\n\t\t\t\t\tac_node *nx = now->fail;\n\t\t\t\t\twhile (!nx->next[i]) {\n\t\t\t\t\t\tnx = nx->fail;\n\t\t\t\t\t}\n\t\t\t\t\tnow->next[i]->fail = nx->next[i];\n\t\t\t\t\tnow->next[i]->ok = unite(now->next[i]->ok, nx->next[i]->ok);\n\t\t\t\t\tq.push(now->next[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tac_node* get_root() const {\n\t\treturn root;\n\t}\n\tint get_node_id(ac_node* nd) const {\n\t\treturn (int)(nd - root);\n\t}\n};\n\nconst int INF = 1e8;\n\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\n\nstring D = \"DRUL\";\n\nusing T = tuple<int, int, ac_node*>;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m) {\n\t\tvector<string> S(n);\n\t\tint sx = 0, sy = 0, gx = 0, gy = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> S[i];\n\t\t\tfor (int j = 0; j < (int)S[i].size(); j++) {\n\t\t\t\tif (S[i][j] == 'S') {\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t}\n\t\t\t\telse if (S[i][j] == 'G') {\n\t\t\t\t\tgx = i;\n\t\t\t\t\tgy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> p;\n\t\tvector<string> pts(p);\n\t\tfor (int i = 0; i < p; i++) {\n\t\t\tcin >> pts[i];\n\t\t}\n\t\taho_corasick aho(pts);\n\t\tvector<vector<vector<int>>> f(n, vector<vector<int>>(m, vector<int>(110, INF)));\n\t\tqueue<T> q;\n\t\tq.push(make_tuple(sx, sy, aho.get_root()));\n\t\tf[sx][sy][aho.get_node_id(aho.get_root())] = 0;\n\t\twhile (!q.empty()) {\n\t\t\tauto tup = q.front(); q.pop();\n\t\t\tint x = get<0>(tup), y = get<1>(tup);\n\t\t\tac_node *nd = get<2>(tup);\n\t\t\tint id = aho.get_node_id(nd);\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\t\t\tac_node *tnd = get_next(nd, D[i]);\n\t\t\t\tif (0 <= tx && tx < n && 0 <= ty && ty < m && S[tx][ty] != '#' && tnd->ok.empty() && f[tx][ty][aho.get_node_id(tnd)] == INF) {\n\t\t\t\t\tq.push(make_tuple(tx, ty, tnd));\n\t\t\t\t\tf[tx][ty][aho.get_node_id(tnd)] = f[x][y][id] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint res = INF;\n\t\tfor (auto val : f[gx][gy]) {\n\t\t\tres = min(res, val);\n\t\t}\n\t\tcout << (res != INF ? res : -1) << endl;\n\t}\n\treturn 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\n#include<vector>\n#include<string>\n#include<queue>\n\nnamespace ProconLib{\n \n template<class Language>\n class AhoCorasick{\n public:\n using char_t=typename Language::char_t;\n using string_t=typename Language::string_t;\n\n private:\n using Edges=std::vector<int>;\n using Graph=std::vector<Edges>;\n\n private:\n Language lang;\n int N,C;\n Graph g;\n std::vector<int> _failure;\n std::vector<int> _accept;\n void add(int id,const string_t& pat);\n\n public:\n AhoCorasick(std::vector<string_t> patterns,Language lang=Language());\n int getRoot(){return 0;}\n int rejectToken(){return -1;}\n int size(){return N;}\n int next(int v,char_t x){return g[v][lang.id_of(x)]; }\n int failure(int v){return _failure[v];}\n int accept(int v){return _accept[v];}\n };\n\n template<class Language>\n void AhoCorasick<Language>::add(int id,const string_t& pat){\n int v=0;\n for(auto& c:pat){\n int to=g[v][lang.id_of(c)];\n if(to==0){\n to=N++;\n g.push_back(Edges(C,0));\n _accept.push_back(rejectToken());\n g[v][lang.id_of(c)]=to;\n }\n v=to;\n }\n _accept[v]=id;\n }\n\n template<class Language>\n AhoCorasick<Language>::AhoCorasick(std::vector<string_t> patterns,Language lang)\n :lang(lang),C(lang.size()),N(1),g(1,Edges(C)),_accept(1,rejectToken()),_failure(1,0)\n {\n int id=0;\n for(auto &pat:patterns){\n add(id++,pat);\n }\n _failure.assign(N,0);\n\n struct T3{int pre,label,v;};\n std::queue<T3> que;\n que.push(T3{0,-1,0});\n \n while(!que.empty()){\n T3 st=que.front(); que.pop();\n if(st.pre!=0){\n _failure[st.v]=g[_failure[st.pre]][st.label];\n _accept[st.v]=max(_accept[st.v],_accept[_failure[st.v]]);\n }\n for(int i=0;i<C;i++) if(g[st.v][i]!=0) que.push(T3{st.v,i,g[st.v][i]});\n for(int i=0;i<C;i++) if(g[st.v][i]==0) g[st.v][i]=g[_failure[st.v]][i];\n }\n }\n\n // example\n struct LowerCase{\n using char_t=char;\n using string_t=std::string;\n constexpr int size(){return 26;}\n int id_of(char x){return x-'a';}\n };\n\n}\nusing namespace ProconLib;\nusing Field=vector<string>;\n\nusing vi=vector<int>;\nusing vvi=vector<vi>;\nusing vvvi=vector<vvi>;\n\nint dx[]={1,0,-1,0};\nint dy[]={0,1,0,-1};\nchar dc[]={'d','r','u','l'};\n\nint solve(int h,int w){\n Field f(h);\n for(int i=0;i<h;i++) cin>>f[i];\n\n auto isRange=[&](int i,int j){\n return 0<=i && i<h && 0<=j && j<w;\n };\n\n int k;\n cin>>k;\n vector<string> pat(k);\n for(int i=0;i<k;i++) cin>>pat[i];\n for(int i=0;i<k;i++) for(char& x:pat[i]) x=tolower(x);\n AhoCorasick<LowerCase> ac(pat);\n int n=ac.size();\n \n\n auto isValid=[&](int x,int y,int st){\n int v=ac.accept(st);\n return isRange(x,y) && f[x][y]!='#' && v==ac.rejectToken();\n \n };\n const int INF=1e9;\n vvvi dp(h,vvi(w,vi(n,INF)));\n\n struct X{\n int x,y;\n int st;\n };\n queue<X> que;\n pair<int,int> gpos;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(f[i][j]=='S'){\n dp[i][j][0]=0;\n que.push(X{i,j,0});\n }\n if(f[i][j]=='G'){\n gpos.first=i;\n gpos.second=j;\n }\n\n }\n }\n \n while(!que.empty()){\n X tmp=que.front(); que.pop();\n for(int i=0;i<4;i++){\n X tox={tmp.x+dx[i],tmp.y+dy[i],ac.next(tmp.st,dc[i])};\n if(isValid(tox.x,tox.y,tox.st) && dp[tox.x][tox.y][tox.st]==INF){\n dp[tox.x][tox.y][tox.st]=dp[tmp.x][tmp.y][tmp.st]+1;\n que.push(tox);\n }\n }\n }\n int res=INF;\n for(int i=0;i<n;i++){\n res=min(res,dp[gpos.first][gpos.second][i]);\n }\n cout<<(res<INF ? res: -1)<<endl;\n\n \n return 0;\n}\n\nint main(){\n int h,w;\n while(cin>>h>>w,h){\n solve(h,w);\n }\n return 0;\n}\n\n", "import java.util.*;\n\nclass State{\n char x, y;\n short cost;\n String path;\n char[] match;\n\n State(char x, char y, short cost, String path, char[] match){\n this.x = x;\n this.y = y;\n this.cost = cost;\n this.path = path;\n this.match = match;\n }\n\n public boolean equals(Object o){\n State st = (State)o;\n if(x != st.x || y != st.y){\n return false;\n }\n for(int i = 0; i < match.length; i++){\n if(match[i] != st.match[i]){\n return false;\n }\n }\n return true;\n }\n\n public int hashCode(){\n int res = x * 841841 + y * 841;\n for(int i = 0, p = 1; i < match.length; i++, p *= 10){\n res += (int)(match[i]) * p;\n }\n return res;\n }\n}\n\npublic class Main{\n static int h, w, n;\n static char sx, sy, gx, gy;\n static char t[][];\n static String[] p;\n\n static char[] ds = {'U', 'R', 'D', 'L'};\n static int dx[] = {0, 1, 0, -1};\n static int dy[] = {-1, 0, 1, 0};\n\n static int bfs(){\n LinkedList<State> open = new LinkedList<State>();\n HashSet<State> closed = new HashSet<State>();\n\n State st = new State(sx, sy, (short)0, \"\", new char[n]);\n open.add(st);\n closed.add(st);\n\n while(!open.isEmpty()){\n st = open.poll();\n //System.out.println(st.path);\n\n if(st.x == gx && st.y == gy){\n return st.cost;\n }\n\n for(int i = 0; i < 4; i++){\n char nx = (char)(st.x + dx[i]);\n char ny = (char)(st.y + dy[i]);\n\n if(0 > nx || 0 > ny || nx >= w || ny >= h || t[ny][nx] == '#'){\n continue;\n }\n\n String npath = st.path + ds[i];\n\n if(npath.length() > 10){\n npath = npath.substring(1);\n }\n\n boolean flg = true;\n char[] nmatch = new char[n];\n\n for(int j = 0; j < n; j++){\n nmatch[j] = (char)0;\n\n for(int len = Math.min(p[j].length(), npath.length()); len > 0; len--){\n boolean matchFlg = true;\n\n for(int k = 0; k < len; k++){\n if(npath.charAt(npath.length() - len + k) != p[j].charAt(k)){\n matchFlg = false;\n break;\n }\n }\n\n if(matchFlg){\n nmatch[j] = (char)len;\n break;\n }\n }\n\n if(nmatch[j] == p[j].length()){\n flg = false;\n break;\n }\n }\n\n if(!flg){\n continue;\n }\n\n State nst = new State(nx, ny, (short)(st.cost + 1), npath, nmatch);\n\n if(!closed.contains(nst)){\n closed.add(nst);\n open.add(nst);\n }\n }\n }\n\n return -1;\n }\n\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n while(sc.hasNextInt()){\n h = sc.nextInt();\n w = sc.nextInt();\n if(h == 0 && w == 0) break;\n t = new char[h][w];\n\n for(int i = 0; i < h; i++){\n t[i] = sc.next().toCharArray();\n\n for(int j = 0; j < w; j++){\n if(t[i][j] == 'S'){\n sx = (char)j;\n sy = (char)i;\n }\n else if(t[i][j] == 'G'){\n gx = (char)j;\n gy = (char)i;\n }\n }\n }\n\n n = sc.nextInt();\n p = new String[n];\n\n for(int i = 0; i < n; i++){\n p[i] = sc.next();\n }\n\n System.out.println(bfs());\n }\n }\n}", "#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n\nint Psz;\nstruct PMA{\n\tint n;\n\tPMA *next[0x200];\n\tvector<int> accept;\n\tPMA() { fill(next, next+0x200, (PMA*)0); }\n\tPMA(int a)\n\t{\n\t\tn=a;\n\t\tfill(next, next+0x200, (PMA*)0);\n\t}\n};\n\nPMA *buildPMA(vector<string>& p, vector<PMA*>& vpma, int size)\n{\n\tPsz=0;\n\tPMA *root = new PMA(Psz++);\n\tvpma.push_back(root);\n\tfor(int i=0; i<size; i++)\n\t{\n\t\tPMA* t=root;\n\t\tfor(int j=0; j<p[i].size(); j++)\n\t\t{\n\t\t\tchar c=p[i][j];\n\t\t\tif(t->next[c] == NULL)\n\t\t\t{\n\t\t\t\tt->next[c] = new PMA(Psz++);\n\t\t\t\tvpma.push_back(t->next[c]);\n\t\t\t}\n\t\t\tt = t->next[c];\n\t\t}\n\t}\n\n\tqueue<PMA*> Q;\n\tfor(int c = 'A'; c<='Z'; c++)\n\t{\n\t\tif(root->next[c])\n\t\t{\n\t\t\troot->next[c]->next[0]=root;\n\t\t\tQ.push(root->next[c]);\n\t\t}\n\t\telse\n\t\t{\n\t\t\troot->next[c] = root;\n\t\t}\n\t}\n\n\twhile(!Q.empty())\n\t{\n\t\tPMA *t = Q.front(); Q.pop();\n\t\tfor(int c = 'A'; c<='Z'; c++)\n\t\t{\n\t\t\tif(t->next[c])\n\t\t\t{\n\t\t\t\tQ.push(t->next[c]);\n\t\t\t\tPMA *r = t->next[0];\n\t\t\t\twhile(!r->next[c]) r = r->next[0];\n\t\t\t\tt->next[c]->next[0] = r->next[c];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn root;\n}\n\nint match(char t, PMA* v, int &ret)\n{\n\tint r=v->n;\n\n\tchar c=t;\n\twhile(!v->next[c]) v = v->next[0];\n\tv = v->next[c];\n\tr = v->n;\n\tret += v->accept.size();\n\n\treturn r;\n}\n\nvoid makeacpt(PMA* p, int n, string w)\n{\n\tPMA *t = p;\n\tfor(int j=0; j<w.size(); j++)\n\t{\n\t\tchar c=w[j];\n\t\tif(t->next[c]==NULL) return;\n\t\tt = t->next[c];\n\t}\n\n\tfor(int i=0; i<t->accept.size(); i++)\n\t\tif(t->accept[i]==n) return;\n\n\tt->accept.push_back(n);\n}\n\nclass State\n{\npublic:\n\tint x,y,pma,c;\n\tState(int x, int y, int pma, int c)\n\t\t:x(x),y(y),pma(pma),c(c)\n\t{}\n};\n\nint dx[]={-1,0,1,0};\nint dy[]={0,-1,0,1};\n\nbool v[60][60][60];\nchar dir[4]={'L', 'U', 'R', 'D'};\n\nint main()\n{\n\tint M,N;\n\twhile(cin >> N >> M, (M||N))\n\t{\n\t\tmemset(v,0,sizeof(v));\n\n\t\tint sx,sy;\n\t\tchar f[90][90];\n\t\tfor(int i=0; i<N; i++)\n\t\tfor(int j=0; j<M; j++)\n\t\t{\n\t\t\tcin >> f[j][i];\n\t\t\tif(f[j][i]=='S')\n\t\t\t{\n\t\t\t\tsx=j;\n\t\t\t\tsy=i;\n\t\t\t}\n\t\t}\n\n\t\tint P;\n\t\tcin >> P;\n\t\tvector<string> str;\n\t\tfor(int i=0; i<P; i++)\n\t\t{\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\tstr.push_back(s);\n\t\t}\n\n\t\tvector<PMA*> vpma;\n\t\tPMA* root = buildPMA(str,vpma,str.size());\n\t\tfor(int j=0; j<str.size(); j++)\n\t\tfor(int i=0; i<Psz; i++)\n\t\t{\n\t\t\tPMA* p=vpma[i];\n\t\t\tmakeacpt(p,j,str[j]);\n\t\t}\n\n\t\tbool g=false;\n\t\tqueue<State> q;\n\t\tq.push(State(sx,sy,0,0));\n\n\t\twhile(!q.empty())\n\t\t{\n\t\t\tState s=q.front(); q.pop();\n\t\t\tif(v[s.x][s.y][s.pma]) continue;\n\t\t\tv[s.x][s.y][s.pma]=1;\n\n\t\t\tif(f[s.x][s.y]=='G')\n\t\t\t{\n\t\t\t\tg=true;\n\t\t\t\tcout << s.c << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor(int i=0; i<4; i++)\n\t\t\t{\n\t\t\t\tint tx=s.x+dx[i], ty=s.y+dy[i];\n\t\t\t\tif(tx<0||ty<0||tx>=M||ty>=N) continue;\n\t\t\t\tif(f[tx][ty]=='#') continue;\n\n\t\t\t\tint ret=0;\n\t\t\t\tint tpma = match(dir[i],vpma[s.pma],ret);\n\n\t\t\t\tif(ret!=0) continue;\n\t\t\t\tif(v[tx][ty][tpma]) continue;\n\n\t\t\t\tq.push(State(tx,ty,tpma,s.c+1));\n\n\n\t\t\t}\n\n\t\t}\n\n\t\tif(!g) cout << -1 << endl;\n\t}\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\ntemplate <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }\n#endif\n\n#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define popcount __builtin_popcount\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntemplate <class T> void max_swap(T& a, const T& b) { a = max(a, b); }\ntemplate <class T> void min_swap(T& a, const T& b) { a = min(a, b); }\n\ntypedef long long ll;\ntypedef pair<int, int> pint;\n\nconst double PI = acos(-1.0);\nconst int dx[] = { 0, 1, 0, -1 };\nconst int dy[] = { 1, 0, -1, 0 };\n\n\nvector<int> build_pma(const vector<int>& pat)\n{\n\tvector<int> res(pat.size() + 1);\n\tres[0] = -1;\n\tfor (int i = 0, j = -1; i < pat.size(); ++i)\n\t{\n\t\twhile (j >= 0 && pat[i] != pat[j])\n\t\t\tj = res[j];\n\t\tres[i + 1] = ++j;\n\t}\n\treturn res;\n}\nll encode(const vector<int>& states)\n{\n\tll res = 0;\n\tfor (int i = states.size() - 1; i >= 0; --i)\n\t\tres = res << 4 | states[i];\n\treturn res;\n}\nvoid decode(ll e, vector<int>& res)\n{\n\tfor (int i = 0; i < res.size(); ++i, e >>= 4)\n\t\tres[i] = e & 0xf;\n}\nll next_states(const vector<vector<int> >& pat, const vector<vector<int> >& pma, ll states, int dir)\n{\n\tll res = 0;\n\tvector<int> cur(pat.size()), next;\n\tdecode(states, cur);\n\tfor (int i = 0; i < cur.size(); ++i)\n\t{\n\t\twhile (cur[i] >= 0 && pat[i][cur[i]] != dir)\n\t\t\tcur[i] = pma[i][cur[i]];\n\t\tif (++cur[i] == pat[i].size())\n\t\t\treturn -1;\n\t\tnext.push_back(cur[i]);\n\t}\n\treturn encode(next);\n}\nstruct Node\n{\n\tint x, y;\n\tll states;\n\tNode(int x, int y, ll s)\n\t\t: x(x), y(y), states(s) {}\n};\nint main()\n{\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m)\n\t{\n\t\tstring maze[64], pp[16];\n\t\trep (i, n)\n\t\t\tcin >> maze[i];\n\t\tcin >> p;\n\t\trep (i, p)\n\t\t\tcin >> pp[i];\n\n\t\tint sx, sy, gx, gy;\n\t\trep (y, n)\n\t\t{\n\t\t\trep (x, m)\n\t\t\t{\n\t\t\t\tif (maze[y][x] == 'S')\n\t\t\t\t\tsx = x, sy = y;\n\t\t\t\telse if (maze[y][x] == 'G')\n\t\t\t\t\tgx = x, gy = y;\n\t\t\t}\n\t\t}\n\n\t\tvector<vector<int> > pat(p);\n\t\trep (i, p)\n\t\t\trep (j, pp[i].size())\n\t\t\t\tpat[i].push_back(string(\"DRUL\").find(pp[i][j]));\n\n\t\tvector<vector<int> > pma(p);\n\t\trep (i, p)\n\t\t\tpma[i] = build_pma(pat[i]);\n\n\t\tint res = -1;\n\t\tmap<ll, int> visit[64][64];\n\t\tqueue<Node> q;\n\t\tq.push(Node(sx, sy, 0));\n\t\tvisit[sy][sx][0] = 0;\n\t\tvector<int> s(p);\n\t\twhile (!q.empty())\n\t\t{\n\t\t\tNode cur = q.front(); q.pop();\n\t\t\tint cost = visit[cur.y][cur.x][cur.states] + 1;\n\t\t\tfor (int i = 0; i < 4; ++i)\n\t\t\t{\n\t\t\t\tint nx = cur.x + dx[i], ny = cur.y + dy[i];\n\t\t\t\tif (0 <= nx && nx < m && 0 <= ny && ny < n\n\t\t\t\t\t&& maze[ny][nx] != '#')\n\t\t\t\t{\n\t\t\t\t\tll ns = next_states(pat, pma, cur.states, i);\n\t\t\t\t\tif (ns != -1 && !visit[ny][nx].count(ns))\n\t\t\t\t\t{\n\t\t\t\t\t\tdecode(ns, s);\n\t\t\t\t\t\tif (nx == gx && ny == gy)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tres = cost;\n\t\t\t\t\t\t\tgoto End;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tq.push(Node(nx, ny, ns));\n\t\t\t\t\t\t\tvisit[ny][nx][ns] = cost;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\nEnd:\n\t\tcout << res << endl;\n\t}\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\n#define each(i,a) for (auto&& i : a)\n#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)\n#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)\n#define REP(i,n) FOR(i,0,n)\n#define RREP(i,n) RFOR(i,0,n)\n#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME\n#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)\n#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define chmin(x,v) x = min(x, v)\n#define chmax(x,v) x = max(x, v)\n\nconst ll linf = 1e18;\nconst double eps = 1e-12;\nconst double pi = acos(-1);\n\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& vec) {\n each(x,vec) is >> x;\n return is;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& vec) {\n rep(i,vec.size()) {\n if (i) os << \" \";\n os << vec[i];\n }\n return os;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector< vector<T> >& vec) {\n rep(i,vec.size()) {\n if (i) os << endl;\n os << vec[i];\n }\n return os;\n}\nclass AhoCorasick {\n void clear_graph() {\n root.child.clear();\n root.pattern.clear();\n }\n void generate_trie(const vector<string>& patterns) {\n ll n = patterns.size();\n rep(i, n) {\n Node* t = &root;\n each(c, patterns[i]) {\n if (t->child.count(c) == 0) {\n t->child[c] = Node(nodes.size());\n nodes.pb(&t->child[c]);\n }\n t = &(t->child[c]);\n }\n t->pattern.push_back(i);\n }\n }\n void add_failure_edge() {\n queue<Node*> Q; Q.push(&root);\n //幅優先探索で帰納的に失敗時の遷移辺を追加していく\n while (!Q.empty()) {\n Node* t = Q.front(); Q.pop();\n each(p, t->child) {\n Q.push(&(p.second));\n char c = p.first;\n Node* node = &(p.second); // 文字cで遷移する頂点\n Node* anode = t->failure; // 失敗したときの遷移先\n while ( anode != NULL && anode->child.count(c) == 0 ) {\n anode = anode->failure;\n }\n //遷移失敗時に続けられる別の頂点へ遷移\n if (anode == NULL) {\n node->failure = &root;\n }\n else {\n node->failure = &(anode->child[c]);\n }\n //マッチするパターンを追加\n each(to, node->failure->pattern) {\n node->pattern.pb(to);\n }\n //メモリ食いすぎ回避のため切り詰めておく\n vector<size_t>(node->pattern).swap(node->pattern);\n }\n }\n }\n //Pattern Match Automatonを構築\n void make_PMA(const vector<string>& patterns) {\n clear_graph();\n generate_trie(patterns);\n add_failure_edge();\n }\npublic:\n struct Node {\n ll id;\n map<char,Node> child; //遷移辺(!)\n vector<size_t> pattern; //マッチするパターン(のindex)\n Node* failure; //遷移失敗時の遷移先ノード\n Node():failure(NULL) {\n }\n Node(ll id):failure(NULL), id(id) {}\n };\n vector<Node*> nodes;\n Node root;\n AhoCorasick(const vector<string>& patterns) : nodes(0), root(0) {\n nodes.assign(1, &root);\n make_PMA(patterns);\n }\n pair<Node*, vector<ll>> find(Node* node, char c) {\n vector<ll> res;\n while (node != NULL && node->child.count(c) == 0) {\n node = node->failure;\n }\n if (node == NULL) node = &root;\n else node = &(node->child[c]);\n each(ptn, node->pattern) {\n res.pb(ptn);\n }\n return pair<Node*, vector<ll>>(node, res);\n }\n};\n\nconst string dname = \"URDL\";\nconst ll dx[] = {0, 1, 0, -1};\nconst ll dy[] = {-1, 0, 1, 0};\n\nstruct Node2 {\n ll x, y, nid;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n ll h, w;\n while (cin >> h >> w, h || w) {\n vector<string> m(h); cin >> m;\n ll patterns; cin >> patterns;\n vector<string> ptn(patterns); cin >> ptn;\n AhoCorasick ac(ptn);\n auto inRange = [&](ll x, ll y) {\n return 0 <= x && x < w && 0 <= y && y < h;\n };\n ll sx, sy, gx, gy;\n rep(y, h) rep(x, w) {\n if (m[y][x] == 'S') sx = x, sy = y;\n if (m[y][x] == 'G') gx = x, gy = y;\n }\n ll n = ac.nodes.size();\n vector<vector<vector<ll>>> dist(h, vector<vector<ll>>(w, vector<ll>(n, linf)));\n queue<Node2> Q;\n dist[sy][sx][0] = 0;\n Q.push({sx, sy, 0});\n while ( !Q.empty() ) {\n Node2 node = Q.front(); Q.pop();\n ll x = node.x, y = node.y, nid = node.nid;\n AhoCorasick::Node* ac_node = ac.nodes[nid];\n rep(d, 4) {\n ll nx = x + dx[d];\n ll ny = y + dy[d];\n if ( !inRange(nx, ny) ) continue;\n if ( m[ny][nx] == '#' ) continue;\n auto result = ac.find(ac_node, dname[d]);\n if ( result.second.size() > 0 ) continue;\n ll nnid = result.first->id;\n assert(nnid < n);\n if (dist[y][x][nid]+1 < dist[ny][nx][nnid]) {\n dist[ny][nx][nnid] = dist[y][x][nid]+1;\n Q.push({nx, ny, nnid});\n }\n }\n }\n ll ans = linf;\n rep(i, n) chmin(ans, dist[gy][gx][i]);\n if (ans == linf) cout << -1 << endl;\n else cout << ans << endl;\n }\n}", "// 12:17 - 13:14\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cstdio>\n#include<cassert>\n#include<climits>\n#include<map>\n#include<queue>\n#include<set>\n \n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX_SP 15\n#define MAX_LEN 60\n \nusing namespace std;\n \ntypedef pair<int,int> ii;\nstruct Data{\n int cur,cost;\n ii info;\n Data(int cur=IINF,int cost=IINF,ii info=ii(IINF,IINF)):cur(cur),cost(cost),info(info){}\n bool operator < (const Data& a)const{\n return cost > a.cost;\n }\n};\n \nint h,w,sp,gp,P;\nchar G[MAX_LEN][MAX_LEN];\n/*\n next_state[index][the number of match]\n 0 -> empty\n 1 -> spell[0]\n 2 -> spell[1]\n ...\n */\nii next_state[MAX_SP][MAX_SP][4];\nint mincost[MAX_LEN*MAX_LEN][MAX_SP][MAX_SP];\nstring spell[MAX_SP];\nint dx[] = {+0,+1,+0,-1};\nint dy[] = {-1,+0,+1,+0};\nchar dc[] = {'U','R','D','L'};\n\nii getValue(string s){\n rep(i,P+1){\n int cur = 0;\n rep(j,spell[i].size()){\n if(s[cur] != spell[i][j]){\n\tbreak;\n }\n cur++;\n if(cur >= s.size()){\n\treturn ii(i,j+1);\n }\n }\n }\n return ii(0,0);\n}\n\nvoid INIT(){\n rep(i,MAX_SP)rep(j,MAX_SP)rep(k,4)next_state[i][j][k] = ii(0,0);\n \n rep(i,P+1){\n rep(j,spell[i].size()+1){\n rep(dir,4){\n\trep(k,j+1){\n\t ii value = getValue(spell[i].substr(0,j).substr(k)+dc[dir]);\n\t if(value != ii(0,0) && next_state[i][j][dir].second < value.second){\n\t next_state[i][j][dir] = value;\n\t }\n\t}\n }\n }\n }\n}\n\ninline bool isValid(int x,int y){\n return ( 0 <= x && x < w && 0 <= y && y < h );\n}\n\nvoid compute(){\n \n priority_queue<Data> Q;\n Q.push(Data(sp,0,ii(0,0)));\n rep(i,h*w)rep(j,MAX_SP)rep(k,MAX_SP)mincost[i][j][k] = IINF;\n mincost[sp][0][0] = 0;\n \n while(!Q.empty()){\n \n Data data = Q.top(); Q.pop();\n \n if(data.cur == gp){\n cout << data.cost << endl;\n return;\n }\n \n rep(dir,4){\n \n int nx = data.cur % w + dx[dir];\n int ny = data.cur / w + dy[dir];\n \n if(!isValid(nx,ny))continue;\n \n if(G[ny][nx] == '#')continue;\n \n ii next = next_state[data.info.first][data.info.second][dir];\n \n if(next.first != 0 && spell[next.first].size() == next.second)continue;\n \n if(mincost[nx+ny*w][next.first][next.second] > data.cost + 1){\n\tmincost[nx+ny*w][next.first][next.second] = data.cost + 1;\n\tQ.push(Data(nx+ny*w,data.cost+1,next));\n }\n }\n }\n cout << -1 << endl;\n}\n \nbool cmp(const string& a,const string& b){\n return a.size() < b.size();\n}\n\nint main(){\n while(cin >> h >> w,h|w){\n rep(i,h){\n rep(j,w){\n\tcin >> G[i][j];\n\tif(G[i][j] == 'S'){\n\t sp = j + i * w;\n\t}\n\telse if(G[i][j] == 'G'){\n\t gp = j + i * w;\n\t}\n }\n }\n cin >> P;\n spell[0].clear();\n vector<string> tmp;\n rep(i,P){\n cin >> spell[i+1];\n tmp.push_back(spell[i+1]);\n }\n \n sort(tmp.begin(),tmp.end(),cmp);\n \n bool out[tmp.size()];\n rep(i,tmp.size())out[i] = false;\n rep(i,tmp.size()){\n REP(j,i+1,tmp.size()){\n\tif(tmp[j].find(tmp[i]) != string::npos){\n\t out[j] = true;\n\t}\n }\n }\n \n vector<string> tmp2;\n rep(i,tmp.size())if(!out[i]){\n tmp2.push_back(tmp[i]);\n }\n P = tmp2.size();\n rep(i,P){\n spell[i+1] = tmp2[i];\n }\n \n INIT();\n \n compute();\n \n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1e8;\n\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\n\nconst int var = 4;\n\nstring D = \"DRUL\";\n\nstruct node {\n\tnode *fail;\n\tvector<node*> next;\n\tvector<int> ok;\n\tnode() : fail(nullptr), next(var, nullptr) {}\n};\n\nclass Aho_Corasick {\n\tstatic int trans(char c) {\n\t\tswitch (c)\n\t\t{\n\t\tcase 'R': return 0;\n\t\tcase 'D': return 1;\n\t\tcase 'L': return 2;\n\t\tcase 'U': return 3;\n\t\tdefault: break;\n\t\t}\n\t\texit(EXIT_FAILURE);\n\t}\n\tvector<int> unite(const vector<int>& a, const vector<int>& b) {\n\t\tvector<int> res;\n\t\tset_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res));\n\t\treturn res;\n\t}\n\tint K;\npublic:\n\tnode *root;\n\tAho_Corasick(const vector<string>& Ts) : K(Ts.size()), root(new node) {\n\t\tnode *now;\n\t\troot->fail = root;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tauto &T = Ts[i];\n\t\t\tnow = root;\n\t\t\tfor (auto c : T) {\n\t\t\t\tif (now->next[trans(c)] == nullptr) {\n\t\t\t\t\tnow->next[trans(c)] = new node;\n\t\t\t\t}\n\t\t\t\tnow = now->next[trans(c)];\n\t\t\t}\n\t\t\tnow->ok.push_back(i);\n\t\t}\n\t\tqueue<node*> q;\n\t\tfor (int i = 0; i < var; i++) {\n\t\t\tif (root->next[i] == nullptr) {\n\t\t\t\troot->next[i] = root;\n\t\t\t}\n\t\t\telse {\n\t\t\t\troot->next[i]->fail = root;\n\t\t\t\tq.push(root->next[i]);\n\t\t\t}\n\t\t}\n\t\twhile (!q.empty()) {\n\t\t\tnow = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < var; i++) {\n\t\t\t\tif (now->next[i] != nullptr) {\n\t\t\t\t\tnode *nx = now->fail;\n\t\t\t\t\twhile (nx->next[i] == nullptr) {\n\t\t\t\t\t\tnx = nx->fail;\n\t\t\t\t\t}\n\t\t\t\t\tnow->next[i]->fail = nx->next[i];\n\t\t\t\t\tnow->next[i]->ok = unite(now->next[i]->ok, nx->next[i]->ok);\n\t\t\t\t\tq.push(now->next[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tnode* getnext(node* p, char c) {\n\t\twhile (p->next[trans(c)] == nullptr) p = p->fail;\n\t\treturn p->next[trans(c)];\n\t}\n};\n\nusing T = tuple<int, int, node*>;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m) {\n\t\tvector<string> S(n);\n\t\tint sx = 0, sy = 0, gx = 0, gy = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> S[i];\n\t\t\tfor (int j = 0; j < (int)S[i].size(); j++) {\n\t\t\t\tif (S[i][j] == 'S') {\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t}\n\t\t\t\telse if (S[i][j] == 'G') {\n\t\t\t\t\tgx = i;\n\t\t\t\t\tgy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> p;\n\t\tvector<string> pts(p);\n\t\tfor (int i = 0; i < p; i++) {\n\t\t\tcin >> pts[i];\n\t\t}\n\t\tAho_Corasick aho(pts);\n\t\tvector<vector<map<node*, int>>> f(n, vector<map<node*, int>>(m));\n\t\tqueue<T> q;\n\t\tq.push(make_tuple(sx, sy, aho.root));\n\t\tf[sx][sy][aho.root] = 0;\n\t\twhile (!q.empty()) {\n\t\t\tauto p = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint tx = get<0>(p) + dx[i], ty = get<1>(p) + dy[i];\n\t\t\t\tnode *t = aho.getnext(get<2>(p), D[i]);\n\t\t\t\tif (0 <= tx && tx < n && 0 <= ty && ty < m && S[tx][ty] != '#' && t->ok.empty() && f[tx][ty].count(t) == 0) {\n\t\t\t\t\tq.push(make_tuple(tx, ty, t));\n\t\t\t\t\tf[tx][ty][t] = f[get<0>(p)][get<1>(p)][get<2>(p)] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint res = INF;\n\t\tfor (auto p : f[gx][gy]) {\n\t\t\tres = min(res, p.second);\n\t\t}\n\t\tcout << (res != INF ? res : -1) << endl;\n\t}\n\treturn 0;\n}", "#include <vector>\n#include <string>\n#include <memory>\n#include <set>\n#include <map>\n#include <queue>\n\n#include <iostream>\nusing namespace std;\n\n#define rep(i,n) for(int i=0,i##_len=n;i<i##_len;i++)\n#define all(x) begin(x),end(x)\n#define lim(x,r,l) (r<=x&&x<l)\ntypedef long long ll;\ntypedef long double ld;\n\nstruct PMA {\n bool isRoot = false;\n set<int> matched;\n map<char, PMA*> nexts;\n PMA* faild;\n PMA() : matched() , nexts() , faild() { }\n ~PMA() {\n for(auto&& n : nexts){\n delete n.second;\n }\n }\n static PMA build(const vector<string>& patterns) {\n PMA root;\n root.isRoot = true;\n root.faild = &root;\n\n for(int i = 0; i < patterns.size(); i++){\n PMA* now = &root;\n for(int j = 0; j < patterns[i].size(); j++){\n if(now->nexts.find(patterns[i][j]) == now->nexts.end()){\n now->nexts[patterns[i][j]] = new PMA;\n }\n now = now->nexts[patterns[i][j]];\n }\n now->matched.insert(i);\n }\n\n queue<PMA*> que;\n for(auto&& next : root.nexts){\n next.second->faild = &root;\n que.push(next.second);\n }\n\n while(!que.empty()){\n PMA* now = que.front(); que.pop();\n for(auto&& next : now->nexts){\n char c = next.first;\n PMA* nextfaild = now->faild;\n while(!(nextfaild->isRoot || nextfaild->nexts.find(c) != nextfaild->nexts.end())){\n nextfaild = nextfaild->faild;\n }\n if(nextfaild->nexts.find(c) != nextfaild->nexts.end()){\n now->nexts[c]->faild = nextfaild->nexts[c];\n now->nexts[c]->matched.insert(\n begin(nextfaild->nexts[c]->matched), end(nextfaild->nexts[c]->matched));\n }else{\n now->nexts[c]->faild = &root;\n }\n\n que.push(now->nexts[c]);\n }\n }\n return root;\n }\n tuple<set<int>, PMA*> match(const string& str, int i = 0, PMA* now_ = nullptr){\n set<int> res;\n PMA* now = now_ ? now_ : this;\n for(; i < str.size(); i++){\n int c = str[i];\n while(!(now->isRoot || now->nexts.find(c) != now->nexts.end())){\n now = now->faild;\n }\n if(now->nexts.find(c) != now->nexts.end()){\n now = now->nexts[c];\n }\n res.insert(begin(now->matched), end(now->matched));\n }\n return make_tuple(res, now);\n }\n};\n\n\nconst vector<int> d4x({1, 0, -1, 0});\nconst vector<int> d4y({0, -1, 0, 1});\nconst vector<string> d4c({\"D\", \"L\", \"U\", \"R\"});\nint main(){\nint n, m;\nwhile(cin >> n >> m, n != 0){\n vector<vector<char>> bd(n, vector<char>(m));\n int sx, sy, gx, gy;\n rep(i, n) { rep(j, m) {\n cin >> bd[i][j];\n if(bd[i][j] == 'S'){ sx = i; sy = j;}\n if(bd[i][j] == 'G'){ gx = i; gy = j;}\n } }\n\n int p; cin >> p;\n vector<string> patterns(p);\n rep(i, p){\n cin >> patterns[i];\n }\n\n PMA pma = PMA::build(patterns);\n\n set<tuple<int, int, PMA*>> visited;\n queue<tuple<int, int, PMA*, int>> que;\n\n que.emplace(sx, sy, &pma, 0);\n\n int res = ([&]{\n while(!que.empty()){\n int nx, ny, c; PMA* now;\n tie(nx, ny, now, c) = que.front(); que.pop();\n rep(d, 4){\n int tx = nx + d4x[d], ty = ny+d4y[d];\n tuple<set<int>, PMA*> matched = pma.match(string(d4c[d]), 0, now);\n if(!(tx >= 0 && tx < n && ty >= 0 && ty < m &&\n bd[tx][ty] != '#')){\n continue;\n }\n if(!get<0>(matched).empty()){\n continue;\n }\n tuple<int, int, PMA*> next(tx, ty, get<1>(matched));\n if(visited.find(next) != visited.end()){\n continue;\n }\n visited.insert(next);\n if(tx == gx && ty == gy){\n return c + 1;\n }\n\n que.emplace(tx, ty, get<1>(matched), c + 1);\n }\n }\n return -1;\n })();\n\n cout << res << endl;\n}\n}", "#include \"bits/stdc++.h\"\n\n#define REP(i, n) for (int i = 0; i < n; ++i)\n// https://onlinejudge.u-aizu.ac.jp/status/users/EtoNagisa/submissions/1/2212/judge/3966278/C++14\nusing namespace std;\n\n#include \"bits/stdc++.h\"\n\nstruct lower_alphabet {\n static constexpr std::size_t char_size = 26;\n static constexpr char min_char = 'a';\n};\nstruct upper_alphabet {\n static constexpr std::size_t char_size = 26;\n static constexpr char min_char = 'A';\n};\nstruct general_char {\n static constexpr std::size_t char_size = 256;\n static constexpr char min_char = 0;\n};\ntemplate <typename character>\nclass aho_corasick {\n public:\n static constexpr std::size_t invalid_index = -1;\n struct PMA {\n std::size_t fail; // index of state correspond to fail suffix\n std::vector<std::size_t> next, accept;\n std::set<std::size_t> r_fail;\n PMA() : fail(0), next(character::char_size, invalid_index) {}\n };\n std::vector<PMA> nodes;\n std::size_t cnt;\n\n aho_corasick() : cnt(0) {}\n void build(const std::vector<std::string> &dict) {\n add_node();\n for (std::size_t i = 0; i < dict.size(); ++i) {\n std::size_t now = 0;\n for (std::size_t j = 0; j < dict[i].size(); ++j) {\n std::size_t t = static_cast<size_t>(dict[i][j] - character::min_char);\n if (nodes[now].next[t] == invalid_index) {\n std::size_t next = size();\n add_node();\n nodes[now].next[t] = next;\n }\n now = nodes[now].next[t];\n }\n nodes[now].accept.push_back(i);\n }\n std::queue<std::size_t> q;\n for (std::size_t i = 0; i < character::char_size; ++i) {\n if (nodes[0].next[i] == invalid_index) {\n nodes[0].next[i] = 0;\n } else {\n set_fail(nodes[0].next[i], 0);\n q.push(nodes[0].next[i]);\n }\n }\n while (!q.empty()) {\n std::size_t p = q.front();\n q.pop();\n for (std::size_t i = 0; i < character::char_size; ++i) {\n if (nodes[p].next[i] != invalid_index) {\n std::size_t tmp = next(nodes[p].fail, i + character::min_char);\n set_fail(nodes[p].next[i], tmp);\n for (std::size_t ac : nodes[tmp].accept) {\n nodes[nodes[p].next[i]].accept.push_back(ac);\n }\n q.push(nodes[p].next[i]);\n }\n }\n }\n }\n void add(const std::string &s) {\n std::size_t start = -1, now = 0;\n for (std::size_t i = 0; i < s.size(); ++i) {\n std::size_t t = static_cast<size_t>(s[i] - character::min_char);\n if (nodes[now].next[t] == invalid_index) {\n start = i;\n break;\n }\n now = nodes[now].next[t];\n }\n for (std::size_t i = start; i < s.size(); ++i) {\n std::size_t t = static_cast<size_t>(s[i] - character::min_char);\n std::size_t nxt = size();\n add_node();\n nodes[now].next[t] = nxt;\n std::size_t tmp = next(nodes[now].fail, s[i]);\n set_fail(nxt, tmp);\n for (std::size_t ac : nodes[tmp]) {\n nodes[nxt].accept.push_back(ac);\n }\n\n for (std::size_t p : nodes[now].r_fail) {\n if (nodes[p].next[t] != invalid_index) {\n set_fail(nodes[p].next[t], nxt);\n }\n }\n now = nxt;\n }\n }\n std::size_t size() const { return cnt; }\n std::size_t next(std::size_t now, char c) const {\n std::size_t t = static_cast<std::size_t>(c - character::min_char);\n while (nodes[now].next[t] == invalid_index) now = nodes[now].fail;\n return nodes[now].next[t];\n }\n std::vector<std::vector<std::size_t>> match(const std::string &s) const {\n std::size_t now = 0;\n std::vector<std::vector<std::size_t>> ret(s.size());\n for (std::size_t i = 0; i < s.size(); ++i) {\n now = next(now, s[i]);\n for (auto ac : nodes[now].accept) {\n ret[i].push_back(ac);\n }\n }\n }\n\n private:\n void add_node() {\n nodes.emplace_back();\n cnt++;\n }\n void set_fail(std::size_t from, std::size_t to) {\n nodes[nodes[from].fail].r_fail.erase(from);\n nodes[from].fail = to;\n nodes[to].r_fail.insert(from);\n }\n};\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\nstring mv = \"DRUL\";\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, m;\n while (cin >> n >> m, n) {\n vector<string> v(n);\n REP(i, n) cin >> v[i];\n int qu;\n cin >> qu;\n vector<string> p(qu);\n REP(i, qu) cin >> p[i];\n aho_corasick<upper_alphabet> ac;\n ac.build(p);\n int sx = -1, sy = -1, tx = -1, ty = -1;\n REP(i, n) REP(j, m) {\n if (v[i][j] == 'S') {\n sx = i;\n sy = j;\n } else if (v[i][j] == 'G') {\n tx = i;\n ty = j;\n }\n }\n int k = ac.nodes.size();\n vector<vector<vector<int>>> dp(n,\n vector<vector<int>>(m, vector<int>(k, 1e9)));\n dp[sx][sy][0] = 0;\n queue<pair<pair<int, int>, int>> q;\n q.push({{sx, sy}, 0});\n while (!q.empty()) {\n auto c = q.front();\n q.pop();\n int x = c.first.first, y = c.first.second, s = c.second;\n REP(d, 4) {\n int nx = x + dx[d], ny = y + dy[d], ns = ac.next(s, mv[d]);\n if (nx < 0 || nx >= n || ny < 0 || ny >= m || v[nx][ny] == '#' ||\n ac.nodes[ns].accept.size() > 0)\n continue;\n if (dp[nx][ny][ns] > dp[x][y][s] + 1) {\n dp[nx][ny][ns] = dp[x][y][s] + 1;\n q.push({{nx, ny}, ns});\n }\n }\n }\n int ans = 1e9;\n REP(i, k) ans = min(ans, dp[tx][ty][i]);\n if (ans == 1e9)\n cout << -1 << endl;\n else\n cout << ans << endl;\n }\n}\n\n", "#include <queue>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst string ds = \"RDLU\";\nconst vector<int> dx = { 0, 1, 0, -1 };\nconst vector<int> dy = { 1, 0, -1, 0 };\nstruct state {\n\tint x, y, ban, len;\n};\nint dist[53][53][13][13];\nint main() {\n\tint H, W, P;\n\twhile (cin >> H >> W, H) {\n\t\tvector<string> S(H);\n\t\tint sx = -1, sy = -1, gx = -1, gy = -1;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tcin >> S[i];\n\t\t\tif (S[i].find('S') != string::npos) sx = i, sy = S[i].find('S');\n\t\t\tif (S[i].find('G') != string::npos) gx = i, gy = S[i].find('G');\n\t\t}\n\t\tcin >> P;\n\t\tvector<string> ban(P);\n\t\tfor (int i = 0; i < P; ++i) {\n\t\t\tcin >> ban[i];\n\t\t}\n\t\tsort(ban.begin(), ban.end());\n\t\tvector<string> rban;\n\t\tfor (int i = 0; i < P; ++i) {\n\t\t\tbool flag = true;\n\t\t\tfor (int j = 0; j < P; ++j) {\n\t\t\t\tif (ban[i] != ban[j] && ban[i].find(ban[j]) != string::npos) {\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t\tif (ban[i] == ban[j] && i > j) {\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag) rban.push_back(ban[i]);\n\t\t}\n\t\tban = rban;\n\t\tP = ban.size();\n\t\tmemset(dist, -1, sizeof(dist));\n\t\tqueue<state> que;\n\t\tque.push(state{ sx, sy, P, 0 });\n\t\tdist[sx][sy][P][0] = 0;\n\t\tint ans = -1;\n\t\twhile (!que.empty()) {\n\t\t\tstate s = que.front(); que.pop();\n\t\t\tint di = dist[s.x][s.y][s.ban][s.len];\n\t\t\tif (s.x == gx && s.y == gy) {\n\t\t\t\tif (ans == -1) ans = di;\n\t\t\t\telse ans = min(ans, di);\n\t\t\t}\n\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\tint tx = s.x + dx[i], ty = s.y + dy[i];\n\t\t\t\tif (0 <= tx && tx < H && 0 <= ty && ty < W && S[tx][ty] != '#') {\n\t\t\t\t\tbool incr = (s.ban != P && ban[s.ban][s.len] == ds[i]);\n\t\t\t\t\tint nxt_ban = s.ban, nxt_len = s.len;\n\t\t\t\t\tif (incr) {\n\t\t\t\t\t\t++nxt_len;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tstring recent = (s.ban == P ? \"\" : ban[s.ban].substr(0, s.len)) + ds[i];\n\t\t\t\t\t\tnxt_ban = P; nxt_len = 0;\n\t\t\t\t\t\tfor (int j = s.len + 1; j > 0; --j) {\n\t\t\t\t\t\t\tint ptr = -1;\n\t\t\t\t\t\t\tfor (int k = 0; k < P; ++k) {\n\t\t\t\t\t\t\t\tif (recent.substr(s.len - j + 1) == ban[k].substr(0, j)) {\n\t\t\t\t\t\t\t\t\tptr = k;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (ptr != -1) {\n\t\t\t\t\t\t\t\tnxt_ban = ptr;\n\t\t\t\t\t\t\t\tnxt_len = j;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (nxt_ban != P && nxt_len == ban[nxt_ban].length()) continue;\n\t\t\t\t\tif (dist[tx][ty][nxt_ban][nxt_len] == -1) {\n\t\t\t\t\t\tdist[tx][ty][nxt_ban][nxt_len] = di + 1;\n\t\t\t\t\t\tque.push(state{ tx, ty, nxt_ban, nxt_len });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}\n", "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <iterator>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P > PP;\n \nint tx[] = {0,1,0,-1};//URDL\nint ty[] = {-1,0,1,0};\n \nstatic const double EPS = 1e-8;\n\n//URDL\nconst static char dir[4] = {'U','R','D','L'};\nconst static string dir_str[4] = {\"U\",\"R\",\"D\",\"L\"};\n\nnamespace AhoCorasick{\n class Node;\n class SearchMachine;\n struct MatchingResult {\n map<string,int> rv;\n long long id;\n };\n};\n\nclass AhoCorasick::Node {\nprivate:\n set<string> results;\n map<char,AhoCorasick::Node*> transitions;\n vector<AhoCorasick::Node*> v_transitions;\n char character;\n AhoCorasick::Node* parent;\n AhoCorasick::Node* failure;\npublic:\n Node() : character('\\0'),parent(NULL),failure(NULL){}\n Node(AhoCorasick::Node* _p,char _c) : parent(_p),character(_c),failure(NULL){}\n const char get_char() const {\n return character;\n }\n \n AhoCorasick::Node* get_parent() const{\n return parent;\n }\n\n AhoCorasick::Node* get_failure() const{\n return failure;\n }\n\n void set_failure(AhoCorasick::Node* _n){\n failure = _n;\n }\n\n AhoCorasick::Node* get_transition(const char c){\n if(transitions.find(c) == transitions.end()) return NULL;\n return transitions[c];\n }\n\n const set<string>& get_results() const{\n return results;\n }\n\n void add_result(const string& str){\n results.insert(str);\n }\n\n void add_transition(AhoCorasick::Node* node){\n transitions[node->get_char()] = node;\n v_transitions.push_back(node);\n }\n\n long long get_id() const{\n return reinterpret_cast<long long>(this);\n }\n\n const vector<AhoCorasick::Node*>& get_transitions() const{\n return v_transitions;\n }\n \n};\nclass AhoCorasick::SearchMachine{\nprivate:\n set<string> keywords;\n AhoCorasick::Node* root;\n AhoCorasick::Node* state;\npublic:\n SearchMachine(set<string> _k) : keywords(_k){\n _build_tree();\n }\n SearchMachine(){\n _build_tree();\n }\n void _build_tree(){\n root = new AhoCorasick::Node();\n \n for(set<string>::iterator it = keywords.begin();\n\tit != keywords.end();\n\tit++){\n AhoCorasick::Node* node = root;\n const string& keyword = *it;\n for(int i = 0; i < keyword.length(); i++){\n\tAhoCorasick::Node* next_node = node->get_transition(keyword[i]);\n\tif(next_node == NULL){\n\t next_node = new AhoCorasick::Node(node,keyword[i]);\n\t node->add_transition(next_node);\n\t}\n\tnode = next_node;\n }\n node->add_result(keyword);\n }\n\n vector<AhoCorasick::Node*> nodes;\n for(int i=0;i<root->get_transitions().size();i++){\n root->get_transitions()[i]->set_failure(root);\n\n vector<AhoCorasick::Node*> tmp_nodes;\n tmp_nodes.reserve(nodes.size() + root->get_transitions()[i]->get_transitions().size() + 1); \n merge(nodes.begin(), nodes.end(),\n\t root->get_transitions()[i]->get_transitions().begin(), root->get_transitions()[i]->get_transitions().end(),\n\t back_inserter<vector<AhoCorasick::Node*> >(tmp_nodes));\n nodes.swap(tmp_nodes);\n }\n\n while(nodes.size() > 0){\n vector<AhoCorasick::Node*> next_nodes;\n for(int i=0;i<nodes.size();i++){\n\tAhoCorasick::Node* r = nodes[i]->get_parent()->get_failure();\n\tconst char c = nodes[i]->get_char();\n \n\twhile((r != NULL) && (r->get_transition(c) == NULL)){\n\t r = r->get_failure();\n\t}\n\n\tif(r == NULL){\n\t nodes[i]->set_failure(root);\n\t}\n\telse{\n\t AhoCorasick::Node* tc = r->get_transition(c);\n\t nodes[i]->set_failure(tc);\n\t \n\t set<string> results;\n\t if(tc != NULL) results = tc->get_results();\n\t for(set<string>::iterator it = results.begin();\n\t it != results.end();\n\t it++){\n\t nodes[i]->add_result(*it);\n\t }\n\t}\n\n\tvector<AhoCorasick::Node*> tmp_nodes;\n\ttmp_nodes.reserve(next_nodes.size() + nodes[i]->get_transitions().size() + 1); \n\tmerge(next_nodes.begin(), next_nodes.end(),\n\t nodes[i]->get_transitions().begin(), nodes[i]->get_transitions().end(),\n\t back_inserter<vector<AhoCorasick::Node*> >(tmp_nodes));\n\tnext_nodes.swap(tmp_nodes);\n }\n\n nodes = next_nodes;\n }\n\n root->set_failure(root);\n state = root;\n }\n\n MatchingResult feed(const string& text){\n MatchingResult mr;\n int index = 0;\n while(index < text.length()){\n AhoCorasick::Node* trans = NULL;\n while(state != NULL){\n\ttrans = state->get_transition(text[index]);\n\tif(state == root || trans != NULL) break;\n\tstate = state->get_failure();\n }\n\n if(trans != NULL){\n\tstate = trans;\n }\n \n set<string> results;\n if(state != NULL) results = state->get_results();\n for(set<string>::iterator it = results.begin();\n\t it != results.end();\n\t it++){\n\tmr.rv[*it] = index - it->length() + 1;\n }\n index++;\n }\n mr.id = state->get_id();\n state = root;\n return mr;\n }\n};\n\nclass State{\npublic:\n int cost;\n string route;\n int x;\n int y;\n State(int _x,int _y,int _c,string _r) : cost(_c), route(_r),x(_x),y(_y){}\n bool operator<(const State& s) const{\n return cost < s.cost;\n }\n bool operator>(const State& s) const{\n return cost > s.cost;\n }\n};\n\nint main(){\n int H,W;\n while(~scanf(\"%d %d\",&H,&W)){\n if(H==0 && W==0) break;\n char stage[50][50];\n set<ll> dp[50][50];\n\n int sx = 0;\n int sy = 0;\n int gx = 0;\n int gy = 0;\n for(int y=0;y<H;y++){\n char line[51];\n scanf(\"%s\",line);\n for(int x=0;x<W;x++){\n\tstage[y][x] = line[x];\n\tif(line[x] == 'S'){\n\t sx = x;\n\t sy = y;\n\t}\n\telse if(line[x] == 'G'){\n\t gx = x;\n\t gy = y;\n\t}\n }\n }\n int total_prohibited_sequences;\n scanf(\"%d\",&total_prohibited_sequences);\n\n set<string> keywords;\n for(int sequence_idx=0;\n\tsequence_idx < total_prohibited_sequences;\n\tsequence_idx++){\n string str;\n cin >> str;\n keywords.insert(str);\n }\n\n AhoCorasick::SearchMachine* sm = new AhoCorasick::SearchMachine(keywords);\n\n priority_queue<State,vector<State>,greater<State> > que;\n que.push(State(sx,sy,0,\"\"));\n\n int res = INF;\n while(!que.empty()){\n State s = que.top();\n string route = s.route;\n int cost = s.cost;\n int sx = s.x;\n int sy = s.y;\n\n que.pop();\n\n for(int i=0;i<4;i++){\n\tint dx = sx + tx[i];\n\tint dy = sy + ty[i];\n\tif(dx < 0 || dx >= W\n\t || dy < 0 || dy >= H) continue;\n\n\tif(stage[dy][dx] == '#') continue;\n\n\tstring next = route + dir_str[i];\n\tif(next.size() > 10) next = next.substr(next.size()-10);\n\tAhoCorasick::MatchingResult mr = sm->feed(next);\n\n\tif((!mr.rv.empty())){\n\t // cout << mr.rv.begin()->first << endl;\n\t // cout << next << endl;\n\t continue;\n\t}\n\n\tif(dp[dy][dx].count(mr.id)) continue;\n\tdp[dy][dx].insert(mr.id);\n\n\tif(stage[dy][dx] == 'G'){\n\t res = cost + 1;\n\t goto found;\n\t}\n\n\tque.push(State(dx,dy,cost+1,next));\n }\n }\n\n found:;\n printf(\"%d\\n\",res == INF ? -1 : res);\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define print(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define print(x)\n#endif\n\n\n\nconst int inf=1e9;\nconst int64_t inf64=1e18;\nconst double eps=1e-9;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nusing i64=int64_t;\n\nconst int alphabet_size=256;\nclass pma{\npublic:\n pma* next[alphabet_size],*failure;\n vector<int> matches;\n string s;\n pma(){\n fill(next,next+alphabet_size,(pma*)0);\n failure=NULL;\n }\n void insert(const string &str,const int id){ insert(str,0,id); }\n void insert(const string &str,const int idx,const int id){\n s=str.substr(0,idx);\n if(idx==str.size()){\n matches.push_back(id);\n return;\n }\n if(next[str[idx]]==NULL) this->next[str[idx]]=new pma();\n next[str[idx]]->insert(str,idx+1,id);\n }\n};\n\nclass aho_corasick{\npublic:\n vector<string> dic;\n pma* root;\n aho_corasick(const vector<string>& dic_):dic(dic_),root(new pma()){\n for(int i=0; i<dic.size(); ++i) root->insert(dic[i],i);\n root->failure=root;\n queue<pma*> que;\n que.push(root);\n while(!que.empty()){\n pma* curr=que.front();\n que.pop();\n curr->matches.insert(curr->matches.end(),curr->failure->matches.begin(),curr->failure->matches.end());\n for(int i=0; i<alphabet_size; ++i){\n pma*& next=curr->next[i];\n if(next==NULL){\n next=curr==root?root:curr->failure->next[i];\n continue;\n }\n next->failure=curr==root?root:curr->failure->next[i];\n next->matches.insert(next->matches.end(),curr->matches.begin(),curr->matches.end());\n que.push(next);\n }\n }\n }\n vector<bool> match(const string& s)const{\n vector<bool> res(dic.size());\n const pma* state=root;\n for(char c:s){\n state=state->next[c];\n for(int i:state->matches) res[i]=true;\n }\n return res;\n }\n};\n\nvoid solve(int N,int M){\n vector<string> vs(N);\n int sy,sx,gy,gx;\n rep(i,0,N){\n cin >> vs[i];\n rep(j,0,M){\n if(vs[i][j]=='S'){\n sy=i;\n sx=j;\n }\n if(vs[i][j]=='G'){\n gy=i;\n gx=j;\n }\n }\n }\n\n int P;\n cin >> P;\n vector<string> ban(P);\n rep(i,0,P){\n cin >> ban[i];\n for(char& c:ban[i]){\n if(c=='R') c=0;\n if(c=='U') c=1;\n if(c=='L') c=2;\n if(c=='D') c=3;\n }\n }\n\n aho_corasick ac(ban);\n vector<int> dx={1,0,-1,0},dy={0,-1,0,1};\n queue<tuple<int,int,pma*,int>> que;\n set<tuple<int,int,pma*>> visited;\n que.push(make_tuple(sy,sx,ac.root,0));\n visited.insert(make_tuple(sy,sx,ac.root));\n while(!que.empty()){\n int y,x,d;\n pma* curr;\n tie(y,x,curr,d)=que.front();\n que.pop();\n if(y==gy and x==gx){\n cout << d << endl;\n return;\n }\n rep(i,0,4){\n int ny=y+dy[i],nx=x+dx[i];\n if(ny<0 or N<=ny or nx<0 or M<=nx or vs[ny][nx]=='#') continue;\n pma* next=curr->next[i];\n if(!next->matches.empty()) continue;\n if(visited.find(make_tuple(ny,nx,next))!=visited.end()) continue;\n que.push(make_tuple(ny,nx,next,d+1));\n visited.insert(make_tuple(ny,nx,next));\n }\n }\n cout << -1 << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n for(;;){\n int N,M;\n cin >> N >> M;\n if(!N and !M) break;\n solve(N,M);\n }\n return 0;\n}", "#include<iostream>\n#include<vector>\n#include<queue>\n#include<string>\n#include<cstring>\nusing namespace std;\n\n\nclass PMA{//Aho-Corasick\n\tint id;\n\tbool match;\n\tPMA *failure;\n\tPMA *next[256];\npublic:\n\tPMA(int id=0):id(id),match(false),failure(0){\n\t\tmemset(next,0,sizeof(next));\n\t}\n\t~PMA(){\n\t\tfor(int i=0;i<256;i++){\n\t\t\tif(next[i]&&next[i]!=this)delete next[i];\n\t\t}\n\t}\n\tint getID()const{return id;}\n\tbool matched()const{return match;}\n\tvoid build(const vector<string> &p){\n\t\tint num=0;\n\t\tfor(int i=0;i<(int)p.size();i++){\n\t\t\tconst string &s=p[i];\n\t\t\tPMA *t=this;\n\t\t\tfor(int j=0;j<(int)s.size();j++){\n\t\t\t\tif(!t->next[s[j]])t->next[s[j]]=new PMA(++num);\n\t\t\t\tt=t->next[s[j]];\n\t\t\t}\n\t\t\tt->match=true;\n\t\t}\n\t\tqueue<PMA*> q;\n\t\tfor(int i=0;i<256;i++){\n\t\t\tif(next[i]){\n\t\t\t\tq.push(next[i]);\n\t\t\t\tnext[i]->failure=this;\n\t\t\t}else next[i]=this;\n\t\t}\n\t\twhile(!q.empty()){\n\t\t\tPMA *t=q.front();q.pop();\n\t\t\tfor(int i=0;i<256;i++){\n\t\t\t\tif(t->next[i]){\n\t\t\t\t\tq.push(t->next[i]);\n\t\t\t\t\tPMA *r=t->failure->step(i);\n\t\t\t\t\tt->next[i]->failure=r;\n\t\t\t\t\tt->next[i]->match |= r->match;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tPMA *step(char c)const{\n\t\tconst PMA *t=this;\n\t\twhile(!t->next[c])t=t->failure;\n\t\treturn t->next[c];\n\t}\n};\n\nstring ch(\"DRUL\");\nint dy[]={1,0,-1,0};\nint dx[]={0,1,0,-1};\n\nint h,w;\nchar m[52][52];\nint dp[51][51][102];\n\nstruct Node{\n\tint y,x;\n\tPMA *p;\n};\nint bfs(PMA &pma){\n\tmemset(dp,-1,sizeof(dp));\n\tNode a,b;\n\tfor(int i=1;i<=h;i++)for(int j=1;j<=w;j++)if(m[i][j]=='S'){\n\t\ta.y=i;\n\t\ta.x=j;\n\t\ta.p=&pma;\n\t}\n\tqueue<Node> q;\n\tdp[a.y][a.x][a.p->getID()]=0;\n\tq.push(a);\n\twhile(!q.empty()){\n\t\ta=q.front();q.pop();\n\t\tint d=dp[a.y][a.x][a.p->getID()];\n\t\tfor(int i=0;i<4;i++){\n\t\t\tb.y=a.y+dy[i];\n\t\t\tb.x=a.x+dx[i];\n\t\t\tif(m[b.y][b.x]=='#')continue;\n\t\t\tb.p=a.p->step(ch[i]);\n\t\t\tif(b.p->matched())continue;\n\t\t\tif(m[b.y][b.x]=='G')return d+1;\n\t\t\tif(dp[b.y][b.x][b.p->getID()]==-1){\n\t\t\t\tdp[b.y][b.x][b.p->getID()] = d+1;\n\t\t\t\tq.push(b);\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\nint main(){\n\twhile(cin>>h>>w&&(h||w)){\n\t\tmemset(m,'#',sizeof(m));\n\t\tfor(int i=1;i<=h;i++)\n\t\t\tfor(int j=1;j<=w;j++)\n\t\t\t\tcin>>m[i][j];\n\t\tint n;\n\t\tcin>>n;\n\t\tvector<string> p(n);\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>p[i];\n\t\t}\n\t\tPMA pma;\n\t\tpma.build(p);\n\t\tcout<<bfs(pma)<<endl;\n\t}\n\treturn 0;\n}", "\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Map;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Main{\n\t\n\tString INPUT = \"./data/judge/201709/A2212.txt\";\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Main().run();\n\t}\n\t\n\tstatic final char[] TAG = {'D','U','L','R'};\n\tstatic final int[] R = {1, -1, 0, 0};\n\tstatic final int[] C = {0, 0, -1, 1};\n\tstatic final int INF = 0x3f3f3f3f;\n\t\n\tstatic int idx = 0;\n\t\n\tclass State{\n\t\tint i;\n\t\tint j;\n\t\tNode s;\n\t\tState(int i, int j, Node s){\n\t\t\tthis.i = i;\n\t\t\tthis.j = j;\n\t\t\tthis.s = s;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn i * 31 + j * 17 + s.id * 11;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (this == obj) return true;\n\t\t\tif (obj == null ||obj.getClass() != getClass()) return false;\n\t\t\tState o = (State) obj;\n\t\t\treturn o.i == i && o.j == j && o.s == s;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn i + \" \" + j + \" \" + s;\n\t\t}\n\t}\n\t\n\tclass Node{\n\t\tMap<Character, Node> cs = new TreeMap<Character, Node>();\n\t\tNode[] next = new Node[4];\n\t\tNode fail;\n\t\tboolean accept;\n\t\tint id;\n\t\t\n\t\tNode() {id = idx++;}\n\t\t\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn id + \" \" + accept;\n\t\t}\n\t}\n\t\n\tNode root;\n\tvoid AhoCorasick(char[][] p) {\n\t\tint n = p.length;\n\t\troot = new Node();\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tNode t = root;\n\t\t\tfor (char c : p[i]) {\n\t\t\t\tif (!t.cs.containsKey(c)) t.cs.put(c, new Node());\n\t\t\t\tt = t.cs.get(c);\n\t\t\t}\n\t\t\tt.accept = true;\n\t\t}\n\t\t\n\t\t// fail\n\t\tQueue<Node> que = new LinkedList<Node>();\n\t\tque.offer(root);\n\t\twhile (!que.isEmpty()) {\n\t\t\tNode r = que.poll();\n\t\t\tfor (Map.Entry<Character, Node> entry : r.cs.entrySet()) {\n\t\t\t\tchar c = entry.getKey();\n\t\t\t\tNode v = entry.getValue();\n\t\t\t\tque.offer(v);\n\t\t\t\tNode f = r.fail;\n\t\t\t\twhile (f != null && !f.cs.containsKey(c)) {\n\t\t\t\t\tf = f.fail;\n\t\t\t\t}\n\t\t\t\tif (f == null) {\n\t\t\t\t\tv.fail = root;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tv.fail = f.cs.get(c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t// next\n\t\tque.offer(root);\n\t\twhile (!que.isEmpty()) {\n\t\t\tNode t = que.poll();\n\t\t\touter : for (char[] cs : p) {\n\t\t\t\tNode r = t;\n\t\t\t\tfor (char c : cs) {\n\t\t\t\t\tif (r.cs.containsKey(c)) {\n\t\t\t\t\t\tr = r.cs.get(c);\n\t\t\t\t\t}\n\t\t\t\t\telse continue outer;\n\t\t\t\t}\n\t\t\t\tr.accept = true;\n\t\t\t}\n\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\tchar c = TAG[i];\n\t\t\t\tNode r = t;\n\t\t\t\twhile (r != null && !r.cs.containsKey(c)) {\n\t\t\t\t\tr = r.fail;\n\t\t\t\t}\n\t\t\t\tif (r == null) {\n\t\t\t\t\tt.next[i] = root;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tt.next[i] = r.cs.get(c);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (Node r : t.cs.values()) {\n\t\t\t\tque.offer(r);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint startR;\n\tint startC;\n\tint endR, endC;\n\t\n\tint solve(char[][] f) {\n\t\tint N = f.length;\n\t\tint M = f[0].length;\n\t\tint n = ni();\n\t\tchar[][] p = new char[n][];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tp[i] = ns().toCharArray();\n\t\t}\n\t\t\n\t\tAhoCorasick(p);\n\t\t\n\t\tState state = new State(startR, startC, root);\n\t\tQueue<State> queue = new LinkedList<>();\n\t\tSet<State> vis = new HashSet<>();\n\t\tqueue.offer(state);\n\t\tvis.add(state);\n\t\t\n\t\tint turn = 0;\n\t\tint ans = INF;\n\t\tboolean find = false;\n\t\touter: while (!queue.isEmpty() && !find) {\n\t\t\tint size = queue.size();\n\t\t\tfor (int i = 0; i < size; ++i) {\n\t\t\t\tState now = queue.poll();\n\t\t\t\tif (now.i == endR && now.j == endC) {\n\t\t\t\t\tans = turn;\n\t\t\t\t\tfind = true;\n\t\t\t\t\tbreak outer;\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\t\t\tint nx = now.i + R[j];\n\t\t\t\t\tint ny = now.j + C[j];\n\t\t\t\t\tif (nx < 0 || nx >= N || ny < 0 || ny >= M) continue;\n\t\t\t\t\tif (f[nx][ny] == '#') continue;\n\t\t\t\t\tNode next = now.s.next[j];\n\t\t\t\t\tif (next.accept) continue;\n\t\t\t\t\tState ns = new State(nx, ny, next);\n\t\t\t\t\tif (vis.contains(ns)) continue;\n\t\t\t\t\tqueue.offer(ns);\n\t\t\t\t\tvis.add(ns);\n\t\t\t\t}\n\t\t\t}\n\t\t\tturn++;\n\t\t}\n\t\treturn ans == INF ? -1 : ans;\n\t}\n\t\n\tvoid read() {\n\t\twhile (true) {\n\t\t\tint N = ni();\n\t\t\tif (N == 0) break;\n\t\t\tint M = ni();\n\t\t\tchar[][] f = new char[N][M];\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tchar[] cs = ns().toCharArray();\n\t\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\t\tf[i][j] = cs[j];\n\t\t\t\t\tif (cs[j] == 'S') {\n\t\t\t\t\t\tstartR = i;\n\t\t\t\t\t\tstartC = j;\n\t\t\t\t\t}\n\t\t\t\t\tif (cs[j] == 'G') {\n\t\t\t\t\t\tendR = i;\n\t\t\t\t\t\tendC = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tidx = 0;\n\t\t\tout.println(solve(f));\n\t\t}\n\t}\n\n\tFastScanner in;\n\tPrintWriter out;\n\t\n\tvoid run() throws IOException {\n\t\tboolean oj;\n\t\ttry {\n\t\t\toj = ! System.getProperty(\"user.dir\").equals(\"F:\\\\java_workspace\\\\leetcode\");\n\t\t} catch (Exception e) {\n\t\t\toj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\t}\n\t\t\n\t\tInputStream is = oj ? System.in : new FileInputStream(new File(INPUT));\n\t\tin = new FastScanner(is);\n\t\tout = new PrintWriter(System.out);\n\t\tlong s = System.currentTimeMillis();\n\t\tread();\n\t\tout.flush();\n\t\tif (!oj){\n\t\t\tSystem.out.println(\"[\" + (System.currentTimeMillis() - s) + \"ms]\");\n\t\t}\n\t}\n\t\n\tpublic boolean more(){\n\t\treturn in.hasNext();\n\t}\n\t\n\tpublic int ni(){\n\t\treturn in.nextInt();\n\t}\n\t\n\tpublic long nl(){\n\t\treturn in.nextLong();\n\t}\n\t\n\tpublic double nd(){\n\t\treturn in.nextDouble();\n\t}\n\t\n\tpublic String ns(){\n\t\treturn in.nextString();\n\t}\n\t\n\tpublic char nc(){\n\t\treturn in.nextChar();\n\t}\n\t\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\tboolean hasNext;\n\n\t\tpublic FastScanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t\thasNext = true;\n\t\t}\n\n\t\tpublic String nextToken() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\thasNext = false;\n\t\t\t\t\treturn \"##\";\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tString next = null;\n\t\tpublic boolean hasNext(){\n\t\t\tnext = nextToken();\n\t\t\treturn hasNext;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Integer.parseInt(more);\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Long.parseLong(more);\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Double.parseDouble(more);\n\t\t}\n\t\t\n\t\tpublic String nextString(){\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn more;\n\t\t}\n\t\t\n\t\tpublic char nextChar(){\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn more.charAt(0);\n\t\t}\n\t}\n\t\n\tstatic class ArrayUtils {\n\n\t\tpublic static void fill(int[][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tArrays.fill(f[i], value);\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void fill(int[][][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tfill(f[i], value);\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void fill(int[][][][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tfill(f[i], value);\n\t\t\t}\n\t\t}\n\t}\n}", "#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <numeric>\n#include <cstring>\n\nusing namespace std;\n\nstruct Entry {\n int x, y, state, step;\n};\n\nint dx[] = { -1, 1, 0, 0 };\nint dy[] = { 0, 0, -1, 1 };\nconst char *LABELS[] = { \"L\", \"R\", \"U\", \"D\" };\n\nclass Matcher {\n struct PMA {\n int next[256];\n vector<int> accept;\n PMA(){ fill(next, next + 256, -1); }\n };\n vector<PMA> states;\npublic:\n Matcher(const vector<string> &patterns){\n states.push_back(PMA());\n for(int i = 0; i < patterns.size(); ++i){\n int cur = 0;\n for(size_t j = 0; j < patterns[i].size(); ++j){\n char c = patterns[i][j];\n if(states[cur].next[c] < 0){\n states[cur].next[c] = static_cast<int>(states.size());\n states.push_back(PMA());\n }\n cur = states[cur].next[c];\n }\n states[cur].accept.push_back(i);\n }\n queue<int> q;\n for(int c = 1; c < 256; ++c){\n if(states[0].next[c] >= 0){\n states[states[0].next[c]].next[0] = 0;\n q.push(states[0].next[c]);\n }else{\n states[0].next[c] = 0;\n }\n }\n while(!q.empty()){\n int t = q.front();\n q.pop();\n for(int c = 1; c < 256; ++c){\n if(states[t].next[c] >= 0){\n q.push(states[t].next[c]);\n int r = states[t].next[0];\n while(states[r].next[c] < 0){ r = states[r].next[0]; }\n states[states[t].next[c]].next[0] = states[r].next[c];\n }\n }\n }\n for(int i = 0; i < patterns.size(); ++i){\n const string &pat = patterns[i];\n for(int j = 1; j < states.size(); ++j){\n int current = j, k = 0;\n for(; k < pat.size(); ++k){\n if(states[current].next[pat[k]] < 0){ break; }\n current = states[current].next[pat[k]];\n }\n if(k == pat.size()){ states[current].accept.push_back(i); }\n }\n }\n }\n int match(const string &str, vector<int> &result, int state = 0){\n for(size_t i = 0; i < str.size(); ++i){\n char c = str[i];\n while(states[state].next[c] < 0){ state = states[state].next[0]; }\n state = states[state].next[c];\n for(size_t j = 0; j < states[state].accept.size(); ++j){\n ++(result[states[state].accept[j]]);\n }\n }\n return state;\n }\n int stateNum() const { return static_cast<int>(states.size()); }\n};\n\nbool passed[52][52][101];\n\nint main(){\n while(true){\n int N, M;\n cin >> N >> M;\n if(N == 0 && M == 0){ break; }\n memset(passed, 0, sizeof(passed));\n vector<string> field(N + 2);\n field[0] = field[N + 1] = string(M + 2, '#');\n Entry start;\n int goalX = 0, goalY = 0;\n for(int i = 1; i <= N; ++i){\n string line;\n cin >> line;\n field[i] = \"#\" + line + \"#\";\n for(int j = 1; j <= M; ++j){\n if(field[i][j] == 'S'){\n start.x = j;\n start.y = i;\n start.state = 0;\n start.step = 0;\n }else if(field[i][j] == 'G'){\n goalX = j;\n goalY = i;\n }\n }\n }\n int P;\n cin >> P;\n vector<string> patterns(P);\n for(int i = 0; i < P; ++i){ cin >> patterns[i]; }\n Matcher matcher(patterns);\n queue<Entry> q;\n q.push(start);\n passed[start.y][start.x][start.state] = true;\n int answer = -1;\n vector<int> result(P);\n while(!q.empty()){\n Entry e = q.front();\n//cerr << \"> \" << e.x << \" \" << e.y << \" \" << e.state << endl;\n if(e.x == goalX && e.y == goalY){\n answer = e.step;\n break;\n }\n q.pop();\n for(int i = 0; i < 4; ++i){\n Entry next;\n next.x = e.x + dx[i];\n next.y = e.y + dy[i];\n if(field[next.y][next.x] == '#'){ continue; }\n next.step = e.step + 1;\n fill(result.begin(), result.end(), 0);\n next.state = matcher.match(LABELS[i], result, e.state);\n if(\n accumulate(result.begin(), result.end(), 0) != 0 ||\n passed[next.y][next.x][next.state]\n ){\n continue;\n }\n passed[next.y][next.x][next.state] = true;\n q.push(next);\n }\n }\n cout << answer << endl;\n }\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\n\n#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)\n#define rep(i,n) REP(i,0,n)\n#define DEB 0\n#define all(x) x.begin(), x.end()\n#define mp make_pair\n#define pb push_back\n\n\nclass state{\npublic:\n int x,y;\n vector<int> ma; // 1base\n state(int _x, int _y, vector<int> m){\n x=_x; y=_y;\n ma.swap(m);\n }\n bool operator<(const state& a)const{\n if( x!=a.x ) return x<a.x;\n if( y!=a.y ) return y<a.y;\n return ma < a.ma;\n }\n bool operator==(const state& a)const{\n return x==a.x && y==a.y && ma==a.ma;\n }\n};\n\nconst int dx[] = {0,1,0,-1}; //up, right, down, left\nconst int dy[] = {-1,0,1,0};\nint n,m,p;\nint sx,sy;\nmap<state,long long> msi;\nchar field[52][52];\nvector<string> ope;\n\nbool inside(int x, int y){\n return !(x<0 || x>=m || y>=n || y<0 || field[y][x]=='#');\n}\nint DIR(char c){\n if( c=='U' ) return 0;\n if( c=='R' ) return 1;\n if( c=='D' ) return 2;\n if( c=='L' ) return 3;\n}\nint main(){\t\n while(cin>>n>>m,n|m){\n ope.clear();\n msi.clear();\n rep(i,n){\n cin>>field[i];\n rep(j,m)if( field[i][j]=='S' ){\n\tsx = j;\n\tsy = i;\n }\n }\n cin>>p;\n rep(i,p){\n string tmp; cin>>tmp;\n ope.pb(tmp);\n }\n // •”•ª•¶Žš—ñ‚ŏo‚Ä‚­‚é‚à‚͍̂폜‚·‚é\n \n bool gao[16];\n memset(gao,true,sizeof(gao));\n rep(i,ope.size())if( gao[i] ){\n int j;\n for(j=0; j<ope.size(); j++)if( i!=j && gao[j] ){\n\tif( ope[i].find(ope[j]) != string::npos ){\n\t gao[i] = false;\n\t break;\n\t}\n }\n }\n vector<string> tmp;\n rep(i,ope.size())if( gao[i] )tmp.pb(ope[i]);\n ope.swap(tmp);\n\n queue<state> q;\n bool goal = false;\n long long ans = -1;\n q.push(state(sx,sy,vector<int>(ope.size(),0)));\n msi[state(sx,sy,vector<int>(ope.size(),0))] = 0;\n while( !q.empty() ){\n int x = q.front().x;\n int y = q.front().y;\n vector<int> ma = q.front().ma;\n long long cost = msi[q.front()];\n q.pop();\n\n rep(k,4){\n\tvector<int> hoge(ope.size(),0);\n\tint tx = x + dx[k];\n\tint ty = y + dy[k];\n\tif( !inside(tx,ty) )continue;\n\tbool ok = true;\n\trep(j,ma.size()){\n\t if( DIR(ope[j][ma[j]+1-1]) == k ){\n\t hoge[j] = ma[j]+1;\n\t if( hoge[j]==ope[j].length() ){ ok = false; break; }\n\t }else{\n\t string aaa = ope[j].substr(0,ma[j]) + string(1,k==0?'U':k==1?'R':k==2?'D':'L');\n\t int l;\n\t for(l=0; l<aaa.size(); l++){\n\t int u;\n\t for(u=0; u+l<aaa.size(); u++){\n\t\tif( aaa[l+u]!=ope[j][u] )break;\n\t }\n\t if( u+l==aaa.size() ){\n\t\tbreak;\n\t }\n\t }\n\t hoge[j] = aaa.size() - l;\n\t }\n\t}\n\tif( !ok ) continue;\n\n\tif( field[ty][tx]=='G' ){\n\t ans = cost + 1;\n\t goal = true;\n\t}\n\tstate ts(tx,ty,hoge);\n\tmap<state,long long>::iterator it = msi.lower_bound(ts);\n\tif( it!=msi.end() && it->first==ts ){\n\t if( it->second > cost+1 ){\n\t it->second = cost+1;\n\t q.push(ts);\n\t }\n\t}else{\n\t msi.insert(it,make_pair(ts,cost+1));\n\t q.push(ts);\n\t}\n }\n if( goal ) break;\n }\n printf(\"%lld\\n\",ans);\n }\n return 0;\n}", "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic int[] DR = { -1, 0, 1, 0 };\n\tstatic int[] DC = { 0, 1, 0, -1 };\n\tstatic int N, M;\n\tstatic char[][] f;\n\n\tpublic static void main(String[] args) {\n\t\twhile (true) {\n\t\t\tN = sc.nextInt();\n\t\t\tif (N == 0) break;\n\t\t\tM = sc.nextInt();\n\t\t\tf = new char[N + 2][M + 2];\n\t\t\tint startR = 0;\n\t\t\tint startC = 0;\n\t\t\tArrays.fill(f[0], '#');\n\t\t\tArrays.fill(f[N + 1], '#');\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tString row = sc.next();\n\t\t\t\tf[i + 1][0] = f[i + 1][M + 1] = '#';\n\t\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\t\tchar c = row.charAt(j);\n\t\t\t\t\tif (c == 'S') {\n\t\t\t\t\t\tstartR = i + 1;\n\t\t\t\t\t\tstartC = j + 1;\n\t\t\t\t\t\tc = '.';\n\t\t\t\t\t}\n\t\t\t\t\tf[i + 1][j + 1] = c;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(solve(startR, startC));\n\t\t}\n\t}\n\n\tstatic int solve(int startR, int startC) {\n\t\tint P = sc.nextInt();\n\t\tString[] pat = new String[P];\n\t\tfor (int i = 0; i < P; ++i) {\n\t\t\tpat[i] = sc.next();\n\t\t}\n\t\tAutomaton automaton = new Automaton(pat);\n\t\tboolean[][][] visited = new boolean[N + 2][M + 2][automaton.nodes.size()];\n\t\tState initial = new State(startR, startC, 0);\n\t\tArrayList<State> cur = new ArrayList<State>();\n\t\tcur.add(initial);\n\t\tvisited[startR][startC][0] = true;\n\t\tint turn = 1;\n\t\twhile (!cur.isEmpty()) {\n//\t\t\tSystem.err.println(\"turn:\" + turn);\n\t\t\tArrayList<State> next = new ArrayList<State>();\n\t\t\tfor (State st : cur) {\n\t\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\t\tint nr = st.r + DR[i];\n\t\t\t\t\tint nc = st.c + DC[i];\n\t\t\t\t\tif (f[nr][nc] == '#') continue;\n\t\t\t\t\tNode n = automaton.nodes.get(st.i).next[i];\n\t\t\t\t\tif (n == Automaton.terminal) continue;\n\t\t\t\t\tif (visited[nr][nc][n.idx]) continue;\n\t\t\t\t\tif (f[nr][nc] == 'G') return turn;\n\t\t\t\t\tvisited[nr][nc][n.idx] = true;\n\t\t\t\t\tnext.add(new State(nr, nc, n.idx));\n//\t\t\t\t\tSystem.err.println(\"nr:\" + nr + \" nc:\" + nc + \" idx:\" + n.idx);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcur = next;\n\t\t\t++turn;\n\t\t}\n\t\treturn -1;\n\t}\n\n\tstatic class State {\n\t\tint r, c, i;\n\n\t\tpublic State(int r, int c, int i) {\n\t\t\tthis.r = r;\n\t\t\tthis.c = c;\n\t\t\tthis.i = i;\n\t\t}\n\t}\n\n\tstatic class Automaton {\n\t\tstatic final Node terminal = new Node(0L);\n\t\tNode root = new Node(0L);\n\t\tHashMap<Long, Node> map = new HashMap<Long, Node>();\n\t\tArrayList<Node> nodes = new ArrayList<Node>();\n\t\tint[][] pattern;\n\n\t\tAutomaton(String[] patStr) {\n\t\t\tpattern = new int[patStr.length][];\n\t\t\tfor (int i = 0; i < patStr.length; ++i) {\n\t\t\t\tpattern[i] = new int[patStr[i].length()];\n\t\t\t\tfor (int j = 0; j < pattern[i].length; ++j) {\n\t\t\t\t\tswitch (patStr[i].charAt(j)) {\n\t\t\t\t\tcase 'U':\n\t\t\t\t\t\tpattern[i][j] = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'R':\n\t\t\t\t\t\tpattern[i][j] = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'D':\n\t\t\t\t\t\tpattern[i][j] = 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'L':\n\t\t\t\t\t\tpattern[i][j] = 3;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbuild(root);\n\t\t}\n\n\t\tvoid build(Node parent) {\n\t\t\tparent.idx = nodes.size();\n\t\t\tnodes.add(parent);\n\t\t\tmap.put(parent.pos, parent);\n\t\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\t\tlong nextPos = 0;\n\t\t\t\tfor (int j = 0; j < pattern.length; ++j) {\n\t\t\t\t\tint curElemPos = (int) ((parent.pos >> (j * 4)) & 0xF);\n\t\t\t\t\tlong nextElemPos;\n\t\t\t\t\tif (pattern[j][curElemPos] == i) {\n\t\t\t\t\t\tnextElemPos = curElemPos + 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnextElemPos = 0;\n\t\t\t\t\t\tfor (int k = curElemPos; k >= 0; --k) {\n\t\t\t\t\t\t\tif (pattern[j][k] != i) continue;\n\t\t\t\t\t\t\tboolean ok = true;\n\t\t\t\t\t\t\tfor (int l = 1; l <= k; ++l) {\n\t\t\t\t\t\t\t\tif (pattern[j][curElemPos - l] != pattern[j][k - l]) {\n\t\t\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (ok) {\n\t\t\t\t\t\t\t\tnextElemPos = k + 1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (nextElemPos == pattern[j].length) {\n\t\t\t\t\t\tparent.next[i] = terminal;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnextPos += nextElemPos << (j * 4);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (parent.next[i] == null) {\n\t\t\t\t\tNode child = map.get(nextPos);\n\t\t\t\t\tif (child == null) {\n\t\t\t\t\t\tchild = new Node(nextPos);\n\t\t\t\t\t\tbuild(child);\n\t\t\t\t\t}\n\t\t\t\t\tparent.next[i] = child;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Node {\n\t\tNode[] next = new Node[4];\n\t\tlong pos;\n\t\tint idx;\n\n\t\tNode(long pos) {\n\t\t\tthis.pos = pos;\n\t\t}\n\t}\n\n}", "#include<stdio.h>\n#include<string>\n#include<algorithm>\n#include<queue>\n#include<map>\nusing namespace std;\nchar str[60][60];\nchar in[60];\nint dx[]={1,0,-1,0};\nint dy[]={0,1,0,-1};\nchar dc[7]=\"DRUL\";\nint bfs[60][60][110];\nstring val[110];\nint ng[110];\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\t\tint c;scanf(\"%d\",&c);\n\t\tmap<string,int>m;\n\t\tint sz=0;\n\t\tfor(int i=0;i<110;i++)ng[i]=0;\n\t\tval[0]=\"\";\n\t\tm[string(\"\")]=sz++;\n\t\tfor(int i=0;i<c;i++){\n\t\t\tscanf(\"%s\",in);\n\t\t\tstring tmp=in;\n\t\t\tfor(int j=0;j<=tmp.size();j++){\n\t\t\t\tif(!m.count(tmp.substr(0,j))){\n\t\t\t\t\tval[sz]=tmp.substr(0,j);\n\t\t\t\t\tm[tmp.substr(0,j)]=sz++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tng[m[tmp]]=1;\n\t\t}\n\t\tfor(int i=0;i<sz;i++){\n\t\t\tstring tmp=val[i];\n\t\t\twhile(tmp.size()){\n\t\t\t\ttmp=tmp.substr(1,tmp.size()-1);\n\t\t\t\tif(m.count(tmp)&&ng[m[tmp]]){ng[i]=1;break;}\n\t\t\t}\n\t\t}\n\t\tint sr,sc,gr,gc;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\t\tif(str[i][j]=='S'){sr=i;sc=j;}\n\t\t\tif(str[i][j]=='G'){gr=i;gc=j;}\n\t\t}\n\t\tqueue<pair<pair<int,int>,int> >Q;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)for(int k=0;k<sz;k++){\n\t\t\tbfs[i][j][k]=99999999;\n\t\t}\n\t\tbfs[sr][sc][0]=0;\n\t\tQ.push(make_pair(make_pair(sr,sc),0));\n\t\twhile(Q.size()){\n\t\t\tint row=Q.front().first.first;\n\t\t\tint col=Q.front().first.second;\n\t\t\tint at=Q.front().second;\n\t\t\tstring now=val[at];\n\t\t\tQ.pop();\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tif(0<=row+dx[i]&&row+dx[i]<a&&0<=col+dy[i]&&col+dy[i]<b&&str[row+dx[i]][col+dy[i]]!='#'){\n\t\t\t\t\tstring to=now+dc[i];\n\t\t\t\t\twhile(!m.count(to)){\n\t\t\t\t\t\tto=to.substr(1,to.size()-1);\n\t\t\t\t\t}\n\t\t\t\t\tint tt=m[to];\n\t\t\t\t\tif(!ng[tt]&&bfs[row+dx[i]][col+dy[i]][tt]>999999){\n\t\t\t\t\t\tbfs[row+dx[i]][col+dy[i]][tt]=bfs[row][col][at]+1;\n\t\t\t\t\t\tQ.push(make_pair(make_pair(row+dx[i],col+dy[i]),tt));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ret=999999999;\n\t\tfor(int i=0;i<sz;i++)ret=min(ret,bfs[gr][gc][i]);\n\t\tif(ret>9999999)printf(\"-1\\n\");\n\t\telse printf(\"%d\\n\",ret);\n\t}\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int vy[] = {0, 1, 0, -1}, vx[] = {1, 0, -1, 0};\nconst string temp = \"RDLU\";\n\nconst int mask = (1 << 18) - 1;\n\nint H, W, P, sx, sy;\nstring S[50], V[10];\n\nint solve()\n{\n\n queue< tuple< int, int, int, int > > que;\n int min_cost[50][50][10][10];\n memset(min_cost, -1, sizeof(min_cost));\n que.emplace(sx, sy, 0, 0);\n min_cost[sx][sy][0][0] = 0;\n\n while(!que.empty()) {\n int x, y, a, b;\n tie(x, y, a, b) = que.front();\n que.pop();\n string pat = V[a].substr(0, b);\n bool f = true;\n for(int i = 0; i < P; i++) f &= pat.find(V[i]) == string::npos;\n if(!f) continue;\n if(S[y][x] == 'G') return (min_cost[x][y][a][b]);\n for(int i = 0; i < 4; i++) {\n int nx = x + vx[i], ny = y + vy[i];\n if(nx < 0 || ny < 0 || nx >= W || ny >= H) continue;\n if(S[ny][nx] == '#') continue;\n string nextpat = pat + string(1, temp[i]);\n bool match = false;\n for(int j = 0; j < nextpat.size(); j++) {\n string st = nextpat.substr(j);\n for(int k = 0; k < P; k++) {\n if(V[k].find(st) == 0) {\n if(min_cost[nx][ny][k][st.size()] == -1) {\n que.emplace(nx, ny, k, st.size());\n min_cost[nx][ny][k][st.size()] = min_cost[x][y][a][b] + 1;\n }\n match = true;\n break;\n }\n }\n if(match) break;\n }\n if(!match && min_cost[nx][ny][0][0] == -1) {\n que.emplace(nx, ny, 0, 0);\n min_cost[nx][ny][0][0] = min_cost[x][y][a][b] + 1;\n }\n }\n }\n return (-1);\n}\n\nint main()\n{\n\n while(cin >> H >> W, H) {\n for(int i = 0; i < H; i++) {\n cin >> S[i];\n for(int j = 0; j < W; j++) {\n if(S[i][j] == 'S') sx = j, sy = i;\n }\n }\n cin >> P;\n for(int i = 0; i < P; i++) {\n cin >> V[i];\n }\n cout << solve() << endl;\n }\n}", "#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\n#define pr1(a) (#a)<<\"=\"<<(a)<<\" \"\n#define pr2(a,b) pr1(a)<<pr1(b)\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\n#define prArr(a) {cerr<<(#a)<<\"={\";int i=0;for(auto t:(a))cerr<<(i++?\", \":\"\")<<t;cerr<<\"}\"<<endl;}\nusing namespace std;\nusing Int = long long;\nusing _int = int;\nusing ll = long long;\nusing Double = long double;\nconst Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18\nconst Int mod = (1e9)+7;\nconst Double EPS = 1e-8;\nconst Double PI = 6.0 * asin((Double)0.5);\nusing P = pair<Int,Int>;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\n return o<<\"(\"<<get<0>(t)<<\",\"<<get<1>(t)<<\",\"<<get<2>(t)<<\")\";}\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?\" \":\"\")<<t;return o;}\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\n\n/* Aho Corasick */\n \n\ntemplate <int X /*文字の種類*/ >\nclass AhoCorasick{\npublic:\n struct Node{\n char c; //頂点の文字\n int pre; //親の頂点番号\n int val; //重み\n int exist; //単語が存在するか\n int dep; //ノードの深さ\n int failEdge; //パターンマッチに失敗した時に戻るノード\n vector<int> bto; //to[i] != -1? (to[i]):(posからtoへのパターンマッチに失敗した時に戻るノード)\n vector<int> to; //次の頂点番号\n Node(){};\n Node(char c,int pre,int val = 0,int exist = 0):\n c(c),pre(pre),val(val),exist(exist), to(X,-1){};\n };\n \n vector<Node> v; //ノード\n function<int(char)> toI; //文字から数字に変換する関数\n int ok;\n \n AhoCorasick(function<int(char)> toI=[](char ch){return ch-'A';} ,char c = '$'/*根に用いる文字*/)\n :toI(toI),ok(false){v.push_back(Node(c, -1, 0/*!!!!!*/));}\n\n int size(){return v.size();}\n Node operator [](int i)const {return v[i];}\n \n inline void check(int pos){assert(0 <= pos && pos<size());}\n inline int go(int pos,char c, int flag = 0){check(pos);return flag == 0? v[pos].to[toI(c)]:v[pos].bto[toI(c)];}\n inline int go(const string &s,int pos = 0){\n for(char c:s){\n pos = go(pos,c);\n if(pos == -1) return -1;\n }\n return pos;\n }\n \n inline int back(int pos){check(pos);return v[pos].pre;}\n inline int getVal(int pos){check(pos);return v[pos].val;}\n inline int exist(int pos){check(pos);return v[pos].exist;}\n inline int failEdge(int pos){check(pos);assert(ok);return v[pos].failEdge;}\n inline int failEdge(int pos,char to){check(pos);assert(ok);return v[pos].bto[toI(to)];}\n inline int depth(int pos){check(pos);assert(ok);return v[pos].dep;}\n \n inline void addWord(const string &s,int val = 1){\n ok = false;\n int pos = 0, dep = 0;\n for(char c:s){\n v[pos].dep = dep++;\n if(go(pos,c) != -1){pos = go(pos,c);continue;}\n v.push_back(Node(c,pos));\n pos = v[pos].to[toI(c)] = v.size()-1;\n }\n v[pos].dep = dep;\n v[pos].exist = 1;\n v[pos].val = max(v[pos].val, val); //min,max,+ 臨機応変に変えて\n }\n\n void build(){\n ok = 1;\n buildBackEdge();\n nextMatch.resize(size());\n for(int i=1;i<size();i++) nextMatch[i] = failEdge(i);\n nextMatch[0] = -1;\n }\n \n vector<int> nextMatch; //to[i] := ノードiを含めないノードiからみて最も単語長が長くなるノード\n //posから見て単語長が最も長くなるようなノードを返す。(pos自体が単語の場合はposを返す)\n int suffixMatch(int pos){\n if(pos == -1) return -1;\n if(exist(pos)) return pos;\n return nextMatch[pos] = suffixMatch(nextMatch[pos]);\n }\n \n //res[i]にはs[i]からmatchする単語の長さが入っている。\n vector<vector<int> > matchedIdx(const string &s){\n assert(exist(0) == 0); //空文字列が単語として存在する場合、たぶん壊れるので直す必要がある。\n assert(ok);\n int n = s.size();\n vector<vector<int> > res(n);\n \n for(int i=0, pos=0;i<n;i++){\n char ch = s[i];\n pos = go(pos, ch, true);\n int p = suffixMatch(pos);\n while(p != -1 && exist(p)){\n\tres[ i - depth(p) + 1].push_back(depth(p));\n\tp = suffixMatch(nextMatch[p]);\n }\n }\n return res;\n }\n \nprivate:\n void buildBackEdge(){\n const int root = 0;\n queue<int> Q;\n Q.push(root);\n v[root].failEdge = root;\n for(int i=0;i<size();i++) v[i].bto = v[i].to;\n for(int i=0;i<X;i++) if(v[root].bto[i] == -1) v[root].bto[i] = root;\n \n while(!Q.empty()){\n int pos = Q.front(); Q.pop();\n \n for(int i=0;i<X;i++){\n\tint to = v[pos].to[i];\n\tif(to == -1) continue;\n\tQ.push(to);\n\tv[to].failEdge = (pos == root)? root:v[ v[pos].failEdge ].bto[i];\n\tfor(int i=0;i<X;i++) if(v[to].bto[i] == -1) v[to].bto[i] = v[ v[to].failEdge ].bto[i];\n }\n }\n }\n};\n\n\nvoid check(){\n AhoCorasick <26> aho([](char ch){return ch - 'a';});\n aho.addWord(\"abcde\");\n aho.addWord(\"bc\");\n aho.addWord(\"bab\");\n aho.addWord(\"d\");\n aho.addWord(\"ab\");\n aho.build();\n pr(aho.ok);\n for(int i=0;i<aho.size();i++){\n pr(i, aho[i].c, aho[i].failEdge);\n }\n\n string s = \"abcdefgabab\";\n auto Idx = aho.matchedIdx(s);\n for(int i=0;i<(int)s.size();i++) pr(i, s[i], Idx[i]);\n \n}\n\nvoid AOJ_2863(){\n int n;\n cin>>n;\n AhoCorasick <26> aho([](char ch){return ch - 'a';});\n for(int i=0;i<n;i++){\n string s;\n cin>>s;\n aho.addWord(s);\n }\n aho.build();\n string t;\n cin>>t; \n auto Idx = aho.matchedIdx(t);\n int len = t.size();\n vector<int> dp(len+1, 0);\n dp[0] = 1;\n const int mod = 1e9 + 7;\n for(int i=0;i<len;i++){\n for(int l:Idx[i]){\n dp[i+l] = (dp[i+l] + dp[i])%mod;\n }\n }\n int ans = dp[len];\n cout<<ans<<endl;\n}\n\n\nvoid AOJ_2212(){\n while(1){\n int h,w;\n cin>>h>>w;\n if(h == 0 && w == 0) return;\n vector<string> mp(h);\n for(int i=0;i<h;i++) cin>>mp[i];\n\n auto func = [](char ch){\n if(ch == 'U') return 0;\n if(ch == 'R') return 1;\n if(ch == 'D') return 2;\n if(ch == 'L') return 3;\n return -1;\n };\n \n AhoCorasick <4> aho(func);\n \n int m;\n cin>>m;\n for(int i=0;i<m;i++){\n string s;\n cin>>s;\n aho.addWord(s);\n }\n aho.build();\n int sy, sx;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++) if(mp[i][j] == 'S') sy = i, sx = j;\n\n auto bfs = [&]()->int{\n typedef tuple<int,int,int,string> T;\n queue<T> Q;\n Q.push(T(sy, sx, 0, \"\"));\n vector<vector<vector<int> > > D(h, vector<vector<int> > (w, vector<int>(aho.size(),-1)));\n D[sy][sx][0] = 0;\n \n string str = \"URDL\";\n int dy[] = {-1, 0, 1, 0};\n int dx[] = {0, 1, 0, -1};\n while(!Q.empty()){\n\tint y, x, pos;\n\tstring his;\n\ttie(y, x, pos, his) = Q.front(); Q.pop();\n\tint cost = D[y][x][pos];\n\tif(aho.suffixMatch(pos) != -1) continue;\n\tif(mp[y][x] == 'G') return cost;\n\n\n\tfor(int i=0;i<4;i++){\n\t int ny = y + dy[i];\n\t int nx = x + dx[i];\n\t char dir = str[i];\n\t if(ny < 0 || nx < 0 || ny >= h || nx >= w || mp[ny][nx] == '#') continue;\n\t int to = aho.go(pos, dir);\n\t if(to == -1) to = aho.failEdge(pos, dir);\n\t if(D[ny][nx][to] != -1) continue;\n\t D[ny][nx][to] = cost+1;\n\t Q.push(T(ny, nx, to, his + dir));\n\t}\n }\n return -1;\n };\n\n int ans = bfs();\n cout<<ans<<endl;\n }\n}\n\n\nsigned main(){\n //check();\n AOJ_2212();\n //AOJ_2863();\n return 0;\n}\n\n", "#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <queue>\n#include <set>\n#include <map>\n#include <cmath>\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<P, int> P2;\n#define rep(i, n) for (int i=0; i<(n); i++)\n#define all(c) (c).begin(), (c).end()\n#define uniq(c) c.erase(unique(all(c)), (c).end())\n#define _1 first\n#define _2 second\n#define pb push_back\n#define INF 1145141919\n#define MOD 1000000007\nint DX[4] = {-1, 0, 1, 0};\nint DY[4] = {0, -1, 0, 1};\nstring DS = \"lurd\";\n\nclass Trie {\npublic:\n vector<vector<int> > V;\n vector<vector<int> > par;\n\n Trie() {\n V.pb(vector<int>(26+1));\n par.pb(vector<int>(26+1, 0));\n }\n\n int find(string s) {\n int cur = 0;\n for (char ch : s) {\n int c = ch - 'a';\n cur = V[cur][c+1];\n if (cur == 0) return -1;\n }\n return cur;\n }\n\n void insert(string s) {\n int cur = 0;\n for (char ch : s) {\n int c = ch - 'a';\n if (V[cur][c+1] == 0) {\n V[cur][c+1] = V.size();\n V.pb(vector<int>(26+1));\n par.pb(vector<int>(26+1, -1));\n }\n cur = V[cur][c+1];\n }\n }\n\n int back(int s, int c) {\n if (par[s][c] != -1) return par[s][c];\n if (V[s][c+1] != 0) return s;\n return par[s][c] = back(V[s][0], c);\n }\n};\n\nclass ACMatch {\npublic:\n Trie t;\n vector<int> acc;\n vector<P> flow[26];\n vector<string> S;\n\n void add_str(string s) {\n t.insert(s);\n S.pb(s);\n }\n\n void build() {\n acc.resize(t.V.size(), 0);\n for (string s : S) acc[t.find(s)]++;\n queue<int> q;\n rep(i, 26) {\n if (!t.V[0][i+1]) continue;\n t.V[t.V[0][i+1]][0] = 0;\n q.push(t.V[0][i+1]);\n }\n\n while (!q.empty()) {\n int k = q.front(); q.pop();\n rep(i, 26) {\n if (!t.V[k][i+1]) continue;\n q.push(t.V[k][i+1]);\n int pre = t.V[k][0];\n while (pre && t.V[pre][i+1]==0) pre = t.V[pre][0];\n t.V[t.V[k][i+1]][0] = t.V[pre][i+1];\n acc[t.V[k][i+1]] += acc[t.V[pre][i+1]];\n }\n }\n rep(c, 26) {\n rep(s, acc.size()) {\n int ns = t.back(s, c);\n ns = t.V[ns][c+1];\n flow[c].pb(P(ns, acc[ns]));\n }\n }\n }\n\n P move(int s, int c) {\n return flow[c][s];\n }\n\n int match(string S) {\n int sum = 0, cur = 0;\n for (char ch : S) {\n int c = ch - 'a';\n while (cur && t.V[cur][c+1]==0) cur = t.V[cur][0];\n cur = t.V[cur][c+1];\n sum += acc[cur];\n }\n return sum;\n }\n};\n\nint W, H, N;\nint SX, SY, GX, GY;\nchar A[50][50];\nint dp[50][50][100];\n\nsigned main() {\n ios::sync_with_stdio(false); cin.tie(0);\n while (cin >> H >> W) {\n if (H == 0 && W == 0) break;\n rep(y, H) {\n rep(x, W) {\n char c;\n cin >> c;\n if (c == 'S') SX = x, SY = y;\n if (c == 'G') GX = x, GY = y;\n A[x][y] = c == '#';\n }\n }\n ACMatch acm;\n cin >> N;\n rep(i, N) {\n string s;\n cin >> s;\n for (char &c : s) {\n if (c == 'L') c = 'l';\n else if (c == 'U') c = 'u';\n else if (c == 'R') c = 'r';\n else if (c == 'D') c = 'd';\n }\n acm.add_str(s);\n }\n acm.build();\n int L = acm.acc.size();\n rep(x, W) {\n rep(y, H) {\n rep(s, L) {\n dp[x][y][s] = INF;\n }\n }\n }\n\n queue<P2> q;\n q.push(P2(P(SX, SY), 0));\n dp[SX][SY][0] = 0;\n\n while (!q.empty()) {\n int x = q.front()._1._1,\n y = q.front()._1._2,\n s = q.front()._2;\n q.pop();\n rep(k, 4) {\n int nx = x+DX[k], ny = y+DY[k];\n if (nx<0||nx>=W||ny<0||ny>=H) continue;\n if (A[nx][ny]) continue;\n P p = acm.move(s, DS[k]-'a');\n if (p._2 > 0) continue;\n int ns = p._1;\n if (dp[nx][ny][ns] > dp[x][y][s]+1) {\n dp[nx][ny][ns] = dp[x][y][s]+1;\n q.push(P2(P(nx, ny), ns));\n }\n }\n }\n int m = *min_element(dp[GX][GY], dp[GX][GY]+L);\n if (m == INF) m = -1;\n cout << m << \"\\n\";\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define print(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define print(x)\n#endif\n\n\n\nconst int inf=1e9;\nconst int64_t inf64=1e18;\nconst double eps=1e-9;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nusing i64=int64_t;\n\nconst int alphabet_size=4;\nchar table[4]={'R','U','L','D'};\nclass pma{\npublic:\n pma* next[alphabet_size],*failure;\n vector<int> matches;\n string s;\n pma(){\n fill(next,next+alphabet_size,(pma*)0);\n failure=NULL;\n }\n void insert(const string &str,const int id){ insert(str,0,id); }\n void insert(const string &str,const int idx,const int id){\n s=str.substr(0,idx);\n if(idx==str.size()){\n matches.push_back(id);\n return;\n }\n if(next[str[idx]]==NULL) this->next[str[idx]]=new pma();\n next[str[idx]]->insert(str,idx+1,id);\n }\n};\n\n//ofstream ofs(\"graph.dot\");\n\nstring convert(string s){\n string res;\n //for(char c:s) res+=table[c];\n return res;\n}\n\nvoid add_edge(pma* from,pma*to,string label){\n /*\n ofs << \" \\\"\";\n ofs << convert(from->s);\n ofs << \"\\\" -> \\\"\";\n ofs << convert(to->s);\n ofs << \"\\\" [label = \\\"\" << label << \"\\\"];\" << endl;\n */\n}\n\nclass aho_corasick{\npublic:\n vector<string> dic;\n pma* root;\n aho_corasick(const vector<string>& dic_):dic(dic_),root(new pma()){\n for(int i=0; i<dic.size(); ++i) root->insert(dic[i],i);\n root->failure=root;\n queue<pma*> que;\n que.push(root);\n add_edge(root,root,\"failure\");\n while(!que.empty()){\n pma* curr=que.front();\n que.pop();\n vector<bool> original_link(alphabet_size,true);\n curr->matches.insert(curr->matches.end(),curr->failure->matches.begin(),curr->failure->matches.end());\n for(int i=0; i<alphabet_size; ++i){\n pma*& next=curr->next[i];\n if(next==NULL){\n if(curr==root) next=root;\n else next=curr->failure->next[i];\n //curr->matches.insert(curr->matches.end(),next->matches.begin(),next->matches.end());\n original_link[i]=false;\n add_edge(curr,curr->next[i],string(1,table[i]));\n continue;\n }\n }\n for(int i=0; i<alphabet_size; ++i){\n if(!original_link[i]) continue;\n pma*& next=curr->next[i];\n if(curr==root) next->failure=root;\n else next->failure=curr->failure->next[i];\n next->matches.insert(next->matches.end(),curr->matches.begin(),curr->matches.end());\n que.push(next);\n add_edge(curr,next,string(1,table[i]));\n add_edge(next,next->failure,\"failure\");\n }\n }\n }\n vector<bool> match(const string& s)const{\n vector<bool> res(dic.size());\n const pma* state=root;\n for(char c:s){\n state=state->next[c];\n for(int i:state->matches) res[i]=true;\n }\n return res;\n }\n};\n\nvoid solve(int N,int M){\n vector<string> vs(N);\n int sy,sx,gy,gx;\n rep(i,0,N){\n cin >> vs[i];\n rep(j,0,M){\n if(vs[i][j]=='S'){\n sy=i;\n sx=j;\n }\n if(vs[i][j]=='G'){\n gy=i;\n gx=j;\n }\n }\n }\n\n int P;\n cin >> P;\n vector<string> ban(P);\n rep(i,0,P){\n cin >> ban[i];\n for(char& c:ban[i]){\n if(c=='R') c=0;\n if(c=='U') c=1;\n if(c=='L') c=2;\n if(c=='D') c=3;\n }\n }\n\n aho_corasick ac(ban);\n vector<int> dx={1,0,-1,0},dy={0,-1,0,1};\n queue<tuple<int,int,pma*,int>> que;\n set<tuple<int,int,pma*>> visited;\n que.push(make_tuple(sy,sx,ac.root,0));\n visited.insert(make_tuple(sy,sx,ac.root));\n \n while(!que.empty()){\n int y,x,d;\n pma* curr;\n tie(y,x,curr,d)=que.front();\n que.pop();\n if(y==gy and x==gx){\n cout << d << endl;\n return;\n }\n rep(i,0,4){\n int ny=y+dy[i],nx=x+dx[i];\n if(ny<0 or N<=ny or nx<0 or M<=nx or vs[ny][nx]=='#') continue;\n pma* next=curr->next[i];\n if(!next->matches.empty()){\n //print(convert(curr->s));\n //print(convert(next->s));\n continue;\n }\n if(visited.find(make_tuple(ny,nx,next))!=visited.end()) continue;\n que.push(make_tuple(ny,nx,next,d+1));\n visited.insert(make_tuple(ny,nx,next));\n }\n }\n cout << -1 << endl;\n /*\n function<int(int,int,pma*)> rec=[&](int y,int x,pma* state){\n if(memo[y][x].find(state)!=memo[y][x].end()) return memo[y][x][state];\n if(y==gy and x==gx) return memo[y][x][state]=0;\n memo[y][x][state]=inf;\n for(char c:state->s) cerr << int(c);\n cerr << endl;\n rep(i,0,4){\n int ny=y+dy[i],nx=x+dx[i];\n if(ny<0 or N<=ny or nx<0 or M<=nx or vs[ny][nx]=='#') continue;\n pma* next_state=state->next[i];\n if(!next_state->ids.empty()){\n cerr << \"BAN\" << endl;\n for(char c:next_state->s) cerr << int(c);\n cerr << endl;\n continue;\n }\n memo[y][x][state]=min(memo[y][x][state],rec(ny,nx,next_state)+1);\n }\n return memo[y][x][state];\n };\n\n int ans=rec(sy,sx,ac.root);\n if(ans==inf) ans=-1;\n cout << ans << endl;\n */\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n //ofs << \"digraph G {\" << endl << \" graph [layout = dot];\" << endl << \" node [shape = \\\"ellipse\\\"];\" << endl;\n for(;;){\n int N,M;\n cin >> N >> M;\n if(!N and !M) break;\n solve(N,M);\n }\n //ofs << \"}\" << endl;\n return 0;\n}", "#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <queue>\n#include <set>\n#include <map>\n#include <valarray>\n#include <bitset>\n#include <stack>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\n\n#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\nusing namespace std;\n\n// Aho-Corasick\n// UVa 10679\n// ‚Æ‚è‚ ‚¦‚¸ MM > 128‚É‚µ‚Ä‚¨‚¯‚ÎASCII‚Í“ü‚é\n// Trie‚ÅŽÀ‘•‚µ‚Ä‚¢‚é‚̂ŁAƒƒ‚ƒŠŒø—¦‚͈«‚¢\nconst int MM = 150;\n\nstruct Node {\n int id;\n int next[MM];\n int fail;\n vector<int> value;\n Node() {\n for(int i=0; i<MM; ++i) next[i] = 0;\n value.clear();\n }\n};\n\nclass Trie {\npublic:\n Trie(const vector<string> &vs) {\n nodes.push_back(new Node()); // dummy\n nodes.push_back(new Node());\n for(int i=0; i<vs.size(); ++i)\n insert(vs[i],i);\n }\n Trie() {\n nodes.clear();\n }\n\n void insert(const string &s,int k) {\n Node *cur = nodes[1];\n for(int i=0; i<s.length(); ++i) {\n if(cur->next[s[i]] == 0) {\n cur->next[s[i]] = nodes.size();\n nodes.push_back(new Node());\n }\n cur = nodes[cur->next[s[i]]];\n }\n cur->value.push_back(k);\n }\n vector<Node*> nodes;\n};\n\nclass Aho_Corasick {\npublic:\n Aho_Corasick(const vector<string> &vs) {\n nodes = Trie(vs).nodes;\n make_failure_link();\n }\n\n void make_failure_link() {\n //const vector<Node*> &nodes = _trie.nodes;\n queue<int> q;\n Node *root = nodes[1];\n for(int i=0; i<MM; ++i) {\n if(root->next[i]) {\n nodes[root->next[i]]->fail = 1;\n q.push(root->next[i]);\n }else root->next[i] = 1;\n }\n\n while(!q.empty()) {\n Node *t = nodes[q.front()]; q.pop();\n for(int i=0; i<MM; ++i) {\n int u = t->next[i];\n if(u) {\n q.push(u);\n int r = t->fail;\n while(!nodes[r]->next[i]) r = nodes[r]->fail;\n nodes[u]->fail = nodes[r]->next[i];\n FOR(it, nodes[nodes[u]->fail]->value) {\n nodes[u]->value.push_back(*it);\n }\n }\n }\n }\n }\n\n int match(const string &s) {\n int ret = 0;\n int v = 1;\n for(int i=0; i<s.length(); ++i) {\n while(!nodes[v]->next[s[i]]) {\n v = nodes[v]->fail;\n }\n v = nodes[v]->next[s[i]];\n if(!(nodes[v]->value.empty())) { // found the word\n ret += nodes[v]->value.size();\n }\n }\n return ret;\n }\n\n int next(int v, char c) {\n while(!nodes[v]->next[c]) {\n v = nodes[v]->fail;\n }\n v = nodes[v]->next[c];\n if(!(nodes[v]->value.empty())) { // found the word\n return -1;\n }\n return v;\n }\n \n void free() {\n for(int i=0; i<nodes.size(); ++i)\n delete nodes[i];\n }\n vector<Node*> nodes;\n};\n\nchar ba[50][50];\nint dx[4] = {0,1,0,-1};\nint dy[4] = {-1,0,1,0};\nchar dir[4] = {'U','R','D','L'};\n\nstruct P {\n int y, x, v;\n P(int y, int x, int v) : y(y),x(x),v(v) {}\n};\nint dis[50][50][102];\nint main() {\n int h, w;\n while(cin >> h >> w, h||w) {\n int sy,sx;\n REP(i, h) {\n REP(j, w) {\n cin >> ba[i][j];\n if (ba[i][j] == 'S') sy=i,sx=j;\n }\n }\n int m;\n cin >> m;\n vector<string> vs(m);\n REP(i, m) cin >> vs[i];\n Aho_Corasick pma(vs);\n queue<P> Q;\n Q.push(P(sy,sx,1));\n memset(dis,-1,sizeof(dis));\n dis[sy][sx][1] = 0;\n int ans = -1;\n while(!Q.empty()) {\n P p = Q.front(); Q.pop();\n // cout << string(dis[p.y][p.x][p.v], ' ');\n // cout << p.x << \" \" << p.y << \" \" << p.v << endl;\n if (ba[p.y][p.x] == 'G') {\n ans = dis[p.y][p.x][p.v];\n break;\n }\n REP(k, 4) {\n int yy = p.y+dy[k];\n int xx = p.x+dx[k];\n if (yy<0||yy>=h||xx<0||xx>=w) continue;\n if (ba[yy][xx] == '#') continue;\n int vv = pma.next(p.v, dir[k]);\n //cout << xx << \":\" << yy << \":\" << vv << endl;\n //cout << dis[yy][xx][vv] << endl;\n if (vv != -1 && dis[yy][xx][vv] == -1) {\n dis[yy][xx][vv] = dis[p.y][p.x][p.v]+1;\n Q.push(P(yy,xx,vv));\n }\n } \n }\n cout << ans << endl;\n }\n}\n ", "#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<queue>\nusing namespace std;\ntypedef pair<int, int> P;\nint n, m, p, K, ans;\nconst char UDLR[4] = {'U', 'D', 'L', 'R'};\nconst int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};\nchar map[52][52], tmp[15];\nstring patterns[15];\nvector<string> pfx;\nint next_state[150][4], map_state[52][52][150]; \nbool ng[150];\nqueue< P > que;\n\n\nbool check(int x, int y){\n return x>=0&&x<n&&y>=0&&y<m&&map[x][y]!='#';\n}\n\n\nvoid bfs(){\n memset(map_state, 255, sizeof(map_state));\n int sx, sy, ex, ey;\n for(int i=0; i<n; i++)\n for(int j=0; j<m; j++)\n switch (map[i][j]){\n case 'S':\n sx = i;\n sy = j;\n break;\n case 'G':\n ex = i;\n ey = j;\n break; \n default:\n break;\n }\n\n while(!que.empty()) que.pop();\n map_state[sx][sy][0] = 0;\n que.push(P(sx*m+sy, 0));\n\n bool reach=false;\n int tx, ty, tk, xx, yy, kk;\n ans = -1;\n while(!que.empty()){\n tx = que.front().first / m; ty = que.front().first % m; tk = que.front().second; \n que.pop();\n for(int i=0; i<4; i++){\n kk = next_state[tk][i];\n if(!ng[kk] && check(tx+dx[i], ty+dy[i])){\n // state kk is not forbidden\n xx = tx + dx[i];\n yy = ty + dy[i];\n if(map_state[xx][yy][kk] == -1){\n map_state[xx][yy][kk] = map_state[tx][ty][tk] + 1;\n que.push(P(xx*m+yy, kk));\n if(xx==ex && yy==ey){\n reach = true;\n ans = map_state[xx][yy][kk];\n break;\n }\n }\n } \n }\n if(reach) break;\n }\n printf(\"%d\\n\", ans);\n}\n\n\nint main(){\n //freopen(\"in.txt\", \"r\", stdin);\n int k;\n while(scanf(\"%d %d\", &n, &m), n!=0 && m!=0){\n for(int i=0; i<n; i++)\n scanf(\"%s\", map[i]);\n scanf(\"%d\", &p);\n pfx.clear();\n for(int i=0; i<p; i++){\n scanf(\"%s\", tmp);\n patterns[i].assign(tmp);\n for(int j=0; j<=patterns[i].length(); j++)\n pfx.push_back(patterns[i].substr(0, j));\n }\n pfx.push_back(string(\"\"));\n sort(pfx.begin(), pfx.end());\n pfx.erase(unique(pfx.begin(), pfx.end()), pfx.end());\n K = pfx.size();\n\n for(int i=0; i<K; i++){\n ng[i] = false;\n for(int j=0; j<p; j++){\n ng[i] |= patterns[j].length()<=pfx[i].length() \n && pfx[i].substr(pfx[i].length()-patterns[j].length(), patterns[j].length()) == patterns[j];\n }\n for(int j=0; j<4; j++){\n string s = pfx[i] + UDLR[j];\n for(;;){\n k = lower_bound(pfx.begin(), pfx.end(), s) - pfx.begin();\n if(k<K && pfx[k]==s) break;\n s = s.substr(1);\n }\n next_state[i][j] = k;\n }\n }\n\n bfs();\n }\n return 0;\n}\n", "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\ntemplate <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }\n#endif\n\n#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define popcount __builtin_popcount\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntemplate <class T> void max_swap(T& a, const T& b) { a = max(a, b); }\ntemplate <class T> void min_swap(T& a, const T& b) { a = min(a, b); }\n\ntypedef long long ll;\ntypedef pair<int, int> pint;\n\nconst double PI = acos(-1.0);\nconst int dx[] = { 0, 1, 0, -1 };\nconst int dy[] = { 1, 0, -1, 0 };\n\n\nvector<int> build_pma(const vector<int>& pat)\n{\n\tvector<int> res(pat.size() + 1);\n\tres[0] = -1;\n\tfor (int i = 0, j = -1; i < pat.size(); ++i)\n\t{\n\t\twhile (j >= 0 && pat[i] != pat[j])\n\t\t\tj = res[j];\n\t\tres[i + 1] = ++j;\n\t}\n\treturn res;\n}\nll encode(const vector<int>& states)\n{\n\tll res = 0;\n\tfor (int i = states.size() - 1; i >= 0; --i)\n\t\tres = res << 4 | states[i];\n\treturn res;\n}\nvoid decode(ll e, vector<int>& res)\n{\n\tfor (int i = 0; i < res.size(); ++i, e >>= 4)\n\t\tres[i] = e & 0xf;\n}\nll next_states(const vector<vector<int> >& pat, const vector<vector<int> >& pma, ll states, int dir)\n{\n\tll res = 0;\n\tvector<int> cur(pat.size()), next;\n\tdecode(states, cur);\n\tfor (int i = 0; i < cur.size(); ++i)\n\t{\n\t\twhile (cur[i] >= 0 && pat[i][cur[i]] != dir)\n\t\t\tcur[i] = pma[i][cur[i]];\n\t\tif (++cur[i] == pat[i].size())\n\t\t\treturn -1;\n\t\tnext.push_back(cur[i]);\n\t}\n\treturn encode(next);\n}\nstruct Node\n{\n\tint x, y;\n\tll states;\n\tNode(int x, int y, ll s)\n\t\t: x(x), y(y), states(s) {}\n};\nint main()\n{\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m)\n\t{\n\t\tstring maze[64], pp[16];\n\t\trep (i, n)\n\t\t\tcin >> maze[i];\n\t\tcin >> p;\n\t\trep (i, p)\n\t\t\tcin >> pp[i];\n\n\t\tint sx, sy, gx, gy;\n\t\trep (y, n)\n\t\t{\n\t\t\trep (x, m)\n\t\t\t{\n\t\t\t\tif (maze[y][x] == 'S')\n\t\t\t\t\tsx = x, sy = y;\n\t\t\t\telse if (maze[y][x] == 'G')\n\t\t\t\t\tgx = x, gy = y;\n\t\t\t}\n\t\t}\n\n\t\tvector<vector<int> > pat(p);\n\t\trep (i, p)\n\t\t\trep (j, pp[i].size())\n\t\t\t\tpat[i].push_back(string(\"DRUL\").find(pp[i][j]));\n\n\t\tvector<vector<int> > pma(p);\n\t\trep (i, p)\n\t\t\tpma[i] = build_pma(pat[i]);\n\n\t\tint res = -1;\n\t\tmap<ll, int> visit[64][64];\n\t\tqueue<Node> q;\n\t\tq.push(Node(sx, sy, 0));\n\t\tvisit[sy][sx][0] = 0;\n\t\twhile (!q.empty())\n\t\t{\n\t\t\tNode cur = q.front(); q.pop();\n\t\t\tint cost = visit[cur.y][cur.x][cur.states] + 1;\n\t\t\tfor (int i = 0; i < 4; ++i)\n\t\t\t{\n\t\t\t\tint nx = cur.x + dx[i], ny = cur.y + dy[i];\n\t\t\t\tif (0 <= nx && nx < m && 0 <= ny && ny < n\n\t\t\t\t\t&& maze[ny][nx] != '#')\n\t\t\t\t{\n\t\t\t\t\tll ns = next_states(pat, pma, cur.states, i);\n\t\t\t\t\tif (ns != -1 && !visit[ny][nx].count(ns))\n\t\t\t\t\t{\n\t\t\t\t\t\tvector<int> s(p);\n\t\t\t\t\t\tdecode(ns, s);\n\t\t\t\t\t\tif (nx == gx && ny == gy)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tres = cost;\n\t\t\t\t\t\t\tgoto End;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tq.push(Node(nx, ny, ns));\n\t\t\t\t\t\t\tvisit[ny][nx][ns] = cost;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\nEnd:\n\t\tcout << res << endl;\n\t}\n}", "#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#define V(x, y, z) ((x) * 1000000 + (y) * 1000 + (z))\n#define inf 1000000000\n\nusing namespace std;\n\nint W, H;\nchar map[55][55];\nint P;\nstring S[15];\nint sx, sy, gx, gy;\n\nvector<string> vec;\nint Next[105][4];\nbool ng[105][4];\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};\nconst char c[] = {'R', 'U', 'L', 'D'};\n\nint dist[55][55][105];\n\nint bfs()\n{\n\tfor(int x = 1; x <= W; x++){\n\t\tfor(int y = 1; y <= H; y++){\n\t\t\tfor(int k = 0; k < vec.size(); k++){\n\t\t\t\tdist[x][y][k] = inf;\n\t\t\t}\n\t\t}\n\t}\n\tdist[sx][sy][0] = 0;\n\t\n\tqueue<int> Q;\n\tQ.push(V(sx, sy, 0));\n\tint x, y, state;\n\twhile(Q.size()){\n\t\tstate = Q.front() % 1000, Q.front() /= 1000;\n\t\ty = Q.front() % 1000, Q.front() /= 1000;\n\t\tx = Q.front();\n\t\tQ.pop();\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tint nx = x + dx[i], ny = y + dy[i], nstate = Next[state][i];\n\t\t\tif(ng[state][i]) continue;\n\t\t\tif(nx <= 0 || nx > W || ny <= 0 || ny > H) continue;\n\t\t\tif(map[nx][ny] == '#') continue;\n\t\t\tif(dist[nx][ny][nstate] < inf) continue;\n\t\t\tdist[nx][ny][nstate] = dist[x][y][state] + 1;\n\t\t\tQ.push(V(nx, ny, nstate));\n\t\t}\n\t}\n\t\n\tint ret = inf;\n\tfor(int i = 0; i < vec.size(); i++) ret = min(ret, dist[gx][gy][i]);\n\tif(ret == inf) return -1;\n\treturn ret;\n}\n\nint main(void)\n{\n\twhile(1){\n\t\tcin >> H >> W;\n\t\tif(H == 0 && W == 0) break;\n\t\t\n\t\tfor(int y = 1; y <= H; y++){\n\t\t\tfor(int x = 1; x <= W; x++){\n\t\t\t\tcin >> map[x][y];\n\t\t\t\tif(map[x][y] == 'S') sx = x, sy = y;\n\t\t\t\tif(map[x][y] == 'G') gx = x, gy = y;\n\t\t\t}\n\t\t}\n\t\tcin >> P;\n\t\tfor(int i = 0; i < P; i++) cin >> S[i];\n\t\t\n\t\tvec.clear();\n\t\tvec.push_back(\"\");\n\t\tfor(int i = 0; i < P; i++){\n\t\t\tfor(int j = 0; j < S[i].size(); j++){\n\t\t\t\tvec.push_back(S[i].substr(0, j));\n\t\t\t}\n\t\t}\n\t\tsort(vec.begin(), vec.end());\n\t\tvec.erase(unique(vec.begin(), vec.end()), vec.end());\n\t\t\n\t\tfor(int i = 0; i < vec.size(); i++){\n\t\t\tfor(int j = 0; j < 4; j++){\n\t\t\t\tng[i][j] = false;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < vec.size(); i++){\n\t\t\tfor(int j = 0; j < 4; j++){\n\t\t\t\t\n\t\t\t\tstring s = vec[i] + c[j];\n\t\t\t\tfor(int k = 0; k < P; k++){\n\t\t\t\t\tstring t = s;\n\t\t\t\t\twhile(t.size()){\n\t\t\t\t\t\tif(t == S[k]){\n\t\t\t\t\t\t\tng[i][j] = true;\n\t\t\t\t\t\t\tgoto end;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tt = t.substr(1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tend:;\n\t\t\t\t\n\t\t\t\twhile(1){\n\t\t\t\t\tauto p = lower_bound(vec.begin(), vec.end(), s);\n\t\t\t\t\tif(p != vec.end() && *p == s){\n\t\t\t\t\t\tNext[i][j] = p - vec.begin();\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\ts = s.substr(1);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << bfs() << endl;\n\t}\n\t\n\treturn 0;\n}\n", "#include<iostream>\n#include<vector>\n#include<queue>\n#include<string>\n#include<cstring>\nusing namespace std;\n\n\nclass PMA{//Aho-Corasick\n\tint id;\n\tbool match;\n\tPMA *failure;\n\tPMA *next[256];\npublic:\n\tPMA(int id=0):id(id),match(false),failure(0){\n\t\tmemset(next,0,sizeof(next));\n\t}\n\t~PMA(){\n\t\tfor(int i=0;i<256;i++){\n\t\t\tif(next[i]&&next[i]!=this)delete next[i];\n\t\t}\n\t}\n\tint getID()const{return id;}\n\tbool matched()const{return match;}\n\tvoid build(const vector<string> &p){\n\t\tint num=1;\n\t\tfor(int i=0;i<(int)p.size();i++){\n\t\t\tconst string &s=p[i];\n\t\t\tPMA *t=this;\n\t\t\tfor(int j=0;j<(int)s.size();j++){\n\t\t\t\tif(!t->next[s[j]])t->next[s[j]]=new PMA(num++);\n\t\t\t\tt=t->next[s[j]];\n\t\t\t}\n\t\t\tt->match=true;\n\t\t}\n\t\tqueue<PMA*> q;\n\t\tfor(int i=0;i<256;i++){\n\t\t\tif(next[i]){\n\t\t\t\tq.push(next[i]);\n\t\t\t\tnext[i]->failure=this;\n\t\t\t}else next[i]=this;\n\t\t}\n\t\twhile(!q.empty()){\n\t\t\tPMA *t=q.front();q.pop();\n\t\t\tfor(int i=0;i<256;i++){\n\t\t\t\tif(t->next[i]){\n\t\t\t\t\tq.push(t->next[i]);\n\t\t\t\t\tPMA *r=t->failure;\n\t\t\t\t\twhile(!r->next[i])r=r->failure;\n\t\t\t\t\tt->next[i]->failure=r=r->next[i];\n\t\t\t\t\tt->next[i]->match |= r->match;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tPMA *step(char c)const{\n\t\tconst PMA *t=this;\n\t\twhile(!t->next[c])t=t->failure;\n\t\treturn t->next[c];\n\t}\n};\n\nstring ch(\"DRUL\");\nint dy[]={1,0,-1,0};\nint dx[]={0,1,0,-1};\n\nint h,w;\nchar m[52][52];\nint dp[51][51][102];\n\nstruct Node{\n\tint y,x;\n\tPMA *p;\n};\nint bfs(PMA &pma){\n\tmemset(dp,-1,sizeof(dp));\n\tNode a,b;\n\tfor(int i=1;i<=h;i++)for(int j=1;j<=w;j++)if(m[i][j]=='S'){\n\t\ta.y=i;\n\t\ta.x=j;\n\t\ta.p=&pma;\n\t}\n\tqueue<Node> q;\n\tdp[a.y][a.x][a.p->getID()]=0;\n\tq.push(a);\n\twhile(!q.empty()){\n\t\ta=q.front();q.pop();\n\t\tint d=dp[a.y][a.x][a.p->getID()];\n\t\tfor(int i=0;i<4;i++){\n\t\t\tb.y=a.y+dy[i];\n\t\t\tb.x=a.x+dx[i];\n\t\t\tif(m[b.y][b.x]=='#')continue;\n\t\t\tb.p=a.p->step(ch[i]);\n\t\t\tif(b.p->matched())continue;\n\t\t\tif(m[b.y][b.x]=='G')return d+1;\n\t\t\tif(dp[b.y][b.x][b.p->getID()]==-1){\n\t\t\t\tdp[b.y][b.x][b.p->getID()] = d+1;\n\t\t\t\tq.push(b);\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\nint main(){\n\twhile(cin>>h>>w&&(h||w)){\n\t\tmemset(m,'#',sizeof(m));\n\t\tfor(int i=1;i<=h;i++)\n\t\t\tfor(int j=1;j<=w;j++)\n\t\t\t\tcin>>m[i][j];\n\t\tint n;\n\t\tcin>>n;\n\t\tvector<string> p(n);\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>p[i];\n\t\t}\n\t\tPMA pma;\n\t\tpma.build(p);\n\t\tcout<<bfs(pma)<<endl;\n\t}\n\treturn 0;\n}", "#include<iostream>\n#include<string>\n#include<queue>\n#include<vector>\n#include<tuple>\nusing namespace std;\nint H, W, K, x[60][60], dist[60][60][200], sx, sy, gx, gy, dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };\nstring S[10], dir = \"DRUL\";\nvector<tuple<string, int, int>>vec;\nvector<tuple<int, int, int>> X[60][60][200];\nvector<pair<int, int>>banned[200];\nvoid build_banned() {\n\tint cnt1 = 1;\n\tvec.push_back(make_tuple(\"\", 0, 0));\n\tfor (int i = 0; i < K; i++) {\n\t\tfor (int j = 0; j <= S[i].size(); j++) {\n\t\t\tstring F = S[i].substr(0, j);\n\t\t\tbool OK = true;\n\t\t\tfor (int k = 0; k < vec.size(); k++) {\n\t\t\t\tif (get<0>(vec[k]) == F) {\n\t\t\t\t\tOK = false;\n\t\t\t\t\tif (j == S[i].size()) { get<2>(vec[k]) = 1; }\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (OK == true && j != S[i].size()) { vec.push_back(make_tuple(F, cnt1, 0)); cnt1++; }\n\t\t\tif (OK == true && j == S[i].size()) { vec.push_back(make_tuple(F, cnt1, 1)); cnt1++; }\n\t\t}\n\t}\n\tfor (int i = 0; i < vec.size(); i++) {\n\t\tfor (int j = 0; j < 4; j++) {\n\t\t\tstring W2 = get<0>(vec[i]); W2 += dir[j];\n\t\t\tbool OK = true; int to = 0;\n\t\t\twhile (W2.size() >= 1) {\n\t\t\t\tfor (int k = 0; k < vec.size(); k++) {\n\t\t\t\t\tstring W3 = get<0>(vec[k]);\n\t\t\t\t\tif (W3 == W2 && get<2>(vec[k]) == 1) { OK = false; }\n\t\t\t\t\tif (W3 == W2 && get<2>(vec[k]) == 0) {\n\t\t\t\t\t\tif (get<0>(vec[to]).size() < W2.size())to = k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tW2 = W2.substr(1, W2.size() - 1);\n\t\t\t}\n\t\t\tif (OK == true)banned[i].push_back(make_pair(to, j));\n\t\t}\n\t}\n}\nvoid add_edges() {\n\tfor (int i = 1; i <= H; i++) {\n\t\tfor (int j = 1; j <= W; j++) {\n\t\t\tfor (int k = 0; k < vec.size(); k++) {\n\t\t\t\tif (get<2>(vec[k]) == 1)continue;\n\t\t\t\tfor (int l = 0; l < 4; l++) {\n\t\t\t\t\tint cx = i + dx[l], cy = j + dy[l];\n\t\t\t\t\tif (cx <= 0 || cy <= 0 || cx > H || cy > W || x[cx][cy] == 2)continue;\n\t\t\t\t\tfor (int m = 0; m < banned[k].size(); m++) {\n\t\t\t\t\t\tif (banned[k][m].second == l)X[i][j][k].push_back(make_tuple(cx, cy, banned[k][m].first));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nint bfs() {\n\tqueue<tuple<int, int, int>>Q;\n\tfor (int i = 0; i < 60; i++) { for (int j = 0; j < 60; j++) { for (int k = 0; k < 200; k++)dist[i][j][k] = 999999999; } }\n\tQ.push(make_tuple(sx, sy, 0)); dist[sx][sy][0] = 0;\n\twhile (!Q.empty()) {\n\t\tint a1 = get<0>(Q.front()), a2 = get<1>(Q.front()), a3 = get<2>(Q.front()); Q.pop();\n\t\tfor (int i = 0; i < X[a1][a2][a3].size(); i++) {\n\t\t\tint tox = get<0>(X[a1][a2][a3][i]), toy = get<1>(X[a1][a2][a3][i]), toz = get<2>(X[a1][a2][a3][i]);\n\t\t\tif (dist[tox][toy][toz] == 999999999) {\n\t\t\t\tdist[tox][toy][toz] = dist[a1][a2][a3] + 1;\n\t\t\t\tQ.push(make_tuple(tox, toy, toz));\n\t\t\t}\n\t\t}\n\t}\n\tint maxn = 999999999;\n\tfor (int i = 0; i < vec.size(); i++)maxn = min(maxn, dist[gx][gy][i]);\n\treturn maxn;\n}\nint main() {\n\twhile (true) {\n\t\tvec.clear(); for (int i = 0; i < 3600; i++)x[i / 60][i % 60] = 0;\n\t\tfor (int i = 0; i < 60; i++) { for (int j = 0; j < 60; j++) { for (int k = 0; k < 200; k++)X[i][j][k].clear(); } }\n\t\tfor (int i = 0; i < 200; i++)banned[i].clear();\n\t\tcin >> H >> W; if (H == 0 && W == 0)break;\n\t\tfor (int i = 1; i <= H; i++) {\n\t\t\tfor (int j = 1; j <= W; j++) {\n\t\t\t\tchar c; cin >> c;\n\t\t\t\tif (c == '.') { x[i][j] = 1; }\n\t\t\t\tif (c == '#') { x[i][j] = 2; }\n\t\t\t\tif (c == 'S') { x[i][j] = 1; sx = i; sy = j; }\n\t\t\t\tif (c == 'G') { x[i][j] = 1; gx = i; gy = j; }\n\t\t\t}\n\t\t}\n\t\tcin >> K; for (int i = 0; i < K; i++) { cin >> S[i]; }\n\t\tbuild_banned();\n\t\tadd_edges();\n\t\tint ans = bfs(); if (ans == 999999999)ans = -1;\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1e8;\n\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\n\nstring D = \"DRUL\";\n\n// Aho-Corasick\nconst int var = 4;\n\nint trans(char c) {\n\tswitch (c)\n\t{\n\tcase 'R': return 0;\n\tcase 'D': return 1;\n\tcase 'L': return 2;\n\tcase 'U': return 3;\n\tdefault: break;\n\t}\n\texit(EXIT_FAILURE);\n}\nstruct node {\n\tnode *fail;\n\tvector<node*> next;\n\tvector<int> ok;\n\tnode() : fail(nullptr), next(var, nullptr) {}\n};\n\nnode* getnext(node* p, char c) {\n\twhile (p->next[trans(c)] == nullptr) p = p->fail;\n\treturn p->next[trans(c)];\n}\n\nclass Aho_Corasick {\n\tvector<int> unite(const vector<int>& a, const vector<int>& b) {\n\t\tvector<int> res;\n\t\tset_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res));\n\t\treturn res;\n\t}\n\tint K;\n\tnode *root;\npublic:\n\tAho_Corasick(const vector<string>& Ts) : K(Ts.size()), root(new node) {\n\t\tnode *now;\n\t\troot->fail = root;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tauto &T = Ts[i];\n\t\t\tnow = root;\n\t\t\tfor (auto c : T) {\n\t\t\t\tif (now->next[trans(c)] == nullptr) {\n\t\t\t\t\tnow->next[trans(c)] = new node;\n\t\t\t\t}\n\t\t\t\tnow = now->next[trans(c)];\n\t\t\t}\n\t\t\tnow->ok.push_back(i);\n\t\t}\n\t\tqueue<node*> q;\n\t\tfor (int i = 0; i < var; i++) {\n\t\t\tif (root->next[i] == nullptr) {\n\t\t\t\troot->next[i] = root;\n\t\t\t}\n\t\t\telse {\n\t\t\t\troot->next[i]->fail = root;\n\t\t\t\tq.push(root->next[i]);\n\t\t\t}\n\t\t}\n\t\twhile (!q.empty()) {\n\t\t\tnow = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < var; i++) {\n\t\t\t\tif (now->next[i] != nullptr) {\n\t\t\t\t\tnode *nx = now->fail;\n\t\t\t\t\twhile (nx->next[i] == nullptr) {\n\t\t\t\t\t\tnx = nx->fail;\n\t\t\t\t\t}\n\t\t\t\t\tnow->next[i]->fail = nx->next[i];\n\t\t\t\t\tnow->next[i]->ok = unite(now->next[i]->ok, nx->next[i]->ok);\n\t\t\t\t\tq.push(now->next[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tnode* getroot() const {\n\t\treturn root;\n\t}\n\tvector<int> count(const string& S) const {\n\t\tvector<int> res(K);\n\t\tnode *now = root;\n\t\tfor (auto c : S) {\n\t\t\twhile (now->next[trans(c)] == nullptr) {\n\t\t\t\tnow = now->fail;\n\t\t\t}\n\t\t\tnow = now->next[trans(c)];\n\t\t\tfor (auto k : now->ok) {\n\t\t\t\tres[k]++;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\n\nusing T = tuple<int, int, node*>;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m) {\n\t\tvector<string> S(n);\n\t\tint sx = 0, sy = 0, gx = 0, gy = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> S[i];\n\t\t\tfor (int j = 0; j < (int)S[i].size(); j++) {\n\t\t\t\tif (S[i][j] == 'S') {\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t}\n\t\t\t\telse if (S[i][j] == 'G') {\n\t\t\t\t\tgx = i;\n\t\t\t\t\tgy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> p;\n\t\tvector<string> pts(p);\n\t\tfor (int i = 0; i < p; i++) {\n\t\t\tcin >> pts[i];\n\t\t}\n\t\tAho_Corasick aho(pts);\n\t\tvector<vector<map<node*, int>>> f(n, vector<map<node*, int>>(m));\n\t\tqueue<T> q;\n\t\tq.push(make_tuple(sx, sy, aho.getroot()));\n\t\tf[sx][sy][aho.getroot()] = 0;\n\t\twhile (!q.empty()) {\n\t\t\tauto p = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint tx = get<0>(p) + dx[i], ty = get<1>(p) + dy[i];\n\t\t\t\tnode *t = getnext(get<2>(p), D[i]);\n\t\t\t\tif (0 <= tx && tx < n && 0 <= ty && ty < m && S[tx][ty] != '#' && t->ok.empty() && f[tx][ty].count(t) == 0) {\n\t\t\t\t\tq.push(make_tuple(tx, ty, t));\n\t\t\t\t\tf[tx][ty][t] = f[get<0>(p)][get<1>(p)][get<2>(p)] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint res = INF;\n\t\tfor (auto p : f[gx][gy]) {\n\t\t\tres = min(res, p.second);\n\t\t}\n\t\tcout << (res != INF ? res : -1) << endl;\n\t}\n\treturn 0;\n}", "#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nclass PMA\n{\n int n;\n vector<vector<int> > next;\n vector<bitset<32> > match;\n vector<int> failure;\npublic:\n PMA(const vector<string>& pattern){\n next.assign(1, vector<int>(128, -1));\n match.assign(1, 0);\n for(unsigned i=0; i<pattern.size(); ++i){\n int curr = 0;\n for(unsigned j=0; j<pattern[i].size(); ++j){\n if(next[curr][pattern[i][j]] == -1){\n next[curr][pattern[i][j]] = next.size();\n next.push_back(vector<int>(128, -1));\n match.push_back(0);\n }\n curr = next[curr][pattern[i][j]];\n }\n match[curr][i] = true;\n }\n\n n = next.size();\n failure.resize(n, 0);\n vector<int> node1(1, 0);\n while(!node1.empty()){\n vector<int> node2;\n for(unsigned i=0; i<node1.size(); ++i){\n for(int j=0; j<128; ++j){\n int s = node1[i];\n if(next[s][j] == -1)\n continue;\n node2.push_back(next[s][j]);\n int t = s;\n while(t != 0){\n if(next[failure[t]][j] != -1){\n failure[next[s][j]] = next[failure[t]][j];\n match[next[s][j]] |= match[next[failure[t]][j]];\n break;\n }\n t = failure[t];\n }\n }\n }\n node1.swap(node2);\n }\n }\n int size(){\n return n;\n }\n int transition(int curr, char c){\n if(next[curr][c] != -1)\n return next[curr][c];\n if(curr == 0)\n return 0;\n return transition(failure[curr], c);\n }\n bitset<32> checkMatch(int curr){\n return match[curr];\n }\n};\n\nchar dc[] = \"URDL\";\nint dy[] = {-1, 0, 1, 0};\nint dx[] = {0, 1, 0, -1};\n\nint main()\n{\n for(;;){\n int h, w;\n cin >> h >> w;\n if(h == 0)\n return 0;\n\n vector<string> grid(h+2, string(w+2, '#'));\n int sy, sx, gy, gx;\n for(int i=1; i<=h; ++i){\n for(int j=1; j<=w; ++j){\n cin >> grid[i][j];\n if(grid[i][j] == 'S'){\n sy = i;\n sx = j;\n grid[i][j] = '.';\n }\n if(grid[i][j] == 'G'){\n gy = i;\n gx = j;\n grid[i][j] = '.';\n }\n }\n }\n\n int p;\n cin >> p;\n vector<string> pattern(p);\n for(int i=0; i<p; ++i)\n cin >> pattern[i];\n\n PMA pma(pattern);\n int n = pma.size();\n vector<vector<vector<int> > > minCost(h+2, vector<vector<int> >(w+2, vector<int>(n, INT_MAX)));\n minCost[sy][sx][0] = 0;\n queue<pair<pair<int, int>, int> > q;\n q.push(make_pair(make_pair(sy, sx), 0));\n bool ng = true;\n while(!q.empty()){\n int y0 = q.front().first.first;\n int x0 = q.front().first.second;\n int s = q.front().second;\n int cost = minCost[y0][x0][s];\n q.pop();\n\n if(y0 == gy && x0 == gx){\n cout << cost << endl;\n ng = false;\n break;\n }\n\n for(int i=0; i<4; ++i){\n int y = y0 + dy[i];\n int x = x0 + dx[i];\n int t = pma.transition(s, dc[i]);\n if(grid[y][x] == '#' || minCost[y][x][t] < INT_MAX || pma.checkMatch(t).any())\n continue;\n minCost[y][x][t] = cost + 1;\n q.push(make_pair(make_pair(y, x), t));\n }\n }\n\n if(ng)\n cout << -1 << endl;\n }\n}", "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[8] = {0, 1, 0, -1, 1, -1, -1, 1};\nint dy[8] = {-1, 0, 1, 0, 1, 1, -1, -1};\nstruct PMA{\n int next[0x100];\n bool match;\n PMA() { memset(next, -1, sizeof(next)); match = false;}\n};\nint SIZE = 0;\nPMA P[200];\nstring URDL = \"URDL\";\nint make_PMA(){\n P[SIZE] = PMA();\n return SIZE++;\n}\nvoid build_PMA(vector<string> vs){\n SIZE = 0;\n int root = make_PMA();\n for(int i = 0; i < vs.size(); i++){\n int t = root;\n for(int j = 0; j < vs[i].size(); j++){\n if(P[t].next[vs[i][j]] == -1){ P[t].next[vs[i][j]] = make_PMA(); }\n t = P[t].next[vs[i][j]];\n }\n P[t].match = true;\n }\n queue<int> que;\n for(int i = 0; i < 4; i++){\n char c = URDL[i];\n int next = P[root].next[c];\n if(next != -1){\n P[next].next[0] = root;\n que.push(next);\n }else {\n P[root].next[c] = root;\n }\n }\n while(!que.empty()){\n int t = que.front(); que.pop();\n for(int i = 0; i < 4; i++){\n char c = URDL[i];\n int next = P[t].next[c];\n if(next != -1){\n que.push(next);\n int r = P[t].next[0];\n while(P[r].next[c] == -1) r = P[r].next[0];\n P[next].next[0] = P[r].next[c];\n //need??\n if(P[P[r].next[c]].match) P[next].match = true;\n }\n }\n }\n}\n\nint move(int t, char c){\n while(P[t].next[c] == -1) t = P[t].next[0];\n return P[t].next[c];\n}\n\nint main(){\n int H, W;\n while(cin>>H>>W && H){\n vector<string> grid(H);\n REP(y, H) cin>>grid[y];\n int PL;\n cin>>PL;\n vector<string> ban(PL);\n REP(i, PL) cin>>ban[i];\n build_PMA(ban);\n int dist[50][50][110] = {};\n memset(dist, -1, sizeof(dist));\n queue<int> qx, qy, qt;\n REP(y, H)REP(x, W)if(grid[y][x] == 'S'){\n qx.push(x);\n qy.push(y);\n qt.push(0);\n dist[y][x][0] = 0;\n }\n int ans = -1;\n while(!qx.empty()){\n int x = qx.front(); qx.pop();\n int y = qy.front(); qy.pop();\n int t = qt.front(); qt.pop();\n int d = dist[y][x][t];\n if(grid[y][x] == 'G'){\n ans = d;\n break;\n }\n REP(r, 4){\n int nx = x + dx[r];\n int ny = y + dy[r];\n int nt = move(t, URDL[r]);\n if(valid(nx, ny, W, H) && grid[ny][nx] != '#' && dist[ny][nx][nt] == -1 && !(P[nt].match)){\n qy.push(ny); qx.push(nx); qt.push(nt);\n dist[ny][nx][nt] = d + 1;\n }\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define print(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define print(x)\n#endif\n\n\n\nconst int inf=1e9;\nconst int64_t inf64=1e18;\nconst double eps=1e-9;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nusing i64=int64_t;\n\nconst int alphabet_size=4;\nclass pma{\npublic:\n pma* next[alphabet_size],*failure;\n vector<int> matches;\n string s;\n pma(){\n fill(next,next+alphabet_size,(pma*)0);\n failure=NULL;\n }\n void insert(const string &str,const int id){ insert(str,0,id); }\n void insert(const string &str,const int idx,const int id){\n s=str.substr(0,idx);\n if(idx==str.size()){\n matches.push_back(id);\n return;\n }\n if(next[str[idx]]==NULL) this->next[str[idx]]=new pma();\n next[str[idx]]->insert(str,idx+1,id);\n }\n};\n\nclass aho_corasick{\npublic:\n vector<string> dic;\n pma* root;\n aho_corasick(const vector<string>& dic_):dic(dic_),root(new pma()){\n for(int i=0; i<dic.size(); ++i) root->insert(dic[i],i);\n root->failure=root;\n queue<pma*> que;\n que.push(root);\n while(!que.empty()){\n pma* curr=que.front();\n que.pop();\n curr->matches.insert(curr->matches.end(),curr->failure->matches.begin(),curr->failure->matches.end());\n for(int i=0; i<alphabet_size; ++i){\n pma*& next=curr->next[i];\n if(next==NULL){\n next=curr==root?root:curr->failure->next[i];\n continue;\n }\n next->failure=curr==root?root:curr->failure->next[i];\n next->matches.insert(next->matches.end(),curr->matches.begin(),curr->matches.end());\n que.push(next);\n }\n }\n }\n vector<bool> match(const string& s)const{\n vector<bool> res(dic.size());\n const pma* state=root;\n for(char c:s){\n state=state->next[c];\n for(int i:state->matches) res[i]=true;\n }\n return res;\n }\n};\n\nvoid solve(int N,int M){\n vector<string> vs(N);\n int sy,sx,gy,gx;\n rep(i,0,N){\n cin >> vs[i];\n rep(j,0,M){\n if(vs[i][j]=='S'){\n sy=i;\n sx=j;\n }\n if(vs[i][j]=='G'){\n gy=i;\n gx=j;\n }\n }\n }\n\n int P;\n cin >> P;\n vector<string> ban(P);\n rep(i,0,P){\n cin >> ban[i];\n for(char& c:ban[i]){\n if(c=='R') c=0;\n if(c=='U') c=1;\n if(c=='L') c=2;\n if(c=='D') c=3;\n }\n }\n\n aho_corasick ac(ban);\n vector<int> dx={1,0,-1,0},dy={0,-1,0,1};\n queue<tuple<int,int,pma*,int>> que;\n set<tuple<int,int,pma*>> visited;\n que.push(make_tuple(sy,sx,ac.root,0));\n visited.insert(make_tuple(sy,sx,ac.root));\n while(!que.empty()){\n int y,x,d;\n pma* curr;\n tie(y,x,curr,d)=que.front();\n que.pop();\n if(y==gy and x==gx){\n cout << d << endl;\n return;\n }\n rep(i,0,4){\n int ny=y+dy[i],nx=x+dx[i];\n if(ny<0 or N<=ny or nx<0 or M<=nx or vs[ny][nx]=='#') continue;\n pma* next=curr->next[i];\n if(!next->matches.empty()) continue;\n if(visited.find(make_tuple(ny,nx,next))!=visited.end()) continue;\n que.push(make_tuple(ny,nx,next,d+1));\n visited.insert(make_tuple(ny,nx,next));\n }\n }\n cout << -1 << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n for(;;){\n int N,M;\n cin >> N >> M;\n if(!N and !M) break;\n solve(N,M);\n }\n return 0;\n}", "#include <array>\n#include <cstdlib>\n#include <iostream>\n#include <queue>\n#include <tuple>\n#include <unordered_map>\n#include <vector>\nusing namespace std;\n\nconstexpr int ALPHA = 4;\nconstexpr int MAX_V = 10000;\nconst int BASE = 'a';\n\nstruct trie {\n\tint v;\n\tint failure;\n\tbool accept;\n\tarray<int, ALPHA> next;\n\n\texplicit trie(int v_):v(v_), failure(0), accept(false) { next.fill(-1); }\n};\n\nvector<trie> nodes;\nchar convert[128];\n\nvoid add(const string &s) {\n\tint v = 0;\n\n\tfor(const char &c : s) {\n\t\tconst int id = convert[c] - BASE;\n\t\tif(nodes[v].next[id] == -1) {\n\t\t\tnodes[v].next[id] = nodes.size();\n\t\t\tnodes.emplace_back(nodes.size());\n\t\t}\n\t\tv = nodes[v].next[id];\n\t}\n\tnodes[v].accept = true;\n}\n\nvoid construct(const vector<string> &dict) {\n\tnodes.clear();\n\tnodes.reserve(MAX_V);\n\tnodes.emplace_back(0);\n\n\tfor(const auto &s : dict) {\n\t\tadd(s);\n\t}\n\n\tqueue<int> que;\n\tque.push(0);\n\n\twhile(!que.empty()) {\n\t\tconst trie &current = nodes[que.front()];\n\t\tque.pop();\n\n\t\tfor(int i = 0; i < ALPHA; ++i) {\n\t\t\tconst int next_id = current.next[i];\n\n\t\t\tif(next_id == -1) continue;\n\n\t\t\tque.push(next_id);\n\n\t\t\ttrie &u = nodes[next_id];\n\n\t\t\tif(current.v) {\n\t\t\t\tint f = current.failure;\n\t\t\t\twhile(f && nodes[f].next[i] == -1) {\n\t\t\t\t\tf = nodes[f].failure;\n\t\t\t\t}\n\n\t\t\t\tconst int nf = nodes[f].next[i];\n\n\t\t\t\tif(nf != -1) {\n\t\t\t\t\tu.failure = nf;\n\t\t\t\t\tu.accept |= nodes[nf].accept;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint move_to(int v, char c) {\n\tconst int id = c - BASE;\n\n\twhile(v && nodes[v].next[id] == -1) {\n\t\tv = nodes[v].failure;\n\t}\n\n\tif(nodes[v].next[id] != -1) {\n\t\tv = nodes[v].next[id];\n\t}\n\n\treturn v;\n}\n\nconstexpr int dx[] = {-1, 0, 1, 0};\nconstexpr int dy[] = {0, 1, 0, -1};\n\ninline bool out(int x, int y, int w, int h) {\n\treturn x < 0 || y < 0 || x >= w || y >= h;\n}\n\ninline int bfs(const vector<string> &field) {\n\tconst int h = field.size();\n\tconst int w = field[0].size();\n\n\tvector<vector<unordered_map<int, int>>> dist(h, vector<unordered_map<int ,int>>(w));\n\tqueue<tuple<int, int, int>> que;\n\n\tfor(int y = 0; y < h; ++y) {\n\t\tfor(int x = 0; x < w; ++x) {\n\t\t\tif(field[y][x] == 'S') {\n\t\t\t\tdist[y][x][0] = 0;\n\t\t\t\tque.push(make_tuple(x, y, 0));\n\t\t\t\tgoto end_init;\n\t\t\t}\n\t\t}\n\t}\n\nend_init:;\n\n\twhile(!que.empty()) {\n\t\tint x, y, v;\n\t\ttie(x, y, v) = que.front();\n\t\tque.pop();\n\n\t\tconst int next_dist = dist[y][x][v] + 1;\n\n\t\tfor(int d = 0; d < 4; ++d) {\n\t\t\tconst int nx = x + dx[d];\n\t\t\tconst int ny = y + dy[d];\n\t\t\tif(out(nx, ny, w, h) || field[ny][nx] == '#') continue;\n\n\t\t\tconst int nv = move_to(v, d + BASE);\n\n\t\t\tif(nodes[nv].accept) continue;\n\n\t\t\tif(field[ny][nx] == 'G') return next_dist;\n\t\t\tif(!dist[ny][nx].count(nv)) {\n\t\t\t\tdist[ny][nx][nv] = next_dist;\n\t\t\t\tque.push(make_tuple(nx, ny, nv));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn -1;\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tconst string dir = \"LDRU\";\n\tfor(unsigned i = 0; i < dir.size(); ++i) {\n\t\tconvert[dir[i]] = 'a' + i;\n\t}\n\n\tfor(int h, w; cin >> h >> w && h;) {\n\t\tvector<string> field(h);\n\t\tfor(auto &e : field) cin >> e;\n\n\t\tint n;\n\t\tcin >> n;\n\n\t\tvector<string> ng(n);\n\t\tfor(auto &e : ng) cin >> e;\n\n\t\tconstruct(ng);\n\n\t\tcout << bfs(field) << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\n\n\n\n\n\n#define CMAX 4\n#define OFFSET 0\nstruct Node { int nxt[CMAX + 1]; int exist; vector<int> accept;\nNode() : exist(0){ memset(nxt, -1, sizeof(nxt)); }};\nstruct Trie {\n\tvector<Node> nodes; int root;\n\tTrie() : root(0){ nodes.push_back(Node()); }\n\tvoid update_direct(int node, int id) { nodes[node].accept.push_back(id); }\n\tvoid update_child(int node, int child, int id) { ++nodes[node].exist; }\n\tvoid add(const string &str, int str_index, int node_index, int id)\n\t{\n\t\tif (str_index == str.size()) update_direct(node_index, id);\n\t\telse {\n\t\t\tconst int c = str[str_index] - OFFSET;\n\t\t\tif (nodes[node_index].nxt[c] == -1) {\n\t\t\t\tnodes[node_index].nxt[c] = (int)nodes.size();\n\t\t\t\tnodes.push_back(Node());\n\t\t\t}\n\t\t\tadd(str, str_index + 1, nodes[node_index].nxt[c], id);\n\t\t\tupdate_child(node_index, nodes[node_index].nxt[c], id);\n\t\t}\n\t}\n\tvoid add(const string &str, int id) { add(str, 0, 0, id); }\n\tvoid add(const string &str) { add(str, nodes[0].exist); }\n\tint size() { return (nodes[0].exist); }\n\tint nodesize() { return ((int)nodes.size()); }\n};\n\nstruct AhoCorasick : Trie {\n\tstatic const int FAIL = CMAX; vector<int> correct;\n\tAhoCorasick() : Trie() {}\n\tvoid build() {\n\t\tcorrect.resize(nodes.size());\n\t\trep(i, 0, nodes.size()) correct[i] = (int)nodes[i].accept.size();\n\n\t\tqueue<int> que;\n\t\trep(i, 0, CMAX + 1) {\n\t\t\tif (~nodes[0].nxt[i]) {\n\t\t\t\tnodes[nodes[0].nxt[i]].nxt[FAIL] = 0;\n\t\t\t\tque.emplace(nodes[0].nxt[i]);\n\t\t\t} else nodes[0].nxt[i] = 0;\n\t\t}\n\t\twhile (!que.empty()) {\n\t\t\tNode &now = nodes[que.front()];\n\t\t\tcorrect[que.front()] += correct[now.nxt[FAIL]];\n\t\t\tque.pop();\n\t\t\tfor (int i = 0; i < CMAX; i++) {\n\t\t\t\tif (now.nxt[i] == -1) continue;\n\t\t\t\tint fail = now.nxt[FAIL];\n\t\t\t\twhile (nodes[fail].nxt[i] == -1) {\n\t\t\t\t\tfail = nodes[fail].nxt[FAIL];\n\t\t\t\t}\n\t\t\t\tnodes[now.nxt[i]].nxt[FAIL] = nodes[fail].nxt[i];\n\n\t\t\t\tauto &u = nodes[now.nxt[i]].accept;\n\t\t\t\tauto &v = nodes[nodes[fail].nxt[i]].accept;\n\t\t\t\tvector<int> accept;\n\t\t\t\tset_union(begin(u), end(u), begin(v), end(v), back_inserter(accept));\n\t\t\t\tu = accept;\n\t\t\t\tque.emplace(now.nxt[i]);\n\t\t\t}\n\t\t}\n\t}\n\n\tint match(const string &str, vector< int > &result, int now = 0) {\n\t\tresult.assign(size(), 0);\n\t\tint count = 0;\n\t\tfor (auto &c : str) {\n\t\t\twhile (nodes[now].nxt[c - OFFSET] == -1) now = nodes[now].nxt[FAIL];\n\t\t\tnow = nodes[now].nxt[c - OFFSET];\n\t\t\tcount += correct[now];\n\t\t\tfor (auto &v : nodes[now].accept) ++result[v];\n\t\t}\n\t\treturn count;\n\t}\n\n\tint next(int now, char c) {\n\t\twhile(nodes[now].nxt[c - OFFSET] == -1) now = nodes[now].nxt[FAIL];\n\t\treturn nodes[now].nxt[c - OFFSET];\n\t}\n};\n//-----------------------------------------------------------------\nint H, W, P;\nstring MAP[50], BAN[10];\nint dx[4] = { 0, 1, 0, -1 };\nint dy[4] = { -1, 0, 1, 0 };\nstring dir = \"URDL\";\n#define INF INT_MAX/2\nvoid change(string &s) {\n\trep(i, 0, s.length()) rep(j, 0, 4) if (s[i] == dir[j]) s[i] = j;\n}\nbool done[50][50][100];\nint dist[50][50][100];\nint sol() {\n\tAhoCorasick ac;\n\trep(i, 0, P) {\n\t\tchange(BAN[i]);\n\t\tac.add(BAN[i]);\n\t}\n\tac.build();\n\n\t// LD -> 32\n\t// DD -> 22\n\t// LLL -> 333\n\tfor (int i : ac.nodes[0].accept) {\n\t\tcout << i << endl;\n\t}\n\n\n\trep(i, 0, 50) rep(j, 0, 50) rep(k, 0, 100) done[i][j][k] = false;\n\trep(i, 0, 50) rep(j, 0, 50) rep(k, 0, 100) dist[i][j][k] = INF;\n\n\tqueue<int> q;\n\tint N = ac.nodesize();\n\t\n\trep(y, 0, H) rep(x, 0, W) if (MAP[y][x] == 'S') {\n\t\tq.push(y * 100 * 100 + x * 100 + 0);\n\t\tdist[y][x][0] = 0;\n\t\tdone[y][x][0] = true;\n\t}\n\n\twhile (!q.empty()) {\n\t\tint y = q.front() / 10000;\n\t\tint x = (q.front() % 10000) / 100;\n\t\tint s = q.front() % 100;\n\t\tq.pop();\n\n\t\tif (MAP[y][x] == 'G') return dist[y][x][s];\n\n\t\trep(i, 0, 4) {\n\t\t\tint xx = x + dx[i];\n\t\t\tint yy = y + dy[i];\n\t\t\tif (xx < 0 || W <= xx) continue;\n\t\t\tif (yy < 0 || H <= yy) continue;\n\t\t\tif (MAP[yy][xx] == '#') continue;\n\t\t\tint ss = ac.next(s, i);\n\n\t\t\t// ??°????????¢??¶??????????????\\\n\t\t\tif (ac.correct[ss]) continue;\n\n\t\t\tif (done[yy][xx][ss]) continue;\n\n\t\t\tq.push(yy * 10000 + xx * 100 + ss);\n\t\t\tdist[yy][xx][ss] = dist[y][x][s] + 1;\n\t\t\tdone[yy][xx][ss] = true;\n\t\t}\n\t}\n\n\treturn -1;\n}\n//-----------------------------------------------------------------\nint main() {\n\twhile (cin >> H >> W) {\n\t\tif (H == 0) return 0;\n\t\trep(y, 0, H) cin >> MAP[y];\n\t\tcin >> P;\n\t\trep(i, 0, P) cin >> BAN[i];\n\n\t\tcout << sol() << endl;\n\t}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int var = 4;\nconst int pmax = 1e4;\n\nint trans(char c) {\n\tswitch (c)\n\t{\n\tcase 'R': return 0;\n\tcase 'D': return 1;\n\tcase 'L': return 2;\n\tcase 'U': return 3;\n\tdefault: assert(false);\n\t}\n}\n\nstruct ac_node {\n\tac_node *fail;\n\tac_node *next[var];\n\tint ok;\n\tac_node() : fail(nullptr), next{}, ok(0) {}\n};\n\nac_node* get_next(ac_node* p, char c) {\n\twhile (!p->next[trans(c)]) p = p->fail;\n\treturn p->next[trans(c)];\n}\n\nclass aho_corasick {\n\tac_node* new_ac_node() {\n\t\tstatic ac_node pool[pmax];\n\t\tstatic int it = 0;\n\t\tassert(it < pmax);\n\t\treturn &pool[it++];\n\t}\n\tint K;\n\tac_node *root;\npublic:\n\taho_corasick(const vector<string>& Ts) : K(Ts.size()), root(new_ac_node()) {\n\t\tac_node *now;\n\t\troot->fail = root;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tauto &T = Ts[i];\n\t\t\tnow = root;\n\t\t\tfor (auto c : T) {\n\t\t\t\tif (!now->next[trans(c)]) {\n\t\t\t\t\tnow->next[trans(c)] = new_ac_node();\n\t\t\t\t}\n\t\t\t\tnow = now->next[trans(c)];\n\t\t\t}\n\t\t\tnow->ok = 1;\n\t\t}\n\t\tqueue<ac_node*> q;\n\t\tfor (int i = 0; i < var; i++) {\n\t\t\tif (!root->next[i]) {\n\t\t\t\troot->next[i] = root;\n\t\t\t}\n\t\t\telse {\n\t\t\t\troot->next[i]->fail = root;\n\t\t\t\tq.push(root->next[i]);\n\t\t\t}\n\t\t}\n\t\twhile (!q.empty()) {\n\t\t\tnow = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < var; i++) {\n\t\t\t\tif (now->next[i]) {\n\t\t\t\t\tac_node *nx = now->fail;\n\t\t\t\t\twhile (!nx->next[i]) {\n\t\t\t\t\t\tnx = nx->fail;\n\t\t\t\t\t}\n\t\t\t\t\tnow->next[i]->fail = nx->next[i];\n\t\t\t\t\tnow->next[i]->ok = max(now->next[i]->ok, nx->next[i]->ok);\n\t\t\t\t\tq.push(now->next[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tac_node* get_root() const {\n\t\treturn root;\n\t}\n\tint get_node_id(ac_node* nd) const {\n\t\treturn (int)(nd - root);\n\t}\n};\n\nconst int INF = 1e8;\n\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\n\nstring D = \"DRUL\";\n\nusing T = tuple<int, int, ac_node*>;\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint n, m, p;\n\twhile (cin >> n >> m, n | m) {\n\t\tvector<string> S(n);\n\t\tint sx = 0, sy = 0, gx = 0, gy = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> S[i];\n\t\t\tfor (int j = 0; j < (int)S[i].size(); j++) {\n\t\t\t\tif (S[i][j] == 'S') {\n\t\t\t\t\tsx = i;\n\t\t\t\t\tsy = j;\n\t\t\t\t}\n\t\t\t\telse if (S[i][j] == 'G') {\n\t\t\t\t\tgx = i;\n\t\t\t\t\tgy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> p;\n\t\tvector<string> pts(p);\n\t\tfor (int i = 0; i < p; i++) {\n\t\t\tcin >> pts[i];\n\t\t}\n\t\taho_corasick aho(pts);\n\t\tvector<vector<vector<int>>> f(n, vector<vector<int>>(m, vector<int>(110, INF)));\n\t\tqueue<T> q;\n\t\tq.push(make_tuple(sx, sy, aho.get_root()));\n\t\tf[sx][sy][aho.get_node_id(aho.get_root())] = 0;\n\t\twhile (!q.empty()) {\n\t\t\tauto tup = q.front(); q.pop();\n\t\t\tint x = get<0>(tup), y = get<1>(tup);\n\t\t\tac_node *nd = get<2>(tup);\n\t\t\tint id = aho.get_node_id(nd);\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\t\t\tac_node *tnd = get_next(nd, D[i]);\n\t\t\t\tif (0 <= tx && tx < n && 0 <= ty && ty < m && S[tx][ty] != '#' && !tnd->ok && f[tx][ty][aho.get_node_id(tnd)] == INF) {\n\t\t\t\t\tq.push(make_tuple(tx, ty, tnd));\n\t\t\t\t\tf[tx][ty][aho.get_node_id(tnd)] = f[x][y][id] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint res = INF;\n\t\tfor (auto val : f[gx][gy]) {\n\t\t\tres = min(res, val);\n\t\t}\n\t\tcout << (res != INF ? res : -1) << endl;\n\t}\n\treturn 0;\n}\n\n", "#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <vector>\n#include <string>\n#include <set>\n#include <map>\nusing namespace std;\n\nstruct State {\n int x, y, e;\n};\n\nconst int INF = (1<<28);\nconst int MAXH = 51;\nconst int MAXW = 51;\nconst int MAXP = 11;\n\nconst string dc[] = {\"R\",\"D\",\"L\",\"U\"};\nconst int dx[] = {1,0,-1,0};\nconst int dy[] = {0,1,0,-1};\n\nint H, W;\nchar G[MAXH][MAXW];\nint P;\nvector<string> S;\nint E[105][4];\nint cost[MAXH][MAXW][105];\n\nint bfs(int sx, int sy, int gx, int gy, int e) {\n queue<State> que;\n State s = {sx, sy, e};\n fill(cost[0][0], cost[MAXH][0], INF);\n cost[s.y][s.x][s.e] = 0;\n que.push(s);\n while(!que.empty()) {\n s = que.front();\n que.pop();\n for(int i = 0; i < 4; ++i) {\n int nx = s.x + dx[i]; \n int ny = s.y + dy[i]; \n int ne = E[s.e][i];\n if(ne == -1) continue;\n if(nx < 0 || nx >= W) continue;\n if(ny < 0 || ny >= H) continue;\n if(G[ny][nx] == '#') continue;\n if(cost[ny][nx][ne] != INF) continue;\n cost[ny][nx][ne] = cost[s.y][s.x][s.e] + 1;\n que.push((State){nx, ny, ne});\n if(nx == gx && ny == gy) {\n return cost[ny][nx][ne];\n }\n }\n }\n return INF;\n}\n\nint main() {\n while(cin >> H >> W && (H|W)) {\n int sx, sy, gx, gy;\n for(int i = 0; i < H; ++i) {\n for(int j = 0; j < W; ++j) {\n cin >> G[i][j];\n if(G[i][j] == 'S') {\n sx = j;\n sy = i;\n }\n if(G[i][j] == 'G') {\n gx = j;\n gy = i;\n }\n }\n }\n cin >> P;\n S.resize(P);\n for(int i = 0; i < P; ++i) {\n cin >> S[i];\n }\n\n vector<string> v;\n v.push_back(\"\");\n for(int i = 0; i < P; ++i) {\n for(int j = 1; j < S[i].size(); ++j) {\n string s = S[i].substr(0, j);\n bool flag = true;\n for(int k = 0; k < S.size(); ++k) {\n if(s.find(S[k]) != string::npos) {\n flag = false;\n break;\n }\n }\n if(flag){\n v.push_back(s);\n }\n }\n }\n\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n\n fill(E[0], E[105], -1);\n for(int i = 0; i < v.size(); ++i) {\n for(int j = 0; j < 4; ++j) {\n string s = v[i] + dc[j];\n bool flag = true;\n for(int k = 0; k < S.size(); ++k) {\n if(s.find(S[k]) != string::npos) {\n flag = false;\n break;\n }\n }\n if(!flag) continue;\n s = v[i] + dc[j];\n while(1) {\n int p = lower_bound(v.begin(), v.end(), s) - v.begin();\n if(p < v.size() && v[p] == s) {\n E[i][j] = p;\n break;\n }\n s = s.substr(1);\n }\n }\n }\n\n int ans = bfs(sx, sy, gx, gy, 0);\n if(ans == INF) ans = -1;\n cout << ans << endl;\n }\n return 0;\n}", "\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.StringTokenizer;\n\npublic class Main{\n\t\n\tString INPUT = \"./data/judge/201709/A2212.txt\";\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tnew Main().run();\n\t}\n\t\n\tstatic class Node{\n\t\tNode[] next = new Node[4];\n\t\tlong pos;\n\t\tint idx;\n\t\tNode (long pos) {\n\t\t\tthis.pos = pos;\n\t\t}\n\t}\n\t\n\tstatic class Automaton{\n\t\tstatic final Node terminal = new Node(0L);\n\t\tNode root = new Node(0L);\n HashMap<Long, Node> map = new HashMap<Long, Node>();\n ArrayList<Node> nodes = new ArrayList<Node>();\n int[][] pattern;\n \n Automaton(String[] patStr) {\n pattern = new int[patStr.length][];\n for (int i = 0; i < patStr.length; ++i) {\n pattern[i] = new int[patStr[i].length()];\n for (int j = 0; j < pattern[i].length; ++j) {\n switch (patStr[i].charAt(j)) {\n case 'U':\n pattern[i][j] = 0;\n break;\n case 'R':\n pattern[i][j] = 1;\n break;\n case 'D':\n pattern[i][j] = 2;\n break;\n case 'L':\n pattern[i][j] = 3;\n break;\n }\n }\n }\n build(root);\n }\n \n void build(Node parent) {\n parent.idx = nodes.size();\n nodes.add(parent);\n map.put(parent.pos, parent);\n for (int i = 0; i < 4; ++i) {\n long nextPos = 0;\n for (int j = 0; j < pattern.length; ++j) {\n int curElemPos = (int) ((parent.pos >> (j * 4)) & 0xF);\n long nextElemPos;\n if (pattern[j][curElemPos] == i) {\n nextElemPos = curElemPos + 1;\n } \n else {\n nextElemPos = 0;\n for (int k = curElemPos; k >= 0; --k) {\n if (pattern[j][k] != i) continue;\n boolean ok = true;\n for (int l = 1; l <= k; ++l) {\n if (pattern[j][curElemPos - l] != pattern[j][k - l]) {\n ok = false;\n break;\n }\n }\n if (ok) {\n nextElemPos = k + 1;\n break;\n }\n }\n }\n if (nextElemPos == pattern[j].length) {\n parent.next[i] = terminal;\n break;\n } \n else {\n nextPos += nextElemPos << (j * 4);\n }\n }\n if (parent.next[i] == null) {\n Node child = map.get(nextPos);\n if (child == null) {\n child = new Node(nextPos);\n build(child);\n }\n parent.next[i] = child;\n }\n }\n }\n\t}\n\t\n\tclass State{\n\t\tint r, c, i;\n\t\t\n\t\tState(int r, int c, int i){\n\t\t\tthis.r = r;\n\t\t\tthis.c = c;\n\t\t\tthis.i = i;\n\t\t}\n\t}\n\t\n\tstatic int[] DR = {-1, 0, 1, 0};\n\tstatic int[] DC = {0, 1, 0, -1};\n\tint N, M;\n\tchar[][] f;\n\t\n\tvoid read() {\n\t\twhile (true) {\n\t\t\tN = ni();\n\t\t\tif (N == 0) break;\n\t\t\tM = ni();\n\t\t\tf = new char[N + 2][M + 2];\n\t\t\tint startR = 0;\n\t\t\tint startC = 0;\n\t\t\tArrays.fill(f[0], '#');\n\t\t\tArrays.fill(f[N + 1], '#');\n\t\t\tfor (int i = 0; i < N; ++i) {\n String row = ns();\n f[i + 1][0] = f[i + 1][M + 1] = '#';\n for (int j = 0; j < M; ++j) {\n char c = row.charAt(j);\n if (c == 'S') {\n startR = i + 1;\n startC = j + 1;\n c = '.';\n }\n f[i + 1][j + 1] = c;\n }\n }\n out.println(solve(startR, startC));\n\t\t}\n\t}\n\t\n\tint solve(int startR, int startC) {\n int P = ni();\n String[] pat = new String[P];\n for (int i = 0; i < P; ++i) {\n pat[i] = ns();\n }\n Automaton automaton = new Automaton(pat);\n boolean[][][] visited = new boolean[N + 2][M + 2][automaton.nodes.size()];\n State initial = new State(startR, startC, 0);\n ArrayList<State> cur = new ArrayList<State>();\n cur.add(initial);\n visited[startR][startC][0] = true;\n int turn = 1;\n while (!cur.isEmpty()) {\n// System.err.println(\"turn:\" + turn);\n ArrayList<State> next = new ArrayList<State>();\n for (State st : cur) {\n for (int i = 0; i < 4; ++i) {\n int nr = st.r + DR[i];\n int nc = st.c + DC[i];\n if (f[nr][nc] == '#') continue;\n Node n = automaton.nodes.get(st.i).next[i];\n if (n == Automaton.terminal) continue;\n if (visited[nr][nc][n.idx]) continue;\n if (f[nr][nc] == 'G') return turn;\n visited[nr][nc][n.idx] = true;\n next.add(new State(nr, nc, n.idx));\n// System.err.println(\"nr:\" + nr + \" nc:\" + nc + \" idx:\" + n.idx);\n }\n }\n cur = next;\n ++turn;\n }\n return -1;\n }\n\n\tFastScanner in;\n\tPrintWriter out;\n\t\n\tvoid run() throws IOException {\n\t\tboolean oj;\n\t\ttry {\n\t\t\toj = ! System.getProperty(\"user.dir\").equals(\"F:\\\\java_workspace\\\\leetcode\");\n\t\t} catch (Exception e) {\n\t\t\toj = System.getProperty(\"ONLINE_JUDGE\") != null;\n\t\t}\n\t\t\n\t\tInputStream is = oj ? System.in : new FileInputStream(new File(INPUT));\n\t\tin = new FastScanner(is);\n\t\tout = new PrintWriter(System.out);\n\t\tlong s = System.currentTimeMillis();\n\t\tread();\n\t\tout.flush();\n\t\tif (!oj){\n\t\t\tSystem.out.println(\"[\" + (System.currentTimeMillis() - s) + \"ms]\");\n\t\t}\n\t}\n\t\n\tpublic boolean more(){\n\t\treturn in.hasNext();\n\t}\n\t\n\tpublic int ni(){\n\t\treturn in.nextInt();\n\t}\n\t\n\tpublic long nl(){\n\t\treturn in.nextLong();\n\t}\n\t\n\tpublic double nd(){\n\t\treturn in.nextDouble();\n\t}\n\t\n\tpublic String ns(){\n\t\treturn in.nextString();\n\t}\n\t\n\tpublic char nc(){\n\t\treturn in.nextChar();\n\t}\n\t\n\tclass FastScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\tboolean hasNext;\n\n\t\tpublic FastScanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t\thasNext = true;\n\t\t}\n\n\t\tpublic String nextToken() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\thasNext = false;\n\t\t\t\t\treturn \"##\";\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\t\t\n\t\tString next = null;\n\t\tpublic boolean hasNext(){\n\t\t\tnext = nextToken();\n\t\t\treturn hasNext;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Integer.parseInt(more);\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Long.parseLong(more);\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn Double.parseDouble(more);\n\t\t}\n\t\t\n\t\tpublic String nextString(){\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn more;\n\t\t}\n\t\t\n\t\tpublic char nextChar(){\n\t\t\tif (next == null){\n\t\t\t\thasNext();\n\t\t\t}\n\t\t\tString more = next;\n\t\t\tnext = null;\n\t\t\treturn more.charAt(0);\n\t\t}\n\t}\n\t\n\tstatic class ArrayUtils {\n\n\t\tpublic static void fill(int[][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tArrays.fill(f[i], value);\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void fill(int[][][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tfill(f[i], value);\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static void fill(int[][][][] f, int value) {\n\t\t\tfor (int i = 0; i < f.length; ++i) {\n\t\t\t\tfill(f[i], value);\n\t\t\t}\n\t\t}\n\t}\n}", "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\n\nint NODE_NUM;\n\nstruct Node{\n map<char, Node*> next;\n Node* fail;\n vector<int> match;\n\n int node_id;\n Node() : fail(NULL) {\n node_id = NODE_NUM++;\n }\n ~Node(){ for(auto p : next) if(p.second) delete p.second; }\n};\n\nNode *build(vector<string> pattens){\n // 1. trie木 をつくる\n Node* root = new Node();\n root->fail = root;\n for(int i = 0; i < pattens.size(); i++){\n Node* p = root;\n for(auto c : pattens[i]){\n if(p->next[c] == 0) p->next[c] = new Node();\n p = p->next[c];\n }\n p->match.push_back(i);\n }\n\n // 2. failure link を作る\n queue<Node*> que;\n for(int i = 0; i < 128; i++){\n if(!root->next[i]){\n root->next[i] = root;\n }else{\n root->next[i]->fail = root;\n que.push(root->next[i]);\n }\n\n }\n while(!que.empty()){\n Node* p = que.front(); que.pop();\n for(int i = 0; i < 128; i++) if(p->next[i]) {\n Node* np = p->next[i];\n\n // add que\n que.push(np);\n\n // search failure link\n Node* f = p->fail;\n while(!f->next[i]) f = f->fail;\n np->fail = f->next[i];\n\n // update matching list\n np->match.insert(np->match.end(), np->fail->match.begin(), np->fail->match.end());\n }\n }\n return root;\n}\n\n Node* next_node(Node* p, char c) {\n while(!p->next[c]) p = p->fail;\n return p->next[c];\n }\n\n// クエリにマッチしたパターンについて \n// (last index, pattern id)のリストを返す\ntypedef pair<int, int> P;\nvector<P> match(Node* root, string query){\n int n = query.size();\n vector<P> res;\n\n Node* p = root;\n REP(i, n) {\n int c = query[i];\n p = next_node(p, c);\n for(int k : p->match){\n res.push_back(P(i, k));\n }\n }\n\n return res;\n}\n\nstruct State{\n int x, y;\n Node* p;\n};\n\nint main(){\n const int dx[4] = {1, 0, -1, 0};\n const int dy[4] = {0, 1, 0, -1};\n const char dc[4]= {'R', 'D', 'L', 'U'};\n\n int H, W;\n while(cin >> H >> W && H > 0) {\n vector<string> grid(H);\n REP(y, H) cin >> grid[y];\n\n int sx, sy, gx, gy;\n REP(y, H) REP(x, W) if(grid[y][x] == 'S') sx = x, sy = y, grid[y][x] = '.';\n REP(y, H) REP(x, W) if(grid[y][x] == 'G') gx = x, gy = y, grid[y][x] = '.';\n\n int PN;\n cin >> PN;\n vector<string> pat(PN);\n REP(i, PN) cin >> pat[i];\n\n NODE_NUM = 0;\n Node* root = build(pat);\n\n assert(NODE_NUM <= 110);\n int dist[50][50][110] = {};\n REP(y, H) REP(x, W) REP(i, NODE_NUM) dist[y][x][i] = INT_MAX;\n\n queue<State> que;\n que.push({sx, sy, root});\n dist[sy][sx][root->node_id] = 0;\n while(!que.empty()) {\n State s = que.front(); que.pop();\n int d = dist[s.y][s.x][s.p->node_id];\n REP(r, 4) {\n int nx = s.x + dx[r];\n int ny = s.y + dy[r];\n if(0 <= nx && 0 <= ny && nx < W && ny < H) {\n if(grid[ny][nx] == '#') continue;\n Node* np = next_node(s.p, dc[r]);\n if(np->match.size() > 0) continue;\n if(dist[ny][nx][np->node_id] > d + 1) {\n dist[ny][nx][np->node_id] = d + 1;\n que.push({nx, ny, np});\n }\n }\n }\n }\n\n int ans = INT_MAX;\n REP(i, NODE_NUM) ans = min(ans, dist[gy][gx][i]);\n\n if(ans == INT_MAX) ans = -1;\n\n cout << ans << endl;\n\n }\n return 0;\n}", "#include <string>\n#include <vector>\n#include <queue>\n#include <cassert>\n#include <numeric>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nclass AhoCorasick{\n static const int ASIZE = 256;\n \n struct node_t {\n int ID;\n node_t *failure;\n node_t *output;\n node_t *next[ASIZE];\n std::vector<int> match;\n \n node_t(int id) : ID(id), failure(NULL), output(NULL){\n std::fill(next, next + ASIZE, (node_t*)NULL);\n }\n };\n\n size_t n_size;\n size_t length;\n node_t *root;\n node_t **nodes;\n \n inline node_t *new_node(){\n nodes[n_size] = new node_t(n_size);\n return nodes[n_size++];\n }\n \npublic:\n AhoCorasick(const std::vector<std::string> &pats) : n_size(0){\n length = accumulate(pats.begin(), pats.end(), std::string(\"\")).size();\n \n nodes = new node_t* [length + 1];\n root = new_node();\n \n // construct key word tree\n \n for(size_t i = 0; i < pats.size(); i++){\n node_t *v = root;\n for(size_t j = 0; j < pats[i].size(); j++){\n int c = pats[i][j];\n if(!v->next[c]) v->next[c] = new_node();\n v = v->next[c];\n }\n v->match.push_back(i);\n }\n \n // construct failure link and output link\n std::queue<node_t*> que;\n root->failure = root;\n root->output = root;\n\n que.push(root);\n while(!que.empty()){\n node_t *p = que.front(); que.pop();\n \n for(int x = 0; x < ASIZE; x++){\n if(!p->next[x]) continue;\n node_t *v = p->next[x];\n node_t *w = p->failure;\n \n if(p == root){\n v->failure = root;\n v->output = root;\n }else{\n while(w != root && !w->next[x]) w = w->failure;\n v->failure = w->next[x] ? w->next[x] : root;\n \n if(v->failure->match.empty()){\n v->output = v->failure->output;\n }else{\n v->output = v->failure;\n }\n }\n que.push(v);\n }\n }\n }\n\n ~AhoCorasick(){\n for(size_t i = 0; i < n_size; i++) delete nodes[i];\n delete [] nodes;\n }\n \n // initial state is always zero.\n size_t state_size() const{ return n_size; }\n int init_state() const{ return 0; }\n \n int next_state(size_t state, int c) const{\n assert(state < n_size);\n node_t *v = nodes[state];\n while(v != root && !v->next[c]) v = v->failure;\n v = v->next[c] ? v->next[c] : root;\n return v->ID;\n }\n\n std::vector<int> match(size_t state) const{\n assert(state < n_size);\n \n std::vector<int> res;\n for(node_t *v = nodes[state]; v != root; v = v->output){\n for(size_t i = 0; i < v->match.size(); i++){\n res.push_back(v->match[i]);\n }\n }\n return res;\n }\n \n};\n\n#include <cstring>\n#include <tuple>\n#include <queue>\nusing namespace std;\n\n\nint dist[60][60][110];\n\nint main(){\n int N, M, P, sr, sc, gr, gc;\n char field[60][60];\n\n int dr[] = {1, 0, -1, 0};\n int dc[] = {0, -1, 0, 1};\n char dir[] = {'D', 'L', 'U', 'R'};\n\n \n while(cin >> N >> M && N + M){\n\n for(int i = 0; i < N; i++){\n for(int j = 0; j < M; j++){\n cin >> field[i][j];\n if(field[i][j] == 'S'){\n sr = i;\n sc = j;\n }\n if(field[i][j] == 'G'){\n gr = i;\n gc = j;\n }\n }\n }\n \n cin >> P;\n vector<string> ps(P);\n for(int i = 0; i < P; i++) cin >> ps[i];\n AhoCorasick aho(ps);\n\n memset(dist, -1, sizeof(dist));\n\n \n queue<tuple<int, int, int>> que;\n que.push(make_tuple(sr, sc, aho.init_state()));\n dist[sr][sc][aho.init_state()] = 0;\n\n bool ok = false;\n \n while(!que.empty()){\n int r, c, s;\n std::tie(r, c, s) = que.front(); que.pop();\n \n if(r == gr && c == gc){\n cout << dist[r][c][s] << endl;\n ok = true;\n break;\n }\n\n for(int i = 0; i < 4; i++){\n int nr = r + dr[i];\n int nc = c + dc[i];\n int ns = aho.next_state(s, dir[i]);\n \n if(!aho.match(ns).empty()) continue;\n \n if(0 <= nr && nr < N && 0 <= nc && nc < M &&\n field[nr][nc] != '#' && dist[nr][nc][ns] == -1)\n {\n dist[nr][nc][ns] = dist[r][c][s] + 1;\n que.push(make_tuple(nr, nc, ns));\n }\n \n }\n }\n if(!ok) cout << -1 << endl;\n \n }\n}", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <set>\n#include <queue>\n#include <map>\n#include <fstream>\nusing namespace std;\n\n\nclass Sit{\npublic:\n\tint x,y;\n\tint cur;\n};\n\n/*\n * ƒRƒ“ƒXƒgƒ‰ƒNƒ^‚ÉŽ«‘•¶Žš—ñ‚ð“n‚µ‚Ätry tree‚ðì¬\n * ‚»‚ÌŒã‚ÍŠeŽí’TõŠÖ”‚ðŒÄ‚яo‚µ‚āA–؂ɑ΂µ‚Ä’Tõ‚ð‚©‚¯‚邱‚Æ‚ª‚Å‚«‚é\n */\nclass AhoCorasick{\nprivate:\n\tstatic const int MAX_V=10001;\nprivate:\n\tmap<string,int> _dict;\n\tstring idToStr[MAX_V];\n\tint _vertex;\n\t// Œ»Ý‚Ì•¶Žš—ñ‚©‚玟‚Í‚Ç‚Ì•¶Žš—ñ‚Ö‘JˆÚ‚Å‚«‚é‚©\n\tmap<int,set<int> > _stepPrv;\n\t// ’TõŽ¸”s‚µ‚½ê‡‚É–ß‚éƒm[ƒh\n\tmap<int,int> _stepBack;\n\t// Ž«‘•¶Žš—ñ‚̏W‡\n\tset<int> _dictStr;\n\t// “_‚ɏî•ñ‚ð•t‰Á‚µ‚½‚¢Žž‚Ì‚ÝŽg—p\n\t//T _vertexInfos[MAX_V];\npublic:\n\t//AhoCorasick();\n\tAhoCorasick(const vector<string> inStrings):_vertex(1){\n\t\tfor(int i=0;i<inStrings.size();i++){\n\t\t\tif(_dict.find(inStrings[i])==_dict.end()){\n\t\t\t\tidToStr[_vertex]=inStrings[i];\n\t\t\t\t_dict[inStrings[i]]=_vertex++;\n\t\t\t\t_dictStr.insert(_vertex-1);\n\t\t\t}\n\t\t}\n\t\tmakeTree(inStrings);\n\t}\n\tint getStrId(string s){\n\t\tif(_dict.find(s)==_dict.end())return -1;\n\t\treturn _dict[s];\n\t}\n\tint getVetex(){\n\t\treturn _vertex;\n\t}\n\t// Œ»Ý‚Ì•¶Žš—ñ‚ðŠO‚©‚ç—^‚¦A‚P•¶Žš‚¸‚Â’Tõ\n\tbool isMatchOneByOne(char ch,int &cur){\n\t\t// •K—v‚Å‚ ‚ê‚΁A‚±‚±‚Åcur‚ªdict“à‚É‘¶Ý‚µ‚È‚¢‚©ƒ`ƒFƒbƒN\n\t\t/*\n\t\t*/\n\t\twhile(1){\n\t\t\tint nxt=cur;\n\t\t\tstring nstr=idToStr[nxt];\n\t\t\tnstr+=ch;\n\t\t\tnxt=_dict[nstr];\n\t\t\t// ‚à‚µ¡‚̏ꏊ‚©‚玟‚̏ꏊ‚Ö‘JˆÚ‰Â”\\‚È‚ç‚Î\n\t\t\tif(_stepPrv.find(cur)!=_stepPrv.end()&&_stepPrv[cur].find(nxt)!=_stepPrv[cur].end()){\n\t\t\t\t// ¡‰ñ‚̏ꏊ‚©‚ç–ß‚ê‚éêŠ‚ŁAƒ}ƒbƒ`‚·‚é‚à‚Ì‚ª‚ ‚é‚©‚ðƒ`ƒFƒbƒN\n\t\t\t\tint tmpStr=nxt;\n\t\t\t\twhile(tmpStr!=0){\n\t\t\t\t\tif(_dictStr.find(tmpStr)!=_dictStr.end())return true;\n\t\t\t\t\ttmpStr=_stepBack[tmpStr];\n\t\t\t\t}\n\t\t\t\tcur=nxt;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t// ‚»‚¤‚Å‚È‚¯‚ê‚΁A–ß‚Á‚ÄŽŸ‚̃‹[ƒv‚ōĂђTõ‚ðs‚¤\n\t\t\telse{\n\t\t\t\t// root‚ÅŒ©‚‚©‚ç‚È‚¯‚ê‚΁AI—¹\n\t\t\t\tif(cur==0)return false;\n\t\t\t\t// Œ»Ý’Tõ’†‚Ì•¶Žš—ñ‚̓m[ƒh‚É‘¶Ý‚µ‚È‚¢\n\t\t\t\telse if(_stepBack.find(cur)==_stepBack.end())cur=0;\n\t\t\t\telse{\n\t\t\t\t\t// root‚Å‚È‚¢ê‡‚́A–ß‚Á‚č¡‰ñ‚Ì•¶Žš‚ð‚à‚¤ˆê“xŒ©‚é\n\t\t\t\t\tcur=_stepBack[cur];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// ‚à‚µŽ«‘“à‚Ì•¶Žš—ñ‚ªŒ©‚‚©‚ê‚Îtrue\n\t\tif(_dictStr.find(cur)!=_dictStr.end())return true;\n\t\treturn false;\n\t}\n\n\t// ­‚È‚­‚Æ‚àˆê‰ÓŠƒ}ƒbƒ`‚µ‚½‚çtrue\n\tbool isMatchLeastOne(const string &s){\n\t\tint cur=0;\n\t\tfor(int i=0;i<(int)s.size();i++){\n\t\t\tstring cstr=idToStr[cur];\n\t\t\tstring nstr=cstr+s[i];\n\t\t\t//\n\t\t\tint nxt=_dict[nstr];\n\t\t\t// ‚à‚µ¡‚̏ꏊ‚©‚玟‚̏ꏊ‚Ö‘JˆÚ‰Â”\\‚È‚ç‚Î\n\t\t\tif(_stepPrv.find(cur)!=_stepPrv.end()&&_stepPrv[cur].find(nxt)!=_stepPrv[cur].end()){\n\t\t\t\tcur=nxt;\n\t\t\t\tint tmpStr=nxt;\n\t\t\t\t// –ß‚Á‚Ä’Tõ\n\t\t\t\twhile(tmpStr!=0){\n\t\t\t\t\tif(_dictStr.find(tmpStr)!=_dictStr.end())return true;\n\t\t\t\t\ttmpStr=_stepBack[tmpStr];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ‚»‚¤‚Å‚È‚¯‚ê‚΁A–ß‚Á‚ÄŽŸ‚̃‹[ƒv‚ōĂђTõ‚ðs‚¤\n\t\t\telse{\n\t\t\t\t// root‚ÅŒ©‚‚©‚ç‚È‚¯‚ê‚΁A¡‰ñ‚Ì•¶Žš‚Í”ò‚΂·\n\t\t\t\tif(cur==0)continue;\n\t\t\t\telse if(_stepBack.find(cur)==_stepBack.end())cur=0;\n\t\t\t\telse{\n\t\t\t\t\t// root‚Å‚È‚¢ê‡‚́A–ß‚Á‚č¡‰ñ‚Ì•¶Žš‚ð‚à‚¤ˆê“xŒ©‚é\n\t\t\t\t\ti--;\n\t\t\t\t\tcur=_stepBack[cur];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ‚à‚µŽ«‘“à‚Ì•¶Žš—ñ‚ªŒ©‚‚©‚ê‚Îtrue\n\t\t\tif(_dictStr.find(cur)!=_dictStr.end())return true;\n\t\t}\n\t\treturn false;\n\t}\nprivate:\n\t// ƒRƒs[ƒRƒ“ƒXƒgƒ‰ƒNƒ^‚ƁA‘ã“ü‰‰ŽZŽq‚ÍŽg—p‹ÖŽ~‚É‚·‚é\n\tAhoCorasick(const AhoCorasick&ah);\n\tAhoCorasick &operator=(const AhoCorasick&ah);\nprivate:\n\t// O(size(_dict)^2+size(_dict)*avg(strSize))\n\tvoid makeTree(const vector<string> &inStrings){\n\t\t// 0‚Ü‚½‚͋󕶎š—ñ‚ªƒ‹[ƒgƒm[ƒh\n\t\t_dict[\"\"]=0;\n\t\tidToStr[0]=\"\";\n\t\tfor(int i=0;i<(int)inStrings.size();i++){\n\t\t\tfor(int j=0;j<(int)inStrings[i].size();j++){\n\t\t\t\tstring s=inStrings[i].substr(0,j+1);\n\t\t\t\t// ‚Ü‚¾’ljÁ‚³‚ê‚Ä‚¢‚È‚¢‚Ì‚Å‚ ‚ê‚΁A’ljÁ‚·‚é\n\t\t\t\tif(_dict.find(s)==_dict.end()){\n\t\t\t\t\tidToStr[_vertex]=s;\n\t\t\t\t\t_dict[s]=_vertex++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// ’Tõ‚ð‘O‚ɐi‚ß‚é•ûŒü‚ÖƒGƒbƒW‚ðŒ‹‚Ô\n\t\tfor(map<string,int>::iterator it=_dict.begin();it!=_dict.end();it++){\n\t\t\tfor(map<string,int>::iterator iit=_dict.begin();iit!=_dict.end();iit++){\n\t\t\t\tif(it==iit)continue;\n\t\t\t\t// ‚à‚µiit->first‚ªsize(it->first)+1•¶Žš‚ō\\¬‚³‚ê‚é‚È‚ç‚΁AƒGƒbƒW‚ðˆø‚­\n\t\t\t\tif(it->first.size()==iit->first.size()-1\n\t\t\t\t\t\t&&it->first==iit->first.substr(0,it->first.size())){\n\t\t\t\t\t_stepPrv[it->second].insert(iit->second);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// ’Tõ‚ðŒã‚ë‚֐i‚ß‚é•ûŒü‚ÖƒGƒbƒW‚ðŒ‹‚Ô\n\t\tfor(map<string,int>::iterator it=_dict.begin();it!=_dict.end();it++){\n\t\t\tif(it->first==\"\")continue;\n\t\t\t// Œ»Ý‚Ì•¶Žš—ñ‚©‚çæ“ªi•¶Žš‚ðŽæ‚菜‚¢‚½‚à‚Ì‚Ö–ß‚ê‚é‚©‡”ԂɃ`ƒFƒbƒN\n\t\t\t// –ß‚ê‚È‚¯‚ê‚΃‹[ƒg‚Ö–ß‚é\n\t\t\tbool ok=false;\n\t\t\tfor(int i=0;i<(int)it->first.size()-1;i++){\n\t\t\t\tstring s=it->first.substr(i+1);\n\t\t\t\tif(_dict.find(s)!=_dict.end()){\n\t\t\t\t\t_stepBack[it->second]=_dict[s];\n\t\t\t\t\tok=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ƒ‹[ƒg‚Ö–ß‚é\n\t\t\tif(!ok)_stepBack[it->second]=0;\n\t\t}\n\t}\n};\n\nint h,w;\nint n;\nchar field[51][51];\nstring prohibits[20];\nint sy,sx,gx,gy;\nset<int> used[51][51];\n\nconst int dy[]={-1,0,1,0};\nconst int dx[]={0,1,0,-1};\n\nint bfs(){\n\tvector<string> vs;\n\tfor(int i=0;i<n;i++)vs.push_back(prohibits[i]);\n\tAhoCorasick ac(vs);\n\tSit init;\n\tinit.x=sx;\n\tinit.y=sy;\n\tinit.cur=0;\n\tqueue<Sit> q[2];\n\tint cur=0;\n\tint nxt=1;\n\tq[cur].push(init);\n\tused[init.y][init.x].insert(0);\n\tint cnt=0;\n\twhile(q[cur].size()){\n\t\twhile(q[cur].size()){\n\t\t\tSit s=q[cur].front();\n\t\t\tq[cur].pop();\n\t\t\tif(s.y==gy&&s.x==gx)return cnt;\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tint ny=s.y+dy[i];\n\t\t\t\tint nx=s.x+dx[i];\n\t\t\t\tif(ny>=0&&nx>=0&&ny<h&&nx<w&&field[ny][nx]=='.'){\n\t\t\t\t\tchar ch=i+'0';\n\t\t\t\t\tSit nsit;\n\t\t\t\t\tnsit.y=ny;nsit.x=nx;\n\t\t\t\t\tnsit.cur=s.cur;\n\t\t\t\t\tbool b=ac.isMatchOneByOne(ch,nsit.cur);\n\t\t\t\t\t// match‚µ‚½‚çA‘JˆÚ‚µ‚È‚¢\n\t\t\t\t\tif(b)continue;\n\t\t\t\t\t// nsit.cur‚̃m[ƒh‚Ö‚·‚Å‚É’B‚µ‚½‚©‚Ç‚¤‚©\n\t\t\t\t\tif(used[ny][nx].find(nsit.cur)==used[ny][nx].end()){\n\t\t\t\t\t\tq[nxt].push(nsit);\n\t\t\t\t\t\tused[ny][nx].insert(nsit.cur);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt++;\n\t\tswap(cur,nxt);\n\t}\n\treturn -1;\n}\n\nint main(){\n\n\twhile(cin>>h>>w&&(h|w)){\n\t\tfor(int i=0;i<h;i++)for(int j=0;j<w;j++)used[i][j].clear();\n\t\tfor(int i=0;i<h;i++){\n\t\t\tfor(int j=0;j<w;j++){\n\t\t\t\tcin>>field[i][j];\n\t\t\t\tif(field[i][j]=='S'){\n\t\t\t\t\tsy=i;\n\t\t\t\t\tsx=j;\n\t\t\t\t\tfield[i][j]='.';\n\t\t\t\t}\n\t\t\t\telse if(field[i][j]=='G'){\n\t\t\t\t\tgy=i;\n\t\t\t\t\tgx=j;\n\t\t\t\t\tfield[i][j]='.';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin>>n;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>prohibits[i];\n\t\t\tfor(int j=0;j<(int)prohibits[i].size();j++){\n\t\t\t\tif(prohibits[i][j]=='U')prohibits[i][j]='0';\n\t\t\t\telse if(prohibits[i][j]=='R')prohibits[i][j]='1';\n\t\t\t\telse if(prohibits[i][j]=='D')prohibits[i][j]='2';\n\t\t\t\telse if(prohibits[i][j]=='L')prohibits[i][j]='3';\n\t\t\t}\n\t\t}\n\t\tint res=bfs();\n\t\tcout<<res<<endl;\n\t}\n\treturn 0;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\n/* Aho Corasick */\n\nint ACNodeId = 0;\n\nstruct ACNode{\n int val, id;\n ACNode *next[26], *failure;\n \n ACNode():val(0) {\n memset(next,0,sizeof(next));\n id = ACNodeId++;\n }\n \n void insert(char *s){\n if(!*s){ val++; return; }\n int al = *s-'A';\n if(next[al]==NULL) next[al] = new ACNode;\n next[al]->insert(s+1);\n }\n\n ACNode *nextNode(char c){\n int al = c - 'A';\n if (next[al]) return next[al];\n return failure == this ? this : failure->nextNode(c);\n }\n};\n\nstruct AhoCorasick{\n ACNode *node;\n\n AhoCorasick(){node = new ACNode;}\n \n void insert(char *s) {\n node->insert(s);\n }\n \n void build() {\n queue<ACNode*> que;\n que.push(node);\n node->failure = node;\n \n while(que.size()){\n ACNode *p = que.front();\n que.pop();\n \n for(int i=0;i<26;i++){\n if(p->next[i]){\n ACNode *failure = p->failure;\n while(!failure->next[i] && failure != node){\n failure = failure->failure;\n }\n if (failure->next[i] && failure != p){\n p->next[i]->failure = failure->next[i];\n p->next[i]->val += failure->next[i]->val;\n }else{\n p->next[i]->failure = node;\n }\n que.push(p->next[i]);\n }\n }\n }\n }\n};\n\nint dx[8] = {0,0,1,-1,1,1,-1,-1};\nint dy[8] = {1,-1,0,0,1,-1,1,-1};\nchar ds[] = \"DURL\";\n\nbool solve(){\n int h, w;\n char s[51][51];\n int sx, sy, gx, gy;\n \n scanf(\"%d%d\", &h, &w);\n\n if(h == 0) return false;\n \n for(int i=0;i<h;i++){\n scanf(\"%s\", s[i]);\n for(int j=0;j<w;j++){\n if(s[i][j] == 'S'){\n sx = j; sy = i;\n }\n if(s[i][j] == 'G'){\n gx = j; gy = i;\n }\n }\n }\n\n int q;\n AhoCorasick ac;\n scanf(\"%d\", &q);\n\n for(int i=0;i<q;i++){\n char pattern[11];\n scanf(\"%s\", pattern);\n ac.insert(pattern);\n }\n\n ac.build();\n\n bool visited[51][51][200] = {};\n queue<pair<pair<int,int>,ACNode*> > que;\n que.push({{sy, sx}, ac.node});\n \n for(int i=0;que.size();i++){\n queue<pair<pair<int,int>,ACNode*> > que2;\n\n while(que.size()){\n auto p = que.front(); que.pop();\n\n int y = p.first.first;\n int x = p.first.second;\n ACNode* cur = p.second;\n\n if(cur->val) continue;\n if(y < 0 || h <= y || x < 0 || w <= x) continue;\n if(s[y][x] == '#') continue;\n if(visited[y][x][cur->id]) continue;\n visited[y][x][cur->id] = true;\n\n if(gy == y && gx == x){\n printf(\"%d\\n\", i);\n return true;\n }\n \n for(int j=0;j<4;j++){\n auto next = cur->nextNode(ds[j]);\n que2.push({{dy[j] + y, dx[j] + x}, next});\n }\n }\n \n que = que2;\n }\n \n puts(\"-1\");\n return true;\n}\n\nint main(){\n while(solve());\n}\n\n", "#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <complex>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\n#include <cassert>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define eps 1e-9\n#define INF 2000000000\n#define sz(x) ((int)(x).size())\n#define fi first\n#define sec second\n#define SORT(x) sort((x).begin(),(x).end())\n#define all(x) (x).begin(),(x).end()\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)\n#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)\n#define EQ(a,b) (abs((a)-(b))<eps)\n\n// Aho-Corasick\n\n#define SIZE 256\n\nstruct Trie{\n\tTrie* child[SIZE];\n\tTrie* fail;\n\tvector<int> matched;\n\tTrie(){\n\t\tfor(int i=0;i<SIZE;i++)child[i]=NULL;\n\t\tfail = NULL;\n\t}\n\t~Trie(){}\n};\nTrie pool[5000];\nint pool_pos;\ninline Trie* alloc(){return &(pool[pool_pos++]=Trie());}\ninline void destruct(){pool_pos=0;}\nvector<int> unite(const vector<int> &a,const vector<int> &b){\n\tvector<int> ret;\n\tset_union(all(a),all(b),back_inserter(ret));\n\treturn ret;\n}\nTrie* build(vector<string> pattern){\n\tTrie *root = alloc();\n\tTrie *now;\n\troot->fail = root;\n\tfor(int i=0;i<pattern.size();i++){\n\t\tnow = root;\n\t\tfor(int j=0;j<pattern[i].size();j++){\n\t\t\tint idx = (int)pattern[i][j];\n\t\t\tif(now->child[idx]==NULL){\n\t\t\t\tnow->child[idx]=alloc();\n\t\t\t}\n\t\t\tnow = now->child[idx];\n\t\t}\n\t\tnow->matched.pb(i);\n\t}\n\tqueue<Trie*> q;\n\tfor(int i=0;i<SIZE;i++){\n\t\tif((root->child[i])==NULL)root->child[i]=root;\n\t\telse{\n\t\t\troot->child[i]->fail=root;\n\t\t\tq.push(root->child[i]);\n\t\t}\n\t}\n\twhile(!q.empty()){\n\t\tnow = q.front();q.pop();\n\t\tfor(int i=0;i<SIZE;i++){\n\t\t\tif(now->child[i]){\n\t\t\t\tTrie *next = now->fail;\n\t\t\t\twhile((next->child[i])==NULL)next=next->fail;\n\t\t\t\tnow->child[i]->fail = next->child[i];\n\t\t\t\tnow->child[i]->matched = unite(now->child[i]->matched,next->child[i]->matched);\n\t\t\t\tq.push(now->child[i]);\n\t\t\t}\n\t\t}\n\t}\n\treturn root;\n}\n// now???????????????????????????????????¨??§?¶?????????????????´¢??????\n// ret???pattern???????´???°??§????????????????????¨???\n// now????????§??????????????§????????????????????????????????¨???\nvoid match(Trie* &now,const string s,vector<int> &ret){\n\tfor(int i=0;i<s.size();i++){\n\t\tint idx = s[i];\n\t\twhile((now->child[idx])==NULL)now=now->fail;\n\t\tnow=now->child[idx];\n\t\tfor(int j=0;j<(now->matched.size());j++){\n\t\t\tret[now->matched[j]]=1;\n\t\t}\n\t}\n}\nstruct state{\n\tP pos;\n\tTrie* trie;\n\tint turn;\n\tstate(P pos,Trie* trie,int turn):pos(pos),trie(trie),turn(turn){}\n};\nint dx[4]={0,-1,0,1};\nint dy[4]={1,0,-1,0};\nstring dv[4]={\"D\",\"L\",\"U\",\"R\"};\nstring f[55];\nint main(){\n\twhile(1){\n\t\tint n,m,p;\n\t\tP S,G;\n\t\tset<Trie*> s[55][55];\n\t\tscanf(\"%d %d\",&n,&m);\n\t\tif(n==0&&m==0)break;\n\t\tfor(int i=0;i<n;i++)cin >> f[i];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tif(f[i][j]=='S'){S=P(j,i);}\n\t\t\t\tif(f[i][j]=='G'){G=P(j,i);}\n\t\t\t}\n\t\t}\n\t\tscanf(\"%d\",&p);\n\t\tvector<string> pat(p);\n\t\tfor(int i=0;i<p;i++)cin >> pat[i];\n\t\tdestruct();\n\t\tTrie* root = build(pat);\n\t\t/*while(1){\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\tvector<int> v(p,0);\n\t\t\tTrie* r = root;\n\t\t\tmatch(r,s,v);\n\t\t\tint flag = 0;\n\t\t\tfor(int i=0;i<p;i++)flag|=v[i];\n\t\t\tif(flag)printf(\"exist\\n\");\n\t\t\telse printf(\"not exist\\n\");\n\t\t}*/\n\t\tqueue<state> q;\n\t\tq.push(state(S,root,0));\n\t\tint ans = -1;\n\t\twhile(!q.empty()){\n\t\t\tstate now = q.front(); q.pop();\n\t\t\tif(now.pos == G){ans = now.turn;break;}\n\t\t\tint x = now.pos.fi , y = now.pos.sec;\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tint nx = x + dx[i];\n\t\t\t\tint ny = y + dy[i];\n\t\t\t\tif(nx<0||nx>=m||ny<0||ny>=n)continue;\n\t\t\t\tif(f[ny][nx]=='#')continue;\n\t\t\t\tvector<int> v(p,0);\n\t\t\t\tTrie* t = now.trie;\n\t\t\t\tmatch(t,dv[i],v);\n\t\t\t\tint flag = 0;\n\t\t\t\tfor(int j=0;j<p;j++)flag|=v[j];\n\t\t\t\tif(flag)continue;\n\t\t\t\tif(s[nx][ny].find(t)==s[nx][ny].end()){\n\t\t\t\t\ts[nx][ny].insert(t);\n\t\t\t\t\tq.push(state(P(nx,ny),t,now.turn+1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}", "// 12:17 - 13:14\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cstdio>\n#include<cassert>\n#include<climits>\n#include<map>\n#include<queue>\n#include<set>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX_SP 15\n#define MAX_LEN 60\n\nusing namespace std;\n\ntypedef pair<int,int> ii;\nstruct Data{\n int cur,cost;\n ii info;\n string debug;\n Data(int cur=IINF,int cost=IINF,ii info=ii(IINF,IINF),string debug=\"$$$\"):cur(cur),cost(cost),info(info),debug(debug){}\n bool operator < (const Data& a)const{\n return cost > a.cost;\n }\n};\n\nint h,w,sp,gp,P;\nchar G[MAX_LEN][MAX_LEN];\n/*\n next_state[index][the number of match]\n 0 -> empty\n 1 -> spell[0]\n 2 -> spell[1]\n ...\n */\nii next_state[MAX_SP][MAX_SP][4];\nint mincost[MAX_LEN*MAX_LEN][MAX_SP][MAX_SP];\nstring spell[MAX_SP];\nint dx[] = {+0,+1,+0,-1};\nint dy[] = {-1,+0,+1,+0};\nchar dc[] = {'U','R','D','L'};\n\nii getValue(string s){\n rep(i,P+1){\n int cur = 0;\n rep(j,spell[i].size()){\n if(s[cur] != spell[i][j]){\n\tbreak;\n } \n\n cur++;\n if(cur >= s.size()){\n\treturn ii(i,j+1);\n }\n }\n }\n return ii(0,0);\n}\n\nvoid INIT(){\n rep(i,MAX_SP)rep(j,MAX_SP)rep(k,4)next_state[i][j][k] = ii(0,0);\n\n rep(i,P+1){\n rep(j,spell[i].size()+1){\n rep(dir,4){\n\trep(k,j+1){\n\t ii value = getValue(spell[i].substr(0,j).substr(k)+dc[dir]);\n\t if(value != ii(0,0) && next_state[i][j][dir].second < value.second){\n\t next_state[i][j][dir] = value;\n\t }\n\t}\n }\n }\n }\n}\n\ninline bool isValid(int x,int y){\n return ( 0 <= x && x < w && 0 <= y && y < h );\n}\n\nvoid compute(){\n\n priority_queue<Data> Q;\n Q.push(Data(sp,0,ii(0,0)));\n rep(i,h*w)rep(j,MAX_SP)rep(k,MAX_SP)mincost[i][j][k] = IINF;\n mincost[sp][0][0] = 0;\n\n while(!Q.empty()){\n\n Data data = Q.top(); Q.pop();\n //cout << \"(\" << data.cur % w << \",\" << (int)(data.cur / w) << \") \" << data.cost << \" info(\" << data.info.first << \",\" << data.info.second << \")\" << endl;\n\n if(data.cur == gp){\n //cout << \"path : \" << data.debug << endl;\n cout << data.cost << endl;\n return;\n }\n\n rep(dir,4){\n\n int nx = data.cur % w + dx[dir];\n int ny = data.cur / w + dy[dir];\n \n if(!isValid(nx,ny))continue;\n \n if(G[ny][nx] == '#')continue;\n \n ii next = next_state[data.info.first][data.info.second][dir];\n \n if(next.first != 0 && spell[next.first].size() == next.second)continue;\n \n if(mincost[nx+ny*w][next.first][next.second] > data.cost + 1){\n\tmincost[nx+ny*w][next.first][next.second] = data.cost + 1;\n\tQ.push(Data(nx+ny*w,data.cost+1,next,data.debug+dc[dir]));\n }\n \n }\n \n }\n cout << -1 << endl;\n}\n\nbool cmp(const string& a,const string& b){\n return a.size() < b.size();\n}\n\nint main(){\n while(cin >> h >> w,h|w){\n rep(i,h){\n rep(j,w){\n\tcin >> G[i][j];\n\tif(G[i][j] == 'S'){\n\t sp = j + i * w;\n\t}\n\telse if(G[i][j] == 'G'){\n\t gp = j + i * w;\n\t}\n }\n }\n cin >> P;\n spell[0].clear();\n vector<string> tmp;\n rep(i,P){\n cin >> spell[i+1];\n tmp.push_back(spell[i+1]);\n }\n\n sort(tmp.begin(),tmp.end(),cmp);\n\n bool out[tmp.size()];\n rep(i,tmp.size())out[i] = false;\n rep(i,tmp.size()){\n REP(j,i+1,tmp.size()){\n\tbool check = true;\n\t\n\tif(tmp[j].find(tmp[i]) == string::npos){\n\t check = false;\n\t}\n\n\tif(check){\n\t out[j] = true;\n\t}\n }\n }\n\n vector<string> tmp2;\n rep(i,tmp.size())if(!out[i]){\n tmp2.push_back(tmp[i]);\n }\n P = tmp2.size();\n rep(i,P){\n spell[i+1] = tmp2[i];\n }\n\n INIT();\n /*\n rep(i,P+1){\n cout << \"spell[\" << i<< \"] = \" << spell[i] << endl;\n rep(j,spell[i].size()+1){\n\trep(dir,4){\n\t cout << \"next_state[\" << i << \"][\" << j << \"][\" << dir << \"] => \" << \" | \" << spell[i].substr(0,j) << \" + \" << dc[dir]<< \" | \" <<\" next = (\" << next_state[i][j][dir].first << \",\" << next_state[i][j][dir].second << \")\" << endl; \n\t}\n }\n }\n */\n\n compute();\n\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n\n\ntemplate<size_t X>\nstruct Trie{\n struct Node{\n char c;\n array<int, X> nxt;\n vector<int> idxs;\n int idx;\n Node(char c):c(c),idx(-1){fill(nxt.begin(),nxt.end(),-1);}\n };\n\n using F = function<int(char)>;\n vector<Node> vs;\n F conv;\n\n Trie(F conv,char c='$'):conv(conv){vs.emplace_back(c);}\n\n void add(const string &s,int x){\n int pos=0;\n for(int i=0;i<(int)s.size();i++){\n int k=conv(s[i]);\n if(~vs[pos].nxt[k]){\n pos=vs[pos].nxt[k];\n continue;\n }\n int npos=vs.size();\n vs[pos].nxt[k]=npos;\n vs.emplace_back(s[i]);\n pos=npos;\n }\n vs[pos].idx=x;\n vs[pos].idxs.emplace_back(x);\n }\n\n int find(const string &s){\n int pos=0;\n for(int i=0;i<(int)s.size();i++){\n int k=conv(s[i]);\n if(vs[pos].nxt[k]<0) return -1;\n pos=vs[pos].nxt[k];\n }\n return pos;\n }\n\n int find(int pos,char c){\n return vs[pos].nxt[conv(c)];\n }\n\n int idx(int pos){\n return pos<0?-1:vs[pos].idx;\n }\n\n vector<int> idxs(int pos){\n return pos<0?vector<int>():vs[pos].idxs;\n }\n\n};\n\n\ntemplate<size_t X>\nstruct AhoCorasick : Trie<X+1>{\n using TRIE = Trie<X+1>;\n using TRIE::TRIE;\n vector<int> cnt;\n\n void build(bool heavy=true){\n auto &vs=TRIE::vs;\n int n=vs.size();\n cnt.resize(n);\n for(int i=0;i<n;i++){\n if(heavy) sort(vs[i].idxs.begin(),vs[i].idxs.end());\n cnt[i]=vs[i].idxs.size();\n }\n\n queue<int> que;\n for(int i=0;i<(int)X;i++){\n if(~vs[0].nxt[i]){\n vs[vs[0].nxt[i]].nxt[X]=0;\n que.emplace(vs[0].nxt[i]);\n }else{\n vs[0].nxt[i]=0;\n }\n }\n\n while(!que.empty()){\n auto &x=vs[que.front()];\n cnt[que.front()]+=cnt[x.nxt[X]];\n que.pop();\n for(int i=0;i<(int)X;i++){\n if(x.nxt[i]<0){\n x.nxt[i]=vs[x.nxt[X]].nxt[i];\n continue;\n }\n int fail=x.nxt[X];\n vs[x.nxt[i]].nxt[X]=vs[fail].nxt[i];\n if(heavy){\n auto &idx=vs[x.nxt[i]].idxs;\n auto &idy=vs[vs[fail].nxt[i]].idxs;\n vector<int> idz;\n set_union(idx.begin(),idx.end(),\n idy.begin(),idy.end(),\n back_inserter(idz));\n idx=idz;\n }\n que.emplace(x.nxt[i]);\n }\n }\n }\n\n vector<int> match(string s,int heavy=true){\n auto &vs=TRIE::vs;\n vector<int> res(heavy?TRIE::size():1);\n int pos=0;\n for(auto &c:s){\n pos=vs[pos].nxt[TRIE::conv(c)];\n if(heavy) for(auto &x:vs[pos].idxs) res[x]++;\n else res[0]+=cnt[pos];\n }\n return res;\n }\n\n int move(int pos,char c){\n auto &vs=TRIE::vs;\n assert(pos<(int)vs.size());\n return vs[pos].nxt[TRIE::conv(c)];\n }\n\n int count(int pos){\n return cnt[pos];\n }\n\n int size(){return TRIE::vs.size();}\n};\n\n//INSERT ABOVE HERE\nint dp[111][55][55];\nsigned main(){\n int h,w;\n while(cin>>h>>w,h){\n vector<string> ss(h);\n for(int i=0;i<h;i++) cin>>ss[i];\n int p;\n cin>>p;\n vector<string> ps(p);\n for(int i=0;i<p;i++) cin>>ps[i];\n auto conv=\n [&](char c){\n if(c=='U') return 0;\n if(c=='R') return 1;\n if(c=='D') return 2;\n if(c=='L') return 3;\n return -1;\n };\n AhoCorasick<4> aho(conv);\n for(int i=0;i<p;i++) aho.add(ps[i],i);\n aho.build(false);\n\n memset(dp,-1,sizeof(dp));\n using T = tuple<int, int, int>;\n queue<T> que;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(ss[i][j]=='S'){\n dp[0][i][j]=0;\n que.emplace(0,i,j);\n }\n }\n }\n\n string base=\"URDL\";\n int dy[]={-1,0,1,0};\n int dx[]={0,1,0,-1};\n auto in=[&](int y,int x){return 0<=y&&y<h&&0<=x&&x<w;};\n\n int ans=-1;\n while(!que.empty()){\n int p,y,x;\n tie(p,y,x)=que.front();que.pop();\n if(ss[y][x]=='G'){\n ans=dp[p][y][x];\n break;\n }\n for(int k=0;k<4;k++){\n int ny=y+dy[k],nx=x+dx[k];\n if(!in(ny,nx)||ss[ny][nx]=='#') continue;\n char c=base[k];\n int q=aho.move(p,c);\n if(aho.count(q)) continue;\n if(~dp[q][ny][nx]) continue;\n dp[q][ny][nx]=dp[p][y][x]+1;\n que.emplace(q,ny,nx);\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}\n\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;++i)\nusing namespace std;\n\nint n,m;\nstring maze[55];\n\nint fg[110][5],ac[110];\n\nchar dir[5]={' ','U','R','D','L'};\nint di[5]={0,-1,0,1,0};\nint dj[5]={0,0,1,0,-1};\n\nint build(vector<string> pattern){\n\tmemset(fg,-1,sizeof(fg));\n\tmemset(ac,0,sizeof(ac));\n\tint root=0,size=1;\n\tfg[root][0]=root;\n\n\trep(i,pattern.size()){\n\t\tint cur=root;\n\t\trep(j,pattern[i].size()){\n\t\t\tint tar=1;\n\t\t\trep(k,5) if(dir[k]==pattern[i][j]) tar=k;\n\t\t\tif(fg[cur][tar]==-1) fg[cur][tar]=size++;\n\t\t\tcur=fg[cur][tar];\n\t\t}\n\t\tac[cur]++;\n\t}\n\n\tqueue<int> q;\n\tfor(int i=1;i<=4;++i){\n\t\tif(fg[root][i]>=0){\n\t\t\tfg[fg[root][i]][0]=root;\n\t\t\tq.push(fg[root][i]);\n\t\t}else\n\t\t\tfg[root][i]=root;\n\t}\n\twhile(!q.empty()){\n\t\tint now=q.front();q.pop();\n\t\tfor(int i=1;i<=4;++i){\n\t\t\tif(fg[now][i]>=0){\n\t\t\t\tint tar=fg[now][0];\n\t\t\t\twhile(fg[tar][i]==-1) tar=fg[tar][0];\n\t\t\t\tfg[fg[now][i]][0]=fg[tar][i];\n\t\t\t\tac[fg[now][i]]+=ac[fg[tar][i]];\n\t\t\t\tq.push(fg[now][i]);\n\t\t\t}\n\t\t}\n\t}\n\treturn size;\n}\n\ntypedef tuple<int,int,int> state;\nint dist[55][55][110];\n\nint bfs(int limit){\n\tmemset(dist,-1,sizeof(dist));\n\tint si,sj,gi,gj;\n\trep(i,n)rep(j,m){\n\t\tif(maze[i][j]=='S') si=i,sj=j;\n\t\tif(maze[i][j]=='G') gi=i,gj=j;\n\t}\n\n\tconst int root=0;\n\tdist[si][sj][root]=0;\n\tqueue<state> q;\n\tq.push(state(si,sj,root));\n\twhile(!q.empty()){\n\t\tint ci,cj,cs;\n\t\ttie(ci,cj,cs)=q.front();q.pop();\n\t\tfor(int i=1;i<=4;++i){\n\t\t\tint ni=ci,nj=cj,ns=cs;\n\t\t\tni+=di[i],nj+=dj[i];\n\t\t\twhile(fg[ns][i]==-1) ns=fg[ns][0];\n\t\t\tns=fg[ns][i];\n\t\t\tif(ni<0||n<=ni||nj<0||m<=nj) continue;\n\t\t\tif(maze[ni][nj]=='#') continue;\n\t\t\tif(ac[ns]>=1) continue;\n\t\t\tif(dist[ni][nj][ns]==-1){\n\t\t\t\tdist[ni][nj][ns]=dist[ci][cj][cs]+1;\n\t\t\t\tq.push(make_tuple(ni,nj,ns));\n\t\t\t}\n\t\t}\n\t}\n\tint ans=-1;\n\trep(gs,limit){\n\t\tif(dist[gi][gj][gs]>=0){\n\t\t\tif(ans==-1) ans=dist[gi][gj][gs];\n\t\t\tans=min(ans,dist[gi][gj][gs]);\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main(void){\n\twhile(cin >> n >> m){\n\t\tif(n==0) break;\n\t\trep(i,n) cin >> maze[i];\n\t\tint p;\n\t\tcin >> p;\n\t\tvector<string> pattern;\n\t\trep(i,p){\n\t\t\tstring in;\n\t\t\tcin >> in;\n\t\t\tpattern.push_back(in);\n\t\t}\n\t\tcout << bfs(build(pattern)) << endl;\n\t}\n\treturn 0;\n}" ]
Mary Thomas has a number of sheets of squared paper. Some of squares are painted either in black or some colorful color (such as red and blue) on the front side. Cutting off the unpainted part, she will have eight opened-up unit cubes. A unit cube here refers to a cube of which each face consists of one square. She is going to build those eight unit cubes with the front side exposed and then a bicube with them. A bicube is a cube of the size 2 × 2 × 2, consisting of eight unit cubes, that satisfies the following conditions: * faces of the unit cubes that comes to the inside of the bicube are all black; * each face of the bicube has a uniform colorful color; and * the faces of the bicube have colors all different. Your task is to write a program that reads the specification of a sheet of squared paper and decides whether a bicube can be built with the eight unit cubes resulting from it. Input The input contains the specification of a sheet. The first line contains two integers H and W, which denote the height and width of the sheet (3 ≤ H, W ≤ 50). Then H lines follow, each consisting of W characters. These lines show the squares on the front side of the sheet. A character represents the color of a grid: alphabets and digits ('A' to 'Z', 'a' to 'z', '0' to '9') for colorful squares, a hash ('#') for a black square, and a dot ('.') for an unpainted square. Each alphabet or digit denotes a unique color: squares have the same color if and only if they are represented by the same character. Each component of connected squares forms one opened-up cube. Squares are regarded as connected when they have a common edge; those just with a common vertex are not. Output Print "Yes" if a bicube can be built with the given sheet; "No" otherwise. Examples Input 3 40 .a....a....a....a....f....f....f....f... #bc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#be#. .#....#....#....#....#....#....#....#... Output Yes Input 3 40 .a....a....a....a....f....f....f....f... bc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#be#. .#....#....#....#....#....#....#....#... Output Yes Input 5 35 .a....a....a....a....f....f....f... bc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#. .#..f.#....#....#....#....#....#... ..e##.............................. .b#................................ Output Yes Input 3 40 .a....a....a....a....f....f....f....f... bc#.#cd#.#de#.#eb#.#cb#.#dc#.#ed#.#eb#. .#....#....#....#....#....#....#....#... Output No
[ "#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <queue>\n#include <set>\n#include <map>\n#include <valarray>\n#include <bitset>\n#include <stack>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n#define chmax(a,b) (a<b?(a=b,1):0)\n#define chmin(a,b) (a>b?(a=b,1):0)\n#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\n\nconst int dy[4] = {-1,0,1,0};\nconst int dx[4] = {0,1,0,-1};\n\ntemplate <class T>\nstruct dice {\n T t,b,n,s,e,w; // top bottom north south east west\n int x, y;\n dice() {t=' ';}\n dice(int y, int x) : y(y),x(x) {\n t=0,b=1,n=2,s=3,e=4,w=5;\n }\n dice(T t, T b, T n, T s, T e, T w) : t(t),b(b),n(n),s(s),e(e),w(w) {}\n void roll(T &a, T &b, T &c, T &d) { swap(a,b); swap(b,c); swap(c,d); }\n void roll_x() { roll(t, n, b, s); }\n void roll_y() { roll(t, w, b, e); }\n void roll_z() { roll(s, e, n, w); }\n vector<dice> all_rolls() {\n vector<dice> ret;\n for (int k=0; k<6; (k&1?roll_y():roll_x()),++k)\n for (int i=0; i<4; roll_z(), ++i)\n ret.push_back(*this);\n return ret;\n }\n void roll(int d) {\n if (d == 0) roll(t, s, b, n);\n else if (d == 1) roll(t, w, b, e);\n else if (d == 2) roll(t, n, b, s);\n else roll(t, e, b, w);\n x+=dx[d];\n y+=dy[d];\n }\n void toTable(T *res) {\n res[0]=t;res[1]=b;res[2]=n;\n res[3]=s;res[4]=e;res[5]=w;\n }\n};\n\ntypedef dice<char> Dice;\n\nDice di[8][24];\nDice cube[2][2][2];\n\nint posx[8] = {0,1,0,1,0,1,0,1};\nint posy[8] = {0,0,1,1,0,0,1,1};\nint posz[8] = {0,0,0,0,1,1,1,1};\n\nconst int dx3[6] = {0,0,-1,1,0,0};\nconst int dy3[6] = {0,0,0,0,1,-1};\nconst int dz3[6] = {1,-1,0,0,0,0};\n\nbool check(int x, int y, int z, vector<char> &v) {\n char table[6];\n cube[x][y][z].toTable(table);\n\n // if (x==1) {\n // cout << \" \";\n // REP(i,6) cout << table[i] << \",\"; cout << endl;\n // }\n\n REP(i,6) {\n int xx=x+dx3[i];\n int yy=y+dy3[i];\n int zz=z+dz3[i];\n int p = -1;\n if (xx<0) p=0;\n else if (xx>=2) p=1;\n else if (yy<0) p=2;\n else if (yy>=2) p=3;\n else if (zz<0) p=4;\n else if (zz>=2) p=5;\n\n // if (x==1) {\n // if (p>=0) cout << v[p] << \" \";\n // cout << p << \" \" << table[i] << endl;\n // }\n\n if (p==-1 ^ table[i]=='#') return 0; // 内側は必ず黒．外側は黒以外\n if (p!=-1 && v[p]!='.'&& v[p]!=table[i]) return 0; // 外側の色\n if (p>=0) v[p] = table[i];\n }\n return 1;\n}\n\nbool solve(int cnt, int S, vector<char> v) {\n // cout << cnt << endl;\n // FOR(it, v) cout << *it; cout << endl;\n if (cnt == 8) {\n set<char> st;\n FOR(it, v) st.insert(*it);\n return st.size() == 6;\n }\n\n REP(i,8) {\n if (S>>i&1) continue;\n REP(j,24) {\n int x = posx[cnt];\n int y = posy[cnt];\n int z = posz[cnt];\n cube[x][y][z] = di[i][j];\n vector<char> nxt(v);\n if (!check(x,y,z,nxt)) continue;\n // cout << i << \" \" << j << endl;\n if (solve(cnt+1, S|1<<i, nxt)) return 1;\n }\n }\n return 0;\n}\n\n\nbool visited[50][50];\nchar c[50][50];\n\nint main() {\n int h,w;\n cin >> h >> w;\n REP(i,h)REP(j,w)cin>>c[i][j];\n char array[8][6];\n int num = 0;\n REP(i,h)REP(j,w)if(c[i][j]!='.'&&!visited[i][j]) {\n queue<Dice> Q;\n Q.push(Dice(i,j));\n visited[i][j] = 1;\n while(!Q.empty()) {\n Dice now = Q.front(); Q.pop();\n array[num][now.b] = c[now.y][now.x];\n REP(k,4) {\n int y=now.y+dy[k];\n int x=now.x+dx[k];\n if (!valid(y,x,h,w)) continue;\n if (c[y][x] == '.') continue;\n if (!visited[y][x]) {\n visited[y][x] = 1;\n Dice nxt = now;\n nxt.roll(k);\n Q.push(nxt);\n }\n }\n }\n num++;\n }\n assert(num == 8);\n REP(i,num) {\n // REP(j,6) cout << array[i][j] << \" \"; cout << endl;\n char *a = array[i];\n Dice tmp(a[0],a[1],a[2],a[3],a[4],a[5]);\n vector<Dice> V = tmp.all_rolls();\n REP(j,V.size()) {\n di[i][j] = V[j];\n }\n }\n vector<char> v(6,'.');\n cout << (solve(0,0,v)?\"Yes\":\"No\") << endl;\n}", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nusing namespace std;\ntypedef array<int,6> Dice;\nint H,W;\nint I;\nstring s[50];\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\nDice ds[8];\nDice rot(Dice d,int x){\n\tif(x==0) return Dice{d[4],d[0],d[2],d[3],d[5],d[1]};\n\tif(x==1) return Dice{d[3],d[1],d[0],d[5],d[4],d[2]};\n\tif(x==2) return Dice{d[1],d[5],d[2],d[3],d[0],d[4]};\n\tif(x==3) return Dice{d[2],d[1],d[5],d[0],d[4],d[3]};\n\tif(x==4) return Dice{d[0],d[3],d[1],d[4],d[2],d[5]};\n\tif(x==5) return Dice{d[1],d[2],d[0],d[5],d[3],d[4]};\n}\nvoid dfs(Dice d,int x,int y){\n\tds[I][d[5]]=s[x][y];\n\ts[x][y]='.';\n\trep(i,4){\n\t\tint nx=x+dx[i],ny=y+dy[i];\n\t\tif(0<=nx&&nx<H&&0<=ny&&ny<W&&s[nx][ny]!='.') dfs(rot(d,i),nx,ny);\n\t}\n}\nint main(){\n\tcin>>H>>W;\n\trep(i,H) cin>>s[i];\n\trep(i,H) rep(j,W) if(s[i][j]!='.'){\n\t\tDice d={0,1,2,3,4,5};\n\t\tdfs(d,i,j);\n\t\tI++;\n\t}\n\tmap<char,int> mp;\n\trep(i,8){\n\t\tint b=0;\n\t\tset<char> ss;\n\t\trep(j,6){\n\t\t\tif(ds[i][j]=='#') b++;\n\t\t\telse ss.insert(ds[i][j]),mp[ds[i][j]]++;\n\t\t}\n\t\tif(b!=3||ss.size()!=3){\n\t\t\tputs(\"No\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tfor(auto p:mp){\n\t\tif(p.sc!=4){\n\t\t\tputs(\"No\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\trep(i,8){\n\t\trep(j,3) if(ds[i][j]=='#'&&ds[i][5-j]=='#'){\n\t\t\tputs(\"No\");\n\t\t\treturn 0;\n\t\t}\n\t\twhile(ds[i][0]=='#') ds[i]=rot(ds[i],0);\n\t\tint cnt=0;\n\t\twhile( (ds[i][1]=='#'||ds[i][2]=='#') && cnt<5) ds[i]=rot(ds[i],4),cnt++;\n\t}\n\tchar c=(*mp.begin()).fs;\n\tvector<int> as;\n\trep(i,8){\n\t\tint cnt=0;\n\t\twhile( ds[i][0]!=c && cnt<5) ds[i]=rot(ds[i],5),cnt++;\n\t\tif(cnt<5) as.pb(i);\n\t}\n\tassert(as.size()==4);\n\tchar x=ds[as[0]][1];\n\tvector<char> rs;\n\t{\n\t\tchar xc=x;\n\t\tint cnt=0,pp=0;\n\t\twhile(true){\n\t\t\trep(i,4){\n\t\t\t\tif(ds[as[i]][1]==x){\n\t\t\t\t\tx=ds[as[i]][2];\n\t\t\t\t\trs.pb(x);\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(x==xc) break;\n\t\t\tpp++;\n\t\t\tif(pp==6) break;\n\t\t}\n\t\tif(cnt!=4||pp==6){\n\t\t\tputs(\"No\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tfor(auto p:mp){\n\t\tchar cc=p.fs;\n\t\tbool ok=1;\n\t\trep(i,4) if(cc==rs[i]) ok=0;\n\t\tif(cc==c) ok=0;\n\t\tif(ok){\n\t\t\tc=cc;\n\t\t\tbreak;\n\t\t}\n\t}\n\tvector<int> bs;\n\trep(i,8){\n\t\tint cnt=0;\n\t\twhile( ds[i][0]!=c && cnt<5) ds[i]=rot(ds[i],5),cnt++;\n\t\tif(cnt<5) bs.pb(i);\n\t}\n\tassert(bs.size()==4);\n\tx=ds[bs[0]][2];\n\tvector<char> ss;\n\t{\n\t\tchar xc=x;\n\t\tint cnt=0;\n\t\tint pp=0;\n\t\twhile(true){\n\t\t\trep(i,4){\n\t\t\t\tif(ds[bs[i]][2]==x){\n\t\t\t\t\tx=ds[bs[i]][1];\n\t\t\t\t\tss.pb(x);\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(x==xc) break;\n\t\t\tpp++;\n\t\t\tif(pp==6) break;\n\t\t}\n\t\tif(cnt!=4||pp==6){\n\t\t\tputs(\"No\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\trep(i,4){\n\t\tif(ss==rs){\n\t\t\tputs(\"Yes\");\n\t\t\treturn 0;\n\t\t}\n\t\tss={ss[3],ss[0],ss[1],ss[2]};\n\t}\n\tputs(\"No\");\n\treturn 0;\n}", "import java.util.*;\n\nclass Main{\n\n int h,w;\n char[][] sheet;\n ArrayList<Dice> list;\n ArrayList<Character> color;\n int[] colors;\n\n int[] dx = {0, 1, 0, -1};\n int[] dy = {-1, 0, 1, 0};\n\n int[][] nei = {{1, 3, 2, 4},\n {5, 3, 0, 4},\n {0, 3, 5, 4},\n {1, 5, 2, 0},\n {1, 0, 2, 5},\n {1, 4, 2, 3}};\n\n class Dice{\n char[] dice = new char[6]; \n Dice(char f, char t, char b, char r, char l, char u){\n dice[0] = f;\n dice[1] = t;\n dice[2] = b;\n dice[3] = r;\n dice[4] = l;\n dice[5] = u;\n }\n }\n\n Dice rotateRight(Dice d){\n return new Dice(d.dice[0], d.dice[4], d.dice[3], d.dice[1], d.dice[2], d.dice[5]);\n }\n\n Dice rotateLeft(Dice d){\n return new Dice(d.dice[0], d.dice[3], d.dice[4], d.dice[2], d.dice[1], d.dice[5]);\n }\n\n Dice rotateDown(Dice d){\n return new Dice(d.dice[1], d.dice[5], d.dice[0], d.dice[3], d.dice[4], d.dice[2]);\n }\n\n Dice rotateUp(Dice d){\n return new Dice(d.dice[2], d.dice[0], d.dice[5], d.dice[3], d.dice[4], d.dice[1]);\n }\n \n boolean check(Dice d){\n if(d.dice[1]!='#' && d.dice[3]!='#') return true;\n if(d.dice[3]!='#' && d.dice[2]!='#') return true;\n if(d.dice[2]!='#' && d.dice[4]!='#') return true;\n if(d.dice[4]!='#' && d.dice[1]!='#') return true;\n return false;\n }\n\n Dice rotate(int k, Dice d){\n if(k==0) return d;\n if(k==1) return rotateDown(d);\n if(k==2) return rotateUp(d);\n if(k==3) return rotateDown(rotateLeft(d));\n if(k==4) return rotateDown(rotateRight(d));\n if(k==5) return rotateDown(rotateDown(d));\n return d;\n }\n\n void solve(){\n Scanner sc = new Scanner(System.in);\n\n h = sc.nextInt();\n w = sc.nextInt();\n sheet = new char[h][w];\n color = new ArrayList<Character>();\n for(int i=0; i<h; i++){\n String s = sc.next();\n for(int j=0; j<w; j++){\n sheet[i][j] = s.charAt(j);\n if(sheet[i][j]!='#' && sheet[i][j]!='.' && !color.contains(sheet[i][j])) \n color.add(sheet[i][j]);\n }\n }\n\n list = new ArrayList<Dice>();\n colors = new int[color.size()];\n\n for(int i=0; i<h; i++){\n for(int j=0; j<w; j++){\n if(sheet[i][j]!='.'){\n bfs(i, j);\n }\n }\n }\n\n ArrayList<Dice> list2 = new ArrayList<Dice>();\n\n for(int i=0; i<colors.length; i++){\n if(colors[i]<4) continue;\n ArrayList<Dice> same = new ArrayList<Dice>();\n for(int j=0; j<list.size(); j++){\n Dice dd = list.get(j);\n for(int k=0; k<6; k++){\n if(dd.dice[k]==color.get(i)){\n Dice newDice = rotate(k, dd); //kを前面に\n same.add(newDice);\n break;\n }\n }\n }\n if(same.size()<4) continue;\n\n for(int j=0; j<same.size(); j++){\n Dice d1 = same.get(j);\n if(!check(d1)) continue;\n while(d1.dice[1]=='#' || d1.dice[4]=='#') d1 = rotateRight(d1);\n for(int k=0; k<same.size(); k++){\n Dice d2 = same.get(k);\n if(!check(d2)) continue;\n while(d2.dice[1]=='#' || d2.dice[3]=='#') d2 = rotateRight(d2); \n for(int l=0; l<same.size(); l++){\n Dice d3 = same.get(l);\n if(!check(d3)) continue;\n while(d3.dice[4]=='#' || d3.dice[2]=='#') d3 = rotateRight(d3);\n for(int m=0; m<same.size(); m++){\n Dice d4 = same.get(m);\n if(!check(d4)) continue;\n while(d4.dice[3]=='#' || d4.dice[2]=='#') d4 = rotateRight(d4);\n\n if(d1.dice[1]==d2.dice[1] && d2.dice[3]==d4.dice[3] &&\n d3.dice[2]==d4.dice[2] && d1.dice[4]==d3.dice[4] && \n d1.dice[1]!=d3.dice[2] && d1.dice[4]!=d2.dice[3]){\n list2.add(new Dice((char)color.get(i), d1.dice[1], d3.dice[2], d2.dice[3], d1.dice[4], '.'));\n }\n }\n }\n }\n }\n }\n\n String ans = \"No\";\n for(int i=0; i<list2.size(); i++){\n Dice d1 = list2.get(i);\n for(int j=i+1; j<list2.size(); j++){\n Dice d2 = list2.get(j);\n for(int k=0; k<4; k++){\n d2 = rotateRight(d2);\n if(d1.dice[0]!=d2.dice[0] && d1.dice[1]==d2.dice[1] && \n d1.dice[2]==d2.dice[2] && d1.dice[3]==d2.dice[4] && d1.dice[4]==d2.dice[3]){\n ans = \"Yes\";\n }\n }\n }\n }\n\n System.out.println(ans);\n }\n\n int[][] abs = {{2,1,0,3},{3,2,1,0},{0,3,2,1},{1,0,3,2}};\n\n void bfs(int y, int x){\n //y, x, pos, prior\n Queue<int[]> q = new LinkedList<int[]>();\n q.add(new int[]{y, x, 0, 0});\n boolean[][] v = new boolean[h][w];\n v[y][x] = true;\n\n char[] c = new char[6];\n HashSet<Character> set = new HashSet<Character>();\n\n int black = 0;\n int cnt = 0;\n while(q.size()>0){\n int[] yx = q.poll();\n int yy = yx[0], xx = yx[1], pos = yx[2], prior = yx[3];\n \n c[pos] = sheet[yy][xx];\n set.add(c[pos]);\n if(sheet[yy][xx]=='#') black++;\n cnt++;\n sheet[yy][xx] = '.'; \n\n for(int i=0; i<4; i++){\n int ny = yy + dy[(i+prior)%4], nx = xx + dx[(i+prior)%4];\n if(ny<0 || ny>=h || nx<0 || nx>=w || v[ny][nx] || sheet[ny][nx]=='.') continue;\n for(int j=0; j<4; j++){\n if(nei[nei[pos][i]][j]==pos){\n v[ny][nx] = true;\n q.add(new int[]{ny, nx, nei[pos][i], (abs[i][j]+prior)%4});\n }\n }\n }\n }\n\n\n\n if(cnt==6 && black==3 && set.size()==4){\n list.add(new Dice(c[0], c[1], c[2], c[3], c[4], c[5]));\n //System.out.println(c[0]+\" \"+c[1]+\" \"+c[2]+\" \"+c[3]+\" \"+c[4]+\" \"+c[5]);\n for(int i=0; i<6; i++){\n if(c[i]=='#') continue;\n colors[color.indexOf(c[i])]++;\n }\n }\n }\n\n public static void main(String[] args){\n new Main().solve();\n }\n}", "#include<stdio.h>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nchar str[60][60];\nint h[]={2,3,3,3,3,3,3,3,3,3,3};\nint w[]={5,4,4,4,4,4,4,4,4,4,4};\nchar tkz[11][6][6]={\n{\n\"DLU..\",\n\"..FRB\"\n},\n{\n\"U...\",\n\"FRBL\",\n\"D...\"\n},\n{\n\"U...\",\n\"FRBL\",\n\".D..\"\n},\n{\n\"U...\",\n\"FRBL\",\n\"..D.\"\n},\n{\n\"U...\",\n\"FRBL\",\n\"...D\"\n},\n{\n\".U..\",\n\"FRBL\",\n\".D..\"\n},\n{\n\".U..\",\n\"FRBL\",\n\"..D.\"\n},\n{\n\"LU..\",\n\".FR.\",\n\"..DB\"\n},\n{\n\".U..\",\n\"FRB.\",\n\"..DL\"\n},\n{\n\"..U.\",\n\"FRB.\",\n\"..DL\"\n},\n{\n\"U...\",\n\"FRB.\",\n\"..DL\"\n}\n};\nstruct cube{\n\tchar p[6]; //FRBLUD\n\tcube(){}\n};\nchar ch[20]=\"FRBLUD\";\ncube t[8];\nchar tmp[6][6];\nint black[8][3]={\n{1,2,5},\n{2,3,5},\n{0,1,5},\n{0,3,5},\n{1,2,4},\n{2,3,4},\n{0,1,4},\n{0,3,4}\n};\nint pat[24][6]={\n{0,1,2,3,4,5},\n{1,2,3,0,4,5},\n{2,3,0,1,4,5},\n{3,0,1,2,4,5},\n{3,2,1,0,5,4},\n{2,1,0,3,5,4},\n{1,0,3,2,5,4},\n{0,3,2,1,5,4},\n{5,1,4,3,0,2},\n{1,4,3,5,0,2},\n{4,3,5,1,0,2},\n{3,5,1,4,0,2},\n{3,4,1,5,2,0},\n{4,1,5,3,2,0},\n{1,5,3,4,2,0},\n{5,3,4,1,2,0},\n{0,5,2,4,1,3},\n{5,2,4,0,1,3},\n{2,4,0,5,1,3},\n{4,0,5,2,1,3},\n{4,2,5,0,3,1},\n{2,5,0,4,3,1},\n{5,0,4,2,3,1},\n{0,4,2,5,3,1}\n};\nint used[8];\nchar now[8][6];\nint solve(int a){\n\tif(a==8){\n\t\treturn 1;\n\t}\n\tfor(int i=0;i<8;i++){\n\t\tif(!used[i]){\n\t\t\tfor(int j=0;j<24;j++){\n\t\t\t\tbool ok=true;\n\t\t\t\tfor(int k=0;k<6;k++)now[a][k]=t[i].p[pat[j][k]];\n\t\t\t\tfor(int k=0;k<3;k++){\n\t\t\t\t\tif(now[a][black[a][k]]!='#'){\n\t\t\t\t\t\tok=false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor(int k=0;k<a;k++){\n\t\t\t\t\tfor(int l=0;l<6;l++){\n\t\t\t\t\t\tif(now[k][l]!='#'&&now[a][l]!='#'&&now[k][l]!=now[a][l])ok=false;\n\t\t\t\t\t\tfor(int m=0;m<6;m++){\n\t\t\t\t\t\t\tif(l!=m&&now[k][l]!='#'&&now[k][l]==now[a][m])ok=false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!ok)continue;\n\t\t//\t\tif(ok)printf(\"OK %d %d %d\\n\",a,i,j);\n\t\t\t\tused[i]=1;\n\t\t\t\tif(solve(a+1))return 1;\n\t\t\t\tused[i]=0;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\tint sz=0;\nfor(int u=0;u<2;u++){\nfor(int r=0;r<4;r++){\n\tfor(int i=0;i<a;i++){\n\t\tfor(int j=0;j<b;j++){\n\t\t\tfor(int k=0;k<11;k++){\n\t\t\t\tif(i+h[k]>a||j+w[k]>b)continue;\n\t\t\t\tbool ok=true;\n\t\t\t\tfor(int l=0;l<h[k];l++)for(int m=0;m<w[k];m++){\n\t\t\t\t\tif(str[i+l][j+m]=='.'&&tkz[k][l][m]!='.')ok=false;\n\t\t\t\t}\n\t\t\t\tif(ok){\n\t\t\t\t\tfor(int l=0;l<h[k];l++)for(int m=0;m<w[k];m++){\n\t\t\t\t\t\tif(tkz[k][l][m]!='.'){\n\t\t\t\t\t\t\tfor(int n=0;n<6;n++)if(tkz[k][l][m]==ch[n]){\n\t\t\t\t\t\t\t\tt[sz].p[n]=str[i+l][j+m];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tstr[i+l][j+m]='.';\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tsz++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<11;i++){\n\t\tfor(int j=0;j<h[i];j++){\n\t\t\tfor(int k=0;k<w[i];k++){\n\t\t\t\ttmp[w[i]-1-k][j]=tkz[i][j][k];\n\t\t\t}\n\t\t}\n\t\tswap(h[i],w[i]);\n\t\tfor(int j=0;j<h[i];j++)for(int k=0;k<w[i];k++)tkz[i][j][k]=tmp[j][k];\n\t}\n}\n\tfor(int i=0;i<11;i++){\n\t\tfor(int j=0;j<h[i];j++){\n\t\t\tfor(int k=0;k<w[i];k++){\n\t\t\t\tif(tkz[i][j][k]=='R')tkz[i][j][k]='L';\n\t\t\t\telse if(tkz[i][j][k]=='L')tkz[i][j][k]='R';\n\t\t\t\ttmp[j][w[i]-1-k]=tkz[i][j][k];\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<h[i];j++)for(int k=0;k<w[i];k++)tkz[i][j][k]=tmp[j][k];\n\t}\n}\n/*\tfor(int i=0;i<sz;i++){\n\t\tfor(int j=0;j<6;j++)printf(\"%c\",t[i].p[j]);\n\t\tprintf(\"\\n\");\n\t}*/\n\tfor(int i=0;i<8;i++){\n\t\tint cnt=0;\n\t\tfor(int j=0;j<6;j++){\n\t\t\tif(t[i].p[j]!='#')cnt++;\n\t\t}\n\t\tif(cnt!=3){\n\t\t\tprintf(\"No\\n\");return 0;\n\t\t}\n\t}\n\tint ret=solve(0);\n\tif(ret)printf(\"Yes\\n\");\n\telse printf(\"No\\n\");\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n// 0: top, 1: front, 2:right, 3:back, 4:left, 5:bottom\nconst vector<vector<string>> dice_map = {\n {\"0...\",\n \"1234\",\n \"5...\"},\n {\"0...\",\n \"1234\",\n \".5..\"},\n {\"0...\",\n \"1234\",\n \"..5.\"},\n {\"0...\",\n \"1234\",\n \"...5\"},\n {\".0..\",\n \"4123\",\n \".5..\"},\n {\".0..\",\n \"4123\",\n \"..5.\"},\n {\"...0\",\n \"2341\",\n \"..5.\"},\n {\"...0\",\n \"2341\",\n \".5..\"},\n {\"...0\",\n \"2341\",\n \"5...\"},\n {\"..0.\",\n \"3412\",\n \".5..\"},\n {\"..0.\",\n \"3412\",\n \"5...\"},\n {\".0..\",\n \"4123\",\n \"5...\"},\n {\"..025\",\n \"341..\"},\n {\"025..\",\n \"..143\"},\n {\"..02\",\n \"341.\",\n \"5...\"},\n {\"40..\",\n \".123\",\n \"...5\"},\n {\"..02\",\n \"341.\",\n \".5..\"},\n {\"40..\",\n \".123\",\n \"..5.\"},\n {\"..02\",\n \"341.\",\n \"..5.\"},\n {\"40..\",\n \".123\",\n \".5..\"},\n {\"..02\",\n \".41.\",\n \"35..\"},\n {\"40..\",\n \".12.\",\n \"..53\"},\n};\n\nvector<string> rot_map(vector<string> const& v) {\n const int n = v.size(), m = v[0].size();\n vector<string> res(m);\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < m; ++j) {\n res[j] += v[n - i - 1][j];\n }\n }\n return res;\n};\n\nusing dice = string;\n\nconstexpr int rot_d[2][6] = {\n {3, 0, 2, 5, 4, 1}, // Front\n {0, 4, 1, 2, 3, 5}, // Side\n};\n\ndice rot_dice(dice const& v, int dir) {\n dice res(6, ' ');\n for(int j = 0; j < 6; ++j) {\n res[j] = v[rot_d[dir][j]];\n }\n return res;\n}\n\nbool is_valid_dice(dice const& d) {\n bool res = true;\n for(int i = 0; i < 3; ++i) {\n res &= isalpha(d[i]) || isdigit(d[i]);\n res &= d[i + 3] == '#';\n }\n return res;\n}\n\nbool check(vector<dice>& ds, int i) {\n bool res = false;\n if(i == 8) {\n res = true;\n for(int j = 0; j < 4; ++j) {\n res &= ds[j][0] == ds[0][0]; // top\n res &= ds[j + 4][0] == ds[4][0]; // bottom\n // side\n res &= ds[j][2] == ds[(j + 1) % 4][1];\n //res &= ds[j + 4][1] == ds[(j + 1) % 4 + 4][2];\n res &= ds[j][1] == ds[j + 4][2] && ds[j][2] == ds[j + 4][1];\n }\n return res;\n } else {\n for(int j = 0; j < 3; ++j) {\n res |= check(ds, i + 1);\n rotate(begin(ds[i]), begin(ds[i]) + 1, end(ds[i]));\n }\n }\n return res;\n}\n\nint main() {\n int h, w; cin >> h >> w;\n vector<string> v(h);\n for(auto& s : v) cin >> s;\n\n { // check1\n map<char, int> cols;\n for(auto const& s : v) {\n for(auto const c : s) {\n if(c == '.' || c == '#') continue;\n cols[c] += 1;\n }\n }\n bool chk = cols.size() == 6u;\n for(auto const& p : cols) {\n chk &= p.second == 4;\n }\n if(!chk) {\n cout << \"No\" << endl;\n return 0;\n }\n }\n\n vector<dice> dices;\n auto in_range = [&] (int y, int x) {\n return 0 <= y && y < h && 0 <= x && x < w;\n };\n for(int i = 0; i < h; ++i) {\n for(int j = 0; j < w; ++j) {\n for(auto dm : dice_map) {\n string td;\n for(int k = 0; k < 4; ++k, dm = rot_map(dm)) {\n const int n = dm.size(), m = dm[0].size();\n if(!in_range(i + n - 1, j + m - 1)) continue;\n string d(6, '.');\n for(int y = i; y < i + n; ++y) {\n for(int x = j; x < j + m; ++x) {\n if(dm[y - i][x - j] == '.') continue;\n d[dm[y - i][x - j] - '0'] = v[y][x];\n }\n }\n if(d[0] == '.' || d[0] == '#') {\n d = rot_dice(rot_dice(d, 0), 0);\n }\n for(int l = 0; l < 4; ++l, d = rot_dice(d, 1)) {\n if(!is_valid_dice(d)) continue;\n td = d.substr(0, 3);\n }\n }\n if(!td.empty()) {\n dices.push_back(td);\n }\n }\n }\n }\n\n // check\n sort(begin(dices), end(dices));\n bool ans = false;\n do {\n ans |= check(dices, 1);\n } while(!ans && next_permutation(begin(dices) + 1, end(dices)));\n\n cout << (ans ? \"Yes\" : \"No\") << endl;\n}\n\n", "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nstruct Dice {\n int face[6];\n // +Z\n int Top() const { return face[0]; }\n int &Top() { return face[0]; }\n // -Z\n int Bottom() const { return face[1]; }\n int &Bottom() { return face[1]; }\n // +X\n int Right() const { return face[2]; }\n int &Right() { return face[2]; }\n // -X\n int Left() const { return face[3]; }\n int &Left() { return face[3]; }\n // +Y\n int Front() const { return face[4]; }\n int &Front() { return face[4]; }\n // -Y\n int Back() const { return face[5]; }\n int &Back() { return face[5]; }\n\n Dice Rotate(int cnt, int dir) const {\n if (cnt == 0) { return *this; }\n if (cnt < 0) { cnt = cnt % 4 + 4; }\n else { cnt %= 4; }\n Dice ret;\n if (dir == 0) {\n // +X rotate(Y axis rotate)\n ret.face[0] = face[3];\n ret.face[1] = face[2];\n ret.face[2] = face[0];\n ret.face[3] = face[1];\n ret.face[4] = face[4];\n ret.face[5] = face[5];\n } else if (dir == 1) {\n // +Y rotate(X axis rotate)\n ret.face[0] = face[4];\n ret.face[1] = face[5];\n ret.face[2] = face[2];\n ret.face[3] = face[3];\n ret.face[4] = face[1];\n ret.face[5] = face[0];\n } else if (dir == 2) {\n // Z rotate(Z axis rotate)\n ret.face[0] = face[0];\n ret.face[1] = face[1];\n ret.face[2] = face[4];\n ret.face[3] = face[5];\n ret.face[4] = face[3];\n ret.face[5] = face[2];\n } else {\n assert(false);\n }\n return ret.Rotate(cnt - 1, dir);\n }\n vector<Dice> AllRotate() const {\n vector<Dice> ret;\n Dice temp = *this;\n REP(i, 6) {\n REP(j, 4) {\n ret.push_back(temp);\n temp = temp.Rotate(1, 2);\n }\n temp = temp.Rotate(1, i & 1);\n }\n return ret;\n }\n bool operator<(const Dice &rhs) const {\n REP(i, 6) {\n if (face[i] != rhs.face[i]) { return face[i] < rhs.face[i]; }\n }\n return false;\n }\n};\n\nint h, w;\nchar field[100][100];\nbool visit[100][100];\nconst int dx[4] = { 0, 1, 0, -1 };\nconst int dy[4] = { 1, 0, -1, 0 };\n\nint dfs(int x, int y, Dice &die) {\n if (visit[y][x]) { return 0; }\n visit[y][x] = true;\n int ret = 1;\n die.Bottom() = (int)field[y][x];\n REP(i, 4) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (nx < 0 || nx >= w || ny < 0 || ny >= h || field[ny][nx] == '.') { continue; }\n die = die.Rotate(dx[i], 0);\n die = die.Rotate(dy[i], 1);\n ret += dfs(nx, ny, die);\n die = die.Rotate(-dx[i], 0);\n die = die.Rotate(-dy[i], 1);\n }\n return ret;\n}\n\nint main() {\n while (scanf(\"%d %d\", &h, &w) > 0) {\n set<Dice> dice;\n MEMSET(field, 0);\n MEMSET(visit, false);\n REP(y, h) {\n scanf(\"%s\", field[y]);\n }\n REP(sy, h) {\n REP(sx, w) {\n if (field[sy][sx] == '.' || visit[sy][sx]) { continue; }\n Dice die;\n REP(i, 6) { die.face[i] = -1; }\n int nret = dfs(sx, sy, die);\n assert(nret == 6);\n REP(i, 6) {\n assert(die.face[i] != -1);\n }\n vector<Dice> rolls = die.AllRotate();\n FORIT(it, rolls) { dice.insert(*it); }\n }\n }\n FORIT(it1, dice) {\n FORIT(it2, dice) {\n if (it1 == it2) { break; }\n Dice big;\n big.Top() = it1->Top();\n big.Right() = it1->Right();\n big.Front() = it1->Front();\n big.Bottom() = it2->Bottom();\n big.Left() = it2->Left();\n big.Back() = it2->Back();\n REP(i, 6) {\n if (big.face[i] == '#') { goto next; }\n }\n REP(i, 6) {\n REP(j, i) {\n if (big.face[i] == big.face[j]) { goto next; }\n }\n }\n REP(i, 8) {\n Dice search;\n search.face[0] = ((i & 1) == 1) ? big.face[0] : (int)'#';\n search.face[1] = ((i & 1) == 0) ? big.face[1] : (int)'#';\n search.face[2] = ((i & 2) == 2) ? big.face[2] : (int)'#';\n search.face[3] = ((i & 2) == 0) ? big.face[3] : (int)'#';\n search.face[4] = ((i & 4) == 4) ? big.face[4] : (int)'#';\n search.face[5] = ((i & 4) == 0) ? big.face[5] : (int)'#';\n if (!dice.count(search)) { goto next; }\n }\n puts(\"Yes\");\n goto end;\nnext:;\n }\n }\n puts(\"No\");\nend:;\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nstruct Dice{\n char f[7];\n\n Dice(){\n rep(i,6) f[i] = '?';\n }\n\n void R(){\n char tmp = f[0];\n f[0] = f[4];\n f[4] = f[5];\n f[5] = f[2];\n f[2] = tmp;\n }\n\n void L(){\n char tmp = f[0];\n f[0] = f[2];\n f[2] = f[5];\n f[5] = f[4];\n f[4] = tmp;\n }\n\n void B(){\n char tmp = f[0];\n f[0] = f[1];\n f[1] = f[5];\n f[5] = f[3];\n f[3] = tmp;\n }\n\n void F(){\n char tmp = f[0];\n f[0] = f[3];\n f[3] = f[5];\n f[5] = f[1];\n f[1] = tmp;\n }\n\n void CCW(){\n char tmp = f[1];\n f[1] = f[4];\n f[4] = f[3];\n f[3] = f[2];\n f[2] = tmp;\n }\n};\n\nconst int dy[4]={1,-1,0,0};\nconst int dx[4]={0,0,1,-1};\n\nint h,w;\nstring s[55];\nbool vis[55][55];\n\nbool IN(int y, int x){\n return (0<=y && y<h && 0<=x && x<w && s[y][x]!='.');\n}\n\nDice t;\nvoid dfs(int y, int x){\n vis[y][x] = true;\n t.f[0] = s[y][x];\n\n rep(i,4){\n int ny = y+dy[i], nx = x+dx[i];\n if(IN(ny,nx) && !vis[ny][nx]){\n if(i==0) t.B();\n else if(i==1) t.F();\n else if(i==2) t.L();\n else if(i==3) t.R();\n\n dfs(ny,nx);\n\n if(i==0) t.F();\n else if(i==1) t.B();\n else if(i==2) t.R();\n else if(i==3) t.L();\n }\n }\n}\n\nint black[8][3]={ {2,3,5}, {3,4,5}, {1,4,5}, {1,2,5}, {0,2,3}, {0,3,4}, {0,1,4}, {0,1,2} };\n\nbool solve(){\n cin >>h >>w;\n rep(i,h) cin >>s[i];\n\n vector<Dice> d;\n rep(i,h)rep(j,w)if(s[i][j]!='.' && !vis[i][j]){\n t = Dice();\n dfs(i,j);\n d.pb(t);\n }\n\n assert(d.size() == 8);\n\n // rep(i,8){\n // rep(j,6) printf(\" %c\",d[i].f[j]);\n // printf(\"\\n\");\n // }\n\n rep(i,8){\n int b_ct = 0;\n rep(j,6) b_ct += (d[i].f[j]=='#');\n if(b_ct != 3) return false;\n }\n\n vector<int> p(8);\n rep(i,8) p[i] = i;\n\n do{\n bool ok = true;\n\n vector<vector<char>> aa,bb;\n for(int i:{0,6}){\n t = d[p[i]];\n\n int CT = 0;\n rep(z1,4){\n t.R();\n rep(z2,4){\n t.F();\n rep(z3,4){\n t.CCW();\n\n int b_ct = 0;\n rep(j,3) b_ct += (t.f[black[i][j]]=='#');\n if(b_ct == 3){\n ++CT;\n\n if(i==0){\n aa.pb({t.f[0],t.f[1],t.f[4]});\n }\n else{\n bb.pb({t.f[2],t.f[3],t.f[5]});\n }\n }\n }\n }\n }\n\n if(CT == 0){\n ok = false;\n break;\n }\n }\n if(!ok) continue;\n\n // dbg(p);\n sort(all(aa));\n aa.erase(unique(all(aa)), aa.end());\n sort(all(bb));\n bb.erase(unique(all(bb)), bb.end());\n\n int AA = aa.size(), BB = bb.size();\n rep(ai,AA)rep(bi,BB){\n char ch[7];\n ch[0] = aa[ai][0];\n ch[1] = aa[ai][1];\n ch[2] = bb[bi][0];\n ch[3] = bb[bi][1];\n ch[4] = aa[ai][2];\n ch[5] = bb[bi][2];\n\n set<char> cols;\n rep(i,6) cols.insert(ch[i]);\n if(cols.size() != 6) continue;\n\n ok = true;\n rep(i,8){\n bool found = false;\n t = d[p[i]];\n rep(z1,4){\n t.R();\n rep(z2,4){\n t.F();\n rep(z3,4){\n t.CCW();\n\n int b_ct = 0;\n rep(j,3) b_ct += (t.f[black[i][j]]=='#');\n if(b_ct == 3){\n int ok_ct = 0;\n rep(j,6){\n if(t.f[j]!='#'){\n ok_ct += (t.f[j] == ch[j]);\n }\n }\n\n if(ok_ct == 3) found = true;\n }\n }\n }\n }\n\n if(!found){\n ok = false;\n break;\n }\n }\n if(ok) return true;\n }\n }while(next_permutation(all(p)));\n\n return false;\n}\n\nint main(){\n cout << (solve()?\"Yes\":\"No\") << endl;\n return 0;\n}\n\n", "from collections import deque\nfrom string import ascii_lowercase, ascii_uppercase, digits\nimport sys\nreadline = sys.stdin.readline\nwrite = sys.stdout.write\n\nD = [\n (1, 5, 2, 3, 0, 4), # 'U'\n (3, 1, 0, 5, 4, 2), # 'R'\n (4, 0, 2, 3, 5, 1), # 'D'\n (2, 1, 5, 0, 4, 3), # 'L'\n]\np_dice = (0, 0, 0, 1, 1, 2, 2, 3)*3\n\nss = digits + ascii_uppercase + ascii_lowercase\nL = len(ss)\n\ndef rotate_dice(L, k):\n return [L[e] for e in D[k]]\ndef enumerate_dice(L0):\n L = L0[:]\n for k in p_dice:\n yield L\n L[:] = (L[e] for e in D[k])\ndef dice_graph(L0 = [0, 1, 2, 3, 4, 5]):\n DA = list(map(tuple, enumerate_dice(L0)))\n DM = {tuple(e): i for i, e in enumerate(DA)}\n G = [list(DM[tuple(rotate_dice(ds, i))] for i in range(4)) for ds in DA]\n return DA, G\n\ndef solve():\n H, W = map(int, readline().split())\n S = [readline().strip() for i in range(H)]\n\n DA, DG = dice_graph()\n dd = ((0, -1), (1, 0), (0, 1), (-1, 0))\n\n DS = []\n used = [[0]*W for i in range(H)]\n for i in range(H):\n for j in range(W):\n if S[i][j] == '.' or used[i][j]:\n continue\n D = [0]*6\n que = deque([(j, i, 0)])\n used[i][j] = 1\n while que:\n x, y, k = que.popleft()\n v = DA[k][0]\n c = S[y][x]\n if c == '#':\n D[v] = L\n else:\n D[v] = ss.index(c)\n for e, (dx, dy) in enumerate(dd):\n nx = x + dx; ny = y + dy\n if not 0 <= nx < W or not 0 <= ny < H or S[ny][nx] == '.' or used[ny][nx]:\n continue\n used[ny][nx] = 1\n que.append((nx, ny, DG[k][e]))\n if D.count(L) != 3:\n continue\n for e in enumerate_dice(D):\n if e[3] == e[4] == e[5] == L:\n if e[0] != e[1] and e[1] != e[2] and e[2] != e[0]:\n DS.append(e[:3])\n break\n P = [\n [0, 3, 4],\n [0, 2, 3],\n [0, 1, 2],\n [0, 4, 1],\n [3, 2, 5],\n [2, 1, 5],\n [1, 4, 5],\n [4, 3, 5],\n ]\n DS.sort()\n M = len(DS)\n def dfs(i, used, used_c, state):\n if i == 8:\n return 1\n ps = P[i]\n s = [0]*3\n for j in range(M):\n if used[j]:\n continue\n used[j] = 1\n d = DS[j]\n for b in range(3):\n for k in range(3):\n p = ps[k]\n if state[p] == -1:\n if used_c[d[-b+k]]:\n break\n else:\n if state[p] != d[-b+k]:\n break\n else:\n for k in range(3):\n p = ps[k]\n if state[p] == -1:\n used_c[d[-b+k]] = 1\n s[k], state[p] = state[p], d[-b+k]\n if dfs(i+1, used, used_c, state):\n return 1\n for k in range(3):\n p = ps[k]\n state[p] = s[k]\n if state[p] == -1:\n used_c[d[-b+k]] = 0\n used[j] = 0\n return 0\n if M >= 8 and dfs(0, [0]*M, [0]*L, [-1]*6):\n write(\"Yes\\n\")\n else:\n write(\"No\\n\")\nsolve()\n", "import java.util.*;\n\nclass Main{\n\n int h,w;\n char[][] sheet;\n ArrayList<Dice> list;\n ArrayList<Character> color;\n int[] colors;\n\n\n class Dice{\n char[] dice = new char[6]; \n Dice(char f, char t, char b, char r, char l, char u){\n dice[0] = f;\n dice[1] = t;\n dice[2] = b;\n dice[3] = r;\n dice[4] = l;\n dice[5] = u;\n }\n }\n\n Dice rotateRight(Dice d){\n return new Dice(d.dice[0], d.dice[4], d.dice[3], d.dice[1], d.dice[2], d.dice[5]);\n }\n\n Dice rotateLeft(Dice d){\n return new Dice(d.dice[0], d.dice[3], d.dice[4], d.dice[2], d.dice[1], d.dice[5]);\n }\n\n Dice rotateDown(Dice d){\n return new Dice(d.dice[1], d.dice[5], d.dice[0], d.dice[3], d.dice[4], d.dice[2]);\n }\n\n Dice rotateUp(Dice d){\n return new Dice(d.dice[2], d.dice[0], d.dice[5], d.dice[3], d.dice[4], d.dice[1]);\n }\n \n boolean check(Dice d){\n if(d.dice[1]!='#' && d.dice[3]!='#') return true;\n if(d.dice[3]!='#' && d.dice[2]!='#') return true;\n if(d.dice[2]!='#' && d.dice[4]!='#') return true;\n if(d.dice[4]!='#' && d.dice[1]!='#') return true;\n return false;\n }\n\n Dice rotate(int k, Dice d){\n if(k==0) return d;\n if(k==1) return rotateDown(d);\n if(k==2) return rotateUp(d);\n if(k==3) return rotateDown(rotateLeft(d));\n if(k==4) return rotateDown(rotateRight(d));\n if(k==5) return rotateDown(rotateDown(d));\n return d;\n }\n\n void solve(){\n Scanner sc = new Scanner(System.in);\n\n h = sc.nextInt();\n w = sc.nextInt();\n sheet = new char[h][w];\n color = new ArrayList<Character>();\n for(int i=0; i<h; i++){\n String s = sc.next();\n for(int j=0; j<w; j++){\n sheet[i][j] = s.charAt(j);\n if(sheet[i][j]!='#' && sheet[i][j]!='.' && !color.contains(sheet[i][j])) \n color.add(sheet[i][j]);\n }\n }\n\n list = new ArrayList<Dice>();\n colors = new int[color.size()];\n\n for(int i=0; i<h; i++){\n for(int j=0; j<w; j++){\n if(sheet[i][j]!='.'){\n bfs(i, j);\n }\n }\n }\n\n ArrayList<Dice> list2 = new ArrayList<Dice>();\n\n for(int i=0; i<colors.length; i++){\n if(colors[i]<4) continue;\n ArrayList<Dice> same = new ArrayList<Dice>();\n for(int j=0; j<list.size(); j++){\n Dice dd = list.get(j);\n for(int k=0; k<6; k++){\n if(dd.dice[k]==color.get(i)){\n Dice newDice = rotate(k, dd);\n same.add(newDice);\n break;\n }\n }\n }\n if(same.size()<4) continue;\n\n for(int j=0; j<same.size(); j++){\n Dice d1 = same.get(j);\n if(!check(d1)) continue;\n while(d1.dice[1]=='#' || d1.dice[4]=='#') d1 = rotateRight(d1);\n for(int k=0; k<same.size(); k++){\n Dice d2 = same.get(k);\n if(!check(d2)) continue;\n while(d2.dice[1]=='#' || d2.dice[3]=='#') d2 = rotateRight(d2); \n for(int l=0; l<same.size(); l++){\n Dice d3 = same.get(l);\n if(!check(d3)) continue;\n while(d3.dice[4]=='#' || d3.dice[2]=='#') d3 = rotateRight(d3);\n for(int m=0; m<same.size(); m++){\n Dice d4 = same.get(m);\n if(!check(d4)) continue;\n while(d4.dice[3]=='#' || d4.dice[2]=='#') d4 = rotateRight(d4);\n\n if(d1.dice[1]==d2.dice[1] && d2.dice[3]==d4.dice[3] &&\n d3.dice[2]==d4.dice[2] && d1.dice[4]==d3.dice[4] && \n d1.dice[1]!=d3.dice[2] && d1.dice[4]!=d2.dice[3]){\n list2.add(new Dice((char)color.get(i), d1.dice[1], d3.dice[2], d2.dice[3], d1.dice[4], '.'));\n }\n }\n }\n }\n }\n }\n\n String ans = \"No\";\n for(int i=0; i<list2.size(); i++){\n Dice d1 = list2.get(i);\n for(int j=i+1; j<list2.size(); j++){\n Dice d2 = list2.get(j);\n for(int k=0; k<4; k++){\n d2 = rotateRight(d2);\n if(d1.dice[0]!=d2.dice[0] && d1.dice[1]==d2.dice[1] && \n d1.dice[2]==d2.dice[2] && d1.dice[3]==d2.dice[4] && d1.dice[4]==d2.dice[3]){\n ans = \"Yes\";\n }\n }\n }\n }\n\n System.out.println(ans);\n }\n\n int[][] abs = {{2,1,0,3},{3,2,1,0},{0,3,2,1},{1,0,3,2}};\n int[] dx = {0, 1, 0, -1};\n int[] dy = {-1, 0, 1, 0};\n\n int[][] nei = {{1, 3, 2, 4}, {5, 3, 0, 4}, {0, 3, 5, 4},\n {1, 5, 2, 0}, {1, 0, 2, 5}, {1, 4, 2, 3}};\n\n\n void bfs(int y, int x){\n //y, x, pos, prior\n Queue<int[]> q = new LinkedList<int[]>();\n q.add(new int[]{y, x, 0, 0});\n boolean[][] v = new boolean[h][w];\n v[y][x] = true;\n\n char[] c = new char[6];\n HashSet<Character> set = new HashSet<Character>();\n\n int black = 0;\n while(q.size()>0){\n int[] yx = q.poll();\n int yy = yx[0], xx = yx[1], pos = yx[2], prior = yx[3];\n \n c[pos] = sheet[yy][xx];\n set.add(c[pos]);\n if(sheet[yy][xx]=='#') black++;\n sheet[yy][xx] = '.'; \n\n for(int i=0; i<4; i++){\n int ny = yy + dy[(i+prior)%4], nx = xx + dx[(i+prior)%4];\n if(ny<0 || ny>=h || nx<0 || nx>=w || v[ny][nx] || sheet[ny][nx]=='.') continue;\n for(int j=0; j<4; j++){\n if(nei[nei[pos][i]][j]==pos){\n v[ny][nx] = true;\n q.add(new int[]{ny, nx, nei[pos][i], (abs[i][j]+prior)%4});\n }\n }\n }\n }\n\n\n\n if(black==3 && set.size()==4){\n list.add(new Dice(c[0], c[1], c[2], c[3], c[4], c[5]));\n for(int i=0; i<6; i++){\n if(c[i]!='#') colors[color.indexOf(c[i])]++;\n }\n }\n }\n\n public static void main(String[] args){\n new Main().solve();\n }\n}", "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstruct LOC{\n\tLOC(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\n//0:上 1:北 2:東 3:西 4:南 5:裏側\nstruct Dice{\n\n\tvoid roll(char dst){\n\t\tfor(int i = 0; i < 6; i++) work[i] = words[i];\n\t\tswitch(dst){\n\t\tcase 'E':\n\t\t\tsetWords(work[3],work[1],work[0],work[5],work[4],work[2]);\n\t\t\tbreak;\n\t\tcase 'S':\n\t\t\tsetWords(work[1],work[5],work[2],work[3],work[0],work[4]);\n\t\t\tbreak;\n\t\tcase 'N':\n\t\t\tsetWords(work[4],work[0],work[2],work[3],work[5],work[1]);\n\t\t\tbreak;\n\t\tcase 'W':\n\t\t\tsetWords(work[2],work[1],work[5],work[0],work[4],work[3]);\n\t\t\tbreak;\n\t\t}\n\t};\n\n\n\tvoid paint(char ch){\n\n\t\twords[5] = ch;\n\t}\n\n\tvoid setWords(char n0,char n1,char n2,char n3,char n4,char n5){\n\t\twords[0] = n0;\n\t\twords[1] = n1;\n\t\twords[2] = n2;\n\t\twords[3] = n3;\n\t\twords[4] = n4;\n\t\twords[5] = n5;\n\t}\n\n\tvoid init(){\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\twords[i] = '@';\n\t\t}\n\t}\n\n\tint count_blank(){\n\n\t\tint ret = 0;\n\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\tif(words[i] == '@')ret++;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid set(Dice arg){\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\twords[i] = arg.words[i];\n\t\t}\n\t}\n\n\tchar words[6],work[6];\n};\n\n\nint H,W;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nchar work[55][55],table[55][55];\nchar order[25] = \"NNNNWNNNWNNNENNNENNNWNNN\",dir[5] = \"NWES\";\nbool visited[55][55],FLG;\nDice dice[8],DICE,BICUBE[2][2][2];\n\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\nvoid recursive(int depth,Dice dice,int row,int col){\n\n\tif(depth == 8 || FLG == true)return;\n\n\tdice.paint(table[row][col]);\n\n\tif(dice.count_blank() == 0){\n\t\tDICE.set(dice);\n\n\t\tFLG = true;\n\t\treturn;\n\t}\n\n\tfor(int i = 0; i < 4; i++){\n\n\t\tint adj_row = row+diff_row[i];\n\t\tint adj_col = col+diff_col[i];\n\n\t\tif(rangeCheck(adj_row,adj_col) == false || table[adj_row][adj_col] == '.')continue;\n\n\t\tDice next_dice;\n\t\tnext_dice.set(dice);\n\n\t\tnext_dice.roll(dir[i]);\n\t\trecursive(depth+1,next_dice,adj_row,adj_col);\n\t}\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",work[row]);\n\t}\n\n\t//シートを裏返す\n\tfor(int col = 0; col < W; col++){\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\ttable[row][col] = work[row][W-1-col];\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tvisited[row][col] = false;\n\t\t}\n\t}\n\n\t//サイコロの表面に色を塗る\n\tint index = 0;\n\n\tfor(int col = 0; col < W; col++){\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\tif(table[row][col] != '.' && visited[row][col] == false){\n\n\t\t\t\tDice tmp_dice;\n\t\t\t\ttmp_dice.init();\n\n\t\t\t\tFLG = false;\n\t\t\t\trecursive(0,tmp_dice,row,col);\n\n\t\t\t\tdice[index++].set(DICE);\n\n\t\t\t\tqueue<LOC> Q;\n\t\t\t\tvisited[row][col] = true;\n\n\t\t\t\tQ.push(LOC(row,col));\n\n\t\t\t\twhile(!Q.empty()){\n\n\t\t\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\t\t\tint adj_row = Q.front().row+diff_row[i];\n\t\t\t\t\t\tint adj_col = Q.front().col+diff_col[i];\n\n\t\t\t\t\t\tif(rangeCheck(adj_row,adj_col) == false || table[adj_row][adj_col] == '.' ||\n\t\t\t\t\t\t\t\tvisited[adj_row][adj_col] == true)continue;\n\n\t\t\t\t\t\tvisited[adj_row][adj_col] = true;\n\t\t\t\t\t\tQ.push(LOC(adj_row,adj_col));\n\t\t\t\t\t}\n\t\t\t\t\tQ.pop();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint black_pos[6][3] = {{0,1,3},{0,2,4},{0,3,4},{1,2,5},{1,3,5},{2,4,5}};\n\tint color_pos[6][3] = {{2,4,5},{1,3,5},{1,2,5},{0,3,4},{0,2,4},{0,1,3}};\n\n\tint X[6] = {1,0,1,0,1,0};\n\tint Y[6] = {0,1,1,0,0,1};\n\tint Z[6] = {0,0,0,1,1,1};\n\n\t//dice[0]を(0,0,0)にセットする\n\tfor(int loop = 0; loop < 24; loop++){\n\n\t\tdice[0].roll(order[loop]);\n\t\tif(dice[0].words[0] == '#' && dice[0].words[1] == '#' && dice[0].words[2] == '#'){\n\n\t\t\tBICUBE[0][0][0].set(dice[0]);\n\n\t\t\tchar color[6];\n\n\t\t\tcolor[3] = BICUBE[0][0][0].words[3];\n\t\t\tcolor[4] = BICUBE[0][0][0].words[4];\n\t\t\tcolor[5] = BICUBE[0][0][0].words[5];\n\n\t\t\tfor(int i = 1; i <= 7; i++){ //(1,1,1)のダイスを設定\n\n\t\t\t\tbool check[8];\n\t\t\t\tcheck[0] = true;\n\n\t\t\t\tfor(int k = 1; k < 8; k++){\n\t\t\t\t\tcheck[k] = false;\n\t\t\t\t}\n\n\t\t\t\tcheck[i] = true;\n\t\t\t\tBICUBE[1][1][1].set(dice[i]);\n\n\t\t\t\tfor(int k = 0; k < 24; k++){\n\n\t\t\t\t\tBICUBE[1][1][1].roll(order[k]);\n\n\t\t\t\t\tif(BICUBE[1][1][1].words[3] == '#' && BICUBE[1][1][1].words[4] == '#' && BICUBE[1][1][1].words[5] == '#'){\n\n\t\t\t\t\t\tcolor[0] = BICUBE[1][1][1].words[0];\n\t\t\t\t\t\tcolor[1] = BICUBE[1][1][1].words[1];\n\t\t\t\t\t\tcolor[2] = BICUBE[1][1][1].words[2];\n\n\t\t\t\t\t\tbool color_FLG =true;\n\t\t\t\t\t\tfor(int a = 0; a < 5; a++){\n\t\t\t\t\t\t\tfor(int b = a+1; b < 6; b++){\n\t\t\t\t\t\t\t\tif(color[a] == color[b]){\n\n\t\t\t\t\t\t\t\t\tcolor_FLG = false;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(!color_FLG)break; //面の色は全て異なっていないと不可\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(!color_FLG)continue;\n\n\t\t\t\t\t\tfor(int loc = 0; loc < 6; loc++){\n\t\t\t\t\t\t\tif(color[loc] == '#'){\n\t\t\t\t\t\t\t\tcolor_FLG = false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(!color_FLG)continue;\n\n\n\t\t\t\t\t\tint index = 0;\n\t\t\t\t\t\tint sequence[6];\n\n\t\t\t\t\t\tfor(int g = 1; g <= 7; g++){\n\t\t\t\t\t\t\tif(check[g])continue;\n\n\t\t\t\t\t\t\tsequence[index++] = g;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tdo{\n\n\t\t\t\t\t\t\tfor(int loc = 0; loc < 6; loc++){ //残り6箇所\n\n\t\t\t\t\t\t\t\tint x = X[loc];\n\t\t\t\t\t\t\t\tint y = Y[loc];\n\t\t\t\t\t\t\t\tint z = Z[loc];\n\n\t\t\t\t\t\t\t\tBICUBE[x][y][z].set(dice[sequence[loc]]);\n\n\t\t\t\t\t\t\t\tbool tmp_FLG = false;\n\n\t\t\t\t\t\t\t\tfor(int b = 0; b < 24; b++){ //位置のループ\n\n\t\t\t\t\t\t\t\t\tBICUBE[x][y][z].roll(order[b]);\n\n\t\t\t\t\t\t\t\t\ttmp_FLG = true;\n\n\t\t\t\t\t\t\t\t\tfor(int c = 0; c < 3; c++){ //黒の位置\n\t\t\t\t\t\t\t\t\t\tif(BICUBE[x][y][z].words[black_pos[loc][c]] != '#'){\n\t\t\t\t\t\t\t\t\t\t\ttmp_FLG = false;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tif(!tmp_FLG)continue;\n\n\t\t\t\t\t\t\t\t\tfor(int c = 0; c < 3; c++){\n\t\t\t\t\t\t\t\t\t\tif(BICUBE[x][y][z].words[color_pos[loc][c]] != color[color_pos[loc][c]]){\n\n\t\t\t\t\t\t\t\t\t\t\ttmp_FLG = false;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tif(!tmp_FLG)continue;\n\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif(!tmp_FLG)break;\n\n\t\t\t\t\t\t\t\tif(loc == 5){\n\t\t\t\t\t\t\t\t\tprintf(\"Yes\\n\");\n\t\t\t\t\t\t\t\t\treturn 0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}while(next_permutation(sequence,sequence+6));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"No\\n\");\n\n\treturn 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\nstruct Dice{\n int s[6];\n void roll(char c){\n //the view from above\n // N\n //W E\n // S\n //s[0]:top\n //s[1]:south\n //s[2]:east\n //s[3]:west\n //s[4]:north\n //s[5]:bottom\n int b;\n if(c=='E'){\n b=s[0];\n s[0]=s[3];\n s[3]=s[5];\n s[5]=s[2];\n s[2]=b;\n }\n if(c=='W'){\n b=s[0];\n s[0]=s[2];\n s[2]=s[5];\n s[5]=s[3];\n s[3]=b;\n }\n if(c=='N'){\n b=s[0];\n s[0]=s[1];\n s[1]=s[5];\n s[5]=s[4];\n s[4]=b;\n }\n if(c=='S'){\n b=s[0];\n s[0]=s[4];\n s[4]=s[5];\n s[5]=s[1];\n s[1]=b;\n }\n \n // migi neji \n if(c=='R'){\n b=s[1];\n s[1]=s[2];\n s[2]=s[4];\n s[4]=s[3];\n s[3]=b;\n }\n \n if(c=='L'){\n b=s[1];\n s[1]=s[3];\n s[3]=s[4];\n s[4]=s[2];\n s[2]=b;\n }\n \n }\n int top() {\n return s[0];\n }\n int hash(){\n int res=0;\n for(int i=0;i<6;i++) res=res*256+s[i];\n return res;\n }\n};\nvector<Dice> makeDices(Dice d){\n vector<Dice> res;\n for(int i=0;i<6;i++){\n Dice t(d);\n if(i==1) t.roll('N'); \n if(i==2) t.roll('S'); \n if(i==3) t.roll('S'),t.roll('S');\n if(i==4) t.roll('L'); \n if(i==5) t.roll('R'); \n for(int k=0;k<4;k++){\n res.push_back(t);\n t.roll('E');\n }\n }\n return res;\n}\n\n\ntemplate<typename T>\nvector<T> compress(vector<T> v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n return v;\n}\n\ntemplate<typename T>\nmap<T, int> dict(const vector<T> &v){\n map<T, int> res;\n for(int i=0;i<(int)v.size();i++)\n res[v[i]]=i;\n return res;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n int h,w;\n cin>>h>>w;\n vector<string> s(h);\n for(int i=0;i<h;i++) cin>>s[i];\n\n int dy[]={-1,0,1,0,0};\n int dx[]={0,1,0,-1,0};\n\n int dd[6][4]={{4,2,1,3},\n {0,2,5,3},\n {4,5,1,0},\n {4,0,1,5},\n {5,2,0,3},\n {1,2,4,3}};\n \n struct T{\n int y,x,v,p;\n T(){}\n T(int y,int x,int v,int p):y(y),x(x),v(v),p(p){} \n };\n \n auto in=[&](int y,int x){return 0<=y&&y<h&&0<=x&&x<w;};\n\n vector<vector<int> > used(h,vector<int>(w,-1));\n vector<vector<int> > dc;\n auto bfs=\n [&](int sy,int sx)->void{\n queue<T> q;\n used[sy][sx]=0;\n q.emplace(sy,sx,0,4);\n vector<int> vs(6,'#');\n while(!q.empty()){\n T t=q.front();q.pop();\n vs[t.v]=int(s[t.y][t.x]);\n \n int pd=0,pv=used[t.y-dy[t.p]][t.x-dx[t.p]];\n for(int k=0;k<4;k++)\n if(dd[t.v][k]==pv) pd=(6-t.p)+(k);\n\n pd%=4;\n //cout<<t.v<<\":\"<<t.p<<\":\"<<char(vs[t.v])<<\":\"<<pv<<\" \"<<pd<<endl;\n \n for(int k=0;k<4;k++){\n int ny=t.y+dy[k],nx=t.x+dx[k];\n if(!in(ny,nx)||s[ny][nx]=='.'||~used[ny][nx]) continue;\n used[ny][nx]=dd[t.v][(pd+k)%4];\n q.emplace(ny,nx,used[ny][nx],k);\n }\n } \n Dice di;\n for(int i=0;i<6;i++) di.s[i]=vs[i];\n auto ds=makeDices(di);\n for(Dice d:ds){\n if(d.s[0]=='#'||d.s[1]=='#'||d.s[2]=='#') continue;\n dc.push_back(vector<int>({d.s[0],d.s[1],d.s[2]}));\n // cout<<char(d.s[0])<<\" \"<<char(d.s[1])<<\" \"<<char(d.s[2])<<endl;\n }\n };\n \n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(~used[i][j]||s[i][j]=='.') continue;\n bfs(i,j);\n } \n }\n \n dc=compress(dc);\n int m=dc.size();\n\n using D = tuple<int, int, int>;\n set<D> ss;\n for(int i=0;i<m;i++)\n ss.emplace(dc[i][0],dc[i][1],dc[i][2]);\n\n auto YES=[&](){cout<<\"Yes\"<<endl;exit(0);};\n\n for(int i=0;i<m;i++){\n for(int j=0;j<i;j++){\n int a=dc[i][0],b=dc[i][1],c=dc[i][2];\n int d=dc[j][0],e=dc[j][1],f=dc[j][2];\n set<int> sc({a,b,c,d,e,f});\n if(sc.size()!=6u) continue;\n \n //cout<<char(a)<<\" \"<<char(b)<<\" \"<<char(c);\n //cout<<\" \"<<char(d)<<\" \"<<char(e)<<\" \"<<char(f)<<endl;\n \n if(!ss.count(D(d,b,e))) continue; \n if(!ss.count(D(e,b,a))) continue; \n if(!ss.count(D(a,b,c))) continue;\n if(!ss.count(D(c,b,d))) continue; \n\n if(!ss.count(D(d,e,f))) continue;\n if(!ss.count(D(e,a,f))) continue;\n if(!ss.count(D(a,c,f))) continue;\n if(!ss.count(D(c,d,f))) continue;\n\n YES();\n }\n }\n \n \n cout<<\"No\"<<endl;\n return 0;\n}\n\n" ]
I-σ A permutation of magnitude N is a sequence of elements in a sequence (1, 2, 3,…, N). For example, (5, 2, 1, 4, 3) is a permutation of size 5, while (1, 5, 1, 2, 3) is not. This problem is a reactive task. You play a response program and a "permutation guessing game". First of all, the response program internally determines one permutation σ. Then you are told the magnitude N of this permutation. After this, you ask the response program several times. And your goal is to identify the permutations of the response program. The question is as follows: If you decide on one permutation τ of magnitude N and ask the response program, the response program will find the sequence ai = (the position of the number i on σ and the number on τ). Calculate the distance of the position of i). After that, arrange the sequences (a1, a2, a3,…, aN) in ascending order to create a sequence (b1, b2, b3,…, bN) and output it to your program. For example, when σ = (5, 2, 1, 4, 3), when τ = (2, 3, 1, 4, 5) is heard, the response program internally (a1, a2, a3, a4, a5). ) = (0, 1, 3, 0, 4) is calculated, and the sorted columns (b1, b2, b3, b4, b5) = (0, 0, 1, 3, 4) are output. Write a program that identifies permutations with as few questions as possible. The scoring method is described in the "Scoring method" section. Input / output format First, the permutation size N is given as input. N Your program then asks the answering program several times. The format of the question is as follows. ? τ1 τ2 τ3… τN τi is the value of the i-th element of the permutation to be asked. At this time, (τ1,…, τN) must be a permutation of magnitude N. That is, the values ​​of τi must be 1 or more and N or less and all different. After this, the response program outputs the answer to the question. b1 b2 b3… bN When implementing this exchange in code, in C ++, for example: For example, if you want to ask a permutation (5, 2, 1, 4, 3), for example, int tau [5] = {5, 2, 1, 4, 3}; printf ("?"); for (int i = 0; i <5; ++ i) printf ("% d", tau [i]); printf ("\ n"); fflush (stdout); To do. next for (int i = 0; i <5; ++ i) scanf ("% d", & b [i]); Then, the answer to the question is returned in the array b. After asking a few questions, you identify the permutation σ of the response program. The format is as follows. (Note that the format is almost the same as the question, and the leading `?` Is `!`.) ! τ1 τ2 τ3… τN Your program must terminate immediately after permutation identification. The judgment result if it is not completed is undefined. In this question, the upper limit of the number of questions is set for each test data, and if the number of questions asked by the program exceeds the upper limit, it is judged as an incorrect answer. Constraint * 1 ≤ N ≤ 400 <!- Scoring method * In the test case group for 50 points, the upper limit of the number of questions is 1000. * In the test case group for 750 points, the upper limit of the number of questions is 240. -> Input / output example 1 Program Output | Input to Program --- | --- | 5 ? 2 3 1 4 5 | | 0 0 1 3 4 ? 1 2 3 4 5 | | 0 0 2 2 4 ? 5 4 3 2 1 | | 0 2 2 2 2 ? 5 2 1 4 3 | | 0 0 0 0 0 ! 5 2 1 4 3 | σ = (5, 2, 1, 4, 3). After asking a few questions, I'm identifying the columns. Input / output example 2 Program Output | Input to Program --- | --- | 1 ! 1 | Since there is only one permutation of size 1, it can be identified immediately without asking a question. Example Input Output
[ "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint p[500];\nint q[250][500];\nint r[250][500];\nint ret[500];\nint s[500];\nint t[250][500];\nint u[500];\nint v[250][500];\nint w[250][500];\nint ABS(int a){return max(a,-a);}\nint LIM=240;\nint main(){\n\tint a;\n\tscanf(\"%d\",&a);\n\tfor(int i=0;i<a;i++)p[i]=i;\n\tfor(int i=0;i<LIM;i++){\n\t\trandom_shuffle(p,p+a);\n\t\tprintf(\"?\");\n\t\tfor(int j=0;j<a;j++)printf(\" %d\",p[j]+1);\n\t\tfor(int j=0;j<a;j++)q[i][j]=p[j];\n\t\tprintf(\"\\n\");fflush(stdout);\n\t\tfor(int j=0;j<a;j++)scanf(\"%d\",&r[i][j]);\n\t}\n\tfor(int i=0;i<a;i++)ret[i]=i;\n\trandom_shuffle(ret,ret+a);\n\tint score=0;\n\tfor(int i=0;i<a;i++)s[ret[i]]=i;\n\tfor(int i=0;i<LIM;i++){\n\t\tfor(int j=0;j<a;j++){\n\t\t\tt[i][q[i][j]]=j;\n\t\t}\n\t\tfor(int j=0;j<a;j++)u[j]=ABS(s[j]-t[i][j]);\n\t\tfor(int j=0;j<a;j++){\n\t\t\tv[i][r[i][j]]++;\n\t\t\tw[i][u[j]]++;\n\t\t}\n\t\tfor(int j=0;j<a;j++)score+=min(v[i][j],w[i][j]);\n\t}\n\twhile(score<LIM*a){\n\t\tint cl=rand()%a;\n\t\tint cr=rand()%a;\n\t\tif(cl==cr)continue;\n\t\tint nl=ret[cl];\n\t\tint nr=ret[cr];\n\t//\tswap(s[ret[cl]],s[ret[cr]]);\n\t//\tswap(ret[cl],ret[cr]);\n\t\tint tmp=score;\n\t\tfor(int i=0;i<LIM;i++){\n\t\t\tint at[4];\n\t\t\tat[0]=ABS(s[nl]-t[i][nl]);\n\t\t\tat[1]=ABS(s[nl]-t[i][nr]);\n\t\t\tat[2]=ABS(s[nr]-t[i][nl]);\n\t\t\tat[3]=ABS(s[nr]-t[i][nr]);\n\t\t\tif(w[i][at[0]]<=v[i][at[0]])tmp--;\n\t\t\tw[i][at[0]]--;\n\t\t\tif(w[i][at[3]]<=v[i][at[3]])tmp--;\n\t\t\tw[i][at[3]]--;\n\t\t\tif(w[i][at[1]]<v[i][at[1]])tmp++;\n\t\t\tw[i][at[1]]++;\n\t\t\tif(w[i][at[2]]<v[i][at[2]])tmp++;\n\t\t\tw[i][at[2]]++;\n\t\t\t\n\t\t\tw[i][at[0]]++;w[i][at[1]]--;w[i][at[2]]--;w[i][at[3]]++;\n\t\t\tif(tmp<score-10)break;\n\t\t}\n\t\tif(tmp>=score){\n\t\t\tscore=tmp;\n\t\t\tfor(int i=0;i<LIM;i++){\n\t\t\t\tint at[4];\n\t\t\t\tat[0]=ABS(s[nl]-t[i][nl]);\n\t\t\t\tat[1]=ABS(s[nl]-t[i][nr]);\n\t\t\t\tat[2]=ABS(s[nr]-t[i][nl]);\n\t\t\t\tat[3]=ABS(s[nr]-t[i][nr]);\n\t\t\t\tw[i][at[0]]--;w[i][at[1]]++;w[i][at[2]]++;w[i][at[3]]--;\n\t\t\t}\n\t\t\tswap(ret[cl],ret[cr]);\n\t\t\tswap(s[nl],s[nr]);\n\t\t}\n\t}\n\tprintf(\"!\");\n\tfor(int i=0;i<a;i++)printf(\" %d\",ret[i]+1);\n\tprintf(\"\\n\");\n\tfflush(stdout);\n}" ]
Let's solve the geometric problem Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems. Floating-point error is the error caused by the rounding that occurs when representing a number in binary finite decimal numbers. For example, 0.1 in decimal is an infinite decimal number of 0.00011001100110011 ... in binary, but an error occurs when rounding this to a finite number of digits. Positive integers p and q are given in decimal notation. Find the b-ary system (b is an integer greater than or equal to 2) so that the rational number p / q can be expressed as a decimal number with a finite number of digits. If there are more than one, output the smallest one. Constraints * 0 <p <q <10 ^ 9 Input Format Input is given from standard input in the following format. p q Output Format Print the answer in one line. Sample Input 1 1 2 Sample Output 1 2 1/2 is binary 0.1 Sample Input 2 21 30 Sample Output 2 Ten 21/30 is 0.7 in decimal Example Input 1 2 Output 2
[ "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\n\nLL gcd(LL x, LL y){\n if(y == 0) return x;\n return gcd(y, x%y);\n}\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n LL p, q; cin >> p >> q;\n LL g = gcd(p,q);\n LL n = q / g;\n LL ans = 1;\n LL ub = n;\n for(LL i=2;i*i<=ub;++i){\n\tif(n % i == 0)\n\t ans *= i;\n\twhile(n % i == 0) n /= i;\n }\n if(n > 1) ans *= n;\n \n cout << ans << endl;\n\n return 0;\n}", "//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1180\n#include <iostream>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <cmath>\n#include <algorithm>\n#include <iomanip>\n#include <queue>\nusing ll = long long;\nusing namespace std;\n\nint const MOD = 1e9 + 7;\n\nint GCD(int x, int y)\n{\n if (y == 0)\n return x;\n return GCD(y, x % y);\n}\nint main(void)\n{\n ll p, q;\n cin >> p >> q;\n\n int d = GCD(p, q);\n p /= d;\n q /= d;\n\n int ans = 1;\n for (int i = 2; i <= sqrt(q); ++i)\n {\n if (q % i == 0)\n {\n ans *= i;\n while (1)\n {\n if (q % i != 0)\n break;\n q /= i;\n }\n }\n }\n ans *= q;\n cout << ans << endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) for(int i = 0; i < (b); i++)\n#define all(a) (a).begin(), (a).end()\n#define debug(x) cout << \"debug \" << x << endl;\nconst int INF = 100000000;\nusing namespace std;\n\n\n//?????§??¬?´???°\nint gcd(int x, int y) {\n int r;\n if(x < y) swap(x, y);\n\n while(y > 0){\n r = x % y;\n x = y;\n y = r;\n }\n return x;\n}\n\nint main(){\n int p, q;\n cin >> p >> q;\n\n q/= gcd(p, q);\n\n int ans = 1;\n for(int i = 2; q >= i * i; i++){\n if(q % i == 0){\n ans*=i;\n while(q % i == 0){\n q/=i;\n }\n }\n }\n cout << ans * q << endl;\n}", "#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n \n#define REP(i,n) for(int i=0; i<n; ++i)\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\n#define pi M_PI\n \ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef vector<VI> VVI;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nint gcd(int x, int y){\n if (y == 0) return x;\n return gcd(y, x % y);\n}\n\nint main() {\n int p, q;\n cin >> p >> q;\n int d = gcd(p, q);\n q /= d;\n ll ans = 1;\n for (ll i = 2; i * i <= q; i++){\n if (q % i == 0){\n ans *= i;\n while (q % i == 0) q /= i;\n }\n }\n cout << ans*q << endl;\n\n return 0;\n}", "import java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n\n private static long gcd(long a, long b) {\n if ( a== 0)return b;\n return gcd(b % a, a);\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n long p = in.nextLong(),q = in.nextLong();\n //while (p > 0) {\n q /= gcd(p, q);\n long ans = 1;\n for (long i = 2; i * i <= q; i++) {\n if (q % i != 0) continue;\n ans *= i;\n while (q % i == 0) {\n q /= i;\n }\n }\n ans *= q;\n out.println(ans);\n\n //p = in.nextLong();\n //q = in.nextLong();\n //}\n out.flush();\n }\n\n}\n\n", "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nlong long int gcd(long long int l, long long int r) {\n\tif (l > r)return gcd(r, l);\n\telse {\n\t\tif (r%l) {\n\t\t\treturn gcd(l, r%l);\n\n\t\t}\n\t\telse {\n\t\t\treturn l;\n\t\t}\n\t}\n}\n\nmap<long long int, int>soinnsuu(long long int a) {\n\tmap<long long int, int>ans;\n\tfor (long long i = 2; i*i <= a; ++i) {\n\t\twhile (a%i == 0) {\n\t\t\tans[i]++;\n\t\t\ta /= i;\n\t\t}\n\t}\n\tif (a != 1)ans[a]++;\n\n\n\treturn ans;\n}\n\nint main(){\n\tlong long int p,q;cin>>p>>q;\n\tlong long int num=q/(gcd(p,q));\n\tauto mp=soinnsuu(num);\n\n\tlong long int ans=1;\n\tfor (auto m: mp) {\n\t\tint k=1;\n\t\tfor(int j=0;j<k;++j)ans*=m.first;\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}\n\n\n", "#include <iostream>\nusing namespace std;\n\nint gcd(int a, int b) {\n\tif (b == 0) return a;\n\treturn gcd(b, a % b);\n}\n\nint main() {\n\tint p, q;\n\tcin >> p >> q;\n\t\n\tint g = gcd(p, q);\n\tp /= g;\n\tq /= g;\n\t\n\tint ans = 1;\n\tfor (int i = 2; i * i <= q; i++) {\n\t\tif (q % i != 0) continue;\n\t\twhile (q % i == 0) { q /= i; }\n\t\tans *= i;\n\t}\n\tans *= q;\n\t\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\n\nint gcd(int x, int y) {\n return y == 0 ? x : gcd(y, x%y);\n}\n\nint P, Q;\n\nint main() {\n cin >> P >> Q;\n int v = Q / gcd(P, Q);\n for (int d = 2; d*d <= v; ++d) {\n if (v % d == 0) {\n while ((v/d)%d == 0) { v /= d; }\n }\n }\n cout << max(2, v) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define MAX_N 1000000000\nint gcd(int a, int b)\n{\n if (a < b)\n return gcd(b, a);\n else if (a % b)\n return gcd(b, a % b);\n else\n return b;\n}\nint main()\n{\n int p, q;\n cin >> p >> q;\n q /= gcd(p, q);\n map<int, int> res;\n for (int i = 2; i * i <= MAX_N; i++)\n {\n while (q % i == 0)\n {\n q /= i;\n res[i]++;\n }\n }\n if (q != 1)\n res[q]++;\n int ans = 1;\n for (auto p : res)\n {\n ans *= p.first;\n }\n cout << ans << endl;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<int ,P> P3;\ntypedef pair<P ,P> PP;\nconst ll MOD = ll(1e9+7);\nconst int IINF = INT_MAX;\nconst ll LLINF = LLONG_MAX;\nconst int MAX_N = int(1e5 + 5);\nconst double EPS = 1e-6;\nconst int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define REPR(i, n) for (int i = n; i >= 0; i--)\n#define SORT(v) sort((v).begin(), (v).end())\n#define ALL(v) (v).begin(), (v).end()\n\nll gcd(ll p, ll q){\n if(p%q==0) return q;\n else return gcd(q, p%q);\n}\n\nint main() {\n ll p, q, m, ans=1;\n cin >> p >> q;\n m = q/gcd(p,q);\n for(ll i=2;i*i<=m;i++){\n if(m%i==0){\n ans *= i;\n while(m%i==0) m/=i;\n }\n }\n if(m!=1) ans *= m;\n cout << ans << endl;\n return 0;\n}\n\n", "def gcd(m, n):\n r = m % n\n return gcd(n, r) if r else n\np, q = map(int, input().split())\nq //= gcd(p, q)\n\nx = q; y = 1; k = 2\nwhile k*k <= x:\n if x % k == 0:\n while x % k == 0: x //= k\n y *= k\n k += 1\ny *= x\n\nprint(y)", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a%b);\n}\n\nint main() {\n vector<int> prime;\n vector<bool> is_prime(1e5, true);\n is_prime[0] = is_prime[1] = false;\n for(int i=2; i<1e5; ++i) {\n if(is_prime[i]) {\n prime.push_back(i);\n for(int j=i+i; j<100000; j+=i) {\n is_prime[j] = false;\n }\n }\n }\n int p, q;\n cin >> p >> q;\n int g = gcd(p, q);\n p /= g, q /= g;\n int ans = 1;\n for(int i=0; i<prime.size(); ++i) {\n if(q % prime[i] == 0) {\n ans *= prime[i];\n while(q % prime[i] == 0) {\n q /= prime[i];\n }\n }\n }\n if(q / ans > 1) {\n cout << q * ans << endl;\n } else {\n cout << ans << endl;\n }\n}\n", "#include <iostream>\nusing namespace std;\n\nint gcd(int u, int v){\n\twhile(v!=0){\n\t\tint r = u%v;\n\t\tu = v;\n\t\tv = r;\n\t}\n\treturn u;\n}\n\nint main(){\n\tint p,q;\n\tcin >> p >> q;\n\tq /= gcd(p,q);\n\t\n\tint ans=1;\n\tint rq=q;\n\tfor(int i=2; i*i<=q; i++){\n\t\tif(rq%i==0){\n\t\t\tans*=i;\n\t\t}\n\t\twhile(rq%i==0){\n\t\t\trq/=i;\n\t\t}\n\t}\n\tans *= rq;\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n#include <bitset>\n#include <time.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = (1LL << 31) - 1;\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n#define MAX_N 100100 * 3\n\nmap<int, int> prime_facter(ll n) {\n\tmap<int, int> res;\n\tfor (ll i = 2; i*i <= n; i++) {\n\t\twhile (n%i == 0) {\n\t\t\t++res[i];\n\t\t\tn /= i;\n\t\t}\n\t}\n\tif (n != 1)res[n] = 1;\n\treturn res;\n}\n\nll gcd(ll a, ll b) {\n\tif (b == 0)return a;\n\treturn gcd(b, a%b);\n}\n\nll p, q;\n\nint main() {\n\tcin >> p >> q;\n\tmap<int, int> mii = prime_facter(q / gcd(p, q));\n\tint ans = 1;\n\tfor (auto it : mii) {\n\t\tans *= it.first;\n\t}\n\tcout << ans << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n \n#define int long long\ntypedef pair<int,int>pint;\ntypedef vector<int>vint;\ntypedef vector<pint>vpint;\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\n \nint gcd(int a,int b){\n return b?gcd(b,a%b):a;\n}\n \nsigned main(){\n int p,q;\n cin>>p>>q;\n int g=gcd(p,q);\n q/=g;\n for(int i=2;i*i<=q;i++){\n if(q%i)continue;\n while(q%i==0)q/=i;\n q*=i;\n }\n cout<<q<<endl;\n return 0;\n}", "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<cstdlib>\n#include<map>\n#include<iomanip>\n#include<sstream>\n#include<vector>\n#include<stack>\n#include<math.h>\n#include<queue>\n#include<complex>\n#include<random>\n#include<ctime>\n#include<set>\nusing namespace std;\n\n\nconst long long int mod=1000000007;\nconst long long int INF=99999999999999999;\n\n//ユークリッドの互除法　a,bは最大公約数を求めたい２つの数\nclass Euclid_Gojyohou{\n public:\n long long int gcd(long long int a, long long int b) {\n long long int tmp;\n long long int r = 1;\n if (b > a) {\n tmp = a;\n a = b;\n b = tmp;\n }\n r = a % b;\n while (r != 0) {\n\n\n a = b;\n b = r;\n r = a % b;\n\n }\n return b;\n }\n};\n\nint main() {\n\tcout << fixed << setprecision(18);\n\tlong long int b,x=1,y,p,q,tmp;\n\tcin>>p>>q;\n\tEuclid_Gojyohou euc;\n\tq=q/euc.gcd(p,q);\n\ttmp=q;\n\tfor(int i=2;i*i<=q;i++){\n\t\tif(tmp%i==0){x*=i;}\n\t\twhile(tmp%i==0){\n\t\t\ttmp/=i;\n\t\t}\n\t}\n\tcout<<x*tmp<<endl;\n} \n\n", "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#include<assert.h>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef int Def;\ntypedef pair<Def,Def> pii;\ntypedef vector<Def> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<Def,pii> pip;\ntypedef vector<pip>vip;\n//#define mt make_tuple\n//typedef tuple<int,string> tp;\n//typedef vector<tp> vt;\nconst double PI=acos(-1);\nconst double EPS=1e-7;\nconst int inf=1e9;\nconst ll INF=2e18;\nint dx[]={0,1,0,-1};\nint dy[]={1,0,-1,0};\nll gcd(ll a,ll b){\n\treturn (b==0?a:gcd(b,a%b));\n}\nint main(){\n\tll a,b;\n\tcin>>a>>b;\n\tll t=b/gcd(a,b);\n\tll out=1;\n\tfor(ll i=2;i*i<=t;i++){\n\t\tif(t%i==0){\n\t\t\tout*=i;\n\t\t\twhile(t%i==0)t/=i;\n\t\t}\n\t}\n\tcout<<out*t<<endl;\n}", "import fractions\na,b=map(int,input().split())\nb//=fractions.gcd(a,b)\na,c=2,1\nwhile a**2<=b:\n if b%a==0:\n c*=a\n while b%a==0: b//=a\n a+=1\nprint(c*b)", "#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(a) a.begin(), a.end()\n#define MS(m,v) memset(m,v,sizeof(m))\ntypedef long long ll;\ntypedef long double ld;\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\nconst int MOD = 1e9 + 7;\ntemplate<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate<class T>\nistream& operator >> (istream& is, vector<T>& v)\n{\n\tfor (auto &i : v) is >> i;\n\treturn is;\n}\ntemplate<class T>\nostream& operator<<(ostream& os, vector<T>& v)\n{\n\tconst string delimiter = \"\\n\";\n\tREP(i, v.size())\n\t{\n\t\tos << v[i];\n\t\tif (i != v.size() - 1) os << delimiter;\n\t}\n\treturn os;\n}\n/*--------------------template--------------------*/\n\nll gcd(ll a, ll b)\n{\n\tif (a < b) swap(a, b);\n\treturn (a%b ? gcd(a%b, b) : b);\n}\n\n\nconst int N = 1111111;\nbool prime[N + 1];\nvector<int> primes;\n\nvoid hurui()\n{\n\tmemset(prime, true, sizeof(prime));\n\tprime[0] = prime[1] = false;\n\tfor (int i = 2; i*i < N; i++)\n\t{\n\t\tif (!prime[i]) continue;\n\t\tfor (int j = i; i*j < N; j++)\n\t\t{\n\t\t\tprime[i*j] = false;\n\t\t}\n\t}\n\tREP(i, N + 1)\n\t{\n\t\tif (prime[i]) primes.push_back(i);\n\t}\n}\n\n\nint main()\n{\n\tcin.sync_with_stdio(false); cout << fixed << setprecision(10);\n\thurui();\n\tll a, b;\n\tcin >> a >> b;\n\tll g = b / gcd(a, b);\n\tll t = g;\n\tset<int> st;\n\tfor (auto p : primes)\n\t{\n\t\tif (p > sqrt(g)) break;\n\t\tif (t % p == 0) st.insert(p);\n\t\twhile (t % p == 0) t /= p;\n\t}\n\tst.insert(t);\n\tll ans = 1;\n\tfor (auto i : st) ans *= i;\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <numeric>\n#include <functional>\n#include <cctype>\n#include <list>\n#include <limits>\n#include <cassert>\n//#include <boost/multiprecision/cpp_int.hpp>\n\nconst double EPS = (1e-10);\n\n\nusing namespace std;\nusing Int = long long;\n//using namespace boost::multiprecision;\n\nconst Int MOD = 1000000007;\n\nvoid fast_input() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n}\n\ntemplate<typename T>\nT gcd(T a, T b) {\n return b != 0 ? gcd(b, a % b) : a;\n}\n\ntemplate<typename T>\nT lcm(T a, T b) {\n return a * b / gcd(a, b);\n}\n\nvector<pair<int, int>> prime_factorization(int n) {\n int k = n;\n vector<pair<int, int>> ret;\n for (int i = 2; i <= sqrt(n); i++) {\n int cnt = 0;\n while(k % i == 0) {\n k /= i; // 重複を許さないならここを while に\n cnt++;\n }\n if (cnt) ret.push_back({i, cnt});\n }\n if(k > 1) ret.push_back({k, 1});\n return ret;\n}\n\nint main(void) {\n int p, q; cin >> p >> q;\n while (gcd(p, q) != 1) {\n int tmp = gcd(p, q);\n p /= tmp;\n q /= tmp;\n }\n\n vector<pair<int, int>> qfac = prime_factorization(q);\n int ans = 1;\n for (int i = 0; i < qfac.size(); i++) {\n ans *= qfac[i].first;\n }\n\n cout << ans << endl;\n} \n", "#include <iostream>\n#include <vector>\n#include <math.h>\nusing namespace std;\n\nint gcd(int a, int b){\n\tint temp1 = a, temp2 = b;\n\tif (temp1 < temp2){\n\t\tint temp;\n\t\ttemp = temp1;\n\t\ttemp1 = temp2;\n\t\ttemp2 = temp;\n\t}\n\tif(temp2 == 0) return temp1;\n\treturn gcd(temp2, temp1%temp2);\n}\n\nint main(){\n\tint p, q, m;\n\tcin >> p >> q;\n\tm = q/gcd(p,q);\n\tif(m == 1){\n\t\tcout << 1 << endl;\n\t\treturn 0;\n\t}\n\tint temp = m, ans = 1;\n\tif(temp%2 == 0){\n\t\tans *= 2;\n\t\twhile(temp % 2 == 0){\n\t\t\ttemp = temp/2;\n\t\t\tif(temp == 1) break;\n\t\t}\n\t}\n\tfor(int i = 3;i<=m; i+=2){\n\t\tif(temp%i == 0){\n\t\t\tans *= i;\n\t\t\twhile(temp % i == 0){\n\t\t\t\ttemp = temp/i;\n\t\t\t\tif(temp == 1) break;\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}\n", "/* main code starts from line 155. */\n\n/* ---------- STL Libraries ---------- */\n\n// IO library\n#include <cstdio>\n#include <iomanip>\n#include <ios>\n#include <iostream>\n\n// algorithm library\n#include <algorithm>\n#include <cmath>\n#include <numeric>\n\n// container library\n#include <array>\n#include <bitset>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\n\n/* ---------- Namespace ---------- */\n\nusing namespace std;\n\n/* ---------- Type Abbreviation ---------- */\n\ntemplate <typename T>\nusing V = vector<T>;\ntemplate <typename T, typename U>\nusing P = pair<T, U>;\ntemplate <typename T>\nusing PQ = priority_queue<T>;\ntemplate <typename T>\nusing GPQ = priority_queue<T, vector<T>, greater<T>>;\n\nusing ll = long long;\n\n#define fst first\n#define snd second\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n\n/* ---------- conversion ---------- */\n\n#define INT(c) static_cast<int>(c)\n#define CHAR(n) static_cast<char>(n)\n#define LL(n) static_cast<ll>(n)\n#define DOUBLE(n) static_cast<double>(n)\n\n/* ---------- container ---------- */\n\n#define ALL(v) (v).begin(), (v).end()\n#define SIZE(v) (LL((v).size()))\n\n#define FIND(v, k) (v).find(k) != (v).end()\n#define VFIND(v, k) find(ALL(v), k) != (v).end()\n\n#define SORT(v) sort(ALL(v))\n#define GSORT(v) sort(ALL(v), greater<decltype((v).front())>())\n\n/* ---------- repetition ---------- */\n\n#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)\n#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)\n\n/* ---------- Short Functions ---------- */\n\ntemplate <typename T>\nT sq(T a) {\n return a * a;\n}\n\ntemplate <typename T>\nT gcd(T a, T b) {\n if (a > b) return gcd(b, a);\n return a == 0 ? b : gcd(b % a, a);\n}\n\ntemplate <typename T>\nT mypow(T b, T n) {\n if (n == 0) return 1;\n if (n == 1) return n;\n if (n % 2 == 0) {\n return mypow(sq(b), n / 2);\n } else {\n return mypow(b, n - 1) * b;\n }\n}\n\n/* --------------------\ntemplate <typename T>\nT mypow(T b, T n) {\n if (n == 0) return 1;\n if (n == 1) return n % MOD;\n if (n % 2 == 0) {\n return mypow(sq(b) % MOD, n / 2);\n } else {\n return mypow(b, n - 1) * b % MOD;\n }\n}\n-------------------- */\n\n#define fcout cout << fixed << setprecision(10)\n\n/* ----------- debug ---------- */\n\ntemplate <typename T, typename U>\nvoid testP2(T a, U b) {\n cout << \"(\" << a << \", \" << b << \")\" << endl;\n return;\n}\n\ntemplate <typename T>\nvoid testV(T v) {\n cout << \"[\";\n for (auto i : v) {\n cout << i << \", \";\n }\n cout << \"\\b\\b]\" << endl;\n return;\n}\n\ntemplate <typename T>\nvoid testV2(T v) {\n for (auto sv : v) {\n testV(sv);\n }\n cout << endl;\n return;\n}\n\n#define GET_VAR_NAME(variable) #variable\n#define test(x) cout << GET_VAR_NAME(x) << \" = \" << x << endl;\n#define testP(p) \\\n cout << GET_VAR_NAME(p) << \" = \"; \\\n testP2(p.fst, p.snd);\n\n/* ---------- Constants ---------- */\n\n// const ll MOD = 1e9 + 7;\n// const int INF = 1 << 25;\n// const ll INF = 1LL << 50;\n// const double PI = acos(-1);\n// const double EPS = 1e-10;\n// const ll dx[4] = {0, -1, 1, 0};\n// const ll dy[4] = {-1, 0, 0, 1};\n// const ll dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\n// const ll dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\n\n/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */\n\n/* ---------- Type Definition ----------- */\n\n\n/* ---------- Global Variance ----------- */\n\n\n/* ------------- Functions -------------- */\n\n\n/* ----------- Main Function ------------ */\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll p, q;\n cin >> p >> q;\n ll mot = q / gcd(p, q);\n\n ll ans = 1;\n\n while (mot > 1) {\n bool div = false;\n for (ll i = 2; sq(i) <= mot; i++) {\n if (mot % i == 0) {\n ans *= i;\n while (mot % i == 0) {\n mot /= i;\n }\n div = true;\n }\n }\n\n if (!div) {\n ans *= mot;\n mot = 1;\n }\n }\n\n cout << ans << endl;\n return 0;\n}\n\n", "#include<iostream>\nusing namespace std;\n\nint gcd(int a, int b){\n return b == 0 ? a : gcd(b, a%b);\n}\n\nint main(){\n int p, q;\n cin >> p >> q;\n \n int g = gcd(p, q);\n p /= g, q /= g;\n\n int ans = 1;\n for(int i = 2; i*i <= q; i++){\n if(q % i == 0){\n ans *= i;\n while(q % i == 0) q /= i;\n }\n }\n ans *= q;\n\n cout << ans << endl;\n return 0;\n}\n", "#include<stdio.h>\n#include<math.h>\n\nint gcd(int a,int b){\n if(a < b){\n int c = a;\n a = b;\n b = c;\n }\n if(a % b == 0)\n return b;\n return gcd(b,a % b);\n}\n\nbool judgeprime(int n){\n if(n == 1 || n % 2 == 0)\n return false;\n int i,j;\n j = (int)sqrt(n) + 1;\n bool k = true;\n for(i = 3;i < j;i += 2)\n if(n % i == 0){\n k = false;\n break;\n }\n return k;\n}\n\nint nextprime(int prime){\n prime++;\n while(judgeprime(prime++) == false);\n return prime - 1;\n}\n\nint main(void){\n int p,q;\n scanf(\"%d%d\",&p,&q);\n\n q /= gcd(p,q);\n\n int prime = 2,ans = 1;\n\n while(q > 1){\n if(q % prime == 0){\n ans *= prime;\n while(q % prime == 0)\n q /= prime;\n }\n if(judgeprime(q)){\n ans *= q;\n break;\n }\n prime = nextprime(prime);\n\n }\n printf(\"%d\\n\",ans);\n return 0;\n}", "#include<cstdio>\n#include<algorithm>\n#include<cmath>\nint era[100000];\nusing namespace std;\nint main(void)\n{\n\tint p,q,i,j,kou,x,a,b,suu,flg;\n\tscanf(\"%d %d\",&p,&q);\n\ta=q;\tb=p;\n\twhile(1)\t{\n\t\tx=a%b;\n\t\tif(x==0)\tbreak;\n\t\ta=b;\n\t\tb=x;\n\t}\n\tfor(i=2;i<=100000;i++)\tera[i]=1;\n\tfor(i=2;i*i<=100000;i++)\t{\n\t\tif(era[i]==1)\t{\n\t\t\tfor(j=2;j*i<=100000;j++)\t{\n\t\t\t\tera[i*j]=0;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\tkou=b;\n\tx=q/kou;\n\ta=1;\n\tfor(i=2;i<=100000;i++)\t{\n\t\tif(era[i]==1 && x%i==0)\t{\n\t\t\ta=a*i;\n\t\t\twhile(x%i==0)\tx/=i;\n\t\t}\n\t\tif(x==1)\tbreak;\n\t}\n\tif(x!=1)\ta=a*x;\n\tprintf(\"%d\\n\",a);\n\treturn 0;\n}\n\t\n", "#include <iostream>\n#define llint long long\n\nusing namespace std;\n\nllint p, q;\nbool prime[100005];\n\nllint gcd(llint a, llint b)\n{\n\tif(b == 0) return a;\n\treturn gcd(b, a%b);\n}\n\nint main(void)\n{\n\tcin >> p >> q;\n\tllint g = gcd(p, q);\n\t\n\tp /= g, q /= g;\n\t\n\tfor(int i = 2; i < 1005; i++){\n\t\tif(prime[i]) continue;\n\t\tfor(int j = 2*i; j < 100005; j+=i) prime[j] = true;\n\t}\n\t\n\tllint ans = 1;\n\tfor(int i = 2; i < 100005; i++){\n\t\tif(prime[i]) continue;\n\t\tbool flag = false;\n\t\twhile(q % i == 0){\n\t\t\tq /= i;\n\t\t\tflag = true;\n\t\t}\n\t\tif(flag) ans *= i;\n\t}\n\tif(q > 1) ans *= q;\n\tcout << ans << endl;\n\t\n\treturn 0;\n}\n", "import java.util.*;\nimport java.io.*;\nimport java.awt.geom.*;\nimport java.math.*;\n\npublic class Main {\n\n\tstatic final Scanner in = new Scanner(System.in);\n\tstatic final PrintWriter out = new PrintWriter(System.out,false);\n\tstatic boolean debug = false;\n\n\tstatic int gcd(int a, int b) {\n\t\tif (a == 0) return b;\n\t\treturn gcd(b%a, a);\n\t}\n\n\tstatic void solve() {\n\t\tint p = in.nextInt();\n\t\tint q = in.nextInt();\n\t\tp = q / gcd(p, q);\n\t\tlong ans = 1;\n\t\tfor (int i=2; i*i<=p; i++) {\n\t\t\tif (p%i == 0) {\n\t\t\t\tans *= i;\n\t\t\t\twhile (p%i == 0) p /= i;\n\t\t\t}\n\t\t}\n\t\tif (p != 1) ans *= p;\n\t\tout.println(ans);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tdebug = args.length > 0;\n\t\tlong start = System.nanoTime();\n\n\t\tsolve();\n\t\tout.flush();\n\n\t\tlong end = System.nanoTime();\n\t\tdump((end - start) / 1000000 + \" ms\");\n\t\tin.close();\n\t\tout.close();\n\t}\n\n\tstatic void dump(Object... o) { if (debug) System.err.println(Arrays.deepToString(o)); }\n}", "#define _CRT_SECURE_NO_WARNINGS\n#pragma comment (linker, \"/STACK:526000000\")\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef string::const_iterator State;\n#define eps 1e-11L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n\n#define MOD 998244353LL\n#define seg_size 262144*2LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\n#define ALL(x) (x).begin(),(x).end()\n\nunsigned long xor128() {\n\tstatic unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);\n\tunsigned long t = (x ^ (x << 11));\n\tx = y; y = z; z = w;\n\treturn (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\n}\n\nvoid init() {\n\t//iostream::sync_with_stdio(false);\n\tcout << fixed << setprecision(20);\n}\n\n#define int ll\nint gcd(int a, int b) {\n\tif (b == 0) return a;\n\treturn gcd(b, a % b);\n}\nvoid solve() {\n\tint p, q;\n\tcin >> p >> q;\n\tq /= gcd(p, q);\n\tint ans = 1;\n\tfor (int i = 2; i * i <= q; ++i) {\n\t\tif (q % i == 0) {\n\t\t\tans *= i;\n\t\t\twhile (q % i == 0) {\n\t\t\t\tq /= i;\n\t\t\t}\n\t\t}\n\t}\n\tans *= q;\n\tans = max(ans, 2LL);\n\tcout << ans << endl;\n}\n#undef int\nint main() {\n\tinit();\n\tsolve();\n}\n", "#include <iostream>\n#include <map>\n#include <cmath>\nusing namespace std;\n\nint euclid(int x, int y){\n\tint t;\n\twhile (x % y){\n\t\tx %= y;\n\t\tt = x;\n\t\tx = y;\n\t\ty = t;\n\t}\n\treturn y;\n}\nint main(){\n\tint p, q, n, m, t = 2, ans = 1;\n\tcin >> p >> q;\n\tn = q / euclid(p, q);\n\tm = n;\n\tmap<int, int> f;\n\twhile (n > 1 && t < sqrt(m) + 1){\n\t\tif (! (n % t)){\n\t\t\tn /= t;\n\t\t\tf[t] = 1;\n\t\t}\n\t\twhile (! (n % t)){\n\t\t\t++f[t];\n\t\t\tn /= t;\n\t\t}\n\t\t++t;\n\t}\n\tif (n != 1) f[n] = 1;\n\n\tfor (map<int,int>::iterator itr = f.begin(); itr != f.end(); ++itr){\n\t\tans *= itr->first;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Set;\n\npublic class Main {\n\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString str[] = br.readLine().split(\" \");\n\t\tint p = Integer.parseInt(str[0]);\n\t\tint q = Integer.parseInt(str[1]);\n\n\t\tq /= gcd(p, q);\n\n\t\tint ans = 1;\n\t\tfor (int i = 2; i <= Math.sqrt(q); i++) {\n\t\t\tif (q % i == 0) {\n\t\t\t\twhile (q % i == 0) {\n\t\t\t\t\tq /= i;\n\t\t\t\t}\n\t\t\t\tans *= i;\n\t\t\t}\n\t\t}\n\t\tans *= q;\n\t\tSystem.out.println(ans);\n\t}\n\n\tstatic int gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n}\n", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Let's Solve Geometric Problems\n */\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\tline = br.readLine();\n\n\t\tlong p, q;\n\t\tp = parseInt(line.substring(0, line.indexOf(' ')));\n\t\tq = parseInt(line.substring(line.indexOf(' ') + 1));\n\n\t\t//reduce\n\t\tq /= gcd(p, q);\n\n\t\t//is prime?\n\t\tif (!isPrime(q)) {\n\n\t\t\t//factorize\n\t\t\tList<Long> f = factors(q);\n\t\t\tif (f.size() != 1) {\n\t\t\t\tMap<Long, Integer> map = new HashMap<>();\n\t\t\t\tfor (long l : f) {\n\t\t\t\t\tmap.putIfAbsent(l, 0);\n\t\t\t\t\tmap.put(l, map.get(l) + 1);\n\t\t\t\t}\n\t\t\t\tif (map.size() != 1) {\n\t\t\t\t\tboolean multi = true;\n\t\t\t\t\tint _c = -1;\n\t\t\t\t\tfor (int c : map.values()) {\n\t\t\t\t\t\tif (_c == -1) {\n\t\t\t\t\t\t\t_c = c;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (c != _c) {\n\t\t\t\t\t\t\t\tmulti = false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tq = 1;\n\t\t\t\t\tfor (long l : map.keySet()) {\n\t\t\t\t\t\tq *= l;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tq = f.get(0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(q);\n\n\t}//end main\n\n\tstatic long gcd(long a, long b) {\n\t\tif (b == 0) return a;\n\t\treturn gcd(b, a % b);\n\t}\n\n\tstatic boolean isPrime(long n) {\n\t\tif (n == 2) return true;\n\t\tif (n < 2 || n % 2 == 0) return false;\n\n\t\tint i = 3;\n\t\twhile (i <= Math.sqrt(n)) {\n\t\t\tif (n % i == 0) return false;\n\t\t\telse i += 2;\n\t\t}\n\t\treturn true;\n\t}\n\n\tstatic List<Long> factors(long n) {\n\t\tif (n == 0) return new ArrayList<Long>() {\n\t\t\t{\n\t\t\t\tadd(1L);\n\t\t\t}\n\t\t};\n\t\tList<Long> fs = new ArrayList<>();\n\t\tlong p = 2;\n\t\tfor (long i = p; i <= n; i++) {\n\t\t\twhile (n % i == 0) {\n\t\t\t\tfs.add(i);\n\t\t\t\tn /= i;\n\t\t\t}\n\t\t}\n\t\treturn fs;\n\t}\n}", "#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <algorithm>\n\n#define CH(N,A,B) (A<=N&&N<B)\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)\n\nusing namespace std;\n\nint gcd(int a,int b)\n{\n\tif (a%b==0)\n\t{\n\t\treturn(b);\n }\n\telse\n\t{\n\t\treturn(gcd(b,a%b));\n }\n}\n\nint main() {\n int p, q;\n cin>>p>>q;\n\n\tq = q/gcd(p,q); /*??????????´??????????????????????*/\n\n\t//int qq = q/gcd(p,q);\n\tint qq = q;\n\tlong long ans = 1;\n\tfor(int j=2; j*j<=qq; j++){\n\t\tif(qq % j == 0){\n\t\t\tans *= j;\n\t\t\twhile(qq % j == 0){\n\t\t\t\tqq /= j;\n\t\t\t}\n\t\t}\n\t}\n\tif(qq != 1) ans *= qq;\n\n\tcout<<ans<<endl;\n\n return 0;\n}", "#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nusing std::setprecision;\nusing std::fixed;\nusing std::pair;\nusing std::make_pair;\nusing std::string;\nusing std::vector;\nusing std::list;\nusing std::map;\nusing std::set;\nusing std::queue;\nusing std::priority_queue;\nusing std::stack;\n\ntypedef vector<int> VI;\ntypedef vector<vector<int> > VII;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\n\nint gcd (int p, int q) {\n int temp;\n if (q == 0) {\n return p;\n } else {\n temp = p % q;\n p = q;\n q = temp;\n return gcd(p, q);\n }\n return 0;\n}\n\nint main(void) {\n int p;\n int q;\n cin >> p >> q;\n q /= gcd(p, q);\n\n int ans = 1;\n\n for (int i = 2; i * i <= q; i++) {\n if (q == 1) {\n break;\n }\n if (q % i != 0) {\n continue; \n }\n while (q % i == 0) {\n q /= i;\n }\n ans *= i;\n }\n cout << ans * q << endl;\n return 0;\n}", "#include <iostream>\nusing namespace std;\n\nlong long GCD(long long a, long long b) {\n if (b == 0) return a;\n else return GCD(b, a % b);\n}\n\nint main() {\n long long p, q; cin >> p >> q;\n long long d = GCD(p, q);\n q /= d;\n for (long long v = 2; v*v <= q; ++v) {\n while (q % (v*v)== 0) q /= v;\n }\n cout << q << endl;\n}\n", "#include <algorithm>\n#include <cmath>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#include <cassert>\n#include <functional>\n\nusing namespace std;\n\n#define LOG(...) printf(__VA_ARGS__)\n//#define LOG(...)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n#define RSORT(c) sort((c).rbegin(),(c).rend())\n#define CLR(a) memset((a), 0 ,sizeof(a))\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\nconst int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };\n\nstruct UnionFind {\n\tvector<int> v;\n\tUnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }\n\tint find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }\n\tvoid unite(int x, int y) { v[find(x)] = find(y); }\n};\n\nll gcd(ll a, ll b) {\n\tif (a < b)\n\t\tswap(a, b);\n\twhile (a%b != 0) {\n\t\ta %= b;\n\t\tswap(a, b);\n\t}\n\treturn b;\n}\n\nint main() {\n\tmap<int, int> mpii;\n\tFOR(i, 1, 40000)\n\t\tmpii[i*i] = i;\n\tint p, q;\n\tcin >> p >> q;\n\tq /= gcd(p, q);\n\tset<int> soinsu;\n\tint copy = q;\n\tFOR(i,2,sqrt(copy)+1) {\n\t\twhile (q%i == 0) {\n\t\t\tq /= i;\n\t\t\tsoinsu.insert(i);\n\t\t}\n\t}\n\tsoinsu.insert(q);\n\tll ans = 1;\n\tfor (int a : soinsu)\n\t\tans *= a;\n\tcout <<ans << endl;\n}", "#include<iostream>\nusing namespace std;\nint gcd(int x, int y) {\n\treturn y == 0 ? x : gcd(y, x%y);\n}\nint main() {\n\tint p, q, r=1;\n\tcin >> p >> q;\n\tq = q / gcd(q, p);\n\tfor (int i = 2; i*i <= q; ++i) {\n\t\tif (q%i == 0) {\n\t\t\tr *= i;\n\t\t\twhile (q%i == 0) q /= i;\n\t\t}\n\t}\n\tcout << r * q << endl;\n}\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tstatic PrintWriter out;\n\tstatic InputReader ir;\n\n\tstatic void solve() {\n\t\tint p = ir.nextInt();\n\t\tif(p==0){\n\t\t\tout.println(2);\n\t\t\tSystem.exit(0);\n\t\t}\n\t\tint q = ir.nextInt();\n\t\tint a = q / gcd(p, q);\n\t\tint ret=1;\n\t\tfor(int i=2;i<=Math.sqrt(a);i++){\n\t\t\tif(a%i!=0)\n\t\t\t\tcontinue;\n\t\t\tret*=i;\n\t\t\twhile(a%i==0)\n\t\t\t\ta/=i;\n\t\t}\n\t\tret*=a;\n\t\tout.println(ret);\n\t}\n\n\tpublic static int gcd(int a, int b) {\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\treturn gcd(b, a % b);\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tir = new InputReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\tstatic class InputReader {\n\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <cmath>\n\n#define REP(i,a,b) for(int i=int(a);i<int(b);i++)\n\nusing namespace std;\n\ntypedef long long int lli;\n\nlli gcd(lli a, lli b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n}\n\nint main () {\n lli p, q;\n cin >> p >> q;\n lli t = gcd(p, q);\n q /= t;\n set<int> sl;\n lli num = q;\n for (int i = 2; i <= ceil(sqrt(q) + 1e-9); i++) {\n if (num % i == 0) {\n sl.insert(i);\n while (num % i == 0) num /= i;\n }\n }\n sl.insert(num);\n lli ans = 1;\n for (auto it : sl) ans *= it;\n cout << ans << endl;\n return 0;\n}", "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<queue>\n#include<set>\n#include<functional>\n#include<map>\nusing namespace std;\n\nint gcd(int a, int b) {\n\tif (b == 0)return a;\n\treturn gcd(b, a%b);\n}\nint main() {\n\tint a, b; cin >> a >> b;\n\tb = b / gcd(a, b); a = b;\n\tint c = 1;\n\tfor (int i = 2; i*i <= a; i++) {\n\t\tif (b%i == 0)c *= i;\n\t\twhile (b%i == 0)b /= i;\n\t}\n\tif (b != 1)c *= b;\n\tcout << c << endl;\n}", "import java.util.*;\nimport java.io.*;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tsolve();\n\t}\n\tpublic static void solve(){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint p = sc.nextInt();\n\t\tint q = sc.nextInt();\n\t\tif(q%p==0){\n\t\t\tq /= p;\n\t\t\tp = 1;\n\t\t}\n\t\tboolean[] judge = new boolean[(int)Math.sqrt(1000000000)+5];\n\t\tArrays.fill(judge,true);\n\t\tjudge[0] = false;\n\t\tjudge[1] = false;\n\t\tboolean flag = false;\n\t\tfor(int i=2;i<judge.length;i++){\n\t\t\tif(judge[i]){\n\t\t\t\tif(p%i==0 && q%i==0){\n\t\t\t\t\tp /= i;\n\t\t\t\t\tq /= i;\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tfor(int j=i*2;j<judge.length;j+=i){\n\t\t\t\t\tjudge[j] = false;\n\t\t\t\t}\n\t\t\t\tif(flag){\n\t\t\t\t\tflag = false;\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=2;i<judge.length;i++){\n\t\t\tif(judge[i] && q%(i*i)==0){\n\t\t\t\tq /= i;\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(q);\n\t}\n}", "#include \"bits/stdc++.h\"\n\n#define REP(i, n, N) for(ll i=(n); i<(N); i++)\n#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)\n#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)\n#define CK(n, a, b) ((a)<=(n)&&(n)<(b))\n#define ALL(v) (v).begin(),(v).end()\n#define MCP(a, b) memcpy(b,a,sizeof(b))\n#define P(s) cout<<(s)<<endl\n#define P2(a, b) cout<<(a)<<\" \"<<(b)<<endl\n#define V2(T) vector<vector<T>>\ntypedef long long ll;\nusing namespace std;\nconst ll MOD = 1e9 + 7;\nconst ll INF = 1e18;\n\nll gcd(ll A,ll B){\n if(A<B) swap(A,B);\n return (B==0 ? A : gcd(B,A%B));\n}\n\nint main(){\n ll p,q,tar,ans=1;\n cin >> p >> q;\n\n tar = q/gcd(q,p);\n\n for(ll i=2;i*i<=tar;i++){\n if(tar%i==0){\n ans*=i;\n while(tar%i==0) tar/=i;\n }\n }\n cout << ans * tar << endl;\n}\n", "#include <iostream>\n#include <vector>\nusing namespace std;\nint main(){\n\n int p,q,use;\n int so[40000]={0};\n\n cin>>p>>q;\n use=q;\n int a;\n while(q%p!=0){\n a=q%p;\n q=p;\n p=a;\n }\n use/=p;\n q=use;\n vector <int> sonaka;\n for(int i=2;i<40000;i++) if(so[i]==0){\n sonaka.push_back(i);\n for(int j=i*2;j<40000;j+=i) so[j]=1;\n }\n int result=1;\n for(int i=0;sonaka[i]<=use&&i<sonaka.size();i++){\n if(use%sonaka[i]==0){\n result*=sonaka[i];\n while(use%sonaka[i]==0) use/=sonaka[i];\n }\n }\n\n cout<<result*use<<endl;\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\n// calculate |gcd|.\n// if ether num is 0, return 0\nlong long GCD(long long left, long long right) {\n if(left == 0 || right == 0) return 0;\n if(left < 0) left *= -1;\n if(right < 0) right *= -1;\n if(left < right) swap(left, right);\n long long nextnum, ansgcd = -1;\n while(ansgcd == -1) {\n nextnum = left % right;\n if(nextnum == 0) ansgcd = right;\n left = right;\n right = nextnum;\n }\n return ansgcd;\n}\n\nlong long LCM(long long left, long long right) {\n return left / GCD(left, right) * right;\n}\n\nlong long p, q;\n\nlong long solve();\n\nint main() {\n cin >> p >> q;\n\n cout << solve() << endl;\n return 0;\n}\n\nlong long solve() {\n long long now = q / GCD(p, q), ans = 1;\n for(long long i = 2; i * i <= now; ++i)\n if(now % i == 0) {\n ans *= i;\n while(now % i == 0) now /= i;\n }\n if(now > 1) ans *= now;\n return ans;\n}\n", "#include <iostream>\n#include <vector>\n#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint P, Q;\nbool p[100000];\nvector<int> v;\n\nint gcd(int a, int b) {\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\nbool prime(int n) {\n REP(i, 0, v.size()) if(n % v[i] == 0) return false;\n return true;\n}\n\nll solve() {\n ll ans = 1;\n REP(i, 0, v.size()) if(Q % v[i] == 0) {\n ans *= v[i];\n while(Q % v[i] == 0) Q /= v[i];\n }\n if(prime(Q)) ans *= Q;\n return ans;\n}\n\nint main(void) {\n REP(i, 0, 100000) p[i] = true;\n p[0] = p[1] = false;\n REP(i, 0, 100000) if(p[i]) for(int j = i * 2; j < 100000; j += i) p[j] = false;\n REP(i, 0, 100000) if(p[i]) v.push_back(i);\n\n cin >> P >> Q;\n Q = Q / gcd(P, Q);\n cout << solve() << endl;\n return 0;\n}", "#include <iostream>\n#include <map>\n#include <cmath>\nusing namespace std;\n\nint euclid(int x, int y){\n\tint t;\n\twhile (x % y){\n\t\tx %= y;\n\t\tt = x;\n\t\tx = y;\n\t\ty = t;\n\t}\n\treturn y;\n}\nint main(){\n\tint p, q, n, m, t = 2, ans = 1;\n\tcin >> p >> q;\n\tn = q / euclid(p, q);\n\tm = n;\n\tmap<int, int> f;\n\twhile (n > 1 && t < sqrt(m) + 1){\n\t\tif (! (n % t)){\n\t\t\tn /= t;\n\t\t\tf[t] = 1;\n\t\t}\n\t\twhile (! (n % t)){\n\t\t\t++f[t];\n\t\t\tn /= t;\n\t\t}\n\t\t++t;\n\t}\n\tif (n != 1) f[n] = 1;\n\n\tfor (auto itr = f.begin(); itr != f.end(); ++itr){\n\t\tans *= itr->first;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <iostream>\nusing namespace std;\n\n// a>b\nint gcd(int a, int b)\n{\n\tif (b == 0) return a;\n\treturn gcd(b, a%b);\n}\n\nint main()\n{\n\tint p, q;\n\tcin >> p >> q;\n\t\n\tq /= gcd(p, q);\n\tint ans = 1;\n\tfor (int i = 2; i*i <= q; i++) {\n\t\tif (q%i == 0) {\n\t\t\tans *= i;\n\t\t\twhile (q%i == 0) q /= i;\n\t\t}\n\t}\n\n\tcout << ans*q << endl;;\n return 0;\n}", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashSet;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\tint P,Q;\n\tHashSet<Integer> set;\n\tpublic void setFactors(int n)\n\t{\n\t\tset = new HashSet<Integer>();\n\t\tfor(int j = 2;(long)j * j <= n;j++){\n\t\t\twhile(n % j == 0){\n\t\t\t\tn /= j;\n\t\t\t\tset.add(j);\n\t\t\t}\n\t\t}\n\n\t\tif(n > 1){\n\t\t\tset.add(n);\n\t\t}\n\t}\n\n\tpublic int gcd(int x,int y){\n\t\treturn y == 0 ? x : gcd(y,x%y);\n\t}\n\n\tpublic void solve() {\n\t\tP = nextInt();\n\t\tQ = nextInt();\n\t\tint g = gcd(P,Q);\n\t\tQ /= g;\n\t\tP /= g;\n\t\tsetFactors(Q);\n\n\t\tint sum = 1;\n\t\tfor(int s : set){\n\t\t\tsum *= s;\n\t\t}\n\n\t\tout.println(sum);\n\t}\n\tpublic static void main(String[] args) {\n\t\tout.flush();\n\t\tnew Main().solve();\n\t\tout.close();\n\t}\n\n\t/* Input */\n\tprivate static final InputStream in = System.in;\n\tprivate static final PrintWriter out = new PrintWriter(System.out);\n\tprivate final byte[] buffer = new byte[2048];\n\tprivate int p = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (p < buflen)\n\t\t\treturn true;\n\t\tp = 0;\n\t\ttry {\n\t\t\tbuflen = in.read(buffer);\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\tif (buflen <= 0)\n\t\t\treturn false;\n\t\treturn true;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrint(buffer[p])) {\n\t\t\tp++;\n\t\t}\n\t\treturn hasNextByte();\n\t}\n\n\tprivate boolean isPrint(int ch) {\n\t\tif (ch >= '!' && ch <= '~')\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tprivate int nextByte() {\n\t\tif (!hasNextByte())\n\t\t\treturn -1;\n\t\treturn buffer[p++];\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = -1;\n\t\twhile (isPrint((b = nextByte()))) {\n\t\t\tsb.appendCodePoint(b);\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic long nextLong() {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}", "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\n\nint gcd(int a, int b) { if (!b)return a; return gcd(b, a%b); }\nint main() {\n\tint p, q; cin >> p >> q;\n\tq /= gcd(p, q);\n\tmap<int, int>m;\n\tfor (int i = 2; i*i <= q; i++) {\n\t\twhile (q%i == 0) {\n\t\t\tm[i]++; q /= i;\n\t\t}\n\t}\n\tif (q != 1)m[q] = 1;\n\tint c = 1;\n\tfor (auto i : m) {\n\t\tc *= i.first;\n\t}\n\tcout << c << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing VI = vector<ll>;\nusing VV = vector<VI>;\nusing VS = vector<string>;\nusing PII = pair<ll, ll>;\n\n// tourist set\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p);\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p);\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p);\n\nstring to_string(const string& s) {\n return '\"' + s + '\"';\n}\n\nstring to_string(const char* s) {\n return to_string((string) s);\n}\n\nstring to_string(bool b) {\n return (b ? \"true\" : \"false\");\n}\n\nstring to_string(vector<bool> v) {\n bool first = true;\n string res = \"{\";\n for (int i = 0; i < static_cast<int>(v.size()); i++) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(v[i]);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <size_t N>\nstring to_string(bitset<N> v) {\n string res = \"\";\n for (size_t i = 0; i < N; i++) {\n res += static_cast<char>('0' + v[i]);\n }\n return res;\n}\n\ntemplate <typename A>\nstring to_string(A v) {\n bool first = true;\n string res = \"{\";\n for (const auto &x : v) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <typename A, typename B>\nstring to_string(pair<A, B> p) {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \")\";\n}\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" + to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";\n}\n\nvoid debug_out() { cerr << '\\n'; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n// tourist set end\n\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\n#define FOR(i,a,b) for(ll i=(a);i<(b);++i)\n#define rep(i,b) FOR(i, 0, b)\n#define ALL(v) (v).begin(), (v).end()\n#define p(s) cout<<(s)<<'\\n'\n#define p2(s, t) cout << (s) << \" \" << (t) << '\\n'\n#define br() p(\"\")\n#define pn(s) cout << (#s) << \" \" << (s) << '\\n'\n#define p_yes() p(\"YES\")\n#define p_no() p(\"NO\")\n#define SZ(x) ((int)(x).size())\n#define SORT(A) sort(ALL(A))\n#define RSORT(A) sort(ALL(A), greater<ll>())\n#define MP make_pair\n\nvoid no(){p_no(); exit(0);}\nvoid yes(){p_yes(); exit(0);}\n\nconst ll mod = 1e9 + 7;\nconst ll inf = 1e18;\nconst double PI = acos(-1);\n\n// 素因数分解\n// その素因数が何個あるかのmapを返す\nmap<ll, ll> factorize(ll n){\n map<ll, ll> mp;\n ll sq = sqrt(n);\n FOR(i, 2, sq+1){\n while(n%i==0){\n mp[i]++;\n n/=i;\n }\n }\n // 残り\n if(n!=1){\n mp[n]++;\n }\n return mp;\n}\n\nll gcd(ll a,ll b){\n if(b == 0) return a;\n return gcd(b,a%b);\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n // input\n ll p, q;\n cin >> p >> q;\n\n ll g = gcd(p, q);\n p /= g;\n q /= g;\n\n auto mp = factorize(q);\n\n ll ans = 1;\n for(auto pa : mp){\n ans *= pa.first;\n }\n p(ans);\n\n \n return 0;\n}\n", "#include <stdio.h>\n#include <math.h>\n\nint gcd(int a, int b) {\n int t;\n while(b) {\n t = a % b;\n a = b;\n b = t;\n }\n return a;\n}\n\nint main(void){\n int p, q, i, j, ans = 1, bef = 0;\n scanf(\"%d%d\", &p, &q);\n q /= gcd(p, q);\n for(i = 2; i <= sqrt(q) + 1;) {\n if(!(q % i)) {\n if(bef != i) ans *= i, bef = i;\n q /= i;\n } else ++i;\n }\n if(bef != q) ans *= q;\n printf(\"%d\\n\", ans);\n return 0;\n}\n", "import math\np,q=map(int,input().split())\nq//=math.gcd(p,q)\ni=2\na=1\nwhile i*i<=q:\n if q%i==0:\n a*=i\n while q%i==0:\n q//=i\n i+=1\nprint(a*q)\n", "#include <iostream>\n#include <vector>\nusing namespace std;\nint main(){\n\n int p,q,use;\n int so[40000]={0};\n\n cin>>p>>q;\n use=q;\n int a;\n while(q%p){\n a=q%p;\n q=p;\n p=a;\n }\n use/=p;\n vector <int> sonaka;\n for(int i=2;i<40000;i++) if(!so[i]){\n sonaka.push_back(i);\n for(int j=i*2;j<40000;j+=i) so[j]=1;\n }\n int result=1;\n for(int i=0;sonaka[i]<=use&&i<sonaka.size();i++) if(use%sonaka[i]==0){\n result*=sonaka[i];\n while(use%sonaka[i]==0) use/=sonaka[i];\n }\n cout<<result*use<<endl;\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define N 1000000000\ntypedef long long int ll;\nll gcd(ll a,ll b){\nif(b==0)return a;\nelse return gcd(b,a%b);\n\n}\nqueue<ll> q;\nvector<bool> prime(N+1,true);\nvoid make(ll M){\n\tprime[0]=prime[1]=false;\n\tll i;\n\tfor( i=2;i*i<=M+1;i++){\n\tif(prime[i]){\n\t\tll j=2;\n\t\tq.push(i);\n\twhile(i*j<M+1){\n\tprime[i*j]=false;\n\tj++;\n\t\t}\n\n\t}\n\n\t}\n/*\tfor(;i<=M;i++){\n\t\tif(prime[i])q.push(i);\n\t}*/\nreturn;\n\n}\nint main(){\nll a,b;\n//cout<<\"ok\"<<endl;\n\ncin>>a>>b;\n//make(max(a,b));\n//cout<<\"ok\"<<endl;\n//cout<<b/gcd(a,b)<<endl;\nll c=b/gcd(a,b);\n//cout<<c<<endl;\nll ans = 1;\nll ma = c;\nfor(ll i=2;i*i<=ma;i++){\n\tif(c%i==0){\n\tans*=i;\n\twhile(c%i==0)c/=i;\n\t}\n}\n/*while(!q.empty()){\n\tll d = q.front();\n//\tcout<<d<<endl;\nif(c%d==0){\n\twhile(c%d==0)c/=d;\n\tans*=d;\n}\nq.pop();\n}*/\n\n//cout<<ans<<' '<<c<<endl;\nans*=c;\ncout<<ans<<endl;\nreturn 0;\n\n}\n\n\n\n", " \n#include <bits/stdc++.h>\nusing namespace std;\nusing vi=vector<int>;\nusing vvi=vector<vi>;\nusing vs=vector<string>;\nusing msi=map<string,int>;\nusing mii=map<int,int>;\nusing pii=pair<int,int>;\nusing vlai=valarray<int>;\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define range(i,s,n) for(int i=s;i<n;i++)\n#define all(a) a.begin(),a.end()\n#define rall(a) a.rbegin(),a.rend()\n#define fs first\n#define sc second\n#define pb push_back\n#define eb emplace_back\n \nconstexpr int gcd(int a,int b){return b?gcd(b,a%b):a;}\nconstexpr int lcm(int a,int b){return a*b/gcd(a,b);}\n \nclass Eratosthenes{\n public:\n int n, sqlim;\n vector<bool> prime;\n Eratosthenes(int N):n(N+1){\n sqlim=(int)ceil(sqrt(n));\n prime=vector<bool>(n,1); prime[0]=prime[1]=0;\n for(int i=2;i<=sqlim;i++) if(prime[i]) for(int j=i*i;j<=n;j+=i) prime[j]=0;}\n vector<int> primeArray(int s=0, int l=10000){vi ret; for(int i=s;ret.size()!=l;i++) if(prime[i]) ret.push_back(i); return ret;}\n};\n\n\nint main(){\n\tint p,q;\n\tcin>>p>>q;\n\tq/=gcd(p,q);\n\tvi v;\n\tfor(int i=2;i*i<=q;i++){\n\t if(q%i==0){\n\t v.pb(i);\n\t while(q%i==0)q/=i;\n\t }\n\t}\n\tv.pb(q);\n\tcout<<accumulate(all(v),1,[](int a,int b){return a*b;})<<endl;\n\treturn 0;\n}", "#include<cstdio>\n#include<cstring>\n\nlong long int gcd(long long int p, long long int q) {\n if(!q) return p;\n if(q>p) return gcd(q, p);\n return gcd(q, p%q);\n}\n\nint main(void) {\n long long int p,q;\n scanf(\"%lld%lld\",&p,&q);\n long long int g = gcd(p,q);\n p/=g; q/=g;\n\n long long int b=1;\n for(long long int i=2; q-1 && i*i<=q; i++) {\n if(q%i) continue;\n b*=i;\n while(!(q%i)) q/=i;\n }\n b*=q;\n printf(\"%lld\\n\",b);\n\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = int64_t;\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\n\nint main() {\n ll P, Q;\n cin >> P >> Q;\n ll G = gcd(P, Q);\n Q /= G;\n ll ans = 1;\n ll QQ = Q;\n for(ll i = 2; i * i <= Q; i++) {\n ll cnt = 0;\n while(QQ % i == 0) {\n QQ /= i;\n cnt++;\n }\n if(cnt) ans *= i;\n }\n\n if(QQ > 1) ans *= QQ;\n\n cout << max<ll>(2, ans) << endl;\n return 0;\n}\n\n", "import java.util.Scanner;\n\npublic class Main {\n\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n int P = sc.nextInt();\n int Q = sc.nextInt();\n Q /= gcd(P, Q);\n int ans = 1;\n for (int i = 2; i * i <= Q; i++) {\n if (Q % i == 0) {\n while (Q % i == 0) {\n Q /= i;\n }\n ans *= i;\n }\n }\n ans *= Q;\n System.out.println(ans);\n }\n\n\n static int gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n}", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 998244353\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\n\n\ndef main():\n rr = []\n\n while True:\n p,q = LI()\n g = fractions.gcd(p,q)\n t = q//g\n k = 1\n if t % 2 == 0:\n k *= 2\n while t % 2 == 0:\n t //= 2\n for i in range(3,int(math.sqrt(t))+2,2):\n if t % i > 0:\n continue\n k *= i\n while t % i == 0:\n t //= i\n rr.append(t*k)\n\n break\n\n\n\n return '\\n'.join(map(str, rr))\n\n\nprint(main())\n\n\n", "def gcd(a, b):\n while b: a, b = b, a % b\n return a\n\na,b=map(int,input().split())\nb//=gcd(a,b)\na,c=2,1\nwhile a*a<=b:\n if b%a==0:\n c*=a\n while b%a==0:b//=a\n a+=1\nprint([c*b,c][b==1])", "#include<iostream>\n#include <list>\n#include<stack>\n#include<queue>\n#include <vector>\n#include <set>\n#include<algorithm>\n#include<math.h>\n#include<stdlib.h>\n#include<string>\n#include <functional>\n#include<fstream>\n\n#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)\n#define REP(i,n) FOR((i),0,(n))\n#define LL long long\n#define CLR(a) memset((a),0,sizeof(a))\n#define SZ(x) (int((x).size()))\n#define WAITING(str) int str;std::cin>>str;\n#define DEBUGING(str) cout<<str<<endl\nusing namespace std;\n\nconst LL MOD = 1000000007;// 10^9+7\nconst int INF = (1 << 30);\n\n\n//変数\nLL p, q;\n\n\n\n\n//素因数分解\n//in: number\n//out: prime numbers\ntemplate<typename T>\nvector<T> prime_factorization(T n)\n{\n\tvector<T> res;\n\tT check = 2;\n\n\twhile (check*check <= n) {\n\t\tif (n%check == 0) {\n\t\t\tn /= check;\n\t\t\tres.push_back(check);\n\t\t}\n\t\telse {\n\t\t\tcheck++;\n\t\t}\n\t}\n\tif (n != 1) res.push_back(n);\n\tsort(res.begin(), res.end());\n\treturn res;\n}\n\n\n//最大公約数\n//(ユークリッドの互除法)\n//in: a,b\n//out: GCD(a,b)\ntemplate<typename T>\nT GCD(T a, T b)\n{\n\tif (a < b)swap(a, b);\n\tint r = a % b;\n\twhile (r != 0) {\n\t\ta = b;\n\t\tb = r;\n\t\tr = a % b;\n\t}\n\treturn b;\n}\n\n\n\n\n//サブ関数\n//入力\nvoid input()\n{\n\tcin >> p >> q;\n}\n\n//計算\nvoid calc()\n{\n\tLL gcd = GCD(p, q);\n\tq /= gcd;\n\tauto primes = prime_factorization(q);\n\n\tset<LL> primeKind;\n\tfor (auto prime : primes)primeKind.insert(prime);\n\n\tLL res = 1;\n\tfor (auto prime : primeKind)res *= prime;\n\n\tcout << res << endl;\n}\n\n\n//出力\nvoid output()\n{\n\n}\n\n\n//デバッグ\nvoid debug()\n{\n\tint N;\n\tcin>>N;\n}\n\n\n//メイン関数\nint main()\n{\n\tinput();\n\tcalc();\n\toutput();\n\tdebug();\n\t\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < n; i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef pair<ll,P> PP;\nconst long long int MOD = 1000000007;\nconst int INF = 1000000000;\n\nint p, q;\n\nint main(){\n cin >> p >> q;\n int pp = p, qq = q;\n while(qq){\n pp %= qq;\n swap(pp,qq);\n }\n q /= pp;\n int ans = 1;\n for(int i = 2;;i++){\n if(i*i > q) break;\n if(q%i == 0){\n ans *= i;\n }\n while(q%i == 0){\n q /= i;\n }\n }\n ans *= q;\n cout << ans << endl;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\n\n//#define int long long\n#define DBG 1\n#define dump(o) if(DBG){cerr<<#o<<\" \"<<o<<endl;}\n#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<\" \"<<e;cerr<<endl;}\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)\n#define all(c) c.begin(),c.end()\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)(1e9 + 7);\n\n//?????§??¬?´???°\nint gcd(int x, int y) { return y ? gcd(y, x%y) : x; }\n\n//?????????: n??\\???????´???°\nvector<int> getPrimes(int n) {\n\tvector<char> is_prime(n + 1, true);\n\tis_prime[0] = is_prime[1] = false;\n\tfor (int i = 2; i*i <= n; i++)\n\t\tif (is_prime[i]) {\n\t\t\tint j = i + i;\n\t\t\twhile (j <= n) {\n\t\t\t\tis_prime[j] = false;\n\t\t\t\tj += i;\n\t\t\t}\n\t\t}\n\tvector<int> primes;\n\trep(i, 0, n + 1)\n\t\tif (is_prime[i])\n\t\t\tprimes.emplace_back(i);\n\treturn primes;\n}\n\n//?´??????°????§£\nvector<int> primeFactorization(int x) {\n\tvector<int> primes = getPrimes(sqrt(x)); //???x??\\???????´???°???????????????????????°??????\n\tvector<int> factors;\n\tfor (auto &p : primes) {\n\t\twhile (x%p == 0) {\n\t\t\tx /= p;\n\t\t\tfactors.emplace_back(p);\n\t\t}\n\t}\n\tif (x != 1)factors.emplace_back(x);\n\treturn factors;\n}\n\n//??§?¨???§??? vector?????????????´??????????\n//v: ??§???????????§?¨??????? ????????????\ntemplate<typename T>\nvoid compress(vector<T> &v) {\n\tsort(v.begin(), v.end());\n\tv.erase(unique(v.begin(), v.end()), v.end());\n}\n\nsigned main() {\n\tint p, q; cin >> p >> q;\n\tint g = gcd(p, q);\n\tint a = q / g;\n\tint ans = 1;\n\tvector<int> factors = primeFactorization(a);\n\tcompress(factors);\n\trep(i, 0, factors.size()) {\n\t\tans *= factors[i];\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", " #include <iostream>\n#include <cmath>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\n\nint gcd(int n, int m) {\n\tif ( n%m == 0 ) {\n\t\treturn m;\n\t}\n\telse {\n\t\treturn gcd(m,n%m);\n\t}\n}\n\nint main(void) {\n\tint p,q;\n\tcin >> p >> q;\n\tint n = q;\n\tint m = p;\n\tint l = gcd(n,m);\n\twhile ( l != 1 ) {\n\t\tn = n/l;\n\t\tm = m/l;\n\t\tl = gcd(n,m);\n\t}\n\twhile ( (int)sqrt(n) == sqrt(n) ) {\n\t\tn = sqrt(n);\n\t}\n\tfor (int i = 2; i*i < n+1; i++) {\n\t\tif ( n%(i*i) == 0 ) {\n\t\t\tn = n/i;\n\t\t\ti--;\n\t\t}\n\t}\n\tcout << n << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <queue>\n#include <sstream>\n\nusing namespace std;\n\nlong long int LCM(long long int a, long long int b){\n\tlong long int dummy1, dummy2, dummy;\n\tdummy1 = max(a, b);\n\tdummy2 = min(a, b);\n\twhile(true){\n\t\tdummy = dummy1 % dummy2;\n\t\tdummy1 = dummy2;\n\t\tdummy2 = dummy;\n\t\tif(dummy == 0){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn (a / dummy1) * (b / dummy1) * dummy1;\n}\n\nlong long int GCD(long long int a, long long int b){\n\tlong long int dummy1, dummy2, dummy;\n\tdummy1 = max(a, b);\n\tdummy2 = min(a, b);\n\twhile(true){\n\t\tdummy = dummy1 % dummy2;\n\t\tdummy1 = dummy2;\n\t\tdummy2 = dummy;\n\t\tif(dummy == 0){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn dummy1;\n}\n\nint main(){\n\t\n\tint N = 100000;\n\t\n\tbool a[100000];\n\t\n\tfor(int i = 0; i < N; i++){\n\t\ta[i] = true;\n\t}\n\t\n\ta[0] = false;\n\ta[1] = false;\n\t\n\tfor(int i = 2; i < N; i++){\n\t\tif(a[i]){\n\t\t\tfor(int j = i * 2; j < N; j += i){\n\t\t\t\ta[j] = false;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tlong long int p, q;\n\t\n\tcin >> p >> q;\n\t\n\tq = q / GCD(p, q);\n\t\n\tlong long int ans = 1;\n\tlong long int sq_q = sqrt(q);\n\t\n\tfor(int i = 1; i <= sq_q; i++){\n\t\tif(a[i] && q % i == 0){\n\t\t\tans *= i;\n\t\t\twhile(q % i == 0){\n\t\t\t\tq /= i;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tans *= q;\n\t\n\tcout << ans << endl;\n\t\n\treturn 0;\n}", "#include\"bits/stdc++.h\"\nusing namespace std;\nusing ll = int64_t;\n\nll gcd(ll a, ll b) {\n return (b == 0 ? a : gcd(b, a % b));\n}\n\nbool isPrime(ll n) {\n for (ll i = 2; i * i <= n; i++) {\n if (n % i == 0) {\n return false;\n }\n }\n\n return true;\n}\n\nint main() {\n ll p, q;\n cin >> p >> q;\n ll tar = q / gcd(p, q);\n\n if (isPrime(tar)) {\n cout << tar << endl;\n return 0;\n }\n\n ll ans = 1;\n for (ll i = 2; i * i <= tar; i++) {\n if (tar % i == 0) {\n ans *= i;\n while (tar % i == 0) {\n tar /= i;\n }\n\n if (isPrime(tar)) {\n ans *= tar;\n break;\n }\n }\n }\n\n cout << ans << endl;\n}\n", "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tArrayList<Long> yaku = new ArrayList<Long>();\n\n\t\tScanner scn = new Scanner(System.in);\n\t\tlong p = scn.nextLong(), q = scn.nextLong();\n\t\tscn.close();\n\t\tlong qs;\n\t\tlong ans = 1;\n\t\tlong bp = p,bq = q,buf = p;\n\n\t\twhile(bq % bp != 0) {\n\t\t\tbuf = bq % bp;\n\t\t\tbq = bp;\n\t\t\tbp = buf;\n\t\t}\n\t\tqs = q/buf;\n\t\tfor(long i = 2;i <= Math.sqrt(qs);i++) {\n\t\t\tif(qs % i ==0) {\n\t\t\t\twhile(qs % i == 0) {\n\t\t\t\t\tqs /=i;\n\t\t\t\t}\n\t\t\t\tans *= i;\n\t\t\t}\n\t\t}\n\t\tans*= qs;\n\t\tSystem.out.println(ans);\n\t}\n}\n", "#include <bits/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\n#define EPS 1e-10\n#define rep(i,n) for(int i=0;i<(int)n;++i)\n#define each(a, b) for(auto (a): (b))\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout <<#x<<\" = \"<<(x)<<endl\n#define spair(p) cout <<#p<<\": \"<<p.fi<<\" \"<<p.se<<endl\n#define svec(v) cout<<#v<<\":\";rep(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define sset(s) cout<<#s<<\":\";each(i,s)cout <<\" \"<<i;cout<<endl\n\nusing namespace std;\n\ntypedef pair<int,int>P;\n\nconst int MAX_N = 100005;\n\nint gcd(int a,int b)\n{\n if(a % b == 0){\n return b;\n }\n return gcd(b,a%b);\n}\n\nint main()\n{\n int p,q;\n cin >> p >> q;\n q /= gcd(p,q);\n int mx = (int)(sqrt(q));\n int ans = 1;\n for(int i=2;i<=mx;i++){\n if(q % i == 0){\n ans *= i;\n while(q % i == 0){\n q /= i;\n }\n }\n }\n if(q != 1){\n ans *= q;\n }\n cout << ans << \"\\n\";\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint Prime[100000]={};\n\nvoid pr(){\n Prime[0]=2;\n int tmp=1,num=1;\n while(num<100000){\n num+=2;\n int flag=0;\n for(int i=3;i<=sqrt(num);i+=2)\n if(num%i==0) flag++;\n if(flag==0) Prime[tmp++]=num;\n }\n}\n\nint gcd(int x,int y){\n return y?gcd(y,x%y):x;\n}\n\nint main(){\n pr();\n int p,q; cin>>p>>q;\n int a=q/gcd(p,q);\n //while(sqrt(a)*sqrt(a)==a) a=sqrt(a);\n for(int i=0;a/Prime[i]>=Prime[i];++i){\n int tmp=a;\n while(a%Prime[i]==0) a=a/Prime[i];\n if(tmp!=a) a*=Prime[i];\n }\n cout << a << endl;\n\n \n return 0;\n}\n\n", "#include <iostream>\n\nusing namespace std;\n\nint gcd(int a, int b) {\n if (a == 0) {\n return b;\n }\n return gcd(b % a, a);\n}\n\n\nint main() {\n int p, q;\n cin >> p >> q;\n\n while (true) {\n int g = gcd(p, q);\n if (g == 1) {\n break;\n }\n p /= g;\n q /= g;\n }\n\n\n int t = q;\n int ans = 1;\n for (int i = 2; i * i <= q; i++) {\n if (t % i == 0) {\n ans *= i;\n while (t % i == 0) {\n t /= i;\n }\n }\n }\n ans *= t;\n\n cout << ans << endl;\n\n return 0;\n}", "#include <bits/stdc++.h>\n#define rep(i, a, n) for(int i = a; i < n; i++)\n#define repb(i, a, b) for(int i = a; i >= b; i--)\n#define all(a) a.begin(), a.end()\n#define o(a) cout << a << endl\n#define int long long\n#define first fi;\n#define second se;\nusing namespace std;\ntypedef pair<int, int> P;\n\nint gcd(int a, int b){\n if(a < b) swap(a, b);\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\nsigned main(){\n int p, q;\n cin >> p >> q;\n q /= gcd(p, q);\n int ans = 1;\n for(int i = 2; i * i <= q; i++){\n if(q % i == 0) ans *= i;\n while(q % i == 0){\n q /= i;\n }\n }\n if(q != 1) ans *= q;\n cout << ans << endl;\n}", "prime = [2]\ndef check(x):\n for i in prime:\n if x % i ==0:\n return False\n elif x < i * i:\n break\n return True\n\ndef set():\n for i in range(3,10**5,2):\n if check(i):\n prime.append(i)\n\n\nset()\n#print('ok')\n#print(prime)\np,q = [int(i) for i in input().split(' ')]\nif q % p == 0:\n q = q //p\n p = 1\nfor i in prime:\n while True:\n if p % i ==0 and q % i == 0:\n p = p // i\n q = q // i\n #print(p,q,i)\n else:\n break\n \nans = 1\n#print(p,q)\nfor i in prime:\n if q % i == 0:\n# print(q,i)\n q = q // i\n ans *= i\n while q % i ==0:\n q = q // i\n \nans *= q\n \n\nprint(ans)\n\n", "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <cmath>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#include <stdlib.h>\n#include <stdio.h>\n#include <bitset>\n#include <cstring>\nusing namespace std;\n#define FOR(I,A,B) for(int I = (A); I < (B); ++I)\n#define CLR(mat) memset(mat, 0, sizeof(mat))\ntypedef long long ll;\n\n// b^k???q????´???°??¨?????????\n\n//?????§??¬?´???°\nint gcd(int a, int b) {\n while (a && b) {\n if (a >= b) a %= b;\n else b %= a;\n }\n return a + b;\n}\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(0);\n int p, q; cin >> p >> q;\n q /= gcd(p, q);\n int qq = q;\n int ans = 1;\n for(int i = 2; i * i <= qq; i++) {\n if(q % i == 0) {\n while(q % i == 0) {\n q /= i;\n }\n ans *= i;\n }\n }\n if(q > 1) ans *= q;\n cout << ans << endl;\n return 0;\n}", "#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(v) v.begin(), v.end()\n#define SP << \" \" \n#define LLi long long int\n\nusing namespace std;\n\nvector<LLi> pri={1, 2, 3};\n\nvoid PV(vector<int> pvv) {\n\trep(i, pvv.size()) cout << pvv[i] SP;\n\tcout << endl;\n}\n\nvoid PVL(vector<LLi> pvv) {\n\trep(i, pvv.size()) cout << pvv[i] SP;\n\tcout << endl;\n}\n\nbool VV(vector<int> vv1, vector<int> vv2) {\n\tif(vv1.size()!=vv2.size()) return false;\n\trep(i, vv1.size()) if(vv1[i]!=vv2[i]) return false;\n\n\treturn true;\n}\n\nbool VVL(vector<LLi> vv1, vector<LLi> vv2) {\n\tif(vv1.size()!=vv2.size()) return false;\n\trep(i, vv1.size()) if(vv1[i]!=vv2[i]) return false;\n\n\treturn true;\n}\n\n//vecotr<LLi>の総和\nLLi SML(vector<LLi> smv) {\n\tLLi tmp=0;\n\trep(i, smv.size()) tmp+=smv[i];\n\n\treturn tmp;\n}\n\n//n以下の素数を配列に{1, 2, 3, 5, 7, ...} make_prime_list\n//i, j, flag, sqx, xを使用\nvoid mplist(LLi x){\n\tint flag;\n\n\tfor(int i=5;i<=x;i+=2){\n\t\tflag=0;\n\t\tfor(int j=1;j<(int)pri.size();j++){\n\t\t\tif(i%pri[j]==0){\n\t\t\t\tflag=1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(x<pri[j]*pri[j]) break;\n\t\t}\n\t\tif(flag==0) pri.emplace_back(i);\n\t}\n}\n\n//nを素因数分解 root_prime_fac\n//i, tmp, bin, lmt, xを使用\nmap<LLi, int> rpfac(LLi x){\n\tint sqx=ceil(sqrt(x));\n\t//cout<< \"sqx=\" << sqx SP << sqx*sqx << endl;//\n\tauto bin = lower_bound(all(pri), sqx);\n\tint lmt=bin-pri.begin()+1;\n\tmap<LLi, int> tmp;\n\t//cout<< \"lmt=\" << lmt SP << pri[lmt] SP << pri[lmt]*pri[lmt] <<endl;//\n\tif((int)pri.size()<lmt) cout<< \"rpfac: pri size is small\" <<endl;\n\n\tfor(int i=1;i<lmt;i++){\n\t\twhile(x%pri[i]==0){\n\t\t\tx/=pri[i];\n\t\t\ttmp[pri[i]]++;\n\t\t\t//cout<< x <<endl;\n\t\t\t//tmp[0]++;//0番に何個の積でできてるかをメモれる\n\t\t}\n\t\tif(x==1) break;\n\t}\n\n\t//if(x!=1) cout<< \"prime_fac x=\" << x <<endl;\n\treturn tmp;\n}\n\n//階乗を素因数分解\nmap<LLi, int> facfac(LLi x){\n\tmap<LLi, int> tmp;\n\tauto bin = lower_bound(all(pri), x);\n\tint lmt=bin-pri.begin()+1;\n \t//cout<< \"lmt=\" << lmt SP << pri[lmt] SP << pri[lmt]*pri[lmt] <<endl;//\n\n\tfor(LLi i=1;i<lmt;i++){\n\t\tint lp=0, di=0;\n\t\twhile(pow(pri[i], lp)<x){\n\t\t\tlp++;\n\t\t\tdi+=x/pow(pri[i], lp);\n\t\t}\n\t\tif(di>0) tmp[pri[i]]=di;\n\t}\n\t\n\treturn tmp;\n}\n\n//約数列挙\n//i, j, k, tmp, mul, mを使用\nvector<LLi> getfac(map<LLi, int> mp){\n\tvector<LLi> tmp={1}, ad;\n\tLLi mul;\n\t\n\tfor (auto p : mp) {\n\t\tmul=1;\n\t\tad.clear();\n \t\tLLi key = p.first;\n \t\tint value = p.second;\n\t\t \n\t\trep(j, value){\n\t\t\tmul*=key;\n\t\t\trep(k, tmp.size()) ad.push_back(tmp[k]*mul);\n\t\t}\n\t\trep(j, ad.size()) tmp.push_back(ad[j]);\n\t\t//PV(tmp);//\n\t}\n\n\t/*for(int i=1;i<v.size();i++){\n\t\tif(v[i]==0) continue;\n\t\tmul=1;\n\t\tad.clear();\n\t\trep(j, v[i]){\n\t\t\tmul*=pri[i];\n\t\t\trep(k, tmp.size()){\n\t\t\t\tad.push_back(tmp[k]*mul);\n\t\t\t}\n\t\t}\n\t\t//PV(tmp);\n\t\trep(j, ad.size()) tmp.push_back(ad[j]);\n\t}*/\n\n\tsort(all(tmp));\n\treturn tmp;\n}\n\n//素因数の積を計算\n//i, tmp, vを使用\nLLi defac(map<LLi, int> mp){\n\tLLi tmp=1;\n\n\t/*for(int i=1;i<v.size();i++){\n\t\tif(v[i]!=0) tmp*=pow(pri[i], v[i]);\n\t}*/\n\n\tfor (auto p : mp) {\n \t\tLLi key = p.first;\n \t\tint value = p.second;\n\t\ttmp*=pow(key, value);\n\t}\n\n\treturn tmp;\n}\n\n//素因数の積を計算\n//i, tmp, vを使用\nLLi defac2(map<LLi, int> mp){\n\tLLi tmp=1;\n\n\t/*for(int i=1;i<v.size();i++){\n\t\tif(v[i]!=0) tmp*=pow(pri[i], v[i]);\n\t}*/\n\n\tfor (auto p : mp) {\n \t\tLLi key = p.first;\n \t\tint value = p.second;\n\t\ttmp*=pow(key, min(1, value));\n\t}\n\n\treturn tmp;\n}\n\n//素数判定 is_prime\n//ub, lb, x, iを使用\nbool isp(LLi x){\n\t//if(x==1) return false;//1を素数としないなら有効化\n\tauto ub = upper_bound(all(pri), x);\n\tauto lb = lower_bound(all(pri), x);\n\n\t//xがでかいときは素数リストで割ってみる\n\tif(lb==pri.end()){\n\t\tfor(int i=1;i<(int)pri.size();i++){\n\t\t\tif(x%pri[i]==0) return false;\n\t\t\tif(x<pri[i]*pri[i]) return true;\n\t\t}\n\t\t//cout<< \"isp: pri size is small\" <<endl;\n\n\t\t//priのサイズが足りないときは地道にチェックする\n\t\tfor(LLi i=pri[pri.size()-1]+2;i*i<=x;i+=2){\n\t\t\tif(x%i==0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\treturn ub!=lb;\n}\n\nint main(){\n\n\tLLi n, m, nl, ml;\n\tvector<LLi> v;\n\tmap<LLi, int> mp, np;\n\n\tcin>> n >> m;\n\n\tmplist(100000);//nまでの素数列挙\n\t//PVL(pri);//\n\tnp=rpfac(n);//mを√mまで素因数分解\n\tmp=rpfac(m);//mを√mまで素因数分解\n\tnl=defac(np);//mlにmpの総積を代入\n\tml=defac(mp);//mlにmpの総積を代入\n\t//cout<< \"m/ml=\" << m/ml SP << isp(m/ml) <<endl;//\n\tif(n!=nl) np[n/nl]++;//mpにm/mlを追加(√m以上の素数が約数の場合に必要な処理)\n\tif(m!=ml) mp[m/ml]++;//mpにm/mlを追加(√m以上の素数が約数の場合に必要な処理)\n\t//mの約数で√m以上の素数は1つしかないのでこれでOK\n\n\t//mp=facfac(n);\n \n\tfor (auto pm : mp) {\n \t\tauto mkey = pm.first;\n \t\tauto mvalue = pm.second;\n\t\t//cout<< mkey << \"^\" << mvalue SP;//mpの内訳を表示\n\t}\n\t//cout<< endl;//\n\n\tfor (auto p : np) {\n \t\tauto key = p.first;\n \t\tauto value = p.second;\n\t\t//cout<< key << \"^\" << value SP;//mpの内訳を表示\n \tmp[key]=max(0, mp[key]-value);\n\t}\n \n\tcout<< defac2(mp) <<endl;\n\n\treturn 0;\n}\n", "#include <algorithm>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <vector>\n#define FOR(i,a,b) for (int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define RREP(i,n) for (int i=(n)-1;i>=0;i--)\n\nusing namespace std;\nusing lli = long long int;\n\nlli gcd(lli x, lli y) {\n return (y == 0 ? x : gcd(y, x % y));\n}\n\nlli solve(lli p, lli q) {\n const lli NMAX = 100008;\n vector<lli> factor(NMAX, 0);\n for (lli n = 2; n < NMAX; ++n) {\n if (factor[n]) { continue; }\n for (lli k = 2; k * n < NMAX; ++k) {\n factor[k * n] = n;\n }\n }\n lli ans = 1;\n for (lli n = 2; q > 1 && n < NMAX; ++n) {\n if (factor[n] || (q % n != 0)) { continue; }\n while (q % n == 0) { q /= n; }\n ans *= n;\n }\n ans *= q;\n return max<lli>(2, ans);\n}\n\nint main() {\n lli P, Q; cin >> P >> Q;\n const lli G = gcd(P, Q);\n P /= G, Q /= G;\n cout << solve(P, Q) << endl;\n return 0;\n}", "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define EPS (1e-7)\n#define INF (1e9)\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define all(x) x.begin(),x.end()\nconst double PI = acos(-1);\nconst ll MOD = 1000000007;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n \ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n///////////////////////////////////////////////////////////////\n\nint gcd(int x, int y) {\n if (x == 0) return y;\n return gcd(y % x, x);\n}\n\nint main() {\n ios::sync_with_stdio(false); cin.tie(nullptr);\n int p,q; cin >> p >> q;\n int r = q / gcd(p,q);\n int s = r;\n vector<int> A;\n for (int i = 2; i*i <= r; i++) {\n if (s % i == 0) {\n A.emplace_back(i);\n while (s % i == 0) s /= i;\n }\n }\n if (s != 1) A.emplace_back(s);\n int ans = 1;\n rep(i,A.size()) ans *= A[i];\n\n cout << ans << endl;\n}\n", "#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\n#define int long long int\nconst int INF = 1001001001001001LL;\nconst int MOD = 1000000007;\n\nint gcd(int a, int b){\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\nmap<int, int> f(int n){\n \n map<int, int> ret;\n for(int i = 2; i * i <= n; i++){\n while(n % i == 0){\n ret[i]++;\n n /= i;\n }\n }\n\n if(n > 1) ret[n]++;\n\n return ret;\n}\n\nsigned main(){\n \n int p, q; cin >> p >> q;\n int g = gcd(p, q);\n p /= g;\n q /= g;\n\n map<int, int> m = f(q);\n int b = 1;\n for(auto x : m){\n b *= x.first;\n }\n cout << b << endl;\n return 0;\n}\n\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint gcd(int x,int y){\n if (y==0) return x;\n return gcd(y,x%y);\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int p,q,r=1; cin >> p >> q;\n q/=gcd(p,q);\n for (int i=2;i*i<=q;++i){\n if (q%i==0){\n r*=i;\n while(q%i==0) q/=i;\n }\n }\n cout << q*r << '\\n';\n}\n", "\n#include <iostream>\n#include<cstdlib>\n#include<queue>\n#include<set>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<sstream>\n#include<cmath>\n#include<stack>\n#include<map>\n#include<cstdio>\nusing namespace std;\n#define rep(i,a) for(int i=0;i<a;i++)\n#define mp make_pair\n#define pb push_back\n#define P pair<int,int>\n#define ll __int64\nint p,q;\nvector<int>primes;\n\nconst int MA=30000000;\nbool t[MA*2];\n\nvoid eratosu(){\n\tt[1]=1;\n\n\tfor(int i=2;i<=MA;i++){\n\t\tif(t[i]==0){\n\t\t\tprimes.push_back(i);\n\t\t\tfor(int j=i*2;j<=MA;j+=i)t[j]=1;\n\t\t}\n\t}\n}\n\nint gcd(int a,int b){\n\tif(b==0)return a;\n\treturn gcd(b,a%b);\n}\nint main(){\neratosu();\n\tcin>>p>>q;\n\n\nfor(int i=0;i<primes.size();i++){\n\tint now=primes[i];\n\twhile(q%now==0&&p%now==0)q/=now,p/=now;\n}\n\n\nint gc=gcd(p,q);\nint np=p,nq=q;\n//p=np/gc;\n//q=nq/gc;\nint ans=1,qq=q;\nint cnt=0;\n\nfor(int i=0;i<primes.size();i++){\n\tint now=primes[i];\n\tif(q%now==0){ans*=now,cnt++;}\n\twhile(q%now==0)q/=now;\n\n\t//if(now>sqrt(qq))break;\n}\nans*=q;\ncout<<ans<<endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<ll> VL;\ntypedef vector<VL> VVL;\ntypedef pair<int, int> PII;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define MP make_pair\n#define PB push_back\n#define MOD 1000000007\n#define INF (1LL<<30)\n#define LLINF (1LL<<60)\n#define PI 3.14159265359\n#define EPS 1e-12\n#define int ll\n\nint gcd(int a, int b) {\n return b != 0 ? gcd(b, a%b) : a;\n}\n\nsigned main(void)\n{\n int p, q;\n cin >> p >> q;\n int r = gcd(p, q);\n //cout << r << endl;\n p /= r; q /= r;\n set<int> s;\n ll a = 2;\n while(q >= a*a) {\n if(q % a == 0) {\n s.insert(a);\n q /= a;\n } else {\n a++;\n }\n }\n s.insert(q);\n ll ret = 1;\n for(int i: s) ret *= i;\n cout << ret << endl;\n\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nint gcd(int a, int b) {\n\treturn b ? gcd(b, a % b) : a;\n}\n\nint main() {\n\tint p, q;\n\tcin >> p >> q;\n\tp = gcd(p, q);\n\tq /= p;\n\tset<int> s;\n\tfor (int i = 2; i <= q;) {\n\t\tif (i * i > q) {\n\t\t\ti = q;\n\t\t}\n\t\tif (q % i == 0) {\n\t\t\tq /= i;\n\t\t\ts.insert(i);\n\t\t} else {\n\t\t\ti++;\n\t\t}\n\t}\n\tint r = 1;\n\tfor (auto it = begin(s); it != end(s); it++) {\n\t\tr *= *it;\n\t}\n\tcout << r << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n\nusing namespace std;\nusing ll = long long;\n\nll gcd(const ll a, const ll b)\n{\n if (a == 0 or b == 0) {\n return (a == 0) ? b : a;\n }\n if (a > b) {\n return gcd(b, a);\n } else {\n return gcd(b % a, a);\n }\n}\n\nconstexpr int SQRT = 100000;\nbool isprime[SQRT];\n\nint main()\n{\n ll p, q;\n cin >> p >> q;\n const ll g = gcd(p, q);\n q /= g;\n\n fill(isprime, isprime + SQRT, true);\n for (ll i = 2; i < SQRT; i++) {\n if (isprime[i]) {\n for (ll j = 2; i * j < SQRT; j++) {\n isprime[i * j] = false;\n }\n }\n }\n vector<ll> prime;\n for (ll i = 2; i < SQRT; i++) {\n if (isprime[i]) {\n prime.push_back(i);\n }\n }\n\n vector<ll> factor;\n for (ll p : prime) {\n if (q % p == 0) {\n factor.push_back(p);\n }\n while (q % p == 0) {\n q /= p;\n }\n }\n if (q > 1) {\n factor.push_back(q);\n }\n ll prod = 1;\n for (const ll f : factor) {\n prod *= f;\n }\n cout << prod << endl;\n\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\n\n#define rep(i,n) for (int i=0;i<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define printV(v) for(auto x : v){cout << x << \" \";} cout << endl\n#define printVS(vs) for(auto x : vs){cout << x << endl;}\n#define printVV(vv) for(auto v : vv){for(auto&& x : v){cout << x << \" \";}cout << endl;}\n#define printP(p) cout << p.first << \" \" << p.second << endl\n#define printVP(vp) for(auto p : vp) printP(p);\n\ntypedef long long ll;\ntypedef pair<int, int> Pii;\ntypedef tuple<int, int, int> TUPLE;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<Pii> vp;\ntypedef vector<vector<int>> Graph;\nconst int inf = 1e9;\nconst int mod = 1e9 + 7;\n\nint gcd(int a, int b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n}\n\nint lcm(int a, int b) {\n return a / gcd(a, b) * b;\n}\n\nmap<int, int> primeFactorize(int n) {\n map<int, int> res;\n for (int i = 2; i * i <= n; ++i) {\n while (n % i == 0) {\n ++res[i];\n n /= i;\n }\n }\n if (n > 1) ++res[n];\n return res;\n}\n\nsigned main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int p, q;\n cin >> p >> q;\n int g = gcd(p, q);\n p /= g;\n q /= g;\n\n auto mp = primeFactorize(q);\n int x = 1;\n for (auto p : mp) {\n x = lcm(x, p.first);\n }\n\n cout << x << endl;\n\n}", "/* -*- coding: utf-8 -*-\n *\n * 2706.cc: Let's Solve Geometric Problems\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_P = 32000;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<pii> vpii;\n\n/* global variables */\n\nbool primes[MAX_P + 1];\n\n/* subroutines */\n\nint gen_primes(int maxp, vi &pnums) {\n memset(primes, true, sizeof(primes));\n primes[0] = primes[1] = false;\n\n int p;\n for (p = 2; p * p <= maxp; p++)\n if (primes[p]) {\n pnums.push_back(p);\n for (int q = p * p; q <= maxp; q += p) primes[q] = false;\n }\n for (; p <= maxp; p++)\n if (primes[p]) pnums.push_back(p);\n return (int)pnums.size();\n}\n\nbool prime_decomp(int n, vi &pnums, vpii& pds) {\n pds.clear();\n\n int pn = pnums.size();\n for (int i = 0; i < pn; i++) {\n int pi = pnums[i];\n if (pi * pi > n) {\n if (n > 1) pds.push_back(pii(n, 1));\n return true;\n }\n\n if (n % pi == 0) {\n int fi = 0;\n while (n % pi == 0) n /= pi, fi++;\n pds.push_back(pii(pi, fi));\n }\n }\n return false;\n}\n\nint gcd(int m, int n) { // m >= n > 0\n while (n > 0) {\n int r = m % n;\n m = n;\n n = r;\n }\n return m;\n}\n\nint powi(int a, int b) {\n int p = 1;\n while (b) {\n if (b & 1) p *= a;\n a *= a;\n b >>= 1;\n }\n return p;\n}\n\n/* main */\n\nint main() {\n vi pnums;\n int pn = gen_primes(MAX_P, pnums);\n //printf(\"pn=%d\\n\", pn);\n\n int p, q;\n scanf(\"%d%d\", &p, &q);\n\n int g = gcd(q, p);\n //printf(\"gcd(%d,%d)=%d\\n\", p, q, g);\n int n = q / g;\n vpii pds;\n prime_decomp(n, pnums, pds);\n\n /*\n printf(\"%d = \", n);\n for (int i = 0; i < pds.size(); i++) {\n if (i) putchar('*');\n printf(\"%d^%d\", pds[i].first, pds[i].second);\n }\n putchar('\\n');\n */\n \n int m = 1;\n for (int i = 0; i < pds.size(); i++) m *= pds[i].first;\n\n printf(\"%d\\n\", m);\n return 0;\n}", "\n#include<iostream>\nusing namespace std;\nint p,q,ans=1,j;\n\nint so(int n){\n for(int i=2;i*i<=n;i++)if(n%i==0)return 1;\n return 0;\n}\n\nint main(){\n cin>>p>>q;\n if(so(q)){\n for(int i=2;q>=i;i++){\n for(j=0;q%i==0;j++){\n\tq/=i;\n\tif(p%i==0)p/=i,j--;\n }\n if(j==0)continue;\n /*if(p%(i*j)==0)p/=(i*j);\n\telse*/ ans*=i;\n }\n cout<<ans<<endl;\n }else cout<<q<<endl;\n return 0;\n}", "#include \"bits/stdc++.h\"\n\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define RREP(i,n) for(ll i=n-1;i>=0;--i)\n#define FOR(i,m,n) for(ll i=m;i<n;++i)\n#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)\n#define ALL(v) (v).begin(),(v).end()\n#define PB(a) push_back(a)\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());\n#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << \" \"; else cout << endl; }\n#define INF 1000000001ll\n#define MOD 1000000007ll\n#define EPS 1e-9\n\nconst int dx[8] = { 1,1,0,-1,-1,-1,0,1 };\nconst int dy[8] = { 0,1,1,1,0,-1,-1,-1 };\n\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vi> vvi;\ntypedef vector<vl> vvl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nll max(ll a, int b) { return max(a, ll(b)); }\nll max(int a, ll b) { return max(ll(a), b); }\nll min(ll a, int b) { return min(a, ll(b)); }\nll min(int a, ll b) { return min(ll(a), b); }\n///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///\nint gcd(int a, int b) {\n\tif (!b)return a;\n\treturn gcd(b, a%b);\n}\nint fact(int n) {\n\tint res = 1, i = 2;\n\tint p = n;\n\twhile (i*i<=p) {\n\t\tif (n % i == 0) {\n\t\t\tres *= i;\n\t\t\twhile (n%i == 0)n /= i;\n\t\t\tif(n!=i*i)res *= fact(n);\n\t\t\tbreak;\n\t\t}\n\t\t++i;\n\t}\n\tif (res == 1)return n;\n\telse return res;\n}\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint p, q;\n\tcin >> p >> q;\n\tint c = gcd(p, q);\n\tp /= c; q /= c;\n\tint i = 2;\n\tcout << fact(q) << endl;\n\treturn 0;\n}", "#include <vector>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <sstream>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <climits>\n#include <fstream>\nusing namespace std;\ninline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }\ntemplate<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str(); }\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define FOR(i,a,b) for(int i=(a);i<=(b);++i)\n#define REP(i,n) FOR(i,0,(n)-1)\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst int INF = INT_MAX / 10;\nconst int MOD = 1000000007;\n\nint gcd(int x, int y) {\n\tif (x < y) {\n\t\tswap(x, y);\n\t}\n\tif (y == 0) {\n\t\treturn x;\n\t}\n\treturn gcd(y, x%y);\n}\n\nint main() {\n\tint p, q;\n\tcin >> p >> q;\n\tint m = sqrt(q) + 1;\n\tvi prime(m+1, 1);\n\tprime[0] = prime[1] = 0;\n\tFOR(i, 2, m) {\n\t\tif (prime[i]) {\n\t\t\tfor (int j = i*i; j <= m; j += i) {\n\t\t\t\tprime[j] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 1;\n\tq /= gcd(p, q);\n\tFOR(i, 2, m) {\n\t\tif ((prime[i] == 1) && (q%i == 0)) {\n\t\t\tans *= i;\n\t\t\twhile (q%i == 0) {\n\t\t\t\tq /= i;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (q > 1) {\n\t\tans *= q;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\n#define each(i,a) for (auto&& i : a)\n#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)\n#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)\n#define REP(i,n) FOR(i,0,n)\n#define RREP(i,n) RFOR(i,0,n)\n#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME\n#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)\n#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define chmin(x,v) x = min(x, v)\n#define chmax(x,v) x = max(x, v)\n\nconst ll linf = 1e18;\nconst int inf = 1e9;\nconst double eps = 1e-12;\nconst double pi = acos(-1);\n\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& vec) {\n each(x,vec) is >> x;\n return is;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& vec) {\n rep(i,vec.size()) {\n if (i) os << \" \";\n os << vec[i];\n }\n return os;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector< vector<T> >& vec) {\n rep(i,vec.size()) {\n if (i) os << endl;\n os << vec[i];\n }\n return os;\n}\nll gcd(ll a, ll b) {\n return b == 0 ? a : gcd(b, a%b);\n}\nll solve(ll n) {\n vector<ll> v;\n for (ll i = 2; i*i <= n; ++i) {\n if (n % i == 0) {\n while (n % i == 0) n /= i;\n v.pb(i);\n }\n }\n v.pb(n);\n ll res = 1;\n each(x, v) res *= x;\n return res;\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n ll p, q; cin >> p >> q;\n cout << max(2LL, solve(q / gcd(p, q))) << endl;\n}", "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n#include <climits>\n#include <vector>\n#include <map>\n#include <set>\n#include <list>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <iostream>\n#include <string>\n\n#define REP(i,n) for(long long i=0;i<n;++i)\n#define REPR(i,n) for(long long i=n;i>=0;--i)\n#define REPI(itr,v) for(auto itr=v.begin();itr!=v.end();++itr)\n#define REPIR(itr,v) for(auto itr=v.rbegin();itr!=v.rend();++itr)\n#define FOR(i,a,b) for(long long i=a;i<b;++i)\n#define SORT(v,n) sort(v, v+n)\n#define SORTV(v) sort(v.begin(), v.end())\n#define ALL(v) v.begin(),v.end()\n#define llong long long\n#define INF 999999999\n#define SUR 1000000007\n#define pb push_back\n#define pf push_front\n#define MP make_pair\n#define SV(v) {for(long long sitr=0;sitr<v.size();++sitr){cin>>v[sitr];}}\n\nint dx[] = {0, 0, -1, 1};\nint dy[] = {1, -1, 0, 0};\n\nusing namespace std;\n\ntypedef pair<int,int> pii;\n\n\nint main(){\n\n llong p, q;\n cin >> p >> q;\n\n llong a = q, b = p;\n llong r = a % b;\n while(r != 0){\n a = b;\n b = r;\n r = a % b;\n }\n p /= b; q /= b;\n\n map<llong, llong> mp;\n for(int i = 2; i * i <= q; ++i){\n if(q % i == 0){\n mp[i]++;\n while(q % i == 0) q /= i;\n }\n }\n if(q != 1){\n mp[q]++;\n }\n\n llong ans = 1;\n REPI(itr, mp){\n ans *= itr->first;\n }\n cout << ans << endl;\n return 0;\n}\n\n", "\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\nconst ll INF = 1LL << 50;\n\nint solve();\n\nll gcd(ll p, ll q) {\n\tif (q == 0) { return p; }\n\treturn gcd(q, p%q);\n}\n\nint main(void) {\n\twhile (solve()) {}\n\treturn 0;\n}\n\nint solve() {\n\n\tll p, q, g;\n\n\tcin >> p >> q;\n\n\tg = gcd(max(p, q), min(p, q));\n\n\t//\t約分\n\tp = p / g;\n\tq = q / g;\n\n\t//\t答えはqの素因数をすべて掛け合わせたもの\n\t//\tsqrt{q}までの素数を調べる\n\tconst ll M = (1e+9) + 1;\n\tconst ll N = sqrt(M) + 1;\n\tll ans;\n\n\t//cout << M << \" \" << N << endl;\n\t//\tエラトステネスの篩\n\tvector<ll> primes;\n\tprimes.reserve(5000);\n\tvector< bool > isPrime(M, true);\n\tisPrime[0] = false;\n\tisPrime[1] = false;\n\n\tfor (ll i = 2; i < N; i++) {\n\t\tif (isPrime[i] == false) { continue; }\t//\t合成数なら\n\t\tprimes.push_back(i);\n\t\tfor (ll j = i; i * j < N; j++) {\n\t\t\tisPrime[i*j] = false;\n\t\t}\n\t}\n\t\n\t\n\tll qc = q;\n\tset<ll> facts;\n\t\n\tfor (auto p : primes) {\n\t\tif( qc % p == 0 ) {\n\t\t\twhile(qc % p == 0)\n\t\t\t\tqc /= p;\t\n\t\t\tif( qc % p > 0 ) {\n\t\t\t\tfacts.insert(p);\n\t\t\t}\n\t\t}\n\t}\n\tans = qc;\n\tfor( auto itr = facts.begin(); itr != facts.end(); ++itr ){\n\t\tans *= (*itr);\t\n\t}\n\t\n\tcout << ans << endl;\n\n\n\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define FOR(i, a, b) for(int i=(a);i<(b);i++)\n#define REP(i, n) FOR(i, 0, n)\n#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)\n#define RREP(i, n) RFOR(i, n, 0)\n#define MFOR(i, m) for(auto i=(m).begin();i!=(m).end();i++)\n#define ALL(a) (a).begin(), (a).end()\n#define SZ(x) ((int)(x).size())\n\ntypedef long long int ll;\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> Pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vll;\ntypedef vector<vll> vvll;\n\nconst double eps = 1e-10;\nconst int MOD = 1000000007;\nconst int INF = 1000000000;\nconst ll LINF = 1 << 30;\n\ntemplate<typename T>\nvoid printv(vector<T> const& s) {\n REP(i, SZ(s)) {\n cout << s[i] << \" \";\n }\n cout << endl;\n}\n\nint gcd(int a, int b) {\n if(b == 0) return a;\n else return gcd(b, a%b);\n}\nint main () {\n cin.tie(0);\n cout << setprecision(10);\n\n int p, q; cin >> p >> q;\n int g = gcd(p, q);\n p /= g; q /= g;\n\n int ans = 1;\n int tmpq = q;\n for(int i=2;i*i<=tmpq;i++) {\n if(q % i == 0) {\n ans *= i;\n }\n while(q % i == 0) {\n q /= i;\n }\n }\n if(q != 1) ans *= q;\n cout << ans << endl;\n}\n\n", "#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint gcd(int a, int b){\n if(b==0) return a;\n else return gcd(b, a%b);\n}\n\nint main(){\n\n int p, q;\n cin>> p>> q;\n\n q=q/gcd(p, q);\n vector<int> v;\n for(int i=2; i*i<=q; i++){\n if(q%i==0){\n v.push_back(i);\n while(q%i==0) q/=i;\n }\n }\n int r=1;\n for(int i=0; i<v.size(); i++) r*=v[i];\n\n cout<< r*q<< endl;\n\n return 0;\n}", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tstatic PrintWriter out;\n\tstatic InputReader ir;\n\n\tstatic void solve() {\n\t\tint p = ir.nextInt();\n\t\tif(p==0){\n\t\t\tout.println(2);\n\t\t\tSystem.exit(0);\n\t\t}\n\t\tint q = ir.nextInt();\n\t\tint a = q / gcd(p, q);\n\t\tint ret=1;\n\t\tfor(int i=2;a>1;i++){\n\t\t\tif(a%i!=0)\n\t\t\t\tcontinue;\n\t\t\tret*=i;\n\t\t\twhile(a%i==0)\n\t\t\t\ta/=i;\n\t\t}\n\t\tout.println(ret);\n\t}\n\n\tpublic static int gcd(int a, int b) {\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\treturn gcd(b, a % b);\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tir = new InputReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\tstatic class InputReader {\n\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}", "\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString[] tmpArray = br.readLine().split(\" \");\n\n\t\tint p = Integer.parseInt(tmpArray[0]);\n\t\tint q = Integer.parseInt(tmpArray[1]);\n\n\t\tint g = gcd(p, q);\n\n\t\tq /= g;\n\n\t\t//qを構成する約数を調べる\n\t\tint result = 1;\n\n\t\tfor(int i = 2; i <= q; i++){\n\t\t\tboolean divided = false;\n\n\t\t\twhile(q % i == 0){\n\t\t\t\tdivided = true;\n\t\t\t\tq /= i;\n\t\t\t}\n\n\t\t\tif(divided){\n\t\t\t\tresult *= i;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(result);\n\t}\n\n\tstatic int gcd(int a, int b){\n int tmp;\n\n while (a % b != 0)\n {\n tmp = b;\n b = a % b;\n a = tmp;\n }\n return b;\n }\n}\n\n", "#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <map>\nusing namespace std;\ninline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n\nmap<long long, int> prime_factorize(long long n) {\n map<long long, int> res;\n for (long long p = 2; p * p <= n; ++p) {\n while (n % p == 0) { ++res[p]; n /= p; }\n }\n if (n != 1) res[n] = 1;\n return res;\n}\n\nint main() {\n long long p, q; cin >> p >> q;\n long long g = gcd(p, q);\n q /= g;\n long long ans = 1;\n for (auto &p: prime_factorize(q)) ans *= p.first;\n cout << ans << endl;\n return 0;\n}\n\n", "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint gcd(int a,int b){\n if(a<b){swap(a,b);}\n if(!b){return a;}\n return gcd(b,a%b);\n}\n\nint main(){\n int a=1,p,q,i,gc;\n cin>>p>>q;\n gc=gcd(p,q);\n p/=gc;q/=gc;\n for(i=2;i<sqrt(q)+1;i++){\n if(!(q%i)){\n a*=i;\n while(!(q%i)){q/=i;}\n } \n }\n a*=q;\n cout<<a<<endl;\n return 0;\n}\n", "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint COU(int a,int b){\n\tif(a==b||a==0)return 1;\n\twhile(true){\n\t\tif(a<b){int t=a;a=b,b=t;}\n\t\tif(b==0)return a;\n\t\ta%=b;\n\t}\n}\nint main(){\n\tint p,q;\n\tcin>>p>>q;\n\tq/=COU(p,q);\n\tfor(int i=2;i*i<=q;i++){\n\t\twhile(!(q%(i*i)))q/=i;\n\t}\n\tcout<<q<<endl;\n\treturn 0;\n}", "def gcd(a,b):\n while b:a,b=b,a%b\n return a\n\nif __name__==\"__main__\":\n a,b=map(int,input().split())\n b//=gcd(a,b)\n a,c=2,1\n while a**2<=b:\n if b%a==0:\n c*=a\n while b%a==0: b//=a\n a+=1\n print(c if b==1 else c*b)", "#include <bits/stdc++.h>\nusing namespace std;\n\nint GCD(int a, int b) {\n\treturn b ? GCD(b, a%b) : a;\n}\n\nint main()\n{\n\tint p, q, n, res = 1;\n\tcin >> p >> q;\n\tn = q / GCD(p, q);\n\tfor (int i = 2; i < sqrt(n) + 2; i++) {\n\t\tif (n % i == 0) {\n\t\t\tres *= i;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tn /= i;\n\t\t\t}\n\t\t}\n\t}\n\tres *= n;\n\tif (res == 1) res = 2;\n\tcout << res << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(a) (a).begin(),(a).end()\n\nusing ll = long long;\n\nll gcd(ll a, ll b){return b?gcd(b,a%b):a;}\n\nint main(){\n int p, q;\n cin>>p>>q;\n int g = gcd(q, p);\n q /= g;\n int res = 1;\n for (int i = 2; i*i <= q; ++i) {\n if (q % i == 0) {\n res *= i;\n while (q % i == 0) {\n q /= i;\n }\n }\n }\n if (q > 1) res *= q;\n if (res > 1) {\n cout << res << endl;\n } else {\n cout << 2 << endl;\n }\n return 0;\n}", "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic int[][] map;\n\tstatic int[][] directions8 = { { -1, -1 }, { -1, 0 }, { -1, 1 }, { 0, -1 }, { 0, 1 }, { 1, -1 }, { 1, 0 },\n\t\t\t{ 1, 1 } };\n\tstatic int[][] directions4 = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } };\n\tstatic int ans;\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint p = sc.nextInt();\n\t\tint q = sc.nextInt();\n\n\t\tq = q / gcd(p, q);\n\n\t\tans = 1;\n\t\tint idx = 2;\n\t\tboolean[] divided = new boolean[q + 1];\n\t\tif (isPrime(q)) {\n\t\t\tSystem.out.println(q);\n\t\t} else {\n\t\t\twhile (q != 1) {\n\t\t\t\tif (!divided[idx] && q % idx == 0) {\n\t\t\t\t\tans *= idx;\n\t\t\t\t\twhile (q % idx == 0) {\n\t\t\t\t\t\tq /= idx;\n\t\t\t\t\t}\n\t\t\t\t\tfor (int i = idx; i * i <= q; i += idx) {\n\t\t\t\t\t\tdivided[i] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tidx++;\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\t// longの素数判定\n\tstatic boolean isPrime(long n) {\n\t\tif (n == 2)\n\t\t\treturn true;\n\t\tif (n < 2 || n % 2 == 0)\n\t\t\treturn false;\n\n\t\tint i = 3;\n\t\twhile (i <= Math.sqrt(n)) {\n\t\t\tif (n % i == 0)\n\t\t\t\treturn false;\n\t\t\telse\n\t\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n\n\t// BFS用に二つの配列を足し算する\n\tstatic int[] addArrayElms(int[] a, int[] b) {\n\t\tint[] c = new int[a.length];\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tc[i] = a[i] + b[i];\n\t\t}\n\t\treturn c;\n\t}\n\n\t// //二分探索\n\t// k <= num となる最小の配列要素kのインデックスを返す\n\tstatic private int binarySearch(long num, long[] orderedArray) {\n\t\tint lowerBorder = -1;\n\t\tint upperBorder = orderedArray.length;\n\t\tint mid;\n\n\t\twhile (upperBorder - lowerBorder > 1) {\n\t\t\tmid = (upperBorder + lowerBorder) / 2;\n\t\t\tif (orderedArray[mid] <= num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t} else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t// 二分探索\n\t// k <= num となる最小のList要素kのインデックスを返す\n\tstatic private int binarySearch(long num, ArrayList<Long> orderedList) {\n\t\tint lowerBorder = -1;\n\t\tint upperBorder = orderedList.size();\n\t\tint mid;\n\n\t\twhile (upperBorder - lowerBorder > 1) {\n\t\t\tmid = (upperBorder + lowerBorder) / 2;\n\t\t\tif (orderedList.get(mid) <= num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t} else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t// aとbの最小公倍数を求める\n\tpublic static int gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\n\tpublic static long gcd(long a, long b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n}\n\n", "#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint main() {\n\tint p, q, mi, ans, temp;\n\n\tcin >> p >> q;\n\n\tmi = (p ,q);\n\n\twhile (p%q == 0) {\n\t\tif (q == 1) break;\n\t\tp /= q;\n\t\tq /= q;\n\t}\n\n\tfor (int i = 2; i * i<= mi; i++) {\n\t\twhile (p%i == 0 && q%i == 0) {\n\t\t\tp /= i;\n\t\t\tq /= i;\n\t\t}\n\t\twhile (q%(mi/i) == 0 && p%(mi/i) == 0) {\n\t\t\tp /= (mi/i);\n\t\t\tq /= (mi/i);\n\t\t}\n\n\t}\n\n\tans = 1;\n\n\n\tfor (int i = 2; i * i <= q; i++) {\n\t\tif (q%i != 0) continue;\n\t\tint k = 1;\n\t\tif (i != 2){\n\t\t\tfor (int j = 3; j * j<= i; j++) {\n\t\t\t\tif (i%j == 0) {\n\t\t\t\t\tk = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (k == 1) ans *= i;\n\t\twhile (q%i == 0) {\n\t\t\tq /= i;\n\t\t}\n\t}\n\tans *= q;\n\n\tcout << ans << endl;\n\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint gcd(int p,int q){\n return q==0 ? p : gcd(q,p%q);\n}\nint main(){\n int p,q;\n while(cin>>p>>q,p){\n int g=gcd(p,q);\n p/=g;\n q/=g;\n long long int res=1;\n for(int i=2;i<1e5;i++){\n if(q%i==0){\n res*=i;\n while(q%i==0) q/=i;\n }\n\n }\n res*=q;\n cout<<res<<endl;\n return 0;\n }\n\n}", "#include <bits/stdc++.h>\n#define REP(i,n) for (int i=0;i<(n);i++)\nusing namespace std;\nint gcd(int a,int b){\n if(b==0)return a;\n return gcd(b,a%b);\n}\nint main(){\n int p,q;\n cin>>p>>q;\n int r=gcd(q,p);\n p/=r;q/=r;\n int ans=1;\n for(int i=2;i*i<=q;i++){\n if(q%i!=0)continue;\n ans*=i;\n while(q%i==0)q/=i;\n }\n ans*=q;\n cout<<ans<<endl;\n}", "import math\n# import numpy as np # Pythonのみ！\n# from operator import xor\n# import re\n# from scipy.sparse.csgraph import connected_components # Pythonのみ！\n# ↑cf. https://note.nkmk.me/python-scipy-connected-components/\n# from scipy.sparse import csr_matrix\n# import string\nimport sys\nsys.setrecursionlimit(10 ** 5 + 10)\ndef input(): return sys.stdin.readline().strip()\n\ndef resolve():\n \n p,q=map(int,input().split())\n g=math.gcd(p,q)\n\n p//=g\n q//=g\n\n \n \n # cf. https://qiita.com/suecharo/items/14137fb74c26e2388f1f\n def make_prime_list_2(num):\n if num < 2:\n return []\n \n # 0のものは素数じゃないとする\n prime_list = [i for i in range(num + 1)]\n prime_list[1] = 0 # 1は素数ではない\n num_sqrt = math.sqrt(num)\n \n for prime in prime_list:\n if prime == 0:\n continue\n if prime > num_sqrt:\n break\n \n for non_prime in range(2 * prime, num, prime):\n prime_list[non_prime] = 0\n \n return [prime for prime in prime_list if prime != 0]\n \n \n def prime_factorization_2(num):\n \"\"\"numの素因数分解\n 素因数をkeyに乗数をvalueに格納した辞書型dict_counterを返す\"\"\"\n \n if num <= 1:\n # 例えば1を食ったときの対処の仕方は問題によって違うと思うのでそのつど考える。\n # cf. https://atcoder.jp/contests/abc110/submissions/12688244\n return False\n else:\n num_sqrt = math.floor(math.sqrt(num))\n prime_list = make_prime_list_2(num_sqrt)\n \n dict_counter = {} # 何度もこの関数を呼び出して辞書を更新したい時はこれを引数にして\n # cf. https://atcoder.jp/contests/arc034/submissions/12251452\n \n for prime in prime_list:\n while num % prime == 0:\n if prime in dict_counter:\n dict_counter[prime] += 1\n else:\n dict_counter[prime] = 1\n num //= prime\n if num != 1:\n if num in dict_counter:\n dict_counter[num] += 1\n else:\n dict_counter[num] = 1\n \n return dict_counter\n\n d=prime_factorization_2(q)\n ans=1\n for k in d.keys():\n ans*=k\n print(ans)\nresolve()\n", "#include<stdio.h>\n#include<math.h>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<math.h>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<numeric>\nusing namespace std;\n\nint yaku(int n,int m){\n if(n%m==0){\n return m;\n }\n return yaku(m,n%m);\n}\n\n\nint main(){\n int n,m;\n cin>>n>>m;\n m/=yaku(n,m);\n int ans=1;\n for(int i=2;i*i<=m;i++){\n if(m%i==0){\n ans*=i;\n while(m%i==0){\n m/=i;\n }\n }\n }\n ans*=m;\n cout<<ans<<endl;\n \n return 0;\n}\n", "#include<bits/stdc++.h>\n#define INF 1e9\n#define llINF 1e18\n#define MOD 1000000007\n#define pb push_back\n#define mp make_pair \n#define F first\n#define S second\n#define ll long long\n#define vi vector<ll>\n#define vvi vector<vi>\n#define BITLE(n) (1LL<<((ll)n))\n#define SHIFT_LEFT(n) (1LL<<((ll)n))\n#define SUBS(s,f,t) ((s).substr((f)-1,(t)-(f)+1))\n#define ALL(a) (a).begin(),(a).end()\n#define EPS 1e-15\nusing namespace std;\nll gcd(ll a,ll b){\n ll r = a%b;\n while(r>0){\n a = b;b = r;\n r =a%b;\n }\n return b;\n}\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n ll p,q;cin>>p>>q;\n ll g = gcd(p,q);\n ll ans = 1;\n q/=g;\n ll loop = q;\n for(ll i = 2;i <= sqrt(loop);i++){\n if(q % i == 0){\n ans *= i;\n while(q%i == 0){\n\tq/=i;\n }\n }\n }\n cout<<ans*q<<endl;\n return 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nconst int INF = 1e9;\nusing ll = long long;\n\nvoid bunkai(vector<ll> &a,ll x){\n ll temp=x;\n for(ll i=2;i*i<=x;i++){\n if(temp%i==0){\n a.push_back(i);\n while(temp%i==0){\n\ttemp/=i;\n }\n }\n }\n a.push_back(temp);\n return;\n}\n\nll gcd(ll x,ll y){\n if(x%y==0){\n return y;\n }else{\n return gcd(y,x%y);\n }\n}\n\nint main(){\n ll p,q;\n cin>>p>>q;\n ll a=gcd(q,p);\n p/=a;\n q/=a;\n //cout<<\"p=\"<<p<<\"q=\"<<q<<endl;\n vector<ll> soinsu;\n bunkai(soinsu,q);\n ll ans=1;\n for(ll i=0;i<soinsu.size();i++){\n ans*=soinsu[i];\n //cout<<\"ans=\"<<ans<<endl;\n }\n cout<<ans<<endl;\n return 0;\n}\n\n", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\ntypedef long long int ll;\n#define BIG_NUM 2000000000\nusing namespace std;\n\nint calc(int x,int y){\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn calc(y,x%y);\n\t}\n}\n\nint main(){\n\n\tint p,q,common,limit;\n\tscanf(\"%d %d\",&p,&q);\n\n\tcommon = calc(p,q);\n\n\tp /= common;\n\tq /= common;\n\n\tlimit = sqrt(q);\n\n\tint ans = 1;\n\n\tfor(int i = 2; i <= limit; i++){\n\t\tif(q%i == 0){\n\t\t\tans *= i;\n\t\t\twhile(q % i == 0)q /= i;\n\t\t}\n\t}\n\n\tans *= q;\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define syosu(x) fixed<<setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\ntypedef pair<double,double> pdd;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int,P> pip;\ntypedef vector<pip> vip;\nconst int inf=1<<29;\nconst ll INF=1ll<<60;\nconst double pi=acos(-1);\nconst double eps=1e-11;\nconst ll mod=1e9+7;\nconst int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};\n\nll gcd(ll a,ll b){\n\tif(!b) return a;\n\treturn gcd(b,a%b);\n}\n\nmap<int,int> Prime_Factor(int n){\n\tmap<int,int> m;\n\tfor(int i=2;i*i<=n;i++){\n\t\twhile(n%i==0){\n\t\t\tm[i]++;\n\t\t\tn/=i;\n\t\t}\n\t}\n\tif(n!=1) m[n]++;\n\treturn m;\n}\n\n\nint main(){\n\tll n,m;\n\tcin>>n>>m;\n\tm/=gcd(n,m);\n\tauto mp=Prime_Factor(m);\n\tll t=1;\n\tfor(auto p:mp) t*=p.first;\n\tcout<<t<<endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint p, q;\nint gcd(int x, int y){\n\tif(x % y == 0) return y;\n\treturn gcd(y, x % y);\n}\nbool prime(int x){\n\tbool f = true;\n\tfor(int i=2; i*i<=x; ++i)\n\t\tif(x % i == 0)\n\t\t\tf = false;\n\treturn f;\n}\n\nint main(){\n//\tcin.tie(0);\n//\tios::sync_with_stdio(false);\n\tcin >> p >> q;\n\tint g = gcd(p, q);\n\tq /= g;\n//\tcout << p / g << \" \" << q << \"\\n\";\n\tvector<int> a;\n\tif(prime(q)){\n\t\tcout << q << \"\\n\";\n\t\treturn 0;\n\t}\n\tfor(int i=2; i<=q; ++i){\n\t\tif(q % i == 0){\n\t\t\tint t = 1;\n\t\t\tq /= i;\n\t\t\twhile(q % i == 0){\n\t\t\t\t++t;\n\t\t\t\tq /= i;\n\t\t\t}\n\t\t\ta.push_back(i);\n\t\t}\n\t}\n\tint ans = 1;\n\tfor(int i=0; i<a.size(); ++i)\n\t\tans *= a[i];\n\tcout << ans << \"\\n\";\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,j) for(int i = 0; i < j; i++)\nint gcd(int a, int b) {\nreturn b == 0 ? a : gcd(b, a % b);\n}\n\nint main(){\n\tint p1,q;\n\tcin >> p1 >> q;\n\tint t = gcd(p1,q);\n\tq /= t;\n\tvector<int> pl;\n\tpl.push_back(2);\n\tpl.push_back(3);\n\tfor(int i = 5; i*i < 1e9; i+=2){\n\t\tbool f = true;\n\t\tfor(int j = 3; j*j <= i; j+=2){\n\t\t\tif(i % j == 0)f = false;\n\t\t}\n\t\tif(f) pl.push_back(i);\n\t}\n\tfor(int i = 0; i < pl.size(); i++){\n\t\twhile(q%(pl[i]*pl[i]) == 0){\n\t\t\tq /= pl[i];\n\t\t}\n\t}\n\tcout << q << endl;\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nint p, q;\nint main() {\n\tcin >> p >> q;\n\tvector<int> A = {};\n\tfor (int i = 2; i * i <= q; i++) {\n\t\tif(q % i == 0) {\n\t\t\tA.push_back(i);\n\t\t\tA.push_back(q / i);\n\t\t}\n\t}\n\tfor (auto i : A) {\n\t\twhile (p % i == 0 and q % i == 0) {\n\t\t\tp /= i;\n\t\t\tq /= i;\n\t\t}\n\t}\n\tvector<int> pr ={};\n\tfor (int i = 2; i * i <= q; i++) {\n\t\tif (q % i == 0) pr.push_back(i);\n\t\twhile (q % i == 0) q /= i;\n\t}\n\tfor (auto pp : pr) {\n\t\tq *= pp;\n\t}\n\tcout << q << endl;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define repp(i, l, r) for(int i = (l); i < (r); i++)\n#define per(i, n) for(int i = ((n)-1); i >= 0; i--)\n#define perr(i, l, r) for(int i = ((r)-1); i >= (l); i--)\n#define all(x) (x).begin(),(x).end()\n#define MOD 1000000007\n#define IINF 1000000000\n#define LINF 1000000000000000000\n#define SP <<\" \"<<\n#define CYES cout<<\"Yes\"<<endl\n#define CNO cout<<\"No\"<<endl\n#define CFS cin.tie(0);ios::sync_with_stdio(false)\n\ntypedef long long LL;\ntypedef long double LD;\n\nLL gcd(LL x, LL y){\n while(x%y){\n LL tmp = x%y;\n x=y;\n y=tmp;\n }\n return y;\n}\n\nint main(){\n LL p,q;\n cin >> p >> q;\n p%=q;\n q/=gcd(p,q);\n LL ans=1;\n repp(i,2,sqrt(q)+1){\n if(q%i==0){\n ans*=i;\n while(q%i==0) q/=i;\n }\n }\n if(q>1) ans*=q;\n cout << ans << endl;\n return 0;\n}\n\n", "#include<iostream>\nusing namespace std;\nint p, q; int gcd(int a, int b) { if (b == 0)return a; return gcd(b, a%b); }\nint main() {\n\tcin >> p >> q; int res = 1; int r = gcd(p, q); q /= r;\n\tfor (int i = 2; i*i <= q; i++) {\n\t\tif (q%i == 0) { res *= i; while (q%i == 0)q /= i; }\n\t}\n\tif (q >= 2)res *= q;\n\tcout << res << endl;\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nint p,q,ans=1,j;\n\nint so(int n){\n for(int i=2;i*i<=n;i++)if(n%i==0)return 1;\n return 0;\n}\n\nint main(){\n cin>>p>>q;\n if(so(q)){\n for(int i=2;q>=i;i++){\n for(j=0;q%i==0;j++){\n\tq/=i;\n\tif(p%i==0)p/=i,j--;\n }\n if(j==0)continue;\n ans*=i;\n }\n cout<<ans<<endl;\n }else cout<<q<<endl;\n return 0;\n}", "#include<bits/stdc++.h>\nconst int MOD=1000000007;\nconst int INF=1000000000;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\nconst double eps=1e-9;\nconst int inf=1e9;\ntypedef pair<int,int> P;\nstruct Point\n{\n double x,y;\n Point(){x=0;y=0;}\n Point(double d_x,double d_y){x=d_x,y=d_y;}\n double operator*(Point obj){return obj.x*x+obj.y*y;}\n double operator%(Point obj){return obj.y*x-obj.x*y;}\n Point operator*(double b){Point tmp;tmp.x=x*b;tmp.y=y*b;return tmp;}\n Point operator/(double b){Point tmp;tmp.x=x/b;tmp.y=y/b;return tmp;}\n Point operator+(Point obj){Point tmp;tmp.x=x+obj.x;tmp.y=y+obj.y;return tmp;}\n Point operator-(){Point tmp;tmp.x=-x;tmp.y=-y;return tmp;}\n Point operator-(Point obj){Point tmp;tmp.x=x-obj.x;tmp.y=y-obj.y;return tmp;}\n Point operator-=(Point obj){x-=obj.x;y-=obj.y;return *this;}\n Point operator+=(Point obj){x+=obj.x;y+=obj.y;return *this;}\n Point operator/=(double b){x=x/b;y=y/b;return *this;}\n Point operator*=(double b){x=x*b;y=y*b;return *this;}\n double size(){return hypot(x,y);}\n Point unit(){return Point(x/size(),y/size());}\n Point normal(){return Point(y,-x);}\n double atan(){return atan2(y,x);}\n};\n\nbool operator<(Point a,Point b){return a.x!=b.x?a.x<b.x:a.y<b.y;}\nbool operator>(Point a,Point b){return b<a;}\nbool operator<=(Point a,Point b){return !(b<a);}\nbool operator>=(Point a,Point b){return !(a<b);}\nbool operator==(Point a,Point b){return (a-b).size()<eps;}\nbool operator!=(Point a,Point b){return !(a==b);}\n\nbool equal(double a,double b){return abs(a-b)<eps;}\ndouble cross(Point a,Point b){return a%b;}\ndouble dot(Point a,Point b){return a*b;}\n\nint ccw(Point a,Point b,Point c)\n{\n b=b-a;\n c=c-a;\n if(b%c>0) return +1;\n else if(b%c<0)return -1;\n else if(b*c<0) return +2;\n else if(b.size()<c.size()) return -2;\n else return 0;\n}\n\nint gcd(int a,int b)\n{\n if(b>a) \n {\n swap(a,b);\n gcd(a,b);\n }\n if(b==0) return a;\n else if(b==1) return b;\n int p=a/b;\n a-=p*b;\n return gcd(b,a);\n}\n\nint main(int argc,char const* argv[])\n{\n int p,q,k;\n cin >>p >> q;\n k=gcd(p,q);\n p/=k;\n q/=k;\n int q_=q;\n vector<P> ans;\n for(int i=2;i<=sqrt(q);i++)\n {\n if(q_%i==0)\n\t{\n\t P pa=make_pair(i,1);\n\t q_ /=i;\n\t while(q_%i ==0)\n\t {\n\t pa.second++;\n\t q_ /=i;\n\t }\n\t ans.push_back(pa);\n\t}\n }\n if(q_ > 1) ans.push_back(P(q_,1));\n\n int a=1;\n for(int i=0;i<(int) ans.size();i++)\n {\n a*=ans[i].first;\n }\n\t \n cout << a << endl;\n return 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n\nint GCD(int a, int b){\n\tif(b == 0) return a;\n\telse return GCD(b, a % b);\n}\n\nint main(){\n\tint p, q;\n\tcin >> p >> q;\n\tq /= GCD(p, q);\n\tmap<int, int> mpa;\n\tfor(int i = 2; i * i <= q; i++){\n\t\twhile(q % i == 0){\n\t\t\tmpa[i]++;\n\t\t\tq /= i;\n\t\t}\n\t}\n\tif(q != 1) mpa[q]++;\n\tmap<int, int>::iterator it;\n\tint ans = 1;\n\tfor(it = mpa.begin(); it != mpa.end(); it++){\n\t\tans *= it->first;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <tuple>\n#include <cstring>\n#include <map>\n#include <iomanip>\n#include <ctime>\n#include <complex>\n#include <cassert>\n#include <climits>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#define _ << \" \" <<\n#define all(X) (X).begin(), (X).end()\n#define len(X) (X).size()\n#define Pii pair<int, int>\n#define Pll pair<ll, ll>\n#define Tiii tuple<int, int, int>\n#define Tlll tuple<ll, ll, ll>\n\nll gcd(ll a, ll b) {\n if (a < b) swap(a, b);\n ll r = a % b;\n while (r != 0) {\n a = b; b = r;\n r = a % b;\n }\n return b;\n}\n\n\nvector<Pll> PF(ll n) {\n vector<Pll> fs;\n ll base = n;\n for (ll i = 2; i * i <= base; i++) {\n if (base % i == 0) {\n int cnt = 0;\n while (base % i == 0) {\n base /= i;\n cnt++;\n }\n fs.emplace_back(i, cnt);\n }\n }\n if (base > 1) fs.emplace_back(base, 1);\n return fs;\n}\n\n\nint main() {\n int p, q;\n cin >> p >> q;\n int g = gcd(p, q);\n vector<Pll> fs = PF(q / g);\n int ans = 1;\n for (auto &i : fs) ans *= i.first;\n cout << ans << endl;\n\n}\n", "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1<<30;\nint gcd(int a,int b){\n\treturn (b==0?a:gcd(b,a%b));\n}\nint main(){\n\tint a,b;\n\tcin>>a>>b;\n\tb/=gcd(a,b);\n\tint out=1;\n\tfor(int t=2;t*t<=b;t++)if(b%t==0){\n\t\tout*=t;\n\t\twhile(b%t==0)b/=t;\n\t}\n\tcout<<out*b<<endl;\n}", "#include <cstdio>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <stack>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstdlib>\n#include <bitset>\n#include <tuple>\n#include <assert.h>\n#include <deque>\n#include <bitset>\n#include <iomanip>\n#include <limits>\n#include <chrono>\n#include <random>\n#include <array>\n#include <unordered_map>\n#include <functional>\n#include <complex>\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nconst long long MAX = 5100000;\nconst long long INF = 1LL << 60;\nconst long long mod = 1000000007LL;\n//const long long mod = 998244353LL;\n\nusing namespace std;\ntypedef unsigned long long ull;\ntypedef long long ll;\n\n\nll gcd(ll x, ll y)\n{\n\tll r;\n\tif (x < y) {\n\t\tswap(x, y);\n\t}\n\twhile (y > 0) {\n\t\tr = x % y;\n\t\tx = y;\n\t\ty = r;\n\t}\n\treturn x;\n}\n\nmap<ll, ll> prime_factor(ll a) {\n\tmap<ll, ll> ret;\n\tfor (ll i = 2; i * i <= a; i++) {\n\t\twhile (a % i == 0 && a != 0) {\n\t\t\tret[i]++;\n\t\t\ta /= i;\n\t\t}\n\t}\n\tif (a != 1) {\n\t\tret[a]++;\n\t}\n\treturn ret;\n}\nint main()\n{\n\t/*\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\t*/\n\n\tll p, q; scanf(\"%lld %lld\", &p, &q);\n\tll g = gcd(p, q);\n\tp /= g;\n\tq /= g;\n\tmap<ll, ll> mp1 = prime_factor(p);\n\tmap<ll, ll> mp2 = prime_factor(q);\n\tvector<ll> v;\n\t//for (auto p : mp1) v.push_back(p.first);\n\tfor (auto p: mp2) v.push_back(p.first);\n\tsort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());\n\tll res = 1;\n\tfor (auto e : v) res *= e;\n\tcout << res << endl;\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nint gcd(int a, int b){\n if (b == 0){\n return a;\n } else {\n return gcd(b, a % b);\n }\n}\nint main(){\n int p, q;\n cin >> p >> q;\n int g = gcd(p, q);\n p /= g;\n q /= g;\n int ans = 1;\n for (int i = 2; i * i <= q; i++){\n if (q % i == 0){\n ans *= i;\n while (q % i == 0){\n q /= i;\n }\n }\n }\n if (q != 1){\n ans *= q;\n }\n cout << ans << endl;\n}\n", "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nint gcd(int a, int b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n}\n\nint main() {\n int p, q;\n cin >> p >> q;\n q /= gcd(p, q);\n for (int i = 2; i * i <= q; i++) {\n while (q % (i * i) == 0) q /= i;\n }\n cout << q << endl;\n return 0;\n}\n\n", "#include <iostream>\nusing namespace std;\n\nint gcd(int a, int b)\n{\n return b == 0 ? a : gcd(b,a%b);\n}\n\nint main()\n{\n int p, q;\n cin >> p >> q;\n q /= gcd(p,q);\n long long int x = 1;\n for(int i = 2; i * i <= q; i++){\n if(q % i == 0){\n x *= i;\n while(q % i == 0) q /= i;\n }\n }\n cout << x * q << endl;\n}", "#include <bits/stdc++.h>\n#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))\n#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))\n#define rep(i, n) For((i), 0, (n))\n#define rrep(i, n) rFor((i), (n), 0)\n#define fi first\n#define se second\nusing namespace std;\ntypedef long long lint;\ntypedef unsigned long long ulint;\ntypedef pair<int, int> pii;\ntypedef pair<int, lint> pil;\ntypedef pair<lint, lint> pll;\ntemplate<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}\ntemplate<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}\ntemplate<class T> T div_floor(const T a, const T b){return a>=0 ? a/b : (a+1)/b-1;}\ntemplate<class T> T div_ceil(const T a, const T b){return a>=0 ? (a-1)/b+1 : a/b;}\n\nconstexpr lint mod = 1e9+7;\nconstexpr lint INF = mod*mod;\nconstexpr int MAX = 100010;\n\nlint gcd(lint p, lint q){\n if(p < q) swap(p, q);\n while(q){\n lint r = p % q;\n p = q;\n q = r;\n }\n return p;\n}\n\nint main(){\n lint p, q;\n scanf(\"%lld%lld\", &p, &q);\n lint g = gcd(p, q);\n p /= g; q /= g;\n lint ans = 1;\n for(lint i=2; i*i<=q; ++i){\n if(q%i == 0){\n ans *= i;\n while(q%i == 0) q /= i;\n }\n }\n if(q > 1) ans *= q;\n printf(\"%lld\\n\", ans);\n}\n", " #include <bits/stdc++.h>\n #include<iostream>\n #include<cstdio>\n #include<vector>\n #include<queue>\n #include<map>\n #include<cstring>\n #include<string>\n #include <math.h>\n #include<algorithm>\n // #include <boost/multiprecision/cpp_int.hpp>\n #include<functional>\n #define int long long\n #define inf 1000000007\n #define pa pair<int,int>\n #define ll long long\n #define pal pair<double,pa>\n #define ppa pair<pa,int>\n #define ppap pair<int,pa>\n #define ssa pair<string,int>\n #define mp make_pair\n #define pb push_back\n #define EPS (1e-10)\n #define equals(a,b) (fabs((a)-(b))<EPS)\n \n using namespace std;\n //priority_queue<int, vector<int>, greater<int> > que;\n class Point{\n \tpublic:\n \tdouble x,y;\n \tPoint(double x=0,double y=0):x(x),y(y) {}\n \tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\n \tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\n \tPoint operator * (double a) {return Point(x*a,y*a);}\n \tPoint operator / (double a) {return Point(x/a,y/a);}\n \tdouble absv() {return sqrt(norm());}\n \tdouble norm() {return x*x+y*y;}\n \tbool operator < (const Point &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const Point &p) const{\n \t\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n \t}\n };\n typedef Point Vector;\n \n struct Segment{\n Point p1,p2;\n };\n \n double hen(Vector a){\n if(fabs(a.x)<EPS && a.y>0) return acos(0);\n else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);\n else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);\n else if(fabs(a.y)<EPS && a.x>0) return 0.0;\n else if(a.y>0) return acos(a.x/a.absv());\n else return 2*acos(0)+acos(-a.x/a.absv());\n \n }\n \n string itos( int i ) {\n ostringstream s ;\n s << i ;\n return s.str() ;\n }\n \n int gcd(int v,int b){\n \tif(v>b) return gcd(b,v);\n \tif(v==b) return b;\n \tif(b%v==0) return v;\n \treturn gcd(v,b%v);\n }\n double dot(Vector a,Vector b){\n \treturn a.x*b.x+a.y*b.y;\n }\n double cross(Vector a,Vector b){\n \treturn a.x*b.y-a.y*b.x;\n }\n \n double distans(double x1,double y1,double x2,double y2){\n \tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\n \treturn sqrt(rr);\n \t\n }\n /*}\nint pr[100010];\n//int inv[100010];\n \nint beki(int wa,int rr){\n\tif(rr==0) return 1ll;\n\tif(rr==1) return wa;\n\tif(rr%2==1) return (beki(wa,rr-1)*wa)%inf;\n\tint zx=beki(wa,rr/2);\n\treturn (zx*zx)%inf;\n}\n \nvoid gya(){\n\tpr[0]=1;\n\tfor(int i=1;i<100010;i++){\n\t\tpr[i]=(pr[i-1]*i)%inf;\n\t}\n\tfor(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);\n\t\n}\n\n*/\n\n //----------------kokomade tenpure------------\nbool b[100020]={0};\nsigned main(){\nb[1]=1;\n\tfor(int i=2;i<100020;i++){\n\t\tif(b[i]==1) continue;\n\t\tint d=2*i;\n\t\twhile(d<100020){\n\t\t\tb[d]=1;\n\t\t\td+=i;\n\t\t}\n\t}\n\n\tint n,m;\n\tcin>>n>>m;\n\tm=m/gcd(n,m);\n\t\n\tvector<int> ve;\n\t\n\tfor(int i=2;i<100020;i++){\n\t\tif(b[i]==1) continue;\n\t\tint ko=0;\n\t\twhile(1){\n\t\t\tif(m%i==0){\n\t\t\t\tm/=i;\n\t\t\t\tko++;\n\t\t\t\tif(ko==1) ve.pb(i);\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\t\t\n\t}\n\tif(m>1) ve.pb(m);\n\tint ans=1;\n\tfor(int i=0;i<ve.size();i++) ans*=ve[i];\n\tcout<<ans<<endl;\n\t\n\t/*\n\twhile(1){\n\t\tcin>>n>>m;\n\t\tif(n==0) return 0;\n\t\n\t}*/\n\t\n\t\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\n\nbool isPrime[100000];\ntypedef pair<int,int> P;\n\nint main(){\n int p,q;\n cin>>p>>q;\n int d = gcd(p,q);\n p/=d; q/=d;\n // cout<<p<<' '<<q<<endl;\n fill(isPrime,isPrime+100000,true);\n isPrime[0]=isPrime[1]=false;\n for(int i=0;i<100000;i++){\n if(isPrime[i])for(int k=2;k*i<100000;k++) isPrime[i*k]=false;\n }\n int ans=1;\n vector<P> V;\n for(int i=0;i<100000;i++){\n if(!isPrime[i]) continue;\n if(q%i==0){\n ans*=i;\n while(q%i==0) q/=i;\n }\n }\n ans*=q;\n cout<<ans<<endl;\n}", "#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n\nusing namespace std;\n\nconst long long int MOD = 1000000007;\n\nlong long int N, M, K, H, W, L, R;\n\nint gcd(int a, int b) {\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\ta %= b;\n\t\tswap(a, b);\n\t}\n\treturn a;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tcin >> N >> M;\n\tM /= gcd(N, M);\n\tfor (int i = 2; i*i <= M; i++) {\n\t\tlong long int box = i;\n\t\tlong long int div = 1;\n\t\twhile (box < M) {\n\t\t\tbox *= i;\n\t\t\tif (M%box == 0)div *= i;\n\t\t}\n\t\tM /= div;\n\n\t}\n\tcout << M<< endl;\n\treturn 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int, int> P;\nconst int M = 1000000007;\n\nint gcd(int a, int b) {\n while (b > 0) { int t = a % b; a = b; b = t; }\n return a;\n}\n\nint main() {\n int p, q;\n cin >> p >> q;\n int g = gcd(p, q);\n q /= g;\n int ans = 1;\n for (int i = 2; i * i <= q; ++i) {\n if (q % i == 0) {\n ans *= i;\n while (q % i == 0)\n q /= i;\n }\n }\n ans *= q;\n cout << max(ans, 2) << \"\\n\";\n return 0;\n}", "#!usr/bin/env python3\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef I(): return int(sys.stdin.readline())\ndef LS():return list(map(list, sys.stdin.readline().split()))\ndef S(): return list(sys.stdin.readline())[:-1]\ndef IR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = I()\n return l\ndef LIR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = LI()\n return l\ndef SR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = S()\n return l\ndef LSR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = LS()\n return l\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n#A\ndef A():\n while 1:\n n,m = LI()\n if n == 0 and m == 0:\n break\n v = [[] for i in range(n)]\n for i in range(m):\n a,b = LI()\n a -= 1\n b -= 1\n v[a].append(b)\n v[b].append(a)\n bfs_map = [1 for i in range(n)]\n bfs_map[0] = 0\n f = [0 for i in range(n)]\n q = deque()\n q.append(0)\n fl = 1\n while q:\n if not fl:break\n x = q.popleft()\n for y in v[x]:\n if bfs_map[y]:\n bfs_map[y] = 0\n f[y] = (1-f[x])\n q.append(y)\n else:\n if f[y] == f[x]:\n print(0)\n fl = 0\n break\n if fl:\n ans = []\n k = sum(f)\n if k%2 == 0:\n ans.append(k//2)\n k = len(f)-sum(f)\n if k%2 == 0:\n ans.append(k//2)\n ans = list(set(ans))\n ans.sort()\n print(len(ans))\n for i in ans:\n print(i)\n return\n\n#B\ndef B():\n def gcd(a,b):\n if a == 0:\n return b\n return gcd(b%a, a)\n\n def factorize(n):\n if n < 4:\n return {n:1}\n i = 2\n d = defaultdict(int)\n m = n\n while i**2 <= n:\n if m%i == 0:\n while m%i == 0:\n m//=i\n d[i] += 1\n i += 1\n d[m] += 1\n return d\n p,q = LI()\n g = gcd(p,q)\n ans = q//g\n if ans == 1:\n print(1)\n else:\n d = factorize(ans)\n ans = 1\n for i in d.keys():\n ans *= i\n print(ans)\n return\n\n#C\ndef C():\n return\n\n#D\ndef D():\n return\n\n#E\ndef E():\n return\n\n#F\ndef F():\n return\n\n#G\ndef G():\n return\n\n#H\ndef H():\n return\n\n#I\ndef I_():\n return\n\n#J\ndef J():\n return\n\n#Solve\nif __name__ == \"__main__\":\n B()\n\n", "#include <iostream>\nusing namespace std;\n\nint gcd(int p,int q){\n int r=q%p;\n while(r>0){\n q=p;\n p=r;\n r=q%p;\n }\n return p;\n}\n\nint divide(int b,int i){\n while(b%(i*i)==0){\n b/=i;\n }\n return b;\n}\n\nint main(){\n int p,q;\n cin>>p>>q;\n int b=q/gcd(p,q);\n for(int i=2;i*i<=b;i++)\n b=divide(b,i);\n cout<<b<<endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\n\nint main(){\n int p,q;\n method(gcd,int,int a,int b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n };\n method(func,int,int x){\n int res = 1;\n for(int i=2;i*i<=x;++i){\n bool flag = false;\n while(x%i==0){\n x /= i;\n flag = true;\n }\n if(flag)res *= i;\n }\n res *= x;\n return res;\n };\n cin >> p >> q;\n cout << func(q /gcd(p,q)) << endl;\n return 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,a,b) for(int i=(a),i##_cond=(b);i<i##_cond;++i)\n\nint ext_gcd(int a, int b, int &x, int &y){\n if(b == 0){\n x = 1; y = 0; return a;\n }\n int q = a / b;\n int g = ext_gcd(b, a-q*b, x, y);\n int z = x - q * y;\n x = y; y = z;\n return g;\n}\n\nmap<int,int> pf(int n){\n map<int,int> res;\n FOR(i,2,sqrt(n)+1){\n if(n == 1) break;\n while(n%i == 0){\n res[i]++;\n n /= i;\n }\n }\n if(n != 1) res[n]++;\n return res;\n}\n\nint main(){\n int p, q; cin >> p >> q;\n int x, y;\n q /= ext_gcd(p,q,x,y);\n auto pr = pf(q);\n int ans = 1;\n for(auto pa : pr) ans *= pa.first;\n cout << ans << endl;\n}\n", "#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nlong gcd(long a, long b){\n if(b == 0)\n return a;\n\n return gcd(b, a%b);\n}\n\nint main(){\n long p, q;\n cin >> p >> q;\n\n long tmp = gcd(q, p);\n p /= tmp;\n q /= tmp;\n\n long ans = 1;\n long root = sqrt(q) + 1;\n vector<bool> hurui(root, true);\n for(int i=2; i<=root; i++){\n if(hurui[i] == true){\n if(i <= root){\n\tfor(int j=2*i; j<=root; j+=i){\n\t hurui[j] = false;\n\t}\n }\n if(q%i == 0){\n\tans *= i;\n\twhile(q%i == 0)\n\t q /= i;\n\tif(q == 1)\n\t break;\n }\n }\n }\n ans *= q;\n\n cout << ans << endl;\n \n return 0;\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\ntypedef long long int ll;\n#define BIG_NUM 2000000000\nusing namespace std;\n\nint main(){\n\n\tint p,q,pre_limit,limit;\n\tscanf(\"%d %d\",&p,&q);\n\n\tpre_limit = sqrt(q);\n\n\tfor(int i = 2; i <= pre_limit; i++){\n\t\twhile(p%i == 0 && q %i == 0){\n\t\t\tp /= i;\n\t\t\tq /= i;\n\t\t}\n\t}\n\n\tif(q % p == 0)q /= p;\n\n\tlimit = sqrt(q);\n\n\tint ans = 1;\n\n\tfor(int i = 2; i <= limit; i++){\n\t\tif(q%i == 0){\n\t\t\tans *= i;\n\t\t\twhile(q % i == 0)q /= i;\n\t\t}\n\t}\n\n\tans *= q;\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}", "#include<iostream>\nusing namespace std;\nunsigned gcd(unsigned a, unsigned b) {\n if(a < b) return gcd(b, a);\n unsigned r;\n while ((r=a%b)) {\n a = b;\n b = r;\n }\n return b;\n}\nint main(){\n long long p,q,t=1,gc;\n cin >> p >> q;\n gc = gcd(p,q);\n p /= gc;\n q /= gc;\n for(int i=2;i*i<=q;i++){\n if(q%i==0){\n t*=i;\n while(q%i==0) q/=i;\n }\n }\n t*=q;\n cout << t << endl;\n}\n\n", "#include<iostream>\nusing namespace std;\nlong gcd(long a,long b){return b?gcd(b,a%b):a;}\nlong a,b;\nint main()\n{\n\tcin>>a>>b;\n\tb/=gcd(a,b);\n\tfor(long i=2;i*i<=b;i++)\n\t{\n\t\twhile(b%(i*i)<1)b/=i;\n\t}\n\tcout<<b<<endl;\n}\n\n", "#include <iostream>\n#include <vector>\n#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint P, Q;\nbool p[1000000];\nvector<int> v;\n\nint gcd(int a, int b) {\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\nbool prime(int n) {\n REP(i, 0, v.size()) if(n % v[i] == 0) return false;\n return true;\n}\n\nll solve() {\n ll ans = 1;\n REP(i, 0, v.size()) if(Q % v[i] == 0) {\n ans *= v[i];\n while(Q % v[i] == 0) Q /= v[i];\n }\n if(prime(Q)) ans *= Q;\n return ans;\n}\n\nint main(void) {\n REP(i, 0, 1000000) p[i] = true;\n p[0] = p[1] = false;\n REP(i, 0, 1000000) if(p[i]) for(int j = i * 2; j < 1000000; j += i) p[j] = false;\n REP(i, 0, 1000000) if(p[i]) v.push_back(i);\n\n cin >> P >> Q;\n Q = Q / gcd(P, Q);\n cout << solve() << endl;\n return 0;\n}", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint gcd(int a, int b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n}\n\nint solve(int n) {\n int res = 1;\n for (int i = 2; i * i <= n; i++) {\n if (n % i) continue;\n res *= i;\n while (n % i == 0) n /= i;\n }\n if (n != 1) res *= n;\n return res;\n}\n\nint main(void) {\n int p, q;\n cin >> p >> q;\n \n cout << solve(q / gcd(p, q)) << endl;\n\n return 0;\n}\n", "#include <iostream>\n#include <algorithm>\n//#include <numeric>\nusing namespace std;\n#define FOR(i,a,b) for (size_t i = a; i < b; i++)\n#define REP(i,b) FOR(i,0,b)\n#define RFOR(i,a,b) for (size_t i = a-1; i >= b; i--)\n#define RREP(i,a) RFOR(i,a,0)\n#define INF 1e7\n\nlong gcd(long a, long b)\n{\n long r;\n do {\n r = b % a;\n //printf(\"%ld = %ld * ? + %ld\\n\", b, a, r);\n b = a;\n a = r;\n } while(r);\n\n return b;\n}\n\nlong search_root(long a)\n{\n int ans = 1, tmp = a;\n for (int i = 2; i * i <= tmp; i++) {\n //cout<<i<<tmp<<endl;\n if (tmp % i == 0) {\n ans *= i;\n while (tmp % i == 0) tmp /= i;\n }\n }\n\n return ans * tmp;\n}\n\nint main()\n{\n long p, q;\n cin>>p>>q;\n\n cout<<search_root(q / gcd(p, q))<<endl;\n\n return 0;\n}\n\n", "#include <bits/stdc++.h>\n#define ll long long\n#define var auto\nusing namespace std;\n\nll gcd(ll a, ll b){\n while(true){\n if (a == 0) return b;\n b %= a;\n if (b == 0) return a;\n a %= b;\n }\n}\n\nint main(){\n ll p, q;\n cin >> p >> q;\n var g = gcd(p, q);\n p /= g;\n q /= g;\n ll res = 1;\n for (ll i = 2; i * i <= q; i++){\n if (q % i != 0) continue;\n res *= i;\n while (q % i == 0){\n q /= i;\n }\n }\n res *= q;\n cout << res << endl;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint gcd(int x, int y) {\n\tif (x<=y) return gcd(y, x);\n\tif (x%y == 0) return y;\n\telse return gcd(y, x%y);\n}\n\nint main() {\n\tint p, q; cin >> p >> q;\n\tint r = q/gcd(p, q);\n\tint s = r;\n\tint res = 1;\n\tfor (int i = 2; i*i <= r; ++i) {\n\t\tif (s%i == 0) {\n\t\t\tres *= i;\n\t\t\twhile (s%i == 0) s /= i;\n\t\t}\n\t}\n\tres *= s;\n\tcout << res << endl;\n\treturn 0;\n}\n", "#include <cstdio>\n#include <utility>\n\nint gcd(int m, int n) {\n while (n) std::swap(m %= n, n);\n return m;\n}\n\nint main() {\n int p, q;\n scanf(\"%d %d\", &p, &q);\n\n int m = q / gcd(p, q);\n int res = 1;\n for (int i = 2; i*i <= m; ++i) {\n if (m % i == 0) {\n res *= i;\n do {\n m /= i;\n } while (m % i == 0);\n }\n }\n\n if (m > 1) res *= m;\n \n printf(\"%d\\n\", res);\n}\n\n", "#include<iostream>\n#include<cstdio>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\nusing namespace std;\ntypedef long long ll;\nconst ll MOD = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\nconst double EPS = 1e-9;\ntypedef pair<int, int> P;\ntypedef unsigned int ui;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\nint gcd(int a, int b) {\n\tif (b == 0)return a;\n\treturn gcd(b, a%b);\n}\nint main() {\n\tint isp[100000] = {};\n\tvector<int> v;\n\tRep(i, 2, 100000) {\n\t\tif (!isp[i]) {\n\t\t\tv.push_back(i);\n\t\t\tfor(int j=2*i;j<100000;j+=i){\n\t\t\t\tisp[j] = 1;\n\t\t\t}\n\t\t}\n\t}\n\tint p, q; cin >> p >> q;\n\tint d = gcd(q,p);\n\tq /= d;\n\tint out = 1; int now = 0;\n\twhile (q > 1) {\n\t\tif (q%v[now] == 0) {\n\t\t\tout*=v[now];\n\t\t\twhile (q%v[now] == 0)q /= v[now];\n\t\t}\n\t\telse if (v[now] > (int)sqrt(q + 0.5)) {\n\t\t\tout *= q; q = 1;\n\t\t}\n\t\telse now++;\n\t}\n\tif (out == 1)out = 2;\n\tcout << out << endl;\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nll power(ll e, ll x) {\n if (x == 0)\n return 1;\n if (x % 2 == 0)\n return power(e * e, x / 2);\n return e * power(e, x - 1);\n}\n\nint main() {\n ll a, b;\n cin >> a >> b;\n a %= b;\n map<ll, int> amp, bmp;\n for (ll i = 2; i * i <= a; i++) {\n if (a % i == 0) {\n amp[i]++;\n a /= i;\n i--;\n }\n }\n for (ll i = 2; i * i <= b; i++) {\n if (b % i == 0) {\n bmp[i]++;\n b /= i;\n i--;\n }\n }\n if (a > 1)\n amp[a]++;\n if (b > 1)\n bmp[b]++;\n ll ans = 1;\n for (auto &v : bmp) {\n if (v.second - amp[v.first] >= 1)\n ans *= v.first;\n }\n cout << ans << endl;\n return 0;\n}\n", "#include<iostream>\n#include<map>\n#include<algorithm>\n#include <iomanip>\n#include <cmath>\n#include <sstream>\n#include <unordered_map>\n#include <unordered_set>\n#include <deque>\n#include <vector>\n#include <bitset>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <cstring>\n#include <cstdio>\n#include <list>\n\n\nconstexpr int INF = 1050000000;\nconstexpr int MOD = 1000000007;\nconstexpr long long LONGINF = 1005000000000000000;\nusing namespace std;\n\nusing ll = long long;\n/* UnionFind\n\n\nclass UnionFind {\nprivate:\n\tstd::vector<int> parent;\n\tstd::vector<int> height;\n\tstd::vector<int> m_size;\n\npublic:\n\tUnionFind(int size_) : parent(size_), height(size_, 0), m_size(size_, 1) {\n\t\tfor (int i = 0; i < size_; ++i) parent[i] = i;\n\t}\n\tvoid init(int size_) {\n\t\tparent.resize(size_);\n\t\theight.resize(size_, 0);\n\t\tm_size.resize(size_, 1);\n\t\tfor (int i = 0; i < size_; ++i) parent[i] = i;\n\t}\n\tint find(int x) {\n\t\tif (parent[x] == x) return x;\n\t\treturn parent[x] = find(parent[x]);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x);\n\t\ty = find(y);\n\t\tif (x == y) return;\n\t\tint t = size(x) + size(y);\n\t\tm_size[x] = m_size[y] = t;\n\t\tif (height[x] < height[y]) parent[x] = y;\n\t\telse parent[y] = x;\n\t\tif (height[x] == height[y]) ++height[x];\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n\tint size(int x) {\n\t\tif (parent[x] == x) return m_size[x];\n\t\treturn size(parent[x] = find(parent[x]));\n\t}\n};\n\n\n*/\n\nint GCD(int a, int b) {\n\twhile (b) {\n\t\tint tmp = a % b;\n\t\ta = b;\n\t\tb = tmp;\n\t}\n\treturn a;\n}\n\nint s(int a) {\n\tint n = a;\n\tmap<int, int> mp;\n\tfor (int i = 2; i*i <= a; i++) {\n\t\twhile (n%i == 0) {\n\t\t\tn /= i;\n\t\t\tmp[i];\n\t\t}\n\t}\n\tmp[n];\n\tint check = 1;\n\tfor (auto x : mp) {\n\t\tcheck *= x.first;\n\t}\n\n\treturn check;\n}\n\nint main() {\n\n\n\t\tint p, q; cin >> p >> q; if (p == 0 && q == 0) { return 0; }\n\n\t\tint G = GCD(p, q);\n\n\t\tp /= G;\n\t\tq /= G;\n\n\t\tcout << s(q) << endl;\n\n}\n", "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\nconst double PI = 3.14159265358979323846;\nconst double EPS = 1e-12;\nconst int INF = numeric_limits<int>::max() / 2;\nconst int NEG_INF = numeric_limits<int>::min() / 2;\nconst int MOD = 1e9 + 7;\n\n//a,b???GCD\nll gcd(ll a, ll b) {\n\tif (b == 0) return a;\n\treturn gcd(b, a%b);\n}\n\n//?´???°??????\nvector<ll> divisor(ll n){\n vector<ll> res;\n //res.push_back(1);res.push_back(n);\n ll tmp=n;\n for(int i=2;i*i<=n;i++){\n if(tmp%i!=0)continue;\n res.push_back(i);\n while(tmp%i==0){\n tmp/=i;\n } \n }\n if(tmp!=n) res.push_back(tmp);\n sort(res.begin(),res.end());\n return res;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n ll p,q;cin>>p>>q;\n ll g=gcd(p,q);\n p/=g;q/=g;\n vector<ll> res=divisor(q);\n if(res.size()==0) cout<<q<<endl;\n else{\n ll ret=1;\n for(int i=0;i<(int)res.size();i++) ret*=res[i];\n cout<<ret<<endl;\n }\n}" ]
G: Almost Infinite Glico problem There is a field where N squares are arranged in a ring. The i-th (1 \ leq i \ leq N-1) cell is ahead of the i + 1th cell. However, if i = N, the next cell is the first cell. The first cell you are in is the first cell. From there, play rock-paper-scissors K times in a row according to the following rules. At this time, you and your opponent have acquired a special rock-paper-scissors game, so there are M ways to win rock-paper-scissors. * When you play rock-paper-scissors with your opponent and you beat your opponent, you will advance by the number of squares p_i according to the move you have just made, that is, how to win i. If you lose, you will stay there. After finishing K rock-paper-scissors, find the remainder of the number if you are in the i-th cell divided by 1,000,000,007 for each cell. The difference between the two cases here means that out of each of the K rock-paper-scissors games, there is at least one loss or a different way of winning. Keep in mind that it also distinguishes how to win. In addition, for each way of winning, there is no one that has no possibility of occurring. Input format Input is given 1 + M lines. NMK p_1_1 ... p_M The first line gives the number of squares N, the number of ways to win rock-paper-scissors M, and the number of times to play rock-paper-scissors K. Then M lines are given. The i + 1 line gives the number of squares p_i to advance when the i-th win is made. Constraint * 1 \ leq N \ leq 8 \ times 10 ^ 2 * 1 \ leq M \ leq 10 ^ 4 * 1 \ leq K \ leq 10 ^ 9 * 1 \ leq p_i \ leq 10 ^ 9 Output format The output consists of N lines. On line i, print the number of times you are in the i-th cell after finishing K rock-paper-scissors. Input example 1 10 3 2 3 6 6 Output example 1 1 0 Four 2 0 0 Five 0 0 Four It is a general glyco. Rock-paper-scissors is played twice on this input. For example, in order to be in the first square after playing rock-paper-scissors twice, you have to lose all rock-paper-scissors. There is no other combination that ends in the first cell, so there is only one. To be in the 4th square after playing rock-paper-scissors twice * Win the first rock-paper-scissors game → lose the second rock-paper-scissors game * Lose in the first rock-paper-scissors → Win in the first way in the second rock-paper-scissors There are two ways. Note that if the order is different, it will be treated as a different case. Input example 2 5 1 103 Four Output example 2 355272559 885073297 355272559 607675915 607675915 Note that we output the remainder divided by 1,000,000,007. Example Input 10 3 2 3 6 6 Output 1 0 4 2 0 0 5 0 0 4
[ "#include<bits/stdc++.h>\nusing namespace std;\n\n// macro\n#define rep(i,n) for(i=0;i<n;i++)\n#define ll long long\n#define all(v) v.begin(), v.end()\n\n// code starts\n#define MOD 1000000007\n\nint main()\n{\n ll n,m,k;cin>>n>>m>>k;\n vector<int> p(m);\n ll i,j,l;\n rep(i,m)cin>>p[i];\n ll num=1;\n ll needs=0;\n while(num<=k)\n {\n num*=2;\n needs++;\n }\n vector<vector<ll>> con(needs+2,vector<ll>(n,0));\n rep(i,m)\n {\n con[0][p[i]%n]++;\n }\n con[0][0]++;\n for(i=1;i<=needs+1;i++)\n {\n rep(j,n)\n {\n rep(l,n)\n {\n con[i][(j+l)%n]+=con[i-1][l]*con[i-1][j];\n con[i][(j+l)%n]%=MOD;\n }\n }\n }\n ll left=k;\n ll nowi=0;\n vector<ll> ans(n,0);\n ans[0]=1;\n vector<ll> nans(n,0);\n while(left>0)\n {\n if(left%2==1)\n {\n rep(j,n)\n {\n rep(l,n)\n {\n nans[(j+l)%n]+=con[nowi][l]*ans[j];\n nans[(j+l)%n]%=MOD;\n }\n }\n rep(j,n)\n {\n ans[j]=nans[j];\n nans[j]=0;\n }\n }\n left/=2;\n nowi++;\n }\n rep(j,n)cout<<ans[j]<<endl;\n}\n\n", "#include<bits/stdc++.h>\n\n\nusing namespace std;\n\n\ntypedef long long ll;\n\nll dp[50][1000];\nll ans[1000];\nll M=1e9+7;\n\nint main(){\n ll n,m,K,p[10000];\n cin>>n>>m>>K;\n\n\n dp[0][0]++;\n for(int i=0;i<m;i++)cin>>p[i],dp[0][p[i]%n]++;\n \n ll i=0;\n\n\n ans[0]=1;\n \n while((1<<i)<=K){\n\n if((1<<i)&K){\n ll tmp[1000]={};\n \n for(int k=0;k<n;k++)\n\tfor(int j=0;j<n;j++){\n\t tmp[(k+j)%n]\n\t =(tmp[(k+j)%n]+(ans[k]*dp[i][j]%M))%M;\n\t}\n\n for(int j=0;j<n;j++)ans[j]=tmp[j];\n }\n\n for(int k=0;k<n;k++)\n for(int j=0;j<n;j++)dp[i+1][(k+j)%n]=(dp[i+1][(k+j)%n]+dp[i][k]*dp[i][j]%M)%M;\n\n\n i++;\n\n }\n\n for(int i=0;i<n;i++)cout<<ans[i]<<endl;\n \n return 0;\n}", "#include <bits/stdc++.h>\n/* S.size() s.substr(l,r=s.size()-l) -> l文字目からr文字分\n__gcd()　lower_bound(a+l,a+r,x)-a でindex\n// 配列 -> min/max({}) \n// vector-> *min_element(a+l,a+r) *忘れず lとrで[l,r) \n//reverse(a+l,a+r) 配列aの[l,r)を逆順に strはreverse(all(s))\n//sort(a+l,a+r,greater <int>()) 配列aの[l,r)昇順sort,大きい順はgreater<type>()\n//vectorならall(v)\nclock()/CLOCKS_PER_SEC で秒数\nvector v.push_back(x),v.pop_back()\nq.push(x),front()で先頭を返す,pop()で削除, size(),empty()\n<deque>(push/pop)_(front/back)/fornt/back/insert/\npriority_queue 宣言は priority_queue< Type, vector<Type>, greater<Type>> Q1; \n// pq.push(x),top()で参照 pop()で削除 greaterで最小 lessで最大がtopに*/\nusing namespace std;\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define repl(i, s, n) for (ll i = (s); i < (ll)(n); i++)\n#define rrep(i,n) for(int (i)=(n)-1;(i)!=-1;(i)--)\n#define vep(i,v) for(auto (i)=v.begin();(i)<(v.end());(i)++)\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ninline long long ceildiv(long long a, long long b) { return (a+b-1)/b; }\n\nconst long long inf = 10e17;\n\n//int |x|<=2*10**9 long |x|<= 9*10**18\n//printf(\".(小数点以下の桁数)lf(double時、float ならf)\")\n#define ll long long\n#define print(i) std::cout << (i) << '\\n'\ntypedef vector<ll> vec;\ntypedef vector<vec> mat ;\nconst ll mod =1000000007;\nvec mul(vec &A,vec &B){\n vec ret(A.size(),0ll);\n int n=A.size();\n rep(i,n){\n rep(j,n){\n ret[(i+j)%n]=(ret[(i+j)%n]+A[i]*B[j]%mod)%mod;\n }\n }\n return ret;\n}\nvec pow(vec A,ll n){\n vec ret(A.size(),0ll);\n ret[0]=1ll;\n while(n>0ll){\n if(n&1ll)ret=mul(ret,A);\n A=mul(A,A);\n n>>=1ll;\n }\n return ret;\n}\nint main(){\nint n,m;\nll k;\ncin>>n>>m>>k;\nvec a(n,0ll);\na[0]++;\nrep(b,m){\n int p;\n cin>>p;\n p%=n;\n a[p]++;\n}\n\nvec V=pow(a,k);\nrep(i,n){\n cout<<V[i]<<endl;\n}\n}\n\n", "#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> PI;\nconst ll mod = 1e9 + 7;\n\nVL mul(const VL &a, const VL &b) {\n int n = a.size();\n VL ret(2 * n - 1);\n REP(i, 0, n) {\n REP(j, 0, n) {\n ret[i + j] += a[i] * b[j];\n ret[i + j] %= mod;\n }\n }\n for (int i = n - 2; i >= 0; --i) {\n ret[i] += ret[i + n];\n ret[i] %= mod;\n }\n return VL(ret.begin(), ret.begin() + n);\n}\n\n\nint main(void) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, m, k;\n cin >> n >> m >> k;\n VL a(n, 0);\n VL sum(n, 0);\n a[0] = 1;\n sum[0] = 1;\n REP(et, 0, m) {\n int p;\n cin >> p;\n a[p % n] += 1;\n }\n VL cur(a);\n while (k > 0) {\n if (k % 2) {\n sum = mul(sum, cur);\n }\n cur = mul(cur, cur);\n k /= 2;\n }\n REP(i, 0, n) {\n cout << sum[i] << \"\\n\";\n }\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\ntypedef vector<ll> V;\ntypedef vector<V> MATRIX;\n\nint N,M;\nll table[10000];\n\nMATRIX calc_ans(MATRIX left, MATRIX right){\n MATRIX RET(1,V(N));\n for(int col = 0; col < N; col++){\n \tRET[0][col] = 0;\n \tfor(int row = 0; row < N; row++){\n \t\tRET[0][col] += left[0][row]*right[row][col];\n \t\tRET[0][col] %= MOD;\n \t}\n }\n\n return RET;\n}\n\n\nMATRIX calc(MATRIX left,MATRIX right){\n\n\tMATRIX ret(N,V(N));\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++)ret[i][k] = 0;\n\t}\n\n\tfor(int col = 0; col < N; col++){\n\t\tret[0][col] = 0;\n\t\tfor(int row = 0; row < N; row++){\n\t\t\tret[0][col] += left[0][row]*right[row][col];\n\t\t\tret[0][col] %= MOD;\n\t\t}\n\t}\n\n\tfor(int row = 0; row <= N-2; row++){\n\t\tfor(int col = 0; col <= N-1; col++){\n\t\t\tret[row+1][(col+1)%N] = ret[row][col];\n\t\t}\n\t}\n\n\treturn ret;\n\n}\n\nMATRIX pow(MATRIX MULT,int count){\n\n\tMATRIX ret(N,V(N));\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int col = 0; col < N; col++){\n\t\t\tif(row == col)ret[row][col] = 1;\n\t\t\telse{\n\t\t\t\tret[row][col] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\twhile(count > 0){\n\t\tif(count%2 == 1)ret = calc(ret,MULT);\n\t\tMULT = calc(MULT,MULT);\n\t\tcount /= 2;\n\t}\n\n\treturn ret;\n}\n\n\n\nint main(){\n\n\tint K;\n\tscanf(\"%d %d %d\",&N,&M,&K);\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%lld\",&table[i]);\n\t\ttable[i] %= N;\n\t}\n\n\tll work[N];\n\twork[0] = 1;\n\tfor(int i = 1; i <= N-1; i++)work[i] = 0;\n\n\tfor(int i = 0; i < M; i++){\n\t\twork[table[i]]++;\n\t}\n\n\tMATRIX first_state(1,V(N));\n\tfirst_state[0][0] = 1;\n\n\tfor(int i = 1; i <= N-1; i++)first_state[0][i] = 0;\n\n\tMATRIX transition(N,V(N));\n\tfor(int i = 0; i <= N-1; i++)transition[0][i] = work[i];\n\n\tfor(int row = 0; row <= N-2; row++){\n\t\tfor(int col = 0; col <= N-1; col++){\n\t\t\ttransition[row+1][(col+1)%N] = transition[row][col];\n\t\t}\n\t}\n\n\tif(K > 1){\n\t\ttransition = pow(transition,K);\n\t}\n\n\tMATRIX ans = calc_ans(first_state,transition);\n\n\tfor(int i = 0; i < N; i++){\n\t\tprintf(\"%lld\\n\",ans[0][i]%MOD);\n\t}\n\n\treturn 0;\n}\n\n", "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tint n = ni(), m = ni(), K = ni();\n\t\tint[] P = na(m);\n\t\tint[] M = new int[n];\n\t\tM[0] = 1;\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tM[P[i]%n]++;\n\t\t}\n\t\tint[] v = new int[n];\n\t\tv[0] = 1;\n\t\tint[] ret = powc(M, v, K, 1000000007);\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tout.println(ret[i]);\n\t\t}\n\t}\n\t\n\tstatic int[] powc(int[] A, int[] v, long e, int mod)\n\t{\n\t\tint[] MUL = A;\n\t\tfor(int i = 0;i < v.length;i++)v[i] %= mod;\n\t\tfor(;e > 0;e>>>=1){\n\t\t\tif((e&1)==1)v = mulc(MUL, v, mod);\n\t\t\tMUL = mulc(MUL, MUL, mod);\n\t\t}\n\t\treturn v;\n\t}\n\tpublic static int[] mulc(int[] A, int[] B, int mod)\n\t{\n\t\tint n = A.length;\n\t\tint[] C = new int[n];\n\t\tfinal long BIG = 8L*mod*mod;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tlong sum = 0;\n\t\t\tfor(int j = 0, k = i;j < n;j++,k--){\n\t\t\t\tif(k < 0)k = n-1;\n\t\t\t\tsum += (long)A[k] * B[j];\n\t\t\t\tif(sum >= BIG)sum -= BIG;\n\t\t\t}\n\t\t\tC[i] = (int)(sum % mod);\n\t\t}\n\t\treturn C;\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tlong S = System.currentTimeMillis();\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\ttr(G-S+\"ms\");\n\t}\n\t\n\tprivate static boolean eof()\n\t{\n\t\tif(lenbuf == -1)return true;\n\t\tint lptr = ptrbuf;\n\t\twhile(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\t\t\n\t\ttry {\n\t\t\tis.mark(1000);\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b == -1){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn true;\n\t\t\t\t}else if(!isSpaceChar(b)){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t\n\tprivate static byte[] inbuf = new byte[1024];\n\tpublic static int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate static int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\t\n\tprivate static String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate static char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate static char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate static int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate static int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}", "#include <iostream>\n#include <vector>\nusing namespace std;\n\nconst long long p = 1000000007;\n\nvoid printmat(const vector< int > &a)\n{\n const int n = a.size();\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n cerr << a[(i+n-j)%n] << \" \";\n }\n cerr << endl;\n }\n}\n\n// caution: b = a * b\nvoid mulBy(const vector< int > &a, vector< int > &b, int n)\n{\n vector< int > r(n);\n for(int i = 0; i < n; i++) {\n r[i] = b[i];\n }\n for(int j = 0; j < n; j++) {\n long long c = 0;\n for(int k = 0; k < n; k++) {\n c += (a[k] * (long long)r[(j+n-k)%n]) % p; // b'[i][j] += a[i][k] * b[k][j];\n }\n b[j] = (int)(c % p);\n }\n}\n// b = b * b\nvoid pow2(vector< int > &b, int n)\n{\n vector< int > r(n);\n for(int i = 0; i < n; i++) {\n r[i] = b[i];\n }\n mulBy(r, b, n);\n}\n// mat = mat^x\nvoid pow(vector< int > &mat, int n, int x)\n{\n vector< int > r(n);\n // eye\n for(int j = 0; j < n; j++) {\n r[j] = 0 == j ? 1 : 0;\n }\n while(x > 0) {\n if((x & 1) != 0) {\n mulBy(mat, r, n);\n }\n pow2(mat, n);\n x >>= 1;\n }\n for(int j = 0; j < n; j++) {\n mat[j] = r[j];\n }\n}\n\nint main(int argc, char *argv[])\n{\n for(;;) {\n int n, m, k;\n cin >> n >> m >> k;\n vector<int> ps;\n for(int i = 0; i < m; i++) {\n int pi;\n cin >> pi;\n ps.push_back(pi);\n }\n\n // hist[i] .. possibilities of being on i\n // hist' = hist * mat\n // where mat[i][j] is transition possibilities from i to j\n \n vector< int > mat(n);\n for(int j = 0; j < n; j++) {\n mat[j] = 0;\n }\n // kachi\n for(int j = 0; j < m; j++) {\n mat[(int)((ps[j]) % n)]++;\n }\n mat[0]++; // make\n //printmat(mat);\n pow(mat, n, k);\n for(int i = 0; i < n; i++) {\n cout << mat[i] << endl;\n }\n break;\n }\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll mod=1000000007;\n\nvector<ll> solve(vector<ll> a,vector<ll> b,ll m) {\n vector<ll> c(m,0);\n for(int i=0; i<m; i++) {\n for(int j=0; j<m; j++) {\n c[(i+j)%m]+=a[i]*b[j];\n c[(i+j)%m]%=mod;\n }\n }\n return c;\n}\n\nvector<ll> mod_pow(vector<ll> a,ll n,ll m){\n if(n==0) {\n vector<ll> v(m,0);\n v[0]=1;\n return v;\n }\n if(n==1) return a;\n vector<ll> b=mod_pow(solve(a,a,m),n/2,m);\n if(n&1) b=solve(b,a,m);\n return b;\n}\n\nint main() {\n ll n,m,k;\n cin >> n >> m >> k;\n vector<ll> a(n,0);\n a[0]++;\n for(int i=0; i<m; i++) {\n int x;\n cin >> x;\n a[x%n]++;\n }\n a=mod_pow(a,k,n);\n for(int i=0; i<n; i++) cout << a[i] << endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#pragma GCC optimize (\"-O3\")\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\n//---------------------------------------------------------------------------------------------------\ntypedef long long ll;\nint mod = 1000000007;\nint add(int x, int y) { return (x += y) >= mod ? x - mod : x; }\ntemplate<class... T> int add(int x, T... y) { return add(x, add(y...)); }\nint mul(int x, int y) { return 1LL * x * y % mod; }\ntemplate<class... T> int mul(int x, T... y) { return mul(x, mul(y...)); }\nint sub(int x, int y) { return add(x, mod - y); }\nint modpow(int a, long long b) {\n int ret = 1; while (b > 0) {\n if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1;\n } return ret;\n}\nint modinv(int a) { return modpow(a, mod - 2); }\ntypedef vector<int> Vec;\ntypedef vector<Vec> Mat;\nVec mulMatVec(Mat a, Vec b)\n{\n int n = b.size(); Vec ret(n, 0);\n rep(i, 0, n) rep(j, 0, n) ret[i] = add(ret[i], mul(a[i][j], b[j]));\n return ret;\n}\nMat mulMatMat(Mat a, Mat b)\n{\n int n = a.size(); Mat ret(n, Vec(n, 0));\n rep(i, 0, n) rep(j, 0, n) rep(k, 0, n) ret[i][j] = add(ret[i][j], mul(a[i][k], b[k][j]));\n return ret;\n}\nMat mulMatMatForJunkai(Mat a, Mat b)\n{\n int n = a.size(); Mat ret(n, Vec(n, 0));\n rep(j, 0, n) rep(k, 0, n) ret[0][j] = add(ret[0][j], mul(a[0][k], b[k][j]));\n rep(i, 1, n) rep(j, 0, n) ret[i][j] = ret[0][(j - i + n) % n];\n return ret;\n}\nMat fastpow(Mat x, ll n)\n{\n Mat ret(x.size(), Vec(x.size(), 0));\n rep(i, 0, x.size()) ret[i][i] = 1;\n while (0 < n) { if ((n % 2) == 0) { x = mulMatMatForJunkai(x, x); n >>= 1; } else { ret = mulMatMatForJunkai(ret, x); --n; } }\n return ret;\n}\nvoid printVec(Vec a) { cout << \"[\\t\"; rep(i, 0, a.size()) cout << a[i] << \"\\t\"; cout << \"]\" << endl; }\nvoid printMat(Mat a) { rep(i, 0, a.size()) printVec(a[i]); }\n/*---------------------------------------------------------------------------------------------------\n????????????????????????????????? ??§?????§ \n??????????????? ??§?????§ ???????´<_??? ?????? Welcome to My Coding Space!\n???????????? ??? ?´_???`??????/??? ???i \n?????????????????????????????? ??? |???| \n????????? /?????? /??£??£??£??£/??????| \n??? ???_(__??????/??? ???/ .| .|???????????? \n??? ????????????/????????????/??????u?????? \n---------------------------------------------------------------------------------------------------*/\n\nint N, M, K, P[101010];\n//---------------------------------------------------------------------------------------------------\nvoid _main() {\n cin >> N >> M >> K;\n rep(i, 0, M) cin >> P[i];\n\n Mat m(N, Vec(N, 0));\n Vec v(N, 0);\n v[0] = 1;\n\n rep(from, 0, N) rep(i, 0, M) {\n int to = (from + P[i]) % N;\n m[to][from]++;\n }\n rep(i, 0, N) m[i][i]++;\n\n //printMat(m);\n\n m = fastpow(m, K);\n v = mulMatVec(m, v);\n rep(i, 0, N) printf(\"%d\\n\", v[i]);\n}", "#include <bits/stdc++.h>\n#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> row;\ntypedef vector<row> mat;\n\nll N, M, K, P[10000];\n\nrow mul(row &A, row &B) {\n row C(N);\n REP(i, 0, N)\n REP(j, 0, N)\n C[i] = (C[i] + A[j] * B[(i - j + N) % N]) % MOD;\n return C;\n}\n\nrow pow(row A, ll n) {\n row B(N);\n B[0] = 1;\n while(n > 0) {\n if(n & 1) B = mul(B, A);\n A = mul(A, A);\n n >>= 1;\n }\n return B;\n}\n\n\nint main(void) {\n cin >> N >> M >> K;\n REP(i, 0, M) cin >> P[i];\n\n row A(N);\n A[0]++;\n REP(i, 0, M) A[(N - P[i] % N) % N]++;\n A = pow(A, K);\n\n REP(i, 0, N) cout << A[(N - i) % N] << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n\nusing ll = long long;\n\nconst ll mod = 1e9+7;\n\nusing vl = vector<ll>;\nusing mat = vector<ll>;\n\nmat mul(const mat &a, const mat &b)\n{\n int n = a.size();\n mat c(n);\n\n rep(i,n)\n {\n c[i] = 0;\n rep(j,n) c[i] = (a[j]*b[(i-j+n)%n] + c[i]) %mod;\n }\n return c;\n}\n\nvl mul_v(const mat &a, const vl &b)\n{\n int n = a.size();\n vl ret(n);\n rep(i,n)\n {\n rep(j,n)\n {\n ret[i] += (a[(j+i)%n]*b[j])%mod;\n ret[i] %= mod;\n }\n }\n\n return ret;\n}\n\n\nmat pow(const mat &a, int n)\n{\n int N = a.size();\n mat r(N);\n // ??????\n r[0]=1;\n\n mat p(a);\n while(n)\n {\n if(n&1) r = mul(r,p);\n p = mul(p,p);\n n>>=1;\n }\n\n return r;\n}\n\nint main()\n{\n int n,m,k;\n scanf(\" %d %d %d\", &n, &m, &k);\n\n mat A(n);\n A[0] = 1;\n\n rep(i,m)\n {\n int p;\n scanf(\" %d\", &p);\n\n ++A[p%n];\n }\n\n mat P = pow(A,k);\n vl b(n);\n b[0]=1;\n\n vl ans = mul_v(P,b);\n\n rep(i,n) printf(\"%lld\\n\", ans[i]);\n return 0;\n}", "// need\n#include <iostream>\n#include <algorithm>\n\n// data structure\n#include <bitset>\n//#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <array>\n//#include <tuple>\n//#include <unordered_map>\n#include <unordered_set>\n#include <complex>\n//#include <deque>\n#include<valarray>\n\n// stream\n//#include <istream>\n//#include <sstream>\n//#include <ostream>\n//#include <fstream>\n\n// etc\n#include <cmath>\n#include <cassert>\n#include <functional>\n#include <iomanip>\n//#include <typeinfo>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;\n\n// output\n#define OUT(d) std::cout<<d;\n#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;\n#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;\n#define SP std::cout<<\" \";\n#define TAB std::cout<<\"\\t\";\n#define BR std::cout<<\"\\n\";\n#define SPBR(i, n) std::cout<<(i + 1 == n ? '\\n' : ' ');\n#define ENDL std::cout<<std::endl;\n#define FLUSH std::cout<<std::flush;\n#define SHOW(d) {std::cerr << #d << \"\\t:\" << d << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\n\";}\n\n// utility\n#define ALL(a) (a).begin(),(a).end()\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)\n#define REP(i, n) for(int i=0;i<int(n);++i)\n#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)\n#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)\n#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)\n#define REPLL(i, n) for(ll i=0;i<ll(n);++i)\n#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)\n#define IN(a, x, b) (a<=x && x<b)\ntemplate<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }\ntemplate<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\nvoid CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << \"[Time:\" << res << \"ns (\" << res / (1.0e9) << \"s)]\\n\"; }\n\n// test\ntemplate<class T> std::vector<std::vector<T>> VV(int n) {\n\treturn std::vector<std::vector<T>>(n);\n}\ntemplate<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {\n\treturn std::vector<std::vector<T>>(n, std::vector<T>(m, init));\n}\ntemplate<typename S, typename T>\nstd::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\n\tos << \"(\" << p.first << \", \" << p.second << \")\"; return os;\n}\n\n// type/const\n\n#define int ll\nusing ll = long long;\nusing ull = unsigned long long;\nusing PAIR = std::pair<int, int>;\nusing PAIRLL = std::pair<ll, ll>;\nconstexpr int INFINT = 1 << 30; // 1.07x10^ 9\nconstexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9\nconstexpr ll INFLL = 1LL << 60; // 1.15x10^18\nconstexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18\nconstexpr double EPS = 1e-7;\nconstexpr int MOD = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\n\nll powMod(ll n, ll p, ll mod) {\n\tll res = 1;\n\twhile (p) {\n\t\tif (p & 1) res *= n; res %= mod;\n\t\tn *= n; n %= mod;\n\t\tp >>= 1;\n\t}\n\treturn res;\n}\n\nstd::vector<int> mul(const std::vector<int>& l, const std::vector<int>& r) {\n\tint n = l.size();\n\tstd::vector<int> res(n, 0);\n\tREP(i, n) {\n\t\tREP(j, n) {\n\t\t\t(res[i] += l[j] * r[(i - j + n) % n]) %= MOD;\n\t\t}\n\t}\n\treturn res;\n}\n\nsigned main() {\n\tINIT;\n\tVAR(int, n, m, k);\n\tVEC(int, p, m);\n\tp.emplace_back(0);\n\tREP(i, m) p[i] %= n;\n\tstd::vector<int> C(n, 0);\n\tREP(i, m + 1) ++C[p[i]];\n\tstd::vector<int> B(n, 0);\n\tB[0] = 1;\n\n\twhile (k) {\n\t\tif (k & 1) B = mul(B, C);\n\t\tC = mul(C, C);\n\t\tk >>= 1;\n\t}\n\tREP(i, n) {\n\t\tOUT(B[i])BR;\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nmat mul(mat &A,mat &B){\n\tmat C(A.size(),vec(B[0].size()));\n\tfor(int i=0;i<A.size();i++){\n\t\tfor(int k=0;k<B.size();k++){\n\t\t\tfor(int j=0;j<B[0].size();j++){\n\t\t\t\tC[i][j]=(C[i][j]+(A[i][k]*B[k][j]%MOD))%MOD;\n\t\t\t}\n\t\t}\n\t}\n\treturn C;\n}\n\nmat pow(mat A,ll n){\n\tmat B(A.size(),vec(A.size()));\n\tfor(int i=0;i<A.size();i++){\n\t\tB[i][i]=1;\n\t}\n\twhile(n>0){\n\t\tif(n&1)B=mul(B,A);\n\t\tA=mul(A,A);\n\t\tn>>=1;\n\t}\n\treturn B;\n}\n\n\nint n,m,K;\nll p[10001];\nll nec[801];\nll res[30][801];\nll ans[2][801];\n\nint main(void){\n\tscanf(\"%d%d%d\",&n,&m,&K);\n\tmat B(n,vec(n));\n\tfor(int i=0;i<m;i++){\n\t\tscanf(\"%d\",&p[i]);\n\t}\n\tnec[0]++;\n\tfor(int i=0;i<m;i++){\n\t\tint mo=p[i]%n;\n\t\tnec[mo]++;\n\t}\n\tfor(int i=0;i<30;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tfor(int k=0;k<n;k++){\n\t\t\t\tif(i>0)res[i][(j+k)%n]+=(res[i-1][j]*res[i-1][k])%MOD;\n\t\t\t\tif(i==0)res[i][j]=nec[j];\n\t\t\t\tif(res[i][(j+k)%n]>=MOD)res[i][(j+k)%n]%=MOD;\n\t\t\t}\n\t\t}\n\t}\n\tint prev=0,now=1;\n\tans[0][0]=1;\n\tfor(int i=0;i<30;i++){\n\t\tif(K>>i & 1){\n\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\tfor(int k=0;k<n;k++){\n\t\t\t\t\tans[now][(j+k)%n]+=(ans[prev][j]*res[i][k])%MOD;\n\t\t\t\t\tif(ans[now][(j+k)%n]>=MOD)ans[now][(j+k)%n]%=MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t\tswap(now,prev);\n\t\t\tmemset(ans[now],0,sizeof(ans[now]));\n\t\t}\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tprintf(\"%lld\\n\",ans[prev][i]);\n\t}\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define each(itr,v) for(auto itr:v)\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcount\n\nconst long long M=1e9+7;\ntypedef vector<long long> vec;\ntypedef vector<vec> mat;\nstruct Matrix{\n int N;\n mat a;\n Matrix(int n){\n N=n;\n a=mat(N,vec(N));\n for(int i=0;i<N;i++)a[i][i]=1;\n }\n Matrix pow(long long b) const {\n Matrix res(N);\n Matrix d(N);\n for(int i=0;i<N;i++)for(int j=0;j<N;j++)d[i][j]=a[i][j];\n for(;b>0;b>>=1,d=d*d)if(b&1)res=d*res;\n return res;\n }\n Matrix operator+(const Matrix& r) const {\n Matrix s(N);\n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++){\n s[i][j]=(a[i][j]+r.a[i][j])%M;\n }\n }\n return s;\n }\n Matrix operator*(const Matrix& r) const {\n Matrix s(N);\n for(int i=0;i<N;i++)s[i][i]=0;\n const long long modl=8*M*M;\n //for(int i=0;i<N;i++){\n for(int k=0;k<N;k++){\n for(int j=0;j<N;j++){\n s[0][j]+=a[0][k]*r.a[k][j];\n if(s[0][j]>=modl)s[0][j]-=modl;\n }\n }\n for(int j=0;j<N;j++)s[0][j]%=M;\n //}\n for(int i=0;i<N-1;i++){\n for(int j=0;j<N;j++){\n s[i+1][(j+1)%N]=s[i][j];\n }\n }\n return s;\n }\n\n vector<long long>& operator[](int i){\n return a[i];\n }\n};\n\n\nll n,m,k;\nll cnt[888];\n\nint main(){\n\tcin>>n>>m>>k;\n rep(i,m){\n ll p;\n cin>>p;\n cnt[p%n]++;\n }\n Matrix mat(n);\n rep(i,n)rep(j,n){\n mat[i][(i+j)%n]+=cnt[j];\n }\n Matrix res=mat.pow(k);\n\n rep(i,n){\n cout<<res[0][i]<<endl;\n }\n\treturn 0;\n}", "#include <bits/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\n#define EPS 1e-10\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)\n#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)\n#define each(a,b) for(auto (a): (b))\n#define all(v) (v).begin(),(v).end()\n#define len(v) (int)(v).size()\n#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())\n#define cmx(x,y) x=max(x,y)\n#define cmn(x,y) x=min(x,y)\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout<<#x<<\" = \"<<(x)<<endl\n#define spair(p) cout<<#p<<\": \"<<p.fi<<\" \"<<p.se<<endl\n#define svec(v) cout<<#v<<\":\";rep(kbrni,v.size())cout<<\" \"<<v[kbrni];cout<<endl\n#define sset(s) cout<<#s<<\":\";each(kbrni,s)cout<<\" \"<<kbrni;cout<<endl\n#define smap(m) cout<<#m<<\":\";each(kbrni,m)cout<<\" {\"<<kbrni.first<<\":\"<<kbrni.second<<\"}\";cout<<endl\n\nusing namespace std;\n\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<P> vp;\ntypedef vector<string> vs;\n\nstruct mat\n{\n vvl v;\n mat(int n){\n v.resize(n,vl(n,0));\n }\n};\n\nll add(ll x,ll y)\n{\n return (x + y)%MOD;\n}\n\nll sub(ll x,ll y)\n{\n return (x+MOD-y)%MOD;\n}\n\nll mul(ll x,ll y)\n{\n return x*y%MOD;\n}\n\nmat mul(const mat& m1,const mat& m2)\n{\n int MAX_N = len(m1.v);\n mat res(MAX_N);\n rep(i,MAX_N){\n rep(j,MAX_N){\n res.v[0][i] = add(res.v[0][i],mul(m1.v[0][j],m2.v[j][i]));\n }\n }\n srep(i,1,MAX_N){\n rep(j,MAX_N){\n res.v[i][j] = res.v[0][(j+MAX_N-i)%MAX_N];\n }\n }\n return res;\n}\n\nmat mod_pow(const mat& m1,ll b)\n{\n int n = len(m1.v);\n mat res(n);\n rep(i,n){\n res.v[i][i] = 1;\n }\n mat nw(n);\n nw = m1;\n while(b){\n if(b & 1){\n res = mul(res,nw);\n }\n nw = mul(nw,nw);\n b >>= 1;\n }\n return res;\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n,m,K;\n cin >> n >> m >> K;\n mat a(n);\n rep(i,n){\n a.v[i][i]++;\n }\n rep(i,m){\n int b;\n cin >> b;\n rep(j,n){\n a.v[j][(j+b)%n]++;\n }\n }\n mat res(n);\n res = mod_pow(a,K);\n rep(i,n){\n cout << res.v[0][i] << \"\\n\";\n }\n return 0;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define MOD 1000000007\ntypedef vector<int> vec;\nvec calc(vec a,vec b){\n int n=a.size();\n vec res(n,0);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n res[(i+j)%n]+=a[i]*b[j];\n res[(i+j)%n]%=MOD;\n }\n }\n return res;\n}\nsigned main(){\n int n,m,k;\n cin>>n>>m>>k;\n int p[m];\n for(int i=0;i<m;i++) cin>>p[i];\n vec t(n,0);\n t[0]=1;\n for(int i=0;i<m;i++) t[p[i]%n]++;\n vec ans(n,0);ans[0]=1;\n while(k){\n if(k&1) ans=calc(ans,t);\n t=calc(t,t);\n k>>=1;\n }\n for(int i=0;i<n;i++) cout<<ans[i]<<endl;\n return 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <iomanip>\n#include <functional>\n#include <bitset>\n#include <limits>\n#include <cstdio>\n#include <cmath>\n#include <cassert>\n#include <random>\n\n#ifdef DEBUG\n#include \"library/Utility/debug.cpp\"\n#else\n#define debug(...)\n#endif\n\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define EL '\\n'\n#define print(i) std::cout << (i) << '\\n'\n#define all(v) (v).begin(), (v).end()\nusing lnt = long long;\nstruct FIO{FIO(){std::cin.tie(0);std::cout.tie(0);std::ios_base::sync_with_stdio(0);std::cout<<std::fixed<<std::setprecision(15);}}fIO;\n/*-*/\n\nconstexpr lnt MOD = 1e9+7;\nstruct mint\n{\n\tlnt v;\n\tmint():v(0){}\n\tmint(lnt v):v((v+MOD)%MOD){}\n\tmint operator-()const{ return mint(0) - *this; }\n\tmint& operator+=(const mint& a){ if((v+=a.v)>=MOD) v-=MOD; return *this; }\n\tmint& operator-=(const mint& a){ if((v+=MOD-a.v)>=MOD) v-=MOD; return *this; }\n\tmint& operator*=(const mint& a){ (v*=a.v)%=MOD; return *this; }\n\tmint& operator/=(const mint& a){ (*this) *= a.inv(); return *this; }\n\tmint operator+(const mint& a)const{ return mint(*this) += a; }\n\tmint operator-(const mint& a)const{ return mint(*this) -= a; }\n\tmint operator*(const mint& a)const{ return mint(*this) *= a; }\n\tmint operator/(const mint& a)const{ return mint(*this) /= a; }\n\tbool operator<(const mint& a)const{ return v < a.v; }\n\tbool operator==(const mint& a)const{ return v == a.v; }\n\tmint pow(lnt k)const{ mint r(1),t(v); while(k){ if(k&1) r*=t; t*=t; k>>=1; } return r; }\n\tmint inv()const{ return pow(MOD-2); }\n\tstatic mint comb(lnt n, lnt k) { if(n-k<k) k=n-k; mint num(1), dom(1); for(int i=0;i<k;i++) { num*=n-i; dom*=i+1; } return num/dom; }\n\tstatic std::vector<mint> construct_comb(int n) {\n\t\tstd::vector<mint> c(n+1); mint a = 1; c[0] = a; for(int i=1;i<=n;i++) { a = a*mint(n+1-i)/i; c[i] = a; } return c;\n\t}\n\tstatic std::vector<mint> construct_fact(int n) { std::vector<mint> f(n+1,1); for(int i=2;i<=n;i++) f[i]=f[i-1]*i; return f; }\n};\nstd::istream& operator>>(std::istream&i,mint&a){ lnt t; i>>t; a=mint(t); return i; }\nstd::ostream& operator<<(std::ostream&o,const mint&a){ o<<a.v; return o; }\n\nstd::vector<mint> mul(std::vector<mint>& a, std::vector<mint>&b) {\n\tint n=a.size();\n\tstd::vector<mint> c(n,0);\n\trep(i,n) rep(j,n) c[(i+j)%n]+=a[i]*b[j];\n\treturn c;\n}\nstd::vector<mint> pow(std::vector<mint>&a, lnt k) { int n=a.size(); std::vector<mint> r(n,0),t=a;r[0]=1; while(k){ if(k&1) r=mul(r,t); t=mul(t,t); k>>=1; } return r; }\n\nint main() {\n\tint n,m,k;\n\tstd::cin >> n >> m >> k;\n\tstd::vector<mint> a(n,0);\n\ta[0]=1;\n\trep(i,m) {\n\t\tint p;\n\t\tstd::cin >> p;\n\t\ta[p%n]+=mint(1);\n\t}\n\tdebug(a);\n\tauto c=pow(a,k);\n\tdebug(c);\n\trep(i,n) print(c[i]);\n}\n\n", "#include <bits/stdc++.h>\n#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> row;\ntypedef vector<row> mat;\n\nll N, M, K, P[10000];\n\nrow mul(row &A, row &B) {\n row C(N);\n REP(i, 0, N)\n REP(j, 0, N)\n C[i] = (C[i] + A[j] * B[(i - j + N) % N]) % MOD;\n return C;\n}\n\nrow pow(row A, ll n) {\n row B(N);\n B[0] = 1;\n while(n > 0) {\n if(n & 1) B = mul(B, A);\n A = mul(A, A);\n n >>= 1;\n }\n return B;\n}\n\n\nint main(void) {\n cin >> N >> M >> K;\n REP(i, 0, M) cin >> P[i];\n\n row A(N);\n A[0]++;\n REP(i, 0, M) A[P[i] % N]++;\n A = pow(A, K);\n\n REP(i, 0, N) cout << A[i] << endl;\n}", "#include <algorithm>\n#include <cstddef>\n#include <cstdint>\n#include <iostream>\n#include <string>\n#include <vector>\n\nusing usize = std::size_t;\nusing u64 = std::uint64_t;\n\nstatic constexpr u64 mod = 1000000007;\n\nint main() {\n usize n, m;\n std::cin >> n >> m;\n u64 k;\n std::cin >> k;\n\n const auto mul = [&](std::vector<u64> &a, const std::vector<u64> &b) {\n std::vector<u64> c(n * 2, 0);\n for (usize i = 0; i != n; ++i) {\n for (usize j = 0; j != n; ++j) {\n c[i + j] = (c[i + j] + a[i] * b[j]) % mod;\n }\n }\n for (usize i = 0; i != n; ++i) {\n a[i] = (c[i] + c[n + i]) % mod;\n }\n };\n\n std::vector<u64> v(n, 0);\n v[0] += 1;\n for (usize i = 0; i != m; ++i) {\n usize p;\n std::cin >> p;\n p %= n;\n v[p] += 1;\n }\n\n std::vector<u64> ans(n, 0);\n ans[0] = 1;\n\n while (k != 0) {\n if (k % 2 != 0) {\n mul(ans, v);\n }\n mul(v, v);\n k /= 2;\n }\n\n for (const auto e : ans) {\n std::cout << e << \"\\n\";\n }\n\n return 0;\n}\n", "#include <iostream>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n#define FOR(i,a,b) for (int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) begin(v),end(v)\n#define fi first\n#define se second\ntemplate<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }\nusing ll = long long;\nconstexpr ll INF = 1ll<<30;\nconstexpr ll MOD = 1000000007;\n//---------------------------------//\n\nll dp[32][800];\nll dp2[32][800];\n\nint main() {\n\tint N, M, K;\n\tcin >> N >> M >> K;\n\tvector<int> P(M);\n\tREP(i, M) {\n\t\tscanf(\"%d\", &P[i]);\n\t\tP[i] %= N;\n\t}\n\t\n\t++dp[0][0];\n\tREP(i, M) ++dp[0][P[i] % N];\n\t\n\tREP(t, 31) REP(i, N) REP(j, N) {\n\t\t(dp[t + 1][(i + j) % N] += dp[t][i] * dp[t][j] % MOD) %= MOD;\n\t}\n\t\n\tdp2[31][0] = 1;\n\tfor (int t = 30; t >= 0; --t) {\n\t\tif (K >> t & 1) {\n\t\t\tREP(i, N) {\n\t\t\t\tREP(j, N) {\n\t\t\t\t\t(dp2[t][(i + j) % N] += dp2[t + 1][i] * dp[t][j] % MOD) %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tREP(i, N) dp2[t][i] = dp2[t + 1][i];\n\t\t}\n\t}\n\tREP(i, N) printf(\"%lld\\n\", dp2[0][i]);\n\treturn 0;\n}\n\n\n\n", "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<ll,ll> mp;\nll inf = 1e9;\nll mod = 1e9+7;\n\nint main(){\n ll n,m,kk;\n cin>>n>>m>>kk;\n vector<vector<ll> > dp(32, vector<ll>(n,0) );\n dp[0][0]++;\n for(ll i=0;i<m;i++){\n ll tmp;\n cin>>tmp;\n //tmp--;\n dp[0][tmp%n]++;\n }\n for(ll i=1;i<32;i++){\n for(ll j=0;j<n;j++){\n for(ll k=0;k<n;k++){\n dp[i][(j+k)%n] += (dp[i-1][j]*dp[i-1][k])%mod;\n dp[i][(j+k)%n] %= mod;\n }\n }\n }\n\n vector<ll> ans(n,0);\n ans[0] = 1;\n \n for(ll i=0;i<32;i++){\n if( (kk>>i)&1 ){\n vector<ll> tmp(n,0);\n for(ll j=0;j<n;j++){\n for(ll k=0;k<n;k++){\n tmp[(j+k)%n] += (ans[j]*dp[i][k])%mod;\n tmp[(j+k)%n] %= mod;\n }\n }\n ans = tmp;\n }\n }\n\n for(auto i:ans)cout<<i<<endl;\n\n\n return 0;\n}\n\n", "/* -*- coding: utf-8 -*-\n *\n * 2844.cc: Almost Infinite Glico\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 800;\nconst int MOD = 1000000007;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef int vec[MAX_N];\n\n/* global variables */\n\nvec av, bv, cv;\nvec sv, tv;\n\n/* subroutines */\n\ninline void addmod(int &a, int b) { a = (a + b) % MOD; }\n\ninline void initvec(const int n, vec a) {\n memset(a, 0, sizeof(vec));\n}\n\ninline void copyvec(const int n, const vec a, vec b) {\n memcpy(b, a, sizeof(vec));\n}\n\ninline void mulvec(const int n, const vec a, const vec b, vec c) {\n initvec(n, c);\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n addmod(c[(i + j) % n], (ll)a[i] * b[j] % MOD);\n}\n\n/* main */\n\nint main() {\n int n, m, k;\n scanf(\"%d%d%d\", &n, &m, &k);\n\n initvec(n, av);\n av[0] = 1;\n for (int i = 0; i < m; i++) {\n int pi;\n scanf(\"%d\", &pi);\n av[pi % n]++;\n }\n\n initvec(n, bv);\n bv[0] = 1;\n while (k > 0) {\n if (k & 1) {\n mulvec(n, bv, av, sv);\n copyvec(n, sv, bv);\n }\n\n mulvec(n, av, av, sv);\n copyvec(n, sv, av);\n k >>= 1;\n }\n\n for (int i = 0; i < n; i++) printf(\"%d\\n\", bv[i]);\n return 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll,ll>;\nconst ll LINF = 0x1fffffffffffffff;\nconst ll MOD = 1000000007;\n#define name3(_1,_2,_3,name,...) name\n#define rep1(n) for(ll i=0;i<(n);++i)\n#define rep2(i,n) for(ll i=0;i<(n);++i)\n#define rep3(i,a,b) for(ll i=(a);i<(b);++i)\n#define rep(...) name3(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep(i,a,b) for(ll i=(b)-1;i>=(a);i--)\n#define each(i,a) for(auto &i : a)\n#define sum(a) accumulate(all(a), 0LL)\n#define all(i) begin(i), end(i)\ntemplate<class T, class U> inline bool chmin(T &a, const U &b){ if(a > b) { a = b; return 1; } else return 0; }\ntemplate<class T, class U> inline bool chmax(T &a, const U &b){ if(a < b) { a = b; return 1; } else return 0; }\n\n\nll n;\nstruct T{\n ll cnt[800] = {};\n T operator*(const T& a) const {\n T ans;\n rep(n)rep(j,n)ans.cnt[(i+j)%n]+=cnt[i]*a.cnt[j]%MOD;\n each(i,ans.cnt)i%=MOD;\n return ans;\n }\n T pow(ll x) const {\n T ans, a = *this;\n ans.cnt[0] = 1;\n while(x){\n if(x & 1) ans = ans * a;\n a = a * a;\n x >>= 1;\n }\n return ans;\n }\n};\nint main(){\n ll m, k;\n cin >> n >> m >> k;\n T ans;\n ans.cnt[0] = 1;\n rep(m){\n ll p;\n cin >> p;\n ans.cnt[p % n]++;\n }\n ans = ans.pow(k);\n rep(n) cout << ans.cnt[i] << endl;\n}\n", "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<queue>\n#include<deque>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\nint dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;\ntypedef vector<ll> mat;\nint sz;\nmat mul(mat A,mat B){\n mat C(sz);\n rep(i,sz)rep(j,sz)C[(i+j)%sz]+=A[i]*B[j]%mod;\n rep(i,sz)C[i]%=mod;\n return C;\n}\n\nmat pow(mat A,ll k){\n mat B(sz);\n B[0]=1;\n while(k>0){\n if(k&1)B=mul(A,B);\n A=mul(A,A);\n k/=2;\n }\n return B;\n}\nint main(){\n cin>>sz;\n int m,k;\n cin>>m>>k;\n mat A(sz);\n int p[m];\n rep(i,m){\n cin>>p[i];\n A[p[i]%sz]++;\n }\n A[0]++;\n A=pow(A,k);\n rep(i,sz)cout<<A[i]<<endl;\n return 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define MOD 1000000007\ntypedef vector<int> vec;\nvec calc(vec a,vec b){\n int n=a.size();\n vec res(n,0);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n res[(i+j)%n]+=a[i]*b[j];\n res[(i+j)%n]%=MOD;\n }\n }\n return res;\n}\nsigned main(){\n int n,m,k;\n cin>>n>>m>>k;\n int p[m];\n for(int i=0;i<m;i++) cin>>p[i];\n vec t(n,0);\n t[0]=1;\n for(int i=0;i<m;i++) t[p[i]%n]++;\n vec ans=t;k--;\n while(k){\n if(k&1) ans=calc(ans,t);\n t=calc(t,t);\n k>>=1;\n }\n for(int i=0;i<n;i++) cout<<ans[i]<<endl;\n return 0;\n}" ]
F: Invariant Tree Problem Statement You have a permutation p_1, p_2, ... , p_N of integers from 1 to N. You also have vertices numbered 1 through N. Find the number of trees while satisfying the following condition. Here, two trees T and T' are different if and only if there is a pair of vertices where T has an edge between them but T’ does not have an edge between them. * For all integer pairs i, j (1\leq i < j \leq N), if there is an edge between vertices i and j, there is an edge between vertices p_i and p_j as well. Since this number can be extremely large, output the number modulo 998244353. Input N p_1 p_2 ... p_N Constraints * 1\leq N \leq 3 \times 10^5 * p_1, p_2, ... , p_N is a permutation of integers 1 through N. Output Output the number in a single line. Sample Input 1 4 2 1 4 3 Output for Sample Input 1 4 Let (u, v) denote that there is an edge between u and v. The following 4 ways can make a tree satisfying the condition. * (1, 2), (1, 3), (2, 4) * (1, 2), (1, 4), (2, 3) * (1, 3), (2, 4), (3, 4) * (1, 4), (2, 3), (3, 4) Sample Input 2 3 1 2 3 Output for Sample Input 2 3 Sample Input 3 3 2 3 1 Output for Sample Input 3 0 Sample Input 4 20 9 2 15 16 5 13 11 18 1 10 7 3 6 14 12 4 20 19 8 17 Output for Sample Input 4 98344960 Example Input 4 2 1 4 3 Output 4
[ "#include<bits/stdc++.h>\n\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntemplate <typename T> bool chkmax(T &x,T y){return x<y?x=y,true:false;}\ntemplate <typename T> bool chkmin(T &x,T y){return x>y?x=y,true:false;}\n\nint readint(){\n\tint x=0,f=1; char ch=getchar();\n\twhile(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}\n\twhile(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}\n\treturn x*f;\n}\n\nconst int cys=998244353;\nint n;\nll a[300005],fac[300005],inv[300005],hv[300005];\nbool vis[300005];\nvector<int> v;\n\nll qpow(ll x,ll p){\n\tll ret=1;\n\tfor(;p;p>>=1,x=x*x%cys) if(p&1) ret=ret*x%cys;\n\treturn ret;\n}\n\nint main(){\n\tn=readint();\n\tfac[0]=inv[0]=1;\n\tfor(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%cys;\n\tinv[n]=qpow(fac[n],cys-2);\n\tfor(int i=n-1;i>=1;i--) inv[i]=inv[i+1]*(i+1)%cys;\n\tfor(int i=1;i<=n;i++) a[i]=readint();\n\tfor(int i=1;i<=n;i++){\n\t\tif(vis[i]) continue;\n\t\tint cnt=0;\n\t\tfor(int u=i;!vis[u];u=a[u]) cnt++,vis[u]=1;\n\t\tv.pb(cnt);\n\t}\n\tsort(v.begin(),v.end());\n\tif(v[0]>2) return printf(\"0\\n\"),0;\n\tif(v[0]==1){\n\t\tll ans=1;\n\t\tfor(int i=0;i<v.size();){\n\t\t\tint num=v[i],cr=0;\n\t\t\twhile(v[i]==num) cr++,i++;\n\t\t\tif(num>1){\n\t\t\t\tll tmp=0;\n\t\t\t\tfor(int j=1;j<=cr;j++)\n\t\t\t\t\ttmp=(tmp+fac[cr-1]*inv[j-1]%cys*inv[cr-j]%cys*qpow(cr,cr-j)%cys*qpow(hv[num],j)%cys*qpow(num,cr-j))%cys;\n\t\t\t\tans=ans*tmp%cys;\n\t\t\t}\n\t\t\telse ans=cr==1?1:qpow(cr,cr-2);\n\t\t\tfor(int j=num<<1;j<=n;j+=num) hv[j]+=cr*num;\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\telse{\n\t\tll ans=1;\n\t\tfor(int i=0;i<v.size();){\n\t\t\tint num=v[i],cr=0;\n\t\t\twhile(v[i]==num) cr++,i++;\n\t\t\tif(num>2){\n\t\t\t\tll tmp=0;\n\t\t\t\tfor(int j=1;j<=cr;j++)\n\t\t\t\t\ttmp=(tmp+fac[cr-1]*inv[j-1]%cys*inv[cr-j]%cys*qpow(cr,cr-j)%cys*qpow(hv[num],j)%cys*qpow(num,cr-j))%cys;\n\t\t\t\tans=ans*tmp%cys;\n\t\t\t}\n\t\t\telse ans=qpow(cr,cr-1)*qpow(num,cr-1)%cys;\n\t\t\tfor(int j=num<<1;j<=n;j+=num) hv[j]+=cr*num;\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\ntypedef long long i64;\nconst int N=3e5+10,mod=998244353;\nint n,ans,p[N],cnt[N],vis[N];\nint length(int u){vis[u]=1;return vis[p[u]]?1:length(p[u])+1;}\ninline int fpow(int a,int b){int s=1;for(;b;b>>=1,a=(i64)a*a%mod)if(b&1)s=(i64)s*a%mod;return s;}\nint main(){\n\tscanf(\"%d\",&n);\n\tfor(int i=1;i<=n;i++)scanf(\"%d\",&p[i]);\n\tfor(int i=1;i<=n;i++)if(!vis[i])cnt[length(i)]++;\n\tif(!cnt[1]&&!cnt[2]){puts(\"0\"); return 0;}\n\tif(!cnt[1])for(int i=1;i<=n;i+=2)if(cnt[i]){puts(\"0\"); return 0;}\n\tfor(int i=1,j,w;i<=n;i++)if(cnt[i]){\n\t\tif(i==1)ans=cnt[i]==1?1:fpow(cnt[i],cnt[i]-2);\n\t\telse if(i==2&&!cnt[1])ans=(i64)fpow(cnt[i],cnt[i]-1)*fpow(i,cnt[i]-1)%mod;\n\t\telse{\n\t\t\tfor(w=0,j=1;j*j<=i;j++)if(!(i%j))w=(w+(i64)j*cnt[j])%mod;\n\t\t\tfor(j=2;j*j<i;j++)if(!(i%j))w=(w+(i64)(i/j)*cnt[i/j])%mod;\n\t\t\tans=(i64)ans*w%mod*fpow((w+(i64)i*cnt[i])%mod,cnt[i]-1)%mod;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n", "#include <bits/stdc++.h>\n#define ll long long\n#define maxn 300005 /*rem*/\n#define mod 998244353\n#define db double\n#define vi vector<int>\n#define pb push_back\n#define mp make_pair\n#define pi pair<int, int>\n#define fi first\n#define se second\nusing namespace std;\nll ksm(ll a, ll b) {\n if (!b) return 1;\n ll ns = ksm(a, b >> 1);\n ns = ns * ns % mod;\n if (b & 1) ns = ns * a % mod;\n return ns;\n}\nll tw[maxn];\nint p[maxn];\nvi cu;\nint vis[maxn];\nint cnt[maxn];\nll jc[maxn];\nll bjc[maxn];\nvi dv[maxn];\nll c(int a, int b) {\n\tif (a < b || b < 0) return 0;\n\treturn jc[a] * bjc[a - b] % mod * bjc[b] % mod; \n}\nint main() {\n\tjc[0] = bjc[0] = 1;\n\tfor (int i = 1; i < maxn; i++)\n\t\tjc[i] = jc[i - 1] * i % mod, \n\t\tbjc[i] = ksm(jc[i], mod - 2);\n\tfor (int i = 1; i < maxn; i++)\n\t\tfor (int j = 1; 1ll * j * i < maxn; j++)\n\t\t\tdv[j * i].pb(i);\n\ttw[1] = 1;\n\tfor (int i = 2; i < maxn; i++)\n\t\ttw[i] = ksm(i, i - 2);\n\tint n;\n\tcin >> n;\n\tll mt = 1;\n\tfor (int i = 1; i <= n; i++) scanf(\"%d\", &p[i]);\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (vis[i]) continue;\n\t\tint j = i;\n\t\tint cnt = 0;\n\t\twhile (1) {\n\t\t\tvis[j] = 1;\n\t\t\tcnt++;\n\t\t\tj = p[j];\n\t\t\tif (j == i) break; \n\t\t}\n\t\tcu.pb(cnt);\n\t}\n\tsort(cu.begin(), cu.end());\n\tif (cu[0] >= 3) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\telse {\n\t\tfor (auto v : cu)\n\t\t\tcnt[v]++;\n\t\tll ans = 1;\n\t\tint bg = cu[0];\n\t//\tfor (auto v : cu) cout << v << ' ';\n\t//\tcout << endl;\n\t\tfor (int i = 1; i < maxn; i++) {\n\t\t\tif (!cnt[i]) continue;\n\t\t\telse {\n\t\t\t\tif (i == bg) {\n\t\t\t\t\tif (i == 1) ans = ans * tw[cnt[1]] % mod;//, cout << ans << endl;\n\t\t\t\t\telse {\n\t\t\t\t\t\tans = tw[cnt[2]] * cnt[2] % mod * ksm(2, cnt[2] - 1) % mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tll tt = ksm(i, cnt[i]);\n\t\t\t\t\tll mt = 0;\n\t\t\t\t\tfor (auto q : dv[i]) {\n\t\t\t\t\t\tif (q == i) continue;\n\t\t\t\t\t\tmt = (mt + cnt[q] * ksm(i / q, mod - 2)) % mod;\n\t\t\t\t\t}\n\t\t\t\t\tint tid = cnt[i] + 1;\n\t\t\t\t\tll na = 0;\n\t\t\t\t\tfor (int s = 1; s <= cnt[i]; s++) {\n\t\t\t\t\t\tll pw = c(tid - 2, s - 1) * ksm(mt, s) % mod * ksm(tid - 1, tid - 2 - (s - 1)) % mod;\n\t\t\t\t\t//\tcout << s << ' ' << pw << endl;\n\t\t\t\t\t\tna = (na + pw) % mod;\n\t\t\t\t\t}\n\t\t\t\t\tna = na * tt % mod;\n\t\t\t\t\tans = ans * na % mod;\n\t\t\t//\t\tcout << i << ' ' << na << endl;\n\t\t\t\t} \n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}\n\n" ]
test UnionFind（バイナリ入力） Example Input Output
[ "#include <algorithm>\n#include <cassert>\n#include <cstdio>\n#include <iostream>\n#include <limits>\n#include <random>\n#include <utility>\n#include <vector>\n\nnamespace procon {\nclass UnionFind {\nprivate:\n struct nodeinfo {\n int par;\n int rank;\n nodeinfo(int par) : par(par), rank(0) {}\n };\n std::vector<nodeinfo> node;\n\npublic:\n UnionFind(int n) : node() {\n node.reserve(n);\n for (int i = 0; i < n; ++i) {\n node.push_back(nodeinfo(i));\n }\n }\n int root(int x) {\n if (node[x].par == x) {\n return x;\n }\n return node[x].par = root(node[x].par);\n }\n void unite(int x, int y) {\n x = root(x);\n y = root(y);\n if (x == y) {\n return;\n }\n if (node[x].rank < node[y].rank) {\n node[x].par = y;\n } else {\n node[y].par = x;\n if (node[x].rank == node[y].rank) {\n ++node[x].rank;\n }\n }\n }\n bool is_same_set(int x, int y) { return root(x) == root(y); }\n};\n}\n \nint main(void) {\n int size, n_query;\n std::cin.read((char *)&size, sizeof(int));\n std::cin.read((char *)&n_query, sizeof(int));\n\n std::vector<uint64_t> query(n_query);\n std::cin.read((char *)query.data(), sizeof(uint64_t) * n_query);\n\n const int mask = (1 << 30) - 1;\n\n uint64_t res = 123456789;\n procon::UnionFind uf(size);\n for (uint64_t q : query) {\n const int com = q >> 60;\n const int x = (q >> 30) & mask;\n const int y = (q >> 0) & mask;\n assert(0 <= x && x < size);\n assert(0 <= y && y < size);\n if (com) {\n res = res * 17 + (uf.is_same_set(x, y) ? 1 : 0);\n } else {\n uf.unite(x, y);\n }\n }\n std::cout << res << std::endl;\n return 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nsigned main(){\n vector<int> v(10);\n for(int i=0;i<10;i++) cin>>v[i];\n sort(v.rbegin(),v.rend());\n for(int i=0;i<3;i++) cout<<v[i]<<endl;\n return 0;\n}\n\n" ]
Examples Input 4 5 2 0 1 2 1 0 2 1 2 1 2 1 1 1 3 1 3 2 3 2 1 Output 6 Input Output
[ "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct SuccessiveShortestPath {\n struct Edge{ int to, cap, cost, rev; };\n int n, init;\n vector<vector<Edge>> g;\n vector<int> dist, pv, pe, h;\n\n SuccessiveShortestPath() {}\n SuccessiveShortestPath(int n, int INF = 1e9)\n : n(n), g(n), init(INF), dist(n), pv(n), pe(n) {}\n\n void addEdge(int u, int v, int cap, int cost) {\n int szU = g[u].size();\n int szV = g[v].size();\n g[u].push_back({v, cap, cost, szV});\n g[v].push_back({u, 0, -cost, szU - 1});\n }\n int dijkstra(int s, int t) {\n dist = vector<int>(n, init);\n using Node = pair<int, int>;\n priority_queue<Node, vector<Node>, greater<Node>> pq;\n pq.push({dist[s] = 0, s});\n\n while (!pq.empty()) {\n auto d = pq.top().first;\n auto u = pq.top().second;\n pq.pop();\n if (dist[u] < d) continue;\n for (int i = 0; i < g[u].size(); ++i) {\n Edge& e = g[u][i];\n int v = e.to;\n if (e.cap > 0 && dist[v] > dist[u] + e.cost + h[u] - h[v]) {\n dist[v] = dist[u] + e.cost + h[u] - h[v];\n pv[v] = u;\n pe[v] = i;\n pq.push({dist[v], v});\n }\n }\n }\n return dist[t];\n }\n int build(int s, int t, int f) {\n int res = 0;\n h = vector<int>(n, 0);\n while (f > 0) {\n if (dijkstra(s, t) == init) return -1;\n for (int i = 0; i < n; ++i) h[i] += dist[i];\n int flow = f;\n for (int u = t; u != s; u = pv[u]) {\n flow = min(flow, g[pv[u]][pe[u]].cap);\n }\n f -= flow;\n res += flow * h[t];\n for (int u = t; u != s; u = pv[u]) {\n Edge& e = g[pv[u]][pe[u]];\n e.cap -= flow;\n g[u][e.rev].cap += flow;\n }\n }\n return res;\n }\n};\n\nint main() {\n int n, m, f; cin >> n >> m >> f;\n SuccessiveShortestPath ssp(n);\n while (m--) {\n int u, v, c, d; cin >> u >> v >> c >> d;\n ssp.addEdge(u, v, c, d);\n }\n cout << ssp.build(0, n - 1, f) << endl;\n return 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nlong long INF = 1000000000000000;\nlong long primal_dual(vector<map<int, pair<long long, int>>> &E, int s, int t, long long F){\n\tint V = E.size();\n\tfor (int i = 0; i < V; i++){\n\t\tfor (auto edge : E[i]){\n\t\t\tif (!E[edge.first].count(i)){\n\t\t\t\tE[edge.first][i] = make_pair(0, -edge.second.second);\n\t\t\t}\n\t\t}\n\t}\n\tlong long ans = 0;\n\tvector<long long> h(V, 0);\n\twhile (F > 0){\n\t\tvector<long long> d(V, INF);\n\t\tvector<long long> m(V, INF);\n\t\tvector<int> prev(V, -1);\n\t\td[s] = 0;\n\t\tpriority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> Q;\n\t\tQ.push(make_pair(0, s));\n\t\twhile (!Q.empty()){\n\t\t\tlong long c = Q.top().first;\n\t\t\tint v = Q.top().second;\n\t\t\tQ.pop();\n\t\t\tif(d[v] >= c){\n\t\t\t\tfor (auto P : E[v]){\n\t\t\t\t\tint w = P.first;\n\t\t\t\t\tlong long cap = P.second.first;\n\t\t\t\t\tint cost = P.second.second;\n\t\t\t\t\tif (cap > 0 && d[w] > d[v] + cost + h[v] - h[w]){\n\t\t\t\t\t\td[w] = d[v] + cost + h[v] - h[w];\n\t\t\t\t\t\tprev[w] = v;\n\t\t\t\t\t\tm[w] = min(m[v], cap);\n\t\t\t\t\t\tQ.push(make_pair(d[w], w));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (d[t] == INF){\n\t\t\treturn -1;\n\t\t}\n\t\tfor (int i = 0; i < V; i++){\n\t\t\th[i] += d[i];\n\t\t}\n\t\tint f = min(m[t], F);\n\t\tint c = t;\n\t\twhile (c != s){\n\t\t\tE[prev[c]][c].first -= f;\n\t\t\tE[c][prev[c]].first += f;\n\t\t\tc = prev[c];\n\t\t}\n\t\tF -= f;\n\t\tans += f * h[t];\n\t}\n\treturn ans;\n}\nint main(){\n int N, M, F;\n cin >> N >> M >> F;\n vector<map<int, pair<long long , int>>> E(N);\n for (int i = 0; i < M; i++){\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n E[u][v] = make_pair(c, d);\n }\n cout << primal_dual(E, 0, N - 1, F) << endl;\n}\n", "#include <cstdio>\n#include <cstring>\n#include <string>\n#include <cmath>\n#include <cassert>\n#include <iostream>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <set>\n#include <map>\n#include <bitset>\nusing namespace std;\n\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define fi first\n#define se second\n\n#define INF 2147483600\n\ntemplate<typename T>\nclass MinCostFlow{\nprivate:\n struct edge{int to; T cap, cost; int rev;};\n using P = pair<int,int>;\n vector<vector<edge> > Graph;\n vector<int> prevv, preve;\n vector<T> h, d; // ??????????????£?????????????????¢\npublic:\n MinCostFlow(int v){\n // ????????°v??§?????????\n Graph.resize(v);\n prevv.resize(v);\n preve.resize(v);\n h.resize(v);\n d.resize(v);\n }\n T min_cost_flow(int s, int t, T f){\n T res = 0;\n fill(all(h), 0);\n while(f>0){\n priority_queue<P, vector<P>, greater<P>> pq;\n fill(all(d), INF);\n d[s] = 0;\n pq.push(mp(0,s));\n while(!pq.empty()){\n auto p = pq.top(); pq.pop();\n int v = p.se;\n if(d[v] < p.fi) continue;\n rep(i,Graph[v].size()){\n edge &e = Graph[v][i];\n if(e.cap > 0 && d[e.to] > d[v] + e.cost + h[v] - h[e.to]){\n d[e.to] = d[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n pq.push(mp(d[e.to], e.to));\n }\n }\n }\n if(d[t] == INF) return -1;\n rep(i,Graph.size()) h[i] += d[i];\n\n T nf = f;\n for(int v=t; v!=s; v = prevv[v]){\n nf = min(nf, Graph[prevv[v]][preve[v]].cap);\n }\n f -= nf;\n res += nf * h[t];\n for(int v=t; v!=s; v=prevv[v]){\n edge &e = Graph[prevv[v]][preve[v]];\n e.cap -= nf;\n Graph[v][e.rev].cap += nf;\n }\n }\n return res;\n }\n void add_edge(int from ,int to, T cap, T cost){\n Graph[from].pb(((edge){to, cap, cost, (int)Graph[to].size()}));\n Graph[to].pb(((edge){from, 0, -cost, (int)Graph[from].size()-1}));\n }\n};\n\nint main(){\n int v,e,f;\n cin>>v>>e>>f;\n MinCostFlow<int> flow(v);\n rep(i,e){\n int a,b,c,d;\n scanf(\"%d %d %d %d\", &a, &b, &c, &d);\n flow.add_edge(a, b, c, d);\n }\n\n cout<<flow.min_cost_flow(0, v-1, f)<<endl;\n\n return 0;\n}", "import java.util.*;\n\npublic class Main implements Runnable {\n\n private static int MOD = 1_000_000_007;\n\n public static void main(String[] args) {\n // Run with 32MB stack\n Thread thread = new Thread(null, new Main(), \"\", 32 * 1024 * 1024);\n thread.start();\n }\n\n @Override\n public void run() {\n final Scanner scanner = new Scanner(System.in);\n solve(scanner);\n }\n\n static void solve(Scanner scanner) {\n int V = scanner.nextInt();\n int E = scanner.nextInt();\n int F = scanner.nextInt();\n scanner.nextLine();\n\n MinCost minCost = new MinCost(V);\n for (int i = 0; i < E; i++) {\n int[] e = Arrays.stream(scanner.nextLine().split(\" \")).mapToInt(Integer::parseInt).toArray();\n minCost.addEdge(e[0], e[1], e[3], e[2]);\n }\n\n minCost.run(0, V - 1, F);\n if (minCost.totalFlow == F) {\n System.out.println(minCost.totalCost);\n } else {\n System.out.println(-1);\n }\n }\n\n}\n\nclass MinCost {\n private int size;\n private Map<Integer, Map<Integer, Edge>> edges;\n public long totalFlow;\n public long totalCost;\n\n public MinCost(int size) {\n this.size = size;\n edges = new HashMap<>();\n totalFlow = 0;\n totalCost = 0;\n }\n\n public void addEdge(int from, int to, int cost, int cap) {\n if (!edges.containsKey(from)) {\n edges.put(from, new HashMap<>());\n }\n edges.get(from).put(to, new Edge(from, to, cost, cap));\n\n if (!edges.containsKey(to)) {\n edges.put(to, new HashMap<>());\n }\n edges.get(to).put(from, new Edge(to, from, -cost, 0));\n }\n\n public void run(int s, int e, long flow) {\n List<Integer> path = findPath(s, e);\n while (!path.isEmpty()) {\n long maxFlow = Integer.MAX_VALUE;\n for (int i = 0; i < path.size() - 1; i++) {\n maxFlow = Math.min(maxFlow, edges.get(path.get(i)).get(path.get(i + 1)).cap);\n }\n if (totalFlow + maxFlow >= flow) {\n maxFlow = flow - totalFlow;\n }\n totalFlow += maxFlow;\n\n long costSum = 0;\n for (int i = 0; i < path.size() - 1; i++) {\n costSum += maxFlow * edges.get(path.get(i)).get(path.get(i + 1)).cost;\n }\n for (int i = 0; i < path.size() - 1; i++) {\n edges.get(path.get(i)).get(path.get(i + 1)).cap -= maxFlow;\n edges.get(path.get(i + 1)).get(path.get(i)).cap += maxFlow;\n }\n totalCost = totalCost + costSum;\n if (totalFlow == flow) {\n break;\n }\n path = findPath(s, e);\n }\n }\n\n private List<Integer> findPath(int s, int e) {\n BellmanFord bellmanFord = new BellmanFord(size);\n edges.forEach((from, toMap) ->\n toMap.forEach((to, edge) -> {\n if (edge.cap > 0)\n bellmanFord.addEdge(edge.from, edge.to, edge.cost);\n }));\n bellmanFord.run(s);\n if (bellmanFord.dist[e] == Long.MAX_VALUE / 2) {\n return Collections.emptyList();\n }\n List<Integer> nodes = new ArrayList<>();\n int curr = e;\n while (curr != s) {\n nodes.add(curr);\n curr = bellmanFord.from[curr];\n }\n nodes.add(curr);\n Collections.reverse(nodes);\n return nodes;\n }\n\n}\n\nclass BellmanFord {\n\n private int size;\n public long[] dist;\n public int[] from;\n public List<Edge> edges;\n\n public BellmanFord(int size) {\n this.size = size;\n dist = new long[size];\n Arrays.fill(dist, Long.MAX_VALUE / 2);\n from = new int[size];\n Arrays.fill(from, -1);\n edges = new ArrayList<>();\n }\n\n public void addEdge(int from, int to, int cost) {\n edges.add(new Edge(from, to, cost));\n }\n\n public void run(int start) {\n dist[start] = 0;\n for (int i = 0; i < size; i++) {\n boolean updated = false;\n for (Edge e : edges) {\n if (dist[e.from] != Long.MAX_VALUE / 2\n && dist[e.to] > dist[e.from] + e.cost) {\n dist[e.to] = dist[e.from] + e.cost;\n from[e.to] = e.from;\n updated = true;\n }\n }\n // found loops. update all nodes in loops with Long.MIN_VALUE\n if (i == size - 1 && updated) {\n for (int j = 0; j < size; j++) {\n for (Edge e : edges) {\n if (dist[e.from] == Long.MIN_VALUE || dist[e.to] > dist[e.from] + e.cost) {\n dist[e.to] = Long.MIN_VALUE;\n }\n }\n }\n }\n }\n }\n}\n\nclass Edge {\n public int from;\n public int to;\n public int cost;\n public int cap;\n\n public Edge(int from, int to) {\n this.from = from;\n this.to = to;\n this.cost = 1;\n this.cap = 1;\n }\n\n public Edge(int from, int to, int cost) {\n this.from = from;\n this.to = to;\n this.cost = cost;\n this.cap = 1;\n }\n\n public Edge(int from, int to, int cost, int cap) {\n this.from = from;\n this.to = to;\n this.cost = cost;\n this.cap = cap;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n Edge edge = (Edge) o;\n return from == edge.from &&\n to == edge.to &&\n cost == edge.cost &&\n cap == edge.cap;\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(from, to, cost, cap);\n }\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T, typename U>\nstruct min_cost_flow_graph_bellman_ford {\n\t\n\tstruct edge {\n\t\tint from, to;\n\t\tT cap, f;\n\t\tU cost;\n\t};\n\t\n\tvector<edge> edges;\n\tvector<vector<int>> g;\n\tint n, st, fin;\n\tT required_flow, flow;\n\tU cost;\n\t\n\tmin_cost_flow_graph_bellman_ford(int n, int st, int fin, T required_flow)\n\t\t: n(n), st(st), fin(fin), required_flow(required_flow) {\n\t\t\tassert(0 <= st && st < n && 0 <= fin && fin < n && st != fin);\n\t\t\tg.resize(n);\n\t\t\tflow = 0;\n\t\t\tcost = 0;\n\t}\n\t\n\tvoid clear_flow() {\n\t\tfor (const edge &e : edges) {\n\t\t\te.f = 0;\n\t\t}\n\t\tflow = 0;\n\t\tcost = 0;\n\t}\n\t\n\tvoid add(int from, int to, T cap = 1, T rev_cap = 0, U cost = 1) {\n\t\tassert(0 <= from && from < n && 0 <= to && to < n);\n\t\tg[from].emplace_back(edges.size());\n\t\tedges.push_back({from, to, cap, 0, cost});\n\t\tg[to].emplace_back(edges.size());\n\t\tedges.push_back({to, from, rev_cap, 0, -cost});\n\t}\n\t\n\tU min_cost_flow() {\n\t\twhile (flow < required_flow) {\n\t\t\tvector<int> preve(n);\n\t\t\tvector<U> dist(n, numeric_limits<U>::max() / 2);\n\t\t\tdist[st] = 0;\n\t\t\tfor (bool update = true; update; ) {\n\t\t\t\tupdate = false;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tfor (int id : g[i]) {\n\t\t\t\t\t\tconst edge &e = edges[id];\n\t\t\t\t\t\tif (0 < e.cap - e.f && dist[e.from] + e.cost < dist[e.to]) {\n\t\t\t\t\t\t\tdist[e.to] = dist[e.from] + e.cost;\n\t\t\t\t\t\t\tpreve[e.to] = id;\n\t\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[fin] == numeric_limits<U>::max() / 2) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tT d = required_flow - flow;\n\t\t\tfor (int i = fin; i != st; i = edges[preve[i]].from) {\n\t\t\t\td = min(d, edges[preve[i]].cap - edges[preve[i]].f);\n\t\t\t}\n\t\t\tflow += d;\n\t\t\tcost += d * dist[fin];\n\t\t\tfor (int i = fin; i != st; i = edges[preve[i]].from) {\n\t\t\t\tedges[preve[i]].f += d;\n\t\t\t\tedges[preve[i] ^ 1].f -= d;\n\t\t\t}\n\t\t}\n\t\treturn cost;\n\t}\n};\n\nint main() {\n\tint n, m, f;\n\tcin >> n >> m >> f;\n\tmin_cost_flow_graph_bellman_ford<int, int> g(n, 0, n - 1, f);\n\tfor (int i = 0; i < m; i++) {\n\t\tint from, to, cap, cost;\n\t\tcin >> from >> to >> cap >> cost;\n\t\tg.add(from, to, cap, 0, cost);\n\t}\n\tcout << g.min_cost_flow() << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nint v, e;\nvector<pair<int, int> > adj[110], revadj[110];\nint capacity[1010], cost[1010], flowingthrough[1010], dis[110], pre[110], preedge[110], endofedge[1010];\nvoid bellmanford()\n{\n\tfill_n(dis, v, 1e9);\n\tdis[0] = 0;\n\tfor (int f = 0; f < v; f++)\n\t{\n\t\tfor (int i = 0; i < v; i++)\n\t\t{\n\t\t\tfor (auto e : adj[i])\n\t\t\t{\n\t\t\t\tif (flowingthrough[e.second] != capacity[e.second])\n\t\t\t\t{\n\t\t\t\t\tif (dis[e.first] > dis[i] + cost[e.second])\n\t\t\t\t\t{\n\t\t\t\t\t\tdis[e.first] = dis[i] + cost[e.second];\n\t\t\t\t\t\tpre[e.first] = i;\n\t\t\t\t\t\tpreedge[e.first] = e.second;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (auto e : revadj[i])\n\t\t\t{\n\t\t\t\tif (flowingthrough[e.second])\n\t\t\t\t{\n\t\t\t\t\tif (dis[e.first] > dis[i] - cost[e.second])\n\t\t\t\t\t{\n\t\t\t\t\t\tdis[e.first] = dis[i] - cost[e.second];\n\t\t\t\t\t\tpre[e.first] = i;\n\t\t\t\t\t\tpreedge[e.first] = e.second;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\npair<int, int> mincostmaxflow()\n{\n\tint ans = 0;\n\tint totalcost = 0;\n\twhile (1)\n\t{\n\t\tbellmanford();\n\t\tif (dis[v-1] == 1e9) break;\n\t\tans++;\n\t\t// Augment path\n\t\tint a = v-1;\n\t\twhile (a)\n\t\t{\n\t\t//\tprintf(\"%d \", a);\n\t\t\tint e = preedge[a];\n\t\t\tif (endofedge[e] == a) flowingthrough[e]++, totalcost += cost[e];\n\t\t\telse flowingthrough[e]--, totalcost -= cost[e];\n\t\t\ta = pre[a];\n\t\t}\n\t\t//printf(\"%d\\n\", a);\n\t}\n\treturn { ans, totalcost };\n}\nint f;\nint main()\n{\n\tscanf(\"%d%d%d\", &v, &e, &f);\n\tfor (int i = 0; i < e; i++)\n\t{\n\t\tint a, b;\n\t\tscanf(\"%d%d%d%d\", &a, &b, &capacity[i], &cost[i]);\n\t\tassert(a != b);\n\t\tendofedge[i] = b;\n\t\tadj[a].emplace_back(b, i);\n\t\trevadj[b].emplace_back(a, i);\n\t}\n\tadj[v-1].emplace_back(v, e);\n\tcost[e] = 0;\n\tendofedge[e] = v;\n\tcapacity[e] = f;\n\tv++;\n\tauto ans = mincostmaxflow();\n//\tprintf(\"%d %d\\n\", ans.first, ans.second);\n\tif (ans.first != f) printf(\"-1\\n\");\n\telse printf(\"%d\\n\", ans.second);\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing uint = unsigned int;\nusing lint = long long int;\nusing ulint = unsigned long long int;\ntemplate<class T = int> using V = vector<T>;\ntemplate<class T = int> using VV = V< V<T> >;\ntemplate<class T, class U> void assign(V<T>& v, int n, const U& a) { v.assign(n, a); }\ntemplate<class T, class... Args> void assign(V<T>& v, int n, const Args&... args) { v.resize(n); for (auto&& e : v) assign(e, args...); }\n\n\ntemplate<class T> struct PrimalDual {\n struct Edge {\n int to, rev;\n T cap, cost;\n Edge(int to, int rev, T cap, T cost) : to(to), rev(rev), cap(cap), cost(cost) {}\n };\n\n const int n;\n\n PrimalDual(int n) : n(n), g(n), pot(n), dist(n), pv(n), pe(n) {\n assert(n >= 2);\n }\n\n void add_edge(int from, int to, T cap, T cost) {\n assert(0 <= from and from < n);\n assert(0 <= to and to < n);\n assert(from != to);\n assert(cap >= 0);\n assert(cost >= 0);\n g[from].emplace_back(to, g[to].size(), cap, cost);\n g[to].emplace_back(from, g[from].size() - 1, 0, -cost);\n }\n\n T min_cost_flow(int s, int t, T f) {\n assert(0 <= s and s < n);\n assert(0 <= t and t < n);\n assert(s != t);\n T res = 0;\n fill(begin(pot), end(pot), 0);\n while (f > 0) {\n dijkstra(s);\n if (dist[t] == inf) return -1;\n for (int v = 0; v < n; ++v) pot[v] += dist[v];\n T d = f;\n for (int v = t; v != s; v = pv[v]) {\n d = min(d, g[pv[v]][pe[v]].cap);\n }\n f -= d;\n res += d * pot[t];\n for (int v = t; v != s; v = pv[v]) {\n Edge& e = g[pv[v]][pe[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n return res;\n }\n\nprivate:\n static constexpr T inf = numeric_limits<T>::max();\n VV<Edge> g;\n V<T> pot, dist;\n V<> pv, pe;\n\n void dijkstra(int s) {\n using P = pair<T, int>;\n priority_queue< P, V<P>, greater<P> > pque;\n fill(begin(dist), end(dist), inf);\n pque.emplace(dist[s] = 0, s);\n while (!pque.empty()) {\n T d; int v;\n tie(d, v) = pque.top(); pque.pop();\n if (d > dist[v]) continue;\n for (int i = 0; i < g[v].size(); ++i) {\n const Edge& e = g[v][i];\n if (e.cap <= 0 or dist[e.to] <= dist[v] + e.cost - (pot[e.to] - pot[v])) continue;\n pv[e.to] = v;\n pe[e.to] = i;\n pque.emplace(dist[e.to] = dist[v] + e.cost - (pot[e.to] - pot[v]), e.to);\n }\n }\n }\n};\n\nint main() {\n cin.tie(nullptr); ios_base::sync_with_stdio(false);\n int n, m, f; cin >> n >> m >> f;\n PrimalDual<int> pd(n);\n for (int i = 0; i < m; ++i) {\n int from, to, cap, cost; cin >> from >> to >> cap >> cost;\n pd.add_edge(from, to, cap, cost);\n }\n cout << pd.min_cost_flow(0, n - 1, f) << '\\n';\n}\n", "#include<iostream>\n#include<set>\n#include<vector>\n#include<queue>\n#include<map>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\n\n#define MAX_V 100\nstruct edge { int to, cap, cost,rev; };\n\nvector<edge> G[MAX_V];\nvector<int> h(MAX_V);\t//??????????????£???\nvector<int> dist(MAX_V);// ???????????¢\nint prevv[MAX_V], preve[MAX_V];// ??´??????????????¨???\n\n// from??????to??????????????????cap????????????cost????????????????????????????????????\nvoid add_edge(int from, int to, int cap, int cost) {\n\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\n\n//?????????????????????????????????????????´????????????\nvoid shortest_path(int s,vector<int> &d){\n\tint v = d.size();\n\trep(i,d.size())d[i]=INF;\n\td[s]=0;\n\trep(loop,v){\n\t\trep(i,v){\n\t\t\trep(j,G[i].size()){\n\t\t\t\tedge e = G[i][j];\n\t\t\t\tif(!e.cap)continue;\n\t\t\t\tif(d[i]!=INF && d[e.to] > d[i]+e.cost){\n\t\t\t\t\td[e.to] = d[i]+e.cost;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// s??????t????????????f???????°??????¨???????±???????\n// ??????????????´??????-1?????????\nint min_cost_flow(int s, int t, int f) {\n\tint res = 0;\n\tshortest_path(s, h);\n\t\n\twhile (f > 0) {\n\t\t// ?????????????????????????????¨??????h?????´??°??????\n\t\tpriority_queue<pii, vector<pii>, greater<pii> > que;\n\t\trep(i,dist.size())dist[i]=INF;\n\t\tdist[s] = 0;\n\t\tque.push(pii(0, s));\n\t\twhile (!que.empty()) {\n\t\t\tpii p = que.top(); que.pop();\n\t\t\tint v = p.second;\n\t\t\tif (dist[v] < p.first) continue;\n\t\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\t\tedge &e = G[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to]; prevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tque.push(pii(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) return -1;\t//????????\\???????????????\n\t\t\n\t\tfor (int v = 0; v < h.size(); v++) h[v] += dist[v];\n\t\t\n\t\t\n\t\t// s-t????????????????????£??????????????????\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d * h[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]]; e.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}int main(){\n\tint vv,e,f;\n\tcin>>vv>>e>>f;\n\trep(i,e){\n\t\tint u,v,c,d;\n\t\tcin>>u>>v>>c>>d;\n\t\tadd_edge(u, v, c, d);\n\t}\n\tcout<<min_cost_flow(0, vv-1, f)<<endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = int64_t;\nusing vi = vector<i64>;\nusing vvi = vector<vi>;\n\ntemplate<typename flow_t = int, typename cost_t = int>\nstruct PrimalDual {\n const cost_t INF;\n struct edge {\n int to;\n flow_t cap;\n cost_t cost;\n int rev;\n bool isrev;\n };\n vector<vector<edge>> graph;\n vector<cost_t> potential, min_cost;\n vector<int> prevv, preve;\n\n PrimalDual(int v) : graph(v), INF(numeric_limits<cost_t>::max()) {}\n void add_edge(int from, int to, flow_t cap, cost_t cost) {\n graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size(), false});\n graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1, true});\n }\n\n cost_t min_cost_flow(int s, int t, flow_t f) {\n int V = (int) graph.size();\n cost_t ret = 0;\n priority_queue<pair<cost_t, int>, vector<pair<cost_t, int>>, greater<pair<cost_t, int>>> que;\n potential.assign(V, 0);\n prevv.assign(V, -1);\n preve.assign(V, -1);\n\n while (f > 0) {\n min_cost.assign(V, INF);\n que.emplace(0, s);\n min_cost[s] = 0;\n while (!que.empty()) {\n pair<cost_t, int> p = que.top();\n que.pop();\n if (min_cost[p.second] < p.first) continue;\n for (int i = 0; i < graph[p.second].size(); i++) {\n edge& e = graph[p.second][i];\n cost_t next_cost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\n if (e.cap > 0 && min_cost[e.to] > next_cost) {\n min_cost[e.to] = next_cost;\n prevv[e.to] = p.second, preve[e.to] = i;\n que.emplace(min_cost[e.to], e.to);\n }\n }\n }\n if (min_cost[t] == INF) return -1;\n for (int v = 0; v < V; v++) {\n potential[v] += min_cost[v];\n }\n flow_t addflow = f;\n for (int v = t; v != s; v = prevv[v]) {\n addflow = min(addflow, graph[prevv[v]][preve[v]].cap);\n }\n f -= addflow;\n ret += addflow * potential[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge& e = graph[prevv[v]][preve[v]];\n e.cap -= addflow;\n graph[v][e.rev].cap += addflow;\n }\n }\n return ret;\n }\n};\n\nint main() {\n int V, E, F;\n scanf(\"%d %d %d\", &V, &E, &F);\n PrimalDual<> g(V);\n for(int i = 0; i < E; i++) {\n int a, b, c, d;\n scanf(\"%d %d %d %d\", &a, &b, &c, &d);\n g.add_edge(a, b, c, d);\n }\n printf(\"%d\\n\", g.min_cost_flow(0, V - 1, F));\n}\n", "#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nstruct edge { \n ll to;//行き先の頂点\n ll cap;//辺の容量\n ll cost;//１フローあたりのコスト\n ll rev;//逆辺のインデックス(G[e.to][e.rev]で逆辺にアクセスできる。)\n};\n\n#define MAX_V 1000\n#define INF (1e9)\n\nll V;//頂点数 ここに頂点数をセットするのを忘れないように。\nvector<edge> G[MAX_V];\nll h[MAX_V]; //ポテンシャル\nll dist[MAX_V];//sから各頂点への最短距離\nll prevv[MAX_V],preve[MAX_V]; // 直前の頂点と辺\n\nvoid add_edge(ll from,ll to,ll cap,ll cost) {\n G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});//辺の追加\n G[to].push_back((edge){from,0,-cost,(ll)G[from].size() - 1});//辺の逆辺\n}\n\n// 最小費用流を求める(sからt)\n// 流せない場合はINFをかえす。\n\nll min_cost_flow (ll s,ll t,ll f) {\n ll ret = 0;\n fill(h,h + V,0); // hを初期化 h_-1(v)=0とする。\n\n //f_0の残余ネットワークはもとのグラフ\n\n while(f > 0) {\n //現在f_iの残余ネットワークにおけるs-v最短路h_iを求める。\n //蟻本よりポテンシャルとしてh_i-1を使っても良い\n priority_queue<P,vector<P>,greater<P> > que;\n fill(dist,dist + V,INF);\n dist[s] = 0;\n que.push(P(0,s));\n while(!que.empty()) {\n P p = que.top(); que.pop();\n ll v = p.second;//頂点番号\n if(dist[v] < p.first) continue;//すでに最小値が求まっていた。\n rep(i,G[v].size()) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to],e.to));\n } \n }\n }\n\n if(dist[t] == INF) {\n //正のフローを流せるs-t道がなかった\n return -1;\n }\n rep(v,V) h[v] += dist[v];//INFのオーバーフローに注意\n //h_i(v) = (上で求まった最短距離)+h_i-1(v)-h_i-1(s)\n //で今、負の閉路が無いのでh_i-1(s)=0となるのでこのような式となる。\n\n //続いてf_i+1の残余ネットワークを求めていく。\n //f_i残余ネットワークにおけるs-t間最短路に沿って目一杯流す(上で求めたh_iよりわかる)\n ll d = f;//新たに流すフローの量を求める。\n for(ll v = t;v != s;v = prevv[v]) {//t側から更新していく\n d = min(d,G[prevv[v]][preve[v]].cap);//パスの容量を求めている\n }\n f -= d;\n ret += d * h[t];//総費用の更新\n //h_i(t)はf_i残余ネットワークにおけるs-t間最短距離\n for(ll v = t;v != s;v = prevv[v]) {//残余ネットワークの更新\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return ret;\n}\n\nll E,F;\n\nint main() {\n cin >> V >> E >> F;\n rep(i,E) {\n ll u,v,c,d;\n cin >> u >> v >> c >> d;\n add_edge(u,v,c,d);\n }\n cout << min_cost_flow(0,V-1,F) << endl;;\n return 0;\n \n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n//BEGIN CUT HERE\nstruct PrimalDual{\n const int INF = 1<<28;\n typedef pair<int,int> P;\n struct edge{\n int to,cap,cost,rev;\n edge(){}\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n };\n\n int n;\n vector<vector<edge> > G;\n vector<int> h,dist,prevv,preve;\n\n PrimalDual(){}\n PrimalDual(int sz):n(sz),G(sz),h(sz),dist(sz),prevv(sz),preve(sz){}\n \n void add_edge(int from,int to,int cap,int cost){\n G[from].push_back(edge(to,cap,cost,G[to].size()));\n G[to].push_back(edge(from,0,-cost,G[from].size()-1));\n }\n\n int min_cost_flow(int s,int t,int f){\n int res=0;\n fill(h.begin(),h.end(),0);\n while(f>0){\n priority_queue<P,vector<P>,greater<P> > que;\n fill(dist.begin(),dist.end(),INF);\n dist[s]=0;\n que.push(P(0,s));\n while(!que.empty()){\n\tP p=que.top();que.pop();\n\tint v=p.second;\n\tif(dist[v]<p.first) continue;\n\tfor(int i=0;i<(int)G[v].size();i++){\n\t edge &e=G[v][i];\n\t if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n\t dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\t prevv[e.to]=v;\n\t preve[e.to]=i;\n\t que.push(P(dist[e.to],e.to));\n\t }\n\t}\n }\n if(dist[t]==INF){\n\treturn -1;\n }\n for(int v=0;v<n;v++) h[v]+=dist[v];\n\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n\td=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n\tedge &e=G[prevv[v]][preve[v]];\n\te.cap-=d;\n\tG[v][e.rev].cap+=d;\n }\n }\n return res;\n }\n};\n//END CUT HERE\n\nint main(){\n int v,e,f;\n cin>>v>>e>>f;\n PrimalDual pd(v);\n for(int i=0;i<e;i++){\n int u,v,c,d;\n cin>>u>>v>>c>>d;\n pd.add_edge(u,v,c,d);\n }\n cout<<pd.min_cost_flow(0,v-1,f)<<endl;\n return 0;\n}\n/*\nverified on 2017/06/29\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B&lang=jp\n*/", "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable{\n private ArrayList<ArrayList<Integer>> graph;\n private Edge[] edges;\n public static void main(String[] args) throws Exception {\n new Thread(null, new Main(), \"bridge\", 16 * 1024 * 1024).start();\n }\n\n @Override\n public void run() {\n try {\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n private void solve() throws Exception{\n FastScanner scanner = new FastScanner(System.in);\n\n int V = scanner.nextInt();\n int E = scanner.nextInt();\n int F = scanner.nextInt();\n\n graph = new ArrayList<>(V);\n edges = new Edge[E * 2];\n for(int i = 0; i < V; ++i){\n graph.add(new ArrayList<Integer>());\n }\n\n int edgeSize = 0;\n for(int i = 0; i < E; ++i){\n int u = scanner.nextInt();\n int v = scanner.nextInt();\n int cap = scanner.nextInt();\n int cost = scanner.nextInt();\n\n edges[edgeSize++] = new Edge(v, 0, cap, cost);\n edges[edgeSize++] = new Edge(u, 0, 0, -cost);\n graph.get(u).add(edgeSize - 2);\n graph.get(v).add(edgeSize - 1);\n }\n\n costOfMaxFlow(F, 0, V - 1);\n }\n\n private void costOfMaxFlow(int F, int s, int t){\n int V = graph.size();\n int[] dist = new int[V];\n int[] curFlow = new int[V];\n int[] prevNode = new int[V];\n int[] prevEdge = new int[V];\n\n int totalFlow = 0;\n int totalCost = 0;\n\n while(totalFlow < F){\n BellmanFord(s, dist, prevNode, prevEdge, curFlow);\n if(dist[t] == Integer.MAX_VALUE){\n break;\n }\n\n int pathFlow = Math.min(curFlow[t], F - totalFlow);\n totalFlow += pathFlow;\n\n for(int v = t; v != s; v = prevNode[v]){\n Edge edge = edges[prevEdge[v]];\n totalCost += edge.cost * pathFlow;\n\n edge.flow += pathFlow;\n edges[prevEdge[v] ^ 1].flow -= pathFlow;\n }\n }\n\n if(totalFlow < F){\n System.out.println(\"-1\");\n }\n else{\n System.out.println(totalCost);\n }\n }\n\n private void BellmanFord(int s, int[] dist, int[] prevNode, int[] prevEdge, int[] curFlow) {\n Arrays.fill(dist, Integer.MAX_VALUE);\n dist[s] = 0;\n curFlow[s] = Integer.MAX_VALUE;\n prevNode[s] = -1;\n prevEdge[s] = -1;\n\n int V = dist.length;\n boolean[] inqueue = new boolean[V];\n int[] q = new int[V];\n int qt = 0;\n q[qt++] = s;\n for (int qh = 0; (qh - qt) % V != 0; qh++) {\n int u = q[qh % V];\n inqueue[u] = false;\n for (int edgeIndex : graph.get(u)) {\n Edge edge = edges[edgeIndex];\n\n if (edge.flow >= edge.cap) {\n continue;\n }\n\n if (dist[edge.v] > dist[u] + edge.cost) {\n dist[edge.v] = dist[u] + edge.cost;\n prevNode[edge.v] = u;\n prevEdge[edge.v] = edgeIndex;\n curFlow[edge.v] = Math.min(curFlow[u], edge.cap - edge.flow);\n\n if(!inqueue[edge.v]){\n inqueue[edge.v] = true;\n q[qt++ % V] = edge.v;\n }\n }\n }\n\n }\n }\n\n static class Edge{\n int v;\n int flow;\n int cap;\n int cost;\n\n public Edge(int v, int flow, int cap, int cost){\n this.v = v;\n this.flow = flow;\n this.cap = cap;\n this.cost = cost;\n }\n }\n\n static class FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024 * 8];\n private int ptr = 0;\n private int buflen = 0;\n\n public FastScanner(InputStream in){\n this.in = in;\n }\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n public boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))\nusing ll = long long;\nusing P = pair<int, int>;\nusing namespace std;\n\nconst double EPS = 1e-9;\nconst int MOD = 1e9+7;\nconst int INF = 2e5;\nconst double PI = acos(-1.0);\n\nusing namespace std;\n\nstruct MinCostFlow {\n struct edge {\n int to;\n int cap;\n int cost;\n int rev;\n bool is_rev;\n };\n const int INF;\n vector<vector<edge>> G;\n\n MinCostFlow(int n, int inf) : G(n), INF(inf) {\n ;\n }\n\n void add_edge(int from, int to, int cap, int cost) {\n G[from].push_back((edge){to, cap, cost, (int)G[to].size(), false});\n G[to].push_back((edge){from, 0, -cost, (int)G[from].size()-1, true});\n }\n\n int minCostFlow(int s, int t, int f) {\n const int N = G.size();\n int cost = 0;\n vector<int> prev_v(N, -1);\n vector<int> prev_e(N, -1);\n while (f > 0) {\n vector<int> dist(N, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n for (int v=0; v<N; ++v) {\n if (dist[v] == INF) continue;\n for (int i=0; i<G[v].size(); ++i) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prev_v[e.to] = v;\n prev_e[e.to] = i;\n update = true;\n }\n }\n }\n }\n if (dist[t] == INF) {\n return -1;\n }\n int d = f;\n for (int v=t; v!=s; v=prev_v[v]) {\n d = min(d, G[prev_v[v]][prev_e[v]].cap);\n }\n f -= d;\n cost += d * dist[t];\n for (int v=t;v!=s;v=prev_v[v]) {\n edge &e = G[prev_v[v]][prev_e[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return cost;\n }\n};\n\nint main() {\n int V, E, F;\n cin >> V >> E >> F;\n MinCostFlow mcf(V, INF);\n rep(i, E) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n mcf.add_edge(u, v, c, d);\n }\n cout << mcf.minCostFlow(0, V-1, F) << endl;\n}\n\n", "#include <iostream>\n#include <vector>\n#include <numeric>\n#include <queue>\n#include <algorithm>\n#include <utility>\n#include <functional>\nusing namespace std;\n\nconst int MAX_V = 100010;\nusing Flow = int;\nconst auto inf = numeric_limits<Flow>::max() / 8;\nstruct Edge {\n int dst;\n Flow cap, cap_orig;\n Flow cost;\n int revEdge; bool isRev;\n Edge(int dst, Flow cap, Flow cost, int revEdge, bool isRev)\n :dst(dst), cap(cap), cap_orig(cap), cost(cost), revEdge(revEdge), isRev(isRev) {\n }\n};\nstruct PrimalDual {\n int n;\n vector<vector<Edge> > g;\n PrimalDual(int n_) : n(n_), g(vector<vector<Edge> >(n_)) {}\n void addEdge(int src, int dst, Flow cap, Flow cost) { // ?????????\n g[src].emplace_back(dst, cap, cost, g[dst].size(), false);\n g[dst].emplace_back(src, 0, -cost, g[src].size() - 1, true);\n }\n Flow solve(int s, int t, int f) {\n Flow res = 0;\n vector<Flow> h(g.size()), dist(g.size());\n vector<int> prevv(g.size()), preve(g.size());\n while (f > 0) {\n using State = pair<Flow, int>;\n priority_queue<State, vector<State>, greater<State> > q;\n fill(dist.begin(), dist.end(), inf);\n dist[s] = 0;\n q.emplace(0, s);\n while (q.size()) {\n State p = q.top(); q.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for(int i = 0; i < (int)g[v].size(); ++i){\n Edge &e = g[v][i];\n if (e.cap > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst]) {\n dist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];\n prevv[e.dst] = v;\n preve[e.dst] = i;\n q.emplace(dist[e.dst], e.dst);\n }\n }\n }\n if (dist[t] == inf) {\n return -1;\n }\n for (int i = 0; i < n; ++i) {\n h[i] += dist[i];\n }\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, g[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.revEdge].cap += d;\n }\n }\n return res;\n }\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n int n, m, f;\n cin >> n >> m >> f;\n PrimalDual pd(n);\n for (int i = 0; i < m; i++) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n pd.addEdge(u, v, c, d);\n }\n cout << pd.solve(0, n - 1, f) << endl;\n}", "#include <iostream>\n#include <vector>\n#include <queue>\n#include <limits>\nusing namespace std;\n\ntemplate <typename T>\nclass MinCostFlow\n{\npublic:\n MinCostFlow(int n) : n(n), capacity(n, vector<T>(n)), cost(n, vector<T>(n)), prev(n) {}\n\n void add_edge(int src, int dst, T cap, T c)\n {\n capacity[src][dst] = cap;\n capacity[dst][src] = 0;\n cost[src][dst] = c;\n cost[dst][src] = -c;\n }\n\n T min_cost_flow(int s, int t, T f)\n {\n T res = 0;\n h.assign(n, 0);\n while (f > 0)\n {\n if (!dijkstra(s, t))\n return -1;\n for (int i = 0; i < n; ++i)\n h[i] += dist[i];\n\n T d = f;\n for (int v = t; v != s; v = prev[v])\n d = min(d, capacity[prev[v]][v]);\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prev[v])\n {\n capacity[prev[v]][v] -= d;\n capacity[v][prev[v]] += d;\n }\n }\n return res;\n }\n\nprivate:\n int n;\n T inf = numeric_limits<T>::max();\n vector<vector<T>> capacity, cost;\n vector<T> dist, h, prev;\n\n bool dijkstra(int s, int t)\n {\n dist.assign(n, inf);\n dist[s] = 0;\n priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;\n pq.emplace(0, s);\n while (!pq.empty())\n {\n int c = pq.top().first;\n int v = pq.top().second;\n pq.pop();\n if (dist[v] < c)\n continue;\n for (int nv = 0; nv < n; ++nv)\n {\n if (capacity[v][nv] > 0 && dist[nv] > dist[v] + cost[v][nv] + h[v] - h[nv])\n {\n dist[nv] = dist[v] + cost[v][nv] + h[v] - h[nv];\n prev[nv] = v;\n pq.emplace(dist[nv], nv);\n }\n }\n }\n return dist[t] != inf;\n }\n};\n\nint main()\n{\n int V, E, F, u, v, c, d;\n cin >> V >> E >> F;\n MinCostFlow<int> mcf(V + 1);\n for (int i = 0; i < E; ++i)\n {\n cin >> u >> v >> c >> d;\n mcf.add_edge(u, v, c, d);\n }\n cout << mcf.min_cost_flow(0, V - 1, F) << endl;\n return 0;\n}\n", "#include <cstdio>\n\n#include <vector>\n#include <queue>\n#include <tuple>\nint v, e;\n\nstruct Edge {\n Edge() {}\n Edge(int from, int to, int capacity, int cost, int rev) : from(from), to(to), capacity(capacity), cost(cost), rev(rev) {}\n int from, to;\n int capacity;\n int cost;\n int rev;\n};\n\nstd::vector<Edge> edges[128];\n\nvoid addEdge(int from, int to, int capacity, int cost) {\n int n1 = edges[from].size();\n int n2 = edges[to].size();\n edges[from].push_back(Edge(from, to, capacity, cost, n2));\n edges[to].push_back(Edge(to, from, 0, -cost, n1));\n} \n\nstruct Result {\n Result() {}\n Result(int cost, int f) : cost(cost), f(f) {}\n int cost;\n int f;\n};\n\nint prev[128];\nint prev_id[128];\nint w[128];\nint max_f[128];\nvoid init_flow() {\n for(int i = 0; i < 128; ++i) {\n prev[i] = -1;\n prev_id[i] = -1;\n w[i] = (1 << 30);\n max_f[i] = 0;\n }\n}\n\nResult flow(int from, int to, int rem) {\n std::priority_queue< std::pair<int, int> > q;\n q.push(std::make_pair(0, from));\n w[from] = 0;\n max_f[from] = rem;\n while( not q.empty() ) {\n int n, weight;\n std::tie(weight, n) = q.top(); q.pop();\n // printf(\"(n) = (%d)\\n\", n);\n weight = -weight;\n for(int i = 0; i < (int)edges[n].size(); ++i) {\n Edge edge = edges[n][i];\n if( edge.capacity <= 0 ) continue;\n int nw = weight + edge.cost;\n if( w[edge.to] <= nw ) continue;\n w[edge.to] = nw;\n prev[edge.to] = n;\n prev_id[edge.to] = i;\n max_f[edge.to] = std::min(max_f[edge.from], edge.capacity);\n q.push(std::make_pair(-nw, edge.to));\n }\n }\n // for(int i = 0; i < v; ++i) {\n // printf(\"node info[%d] : (w, max_f, prev, prev_id) = (%d, %d, %d, %d)\\n\", i, w[i], max_f[i], prev[i], prev_id[i]);\n // }\n int f = max_f[to];\n if( f == 0 ) return Result(0, 0);\n int m = to;\n int cost = 0;\n while( prev[m] != -1 ) {\n edges[prev[m]][prev_id[m]].capacity -= f;\n edges[m][edges[prev[m]][prev_id[m]].rev].capacity += f;\n cost += f * edges[prev[m]][prev_id[m]].cost;\n m = prev[m];\n }\n return Result(cost, f);\n}\n\nint minimum_cost_flow(int from, int to, int rem) {\n int cost = 0;\n for(;;) {\n init_flow();\n Result r = flow(from, to, rem);\n rem -= r.f;\n cost += r.cost;\n if( rem == 0 ) return cost;\n if( r.f == 0 ) break;\n // printf(\"(rem, flow rate) = (%d, %d)\\n\", rem, r.f);\n }\n return -1;\n}\n\nint main() {\n int f;\n scanf(\"%d %d %d\", &v, &e, &f);\n for(int i = 0; i < e; ++i) {\n int a, b, c, d;\n scanf(\"%d %d %d %d\", &a, &b, &c, &d);\n addEdge(a, b, c, d);\n }\n\n printf(\"%d\\n\", minimum_cost_flow(0, v - 1, f));\n \n return 0;\n}", "import java.util.*;\n\npublic class Main {\n\n@SuppressWarnings(\"unchecked\")\nstatic class MinCostFlow{\n class Edge{\n int to,cap,cost,rev;\n Edge(int to,int cap,int cost,int rev){this.to=to;this.cap=cap;this.cost=cost;this.rev=rev;}\n }\n List<Edge> edges[];\n void add_edge(int from,int to,int cap,int cost){\n edges[from].add(new Edge(to,cap,cost,edges[to].size()));\n edges[to].add(new Edge(from,0,-cost,edges[from].size()-1));\n }\n int[] dis;\n int[] h;\n int[] prevv;\n Edge[] preve;\n MinCostFlow(int V){\n edges = new ArrayList[V];\n dis =new int[V];\n h = new int[V];\n prevv=new int[V];\n preve=new Edge[V];\n for(int i=0;i<V;++i)edges[i]=new ArrayList<>();\n }\n\n int get(int s,int t,int f){\n int res = 0;\n class Node{\n int v,cost;\n Node(int v,int cost){this.v=v;this.cost=cost;}\n }\n Arrays.fill(h,0);\n while(f>0){\n Arrays.fill(dis, Integer.MAX_VALUE);\n dis[s]=0;\n PriorityQueue<Node> que = new PriorityQueue<>((a,b)->a.cost-b.cost);\n que.add(new Node(s,0));\n while(!que.isEmpty()){\n Node node = que.poll();\n if(dis[node.v]<node.cost)continue;\n for(Edge e : edges[node.v])if(dis[node.v]+e.cost + (h[e.to]-h[node.v]) <dis[e.to] && e.cap>0){\n dis[e.to] = dis[node.v]+e.cost + (h[e.to]-h[node.v]);\n prevv[e.to]=node.v;\n preve[e.to]=e;\n que.add(new Node(e.to, dis[e.to]));\n }\n }\n if(dis[t]==Integer.MAX_VALUE)return -1;\n for(int i=0;i<h.length;++i)h[i] -= dis[i];\n int d = f;\n\n for(int v=t;v!=s;v=prevv[v])d=Math.min(d, preve[v].cap);\n res += d * -h[t];\n f-=d;\n for(int v=t;v!=s;v=prevv[v]){\n preve[v].cap-=d;\n edges[v].get(preve[v].rev).cap+=d;\n }\n }\n return res;\n }\n}\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int V = sc.nextInt();\n int E = sc.nextInt();\n int F = sc.nextInt();\n MinCostFlow mcf = new MinCostFlow(V);\n for (int i=0;i<E;i++) {\n int u = sc.nextInt();\n int v = sc.nextInt();\n int c = sc.nextInt();\n int d = sc.nextInt();\n mcf.add_edge(u, v, c, d);\n }\n System.out.println(mcf.get(0, V-1, F));\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\ntemplate<class T = int> using V = vector<T>;\ntemplate<class T = int> using VV = V< V<T> >;\n\n// BEGIN CUT HERE\ntemplate<class T> struct PrimalDual {\n struct Edge { int to, rev; T cap, cost; };\n const T inf = numeric_limits<T>::max();\n const int n;\n VV<Edge> g;\n V<T> pot, dist;\n V<> pv, pe;\n PrimalDual(int n) : n(n), g(n), pot(n), dist(n), pv(n), pe(n) {}\n void add_edge(int from, int to, T cap, T cost) {\n assert(from != to);\n assert(cap >= 0);\n if (!cap) return;\n assert(cost >= 0);\n g[from].emplace_back(Edge{to, (int) g[to].size(), cap, cost});\n g[to].emplace_back(Edge{from, (int) g[from].size() - 1, 0, -cost});\n }\n void dijkstra(int s) {\n using P = pair<T, int>;\n priority_queue< P, V<P>, greater<P> > pque;\n fill(begin(dist), end(dist), inf);\n pque.emplace(dist[s] = 0, s);\n while (!pque.empty()) {\n T d; int v;\n tie(d, v) = pque.top(); pque.pop();\n if (d > dist[v]) continue;\n for (int i = 0; i < (int) g[v].size(); ++i) {\n const Edge& e = g[v][i];\n if (!e.cap or dist[e.to] <= dist[v] + e.cost - (pot[e.to] - pot[v])) continue;\n pv[e.to] = v, pe[e.to] = i;\n pque.emplace(dist[e.to] = dist[v] + e.cost - (pot[e.to] - pot[v]), e.to);\n }\n }\n }\n T min_cost_flow(int s, int t, T f) {\n assert(s != t);\n assert(f >= 0);\n T res = 0;\n fill(begin(pot), end(pot), 0);\n while (f > 0) {\n dijkstra(s);\n if (dist[t] == inf) return -1;\n for (int v = 0; v < n; ++v) pot[v] += dist[v];\n T d = f;\n for (int v = t; v != s; v = pv[v]) {\n d = min(d, g[pv[v]][pe[v]].cap);\n }\n f -= d;\n res += d * pot[t];\n for (int v = t; v != s; v = pv[v]) {\n Edge& e = g[pv[v]][pe[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n// END CUT HERE\n\nint main() {\n cin.tie(nullptr); ios::sync_with_stdio(false);\n int n, m, f; cin >> n >> m >> f;\n PrimalDual<int> g(n);\n while (m--) {\n int u, v, c, d; cin >> u >> v >> c >> d;\n g.add_edge(u, v, c, d);\n }\n cout << g.min_cost_flow(0, n - 1, f) << '\\n';\n}\n", "# ノードをtupleで渡す\nfrom collections import defaultdict\nfrom heapq import *\nclass MinCostFlow:\n def __init__(self):\n self.inf=10**9\n self.to = defaultdict(dict)\n\n def add_edge(self, u, v, cap, cost):\n self.to[u][v]=[cap, cost]\n self.to[v][u]=[0, -cost]\n\n # s...source,t...sink,f...flow\n # これが本体\n def cal(self,s,t,f):\n min_cost=0\n pot=defaultdict(int)\n while f:\n dist = {}\n pre_u={} # 最短距離の遷移元の頂点\n # ダイクストラで最短距離を求める\n hp=[]\n heappush(hp,(0,s))\n dist[s]=0\n while hp:\n d,u=heappop(hp)\n if d>dist[u]:continue\n for v,[cap,cost] in self.to[u].items():\n if cap==0:continue\n nd=dist[u]+cost+pot[u]-pot[v]\n dist.setdefault(v, self.inf)\n if nd>=dist[v]:continue\n dist[v]=nd\n pre_u[v]=u\n heappush(hp,(nd,v))\n # sinkまで届かなかったら不可能ということ\n if t not in dist:return -1\n # ポテンシャルを更新する\n for u,d in dist.items():pot[u]+=d\n # パスs-t上で最小の容量=流す量を求める\n u=t\n min_cap=f\n while u!=s:\n u,v=pre_u[u],u\n min_cap=min(min_cap,self.to[u][v][0])\n # フローから流す量を減らし、コストを加える\n f-=min_cap\n min_cost+=min_cap*pot[t]\n # パスs-tの容量を更新する\n u=t\n while u!=s:\n u,v=pre_u[u],u\n self.to[u][v][0]-=min_cap\n self.to[v][u][0]+=min_cap\n return min_cost\n\ndef main():\n n,m,f=map(int,input().split())\n mc=MinCostFlow()\n for _ in range(m):\n u,v,c,d=map(int,input().split())\n mc.add_edge(u,v,c,d)\n print(mc.cal(0,n-1,f))\n\nmain()\n\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\n\n\n\n\n\n#define MAX_V 100\nstruct edge { int to, cap, cost,rev; };\n\nint V; // ????????°\nvector<edge> G[MAX_V];\nvector<int> h(MAX_V);\t//??????????????£???\nvector<int> dist(MAX_V);// ???????????¢\nint prevv[MAX_V], preve[MAX_V];// ??´??????????????¨???\n\n// from??????to??????????????????cap????????????cost????????????????????????????????????\nvoid add_edge(int from, int to, int cap, int cost) {\n\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\n\n//?????????????????????????????????????????´????????????\nvoid shortest_path(int s,vector<int> &d){\n\tint v = d.size();\n\trep(i,d.size())d[i]=INF;\n\td[s]=0;\n\trep(loop,v){\n\t\trep(i,v){\n\t\t\trep(j,G[i].size()){\n\t\t\t\tedge e = G[i][j];\n\t\t\t\tif(!e.cap)continue;\n\t\t\t\tif(d[i]!=INF && d[e.to] > d[i]+e.cost){\n\t\t\t\t\td[e.to] = d[i]+e.cost;\n\t\t\t\t\tpreve[e.to]=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// s??????t????????????f???????°??????¨???????±???????\n// ??????????????´??????-1?????????\nint min_cost_flow(int s, int t, int f) {\n\tint res = 0;\n\tshortest_path(s, h);\n\t\n\twhile (f > 0) {\n\t\t// ?????????????????????????????¨??????h?????´??°??????\n\t\tpriority_queue<pii, vector<pii>, greater<pii> > que;\n\t\trep(i,dist.size())dist[i]=INF;\n\t\tdist[s] = 0;\n\t\tque.push(pii(0, s));\n\t\twhile (!que.empty()) {\n\t\t\tpii p = que.top(); que.pop();\n\t\t\tint v = p.second;\n\t\t\tif (dist[v] < p.first) continue;\n\t\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\t\tedge &e = G[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to]; prevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tque.push(pii(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) return -1;\t//????????\\???????????????\n\t\t\n\t\tfor (int v = 0; v < V; v++) h[v] += dist[v];\n\t\t\n\t\t\n\t\t// s-t????????????????????£??????????????????\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d * h[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]]; e.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(){\n\tint e,f;\n\tcin>>V>>e>>f;\n\trep(i,e){\n\t\tint u,v,c,d;\n\t\tcin>>u>>v>>c>>d;\n\t\tadd_edge(u, v, c, d);\n\t}\n\tcout<<min_cost_flow(0, V-1, f)<<endl;\n}", "import heapq\n\nclass MinCostFlow:\n class Edge:\n def __init__(self,to,cap,rev,cost):\n self.to = to\n self.cap = cap\n self.rev = rev\n self.cost = cost\n\n def __init__(self,n,inf=1000000007):\n self.n = n\n self.inf = inf\n self.e = [[] for _ in range(n)]\n\n def add_edge(self, fr, to, cap, cost):\n self.e[fr].append(self.Edge(to,cap,len(self.e[to]),cost))\n self.e[to].append(self.Edge(fr,0,len(self.e[fr])-1,-cost))\n\n def compute(self,source,sink,f):\n res = 0\n h = [0]*self.n\n prevv = [0]*self.n\n preve = [0]*self.n\n while (f > 0):\n pq = []\n dist = [self.inf]*self.n\n dist[source] = 0\n heapq.heappush(pq,(0,source))\n while pq:\n cost, v = heapq.heappop(pq)\n cost = -cost\n if dist[v] < cost:continue\n for i, edge in enumerate(self.e[v]):\n if edge.cap > 0 and dist[v] - h[edge.to] < dist[edge.to] - edge.cost - h[v]:\n dist[edge.to] = dist[v] + edge.cost + h[v] - h[edge.to]\n prevv[edge.to] = v\n preve[edge.to] = i\n heapq.heappush(pq,(-dist[edge.to],edge.to))\n if dist[sink] == self.inf:return -1\n for v in range(self.n):\n h[v] += dist[v]\n\n d, v = f, sink\n while v != source:\n d = min(d,self.e[prevv[v]][preve[v]].cap)\n v = prevv[v]\n f -= d\n res += d*h[sink]\n v = sink\n while v != source:\n self.e[prevv[v]][preve[v]].cap -= d\n self.e[v][self.e[prevv[v]][preve[v]].rev].cap += d\n v = prevv[v]\n return res\n\n\ndef main():\n v,e,f = map(int,input().split())\n MCF = MinCostFlow(v)\n for _ in range(e):\n a,b,c,d = map(int,input().split())\n MCF.add_edge(a,b,c,d)\n print(MCF.compute(0,v-1,f))\n\nif __name__ == '__main__':\n main()\n\n\n", "import sys\ninput = sys.stdin.readline\nfrom heapq import heappush, heappop\ndef min_cost_flow_dijkstra(E, s, t, f):\n INF = 1 << 100\n NN = N\n LN = NN.bit_length()\n G = [[] for _ in range(NN)]\n for a, b, cap, c in E:\n G[a].append([b, cap, c, len(G[b])])\n G[b].append([a, 0, -c, len(G[a])-1])\n prevv = [-1] * NN\n preve = [-1] * NN\n res = 0\n while f > 0:\n h = [0] * NN\n dist = [INF] * NN\n dist[s] = 0\n Q = []\n heappush(Q, s)\n while len(Q):\n x = heappop(Q)\n d, v = (x>>LN), x % (1<<LN)\n if dist[v] < d: continue\n for i, (w, _cap, c, r) in enumerate(G[v]):\n if _cap > 0 and dist[w] > dist[v] + c + h[v] - h[w]:\n dist[w] = dist[v] + c + h[v] - h[w]\n prevv[w] = v\n preve[w] = i\n heappush(Q, (dist[w] << LN) + w)\n if dist[t] == INF:\n return -1\n for v in range(N):\n h[v] += dist[v]\n \n d = f\n v = t\n while v != s:\n d = min(d, G[prevv[v]][preve[v]][1])\n v = prevv[v]\n f -= d\n res += d * dist[t]\n v = t\n while v != s:\n G[prevv[v]][preve[v]][1] -= d\n G[v][G[prevv[v]][preve[v]][3]][1] += d\n v = prevv[v]\n return res\n\nN, M, F = map(int, input().split())\nE = []\nfor i in range(M):\n u, v, c, d = map(int, input().split())\n E.append((u, v, c, d))\n\nprint(min_cost_flow_dijkstra(E, 0, N-1, F))\n\n", "#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n#define INF 99999999\nusing namespace std;\n\ntypedef int Weight;\nstruct Edge {\n int src, dst;\n Weight capacity, cost;\n Edge(int src, int dst, Weight capacity, Weight cost) :\n src(src), dst(dst), capacity(capacity), cost(cost) { }\n};\nbool operator < (const Edge &e, const Edge &f) {\n return e.cost != f.cost ? e.cost > f.cost : // !!INVERSE!!\n e.capacity != f.capacity ? e.capacity > f.capacity : // !!INVERSE!!\n e.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n\n#define RESIDUE(u,v) (capacity[u][v] - flow[u][v])\n#define RCOST(u,v) (cost[u][v] + h[u] - h[v])\npair<Weight, Weight> minimumCostFlow(const Graph &g, int s, int t, Weight F=INF) {\n const int n = g.size();\n Matrix capacity(n, Array(n)), cost(n, Array(n)), flow(n, Array(n));\n REP(u,n) FOR(e,g[u]) {\n capacity[e->src][e->dst] += e->capacity;\n cost[e->src][e->dst] += e->cost;\n }\n pair<Weight, Weight> total; // (cost, flow)\n vector<Weight> h(n);\n\n for (; F > 0; ) { // residual flow\n vector<Weight> d(n, INF); d[s] = 0;\n vector<int> p(n, -1);\n priority_queue<Edge> Q; // \"e < f\" <=> \"e.cost > f.cost\"\n for (Q.push(Edge(-2, s, 0, 0)); !Q.empty(); ) {\n Edge e = Q.top(); Q.pop();\n if (p[e.dst] != -1) continue;\n p[e.dst] = e.src;\n FOR(f, g[e.dst]) if (RESIDUE(f->src, f->dst) > 0) {\n if (d[f->dst] > d[f->src] + RCOST(f->src, f->dst)) {\n d[f->dst] = d[f->src] + RCOST(f->src, f->dst);\n Q.push( Edge(f->src, f->dst, 0, d[f->dst]) );\n }\n }\n }\n if (p[t] == -1) break;\n\n Weight f = F;\n for (int u = t; u != s; u = p[u])\n f = min(f, RESIDUE(p[u], u));\n for (int u = t; u != s; u = p[u]) {\n total.first += f * cost[p[u]][u];\n flow[p[u]][u] += f; flow[u][p[u]] -= f;\n }\n F -= f;\n total.second += f;\n REP(u, n) h[u] += d[u];\n }\n return total;\n}\n\nint main(){\n\tint i,V,E,F,s,t,e,f;\n\t//for(scanf(\"%d\",&T);T;putchar(--T?' ':'\\n')){\n\t\tscanf(\"%d%d%d\",&V,&E,&F);\n\t\tGraph g(V);\n\t\tfor(;E--;)scanf(\"%d%d%d%d\",&s,&t,&e,&f),g[s].push_back(Edge(s,t,e,f)),g[t].push_back(Edge(t,s,0,-f));\n\t\tpair<int,int> p=minimumCostFlow(g,0,V-1,F);\n\t\tprintf(\"%d\\n\",p.second<F ? -1 : p.first);\n\t//}\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename Cap, typename Cost>\nstruct Graph {\n const Cost INF = numeric_limits<Cost>::max();\n struct Edge {\n int to, rev;\n Cap cap;\n Cost cost;\n Edge(int to, Cap cap, Cost cost, int rev)\n : to(to), cap(cap), cost(cost), rev(rev) {}\n };\n vector<vector<Edge>> g;\n int n;\n Graph(int n) : n(n) {\n g.assign(n, vector<Edge>());\n }\n void add_edge(int v, int u, Cap cap = 1, Cost cost = 0) {\n g[v].emplace_back(u, cap, cost, (int) g[u].size());\n g[u].emplace_back(v, 0, -cost, (int) g[v].size() - 1);\n }\n vector<Edge>& operator[](int x) {\n return g[x];\n }\n Cost min_cost_flow(int s, int t, Cap f) {\n Cost ret = 0;\n while (f > 0) {\n vector<Cost> dist(n, INF);\n vector<int> prevv(n), preve(n);\n dist[s] = 0;\n while (true) {\n bool update = false;\n for (int v = 0; v < n; v++) {\n for (int i = 0; i < g[v].size(); i++) {\n auto &e = g[v][i];\n if (e.cap == 0) continue;\n if (dist[v] == INF || dist[e.to] <= dist[v] + e.cost) continue;\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v, preve[e.to] = i;\n update = true;\n }\n }\n if (!update) break;\n }\n if (dist[t] == INF) return INF;\n Cap cap = f;\n for (int v = t; v != s; v = prevv[v]) {\n cap = min(cap, g[prevv[v]][preve[v]].cap);\n }\n f -= cap;\n ret += cap * dist[t];\n for (int v = t; v != s; v = prevv[v]) {\n auto &e = g[prevv[v]][preve[v]];\n e.cap -= cap;\n g[v][e.rev].cap += cap;\n }\n }\n return ret;\n }\n};\n\nint main() {\n int n, m, f;\n cin >> n >> m >> f;\n Graph<int, int> g(n);\n for (int i = 0; i < m; i++) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n g.add_edge(u, v, c, d);\n }\n int ans = g.min_cost_flow(0, n - 1, f);\n if (ans == g.INF) {\n ans = -1;\n }\n cout << ans << endl;\n return 0;\n}\n\n", "class MinCostFlow:\n def __init__(self, n):\n self.n = n\n self.G = [[] for i in range(n)]\n\n def addEdge(self, f, t, cap, cost):\n # [to, cap, cost, rev]\n self.G[f].append([t, cap, cost, len(self.G[t])])\n self.G[t].append([f, 0, -cost, len(self.G[f])-1])\n\n def minCostFlow(self, s, t, f):\n n = self.n\n G = self.G\n prevv = [0]*n; preve = [0]*n\n INF = 10**9+7\n\n res = 0\n while f:\n dist = [INF]*n\n dist[s] = 0\n update = 1\n while update:\n update = 0\n for v in range(n):\n if dist[v] == INF:\n continue\n gv = G[v]\n for i in range(len(gv)):\n to, cap, cost, rev = gv[i]\n if cap > 0 and dist[v] + cost < dist[to]:\n dist[to] = dist[v] + cost\n prevv[to] = v; preve[to] = i\n update = 1\n if dist[t] == INF:\n return -1\n\n d = f; v = t\n while v != s:\n d = min(d, G[prevv[v]][preve[v]][1])\n v = prevv[v]\n f -= d\n res += d * dist[t]\n v = t\n while v != s:\n e = G[prevv[v]][preve[v]]\n e[1] -= d\n G[v][e[3]][1] += d\n v = prevv[v]\n return res\n\nn, m, f = map(int, input().split())\ngraph = MinCostFlow(n)\nfor i in range(m):\n u, v, c, d = map(int, input().split())\n graph.addEdge(u, v, c, d)\nprint(graph.minCostFlow(0, n-1, f))", "#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n//#include \"MyMath.h\"\n//#include \"MyDisjointset.h\"\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <functional>\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\nusing namespace std;\ntypedef pair<int, int> P; typedef long long int ll; typedef vector <int> vecint; typedef vector <vecint> dvecint; typedef vector <dvecint> vecdvecint; typedef vector <vector <dvecint> > dvecdvecint;\nconst ll INF = 2000000000;\nstruct edge {\n\tint to, cap, cost, rev;\n\tedge(int t, int ca, int co, int re) {\n\t\tto = t;\n\t\tcap = ca;\n\t\tcost = co;\n\t\trev = re;\n\t}\n};\nvector <edge> G[100];\nint prv[100], pre[100], d[100];\nint v, e, flow;\nvoid addedge(int from, int to, int cap, int cost) {\n\tG[from].push_back(edge(to, cap, cost, G[to].size()));\n\tG[to].push_back(edge(from, 0, -cost, G[from].size() - 1));\n}\nint minimumcost(int s, int t, int f) {\n\tint res = 0;\n\twhile (f > 0) {\n\t\tfill(d, d + v, INF);\n\t\td[s] = 0;\n\t\tbool ud = true;\n\t\twhile (ud) {\n\t\t\tud = false;\n\t\t\tfor (int i = 0; i < v; i++) {\n\t\t\t\tif (d[i] == INF) continue;\n\t\t\t\tfor (int j = 0; j < G[i].size(); j++) {\n\t\t\t\t\tedge &e = G[i][j];\n\t\t\t\t\tif (e.cap > 0 && d[e.to] > d[i] + e.cost) {\n\t\t\t\t\t\td[e.to] = d[i] + e.cost;\n\t\t\t\t\t\tprv[e.to] = i;\n\t\t\t\t\t\tpre[e.to] = j;\n\t\t\t\t\t\tud = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (d[t] == INF) return -1;\n\t\tint dis = f;\n\t\tfor (int w = t; w != s; w = prv[w]) {\n\t\t\tdis = min(dis, G[prv[w]][pre[w]].cap);\n\t\t}\n\t\tf -= dis;\n\t\tfor (int w = t; w != s; w = prv[w]) {\n\t\t\tG[prv[w]][pre[w]].cap -= dis;\n\t\t\tG[w][G[prv[w]][pre[w]].rev].cap += dis;\n\t\t}\n\t\tres += dis * d[t];\n\t}\n\treturn res;\n}\nint main() {\n\tcin >> v >> e >> flow;\n\tfor (int i = 0; i < e; i++) {\n\t\tint s, t, c, d; cin >> s >> t >> c >> d;\n\t\taddedge(s, t, c, d);\n\t}\n\tcout << minimumcost(0, v - 1, flow) << endl;\n\treturn 0;\n}", "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\n\n@SuppressWarnings(\"unchecked\")\nclass MinCostFlow{\n class Edge{\n int to,cap,cost,rev;\n Edge(int to,int cap,int cost,int rev){this.to=to;this.cap=cap;this.cost=cost;this.rev=rev;}\n }\n List<Edge> edges[];\n void add_edge(int from,int to,int cap,int cost){\n edges[from].add(new Edge(to,cap,cost,edges[to].size()));\n edges[to].add(new Edge(from,0,-cost,edges[from].size()-1));\n }\n int[] dis;\n int[] h;\n int[] prevv;\n Edge[] preve;\n MinCostFlow(int V){\n edges = new ArrayList[V];\n dis =new int[V];\n h = new int[V];\n prevv=new int[V];\n preve=new Edge[V];\n for(int i=0;i<V;++i)edges[i]=new ArrayList<>();\n }\n\n int get(int s,int t,int f){\n int res = 0;\n class Node{\n int v,cost;\n Node(int v,int cost){this.v=v;this.cost=cost;}\n }\n Arrays.fill(h,0);\n while(f>0){\n Arrays.fill(dis, Integer.MAX_VALUE);\n dis[s]=0;\n PriorityQueue<Node> que = new PriorityQueue<>((a,b)->a.cost-b.cost);\n que.add(new Node(s,0));\n while(!que.isEmpty()){\n Node node = que.poll();\n if(dis[node.v]<node.cost)continue;\n for(Edge e : edges[node.v])if(dis[node.v]+e.cost + (h[e.to]-h[node.v]) <dis[e.to] && e.cap>0){\n dis[e.to] = dis[node.v]+e.cost + (h[e.to]-h[node.v]);\n prevv[e.to]=node.v;\n preve[e.to]=e;\n que.add(new Node(e.to, dis[e.to]));\n }\n }\n if(dis[t]==Integer.MAX_VALUE)return -1;\n for(int i=0;i<h.length;++i)h[i] -= dis[i];\n int d = f;\n\n for(int v=t;v!=s;v=prevv[v])d=Math.min(d, preve[v].cap);\n res += d * -h[t];\n f-=d;\n for(int v=t;v!=s;v=prevv[v]){\n preve[v].cap-=d;\n edges[v].get(preve[v].rev).cap+=d;\n }\n }\n return res;\n }\n\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int V = scan.nextInt();\n int E = scan.nextInt();\n int F = scan.nextInt();\n MinCostFlow mcf = new MinCostFlow(V);\n while(E-->0){\n int u = scan.nextInt();\n int v = scan.nextInt();\n int c = scan.nextInt();\n int d = scan.nextInt();\n mcf.add_edge(u, v, c, d);\n }\n System.out.println(mcf.get(0,V-1,F));\n }\n}\n\nclass Main{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int V = scan.nextInt();\n int E = scan.nextInt();\n int F = scan.nextInt();\n MinCostFlow mcf = new MinCostFlow(V);\n while(E-->0){\n int u = scan.nextInt();\n int v = scan.nextInt();\n int c = scan.nextInt();\n int d = scan.nextInt();\n mcf.add_edge(u, v, c, d);\n }\n System.out.println(mcf.get(0,V-1,F));\n }\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T, typename U>\nstruct min_cost_flow_graph {\n\t\n\tstruct edge {\n\t\tint from, to;\n\t\tT cap, f;\n\t\tU cost;\n\t};\n\t\n\tvector<edge> edges;\n\tvector<vector<int>> g;\n\tint n, st, fin;\n\tT required_flow, flow;\n\tU cost;\n\t\n\tmin_cost_flow_graph(int n, int st, int fin, T required_flow)\n\t\t: n(n), st(st), fin(fin), required_flow(required_flow) {\n\t\t\tassert(0 <= st && st < n && 0 <= fin && fin < n && st != fin);\n\t\t\tg.resize(n);\n\t\t\tflow = 0;\n\t\t\tcost = 0;\n\t}\n\t\n\tvoid clear_flow() {\n\t\tfor (const edge &e : edges) {\n\t\t\te.f = 0;\n\t\t}\n\t\tflow = 0;\n\t\tcost = 0;\n\t}\n\t\n\tvoid add(int from, int to, T cap = 1, T rev_cap = 0, U cost = 1) {\n\t\tassert(0 <= from && from < n && 0 <= to && to < n);\n\t\tg[from].emplace_back(edges.size());\n\t\tedges.push_back({from, to, cap, 0, cost});\n\t\tg[to].emplace_back(edges.size());\n\t\tedges.push_back({to, from, rev_cap, 0, -cost});\n\t}\n\t\n\tU min_cost_flow() {\n\t\tvector<U> h(n, 0);\n\t\twhile (flow < required_flow) {\n\t\t\tvector<int> preve(n);\n\t\t\tvector<U> dist(n, numeric_limits<U>::max() / 2);\n\t\t\tpriority_queue<pair<U, int>, vector<pair<U, int>>, greater<pair<U, int>>> pq;\n\t\t\tdist[st] = 0;\n\t\t\tpq.emplace(dist[st], st);\n\t\t\twhile (!pq.empty()) {\n\t\t\t\tU expected = pq.top().first;\n\t\t\t\tint i = pq.top().second;\n\t\t\t\tpq.pop();\n\t\t\t\tif (expected != dist[i]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int id : g[i]) {\n\t\t\t\t\tconst edge &e = edges[id];\n\t\t\t\t\tif (0 < e.cap - e.f && dist[e.from] + e.cost + h[e.from] - h[e.to] < dist[e.to]) {\n\t\t\t\t\t\tdist[e.to] = dist[e.from] + e.cost + h[e.from] - h[e.to];\n\t\t\t\t\t\tpreve[e.to] = id;\n\t\t\t\t\t\tpq.emplace(dist[e.to], e.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[fin] == numeric_limits<U>::max() / 2) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\th[i] += dist[i];\n\t\t\t}\n\t\t\tT d = required_flow - flow;\n\t\t\tfor (int i = fin; i != st; i = edges[preve[i]].from) {\n\t\t\t\td = min(d, edges[preve[i]].cap - edges[preve[i]].f);\n\t\t\t}\n\t\t\tflow += d;\n\t\t\tcost += d * h[fin];\n\t\t\tfor (int i = fin; i != st; i = edges[preve[i]].from) {\n\t\t\t\tedges[preve[i]].f += d;\n\t\t\t\tedges[preve[i] ^ 1].f -= d;\n\t\t\t}\n\t\t}\n\t\treturn cost;\n\t}\n};\n\nint main() {\n\tint n, m, f;\n\tcin >> n >> m >> f;\n\tmin_cost_flow_graph<int, int> g(n, 0, n - 1, f);\n\tfor (int i = 0; i < m; i++) {\n\t\tint from, to, cap, cost;\n\t\tcin >> from >> to >> cap >> cost;\n\t\tg.add(from, to, cap, 0, cost);\n\t}\n\tcout << g.min_cost_flow() << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n\n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n\nusing ll=long long;\nusing R=long double;\nconst R EPS=1e-9; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R& r){return(r > EPS)-(r < -EPS);}\ninline R sq(R x){return sqrt(max<R>(x,0.0));}\n\nconst int dx[8]={1,0,-1,0,1,-1,-1,1};\nconst int dy[8]={0,1,0,-1,1,1,-1,-1};\n\n// Problem Specific Parameter:\nconst ll inf=1LL<<50;\n\n// Description: ??°??????????????????(?????????????°??????¨???)\n// Verifyed: Many Diffrent Problem \n\n//Appropriately Changed\nusing edge=struct{int to,cost,cap,rev;};\nusing G=vector<vector<edge>>;\n\n//Appropriately Changed\nvoid add_edge(G &graph,int from,int to,int cap,int cost){ \n\tgraph[from].push_back({to,cost,cap,int(graph[to].size())});\n\tgraph[to].push_back({from,-cost,0,int(graph[from].size())-1});\n}\n\n// Description: ??°??????????????????????°??????¨??? \n// TimeComplexity: $ \\mathcal{O}(FVE) $ \n// Verifyed: AOJ GRL_6_B\n\ntemplate <typename W> W primal_dual(G &graph,int s,int t,int f,W inf){\n\tW res=0;\n\twhile(f){\n\t\tint n=graph.size(),update;\n\t\tvector<W> dist(n,inf);\n\t\tvector<int> pv(n,0),pe(n,0);\n\t\tdist[s]=0;\n\n\t\trep(loop,n){\n\t\t\tupdate=false;\n\t\t\trep(v,n)rep(i,graph[v].size()){\n\t\t\t\tedge &e=graph[v][i];\n\t\t\t\tif(e.cap>0 && chmin(dist[e.to],dist[v]+e.cost)){\n\t\t\t\t\tpv[e.to]=v,pe[e.to]=i;\n\t\t\t\t\tupdate=true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!update) break;\n\t\t}\n\n\t\tif(dist[t]==inf) return -1;\n\n\t\tint d=f;\n\t\tfor(int v=t;v!=s;v=pv[v]) chmin(d,graph[pv[v]][pe[v]].cap);\n\t\tf-=d,res+=d*dist[t];\n\n\t\tfor(int v=t;v!=s;v=pv[v]){\n\t\t\tedge &e=graph[pv[v]][pe[v]];\n\t\t\te.cap-=d;\n\t\t\tgraph[v][e.rev].cap+=d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(void){\n\tint v,e,f;\n\tcin >> v >> e >> f;\n\tG graph(v);\n\trep(i,e){\n\t\tint a,b,c,d;\n\t\tcin >> a >> b >> c >> d;\n\t\tadd_edge(graph,a,b,c,d);\n\t}\n\n\tcout << primal_dual<ll>(graph,0,v-1,f,inf) << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <queue>\n#define INF (1 << 30)\nusing namespace std;\nstruct Edge {\n\t//to : Edge(from ??? to) cap:capacity\tcost:cost\trev:reverse\n\tint to, cap, cost, rev;\n\tEdge(int to, int cap, int cost, int rev) :to(to), cap(cap), cost(cost), rev(rev) {}\n};\n\n#define P vector<vector<Edge>>\nvector<int> dist;\nbool bellman_ford(P& Graph, int s, int t, vector<int>& parent_v, vector<int>& parent_at) {\n\tdist = vector<int>(t + 1, INF);\n\tdist[s] = 0;\n\tfor (int i = 0; i <= t;i++) {\n\t\tfor (int v = 0; v <= t;v++) {\n\t\t\tif (dist[v] == INF)continue;\n\t\t\tfor (int at = 0; at < Graph[v].size();at++) {\n\t\t\t\tEdge &e = Graph[v][at];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\t//cout << i << \" \" << v << endl;\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\tparent_v[e.to] = v;\n\t\t\t\t\tparent_at[e.to] = at;\n\t\t\t\t\tif (i == t) return false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nint primal_dual(P& Graph, int s, int t, int F) {\n\tvector<int> parent_v(t + 1);\n\tvector<int> parent_at(t + 1);\n\tint min_cost_flow = 0;\n\twhile (bellman_ford(Graph, s, t, parent_v, parent_at)) {\n\t\tif (dist[t] == INF) { return -1; }\n\t\tint path_flow = F;\n\t\tfor (int v = t; v != s; v = parent_v[v]) {\n\t\t\tpath_flow = min(path_flow, Graph[parent_v[v]][parent_at[v]].cap);\n\t\t}\n\n\t\tF -= path_flow;\n\t\tmin_cost_flow += path_flow*dist[t];\n\n\t\tif (F == 0) { return min_cost_flow; }\n\t\tif (F < 0) { return -1; }\n\n\t\tfor (int v = t; v != s; v = parent_v[v]) {\n\t\t\tEdge & e = Graph[parent_v[v]][parent_at[v]];\n\t\t\te.cap -= path_flow;\n\t\t\tGraph[v][e.rev].cap += path_flow;\n\t\t}\n\t}\n\treturn min_cost_flow;\n}\nint main() {\n\tint V, E, F; cin >> V >> E >> F;\n\tP G(V);\n\tfor (int i = 0; i < E;i++) {\n\t\tint u, v, c, d; cin >> u >> v >> c >> d;\n\t\tG[u].emplace_back(Edge(v, c, d, G[v].size()));\n\t\tG[v].emplace_back(Edge(u, 0, -d, G[u].size() - 1));\n\t}\n\tcout << primal_dual(G, 0, V - 1, F) << endl;\n\treturn 0;\n}", "#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> ipair;\ntypedef tuple<int, int, int> ituple;\n\nconst ll INF = LLONG_MAX;\n// const int MOD = (int)1e9 + 7;\n// const double EPS = 1e-10;\n#define PI acosl(-1)\n#define MAX_N 100 + 2\n\n/**\n * ????°??????¨???\n */\nclass MinCostFlow{\n struct edge{\n int to, cap, cost, rev;\n };\n \nprotected:\n static const int MAX_V = 1000 + 5;\n int V; // ????????°\n vector<edge> G[MAX_V]; // ??°???????????£??\\???????????¨???\n ll dist[MAX_V]; // ???????????¢\n int prevV[MAX_V], prevE[MAX_V]; // ??´??????????????¨???\n \npublic:\n MinCostFlow(){}\n MinCostFlow(int v){\n assert(v <= MAX_V);\n V = v;\n }\n void addEdge(int from, int to, int cap, int cost){\n G[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n }\n \n // s??????t??????????°??????¨???????±???????\n int exec(int s, int t, int f){\n int res = 0;\n \n while (f > 0){\n // ???????????????????????????????????????s-t??????????????????????±???????\n fill(dist, dist + V, INF);\n dist[s] = 0;\n bool update = true;\n while(update){\n update = false;\n for (int v = 0; v < V; v++){\n if (dist[v] == INF){\n continue;\n }\n \n for (int i = 0; i < G[v].size(); i++){\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost){\n dist[e.to] = dist[v] + e.cost;\n prevV[e.to] = v;\n prevE[e.to] = i;\n update = true;\n }\n }\n \n }\n }\n \n if (dist[t] == INF){\n // ????????\\???????????????\n return -1;\n }\n \n // s-t????????????????????£??????????????????\n int d = f;\n for (int v = t; v != s; v = prevV[v]){\n d = min(d, G[prevV[v]][prevE[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prevV[v]){\n edge &e = G[prevV[v]][prevE[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\nvoid exec(){\n int V, E, F, u, v, c, d;\n cin >> V >> E >> F;\n \n MinCostFlow mcf = MinCostFlow(V);\n \n for (int i = 0; i < E; i++){\n scanf(\"%d%d%d%d\", &u, &v, &c, &d);\n mcf.addEdge(u, v, c, d);\n }\n \n cout << mcf.exec(0, V-1, F) << endl;\n\n}\n\nvoid solve(){\n int t = 1;\n // scanf(\"%d\", &t);\n for (int i = 0; i < t; i++){\n exec();\n }\n}\n\nint main(){\n solve();\n return 0;\n}", "//#include \"bits/stdc++.h\"\n\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <cstdlib>\n#include <deque>\n#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <iterator>\n\nusing namespace std;\n\n#define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define all(c) begin(c),end(c)\n\n//#define int long long\n#define SZ(x) ((int)(x).size())\n#define pb push_back\n#define mp make_pair\n\ntypedef long long ll;\n//typedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<ll, int> pli;\ntypedef pair<double, double> pdd;\ntypedef vector<vector<int>> mat;\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }\n\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)1e9 + 7;\nconst double EPS = 1e-9;\n\n#define VMAX 10010\n\nstruct edge\n{\n\tint to, cap, cost, rev;\n\tedge(int to, int cap, int cost, int rev) :to(to), cap(cap), cost(cost), rev(rev) {}\n\tedge() :to(-1), cap(-1), cost(-1), rev(-1) {}\n};\n\nvector<edge> G[VMAX];\nint h[VMAX], dist[VMAX], prevv[VMAX], preve[VMAX];\nint V, E, F;\n\nvoid add_edge(int from, int to, int cap, int cost)\n{\n\tG[from].push_back(edge(to, cap, cost, SZ(G[to])));\n\tG[to].push_back(edge(from, 0, -cost, SZ(G[from]) - 1));\n}\n\nint min_cost_flow(int s, int t, int f)\n{\n\tint res = 0;\n\tfill(h, h + V, 0);\n\twhile (f > 0)\n\t{\n\t\tpriority_queue<pii, vector<pii>, greater<pii>> q;\n\t\tfill(dist, dist + V, INF);\n\t\tdist[s] = 0;\n\t\tq.push(pii(0, s));\n\t\twhile (!q.empty())\n\t\t{\n\t\t\tpii p = q.top(); q.pop();\n\t\t\tint v = p.second;\n\t\t\tif (dist[v] < p.first)continue;\n\t\t\trep(i, 0, SZ(G[v]))\n\t\t\t{\n\t\t\t\tedge& e = G[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to])\n\t\t\t\t{\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tq.push(pii(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t\trep(v, 0, V)h[v] += dist[v];\n\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v])\n\t\t{\n\t\t\tchmin(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d*h[t];\n\t\tfor (int v = t; v != s; v = prevv[v])\n\t\t{\n\t\t\tedge& e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tcin >> V >> E >> F;\n\tint s, t, c, d;\n\trep(i, 0, E)\n\t{\n\t\tcin >> s >> t >> c >> d;\n\t\tadd_edge(s, t, c, d);\n\t}\n\n\tcout << min_cost_flow(0, V - 1, F) << endl;\n\n\treturn 0;\n}\n", "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.InputMismatchException;\nimport java.util.TreeSet;\npublic class Main {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\tstatic final long INF = Long.MAX_VALUE / 2;\n\tint len;\n\tint[][] up;\n\tint[] tin;\n\tint[] tout;\n\tint time;\n\tprivate static void solve() {\n\t\t//PrintWriter pr = new PrintWriter(System.out);\n\t\tint V = ni();\n\t\tint E = ni();\n\t\tint F = ni();\n\t\tint[] u = new int[E];\n\t\tint[] v = new int[E];\n\t\tint[] c = new int[E];\n\t\tint[] d = new int[E];\n\t\tfor(int i=0;i<E;i++){\n\t\t\tu[i] = ni();\n\t\t\tv[i] = ni();\n\t\t\tc[i] = ni();\n\t\t\td[i] = ni();\n\t\t}\n\t\tint[][][] cost = packWD(V, u, v, d);\n\t\tint[][][] capacity = packWD(V, u, v, c);\n\t\tint max = maximumFlowDinic(capacity, 0, V-1);\n\t\tif(F>max){\n\t\t\tSystem.out.println(-1);\n\t\t}else{\n\t\t\tSystem.out.println(solveMinCostFlow(cost, capacity, 0, V-1, F));;\n\t\t}\n\t}\n\tpublic static int maximumFlowDinic(int[][][] g, int source, int sink)\n\t{\n\t\tint n = g.length;\n\n\t\t// unweighted invgraph\n\t\tint[] p = new int[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < g[i].length;j++)p[g[i][j][0]]++;\n\t\t}\n\t\tint[][] ig = new int[n][];\n\t\tfor(int i = 0;i < n;i++)ig[i] = new int[p[i]];\n\t\tfor(int i = n-1;i >= 0;i--){\n\t\t\tfor(int j = 0;j < g[i].length;j++){\n\t\t\t\tig[g[i][j][0]][--p[g[i][j][0]]] = i;\n\t\t\t}\n\t\t}\n\n\t\tint[][] f = new int[n][n];\n\t\tint[] d = new int[n];\n\t\tint[] q = new int[n];\n\t\tint ret = 0;\n\t\twhile(true){\n\t\t\tArrays.fill(d, -1);\n\t\t\tq[0] = source;\n\t\t\tint r = 1;\n\t\t\td[source] = 0;\n\n\t\t\tfor(int v = 0;v < r;v++){\n\t\t\t\tint cur = q[v];\n\t\t\t\t// plus flow\n\t\t\t\tfor(int[] ne : g[cur]){\n\t\t\t\t\tint nex = ne[0], w = ne[1];\n\t\t\t\t\tif(d[nex] == -1 && w - f[cur][nex] > 0) {\n\t\t\t\t\t\tq[r++] = nex;\n\t\t\t\t\t\td[nex] = d[cur] + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// minus flow\n\t\t\t\tfor(int nex : ig[cur]){\n\t\t\t\t\tif(d[nex] == -1 && -f[cur][nex] > 0) {\n\t\t\t\t\t\tq[r++] = nex;\n\t\t\t\t\t\td[nex] = d[cur] + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d[sink] == -1)break;\n\t\t\tint delta = 0;\n\t\t\twhile((delta = dfsDinic(d, g, ig, f, source, sink, Integer.MAX_VALUE)) > 0){\n\t\t\t\tret += delta;\n\t\t\t}\n\t\t}\n\n\t\treturn ret;\n\t}\n\n\tpublic static int dfsDinic(int[] d, int[][][] g, int[][] ig, int[][] f, int cur, int t, int min)\n\t{\n\t\tif(cur == t){\n\t\t\treturn min;\n\t\t}else{\n\t\t\tint left = min;\n\t\t\tfor(int[] ne : g[cur]){\n\t\t\t\tint nex = ne[0], w = ne[1];\n\t\t\t\tif(d[nex] == d[cur]+1 && w-f[cur][nex] > 0){\n\t\t\t\t\tint fl = dfsDinic(d, g, ig, f, nex, t, Math.min(left, w-f[cur][nex]));\n\t\t\t\t\tif(fl > 0){\n\t\t\t\t\t\tf[cur][nex] += fl;\n\t\t\t\t\t\tf[nex][cur] -= fl;\n\t\t\t\t\t\tleft -= fl;\n\t\t\t\t\t\tif(left == 0)return min;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int nex : ig[cur]){\n\t\t\t\tif(d[nex] == d[cur]+1 && -f[cur][nex] > 0){\n\t\t\t\t\tint fl = dfsDinic(d, g, ig, f, nex, t, Math.min(left, -f[cur][nex]));\n\t\t\t\t\tif(fl > 0){\n\t\t\t\t\t\tf[cur][nex] += fl;\n\t\t\t\t\t\tf[nex][cur] -= fl;\n\t\t\t\t\t\tleft -= fl;\n\t\t\t\t\t\tif(left == 0)return min;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min-left;\n\t\t}\n\t}\n\tpublic static int solveMinCostFlow(int[][][] cost, int[][][] capacity, int src, int sink, int all)\n\t{\n\t\tint n = cost.length;\n\n\t\tint[][] flow = new int[n][];\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tflow[i] = new int[cost[i].length];\n\t\t}\n\n\t\t// unweighted invgraph\n\t\t// ?????°?????????cur???i??????=next?????¨???????????°????????§cur???next?????????????????????????????????\n\t\tint[][][] ig = new int[n][][];\n\t\t{\n\t\t\tint[] p = new int[n];\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tfor(int j = 0;j < cost[i].length;j++)p[cost[i][j][0]]++;\n\t\t\t}\n\t\t\tfor(int i = 0;i < n;i++)ig[i] = new int[p[i]][2];\n\t\t\tfor(int i = n-1;i >= 0;i--){\n\t\t\t\tfor(int j = 0;j < cost[i].length;j++){\n\t\t\t\t\tint u = --p[cost[i][j][0]];\n\t\t\t\t\tig[cost[i][j][0]][u][0] = i;\n\t\t\t\t\tig[cost[i][j][0]][u][1] = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint mincost = 0;\n\t\tint[] pot = new int[n]; // ??????????????£???\n\n\t\tfinal int[] d = new int[n];\n\t\tTreeSet<Integer> q = new TreeSet<Integer>(new Comparator<Integer>(){\n\t\t\tpublic int compare(Integer a, Integer b)\n\t\t\t{\n\t\t\t\tif(d[a] - d[b] != 0)return d[a] - d[b];\n\t\t\t\treturn a - b;\n\t\t\t}\n\t\t});\n\t\twhile(all > 0){\n\t\t\t// src~sink?????????????????¢???\n\t\t\tint[] prev = new int[n];\n\t\t\tint[] myind = new int[n];\n\t\t\tArrays.fill(prev, -1);\n\t\t\tArrays.fill(d, Integer.MAX_VALUE / 2);\n\t\t\td[src] = 0;\n\t\t\tq.add(src);\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tint cur = q.pollFirst();\n\t\t\t\tfor(int i = 0;i < cost[cur].length;i++) {\n\t\t\t\t\tint next = cost[cur][i][0];\n\t\t\t\t\tif(capacity[cur][i][1] - flow[cur][i] > 0){\n\t\t\t\t\t\tint nd = d[cur] + cost[cur][i][1] + pot[cur] - pot[next];\n\t\t\t\t\t\tif(d[next] > nd){\n\t\t\t\t\t\t\tq.remove(next);\n\t\t\t\t\t\t\td[next] = nd;\n\t\t\t\t\t\t\tprev[next] = cur;\n\t\t\t\t\t\t\tmyind[next] = i;\n\t\t\t\t\t\t\tq.add(next);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(int i = 0;i < ig[cur].length;i++) {\n\t\t\t\t\tint next = ig[cur][i][0];\n\t\t\t\t\tint cind = ig[cur][i][1];\n\t\t\t\t\tif(flow[next][cind] > 0){\n\t\t\t\t\t\tint nd = d[cur] - cost[next][cind][1] + pot[cur] - pot[next];\n\t\t\t\t\t\tif(d[next] > nd){\n\t\t\t\t\t\t\tq.remove(next);\n\t\t\t\t\t\t\td[next] = nd;\n\t\t\t\t\t\t\tprev[next] = cur;\n\t\t\t\t\t\t\tmyind[next] = -cind-1;\n\t\t\t\t\t\t\tq.add(next);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(prev[sink] == -1)break;\n\n\t\t\tint minflow = all;\n\t\t\tint sumcost = 0;\n\t\t\tfor(int i = sink;i != src;i = prev[i]){\n\t\t\t\tif(myind[i] >= 0){\n\t\t\t\t\tminflow = Math.min(minflow, capacity[prev[i]][myind[i]][1] - flow[prev[i]][myind[i]]);\n\t\t\t\t\tsumcost += cost[prev[i]][myind[i]][1];\n\t\t\t\t}else{\n\t\t\t\t\t// cur->next\n\t\t\t\t\t// prev[i]->i\n\t\t\t\t\t// i????????£??????\n\t\t\t\t\t// ig[cur][j][0]=next?????¨???g[next][ig[cur][j][1]] = cur\n\t\t\t\t\tint ind = -myind[i]-1;\n\t\t\t\t\t//\t\t\t\t\ttr(prev[i], ind);\n\t\t\t\t\tminflow = Math.min(minflow, flow[i][ind]);\n\t\t\t\t\tsumcost -= cost[i][ind][1];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmincost += minflow * sumcost;\n\t\t\tfor(int i = sink;i != src;i = prev[i]){\n\t\t\t\tif(myind[i] >= 0){\n\t\t\t\t\tflow[prev[i]][myind[i]] += minflow;\n\t\t\t\t}else{\n\t\t\t\t\tint ind = -myind[i]-1;\n\t\t\t\t\tflow[i][ind] -= minflow;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tall -= minflow;\n\t\t\tfor(int i = 0;i < n;i++){\n\t\t\t\tpot[i] += d[i];\n\t\t\t}\n\t\t}\n\t\treturn mincost;\n\t}\n\tpublic static int[][][] packWD(int n, int[] from, int[] to, int[] w)\n\t{\n\t\tint[][][] g = new int[n][][];\n\t\tint[] p = new int[n];\n\t\tfor(int f : from)p[f]++;\n\t\tfor(int i = 0;i < n;i++)g[i] = new int[p[i]][2];\n\t\tfor(int i = 0;i < from.length;i++){\n\t\t\t--p[from[i]];\n\t\t\tg[from[i]][p[from[i]]][0] = to[i];\n\t\t\tg[from[i]][p[from[i]]][1] = w[i];\n\t\t}\n\t\treturn g;\n\t}\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tlong S = System.currentTimeMillis();\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\ttr(G-S+\"ms\");\n\t}\n\n\tprivate static boolean eof()\n\t{\n\t\tif(lenbuf == -1)return true;\n\t\tint lptr = ptrbuf;\n\t\twhile(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\n\t\ttry {\n\t\t\tis.mark(1000);\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b == -1){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn true;\n\t\t\t\t}else if(!isSpaceChar(b)){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\n\tprivate static int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\t//\tprivate static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\n\tprivate static String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate static char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\tprivate static char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\n\tprivate static int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\n\tprivate static int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate static long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tprivate static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}", "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <tuple>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nusing i64 = int64_t;\n\nconst int INF = 1LL << 29;\n\nstruct edge {\n int to, cap, rev, cost;\n edge(int a, int b, int c, int d): to(a), cap(b), rev(c), cost(d) {}\n};\n\nint V, E, F;\nvector<edge> graph[100];\n\nint min_cost_flow(int s, int g, int f) {\n vector<int> min_dist(V, INF);\n vector<int> prev_v(V, -1), prev_e(V, -1);\n int ans = 0;\n while (f > 0) {\n fill(begin(min_dist), end(min_dist), INF);\n min_dist[s] = 0;\n\n bool updated = true;\n while (updated) {\n updated = false;\n for (int v = 0; v < V; ++v) {\n if (min_dist[v] == INF) continue;\n for (int j = 0; j < graph[v].size(); ++j) {\n edge& e = graph[v][j];\n if (e.cap > 0 && min_dist[v] + e.cost < min_dist[e.to]) {\n updated = true;\n min_dist[e.to] = min_dist[v] + e.cost;\n prev_v[e.to] = v;\n prev_e[e.to] = j;\n }\n }\n }\n }\n\n if (min_dist[g] == INF) {\n return -1;\n }\n\n int ff = f;\n for (int t = g; t != s; t = prev_v[t]) {\n ff = min(ff, graph[prev_v[t]][prev_e[t]].cap);\n }\n\n ans += ff * min_dist[g];\n for (int t = g; t != s; t = prev_v[t]) {\n edge& e = graph[prev_v[t]][prev_e[t]];\n e.cap -= ff;\n graph[t][e.rev].cap += ff;\n }\n\n f -= ff;\n }\n return ans;\n}\n\nint main() {\n cin >> V >> E >> F;\n for (int j = 0; j < E; ++j) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n graph[u].emplace_back(v, c, (int)graph[v].size(), d);\n graph[v].emplace_back(u, 0, (int)graph[u].size()-1, -d);\n }\n\n cout << min_cost_flow(0, V-1, F) << endl;\n return 0;\n}", "#include <bits/stdc++.h>\n#define pb push_back\nusing namespace std;\nconst int INF=0x3f3f3f3f;\nconst int maxn=105;\nconst int maxq=1005;\n\nstruct edge{int to,cap,cost,rev;};\n\nint n,m,k;\nint d[maxn];\nint a[maxn];\nint p1[maxn];\nint p2[maxn];\nbool inq[maxn];\nvector<edge>G[maxn];\n\nvoid add_edge(int u,int v,int c,int w) {\n\tG[u].pb(edge{v,c,w,int(G[v].size())});\n\tG[v].pb(edge{u,0,-w,int(G[u].size()-1)});\n}\n\nint mcmf(int s,int t) {\n\tint flow=0 , cost=0;\n\twhile (1) {\n\t\tmemset(d,0x3f,sizeof(d));\n\t\td[s]=0; a[s]=max(0,k-flow);\n\t\tint qh=0,qt=0,q[maxq];\n\t\tq[qt++]=s; inq[s]=1;\n\t\twhile (qh<qt) {\n\t\t\tint u=q[qh++];\n\t\t\tinq[u]=0;\n\t\t\tfor (int i=0;i<G[u].size();i++) {\n\t\t\t\tedge e=G[u][i];\n\t\t\t\tif (d[e.to]>d[u]+e.cost && e.cap) {\n\t\t\t\t\td[e.to]=d[u]+e.cost;\n\t\t\t\t\ta[e.to]=min(a[u],e.cap);\n\t\t\t\t\tp1[e.to]=u;\n\t\t\t\t\tp2[e.to]=i;\n\t\t\t\t\tif (!inq[e.to]) {\n\t\t\t\t\t\tq[qt++]=e.to;\n\t\t\t\t\t\tinq[e.to]=1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (d[t]==INF || !a[t]) break;\n\t\tflow+=a[t];\n\t\tcost+=a[t]*d[t];\n\t\tfor (int u=t;u!=s;u=p1[u]) {\n\t\t\tedge e=G[p1[u]][p2[u]];\n\t\t\tG[p1[u]][p2[u]].cap-=a[t];\n\t\t\tG[e.to][e.rev].cap+=a[t];\n\t\t}\n\t}\n\tif (flow<k) return -1;\n\telse return cost;\n}\n\nint main() {\n\tcin>>n>>m>>k;\n\tfor (int i=0;i<m;i++) {\n\t\tint u,v,c,w; cin>>u>>v>>c>>w;\n\t\tadd_edge(u,v,c,w);\n\t}\n\tcout<<mcmf(0,n-1)<<'\\n';\n}\n\n", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n\n#define NMAX 110\n#define CMAX 1000000007\nusing namespace std;\ntypedef pair<int, int> pii;\nint c[110][110] = {0};\nint d[110][110] = {0};\nint dist[110];\nint path[110];\n\nint Dijkstra(vector<int> *g, int s, int t){\n priority_queue<pair<int, pii>, vector<pair<int, pii> >, greater<pair<int, pii> > > q;\n q.push(make_pair(0, pii(s, s)));\n for(int i=0; i<NMAX; ++i){\n dist[i] = CMAX;\n path[i] = -1;\n }\n dist[s] = 0;\n int u, v, w;\n while(!q.empty()){\n u = q.top().second.second;\n v = q.top().second.first;\n w = q.top().first;\n dist[u] = min(dist[u], w);\n if(path[u] == -1)path[u] = v;\n q.pop();\n for(int i=0; i<g[u].size(); ++i){\n if(c[u][g[u][i]] && path[g[u][i]] == -1){\n q.push(make_pair(dist[u]+d[u][g[u][i]], pii(u,g[u][i])));\n }\n }\n }\n return dist[t];\n}\n\nint main(){\n // 逐次最短路法により最小費用流問題を解く．\n\n vector<int> g[NMAX], resig[NMAX];\n int u, v, s, t;\n int n, m, f;\n int x = 0, p[NMAX] = {0}, res = 0;\n int r[NMAX][NMAX] = {0}, e[NMAX][NMAX] = {0};\n cin>>n>>m>>f;\n for(int i=0; i<m; ++i){\n cin>>u>>v>>s>>t;\n c[u][v] = s;\n d[u][v] = t, d[v][u] = -t;\n r[u][v] = t, r[v][u] = -t;\n e[u][v] = 1, e[v][u] = -1;\n g[u].push_back(v);\n resig[u].push_back(v);\n resig[v].push_back(u);\n }\n\n int a, dx = 0, k;\n while(dx != f){\n if(Dijkstra(resig, 0, n-1) == CMAX){\n cout<<-1<<endl;\n return 0;\n }\n for(int i=0; i<n; ++i){\n p[i] -= dist[i];\n }\n for(int i=0; i<n; ++i){\n for(int j=0; j<n; ++j){\n if(e[i][j])d[i][j] = r[i][j] + p[j] - p[i];\n }\n }\n a = f - dx;\n k = n-1;\n while(true){\n if(k == path[k]){\n break;\n }\n a = min(a, c[path[k]][k]);\n k = path[k];\n }\n\n k = n-1;\n while(true){\n if(k == path[k]){\n break;\n }\n c[k][path[k]] += a;\n c[path[k]][k] -= a;\n res += r[path[k]][k]*a;\n k = path[k];\n }\n dx += a;\n }\n\n cout<<res<<endl;\n\n return 0;\n}\n", "import java.util.*;\nimport java.io.*;\nimport java.awt.geom.*;\nimport java.math.*;\n\npublic class Main {\n\n\tstatic final Scanner in = new Scanner(System.in);\n\tstatic final PrintWriter out = new PrintWriter(System.out,false);\n\tstatic boolean debug = false;\n\n\tstatic int primalDual(int[][][] cost, int[][][] capacity, int source, int sink, int f) {\n\t\tint n = cost.length;\n\n\t\tint[][] flow = new int[n][];\n\t\tfor (int i=0; i<n; i++)\n\t\t\tflow[i] = new int[cost[i].length];\n\n\t\tint[][][] rev = new int[n][][];\n\n\t\tint[] cnt = new int[n];\n\t\tfor (int i=0; i<n; i++)\n\t\t\tfor (int j=0; j<cost[i].length; j++)\n\t\t\t\tcnt[cost[i][j][0]]++;\n\t\tfor (int i=0; i<n; i++) rev[i] = new int[cnt[i]][2];\n\t\tfor (int i=n-1; i>=0; i--) {\n\t\t\tfor (int j=0; j<cost[i].length; j++) {\n\t\t\t\tint ptr = --cnt[cost[i][j][0]];\n\t\t\t\trev[cost[i][j][0]][ptr][0] = i;\n\t\t\t\trev[cost[i][j][0]][ptr][1] = j;\n\t\t\t}\n\t\t}\n\n\t\tint mincost = 0;\n\t\tint[] h = new int[n];\n\n\t\tfinal int[] d = new int[n];\n\t\tTreeSet<Integer> que = new TreeSet<Integer>(new Comparator<Integer>(){\n\t\t\tpublic int compare(Integer a, Integer b) {\n\t\t\t\tif (d[a] != d[b]) return d[a] - d[b];\n\t\t\t\treturn a - b;\n\t\t\t}\n\t\t});\n\n\t\twhile (f > 0) {\n\t\t\tint[] prev = new int[n];\n\t\t\tint[] myidx = new int[n];\n\t\t\tArrays.fill(prev,-1); Arrays.fill(d,Integer.MAX_VALUE/2);\n\t\t\td[source] = 0;\n\t\t\tque.add(source);\n\n\t\t\twhile (!que.isEmpty()) {\n\t\t\t\tint cur = que.pollFirst();\n\t\t\t\tfor (int i=0; i<cost[cur].length; i++) {\n\t\t\t\t\tint to = cost[cur][i][0];\n\t\t\t\t\tif (capacity[cur][i][1] - flow[cur][i] > 0) {\n\t\t\t\t\t\tint c = d[cur] + cost[cur][i][1] + h[cur] - h[to];\n\t\t\t\t\t\tif (d[to] > c) {\n\t\t\t\t\t\t\tque.remove(to);\n\t\t\t\t\t\t\td[to] = c;\n\t\t\t\t\t\t\tprev[to] = cur;\n\t\t\t\t\t\t\tmyidx[to] = i;\n\t\t\t\t\t\t\tque.add(to);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor (int i=0; i<rev[cur].length; i++) {\n\t\t\t\t\tint to = rev[cur][i][0];\n\t\t\t\t\tint ridx = rev[cur][i][1];\n\t\t\t\t\tif (flow[to][ridx] > 0) {\n\t\t\t\t\t\tint c = d[cur] - cost[to][ridx][1] + h[cur] - h[to];\n\t\t\t\t\t\tif (d[to] > c) {\n\t\t\t\t\t\t\tque.remove(to);\n\t\t\t\t\t\t\td[to] = c;\n\t\t\t\t\t\t\tprev[to] = cur;\n\t\t\t\t\t\t\tmyidx[to] = ~ridx;\n\t\t\t\t\t\t\tque.add(to);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (prev[sink] == -1) break;\n\n\t\t\tint flowlimit = f;\n\t\t\tint sumcost = 0;\n\t\t\tfor (int i=sink; i!=source; i=prev[i]) {\n\t\t\t\tif (myidx[i] >= 0) {\n\t\t\t\t\tflowlimit = Math.min(flowlimit, capacity[prev[i]][myidx[i]][1] - flow[prev[i]][myidx[i]]);\n\t\t\t\t\tsumcost += cost[prev[i]][myidx[i]][1];\n\t\t\t\t}else {\n\t\t\t\t\tint idx = ~myidx[i];\n\t\t\t\t\tflowlimit = Math.min(flowlimit,flow[i][idx]);\n\t\t\t\t\tsumcost -= cost[i][idx][1];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmincost += flowlimit*sumcost;\n\t\t\tfor (int i=sink; i!=source; i=prev[i]) {\n\t\t\t\tif (myidx[i] >= 0) {\n\t\t\t\t\tflow[prev[i]][myidx[i]] += flowlimit;\n\t\t\t\t}else {\n\t\t\t\t\tint idx = ~myidx[i];\n\t\t\t\t\tflow[i][idx] -= flowlimit;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tf -= flowlimit;\n\t\t\tfor (int i=0; i<n; i++) h[i] += d[i];\n\t\t}\n\n\t\treturn f > 0 ? -1 : mincost;\n\t}\n\n\tstatic int[][][] directedGraph(int n, int[] from, int[] to, int[] cost) {\n\t\tint[] cnt = new int[n];\n\t\tfor (int i : from) cnt[i]++;\n\n\t\tint[][][] g = new int[n][][];\n\t\tfor (int i=0; i<n; i++) g[i] = new int[cnt[i]][2];\n\t\tfor (int i=0; i<from.length; i++) {\n\t\t\tint s = from[i];\n\t\t\tint t = to[i];\n\n\t\t\tg[s][--cnt[s]][0] = t;\n\t\t\tg[s][cnt[s]][1] = cost[i];\n\t\t}\n\n\t\treturn g;\n\t}\n\n\tstatic void solve() {\n\t\tint v = in.nextInt();\n\t\tint e = in.nextInt();\n\t\tint f = in.nextInt();\n\t\tint[] s = new int[e];\n\t\tint[] t = new int[e];\n\t\tint[] c = new int[e];\n\t\tint[] d = new int[e];\n\t\tfor (int i=0; i<e; i++) {\n\t\t\ts[i] = in.nextInt();\n\t\t\tt[i] = in.nextInt();\n\t\t\tc[i] = in.nextInt();\n\t\t\td[i] = in.nextInt();\n\t\t}\n\t\tint[][][] cost = directedGraph(v, s, t, d);\n\t\tint[][][] capacity = directedGraph(v, s, t, c);\n\t\tout.println(primalDual(cost, capacity, 0, v-1, f));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tdebug = args.length > 0;\n\t\tlong start = System.nanoTime();\n\n\t\tsolve();\n\t\tout.flush();\n\n\t\tlong end = System.nanoTime();\n\t\tdump((end - start) / 1000000 + \" ms\");\n\t\tin.close();\n\t\tout.close();\n\t}\n\n\tstatic void dump(Object... o) { if (debug) System.err.println(Arrays.deepToString(o)); }\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)\n#define ALL(v) (v).begin(),(v).end()\n#define CLR(t,v) memset(t,(v),sizeof(t))\ntemplate<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<\"(\"<<a.first<<\",\"<<a.second<< \")\";}\ntemplate<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<\" \";cout<<endl;}\ntemplate<class T>void chmin(T&a,const T&b){if(a>b)a=b;}\ntemplate<class T>void chmax(T&a,const T&b){if(a<b)a=b;}\n\nll nextLong() { ll x; scanf(\"%lld\", &x); return x;}\n\n\nconst int MAX_V = 20000+5;\nusing CAP = ll;\nusing COST = ll;\nconst ll INF = (ll)1e9;\n\nstruct State {\n COST dist;\n int pos;\n bool operator < (const State &o) const {\n return dist > o.dist; // reverse order\n }\n};\nstruct Edge{ int to; CAP cap; COST cost; int rev; };\nvector<Edge> adj[MAX_V];\nCOST potential[MAX_V];\nCOST dist[MAX_V];\nint prevv[MAX_V];\nint preve[MAX_V];\nvoid clearedge() { REP(i, MAX_V) adj[i].clear(); }\nvoid addedge(int u, int v, CAP cap, COST cost) {\n adj[u].push_back( (Edge){v, cap, cost, (int)adj[v].size() + (u == v)} );\n adj[v].push_back( (Edge){u, 0, -cost, (int)adj[u].size() - 1} );\n}\n\n// sからtへ流量 flow を流す最小コストを返す。\n// 流せない場合は INF を返す\nCOST mincost_maxflow(int s, int t, CAP flow) {\n vector<int> vs;\n REP(i, MAX_V) if (adj[i].size()) vs.push_back(i);\n int res = 0;\n for (int v : vs) potential[v] = 0;\n while (flow > 0) {\n for (int v : vs) dist[v] = INF;\n priority_queue<State> q;\n q.push({0, s});\n dist[s] = 0;\n while (!q.empty()) {\n State crt = q.top(); q.pop();\n if (dist[crt.pos] < crt.dist) continue;\n REP(i, adj[crt.pos].size()) {\n const Edge&e = adj[crt.pos][i];\n COST n_dist = crt.dist + e.cost + potential[crt.pos] - potential[e.to];\n if (e.cap > 0 && dist[e.to] > n_dist) {\n dist[e.to] = n_dist;\n prevv[e.to] = crt.pos;\n preve[e.to] = i;\n q.push({dist[e.to], e.to});\n }\n }\n }\n if (dist[t] == INF) return INF;\n for (int v : vs) potential[v] += dist[v];\n CAP f = flow;\n for (int v = t; v != s; v = prevv[v]) {\n f = min(f, adj[prevv[v]][preve[v]].cap);\n }\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = adj[prevv[v]][preve[v]];\n e.cap -= f;\n adj[v][e.rev].cap += f;\n }\n flow -= f;\n res += f * potential[t];\n }\n return res;\n}\n\nint main2() {\n int V = nextLong();\n int E = nextLong();\n int F = nextLong();\n\n clearedge();\n REP(i, E) {\n int a = nextLong();\n int b = nextLong();\n int c = nextLong();\n int d = nextLong();\n addedge(a, b, c, d);\n }\n ll ans = mincost_maxflow(0, V-1, F);\n if (ans == INF) ans = -1;\n cout << ans << endl;\n return 0;\n}\n\nint main() {\n\n#ifdef LOCAL\n for (;!cin.eof();cin>>ws)\n#endif\n main2();\n return 0;\n}\n", "#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<utility>\n#include<numeric>\n#include<iostream>\n#include<array>\n#include<string>\n#include<sstream>\n#include<stack>\n#include<queue>\n#include<list>\n#include<functional>\n#define _USE_MATH_DEFINES\n\n#include<math.h>\n#include<map>\n\n#define INF 200000000\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<ll, int> pli;\n\n#define VMAX 100\n\nstruct OwnEdge\n{\n\tint f, t, flow, cap,cost;\n\tOwnEdge(int f, int t, int flow, int cap,int cost) :f(f), t(t), flow(flow), cap(cap),cost(cost) {}\n};\n\nvector<OwnEdge> G[VMAX];\nint h[VMAX], tod[VMAX], prevv[VMAX], preve[VMAX];\n\nint solve(int n, int src, int dest, int F)\n{\n\tint ans = 0;\n\twhile (F > 0)\n\t{\n\t\tfill(tod, tod + VMAX, INF);\n\t\tpriority_queue<pii, vector<pii>, greater<pii>> pq;\n\t\ttod[src] = 0;\n\t\tpq.push(make_pair(0, src));\n\t\twhile (!pq.empty())\n\t\t{\n\t\t\tpii temp = pq.top();\n\t\t\tpq.pop();\n\t\t\tif (tod[temp.second] < temp.first)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int i = 0; i != G[temp.second].size(); i++)\n\t\t\t{\n\t\t\t\tif (G[temp.second][i].cap <= G[temp.second][i].flow)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (tod[G[temp.second][i].t] + h[G[temp.second][i].t]>tod[temp.second] + h[temp.second] + G[temp.second][i].cost)\n\t\t\t\t{\n\t\t\t\t\ttod[G[temp.second][i].t] = tod[temp.second] + h[temp.second] + G[temp.second][i].cost - h[G[temp.second][i].t];\n\t\t\t\t\tprevv[G[temp.second][i].t] = temp.second;\n\t\t\t\t\tpreve[G[temp.second][i].t] = i;\n\t\t\t\t\tpq.push(make_pair(tod[G[temp.second][i].t], G[temp.second][i].t));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (tod[dest] == INF)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\th[i] += tod[i];\n\t\t}\n\t\tint td = F;\n\t\tfor (int i = dest; i != src; i = prevv[i])\n\t\t{\n\t\t\ttd = min(td, G[prevv[i]][preve[i]].cap - G[prevv[i]][preve[i]].flow);\n\t\t}\n\t\tF -= td;\n\t\tans += td*h[dest];\n\t\tfor (int i = dest; i != src; i = prevv[i])\n\t\t{\n\t\t\tG[prevv[i]][preve[i]].flow += td;\n\t\t\tG[i][G[prevv[i]][preve[i]].f].flow -= td;\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint V, E, F;\n\tcin >> V >> E >> F;\n\n\tfor (int i = 0; i < E; i++)\n\t{\n\t\tint u, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\n\t\tint tus = G[u].size(), tvs = G[v].size();\n\n\t\tG[u].push_back(OwnEdge(tvs, v, 0, c, d));\n\t\tG[v].push_back(OwnEdge(tus, u, c, c, -d));\n\t}\n\n\tcout << solve(V, 0, V - 1, F) << endl;\n\n\treturn 0;\n}\n", "#include <bits/stdc++.h>\n#define pb push_back\nusing namespace std;\nconst int INF=0x3f3f3f3f;\nconst int maxn=105;\nconst int maxq=1005;\n\nstruct edge{int to,cap,cost,rev;};\n\nint n,m,k;\nint d[maxn];\nint a[maxn];\nint p1[maxn];\nint p2[maxn];\nbool inq[maxn];\nvector<edge>G[maxn];\n\nvoid add_edge(int u,int v,int c,int w) {\n\tG[u].pb(edge{v,c,w,int(G[v].size())});\n\tG[v].pb(edge{u,0,-w,int(G[u].size()-1)});\n}\n\nint mcmf(int s,int t) {\n\tint flow=0 , cost=0;\n\twhile (1) {\n\t\tmemset(d,0x3f,sizeof(d));\n\t\td[s]=0; a[s]=max(0,k-flow);\n\t\tint qh=0,qt=0,q[maxq];\n\t\tq[qt++]=s; inq[s]=1;\n\t\twhile (qh<qt) {\n\t\t\tint u=q[qh++];\n\t\t\tinq[u]=0;\n\t\t\tfor (int i=0;i<G[u].size();i++) {\n\t\t\t\tedge e=G[u][i];\n\t\t\t\tif (d[e.to]>d[u]+e.cost && e.cap) {\n\t\t\t\t\td[e.to]=d[u]+e.cost;\n\t\t\t\t\ta[e.to]=min(a[u],e.cap);\n\t\t\t\t\tp1[e.to]=u;\n\t\t\t\t\tp2[e.to]=i;\n\t\t\t\t\tif (!inq[e.to]) {\n\t\t\t\t\t\tq[qt++]=e.to;\n\t\t\t\t\t\tinq[e.to]=1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (d[t]==INF || !a[t]) break;\n\t\tflow+=a[t];\n\t\tcost+=a[t]*d[t];\n\t\tfor (int v=t;v!=s;v=p1[v]) {\n\t\t\tint u=p1[v] , i=p2[v];\n\t\t\tG[u][i].cap-=a[t];\n\t\t\ti=G[u][i].rev;\n\t\t\tG[v][i].cap+=a[t];\n\t\t}\n\t}\n\tif (flow<k) return -1;\n\telse return cost;\n}\n\nint main() {\n\tcin>>n>>m>>k;\n\tfor (int i=0;i<m;i++) {\n\t\tint u,v,c,w; cin>>u>>v>>c>>w;\n\t\tadd_edge(u,v,c,w);\n\t}\n\tcout<<mcmf(0,n-1)<<'\\n';\n}\n\n", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\nusing namespace std;\n#define MAX_V 10000\n#define INF 1000000001\ntypedef pair<int,int> P;\n\nstruct edge { int to,cap,cost,rev; };\n\nint V;\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n\nvoid init_edge(){\n for(int i=0;i<V;i++)G[i].clear();\n}\n\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].push_back((edge){to,cap,cost,(int)G[to].size()});\n G[to].push_back((edge){from,0,-cost,(int)G[from].size()-1});\n}\n\nint min_cost_flow(int s,int t,int f){\n int res = 0;\n fill(h,h+V,0);\n while(f>0){\n\n priority_queue< P, vector<P>, greater<P> > que;\n fill( dist, dist+V , INF );\n dist[s]=0;\n que.push(P(0,s));\n while(!que.empty()){\n P p = que.top(); que.pop();\n int v = p.second;\n if(dist[v]<p.first)continue;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(P(dist[e.to],e.to));\n }\n }\n }\n\n if(dist[t]==INF){\n return -1;\n }\n for(int v=0;v<V;v++)h[v]+=dist[v];\n\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main(){\n int E,F,a,b,c,d;\n cin>>V>>E>>F;\n while(E--){\n cin>>a>>b>>c>>d;\n add_edge(a,b,c,d);\n }\n cout<<min_cost_flow(0,V-1,F)<<endl;\n return 0;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define all(x) x.begin(), x.end()\n#define mp make_pair\n#define pii pair<int, int>\n#define pll pair<long long, long long>\n#define ll long long\n\nstatic const int INF = 0x3f3f3f3f;\n\nstruct edge {\n int to, cap, cost, rev;\n};\nint V;\nvector<edge> g[101010];\nint dist[101010];\nint prevv[101010];\nint preve[101010];\nvoid add_edge(int from, int to, int cap, int cost) {\n g[from].push_back((edge) { to, cap, cost, (int)g[to].size() });\n g[to].push_back((edge) { from, 0, -cost, (int)g[from].size() - 1 });\n}\nint MinCostFlow(int s, int t, int f) {\n int res = 0;\n while (f > 0) {\n fill(dist, dist + V, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n for (int v = 0; v < V; v ++) {\n if (dist[v] == INF) continue;\n for (int i = 0; i < g[v].size(); i ++) {\n edge &e = g[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n if (dist[t] == INF) return -1;\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, g[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main() {\n int v, e, f;\n scanf(\"%d%d%d\", &v, &e, &f);\n V = v;\n for (int i = 0; i < e; i ++) {\n int u, v, c, d;\n scanf(\"%d%d%d%d\", &u, &v, &c, &d);\n add_edge(u, v, c, d);\n }\n printf(\"%d\\n\", MinCostFlow(0, V - 1, f));\n return 0;\n}", "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nclass minCostFlow\n{\n using type = int;\n using pii = std::pair<int, int>;\n const int INF = 1e9;\n struct Edge\n {\n type to, cap, cost, rev;\n Edge(type to_, type cap_, type cost_, type rev_)\n : to(to_), cap(cap_), cost(cost_), rev(rev_) {}\n };\n int V;\n std::vector<std::vector<Edge>> G;\n // ポテンシャル\n std::vector<int> h;\n // 最短距離\n std::vector<int> dist;\n // 直前の頂点, 辺\n std::vector<int> prevv, preve;\n\n public:\n minCostFlow(int _V) : V(_V), G(_V), h(_V), dist(_V), prevv(_V), preve(_V) {}\n void add(int from, int to, int cap, int cost)\n {\n G[from].push_back(Edge(to, cap, cost, G[to].size()));\n G[to].push_back(Edge(from, 0, -cost, G[from].size() - 1));\n }\n int calc(int s, int t, int f)\n {\n int res = 0;\n fill(h.begin(), h.end(), 0);\n while (f > 0)\n {\n std::priority_queue<pii, std::vector<pii>, std::greater<pii>> que;\n fill(dist.begin(), dist.end(), INF);\n dist[s] = 0;\n que.push(pii(0, s));\n while (!que.empty())\n {\n pii p = que.top();\n que.pop();\n int v = p.second;\n if (dist[v] < p.first)\n continue;\n for (size_t i = 0; i < G[v].size(); i++)\n {\n Edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to])\n {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(pii(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INF)\n return -1;\n for (int v = 0; v < V; v++)\n h[v] += dist[v];\n int d = f;\n for (int v = t; v != s; v = prevv[v])\n {\n d = std::min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v])\n {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int V, E, F;\n cin >> V >> E >> F;\n minCostFlow mcf(V);\n while (E--)\n {\n int st, gt, cap, d;\n cin >> st >> gt >> cap >> d;\n mcf.add(st, gt, cap, d);\n }\n cout << mcf.calc(0, V - 1, F) << endl;\n}\n\n", "#include <bits/stdc++.h>\n#define pb push_back\nusing namespace std;\nconst int INF=0x3f3f3f3f;\nconst int maxn=105;\n\nstruct edge{int to,cap,cost,rev;};\n\nint n,m,k;\nint d[maxn];\nint a[maxn];\nint p1[maxn];\nint p2[maxn];\nbool inq[maxn];\nvector<edge>G[maxn];\n\nvoid add_edge(int u,int v,int c,int w) {\n\tG[u].pb(edge{v,c,w,int(G[v].size())});\n\tG[v].pb(edge{u,0,-w,int(G[u].size()-1)});\n}\n\nint mcmf(int s,int t) {\n\tint flow=0 , cost=0;\n\twhile (1) {\n\t\tmemset(d,0x3f,sizeof(d));\n\t\td[s]=0; a[s]=max(0,k-flow);\n\t\tint qh=0,qt=0,q[maxn];\n\t\tq[qt++]=s; inq[s]=1;\n\t\twhile (qh!=qt) {\n\t\t\tint u=q[qh++]; if (qh>=maxn) qh=0;\n\t\t\tinq[u]=0;\n\t\t\tfor (int i=0;i<G[u].size();i++) {\n\t\t\t\tedge e=G[u][i];\n\t\t\t\tif (d[e.to]>d[u]+e.cost && e.cap) {\n\t\t\t\t\td[e.to]=d[u]+e.cost;\n\t\t\t\t\ta[e.to]=min(a[u],e.cap);\n\t\t\t\t\tp1[e.to]=u;\n\t\t\t\t\tp2[e.to]=i;\n\t\t\t\t\tif (!inq[e.to]) {\n\t\t\t\t\t\tq[qt++]=e.to; if (qt>=maxn) qt=0;\n\t\t\t\t\t\tinq[e.to]=1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (d[t]==INF || !a[t]) break;\n\t\tflow+=a[t];\n\t\tcost+=a[t]*d[t];\n\t\tfor (int u=t;u!=s;u=p1[u]) {\n\t\t\tedge& e=G[p1[u]][p2[u]];\n\t\t\te.cap-=a[t];\n\t\t\tG[e.to][e.rev].cap+=a[t];\n\t\t}\n\t}\n\tif (flow<k) return -1;\n\telse return cost;\n}\n\nint main() {\n\tcin>>n>>m>>k;\n\tfor (int i=0;i<m;i++) {\n\t\tint u,v,c,w; cin>>u>>v>>c>>w;\n\t\tadd_edge(u,v,c,w);\n\t}\n\tcout<<mcmf(0,n-1)<<'\\n';\n}\n\n", "// this program implements Dinitz's algorithm\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <algorithm>\n\nconst int N = 110;\nconst int M = 2010;\nconst int inf = 0x3fffffff;\n\nstruct Edge {\n\tint to, cap, cost, next;\n} es[M];\n\nint S, T; // source, sink\nint SIZE = 0; // number of edges\nint h[N]; // pointer to edge list\nint dist[N], queue[N], inq[N]; // for calculating shortest path\nint prev[N];\n\n// add forward and backtracked edge\nvoid add(int u, int v, int cap, int cost) {\n\tint i = SIZE++;\n\tes[i].to = v;\n\tes[i].cap = cap;\n\tes[i].cost = cost;\n\tes[i].next = h[u];\n\th[u] = i; \n\tint j = SIZE++;\n\tes[j].to = u;\n\tes[j].cap = 0;\n\tes[j].cost = -cost;\n\tes[j].next = h[v];\n\th[v] = j; \n}\n\n// returns whether find a shortest path from S to T\nbool sssp(int n) {\n\tint front = 0, back = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tdist[i] = inf;\n\t\tinq[i] = 0;\n\t}\n\tqueue[back++] = S;\n\tdist[S] = 0;\n\twhile (front != back) {\n\t\tint x = queue[front++];\n\t\tif (front == N) front = 0;\n\t\tinq[x] = 0;\n\t\tfor (int i = h[x]; i != -1; i = es[i].next)\n\t\t\tif (es[i].cap > 0) {\n\t\t\t\tint y = es[i].to;\n\t\t\t\tint new_d = dist[x] + es[i].cost;\n\t\t\t\tif (new_d < dist[y]) {\n\t\t\t\t\tdist[y] = new_d;\n\t\t\t\t\tprev[y] = x;\n\t\t\t\t\tif (!inq[y]) {\n\t\t\t\t\t\tqueue[back++] = y;\n\t\t\t\t\t\tif (back == N) back = 0;\n\t\t\t\t\t\tinq[y] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t}\n\treturn (dist[T] < inf);\n}\n\n// returns the flow pushed from x to T\nint dfs(int x, int flow) {\n\tif (x == T) return flow;\n\tint ret = 0;\n\tfor (int i = h[x]; i != -1 && flow > 0; i = es[i].next) {\n\t\tint y = es[i].to;\n\t\tif (prev[y] != x) continue;\n\t\tint f = dfs(y, std::min(flow, es[i].cap));\n\t\tif (f != 0) {\n\t\t\tes[i].cap -= f;\n\t\t\tes[i^1].cap += f;\n\t\t\tret += f;\n\t\t\tflow -= f;\n\t\t}\n\t}\n\treturn ret;\n}\n\nvoid run() {\n\tint n, m, u, v, c, d, flow, cost = 0;\n\tscanf(\"%d%d%d\", &n, &m, &flow);\n\tmemset(h, -1, sizeof(h));\n\tS = 0, T = n - 1;\n\tfor (int i = 0; i < m; i++) {\n\t\tscanf(\"%d%d%d%d\", &u, &v, &c, &d);\n\t\tadd(u, v, c, d);\n\t}\n\twhile (flow > 0 && sssp(n)) {\n\t\tint f = dfs(S, flow);\n\t\tcost += f * dist[T];\n\t\tflow -= f;\n\t}\n\tif (flow > 0)\n\t\tprintf(\"-1\\n\");\n\telse\n\t\tprintf(\"%d\\n\", cost);\n}\n\nint main() {\n\trun();\n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100\n\ntypedef pair<int,int> P;\n\n\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_cost,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\tcost = arg_cost;\n\t\trev_index = arg_rev_index;\n\t}\n\n\tint to,capacity,cost,rev_index;\n};\n\nint V;\nvector<Edge> G[NUM];\nint h[NUM];\nint dist[NUM];\nint pre_node[NUM],pre_edge[NUM];\n\nvoid add_edge(int from,int to,int capacity,int cost){\n\tG[from].push_back(Edge(to,capacity,cost,G[to].size()));\n\tG[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n}\n\nint min_cost_flow(int source,int sink,int flow){\n\tint ret = 0;\n\tfor(int i = 0; i < V; i++)h[i] = 0;\n\twhile(flow > 0){\n\t\tpriority_queue<P,vector<P>,greater<P> > Q;\n\t\tfor(int i = 0; i < V; i++)dist[i] = BIG_NUM;\n\t\tdist[source] = 0;\n\t\tQ.push(P(0,source));\n\n\t\twhile(!Q.empty()){\n\t\t\tP p = Q.top();\n\t\t\tQ.pop();\n\t\t\tint node_id = p.second;\n\t\t\tif(dist[node_id] < p.first)continue;\n\t\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\t\tEdge &e = G[node_id][i];\n\t\t\t\tif(e.capacity > 0 && dist[e.to] > dist[node_id]+e.cost+h[node_id]-h[e.to]){\n\t\t\t\t\tdist[e.to] = dist[node_id]+e.cost+h[node_id]-h[e.to];\n\t\t\t\t\tpre_node[e.to] = node_id;\n\t\t\t\t\tpre_edge[e.to] = i;\n\t\t\t\t\tQ.push(P(dist[e.to],e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(dist[sink] == BIG_NUM){\n\t\t\treturn -1;\n\t\t}\n\n\t\tfor(int node_id = 0; node_id < V; node_id++)h[node_id] += dist[node_id];\n\n\t\tint tmp_flow = flow;\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\ttmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\n\t\t}\n\t\tflow -= tmp_flow;\n\t\tret += tmp_flow*h[sink];\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\tEdge &e = G[pre_node[node_id]][pre_edge[node_id]];\n\t\t\te.capacity -= tmp_flow;\n\t\t\tG[node_id][e.rev_index].capacity += tmp_flow;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main(){\n\n\tint E,F;\n\tscanf(\"%d %d %d\",&V,&E,&F);\n\n\tint from,to,capacity,cost;\n\tfor(int loop = 0; loop < E; loop++){\n\t\tscanf(\"%d %d %d %d\",&from,&to,&capacity,&cost);\n\t\tadd_edge(from,to,capacity,cost);\n\t}\n\n\tprintf(\"%d\\n\", min_cost_flow(0,V-1,F));\n\n\treturn 0;\n}\n\n", "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable{\n private ArrayList<ArrayList<Integer>> graph;\n private Edge[] edges;\n public static void main(String[] args) throws Exception {\n new Thread(null, new Main(), \"bridge\", 16 * 1024 * 1024).start();\n }\n\n @Override\n public void run() {\n try {\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n private void solve() throws Exception{\n FastScanner scanner = new FastScanner(System.in);\n\n int V = scanner.nextInt();\n int E = scanner.nextInt();\n int F = scanner.nextInt();\n\n graph = new ArrayList<>(V);\n edges = new Edge[E * 2];\n for(int i = 0; i < V; ++i){\n graph.add(new ArrayList<Integer>());\n }\n\n int edgeSize = 0;\n for(int i = 0; i < E; ++i){\n int u = scanner.nextInt();\n int v = scanner.nextInt();\n int cap = scanner.nextInt();\n int cost = scanner.nextInt();\n\n edges[edgeSize++] = new Edge(v, 0, cap, cost);\n edges[edgeSize++] = new Edge(u, 0, 0, -cost);\n graph.get(u).add(edgeSize - 2);\n graph.get(v).add(edgeSize - 1);\n }\n\n costOfMaxFlow(F, 0, V - 1);\n }\n\n private void costOfMaxFlow(int F, int s, int t){\n int V = graph.size();\n int[] dist = new int[V];\n int[] curFlow = new int[V];\n int[] prevNode = new int[V];\n int[] prevEdge = new int[V];\n\n int totalFlow = 0;\n int totalCost = 0;\n\n while(totalFlow < F){\n BellmanFord(s, dist, prevNode, prevEdge, curFlow);\n if(dist[t] == Integer.MAX_VALUE){\n break;\n }\n\n int pathFlow = Math.min(curFlow[t], F - totalFlow);\n totalFlow += pathFlow;\n\n for(int v = t; v != s; v = prevNode[v]){\n Edge edge = edges[prevEdge[v]];\n totalCost += edge.cost * pathFlow;\n\n edge.flow += pathFlow;\n edges[prevEdge[v] ^ 1].flow -= pathFlow;\n }\n }\n\n if(totalFlow < F){\n System.out.println(\"-1\");\n }\n else{\n System.out.println(totalCost);\n }\n }\n\n private void BellmanFord(int s, int[] dist, int[] prevNode, int[] prevEdge, int[] curFlow){\n Arrays.fill(dist, Integer.MAX_VALUE);\n dist[s] = 0;\n curFlow[s] = Integer.MAX_VALUE;\n prevNode[s] = -1;\n prevEdge[s] = -1;\n\n LinkedList<Integer> queue = new LinkedList<>();\n queue.add(s);\n\n while(!queue.isEmpty()){\n Integer u = queue.poll();\n\n for(int edgeIndex : graph.get(u)){\n Edge edge = edges[edgeIndex];\n if(edge.flow >= edge.cap){\n continue;\n }\n\n if(dist[edge.v] > dist[u] + edge.cost){\n dist[edge.v] = dist[u] + edge.cost;\n prevNode[edge.v] = u;\n prevEdge[edge.v] = edgeIndex;\n curFlow[edge.v] = Math.min(curFlow[u], edge.cap - edge.flow);\n queue.add(edge.v);\n }\n }\n }\n }\n\n static class Edge{\n int v;\n int flow;\n int cap;\n int cost;\n\n public Edge(int v, int flow, int cap, int cost){\n this.v = v;\n this.flow = flow;\n this.cap = cap;\n this.cost = cost;\n }\n }\n\n static class FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024 * 8];\n private int ptr = 0;\n private int buflen = 0;\n\n public FastScanner(InputStream in){\n this.in = in;\n }\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n public boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}", "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\n\n\n\n#define ZERO(a) memset(a,0,sizeof(a))\ntemplate<int NV, class V> class MinCostFlow {\npublic:\n\tstruct edge {\n\t\tint to, capacity; V cost; int reve;\n\t\tedge(int a, int b, V c, int d) {\n\t\t\tto = a; capacity = b; cost = c; reve = d;\n\t\t}\n\t};\n\tvector<edge> E[NV];\n\tint prev_v[NV], prev_e[NV]; V dist[NV];\n\tvoid add_edge(int x, int y, int cap, V cost) {\n\t\tE[x].push_back(edge(y, cap, cost, (int)E[y].size()));\n\t\tE[y].push_back(edge(x, 0, -cost, (int)E[x].size() - 1)); /* rev edge */\n\t}\n\n\tV mincost(int from, int to, int flow) {\n\t\tV res = 0; int i, v;\n\t\tZERO(prev_v); ZERO(prev_e);\n\t\twhile (flow>0) {\n\t\t\tfill(dist, dist + NV, numeric_limits<V>::max() / 2);\n\t\t\tdist[from] = 0;\n\t\t\tpriority_queue<pair<int, int> > Q;\n\t\t\tQ.push(make_pair(0, from));\n\t\t\twhile (Q.size()) {\n\t\t\t\tint d = -Q.top().first, cur = Q.top().second;\n\t\t\t\tQ.pop();\n\t\t\t\tif (dist[cur] != d) continue;\n\t\t\t\tif (d == numeric_limits<V>::max() / 2) break;\n\t\t\t\trep(i, 0, E[cur].size()) {\n\t\t\t\t\tedge &e = E[cur][i];\n\t\t\t\t\tif (e.capacity>0 && dist[e.to]>d + e.cost) {\n\t\t\t\t\t\tdist[e.to] = d + e.cost;\n\t\t\t\t\t\tprev_v[e.to] = cur;\n\t\t\t\t\t\tprev_e[e.to] = i;\n\t\t\t\t\t\tQ.push(make_pair(-dist[e.to], e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (dist[to] == numeric_limits<V>::max() / 2) return -1;\n\t\t\tint lc = flow;\n\t\t\tfor (v = to; v != from; v = prev_v[v]) lc = min(lc, E[prev_v[v]][prev_e[v]].capacity);\n\t\t\tflow -= lc;\n\t\t\tres += lc*dist[to];\n\t\t\tfor (v = to; v != from; v = prev_v[v]) {\n\t\t\t\tedge &e = E[prev_v[v]][prev_e[v]];\n\t\t\t\te.capacity -= lc;\n\t\t\t\tE[v][e.reve].capacity += lc;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\n//-----------------------------------------------------------------\ntypedef long long ll;\nint NV, NE, F;\n//-----------------------------------------------------------------\nint main()\n{\n\tMinCostFlow<100, ll> flow;\n\n\tcin >> NV >> NE >> F;\n\n\trep(i, 0, NE) {\n\t\tint a, b, c, d;\n\t\tcin >> a >> b >> c >> d;\n\t\tflow.add_edge(a, b, c, d);\n\t}\n\n\tcout << flow.mincost(0, NV - 1, F) << endl;\n}", "#include<bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb push_back\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\ntemplate<class A,class B>\nostream& operator<<(ostream& ost,const pair<A,B>&p){\n\tost<<\"{\"<<p.first<<\",\"<<p.second<<\"}\";\n\treturn ost;\n}\n\ntemplate<class T>\nostream& operator<<(ostream& ost,const vector<T>&v){\n\tost<<\"{\";\n\tfor(int i=0;i<v.size();i++){\n\t\tif(i)ost<<\",\";\n\t\tost<<v[i];\n\t}\n\tost<<\"}\";\n\treturn ost;\n}\n\nstruct PrimalDual{\n using F=long long;\n const F INF=1ll<<50;\n \n struct Edge{\n int to;\n F cap,cost;\n int rev;\n Edge(int to,F cap,F cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n };\n \n int n;\n vector<vector<Edge>>G;\n\n PrimalDual(int n):n(n),G(n){}\n\n void addEdge(int from,int to,F cap,F cost){\n G[from].push_back(Edge(to,cap,cost,G[to].size()));\n G[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n }\n\n\n F minCostFlow(int s,int t,F f){\n F cur=0;\n\n vector<F>h(n);\n vector<int>prevv(n,-1),preve(n,-1);\n vector<F>dist(n);\n priority_queue<pair<F,int>,vector<pair<F,int>>,greater<pair<F,int>>>que;\n \n while(f>0){\n fill(dist.begin(),dist.end(),INF);\n dist[s]=0;\n que.emplace(0,s); \n while(que.size()){\n F d;\n int v;\n tie(d,v)=que.top();\n que.pop();\n if(dist[v]<d)continue;\n for(int i=0;i<G[v].size();i++){\n Edge &e=G[v][i];\n F nd=dist[v]+e.cost+h[v]-h[e.to];\n if(e.cap>0&&dist[e.to]>nd){\n dist[e.to]=nd;\n prevv[e.to]=v;preve[e.to]=i;\n que.emplace(nd,e.to);\n }\n }\n }\n if(dist[t]==INF)return -1;\n for(int v=0;v<n;v++)h[v]+=dist[v];\n F nf=f;\n for(int v=t;v!=s;v=prevv[v]){\n nf=min(nf,G[prevv[v]][preve[v]].cap);\n }\n f-=nf;\n cur+=nf*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n Edge &e=G[prevv[v]][preve[v]];\n e.cap-=nf;\n G[v][e.rev].cap+=nf;\n }\n }\n return cur;\n }\n};\n\n\nsigned main(){\n int V,E,F;\n scanf(\"%d%d%d\",&V,&E,&F);\n PrimalDual pd(V);\n rep(i,E){\n int a,b,c,d;\n scanf(\"%d%d%d%d\",&a,&b,&c,&d);\n pd.addEdge(a,b,c,d);\n }\n printf(\"%d\\n\",(int)pd.minCostFlow(0,V-1,F));\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst LL MOD = 1e9+7;\nconst int INF = 1e9;\n\n// ????°??????¨???\nstruct EdgeC{\n int to, cap, cost, rev;\n EdgeC(int to_=0, int cap_ = 0, int cost_ = 0, int rev_ = 0)\n\t:to(to_), cap(cap_), cost(cost_), rev(rev_){}\n};\nusing GraphC = vector<vector<EdgeC>>;\nvoid add_edge(GraphC& G, int from, int to, int cap, int cost){\n G[from].emplace_back(to, cap, cost, G[to].size());\n G[to].emplace_back(from, 0, -cost, G[from].size()-1);\n}\n\n/**\n * ?????????????????????????????????\n * O(FVE)\n * ?§????s, ??????t, ?????????f ???????°??????¨?????? ?????¨??????????????°-INF\n */\nint min_cost_flow(GraphC& G, int s, int t, int f){\n int V = G.size();\n vector<int> dist(V);\n vector<int> prevv(V), preve(V);\n int res = 0;\n \n while(f > 0){\n\tfill(begin(dist), end(dist), INF);\n\tdist[s] = 0;\n\tbool update = true;\n\twhile(update){\n\t update = false;\n\t for(int v=0;v<V;++v){\n\t\tif(dist[v] == INF) continue;\n\t\tfor(unsigned int i=0;i<G[v].size();++i){\n\t\t auto& e = G[v][i];\n\t\t if(e.cap > 0 && dist[v] + e.cost < dist[e.to]){\n\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\tprevv[e.to] = v;\n\t\t\tpreve[e.to] = i;\n\t\t\tupdate = true;\n\t\t }\n\t\t}\n\t }\n\t}\n\tif(dist[t] == INF) return -INF;\n\n\tint d = f;\n\tfor(int v=t;v!=s;v=prevv[v])\n\t d = min(d, G[prevv[v]][preve[v]].cap);\n\n\tf -= d;\n\tres += d * dist[t];\n\tfor(int v=t;v!=s;v=prevv[v]){\n\t auto& e = G[prevv[v]][preve[v]];\n\t e.cap -= d;\n\t G[v][e.rev].cap += d;\n\t}\n }\n \n return res;\n}\n\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n int V, E, F;\n cin >> V >> E >> F;\n GraphC G(V);\n REP(i,E){\n\tint u, v, c, d;\n\tcin >> u >> v >> c >> d;\n\tadd_edge(G, u, v, c, d);\n }\n int res = min_cost_flow(G, 0, V-1, F);\n cout << (res==-INF?-1:res) << endl;\n\n return 0;\n}", "/*\n負の閉路が存在しない場合に使える\nO(FElogV)\n\n参考:\n蟻本p202\nhttps://ei1333.github.io/luzhiled/snippets/graph/primal-dual.html\n\nverify:\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B&lang=jp\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename flow_t,typename cost_t>\nstruct PrimalDual{\n struct edge{\n int to;\n flow_t cap;\n cost_t cost;\n int rev;\n bool isrev;\n };\n const cost_t inf;\n\n vector<vector<edge>> g;\n vector<cost_t> h,dist;\n vector<int> prevv,preve;\n\n PrimalDual(int N,cost_t inf_):g(N),inf(inf_){}\n\n void add_edge(int from,int to,flow_t cap,cost_t cost){\n g[from].emplace_back((edge){to,cap,cost,(int)g[to].size(),false});\n g[to].emplace_back((edge){from,0,-cost,(int)g[from].size()-1,true});\n }\n\n //fを流すのが不可能だったらinfを返す\n cost_t query(int s,int t,flow_t f){\n int N=g.size();\n cost_t ret=0;\n using pci=pair<cost_t,int>;\n priority_queue<pci,vector<pci>,greater<pci>> que;\n h.assign(N,0);\n preve.assign(N,-1);\n prevv.assign(N,-1);\n\n while(f>0){\n dist.assign(N,inf);\n que.emplace(0,s);\n dist[s]=0;\n while(!que.empty()){\n pci now=que.top(); que.pop();\n if(dist[now.second]<now.first) continue;\n for(int i=0;i<g[now.second].size();i++){\n const edge &e=g[now.second][i];\n cost_t nextCost=dist[now.second]+e.cost+h[now.second]-h[e.to];\n if(e.cap>0 and dist[e.to]>nextCost){\n dist[e.to]=nextCost;\n prevv[e.to]=now.second; preve[e.to]=i;\n que.emplace(nextCost,e.to);\n }\n }\n }\n \n if(dist[t]==inf) return inf;\n for(int v=0;v<N;v++) h[v]+=dist[v];\n \n flow_t addflow=f;\n for(int v=t;v!=s;v=prevv[v]){\n addflow=min(addflow,g[prevv[v]][preve[v]].cap);\n }\n f-=addflow;\n ret+=addflow*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e=g[prevv[v]][preve[v]];\n e.cap-=addflow;\n g[v][e.rev].cap+=addflow;\n }\n }\n return ret;\n }\n};\n\nint main(){\n int N,E,F;\n cin>>N>>E>>F;\n PrimalDual<int,int> flow(N,1<<30);\n for(int i=0;i<E;i++){\n int s,t,cap,cost;\n cin>>s>>t>>cap>>cost;\n flow.add_edge(s,t,cap,cost);\n }\n int x=flow.query(0,N-1,F);\n if(x==(1<<30)) x=-1;\n cout<<x<<\"\\n\";\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#ifdef DEBUG_MODE\n\t#define DBG(n) n;\n#else\n\t#define DBG(n) ;\n#endif\n#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)\n#define PB push_back\n#define MP make_pair\n#define FI first\n#define SE second\n#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;}\n#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}\n#define ALL(v) v.begin(),v.end()\n#define Decimal fixed<<setprecision(20)\n#define INF 1000000000\n#define LLINF 1000000000000000000LL\n#define MOD 1000000007\n\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n\nclass minCostFlow {\n\n\tstruct edge { int to, cap, cost, rev; };\n\n\tint V;\n\tvector<vector<edge>> G;\n\tvector<int> dist;\n\tvector<int> prevv;\n\tvector<int> preve;\n\npublic:\n\n\tminCostFlow(int n): G(n+10), dist(n+10), prevv(n+10), preve(n+10), V(n){\n\t}\n\n\tvoid addEdge(int from, int to, int cap, int cost) {\n\t\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\t\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n\t}\n\n\tint solve(int s, int t, int f) {\n\t\tint ret = 0;\n\t\twhile(f > 0) {\n\t\t\tfill(dist.begin(), dist.end(), INF);\n\t\t\tdist[s] = 0;\n\t\t\tbool update = true;\n\t\t\twhile(update) {\n\t\t\t\tupdate = false;\n\t\t\t\tfor(int v = 0;v < V;v++) {\n\t\t\t\t\tif(dist[v] == INF)continue;\n\t\t\t\t\tfor(int i = 0;i < G[v].size();i++) {\n\t\t\t\t\t\tedge &e = G[v][i];\n\t\t\t\t\t\tif(e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(dist[t] == INF) {\n\t\t\t\treturn -1;//流せない\n\t\t\t}\n\n\t\t\tint d = f;\n\t\t\tfor(int v = t;v != s;v = prevv[v]) {\n\t\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= d;\n\t\t\tret += d * dist[t];\n\t\t\tfor(int v = t;v != s;v = prevv[v]) {\n\t\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tG[v][e.rev].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n};\n\nint main(){\n\n\tint v,e,f;cin >> v >> e >> f;\n\tminCostFlow mcf(v);\n\n\tREP(i,e) {\n\t\tint a,b,c,d;cin >> a >> b >> c >> d;\n\t\tmcf.addEdge(a, b , c, d);\n\t}\n\n\tcout << mcf.solve(0, v-1, f) << endl;\n\n\treturn 0;\n}\n\n", "#include <iostream>\n#include <vector>\n#include <limits>\n\ntemplate <class Cap, class Cost, bool isDirect>\nclass MinCostFlow {\n struct Edge {\n int from, to;\n Cap cap;\n Cost cost;\n int rev;\n Edge(int from, int to, Cap cap, Cost cost, int rev)\n : from(from), to(to), cap(cap), cost(cost), rev(rev){};\n };\n\n class Graph {\n public:\n int size;\n std::vector<std::vector<Edge>> path;\n\n explicit Graph(int N = 0) : size(N), path(size) {}\n void span(int from, int to, Cap cap, Cost cost, int rev) {\n path[from].push_back(Edge(from, to, cap, cost, rev));\n }\n std::vector<Edge>& operator[](int v) { return path[v]; }\n };\n\npublic:\n const Cost INF = std::numeric_limits<Cost>::max();\n Graph graph;\n std::vector<Cost> dist;\n std::vector<Edge*> rev;\n\n explicit MinCostFlow(int N) : graph(N), dist(N), rev(N) {}\n\n void span(int from, int to, Cap cap, Cost cost) {\n graph.span(from, to, cap, cost, graph[to].size());\n graph.span(to, from, (isDirect ? 0 : cap), -cost, graph[from].size() - 1);\n }\n\n void BellmanFord(int s) {\n fill(dist.begin(), dist.end(), INF);\n dist[s] = 0;\n\n bool update = true;\n while (update) {\n update = false;\n for (int v = 0; v < graph.size; ++v) {\n if (dist[v] == INF) continue;\n for (auto& e : graph[v]) {\n if (e.cap > 0 && dist[e.to] > dist[e.from] + e.cost) {\n dist[e.to] = dist[e.from] + e.cost;\n rev[e.to] = &e;\n update = true;\n }\n }\n }\n }\n }\n\n Cost exec(int s, int g, Cap flow) {\n Cost ret = 0;\n\n while (flow > 0) {\n BellmanFord(s);\n if (dist[g] == INF) break;\n\n Cap f = flow;\n int v = g;\n while (v != s) {\n f = std::min(f, rev[v]->cap);\n v = rev[v]->from;\n }\n flow -= f;\n ret += f * dist[g];\n\n v = g;\n while (v != s) {\n // rev[v]->to = v\n rev[v]->cap -= f;\n graph[v][rev[v]->rev].cap += f;\n v = rev[v]->from;\n }\n }\n return (flow > 0 ? -1 : ret);\n }\n};\n\nint main() {\n int N, M, F;\n std::cin >> N >> M >> F;\n\n MinCostFlow<int, int, true> mcf(N);\n for (int i = 0; i < M; ++i) {\n int u, v, c, d;\n std::cin >> u >> v >> c >> d;\n mcf.span(u, v, c, d);\n }\n\n std::cout << mcf.exec(0, N - 1, F) << std::endl;\n return 0;\n}\n\n", "#最小費用流問題\nimport sys\nreadline = sys.stdin.buffer.readline\ndef even(n): return 1 if n%2==0 else 0\nn,m,f = map(int,readline().split())\n\"\"\"\nn頂点m辺の重み付き有向グラフに流量fを流したい。\nコストの最小値を出力せよ。\n但しsourse = 0,sink = n-1とし、\nそもそも流量f流せるだけcapacityがない場合は-1を出力せよ。\n\"\"\"\n# 最小費用流(minimum cost flow)\nclass MinCostFlow:\n def __init__(self, n):\n self.n = n\n self.G = [[] for i in range(n)]\n\n def addEdge(self, f, t, cap, cost): #costは1capに対して1costで定義される\n # [to, cap, cost, rev]↓revは勝手に逆辺張ってくれるので考えなくて良い。\n self.G[f].append([t, cap, cost, len(self.G[t])])\n self.G[t].append([f, 0, -cost, len(self.G[f])-1])\n\n def minCostFlow(self, s, t, f): #sからtまで、流量fを流し切る\n n = self.n\n G = self.G\n prevv = [0]*n; preve = [0]*n\n INF = 10**18\n\n res = 0 #コスト合計\n while f:\n dist = [INF]*n\n dist[s] = 0\n update = 1\n while update:\n update = 0\n for v in range(n):\n if dist[v] == INF:\n continue\n gv = G[v]\n for i in range(len(gv)):\n to, cap, cost, rev = gv[i]\n if cap > 0 and dist[v] + cost < dist[to]:\n dist[to] = dist[v] + cost\n prevv[to] = v; preve[to] = i\n update = 1\n if dist[t] == INF: #そもそもcapacity的に流量fを流せない場合\n return -1\n\n d = f; v = t\n while v != s:\n d = min(d, G[prevv[v]][preve[v]][1])\n v = prevv[v]\n f -= d\n res += d * dist[t] #distには、一本の道全体としての単位コストが入っている。\n #dだけ流せるので、d*その道全体のコストを,コスト合計のresに入れる。\n v = t\n while v != s:\n e = G[prevv[v]][preve[v]]\n e[1] -= d\n G[v][e[3]][1] += d\n v = prevv[v]\n return res\n\nMCF = MinCostFlow(n)\nfor i in range(m):\n u,v,cap,cost = map(int,readline().split())\n MCF.addEdge(u,v,cap,cost)\n\nprint(MCF.minCostFlow(0,n-1,f))\n", "#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<utility>\n#include<numeric>\n#include<iostream>\n#include<array>\n#include<string>\n#include<sstream>\n#include<stack>\n#include<queue>\n#include<list>\n#include<functional>\n#define _USE_MATH_DEFINES\n\n#include<math.h>\n#include<map>\n\n#define INF 200000000\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<ll, int> pli;\n\n#define VMAX 100\n\nstruct OwnEdge\n{\n\tint f, t, flow, cap,cost;\n\tOwnEdge(int f, int t, int flow, int cap,int cost) :f(f), t(t), flow(flow), cap(cap),cost(cost) {}\n};\n\nvector<OwnEdge> G[VMAX];\nint h[VMAX], tod[VMAX], prevv[VMAX], preve[VMAX];\n\nint solve(int n, int src, int dest, int F)\n{\n\tint ans = 0;\n\twhile (F > 0)\n\t{\n\t\tfill(tod, tod + VMAX, INF);\n\t\tpriority_queue<pii, vector<pii>, greater<pii>> pq;\n\t\ttod[src] = 0;\n\t\tpq.push(make_pair(0, src));\n\t\twhile (!pq.empty())\n\t\t{\n\t\t\tpii temp = pq.top();\n\t\t\tpq.pop();\n\t\t\tif (tod[temp.second] < temp.first)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int i = 0; i != G[temp.second].size(); i++)\n\t\t\t{\n\t\t\t\tif (G[temp.second][i].cap <= G[temp.second][i].flow)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (tod[G[temp.second][i].t] + h[G[temp.second][i].t]>temp.first + h[temp.second] + G[temp.second][i].cost)\n\t\t\t\t{\n\t\t\t\t\ttod[G[temp.second][i].t] = tod[temp.second] + h[temp.second] + G[temp.second][i].cost - h[G[temp.second][i].t];\n\t\t\t\t\tprevv[G[temp.second][i].t] = temp.second;\n\t\t\t\t\tpreve[G[temp.second][i].t] = i;\n\t\t\t\t\tpq.push(make_pair(tod[G[temp.second][i].t], G[temp.second][i].t));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (tod[dest] == INF)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\th[i] += tod[i];\n\t\t}\n\t\tint td = F;\n\t\tfor (int i = dest; i != src; i = prevv[i])\n\t\t{\n\t\t\ttd = min(td, G[prevv[i]][preve[i]].cap - G[prevv[i]][preve[i]].flow);\n\t\t}\n\t\tF -= td;\n\t\tans += td*h[dest];\n\t\tfor (int i = dest; i != src; i = prevv[i])\n\t\t{\n\t\t\tG[prevv[i]][preve[i]].flow += td;\n\t\t\tG[i][G[prevv[i]][preve[i]].f].flow -= td;\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint V, E, F;\n\tcin >> V >> E >> F;\n\n\tfor (int i = 0; i < E; i++)\n\t{\n\t\tint u, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\n\t\tint tus = G[u].size(), tvs = G[v].size();\n\n\t\tG[u].push_back(OwnEdge(tvs, v, 0, c, d));\n\t\tG[v].push_back(OwnEdge(tus, u, c, c, -d));\n\t}\n\n\tcout << solve(V, 0, V - 1, F) << endl;\n\n\treturn 0;\n}\n", "from heapq import heappush, heappop\n\nclass MinimumCostFlow:\n inf = 1000000000\n def __init__(self, n):\n self.n = n\n self.edges = [[] for i in range(n)]\n def add_edge(self, f, t, cap, cost):\n self.edges[f].append([t, cap, cost, len(self.edges[t]), False])\n self.edges[t].append([f, 0, -cost, len(self.edges[f]) - 1, True]) # reverse edge\n def flow(self, s, t, flow):\n n = self.n\n g = self.edges\n inf = MinimumCostFlow.inf\n\n prevv = [0 for i in range(n)]\n preve = [0 for i in range(n)]\n h = [0 for i in range(n)]\n dist = [inf for i in range(n)]\n\n res = 0\n\n while flow != 0:\n dist = [inf for i in range(n)]\n dist[s] = 0\n que = [(0, s)]\n\n while que:\n c, v = heappop(que)\n if dist[v] < c:\n continue\n r0 = dist[v] + h[v]\n for i, e in enumerate(g[v]):\n w, cap, cost, _, _ = e\n if cap > 0 and r0 + cost - h[w] < dist[w]:\n r = r0 + cost - h[w]\n dist[w] = r\n prevv[w] = v\n preve[w] = i\n heappush(que, (r, w))\n\n if dist[t] == inf:\n return -1\n \n for i in range(n):\n h[i] += dist[i]\n\n d = flow\n v = t\n while v != s:\n d = min(d, g[prevv[v]][preve[v]][1])\n v = prevv[v]\n flow -= d\n res += d * h[t]\n v = t\n while v != s:\n e = g[prevv[v]][preve[v]]\n e[1] -= d\n g[v][e[3]][1] += d\n v = prevv[v]\n return res\n\nimport sys\nreadline = sys.stdin.readline\nwrite = sys.stdout.write\nN, M, F = map(int, readline().split())\n\nmcf = MinimumCostFlow(N)\nfor i in range(M):\n u, v, c, d = map(int, readline().split())\n mcf.add_edge(u, v, c, d)\nwrite(\"%d\\n\" % mcf.flow(0, N-1, F))\n", "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<map>\n#define _USE_MATH_DEFINES\n#include<math.h>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<cstdio>\n#include<utility>\n#include<set>\n#include<list>\n#include<cmath>\n#include<stdio.h>\n#include<string.h>\n#include<iomanip>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\nusing namespace std;\n#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)\n#define REP(i, n) FOR(i, 0, n - 1)\n#define NREP(i, n) FOR(i, 1, n)\nusing ll = long long;\nusing pii = pair<int, int>;\nusing piii = pair<pii, pii>;\nconst ll dx[4] = { 0, -1, 1, 0 };\nconst ll dy[4] = { -1, 0, 0, 1 };\nconst int INF = 1e9 + 7;\nint gcd(int x, int y) {\n\tif (x < y)swap(x, y);\n\tif (y == 0)return x;\n\treturn gcd(y, x%y);\n}\nvoid mul(ll a, ll b) {\n\ta = a * b % INF;\n}\ndouble mysqrt(double x) {\n\tdouble l = 0, r = x;\n\tfor (int i = 0; i < 64; ++i) {\n\t\tdouble m = (l + r) / 2.0;\n\t\tif (m*m < x)l = m;\n\t\telse r = m;\n\t}\n\treturn l;\n}\n///////////////////////////////////////\n\n//辺を表す構造体{行先、容量、コスト、逆辺}\nstruct edge { int to, cap, cost, rev; };\nint V, E, F;\nvector<edge>G[110];\nint dist[110];\nint prevv[110], preve[110];\n\nvoid add_edge(int from, int to, int cap, int cost) {\n\tG[from].push_back(edge{ to, cap, cost, (int)G[to].size() });\n\tG[to].push_back(edge{ from,0,-cost,(int)G[from].size() - 1 });\n}\n//sからtへの流用fの最小費用流を求める\n//流せない場合は-1を返す\nint min_cost_flow(int s, int t, int f) {\n\tint res = 0;\n\t//ベルマンフォードによりs-t間最短路を求める\n\twhile (f > 0) {\n\t\tfill(dist, dist + V, INF);\n\t\tdist[s] = 0;\n\t\tbool upgrade = true;\n\t\twhile (upgrade) {\n\t\t\tupgrade = false;\n\t\t\tfor (int v = 0; v < V; ++v) {\n\t\t\t\tif (dist[v] == INF)continue;\n\t\t\t\tfor (int i = 0; i < G[v].size(); ++i) {\n\t\t\t\t\tedge &e = G[v][i];\n\t\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tupgrade = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) {\n\t\t\treturn -1;\n\t\t}\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d * dist[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main() {\n\tcin >> V >> E >> F;\n\tREP(i, E) {\n\t\tint from, to, cap, cost;\n\t\tcin >> from >> to >> cap >> cost;\n\t\tadd_edge(from, to, cap, cost);\n\t}\n\tcout << min_cost_flow(0,V-1,F) << endl;\n\treturn 0;\n}\n", "#include <iostream>\n#include <vector>\n#include <unordered_map>\n#include <queue>\n\nusing namespace std;\n\nint v,e,f;\nunordered_map<int,unordered_map<int,int> > g,costs,inv_costs;\nqueue<pair<int,int> > nodes;\nint cost = 0;\n\nint dfs(int now, int flow, vector<bool> &arrived, vector<int> &dp) {\n\tif(now==0||flow==0) return flow;\n\tarrived[now] = true;\n\tfor(pair<int,int> p : inv_costs[now]) {\n\t\tint next = p.first;\n\t\tint next_cost = p.second;\n\t\tif(arrived[next]) continue;\n\t\tif(dp[now]-dp[next]==next_cost) {\n\t\t\tint res = dfs(next,min(flow,g[next][now]),arrived,dp);\n\t\t\tif(res>0) {\n\t\t\t\tg[next][now] -= res;\n\t\t\t\tg[now][next] += res;\n\t\t\t\tcosts[now][next] = -costs[next][now];\n\t\t\t\tinv_costs[next][now] = -inv_costs[now][next];\n\t\t\t\tif(g[next][now]==0) {\n\t\t\t\t\tcosts[next].erase(now);\n\t\t\t\t\tinv_costs[now].erase(next);\n\t\t\t\t}\n\t\t\t\tcost += res*next_cost;\n\t\t\t\treturn res;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nint calc(vector<int> &dp, int flow) {\n\tvector<int> vf(v,1<<30);\n\tfor(int loop = 0; loop < v; loop++) {\n\t\tfor(int now = 0; now < v; now++) {\n\t\t\tif(dp[now]==1<<30) continue;\n\t\t\tvf[now] = min(vf[now],dp[now]);\n\t\t\tfor(pair<int,int> p : costs[now]) {\n\t\t\t\tint next = p.first;\n\t\t\t\tint next_cost = p.second;\n\t\t\t\tvf[next] = min(vf[next],dp[now]+next_cost);\n\t\t\t}\n\t\t}\n\t\tdp.swap(vf);\n\t}\n\n\tvector<bool> arrived(v);\n\treturn dfs(v-1,flow,arrived,dp);\n}\n\nint main() {\n\tcin >> v >> e >> f;\n\tfor(int i = 0; i < e; i++) {\n\t\tint u,v2,c,d;\n\t\tcin >> u >> v2 >> c >> d;\n\t\tif(c<=0) continue;\n\t\tg[u][v2] = c;\n\t\tcosts[u][v2] = d;\n\t\tinv_costs[v2][u] = d;\n\t}\n\tint ans = 0;\n\twhile(ans<f) {\n\t\tvector<int> dp(v,1<<30);\n\t\tdp[0] = 0;\n\t\tint flow = calc(dp,f-ans);\n\t\tif(flow<=0) break;\n\t\telse ans += flow;\n\t}\n\tcout << ((ans>=f)?cost:-1) << endl;\n}\n\n", "\n#include <bits/stdc++.h>\n\n\nusing namespace std;\n\nconst int INF = (int) 1e5 + 1;\nconst int MAX_V = (int) 100;\n\nstruct edge { int to, cap, cost, rev; };\n\nvector<edge> G[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost) {\n G[from].push_back( (edge) { to, cap, cost, (int) G[to].size() });\n G[to].push_back( (edge) { from, 0, -cost, (int) G[from].size() - 1});\n}\n\nint dfs(int v, int t, int f) {\n if (v == t) return f;\n dist[v] = true;\n for (auto &e: G[v]) {\n if (!dist[e.to] && e.cap > 0) {\n int d = dfs(e.to, t, min(f, e.cap));\n if (d > 0) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n int V, E, f;\n cin >> V >> E >> f;\n\n for (int i = 0; i < E; ++i) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n add_edge(u, v, c, d);\n }\n\n int s = 0;\n int t = V -1;\n int res = 0;\n while (f > 0) {\n fill(dist, dist + V, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n for (int v = 0; v < V; ++v) {\n if (dist[v] == INF) continue;\n for (int i = 0; i < G[v].size(); ++i) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n if (dist[t] == INF) {\n res = -1;\n break;\n }\n \n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap); \n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n\n cout << res << '\\n';\n\n return 0;\n}\n\n", "\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, j) for(int i = 0; i < (int)(j); i++)\nconstexpr int INF = 1 << 28;\nstruct Edge {\n int to;\n ll capacity, cost, rev;\n};\nconstexpr ll INFL = 1LL << 60;\nstruct Flow {\n int N;\n vector<vector<Edge>> E;\n Flow(int n) : N(n) {\n E.resize(N);\n }\n void add_arc(int from, int to, ll cap, ll cost = 0) {\n E[from].push_back(Edge{to, cap, cost, (ll)E[to].size()}); // E[to].size() ????????§??????????????????\n E[to].push_back(Edge{from, 0, -cost, (ll)E[from].size() - 1}); // ??????\n }\n // s -> t ??? f ??????????????????????°??????¨????¨?????????????????????? - 1\n // O(F|V||E|)\n // ????????¨??°??????????£???????\n ll min_cost_flow(int s, int t, ll f) {\n vector<int> prev_v(N), prev_e(N);\n \n auto bellmanford = [&] (int s) {\n vector<ll> dist(N, INFL);\n dist[s] = 0;\n bool updated = true;\n while(updated) {\n updated = false;\n rep(v, N) {\n if(dist[v] >= INFL) continue;\n rep(i, E[v].size()) {\n auto &e = E[v][i];\n if(e.capacity > 0 and dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prev_v[e.to] = v;\n prev_e[e.to] = i;\n updated = true;\n }\n }\n }\n } \n return dist;\n };\n \n ll res = 0;\n while(f > 0) {\n auto dist = bellmanford(s);\n if(dist[t] == INFL) return -1;\n ll d = f;\n // s -> t ???????°?????????????????????????????°??????? d ????±???????\n for(int v = t; v != s; v = prev_v[v]) {\n d = min(d, E[prev_v[v]][prev_e[v]].capacity);\n }\n // d ???????????? \n for(int v = t; v != s; v = prev_v[v]) {\n auto &e = E[prev_v[v]][prev_e[v]];\n e.capacity -= d;\n E[v][e.rev].capacity += d;\n }\n f -= d;\n res += d * dist[t]; // ??????????????¨\n }\n return res;\n }\n};\nint main() {\n int V, E, F; cin >> V >> E >> F;\n Flow f(V);\n rep(i, E) {\n int u, v, c, d; cin >> u >> v >> c >> d;\n f.add_arc(u, v, c, d); \n }\n cout << f.min_cost_flow(0, V - 1, F) << endl;\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <numeric>\n#include <queue>\n#include <algorithm>\n#include <utility>\n#include <functional>\nusing namespace std;\n\nusing Flow = int;\n\ntemplate<typename Flow = int>\nstruct PrimalDual {\n\n struct Edge {\n int dst;\n Flow cap, cap_orig;\n Flow cost;\n int revEdge; \n bool isRev;\n Edge(int dst, Flow cap, Flow cost, int rev, bool isRev)\n :dst(dst), cap(cap), cap_orig(cap), cost(cost), revEdge(rev), isRev(isRev) {\n }\n };\n\n int n;\n vector<vector<Edge> > g;\n PrimalDual(int n_) : n(n_), g(vector<vector<Edge> >(n_)) {}\n void addEdge(int src, int dst, Flow cap, Flow cost) {\n g[src].emplace_back(dst, cap, cost, g[dst].size(), false);\n g[dst].emplace_back(src, 0, -cost, g[src].size() - 1, true);\n }\n Flow solve(int s, int t, int f) {\n constexpr Flow inf = numeric_limits<Flow>::max();\n Flow res = 0;\n vector<Flow> h(g.size()), dist(g.size());\n vector<int> prevv(g.size()), preve(g.size());\n while (f > 0) {\n priority_queue<pair<Flow, int>> q;\n fill(dist.begin(), dist.end(), inf);\n dist[s] = 0;\n q.emplace(0, s);\n while (q.size()) {\n int d, v;\n tie(d,v) = q.top();\n q.pop();\n d = -d;\n if (dist[v] < d) continue;\n for(int i = 0; i < (int)g[v].size(); ++i){\n Edge &e = g[v][i];\n if (e.cap > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst]) {\n dist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];\n prevv[e.dst] = v;\n preve[e.dst] = i;\n q.emplace(-dist[e.dst], e.dst);\n }\n }\n }\n if (dist[t] == inf) {\n return -1;\n }\n for (int i = 0; i < n; ++i) {\n h[i] += dist[i];\n }\n Flow d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, g[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.revEdge].cap += d;\n }\n }\n return res;\n }\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n int n, m, f;\n cin >> n >> m >> f;\n PrimalDual<int> pd(n);\n for (int i = 0; i < m; i++) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n pd.addEdge(u, v, c, d);\n }\n cout << pd.solve(0, n - 1, f) << endl;\n}", "bool debug=false;\n#include <string.h>\n#include <stdio.h>\n#include <queue>\n#include <vector>\n#include <utility>\nusing namespace std;\n#define F first\n#define S second\n#define PB push_back\nconst int INF=1e9+10;\nconst int N=1e2+10;\npair<int,int> graph[N][N];\npair<int,int> dis[N];\nint from[N];\nint n;\nint min(int a,int b){return a>b?b:a;}\npair<int,int> mcmf(int s,int t){\n\tfor(int i=1;i<n;i++)dis[i]={INF,0};\n\tdis[s]={0,INF};\n\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;\n\tpair<int,int> nxt;\n\tint temp;\n\tpq.push({0,s});\n\tfrom[s]=s;\n\twhile(!pq.empty()){\n\t\tnxt=pq.top();\n\t\tpq.pop();\n\t\tif(debug)printf(\"nxt=%d %d\\n\",nxt.F,nxt.S);\n\t\tif(dis[nxt.S].F<nxt.F)continue;\n\t\tfor(int i=0;i<n;i++)if(graph[nxt.S][i].S>0&&nxt.F+graph[nxt.S][i].F<dis[i].F){\n\t\t\tdis[i]={nxt.F+graph[nxt.S][i].F,min(dis[nxt.S].S,graph[nxt.S][i].S)};\n\t\t\tpq.push({dis[i].F,i});\n\t\t\tfrom[i]=nxt.S;\n\t\t}else if(debug)printf(\"graph[%d][%d]=%d %d\\n\",nxt.S,i,graph[nxt.S][i].F,graph[nxt.S][i].S);\n\t}\n\tif(dis[t].S==0)return {-1,-1};\n\ttemp=t;\n\twhile(temp!=s){\n\t\tgraph[temp][from[temp]].S+=dis[t].S;\n\t\tgraph[from[temp]][temp].S-=dis[t].S;\n\t\ttemp=from[temp];\n\t}\t\n\tgraph[temp][from[temp]].S+=dis[t].S;\n\tgraph[from[temp]][temp].S-=dis[t].S;\n\treturn dis[t];\n}\n\nint main(){\n\tint l,r,cost,cap,m,ans=0,f;\n\tpair<int,int> temp;\n\tscanf(\"%d%d%d\",&n,&m,&f);\n\tfor(int i=0;i<n;i++)for(int j=0;j<n;j++)graph[i][j]={INF,0};\n\twhile(m--){\n\t\tscanf(\"%d%d%d%d\",&l,&r,&cap,&cost);\n\t\tgraph[l][r]={cost,cap};\n\t\tgraph[r][l]={-cost,0};\n\t}\n\twhile(f>0){\n\t\ttemp=mcmf(0,n-1);\n\t\tif(debug)printf(\"f=%d temp=(%d,%d)\\n\",f,temp.F,temp.S);\n\t\tif(temp.S<=0){\n\t\t\tprintf(\"-1\\n\");\n\t\t\treturn 0;\n\t\t}\n\t\tif(temp.S>f){\n\t\t\tans+=temp.F*f;\n\t\t\tf=0;\n\t\t}\n\t\telse{\n\t\t\tans+=temp.F*temp.S;\n\t\t\tf-=temp.S;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n\n\n", "#include<cstdio>\n#include<cstring>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<cmath>\n#include<climits>\n#include<string>\n#include<set>\n#include<map>\n#include<iostream>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<((int)(n));i++)\n#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)\n#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)\n#define ireg(i,a,b) for(int i=((int)(b));i>=((int)(a));i--)\ntypedef long long int lli;\ntypedef pair<int,int> mp;\n#define fir first\n#define sec second\n#define IINF INT_MAX\n#define LINF LLONG_MAX\n#define eprintf(...) fprintf(stderr,__VA_ARGS__)\n#define pque(type) priority_queue<type,vector<type>,greater<type> >\n#define memst(a,b) memset(a,b,sizeof(a))\n\nstruct edge{\n\tint to,p;\n\tlli cap,co;\n};\nint n;\nvector<edge> vs[105];\n\nint ds[105];\nmp bf[105];\nint inf=1e8;\nlli mincof(int st,int gl,int gf){\n\tlli res=0;\n\twhile(gf>0){\n\t\trep(i,n)ds[i]=inf;\n\t\tds[st]=0;\n\t\tfor(;;){\n\t\t\tbool ud=false;\n\t\t\trep(i,n){\n\t\t\t\tif(ds[i]==inf)continue;\n\t\t\t\trep(j,vs[i].size()){\n\t\t\t\t\tedge e=vs[i][j];\n\t\t\t\t\tif(e.cap<=0)continue;\n\t\t\t\t\tif(ds[e.to]>ds[i]+e.co){\n\t\t\t\t\t\tds[e.to]=ds[i]+e.co;\n\t\t\t\t\t\tbf[e.to]=mp(i,j);\n\t\t\t\t\t\tud=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!ud)break;\n\t\t}\n\t\tif(ds[gl]==inf)return -1;\n\t\t\n\t\t//rep(i,n)printf(\"%d / %d .. %d (%d %d)\\n\",gf,i,ds[i],bf[i].fir,bf[i].sec);\n\n\t\tlli nf=gf;\n\t\tint no=gl;\n\t\twhile(no!=st){\n\t\t\tint to=bf[no].fir;\n\t\t\tedge& be=vs[to][bf[no].sec];\n\t\t\tnf=min(nf,be.cap);\n\t\t\tno=to;\n\t\t}\n\t\t\n\t\tlli cs=0;\n\t\tno=gl;\n\t\twhile(no!=st){\n\t\t\tint to=bf[no].fir;\n\t\t\tedge& be=vs[to][bf[no].sec];\n\t\t\tbe.cap-=nf;\n\t\t\tcs+=be.co;\n\t\t\tvs[no][be.p].cap+=nf;\n\t\t\tno=to;\n\t\t}\n\t\tres+=cs*nf;\n\t\tgf-=nf;\n\t}\n\treturn res;\n}\n\nint m,gf;\nint main(void){\n\tscanf(\"%d%d%d\",&n,&m,&gf);\n\trep(i,m){\n\t\tint a,b,c,d;\n\t\tscanf(\"%d%d%d%d\",&a,&b,&c,&d);\n\t\tedge e;\n\t\te.to=b; e.p=vs[b].size(); e.cap=c; e.co=d;\n\t\tvs[a].push_back(e);\n\t\te.to=a; e.p=vs[a].size()-1; e.cap=0; e.co=-d;\n\t\tvs[b].push_back(e);\n\t}\n\tprintf(\"%lld\\n\",mincof(0,n-1,gf));\t\n\treturn 0;\n}", "#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#ifdef _DEBUG\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\n//#define int long long\n#define DBG 1\n#define rep(i, a, b) for (int i = (a); i < (b); i++)\n#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)\n#define loop(n) rep(loop, (0), (n))\n#define all(c) begin(c), end(c)\nconst int INF =\n sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)(1e9) + 7;\nconst double PI = acos(-1);\nconst double EPS = 1e-9;\ntemplate <class T> bool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T> bool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nstruct edge {\n int to, cap, cost, rev;\n edge(int to, int cap, int cost, int rev)\n : to(to), cap(cap), cost(cost), rev(rev) {}\n};\nstruct Graph {\n int V;\n vector<vector<edge>> G;\n vector<int> dist, prev_v, prev_e;\n Graph(int V) : V(V), dist(V), prev_v(V), prev_e(V), G(V) {}\n void add_edge(int from, int to, int cap, int cost) {\n G[from].push_back(edge(to, cap, cost, G[to].size()));\n G[to].push_back(edge(from, 0, -cost, G[from].size() - 1));\n }\n int min_cost_flow(int s, int t, int f) {\n int res = 0;\n while (f > 0) {\n fill(all(dist), INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n rep(v, 0, V) {\n if (dist[v] == INF)\n continue;\n rep(i, 0, G[v].size()) {\n edge &e = G[v][i];\n if (e.cap > 0 and dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prev_v[e.to] = v;\n prev_e[e.to] = i;\n update = true;\n }\n }\n }\n }\n if (dist[t] == INF)\n return -1;\n int d = f;\n for (int v = t; v != s; v = prev_v[v]) {\n chmin(d, G[prev_v[v]][prev_e[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prev_v[v]) {\n edge &e = G[prev_v[v]][prev_e[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int V, E, F;\n cin >> V >> E >> F;\n Graph g(V);\n rep(i, 0, E) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n g.add_edge(a, b, c, d);\n }\n cout << g.min_cost_flow(0, V - 1, F) << endl;\n\n return 0;\n}\n\n", "#include <bits/stdc++.h>\n#include <iomanip>\n \nusing namespace std;\n \ntypedef long long LL;\ntypedef long double LD;\ntypedef pair<int, int> PII;\ntypedef pair<LL, LL> PLL;\ntypedef pair<LD, LD> PLDLD;\ntypedef vector<int> VI;\ntypedef vector<char> VB;\n \n#define FOR(i,a,b) for(int i=(a);i<(int)(b);++i)\n#define REP(i,n) FOR(i,0,n)\n#define CLR(a) memset((a), 0 ,sizeof(a))\n#define ALL(a) a.begin(),a.end()\n \nconst LD eps=1e-5;\n//const long long INF=(LL)(1e9)*(LL)(1e9);\nconst int INF=1e9;\n \ntemplate<class T>\nvoid chmin(T& a, const T& b)\n{\n\tif(a>b)\n\t\ta=b;\n}\ntemplate<class T>\nvoid chmax(T& a, const T& b)\n{\n\tif(a<b)\n\t\ta=b;\n}\n \nconst LL pow(const LL p, const LL q)\n{\n\tLL t=1;\n\tREP(i,q)\n\t\tt*=p;\n\treturn t;\n}\n\n//print for container\n/*\ntemplate<typename Iterator>\nvoid print(const Iterator& first, const Iterator& last)\n{\n\tauto&& back=prev(last);\n\tfor(auto e=first; e!=last; e=next(e))\n\t\tcout<<*e<<\" \\n\"[e==back];\n}*/\n\ntemplate<typename Head>\nvoid print(const Head& head)\n{\n\tcout<<head<<endl;\n}\n\ntemplate<typename Head, typename... Tail>\nvoid print(const Head& head, const Tail&... tail)\n{\n\tcout<<head<<\" \";\n\tprint(tail...);\n}\n\nvoid io_speedup()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n}\n\ntemplate<typename T>\nT read()\n{\n\tT t;\n\tcin>>t;\n\treturn t;\n}\n\n\nconstexpr long long INF64 = 1e18;\n \nusing Weight=long long;\n\nstruct edge{\n\tint to,cap,cost,rev;\n};\n\nconst int MAX_V=100;\nint V;\nvector<vector<edge>> G(MAX_V);\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost)\n{\n\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size()-1});\n}\n\nint min_cost_flow(int s, int t, int f)\n{\n\tint res=0;\n\twhile(f>0)\n\t{\n\t\tfill(dist, dist+V, INF);\n\t\tdist[s]=0;\n\t\tbool update=true;\n\t\twhile(update)\n\t\t{\n\t\t\tupdate=false;\n\t\t\tfor(int v=0;v<V;v++)\n\t\t\t{\n\t\t\t\tif(dist[v]==INF) continue;\n\t\t\t\tfor(int i=0;i<G[v].size();i++)\n\t\t\t\t{\n\t\t\t\t\tedge &e=G[v][i];\n\t\t\t\t\tif(e.cap>0 && dist[e.to] > dist[v] + e.cost)\n\t\t\t\t\t{\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tupdate=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(dist[t]==INF)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\n\t\tint d=f;\n\t\tfor(int v=t;v!=s;v=prevv[v])\n\t\t{\n\t\t\td=min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf-=d;\n\t\tres+=d*dist[t];\n\t\tfor(int v=t;v!=s;v=prevv[v])\n\t\t{\n\t\t\tedge &e=G[prevv[v]][preve[v]];\n\t\t\te.cap-=d;\n\t\t\tG[v][e.rev].cap+=d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tREP(i,MAX_V)\n\t\tdist[i]=INF;\n\tint n,m,f;\n cin>>n>>m>>f;\n\tV=n;\n for(int i=0;i<m;++i){\n int u,v;\n Weight cap,cost;\n cin>>u>>v>>cap>>cost;\n add_edge(u,v,cap,cost);\n }\n cout<<min_cost_flow(0,n-1,f)<<endl;\n}", "//最小費用流問題を解く\n//計算量O(F|V||E|)\n//参考 蟻本\n\n#include<iostream>\n#include<vector>\nusing namespace std;\n\ntypedef long long ll;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nstruct edge { \n ll to;//行き先の頂点\n ll cap;//辺の容量\n ll cost;//１フローあたりのコスト\n ll rev;//逆辺のインデックス(G[e.to][e.rev]で逆辺にアクセスできる。)\n};\n\n#define MAX_V 1000\n#define INF (1e18)\n\nll V;//頂点数 ここに頂点数をセットするのを忘れないように。\nvector<edge> G[MAX_V];\nll dist[MAX_V];\nll prevv[MAX_V],preve[MAX_V]; // 直前の頂点と辺\n\nvoid add_edge(ll from,ll to,ll cap,ll cost) {\n G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});//辺の追加\n G[to].push_back((edge){from,0,-cost,(ll)G[from].size() - 1});//辺の逆辺\n}\n\n// 最小費用流を求める(sからt)\n// 流せない場合はINFをかえす。\n\nll min_cost_flow (ll s,ll t,ll f) {\n ll ret = 0;\n\n while(f > 0) {\n //ベルマンフォード\n fill(dist,dist + V,INF);\n dist[s] = 0;\n bool update = true;\n while(update) {//最初に負の閉路があると無限ループになるので注意\n update = false;\n rep(v,V) {\n if(dist[v] == INF) continue;\n rep(i,G[v].size()) {\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost) {//まだフローを流すことが出来、より距離が小さい\n dist[e.to] = dist [v] + e.cost;//最小距離を更新\n prevv[e.to] = v;//前の頂点を記録\n preve[e.to] = i;//辺の添字を記録 求めたパスである頂点uに入る辺はG[prevv[u]][preve[u]]で表す\n update = true;\n }\n }\n }\n }\n\n if(dist[t] == INF) {\n //正のフローを流せるs-t道がなかった\n return -1;\n }\n\n // s-t間最短路に沿って目一杯流す\n ll d = f;//残りのフロー\n for(ll v = t;v != s;v = prevv[v]) {//t側から更新していく\n d = min(d,G[prevv[v]][preve[v]].cap);//パスの容量\n }\n f -= d;\n ret += d * dist[t];//総費用の更新\n for(ll v = t;v != s;v = prevv[v]) {//残余ネットワークの更新\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return ret;\n}\n\nll E,F;\n\nint main() {\n cin >> V >> E >> F;\n rep(i,E) {\n ll u,v,c,d;\n cin >> u >> v >> c >> d;\n add_edge(u,v,c,d);\n }\n cout << min_cost_flow(0,V-1,F) << endl;;\n return 0;\n \n}\n", "V,E,F=map(int,input().split())\nEDGE=dict()\nEDGE2=[[] for i in range(V)]\n\nfor i in range(E):\n x,to,c,d=map(int,input().split())\n EDGE[(x,to)]=[c,d]\n EDGE2[x].append(to)\n\nBACK=[-1]*V\nP=[0]*V\n\n# 一回ベルマンフォードをしてポテンシャルを求める.\n\nANS=[float(\"inf\")]*V\nANS[0]=0\n\nfor rep in range(V): \n for x,to in EDGE:\n c,d=EDGE[(x,to)]\n if c>0 and ANS[to]>ANS[x]+d:\n ANS[to]=ANS[x]+d\n BACK[to]=x\n\nP=[ANS[i] for i in range(V)]\nLA=ANS[V-1]\n\nNOW=V-1\nwhile NOW!=0:\n fr=BACK[NOW]\n EDGE[(fr,NOW)][0]-=1\n\n if (NOW,fr) in EDGE:\n EDGE[(NOW,fr)][0]+=1\n else:\n EDGE[(NOW,fr)]=[1,-EDGE[fr,NOW][1]]\n EDGE2[NOW].append(fr)\n\n NOW=fr\n \nfor x,to in EDGE:\n EDGE[(x,to)][1]+=P[x]-P[to]\n\n# あとはダイクストラを使える.\n\nimport heapq\n\nfor i in range(F-1):\n ANS=[float(\"inf\")]*V\n Q=[(0,0)]\n ANS[0]=0\n\n while Q:\n time,ind=heapq.heappop(Q)\n if time>ANS[ind]:\n continue\n\n for to in EDGE2[ind]:\n c,d=EDGE[(ind,to)]\n if c>0 and ANS[to]>ANS[ind]+d:\n ANS[to]=ANS[ind]+d\n BACK[to]=ind\n heapq.heappush(Q,(ANS[to],to))\n\n LA+=ANS[V-1]+P[V-1]-P[0]\n\n if LA==float(\"inf\"):\n break\n\n P=[P[i]-ANS[i] for i in range(V)]\n\n NOW=V-1\n while NOW!=0:\n fr=BACK[NOW]\n EDGE[(fr,NOW)][0]-=1\n\n if (NOW,fr) in EDGE:\n EDGE[(NOW,fr)][0]+=1\n else:\n EDGE[(NOW,fr)]=[1,-EDGE[fr,NOW][1]]\n EDGE2[NOW].append(fr)\n\n NOW=fr\n\n for x,to in EDGE:\n EDGE[(x,to)][1]+=ANS[to]-ANS[x]\n \n\nif LA==float(\"inf\"):\n print(-1)\nelse:\n print(LA)\n \n \n\n", "INF = float('inf')\n\n\ndef trace_back(sink, predecessors):\n p = predecessors[sink]\n while p is not None:\n v, i = p\n yield edges[v][i]\n p = predecessors[v]\n\n\ndef min_cost_flow(source, sink, required_flow):\n res = 0\n while required_flow:\n dist = [INF] * n\n dist[source] = 0\n predecessors = [None] * n\n\n while True:\n updated = False\n for v in range(n):\n if dist[v] == INF:\n continue\n for i, (remain, target, cost, _) in enumerate(edges[v]):\n new_dist = dist[v] + cost\n if remain and dist[target] > new_dist:\n dist[target] = new_dist\n predecessors[target] = (v, i)\n updated = True\n if not updated:\n break\n\n if dist[sink] == INF:\n return -1\n\n aug = min(required_flow, min(e[0] for e in trace_back(sink, predecessors)))\n required_flow -= aug\n res += aug * dist[sink]\n for e in trace_back(sink, predecessors):\n remain, target, cost, idx = e\n e[0] -= aug\n edges[target][idx][0] += aug\n return res\n\n\nn, m, f = map(int, input().split())\nedges = [[] for _ in range(n)]\n\nfor _ in range(m):\n s, t, c, d = map(int, input().split())\n es, et = edges[s], edges[t]\n ls, lt = len(es), len(et)\n es.append([c, t, d, lt])\n et.append([0, s, -d, ls])\n\nprint(min_cost_flow(0, n - 1, f))", "#include <cstdio>\n\n#include <vector>\n#include <queue>\n#include <tuple>\nint v, e;\n\nstruct Edge {\n Edge() {}\n Edge(int from, int to, int capacity, int cost, int rev) : from(from), to(to), capacity(capacity), cost(cost), rev(rev) {}\n int from, to;\n int capacity;\n int cost;\n int rev;\n};\n\nstd::vector<Edge> edges[128];\n\nvoid addEdge(int from, int to, int capacity, int cost) {\n int n1 = edges[from].size();\n int n2 = edges[to].size();\n edges[from].push_back(Edge(from, to, capacity, cost, n2));\n edges[to].push_back(Edge(to, from, 0, -cost, n1));\n} \n\nstruct Result {\n Result() {}\n Result(int cost, int f) : cost(cost), f(f) {}\n int cost;\n int f;\n};\n\nstruct NodeInfo {\n NodeInfo() {}\n NodeInfo(int w, int max_f, int prev, int prev_id) : w(w), max_f(max_f), prev(prev), prev_id(prev_id) {}\n int w, max_f, prev, prev_id;\n};\nNodeInfo nodes[128];\nvoid init_flow() {\n for(int i = 0; i < 128; ++i) {\n nodes[i] = NodeInfo((1<<30), 0, -1, -1);\n }\n}\n\nResult flow(int from, int to, int rem) {\n std::priority_queue< std::pair<int, int> > q;\n q.push(std::make_pair(0, from));\n nodes[from].w = 0;\n nodes[from].max_f = rem;\n while( not q.empty() ) {\n int n, weight;\n std::tie(weight, n) = q.top(); q.pop();\n // printf(\"(n) = (%d)\\n\", n);\n weight = -weight;\n for(int i = 0; i < (int)edges[n].size(); ++i) {\n Edge edge = edges[n][i];\n if( edge.capacity <= 0 ) continue;\n int nw = weight + edge.cost;\n if( nodes[edge.to].w <= nw ) continue;\n nodes[edge.to] = NodeInfo(nw, std::min(nodes[edge.from].max_f, edge.capacity), n, i);\n q.push(std::make_pair(-nw, edge.to));\n }\n }\n // for(int i = 0; i < v; ++i) {\n // printf(\"node info[%d] : (w, max_f, prev, prev_id) = (%d, %d, %d, %d)\\n\", i, w[i], max_f[i], prev[i], prev_id[i]);\n // }\n int f = nodes[to].max_f;\n if( f == 0 ) return Result(0, 0);\n int m = to;\n int cost = 0;\n while( nodes[m].prev != -1 ) {\n Edge& edge = edges[nodes[m].prev][nodes[m].prev_id];\n edge.capacity -= f;\n edges[m][edge.rev].capacity += f;\n cost += f * edge.cost;\n m = nodes[m].prev;\n }\n return Result(cost, f);\n}\n\nint minimum_cost_flow(int from, int to, int rem) {\n int cost = 0;\n for(;;) {\n init_flow();\n Result r = flow(from, to, rem);\n rem -= r.f;\n cost += r.cost;\n if( rem == 0 ) return cost;\n if( r.f == 0 ) break;\n // printf(\"(rem, flow rate) = (%d, %d)\\n\", rem, r.f);\n }\n return -1;\n}\n\nint main() {\n int f;\n scanf(\"%d %d %d\", &v, &e, &f);\n for(int i = 0; i < e; ++i) {\n int a, b, c, d;\n scanf(\"%d %d %d %d\", &a, &b, &c, &d);\n addEdge(a, b, c, d);\n }\n\n printf(\"%d\\n\", minimum_cost_flow(0, v - 1, f));\n \n return 0;\n}", "#include<bits/stdc++.h>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) for(int i = 0; i < (b); i++)\n#define all(a) (a).begin(), (a).end()\n#define show(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\nconst int INF = 2000000000;\nusing namespace std;\n\n\nconst int MAX_V = 101;\n\nclass Edge{\n public:\n //???????????????????????????????????????\n int to, cap, cost, rev;\n};\n\nvector<vector<Edge>> G(MAX_V);\nint h[MAX_V]; //??????????????£???\nint dist[MAX_V]; //???????????¢\nint prev_v[MAX_V], prev_e[MAX_V]; //??´??????????????¨???\n\nvoid addEdge(int from, int to, int cap, int cost){\n G[from].emplace_back(Edge{to, cap, cost, static_cast<int>(G[to].size())});\n G[to].emplace_back(Edge{from, 0, -cost, static_cast<int>(G[from].size() - 1)});\n}\n\nint minCostFlow(int v, int s, int t, int f){\n int res = 0;\n fill(h, h + v, 0);\n while(f > 0){\n priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;\n fill(dist, dist + v, INF);\n dist[s] = 0;\n q.push(make_pair(0, s));\n while(not q.empty()){\n pair<int, int> p = q.top(); q.pop();\n int u = p.second;\n if(dist[u] < p.first) continue;\n rep(i,G[u].size()){\n Edge &e = G[u][i];\n if(e.cap > 0 && dist[e.to] > dist[u] + e.cost + h[u] - h[e.to]){\n dist[e.to] = dist[u] + e.cost + h[u] - h[e.to];\n prev_v[e.to] = u;\n prev_e[e.to] = i;\n q.push(make_pair(dist[e.to], e.to));\n }\n }\n }\n if(dist[t] == INF){\n return -1;\n }\n rep(i,v) h[i] += dist[i];\n\n int d = f;\n for(int u = t; u != s; u = prev_v[u]){\n d = min(d, G[prev_v[u]][prev_e[u]].cap);\n }\n f -= d;\n res += d * h[t];\n for(int u = t; u != s; u = prev_v[u]){\n Edge &e = G[prev_v[u]][prev_e[u]];\n e.cap -= d;\n G[u][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main(){\n int v, e, f;\n cin >> v >> e >> f;\n rep(i,e){\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n addEdge(a,b,c,d);\n }\n cout << minCostFlow(v, 0, v - 1, f) << endl;\n}", "#include <iostream>\n#include <vector>\n#include <queue>\n#include <utility>\nusing namespace std;\ntypedef pair<int, int> P;\nstruct edge{\n int to;\n int cap;\n int cost;\n int rev;\n};\nstruct PDijk{\n int V;\n int INF;\n vector<int> pote, prevv, preve;\n vector<vector<edge>> G;\n PDijk(int N){\n V = N;\n INF = 1e9;\n G.resize(V);\n prevv.resize(V);\n preve.resize(V);\n }\n void add(int s, int t, int cap, int cost){\n edge e1 = {t, cap, cost, (int)G[t].size()};\n G[s].push_back(e1);\n edge e2 = {s, 0, -cost, (int)G[s].size() - 1};\n G[t].push_back(e2);\n }\n int solve(int s, int t, int f){\n int ans = 0;\n pote.resize(V, 0);\n while(f > 0){\n priority_queue<P, vector<P>, greater<P>> q;\n vector<int> d(V, INF);\n d[s] = 0;\n q.push(P(0, s));\n while(!q.empty()){\n P v = q.top();\n q.pop();\n if(d[v.second] < v.first) continue;\n int u = v.second;\n for(int i = 0; i < (int)G[u].size(); i++){\n edge e = G[u][i];\n if(e.cap > 0 && d[e.to] > d[u] - pote[e.to] + pote[u] + e.cost){\n d[e.to] = d[u] - pote[e.to] + pote[u] + e.cost;\n prevv[e.to] = u;\n preve[e.to] = i;\n q.push(P(d[e.to], e.to));\n }\n }\n }\n if(d[t] == INF) return -1;\n for(int i = 0; i < V; i++) pote[i] += d[i];\n int temp = f;\n for(int i = t; i != s; i = prevv[i]){\n temp = min(temp, G[prevv[i]][preve[i]].cap);\n }\n f -= temp;\n ans += temp * pote[t];\n for(int i = t; i != s; i = prevv[i]){\n edge &e = G[prevv[i]][preve[i]];\n e.cap -= temp;\n G[i][e.rev].cap += temp;\n }\n }\n return ans;\n }\n};\nint main(){\n int N, E, F;\n cin >> N >> E >> F;\n PDijk pd(N);\n for(int i = 0; i < E; i++){\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n pd.add(u, v, c, d);\n }\n int ans = pd.solve(0, N - 1, F);\n cout << ans << endl;\n}\n", "#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n\nusing namespace std;\n\nusing edge=struct {int to,cap,cost,rev;};\nusing G=vector<vector<edge>>;\nconst int inf=1<<29;\n\nvoid add_edge(G &graph,int a,int b,int c,int d){\n\tgraph[a].push_back({b,c,d,int(graph[b].size())});\n\tgraph[b].push_back({a,0,-d,int(graph[a].size()-1)});\n}\n\nint min_cost_flow(G &graph,int s,int t,int f){\n\tint res=0;\n\twhile(f){\n\t\tint n=graph.size(),update;\n\t\tvector<int> dist(n,inf),pv(n,0),pe(n,0);\n\t\tdist[s]=0;\n\n\t\trep(loop,n){\n\t\t\tupdate=false;\n\t\t\trep(v,n)rep(i,graph[v].size()){\n\t\t\t\tedge &e=graph[v][i];\n\t\t\t\tif(e.cap>0 && chmin(dist[e.to],dist[v]+e.cost)){\n\t\t\t\t\tpv[e.to]=v,pe[e.to]=i;\n\t\t\t\t\tupdate=true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!update) break;\n\t\t}\n\n\t\tif(dist[t]==inf) return -1;\n\n\t\tint d=f;\n\t\tfor(int v=t;v!=s;v=pv[v]) chmin(d,graph[pv[v]][pe[v]].cap);\n\t\tf-=d,res+=d*dist[t];\n\n\t\tfor(int v=t;v!=s;v=pv[v]){\n\t\t\tedge &e=graph[pv[v]][pe[v]];\n\t\t\te.cap-=d;\n\t\t\tgraph[v][e.rev].cap+=d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(void){\n\tint n,m,f;\n\tcin >> n >> m >> f;\n\tG graph(n);\n\trep(i,m){\n\t\tint a,b,c,d;\n\t\tcin >> a >> b >> c >> d;\n\t\tadd_edge(graph,a,b,c,d);\n\t}\n\tcout << min_cost_flow(graph,0,n-1,f) << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\n\nusing namespace std;\n\ntemplate< typename flow_t, typename cost_t >\nstruct PrimalDual {\n const cost_t INF;\n\n struct edge {\n int to;\n flow_t cap;\n cost_t cost;\n int rev;\n };\n vector< vector< edge > > graph;\n vector< cost_t > potential, min_cost;\n vector< int > prevv, preve;\n\n PrimalDual(int V) : graph(V), INF(numeric_limits< cost_t >::max()) {}\n\n void add_edge(int from, int to, flow_t cap, cost_t cost) {\n graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size()});\n graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1});\n }\n\n cost_t min_cost_flow(int s, int t, flow_t f) {\n int V = (int) graph.size();\n cost_t ret = 0;\n using Pi = pair< cost_t, int >;\n priority_queue< Pi, vector< Pi >, greater< Pi > > que;\n potential.assign(V, 0);\n preve.assign(V, -1);\n prevv.assign(V, -1);\n\n while(f > 0) {\n min_cost.assign(V, INF);\n que.emplace(0, s);\n min_cost[s] = 0;\n while(!que.empty()) {\n Pi p = que.top();\n que.pop();\n if(min_cost[p.second] < p.first) continue;\n for(int i = 0; i < graph[p.second].size(); i++) {\n edge &e = graph[p.second][i];\n cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\n if(e.cap > 0 && min_cost[e.to] > nextCost) {\n min_cost[e.to] = nextCost;\n prevv[e.to] = p.second, preve[e.to] = i;\n que.emplace(min_cost[e.to], e.to);\n }\n }\n }\n if(min_cost[t] == INF) return -1;\n for(int v = 0; v < V; v++) potential[v] += min_cost[v];\n flow_t addflow = f;\n for(int v = t; v != s; v = prevv[v]) {\n addflow = min(addflow, graph[prevv[v]][preve[v]].cap);\n }\n f -= addflow;\n ret += addflow * potential[t];\n for(int v = t; v != s; v = prevv[v]) {\n edge &e = graph[prevv[v]][preve[v]];\n e.cap -= addflow;\n graph[v][e.rev].cap += addflow;\n }\n }\n return ret;\n }\n};\n\nint main() {\n int V, E, F;\n scanf(\"%d %d %d\", &V, &E, &F);\n PrimalDual< int, int > g(V);\n for(int i = 0; i < E; i++) {\n int a, b, c, d;\n scanf(\"%d %d %d %d\", &a, &b, &c, &d);\n g.add_edge(a, b, c, d);\n }\n printf(\"%d\\n\", g.min_cost_flow(0, V - 1, F));\n}\n", "#line 1 \"test/aoj/GRL_6_B.test.cpp\"\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_b\"\n#line 2 \"test/aoj/../../graph/min-cost-flow.hpp\"\n#include <algorithm>\n#include <vector>\n#include <queue>\n\nstruct min_cost_flow {\n struct edge { int to, cap, cost, rev; };\n using P = std::pair<int, int>;\n const int INF_ = 1<<30;\n int V; // 頂点数\n std::vector<std::vector<edge>> G; // グラフの隣接リスト表現\n std::vector<int> h; // ポテンシャル\n std::vector<int> dist; // 最短距離\n std::vector<int> prevv, preve; // 直前の頂点と辺\n\n min_cost_flow(int V) : V(V), G(V), h(V), dist(V), prevv(V), preve(V) {}\n\n void add_edge(int from, int to, int cap, int cost) {\n G[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].push_back((edge){from, 0, -cost, (int)G[from].size()-1});\n }\n\n // sからtへの流量fの最小費用流を求める\n // 流せない場合は-1を返す\n int run(int s, int t, int f) { \n int res = 0;\n std::fill(h.begin(), h.end(), 0);\n while (f > 0) { \n std::priority_queue<P, std::vector<P>, std::greater<P>> q;\n std::fill(dist.begin(), dist.end(), INF_);\n dist[s] = 0;\n q.push({0, s});\n while (!q.empty()) { \n P p = q.top(); q.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < (int)G[v].size(); ++i) { \n edge &e = G[v][i];\n int d = dist[v] + e.cost + h[v] - h[e.to];\n if (e.cap > 0 && dist[e.to] > d) { \n dist[e.to] = d;\n prevv[e.to] = v;\n preve[e.to] = i;\n q.push({dist[e.to], e.to});\n }\n }\n }\n if (dist[t] == INF_) {\n // これ以上流せない\n return -1;\n }\n for (int v = 0; v < V; ++v) h[v] += dist[v];\n\n // s-t間最短路に沿って目一杯流す\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = std::min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d*h[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n#line 3 \"test/aoj/GRL_6_B.test.cpp\"\n\n#include <iostream>\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n int V, E, F;\n cin >> V >> E >> F;\n min_cost_flow mcf(V);\n for (int i = 0; i < E; ++i) {\n int from, to, cap, cost;\n cin >> from >> to >> cap >> cost;\n mcf.add_edge(from, to, cap, cost);\n }\n cout << mcf.run(0, V-1, F) << endl;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef pair<int,int> pint;\ntypedef vector<pint> vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define REP(i,n) for(int i=n-1;i>=(0);i--)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define all(v) (v).begin(),(v).end()\n#define eall(v) unique(all(v), v.end())\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))\n#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))\nconst int MOD = 1e9 + 7;\nconst int INF = 1e9;\nconst ll INFF = 1e18;\n\nconst int MAX_V = 510;\nint V; //????????°\nstruct edge { int to, cap, cost, rev; };\nvector<edge> G[MAX_V];\nint dist[MAX_V]; //???????????¢\nint prevv[MAX_V], preve[MAX_V];\nvoid add_edge(int from, int to, int cap, int cost) { // from->to????????????cap,?????????cost???????????????\n\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n// s??????t????????????f???????°??????¨???????±??????? ??????????????´??????-1\nint min_cost_flow(int s, int t, int f) {\n\tint res = 0;\n\twhile(f > 0) {\n\t\tfill(dist, dist + V, INF);\n\t\tdist[s] = 0;\n\t\tbool update = true;\n\t\twhile(update) {\n\t\t\tupdate = false;\n\t\t\tfor (int v = 0; v < V; ++v){\n\t\t\t\tif(dist[v] == INF)continue;\n\t\t\t\tfor (int i = 0; i < G[v].size(); ++i){\n\t\t\t\t\tedge &e = G[v][i];\n\t\t\t\t\tif(e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(dist[t] == INF) return -1;\n\t\t\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d * dist[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(void) {\n\tint v, E, F;\n\tcin >> v >> E >> F;\n\tV = v;\n\trep(i, E) {\n\t\tint a, b, c, d;\n\t\tcin >> a >> b >> c >> d;\n\t\tadd_edge(a, b, c, d);\n\t}\n\tint ans = min_cost_flow(0, v - 1, F);\n\tprintf(\"%d\\n\", ans);\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for (ll i=0;i<(n);++i)\nconst ll MOD=1e9+7;\n\ntemplate<typename T,typename E>\nstruct PrimalDual{\n const E inf=numeric_limits<E>::max()/2;\n struct edge{\n int to,rev; T cap; E cost;\n edge(int to,T cap,E cost,int rev):\n to(to),cap(cap),cost(cost),rev(rev){}\n };\n vector<vector<edge>> G;\n vector<E> h,dist;\n vector<int> prevv,preve;\n PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}\n void add_edge(int from,int to,T cap,E cost){\n G[from].emplace_back(to,cap,cost,G[to].size());\n G[to].emplace_back(from,0,-cost,G[from].size()-1);\n }\n void dijkstra(int s){\n struct P{\n E first; int second;\n P(E first,int second):first(first),second(second){}\n bool operator<(const P &a) const{\n return a.first<first;\n }\n };\n priority_queue<P> pq;\n fill(dist.begin(),dist.end(),inf);\n dist[s]=0;\n pq.emplace(dist[s],s);\n while(!pq.empty()){\n P p=pq.top(); pq.pop();\n int v=p.second;\n if (dist[v]<p.first) continue;\n for (int i=0;i<G[v].size();++i){\n edge &e=G[v][i];\n if (e.cap>0&&dist[v]+e.cost+h[v]-h[e.to]<dist[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v,preve[e.to]=i;\n pq.emplace(dist[e.to],e.to);\n }\n }\n }\n }\n E min_cost_flow(int s,int t,T f){\n E res=0;\n fill(h.begin(),h.end(),0);\n while(f>0){\n dijkstra(s);\n if (dist[t]==inf) return -1;\n for (int v=0;v<h.size();++v){\n if (dist[v]<inf) h[v]+=dist[v];\n }\n T d=f;\n for (int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=h[t]*d;\n for (int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return res;\n }\n};\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int V,E,F; cin >> V >> E >> F;\n PrimalDual<int,int> PD(V);\n rep(i,E){\n int u,v,c,d; cin >> u >> v >> c >> d;\n PD.add_edge(u,v,c,d);\n }\n cout << PD.min_cost_flow(0,V-1,F) << endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_V 500\n#define INF 1<<28\ntypedef pair<int,int> P;\nstruct edge{\n int to,cap,cost,rev;\n edge(){}\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n};\n\nint V;\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].push_back(edge(to,cap,cost,G[to].size()));\n G[to].push_back(edge(from,0,-cost,G[from].size()-1));\n}\n\nint min_cost_flow(int s,int t,int f){\n int res=0;\n fill(h,h+V,0);\n while(f>0){\n priority_queue<P,vector<P>,greater<P> > que;\n fill(dist,dist+V,INF);\n dist[s]=0;\n que.push(P(0,s));\n while(!que.empty()){\n P p=que.top();que.pop();\n int v=p.second;\n if(dist[v]<p.first) continue;\n for(int i=0;i<(int)G[v].size();i++){\n\tedge &e=G[v][i];\n\tif(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n\t dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\t prevv[e.to]=v;\n\t preve[e.to]=i;\n\t que.push(P(dist[e.to],e.to));\n\t}\n }\n }\n if(dist[t]==INF){\n return -1;\n }\n for(int v=0;v<V;v++) h[v]+=dist[v];\n\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return res;\n}\n\nint main(){\n int v,e,f;\n cin>>v>>e>>f;\n for(int i=0;i<e;i++){\n int u,v,c,d;\n cin>>u>>v>>c>>d;\n add_edge(u,v,c,d);\n }\n V=v;\n cout<<min_cost_flow(0,v-1,f)<<endl;\n return 0;\n}\n/*\nverified on 2017/04/26\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B\n*/", "#include <cstdio> // printf(), scanf()\n#include <vector>\n#include <algorithm> // min(), fill()\n\nusing namespace std;\nstatic const int MAX_V = 100;\nstatic const int INF = 100000000;\n\ntypedef struct edge_tbl\n{\n\tint to, cap, cost;\n\tunsigned long rev;\n} edge;\n\nvector<edge> G[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\nint V;\n\nint\nmin_cost_flow(int s, int t, int f)\n{\n\tint res = 0;\n\twhile (f > 0)\n\t{\n\t\tfill(dist, dist + V, INF);\n\t\tdist[s] = 0;\n\t\tbool update = true;\n\t\twhile (update)\n\t\t{\n\t\t\tupdate = false;\n\t\t\tfor (int v = 0; v < V; ++v)\n\t\t\t{\n\t\t\t\tif (dist[v] == INF)\n\t\t\t\t\tcontinue;\n\n\t\t\t\tfor (unsigned int i = 0; i < G[v].size(); ++i)\n\t\t\t\t{\n\t\t\t\t\tedge &e = G[v][i];\n\t\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost)\n\t\t\t\t\t{\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (dist[t] == INF)\n\t\t\treturn -1;\n\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v])\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\n\t\tf -= d;\n\t\tres += d * dist[t];\n\t\tfor (int v = t; v != s; v = prevv[v])\n\t\t{\n\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\n\treturn res;\n}\n\nint\nmain(int argc, char** argv)\n{\n\tint E, F;\n\tint u, v, cap, cost;\n\n\tscanf(\"%d %d %d\", &V, &E, &F);\n\tfor (int i = 0; i < E; ++i)\n\t{\n\t\tscanf(\"%d %d %d %d\", &u, &v, &cap, &cost);\n\t\tG[u].push_back((edge){v, cap, cost, G[v].size()});\n\t\tG[v].push_back((edge){u, 0, -cost, G[u].size() - 1});\n\t}\n\n\tprintf(\"%d\\n\", min_cost_flow(0, V - 1, F));\n\treturn 0;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\n\n\n\n\n\n#define MAX_V 100\nstruct edge { int to, cap, cost,rev; };\n\nint V; // ????????°\nvector<edge> G[MAX_V];\nvector<int> h(MAX_V);\t//??????????????£???\nint dist[MAX_V];// ???????????¢\nint prevv[MAX_V], preve[MAX_V];// ??´??????????????¨???\n\n// from??????to??????????????????cap????????????cost????????????????????????????????????\nvoid add_edge(int from, int to, int cap, int cost) {\n\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\n\nint shortest_path(int s,vector<int> &d){\n\tint v = d.size();\n\trep(i,d.size())d[i]=INF;\n\td[s]=0;\n\trep(loop,v){\n\t\tbool update = false;\n\t\trep(i,MAX_V){\n\t\t\tfor(auto e:G[i]){\n\t\t\t\tif(d[i]!=INF && d[e.to] > d[i]+e.cost){\n\t\t\t\t\td[e.to] = d[i]+e.cost;\n\t\t\t\t\tupdate = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!update)break;\n\t\tif(loop==v-1)return true;\t//negative_cycle\n\t}\n\treturn false;\n}\n\n\n// s??????t????????????f???????°??????¨???????±???????\n// ??????????????´??????-1?????????\nint min_cost_flow(int s, int t, int f) {\n\tint res = 0;\n\trep(i,h.size())h[i]=0;\n\tbool hoge=false;\n\twhile (f > 0) {\n\t\t// ?????????????????????????????¨??????h?????´??°??????\n\t\tif(!f){\n\t\t\tshortest_path(s, h);\n\t\t\tf=true;\n\t\t}\n\t\telse{\n\t\t\tpriority_queue<pii, vector<pii>, greater<pii> > que; fill(dist, dist + V, INF);\n\t\t\tdist[s] = 0;\n\t\t\tque.push(pii(0, s));\n\t\t\twhile (!que.empty()) {\n\t\t\t\tpii p = que.top(); que.pop();\n\t\t\t\tint v = p.second;\n\t\t\t\tif (dist[v] < p.first) continue;\n\t\t\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\t\t\tedge &e = G[v][i];\n\t\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to]; prevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tque.push(pii(dist[e.to], e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) return -1;\t//????????\\???????????????\n\t\t\n\t\tfor (int v = 0; v < V; v++) h[v] += dist[v];\n\t\t\n\t\t// s-t????????????????????£??????????????????\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d * h[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]]; e.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(){\n\tint e,f;\n\tcin>>V>>e>>f;\n\trep(i,e){\n\t\tint u,v,c,d;\n\t\tcin>>u>>v>>c>>d;\n\t\tadd_edge(u, v, c, d);\n\t}\n\tcout<<min_cost_flow(0, V-1, f)<<endl;\n}", "\nfrom heapq import heappush, heappop\nclass MinCostFlow:\n INF = 10**18\n\n def __init__(self, N):\n self.N = N\n self.G = [[] for i in range(N)]\n\n def add_edge(self, fr, to, cap, cost):\n G = self.G\n G[fr].append([to, cap, cost, len(G[to])])\n G[to].append([fr, 0, -cost, len(G[fr])-1])\n\n def flow(self, s, t, f):\n N = self.N; G = self.G\n INF = MinCostFlow.INF\n\n res = 0\n H = [0]*N\n prv_v = [0]*N\n prv_e = [0]*N\n\n while f:\n dist = [INF]*N\n dist[s] = 0\n que = [(0, s)]\n\n while que:\n c, v = heappop(que)\n if dist[v] < c:\n continue\n for i, (w, cap, cost, rev) in enumerate(G[v]):\n if cap > 0 and dist[w] > dist[v] + cost + H[v] - H[w]:\n dist[w] = r = dist[v] + cost + H[v] - H[w]\n prv_v[w] = v\n prv_e[w] = i\n heappush(que, (r, w))\n if dist[t] == INF:\n return -1\n\n for i in range(N):\n H[i] += dist[i]\n\n d = f; v = t\n while v != s:\n d = min(d, G[prv_v[v]][prv_e[v]][1])\n v = prv_v[v]\n f -= d\n res += d * H[t]\n v = t\n while v != s:\n e = G[prv_v[v]][prv_e[v]]\n e[1] -= d\n G[v][e[3]][1] += d\n v = prv_v[v]\n return res\n\n\nimport sys\nreadline = sys.stdin.readline\nwrite = sys.stdout.write\nN, M, F = map(int, readline().split())\n\nmcf = MinCostFlow(N)\nfor i in range(M):\n u, v, c, d = map(int, readline().split())\n mcf.add_edge(u, v, c, d)\nwrite(\"%d\\n\" % mcf.flow(0, N-1, F))\n", "#include <algorithm>\n#include <tuple>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define MAX_V 200\n#define INF 1000000\n\ntypedef tuple<int,int,int,int> Edge; // to,cap,cost,rev\nint V;\ntypedef vector<Edge> Vertex;\nvector<Vertex> G(MAX_V);\nint dist[MAX_V];\nint prev_v[MAX_V], prev_e[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost){\n G[from].emplace_back(to,cap,cost,G[to].size());\n G[to].emplace_back(from,0,-cost,G[from].size()-1);\n}\n\nint min_cost_flow(int s, int t, int f){\n int total_cost=0;\n while(f>0){\n fill(dist,dist+V,INF);\n dist[s]=0;\n bool update=true;\n while(update){\n update=false;\n for(int v=0;v<V;v++){\n if(dist[v]==INF) continue;\n for(int i=0;i<G[v].size();i++){\n auto& e = G[v][i];\n int to=get<0>(e), cap=get<1>(e), cost=get<2>(e);\n if(cap>0&&dist[to]>dist[v]+cost){\n dist[to]=dist[v]+cost;\n prev_v[to]=v;\n prev_e[to]=i;\n update=true;\n }\n }\n }\n }\n if(dist[t]==INF){\n return -1;\n }\n int d=f;\n for(int v=t;v!=s;v=prev_v[v]){\n d=min(d, get<1>(G[prev_v[v]][prev_e[v]]));\n }\n f-=d;\n total_cost+=d*dist[t];\n for(int v=t;v!=s;v=prev_v[v]){\n auto& e=G[prev_v[v]][prev_e[v]];\n get<1>(e)-=d;\n get<1>(G[v][get<3>(e)])+=d;\n }\n }\n return total_cost;\n}\n\nint main(){\n int E,F;\n cin>>V>>E>>F;\n for(int i=0;i<E;i++){\n int u,v,c,d;\n cin>>u>>v>>c>>d;\n add_edge(u,v,c,d); \n }\n cout<<min_cost_flow(0,V-1,F)<<endl;\n}", "#include <bits/stdc++.h>\n\nusing ll = long long;\nusing namespace std;\nconstexpr ll inf = 1e15;\nconstexpr ll mod = 1e9+7;\n\nstruct Edge {\n int to;\n int cap;\n int cost;\n int rev;\n};\nvector<Edge> edges[101];\n\nint primalDual(int s, int t, int f) {\n int ret = 0;\n priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;\n vector<int> potential(101, 0);\n vector<ll> dp(101, inf);\n vector<int> prevv(101, -1), preve(101, -1);\n // Dijkstra with potential\n while (f > 0) {\n dp.assign(101, inf);\n dp[s] = 0;\n q.push(make_pair(0, s));\n while (!q.empty()) {\n auto p = q.top();\n q.pop();\n if (dp[p.second] < p.first) continue;\n for (int i = 0; i < edges[p.second].size(); i++) {\n auto&& edge = edges[p.second][i];\n int nextCost = dp[p.second] + edge.cost + potential[p.second] - potential[edge.to];\n if (edge.cap > 0 && dp[edge.to] > nextCost) {\n dp[edge.to] = nextCost;\n prevv[edge.to] = p.second;\n preve[edge.to] = i;\n q.push(make_pair(nextCost, edge.to));\n }\n }\n }\n if (dp[t] == inf) return -1;\n for (int v = 0; v <= 100; v++) if (dp[v] < inf) potential[v] += dp[v];\n int addFlow = f;\n for (int v = t; v != s; v = prevv[v]) {\n addFlow = min(addFlow, edges[prevv[v]][preve[v]].cap);\n }\n f -= addFlow;\n ret += addFlow * potential[t];\n for (int v = t; v != s; v = prevv[v]) {\n Edge& e = edges[prevv[v]][preve[v]];\n e.cap -= addFlow;\n edges[v][e.rev].cap += addFlow;\n }\n }\n\n return ret;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n\n int V, E, F;\n cin>>V>>E>>F;\n for (int e = 0; e < E; e++) {\n int U, V, C, D;\n cin>>U>>V>>C>>D;\n edges[U].push_back(Edge{V, C, D, (int)edges[V].size()});\n edges[V].push_back(Edge{U, 0, -D, (int)edges[U].size()-1});\n }\n\n cout<<primalDual(0, V-1, F)<<endl;\n \n return 0;\n}\n", "#include <vector>\n#include <queue>\n#include <iostream>\nusing namespace std;\n\n#define MAX_E 1001\nint V, E, F, US[MAX_E], VS[MAX_E], CAP[MAX_E], COST[MAX_E];\n\nclass MinCostFlow {\npublic:\n const int INFTY = (1 << 21);\n struct Edge { int t, cap, cost, rev; };\n struct P {\n int d, id;\n bool operator < (const P &other) const {\n return d > other.d;\n }\n };\n\n MinCostFlow(int V):\n V(V), G(V, vector<Edge>(0)), dist(V, INFTY), prevv(V, -1), preve(V, -1), potential(V, 0) {}\n\n void addEdge(int s, int t, int cap, int cost) {\n G[s].push_back({ t, cap, cost, (int)G[t].size() });\n G[t].push_back({ s, 0, -cost, (int)G[s].size() - 1 });\n }\n\n int calc(int s, int t, int f) {\n int res = 0;\n\n while (f > 0) {\n dijkstra(s);\n if (dist.at(t) == INFTY) return -1;\n for (int v = 0; v < V; v++) potential.at(v) += dist.at(v);\n\n int d = f;\n for (int v = t; v != s; v = prevv.at(v)) {\n int cap = G.at(prevv.at(v)).at(preve.at(v)).cap;\n d = min(d, cap);\n }\n f -= d;\n res += d * potential.at(t);\n for (int v = t; v != s; v = prevv.at(v)) {\n Edge &edge = G.at(prevv.at(v)).at(preve.at(v));\n edge.cap -= d;\n G.at(v).at(edge.rev).cap += d;\n }\n }\n\n return res;\n }\n\nprivate:\n int V;\n vector<vector<Edge> > G;\n vector<int> dist, prevv, preve, potential;\n\n void dijkstra(int s) {\n reset(s);\n priority_queue<P> PQ;\n vector<bool> done(V, false);\n PQ.push({ 0, s });\n\n while (PQ.size()) {\n P p = PQ.top(); PQ.pop();\n if (done.at(p.id)) continue;\n done.at(p.id) = true;\n if (dist.at(p.id) < p.d) continue;\n for (int e = 0; e<G.at(p.id).size(); e++) {\n Edge &edge = G.at(p.id).at(e);\n if (done.at(edge.t)) continue;\n if (edge.cap <= 0) continue;\n if (dist.at(edge.t) <= dist.at(p.id) + edge.cost + potential.at(p.id) - potential.at(edge.t)) continue;\n dist.at(edge.t) = dist.at(p.id) + edge.cost + potential.at(p.id) - potential.at(edge.t);\n prevv.at(edge.t) = p.id;\n preve.at(edge.t) = e;\n PQ.push({ dist.at(edge.t), edge.t });\n }\n }\n }\n\n void reset(int s) {\n fill(dist.begin(), dist.end(), INFTY);\n dist.at(s) = 0;\n }\n};\n\nvoid input() {\n cin >> V >> E >> F;\n for (int i=0; i<E; i++) {\n cin >> US[i] >> VS[i] >> CAP[i] >> COST[i];\n }\n}\n\nvoid solve() {\n MinCostFlow mcf(V);\n for (int i=0; i<E; i++) {\n mcf.addEdge(US[i], VS[i], CAP[i], COST[i]);\n }\n cout << mcf.calc(0, V-1, F) << endl;\n}\n\nint main() {\n input();\n solve();\n}\n\n", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\nstatic const int MAX_V = 110;\nstatic const int INF = (1<<30);\n\ntypedef pair<int, int> P;\n\nstruct edge{ int to, cap, cost, rev;};\n\nint V;\nvector<edge> G[MAX_V];\nint h[MAX_V], dist[MAX_V], prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost){\n\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size()-1});\n}\n\nint min_cost_flow(int s, int t, int f){\n\tint res = 0;\n\tfill(h, h + V, 0);\n\twhile (f > 0){\n\t\tpriority_queue<P, vector<P>, greater<P> > que;\n\t\tfill(dist, dist + V, INF);\n\t\tdist[s] = 0;\n\t\tque.push(P(0, s));\n\t\twhile (!que.empty()){\n\t\t\tP p = que.top(); que.pop();\n\t\t\tint v = p.second;\n\t\t\tif (dist[v] < p.first) continue;\n\t\t\tfor (int i = 0; i < G[v].size(); ++i)\n\t\t\t{\n\t\t\t\tedge &e = G[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tque.push(P(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) return -1;\n\t\tfor (int v = 0; v < V; ++v) h[v] += dist[v];\n\n\t\tint d = f;\n\t for (int v = t; v != s; v = prevv[v]) d = min(d, G[prevv[v]][preve[v]].cap);\n\t f -= d;\n\t res += d * h[t];\n\t for (int v = t; v != s; v = prevv[v])\n\t {\n\t \tedge &e = G[prevv[v]][preve[v]];\n\t \te.cap -= d;\n\t \tG[v][e.rev].cap += d;\n\t }\n\t}\n\treturn res;\n}\n\nint main(int argc, char const *argv[])\n{\n\tint E, F;\n\tcin >> V >> E >> F;\n\tfor (int i = 0; i < E; ++i)\n\t{\n\t\tint s, t, c, d;\n\t\tcin >> s >> t >> c >> d;\n\t\tadd_edge(s, t, c, d);\n\t}\n\tcout << min_cost_flow(0, V-1, F) << endl;\n\treturn 0;\n}\n", "from collections import defaultdict\n\nv_num, e_num, flow = (int(n) for n in input().split(\" \"))\nedges = defaultdict(list)\nfor _ in range(e_num):\n s1, t1, cap, cost = (int(n) for n in input().split(\" \"))\n edges[s1].append([t1, cap, cost, len(edges[t1])])\n edges[t1].append([s1, 0, -cost, len(edges[s1]) - 1])\nanswer = 0\nbefore_vertice = [float(\"inf\") for n in range(v_num)]\nbefore_edge = [float(\"inf\") for n in range(v_num)]\nsink = v_num - 1\nwhile True:\n distance = [float(\"inf\") for n in range(v_num)]\n distance[0] = 0\n updated = 1\n while updated:\n updated = 0\n for v in range(v_num):\n if distance[v] == float(\"inf\"):\n continue\n for i, (target, cap, cost, trace_i) in enumerate(edges[v]):\n if cap > 0 and distance[target] > distance[v] + cost:\n distance[target] = distance[v] + cost\n before_vertice[target] = v\n before_edge[target] = i\n updated = 1\n if distance[sink] == float(\"inf\"):\n print(-1)\n break\n decreased = flow\n trace_i = sink\n while trace_i != 0:\n decreased = min(decreased, edges[before_vertice[trace_i]][before_edge[trace_i]][1])\n trace_i = before_vertice[trace_i]\n flow -= decreased\n trace_i = sink\n while trace_i != 0:\n this_edge = edges[before_vertice[trace_i]][before_edge[trace_i]]\n this_edge[1] -= decreased\n answer += this_edge[2] * decreased\n edges[trace_i][this_edge[3]][1] += decreased\n trace_i = before_vertice[trace_i]\n if flow <= 0:\n print(answer)\n break", "#include <bits/stdc++.h>\nusing namespace std;\n\n#if __has_include(\"print.hpp\")\n #include \"print.hpp\"\n#endif\n\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define ALL(x) (x).begin(), (x).end()\n#define RALL(x) (x).rbegin(), (x).rend()\n#define MOD 1000000007\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\ntypedef long long ll;\ntypedef pair<ll, ll> p;\n\nstruct edge{int to, cap, cost, rev;};\n\nint n, m;\nvector<vector<edge>> g;\nvector<int> dist, prevv, preve;\n\nvoid add_edge(int from, int to, int cap, int cost){\n g[from].push_back({to, cap, cost, int(g[to].size())});\n g[to].push_back({from, 0, -cost, int(g[from].size())-1});\n}\n\nint min_cost_flow(int s, int t, int f){\n int res = 0;\n while(f > 0){\n dist = vector<int>(n, INT_MAX);\n dist[s] = 0;\n bool update = true;\n while(update){\n update = false;\n for (int v = 0; v < n; v++) {\n if(dist[v] == INT_MAX) continue;\n for(int i = 0; i < int(g[v].size()); i++){\n auto &e = g[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost){\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n\n if(dist[t] == INT_MAX) return -1;\n\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, g[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prevv[v]) {\n auto &e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int f;\n cin >> n >> m >> f;\n g = vector<vector<edge>> (n);\n dist = vector<int>(n+100);\n prevv = vector<int>(n+109);\n preve = vector<int>(n+100);\n for (int i = 0; i < m; i++) {\n int from, to, c, d;\n cin >> from >> to >> c >> d;\n add_edge(from, to, c, d);\n }\n\n cout << min_cost_flow(0, n-1, f) << endl;\n}\n\n", "import java.io.InputStream;\nimport java.io.FileNotFoundException;\nimport java.util.Comparator;\nimport java.util.PriorityQueue;\nimport java.io.IOException;\nimport java.util.Queue;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.io.PrintWriter;\nimport java.util.ArrayDeque;\nimport java.util.List;\nimport java.io.FileInputStream;\nimport java.util.InputMismatchException;\n\npublic class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/A2\";\n\n FastScanner in;\n PrintWriter out;\n\n public void solve() {\n int V = in.nextInt();\n int E = in.nextInt();\n int F = in.nextInt();\n Graph<CappedEdge> g = Graph.create(V);\n for (int i = 0; i < E; i++) {\n int u = in.nextInt();\n int v = in.nextInt();\n int c = in.nextInt();\n int d = in.nextInt();\n CappedEdgeImpl.CappedEdgePair ep = CappedEdgeImpl.pairedEdges(u, v, c, d);\n g.addDirectionalEdge(u, ep.normal);\n g.addDirectionalEdge(v, ep.rev);\n }\n PrimaryDual primaryDual = new PrimaryDual(g);\n System.out.println(primaryDual.doit(0, V - 1, F));\n }\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n}\n\n\nclass FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }\n\n public long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextLongArray(m);\n }\n return map;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }\n\n public double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }\n\n public String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n\n public int[][] nextPackedIntArrays(int packN, int size) {\n int[][] res = new int[packN][size];\n for (int i = 0; i < size; i++) {\n for (int j = 0; j < packN; j++) {\n res[j][i] = nextInt();\n }\n }\n return res;\n }\n}\n\n\ninterface CappedEdge extends Edge {\n long cap();\n\n CappedEdge rev();\n\n void addCap(long cap);\n}\n\n\n\nclass PrimaryDual {\n public static final long INF = 1L << 60;\n\n final Graph<CappedEdge> g;\n\n final int[] prevNodes;\n final int[] prevEdges;\n final long[] minDist;\n final long[] potential;\n\n public PrimaryDual(Graph<CappedEdge> g) {\n this.g = g;\n prevNodes= new int[g.size()];\n prevEdges = new int[g.size()];\n minDist = new long[g.size()];\n potential = new long[g.size()];\n }\n\n public long doit(int source, int sink, int flow) {\n long res = 0;\n Arrays.fill(potential, 0);\n while (flow > 0) {\n DijkstraResult dres = dijkstra(source, potential);\n if (dres.minDist[sink] == INF) {\n return -1;\n }\n for (int i = 0; i < g.size(); i++) {\n potential[i] += dres.minDist[i];\n }\n long minFlow = flow;\n for (int v = sink; v != source; v = dres.prevNodes[v]) {\n minFlow = Math.min(minFlow, g.edges(dres.prevNodes[v]).get(dres.prevEdges[v]).cap());\n }\n flow -= minFlow;\n\n res += minFlow * potential[sink];\n for (int v = sink; v != source; v = dres.prevNodes[v]) {\n CappedEdge e = g.edges(dres.prevNodes[v]).get(dres.prevEdges[v]);\n e.addCap(-minFlow);\n e.rev().addCap(minFlow);\n }\n }\n return res;\n }\n\n private DijkstraResult dijkstra(int start, long[] potential) {\n Arrays.fill(minDist, INF);\n minDist[start] = 0;\n prevNodes[start] = prevEdges[start] = -1;\n\n PriorityQueue<State> pq = new PriorityQueue<>(Comparator.comparingLong(st -> st.cost));\n pq.add(new State(0, start));\n\n while (!pq.isEmpty()) {\n State st = pq.poll();\n List<? extends CappedEdge> es = g.edges(st.u);\n for (int i = 0; i < es.size(); i++) {\n CappedEdge e = es.get(i);\n if (e.cap() == 0 || st.cost > minDist[st.u]) {\n continue;\n }\n long ncost = minDist[st.u] + e.cost() + potential[st.u] - potential[e.to()];\n if (minDist[e.to()] > ncost) {\n minDist[e.to()] = ncost;\n prevNodes[e.to()] = st.u;\n prevEdges[e.to()] = i;\n pq.add(new State(ncost, e.to()));\n }\n }\n }\n return new DijkstraResult(minDist, prevNodes, prevEdges);\n }\n\n private class State {\n final long cost;\n final int u;\n\n public State(long cost, int u) {\n this.cost = cost;\n this.u = u;\n }\n }\n\n private class DijkstraResult {\n public final long[] minDist;\n public final int[] prevNodes;\n public final int[] prevEdges;\n\n public DijkstraResult(long[] minDist, int[] prevNodes, int[] prevEdges) {\n this.minDist = minDist;\n this.prevNodes = prevNodes;\n this.prevEdges = prevEdges;\n }\n }\n}\n\nclass CappedEdgeImpl implements CappedEdge {\n final int to;\n final long cost;\n\n private long cap;\n private CappedEdge rev;\n\n private CappedEdgeImpl(int to, long cost, long cap) {\n this.to = to;\n this.cost = cost;\n this.cap = cap;\n }\n\n public static class CappedEdgePair {\n public final CappedEdge normal;\n public final CappedEdge rev;\n\n public CappedEdgePair(CappedEdge normal, CappedEdge rev) {\n this.normal = normal;\n this.rev = rev;\n }\n }\n\n public static CappedEdgePair pairedEdges(int from, int to, long cap, long cost) {\n CappedEdgeImpl e = new CappedEdgeImpl(to, cost, cap);\n CappedEdgeImpl revE = new CappedEdgeImpl(from, -cost, 0);\n e.rev = revE;\n revE.rev = e;\n return new CappedEdgePair(e, revE);\n }\n\n @Override\n public int to() {\n return to;\n }\n\n @Override\n public long cost() {\n return cost;\n }\n\n @Override\n public long cap() {\n return cap;\n }\n\n @Override\n public CappedEdge rev() {\n return rev;\n }\n\n @Override\n public void addCap(long cap) {\n this.cap += cap;\n }\n}\n\nclass SimpleEdge implements Edge {\n private final int to;\n\n public SimpleEdge(int to) {\n this.to = to;\n }\n\n @Override\n public int to() {\n return to;\n }\n\n @Override\n public long cost() {\n return 1;\n }\n}\n\n\nclass Graph<E extends Edge> {\n private final int n;\n private final List<E>[] g;\n\n public static <E extends Edge> Graph<E> create(int n) {\n @SuppressWarnings(\"unchecked\")\n ArrayList<E>[] l = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n l[i] = new ArrayList<>();\n }\n return new Graph<>(n, l);\n }\n\n public Graph(int n, List<E>[] g) {\n this.n = n;\n this.g = g;\n }\n\n public static Graph<SimpleEdge> createDirectionalTree(int[] a, int[] b) {\n if (a.length != b.length) {\n throw new IllegalArgumentException(\"len(a) != len(b)\");\n }\n int n = a.length + 1;\n Graph<SimpleEdge> g = create(n);\n for (int i = 0; i < n - 1; i++) {\n g.addDirectionalEdge(a[i], new SimpleEdge(b[i]));\n }\n return g;\n }\n\n public static Graph<SimpleEdge> createUndirectionalTree(int[] a, int[] b, boolean oneOrigin) {\n if (a.length != b.length) {\n throw new IllegalArgumentException(\"len(a) != len(b)\");\n }\n int n = a.length + 1;\n Graph<SimpleEdge> g = create(n);\n\n int adjust = oneOrigin ? 1 : 0;\n for (int i = 0; i < n - 1; i++) {\n g.addDirectionalEdge(a[i] - adjust, new SimpleEdge(b[i] - adjust));\n g.addDirectionalEdge(b[i] - adjust, new SimpleEdge(a[i] - adjust));\n }\n return g;\n }\n\n public void addDirectionalEdge(int u, E e) {\n g[u].add(e);\n }\n\n public List<E> edges(int u) {\n return g[u];\n }\n\n public int edgeNum(int u) {\n return g[u].size();\n }\n\n public int totalEndgeNum() {\n return Arrays.stream(g)\n .map(List::size)\n .reduce(0, Integer::sum) / 2;\n }\n\n public int size() {\n return n;\n }\n\n /**\n *\n * @param start\n * @return The cost of node v is:\n * <ul>\n * <li>-(1L << 62) if a node is under negative loop</li>\n * <li>(1L << 62) if there is no edge to v</li>\n * <li>otherwise minimum cost from node u to a node</li>\n * </ul>\n */\n public long[] bellmanford(int start) {\n final long INF = 1L << 62;\n long[] dist = new long[n];\n Arrays.fill(dist, INF);\n dist[start] = 0;\n for (int i = 0; i < n - 1; i++) {\n for (int u = 0; u < n; u++) {\n for (Edge e : edges(u)) {\n dist[e.to()] = Math.min(dist[e.to()], dist[u] + e.cost());\n }\n }\n }\n\n long[] res = Arrays.copyOf(dist, dist.length);\n for (int u = 0; u < n; u++) {\n for (Edge e : edges(u)) {\n int v = e.to();\n if (dist[u] + e.cost() < dist[v]) {\n res[v] = -INF;\n }\n }\n }\n return res;\n }\n\n /**\n *\n * @param start\n * @return For each v, true if a node v can be arrived from start node, otherwise false.\n */\n public boolean[] canArrive(int start) {\n boolean[] res = new boolean[size()];\n canArriveInternal(start, res);\n return res;\n }\n\n private void canArriveInternal(int u, boolean[] visited) {\n visited[u] = true;\n for (Edge e : edges(u)) {\n if (visited[e.to()]) {\n continue;\n }\n canArriveInternal(e.to(), visited);\n }\n }\n\n public DiameterResult diameter() {\n if (totalEndgeNum() != n - 1) {\n throw new IllegalArgumentException(\"Graph should be tree\");\n }\n int[] parents = new int[size()];\n int[] dist = new int[size()];\n Arrays.fill(dist, -1);\n dfs(0, dist, parents, 0);\n\n int x = 0;\n for (int i = 1; i < size(); i++) {\n if (dist[x] < dist[i]) {\n x = i;\n }\n }\n\n int[] dist2 = new int[size()];\n Arrays.fill(dist2, -1);\n parents[x] = x;\n dfs(x, dist2, parents, 0);\n\n int best = 0;\n for (int i = 0; i < n; i++) {\n if (dist2[best] < dist2[i]) {\n best = i;\n }\n }\n return new DiameterResult(restore(x, best, parents), dist2[best] + 1);\n }\n\n private int[] restore(int from, int to, int[] parents) {\n List<Integer> pathL = new ArrayList<>();\n int cur = to;\n while (cur != from) {\n pathL.add(cur);\n cur = parents[cur];\n }\n pathL.add(from);\n\n int[] res = new int[pathL.size()];\n for (int i = 0; i < pathL.size(); i++) {\n res[i] = pathL.get(pathL.size() - i - 1);\n }\n return res;\n }\n\n private void dfs(int u, int[] dist, int[] parent, int depth) {\n dist[u] = depth;\n for (Edge e : g[u]) {\n if (dist[e.to()] != -1) {\n continue;\n }\n parent[e.to()] = u;\n dfs(e.to(), dist, parent, depth + 1);\n }\n }\n\n public static class DiameterResult {\n public final int[] path;\n public final int dist;\n\n public DiameterResult(int[] path, int dist) {\n this.path = path;\n this.dist = dist;\n }\n\n @Override\n public String toString() {\n return \"DiameterResult{\" +\n \"path=\" + Arrays.toString(path) +\n \", dist=\" + dist +\n '}';\n }\n }\n\n /**\n * Assuming edge is SimpleEdge\n * @param start\n * @return\n */\n public int[] bfs(int start) {\n int n = g.length;\n int[] dist = new int[n];\n Arrays.fill(dist, 1 << 30);\n dist[start] = 0;\n\n Queue<Integer> q = new ArrayDeque<>();\n q.add(start);\n while (!q.isEmpty()) {\n int u = q.poll();\n for (Edge e : g[u]) {\n if (dist[e.to()] == 1 << 30) {\n dist[e.to()] = dist[u] + 1;\n q.add(e.to());\n }\n }\n }\n return dist;\n }\n}\n\nclass EdgeImpl implements Edge {\n private final int to;\n private final long cost;\n\n public EdgeImpl(int to, long cost) {\n this.to = to;\n this.cost = cost;\n }\n\n @Override\n public int to() {\n return to;\n }\n\n @Override\n public long cost() {\n return cost;\n }\n}\n\ninterface EdgeGenerator<E extends Edge> {\n E generate(int to, E originalEdge);\n}\n\ninterface Edge {\n int to();\n\n long cost();\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define INF 1e9\nstruct edge{\n\t//行先、容量、コスト、逆辺\n\tint to,cap,cost,rev;\t\n};\t\nvoid add_edge(int from,int to,int cap ,int cost,vector<vector<edge> > &g){\n\tg[from].push_back( (edge) { to,cap,cost,(int)g[to].size() } );\n\tg[to].push_back( (edge){from,0, -cost,(int)g[from].size()-1});\n}\n// s to t minmun flow \n// can't reach -1\nint min_cost_flow(int s,int t,int f,vector<vector<edge> > &g){\n\tint res = 0;\n\tint v = (int)g.size();\n\tvector<int> prevv(v),preve(v);\n\twhile( f > 0 ){\n\t\t//bellmanford s-t周辺最短路を求める\n\t\tvector<int> dist(v,INF);\n\t\tdist[s] = 0;\n\t\tbool update = true;\n\t\twhile(update){\n\t\t\tupdate = false;\n\t\t\tfor(int j= 0;j<v;j++){\n\t\t\t\tif(dist[j] == INF) continue;\n\t\t\t\tfor(int i= 0;i<g[j].size();i++){\n\t\t\t\t\tedge &e = g[j][i];\n\t\t\t\t\tif(e.cap > 0 && dist[e.to] > dist[j] + e.cost){\n\t\t\t\t\t\tdist[e.to] = dist[j] + e.cost;\n\t\t\t\t\t\tprevv[e.to] = j;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(dist[t] == INF ) return -1; //can't reach \n\t\t//s-t周辺に目いっぱい流す\n\t\tint d = f;\n\t\tfor(int i = t; i!= s; i = prevv[i]) d = min(d,g[prevv[i]][preve[i]].cap);\n\t\tf -= d;\n\t\tres += d*dist[t];\n\t\tfor(int i = t; i!= s; i = prevv[i]){\n\t\t\tedge &e = g[prevv[i]][preve[i]];\n\t\t\te.cap -= d;\n\t\t\tg[i][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\n\nint main(){\n\tint v,e,f;\n\tcin>>v>>e>>f;\n\tvector<vector<edge> > g(v);\n\tfor(int i=0;i<e;i++){\n\tint c,d,u,v;\n\tcin>>u>>v>>c>>d;\n\tadd_edge(u,v,c,d,g);\n\t}\n\tcout<<min_cost_flow(0,v-1,f,g)<<endl;\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n\ntemplate<class T>\nstruct min_cost_flow {\n\tusing value_type = T;\n\tusing P = pair<value_type, int>;\nprivate : \n\tconst value_type INF = numeric_limits<value_type>::max();\n\tstruct edge {\n\tpublic : \n\t\tint to, rev;\n\t\tvalue_type cap;\n\t\tvalue_type cost;\n\t\tedge (int to, value_type cap, value_type cost, int rev) : \n\t\t\tto(to), cap(cap), cost(cost), rev(rev) { }\n\t};\n\tint n;\n\tvector<vector<edge>> g;\n\tvector<value_type> potential;\n\tvector<value_type> dist;\n\tvector<int> prev_vertex;\n\tvector<int> prev_edge;\n\n\ttemplate<class E>\n\tinline bool chmin (E &a, const E &b) {\n\t\tif (a > b) { a = b; return true; }\n\t\treturn false;\n\t}\n\npublic : \n\tmin_cost_flow (int n) :\n\t\tn(n), g(n), potential(n), dist(n), prev_vertex(n), prev_edge(n) { }\n\n\tvoid add_edge (int from, int to, value_type cap, value_type cost) {\n\t\tg[from].emplace_back(to, cap, cost, g[to].size());\n\t\tg[to].emplace_back(from, 0, -cost, g[from].size() - 1);\n\t}\n\n\tvalue_type solve (int s, int t, value_type f) {\n\t\tvalue_type ret = 0;\n\t\tfill(potential.begin(), potential.end(), 0);\n\t\twhile (f > 0) {\n\t\t\tpriority_queue<P, vector<P>, greater<P>> que;\n\t\t\tfill(dist.begin(), dist.end(), INF);\n\t\t\tdist[s] = 0;\n\t\t\tque.emplace(dist[s], s);\n\t\t\twhile (not que.empty()) {\n\t\t\t\tvalue_type d; int v;\n\t\t\t\ttie(d, v) = que.top(); que.pop();\n\t\t\t\tif (dist[v] < d) continue;\n\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tconst edge &e = g[v][i];\n\t\t\t\t\tif (e.cap > 0 and chmin(dist[e.to], dist[v] + e.cost + potential[v] - potential[e.to])) {\n\t\t\t\t\t\tprev_vertex[e.to] = v;\n\t\t\t\t\t\tprev_edge[e.to] = i;\n\t\t\t\t\t\tque.emplace(dist[e.to], e.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[t] == INF) return -1;\n\t\t\tfor (int v = 0; v < n; v++) potential[v] += dist[v];\n\t\t\tvalue_type val = f;\n\t\t\tfor (int v = t; v != s; v = prev_vertex[v]) {\n\t\t\t\tchmin(val, g[prev_vertex[v]][prev_edge[v]].cap);\n\t\t\t}\n\t\t\tf -= val;\n\t\t\tret += (val * potential[t]);\n\t\t\tfor (int v = t; v != s; v = prev_vertex[v]) {\n\t\t\t\tedge &e = g[prev_vertex[v]][prev_edge[v]];\n\t\t\t\te.cap -= val;\n\t\t\t\tg[v][e.rev].cap += val;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n};\n\nint main() {\n\tint n, m, f;\n\tcin >> n >> m >> f;\n\tmin_cost_flow<int> mcf(n);\n\tfor (int i = 0; i < m; i++) {\n\t\tint u, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\t\tmcf.add_edge(u, v, c, d);\n\t}\n\t\n\tcout << mcf.solve(0, n - 1, f) << '\\n';\n\t\n\treturn 0;\n}\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> Pll;\ntypedef vector<int> Vi;\n//typedef tuple<int, int, int> T;\n#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)\n#define REP(i,x) FOR(i,0,x)\n#define ALL(c) c.begin(), c.end()\n#define DUMP( x ) cerr << #x << \" = \" << ( x ) << endl\n\nconst int INF = 1e7;\n\ntemplate <typename T>\nstruct MinCostFlow {\n struct Edge {\n int to, rev; T cap, cost;\n Edge(int to, int rev, T cap, T cost) : to(to), rev(rev), cap(cap), cost(cost) { }\n };\n\n struct Node {\n int v; T dist;\n Node(int v, T dist) : v(v), dist(dist) { };\n bool operator < (const Node &n) const {\n return dist > n.dist; // reverse\n }\n };\n\n typedef vector<Edge> Edges;\n vector<Edges> G;\n int V;\n vector<int> dist, h, prevv, preve;\n\n MinCostFlow(int V) : V(V) { G.resize(V); }\n\n void add_edge(int from, int to, T cap, T cost) {\n G[from].emplace_back(to, G[to].size(), cap, cost);\n G[to].emplace_back(from, (int)G[from].size()-1, 0, -cost);\n }\n\n T primal_dual(int source, int sink, T f) {\n T res = 0;\n h.resize(V, 0);\n prevv.resize(V), preve.resize(V);\n while (f > 0) {\n priority_queue<Node> pque;\n dist.assign(V, INF);\n dist[source] = 0;\n pque.emplace(source, 0);\n while (not pque.empty()) {\n Node n = pque.top(); pque.pop();\n int v = n.v; T cost = n.dist;\n if (dist[v] < cost) continue;\n for (int i = 0; i < (int)G[v].size(); i++) {\n Edge e = G[v][i];\n if (e.cap > 0 and dist[v] - h[e.to] < dist[e.to] - e.cost - h[v]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v, preve[e.to] = i;\n pque.emplace(e.to, dist[e.to]);\n }\n }\n }\n if (dist[sink] == INF) return -1;\n for (int v = 0; v < V; v++) h[v] += dist[v];\n\n T d = f;\n for (int v = sink; v != source; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[sink];\n for (int v = sink; v != source; v = prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\n\nint main() {\n // use scanf in CodeForces!\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n int V, E, F; cin >> V >> E >> F;\n MinCostFlow<int> mcf(V);\n\n REP(_, E) {\n int u, v, c, d; cin >> u >> v >> c >> d;\n mcf.add_edge(u, v, c, d);\n }\n\n cout << mcf.primal_dual(0, V-1, F) << endl;\n return 0;\n}", "import java.io.*;\nimport java.util.*;\n\npublic class Main implements Runnable{\n private ArrayList<ArrayList<Integer>> graph;\n private Edge[] edges;\n public static void main(String[] args) throws Exception {\n new Thread(null, new Main(), \"bridge\", 16 * 1024 * 1024).start();\n }\n\n @Override\n public void run() {\n try {\n solve();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n private void solve() throws Exception{\n FastScanner scanner = new FastScanner(System.in);\n\n int V = scanner.nextInt();\n int E = scanner.nextInt();\n int F = scanner.nextInt();\n\n graph = new ArrayList<>(V);\n edges = new Edge[E * 2];\n for(int i = 0; i < V; ++i){\n graph.add(new ArrayList<Integer>());\n }\n\n int edgeSize = 0;\n for(int i = 0; i < E; ++i){\n int u = scanner.nextInt();\n int v = scanner.nextInt();\n int cap = scanner.nextInt();\n int cost = scanner.nextInt();\n\n edges[edgeSize++] = new Edge(v, 0, cap, cost);\n edges[edgeSize++] = new Edge(u, 0, 0, -cost);\n graph.get(u).add(edgeSize - 2);\n graph.get(v).add(edgeSize - 1);\n }\n\n costOfMaxFlow(F, 0, V - 1);\n }\n\n private void costOfMaxFlow(int F, int s, int t){\n int V = graph.size();\n int[] dist = new int[V];\n int[] curFlow = new int[V];\n int[] prevNode = new int[V];\n int[] prevEdge = new int[V];\n\n int totalFlow = 0;\n int totalCost = 0;\n\n while(totalFlow < F){\n BellmanFord(s, dist, prevNode, prevEdge, curFlow);\n if(dist[t] == Integer.MAX_VALUE){\n break;\n }\n\n int pathFlow = Math.min(curFlow[t], F - totalFlow);\n totalFlow += pathFlow;\n\n for(int v = t; v != s; v = prevNode[v]){\n Edge edge = edges[prevEdge[v]];\n totalCost += edge.cost * pathFlow;\n\n edge.flow += pathFlow;\n edges[prevEdge[v] ^ 1].flow -= pathFlow;\n }\n }\n\n if(totalFlow < F){\n System.out.println(\"-1\");\n }\n else{\n System.out.println(totalCost);\n }\n }\n\n private void BellmanFord(int s, int[] dist, int[] prevNode, int[] prevEdge, int[] curFlow){\n Arrays.fill(dist, Integer.MAX_VALUE);\n dist[s] = 0;\n curFlow[s] = Integer.MAX_VALUE;\n prevNode[s] = -1;\n prevEdge[s] = -1;\n\n LinkedList<Integer> queue = new LinkedList<>();\n queue.add(s);\n boolean[] inQueue = new boolean[dist.length];\n inQueue[s] = true;\n while(!queue.isEmpty()){\n Integer u = queue.poll();\n inQueue[u] = false;\n\n for(int edgeIndex : graph.get(u)){\n Edge edge = edges[edgeIndex];\n if(edge.flow >= edge.cap){\n continue;\n }\n\n if(dist[edge.v] > dist[u] + edge.cost){\n dist[edge.v] = dist[u] + edge.cost;\n prevNode[edge.v] = u;\n prevEdge[edge.v] = edgeIndex;\n curFlow[edge.v] = Math.min(curFlow[u], edge.cap - edge.flow);\n if(!inQueue[edge.v]){\n queue.add(edge.v);\n }\n }\n }\n }\n }\n\n static class Edge{\n int v;\n int flow;\n int cap;\n int cost;\n\n public Edge(int v, int flow, int cap, int cost){\n this.v = v;\n this.flow = flow;\n this.cap = cap;\n this.cost = cost;\n }\n }\n\n static class FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024 * 8];\n private int ptr = 0;\n private int buflen = 0;\n\n public FastScanner(InputStream in){\n this.in = in;\n }\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n public boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}", "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <typename Flow, typename Cost> class PrimalDual {\nprivate:\n Cost INF_COST = std::numeric_limits<Cost>::max();\npublic:\n struct Edge {\n int to;\n Flow cap;\n Cost cost;\n int rev;\n Edge () {}\n Edge (int t, Flow f, Cost c, int rev) : to(t), cap(f), cost(c), rev(rev) {}\n };\nprivate:\n vector<vector<Edge>> graph;\n vector<Cost> potential, min_cost;\n vector<int> prev_v, prev_e;\n\npublic:\n PrimalDual (int n) : graph(n) {}\n\n void add (int from, int to, Flow cap, Cost cost) {\n graph[from].push_back(Edge(to, cap, cost, (int) graph[to].size()));\n graph[to].push_back(Edge(from, 0, -cost, (int) graph[from].size() - 1));\n }\n\n Cost get (int start, int goal, Flow f) {\n int n = (int) graph.size();\n Cost res = 0;\n using Pi = pair<Cost, int>;\n priority_queue<Pi, vector<Pi>, greater<Pi>> que;\n potential.assign(n, 0);\n prev_e.assign(n, -1);\n prev_v.assign(n, -1);\n\n while (f > 0) {\n min_cost.assign(n, INF_COST);\n que.emplace(0, start);\n min_cost[start] = 0;\n while (que.size()) {\n Pi cur = que.top();\n que.pop();\n if (min_cost[cur.second] < cur.first) continue;\n for (int i = 0; i < (int) graph[cur.second].size(); i++) {\n Edge& e = graph[cur.second][i];\n Cost next_cost = min_cost[cur.second] + e.cost + potential[cur.second] - potential[e.to];\n if (e.cap > 0 && min_cost[e.to] > next_cost) {\n min_cost[e.to] = next_cost;\n prev_v[e.to] = cur.second;\n prev_e[e.to] = i;\n que.emplace(min_cost[e.to], e.to);\n }\n }\n }\n \n if (min_cost[goal] == INF_COST) return -1;\n for (int i = 0; i < n; i++) potential[i] += min_cost[i];\n Flow add_flow = f;\n for (int i = goal; i != start; i = prev_v[i]) {\n add_flow = min(add_flow, graph[prev_v[i]][prev_e[i]].cap);\n }\n f -= add_flow;\n res += add_flow * potential[goal];\n for (int i = goal; i != start; i = prev_v[i]) {\n Edge& e = graph[prev_v[i]][prev_e[i]];\n e.cap -= add_flow;\n graph[i][e.rev].cap += add_flow;\n }\n }\n return res;\n }\n};\nsigned main() {\n ios::sync_with_stdio(false); cin.tie(0);\n int n, m, f;\n cin >> n >> m >> f;\n PrimalDual<int, int> pd(n);\n for (int i = 0; i < m; i++) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n pd.add(a, b, c, d);\n }\n cout << pd.get(0, n - 1, f) << '\\n';\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int64;\n\nconst int MAX_V = 1e5 + 1;\nconst int INF = 1e9 + 1;\n\ntypedef pair< int, int > P;\n\n// O(|E||V|^2)\nstruct Edge {\n Edge(int _to, int _cap, int _cost, int _rev)\n : to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n int to, cap, cost, rev; // 逆辺\n};\n\nint V;\nvector< Edge > G[MAX_V]; // グラフの隣接リスト表現\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int _from, int _to, int _cap, int _cost) {\n G[_from].emplace_back(Edge(_to, _cap, _cost, G[_to].size()));\n G[_to].emplace_back(Edge(_from, 0, -_cost, G[_from].size() - 1));\n}\n\n// sからtへの流量fの最小費用流を求める\n// 流せない場合は-1を返す\nint min_cost_flow(int s, int t, int f) {\n int res = 0;\n fill(h, h + V, 0);\n while (f > 0) {\n // ダイクストラ法を用いてhを更新する\n priority_queue< P, vector< P >, greater< P > > q;\n fill(dist, dist + V, INF);\n dist[s] = 0;\n q.push(P(0, s));\n while (!q.empty()) {\n P p = q.top(); q.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < (int)G[v].size(); ++i) {\n\tEdge &e = G[v][i];\n\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t prevv[e.to] = v;\n\t // cout << \"v:\" << v << endl;\n\t preve[e.to] = i;\n\t // cout << \"i:\" << i << endl;\n\t q.push(P(dist[e.to], e.to));\n\t}\n }\n }\n if (dist[t] == INF) {\n return -1;\n }\n \n for (int v = 0; v < V; ++v) h[v] += dist[v];\n\n // cout << \"f:\" << f << endl;\n // s-t間最短経路に沿って目一杯流す\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n /*\n cout << G[prevv[v]][preve[v]].cap << endl;\n cout << prevv[v] << endl;\n cout << \"d:\" << d << endl;\n */\n }\n f -= d;\n // cout << \"f:\" << f << endl;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n // cout << \"d:\" << d << endl;\n // cout << 1 << endl;\n }\n return res;\n}\n\n\n\nint main()\n{\n int E, F;\n cin >> V >> E >> F;\n for (int i = 0; i < E; ++i) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n add_edge(u, v, c, d);\n }\n cout << min_cost_flow(0, V - 1, F) << endl;\n return 0;\n}\n\n", "import heapq as hp\nclass MinimumCostFlow():\n def __init__(self, N, INF=10**18):\n self.graph = [{} for _ in range(N)]\n self.N = N\n self.INF = INF\n \n def add_edge(self, u, v, cap, cost, undirected=False):\n # u -> v (maxflow, cost)\n if cap == 0: return\n if undirected:\n self.graph[u][v] = [cap, cost]\n self.graph[v][u] = [cap, -cost]\n elif v in self.graph[u]:\n self.graph[u][v] = [cap, cost]\n else:\n self.graph[u][v] = [cap, cost]\n self.graph[v][u] = [0, -cost] \n \n def dijkstra(self, start):\n self.dist = [self.INF]*self.N # nearest distance\n self.dist[start] = 0\n self.que = [(0, start)]\n while self.que:\n d, v = hp.heappop(self.que)\n if self.dist[v] < d: continue\n for nv, (ncap, ncost) in self.graph[v].items():\n if ncap > 0 and self.dist[nv] > self.dist[v] + ncost + self.H[v] - self.H[nv]:\n self.dist[nv] = self.dist[v] + ncost + self.H[v] - self.H[nv]\n self.prevv[nv] = v\n hp.heappush(self.que, (self.dist[nv], nv))\n \n \n def min_cost_flow(self, start, finish, flow):\n self.res = 0\n self.prevv = [-1]*self.N\n self.H = [0]*self.N # potential\n while flow > 0:\n self.dijkstra(start)\n if self.dist[finish] == self.INF: return -1 # cant run flow anymore\n for i in range(self.N):\n self.H[i] += self.dist[i]\n \n d = flow\n v = finish\n while v != start:\n d = min(d, self.graph[self.prevv[v]][v][0])\n v = self.prevv[v]\n flow -= d\n self.res += d*self.H[finish]\n\n v = finish\n while v != start:\n self.graph[self.prevv[v]][v][0] -= d\n self.graph[v][self.prevv[v]][0] += d\n v = self.prevv[v]\n return self.res\n \n\nif __name__ == \"__main__\":\n import sys\n input = sys.stdin.readline\n\n V, E, F = map(int, input().split())\n fl = MinimumCostFlow(V)\n for _ in range(E):\n u, v, c, d = map(int, input().split())\n fl.add_edge(u, v, c, d)\n \n print(fl.min_cost_flow(0, V-1, F))\n", "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <cmath>\n#include <queue>\nusing namespace std;\n\ntemplate<class T> struct PrimalDual {\n \n struct Edge {\n int to, rev;\n T cap, cost;\n Edge () {}\n Edge (int _to, T _cap, T _cost, int _rev) :\n to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n };\n \n const T INF = numeric_limits<T>::max() / 2;\n int N;\n vector< vector< Edge > > G;\n vector< T > h;\n vector< T > dist;\n vector< int > prevv, preve;\n PrimalDual (int n) : N(n), G(n), h(n), dist(n), prevv(n), preve(n) {}\n \n void add_edge(int from, int to, T cap, T cost) {\n G[from].push_back(Edge(to,cap,cost,(T)G[to].size()));\n G[to].push_back(Edge(from,0,-cost,(T)G[from].size()-1));\n }\n \n T get_min(int s, int t, T f) {\n T ret = 0;\n fill(h.begin(),h.end(),0);\n while (f > 0) {\n priority_queue< pair<T,int>, vector< pair<T,int> >, greater< pair<T,int> > > que;\n for (int i = 0; i < N; i++) dist[i] = INF;\n dist[s] = 0;\n que.push(make_pair(0,s));\n while (que.size() != 0) {\n\tpair< T, int > p = que.top();\n\tque.pop();\n\tint v = p.second;\n\tif (dist[v] < p.first) continue;\n\tfor (int i = 0; i < G[v].size(); i++) {\n\t Edge &e = G[v][i];\n\t if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t prevv[e.to] = v;\n\t preve[e.to] = i;\n\t que.push(make_pair(dist[e.to], e.to));\n\t }\n\t}\n }\n if (dist[t] == INF) {\n\treturn -1;\n }\n for (int v = 0; v < N; v++) h[v] += dist[v];\n T d = f;\n for (int v = t; v != s; v = prevv[v]) {\n\td = min(d,G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n ret += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n\tEdge &e = G[prevv[v]][preve[v]];\n\te.cap -= d;\n\tG[v][e.rev].cap += d;\n }\n }\n return ret;\n }\n \n};\n\nint main(){\n int V, E, F;\n\n cin >> V >> E >> F;\n PrimalDual<int> Graph(V);\n\n for(int i =0;i<E;i++){\n int ui,vi,ci,di;\n cin >> ui >> vi >> ci >> di;\n Graph.add_edge(ui,vi,ci,di);\n }\n \n cout << Graph.get_min(0,V-1,F) << endl;\n\n \n}", "#include <bits/stdc++.h>\n#define fi first\n#define se second\n#define mp make_pair\n#define pb push_back\nusing namespace std;\ntypedef pair <int, int> pii;\n\nconst int INF = 0x3f3f3f3f;\nint n, e, f, c[1005][1005];\nvector <pii> adj[1005];\n\nint dij(int s, int t, vector <int> &p, vector <int> &d) {\n//\tcout << \"WTFF\" << endl;\n\tfill(p.begin(), p.end(), -1);\n\tfill(d.begin(), d.end(), INF);\n\tvector <bool> inq(n + 5);\n\tp[s] = s, d[s] = 0, inq[s] = 1;\n\tqueue <int> q;\n\tq.push(s);\n\twhile (!q.empty()) {\n\t\tint u = q.front(); q.pop();\n\t\tinq[u] = 0;\n//\t\tcout << u << ' ' << d[u] << endl;\n\t\tfor (pii i : adj[u]) {\n\t\t\tif (d[u] + i.se < d[i.fi] && c[u][i.fi] > 0) {\n\t\t\t\td[i.fi] = d[u] + i.se;\n\t\t\t\tp[i.fi] = u;\n//\t\t\t\tcout << \">> \" << i.fi << ' ' << i.se << endl;\n\t\t\t\tif (!inq[i.fi]) {\n\t\t\t\t\tq.push(i.fi);\n\t\t\t\t\tinq[i.fi] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n//\tfor (int i = 0; i <= n; i++) cout << d[i] << ' ';\n//\tcout << endl;\n\tif (d[t] != INF) return d[t];\n\telse return -1;\n}\n\nint maxFlow(int s, int t) {\n//\tcout << \"WTF\" << endl;\n\tint rt = 0, cnt = 0, nf;\n\tvector <int> p, d;\n\tp.resize(n + 5);\n\td.resize(n + 5);\n\tint t1;\n\twhile (dij(s, t, p, d) != -1) {\n\t\tint bt = t;\n\t\tnf = INF;\n\t\twhile (p[bt] != bt) {\n\t\t\tint v = p[bt];\n\t\t\tnf = min(nf, c[v][bt]);\n//\t\t\tcout << v << ' ' << bt << ' ' << d[v] << endl;\n\t\t\tbt = v;\n\t\t}\n\t\tnf = min(f - cnt, nf);\n\t\trt += d[t] * nf, bt = t, cnt += nf;\n//\t\tcout << \">> \" << rt << ' ' << d[t] << ' ' << nf << ' ' << cnt << endl;\n\t\twhile (p[bt] != bt) {\n\t\t\tint v = p[bt];\n\t\t\tc[v][bt] -= nf;\n\t\t\tc[bt][v] += nf;\n\t\t\tbt = v;\n\t\t}\n\t\tif (cnt == f) break;\n\t}\n\tif (cnt == f) return rt;\n\telse return -1;\n}\n\nint main() {\n\tcin >> n >> e >> f;\n\tfor (int i = 0; i < e; i++) {\n\t\tint u, v, cap, w;\n\t\tcin >> u >> v >> cap >> w;\n\t\tc[u][v] = cap;\n\t\tadj[u].pb(mp(v, w));\n\t\tadj[v].pb(mp(u, -w));\n\t}\n\tc[n - 1][n] = f;\n\tadj[n - 1].pb(mp(n, 0));\n\tadj[n].pb(mp(n - 1, 0));\n\tcout << maxFlow(0, n) << endl;\n}\n\n", "#include<iostream>\nusing namespace std;\n//Minimum Cost Flow O(FE log V)\n#include<algorithm>\n#include<utility>\n#include<vector>\n#include<queue>\n#include<limits>\ntemplate<typename T>\nstruct MCF{\n\tstruct edge{\n\t\tint to,rev,cap;\n\t\tT cost;\n\t};\n\tvector<vector<edge> >G;\n\tvector<T>h,d;\n\tvector<int>pv,pe;\n\tMCF(int n_=0):G(n_),h(n_,0),d(n_),pv(n_),pe(n_){}\n\tvoid add_edge(int from,int to,int cap,T cost)\n\t{\n\t\tG[from].push_back({\n\t\t\tto,(int)G[to].size(),cap,cost\n\t\t});\n\t\tG[to].push_back({\n\t\t\tfrom,(int)G[from].size()-1,0,-cost\n\t\t});\n\t}\n\tT min_cost_flow(int s,int t,int f)//ans or -1\n\t{\n\t\tT ret=0;\n\t\twhile(f>0)\n\t\t{\n\t\t\tpriority_queue<pair<T,int>,vector<pair<T,int> >,greater<pair<T,int> > >P;\n\t\t\tfill(d.begin(),d.end(),numeric_limits<T>::max());\n\t\t\td[s]=0;\n\t\t\tP.push(make_pair(0,s));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tpair<T,int>p=P.top();P.pop();\n\t\t\t\tif(d[p.second]<p.first)continue;\n\t\t\t\tfor(int i=0;i<G[p.second].size();i++)\n\t\t\t\t{\n\t\t\t\t\tedge&e=G[p.second][i];\n\t\t\t\t\tif(e.cap>0&&d[e.to]>d[p.second]+e.cost+h[p.second]-h[e.to])\n\t\t\t\t\t{\n\t\t\t\t\t\td[e.to]=d[p.second]+e.cost+h[p.second]-h[e.to];\n\t\t\t\t\t\tpv[e.to]=p.second;\n\t\t\t\t\t\tpe[e.to]=i;\n\t\t\t\t\t\tP.push(make_pair(d[e.to],e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d[t]==numeric_limits<T>::max())return -1;\n\t\t\tfor(int u=0;u<G.size();u++)h[u]+=d[u];\n\t\t\tint d=f;\n\t\t\tfor(int u=t;u!=s;u=pv[u])d=min(d,G[pv[u]][pe[u]].cap);\n\t\t\tf-=d;\n\t\t\tret+=d*h[t];\n\t\t\tfor(int u=t;u!=s;u=pv[u])\n\t\t\t{\n\t\t\t\tG[pv[u]][pe[u]].cap-=d;\n\t\t\t\tG[u][G[pv[u]][pe[u]].rev].cap+=d;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n};\nint main()\n{\n\tint N,E,F;\n\tcin>>N>>E>>F;\n\tMCF<int>mf(N);\n\tfor(int i=0;i<E;i++)\n\t{\n\t\tint u,v,c,d;cin>>u>>v>>c>>d;\n\t\tmf.add_edge(u,v,c,d);\n\t}\n\tcout<<mf.min_cost_flow(0,N-1,F)<<endl;\n}\n", "import heapq\n\n\nclass PrimalDual:\n def __init__(self, n: int):\n \"\"\"頂点数をnとする。\"\"\"\n self.INF = 10 ** 9 + 7\n self.n = n\n self.graph = [[] for _ in range(n)]\n\n def add_edge(self, _from: int, to: int, capacity: int, cost: int):\n \"\"\"辺を追加\n 1. _fromからtoへ向かう容量capacity、単位コストcostの辺をグラフに追加する。\n 2. toから_fromへ向かう容量0、単位コスト-costの辺をグラフに追加する。\n \"\"\"\n forward = [to, capacity, cost, None]\n forward[3] = backward = [_from, 0, -cost, forward]\n self.graph[_from].append(forward)\n self.graph[to].append(backward)\n\n def min_cost_flow(self, s: int, t: int, f: int) -> int:\n \"\"\"s-tパス上に流量fを流すときの最小費用流を求める。\n 計算量: O(|F||E|log|V|)\n \"\"\"\n res = 0\n potential = [0] * self.n\n prv_v = [0] * self.n\n prv_e = [None] * self.n\n while f > 0:\n # ポテンシャルを用いたダイクストラ法\n dist = [self.INF] * self.n\n dist[s] = 0\n q = [(0, s)] # q = [(sからのコスト, 現在地)]\n while q:\n cost, _from = heapq.heappop(q)\n if dist[_from] < cost:\n continue\n for edge in self.graph[_from]:\n to, capacity, cost, _ = edge\n p_diff = potential[_from] - potential[to]\n if capacity > 0 and dist[_from] + cost + p_diff < dist[to]:\n dist[to] = dist[_from] + cost + p_diff\n prv_v[to] = _from\n prv_e[to] = edge\n heapq.heappush(q, (dist[to], to))\n\n if dist[t] == self.INF:\n return -1\n for i in range(self.n):\n if dist[i] != self.INF:\n potential[i] += dist[i]\n d = f\n v = t\n while v != s:\n d = min(d, prv_e[v][1])\n v = prv_v[v]\n f -= d\n res += potential[t] * d\n v = t\n while v != s:\n edge = prv_e[v]\n edge[1] -= d\n edge[3][1] += d\n v = prv_v[v]\n return res\n\n\nn, m, f = map(int, input().split())\nedges = [list(map(int, input().split())) for _ in range(m)]\n\n\npd = PrimalDual(n)\nfor edge in edges:\n pd.add_edge(*edge)\n \nans = pd.min_cost_flow(0, n - 1, f)\nprint(ans)\n", "#include <iostream>\n#include <vector>\n#include <numeric>\n#include <queue>\n#include <algorithm>\n#include <utility>\n#include <functional>\nusing namespace std;\n\ntemplate<typename Int = int>\nstruct PrimalDual {\n struct Edge {\n int dst;\n Int cap;\n Int flow;\n Int cost;\n int rev; \n bool isRev;\n Edge(int dst, Int cap, Int flow, Int cost, int rev, bool isRev)\n :dst(dst), cap(cap), flow(flow), cost(cost), rev(rev), isRev(isRev) {\n }\n };\n\n int n;\n vector<vector<Edge>> g;\n PrimalDual(int n_) : n(n_), g(vector<vector<Edge>>(n_)) {}\n void addEdge(int src, int dst, Int cap, Int cost) {\n g[src].emplace_back(dst, cap, 0, cost, g[dst].size(), false);\n g[dst].emplace_back(src, cap, cap, -cost, g[src].size() - 1, true);\n }\n Int solve(int s, int t, Int f) {\n constexpr Int INF = numeric_limits<Int>::max();\n Int res = 0;\n vector<Int> h(g.size()), dist(g.size());\n vector<int> prevv(g.size()), preve(g.size());\n while (f > 0) {\n priority_queue<pair<Int, int>> q;\n fill(dist.begin(), dist.end(), INF);\n dist[s] = 0;\n q.emplace(0, s);\n while (q.size()) {\n int d, v;\n tie(d,v) = q.top();\n q.pop();\n d = -d;\n if (dist[v] < d) continue;\n for(int i = 0; i < (int)g[v].size(); ++i){\n Edge &e = g[v][i];\n if (e.cap - e.flow > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst]) {\n dist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];\n prevv[e.dst] = v;\n preve[e.dst] = i;\n q.emplace(-dist[e.dst], e.dst);\n }\n }\n }\n if (dist[t] == INF) return -1;\n for (int i = 0; i < n; ++i) h[i] += dist[i];\n Int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = g[prevv[v]][preve[v]];\n d = min(d, e.cap - e.flow);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = g[prevv[v]][preve[v]];\n e.flow += d;\n g[v][e.rev].flow -= d;\n }\n }\n return res;\n }\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n int n, m, f;\n cin >> n >> m >> f;\n PrimalDual<int> pd(n);\n for (int i = 0; i < m; i++) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n pd.addEdge(u, v, c, d);\n }\n cout << pd.solve(0, n - 1, f) << endl;\n}", "#include <iostream>\n\nusing namespace std;\n\n#include <utility>\n#include <vector>\n#include <queue>\n\ntypedef pair<int, int> P;\nclass MinCostFlow {\n#define MAX_V 10001\nprivate:\n const int INF = 1e9 + 10;\n struct Edge {\n int to, cap, cost, rev;\n Edge(int to, int cap, int cost, int rev):\n to(to), cap(cap), cost(cost), rev(rev) { }\n };\n int V;\n vector<Edge> G[MAX_V];\n int h[MAX_V];\n int dist[MAX_V];\n int prevv[MAX_V], preve[MAX_V];\n\npublic:\n MinCostFlow(int V): V(V) { }\n\n void AddEdge(int from, int to, int cap, int cost) {\n G[from].push_back(Edge(to, cap, cost, G[to].size()));\n G[to].push_back(Edge(from, 0, -cost, G[from].size() - 1));\n }\n\n int Solve(int s, int t, int f) {\n int res = 0;\n fill(h, h + V, 0);\n \n while (f > 0) {\n priority_queue<P, vector<P>, greater<P>> que;\n fill(dist, dist + V, INF);\n dist[s] = 0;\n que.push(P(0, s));\n while (!que.empty()) {\n P p = que.top(); que.pop();\n int v = p.second;\n if (dist[v] < p.first) {\n continue;\n }\n for (int i = 0; i < G[v].size(); i++) {\n Edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INF) {\n return -1;\n }\n for (int v = 0; v < V; v++) {\n h[v] += dist[v];\n }\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n\n return res; \n }\n};\n\nint main() {\n int V, E, F;\n cin >> V >> E >> F;\n\n MinCostFlow mcf(V);\n\n for (int i = 0; i < E; i++) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n mcf.AddEdge(u, v, c, d);\n }\n \n int s = 0, t = V - 1;\n int ans = mcf.Solve(s, t, F);\n\n cout << ans << endl;\n \n return 0;\n}", "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\nusing namespace std;\nconst int inf=0xfffffff;\nstruct edge{\n int to,cap,cost,rev;\n};\nint v;\nvector<edge> G[105];\nint dist[105],prevv[105],preve[105];\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].push_back((edge){to,cap,cost,(int)G[to].size()});\n G[to].push_back((edge){from,0,-1*cost,(int)G[from].size()-1});\n}\nint min_cost_flow(int s,int t,int f){\n int res=0;\n while(f>0){\n for(int i=0;i<105;i++) dist[i]=inf;\n dist[0]=0;\n bool update=true;\n while(update){\n update=false;\n for(int i=0;i<v;i++){\n if(dist[i]>=inf) continue;\n for(int j=0;j<G[i].size();j++){\n edge &e=G[i][j];\n if(e.cap>0&&dist[e.to]>dist[i]+e.cost){\n dist[e.to]=dist[i]+e.cost;\n prevv[e.to]=i;\n preve[e.to]=j;\n update=true;\n }\n }\n }\n }\n if(dist[t]>=inf) return -1;\n int d=f;\n for(int i=t;i!=s;i=prevv[i]){\n d=min(d,G[prevv[i]][preve[i]].cap);\n //cout<<preve[i]<<\" \";\n }\n //cout<<endl;\n f-=d;\n res+=dist[t]*d;\n //cout<<\"d:\"<<d<<\" route:\";\n for(int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n //cout<<prevv[v]<<\" \";\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n //cout<<endl;\n\n }\n return res;\n}\nint main(){\n int e,f;\n cin>>v>>e>>f;\n for(int i=0;i<e;i++){\n int a,b,c,d;\n cin>>a>>b>>c>>d;\n add_edge(a,b,c,d);\n }\n cout<<min_cost_flow(0,v-1,f)<<endl;\n}\n\n", "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define mkp(x,y) (make_pair(x,y))\ntypedef pair<int,int> P;\n\nclass Edge\n{\npublic:\n int to,cap,cost,rev;\n Edge(int a,int b,int c,int d)\n {\n to=a;cap=b;cost=c;rev=d;\n }\n};\n\nclass MCMF\n{\npublic:\n vector<vector<Edge> > G;\n vector<int> dist;\n vector<int> prev,pree;\n const int INF=2e9+10;\n MCMF(int n)\n {\n G.resize(n);\n dist.resize(n);\n prev.resize(n);\n pree.resize(n);\n }\n void add(int from,int to,int cap,int cost)\n {\n G[from].emplace_back(to,cap,cost,G[to].size());\n G[to].emplace_back(from,0,-cost,G[from].size()-1);\n }\n int mcmf(int s,int t,int f)\n {\n int res=0;\n while(f>0)\n {\n priority_queue<P,vector<P>,greater<P> > q;\n fill(dist.begin(),dist.end(),INF);\n dist[s]=0;\n q.push(P(0,s));\n while(!q.empty())\n {\n P p=q.top();q.pop();\n int v=p.second;\n if(dist[v]<p.first) continue;\n for(int i=0;i<G[v].size();i++)\n {\n Edge &e=G[v][i];\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost)\n {\n dist[e.to]=dist[v]+e.cost;\n prev[e.to]=v;\n pree[e.to]=i;\n q.push(P(dist[e.to],e.to));\n }\n }\n }\n if(dist[t]==INF)\n {\n return -1;\n }\n int tot=0;\n int d=f;\n for(int v=t;v!=s;v=prev[v])\n {\n Edge &e=G[prev[v]][pree[v]];\n d=min(d,e.cap);\n tot+=e.cost;\n }\n f-=d;\n for(int v=t;v!=s;v=prev[v])\n {\n Edge &e=G[prev[v]][pree[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n res+=tot*d;\n }\n return res;\n }\n};\n\nint main()\n{\n int V,E,F;\n while(cin>>V>>E>>F)\n {\n MCMF mcmf(V);\n for(int i=0;i<E;i++)\n {\n int a,b,c,d;\n cin>>a>>b>>c>>d;\n mcmf.add(a,b,c,d);\n }\n cout<<mcmf.mcmf(0,V-1,F)<<endl;\n }\n return 0;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n//BEGIN CUT HERE\nstruct PrimalDual{\n const int INF = 1<<28;\n typedef pair<int,int> P;\n struct edge{\n int to,cap,cost,rev;\n edge(){}\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n };\n\n int n;\n vector<vector<edge> > G;\n vector<int> h,dist,prevv,preve;\n\n PrimalDual(){}\n PrimalDual(int sz):n(sz),G(sz),h(sz),dist(sz),prevv(sz),preve(sz){}\n \n void add_edge(int from,int to,int cap,int cost){\n G[from].push_back(edge(to,cap,cost,G[to].size()));\n G[to].push_back(edge(from,0,-cost,G[from].size()-1));\n }\n\n int flow(int s,int t,int f){\n int res=0;\n fill(h.begin(),h.end(),0);\n while(f>0){\n priority_queue<P,vector<P>,greater<P> > que;\n fill(dist.begin(),dist.end(),INF);\n dist[s]=0;\n que.push(P(0,s));\n while(!que.empty()){\n\tP p=que.top();que.pop();\n\tint v=p.second;\n\tif(dist[v]<p.first) continue;\n\tfor(int i=0;i<(int)G[v].size();i++){\n\t edge &e=G[v][i];\n\t if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n\t dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\t prevv[e.to]=v;\n\t preve[e.to]=i;\n\t que.push(P(dist[e.to],e.to));\n\t }\n\t}\n }\n if(dist[t]==INF){\n\treturn -1;\n }\n for(int v=0;v<n;v++) h[v]+=dist[v];\n\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n\td=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n\tedge &e=G[prevv[v]][preve[v]];\n\te.cap-=d;\n\tG[v][e.rev].cap+=d;\n }\n }\n return res;\n }\n};\n//END CUT HERE\n\nint main(){\n int v,e,f;\n cin>>v>>e>>f;\n PrimalDual pd(v);\n for(int i=0;i<e;i++){\n int u,v,c,d;\n cin>>u>>v>>c>>d;\n pd.add_edge(u,v,c,d);\n }\n cout<<pd.flow(0,v-1,f)<<endl;\n return 0;\n}\n/*\nverified on 2017/10/29\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B&lang=jp\n*/", "#include <bits/stdc++.h>\n#define INF 1000000000\n#define MAX_V 100\n#define MAX_E 1000\nusing namespace std;\ntypedef pair<int, int> P;\nstruct edge {\n\tint to, cap, cost, rev;\n\tedge(int to_, int cap_, int cost_, int rev_)\n\t\t: to(to_), cap(cap_), cost(cost_), rev(rev_) {}\n};\n\nint V, E;\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\n\nvoid AddEdge(int from, int to, int cap, int cost) {\n\tG[from].push_back(edge(to, cap, cost, G[to].size()));\n\tG[to].push_back(edge(from, 0, -cost, G[from].size() - 1));\n}\n\nint MinimumCostFlow(int s, int t, int f) {\n\tint res = 0;\n\tfill(h, h + V, 0);\n\twhile (f > 0) {\n\t\tpriority_queue<P, vector<P>, greater<P>> que;\n\t\tfill(dist, dist + V, INF);\n\t\tdist[s] = 0;\n\t\tque.push(P(0, s));\n\t\twhile (!que.empty()) {\n\t\t\tP p = que.top(); que.pop();\n\t\t\tint v = p.second;\n\t\t\tif (dist[v] < p.first) continue;\n\t\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\t\tedge &e = G[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tque.push(P(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) return -1;\n\t\tfor (int v = 0; v < V; v++)\n\t\t\th[v] += dist[v];\n\t\tint d = f;\n\t\tfor (int v = t; v != s;v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d * h[t];\n\t\tfor (int v = t; v != s;v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tint F;\n\tcin >> V >> E >> F;\n\tfor (int i = 0, u, v, c, d; i < E; i++) {\n\t\tcin >> u >> v >> c >> d;\n\t\tAddEdge(u, v, c, d);\n\t}\n\tcout << MinimumCostFlow(0, V - 1, F) << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1<<30;\n\ntypedef struct{\n int to, cap, cost, rev;\n}Edge;\n\nclass MinCostFlow{\nprivate:\n int V;\n vector<vector<Edge>> G;\npublic:\n MinCostFlow(int V): V(V){\n G.resize(V);\n }\n void add_edge(int u, int v, int c, int d){\n G[u].push_back({v, c, d, (int)G[v].size()});\n G[v].push_back({u, 0, -d, (int)G[u].size()-1});\n }\n int solve(int s, int t, int f){\n int res = 0;\n while(f > 0){\n vector<int> d(V, INF);\n vector<int> pars(V, -1);\n vector<int> eids(V, -1);\n d[s] = 0;\n \n bool updated = true;\n while(updated){\n updated = false;\n for(int v=0; v<V; v++) if(d[v]!=INF){\n for(int i=0; i<G[v].size(); i++){\n auto edge = G[v][i];\n if(edge.cap == 0)\n continue;\n if(d[edge.to] > d[v] + edge.cost){\n d[edge.to] = d[v] + edge.cost;\n pars[edge.to] = v;\n eids[edge.to] = i;\n updated = true;\n }\n }\n }\n }\n if(d[t] == INF)\n return -1;\n \n int mc = f;\n for(int v=t; v!=s; v=pars[v]){\n mc = min(mc, G[pars[v]][eids[v]].cap);\n }\n res += mc * d[t];\n f -= mc;\n for(int v=t; v!=s; v=pars[v]){\n auto &edge = G[pars[v]][eids[v]];\n edge.cap -= mc;\n G[v][edge.rev].cap += mc;\n }\n }\n return res;\n }\n};\n\nint V, E, F;\n\nint main(){\n cin >> V >> E >> F;\n \n MinCostFlow mcf(V);\n for(int i=0; i<E; i++){\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n mcf.add_edge(u, v, c, d);\n }\n \n cout << mcf.solve(0, V-1, F) << endl;\n \n return 0;\n}", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n#define INF 1<<30\n#define LINF 1LL<<60\n\n#define MAX_V 10000\nstruct edge{\n int to;\n int cap;\n int cost;\n int rev;\n edge(){}\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n};\n\nint V;\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\nvoid init_edge(){\n for(int i=0;i<V;i++)G[i].clear();\n}\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].push_back(edge(to,cap,cost,(int)G[to].size()));\n G[to].push_back(edge(from,0,-cost,(int)G[from].size()-1));\n}\nint min_cost_flow(int s,int t,int f){\n int res = 0;\n fill(h,h+V,0);\n while(f>0){\n priority_queue< pii, vector<pii>, greater<pii> > que;\n fill( dist, dist+V , INF );\n dist[s]=0;\n que.push(pii(0,s));\n while(!que.empty()){\n pii p = que.top(); que.pop();\n int v = p.second;\n if(dist[v]<p.first)continue;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(pii(dist[e.to],e.to));\n }\n }\n }\n \n if(dist[t]==INF){\n return -1;\n }\n for(int v=0;v<V;v++)h[v]+=dist[v];\n \n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\nint main(){\n int E,F,a,b,c,d;\n cin>>V>>E>>F;\n while(E--){\n cin>>a>>b>>c>>d;\n add_edge(a,b,c,d);\n }\n cout<<min_cost_flow(0,V-1,F)<<endl;\n return 0;\n}\n\n", "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <queue>\n#include <functional>\nusing namespace std;\n\nconst int MAX_V = 100010;\nusing Capacity = int;\nusing Cost = int;\nconst auto inf = numeric_limits<Capacity>::max() / 8;\n\nstruct Edge {\n\tint dst;\n\tCapacity cap, cap_orig;\n\tCost cost;\n\tint revEdge; bool isRev;\n\tEdge(int dst, Capacity cap, Cost cost, int revEdge, bool isRev)\n\t\t:dst(dst), cap(cap), cap_orig(cap), cost(cost), revEdge(revEdge), isRev(isRev) {\n\t}\n};\n\nstruct PrimalDual {\n\tint n;\n\tvector<vector<Edge> > g;\n\tPrimalDual(int n_) : n(n_), g(vector<vector<Edge> >(n_)) {}\n\tvoid add_edge(int src, int dst, Capacity cap, Cost cost) { // ?????????\n\t\tg[src].emplace_back(dst, cap, cost, g[dst].size(), false);\n\t\tg[dst].emplace_back(src, 0, -cost, g[src].size() - 1, true);\n\t}\n\tCost solve(int s, int t, int f) {\n\t\tCost res = 0;\n\t\tstatic Cost h[MAX_V], dist[MAX_V];\n\t\tstatic int prevv[MAX_V], preve[MAX_V];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\th[i] = 0;\n\t\t}\n\t\twhile(f > 0) {\n\t\t\ttypedef pair<Cost, int> pcv;\n\t\t\tpriority_queue<pcv, vector<pcv>, greater<pcv> > q;\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tdist[i] = inf;\n\t\t\t}\n\t\t\tdist[s] = 0;\n\t\t\tq.emplace(pcv(0, s));\n\t\t\twhile(q.size()) {\n\t\t\t\tpcv p = q.top(); q.pop();\n\t\t\t\tint v = p.second;\n\t\t\t\tif(dist[v] < p.first) continue;\n\t\t\t\tfor(int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge &e = g[v][i];\n\t\t\t\t\tif(e.cap > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst]) {\n\t\t\t\t\t\tdist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];\n\t\t\t\t\t\tprevv[e.dst] = v;\n\t\t\t\t\t\tpreve[e.dst] = i;\n\t\t\t\t\t\tq.emplace(pcv(dist[e.dst], e.dst));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(dist[t] == inf) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor(int v = 0; v < n; v++) {\n\t\t\t\th[v] += dist[v];\n\t\t\t}\n\t\t\t// s-t ????????????????????£??????????????????\n\t\t\tint d = f;\n\t\t\tfor(int v = t; v != s; v = prevv[v]) {\n\t\t\t\td = min(d, g[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= d;\n\t\t\tres += d * h[t];\n\t\t\tfor(int v = t; v != s; v = prevv[v]) {\n\t\t\t\tEdge &e = g[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tg[v][e.revEdge].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t// ??????????????????=???????????????-?????¨??????????????¨???\n\tvoid view() {\n\t\tfor(int i = 0; i < g.size(); i++) {\n\t\t\tfor(int j = 0; j < g[i].size(); j++) {\n\t\t\t\tif(!g[i][j].isRev) {\n\t\t\t\t\tEdge& e = g[i][j];\n\t\t\t\t\tprintf(\"%3d->%3d (flow:%d)\\n\", i, e.dst, e.cap_orig - e.cap);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint V, E, F;\n\tcin >> V >> E >> F;\n\n\tPrimalDual pd(V);\n\n\tfor(int i = 0; i < E; i++) {\n\t\tint u, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\t\tpd.add_edge(u, v, c, d);\n\t}\n\n\tint res = pd.solve(0, V - 1, F);\n\tif(res == inf) res = -1;\n\tcout << res << endl;\n}", "#include <stdio.h>\n#include <vector>\n#include <algorithm>\n#include <queue>\nusing namespace std;\nnamespace MCF{\n\tconst int MAXN=120;\n\tconst int MAXM=2100;\n\tint to[MAXM];\n\tint next[MAXM];\n\tint first[MAXN];\n\tint c[MAXM];\n\tlong long w[MAXM];\n\tlong long pot[MAXN];\n\tint rev[MAXM];\n\tlong long ijk[MAXN];\n\tint v[MAXN];\n\tlong long toc;\n\tint tof;\n\tint n;\n\tint m;\n\tvoid init(int _n){\n\t\tn=_n;for(int i=0;i<n;i++)first[i]=-1;\n\t}\n\tvoid ae(int a,int b,int cap,int wei){\n\t\tnext[m]=first[a];to[m]=b;first[a]=m;c[m]=cap;w[m]=wei;m++;\n\t\tnext[m]=first[b];to[m]=a;first[b]=m;c[m]=0;w[m]=-wei;m++;\n\t}\n\tint solve(int s,int t,int flo){\n\t\ttoc=tof=0;\n\t\tfor(int i=0;i<n;i++)pot[i]=0;\n\t\twhile(tof<flo){\n\t\t\tfor(int i=0;i<n;i++)ijk[i]=9999999999999LL;\n\t\t\tfor(int i=0;i<n;i++)v[i]=0;\n\t\t\tpriority_queue<pair<long long,int> > Q;\n\t\t\tijk[s]=0;\n\t\t\tQ.push(make_pair(0,s));\n\t\t\twhile(Q.size()){\n\t\t\t\tlong long cost=-Q.top().first;\n\t\t\t\tint at=Q.top().second;\n\t\t\t\tQ.pop();\n\t\t\t\tif(v[at])continue;\n\t\t\t\tv[at]=1;\n\t\t\t\tfor(int i=first[at];~i;i=next[i]){\n\t\t\t\t\tint x=to[i];\n\t\t\t\t\tif(v[x]||ijk[x]<=ijk[at]+w[i]-pot[x]+pot[at])continue;\n\t\t\t\t\tif(c[i]==0)continue;\n\t\t\t\t\tijk[x]=ijk[at]+w[i]-pot[x]+pot[at];\n\t\t\t\t\trev[x]=i;\n\t\t\t\t\tQ.push(make_pair(-ijk[x],x));\n\t\t\t\t}\n\t\t\t}\n\t\t\tint flow=flo-tof;\n\t\t\tif(!v[t])return 0;\n\t\t\tint at=t;\n\t\t\twhile(at!=s){\n\t\t\t\tflow=min(flow,c[rev[at]]);\n\t\t\t\tat=to[rev[at]^1];\n\t\t\t}\n\t\t\tat=t;\n\t\t\ttof+=flow;\n\t\t\ttoc+=flow*(ijk[t]-pot[s]+pot[t]);\n\t\t\tat=t;\n\t\t\twhile(at!=s){\n\t\t\t\tc[rev[at]]-=flow;\n\t\t\t\tc[rev[at]^1]+=flow;\n\t\t\t\tat=to[rev[at]^1];\n\t\t\t}\n\t\t\tfor(int i=0;i<n;i++)pot[i]+=ijk[i];\n\t\t}\n\t\treturn 1;\n\t}\n}\nint main(){\n\tint a,b,c;scanf(\"%d%d%d\",&a,&b,&c);\n\tMCF::init(a);\n\tfor(int i=0;i<b;i++){\n\t\tint p,q,r,s;scanf(\"%d%d%d%d\",&p,&q,&r,&s);\n\t\tMCF::ae(p,q,r,s);\n\t}\n\tint res=MCF::solve(0,a-1,c);\n\tif(!res)printf(\"-1\\n\");\n\telse printf(\"%lld\\n\",MCF::toc);\n}", "import heapq\n\n\nclass MinCostFlow:\n class Edge:\n def __init__(self, to, cap, rev, cost):\n self.to, self.cap, self.rev, self.cost = to, cap, rev, cost\n\n def __init__(self, V):\n self.V = V\n self.E = [[] for _ in range(V)]\n\n def add_edge(self, fr, to, cap, cost):\n self.E[fr].append(self.Edge(to, cap, len(self.E[to]), cost))\n self.E[to].append(self.Edge(fr, 0, len(self.E[fr])-1, -cost))\n\n def run(self, source, sink, f, INF=10**5):\n res = 0\n h, prevv, preve = [0] * self.V, [0] * self.V, [0] * self.V\n while (f > 0):\n pque = []\n dist = [INF] * self.V\n dist[source] = 0\n heapq.heappush(pque, (0, source))\n while pque:\n cost, v = heapq.heappop(pque)\n cost = -cost\n if dist[v] < cost:\n continue\n for i, e in enumerate(self.E[v]):\n if e.cap > 0 and dist[v] - h[e.to] < dist[e.to] - e.cost - h[v]:\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to]\n prevv[e.to], preve[e.to] = v, i\n heapq.heappush(pque, (-dist[e.to], e.to))\n if dist[sink] == INF:\n return -1\n for v in range(self.V):\n h[v] += dist[v]\n\n d, v = f, sink\n while v != source:\n d = min(d, self.E[prevv[v]][preve[v]].cap)\n v = prevv[v]\n f -= d\n res += d * h[sink]\n v = sink\n while v != source:\n self.E[prevv[v]][preve[v]].cap -= d\n self.E[v][self.E[prevv[v]][preve[v]].rev].cap += d\n v = prevv[v]\n return res\n\nV, E, F = map(int, input().split())\nmcf = MinCostFlow(V)\nfor _ in range(E):\n u, v, c, d = map(int, input().split())\n mcf.add_edge(u, v, c, d)\nprint(mcf.run(0, V - 1, F))", "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing vin=vector<int>;\nusing vll=vector<long long>;\nusing vvin=vector<vector<int>>;\nusing vvll=vector<vector<long long>>;\nusing vstr=vector<string>;\nusing vvstr=vector<vector<string>>;\nusing vch=vector<char>;\nusing vvch=vector<vector<char>>;\nusing vbo=vector<bool>;\nusing vvbo=vector<vector<bool>>;\nusing vpii=vector<pair<int,int>>;\nusing pqsin=priority_queue<int,vector<int>,greater<int>>;\n#define mp make_pair\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)\n#define all(v) v.begin(),v.end()\n#define decp(n) cout<<fixed<<setprecision((int)n)\nconst int inf=1e9+7;\nconst ll INF=1e18;\n\nint MAX_V=110;\nstruct edge{int to;ll cap;ll cost;int rev;};\nint tmp1,tmp2;\n\nint V;//頂点数\nvector<vector<edge>> g(MAX_V);\nvll h(MAX_V);//ポテンシャル\nvll dist(MAX_V);\nvin prevv(MAX_V),preve(MAX_V);//直前の頂点と辺\n\nvoid add_edge(int from,int to,ll cap,ll cost){\n tmp1=g[to].size();tmp2=g[from].size();\n g[from].push_back((edge){to,cap,cost,tmp1});\n g[to].push_back((edge){from,(ll)0,-cost,tmp2});\n}\n\n//sからtへの最小費用流を求める\n//ながせない場合は-1\nll min_cost_flow(int s,int t,ll f){\n ll res=(ll)0;\n fill(all(h),(ll)0);\n ll d;\n while(f>0){\n //dijkstraを用いてhを初期化\n priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;\n fill(all(dist),(ll)inf);\n dist[s]=(ll)0;\n pq.push(mp((ll)0,s));\n while(pq.size()){\n auto p=pq.top();pq.pop();\n int v=p.second;\n if(dist[v]<p.first)continue;\n for(int i=0;i<g[v].size();i++){\n auto& e=g[v][i];\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n pq.push(mp(dist[e.to],e.to));\n }\n }\n }\n if(dist[t]==inf)return -1;\n rep(v,V)h[v]+=dist[v];\n d=f;\n for(int v=t;v!=s;v=prevv[v])d=min(d,g[prevv[v]][preve[v]].cap);\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n auto& e=g[prevv[v]][preve[v]];\n e.cap-=d;\n g[v][e.rev].cap+=d;\n }\n }\n return res;\n}\n\nint main(){\n int e,f;cin>>V>>e>>f;\n int u,v;ll c,d;\n rep(i,e){\n cin>>u>>v>>c>>d;\n add_edge(u,v,c,d);\n }\n cout<<min_cost_flow(0,V-1,f)<<endl;\n}\n", "#include <bits/stdc++.h>\n#define pb push_back\nusing namespace std;\nconst int INF=0x3f3f3f3f;\nconst int maxn=105;\nconst int maxq=1005;\n\nstruct edge{int to,cap,cost,rev;};\n\nint n,m,k;\nint d[maxn];\nint a[maxn];\nint p1[maxn];\nint p2[maxn];\nbool inq[maxn];\nvector<edge>G[maxn];\n\nvoid add_edge(int u,int v,int c,int w) {\n\tG[u].pb(edge{v,c,w,int(G[v].size())});\n\tG[v].pb(edge{u,0,-w,int(G[u].size()-1)});\n}\n\nint mcmf(int s,int t) {\n\tint flow=0 , cost=0;\n\twhile (1) {\n\t\tmemset(d,0x3f,sizeof(d));\n\t\td[s]=0; a[s]=max(0,k-flow);\n\t\tint qh=0,qt=0,q[maxq];\n\t\tq[qt++]=s; inq[s]=1;\n\t\twhile (qh<qt) {\n\t\t\tint u=q[qh++];\n\t\t\tinq[u]=0;\n\t\t\tfor (int i=0;i<G[u].size();i++) {\n\t\t\t\tedge e=G[u][i];\n\t\t\t\tif (d[e.to]>d[u]+e.cost && e.cap) {\n\t\t\t\t\td[e.to]=d[u]+e.cost;\n\t\t\t\t\ta[e.to]=min(a[u],e.cap);\n\t\t\t\t\tp1[e.to]=u;\n\t\t\t\t\tp2[e.to]=i;\n\t\t\t\t\tif (!inq[e.to]) {\n\t\t\t\t\t\tq[qt++]=e.to;\n\t\t\t\t\t\tinq[e.to]=1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (d[t]==INF || !a[t]) break;\n\t\tflow+=a[t];\n\t\tcost+=a[t]*d[t];\n\t\tfor (int u=t;u!=s;u=p1[u]) {\n\t\t\tedge& e=G[p1[u]][p2[u]];\n\t\t\te.cap-=a[t];\n\t\t\tG[e.to][e.rev].cap+=a[t];\n\t\t}\n\t}\n\tif (flow<k) return -1;\n\telse return cost;\n}\n\nint main() {\n\tcin>>n>>m>>k;\n\tfor (int i=0;i<m;i++) {\n\t\tint u,v,c,w; cin>>u>>v>>c>>w;\n\t\tadd_edge(u,v,c,w);\n\t}\n\tcout<<mcmf(0,n-1)<<'\\n';\n}\n", "from heapq import *\n\n# G : [to/from, cap, cost, rev]\ndef minimumCostFlow(N: int, G: list, s: int, t: int, flow: int):\n\tret = 0\n\tINF = 1 << 60\n\tpotential = [0] * N\n\tpre_vtx = [None] * N\n\tpre_edge = [None] * N\n\n\twhile flow > 0:\n\t\tdist = [INF] * N\n\t\tdist[s] = 0\n\t\tvisited = [False] * N\n\t\tq = [(0, s)]\n\t\twhile q:\n\t\t\td, cur = heappop(q)\n\t\t\tif visited[cur]:\n\t\t\t\tcontinue\n\t\t\tvisited[cur] = True\n\t\t\tfor i in range(len(G[cur])):\n\t\t\t\te = G[cur][i]\n\t\t\t\tnxt = e[0]\n\t\t\t\tif e[1] > 0 and dist[nxt] > dist[cur] + e[2] + potential[cur] - potential[nxt]:\n\t\t\t\t\tdist[nxt] = dist[cur] + e[2] + potential[cur] - potential[nxt]\n\t\t\t\t\tpre_vtx[nxt] = cur\n\t\t\t\t\tpre_edge[nxt] = i\n\t\t\t\t\theappush(q, (dist[nxt], nxt))\n\t\tif dist[t] == INF:\n\t\t\treturn -1\n\t\tfor i in range(N):\n\t\t\tpotential[i] += dist[i]\n\t\tdf = flow\n\t\tnow = t\n\t\twhile now != s:\n\t\t\tdf = min(df, G[pre_vtx[now]][pre_edge[now]][1])\n\t\t\tnow = pre_vtx[now]\n\t\tflow -= df\n\t\tret += df * potential[t]\n\t\tnow = t\n\t\twhile now != s:\n\t\t\tG[pre_vtx[now]][pre_edge[now]][1] -= df\n\t\t\tG[now][G[pre_vtx[now]][pre_edge[now]][3]][1] += df\n\t\t\tnow = pre_vtx[now]\n\treturn ret\n\n\nimport sys\ninput = sys.stdin.buffer.readline\n\n\ndef main():\n\tN, M, F = map(int, input().split())\n\tG = [[] for _ in range(N)] # [to/from, cap, cost, rev]\n\tfor _ in range(M):\n\t\tu, v, c, d = map(int, input().split())\n\t\tG[u].append([v, c, d, len(G[v])])\n\t\tG[v].append([u, 0, -d, len(G[u]) - 1])\n\tprint(minimumCostFlow(N, G, 0, N - 1, F))\n\n\nif __name__ == '__main__':\n\tmain()\n\n", "#include <iostream>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\ntemplate<typename CAP, typename COST>\nclass MinCostFlow {\npublic:\n explicit MinCostFlow(int N) : g(N) {}\n void addEdge(int src, int dst, CAP cap, COST cost){\n int r1 = g[src].size();\n int r2 = g[dst].size();\n g[src].emplace_back(src, dst, cap, cost, r2);\n g[dst].emplace_back(dst, src, 0, -cost, r1);\n }\n pair<COST, CAP> solve(int s, int t, CAP maxFlow){\n const int n = g.size();\n pair<COST, CAP> res = make_pair(0, 0);\n vector<COST> h(n, 0);\n while(maxFlow > 0){\n vector<COST> dist(n, INF); dist[s] = 0;\n vector<pair<int, int>> prev(n, make_pair(-1, -1));\n priority_queue<pair<COST, int>, vector<pair<COST, int>>, greater<pair<COST, int>>> qu;\n qu.emplace(0, s);\n while(!qu.empty()){\n auto e = qu.top(); qu.pop();\n if(dist[e.second] < e.first) continue;\n for(int i=0;i<g[e.second].size();i++){\n auto& p = g[e.second][i];\n if(p.cap > 0 && dist[p.dst] > dist[p.src] + p.cost + h[p.src] - h[p.dst]){\n dist[p.dst] = dist[p.src] + p.cost + h[p.src] - h[p.dst];\n prev[p.dst] = make_pair(p.src, i);\n qu.emplace(dist[p.dst], p.dst);\n }\n }\n }\n if(prev[t].first == -1) break;\n CAP f = maxFlow;\n for(int u=t;u!=s;u=prev[u].first) f = min(f, g[prev[u].first][prev[u].second].cap);\n for(int u=t;u!=s;u=prev[u].first){\n auto& p = g[prev[u].first][prev[u].second];\n auto& q = g[p.dst][p.rev];\n res.first += f * p.cost;\n p.cap -= f;\n q.cap += f;\n }\n res.second += f;\n for(int i=0;i<n;i++) h[i] += dist[i];\n maxFlow -= f;\n }\n return res;\n }\nprivate:\n class Edge {\n public:\n explicit Edge(int src, int dst, CAP cap, COST cost, int rev) : src(src), dst(dst), cap(cap), cost(cost), rev(rev) {}\n const int src;\n const int dst;\n CAP cap;\n COST cost;\n const int rev;\n };\nprivate:\n const COST INF = 1LL << 30;\n vector<vector<Edge>> g;\n};\n\nint main(){\n int V, E, F; cin >> V >> E >> F;\n MinCostFlow<int, int> mcf(V);\n for(int i=0;i<E;i++){\n int a, b, c, d; cin >> a >> b >> c >> d;\n mcf.addEdge(a, b, c, d);\n }\n auto res = mcf.solve(0, V-1, F);\n cout << (res.second == F ? res.first : -1) << endl;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing i64 = int64_t;\n\nconst i64 MOD = 1e9 + 7;\n\n\ntemplate <typename T, typename U>\nstruct PrimalDual{\n struct Edge{\n int to, rev;\n U cap;\n T cost;\n Edge(int to, U cap, T cost, int rev) :\n to(to), rev(rev), cap(cap), cost(cost){}\n };\n vector<vector<Edge>> edges;\n T _inf;\n vector<T> potential, min_cost;\n vector<int> prev_v, prev_e;\n\n PrimalDual(int n) : edges(n), _inf(numeric_limits<T>::max()){}\n\n void add(int from, int to, U cap, T cost){\n edges[from].emplace_back(to, cap, cost, static_cast<int>(edges[to].size()));\n edges[to].emplace_back(from, 0, -cost, static_cast<int>(edges[from].size()) - 1);\n }\n\n T solve(int s, int t, U flow){\n int n = edges.size();\n T ret = 0;\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> que;\n potential.assign(n, 0);\n prev_v.assign(n, -1);\n prev_e.assign(n, -1);\n while(flow > 0){\n min_cost.assign(n, _inf);\n que.emplace(0, s);\n min_cost[s] = 0;\n while(!que.empty()){\n T fl;\n int pos;\n tie(fl, pos) = que.top();\n que.pop();\n if(min_cost[pos] != fl)\n continue;\n for(int i = 0; i < edges[pos].size(); ++i){\n auto& ed = edges[pos][i];\n T nex = fl + ed.cost + potential[pos] - potential[ed.to];\n if(ed.cap > 0 && min_cost[ed.to] > nex){\n min_cost[ed.to] = nex;\n prev_v[ed.to] = pos;\n prev_e[ed.to] = i;\n que.emplace(min_cost[ed.to], ed.to);\n }\n }\n }\n if(min_cost[t] == _inf)\n return -1;\n for(int i = 0; i < n; ++i)\n potential[i] += min_cost[i];\n T add_flow = flow;\n for(int x = t; x != s; x = prev_v[x])\n add_flow = min(add_flow, edges[prev_v[x]][prev_e[x]].cap);\n flow -= add_flow;\n ret += add_flow * potential[t];\n for(int x = t; x != s; x = prev_v[x]){\n auto& ed = edges[prev_v[x]][prev_e[x]];\n ed.cap -= add_flow;\n edges[x][ed.rev].cap += add_flow;\n }\n }\n return ret;\n }\n};\n\n\nsigned main(){\n int n, m, f;\n cin >> n >> m >> f;\n PrimalDual<int,int> p(n);\n for(int i = 0; i < m; ++i){\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n p.add(u, v, c, d);\n }\n cout << p.solve(0, n - 1, f) << endl;\n}\n\n", "#include \"bits/stdc++.h\"\nusing namespace std;\n#ifdef _DEBUG\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\n//#define int long long\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define all(c) begin(c),end(c)\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)(1e9) + 7;\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }\n\nstruct MinimumCostFlow {\n\tusing Flow = int;\n\tusing Cost = int;\n\tstruct Edge {\n\t\tint to, rev;\n\t\tFlow cap;\n\t\tCost cost;\n\t\tEdge() {}\n\t\tEdge(int to, int rev, Flow cap, Cost cost) :to(to), rev(rev), cap(cap), cost(cost) {}\n\t};\n\tint n;\n\tvector<vector<Edge>> g;\n\tvector<int> dist;\n\tvector<int> prevv, preve;\n\tMinimumCostFlow(int n) :n(n), g(n), dist(n), prevv(n), preve(n) {}\n\tvoid addEdge(int from, int to, Flow cap, Cost cost) {\n\t\tg[from].emplace_back(to, (int)g[to].size(), cap, cost);\n\t\tg[to].emplace_back(from, (int)g[from].size() - 1, 0, -cost);\n\t}\n\t// s??????t????????????f???????°??????¨???\n\t// ??????????????´?????? -1\n\tCost minimumCostFlow(int s, int t, Flow f) {\n\t\tCost total = 0;\n\t\twhile (f > 0) {\n\t\t\t// Bellman-Ford\n\t\t\tfill(dist.begin(), dist.end(), INF);\n\t\t\tdist[s] = 0;\n\t\t\tbool update = true;\n\t\t\twhile (update) {\n\t\t\t\tupdate = false;\n\t\t\t\tfor (int v = 0; v < n; v++) {\n\t\t\t\t\tif (dist[v] == INF)continue;\n\t\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\t\tEdge &e = g[v][i];\n\t\t\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ????????\\???????????????\n\t\t\tif (dist[t] == INF)\n\t\t\t\treturn -1;\n\t\t\t// ?????????????????£??????????????????\n\t\t\tint d = f;\n\t\t\tfor (int v = t; v != s; v = prevv[v])\n\t\t\t\td = min(d, g[prevv[v]][preve[v]].cap);\n\t\t\tf -= d;\n\t\t\ttotal += d*dist[t];\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\tEdge &e = g[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tg[v][e.rev].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn total;\n\t}\n\n};\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint V, E, F; cin >> V >> E >> F;\n\tMinimumCostFlow mcf(V);\n\trep(i, 0, E) {\n\t\tint u, v, c, d; cin >> u >> v >> c >> d;\n\t\tmcf.addEdge(u, v, c, d);\n\t}\n\tcout << mcf.minimumCostFlow(0, V - 1, F) << endl;\n\treturn 0;\n}", "#!/usr/bin/env python3\n# N,M = map(int,sys.stdin.readline().split())\n# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param\n# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param\n# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param\n# s = sys.stdin.readline().rstrip()\n# N = int(sys.stdin.readline())\n# INF = float(\"inf\")\n\nimport sys,collections\nsys.setrecursionlimit(100000)\n\nINF = float(\"inf\")\n\nV,E,F = map(int,sys.stdin.readline().split())\nuvcd = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(E)) # multi line with multi param\n\n#uvcd = [[0,1,1,1],[0,2,3,2],[1,2,1,2],[2,3,2,1]]\ncapacityG = {i:{} for i in range(V)} #capacity\ncostG = {i:{} for i in range(V)} #capacity\n\nfor u,v,c,d in uvcd:\n capacityG[u][v] = c\n costG[u][v] = d\n if not u in capacityG[v]:\n capacityG[v][u] = 0\n costG[v][u] = -d\n\ndef shortest_path(V,costG,capacityG,start=0):\n distances = [INF]*V\n distances[start] = 0\n parents = list(range(V))\n\n for _ in range(V):\n modified = False\n for src in range(V):\n if distances[src] == INF: continue\n for dst,cost in costG[src].items():\n if capacityG[src][dst] > 0 and distances[dst] > distances[src] + cost:\n distances[dst] = distances[src] + cost\n parents[dst] = src\n modified = True\n if modified == False:\n return distances,parents\n return None,None\n\nrest = F\ntotal_cost = 0\nwhile rest != 0:\n distances,p = shortest_path(V,costG,capacityG,0)\n if not distances or distances[V-1] == INF:\n print(-1)\n exit()\n cur = V-1\n flow = rest\n while cur != 0:\n flow = min(flow,capacityG[p[cur]][cur])\n cur = p[cur]\n rest -= flow\n total_cost += distances[V-1]*flow\n cur = V-1\n while cur != 0:\n capacityG[p[cur]][cur] -= flow\n capacityG[cur][p[cur]] += flow #rev\n cur = p[cur]\nprint(total_cost)\n\n", "import java.io.*;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.util.stream.Collectors;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n\t\n\t//final boolean isDebug = true;\n\tfinal boolean isDebug = false;\n\tString fileName = \"input.txt\";\n\tFastScanner sc;\n\tPrintWriter out;\n\tfinal int MOD = (int)1e9+7;\n\tfinal int INF = Integer.MAX_VALUE / 2;\n\t\n\tvoid solve() throws Exception{\n\t\tint V = sc.nextInt();\n\t\tint E = sc.nextInt();\n\t\tint F = sc.nextInt();\n\t\tPrimalDual pd = new PrimalDual(V);\n\t\tfor(int i = 0; i < E; i++) pd.addEdge(sc.nextInt(), sc.nextInt(), sc.nextLong(), sc.nextLong());\n\t\tSystem.out.println(pd.minFlow(0, V-1, F));\n\t}\n\t\n\t/* end solve */\n\t\n\t/* main */\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().m();\n\t}\n\t\n\tvoid m() throws Exception {\n\t\tlong S = System.currentTimeMillis();\n\t\tsc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\tif(isDebug){\n\t\t\tSystem.out.println(\"---Debug---\");\n\t\t\tSystem.out.printf(\"%8d ms\", (G-S));\n\t\t}\n\t}\n\t/* end main */\n}\n/* end Main */\n\nclass PrimalDual{\n\tclass Edge{\n\t\tint to;\n\t\tlong cap;\n\t\tlong cost;\n\t\tint rev;\n\t\tboolean isRev;\n\t\tpublic Edge(int t, long cp, long cs, int r, boolean i){\n\t\t\tto = t; cap = cp; cost = cs; rev = r; isRev = i;\n\t\t}\n\t}\n\tclass Dist implements Comparable<Dist>{\n\t\tlong dist;\n\t\tint v;\n\t\t\n\t\tDist(long dist, int v){\n\t\t\tthis.dist = dist;\n\t\t\tthis.v = v;\n\t\t}\n\n\t\t//近い順に並べる\n\t\t@Override\n\t\tpublic int compareTo(Dist d) {\n\t\t\treturn Long.compare(d.dist, this.dist);\n\t\t}\n\t}\n\t\n\tlong INF = Long.MAX_VALUE / 2;\n\tint V;\n\tArrayList<ArrayList<Edge>> graph;\n\tlong[] potential, minCost;\n\tint[] prevv, preve;\n\t\n\tpublic PrimalDual(int V){\n\t\tthis.V = V;\n\t\tgraph = new ArrayList<>();\n\t\tfor(int i = 0; i < V; i++) graph.add(new ArrayList<>());\n\t\tpotential = new long[V];\n\t\tminCost = new long[V];\n\t\tprevv = new int[V];\n\t\tpreve = new int[V];\n\t}\n\t\n\tvoid addEdge(int from, int to, long cap, long cost){\n\t\tgraph.get(from).add(new Edge(to, cap, cost, graph.get(to).size(), false));\n\t\tgraph.get(to).add(new Edge(from, 0, -cost, graph.get(from).size()-1, true));\n\t}\n\t\n\tlong minFlow(int s, int t, long f){\n\t\tlong ret = 0;\n\t\tPriorityQueue<Dist> pq = new PriorityQueue<>();\n\t\tArrays.fill(potential, 0);\n\t\tArrays.fill(preve, -1);\n\t\tArrays.fill(prevv, -1);\n\t\t\n\t\twhile(f > 0){\n\t\t\tArrays.fill(minCost, INF);\n\t\t\tpq.add(new Dist(0, s));\n\t\t\tminCost[s] = 0;\n\t\t\t\n\t\t\twhile(!pq.isEmpty()){\n\t\t\t\tDist p = pq.remove();\n\t\t\t\tif(minCost[p.v] < p.dist) continue;\n\t\t\t\tfor(int i = 0; i < graph.get(p.v).size(); i++){\n\t\t\t\t\tEdge e = graph.get(p.v).get(i);\n\t\t\t\t\tlong nextCost = minCost[p.v] + e.cost + potential[p.v] - potential[e.to];\n\t\t\t\t\tif(e.cap > 0 && minCost[e.to] > nextCost){\n\t\t\t\t\t\tminCost[e.to] = nextCost;\n\t\t\t\t\t\tprevv[e.to] = p.v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tpq.add(new Dist(minCost[e.to], e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(minCost[t] == INF) return -1;\n\t\t\tfor(int v = 0; v < V; v++) potential[v] += minCost[v];\n\t\t\tlong addFlow = f;\n\t\t\tfor(int v = t; v != s; v = prevv[v])\n\t\t\t\taddFlow = Math.min(addFlow, graph.get(prevv[v]).get(preve[v]).cap);\n\t\t\tf -= addFlow;\n\t\t\tret += addFlow * potential[t];\n\t\t\tfor(int v = t; v != s; v = prevv[v]){\n\t\t\t\tEdge e = graph.get(prevv[v]).get(preve[v]);\n\t\t\t\te.cap -= addFlow;\n\t\t\t\tgraph.get(v).get(e.rev).cap += addFlow;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn ret;\n\t}\n\t\n\tvoid output(){\n\t\tfor(int i = 0; i < graph.size(); i++){\n\t\t\tfor(Edge e : graph.get(i)){\n\t\t\t\tif(e.isRev) continue;\n\t\t\t\tEdge revEdge = graph.get(e.to).get(e.rev);\n\t\t\t\tSystem.out.println(i + \" -> \" + e.to + \" (flow: \" + revEdge.cap + \" / \" + (e.cap + revEdge.cap) + \")\");\n\t\t\t}\n\t\t}\n\t}\n}\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public String nextLine() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(b != 10) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}\n", "#include <iostream>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\nconst int INF = 1e9;\n\nstruct Edge {\n int from, to, cap, flow, cost;\n Edge(int from, int to, int cap, int flow, int cost):from(from), to(to), cap(cap), \n flow(flow), cost(cost){} \n};\n\nstruct MaxflowMinCost {\n int n;\n vector<Edge> edges;\n vector<vector<int>> g;\n \n vector<int> p; //The id of the edge that connects to a vertex on the shortest path\n vector<int> a; //The possible flow change from the start to a vertex\n int flow = 0;\n int cost = 0;\n int f; //flow limit\n \n MaxflowMinCost(int n) : n(n) {\n g.assign(n + 1, vector<int>());\n }\n \n void addEdge(int from, int to, int cap, int cost) {\n edges.push_back(Edge(from , to, cap, 0, cost));\n edges.push_back(Edge(to, from, 0, 0, -cost));\n g[from].push_back(edges.size() - 2);\n g[to].push_back(edges.size() - 1); \n }\n \n int solve(int s, int t, int f) {\n this->f = f;\n while (bellmanFord(s, t)) {\n }\n return flow;\n }\n \n bool bellmanFord(int s, int t) {\n vector<int> d(n + 1, INF); //distance from s\n vector<bool> inq(n + 1, false);\n p.assign(n + 1, -1);\n a.assign(n + 1, 0);\n \n queue<int> q;\n p[s] = -2;\n a[s] = INF;\n d[s] = 0;\n inq[s] = true;\n \n q.push(s);\n \n while (!q.empty()) {\n int u = q.front(); q.pop();\n inq[u] = false;\n for (int eid: g[u]) {\n Edge e = edges[eid];\n if (e.cap > e.flow && d[e.to] > d[u] + e.cost) {\n d[e.to] = d[u] + e.cost;\n p[e.to] = eid;\n a[e.to] = min(a[u], e.cap - e.flow);\n if (!inq[e.to]) { \n q.push(e.to);\n inq[e.to] = true;\n }\n }\n }\n }\n if (d[t] == INF) {\n return false;\n }\n int aug = min(f, a[t]);\n f -= aug;\n \n flow += aug;\n cost += d[t] * aug;\n \n for (int u = t; u != s; u = edges[p[u]].from) {\n edges[p[u]].flow += a[t];\n edges[p[u] ^ 1].flow -= a[t];\n }\n \n if (f == 0) {\n return false;\n }\n \n return true;\n } \n};\n\nint main() {\n int v, e, s, t, f;\n cin >> v >> e >> f;\n s = 0;\n t = v - 1;\n MaxflowMinCost maxflow(v);\n for (int i = 0; i < e; i++) {\n int from, to, cap, cost;\n cin >> from >> to >> cap >> cost;\n maxflow.addEdge(from, to, cap, cost);\n }\n int ans = maxflow.solve(s, t, f);\n if (ans < f) {\n cout << -1 << endl;\n }\n else {\n cout << maxflow.cost << endl;\n }\n return 0;\n \n}", "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100\n\n\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_cost,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\tcost = arg_cost;\n\t\trev_index = arg_rev_index;\n\t}\n\n\tint to,capacity,cost,rev_index;\n};\n\nint V;\nvector<Edge> G[NUM];\nint dist[NUM];\nint pre_node[NUM],pre_edge[NUM];\n\n\nvoid add_edge(int from,int to,int capacity,int cost){\n\tG[from].push_back(Edge(to,capacity,cost,G[to].size()));\n\tG[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n}\n\nint min_cost_flow(int source,int sink,int flow){\n\tint ret = 0;\n\twhile(flow > 0){\n\n\t\tfor(int i = 0; i < V; i++)dist[i] = BIG_NUM;\n\t\tdist[source] = 0;\n\t\tbool update = true;\n\t\twhile(update){\n\t\t\tupdate = false;\n\t\t\tfor(int node_id = 0; node_id < V; node_id++){\n\t\t\t\tif(dist[node_id] == BIG_NUM)continue;\n\t\t\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\t\t\tEdge &e = G[node_id][i];\n\t\t\t\t\tif(e.capacity > 0 && dist[e.to] > dist[node_id]+e.cost){\n\t\t\t\t\t\tdist[e.to] = dist[node_id]+e.cost;\n\t\t\t\t\t\tpre_node[e.to] = node_id;\n\t\t\t\t\t\tpre_edge[e.to] = i;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(dist[sink] == BIG_NUM){\n\t\t\treturn -1;\n\t\t}\n\n\t\tint tmp_flow = flow;\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\ttmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\n\t\t}\n\t\tflow -= tmp_flow;\n\t\tret += tmp_flow*dist[sink];\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\tEdge &e = G[pre_node[node_id]][pre_edge[node_id]];\n\t\t\te.capacity -= tmp_flow;\n\t\t\tG[node_id][e.rev_index].capacity += tmp_flow;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main(){\n\n\tint E,F;\n\tscanf(\"%d %d %d\",&V,&E,&F);\n\n\tint from,to,capacity,cost;\n\tfor(int loop = 0; loop < E; loop++){\n\t\tscanf(\"%d %d %d %d\",&from,&to,&capacity,&cost);\n\t\tadd_edge(from,to,capacity,cost);\n\t}\n\n\tprintf(\"%d\\n\", min_cost_flow(0,V-1,F));\n\n\treturn 0;\n}\n\n", "#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\n#define chmin(a, b) ((a)=min((a), (b)))\n#define chmax(a, b) ((a)=max((a), (b)))\n#define fs first\n#define sc second\n#define eb emplace_back\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef tuple<int, int, int> T;\n\nconst ll MOD=1e9+7;\nconst ll INF=1e18;\nconst double pi=acos(-1);\nconst double eps=1e-10;\n\nint dx[]={1, 0, -1, 0};\nint dy[]={0, -1, 0, 1};\n\nconst int MAX_V = 110;\n\nstruct edge{\n int to, cap, cost, rev;\n};\n\nint V;\nvector<vector<edge>> G(MAX_V);\nint h[MAX_V]; // ポテンシャル h(v):=(s-v間の最短距離)\nint dist[MAX_V]; // 最短距離\nint prevv[MAX_V], preve[MAX_V]; //直前の頂点と辺\n\n// fromからtoへ向かう容量cap, コストcostの辺をグラフに追加する\nvoid add_edge(int from, int to, int cap, int cost){\n G[from].eb((edge){to, cap, cost, (int)G[to].size()});\n G[to].eb((edge){from, 0, -cost, (int)(G[from].size()-1)});\n}\n\n// sからtへの流量fの最小費用流を求める\n// 流せない場合は-1を返す\nint min_cost_flow(int s, int t, int f){\n int res = 0;\n fill(h, h+V, 0);\n while(f > 0){ // dijkstra\n priority_queue<P, vector<P>, greater<P>> que;\n fill(dist, dist+V, 1e9);\n dist[s] = 0;\n que.push(P(0, s));\n while(que.size()){\n P p = que.top(); que.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n for(int i=0; i<G[v].size(); i++){\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to], e.to));\n }\n }\n }\n\n if(dist[t] == 1e9){ // これ以上流せない\n return -1;\n }\n for(int v=0; v<V; v++){\n h[v] += dist[v];\n }\n\n // s-t間最短路に沿って目一杯流す\n int d = f;\n for(int v=t; v!=s; v=prevv[v]){\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for(int v=t; v!=s; v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n \n return res;\n}\n\nint main(){\n int e, f; cin>>V>>e>>f;\n for(int i=0; i<e; i++){\n int s, t, c, d; cin>>s>>t>>c>>d;\n add_edge(s, t, c, d);\n }\n\n cout << min_cost_flow(0, V - 1, f) << endl;\n}\n", "#include<bits/stdc++.h>\n#define vi vector<int>\n#define vvi vector<vector<int> >\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vb vector<bool>\n#define vc vector<char>\n#define vs vector<string>\nusing ll = long long;\nusing ld =long double;\n#define int ll\n#define INF 1e9\n#define EPS 0.0000000001\n#define rep(i,n) for(int i=0;i<n;i++)\n#define loop(i,s,n) for(int i=s;i<n;i++)\n#define all(in) in.begin(), in.end()\ntemplate<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }\ntemplate<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }\n#define MAX 9999999\nint dx[]={0,0,1,-1};\nint dy[]={1,-1,0,0};\nint W,H;\nbool inrange(int x,int y){return (0<=x&&x<W)&&(0<=y&&y<H);}\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef pair<int,pii> piii;\n#define MP make_pair\nstruct Edge{\n int to,cap,cost,rev;\n Edge(int _to,int _cap,int _cost,int _rev){\n to=_to;\n cap=_cap;\n cost=_cost;\n rev=_rev;\n }\n};\ntypedef vector<Edge> ve;\ntypedef vector<ve> vve;\nclass MCF{ //Minimum Cost Flow\n int inf = INF;\npublic:\n int n;\n vve G;\n vi h,dist,prev,pree;\n MCF(int size){\n n=size;\n G=vve(n);\n h=dist=prev=pree=vi(n);\n }\n void add_edge(int s,int t,int ca,int co){\n Edge e=Edge(t,ca,co,G[t].size());\n G[s].push_back(e);\n Edge ee=Edge(s,0,-co,G[s].size()-1);\n G[t].push_back(ee);\n }\n int mcf(int source,int sink,int f){\n int out=0;\n h=vi(n);\n while(f>0){\n priority_queue<pii,vector<pii> >q;\n dist=vi(n,inf);\n dist[source]=0;\n q.push(pii(0,source));\n while(!q.empty()){\n pii p=q.top();q.pop();\n int v=p.second;\n if(dist[v]<-p.first)continue;\n rep(i,G[v].size()){\n Edge &e=G[v][i];\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prev[e.to]=v;\n pree[e.to]=i;\n q.push(pii(-dist[e.to],e.to));\n }\n }\n }\n if(dist[sink]==inf)return -1;\n rep(i,n)h[i]+=dist[i];\n int d=f;\n for(int v=sink;v!=source;v=prev[v])d=min(d,G[prev[v]][pree[v]].cap);\n f-=d;\n out+=d*h[sink];\n for(int v=sink;v!=source;v=prev[v]){\n Edge &e=G[prev[v]][pree[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return out;\n }\n};\n\nsigned main(){\n int v,e,f; cin>>v>>e>>f;\n MCF hoge(v);\n rep(i,e){\n int a,b,c,d; cin>>a>>b>>c>>d;\n hoge.add_edge(a, b, c, d);\n }\n cout<<hoge.mcf(0, --v, f)<<endl;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define INF 1e9\nstruct min_cost_flow\n{\n struct edge{int to,cap,cost,rev;};\n int V;\n vector<vector<edge>> g;\npublic:\n min_cost_flow(int n)\n {\n V=n;\n g.resize(n,vector<edge>());\n }\n\n void add_edge(int from,int to,int cap ,int cost)\n {\n\t g[from].push_back( (edge) { to,cap,cost,(int)g[to].size() } );\n\t g[to].push_back( (edge){from,0, -cost,(int)g[from].size()-1});\n }\n// s to t minmun flow \n// can't reach -1\n int run(int s,int t,int f)\n {\n\t int res = 0;\n\t int v = (int)g.size();\n\t vector<int> prevv(v),preve(v);\n\t while( f > 0 )\n {\n\t\t//bellmanford s-t周辺最短路を求める\n\t\t vector<int> dist(v,INF);\n\t\t dist[s] = 0;\n\t\t bool update = true;\n\t\t while(update)\n {\n\t\t\t update = false;\n\t\t\t for(int j= 0;j<v;j++)\n {\n\t\t\t\t if(dist[j] == INF) continue;\n\t\t\t\t for(int i= 0;i<g[j].size();i++)\n {\n\t\t\t\t\t edge &e = g[j][i];\n\t\t\t\t\t if(e.cap > 0 && dist[e.to] > dist[j] + e.cost)\n {\n\t\t\t\t\t\t dist[e.to] = dist[j] + e.cost;\n\t\t\t\t\t\t prevv[e.to] = j;\n\t\t\t\t\t\t preve[e.to] = i;\n\t\t\t\t\t\t update = true;\n\t\t\t\t\t }\n\t\t\t\t }\n\t\t\t }\n\t\t }\n\t\t if(dist[t] == INF ) return -1; //can't reach \n\t\t //s-t周辺に目いっぱい流す\n\t\t int d = f;\n\t\t for(int i = t; i!= s; i = prevv[i]) d = min(d,g[prevv[i]][preve[i]].cap);\n\t\t f -= d;\n\t\t res += d*dist[t];\n\t\t for(int i = t; i!= s; i = prevv[i]){\n\t\t \tedge &e = g[prevv[i]][preve[i]];\n\t\t \te.cap -= d;\n\t\t \tg[i][e.rev].cap += d;\n\t\t }\n\t }\n\treturn res;\n }\n};\n\nint main()\n{\n\tint v,e,f;\n\tcin>>v>>e>>f;\n\tmin_cost_flow solve(v);\n\tfor(int i=0;i<e;i++){\n\tint c,d,u,v;\n\tcin>>u>>v>>c>>d;\n\tsolve.add_edge(u,v,c,d);\n\t}\n\tcout<<solve.run(0,v-1,f)<<endl;\n\treturn 0;\n}\n\n", "#include <stdio.h>\n#include <iostream>\n#include <vector>\n#include <string>\n#include <string.h>\n#include <math.h>\n#include <algorithm>\n#include <queue>\nusing namespace std;\n\n#define MAX_V 201\n#define INF 1000000000\n\ntypedef pair<int, int> P;\nstruct edge{int to, cap, cost, rev;};\nint V;\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V];\nint preve[MAX_V];\n\nvoid ae(int from, int to, int cap, int cost){\n G[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\nint minCostFlow(int s, int t, int f){\n int res = 0;\n memset(h,0,sizeof(h));\n while(f > 0){\n priority_queue<P, vector<P>, greater<P> > que;\n for(int i = 0; i < V; i++){\n dist[i] = INF;\n }\n dist[s] = 0;\n que.push(P(0,s));\n while(!que.empty()){\n P p = que.top(); que.pop();\n int v = p.second;\n if(dist[v] < p.first)continue;\n for(int i = 0; i < (int)G[v].size(); i++){\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to], e.to));\n }\n }\n }\n if(dist[t] == INF){\n return -1;\n }\n for(int v = 0; v < V; v++){\n h[v] += dist[v];\n }\n int d = f;\n for(int v = t; v != s; v = prevv[v]){\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for(int v = t; v != s; v = prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main(){\n int v,e,f;\n cin>>v>>e>>f;\n V=v;\n edge z;\n for(int i=0;i<e;i++){\n cin>>z.to>>z.cap>>z.cost>>z.rev;\n ae(z.to,z.cap,z.cost,z.rev);\n }\n cout << minCostFlow(0,v-1,f) << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct Primal_Dual\n{\n const int INF = 1 << 30;\n typedef pair< int, int > Pi;\n\n struct edge\n {\n int to, cap, cost, rev;\n };\n vector< vector< edge > > graph;\n vector< int > potential, min_cost, prevv, preve;\n\n Primal_Dual(int V) : graph(V) {}\n\n void add_edge(int from, int to, int cap, int cost)\n {\n graph[from].push_back((edge) {to, cap, cost, (int) graph[to].size()});\n graph[to].push_back((edge) {from, 0, -cost, (int) graph[from].size() - 1});\n }\n\n int min_cost_flow(int s, int t, int f)\n {\n int V = graph.size(), ret = 0;\n priority_queue< Pi, vector< Pi >, greater< Pi > > que;\n potential.assign(V, 0);\n preve.assign(V, -1);\n prevv.assign(V, -1);\n\n while(f > 0) {\n min_cost.assign(V, INF);\n que.push(Pi(0, s));\n min_cost[s] = 0;\n\n while(!que.empty()) {\n Pi p = que.top();\n que.pop();\n if(min_cost[p.second] < p.first) continue;\n for(int i = 0; i < graph[p.second].size(); i++) {\n edge &e = graph[p.second][i];\n int nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\n if(e.cap > 0 && min_cost[e.to] > nextCost) {\n min_cost[e.to] = nextCost;\n prevv[e.to] = p.second, preve[e.to] = i;\n que.push(Pi(min_cost[e.to], e.to));\n }\n }\n }\n if(min_cost[t] == INF) return -1;\n for(int v = 0; v < V; v++) potential[v] += min_cost[v];\n int addflow = f;\n for(int v = t; v != s; v = prevv[v]) {\n addflow = min(addflow, graph[prevv[v]][preve[v]].cap);\n }\n f -= addflow;\n ret += addflow * potential[t];\n for(int v = t; v != s; v = prevv[v]) {\n edge &e = graph[prevv[v]][preve[v]];\n e.cap -= addflow;\n graph[v][e.rev].cap += addflow;\n }\n }\n return ret;\n }\n};\n\nvoid solve()\n{\n int V, E, F;\n cin >> V >> E >> F;\n Primal_Dual graph(V);\n for(int i = 0; i < E; i++) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n graph.add_edge(a, b, c, d);\n }\n cout << graph.min_cost_flow(0, V - 1, F) << endl;\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n solve();\n}", "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <set>\n#include <tuple>\n#define mkp make_pair\n#define mkt make_tuple\n#define rep(i,n) for(int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\nconst ll MOD=1e9+7;\n\ntemplate< typename flow_t, typename cost_t >\nstruct MinCostFlow {\n const cost_t INF;\n\n struct edge {\n int to;\n flow_t cap;\n cost_t cost;\n int rev;\n };\n vector<vector<edge>> graph;\n vector<cost_t> potential,min_cost;\n vector<int> prevv,preve;\n\n MinCostFlow(int V) : graph(V),INF(numeric_limits< cost_t >::max()) {}\n\n void add_edge(int from,int to,flow_t cap,cost_t cost){\n graph[from].emplace_back((edge){to,cap,cost,(int)graph[to].size()});\n graph[to].emplace_back((edge){from,0,-cost,(int)graph[from].size()-1});\n }\n\n cost_t min_cost_flow(int s,int t,flow_t f){\n int V=(int)graph.size();\n cost_t ret=0;\n using Pi = pair<cost_t,int>;\n priority_queue<Pi,vector<Pi>,greater<Pi>> PQ;\n potential.assign(V,0);\n preve.assign(V,-1);\n prevv.assign(V,-1);\n\n while(f>0){\n min_cost.assign(V,INF);\n PQ.emplace(0,s);\n min_cost[s]=0;\n while(!PQ.empty()){\n cost_t d;\n int now;\n tie(d,now)=PQ.top();\n PQ.pop();\n if(min_cost[now]<d) continue;\n \n for(int i=0;i<graph[now].size();i++){\n edge &e=graph[now][i];\n cost_t nextCost=min_cost[now]+(e.cost+potential[now]-potential[e.to]);\n if(e.cap>0&&min_cost[e.to]>nextCost){\n min_cost[e.to]=nextCost;\n prevv[e.to]=now;\n preve[e.to]=i;\n PQ.emplace(min_cost[e.to],e.to);\n }\n }\n }\n\n if(min_cost[t]==INF) return -1;\n\n for(int v=0;v<V;v++) potential[v]+=min_cost[v];\n flow_t addflow=f;\n for(int v=t;v!=s;v=prevv[v]){\n addflow=min(addflow,graph[prevv[v]][preve[v]].cap);\n }\n f-=addflow;\n ret+=addflow*potential[t];\n \n for(int v=t;v!=s;v=prevv[v]){\n edge &e=graph[prevv[v]][preve[v]];\n e.cap-=addflow;\n graph[v][e.rev].cap+=addflow;\n }\n }\n return ret;\n }\n};\n\nint N,M,F;\nvector<int> A,B,C,D;\n\nint main(){\n cin>>N>>M>>F;\n A.resize(M);\n B.resize(M);\n C.resize(M);\n D.resize(M);\n for(int i=0;i<M;i++) cin>>A[i]>>B[i]>>C[i]>>D[i];\n\n MinCostFlow<int,int> mcf(N);\n for(int i=0;i<M;i++){\n mcf.add_edge(A[i],B[i],C[i],D[i]);\n }\n\n cout<<mcf.min_cost_flow(0,N-1,F)<<endl;\n\n return 0;\n}\n\n", "#!/usr/bin/env python3\n# GRL_6_B: Minimum Cost Flow\n\n\nWEIGHT_MAX = 10 ** 10\n\n\nclass Edge:\n __slots__ = ('src', 'dest', 'capacity', 'flow', 'cost')\n\n def __init__(self, v, w, capacity, cost=0):\n self.src = v\n self.dest = w\n self.capacity = capacity\n self.cost = cost\n self.flow = 0\n\n def other(self, v):\n if v == self.src:\n return self.dest\n else:\n return self.src\n\n def residual_capacity(self, v):\n if v == self.src:\n return self.capacity - self.flow\n else:\n return self.flow\n\n def cost_from(self, v):\n if v == self.src:\n return self.cost\n else:\n return -self.cost\n\n def add_flow(self, v, f):\n if v == self.src:\n self.flow += f\n else:\n self.flow -= f\n\n def __str__(self):\n return \"{} {} {} {} {}\".format(self.src, self.dest, self.capacity,\n self.cost, self.flow)\n\n\nclass Network:\n def __init__(self, v):\n self.v = v\n self._edges = [[] for _ in range(v)]\n\n def add(self, edge):\n self._edges[edge.src].append(edge)\n self._edges[edge.dest].append(edge)\n\n def adj(self, v):\n return self._edges[v]\n\n def flow(self, v):\n return sum(e.flow for e in self.adj(v) if e.src == v)\n\n def cost(self):\n cost = 0\n for v in range(self.v):\n for e in self.adj(v):\n if e.src == v:\n cost += e.flow * e.cost\n return cost\n\n def __str__(self):\n s = ''\n for v in range(self.v):\n for e in self.adj(v):\n s += \"{} {}\\n\".format(v, e)\n\n return s\n\n\ndef min_cost(network, s, t, f):\n def augment_path():\n def relax(edge, v):\n w = edge.other(v)\n c = edge.cost_from(v)\n if e.residual_capacity(v) > 0 and dists[w] > dists[v] + c:\n dists[w] = dists[v] + c\n edge_to[w] = e\n _nodes.append(w)\n\n dists = [WEIGHT_MAX] * network.v\n dists[s] = 0\n edge_to = [None] * network.v\n nodes = []\n\n nodes.append(s)\n for _ in range(network.v):\n _nodes = []\n for v in nodes:\n for e in network.adj(v):\n relax(e, v)\n nodes = _nodes\n\n if edge_to[t] is None:\n return (0, [])\n else:\n v = t\n e = edge_to[v]\n cap = f\n while e is not None:\n v = e.other(v)\n _cap = e.residual_capacity(v)\n if cap > _cap:\n cap = _cap\n e = edge_to[v]\n return (cap, edge_to)\n\n while f > 0:\n cap, path = augment_path()\n if cap == 0:\n break\n f -= cap\n v = t\n e = path[t]\n while e is not None:\n v = e.other(v)\n e.add_flow(v, cap)\n e = path[v]\n\n if f > 0:\n return -1\n else:\n return network.cost()\n\n\ndef run():\n v, e, f = [int(i) for i in input().split()]\n net = Network(v)\n s, t = 0, v-1\n\n for _ in range(e):\n v, w, c, d = [int(i) for i in input().split()]\n net.add(Edge(v, w, c, d))\n\n print(min_cost(net, s, t, f))\n\n\nif __name__ == '__main__':\n run()\n\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\n\n\n\n\n\n#define MAX_V 100\nstruct edge { int to, cap, cost,rev; };\n\nint V; // ????????°\nvector<edge> G[MAX_V];\nvector<int> h(MAX_V);\t//??????????????£???\nvector<int> dist(MAX_V);// ???????????¢\nint prevv[MAX_V], preve[MAX_V];// ??´??????????????¨???\n\n// from??????to??????????????????cap????????????cost????????????????????????????????????\nvoid add_edge(int from, int to, int cap, int cost) {\n\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\n\n//?????????????????????????????????????????´????????????\nint shortest_path(int s,vector<int> &d){\n\tint v = d.size();\n\trep(i,d.size())d[i]=INF;\n\td[s]=0;\n\trep(loop,v){\n\t\tbool update = false;\n\t\trep(i,MAX_V){\n\t\t\tfor(auto e:G[i]){\n\t\t\t\tif(d[i]!=INF && d[e.to] > d[i]+e.cost){\n\t\t\t\t\td[e.to] = d[i]+e.cost;\n\t\t\t\t\tupdate = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!update)break;\n\t\tif(loop==v-1)return true;\t//negative_cycle\n\t}\n\treturn false;\n}\n\n\n// s??????t????????????f???????°??????¨???????±???????\n// ??????????????´??????-1?????????\nint min_cost_flow(int s, int t, int f) {\n\tint res = 0;\n\trep(i,h.size())h[i]=0;\n\tshortest_path(s, dist);\n\t\n\twhile (f > 0) {\n\t\t// ?????????????????????????????¨??????h?????´??°??????\n\t\tpriority_queue<pii, vector<pii>, greater<pii> > que;\n\t\trep(i,dist.size())dist[i]=INF;\n\t\tdist[s] = 0;\n\t\tque.push(pii(0, s));\n\t\twhile (!que.empty()) {\n\t\t\tpii p = que.top(); que.pop();\n\t\t\tint v = p.second;\n\t\t\tif (dist[v] < p.first) continue;\n\t\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\t\tedge &e = G[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to]; prevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tque.push(pii(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) return -1;\t//????????\\???????????????\n\t\t\n\t\tfor (int v = 0; v < V; v++) h[v] += dist[v];\n\t\t\n\t\t// s-t????????????????????£??????????????????\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d * h[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]]; e.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(){\n\tint e,f;\n\tcin>>V>>e>>f;\n\trep(i,e){\n\t\tint u,v,c,d;\n\t\tcin>>u>>v>>c>>d;\n\t\tadd_edge(u, v, c, d);\n\t}\n\tcout<<min_cost_flow(0, V-1, f)<<endl;\n}", "#include <bits/stdc++.h>\n#define pb push_back\nusing namespace std;\nconst int INF=0x3f3f3f3f;\nconst int maxn=105;\nconst int maxq=1005;\n\nstruct edge{int to,cap,cost,rev;};\n\nint n,m,k;\nint d[maxn];\nint a[maxn];\nint p1[maxn];\nint p2[maxn];\nbool inq[maxn];\nvector<edge>G[maxn];\n\nvoid add_edge(int u,int v,int c,int w) {\n\tG[u].pb(edge{v,c,w,int(G[v].size())});\n\tG[v].pb(edge{u,0,-w,int(G[u].size()-1)});\n}\n\nint mcmf(int s,int t) {\n\tint flow=0 , cost=0;\n\twhile (1) {\n\t\tmemset(d,0x3f,sizeof(d));\n\t\td[s]=0; a[s]=max(0,k-flow);\n\t\tint qh=0,qt=0,q[maxq];\n\t\tq[qt++]=s; inq[s]=1;\n\t\twhile (qh<qt) {\n\t\t\tint u=q[qh++];\n\t\t\tinq[u]=0;\n\t\t\tfor (int i=0;i<G[u].size();i++) {\n\t\t\t\tedge e=G[u][i];\n\t\t\t\tif (d[e.to]>d[u]+e.cost && e.cap) {\n\t\t\t\t\td[e.to]=d[u]+e.cost;\n\t\t\t\t\ta[e.to]=min(a[u],e.cap);\n\t\t\t\t\tp1[e.to]=u;\n\t\t\t\t\tp2[e.to]=i;\n\t\t\t\t\tif (!inq[e.to]) {\n\t\t\t\t\t\tq[qt++]=e.to;\n\t\t\t\t\t\tinq[e.to]=1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (d[t]==INF || !a[t]) break;\n\t\tflow+=a[t];\n\t\tcost+=a[t]*d[t];\n\t\tfor (int v=t,u=p1[t];v!=s;v=u,u=p1[u]) {\n\t\t\tint id=p2[v];\n\t\t\tG[u][id].cap-=a[t];\n\t\t\tid=G[u][id].rev;\n\t\t\tG[v][id].cap+=a[t];\n\t\t}\n\t}\n\tif (flow<k) return -1;\n\telse return cost;\n}\n\nint main() {\n\tcin>>n>>m>>k;\n\tfor (int i=0;i<m;i++) {\n\t\tint u,v,c,w; cin>>u>>v>>c>>w;\n\t\tadd_edge(u,v,c,w);\n\t}\n\tcout<<mcmf(0,n-1)<<'\\n';\n}\n", "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <bitset>\n#include <complex>\nusing namespace std;\n#define REP(i,n) for(int i = 0; i < (int)n; i++)\n#define FOR(i,a,b) for(int i = a; i < (int)b; i++)\n#define pb push_back\n#define mp make_pair\ntypedef vector<int> vi;\ntypedef pair<int, int> pi;\ntypedef long long ll;\ntypedef unsigned long long ull;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\nconst int INF = 1 << 27;\nconst int MAX_V = 101;\n//////////////////////////////\n// ????°??????¨???\nstruct edge { int to, cap, cost, rev; };\n\nint V;\nvector<edge> G[MAX_V]; //??°???????????£??\\???????????¨???\nint h[MAX_V]; //??????????????£???\nint dist[MAX_V]; //???????????¢\nint prevv[MAX_V], preve[MAX_V]; // ??´??????????????¨???\n\nvoid add_edge(int from, int to, int cap, int cost){\n G[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].push_back((edge){from, 0, -cost, (int)(G[from].size()) - 1});\n}\n// s??????t????????????f???????°??????¨???\n// ??????????????´??????-1?????????\nint min_cost_flow(int s, int t, int f){\n int res = 0;\n fill(h, h + V, 0);\n while(f > 0){\n priority_queue<pi, vector<pi>, greater<pi> > que;\n fill(dist, dist + V, INF);\n dist[s] = 0;\n que.push(pi(0, s));\n while(!que.empty()){\n pi p = que.top(); que.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n REP(i, G[v].size()){\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(pi(dist[e.to], e.to));\n }\n }\n }\n if(dist[t] == INF) return -1;\n REP(v, V) h[v] += dist[v];\n int d = f;\n for(int v = t; v != s; v = prevv[v]) d = min(d, G[prevv[v]][preve[v]].cap);\n f -= d;\n res += d * h[t];\n for(int v = t; v != s; v = prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main() {\n int E, F; cin >>V >>E >>F;\n REP(i, E){\n int a,b,c,d; cin >> a >> b >> c >> d;\n\t\tadd_edge(a,b,c,d);\n }\n cout << min_cost_flow(0, V-1, F) <<endl;\n return 0;\n}", "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.Closeable;\nimport java.io.FileInputStream;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.PriorityQueue;\nimport java.util.TreeMap;\n\npublic class Main {\n\tstatic ContestScanner in;static Writer out;public static void main(String[] args)\n\t{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();\n\tin.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}\n\tstatic void dump(int[]a){for(int i=0;i<a.length;i++)out.print(a[i]+\" \");out.println();}\n\tstatic void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf(\"%\"+n+\"d \",a[i]);out.println();}\n\tstatic void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+\" \");out.println();}\n\tstatic void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}\n\tstatic long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}\n\tstatic String itob(int a,int l){return String.format(\"%\"+l+\"s\",Integer.toBinaryString(a)).replace(' ','0');}\n\tstatic void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}\n\tstatic void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}\n\tstatic void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}\n\tstatic void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}\n\tstatic void m_sort(int[]a,int s,int sz,int[]b)\n\t{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];\n\t} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */\n\tstatic void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}\n\tstatic void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}\n\tstatic void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}\n\tstatic void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}\n\tstatic void m_sort(long[]a,int s,int sz,long[]b)\n\t{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}\n\tstatic void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}\n\tstatic void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}\n\tstatic int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v\n\t{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}\n\tstatic int binarySearchSmallerMax(int[]a,int v,int l,int r)\n\t{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}\n\t@SuppressWarnings(\"unchecked\")\n\tstatic List<Integer>[]createGraph(int n)\n {List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}\n\t@SuppressWarnings(\"unchecked\")\n\tvoid solve() throws NumberFormatException, IOException{\n\t\tfinal int n = in.nextInt();\n\t\tfinal int m = in.nextInt();\n\t\tint f = in.nextInt();\n\t\tList<Edge>[] node = new List[n];\n\t\tfor(int i=0; i<n; i++) node[i] = new ArrayList<>();\n\t\tfor(int i=0; i<m; i++){\n\t\t\tint a = in.nextInt();\n\t\t\tint b = in.nextInt();\n\t\t\tint c = in.nextInt();\n\t\t\tint d = in.nextInt();\n\t\t\tEdge e = new Edge(b, c, d);\n\t\t\tEdge r = new Edge(a, 0, -d);\n\t\t\te.rev = r;\n\t\t\tr.rev = e;\n\t\t\tnode[a].add(e);\n\t\t\tnode[b].add(r);\n\t\t}\n\t\tfinal int s = 0, t = n-1;\n\t\tint[] h = new int[n];\n\t\tint[] dist = new int[n];\n\t\tint[] preV = new int[n];\n\t\tint[] preE = new int[n];\n\t\tfinal int inf = Integer.MAX_VALUE;\n\t\tPriorityQueue<Pos> qu = new PriorityQueue<>();\n\t\tint res = 0;\n\t\twhile(f>0){\n\t\t\tArrays.fill(dist, inf);\n\t\t\tdist[s] = 0;\n\t\t\tqu.clear();\n\t\t\tqu.add(new Pos(s, 0));\n\t\t\twhile(!qu.isEmpty()){\n\t\t\t\tPos p = qu.poll();\n\t\t\t\tif(dist[p.v]<p.d) continue;\n\t\t\t\tfinal int sz = node[p.v].size();\n\t\t\t\tfor(int i=0; i<sz; i++){\n\t\t\t\t\tEdge e = node[p.v].get(i);\n\t\t\t\t\tfinal int nd = e.cost+p.d + h[p.v]-h[e.to];\n\t\t\t\t\tif(e.cap>0 && nd < dist[e.to]){\n\t\t\t\t\t\tpreV[e.to] = p.v;\n\t\t\t\t\t\tpreE[e.to] = i;\n\t\t\t\t\t\tdist[e.to] = nd;\n\t\t\t\t\t\tqu.add(new Pos(e.to, nd));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(dist[t]==inf) break;\n\t\t\tfor(int i=0; i<n; i++) h[i] += dist[i];\n\t\t\tint minf = f;\n\t\t\tfor(int i=t; i!=s; i=preV[i]){\n\t\t\t\tminf = Math.min(minf, node[preV[i]].get(preE[i]).cap);\n\t\t\t}\n\t\t\tf -= minf;\n\t\t\tres += minf*h[t];\n\t\t\tfor(int i=t; i!=s; i=preV[i]){\n\t\t\t\tnode[preV[i]].get(preE[i]).cap -= minf;\n\t\t\t\tnode[preV[i]].get(preE[i]).rev.cap += minf;\n\t\t\t}\n\t\t}\n\t\tif(f>0) res = -1;\n\t\tSystem.out.println(res);\n\t}\n}\nclass Pos implements Comparable<Pos>{\n\tint v, d;\n\tpublic Pos(int v, int d) {\n\t\tthis.v = v;\n\t\tthis.d = d;\n\t}\n\t@Override\n\tpublic int compareTo(Pos o) {\n\t\treturn d-o.d;\n\t}\n}\n\nclass Edge{\n\tint to, cap, cost;\n\tEdge rev;\n\tEdge(int t, int c, int co){\n\t\tto = t;\n\t\tcap = c;\n\t\tcost = co;\n\t}\n\tvoid rev(Edge r){\n\t\trev = r;\n\t}\n}\n\n\n@SuppressWarnings(\"serial\")\nclass MultiSet<T> extends HashMap<T, Integer>{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic MultiSet<T> merge(MultiSet<T> set)\n\t{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}\n\tfor(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}\n}\n@SuppressWarnings(\"serial\")\nclass OrderedMultiSet<T> extends TreeMap<T, Integer>{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic OrderedMultiSet<T> merge(OrderedMultiSet<T> set)\n\t{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}\n\twhile(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}\n}\nclass Pair implements Comparable<Pair>{\n\tint a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}\n\tpublic boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}\n\tpublic int hashCode(){return hash;}\n\tpublic int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}\n}\nclass Timer{\n\tlong time;public void set(){time=System.currentTimeMillis();}\n\tpublic long stop(){return time=System.currentTimeMillis()-time;}\n\tpublic void print(){System.out.println(\"Time: \"+(System.currentTimeMillis()-time)+\"ms\");}\n\t@Override public String toString(){return\"Time: \"+time+\"ms\";}\n}\nclass Writer extends PrintWriter{\n\tpublic Writer(String filename)throws IOException\n\t{super(new BufferedWriter(new FileWriter(filename)));}\n\tpublic Writer()throws IOException{super(System.out);}\n}\nclass ContestScanner implements Closeable{\n\tprivate BufferedReader in;private int c=-2;\n\tpublic ContestScanner()throws IOException \n\t{in=new BufferedReader(new InputStreamReader(System.in));}\n\tpublic ContestScanner(String filename)throws IOException\n\t{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}\n\tpublic String nextToken()throws IOException {\n\t\tStringBuilder sb=new StringBuilder();\n\t\twhile((c=in.read())!=-1&&Character.isWhitespace(c));\n\t\twhile(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}\n\t\treturn sb.toString();\n\t}\n\tpublic String readLine()throws IOException{\n\t\tStringBuilder sb=new StringBuilder();if(c==-2)c=in.read();\n\t\twhile(c!=-1&&c!='\\n'&&c!='\\r'){sb.append((char)c);c=in.read();}\n\t\treturn sb.toString();\n\t}\n\tpublic long nextLong()throws IOException,NumberFormatException\n\t{return Long.parseLong(nextToken());}\n\tpublic int nextInt()throws NumberFormatException,IOException\n\t{return(int)nextLong();}\n\tpublic double nextDouble()throws NumberFormatException,IOException \n\t{return Double.parseDouble(nextToken());}\n\tpublic void close() throws IOException {in.close();}\n}", "#include <iostream>\n#include <vector>\n#include <queue>\n#include <map>\n#include <algorithm>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\nconst ll inf = 1e14;\n\nclass min_cost_flow{\nprivate:\n int N;\n struct edge{int to; ll cap,cost; int rev; bool is_rev;};\n vector<vector<edge>> G;\n vector<ll> h,dist,prevv,preve;\npublic:\n min_cost_flow(int n){\n N = n;\n G = vector<vector<edge>>(N);\n h = dist = prevv = preve = vector<ll>(N,0);\n }\n void add_edge(int from,int to,ll cap,ll cost){\n G[from].push_back((edge){to,cap,cost,(int) G[to].size(),false});\n G[to].push_back((edge){from,0,-cost,(int) G[from].size()-1,true});\n }\n ll answer(int s,int t,ll f){\n ll res = 0;\n fill(h.begin(),h.end(),0);\n while(f>0){\n priority_queue<P,vector<P>,greater<P>> Q;\n fill(dist.begin(),dist.end(),inf);\n dist[s] = 0;\n Q.push(P(0,s));\n while(!Q.empty()){\n P p = Q.top(); Q.pop();\n int v = p.second;\n if(dist[v]<p.first) continue;\n for(int i=0;i<G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0 && dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to] = dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n Q.push(P(dist[e.to],e.to));\n }\n }\n }\n if(dist[t]==inf) return -1;\n for(int v=0;v<N;v++) h[v] += dist[v];\n ll d = f;\n for(int v=t;v!=s; v=prevv[v]){\n d = min(d,G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\nint N,M,F;\n\nint main(){\n cin >> N >> M >> F;\n min_cost_flow flow(N+1);\n int u,v,c,d;\n for(int i=0;i<M;i++){\n cin >> u >> v >> c >> d;\n flow.add_edge(u,v,c,d);\n }\n cout << flow.answer(0,N-1,F) << endl;\n}\n", "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd\nfrom itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_left\nfrom heapq import heappush, heappop\nfrom functools import reduce\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\nsys.setrecursionlimit(10 ** 9)\nINF = float('inf')\nmod = 10 ** 9 + 7\n\nclass MinCostFlow:\n def __init__(self, n):\n self.n = n\n self.g = [[] for i in range(n)]\n\n\n def add_edge(self, fr, to, cap, cost):\n G = self.g\n G[fr].append([to, cap, cost, len(G[to])])\n G[to].append([fr, 0, -cost, len(G[fr])-1])\n\n def flow(self, s, t, f):\n N = self.n\n G = self.g\n INF = 10**18\n\n prevv = [0]*N\n preve = [0]*N\n\n res = 0\n while f > 0:\n dist = [INF]*N\n dist[s] = 0\n update = True\n\n while update:\n update = False\n for v in range(N):\n if dist[v] == INF: continue\n for i in range(len(G[v])):\n to, cap, cost, rev = G[v][i]\n if cap > 0 and dist[to] > dist[v]+cost:\n dist[to] = dist[v]+cost\n prevv[to] = v\n preve[to] = i\n update = True\n\n if dist[t] == INF:\n return -1\n\n d = f\n v = t\n while v != s:\n d = min(d, G[prevv[v]][preve[v]][1])\n v = prevv[v]\n f -= d\n res += d*dist[t]\n\n v = t\n while v != s:\n e = G[prevv[v]][preve[v]]\n e[1] -= d\n G[v][e[3]][1] += d\n v = prevv[v]\n\n return res\n \n\nV, E, F = MAP()\nmcf = MinCostFlow(V)\nfor _ in range(E):\n u, v, c, d = MAP()\n mcf.add_edge(u, v, c, d)\nprint(mcf.flow(0, V-1, F))\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\n\n#define rep(i,n) for (int i=0;i<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define printV(v) for(auto&& x : v){cout << x << \" \";} cout << endl\n#define printVV(vv) for(auto&& v : vv){for(auto&& x : v){cout << x << \" \";}cout << endl;}\n#define printP(p) cout << p.first << \" \" << p.second << endl\n#define printVP(vp) for(auto&& p : vp) printP(p);\n\ntypedef long long ll;\ntypedef pair<int, int> Pii;\ntypedef tuple<int, int, int> TUPLE;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<Pii> vp;\nconst int inf = 1e9;\nconst int mod = 1e9 + 7;\ntemplate<typename T> using Graph = vector<vector<T>>;\n\nstruct edge { int to, cap, cost, rev; };\n\nint V;\nconst int MAX_V = 100;\nvector<edge> G[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost) {\n G[from].emplace_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].emplace_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\nint min_cost_flow(int s, int t, int f) {\n int res = 0;\n while (f > 0) {\n fill(dist, dist + V, inf);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n for (int v = 0; v < V; v++) {\n if (dist[v] == inf) continue;\n for (int i = 0; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n\n if (dist[t] == inf) {\n return -1;\n }\n\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nsigned main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int E, F;\n cin >> V >> E >> F;\n rep(i, E) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n add_edge(u, v, c, d);\n }\n cout << min_cost_flow(0, V - 1, F) << endl;\n}", "\nimport java.io.*;\nimport java.util.*;\nimport java.util.stream.Stream;\n\n/**\n * @author baito\n */\n@SuppressWarnings(\"unchecked\")\npublic class Main\n{\n static StringBuilder sb = new StringBuilder();\n static FastScanner sc = new FastScanner(System.in);\n static int INF = 1234567890;\n static long LINF = 123456789123456789L;\n static long MINF = -123456789123456789L;\n static long MOD = 1000000007;\n static int[] y4 = {0, 1, 0, -1};\n static int[] x4 = {1, 0, -1, 0};\n static int[] y8 = {0, 1, 0, -1, -1, 1, 1, -1};\n static int[] x8 = {1, 0, -1, 0, 1, -1, 1, -1};\n static long[] Fa;//factorial\n static boolean[] isPrime;\n static int[] primes;\n static char[][] map;\n\n public static void main(String[] args)\n {\n V = sc.nextInt();\n E = sc.nextInt();\n F = sc.nextInt();\n edges = Stream.generate(ArrayList::new).limit(V).toArray(ArrayList[]::new);\n for (int i = 0; i < E; i++)\n {\n addEdge(sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt());\n }\n System.out.println(minCostFlow(0, V - 1, F));\n }\n\n public static void addEdge(int f, int t, int ca, int co)\n {\n edges[f].add(new Edge(t, ca, co, edges[t].size()));\n edges[t].add(new Edge(f, 0, -co, edges[f].size()-1));\n }\n\n static class P implements Comparable<P>\n {\n int v;\n long dist;\n\n P(long a, int b)\n {\n dist = a;\n v = b;\n }\n\n @Override\n public boolean equals(Object o)\n {\n if (this == o) return true;\n if (!(o instanceof P)) return false;\n P p = (P) o;\n return dist == p.dist && v == p.v;\n }\n\n @Override\n public int hashCode()\n {\n return Objects.hash(dist, v);\n }\n\n @Override\n public int compareTo(P p)\n {\n return dist > p.dist ? 1 : -1; //xで昇順にソート\n //return (dist == p.dist ? v - p.v : dist - p.dist) * -1; //xで降順にソート\n //return v == p.v ? dist - p.dist : v - p.v;//yで昇順にソート\n //return (v == p.v ? dist - p.dist : v - p.v)*-1;//yで降順にソート\n }\n }\n\n static int V, E, F;\n static ArrayList<Edge>[] edges;\n\n static long minCostFlow(int s, int t, int f)\n {\n int[] prevv = new int[V];\n int[] preve = new int[V];\n long[] dist = new long[V];\n int[] h = new int[V];\n long res = 0;\n while (f > 0)\n {\n Arrays.fill(dist, INF);\n dist[s] = 0;\n PriorityQueue<P> que = new PriorityQueue<>();\n que.add(new P(0, s));\n while (!que.isEmpty())\n {\n P p = que.poll();\n int v = p.v;\n if (dist[v] < p.dist) continue;\n for (int i = 0; i < edges[v].size(); i++)\n {\n Edge e = edges[v].get(i);\n if (e.cap > 0 && dist[e.to] > p.dist + e.cost + h[v] - h[e.to])\n {\n dist[e.to] = p.dist + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.add(new P(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INF) return -1;\n for (int i = 0; i < V; i++) h[i] += dist[i];\n long d = f;\n for (int v = t; v != s; v = prevv[v])\n {\n d = Math.min(d, edges[prevv[v]].get(preve[v]).cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v])\n {\n Edge e = edges[prevv[v]].get(preve[v]);\n e.cap -= d;\n edges[v].get(e.rev).cap += d;\n }\n }\n return res;\n }\n\n static class Edge\n {\n int to, rev;\n long cap, cost;\n\n Edge(int t, long ca, long co, int r)\n {\n to = t;\n cap = ca;\n cost = co;\n rev = r;\n }\n }\n\n public static int upper0(int a)\n {\n if (a < 0) return 0;\n return a;\n }\n\n public static long upper0(long a)\n {\n if (a < 0) return 0;\n return a;\n }\n\n public static Integer[] toIntegerArray(int[] ar)\n {\n Integer[] res = new Integer[ar.length];\n for (int i = 0; i < ar.length; i++)\n {\n res[i] = ar[i];\n }\n return res;\n }\n\n //k個の次の組み合わせをビットで返す 大きさに上限はない 110110 -> 111001\n public static int nextCombSizeK(int comb, int k)\n {\n int x = comb & -comb; //最下位の1\n int y = comb + x; //連続した下の1を繰り上がらせる\n return ((comb & ~y) / x >> 1) | y;\n }\n\n public static int keta(long num)\n {\n int res = 0;\n while (num > 0)\n {\n num /= 10;\n res++;\n }\n return res;\n }\n\n public static long getHashKey(int a, int b)\n {\n return (long) a << 32 | b;\n }\n\n public static boolean isOutofIndex(int x, int y)\n {\n if (x < 0 || y < 0) return true;\n if (map[0].length <= x || map.length <= y) return true;\n return false;\n }\n\n public static void setPrimes()\n {\n int n = 100001;\n isPrime = new boolean[n];\n List<Integer> prs = new ArrayList<>();\n Arrays.fill(isPrime, true);\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i * i <= n; i++)\n {\n if (!isPrime[i]) continue;\n prs.add(i);\n for (int j = i * 2; j < n; j += i)\n {\n isPrime[j] = false;\n }\n }\n primes = new int[prs.size()];\n for (int i = 0; i < prs.size(); i++)\n primes[i] = prs.get(i);\n }\n\n public static void revSort(int[] a)\n {\n Arrays.sort(a);\n reverse(a);\n }\n\n public static void revSort(long[] a)\n {\n Arrays.sort(a);\n reverse(a);\n }\n\n public static int[][] copy(int[][] ar)\n {\n int[][] nr = new int[ar.length][ar[0].length];\n for (int i = 0; i < ar.length; i++)\n for (int j = 0; j < ar[0].length; j++)\n nr[i][j] = ar[i][j];\n return nr;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static int lowerBound(final int[] arr, final int value)\n {\n int low = 0;\n int high = arr.length;\n int mid;\n\n while (low < high)\n {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] < value)\n {\n low = mid + 1;\n }\n else\n {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値が無ければ、挿入できる最小のインデックス\n */\n public static int upperBound(final int[] arr, final int value)\n {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high)\n {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] <= value)\n {\n low = mid + 1;\n }\n else\n {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値以上の先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値以上で、先頭になるインデクス\n * 値がなければ挿入できる最小のインデックス\n */\n public static long lowerBound(final long[] arr, final long value)\n {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high)\n {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] < value)\n {\n low = mid + 1;\n }\n else\n {\n high = mid;\n }\n }\n return low;\n }\n\n /**\n * <h1>指定した値より大きい先頭のインデクスを返す</h1>\n * <p>配列要素が０のときは、０が返る。</p>\n *\n * @return<b>int</b> ： 探索した値より上で、先頭になるインデクス\n * 値がなければ挿入できる最小のインデックス\n */\n public static long upperBound(final long[] arr, final long value)\n {\n int low = 0;\n int high = arr.length;\n int mid;\n while (low < high)\n {\n mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)\n if (arr[mid] <= value)\n {\n low = mid + 1;\n }\n else\n {\n high = mid;\n }\n }\n return low;\n }\n\n //次の順列に書き換える、最大値ならfalseを返す\n public static boolean nextPermutation(int A[])\n {\n int len = A.length;\n int pos = len - 2;\n for (; pos >= 0; pos--)\n {\n if (A[pos] < A[pos + 1]) break;\n }\n if (pos == -1) return false;\n\n //posより大きい最小の数を二分探索\n int ok = pos + 1;\n int ng = len;\n while (Math.abs(ng - ok) > 1)\n {\n int mid = (ok + ng) / 2;\n if (A[mid] > A[pos]) ok = mid;\n else ng = mid;\n\n }\n\n swap(A, pos, ok);\n reverse(A, pos + 1, len - 1);\n\n\n return true;\n }\n\n //次の順列に書き換える、最小値ならfalseを返す\n public static boolean prevPermutation(int A[])\n {\n int len = A.length;\n int pos = len - 2;\n for (; pos >= 0; pos--)\n {\n if (A[pos] > A[pos + 1]) break;\n }\n if (pos == -1) return false;\n\n //posより小さい最大の数を二分探索\n int ok = pos + 1;\n int ng = len;\n while (Math.abs(ng - ok) > 1)\n {\n int mid = (ok + ng) / 2;\n if (A[mid] < A[pos]) ok = mid;\n else ng = mid;\n\n }\n\n swap(A, pos, ok);\n reverse(A, pos + 1, len - 1);\n\n\n return true;\n }\n\n //↓nCrをmod計算するために必要。　***factorial(N)を呼ぶ必要がある***\n static long ncr(int n, int r)\n {\n if (n < r) return 0;\n else if (r == 0) return 1;\n\n factorial(n);\n return Fa[n] / (Fa[n - r] * Fa[r]);\n }\n\n static long ncr2(int a, int b)\n {\n if (b == 0) return 1;\n else if (a < b) return 0;\n long res = 1;\n for (int i = 0; i < b; i++)\n {\n res *= a - i;\n res /= i + 1;\n }\n return res;\n }\n\n static long ncrdp(int n, int r)\n {\n if (n < r) return 0;\n long[][] dp = new long[n + 1][r + 1];\n for (int ni = 0; ni < n + 1; ni++)\n {\n dp[ni][0] = dp[ni][ni] = 1;\n for (int ri = 1; ri < ni; ri++)\n {\n dp[ni][ri] = dp[ni - 1][ri - 1] + dp[ni - 1][ri];\n }\n }\n return dp[n][r];\n }\n\n static long modNcr(int n, int r)\n {\n if (n < r) return 0;\n long result = Fa[n];\n result = result * modInv(Fa[n - r]) % MOD;\n result = result * modInv(Fa[r]) % MOD;\n return result;\n }\n\n public static long modSum(long... lar)\n {\n long res = 0;\n for (long l : lar)\n res = (res + l % MOD) % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modDiff(long a, long b)\n {\n long res = a % MOD - b % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modMul(long... lar)\n {\n long res = 1;\n for (long l : lar)\n res = (res * l % MOD) % MOD;\n if (res < 0) res += MOD;\n res %= MOD;\n return res;\n }\n\n public static long modDiv(long a, long b)\n {\n long x = a % MOD;\n long y = b % MOD;\n long res = (x * modInv(y)) % MOD;\n return res;\n }\n\n static long modInv(long n)\n {\n return modPow(n, MOD - 2);\n }\n\n static void factorial(int n)\n {\n Fa = new long[n + 1];\n Fa[0] = Fa[1] = 1;\n// for (int i = 2; i <= n; i++)\n// {\n// Fa[i] = (Fa[i - 1] * i) % MOD;\n// }\n //\n for (int i = 2; i <= 100000; i++)\n {\n Fa[i] = (Fa[i - 1] * i) % MOD;\n }\n for (int i = 100001; i <= n; i++)\n {\n Fa[i] = (Fa[i - 1] * i) % MOD;\n }\n }\n\n static long modPow(long x, long n)\n {\n long res = 1L;\n while (n > 0)\n {\n if ((n & 1) == 1)\n {\n res = res * x % MOD;\n }\n x = x * x % MOD;\n n >>= 1;\n }\n return res;\n }\n\n //↑nCrをmod計算するために必要\n\n static int gcd(int n, int r)\n {\n return r == 0 ? n : gcd(r, n % r);\n }\n\n static long gcd(long n, long r)\n {\n return r == 0 ? n : gcd(r, n % r);\n }\n\n static <T> void swap(T[] x, int i, int j)\n {\n T t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n static void swap(int[] x, int i, int j)\n {\n int t = x[i];\n x[i] = x[j];\n x[j] = t;\n }\n\n public static void reverse(int[] x)\n {\n int l = 0;\n int r = x.length - 1;\n while (l < r)\n {\n int temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(long[] x)\n {\n int l = 0;\n int r = x.length - 1;\n while (l < r)\n {\n long temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(char[] x)\n {\n int l = 0;\n int r = x.length - 1;\n while (l < r)\n {\n char temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n public static void reverse(int[] x, int s, int e)\n {\n int l = s;\n int r = e;\n while (l < r)\n {\n int temp = x[l];\n x[l] = x[r];\n x[r] = temp;\n l++;\n r--;\n }\n }\n\n static int length(int a)\n {\n int cou = 0;\n while (a != 0)\n {\n a /= 10;\n cou++;\n }\n return cou;\n }\n\n static int length(long a)\n {\n int cou = 0;\n while (a != 0)\n {\n a /= 10;\n cou++;\n }\n return cou;\n }\n\n static int cou(boolean[] a)\n {\n int res = 0;\n for (boolean b : a)\n {\n if (b) res++;\n }\n return res;\n }\n\n static int cou(String s, char c)\n {\n int res = 0;\n for (char ci : s.toCharArray())\n {\n if (ci == c) res++;\n }\n return res;\n }\n\n static int countC2(char[][] a, char c)\n {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n if (a[i][j] == c) co++;\n return co;\n }\n\n static int countI(int[] a, int key)\n {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n if (a[i] == key) co++;\n return co;\n }\n\n static int countI(int[][] a, int key)\n {\n int co = 0;\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n if (a[i][j] == key) co++;\n return co;\n }\n\n static void fill(int[][] a, int v)\n {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = v;\n }\n\n\n static void fill(long[][] a, long v)\n {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n a[i][j] = v;\n }\n\n static void fill(int[][][] a, int v)\n {\n for (int i = 0; i < a.length; i++)\n for (int j = 0; j < a[0].length; j++)\n for (int k = 0; k < a[0][0].length; k++)\n a[i][j][k] = v;\n }\n\n static int max(int... a)\n {\n int res = Integer.MIN_VALUE;\n for (int i : a)\n {\n res = Math.max(res, i);\n }\n return res;\n }\n\n static long min(long... a)\n {\n long res = Long.MAX_VALUE;\n for (long i : a)\n {\n res = Math.min(res, i);\n }\n return res;\n }\n\n static int max(int[][] ar)\n {\n int res = Integer.MIN_VALUE;\n for (int i[] : ar)\n res = Math.max(res, max(i));\n return res;\n }\n\n static int min(int... a)\n {\n int res = Integer.MAX_VALUE;\n for (int i : a)\n {\n res = Math.min(res, i);\n }\n return res;\n }\n\n\n static int min(int[][] ar)\n {\n int res = Integer.MAX_VALUE;\n for (int i[] : ar)\n res = Math.min(res, min(i));\n return res;\n }\n\n static int sum(int[] a)\n {\n int cou = 0;\n for (int i : a)\n cou += i;\n return cou;\n }\n\n static int abs(int a)\n {\n return Math.abs(a);\n }\n\n static class FastScanner\n {\n\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in)\n {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next()\n {\n if (tokenizer == null || !tokenizer.hasMoreTokens())\n {\n try\n {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e)\n {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n /*public String nextChar(){\n return (char)next()[0];\n }*/\n public String nextLine()\n {\n if (tokenizer == null || !tokenizer.hasMoreTokens())\n {\n try\n {\n return reader.readLine();\n } catch (IOException e)\n {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong()\n {\n return Long.parseLong(next());\n }\n\n public int nextInt()\n {\n return Integer.parseInt(next());\n }\n\n public double nextDouble()\n {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n)\n {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n {\n a[i] = nextInt();\n }\n return a;\n }\n\n public int[] nextIntArrayDec(int n)\n {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n {\n a[i] = nextInt() - 1;\n }\n return a;\n }\n\n public int[][] nextIntArray2(int h, int w)\n {\n int[][] a = new int[h][w];\n for (int hi = 0; hi < h; hi++)\n {\n for (int wi = 0; wi < w; wi++)\n {\n a[hi][wi] = nextInt();\n }\n }\n return a;\n }\n\n public int[][] nextIntArray2Dec(int h, int w)\n {\n int[][] a = new int[h][w];\n for (int hi = 0; hi < h; hi++)\n {\n for (int wi = 0; wi < w; wi++)\n {\n a[hi][wi] = nextInt() - 1;\n }\n }\n return a;\n }\n\n //複数の配列を受け取る\n public void nextIntArrays2ar(int[] a, int[] b)\n {\n for (int i = 0; i < a.length; i++)\n {\n a[i] = sc.nextInt();\n b[i] = sc.nextInt();\n }\n }\n\n public void nextIntArrays2arDec(int[] a, int[] b)\n {\n for (int i = 0; i < a.length; i++)\n {\n a[i] = sc.nextInt() - 1;\n b[i] = sc.nextInt() - 1;\n }\n }\n\n //複数の配列を受け取る\n public void nextIntArrays3ar(int[] a, int[] b, int[] c)\n {\n for (int i = 0; i < a.length; i++)\n {\n a[i] = sc.nextInt();\n b[i] = sc.nextInt();\n c[i] = sc.nextInt();\n }\n }\n\n //複数の配列を受け取る\n public void nextIntArrays3arDecLeft2(int[] a, int[] b, int[] c)\n {\n for (int i = 0; i < a.length; i++)\n {\n a[i] = sc.nextInt() - 1;\n b[i] = sc.nextInt() - 1;\n c[i] = sc.nextInt();\n }\n }\n\n public Integer[] nextIntegerArray(int n)\n {\n Integer[] a = new Integer[n];\n for (int i = 0; i < n; i++)\n {\n a[i] = nextInt();\n }\n return a;\n }\n\n public char[] nextCharArray(int n)\n {\n char[] a = next().toCharArray();\n\n return a;\n }\n\n public char[][] nextCharArray2(int h, int w)\n {\n char[][] a = new char[h][w];\n for (int i = 0; i < h; i++)\n {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n //スペースが入っている場合\n public char[][] nextCharArray2s(int h, int w)\n {\n char[][] a = new char[h][w];\n for (int i = 0; i < h; i++)\n {\n a[i] = nextLine().replace(\" \", \"\").toCharArray();\n }\n return a;\n }\n\n public char[][] nextWrapCharArray2(int h, int w, char c)\n {\n char[][] a = new char[h + 2][w + 2];\n //char c = '*';\n int i;\n for (i = 0; i < w + 2; i++)\n a[0][i] = c;\n for (i = 1; i < h + 1; i++)\n {\n a[i] = (c + next() + c).toCharArray();\n }\n for (i = 0; i < w + 2; i++)\n a[h + 1][i] = c;\n return a;\n }\n\n //スペースが入ってる時用\n public char[][] nextWrapCharArray2s(int h, int w, char c)\n {\n char[][] a = new char[h + 2][w + 2];\n //char c = '*';\n int i;\n for (i = 0; i < w + 2; i++)\n a[0][i] = c;\n for (i = 1; i < h + 1; i++)\n {\n a[i] = (c + nextLine().replace(\" \", \"\") + c).toCharArray();\n }\n for (i = 0; i < w + 2; i++)\n a[h + 1][i] = c;\n return a;\n }\n\n public long[] nextLongArray(int n)\n {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n {\n a[i] = nextLong();\n }\n return a;\n }\n\n public long[][] nextLongArray2(int h, int w)\n {\n long[][] a = new long[h][w];\n for (int hi = 0; hi < h; hi++)\n {\n for (int wi = 0; wi < w; wi++)\n {\n a[hi][wi] = nextLong();\n }\n }\n return a;\n }\n }\n}\n\n", "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define fst(t) std::get<0>(t)\n#define snd(t) std::get<1>(t)\n#define thd(t) std::get<2>(t)\n#define fth(t) std::get<3>(t)\n#define unless(p) if(!(p))\n#define until(p) while(!(p))\n\nusing ll = long long;\nusing P = std::tuple<int,int>;\n\n\nconst int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};\n\nint V, E, F;\n// to, rev, cap, cost\nstd::vector<std::tuple<int, int, int, int>> G[200];\n\nvoid addEdge(int u, int v, int cap, int cost){\n G[u].emplace_back(v, G[v].size(), cap, cost);\n G[v].emplace_back(u, G[u].size() - 1, 0, -cost);\n}\n\nint dist[1500];\ntuple<int, int, int> prevs[1500];\nconst int INF = numeric_limits<int>::max() / 2;\n\nvoid bellmanFord(int s){\n std::fill(dist, dist+V, INF);\n std::fill(prevs, prevs+V, std::make_tuple(-1, -1, -1));\n dist[s] = 0;\n\n for(int i=0;i<V;++i){\n bool updated = false;\n \n for(int u=0;u<V;++u){\n for(int k=0;k<G[u].size();++k){\n const auto& p = G[u][k];\n int v, rev, cap, c;\n std::tie(v, rev, cap, c) = p;\n if(cap <= 0){continue;}\n if(dist[v] > dist[u] + c){\n updated = true;\n dist[v] = dist[u] + c;\n prevs[v] = std::make_tuple(u, k, rev);\n }\n } \n }\n\n if(!updated){break;}\n }\n}\n\nint f(){\n ll res = 0;\n \n while(F > 0){\n bellmanFord(0);\n\n if(dist[V-1] == INF){\n return -1;\n }\n \n int v = V - 1;\n int d = F;\n while(v != 0){\n int pv, e_idx;\n tie(pv, e_idx, ignore) = prevs[v];\n\n d = min(d, thd(G[pv][e_idx]));\n \n v = pv;\n }\n\n F -= d;\n res += 1ll * d * dist[V-1];\n\n v = V - 1;\n while(v != 0){\n int pv, e_idx, rev;\n tie(pv, e_idx, rev) = prevs[v];\n\n thd(G[pv][e_idx]) -= d;\n thd(G[v][rev]) += d;\n \n v = pv;\n } \n }\n\n return res;\n}\n\nint main(){\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n std::cin >> V >> E >> F;\n\n for(int i=0;i<E;++i){\n int u, v, c, d;\n std::cin >> u >> v >> c >> d;\n\n addEdge(u, v, c, d);\n }\n\n ll res = f();\n std::cout << res << std::endl;\n}", "#include <vector>\n#include <queue>\n\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\n\ntypedef long long int ll;\n\n// Primal-Dual Algorithm\n// ref: https://tjkendev.github.io/procon-library/python/min_cost_flow/primal-dual.html\nclass MinCostFlow {\npublic:\n\tconst ll INF = 1e18;\n\tconst ll MAX_COST = 1e9+9;\n\n\tstruct edge {\n\t\tint to;\n\t\tll cap;\n\t\tll cost;\n\t\tll res;\n\t\tint r_edge;\n\t};\n\n\tint N;\n\tvector<vector<edge>> G;\n\n\tMinCostFlow(int n): N(n), G(n) {}\n\n\tvoid add_edge(int from, int to, int cap, int cost){\n\t\tG[from].push_back({to, cap, cost, cap, (int)G[to].size()});\n\t\tG[to].push_back({from, 0, -cost, 0, (int)G[from].size()-1});\n\t}\n\n\tll flow(int S, int T, int flow){\n\t\tll res = 0;\n\t\tvector<ll> H(N); // ポテンシャル\n\t\tvector<int> pre_v(N), pre_e(N);\n\n\t\twhile(flow > 0){\n\t\t\tvector<ll> D(N, INF);\n\t\t\tpriority_queue<pair<ll,int>> que;\n\n\t\t\tD[S] = 0;\n\t\t\tque.emplace(0, S);\n\t\t\twhile(!que.empty()){\n\t\t\t\tll d = que.top().first;\n\t\t\t\tll i = que.top().second;\n\t\t\t\tque.pop();\n\t\t\t\tif(D[i] < d) continue;\n\t\t\t\trep(v, G[i].size()) if(G[i][v].res > 0) {\n\t\t\t\t\tedge &e = G[i][v];\n\t\t\t\t\tif (D[e.to] > D[i] + e.cost + H[i] - H[e.to]) {\n\t\t\t\t\t\tD[e.to] = D[i] + e.cost + H[i] - H[e.to];\n\t\t\t\t\t\tpre_v[e.to] = i;\n\t\t\t\t\t\tpre_e[e.to] = v;\n\t\t\t\t\t\tque.emplace(D[e.to], e.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif( D[T] == INF ) return -1;\n\n\t\t\trep(i,N) H[i] += D[i];\n\n\t\t\tll f = flow;\n\t\t\tfor(int i=T; i != S; i = pre_v[i]) f = min(f, G[pre_v[i]][pre_e[i]].res);\n\n\t\t\tflow -= f;\n\t\t\tres += f * H[T];\n\t\t\tfor(int i=T; i != S; i = pre_v[i]){\n\t\t\t\tedge &e = G[pre_v[i]][pre_e[i]];\n\t\t\t\te.res -= f;\n\t\t\t\tG[i][e.r_edge].res += f;\n\t\t\t}\n\t\t}\n\n\t\treturn res;\n\t}\n\n\tvoid reset(){\n\t\tfor(auto &g: G) for(auto &e: g) e.res = e.cap;\n\t}\n};\n\n\n// verify: AOJ GRL_6_B\n#include <iostream>\nint main(){\n\tint V, E, F;\n\tcin >> V >> E >> F;\n\tMinCostFlow fl(V);\n\trep(i,E){\n\t\tint\tu, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\t\tfl.add_edge(u, v, c, d);\n\t}\n\n\tcout << fl.flow(0, V-1, F) << endl;\n}\n", "#define DEBUG 1\n\n#include <iostream>\n#include <vector>\n#include <tuple>\n#include <queue>\nusing namespace std;\n\ntypedef long long ll;\n\n// ------------------------------------------------------------\n\ntypedef tuple<ll, int> Info;\n\nstruct Edge\n{\n int to;\n ll cap, cost;\n int rev;\n};\n\nclass MinCostFlow\n{\n int N;\n vector<Edge> *G;\n ll *h, *dist;\n int *prev_v, *prev_e;\n ll INFTY = 10000000000000010;\n\npublic:\n MinCostFlow() {}\n\n MinCostFlow(int n) : N(n)\n {\n G = new vector<Edge>[n];\n h = new ll[n];\n dist = new ll[n];\n prev_v = new int[n];\n prev_e = new int[n];\n }\n\n void add_edge(int from, int to, ll cap, ll cost)\n {\n G[from].push_back((Edge){to, cap, cost, (int)G[to].size()});\n G[to].push_back((Edge){from, 0, -cost, (int)G[from].size() - 1});\n }\n\n ll min_cost_flow(int s, int t, ll f)\n {\n ll res = 0;\n fill(h, h + N, 0);\n while (f > 0)\n {\n priority_queue<Info, vector<Info>, greater<Info>> Q;\n fill(dist, dist + N, INFTY);\n dist[s] = 0;\n Q.push(Info(0, s));\n while (!Q.empty())\n {\n Info p = Q.top();\n Q.pop();\n int v = get<1>(p);\n if (dist[v] < get<0>(p))\n {\n continue;\n }\n for (auto i = 0; i < (int)G[v].size(); i++)\n {\n Edge &e = G[v][i];\n ll tmp = dist[v] + e.cost + h[v] - h[e.to];\n if (e.cap > 0 && dist[e.to] > tmp)\n {\n dist[e.to] = tmp;\n prev_v[e.to] = v;\n prev_e[e.to] = i;\n Q.push(Info(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INFTY)\n {\n return -1;\n }\n for (auto v = 0; v < N; v++)\n {\n h[v] += dist[v];\n }\n ll d = f;\n for (auto v = t; v != s; v = prev_v[v])\n {\n d = min(d, G[prev_v[v]][prev_e[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (auto v = t; v != s; v = prev_v[v])\n {\n Edge &e = G[prev_v[v]][prev_e[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\n// ------------------------------------------------------------\n\nint N, M;\nll F;\nMinCostFlow flow;\n\nint main()\n{\n cin >> N >> M >> F;\n flow = MinCostFlow(N);\n for (auto i = 0; i < M; i++)\n {\n int u, v;\n ll c, d;\n cin >> u >> v >> c >> d;\n flow.add_edge(u, v, c, d);\n }\n cout << flow.min_cost_flow(0, N - 1, F) << endl;\n}\n", "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<cstring>\n\nusing namespace std;\n\ntypedef pair<int,int> P;//shortest pass,vertex number\n\nconst int MAX=100;\nconst int INF=1<<25;\n\nclass edge\n{\npublic:\n\tint to,cap,cost,rev;\n\tedge(){}\n\tedge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n};\n\nint V;\nvector<edge> G[MAX];\nint h[MAX];\nint dist[MAX];\nint prevv[MAX],preve[MAX];\n\nvoid add_edge(int from,int to,int cap,int cost)\n{\n\tG[from].push_back(edge(to,cap,cost,G[to].size()));\n\tG[to].push_back(edge(from,0,-cost,G[from].size()-1));\n\treturn;\n}\n\nint mincostflow(int s,int t,int f)\n{\n\tint res=0;\n\tmemset(h,0,sizeof(h));\n\twhile(f>0)\n\t{\n\t\tpriority_queue<P> Q;\n\t\tfill(dist,dist+V,INF);\n\t\tdist[s]=0;\n\t\tQ.push(P(0,s));\n\t\t\n\t\twhile(!Q.empty())\n\t\t{\n\t\t\tP p=Q.top();Q.pop();\n\t\t\tint v=p.second;\n\t\t\tif(dist[v]<p.first*(-1))continue;\n\t\t\tfor(int i=0;i<G[v].size();i++)\n\t\t\t{\n\t\t\t\tedge &e=G[v][i];\n\t\t\t\tif(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to])\n\t\t\t\t{\n\t\t\t\t\tdist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\t\t\t\t\tprevv[e.to]=v;\n\t\t\t\t\tpreve[e.to]=i;\n\t\t\t\t\tQ.push(P(dist[e.to]*(-1),e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(dist[t]==INF)return -1;\n\t\t\n\t\tfor(int v=0;v<V;v++)h[v]+=dist[v];\n\t\tint d=f;\n\t\tfor(int v=t;v!=s;v=prevv[v])d=min(d,G[prevv[v]][preve[v]].cap);\n\t\tf-=d;\n\t\tres+=d*h[t];\n\t\t\n\t\tfor(int v=t;v!=s;v=prevv[v])\n\t\t{\n\t\t\tedge &e=G[prevv[v]][preve[v]];\n\t\t\te.cap-=d;\n\t\t\tG[v][e.rev].cap+=d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tint E,F;cin>>V>>E>>F;\n\tint u,v,c,d;\n\tfor(int i=0;i<E;i++)\n\t{\n\t\tcin>>u>>v>>c>>d;\n\t\tadd_edge(u,v,c,d);\n\t}\n\tcout<<mincostflow(0,V-1,F)<<endl;\n\treturn 0;\n}", "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<list>\n#include<string>\n#include<cstring>\n#include<cstdlib>\n#include<cstdio>\n#include<cmath>\n#include<ctime>\nusing namespace std;\n\ntypedef long long ll;\n\nbool debug = false;\nconst int NIL = -1;\nconst int INF = 1000000000;\nconst int NUM = 100010;\nclock_t START, END;\n\nint V, E, F;\n\nstruct Edge {\n\tint from, to, cap, flow, cost;\n\tEdge(int u, int v, int c, int f, int w) :from(u), to(v), cap(c), flow(f), cost(w) {}\n};\n\nstruct Graph {\n\tint n, m;\n\tvector<Edge> edges;\n\tvector<int> G[NUM];\n\tint inq[NUM];\n\tint d[NUM];\n\tint a[NUM];\n\tint p[NUM];\n\n\tvoid init(int n) {\n\t\tthis->n = n;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tG[i].clear();\n\t\tedges.clear();\n\t}\n\n\tvoid AddEdge(int from, int to, int cap, int cost) {\n\t\tedges.push_back(Edge(from, to, cap, 0, cost));\n\t\tedges.push_back(Edge(to, from, 0, 0, -cost));\n\t\tm = edges.size();\n\t\tG[from].push_back(m - 2);\n\t\tG[to].push_back(m - 1);\n\t}\n\n\tbool BellmanFord(int s, int t, int& flow, ll& cost) {\n\t\tfor (int i = 0; i < n; i++)\n\t\t\td[i] = INF;\n\t\tmemset(inq, 0, sizeof(inq));\n\t\td[s] = 0;\n\t\tinq[s] = 1;\n\t\tp[s] = 0;\n\t\ta[s] = INF;\n\n\t\tqueue<int> Q;\n\t\tQ.push(s);\n\t\twhile (!Q.empty()) {\n\t\t\tint u = Q.front();\n\t\t\tQ.pop();\n\t\t\tinq[u] = 0;\n\t\t\tfor (int i = 0; i < G[u].size(); i++) {\n\t\t\t\tEdge& e = edges[G[u][i]];\n\t\t\t\tif (e.cap > e.flow && d[e.to] > d[u] + e.cost) {\n\t\t\t\t\td[e.to] = d[u] + e.cost;\n\t\t\t\t\tp[e.to] = G[u][i];\n\t\t\t\t\ta[e.to] = min(a[u], e.cap - e.flow);\n\t\t\t\t\tif (!inq[e.to]) {\n\t\t\t\t\t\tQ.push(e.to);\n\t\t\t\t\t\tinq[e.to] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (d[t] == INF)\n\t\t\treturn false;\n\t\tflow += a[t];\n\t\tif (a[t] <= F) {\n\t\t\tcost += (ll)d[t] * (ll)a[t];\n\t\t\tF -= a[t];\n\t\t}\n\t\telse {\n\t\t\tcost += (ll)d[t] * (ll)(F);\n\t\t\tF = 0;\n\t\t}\n\t\tfor (int u = t; u != s; u = edges[p[u]].from) {\n\t\t\tedges[p[u]].flow += a[t];\n\t\t\tedges[p[u] ^ 1].flow -= a[t];\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tint MincostMaxflow(int s, int t, ll& cost) {\n\t\tint flow = 0;\n\t\tcost = 0;\n\t\twhile (BellmanFord(s, t, flow, cost));\n\t\treturn flow;\n\t}\n};\n\nGraph solve;\n\nint main(void)\n{\n\tif (debug) {\n\t\tSTART = clock();\n\t\tfreopen(\"in29.txt\", \"r\", stdin);\n\t\tfreopen(\"out.txt\", \"w\", stdout);\n\t}\n\tll COST;\n\tint u, v, c, d, f;\n\tcin >> V >> E >> F;\n\tf = F;\n\tsolve.init(V);\n\tfor (int i = 0; i < E; i++) {\n\t\tscanf(\"%d%d%d%d\", &u, &v, &c, &d);\n\t\tsolve.AddEdge(u, v, c, d);\n\t}\n\tif (solve.MincostMaxflow(0, V - 1, COST) >= f)\n\t\tcout << COST << endl;\n\telse\n\t\tcout << \"-1\" << endl;\n\tif (debug) {\n\t\tEND = clock();\n\t\tdouble endtime = (double)(END - START) / 1000;\n\t\tprintf(\"total time = %lf s\", endtime);\n\t}\n\treturn 0;\n}\n", "#include <algorithm>\n#include <iostream>\n#include <limits>\n#include <vector>\nusing namespace std;\n\n\ntypedef int T; // cost type\ntypedef int U; // flow type\n\nT INF = numeric_limits<T>::max(); // <limits>\n\nstruct edge {\n int to, rev;\n T cost;\n U cap;\n edge(int to, U cap, int rev, T cost) : to(to), rev(rev), cost(cost), cap(cap) {}\n};\n\nstruct primal_dual {\n int N;\n vector<vector<edge> > graph;\n vector<int> prev_v, prev_e;\n vector<T> min_cost;\n\n primal_dual() {}\n primal_dual(int _N) { init(_N); }\n\n void init(int _N) {\n N = _N;\n graph.resize(N);\n prev_v.resize(N);\n prev_e.resize(N);\n min_cost.resize(N);\n }\n\n void add_edge(int u, int v, U cap, T cost) {\n graph[u].push_back(edge(v, cap, graph[v].size(), cost));\n graph[v].push_back(edge(u, 0, graph[u].size()-1, -cost));\n }\n\n T min_cost_flow(int s, int t, U F) {\n T val = 0;\n while (F > 0) {\n fill(min_cost.begin(), min_cost.end(), INF);\n min_cost[s] = 0;\n\n bool updated = true;\n while (updated) {\n updated = false;\n for (int v = 0; v < N; ++v) {\n if (min_cost[v] == INF) continue;\n for (int j = 0; j < graph[v].size(); ++j) {\n edge& e = graph[v][j];\n T cost = min_cost[v] + e.cost;\n if (cost < min_cost[e.to] && e.cap > 0) {\n updated = true;\n min_cost[e.to] = cost;\n prev_v[e.to] = v;\n prev_e[e.to] = j;\n }\n }\n }\n }\n\n if (min_cost[t] == INF) {\n return (T)-1; // fail\n }\n\n U f = F;\n for (int v = t; v != s; v = prev_v[v]) {\n f = min(f, graph[prev_v[v]][prev_e[v]].cap);\n }\n\n F -= f;\n\n val += (T)f * min_cost[t];\n\n for (int v = t; v != s; v = prev_v[v]) {\n edge& e = graph[prev_v[v]][prev_e[v]];\n e.cap -= f;\n graph[v][e.rev].cap += f;\n }\n\n }\n return val;\n }\n};\n\nint V, E, F;\nprimal_dual pd;\n\nint main() {\n cin >> V >> E >> F;\n pd.init(V);\n for (int j = 0; j < E; ++j) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n pd.add_edge(u, v, c, d);\n }\n\n cout << pd.min_cost_flow(0, V-1, F) << endl;\n return 0;\n}", "#include<iostream>\n#include<algorithm>\n#include<vector>\n\nusing namespace std;\n\nconst int MAX=100;\nconst int INF=1<<25;\n\nclass edge\n{\npublic:\n\tint to,cap,cost,rev;\n\tedge(){}\n\tedge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n};\n\nint V;\nvector<edge> G[MAX];\nint dist[MAX];\nint prevv[MAX],preve[MAX];\n\nvoid add_edge(int from,int to,int cap,int cost)\n{\n\tG[from].push_back(edge(to,cap,cost,G[to].size()));\n\tG[to].push_back(edge(from,0,-cost,G[from].size()-1));\n\treturn;\n}\n\nint mincostflow(int s,int t,int f)\n{\n\tint res=0;\n\twhile(f>0)\n\t{\n\t\tfill(dist,dist+V,INF);\n\t\tdist[s]=0;\n\t\tbool update=true;\n\t\twhile(update)\n\t\t{\n\t\t\tupdate=false;\n\t\t\tfor(int v=0;v<V;v++)\n\t\t\t{\n\t\t\t\tif(dist[v]==INF)continue;\n\t\t\t\tfor(int i=0;i<G[v].size();i++)\n\t\t\t\t{\n\t\t\t\t\tedge &e=G[v][i];\n\t\t\t\t\tif(e.cap>0&&dist[e.to]>dist[v]+e.cost)\n\t\t\t\t\t{\n\t\t\t\t\t\tdist[e.to]=dist[v]+e.cost;\n\t\t\t\t\t\tprevv[e.to]=v;\n\t\t\t\t\t\tpreve[e.to]=i;\n\t\t\t\t\t\tupdate=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(dist[t]==INF)return -1;\n\t\t\n\t\tint d=f;\n\t\tfor(int v=t;v!=s;v=prevv[v])d=min(d,G[prevv[v]][preve[v]].cap);\n\t\tf-=d;\n\t\tres+=d*dist[t];\n\t\t\n\t\tfor(int v=t;v!=s;v=prevv[v])\n\t\t{\n\t\t\tedge &e=G[prevv[v]][preve[v]];\n\t\t\te.cap-=d;\n\t\t\tG[v][e.rev].cap+=d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tint E,F;cin>>V>>E>>F;\n\tint u,v,c,d;\n\tfor(int i=0;i<E;i++)\n\t{\n\t\tcin>>u>>v>>c>>d;\n\t\tadd_edge(u,v,c,d);\n\t}\n\tcout<<mincostflow(0,V-1,F)<<endl;\n\treturn 0;\n}", "import os\nimport sys\nfrom collections import defaultdict\n\nimport heapq\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\n\"\"\"\n最小費用流\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B&lang=jp\n\"\"\"\n\n\nclass MinCostFlow:\n \"\"\"\n 最小費用流 ダイクストラ版\n Primal Dual\n \"\"\"\n\n def __init__(self, graph=None, residual=None):\n \"\"\"\n :param list of (list of (int, int, int)) graph: (to, cap, cost) の隣接リスト\n :param list of (list of (list of (int|list))) residual: (to, cap, cost, rev) の残余グラフ\n \"\"\"\n assert (graph and not residual) or (not graph and residual)\n if graph:\n self.graph = self.residual_graph(graph)\n else:\n self.graph = residual\n\n @staticmethod\n def residual_graph(graph):\n \"\"\"\n 残余グラフ構築\n :param list of (list of (int, int, int)) graph: (to, cap, cost) の隣接リスト\n :rtype: list of (list of (list of (int|list)))\n :return: (to, cap, cost, rev) の残余グラフ\n \"\"\"\n ret = [[] for _ in range(len(graph))]\n for v in range(len(graph)):\n for u, cap, cost in graph[v]:\n rev = [v, 0, -cost]\n edge = [u, cap, cost, rev]\n rev.append(edge)\n ret[v].append(edge)\n ret[u].append(rev)\n return ret\n\n def solve(self, from_v, to_v, flow):\n \"\"\"\n :param int from_v:\n :param int to_v:\n :param int flow:\n :rtype: int\n \"\"\"\n res = 0\n h = [0] * len(self.graph)\n prevv = [-1] * len(self.graph)\n preve = [-1] * len(self.graph)\n remains = flow\n while remains > 0:\n dist = [float('inf')] * len(self.graph)\n dist[from_v] = 0\n heap = [(0, from_v)]\n\n # Dijkstra\n while heap:\n d, v = heapq.heappop(heap)\n if d > dist[v]:\n continue\n for edge in self.graph[v]:\n u, cap, cost, rev = edge\n if cap > 0 and dist[v] + cost + h[v] - h[u] < dist[u]:\n dist[u] = dist[v] + cost + h[v] - h[u]\n prevv[u] = v\n preve[u] = edge\n heapq.heappush(heap, (dist[u], u))\n\n if dist[to_v] == float('inf'):\n # これ以上流せない\n return -1\n\n for i, d in enumerate(dist):\n h[i] += d\n\n # 最短路に流せる量\n flow = remains\n v = to_v\n while v != from_v:\n cap = preve[v][1]\n flow = min(cap, flow)\n v = prevv[v]\n\n # 最短路に flow だけ流す\n v = to_v\n while v != from_v:\n preve[v][1] -= flow\n preve[v][3][1] += flow\n v = prevv[v]\n\n remains -= flow\n res += flow * h[to_v]\n return res\n\n\nV, E, F = list(map(int, sys.stdin.readline().split()))\nUVCD = [list(map(int, sys.stdin.readline().split())) for _ in range(E)]\n\ngraph = [[] for _ in range(V)]\nfor u, v, c, d in UVCD:\n graph[u].append((v, c, d))\n\nans = MinCostFlow(graph=graph).solve(from_v=0, to_v=V - 1, flow=F)\nprint(ans)\n\n", "import heapq\n\nINF = 10 ** 5\n\n\nclass MinCostFlow:\n \"\"\"\n 最小費用流の ダイクストラ版\n 蟻本 P.203\n \"\"\"\n\n def __init__(self, V):\n self.V = V\n self.G = [[] for _ in range(V)]\n # 最小コスト見つかったあとに, route を取得するために使用\n self.prevv = [INF] * V\n self.preve = [INF] * V\n\n self.h = [0] * V # ポテンシャル\n\n def add_edge(self, from_, to_, cap, cost):\n \"\"\"\n from から to へ向かう容量 cap, コスト cost の辺をグラフに追加\n \"\"\"\n self.G[from_].append([to_, cap, cost, len(self.G[to_])])\n self.G[to_].append([from_, 0, -cost, len(self.G[from_]) - 1])\n\n def _get_dist(self, s, t, f):\n \"\"\"\n prevv,preve から 最大で流せる量を返す\n\n :param s: 始点\n :param t: 終点\n :param f: 最大で流したい量\n :return:\n \"\"\"\n d = f\n v = t\n while v != s:\n pre_v = self.prevv[v]\n pre_edge = self.preve[v]\n d = min(d, self.G[pre_v][pre_edge][1]) # 1:cap のindex\n v = pre_v\n return d\n\n def _update_cap(self, s, t, d):\n \"\"\" capacity 更新 \"\"\"\n v = t\n while v != s:\n pre_v = self.prevv[v]\n pre_e = self.preve[v]\n e = self.G[pre_v][pre_e] # type:list\n e[1] -= d # cap 更新\n rev = e[3] # type:int\n self.G[v][rev][1] += d # 逆辺のcap更新\n\n v = pre_v\n\n def solve(self, s, t, f):\n res = 0\n self.h = [0] * self.V\n dist = [INF] * self.V # 最短経路\n while f > 0:\n que = [] # priority queue (<最短距離, 頂点の番号>) を要素にもつ. ダイクストラ用\n for i in range(self.V):\n dist[i] = INF\n dist[s] = 0\n\n heapq.heappush(que, (0, s))\n\n while que:\n\n p = heapq.heappop(que)\n v = p[1] # 注目する頂点\n if (dist[v] < p[0]): continue\n\n for i in range(len(self.G[v])):\n e = self.G[v][i]\n to_ = e[0]\n cap = e[1]\n cost = e[2]\n\n if cap <= 0: continue\n\n # u -> v のとき, dist[v] は dist[u] + cost + h(u) -h(v) # p.202\n if dist[to_] > dist[v] + cost + self.h[v] - self.h[to_]:\n dist[to_] = dist[v] + cost + self.h[v] - self.h[to_]\n self.prevv[to_] = v\n self.preve[to_] = i\n heapq.heappush(que, (dist[to_], to_))\n\n if dist[t] == INF: # 経路なし(これ以上流せない)\n return -1\n\n for v in range(self.V):\n self.h[v] += dist[v]\n\n # 流せる量を取得\n d = self._get_dist(s, t, f)\n res += d * self.h[t]\n f -= d\n\n # update capacity\n self._update_cap(s, t, d)\n\n return res\n\n\nv,e,f = [int(_) for _ in input().split()]\nmcf = MinCostFlow(v)\nfor i in range(e):\n mcf.add_edge( *[int(_) for _ in input().split()])\nprint(mcf.solve(0,v-1,f))\n\n", "import java.util.List;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\n\nimport java.lang.*;\n\nclass MinCostFlow{\n private static final int inf = 1001001000;\n static class Edge{\n public int to;\n public int cap;\n public int cost;\n public int rev;\n public boolean isRev;\n public Edge(final int t, final int ca, final int co, final int r, final boolean isrev){\n to = t;\n cap = ca;\n cost = co;\n rev = r;\n isRev = isrev;\n } \n };\n static class State implements Comparable<State>{\n public int dist;\n public int node;\n public State(int d, int n){\n this.dist = d;\n this.node = n;\n }\n @Override\n public int compareTo(State other){\n return dist - other.dist;\n }\n };\n private int numberOfNodes;\n private List<Edge>[] graph;\n private int[] h;\n private int[] dist;\n private int[] prevv;\n private int[] preve;\n @SuppressWarnings(\"unchecked\")\n public MinCostFlow(final int N){\n numberOfNodes = N;\n graph = new ArrayList[N];\n for(int i = 0; i < N; i++){\n graph[i] = new ArrayList<Edge>();\n }\n h = new int[N];\n dist = new int[N];\n prevv = new int[N];\n preve = new int[N];\n }\n public void AddEdge(final int from, final int to, final int cap, final int cost){\n graph[from].add(new Edge(to, cap, cost, graph[to].size(), false));\n graph[to].add(new Edge(from, 0, -cost, graph[from].size()-1, true));\n }\n public int calc(final int s, final int t, final int flow){\n int f = flow;\n int res = 0;\n while(f > 0){\n PriorityQueue<State> Q = new PriorityQueue<>();\n Arrays.fill(dist,inf);\n dist[s] = 0;\n Q.offer(new State(0,s));\n while(!Q.isEmpty()){\n State now = Q.poll();\n if(dist[now.node] < now.dist){\n continue;\n }\n for(int i = 0; i < graph[now.node].size(); i++){\n Edge e = graph[now.node].get(i);\n if(e.cap > 0 && dist[e.to] > dist[now.node] + e.cost + h[now.node] - h[e.to]){\n dist[e.to] = dist[now.node] + e.cost + h[now.node] - h[e.to];\n prevv[e.to] = now.node;\n preve[e.to] = i;\n Q.offer(new State(dist[e.to],e.to));\n }\n }\n }\n if(dist[t]==inf){\n return -1;\n }\n for(int v = 0; v < numberOfNodes; v++){\n h[v] += dist[v];\n }\n int d = f;\n for(int v = t; v != s; v = prevv[v]){\n d = Math.min(d, graph[prevv[v]].get(preve[v]).cap);\n }\n f -= d;\n res += d * h[t];\n for(int v = t; v != s; v = prevv[v]){\n Edge e = graph[prevv[v]].get(preve[v]);\n e.cap -= d;\n graph[v].get(e.rev).cap += d;\n }\n }\n return res;\n }\n};\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = Integer.parseInt(sc.next());\n int M = Integer.parseInt(sc.next());\n int F = Integer.parseInt(sc.next());\n MinCostFlow flow = new MinCostFlow(N);\n for(int i = 0; i < M; i++){\n int u = Integer.parseInt(sc.next());\n int v = Integer.parseInt(sc.next());\n int c = Integer.parseInt(sc.next());\n int d = Integer.parseInt(sc.next());\n flow.AddEdge(u, v, c, d);\n }\n sc.close();\n System.out.println(flow.calc(0,N-1,F));\n }\n}\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int, int> PI;\ntypedef pair<LL, LL> PLL;\nconst LL MOD = 1000000007LL;\nconst int inf = 1e9;\nconst LL INF = 1e18;\nconst int MAX_V = 100;\nstruct edge {\n\tint to, cap, cost, rev;\n\tedge(int to, int cap, int cost, int rev) :to(to), cap(cap), cost(cost), rev(rev) {}\n};\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\nint V;\nvoid add_edge(int from, int to, int cap, int cost) {\n\tG[from].emplace_back(to, cap, cost, G[to].size());\n\tG[to].emplace_back(from, 0, -cost, G[from].size() - 1);\n}\nint min_cost_flow(int s, int t, int f) {\n\tint res = 0;\n\tfill(h, h + V, 0);\n\twhile (f > 0) {\n\t\tpriority_queue<PI, vector<PI>, greater<PI>> que;\n\t\tfill(dist, dist + V, inf);\n\t\tdist[s] = 0;\n\t\tque.push(PI(0, s));\n\t\twhile (!que.empty()) {\n\t\t\tPI p = que.top(); que.pop();\n\t\t\tint v = p.second;\n\t\t\tif (dist[v] < p.first) continue;\n\t\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\t\tedge e = G[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tque.push(PI(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == inf) return -1;\n\t\tfor (int v = 0; v < V; v++) h[v] += dist[v];\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d*h[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\nint main() {\n\tcin >> V;\n\tint E, F;\n\tcin >> E >> F;\n\tfor (int i = 0; i < E; i++) {\n\t\tint u, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\t\tadd_edge(u, v, c, d);\n\t}\n\tcout << min_cost_flow(0, V - 1, F) << endl;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_V 10000\n#define INF 1000000001\ntypedef pair<int,int> P;\nstruct edge { int to,cap,cost,rev; };\nint V;\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\nvoid init_edge(){\n for(int i=0;i<V;i++)G[i].clear();\n}\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].push_back((edge){to,cap,cost,(int)G[to].size()});\n G[to].push_back((edge){from,0,-cost,(int)G[from].size()-1});\n}\nint min_cost_flow(int s,int t,int f){\n int res = 0;\n fill(h,h+V,0);\n while(f>0){\n \n priority_queue< P, vector<P>, greater<P> > que;\n fill( dist, dist+V , INF );\n dist[s]=0;\n que.push(P(0,s));\n while(!que.empty()){\n P p = que.top(); que.pop();\n int v = p.second;\n if(dist[v]<p.first)continue;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(P(dist[e.to],e.to));\n }\n }\n }\n \n if(dist[t]==INF){\n return -1;\n }\n for(int v=0;v<V;v++)h[v]+=dist[v];\n \n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\nint main(){\n int E,F,a,b,c,d;\n cin>>V>>E>>F;\n while(E--){\n cin>>a>>b>>c>>d;\n add_edge(a,b,c,d);\n }\n cout<<min_cost_flow(0,V-1,F)<<endl;\n return 0;\n}", "#include<iostream>\n#include<vector>\n#include<cstring>\nusing namespace std;\n\nconst int MAX_V = 200;\n\nstruct edge{\n int to, cap, cost, rev;\n};\n\nint V;\nvector<edge> G[MAX_V];\nint dist[MAX_V]; // 頂点にflowを1流すときのコストの総和\nint prevv[MAX_V], preve[MAX_V]; // prev_vertex, prev_edge\nconst int INF = 1<<30;\n\nvoid add_edge(int from, int to, int cap, int cost){\n G[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].push_back((edge){from, 0, -cost, (int)G[from].size()-1});\n}\n\n// flow from s to t, the amount of that is f\nint min_cost_flow(int s, int t, int f){\n int res = 0;\n while(f > 0){\n for(int i = 0; i < V; i++) dist[i] = INF;\n dist[s] = 0;\n bool update = true;\n // bellman-ford\n while(update){\n update = false;\n for(int v = 0; v < V; v++){\n if(dist[v] == INF) continue;\n for(int i = 0; i < G[v].size(); i++){\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost){\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n if(dist[t] == INF){\n return -1;\n }\n int d = f;\n // 辺を逆に辿る、流せるだけ流す\n for(int v = t; v != s; v = prevv[v]){\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for(int v = t; v != s; v = prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d; // 順方向に流したので-\n G[v][e.rev].cap += d; // 逆方向に流したので+\n }\n }\n return res;\n}\n\nint main(){\n int e, f;\n cin >> V >> e >> f;\n for(int i = 0; i < e; i++){\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n add_edge(a, b, c, d);\n }\n cout << min_cost_flow(0, V-1, f) << endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)\n#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)\n#define all(c) c.begin(),c.end()\n#define sz(x) ((int)x.size())\nusing pii = pair<int, int>;\nusing vvi = vector<vector<int>>;\nusing vi = vector<int>;\nconstexpr int INF = 1001001001001001001LL;\n\nstruct MinCostFlow {\n struct edge { int to, cap, cost, rev; };\n int V;\n vector<vector<edge>> G;\n vi dist, prevv, preve;\n\n MinCostFlow(int V) : V(V), G(V), dist(V), prevv(V), preve(V) {}\n\n void add_edge(int from, int to, int cap, int cost) {\n G[from].push_back((edge){ to, cap, cost, sz(G[to]) });\n G[to ].push_back((edge){ from, 0, -cost, sz(G[from]) - 1 });\n }\n\n // 流せない場合は-1を返す\n int get(int s, int t, int f) {\n int res = 0;\n while (f > 0) {\n fill(all(dist), INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n rep(v, 0, V) {\n if (dist[v] == INF) continue;\n rep(i, 0, sz(G[v])) {\n auto &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n\n if (dist[t] == INF) {\n return -1;\n }\n\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prevv[v]) {\n auto &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\nsigned main() {\n int V, E, F;\n cin >> V >> E >> F;\n MinCostFlow min_cost_flow(V);\n rep(i, 0, E) {\n int vs, vt, cap, cost;\n cin >> vs >> vt >> cap >> cost;\n min_cost_flow.add_edge(vs, vt, cap, cost);\n }\n cout << min_cost_flow.get(0, V - 1, F) << endl;\n}\n\n", "#include <bits/stdc++.h>\nusing Int = int64_t;\nusing UInt = uint64_t;\nusing C = std::complex<double>;\n#define rep(i, n) for(Int i = 0; i < (Int)(n); ++i)\n#define rep2(i, l, r) for(Int i = (Int)(l); i < (Int)(r); ++i)\n#define guard(x) if( not (x) ) continue;\n#ifndef LOCAL_\n#define fprintf if( false ) fprintf\n#endif\n\ntemplate<typename T>\nusing RQ = std::priority_queue<T, std::vector<T>, std::greater<T>>;\n\nint main() {\n Int v, e, f;\n std::cin >> v >> e >> f;\n std::vector<Int> ss(e+1), ts(e+1), cs(e+1), fs(e+1), bs(e+1);\n rep2(i,1,e+1) {\n Int a, b, c, d;\n std::cin >> a >> b >> c >> d;\n ss[i] = a, ts[i] = b, cs[i] = d, fs[i] = 0, bs[i] = c;\n }\n std::vector<std::vector<Int>> es(v);\n rep2(i,1,e+1) {\n Int s = ss[i], t = ts[i];\n es[s].emplace_back(i);\n es[t].emplace_back(-i);\n }\n Int res = 0;\n Int source = 0, sink = v-1;\n std::vector<Int> hs(v);\n while( f > 0 ) {\n RQ<std::pair<Int,Int>> q;\n q.emplace(0, source);\n std::vector<Int> ps(v, -1), xs(v, -1), ys(v);\n xs[source] = 0;\n ys[source] = f;\n while( not q.empty() ) {\n Int d, s; std::tie(d, s) = q.top(); q.pop();\n guard( d == xs[s] );\n for(Int i : es[s]) {\n Int k = std::abs(i);\n Int t = i > 0 ? ts[k] : ss[k];\n Int tf = i > 0 ? bs[k] : fs[k];\n guard( tf > 0 );\n Int nd = d + (i>0?cs[k]:-cs[k]) + hs[s] - hs[t];\n guard( xs[t] == -1 or xs[t] > nd );\n xs[t] = nd;\n ps[t] = i;\n ys[t] = std::min(ys[s], tf);\n q.emplace(nd, t);\n }\n }\n Int tf = ys[sink];\n f -= tf;\n if( f > 0 and tf == 0 ) {\n res = -1;\n break;\n }\n rep(i, v) hs[i] += xs[i];\n for(Int i=sink, k=ps[i]; i!=source; i=(k>0?ss[k]:ts[-k]), k=ps[i]) {\n Int ak = std::abs(k);\n if( k > 0 ) {\n fs[ak] += tf;\n bs[ak] -= tf;\n }\n else {\n fs[ak] -= tf;\n bs[ak] += tf;\n }\n }\n res += tf * hs[sink];\n if( f == 0 ) break;\n }\n printf(\"%ld\\n\", res);\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = long long;\n#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)\n#define all(x) x.begin(),x.end()\n\nstruct edge {\n i64 from;\n i64 to;\n i64 cap;\n i64 cost;\n i64 rev;\n};\n\ni64 INF = 1e18;\n\ni64 capacity_scaling_bflow(std::vector<std::vector<edge>>& g, std::vector<i64> b) {\n i64 ans = 0;\n\n\n i64 U = *std::max_element(begin(b), end(b));\n i64 delta = (1 << ((int)(std::log2(U)) + 1));\n int n = g.size();\n\n std::vector<i64> e = b;\n\n std::vector<i64> p(n, 0);\n\n int zero = 0;\n\n for(auto x : e) {\n if(x == 0) zero++;\n }\n\n for(;delta > 0; delta >>= 1) {\n if(zero == n) break;\n for(int s = 0;s < n;s++) {\n if(!(e[s] >= delta)) continue;\n std::vector<std::size_t> pv(n, -1);\n std::vector<std::size_t> pe(n, -1);\n std::vector<i64> dist(n, INF);\n using P = std::pair<i64,i64>;\n std::priority_queue<P,std::vector<P>,std::greater<P>> que;\n dist[s] = 0;\n que.push({dist[s], s});\n while(!que.empty()) {\n int v = que.top().second;\n i64 d = que.top().first;\n que.pop();\n if(dist[v] < d) continue;\n for(std::size_t i = 0;i < g[v].size();i++) {\n const auto& e = g[v][i];\n std::size_t u = e.to;\n if(e.cap == 0) continue;\n if(dist[u] > dist[v] + e.cost + p[v] - p[u]) {\n dist[u] = dist[v] + e.cost + p[v] - p[u];\n pv[u] = v;\n pe[u] = i;\n que.push({dist[u], u});\n }\n }\n }\n\n for(int i = 0;i < n;i++) {\n if(pv[i] != -1) p[i] += dist[i];\n }\n\n int t = 0;\n for(;t < n;t++) {\n if(!(e[s] >= delta)) break;\n if(e[t] <= -delta && pv[t] != -1) {\n std::size_t u = t;\n for(;pv[u] != -1;u = pv[u]) {\n ans += delta * g[pv[u]][pe[u]].cost;\n g[pv[u]][pe[u]].cap -= delta;\n g[u][g[pv[u]][pe[u]].rev].cap += delta;\n }\n e[u] -= delta;\n e[t] += delta;\n if(e[u] == 0) zero++;\n if(e[t] == 0) zero++;\n }\n }\n }\n }\n \n if(zero == n) return ans;\n else return -1e18;\n}\n\nint main() {\n i64 N,M,F;\n cin >> N >> M >> F;\n vector<vector<edge>> g(N + M);\n vector<i64> e(N + M, 0);\n int s = 0;\n int t = N - 1;\n e[s + M] = F;\n e[t + M] = -F;\n for(int i = 0;i < M;i++) {\n i64 a,b,c,d;\n cin >> a >> b >> c >> d;\n\n e[i] = c;\n e[a + M] -= c;\n\n g[i].push_back({i, a + M, (i64)1e18, 0, (i64)g[a + M].size()});\n g[a + M].push_back({a + M, i, 0, 0, (i64)g[i].size() - 1});\n\n g[i].push_back({i, b + M, (i64)1e18, d, (i64)g[b + M].size()});\n g[b + M].push_back({b + M, i, 0, -d, (i64)g[i].size() - 1});\n }\n\n\n i64 ans = capacity_scaling_bflow(g, e);\n if(ans == -1e18) {\n cout << -1 << endl;\n }\n else {\n cout << ans << endl;\n }\n}\n\n", "//#define __USE_MINGW_ANSI_STDIO 0\n#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<ll> VL;\ntypedef vector<VL> VVL;\ntypedef pair<int, int> PII;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define IN(a, b, x) (a<=x&&x<b)\n#define MP make_pair\n#define PB push_back\nconst int INF = (1LL<<30);\nconst ll LLINF = (1LL<<60);\nconst double PI = 3.14159265359;\nconst double EPS = 1e-12;\nconst int MOD = 1000000007;\n//#define int ll\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\n#define MAX_V 10000\nstruct edge { int to, cap, cost, rev; };\n\nint V;\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\n\nvoid add_edge(int from, int to, int cap, int cost) {\n G[from].PB({to, cap, cost, (int)G[to].size()});\n G[to].PB({from, 0, -cost, (int)G[from].size()-1});\n}\n\n// s??????t????????????f???????°??????¨???\nint min_cost_flow(int s, int t, int f) {\n int res = 0;\n fill(h, h+V, 0);\n while(f > 0) {\n priority_queue<PII, vector<PII>, greater<PII>> que;\n fill(dist, dist+V, INF);\n dist[s] = 0;\n que.push({0, s});\n while(que.size()) {\n PII p = que.top(); que.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n for(int i=0; i<(int)G[v].size(); ++i) {\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push({dist[e.to], e.to});\n }\n }\n }\n // ????????\\???????????????\n if(dist[t] == INF) return -1;\n REP(v, V) h[v] += dist[v];\n\n int d = f;\n for(int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for(int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nsigned main(void)\n{\n int e, f;\n cin >> V >> e >> f;\n REP(i, e) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n add_edge(u, v, c, d);\n }\n\n cout << min_cost_flow(0, V-1, f) << endl;\n\n return 0;\n}", "#include <iostream>\n#include <vector>\n#include <unordered_map>\n#include <queue>\n \nusing namespace std; \n\ntypedef unordered_map<int,unordered_map<int,int>> double_map;\n \nint dfs(\n int now, int end, int flow, int *cost,\n vector<bool> &arrived, vector<int> &dp, double_map &g, double_map &costs\n) {\n if(now==end||flow==0) return flow;\n arrived[now] = true;\n for(pair<int,int> p : costs[now]) {\n int next = p.first;\n int next_cost = p.second;\n if(arrived[next]) continue;\n if(dp[next]-dp[now]==next_cost) {\n int res = dfs(next,end,min(flow,g[now][next]),cost,arrived,dp,g,costs);\n if(res>0) {\n g[now][next] -= res;\n g[next][now] += res;\n costs[next][now] = -costs[now][next];\n if(g[now][next]==0) {\n costs[now].erase(next);\n }\n *cost += res*next_cost;\n return res;\n }\n }\n }\n return 0;\n}\n \nvoid calc(int v, double_map &costs, vector<int> &dp, int s) {\n dp[s] = 0;\n vector<int> vf(v,1<<30);\n for(int loop = 0; loop < v; loop++) {\n for(int now = 0; now < v; now++) {\n if(dp[now]==1<<30) continue;\n vf[now] = min(vf[now],dp[now]);\n for(pair<int,int> p : costs[now]) {\n int next = p.first;\n int next_cost = p.second;\n vf[next] = min(vf[next],dp[now]+next_cost);\n }\n }\n dp.swap(vf);\n }\n}\n\nint min_cost_flow(int v, double_map &g, double_map &costs, int f, int s, int e) {\n int cost = 0;\n int ans = 0;\n while(ans<f) {\n vector<int> dp(v,1<<30);\n calc(v,costs,dp,s);\n vector<bool> arrived(v);\n int flow = dfs(s,e,f-ans,&cost,arrived,dp,g,costs);\n if(flow<=0) {\n return -1; \n }\n else ans += flow;\n }\n return cost;\n}\n \nint main() {\n int v,e,f;\n double_map g,costs;\n cin >> v >> e >> f;\n for(int i = 0; i < e; i++) {\n int u,v2,c,d;\n cin >> u >> v2 >> c >> d;\n if(c<=0) continue;\n g[u][v2] = c;\n costs[u][v2] = d;\n }\n int cost = min_cost_flow(v,g,costs,f,0,v-1);\n cout << cost << endl;\n}\n", "import sys\nreadline = sys.stdin.readline\n\nfrom heapq import heappop as hpp, heappush as hp\nclass MinCostFlowwithDijkstra:\n INF = 1<<31\n \n def __init__(self, N):\n self.N = N\n self.Edge = [[] for _ in range(N)]\n \n def add_edge(self, st, en, cap, cost):\n self.Edge[st].append([en, cap, cost, len(self.Edge[en])])\n self.Edge[en].append([st, 0, -cost, len(self.Edge[st])-1])\n \n def get_mf(self, so, si, fl):\n N = self.N\n INF = self.INF\n res = 0\n Pot = [0]*N\n geta = N\n \n \n prv = [None]*N\n prenum = [None]*N\n while fl:\n dist = [INF]*N\n dist[so] = 0\n Q = [so]\n \n while Q:\n cost, vn = divmod(hpp(Q), geta)\n if dist[vn] < cost:\n continue\n \n for enum in range(len(self.Edge[vn])):\n vf, cap, cost, _ = self.Edge[vn][enum]\n cc = dist[vn] + cost - Pot[vn] + Pot[vf]\n if cap > 0 and dist[vf] > cc:\n dist[vf] = cc\n prv[vf] = vn\n prenum[vf] = enum\n hp(Q, cc*geta + vf)\n \n if dist[si] == INF:\n return -1\n \n for i in range(N):\n Pot[i] -= dist[i]\n \n cfl = fl\n vf = si\n while vf != so:\n cfl = min(cfl, self.Edge[prv[vf]][prenum[vf]][1])\n vf = prv[vf]\n \n fl -= cfl\n res -= cfl*Pot[si]\n vf = si\n while vf != so:\n e = self.Edge[prv[vf]][prenum[vf]]\n e[1] -= cfl\n self.Edge[vf][e[3]][1] += cfl\n vf = prv[vf]\n return res\n\nN, M, F = map(int, readline().split())\nT = MinCostFlowwithDijkstra(N)\nfor _ in range(M):\n u, v, cap, cost = map(int, readline().split())\n T.add_edge(u, v, cap, cost)\n\nprint(T.get_mf(0, N-1, F))\n", "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\ntemplate<class T = int> using V = vector<T>;\ntemplate<class T = int> using VV = V< V<T> >;\n\n\ntemplate<class T> struct PrimalDual {\n struct Edge {\n int to, rev;\n T cap, cost;\n };\n const int n;\n const T inf = numeric_limits<T>::max();\n VV<Edge> g;\n V<T> pot, dist;\n V<> pv, pe;\n PrimalDual(int n) : n(n), g(n), pot(n), dist(n), pv(n), pe(n) {}\n void add_edge(int from, int to, T cap, T cost) {\n assert(from != to);\n assert(cap >= 0);\n assert(cost >= 0);\n g[from].emplace_back(Edge{to, (int) g[to].size(), cap, cost});\n g[to].emplace_back(Edge{from, (int) g[from].size() - 1, 0, -cost});\n }\n void dijkstra(int s) {\n using P = pair<T, int>;\n priority_queue< P, V<P>, greater<P> > pque;\n fill(begin(dist), end(dist), inf);\n pque.emplace(dist[s] = 0, s);\n while (!pque.empty()) {\n T d; int v;\n tie(d, v) = pque.top(); pque.pop();\n if (d > dist[v]) continue;\n for (int i = 0; i < g[v].size(); ++i) {\n const Edge& e = g[v][i];\n if (e.cap <= 0 or dist[e.to] <= dist[v] + e.cost - (pot[e.to] - pot[v])) continue;\n pv[e.to] = v;\n pe[e.to] = i;\n pque.emplace(dist[e.to] = dist[v] + e.cost - (pot[e.to] - pot[v]), e.to);\n }\n }\n }\n T min_cost_flow(int s, int t, T f) {\n assert(s != t);\n assert(f >= 0);\n T res = 0;\n fill(begin(pot), end(pot), 0);\n while (f > 0) {\n dijkstra(s);\n if (dist[t] == inf) return -1;\n for (int v = 0; v < n; ++v) pot[v] += dist[v];\n T d = f;\n for (int v = t; v != s; v = pv[v]) {\n d = min(d, g[pv[v]][pe[v]].cap);\n }\n f -= d;\n res += d * pot[t];\n for (int v = t; v != s; v = pv[v]) {\n Edge& e = g[pv[v]][pe[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\nint main() {\n cin.tie(nullptr); ios::sync_with_stdio(false);\n int n, m, f; cin >> n >> m >> f;\n PrimalDual<int> pd(n);\n for (int i = 0; i < m; ++i) {\n int from, to, cap, cost; cin >> from >> to >> cap >> cost;\n pd.add_edge(from, to, cap, cost);\n }\n cout << pd.min_cost_flow(0, n - 1, f) << '\\n';\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing UL=unsigned int;\nusing LL=long long;\nusing ULL=unsigned long long;\n#define rep(i,n) for(UL i=0; i<(n); i++)\n\ntemplate<class T>\nusing nega_queue = priority_queue<T,vector<T>,greater<T>>;\n\nstruct Edge{ UL u,v; UL c; int d; UL r; };\n\nUL N,M;\nEdge J[2000];\nvector<UL> E[100];\n\nUL F;\nint fAns = 0;\nUL fD[100];\nUL fPE[100];\nUL fP[100]={};\n\nvoid fDijkstra(){\n rep(i,N) fD[i]=fPE[i]=~0u;\n nega_queue<pair<UL,pair<UL,UL>>> Q; Q.push({0,{0,~0u}});\n while(Q.size()){\n UL d=Q.top().first;\n UL p=Q.top().second.first;\n UL pre=Q.top().second.second;\n Q.pop();\n if(fD[p]!=~0u) continue;\n fD[p]=d;\n fPE[p]=pre;\n for(UL j:E[p]){\n if(J[j].c==0)continue;\n Q.push({d+J[j].d+fP[p]-fP[J[j].v],{J[j].v,j}});\n }\n }\n rep(i,N) fP[i]+=fD[i];\n}\n\nvoid flow(){\n fDijkstra();\n if(fD[N-1]==~0u){ F=0; fAns=-1; return; }\n UL p=N-1;\n UL c=F;\n while(p!=0){\n c=min(c,J[fPE[p]].c);\n p=J[fPE[p]].u;\n }\n p=N-1;\n while(p!=0){\n J[fPE[p]].c-=c;\n J[J[fPE[p]].r].c+=c;\n fAns += (int)c * J[fPE[p]].d;\n p=J[fPE[p]].u;\n }\n F-=c;\n}\n\nint main(){\n scanf(\"%u%u%u\",&N,&M,&F);\n rep(i,M){\n UL u,v,c; int d; scanf(\"%u%u%u%d\",&u,&v,&c,&d);\n E[u].push_back(i);\n E[v].push_back(M+i);\n J[i]=Edge{u,v,c,d,M+i};\n J[M+i]=Edge{v,u,0,-d,i};\n }\n\n while(F) flow();\n\n printf(\"%d\\n\",fAns);\n\n return 0;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for (int i=0;i<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define all(a) (a).begin(),(a).end()\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> vi;\ntypedef vector<P> vp;\ntypedef vector<ll> vll;\n\nconst int INF = 99999999;\nconst int MAX_V = 100000;\n\nstruct edge { int to, cap, cost, rev; };\n\nint V, E, F;\nvector<edge> G[MAX_V];\nint h[MAX_V]; // potential\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V]; // privious vertex, edge\n\nvoid add_edge(int from, int to, int cap, int cost) {\n G[from].emplace_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].emplace_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\n// get min cost flow from s to t\n// if we cannot flow f, then return -1\nint min_cost_flow(int s, int t, int f) {\n int res = 0;\n fill(h, h + V, 0);\n while (f > 0) {\n // update h by dijkstra\n priority_queue<P, vector<P>, greater<P>> que;\n fill(dist, dist + V, INF);\n dist[s] = 0;\n que.push(P(0, s));\n while (!que.empty()) {\n P p = que.top(); que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n rep(i, G[v].size()) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INF) {\n // no more flow\n return -1;\n }\n rep(v, V) h[v] += dist[v];\n\n // flow as much as possible along the minimum path from s to t\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, (int)G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nsigned main() {\n cin >> V >> E >> F;\n rep(i, E) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n add_edge(u, v, c, d);\n }\n\n cout << min_cost_flow(0, V - 1, F) << endl;\n}", "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\nconst int mod=1000000007,MAX=103,INF=1<<30;\ntypedef pair<int,int> P;\n\nstruct edge{int to,cap,cost,rev;};\n\nint V;\nvector<edge> G[MAX];\nint h[MAX];\nint dist[MAX];\nint prevv[MAX],preve[MAX];\n\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].push_back((edge){to,cap,cost,int(G[to].size())});\n G[to].push_back((edge){from,0,-cost,int(G[from].size()-1)});\n}\n\nint min_cost_flow(int s,int t,int f){\n int res=0;\n fill(h,h+V,0);\n \n while(f>0){\n priority_queue<P,vector<P>,greater<P>> que;\n fill(dist,dist+V,INF);\n dist[s]=0;\n que.push(P(0,s));\n while(!que.empty()){\n P p=que.top();que.pop();\n int v=p.second;\n if(dist[v]<p.first) continue;\n for(int i=0;i<G[v].size();i++){\n edge &e=G[v][i];\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(P(dist[e.to],e.to));\n }\n }\n }\n \n if(dist[t]==INF){\n return -1;\n }\n for(int v=0;v<V;v++){\n h[v]+=dist[v];\n }\n \n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return res;\n}//sからtへの流量fの最小費用流、流せない場合は-1\n\nint main(){\n\n int E,F;cin>>V>>E>>F;\n for(int i=0;i<E;i++){\n int a,b,c,d;cin>>a>>b>>c>>d;\n add_edge(a,b,c,d);\n }\n \n int ans=min_cost_flow(0,V-1,F);\n \n cout<<ans<<endl;\n}\n\n\n", "import heapq\n\nclass edge:\n def __init__(self, to, cap, cost, rev):\n self.to: int = to\n self.cap: int = cap\n self.cost: int = cost\n self.rev: int = rev\n\n\nclass min_cost_flow:\n def __init__(self, N):\n self.N: int = N\n self.INF: int = 1000000000000000000\n self.G = [[] for i in range(N)]\n \n def add_edge(self, fro, to, cap, cost):\n self.G[fro].append(edge(to, cap, int(cost), int(len(self.G[to]))))\n self.G[to].append(edge(fro, 0, -int(cost), int(len(self.G[fro]) - 1)))\n \n def solve(self, s, t, f):\n N = self.N\n prevv = [0 for i in range(N)]\n preve = [0 for i in range(N)]\n \n ret = 0\n while 0 < f:\n dist = [self.INF for i in range(N)]\n dist[s] = 0\n hq = [(0, s)]\n heapq.heapify(hq)\n while hq:\n d, v = heapq.heappop(hq)\n for i in range(len(self.G[v])):\n e = self.G[v][i]\n if 0 < e.cap and dist[v] + e.cost < dist[e.to]:\n dist[e.to] = dist[v] + e.cost\n prevv[e.to] = v\n preve[e.to] = i\n heapq.heappush(hq, (dist[e.to], e.to))\n\n # 流せない\n if dist[t] == self.INF:\n return self.INF\n\n d = f\n v = t\n while v != s:\n d = min(d, self.G[prevv[v]][preve[v]].cap)\n v = prevv[v]\n\n f -= d\n ret += d * dist[t]\n v = t\n while v != s:\n e = self.G[prevv[v]][preve[v]]\n e.cap -= d\n self.G[v][e.rev].cap += d\n v = prevv[v]\n \n return ret\n\n# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B\nv, e, f = map(int, input().split())\nmcf = min_cost_flow(v)\nfor i in range(e):\n ui, vi, ci, di = map(int, input().split())\n mcf.add_edge(ui, vi, ci, di)\n \nans = mcf.solve(0, v-1, f)\nif ans == mcf.INF:\n print(-1)\nelse:\n print(ans)\n", "#include <bits/stdc++.h>\n#define INF 1000000000\nusing namespace std;\ntypedef pair<int, int> pii;\n\nclass MinimumCostFlow {\n\tstruct edge {\n\t\tint to, cap, cost, rev;\n\t\tedge(int to_, int cap_, int cost_, int rev_)\n\t\t\t: to(to_), cap(cap_), cost(cost_), rev(rev_) {}\n\t};\n\tint V;\n\tvector<vector<edge>> G;\n\tvector<int> h, dist, prevv, preve;\npublic:\n\tMinimumCostFlow(int _V) : V(_V), G(_V), h(_V), dist(_V), prevv(_V), preve(_V) {}\n\tvoid add(int from, int to, int cap, int cost) {\n\t\tG[from].push_back(edge(to, cap, cost, G[to].size()));\n\t\tG[to].push_back(edge(from, 0, -cost, G[from].size() - 1));\n\t}\n\n\tint calc(int s, int t, int f) {\n\t\tint res = 0;\n\t\tfill(h.begin(), h.end(), 0);\n\t\twhile (f > 0) {\n\t\t\tpriority_queue<pii, vector<pii>, greater<pii>> que;\n\t\t\tfill(dist.begin(), dist.end(), INF);\n\t\t\tdist[s] = 0;\n\t\t\tque.push(pii(0, s));\n\t\t\twhile (!que.empty()) {\n\t\t\t\tpii p = que.top(); que.pop();\n\t\t\t\tint v = p.second;\n\t\t\t\tif (dist[v] < p.first) continue;\n\t\t\t\tfor (size_t i = 0; i < G[v].size(); i++) {\n\t\t\t\t\tedge &e = G[v][i];\n\t\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tque.push(pii(dist[e.to], e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[t] == INF) return -1;\n\t\t\tfor (int v = 0; v < V; v++)\n\t\t\t\th[v] += dist[v];\n\t\t\tint d = f;\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= d;\n\t\t\tres += d * h[t];\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tG[v][e.rev].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n};\nint main()\n{\n\tint V, E, F;\n\tcin >> V >> E >> F;\n\tMinimumCostFlow mcf(V);\n\tfor (int i = 0, u, v, c, d; i < E; i++) {\n\t\tcin >> u >> v >> c >> d;\n\t\tmcf.add(u, v, c, d);\n\t}\n\tcout << mcf.calc(0, V - 1, F) << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <queue>\n#include <limits>\n\nusing namespace std;\n\n//BEGIN\ntemplate <typename T, typename E>\nstruct PrimalDual {\n\tstruct edge {\n\t\tint to, rev;\n\t\tT cap;\n\t\tE cost;\n\n\t\tedge() {}\n\t\tedge(int to, T cap, E cost, int rev) :to(to), cap(cap), cost(cost), rev(rev) {}\n\t};\n\n\tconst E INF = numeric_limits<E>::max();\n\tvector<vector<edge> > G;\n\tvector<E> h, dist;\n\tvector<int> prevv, preve;\n\n\tPrimalDual() {}\n\tPrimalDual(int n) :G(n), h(n), dist(n), prevv(n), preve(n) {}\n\n\tvoid add_edge(int from, int to, T cap, E cost) {\n\t\tG[from].emplace_back(to, cap, cost, G[to].size());\n\t\tG[to].emplace_back(from, 0, -cost, G[from].size() - 1);\n\t}\n\n\tE min_cost_flow(int s, int t, T f) {\n\t\tE res = 0;\n\t\tpriority_queue<pair<E, int>, vector<pair<E, int> >, greater<pair<E, int> > > pq;\n\t\t\n\t\twhile (f > 0) {\n\t\t\tfill(dist.begin(), dist.end(), INF);\n\t\t\tpq.emplace(0, s);\n\t\t\tdist[s] = 0;\n\t\t\twhile (!pq.empty()) {\n\t\t\t\tpair<E, int> p = pq.top();\n\t\t\t\tpq.pop();\n\t\t\t\tif (dist[p.second] < p.first) continue;\n\t\t\t\tfor (int i = 0; i < G[p.second].size(); ++i) {\n\t\t\t\t\tedge& e = G[p.second][i];\n\t\t\t\t\tE ncost = dist[p.second] + e.cost + h[p.second] - h[e.to];\n\t\t\t\t\tif (e.cap > 0 && dist[e.to] > ncost) {\n\t\t\t\t\t\tdist[e.to] = ncost;\n\t\t\t\t\t\tprevv[e.to] = p.second; preve[e.to] = i;\n\t\t\t\t\t\tpq.emplace(dist[e.to], e.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[t] == INF) return -1;\n\t\t\tfor (int v = 0; v < h.size(); ++v)\n\t\t\t\tif (dist[v] < INF) h[v] += dist[v];\n\t\t\tT d = f;\n\t\t\tfor (int v = t; v != s; v = prevv[v]) d = min(d, G[prevv[v]][preve[v]].cap);\n\t\t\tf -= d;\n\t\t\tres += d * h[t];\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\tedge& e = G[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tG[v][e.rev].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\n//END\n\nint main() {\n\tint V, E, F; cin >> V >> E >> F;\n\tPrimalDual<int, int> G(V);\n\tfor (int i = 0; i < E; ++i) {\n\t\tint u, v, c, d; cin >> u >> v >> c >> d;\n\t\tG.add_edge(u, v, c, d);\n\t}\n\tcout << G.min_cost_flow(0, V - 1, F) << endl;\n\n\treturn 0;\n}\n\n\n/*\n\tcreated: 2020-01-06\n\thttps://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/6/GRL_6_B\n*/\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<double, double> pdd;\nconst ull mod = 1e9 + 7;\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n\n//debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\ntemplate < typename T >\nvoid vprint(T &v){\n\tREP(i, v.size()){\n\t\tcout << v[i] << \" \";\n\t}\n\tcout << endl;\n}\n\nstruct edge{\n\tll to, cap, cost, rev;\n\tedge(ll to, ll cap, ll cost, ll rev): to(to), cap(cap), cost(cost), rev(rev) {}\n};\n\ntypedef vector<edge> edges;\ntypedef vector<edges> graph;\nll INF= LLONG_MAX/3;\n\nvoid add_edge(graph &G, ll from, ll to, ll cap, ll cost){\n\tG[from].push_back(edge(to, cap, cost, G[to].size()));\n\tG[to].push_back(edge(from, 0, -cost, G[from].size()-1));\n}\n\nll SSC(graph &G, vector<ll> &excess){\n\tll V = G.size();\n\tmap<ll, ll> E, D;\n\tREP(i, V){\n\t\tif(excess[i]>0) E[i] = excess[i];\n\t\tif(excess[i]<0) D[i] = excess[i];\n\t}\n\n\tll total_cost = 0;\n\tvector<ll> pot(V, 0);\n\tvector<ll> prevv(V);\n\tvector<ll> preve(V);\n\twhile(!E.empty()){\n\t\tll s, t;\n\t\ts = E.begin()->first;\n\n\t\t// dijkstra\n\t\tpriority_queue< pll, vector<pll>, greater<pll> > pq;\n\t\tbool feasibility_flag = false;\n\t\tvector<ll> dist(V, INF);\n\t\tvector<bool> visited(V, false);\n\t\tdist[s] = 0;\n\t\tpq.push(pll(0, s));\n\t\twhile(!pq.empty()){\n\t\t\tpll p = pq.top();\n\t\t\tpq.pop();\n\t\t\tll v = p.second;\n\t\t\tvisited[v] = true;\n\t\t\tif(excess[v]<0){\n\t\t\t\tt = v;\n\t\t\t\tfeasibility_flag = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(dist[v]<p.first) continue;\n\t\t\tfor(int i=0;i<G[v].size();i++){\n\t\t\t\tedge &e = G[v][i];\n\t\t\t\tif(e.cap>0 && dist[e.to]>dist[v]+e.cost+pot[v]-pot[e.to]){\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\n\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tpq.push(pll(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// check fesibility\n\t\tif(!feasibility_flag) return -1;\n\n\t\tfor(auto itr=D.begin();itr!=D.end();itr++)\n\n\t\t// update potential\n\t\tfor(int i=0;i<V;i++) pot[i] += (visited[i] ? dist[i] : dist[t]);\n\n\t\t// get flow amount\n\t\tll f = min(E[s], -D[t]);\n\t\tll d = f;\n\t\tfor(int v=t;v!=s;v=prevv[v]){\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\n\t\t// update excess and deficit\n\t\tE[s] -= d;\n\t\tif(E[s]==0) E.erase(s);\n\t\tD[t] += d;\n\t\tif(D[t]==0) D.erase(t);\n\n\t\t// update total cost\n\t\ttotal_cost += pot[t]*d;\n\n\t\t// update residual graph\n\t\tfor(int v=t;v!=s;v=prevv[v]){\n\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn total_cost;\n}\n\nint main(){\n\tll V, E, F;\n\tcin >> V >> E >> F;\n\tgraph G(V);\n\tREP(i, E){\n\t\tll u, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\t\tadd_edge(G, u, v, c, d);\n\t}\n\tvector<ll> excess(V, 0);\n\texcess[0] = F;\n\texcess[V-1] = -F;\n\tll res = SSC(G, excess);\n\tcout << res << endl;\n return 0;\n}\n", "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\nimport java.math.BigInteger;\n \npublic class Main implements Runnable {\n\t\n\tstatic int mod = 1000000007;\n\t\n public static void main(String[] args) {\n \tnew Thread(null, new Main(), \"\", 1024 * 1024 * 1024).start();\n }\n \n public void run() {\n FastScanner sc = new FastScanner();\n \n int V = sc.nextInt();\n int E = sc.nextInt();\n int f = sc.nextInt();\n \n CostedFlowGraph g = new CostedFlowGraph(V);\n \n for(int i=0;i<E;i++){\n \tg.addEdge(sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt());\n }\n \n System.out.println(g.minCostFlow(0, V-1, f));\n }\n \n}\n\nclass CostedFlowGraph {\n\tint V;\n\tCFEdgeList[] elist;\n\tint[] h;\n\tint[] dd;\n\tint[] preV;\n\tint[] preEid;\n\t\n\tpublic CostedFlowGraph(int V){\n\t\telist = new CFEdgeList[V];\n\t\tfor(int i=0;i<V;i++){\n\t\t\telist[i] = new CFEdgeList();\n\t\t}\n\t\tthis.V = V;\n\t\th = new int[V];\t//その頂点までにかかる費用の合計の最小値\n\t\tdd = new int[V];\n\t\tpreV = new int[V];\n\t\tpreEid = new int[V];\n\t}\n\t\n\tvoid addEdge(int from, int to, int cap, int d){\n\t\tCFEdge e = new CFEdge(to,cap,d);\n\t\tCFEdge rev = new CFEdge(from,0,-d);\n\t\te.setRevEdge(rev);\n\t\trev.setRevEdge(e);\n\t\telist[from].add(e);\n\t\telist[to].add(rev);\n\t}\n\t\n\t//流量fのフローを流すための最小コストをDijkstraを用いた最短路反復で返す。不可能なら-1。\n\tint minCostFlow(int s, int t, int f){\n\t\tPriorityQueue<Node> q = new PriorityQueue<>();\n\t\tint cost = 0;\n\t\twhile(f>0){\n\t\t\tArrays.fill(dd, Integer.MAX_VALUE);\n\t\t\tdd[s] = 0;\n\t\t\tq.clear();\n\t\t\tq.add(new Node(s,0));\n\t\t\t\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tNode now = q.poll();\n\t\t\t\tif(dd[now.v] < now.d){\t//既に展開済み\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor(int i=0;i<elist[now.v].size();i++){\n\t\t\t\t\tCFEdge e = elist[now.v].get(i);\n\t\t\t\t\tint ddash = e.d + now.d + h[now.v] - h[e.to];\n\t\t\t\t\tif(e.res() >0 && ddash < dd[e.to]){\n\t\t\t\t\t\tpreV[e.to] = now.v;\n\t\t\t\t\t\tpreEid[e.to] = i;\n\t\t\t\t\t\tdd[e.to] = ddash;\n\t\t\t\t\t\tq.add(new Node(e.to, ddash));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(dd[t] == Integer.MAX_VALUE){\t//不可能\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int i=0;i<V;i++){\n\t\t\t\th[i] += dd[i];\n\t\t\t}\n\t\t\tint minf = f;\n\t\t\tfor(int i=t;i!=s;i=preV[i]){\n\t\t\t\tminf = Math.min(minf, elist[preV[i]].get(preEid[i]).res());\n\t\t\t}\n\t\t\tcost += minf * h[t];\n\t\t\tf -= minf;\n\t\t\tfor(int i=t; i!=s; i=preV[i]){\n\t\t\t\telist[preV[i]].get(preEid[i]).f += minf;\n\t\t\t\telist[preV[i]].get(preEid[i]).rev.f -= minf;\n\t\t\t}\n\t\t}\n\t\tif(f>0){\t//不可能\n\t\t\tcost = -1;\n\t\t}\n\t\treturn cost;\n\t}\n\t\n\t//for Dijkstra\n\tclass Node implements Comparable<Node>{\n\t\tint v;\n\t\tint d;\n\t\tpublic Node(int v, int d){\n\t\t\tthis.v = v;\n\t\t\tthis.d = d;\n\t\t}\n\t\t@Override\n\t\tpublic int compareTo(Node o){\n\t\t\treturn Integer.compare(d, o.d);\n\t\t}\n\t}\n\t\n\tpublic class CFEdgeList extends ArrayList<CFEdge>{\n\t\tprivate static final long serialVersionUID = 8880792963612434406L;\n\t}\n\tpublic class CFEdge{\n\t\tpublic int to;\n\t\tpublic int cap;\t//容量\n\t\tpublic int d;\t//コスト\n\t\tpublic int f;\t//流量\n\t\tpublic CFEdge rev;\n\t\t\n\t\tpublic CFEdge(int to, int cap, int d){\n\t\t\tthis.to = to;\n\t\t\tthis.cap = cap;\n\t\t\tthis.d = d;\n\t\t\tthis.f = 0;\n\t\t}\n\t\t\n\t\tpublic void setRevEdge(CFEdge e){\n\t\t\tthis.rev = e;\n\t\t}\n\t\t\n\t\t//残余グラフで流せる量\n\t\tint res(){\n\t\t\treturn cap - f;\n\t\t}\n\t\t\n\t}\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\tpublic int[] nextintArray(int n){\n\t\tint[] a = new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\ta[i] = nextInt();\n\t\t}\n\t\treturn a;\n\t}\n\tpublic long[] nextlongArray(int n){\n\t\tlong[] a = new long[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\ta[i] = nextLong();\n\t\t}\n\t\treturn a;\n\t}\n\tpublic Integer[] nextIntegerArray(int n){\n\t\tInteger[] a = new Integer[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\ta[i] = nextInt();\n\t\t}\n\t\treturn a;\n\t}\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,j,k) for(int i = (int)j;i <= (int)k;i ++)\n#define debug(x) cerr<<#x<<\":\"<<x<<endl\n\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100\n\n\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_cost,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\tcost = arg_cost;\n\t\trev_index = arg_rev_index;\n\t}\n\n\tint to,capacity,cost,rev_index;\n};\n\nint V;\nvector<Edge> G[NUM];\nint dist[NUM];\nint pre_node[NUM],pre_edge[NUM];\n\n\nvoid add_edge(int from,int to,int capacity,int cost){\n\tG[from].push_back(Edge(to,capacity,cost,G[to].size()));\n\tG[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n}\n\nint min_cost_flow(int source,int sink,int flow){\n\tint ret = 0;\n\twhile(flow > 0){\n\n\t\tfor(int i = 0; i < V; i++)dist[i] = BIG_NUM;\n\t\tdist[source] = 0;\n\t\tbool update = true;\n\t\twhile(update){\n\t\t\tupdate = false;\n\t\t\tfor(int node_id = 0; node_id < V; node_id++){\n\t\t\t\tif(dist[node_id] == BIG_NUM)continue;\n\t\t\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\t\t\tEdge &e = G[node_id][i];\n\t\t\t\t\tif(e.capacity > 0 && dist[e.to] > dist[node_id]+e.cost){\n\t\t\t\t\t\tdist[e.to] = dist[node_id]+e.cost;\n\t\t\t\t\t\tpre_node[e.to] = node_id;\n\t\t\t\t\t\tpre_edge[e.to] = i;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(dist[sink] == BIG_NUM){\n\t\t\treturn -1;\n\t\t}\n\n\t\tint tmp_flow = flow;\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\ttmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\n\t\t}\n\t\tflow -= tmp_flow;\n\t\tret += tmp_flow*dist[sink];\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\tEdge &e = G[pre_node[node_id]][pre_edge[node_id]];\n\t\t\te.capacity -= tmp_flow;\n\t\t\tG[node_id][e.rev_index].capacity += tmp_flow;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main(){\n\n\tint E,F;\n\tscanf(\"%d %d %d\",&V,&E,&F);\n\n\tint from,to,capacity,cost;\n\tfor(int loop = 0; loop < E; loop++){\n\t\tscanf(\"%d %d %d %d\",&from,&to,&capacity,&cost);\n\t\tadd_edge(from,to,capacity,cost);\n\t}\n\n\tprintf(\"%d\\n\", min_cost_flow(0,V-1,F));\n\n\treturn 0;\n}\n\n", "// AOJ GRL_6_B: Network Flow - Minimum Cost Flow\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing Pi = pair<int, int>;\nusing Pl = pair<ll, ll>;\nusing Ti = tuple<int, int, int>;\nusing Tl = tuple<ll, ll, ll>;\n\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define F first\n#define S second\n#define Get(t, i) get<(i)>((t))\n#define all(v) (v).begin(), (v).end()\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\n#define each(a, b) for(auto& a : b)\n\nconst int inf = 1 << 25;\nconst ll INF = 1LL << 55;\n\nstruct edge\n{\n int to, capacity, cost, rev;\n edge(){}\n edge(int to, int capacity, int cost, int rev):to(to), capacity(capacity), cost(cost), rev(rev){}\n};\n\nstruct PrimalDual\n{\n vector< vector<edge> > graph;\n vector<int> potential, mincost, prevv, preve;\n PrimalDual(int V):graph(V), potential(V), mincost(V), prevv(V), preve(V){}\n void add_edge(int from, int to, int capacity, int cost)\n {\n graph[from].push_back(edge(to, capacity, cost, (int)graph[to].size()));\n graph[to].push_back(edge(from, 0, -cost, (int)graph[from].size()-1));\n }\n int min_cost_flow(int source, int sink, int f)\n {\n int ret = 0;\n fill(potential.begin(), potential.end(), 0);\n fill(prevv.begin(), prevv.end(), -1);\n fill(preve.begin(), preve.end(), -1);\n\n while(f > 0) {\n priority_queue<Pi, vector<Pi>, greater<Pi> > que;\n fill(mincost.begin(), mincost.end(), inf);\n mincost[source] = 0;\n que.push(Pi(0, source));\n while(!que.empty()) {\n\tPi p = que.top(); que.pop();\n\tint v = p.second;\n\tif(mincost[v] < p.first) continue;\n\tfor(int i = 0; i < (int)graph[v].size(); i++) {\n\t edge& e = graph[v][i];\n\t int dual_cost = mincost[v] + e.cost + potential[v] - potential[e.to];\n\t if(e.capacity > 0 && dual_cost < mincost[e.to]) {\n\t mincost[e.to] = dual_cost;\n\t prevv[e.to] = v; preve[e.to] = i;\n\t que.push(Pi(mincost[e.to], e.to));\n\t }\n\t}\n }\n\n if(mincost[sink] == inf) return -1;\n for(int v = 0; v < (int)graph.size(); v++) potential[v] += mincost[v];\n int d = f;\n for(int v = sink; v != source; v = prevv[v]) d = min(d, graph[prevv[v]][preve[v]].capacity);\n f -= d;\n ret += d * potential[sink];\n for(int v = sink; v != source; v = prevv[v]) {\n\tedge& e = graph[prevv[v]][preve[v]];\n\te.capacity -= d;\n\tgraph[v][e.rev].capacity += d;\n }\n }\n return ret;\n }\n};\n\n\nint main()\n{\n int V, E, F;\n cin >> V >> E >> F;\n PrimalDual mnf(V);\n while(E--) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n mnf.add_edge(u, v, c, d);\n }\n cout << mnf.min_cost_flow(0, V-1, F) << endl;\n return 0;\n}", "#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\nusing Weight=long long;\nstatic const Weight INF=1LL<<57;\n\ntemplate <class T>\nusing gp_queue=priority_queue<T, deque<T>, less<T>>;\n\nstruct Arc {\n // accessible to the reverse edge\n size_t src, dst;\n Weight capacity, cost, flow;\n size_t rev;\n Arc() {}\n Arc(size_t src, size_t dst, Weight capacity, Weight cost=0):\n src(src), dst(dst), capacity(capacity), cost(cost), flow(0), rev(-1)\n {}\n Weight residue() const {\n return capacity - flow;\n }\n};\n\nbool operator<(const Arc &e, const Arc &f) {\n if (e.cost != f.cost) {\n return e.cost > f.cost;\n } else if (e.capacity != f.capacity) {\n return e.capacity > f.capacity;\n } else {\n return e.src!=f.src? e.src<f.src : e.dst<f.dst;\n }\n}\n\nusing Arcs=vector<Arc>;\nusing Node=vector<Arc>;\nusing FlowNetwork=vector<Node>;\n\nvoid connect(FlowNetwork &g, size_t s, size_t d, Weight c=1, Weight k=0) {\n g[s].push_back(Arc(s, d, c, k));\n g[d].push_back(Arc(d, s, 0, -k));\n\n g[s].back().rev = g[d].size()-1;\n g[d].back().rev = g[s].size()-1;\n}\n\nvoid join(FlowNetwork &g, size_t s, size_t d, Weight c=1, Weight k=0) {\n g[s].push_back(Arc(s, d, c, k));\n g[d].push_back(Arc(d, s, c, k));\n\n g[s].back().rev = g[d].size()-1;\n g[d].back().rev = g[s].size()-1;\n}\n\nWeight mincost_flow(FlowNetwork &g, size_t s, size_t t, Weight F=INF) {\n size_t V=g.size();\n vector<Arc *> prev(V, NULL);\n\n Weight mcost=0;\n while (F > 0) {\n vector<Weight> d(V, INF); d[s]=0;\n for (bool updated=true; updated;) {\n updated = false;\n for (size_t v=0; v<V; ++v) {\n if (d[v] == INF) continue;\n\n for (Arc &e: g[v]) {\n if (e.capacity <= 0) continue;\n\n if (d[e.dst] > d[e.src] + e.cost) {\n d[e.dst] = d[e.src] + e.cost;\n prev[e.dst] = &e;\n updated = true;\n }\n }\n }\n }\n\n if (d[t] == INF)\n return -1;\n\n Weight f=F;\n for (Arc *e=prev[t]; e!=NULL; e=prev[e->src])\n f = min(f, e->capacity);\n\n F -= f;\n mcost += f * d[t];\n for (Arc *e=prev[t]; e!=NULL; e=prev[e->src]) {\n e->capacity -= f;\n g[e->dst][e->rev].capacity += f;\n }\n }\n\n return mcost;\n}\n\nint main() {\n size_t V, E;\n Weight F;\n scanf(\"%zu %zu %lld\", &V, &E, &F);\n\n FlowNetwork g(V);\n for (size_t i=0; i<E; ++i) {\n size_t u, v;\n Weight c, d;\n scanf(\"%zu %zu %lld %lld\", &u, &v, &c, &d);\n\n connect(g, u, v, c, d);\n }\n\n printf(\"%lld\\n\", mincost_flow(g, 0, V-1, F));\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T, typename U>\nstruct min_cost_flow_graph {\n\t\n\tstruct edge {\n\t\tint from, to;\n\t\tT cap, f;\n\t\tU cost;\n\t};\n\t\n\tvector<edge> edges;\n\tvector<vector<int>> g;\n\tint n, st, fin;\n\tT required_flow, flow;\n\tU cost;\n\t\n\tmin_cost_flow_graph(int n, int st, int fin, T required_flow)\n\t\t: n(n), st(st), fin(fin), required_flow(required_flow) {\n\t\t\tassert(0 <= st && st < n && 0 <= fin && fin < n && st != fin);\n\t\t\tg.resize(n);\n\t\t\tflow = 0;\n\t\t\tcost = 0;\n\t}\n\t\n\tvoid clear_flow() {\n\t\tfor (const edge &e : edges) {\n\t\t\te.f = 0;\n\t\t}\n\t\tflow = 0;\n\t\tcost = 0;\n\t}\n\t\n\tvoid add(int from, int to, T cap = 1, T rev_cap = 0, U cost = 1) {\n\t\tassert(0 <= from && from < n && 0 <= to && to < n);\n\t\tg[from].emplace_back(edges.size());\n\t\tedges.push_back({from, to, cap, 0, cost});\n\t\tg[to].emplace_back(edges.size());\n\t\tedges.push_back({to, from, rev_cap, 0, -cost});\n\t}\n\t\n\tU min_cost_flow() {\n\t\tvector<U> h(n, 0);\n\t\twhile (flow < required_flow) {\n\t\t\tvector<int> preve(n);\n\t\t\tvector<U> dist(n, numeric_limits<U>::max() / 2);\n\t\t\tpriority_queue<pair<U, int>, vector<pair<U, int>>, greater<pair<U, int>>> pq;\n\t\t\tdist[st] = 0;\n\t\t\tpq.emplace(dist[st], st);\n\t\t\twhile (!pq.empty()) {\n\t\t\t\tU expected = pq.top().first;\n\t\t\t\tint i = pq.top().second;\n\t\t\t\tpq.pop();\n\t\t\t\tif (expected != dist[i]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int id : g[i]) {\n\t\t\t\t\tconst edge &e = edges[id];\n\t\t\t\t\tif (0 < e.cap - e.f && dist[e.from] + e.cost + h[e.from] - h[e.to] < dist[e.to]) {\n\t\t\t\t\t\tdist[e.to] = dist[e.from] + e.cost + h[e.from] - h[e.to];\n\t\t\t\t\t\tpreve[e.to] = id;\n\t\t\t\t\t\tpq.emplace(dist[e.to], e.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[fin] == numeric_limits<U>::max() / 2) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\th[i] += dist[i];\n\t\t\t}\n\t\t\tT d = required_flow - flow;\n\t\t\tfor (int v = fin; v != st; v = edges[preve[v]].from) {\n\t\t\t\td = min(d, edges[preve[v]].cap - edges[preve[v]].f);\n\t\t\t}\n\t\t\tflow += d;\n\t\t\tcost += d * h[fin];\n\t\t\tfor (int v = fin; v != st; v = edges[preve[v]].from) {\n\t\t\t\tedges[preve[v]].f += d;\n\t\t\t\tedges[preve[v] ^ 1].f -= d;\n\t\t\t}\n\t\t}\n\t\treturn cost;\n\t}\n};\n\nint main() {\n\tint n, m, f;\n\tcin >> n >> m >> f;\n\tmin_cost_flow_graph<int, int> g(n, 0, n - 1, f);\n\tfor (int i = 0; i < m; i++) {\n\t\tint from, to, cap, cost;\n\t\tcin >> from >> to >> cap >> cost;\n\t\tg.add(from, to, cap, 0, cost);\n\t}\n\tcout << g.min_cost_flow() << endl;\n\treturn 0;\n}", "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\nnamespace Flow {\n struct Edge {\n int to, capacity, cost, reverse;\n Edge(int to, int capacity, int cost, int reverse) :\n to(to), capacity(capacity), cost(cost), reverse(reverse) {}\n };\n template <int MaxN> class PrimalDual {\n int n = MaxN;\n vector<Edge> g[MaxN];\n public:\n void clear(int n) {\n this->n = n;\n for (int i = 0; i < n; ++i)\n g[i].clear();\n }\n void push(int from, int to, int capacity = 1, int cost = 0) {\n g[from].emplace_back(to, capacity, cost, g[to].size());\n g[to].emplace_back(from, 0, -cost, g[from].size() - 1);\n }\n pair<int, int> flow(int s, int t, int f = 1 << 30) {\n int flow = f, cost = 0;\n static int prevv[MaxN], preve[MaxN], dist[MaxN], h[MaxN];\n fill(h, h + n, 0);\n while (flow > 0) {\n fill(dist, dist + n, 1 << 30);\n dist[s] = 0;\n using P = pair<int, int>;\n priority_queue<P, vector<P>, greater<P>> q;\n for (q.emplace(0, s); q.size(); ) {\n auto p = q.top();\n q.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (auto& e : g[v]) {\n int d = dist[v] + e.cost + h[v] - h[e.to];\n if (e.capacity > 0 && dist[e.to] > d) {\n dist[e.to] = d;\n prevv[e.to] = v;\n preve[e.to] = &e - &g[v][0];\n q.emplace(d, e.to);\n }\n }\n }\n if (dist[t] == 1 << 30) break;\n for (int v = 0; v < n; ++v)\n h[v] += dist[v];\n int d = flow;\n for (int v = t; v != s; v = prevv[v])\n d = min(d, g[prevv[v]][preve[v]].capacity);\n flow -= d;\n cost += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n auto& e = g[prevv[v]][preve[v]];\n e.capacity -= d;\n g[v][e.reverse].capacity += d;\n }\n }\n return { f - flow, cost };\n }\n };\n}\n\nint main() {\n int n, m, f;\n cin >> n >> m >> f;\n Flow::PrimalDual<100> pd;\n pd.clear(n);\n for (int i = 0; i < m; ++i) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n pd.push(a, b, c, d);\n }\n auto p = pd.flow(0, n - 1, f);\n cout << (p.first == f ? p.second : -1) << endl;\n return 0;\n}", "//最短経路長が短い経路に流せるだけ流す。\n//ただし、順辺のコストをcとしたときに逆辺のコストは-cにする (フローを押し戻すとき、コストも押し戻すため）。\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nconst int VMAX = 100;\nstruct Edge {\n\tint from, to, flow, cost, rev;\n\tEdge(int from, int to, int flow, int cost, int rev) {\n\t\tthis->from = from;\n\t\tthis->to = to;\n\t\tthis->flow = flow;\n\t\tthis->cost = cost;\n\t\tthis->rev = rev;\n\t}\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, int from, int to, int flow, int cost) {\n\tg[from].push_back(Edge(from, to, flow, cost, g[to].size()));\n\tg[to].push_back(Edge(to, from, 0, -cost, g[from].size() - 1));\n}\n\nint dfs(Graph &g, int s, int t, int flow, bool yet[], int level[]) {\n\tyet[s] = false;\n\tif (s == t) return flow;\n\tfor (int i = 0; i < g[s].size(); i++) {\n\t\tint v = g[s][i].to;\n\t\tif (g[s][i].flow > 0 && yet[v] && level[v] == level[s] + g[s][i].cost) {\n\t\t\tint res = dfs(g, v, t, min(flow, g[s][i].flow), yet, level);\n\t\t\tif (res > 0) {\n\t\t\t\tint r = g[s][i].rev;\n\t\t\t\tg[s][i].flow -= res;\n\t\t\t\tg[v][r].flow += res;\n\t\t\t\treturn res;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nint minCostflow(Graph &g, int s, int t, int flow) {\n\tconst int INF_DIST = 11451419;\n\tconst int INF_FLOW = 11451419;\n\tconst int ERROR_RETURN = -1;\n\tint level[VMAX];\n\tbool yet[VMAX];\n\tqueue<int> que;\n\tint i;\n\tint ret = 0;\n\t\n\twhile (true) {\n\t\tfor (i = 0; i < g.size(); i++) level[i] = INF_DIST;\n\t\tque.push(s); level[s] = 0;\n\t\twhile (!que.empty()) {\n\t\t\tint v = que.front(); que.pop();\n\t\t\tfor (i = 0; i < g[v].size(); i++) {\n\t\t\t\tint nv = g[v][i].to;\n\t\t\t\tif (g[v][i].flow > 0 && level[nv] > level[v] + g[v][i].cost) {\n\t\t\t\t\tlevel[nv] = level[v] + g[v][i].cost;\n\t\t\t\t\tque.push(nv);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (level[t] >= INF_DIST) break;\n\t\t\n\t\twhile (true) {\n\t\t\tfor (i = 0; i < g.size(); i++) yet[i] = true;\n\t\t\tint f = dfs(g, s, t, INF_FLOW, yet, level);\n\t\t\tif (f == 0) break;\n\t\t\tflow -= f;\n\t\t\tret += f * level[t];\n\t\t\tif (flow <= 0) {\n\t\t\t\tret += flow * level[t];\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\nint n, m, f;\nint u, v, c, d;\nGraph g;\n\nint main() {\n\tcin >> n >> m >> f;\n\tg.resize(n);\n\tfor (int i = 0; i < m; i++) {\n\t\tcin >> u >> v >> c >> d;\n\t\tadd_edge(g, u, v, c, d);\n\t}\n\tcout << minCostflow(g, 0, n - 1, f) << endl;\n\treturn 0;\n}\n", "#include<bits/stdc++.h>\nusing namespace std;\nstruct PrimalDual{\n const int INF = 1<<28;\n typedef pair<int,int> P;\n struct edge{\n int to,cap,cost,rev;\n edge(){}\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n };\n\n int V;\n vector<vector<edge> > G;\n vector<int> h,dist,prevv,preve;\n\n PrimalDual(){}\n PrimalDual(int V):V(V){init();}\n\n void init(){\n for(int i=0;i<(int)G.size();i++) G[i].clear();\n G.clear();\n h.clear();\n dist.clear();\n prevv.clear();\n preve.clear();\n G.resize(V);\n h.resize(V);\n dist.resize(V);\n prevv.resize(V);\n preve.resize(V);\n }\n \n void add_edge(int from,int to,int cap,int cost){\n G[from].push_back(edge(to,cap,cost,G[to].size()));\n G[to].push_back(edge(from,0,-cost,G[from].size()-1));\n }\n\n int min_cost_flow(int s,int t,int f){\n int res=0;\n fill(h.begin(),h.begin()+V,0);\n while(f>0){\n priority_queue<P,vector<P>,greater<P> > que;\n fill(dist.begin(),dist.begin()+V,INF);\n dist[s]=0;\n que.push(P(0,s));\n while(!que.empty()){\n\tP p=que.top();que.pop();\n\tint v=p.second;\n\tif(dist[v]<p.first) continue;\n\tfor(int i=0;i<(int)G[v].size();i++){\n\t edge &e=G[v][i];\n\t if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n\t dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\t prevv[e.to]=v;\n\t preve[e.to]=i;\n\t que.push(P(dist[e.to],e.to));\n\t }\n\t}\n }\n if(dist[t]==INF){\n\treturn -1;\n }\n for(int v=0;v<V;v++) h[v]+=dist[v];\n\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n\td=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n\tedge &e=G[prevv[v]][preve[v]];\n\te.cap-=d;\n\tG[v][e.rev].cap+=d;\n }\n }\n return res;\n }\n};\nint main(){\n int v,e,f;\n cin>>v>>e>>f;\n PrimalDual pd(v);\n for(int i=0;i<e;i++){\n int u,v,c,d;\n cin>>u>>v>>c>>d;\n pd.add_edge(u,v,c,d);\n }\n cout<<pd.min_cost_flow(0,v-1,f)<<endl;\n return 0;\n}\n/*\nverified on 2017/06/29\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B\n*/", "#include <iostream>\n#include <vector>\n#include <numeric>\n#include <queue>\n#include <algorithm>\n#include <utility>\n#include <functional>\nusing namespace std;\n\n//template<typename Int = int>\nusing Int = int;\nstruct PrimalDual {\n struct Edge {\n int dst;\n Int cap, flow, cost;\n int rev;\n bool isRev;\n Edge(int dst, Int cap, Int flow, Int cost, int rev, bool isRev)\n :dst(dst), cap(cap), flow(flow), cost(cost), rev(rev), isRev(isRev) {\n }\n };\n\n int n;\n vector<vector<Edge>> g;\n PrimalDual(int n_) : n(n_), g(vector<vector<Edge>>(n_)) {}\n void addEdge(int src, int dst, Int cap, Int cost) {\n g[src].emplace_back(dst, cap, 0, cost, g[dst].size(), false);\n g[dst].emplace_back(src, cap, cap, -cost, g[src].size() - 1, true);\n }\n\n vector<Int> h, dist;\n vector<int> prevv, preve;\n Int solve(int s, int t, Int f) {\n Int res = 0;\n h.assign(n, 0);\n dist.assign(n, 0);\n prevv.assign(n, 0);\n preve.assign(n, 0);\n while (f > 0) {\n if (!dijkstra(s,t)) return -1;\n for (int i = 0; i < n; ++i) h[i] += dist[i];\n Int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = g[prevv[v]][preve[v]];\n d = min(d, residue(e));\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = g[prevv[v]][preve[v]];\n e.flow += d;\n g[v][e.rev].flow -= d;\n }\n }\n return res;\n }\n\n bool dijkstra(int s, int t) {\n constexpr Int INF = numeric_limits<Int>::max();\n dist.assign(n, INF);\n dist[s] = 0;\n priority_queue<pair<Int, int>> q;\n fill(dist.begin(), dist.end(), INF);\n dist[s] = 0;\n q.emplace(0, s);\n while (q.size()) {\n int d, v;\n tie(d, v) = q.top();\n q.pop();\n d = -d;\n if (dist[v] < d) continue;\n for (int i = 0; i < (int)g[v].size(); ++i) {\n Edge &e = g[v][i];\n if (residue(e) > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst]) {\n dist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];\n prevv[e.dst] = v;\n preve[e.dst] = i;\n q.emplace(-dist[e.dst], e.dst);\n }\n }\n }\n return dist[t] != INF;\n }\n\n Int residue(const Edge& e) { return e.cap - e.flow; }\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n int n, m, f;\n cin >> n >> m >> f;\n PrimalDual pd(n);\n for (int i = 0; i < m; i++) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n pd.addEdge(u, v, c, d);\n }\n cout << pd.solve(0, n - 1, f) << endl;\n}", "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\ntemplate<typename F,typename C>\nstruct MinCostFlow{\n struct Edge{\n int to;\n F cap;\n C cost;\n int rev;\n };\n const C INF;\n vector<vector<Edge>> v;\n vector<C> pot,dist;\n vector<int> prevv,preve;\n\n MinCostFlow(int n):v(n),INF(numeric_limits<C>::max()){}\n\n void add_edge(int from,int to,F cap,C cost){\n v[from].emplace_back((Edge){to,cap,cost,(int)v[to].size()});\n v[to].emplace_back((Edge){from,0,-cost,(int)v[from].size()-1});\n }\n\n C min_cost_flow(int s,int t,F f){\n int n=v.size();\n C ret=0;\n using P = pair<C,int>;\n priority_queue<P,vector<P>,greater<P>> que;\n pot.assign(n, 0);\n prevv.assign(n, -1);\n preve.assign(n, -1);\n\n while(f>0){\n dist.assign(n, INF);\n que.emplace(0,s);\n dist[s]=0;\n while(!que.empty()){\n int cur=que.top().second;\n C d=que.top().first;\n que.pop();\n if(dist[cur]<d)continue;\n rep(i,v[cur].size()){\n Edge &e = v[cur][i];\n C next_cost = dist[cur]+e.cost+pot[cur]-pot[e.to];\n if(e.cap>0 && dist[e.to]>next_cost){\n dist[e.to]=next_cost;\n prevv[e.to]=cur;\n preve[e.to]=i;\n que.emplace(dist[e.to],e.to);\n }\n }\n }\n if(dist[t]==INF)return -1;\n rep(i,n)pot[i]+=dist[i];\n F add_flow = f;\n for(int u=t;u!=s;u=prevv[u]){\n add_flow=min(add_flow,v[prevv[u]][preve[u]].cap);\n }\n f-=add_flow;\n ret+=add_flow*pot[t];\n for(int u=t;u!=s;u=prevv[u]){\n Edge& e=v[prevv[u]][preve[u]];\n e.cap -=add_flow;\n v[e.to][e.rev].cap += add_flow;\n }\n }\n return ret;\n }\n};\n\nint main(){\n int n,m,f;\n cin>>n>>m>>f;\n MinCostFlow<int,int> mcf(n);\n rep(i,m){\n int a,b,c,d;\n cin>>a>>b>>c>>d;\n mcf.add_edge(a, b, c, d);\n } \n cout<<mcf.min_cost_flow(0, n-1, f)<<endl;\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing Int = int64_t;\nusing UInt = uint64_t;\nusing C = std::complex<double>;\n#define rep(i, n) for(Int i = 0; i < (Int)(n); ++i)\n#define rep2(i, l, r) for(Int i = (Int)(l); i < (Int)(r); ++i)\n#define guard(x) if( not (x) ) continue;\n#ifndef LOCAL_\n#define fprintf if( false ) fprintf\n#endif\n\ntemplate<typename T>\nusing RQ = std::priority_queue<T, std::vector<T>, std::greater<T>>;\n\nint main() {\n Int v, e, f;\n std::cin >> v >> e >> f;\n std::vector<Int> ss(e+1), ts(e+1), cs(e+1), fs(e+1), bs(e+1);\n rep2(i,1,e+1) {\n Int a, b, c, d;\n std::cin >> a >> b >> c >> d;\n ss[i] = a, ts[i] = b, cs[i] = d, fs[i] = 0, bs[i] = c;\n }\n std::vector<std::vector<Int>> es(v);\n rep2(i,1,e+1) {\n Int s = ss[i], t = ts[i];\n es[s].emplace_back(i);\n es[t].emplace_back(-i);\n }\n Int res = 0;\n Int source = 0, sink = v-1;\n std::vector<Int> hs(v);\n while( f > 0 ) {\n RQ<std::pair<Int,Int>> q;\n q.emplace(0, source);\n std::vector<Int> ps(v, -1), xs(v, -1), ys(v);\n xs[source] = 0;\n ys[source] = f;\n std::vector<bool> visited(v);\n while( not q.empty() ) {\n Int d, s; std::tie(d, s) = q.top(); q.pop();\n guard( d == xs[s] );\n assert( not visited[s] );\n visited[s] = true;\n for(Int i : es[s]) {\n Int k = std::abs(i);\n Int t = i > 0 ? ts[k] : ss[k];\n Int tf = i > 0 ? bs[k] : fs[k];\n guard( tf > 0 );\n Int nd = d + (i>0?cs[k]:-cs[k]) + hs[s] - hs[t];\n guard( xs[t] == -1 or xs[t] > nd );\n assert( nd >= 0 );\n xs[t] = nd;\n ps[t] = i;\n ys[t] = std::min(ys[s], tf);\n assert( not visited[t] );\n q.emplace(nd, t);\n }\n }\n Int tf = ys[sink];\n fprintf(stderr, \"tf = %ld\\n\", tf);\n f -= tf;\n if( f > 0 and tf == 0 ) {\n res = -1;\n break;\n }\n rep(i, v) hs[i] += xs[i];\n for(Int i=sink, k=ps[i]; i!=source; i=(k>0?ss[k]:ts[-k]), k=ps[i]) {\n Int ak = std::abs(k);\n fprintf(stderr, \"i=%ld, k=%ld\\n\", i, k);\n if( k > 0 ) {\n fs[ak] += tf;\n bs[ak] -= tf;\n }\n else {\n fs[ak] -= tf;\n bs[ak] += tf;\n }\n }\n res += tf * hs[sink];\n if( f == 0 ) break;\n rep2(i,1,e+1) {\n fprintf(stderr, \"%ld -> %ld : cost=%ld : ->=%ld : <-=%ld\\n\", ss[i], ts[i], cs[i], fs[i], bs[i]);\n }\n }\n printf(\"%ld\\n\", res);\n}\n\n", "from typing import List, Iterator, Optional, Tuple\n\n\ndef trace_back(sink: int,\n predecessors: List[Optional[Tuple[int, int]]]) -> Iterator[List[int]]:\n p = predecessors[sink]\n while p is not None:\n v, i = p\n yield edges[v][i]\n p = predecessors[v]\n\n\ndef min_cost_flow(source: int, sink: int, required_flow: int) -> int:\n res = 0\n while required_flow:\n dist = [float('inf')] * n\n dist[source] = 0\n predecessors: List[Optional[Tuple[int, int]]] = [None] * n\n\n while True:\n updated = False\n for v in range(n):\n if dist[v] == float('inf'):\n continue\n for i, (remain, target, cost, _) in enumerate(edges[v]):\n new_dist = dist[v] + cost\n if remain and dist[target] > new_dist:\n dist[target] = new_dist\n predecessors[target] = (v, i)\n updated = True\n if not updated:\n break\n\n if dist[sink] == float('inf'):\n return -1\n\n aug = min(required_flow, min(e[0] for e in trace_back(sink, predecessors)))\n required_flow -= aug\n res += int(aug * dist[sink])\n for e in trace_back(sink, predecessors):\n remain, target, cost, idx = e\n e[0] -= aug\n edges[target][idx][0] += aug\n return res\n\n\nif __name__ == \"__main__\":\n n, m, f = map(int, input().split())\n edges = [[] for _ in range(n)] # type: ignore\n\n for _ in range(m):\n s, t, c, d = map(int, input().split())\n es, et = edges[s], edges[t]\n ls, lt = len(es), len(et)\n es.append([c, t, d, lt])\n et.append([0, s, -d, ls])\n\n print(min_cost_flow(0, n - 1, f))\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for (int i=0;i<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define all(a) (a).begin(),(a).end()\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> vi;\ntypedef vector<P> vp;\ntypedef vector<ll> vll;\n\nconst int INF = 99999999;\nconst int MAX_V = 100000;\n\nstruct edge { int to, cap, cost, rev; };\n\nint V, E, F;\nvector<edge> G[MAX_V];\nint h[MAX_V]; // potential\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V]; // privious vertex, edge\n\nvoid add_edge(int from, int to, int cap, int cost) {\n G[from].emplace_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].emplace_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\n// get min cost flow from s to t\n// if we can flow f, then return -1\nint min_cost_flow(int s, int t, int f) {\n int res = 0;\n fill(h, h + V, 0);\n while (f > 0) {\n // update h by dijkstra\n priority_queue<P, vector<P>, greater<P>> que;\n fill(dist, dist + V, INF);\n dist[s] = 0;\n que.push(P(0, s));\n while (!que.empty()) {\n P p = que.top(); que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n rep(i, G[v].size()) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INF) {\n // no more flow\n return -1;\n }\n rep(v, V) h[v] += dist[v];\n\n // flow as much as possible along the minimum path from s to t\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, (int)G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nsigned main() {\n cin >> V >> E >> F;\n rep(i, E) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n add_edge(u, v, c, d);\n }\n\n cout << min_cost_flow(0, V - 1, F) << endl;\n}", "#include <iostream>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <vector>\n#include <list>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <map>\n#include <set>\n#include <bitset>\n#include <tuple>\n#include <cassert>\n#include <exception>\n#include <iomanip>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll,ll> P;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\n#define rep(i,a,n) for(ll i = (a);i < (n);i++)\n#define per(i,a,n) for(ll i = (a);i > (n);i--)\n#define lep(i,a,n) for(ll i = (a);i <= (n);i++)\n#define pel(i,a,n) for(ll i = (a);i >= (n);i--)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define pb push_back\n#define mp make_pair\n#define all(c) (c).begin(),(c).end()\n#define sz size()\n#define print(X) cout << (X) << endl\n#define fprint(NUM,X) cout << fixed << setprecision(NUM) << (X) << endl\n#define fprints(NUM,X,Y) cout << fixed << setprecision(NUM) << (X) << \" \" << (Y) << endl\nstatic const int INF = 1e+9+7;\nll n,m,l;\nstring s,t;\nll d[200010],dp[1010][1010];\ndouble w[1000],v[1000];\ndouble box[200010];\n\nstruct edge{ int to,cap,cost,rev; };\nstatic const int MAX = 100000;\nint V;\nvector<edge> graph[MAX];\nint dist[MAX];\nint prevv[MAX],preve[MAX];\n\nvoid add_edge(int from,int to,int cap,int cost){\n graph[from].push_back((edge){ to,cap,cost,(int)graph[to].size() });\n graph[to].push_back((edge){ from,0,-cost,(int)graph[from].size()-1 });\n}\n\nint min_cost_flow(int s,int t,int f){\n int res = 0;\n while(f > 0){\n fill(dist,dist + V,INF);\n dist[s] = 0;\n bool update = true;\n while(update){\n update = false;\n for(int v = 0;v < V;v++){\n if(dist[v] == INF)continue;\n for(int i = 0;i < graph[v].size();i++){\n edge &e = graph[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost){\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n if(dist[t] == INF)return -1;\n int d = f;\n for(int v = t;v != s;v = prevv[v]){\n d = min(d,graph[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for(int v = t;v != s;v = prevv[v]){\n edge &e = graph[prevv[v]][preve[v]];\n e.cap -= d;\n graph[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main(){\n cin >> V >> n >> m;\n rep(i,0,n){\n int a,b,c,e;\n cin >> a >> b >> c >> e;\n add_edge(a,b,c,e);\n }\n print(min_cost_flow(0,V-1,m));\n return 0;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T, typename U>\nstruct min_cost_flow_graph {\n\t\n\tstruct edge {\n\t\tint from, to;\n\t\tT cap, f;\n\t\tU cost;\n\t};\n\t\n\tvector<edge> edges;\n\tvector<vector<int>> g;\n\tint n, st, fin;\n\tT required_flow, flow;\n\tU cost;\n\t\n\tmin_cost_flow_graph(int n, int st, int fin, T required_flow)\n\t\t: n(n), st(st), fin(fin), required_flow(required_flow) {\n\t\t\tassert(0 <= st && st < n && 0 <= fin && fin < n && st != fin);\n\t\t\tg.resize(n);\n\t\t\tflow = 0;\n\t\t\tcost = 0;\n\t}\n\t\n\tvoid clear_flow() {\n\t\tfor (const edge &e : edges) {\n\t\t\te.f = 0;\n\t\t}\n\t\tflow = 0;\n\t\tcost = 0;\n\t}\n\t\n\tvoid add(int from, int to, T cap = 1, T rev_cap = 0, U cost = 1) {\n\t\tassert(0 <= from && from < n && 0 <= to && to < n);\n\t\tg[from].emplace_back(edges.size());\n\t\tedges.push_back({from, to, cap, 0, cost});\n\t\tg[to].emplace_back(edges.size());\n\t\tedges.push_back({to, from, rev_cap, 0, -cost});\n\t}\n\t\n\tU min_cost_flow() {\n\t\twhile (flow < required_flow) {\n\t\t\tvector<int> prevv(n), preve(n);\n\t\t\tvector<U> dist(n, numeric_limits<U>::max() / 4);\n\t\t\tdist[st] = 0;\n\t\t\tfor (bool update = true; update; ) {\n\t\t\t\tupdate = false;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tfor (int id : g[i]) {\n\t\t\t\t\t\tconst edge &e = edges[id];\n\t\t\t\t\t\tif (0 < e.cap - e.f && dist[e.from] + e.cost < dist[e.to]) {\n\t\t\t\t\t\t\tdist[e.to] = dist[e.from] + e.cost;\n\t\t\t\t\t\t\tprevv[e.to] = e.from;\n\t\t\t\t\t\t\tpreve[e.to] = id;\n\t\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[fin] == numeric_limits<U>::max() / 4) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tT d = required_flow - flow;\n\t\t\tfor (int v = fin; v != st; v = prevv[v]) {\n\t\t\t\td = min(d, edges[preve[v]].cap - edges[preve[v]].f);\n\t\t\t}\n\t\t\tflow += d;\n\t\t\tcost += d * dist[fin];\n\t\t\tfor (int v = fin; v != st; v = prevv[v]) {\n\t\t\t\tedges[preve[v]].f += d;\n\t\t\t\tedges[preve[v] ^ 1].f -= d;\n\t\t\t}\n\t\t}\n\t\treturn cost;\n\t}\n};\n\nint main() {\n\tint n, m, f;\n\tcin >> n >> m >> f;\n\tmin_cost_flow_graph<int, int> g(n, 0, n - 1, f);\n\tfor (int i = 0; i < m; i++) {\n\t\tint from, to, cap, cost;\n\t\tcin >> from >> to >> cap >> cost;\n\t\tg.add(from, to, cap, 0, cost);\n\t}\n\tcout << g.min_cost_flow() << endl;\n\treturn 0;\n}", "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\n/*\n * 最小費用流\n * O(FVE)\n */\nstruct MinCostFlow{\n const int inf = std::numeric_limits<int>::max()/3;\n struct edge{\n int to,cap,cost,rev;\n edge(){}\n edge(int t,int ca,int co,int r) : to(t),cap(ca),cost(co),rev(r){}\n };\n\n int V; // # of node \n vector<vector<edge>> G;\n MinCostFlow(){}\n MinCostFlow(int V_){ init(V_); }\n\n void init(int V_){\n V = V_;\n G.resize(V);\n }\n\n void add_edge(int from,int to,int cap,int cost){\n G[from].emplace_back(to,cap,cost,G[to].size());\n G[to].emplace_back(from,0,-cost,G[from].size()-1);\n }\n\n // s->tに向かって流量f流すときの最小費用\n // もしs->tに向かってf流せない場合は-1\n int min_cost_flow(int s,int t,int f){\n int res=0;\n vector<int> dist(V,inf);\n vector<int> prevv(V),preve(V);\n while(f>0){\n dist.assign(V,inf);\n dist[s] = 0;\n bool update=true;\n while(update){\n update=false;\n for(int v=0;v<V;v++){\n if(dist[v]==inf) continue;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0 and dist[e.to] > dist[v]+e.cost){\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n\n if(dist[t] == inf) return -1; // 流量fを流すことは不可能\n\n int d = f;\n for(int v=t;v!=s;v=prevv[v]) d = min(d,G[prevv[v]][preve[v]].cap);\n f -= d;\n res += d * dist[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\nint main(){\n int V,E,F; cin >> V >> E >> F;\n MinCostFlow graph(V);\n for(int i=0;i<E;i++){\n int u,v,c,d;\n cin >> u >> v >> c >> d;\n graph.add_edge(u,v,c,d);\n }\n\n cout << graph.min_cost_flow(0,V-1,F) << endl;\n}\n\n", "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << #x << \" = \" << x << endl;\n\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\n/* Minimum Cost Flow */\n\nstruct MinimumCostFlow{\n\n typedef pair<int,int> P;\n \n struct edge {\n int to, cap, cost, rev;\n edge(int a, int b, int c, int d):to(a),cap(b),cost(c),rev(d){}\n };\n \n vector<vector<edge> > G;\n vector<int> h, dist, prevv, preve;\n int V;\n \n MinimumCostFlow(int v):G(v,vector<edge>()),prevv(v,0),preve(v,0),V(v){}\n \n int add_edge(int from,int to,int cap, int cost){\n int id = G[from].size();\n \n G[from].push_back(edge(to,cap,cost,G[to].size()));\n G[to].push_back(edge(from,0,-cost,G[from].size() - 1));\n \n return id;\n }\n\n int solve(int s, int t, int f){\n int res = 0;\n h.assign(V,0);\n while(f > 0){\n priority_queue<P, vector<P>, greater<P> > pq;\n dist.assign(V, INF);\n dist[s] = 0;\n pq.push(P(0, s));\n while(pq.size()){\n P p = pq.top(); pq.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n\n for(int i = 0; i < G[v].size(); i++){\n edge &e = G[v][i];\n int d = dist[v] + e.cost + h[v] - h[e.to];\n if(e.cap > 0 && dist[e.to] > d){\n dist[e.to] = d;\n prevv[e.to] = v;\n preve[e.to] = i;\n pq.push(P(dist[e.to], e.to));\n }\n }\n }\n if(dist[t] == INF) return -1;\n\n for(int v = 0; v < V; v++) h[v] += dist[v];\n\n int d = f;\n for(int v = t; v != s; v = prevv[v])\n d = min(d, G[prevv[v]][preve[v]].cap);\n\n f -= d;\n res += d * h[t];\n\n for(int v = t; v != s; v = prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n\n return res;\n }\n\n};\n\n\nint main(){\n int v,e,f;\n int a,b,c,d;\n \n scanf(\"%d%d%d\",&v,&e,&f);\n\n MinimumCostFlow flow(v);\n \n for(int i=0;i<e;i++){\n scanf(\"%d%d%d%d\",&a,&b,&c,&d);\n\n flow.add_edge(a,b,c,d);\n }\n\n cout << flow.solve(0, v-1, f) << endl;\n \n return 0;\n}", "#include <iostream>\n#include <fstream>\n#include <cassert>\n#include <typeinfo>\n#include <vector>\n#include <stack>\n#include <cmath>\n#include <set>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <cstdio>\n#include <queue>\n#include <iomanip>\n#include <cctype>\n#include <random>\n#include <complex>\n#define syosu(x) fixed<<setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\ntypedef pair<double,double> pdd;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<P,int> pip;\ntypedef vector<pip> vip;\nconst int inf=1<<29;\nconst ll INF=1ll<<50;\nconst double pi=acos(-1);\nconst double eps=1e-8;\nconst ll mod=1e9+7;\nconst int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};\n\nclass Network{\n\tprivate:\n\tint V;\n\tstruct edge{\n\t\tint to,cap,cost,rev;\n\t};\n\tvector<vector<edge> > g;\n\tvi h,d,pv,pe;\n\tpublic:\n\tNetwork(int v){\n\t\tV=v;\n\t\tg=vector<vector<edge> >(v);\n\t}\n\tvoid add_edge(int s,int t,int cap,int cost){\n\t\tg[s].push_back(edge{t,cap,cost,(int)g[t].size()});\n\t\tg[t].push_back(edge{s,0,-cost,(int)g[s].size()-1});\n\t}\n\tint min_cost_flow(int s,int t,int f){\n\t\tint res=0;\n\t\th=pv=pe=vi(V);\n\t\twhile(f>0){\n\t\t\tpriority_queue<P> q;\n\t\t\td=vi(V,inf);\n\t\t\td[s]=0;\n\t\t\tq.push({0,s});\n\t\t\twhile(!q.empty()){\n\t\t\t\tP p=q.top();\n\t\t\t\tq.pop();\n\t\t\t\tint v=p.second;\n\t\t\t\tif(d[v]<-p.first) continue;\n\t\t\t\tfor(int i=0;i<g[v].size();i++){\n\t\t\t\t\tedge &e=g[v][i];\n\t\t\t\t\tif(e.cap>0&&d[e.to]>d[v]+e.cost+h[v]-h[e.to]){\n\t\t\t\t\t\td[e.to]=d[v]+e.cost+h[v]-h[e.to];\n\t\t\t\t\t\tpv[e.to]=v;\n\t\t\t\t\t\tpe[e.to]=i;\n\t\t\t\t\t\tq.push({-d[e.to],e.to});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d[t]==inf) return -1;\n\t\t\tfor(int i=0;i<V;i++) h[i]+=d[i];\n\t\t\tint D=f;\n\t\t\tfor(int i=t;i!=s;i=pv[i]) D=min(D,g[pv[i]][pe[i]].cap);\n\t\t\tf-=D;\n\t\t\tres+=D*h[t];\n\t\t\tfor(int i=t;i!=s;i=pv[i]){\n\t\t\t\tedge &e=g[pv[i]][pe[i]];\n\t\t\t\te.cap-=D;\n\t\t\t\tg[i][e.rev].cap+=D;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\n\nint n,m,f;\n\nint main(){\n\tcin>>n>>m>>f;\n\tNetwork net(n);\n\tfor(int i=0;i<m;i++){\n\t\tint v,u,c,d;\n\t\tcin>>v>>u>>c>>d;\n\t\tnet.add_edge(v,u,c,d);\n\t}\n\tcout<<net.min_cost_flow(0,n-1,f)<<endl;\n}", "#include <iostream>\n#include <vector>\n#include <utility>\n#include <queue>\n#define llint long long\n#define inf 1e18\n\nusing namespace std;\ntypedef pair<llint, llint> P;\n\nstruct edge{\n\tllint to, cap, cost, rev;\n\tedge(){}\n\tedge(llint a, llint b, llint c, llint d){\n\t\tto = a, cap = b, cost = c, rev = d;\n\t}\n};\n\nllint n, m, F;\nllint S, T;\nvector<edge> G[205];\nllint dist[205];\nllint prevv[205], preve[205];\nllint h[205];\n\nvoid BellmanFord()\n{\n\tfor(int i = 0; i <= T; i++) dist[i] = inf;\n\tdist[S] = 0, prevv[S] = -1;\n\t\n\tbool update = true;\n\twhile(update){\n\t\tupdate = false;\n\t\tfor(int i = 0; i <= T; i++){\n\t\t\tfor(int j = 0; j < G[i].size(); j++){\n\t\t\t\tif(G[i][j].cap == 0) continue;\n\t\t\t\tif(dist[G[i][j].to] > dist[i] + G[i][j].cost){\n\t\t\t\t\tdist[G[i][j].to] = dist[i] + G[i][j].cost;\n\t\t\t\t\tprevv[G[i][j].to] = i;\n\t\t\t\t\tpreve[G[i][j].to] = j;\n\t\t\t\t\tupdate = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Dijkstra()\n{\n\tfor(int i = 0; i <= T; i++) dist[i] = inf;\n\tdist[S] = 0, prevv[S] = -1;\n\t\n\tpriority_queue< P, vector<P>, greater<P> > Q;\n\tQ.push( make_pair(0, S) );\n\t\n\tllint v, d;\n\twhile(Q.size()){\n\t\td = Q.top().first;\n\t\tv = Q.top().second;\n\t\tQ.pop();\n\t\tif(dist[v] < d) continue;\n\t\tfor(int i = 0; i < G[v].size(); i++){\n\t\t\tif(G[v][i].cap == 0) continue;\n\t\t\tllint u = G[v][i].to, c = h[v] - h[u] + G[v][i].cost;\n\t\t\tif(dist[u] > d + c){\n\t\t\t\tdist[u] = d + c;\n\t\t\t\tprevv[u] = v;\n\t\t\t\tpreve[u] = i;\n\t\t\t\tQ.push( make_pair(dist[u], u) );\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid add_edge(llint from, llint to, llint cap, llint cost)\n{\n\tG[from].push_back( edge(to, cap, cost, G[to].size()) );\n\tG[to].push_back( edge(from, 0, -cost, G[from].size()-1) );\n}\n\n\nint main()\n{\n\tcin >> n >> m >> F;\n\tllint u, v, c, d;\n\tfor(int i = 1; i <= m; i++){\n\t\tcin >> u >> v >> c >> d;\n\t\tadd_edge(u, v, c, d);\n\t}\n\tS = 0, T = n-1;\n\t\n\tBellmanFord();\n\tfor(int i = 0; i <= T; i++) h[i] = dist[i];\n\t\n\tllint f = F, ans = 0;\n\twhile(f > 0){\n\t\tDijkstra();\n\t\tif(dist[T] >= inf) break;\n\t\t\n\t\tllint p = T, flow = f;\n\t\twhile(prevv[p] != -1){\n\t\t\tflow = min(flow, G[prevv[p]][preve[p]].cap);\n\t\t\tp = prevv[p];\n\t\t}\n\t\t\n\t\tp = T;\n\t\twhile(prevv[p] != -1){\n\t\t\tG[prevv[p]][preve[p]].cap -= flow;\n\t\t\tG[p][G[prevv[p]][preve[p]].rev].cap += flow;\n\t\t\tp = prevv[p];\n\t\t}\n\t\tf -= flow;\n\t\tans += (dist[T] + h[T] - h[S]) * flow;\n\t\t\n\t\tfor(int i = 0; i <= T; i++) h[i] += dist[i];\n\t}\n\t\n\tif(f > 0) ans = -1;\n\tcout << ans << endl;\n\t\n\treturn 0;\n}\n", "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <queue>\n#include <functional>\nusing namespace std;\n\nconst int MAX_V = 100010;\nusing Capacity = int;\nusing Cost = int;\nconst auto inf = numeric_limits<Capacity>::max() / 8;\nstruct Edge {\n\tint dst;\n\tCapacity cap, cap_orig;\n\tCost cost;\n\tint revEdge; bool isRev;\n\tEdge(int dst, Capacity cap, Cost cost, int revEdge, bool isRev)\n\t\t:dst(dst), cap(cap), cap_orig(cap), cost(cost), revEdge(revEdge), isRev(isRev) {\n\t}\n};\nstruct PrimalDual {\n\tint n;\n\tvector<vector<Edge> > g;\n\tPrimalDual(int n_) : n(n_), g(vector<vector<Edge> >(n_)) {}\n\tvoid add_edge(int src, int dst, Capacity cap, Cost cost) { // ?????????\n\t\tg[src].emplace_back(dst, cap, cost, g[dst].size(), false);\n\t\tg[dst].emplace_back(src, 0, -cost, g[src].size() - 1, true);\n\t}\n\tCost solve(int s, int t, int f) {\n\t\tCost res = 0;\n\t\t// vector<Cost> h(g.size()), dist(g.size());\n\t\t// vector<int> prevv(g.size()), preve(g.size());\n\t\tstatic Cost h[MAX_V], dist[MAX_V];\n\t\tstatic int prevv[MAX_V], preve[MAX_V];\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\th[i] = 0;\n\t\t}\n\t\twhile(f > 0) {\n\t\t\ttypedef pair<Cost, int> pcv;\n\t\t\tpriority_queue<pcv, vector<pcv>, greater<pcv> > q;\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tdist[i] = inf;\n\t\t\t}\n\t\t\tdist[s] = 0;\n\t\t\tq.emplace(pcv(0, s));\n\t\t\twhile(q.size()) {\n\t\t\t\tpcv p = q.top(); q.pop();\n\t\t\t\tint v = p.second;\n\t\t\t\tif(dist[v] < p.first) continue;\n\t\t\t\tfor(int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge &e = g[v][i];\n\t\t\t\t\tif(e.cap > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst]) {\n\t\t\t\t\t\tdist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];\n\t\t\t\t\t\tprevv[e.dst] = v;\n\t\t\t\t\t\tpreve[e.dst] = i;\n\t\t\t\t\t\tq.emplace(pcv(dist[e.dst], e.dst));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(dist[t] == inf) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor(int v = 0; v < n; v++) {\n\t\t\t\th[v] += dist[v];\n\t\t\t}\n\t\t\t// s-t ????????????????????£??????????????????\n\t\t\tint d = f;\n\t\t\tfor(int v = t; v != s; v = prevv[v]) {\n\t\t\t\td = min(d, g[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= d;\n\t\t\tres += d * h[t];\n\t\t\tfor(int v = t; v != s; v = prevv[v]) {\n\t\t\t\tEdge &e = g[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tg[v][e.revEdge].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t// ??????????????????=???????????????-?????¨??????????????¨???\n\tvoid view() {\n\t\tfor(int i = 0; i < g.size(); i++) {\n\t\t\tfor(int j = 0; j < g[i].size(); j++) {\n\t\t\t\tif(!g[i][j].isRev) {\n\t\t\t\t\tEdge& e = g[i][j];\n\t\t\t\t\tprintf(\"%3d->%3d (flow:%d)\\n\", i, e.dst, e.cap_orig - e.cap);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint V, E, F;\n\tcin >> V >> E >> F;\n\n\tPrimalDual pd(V);\n\n\tfor(int i = 0; i < E; i++) {\n\t\tint u, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\t\tpd.add_edge(u, v, c, d);\n\t}\n\n\tint res = pd.solve(0, V - 1, F);\n\tif(res == inf) {\n\t\tcout << -1 << endl;\n\t}\n\telse {\n\t\tcout << res << endl;\n\t}\n}", "#include <iostream>\n#include <queue>\n#include <vector>\n\nusing namespace std;\n\nconstexpr int INF = 1000000001;\nconstexpr int MAX = 10000;\n\ntypedef pair<int, int> P;\n\nstruct Edge {\n int to;\n int cap;\n int cost;\n int rev;\n Edge(int to, int cap, int cost, int rev) \n : to(to), cap(cap), cost(cost), rev(rev) {}\n};\n\nint V, E, F;\nvector<Edge> G[MAX];\nint h[MAX];\nint dist[MAX];\nint prevv[MAX], preve[MAX];\n\nauto add_edge(int from, int to, int cap, int cost) -> void {\n G[from].push_back(Edge(to, cap, cost, G[to].size()));\n G[to].push_back(Edge(from, 0, -cost, G[from].size() - 1));\n}\n\nauto min_cost_flow(int s, int t, int f) -> int {\n auto res = 0;\n fill(h, h + V, 0);\n while(f > 0) {\n priority_queue<P, vector<P>, greater<P>> que;\n fill(dist, dist + V, INF);\n dist[s] = 0;\n que.push(P(0, s));\n while(!que.empty()) {\n P p = que.top();\n que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (auto i = 0; i < G[v].size(); i++) {\n Edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INF) {\n return -1;\n }\n for (int v = 0; v < V; v++) {\n h[v] += dist[v];\n }\n\n int d = f;\n for (auto v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (auto v = t; v != s; v = prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nauto main(int argc, char const *argv[]) -> int {\n int n;\n\n cin>>V>>E>>F;\n while(E--){\n int u, v, c, d;\n cin>>u>>v>>c>>d;\n add_edge(u,v,c,d);\n }\n\n cout<<min_cost_flow(0, V - 1, F)<<endl;\n\n return 0;\n}", "#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n\n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n#define popcount(n) (__builtin_popcountll(n))\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n\nusing namespace std;\n\nconst int dx[8]={1,0,-1,0,1,-1,-1,1};\nconst int dy[8]={0,1,0,-1,1,1,-1,-1};\n\nusing edge=struct {int to,cap,cost,rev;};\nusing G=vector<vector<edge>>;\nconst int inf=1<<29;\n\nvoid add_edge(G &graph,int a,int b,int c,int d){\n\tgraph[a].push_back({b,c,d,int(graph[b].size())});\n\tgraph[b].push_back({a,0,-d,int(graph[a].size()-1)});\n}\n\nint min_cost_flow(G &graph,int s,int t,int f){\n\tint res=0;\n\twhile(f){\n\t\tint n=graph.size(),update;\n\t\tvector<int> dist(n,inf),pv(n,0),pe(n,0);\n\t\tdist[s]=0;\n\n\t\trep(loop,n){\n\t\t\tupdate=false;\n\t\t\trep(v,n)rep(i,graph[v].size()){\n\t\t\t\tedge &e=graph[v][i];\n\t\t\t\tif(e.cap>0 && chmin(dist[e.to],dist[v]+e.cost)){\n\t\t\t\t\tpv[e.to]=v,pe[e.to]=i;\n\t\t\t\t\tupdate=true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!update) break;\n\t\t}\n\n\t\tif(dist[t]==inf) return -1;\n\n\t\tint d=f;\n\t\tfor(int v=t;v!=s;v=pv[v]) chmin(d,graph[pv[v]][pe[v]].cap);\n\t\tf-=d,res+=d*dist[t];\n\n\t\tfor(int v=t;v!=s;v=pv[v]){\n\t\t\tedge &e=graph[pv[v]][pe[v]];\n\t\t\te.cap-=d;\n\t\t\tgraph[v][e.rev].cap+=d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(void){\n\tint n,m,f;\n\tcin >> n >> m >> f;\n\tG graph(n);\n\trep(i,m){\n\t\tint a,b,c,d;\n\t\tcin >> a >> b >> c >> d;\n\t\tadd_edge(graph,a,b,c,d);\n\t}\n\tcout << min_cost_flow(graph,0,n-1,f) << endl;\n\treturn 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\nusing FLOW = int;\nusing COST = int;\nconst int MAX_V = 100;\nconst COST INF = 1000000000;\n\nstruct Edge {\n int rev, from, to;\n FLOW cap, icap;\n COST cost;\n Edge(int r, int f, int t, FLOW cp, COST cs)\n : rev(r), from(f), to(t), cap(cp), icap(cp), cost(cs) {}\n};\n\nstruct Graph {\n int V;\n vector<Edge> list[MAX_V];\n Graph(int n = 0) { init(n); }\n void init(int n = 0) {\n V = n;\n for(auto &&v : list)\n v.clear();\n }\n void resize(int n = 0) { V = n; }\n void reset() {\n for(auto &&v : list)\n for(auto &&e : v)\n e.cap = e.icap;\n }\n inline vector<Edge> &operator[](int i) { return list[i]; }\n Edge &redge(Edge &e) { return list[e.to][e.rev + (e.from == e.to)]; }\n void addedge(int from, int to, FLOW cap, COST cost) {\n list[from].emplace_back(list[to].size(), from, to, cap, cost);\n list[to].emplace_back(list[from].size() - 1, to, from, 0, -cost);\n }\n};\n\nCOST MinCostFlow(Graph &G, int s, int t, FLOW f) {\n COST dist[MAX_V];\n int prevv[MAX_V];\n int preve[MAX_V];\n COST res = 0;\n COST h[MAX_V];\n memset(h, 0, sizeof(h));\n using P = pair<COST, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n while(f > 0) {\n fill(dist, dist + G.V, INF);\n dist[s] = 0;\n que.emplace(0, s);\n while(!que.empty()) {\n P p = que.top();\n que.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n for(int i = 0; i < (int)G[v].size(); i++) {\n Edge &e = G[v][i];\n if(e.cap > 0 &&\n dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.emplace(dist[e.to], e.to);\n }\n }\n }\n if(dist[t] == INF) return -1;\n for(int v = 0; v < G.V; v++)\n h[v] += dist[v];\n FLOW d = f;\n for(int v = t; v != s; v = prevv[v])\n d = min(d, G[prevv[v]][preve[v]].cap);\n f -= d;\n res += h[t] * d;\n for(int v = t; v != s; v = prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n Edge &re = G.redge(e);\n e.cap -= d;\n re.cap += d;\n }\n }\n return res;\n}\n\nint main() {\n int n, m;\n FLOW f;\n cin >> n >> m >> f;\n Graph G(n);\n for(int i = 0; i < m; i++) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n G.addedge(a, b, c, d);\n }\n cout << MinCostFlow(G, 0, n - 1, f) << \"\\n\";\n\n return 0;\n}\n", "#include<bits/stdc++.h>\n#define INF 1e9\n#define llINF 1e18\n#define MOD 1000000007\n#define pb push_back\n#define mp make_pair \n#define F first\n#define S second\n#define ll long long\n#define ull unsigned long long\n#define vi vector<ll>\n#define vvi vector<vi>\n#define BITLE(n) (1LL<<((ll)n))\n#define BITCNT(n) (__builtin_popcountll(n))\n#define SUBS(s,f,t) ((s).substr((f)-1,(t)-(f)+1))\n#define ALL(a) (a).begin(),(a).end()\nusing namespace std;\nstruct MinCostFlow{\n struct edge{\n ll to,cap,cost,rev;\n };\n const ll MAX_V=200100;\n const ll Inf=1e18;\n ll V;\n vector<vector<edge>>E;\n vi dist,h,prevv,preve;\n MinCostFlow(ll V):V(V),E(V),dist(V),h(V),prevv(V),preve(V){}\n\n void addEdge(ll from, ll to, ll cap, ll cost){\n E[from].pb({to,cap,cost,(ll)E[to].size()});\n E[to].pb({from,0,-cost,(ll)E[from].size()-1});\n }\n\n void dijkstra(ll s){\n priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>que;\n fill(ALL(dist),Inf);\n dist[s] = 0;\n que.push(pair<ll,ll>(0,s));\n while(!que.empty()){\n pair<ll,ll> p = que.top();\n que.pop();\n ll v = p.second;\n if(dist[v] < p.first)continue;\n for(int j = 0;j < E[v].size();j++){\n\tedge t = E[v][j];\n\tif(t.cap > 0&&dist[t.to] > dist[v] + t.cost + h[v] - h[t.to]){\n\t dist[t.to] = dist[v] + t.cost + h[v] - h[t.to];\n\t prevv[t.to] = v;preve[t.to] = j;\n\t que.push(pair<ll,ll>(dist[t.to],t.to));\n\t}\n }\n }\n }\n\n ll execution(ll s,ll t,ll f){\n ll ret = 0;\n fill(ALL(h),0);\n while(f>0){\n dijkstra(s);\n if(dist[t] == Inf)return -1;\n for(ll v = 0;v < V;v++)h[v] += dist[v];\n\n ll d = f;\n for(ll v = t; v != s; v = prevv[v]){\n\td = min(d, E[prevv[v]][preve[v]].cap);\n }\n f -= d;\n ret += d * h[t];\n for(int v = t; v != s; v = prevv[v]){\n\tedge &e = E[prevv[v]][preve[v]];\n\te.cap -= d;\n\tE[v][e.rev].cap += d;\n }\n }\n return ret;\n }\n};\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n ll v,e,f;cin>>v>>e>>f;\n MinCostFlow mcf(v);\n for(int i=0;i<e;i++){\n ll f,t,c,d;cin>>f>>t>>c>>d;\n mcf.addEdge(f,t,c,d);\n }\n cout<<mcf.execution(0,v-1,f)<<endl;\n return 0;\n}\n\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n#define INF 1<<30\n#define LINF 1LL<<60\n#define MAX_V 100000\n\nstruct edge{\n int to;\n int cap;\n int cost;\n int rev;\n edge(){}\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n};\n\nint V;\nvector<edge> G[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].push_back(edge(to,cap,cost,(int)G[to].size()));\n G[to].push_back(edge(from,0,-cost,(int)G[from].size()-1));\n}\n\nint min_cost_flow(int s,int t,int f){\n int res=0;\n while(f>0){\n fill(dist,dist+V,INF);\n dist[s]=0;\n bool update = true;\n while(update){\n update = false;\n for(int v=0; v<V ;v++){\n if(dist[v]==INF) continue;\n for(int i=0; i<G[v].size(); i++){\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v]+e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n if(dist[t]==INF) return -1;\n \n int d = f;\n for(int v=t; v!=s; v=prevv[v])d=min(d,G[prevv[v]][preve[v]].cap);\n f -= d;\n res += d*dist[t];\n for(int v=t; v!=s; v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main() {\n int E, F; cin >> V >> E >> F;\n for (int i = 0; i < E;i++) {\n int u, v, c, d; cin >> u >> v >> c >> d;\n add_edge(u,v,c,d);\n }\n cout << min_cost_flow(0,V-1,F) << endl;\n return 0;\n}\n\n", "#include <vector>\n#include <queue>\n#include <set>\nusing namespace std;\n\nstruct Graph {\n struct edge {\n int to;\n int cap;\n int cost;\n int rev;\n };\n\n int n;\n vector<vector<edge>> edges;\n\n Graph(int N) {\n n = N;\n edges.resize(n, vector<edge>());\n }\n\n int size() const { return n; }\n\n vector<edge> &operator[](int v) { return edges[v]; }\n};\n\n\nint minimumCostFlow(Graph& g,int s,int t,int f)\n{\n const int n = g.size();\n using Pi = pair<int,int>;\n priority_queue<Pi,vector<Pi>,greater<Pi>> que;\n vector<int> prevv(n,-1);\n vector<int> preve(n,-1);\n vector<int> potential(n,0);\n int res = 0;\n while(f > 0){\n vector<int> dist(n,1e9);\n que.push({0,s});\n dist[s] = 0;\n while(!que.empty()){\n Pi p = que.top();\n que.pop();\n if(dist[p.second] < p.first) continue;\n for(int i = 0;i < g[p.second].size();i++){\n auto& e = g[p.second][i];\n int next = dist[p.second] + e.cost + potential[p.second] - potential[e.to];\n if(e.cap > 0 && dist[e.to] > next){\n dist[e.to] = next;\n prevv[e.to] = p.second;\n preve[e.to] = i;\n que.push({dist[e.to],e.to});\n }\n }\n }\n if(dist[t] == 1e9) return -1;\n for(int v = 0;v < n;v++){\n potential[v] += dist[v];\n }\n int d = f;\n for(int v = t;v != s;v = prevv[v]){\n d = min(d,g[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * potential[t];\n\n for(int v = t;v != s;v = prevv[v]){\n auto& e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\n#include <iostream>\n\nint main()\n{\n int v;int e;int f;\n cin >> v >> e >> f;\n\n Graph g(v);\n for(int i = 0;i < e;i++)\n {\n int u,v,c,d;\n cin >> u >> v >> c >> d;\n g[u].push_back({v,c,d,(int)g[v].size()});\n g[v].push_back({u,0,-d,(int)g[u].size() - 1});\n }\n\n int ans = minimumCostFlow(g,0,v - 1,f);\n cout << ans << endl;\n}\n\n", "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MAX_V = 100;\nconst int INF = 1e9;\n\nstruct edge\n{\n\tint to,cap,cost,rev;\n};\n\nint V;\nvector<edge> G[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n\nvoid add_edge(int from,int to, int cap, int cost)\n{\n\tG[from].push_back((edge){to,cap,cost,(int)G[to].size()});\n\tG[to].push_back((edge){from,0,-cost,(int)G[from].size()-1});\n}\n\nint min_cost_frow(int s,int t,int f)\n{\n\tint res = 0;\n\twhile(f>0)\n\t{\n\t\tfill(dist,dist+V,INF);\n\t\tdist[s] = 0;\n\t\tbool update = true;\n\t\twhile(update)\n\t\t{\n\t\t\tupdate = false;\n\t\t\tfor(int v = 0;v<V;v++)\n\t\t\t{\n\t\t\t\tif(dist[v] == INF)continue;\n\t\t\t\tfor(int i = 0;i<G[v].size();i++)\n\t\t\t\t{\n\t\t\t\t\tedge &e = G[v][i];\n\t\t\t\t\tif(e.cap>0&&dist[e.to]>dist[v] + e.cost)\n\t\t\t\t\t{\n\t\t\t\t\t\tdist[e.to] = dist[v]+e.cost;\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(dist[t]==INF)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t\tint d = f;\n\t\tfor(int v = t;v != s;v = prevv[v])\n\t\t{\n\t\t\td = min(d,G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -=d;\n\t\tres += d*dist[t];\n\t\tfor(int v= t;v !=s;v=prevv[v])\n\t\t{\n\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tint E,F;\n\tcin >> V >> E >> F;\n\tfor(int i = 0;i<E;i++)\n\t{\n\t\tint u,v,c,d;\n\t\tcin >> u >> v >> c >> d;\n\t\tadd_edge(u,v,c,d);\n\t}\n\tcout<<min_cost_frow(0,V-1,F)<<endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for (int i=0;i<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define all(a) (a).begin(),(a).end()\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> vi;\ntypedef vector<P> vp;\ntypedef vector<ll> vll;\n\nconst int INF = 99999999;\nconst int MAX_V = 100000;\n\nstruct edge { int to, cap, cost, rev; };\n\nint V, E, F;\nvector<edge> G[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V]; // privious vertex, edge\n\nvoid add_edge(int from, int to, int cap, int cost) {\n G[from].emplace_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].emplace_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\n// get min cost flow from s to t\n// if we can flow not at all, then return -1\nint min_cost_flow(int s, int t, int f) {\n int res = 0;\n while (f > 0) {\n fill(dist, dist + V, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n rep(v, V) {\n if (dist[v] == INF) continue;\n rep(i, G[v].size()) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n\n if (dist[t] == INF) {\n // no more flow\n return -1;\n }\n\n // flow as much as possible along minimum path from s to t\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, (int)G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nsigned main() {\n cin >> V >> E >> F;\n rep(i, E) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n add_edge(u, v, c, d);\n }\n\n cout << min_cost_flow(0, V - 1, F) << endl;\n}", "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<(n);i++)\nconst int INF = 1e9;\n\nstruct edge { int to, cap, cost, rev; };\nint V;\nconst int MAX_V = 100;\nvector<edge> G[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V], preve[MAX_V];\n \nvoid add_edge(int from, int to, int cap, int cost) {\n G[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n \nint min_cost_flow(int s, int t, int f) {\n int res = 0;\n while (f > 0) {\n fill(dist, dist + V, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n for (int v = 0; v < V; v++) {\n if (dist[v] == INF) continue;\n for (int i = 0; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n \n if (dist[t] == INF) {\n return -1;\n }\n \n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main(void){\n\tcin >> V;\n\tint e, f; cin >> e >> f;\n\trep(i, e){\n\t\tint u, v, c, d;\n\t\tcin >> u >> v >> c >> d;\n\t\tadd_edge(u, v, c, d);\n\t}\n\tprintf(\"%d\\n\", min_cost_flow(0, V - 1, f));\n}", "#!usr/bin/env python3\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef I(): return int(sys.stdin.readline())\ndef LS():return list(map(list, sys.stdin.readline().split()))\ndef S(): return list(sys.stdin.readline())[:-1]\ndef IR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = I()\n return l\ndef LIR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = LI()\n return l\ndef SR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = S()\n return l\ndef LSR(n):\n l = [None for i in range(n)]\n for i in range(n):l[i] = SR()\n return l\nmod = 1000000007\n\n# 1:shortest path\n# 1_A\n\"\"\"\nfrom heapq import heappush, heappop\ndef dijkstra(num, start):\n dist = [float(\"inf\") for i in range(num)]\n dist[start] = 0\n q = [[dist[start], start]]\n while q:\n du, u = heappop(q)\n for j, k in adj[u]:\n if dist[j] > du + k:\n dist[j] = du + k\n heappush(q, [dist[j], j])\n print(dist, q)\n return dist\n\nv,e,r = map(int, input().split(\" \"))\nadj = [[] for i in range(v)]\nfor i in range(e):\n s,t,d = map(int, input().split(\" \"))\n adj[s].append([t, d])\nlis = dijkstra(v, r)\nprint(lis)\nfor i in lis:\n print(str(i).upper())\n\"\"\"\n\n# 1_B\n\"\"\"\ndef bellman_ford(num, start):\n dist = [float(\"inf\")]*num\n dist[start] = 0\n for i in range(num):\n update = False\n for fro, to, cost in e:\n d = dist[fro] + cost\n if dist[to] > d:\n dist[to] = d\n update = True\n if i == num-1:\n return False\n if not update:\n break\n return dist\n\nv,E,r = map(int, input().split(\" \"))\ne = []\nfor i in range(E):\n s,t,d = map(int, input().split(\" \"))\n e.append([s, t, d])\nlis = bellman_ford(v, r)\nif not lis:\n print(\"NEGATIVE CYCLE\")\nelse:\n for i in lis:\n print(str(i).upper())\n\"\"\"\n# 1_C\n\"\"\"\ndef warshallfloyd(n):\n for i in range(n):\n for j in range(n):\n for k in range(n):\n d[j][k] = min(d[j][k], d[j][i]+d[i][k])\nv,e = map(int, input().split())\nd = [[float(\"inf\") for j in range(v)] for i in range(v)]\nfor i in range(v):\n d[i][i] = 0\nfor i in range(e):\n s, t, c = map(int, input().split())\n d[s][t] = c\nwarshallfloyd(v)\nfor i in range(v):\n if d[i][i] < 0:\n print(\"NEGATIVE CYCLE\")\n quit()\nfor i in d:\n for j in range(v):\n if j < v-1:\n print(str(i[j]).upper(), end = \" \")\n else:\n print(str(i[j]).upper())\n\"\"\"\n\n# 2:spanning tree\n# 2_A\n\"\"\"\ndef root(x):\n if par[x] == x:\n return x\n par[x] = root(par[x])\n return par[x]\n\ndef same(x,y):\n return root(x) == root(y)\n\ndef unite(x,y):\n x = root(x)\n y = root(y)\n if rank[x] < rank[y]:\n par[x] = y\n else:\n par[y] = x\n if rank[x] == rank[y]:\n rank[x] += 1\nv,e = LI()\nc = LIR(e)\nc.sort(key = lambda x:x[2])\npar = [i for i in range(v)]\nrank = [0 for i in range(v)]\nk = 0\nans = 0\nfor a,b,w in c:\n if not same(a,b):\n k += 1\n unite(a,b)\n ans += w\n if k == v-1:\n break\nprint(ans)\n\"\"\"\n\n#2_B\n\"\"\"\ndef root(x):\n if par[x] == x:\n return x\n par[x] = root(par[x])\n return par[x]\n\ndef same(x,y):\n return root(x) == root(y)\n\ndef unite(x,y):\n x = root(x)\n y = root(y)\n if rank(x) < rank(y):\n par[x] = y\n else:\n par[y] = x\n if rank(x) == rank(y):\n rank[x] += 1\n\"\"\"\n\n#3:connected components\n#3_A\n\n#3_B\n\n#3_C\n\n\n#4:path/cycle\n#4_A\n\"\"\"\ndef bellman_ford(num, start):\n dist = [float(\"inf\") for i in range(num)]\n dist[start] = 0\n for i in range(num):\n update = False\n for j, k, l in adj:\n if dist[k] > dist[j] + l:\n dist[k] = dist[j] + l\n update = True\n if i == num-1:\n return False\n if not update:\n break\n return True\n\nv, e = map(int, input().split(\" \"))\nadj = []\nfor i in range(e):\n s,t = map(int, input().split(\" \"))\n adj.append([s, t, -1])\nfor i in range(v):\n if not bellman_ford(v,i):\n print(1)\n quit()\nprint(0)\n\"\"\"\n\n#4_B\n\"\"\"\ndef visit(s):\n if f[s]:\n f[s] = 0\n for t in v[s]:\n visit(t)\n l.append(s)\nn,e = LI()\nv = [[] for i in range(n)]\nfor i in range(e):\n s,t = LI()\n v[s].append(t)\nl = []\nf = [1 for i in range(n)]\nfor i in range(n):\n visit(i)\nl = l[::-1]\nfor i in l:\n print(i)\n\"\"\"\n\n#5:tree\n#5_A\n\"\"\"\nfrom heapq import heappush, heappop\ndef dijkstra(num, start):\n dist = [float(\"inf\") for i in range(num)]\n dist[start] = 0\n q = [[dist[start], start]]\n while q:\n du, u = heappop(q)\n for j, k in adj[u]:\n if dist[j] > du + k:\n dist[j] = du + k\n heappush(q, [dist[j], j])\n return dist\n\nn = II()\nadj = [[] for i in range(n)]\nfor i in range(n-1):\n s,t,w = LI()\n adj[s].append([t, w])\n adj[t].append([s, w])\nd = dijkstra(n,0)\ni = d.index(max(d))\nd2 = dijkstra(n,i)\nprint(max(d2))\n\"\"\"\n\n#5_B\n\"\"\"\nfrom heapq import heappush, heappop\ndef dijkstra(num, start):\n dist = [float(\"inf\") for i in range(num)]\n dist[start] = 0\n q = [[dist[start], start]]\n while q:\n du, u = heappop(q)\n for j, k in adj[u]:\n if dist[j] > du + k:\n dist[j] = du + k\n heappush(q, [dist[j], j])\n return dist\n\nn = int(input())\nadj = [[] for i in range(n)]\nfor i in range(n-1):\n s, t, w = map(int, input().split(\" \"))\n adj[s].append([t, w])\n adj[t].append([s, w])\nfor i in range(n):\n s = dijkstra(n,i)\n print(max(s))\n\"\"\"\n#5_C\n\n#5_D\n\n#5_E\n\n\n#6\n#6_A_maximum_flow\n\"\"\"\ndef bfs(s,g,n):\n bfs_map = [-1 for i in range(n)]\n bfs_map[s] = 0\n q = deque()\n q.append(s)\n fin = False\n while q:\n x = q.popleft()\n for y in v[x]:\n if c[x][y] > 0 and bfs_map[y] < 0:\n bfs_map[y] = bfs_map[x]+1\n if y == g:\n fin = True\n break\n q.append(y)\n if fin:\n break\n\n if bfs_map[g] == -1:\n return None,0\n path = [None]*(bfs_map[g]+1)\n m = float(\"inf\")\n path[bfs_map[g]] = g\n y = g\n for i in range(bfs_map[g])[::-1]:\n for x in v[y]:\n if c[x][y] > 0 and bfs_map[x] == bfs_map[y]-1:\n path[i] = x\n if c[x][y] < m:\n m = c[x][y]\n y = x\n break\n return path,m\n\ndef ford_fulkerson(s,g,c,n):\n f = 0\n while 1:\n p,m = bfs(s,g,n)\n if not m:break\n f += m\n for i in range(len(p)-1):\n c[p[i]][p[i+1]] -= m\n c[p[i+1]][p[i]] += m\n return f\n\nn,e = LI()\nc = [defaultdict(lambda : 0) for j in range(n)]\nv = [[] for i in range(n)]\nfor i in range(e):\n a,b,w = LI()\n c[a][b] = w\n v[a].append(b)\n v[b].append(a)\nprint(ford_fulkerson(0,n-1,c,n))\n\"\"\"\n#6_B\ndef dijkstra(s,h):\n dist = [float(\"inf\")]*n\n prev = [-1]*n\n dist[s] = 0\n q = [(0,s)]\n while q:\n dx,x = heappop(q)\n for y in v[x]:\n if cap[x][y] <= 0:\n continue\n dy = dx+cost[x][y]+h[x]-h[y]\n if dy < dist[y]:\n dist[y] = dy\n prev[y] = x\n heappush(q,(dy,y))\n return (dist,prev)\n\ndef minimim_flow(s,g,f):\n res = 0\n h = [0]*n\n while f > 0:\n dist,prev = dijkstra(s,h)\n if dist[g] == float(\"inf\"):\n return -1\n for i in range(n):\n h[i] += dist[i]\n flow = f\n y = g\n while y != s:\n x = prev[y]\n if cap[x][y] < flow:\n flow = cap[x][y]\n y = x\n f -= flow\n res += flow*h[g]\n\n y = g\n while y != s:\n x = prev[y]\n cap[x][y] -= flow\n cap[y][x] += flow\n y = x\n return res\n\nn,m,f = LI()\nv = [[] for i in range(n)]\ncap = [defaultdict(lambda : 0) for i in range(n)]\ncost = [defaultdict(lambda : 0) for i in range(n)]\nfor i in range(m):\n a,b,c,d = LI()\n v[a].append(b)\n v[b].append(a)\n cost[a][b] = d\n cost[b][a] = -d\n cap[a][b] = c\nprint(minimim_flow(0,n-1,f))\n#7\n#7_A\n\"\"\"\ndef bfs(s,g,n):\n bfs_map = [-1 for i in range(n)]\n bfs_map[s] = 0\n q = deque()\n q.append(s)\n fin = False\n while q:\n x = q.popleft()\n for y in range(n):\n if c[x][y] > 0 and bfs_map[y] < 0:\n bfs_map[y] = bfs_map[x]+1\n if y == g:\n fin = True\n break\n q.append(y)\n if fin:\n break\n\n if bfs_map[g] == -1:\n return [None,0]\n path = [None for i in range(bfs_map[g]+1)]\n m = float(\"inf\")\n path[bfs_map[g]] = g\n y = g\n for i in range(bfs_map[g])[::-1]:\n for x in range(n+1):\n if c[x][y] > 0 and bfs_map[x] == bfs_map[y]-1:\n path[i] = x\n if c[x][y] < m:\n m = c[x][y]\n y = x\n break\n return [path,m]\n\ndef ford_fulkerson(s,g,c,n):\n while 1:\n p,m = bfs(s,g,n)\n if not m:break\n for i in range(len(p)-1):\n c[p[i]][p[i+1]] -= m\n c[p[i+1]][p[i]] += m\n return sum(c[g])\n\nx,y,e = LI()\nc = [[0 for i in range(x+y+2)] for j in range(x+y+2)]\nfor i in range(x):\n c[0][i+1] = 1\nfor i in range(y):\n c[x+i+1][x+y+1] = 1\nfor i in range(e):\n a,b = LI()\n c[a+1][x+b+1] = 1\nprint(ford_fulkerson(0,x+y+1,c,x+y+2))\n\"\"\"\n\n", "#include <math.h>\n#include <bits/stdc++.h>//一括で読み込み\nusing namespace std;\n#define MAX_V 500\ntypedef long long ll;\ntypedef pair<int,int> P;\nstruct edge{int to, cap, cost, rev;};\n \nint V;\nvector<edge> G[MAX_V];\nint h[MAX_V];\nint dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n \nvoid add_edge(int from, int to, int cap, int cost)\n{\n G[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n G[to].push_back((edge){from, 0, -cost, (int)G[from].size()-1});\n}\n \nint min_cost_flow(int s, int t, int f)\n{\n int res = 0;\n fill(h, h+V, 0);\n while(f > 0)\n {\n priority_queue<P,vector<P>,greater<P>> que;\n fill(dist, dist+V, 1<<28);\n dist[s] = 0;\n que.push(P(0,s));\n while(!que.empty())\n {\n P p = que.top();\n que.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n for(int i = 0; i < G[v].size(); i++)\n {\n edge &e=G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v]+e.cost+h[v]-h[e.to])\n {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to], e.to));\n }\n }\n }\n if(dist[t] == (1 << 28))\n {\n return -1;\n }\n for(int v = 0; v < V; v++) h[v] += dist[v];\n \n int d = f;\n for(int v = t; v != s; v = prevv[v])\n {\n d = min(d,G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d*h[t];\n for(int v = t; v != s; v = prevv[v])\n {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n \nint main()\n{\n int e,f,u,v,c,d,i;\n cin >> V;//Vは頂点数（500以下）\n cin >> e >> f;\n for(i = 0; i < e; i++)\n {\n cin >> u >> v >> c >> d;\n add_edge(u,v,c,d);//辺の追加（開始、終了頂点と容量、コスト）\n }\n cout << min_cost_flow(0, V-1, f) << endl;//最小費用流(開始、終了頂点と流量)\n return 0;\n}\n", "#include <bits/stdc++.h>\n\n#define fread_siz 1024\n\ninline int get_c(void)\n{\n\tstatic char buf[fread_siz];\n\tstatic char *head = buf + fread_siz;\n\tstatic char *tail = buf + fread_siz;\n\n\tif (head == tail)\n\t\tfread(head = buf, 1, fread_siz, stdin);\n\n\treturn *head++;\n}\n\ninline int get_i(void)\n{\n\tregister int ret = 0;\n\tregister int neg = false;\n\tregister int bit = get_c();\n\n\tfor (; bit < 48; bit = get_c())\n\t\tif (bit == '-')neg ^= true;\n\n\tfor (; bit > 47; bit = get_c())\n\t\tret = ret * 10 + bit - 48;\n\n\treturn neg ? -ret : ret;\n}\n\ntemplate <class T>\ninline T min(T a, T b)\n{\n\treturn a < b ? a : b;\n}\n\nconst int inf = 2e9;\nconst int maxn = 2005;\n\nint n, m;\nint s, t;\nint flow;\n\nint edges;\nint hd[maxn];\nint nt[maxn];\nint to[maxn];\nint vl[maxn];\nint fl[maxn];\n\ninline void add(int u, int v, int f, int w)\n{\n\tnt[edges] = hd[u]; to[edges] = v; fl[edges] = f; vl[edges] = +w; hd[u] = edges++;\n\tnt[edges] = hd[v]; to[edges] = u; fl[edges] = 0; vl[edges] = -w; hd[v] = edges++;\n}\n\nint dis[maxn];\nint pre[maxn];\n\ninline bool spfa(void)\n{\n\tstatic int que[maxn];\n\tstatic int inq[maxn];\n\tstatic int head, tail;\n\t\n\tmemset(dis, 0x3f, sizeof(dis));\n\thead = 0, tail = 0;\n\tque[tail++] = s;\n\tpre[s] = -1;\n\tinq[s] = 1;\n\tdis[s] = 0;\n\t\n\twhile (head != tail)\n\t{\n\t\tint u = que[head++], v; inq[u] = 0;\n\t\t\n\t\tfor (int i = hd[u]; ~i; i = nt[i])\n\t\t\tif (dis[v = to[i]] > dis[u] + vl[i] && fl[i])\n\t\t\t{\n\t\t\t\tdis[v] = dis[u] + vl[i];\n\t\t\t\tpre[v] = i ^ 1;\n\t\t\t\tif (!inq[v])\n\t\t\t\t\tinq[v] = 1, que[tail++] = v;\n\t\t\t}\n\t}\n\t\n\treturn dis[t] < 0x3f3f3f3f;\n}\n\ninline int expend(void)\n{\n\tint newFlow = inf;\n\t\n\tfor (int i = pre[t]; ~i; i = pre[to[i]])\n\t\tnewFlow = min(newFlow, fl[i ^ 1]);\n\t\t\n\tfor (int i = pre[t]; ~i; i = pre[to[i]])\n\t\tfl[i] += newFlow, fl[i^1] -= newFlow;\n\t\t\n\treturn flow -= newFlow, newFlow * dis[t];\n}\n\ninline int mcmf(void)\n{\n\tint ret = 0;\n\t\n\twhile (spfa())\n\t\tret += expend();\n\t\t\n\treturn flow ? -1 : ret;\n}\n\nsigned main(void)\n{\n\tn = get_i();\n\tm = get_i();\n\t\n\tflow = get_i();\n\t\n\tmemset(hd, -1, sizeof(hd));\n\t\n\tfor (int i = 1; i <= m; ++i)\n\t{\n\t\tint u = get_i();\n\t\tint v = get_i();\n\t\tint f = get_i();\n\t\tint w = get_i();\n\t\tadd(u, v, f, w);\n\t}\n\t\n\ts = n, t = n - 1;\n\t\n\tadd(s, 0, flow, 0);\n\t\n\tprintf(\"%d\\n\", mcmf());\n}", "//#include \"bits/stdc++.h\"\n\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <cstdlib>\n#include <deque>\n#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <iterator>\n\nusing namespace std;\n\n#define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define all(c) begin(c),end(c)\n\n//#define int long long\n#define SZ(x) ((int)(x).size())\n#define pb push_back\n#define mp make_pair\n\ntypedef long long ll;\n//typedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<ll, int> pli;\ntypedef pair<double, double> pdd;\ntypedef vector<vector<int>> mat;\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }\n\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)1e9 + 7;\nconst double EPS = 1e-9;\n\nstruct edge\n{\n\tint s, t, c, d,rev;\n\tedge(int s, int t, int c, int d,int rev) :s(s), t(t), c(c),d(d), rev(rev) {}\n\tedge() { s = -1, t = -1, c = -1, rev = -1; d = -1; }\n};\n\nvector<vector<edge>> G;\nint dist[101];\nint prevv[101], preve[101];\n\nint min_cost_flow(int s, int t, int f)\n{\n\tint res = 0;\n\n\twhile (f > 0)\n\t{\n\t\trep(i, 0, 101)dist[i] = INF;\n\t\tdist[s] = 0;\n\t\twhile (true)\n\t\t{\n\t\t\tbool update = false;\n\n\t\t\trep(i, 0, SZ(G))\n\t\t\t{\n\t\t\t\tif (dist[i] == INF)\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\trep(j, 0, SZ(G[i]))\n\t\t\t\t{\n\t\t\t\t\tedge e = G[i][j];\n\t\t\t\t\tif (e.c > 0 && dist[e.t] > dist[i] + e.d)\n\t\t\t\t\t{\n\t\t\t\t\t\tdist[e.t] = dist[i] + e.d;\n\t\t\t\t\t\tprevv[e.t] = i;\n\t\t\t\t\t\tpreve[e.t] = j;\n\t\t\t\t\t\tupdate = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!update)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (dist[t] == INF)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\n\t\tint tf = f;\n\t\tfor (int i = t; i != s; i = prevv[i])\n\t\t{\n\t\t\tchmin(tf, G[prevv[i]][preve[i]].c);\n\t\t}\n\t\tf -= tf;\n\t\tres += tf*dist[t];\n\t\tfor (int i = t; i != s; i = prevv[i])\n\t\t{\n\t\t\tG[prevv[i]][preve[i]].c -= tf;\n\t\t\tG[i][G[prevv[i]][preve[i]].rev].c += tf;\n\t\t}\n\t}\n\n\treturn res;\n}\n\nsigned main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint V, E, F,s, t, c, d;\n\tcin >> V >> E >> F;\n\tG.resize(V);\n\trep(i, 0, E)\n\t{\n\t\tcin >> s >> t >> c >> d;\n\t\tG[s].push_back(edge(s, t, c, d,SZ(G[t])));\n\t\tG[t].push_back(edge(t, s, 0, -d,SZ(G[s]) - 1));\n\t}\n\n\tcout << min_cost_flow(0,V-1,F) << endl;\n\n\treturn 0;\n}\n", "#include <algorithm>\n#include <iostream>\n#include <iomanip>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <random>\n#include <bitset>\n#include <queue>\n#include <cmath>\n#include <stack>\n#include <set>\n#include <map>\ntypedef long long ll;\nusing namespace std;\nconst ll MOD = 1000000007LL;\n\ntypedef pair <int, int> P;\n\nclass PrimalDual {\n const int INF = 1 << 30;\n\n struct Edge {\n int to, cap, cost, rev;\n };\n\n int n;\n vector<vector<Edge>> G;\n vector<int> potential; // ポテンシャル\n vector<int> dist; // 最短距離\n vector<int> prevv, preve; // 直前の頂点と辺\n\n void dijkstra(int s) {\n fill(dist.begin(), dist.end(), INF);\n priority_queue<P, vector<P>, greater<P>> q;\n dist[s] = 0;\n q.push(P(0, s));\n while (!q.empty()) {\n P p = q.top();\n q.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < G[v].size(); i++) {\n Edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] + potential[e.to] > dist[v] + e.cost + potential[v]) {\n dist[e.to] = dist[v] + e.cost + potential[v] - potential[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n q.push(P(dist[e.to], e.to));\n }\n }\n }\n }\n\npublic:\n PrimalDual(int n) : n(n), G(n), potential(n), dist(n), prevv(n), preve(n) {}\n\n void add_edge(int from, int to, int cap, int cost) {\n G[from].push_back({to, cap, cost, (int)G[to].size()});\n G[to].push_back({from, 0, -cost, (int)G[from].size() - 1});\n }\n\n int min_cost_flow(int s, int t, int flow) {\n fill(potential.begin(), potential.end(), 0);\n int ret = 0;\n while (flow) {\n dijkstra(s);\n if (dist[t] == INF) return -1;\n for (int v = 0; v < n; v++) potential[v] += dist[v];\n int f = flow;\n for (int v = t; v != s; v = prevv[v]) f = min(f, G[prevv[v]][preve[v]].cap);\n flow -= f;\n ret += f * potential[t];\n for (int v = t; v != s; v = prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= f;\n G[v][e.rev].cap += f;\n }\n }\n return ret;\n }\n};\n\nint main() {\n int V, E, F;\n cin >> V >> E >> F;\n\n PrimalDual pd(V);\n for (int e = 0; e < E; e++) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n pd.add_edge(u, v, c, d);\n }\n\n cout << pd.min_cost_flow(0, V - 1, F) << \"\\n\";\n return 0;\n}\n", "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\n\n#define MAX_V 100\nstruct edge { int to, cap, cost,rev; };\n\nint V; // ????????°\nvector<edge> G[MAX_V];\nint h[MAX_V];\t//??????????????£???\nint dist[MAX_V];// ???????????¢\nint prevv[MAX_V], preve[MAX_V];// ??´??????????????¨???\n\n// from??????to??????????????????cap????????????cost????????????????????????????????????\nvoid add_edge(int from, int to, int cap, int cost) {\n\tG[from].push_back((edge){to, cap, cost, (int)G[to].size()});\n\tG[to].push_back((edge){from, 0, -cost, (int)G[from].size() - 1});\n}\n\n// s??????t????????????f???????°??????¨???????±???????\n// ??????????????´??????-1?????????\nint min_cost_flow(int s, int t, int f) {\n\tint res = 0;\n\tfill(h, h + V, 0); // h????????????\n\twhile (f > 0) {\n\t\t// ?????????????????????????????¨??????h?????´??°??????\n\t\tpriority_queue<pii, vector<pii>, greater<pii> > que; fill(dist, dist + V, INF);\n\t\tdist[s] = 0;\n\t\tque.push(pii(0, s));\n\t\twhile (!que.empty()) {\n\t\t\tpii p = que.top(); que.pop();\n\t\t\tint v = p.second;\n\t\t\tif (dist[v] < p.first) continue;\n\t\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\t\tedge &e = G[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to]; prevv[e.to] = v;\n\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\tque.push(pii(dist[e.to], e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) return -1;\t//????????\\???????????????\n\t\t\n\t\tfor (int v = 0; v < V; v++) h[v] += dist[v];\n\t\t\n\t\t// s-t????????????????????£??????????????????\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t}\n\t\tf -= d;\n\t\tres += d * h[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]]; e.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(){\n\tint e,f;\n\tcin>>V>>e>>f;\n\trep(i,e){\n\t\tint u,v,c,d;\n\t\tcin>>u>>v>>c>>d;\n\t\tadd_edge(u, v, c, d);\n\t}\n\tcout<<min_cost_flow(0, V-1, f)<<endl;\n}", "#define _USE_MATH_DEFINES\n#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <utility>\n#include <complex>\n#include <set>\n#include <map>\n#include <queue>\n#include <stack>\n#include <deque>\n#include <tuple>\n#include <bitset>\n#include <algorithm>\n#include <random>\nusing namespace std;\ntypedef long double ld;\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<double, double> pdd;\ntypedef complex<ld> compd;\n#define rep(i,n)\tfor(int i=0;i<n;i++)\n#define srep(i,a,n)\tfor(int i=a;i<n;i++)\n#define REP(i,n)\tfor(int i=0;i<=n;i++)\n#define SREP(i,a,n)\tfor(int i=a;i<=n;i++)\n#define rrep(i,n)\tfor(int i=n-1;i>=0;i--)\n#define RREP(i,n)\tfor(int i=n;i>=0;i--)\n#define all(a)\t(a).begin(),(a).end()\n#define mp(a,b)\tmake_pair(a,b)\n#define mt\tmake_tuple\n#define pb\tpush_back\n#define fst\tfirst\n#define scn second\n#define bicnt(x)\t__buildin__popcount(x)\n#define gcd(a,b)\t__gcd__(a,b)\n#define debug(x)\tcout<<\"debug: \"<<x<<endl\n#define DEBUG 0\nconst ll inf = (ll)1e9;\nconst ll mod = 1e9 + 7;\nconst ld eps = 1e-9;\nconst int dx[] = { 0,1,0,-1 };\nconst int dy[] = { 1,0,-1,0 };\n\nstruct edge {\n\tint to, cap, cost, rev;\n\tedge(int to_, int cap_, int cost_, int rev_) {\n\t\tto = to_;\n\t\tcap = cap_;\n\t\tcost = cost_;\n\t\trev = rev_;\n\t}\n};\n\nint n;\nvector<edge> e[1010];\nint h[1010];\nint dist[1010];\nint prevv[1010], preve[1010];\n\nvoid add_edge(int s, int t, int cap, int cost) {\n\te[s].push_back(edge(t, cap, cost, e[t].size()));\n\te[t].push_back(edge(s, 0, -cost, e[s].size() - 1));\n}\n\nint min_cost_flow(int s, int t, int f) {\n\tint ret = 0;\n\tREP(i, n)\th[i] = 0;\n\twhile (f > 0) {\n\t\tpriority_queue<pii> pq;\n\t\tpq.push(mp(0, -s));\n\t\tREP(i, n)\tdist[i] = inf;\n\t\tdist[s] = 0;\n\t\twhile (!pq.empty()) {\n\t\t\tauto it = pq.top();\tpq.pop();\n\t\t\tint v = -it.second, cost = -it.first;\n\t\t\tif (dist[v] < cost)\tcontinue;\n\t\t\trep(i, e[v].size()) {\n\t\t\t\tedge* to = &e[v][i];\n\t\t\t\tif (to->cap > 0 && dist[to->to] > dist[v] + to->cost + h[v] - h[to->to]) {\n\t\t\t\t\tdist[to->to] = dist[v] + to->cost + h[v] - h[to->to];\n\t\t\t\t\tprevv[to->to] = v;\n\t\t\t\t\tpreve[to->to] = i;\n\t\t\t\t\tpq.push(mp(-dist[to->to], -to->to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == inf)\treturn -1;\n\t\trep(i, n)\th[i] += dist[i];\n\t\tint d = f;\n\t\tfor (int i = t; i != s; i = prevv[i]) {\n\t\t\td = min(d, e[prevv[i]][preve[i]].cap);\n\t\t}\n\t\tf -= d;\n\t\tret += d*h[t];\n\t\tfor (int i = t; i != s; i = prevv[i]) {\n\t\t\tedge* to = &e[prevv[i]][preve[i]];\n\t\t\tto->cap -= d;\n\t\t\te[i][to->rev].cap += d;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main() {\n\tint e, f;\tcin >> n >> e >> f;\n\trep(i, e) {\n\t\tint s, t, c, d;\tcin >> s >> t >> c >> d;\n\t\tadd_edge(s, t, c, d);\n\t}\n\tcout << min_cost_flow(0, n - 1, f) << endl;\n\treturn 0;\n}", "#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\nusing Weight=long long;\nstatic const Weight INF=1LL<<57;\n\ntemplate <class T>\nusing gp_queue=priority_queue<T, deque<T>, less<T>>;\n\nstruct Arc {\n // accessible to the reverse edge\n size_t src, dst;\n Weight capacity, cost, flow;\n size_t rev;\n Arc() {}\n Arc(size_t src, size_t dst, Weight capacity, Weight cost=0):\n src(src), dst(dst), capacity(capacity), cost(cost), flow(0), rev(-1)\n {}\n Weight residue() const {\n return capacity - flow;\n }\n};\n\nbool operator<(const Arc &e, const Arc &f) {\n if (e.cost != f.cost) {\n return e.cost > f.cost;\n } else if (e.capacity != f.capacity) {\n return e.capacity > f.capacity;\n } else {\n return e.src!=f.src? e.src<f.src : e.dst<f.dst;\n }\n}\n\nusing Arcs=vector<Arc>;\nusing Node=vector<Arc>;\nusing FlowNetwork=vector<Node>;\n\nvoid connect(FlowNetwork &g, size_t s, size_t d, Weight c=1, Weight k=0) {\n g[s].push_back(Arc(s, d, c, k));\n g[d].push_back(Arc(d, s, 0, -k));\n\n g[s].back().rev = g[d].size()-1;\n g[d].back().rev = g[s].size()-1;\n}\n\nvoid join(FlowNetwork &g, size_t s, size_t d, Weight c=1, Weight k=0) {\n g[s].push_back(Arc(s, d, c, k));\n g[d].push_back(Arc(d, s, c, k));\n\n g[s].back().rev = g[d].size()-1;\n g[d].back().rev = g[s].size()-1;\n}\n\npair<Weight, Weight> mincost_flow(\n FlowNetwork &g, size_t s, size_t t, Weight F=INF\n) {\n size_t V=g.size();\n vector<Arc *> prev(V, NULL);\n\n pair<Weight, Weight> total; // <cost, flow>\n while (F > total.second) {\n vector<Weight> d(V, INF); d[s]=0;\n for (size_t i=0; i<V; ++i) {\n for (size_t v=0; v<V; ++v) {\n if (d[v] == INF) continue;\n for (Arc &e: g[v]) {\n if (e.capacity <= 0) continue;\n\n if (d[e.dst] > d[e.src] + e.cost) {\n d[e.dst] = d[e.src] + e.cost;\n prev[e.dst] = &e;\n }\n }\n }\n }\n\n if (d[t] == INF) {\n total.first = -1;\n return total;\n }\n\n Weight f=F-total.second;\n for (Arc *e=prev[t]; e!=NULL; e=prev[e->src])\n f = min(f, e->capacity);\n\n total.second += f;\n total.first += f * d[t];\n for (Arc *e=prev[t]; e!=NULL; e=prev[e->src]) {\n e->capacity -= f;\n g[e->dst][e->rev].capacity += f;\n }\n }\n\n return total;\n}\n\nint main() {\n size_t V, E;\n Weight F;\n scanf(\"%zu %zu %lld\", &V, &E, &F);\n\n FlowNetwork g(V);\n for (size_t i=0; i<E; ++i) {\n size_t u, v;\n Weight c, d;\n scanf(\"%zu %zu %lld %lld\", &u, &v, &c, &d);\n\n connect(g, u, v, c, d);\n }\n\n printf(\"%lld\\n\", mincost_flow(g, 0, V-1, F).first);\n return 0;\n}", "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<int, int> P;\nconstexpr int IINF = INT_MAX;\n\nstruct edge{\n int to, cap, cost, rev;\n};\n\nint V, E, F;\nvector<vector<edge> > G;\nvector<int> h, dist, prevv, preve;\n\nvoid add_edge(int from, int to, int cap, int cost){\n G[from].push_back((edge){to, cap, cost, int(G[to].size())});\n G[to].push_back((edge){from, 0, -cost, int(G[from].size())-1});\n}\n\n// 最小費用流\nint min_cost_flow(int s, int t, int f){\n h.resize(G.size());\n dist.resize(G.size());\n prevv.resize(G.size());\n preve.resize(G.size());\n int res = 0;\n fill(h.begin(), h.end(), 0);\n while(f > 0){\n priority_queue<P, vector<P>, greater<P> > que;\n fill(dist.begin(), dist.end(), IINF);\n dist[s] = 0;\n que.push({0,s});\n while(!que.empty()){\n P p = que.top();\n que.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n for(int i=0;i<int(G[v].size());i++){\n auto &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push({dist[e.to], e.to});\n }\n }\n }\n if(dist[t] == IINF){\n return -1;\n }\n for(int v=0; v<G.size(); v++) h[v] += dist[v];\n int d = f;\n for(int v=t; v!=s; v=prevv[v]){\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d*h[t];\n for(int v=t; v!=s; v=prevv[v]){\n auto &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main() {\n cin >> V >> E >> F;\n G.resize(V);\n for(int i=0;i<E;i++){\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n add_edge(u, v, c, d);\n }\n cout << min_cost_flow(0, V-1, F) << endl;\n return 0;\n}\n\n", "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.Closeable;\nimport java.io.FileInputStream;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.PriorityQueue;\nimport java.util.TreeMap;\n\npublic class Main {\n\tstatic ContestScanner in;static Writer out;public static void main(String[] args)\n\t{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();\n\tin.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}\n\tstatic void dump(int[]a){for(int i=0;i<a.length;i++)out.print(a[i]+\" \");out.println();}\n\tstatic void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf(\"%\"+n+\"d \",a[i]);out.println();}\n\tstatic void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+\" \");out.println();}\n\tstatic void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}\n\tstatic long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}\n\tstatic String itob(int a,int l){return String.format(\"%\"+l+\"s\",Integer.toBinaryString(a)).replace(' ','0');}\n\tstatic void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}\n\tstatic void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}\n\tstatic void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}\n\tstatic void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}\n\tstatic void m_sort(int[]a,int s,int sz,int[]b)\n\t{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];\n\t} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */\n\tstatic void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}\n\tstatic void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}\n\tstatic void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}\n\tstatic void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}\n\tstatic void m_sort(long[]a,int s,int sz,long[]b)\n\t{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}\n\tstatic void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}\n\tstatic void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}\n\tstatic int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v\n\t{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}\n\tstatic int binarySearchSmallerMax(int[]a,int v,int l,int r)\n\t{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}\n\t@SuppressWarnings(\"unchecked\")\n\tstatic List<Integer>[]createGraph(int n)\n {List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}\n\tvoid solve() throws NumberFormatException, IOException{\n\t\tfinal int n = in.nextInt();\n\t\tfinal int m = in.nextInt();\n\t\tint f = in.nextInt();\n\t\tMinCostFlow mf = new MinCostFlow(n, f);\n\t\tfor(int i=0; i<m; i++){\n\t\t\tint from = in.nextInt();\n\t\t\tint to = in.nextInt();\n\t\t\tint cap = in.nextInt();\n\t\t\tint cost = in.nextInt();\n\t\t\tmf.edge(from, to, cap, cost);\n\t\t}\n\t\tint res = mf.flow(0, n-1);\n\t\tif(mf.f>0) res = -1;\n\t\tSystem.out.println(res);\n\t}\n}\n\nclass MinCostFlow{\n\tfinal int n;\n\tint f;\n\tList<Edge>[] node;\n\t@SuppressWarnings(\"unchecked\")\n\tpublic MinCostFlow(int n, int f) {\n\t\tthis.n = n;\n\t\tthis.f = f;\n\t\tnode = new List[n];\n\t\tfor(int i=0; i<n; i++) node[i] = new ArrayList<>();\n\t}\n\tvoid edge(int from, int to, int cap, int cost){\n\t\tEdge e = new Edge(to, cap, cost);\n\t\tEdge r = new Edge(from, 0, -cost);\n\t\te.rev = r;\n\t\tr.rev = e;\n\t\tnode[from].add(e);\n\t\tnode[to].add(r);\n\t}\n\tint flow(int s, int t){\n\t\tint[] h = new int[n];\n\t\tint[] dist = new int[n];\n\t\tint[] preV = new int[n];\n\t\tint[] preE = new int[n];\n\t\tfinal int inf = Integer.MAX_VALUE;\n\t\tPriorityQueue<Pos> qu = new PriorityQueue<>();\n\t\tint res = 0;\n\t\twhile(f>0){\n\t\t\tArrays.fill(dist, inf);\n\t\t\tdist[s] = 0;\n\t\t\tqu.clear();\n\t\t\tqu.add(new Pos(s, 0));\n\t\t\twhile(!qu.isEmpty()){\n\t\t\t\tPos p = qu.poll();\n\t\t\t\tif(dist[p.v]<p.d) continue;\n\t\t\t\tfinal int sz = node[p.v].size();\n\t\t\t\tfor(int i=0; i<sz; i++){\n\t\t\t\t\tEdge e = node[p.v].get(i);\n\t\t\t\t\tfinal int nd = e.cost+p.d + h[p.v]-h[e.to];\n\t\t\t\t\tif(e.cap>0 && nd < dist[e.to]){\n\t\t\t\t\t\tpreV[e.to] = p.v;\n\t\t\t\t\t\tpreE[e.to] = i;\n\t\t\t\t\t\tdist[e.to] = nd;\n\t\t\t\t\t\tqu.add(new Pos(e.to, nd));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(dist[t]==inf) break;\n\t\t\tfor(int i=0; i<n; i++) h[i] += dist[i];\n\t\t\tint minf = f;\n\t\t\tfor(int i=t; i!=s; i=preV[i]){\n\t\t\t\tminf = Math.min(minf, node[preV[i]].get(preE[i]).cap);\n\t\t\t}\n\t\t\tf -= minf;\n\t\t\tres += minf*h[t];\n\t\t\tfor(int i=t; i!=s; i=preV[i]){\n\t\t\t\tnode[preV[i]].get(preE[i]).cap -= minf;\n\t\t\t\tnode[preV[i]].get(preE[i]).rev.cap += minf;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n}\nclass Pos implements Comparable<Pos>{\n\tint v, d;\n\tpublic Pos(int v, int d) {\n\t\tthis.v = v;\n\t\tthis.d = d;\n\t}\n\t@Override\n\tpublic int compareTo(Pos o) {\n\t\treturn d-o.d;\n\t}\n}\n\nclass Edge{\n\tint to, cap, cost;\n\tEdge rev;\n\tEdge(int t, int c, int co){\n\t\tto = t;\n\t\tcap = c;\n\t\tcost = co;\n\t}\n\tvoid rev(Edge r){\n\t\trev = r;\n\t}\n}\n\n\n@SuppressWarnings(\"serial\")\nclass MultiSet<T> extends HashMap<T, Integer>{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic MultiSet<T> merge(MultiSet<T> set)\n\t{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}\n\tfor(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}\n}\n@SuppressWarnings(\"serial\")\nclass OrderedMultiSet<T> extends TreeMap<T, Integer>{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic OrderedMultiSet<T> merge(OrderedMultiSet<T> set)\n\t{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}\n\twhile(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}\n}\nclass Pair implements Comparable<Pair>{\n\tint a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}\n\tpublic boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}\n\tpublic int hashCode(){return hash;}\n\tpublic int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}\n}\nclass Timer{\n\tlong time;public void set(){time=System.currentTimeMillis();}\n\tpublic long stop(){return time=System.currentTimeMillis()-time;}\n\tpublic void print(){System.out.println(\"Time: \"+(System.currentTimeMillis()-time)+\"ms\");}\n\t@Override public String toString(){return\"Time: \"+time+\"ms\";}\n}\nclass Writer extends PrintWriter{\n\tpublic Writer(String filename)throws IOException\n\t{super(new BufferedWriter(new FileWriter(filename)));}\n\tpublic Writer()throws IOException{super(System.out);}\n}\nclass ContestScanner implements Closeable{\n\tprivate BufferedReader in;private int c=-2;\n\tpublic ContestScanner()throws IOException \n\t{in=new BufferedReader(new InputStreamReader(System.in));}\n\tpublic ContestScanner(String filename)throws IOException\n\t{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}\n\tpublic String nextToken()throws IOException {\n\t\tStringBuilder sb=new StringBuilder();\n\t\twhile((c=in.read())!=-1&&Character.isWhitespace(c));\n\t\twhile(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}\n\t\treturn sb.toString();\n\t}\n\tpublic String readLine()throws IOException{\n\t\tStringBuilder sb=new StringBuilder();if(c==-2)c=in.read();\n\t\twhile(c!=-1&&c!='\\n'&&c!='\\r'){sb.append((char)c);c=in.read();}\n\t\treturn sb.toString();\n\t}\n\tpublic long nextLong()throws IOException,NumberFormatException\n\t{return Long.parseLong(nextToken());}\n\tpublic int nextInt()throws NumberFormatException,IOException\n\t{return(int)nextLong();}\n\tpublic double nextDouble()throws NumberFormatException,IOException \n\t{return Double.parseDouble(nextToken());}\n\tpublic void close() throws IOException {in.close();}\n}", "import java.awt.geom.Point2D;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args){\n\t\tnew Main();\n\t}\n\tpublic Main(){\n//\t\tnew A().doIt();\n\t\tnew GRL_6().doIt();\n\t}\n\tclass GRL_6{\n\t\tvoid doIt(){\n\t\t\tint n = sc.nextInt();\n\t\t\tint e = sc.nextInt();\n\t\t\tint max = sc.nextInt();\n\t\t\tMCF m = new MCF(n);\n\t\t\tfor(int i = 0;i < e;i++){\n\t\t\t\tint from = sc.nextInt();\n\t\t\t\tint to = sc.nextInt();\n\t\t\t\tint cap = sc.nextInt();\n\t\t\t\tint cost = sc.nextInt();\n\t\t\t\tm.addEdge(from, to, cap, cost);\n\t\t\t}\n\t\t\tSystem.out.println(m.minCostFlow(0, n-1, max));\n\t\t}\n\t\tclass MCF{\n\t\t\tint INF=1<<24; ArrayList<ArrayList<Edge>> G;\n\t\t\tclass Edge {\n\t\t int to, cap, cost;\n\t\t int rev;\n\t\t public Edge(int to, int cap, int cost, int rev) {\n\t\t this.to = to;this.cap = cap;this.cost = cost; this.rev = rev;\n\t\t }\n\t\t }\n\t\t\tMCF(int v){\n\t\t\t\tG= new ArrayList<ArrayList<Edge>>(); \n\t\t\t\tfor(int i=0;i<v;i++){\n\t\t G.add(new ArrayList<Edge>());\n\t\t }\n\t\t\t}\n\t\t private void addEdge(int from, int to, int cap, int cost){\n\t\t G.get(from).add(new Edge(to, cap, cost, G.get(to).size()));\n\t\t G.get(to).add(new Edge(from, 0, -cost, G.get(from).size() - 1));\n\t\t }\n\t\t private int minCostFlow(int s, int t, int f) {\n\t\t \tint V = G.size();\n\t\t \tint [] dist = new int[V], prevv = new int[V], preve = new int[V]; \n\t\t \tint res=0;\n\t\t \twhile(f > 0){\n\t\t Arrays.fill(dist, INF);\n\t\t dist[s] = 0;\n\t\t boolean update = true;\n\t\t while(update) {\n\t\t update = false;\n\t\t for(int v = 0; v < V; v++){\n\t\t if(dist[v] == INF) continue;\n\t\t for(int i = 0 ; i < G.get(v).size(); i++){\n\t\t Edge e = G.get(v).get(i);\n\t\t if(e.cap > 0 && dist[e.to]> dist[v] + e.cost ){\n\t\t dist[e.to] = dist[v] + e.cost;\n\t\t prevv[e.to] = v;\n\t\t preve[e.to] = i;\n\t\t update = true;\n\t\t }\n\t\t }\n\t\t }\n\t\t }\n\t\t if(dist[t] == INF) return -1;\n\t\t int d= f;\n\t\t for(int v=t;v!= s; v = prevv[v]){\n\t\t \td= Math.min(d, G.get(prevv[v]).get(preve[v]).cap); \n\t\t }\n\t\t f -= d;\n\t\t res += d * dist[t];\n\t\t for(int v = t; v!= s; v = prevv[v]){\n\t\t Edge e =G.get(prevv[v]).get(preve[v]);\n\t\t e.cap -= d;\n\t\t G.get(v).get(e.rev).cap += d;\n\t\t }\n\t\t }\n\t\t \treturn res; \n\t\t }\n\t\t}\n\t}\n\tclass A{\n\t\tBigInteger sum[] = new BigInteger[501];\n\t\tBigInteger bit[] = new BigInteger[501];\n\t\tvoid doIt(){\n\t\t\tsum[1] = new BigInteger(\"1\");\n\t\t\tbit[1] = new BigInteger(\"1\");\n\t\t\tfor(int i = 2;i < 501;i++){\n\t\t\t\tbit[i] = bit[i-1].multiply(new BigInteger(\"2\"));\n\t\t\t\tsum[i] = sum[i-1].add(bit[i]);\n\t\t\t}\n\t\t\twhile(true){\n\t\t\t\tString str = sc.next();\n\t\t\t\tif(str.equals(\"0\"))break;\n\t\t\t\tBigInteger num = new BigInteger(str);\n\t\t\t\tint length = num.toString(2).length() + 1;\n\t\t\t\tArrayList<Par> array = new ArrayList<Par>(); \n\t\t\t\tarray.add(new Par(bit[length],1,length-1));\n\t\t\t\tSystem.out.println(bit[length - 1]+\" \"+sum[length - 1]);\n\t\t\t\tSystem.out.println(array.get(0).num+\" \"+array.get(0).cnt+\" \"+array.get(0).length);\n\t\t\t}\n\t\t}\n\t\tclass Par{\n\t\t\tBigInteger num;\n\t\t\tint cnt,length;\n\t\t\tpublic Par(BigInteger num,int cnt,int length){\n\t\t\t\tthis.num = num;\n\t\t\t\tthis.cnt = cnt;\n\t\t\t\tthis.length = length;\n\t\t\t}\n\t\t}\n\t}\n}", "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.Vector;\n\n\npublic class Main {\n\n\tstatic final int INF = 10000000;\n\t/**\n\t * @param args\n\t * @throws IOException \n\t */\n\t@SuppressWarnings(\"unchecked\")\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\n\t\tString[] tmpArray = br.readLine().split(\" \");\n\n\t\tint v = Integer.parseInt(tmpArray[0]);\n\t\tint e = Integer.parseInt(tmpArray[1]);\n\t\tint f = Integer.parseInt(tmpArray[2]);\n\t\t\n\t\tV = v;\n\t\tG = new Vector[V];\n\n\t\tfor(int i = 0; i < G.length; i++){\n\t\t\tG[i] = new Vector<Edge>();\n\t\t}\n\t\tdist = new int[V];\n\t\tprevv = new int[V];\n\t\tpreve = new int[V];\n\t\th = new int[V];\n\t\t\n\t\tfor(int i = 0; i < e; i++){\n\t\t\ttmpArray = br.readLine().split(\" \");\n\t\t\tint from = Integer.parseInt(tmpArray[0]);\n\t\t\tint to = Integer.parseInt(tmpArray[1]);\n\t\t\tint c = Integer.parseInt(tmpArray[2]);\n\t\t\tint d = Integer.parseInt(tmpArray[3]);\n\t\t\t\n\t\t\taddEdge(from, to, c, d);\n\t\t\t\n\t\t}\n\n\t\tint result = minCostFlow(0, V - 1, f);\n\n\t\tSystem.out.println(result);\n\t\t\t\n\t}\n\t\n\tstatic int V;\n\tstatic Vector<Edge> G[];\n\tstatic int dist[];\n\tstatic int prevv[];\n\tstatic int preve[];\n\tstatic int h[];\n\n\tstatic void addEdge(int from, int to, int cap, int cost){\n\t\tG[from].add(new Edge(to, cap, cost, G[to].size()));\n\t\tG[to].add(new Edge(from, 0, -cost, G[from].size() - 1));\n\t}\n\n\tstatic int minCostFlow(int s, int t, int f){\n\t\tint res = 0;\n\n\t\tArrays.fill(h, 0);\n\t\t\n\t\twhile(f > 0){\n\t\t\t//dijkstra\n\t\t\tPriorityQueue<Dist> que = new PriorityQueue<Dist>();\n\t\t\t\n\t\t\tArrays.fill(dist, INF);\n\t\t\tdist[s] = 0;\n\t\t\tque.add(new Dist(0, s));\n\t\t\twhile(!que.isEmpty()){\n\t\t\t\tDist p = que.remove();\n\t\t\t\tint v = p.v;\n\t\t\t\tif(dist[v] < p.dist){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\n\t\t\t\tfor(int i = 0; i < G[v].size() ;i++){\n\t\t\t\t\tEdge e = G[v].get(i);\n\n\t\t\t\t\tif(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tque.add(new Dist(dist[e.to], e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(dist[t] == INF){\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor(int v=0; v < V; v++){\n\t\t\t\th[v] += dist[v];\n\t\t\t}\n\n\t\t\t//s-t間経路に沿って目一杯流す\n\t\t\tint d = f;\n\t\t\tfor(int v = t; v != s; v = prevv[v]){\n\t\t\t\td = Math.min(d, G[prevv[v]].get(preve[v]).cap);\n\t\t\t}\n\t\t\tf -= d;\n\t\t\tres += d * h[t];\n\t\t\tfor(int v = t; v != s; v = prevv[v]){\n\t\t\t\tEdge e = G[prevv[v]].get(preve[v]);\n\t\t\t\te.cap -= d;\n\t\t\t\tG[v].get(e.rev).cap += d;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\treturn res;\n\t}\n}\nclass Edge {\n\tint to, cap, cost, rev;\n\n\tEdge(int to, int cap, int cost, int rev){\n\t\tthis.to = to;\n\t\tthis.cap = cap;\n\t\tthis.cost = cost;\n\t\tthis.rev = rev;\n\t}\n}\n\nclass Dist implements Comparable<Dist>{\n\tint dist;\n\tint v;\n\t\n\tDist(int dist, int v){\n\t\tthis.dist = dist;\n\t\tthis.v = v;\n\t}\n\n\t//近い順に並べる\n\t@Override\n\tpublic int compareTo(Dist d) {\n\t\treturn this.dist - d.dist;\n\t}\n}\n", "#include <bits/stdc++.h>\n#define pb push_back\nusing namespace std;\nconst int INF=0x3f3f3f3f;\nconst int maxn=105;\n\nstruct Edge {\n\tint from,to,cap,flow,cost;\n\tEdge(int u,int v,int c,int f,int w):from(u),to(v),cap(c),flow(f),cost(w) {}\n};\n\nint n,m,tf;\nvector<Edge>edges;\nvector<int>G[maxn];\nbool inq[maxn];\nint d[maxn];\nint a[maxn];\nint p[maxn];\n\n\ninline void addedge (int u,int v,int c,int w) {\n\tedges.pb(Edge(u,v,c,0,w));\n\tedges.pb(Edge(v,u,0,0,-w));\n\tint id=edges.size()-2;\n\tG[u].pb(id);\n\tG[v].pb(id+1);\n}\n\ninline bool spfa (int s,int t,int& flow,int& cost) {\n\tfor (int i=0;i<n;i++) d[i]=INF;\n\td[s]=0; inq[s]=1; a[s]=max(0,tf-flow);\n\tqueue<int>q;\n\tq.push(s);\n\twhile (q.size()) {\n\t\tint u=q.front(); q.pop();\n\t\tinq[u]=0;\n\t\tfor (int id:G[u]) {\n\t\t\tEdge& e=edges[id];\n\t\t\tif (e.cap>e.flow && d[e.to]>d[u]+e.cost) {\n\t\t\t\td[e.to]=d[u]+e.cost;\n\t\t\t\tp[e.to]=id;\n\t\t\t\ta[e.to]=min(a[u],e.cap-e.flow);\n\t\t\t\tif (!inq[e.to]) {inq[e.to]=1;q.push(e.to);}\n\t\t\t}\n\t\t}\n\t}\n\tif (d[t]==INF) return 0;\n\tflow+=a[t];\n\tcost+=d[t]*a[t];\n\t// cout<<flow<<' '<<cost<<'\\n';\n\tfor (int u=t;u!=s;u=edges[p[u]].from) {\n\t\tedges[p[u]].flow+=a[t];\n\t\tedges[p[u]^1].flow-=a[t];\n\t}\n\treturn 1;\n}\n\ninline int mcmf (int s,int t) {\n\tint flow=0 , cost=0;\n\twhile (spfa(s,t,flow,cost) && flow<tf);\n\tif (flow<tf) return -1;\n\telse return cost;\n}\n\nint main() {\n\tcin>>n>>m>>tf;\n\tfor (int i=0;i<m;i++) {\n\t\tint u,v,c,w; cin>>u>>v>>c>>w;\n\t\taddedge(u,v,c,w);\n\t}\n\tcout<<mcmf(0,n-1)<<'\\n';\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct PrimalDual{\n const int INF = 1<<28;\n typedef pair<int,int> P;\n struct edge{\n int to,cap,cost,rev;\n edge(){}\n edge(int to,int cap,int cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n };\n\n int n;\n vector<vector<edge> > G;\n vector<int> h,dist,prevv,preve;\n\n PrimalDual(){}\n PrimalDual(int sz):n(sz),G(sz),h(sz),dist(sz),prevv(sz),preve(sz){}\n \n void add_edge(int from,int to,int cap,int cost){\n G[from].push_back(edge(to,cap,cost,G[to].size()));\n G[to].push_back(edge(from,0,-cost,G[from].size()-1));\n }\n\n int flow(int s,int t,int f){\n int res=0;\n fill(h.begin(),h.end(),0);\n while(f>0){\n priority_queue<P,vector<P>,greater<P> > que;\n fill(dist.begin(),dist.end(),INF);\n dist[s]=0;\n que.push(P(0,s));\n while(!que.empty()){\n P p=que.top();que.pop();\n int v=p.second;\n if(dist[v]<p.first) continue;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e=G[v][i];\n if(e.cap>0&&dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(P(dist[e.to],e.to));\n }\n }\n }\n if(dist[t]==INF) return -1;\n for(int v=0;v<n;v++) h[v]+=dist[v];\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return res;\n }\n};\n\nint main(){\n int v,e,f;\n cin>>v>>e>>f;\n PrimalDual pd(v);\n for(int i=0;i<e;i++){\n int u,v,c,d;\n cin>>u>>v>>c>>d;\n pd.add_edge(u,v,c,d);\n }\n cout<<pd.flow(0,v-1,f)<<endl;\n return 0;\n}\n", "#include<iostream>\nusing namespace std;\n//Minimum Cost Flow O(FE log V)\n#include<algorithm>\n#include<utility>\n#include<vector>\n#include<queue>\n#include<limits>\ntemplate<typename T>\nstruct MCF{\n\tvector<vector<pair<pair<int,int>,pair<int,T> > > >G;\n\tvector<T>h,d;\n\tvector<int>pv,pe;\n\tMCF(int n_=0):G(n_),h(n_,0),d(n_),pv(n_),pe(n_){}\n\tvoid add_edge(int from,int to,int cap,T cost)\n\t{\n\t\tG[from].push_back(make_pair(\n\t\t\tmake_pair(to,G[to].size()),make_pair(cap,cost)\n\t\t));\n\t\tG[to].push_back(make_pair(\n\t\t\tmake_pair(from,G[from].size()-1),make_pair(0,-cost)\n\t\t));\n\t}\n\tT min_cost_flow(int s,int t,int f)//ans or -1\n\t{\n\t\tT ret=0;\n\t\twhile(f>0)\n\t\t{\n\t\t\tpriority_queue<pair<T,int>,vector<pair<T,int> >,greater<pair<T,int> > >P;\n\t\t\tfill(d.begin(),d.end(),numeric_limits<T>::max());\n\t\t\td[s]=0;\n\t\t\tP.push(make_pair(0,s));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tpair<T,int>p=P.top();P.pop();\n\t\t\t\tif(d[p.second]<p.first)continue;\n\t\t\t\tfor(int i=0;i<G[p.second].size();i++)\n\t\t\t\t{\n\t\t\t\t\tpair<pair<int,int>,pair<int,T> >&e=G[p.second][i];\n\t\t\t\t\tif(e.second.first>0&&\n\t\t\t\t\t\td[e.first.first]>d[p.second]+e.second.second+h[p.second]-h[e.first.first])\n\t\t\t\t\t{\n\t\t\t\t\t\td[e.first.first]=d[p.second]+e.second.second+h[p.second]-h[e.first.first];\n\t\t\t\t\t\tpv[e.first.first]=p.second;\n\t\t\t\t\t\tpe[e.first.first]=i;\n\t\t\t\t\t\tP.push(make_pair(d[e.first.first],e.first.first));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d[t]==numeric_limits<T>::max())return -1;\n\t\t\tfor(int u=0;u<G.size();u++)h[u]+=d[u];\n\t\t\tint d=f;\n\t\t\tfor(int u=t;u!=s;u=pv[u])d=min(d,G[pv[u]][pe[u]].second.first);\n\t\t\tf-=d;\n\t\t\tret+=d*h[t];\n\t\t\tfor(int u=t;u!=s;u=pv[u])\n\t\t\t{\n\t\t\t\tG[pv[u]][pe[u]].second.first-=d;\n\t\t\t\tG[u][G[pv[u]][pe[u]].first.second].second.first+=d;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n};\nint main()\n{\n\tint N,E,F;\n\tcin>>N>>E>>F;\n\tMCF<int>mf(N);\n\tfor(int i=0;i<E;i++)\n\t{\n\t\tint u,v,c,d;cin>>u>>v>>c>>d;\n\t\tmf.add_edge(u,v,c,d);\n\t}\n\tcout<<mf.min_cost_flow(0,N-1,F)<<endl;\n}\n", "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\n//O(F*V^2)\n\nclass MinimumCostFlow {\nprivate:\n struct edge {\n int to, cap, cost, rev;\n };\n\n const int INF = 1e18;\n\n int V;\n vector<vector<edge>> G;\n vector<int> h, dist;\n vector<int> prevv, preve;\n\n void add_edge(int from, int to, int cap, int cost) {\n G[from].push_back({to, cap, cost, (int)G[to].size()});\n G[to].push_back({from, 0LL, -cost, (int)G[from].size() - 1LL});\n }\n\n int min_cost_flow(int s, int t, int f) {\n int res = 0;\n fill(h.begin(), h.end(), 0LL);\n\n while (f > 0) {\n using P = pair<int, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n fill(dist.begin(), dist.end(), INF);\n dist[s] = 0;\n que.push(P(0, s));\n\n while (!que.empty()) {\n P p = que.top();\n que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P{dist[e.to], e.to});\n }\n }\n }\n\n if (dist[t] == INF) {\n return -1;\n }\n\n for (int v = 0; v < V; v++) {\n h[v] += dist[v];\n }\n\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n\npublic:\n MinimumCostFlow(int N) : V(N), G(N, vector<edge>()), h(N), dist(N), prevv(N), preve(N) {}\n\n void addEdge(int from, int to, int cap, int cost) {\n return add_edge(from, to, cap, cost);\n }\n int minCostFlow(int s, int t, int f) {\n return min_cost_flow(s, t, f);\n }\n};\n\nsigned main() {\n int V, E, F;\n cin >> V >> E >> F;\n\n MinimumCostFlow mcf(V);\n\n for (int i = 0; i < E; i++) {\n int u, v, c, d;\n cin >> u >> v >> c >> d;\n mcf.addEdge(u, v, c, d);\n }\n\n cout << mcf.minCostFlow(0, V - 1, F) << endl;\n return 0;\n}\n\n", "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define rep(i,n) REP(i,0,n)\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\n#define repr(i, n) REPR(i, n, 0)\n#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)\n#define pb push_back\n#define all(r) r.begin(),r.end()\n#define rall(r) r.rbegin(),r.rend()\n#define fi first\n#define se second\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n \nconst int INF = 1e9;\nconst ll MOD = 1e9 + 7;\ndouble EPS = 1e-8;\n\n// ????°??????¨??? O(F |E| |V|)\nstruct MinCostFlow\n{\n typedef pair<int, int> P; // first -> minDist, second -> v\n struct Edge\n {\n int to, cap, cost, rev;\n };\n const int V;\n vector<vector<Edge>> G;\n vector<int> dist, prevv, preve;\n MinCostFlow(int v) : V(v), G(v), dist(v), prevv(v), preve(v){}\n void add_edge(int from, int to, int cap, int cost) {\n G[from].push_back({to, cap, cost, (int)G[to].size()});\n G[to].push_back({from, 0, -cost, (int)G[from].size()-1});\n }\n // minCostFlow s -> t\n // noexist flow return -1\n int min_cost_flow(int s, int t, int f) {\n int res = 0;\n while(f > 0) {\n for(int i = 0; i < V; ++i) dist[i] = INF;\n dist[s] = 0;\n bool update = true;\n while(update) {\n update = false;\n for(int v = 0; v < V; ++v) {\n if(dist[v] == INF) continue;\n for(int i = 0; i < G[v].size(); ++i) {\n Edge& e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n if(dist[t] == INF) return -1;\n int d = f;\n for(int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for(int v = t; v != s; v = prevv[v]) {\n Edge& e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n } \n};\n\n\nint main(){\n int V, E, F;\n cin >> V >> E >> F;\n MinCostFlow f(V);\n rep(i, E) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n f.add_edge(a, b, c, d);\n }\n cout << f.min_cost_flow(0, V-1, F) << endl;\n return 0;\n}", "//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B&lang=jp\n\n#include <iostream>\n#include <map>\n#include <queue>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\ntypedef pair<int, int>P;\n\nclass MCF{\npublic:\n\tclass edge{\n\tpublic:\n\t\tint to, cap, cost, rev;\n\t\tedge(){};\n\t\tedge(int _to, int _cap, int _cost, int _rev){\n\t\t\tto = _to;\n\t\t\tcap = _cap;\n\t\t\tcost = _cost;\n\t\t\trev = _rev;\n\t\t}\n\t};\n\n\tvector<vector<edge> >G;\n\tvector<int>h;\n\tvector<int>dist;\n\tvector<int>prevv;\n\tvector<int>preve;\n\tMCF(int n){\n\t\tG.resize(n);\n\t\tpreve.resize(n, 0);\n\t\tprevv.resize(n, 0);\n\t}\n\tvoid addEdge(int from, int to, int cap, int cost){\n\t\tG[from].push_back(edge(to, cap, cost, G[to].size()));\n\t\tG[to].push_back(edge(from, 0, -cost, G[from].size() - 1));\n\t}\n\tint flow(int s, int t, int f){\n\t\tint res = 0;\n\t\th.clear();\n\t\th.resize(G.size(), 0);\n\t\twhile (f > 0){\n\t\t\tpriority_queue<P, vector<P>, greater<P> >que;\n\t\t\tdist.clear();\n\t\t\tdist.resize(G.size(), 1145141919);\n\t\t\tdist[s] = 0;\n\t\t\tque.push(P(0, s));\n\t\t\twhile (!que.empty()){\n\t\t\t\tP p = que.top();\n\t\t\t\tque.pop();\n\t\t\t\tint v = p.second;\n\t\t\t\tif (dist[v] < p.first)continue;\n\t\t\t\tfor (int i = 0; i < G[v].size(); i++){\n\t\t\t\t\tedge &e = G[v][i];\n\t\t\t\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tque.push(P(dist[e.to], e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[t] == 1145141919){\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor (int v = 0; v < G.size(); v++)h[v] += dist[v];\n\t\t\tint d = f;\n\t\t\tfor (int v = t; v != s; v = prevv[v]){\n\t\t\t\td = min(d, G[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= d;\n\t\t\tres += d*h[t];\n\t\t\tfor (int v = t; v != s; v = prevv[v]){\n\t\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tG[v][e.rev].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\n\nint main(){\n\n\tint V, E, F;\n\tcin >> V >> E >> F;\n\tMCF mcf(V);\n\tfor (int i = 0; i < E; i++){\n\t\tint from, to, cap, cost;\n\t\tcin >> from >> to >> cap >> cost;\n\t\tmcf.addEdge(from, to, cap, cost);\n\t}\n\tcout << mcf.flow(0, V - 1, F) << endl;\n\n\treturn 0;\n}\n", "from heapq import heappush, heappop\nimport collections\n\n\nclass MinCostFlowDijkstra:\n def __init__(self, N):\n self.N = N\n self.edges = collections.defaultdict(list)\n\n def add(self, fro, to, cap, cost, directed=True):\n # edge[fro]: to, cap, cost, rev(逆辺)\n if directed:\n self.edges[fro].append([to, cap, cost, len(self.edges[to])])\n self.edges[to].append([fro, 0, -cost, len(self.edges[fro]) - 1])\n else: # TODO: must be Verified\n self.edges[fro].append([to, cap, cost, len(self.edges[to])])\n self.edges[to].append([fro, 0, -cost, len(self.edges[fro]) - 1])\n self.edges[to].append([fro, cap, cost, len(self.edges[fro])])\n self.edges[fro].append([to, 0, -cost, len(self.edges[to]) - 1])\n\n def minCostFlow(self, start, goal, flow):\n res = 0\n potential = collections.defaultdict(int)\n prevVertex = collections.defaultdict(int)\n prevEdge = collections.defaultdict(int)\n\n while flow > 0:\n dist = collections.defaultdict(lambda: float('inf'))\n dist[start] = 0\n que = []\n heappush(que, (0, start))\n\n while que:\n k, v = heappop(que)\n if dist[v] < k:\n continue\n for i, (to, cap, cost, _) in enumerate(self.edges[v]):\n if cap > 0 and dist[to] > dist[v] + cost + potential[v] - potential[to]:\n dist[to] = dist[v] + cost + potential[v] - potential[to]\n prevVertex[to] = v\n prevEdge[to] = i\n heappush(que, (dist[to], to))\n if dist[goal] == float('inf'):\n return -1\n\n for i in range(self.N):\n potential[i] += dist[i]\n\n d = flow\n v = goal\n while v != start:\n d = min(d, self.edges[prevVertex[v]][prevEdge[v]][1])\n v = prevVertex[v]\n flow -= d\n res += d * potential[goal]\n v = goal\n while v != start:\n e = self.edges[prevVertex[v]][prevEdge[v]]\n e[1] -= d\n self.edges[v][e[3]][1] += d\n v = prevVertex[v]\n #print(d, flow, prevVertex, prevEdge)\n return res\n\n\nV, E, F = map(int, input().split())\ngraph = MinCostFlowDijkstra(V)\nfor _ in range(E):\n u, v, c, d = map(int, input().split())\n graph.add(u, v, c, d)\n\nprint(graph.minCostFlow(0, V-1, F))\n", "#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n\n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}\n\nusing ll = long long;\nusing R = long double;\nconst R EPS = 1e-9; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R& r) {return (r > EPS) - (r < -EPS);}\ninline R sq(R x) {return sqrt(max<R>(x, 0.0));}\n\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\n// Problem Specific Parameter:\n\n//Appropriately Changed\nusing W = ll;\nusing edge = struct {int to, rev; W cap, flow, cost;};\nusing G = vector<vector<edge>>;\n\n//Appropriately Changed\nvoid add_edge(G &graph, int from, int to, W cap, W cost) {\n\tgraph[from].push_back({to, int(graph[to].size()) , cap , 0 , cost});\n\tgraph[to].push_back({from, int(graph[from].size()) - 1, 0 , 0, -cost});\n}\n\n// Description: ??°??????????????????????°??????¨???\n// TimeComplexity: $ \\mathcal{O}(FEV) $\n// Verifyed: AOJ GRL_6_B\n\nW primal_dual(G &graph, int s, int t, int f) {\n\tconst W inf = 1LL << 50;\n\tW res = 0;\n\twhile (f) {\n\t\tint n = graph.size(), update;\n\t\tvector<W> dist(n, inf);\n\t\tvector<int> pv(n, 0), pe(n, 0);\n\t\tdist[s] = 0;\n\n\t\trep(loop, n) {\n\t\t\tupdate = false;\n\t\t\trep(v, n)rep(i, graph[v].size()) {\n\t\t\t\tedge &e = graph[v][i];\n\t\t\t\tif (e.cap > e.flow and chmin(dist[e.to], dist[v] + e.cost)) {\n\t\t\t\t\tpv[e.to] = v, pe[e.to] = i;\n\t\t\t\t\tupdate = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!update) break;\n\t\t}\n\n\t\tif (dist[t] == inf) return -1;\n\n\t\tW d = f;\n\t\tfor (int v = t; v != s; v = pv[v]) chmin(d, graph[pv[v]][pe[v]].cap - graph[pv[v]][pe[v]].flow);\n\t\tf -= d, res += d * dist[t];\n\n\t\tfor (int v = t; v != s; v = pv[v]) {\n\t\t\tedge &e = graph[pv[v]][pe[v]];\n\t\t\te.flow += d;\n\t\t\tgraph[v][e.rev].flow -= d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(void) {\n\tint v, e, f;\n\tcin >> v >> e >> f;\n\tG graph(v);\n\n\trep(i, e) {\n\t\tint a, b, c, d;\n\t\tcin >> a >> b >> c >> d;\n\t\tadd_edge(graph, a, b, c, d);\n\t}\n\n\tcout << primal_dual(graph, 0, v - 1, f) << endl;\n\treturn 0;\n}", "#include<bits/stdc++.h>\n#define fi first\n#define se second\ntypedef long long ll;\nusing namespace std;\n\n//BEGIN CUT HERE\n//Min_cost_flow\nclass Min_cost_flow{\npublic:\n explicit Min_cost_flow(int n):vertex(static_cast<unsigned int>(n+10)){\n G.resize(vertex);\n prev_e.resize(vertex);\n prev_v.resize(vertex);\n }\n\n void add_edge(int from,int to,ll cap,ll cost){\n G[from].push_back((edge){to, cap, cost, static_cast<int>(G[to].size())});\n G[to].push_back((edge){from, 0, -cost, static_cast<int>(G[from].size() - 1)});\n }\n\n ll flow(int s,int t,ll f){\n ll res=0;\n h.clear();\n h.resize(vertex,0);\n while(f>0){\n vector<ll> dist;\n dist.resize(vertex);\n dist=dijkstra(s);\n if(dist[t]==INF)return -1;\n for(int i=0;i<vertex;i++)h[i]+=dist[i];\n ll d=f;\n for(int i=t;i!=s;i=prev_v[i]){\n d=min(d,G[prev_v[i]][prev_e[i]].cap);\n }\n f-=d;\n res+=d*h[t];\n for(int i=t;i!=s;i=prev_v[i]){\n edge &e=G[prev_v[i]][prev_e[i]];\n e.cap-=d;\n G[i][e.rev].cap+=d;\n }\n }\n return res;\n }\nprivate:\n struct edge{\n int to;\n ll cap;\n ll cost;\n int rev;\n };\n\n unsigned int vertex;\n ll INF=(ll)1e16;\n vector<vector<edge> > G;\n vector<ll> h;\n vector<int> prev_v,prev_e;\n\n vector<ll> dijkstra(int start){\n vector<ll> dist(vertex,INF);\n dist[start]=0;\n priority_queue<pair<ll,int> > q;\n q.push({0,start});\n while(!q.empty()){\n int now=q.top().se;\n ll now_cost=-q.top().fi;\n q.pop();\n if(now_cost>dist[now])continue;\n for(int i=0;i<(int)G[now].size();i++){\n edge &e=G[now][i];\n if(e.cap>0 && dist[e.to]>dist[now]+e.cost+h[now]-h[e.to]){\n dist[e.to]=dist[now]+e.cost+h[now]-h[e.to];\n prev_v[e.to]=now;\n prev_e[e.to]=i;\n q.push({-dist[e.to],e.to});\n }\n }\n }\n return dist;\n }\n};\n\n\nint main(){\n int v,e,f;cin>>v>>e>>f;\n Min_cost_flow m(v);\n for(int i=0;i<e;i++){\n int from,to,cap,cost;\n cin>>from>>to>>cap>>cost;\n m.add_edge(from,to,cap,cost);\n }\n cout<<m.flow(0,v-1,f)<<endl;\n}\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools\nimport time,random\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9+7\nmod2 = 998244353\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\ndef pe(s): return print(str(s), file=sys.stderr)\ndef JA(a, sep): return sep.join(map(str, a))\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\n\nclass Edge():\n def __init__(self,t,f,r,ca,co):\n self.to = t\n self.fron = f\n self.rev = r\n self.cap = ca\n self.cost = co\n\nclass MinCostFlow():\n size = 0\n graph = []\n\n def __init__(self, s):\n self.size = s\n self.graph = [[] for _ in range(s)]\n\n def add_edge(self, f, t, ca, co):\n self.graph[f].append(Edge(t, f, len(self.graph[t]), ca, co))\n self.graph[t].append(Edge(f, t, len(self.graph[f])-1, 0, -co))\n\n def min_path(self, s, t):\n dist = [inf] * self.size\n route = [None] * self.size\n que = collections.deque()\n inq = [False] * self.size\n dist[s] = 0\n que.append(s)\n inq[s] = True\n while que:\n u = que.popleft()\n inq[u] = False\n for e in self.graph[u]:\n if e.cap == 0:\n continue\n v = e.to\n if dist[v] > dist[u] + e.cost:\n dist[v] = dist[u] + e.cost\n route[v] = e\n if not inq[v]:\n que.append(v)\n inq[v] = True\n\n if dist[t] == inf:\n return inf, 0\n\n flow = inf\n v = t\n while v != s:\n e = route[v]\n if flow > e.cap:\n flow = e.cap\n v = e.fron\n\n c = 0\n v = t\n while v != s:\n e = route[v]\n e.cap -= flow\n self.graph[e.to][e.rev].cap += flow\n c += e.cost * flow\n v = e.fron\n\n return dist[t], flow\n\n def calc_min_cost_flow(self, s, t, flow):\n total_cost = 0\n while flow > 0:\n c,f = self.min_path(s, t)\n if f == 0:\n return inf\n f = min(flow, f)\n total_cost += c * f\n flow -= f\n\n return total_cost\n\n\ndef main():\n n,m,f = LI()\n uvcd = [LI() for _ in range(m)]\n\n mf = MinCostFlow(n)\n for u,v,c,d in uvcd:\n mf.add_edge(u,v,c,d)\n\n r = mf.calc_min_cost_flow(0, n-1, f)\n if r == inf:\n return -1\n\n return r\n\n# start = time.time()\nprint(main())\n# pe(time.time() - start)\n\n\n\n\n", "#include <bits/stdc++.h>\nstatic const int MAX=100;\nstatic const int INFTY=(1<<30);\nclass edge{\npublic:\n int target, cap, cost, rev;\n edge(int target = 0, int cap =0, int cost = 0, int rev =0) : target(target), cap(cap), cost(cost), rev(rev) {}\n};\nint V;\nstd::vector<edge> G[MAX];\nint h[MAX], dist[MAX], prevv[MAX], preve[MAX];\n\nvoid add_edge(const int &source, const int &target, const int &cap, const int &cost) {\n G[source].push_back(edge(target, cap, cost, G[target].size()));\n G[target].push_back(edge(source, 0, -cost, G[source].size()-1));\n}\n\nint min_cost_flow(int s, int t, int f) {\n int res = 0;\n std::fill(h, h+V, 0);\n while(f > 0) {\n std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int> >, std::greater<std::pair<int, int> > > pq;\n std::fill(dist, dist + V, INFTY);\n dist[s] = 0;\n pq.push({0, s});\n while (!pq.empty()) {\n std::pair<int, int> p = pq.top(); pq.pop();\n int current = p.second;\n if (dist[current] < p.first) continue;\n for (int i = 0; i < G[current].size(); i++) {\n edge &e = G[current][i];\n if (e.cap > 0 && dist[e.target] > dist[current] + e.cost + h[current] - h[e.target]) {\n dist[e.target] = dist[current] + e.cost + h[current] - h[e.target];\n prevv[e.target] = current; preve[e.target] = i;\n pq.push({dist[e.target], e.target});\n }\n }\n }\n if (dist[t] == INFTY) return -1;\n for (int v = 0; v < V; v++) h[v] += dist[v];\n\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = std::min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v!=s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main()\n{\n int E, f, source, target, cap, cost;\n std::scanf(\"%d %d %d\", &V, &E, &f);\n for (int i = 0; i < E; i++) {\n std::scanf(\"%d %d %d %d\", &source, &target, &cap, &cost);\n add_edge(source, target, cap, cost);\n }\n std::printf(\"%d\\n\", min_cost_flow(0, V-1, f));\n return 0;\n}\n\n", "#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <algorithm>\n#include <sstream>\n#include <cmath>\n#include <set>\n#include <iomanip>\n#include <deque>\n#include <stdio.h>\nusing namespace std;\n \n#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)\n#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)\n#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())\ntypedef long long ll;\n\ntemplate<class T> struct MinCostFlow {\n struct Edge {\n int to, rev;\n T cap, cost;\n Edge () {}\n Edge (int _to, T _cap, T _cost, int _rev) :\n to(_to), cap(_cap), cost(_cost), rev(_rev) {}\n };\n const T INF = numeric_limits<T>::max() / 2;\n int N;\n vector< vector<Edge> > G;\n vector<T> h;\n vector<T> dist;\n vector<int> prevv, preve;\n MinCostFlow (int n) : N(n), G(n), h(n), dist(n), prevv(n), preve(n) {}\n\n void add_edge(int from, int to, T cap, T cost) {\n G[from].push_back(Edge(to,cap,cost,G[to].size()));\n G[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n }\n\n T get_min(int s, int t, T f) {\n T ret = 0;\n for (int i=0; i<N; i++) h[i] = 0;\n while (f > 0) {\n priority_queue< pair<T,int>, vector< pair<T,int> >, greater< pair<T,int> > > que;\n for (int i=0; i<N; i++) dist[i] = INF;\n dist[s] = 0;\n que.push(make_pair(0,s));\n while (que.size() != 0) {\n pair<int,int> p = que.top();\n que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i=0; i<G[v].size(); i++) {\n Edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(make_pair(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INF) {\n return -1;\n }\n for (int v=0; v<N; v++) h[v] += dist[v];\n int d = f;\n for (int v=t; v!=s; v=prevv[v]) {\n d = min(d,G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n ret += d * h[t];\n for (int v=t; v!=s; v=prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return ret;\n }\n};\n\nint main() {\n\n int V,E,F;\n cin >> V >> E >> F;\n MinCostFlow<int> inst(110);\n\n REP(i,E) {\n int a,b,c,d;\n cin >> a >> b >> c >> d;\n inst.add_edge(a,b,c,d);\n }\n\n cout << inst.get_min(0,V-1,F) << endl;\n\n return 0;\n}", "#include <cassert>\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <utility>\n#include <tuple>\n#include <limits>\nusing namespace std;\n\nstruct MinCostFlowGraph {\nprivate:\n using ll = long long;\n struct edge {\n int to;\n ll cap, cost;\n int r_idx;\n edge(int t, ll cap, ll cost, int r) :\n to(t), cap(cap), cost(cost), r_idx(r) {}\n };\n vector<vector<edge>> G;\n int sz;\npublic:\n MinCostFlowGraph(int n) : G(n), sz(n) {}\n\n void add_edge(int from, int to, ll cap, ll cost){\n int i = G[to].size(), i_ = G[from].size();\n G[from].emplace_back(to,cap,cost,i);\n G[to].emplace_back(from,0,-cost,i_);\n }\n ll min_cost_flow(int from, int to, ll f){\n ll ans = 0;\n while(f > 0){\n const ll INF = numeric_limits<ll>::max();\n vector<ll> dist(sz,INF);\n dist[from] = 0;\n vector<ll> potential(sz);\n vector<int> prev_v(sz,-1);\n vector<int> prev_e(sz,-1);\n priority_queue<pair<ll,int>> pq;\n pq.emplace(0,from);\n while(pq.size()){\n // auto [d, v] = pq.top();\n ll d, v;\n tie(d,v) = pq.top();\n d *= -1;\n pq.pop();\n if(dist[v] < d) continue;\n for(size_t i = 0; i < G[v].size(); ++i){\n const auto& e = G[v][i];\n if(e.cap == 0) continue;\n int v_ = e.to;\n ll d_ = d + e.cost + potential[v] - potential[v_];\n if(dist[v_] <= d_)\n continue;\n dist[v_] = d_;\n prev_v[v_] = v;\n prev_e[v_] = i;\n pq.emplace(-d_,e.to);\n }\n }\n if(dist[to] >= INF) return -1;\n for(int i = 0; i < sz; ++i)\n potential[i] += dist[i];\n int v = to;\n ll flow = f;\n while(v != from){\n int v_ = prev_v[v];\n flow = min(flow,G[v_][prev_e[v]].cap);\n v = v_;\n }\n v = to;\n while(v != from){\n int v_ = prev_v[v];\n auto& e = G[v_][prev_e[v]];\n e.cap -= flow;\n ans += flow*e.cost;\n G[v][e.r_idx].cap += flow;\n v = v_;\n }\n f -= flow;\n }\n return ans;\n }\n};\n\nint main(){\n int n, m, f;\n cin >> n >> m >> f;\n MinCostFlowGraph G(n);\n for(int i = 0; i < m; ++i){\n long long u, v, c, d;\n cin >> u >> v >> c >> d;\n G.add_edge(u,v,c,d);\n }\n cout << G.min_cost_flow(0,n-1,f) << endl;\n}\n\n", "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename T, T INF>\nclass MinCostFlow{\npublic:\n //辺を表す構造体(行き先、容量、コスト、逆辺)\n \n struct edge{\n int to,cap;\n T cost;\n int rev;\n edge();\n edge(int to,int cap,T cost,int rev):to(to),cap(cap),cost(cost),rev(rev){}\n };\n \n int V; //頂点数\n vector<vector<edge> > G; //グラフの隣接リスト表現\n vector<T> dist; //最短距離\n vector<int> prevv,preve; //直前の頂点と辺\n\n MinCostFlow():V(-1){}\n MinCostFlow(int V):V(V), G(V), dist(V), prevv(V), preve(V){};\n \n // fromからtoへ向かう容量cap、コストcostの辺をグラフに追加する。\n void add_edge(int from,int to,int cap ,T cost){\n assert(from>=0 && to >= 0);\n assert(from<V && to<V);\n G[from].push_back((edge){to,cap,cost,(int)G[to].size()});\n G[to].push_back((edge){from,0,-cost,(int)G[from].size()-1});\n }\n \n //sからtへの流量fの最小費用流を求める\n //流せない場合-1を返す\n T flow(int s, int t, int f){\n T res = 0;\n\n while(f>0){\n //ベルマンフォード法により,s-t間最短路を求める\n fill(dist.begin(),dist.end(),INF);\n dist[s] = 0;\n bool update = true;\n while(update){\n update = false;\n for(int v=0; v<V ;v++){\n if(dist[v]==INF) continue;\n for(int i=0; i<(int)G[v].size(); i++){\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n if(abs(dist[e.to] - dist[v] - e.cost) < 1e-8) continue; //double演算用\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n\n if(dist[t]==INF) return -1; //これ以上流せない。\n \n //s−t間短路に沿って目一杯流す\n int d = f;\n for(int v=t; v!=s; v=prevv[v]) d = min(d, G[prevv[v]][preve[v]].cap);\n f -= d;\n res += d * dist[t];\n for(int v=t; v!=s; v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\n\nint main(){\n int V, E, F;\n cin>>V>>E>>F;\n\n MinCostFlow<long long, 1LL<<55> f(V);\n for(int i=0;i<E;i++){\n int u, v, c, d;\n cin>>u>>v>>c>>d;\n f.add_edge(u, v, c, d);\n }\n\n int ans = f.flow(0, V-1, F);\n cout<<ans<<endl;\n\n}\n\n" ]