Dataset Viewer
question_id
int64 41
56.8k
| question_title
stringlengths 5
37
| question_content
stringlengths 206
4.02k
| dataset
stringclasses 1
value | difficulty
stringclasses 3
values | java
dict | java15
dict | java8
dict | python
dict | test_cases
stringlengths 28
2.49M
| max_retries
float64 1
3
⌀ |
|---|---|---|---|---|---|---|---|---|---|---|
5,396 |
Fibonacci LCM
|
After Derek (of district 5) discovered how to compute the greatest common divisor (gcd) of Fibonacci numbers, he now tried to answer the next obvious question: how does one compute the *least common multiple* (lcm) of Fibonacci numbers? Unfortunately, Derek found out that this wasn't as easy as the original problem, so he asked you to answer it for him.
The Fibonacci numbers are defined as:
$$F_1 = F_2 = 1$$
$$F_n = F_{n-1} + F_{n-2}$$
Given $N$ integers $a_1, a_2, \ldots, a_N$, find $\text{lcm}(F_{a_1},F_{a_2},\ldots,F_{a_N})$, and give your answer modulo $10^9+7$.
**Input Format**
The first line of input contains $N$.
Each of the next $N$ lines contains a number: the $i^{\text{th}}$ line contains $a_i$.
**Constraints**
$1 \le N \le 100$
$1 \le a_i \le 10^9$
**Output Format**
Print a single integer, which is the least common multiple of the $F_{a_i}$, modulo $10^9+7$.
**Sample Input**
5
1
3
3
6
9
**Sample Output**
136
**Explanation**
$\text{lcm}(F_1,F_3,F_3,F_6,F_9) = \text{lcm}(1,2,2,8,34) = 136$
|
hackerrank
|
Hard
|
{
"class_name": "Result",
"func_sign": [
"public static int solve(List<Integer> f)"
],
"script_name": "Solution",
"solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static InputReader in;\n private static PrintWriter out;\n \npublic static int mod = 1000000007;\n\npublic static int gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a % b);\n}\n\npublic static long inv (long N, long M) {\n long x = 0, lastx = 1, y = 1, lasty = 0, q, t, a = N, b = M;\n while (b != 0) {\n q = a / b; t = a % b; a = b; b = t;\n t = x; x = lastx - q * x; lastx = t;\n t = y; y = lasty - q * y; lasty = t;\n }\n return (lastx + M) % M;\n}\n \n private static long [][] mat_exp (long [][] A, long e) {\n if (e == 1)\n return A;\n else if (e % 2 == 0) {\n long [][] A1 = mat_exp (A, e / 2);\n return matrix_mult (A1, A1);\n } else\n return matrix_mult (A, mat_exp (A, e - 1));\n}\n\n private static long [][] matrix_mult (long [][] A, long [][] B) {\n long [][] C = new long [A.length] [A.length];\n for (int i = 0; i < A.length; i++)\n for (int j = 0; j < A.length; j++)\n for (int k = 0; k < A.length; k++)\n C[i][k] = (C[i][k] + A[i][j] * B[j][k]) % mod;\n return C;\n }\n \n public static long fib(long N) {\n if (N <= 2) return 1;\n long[][] mat = new long[][] {{1,1},{1,0}};\n mat = mat_exp(mat, N-2);\n return (mat[0][0] + mat[0][1]) % mod;\n }\n\n public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out, true);\n \n int N = in.nextInt();\n ArrayList<Integer> num = new ArrayList<Integer>();\n ArrayList<Integer> den = new ArrayList<Integer>();\n while (N-- > 0) {\n int a = in.nextInt();\n if (a == 1) continue;\n \n ArrayList<Integer> add1 = new ArrayList<Integer>();\n add1.add(a);\n \n ArrayList<Integer> add2 = new ArrayList<Integer>();\n for (int k : num) {\n int r = gcd(k, a);\n if (r > 1) add2.add(r);\n }\n \n for (int k : den) {\n int r = gcd(k, a);\n if (r > 1) add1.add(r);\n }\n Collections.sort(add1);\n Collections.sort(add2);\n \n for (int i = 0; i < num.size(); i++) {\n int k = Collections.binarySearch(add2, num.get(i));\n if (k < 0) continue;\n num.remove(i); i--;\n add2.remove(k);\n }\n \n for (int i = 0; i < den.size(); i++) {\n int k = Collections.binarySearch(add1, den.get(i));\n if (k < 0) continue;\n den.remove(i); i--;\n add1.remove(k);\n }\n \n num.addAll(add1);\n den.addAll(add2);\n\n Collections.sort(num);\n Collections.sort(den);\n }\n long ret = 1;\n for (int k : num) ret = (ret * fib(k)) % mod;\n for (int k : den) ret = (ret * inv(fib(k), mod)) % mod;\n out.println(ret);\n out.close();\n System.exit(0);\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",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts INTEGER_ARRAY f as parameter.\n */\n\n public static int solve(List<Integer> f) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int fCount = Integer.parseInt(bufferedReader.readLine().trim());\n\n List<Integer> f = new ArrayList<>();\n\n for (int i = 0; i < fCount; i++) {\n int fItem = Integer.parseInt(bufferedReader.readLine().trim());\n f.add(fItem);\n }\n\n int result = Result.solve(f);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"solution": "import java.io.*;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class HR_fibonacci_lcm {\n\n final static long MOD = 1000000007;\n final static long MOD2 = 1000000006;\n\n static long[][] mul(long[][] a, long[][] b) {\n long[][] c = new long[a.length][a.length];\n for (int i = 0; i < a.length; ++i) {\n for (int j = 0; j < a.length; ++j) {\n for (int k = 0; k < a.length; ++k) {\n c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % MOD;\n }\n }\n }\n return c;\n }\n\n static long[][] pow(long[][] a, long pow) {\n long[][] r = new long[a.length][a.length];\n for (int i = 0; i < a.length; ++i) {\n r[i][i] = 1;\n }\n while (pow > 0) {\n if (pow % 2 == 1) {\n r = mul(r, a);\n }\n pow /= 2;\n a = mul(a, a);\n }\n return r;\n }\n\n static long modPow(long x, long pow) {\n long r = 1;\n while (pow > 0) {\n if (pow % 2 == 1) {\n r = (r * x) % MOD;\n }\n pow /= 2;\n x = (x * x) % MOD;\n }\n return r;\n }\n\n static long fib(long n) {\n return pow(new long[][] {{0, 1}, {1, 1}}, n)[0][1];\n }\n\n public static void solve(Input in, PrintWriter out) throws IOException {\n int n = in.nextInt();\n HashMap<Long, Long> coeffs = new HashMap<>();\n coeffs.put(0L, MOD2 - 1);\n for (int i = 0; i < n; ++i) {\n long a = in.nextLong();\n HashMap<Long, Long> coeffs1 = new HashMap<>(coeffs);\n for (Map.Entry<Long, Long> e : coeffs.entrySet()) {\n long v = gcd(a, e.getKey());\n coeffs1.put(v, ((coeffs1.containsKey(v) ? coeffs1.get(v) : 0) + MOD2 - e.getValue()) % MOD2);\n }\n coeffs = coeffs1;\n }\n long ans = 1;\n for (Map.Entry<Long, Long> e : coeffs.entrySet()) {\n if (e.getKey() == 0) {\n continue;\n }\n ans = (ans * modPow(fib(e.getKey()), e.getValue())) % MOD;\n }\n out.println(ans);\n }\n\n private static long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n public static void main(String[] args) throws IOException {\n PrintWriter out = new PrintWriter(System.out);\n solve(new Input(new BufferedReader(new InputStreamReader(System.in))), out);\n out.close();\n }\n\n static class Input {\n BufferedReader in;\n StringBuilder sb = new StringBuilder();\n\n public Input(BufferedReader in) {\n this.in = in;\n }\n\n public Input(String s) {\n this.in = new BufferedReader(new StringReader(s));\n }\n\n public String next() throws IOException {\n sb.setLength(0);\n while (true) {\n int c = in.read();\n if (c == -1) {\n return null;\n }\n if (\" \\n\\r\\t\".indexOf(c) == -1) {\n sb.append((char)c);\n break;\n }\n }\n while (true) {\n int c = in.read();\n if (c == -1 || \" \\n\\r\\t\".indexOf(c) != -1) {\n break;\n }\n sb.append((char)c);\n }\n return sb.toString();\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}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts INTEGER_ARRAY f as parameter.\n */\n\n public static int solve(List<Integer> f) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "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\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int fCount = Integer.parseInt(bufferedReader.readLine().trim());\n\n List<Integer> f = IntStream.range(0, fCount).mapToObj(i -> {\n try {\n return bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\");\n } catch (IOException ex) {\n throw new RuntimeException(ex);\n }\n })\n .map(String::trim)\n .map(Integer::parseInt)\n .collect(toList());\n\n int result = Result.solve(f);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"solution": "import java.io.*;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class HR_fibonacci_lcm {\n\n final static long MOD = 1000000007;\n final static long MOD2 = 1000000006;\n\n static long[][] mul(long[][] a, long[][] b) {\n long[][] c = new long[a.length][a.length];\n for (int i = 0; i < a.length; ++i) {\n for (int j = 0; j < a.length; ++j) {\n for (int k = 0; k < a.length; ++k) {\n c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % MOD;\n }\n }\n }\n return c;\n }\n\n static long[][] pow(long[][] a, long pow) {\n long[][] r = new long[a.length][a.length];\n for (int i = 0; i < a.length; ++i) {\n r[i][i] = 1;\n }\n while (pow > 0) {\n if (pow % 2 == 1) {\n r = mul(r, a);\n }\n pow /= 2;\n a = mul(a, a);\n }\n return r;\n }\n\n static long modPow(long x, long pow) {\n long r = 1;\n while (pow > 0) {\n if (pow % 2 == 1) {\n r = (r * x) % MOD;\n }\n pow /= 2;\n x = (x * x) % MOD;\n }\n return r;\n }\n\n static long fib(long n) {\n return pow(new long[][] {{0, 1}, {1, 1}}, n)[0][1];\n }\n\n public static void solve(Input in, PrintWriter out) throws IOException {\n int n = in.nextInt();\n HashMap<Long, Long> coeffs = new HashMap<>();\n coeffs.put(0L, MOD2 - 1);\n for (int i = 0; i < n; ++i) {\n long a = in.nextLong();\n HashMap<Long, Long> coeffs1 = new HashMap<>(coeffs);\n for (Map.Entry<Long, Long> e : coeffs.entrySet()) {\n long v = gcd(a, e.getKey());\n coeffs1.put(v, ((coeffs1.containsKey(v) ? coeffs1.get(v) : 0) + MOD2 - e.getValue()) % MOD2);\n }\n coeffs = coeffs1;\n }\n long ans = 1;\n for (Map.Entry<Long, Long> e : coeffs.entrySet()) {\n if (e.getKey() == 0) {\n continue;\n }\n ans = (ans * modPow(fib(e.getKey()), e.getValue())) % MOD;\n }\n out.println(ans);\n }\n\n private static long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n public static void main(String[] args) throws IOException {\n PrintWriter out = new PrintWriter(System.out);\n solve(new Input(new BufferedReader(new InputStreamReader(System.in))), out);\n out.close();\n }\n\n static class Input {\n BufferedReader in;\n StringBuilder sb = new StringBuilder();\n\n public Input(BufferedReader in) {\n this.in = in;\n }\n\n public Input(String s) {\n this.in = new BufferedReader(new StringReader(s));\n }\n\n public String next() throws IOException {\n sb.setLength(0);\n while (true) {\n int c = in.read();\n if (c == -1) {\n return null;\n }\n if (\" \\n\\r\\t\".indexOf(c) == -1) {\n sb.append((char)c);\n break;\n }\n }\n while (true) {\n int c = in.read();\n if (c == -1 || \" \\n\\r\\t\".indexOf(c) != -1) {\n break;\n }\n sb.append((char)c);\n }\n return sb.toString();\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}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts INTEGER_ARRAY f as parameter.\n */\n\n public static int solve(List<Integer> f) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "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\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int fCount = Integer.parseInt(bufferedReader.readLine().trim());\n\n List<Integer> f = IntStream.range(0, fCount).mapToObj(i -> {\n try {\n return bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\");\n } catch (IOException ex) {\n throw new RuntimeException(ex);\n }\n })\n .map(String::trim)\n .map(Integer::parseInt)\n .collect(toList());\n\n int result = Result.solve(f);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"class_name": null,
"func_sign": [
"solve(f)"
],
"solution": "import sys, random\nfrom math import sqrt\n\ndef gcd(a, b):\n while 1:\n if b == 0:\n return a\n a %= b\n if a == 0:\n return b\n b %= a\n\ndef fib_mod(n, mod):\n if n <= 2:\n return (((n + 1) >> 1) % mod, ((n + 2) >> 1) % mod)\n mask = 4\n while mask <= n:\n mask <<= 1\n mask >>= 2\n a, b = 1, 1\n while mask:\n if mask & n:\n a, b = (a * a + b * b) % mod, b * ((a << 1) + b) % mod\n else:\n a, b = (a * ((b << 1) - a) % mod), (a * a + b * b) % mod\n mask >>= 1\n return a, b\n\ndef divisors(n):\n l = [1]\n f = factors(n)\n for p, e in f:\n for i in range(len(l)):\n v = l[i]\n for j in range(e):\n v *= p\n l.append(v)\n return sorted(l)\n\ndef p6():\n def solve(seq):\n seq = sorted(seq)\n\n next = []\n for i in range(len(seq)):\n for j in range(i + 1, len(seq)):\n if seq[j] % seq[i] == 0:\n break\n else:\n next.append(seq[i])\n seq = next[:]\n\n ans = 1\n for i in range(len(seq)):\n c = seq[i]\n ans = ans * fib_mod(c, MOD)[0] % MOD\n\n t = 1\n\n s = set()\n for g in seq[:i]:\n s.add(gcd(g, c))\n s = list(sorted(s))\n k = solve(s)\n ans = ans * pow(k, MOD - 2, MOD) % MOD\n \n return ans\n\n\n stdin = sys.stdin\n\n MOD = 10 ** 9 + 7\n T = int(stdin.readline())\n\n seq = []\n for _ in range(T):\n N = int(stdin.readline())\n seq.append(N)\n\n print(solve(seq))\n\np6()\n",
"template": "#\n# Complete the 'solve' function below.\n#\n# The function is expected to return an INTEGER.\n# The function accepts INTEGER_ARRAY f as parameter.\n#\n\ndef solve(f):\n # Write your code here\n\n",
"template_head": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\n",
"template_tail": "if __name__ == '__main__':\n fptr = open(os.environ['OUTPUT_PATH'], 'w')\n\n f_count = int(input().strip())\n\n f = []\n\n for _ in range(f_count):\n f_item = int(input().strip())\n f.append(f_item)\n\n result = solve(f)\n\n fptr.write(str(result) + '\\n')\n\n fptr.close()\n"
}
|
eJztms2uJslVRRnwIFaNLRT/EcmTIFGIgfGASeGBLVlClngIeF/W2lnVUSr7GjMDq6v7dmfl/b7YEednn31O5n/87X/9av1N/vzDZy7+8d8//euX3/zut5/+/hefdvv85ZxTyin185f19LHLOg83n6c9fe3++cus7bS51/j8pZ5VVi9jcXedXp+x+Ow4pT/z85f+nNX3bnxnlN5n39NFa92t1M0H2nhqnevhLjB9ncrNUctTx1O8ZOnen1ZAKuM8axYux5rjtApmbXt0duWmWz98qbtq23X2MUpgW5u5W8tafPps7o66+zM862ycoG+Osuae53RhG2fl3Hx/PmM+HMpPjn1Ysx32Wvc4q3J1+up1FPfyrHU2q/n9clhqC3XaGr1xcu/2Xp7iERu/X+th1b3KmPx0jTE2Sx1+L9BorQ0RnjGwo4Y7cz9nb8BGw2j4iRWe8zSMKcJ4RutrauR+yqqleLA5T5lnTj7wbBZrWx/1xtenJlj46tldH9Z6Hiw3+T0bHHytcNkwc61jDk3bsdjpbLdymF2wDncXNhhzdq2In2prLEbobNCObsKCnVjwZK0XHM1m6lh1ct6qmTsePeKymfKM+rjb9pyCR1i1PQTd01rOOM/oHoEYmJyzNz122iD+dPmeY2BczbgbJyjVfVV82glbY/Yp+D7uY3VDzPg7WAQfbjdO8Hei5vOXT7/8xadf//43v/7Vb3/9L//8b7/77bcsYd+1cfhPf/jlL77LnnXEx5yLBOJYu2DwOdkVDg9SLiewo1YPA9CDGfUo3sDKhtfQ4I9ZtzcXffNRjIrtHu3CSpOvG6lEDil4is5fnaiYOQtQ+6naiL3g0qbpyVOsQpZwwjInQeNaFQvidmzYp5k4TUZia5BqbnFNs4YY4S5JK+DS4+ywH+/iijVrSYTzQeNgGz6jbM5fYwV44w018o+zG/jQQSHFulG32zbuTKJKSHEzezRqn2x3miLDWOxsEJvoUlJ5Lbxt8tey63ELfOEcgk1ugqLYgwEKH2xcPkJuzySFTIyGm/Ci+TRNSIjieJe4JVhiXYA5Tk/userWEw+xBFHp1Wrgwo9G+2okMv8nuwgk2Y2kamCY8ETXqSPsRWg+9SnH+CCBWT70tavhd5KP3CxL+prbHO3vwcZDOJulq3ZcTYyzAUxf96l+ACLE0TOUQC5gPnm3VoM6EQQ31UWqulnoB+tP2YHTjEeqgaqmRgs7EDg1XATBdbdR/AC+6wbbB3kxSsGPva0f80Jr4HyYO8bEbnrUbGHtDoVyd8tZpOuKwzHsqBJOgaCPlm0SIg6TKmsqizvFwnXs9XqDXJpZYG0O2I7H5pecuohLdO1d4NlswUhNRDSiF5s/mhN2Iig966ZY9Tc4WOK00DnMhlHErUV/Ts9A4LCFYaRyQAi6p7YV2MvwcGN8my1UyQdc8sh0oggO/jE8ukckOfgaccbnR4Jm8sFmXnRyjUQ3jVlqPPzFsO6tmGXHWINiCZERXp3WyucNu2PSaxFKFsF/5DconnhkZ5sUACQQpDd/0bwVi3EImQC6PnXFkI+FCq5yk1A3lB9qBrO/ukD3kW6PYUf6w2LFAoaViOCmzag/OGWlrME/w49iXbVEMpYA7BXnaoaD3OgmDNX2mH2S/+BYPfmARfDDMPXI3dlK6vFGhaBG3CMGR0ek6JAY2kyaJYXMGRUFtAT5VsOZGEemJEYgEBTHIzBOKP1g1IgH0sEzfBD5GKGAccYPkS9fY8kidRjj1AMYSvdDXuT29rAYFcSRkjGps4R0Sji1HFJ3hce8HYqACSXBhNPPUgIew1WXYneSyiwWrfZYQ221otMQORSbFsORAayS8PAT3VCyZuJcyWFQNpeekquoqs8QgaoLYz9W67VAwj8aDrJiW+b3oGpyGumW9CUfhgnjZdEr5s5CDvwkm8iO9jUuyUoXa4uqPEJQRD1lY5jKsB4AkQkLziMsTg7EXuHPZCqLrYgHWJv99OhFwmiZSO4BBExqWA0L8ZFZ9mPST8m3GkAkmLmOhm2kqxSB8IspDFwiBCkyjLBi3RgvdULq1Zxj50R4Dr9Rom+ooGMlbCOQBR5Y23xoh29Zf1MrlKGmJz6DZVZPOEPCJ2VDQxO2X0unRzDVa6wuZZLciJmcF7oqj+rlwUd432JJke6TPcyotWF5t+SvFPKmDVC+7Kam6pBDBF6EwrM49khxB1OVHqWgiLckYCMrmMWdmkowtqhiBErHbytnRM6fFCuEhmmbu/x5ujWuJZ+eJ6rWGC1akRCDtHUDwqGQxyoUhJHhKgKl/+j0maORStuoGFAQhSnZzTcg0Agb3EkEpQ2h0lDTU3lIDXymGdFbLBqLbKs5ZKxLBsqPRqBF9iIqt4tZmCkjBnSjqpMGBh5Vkww6I1FMZZDR8tk9pKOIBsgKYvVA1r6Wok6w8dWVDH9SMj+klYrMa+Ttj7QStsXuJb0PqbKUXonqhZw6GuODJd0m1ps/1uj4otnxpUBiEHa+5VdqMZnQ28sjRsarUjEk9jR4FeX+Y3qQHy0xv4ChtNa394JgeooEjaTNXWxCeBJbTwJZkdejWOhxFAu6PhaukVUwVo1sG3pzDLNm0oZSZpQ8s9vtyBfcQJ7lZjF30vIhDifkodtwH1aNCDWCiERFORQMguWeikA9O8lKhKDMawi4j5lCKCkTxnrYaKQDPtkL1Rax/cbxpu2caYFxuv1PdOO2gYxAM4cleWiD0l9KGIt990QDaZcyoJmRaaq1tEbcp00yyKx4nF0uxQu0nSmlZDinWAlTHThj8CqHqPXseyDuJ3yAnVCU2a1lrshNVOSlcdNn0QadpBK7pRuuygx0IfJ59EghNt525BqwR14LGau16itUkFMtJu2aK7GCPx5FmIrVjpetp5EfPfve0ig609qynRk8kq6xTvmIESjO7FZKlIbIqEiwJ0x3Akuk8XHFJXKHBH/X59dvK0CTTbIk7a1ZHpu6peqyXlGEnnf/VAfMNmQbspe+ZTxps2iVR3QUqWuqy/Q2j7QuT9j5KXzGo9LGI8/NJj5KXZ5yo90hcfx2HfAG2fCWTFqbmZrKlyLV08XT65ySEw4DML5DGUtk8SgdBIY9kX1onyOto6NUbzEi2soGYn3MBwYE1Pwjwxicxyh85wkcAL++Wbsdv5gIneOhT80Ueqfuj7IEUUH58oBYmjqf6EZXHQcCEiuK2QZDmacWDcdKj5zEu7QvlgdVdMWcUotsQAHDJ68yhq1LqiUpSiMZ0/eCwBxRfFT0Jo+1zIgI8MgDY4TgWyUDg2L8pi9SHiaXoFqWa5koqDiRGu4Mu7fwAYVsn/eSs0xlkoSuDoUaUqEoGPBfxhvEUjlRwyUDs/5x44RmI2TJgR+8cKItDIOReu2m4E7bi27tGDkLKUXNksZwDGTk/oknROXR9FYvNON5d42tQqPV9HlHJrqAltKCD8UUErRkNKYFIgnJh2Yn3ELPCoK3tNe3p5627Lun+JEpiLC0kAQgbkhoEum4c2Xihy6PFKu0ki0eQBxPy6N7lXR6tk2TyJ57JB55VhzLhL29mzDhWHVHah1UJmGlkoWyoPGZTkilv9LYUWhg7VSdY3dvQEnWsGP4AaHgAjvTl6WKGZk5ssn+9fdSb0/DCae3Ut/1u5MHjUUJRl1mGLHdiaLKTFdPrijlTF/SLzojmCX9ewnlB8zWMwrPOSQVpIbS6cBqppo1Q8MaOjTItp0LznTmWlKm0df2cNlYGFtuoxChIlK86RYL7YBq7xjIflTm4vZOEzGsBaZ7k1rLjtIy10m9tIjNKUsa4W73fMKTqS7j7arteWNxOJU0qDtdm4XmkTyQ58f52DttUDuHurbdfro2VCiiYT0JRfamEPRoRN9OS9L0fpkRGMu4zVClOVy2Jht32wFz+NUKBL95IPxEvck0yQFmi2jGt+wgkye4uuKSDA8o6RgzXYSnby+TAnyw+sc9IM6BEJEIP04/RLJVRUJmfI1U3+/szPyg9ojpdLj1FJPHqhhRX5FE+KeH9G2/1stozb40zuFcNtCR1Aj0NjIgdDC7MxUiPVTl0QF2me2dVTk6lTC6g+4TlqJF0Wd+1tghU5M55jPcH/GMPizJDHqWksm0RnZQ8ox3LDM6qdJSBDhQZpTTGc/JjGEYYSRtj7504jYzeXecWjNNOCWqvKdkH1WjAaSmnxm9E36Ka89OH4AciZoxsw3oMKAVZ78TasVI5qjHbs+QdF28SNucxlyR9VYJ5y8tU0yHziRYEo2C7Bfb+/yjvMO8KlHM+WoUTL4ydFuZ04+Z5gQ1e6K+enRtRpc5Inom8wbZpEYwmTtpwR2+rteXENhoGXSlSmWYzGnJSRtpNk/R3Z6WzR0jtGXW4yOO8DldDD6ZGapti258BknOd8b5QQDTeTqmrD9qgehQQB7HOm8kSaZakPqs3M9UqbTMmyJF0PprvBNux9L6BfWtegyndUdmmXzg1pUu47EA+lAjkejgRk6ih3heUrRyQRxWJoMQj6ZiO/Hs70MC6IQYsTLRHJCpyTsSaM30IwQ1NbpnFDF8llWeTKdt4bsc4ThZ7fgq6SmPpTg9zpZbhulGS4aR29kSvNfS5yjX0z9xCADVRp5scJnBuvo140xiCyfXNG00QTR3Eo4qGmn+0pvlIrM5doM79tvVWQWWZbM6QCuvpOpocpRw1Poa6324BclgxJq542Nj/C5m6JXszLHF8/a9FD13nwMf9HGJI9Et9lChYOvfSx92r+8sgeLhwKxmbN1sbA3kWuy65jvvpCWBeEMU5EoLUTxOHxFYJ2xcBBxpuAMx3ikLp0k/6PMRmPwVFxy/1ne6yvolE/9HUfH1a8NZUcuswDF+hlT2R46GwyTkZR89owD8D7l5ID5AXhouh1oH+QaYjh0RGoVly/O8gno7HN1p2LCjO56vTS3k6YDpI30ikqafTuCE1J8WIftkqF+U0B7CvafrQZMhYHqG483OMHFO2J13cMV6lrB3lACZjTyyJLvR0iOlgtLV30d7lX0490m3bXTmGRy8aDNrxPpAsNudpwoXiVbuxR4a1ae2tpE1vEdgsssnA8luTpeIalgLjjSO+Y4z+hSTTDielYZsyZfr4wdnZsJDY/fj8EEbfzwE+RMfLt/+fNzX/NHXkjM///sX//uXuiN2/c4hP1//fP3z9c/X/5ev/7dFw+pGiaQeUjMp0pRAqrZr8iNd2kOkTePHGpz3GvhRGTntsEl1HTVeXvZxxGQXrPxT6Dt9UqBYRu3LrKzKI/WjOlYl6kTQXlLp4ChGxeMzdDsri71F3Cfeym1FoW2W1Vw5ZCm3GVNRObNS+jpqUIkqqe3ebV3UBIpp+zJFqAJX/aGcUffaCjhWsLdwWqLGU7Wo0G0ylJWqDWWVKsuezfZa0eDDJ0WjPYQazl7GkalP7lSbCilltoJICa1otDOI7z7uu1Fp6PW+/6fC9Hz7cy/Pvdz3ct3LeS/Hvez3st3Lei8v2rlo56Kdi3Yu2rlo56Kdi3Yu2rlo56Lti7Yv2r5o+6Lti7Yv2r5o+6Lti7Yv2rpo66Kti7Yu2rpo66Kti7Yu2rpo66LNizYv2rxo86LNizYv2rxo86LNizYv2rho46KNizYu2rho46KNizYu2rho46L1i9YvWr9o/aL1i9YvWr9o/aL1i9YvWrto7aK1i9YuWrto7aK1i9YuWrto7aLVi1YvWr1o9aLVi1YvWr1o9aLVi1YvWrlo5aKVi1YuWrlo5aKVi1YuWvkzinjaLY3x4/Q+BPRWjpmakUrRv1aG52sleL4y/v7K6P1l8LD185WV91fW7V/ZtX9lT9fJJDojwpK/ZtSUtjdz2kDmKtO8dI3eS9OYti5PK3a2lfGjv33yn7y5kL1mYJ/6lRH4zhw8TyH8T96s8LeZHWcamVeV8oKWG287Nc6rzNBdOS+SZSLxPm6reTmlZqCct0fzWovlz9/m3dC8nZlRtTvtJ28B5smoxtMQbyerbfPAJK92jjxWTtV8S6VXM8/yat6bzEw2b27m7Rcrp794Uj8zq/SqpYymhn4cCj4HXYNW+2MdMaId8nivvYW2tvfFr4xrdWHUwft+XHkyoLDM1PW+vNl2qvHM3BoH52FoWy1PGmcbLTM4n1xK9s3Xer4+uRl5AyUvhZXswTdvshPf0xnZz66FX2f6MHxHNHtbZ/SZ9xunL++WpOHPx/krOM5HcVzAmXDLn9NUmV5/veo/XY2fruZPV+unq/3T1bm67I8luhx2Ly9MvTj1AtWLVC9UvVj1gtWL9m3ZaPN7edHaRWsXrV20dtHaRWsXrV20b2tF4d/L70x40fpF6xetX7R+0fpF6xft2wLpE+7lRRvfeeyijYs2Ltq4aOOijYv27VvpNu7lRZsXbX4XIBdtXrR50eZFmxft20fTs9zLi7Yu2rpo67t4vGjroq2Lti7at9+n87mXF21ftH3R9kXb34X/RdsXbV+0bzfTP93Li3Yu2rlo56Kdi3a+y7aLdi7at6t0Yffyoj0X7bloz0V7Ltpz0Z7vkvtPZPefacCnb1OV509KqfdZ4P//nzTDfwU/H/XjPvZo8xmf/vBP//l3/w0O2J7T
| null |
2,462 |
GCD Product
|
This time your assignment is really simple.
Calculate GCD(1, 1) * GCD(1, 2) * ... * GCD(1, M) * GCD(2, 1) * GCD(2, 2) * ... * GCD(2, M) * ... * GCD(N, 1) * GCD(N, 2) * ... * GCD(N, M).
where GCD is defined as the [Greatest Common Divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor).
**Input Format**
The first and only line contains two space separated integers *N* and *M*.
**Output Format**
Output the required product modulo 10<sup>9</sup>+7.
**Constraints**
1 <= *N*, *M* <= 1.5 * 10<sup>7</sup>
**Sample input:**
<pre>4 4</pre>
**Sample output:**
<pre>96</pre>
**Explanation**
For the above testcase, N = 4, M = 4. So,
GCD(1, 1) * GCD(1, 2) * ...... * GCD(4, 4) = 1 * 1 * 1 * 1 * 1 * 2 * 1 * 2 * 1 * 1 * 3 * 1 * 1 * 2 * 1 * 4 = 96.
|
hackerrank
|
Hard
|
{
"class_name": "Result",
"func_sign": [
"public static int solve(int n, int m)"
],
"script_name": "Solution",
"solution": "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 Solution {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tint[] primes = sieveEratosthenes(15000000);\n\t\tint n = ni(), m = ni();\n\t\tint mod = 1000000007;\n\t\tlong ret = 1;\n\t\tfor(int p : primes){\n\t\t\tlong e = 0;\n\t\t\tfor(long q = p;q <= n && q <= m;q *= p){\n\t\t\t\te += (long)(n/q)*(m/q);\n\t\t\t}\n\t\t\tret = ret * pow(p, e, mod) % mod;\n\t\t}\n\t\tout.println(ret);\n\t}\n\t\n\tpublic static long pow(long a, long n, long mod)\n\t{\n//\t\ta %= mod;\n\t\tlong ret = 1; // 1%mod if mod=1,n=0\n\t\tint x = 63-Long.numberOfLeadingZeros(n);\n\t\tfor(;x >= 0;x--){\n\t\t\tret = ret * ret % mod;\n\t\t\tif(n<<63-x<0)ret = ret * a % mod;\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tpublic static int[] sieveEratosthenes(int n) {\n\t\tif(n <= 32){\n\t\t\tint[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\t\tfor(int i = 0;i < primes.length;i++){\n\t\t\t\tif(n < primes[i]){\n\t\t\t\t\treturn Arrays.copyOf(primes, i);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn primes;\n\t\t}\n\n\t\tint u = n + 32;\n\t\tdouble lu = Math.log(u);\n\t\tint[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n\t\tret[0] = 2;\n\t\tint pos = 1;\n\n\t\tint[] isp = new int[(n + 1) / 32 / 2 + 1];\n\t\tint sup = (n + 1) / 32 / 2 + 1;\n\n\t\tint[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n\t\tfor(int tp : tprimes){\n\t\t\tret[pos++] = tp;\n\t\t\tint[] ptn = new int[tp];\n\t\t\tfor(int i = (tp - 3) / 2;i < tp << 5;i += tp)\n\t\t\t\tptn[i >> 5] |= 1 << (i & 31);\n\t\t\tfor(int i = 0;i < tp;i++){\n\t\t\t\tfor(int j = i;j < sup;j += tp)\n\t\t\t\t\tisp[j] |= ptn[i];\n\t\t\t}\n\t\t}\n\n\t\t// 3,5,7\n\t\t// 2x+3=n\n\t\tint[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4,\n\t\t\t\t13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14 };\n\t\tint h = n / 2;\n\t\tfor(int i = 0;i < sup;i++){\n\t\t\tfor(int j = ~isp[i];j != 0;j &= j - 1){\n\t\t\t\tint pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n\t\t\t\tint p = 2 * pp + 3;\n\t\t\t\tif(p > n)\n\t\t\t\t\tbreak;\n\t\t\t\tret[pos++] = p;\n\t\t\t\tfor(int q = pp;q <= h;q += p)\n\t\t\t\t\tisp[q >> 5] |= 1 << (q & 31);\n\t\t\t}\n\t\t}\n\n\t\treturn Arrays.copyOf(ret, pos);\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 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}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER n\n * 2. INTEGER m\n */\n\n public static int solve(int n, int m) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n int n = Integer.parseInt(firstMultipleInput[0]);\n\n int m = Integer.parseInt(firstMultipleInput[1]);\n\n int result = Result.solve(n, m);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"solution": "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 Solution {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\n \n static void solve()\n {\n int[] primes = sieveEratosthenes(15000000);\n int n = ni(), m = ni();\n int mod = 1000000007;\n long ret = 1;\n for(int p : primes){\n long e = 0;\n for(long q = p;q <= n && q <= m;q *= p){\n e += (long)(n/q)*(m/q);\n }\n ret = ret * pow(p, e, mod) % mod;\n }\n out.println(ret);\n }\n \n public static long pow(long a, long n, long mod)\n {\n// a %= mod;\n long ret = 1; // 1%mod if mod=1,n=0\n int x = 63-Long.numberOfLeadingZeros(n);\n for(;x >= 0;x--){\n ret = ret * ret % mod;\n if(n<<63-x<0)ret = ret * a % mod;\n }\n return ret;\n }\n \n public static int[] sieveEratosthenes(int n) {\n if(n <= 32){\n int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n for(int i = 0;i < primes.length;i++){\n if(n < primes[i]){\n return Arrays.copyOf(primes, i);\n }\n }\n return primes;\n }\n\n int u = n + 32;\n double lu = Math.log(u);\n int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];\n ret[0] = 2;\n int pos = 1;\n\n int[] isp = new int[(n + 1) / 32 / 2 + 1];\n int sup = (n + 1) / 32 / 2 + 1;\n\n int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };\n for(int tp : tprimes){\n ret[pos++] = tp;\n int[] ptn = new int[tp];\n for(int i = (tp - 3) / 2;i < tp << 5;i += tp)\n ptn[i >> 5] |= 1 << (i & 31);\n for(int i = 0;i < tp;i++){\n for(int j = i;j < sup;j += tp)\n isp[j] |= ptn[i];\n }\n }\n\n // 3,5,7\n // 2x+3=n\n int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4,\n 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14 };\n int h = n / 2;\n for(int i = 0;i < sup;i++){\n for(int j = ~isp[i];j != 0;j &= j - 1){\n int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];\n int p = 2 * pp + 3;\n if(p > n)\n break;\n ret[pos++] = p;\n for(int q = pp;q <= h;q += p)\n isp[q >> 5] |= 1 << (q & 31);\n }\n }\n\n return Arrays.copyOf(ret, pos);\n }\n \n public static void main(String[] args) throws Exception\n {\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 {\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 {\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 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 {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n private static 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 static 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 static 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 static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER n\n * 2. INTEGER m\n */\n\n public static int solve(int n, int m) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "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\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n int n = Integer.parseInt(firstMultipleInput[0]);\n\n int m = Integer.parseInt(firstMultipleInput[1]);\n\n int result = Result.solve(n, m);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"solution": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.StringTokenizer;\n\npublic class T {\n\n static MyScanner sc;\n private static PrintWriter out;\n\n private static int[] primes = new int[]{\n\n 2, 3, 5, 7, 11, 13, 17, 19, 23, 29,\n 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,\n 73, 79, 83, 89, 97, 101, 103, 107, 109, 113,\n 127, 131, 137, 139, 149, 151, 157, 163, 167, 173,\n 179, 181, 191, 193, 197, 199, 211, 223, 227, 229,\n 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,\n 283, 293, 307, 311, 313, 317, 331, 337, 347, 349,\n 353, 359, 367, 373, 379, 383, 389, 397, 401, 409,\n 419, 421, 431, 433, 439, 443, 449, 457, 461, 463,\n 467, 479, 487, 491, 499, 503, 509, 521, 523, 541,\n 547, 557, 563, 569, 571, 577, 587, 593, 599, 601,\n 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,\n 661, 673, 677, 683, 691, 701, 709, 719, 727, 733,\n 739, 743, 751, 757, 761, 769, 773, 787, 797, 809,\n 811, 821, 823, 827, 829, 839, 853, 857, 859, 863,\n 877, 881, 883, 887, 907, 911, 919, 929, 937, 941,\n 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013,\n 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069,\n 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151,\n 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223,\n 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291,\n 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373,\n 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451,\n 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511,\n 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583,\n 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657,\n 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733,\n 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811,\n 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889,\n 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987,\n 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053,\n 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129,\n 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213,\n 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287,\n 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357,\n 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423,\n 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531,\n 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617,\n 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687,\n 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741,\n 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819,\n 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903,\n 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999,\n 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079,\n 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181,\n 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257,\n 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331,\n 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413,\n 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511,\n 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571,\n 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643,\n 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727,\n 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821,\n 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907,\n 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989,\n 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057,\n 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139,\n 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231,\n 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297,\n 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409,\n 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493,\n 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583,\n 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657,\n 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751,\n 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831,\n 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937,\n 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003,\n 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087,\n 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179,\n 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279,\n 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387,\n 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443,\n 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521,\n 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639,\n 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693,\n 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791,\n 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857,\n 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939,\n 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053,\n 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133,\n 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221,\n 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301,\n 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367,\n 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473,\n 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571,\n 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673,\n 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761,\n 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833,\n 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917,\n 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997,\n 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103,\n 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207,\n 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297,\n 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411,\n 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499,\n 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561,\n 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643,\n 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723,\n 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829,\n 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919\n };\n\n public static void main(String[] s) throws Exception {\n sc = new MyScanner(new BufferedReader(new InputStreamReader(System.in)));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n long t = System.currentTimeMillis();\n solve();\n out.flush();\n }\n\n private static void calcT(String s) {\n sc = new MyScanner(new BufferedReader(new StringReader(s)));\n solveT();\n }\n\n private static void calc(String s) {\n sc = new MyScanner(new BufferedReader(new StringReader(s)));\n solve();\n }\n\n private static void solve() {\n long a = sc.nextInt();\n long b = sc.nextInt();\n long res = 1;\n\n for (int i : primes) {\n long kk = i;\n while (kk <= Math.min(a, b)) {\n res *= pow(i, (a / kk) * (b / kk), 1000000007) % 1000000007;\n res %= 1000000007;\n kk *= i;\n }\n res %= 1000000007;\n }\n for (int i = 7919 + 2; i <= Math.min(a, b); i += 2) {\n if (isPrime1(i) && isPrime(i)) {\n long kk = i;\n while (kk <= Math.min(a, b)) {\n res *= pow(i, (a / kk) * (b / kk), 1000000007) % 1000000007;\n res %= 1000000007;\n kk *= i;\n }\n res %= 1000000007;\n }\n }\n out.println(res);\n }\n\n private static boolean solve(int a, int b, int c) {\n if (c > b && c > a) return false;\n if (a == 1 || b == 1) return true;\n return c % gcd(a, b) == 0;\n }\n\n private static void solveT() {\n int t = sc.nextInt();\n while (t-- > 0) {\n solve();\n }\n }\n\n\n\n private static long gcd(long l, long l1) {\n if (l > l1) return gcd(l1, l);\n if (l == 0) return l1;\n return gcd(l1 % l, l);\n }\n\n\n private static final class RMQ {\n RMQNode root;\n\n public RMQ(int n) {\n root = new RMQNode(0, n - 1);\n }\n\n public void add(int i, long m) {\n root.update(i, m);\n }\n\n public long min(int from, int to) {\n return root.min(from, to);\n }\n\n private static class RMQNode {\n int from;\n int to;\n long val;\n RMQNode left;\n RMQNode right;\n\n\n public RMQNode(int i1, int i2) {\n val = Integer.MAX_VALUE;\n from = i1;\n to = i2;\n if (i1 != i2) {\n int m = (i1 + i2) / 2;\n left = new RMQNode(i1, m);\n right = new RMQNode(m + 1, i2);\n }\n }\n\n public void update(int i, long m) {\n if (i < from || i > to) return;\n val = Math.min(val, m);\n if (left != null)\n left.update(i, m);\n if (right != null)\n right.update(i, m);\n }\n\n public long min(int from, int to) {\n if (this.from > to || this.to < from) return Long.MAX_VALUE;\n if (this.from >= from && this.to <= to) return val;\n long i1 = left != null ? left.min(from, to) : Long.MAX_VALUE;\n long i2 = right != null ? right.min(from, to) : Long.MAX_VALUE;\n return Math.min(i1, i2);\n }\n }\n }\n\n static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n MyScanner(BufferedReader br) {\n this.br = br;\n }\n\n void findToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n }\n\n String next() {\n findToken();\n return st.nextToken();\n }\n\n int[] na(int n) {\n int[] k = new int[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.nextInt();\n }\n return k;\n }\n\n long[] nl(int n) {\n long[] k = new long[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.nextLong();\n }\n return k;\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 private static boolean isPrime1(long prev) {\n return prev == 2 || prev == 3 || prev == 7 || prev == 11 || prev == 13\n || prev == 17 || prev == 19 || prev == 23 || prev == 29 || prev == 31 || prev == 37\n || prev == 41 || prev == 43 || prev == 47 || prev == 53\n || !(prev % 2 == 0 || prev % 3 == 0 || prev % 5 == 0 || prev % 7 == 0 || prev % 11 == 0\n || prev % 13 == 0 || prev % 17 == 0 || prev % 19 == 0 || prev % 23 == 0\n || prev % 29 == 0 || prev % 31 == 0 || prev % 37 == 0 || prev % 41 == 0\n || prev % 43 == 0 || prev % 47 == 0 || prev % 53 == 0);\n }\n\n private static boolean isPrime(long prev) {\n\n long d = prev - 1;\n int s = 0;\n while (d % 2 == 0) {\n d >>= 1;\n s++;\n }\n\n return !((!testForA(2, s, d, prev)) || (prev >= 2047 && !testForA(3, s, d, prev))\n || (prev >= 1373653 && !testForA(5, s, d, prev))\n || (prev >= 25326001 && !testForA(7, s, d, prev)));\n }\n\n private static boolean testForA(long a, int s, long d, long n) {\n long pp = pow(a, d, n);\n if (pp == 1) {\n return true;\n }\n for (int i = 0; i < s; i++) {\n if (pp == n - 1)\n return true;\n\n pp = sqm(pp, n);\n }\n return false;\n }\n\n static long sqm(long x, long k) {\n return (x * x) % k;\n }\n\n\n static long pow(long v, long p, long k) {\n if (p == 0) {\n return 1;\n }\n if (p == 1) {\n return v % k;\n }\n long x = pow(v, p / 2, k);\n long res = (sqm(x, k) * ((p % 2) == 1 ? v : 1)) % k;\n\n if (res < 0 ||x <0 ) {\n System.out.println(res);\n }\n return res;\n }\n}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER n\n * 2. INTEGER m\n */\n\n public static int solve(int n, int m) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "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\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n int n = Integer.parseInt(firstMultipleInput[0]);\n\n int m = Integer.parseInt(firstMultipleInput[1]);\n\n int result = Result.solve(n, m);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"class_name": null,
"func_sign": [
"solve(n, m)"
],
"solution": "#!/usr/bin/env python\n\nimport math, sys\n\n\nMOD = 1000000007\n\n\ndef rwh_primes2(n):\n \"\"\"Input n>=6, Returns a list of primes, 2 <= p < n\n http://stackoverflow.com/a/2068548/406772\"\"\"\n\n if n < 3:\n return []\n elif n == 3:\n return [2]\n elif n < 6:\n return [2, 3]\n\n correction = (n % 6 > 1)\n n = {0: n, 1: n - 1, 2: n + 4, 3: n + 3, 4: n + 2, 5: n + 1}[n % 6]\n\n sieve = [True] * (n // 3)\n sieve[0] = False\n\n for i in range(int(n**0.5) // 3 + 1):\n if sieve[i]:\n k = 3 * i + 1 | 1\n sieve[((k * k) // 3) :: 2 * k] = [False] * ((n // 6 - (k * k) // 6 - 1) // k + 1)\n sieve[(k * k + 4 * k - 2 * k * (i & 1)) // 3 :: 2 * k] = [False] * ((n // 6 - (k * k + 4 * k - 2 * k * (i & 1)) // 6 - 1) // k + 1)\n \n return [2, 3] + [3 * i + 1 | 1 for i in range(1, n // 3 - correction) if sieve[i]]\n\n\nif __name__ == '__main__':\n N, M = list(map(int, sys.stdin.readline().split()))\n N, M = min(N, M), max(N, M)\n\n primes = rwh_primes2(M + 1)\n product = 1\n \n for p in primes:\n n = 0\n k = p\n \n while k <= N:\n n += (N // k) * (M // k)\n k *= p\n \n product *= pow(p, n, MOD)\n product %= MOD\n \n print(product)",
"template": "#\n# Complete the 'solve' function below.\n#\n# The function is expected to return an INTEGER.\n# The function accepts following parameters:\n# 1. INTEGER n\n# 2. INTEGER m\n#\n\ndef solve(n, m):\n # Write your code here\n\n",
"template_head": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\n",
"template_tail": "if __name__ == '__main__':\n fptr = open(os.environ['OUTPUT_PATH'], 'w')\n\n first_multiple_input = input().rstrip().split()\n\n n = int(first_multiple_input[0])\n\n m = int(first_multiple_input[1])\n\n result = solve(n, m)\n\n fptr.write(str(result) + '\\n')\n\n fptr.close()\n"
}
|
eJx1lLtKBFEMhi18kDD1IrlffBJBxUK3sFGLFQQR7O1E39ezs1sIZxNSDJz58uf8yczn+e/3+dkaV1/j4fp9eXx6ed0tl7CI40gIxpHLBpbt28v2frd9uHt+3R3fKXZFU5Kbp+VjA//orGQhhHGcXtbwFjFwwZp4RVIBKyRuWE5DKo1Zm/AQUGtQUyBGgeKMWZyEuDwMSDCErG1BRDGL5wJMwxlRIMq07K5fTKOCZc4FLDyA0yMb1lFDU/UEC92N6YQOtMPN2HfHM3SwFY429+7yWBzCCReIjpmdrApZlTrGTExQui4LpBMj8nI/Yb5Du3SVQ06lTiysOah3k/ZkL2bziYvVyAYTFi1U0tlEREEwwpEdHCGFkvME6N/n0TVMHPsRzr4qgZcgS7/VRqYRc9OpOKz19m+CgUWHJbj9ufgDW3hKAA==
| null |
5,747 |
Eugene and Big Number
|
Eugene must do his homework, but he is struggling.
He has three integer numbers: *A*, *N*, *M*. He writes number *A* on the board *N* times **in a row**. Let's call the resulting big number *X*.
Help Eugene find *X* [modulo](https://en.wikipedia.org/wiki/Modulo_operation) *M*.
|
hackerrank
|
Medium
|
{
"class_name": "Result",
"func_sign": [
"public static int solve(int a, long n, int m)"
],
"script_name": "Solution",
"solution": "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 EABN {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tfor(int T = ni();T >= 1;T--){\n\t\t\tint a = ni();\n\t\t\tlong n = nl();\n\t\t\tint m = ni();\n\t\t\tint L = (int)Math.pow(10, Integer.toString(a).length());\n\t\t\tint[][] M = new int[][]{\n\t\t\t\t\t{L, a},\n\t\t\t\t\t{0, 1}\n\t\t\t};\n\t\t\t\n\t\t\tint[] v = new int[]{0, 1};\n\t\t\tout.println(pow(M, v, n, m)[0]);\n\t\t}\n\t}\n\t\n\t// A^e*v\n\tpublic static int[] pow(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 = mul(MUL, v, mod);\n\t\t\tMUL = p2(MUL, mod);\n\t\t}\n\t\treturn v;\n\t}\n\t\n\t\n\t// int matrix * int vector\n\tpublic static int[] mul(int[][] A, int[] v, int mod)\n\t{\n\t\tint m = A.length;\n\t\tint n = v.length;\n\t\tint[] w = new int[m];\n\t\tfor(int i = 0;i < m;i++){\n\t\t\tlong sum = 0;\n\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\tsum += (long)A[i][k] * v[k];\n\t\t\t\tsum %= mod;\n\t\t\t}\n\t\t\tw[i] = (int)sum;\n\t\t}\n\t\treturn w;\n\t}\n\t\n\t// int matrix^2 (cannot ensure negative values)\n\tpublic static int[][] p2(int[][] A, int mod)\n\t{\n\t\tint n = A.length;\n\t\tint[][] C = new int[n][n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tlong sum = 0;\n\t\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\t\tsum += (long)A[i][k] * A[k][j];\n\t\t\t\t\tsum %= mod;\n\t\t\t\t}\n\t\t\t\tC[i][j] = (int)sum;\n\t\t\t}\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\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 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}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER a\n * 2. LONG_INTEGER n\n * 3. INTEGER m\n */\n\n public static int solve(int a, long n, int m) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int t = Integer.parseInt(bufferedReader.readLine().trim());\n\n for (int tItr = 0; tItr < t; tItr++) {\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n int a = Integer.parseInt(firstMultipleInput[0]);\n\n long n = Long.parseLong(firstMultipleInput[1]);\n\n int m = Integer.parseInt(firstMultipleInput[2]);\n\n int result = Result.solve(a, n, m);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n }\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"solution": "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 EABN {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\n \n static void solve()\n {\n for(int T = ni();T >= 1;T--){\n int a = ni();\n long n = nl();\n int m = ni();\n int L = (int)Math.pow(10, Integer.toString(a).length());\n int[][] M = new int[][]{\n {L, a},\n {0, 1}\n };\n \n int[] v = new int[]{0, 1};\n out.println(pow(M, v, n, m)[0]);\n }\n }\n \n // A^e*v\n public static int[] pow(int[][] A, int[] v, long e, int mod)\n {\n int[][] MUL = A;\n for(int i = 0;i < v.length;i++)v[i] %= mod;\n for(;e > 0;e>>>=1) {\n if((e&1)==1)v = mul(MUL, v, mod);\n MUL = p2(MUL, mod);\n }\n return v;\n }\n \n \n // int matrix * int vector\n public static int[] mul(int[][] A, int[] v, int mod)\n {\n int m = A.length;\n int n = v.length;\n int[] w = new int[m];\n for(int i = 0;i < m;i++){\n long sum = 0;\n for(int k = 0;k < n;k++){\n sum += (long)A[i][k] * v[k];\n sum %= mod;\n }\n w[i] = (int)sum;\n }\n return w;\n }\n \n // int matrix^2 (cannot ensure negative values)\n public static int[][] p2(int[][] A, int mod)\n {\n int n = A.length;\n int[][] C = new int[n][n];\n for(int i = 0;i < n;i++){\n for(int j = 0;j < n;j++){\n long sum = 0;\n for(int k = 0;k < n;k++){\n sum += (long)A[i][k] * A[k][j];\n sum %= mod;\n }\n C[i][j] = (int)sum;\n }\n }\n return C;\n }\n \n public static void main(String[] args) throws Exception\n {\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 {\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 {\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 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 {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n private static 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 static 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 static 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 static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER a\n * 2. LONG_INTEGER n\n * 3. INTEGER m\n */\n\n public static int solve(int a, long n, int m) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "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\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int t = Integer.parseInt(bufferedReader.readLine().trim());\n\n IntStream.range(0, t).forEach(tItr -> {\n try {\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n int a = Integer.parseInt(firstMultipleInput[0]);\n\n long n = Long.parseLong(firstMultipleInput[1]);\n\n int m = Integer.parseInt(firstMultipleInput[2]);\n\n int result = Result.solve(a, n, m);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n } catch (IOException ex) {\n throw new RuntimeException(ex);\n }\n });\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"solution": "import java.io.OutputStreamWriter;\nimport java.io.BufferedWriter;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.Writer;\nimport java.util.List;\nimport java.util.function.Function;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.ArrayList;\nimport java.util.NoSuchElementException;\nimport java.math.BigInteger;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n * @author Stanislav Pak\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tOutputWriter out = new OutputWriter(outputStream);\n\t\tEugeneAndBigNumber solver = new EugeneAndBigNumber();\n\t\tint testCount = Integer.parseInt(in.next());\n\t\tfor (int i = 1; i <= testCount; i++)\n\t\t\tsolver.solve(i, in, out);\n\t\tout.close();\n\t}\n}\n\nclass EugeneAndBigNumber {\n\tstatic int[] len = new int[1004];\n\tstatic {\n\t\tfor (int i = 0; i < len.length; ++i) {\n\t\t\tlen[i] = numDigits(i);\n\t\t}\n\t}\n\n\tprivate static int numDigits(int n) {\n\t\tint res = 0;\n\t\twhile (n > 0) {\n\t\t\t++res;\n\t\t\tn /= 10;\n\t\t}\n\t\tif (res == 0) ++res;\n\t\treturn res;\n\t}\n\n\tpublic void solve(int testNumber, InputReader in, OutputWriter out) {\n\t\tint a = in.readInt();\n\t\tlong n = in.readLong();\n\t\tlong mod = in.readLong();\n\t\tout.printLine(calc(a, n, mod));\n }\n\n\tprivate long calc(int a, long n, long mod) {\n\t\tif (n == 1) {\n\t\t\treturn a % mod;\n\t\t}\n\t\tif (n % 2 == 1) {\n\t\t\treturn (calc(a, n - 1, mod) * IntegerUtils.power(10, len[a], mod) % mod + a) % mod;\n\t\t}\n\t\tlong res = calc(a, n >> 1, mod);\n\t\tres = (res * IntegerUtils.power(10, len[a] * n / 2, mod) + res) % mod;\n\t\treturn res;\n\t}\n}\n\nclass InputReader {\n\n\tprivate InputStream stream;\n\tprivate byte[] buf = new byte[1024];\n\tprivate int curChar;\n\tprivate int numChars;\n\tprivate SpaceCharFilter filter;\n\n\tpublic InputReader(InputStream stream) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic int read() {\n\t\tif (numChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = 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 (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\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\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\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 readLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\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\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\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 String readString() {\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\tif (Character.isValidCodePoint(c))\n\t\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 boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn isWhitespace(c);\n\t}\n\n\tpublic static boolean isWhitespace(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic String next() {\n\t\treturn readString();\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n\nclass OutputWriter {\n\tprivate final PrintWriter writer;\n\n\tpublic OutputWriter(OutputStream outputStream) {\n\t\twriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n\t}\n\n\tpublic void close() {\n\t\twriter.close();\n\t}\n\n\tpublic void printLine(long i) {\n\t\twriter.println(i);\n\t}\n\n}\n\nclass IntegerUtils {\n\n\tpublic static long power(long base, long exponent, long mod) {\n\t\tif (base >= mod)\n\t\t\tbase %= mod;\n\t\tif (exponent == 0)\n\t\t\treturn 1 % mod;\n\t\tlong result = power(base, exponent >> 1, mod);\n\t\tresult = result * result % mod;\n\t\tif ((exponent & 1) != 0)\n\t\t\tresult = result * base % mod;\n\t\treturn result;\n\t}\n\n}\n\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER a\n * 2. LONG_INTEGER n\n * 3. INTEGER m\n */\n\n public static int solve(int a, long n, int m) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "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\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int t = Integer.parseInt(bufferedReader.readLine().trim());\n\n IntStream.range(0, t).forEach(tItr -> {\n try {\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n int a = Integer.parseInt(firstMultipleInput[0]);\n\n long n = Long.parseLong(firstMultipleInput[1]);\n\n int m = Integer.parseInt(firstMultipleInput[2]);\n\n int result = Result.solve(a, n, m);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n } catch (IOException ex) {\n throw new RuntimeException(ex);\n }\n });\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"class_name": null,
"func_sign": [
"solve(a, n, m)"
],
"solution": "for i in range(int(input())):\n a, b, c = map(int, input().split(' '))\n\n if len(str(a)) == 1:\n ans = pow(10,b,9*(c))\n ans = a*((ans - 1) // 9)\n print(ans%c)\n\n elif len(str(a)) == 2:\n ans = pow(10, 2*b, 99*c)\n ans = a*((ans-1)//99)\n print(ans%c)\n\n elif len(str(a)) == 3:\n ans = pow(10, 3*b, 999*c)\n ans = a*((ans-1)//999)\n print(ans%c)\n\n else:\n ans = pow(10, 4*b, 9999*c)\n ans = a*((ans-1)//9999)\n print(ans%c)\n",
"template": "#\n# Complete the 'solve' function below.\n#\n# The function is expected to return an INTEGER.\n# The function accepts following parameters:\n# 1. INTEGER a\n# 2. LONG_INTEGER n\n# 3. INTEGER m\n#\n\ndef solve(a, n, m):\n # Write your code here\n\n",
"template_head": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\n",
"template_tail": "if __name__ == '__main__':\n fptr = open(os.environ['OUTPUT_PATH'], 'w')\n\n t = int(input().strip())\n\n for t_itr in range(t):\n first_multiple_input = input().rstrip().split()\n\n a = int(first_multiple_input[0])\n\n n = int(first_multiple_input[1])\n\n m = int(first_multiple_input[2])\n\n result = solve(a, n, m)\n\n fptr.write(str(result) + '\\n')\n\n fptr.close()\n"
}
|
eJyNmc2OJTkRhVnwIFaxQyPksB12mCdBohELmAWbYhYzEhIaiYeA9+U7znur8uZPd1/1T9XNzHDEiRMnws7//PZ/9rvfrM+ffs8Pf/732z/ef/rl57c/pjdrX96H5xRz9GnRLM+WInr2GM2+vEcpadbh4W4xzVOd7mPm6l/ep7dU5uApt+JzpJ7HaL23+uW9tZ5ajmG91pFrT1Zrqxkr2JyeSngto7CSF56rXoaN+eW9N34defTaZ+BE8tmy9V7w06alyHga1qyNlkbgc4ky8KWm5s1qzq2VgislbHpu8eXdjdV99jKLueWaSskRdZZC6HhWcm+zDCd84RBjDlz+8l7bTHjlZbY5wxI3dTCpRZdGwn7GWh8lj0S4Ji+JrqbpBN2sh4+aDOyi4xuLxUw4NbrnQfhgCV55uHB++yG9/fivn378288//v2v//zl50d6evVR9A+IhpU6g9U9rJvXio+tei5c4UsQxVIBwxoxSxuKYRQcjtn1fJ/cmIsLSC+1ztblE0CCMz+aWWC6YaGQG+DvWNAjrQviMjO3dq9vv/6QdhQist4jmZH85iU3MyDIAWsaBjrEKDlnt+oAVBPsiTnhgzxtqbvujV4b2R7duD+iKaMABJdsRsDNSNFFrTrKLVoGPmCgpLNibW1RoxFJwSYRdg+wtHmIoCjigdMBR4pXnEteYSWJA5hS4F1UeWjYdVIPVax5vvWktFxZqSsxBkXnKHZY1HAIikCxSQ0BEHGnXks2qF9UQS2xRoAbgQwXxzIMUKaAG7Yq3c5Klni8dTeChReJCPgemPkukQUKILp4Q6nZqGJxgf8w2lobIILJWi05VdJGh7lOVmrkHC4KAT0lJ2VYZWAdBLEhbpB2QisDaMhOCkhGClxYG+XpOZtn33SDIKiXKjxzctKOkNTuKmq8ml5V/1ZgRLTZG7qC1dR77iWrVq2RFGoLqChRS9QnzmelmFgREVwGBJZElozMZR9cqxThKLiggpyEhtxRdFkcM9SNaB06jgHuiTsa4ibVyD1NUtMx6BR5Eh+wrceK9AxOEjJSQjQ22iAYd1WJJ4+J0lUSJFaNAqZt3HKF6/BpjkXaTlpJR8uzU394j36gnybLuQ+q3ASFd4Ba1yUJXkVTKqoUhFRxYY6alj9oDQkgY7DNDCfXdUkzpSTC9EpiSarCohR1ywKmCiTFI2Cq9AtNEc+0ErSZOR8ZrUwYiBJ/iTwBb5IlClg56uRBWExVNEvBnGjgPQEbytBlBBc6HFWERnWrqZOUgSoX0CDUUWFcIxM0p7lsconqVh+ALUg0FkGLsmsFZaeT9IkcVlrARD/gZhdvJ8rewRDWBoRrhIVyKu21agHkGi2zWdDvmUV2qY5FSVp3rIbgrB2NcqW6gblmKlnPjK6ipFoJpiEBkmaKF22pEleKFkwASJQR0LATUDvB02qyQqCXVNEM+aAWCLwgnJLDTuWhUMqFo5xRkCPSTF+Ej60J5ylfmjSA1UvP/G0JZGEgxbd6B60YvBoFOXGaGplIlEsfqAZKLwOU8KeAEfMx+rjXOUTB6PrghsoQvPQO1NAUdcIY0KQRJWVO5D00GNCBqCNJBD9C+CK60YFZVNxq6FkwcUhCUD1Kf7K8KZF0mIXYavEKtGkSKQik5IZVaU5KIQaYJdTzNqa5qFJhf1ZcF9qPciE3JIVM8S+/FFqOWEQOk+oP12kmSL/T1Ipa7i0kE3o21TDyJuGe/VgmkjmD1BWomHdGbArVt3EFEU44z7winetQDroz7mT1Cya1qq8hCazHBvQTKUR4F5GhSAnRsyTVD/SUqvJTkmrzlFp4YfwiR0TVdG0mh62Ih2S9qw1QMCiQehd8ZBjDIJDXBEUNM5Kqou40kNupSZF+xNDBnRoZirql0W3IIrctrntZYgaFNTaRbKqGkmcwkvwqU3J4rF5NsxrJVbyZ0UQ86Al3V9KHGgSuTLU48q4ShcAMLsxUlVZFATs21e9CHUlTZi4mpWdRNMRVBjVrnqBBkCPSjvoo4xpHAdKYV7A5VWtqrgO9ZyLUMFQ1IBaGlAG1R6pUCQ1Ow7AGCPotU5gaIpXLsKn6EYygT6cGN9ZABNKapVmx35IInaNiFYT0F7NTUt5pKwwSggRngWRVBmyQabxjQNcUpamdwlfLQX0DVklMcGqukQVX6PFbLWXTH40bfEHQof7MoEb3WmNp3eZTZZXkhOZm6WcwgRZdb1pdZQ3N1O4VErykYgj1XGkMkwwk6CezNLlHaotlKZ94WAQgLEVFWgQKRs+mPcz7IQv94ro6E7AwudmxIzVNf52pSvqZGaQ1ixZ0hjyIxF29GrJUhkWAhmXELSJLkqCxBiIaLqUPsTIjAWho/Ifuah6MI3CHaVejWEjo7gdTpuu+tg5rjzW2MZwRy7fZG0BQ0ovRmhma0aZoNEcOqXHtcjSAlq2lklL2ScxdDDRMVYVI80qItAqBZL+Cj3RbiopQOpcwR0sgQWsAY5fTqwbBnu91Xps4bC9V1ujE03V5XbVVWMMZUjDiJK9wJKe5+6T78f00T+hZez5d7yeoiwftexc9juXSlNdn69alNaI/P3uf9D1efiUsYaahOJSXo6+asOnISd2G6rhbRY7snfq4b2FUNH9rJGP6UpPf3xqfv9yPoJI2bdZXr/+8fdXB43Os5sfSCtwe7lha6H34Ru8Sdntv+hao8NycnpoKt/jsDOsy0/cR7CAa29o7608HHqbjsb59LrrctM8lH6Y+nfxYe4fg0YFlPnSSsGLfRc0g9ljyaXh8rL0zuHPgYSsuKHWOurzAze8lHfg6PhzYDD+Zpdhfoy79Bm4ujde1d+afDjysxyP2fdT1ALe+Kh9r76hw4cBmdg/WkWRsvV5IRts9kqzbgWSS72+QrF3Bre/LkWTe9ySjYV6TrPUTydr4Csn86MDDfJxJ5nYgmfb1J5LtHdhstfpdJCPAF5Kx0TmQrNkryVrckazf1bQG/zuS1f5CMq8XJOv9RLI+LkhWLxx4mI17ko2Dko2zkpWjkkX/ppKNGyUbJyUrL0oW/UbJ4qxk8TUls2slGxdKFkcliysls5OSje9TsnlQsnlSsnxQsrhVsnmvZPNWyfKrksWFklk+KRn7xzPJ4sqBzey8VzJ2oy8kY3w6kox5/kiy+S0lM7tWMnZAB5JFvCjZzNdKZnZSMvYK9ySLuFQyptITydi3vpJsnccdSRbjqGQ6n/0Okll5VTIrRyVj5Hkh2bQ7JbMrIXmYrXdKpg3ojmTaq55JVk9KZvVCyeJKSh9m75XM2quSWTspWfhRyWb9lpJZu1Yya0clC39Rslmvlcz8pGTmX1GyODmwmW9nJTM/KBn78guStaOSzfZdSmb9Vcm0bzyQrL4q2fQ7JbOrkehp9k7JdFy6J5lfKdk4K9m4UrKroXAz27+iZOOgZOOsZOWoZLN/U8lOQvIwHycls1clGzdKFmcli68p2UlKH+YvlGwelWxeKVk+KVl8n5LNg5LNk5Llg5LFpmT3e9Kytnd60zGXRzpO0GHv0FsBbfye/66XWGMag/Xj1YBO08rHdV3Wqc96xaiXvZG3SNYNOvJgi6vDFr3vqt68bS+cqt4I67xpu0vxbY8EW7cxZlmvJGrV3/pcTC8bdfr4cHk58uFMWdf5WQc4HQHp1WTzGVh/WinLIx2h6FBGL1P2Lm/LzM1lHbXopYmCeH52ZhS8TrV13jyXgdfF8gp/HVE9XPbeXS/LfHfd1nI1dFhTZ72IO687dArY3Nvo22ugp8cff9Ypa4yR21wnp+Xx+bi+Lbed95lHa37MaNnSqTPSJ8h6p2af4PhGi1jvKK1Wr+tF8uOzg1BoKGF6L9Frs1daPP4IY7ZGevNlC52uv313l45IdGzVUE4Wqx8Yuu84mBcz5vZeAMeAqT2NbHesIz8aErHoRLQ9P08j9cMhaKM3mW6vrNiiWjfUmPB4vbtYR6iWX7mldxLaKDX2DnOz8gHh5pMKrj4cZqyL9Xd3XWCoGNhkt76i3rviy5W2Trmb3ky6v/KBXy8OYA/7gU/tX+qTPH9+vnKi1RjG+UgYTm+15VRaQ8Z3Htap1NImljPVx/86CbNdS0nC817LtqOqi7PHJb866Wy1WJ4vHf3uVNl8DVX+9utf/vuH/wMn70QG
| null |
2,596 |
Order of Prime in Factorial
|
For a given prime $p$, define $\operatorname{ord}_p(k)$ as the multiplicity of $p$ in $k$, i.e. the number of times $p$ appears in the prime factorization of $k$.
For a given $p$ (prime) and $L$, let $F(p,L)$ be the number of integers $n$ such that $1 \le n \le L$ and $\operatorname{ord}_p(n!)$ is divisible by $p$. Here $n!$ denotes the factorial of $n$.
Your job is to calculate $F(p,L)$ given $p$ and $L$.
**Input Format**
The first line contains the number of test cases $T$.
Each of the next $T$ lines contains two integers $p$ and $L$ separated by a space.
**Output Format**
For each test case, output one line containing $F(p,L)$.
**Constraints**
$1 \le T \le 100000$
$2 \le p \le 10^{18}$
$1 \le L \le 10^{18}$
$p$ is prime
**Sample input**
2
2 6
3 6
**Sample Output**
2
2
**Explanation**
Here are the first 6 factorials: 1, 2, 6, 24, 120, 720.
The multiplicities of 2 in these numbers are: 0, 1, 1, 3, 3, 4.
Exactly two of these are divisible by 2 (0 and 4), so $F(2,6) = 2$.
The multiplicities of 3 in these numbers are: 0, 0, 1, 1, 1, 2.
Exactly two of these are divisible by 3 (0 and 0), so $F(3,6) = 2$.
|
hackerrank
|
Hard
|
{
"class_name": "Result",
"func_sign": [
"public static long solve(long p, long l)"
],
"script_name": "Solution",
"solution": "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 Solution {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tfor(int T = ni();T >= 1;T--){\n\t\t\tlong P = nl();\n\t\t\tlong L = nl();\n\t\t\tlong[] f = new long[100];\n\t\t\tlong n = L;\n\t\t\tfor(int i = 0;n > 0;i++, n /= P){\n\t\t\t\tf[i] = n % P;\n\t\t\t}\n\t\t\tlong d = 0;\n\t\t\tfor(int i = 99;i >= 2;i--){\n\t\t\t\td += f[i];\n\t\t\t\tif(d >= P)d -= P;\n\t\t\t}\n\t\t\tlong base = L/P/P*P*P/P;\n//\t\t\ttr(d, base, f[1], f[0]);\n\t\t\tif(d == 0 && f[1] > 0 || d + f[1] > P){\n\t\t\t\tbase += P;\n\t\t\t}else if(d + f[1] == P || d + f[1] == 0){\n\t\t\t\tbase += f[0]+1;\n\t\t\t}\n\t\t\tout.println(base-1);\n\t\t}\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 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}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return a LONG_INTEGER.\n * The function accepts following parameters:\n * 1. LONG_INTEGER p\n * 2. LONG_INTEGER l\n */\n\n public static long solve(long p, long l) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int t = Integer.parseInt(bufferedReader.readLine().trim());\n\n for (int tItr = 0; tItr < t; tItr++) {\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n long p = Long.parseLong(firstMultipleInput[0]);\n\n long l = Long.parseLong(firstMultipleInput[1]);\n\n long result = Result.solve(p, l);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n }\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"solution": "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 Solution {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\n \n static void solve()\n {\n for(int T = ni();T >= 1;T--){\n long P = nl();\n long L = nl();\n long[] f = new long[100];\n long n = L;\n for(int i = 0;n > 0;i++, n /= P){\n f[i] = n % P;\n }\n long d = 0;\n for(int i = 99;i >= 2;i--){\n d += f[i];\n if(d >= P)d -= P;\n }\n long base = L/P/P*P*P/P;\n// tr(d, base, f[1], f[0]);\n if(d == 0 && f[1] > 0 || d + f[1] > P){\n base += P;\n }else if(d + f[1] == P || d + f[1] == 0){\n base += f[0]+1;\n }\n out.println(base-1);\n }\n }\n \n public static void main(String[] args) throws Exception\n {\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 {\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 {\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 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 {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n private static 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 static 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 static 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 static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return a LONG_INTEGER.\n * The function accepts following parameters:\n * 1. LONG_INTEGER p\n * 2. LONG_INTEGER l\n */\n\n public static long solve(long p, long l) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "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\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int t = Integer.parseInt(bufferedReader.readLine().trim());\n\n IntStream.range(0, t).forEach(tItr -> {\n try {\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n long p = Long.parseLong(firstMultipleInput[0]);\n\n long l = Long.parseLong(firstMultipleInput[1]);\n\n long result = Result.solve(p, l);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n } catch (IOException ex) {\n throw new RuntimeException(ex);\n }\n });\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static final int MOD = 1000000007;\n static Scanner sc;\n private static PrintWriter out;\n\n public static void main(String[] s) throws Exception {\n sc = new Scanner(System.in);\n// sc = new MyScanner(new BufferedReader(new StringReader(\"4 5 2 1 6 1 1 5 3\")));\n out = new PrintWriter(new OutputStreamWriter(System.out));\n long t = System.currentTimeMillis();\n solveT();\n out.flush();\n }\n//\n// private static void calcT(String s) {\n// sc = new MyScanner(new BufferedReader(new StringReader(s)));\n// solveT();\n// }\n//\n// private static void calc(String s) {\n// sc = new MyScanner(new BufferedReader(new StringReader(s)));\n// solve();\n// }\n\n private static void solve() {\n long p = sc.nextLong();\n long l = sc.nextLong();\n// System.out.println(p + \" \" + l);\n\n long inp = l;\n long res = 1;\n while (inp >= p) {\n res *= p;\n inp /= p;\n }\n\n\n out.println(ctl(p, l +1, 0) - 1);\n }\n\n\n static long ctl(long p, long l, long s) {\n if (l / p < p || p * p == l) {\n s %= p;\n s += p;\n s %= p;\n l -= p * s;\n return Math.max(0, Math.min(l, p));\n }\n\n long inp = l;\n long res = 1;\n while (inp >= p) {\n res *= p;\n inp /= p;\n }\n long bc = (l / res);\n\n return res / p * bc + ctl(p, l - res * bc, s - bc);\n }\n\n // 00 11\n // 11 00\n\n // 11 00\n // 00 11\n\n\n\n\n // 000 //111 // 222\n // 111 //222 // 000\n // 222 //000 // 111\n\n // 111 //222 // 000\n // 222 //000 // 111\n // 000 //111 // 222\n\n // 222 //000 // 111\n // 000 //111 // 222\n // 111 //222 // 000\n\n\n private static long mod(long v) {\n return v % MOD;\n }\n\n private static void solveT() {\n int t = sc.nextInt();\n while (t-- > 0) {\n solve();\n }\n }\n\n private static long gcd(long l, long l1) {\n if (l > l1) return gcd(l1, l);\n if (l == 0) return l1;\n return gcd(l1 % l, l);\n }\n\n private static long pow(long a, long b, long m) {\n if (b == 0) return 1;\n if (b == 1) return a;\n long pp = pow(a, b / 2, m);\n pp *= pp;\n pp %= m;\n return (pp * (b % 2 == 0 ? 1 : a)) % m;\n }\n\n\n static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n MyScanner(BufferedReader br) {\n this.br = br;\n }\n\n void findToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n }\n\n String next() {\n findToken();\n return st.nextToken();\n }\n\n int[] na(int n) {\n int[] k = new int[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.nextInt();\n }\n return k;\n }\n\n long[] nl(int n) {\n long[] k = new long[n];\n for (int i = 0; i < n; i++) {\n k[i] = sc.nextLong();\n }\n return k;\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\n}\n",
"template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return a LONG_INTEGER.\n * The function accepts following parameters:\n * 1. LONG_INTEGER p\n * 2. LONG_INTEGER l\n */\n\n public static long solve(long p, long l) {\n // Write your code here\n\n }\n\n}\n\n",
"template_head": "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\n",
"template_tail": "public class Solution {\n public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n int t = Integer.parseInt(bufferedReader.readLine().trim());\n\n IntStream.range(0, t).forEach(tItr -> {\n try {\n String[] firstMultipleInput = bufferedReader.readLine().replaceAll(\"\\\\s+$\", \"\").split(\" \");\n\n long p = Long.parseLong(firstMultipleInput[0]);\n\n long l = Long.parseLong(firstMultipleInput[1]);\n\n long result = Result.solve(p, l);\n\n bufferedWriter.write(String.valueOf(result));\n bufferedWriter.newLine();\n } catch (IOException ex) {\n throw new RuntimeException(ex);\n }\n });\n\n bufferedReader.close();\n bufferedWriter.close();\n }\n}\n"
}
|
{
"class_name": null,
"func_sign": [
"solve(p, l)"
],
"solution": "T = int(input())\n\ndef ok(p, L):\n sum = 0\n while L > 0:\n sum += L % p\n L //= p\n return sum % p\n\ndef solve(p, L):\n L1 = L // p\n r = p - ok(p, L1)\n if r == p:\n r = 0\n if r < L % p:\n return L1 + 1\n else:\n return L1\n\nfor t in range(T):\n p, L = map(int, input().split())\n L += 1\n L1 = L // p\n ans = 0\n if ok(p, L1) == 0:\n ans += L % p\n print(ans + solve(p, L1) * p - 1)\n ",
"template": "#\n# Complete the 'solve' function below.\n#\n# The function is expected to return a LONG_INTEGER.\n# The function accepts following parameters:\n# 1. LONG_INTEGER p\n# 2. LONG_INTEGER l\n#\n\ndef solve(p, l):\n # Write your code here\n\n",
"template_head": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\n",
"template_tail": "if __name__ == '__main__':\n fptr = open(os.environ['OUTPUT_PATH'], 'w')\n\n t = int(input().strip())\n\n for t_itr in range(t):\n first_multiple_input = input().rstrip().split()\n\n p = int(first_multiple_input[0])\n\n l = int(first_multiple_input[1])\n\n result = solve(p, l)\n\n fptr.write(str(result) + '\\n')\n\n fptr.close()\n"
}
|
eJx9mM2OZDsRhFnwEuysXl8hO/2bvAhINLCAWbBp7mKuhISQeAh4X75I+0zVVHXNjNTurjrHzoz8iUj/59f/+/NvfhX//vB7fvnjv97+/vHzL1/ffpfeSn//sDr7qCmW9f5RbNkYJZ1VH9SWZ+p9eu2Vv3OzWlMs8XpqM54a3apl3qzd17RWMh+vXsbUw97z4O/ZWi1prFJ54v2j1earpFhMu/SFLS17dT0+Vqsz6afezXN2z4v3iz5ZPTd97LmYp8YrbPL+4bPkmjChFP6qs7blSYtjz9tP6e3LP3/+8tevX/72l3/88vXgEM7b5Xw+To/jLF+Y3bl4+XX5k48f+Thg2/B7k/Ox89hnxzD+fPv3T+k+Iu8fPVl/aWl7esO115y1WBPQfVpZZgpc64NwtJmJrwzg6y7Tmw/v3YCxYFIeTQFsbjPn7gqG8XnRK9XLXKU318Zeaq2uWDf2GENZU4pNwRIfL8AjU/Y6BMowJxAEdOWRe60v3bo8GMdsmStb7w18Nkvp+mSADr4d9z1WbOmtd/JhlM6Leh97gRCzY2ewI7ljAeqhPCQbS3LrlvvSkS9c0MYySKbXs5PdtshPxhhPjdqXks7TJBt86E23RckoZn1OpUOkTanG16kTztwU3bwGdVk71ZStj1GLMqHkARyUSMu1s4d2IPBKxpqUb8XTEsp9Rl2MOWqTuZVM5zmWqlfYO0+FzjjDe81Du58EclJZcdYaGzcLAwd2D6Je4qBahnbMwOJRC26FY7t2acAPJtqNrpKVYFp7k/t0j9SprMku08An++Q4y0atmQyhLClvLCNqtnr1Gobx55ovA/Q9wlikBhSwEptPMFQg9ZR8WQexdZAaN4hUyxcokb4HinEguHfdLn/X9nPcHBw3r6LXPHeG8HCNJacXaaWz2iyr0kwJ0ypeytxW51pn6UsxYk96b9PLdN2pz7R6HIKnvDp9mkWDMBBOYy6Xoz0pMQbPNEyfaVIwjmcrDqbkEsCPqjQ22SQPinscq3W3Cq+NrKVZYlE0nzZAQz08j9m6i1JI/6K4FELQV21KEQqj4k9/XXABht2hYHeuj8vfcfy04x9ru3k1ji/rtPiwfxy7BcmdkZHTd1Y9hMejVFegAU7kK2kOBPRA0s3wiXrEPnbTQYva6BM4umCZ+FLgYI6b0YyUNnMqMVIssmkNqgKotK5o8HmxN4FP0xtk2JRgM9vi+FiiQfJ6dGqtPdJ7Eg6V3OotjuzBVHTROSEMmtxYcwoxiKSKVOgy5YS546exW4uwNWX7pAlTFTINVoHZaxaNLSUTR5Q2/XXjbxsvDnuAZxxYTj/9HgV1hgeX7fLVbj7y2IM3Ywe6X4X9YPAnZRfuZv176UQ/3z69WVQFk77bmqs5vMpkPTaeCSL0C6DmDb2i5wOY4Mmprg8OwYy5wrsdJjAotOHtiu5GlqzMp2zgjX421frwduVM/c1aWytR93DQzIperPqg0X3TMrSbwKITz9BdUHDveWZVtpMr3kQaPLUqwQuhpOauACQFzmsmobqt7BG7SjHxNCKBT9i+BlEmV0Vmai7pp8JC++TFOT0HO8lovjaEXRWiK0c3jKMDo+isDQoXUcQaXZvs661GMWbD9aYDofzQsbJGckVrkUeQmjsicqZWgMtrdAIaBY2a/ld80Hz5D0KqnJnQmNCnAJODU1JC6w9kzkm/59jlW8D49TE268REZHsXgjvclT71IM5yB2/e2F6oSuTcQajXxoVd9Mo7oPKFkjTVMyRj4zAu/z8pgfDAJakoAXhTVqCIxTrIpawuBu8SIJo+u5eITkwdknoKptbd5UntDD41+aArkMPKGjhZE4KWIe9xmwe08G3HXs6QmkCYM78IC/yQuvKgvFcFKZvt2GrbRjuAhGE668GK63j7du7Ypz0XtvQmYZTq0xKqUVOBpiqtEasmHkUVmxgBBnP1RqpUEggtvvsjeSA1QtOmYzqsDnQOrXhytuniZnWQQBRya3NM/oaM9J2Yh1ZCsFMsr6eO7820bV5k3DdbHgxYO68eT/q0v0q+FH8t3Mp4ptu6HWJkNdoGY+cQ06xd3kXV0TTiwFCxvN772uRI93j8+bggF7iZMaC6BHnBm1WjCXWLWWqvPzjovL6ud57LRbmEhhBtD1oSc1foJN6hPhXLrhJMVF6vOgoVG8ROjhSpBuUoXIpCdBJx5shcL+rs0fYVJU0/KNUtgHnbPRrJHLRKccUsGu2Y9mUDT7kqjrfIcTpfKN0J4dObO4KzBcehipq0vgYwTup9k+Zqu2wZ9RUJahDqrqr5tRglSVotmwIkK5DIlAuSge4UDM/kUDXxlODt4ZJniSVGcA4YbZPAbitON6RtchBtHLxm3dIAIKoUJm/1qZEUHGEk220oDw3pgVXIZbVkwKKC0VDMpIifCLNQI7V5fOrXEVOj2qYaP9sjOzNKMkSoOGjsyvOy3ZOlmUkQf4aI5jVF+C34eUfcItL6ucN7wrp2OC/pesUw3wJnJ1p5z8ZXaLZU+j4YeTNFhMA29HYgj3M2VXwDed2QXTc4Zdi4AWh7cArMYnC6IXRoJ44ULM99IdrpFDXEIvw0zRbRO9wbxJIjRkgD5aUlTYbI6CnZqWVr0wpHK4161RzbX5NznGPnnLO/CqqfXe223afm2h7QBUpkM3GW/IohVddPK0hbxE5FqCYrk/I1BDPWRrpoleuIPMyJOxpeHnD/ivlbTr26xNqT7CeHreuEu52V6PO5z0VB133lozUSdwAcmjIaLaNNXIMJDDWjrt7ikR+0HGZkbB7NYMwWWSP+Gp72qrQZUqoxujNODhJHHbEW04QUS1xCZqbGqXNGCB0aEqHGihG3bFCeBhVjsIrbCkSbhOG+eGAs77qV1BJdndnA02J8hbpjaukKaTTwFEuLGXF13ZDAkSFVJT2Uv126DjnQqlRQTzEstX3XEavouUJCbBYLmy2nxFOdHXqMiFC9Knolb3Wyd4byYwrOcWlHdHX99gPhuGOy7mKxdgBUpI9o36FsB1rbmOaDpR0M41qyXZjZAWvt2SigsQPNpX6ER0TgQmEc7227Hd89+fjJbBNjBrpC840W9SForWcAIcUQHHRwPpxF8VrN1H7JhqI7q2hgiI8a8n2nUBcTSuvCS3QmAu6kRI0ZuEqmRx2yhulNU7ySrNe2GqQehd+p3dTGIuZ7iCl62pCdkrsIp6JeBbkogfinjCXj15kkdV1Gj51z69jicamC+hFZUhaGRFGB6IYSNQ0FqjCcjtK31mZnyKXqYs9CR+navMUlHGeWmN+L0trjqhdMdFvgujxNsUS+dyE+ZT3lq5pQSfFJjHTotPBV69IdgG6uRFIpmEQ3vUHysG5cEcQaKn7G3UOXYtKhMEvSzx9c0Ciw4xbYEeEMZTjzFcFzD3fCNq5gSUU/RMY2X1zRGDsEdqA/CXqH8SOy64aoXTCOA5/d4ZY3WOMCKbrndQ8oONaBY20YIrn/9N/f/h//mS5K
| null |
1,232 |
nCr table
| "Jim is doing his discrete maths homework which requires him to repeatedly calculate <sup>n</sup>C<s(...TRUNCATED) |
hackerrank
|
Medium
| {"class_name":"Result","func_sign":["public static List<Integer> solve(int n)"],"script_name":"Solut(...TRUNCATED) | {"solution":"import java.math.BigInteger;\nimport java.util.*;\nimport java.io.*;\n\n\npublic class (...TRUNCATED) | {"solution":"/*\n * To change this license header, choose License Headers in Project Properties.\n *(...TRUNCATED) | {"class_name":null,"func_sign":["solve(n)"],"solution":"from math import ceil\nT=int(input())\nwhile(...TRUNCATED) | "eJxcnb3ONDmSnWXoQgpty0gyk2RS0IUI0AAypDHkzK4xC0iQo0tXPCeYPPwWg+murrcqK5MMRpw48ff//uN//S//51/+w3/7v3/(...TRUNCATED) | null |
4,264 |
Merge List
| "Shashank is very excited after learning about the *linked list*. He learned about how to *merge* tw(...TRUNCATED) |
hackerrank
|
Medium
| {"class_name":"Result","func_sign":["public static int solve(int n, int m)"],"script_name":"Solution(...TRUNCATED) | {"solution":"import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimpor(...TRUNCATED) | {"solution":"import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimpor(...TRUNCATED) | {"class_name":null,"func_sign":["solve(n, m)"],"solution":"t = int(input())\nfor _ in range(t):\n (...TRUNCATED) | "eJyNVb2Ok0kQJCDgMUaOEeqe/r9HICNDwugC2OASQ7BISKeT7iHgfaker1mf159vN7Dn+9zTXV1V3fvvy5/vXr1Yf+/f4vDh791(...TRUNCATED) | null |
3,548 |
Mehta and the Typical Supermarket
| "Mehta is a very rich guy. He has $N$ types of coins, and each type of coin is available in an unlim(...TRUNCATED) |
hackerrank
|
Hard
| {"class_name":"Result","func_sign":["public static List<Integer> solve(List<Integer> a, List<List<In(...TRUNCATED) | {"solution":"import java.io.*;\n\npublic class HR_mehta_and_the_typical_supermarket {\n\n public (...TRUNCATED) | {"solution":"import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tBufferedReader b(...TRUNCATED) | {"class_name":null,"func_sign":["solve(a, days)"],"solution":"import itertools, math\ndef findsubset(...TRUNCATED) | "eJyNnMvOLclRhRnwIKUeWygr78mER2CKxEEMwAMmjQe2hIQs8RDwvnzfyn3c3ad9LLfs/qv3pSovEStWrIjc//O3//cP//g3+ee(...TRUNCATED) | null |
1,932 |
Sherlock and Pairs
| "Sherlock is given an array of $N$ integers ($A$<sub>$0$</sub>, $A$<sub>$1$</sub> ... $A$<sub>$N-1$<(...TRUNCATED) |
hackerrank
|
Medium
| {"class_name":"Result","func_sign":["public static int solve(List<Integer> a)"],"script_name":"Solut(...TRUNCATED) | {"solution":"import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n static void so(...TRUNCATED) | {"solution":"import java.util.Scanner;\nimport java.util.Arrays;\npublic class Solution{\n public(...TRUNCATED) | {"class_name":null,"func_sign":["solve(a)"],"solution":"#!/usr/bin/env python\n\nimport collections,(...TRUNCATED) | "eJyEnUuubcuSVCnQkK1XzkJEzPjSANqAxJUoQBaoXCgkEhJCokqvsTF8XwklmYlA7+Y5Z++15oyPf8zNzf/Xv/53//vftn/17//(...TRUNCATED) | null |
5,183 |
Anti-Palindromic Strings
| "You are given two integers, $N$ and $M$. Count the number of strings of length $N$ (under the alpha(...TRUNCATED) |
hackerrank
|
Medium
| {"class_name":"Result","func_sign":["public static int solve(int n, int m)"],"script_name":"Solution(...TRUNCATED) | {"solution":"import java.io.*;\n\npublic class HR_antipalindromic_strings {\n\n final static long(...TRUNCATED) | {"solution":"import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n\npublic class (...TRUNCATED) | {"class_name":null,"func_sign":["solve(n, m)"],"solution":"P = 10**9 + 7\n\ndef f(n, m):\n\tif n == (...TRUNCATED) | "eJyVVruO5FQQJSDhL0odr1C9H3wJEo0IYAKSZoNdaSWEREhGAv/LKQ+Mlp7xsFgjj9u+vnXqPKr718///P2Lz47j699w8c3Plx9(...TRUNCATED) | null |
3,320 |
Lexicographic paths
| "Krishnakant is standing at $(0,0)$ in the [Cartesian plane](http://en.wikipedia.org/wiki/Cartesian_(...TRUNCATED) |
hackerrank
|
Medium
| {"class_name":"Result","func_sign":["public static String solve(int x, int y, int k)"],"script_name"(...TRUNCATED) | {"solution":"import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static Rea(...TRUNCATED) | {"solution":"import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution (...TRUNCATED) | {"class_name":null,"func_sign":["solve(x, y, k)"],"solution":"import math\n\n\ndef paths(n, m):\n (...TRUNCATED) | "eJyNVUuu1DAQZIHENVpZPyG3HTsJJ/AJLCSCWMAs2IS3mCchoSdxCFiw46j0z5kwSQxZjB1n0lXV1d35/vLn71cv5Hr7izbvvnW(...TRUNCATED) | null |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 60