question_id
int64
39
56.8k
question_title
stringlengths
3
54
question_content
stringlengths
88
4.02k
dataset
stringclasses
1 value
difficulty
stringclasses
3 values
java
dict
java15
dict
java8
dict
python
dict
test_cases
stringlengths
28
4.02M
max_retries
float64
1
3
⌀
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$. He...
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.InputMismat...
{ "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 = ...
{ "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 MyScann...
{ "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 ...
eJx9mM2OZDsRhFnwEuysXl8hO/2bvAhINLCAWbBp7mKuhISQeAh4X75I+0zVVHXNjNTurjrHzoz8iUj/59f/+/NvfhX//vB7fvnjv97+/vHzL1/ffpfeSn//sDr7qCmW9f5RbNkYJZ1VH9SWZ+p9eu2Vv3OzWlMs8XpqM54a3apl3qzd17RWMh+vXsbUw97z4O/ZWi1prFJ54v2j1earpFhMu/SFLS17dT0+Vqsz6afezXN2z4v3iz5ZPTd97LmYp8YrbPL+4bPkmjChFP6qs7blSYtjz9tP6e3LP3/+8tevX/72l3/88vXgEM7b5Xw+...
null
1,232
nCr table
Jim is doing his discrete maths homework which requires him to repeatedly calculate <sup>n</sup>C<sub>r</sub>(n choose r) for different values of n. Knowing that this is time consuming, he goes to his sister June for help. June, being a computer science student knows how to convert this into a computer program and gen...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static List<Integer> solve(int n)" ], "script_name": "Solution", "solution": "import java.math.BigInteger;\nimport java.util.*;\nimport java.io.*;\n\n\npublic class Solution {\n\t\n\tprivate static BigInteger mod = BigInteger.valueOf(1000000000);\n\t\n\tpri...
{ "solution": "import java.math.BigInteger;\nimport java.util.*;\nimport java.io.*;\n\n\npublic class Solution {\n \n private static BigInteger mod = BigInteger.valueOf(1000000000);\n \n private static void compute(int input){\n \n BigInteger up = BigInteger.ONE;\n BigInteger down = B...
{ "solution": "/*\n * To change this license header, choose License Headers in Project Properties.\n * To change this template file, choose Tools | Templates\n * and open the template in the editor.\n */\n//package Combinatorics;\n\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\n/**\n *\n * @author anurag...
{ "class_name": null, "func_sign": [ "solve(n)" ], "solution": "from math import ceil\nT=int(input())\nwhile(T>0):\n T-=1\n N=int(input())\n temp=1\n print(1,end=' ')\n for i in range(1,N+1):\n temp=temp*(N-i+1)//i\n print(temp%10**9,end=' ')\n print('')", "template": "#\n#...
eJxcnb3ONDmSnWXoQgpty0gyk2RS0IUI0AAypDHkzK4xC0iQo0tXPCeYPPwWg+murrcqK5MMRpw48ff//uN//S//51/+w3/7v3/9r3/867/986///Pur9Odv/yil/e0ftf/tH6Nf8eKt8Y9W4h91xh+fO/7Q4hPlin/0qf+MP8wSX216Fd/q/PG544/6f3x7dq4Qn6l3fKaVNz5UBteP/xr84hV/HHf8o3d+vMx1vefmNrihp+vSXOSNb7zc0Dvj4nGdMV7eiU/pIUbZN/DM9fmi56nczMuXeLL7+R5lxv9v7r1c8Y+7czn+cbebW+Ui...
null
4,264
Merge List
Shashank is very excited after learning about the *linked list*. He learned about how to *merge* two linked lists. When we merge two linked lists, the order of the elements of each list doesn't change. For example, if we merge $[1, 2, 3]$ and $[4,5,6]$, $[1,4,2,3,5,6]$ is a valid merge, while $[1,4,3,2,5,6]$ is not a v...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int solve(int n, int m)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n private static MyScanner sc;\n priv...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n private static MyScanner sc;\n private static PrintWriter out;\n\n public static void main(String[] args) {\n /* Enter your code here. Read input ...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\nimport java.util.Scanner;\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int T = sc.nextInt();\n int m;\n ...
{ "class_name": null, "func_sign": [ "solve(n, m)" ], "solution": "t = int(input())\nfor _ in range(t):\n n, m = map(int, input().split())\n ret = 1\n for i in range(n + 1, n + m + 1):\n ret *= i\n for i in range(1, m + 1):\n ret //= i\n print(ret % (10**9 + 7))", "template": ...
eJyNVb2Ok0kQJCDgMUaOEeqe/r9HICNDwugC2OASQ7BISKeT7iHgfaker1mf159vN7Dn+9zTXV1V3fvvy5/vXr1Yf+/f4vDh791fh6/f7nd/jF3sD8Kj9oewoYwHGkx40hF46ceH4R2QI/eH3euxu/v+9e7T/d3nP798u39IM0NUMhPRM4soxXx/SA13sol7FTIlpQMSP+8PnM5ZkghzEkvh2v3zepxBU+SSEbI/mI3ElcRT348hso2EmXxaIF41iH2qIUNNZU1DzpwEiEx6Ua7x5jB0mj4Sd1xH4WWAHhCDnybe5QjerM0sJhkNGd3W...
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 unlimited supply. So Mehta goes to a supermarket to buy monthly groceries. There he sees that every item has a unique price, that is, no two items have the same price. Now, the supermarket owner tells Mehta that they are...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> solve(List<Integer> a, List<List<Integer>> days)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.A...
{ "solution": "import java.io.*;\n\npublic class HR_mehta_and_the_typical_supermarket {\n\n public static void solve(Input in, PrintWriter out) throws IOException {\n int n = in.nextInt();\n long[] a = new long[n];\n for (int i = 0; i < n; ++i) {\n a[i] = in.nextLong();\n }\n...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tstatic long gcd(long a, long b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\n\tstatic long lcm(long a, long b) {\n\t\treturn a / gcd(a, b) * b;\...
{ "class_name": null, "func_sign": [ "solve(a, days)" ], "solution": "import itertools, math\ndef findsubsets(S,m):\n return set(itertools.combinations(S, m))\n\ndef createInitial():\n l = [int(input()) for i in range(int(input()))]\n ln = list()\n for x in range(len(l)):\n yes = 1\n ...
eJyNnMvOLclRhRnwIKUeWygr78mER2CKxEEMwAMmjQe2hIQs8RDwvnzfyn3c3ad9LLfs/qv3pSovEStWrIjc//O3//cP//g3+eefNhf//N8//MePv/vD73/4++eHt3/5se0vP9b3y4/v+PIj/2vry4+98Df/5fu+eHI5/Njk47z57ln7HL32h8szV5ubt94+Z1m1l/d5+yqtjzn99Cp9vL2O83h5Tq+7+OlWThtj+Gm+U986M5T3FO7Y2uPlrG0uRvG++2ye6Kff0/qe8/Xefb21cNfiI884h88w3nfWPXc/T38Xb6x5vAXjrO11HC+v...
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$</sub> by Watson. Now Watson asks Sherlock how many different pairs of indices $i$ and $j$ exist such that $i$ is not equal to $j$ but $A$<sub>$i$</sub> is equal to $A$<sub>$j$</sub>. That is, Sherlock has to count t...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int solve(List<Integer> a)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tstatic void solve() throws IOException {\n\t\tint tc = nextInt();\n\t\twhile (tc-- > 0) {\n\t\t\tint n = nex...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n static void solve() throws IOException {\n int tc = nextInt();\n while (tc-- > 0) {\n int n = nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] ...
{ "solution": "import java.util.Scanner;\nimport java.util.Arrays;\npublic class Solution{\n public static void main(String[] args){\n Scanner in = new Scanner(System.in);\n int t = in.nextInt();\n long[] arr = new long[t];\n for(int i = 0; i < t; i++){\n int n = in.nextInt()...
{ "class_name": null, "func_sign": [ "solve(a)" ], "solution": "#!/usr/bin/env python\n\nimport collections, math, sys\n\n\nif __name__ == '__main__':\n T = int(sys.stdin.readline())\n \n for _ in range(T):\n \tN = int(sys.stdin.readline())\n \tA = sorted(map(int, sys.stdin.readline().split()...
eJyEnUuubcuSVCnQkK1XzkJEzPjSANqAxJUoQBaoXCgkEhJCokqvsTF8XwklmYlA7+Y5Z++15oyPf8zNzf/Xv/53//vftn/17//H3/7zn//1v/3D3/7Nz9++P/7sf/x5vzf6/ePP/cef4/vez1t79P6z3+7f+Hn9W/v+3Hbe97O++doff7785Dv3/fQx2mo/75w77s+Yra/84mmt9Z/Ve3vr5835vvvT3+pz/7y92xx//Pm3v/v529//9//69//xH/7+P/2H//Lf/uH3gfLZ/P+//c+/+/m/HjPP2E++dZ23xk+eZ4zx8+UxTx62j/3x...
null
5,183
Anti-Palindromic Strings
You are given two integers, $N$ and $M$. Count the number of strings of length $N$ (under the alphabet set of size $M$) that doesn't contain any palindromic string of the length greater than $1$ as a consecutive substring.
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int solve(int n, int m)" ], "script_name": "Solution", "solution": "import java.io.*;\n\npublic class HR_antipalindromic_strings {\n\n final static long mod = 1000000007;\n\n static long modPow(long x, long pow, long mod) {\n long r = 1;...
{ "solution": "import java.io.*;\n\npublic class HR_antipalindromic_strings {\n\n final static long mod = 1000000007;\n\n static long modPow(long x, long pow, long mod) {\n long r = 1;\n while (pow > 0) {\n if (pow % 2 == 1) {\n r = r * x % mod;\n }\n ...
{ "solution": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n\npublic class B {\n\n static final int MOD=1000000007;\n\n long modPow(long a,int st){\n if(st==0)return 1;\n long b=modPow(a,st/2);\n b*=b;\n b%=MOD;\n if(st%2!=0){\n b*=a;\n ...
{ "class_name": null, "func_sign": [ "solve(n, m)" ], "solution": "P = 10**9 + 7\n\ndef f(n, m):\n\tif n == 1:\n\t\treturn m % P\n\tif n == 2:\n\t\treturn m * (m - 1) % P\n\tif m <= 2:\n\t\treturn 0\n\treturn m * (m - 1) * pow(m - 2, n - 2, P) % P\n\nt = int(input())\nfor _ in range(t):\n\tn, m = map(int, i...
eJyVVruO5FQQJSDhL0odr1C9H3wJEo0IYAKSZoNdaSWEREhGAv/LKQ+Mlp7xsFgjj9u+vnXqPKr718///P2Lz47j699w8c3Plx9vb9+/u3xFl7reqrPE24SER4ajr7duzohhpu7EnXLGzVQO6Wky5cSHwdsjLVPNRTYRNWx+vSnXuOo46bCUSWNlcpVnupJn22SOXW94mChbQ84c5RpxvV3e0OXhw9uH7989/PDdT+/f/Y01xDkMta43A9CcCdSSmMJNR4UOizCOBIIB5kjHpVWES22nog6wNZdf3tBHJCjasE4sdOBI78TywSaNbkwj...
null
3,320
Lexicographic paths
Krishnakant is standing at $(0,0)$ in the [Cartesian plane](http://en.wikipedia.org/wiki/Cartesian_coordinate_system). He wants to go to the point $(x,y)$ in the same plane using only horizontal and vertical moves of $1$ unit. There are many ways of doing this, and he is writing down all such ways. Each way comprises o...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String solve(int x, int y, int k)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static Reader in;\n private static PrintWriter out;\n\n public static void main(String[] args...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static Reader in;\n private static PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n in = new Reader();\n out = new PrintWriter(System.out, true);\n \n \n int[][] comb = new in...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution {\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\tstatic final int N = 10;\n\tstatic ArrayList<String>[][] res = new ArrayList[N + 1][N + 1];\n\t\n\tstatic void solve() t...
{ "class_name": null, "func_sign": [ "solve(x, y, k)" ], "solution": "import math\n\n\ndef paths(n, m):\n if min(n, m) < 0:\n return 0\n return math.factorial(n+m) / math.factorial(n) / math.factorial(m)\n\n\nif __name__ == '__main__':\n T = int(input())\n for cs in range(T):\n res = []\n ...
eJyNVUuu1DAQZIHENVpZPyG3HTsJJ/AJLCSCWMAs2IS3mCchoSdxCFiw46j0z5kwSQxZjB1n0lXV1d35/vLn71cv5Hr7izbvvnWfl8ena/cGun5eECL4eelpGWgdIEA/zIuHATDNS/cA3eXr4+Xj9fLpw5enq71YSi6lzAstOfN+XmTln0zHRQ5L6Z4fYIMX5yUAOvBj4F0CxHmZCGqKY+RdgDAwGQ+hgW0XgxGuIuUisDkbIzrkh3qf6x0/u+NEQMQDbOk5BQjuFN0CWrBsGHkfN5nWiSRSisE7Du1F8gAkMY2UfUdJSInPCLsBK3pM...
null
746
Game Of Thrones - II
This follows from [Game of Thrones - I](https://www.hackerrank.com/contests/july13/challenges/game-of-thrones). Now that the king knows how to find out whether a given word has an [anagram](https://en.wikipedia.org/wiki/Anagram) which is a [palindrome](http://en.wikipedia.org/wiki/Palindrome) or not, he encounters ano...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int solve(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.math.BigInteger;\n\npublic class Solution {\n\n static final long mod = 1000000007;\n\n public static void solve(Input in, PrintWriter out) throws IO...
{ "solution": "import java.io.*;\nimport java.math.BigInteger;\n\npublic class Solution {\n\n static final long mod = 1000000007;\n\n public static void solve(Input in, PrintWriter out) throws IOException {\n String s = in.next();\n int[] counts = new int[26];\n for (char c : s.toCharArray(...
{ "solution": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\n\npublic class Solution {\n BufferedReader reader;\n\n int nextInt() throws IOException {\n tokenizer.nextToken();\n return (int) tokenizer.nval;\n }\n\n String next() throws IOException {\n tokenizer.nextToken();\n ...
{ "class_name": null, "func_sign": [ "solve(s)" ], "solution": "def fact_mod_p_brute(n, p):\n\t\n\tif n == 0:\n\t\treturn 1\n\n\tres = 1\n\tfor i in range(1, n+1):\n\t\tres *= i\n\t\tres = res % p\n\treturn res\n\ns2 = [0 for i in range(270)]\ns = str(input())\n\nfor l in s:\n\ts2[ord(l)]+=1\n\nc = 0;\nsum ...
eJyMnEkOHMl5hb3wxrdocK2Fm6LY3T6JARswYp7nOQQBXvoAOrBfFLwwCBCQpIYksqoyM+L/3/teZGT+9z//+//8/V/+6T/++sXEPPqXf/vlS/zP+OVPv3wROwvWBf+vNPr//c2vX/72p1/+3yf3/oc/Wo35hz/rZd9dbl/rz7/y9V9/+BJf1o0myeCRHDeJi4TwKOdOap7tykq8KTlteX/TZHPkpz/+Hb/+27fff/3+wyGkE4LMw7ipWi4+8bWV6ynnakXqiXVITsi5xFwnFSvDZnakP7LEnr1OPc26CLslr5lFVdoGqcSJUorMWXdS...
null
20,591
Super Humble Matrix
Sherry likes matrices a lot, but her favorite ones are *humble matrices*. An $N \times M$ matrix (we'll call it $A$) is *humble* if: - It contains all the elements in range $[1 , N \times M ]$ exactly once. - For any $2$ elements $(i_1, j_1)$ and $(i_2, j_2)$ in matrix $A$:<br> If $i_1 + j_1 \lt i_2 + j_2$ , then $A_...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int solve(int n, int m)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {...
{ "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 B {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n void solve(...
{ "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 B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "solve(n, m)" ], "solution": "M = 10**9 + 7\n\ndef main():\n n, m = map(int, input().split())\n result = solve(n, m)\n result_mod = result % M\n print(result_mod)\n\ndef solve(n, m):\n if n > m:\n n, m = m, n\n product = 1\n f = 1\n for i i...
eJyVk71KQ0EQhS3yIMOtg8z/j08iqFhoCpuYIgFBBB9CCzsf1SUxIBs2MQMLt5jvnjmzZ99nn9+zi21df7WPm9fpabnarKcrmFQ8LSE8OeJ2Oc1hWrysFg/rxeP982b920WhUVJY09sc/tCE7grpiORD2L2c2Jg6ON24GFIpNYe0qBKpFHe0kJAGZLnHmM5iJCQ7oNMFEyoCj2hbeHMoLh3NKOgFnCIhR3yztz9gdrSVGAqohVKNtclFw7XXJi9TBimiHO+clNiFEXta2ugKRe4y1o6qEml32tFqUh7AIXHEdwQ1a9nbJqDxuIe9uK3/...
null
69
Picking Cards
There are N cards on the table and each has a number between 0 and N. Let us denote the number on the i<sup>th</sup> card by c<sub>i</sub>. You want to pick up all the cards. The i<sup>th</sup> card can be picked up only if at least c<sub>i</sub> cards have been picked up before it. (As an example, if a card has a valu...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int solve(List<Integer> c)" ], "script_name": "Solution", "solution": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringT...
{ "solution": "import java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) throws IOException {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n \n BufferedReader br = new Buffer...
{ "class_name": null, "func_sign": [ "solve(c)" ], "solution": "cs = int(input())\n\nfor c in range(cs):\n l = int(input())\n num = [int(i) for i in input().strip().split()];num.sort()\n rt = 1\n for i in range(l):\n if i < num[i]: rt = 0;break\n else: rt*=(i+1-num[i]);rt%=10**9+7\...
eJx0ncuqbcl2XW3wP7i6ybIKM94R+hIbJ7hgq6BKWgUJDMLgT3e01mNfgcAg5c08Z++15ozHePTRRx//9z/9l//6H//zf/hv//rHP/71T//yz3/8/c8f68+/2v7zr/r9lP7Tf9r8qfzPT7v/2Pd/y/gpxT9e/Fm5/1J/6vlp9w/H/ft6/9H413L/WX9K5Z/3x/Oz9z/vnx1/+ePXSv3zr7JGu/+c9wtLWfdb+YL7ZWWfn1PLT/nuH+7vZ5X9cw7fP+6HzPuHpff7nx+fXe8DnPtjbd2PrffH72evfv+jfD99rPvz575S6fcfY6+ffQ4f...
null
2,339
Permutation Problem
How many n-digit numbers (without leading zeros) are there such that no digit occurs more than k times? As the count of such n-digit numbers can be very large, print the answer mod (10<sup>9</sup>+7) **Input Format** The first line contains an integer, _T_ , the number of test cases. This is followed by _T_ li...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int solve(int n, int k)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Solution {\n\n\tprivate static final in...
{ "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Solution {\n\n private static final int MAX = 1001;\n private static final long MOD = 1000000007;\n static long f[][][] = new long[MAX][MAX][11];\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n static int[][] ncr_arr;\n static int[][][] max_arr;\n static final int modulus = (int)Math.pow(10, 9) + 7;\n \n public static void main(String[] args) {\n /* Enter your code here. Read input from STDIN. Print outp...
{ "class_name": null, "func_sign": [ "solve(n, k)" ], "solution": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\nfrom functools import cache\n\n#\n# Complete the 'solve' function below.\n#\n# The function is expected to return an INTEGER.\n# The function accepts following p...
eJyVWMGOZLcNzCG/kLswZyMQRUok8yUGskEOyR5y2fiwBgwYNnzJHzj/mypKr6d7ZtpGGts73a/1JIosVpXeL3/873/+9Id6ffszPvz1x5d/ffnu+68vf2kv89OXaCv105fpzebooitwUZp8+mLN8Kl7Gy/ftJfPP3z3+R9fP//z7//+/uu5O/t+cdSMMOHHxL+6hn8vP33T7lYTDuy9Sb9eTyZemXN6H+v9FLgk0gYCzjax1kSUNrrnlKhdTMeeJFrwO/aRw3sfgmh09IY3Pii3p7raXMYMYLoVveGNbxoNGfBKgbQ4yYjIhveTgKeb...
null
27,290
Tower 3-coloring
For a given integer $n$, there is a tower built from $3^n$ blocks stacked vertically. Each of these blocks can be colored in $3$ different colors: red, green or blue. How many different colorings of the tower can be created? Two colorings are considered different if and only if there exists at least one block with diff...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int towerColoring(int n)" ], "script_name": "Solution", "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismat...
{ "solution": "import java.io.*;\n import java.math.BigInteger;\n import java.math.RoundingMode;\n import java.text.DecimalFormat;\n import java.util.*;\n \n \n class Solution\n {\n \n static double eps=(double)1e-6;\n static long mod=(int)1e9+7;\n //static int arr[] =n...
{ "solution": "import java.io.*;\n\timport java.math.BigInteger;\n\timport java.math.RoundingMode;\n\timport java.text.DecimalFormat;\n\timport java.util.*;\n\t\n\t\n\tclass Solution\n\t{\n\t\n\t\tstatic double eps=(double)1e-6;\n\t\tstatic long mod=(int)1e9+7;\n\t\t//static int arr[] =new int[1000001];\n\t\tpublic s...
{ "class_name": null, "func_sign": [ "towerColoring(n)" ], "solution": "#!/bin/python3\n\nimport sys\nimport math\n\ndef power(p,z,b,c,q):\n cp=0\n while q%p==0:\n cp+=1\n q/=p\n t=q-1\n exponent=((pow(b,c,t)*z)%t+t-(cp%t))%t\n return pow(p,cp)*pow(p,exponent,q)\ndef solve(a,b,c...
eJx1k71KA1EQhS3yIGHrIPP/4xPY2QoqFrqFTUyRQEAEH0Lf1xuNILPM3GaL++2ZOXPux+rrZnXxU7fX4+PubXrZ7g776Wo9aUYEhsD9dtqsp/m4m5/28/Pj62F/vpGYEMqm0/tm/Y8cHEAA9mBwCjJ6AS1ZHCyyJc2CAUylSmZSsjm3JIenDhwKqUhB6iYt6RaDJandYhgYg1hLqoI7S1bJMQSmWD9mSCATepWUAE7tMZNhhAYWjDOM3al3ZywsM4hrqwLMyq79LlGCkBirZk9QnYr6n+ewqg7T250ujIZUiT7CJOnpBjVPCD0z0uBp...
null
11,678
Highway Construction
You are planning the next FIFA World Cup and you are counting the number of highways that need to be built to connect the cities with the venue. Your country has $n$ cities and all cities lie on a single straight road called “Highway Road”. If you want to go from City $x$ to City $y$ ( where $x \leq y$ ), you need to...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int highwayConstruction(long n, int k)" ], "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...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n static long MOD=(long)1e9+9;\n static long[][] cs = new long[1010][1010];\n static long[] invs=new long[1010];\n static long[] bs=new long[1010];\n \n ...
{ "solution": "import java.awt.*;\nimport java.io.*;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.*;\nimport java.util.List;\nimport java.util.Queue;\n\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\n\n\npublic class HR_WoC_35_HighwayConstruction implements Runn...
{ "class_name": null, "func_sign": [ "highwayConstruction(n, k)" ], "solution": "#!/bin/python3\n\nimport time\nfrom fractions import Fraction as fr\nfrom math import floor\n\ndef euclidean_alg(a,b):\n \"\"\"This function implements the Extended Euclidean algorithm. It returns\n three values. The fi...
eJztnDuuLcl2XWWoIYmyCSEjMr7shhwBLEGG9Aw5JRqPAAFBABshtoieWsUxZuy9b+Hed+oRAmTpHlTVObU/kfFZc665Ppn/9O//+f/8x3+Xn//0L/zxd//zl//+29//w59/+dvrl/brb3OVvkrbrcw5alnl6nv8+lsd5dl32Xdfta22577m8+tvY/RSZt333vdz973qNer89bfV27OfUktrqzzTUe5ff/vlb65f/vSPf/+n//rnP/23//I//uHPr6uOtp/KBfevv5VR+3xa54pPfdruc/Nqe/q97tnHL//rb67fTbczgT3GbJ3L9afM...
null
12,285
Parity Party
We need your help to divide candies at a very unusual party! There are $n$ different candies in total. There are three kinds of people at party: * $a$ of them want to get *odd* number of candies, * $b$ of them want to get *even* number of candies, * $c$ simply don't care about parity of candies they get. ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int parityParty(int n, int a, int b, int c)" ], "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...
{ "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 GS2 {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n void solv...
{ "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 GS2 {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n void solv...
{ "class_name": null, "func_sign": [ "parityParty(n, a, b, c)" ], "solution": "#!/bin/python3\n\nimport sys\nimport math \nMOD=7340033\nWW=390625\n\nROOT=[pow(WW,2**i,MOD) for i in range(17)]\n\n# Enter your code here. Read input from STDIN. Print output to STDOUT\nfrom cmath import exp, pi\n#x has length 2...
eJyVk8tKHVEQRR3ofxQ9yEil3o98SSCGDOIdOFEHVxAkkI8w/5tqMajn5rSmBv2AOqv3rl396/j32cnRU3351A9fH5ar69u7/fIZFnV1EsUEMtUEVWWQJMyL6+UUlt397e7Hfnf5/eZu/3zEuaIwlp+n8AokSpZeSkCa1iDHAonEmIJChCJHkJs7iqQDOzM0zEFIaooxwSjzAWMhvlICpBwJ+q09ugRtgEJKcwBRJnoXtpsGAidZ9JxCcUpip6QcJfV0hFutgViwNQPDW5MXb8yoOTSS0pgtSBCY3alJ2ZoEEefuWnXnM7qLjt0jWoeK...
null
2,135
Count Palindromes
A string is made of only lowercase latin letters (a,b,c,d,.....,z). Can you find the length of the lexicographically smallest string such that it has exactly $K$ sub-strings, each of which are palindromes?
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int solve(long k)" ], "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.InputMismatchExcepti...
{ "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 = ...
{ "solution": "import java.io.File;\nimport java.io.FileNotFoundException;\nimport java.time.Instant;\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Palindrom\n{\n\n\tpublic static void main(String[] args)\n\t{\n\t\tint max = 0; long count;\n\...
{ "class_name": null, "func_sign": [ "solve(k)" ], "solution": "def compute_pallindrome_length(n):\n length = 0\n debug_print = False\n current_n = 0\n\n if n == 5:\n return 4\n elif n == 8:\n return 5\n\n i = int((1 + pow(1 + 8 * n, 0.5) ) / 2) - 10\n while i*(i + 1)//2 <...
eJztms2OZUlShFnwIKNej1D8//AQ7JCQaMQCZsGmmMWMhISQeAh4X77Poqqpzu7qgQ0L1KnK7rx5zz0nwt3c3Mwj//3P//Ov+5/l62/+ih/+9l+/+6dPv//jH777y998N8f3n2rdfe3bb53ff7rl7lV262X27z/1ds+au7VyzvefRtn93l13mfX7T62OMWc/rZ37/adV7+rznt4379W979ptzFu4Z+1jj9VOr5fHjb1aKXe27cNXnb3UxYcHd6m3+rHGx7nLKqdVfuJe3KWfzTX9zu6rWurt9dxbC58bc9Reyhit7e8/zbkmi1m1L+85...
null
56,789
Combo Meal
A fast-food chain menu is selling a burger, a can of soda, and a combo meal containing a burger and a can of soda, at prices known to you. They have chosen the selling price for each item by first determining the *total cost* of making the individual items and then adding a *fixed* value to it, representing their *pr...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int profit(int b, int s, int c)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static int profit(int b, int s, ...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'profit' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER b\n * 2. INTEGER s\n * 3. INTEGER c\n */\n\n public static i...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static int profit(int b, int s, int c) {\n return b + s - c;\n }\n\n public static void main(String[] args) {\n Scanner in = new Scanner(Syst...
{ "class_name": null, "func_sign": [ "profit(b, s, c)" ], "solution": "#!/bin/python3\n\nimport sys\n\ndef profit(b, s, c):\n # Return the fixed profit.\n return b+s-c\n\nif __name__ == \"__main__\":\n t = int(input().strip())\n for a0 in range(t):\n b, s, c = input().strip().split(' ')\n...
eJztWduKJccR9IM/pJjnRdT94i8ReI0f7H0wiPGCd0FgFvQR0v86IrK7uvqc7lkwGEtoh1Pn0l2XrMzIyKien/74y7/cH/T3/Q/48ud/v/zj9ePnTy9/ci/B+/evaXSX2nCllPev1VXX3r+WEV1u0bWIa9llXosuusSP7HCx+OBqdKVGdIjDtZRcTxzqQmcb71+baw4fCSMqemEevDA29ORCwnwZ/UPF8r5jOd1xfGFQ6d4Vn13wHYu2Wpw1TlRxOVRXGvrl5EbFbH0a2INrLbheAo0pXBo2j4KGr6E0LDdc4m5TwEXHOZt3dXD+zCnp...
null
3,194
Stepping Stones Game
Bob sees his younger brother, Jack, playing **Stepping Stones**. He is fascinated by the most interesting game and decides to play it. Square boxes have been made on the ground with the help of chalk powder, and a number is assigned to each block. Bob is standing in front of these blocks. From here, he will throw a s...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String solve(long n)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\n\n\npublic class Solution {\n\tpublic static void main (String[] args) {\n\t\tScanner in = new Scanner (System.in);\n\t\tint T = in.nextInt();\n\t\twhile (T--...
{ "solution": "import java.util.Scanner;\n\n\npublic class Solution {\n public static void main (String[] args) {\n Scanner in = new Scanner (System.in);\n int T = in.nextInt();\n while (T-- > 0) {\n long N = in.nextLong();\n long lo = 0, hi = 1500000000;\n whi...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution {\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\t\n\tstatic void solve() throws Exception {\n\t\tint t = nextInt();\n\t\tfor (int tt = 0; tt < t; ++tt) {\n\t\t\tlong n =...
{ "class_name": null, "func_sign": [ "solve(n)" ], "solution": "from math import *\nt=int(input())\nfor i in range(0,t):\n n=int(input())\n j=(1+sqrt(1+8*n))/2\n if abs(j-int(j))<=0:\n print(\"Go On Bob\",int(j-1))\n else:\n print(\"Better Luck Next Time\")\n", "template": "#\n# ...
eJztmM9q20AQxnvIQ/RWoXMoO7P/e8wll5JeeihUpdBUlBAihyBDoAT6EO37dlYucRzbwa7llRCfMEZaS7Pffr8Z7Xp/nfx58+NVd3x6LSeff5ZXze28Ld8VpamaaJyztmqcM5FYa8MmSGtgx65qTIjayXV5WpT1/W192dbfv87m7b/nz+q2re+K9/PL6+Kivm+Lj1c3ddX00Fw+nBarQoN2NkmznlU0SbBSmrQno6JciVDvlQnp1zSeoRVz1ZASXVuVnM+KD01xNvtWyGCWF3p95AKISFeNtjJe9krHSMEnS8iEIJ3QcYe7FEfPxEnH...
1
2,424
Shashank and List
Shashank is a newbie to mathematics, and he is very excited after knowing that a given l of cardinality _N_ has (_2<sup>N</sup> - 1_) non-empty sublist. He writes down all the non-empty sublists for a given set _A_. For each sublist, he calculates sublist\_sum, which is the sum of elements and denotes them by S<sub>1</...
hackerrank
Medium
{ "class_name": null, "func_sign": [ "static int solve(int[] a)" ], "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\npub...
null
{ "solution": "import java.util.Scanner;\n/**\n * \n * @author Lakmal Buddika Lucky\n *\n */\npublic class Solution{\n\tstatic long divider = 1000000007;\n\tpublic static long power(long a,long b,long c){\n\t\tif(b==0){\n\t\t\treturn 1;\n\t\t}\n\t\telse if(b==1){\n\t\t\treturn (a%c);\n\t\t}\n\t\telse if(b%2==0){\n\t\...
{ "class_name": null, "func_sign": [ "solve(a)" ], "solution": "P = 1000000007\nPHI = P - 1\n\nn = int(input())\n\na = [int(s) % PHI for s in input().split()]\nret = 1\nfor x in a:\n\tret = ret * (1 + pow(2, x, P)) % P\nprint((ret - 1) % P)\n", "template": "# Complete the solve function below.\ndef solve(...
eJx03cuqLc2WJGY16kEm2a6Gx80jXOhBBEpQQ6qGOkfVqAJBIRDoxWWf+TpCpEjIqrP/vdeaM8Iv42LDho3/6z/8j//h//4f/rv/6b/9y//2j//8X//Lv/z3v395//Uf7/zOd/6OMef1++YYx5P/ec51/L77+O73dx3Xcc/ft+Z88wv/8h9///Kf/o///J/+l//yn/7X//l//6//5e+j5jnPMd41/uX//I+//89XzH/9x3rfkc85xzXm9zu/63rP37OuZ5y/+3nzLb9jruc+/t0PX+9z+sHr///hx5WPvX7ryPN/+bgrj/k73+v1Hd+6...
null
783
Triangle Numbers
Given a triangle of numbers where each number is equal to the sum of the three numbers on top of it, find the first even number in a row. **Explanatory Note**: The vertex of the triangle (at the top) is 1. The structure of the triangle is shown below. Each number is equal to the sum of the numbers at the following p...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int solve(int n)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n // TODO code application logic here\n Scanner scan=new Scanner(System.in);\n int t,n,r;\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n public static void processCase(int N) {\n if (N % 2 == 1) {\n System.out.println(2);\n return;\n }\n int half = N / 2;\n System.out.println(half % 2 == 0 ? 3 : 4);\n }\n \n ...
{ "class_name": null, "func_sign": [ "solve(n)" ], "solution": "def number(n):\n if n==1 or n==2:\n return -1\n elif n%2==1:\n return 2\n elif n%4==0:\n return 3\n else:\n return 4\n\nn=int(input())\nrow_num=[]\nfor i in range(n):\n row_num.append(int(input()))\nfo...
eJztV8uOJDUQ5MAP8AejPq+Q8+F05n4JEoM4wBy4NHuYkZDQSnwE+79EuLprq587SLCH1bZK3W6XnU6nMyPCf3374eW7b+bnhz0aP/65+23/7uV59/ZhJ/1xLz7SFb/xuNfe0RPNLfNxb26ReGNd0lqGPO7dffQW4Y/7rqrJX5tWKqU6e6OZCQ1mqz4aXrGj8L8MFkYpTO/ePOye/nj39Mvz068///7yfPAH5gxezG8/NpYenT1+bKNz9/7Nw2Yv05XI0Ur0Fc0bHthxycsFMCm8MVLWh0jeseLX5o/ZiRglTWAXwhCjp9+0s+51DYBe...
null
2,523
Easy sum
Little Kevin had never heard the word 'Infinitum'. So he asked his mentor to explain the word to him. His mentor knew that 'Infinitum' is a very large number. To show him how big [Infinitum](http://en.wikipedia.org/wiki/Ad_infinitum) can be, his mentor gave him a challenge: to sum the numbers from _1_ up to _N_. The su...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int solve(int n, int m)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\n\n\npublic class Solution {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner scan = new Scanner(System.in);\n...
{ "solution": "import java.util.Scanner;\n\n\npublic class Solution {\n\n /**\n * @param args\n */\n public static void main(String[] args) \n {\n Scanner scan = new Scanner(System.in);\n int T = scan.nextInt(); scan.nextLine();\n \n for(int i=0;i<T;i++)\n {\n ...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Solution {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n...
{ "class_name": null, "func_sign": [ "solve(n, m)" ], "solution": "t = int(input())\n\nfor i in range (t):\n n, m = map (int, input().split())\n \n a = n // m\n b = n % m\n \n print (m * (m - 1) // 2 * a + b * (b + 1) // 2)", "template": "#\n# Complete the 'solve' function below.\n#\n# T...
eJydnU3OLkmSlRmwkFCOW8j/f1gJEokYQA96kvSgkZBaLbEIkFgUMzbEeY7FrbphtxMB1V1ZmTe/730j3M3Njh07Zv5f/+V//1//41/4P//mf+pv/u0//vZ3f/z9f/6H3/7181udv/8xT6u7truevVov58z6+x933b76PPO5ZY4+y9FP3jNuGWXP5+w6b1tr/f7HGmu009p9RtPft9LK73/0ttreZfRn93vr6UOfOUutpTX9un6y31H71h/u0feosz59r1v1K+33P85cq3Y9gX7yll3mPb//MXbXV9XZHj3W0b8e4/c/dj9dj37b0/Ts...
null
5,387
Difference and Product
Tim likes Math. He likes it so much that he always brings his tablets with him and reads math e-books everywhere, even during parties. Tim found an interesting exercise in one of the e-books he is reading. But you want him to join the party, so you decide to answer the question for him. The problem is: Given $D$ and ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int solve(int d, int p)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nim...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.List;\n\npublic class DAP {\n static InputStream is;\n sta...
{ "solution": "import static java.lang.Math.abs;\nimport static java.lang.Math.floor;\nimport static java.lang.Math.sqrt;\n\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\n\n\npublic class Solution\n{\n public static void main(String[] args) throws IOException {\n ...
{ "class_name": null, "func_sign": [ "solve(d, p)" ], "solution": "from math import sqrt\n\nt = int(input())\n\ndef f(d, p):\n if d < 0:\n return 0\n ret = set()\n D1 = d * d + 4 * p\n if D1 >= 0:\n a = round((d - sqrt(D1)) / 2)\n if a * (d - a) == -p:\n ret.add((...
eJyVk81KRDEMhV3Mg5Sup5K/Jo1PIjjiQu/CzXUWd0ARYR5C39eMKCL0DjarLM45JF/T4+bjuLn4quuXaG5e8+O8Pyz5KmXczehmymotlUbE3gRgN+dtytPzfrpfpoe7p8PyrYf8tk1//dzUBdksmbfajKWO2KlqxUqWipKF28FH7Miq3JzD7+7ATkgj/kJARlKrpoLO5CQ+NEAgEwGWwFcBTZvSEL5yYkbKhjGANTRAx6EAZEcm1AgwBwIDGEPgoEGuGkSAVAyCZiMBKqbeQE8IpKpzRIz4Ia0Tw54cdVVPnRM5Ey+de05lHV9HT/Fv...
null
7,741
Pythagorean Triple
A *Pythagorean triple* consists of three positive integers $a$, $b$, and $c$, such that $a^2 + b^2 = c^2$. Such a triple is commonly written as $(a, b, c)$. This term comes from the [Pythagorean theorem](http://en.wikipedia.org/wiki/Pythagorean_theorem), which says that a Pythagorean Triple will be the lengths of the s...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> pythagoreanTriple(int a)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(S...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.BigInteger;\n\n\npublic class PythagoreanTriple\n{\n public static void main(String[] args) \n {\n Scanner sc=new Scanner(System.in); \n BigInteger b=sc.nextBigInteger();\n\n if(!b.mod(new BigInteger(\"2\")).equals(B...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.BigInteger;\n\n\npublic class PythagoreanTriple\n{\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc=new Scanner(System.in);\t\n\t\tBigInteger b=sc.nextBigInteger();\n\n\t\tif(!b.mod(new BigInteger(\"2\")).equals(BigInteger.ZERO))\n...
{ "class_name": null, "func_sign": [ "pythagoreanTriple(a)" ], "solution": "#!/bin/python3\n\nimport sys\n\ndef pythagoreanTriple(a):\n # a = (m^2 - n^2)\n \n if a%2 == 0:\n # a = 2mn\n m, n = a//2, 1\n return [a, m**2-n**2, m**2+n**2]\n else:\n # a = (m-n)(m+n)\n ...
eJyFVMtuFDEQ5BDxHa05R6jf7eZLkEiUA+yBS5LDJkJCkfIR8L/0Jhkr2DLbp5lSbW25qj3PF38eP354mS939fD11/bj9v7huH2GzZtbpGC7ut0uYTv8vD98Ox6+39w9HEcGEEXTiHpXUckgm6HYni7hnT5RmmITX+p3BogFG3LzaKnBMgI2aLM3M8xYSu8EEEfLVmZPHlGH91E30lkk0pbCnQFCnqnEjQzRCIlnSEbfaUKoiWvjOwOYGjIGSTgSIuuE+JRK/Rpd5D+xvDFA1KpFCs+ooER1QqbMJT3q39d9dgaQnnImKY/ZGrlMyKhO...
null
37,894
Number Groups
The positive odd numbers are sorted in ascending order as $1, 3, 5, 7, 9, 11, 13, 15, 17, 19 \ldots$, and grouped as $(1), (3, 5), (7, 9, 11), (13, 15, 17, 19), \ldots $ and so on. Thus, the first group is $(1)$, the second group is $(3, 5)$, the third group is $(7, 9, 11)$, etc. In general, the $k^\text{th}$ group co...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static long sumOfGroup(int k)" ], "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.InputMismatchEx...
{ "solution": "import java.math.BigInteger;\nimport java.util.Locale;\nimport java.util.Scanner;\n\npublic class NumberGroups {\n\n public static void main(String[] args) {\n try(Scanner in = new Scanner(System.in)){\n in.useLocale(Locale.ENGLISH);\n int k = in.nextInt();\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static long sumOfGroup(int k) {\n long x = (long) k;\n return x*x*x;\n }\n\n public static void main(String[] args) {\n Scanner in = n...
{ "class_name": null, "func_sign": [ "sumOfGroup(k)" ], "solution": "#!/bin/python3\n\nimport sys\n\ndef sumOfGroup(k):\n # Return the sum of the elements of the k'th group.\n return k**3\n\nif __name__ == \"__main__\":\n k = int(input().strip())\n answer = sumOfGroup(k)\n print(answer)\n", ...
eJyNkrtKBEEQRQ32Q4aJF6lH18svEVQMdAKTdYNZWBDB2EzQ/7V31kB6rHEKGhq6Tte9t/tt8/WxuZjq+r1ubl76p93+MPZXXS9evOjtrt92/XDcDw/j8Hj/fBh/jgkACou4qgWZsfav2+4X72oEKa5CqFIcSl0ADatmhJ7CjCDuYqphCoWY2tnmhJYPr3LZkVBItRRGbngBcMh5JFFQIuMIEIvS8hHknpsPcws0Iqr5Gc39o6MBp7xEBAKpYKDU8Fv1UvXn0+vVIex2ajpXwxdbgIGdeM6wB4Xkij2qaQ9V92Js0hrOBzadlHZ6Kyn/...
null
3,593
Wet Shark and 42
As punishment for attacking Sunland, Wet Shark is now forced to walk on a line of numbered squares, starting from $1$ and going to infinity. Wet Shark initially has a strength of $S$. To make the experience harder for Wet Shark, each square that has a label divisible by $4$ and/or $2$ but not divisible by $42$ contains...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int solve(long s)" ], "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.InputMismatchExcepti...
{ "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 WS {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int T = sc.nextInt();\n long S;\n long answer;\n long numNotSquares;\n for (int i=0; i<T; i++) {\n ...
{ "class_name": null, "func_sign": [ "solve(s)" ], "solution": "def calc(x):\n MOD = 10**9 + 7\n twenties = x // 20\n rem = x % 20\n if rem == 0:\n return ((42 * twenties - 2) % MOD)\n else:\n return ((42 * twenties + 2 * rem) % MOD)\n\ntcs = int(input())\nfor i in range(tcs):\n...
eJzVm8uupNlRhRnwIK0eW2jfL34GZkyQaMQAesCk8aAtWUJIPAS8L9+39ilhV/WpGQNKbbudlZn/3nFZsWJF5H/+9X//3e//Kn/+/m/5l3/49x//9Zc//PHXH3//w4+7/fTLHmOVM07d+5x5ah0//TJnWaONXWbve5XbeV+9d5++9uq19DNb27yv8oHb5py3ndN5U2u13V7uKH6ydV5bc512Zx9nD961/bI9z5i7lD4Hr5xZfvplrFb3ODyllbvaKJxj3HsKXzP24v+vs3765RyOW+tqp5ey66m8Vjsf7ZP/brx7zVt5rY45yh63ceC+...
null
4,429
Sherlock and Square
Watson gives a square of side length 1 to Sherlock. Now, after each second, each square of some arbitrary side $L$ will break into four squares each of side $L/2$(as shown in the image below). ![img][123] Now, Watson asks Sherlock: What will be the sum of length of solid lines after $N$ seconds? As the number can...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int solve(int n)" ], "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.InputMismatchExceptio...
{ "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 SAS {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";...
{ "solution": "\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n\nimport static java.util.Arrays.*;\n\npublic class Main {\n\tprivate static final int mod = (int)1e9+7;\n\n\tfinal Random random = new Random(0);\n\tfinal IOFast io = new IOFast();\n\n\t/// MAIN CODE\n\tpublic void run() throws IOException...
{ "class_name": null, "func_sign": [ "solve(n)" ], "solution": "t = int(input())\n\nP = 10**9 + 7\n\ndef f(x):\n return (pow(2, x, P) + 1) * 2 % P\n\nfor _ in range(t):\n print(f(int(input())))", "template": "#\n# Complete the 'solve' function below.\n#\n# The function is expected to return an INTEG...
eJx8vUuuZcuSXacCG5J4ZRaW/93VALVBgC6gApkFVZ5YSAICBAHqqxrBKm2MuSMhZOIRIPPGizhn77X8Y59p06b9v//hf/3//tv/8j/9b//33/6Pv/+X//ovf/uf/+lv7a+/zz13G/M7f/39b//xn/72z//Xf/nn//Qv//yf//f/87/+y++Hxp6v3fX23/6f//hP/79fHn/9va/R2u6rfvn08765vr/+vvscu5/V/uEnnm/2/e12//r7+t6oH+27PmG+Ofs54998T6vPHLOtu9+sP9anz3HXnfUba/X13fqY3V795Zn1MXvt/Y36iXq3...
null
2,325
Manasa and Sub-sequences
Manasa recently lost a bet to Amit. To settle the problem, they are playing a game: They have _N_ balls in front of them. Each ball, except the 1st ball, is numbered from 0 to 9. The 1st ball is numbered from 1 to 9. Amit calculates all the [subsequences](https://en.wikipedia.org/wiki/Subsequence) of the number th...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int solve(String s)" ], "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.InputMismatchExcep...
{ "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 = ...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\n\npublic class Solution {\n\n public static void main(String[] args) throws IOException{\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n ...
{ "class_name": null, "func_sign": [ "solve(s)" ], "solution": "P = 10**9 + 7\n\ns = [ord(c) - ord('0') for c in input()]\n\nret = 0\nfor i, x in enumerate(s):\n\tret = (11 * ret + x * pow(2, i, P)) % P\n\nprint(ret)\n", "template": "#\n# Complete the 'solve' function below.\n#\n# The function is expected...
eJztnUuuJsfVXd1w22Mo3DZhREZmRmZqJAYsQw2yGuyQbBQBAQIBD8Jz8DS9184r26BQgNVzY63z2zqsuvV9+Yg4cV4R97//x//yP7f/9B/+6z8+fv7lt9+/ffzly8d2/PWXjx++fHz9+29ff/z29ae//fr7t3/+1fPxxw9f/q+fPeZ2f/enz2dbf/r5a3z3p6/rTz879/1+xr3fa7+eY8x1HnM/t21t55n/vu5o9/Gc37/a/b7ntuafr3kb+7Ht2zquc55n9Gfe+7zWce/n2Me58rfPuV/rmvnGO9+xnnXu8762sc25clvrue7jHvn+...
null
6,345
Count Solutions
Eric has four integers $a$, $b$, $c$, and $d$. Instantly, he wondered how many pairs of _integers_, $(x, y)$, satisfy the following equation: $$x^2 + y^2 = (x \times a) + (y \times b)$$ where $1 \le x \le c$ and $1 \le y \le d$. Find and print the number of pairs that satisfy the above equation.
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int countSolutions(int a, int b, int c, int d)" ], "script_name": "Solution", "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport...
{ "solution": "\nimport 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 D {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n void solv...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class CountSolutions {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tint q = Integer.parseInt(br.readL...
{ "class_name": null, "func_sign": [ "countSolutions(a, b, c, d)" ], "solution": "def solve(a,b,c,d):\n res = 0\n for x in range(1,c+1):\n l = x*(x-a)\n # y*y - b*y + l == 0\n det2 = b*b - 4*l\n if det2 == 0 and b%2 == 0 and 1 <= b//2 <= d:\n res += 1; continue\n...
eJydlk2OJEUMhVmw5BChWo9Q2A6HbU4yEo1mAbNg07CYkZDQSBwC7svnrKmmqO5qfqpT2VUZGQ77+b0X8duXf7z76ovj8/YtX7799fTj488fP5y+Gad4eLSZlSMz94itEmPJrnx41Ap+lOoc4Vv2yCmuD4+uaw/G1tiajM2p6+ExSqeN0IhhGsuGajlRYu3I4dvER9ZKHbnCWZYAzo8UX8PM0sdy60hJbB97TuJlMDJyh8nD4+nNOL3/5ef33394/8O7nz5++FyCMHS+JsUc93X69GZcVUkeFbUpUGIvaurKotK7miSBXb46+62sWdaJ...
null
9,549
Simple One
You are given the equation $\tan\alpha = \frac{p}{q}$ and a positive integer, $n$. Calculate $\tan n\alpha$. There are $T$ test cases.
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int solve(int p, int q, int n)" ], "script_name": "Solution", "solution": "import java.io.IOException;\nimport java.io.InputStream;\n\npublic class Solution {\n\n static final int MOD = 1_000_000_007;\n\n public static void main(String[] args) ...
{ "solution": "\nimport 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 B {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n void solv...
{ "solution": "\nimport 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 B {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "solve(p, q, n)" ], "solution": "read = lambda: map(int, input().split())\n\nP = 10**9 + 7\n\ndef mul(a, b):\n return ((a[0] * b[0] - a[1] * b[1]) % P, (a[0] * b[1] + a[1] * b[0]) % P)\n\ndef my_pow(a, b):\n ret = (1, 0)\n while b > 0:\n if (b & 1) == 1:\...
eJzk3c2uNM2SJWQGXMhWjRn4n5m7cyVIlMQAesCkYNBISKglLpshyzxWrm4OfVpLTKlTP1+977bMyIjl5u5PxM7v//yv/7v/6z/81//Vf/9//Mv//G//6//27//lv/37l5n/+m/nnNbw339559otz/079447c89//bfo44zYOf/6yZazrfyLPLPflfdf/22dNu/6m/fk3HvMv9XmjLmj/+u/Ze97tL7X31i398jb//D6M08PVPZ2+7pt/S286Jx3tL/e1rkZreGvM9YZPf762GviYMbfGfOgYKJ4jN1j4s/r/cYI/CGKM/GjZ6N49Y3D...
null
1,196
Calculate It
Little Tom loves to solve interesting math challenges. One day he bumped onto an interesting function called _hRank_. Given a positive integer **k**, _hRank_ maps a non-negative integer **x** to another integer. hRank(x) = 1 if 0 <= x < k hRank(x) = hRank(x – k) + hRank(x / k) if x >= k and k | x (i.e., x ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static String solve(int k, String x)" ], "script_name": "Solution", "solution": "import java.math.BigInteger;\nimport java.util.*;\n\n\n\npublic class Solution {\npublic static final int N = 52;\npublic static BigInteger [][][][] g = new BigInteger [N][10][...
{ "solution": "import java.math.BigInteger;\nimport java.util.*;\n\n\n\npublic class Solution {\npublic static final int N = 52;\npublic static BigInteger [][][][] g = new BigInteger [N][10][N + 1][N + 1];\npublic static ArrayList<HashMap<BigInteger,BigInteger>> have = new ArrayList<HashMap<BigInteger,BigInteger>>();...
{ "solution": "import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main\n{\n\tprivate static final int maxn = 51;\n\tprivate static int deg, cur, nxt;\n\tprivate static BigInteger[] fact = new BigInteger[maxn], f[] = new BigInteger[2][maxn], pre = new BigInteger[maxn], suf = new BigInteger[maxn];\...
{ "class_name": null, "func_sign": [ "solve(k, x)" ], "solution": "#!/bin/python3\n\nimport os\nimport sys\n\ndef zrank(k, x):\n\n if x < 0:\n return 0\n\n if x < k:\n return 1\n\n m = 1\n while m <= x//k:\n m *= k\n\n # coefficient array\n x = int(x)\n arr = [0]*(x...
eJytm8uqrt1RhW14IYu/HWSeah4E70NQsaFp2IlpJCBIwIvQjj3v1OcZXxqyNysQcCd7/2t9h/edc1bVqFGj6v2Pv/yv//mbv8ifv/1vfvi7f//lX37z29//7pe//vplf82xzrl773nX22v10er0Pft7VbvvunVu3b//zS+/+vrl1//221//0+9+/c//+K+//90fr9Db3u+NPs69b7X++li15jvttuKrd6/Zextrz6rR39yrc8d17mtz9rXPa3eOer2d/c6ciwX1dndbNcbYfG+1VvveU/Xq7lF87Y7e31rcep1WvDf6PvONwcXG8np7...
null
4,060
Black Hole
Given integers $n$, $a$, $b$ and $M$, calculate the value $\sum \limits_{k=0}^{n} k^a b^k $ modulo $M$. **Input Format** The first line contains the number of test cases $T$. Each of the next $T$ lines contains four space-separated integers $n$, $a$, $b$ and $M$. **Output Format** For each test case output on...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static long solve(long n, int a, long b, 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.ut...
{ "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 BH2 {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";...
{ "solution": "import java.io.*;\n\npublic class HR_demidenko_black_hole {\n\n static long mod;\n static long[][] cs;\n\n static void init(int n) {\n cs = new long[n + 1][n + 1];\n for (int i = 0; i <= n; ++i) {\n for (int j = 1; j < i; ++j) {\n cs[i][j] = (cs[i - 1][j...
{ "class_name": null, "func_sign": [ "solve(n, a, b, m)" ], "solution": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\nprimesq = 32000\n\nisprime = [True]*primesq\nprimelist = []\nisprime[0] = False\nisprime[1] = False\nfor i in range(2, primesq):\n if isprime[i]:\n ...
eJyNlkFuJkUMhVmw5BClrCeobJftMidBIogFMwuEFGaRkZAQEoeA+/K5M2SSP38P0+okne6qsv383qv66+t/fv3mq+P6/i0PP/xx88v9+w8PN9+Nm3V3n1t8y6olmaGy55BhNtWWbxVdwqPZCI+YZjvu7rcvKxOVtbZYMmMOXtgqmdx89LVjeMV0C0Lo3pNHzZwVm0tHjtuyuSYzlliHqZGEtdApd/ehexWZzWlVslJt6HD3zGWuOxfRS0aKr0jyvru/eTNu3v3+/t3PD+/e/vTbh4ePBVpluGxjhE/qM/O7e9lLZ+jad/fmvqaR0c2f...
null
2,214
Rectangular Game
You are given an infinite 2-d grid with the bottom left cell referenced as (1,1). All the cells contain a value of zero initially. Let's play a game? The game consists of **N** steps wherein each step you are given two integers **a** and **b**. The value of each of the cells in the co-ordinate (u, v) satisfying 1 ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int solve(List<List<Integer>> steps)" ], "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.I...
{ "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 = ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long t=sc.nextInt();\n long mx = 1_000_001,my=1_000_001;\n while(t-->0){\n long x=sc.nextInt(),y=sc.nextInt()...
{ "class_name": null, "func_sign": [ "solve(steps)" ], "solution": "n = int(input())\nmx = 0\nmy = 0\nfor i in range(n):\n inp = [int(a) for a in input().split()]\n if mx == 0:\n mx = inp[0]\n my = inp[1]\n else:\n mx = min(mx,inp[0])\n my = min(my,inp[1])\nprint(mx*my)\n ", "template": ...
eJztmruuJUlWhjHw8bBDbY9Qxj0Ch9dAohEGtIFTjNEjjYSQeAh4X77vzwI1B6o0gzViThl9OvfOnRmxLv9lZf7rn/77n//Vn+TfX/8Z//M3//zDP3759W9+/uEvyw+7/fjlrN2esvZu9XC0T6u7zOc5z/7xy73tnKfUU/fTf/wyJ188Zeznxy/93HZn6bffp/LV3f300kZvm+usc08r46ntzB+/jPb0sUp9+JovxxzzlNrGmFz0PBzX0rh/97q37z05d9TtT3vthwXV1VjsGqxul3ZbG9zzPGuNMjur4nA/zzrl1LUrl72Dc1vhznzu...
null
21,866
Points on a Rectangle
You are given $q$ queries where each query consists of a set of $n$ points on a two-dimensional plane (i.e., $(x, y)$). For each set of points, print `YES` on a new line if all the points fall on the edges (i.e., sides and/or corners) of a [non-degenerate rectangle](https://en.wikipedia.org/wiki/Degeneracy_(mathematics...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String solve(List<List<Integer>> coordinates)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n public static void m...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'solve' function below.\n *\n * The function is expected to return a STRING.\n * The function accepts 2D_INTEGER_ARRAY coordinates as parameter.\n */\n\n public static String solve(List<List<Integer>> coordinates) {\n...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int q = in.nextInt();\n for (int i = 0; i < q; ++i) {\n solve(in);\n }\n }\n \n private static void ...
{ "class_name": null, "func_sign": [ "solve(coordinates)" ], "solution": "def main():\n for i in range(int(input())):\n p = [list(map(int, input().split())) for j in range(int(input()))]\n px, py = zip(*p)\n x0 = min(px)\n x1 = max(px)\n y0 = min(py)\n y1 = max(p...
eJyVWDuOJccRlMEb6AKFsdlCZVXlp+TTlQw6FDQEDWkNOiMaS0CAIICHkK4jT/diRNTbxez8djmYedvdrzorP5GRUfvLV//9/+9/p5/v/oeLv/7r7seHn35+f/fHdpf3D3b/cA3zNnqO+4eFO7PlrXwFbsde7VrZ8dUYA9e+x8Zzq2iXreX3D7i91qhqZQP2rlm5mwWXXdn7brk6NpneV9uW/f4h3Aas+oLVy23B1BzRuX55x00m9jbbo7lzzR6zN+8TuwVvbfQWOeHsDINTu4o77yzajTnhFXe+lk26EQarAT/oRk1c+4RLxi1XX9UG...
null
2,501
Jim Beam
Jim likes to play with laser beams. Jim stays at point $(0,0)$. There is a mirror at point $(X_m, Y_m)$ and a wall between points $(X_1, Y_1)$ and $(X_2, Y_2)$. Jim wants to find out if he can point the laser beam on the mirror. **Input Format** First line contains the number of test cases, $T$. Each subseque...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static String solve(int x1, int y1, int x2, int y2, int xm, int ym)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arr...
{ "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 = ...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution {\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\t\n\tstatic void solve() throws Exception {\n\t\tint t = nextInt();\n\t\tfor (int tt = 0; tt < t; ++tt) {\n\t\t\tout.prin...
{ "class_name": null, "func_sign": [ "solve(x1, y1, x2, y2, xm, ym)" ], "solution": "def det(a,b,c,d,e,f):\n return (a-e)*(d-f)-(b-f)*(c-e)\n\nT = int(input())\nfor tt in range(T):\n a,b,c,d,e,f = [int(x) for x in input().split()]\n if det(a,b,c,d,e,f) == 0 and det(a,b,c,d,0,0)==0:\n print(\...
eJydUzuO1UAQJIB7tBzvoOl/z+akEJCAABHAC0iWDd5KSCskDgHXI+Me1JjdAHhPaPDYY8/IXV2uKn95+O3Howf78eI7Hl7dbh+urm+O2yVt/PqqDXEXat49VKmVZ6mQ8DCvuRQbTNJHGd7eLmg7fLo+vDse3r/9eHO8w3n6bPt8Qb8DS4kJEAZHTwaSATBxH8MFDSLFZr9SLzuL/PLJ87+hw8JYaEiUJKVqj6BmGQzgMbpUJ/AvPY97inGkogqMa0SRKSczqQd3bFqAplKEeSzSbZLg0oHoOKkpFCjSkTjJIw36s5WwruHODwxQqxSZ...
null
24,167
Hyperspace Travel
A group of $n$ friends living in an $m$-dimensional hyperspace want to meet up at some central location. The hyperspace is in the form of an $m$-dimensional grid, and each person can only move along grid lines. For example, to go from $(0, 0) \rightarrow (1, 1)$ in a $2$-dimensional space, one possible route is $(0, 0)...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static List<Integer> solve(List<List<Integer>> friends)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static v...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Solution {\nstatic class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n \n public Re...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Solution {\nstatic class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n \n public Re...
{ "class_name": null, "func_sign": [ "solve(friends)" ], "solution": "import operator\n\ndef main():\n lines, dim = map(int, input().split())\n points = [list(map(int, input().split())) for i in range(lines)]\n coords = map(sorted, zip(*points))\n getter = operator.itemgetter((lines - 1) // 2)\n...
eJztXc3O5Dhy9MEPIvR5ZYj/pJ/EgNvwwZ6DL+0FPAssYCzsh7Df1xmRoSqJkmp6PQdjvD2D1ldflYpKZUYGkxQZ33/+9X//x7/9Ff/7uz/ai7//9y//8u33f/j5y98uX0Jawvb1W9j037Li5RJfL/3dzN8LjodTG479fOrXb4ev2auwrBHHw9cyfi/86P1u4+/9dOpsV4RdcbIr0q442RVhV/xgV6JdabIrwa402ZVoV3q2K8OuPNmVaVee7MqwK3+wq9CuMtlVYFeZ7Cq0qzzbVWFXneyqtKtOdlXYVT/Y1WhXm+xqsKtNdjXa1Z7t...
null
3,419
Solve Equations
You are given a straight line, $a \cdot x + b \cdot y = c$. Find the point closest to the origin that also satisfies the following properties: 1. $x$ and $y$ are *integers*. 2. $x$ is *greater than* zero. If more than one solution exists satisfying $1$ and $2$, then choose the point in which $x$ is minimal. ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static List<Integer> solve(int a, int b, int c)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n \n private static clas...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n \n private static class ExtGcd{\n public long k, l, g;\n public ExtGcd(long a, long b){\n long[] v1 = {1,0,a}, v2 = {0,1,b}, merged = {...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\npublic class Solution {\nstatic class Reader\n {\n final private int BUFFER_SIZE = 1 << 16;\n private DataInputStream din;\n private byte[] buffer;\n private int bufferPointer, bytesRead;\n \n public Re...
{ "class_name": null, "func_sign": [ "solve(a, b, c)" ], "solution": "from math import floor\ndef GCD(a, b):\n\tif a < b:\n\t\tc = a\n\t\ta = b\n\t\tb = c\n\twhile(1):\n\t\tif a % b == 0:\n\t\t\treturn b\n\t\tc = a % b\n\t\ta = b\n\t\tb = c\n\ndef GCDEx(a, b):\n\tif b == 0:\n\t\tsx = 1\n\t\tsy = 0\n\n\t\tre...
eJx0vUuubF2ypYUEDXFFOV2a77UmLUHilyhAFrISZCGRkFIp0QE6SisY32d+gqsI7q3Evvs/232t+bDHsGHD/q//4X/6f/7v//6/+5//69/+09//8//xX/72P37+ts5ff5+3P8/Z7+dd8x1nvZ/Z+jwn/2nM9dw92+f3Q//0v/6+1x3n5t/vZ8w+Pu/46+93PqffZ332fc/TnvnZp+XvT5v3tvfzLz/89fe1dx/v0z+/Hwafffqz5mn5nn57f8b43PxvGyMfdt783X33p+fbT8uX5Q/yj8c9Y3/uPM/T8sMz2r5j5z+tmU/IP/v9sPn3...
null
4,396
Polar Angles
A point **(x,y)**, on the cartesian plane, makes an angle **theta** with the positive direction of the x-axis. **Theta** varies in the interval [0 ,**2PI**) radians, i.e, greater than or equal to zero; but less than 2\*PI radians. For example, the polar angle of the point (1,2) as marked in this plane below, is (ap...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static List<List<Integer>> solve(List<List<Integer>> coordinates)" ], "script_name": "Solution", "solution": "import java.io.DataInputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.Arrays...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n Point[] pts = new Point[N];\n for (int i = 0; i < pts.length; i++) {\n pts[i] = new P...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n Point[] pts = new Point[N];\n for (int i = 0; i < pts.length; i++) {\n pts[i] = new P...
{ "class_name": null, "func_sign": [ "solve(coordinates)" ], "solution": "count = int(input())\npoints = []\n\nfor _ in range(count):\n x, y = [int(x) for x in input().split(\" \")]\n points.append((x,y))\n \nimport math\ndef key(x):\n atan = math.atan2(x[1], x[0])\n return (atan, x[1]**2+x[0...
eJzNvU3OLFuzpAUSA0nddiWKvxU/jASJjWhASdC5VKNKQkIlMQgGxpAIN3vMV55z71cgVA06591n73wzIyPWcjc3M/f1f/xX/+3/9T//l//Ff/e//9P/8s//7j/8+3/6bz7/9NzXn39el8/3WP788/feP8f9/lyf9y+2+ovtc7wvGOfn+yz+/+/9vmI/P+Oo/z8/61L/sF+f7zj//PMxPs+ff76OzzneVz2fq95lH5/v+v7hGp/1fbdr+Zzvi7bz86zvbyyfe623Gp/9/ZXxOVa9wfcY+o3zfdftft991c/D71ufpfc93nf6Puvnux36...
null
27,019
Hard Homework
Aaron is struggling with trigonometric functions, so his teacher gave him extra homework. Given an integer, $n$, he must answer the following question: > What is the maximum value of $sin(x) + sin(y) + sin(z)$, where $x$, $y$, and $z$ are positive integers and $x + y + z = n$? Help Aaron by finding this maximal value...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static double solve(int n)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n ...
{ "solution": "\nimport 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 F {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n // sin a+...
{ "solution": "\nimport 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 F {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\t// sin a+sin b=sin(...
{ "class_name": null, "func_sign": [ "solve(n)" ], "solution": "from math import sin,pi\nfrom itertools import product\nfrom random import shuffle\n\nn = int(input())\n\na = list(range(1,n-1))\na.sort(key=lambda v: v % (pi*2))\nlena = len(a)\n\noffsets = list(product(range(-500,501),range(-500,501)))\nshuff...
eJyFlE1KA0EQhV3kIGHWIdT/jycRVFxoBBfGLBIISMBD6H3tDC6kImWtGoav36tX1fOx+HpdXM118zwOt+/Ty3Z32E/XywldXJjvttNqOW2Ou83jfvP08HbY/3yndSgpYzBPp9XyFylkqg2XmeGUSYVDGhdGtqQbBRpWUkWp9SqZHJJWvQYSubdNsjOxQ5VEZknqzFJAqIoUclwmgG2wouIsllUzKK11C5rgwRea5oEODYhpyuCiF8naWANrSA5np9FUIbsGlUSQUqtN6ZgcIslphek2zQzANDhqHA3j5DGk4mLgXXzmxACE1VzO1W40...
null
40
Meeting Point
There is an infinite integer grid where  **N** people live in **N** different houses. They decide to create a meeting point at one person's house.  From any given cell, all 8 adjacent cells can be reached in 1 unit of time, e.g. (x,y) can be reached from (x-1,y+1) in one unit of time. Find a common meeting place whi...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int solve(List<List<Integer>> coordinates)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.Comparator;\n\npublic cl...
{ "solution": "/* Enter your code here. Read input from STDIN. Print output to STDOUT */\n\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.StringTokenizer;\nimport java.io.*;\n\n\nclass Tuple{\n long x;\n long y;\n long sum_x;\n long sum_y;\n public Tuple(long x, long y){\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int[] xs = new int[N];\n int[] ys = new int[N];\n for (int i = 0; i < N; i++) {\n ...
{ "class_name": null, "func_sign": [ "solve(coordinates)" ], "solution": "# Enter your code here. Read input from STDIN. Print output to STDOUT\n\nx = []\ny = []\n\nn = int(input())\n\nrt = 0\n\nfor i in range(n):\n xi,yi = [int(i) for i in input().strip().split()]\n x.append(xi);y.append(yi)\n\ndef d...
eJzs/cvKZc+Sp+upoQuZZE+wA4YdfBx0JQItUEOqhjqp3agNG4RAN6R7lP3MXotVyqoFUldkJqx/xBffHHMczN3N/XH38f/83/4f/nf/r+t/83/8v//b//Xf/+f/5b/+2//+9292/ePf/+R7p5/fnxP2flk/eK4n7vd3MvNz/f0914lf2mdp//j3c8I//72PXXH/498t47H79+e1536ef/y7xxvHf3/Mjt3173++iMjnV/99jtXn/7xXnKt+cNLyjfrBMb+e8zvfe9UH/PbjWb+fGad+/9/+p9+//Zf/9X/+L//n//pf/i//p//b//Jf...
2
2,534
Sherlock and Probability
Watson gave a string $S$ to Sherlock. It is $N$ characters long and consists of only `1`s and `0`s. Now he asks: Given an integer $K$, I'll pick two indices $i$ and $j$ at random between $1$ and $N$, both inclusive. What's the probability that both $S[i]$ and $S[j]$ are `1` and $|i - j| \le K$? **Input Format** F...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static String solve(int n, int k, String s)" ], "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.I...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution {\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\t\n\tstatic void solve() throws Exception {\n\t\tint t = nextInt();\n\t\tfor (int tt = 0; tt < t; ++tt) {\n\t\t\tint n = ...
{ "class_name": null, "func_sign": [ "solve(n, k, s)" ], "solution": "from itertools import accumulate\nfrom math import gcd\n\ndef f(s, k):\n n = len(s)\n a = [0] + list(accumulate(ord(c) - ord('0') for c in s))\n ret, tot = 0, n * n\n for i, c in enumerate(s):\n if c == '1':\n ...
eJx0vU2upcmSXaeGBpJ4ULOA5x75GxyJACXABlkNdlLVqAIIEAQ0Wg1BbWW+F7bWMj/ByIh7z/k+d3Ozvdf2DllV/8///n/+v//f//G//V//42//7Y9/+49//9t/+uFvX37/47cv54dffzm//3HPX3/++fOv3/fPj/cfP/757Z777ek/V91/PLr/3HG/ffi24dvXO/u/FfxnyfOt1Pz99m/KzsGeNB2dKX5cMKu+bfu29Nvx/1x1p3CGY9G9JyvS37dxzry/ntKlaYF9I9y3M0aTkWydc5cq3x44q16ox6j0rbiKbm/WGeMJo9HlvR6J...
null
1,236
B'day Gift
Isaac has to buy a new _HackerPhone_ for his girlfriend Amy. He is exploring the shops in the town to compare the prices whereupon he finds a shop located on the first floor of a building, that has a unique pricing policy. There are N steps leading to the shop. A numbered ball is placed on each of the steps. The shop...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static double solve(List<Integer> balls)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\npublic class Solution {\n\tstatic BufferedReader in = new BufferedReader(new...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int inputs=sc.nextInt();\n int[] array=new int[inputs];\n double sum=0;\n for(int i=0;i<inputs;i++)\n ...
{ "class_name": null, "func_sign": [ "solve(balls)" ], "solution": "#!/usr/bin/env python\n\nimport sys\n\n\nif __name__ == '__main__':\n N = int(sys.stdin.readline())\n balls = [int(sys.stdin.readline()) for _ in range(N)]\n \n print('%.1f' % (sum(balls) / 2))", "template": "#\n# Complete the...
eJztmM+KXkUQxV34CD5AmHUI3dXVVdU+ieCIC83CzZhFAoIIPoS+r7/Tk0kHv9woCC5CJvmg53731p9Tp07Vnd+//PPNV1/sn28eOHz7691PD6/evL77+tldX/cPo881I+b9Q8015jLr9w+9co5ZMe4fbCwfnWsrF7dWcsxuNVbrjatj+hrRg+ctR2/h9w/TM0cUJ6sa5tX4erTZRjdMdvOVNQpL5nP1sSzvH6KiVWtBTNPGCCwV9iOjz1i46muVVXQsrCJOTtxg3NjDsXX3/Nndy19evfzh9csfv//5zeu3SY4Voyoj24t599vzZ+/l...
null
53
Palindromes
Given a string, you keep swapping any two characters in the string randomly till the string becomes a palindrome. What is the [expected number](http://en.wikipedia.org/wiki/Expected_value) of swaps you will make? There will always be at least one palindrome which can be formed with the letters of the given string. **I...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static double solve(String s)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\n\npublic class Solution {\n\tsta...
{ "solution": "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.str...
{ "solution": "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Solution {\n static final Map<String,Double> m = new HashMap<String,Double>();\nstatic {\nrun:\nm.put(\"abbaaca\",59.3380);\nm.put(\"aabaabcc\",47.3846);\nm.put(\"abaccbaa\",47.3846);\nm.put(\"abcddcb\",138.0...
{ "class_name": null, "func_sign": [ "solve(s)" ], "solution": "from itertools import permutations\nd = {}\nnext = {}\nr = {}\nrets = []\ntpers = {}\nfor _ in range(int(input())):\n s = input()\n if s == s[::-1]:\n print(\"%.4f\" % 0)\n continue\n for o,n in zip(sorted(list(set(s)),ke...
eJydVdGO2jAQ7EPV70B5PlkxwVD6JSeVqrJ3N5Qj5K4nrnCpTupHtJ/Ut35UZw2kSIlTjiiKh4029s7ODj/e/vrz7k28bn8DfPyereqHp232YZS5RR0CsyfyQBQ8sWdF5DkoQogZDyDygXEv6uxmlMn+QWgr/Pn+aXv8li0mZmrdZFHbojCFm+eK2tjYmgKXxqyZTYopPvRyMzo7jF3UQtJQk95iZlye572ZlSTTcpOnsppvuK/Zb737utytlwNsvDe5c71V0mZDrz0sOsVgh1hXLKRkEbNE0jj+ZoD0h9tixqctBiI9Ba+v4JeqffXq...
null
21,063
Lazy Sorting
Logan is cleaning his apartment. In particular, he must sort his old favorite sequence, $P$, of $N$ positive integers in nondecreasing order. He's tired from a long day, so he invented an easy way (in his opinion) to do this job. His algorithm can be described by the following pseudocode: while isNotSorted(P) do {...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static double solve(List<Integer> P)" ], "script_name": "Solution", "solution": "import java.io.BufferedInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Arrays;\n\npublic class Solution {\n\n public static void mai...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static InputReader in;\n private static PrintWriter out;\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.n...
{ "class_name": null, "func_sign": [ "solve(P)" ], "solution": "from math import factorial\nN=int(input())\na=list(map(int,input().split()))\nif a==sorted(a):\n print(0)\nelse:\n m={}\n for i in a:\n if i in m:\n m[i]+=1\n else:\n m[i]=1\n num=1\n for i in ...
eJydVE1rFUEQ9CD+jmLPIUx/z/hLBJ940Hfw8szhBQIi5EfEizf/qd1jBAmZ9ZEdFoZhtqq7qnrvX//49ebVfN79zM37b9uX083teXuLjexwGgqGDGgHG8QQAnMw1Ql57UURjE6H03aF7Xh3c/x0Pn7++PX2/Igj7IO6DW6tXbf5bN+v8A9THE4xEARWqGMYkpd4iWhNF0jUs2aDCcLgBmbQAAeGgFr1oEnBUNiYW7ijjyUTeWs2RNlV1vWXUgRCt1JmjCJngQRI0JMru1H0jkg5dUnmJl2Cuq6J8mNp8ETKltIEQRrQyglP6D6li+mH...
null
13,581
2D Array - DS
Given a $6 \times 6$ *2D Array*, $arr$: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in $A$ is a subset of values with indices falling in this pattern in $arr$'s graphical representation: a b c d e f g There are $16$ hourglasses in $arr$. A...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int hourglassSum(List<List<Integer>> arr)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\t// write your code here\n\n\n int numbers[][] = new int[6...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n Scanner sc = new Scanner(System.in);\n int[][] array...
{ "class_name": null, "func_sign": [ "hourglassSum(arr)" ], "solution": "board = []\nfor i in range(6):\n board.append([int(x) for x in input().split()])\ni,j = 0,0\nm = sum([board[i][j],board[i][j+1],board[i][j+2],board[i+1][j+1],board[i+2][j],board[i+2][j+1],board[i+2][j+2]])\nfor i in range(4):\n f...
eJy1VsuOEzEQ5MCJr2jlvEZ+jD1jvgSJIA6QA5ewh6y0EkLiI+DOjd+kq9rJJg7ORuyyM5p12x53dXV1T76//Pn71Qv+vf2lg3dfV5+3t3e71RtZeXFV3MTnLG5Zb12gUcRF0cekM1V0KUuSaDt0+yJZJ7Pk9XbG+7MsmHRFl2e8PfM8vLferm5ktbm/3XzcbT59+HK3a75jWH27kSMwQap4HhzWW/UVgAFIdBD2B7skgEIgFQiLTJxXpIkvAO5EKDPsWfheGuIIscPhAESjie0YHfIkBJjoaIGJC/YMR0G4Sd8kDCBIGgw2zzoiZeBw...
null
13,724
Sparse Arrays
There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. **Example** $stringList = ['ab','ab',abc']$ $queries = ['ab','abc','bc']$ There are $2$ instances of '$ab$', $1$ ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static List<Integer> matchingStrings(List<String> stringList, List<String> queries)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solut...
{ "solution": "import java.util.Scanner;\nimport java.util.HashMap;\n\npublic class Solution {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n scan.nextLine(); // gets rid of pesky newline\n \n /* Create and fill Ha...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) throws IOException {\n BufferedReader c = new BufferedReader(new InputStreamReader(System.in));\n Integer numstr = Integer.parseInt(c.readLine());\n HashMap<String,Intege...
{ "class_name": null, "func_sign": [ "matchingStrings(stringList, queries)" ], "solution": "N = int(input())\nnumbers = list()\ncounts = list()\nfor i in range(0,N):\n numbers.append(input())\nQ = int(input())\nfor i in range(0,Q):\n checkstring = input()\n count = 0\n for num in numbers:\n ...
eJyUvemO7DzSJmYYvpAP/Xt+iBSpxVdiwC9gUBIpiZRELRS3wQAGfFdzdRORZ6vKUp1uA2836mQqJS6xPBHxBPX//h//1//3P//3/+3//u//mrf9dv/6P//rX/yfral419X/bFXtJKfd2F8HV3c7/LMNF/wfvXey/LPpqq2rnk+57Mp/NgJf2kb43fOLplyYf7Z//bf/+peMu+ydHP4fe7ufDyj+9T/+2399eCAp/tn27sp5jpPb0vTPltx1t3UurTVj3DqV/tlqZpZFFF6N9xJhDOXVacaKvvtn2/Zp4CX1tppSrv7ZlBzGCOMrt4aV...
null
1,147
Print in Reverse
<sub>This challenge is part of a tutorial track by [MyCodeSchool](http://www.youtube.com/mycodeschool) and is accompanied by a video lesson.</sub> Given a pointer to the head of a singly-linked list, print each $data$ value from the reversed list. If the given list is empty, do not print anything. **Example** $he...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static void reversePrint(SinglyLinkedListNode llist)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.func...
{ "solution": "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.str...
null
{ "class_name": null, "func_sign": [ "reversePrint(llist)" ], "solution": "import math\nimport os\nimport random\nimport re\nimport sys\n\nclass SinglyLinkedListNode:\n def __init__(self, node_data):\n self.data = node_data\n self.next = None\n\nclass SinglyLinkedList:\n def __init__(sel...
eJztvcuuLc22nQUSD2KdsoUyIjIyMnkSJCYCCVygsnHBliwhSzwEj0uBFd/Xeqztfc5vJCqmsKS1/70uc4yRIy69t9b67f/8b/77//t//q//q//h//in/+1v//bf/7t/+u/+1T99P3+77/Hzt/e7f/3uW79+N3/9Zv36z7Pen7/N/us/+zfvuvd/nl9/P3/98W6/XtT3j73z1999V//1u1//z9vsv7nbr7/Z//L9+usx9huPX38z90vm/PWf8fx6hzXH/thf/zD6/s/89Tz93m802q9X9P3D+4G+mye7fr3l/euPvf965/X8+t3az7H6...
null
1,156
Get Node Value
<sub>This challenge is part of a tutorial track by [MyCodeSchool](http://www.youtube.com/mycodeschool)</sub> Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. **E...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int getNode(SinglyLinkedListNode llist, int positionFromTail)" ], "script_name": "Result", "solution": "/*\n Insert Node at the end of a linked list \n head pointer input could be NULL as well for empty list\n Node is defined as \n class Node {\n...
{ "solution": "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.str...
{ "solution": " // Complete the getNode function below.\n\n /*\n * For your reference:\n *\n * SinglyLinkedListNode {\n * int data;\n * SinglyLinkedListNode next;\n * }\n *\n */\n static int getNode(SinglyLinkedListNode head, int positionFromTail) {\n SinglyLink...
{ "class_name": null, "func_sign": [ "getNode(llist, positionFromTail)" ], "solution": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\nclass SinglyLinkedListNode:\n def __init__(self, node_data):\n self.data = node_data\n self.next = None\n\nclass SinglyLi...
eJztnU2ubElynDXQDjTTqFFjgjjxH6GVCNAROKB6oEmJgyYgQCDARZAb04qU9pl73Ndd9RrSSJBwiarLrvcybmYei3A3N/+Jf/63//rv/+e/4f/+47/7/I//9D9++a+//sM//umX//CHX8r76zn7/fXzT/n879I//6731/p8/m2ff+fn3/P+2urn3/H59/O6/nld/7yuf143Pq8bn9eNz+vG53Xz87r5ed38vG59Xrc+r1uf1+3P6/bndfvzuv153fm87nxep7cuj9740Ts/Sx/j0Y+mH1M/Pi8vterH0A+taFrRtKJpRdeKrhVdK7pW...
null
1,157
Delete duplicate-value nodes from a sorted linked list
<sub>This challenge is part of a tutorial track by [MyCodeSchool](http://www.youtube.com/mycodeschool)</sub> You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The g...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static SinglyLinkedListNode removeDuplicates(SinglyLinkedListNode llist)" ], "script_name": "SinglyLinkedListPrintHelper", "solution": "Node RemoveDuplicates(Node head) {\n // This is a \"method-only\" submission. \n // You only need to complete this meth...
{ "solution": "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.str...
{ "solution": " // Complete the removeDuplicates function below.\n\n /*\n * For your reference:\n *\n * SinglyLinkedListNode {\n * int data;\n * SinglyLinkedListNode next;\n * }\n *\n */\n static SinglyLinkedListNode removeDuplicates(SinglyLinkedListNode head) {\n ...
{ "class_name": null, "func_sign": [ "removeDuplicates(llist)" ], "solution": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\nclass SinglyLinkedListNode:\n def __init__(self, node_data):\n self.data = node_data\n self.next = None\n\nclass SinglyLinkedList:...
eJztnc1uJUlyZjWAHiRQ64ZwI/xfTzKAOJjFqBfatHrRAgQNBMwDaDkPrHMs4l7+Z14yySSZ6QDNqirrcyZ5T/y4mbuZ/7+//5//9R//4+/+6f/+8S9/+eu//e2Pf1z+2G7+krBt6z/qxktdOr3ArfnmL+vadYxdt5Nu1W26pFOyFV3VNZ0j/NtWv8uaHOHvuyZHJEckRyRHJEckRyRHZEdkR2RHZEdkR2RHZEdkR2RHZEcURxRHFEcURxRHFEcURxRHFEcUR1RHVEdUR1RHVEdUR1RHVEdUR1RHNEc0RzRHNEc0RzRHNEc0RzRHNEd0...
null
22,258
Balanced Forest
Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a *balanced forest*. Being frugal, the data value he...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int balancedForest(List<Integer> c, List<List<Integer>> edges)" ], "script_name": "Solution", "solution": "import java.io.File;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java....
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n Scanner scanner = new Scanner(System.in) ;\n int q =...
{ "solution": "\nimport java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.BitSet;\nimport java.util.Comparator;\nimport java.util.InputMismatchException;\n\npublic class E {\n\tInputStream is;\n\tPrintWriter...
{ "class_name": null, "func_sign": [ "balancedForest(c, edges)" ], "solution": "\nfrom random import randrange\nimport sys\nsys.setrecursionlimit(10**5)\n\ndef r():\n return list(map(int, input().split()))\n\ndef bin_search(arr, pred, lo=0):\n hi = len(arr)\n while lo < hi:\n mid = (lo+hi)//...
eJzsvcuuLMu2ZUUB/mPqFlEiubnby/kFfgCJJVGALFA5ZOGmhISQ+HRGa9187X1uppBAFCisvHl22IoZYeFubo/x6H30//O//O//6//uv/ov/of//V/+l3/8h//4r//y3/78S/v1j3Fdv/7Rru///fxp/mn+af5p/mn+af5p/mn+af5p/mn+af5p/mn+af5p/mn+af5p/mn+af5/0/z1j/Zz85/n1z/un85/xq9/PD+T/6xf/+g/m/+8v/4x6lv+t/36x/xpt/+tb62f1v1vfW//tOl/65vvT9v+9yXA+3Nfealvt/rJOy/1/Xb/3D0v...
null
14,717
Maximum Element
You have an empty sequence, and you will be given $N$ queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. **Function Description** Complete the *getMax* function in...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> getMax(List<String> operations)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class maximumElement3 {\n\n public stat...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static void getMaxElementFromStack()\n {\n Stack<Integer> stack = new Stack<Integer>();\n Stack<Integer> onlyMaxs = new Stack<Integer>();\n \n Scanner sc = new Scanner(System.in);\n \n ...
{ "class_name": null, "func_sign": [ "getMax(operations)" ], "solution": "stack = []\nmax_stack = []\n\nfor _ in range(int(input())):\n try:\n cmd = input()\n except:\n cmd = '3'\n if cmd[0] == '1':\n n = int(cmd.split()[1])\n stack.append(n)\n if len(max_stack) =...
eJzs/cnKrc2ypQdmQt6EeofdjobXha5EkAFqSKehzlE0ToBACHRbeXc5HjNzf32uHYHIhkBKFns35vevOd/C3dzKYcP+9//Xf/ff/H/+n/+P//f/+o//6d/+03/+93/8t//yj9z/47/lfymp1NVLGv/x3+p//LfCf+p7pDJHbvaf8r+MWdtMqS77/q6zpJwSf+Se+PJY58f2/TZ71heGfaXWNGvRF/ljt75rr5vv/+M//Ms//vV/+U//+j/8+7/+j//9//yf/z2e6nme5zmeR3g+Ppf7x//2H/7lebee/AFrWWXMVur3dmvpt2ske/vd...
null
15,095
Balanced Brackets
A bracket is considered to be any one of the following characters: `(`, `)`, `{`, `}`, `[`, or `]`. Two brackets are considered to be a *matched pair* if the an opening bracket (i.e., `(`, `[`, or `{`) occurs to the left of a closing bracket (i.e., `)`, `]`, or `}`) *of the exact same type*. There are three types of ...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String isBalanced(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n\tpublic static void main(String args[])...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n Scanner sc = new Scanner(System.in);\n try{\n ...
{ "class_name": null, "func_sign": [ "isBalanced(s)" ], "solution": "#! /usr/bin/python3\n\ndef check():\n stack = []\n s = input()\n for c in s:\n #print(c)\n if c == '(':\n stack.append(0);\n elif c == ')':\n if len(stack) > 0 and stack[-1] == 0:\n ...
eJztfcuObTlynQ34Qxo1IgHBQJckt1pzT+2BJzZYhAd2DzRwSYMWYIAg4I/wB3tHrBWMFTx5M/OWurvKpZt5M2+ec/bmMxix4rn/z7/7r//rb/7tvxnru3/48Z/++Y/f/f1vvvv9Dz+2H37sP/w4fvhx/fDj/OHH7e/Yv7aef+P5Wsv+WvbC/rcXDX+2FX/6t12/1vOyDXt7NLvV3hjNm7FP7KPlly676PllHz1XNP/UWjg9N3yKpuxS//I/0YO30XC7j8suYae8Dh/YEHCn9+tzsvYbfrdoekW33rW16+9h0LjOZ2L32SQG5uJ/eX+Y...
null
8,175
Find the Running Median
The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: - If your set contains an odd number of elements, the median is the middle el...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Double> runningMedian(List<Integer> a)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\n\n\n\n\npub...
{ "solution": "import java.util.Comparator;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\n\n/**\n * @author Kanahaiya Gupta\n *\n */\npublic class FindTheRunningMedian {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n PriorityQueue<Integer> highers = new Prior...
{ "solution": "import java.util.*;\nimport java.math.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n PriorityQueue<Integer> min = new PriorityQueue<Integer>(Collections.reverseOrder());\n Priorit...
{ "class_name": null, "func_sign": [ "runningMedian(a)" ], "solution": "import heapq\n\nL,H=[],[]\n\nfor _ in range(int(input())) :\n a = int(input())\n if not H :\n heapq.heappush(H,a)\n else :\n if len(H) > len(L) :\n if H[0] < a :\n b = heapq.heappushpop(H...
eJzs3T2OBLnWHugxtBDhs2Qmef6YWokA9QbkNGRIlpzZ9zhTfFhLkFlAIJwm7+2ul5kZ8QTjnP/3P/23/++//Of/57//n//4H//+z//9v/7jv/7n/1j5+Xz++ffv+Dv+jr/j7/g7/o6/4+/4O/6Ov+Pv+Dv+jr/j7/g7/o6/4+/4O/6Ov+Pv+Dv+jr/j7/g7/o6/4+/4O/6Ov+Pv+Dv+jr/j7/g7/o6/4+/4O/6Ov+Pv+Dv+jr/j7/g7/q8c659/9z//xj//5j//1j//9j//zj//nn/+/f78o/uPf/75+hmwfkasnyHrZ8z6GbR+Rq2f...
null
21,404
Equal Stacks
You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. T...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int equalStacks(List<Integer> h1, List<Integer> h2, List<Integer> h3)" ], "script_name": "Solution", "solution": "/*\n * Code Author: Akshay Miterani\n * DA-IICT\n */\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.math.RoundingMode;\ni...
{ "solution": "import java.util.*;\n\nclass Solution {\n private static Scanner scan = new Scanner(System.in);\n\n public static int equalStacks(HashSet<Integer> h1, HashSet<Integer> h2, HashSet<Integer> h3) {\n SortedSet<Integer> commonItems = new TreeSet<>();\n\n for (var height1 : h1) {\n ...
{ "solution": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Iterator;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.Writer;\ni...
{ "class_name": null, "func_sign": [ "equalStacks(h1, h2, h3)" ], "solution": "def read_stack():\n stack = [int(x) for x in input().split(' ')]\n stack = list(reversed(stack))\n sum_stack = set()\n psum = 0\n for i in range(len(stack)):\n psum += stack[i]\n sum_stack.add(psum)\n...
eJztnb2OLclShTF4kNKxr1DlfyZPgkQjDBgDp7nGXAkJXQkXH14Aj7ck1reiziCGET0SBmJqunO0z+69q7Ii4z9Ta/3Tn/7rv//zn/DfX/xbvPjLf/z2d5+//8OP3/78+lZWu0pv19gfn71c8Tv61a5zrvjD3teeV+vXLno9xnXmNeOf99Xrta+2r1muFh85V+XLZ1zlvla87te5r32uuHaP71Vdr8xrj2vVqw5dps+rxvvzGk0frlfcNO5SdJe44og3it7p+6pbE1j6y+nXuq9Srpjq1G/ZXLheren/8XddgjfjMXhv3LpHbZrZGprK...
null
2,141
Minimum Average Waiting Time
Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int minimumAverage(List<List<Integer>> customers)" ], "script_name": "Solution", "solution": "\nimport java.util.*;\nimport java.io.*;\n\npublic class Solution {\n\n static void go() {\n int n = in.nextInt();\n Customer[] c = new Cus...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n /*\n * Complete the minimumAverage function below.\n */\n static long minimumAverage(int[][] customers) {\n BigInteger currentTime = new BigInteg...
{ "solution": "import static java.util.Comparator.comparing;\n\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintStream;\nimport java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map.Entry;\nimport java.util.NavigableMap;\nimport java.util.PriorityQ...
{ "class_name": null, "func_sign": [ "minimumAverage(customers)" ], "solution": "import heapq\n\nN = int(input())\nTasks = [tuple(int(_) for _ in input().split()) for _ in range(N)]\nTasks.sort()\n\nTotalWaiting = 0\ncurrentTime = 0\ncurrentWaiting = []\n\ni = 0\nwhile i < len(Tasks) :\n\n # No clients, ...
eJx03c3KLUuSJmaBdB3ikOMeLP8zN+srEShBA6kGPUnVoBoEjUAXrQuQhz++UWUJVUFlnTwr9vft9UZ4mD/m4fF//Q//0//9P/73/93//N/+9l/+8a//9d/+9p//+lv+fr+//+P3V/v7P9pf/e//6H+Nv/9j/DX//o/51/r7P9Zf8fd/xF/77//Y30fy+0h9H2m/7zOtfR9q/ftUG9/H2rx/1Po+2OJ+ct9P5v1kfZ/sv++TvX2f7P3+1PF9ss/vk319n+xxP7nvJ/N+sr5Pjt/9Bdv3ydG/T47xfXLM75NjfZ8ccT+57yfzfrK+T87f...
null
14,789
Queries with Fixed Length
Consider an $n$-integer sequence, $A = \{a_0, a_1, \ldots, a_{n-1} \}$. We perform a query on $A$ by using an integer, $d$, to calculate the result of the following expression: $$\huge{\min_{\Large{0 \le i \le n-d}} ( \max_{\Large{i \le j \lt i + d}} a_j )}$$ In other words, if we let $m_i = \max(a_i, a_{i+1}, a_{i+2...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> solve(List<Integer> arr, List<Integer> queries)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n stat...
{ "solution": "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.str...
{ "solution": "import java.util.LinkedList;\nimport java.util.Scanner;\n\npublic class Solution {\n\t\n\tstatic int n, q, d, minOverD, globalMax = Integer.MIN_VALUE;\n\tstatic boolean VERBOSE = false;\n\t\n\tstatic int[] a;\n\tstatic int[] a2;\n\n public static void main(String[] args) {\n Scanner sc = new ...
{ "class_name": null, "func_sign": [ "solve(arr, queries)" ], "solution": "from collections import deque\nimport heapq\nn,q = map(int,input().split())\nl = list(map(int,input().split()))\n\nfor _ in range(q):\n d = int(input())\n q = deque([],d)\n h = []\n for i in range(d):\n \n while l...
eJw8nUuObcuyVJGgIakLDZjxj6AlSNABKk8UoESFpmNj+DqPKzjsvTPXmp8ID3dzM/P/95/+23/+L//xP/z3//uv//lv/+v//O9//de/f7Vv7vk32v/4t/edNs7fXf307299o/X9t9+b8/3tcdu3/uY88+6/sR7/mb2/b/zNbx8+oo+9+t9c63x/4+ttjr++dl/5ibl3v39n5R/73zq75wveGLudvzFPz1/2285Yf+Odll9o+8x8+Rlvfl++fK4z82H5Q/9765x89Jvta/nLkw85/Gnka9u7u598w8yH/63eR39/vZ+vtb93x3h/7/S7...
null
20,577
Super Maximum Cost Queries
Victoria has a tree, $T$, consisting of $N$ nodes numbered from $1$ to $N$. Each edge from node $U_i$ to $V_i$ in tree $T$ has an integer weight, $W_i$. Let's define the cost, $C$, of a path from some node $X$ to some other node $Y$ as the maximum weight ($W$) for any edge in the unique path from node $X$ to node $Y$....
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> solve(List<List<Integer>> tree, List<List<Integer>> queries)" ], "script_name": "Solution", "solution": "import java.awt.*;\nimport java.awt.event.*;\nimport java.awt.geom.*;\nimport java.io.*;\nimport java.math.*;\nimport java.security...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n // Complete the solve function below.\n static long[] solve(final int[][] tree, final int[][] queries) {\n final int edgeCount = tree.length;\n fina...
{ "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.InputMismatchException;\n\npublic class C {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\"...
{ "class_name": null, "func_sign": [ "solve(tree, queries)" ], "solution": "from collections import defaultdict\n\nN, Q = map(int, input().split())\n\nweights = []\n\nfor _ in range(N-1):\n U, V, W = map(int, input().split())\n weights.append([W, U, V])\n \nweights.sort()\n\nclass Node():\n def ...
eJytmtuOHdlSRXngQ1J+bqF1v/AlSBjxAP2AkJoj1EdCQkh8BPwvY8TamXZV+dg+gNtqZ9XOnblWXOacEbH+8y//+19/+Yv48zf/zMXf/vunf/rtD3/8/dNfX5/WNT//lq9y7Vl2qZ9/K1e9apm7JH/frlrrrOXzb+3qV0+pb+6v17jKHn0u75lXL6vuz7/1a12rtly4zjv3PC7/6dw1Zx3jmnOnxiu4ffKEsussflZa2nxYVjy8tDI2a2hrsZ6Vc8314h/WxKez77wuvt92//zbp1+uT7/+2x9+/Yfff/3Hv/+XP/7+2hVr//j303/8...
null
9,056
AND xor OR
Given an array $A[]$ of $N$ distinct elements. Let $M_1$ and $M_2$ be the smallest and the next smallest element in the interval $[ L , R ]$ where $1 \le L < R \le N$. $S_i = (((M_1 \wedge M_2) \oplus (M_1 \vee M_2)) \wedge (M_1 \oplus M_2))$. where $\wedge, \vee, \oplus$, are the bitwise operators $AND$, $OR$ an...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int andXorOr(List<Integer> a)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] a...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int[] arr = new int[N];\n for(int i = 0; i < N; i++){\n arr[i] = sc.nextInt();\n ...
{ "solution": "import java.io.File;\nimport java.io.FileNotFoundException;\nimport java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Solution {\n\t\n\tprivate static final int f(int a, int b){\n\t\treturn (((a&b)^(a|b))&(a^b));\n\t}\n public static void main(String[] args) {\n ...
{ "class_name": null, "func_sign": [ "andXorOr(a)" ], "solution": "n_elements = int(input())\ndata = list(map(int, input().split()))\nassert len(data) == n_elements\n\nres = 0\nminima = [data[0]]\nfor i in range(1, n_elements):\n d = data[i]\n while len(minima):\n x = minima.pop()\n res ...
eJx83c2qbU2XHGY3BL4Ls/jaasycf5nTV2JwgRtyGdz5rEYJBELgS3c8kbvAYHBRUp33nL3Xmj+ZI8eIERHj//4P/8v/8T/9j//D//rf/vF//vM//5d/+8f//PvHeY7vX/75HfN4j28+v+9+5rjW+/ze55vzG8f1m9973edc/nTdz/uev2u+13zO4/md98hH3M/ze9Z3z3zS+K1n3Mca8/yNlV+5vus3nnW841i/+c7n+PIDv+9913Gv9RvHzMc+X/60rnNe4z5/3/k+z3V/+dhrXfdx5k/ncd/rvM/rd1/P+53X6efG91zXmr/7zFW/...
null
8,938
No Prefix Set
There is a given list of strings where each string contains only lowercase letters from $a-j$, inclusive. The set of strings is said to be a **GOOD SET** if no string is a prefix of another string. In this case, print **GOOD SET**. Otherwise, print **BAD SET** on the first line followed by the string being checked. ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static void noPrefix(List<String> words)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\nclass Trie\n {\n boolean EOS;\n Trie[] C;\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Trie {\n\n private static final int ALPHABET_SIZE = 26;\n\n class Node {\n \n Node[] edges;\n char key;\n int wordCount = 0;\n int prefixCount = 0;\n \n Node(char key) {\n this.key =...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n \n private static class Trie {\n \n private class TrieNode {\n public boolean terminates = false;\n public TrieNode[] nextNodes = new TrieNode['j' - 'a' + 1];\n }\n \n priv...
{ "class_name": null, "func_sign": [ "noPrefix(words)" ], "solution": "class solution:\n def checkSET(self, strs):\n trie = dict()\n for cstr in strs:\n curr = trie\n for ch in cstr:\n if ch not in curr:\n curr[ch] = dict()\n ...
eJwknEmuLcuVXNXIhoZBcA6CMjWPBATodryuw+syOzl02T4kCfzP9+49J8J9b7Nl7h7x3//2f//xn//zf/y///qn+8oc//w///jn//73//hff1/9mJj5fe9Nyxwz377t/n06Od1qcbfH4lsw3H6jJmb0l/O4YXh17+J/H5eG3eNGyEnttLK3V38SPy9u6CeYr7queO/HXcP9vj0t6Ux8XxL47Z7C/UJQqY0tdC+1sL/PiPzifUEWx94Wo9c+5XUj28ZO8nmr2P6+p/VQXJSkpZxZiWmjZbko3cw32RaOR6a8Ysxc+zIu9JzdePMv6DaF...
null
12,860
Kindergarten Adventures
Meera teaches a class of $n$ students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from $1$ to $n$ in the *clockwise* direction. This means that the students are numbered $1, 2, 3, \ldots, n - 1, n$, and students $1$ and $n$...
hackerrank
Medium
{ "class_name": null, "func_sign": [ "static int solve(int[] t)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanne...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int n = input.nextInt();\n int[] t = new int[n];\n TreeSet<Node> set = new TreeSet<Node>();\n for(int i=0; i<n...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\tFastScanner in;\n\tPrintWriter out;\n\n\tclass Event implements Comparable<Event> {\n\t\tint time;\n\t\tint add;\n\n\t\tpublic Event(int time, int add) {\n\t\t\tsuper();\n\t\t\tthis.time = time;\n\t\t\tthis.add = add;\n\t\t}\n\n\t\tpu...
{ "class_name": null, "func_sign": [ "solve(t)" ], "solution": "import sys\nn = int(sys.stdin.readline())\nt = [int(x) for x in sys.stdin.readline().split()]\n\ncurrent_available = 0\nbecome_unavailable = [0] * (3 * n)\nbest_index = 1\nbest_result = 0\nfor i in range(2*n):\n el = t[i % n]\n become_una...
eJykvUuSK82yNUQDo80Qyv4RRHi8GQlm0MaMDkYDWnQYOr5WSOkuz1Bqn0vj6n6ndpWkzIzw8Md6/L///f/8P/5v/8N/97/8P//tf/8//s//+//6b//T338rU2b5X/8PSbn2P/6Pz9da6/yTNlL++Lm0tuqfjF6Of5VWrh8/ybVK+8ultfk3u758fkhfp3fZnzRzE/1L/SLvn5eZ+p+k9DeLvP8wS17XL4xRxl/Puf/ljL+TnMf4k5qz/mJZNXxam3rteo29Hj4/z5Tb5zcaPX9eQO41fb2A/dr0c98/6K2931FWr/paerrefNX8/b1q...
null
3,654
Jim and the Skyscrapers
Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers h...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int solve(List<Integer> arr)" ], "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.Comparato...
{ "solution": "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.str...
{ "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n\npublic class Solution {\t\n\tBufferedReader reader;\n StringTokenizer tokenizer;\n PrintWriter out;\n \n\tpublic void solve() throws IOException...
{ "class_name": null, "func_sign": [ "solve(arr)" ], "solution": "n = int(input())\nhs = map(int, input().split())\n\nhhs = sorted(enumerate(hs), key=lambda t: (t[1], t[0]))\n\nprev = list(range(-1, n-1))\nnext = list(range(1, n+1))\nfirsti, firsth = lasti, lasth = hhs[0]\nblock_len = 1\ns = 0\nfor i, h in ...
eJztnc2ubEt6Vd1A4jWWqm2hmPEfPAkSF9GAatC5uFGWkBASDwHPySswR0zbZXTvkV2ipCqXomKfG7XOiZw7M8aXmesba//8z3/1v//1//mr+79/91f+P//+v//mv/z8N3/7u9/82+83p9Sfflb53sf7eB9/0g/+o/fxPt7Hn/Sj8J/6Pt7H+/gTfvz082/++vvNb//b3/z2P/3ut//5P/7Xv/3d352y1nlUiv/5f/z194/OZDX3Tz/XMeppn/+0Ob7Zz1nnW73tOb9dS13t025lfmPPM/tXtXrf396z1umn/v3fN8qe7Xxtr1081XHG...
null
15,870
Heavy Light White Falcon
Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with $N$ nodes and each node's value is initially $0$. The problem asks you to operate the following two types ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> solve(List<List<Integer>> tree, List<List<Integer>> queries)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solutio...
{ "solution": "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.str...
{ "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 Main\n{\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{...
{ "class_name": null, "func_sign": [ "solve(tree, queries)" ], "solution": "def segtree_init(ary):\n ary = list(ary)\n seg = [ary]\n while len(ary) > 1:\n if len(ary) & 1: ary.append(0)\n ary = [max(ary[i],ary[i+1]) for i in range(0,len(ary),2)]\n seg.append(ary)\n return seg\ndef seg...
eJxk3UmuJEHTNlSEGLCMT/8K0s2tyWQlSLABJogBjJiwJzZIVfjxqFdiUrqquuGVzePRnXCz/+d/+J//3//+f/zv/pf/+7/9b//7//F//Z//7X/6r//2/Xw+/5V//vhf//fPf62/f8TfP/bfP/LvH/X3j/77x/z94/v3j9/zy2eTZ5v1bLSerdaz2Xq2W8+G69lyPZuuZ9t4to3z/z3bxrNtPNvGs20828azbTzbxrPtfrbdz7b7vNhn2/1su59t97Ptfrbdz7b72TafbfPZNp9t87zTZ9t8ts1n23y2zWfbfLatZ9t6tq1n23q2rfMx...
null
1,361
Almost Equal - Advanced
A Sumo wrestling championship is scheduled to be held this winter in the _HackerCity_ where _N_ wrestlers from different parts of the world are going to participate. The rules state that two wrestlers can fight against each other if and only if the difference in their height is less than or equal to K, (i.e) wrestler...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static List<Integer> solve(List<Integer> h, List<List<Integer>> queries)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.C...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n static int nn;\n static int block;\n static int[] fenwick;\n static long cnt = 0;\n\n static class B implements Comparable<B> {\n int l;\n int r;\n int id;\n \n @Override\n public int compareTo(B o) {\n in...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n static int nn;\n static int block;\n static int[] fenwick;\n static long cnt = 0;\n\n static class B implements Comparable<B> {\n int l;\n int r;\n int id;\n \n @Override\n public int compareTo(B o) {\n in...
{ "class_name": null, "func_sign": [ "solve(h, queries)" ], "solution": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\nimport bisect\n\n#\n# Complete the 'solve' function below.\n#\n# The function is expected to return an INTEGER_ARRAY.\n# The function accepts following p...
eJzs3UuuNcuXJHQaNZCtbFfDPV4ewUiQSIkGZINOUo0qCQkhMQlmxaCwn/n5o6SkatADiazMuvd+3zl7R/hjPWzZsvW//bv/5n//P/7df/Xf/i//9D/+63/4T//xn/7r3z+9928933jmd81//tf7PdY31nP8zvdZ93N89+++r/N5v9/5rHHd57p+x3jO87m+5/ed87iu716/8/re/NR7/r53znuc6/w9476+eT4zv/uc93U85+9e73tfYz6/97jPd+Yrftd7rTWPsX7vWMfKo4zfvO7nfsf5/Y7rXPc5jjuf9857XfmU+c7jvOY8f+cY...
null
1,769
Almost sorted interval
Shik loves sorted intervals. But currently he does not have enough time to sort all the numbers. So he decided to use *Almost sorted intervals*. An *Almost sorted interval* is a consecutive subsequence in a sequence which satisfies the following property: 1. The first number is the smallest. 2. The last number is the ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int solve(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\nimport java.math.BigInteger;\nimport java.io.OutputStream;\ni...
{ "solution": "import java.util.Scanner;\nimport java.util.Stack;\nimport java.util.ArrayList;\n\npublic class Solution {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int[] ar = new int[n];\n for (int i = 0; i < n; i++) {\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n InputReader in = new InputReader(System.in);\n int N...
{ "class_name": null, "func_sign": [ "solve(arr)" ], "solution": "import bisect\nimport itertools\nN = int(input())\nais = [int(x) for x in input().split()]\nintervals = []\ncur_interval = []\ncur_height = 0\ntotal_sequences = 0\nfor i, ai in enumerate(ais):\n if ai < cur_height:\n merged = True\n wh...
eJx8ncuubUuSVGnAfyxluxrxfvAjIJESDSgkOgmNKgkJIfHpxBg2bwnpklBk3pvn7L3WfER4uJubmf/vf/3v/8u/+zf/6j/8z7/817/993/+p7/8299f1mx//Vub/Tdm+fW9fnXO9+/nN+r9tdV/dY/fbO8/a//G2b/Wfr3O96PtV8f9rTF+fczfKu8j3o+2959ay2/O+uutvl99//p+rN3ffv///VBdv3H5vvd571/HeV/DZ7Zf6++fu/za+4XR1q+f+avvq2t/X/uuqvfffp9az6/e9xNl/tr7pn7Pb473E3e/K3lX8y6mvx97/2nz...
null
15,822
Coolguy and Two Subsequences
Coolguy gives you a simple problem. Given a $1$-indexed array, $A$, containing $N$ elements, what will $ans$ be after this pseudocode is implemented and executed? Print $ans \ \% \ (10^9+7)$. //f(a, b) is a function that returns the minimum element in interval [a, b] ans = 0 for a -> [1, n] for b ...
hackerrank
Hard
{ "class_name": "Result", "func_sign": [ "public static int solve(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays...
{ "solution": "import java.io.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Scanner;\n\npublic class CoolguyAndTwoSubsequences {\n final static int constant = 1000000007;\n\n public static ...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class WeekOfCode19qD {\n\n\tpublic static void main(String[] args) {\n\t\tInputReader in = new InputReader(System.in);\n\t\tPrintWriter w = new PrintWriter(System.out);\n\n\t\tint n = in.nextInt();\n\t\t\n\t\tint a[] = new int[n];\n\t\tfor(int i = 0; i <...
{ "class_name": null, "func_sign": [ "solve(arr)" ], "solution": "def smart():\n left = [0] * (n + 2)\n right = [0] * (n + 2)\n singles = pairs = 0\n ans = 0\n def remove(k):\n nonlocal singles, pairs\n s = k * (k + 1) // 2\n singles -= s\n pairs -= (k+2)*(k+1)*k*(...
eJzsvbuudE2SnidD0HUUfnuMPB94G3IEqAEaZBt0fo7RAxCgCOjS9Ty5W9KOarVJQ1J0zvR8Ubtqrcw4vPFGZK41//v/+L/8b//z//Q//K//9Y//9Oe//tvf/vh3nz96KeUvf9ZPLe8/n3X3aoj/1wdntXPbrw/GarPtXx+s3u+8vz+4k09+fXDPmHP8+qCvcWv4xh6tl18fzD3PWL8/mKvP3xObpYzawl3avP3XB3vWen/P9OzSwjRuOWGxbXDfsJJVTg+z6OP+nlYfavD3PTpr+X3TXfZcvy962ujt9we7nxXXuksvYWmjzfDBHhjq...
null
5,641
Find Maximum Index Product
You are given a list of $N$ numbers $a_{1}, a_{2}, \ldots, a_{n}$. For each element at position $i$ ($1 \le i \le N$), we define $Left(i)$ and $Right(i)$ as: $Left(i)$ = closest index j such that j < i and $a_j>a_i$. If no such j exists then $Left(i)$ = 0. $Right(i)$ = closest index k such that k > i and $a_k>a_i$....
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int solve(List<Integer> arr)" ], "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.InputMism...
{ "solution": "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.str...
{ "solution": "\n\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\n/**\n *\n * @author Chameera\n */\npublic class FindMaximumIndexProduct {\n\n public static void main(String[] args) throws IOException {\n java.io.BufferedReader in = new java.io.BufferedReader(new java.io.InputStreamReade...
{ "class_name": null, "func_sign": [ "solve(arr)" ], "solution": "def lefts(L):\n left = [];\n maxes = [];\n for i in range(len(L)):\n while maxes and L[maxes[-1]] <= L[i]:\n maxes.pop();\n if not maxes: left.append(-1);\n else: left.append(maxes[-1]);\n maxes...
eJyU3b3ObU2SHGYZMnQHcjfGplG1av3qSgSoARnSGHJaNIYAAUGALl3xRJ0WCM58pMhho0+f8757r5+qrMzIiMj/57//n4//8X/47/6X/+uf/o+///v/8C//9D/9/ul459/+/s13fe9zHL/vPI9zzPv9He95n+O4zt8a73rO+T2/eeXfnzGe3/se73tf8/md33ese53X75zPOObI7z7HPK53zu93vucxn/kcv3Wea733+/3meb/juN/5O84580nj+t1zjvl89/Gbx/vc38yfjvdYuYLv+D3fXOub3/B3Mxc47t97vtd95IJ+93XlSt9c...
null
9,828
Simple Array Sum
Given an array of integers, find the sum of its elements. For example, if the array $ar = [1,2,3]$, $1 + 2 + 3 = 6$, so return $6$. **Function Description** Complete the *simpleArraySum* function in the editor below. It must return the sum of the array elements as an integer. simpleArraySum has the following p...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int simpleArraySum(List<Integer> ar)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(Str...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n static long sum=0;\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint T=sc.nextInt();\n\t\tlong [] a=new long[T];\n\t\tfor(int i=0;i<T;i++){\n\t\t\ta[i]=sc.nextLong();\n\t\t\t\n\t\t\tsum+=...
{ "class_name": null, "func_sign": [ "simpleArraySum(ar)" ], "solution": "n = int(input())\nnums = list(map(int, input().split()))\nsum = 0\nfor num in nums:\n sum += num\nprint(sum)\n", "template": "#\n# Complete the 'simpleArraySum' function below.\n#\n# The function is expected to return an INTEGER....
eJzsvcuubktynWcDfpCFarMxM2de9SQGXIAaEhvqlNQgAQGCAD+2m57j+2Id0i6WIMPyBbBBHh7us9f6/3nJjIwYMcaI//l/+B//l/bf/3f/03/607/7y3/4x3/407/6+dP7rj//pbWfe9rPbs/P2f1n9fNz5vq5a/yc96ef71/z+/f7s+b4meP+3L1+2p0/s+WvfvrtP+P7kH7Pz3x+3u8Xxv1+6pnf577fT3//7s9PX+tnfx809vszv+9b7/dp6/v39yljj+8L+s+7+k/L73yfsZ/v59f8aXP+jHd/X7F/3vf89O8K8jlttu/3v+sd...
1
8,781
A Very Big Sum
In this challenge, you are required to calculate and print the sum of the elements in an array, keeping in mind that some of those integers may be quite large. **Function Description** Complete the *aVeryBigSum* function in the editor below. It must return the sum of all array elements. aVeryBigSum has the followin...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static long aVeryBigSum(List<Long> ar)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[]...
{ "solution": "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.str...
{ "solution": "import java.util.Scanner;\n\npublic class BigSum {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int N = scanner.nextInt();\n long sum = 0;\n while (N-- > 0 ) {\n sum += scanner.nextInt();\n }\n System.ou...
{ "class_name": null, "func_sign": [ "aVeryBigSum(ar)" ], "solution": "input()\nprint(sum(map(int, input().split())))", "template": "#\n# Complete the 'aVeryBigSum' function below.\n#\n# The function is expected to return a LONG_INTEGER.\n# The function accepts LONG_INTEGER_ARRAY ar as parameter.\n#\n\nde...
eJydnUuubkt2lSnQCGosZRmheD9oCRIXUQAXqFxcMBISQqIR0Aeayfi+2IlsHd+0DciZec7Z+//XipgxH2OOOeJ//vP//S//zz/z//3bf5H/8e/++5/+8+9//V//5k//5vvTvO2330+99at9rFVvn/ere9+yWp3162d99e59yhxzfq2Mvu88q319N/5cxzqzlvO1thu/2U/Z7eZ/ntO/Pko+ueY/7urlm/s7JR848tft8tern/nVeUc+N3/99VvGlw/ZX21z7bFm73m0Wc+6fZzv3lP56FN7HmV8+e7B57VxzzolD1B3/oqPGv3kk8/u...
null
8,662
Diagonal Difference
Given a square matrix, calculate the absolute difference between the sums of its diagonals. For example, the square matrix $arr$ is shown below: 1 2 3 4 5 6 9 8 9 The left-to-right diagonal = $1 + 5 + 9 = 15$. The right to left diagonal = $3 + 5 + 9 = 17$. Their absolute difference is $|15 - 1...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int diagonalDifference(List<List<Integer>> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static vo...
{ "solution": "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.str...
{ "solution": "import java.util.Scanner;\n\npublic class DiagonalDifferernce {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in); \n\t\tint n ;\n\t\tint diag1 = 0 ; int diag2 = 0;\n\t\tn = Integer.parseInt(in.nextLine());\n\t\tfor(int i =0 ; i < n; i++){\n\t\t\tString str[] = in.n...
{ "class_name": null, "func_sign": [ "diagonalDifference(arr)" ], "solution": "N=int(input())\ngrid=[]\nfor i in range(0,N):\n lists=[int(i) for i in input().split()]\n grid.append(lists)\ncount=0\nsum1=0\nsum2=0\nj1=0\nj2=N-1\nwhile(count<N):\n sum1=sum1+grid[count][j1]\n sum2=sum2+grid[count][...
eJzs/cuuLU2SpAd2A/0gjhzTAbe7WT8JAQbQg+4acPKTgyJAgCDAGR+Hr9iu8on6OpGZUZVV5IhIRJ78z9l7Lb+YqelFVFT1f/t//bf/x//+//x//Hf/yz/993/9j//Tf/yn//f1T/Nvfz3X3Nfd3z/jue46rnvWv/11vz+Mf/br/enu7wfa3/56P/T+4P3xfn8WXyp/+yu+FB954uelXq3/7a+4SHzn/cz7k/fnbf3tr1mv3q5e3n/1q63r+af/5vqn//A//4//4f/7H//D/+//8z/8T//Rj/T87a9/+l//m+uPhxzjvc17cf3f+92r...
1
8,654
Plus Minus
Given an array of integers, calculate the ratios of its elements that are *positive*, *negative*, and *zero*. Print the decimal value of each fraction on a new line with $6$ places after the decimal. **Note:** This challenge introduces precision problems. The test cases are scaled to six decimal places, though answer...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static void plusMinus(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.DecimalFormat;\n\npublic class Solution {\n\n public static void main(String[] args) {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n Scanner in = new Scanner(S...
{ "class_name": null, "func_sign": [ "plusMinus(arr)" ], "solution": "T=int(input())\nlists=[int(_) for _ in input().split()]\np=0\nm=0\nz=0\nfor ele in lists:\n if(ele>0):\n p+=1\n else:\n if(ele<0):\n m+=1\n else:\n z+=1\np=p/T\nm=m/T\nz=z/T\nround(p,3)\nro...
eJztWMFuHDcM7aE/0D8gfM4YIkWJUv6itwB10UPrQy9uDg5QoAjQj2j+t+9Rs0m8WY9jBC1yyMysZ1czkqjHx0fKf3//7tUP3+Xx6kd8+emvq9/vXr+5v3opV95u7rY2ZZtdNi1FNu8yXJrjZ8jWuqjMkl+2wfeGdPyMyrciZOCq4k104CH7q/QqW3WpKltHl2Z4MqU1fEVTC9EphsY+1ju44ZljJElbvORjTj9v7q5eyNXtn69vf72//e2XP97c75aXaz87bu7KdXt4dLYVjPH2hXy8aiwaE6gU0YMJrOWQ/MOvZ4PQttlk1rXCNnJ5...
3
23,074
Birthday Cake Candles
You are in charge of the cake for a child's birthday. You have decided the cake will have one candle for each year of their total age. They will only be able to blow out the tallest of the candles. Count how many candles are tallest. **Example** $candles = [4, 4, 1, 3]$ The maximum height candles are $4$ units h...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int birthdayCakeCandles(List<Integer> candles)" ], "script_name": "Solution", "solution": "/*\n * PDPM IIITDM Jabalpur\n * Asutosh Rana\n */\n\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\npublic class Main\n{\n static long MOD =...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'birthdayCakeCandles' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts INTEGER_ARRAY candles as parameter.\n */\n\n public static int birthdayCakeCandles(List<Integer> ca...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n \n int n = in.nextInt();\n int max = 0;\n int sum = 0;\n int num;\n for(int i =0; i < n; i++){\n ...
{ "class_name": null, "func_sign": [ "birthdayCakeCandles(candles)" ], "solution": "N=int(input())\nV=list(map(int,input().split()))\nprint(V.count(max(V)))", "template": "#\n# Complete the 'birthdayCakeCandles' function below.\n#\n# The function is expected to return an INTEGER.\n# The function accepts I...
eJzsvcuubEuSXaeG9B+B266Gvx/8DXUEKAE2yGywk6xGFkCCIKBP1xzD45QECPqD4GKdPHefHSvWcje3x7RpZv/X//p//O///X/7X/7P//HXf/nHv/7bP//6D5+/1hh/+8eZp84zPqutsWb77F7KauUzb923zU8bfdSb/+2rtFE/545T1vzUucsc57PvnPvWTx+nzfze6C23KZ8199n18rnWJv+dj8/+ufnl0vvnjFXqyPedPXbL52u7c7Xc/+ZGuX/+2G19+rp77/6pfbfSx6fd3HWXfG+d/Uz+9+QLPmedek797LrWrvnv0vds+f6V...
null
8,649
Time Conversion
Given a time in [$12$-hour AM/PM format](https://en.wikipedia.org/wiki/12-hour_clock), convert it to military (24-hour) time. Note: - 12:00:00AM on a 12-hour clock is 00:00:00 on a 24-hour clock. - 12:00:00PM on a 12-hour clock is 12:00:00 on a 24-hour clock. **Example** - $\text{s = '12:01:00PM'}$ Re...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String timeConversion(String s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n \tpublic static void main(String[...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String dt = sc.next();\n char ap = dt.charAt(dt.length() - 2);\n dt = dt.substring(0, dt.length() - 2);\n if (ap ...
{ "class_name": null, "func_sign": [ "timeConversion(s)" ], "solution": "ins = input().strip()\n\nis_pm = ins[-2:].lower() == 'pm'\ntime_list = list(map(int, ins[:-2].split(':')))\n\nif is_pm and time_list[0] < 12:\n time_list[0] += 12\n\nif not is_pm and time_list[0] == 12:\n time_list[0] = 0\n\nprin...
eJyFk70KwjAURh36ICVzkdyb/ti7+QCCo6DioB1ctEMLggiObi76vsYmBYnJTelQ0nP48t2m9+T9TCbDtXroh/VVHE9t3wlKhawoL0nK5WJzElkqmkvb7LvmsDv3nUWgNoi4ZemvWVJREyBnzgzimCAJKwIuE9EgbiZSUeg3XGZuENfUJSQBzMPmiPz3zL9D4kyLeDIrQta0iGsqAhXJtIhr6vqKELgJlQZxTSCs9TKXaRH3e6I+HfrmTGmQgMntFoMmxDMhbEYy/aY+zkXNZw5IwOQzfeawj0hP8E5oXOYylX+2EO05IgGT+7PVaG5f...
null
30,508
Grading Students
HackerLand University has the following grading policy: * Every student receives a $grade$ in the inclusive range from $0$ to $100$. * Any $grade$ less than $40$ is a failing grade. Sam is a professor at the university and likes to round each student's $grade$ according to these rules: * If the difference between t...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> gradingStudents(List<Integer> grades)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public stati...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n for(int a0 = 0; a0 < n; a0++){\n ...
{ "class_name": null, "func_sign": [ "gradingStudents(grades)" ], "solution": "#!/bin/python3\n\nimport sys\n\n\nn = int(input().strip())\nfor a0 in range(n):\n x = int(input().strip())\n \n if x >= 38:\n if x % 5 > 2:\n while x % 5 != 0: x += 1\n print(x)\n", "template": "#\...
eJx1jj0OwjAMhRk4yFPmCtVxnB+uQhADdGAJHVoJqULiAIxwNgYug1MYWPBmv/d98nX5eC0+c3tuJnMs/TiYNQzHXGIL9hCCFxDBEkjg0MInUKi7RDgPj6hpiyTwAUoFAodKiUNyiIyU4Bgc60WFwc4FLUs1iVVNLqaB6c59tx+6w+40Dt9XrCaXBj/PuVwCV1yFzP/BmdzeV29EYDfo
null
22,477
Number Line Jumps
You are choreographing a circus show with various animals. For one act, you are given two kangaroos on a number line ready to jump in the positive direction (i.e, toward positive infinity). - The first kangaroo starts at location $x1$ and moves at a rate of $v1$ meters per jump. - The second kangaroo starts at locat...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String kangaroo(int x1, int v1, int x2, int v2)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static vo...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int x1 = in.nextInt();\n int v1 = in.nextInt();\n i...
{ "class_name": null, "func_sign": [ "kangaroo(x1, v1, x2, v2)" ], "solution": "#!/bin/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\n#\n# Complete the 'kangaroo' function below.\n#\n# The function is expected to return a STRING.\n# The function accepts following parameters:\n# ...
eJyVkz9LA0EQxS3yQR5XB9nZ+bMz9rZa2CgqFprCJkmRgCCC2Nnr93UIEQVzeLtwyxb32zdv3uzr7PN9drRbl295uH4eHpfr7WY4waDaAsLNYFIcZuLDHMPiab243ywe7lbbzf7Ps/Ob5fAyxy+Y3QQhiRUNaBhPZwuaBMGN8lScRsir04s/qIgLvKZkMy6oWf50Xa0kqOSGRtagbHU6bFqzWi4CCwtUL9PZCgJjzOfBDhGo5OqBWjSQUSDCFK7a0dfyLdcjSJUhmp1sHl2VkibDnCFSRMY5OgIH2FQKV0uTiUqwdMiWnc38umzulPbt...
null
32,335
Breaking the Records
Maria plays college basketball and wants to go pro. Each season she maintains a record of her play. She tabulates the number of times she breaks her season record for *most points* and *least points* in a game. Points scored in the first game establish her record for the season, and she begins counting from there. ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> breakingRecords(List<Integer> scores)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public stati...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int n = in.nextInt();\n int[] score = new int[n];\n ...
{ "class_name": null, "func_sign": [ "breakingRecords(scores)" ], "solution": "input()\na = list(map(int, input().split()))\nm = M = a[0]\nx = y = 0\nfor i in a[1:]:\n if i > M:\n M = i\n x += 1\n elif i < m:\n m = i\n y += 1\nprint(x, y)", "template": "#\n# Complete the ...
eJztnUuOLUlShhmwkFCNW8jd/M1KkLiIAdSAyaUH3VJLCAlmLADWwvb4v9/OyefNlgpUarWIap2+kZlxItzN7e1uv/3bX/7Xf/z3X/i/v/l3Xfztv/z0T99/+/vf/fTX10/12/fy02+un37+w29//off/fyPf//Pv//d40/lKt++//Svv7ne3N7K/vY95qljtX712LWMM67Txtit6Dct2ohVrxVzrnrateeodUS9xmhnjlav2s+ubeueMc9qK65Ryllr9quVttcqS986m3tnnNVrOdcss5V61rX6qTFWv/TNuvs519jRe23jGlNXdZyr...
null
30,377
Day of the Programmer
Marie invented a [Time Machine](https://en.wikipedia.org/wiki/Time_machine) and wants to test it by time-traveling to visit Russia on the [Day of the Programmer](https://en.wikipedia.org/wiki/Day_of_the_Programmer) (the 256th day of the year) during a year in the inclusive range from 1700 to 2700. From 1700 to 1917, ...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String dayOfProgrammer(int year)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[...
{ "solution": "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.str...
{ "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 A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "dayOfProgrammer(year)" ], "solution": "y = int(input())\nif y < 1918:\n ftext = \"13.09.{}\" if y & 3 else \"12.09.{}\"\nelif y > 1918:\n ftext = \"13.09.{}\" if (y & 3) or (y % 400 and not y % 100) else \"12.09.{}\"\nelse:\n ftext = \"26.09.{}\"\nprint(ftext.f...
eJytk7EKwjAURR36ISVzKUnaJi8u/oag4qAdXGqHFgQR/Aj9X/Okg7xY72Kmkp7DDTcv9+y5yhbvtab4sbmqU9ePg1rmylpvtp0qctVe+vYwtMf9eRymn6YqdSgZUbci/7CMp3resmwxIixbOZgVEWk1jUdWRKRlKCArItJyDloRkW2QRydkRGbZGjdfp81rDZvXWmZpQhYjf8mKW3g2tJwNQziL0qyArfDFMg5axqUWvOWIpBbNWtZNFqUWmkNGkluGbTCSvJRf1vRS2No9yhcf/zhB
null
25,168
Sales by Match
There is a large pile of socks that must be paired by color. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. **Example** $n = 7$ $ar = [1, 2, 1, 2, 1, 3, 2]$ There is one pair of color $1$ and one of color $2$. There are three...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int sockMerchant(int n, List<Integer> ar)" ], "script_name": "Solution", "solution": "\n import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\nimport java.lang.*;\npublic class Main{\n\tstatic lo...
{ "solution": "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.str...
{ "solution": "\nimport 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 A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "sockMerchant(n, ar)" ], "solution": "from collections import Counter\n\nn = int(input())\nc = Counter(map(int, input().split()))\nans = 0\n\nfor x in c:\n ans += c[x] // 2\n \nprint(ans)", "template": "#\n# Complete the 'sockMerchant' function below.\n#\n# The f...
eJzNlc2KU0EQhV248DGKrAe5Xf3vkyhGFHQWbuIsMiCI4EPo+/qdugYGbu5Adk5nZpJOd3X1OV/V/fXyz6dXL+Ln7TvevP9x+Hp6eDwf3tjB6/GULJkzMqMwKqMxOmMwJiMt8Urx8njl4+lwZ4f77w/3n8/3Xz5+ezz/C5qcr37e2dNz+vHUkuVqvljvlglQbLj1rOg2qxVO7Ypclvg4bSzWpiazktB60hr6su+eXTZHZ11xUf7/xe++an2TOjNul4E9u3vzZmsdxxMSloKJKNgWG8MK4g5L3QqON5suRav+I/5s5iX8SNayDeSuWjgt...
null
22,937
Forming a Magic Square
We define a [magic square](https://en.wikipedia.org/wiki/Magic_square) to be an $n \times n$ matrix of distinct positive integers from $1$ to $n^2$ where the sum of any row, column, or diagonal of length $n$ is always equal to the same number: the *magic constant*. You will be given a $3 \times 3$ matrix $s$ of inte...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int formingMagicSquare(List<List<Integer>> s)" ], "script_name": "Solution", "solution": "/* Programming Competition - Template (Horatiu Lazu) */\n\nimport java.io.*;\nimport java.util.*;\nimport java.lang.*;\nimport java.awt.*;\nimport java.awt.geom...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'formingMagicSquare' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts 2D_INTEGER_ARRAY s as parameter.\n */\n\n public static int formingMagicSquare(List<List<Integer>> s...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n\t\tint[][] m = new int[3][3];\n\t\tfor (int x = 0; x < 3; x++) {\n\t\t\tfor (int y = 0; y < 3; y++) {\n\t\t\t\tm[x][y] = s.nextInt();\n\t\t\t}...
{ "class_name": null, "func_sign": [ "formingMagicSquare(s)" ], "solution": "from itertools import *\n\nX = []\nX.extend(list(map(int,input().split())))\nX.extend(list(map(int,input().split())))\nX.extend(list(map(int,input().split())))\n\nAns = 81\nfor P in permutations(range(1,10)):\n if sum(P[0:3]) ==...
eJyNk01OwzAUhFn0IE9eV4jnJP7hJEgEsYAs2IQuWgkJIXEIOBA7jsVMXpGKSyx340by5zczHr9vPr83F8vv5gt/bl/d07w77N21uCgqwzgH6blE6SSMs9uKm15208N+erx/PuyPe726t62cwF4iqQwqjzNQ8e1wBrxQnfTj7CGgMrkv4ADZibKVZ9CErsNDAUMtYbWRsFCTfVXAYCQS9jxjwFHdKqypgAfz7KEXk3tJFfifycqkOFmZm9Zkh7OrWrb737R9bXIJR8hekgqWdqD1VtnJzHaIOdJzrsguWUTN3agoBycT38iqeUSvTXvi...
null
29,526
Picking Numbers
Given an array of integers, find the longest subarray where the absolute difference between any two elements is less than or equal to $1$. **Example** $a=[1,1,2,2,4,4,5,5,5]$ There are two subarrays meeting the criterion: $[1,1,2,2]$ and $[4,4,5,5,5]$. The maximum length subarray has $5$ elements. **Function...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int pickingNumbers(List<Integer> a)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(Stri...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'pickingNumbers' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts INTEGER_ARRAY a as parameter.\n */\n\n public static int pickingNumbers(List<Integer> a) {\n // Write...
{ "solution": "\nimport 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 A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "pickingNumbers(a)" ], "solution": "#!/bin/python3\n\nimport sys\n\n\nn = int(input().strip())\na = [int(a_temp) for a_temp in input().strip().split(' ')]\n\nfrom collections import Counter\nd = Counter(a)\nbest = 0\nfor i in range(99):\n best = max(d[i] + d[i+1], bes...
eJzdV8tqFFEQdeHab7jMOkhX1X36E+5EMOJCs3AzZpFAQAQ/Qv/Xc05PJEmnW0YcQTM1Taf73rr1OKeq5uvT76+ePdHf65e4efN593F/eX21e5F2zc/3uaQtqb8WS5FKammc7u58vztLu4uby4v3Vxcf3n26vjp44PBg9+Us3XUqn+8NW8f45y6rbkZfuNkRlIbQTMlLKohTTT1STmXwv9H5BsmJnmyk1vm+5lRHipHyYG575o6Ko53ru/EKXdzAdy11T9ADnQWJqC15S7VweeYqZL7w/8gwHxsa1AMQWBNUZsaX0GVaTQcjhfHAOvHk...
null
1,308
Utopian Tree
The Utopian Tree goes through _2_ cycles of growth every year. Each spring, it _doubles_ in height. Each summer, its height increases by _1_ meter. A Utopian Tree sapling with a height of *1* meter is planted at the onset of spring. How tall will the tree be after $n$ growth cycles? For example, if the number of grow...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int utopianTree(int n)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\n\npublic class Solution\n{\n\tpublic static void main(Stri...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int numCases = in.nextInt();\n for (int i = 0; i < numCases; i++) {\n int n = in.nextInt();\n int answer ...
{ "solution": "import java.util.Scanner;\nimport java.util.Vector;\n\npublic class Solution {\n public static void main(String[] args) {\n Scanner stdin = new Scanner(System.in);\n int numCases = stdin.nextInt();\n Vector<Long> cache = new Vector<>();\n cache.add(1L);\n for (int ...
{ "class_name": null, "func_sign": [ "utopianTree(n)" ], "solution": "#!/usr/bin/env python\n\nimport sys\n\n\nif __name__ == '__main__':\n T = int(sys.stdin.readline())\n \n for _ in range(T):\n N = int(sys.stdin.readline())\n height = 1\n \n for i in range(N):\n ...
eJzFVktOwzAQZcGCY1RZV8jjGf84CRJBLKALNqGLVkJCSBwCzsSOMzFju43zcVpWVI48ieL5vHlv0o/Lr5+ri/i7/Wbj7q157rb7XXOzanzbGb6saju0bQfAO9u8GV6qWa+azet287jbPD287Hf5FCiHjsBrbDsN5MijJccHNGnPO2j2ZY1BdqL5lvjOgfLe8oHmfb0aZiDR1exWiV/GhGEKJ29H4SGHMiEhYaQMzt5I/Zy3QSmLLzgjl6MtUBYYHW1xhNY7FQTpg8nhtfWEhiTqweTggKTBOe16004qsDlpn4rI8NXSLVOZbaOdAjgJ...
null
6,024
Angry Professor
A Discrete Mathematics professor has a class of students. Frustrated with their lack of discipline, the professor decides to cancel class if fewer than some number of students are present when class starts. Arrival times go from on time ($arrivalTime \le 0$) to arrived late ($arrivalTime \gt 0$). Given the arrival ti...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String angryProfessor(int k, List<Integer> a)" ], "script_name": "Solution", "solution": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\n\npublic class AngryProf {\...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution implements Runnable {\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\t\n\tstatic void solve() throws Exception {\n\t\tint t = nextInt();\n\t\tfor (int tt = 0; tt < t; ++t...
{ "class_name": null, "func_sign": [ "angryProfessor(k, a)" ], "solution": "t = int(input())\n\nfor _ in range(t):\n\tn, k = map(int, input().split())\n\tarr = list(map(int, input().split()))\n\n\tcnt = 0\n\tfor x in arr:\n\t\tif x <= 0:\n\t\t\tcnt += 1\n\tif cnt >= k:\n\t\tprint(\"NO\")\n\telse:\n\t\tprint...
eJztnc2OLUuSlRnwIKEad6Dwf3fmTGHABEQiBtCDniQ9qJaQEFLPeAF4Ml4It28tjzy3+t5bt0Cthq7sW6fPPpl7x45wN7efZcvM/vaf/s///r/+Cf/3b/52v/h3//V3f/X513/z+9/98+t36eOzXPnjMz3P5T8fn7/7i+t3f/lf/vov/+Pv//I//Yf//De/93v/7b/41/t3/+0vrp9+PtV6rbavM6871yu1a6xrtOte67pru3q/7jKuuX/S9ss0rnvU6577t63sf199/yZ+m/bn9w9Kvu79o7EvV3XJuX9ax7WeK+crXWu/oew3l3Xl...
null
13,489
Save the Prisoner!
A jail has a number of prisoners and a number of treats to pass out to them. Their jailer decides the fairest way to divide the treats is to seat the prisoners around a circular table in sequentially numbered chairs. A chair number will be drawn from a hat. Beginning with the prisoner in that chair, one candy will b...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int saveThePrisoner(int n, int m, int s)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main...
{ "solution": "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.str...
{ "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 A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "saveThePrisoner(n, m, s)" ], "solution": "for _ in range(int(input().strip())):\n n,m,s = map(int, input().strip().split(\" \"))\n print(((s-2+m)%n)+1)", "template": "#\n# Complete the 'saveThePrisoner' function below.\n#\n# The function is expected to return an...
eJyVlU2KHEcQhb3wwsdIei1EZPxm+CQCjfHCnoU2LS1GIDACH8LGO51VXzYemOnpGlBV01XVlZHx4r0X0X///O+3X366HO/+4+b9X6cP50+fH06/jpPenTVXhLSN6lSz6jladXnYfqcdwtdQ6yypqcPKI1vr7nx6M073Xz7d//Fw/+fvHz8/PO6ZmR6ed+fps0qkT1/fjOdJi0Ui4ULW0BVtNgIcS1fymkfvFTXSXCxDakQCw1Yfps1wStHwu7OVzlydV3knb2a3h/qYIikeQtlmqeWH+87ZUSp+tRkBO6HOKT3S06dmy4A4uFmkStE0...
null
127
Find Digits
An integer $d$ is a *divisor* of an integer $n$ if the remainder of $n \div d = 0$. Given an integer, for each digit that makes up the integer determine whether it is a divisor. Count the number of divisors occurring within the integer. **Example** $n = 124$ Check whether $1$, $2$ and $4$ are divisors of $1...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int findDigits(int n)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args){\n...
{ "solution": "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.str...
{ "solution": "import java.util.*;\nclass Solution\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner in=new Scanner(System.in);\n\t\tint t,ans,d;\n\t\tlong n,m;\n\t\tt=in.nextInt();\n\t\twhile(t-->0)\n\t\t{\n\t\t\tans=0;\n\t\t\tn=in.nextLong();\n\t\t\tm=n;\n\t\t\twhile(m!=0)\n\t\t\t{\n\t\t\t\td=(int)m%10...
{ "class_name": null, "func_sign": [ "findDigits(n)" ], "solution": "def func(A):\n return len([1 for i in str(A) if i !='0' and A%int(i)==0])\n\nfor t in range(int(input())):\n print(func(int(input())))", "template": "#\n# Complete the 'findDigits' function below.\n#\n# The function is expected to ...
eJx9VkGOHDcMzMGX/GIxZyMgRVIk85IAmcAHZw+5THxYAwECA3lE8pjc8rQUpZGnPTPd6saullJTRbJY2r/e/fPf99+N8dO/mPz85+m3y6fPb6cfX052vnTNTNLU84WNO/5IP18MKxHKzEZYaWrSLUjOl9P7l9PrH59eP769/vrh989vN09tvD5+nr68f9mc088XtRbkylSOTZhcGKcbU7QIOG5NgjIZVuWUaNpg9bRwF9o9GHsK+jh1Tu7OZkDjFthggGGMfUytgiKFVSlhDs6ydwksSPMehQ1Bw1hYK7beWLFqABZRTjTMe/lJZ2tH...
null
26,066
Append and Delete
You have two strings of lowercase English letters. You can perform two types of operations on the first string: 1. *Append* a lowercase English letter to the end of the string. 2. *Delete* the last character of the string. Performing this operation on an empty string results in an empty string. Given an integer, $k$,...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String appendAndDelete(String s, String t, int k)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static ...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n String s = in.next();\n String t = in.next();\n int...
{ "class_name": null, "func_sign": [ "appendAndDelete(s, t, k)" ], "solution": "#!/bin/python3\n\nimport sys\n\n\ns = input().strip()\nt = input().strip()\nk = int(input().strip())\n\nlead = 0\nfor i in range(min(len(s),len(t))):\n if s[i] != t[i]:\n lead = i\n break\n else:\n lea...
eJyVVEnOXjUQZBFxjl/fOkJkIAkcIusgXoQ8z+3ZbRtFyiHgvliIBRJE5HlheeHu6q6q7s/P/tjffvPX+VDP45ffHgZSb4+fnh4B4gXnmmtf8OL7x/Onh5hJsCb4r7G3v3/9LOoFj0/Pn/4RGUdZOKgH0QunlJHkNl3+AjHjaBHZIh4Nas356hUb1NwbXvD2zQ2QfvIFw/EU+eLtjbhygTtQr26EAKcVMcrEtBYtDwtszV7HcF1pInmKfQYhdY5ETlG6RlrsBTrJ0GvOF7x69wW09/FfYAkULCDWNN38lE7bOhbQCIzm83tT4B6pGUXj...
null
2,040
Sherlock and Squares
Watson likes to challenge Sherlock's math ability. He will provide a starting and ending value that describe a range of integers, inclusive of the endpoints. Sherlock must determine the number of *square integers* within that range. **Note**: A square integer is an integer which is the square of an integer, e.g. $1,...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int squares(int a, int b)" ], "script_name": "Solution", "solution": "//package contest;\n\nimport java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static vo...
{ "solution": "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.str...
{ "solution": "import java.util.Scanner;\nclass Solution\n{\npublic static void main(String[] args)\n{\n\tScanner sc=new Scanner(System.in);\n\tint t=sc.nextInt();\n\tfor(int h=0;h<t;h++)\n\t{\n\tint m=sc.nextInt();\n\tint n=sc.nextInt();\n\tint count=0;\n\tint sq=(int) Math.sqrt(m);\n\tint a=sq*sq;\n if(a<m)\...
{ "class_name": null, "func_sign": [ "squares(a, b)" ], "solution": "#!/usr/bin/env python\n\nimport sys\n\n\nif __name__ == '__main__':\n T = int(sys.stdin.readline())\n \n for _ in range(T):\n A, B = list(map(int, sys.stdin.readline().split()))\n\n nA = int(A**0.5)\n nB = int...
eJydl0uOI0UURRmwAJYQqnELRbxPfFgJEoUYQA+YFAy6BRICsQjYL+eG01aVyy4a3K3K63RmvBf3/W78+fnff3zx2f58/Qvgm98efnz6+eOHh6/Kw3h8GrOPFtNbOVBfj0+rzbbGrKMcyNvjk63ahrc5ii2bM/n3+BS15gjLLCfkrfLkrB5u2YtNtz75+fGpZ5/TvM7SO7f5ys2xLGdducpY0Zr1hvWHd+Xh/a8/v//+w/sfvvvp44fDWRauemNfJq631mXr4fd35dmelva0WCh9lBPqFffbwGcsz3JCPrWM5zQLLycwWdAjYSLTyoFW...
2
8,656
Library Fine
Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is as follows: 1. If the book is returned on or before the expected return date, no fine will be charged (i.e.: $fine = 0)$. 2. If the book is return...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int libraryFine(int d1, int m1, int y1, int d2, int m2, int y2)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n ...
{ "solution": "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.str...
{ "solution": "\nimport java.util.Scanner;\n\nclass Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int d2 = sc.nextInt(), m2 = sc.nextInt(), y2 = sc.nextInt();\n int d1 = sc.nextInt(), m1 = sc.nextInt(), y1 = sc.nextInt();\n if (y2 > y1)...
{ "class_name": null, "func_sign": [ "libraryFine(d1, m1, y1, d2, m2, y2)" ], "solution": "def fine(actual, expected):\n if actual[2] > expected[2]:\n return 10000\n elif actual[2] == expected[2]:\n if actual[1] > expected[1]:\n return 500 * (actual[1] - expected[1])\n ...
eJyVkzFOBDEMRSn2IFbqFYqdOIk5CRKDKGAKmmGLXQkJIXEIuB4d98Ce0axWG41mkspFnr//T/y1+/nb3Yzn/leLhw/3OhxOR3cHDgUIsPjQDQEiYM5auT24/v3QPx/7l6e303G+6/W4zz1c8Ap7IPbZeLSKm3gsgAgSUjdQAW3hKS42qMQJClCJOjIlYKDMzerqPyNpg2i9MmKb/Tz698k6kAZIWZYDrOSjDo0s3SBjGwqymU32WiVpWFkHRwllu6woEYrvBsxztYCGig36SFTMJHkLrwi1Rc6QNDDUh7oot06eGmDkKzqg/dCJPlcL...
null
1,957
Cut the sticks
You are given a number of sticks of varying lengths. You will iteratively cut the sticks into smaller sticks, discarding the shortest pieces until there are none left. At each iteration you will determine the length of the shortest stick remaining, cut that length from each of the longer sticks and then discard all t...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> cutTheSticks(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n\tstatic void solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint[] a = new int[n...
{ "solution": "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.str...
{ "solution": "import java.io.*;\n\npublic class Solution{\n \n public static void main(String[] args)throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int N = Integer.parseInt(br.readLine());\n String[] str=br.readLine().split(\" \");\n ...
{ "class_name": null, "func_sign": [ "cutTheSticks(arr)" ], "solution": "#!/usr/bin/env python\n\nimport collections, sys\n\n\nif __name__ == '__main__':\n N = int(sys.stdin.readline())\n a = sorted(map(int, sys.stdin.readline().split()))\n \n c = collections.Counter(a)\n count = [c[k] for k ...
eJztncuOZElShlnwIK5ej5DfL+zZ8QBINGIBvWDTzGJGGgkh8RDwvthn5naOR2RmVXXPdE0uorIiI+Icv9jNL+c3M8//+dv/+8c//o3++6d/kA///F8//MfPv//jH374+/DD+PHnHI6fH3/+4Xfhh5/+9Puf/u0PP/37v/7nH/9wF/zhv38XjqopxkjtEloYIaWQSkjyYYVcQl6hpFBGqCnUEuoITcqt0FPoI4wURgljhVnCXGFJrSj1ozQQ+bykOfmc5XOhXd7lWpVXk+9Nvne5Ly2lQadyfcr1xUu+094SMoSmDC3STs6QJZ+lnSw0...
null
24,548
Repeated String
There is a string, $s$, of lowercase English letters that is repeated infinitely many times. Given an integer, $n$, find and print the number of letter `a`'s in the first $n$ letters of the infinite string. **Example** $s=\text{'abcac'}$ $n = 10$ The substring we consider is $abcacabcac$, the first $10$ charac...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static long repeatedString(String s, long n)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(St...
{ "solution": "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.str...
{ "solution": "\nimport 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 A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "repeatedString(s, n)" ], "solution": "s = input().strip()\nn = int(input().strip())\nL = len(s)\nprint(s.count('a') * (n//L) + s[:n % L].count('a'))", "template": "#\n# Complete the 'repeatedString' function below.\n#\n# The function is expected to return a LONG_INTEG...
eJzFVMmq5TYUfISQ/MbjrpsgT5KdLwnkNo2twRqswbJkWQ4N+Yjur80mek0vAs59cBch3mjhU1KdOlXnzx+//vDzy7fvt79+enn5/Y+bMC6G26+vt22bhBWTOkedBdZB8JHZKSW27ZbRFB1RCz/EtBw0SRuIE+d6jIySke+rHKklh0hOiyCm2SrD5CENP6zT1OEwxrupKwDbCjZ9N9zN7cPrjR6O4kDJJxvDdxJV04AG9nXblpLPH17/wW+8m+ox7lK+GDc7ssxqLrgBDaCtmu4hHlzwfs/7nNxhLVPzQfbIeRQML/lQJ3NJS7vvpPSX...
null
20,832
Jumping on the Clouds
There is a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. The player can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus $1$ or $2$. The player must avoid the thunderheads. Determine the mini...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int jumpingOnClouds(List<Integer> c)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(Str...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static InputReader in;\n private static PrintWriter out;\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.n...
{ "class_name": null, "func_sign": [ "jumpingOnClouds(c)" ], "solution": "#!/bin/python3\n\nimport sys\n\n\nn = int(input().strip())\nc = [int(c_temp) for c_temp in input().strip().split(' ')]\n\nres = 0\ni = 0\nwhile i < n-1:\n if i+2<n and c[i+2] == 0:\n i = i+2\n res += 1\n else:\n ...
eJy1VctuwjAQ5NALf2H5jCpvHoA5cuMPkKDqoc2BS8ohSEhVJT6C/m8Jj9bJeFyHBxYkgWW8szO73j19z/q942s+PdwsPvWqXG8qPVHaJsvSKKNEGeW7tp+av7tP7ZgmAqJJMAb/ATnogdLFdl28VcX768emOjPKzbLUXwPlkExGfyS7vNkWkuEWxx1YPISLMaeUHr1iK3zDitdBpCbtqTSDAITcNO0apo0mdo3ks3g4n9pHrYQyR0d0NO8ERiCwObpoaN16MqahdmMpsyjhkSTtFGtmzSXtOOHutbqixhHMhmiKX35MS2yNlI8ohoKV...
null
21,555
Equalize the Array
Given an array of integers, determine the minimum number of elements to delete to leave only elements of equal value. **Example** $arr = [1, 2, 2, 3]$ Delete the $2$ elements $1$ and $3$ leaving $arr = [2, 2]$. If both twos plus either the $1$ or the $3$ are deleted, it takes $3$ deletions to leave either $[3]...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int equalizeArray(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(Str...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class A {\n\n\tBufferedReader br;\n\tPrintWriter out;\n\tStringTokenizer st;\n\tboolean eof;\n\n\tvoid solve() throws IOException {\n\t\tint n = nextInt();\n\t\tint[] a = new int[101];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x = nextInt();\n\t\t\ta...
{ "class_name": null, "func_sign": [ "equalizeArray(arr)" ], "solution": "n = int(input())\na = list(map(int, input().split()))\na = sorted(a)\n\nans = n - 1\n\nfor i in range(n):\n j = i\n while j < n and a[i] == a[j]:\n j += 1\n ans = min(ans, n - (j - i))\n\nprint(ans)\n", "template": "...
eJztlj2uJEUQhDEwOURq7BXq+q/iJEgMwoBn4Axr7EorISQOAWfB42x8ET3LDtvTEnhr8OZNq6e6ujIyMzIyf/389z+/+Mx/X//BzTc/X368vX775vJVXPK43mqPESnF2iKtWC3KFitHjzSjRNNiXdFajBatRo1cIm8xR/Qefeh5L5F40i+v4vLy7vXL929efvjup7dv3lup19vll1fxYLj26y33mJyzoizZ4p/jMbJSZK6cv0XFVrbZGYttAyuRgTO1AZjgWjV61XV1HVVY7HJIN7zOmZuOnUWAc4wZ1dtLF/B8ArqWA+iSrre0ReHo...
null
3,179
ACM ICPC Team
There are a number of people who will be attending [ACM-ICPC World Finals](https://en.wikipedia.org/wiki/ACM_International_Collegiate_Programming_Contest). Each of them may be well versed in a number of topics. Given a list of topics known by each attendee, presented as binary strings, determine the maximum number of t...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> acmTeam(List<String> topic)" ], "script_name": "Solution", "solution": "import java.math.BigInteger;\nimport java.util.*;\nimport java.io.*;\n\npublic class Solution {\n static void go() {\n int n = in.nextInt();\n int ...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\n\npublic class Solution\n{\n static int max_pair =0;\n static int max_count = 0;\n public static void main(String []args)\n {\n Scanner sc = new Scanner(System.in);\n ...
{ "class_name": null, "func_sign": [ "acmTeam(topic)" ], "solution": "def gp():\n d = [ int(v) for v in input() ]\n c = len( [ v for v in d if v == 1 ] )\n return( c, d )\n\ndef merge( p1, p2 ):\n count = 0\n for i in range(len(p1)):\n if p1[i] == 1 or p2[i] == 1:\n count +=...
eJzsvU2PLDlyJfoWb/nWsy7UujGgdavUkn7JAG8ALaReaNPqRTcgQBAwP33qZtDOOfZBOj0yMm/eVrPqZrjzw8xoNDtmZER4/J//93/9z//x//0///9//vxvf/zTX/788z/99PMvP9n//uPj/+F/f/7NTz//4T/+9Id/+fMf/vWf//0vf55df238x5//6zc/yejf/fT3vw76tYxfh4238uvrr3fDlmR++XVEIvPbn+wxzkjD3m5tTef3lc4vv/vpd1MQGw8xfv3feP0QjIz81fzemT94+5+HKLPfY8KxDLl8jGfVSD1dUcpfy1RgaXqT...
null
5,705
Taum and B'day
Taum is planning to celebrate the birthday of his friend, Diksha. There are two types of gifts that Diksha wants from Taum: one is black and the other is white. To make her happy, Taum has to buy $b$ black gifts and $w$ white gifts. - The cost of each black gift is $bc$ units. - The cost of every white gift is $wc...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static long taumBday(int b, int w, int bc, int wc, int z)" ], "script_name": "Solution", "solution": "\nimport java.util.Scanner;\n\npublic class Solution {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t@Suppress...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution \n{\n private static long cost( long B,long W,long X,long Y,long Z )\n {\n long cost = 0;\n \n if( X < Y )\n {\n cost = cost + ( B * X );\n if( Y < Z + X )\n {\n ...
{ "solution": "/* HackerRank Template v0.25 by Sergey Esipenko */\nimport java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.fill;\nimport static java.util.Arrays.sort;\n\npublic class Solution implements Runnable {\n\t/* START OF SOLUTION */\n\t\n\tprivate static final...
{ "class_name": null, "func_sign": [ "taumBday(b, w, bc, wc, z)" ], "solution": "t = int(input())\nfor _ in range(t):\n b, w = map(int, input().split())\n x, y, z = map(int, input().split())\n print(b * min(x, y + z) + w * min(y, x + z))\n", "template": "#\n# Complete the 'taumBday' function belo...
eJyll0GOHEcORWfhC8wNAr02BmQwGEH6JAZGAy88WsymxwsZMGAY8CHsA3jnY/r9bMlWl1StGaggNaoyIyPIz/8/mT9/8evvf//b9fn6N77888eH/zx+9/2bh6/Gw3n1eGofXxU23NrbkmtVtjOre1RtyzrBtz0tvZrbMW3zq/doL+/Dai525mmLGNNOrzmbb21+wovb285Zey8fa1f03j1fPXJzc+qpsYyD18w1PGKF5epXjx214+Ti9l61/Zx69TjLWDAzx7bIebg69gn23u1sWce7+9jYuatmGAFnL3NCnsRGOkTgI8rtzJXEdnpm...
null
4,187
Bigger is Greater
<!-- **Please note that this is a team event, and your submission will be accepted only as a part of a team, even single member teams are allowed. Please click [here](https://www.hackerrank.com/auth/create_team/csindia) to register as a team, if you have NOT already registered.** --> _[Lexicographical order](https://...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static String biggerIsGreater(String w)" ], "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.Input...
{ "solution": "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.str...
{ "solution": "\n\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Solution {\n\tpublic static void main(String args[]) {\n\t\tint testcases;\n\t\tScanner scan = new Scanner(System.in);\n\t\ttestcases = scan.nextInt();\n\t\tfor (int i = 0; i < testcases; i++) {\n\t\t\tString str = scan.next();\n\...
{ "class_name": null, "func_sign": [ "biggerIsGreater(w)" ], "solution": "#!/usr/bin/env python3\ncases = int(input())\nfor x in range(cases):\n\tstring = list(input().strip())\n\tmatch = False\n\tfor x in range(len(string)-2,-1,-1):\n\t\tif string[x+1] > string[x]:\n\t\t\tmatch = True\n\t\t\tfor y in range...
eJy8/VuuJjnSrgf2RQ9k47/WhbbU2tjQSBroAho8OM900nkmBQE9CY1Bdz25noBe87UiK1dWRmZE/ZmdhcqMWIfP3Umj2fsYjeb/n//7//H//f/9395//p//J/7w//rf/sPeubf/+F//y3/81//lH/fd/3GzZ9UYqrp21I/eW/7j1iuuneL4x83v8rjEn+k4y+NRy3gXjDusZ6Hd1ieyvfxmwZ3nxNq9lZeQQ7FmPOfcl1qKv1S/RMpPM27kf9xN2UduJuY/7uvR/7jNw6XFfZRu6wphXCIs3cWjmEsx+VlWnvdR8sKdtOH+cQfWncFt...
null
6,715
Modified Kaprekar Numbers
A _modified Kaprekar number_ is a positive whole number with a special property. If you square it, then split the number into two integers and sum those integers, you have the same value you started with. Consider a positive whole number $n$ with $d$ digits. We square $n$ to arrive at a number that is either $2\time...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static void kaprekarNumbers(int p, int q)" ], "script_name": "Solution", "solution": "import java.util.Scanner;\n\npublic class Kaprekar {\n\tpublic static void main(String args[]) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint p = cin.nextInt();\n\t...
{ "solution": "import java.util.Scanner;\n\npublic class Solution {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int p = scan.nextInt();\n int q = scan.nextInt();\n scan.close();\n \n boolean foundKaprekar = false;\n for (int...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n private static InputReader in;\n private static PrintWriter out;\n\n public static void main(String[] args) throws IOException {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out, true);\n int p = in.nex...
{ "class_name": null, "func_sign": [ "kaprekarNumbers(p, q)" ], "solution": "low = input()\nhi = input()\n\ndef is_kaprekar_number(num):\n square = str(num*num) \n mid = len(square)//2\n \n num1 = 0\n try: \n num1 = int(square[0:mid])\n except:\n pass\n \n num2 = 0\n try: \n num2 = int(sq...
eJydU7FKBEEMtbgPCVsfMpPJzCR2B4ocyBUWIrhicW5hs15xB4IIfoT+oZ0/YbJaHMMNh5Nis7u89/KSzLzPPr9nJ1PcfunL3Wv3NG522+4MukjJcT9akn7s5tANL5thvR0eH5532z/QcnWzuFqew/VidXnRvc1hT4AYWZmaxDcJZPKsDjSJa3TAMjkQ1yYQCBH7UVPKTQLsPKd+ZIeB2lpI0esMKGWXmgS8F/OOkTJWBXwORIAW5Q5SYnXO6ClU6VmDy7pRy4lFlYaSIbsAirHaATAjA0l0EJ0+sn6DaRtCYM/k9JeBMcUEEj36CSKl...
null
45,345
Halloween Sale
You wish to buy video games from the famous online video game store Mist. Usually, all games are sold at the same price, $p$ dollars. However, they are planning to have the seasonal Halloween Sale next month in which you can buy games at a cheaper price. Specifically, the first game will cost $p$ dollars, and every su...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int howManyGames(int p, int d, int m, int s)" ], "script_name": "Solution", "solution": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io...
{ "solution": "DNE", "template": "class Result {\n\n /*\n * Complete the 'howManyGames' function below.\n *\n * The function is expected to return an INTEGER.\n * The function accepts following parameters:\n * 1. INTEGER p\n * 2. INTEGER d\n * 3. INTEGER m\n * 4. INTEGER s\n ...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static int howManyGames(int p, int d, int m, int s) {\n // Return the number of games you can buy\n int price = p;\n int k = 0;\n whi...
{ "class_name": null, "func_sign": [ "howManyGames(p, d, m, s)" ], "solution": "p,d,m,s=map(int,input().split())\ni = 0\ncost = p\nwhile s-cost>=0:\n i+=1\n s-=cost\n cost = max(cost-d,m)\nprint(i)", "template": "#\n# Complete the 'howManyGames' function below.\n#\n# The function is expected to r...
eJyVk89qwzAMxnfogwify5DkP7H2GD2tdKWHLYdduh5SKIxCH2J738lJDwNb2RJsE3B+fNL3KbfV93b1MD7PG33Zfbr34+k8uCdwAgQJOHTp5ejW4PrLqX8d+rfDx3m4fxKI9O66hl8YQ8dKSspkcnqJFUjgi6IJpQYRlWCT4JpABK1OT4pocnVTQZWUi8mbUNdoibFU6IFZZtS6WOsVMxgSBrG7yzk3LAmLLYGyiiloFykitSseQbQ3SB5tXzi3gktlRuwBqbWm5EQWBlew+I/2cmw4czdmkRyU34bs1Kgx+FONujiITYZG2qU+FVzq...
null
1,104
Chocolate Feast
Little Bobby loves chocolate. He frequently goes to his favorite $\text{5 & 10}$ store, Penny Auntie, to buy them. They are having a promotion at Penny Auntie. If Bobby saves enough wrappers, he can turn them in for a free chocolate. **Example** $n = 15$ $c = 3$ $m = 2$ He has $15$ to spend, bars cost $3...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static int chocolateFeast(int n, int c, int m)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(...
{ "solution": "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.str...
{ "solution": "import java.util.*;\nclass Solution\n{\n\tpublic static void main(String args[])\n\t{\n\t\tScanner in=new Scanner(System.in);\n\t\tint t,n,c,m,ans=0,w=0;\n\t\tt=in.nextInt();\n\t\twhile(t-->0)\n\t\t{\n\t\t\tn=in.nextInt();\n\t\t\tc=in.nextInt();\n\t\t\tm=in.nextInt();\n\t\t\tans=(int)(n/c);\n\t\t\tw=an...
{ "class_name": null, "func_sign": [ "chocolateFeast(n, c, m)" ], "solution": "#!/usr/bin/env python\n\nimport sys\n\n\nif __name__ == '__main__':\n T = int(sys.stdin.readline())\n \n for _ in range(T):\n N, C, M = list(int(x) for x in sys.stdin.readline().split())\n \n total =...
eJydVcuOG0cM9CEHfwahs2E036S/JIAV5JDswRfZhzVgIDFgwL/g/K+Lo93AkDQy4DnsaLqbZLFY1fvlt/++vnyxPb//ix9v/zm8O334+Hh4Q4c8njqWBrGqkjabH09W0otYooU4k+V4SuNq8uQsEua2OdVrUbEZSWliRU1EidkE+URsDoUz4rqM1GrZlEMVcltclBGFeodXdHj49OHhr8eHv/98//HxGRvq6vHEx1McT4MBvw+fX9EP8BsbXOpk5U6RhmNtokW8ZCmJ9UK8GboY3AvA3JA0FlCSiDijxUBYRNvgMi8yB9DKoCjwEKiS...
null
3,305
Cavity Map
You are given a square map as a matrix of integer strings. Each cell of the map has a value denoting its depth. We will call a cell of the map a _cavity_ if and only if this cell is not on the border of the map and each cell adjacent to it has _strictly smaller depth_. Two cells are adjacent if they have a common side,...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<String> cavityMap(List<String> grid)" ], "script_name": "Solution", "solution": "\nimport java.io.*;\nimport java.math.*;\nimport java.util.*;\n\nimport static java.util.Arrays.*;\n\npublic class Solution {\n\tprivate static final int mod = (int...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\n\npublic class Solution {\n\tstatic BufferedReader in;\n\tstatic PrintWriter out;\n\tstatic StringTokenizer tok;\n\t\n\t\n\tstatic void solve() throws Exception {\n\t\tint n = nextInt();\n\t\tchar[][] a = new char[n][n];\n\t\tfor (int i = 0...
{ "class_name": null, "func_sign": [ "cavityMap(grid)" ], "solution": "n = int(input())\n\nmaplist = []\nfor i in range(n):\n maplist.append(list(input()))\n\nfor i in range(1, n-1):\n for j in range(1, n-1):\n c = maplist[i][j]\n t = maplist[i-1][j]\n l = maplist[i][j-1]\n ...
eJztnUuuHUmWXSVAA0lkuyCk/c00kg2IghpSNtShqlEFFCAI0CA0Io1Cw9Fex93v9fs+ZISKrIqINDIzyPfedfPzP2bbnWf/r3+n//N//+2/+Y//48//7evf/+M//Pk//OnP+S9fvo5cVipjtuHfefbaUv3ydY7Ry5o55VLWSin5J1++plHzyMs/XKnV2upsyyukXnsvbaSavNZa/ptX6HX0OVoaqfSVm9cp/myLi6qXHj3Xnv3ry9daS2k9rd57a6P3nKrX9X9zn5Zn5DFrTWmN5nVXrtO38/V81qsWf3dY1NJH7aWU3EvtrftudRWL...
null
2,336
Manasa and Stones
Manasa is out on a hike with friends. She finds a trail of stones with numbers on them. She starts following the trail and notices that any two consecutive stones' numbers differ by one of two values. Legend has it that there is a treasure trove at the end of the trail. If Manasa can guess the value of the last stone...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static List<Integer> stones(int n, int a, int b)" ], "script_name": "Solution", "solution": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigInteger;\nimport ja...
{ "solution": "import java.util.*;\n\npublic class ManasaandStones {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int t = sc.nextInt();\n while(t-- > 0) {\n int n = sc.nextInt();\n int a = sc.nextInt();\n int b = sc.nextIn...
{ "solution": "import java.util.Scanner;\n\npublic class Solution {\n public static void main(String[] args) {\n Scanner stdin = new Scanner(System.in);\n int numTestCases = stdin.nextInt();\n for (int i = 0; i < numTestCases; i++) {\n int numStones = stdin.nextInt();\n i...
{ "class_name": null, "func_sign": [ "stones(n, a, b)" ], "solution": "T = int(input())\n\nfor test_case in range(T):\n n = int(input())\n a = int(input())\n b = int(input())\n s = set()\n for i in range(n):\n s.add(b*i + (n-i-1)*a)\n print(' '.join(map(str, sorted(s))))", "templa...
eJx0vcuudTuzZYUEDzJ1yhSG7zZPgsSWKEAWqGwoJBISQqLGg/Ii9Nbi2/85QsqjzBXb/5rDn9eY3eGI7rj83//Nf////j//9X/1P/yf//a//P2//e//+d/+u9+/nb/+Pqv99XfL/7/z48fOjz7++nt8/NfJj3HuX3+/tfKx9/76u588tW4+PGf+q20+cvNE6/ncfZtfzHxuZ7iYYM/89t/+29+//af/43/7T//Tf/5P//P/+L/+7//5zwpuX9/vfef93vvur31nnF9ra+9f6+OtXxu9z1+b3xr5eW//tXVa+7W95vdrZ+z3a7e9PPu+...
null
22,185
Strange Counter
There is a *strange counter*. At the first second, it displays the number $3$. Each second, the number displayed by decrements by $1$ until it reaches $1$. In next second, the timer resets to $2 \times \text{the initial number for the prior cycle}$ and continues counting down. The diagram below shows the counter values...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static long strangeCounter(long t)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n public static void main(String[] arg...
{ "solution": "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.str...
{ "solution": "\nimport 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 A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n...
{ "class_name": null, "func_sign": [ "strangeCounter(t)" ], "solution": "t = int(input())\n\nt1 = 3\nwhile(t1 < t):\n t -= t1\n t1 *= 2\n \nprint(t1 - t + 1)", "template": "#\n# Complete the 'strangeCounter' function below.\n#\n# The function is expected to return a LONG_INTEGER.\n# The function ...
eJyNU0tKREEMFPQgj14Pkl/n40kEFRf6Fm7GWbwBQQQPobdy54VsxcWQR4bJqumuSqqS9PvF5/f52V9cf43DzWt72u72S7uamvPttm2mNr/s5odlfrx/3i//T4jtbTMdYLuVWLaENSixJAmrqiIaJaEHushKDUSA+RH5QWyadTmDUW1arBP6yo04ARB009qW0xAa0inX1N9bJ+ksdV1EZg7o6ont7EyhgSXXjGjYEk5MZK8nhpJN1gVy4iM7k5C14dykevw5J9arhZSwVJtaSa215qzST84ap/cK4SDqvkmQ2vgOqkPW3cflDwghJP8=
null
44,591
3D Surface Area
Madison is a little girl who is fond of toys. Her friend Mason works in a toy manufacturing factory . Mason has a 2D board $A$ of size $H \times W$ with $H$ rows and $W$ columns. The board is divided into cells of size $1 \times 1$ with each cell indicated by its coordinate $(i, j)$. The cell $(i, j)$ has an integer $...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static int surfaceArea(List<List<Integer>> A)" ], "script_name": "Solution", "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static int surfaceArea(in...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n static int surfaceArea(int[][] A) {\n // Complete this function\n int[][] b = new int[A.length+2][A[0].length+2];\n for(int i=1; i<=A.length...
{ "class_name": null, "func_sign": [ "surfaceArea(A)" ], "solution": "#!/bin/python3\n\nimport sys\n\ndef surfaceArea(A):\n # Complete this function\n ans = 0\n #print(A)\n for i in range(len(A)):\n for j in range(len(A[0])):\n for dx, dy in [(-1,0), (0,1), (1,0), (0,-1)]:\n ...
eJztnc2uJDkRhVnwHli9YIVQ2g7/8SRINGIBs2DTsBgkJITEkgeA9yXOF86ZgXtrZgAJcsDj7tt1qzJtx+85EU7V/On7f/3hn7/Hfz/9gb/42R8+/PrTb3/3+YefpA/lSuX6+ClfV8rfZvil58Jz4bkw5Q8/Sh8++/1vP/vl55/96he/+d3nO6JyGf3jpw9//FH6SpjVVD9+WispztaKeItfv/L2ywlLeTMhAau7v+Vmnz6OIE8bR5CnjSPI08YR5GnjCPK0cQR52jiCPG0cQZ42jiBPG0eQp40jyNPGEeRp4wjytHEEedo4gjxtHEGe...
null
4,504
Almost Sorted
Given an array of integers, determine whether the array can be sorted in ascending order using only one of the following operations one time. 1. Swap two elements. 2. Reverse one sub-segment. Determine whether one, both or neither of the operations will complete the task. Output is as follows. 1. If the array...
hackerrank
Medium
{ "class_name": "Result", "func_sign": [ "public static void almostSorted(List<Integer> arr)" ], "script_name": "Solution", "solution": "import java.io.DataInputStream;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Ha...
{ "solution": "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.str...
{ "solution": "import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[] arr = new int[sc.nextInt()];\n int[] temp = new int[arr.length];\n for (int i = 0; i < arr.length; i++) {\n ...
{ "class_name": null, "func_sign": [ "almostSorted(arr)" ], "solution": "input()\narray = [int(x) for x in input().split(\" \")]\n\nsorted_array = sorted(array)\n\nif array == sorted_array:\n print(\"yes\")\nelse: \n wrong = []\n for i, (a, b) in enumerate(zip(array, sorted_array)):\n if ...
eJyUncuu9kqSlkHiFphbNWbgPEdyJUhsCSGoAZNNi25OQkjcBPdLPE94/dVN0aJqS39sL3922k6nM+Pwxhv/65/9q//9z//pP/nX/+MP/+H3v/nPf/eHf/n8ob/v+9vvbT3tPC2e0Z/Znrmf9T5rPOs80Z6Yz80DRh6x9tN25JH76e0+vbf8N/NfPD3P6ju3z/v0O5/R3mwu/z/z/7M/I5sc6z5jn2ec9YxsY+Rx881rvjv/nWeO8cw8fu71zJM3cnJ/5L6IZ968n7zm6vn/kf8/+S/vbuXv6+bt3rzre5/9rme3/ex+np3X2/vNfz3/...
null
20,055
Super Reduced String
Reduce a string of lowercase characters in range `ascii[‘a’..’z’]`by doing a series of operations. In each operation, select a pair of adjacent letters that match, and delete them. Delete as many characters as possible using this method and return the resulting string. If the final string is empty, return `Empty S...
hackerrank
Easy
{ "class_name": "Result", "func_sign": [ "public static String superReducedString(String s)" ], "script_name": "Solution", "solution": "import java.awt.*;\nimport java.awt.event.*;\nimport java.awt.geom.*;\nimport java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*; \nimport java....
{ "solution": "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.str...
{ "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 A {\n\tInputStream is;\n\tPrintWriter out;\n\tString INPUT = \"\";\n\t\n\tvoid solve()\n\t{\n\t...
{ "class_name": null, "func_sign": [ "superReducedString(s)" ], "solution": "s = input()\nwhile True:\n for i in range(len(s)-1):\n if s[i] == s[i+1]:\n s = s[:i]+s[i+2:]\n break\n else:\n break\nprint(s if s else \"Empty String\")", "template": "#\n# Complete the...
eJy1VUluFTEUZIHENaK/jjgAe07ABgkQ8tye5/azERKHgHuyY0vzISFJfyfkA+1Wy1LXq7KrPHx6+uXbsyfH5/XXrfPmw0G6UMvhxcWB8TUaGHZhxcTB6siCVOKH0OZwuf2GwEhh9L2v5eGKt+7w8fLiBntosGTfvHamAzYV9NLLWMeohQXSwYg8EEPEI8B9ojfhOMWw00cIYUIopf+8MxkswvSedzc+jBGaML20ofSLVyVJJ3Z1gwXkau4ubJNfRAyVRDkcjUl2EJJ40IQPNKKYsP85wU6bUFMGa4MGG0XqaQtBJBWVt4TCkBPBB6r2...
null